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": " Two meromorphic functions $f(z)$ and $g(z)$ sharing a small function\n$\\alpha(z)$ usually is defined in terms of vanishing of the functions\n$f-\\alpha$ and $g-\\alpha$. We argue that it would be better to modify this\ndefinition at the points where $\\alpha$ has poles. Related to this issue we\nalso point out some possible gaps in proofs in the published literature.\n",
"title": "What is the definition of two meromorphic functions sharing a small function?"
}
| null | null |
[
"Mathematics"
] | null | true | null |
15301
| null |
Validated
| null | null |
null |
{
"abstract": " During Rutherford cable production the wires are plastically deformed and\ntheir initially round shape is distorted. Using X-ray absorption tomography we\nhave determined the 3D shape of an unreacted Nb3Sn 11 T dipole Rutherford\ncable, and of a reacted and impregnated Nb3Sn cable double stack.\nState-of-the-art image processing was applied to correct for tomographic\nartefacts caused by the large cable aspect ratio, for the segmentation of the\nindividual wires and subelement bundles inside the wires, and for the\ncalculation of the wire cross sectional area and shape variations. The 11 T\ndipole cable cross section oscillates by 2% with a frequency of 1.24 mm (1/80\nof the transposition pitch length of the 40 wire cable). A comparatively\nstronger cross sectional area variation is observed in the individual wires at\nthe thin edge of the keystoned cable where the wire aspect ratio is largest.\n",
"title": "Nb3Sn wire shape and cross sectional area inhomogeneity in Rutherford cables"
}
| null | null | null | null | true | null |
15302
| null |
Default
| null | null |
null |
{
"abstract": " Interpreting the small-scale clustering of galaxies with halo models can\nelucidate the connection between galaxies and dark matter halos. Unfortunately,\nthe modelling is typically not sufficiently accurate for ruling out models\nstatistically. It is thus difficult to use the information encoded in small\nscales to test cosmological models or probe subtle features of the galaxy-halo\nconnection. In this paper, we attempt to push halo modelling into the\n\"accurate\" regime with a fully numerical mock-based methodology and careful\ntreatment of statistical and systematic errors. With our forward-modelling\napproach, we can incorporate clustering statistics beyond the traditional\ntwo-point statistics. We use this modelling methodology to test the standard\n$\\Lambda\\mathrm{CDM}$ + halo model against the clustering of SDSS DR7 galaxies.\nSpecifically, we use the projected correlation function, group multiplicity\nfunction and galaxy number density as constraints. We find that while the model\nfits each statistic separately, it struggles to fit them simultaneously. Adding\ngroup statistics leads to a more stringent test of the model and significantly\ntighter constraints on model parameters. We explore the impact of varying the\nadopted halo definition and cosmological model and find that changing the\ncosmology makes a significant difference. The most successful model we tried\n(Planck cosmology with Mvir halos) matches the clustering of low luminosity\ngalaxies, but exhibits a 2.3$\\sigma$ tension with the clustering of luminous\ngalaxies, thus providing evidence that the \"standard\" halo model needs to be\nextended. This work opens the door to adding interesting freedom to the halo\nmodel and including additional clustering statistics as constraints.\n",
"title": "Towards Accurate Modelling of Galaxy Clustering on Small Scales: Testing the Standard $Λ\\mathrm{CDM}$ + Halo Model"
}
| null | null | null | null | true | null |
15303
| null |
Default
| null | null |
null |
{
"abstract": " The synthesis, physical, photocatalytic, and antibacterial properties of MgO\nand graphene nanoplatelets (GNPs) nanocomposites are reported. The\ncrystallinity, phase, morphology, chemical bonding, and vibrational modes of\nprepared nanomaterials are studied. The conductive nature of GNPs is tailored\nvia photocatalysis and enhanced antibacterial activity. It is interestingly\nobserved that the MgO/GNPs nanocomposite with optimized GNPs content show a\nsignificant photocatalytic activity (97.23% degradation) as compared to bare\nMgO (43%) which makes it the potential photocatalyst for purification of\nindustrial waste water. In addition, the effect of increased amount of GNPs on\nantibacterial performance of nanocomposites against pathogenic micro-organisms\nis researched, suggesting them toxic. MgO/GNPs 25% nanocomposite may have\npotential applications in waste water treatment and nanomedicine due its\nmultifunctionality.\n",
"title": "Graphene nanoplatelets induced tailoring in photocatalytic activity and antibacterial characteristics of MgO/graphene nanoplatelets nanocomposites"
}
| null | null | null | null | true | null |
15304
| null |
Default
| null | null |
null |
{
"abstract": " Suppose we are sending out $k$ robots from $0$ to search the real line at\nconstant speed (with turns) to find a target at an unknown location; $f$ of the\nrobots are faulty, meaning that they fail to report the target although\nvisiting its location (called crash type). The goal is to find the target in\ntime at most $\\lambda |d|$, if the target is located at $d$, $|d| \\ge 1$, for\n$\\lambda$ as small as possible. We show that this cannot be achieved for\n$$\\lambda < 2\\frac{\\rho^\\rho}{(\\rho-1)^{\\rho-1}}+1,~~ \\rho :=\n\\frac{2(f+1)}{k}~, $$ which is tight due to earlier work (see J. Czyzowitz, E.\nKranakis, D. Krizanc, L. Narayanan, J. Opatrny, PODC'16, where this problem was\nintroduced). This also gives some better than previously known lower bounds for\nso-called Byzantine-type faulty robots that may actually wrongly report a\ntarget.\nIn the second part of the paper, we deal with the $m$-rays generalization of\nthe problem, where the hidden target is to be detected on $m$ rays all\nemanating at the same point. Using a generalization of our methods, along with\na useful relaxation of the original problem, we establish a tight lower for\nthis setting as well (as above, with $\\rho := m(f+1)/k$). When specialized to\nthe case $f=0$, this resolves the question on parallel search on $m$ rays,\nposed by three groups of scientists some 15 to 30 years ago: by Baeza-Yates,\nCulberson, and Rawlins; by Kao, Ma, Sipser, and Yin; and by Bernstein,\nFinkelstein, and Zilberstein. The $m$-rays generalization is known to have\nconnections to other, seemingly unrelated, problems, including hybrid\nalgorithms for on-line problems, and so-called contract algorithms.\n",
"title": "Lower Bounds for Searching Robots, some Faulty"
}
| null | null | null | null | true | null |
15305
| null |
Default
| null | null |
null |
{
"abstract": " We present an implementation of the relativistic quantum-chemical density\nmatrix renormalization group (DMRG) approach based on a matrix-product\nformalism. Our approach allows us to optimize matrix product state (MPS) wave\nfunctions including a variational description of scalar-relativistic effects\nand spin-orbit coupling from which we can calculate, for example, first-order\nelectric and magnetic properties in a relativistic framework. While\ncomplementing our pilot implementation (S. Knecht et al., J. Chem. Phys., 140,\n041101 (2014)) this work exploits all features provided by its underlying\nnon-relativistic DMRG implementation based on an matrix product state and\noperator formalism. We illustrate the capabilities of our relativistic DMRG\napproach by studying the ground-state magnetization as well as current density\nof a paramagnetic $f^9$ dysprosium complex as a function of the active orbital\nspace employed in the MPS wave function optimization.\n",
"title": "An efficient relativistic density-matrix renormalization group implementation in a matrix-product formulation"
}
| null | null |
[
"Physics"
] | null | true | null |
15306
| null |
Validated
| null | null |
null |
{
"abstract": " The problem of efficiently characterizing degree sequences of simple\nhypergraphs is a fundamental long-standing open problem in Graph Theory.\nSeveral results are known for restricted versions of this problem. This paper\nadds to the list of sufficient conditions for a degree sequence to be {\\em\nhypergraphic}. This paper proves a combinatorial lemma about cyclically\npermuting the columns of a binary table with length $n$ binary sequences as\nrows. We prove that for any set of cyclic permutations acting on its columns,\nthe resulting table has all of its $2^n$ rows distinct. Using this property, we\nfirst define a subset {\\em cyclic hyper degrees} of hypergraphic sequences and\nshow that they admit a polynomial time recognition algorithm. Next, we prove\nthat there are at least $2^{\\frac{(n-1)(n-2)}{2}}$ {\\em cyclic hyper degrees},\nwhich also serves as a lower bound on the number of {\\em hypergraphic}\nsequences. The {\\em cyclic hyper degrees} also enjoy a structural\ncharacterization, they are the integral points contained in the union of some\n$n$-dimensional rectangles.\n",
"title": "Cyclic Hypergraph Degree Sequences"
}
| null | null | null | null | true | null |
15307
| null |
Default
| null | null |
null |
{
"abstract": " Convolutional sparse representations are a form of sparse representation with\na structured, translation invariant dictionary. Most convolutional dictionary\nlearning algorithms to date operate in batch mode, requiring simultaneous\naccess to all training images during the learning process, which results in\nvery high memory usage and severely limits the training data that can be used.\nVery recently, however, a number of authors have considered the design of\nonline convolutional dictionary learning algorithms that offer far better\nscaling of memory and computational cost with training set size than batch\nmethods. This paper extends our prior work, improving a number of aspects of\nour previous algorithm; proposing an entirely new one, with better performance,\nand that supports the inclusion of a spatial mask for learning from incomplete\ndata; and providing a rigorous theoretical analysis of these methods.\n",
"title": "First and Second Order Methods for Online Convolutional Dictionary Learning"
}
| null | null | null | null | true | null |
15308
| null |
Default
| null | null |
null |
{
"abstract": " Principal component analysis (PCA) has well-documented merits for data\nextraction and dimensionality reduction. PCA deals with a single dataset at a\ntime, and it is challenged when it comes to analyzing multiple datasets. Yet in\ncertain setups, one wishes to extract the most significant information of one\ndataset relative to other datasets. Specifically, the interest may be on\nidentifying, namely extracting features that are specific to a single target\ndataset but not the others. This paper develops a novel approach for such\nso-termed discriminative data analysis, and establishes its optimality in the\nleast-squares (LS) sense under suitable data modeling assumptions. The\ncriterion reveals linear combinations of variables by maximizing the ratio of\nthe variance of the target data to that of the remainders. The novel approach\nsolves a generalized eigenvalue problem by performing SVD just once. Numerical\ntests using synthetic and real datasets showcase the merits of the proposed\napproach relative to its competing alternatives.\n",
"title": "DPCA: Dimensionality Reduction for Discriminative Analytics of Multiple Large-Scale Datasets"
}
| null | null | null | null | true | null |
15309
| null |
Default
| null | null |
null |
{
"abstract": " Single molecule magnets (SMMs) with single-ion anisotropies $\\mathbf d$,\ncomparable to exchange interactions J, between spins have recently been\nsynthesized. In this paper, we provide theoretical insights into the magnetism\nof such systems. We study spin chains with site spins, s=1, 3/2 and 2 and\non-site anisotropy $\\mathbf d$ comparable to the exchange constants between the\nspins. We find that large $\\mathbf d$ leads to crossing of the states with\ndifferent $M_S$ values in the same spin manifold of the $\\mathbf d = 0$ limit.\nFor very large $\\mathbf d$'s we also find that the $M_S$ states of the higher\nenergy spin states descend below the $M_S$ states of the ground state spin\nmanifold. Total spin in this limit is no longer conserved and describing the\nmolecular anisotropy by the constants $D_M$ and $E_M$ is not possible. However,\nthe total spin of the low-lying large $M_S$ states is very nearly an integer\nand using this spin value it is possible to construct an effective spin\nHamiltonian and compute the molecular magnetic anisotropy constants $D_M$ and\n$E_M$. We report effect of finite sizes, rotations of site anisotropies and\nchain dimerization on the effective anisotropy of the spin chains.\n",
"title": "Modeling Magnetic Anisotropy of Single Chain Magnets in $|d/J| \\geq 1$ Regime"
}
| null | null | null | null | true | null |
15310
| null |
Default
| null | null |
null |
{
"abstract": " Compressive sensing (CS) combines data acquisition with compression coding to\nreduce the number of measurements required to reconstruct a sparse signal. In\noptics, this usually takes the form of projecting the field onto sequences of\nrandom spatial patterns that are selected from an appropriate random ensemble.\nWe show here that CS can be exploited in `native' optics hardware without\nintroducing added components. Specifically, we show that random sub-Nyquist\nsampling of an interferogram helps reconstruct the field modal structure. The\ndistribution of reduced sensing matrices corresponding to random measurements\nis provably incoherent and isotropic, which helps us carry out CS successfully.\n",
"title": "Compressive optical interferometry"
}
| null | null | null | null | true | null |
15311
| null |
Default
| null | null |
null |
{
"abstract": " We explore solutions for automated labeling of content in bug trackers and\ncustomer support systems. In order to do that, we classify content in terms of\nseveral criteria, such as priority or product area. In the first part of the\npaper, we provide an overview of existing methods used for text classification.\nThese methods fall into two categories - the ones that rely on neural networks\nand the ones that don't. We evaluate results of several solutions of both\nkinds. In the second part of the paper we present our own recurrent neural\nnetwork solution based on hierarchical attention paradigm. It consists of\nseveral Hierarchical Attention network blocks with varying Gated Recurrent Unit\ncell sizes and a complementary shallow network that goes alongside. Lastly, we\nevaluate above-mentioned methods when predicting fields from two datasets -\nArch Linux bug tracker and Chromium bug tracker. Our contributions include a\ncomprehensive benchmark between a variety of methods on relevant datasets; a\nnovel solution that outperforms previous generation methods; and two new\ndatasets that are made public for further research.\n",
"title": "Automated labeling of bugs and tickets using attention-based mechanisms in recurrent neural networks"
}
| null | null |
[
"Statistics"
] | null | true | null |
15312
| null |
Validated
| null | null |
null |
{
"abstract": " For robots to coexist with humans in a social world like ours, it is crucial\nthat they possess human-like social interaction skills. Programming a robot to\npossess such skills is a challenging task. In this paper, we propose a\nMultimodal Deep Q-Network (MDQN) to enable a robot to learn human-like\ninteraction skills through a trial and error method. This paper aims to develop\na robot that gathers data during its interaction with a human and learns human\ninteraction behaviour from the high-dimensional sensory information using\nend-to-end reinforcement learning. This paper demonstrates that the robot was\nable to learn basic interaction skills successfully, after 14 days of\ninteracting with people.\n",
"title": "Robot gains Social Intelligence through Multimodal Deep Reinforcement Learning"
}
| null | null | null | null | true | null |
15313
| null |
Default
| null | null |
null |
{
"abstract": " I give a brief overview of arXiv history, and describe the current state of\narXiv practice, both technical and sociological. This commentary originally\nappeared in the EMBO Journal, 19 Oct 2016. It was intended as an update on\ncomments from the late 1990s regarding use of preprints by biologists (or lack\nthereof), but may be of interest to practitioners of other disciplines. It is\nbased largely on a keynote presentation I gave to the ASAPbio inaugural meeting\nin Feb 2016, and responds as well to some follow-up questions.\n",
"title": "Preprint Déjà Vu: an FAQ"
}
| null | null | null | null | true | null |
15314
| null |
Default
| null | null |
null |
{
"abstract": " In recent years, realistic hydrodynamical simulations of galaxies like the\nMilky Way have become available, enabling a reliable estimate of the dark\nmatter density and velocity distribution in the Solar neighborhood. We review\nhere the status of hydrodynamical simulations and their implications for the\ninterpretation of direct dark matter searches. We focus in particular on: the\ncriteria to identify Milky Way-like galaxies; the impact of baryonic physics on\nthe dark matter velocity distribution; the possible presence of substructures\nlike clumps, streams, or dark disks; and on the implications for the direct\ndetection of dark matter with standard and non-standard interactions.\n",
"title": "Implications of hydrodynamical simulations for the interpretation of direct dark matter searches"
}
| null | null | null | null | true | null |
15315
| null |
Default
| null | null |
null |
{
"abstract": " Charge-neutral 180$^\\circ$ domain walls that separate domains of antiparallel\npolarization directions are common structural topological defects in\nferroelectrics. In normal ferroelectrics, charged 180$^\\circ$ domain walls\nrunning perpendicular to the polarization directions are highly energetically\nunfavorable because of the depolarization field and are difficult to stabilize.\nWe explore both neutral and charged 180$^\\circ$ domain walls in\nhyperferroelectrics, a class of proper ferroelectrics with persistent\npolarization in the presence of a depolarization field, using density\nfunctional theory. We obtain zero temperature equilibrium structures of\nhead-to-head and tail-to-tail walls in recently discovered $ABC$-type hexagonal\nhyperferroelectrics. Charged domain walls can also be stabilized in canonical\nferroelectrics represented by LiNbO$_3$ without any dopants, defects or\nmechanical clamping. First-principles electronic structure calculations show\nthat charged domain walls can reduce and even close the band gap of host\nmaterials and support quasi-two-dimensional electron(hole) gas with enhanced\nelectrical conductivity.\n",
"title": "Stable Charged Antiparallel Domain Walls in Hyperferroelectrics"
}
| null | null |
[
"Physics"
] | null | true | null |
15316
| null |
Validated
| null | null |
null |
{
"abstract": " Android apps should be designed to cope with stop-start events, which are the\nevents that require stopping and restoring the execution of an app while\nleaving its state unaltered. These events can be caused by run-time\nconfiguration changes, such as a screen rotation, and by context-switches, such\nas a switch from one app to another. When a stop-start event occurs, Android\nsaves the state of the app, handles the event, and finally restores the saved\nstate. To let Android save and restore the state correctly, apps must provide\nthe appropriate support. Unfortunately, Android developers often implement this\nsupport incorrectly, or do not implement it at all. This bad practice makes\napps to incorrectly react to stop-start events, thus generating what we defined\ndata loss problems, that is Android apps that lose user data, behave\nunexpectedly, and crash due to program variables that lost their values. Data\nloss problems are difficult to detect because they might be observed only when\napps are in specific states and with specific inputs. Covering all the possible\ncases with testing may require a large number of test cases whose execution\nmust be checked manually to discover whether the app under test has been\ncorrectly restored after each stop-start event. It is thus important to\ncomplement traditional in-house testing activities with mechanisms that can\nprotect apps as soon as a data loss problem occurs in the field. In this paper\nwe present DataLossHealer, a technique for automatically identifying and\nhealing data loss problems in the field as soon as they occur. DataLossHealer\nis a technique that checks at run-time whether states are recovered correctly,\nand heals the app when needed. DataLossHealer can learn from experience,\nincrementally reducing the overhead that is introduced avoiding to monitor\ninteractions that have been managed correctly by the app in the past.\n",
"title": "Healing Data Loss Problems in Android Apps"
}
| null | null | null | null | true | null |
15317
| null |
Default
| null | null |
null |
{
"abstract": " Strongly disordered spin chains invariant under the SO(N) group are shown to\ndisplay antiferromagnetic phases with emergent SU(N) symmetry without fine\ntuning. The phases with emergent SU(N) symmetry are of two kinds: one has a\nground state formed of randomly distributed singlets of strongly bound pairs of\nSO(N) spins (the `mesonic' phase), while the other has a ground state composed\nof singlets made out of strongly bound integer multiples of N SO(N) spins (the\n`baryonic' phase). Although the mechanism is general, we argue that the cases\nN=2,3,4 and 6 can in principle be realized with the usual spin and orbital\ndegrees of freedom.\n",
"title": "Emergent SU(N) symmetry in disordered SO(N) spin chains"
}
| null | null | null | null | true | null |
15318
| null |
Default
| null | null |
null |
{
"abstract": " The use of opto-thermal molecular energy storage at the nanoscale creates new\nopportunities for powering future microdevices with flexible synthetic\ntailorability. Practical application of these molecular materials, however,\nrequires a deeper microscopic understanding of how their behavior is altered by\nthe presence of different types of substrates. Here we present single-molecule\nresolved scanning tunneling microscopy imaging of thermally- and\noptically-induced structural transitions in (fulvalene)tetracarbonyldiruthenium\nmolecules adsorbed onto a Ag(100) surface as a prototype system. Both the\nparent complex and the photoisomer display distinct thermally-driven phase\ntransformations when they are in contact with a Ag(100) surface. This behavior\nis consistent with the loss of carbonyl ligands due to strong molecule-surface\ncoupling. Ultraviolet radiation induces marked structural changes only in the\nintact parent complex, thus indicating a photoisomerization reaction. These\nresults demonstrate how stimuli-induced structural transitions in this class of\nmolecule depend on the nature of the underlying substrate.\n",
"title": "Imaging structural transitions in organometallic molecules on Ag(100) for solar thermal energy storage"
}
| null | null |
[
"Physics"
] | null | true | null |
15319
| null |
Validated
| null | null |
null |
{
"abstract": " Using hybrid exchange-correlation functional in ab initio density functional\ntheory calculations, we study magnetic properties and strain effect on the\nelectronic properties of $\\alpha$-graphyne monolayer. We find that a\nspontaneous antiferromagnetic (AF) ordering occurs with energy band gap ($\\sim$\n0.5 eV) in the equilibrated $\\alpha$-graphyne. Bi-axial tensile strain enhances\nthe stability of AF state as well as the staggered spin moment and value of the\nenergy gap. The antiferromagnetic semiconductor phase is quite robust against\nmoderate carrier filling with threshold carrier density up to\n1.7$\\times$10$^{14}$ electrons/cm$^2$ to destabilize the phase. The spontaneous\nAF ordering and strain effect in $\\alpha$-graphyne can be well described by the\nframework of the Hubbard model. Our study shows that it is essential to\nconsider the electronic correlation effect properly in $\\alpha$-graphyne and\nmay pave an avenue for exploring magnetic ordering in other carbon allotropes\nwith mixed hybridization of s and p orbitals.\n",
"title": "Spontaneous antiferromagnetic order and strain effect on electronic properties of $α$-graphyne"
}
| null | null |
[
"Physics"
] | null | true | null |
15320
| null |
Validated
| null | null |
null |
{
"abstract": " During genomics life science research, the data volume of whole genomics and\nlife science algorithm is going bigger and bigger, which is calculated as TB,\nPB or EB etc. The key problem will be how to store and analyze the data with\noptimized way. This paper demonstrates how Intel Big Data Technology and\nArchitecture help to facilitate and accelerate the genomics life science\nresearch in data store and utilization. Intel defines high performance\nGenomicsDB for variant call data query and Lustre filesystem with Hierarchal\nStorage Management for genomics data store. Based on these great technology,\nIntel defines genomics knowledge share and exchange architecture, which is\nlanded and validated in BGI China and Shanghai Children Hospital with very\npositive feedback. And these big data technology can definitely be scaled to\nmuch more genomics life science partners in the world.\n",
"title": "Big Data Technology Accelerate Genomics Precision Medicine"
}
| null | null | null | null | true | null |
15321
| null |
Default
| null | null |
null |
{
"abstract": " In the framework of the Laplacian transport, described by a Robin boundary\nvalue problem in an exterior domain in $\\mathbb{R}^n$, we generalize the\ndefinition of the Poincaré-Steklov operator to $d$-set boundaries, $n-2<\nd<n$, and give its spectral properties to compare to the spectra of the\ninterior domain and also of a truncated domain, considered as an approximation\nof the exterior case. The well-posedness of the Robin boundary value problems\nfor the truncated and exterior domains is given in the general framework of\n$n$-sets. The results are obtained thanks to a generalization of the continuity\nand compactness properties of the trace and extension operators in Sobolev,\nLebesgue and Besov spaces, in particular, by a generalization of the classical\nRellich-Kondrachov Theorem of compact embeddings for $n$ and $d$-sets.\n",
"title": "Dirichlet-to-Neumann or Poincaré-Steklov operator on fractals described by d -sets"
}
| null | null | null | null | true | null |
15322
| null |
Default
| null | null |
null |
{
"abstract": " Deep generative models have been wildly successful at learning coherent\nlatent representations for continuous data such as video and audio. However,\ngenerative modeling of discrete data such as arithmetic expressions and\nmolecular structures still poses significant challenges. Crucially,\nstate-of-the-art methods often produce outputs that are not valid. We make the\nkey observation that frequently, discrete data can be represented as a parse\ntree from a context-free grammar. We propose a variational autoencoder which\nencodes and decodes directly to and from these parse trees, ensuring the\ngenerated outputs are always valid. Surprisingly, we show that not only does\nour model more often generate valid outputs, it also learns a more coherent\nlatent space in which nearby points decode to similar discrete outputs. We\ndemonstrate the effectiveness of our learned models by showing their improved\nperformance in Bayesian optimization for symbolic regression and molecular\nsynthesis.\n",
"title": "Grammar Variational Autoencoder"
}
| null | null | null | null | true | null |
15323
| null |
Default
| null | null |
null |
{
"abstract": " We obtain the optimal Bayesian minimax rate for the unconstrained large\ncovariance matrix of multivariate normal sample with mean zero, when both the\nsample size, n, and the dimension, p, of the covariance matrix tend to\ninfinity. Traditionally the posterior convergence rate is used to compare the\nfrequentist asymptotic performance of priors, but defining the optimality with\nit is elusive. We propose a new decision theoretic framework for prior\nselection and define Bayesian minimax rate. Under the proposed framework, we\nobtain the optimal Bayesian minimax rate for the spectral norm for all rates of\np. We also considered Frobenius norm, Bregman divergence and squared\nlog-determinant loss and obtain the optimal Bayesian minimax rate under certain\nrate conditions on p. A simulation study is conducted to support the\ntheoretical results.\n",
"title": "Optimal Bayesian Minimax Rates for Unconstrained Large Covariance Matrices"
}
| null | null | null | null | true | null |
15324
| null |
Default
| null | null |
null |
{
"abstract": " We solve a lifecycle model in which the consumer's chronological age does not\nmove in lockstep with calendar time. Instead, biological age increases at a\nstochastic non-linear rate in time like a broken clock that might occasionally\nmove backwards. In other words, biological age could actually decline. Our\npaper is inspired by the growing body of medical literature that has identified\nbiomarkers which indicate how people age at different rates. This offers better\nestimates of expected remaining lifetime and future mortality rates. It isn't\nfarfetched to argue that in the not-too-distant future personal age will be\nmore closely associated with biological vs. calendar age. Thus, after\nintroducing our stochastic mortality model we derive optimal consumption rates\nin a classic Yaari (1965) framework adjusted to our proper clock time. In\naddition to the normative implications of having access to biological age, our\npositive objective is to partially explain the cross-sectional heterogeneity in\nretirement spending rates at any given chronological age. In sum, we argue that\nneither biological nor chronological age alone is a sufficient statistic for\nmaking economic decisions. Rather, both ages are required to behave rationally.\n",
"title": "Retirement spending and biological age"
}
| null | null | null | null | true | null |
15325
| null |
Default
| null | null |
null |
{
"abstract": " We present a complete and consistent quantum theory of generalised X waves\nwith orbital angular momentum (OAM) in dispersive media. We show that the\nresulting quantised light pulses are affected by neither dispersion nor\ndiffraction and are therefore resilient against external perturbations. The\nnonlinear interaction of quantised X waves in quadratic and Kerr nonlinear\nmedia is also presented and studied in detail.\n",
"title": "Quantum X Waves with Orbital Angular Momentum in Nonlinear Dispersive Media"
}
| null | null | null | null | true | null |
15326
| null |
Default
| null | null |
null |
{
"abstract": " We investigate drag reduction due to the flow-induced reconfiguration of a\nflexible thin plate in presence of skin friction drag at low Reynolds Number.\nThe plate is subjected to a uniform free stream and is tethered at one end. We\nextend existing models in the literature to account for the skin friction drag.\nThe total drag on the plate with respect to a rigid upright plate decreases due\nto flow-induced reconfiguration and further reconfiguration increases the total\ndrag due to increase in skin friction drag. A critical value of Cauchy number\n($Ca$) exists at which the total drag on the plate with respect to a rigid\nupright plate is minimum at a given Reynolds number. The reconfigured shape of\nthe plate for this condition is unique, beyond which the total drag increases\non the plate even with reconfiguration. The ratio of the form drag coefficient\nfor an upright rigid plate and skin drag coefficient for a horizontal rigid\nplate ($\\lambda$) determines the critical Cauchy number ($Ca_{cr}$). We propose\nmodification in the drag scaling with free stream velocity ($F_{x}$ ${\\propto}$\n$U^{n}$) in presence of the skin friction drag. The following expressions of\n$n$ are found for $0.01 \\leq Re \\leq 1$, $n = 4/5 + {\\lambda}/5$ for 1 $\\leq$\n$Ca$ $<$ $Ca_{cr}$ and $n = 1 + {\\lambda}/5$ for $Ca_{cr} \\leq Ca \\leq 300$,\nwhere $Re$ is Reynolds number. We briefly discuss the combined effect of the\nskin friction drag and buoyancy on the drag reduction. An assessment of the\nfeasibility of experiments is presented in order to translate the present model\nto physical systems.\n",
"title": "Role of Skin Friction Drag during Flow-Induced Reconfiguration of a Flexible Thin Plate"
}
| null | null | null | null | true | null |
15327
| null |
Default
| null | null |
null |
{
"abstract": " The success of deep learning has led to a rising interest in the\ngeneralization property of the stochastic gradient descent (SGD) method, and\nstability is one popular approach to study it. Existing works based on\nstability have studied nonconvex loss functions, but only considered the\ngeneralization error of the SGD in expectation. In this paper, we establish\nvarious generalization error bounds with probabilistic guarantee for the SGD.\nSpecifically, for both general nonconvex loss functions and gradient dominant\nloss functions, we characterize the on-average stability of the iterates\ngenerated by SGD in terms of the on-average variance of the stochastic\ngradients. Such characterization leads to improved bounds for the\ngeneralization error for SGD. We then study the regularized risk minimization\nproblem with strongly convex regularizers, and obtain improved generalization\nerror bounds for proximal SGD. With strongly convex regularizers, we further\nestablish the generalization error bounds for nonconvex loss functions under\nproximal SGD with high-probability guarantee, i.e., exponential concentration\nin probability.\n",
"title": "Generalization Error Bounds with Probabilistic Guarantee for SGD in Nonconvex Optimization"
}
| null | null | null | null | true | null |
15328
| null |
Default
| null | null |
null |
{
"abstract": " In this paper, an original heuristic algorithm of empty vehicles management\nin personal rapid transit network is presented. The algorithm is used for the\ndelivery of empty vehicles for waiting passengers, for balancing the\ndistribution of empty vehicles within the network, and for providing an empty\nspace for vehicles approaching a station. Each of these tasks involves a\ndecision on the trip that has to be done by a selected empty vehicle from its\nactual location to some determined destination. The decisions are based on a\nmulti-parameter function involving a set of factors and thresholds. An\nimportant feature of the algorithm is that it does not use any central database\nof passenger input (demand) and locations of free vehicles. Instead, it is\nbased on the local exchange of data between stations: on their states and on\nthe vehicles they expect. Therefore, it seems well-tailored for a distributed\nimplementation. The algorithm is uniform, meaning that the same basic procedure\nis used for multiple tasks using a task-specific set of parameters.\n",
"title": "Distributed algorithm for empty vehicles management in personal rapid transit (PRT) network"
}
| null | null | null | null | true | null |
15329
| null |
Default
| null | null |
null |
{
"abstract": " We derive in a direct way the exact controllability of the 1D free\nSchrödinger equation with Dirichlet boundary control. We use the so-called\nflatness approach, which consists in parametrizing the solution and the control\nby the derivatives of a \"flat output\". This provides an explicit and very\nregular control achieving the exact controllability in the energy space.\n",
"title": "Controllability of the 1D Schrödinger equation using flatness"
}
| null | null | null | null | true | null |
15330
| null |
Default
| null | null |
null |
{
"abstract": " The strategy of sustainable development in the governance of information and\ncommunication technology (ICT) is a sector of advanced research that leads to\nrising challenges posed by social and environmental requirements in the\nimplementation and establishment of the governance strategy. This paper offers\nnew generation governance model that we call \"ICT Green Governance\". The\nproposed framework provides an original model based on the Corporate Social\nResponsibility (CSR) concept and Green IT strategy. Facing increasing pressure\nfrom stakeholders, the model offers a new vision of ICT governance to ensure\neffective and efficient use of ICT in enabling an enterprise to achieve its\ngoals. We present here the relevance of our model, on the basis of a literature\nreview, and provide guidelines and principles for effective ICT governance in\nthe way of sustainable development, in order to improve the economic, social\nand environmental performance of companies.\n",
"title": "ICT Green Governance: new generation model based on Corporate Social Responsibility and Green IT"
}
| null | null | null | null | true | null |
15331
| null |
Default
| null | null |
null |
{
"abstract": " This paper addresses the problem of automatic speech recognition (ASR) of a\ntarget speaker in background speech. The novelty of our approach is that we\nfocus on a wakeup keyword, which is usually used for activating ASR systems\nlike smart speakers. The proposed method firstly utilizes a DNN-based mask\nestimator to separate the mixture signal into the keyword signal uttered by the\ntarget speaker and the remaining background speech. Then the separated signals\nare used for calculating a beamforming filter to enhance the subsequent\nutterances from the target speaker. Experimental evaluations show that the\ntrained DNN-based mask can selectively separate the keyword and background\nspeech from the mixture signal. The effectiveness of the proposed method is\nalso verified with Japanese ASR experiments, and we confirm that the character\nerror rates are significantly improved by the proposed method for both\nsimulated and real recorded test sets.\n",
"title": "Speaker Selective Beamformer with Keyword Mask Estimation"
}
| null | null | null | null | true | null |
15332
| null |
Default
| null | null |
null |
{
"abstract": " We prove the following conjecture of Leighton and Moitra. Let $T$ be a\ntournament on $[n]$ and $S_n$ the set of permutations of $[n]$. For an arc $uv$\nof $T$, let $A_{uv}=\\{\\sigma \\in S_n \\, : \\, \\sigma(u)<\\sigma(v) \\}$.\n$\\textbf{Theorem.}$ For a fixed $\\varepsilon>0$, if $\\mathbb{P}$ is a\nprobability distribution on $S_n$ such that\n$\\mathbb{P}(A_{uv})>1/2+\\varepsilon$ for every arc $uv$ of $T$, then the binary\nentropy of $\\mathbb{P}$ is at most $(1-\\vartheta_{\\varepsilon})\\log_2 n!$ for\nsome (fixed) positive $\\vartheta_\\varepsilon$.\nWhen $T$ is transitive the theorem is due to Leighton and Moitra; for this\ncase we give a short proof with a better $\\vartheta_\\varepsilon$.\n",
"title": "Proof of an entropy conjecture of Leighton and Moitra"
}
| null | null | null | null | true | null |
15333
| null |
Default
| null | null |
null |
{
"abstract": " We study transient behaviour in the dynamics of complex systems described by\na set of non-linear ODE's. Destabilizing nature of transient trajectories is\ndiscussed and its connection with the eigenvalue-based linearization procedure.\nThe complexity is realized as a random matrix drawn from a modified May-Wigner\nmodel. Based on the initial response of the system, we identify a novel\nstable-transient regime. We calculate exact abundances of typical and extreme\ntransient trajectories finding both Gaussian and Tracy-Widom distributions\nknown in extreme value statistics. We identify degrees of freedom driving\ntransient behaviour as connected to the eigenvectors and encoded in a\nnon-orthogonality matrix $T_0$. We accordingly extend the May-Wigner model to\ncontain a phase with typical transient trajectories present. An exact norm of\nthe trajectory is obtained in the vanishing $T_0$ limit where it describes a\nnormal matrix.\n",
"title": "What drives transient behaviour in complex systems?"
}
| null | null | null | null | true | null |
15334
| null |
Default
| null | null |
null |
{
"abstract": " By assuming some widely-believed arithmetic conjectures, we show that the\ntask of accepting a number that is representable as a sum of $d\\geq2$ squares\nsubjected to given congruence conditions is NP-complete. On the other hand, we\ndevelop and implement a deterministic polynomial-time algorithm that represents\na number as a sum of 4 squares with some restricted congruence conditions, by\nassuming a polynomial-time algorithm for factoring integers and\nConjecture~\\ref{cc}. As an application, we develop and implement a\ndeterministic polynomial-time algorithm for navigating LPS Ramanujan graphs,\nunder the same assumptions.\n",
"title": "Complexity of strong approximation on the sphere"
}
| null | null | null | null | true | null |
15335
| null |
Default
| null | null |
null |
{
"abstract": " Recently proposed model of foam impact on the air sea drag coefficient Cd has\nbeen employed for the estimation of the efficient foam-bubble radius Rb\nvariation with wind speed U10 in hurricane conditions. The model relates Cd\n(U10) with the efficient roughness length Zeff (U10) represented as a sum of\naerodynamic roughness lengths of the foam free and foam covered sea surfaces Zw\n(U10 ), and Zf (U10) weighted with the foam coverage coefficient. This relation\nis treated for known phenomenological distributions Cd (U10), Zw (U10) at\nstrong wind speeds as an inverse problem for the efficient roughness parameter\nof foam-covered sea surface Zf (U10).\n",
"title": "Correlation between Foam-Bubble Size and Drag Coefficient in Hurricane Conditions"
}
| null | null | null | null | true | null |
15336
| null |
Default
| null | null |
null |
{
"abstract": " This paper discusses the synthesis, characterization, and comprehensive study\nof Ba-122 single crystals with various substitutions and various $T_c$. The\npaper uses five complementary techniques to obtain a self-consistent set of\ndata on the superconducting properties of Ba-122. A major conclusion of the\nauthors work is the coexistence of two superconducting condensates differing in\nthe electron-boson coupling strength. The two gaps that develop in distinct\nFermi surface sheets are nodeless in the $k_xk_y$-plane and exhibit s-wave\nsymmetry, the two-band model represents a sufficient data description tool. A\nmoderate interband coupling and a considerable Coulomb repulsion in the\ndescription of the two-gap superconducting state of barium pnictides favor the\n$s^{++}$-model.\n",
"title": "On the Structure of Superconducting Order Parameter in High-Temperature Fe-Based Superconductors"
}
| null | null |
[
"Physics"
] | null | true | null |
15337
| null |
Validated
| null | null |
null |
{
"abstract": " The use of secure connections using HTTPS as the default means, or even the\nonly means, to connect to web servers is increasing. It is being pushed from\nboth sides: from the bottom up by client distributions and plugins, and from\nthe top down by organisations such as Google. However, there are potential\ntechnical hurdles that might lock some clients out of the modern web. This\npaper seeks to measure and precisely quantify those hurdles in the wild. More\nthan three million measurements provide statistically significant evidence of\ndegradation. We show this through a variety of statistical techniques. Various\nfactors are shown to influence the problem, ranging from the client's browser,\nto the locale from which they connect.\n",
"title": "Rigorous statistical analysis of HTTPS reachability"
}
| null | null | null | null | true | null |
15338
| null |
Default
| null | null |
null |
{
"abstract": " This paper addresses the question of whether it can be beneficial for an\noptimization algorithm to follow directions of negative curvature. Although\nprior work has established convergence results for algorithms that integrate\nboth descent and negative curvature steps, there has not yet been extensive\nnumerical evidence showing that such methods offer consistent performance\nimprovements. In this paper, we present new frameworks for combining descent\nand negative curvature directions: alternating two-step approaches and dynamic\nstep approaches. The aspect that distinguishes our approaches from ones\npreviously proposed is that they make algorithmic decisions based on\n(estimated) upper-bounding models of the objective function. A consequence of\nthis aspect is that our frameworks can, in theory, employ fixed stepsizes,\nwhich makes the methods readily translatable from deterministic to stochastic\nsettings. For deterministic problems, we show that instances of our dynamic\nframework yield gains in performance compared to related methods that only\nfollow descent steps. We also show that gains can be made in a stochastic\nsetting in cases when a standard stochastic-gradient-type method might make\nslow progress.\n",
"title": "Exploiting Negative Curvature in Deterministic and Stochastic Optimization"
}
| null | null | null | null | true | null |
15339
| null |
Default
| null | null |
null |
{
"abstract": " We generalise the notion of a separating intersection of links (SIL) to give\nnecessary and sufficient criteria on the defining graph $\\Gamma$ of a\nright-angled Coxeter group $W_\\Gamma$ so that its outer automorphism group is\nlarge: that is, it contains a finite index subgroup that admits the free group\n$F_2$ as a quotient. When $Out(W_\\Gamma)$ is not large, we show it is virtually\nabelian. We also show that the same dichotomy holds for the outer automorphism\ngroups of graph products of finite abelian groups. As a consequence, these\ngroups have property (T) if and only if they are finite, or equivalently\n$\\Gamma$ contains no SIL.\n",
"title": "Outer automorphism groups of right-angled Coxeter groups are either large or virtually abelian"
}
| null | null | null | null | true | null |
15340
| null |
Default
| null | null |
null |
{
"abstract": " The Limb-imaging Ionospheric and Thermospheric Extreme-ultraviolet\nSpectrograph (LITES) experiment is one of thirteen instruments aboard the Space\nTest Program Houston 5 (STP-H5) payload on the International Space Station.\nAlong with the complementary GPS Radio Occultation and Ultraviolet Photometry\n-- Colocated (GROUP-C) experiment, LITES will investigate ionospheric\nstructures and variability relevant to the global ionosphere. The ISS has an\norbital inclination of 51.6° which combined with its altitude of about 410\nkm enables middle- and low-latitude measurements from slightly above the peak\nregion of the ionosphere. The LITES instrument features a 10° by 10°\nfield of view which is collapsed horizontally, combining all information from a\ngiven altitude. The instrument is installed such it looks in the wake of the\nISS and about 14.5° downwards in order to image altitudes ranging from\nabout 350 km to 150 km. The actual viewing altitude and geometry is directly\ndependent on the pitch of the ISS, affecting the geophysical information\ncaptured by the instrument.\n",
"title": "Retrieving Instantaneous Field of View and Geophysical Information for Atmospheric Limb Sounding with USGNC Near Real-Time Orbit Data"
}
| null | null | null | null | true | null |
15341
| null |
Default
| null | null |
null |
{
"abstract": " Calculating one-body density profiles in equilibrium via particle-based\nsimulation methods involves counting of events of particle occurrences at\n(histogram-resolved) space points. Here we investigate an alternative method\nbased on a histogram of the local force density. Via an exact sum rule the\ndensity profile is obtained with a simple spatial integration. The method\ncircumvents the inherent ideal gas fluctuations. We have tested the method in\nMonte Carlo, Brownian Dynamics and Molecular Dynamics simulations. The results\ncarry a statistical uncertainty smaller than that of the standard, counting,\nmethod, reducing therefore the computation time.\n",
"title": "Better than counting: Density profiles from force sampling"
}
| null | null |
[
"Physics"
] | null | true | null |
15342
| null |
Validated
| null | null |
null |
{
"abstract": " Security exploits can include cyber threats such as computer programs that\ncan disturb the normal behavior of computer systems (viruses), unsolicited\ne-mail (spam), malicious software (malware), monitoring software (spyware),\nattempting to make computer resources unavailable to their intended users\n(Distributed Denial-of-Service or DDoS attack), the social engineering, and\nonline identity theft (phishing). One such cyber threat, which is particularly\ndangerous to computer users is phishing. Phishing is well known as online\nidentity theft, which targets to steal victims' sensitive information such as\nusername, password and online banking details. This paper focuses on designing\nan innovative and gamified approach to educate individuals about phishing\nattacks. The study asks how one can integrate self-efficacy, which has a\nco-relation with the user's knowledge, into an anti-phishing educational game\nto thwart phishing attacks? One of the main reasons would appear to be a lack\nof user knowledge to prevent from phishing attacks. Therefore, this research\ninvestigates the elements that influence (in this case, either conceptual or\nprocedural knowledge or their interaction effect) and then integrate them into\nan anti-phishing educational game to enhance people's phishing prevention\nbehaviour through their motivation.\n",
"title": "Integrating self-efficacy into a gamified approach to thwart phishing attacks"
}
| null | null | null | null | true | null |
15343
| null |
Default
| null | null |
null |
{
"abstract": " We study the quantum dynamics of the Bose-Hubbard model on a ladder formed by\ntwo rings coupled by tunneling effect. By implementing the Bogoliubov\napproximation scheme, we prove that, despite the presence of the inter-ring\ncoupling term, the Hamiltonian decouples in many independent sub-Hamiltonians\n$\\hat{H}_k$ associated to momentum-mode pairs $\\pm k$. Each sub-Hamiltonian\n$\\hat{H}_k$ is then shown to be part of a specific dynamical algebra. The\nproperties of the latter allow us to perform the diagonalization process, to\nfind energy spectrum, the conserved quantities of the model, and to derive the\ntime evolution of important physical observables. We then apply this solution\nscheme to the simplest possible closed ladder, the double trimer. After\nobserving that the excitations of the system are weakly-populated vortices, we\nexplore the corresponding dynamics by varying the initial conditions and the\nmodel parameters. Finally, we show that the inter-ring tunneling determines a\nspectral collapse when approaching the border of the dynamical-stability\nregion.\n",
"title": "Quantum dynamics of bosons in a two-ring ladder: dynamical algebra, vortex-like excitations and currents"
}
| null | null | null | null | true | null |
15344
| null |
Default
| null | null |
null |
{
"abstract": " The inception network has been shown to provide good performance on image\nclassification problems, but there are not much evidences that it is also\neffective for the image restoration or pixel-wise labeling problems. For image\nrestoration problems, the pooling is generally not used because the decimated\nfeatures are not helpful for the reconstruction of an image as the output.\nMoreover, most deep learning architectures for the restoration problems do not\nuse dense prediction that need lots of training parameters. From these\nobservations, for enjoying the performance of inception-like structure on the\nimage based problems we propose a new convolutional network-in-network\nstructure. The proposed network can be considered a modification of inception\nstructure where pool projection and pooling layer are removed for maintaining\nthe entire feature map size, and a larger kernel filter is added instead.\nProposed network greatly reduces the number of parameters on account of removed\ndense prediction and pooling, which is an advantage, but may also reduce the\nreceptive field in each layer. Hence, we add a larger kernel than the original\ninception structure for not increasing the depth of layers. The proposed\nstructure is applied to typical image-to-image learning problems, i.e., the\nproblems where the size of input and output are same such as skin detection,\nsemantic segmentation, and compression artifacts reduction. Extensive\nexperiments show that the proposed network brings comparable or better results\nthan the state-of-the-art convolutional neural networks for these problems.\n",
"title": "A New Convolutional Network-in-Network Structure and Its Applications in Skin Detection, Semantic Segmentation, and Artifact Reduction"
}
| null | null | null | null | true | null |
15345
| null |
Default
| null | null |
null |
{
"abstract": " We analyse Kepler light-curves of the exoplanet KOI-13b transiting its\nmoderately rapidly rotating (gravity-darkened) parent star. A physical model,\nwith minimal ad hoc free parameters, reproduces the time-averaged light-curve\nat the ca. 10 parts per million level. We demonstrate that this Roche-model\nsolution allows the absolute dimensions of the system to be determined from the\nstar's projected equatorial rotation speed, v(e)sin(i), without any additional\nassumptions; we find a planetary radius 1.33+/-0.05 R(Jup), stellar polar\nradius 1.55+/-0.06 R(sun), combined mass M(*) + M(P) (\\simeq M*) = 1.47 +/-\n0.17 M(sun), and distance d \\simeq 370+/-25 pc, where the errors are dominated\nby uncertainties in relative flux contribution of the visual-binary companion\nKOI-13B. The implied stellar rotation period is within ca. 5% of the\nnon-orbital, 25.43-hr signal found in the Kepler photometry. We show that the\nmodel accurately reproduces independent tomographic observations, and yields an\noffset between orbital and stellar-rotation angular-momentum vectors of\n60.25+/-0.05 degrees.\n",
"title": "Rapid rotators revisited: absolute dimensions of KOI-13"
}
| null | null | null | null | true | null |
15346
| null |
Default
| null | null |
null |
{
"abstract": " We present an efficient and practical algorithm for the online prediction of\ndiscrete-time linear dynamical systems with a symmetric transition matrix. We\ncircumvent the non-convex optimization problem using improper learning:\ncarefully overparameterize the class of LDSs by a polylogarithmic factor, in\nexchange for convexity of the loss functions. From this arises a\npolynomial-time algorithm with a near-optimal regret guarantee, with an\nanalogous sample complexity bound for agnostic learning. Our algorithm is based\non a novel filtering technique, which may be of independent interest: we\nconvolve the time series with the eigenvectors of a certain Hankel matrix.\n",
"title": "Learning Linear Dynamical Systems via Spectral Filtering"
}
| null | null | null | null | true | null |
15347
| null |
Default
| null | null |
null |
{
"abstract": " Previous experiments have found mixed results on whether honesty is intuitive\nor requires deliberation. Here we add to this literature by building on prior\nwork of Capraro (2017). We report a large study (N=1,389) manipulating time\npressure vs time delay in a deception game. We find that, in this setting,\npeople are more honest under time pressure, and that this result is not driven\nby confounds present in earlier work.\n",
"title": "Time pressure and honesty in a deception game"
}
| null | null | null | null | true | null |
15348
| null |
Default
| null | null |
null |
{
"abstract": " A deep learning model is proposed for predicting block-level parking\noccupancy in real time. The model leverages Graph-Convolutional Neural Networks\n(GCNN) to extract the spatial relations of traffic flow in large-scale\nnetworks, and utilizes Recurrent Neural Networks (RNN) with Long-Short Term\nMemory (LSTM) to capture the temporal features. In addition, the model is\ncapable of taking multiple heterogeneously structured traffic data sources as\ninput, such as parking meter transactions, traffic speed, and weather\nconditions. The model performance is evaluated through a case study in\nPittsburgh downtown area. The proposed model outperforms other baseline methods\nincluding multi-layer LSTM and Lasso with an average testing MAPE of 12.0\\%\nwhen predicting block-level parking occupancies 30 minutes in advance. The case\nstudy also shows that, in generally, the prediction model works better for\nbusiness areas than for recreational locations. We found that incorporating\ntraffic speed and weather information can significantly improve the prediction\nperformance. Weather data is particularly useful for improving predicting\naccuracy in recreational areas.\n",
"title": "A deep learning approach to real-time parking occupancy prediction in spatio-termporal networks incorporating multiple spatio-temporal data sources"
}
| null | null | null | null | true | null |
15349
| null |
Default
| null | null |
null |
{
"abstract": " We define causal estimands for experiments on single time series, extending\nthe potential outcome framework to dealing with temporal data. Our approach\nallows the estimation of some of these estimands and exact randomization based\np-values for testing causal effects, without imposing stringent assumptions. We\ntest our methodology on simulated \"potential autoregressions,\"which have a\ncausal interpretation. Our methodology is partially inspired by data from a\nlarge number of experiments carried out by a financial company who compared the\nimpact of two different ways of trading equity futures contracts. We use our\nmethodology to make causal statements about their trading methods.\n",
"title": "Time series experiments and causal estimands: exact randomization tests and trading"
}
| null | null | null | null | true | null |
15350
| null |
Default
| null | null |
null |
{
"abstract": " In this paper, we show that sparse signals f representable as a linear\ncombination of a finite number N of spikes at arbitrary real locations or as a\nfinite linear combination of B-splines of order m with arbitrary real knots can\nbe almost surely recovered from O(N^2) Fourier intensity measurements up to\ntrivial ambiguities. The constructive proof consists of two steps, where in the\nfirst step the Prony method is applied to recover all parameters of the\nautocorrelation function and in the second step the parameters of f are\nderived. Moreover, we present an algorithm to evaluate f from its Fourier\nintensities and illustrate it at different numerical examples.\n",
"title": "Sparse phase retrieval of one-dimensional signals by Prony's method"
}
| null | null | null | null | true | null |
15351
| null |
Default
| null | null |
null |
{
"abstract": " We report the results of X-ray spectroscopy and Raman measurements of\nas-prepared graphene on a high quality copper surface and the same materials\nafter 1.5 years under different conditions (ambient and low humidity). The\nobtained results were compared with density functional theory calculations of\nthe formation energies and electronic structures of various structural defects\nin graphene/Cu interfaces. For evaluation of the stability of the carbon cover,\nwe propose a two-step model. The first step is oxidation of the graphene, and\nthe second is perforation of graphene with the removal of carbon atoms as part\nof the carbon dioxide molecule. Results of the modeling and experimental\nmeasurements provide evidence that graphene grown on high-quality copper\nsubstrate becomes robust and stable in time (1.5 years). However, the stability\nof this interface depends on the quality of the graphene and the number of\nnative defects in the graphene and substrate. The effect of the presence of a\nmetallic substrate with defects on the stability and electronic structure of\ngraphene is also discussed.\n",
"title": "Atomic and electronic structure of a copper/graphene interface as prepared and 1.5 years after"
}
| null | null | null | null | true | null |
15352
| null |
Default
| null | null |
null |
{
"abstract": " Forthcoming applications concerning humanoid robots may involve physical\ninteraction between the robot and a dynamic environment. In such scenario,\nclassical balancing and walking controllers that neglect the environment\ndynamics may not be sufficient for achieving a stable robot behavior. This\npaper presents a modeling and control framework for balancing humanoid robots\nin contact with a dynamic environment. We first model the robot and environment\ndynamics, together with the contact constraints. Then, a control strategy for\nstabilizing the full system is proposed. Theoretical results are verified in\nsimulation with robot iCub balancing on a seesaw.\n",
"title": "Modeling and Control of Humanoid Robots in Dynamic Environments: iCub Balancing on a Seesaw"
}
| null | null |
[
"Computer Science"
] | null | true | null |
15353
| null |
Validated
| null | null |
null |
{
"abstract": " Forward-backward selection is one of the most basic and commonly-used feature\nselection algorithms available. It is also general and conceptually applicable\nto many different types of data. In this paper, we propose a heuristic that\nsignificantly improves its running time, while preserving predictive accuracy.\nThe idea is to temporarily discard the variables that are conditionally\nindependent with the outcome given the selected variable set. Depending on how\nthose variables are reconsidered and reintroduced, this heuristic gives rise to\na family of algorithms with increasingly stronger theoretical guarantees. In\ndistributions that can be faithfully represented by Bayesian networks or\nmaximal ancestral graphs, members of this algorithmic family are able to\ncorrectly identify the Markov blanket in the sample limit. In experiments we\nshow that the proposed heuristic increases computational efficiency by about\ntwo orders of magnitude in high-dimensional problems, while selecting fewer\nvariables and retaining predictive performance. Furthermore, we show that the\nproposed algorithm and feature selection with LASSO perform similarly when\nrestricted to select the same number of variables, making the proposed\nalgorithm an attractive alternative for problems where no (efficient) algorithm\nfor LASSO exists.\n",
"title": "Forward-Backward Selection with Early Dropping"
}
| null | null | null | null | true | null |
15354
| null |
Default
| null | null |
null |
{
"abstract": " We explore the impact of dimensionality on the scattering of a small bosonic\nensemble in an elongated harmonic trap off a centered repulsive barrier,\nthereby taking particle correlations into account. The loss of coherence as\nwell as the oscillation of the center of mass are studied and we analyze the\ninfluence of both particle and spatial correlations. Two different mechanisms\nof coherence losses in dependence of the aspect ratio are found. For small\naspect ratios, loss of coherence between the region close to the barrier and\nouter regions occurs, due to spatial correlations, and for large aspect ratios,\nincoherence between the two density fragments of the left and right side of the\nbarrier arises, due to particle correlations. Apart form the decay of the\ncenter of mass motion induced by the reflection and transmission, further\neffects due to the particle and spatial correlations are explored. For tight\ntransversal traps, the amplitude of the center of mass oscillation experiences\na weaker damping, which can be traced back to the population of a second\nnatural orbital, and for a weaker transversal confinement, we detect a strong\ndecay, due to the possibility of transferring energy to transversal excited\nmodes. These effects are enhanced if the aspect ratio is integer valued.\n",
"title": "Ultracold bosonic scattering dynamics off a repulsive barrier: coherence loss at the dimensional crossover"
}
| null | null | null | null | true | null |
15355
| null |
Default
| null | null |
null |
{
"abstract": " A new type of quadrature is developed. The Gauss quadrature, for a given\nmeasure, finds optimal values of a function's argument (nodes) and the\ncorresponding weights. In contrast, the Lebesgue quadrature developed in this\npaper, finds optimal values of function (value-nodes) and the corresponding\nweights. The Gauss quadrature groups sums by function argument, it can be\nviewed as a $n$-point discrete measure, producing the Riemann integral. The\nLebesgue quadrature groups sums by function value, it can be viewed as a\n$n$-point discrete distribution, producing the Lebesgue integral.\nMathematically, the problem is reduced to a generalized eigenvalue problem:\nLebesgue quadrature value-nodes are the eigenvalues and the corresponding\nweights are the square of the averaged eigenvectors. A numerical estimation of\nan integral as the Lebesgue integral is especially advantageous when analyzing\nirregular and stochastic processes. The approach separates the outcome\n(value-nodes) and the probability of the outcome (weight). For this reason, it\nis especially well-suited for the study of non--Gaussian processes. The\nsoftware implementing the theory is available from the authors.\n",
"title": "On Lebesgue Integral Quadrature"
}
| null | null | null | null | true | null |
15356
| null |
Default
| null | null |
null |
{
"abstract": " The protection number of a plane tree is the minimal distance of the root to\na leaf; this definition carries over to an arbitrary node in a plane tree by\nconsidering the maximal subtree having this node as a root. We study the the\nprotection number of a uniformly chosen random tree of size $n$ and also the\nprotection number of a uniformly chosen node in a uniformly chosen random tree\nof size $n$. The method is to apply singularity analysis to appropriate\ngenerating functions. Additional results are provided as well.\n",
"title": "Protection Number in Plane Trees"
}
| null | null | null | null | true | null |
15357
| null |
Default
| null | null |
null |
{
"abstract": " For $e \\in S^{2}$, the unit sphere in $\\mathbb{R}^3$, let $\\pi_{e}$ be the\northogonal projection to $e^{\\perp} \\subset \\mathbb{R}^{3}$, and let $W \\subset\n\\mathbb{R}^{3}$ be any $2$-plane, which is not a subspace. We prove that if $K\n\\subset \\mathbb{R}^{3}$ is a Borel set with $\\dim_{\\mathrm{H}} K \\leq\n\\tfrac{3}{2}$, then $\\dim_{\\mathrm{H}} \\pi_{e}(K) = \\dim_{\\mathrm{H}} K$ for\n$\\mathcal{H}^{1}$ almost every $e \\in S^{2} \\cap W$, where $\\mathcal{H}^{1}$\ndenotes the $1$-dimensional Hausdorff measure and $\\dim_{\\mathrm{H}}$ the\nHausdorff dimension. This was known earlier, due to Järvenpää,\nJärvenpää, Ledrappier and Leikas, for Borel sets $K \\subset\n\\mathbb{R}^{3}$ with $\\dim_{\\mathrm{H}} K \\leq 1$. We also prove a partial\nresult for sets with dimension exceeding $3/2$, improving earlier bounds by D.\nOberlin and R. Oberlin.\n",
"title": "Improved bounds for restricted families of projections to planes in $\\mathbb{R}^{3}$"
}
| null | null | null | null | true | null |
15358
| null |
Default
| null | null |
null |
{
"abstract": " The classical Galois theory deals with certain finite algebraic extensions\nand establishes a bijective order reversing correspondence between the\nintermediate fields and the subgroups of a group of permutations called the\nGalois group of the extension. It has been the dream of many mathematicians at\nthe end of the nineteenth century to generalize these results to systems of\nalgebraic partial differential (PD) equations and the corresponding finitely\ngenerated differential extensions, in order to be able to add the word\ndifferential in front of any classical statement. The achievement of the\nPicard-Vessiot theory by E. Kolchin between 1950 and 1970 is now well known.\nThe purpose of this paper is to sketch the general theory for such differential\nextensions and algebraic pseudogroups by means of new methods mixing\ndifferential algebra, differential geometry and algebraic geometry. As already\ndiscovered by E. Vessiot in 1904 through the use of automorphic systems, a\nconcept never acknowledged, the main point is to notice that the Galois theory\n(old and new) is mainly a study of principal homogeneous spaces (PHS) for\nalgebraic groups or pseudogroups. Hence, all the formal theory of PD equations\ndevelopped by D.C. Spencer around 1970 must be used together with modern\nalgebraic geometry, in particular tensor products of rings and fields. However,\nthe combination of these new tools is not sufficient and we have to create the\nanalogue for Lie pseudogroups of the so-called invariant derivations introduced\nby A. Bialynicki-Birula after 1960 in the study of algebraic groups and fields\nwith derivations. We shall finally prove the usefulness of the resulting\ndifferential Galois theory through striking applications to mechanics,\nrevisiting shell theory, chain theory, the Frenet-Serret formulas and the\nintegration of Hamilton-Jacobi equations.\n",
"title": "Differential galois theory and mechanics"
}
| null | null | null | null | true | null |
15359
| null |
Default
| null | null |
null |
{
"abstract": " In our recent paper W.S. Rossi, P. Frasca and F. Fagnani, \"Average resistance\nof toroidal graphs\", SIAM Journal on Control and Optimization,\n53(4):2541--2557, 2015, we studied how the average resistances of\n$d$-dimensional toroidal grids depend on the graph topology and on the\ndimension of the graph. Our results were based on the connection between\nresistance and Laplacian eigenvalues. In this note, we contextualize our work\nin the body of literature about random walks on graphs. Indeed, the average\neffective resistance of the $d$-dimensional toroidal grid is proportional to\nthe mean hitting time of the simple random walk on that grid. If $d\\geq3 $,\nthen the average resistance can be bounded uniformly in the number of nodes and\nits value is of order $1/d$ for large $d$.\n",
"title": "Note on \"Average resistance of toroidal graphs\" by Rossi, Frasca and Fagnani"
}
| null | null | null | null | true | null |
15360
| null |
Default
| null | null |
null |
{
"abstract": " Runtime Monitoring is a lightweight and dynamic verification technique that\ninvolves observing the internal operations of a software system and/or its\ninteractions with other external entities, with the aim of determining whether\nthe system satisfies or violates a correctness specification. Compilation\ntechniques employed in Runtime Monitoring tools allow monitors to be\nautomatically derived from high-level correctness specifications (aka.\nproperties). This allows the same property to be converted into different types\nof monitors, which may apply different instrumentation techniques for checking\nwhether the property was satisfied or not. In this paper we compare and\ncontrast the various types of monitoring methodologies found in the current\nliterature, and classify them into a spectrum of monitoring instrumentation\ntechniques, ranging from completely asynchronous monitoring on the one end and\ncompletely synchronous monitoring on the other.\n",
"title": "A Survey of Runtime Monitoring Instrumentation Techniques"
}
| null | null | null | null | true | null |
15361
| null |
Default
| null | null |
null |
{
"abstract": " Questions that require counting a variety of objects in images remain a major\nchallenge in visual question answering (VQA). The most common approaches to VQA\ninvolve either classifying answers based on fixed length representations of\nboth the image and question or summing fractional counts estimated from each\nsection of the image. In contrast, we treat counting as a sequential decision\nprocess and force our model to make discrete choices of what to count.\nSpecifically, the model sequentially selects from detected objects and learns\ninteractions between objects that influence subsequent selections. A\ndistinction of our approach is its intuitive and interpretable output, as\ndiscrete counts are automatically grounded in the image. Furthermore, our\nmethod outperforms the state of the art architecture for VQA on multiple\nmetrics that evaluate counting.\n",
"title": "Interpretable Counting for Visual Question Answering"
}
| null | null | null | null | true | null |
15362
| null |
Default
| null | null |
null |
{
"abstract": " The choice of model class is fundamental in statistical learning and system\nidentification, no matter whether the class is derived from physical principles\nor is a generic black-box. We develop a method to evaluate the specified model\nclass by assessing its capability of reproducing data that is similar to the\nobserved data record. This model check is based on the information-theoretic\nproperties of models viewed as data generators and is applicable to e.g.\nsequential data and nonlinear dynamical models. The method can be understood as\na specific two-sided posterior predictive test. We apply the\ninformation-theoretic model check to both synthetic and real data and compare\nit with a classical whiteness test.\n",
"title": "How consistent is my model with the data? Information-Theoretic Model Check"
}
| null | null |
[
"Computer Science",
"Statistics"
] | null | true | null |
15363
| null |
Validated
| null | null |
null |
{
"abstract": " We study a deep linear network expressed under the form of a matrix\nfactorization problem. It takes as input a matrix $X$ obtained by multiplying\n$K$ matrices (called factors and corresponding to the action of a layer). Each\nfactor is obtained by applying a fixed linear operator to a vector of\nparameters satisfying a sparsity constraint. In machine learning, the error\nbetween the product of the estimated factors and $X$ (i.e. the reconstruction\nerror) relates to the statistical risk. The stable recovery of the parameters\ndefining the factors is required in order to interpret the factors and the\nintermediate layers of the network. In this paper, we provide sharp conditions\non the network topology under which the error on the parameters defining the\nfactors (i.e. the stability of the recovered parameters) scales linearly with\nthe reconstruction error (i.e. the risk). Therefore, under these conditions on\nthe network topology, any successful learning tasks leads to robust and\ntherefore interpretable layers. The analysis is based on the recently proposed\nTensorial Lifting. The particularity of this paper is to consider a sparse\nprior. As an illustration, we detail the analysis and provide sharp guarantees\nfor the stable recovery of convolutional linear network under sparsity prior.\nAs expected, the condition are rather strong.\n",
"title": "Stable recovery of deep linear networks under sparsity constraints"
}
| null | null |
[
"Computer Science",
"Mathematics",
"Statistics"
] | null | true | null |
15364
| null |
Validated
| null | null |
null |
{
"abstract": " Reynold's parametricity theory captures the property that parametrically\npolymorphic functions behave uniformly: they produce related results on related\ninstantiations. In dependently-typed programming languages, such relations and\nuniformity proofs can be expressed internally, and generated as a program\ntranslation.\nWe present a new parametricity translation for a significant fragment of Coq.\nPrevious translations of parametrically polymorphic propositions allowed\nnon-uniformity. For example, on related instantiations, a function may return\npropositions that are logically inequivalent (e.g. True and False). We show\nthat uniformity of polymorphic propositions is not achievable in general.\nNevertheless, our translation produces proofs that the two propositions are\nlogically equivalent and also that any two proofs of those propositions are\nrelated. This is achieved at the cost of potentially requiring more assumptions\non the instantiations, requiring them to be isomorphic in the worst case.\nOur translation augments the previous one for Coq by carrying and\ncompositionally building extra proofs about parametricity relations. It is made\neasier by a new method for translating inductive types and pattern matching.\nThe new method builds upon and generalizes previous such translations for\ndependently-typed programming languages.\nUsing reification and reflection, we have implemented our translation as Coq\nprograms. We obtain several stronger free theorems applicable to an ongoing\ncompiler-correctness project. Previously, proofs of some of these theorems took\nseveral hours to finish.\n",
"title": "Revisiting Parametricity: Inductives and Uniformity of Propositions"
}
| null | null | null | null | true | null |
15365
| null |
Default
| null | null |
null |
{
"abstract": " A program schema defines a class of programs, all of which have identical\nstatement structure, but whose functions and predicates may differ. A schema\nthus defines an entire class of programs according to how its symbols are\ninterpreted. A subschema of a schema is obtained from a schema by deleting some\nof its statements. We prove that given a schema $S$ which is predicate-linear,\nfree and liberal, such that the true and false parts of every if predicate\nsatisfy a simple additional condition, and a slicing criterion defined by the\nfinal value of a given variable after execution of any program defined by $S$,\nthe minimal subschema of $S$ which respects this slicing criterion contains all\nthe function and predicate symbols `needed' by the variable according to the\ndata dependence and control dependence relations used in program slicing, which\nis the symbol set given by Weiser's static slicing algorithm. Thus this\nalgorithm gives predicate-minimal slices for classes of programs represented by\nschemas satisfying our set of conditions. We also give an example to show that\nthe corresponding result with respect to the slicing criterion defined by\ntermination behaviour is incorrect. This complements a result by the authors in\nwhich $S$ was required to be function-linear, instead of predicate-linear.\n",
"title": "Characterizing Minimal Semantics-preserving Slices of predicate-linear, Free, Liberal Program Schemas"
}
| null | null | null | null | true | null |
15366
| null |
Default
| null | null |
null |
{
"abstract": " Polarized topics often spark discussion and debate on social media. Recent\nstudies have shown that polarized debates have a specific clustered structure\nin the endorsement net- work, which indicates that users direct their\nendorsements mostly to ideas they already agree with. Understanding these\npolarized discussions and exposing social media users to content that broadens\ntheir views is of paramount importance.\nThe contribution of this demonstration is two-fold. (i) A tool to visualize\nretweet networks about controversial issues on Twitter. By using our\nvisualization, users can understand how polarized discussions are shaped on\nTwitter, and explore the positions of the various actors. (ii) A solution to\nreduce polarization of such discussions. We do so by exposing users to\ninformation which presents a contrarian point of view. Users can visually\ninspect our recommendations and understand why and how these would play out in\nterms of the retweet network.\nOur demo (this https URL homepage)\nprovides one of the first steps in developing automated tools that help users\nexplore, and possibly escape, their echo chambers. The ideas in the demo can\nalso help content providers design tools to broaden their reach to people with\ndifferent political and ideological backgrounds.\n",
"title": "Exposing Twitter Users to Contrarian News"
}
| null | null |
[
"Computer Science"
] | null | true | null |
15367
| null |
Validated
| null | null |
null |
{
"abstract": " We study the problem of cooperative multi-agent reinforcement learning with a\nsingle joint reward signal. This class of learning problems is difficult\nbecause of the often large combined action and observation spaces. In the fully\ncentralized and decentralized approaches, we find the problem of spurious\nrewards and a phenomenon we call the \"lazy agent\" problem, which arises due to\npartial observability. We address these problems by training individual agents\nwith a novel value decomposition network architecture, which learns to\ndecompose the team value function into agent-wise value functions. We perform\nan experimental evaluation across a range of partially-observable multi-agent\ndomains and show that learning such value-decompositions leads to superior\nresults, in particular when combined with weight sharing, role information and\ninformation channels.\n",
"title": "Value-Decomposition Networks For Cooperative Multi-Agent Learning"
}
| null | null | null | null | true | null |
15368
| null |
Default
| null | null |
null |
{
"abstract": " Machine learning is increasingly prevalent in stock market trading. Though\nneural networks have seen success in computer vision and natural language\nprocessing, they have not been as useful in stock market trading. To\ndemonstrate the applicability of a neural network in stock trading, we made a\nsingle-layer neural network that recommends buying or selling shares of a stock\nby comparing the highest high of 10 consecutive days with that of the next 10\ndays, a process repeated for the stock's year-long historical data. A\nchi-squared analysis found that the neural network can accurately and\nappropriately decide whether to buy or sell shares for a given stock, showing\nthat a neural network can make simple decisions about the stock market.\n",
"title": "Application of a Shallow Neural Network to Short-Term Stock Trading"
}
| null | null | null | null | true | null |
15369
| null |
Default
| null | null |
null |
{
"abstract": " Let $\\mathbb Q^{n+1}_c$ be the complete simply-connected $(n+1)$-dimensional\nspace form of curvature $c$. In this paper we obtain a new characterization of\ngeodesic spheres in $\\mathbb Q^{n+1}_c$ in terms of the higher order mean\ncurvatures. In particular, we prove that the geodesic sphere is the only\ncomplete bounded immersed hypersurface in $\\mathbb Q^{n+1}_c,\\;c\\leq 0,$ with\nconstant mean curvature and constant scalar curvature. The proof relies on the\nwell known Omori-Yau maximum principle, a formula of Walter for the Laplacian\nof the $r$-th mean curvature of a hypersurface in a space form, and a classical\ninequality of G\\aa rding for hyperbolic polynomials.\n",
"title": "A characterization of round spheres in space forms"
}
| null | null | null | null | true | null |
15370
| null |
Default
| null | null |
null |
{
"abstract": " Plasticity in zirconium alloys is mainly controlled by the interaction of 1/3\n1210 screw dislocations with oxygen atoms in interstitial octahedral sites of\nthe hexagonal close-packed lattice. This process is studied here using ab\ninitio calculations based on the density functional theory. The atomic\nsimulations show that a strong repulsion exists only when the O atoms lie in\nthe dislocation core and belong to the prismatic dislocation habit plane. This\nis a consequence of the destruction of the octahedral sites by the stacking\nfault arising from the dislocation dissociation. Because of the repulsion, the\ndislocation partially cross-slips to an adjacent prismatic plane, in agreement\nwith experiments where the lattice friction on screw dislocations in Zr-O\nalloys has been attributed to the presence of jogs on the dislocations due to\nlocal cross-slip.\n",
"title": "Oxygen - Dislocation interaction in zirconium from first principles"
}
| null | null | null | null | true | null |
15371
| null |
Default
| null | null |
null |
{
"abstract": " Fourier optics, the principle of using Fourier Transformation to understand\nthe functionalities of optical elements, lies at the heart of modern optics,\nand has been widely applied to optical information processing, imaging,\nholography etc. While a simple thin lens is capable of resolving Fourier\ncomponents of an arbitrary optical wavefront, its operation is limited to near\nnormal light incidence, i.e. the paraxial approximation, which put a severe\nconstraint on the resolvable Fourier domain. As a result, high-order Fourier\ncomponents are lost, resulting in extinction of high-resolution information of\nan image. Here, we experimentally demonstrate a dielectric metasurface\nconsisting of high-aspect-ratio silicon waveguide array, which is capable of\nperforming Fourier transform for a large incident angle range and a broad\noperating bandwidth. Thus our device significantly expands the operational\nFourier space, benefitting from the large numerical aperture (NA), and\nnegligible angular dispersion at large incident angles. Our Fourier metasurface\nwill not only facilitate efficient manipulation of spatial spectrum of\nfree-space optical wavefront, but also be readily integrated into micro-optical\nplatforms due to its compact size.\n",
"title": "Generating Spatial Spectrum with Metasurfaces"
}
| null | null | null | null | true | null |
15372
| null |
Default
| null | null |
null |
{
"abstract": " Density-based clustering relies on the idea of linking groups to some\nspecific features of the probability distribution underlying the data. The\nreference to a true, yet unknown, population structure allows to frame the\nclustering problem in a standard inferential setting, where the concept of\nideal population clustering is defined as the partition induced by the true\ndensity function. The nonparametric formulation of this approach, known as\nmodal clustering, draws a correspondence between the groups and the domains of\nattraction of the density modes. Operationally, a nonparametric density\nestimate is required and a proper selection of the amount of smoothing,\ngoverning the shape of the density and hence possibly the modal structure, is\ncrucial to identify the final partition. In this work, we address the issue of\ndensity estimation for modal clustering from an asymptotic perspective. A\nnatural and easy to interpret metric to measure the distance between\ndensity-based partitions is discussed, its asymptotic approximation explored,\nand employed to study the problem of bandwidth selection for nonparametric\nmodal clustering.\n",
"title": "Modal clustering asymptotics with applications to bandwidth selection"
}
| null | null | null | null | true | null |
15373
| null |
Default
| null | null |
null |
{
"abstract": " This report provides an introduction to some Machine Learning tools within\nthe most common development environments. It mainly focuses on practical\nproblems, skipping any theoretical introduction. It is oriented to both\nstudents trying to approach Machine Learning and experts looking for new\nframeworks.\n",
"title": "Neural Networks for Beginners. A fast implementation in Matlab, Torch, TensorFlow"
}
| null | null | null | null | true | null |
15374
| null |
Default
| null | null |
null |
{
"abstract": " Let us say that an $n$-sided polygon is semi-regular if it is\ncircumscriptible and its angles are all equal but possibly one, which is then\nlarger than the rest. Regular polygons, in particular, are semi-regular. We\nprove that semi-regular polygons are spectrally determined in the class of\nconvex piecewise smooth domains. Specifically, we show that if $\\Omega$ is a\nconvex piecewise smooth planar domain, possibly with straight corners, whose\nDirichlet or Neumann spectrum coincides with that of an $n$-sided semi-regular\npolygon $P_n$, then $\\Omega$ is congruent to $P_n$.\n",
"title": "Spectral determination of semi-regular polygons"
}
| null | null | null | null | true | null |
15375
| null |
Default
| null | null |
null |
{
"abstract": " The class of Cressie-Read empirical likelihoods are constructed with weights\nderived at a minimum distance from the empirical distribution in the\nCressie-Read family of divergences indexed by $\\gamma$ under the constraint of\nan unbiased set of $M$-estimating equations. At first order, they provide valid\nposterior probability statements for any given prior, but the bias in coverage\nof the resulting empirical quantile is inversely proportional to the asymptotic\nefficiency of the corresponding $M$-estimator. The Cressie-Read empirical\nlikelihoods based on the maximum likelihood estimating equations bring about\nquantiles covering with $O(n^{-1})$ accuracy at the underlying posterior\ndistribution. The choice of $\\gamma$ has an impact on the variance in small\nsamples of the posterior quantile function. Examples are given for the $M$-type\nestimating equations of location and for the quasi-likelihood functions in the\ngeneralized linear models.\n",
"title": "Accuracy and validity of posterior distributions using the Cressie-Read empirical likelihoods"
}
| null | null | null | null | true | null |
15376
| null |
Default
| null | null |
null |
{
"abstract": " The aim of this paper is to prove a generalization of the famous Theorem A of\nQuillen for strict $\\infty$-categories. This result is central to the homotopy\ntheory of strict $\\infty$-categories developed by the authors. The proof\npresented here is of a simplicial nature and uses Steiner's theory of augmented\ndirected complexes. In a subsequent paper, we will prove the same result by\npurely $\\infty$-categorical methods.\n",
"title": "A Quillen's Theorem A for strict $\\infty$-categories I: the simplicial proof"
}
| null | null |
[
"Mathematics"
] | null | true | null |
15377
| null |
Validated
| null | null |
null |
{
"abstract": " A set of density functionals coming from different rungs on Jacob's ladder\nare employed to evaluate the electronic excited states of three Ru(II)\ncomplexes. While most studies on the performance of density functionals compare\nthe vertical excitation energies, in this work we focus on the energy gaps\nbetween the electronic excited states, of the same and different multiplicity.\nExcited state energy gaps are important for example to determine radiationless\ntransition probabilities. Besides energies, a functional should deliver the\ncorrect state character and state ordering. Therefore, wavefunction overlaps\nare introduced to systematically evaluate the effect of different functionals\non the character of the excited states. As a reference, the energies and state\ncharacters from multi-state second-order perturbation theory complete active\nspace (MS-CASPT2) are used. In comparison to MS-CASPT2, it is found that while\nhybrid functionals provide better vertical excitation energies, pure\nfunctionals typically give more accurate excited state energy gaps. Pure\nfunctionals are also found to reproduce the state character and ordering in\ncloser agreement to MS-CASPT2 than the hybrid functionals.\n",
"title": "Assessing Excited State Energy Gaps with Time-Dependent Density Functional Theory on Ru(II) Complexes"
}
| null | null | null | null | true | null |
15378
| null |
Default
| null | null |
null |
{
"abstract": " We use a direct numerical integration of the Vlasov equation in spherical\nsymmetry with a background gravitational potential to determine the evolution\nof a collection of particles in different models of a galactic halo. Such a\ncollection is assumed to represent a dark matter inhomogeneity which reaches a\nstationary state determined by the virialization of the system. We describe\nsome features of the stationary states and, by using several halo models,\nobtain distinctive signatures for the evolution of the inhomogeneities in each\nof the models.\n",
"title": "Description of the evolution of inhomogeneities on a Dark Matter halo with the Vlasov equation"
}
| null | null | null | null | true | null |
15379
| null |
Default
| null | null |
null |
{
"abstract": " The efficient simulation of isotropic Gaussian random fields on the unit\nsphere is a task encountered frequently in numerical applications. A fast\nalgorithm based on Markov properties and fast Fourier Transforms in 1d is\npresented that generates samples on an n x n grid in O(n^2 log n). Furthermore,\nan efficient method to set up the necessary conditional covariance matrices is\nderived and simulations demonstrate the performance of the algorithm. An open\nsource implementation of the code has been made available at\nthis https URL .\n",
"title": "Fast generation of isotropic Gaussian random fields on the sphere"
}
| null | null | null | null | true | null |
15380
| null |
Default
| null | null |
null |
{
"abstract": " This paper is concerned with the initial-boundary value problem to 2D\nmagnetohydrodynamics-Boussinesq system with the temperature-dependent\nviscosity, thermal diffusivity and electrical conductivity. First, we establish\nthe global weak solutions under the minimal initial assumption. Then by\nimposing higher regularity assumption on the initial data, we obtain the global\nstrong solution with uniqueness. Moreover, the exponential decay estimate of\nthe solution is obtained.\n",
"title": "Initial-boundary value problem to 2D Boussinesq equations for MHD convection with stratification effects"
}
| null | null |
[
"Mathematics"
] | null | true | null |
15381
| null |
Validated
| null | null |
null |
{
"abstract": " We examine the velocity profile of coherent vortices appearing as a\nconsequence of the inverse cascade of two-dimensional turbulence in a finite\nbox in the case of static pumping. We demonstrate that in the passive regime\nthe flat velocity profile is realized, as in the case of pumping short\ncorrelated in time. However, in the static case the energy flux to large scales\nis dependent on the system parameters. We demonstrate that it is proportional\nto $f^{4/3}$ where $f$ is the characteristic force exciting turbulence.\n",
"title": "Profile of a coherent vortex in two-dimensional turbulence at static pumping"
}
| null | null |
[
"Physics"
] | null | true | null |
15382
| null |
Validated
| null | null |
null |
{
"abstract": " Estimating the human longevity and computing of life expectancy are central\nto the population dynamics. These aspects were studied seriously by scientists\nsince fifteenth century, including renowned astronomer Edmund Halley. From\nbasic principles of population dynamics, we propose a method to compute life\nexpectancy from incomplete data.\n",
"title": "Computation of life expectancy from incomplete data"
}
| null | null | null | null | true | null |
15383
| null |
Default
| null | null |
null |
{
"abstract": " Deep learning has given way to a new era of machine learning, apart from\ncomputer vision. Convolutional neural networks have been implemented in image\nclassification, segmentation and object detection. Despite recent advancements,\nwe are still in the very early stages and have yet to settle on best practices\nfor network architecture in terms of deep design, small in size and a short\ntraining time. In this work, we propose a very deep neural network comprised of\n16 Convolutional layers compressed with the Fire Module adapted from the\nSQUEEZENET model. We also call for the addition of residual connections to help\nsuppress degradation. This model can be implemented on almost every neural\nnetwork model with fully incorporated residual learning. This proposed model\nResidual-Squeeze-VGG16 (ResSquVGG16) trained on the large-scale MIT\nPlaces365-Standard scene dataset. In our tests, the model performed with\naccuracy similar to the pre-trained VGG16 model in Top-1 and Top-5 validation\naccuracy while also enjoying a 23.86% reduction in training time and an 88.4%\nreduction in size. In our tests, this model was trained from scratch.\n",
"title": "Residual Squeeze VGG16"
}
| null | null | null | null | true | null |
15384
| null |
Default
| null | null |
null |
{
"abstract": " $\\frac{3}{2}$-institutions have been introduced as an extension of\ninstitution theory that accommodates implicitly partiality of the signature\nmorphisms together with its syntactic and semantic effects. In this paper we\nshow that ordinary institutions that are equipped with an inclusion system for\ntheir categories of signatures generate naturally $\\frac{3}{2}$ -institutions\nwith explicit partiality for their signature morphisms. This provides a general\nuniform way to build 3 -institutions for the foundations of conceptual blending\nand software evolution. Moreover our general construction allows for an uniform\nderivation of some useful technical properties.\n",
"title": "Generic partiality for $\\frac{3}{2}$-institutions"
}
| null | null | null | null | true | null |
15385
| null |
Default
| null | null |
null |
{
"abstract": " It has been postulated that a good representation is one that disentangles\nthe underlying explanatory factors of variation. However, it remains an open\nquestion what kind of training framework could potentially achieve that.\nWhereas most previous work focuses on the static setting (e.g., with images),\nwe postulate that some of the causal factors could be discovered if the learner\nis allowed to interact with its environment. The agent can experiment with\ndifferent actions and observe their effects. More specifically, we hypothesize\nthat some of these factors correspond to aspects of the environment which are\nindependently controllable, i.e., that there exists a policy and a learnable\nfeature for each such aspect of the environment, such that this policy can\nyield changes in that feature with minimal changes to other features that\nexplain the statistical variations in the observed data. We propose a specific\nobjective function to find such factors and verify experimentally that it can\nindeed disentangle independently controllable aspects of the environment\nwithout any extrinsic reward signal.\n",
"title": "Independently Controllable Factors"
}
| null | null | null | null | true | null |
15386
| null |
Default
| null | null |
null |
{
"abstract": " A boundary value problem, which could represent a transcendent temperature\nconduction problem with evaporation in a part of the boundary, was studied to\ndetermine unknown thermophysical parameters, which can be constants or time\ndependent functions. The goal of this paper was elucidate which parameters may\nbe determined using only the measured superficial temperature in part of the\nboundary of the domain. We formulated a nonlinear inverse problem to determine\nthe unknown parameters and a sensitivity analysis was also performed. In\nparticular, we introduced a new way of computing a sensitivity analysis of a\nparameter which is variable in time. We applied the proposed method to model\ntissue temperature changes under transient conditions in a biological problem:\nthe hamster cheek pouch. In this case, the time dependent unknown parameter can\nbe associated to the loss of heat due to water evaporation at the superficial\nlayer of the pouch. Finally, we performed the sensitivity analysis to determine\nthe most sensible parameters to variations of the superficial experimental data\nin the hamster cheek pouch.\n",
"title": "Determination and biological application of a time dependent thermal parameter and sensitivity analysis for a conduction problem with superficial evaporation"
}
| null | null |
[
"Physics"
] | null | true | null |
15387
| null |
Validated
| null | null |
null |
{
"abstract": " When a d-dimensional quantum system is subjected to a periodic drive, it may\nbe treated as a (d+1)-dimensional system, where the extra dimension is a\nsynthetic one. In this work, we take these ideas to the next level by showing\nthat non-uniform potentials, and particularly edges, in the synthetic dimension\nare created whenever the dynamics of system has a memory component. We\ndemonstrate that topological states appear on the edges of these synthetic\ndimensions and can be used as a basis for a wave packet construction. Such\nsystems may act as an optical isolator which allows transmission of light in a\ndirectional way. We supplement our ideas by an example of a physical system\nthat shows this type of physics.\n",
"title": "Setting Boundaries with Memory: Generation of Topological Boundary States in Floquet-Induced Synthetic Crystals"
}
| null | null | null | null | true | null |
15388
| null |
Default
| null | null |
null |
{
"abstract": " The data torrent unleashed by current and upcoming astronomical surveys\ndemands scalable analysis methods. Many machine learning approaches scale well,\nbut separating the instrument measurement from the physical effects of\ninterest, dealing with variable errors, and deriving parameter uncertainties is\noften an after-thought. Classic forward-folding analyses with Markov Chain\nMonte Carlo or Nested Sampling enable parameter estimation and model\ncomparison, even for complex and slow-to-evaluate physical models. However,\nthese approaches require independent runs for each data set, implying an\nunfeasible number of model evaluations in the Big Data regime. Here I present a\nnew algorithm, collaborative nested sampling, for deriving parameter\nprobability distributions for each observation. Importantly, the number of\nphysical model evaluations scales sub-linearly with the number of data sets,\nand no assumptions about homogeneous errors, Gaussianity, the form of the model\nor heterogeneity/completeness of the observations need to be made.\nCollaborative nested sampling has immediate application in speeding up analyses\nof large surveys, integral-field-unit observations, and Monte Carlo\nsimulations.\n",
"title": "Collaborative Nested Sampling: Big Data vs. complex physical models"
}
| null | null |
[
"Physics",
"Statistics"
] | null | true | null |
15389
| null |
Validated
| null | null |
null |
{
"abstract": " The ancient phrase, \"All roads lead to Rome\" applies to Chemistry and\nPhysics. Both are highly evolved sciences, with their own history, traditions,\nlanguage, and approaches to problems. Despite all these differences, these two\nroads generally lead to the same place. For high temperature cuprate\nsuperconductors however, the Chemistry and Physics roads do not meet or even\ncome close to each other. In this paper, we analyze the physics and chemistry\napproaches to the doped electronic structure of cuprates and find the chemistry\ndoped hole (out-of-the-CuO$\\mathrm{_2}$-planes) leads to explanations of a vast\narray of normal state cuprate phenomenology using simple counting arguments.\nThe chemistry picture suggests that phonons are responsible for\nsuperconductivity in cuprates. We identify the important phonon modes, and show\nthat the observed T$\\mathrm{_c} \\sim 100$ K, the T$\\mathrm{_c}$-dome as a\nfunction of hole doping, the change in T$\\mathrm{_c}$ as a function of the\nnumber of CuO$\\mathrm{_2}$ layers per unit cell, the lack of an isotope effect\nat optimal T$\\mathrm{_c}$ doping, and the D-wave symmetry of the\nsuperconducting Cooper pair wavefunction are all explained by the chemistry\npicture. Finally, we show that \"crowding\" the dopants in cuprates leads to a\npair wavefunction with S-wave symmetry and T$\\mathrm{_c}\\approx280-390$ K.\nHence, we believe there is enormous \"latent\" T$\\mathrm{_c}$ remaining in the\ncuprate class of superconductors.\n",
"title": "Latent Room-Temperature T$_c$ in Cuprate Superconductors"
}
| null | null | null | null | true | null |
15390
| null |
Default
| null | null |
null |
{
"abstract": " In this paper we study an anisotropic variant of the Rudin-Osher-Fatemi\nfunctional with $L^1$ fidelity term of the form \\[ E(u) = \\int_{\\mathbb{R}^n}\n\\phi(\\nabla u) + \\lambda \\| u -f \\|_{L^1(\\mathbb{R}^n)}. \\] We will\ncharacterize the minimizers of $E$ in terms of the Wulff shape of $\\phi$ and\nthe dual anisotropy. In particular we will calculate the subdifferential of\n$E$. We will apply this characterization to the special case $\\phi = |\\cdot|_1$\nand $n=2$, which has been used in the denoising of 2D bar codes. In this case,\nwe determine the shape of a minimizer $u$ when $f$ is the characteristic\nfunction of a circle.\n",
"title": "Characterization of minimizers of an anisotropic variant of the Rudin-Osher-Fatemi functional with $L^1$ fidelity term"
}
| null | null | null | null | true | null |
15391
| null |
Default
| null | null |
null |
{
"abstract": " In this paper we first study partial regularity of weak solutions to the\ninitial boundary value problem for the system\n$-\\mbox{div}\\left[(I+\\mathbf{m}\\otimes \\mathbf{m})\\nabla p\\right]=S(x),\\ \\\n\\partial_t\\mathbf{m}-D^2\\Delta \\mathbf{m}-E^2(\\mathbf{m}\\cdot\\nabla p)\\nabla\np+|\\mathbf{m}|^{2(\\gamma-1)}\\mathbf{m}=0$, where $S(x)$ is a given function and\n$D, E, \\gamma$ are given numbers. This problem has been proposed as a PDE model\nfor biological transportation networks. Mathematically, it seems to have a\nconnection to a conjecture by De Giorgi \\cite{DE}. Then we investigate the\nlife-span of classical solutions. Our results show that local existence of a\nclassical solution can always be obtained and the life-span of such a solution\ncan be extended as far away as one wishes as long as the term $\\|{\\bf\nm}(x,0)\\|_{\\infty, \\Omega}+\\|S(x)\\|_{\\frac{2N}{3}, \\Omega}$ is made suitably\nsmall, where $N$ is the space dimension and $\\|\\cdot\\|_{q,\\Omega}$ denotes the\nnorm in $L^q(\\Omega)$.\n",
"title": "Partial regularity of weak solutions and life-span of smooth solutions to a biological network formulation model"
}
| null | null |
[
"Mathematics"
] | null | true | null |
15392
| null |
Validated
| null | null |
null |
{
"abstract": " This paper studies an optimal control problem for a string of vehicles with\nsafety requirements and finite-time specifications on the approach time to a\ntarget region. Our problem formulation is motivated by scenarios involving\nautonomous vehicles circulating on arterial roads with intelligent management\nat traffic intersections. We propose a provably correct distributed control\nalgorithm that ensures that the vehicles satisfy the finite-time specifications\nunder speed limits, acceleration saturation, and safety requirements. The\nsafety specifications are such that collisions can be avoided even in cases of\ncommunication failure. We also discuss how the proposed distributed algorithm\ncan be integrated with an intelligent intersection manager to provide\ninformation about the feasible approach times of the vehicle string and a\nguaranteed bound of its time of occupancy of the intersection. Our simulation\nstudy illustrates the algorithm and its properties regarding approach time,\noccupancy time, and fuel and time cost.\n",
"title": "Distributed control of vehicle strings under finite-time and safety specifications"
}
| null | null | null | null | true | null |
15393
| null |
Default
| null | null |
null |
{
"abstract": " Kernel-based methods exhibit well-documented performance in various nonlinear\nlearning tasks. Most of them rely on a preselected kernel, whose prudent choice\npresumes task-specific prior information. Especially when the latter is not\navailable, multi-kernel learning has gained popularity thanks to its\nflexibility in choosing kernels from a prescribed kernel dictionary. Leveraging\nthe random feature approximation and its recent orthogonality-promoting\nvariant, the present contribution develops a scalable multi-kernel learning\nscheme (termed Raker) to obtain the sought nonlinear learning function `on the\nfly,' first for static environments. To further boost performance in dynamic\nenvironments, an adaptive multi-kernel learning scheme (termed AdaRaker) is\ndeveloped. AdaRaker accounts not only for data-driven learning of kernel\ncombination, but also for the unknown dynamics. Performance is analyzed in\nterms of both static and dynamic regrets. AdaRaker is uniquely capable of\ntracking nonlinear learning functions in environments with unknown dynamics,\nand with with analytic performance guarantees. Tests with synthetic and real\ndatasets are carried out to showcase the effectiveness of the novel algorithms.\n",
"title": "Random Feature-based Online Multi-kernel Learning in Environments with Unknown Dynamics"
}
| null | null | null | null | true | null |
15394
| null |
Default
| null | null |
null |
{
"abstract": " Deep neural networks have gained tremendous popularity in last few years.\nThey have been applied for the task of classification in almost every domain.\nDespite the success, deep networks can be incredibly slow to train for even\nmoderate sized models on sufficiently large datasets. Additionally, these\nnetworks require large amounts of data to be able to generalize. The importance\nof speeding up convergence, and generalization in deep networks can not be\noverstated. In this work, we develop an optimization algorithm based on\ngeneralized-optimal updates derived from minibatches that lead to faster\nconvergence. Towards the end, we demonstrate on two benchmark datasets that the\nproposed method achieves two orders of magnitude speed up over traditional\nback-propagation, and is more robust to noise/over-fitting.\n",
"title": "Faster Convergence & Generalization in DNNs"
}
| null | null | null | null | true | null |
15395
| null |
Default
| null | null |
null |
{
"abstract": " In this paper we construct some regular sequences which arise naturally from\ndeterminantal conditions.\n",
"title": "Regular Sequences from Determinantal Conditions"
}
| null | null | null | null | true | null |
15396
| null |
Default
| null | null |
null |
{
"abstract": " We perform Zeeman spectroscopy on a Rydberg electromagnetically induced\ntransparency (EIT) system in a room-temperature Cs vapor cell, in magnetic\nfields up to 50~Gauss and for several polarization configurations. The magnetic\ninteractions of the $\\vert 6S_{1/2}, F_g=4 \\rangle$ ground, $\\vert 6P_{3/2},\nF_e=5 \\rangle$ intermediate, and $\\vert 33S_{1/2} \\rangle$ Rydberg states that\nform the ladder-type EIT system are in the linear Zeeman, quadratic Zeeman, and\nthe deep hyperfine Paschen-Back regimes, respectively. Starting in magnetic\nfields of about 5~Gauss, the spectra develop an asymmetry that becomes\nparamount in fields $\\gtrsim40$~Gauss. We use a quantum Monte Carlo\nwave-function approach to quantitatively model the spectra. Simulated spectra\nare in good agreement with experimental data. The asymmetry in the spectra is,\nin part, due to level shifts caused by the quadratic Zeeman effect, but it also\nreflects the complicated interplay between optical pumping and EIT in the\nmagnetic field. Relevance to measurement applications is discussed. %The\nsimulations are also used to study optical pumping in the magnetic field and to\ninvestigate the interplay between optical pumping and EIT, which reduces photon\nscattering and optical pumping.\n",
"title": "Nonlinear Zeeman effect, line shapes and optical pumping in electromagnetically induced transparency"
}
| null | null | null | null | true | null |
15397
| null |
Default
| null | null |
null |
{
"abstract": " We propose a principled method for gradient-based regularization of the\ncritic of GAN-like models trained by adversarially optimizing the kernel of a\nMaximum Mean Discrepancy (MMD). We show that controlling the gradient of the\ncritic is vital to having a sensible loss function, and devise a method to\nenforce exact, analytical gradient constraints at no additional cost compared\nto existing approximate techniques based on additive regularizers. The new loss\nfunction is provably continuous, and experiments show that it stabilizes and\naccelerates training, giving image generation models that outperform\nstate-of-the art methods on $160 \\times 160$ CelebA and $64 \\times 64$\nunconditional ImageNet.\n",
"title": "On gradient regularizers for MMD GANs"
}
| null | null | null | null | true | null |
15398
| null |
Default
| null | null |
null |
{
"abstract": " Larger and deeper neural network architectures deliver improved accuracy on a\nvariety of tasks, but also require a large amount of memory for training to\nstore intermediate activations for back-propagation. We introduce an\napproximation strategy to significantly reduce this memory footprint, with\nminimal effect on training performance and negligible computational cost. Our\nmethod replaces intermediate activations with lower-precision approximations to\nfree up memory, after the full-precision versions have been used for\ncomputation in subsequent layers in the forward pass. Only these approximate\nactivations are retained for use in the backward pass. Compared to naive\nlow-precision computation, our approach limits the accumulation of errors\nacross layers and allows the use of much lower-precision approximations without\naffecting training accuracy. Experiments on CIFAR and ImageNet show that our\nmethod yields performance comparable to full-precision training, while storing\nactivations at a fraction of the memory cost with 8- and even 4-bit fixed-point\nprecision.\n",
"title": "Backprop with Approximate Activations for Memory-efficient Network Training"
}
| null | null |
[
"Computer Science",
"Statistics"
] | null | true | null |
15399
| null |
Validated
| null | null |
null |
{
"abstract": " This paper describes the experience of preparing and testing the SPARUS II\nAUV in different applications. The AUV was designed as a lightweight vehicle\ncombining the classical torpedo-shape features with the hovering capability.\nThe robot has a payload area to allow the integration of different equipment\ndepending on the application. The software architecture is based on ROS, an\nopen framework that allows an easy integration of many devices and systems. Its\nflexibility, easy operation and openness makes the SPARUS II AUV a multipurpose\nplatform that can adapt to industrial, scientific and academic applications.\nFive units were developed in 2014, and different teams used and adapted the\nplatform for different applications. The paper describes some of the\nexperiences in preparing and testing this open platform to different\napplications.\n",
"title": "Testing SPARUS II AUV, an open platform for industrial, scientific and academic applications"
}
| null | null | null | null | true | null |
15400
| null |
Default
| null | null |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.