title
stringlengths
7
239
abstract
stringlengths
7
2.76k
cs
int64
0
1
phy
int64
0
1
math
int64
0
1
stat
int64
0
1
quantitative biology
int64
0
1
quantitative finance
int64
0
1
A Compositional Coalgebraic Semantics of Strategic Games
We provide a compositional coalgebraic semantics for strategic games. In our framework, like in the semantics of functional programming languages, coalgebras represent the observable behaviour of systems derived from the behaviour of the parts over an unobservable state space. We use coalgebras to describe and progra...
1
0
0
0
0
0
Informed Sampling for Asymptotically Optimal Path Planning (Consolidated Version)
Anytime almost-surely asymptotically optimal planners, such as RRT*, incrementally find paths to every state in the search domain. This is inefficient once an initial solution is found as then only states that can provide a better solution need to be considered. Exact knowledge of these states requires solving the pr...
1
0
0
0
0
0
Holistic Planimetric prediction to Local Volumetric prediction for 3D Human Pose Estimation
We propose a novel approach to 3D human pose estimation from a single depth map. Recently, convolutional neural network (CNN) has become a powerful paradigm in computer vision. Many of computer vision tasks have benefited from CNNs, however, the conventional approach to directly regress 3D body joint locations from a...
1
0
0
0
0
0
Automated design of collective variables using supervised machine learning
Selection of appropriate collective variables for enhancing sampling of molecular simulations remains an unsolved problem in computational biophysics. In particular, picking initial collective variables (CVs) is particularly challenging in higher dimensions. Which atomic coordinates or transforms there of from a list...
0
0
0
1
1
0
Berry-Esseen Theorem and Quantitative homogenization for the Random Conductance Model with degenerate Conductances
We study the random conductance model on the lattice $\mathbb{Z}^d$, i.e. we consider a linear, finite-difference, divergence-form operator with random coefficients and the associated random walk under random conductances. We allow the conductances to be unbounded and degenerate elliptic, but they need to satisfy a s...
0
0
1
0
0
0
Detecting Multiple Communities Using Quantum Annealing on the D-Wave System
A very important problem in combinatorial optimization is partitioning a network into communities of densely connected nodes; where the connectivity between nodes inside a particular community is large compared to the connectivity between nodes belonging to different ones. This problem is known as community detection...
1
0
0
0
0
0
Evaluating Feature Importance Estimates
Estimating the influence of a given feature to a model prediction is challenging. We introduce ROAR, RemOve And Retrain, a benchmark to evaluate the accuracy of interpretability methods that estimate input feature importance in deep neural networks. We remove a fraction of input features deemed to be most important a...
0
0
0
1
0
0
Distributed dynamic modeling and monitoring for large-scale industrial processes under closed-loop control
For large-scale industrial processes under closed-loop control, process dynamics directly resulting from control action are typical characteristics and may show different behaviors between real faults and normal changes of operating conditions. However, conventional distributed monitoring approaches do not consider t...
1
0
0
1
0
0
Learning to compress and search visual data in large-scale systems
The problem of high-dimensional and large-scale representation of visual data is addressed from an unsupervised learning perspective. The emphasis is put on discrete representations, where the description length can be measured in bits and hence the model capacity can be controlled. The algorithmic infrastructure is ...
1
0
0
1
0
0
Simple Round Compression for Parallel Vertex Cover
Recently, Czumaj et.al. (arXiv 2017) presented a parallel (almost) $2$-approximation algorithm for the maximum matching problem in only $O({(\log\log{n})^2})$ rounds of the massive parallel computation (MPC) framework, when the memory per machine is $O(n)$. The main approach in their work is a way of compressing $O(\...
1
0
0
0
0
0
ELDAR, a new method to identify AGN in multi-filter surveys: the ALHAMBRA test-case
We present ELDAR, a new method that exploits the potential of medium- and narrow-band filter surveys to securely identify active galactic nuclei (AGN) and determine their redshifts. Our methodology improves on traditional approaches by looking for AGN emission lines expected to be identified against the continuum, th...
0
1
0
0
0
0
Identification of multiple hard X-ray sources in solar flares: A Bayesian analysis of the February 20 2002 event
The hard X-ray emission in a solar flare is typically characterized by a number of discrete sources, each with its own spectral, temporal, and spatial variability. Establishing the relationship amongst these sources is critical to determine the role of each in the energy release and transport processes that occur wit...
0
0
0
1
0
0
A General Framework for Robust Interactive Learning
We propose a general framework for interactively learning models, such as (binary or non-binary) classifiers, orderings/rankings of items, or clusterings of data points. Our framework is based on a generalization of Angluin's equivalence query model and Littlestone's online learning model: in each iteration, the algo...
1
0
0
0
0
0
Predicting Gravitational Lensing by Stellar Remnants
Gravitational lensing provides a means to measure mass that does not rely on detecting and analysing light from the lens itself. Compact objects are ideal gravitational lenses, because they have relatively large masses and are dim. In this paper we describe the prospects for predicting lensing events generated by the...
0
1
0
0
0
0
Weak separation properties for closed subgroups of locally compact groups
Three separation properties for a closed subgroup $H$ of a locally compact group $G$ are studied: (1) the existence of a bounded approximate indicator for $H$, (2) the existence of a completely bounded invariant projection of $VN\left(G\right)$ onto $VN_{H}\left(G\right)$, and (3) the approximability of the character...
0
0
1
0
0
0
A Broader View on Bias in Automated Decision-Making: Reflecting on Epistemology and Dynamics
Machine learning (ML) is increasingly deployed in real world contexts, supplying actionable insights and forming the basis of automated decision-making systems. While issues resulting from biases pre-existing in training data have been at the center of the fairness debate, these systems are also affected by technical...
1
0
0
1
0
0
Solution to the relaxation problem for a gas with a distribution function dependent on the velocity modulus
The paper presents a solution to the Boltzmann kinetic equation based on the construction of its discrete conservative model. Discrete analogue of the collision integral is presented as a contraction of a tensor, which is independent from the initial distribution function, colliding with a tensor composed of medium d...
0
1
0
0
0
0
Robust Regression for Automatic Fusion Plasma Analysis based on Generative Modeling
The first step to realize automatic experimental data analysis for fusion plasma experiments is fitting noisy data of temperature and density spatial profiles, which are obtained routinely. However, it has been difficult to construct algorithms that fit all the data without over- and under-fitting. In this paper, we ...
0
0
0
1
0
0
Optimizing Long Short-Term Memory Recurrent Neural Networks Using Ant Colony Optimization to Predict Turbine Engine Vibration
This article expands on research that has been done to develop a recurrent neural network (RNN) capable of predicting aircraft engine vibrations using long short-term memory (LSTM) neurons. LSTM RNNs can provide a more generalizable and robust method for prediction over analytical calculations of engine vibration, as...
1
0
0
0
0
0
PhyShare: Sharing Physical Interaction in Virtual Reality
We present PhyShare, a new haptic user interface based on actuated robots. Virtual reality has recently been gaining wide adoption, and an effective haptic feedback in these scenarios can strongly support user's sensory in bridging virtual and physical world. Since participants do not directly observe these robotic p...
1
0
0
0
0
0
Kneser ranks of random graphs and minimum difference representations
Every graph $G=(V,E)$ is an induced subgraph of some Kneser graph of rank $k$, i.e., there is an assignment of (distinct) $k$-sets $v \mapsto A_v$ to the vertices $v\in V$ such that $A_u$ and $A_v$ are disjoint if and only if $uv\in E$. The smallest such $k$ is called the Kneser rank of $G$ and denoted by $f_{\rm Kne...
0
0
1
0
0
0
Visualizing spreading phenomena on complex networks
Graph drawings are useful tools for exploring the structure and dynamics of data that can be represented by pair-wise relationships among a set of objects. Typical real-world social, biological or technological networks exhibit high complexity resulting from a large number and broad heterogeneity of objects and relat...
1
0
0
0
0
0
In silico evolution of signaling networks using rule-based models: bistable response dynamics
One of the ultimate goals in biology is to understand the design principles of biological systems. Such principles, if they exist, can help us better understand complex, natural biological systems and guide the engineering of de novo ones. Towards deciphering design principles, in silico evolution of biological syste...
0
0
0
0
1
0
Deep Recurrent Neural Networks for seizure detection and early seizure detection systems
Epilepsy is common neurological diseases, affecting about 0.6-0.8 % of world population. Epileptic patients suffer from chronic unprovoked seizures, which can result in broad spectrum of debilitating medical and social consequences. Since seizures, in general, occur infrequently and are unpredictable, automated seizu...
1
0
0
0
0
0
QUICKAR: Automatic Query Reformulation for Concept Location using Crowdsourced Knowledge
During maintenance, software developers deal with numerous change requests made by the users of a software system. Studies show that the developers find it challenging to select appropriate search terms from a change request during concept location. In this paper, we propose a novel technique--QUICKAR--that automatic...
1
0
0
0
0
0
Learned Belief-Propagation Decoding with Simple Scaling and SNR Adaptation
We consider the weighted belief-propagation (WBP) decoder recently proposed by Nachmani et al. where different weights are introduced for each Tanner graph edge and optimized using machine learning techniques. Our focus is on simple-scaling models that use the same weights across certain edges to reduce the storage a...
1
0
0
1
0
0
Thick-medium model of transverse pattern formation in optically excited cold two-level atoms with a feedback mirror
We study a pattern forming instability in a laser driven optically thick cloud of cold two-level atoms with a planar feedback mirror. A theoretical model is developed, enabling a full analysis of transverse patterns in a medium with saturable nonlinearity, taking into account diffraction within the medium, and both t...
0
1
0
0
0
0
A reinvestigation of the giant Rashba-split states on Bi-covered Si(111)
We study the electronic and spin structures of the giant Rashba-split surface states of the Bi/Si(111)-($\sqrt{3} \times \sqrt{3}$)R30 trimer phase by means of spin- and angle-resolved photoelectron spectroscopy (spin-ARPES). Supported by tight-binding calculations of the surface state dispersion and spin orientation...
0
1
0
0
0
0
Performance Evaluation of Spectrum Mobility in Multi-homed Mobile IPv6 Cognitive Radio Cellular Networks
Technological developments alongside VLSI achievements enable mobile devices to be equipped with multiple radio interfaces which is known as multihoming. On the other hand, the combination of various wireless access technologies, known as Next Generation Wireless Networks (NGWNs) has been introduced to provide contin...
1
0
0
0
0
0
Tunable Quantum Criticality and Super-ballistic Transport in a `Charge' Kondo Circuit
Quantum phase transitions are ubiquitous in many exotic behaviors of strongly-correlated materials. However the microscopic complexity impedes their quantitative understanding. Here, we observe thoroughly and comprehend the rich strongly-correlated physics in two profoundly dissimilar regimes of quantum criticality. ...
0
1
0
0
0
0
Exploring Cosmic Origins with CORE: Survey requirements and mission design
Future observations of cosmic microwave background (CMB) polarisation have the potential to answer some of the most fundamental questions of modern physics and cosmology. In this paper, we list the requirements for a future CMB polarisation survey addressing these scientific objectives, and discuss the design drivers...
0
1
0
0
0
0
Influence of material parameters on the performance of niobium based superconducting RF cavities
A detailed thermal analysis of a Niobium (Nb) based superconducting radio frequency (SRF) cavity in a liquid helium bath is presented, taking into account the temperature and magnetic field dependence of the surface resistance and thermal conductivity in the superconducting state of the starting Nb material (for SRF ...
0
1
0
0
0
0
Shear Viscosity of Uniform Fermi Gases with Population Imbalance
The shear viscosity plays an important role in studies of transport phenomena in ultracold Fermi gases and serves as a diagnostic of various microscopic theories. Due to the complicated phase structures of population-imbalanced Fermi gases, past works mainly focus on unpolarized Fermi gases. Here we investigate the s...
0
1
0
0
0
0
Equivalence of Intuitionistic Inductive Definitions and Intuitionistic Cyclic Proofs under Arithmetic
A cyclic proof system gives us another way of representing inductive definitions and efficient proof search. In 2011 Brotherston and Simpson conjectured the equivalence between the provability of the classical cyclic proof system and that of the classical system of Martin-Lof's inductive definitions. This paper studi...
1
0
1
0
0
0
Further and stronger analogy between sampling and optimization: Langevin Monte Carlo and gradient descent
In this paper, we revisit the recently established theoretical guarantees for the convergence of the Langevin Monte Carlo algorithm of sampling from a smooth and (strongly) log-concave density. We improve the existing results when the convergence is measured in the Wasserstein distance and provide further insights on...
0
0
1
1
0
0
Probing Spatial Locality in Ionic Liquids with the Grand Canonical Adaptive Resolution Molecular Dynamics Technique
We employ the Grand Canonical Adaptive Resolution Molecular Dynamics Technique (GC-AdResS) to test the spatial locality of the 1-ethyl 3-methyl imidazolium chloride liquid. In GC-AdResS atomistic details are kept only in an open sub-region of the system while the environment is treated at coarse-grained level, thus i...
0
1
0
0
0
0
Towards automation of data quality system for CERN CMS experiment
Daily operation of a large-scale experiment is a challenging task, particularly from perspectives of routine monitoring of quality for data being taken. We describe an approach that uses Machine Learning for the automated system to monitor data quality, which is based on partial use of data qualified manually by dete...
1
0
0
0
0
0
Solving a non-linear model of HIV infection for CD4+T cells by combining Laplace transformation and Homotopy analysis
The aim of this paper is to find the approximate solution of HIV infection model of CD4+T cells. For this reason, the homotopy analysis transform method (HATM) is applied. The presented method is combination of traditional homotopy analysis method (HAM) and the Laplace transformation. The convergence of presented met...
0
0
0
0
1
0
On Store Languages of Language Acceptors
It is well known that the "store language" of every pushdown automaton -- the set of store configurations (state and stack contents) that can appear as an intermediate step in accepting computations -- is a regular language. Here many models of language acceptors with various data structures are examined, along with ...
1
0
0
0
0
0
Exchange constants in molecule-based magnets derived from density functional methods
Cu(pyz)(NO3)2 is a quasi one-dimensional molecular antiferromagnet that exhibits three dimensional long-range magnetic order below TN=110 mK due to the presence of weak inter-chain exchange couplings. Here we compare calculations of the three largest exchange coupling constants in this system using two techniques bas...
0
1
0
0
0
0
An Extended Relevance Model for Session Search
The session search task aims at best serving the user's information need given her previous search behavior during the session. We propose an extended relevance model that captures the user's dynamic information need in the session. Our relevance modelling approach is directly driven by the user's query reformulation...
1
0
0
0
0
0
Hierarchical Graph Representation Learning with Differentiable Pooling
Recently, graph neural networks (GNNs) have revolutionized the field of graph representation learning through effectively learned node embeddings, and achieved state-of-the-art results in tasks such as node classification and link prediction. However, current GNN methods are inherently flat and do not learn hierarchi...
1
0
0
1
0
0
Ranking and Cooperation in Real-World Complex Networks
People participate and activate in online social networks and thus tremendous amount of network data is generated; data regarding their interactions, interests and activities. Some people search for specific questions through online social platforms such as forums and they may receive a suitable response via experts....
1
0
0
0
0
0
Remarks on defective Fano manifolds
This note continues our previous work on special secant defective (specifically, conic connected and local quadratic entry locus) and dual defective manifolds. These are now well understood, except for the prime Fano ones. Here we add a few remarks on this case, completing the results in our papers \cite{LQEL I}, \ci...
0
0
1
0
0
0
Precision of the ENDGame: Mixed-precision arithmetic in the iterative solver of the Unified Model
The Met Office's weather and climate simulation code the Unified Model is used for both operational Numerical Weather Prediction and Climate modelling. The computational performance of the model running on parallel supercomputers is a key consideration. A Krylov sub-space solver is employed to solve the equations of ...
1
0
0
0
0
0
Intra-Cluster Autonomous Coverage Optimization For Dense LTE-A Networks
Self Organizing Networks (SONs) are considered as vital deployments towards upcoming dense cellular networks. From a mobile carrier point of view, continuous coverage optimization is critical for better user perceptions. The majority of SON contributions introduce novel algorithms that optimize specific performance m...
1
0
0
0
0
0
Two-dimensional topological nodal line semimetal in layered $X_2Y$ ($X$ = Ca, Sr, and Ba; $Y$ = As, Sb, and Bi)
In topological semimetals the Dirac points can form zero-dimensional and one-dimensional manifolds, as predicted for Dirac/Weyl semimetals and topological nodal line semimetals, respectively. Here, based on first-principles calculations, we predict a topological nodal line semimetal phase in the two-dimensional compo...
0
1
0
0
0
0
A Real-Valued Modal Logic
A many-valued modal logic is introduced that combines the usual Kripke frame semantics of the modal logic K with connectives interpreted locally at worlds by lattice and group operations over the real numbers. A labelled tableau system is provided and a coNEXPTIME upper bound obtained for checking validity in the log...
1
0
0
0
0
0
Embedded tori with prescribed mean curvature
We construct a sequence of compact, oriented, embedded, two-dimensional surfaces of genus one into Euclidean 3-space with prescribed, almost constant, mean curvature of the form $H(X)=1+{A}{|X|^{-\gamma}}$ for $|X|$ large, when $A<0$ and $\gamma\in(0,2)$. Such surfaces are close to sections of unduloids with small ne...
0
0
1
0
0
0
On the reducibility of induced representations for classical p-adic groups and related affine Hecke algebras
Let $\pi $ be an irreducible smooth complex representation of a general linear $p$-adic group and let $\sigma $ be an irreducible complex supercuspidal representation of a classical $p$-adic group of a given type, so that $\pi\otimes\sigma $ is a representation of a standard Levi subgroup of a $p$-adic classical grou...
0
0
1
0
0
0
On derivations with respect to finite sets of smooth functions
The purpose of this paper is to show that functions that derivate the two-variable product function and one of the exponential, trigonometric or hyperbolic functions are also standard derivations. The more general problem considered is to describe finite sets of differentiable functions such that derivations with res...
0
0
1
0
0
0
A new magnetic phase in the nickelate perovskite TlNiO$_3$
The RNiO$_3$ perovskites are known to order antiferromagnetically below a material-dependent Néel temperature $T_\text{N}$. We report experimental evidence indicating the existence of a second magnetically-ordered phase in TlNiO$_3$ above $T_\text{N} = 104$ K, obtained using nuclear magnetic resonance and muon spin r...
0
1
0
0
0
0
On the Inverse of Forward Adjacency Matrix
During routine state space circuit analysis of an arbitrarily connected set of nodes representing a lossless LC network, a matrix was formed that was observed to implicitly capture connectivity of the nodes in a graph similar to the conventional incidence matrix, but in a slightly different manner. This matrix has on...
1
0
0
0
0
0
Constructing and Understanding New and Old Scales on Slide Rules
We discuss the practical problems arising when constructing any (new or old) scales on slide rules, i.e. realizing the theory in the practice. This might help anyone in planning and realizing (mainly the magnitude and labeling of) new scales on slide rules in the future. In Sections 1-7 we deal with technical problem...
0
0
1
0
0
0
Non-compact subsets of the Zariski space of an integral domain
Let $V$ be a minimal valuation overring of an integral domain $D$ and let $\mathrm{Zar}(D)$ be the Zariski space of the valuation overrings of $D$. Starting from a result in the theory of semistar operations, we prove a criterion under which the set $\mathrm{Zar}(D)\setminus\{V\}$ is not compact. We then use it to pr...
0
0
1
0
0
0
Finite temperature Green's function approach for excited state and thermodynamic properties of cool to warm dense matter
We present a finite-temperature extension of the retarded cumulant Green's function for calculations of exited-state and thermodynamic properties of electronic systems. The method incorporates a cumulant to leading order in the screened Coulomb interaction $W$ and improves excited state properties compared to the $GW...
0
1
0
0
0
0
Geometric Embedding of Path and Cycle Graphs in Pseudo-convex Polygons
Given a graph $ G $ with $ n $ vertices and a set $ S $ of $ n $ points in the plane, a point-set embedding of $ G $ on $ S $ is a planar drawing such that each vertex of $ G $ is mapped to a distinct point of $ S $. A straight-line point-set embedding is a point-set embedding with no edge bends or curves. The point-...
1
0
0
0
0
0
Simulating Brain Signals: Creating Synthetic EEG Data via Neural-Based Generative Models for Improved SSVEP Classification
Despite significant recent progress in the area of Brain-Computer Interface, there are numerous shortcomings associated with collecting Electroencephalography (EEG) signals in real-world environments. These include, but are not limited to, subject and session data variance, long and arduous calibration processes and ...
0
0
0
0
1
0
An FPTAS for the parametric knapsack problem
In this paper, we investigate the parametric knapsack problem, in which the item profits are affine functions depending on a real-valued parameter. The aim is to provide a solution for all values of the parameter. It is well-known that any exact algorithm for the problem may need to output an exponential number of kn...
1
0
1
0
0
0
Saliency Benchmarking Made Easy: Separating Models, Maps and Metrics
Dozens of new models on fixation prediction are published every year and compared on open benchmarks such as MIT300 and LSUN. However, progress in the field can be difficult to judge because models are compared using a variety of inconsistent metrics. Here we show that no single saliency map can perform well under al...
1
0
0
1
0
0
Distributed Framework for Optimal Demand Distribution in Self-Balancing Microgrid
This study focusses on self-balancing microgrids to smartly utilize and prevent overdrawing of available power capacity of the grid. A distributed framework for automated distribution of optimal power demand is proposed, where all building in a microgrid dynamically and simultaneously adjusts their own power consumpt...
1
0
0
0
0
0
Fast, precise, and widely tunable frequency control of an optical parametric oscillator referenced to a frequency comb
Optical frequency combs (OFC) provide a convenient reference for the frequency stabilization of continuous-wave lasers. We demonstrate a frequency control method relying on tracking over a wide range and stabilizing the beat note between the laser and the OFC. The approach combines fast frequency ramps on a milliseco...
0
1
0
0
0
0
Compact-Like Operators in Lattice-Normed Spaces
A linear operator $T$ between two lattice-normed spaces is said to be $p$-compact if, for any $p$-bounded net $x_\alpha$, the net $Tx_\alpha$ has a $p$-convergent subnet. $p$-Compact operators generalize several known classes of operators such as compact, weakly compact, order weakly compact, $AM$-compact operators, ...
0
0
1
0
0
0
Near-infrared spectroscopy of 5 ultra-massive galaxies at 1.7 < z < 2.7
We present the results of a pilot near-infrared (NIR) spectroscopic campaign of five very massive galaxies ($\log(\text{M}_\star/\text{M}_\odot)>11.45$) in the range of $1.7<z<2.7$. We measure an absorption feature redshift for one galaxy at $z_\text{spec}=2.000\pm0.006$. For the remaining galaxies, we combine the ph...
0
1
0
0
0
0
A hybrid deep learning approach for medical relation extraction
Mining relationships between treatment(s) and medical problem(s) is vital in the biomedical domain. This helps in various applications, such as decision support system, safety surveillance, and new treatment discovery. We propose a deep learning approach that utilizes both word level and sentence-level representation...
0
0
0
1
0
0
Performance Optimization of Network Coding Based Communication and Reliable Storage in Internet of Things
Internet or things (IoT) is changing our daily life rapidly. Although new technologies are emerging everyday and expanding their influence in this rapidly growing area, many classic theories can still find their places. In this paper, we study the important applications of the classic network coding theory in two imp...
1
0
0
0
0
0
Time-dependent probability density functions and information geometry in stochastic logistic and Gompertz models
A probabilistic description is essential for understanding growth processes far from equilibrium. In this paper, we compute time-dependent Probability Density Functions (PDFs) in order to investigate stochastic logistic and Gompertz models, which are two of the most popular growth models. We consider different types ...
0
1
0
0
0
0
A Local-Search Algorithm for Steiner Forest
In the Steiner Forest problem, we are given a graph and a collection of source-sink pairs, and the goal is to find a subgraph of minimum total length such that all pairs are connected. The problem is APX-Hard and can be 2-approximated by, e.g., the elegant primal-dual algorithm of Agrawal, Klein, and Ravi from 1995. ...
1
0
0
0
0
0
Fundamental bounds on MIMO antennas
Antenna current optimization is often used to analyze the optimal performance of antennas. Antenna performance can be quantified in e.g., minimum Q-factor and efficiency. The performance of MIMO antennas is more involved and, in general, a single parameter is not sufficient to quantify it. Here, the capacity of an id...
0
1
1
0
0
0
DeepProteomics: Protein family classification using Shallow and Deep Networks
The knowledge regarding the function of proteins is necessary as it gives a clear picture of biological processes. Nevertheless, there are many protein sequences found and added to the databases but lacks functional annotation. The laboratory experiments take a considerable amount of time for annotation of the sequen...
0
0
0
1
0
0
Designing Deterministic Polynomial-Space Algorithms by Color-Coding Multivariate Polynomials
In recent years, several powerful techniques have been developed to design {\em randomized} polynomial-space parameterized algorithms. In this paper, we introduce an enhancement of color coding to design deterministic polynomial-space parameterized algorithms. Our approach aims at reducing the number of random choice...
1
0
0
0
0
0
String Attractors
Let $S$ be a string of length $n$. In this paper we introduce the notion of \emph{string attractor}: a subset of the string's positions $[1,n]$ such that every distinct substring of $S$ has an occurrence crossing one of the attractor's elements. We first show that the minimum attractor's size yields upper-bounds to t...
1
0
0
0
0
0
Methods for Mapping Forest Disturbance and Degradation from Optical Earth Observation Data: a Review
Purpose of review: This paper presents a review of the current state of the art in remote sensing based monitoring of forest disturbances and forest degradation from optical Earth Observation data. Part one comprises an overview of currently available optical remote sensing sensors, which can be used for forest distu...
1
0
0
0
0
0
Testing for Global Network Structure Using Small Subgraph Statistics
We study the problem of testing for community structure in networks using relations between the observed frequencies of small subgraphs. We propose a simple test for the existence of communities based only on the frequencies of three-node subgraphs. The test statistic is shown to be asymptotically normal under a null...
0
0
1
1
0
0
A new method of correcting radial velocity time series for inhomogeneous convection
Magnetic activity strongly impacts stellar RVs and the search for small planets. We showed previously that in the solar case it induces RV variations with an amplitude over the cycle on the order of 8 m/s, with signals on short and long timescales. The major component is the inhibition of the convective blueshift due...
0
1
0
0
0
0
Differential Testing for Variational Analyses: Experience from Developing KConfigReader
Differential testing to solve the oracle problem has been applied in many scenarios where multiple supposedly equivalent implementations exist, such as multiple implementations of a C compiler. If the multiple systems disagree on the output for a given test input, we have likely discovered a bug without every having ...
1
0
0
0
0
0
Simultaneously Learning Neighborship and Projection Matrix for Supervised Dimensionality Reduction
Explicitly or implicitly, most of dimensionality reduction methods need to determine which samples are neighbors and the similarity between the neighbors in the original highdimensional space. The projection matrix is then learned on the assumption that the neighborhood information (e.g., the similarity) is known and...
0
0
0
1
0
0
Joint Multichannel Deconvolution and Blind Source Separation
Blind Source Separation (BSS) is a challenging matrix factorization problem that plays a central role in multichannel imaging science. In a large number of applications, such as astrophysics, current unmixing methods are limited since real-world mixtures are generally affected by extra instrumental effects like blurr...
1
0
0
1
0
0
Bimodule monomorphism categories and RSS equivalences via cotilting modules
The monomorphism category $\mathscr{S}(A, M, B)$ induced by a bimodule $_AM_B$ is the subcategory of $\Lambda$-mod consisting of $\left[\begin{smallmatrix} X\\ Y\end{smallmatrix}\right]_{\phi}$ such that $\phi: M\otimes_B Y\rightarrow X$ is a monic $A$-map, where $\Lambda=\left[\begin{smallmatrix} A&M\\0&B \end{small...
0
0
1
0
0
0
The Vanishing viscosity limit for some symmetric flows
The focus of this paper is on the analysis of the boundary layer and the associated vanishing viscosity limit for two classes of flows with symmetry, namely, Plane-Parallel Channel Flows and Parallel Pipe Flows. We construct explicit boundary layer correctors, which approximate the difference between the Navier-Stoke...
0
0
1
0
0
0
Anisotropy of transport in bulk Rashba metals
The recent experimental discovery of three-dimensional (3D) materials hosting a strong Rashba spin-orbit coupling calls for the theoretical investigation of their transport properties. Here we study the zero temperature dc conductivity of a 3D Rashba metal in the presence of static diluted impurities. We show that, a...
0
1
0
0
0
0
A quick guide for student-driven community genome annotation
High quality gene models are necessary to expand the molecular and genetic tools available for a target organism, but these are available for only a handful of model organisms that have undergone extensive curation and experimental validation over the course of many years. The majority of gene models present in biolo...
0
0
0
0
1
0
Copycat CNN: Stealing Knowledge by Persuading Confession with Random Non-Labeled Data
In the past few years, Convolutional Neural Networks (CNNs) have been achieving state-of-the-art performance on a variety of problems. Many companies employ resources and money to generate these models and provide them as an API, therefore it is in their best interest to protect them, i.e., to avoid that someone else...
0
0
0
1
0
0
Medoids in almost linear time via multi-armed bandits
Computing the medoid of a large number of points in high-dimensional space is an increasingly common operation in many data science problems. We present an algorithm Med-dit which uses O(n log n) distance evaluations to compute the medoid with high probability. Med-dit is based on a connection with the multi-armed ba...
1
0
0
1
0
0
Early stopping for statistical inverse problems via truncated SVD estimation
We consider truncated SVD (or spectral cut-off, projection) estimators for a prototypical statistical inverse problem in dimension $D$. Since calculating the singular value decomposition (SVD) only for the largest singular values is much less costly than the full SVD, our aim is to select a data-driven truncation lev...
0
0
1
1
0
0
Algorithmic Theory of ODEs and Sampling from Well-conditioned Logconcave Densities
Sampling logconcave functions arising in statistics and machine learning has been a subject of intensive study. Recent developments include analyses for Langevin dynamics and Hamiltonian Monte Carlo (HMC). While both approaches have dimension-independent bounds for the underlying $\mathit{continuous}$ processes under...
1
0
0
0
0
0
The PSLQ Algorithm for Empirical Data
The celebrated integer relation finding algorithm PSLQ has been successfully used in many applications. PSLQ was only analyzed theoretically for exact input data, however, when the input data are irrational numbers, they must be approximate ones due to the finite precision of the computer. When the algorithm takes em...
1
0
1
0
0
0
Tensor Completion Algorithms in Big Data Analytics
Tensor completion is a problem of filling the missing or unobserved entries of partially observed tensors. Due to the multidimensional character of tensors in describing complex datasets, tensor completion algorithms and their applications have received wide attention and achievement in areas like data mining, comput...
1
0
0
1
0
0
On Gallai's and Hajós' Conjectures for graphs with treewidth at most 3
A path (resp. cycle) decomposition of a graph $G$ is a set of edge-disjoint paths (resp. cycles) of $G$ that covers the edge set of $G$. Gallai (1966) conjectured that every graph on $n$ vertices admits a path decomposition of size at most $\lfloor (n+1)/2\rfloor$, and Hajós (1968) conjectured that every Eulerian gra...
1
0
0
0
0
0
Band and correlated insulators of cold fermions in a mesoscopic lattice
We investigate the transport properties of neutral, fermionic atoms passing through a one-dimensional quantum wire containing a mesoscopic lattice. The lattice is realized by projecting individually controlled, thin optical barriers on top of a ballistic conductor. Building an increasingly longer lattice, one site af...
0
1
0
0
0
0
Stochasticity from function - why the Bayesian brain may need no noise
An increasing body of evidence suggests that the trial-to-trial variability of spiking activity in the brain is not mere noise, but rather the reflection of a sampling-based encoding scheme for probabilistic computing. Since the precise statistical properties of neural activity are important in this context, many mod...
0
0
0
0
1
0
Very Asymmetric Collider for Dark Matter Search below 1 GeV
Current searches for a dark photon in the mass range below 1 GeV require an electron-positron collider with a luminosity at the level of at least $10^{34}$ cm$^{-2}$s$^{-1}$. The challenge is that, at such low energies, the collider luminosity rapidly drops off due to increase in the beam sizes, strong mutual focusin...
0
1
0
0
0
0
Some divisibility properties of binomial coefficients
In this paper, we gave some properties of binomial coefficient.
0
0
1
0
0
0
An Unsupervised Method for Estimating the Global Horizontal Irradiance from Photovoltaic Power Measurements
In this paper, we present a method to determine the global horizontal irradiance (GHI) from the power measurements of one or more PV systems, located in the same neighborhood. The method is completely unsupervised and is based on a physical model of a PV plant. The precise assessment of solar irradiance is pivotal fo...
0
0
0
1
0
0
Strong anisotropy effect in iron-based superconductor CaFe$_{0.882}$Co$_{0.118}$AsF
The anisotropy of the Fe-based superconductors is much smaller than that of the cuprates and the theoretical calculations. A credible understanding for this experimental fact is still lacking up to now. Here we experimentally study the magnetic-field-angle dependence of electronic resistivity in the superconducting p...
0
1
0
0
0
0
Example of C-rigid polytopes which are not B-rigid
A simple polytope $P$ is said to be \emph{B-rigid} if its combinatorial structure is characterized by its Tor-algebra, and is said to be \emph{C-rigid} if its combinatorial structure is characterized by the cohomology ring of a quasitoric manifold over $P$. It is known that a B-rigid simple polytope is C-rigid. In th...
0
0
1
0
0
0
Dynamic Switching Networks: A Dynamic, Non-local, and Time-independent Approach to Emergence
The concept of emergence is a powerful concept to explain very complex behaviour by simple underling rules. Existing approaches of producing emergent collective behaviour have many limitations making them unable to account for the complexity we see in the real world. In this paper we propose a new dynamic, non-local,...
1
0
0
0
0
0
The Trouvé group for spaces of test functions
The Trouvé group $\mathcal G_{\mathcal A}$ from image analysis consists of the flows at a fixed time of all time-dependent vectors fields of a given regularity $\mathcal A(\mathbb R^d,\mathbb R^d)$. For a multitude of regularity classes $\mathcal A$, we prove that the Trouvé group $\mathcal G_{\mathcal A}$ coincides ...
0
0
1
0
0
0
Robust Motion Planning employing Signal Temporal Logic
Motion planning classically concerns the problem of accomplishing a goal configuration while avoiding obstacles. However, the need for more sophisticated motion planning methodologies, taking temporal aspects into account, has emerged. To address this issue, temporal logics have recently been used to formulate such a...
1
0
0
0
0
0
COREclust: a new package for a robust and scalable analysis of complex data
In this paper, we present a new R package COREclust dedicated to the detection of representative variables in high dimensional spaces with a potentially limited number of observations. Variable sets detection is based on an original graph clustering strategy denoted CORE-clustering algorithm that detects CORE-cluster...
0
0
0
1
0
0