Fourier growth of structured mathbb F _2 polynomials and applications

We analyze the Fourier growth of various well-studied classes of “structured”$\mathbb{F}_2$-polynomials . This study is motivated by applications inpseudorandomness, in particular recent results and conjectures due to[CHHL19,CHLT19,CGLSS20] We show that any symmetric degree-$d$ $p$ has $L_1$ Fourier weight at level $k$ and this is tight for any constant $k$.…

Dialogue Object Search

We envision robots that can collaborate and communicate seamlessly with humans . We introduce a new task,dialogue object search: A robot is tasked to search for a target object in a human environment while engaging in a “video call” with a remote human who has additional but inexact knowledge about the target’s location .…

Incentive Compatible Mechanism for Influential Agent Selection

In a self-interested setting, agents may strategically hide some connections to make themselves seem to be more important . In this paper, we study the incentive compatible (IC) selectionmechanism to prevent such manipulations . We propose the Geometric Mechanism, which selects an agent with at least 1/2 of the optimal progeny in expectation under the properties of incentive compatibility and fairness .…

Patterns of Patterns

We introduce Inayatullah’s Causal Layered Analysis (CLA) method from thefield of futures studies into the domain of design patterns . We develop a briefcase study that shows how we have integrated CLA with patterns in acollaborative research project studying the Emacs editor .…

Abstract Reasoning via Logic guided Generation

Abstract reasoning, i.e., inferring complicated patterns from givenobservations, is a central building block of artificial general intelligence . We propose logic-guided generation (LoGe), a novelgenerative DNN framework that reduces abstract reasoning as an optimization problem in propositional logic . LoGe is composed of three steps: extractpropositional variables from images, reason the answer variables with a logiclayer, and reconstruct the answer image from the variables .…

The Optimality of Upgrade Pricing

We consider a multiproduct monopoly pricing model . We provide sufficient conditions under which the optimal mechanism can be implemented via upgradepricing . The first set ofconditions is given by a weak version of monotonicity of types and virtualvalues . The second set of conditions establishes the optimality of upgrade pricing for type spaces withmonotone marginal rates of substitution .…

Cell free Massive MIMO with Short Packets

In this paper, we adapt to cell-free Massive MIMO (multiple-inputmultiple-output) the finite-blocklength framework introduced by \”Ostman et al. (2020) for the characterization of the packet error probability achievable with Massive MimO, in the ultra-reliable low-latency communications (URLLC) regime . By means of numerical simulations, we show that, toachieve the high reliability requirements in URLLC, MMSE signal processing must be used .…

On the Stability Regions of Coded Poisson Receivers with Multiple Classes of Users and Receivers

Motivated by the need to provide differentiated quality-of-service (QoS) ingrant-free uplink transmissions in 5G networks and beyond, we extend theprobabilistic analysis of coded Poisson receivers (CPR) to the setting with multiple classes of users and receivers . For such a CPR system, we prove (undercertain technical conditions) that there is a region, called the stabilityregion in this paper .…

Online Service Caching and Routing at the Edge with Switching Cost

This paper studies a problem of jointly optimizing two important operations in mobile edge computing . The objective function includes both the costs of forwarding requests, processing requests, and reconfiguring edge servers . Simulation results show that our algorithms significantly outperform other state-of-the-art policies, including one that assumes the knowledge of all future request arrivals .…

A Framework for Imbalanced Time series Forecasting

Time-series forecasting plays an important role in many domains, such as wind power, stock market fluctuations, or motor overheating . In some of these tasks, some particular moments often are underrepresented in thedataset, resulting in a problem known as imbalanced regression .…

Towards Global and Limitless Connectivity The Role of Private NGSO Satellite Constellations for Future Space Terrestrial Networks

Satellite networks are expected to support global connectivity and servicesvia future integrated 6G space-terrestrial networks . In the past few years, many such private constellations have been launched or are in planning, e.g.SpaceX and OneWeb to name a few . We show that the link capacity, delay, and handover rate vary across the constellation, so the optimal handover strategydepends on the constellation design .…

Typing assumptions improve identification in causal discovery

Under assumptions about the data-generative process, the causal graph can often be identified up to anequivalence class . Proposing new realistic assumptions to circumscribe suchequivalence classes is an active field of research . In this work, we propose anew set of assumptions that constrain possible causal relationships based on the nature of the variables .…

Hodge theoretic reward allocation for generalized cooperative games on graphs

We define cooperative games on general graphs and generalize Lloyd S.Shapley’s celebrated allocation formula for those games in terms of stochasticpath integral driven by the associated Markov chain on each graph . We then show that the value allocation operator, one for each player defined by thestochastic path integral, coincides with the player’s component game which is the solution to the least squares (or Poisson’s) equation .…

Neural Ordinary Differential Equation Model for Evolutionary Subspace Clustering and Its Applications

In multi-dimensional time series analysis, a task is to conductevolutionary subspace clustering, aiming at clustering temporal data according to their evolving low-dimensional subspace structures . We demonstrate that this method can not onlyinterpolate data at any time step, but also achieve higher accuracy than other state-of-the-art evolutionarysubspace-cluing methods .…

Randomized Online Algorithms for Adwords

The general adwords problem has remained largely unresolved . We define asubcase called $k-TYPICAL, $k \in \Zplus$ as follows: the total budgetof all the bidders is sufficient to buy $k$ bids for each bidder . We also giverandomized online algorithms for other special cases of adwords .…

Distributed Asynchronous Policy Iteration for Sequential Zero Sum Games and Minimax Control

We introduce a contractive abstract dynamic programming framework and relatedpolicy iteration algorithms . These algorithms are specifically designed for sequential zero-sumgames and minimax problems with a general structure . The advantage of our algorithms over alternatives is that they resolve some long-standing convergence difficulties of the “natural” policyiteration algorithm, which have been known since the Pollatschek and Avi-Itzhakmethod [PoA69] for finite-state Markov games .…

MFGNet Dynamic Modality Aware Filter Generation for RGB T Tracking

MFGNet aims to boost the message communication between visible and thermaldata by adaptively adjusting the convolutional kernels for various input images . To address issues caused by heavy occlusion, fast motion, and out-of-view, we propose to conduct a joint local and global search byexploiting a new direction-aware target-driven attention mechanism .…

Improving Polyphonic Sound Event Detection on Multichannel Recordings with the Sørensen Dice Coefficient Loss and Transfer Learning

The S.rensen–Dice Coefficient has recently seen rising popularity as aloss function (also known as Dice loss) due to its robustness in tasks where the number of negative samples significantly exceeds that of positive samples . Conventional training of polyphonic sound event detection systemswith binary cross-entropy loss often results in suboptimal detectionperformance as the training is often overwhelmed by updates from negativesamples .…

CURE Enabling RF Energy Harvesting using Cell Free Massive MIMO UAVs Assisted by RIS

The ever-evolving internet of things (IoT) has led to the growth of numerous wireless sensors, communicating through the internet infrastructure . For extending the lifetime of thesesensors, radio frequency energy harvesting (RFEH) technology has proved to be promising . In this paper, we propose CURE, a novel framework for RFEH that combines the benefits of cell-free massive MIMO (CFmMIMO), unmannedaerial vehicles (UAVs), and reconfigurable intelligent surfaces (RISs) toprovide seamless energy harvesting to IoT devices .…

Copy and Paste method based on Pose for Re identification

Re-identification (ReID) aims at matching objects in surveillance cameras with different viewpoints . But there is noprocessing method for the ReID task in multiple scenarios at this stage . The CPP is a method based on key point detection, usingcopy and paste, to composite a new semantic image dataset in two different semantic image datasets .…

Reproducibility of COVID 19 pre prints

To examine reproducibility of COVID-19 research, we create a dataset of pre-prints posted to arXiv, bioRxiv, medRxv, and SocArXiv . We extract the text from these pre-prints and parse them looking for keywords signalling theavailability of the data and code underpinning the pre-printed .…

What Makes Sound Event Localization and Detection Difficult Insights from Error Analysis

Sound event localization and detection (SELD) aims to unify the tasks of sound event detection and direction-of-arrivalestimation . SELD inherits the challenges of both tasks, such as noise, reverberation, interference, polyphony, and non-stationarity of soundsources . Experimental results indicate polyphony as the main challenge in SELD, due to the difficulty in detecting all sound events of interest .…

Codeathon Activity A Design Prototype for Real World Problems

Avirtual codeathon activity, as part of this learning scheme, was conducted for180 undergraduate students to focus on analysis and design of solutions to real-world problems in the Covid-19 pandemic situation . Activity-based learning helps students to learn through participation, AvVirtual Codeathon activity was conducted by students .…

On the Stability Regions of Coded Poisson Receivers with Multiple Classes of Users and Receivers

Motivated by the need to provide differentiated quality-of-service (QoS) ingrant-free uplink transmissions in 5G networks and beyond, we extend theprobabilistic analysis of coded Poisson receivers (CPR) to the setting with multiple classes of users and receivers . For such a CPR system, we prove (undercertain technical conditions) that there is a region, called the stabilityregion in this paper .…

Did the Cat Drink the Coffee Challenging Transformers with Generalized Event Knowledge

Computational approaches have access to the information about thetypicality of entire events and situations described in language . The evaluation of these models was performed incomparison with SDM, a framework specifically designed to integrate events insentence meaning representations . Our results show that TLMs can reach performances that are comparable to those achieved by SDM .…

FNetAR Mixing Tokens with Autoregressive Fourier Transforms

In this note we examine the autoregressive generalization of the FNetalgorithm . Self-attention layers from the standard Transformerarchitecture are substituted with a trivial sparse-uniformsampling procedure based on Fourier transforms . Using the Wikitext-103 benchmark, FNetAR retains state-of-the-art performance (25.8 ppl) on thetask of causal language modeling .…

Equidistant Linear Codes in Projective Spaces

Linear codes in projective space $mathbb{P}_q(n)$ were first considered by Braun,Etzion and Vardy . We establish that the normalizedminimum distance of a linear code is maximum if and only if it is equidistant . We prove that the upper bound on the size of such class of linear codes is $2^n$ when $q=2$ as conjectured by Braun et al.…