text
null | inputs
dict | prediction
null | prediction_agent
null | annotation
list | annotation_agent
null | multi_label
bool 1
class | explanation
null | id
stringlengths 1
5
| metadata
null | status
stringclasses 2
values | event_timestamp
null | metrics
null |
|---|---|---|---|---|---|---|---|---|---|---|---|---|
null |
{
"abstract": " We consider the characterization as well as the construction of quantum codes\nthat allow to transmit both quantum and classical information, which we refer\nto as `hybrid codes'. We construct hybrid codes $[\\![n,k{: }m,d]\\!]_q$ with\nlength $n$ and distance $d$, that simultaneously transmit $k$ qudits and $m$\nsymbols from a classical alphabet of size $q$. Many good codes such as\n$[\\![7,1{: }1,3]\\!]_2$, $[\\![9,2{: }2,3]\\!]_2$, $[\\![10,3{: }2,3]\\!]_2$,\n$[\\![11,4{: }2,3]\\!]_2$, $[\\![11,1{: }2,4]\\!]_2$, $[\\![13,1{: }4,4]\\!]_2$,\n$[\\![13,1{: }1,5]\\!]_2$, $[\\![14,1{: }2,5]\\!]_2$, $[\\![15,1{: }3,5]\\!]_2$,\n$[\\![19,9{: }1,4]\\!]_2$, $[\\![20,9{: }2,4]\\!]_2$, $[\\![21,9{: }3,4]\\!]_2$,\n$[\\![22,9{: }4,4]\\!]_2$ have been found. All these codes have better parameters\nthan hybrid codes obtained from the best known stabilizer quantum codes.\n",
"title": "Codes for Simultaneous Transmission of Quantum and Classical Information"
}
| null | null | null | null | true | null |
10001
| null |
Default
| null | null |
null |
{
"abstract": " Kinetically constrained lattice gases (KCLG) are interacting particle systems\non the integer lattice $\\mathbb Z^d$ with hard core exclusion and\nKawasaki type dynamics. Their peculiarity is that jumps are allowed only if\nthe configuration satisfies a constraint which asks for enough empty sites in a\ncertain local neighborhood. KCLG have been introduced and extensively studied\nin physics literature as models of glassy dynamics. We focus on the most\nstudied class of KCLG, the Kob Andersen (KA) models. We analyze the behavior of\na tracer (i.e. a tagged particle) at equilibrium. We prove that for all\ndimensions $d\\geq 2$ and for any equilibrium particle density, under diffusive\nrescaling the motion of the tracer converges to a $d$-dimensional Brownian\nmotion with non-degenerate diffusion matrix. Therefore we disprove the\noccurrence of a diffusive/non diffusive transition which had been conjectured\nin physics literature. Our technique is flexible enough and can be extended to\nanalyse the tracer behavior for other choices of constraints.\n",
"title": "Kinetically constrained lattice gases: tagged particle diffusion"
}
| null | null | null | null | true | null |
10002
| null |
Default
| null | null |
null |
{
"abstract": " Molecular fingerprints, i.e. feature vectors describing atomistic\nneighborhood configurations, is an important abstraction and a key ingredient\nfor data-driven modeling of potential energy surface and interatomic force. In\nthis paper, we present the Density-Encoded Canonically Aligned Fingerprint\n(DECAF) fingerprint algorithm, which is robust and efficient, for fitting\nper-atom scalar and vector quantities. The fingerprint is essentially a\ncontinuous density field formed through the superimposition of smoothing\nkernels centered on the atoms. Rotational invariance of the fingerprint is\nachieved by aligning, for each fingerprint instance, the neighboring atoms onto\na local canonical coordinate frame computed from a kernel minisum optimization\nprocedure. We show that this approach is superior over PCA-based methods\nespecially when the atomistic neighborhood is sparse and/or contains symmetry.\nWe propose that the `distance' between the density fields be measured using a\nvolume integral of their pointwise difference. This can be efficiently computed\nusing optimal quadrature rules, which only require discrete sampling at a small\nnumber of grid points. We also experiment on the choice of weight functions for\nconstructing the density fields, and characterize their performance for fitting\ninteratomic potentials. The applicability of the fingerprint is demonstrated\nthrough a set of benchmark problems.\n",
"title": "An Atomistic Fingerprint Algorithm for Learning Ab Initio Molecular Force Fields"
}
| null | null | null | null | true | null |
10003
| null |
Default
| null | null |
null |
{
"abstract": " We present a generalized 4 $\\times$ 4 matrix formalism for the description of\nlight propagation in birefringent stratified media. In contrast to previous\nwork, our algorithm is capable of treating arbitrarily anisotropic or\nisotropic, absorbing or non-absorbing materials and is free of discontinous\nsolutions. We calculate the reflection and transmission coefficients and derive\nequations for the electric field distribution for any number of layers. The\nalgorithm is easily comprehensible and can be straight forwardly implemented in\na computer program. To demonstrate the capabilities of the approach, we\ncalculate the reflectivities, electric field distributions, and dispersion\ncurves for surface phonon polaritons excited in the Otto geometry for selected\nmodel systems, where we observe several distinct phenomena ranging from\ncritical coupling to mode splitting, and surface phonon polaritons in\nhyperbolic media.\n",
"title": "Generalized 4 $\\times$ 4 Matrix Formalism for Light Propagation in Anisotropic Stratified Media: Study of Surface Phonon Polaritons in Polar Dielectric Heterostructures"
}
| null | null | null | null | true | null |
10004
| null |
Default
| null | null |
null |
{
"abstract": " In this paper the Chua circuit with five linear elements and saturation\nnon-linearity is studied. Numerical localization of self-excited attractor in\nthe Chua circuit model can be done by computation of trajectory with initial\ndata in a vicinity of an unstable equilibrium. For a hidden attractor its basin\nof attraction does not overlap with a small vicinity of equilibria, so it is\ndifficult to find the corresponding initial data for localization. This survey\nis devoted to the application of describing function method for localization of\nhidden periodic and chaotic attractors in the Chua model. We use a rigorous\njustification of the describing function method, based on the method of small\nparameter, to get the initial data for the visualization of the hidden\nattractors. A new configuration of hidden Chua attractors is presented.\n",
"title": "Localization of hidden Chua attractors by the describing function method"
}
| null | null | null | null | true | null |
10005
| null |
Default
| null | null |
null |
{
"abstract": " Log-linear models are arguably the most successful class of graphical models\nfor large-scale applications because of their simplicity and tractability.\nLearning and inference with these models require calculating the partition\nfunction, which is a major bottleneck and intractable for large state spaces.\nImportance Sampling (IS) and MCMC-based approaches are lucrative. However, the\ncondition of having a \"good\" proposal distribution is often not satisfied in\npractice.\nIn this paper, we add a new dimension to efficient estimation via sampling.\nWe propose a new sampling scheme and an unbiased estimator that estimates the\npartition function accurately in sub-linear time. Our samples are generated in\nnear-constant time using locality sensitive hashing (LSH), and so are\ncorrelated and unnormalized. We demonstrate the effectiveness of our proposed\napproach by comparing the accuracy and speed of estimating the partition\nfunction against other state-of-the-art estimation techniques including IS and\nthe efficient variant of Gumbel-Max sampling. With our efficient sampling\nscheme, we accurately train real-world language models using only 1-2% of\ncomputations.\n",
"title": "A New Unbiased and Efficient Class of LSH-Based Samplers and Estimators for Partition Function Computation in Log-Linear Models"
}
| null | null | null | null | true | null |
10006
| null |
Default
| null | null |
null |
{
"abstract": " Recent quantum-gas microscopy of ultracold atoms and scanning tunneling\nmicroscopy of the cuprates reveal new detailed information about doped Mott\nantiferromagnets, which can be compared with calculations. Using cellular\ndynamical mean-field theory, we map out the antiferromagnetic (AF) phase of the\ntwo-dimensional Hubbard model as a function of interaction strength $U$, hole\ndoping $\\delta$ and temperature $T$. The Néel phase boundary is non-monotonic\nas a function of $U$ and $\\delta$. Frustration induced by second-neighbor\nhopping reduces Néel order more effectively at small $U$. The doped AF is\nstabilized at large $U$ by kinetic energy and at small $U$ by potential energy.\nThe transition between the AF insulator and the doped metallic AF is\ncontinuous. At large $U$, we find in-gap states similar to those observed in\nscanning tunneling microscopy. We predict that, contrary to the Hubbard bands,\nthese states are only slightly spin polarized.\n",
"title": "Effects of interaction strength, doping, and frustration on the antiferromagnetic phase of the two-dimensional Hubbard model"
}
| null | null | null | null | true | null |
10007
| null |
Default
| null | null |
null |
{
"abstract": " Discrete particle simulations are widely used to study large-scale\nparticulate flows in complex geometries where particle-particle and\nparticle-fluid interactions require an adequate representation but the\ncomputational cost has to be kept low. In this work, we present a novel\ncoupling approach for such simulations. A lattice Boltzmann formulation of the\ngeneralized Navier-Stokes equations is used to describe the fluid motion. This\npromises efficient simulations suitable for high performance computing and,\nsince volume displacement effects by the solid phase are considered, our\napproach is also applicable to non-dilute particulate systems. The discrete\nelement method is combined with an explicit evaluation of interparticle\nlubrication forces to simulate the motion of individual submerged particles.\nDrag, pressure and added mass forces determine the momentum transfer by\nfluid-particle interactions. A stable coupling algorithm is presented and\ndiscussed in detail. We demonstrate the validity of our approach for dilute as\nwell as dense systems by predicting the settling velocity of spheres over a\nbroad range of solid volume fractions in good agreement with semi-empirical\ncorrelations. Additionally, the accuracy of particle-wall interactions in a\nviscous fluid is thoroughly tested and established. Our approach can thus be\nreadily used for various particulate systems and can be extended\nstraightforward to e.g. non-spherical particles.\n",
"title": "A Coupled Lattice Boltzmann Method and Discrete Element Method for Discrete Particle Simulations of Particulate Flows"
}
| null | null | null | null | true | null |
10008
| null |
Default
| null | null |
null |
{
"abstract": " We describe the MERger-event Gamma-Ray (MERGR) Telescope intended for\ndeployment by ~2021. MERGR will cover from 20 keV to 2 MeV with a wide field of\nview (6 sr) using nineteen gamma-ray detectors arranged on a section of a\nsphere. The telescope will work as a standalone system or as part of a network\nof sensors, to increase by ~50% the current sky coverage to detect short\nGamma-Ray Burst (SGRB) counterparts to neutron-star binary mergers within the\n~200 Mpc range of gravitational wave detectors in the early 2020's. Inflight\nsoftware will provide realtime burst detections with mean localization\nuncertainties of 6 deg for a photon fluence of 5 ph cm^-2 (the mean fluence of\nFermi-GBM SGRBs) and <3 deg for the brightest ~5% of SGRBs to enable rapid\nmulti-wavelength follow-up to identify a host galaxy and its redshift. To\nminimize cost and time to first light, MERGR is directly derived from\ndemonstrators designed and built at NRL for the DoD Space Test Program (STP).\nWe argue that the deployment of a network that provides all-sky coverage for\nSGRB detection is of immediate urgency to the multi-messenger astrophysics\ncommunity.\n",
"title": "The MERger-event Gamma-Ray (MERGR) Telescope"
}
| null | null | null | null | true | null |
10009
| null |
Default
| null | null |
null |
{
"abstract": " It was proved by Graham and Witten in 1999 that conformal invariants of\nsubmanifolds can be obtained via volume renormalization of minimal surfaces in\nconformally compact Einstein manifolds. The conformal invariant of a\nsubmanifold $\\Sigma$ is contained in the volume expansion of the minimal\nsurface which is asymptotic to $\\Sigma$ when the minimal surface approaches the\nconformaly infinity. In the paper we give the explicit expression of\nGraham-Witten's conformal invariant for closed four dimensional submanifolds\nand find critical points of the conformal invariant in the case of Euclidean\nambient spaces.\n",
"title": "Graham-Witten's conformal invariant for closed four dimensional submanifolds"
}
| null | null | null | null | true | null |
10010
| null |
Default
| null | null |
null |
{
"abstract": " Genealogical networks, also known as family trees or population pedigrees,\nare commonly studied by genealogists wanting to know about their ancestry, but\nthey also provide a valuable resource for disciplines such as digital\ndemography, genetics, and computational social science. These networks are\ntypically constructed by hand through a very time-consuming process, which\nrequires comparing large numbers of historical records manually. We develop\ncomputational methods for automatically inferring large-scale genealogical\nnetworks. A comparison with human-constructed networks attests to the accuracy\nof the proposed methods. To demonstrate the applicability of the inferred\nlarge-scale genealogical networks, we present a longitudinal analysis on the\nmating patterns observed in a network. This analysis shows a consistent\ntendency of people choosing a spouse with a similar socioeconomic status, a\nphenomenon known as assortative mating. Interestingly, we do not observe this\ntendency to consistently decrease (nor increase) over our study period of 150\nyears.\n",
"title": "Computationally Inferred Genealogical Networks Uncover Long-Term Trends in Assortative Mating"
}
| null | null | null | null | true | null |
10011
| null |
Default
| null | null |
null |
{
"abstract": " In this paper we prove small data global existence for solutions to the\nMaxwell--Born--Infeld (MBI) system on a fixed Schwarzschild background. This\nsystem has appeared in the context of string theory and can be seen as a\nnonlinear model problem for the stability of the background metric itself, due\nto its tensorial and quasilinear nature. The MBI system models nonlinear\nelectromagnetism and does not display birefringence. The key element in our\nproof lies in the observation that there exists a first-order differential\ntransformation which brings solutions of the spin $\\pm 1$ Teukolsky equations,\nsatisfied by the extreme components of the field, into solutions of a \"good\"\nequation (the Fackerell--Ipser Equation). This strategy was established in [F.\nPasqualotto, The spin $\\pm 1$ Teukolsky equations and the Maxwell system on\nSchwarzschild, Preprint 2016, arXiv:1612.07244] for the linear Maxwell field on\nSchwarzschild. We show that analogous Fackerell--Ipser equations hold for the\nMBI system on a fixed Schwarzschild background, which are however nonlinearly\ncoupled. To essentially decouple these right hand sides, we setup a bootstrap\nargument. We use the $r^p$ method of Dafermos and Rodnianski in [M. Dafermos\nand I. Rodnianski, A new physical-space approach to decay for the wave equation\nwith applications to black hole spacetimes, in XVIth International Congress on\nMathematical Physics, Pavel Exner ed., Prague 2009 pp. 421-433, 2009,\narXiv:0910.4957] in order to deduce decay of some null components, and we infer\ndecay for the remaining quantities by integrating the MBI system as transport\nequations.\n",
"title": "Nonlinear stability for the Maxwell--Born--Infeld system on a Schwarzschild background"
}
| null | null | null | null | true | null |
10012
| null |
Default
| null | null |
null |
{
"abstract": " The concentration of biochemical oxygen demand, BOD5, was studied in order to\nevaluate the water quality of the Igapó I Lake, in Londrina, Paraná State,\nBrazil. The simulation was conducted by means of the discretization in\ncurvilinear coordinates of the geometry of Igapó I Lake, together with finite\ndifference and finite element methods. The evaluation of the proposed numerical\nmodel for water quality was performed by comparing the experimental values of\nBOD5 with the numerical results. The evaluation of the model showed\nquantitative results compatible with the actual behavior of Igapó I Lake in\nrelation to the simulated parameter. The qualitative analysis of the numerical\nsimulations provided a better understanding of the dynamics of the BOD5\nconcentration at Igapó I Lake, showing that such concentrations in the\ncentral regions of the lake have values above those allowed by Brazilian law.\nThe results can help to guide choices by public officials, as: (i) improve the\nidentification mechanisms of pollutant emitters on Lake Igapó I, (ii)\ncontribute to the optimal treatment of the recovery of the polluted environment\nand (iii) provide a better quality of life for the regulars of the lake as well\nas for the residents living on the lakeside.\n",
"title": "Numerical simulation of BOD5 dynamics in Igapó I lake, Londrina, Paraná, Brazil: Experimental measurement and mathematical modeling"
}
| null | null | null | null | true | null |
10013
| null |
Default
| null | null |
null |
{
"abstract": " In matched observational studies where treatment assignment is not\nrandomized, sensitivity analysis helps investigators determine how sensitive\ntheir estimated treatment effect is to some unmeasured con- founder. The\nstandard approach calibrates the sensitivity analysis according to the worst\ncase bias in a pair. This approach will result in a conservative sensitivity\nanalysis if the worst case bias does not hold in every pair. In this paper, we\nshow that for binary data, the standard approach can be calibrated in terms of\nthe average bias in a pair rather than worst case bias. When the worst case\nbias and average bias differ, the average bias interpretation results in a less\nconservative sensitivity analysis and more power. In many studies, the average\ncase calibration may also carry a more natural interpretation than the worst\ncase calibration and may also allow researchers to incorporate additional data\nto establish an empirical basis with which to calibrate a sensitivity analysis.\nWe illustrate this with a study of the effects of cellphone use on the\nincidence of automobile accidents. Finally, we extend the average case\ncalibration to the sensitivity analysis of confidence intervals for\nattributable effects.\n",
"title": "Sensitivity Analysis for matched pair analysis of binary data: From worst case to average case analysis"
}
| null | null | null | null | true | null |
10014
| null |
Default
| null | null |
null |
{
"abstract": " The TTE approach to Computable Analysis is the study of so-called\nrepresentations (encodings for continuous objects such as reals, functions, and\nsets) with respect to the notions of computability they induce. A rich variety\nof such representations had been devised over the past decades, particularly\nregarding closed subsets of Euclidean space plus subclasses thereof (like\ncompact subsets). In addition, they had been compared and classified with\nrespect to both non-uniform computability of single sets and uniform\ncomputability of operators on sets. In this paper we refine these\ninvestigations from the point of view of computational complexity. Benefiting\nfrom the concept of second-order representations and complexity recently\ndevised by Kawamura & Cook (2012), we determine parameterized complexity bounds\nfor operators such as union, intersection, projection, and more generally\nfunction image and inversion. By indicating natural parameters in addition to\nthe output precision, we get a uniform view on results by Ko (1991-2013),\nBraverman (2004/05) and Zhao & Müller (2008), relating these problems to the\nP/UP/NP question in discrete complexity theory.\n",
"title": "Closed Sets and Operators thereon: Representations, Computability and Complexity"
}
| null | null | null | null | true | null |
10015
| null |
Default
| null | null |
null |
{
"abstract": " Data mining and machine learning techniques such as classification and\nregression trees (CART) represent a promising alternative to conventional\nlogistic regression for propensity score estimation. Whereas incomplete data\npreclude the fitting of a logistic regression on all subjects, CART is\nappealing in part because some implementations allow for incomplete records to\nbe incorporated in the tree fitting and provide propensity score estimates for\nall subjects. Based on theoretical considerations, we argue that the automatic\nhandling of missing data by CART may however not be appropriate. Using a series\nof simulation experiments, we examined the performance of different approaches\nto handling missing covariate data; (i) applying the CART algorithm directly to\nthe (partially) incomplete data, (ii) complete case analysis, and (iii)\nmultiple imputation. Performance was assessed in terms of bias in estimating\nexposure-outcome effects \\add{among the exposed}, standard error, mean squared\nerror and coverage. Applying the CART algorithm directly to incomplete data\nresulted in bias, even in scenarios where data were missing completely at\nrandom. Overall, multiple imputation followed by CART resulted in the best\nperformance. Our study showed that automatic handling of missing data in CART\ncan cause serious bias and does not outperform multiple imputation as a means\nto account for missing data.\n",
"title": "Propensity score estimation using classification and regression trees in the presence of missing covariate data"
}
| null | null | null | null | true | null |
10016
| null |
Default
| null | null |
null |
{
"abstract": " In this paper we investigate the computational complexity of deciding if a\ngiven finite algebraic structure satisfies a fixed (strong) Maltsev condition\n$\\Sigma$. Our goal in this paper is to show that $\\Sigma$-testing can be\naccomplished in polynomial time when the algebras tested are idempotent and the\nMaltsev condition $\\Sigma$ can be described using paths. Examples of such path\nconditions are having a Maltsev term, having a majority operation, and having a\nchain of Jónsson (or Gumm) terms of fixed length.\n",
"title": "Deciding some Maltsev conditions in finite idempotent algebras"
}
| null | null | null | null | true | null |
10017
| null |
Default
| null | null |
null |
{
"abstract": " A trace $\\tau$ on a separable C*-algebra $A$ is called matricial field (MF)\nif there is a trace-preserving morphism from $A$ to $Q_\\omega$, where\n$Q_\\omega$ denotes the norm ultrapower of the universal UHF-algebra $Q$. In\ngeneral, the trace $\\tau$ induces a state on the Cuntz semigroup $Cu(A)$. We\nshow there is always a state-preserving morphism from $Cu(A)$ to\n$Cu(Q_\\omega)$.\nAs an application, if $A$ is an AI-algebra and $F$ is a free group acting on\n$A$, then every trace on the reduced crossed product $A \\rtimes F$ is MF. This\nfurther implies the same result when $A$ is an AH-algebra with the ideal\nproperty such that $K_1(A)$ is a torsion group. We also use this to\ncharacterize when $A \\rtimes F$ is MF (i.e. admits an isometric morphism into\n$Q_\\omega$) for many simple, nuclear C*-algebras $A$.\n",
"title": "MF traces and the Cuntz semigroup"
}
| null | null |
[
"Mathematics"
] | null | true | null |
10018
| null |
Validated
| null | null |
null |
{
"abstract": " In the Fock representation, we propose a framework to construct the\ngeneralized matrix product states (MPS) for topological phases with $\\mathbb{\nZ}_{p}$ parafermions. Unlike the $\\mathbb{Z}_{2}$ Majorana fermions, the $%\n\\mathbb{Z}_{p}$ parafermions form intrinsically interacting systems. Here we\nexplicitly construct two topologically distinct classes of irreducible $%\n\\mathbb{Z}_{3}$ parafermionic MPS wave functions, characterized by one or two\nparafermionic zero modes at each end of an open chain. Their corresponding\nparent Hamiltonians are found as the fixed point models of the single\n$\\mathbb{Z}_{3}$ parafermion chain and two-coupled parafermion chains with\n$\\mathbb{Z}_{3}\\times \\mathbb{Z}_{3}$ symmetry. Our results thus pave the road\nto investigate all possible topological phases with $\\mathbb{Z}_{p}$\nparafermions within the matrix product representation in one dimension.\n",
"title": "Matrix product states for topological phases with parafermions"
}
| null | null |
[
"Physics"
] | null | true | null |
10019
| null |
Validated
| null | null |
null |
{
"abstract": " Fractal TRIDYN (F-TRIDYN) is a modified version of the widely used Monte\nCarlo, Binary Collision Approximation code TRIDYN that includes an explicit\nmodel of surface roughness and additional output modes for coupling to plasma\nedge and material codes. Surface roughness plays an important role in ion\nirradiation processes such as sputtering; roughness can significantly increase\nthe angle of maximum sputtering and change the maximum observed sputtering\nyield by a factor of 2 or more. The complete effect of surface roughness on\nsputtering and other ion irradiation phenomena is not completely understood.\nMany rough surfaces can be consistently and realistically modeled by fractals,\nusing the fractal dimension and fractal length scale as the sole input\nparameters. F-TRIDYN includes a robust fractal surface algorithm that is more\ncomputationally efficient than those in previous fractal codes and which\nreproduces available experimental sputtering data from rough surfaces. Fractals\nprovide a compelling path toward a complete and concise understanding of the\neffect that surface geometry plays on the behavior of plasma-facing materials.\nF-TRIDYN is a flexible code for simulating ion-solid interactions and coupling\nto plasma and material codes for multiscale modeling.\n",
"title": "F-TRIDYN: A Binary Collision Approximation Code for Simulating Ion Interactions with Rough Surfaces"
}
| null | null | null | null | true | null |
10020
| null |
Default
| null | null |
null |
{
"abstract": " To precisely measure radon concentrations in purified air supplied to the\nSuper-Kamiokande detector as a buffer gas, we have developed a highly sensitive\nradon detector with an intrinsic background as low as 0.33$\\pm$0.07\nmBq/m$^{3}$. In this article, we discuss the construction and calibration of\nthis detector as well as results of its application to the measurement and\nmonitoring of the buffer gas layer above Super-Kamiokande. In March 2013, the\nchilled activated charcoal system used to remove radon in the input buffer gas\nwas upgraded. After this improvement, a dramatic reduction in the radon\nconcentration of the supply gas down to 0.08 $\\pm$ 0.07 mBq/m$^{3}$.\nAdditionally, the Rn concentration of the in-situ buffer gas has been measured\n28.8$\\pm$1.7 mBq/m$^{3}$ using the new radon detector. Based on these\nmeasurements we have determined that the dominant source of Rn in the buffer\ngas arises from contamination from the Super-Kamiokande tank itself.\n",
"title": "Measurement of Radon Concentration in Super-Kamiokande's Buffer Gas"
}
| null | null |
[
"Physics"
] | null | true | null |
10021
| null |
Validated
| null | null |
null |
{
"abstract": " With the development of neural networks based machine learning and their\nusage in mission critical applications, voices are rising against the\n\\textit{black box} aspect of neural networks as it becomes crucial to\nunderstand their limits and capabilities. With the rise of neuromorphic\nhardware, it is even more critical to understand how a neural network, as a\ndistributed system, tolerates the failures of its computing nodes, neurons, and\nits communication channels, synapses. Experimentally assessing the robustness\nof neural networks involves the quixotic venture of testing all the possible\nfailures, on all the possible inputs, which ultimately hits a combinatorial\nexplosion for the first, and the impossibility to gather all the possible\ninputs for the second.\nIn this paper, we prove an upper bound on the expected error of the output\nwhen a subset of neurons crashes. This bound involves dependencies on the\nnetwork parameters that can be seen as being too pessimistic in the average\ncase. It involves a polynomial dependency on the Lipschitz coefficient of the\nneurons activation function, and an exponential dependency on the depth of the\nlayer where a failure occurs. We back up our theoretical results with\nexperiments illustrating the extent to which our prediction matches the\ndependencies between the network parameters and robustness. Our results show\nthat the robustness of neural networks to the average crash can be estimated\nwithout the need to neither test the network on all failure configurations, nor\naccess the training set used to train the network, both of which are\npractically impossible requirements.\n",
"title": "On The Robustness of a Neural Network"
}
| null | null |
[
"Computer Science",
"Statistics"
] | null | true | null |
10022
| null |
Validated
| null | null |
null |
{
"abstract": " We show how Leibnitz.s indiscernibility principle and Gentzen's original work\nlead to extensions of the sequent calculus to first order logic with equality\nand investigate the cut elimination property. Furthermore we discuss and\nimprove the nonlengthening property of Lifshitz and Orevkov.\n",
"title": "The Cut Elimination and the Nonlengthening Property for the Sequent Calculus with Equality"
}
| null | null | null | null | true | null |
10023
| null |
Default
| null | null |
null |
{
"abstract": " The main purpose of this article is to fix several aspects aspects of the\nproof of the Whittaker Plancherel Theorem in Real Reductive Groups II that are\naffected by recently observed errors or gaps . In the process of completing the\nproof of the theorem the paper also gives an exposition of its structure, and\nadds some clarifying new results. It also outlines the steps in the proof of\nthe Harish-Chandra Plancherel theorem as they are needed in our proof of the\nWhittaker version.\n",
"title": "On the Whittaker Plancherel Theorem for Real Reductive Groups"
}
| null | null | null | null | true | null |
10024
| null |
Default
| null | null |
null |
{
"abstract": " We investigate the level spacing distribution for the quantum spectrum of the\nsquare billiard. Extending work of Connors--Keating, and Smilansky, we\nformulate an analog of the Hardy--Littlewood prime $k$-tuple conjecture for\nsums of two squares, and show that it implies that the spectral gaps, after\nremoving degeneracies and rescaling, are Poisson distributed. Consequently, by\nwork of Rudnick and Ueberschär, the level spacings of arithmetic toral point\nscatterers, in the weak coupling limit, are also Poisson distributed. We also\ngive numerical evidence for the conjecture and its implications.\n",
"title": "Poisson distribution for gaps between sums of two squares and level spacings for toral point scatterers"
}
| null | null | null | null | true | null |
10025
| null |
Default
| null | null |
null |
{
"abstract": " With this note, we remember our friend Maria Krawczyk, who passed away this\nyear, on May 24th. We briefly outline some of her physics interests and main\naccomplishments, and her great human and moral qualities.\n",
"title": "Maria Krawczyk: friend and physicist"
}
| null | null | null | null | true | null |
10026
| null |
Default
| null | null |
null |
{
"abstract": " Training deep neural networks is known to require a large number of training\nsamples. However, in many applications only few training samples are available.\nIn this work, we tackle the issue of training neural networks for\nclassification task when few training samples are available. We attempt to\nsolve this issue by proposing a new regularization term that constrains the\nhidden layers of a network to learn class-wise invariant representations. In\nour regularization framework, learning invariant representations is generalized\nto the class membership where samples with the same class should have the same\nrepresentation. Numerical experiments over MNIST and its variants showed that\nour proposal helps improving the generalization of neural network particularly\nwhen trained with few samples. We provide the source code of our framework\nthis https URL .\n",
"title": "Neural Networks Regularization Through Class-wise Invariant Representation Learning"
}
| null | null | null | null | true | null |
10027
| null |
Default
| null | null |
null |
{
"abstract": " We introduce multi-modal, attention-based neural machine translation (NMT)\nmodels which incorporate visual features into different parts of both the\nencoder and the decoder. We utilise global image features extracted using a\npre-trained convolutional neural network and incorporate them (i) as words in\nthe source sentence, (ii) to initialise the encoder hidden state, and (iii) as\nadditional data to initialise the decoder hidden state. In our experiments, we\nevaluate how these different strategies to incorporate global image features\ncompare and which ones perform best. We also study the impact that adding\nsynthetic multi-modal, multilingual data brings and find that the additional\ndata have a positive impact on multi-modal models. We report new\nstate-of-the-art results and our best models also significantly improve on a\ncomparable phrase-based Statistical MT (PBSMT) model trained on the Multi30k\ndata set according to all metrics evaluated. To the best of our knowledge, it\nis the first time a purely neural model significantly improves over a PBSMT\nmodel on all metrics evaluated on this data set.\n",
"title": "Incorporating Global Visual Features into Attention-Based Neural Machine Translation"
}
| null | null | null | null | true | null |
10028
| null |
Default
| null | null |
null |
{
"abstract": " The coprime hypergraph of integers on $n$ vertices $CHI_k(n)$ is defined via\nvertex set $\\{1,2,\\dots,n\\}$ and hyperedge set\n$\\{\\{v_1,v_2,\\dots,v_{k+1}\\}\\subseteq\\{1,2,\\dots,n\\}:\\gcd(v_1,v_2,\\dots,v_{k+1})=1\\}$.\nIn this article we present ideas on how to construct maximal subgraphs in\n$CHI_k(n)$. This continues the author's earlier work, which dealt with bounds\non the size and structural properties of these subgraphs. We succeed in the\ncases $k\\in\\{1,2,3\\}$ and give promising ideas for $k\\geq 4$.\n",
"title": "Complete Subgraphs of the Coprime Hypergraph of Integers III: Construction"
}
| null | null | null | null | true | null |
10029
| null |
Default
| null | null |
null |
{
"abstract": " Since the largest 2014-2016 Ebola virus disease outbreak in West Africa,\nunderstanding of Ebola virus infection has improved, notably the involvement of\ninnate immune mediators. Amongst them, collectins are important players in the\nantiviral innate immune defense. A screening of Ebola glycoprotein\n(GP)-collectins interactions revealed the specific interaction of human\nsurfactant protein D (hSP-D), a lectin expressed in lung and liver, two\ncompartments where Ebola was found in vivo. Further analyses have demonstrated\nan involvement of hSP-D in the enhancement of virus infection in several in\nvitro models. Similar effects were observed for porcine SP-D (pSP-D). In\naddition, both hSP-D and pSP-D interacted with Reston virus (RESTV) GP and\nenhanced pseudoviral infection in pulmonary cells. Thus, our study reveals a\nnovel partner of Ebola GP that may participate to enhance viral spread.\n",
"title": "Involvement of Surfactant Protein D in Ebola Virus Infection Enhancement via Glycoprotein Interaction"
}
| null | null | null | null | true | null |
10030
| null |
Default
| null | null |
null |
{
"abstract": " Nonnegative Matrix Factorization (NMF) is a widely used technique for data\nrepresentation. Inspired by the expressive power of deep learning, several NMF\nvariants equipped with deep architectures have been proposed. However, these\nmethods mostly use the only nonnegativity while ignoring task-specific features\nof data. In this paper, we propose a novel deep approximately orthogonal\nnonnegative matrix factorization method where both nonnegativity and\northogonality are imposed with the aim to perform a hierarchical clustering by\nusing different level of abstractions of data. Experiment on two face image\ndatasets showed that the proposed method achieved better clustering performance\nthan other deep matrix factorization methods and state-of-the-art single layer\nNMF variants.\n",
"title": "Deep Approximately Orthogonal Nonnegative Matrix Factorization for Clustering"
}
| null | null |
[
"Computer Science"
] | null | true | null |
10031
| null |
Validated
| null | null |
null |
{
"abstract": " We consider the problem of recovering the superposition of $R$ distinct\ncomplex exponential functions from compressed non-uniform time-domain samples.\nTotal Variation (TV) minimization or atomic norm minimization was proposed in\nthe literature to recover the $R$ frequencies or the missing data. However, it\nis known that in order for TV minimization and atomic norm minimization to\nrecover the missing data or the frequencies, the underlying $R$ frequencies are\nrequired to be well-separated, even when the measurements are noiseless. This\npaper shows that the Hankel matrix recovery approach can super-resolve the $R$\ncomplex exponentials and their frequencies from compressed non-uniform\nmeasurements, regardless of how close their frequencies are to each other. We\npropose a new concept of orthonormal atomic norm minimization (OANM), and\ndemonstrate that the success of Hankel matrix recovery in separation-free\nsuper-resolution comes from the fact that the nuclear norm of a Hankel matrix\nis an orthonormal atomic norm. More specifically, we show that, in traditional\natomic norm minimization, the underlying parameter values $\\textbf{must}$ be\nwell separated to achieve successful signal recovery, if the atoms are changing\ncontinuously with respect to the continuously-valued parameter. In contrast,\nfor the OANM, it is possible the OANM is successful even though the original\natoms can be arbitrarily close.\nAs a byproduct of this research, we provide one matrix-theoretic inequality\nof nuclear norm, and give its proof from the theory of compressed sensing.\n",
"title": "Separation-Free Super-Resolution from Compressed Measurements is Possible: an Orthonormal Atomic Norm Minimization Approach"
}
| null | null | null | null | true | null |
10032
| null |
Default
| null | null |
null |
{
"abstract": " In the quest for scalable Bayesian computational algorithms we need to\nexploit the full potential of existing methodologies. In this note we point out\nthat message passing algorithms, which are very well developed for inference in\ngraphical models, appear to be largely unexplored for scalable inference in\nBayesian multilevel regression models. We show that nested multilevel\nregression models with Gaussian errors lend themselves very naturally to the\ncombined use of belief propagation and MCMC. Specifically, the posterior\ndistribution of the regression parameters conditionally on covariance\nhyperparameters is a high-dimensional Gaussian that can be sampled exactly (as\nwell as marginalized) using belief propagation at a cost that scales linearly\nin the number of parameters and data. We derive an algorithm that works\nefficiently even for conditionally singular Gaussian distributions, e.g., when\nthere are linear constraints between the parameters at different levels. We\nshow that allowing for such non-invertible Gaussians is critical for belief\npropagation to be applicable to a large class of nested multilevel models. From\na different perspective, the methodology proposed can be seen as a\ngeneralization of forward-backward algorithms for sampling to multilevel\nregressions with tree-structure graphical models, as opposed to single-branch\ntrees used in classical Kalman filter contexts.\n",
"title": "A note on MCMC for nested multilevel regression models via belief propagation"
}
| null | null | null | null | true | null |
10033
| null |
Default
| null | null |
null |
{
"abstract": " Choosing the Indium Gallium Nitride (InGaN) ternary alloy for thin films\nsolar cells might yield high benefits concerning efficiency and reliability,\nbecause its bandgap can be tuned through the Indium composition and radiations\nhave little destructive effect on it. It may also reveal challenges because\ngood quality p-doped InGaN layers are difficult to elaborate. In this letter, a\nnew design for an InGaN thin film solar cell is optimized, where the player of\na PIN structure is replaced by a Schottky contact, leading to a Metal-IN (MIN)\nstructure. With a simulated efficiency of 19.8%, the MIN structure performs\nbetter than the previously studied Schottky structure, while increasing its\nfabrication tolerance and thus functional reliability a. Owing to its good\ntolerance to radiations [1], its high light absorption [2, 3] and its\nIndium-composition-tuned bandgap [4, 5], the Indium Gallium Nitride (InGaN)\nternary alloy is a good candidate for high-efficiency-high-reliability solar\ncells able to operate in harsh environments. Unfortunately, InGaN p-doping is\nstill a challenge, owing to InGaN residual n-doping [6], the lack of dedicated\nac-ceptors [7] and the complex fabrication process itself [8, 9]. To these\ndrawbacks can be added the uneasy fabrication of ohmic contacts [4] and the\ndifficulty to grow the high-quality-high-Indium-content thin films [10] which\nwould be needed to cover the whole solar spectrum. These drawbacks still\nprevent InGaN solar cells to be competitive with other well established III-V\nand silicon technologies [11]. In this letter, is proposed a new Metal-IN (MIN)\nInGaN solar cell structure where the InGaN p-doped layer is removed and\nreplaced by a Schottky contact, lifting one of the above mentioned drawbacks. A\nset of realistic physical models based on actual measurements is used to\nsimulate and optimize its behavior and performance using mathematically\nrigorous multi-criteria optimization methods, aiming to show that both\nefficiency and fabrication tolerances are better than the previously described\nsimple InGaN Schottky solar cell [12].\n",
"title": "InGaN Metal-IN Solar Cell: optimized efficiency and fabrication tolerance"
}
| null | null | null | null | true | null |
10034
| null |
Default
| null | null |
null |
{
"abstract": " With the wide application of machine learning algorithms to the real world,\nclass imbalance and concept drift have become crucial learning issues. Class\nimbalance happens when the data categories are not equally represented, i.e.,\nat least one category is minority compared to other categories. It can cause\nlearning bias towards the majority class and poor generalization. Concept drift\nis a change in the underlying distribution of the problem, and is a significant\nissue specially when learning from data streams. It requires learners to be\nadaptive to dynamic changes.\nClass imbalance and concept drift can significantly hinder predictive\nperformance, and the problem becomes particularly challenging when they occur\nsimultaneously. This challenge arises from the fact that one problem can affect\nthe treatment of the other. For example, drift detection algorithms based on\nthe traditional classification error may be sensitive to the imbalanced degree\nand become less effective; and class imbalance techniques need to be adaptive\nto changing imbalance rates, otherwise the class receiving the preferential\ntreatment may not be the correct minority class at the current moment.\nTherefore, the mutual effect of class imbalance and concept drift should be\nconsidered during algorithm design.\nThe aim of this workshop is to bring together researchers from the areas of\nclass imbalance learning and concept drift in order to encourage discussions\nand new collaborations on solving the combined issue of class imbalance and\nconcept drift. It provides a forum for international researchers and\npractitioners to share and discuss their original work on addressing new\nchallenges and research issues in class imbalance learning, concept drift, and\nthe combined issues of class imbalance and concept drift. The proceedings\ninclude 8 papers on these topics.\n",
"title": "Proceedings of the IJCAI 2017 Workshop on Learning in the Presence of Class Imbalance and Concept Drift (LPCICD'17)"
}
| null | null | null | null | true | null |
10035
| null |
Default
| null | null |
null |
{
"abstract": " Nonlinear dynamics on graphs has rapidly become a topical issue with many\nphysical applications, ranging from nonlinear optics to Bose-Einstein\ncondensation. Whenever in a physical experiment a ramified structure is\ninvolved, it can prove useful to approximate such a structure by a metric\ngraph, or network. For the Schroedinger equation it turns out that the sixth\npower in the nonlinear term of the energy is critical in the sense that below\nthat power the constrained energy is lower bounded irrespectively of the value\nof the mass (subcritical case). On the other hand, if the nonlinearity power\nequals six, then the lower boundedness depends on the value of the mass: below\na critical mass, the constrained energy is lower bounded, beyond it, it is not.\nFor powers larger than six the constrained energy functional is never lower\nbounded, so that it is meaningless to speak about ground states (supercritical\ncase). These results are the same as in the case of the nonlinear Schrodinger\nequation on the real line. In fact, as regards the existence of ground states,\nthe results for systems on graphs differ, in general, from the ones for systems\non the line even in the subcritical case: in the latter case, whenever the\nconstrained energy is lower bounded there always exist ground states (the\nsolitons, whose shape is explicitly known), whereas for graphs the existence of\na ground state is not guaranteed. For the critical case, our results show a\nphenomenology much richer than the analogous on the line.\n",
"title": "Nonlinear dynamics on branched structures and networks"
}
| null | null | null | null | true | null |
10036
| null |
Default
| null | null |
null |
{
"abstract": " Synthesis of DNA molecules offers unprecedented advances in storage\ntechnology. Yet, the microscopic world in which these molecules reside induces\nerror patterns that are fundamentally different from their digital\ncounterparts. Hence, to maintain reliability in reading and writing, new coding\nschemes must be developed. In a reading technique called shotgun sequencing, a\nlong DNA string is read in a sliding window fashion, and a profile vector is\nproduced. It was recently suggested by Kiah et al. that such a vector can\nrepresent the permutation which is induced by its entries, and hence a\nrank-modulation scheme arises. Although this interpretation suggests high error\ntolerance, it is unclear which permutations are feasible, and how to produce a\nDNA string whose profile vector induces a given permutation. In this paper, by\nobserving some necessary conditions, an upper bound for the number of feasible\npermutations is given. Further, a technique for deciding the feasibility of a\npermutation is devised. By using insights from this technique, an algorithm for\nproducing a considerable number of feasible permutations is given, which\napplies to any alphabet size and any window length.\n",
"title": "Rank modulation codes for DNA storage"
}
| null | null |
[
"Computer Science"
] | null | true | null |
10037
| null |
Validated
| null | null |
null |
{
"abstract": " Excitation of relativistic electron beam driven wakefield in a cold plasma is\nstudied using 1-D fluid simulation techniques where the effect of ion motion is\nincluded. We have excited the wakefield using a ultra-relativistic,\nhomogeneous, rigid electron beam with different beam densities and mass-ratios\n(ratio of electron's to ion's mass). We have shown that the numerically excited\nwakefield is in a good agreement with the analytical results of Rosenzweig et\nal. \\textcolor{blue}{[Physical Review A. 40, 9, (1989)]} for several plasma\nperiods. It is shown here that the excited wake wave is equivalent to the\ncorresponding \"Khachatryan mode\" \\textcolor{blue}{[Physical Review E. 58, 6,\n(1998)]}. After several plasma periods, it is found that the excited wake wave\ngradually modifies and finally breaks, exhibiting sharp spikes in density and\nsawtooth like structure in electric field profile. It is shown here that the\nexcited wake wave breaks much below the Khachatryan's wave breaking limit.\n",
"title": "Effect of ion motion on relativistic electron beam driven wakefield in a cold plasma"
}
| null | null |
[
"Physics"
] | null | true | null |
10038
| null |
Validated
| null | null |
null |
{
"abstract": " Kernel PCA is a widely used nonlinear dimension reduction technique in\nmachine learning, but storing the kernel matrix is notoriously challenging when\nthe sample size is large. Inspired by Yi et al. [2016], where the idea of\npartial matrix sampling followed by nonconvex optimization is proposed for\nmatrix completion and robust PCA, we apply a similar approach to\nmemory-efficient Kernel PCA. In theory, with no assumptions on the kernel\nmatrix in terms of eigenvalues or eigenvectors, we established a model-free\ntheory for the low-rank approximation based on any local minimum of the\nproposed objective function. As interesting byproducts, when the underlying\npositive semidefinite matrix is assumed to be low-rank and highly structured,\ncorollaries of our main theorem improve the state-of-the-art results of Ge et\nal. [2016, 2017] for nonconvex matrix completion with no spurious local minima.\nNumerical experiments also show that our approach is competitive in terms of\napproximation accuracy compared to the well-known Nyström algorithm for\nKernel PCA.\n",
"title": "Memory-efficient Kernel PCA via Partial Matrix Sampling and Nonconvex Optimization: a Model-free Analysis of Local Minima"
}
| null | null | null | null | true | null |
10039
| null |
Default
| null | null |
null |
{
"abstract": " Organized crime inflicts human suffering on a genocidal scale: the Mexican\ndrug cartels have murdered 150,000 people since 2006, upwards of 700,000 people\nper year are \"exported\" in a human trafficking industry enslaving an estimated\n40 million people. These nefarious industries rely on sophisticated money\nlaundering schemes to operate. Despite tremendous resources dedicated to\nanti-money laundering (AML) only a tiny fraction of illicit activity is\nprevented. The research community can help. In this brief paper, we map the\nstructural and behavioral dynamics driving the technical challenge. We review\nAML methods, current and emergent. We provide a first look at scalable graph\nconvolutional neural networks for forensic analysis of financial data, which is\nmassive, dense, and dynamic. We report preliminary experimental results using a\nlarge synthetic graph (1M nodes, 9M edges) generated by a data simulator we\ncreated called AMLSim. We consider opportunities for high performance\nefficiency, in terms of computation and memory, and we share results from a\nsimple graph compression experiment. Our results support our working hypothesis\nthat graph deep learning for AML bears great promise in the fight against\ncriminal financial activity.\n",
"title": "Scalable Graph Learning for Anti-Money Laundering: A First Look"
}
| null | null | null | null | true | null |
10040
| null |
Default
| null | null |
null |
{
"abstract": " In the present work, we describe the results obtained with a large ($\\approx\n133$ cm$^3$) TeO$_2$ bolometer, with a view to a search for neutrinoless\ndouble-beta decay ($0\\nu\\beta\\beta$) of $^{130}$Te. We demonstrate an efficient\n$\\alpha$ particle discrimination (99.9\\%) with a high acceptance of the\n$0\\nu\\beta\\beta$ signal (about 96\\%), expected at $\\approx 2.5$ MeV. This\nunprecedented result was possible thanks to the superior performance (10 eV rms\nbaseline noise) of a Neganov-Luke-assisted germanium bolometer used to detect a\ntiny (70 eV) light signal from the TeO$_2$ detector, dominated by\n$\\gamma$($\\beta$)-induced Cherenkov radiation but exhibiting also a clear\nscintillation component. The obtained results represent a major breakthrough\ntowards the TeO$_2$-based version of CUORE Upgrade with Particle IDentification\n(CUPID), a ton-scale cryogenic $0\\nu\\beta\\beta$ experiment proposed as a\nfollow-up to the CUORE project with particle identification. The CUORE\nexperiment began recently a search for neutrinoless double-beta decay of\n$^{130}$Te with an array of 988 125-cm$^3$ TeO$_2$ bolometers. The lack of\n$\\alpha$ discrimination in CUORE makes $\\alpha$ decays at the detector surface\nthe dominant background component, at the level of $\\approx 0.01$ counts/(keV\nkg y) in the region of interest. We show here, for the first time with a\nCUORE-size bolometer and using the same technology as CUORE for the readout of\nboth heat and light signals, that surface $\\alpha$ background can be fully\nrejected.\n",
"title": "Complete event-by-event $α$/$γ(β)$ separation in a full-size TeO$_2$ CUORE bolometer by Neganov-Luke-magnified light detection"
}
| null | null | null | null | true | null |
10041
| null |
Default
| null | null |
null |
{
"abstract": " MicroRNAs (miRNAs) are small non-coding RNAs that function as regulators of\ngene expression. In recent years, there has been a tremendous and growing\ninterest among researchers to investigate the role of miRNAs in normal cellular\nas well as in disease processes. Thus to investigate the role of miRNAs in oral\ncancer, we analyse the expression levels of miRNAs to identify miRNAs with\nstatistically significant differential expression in cancer tissues.\nIn this article, we propose a novel Bayesian hierarchical model of miRNA\nexpression data. Compelling evidences have demonstrated that the transcription\nprocess of miRNAs in human genome is a latent process instrumental for the\nobserved expression levels. We take into account positional clustering of the\nmiRNAs in the analysis and model the latent transcription phenomenon\nnonparametrically by an appropriate Gaussian process.\nFor the testing purpose we employ a novel Bayesian multiple testing method\nwhere we mainly focus on utilizing the dependence structure between the\nhypotheses for better results, while also ensuring optimality in many respects.\nIndeed, our non-marginal method yielded results in accordance with the\nunderlying scientific knowledge which are found to be missed by the very\npopular Benjamini-Hochberg method.\n",
"title": "A Novel Bayesian Multiple Testing Approach to Deregulated miRNA Discovery Harnessing Positional Clustering"
}
| null | null | null | null | true | null |
10042
| null |
Default
| null | null |
null |
{
"abstract": " Shape completion, the problem of estimating the complete geometry of objects\nfrom partial observations, lies at the core of many vision and robotics\napplications. In this work, we propose Point Completion Network (PCN), a novel\nlearning-based approach for shape completion. Unlike existing shape completion\nmethods, PCN directly operates on raw point clouds without any structural\nassumption (e.g. symmetry) or annotation (e.g. semantic class) about the\nunderlying shape. It features a decoder design that enables the generation of\nfine-grained completions while maintaining a small number of parameters. Our\nexperiments show that PCN produces dense, complete point clouds with realistic\nstructures in the missing regions on inputs with various levels of\nincompleteness and noise, including cars from LiDAR scans in the KITTI dataset.\n",
"title": "PCN: Point Completion Network"
}
| null | null | null | null | true | null |
10043
| null |
Default
| null | null |
null |
{
"abstract": " In this paper we establish a connection between non-convex optimization\nmethods for training deep neural networks and nonlinear partial differential\nequations (PDEs). Relaxation techniques arising in statistical physics which\nhave already been used successfully in this context are reinterpreted as\nsolutions of a viscous Hamilton-Jacobi PDE. Using a stochastic control\ninterpretation allows we prove that the modified algorithm performs better in\nexpectation that stochastic gradient descent. Well-known PDE regularity results\nallow us to analyze the geometry of the relaxed energy landscape, confirming\nempirical evidence. The PDE is derived from a stochastic homogenization\nproblem, which arises in the implementation of the algorithm. The algorithms\nscale well in practice and can effectively tackle the high dimensionality of\nmodern neural networks.\n",
"title": "Deep Relaxation: partial differential equations for optimizing deep neural networks"
}
| null | null | null | null | true | null |
10044
| null |
Default
| null | null |
null |
{
"abstract": " In this note we define circular k-successions in permutations in one-line\nnotation and count permutations that avoid substrings j(j+k) and j(j+k) (mod\nn). We also count circular permutations that avoid such substrings, and show\nthat for substrings j(j+k) (mod n), the number of permutations depends on\nwhether n is prime, and more generally, on whether n and k are relatively\nprime.\n",
"title": "Forbidden Substrings In Circular K-Successions"
}
| null | null | null | null | true | null |
10045
| null |
Default
| null | null |
null |
{
"abstract": " We study weighted particle systems in which new generations are resampled\nfrom current particles with probabilities proportional to their weights. This\ncovers a broad class of sequential Monte Carlo (SMC) methods, widely-used in\napplied statistics and cognate disciplines. We consider the genealogical tree\nembedded into such particle systems, and identify conditions, as well as an\nappropriate time-scaling, under which they converge to the Kingman n-coalescent\nin the infinite system size limit in the sense of finite-dimensional\ndistributions. Thus, the tractable n-coalescent can be used to predict the\nshape and size of SMC genealogies, as we illustrate by characterising the\nlimiting mean and variance of the tree height. SMC genealogies are known to be\nconnected to algorithm performance, so that our results are likely to have\napplications in the design of new methods as well. Our conditions for\nconvergence are strong, but we show by simulation that they do not appear to be\nnecessary.\n",
"title": "Asymptotic genealogies of interacting particle systems with an application to sequential Monte Carlo"
}
| null | null | null | null | true | null |
10046
| null |
Default
| null | null |
null |
{
"abstract": " The nodal and effectively relativistic dispersion featuring in a range of\nnovel materials including two- dimensional graphene and three-dimensional Dirac\nand Weyl semimetals has attracted enormous interest during the past decade.\nHere, by studying the structure and symmetry of the diagrammatic expansion, we\nshow that these nodal touching points are in fact perturbatively stable to all\norders with respect to generic two-body interactions. For effective low-energy\ntheories relevant for single and multilayer graphene, type-I and type-II Weyl\nand Dirac semimetals as well as Weyl points with higher topological charge,\nthis stability is shown to be a direct consequence of a spatial symmetry that\nanti-commutes with the effective Hamiltonian while leaving the interaction\ninvariant. A more refined argument is applied to the honeycomb lattice model of\ngraphene showing that its Dirac points are also perturbatively stable to all\norders. We also give examples of nodal Hamiltonians that acquire a gap from\ninteractions as a consequence of symmetries different from those of Weyl and\nDirac materials.\n",
"title": "Symmetry Enforced Stability of Interacting Weyl and Dirac Semimetals"
}
| null | null | null | null | true | null |
10047
| null |
Default
| null | null |
null |
{
"abstract": " Predicting the outcome of sports events is a hard task. We quantify this\ndifficulty with a coefficient that measures the distance between the observed\nfinal results of sports leagues and idealized perfectly balanced competitions\nin terms of skill. This indicates the relative presence of luck and skill. We\ncollected and analyzed all games from 198 sports leagues comprising 1503\nseasons from 84 countries of 4 different sports: basketball, soccer, volleyball\nand handball. We measured the competitiveness by countries and sports. We also\nidentify in each season which teams, if removed from its league, result in a\ncompletely random tournament. Surprisingly, not many of them are needed. As\nanother contribution of this paper, we propose a probabilistic graphical model\nto learn about the teams' skills and to decompose the relative weights of luck\nand skill in each game. We break down the skill component into factors\nassociated with the teams' characteristics. The model also allows to estimate\nas 0.36 the probability that an underdog team wins in the NBA league, with a\nhome advantage adding 0.09 to this probability. As shown in the first part of\nthe paper, luck is substantially present even in the most competitive\nchampionships, which partially explains why sophisticated and complex\nfeature-based models hardly beat simple models in the task of forecasting\nsports' outcomes.\n",
"title": "Luck is Hard to Beat: The Difficulty of Sports Prediction"
}
| null | null | null | null | true | null |
10048
| null |
Default
| null | null |
null |
{
"abstract": " We propose a generalization of neural network sequence models. Instead of\npredicting one symbol at a time, our multi-scale model makes predictions over\nmultiple, potentially overlapping multi-symbol tokens. A variation of the\nbyte-pair encoding (BPE) compression algorithm is used to learn the dictionary\nof tokens that the model is trained with. When applied to language modelling,\nour model has the flexibility of character-level models while maintaining many\nof the performance benefits of word-level models. Our experiments show that\nthis model performs better than a regular LSTM on language modeling tasks,\nespecially for smaller models.\n",
"title": "Multiscale sequence modeling with a learned dictionary"
}
| null | null | null | null | true | null |
10049
| null |
Default
| null | null |
null |
{
"abstract": " In spite of their intrinsic one-dimensional nature matrix product states have\nbeen systematically used to obtain remarkably accurate results for\ntwo-dimensional systems. Motivated by basic entropic arguments favoring\nprojected entangled-pair states as the method of choice, we assess the relative\nperformance of infinite matrix product states and infinite projected\nentangled-pair states on cylindrical geometries. By considering the Heisenberg\nand half-filled Hubbard models on the square lattice as our benchmark cases, we\nevaluate their variational energies as a function of both bond dimension as\nwell as cylinder width. In both examples we find crossovers at moderate\ncylinder widths, i.e. for the largest bond dimensions considered we find an\nimprovement on the variational energies for the Heisenberg model by using\nprojected entangled-pair states at a width of about 11 sites, whereas for the\nhalf-filled Hubbard model this crossover occurs at about 7 sites.\n",
"title": "Infinite Matrix Product States vs Infinite Projected Entangled-Pair States on the Cylinder: a comparative study"
}
| null | null | null | null | true | null |
10050
| null |
Default
| null | null |
null |
{
"abstract": " In the last few years, microblogging platforms such as Twitter have given\nrise to a deluge of textual data that can be used for the analysis of informal\ncommunication between millions of individuals. In this work, we propose an\ninformation-theoretic approach to geographic language variation using a corpus\nbased on Twitter. We test our models with tens of concepts and their associated\nkeywords detected in Spanish tweets geolocated in Spain. We employ\ndialectometric measures (cosine similarity and Jensen-Shannon divergence) to\nquantify the linguistic distance on the lexical level between cells created in\na uniform grid over the map. This can be done for a single concept or in the\ngeneral case taking into account an average of the considered variants. The\nlatter permits an analysis of the dialects that naturally emerge from the data.\nInterestingly, our results reveal the existence of two dialect macrovarieties.\nThe first group includes a region-specific speech spoken in small towns and\nrural areas whereas the second cluster encompasses cities that tend to use a\nmore uniform variety. Since the results obtained with the two different metrics\nqualitatively agree, our work suggests that social media corpora can be\nefficiently used for dialectometric analyses.\n",
"title": "Dialectometric analysis of language variation in Twitter"
}
| null | null | null | null | true | null |
10051
| null |
Default
| null | null |
null |
{
"abstract": " There are large amounts of insight and social discovery potential in mining\ncrowd-sourced comments left on popular news forums like Reddit.com, Tumblr.com,\nFacebook.com and Hacker News. Unfortunately, due the overwhelming amount of\nparticipation with its varying quality of commentary, extracting value out of\nsuch data isn't always obvious nor timely. By designing efficient, single-pass\nand adaptive natural language filters to quickly prune spam, noise, copy-cats,\nmarketing diversions, and out-of-context posts, we can remove over a third of\nentries and return the comments with a higher probability of relatedness to the\noriginal article in question. The approach presented here uses an adaptive,\ntwo-step filtering process. It first leverages the original article posted in\nthe thread as a starting corpus to parse comments by matching intersecting\nwords and term-ratio balance per sentence then grows the corpus by adding new\nwords harvested from high-matching comments to increase filtering accuracy over\ntime.\n",
"title": "Single-Pass, Adaptive Natural Language Filtering: Measuring Value in User Generated Comments on Large-Scale, Social Media News Forums"
}
| null | null |
[
"Computer Science"
] | null | true | null |
10052
| null |
Validated
| null | null |
null |
{
"abstract": " Most undergraduate level abstract algebra texts use $\\mathbb{Z}[\\sqrt{-5}]$\nas an example of an integral domain which is not a unique factorization domain\n(or UFD) by exhibiting two distinct irreducible factorizations of a nonzero\nelement. But such a brief example, which requires merely an understanding of\nbasic norms, only scratches the surface of how elements actually factor in this\nring of algebraic integers. We offer here an interactive framework which shows\nthat while $\\mathbb{Z}[\\sqrt{-5}]$ is not a UFD, it does satisfy a slightly\nweaker factorization condition, known as half-factoriality. The arguments\ninvolved revolve around the Fundamental Theorem of Ideal Theory.\n",
"title": "How Do Elements Really Factor in $\\mathbb{Z}[\\sqrt{-5}]$?"
}
| null | null | null | null | true | null |
10053
| null |
Default
| null | null |
null |
{
"abstract": " This paper studies the heat equation $u_t=\\Delta u$ in a bounded domain\n$\\Omega\\subset\\mathbb{R}^{n}(n\\geq 2)$ with positive initial data and a local\nnonlinear Neumann boundary condition: the normal derivative $\\partial\nu/\\partial n=u^{q}$ on partial boundary $\\Gamma_1\\subseteq \\partial\\Omega$ for\nsome $q>1$, while $\\partial u/\\partial n=0$ on the other part. We investigate\nthe lower bound of the blow-up time $T^{*}$ of $u$ in several aspects. First,\n$T^{*}$ is proved to be at least of order $(q-1)^{-1}$ as $q\\rightarrow 1^{+}$.\nSince the existing upper bound is of order $(q-1)^{-1}$, this result is sharp.\nSecondly, if $\\Omega$ is convex and $|\\Gamma_{1}|$ denotes the surface area of\n$\\Gamma_{1}$, then $T^{*}$ is shown to be at least of order\n$|\\Gamma_{1}|^{-\\frac{1}{n-1}}$ for $n\\geq 3$ and\n$|\\Gamma_{1}|^{-1}\\big/\\ln\\big(|\\Gamma_{1}|^{-1}\\big)$ for $n=2$ as\n$|\\Gamma_{1}|\\rightarrow 0$, while the previous result is\n$|\\Gamma_{1}|^{-\\alpha}$ for any $\\alpha<\\frac{1}{n-1}$. Finally, we generalize\nthe results for convex domains to the domains with only local convexity near\n$\\Gamma_{1}$.\n",
"title": "Improvements on lower bounds for the blow-up time under local nonlinear Neumann conditions"
}
| null | null | null | null | true | null |
10054
| null |
Default
| null | null |
null |
{
"abstract": " This paper addresses the challenge of humanoid robot teleoperation in a\nnatural indoor environment via a Brain-Computer Interface (BCI). We leverage\ndeep Convolutional Neural Network (CNN) based image and signal understanding to\nfacilitate both real-time object detection and dry-Electroencephalography (EEG)\nbased human cortical brain bio-signal decoding. We employ recent advances in\ndry-EEG technology to stream and collect the cortical waveforms from subjects\nwhile the subjects fixate on variable Steady-State Visual Evoked Potential\n(SSVEP) stimuli generated directly from the environment the robot is\nnavigating. To these ends, we propose the use of novel variable BCI stimuli by\nutilising the real-time video streamed via the on-board robot camera as visual\ninput for SSVEP where the CNN detected natural scene objects are altered and\nflickered with differing frequencies (10Hz, 12Hz and 15Hz). These stimuli are\nnot akin to traditional stimuli - as both the dimensions of the flicker regions\nand their on-screen position changes depending on the scene objects detected in\nthe scene. On-screen object selection via dry-EEG enabled SSVEP in this way,\nfacilitates the on-line decoding of human cortical brain signals via a\nsecondary CNN approach into teleoperation robot commands (approach object, move\nin a specific direction: right, left or back). This SSVEP decoding model is\ntrained via a priori offline experimental data in which very similar visual\ninput is present for all subjects. The resulting offline classification\ndemonstrates extremely high performance and with mean accuracies of 96% and 90%\nfor the real-time robot navigation experiment across multiple test subjects.\n",
"title": "Using Variable Natural Environment Brain-Computer Interface Stimuli for Real-time Humanoid Robot Navigation"
}
| null | null | null | null | true | null |
10055
| null |
Default
| null | null |
null |
{
"abstract": " A novel device that can be used as a tunable support-free phase plate for\ntransmission electron microscopy of weakly scattering specimens is described.\nThe device relies on the generation of a controlled phase shift by the magnetic\nfield of a segment of current-carrying wire that is oriented parallel or\nantiparallel to the electron beam. The validity of the concept is established\nusing both experimental electron holographic measurements and a theoretical\nmodel based on Ampere's law. Computer simulations are used to illustrate the\nresulting contrast enhancement for studies of biological cells and\nmacromolecules.\n",
"title": "Tunable Ampere phase plate for low dose imaging of biomolecular complexes"
}
| null | null | null | null | true | null |
10056
| null |
Default
| null | null |
null |
{
"abstract": " In this paper, the problem of tracking desired longitudinal and lateral\nmotions for a vehicle is addressed. Let us point out that a \"good\" modeling is\noften quite difficult or even impossible to obtain. It is due for example to\nparametric uncertainties, for the vehicle mass, inertia or for the interaction\nforces between the wheels and the road pavement. To overcome this type of\ndifficulties, we consider a model-free control approach leading to\n\"intelligent\" controllers. The longitudinal and the lateral motions, on one\nhand, and the driving/braking torques and the steering wheel angle, on the\nother hand, are respectively the output and the input variables. An important\npart of this work is dedicated to present simulation results with actual data.\nActual data, used in Matlab as reference trajectories, have been previously\nrecorded with an instrumented Peugeot 406 experimental car. The simulation\nresults show the efficiency of our approach. Some comparisons with a nonlinear\nflatness-based control in one hand, and with a classical PID control in another\nhand confirm this analysis. Other virtual data have been generated through the\ninterconnected platform SiVIC/RTMaps, which is a virtual simulation platform\nfor prototyping and validation of advanced driving assistance systems.\n",
"title": "An efficient model-free setting for longitudinal and lateral vehicle control. Validation through the interconnected pro-SiVIC/RTMaps prototyping platform"
}
| null | null | null | null | true | null |
10057
| null |
Default
| null | null |
null |
{
"abstract": " We present development of a genetic algorithm for fitting potential energy\ncurves of diatomic molecules to experimental data. Our approach does not\ninvolve any functional form for fitting, which makes it a general fitting\nprocedure. In particular, it takes in a guess potential, perhaps from an $ab \\\ninitio$ calculation, along with experimental measurements of vibrational\nbinding energies, rotational constants, and their experimental uncertainties.\nThe fitting procedure is able to modify the guess potential until it converges\nto better than 1% uncertainty, as measured by $\\bar{\\chi}^2$. We present the\ndetails of this technique along with a comparison of potentials calculated by\nour genetic algorithm and the state of the art fitting techniques based on\ninverted perturbation approach for the $X \\ ^1\\Sigma^+$ and $C \\ ^1\\Sigma^+$\npotentials of lithium-rubidium.\n",
"title": "Genetic fitting techniques for precision ultracold spectroscopy"
}
| null | null | null | null | true | null |
10058
| null |
Default
| null | null |
null |
{
"abstract": " Large datasets represented by multidimensional data point clouds often\npossess non-trivial distributions with branching trajectories and excluded\nregions, with the recent single-cell transcriptomic studies of developing\nembryo being notable examples. Reducing the complexity and producing compact\nand interpretable representations of such data remains a challenging task. Most\nof the existing computational methods are based on exploring the local data\npoint neighbourhood relations, a step that can perform poorly in the case of\nmultidimensional and noisy data. Here we present ElPiGraph, a scalable and\nrobust method for approximation of datasets with complex structures which does\nnot require computing the complete data distance matrix or the data point\nneighbourhood graph. This method is able to withstand high levels of noise and\nis capable of approximating complex topologies via principal graph ensembles\nthat can be combined into a consensus principal graph. ElPiGraph deals\nefficiently with large and complex datasets in various fields from biology,\nwhere it can be used to infer gene dynamics from single-cell RNA-Seq, to\nastronomy, where it can be used to explore complex structures in the\ndistribution of galaxies.\n",
"title": "Robust And Scalable Learning Of Complex Dataset Topologies Via Elpigraph"
}
| null | null | null | null | true | null |
10059
| null |
Default
| null | null |
null |
{
"abstract": " We explore the non-equilibrium evolution and stationary states of an open\nmany-body system which displays epidemic spreading dynamics in a classical and\na quantum regime. Our study is motivated by recent experiments conducted in\nstrongly interacting gases of highly excited Rydberg atoms where the\nfacilitated excitation of Rydberg states competes with radiative decay. These\nsystems approximately implement open quantum versions of models for population\ndynamics or disease spreading where species can be in a healthy, infected or\nimmune state. We show that in a two-dimensional lattice, depending on the\ndominance of either classical or quantum effects, the system may display a\ndifferent kind of non-equilibrium phase transition. We moreover discuss the\nobservability of our findings in laser driven Rydberg gases with particular\nfocus on the role of long-range interactions.\n",
"title": "Epidemic dynamics in open quantum spin systems"
}
| null | null | null | null | true | null |
10060
| null |
Default
| null | null |
null |
{
"abstract": " Grip control during robotic in-hand manipulation is usually modeled as part\nof a monolithic task, relying on complex controllers specialized for specific\nsituations. Such approaches do not generalize well and are difficult to apply\nto novel manipulation tasks. Here, we propose a modular object stabilization\nmethod based on a proposition that explains how humans achieve grasp stability.\nIn this bio-mimetic approach, independent tactile grip stabilization\ncontrollers ensure that slip does not occur locally at the engaged robot\nfingers. Such local slip is predicted from the tactile signals of each\nfingertip sensor i.e., BioTac and BioTac SP by Syntouch. We show that stable\ngrasps emerge without any form of central communication when such independent\ncontrollers are engaged in the control of multi-digit robotic hands. These\ngrasps are resistant to external perturbations while being capable of\nstabilizing a large variety of objects.\n",
"title": "In-Hand Object Stabilization by Independent Finger Control"
}
| null | null | null | null | true | null |
10061
| null |
Default
| null | null |
null |
{
"abstract": " Several recent studies have reported different intrinsic correlations between\nthe AGN mid-IR luminosity ($L_{MIR}$) and the rest-frame 2-10 keV luminosity\n($L_{X}$) for luminous quasars. To understand the origin of the difference in\nthe observed $L_{X}-L_{MIR}$ relations, we study a sample of 3,247\nspectroscopically confirmed type 1 AGNs collected from Boötes, XMM-COSMOS,\nXMM-XXL-North, and the SDSS quasars in the Swift/XRT footprint spanning over\nfour orders of magnitude in luminosity. We carefully examine how different\nobservational constraints impact the observed $L_{X}-L_{MIR}$ relations,\nincluding the inclusion of X-ray non-detected objects, possible X-ray\nabsorption in type 1 AGNs, X-ray flux limits, and star formation contamination.\nWe find that the primary factor driving the different $L_{X}-L_{MIR}$ relations\nreported in the literature is the X-ray flux limits for different studies. When\ntaking these effects into account, we find that the X-ray luminosity and mid-IR\nluminosity (measured at rest-frame $6\\mu m$, or $L_{6\\mu m}$) of our sample of\ntype 1 AGNs follow a bilinear relation in the log-log plane: $\\log L_X\n=(0.84\\pm0.03)\\times\\log L_{6\\mu m}/10^{45}{\\rm erg\\;s^{-1}} + (44.60\\pm0.01)$\nfor $L_{6\\mu m} < 10^{44.79}{\\rm erg\\;s^{-1}} $, and $\\log L_X =\n(0.40\\pm0.03)\\times\\log L_{6\\mu m}/10^{45}{\\rm erg\\;s^{-1}} +(44.51\\pm0.01)$\nfor $L_{6\\mu m} \\geq 10^{44.79}{\\rm erg\\;s^{-1}} $. This suggests that the\nluminous type 1 quasars have a shallower $L_{X}-L_{MIR}$ correlation than the\napproximately linear relations found in local Seyfert galaxies. This result is\nconsistent with previous studies reporting a luminosity-dependent\n$L_{X}-L_{MIR}$ relation, and implies that assuming a linear $L_{X}-L_{MIR}$\nrelation to infer the neutral gas column density for X-ray absorption might\noverestimate the column densities in luminous quasars.\n",
"title": "The X-ray and Mid-Infrared luminosities in Luminous Type 1 Quasars"
}
| null | null | null | null | true | null |
10062
| null |
Default
| null | null |
null |
{
"abstract": " We show that every bounded subset of an Euclidean space can be approximated\nby a set that admits a certain vector field, the so-called Cahn-Hoffman vector\nfield, that is subordinate to a given anisotropic metric and has a\nsquare-integrable divergence. More generally, we introduce a concept of facets\nas a kind of directed sets, and show that they can be approximated in a similar\nmanner.\nWe use this approximation to construct test functions necessary to prove the\ncomparison principle for viscosity solutions of the level set formulation of\nthe crystalline mean curvature flow that were recently introduced by the\nauthors. As a consequence, we obtain the well-posedness of the viscosity\nsolutions in an arbitrary dimension, which extends the validity of the result\nin the previous paper.\n",
"title": "Approximation of general facets by regular facets with respect to anisotropic total variation energies and its application to the crystalline mean curvature flow"
}
| null | null | null | null | true | null |
10063
| null |
Default
| null | null |
null |
{
"abstract": " We study fairness within the stochastic, \\emph{multi-armed bandit} (MAB)\ndecision making framework. We adapt the fairness framework of \"treating similar\nindividuals similarly\" to this setting. Here, an `individual' corresponds to an\narm and two arms are `similar' if they have a similar quality distribution.\nFirst, we adopt a {\\em smoothness constraint} that if two arms have a similar\nquality distribution then the probability of selecting each arm should be\nsimilar. In addition, we define the {\\em fairness regret}, which corresponds to\nthe degree to which an algorithm is not calibrated, where perfect calibration\nrequires that the probability of selecting an arm is equal to the probability\nwith which the arm has the best quality realization. We show that a variation\non Thompson sampling satisfies smooth fairness for total variation distance,\nand give an $\\tilde{O}((kT)^{2/3})$ bound on fairness regret. This complements\nprior work, which protects an on-average better arm from being less favored. We\nalso explain how to extend our algorithm to the dueling bandit setting.\n",
"title": "Calibrated Fairness in Bandits"
}
| null | null | null | null | true | null |
10064
| null |
Default
| null | null |
null |
{
"abstract": " Virtual Reality, an immersive technology that replicates an environment via\ncomputer-simulated reality, gets a lot of attention in the entertainment\nindustry. However, VR has also great potential in other areas, like the medical\ndomain, Examples are intervention planning, training and simulation. This is\nespecially of use in medical operations, where an aesthetic outcome is\nimportant, like for facial surgeries. Alas, importing medical data into Virtual\nReality devices is not necessarily trivial, in particular, when a direct\nconnection to a proprietary application is desired. Moreover, most researcher\ndo not build their medical applications from scratch, but rather leverage\nplatforms like MeVisLab, MITK, OsiriX or 3D Slicer. These platforms have in\ncommon that they use libraries like ITK and VTK, and provide a convenient\ngraphical interface. However, ITK and VTK do not support Virtual Reality\ndirectly. In this study, the usage of a Virtual Reality device for medical data\nunder the MeVisLab platform is presented. The OpenVR library is integrated into\nthe MeVisLab platform, allowing a direct and uncomplicated usage of the head\nmounted display HTC Vive inside the MeVisLab platform. Medical data coming from\nother MeVisLab modules can directly be connected per drag-and-drop to the\nVirtual Reality module, rendering the data inside the HTC Vive for immersive\nvirtual reality inspection.\n",
"title": "HTC Vive MeVisLab integration via OpenVR for medical applications"
}
| null | null | null | null | true | null |
10065
| null |
Default
| null | null |
null |
{
"abstract": " In this note, we provide a conceptual explanation of a well-known polynomial\nidentity used in algebraic number theory.\n",
"title": "Explanation of a Polynomial Identity"
}
| null | null | null | null | true | null |
10066
| null |
Default
| null | null |
null |
{
"abstract": " We examine the effect of the stress tensor of a quantum matter field, such as\nthe electromagnetic field, on the spectrum of primordial gravity waves expected\nin inflationary cosmology. We find that the net effect is a small reduction in\nthe power spectrum, especially at higher frequencies, but which has a different\nform from that described by the usual spectral index. Thus this effect has a\ncharacteristic signature, and is in principle observable. The net effect is a\nsum of two contributions, one of which is due to quantum fluctuations of the\nmatter field stress tensor. The other is a quantum correction to the graviton\nfield due to coupling to the expectation value of this stress tensor. Both\ncontributions are sensitive to initial conditions in the very early universe,\nso this effect has the potential to act as a probe of these initial conditions.\n",
"title": "Quantum Stress Tensor Fluctuations and Primordial Gravity Waves"
}
| null | null | null | null | true | null |
10067
| null |
Default
| null | null |
null |
{
"abstract": " In this article we introduce a new geometric object called hyperbolic Pascal\nsimplex. This new object is presented by the regular hypercube mosaic in the\n4-dimensional hyperbolic space. The definition of the hyperbolic Pascal\nsimplex, whose hyperfaces are hyperbolic Pascal pyramids and faces are\nhyperbolic Pascals triangles, is a natural generalization of the definition of\nthe hyperbolic Pascal triangle and pyramid. We describe the growing of the\nhyperbolic Pascal simplex considering the numbers and the values of the\nelements. Further figures illustrate the stepping from a level to the next one.\n",
"title": "Hyperbolic Pascal simplex"
}
| null | null | null | null | true | null |
10068
| null |
Default
| null | null |
null |
{
"abstract": " We consider the problem of adversarial (non-stochastic) online learning with\npartial information feedback, where at each round, a decision maker selects an\naction from a finite set of alternatives. We develop a black-box approach for\nsuch problems where the learner observes as feedback only losses of a subset of\nthe actions that includes the selected action. When losses of actions are\nnon-negative, under the graph-based feedback model introduced by Mannor and\nShamir, we offer algorithms that attain the so called \"small-loss\" $o(\\alpha\nL^{\\star})$ regret bounds with high probability, where $\\alpha$ is the\nindependence number of the graph, and $L^{\\star}$ is the loss of the best\naction. Prior to our work, there was no data-dependent guarantee for general\nfeedback graphs even for pseudo-regret (without dependence on the number of\nactions, i.e. utilizing the increased information feedback). Taking advantage\nof the black-box nature of our technique, we extend our results to many other\napplications such as semi-bandits (including routing in networks), contextual\nbandits (even with an infinite comparator class), as well as learning with\nslowly changing (shifting) comparators.\nIn the special case of classical bandit and semi-bandit problems, we provide\noptimal small-loss, high-probability guarantees of\n$\\tilde{O}(\\sqrt{dL^{\\star}})$ for actual regret, where $d$ is the number of\nactions, answering open questions of Neu. Previous bounds for bandits and\nsemi-bandits were known only for pseudo-regret and only in expectation. We also\noffer an optimal $\\tilde{O}(\\sqrt{\\kappa L^{\\star}})$ regret guarantee for\nfixed feedback graphs with clique-partition number at most $\\kappa$.\n",
"title": "Small-loss bounds for online learning with partial information"
}
| null | null | null | null | true | null |
10069
| null |
Default
| null | null |
null |
{
"abstract": " The $q$-Coloring problem asks whether the vertices of a graph can be properly\ncolored with $q$ colors. Lokshtanov et al. [SODA 2011] showed that $q$-Coloring\non graphs with a feedback vertex set of size $k$ cannot be solved in time\n$\\mathcal{O}^*((q-\\varepsilon)^k)$, for any $\\varepsilon > 0$, unless the\nStrong Exponential-Time Hypothesis (SETH) fails. In this paper we perform a\nfine-grained analysis of the complexity of $q$-Coloring with respect to a\nhierarchy of parameters. We show that even when parameterized by the vertex\ncover number, $q$ must appear in the base of the exponent: Unless ETH fails,\nthere is no universal constant $\\theta$ such that $q$-Coloring parameterized by\nvertex cover can be solved in time $\\mathcal{O}^*(\\theta^k)$ for all fixed $q$.\nWe apply a method due to Jansen and Kratsch [Inform. & Comput. 2013] to prove\nthat there are $\\mathcal{O}^*((q - \\varepsilon)^k)$ time algorithms where $k$\nis the vertex deletion distance to several graph classes $\\mathcal{F}$ for\nwhich $q$-Coloring is known to be solvable in polynomial time. We generalize\nearlier ad-hoc results by showing that if $\\mathcal{F}$ is a class of graphs\nwhose $(q+1)$-colorable members have bounded treedepth, then there exists some\n$\\varepsilon > 0$ such that $q$-Coloring can be solved in time\n$\\mathcal{O}^*((q-\\varepsilon)^k)$ when parameterized by the size of a given\nmodulator to $\\mathcal{F}$. In contrast, we prove that if $\\mathcal{F}$ is the\nclass of paths - some of the simplest graphs of unbounded treedepth - then no\nsuch algorithm can exist unless SETH fails.\n",
"title": "Fine-Grained Parameterized Complexity Analysis of Graph Coloring Problems"
}
| null | null | null | null | true | null |
10070
| null |
Default
| null | null |
null |
{
"abstract": " Planar object tracking is an actively studied problem in vision-based robotic\napplications. While several benchmarks have been constructed for evaluating\nstate-of-the-art algorithms, there is a lack of video sequences captured in the\nwild rather than in constrained laboratory environment. In this paper, we\npresent a carefully designed planar object tracking benchmark containing 210\nvideos of 30 planar objects sampled in the natural environment. In particular,\nfor each object, we shoot seven videos involving various challenging factors,\nnamely scale change, rotation, perspective distortion, motion blur, occlusion,\nout-of-view, and unconstrained. The ground truth is carefully annotated\nsemi-manually to ensure the quality. Moreover, eleven state-of-the-art\nalgorithms are evaluated on the benchmark using two evaluation metrics, with\ndetailed analysis provided for the evaluation results. We expect the proposed\nbenchmark to benefit future studies on planar object tracking.\n",
"title": "Planar Object Tracking in the Wild: A Benchmark"
}
| null | null | null | null | true | null |
10071
| null |
Default
| null | null |
null |
{
"abstract": " Operation of an atomtronic battery is demonstrated where a finite-temperature\nBose-Einstein condensate stored in one half of a double-well potential is\ncoupled to an initially empty load well that is impedance matched by a resonant\nterminator beam. The atom number and temperature of the condensate are\nmonitored during the discharge cycle, and are used to calculate fundamental\nproperties of the battery. The discharge behavior is analyzed according to a\nThévenin equivalent circuit that contains a finite internal resistance to\naccount for dissipation in the battery. Battery performance at multiple\ndischarge rates is characterized by the peak power output, and the current and\nenergy capacities of the system.\n",
"title": "Experimental demonstration of an atomtronic battery"
}
| null | null | null | null | true | null |
10072
| null |
Default
| null | null |
null |
{
"abstract": " We address the two fundamental problems of spatial field reconstruction and\nsensor selection in heterogeneous sensor networks: (i) how to efficiently\nperform spatial field reconstruction based on measurements obtained\nsimultaneously from networks with both high and low quality sensors; and (ii)\nhow to perform query based sensor set selection with predictive MSE performance\nguarantee. For the first problem, we developed a low complexity algorithm based\non the spatial best linear unbiased estimator (S-BLUE). Next, building on the\nS-BLUE, we address the second problem, and develop an efficient algorithm for\nquery based sensor set selection with performance guarantee. Our algorithm is\nbased on the Cross Entropy method which solves the combinatorial optimization\nproblem in an efficient manner.\n",
"title": "Sensor Selection and Random Field Reconstruction for Robust and Cost-effective Heterogeneous Weather Sensor Networks for the Developing World"
}
| null | null | null | null | true | null |
10073
| null |
Default
| null | null |
null |
{
"abstract": " In this paper, we prove that a smooth projective variety $X$ of\ncharacteristic $p>0$ is an ordinary abelian variety if and only if $K_X$ is\npseudo-effective and $F^e_*\\mathcal O_X$ splits into a direct sum of line\nbundles for an integer $e$ with $p^e>2$.\n",
"title": "A characterization of ordinary abelian varieties by the Frobenius push-forward of the structure sheaf II"
}
| null | null | null | null | true | null |
10074
| null |
Default
| null | null |
null |
{
"abstract": " We study predictive density estimation under Kullback-Leibler loss in\n$\\ell_0$-sparse Gaussian sequence models. We propose proper Bayes predictive\ndensity estimates and establish asymptotic minimaxity in sparse models. A\nsurprise is the existence of a phase transition in the future-to-past variance\nratio $r$. For $r < r_0 = (\\surd 5 - 1)/4$, the natural discrete prior ceases\nto be asymptotically optimal. Instead, for subcritical $r$, a `bi-grid' prior\nwith a central region of reduced grid spacing recovers asymptotic minimaxity.\nThis phenomenon seems to have no analog in the otherwise parallel theory of\npoint estimation of a multivariate normal mean under quadratic loss. For\nspike-and-slab priors to have any prospect of minimaxity, we show that the\nsparse parameter space needs also to be magnitude constrained. Within a\nsubstantial range of magnitudes, spike-and-slab priors can attain asymptotic\nminimaxity.\n",
"title": "On Minimax Optimality of Sparse Bayes Predictive Density Estimates"
}
| null | null |
[
"Mathematics",
"Statistics"
] | null | true | null |
10075
| null |
Validated
| null | null |
null |
{
"abstract": " Many systems of structured argumentation explicitly require that the facts\nand rules that make up the argument for a conclusion be the minimal set\nrequired to derive the conclusion. ASPIC+ does not place such a requirement on\narguments, instead requiring that every rule and fact that are part of an\nargument be used in its construction. Thus ASPIC+ arguments are minimal in the\nsense that removing any element of the argument would lead to a structure that\nis not an argument. In this brief note we discuss these two types of minimality\nand show how the first kind of minimality can, if desired, be recovered in\nASPIC+.\n",
"title": "Two forms of minimality in ASPIC+"
}
| null | null | null | null | true | null |
10076
| null |
Default
| null | null |
null |
{
"abstract": " Independent tests aiming to constrain the value of the cosmological constant\n$\\Lambda$ are usually difficult because of its extreme smallness $\\left(\\Lambda\n\\simeq 1\\times 10^{-52}~\\textrm{m}^{-2},~\\textrm{or}~2.89\\times\n10^{-122}~\\textrm{in Planck units}\\right)$. Bounds on it from Solar System\norbital motions determined with spacecraft tracking are currently at the\n$\\simeq 10^{-43}-10^{-44}~\\textrm{m}^{-2}~\\left(5-1\\times 10^{-113}~\\textrm{in\nPlanck units}\\right)$ level, but they may turn out to be somewhat optimistic\nsince $\\Lambda$ has not yet been explicitly modeled in the planetary data\nreductions. Accurate $\\left(\\sigma_{\\tau_\\textrm{p}}\\simeq\n1-10~\\mu\\textrm{s}\\right)$ timing of expected pulsars orbiting the Black Hole\nat the Galactic Center, preferably along highly eccentric and wide orbits,\nmight, at least in principle, improve the planetary constraints by several\norders of magnitude. By looking at the average time shift per orbit\n$\\overline{\\Delta\\delta\\tau}^\\Lambda_\\textrm{p}$, a S2-like orbital\nconfiguration with $e=0.8839,~P_\\textrm{b}=16~\\textrm{yr}$ would allow to\nobtain preliminarily an upper bound of the order of\n$\\left|\\Lambda\\right|\\lesssim 9\\times 10^{-47}~\\textrm{m}^{-2}~\\left(\\lesssim\n2\\times 10^{-116}~\\textrm{in Planck units}\\right)$ if only\n$\\sigma_{\\tau_\\textrm{p}}$ were to be considered. Our results can be easily\nextended to modified models of gravity using $\\Lambda-$type parameters.\n",
"title": "Perspectives on constraining a cosmological constant-type parameter with pulsar timing in the Galactic Center"
}
| null | null | null | null | true | null |
10077
| null |
Default
| null | null |
null |
{
"abstract": " We construct examples of flat fiber bundles over the Hopf surface such that\nthe total spaces have no pseudoconvex neighborhood basis, admit a complete\nKähler metric, or are hyperconvex but have no nonconstant holomorphic\nfunctions. For any compact Riemannian surface of positive genus, we construct a\nflat $\\mathbb P^1$ bundle over it and a Stein domain with real analytic bundary\nin it whose closure does not have pseudoconvex neighborhood basis. For a\ncompact complex manifold with positive first Betti number, we construct a flat\ndisc bundle over it such that the total space is hyperconvex but admits no\nnonconstant holomorphic functions.\n",
"title": "Flat bundles over some compact complex manifolds"
}
| null | null | null | null | true | null |
10078
| null |
Default
| null | null |
null |
{
"abstract": " The fields of astronomy and astrophysics are currently engaged in an\nunprecedented era of discovery as recent missions have revealed thousands of\nexoplanets orbiting other stars. While the Kepler Space Telescope mission has\nenabled most of these exoplanets to be detected by identifying transiting\nevents, exoplanets often exhibit additional photometric effects that can be\nused to improve the characterization of exoplanets. The EXONEST Exoplanetary\nExplorer is a Bayesian exoplanet inference engine based on nested sampling and\noriginally designed to analyze archived Kepler Space Telescope and CoRoT\n(Convection Rotation et Transits planétaires) exoplanet mission data. We\ndiscuss the EXONEST software package and describe how it accommodates\nplug-and-play models of exoplanet-associated photometric effects for the\npurpose of exoplanet detection, characterization and scientific hypothesis\ntesting. The current suite of models allows for both circular and eccentric\norbits in conjunction with photometric effects, such as the primary transit and\nsecondary eclipse, reflected light, thermal emissions, ellipsoidal variations,\nDoppler beaming and superrotation. We discuss our new efforts to expand the\ncapabilities of the software to include more subtle photometric effects\ninvolving reflected and refracted light. We discuss the EXONEST inference\nengine design and introduce our plans to port the current MATLAB-based EXONEST\nsoftware package over to the next generation Exoplanetary Explorer, which will\nbe a Python-based open source project with the capability to employ third-party\nplug-and-play models of exoplanet-related photometric effects.\n",
"title": "EXONEST: The Bayesian Exoplanetary Explorer"
}
| null | null | null | null | true | null |
10079
| null |
Default
| null | null |
null |
{
"abstract": " Living organisms process information to interact and adapt to their changing\nenvironment with the goal of finding food, mates or averting hazards. The\nstructure of their niche has profound repercussions by both selecting their\ninternal architecture and also inducing adaptive responses to environmental\ncues and stimuli. Adaptive, collective behaviour underpinned by specialized\noptimization strategies is ubiquitously found in the natural world. This\nexceptional success originates from the processes of fitness and selection.\nHere we prove that a universal physical mechanism of a nonequilibrium\ntransition underlies the collective organization of information-processing\norganisms. As cognitive agents build and update an internal, cognitive\nrepresentation of the causal structure of their environment, complex patterns\nemerge in the system, where the onset of pattern formation relates to the\nspatial overlap of cognitive maps. Studying the exchange of information among\nthe agents reveals a continuous, order-disorder transition. As a result of the\nspontaneous breaking of translational symmetry, a Goldstone mode emerges, which\npoints at a collective mechanism of information transfer among cognitive\norganisms. Taken together, the characteristics of this phase transition\nconsolidate different results in cognitive and biological sciences in a\nuniversal manner. These finding are generally applicable to the design of\nartificial intelligent swarm systems that do not rely on centralized control\nschemes.\n",
"title": "Intelligence of agents produces a structural phase transition in collective behaviour"
}
| null | null | null | null | true | null |
10080
| null |
Default
| null | null |
null |
{
"abstract": " This work analyses surprising elections, and attempts to quantify the notion\nof surprise in elections. A voter is surprised if their estimate of the winner\n(assumed to be based on a combination of the preferences of their social\nconnections and popular media predictions) is different from the true winner. A\nvoter's social connections are assumed to consist of contacts on social media\nand geographically proximate people. We propose a simple mathematical model for\ncombining the global information (traditional media) as well as the local\ninformation (local neighbourhood) of a voter in the case of a two-candidate\nelection. We show that an unbiased, influential media can nullify the effect of\nfilter bubbles and result in a less surprised populace. Surprisingly, an\ninfluential media source biased towards the winners of the election also\nresults in a less surprised populace. Our model shows that elections will be\nunsurprising for all of the voters with a high probability under certain\nassumptions on the social connection model in the presence of an influential,\nunbiased traditional media source. Our experiments with the UK-EU referendum\n(popularly known as Brexit) dataset support our theoretical predictions. Since\nsurprising elections can lead to significant economic movements, it is a\nworthwhile endeavour to figure out the causes of surprising elections.\n",
"title": "Quantifying Filter Bubbles: Analyzing Surprise in Elections"
}
| null | null | null | null | true | null |
10081
| null |
Default
| null | null |
null |
{
"abstract": " Kinetic plasma turbulence cascade spans multiple scales ranging from\nmacroscopic fluid flow to sub-electron scales. Mechanisms that dissipate large\nscale energy, terminate the inertial range cascade and convert kinetic energy\ninto heat are hotly debated. Here we revisit these puzzles using fully kinetic\nsimulation. By performing scale-dependent spatial filtering on the Vlasov\nequation, we extract information at prescribed scales and introduce several\nenergy transfer functions. This approach allows highly inhomogeneous energy\ncascade to be quantified as it proceeds down to kinetic scales. The pressure\nwork, $-\\left( \\boldsymbol{P} \\cdot \\nabla \\right) \\cdot \\boldsymbol{u}$, can\ntrigger a channel of the energy conversion between fluid flow and random\nmotions, which is a collision-free generalization of the viscous dissipation in\ncollisional fluid. Both the energy transfer and the pressure work are strongly\ncorrelated with velocity gradients.\n",
"title": "Energy transfer, pressure tensor and heating of kinetic plasma"
}
| null | null | null | null | true | null |
10082
| null |
Default
| null | null |
null |
{
"abstract": " We explore the relationship between human migration and OECD's foreign direct\ninvestment (FDI) using a gravity equation enriched with variables that account\nfor complex-network effects. Based on a panel data analysis, we find a strong\npositive correlation between the migration network and the FDI network, which\ncan be mostly explained by countries' economic/demographic sizes and\ngeographical distance. We highlight the existence of a stronger positive FDI\nrelationship in pairs of countries that are more central in the migration\nnetwork. Both intensive and extensive forms of centrality are FDI enhancing.\nIlluminating this result, we show that bilateral FDI between any two countries\nis further affected positively by the complex web of \"third party\"\ncorridors/migration stocks of the international migration network (IMN). Our\nfindings are consistent whether we consider bilateral FDI and bilateral\nmigration figures, or we focus on the outward FDI and the respective inward\nmigration of the OECD countries.\n",
"title": "The relation between migration and FDI in the OECD from a complex network perspective"
}
| null | null | null | null | true | null |
10083
| null |
Default
| null | null |
null |
{
"abstract": " The Weyl semimetal NbP exhibits an extremely large magnetoresistance (MR) and\nan ultra-high mobility. The large MR originates from a combination of the\nnearly perfect compensation between electron- and hole-type charge carriers and\nthe high mobility, which is relevant to the topological band structure. In this\nwork we report on temperature- and field-dependent thermopower and thermal\nconductivity experiments on NbP. Additionally, we carried out complementary\nheat capacity, magnetization, and electrical resistivity measurements. We found\na giant adiabatic magnetothermopower with a maximum of 800 $\\mu$V/K at 50 K in\na field of 9 T. Such large effects have been observed rarely in bulk materials.\nWe suggest that the origin of this effect might be related to the high\ncharge-carrier mobility. We further observe pronounced quantum oscillations in\nboth thermal conductivity and thermopower. The obtained frequencies compare\nwell with our heat capacity and magnetization data.\n",
"title": "Thermopower and thermal conductivity in the Weyl semimetal NbP"
}
| null | null | null | null | true | null |
10084
| null |
Default
| null | null |
null |
{
"abstract": " Continuous cultures of mammalian cells are complex systems displaying\nhallmark phenomena of nonlinear dynamics, such as multi-stability, hysteresis,\nas well as sharp transitions between different metabolic states. In this\ncontext mathematical models may suggest control strategies to steer the system\ntowards desired states. Although even clonal populations are known to exhibit\ncell-to-cell variability, most of the currently studied models assume that the\npopulation is homogeneous. To overcome this limitation, we use the maximum\nentropy principle to model the phenotypic distribution of cells in a chemostat\nas a function of the dilution rate. We consider the coupling between cell\nmetabolism and extracellular variables describing the state of the bioreactor\nand take into account the impact of toxic byproduct accumulation on cell\nviability. We present a formal solution for the stationary state of the\nchemostat and show how to apply it in two examples. First, a simplified model\nof cell metabolism where the exact solution is tractable, and then a\ngenome-scale metabolic network of the Chinese hamster ovary (CHO) cell line.\nAlong the way we discuss several consequences of heterogeneity, such as:\nqualitative changes in the dynamical landscape of the system, increasing\nconcentrations of byproducts that vanish in the homogeneous case, and larger\npopulation sizes.\n",
"title": "Maximum entropy and population heterogeneity in continuous cell cultures"
}
| null | null | null | null | true | null |
10085
| null |
Default
| null | null |
null |
{
"abstract": " The technique of propagating spin wave spectroscopy is applied to a 20 nm\nthick Fe/MgO (001) film. The magnetic parameters extracted from the position of\nthe resonance peaks are very close to those tabulated for bulk iron. From the\npropagating waveforms, a group velocity of 4 km/s and an attenuation length of\nabout 6 micrometers are extracted for 1.6 micrometers-wavelength spin-wave at\n18 GHz. From the measured current-induced spin-wave Doppler shift, we also\nextract a surprisingly high degree of spin-polarization of the current of 83%.\nThis set of results makes single-crystalline iron a promising candidate for\nbuilding devices utilizing high frequency spin-waves and spin-polarized\ncurrents.\n",
"title": "Spin wave propagation and spin polarized electron transport in single crystal iron films"
}
| null | null | null | null | true | null |
10086
| null |
Default
| null | null |
null |
{
"abstract": " In this paper we demonstrate how genetic algorithms can be used to reverse\nengineer an evaluation function's parameters for computer chess. Our results\nshow that using an appropriate expert (or mentor), we can evolve a program that\nis on par with top tournament-playing chess programs, outperforming a two-time\nWorld Computer Chess Champion. This performance gain is achieved by evolving a\nprogram that mimics the behavior of a superior expert. The resulting evaluation\nfunction of the evolved program consists of a much smaller number of parameters\nthan the expert's. The extended experimental results provided in this paper\ninclude a report of our successful participation in the 2008 World Computer\nChess Championship. In principle, our expert-driven approach could be used in a\nwide range of problems for which appropriate experts are available.\n",
"title": "Expert-Driven Genetic Algorithms for Simulating Evaluation Functions"
}
| null | null |
[
"Computer Science",
"Statistics"
] | null | true | null |
10087
| null |
Validated
| null | null |
null |
{
"abstract": " Social conventions govern countless behaviors all of us engage in every day,\nfrom how we greet each other to the languages we speak. But how can shared\nconventions emerge spontaneously in the absence of a central coordinating\nauthority? The Naming Game model shows that networks of locally interacting\nindividuals can spontaneously self-organize to produce global coordination.\nHere, we provide a gentle introduction to the main features of the model, from\nthe dynamics observed in homogeneously mixing populations to the role played by\nmore complex social networks, and to how slight modifications of the basic\ninteraction rules give origin to a richer phenomenology in which more\nconventions can co-exist indefinitely.\n",
"title": "A gentle introduction to the minimal Naming Game"
}
| null | null | null | null | true | null |
10088
| null |
Default
| null | null |
null |
{
"abstract": " This work is devoted to elaboration on the idea to use block term\ndecomposition for group data analysis and to raise the possibility of modelling\ngroup activity with (Lr, 1) and Tucker blocks. A new generalization of block\ntensor decomposition was considered in application to group data analysis.\nSuggested approach was evaluated on multilabel classification task for a set of\nimages. This contribution also reports results of investigation on clustering\nwith proposed tensor models in comparison with known matrix models, namely\ncommon orthogonal basis extraction and group independent component analysis.\n",
"title": "Modelling hidden structure of signals in group data analysis with modified (Lr, 1) and block-term decompositions"
}
| null | null | null | null | true | null |
10089
| null |
Default
| null | null |
null |
{
"abstract": " This paper reviews the historic of ChaLearn Looking at People (LAP) events.\nWe started in 2011 (with the release of the first Kinect device) to run\nchallenges related to human action/activity and gesture recognition. Since then\nwe have regularly organized events in a series of competitions covering all\naspects of visual analysis of humans. So far we have organized more than 10\ninternational challenges and events in this field. This paper reviews\nassociated events, and introduces the ChaLearn LAP platform where public\nresources (including code, data and preprints of papers) related to the\norganized events are available. We also provide a discussion on perspectives of\nChaLearn LAP activities.\n",
"title": "ChaLearn Looking at People: A Review of Events and Resources"
}
| null | null | null | null | true | null |
10090
| null |
Default
| null | null |
null |
{
"abstract": " Chaos associated with bifurcation makes a new science, but the origin and\nessence of chaos are not yet clear. Based on the well-known logistic map, chaos\nused to be regarded as intrinsic randomicity of determinate dynamics systems.\nHowever, urbanization dynamics indicates new explanation about it. Using\nmathematical derivation, numerical computation, and empirical analysis, we can\nexplore chaotic dynamics of urbanization. The key is the formula of\nurbanization level. The urbanization curve can be described with the logistic\nfunction, which can be transformed into 1-dimensional map and thus produce\nbifurcation and chaos. On the other hand, the logistic model of urbanization\ncurve can be derived from the rural-urban population interaction model, and the\nrural-urban interaction model can be discretized to a 2-dimensional map. An\ninteresting finding is that the 2-dimensional rural-urban coupling map can\ncreate the same bifurcation and chaos patterns as those from the 1-dimensional\nlogistic map. This suggests that the urban bifurcation and chaos come from\nspatial interaction between rural and urban population rather than pure\nintrinsic randomicity of determinate models. This discovery provides a new way\nof looking at origin and essence of bifurcation and chaos. By analogy with\nurbanization models, the classical predator-prey interaction model can be\ndeveloped to interpret the complex dynamics of the logistic map in physical and\nsocial sciences.\n",
"title": "Reinterpreting the Origin of Bifurcation and Chaos by Urbanization Dynamics"
}
| null | null | null | null | true | null |
10091
| null |
Default
| null | null |
null |
{
"abstract": " Bazhin has analyzed ATP coupling in terms of quasiequilibrium states where\nfast reactions have reached an approximate steady state while slow reactions\nhave not yet reached equilibrium. After an expository introduction to the\nrelevant aspects of reaction network theory, we review his work and explain the\nrole of emergent conserved quantities in coupling. These are quantities, left\nunchanged by fast reactions, whose conservation forces exergonic processes such\nas ATP hydrolysis to drive desired endergonic processes.\n",
"title": "Biochemical Coupling Through Emergent Conservation Laws"
}
| null | null |
[
"Quantitative Biology"
] | null | true | null |
10092
| null |
Validated
| null | null |
null |
{
"abstract": " The explosive increase in number of smart devices hosting sophisticated\napplications is rapidly affecting the landscape of information communication\ntechnology industry. Mobile subscriptions, expected to reach 8.9 billion by\n2022, would drastically increase the demand of extra capacity with aggregate\nthroughput anticipated to be enhanced by a factor of 1000. In an already\ncrowded radio spectrum, it becomes increasingly difficult to meet ever growing\napplication demands of wireless bandwidth. It has been shown that the allocated\nspectrum is seldom utilized by the primary users and hence contains spectrum\nholes that may be exploited by the unlicensed users for their communication. As\nwe enter the Internet Of Things (IoT) era in which appliances of common use\nwill become smart digital devices with rigid performance requirements (such as\nlow latency, energy efficiency, etc.), current networks face the vexing problem\nof how to create sufficient capacity for such applications. The fifth\ngeneration of cellular networks (5G) envisioned to address these challenges are\nthus required to incorporate cognition and intelligence to resolve the\naforementioned issues.\n",
"title": "Artificial Intelligence as an Enabler for Cognitive Self-Organizing Future Networks"
}
| null | null | null | null | true | null |
10093
| null |
Default
| null | null |
null |
{
"abstract": " It is believed that thermalization in closed systems of interacting particles\ncan occur only when the eigenstates are fully delocalized and chaotic in the\npreferential (unperturbed) basis of the total Hamiltonian. Here we demonstrate\nthat at variance with this common belief the typical situation in the systems\nwith two-body inter-particle interaction is much more complicated and allows to\ntreat as thermal even eigenstates that are not fully delocalized. Using a\nsemi-analytical approach we establish the conditions for the emergence of such\nthermal states in a model of randomly interacting bosons. Our numerical data\nshow an excellent correspondence with the predicted properties of {\\it\nlocalized thermal eigenstates}.\n",
"title": "Localized Thermal States"
}
| null | null | null | null | true | null |
10094
| null |
Default
| null | null |
null |
{
"abstract": " Interface phonon (IF) modes of c-plane oriented [AlN/GaN]20 and\nAl0.35Ga0.65N/Al0.55Ga0.45N]20 multi quantum well (MQW) structures grown via\nplasma assisted molecular beam epitaxy are reported. The effect of variation in\ndielectric constant of barrier layers to the IF optical phonon modes of well\nlayers periodically arranged in the MQWs investigated.\n",
"title": "Interface Phonon Modes in the [AlN/GaN]20 and [Al0.35Ga0.65N/Al0.55Ga0.45N]20 2D Multi Quantum Well Structures"
}
| null | null | null | null | true | null |
10095
| null |
Default
| null | null |
null |
{
"abstract": " Transitions between multiple stable states of nonlinear systems are\nubiquitous in physics, chemistry, and beyond. Two types of behaviors are\nusually seen as mutually exclusive: unpredictable noise-induced transitions and\npredictable bifurcations of the underlying vector field. Here, we report a new\nsituation, corresponding to a fluctuating system approaching a bifurcation,\nwhere both effects collaborate. We show that the problem can be reduced to a\nsingle control parameter governing the competition between deterministic and\nstochastic effects. Two asymptotic regimes are identified: when the control\nparameter is small (e.g. small noise), deviations from the deterministic case\nare well described by the Freidlin-Wentzell theory. In particular, escapes over\nthe potential barrier are very rare events. When the parameter is large (e.g.\nlarge noise), such events become typical. Unlike pure noise-induced\ntransitions, the distribution of the escape time is peaked around a value which\nis asymptotically predicted by an adiabatic approximation. We show that the two\nregimes are characterized by qualitatively different reacting trajectories,\nwith algebraic and exponential divergence, respectively.\n",
"title": "Predictability of escape for a stochastic saddle-node bifurcation: when rare events are typical"
}
| null | null | null | null | true | null |
10096
| null |
Default
| null | null |
null |
{
"abstract": " A sieve for rational points on suitable varieties is developed, together with\napplications to counting rational points in thin sets, the number of varieties\nin a family which are everywhere locally soluble, and to the notion of friable\nrational points with respect to divisors. In the special case of quadrics,\nsharper estimates are obtained by developing a version of the Selberg sieve for\nrational points.\n",
"title": "Sieving rational points on varieties"
}
| null | null | null | null | true | null |
10097
| null |
Default
| null | null |
null |
{
"abstract": " Neural responses in the cortex change over time both systematically, due to\nongoing plasticity and learning, and seemingly randomly, due to various sources\nof noise and variability. Most previous work considered each of these\nprocesses, learning and variability, in isolation -- here we study neural\nnetworks exhibiting both and show that their interaction leads to the emergence\nof powerful computational properties. We trained neural networks on classical\nunsupervised learning tasks, in which the objective was to represent their\ninputs in an efficient, easily decodable form, with an additional cost for\nneural reliability which we derived from basic biophysical considerations. This\ncost on reliability introduced a tradeoff between energetically cheap but\ninaccurate representations and energetically costly but accurate ones. Despite\nthe learning tasks being non-probabilistic, the networks solved this tradeoff\nby developing a probabilistic representation: neural variability represented\nsamples from statistically appropriate posterior distributions that would\nresult from performing probabilistic inference over their inputs. We provide an\nanalytical understanding of this result by revealing a connection between the\ncost of reliability, and the objective for a state-of-the-art Bayesian\ninference strategy: variational autoencoders. We show that the same cost leads\nto the emergence of increasingly accurate probabilistic representations as\nnetworks become more complex, from single-layer feed-forward, through\nmulti-layer feed-forward, to recurrent architectures. Our results provide\ninsights into why neural responses in sensory areas show signatures of\nsampling-based probabilistic representations, and may inform future deep\nlearning algorithms and their implementation in stochastic low-precision\ncomputing systems.\n",
"title": "Sampling-based probabilistic inference emerges from learning in neural circuits with a cost on reliability"
}
| null | null | null | null | true | null |
10098
| null |
Default
| null | null |
null |
{
"abstract": " We present a general formalism of multipole descriptions under the space-time\ninversion group. We elucidate that two types of atomic toroidal multipoles,\ni.e., electric and magnetic, are fundamental pieces to express electronic order\nparameters in addition to ordinary electric and magnetic multipoles. By\nderiving quantum-mechanical operators for both toroidal multipoles, we show\nthat electric (magnetic) toroidal multipole higher than dipole (monopole) can\nbecome a primary order parameter in a hybridized-orbital system. We also\ndemonstrate emergent cross-correlated couplings between electric, magnetic, and\nelastic degrees of freedom, such as magneto-electric and\nmagneto(electro)-elastic couplings, under toroidal multipole orders.\n",
"title": "Microscopic Description of Electric and Magnetic Toroidal Multipoles in Hybrid Orbitals"
}
| null | null | null | null | true | null |
10099
| null |
Default
| null | null |
null |
{
"abstract": " Column-sparse packing problems arise in several contexts in both\ndeterministic and stochastic discrete optimization. We present two unifying\nideas, (non-uniform) attenuation and multiple-chance algorithms, to obtain\nimproved approximation algorithms for some well-known families of such\nproblems. As three main examples, we attain the integrality gap, up to\nlower-order terms, for known LP relaxations for k-column sparse packing integer\nprograms (Bansal et al., Theory of Computing, 2012) and stochastic k-set\npacking (Bansal et al., Algorithmica, 2012), and go \"half the remaining\ndistance\" to optimal for a major integrality-gap conjecture of Furedi, Kahn and\nSeymour on hypergraph matching (Combinatorica, 1993).\n",
"title": "Algorithms to Approximate Column-Sparse Packing Problems"
}
| null | null | null | null | true | null |
10100
| null |
Default
| null | null |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.