April 2019 arXiv papers — page 24
Showing 2,301–2,400 of 12,989 papers
Sotiris Ntouskas, Haralambos Sarimveis, Pantelis Sopasakis
In this paper an offset-free model predictive control scheme is presented for fractional-order systems using the Grünwald-Letnikov derivative. The infinite-history fractional-order system is approximated by a finite-dimensional state-space system and the modeling error is cast as a bounded disturbance term. Using a state observer, it is shown that the unknow
Alex Krasnok, Andrea Alú
Recently, a broad spectrum of exceptional scattering effects, including bound states in the continuum, exceptional points in PT-symmetrical non-Hermitian systems, and many others attainable in wisely suitably engineered structures have been predicted and demonstrated. Among these scattering effects, those that rely on coherence properties of light are of a p
Chung Chan, Manuj Mukherjee, Praneeth Kumar Vippathalla, Qiaoqiao Zhou
We consider the secret key agreement problem under the multiterminal source model proposed by Csiszár and Narayan. A single-letter characterization of the secrecy capacity is desired but remains unknown except in the extreme case with unlimited public discussion and without wiretapper's side information. Taking the problem to the opposite extreme by requ
Jochen Hoenicke, Tanja Schindler
Interpolation based software model checkers have been successfully employed to automatically prove programs correct. Their power comes from interpolating SMT solvers that check the feasibility of potential counterexamples and compute candidate invariants, otherwise. This approach works well for quantifier-free theories, like equality theory or linear arithme
Jochen Schmid
We investigate the behavior of infinite-time admissibility under compact perturbations. We show, by means of two completely different examples, that infinite-time admissibility is not preserved under compact perturbations $Q$ of the underlying semigroup generator $A$, even if $A$ and $A+Q$ both generate strongly stable semigroups.
Homero R. Gallegos-Ruiz, Nikolaos Katsipis, Szabolcs Tengely, Maciej Ulas
By finding all integral points on certain elliptic and hyperelliptic curves we completely solve the Diophantine equation $\binom{n}{k}=\binom{m}{l}+d$ for $-3\leq d\leq 3$ and $(k,l)\in\{(2,3),\; (2,4),\;(2,5),\; (2,6),\; (2,8),\; (3,4),\; (3,6),\; (4,6), \; (4,8)\}.$ Moreover, we present some other observations of computational and theoretical nature concer
Chemical significance of different temperature regimes for cosmic-ray-induced heating of whole interstellar grains
astro-ph.GAJuris Kalvans, Juris Roberts Kalnin
Cosmic-ray-induced whole-grain heating induces evaporation and other processes that affect the chemistry of interstellar clouds. With recent data on grain heating frequencies as an input for a modified rate-equation astrochemical model, this study examines, which whole-grain heating temperature regime is the most efficient at altering the chemical compositio
Yu Ye, Ming Xiao, Mikael Skoglund
In multi-task learning (MTL), related tasks learn jointly to improve generalization performance. To exploit the high learning speed of extreme learning machines (ELMs), we apply the ELM framework to the MTL problem, where the output weights of ELMs for all the tasks are learned collaboratively. We first present the ELM based MTL problem in the centralized se
Tommaso Cremaschi
We study the class $\mathcal M^B$ of 3-manifolds $M$ that have a compact exhaustion $M=\cup_{i\in\mathbb N} M_i$ satisfying: each $M_i$ is hyperbolizable with incompressible boundary and each component of $\partial M_i$ has genus at most $g= g(M)$. For manifolds in $\mathcal M^{B}$ we give necessary and sufficient topological conditions that guarantee the ex
Olaf Wucknitz
Interstellar scattering is known to broaden distant objects spatially and temporally. The latter aspect is difficult to analyse, unless the signals carry their own time stamps. Pulsars are so kind to do us this favour. Typically the signature is a broadened image with little or no substructure and a similarly smooth exponential scattering tail in the tempora
Adrien Godet, Thibaut Sylvestre, Vincent Pécheur, Jacques Chrétien
Optical nanofibers (ONFs) are excellent nanophotonic platforms for various applications such as optical sensing, quantum and nonlinear optics, due to both the tight optical confinement and their wide evanescent field in the sub-wavelength limit. Other remarkable features of these ultrathin fibers are their surface acoustic properties and their high tensile s
Expanded flow rate range of high-resolution nanoDMAs via improved sample flow injection at the aerosol inlet slit
physics.ins-detJuan Fernandez de la Mora
High-resolution DMAs requiring hundreds of liters per minute of sheath gas flow Q to classify 1 nm particles have not been previously examined and optimized under the modest Q values (tens of liters per minute) needed to classify particles well above 10 nm. Here we study the resolving power R (based on the relative width of the transfer function) of the Half
D. V. Gorbachev, V. I. Ivanov, S. Yu. Tikhonov
We study the uncertainty principles related to the generalized Logan problem in $\mathbb{R}^{d}$. Our main result provides the complete solution of the following problem: for a fixed $m\in \mathbb{Z}_{+}$, find \[ \sup\{|x|\colon (-1)^{m}f(x)>0\}\cdot \sup \{|x|\colon x\in \mathrm{supp}\,\widehat{f}\,\}\to \inf, \] where the infimum is taken over all nontriv
Saverio Giallorenzo, Fabrizio Montesi, Larisa Safina, Stefano Pio Zingaro
In modern application areas for software systems --- like eHealth, the Internet-of-Things, and Edge Computing --- data is encoded in heterogeneous, tree-shaped data-formats, it must be processed in real-time, and it must be ephemeral, i.e., not persist in the system. While it is preferable to use a query language to express complex data-handling logic, their
François Michel, Quentin De Coninck, Olivier Bonaventure
Originally implemented by Google, QUIC gathers a growing interest by providing, on top of UDP, the same service as the classical TCP/TLS/HTTP/2 stack. The IETF will finalise the QUIC specification in 2019. A key feature of QUIC is that almost all its packets, including most of its headers, are fully encrypted. This prevents eavesdropping and interferences ca
Kumar Kshitij Patel, Aymeric Dieuleveut
Synchronous mini-batch SGD is state-of-the-art for large-scale distributed machine learning. However, in practice, its convergence is bottlenecked by slow communication rounds between worker nodes. A natural solution to reduce communication is to use the \emph{`local-SGD'} model in which the workers train their model independently and synchronize every o
Jose I. Martinez, Julio A. Alonso
The mass spectra of gas-phase clusters in cluster beams have a rich structure where the relative heights of the peaks compared to peaks corresponding to clusters of neighbor sizes reveal the stability of the clusters as a function of the size $N$. In an analysis of the published mass spectrum of carbon clusters cations $C_N^{+}$ with $N\leq$16 we have employ
Hiroyuki Kobayashi, Hitoshi Kiya
We propose a novel JPEG XT image compression with hue compensation for two-layer HDR coding. LDR images produced from JPEG XT bitstreams have some distortion in hue due to tone mapping operations. In order to suppress the color distortion, we apply a novel hue compensation method based on the maximally saturated colors. Moreover, the bitstreams generated by
Quan Yu, Jing Ren, Yinjin Fu, Ying Li
With fast development of Internet of Everything (IoE) and its applications, the ever increasing mobile internet traffic and services bring unprecedented challenges including scalability, mobility, availability, and security which cannot be addressed by the current clean-slate network architecture. In this paper, a cybertwin based next generation network arch
Tailoring superhydrophobic ZnO nanorods on Si pyramids with enhanced visible range antireflection property
physics.app-phDepanshu Sharma, Sangita Bhowmick, Arkaprava Das, Aloke Kanjilal
Simultaneous superhydrophobic and visible range antireflective properties are demonstrated in hydrothermally grown ZnO nanorods on chemically textured Si surfaces. A drastic transformation of Si micro pyramids from hydrophobic to superhydrophobic is observed by securing the formation of polycrystalline ZnO nanorods at surfaces, showing an increment of appare
Jessi Cisewski-Kehe, Grant Weller, Chad Schafer
Accurate specification of a likelihood function is becoming increasingly difficult in many inference problems in astronomy. As sample sizes resulting from astronomical surveys continue to grow, deficiencies in the likelihood function lead to larger biases in key parameter estimates. These deficiencies result from the oversimplification of the physical proces
Joint Allocation Strategies of Power and Spreading Factors with Imperfect Orthogonality in LoRa Networks
cs.NILicia Amichi, Megumi Kaneko, Ellen Hidemi Fukuda, Nancy El Rachkidy
The LoRa physical layer is one of the most promising Low Power Wide-Area Network (LPWAN) technologies for future Internet of Things (IoT) applications. It provides a flexible adaptation of coverage and data rate by allocating different Spreading Factors (SFs) and transmit powers to end-devices. We focus on improving throughput fairness while reducing energy
An In Situ Surface-Enhanced Infrared Absorption Spectroscopy Study of Electrochemical CO2 Reduction: Selectivity Dependence on Surface C-Bound and O-Bound Reaction Intermediates
cond-mat.mtrl-sciYu Katayama, Francesco Nattino, Livia Giordano, Jonathan Hwang
The CO_{2} electro-reduction reaction (CORR) is a promising avenue to convert greenhouse gases into high-value fuels and chemicals, in addition to being an attractive method for storing intermittent renewable energy. Although polycrystalline Cu surfaces have long known to be unique in their capabilities of catalyzing the conversion of CO_{2} to higher-order
Bregman Proximal Gradient Algorithm with Extrapolation for a class of Nonconvex Nonsmooth Minimization Problems
math.OCXiaoya Zhang, Roberto Barrio, M. Angeles Martinez, Hao Jiang
In this paper, we consider an accelerated method for solving nonconvex and nonsmooth minimization problems. We propose a Bregman Proximal Gradient algorithm with extrapolation(BPGe). This algorithm extends and accelerates the Bregman Proximal Gradient algorithm (BPG), which circumvents the restrictive global Lipschitz gradient continuity assumption needed in
Fereshteh Mirjalili, Ming Ronnier Luo, Guihua Cui, Jan Morovic
All color-difference formulas are developed to evaluate color differences for pairs of stimuli with hair-line separation. In printing applications, however, color differences are frequently judged between a pair of samples with no-separation because they are printed adjacent on the same piece of paper. A new formula, dENS has been developed for pairs of stim
Yaron Kedem
The stability of a Fermi liquid is analyzed by summing series of diagrams with an interaction mediated by a system close to quantum criticality. The critical temperature and the gap are derived in terms of an effective coupling constant and do not depend on the density of states at the Fermi surface. The forward scattering process is identified as the main p
I. Palacio, L. Aballe, M. Foerster, D. G. de Oteyza
We describe the reversible intercalation of Na under graphene on Ir(111) by photo-dissociation of a previously adsorbed NaCl overlayer. After room temperature evaporation, NaCl adsorbs on top of graphene forming a bilayer. With a combination of electron diffraction and photoemission techniques we demonstrate that the NaCl overlayer dissociates upon a short e
Jesper Nederlof
We present an algorithm that takes as input an $n$-vertex planar graph $G$ and a $k$-vertex pattern graph $P$, and computes the number of (induced) copies of $P$ in $G$ in $2^{O(k/\log k)}n^{O(1)}$ time. If $P$ is a matching, independent set, or connected bounded maximum degree graph, the runtime reduces to $2^{\tilde{O}(\sqrt{k})}n^{O(1)}$. While our algori
Chidozie Shamrock Nwosu, Soumyabrata Dev, Peru Bhardwaj, Bharadwaj Veeravalli
Studies have identified various risk factors associated with the onset of stroke in an individual. Data mining techniques have been used to predict the occurrence of stroke based on these factors by using patients' medical records. However, there has been limited use of electronic health records to study the inter-dependency of different risk factors of
Apostolos Destounis, Georgios S. Paschos
In this paper we address the problem of joint admission control and resource scheduling for \emph{Ultra Reliable Low Latency Communications} (URLLC). We examine two models: (i) the \emph{continuous}, where all allocated resource blocks contribute to the success probability, and (ii) a \emph{binary}, where only resource blocks with strong signal are "acti
Korian Edeline, Justin Iurman, Cyril Soldani, Benoit Donnet
Nowadays, Internet actors have to deal with a strong increase in Internet traffic at many levels. One of their main challenge is building high-speed and efficient networking solutions. In such a context, kernel-bypass I/O frameworks have become their preferred answer to the increasing bandwidth demands. Many works have been achieved, so far, all of them clai
Axel Davy, Thibaud Ehret, Jean-Michel Morel, Mauricio Delbracio
Anomaly detectors address the difficult problem of detecting automatically exceptions in an arbitrary background image. Detection methods have been proposed by the thousands because each problem requires a different background model. By analyzing the existing approaches, we show that the problem can be reduced to detecting anomalies in residual images (extra
Annealing driven positive and negative exchange bias in Fe-Cu-Pt heterostructures at room temperature
cond-mat.mtrl-sciM. A. Basha, Harsh Bhatt, Yogesh Kumar, C. L. Prajapat
We report annealing induced exchange bias in Fe-Cu-Pt based heterostructures with Cu as an intermediate layer (Fe/Cu/Pt heterostructure) and capping layer (Fe/Pt/Cu heterostructure). Exchange bias observed at room temperature (300 K) is found to be dependent on the annealing temperature. We obtained positive exchange bias of 120 Oe on annealing both the hete
Iván Prada, Francisco D. Igual, Katzalin Olcoz
Cache timing attacks use shared caches in multi-core processors as side channels to extract information from victim processes. These attacks are particularly dangerous in cloud infrastructures, in which the deployed countermeasures cause collateral effects in terms of performance loss and increase in energy consumption. We propose to monitor the victim proce
Yorioka's characterization of the cofinality of the strong measure zero ideal and its independency from the continuum
math.LOMiguel A. Cardona
In this paper we present a simpler proof of the fact that no inequality between $\mathrm{cof}(\mathcal{SN})$ and $\mathfrak{c}$ can be decided in ZFC by using well-known tecniques and results.
Yudong Han, Lei Zhu, Zhiyong Cheng, Jingjing Li
Graph based clustering is one of the major clustering methods. Most of it work in three separate steps: similarity graph construction, clustering label relaxing and label discretization with k-means. Such common practice has three disadvantages: 1) the predefined similarity graph is often fixed and may not be optimal for the subsequent clustering. 2) the rel
Sourendu Gupta, Rishi Sharma
Lattice measurements provide adequate information to fix the parameters of long distance effective field theories in Euclidean time. Using such a theory, we examine the analytic continuation of long distance correlation functions of composite operators at finite temperature from Euclidean to Minkowski space time. There are two definitions of mass in each reg
A "boundedness implies convergence" principle and its applications to collapsing estimates in Kähler geometry
math.DGWangjian Jian, Yalong Shi
We establish a general "boundedness implies convergence" principle for a family of evolving Riemannian metrics. We then apply this principle to collapsing Calabi-Yau metrics and normalized Kähler-Ricci flows on torus fibered minimal models to obtain convergence results.
Diego Ortego, Kevin McGuinness, Juan C. SanMiguel, Eric Arazo
This paper presents a novel approach for segmenting moving objects in unconstrained environments using guided convolutional neural networks. This guiding process relies on foreground masks from independent algorithms (i.e. state-of-the-art algorithms) to implement an attention mechanism that incorporates the spatial location of foreground and background to c
Weyl Covariant Theories of Gravity in Riemann-Cartan-Weyl Space-times II. Minimal Massive Gravity
gr-qcTekin Dereli, Cem Yetişmişoğlu
We present locally scale (Weyl) covariant generalisation of Minimal Massive Gravity theory using the language of exterior differential forms on Riemann-Cartan-Weyl space-times. The theory is expressed by a locally scale invariant action and locally scale covariant field equations are found by a first order variational formalism.
David Kelly, Mark Marron, David Clark, Earl T. Barr
Strings are ubiquitous in code. Not all strings are created equal, some contain structure that makes them incompatible with other strings. CSS units are an obvious example. Worse, type checkers cannot see this structure: this is the latent structure problem. We introduce SafeStrings to solve this problem and expose latent structure in strings. Once visible,
Andreas Klümper, Kazumitsu Sakai
The Drude weight for the spin transport of the spin-1/2 $XXZ$ Heisenberg chain in the critical regime is evaluated exactly for finite temperatures. We combine the thermodynamic Bethe ansatz with the functional relations of type $Y$-system satisfied by the row-to-row transfer matrices. This makes it possible to evaluate the asymptotic behavior of the finite t
Yehao Li, Ting Yao, Yingwei Pan, Hongyang Chao
Image captioning has received significant attention with remarkable improvements in recent advances. Nevertheless, images in the wild encapsulate rich knowledge and cannot be sufficiently described with models built on image-caption pairs containing only in-domain objects. In this paper, we propose to address the problem by augmenting standard deep captionin
Low damping magnetic properties and perpendicular magnetic anisotropy with strong volume contribution in the Heusler alloy Fe1.5CoGe
cond-mat.mtrl-sciAndres Conca, Alessia Niesen, Günter Reiss, Burkard Hillebrands
We present a study of the dynamic magnetic properties of TiN-buffered epitaxial thin films of the Heusler alloy Fe$_{1.5}$CoGe. Thickness series annealed at different temperatures are prepared and the magnetic damping is measured, a lowest value of $α=2.18\times 10^{-3}$ is obtained. The perpendicular magnetic anisotropy properties in Fe$_{1.5}$CoGe/MgO are
Falko Hegerfeld, Stefan Kratsch
In the fundamental Maximum Matching problem the task is to find a maximum cardinality set of pairwise disjoint edges in a given undirected graph. The fastest algorithm for this problem, due to Micali and Vazirani, runs in time $\mathcal{O}(\sqrt{n}m)$ and stands unbeaten since 1980. It is complemented by faster, often linear-time, algorithms for various spec
Wenting Yu, Fei Shen, Chen Min
How governments and Internet companies regulate user data on social media attracts public attention. This study tried to answer two questions: What kind of countries send more requests for Facebook user data? What kind of countries get more requests replies from Facebook? We aim to figure out how a country's economic, political and social factors affect
Vladimir M. Stojanovic, Igor Salom
We propose a scheme for investigating the nonequilibrium aspects of small-polaron physics using an array of superconducting qubits and microwave resonators. This system, which can be realized with transmon or gatemon qubits, serves as an analog simulator for a lattice model describing a nonlocal coupling of a quantum particle (excitation) to dispersionless p
P. Talatchian, M. Romera, S. Tsunegi, F. Abreu Araujo
Can we build small neuromorphic chips capable of training deep networks with billions of parameters? This challenge requires hardware neurons and synapses with nanometric dimensions, which can be individually tuned, and densely connected. While nanosynaptic devices have been pursued actively in recent years, much less has been done on nanoscale artificial ne
M. Riou, F. Abreu Araujo, J. Torrejon, S. Tsunegi
Fabricating powerful neuromorphic chips the size of a thumb requires miniaturizing their basic units: synapses and neurons. The challenge for neurons is to scale them down to submicrometer diameters while maintaining the properties that allow for reliable information processing: high signal to noise ratio, endurance, stability, reproducibility. In this work,
Thomas H. Hancock, Srishti Bhasin, Thomas Blake, Nicholas Brook
The TORCH time-of-flight detector is designed to provide particle identification in the momentum range 2-10 GeV/c over large areas. The detector exploits prompt Cherenkov light produced by charged particles traversing a 10 mm thick quartz plate. The photons propagate via total internal reflection and are focused onto a detector plane comprising position-sens
Uri Bader, Vladimir Finkelshtein
We consider finitely generated group endowed with a word metric. The group acts on itself by isometries, which induces an action on its horofunction boundary. The conjecture is that nilpotent groups act trivially on their reduced boundary. We will show this for the Heisenberg group. The main tool will be a discrete version of the isoperimetric inequality.
Mark A. Greenwood, Mehmet E. Bakir, Genevieve Gorrell, Xingyi Song
We extend previous work about general election-related abuse of UK MPs with two new time periods, one in late 2018 and the other in early 2019, allowing previous observations to be extended to new data and the impact of key stages in the UK withdrawal from the European Union on patterns of abuse to be explored. The topics that draw abuse evolve over the four
Xiao Dong, Lei Zhu, Xuemeng Song, Jingjing Li
In this paper, we investigate the research problem of unsupervised multi-view feature selection. Conventional solutions first simply combine multiple pre-constructed view-specific similarity structures into a collaborative similarity structure, and then perform the subsequent feature selection. These two processes are separate and independent. The collaborat
Yingwei Pan, Ting Yao, Yehao Li, Yu Wang
In this paper, we introduce a new idea for unsupervised domain adaptation via a remold of Prototypical Networks, which learn an embedding space and perform classification via a remold of the distances to the prototype of each class. Specifically, we present Transferrable Prototypical Networks (TPN) for adaptation such that the prototypes for each class in so
Branched Hamiltonians and time translation symmetry breaking in equations of the Lienard type
nlin.SIA Ghose-Choudhury, Partha Guha
Shapere and Wilczek ( Phys. Rev. Lett. 109, 160402 and 200402 (2012)) have recently described certain singular Lagrangian systems which display spontaneous breaking of time translation symmetry. We begin by considering the standard Lienard equation for which a Lagrangian is constructed by using the method of Jacobi Last Multiplier. The velocity dependance of
The fundamental group of partial compactifications of the complement of a real line arrangement
math.AGRodolfo Aguilar
Let $\mathscr{A}$ be a real projective line arrangement and $M(\mathscr{A})$ its complement in $\mathbb{CP}^2$. We obtain an explicit expression in terms of Randell's generators of the meridians around the exceptional divisors in the blow-up $\bar{X}$ of $\mathbb{CP}^2$ in the singular points of $\mathscr{A}$. We use this to investigate the partial compa
Takashi Nakajima, Akito Noiri, Jun Yoneda, Matthieu R. Delbecq
Measurement of quantum systems inevitably involves disturbance in various forms. Within the limits imposed by quantum mechanics, however, one can design an "ideal" projective measurement that does not introduce a back action on the measured observable, known as a quantum nondemolition (QND) measurement. Here we demonstrate an all-electrical QND measu
"Favoring my playmate seems fair": Inhibitory control and theory of mind in preschoolers' self-disadvantaging behaviors
q-bio.NCDongjie Xie, Meng Pei, Yanjie Su
The purpose of this study was to investigate the relationship between preschoolers' cognitive abilities and their fairness-related allocation behaviors in a dilemma of equity-efficiency conflict. Four- to 6-year-olds in Experiment 1 (N = 99) decided how to allocate 5 reward bells. In the first-party condition, preschoolers were asked to choose among givi
Marcus C. Werner
We consider light propagation as a probe of non-metricity in area metric spacetimes, and find a deviation from the standard Etherington relation for linearized area metric Schwarzschild. This is joint work with Frederic P. Schuller (Erlangen University).
Dilek Söylemez, Mehmet Ünver
In this paper we investigate some Korovkin type approximation properties of the q-Meyer-König and Zeller operators and Durrmeyer variant of the q-Meyer-König and Zeller operators via Abel summability method which is a sequence-to-function transformation and which extends the ordinary convergence. We show that the approximation results obtained in this paper
Lei Zhu, Zi Huang, Zhihui Li, Liang Xie
Unsupervised hashing can desirably support scalable content-based image retrieval (SCBIR) for its appealing advantages of semantic label independence, memory and search efficiency. However, the learned hash codes are embedded with limited discriminative semantics due to the intrinsic limitation of image representation. To address the problem, in this paper,
Marcus C. Werner
This article presents hitherto unpublished correspondence of Struble in 1947 with Menger, Chandrasekhar, and eventually Einstein, about a possible observational test supporting Einstein's special relativity against Ritz's emission theory using binary stars. This `Struble effect,' an acceleration Doppler effect in emission theory, appears to have
Hongzhi Wang, Ning Li, Zheng Wang, Jianing Li
The growing data has brought tremendous pressure for query processing and storage, so there are many studies that focus on using GPU to accelerate join operation, which is one of the most important operations in modern database systems. However, existing GPU acceleration join operation researches are not very suitable for the join operation on big data. Base
Lisa Hernandez Lucas
A $(k,k-t)$-SCID (set of Subspaces with Constant Intersection Dimension) is a set of $k$-dimensional vector spaces that have pairwise intersections of dimension $k-t$. Let $\mathcal{C}=\{π_1,\ldots,π_n\}$ be a $(k,k-t)$-SCID. Define $S:=\langle π_1, \ldots, π_n \rangle$ and $I:=\langle π_i \cap π_j \mid 1 \leq i < j \leq n \rangle$. We establish several uppe
Haobo Li, Ning Cai
Based on Arimoto's work in 1978, we propose an iterative algorithm for computing the capacity of a discrete memoryless classical-quantum channel with a finite input alphabet and a finite dimensional output, which we call the Blahut-Arimoto algorithm for classical-quantum channel, and an input cost constraint is considered. We show that to reach $\varepsi
Parth Shah, Vishvajit Bakrola, Supriya Pati
In the recent time deep learning has achieved huge popularity due to its performance in various machine learning algorithms. Deep learning as hierarchical or structured learning attempts to model high level abstractions in data by using a group of processing layers. The foundation of deep learning architectures is inspired by the understanding of information
Edoardo G. Carnio, Heinz-Peter Breuer, Andreas Buchleitner
Stunning progresses in the experimental resolution and control of natural or man-made complex systems at the level of their quantum mechanical constituents raises the question, across diverse subdisciplines of physics, chemistry and biology, whether that fundamental quantum nature may condition the dynamical and functional system properties on mesoscopic if
A. Leśniewska, M. J. Michałowski
The mechanism of dust formation in galaxies at high redshift is still unknown. Asymptotic giant branch (AGB) stars and explosions of supernovae (SNe) are possible dust producers, and non-stellar processes may substantially contribute to dust production, for example grain growth in the interstellar medium (ISM). Our aim is to determine the contribution to dus
Smart Jammer and LTE Network Strategies in An Infinite-Horizon Zero-Sum Repeated Game with Asymmetric and Incomplete Information
cs.GTFarhan M. Aziz, Lichun Li, Jeff S. Shamma, Gordon L. Stuber
LTE/LTE-Advanced networks are known to be vulnerable to denial-of-service and loss-of-service attacks from smart jammers. In this article, the interaction between a smart jammer and LTE network is modeled as an infinite-horizon, zero-sum, asymmetric repeated game. The smart jammer and eNode B are modeled as the informed and the uninformed player, respectivel
Yanqi Qiu
A conceptual proof of the result of Bo{ż}ejko on extension of positive definite kernels is given.
Neri Merhav
We address the problem of modulating a parameter onto a power-limited signal, transmitted over a discrete-time Gaussian channel and estimating this parameter at the receiver. Continuing an earlier work, where the optimal trade-off between the weak-noise estimation performance and the outage probability (threshold-effect breakdown) was studied for a single (s
Arindam Saha, Soumyadip Maity, Brojeshwar Bhowmick
Autonomous Micro Aerial Vehicles (MAVs) gained tremendous attention in recent years. Autonomous flight in indoor requires a dense depth map for navigable space detection which is the fundamental component for autonomous navigation. In this paper, we address the problem of reconstructing dense depth while a drone is hovering (small camera motion) in indoor sc
Information entropy as a measure of tunneling and quantum confinement in a symmetric double-well potential
quant-phNeetik Mukherjee, Arunesh Roy, Amlan K. Roy
Information entropic measures such as Fisher information, Shannon entropy, Onicescu energy and Onicescu Shannon entropy of a symmetric double-well potential are calculated in both position and momentum space. Eigenvalues and eigenvectors of this system are obtained through a variation-induced exact diagonalization procedure. The information entropy-based unc
Static polarizability and hyperpolarizability in atoms and molecules through a Cartesian-grid DFT
physics.chem-phTanmay Mandal, Abhisek Ghosal, Amlan K. Roy
Static electric response properties of atoms and molecules are reported within the real-space Cartesian grid implementation of pseudopotential Kohn-Sham (KS) density functional theory (DFT). A detailed systematic investigation is made for a representative set of atoms and molecules, through a number of properties like total ground-state electronic energies,
Mahendra K. Verma
Injection of dilute polymer in a turbulent flow suppresses frictional drag. This challenging and technologically important problem remains primarily unresolved due to the complex nature of the flow. An important factor in the drag reduction is the energy transfer from the velocity field to the polymers. In this paper we quantify this process using energy flu
Critical parameters and spherical confinement of H atom in screened Coulomb potential
physics.chem-phAmlan K. Roy
Critical parameters in three screened potentials, namely, Hulthén, Yukawa and exponential cosine screened Coulomb potential are reported. Accurate estimates of these parameters are given for each of these potentials, for all states having $n \leq 10$. Comparison with literature results is made, wherever possible. Present values compare excellently with refer
Abhisek Ghosal, Tanmay Mandal, Amlan K. ~Roy
Within the finite-field Kohn-Sham framework, static electric response properties of diatomic molecules are presented. The electronic energy, dipole moment ({\boldmath$μ$}), static dipole polarizability ({\boldmath$α$}) and first-hyperpolarizability ({\boldmath$β$}) are calculated through a pseudopotential-DFT implementation in Cartesian coordinate grid, deve
Ravi Kumar Thakur, Snehasis Mukherjee
The problem of Scene flow estimation in depth videos has been attracting attention of researchers of robot vision, due to its potential application in various areas of robotics. The conventional scene flow methods are difficult to use in reallife applications due to their long computational overhead. We propose a conditional adversarial network SceneFlowGAN
Rohit Jena
Human Pose estimation is a challenging problem, especially in the case of 3D pose estimation from 2D images due to many different factors like occlusion, depth ambiguities, intertwining of people, and in general crowds. 2D multi-person human pose estimation in the wild also suffers from the same problems - occlusion, ambiguities, and disentanglement of peopl
Yuzhou Liu, DeLiang Wang
We address talker-independent monaural speaker separation from the perspectives of deep learning and computational auditory scene analysis (CASA). Specifically, we decompose the multi-speaker separation task into the stages of simultaneous grouping and sequential grouping. Simultaneous grouping is first performed in each time frame by separating the spectra
Forecasting in Big Data Environments: an Adaptable and Automated Shrinkage Estimation of Neural Networks (AAShNet)
econ.EMAli Habibnia, Esfandiar Maasoumi
This paper considers improved forecasting in possibly nonlinear dynamic settings, with high-dimension predictors ("big data" environments). To overcome the curse of dimensionality and manage data and model complexity, we examine shrinkage estimation of a back-propagation algorithm of a deep neural net with skip-layer connections. We expressly include
XiaoBin Li, WeiQiang Wang
Loss functions play a key role in training superior deep neural networks. In convolutional neural networks (CNNs), the popular cross entropy loss together with softmax does not explicitly guarantee minimization of intra-class variance or maximization of inter-class variance. In the early studies, there is no theoretical analysis and experiments explicitly in
Imil Hamda Imran, Zhiyong Chen, Lijun Zhu, Minyue Fu
In traditional adaptive control, the certainty equivalence principle suggests a two-step design scheme. A controller is first designed for the ideal situation assuming the uncertain parameter was known and it renders a Lyapunov function. Then, the uncertain parameter in the controller is replaced by its estimation that is updated by an adaptive law along the
Ana Maria Acu, Heiner Gonska
The main object of this paper is to improve some of the known estimates for classical Kantorovich operators. A quantitative Voronovskaya-type result in terms of second moduli of continuity which improves some previous results is obtained. In order to explain non-multiplicativity of the Kantorovich operators a Chebyshev-Grüss inequality is given. Two Grüss-Vo
Liang He, Xianhong Chen, Can Xu, Yi Liu
In this paper, we apply a latent class model (LCM) to the task of speaker diarization. LCM is similar to Patrick Kenny's variational Bayes (VB) method in that it uses soft information and avoids premature hard decisions in its iterations. In contrast to the VB method, which is based on a generative model, LCM provides a framework allowing both generative
J. E. Pascoe
A committee space is a Hilbert space of power series, perhaps in several or noncommuting variables, such that $\|z^α\|\|z^β\| \geq \|z^{α+β}\|.$ Such a space satisfies the true column-row property when ever the map transposing a column multiplier to a row multiplier is contractive. We describe a model for random multipliers and show that such random multipli
Skin Cancer Segmentation and Classification with NABLA-N and Inception Recurrent Residual Convolutional Networks
cs.CVMd Zahangir Alom, Theus Aspiras, Tarek M. Taha, Vijayan K. Asari
In the last few years, Deep Learning (DL) has been showing superior performance in different modalities of biomedical image analysis. Several DL architectures have been proposed for classification, segmentation, and detection tasks in medical imaging and computational pathology. In this paper, we propose a new DL architecture, the NABLA-N network, with bette
Lina Zhao, Eric T. Chung
In this paper we propose simple multiscale basis functions with constraint energy minimization to solve elliptic problems with high contrast medium. Our methodology is based on the recently developed non-local multicontinuum method (NLMC). The main ingredient of the method is the construction of suitable local basis functions with the capability of capturing
Robert Fraser, Shaoming Guo, Malabika Pramanik
Let $E\subset \mathbb{R}$ be a closed set of Hausdorff dimension $α\in (0, 1)$. Let $P: \mathbb{R}\to \mathbb{R}$ be a polynomial without a constant term whose degree is bigger than one. We prove that if $E$ supports a probability measure satisfying certain dimension condition and Fourier decay condition, then $E$ contains three points $x, x+t, x+P(t)$ for s
Declarative Recursive Computation on an RDBMS, or, Why You Should Use a Database For Distributed Machine Learning
cs.DBDimitrije Jankov, Shangyu Luo, Binhang Yuan, Zhuhua Cai
A number of popular systems, most notably Google's TensorFlow, have been implemented from the ground up to support machine learning tasks. We consider how to make a very small set of changes to a modern relational database management system (RDBMS) to make it suitable for distributed learning computations. Changes include adding better support for recurs
Konstantinos Sotiropoulos, John W. Byers, Polyvios Pratikakis, Charalampos E. Tsourakakis
This paper investigates the interplay between different types of user interactions on Twitter, with respect to predicting missing or unseen interactions. For example, given a set of retweet interactions between Twitter users, how accurately can we predict reply interactions? Is it more difficult to predict retweet or quote interactions between a pair of acco
Linear codes over the ring $\mathbb{Z}_4 + u\mathbb{Z}_4 + v\mathbb{Z}_4 + w\mathbb{Z}_4 + uv\mathbb{Z}_4 + uw\mathbb{Z}_4 + vw\mathbb{Z}_4 + uvw\mathbb{Z}_4$
cs.ITBustomi, Aditya Purwa Santika, Djoko Suprijanto
We investigate linear codes over the ring $\mathbb{Z}_4 + u\mathbb{Z}_4 + v\mathbb{Z}_4 + w\mathbb{Z}_4 + uv\mathbb{Z}_4 + uw\mathbb{Z}_4 + vw\mathbb{Z}_4 + uvw\mathbb{Z}_4$, with conditions $u^2=u$, $v^2=v$, $w^2=w$, $uv=vu$, $uw=wu$ and $vw=wv.$ We first analyze the structure of the ring and then define linear codes over this ring. Lee weight and Gray map
Deep Reinforcement Learning for Optimal Critical Care Pain Management with Morphine using Dueling Double-Deep Q Networks
cs.LGDaniel Lopez-Martinez, Patrick Eschenfeldt, Sassan Ostvar, Myles Ingram
Opioids are the preferred medications for the treatment of pain in the intensive care unit. While undertreatment leads to unrelieved pain and poor clinical outcomes, excessive use of opioids puts patients at risk of experiencing multiple adverse effects. In this work, we present a sequential decision making framework for opioid dosing based on deep reinforce
Chaoyang Wang, Simon Lucey, Federico Perazzi, Oliver Wang
We present a fully data-driven method to compute depth from diverse monocular video sequences that contain large amounts of non-rigid objects, e.g., people. In order to learn reconstruction cues for non-rigid scenes, we introduce a new dataset consisting of stereo videos scraped in-the-wild. This dataset has a wide variety of scene types, and features large
Zhengqi Li, Tali Dekel, Forrester Cole, Richard Tucker
We present a method for predicting dense depth in scenarios where both a monocular camera and people in the scene are freely moving. Existing methods for recovering depth for dynamic, non-rigid objects from monocular video impose strong assumptions on the objects' motion and may only recover sparse depth. In this paper, we take a data-driven approach and
Md Solimul Chowdhury, Martin Müller, Jia-Huai You
A state-of-the-art criterion to evaluate the importance of a given learned clause is called Literal Block Distance (LBD) score. It measures the number of distinct decision levels in a given learned clause. The lower the LBD score of a learned clause, the better is its quality. The learned clauses with LBD score of 2, called glue clauses, are known to possess
Jacob Reher, Wen-Loong Ma, Aaron D. Ames
The control of bipedal robotic walking remains a challenging problem in the domains of computation and experiment, due to the multi-body dynamics and various sources of uncertainty. In recent years, there has been a rising trend towards model reduction and the design of intuitive controllers to overcome the gap between assumed model and reality. Despite its
Mayur J. Bency, Ahmed H. Qureshi, Michael C. Yip
Fast and efficient path generation is critical for robots operating in complex environments. This motion planning problem is often performed in a robot's actuation or configuration space, where popular pathfinding methods such as A*, RRT*, get exponentially more computationally expensive to execute as the dimensionality increases or the spaces become mor
Monika Bhattacharjee, Moulinath Banerjee, George Michailidis
We study the problem of detecting a common change point in large panel data based on a mean shift model, wherein the errors exhibit both temporal and cross-sectional dependence. A least squares based procedure is used to estimate the location of the change point. Further, we establish the convergence rate and obtain the asymptotic distribution of the least s
Cristian E. Gutiérrez, Henok Mawi
A numerical scheme is presented to solve the one source near field refractor problem to arbitrary precision and it is proved that the scheme terminates in a finite number of iterations. The convergence of the algorithm depends upon proving appropriate Lipschitz estimates for the refractor measure. The algorithm is presented in general terms and has independe