June 2019 arXiv papers — page 3

Pei-Chuan Chen, Erik D. Demaine, Chung-Shou Liao, Hao-Ting Wei

We consider the online traveling salesman problem on the real line (OLTSPL) in which a salesman begins at the origin, traveling at no faster than unit speed along the real line, and wants to serve a sequence of requests, arriving online over time on the real line and return to the origin as quickly as possible. The problem has been widely investigated for mo

Rui Dong, Changyang She, Wibowo Hardjawana, Yonghui Li

In this work, we consider a mobile edge computing system with both ultra-reliable and low-latency communications services and delay tolerant services. We aim to minimize the normalized energy consumption, defined as the energy consumption per bit, by optimizing user association, resource allocation, and offloading probabilities subject to the quality-of-serv

Omid Sadeghi, Maryam Fazel

In this paper, we study a class of online optimization problems with long-term budget constraints where the objective functions are not necessarily concave (nor convex) but they instead satisfy the Diminishing Returns (DR) property. Specifically, a sequence of monotone DR-submodular objective functions $\{f_t(x)\}_{t=1}^T$ and monotone linear budget function

Li-Ming Yu, Wei-Hao Bian, Chan Wang, Bi-Xuan Zhao

Using a compiled sample of 34 broad-line active galactic nuclei (AGNs) with measured H$\beta$ time lags from the reverberation mapping (RM) method and measured bulge stellar velocity dispersions $\sigma_*$, we calculate the virial factor $f$ by assuming that the RM AGNs intrinsically obey the same $M_{\rm BH}-\sigma_*$ relation as quiescent galaxies, where $

Pengxiang Zhang, Joseph Finley, Taqiyyah Safi, Luqiao Liu

Quantitative investigation on the current-induced torque in antiferromagnets represents a great challenge, due to the lack of an independent method for controlling N\'eel vectors. Here by utilizing an antiferromagnetic insulator with Dzyaloshinskii-Moriya interaction, {\alpha}-Fe2O3, we show that the N\'eel vector can be controlled with a moderate external f

Houston Claure, Yifang Chen, Jignesh Modi, Malte Jung

How should a robot that collaborates with multiple people decide upon the distribution of resources (e.g. social attention, or parts needed for an assembly)? People are uniquely attuned to how resources are distributed. A decision to distribute more resources to one team member than another might be perceived as unfair with potentially detrimental effects fo

Omid Sadeghi, Reza Eghbali, Maryam Fazel

In this paper, we study a certain class of online optimization problems, where the goal is to maximize a function that is not necessarily concave and satisfies the Diminishing Returns (DR) property under budget constraints. We analyze a primal-dual algorithm, called the Generalized Sequential algorithm, and we obtain the first bound on the competitive ratio

Alireza Shahsafi, Graham Joe, Soeren Brandt, Anna V. Shneidman

Engineered optical absorbers are of substantial interest for applications ranging from stray light reduction to energy conversion. We demonstrate a large-area (centimeter-scale) metamaterial that features near-unity frequency-selective absorption in the mid-infrared wavelength range. The metamaterial comprises a self-assembled porous structure known as an in

Narayanan Rengaswamy, Robert Calderbank, Swanand Kadhe, Henry D. Pfister

Quantum error-correcting codes are used to protect qubits involved in quantum computation. This process requires logical operators, acting on protected qubits, to be translated into physical operators (circuits) acting on physical quantum states. We propose a mathematical framework for synthesizing physical circuits that implement logical Clifford operators

Joshua A. Grochow, Youming Qiao

In this paper we consider the problems of testing isomorphism of tensors, $p$-groups, cubic forms, algebras, and more, which arise from a variety of areas, including machine learning, group theory, and cryptography. These problems can all be cast as orbit problems on multi-way arrays under different group actions. Our first two main results are: 1. All the a

Weicheng Fu, Yong Zhang, Hong Zhao

Nonintegrability is a necessary condition for the thermalization of a generic Hamiltonian system. In practice, the integrability can be broken in various ways. As illustrating examples, we numerically studied the thermalization behaviors of two types of one-dimensional (1D) diatomic chains in the thermodynamic limit. One chain was the diatomic Toda chain who

Hongwei Wang, Wei Zhang, Junyi Zuo, Heping Wang

We consider the robust filtering problem for a nonlinear state-space model with outliers in measurements. To improve the robustness of the traditional Kalman filtering algorithm, we propose in this work two robust filters based on mixture correntropy, especially the double-Gaussian mixture correntropy and Laplace-Gaussian mixture correntropy. We have formula

Anuradha Gupta, Manu Rohilla

In this paper we derive coincidence and common fixed point results under order homotopies of families of mappings in preordered $b$-metric spaces.

Sohei Iwata, Taishi Kurahashi

It is well known that the propositional modal logic $\mathbf{GL}$ of provability satisfies the de Jongh-Sambin fixed-point property. On the other hand, Montagna showed that the predicate modal system $\mathbf{QGL}$, which is the natural variant of $\mathbf{GL}$, loses the fixed-point property. In this paper, we discuss some versions of the fixed-point proper

Serguei Norine, Robin Thomas

A brick is a 3-connected graph such that the graph obtained from it by deleting any two distinct vertices has a perfect matching. A brick is minimal if for every edge e the deletion of e results in a graph that is not a brick. We prove a generation theorem for minimal bricks and two corollaries: (1) for n>4, every minimal brick on 2n vertices has at most 5n-

Peida Tian, Victoria Kostina

This paper provides a precise error analysis for the maximum likelihood estimate $\hat{a}_{\text{ML}}(u_1^n)$ of the parameter $a$ given samples $u_1^n = (u_1, \ldots, u_n)'$ drawn from a nonstationary Gauss-Markov process $U_i = a U_{i-1} + Z_i,~i\geq 1$, where $U_0 = 0$, $a> 1$, and $Z_i$'s are independent Gaussian random variables with zero mean and varia

R. Silva-Valenzuela, A. Ortiz-Bernardin, N. Sukumar, E. Artioli

In this paper, we present a novel nodal integration scheme for meshfree Galerkin methods that draws on the mathematical framework of the virtual element method. We adopt linear maximum-entropy basis functions for the discretization of field variables, although the proposed scheme is applicable to any linear meshfree approximant. In our approach, the weak for

Ali Lenjani, Shirley J. Dyke, Ilias Bilionis, Chul Min Yeum

In post-event reconnaissance missions, engineers and researchers collect perishable information about damaged buildings in the affected geographical region to learn from the consequences of the event. A typical post-event reconnaissance mission is conducted by first doing a preliminary survey, followed by a detailed survey. The preliminary survey is typicall

George Bissias, David Thibodeau, Brian N. Levine

Proof-of-work blockchains must implement a difficulty adjustment algorithm (DAA) in order to maintain a consistent inter-arrival time between blocks. Conventional DAAs are essentially feedback controllers, and as such, they are inherently reactive. This approach leaves them susceptible to manipulation and often causes them to either under- or over-correct. W

Xueyuan Zhao, Vidyasagar Sadhu, Anthony Yang, Dario Pompili

To enable low-power and low-complexity wireless monitoring, an improved circuit design of Analog Joint Source Channel Coding (AJSCC) is proposed for wireless sensor nodes. This innovative design is based on Analog Divider Blocks (ADB) with tunable spacing between AJSCC levels. The ADB controls the switching between two types of Voltage Controlled Voltage Sou

Xinping Xu, Lingjie Duan, Minming Li

Unmanned Aerial Vehicle (UAV) have emerged as a promising technique to rapidly provide wireless services to a group of mobile users simultaneously. The paper aims to address a challenging issue that each user is selfish and may misreport his location or preference for changing the optimal UAV location to be close to himself. Using algorithmic game theory, we

Heyi Li, Dongdong Chen, William H. Nailon, Mike E. Davies

Computer-aided breast cancer diagnosis in mammography is limited by inadequate data and the similarity between benign and cancerous masses. To address this, we propose a signed graph regularized deep neural network with adversarial augmentation, named \textsc{DiagNet}. Firstly, we use adversarial learning to generate positive and negative mass-contained mamm

Vincenzo Galluzzi, Giuseppe Puglisi, Sandra Burkutean, Elisabetta Liuzzo

We present Atacama Large Millimeter/submillimiter Array (ALMA) high sensitivity ($\sigma_P \simeq 0.4\,$mJy) polarimetric observations at $97.5\,$GHz (Band 3) of a complete sample of $32$ extragalactic radio sources drawn from the faint Planck-ATCA Co-eval Observations (PACO) sample ($b<-75^\circ$, compact sources brighter than $200\,$mJy at $20\,$GHz). We a

Wameedh R. Abdul-Adheem, Ibraheem K. Ibraheem

In this paper, a Novel Active Disturbance Rejection Control (N-ADRC) strategy is proposed that replaces the Linear Extended state observer (LESO) used in Conventional ADRC (C-ADRC) with a Nested LESO. In the nested LESO, the inner-loop LESO actively estimates and eliminates the generalized disturbance. Increasing the bandwidth improves the estimation accurac

Wameedh Riyadh Abdul Adheem, Ibraheem Kasim Ibraheem

Traditional Input-Output Feedback Linearization (IOFL) requires full knowledge of system dynamics and assumes no disturbance at the input channel and no system&#39;s uncertainties. In this paper, a model-free Active Input-Output Feedback Linearization (AIOFL) technique based on an Improved Active Disturbance Rejection Control (IADRC) paradigm is proposed to

Umang Mathur, Adithya Murali, Paul Krogmeier, P. Madhusudan

We investigate the decidability of automatic program verification for programs that manipulate heaps, and in particular, decision procedures for proving memory safety for them. We extend recent work that identified a decidable subclass of uninterpreted programs to a class of alias-aware programs that can update maps. We apply this theory to develop verificat

Grzegorz Krzyżanowski, Marcin Magdziarz, Łukasz Płociniczak

In this paper we focus on the subdiffusive Black Scholes model. The main part of our work consists of the finite difference method as a numerical approach to the option pricing in the considered model. We derive the governing fractional differential equation and the related weighted numerical scheme being a generalization of the classical Crank-Nicolson sche

Didong Li, David B Dunson

Many statistical and machine learning approaches rely on pairwise distances between data points. The choice of distance metric has a fundamental impact on performance of these procedures, raising questions about how to appropriately calculate distances. When data points are real-valued vectors, by far the most common choice is the Euclidean distance. This ar

Madeleine Burkhart, Daniel Pollack

In 2002, Isenberg-Mazzeo-Pollack (IMP) constructed a series of vacuum initial data sets via a gluing construction. In this paper, we investigate some local geometry of these initial data sets as well as implications regarding their spacetime developments. In particular, we state conditions for the existence of outer trapped surfaces near the center of the IM

Haofu Liao, Wei-An Lin, Zhimin Huo, Levon Vogelsang

A conventional approach to computed tomography (CT) or cone beam CT (CBCT) metal artifact reduction is to replace the X-ray projection data within the metal trace with synthesized data. However, existing projection or sinogram completion methods cannot always produce anatomically consistent information to fill the metal trace, and thus, when the metallic imp

Tim Leung, Brian Ward

We study a series of static and dynamic portfolios of VIX futures and their effectiveness to track the VIX index. We derive each portfolio using optimization methods, and evaluate its tracking performance from both empirical and theoretical perspectives. Among our results, we show that static portfolios of different VIX futures fail to track VIX closely. VIX

Roberto Ferreiro Pérez

We construct Chern-Simons bundles as $\mathrm{Aut}^{+}P$-equivariant $U(1)$ -bundles with connection over the space of connections $\mathcal{A}_{P}$ on a principal $G$-bundle $P\rightarrow M$. We show that the Chern-Simons bundles are determined up to an isomorphisms by means of its equivariant holonomy. The space of equivariant holonomies is shown to coinci

Kazushige Endo

We propose some conjectures for asymptotic distribution of probabilistic Burgers cellular automaton (PBCA) which is defined by a simple motion rule of particles including a probabilistic parameter. Asymptotic distribution of configurations converges to a unique steady state for PBCA. We assume some conjecture on the distribution and derive the asymptotic pro

Fabio Anza, Francesca Pietracaprina, John Goold

The characterizing feature of a many-body localized phase is the existence of an extensive set of quasi-local conserved quantities with an exponentially localized support. This structure endows the system with the signature logarithmic in time entanglement growth between spatial partitions. This feature differentiates the phase from Anderson localization, in

Luiz Renato Fontes, Pablo Almeida Gomes, Remy Sanchis

We investigate a non-Markovian analogue of the Harris contact process in a finite connected graph G=(V,E): an individual is attached to each site x in V, and it can be infected or healthy; the infection propagates to healthy neighbors just as in the usual contact process, according to independent exponential times with a fixed rate lambda>0; however, the rec

Jelena Diakonikolas, Lorenzo Orecchia

This note provides a novel, simple analysis of the method of conjugate gradients for the minimization of convex quadratic functions. In contrast with standard arguments, our proof is entirely self-contained and does not rely on the existence of Chebyshev polynomials. Another advantage of our development is that it clarifies the relation between the method of

Tomohiro Nishiyama

In this paper, we derive a useful lower bound for the Kullback-Leibler divergence (KL-divergence) based on the Hammersley-Chapman-Robbins bound (HCRB). The HCRB states that the variance of an estimator is bounded from below by the Chi-square divergence and the expectation value of the estimator. By using the relation between the KL-divergence and the Chi-squ

Jue Hou, Jelena Bradic, Ronghui Xu

Estimating causal effects for survival outcomes in the high-dimensional setting is an extremely important topic for many biomedical applications as well as areas of social sciences. We propose a new orthogonal score method for treatment effect estimation and inference that results in asymptotically valid confidence intervals assuming only good estimation pro

Amir Akbary, Peng-Jie Wong

Let $\mathbb{A}[n]$ be the group of $n$-torsion points of a commutative algebraic group $\mathbb{A}$ defined over a number field $F$. For a prime ideal $\mathfrak{p}$, we let $N_{\mathfrak{p}}(\mathbb{A}[n])$ be the number of $\mathbb{F}_\mathfrak{p}$-solutions of the system of polynomial equations defining $\mathbb{A}[n]$ when reduced modulo $\mathfrak{p}$.

Amogh Agrawal, Chankyu Lee, Kaushik Roy

There is widespread interest in emerging technologies, especially resistive crossbars for accelerating Deep Neural Networks (DNNs). Resistive crossbars offer a highly-parallel and efficient matrix-vector-multiplication (MVM) operation. MVM being the most dominant operation in DNNs makes crossbars ideally suited. However, various sources of device and circuit

Trevor M. Wilson

We show that Weak Vop\v{e}nka's Principle, which is the statement that the opposite category of ordinals cannot be fully embedded into the category of graphs, is equivalent to the large cardinal principle Ord is Woodin, which says that for every class C there is a C-strong cardinal. Weak Vop\v{e}nka's Principle was already known to imply the existence of a p

Richard J. Chen, Taylor L. Bobrow, Thomas Athey, Faisal Mahmood

Medical endoscopy remains a challenging application for simultaneous localization and mapping (SLAM) due to the sparsity of image features and size constraints that prevent direct depth-sensing. We present a SLAM approach that incorporates depth predictions made by an adversarially-trained convolutional neural network (CNN) applied to monocular endoscopy ima

Marcus M. Scheunemann, Sander G. van Dijk

There has always been much motivation for sharing code and solutions among teams in the RoboCup community. Yet the transfer of code between teams was usually complicated due to a huge variety of used frameworks and their differences in processing sensory information. The RoboCup@Home league has tackled this by transitioning to ROS as a common framework. In c

Po-Yu Kao, Jefferson W. Chen, B. S. Manjunath

We propose a novel, simple and effective method to integrate lesion prior and a 3D U-Net for improving brain tumor segmentation. First, we utilize the ground-truth brain tumor lesions from a group of patients to generate the heatmaps of different types of lesions. These heatmaps are used to create the volume-of-interest (VOI) map which contains prior informa

Eric L. Grinberg, Mehmet Orhon

We consider a finite field model of the X-ray transform that integrates functions along lines in dimension 3, within the context of finite fields. The admissibility problem asks for minimal sets of lines for which the restricted transform is invertible. Graph theoretic conditions are known which characterize admissible collections of lines, and these have be

Christopher Kane, Christoph Lehner, Stefan Meinel, Amarjit Soni

Adding a hard photon to the final state of a leptonic pseudoscalar-meson decay lifts the helicity suppression and can provide sensitivity to a larger set of operators in the weak effective Hamiltonian. Furthermore, radiative leptonic $B$ decays at high photon energy are well suited to constrain the first inverse moment of the $B$-meson light-cone distributio

Patrick Kreitzberg, Kyle Lucke, Oliver Serang

The isotope masses and relative abundances for each element are fundamental chemical knowledge. Computing the isotope masses of a compound and their relative abundances is an important and difficult analytical chemistry problem. We demonstrate that this problem is equivalent to sorting $Y=X_1+X_2+\cdots+X_m$. We introduce a novel, practically efficient metho

Adam Conkey, Tucker Hermans

A Probabilistic Movement Primitive (ProMP) defines a distribution over trajectories with an associated feedback policy. ProMPs are typically initialized from human demonstrations and achieve task generalization through probabilistic operations. However, there is currently no principled guidance in the literature to determine how many demonstrations a teacher

Fouad B. Chedid

Given two events $A$ and $B$, Bayes' law is based on the argument that the probability of $A$ given $B$ is proportional to the probability of $B$ given $A$. When probabilities are interpreted in the Bayesian sense, Bayes' law constitutes a learning algorithm which shows how one can learn from a new observation to improve their belief in a theory that is cons

Alexander Vakhitov, Victor Lempitsky, Yinqiang Zheng

Stereo relative pose problem lies at the core of stereo visual odometry systems that are used in many applications. In this work, we present two minimal solvers for the stereo relative pose. We specifically consider the case when a minimal set consists of three point or line features and each of them has three known projections on two stereo cameras. We vali

Leonidas Lefakis, Oleksandr Zadorozhnyi, Gilles Blanchard

We present a detailed analysis of the class of regression decision tree algorithms which employ a regulized piecewise-linear node-splitting criterion and have regularized linear models at the leaves. From a theoretic standpoint, based on Rademacher complexity framework, we present new high-probability upper bounds for the generalization error for the propose

Pedro Morgado, Nuno Vasconcelos

Real-world applications of object recognition often require the solution of multiple tasks in a single platform. Under the standard paradigm of network fine-tuning, an entirely new CNN is learned per task, and the final network size is independent of task complexity. This is wasteful, since simple tasks require smaller networks than more complex tasks, and l

Wei-An Lin, Haofu Liao, Cheng Peng, Xiaohang Sun

Computed tomography (CT) is an imaging modality widely used for medical diagnosis and treatment. CT images are often corrupted by undesirable artifacts when metallic implants are carried by patients, which creates the problem of metal artifact reduction (MAR). Existing methods for reducing the artifacts due to metallic implants are inadequate for two main re

Steven Chaplick

We study graph classes modeled by families of non-crossing (NC) connected sets. Two classic graph classes in this context are disk graphs and proper interval graphs. We focus on the cases when the sets are paths and the host is a tree (generalizing proper interval graphs). Forbidden induced subgraph characterizations and linear time certifying recognition al

Kartik Hegde, Abhishek Srivastava, Rohit Agrawal

As the Moore's scaling era comes to an end, application specific hardware accelerators appear as an attractive way to improve the performance and power efficiency of our computing systems. A massively heterogeneous system with a large number of hardware accelerators along with multiple general purpose CPUs is a promising direction, but pose several challenge

Yutaka Nagashima

Proof assistants, such as Isabelle/HOL, offer tools to facilitate inductive theorem proving. Isabelle experts know how to use these tools effectively; however, they did not have a systematic way to encode their expertise. To address this problem, we present our domain-specific language, LiFtEr. LiFtEr allows experienced Isabelle users to encode their inducti

Guillaume Derval, Frédéric Docquier, Pierre Schaus

Census data provide detailed information about population characteristics at a coarse resolution. Nevertheless, fine-grained, high-resolution mappings of population counts are increasingly needed to characterize population dynamics and to assess the consequences of climate shocks, natural disasters, investments in infrastructure, development policies, etc. D

Zach Dwiel, Madhavun Candadai, Mariano Phielipp

The use of robotics in controlled environments has flourished over the last several decades and training robots to perform tasks using control strategies developed from dynamical models of their hardware have proven very effective. However, in many real-world settings, the uncertainties of the environment, the safety requirements and generalized capabilities

Dun Qiu, Andrew Timothy Wilson

The Shuffle Theorem of Carlsson and Mellit gives a combinatorial expression for the bigraded Frobenius characteristic of the ring of diagonal harmonics, and the Delta Conjecture of Haglund, Remmel and the second author provides two generalizations of the Shuffle Theorem to the delta operator expression $\Delta'_{e_k} e_n$. Haglund et al. also propose the Ext

Dawei Yang, Jia Deng

Synthetic images rendered by graphics engines are a promising source for training deep networks. However, it is challenging to ensure that they can help train a network to perform well on real images, because a graphics-based generation pipeline requires numerous design decisions such as the selection of 3D shapes and the placement of the camera. In this wor

Minjia Shi, Li Xu, Denis S. Krotov

In a recent work, Jungnickel, Magliveras, Tonchev, and Wassermann derived an overexponential lower bound on the number of nonisomorphic resolvable Steiner triple systems (STS) of order $v$, where $v=3^k$, and $3$-rank $v-k$. We develop an approach to generalize this bound and estimate the number of isomorphism classes of STS$(v)$ of rank $v-k-1$ for an arbit

Bernard J. Laurenzi

A number of the Fourier Series which occur in the theory of the semi-classical atom due to Englert and Schwinger are generalized and presented.

Ziming Shi

We derive estimates in a weighted Sobolev space $W^{k,p}_{\mu}(D)$ for a homotopy operator on a bounded strictly pseudoconvex domain $D$ of $C^2$ boundary in ${\C}^n$. As a result, we show that given any $2n < p < \infty$, $k > 1$, $q \geq 1$, and a $\dbar$-closed $(0,q)$ form $\var$ of class $W^{k,p}(D)$, there exist a solution $u$ to $\dbar u = \var$ such

Emily Toomey, Ken Segall, Karl K. Berggren

With the rising societal demand for more information-processing capacity with lower power consumption, alternative architectures inspired by the parallelism and robustness of the human brain have recently emerged as possible solutions. In particular, spiking neural networks (SNNs) offer a bio-realistic approach, relying on pulses analogous to action potentia

Jonathan Frankle, David Bau

Pruning is a standard technique for removing unnecessary structure from a neural network to reduce its storage footprint, computational demands, or energy consumption. Pruning can reduce the parameter-counts of many state-of-the-art neural networks by an order of magnitude without compromising accuracy, meaning these networks contain a vast amount of unneces

M. Serlin, C. L. Tschirhart, H. Polshyn, Y. Zhang

We report the observation of a quantum anomalous Hall effect in twisted bilayer graphene showing Hall resistance quantized to within .1\% of the von Klitzing constant $h/e^2$ at zero magnetic field.The effect is driven by intrinsic strong correlations, which polarize the electron system into a single spin and valley resolved moir\'e miniband with Chern numbe

João Lita da Silva

In this paper we express the eigenvalues of anti-heptadiagonal persymmetric Hankel matrices as the zeros of explicit polynomials giving also a representation of its eigenvectors. We present also an expression depending on localizable parameters to compute its integer powers. In particular, an explicit formula not depending on any unknown parameter for the in

Jakob Voß

This paper presents a novel and formal interpretation of the original vision of hypertext: infrastructure-agnostic hypertext is independent from specific standards such as data formats and network protocols. Its model is illustrated with examples and references to existing technologies that allow for implementation and integration in current information infr

Wouter Ryssens

Detailed measurements of the cosmic microwave background indicate the large-scale homogeneity of the universe. On very small scales, we observe however inhomogeneities such as galaxies, stars, planets and ourselves. In the context of hot Big-Bang cosmology, these inhomogeneities are often explained as the remains of quantum fluctuations at very early times,

Evan Patterson

Optimal transport is widely used in pure and applied mathematics to find probabilistic solutions to hard combinatorial matching problems. We extend the Wasserstein metric and other elements of optimal transport from the matching of sets to the matching of graphs and other structured data. This structure-preserving form of optimal transport relaxes the usual

Zachary Bradshaw, Tai-Peng Tsai

This paper addresses several problems associated to local energy solutions (in the sense of Lemari\'e-Rieusset) to the Navier-Stokes equations with initial data which is sufficiently small at large or small scales as measured using truncated Morrey-type quantities, namely: (1) global existence for a class of data including the critical $L^2$-based Morrey spa

Maria Dostert, Alexander Kolpakov

This paper provides upper and lower bounds on the kissing number of congruent radius $r > 0$ spheres in $\mathbb{H}^n$, for $n\geq 2$. For that purpose, the kissing number is replaced by the kissing function $\kappa(n, r)$ which depends on the radius $r$. After we obtain some theoretical lower and upper bounds for $\kappa(n, r)$, we study their asymptotic be

Cristhian Montoya

This note deals with the local exact controllability to a particular class of trajectories for the Boussinesq system with nonlinear Navier-slip boundary conditions and internal controls having vanishing components. Briefly speaking, in two dimensions, the local exact controllability property is obtained using only one control in the heat equation, meanwhile

Evgenii Safronov, Michael Vilzmann, Dzmitry Tsetserukou, Konstantin Kondak

Complex aircraft systems are becoming a target for automation. For successful operation, they require both efficient and readable mission execution system. Flight control computer (FCC) units, as well as all important subsystems, are often duplicated. Discrete nature of mission execution systems does not allow small differences in data flow among redundant F

Henry Adams, Mark Blumstein, Lara Kassab

Multidimensional scaling (MDS) is a popular technique for mapping a finite metric space into a low-dimensional Euclidean space in a way that best preserves pairwise distances. We overview the theory of classical MDS, along with its optimality properties and goodness of fit. Further, we present a notion of MDS on infinite metric measure spaces that generalize

Matthew S. Church, Nandini Ananth

The semiclassical Double Herman-Kluk Initial Value Representation is an accurate approach to computing quantum real time correlation functions, but its applications are limited by the need to evaluate an oscillatory integral. In previous work, we have shown that this `sign problem' can be mitigated using the modified Filinov filtration technique to control t

Natalie DuBois, Chris Eufemia, Jeff Johannes, Jenna Zomback

In links with two components there are three different types of crossings: self-crossings in the first component, self crossings in the second component, and crossings between components. In this paper we examine the minimum number of crossing changes needed to unlink without changing the crossings between components. We restrict our attention to unlinking t

Xiaobiao Huang, Minghao Song, Zhe Zhang

We present a multi-objective evolutionary optimization algorithm that uses Gaussian process (GP) regression-based models to select trial solutions in a multi-generation iterative procedure. In each generation, a surrogate model is constructed for each objective function with the sample data. The models are used to evaluate solutions and to select the ones wi

Christina P. Tadiri, Jude D. Kong, Gregor F. Fussmann, Marilyn E. Scott

The use of model experimental systems and mathematical models is important to further understanding of infectious disease dynamics and strategize disease mitigation. Gyrodactylids are helminth ectoparasites of teleost fish which have many dynamical characteristics of microparasites but offer the advantage that they can be quantified and tracked over time, al

Jack Dinsmore, Patrick Draper, David Kastor, Yue Qiu

The interplay of black hole and cosmological horizons introduces distinctive thermodynamic behavior for deSitter black holes, including well-known upper bounds for the mass and entropy. We point to a new such feature, a Schottky peak in the heat capacity of Schwarzschild-deSitter (SdS) black holes. With this behavior in mind, we explore statistical models fo

Jude D. Kong, Hao Wang, Tariq Siddique, Julia Foght

Microbial metabolism of fugitive hydrocarbons produces greenhouse gas (GHG) emissions from oil sands tailings ponds (OSTP) and end pit lakes (EPL) that retain semisolid wastes from surface mining of oil sands ores. Predicting GHG production, particularly methane (CH4), would help oil sands operators mitigate tailings emissions and would assist regulators eva

Matthew Stephenson, Éric Piette, Dennis J. N. J. Soemers, Cameron Browne

Ludii is a general game system being developed as part of the ERC-funded Digital Ludeme Project (DLP). While its primary aim is to model, play, and analyse the full range of traditional strategy games, Ludii also has the potential to support a wide range of AI research topics and competitions. This paper describes some of the future competitions and challeng

Cédric Piette, Éric Piette, Matthew Stephenson, Dennis J. N. J. Soemers

Many of the famous single-player games, commonly called puzzles, can be shown to be NP-Complete. Indeed, this class of complexity contains hundreds of puzzles, since people particularly appreciate completing an intractable puzzle, such as Sudoku, but also enjoy the ability to check their solution easily once it's done. For this reason, using constraint progr

Éric Piette, Matthew Stephenson, Dennis J. N. J. Soemers, Cameron Browne

Although General Game Playing (GGP) systems can facilitate useful research in Artificial Intelligence (AI) for game-playing, they are often computationally inefficient and somewhat specialised to a specific class of games. However, since the start of this year, two General Game Systems have emerged that provide efficient alternatives to the academic state of

Noam Kolodner

We give a counterexample to a conjecture by Miasnikov, Ventura and Weil, stating that an extension of free groups is algebraic if and only if the corresponding morphism of their core graphs is onto, for every basis of the ambient group. In the course of the proof we present a partition of the set of homomorphisms between free groups which is of independent i

Ajay Sriram, Meysam Masoudi, Abdulrahman Alabbasi, Cicek Cavdar

A hybrid cloud radio access network (H-CRAN) architecture has been proposed to alleviate the midhaul capacity limitation in C-RAN. In this architecture, functional splitting is utilized to distribute the processing functions between a central cloud and edge clouds. The flexibility of selecting specific split point enables the H-CRAN designer to reduce midhau

Rohit Bhattacharya, Razieh Nabi, Ilya Shpitser, James M. Robins

Missing data is a pervasive problem in data analyses, resulting in datasets that contain censored realizations of a target distribution. Many approaches to inference on the target distribution using censored observed data, rely on missing data models represented as a factorization with respect to a directed acyclic graph. In this paper we consider the identi

Matthew Stephenson, Éric Piette, Dennis J. N. J. Soemers, Cameron Browne

The Digital Ludeme Project (DLP) aims to reconstruct and analyse over 1000 traditional strategy games using modern techniques. One of the key aspects of this project is the development of Ludii, a general game system that will be able to model and play the complete range of games required by this project. Such an undertaking will create a wide range of possi

Dmitriy Zhuk, Barnaby Martin

We give a surprising classification for the computational complexity of the Quantified Constraint Satisfaction Problem over a constraint language $\Gamma$, QCSP$(\Gamma)$, where $\Gamma$ is a finite language over $3$ elements which contains all constants. In particular, such problems are either in P, NP-complete, co-NP-complete or PSpace-complete. Our classi

D. Asthagiri, Dheeraj Singh Tomar

The free energies to evacuate the first hydration shell around a solute and a cavity defined by the first hydration shell depend on the system size. This observation interpreted within the quasichemical theory shows that both the hydrophilic and the hydrophobic contributions to hydration depend on the system size, decreasing with increasing system size. Alth

Matthias F. M. Lutz, Yonggoo Heo, Xiao-Yu Guo

We consider the Higgs potential in generalizations of the Standard Model. The possibility of the potential to develop two almost degenerate minima is explored. This would imply that QCD matter at two distinct sets of quark masses is relevant for astrophysics and cosmology. If in the exotic minimum the QCD matter ground state is electromagnetically neutral, d

Nikita Ivkin, Edo Liberty, Kevin Lang, Zohar Karnin

Approximating quantiles and distributions over streaming data has been studied for roughly two decades now. Recently, Karnin, Lang, and Liberty proposed the first asymptotically optimal algorithm for doing so. This manuscript complements their theoretical result by providing a practical variants of their algorithm with improved constants. For a given sketch

Shiyang Li, Xiaoyong Jin, Yao Xuan, Xiyou Zhou

Time series forecasting is an important problem across many domains, including predictions of solar plant energy output, electricity consumption, and traffic jam situation. In this paper, we propose to tackle such forecasting problem with Transformer [1]. Although impressed by its performance in our preliminary study, we found its two major weaknesses: (1) l

David P. Jacobs, Elismar R. Oliveira, Vilmar Trevisan

We show that the number of Laplacian eigenvalues greater than the average degree of a tree having $n$ vertices is at most $\lfloor\frac{n}{2} \rfloor$.

Jiaqi Yang, Siwen Quan, Peng Wang, Yanning Zhang

Local geometric descriptors remain an essential component for 3D rigid data matching and fusion. The devise of a rotational invariant local geometric descriptor usually consists of two steps: local reference frame (LRF) construction and feature representation. Existing evaluation efforts have mainly been paid on the LRF or the overall descriptor, yet the qua

V. Sokhoyan, S. Prakhov, A. Fix, S. Abt

The beam-helicity asymmetry was measured, for the first time, in photoproduction of $\pi^{0}\eta$ pairs on carbon, aluminum, and lead, with the A2 experimental setup at MAMI. The results are compared to an earlier measurement on a free proton and to the corresponding theoretical calculations. The Mainz model is used to predict the beam-helicity asymmetry for

Eman Salem Alashwali, Pawel Szalachowski, Andrew Martin

Forward Secrecy (FS) is a security property in key-exchange algorithms which guarantees that a compromise in the secrecy of a long-term private-key does not compromise the secrecy of past session keys. With a growing awareness of long-term mass surveillance programs by governments and others, FS has become widely regarded as a highly desirable property. This

Hongjie Bi, Marco Segneri, Matteo di Volo, Alessandro Torcini

Oscillations are a hallmark of neural population activity in various brain regions with a spectrum covering a wide range of frequencies. Within this spectrum gamma oscillations have received particular attention due to their ubiquitous nature and to their correlation with higher brain functions. Recently, it has been reported that gamma oscillations in the h

Fei Hu, Sichen Li

Let $X$ be a normal projective variety of dimension $n$ and $G$ an abelian group of automorphisms such that all elements of $G\setminus \{\mathrm{id}\}$ are of positive entropy. Dinh and Sibony showed that $G$ is actually free abelian of rank $\le n - 1$. The maximal rank case has been well understood by De-Qi Zhang. We aim to characterize the pair $(X, G)$

Dimitrios Rafailidis, Gerhard Weiss

Nowadays, users open multiple accounts on social media platforms and e-commerce sites, expressing their personal preferences on different domains. However, users' behaviors change across domains, depending on the content that users interact with, such as movies, music, clothing and retail products. In this paper, we propose an adaptive deep learning strategy