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": " Augmenting a neural network with memory that can grow without growing the\nnumber of trained parameters is a recent powerful concept with many exciting\napplications. We propose a design of memory augmented neural networks (MANNs)\ncalled Labeled Memory Networks (LMNs) suited for tasks requiring online\nadaptation in classification models. LMNs organize the memory with classes as\nthe primary key.The memory acts as a second boosted stage following a regular\nneural network thereby allowing the memory and the primary network to play\ncomplementary roles. Unlike existing MANNs that write to memory for every\ninstance and use LRU based memory replacement, LMNs write only for instances\nwith non-zero loss and use label-based memory replacement. We demonstrate\nsignificant accuracy gains on various tasks including word-modelling and\nfew-shot learning. In this paper, we establish their potential in online\nadapting a batch trained neural network to domain-relevant labeled data at\ndeployment time. We show that LMNs are better than other MANNs designed for\nmeta-learning. We also found them to be more accurate and faster than\nstate-of-the-art methods of retuning model parameters for adapting to\ndomain-specific labeled data.\n",
"title": "Labeled Memory Networks for Online Model Adaptation"
}
| null | null |
[
"Computer Science",
"Statistics"
] | null | true | null |
14401
| null |
Validated
| null | null |
null |
{
"abstract": " We develop a Liouville perturbation theory for weakly driven and weakly open\nquantum systems in situations when the unperturbed system has a number of\nconservations laws. If the perturbation violates the conservation laws, it\ndrives the system to a new steady state which can be approximately but\nefficiently described by a (generalized) Gibbs ensemble characterized by one\nLagrange parameter for each conservation law. The value of those has to be\ndetermined from rate equations for conserved quantities. Remarkably, even weak\nperturbations can lead to large responses of conserved quantities. We present a\nperturbative expansion of the steady state density matrix; first we give the\ncondition that fixes the zeroth order expression (Lagrange parameters) and then\ndetermine the higher order corrections via projections of the Liouvillian. The\nformalism can be applied to a wide range of problems including two-temperature\nmodels for electron-phonon systems, Bose condensates of excitons or photons or\nweakly perturbed integrable models. We test our formalism by studying\ninteracting fermions coupled to non-thermal reservoirs, approximately described\nby a Boltzmann equation.\n",
"title": "Perturbative approach to weakly driven many-particle systems in the presence of approximate conservation laws"
}
| null | null |
[
"Physics"
] | null | true | null |
14402
| null |
Validated
| null | null |
null |
{
"abstract": " To solve deep metric learning problems and producing feature embeddings,\ncurrent methodologies will commonly use a triplet model to minimise the\nrelative distance between samples from the same class and maximise the relative\ndistance between samples from different classes. Though successful, the\ntraining convergence of this triplet model can be compromised by the fact that\nthe vast majority of the training samples will produce gradients with\nmagnitudes that are close to zero. This issue has motivated the development of\nmethods that explore the global structure of the embedding and other methods\nthat explore hard negative/positive mining. The effectiveness of such mining\nmethods is often associated with intractable computational requirements. In\nthis paper, we propose a novel deep metric learning method that combines the\ntriplet model and the global structure of the embedding space. We rely on a\nsmart mining procedure that produces effective training samples for a low\ncomputational cost. In addition, we propose an adaptive controller that\nautomatically adjusts the smart mining hyper-parameters and speeds up the\nconvergence of the training process. We show empirically that our proposed\nmethod allows for fast and more accurate training of triplet ConvNets than\nother competing mining methods. Additionally, we show that our method achieves\nnew state-of-the-art embedding results for CUB-200-2011 and Cars196 datasets.\n",
"title": "Smart Mining for Deep Metric Learning"
}
| null | null | null | null | true | null |
14403
| null |
Default
| null | null |
null |
{
"abstract": " We consider a class of one-dimensional compass models with staggered\nDzyaloshinskii-Moriya exchange interactions in an external transverse magnetic\nfield. Based on the exact solution derived from Jordan-Wigner approach, we\nstudy the excitation gap, energy spectra, spin correlations and critical\nproperties at phase transitions. We explore mutual effects of the staggered\nDzyaloshinskii-Moriya interaction and the magnetic field on the energy spectra\nand the ground-state phase diagram. Thermodynamic quantities including the\nentropy and the specific heat are discussed, and their universal scalings at\nlow temperature are demonstrated.\n",
"title": "Quantum phase transitions of a generalized compass chain with staggered Dzyaloshinskii-Moriya interaction"
}
| null | null |
[
"Physics"
] | null | true | null |
14404
| null |
Validated
| null | null |
null |
{
"abstract": " It is shown that the Orlik-Terao algebra is graded isomorphic to the special\nfiber of the ideal $I$ generated by the $(n-1)$-fold products of the members of\na central arrangement of size $n$. This momentum is carried over to the Rees\nalgebra (blowup) of $I$ and it is shown that this algebra is of fiber-type and\nCohen-Macaulay. It follows by a result of Simis-Vasconcelos that the special\nfiber of $I$ is Cohen-Macaulay, thus giving another proof of a result of\nProudfoot-Speyer about the Cohen-Macauleyness of the Orlik-Terao algebra.\n",
"title": "A blowup algebra of hyperplane arrangements"
}
| null | null |
[
"Mathematics"
] | null | true | null |
14405
| null |
Validated
| null | null |
null |
{
"abstract": " We investigate a principle way to progressively mine discriminative object\nregions using classification networks to address the weakly-supervised semantic\nsegmentation problems. Classification networks are only responsive to small and\nsparse discriminative regions from the object of interest, which deviates from\nthe requirement of the segmentation task that needs to localize dense, interior\nand integral regions for pixel-wise inference. To mitigate this gap, we propose\na new adversarial erasing approach for localizing and expanding object regions\nprogressively. Starting with a single small object region, our proposed\napproach drives the classification network to sequentially discover new and\ncomplement object regions by erasing the current mined regions in an\nadversarial manner. These localized regions eventually constitute a dense and\ncomplete object region for learning semantic segmentation. To further enhance\nthe quality of the discovered regions by adversarial erasing, an online\nprohibitive segmentation learning approach is developed to collaborate with\nadversarial erasing by providing auxiliary segmentation supervision modulated\nby the more reliable classification scores. Despite its apparent simplicity,\nthe proposed approach achieves 55.0% and 55.7% mean Intersection-over-Union\n(mIoU) scores on PASCAL VOC 2012 val and test sets, which are the new\nstate-of-the-arts.\n",
"title": "Object Region Mining with Adversarial Erasing: A Simple Classification to Semantic Segmentation Approach"
}
| null | null | null | null | true | null |
14406
| null |
Default
| null | null |
null |
{
"abstract": " In this paper, we address the problem of learning compact\nsimilarity-preserving embeddings for massive high-dimensional streams of data\nin order to perform efficient similarity search. We present a new online method\nfor computing binary compressed representations -sketches- of high-dimensional\nreal feature vectors. Given an expected code length $c$ and high-dimensional\ninput data points, our algorithm provides a $c$-bits binary code for preserving\nthe distance between the points from the original high-dimensional space. Our\nalgorithm does not require neither the storage of the whole dataset nor a\nchunk, thus it is fully adaptable to the streaming setting. It also provides\nlow time complexity and convergence guarantees. We demonstrate the quality of\nour binary sketches through experiments on real data for the nearest neighbors\nsearch task in the online setting.\n",
"title": "Streaming Binary Sketching based on Subspace Tracking and Diagonal Uniformization"
}
| null | null | null | null | true | null |
14407
| null |
Default
| null | null |
null |
{
"abstract": " A novel capsule target design to improve the hot-spot pressure in the\nhigh-adiabat implosion for inertial confinement fusion is proposed, where a\nlayer of comparatively high-density material is used as a pusher between the\nfuel and the ablator. This design is based on our theoretical finding of the\nstagnation scaling laws, which indicates that the hot spot pressure can be\nimproved by increasing the kinetic energy density $\\rho_d V_{imp}^2/2$\n($\\rho_d$ is the shell density when the maximum shell velocity is reached,\n$V_{imp}$ is the implosion velocity.) of the shell. The proposed design uses\nthe high density pusher to enhance the shell density $\\rho_d$ so that the hot\nspot pressure is improved. Radio-hydrodynamic simulations show that the hot\nspot pressure of the design reaches the requirement for ignition even driven by\na very high-adiabat short-duration two-shock pulse. The design is hopeful to\nsimultaneously overcome the two major obstacles to achieving ignition--ablative\ninstability and laser-plasma instability.\n",
"title": "Improving hot-spot pressure for ignition in high-adiabat Inertial Confinement Fusion implosion"
}
| null | null | null | null | true | null |
14408
| null |
Default
| null | null |
null |
{
"abstract": " When a single cell senses a chemical gradient and chemotaxes, stochastic\nreceptor-ligand binding can be a fundamental limit to the cell's accuracy. For\nclusters of cells responding to gradients, however, there is a critical\ndifference: even genetically identical cells have differing responses to\nchemical signals. With theory and simulation, we show collective chemotaxis is\nlimited by cell-to-cell variation in signaling. We find that when different\ncells cooperate the resulting bias can be much larger than the effects of\nligand-receptor binding. Specifically, when a strongly-responding cell is at\none end of a cell cluster, cluster motion is biased toward that cell. These\nerrors are mitigated if clusters average measurements over times long enough\nfor cells to rearrange. In consequence, fluid clusters are better able to sense\ngradients: we derive a link between cluster accuracy, cell-to-cell variation,\nand the cluster rheology. Because of this connection, increasing the noisiness\nof individual cell motion can actually increase the collective accuracy of a\ncluster by improving fluidity.\n",
"title": "Cell-to-cell variation sets a tissue-rheology-dependent bound on collective gradient sensing"
}
| null | null | null | null | true | null |
14409
| null |
Default
| null | null |
null |
{
"abstract": " Formal models of games help us account for and predict behavior, leading to\nmore robust and innovative designs. While the games research community has\nproposed many formalisms for both the \"game half\" (game models, game\ndescription languages) and the \"human half\" (player modeling) of a game\nexperience, little attention has been paid to the interface between the two,\nparticularly where it concerns the player expressing her intent toward the\ngame. We describe an analytical and computational toolbox based on programming\nlanguage theory to examine the phenomenon sitting between control schemes and\ngame rules, which we identify as a distinct player intent language for each\ngame.\n",
"title": "Languages of Play: Towards semantic foundations for game interfaces"
}
| null | null |
[
"Computer Science"
] | null | true | null |
14410
| null |
Validated
| null | null |
null |
{
"abstract": " In hybrid normed ideal perturbations of $n$-tuples of operators, the normed\nideal is allowed to vary with the component operators. We begin extending to\nthis setting the machinery we developed for normed ideal perturbations based on\nthe modulus of quasicentral approximation and an adaptation of our\nnon-commutative generalization of the Weyl--von~Neumann theorem. For commuting\n$n$-tuples of hermitian operators, the modulus of quasicentral approximation\nremains essentially the same when $\\cC_n^-$ is replaced by a hybrid $n$-tuple\n$\\cC_{p_1,\\dots}^-,\\dots,\\cC^-_{p_n}$, $p_1^{-1} + \\dots + p_n^{-1} = 1$. The\nproof involves singular integrals of mixed homogeneity.\n",
"title": "Hybrid Normed Ideal Perturbations of n-tuples of Operators I"
}
| null | null | null | null | true | null |
14411
| null |
Default
| null | null |
null |
{
"abstract": " This paper is concerned with radially symmetric solutions of systems of the\nform \\[ u_t = -\\nabla V(u) + \\Delta_x u \\] where space variable $x$ and and\nstate-parameter $u$ are multidimensional, and the potential $V$ is coercive at\ninfinity. For such systems, under generic assumptions on the potential, the\nasymptotic behaviour of solutions \"stable at infinity\", that is approaching a\nspatially homogeneous equilibrium when $|x|$ approaches $+\\infty$, is\ninvestigated. It is proved that every such solutions approaches a stacked\nfamily of radially symmetric bistable fronts travelling to infinity. This\nbehaviour is similar to the one of bistable solutions for gradient systems in\none unbounded spatial dimension, described in a companion paper. It is expected\n(but unfortunately not proved at this stage) that behind these travelling\nfronts the solution again behaves as in the one-dimensional case (that is, the\ntime derivative approaches zero and the solution approaches a pattern of\nstationary solutions).\n",
"title": "Global behaviour of radially symmetric solutions stable at infinity for gradient systems"
}
| null | null |
[
"Mathematics"
] | null | true | null |
14412
| null |
Validated
| null | null |
null |
{
"abstract": " Let $G$ be a simple and finite graph without isolated vertices. In this paper\nwe study forcing sets (zero forcing sets) which induce a subgraph of $G$\nwithout isolated vertices. Such a set is called a total forcing set, introduced\nand first studied by Davila \\cite{Davila}. The minimum cardinality of a total\nforcing set in $G$ is the total forcing number of $G$, denoted $F_t(G)$. We\nstudy basic properties of $F_t(G)$, relate $F_t(G)$ to various domination\nparameters, and establish $NP$-completeness of the associated decision problem\nfor $F_t(G)$. We also prove that if $G$ is a connected graph of order $n \\ge 3$\nand maximum degree $\\Delta$, then $F_t(G) \\le ( \\frac{\\Delta}{\\Delta +1} ) n$,\nwith equality if and only if $G$ is a complete graph $K_{\\Delta + 1}$.\n",
"title": "On the Total Forcing Number of a Graph"
}
| null | null |
[
"Mathematics"
] | null | true | null |
14413
| null |
Validated
| null | null |
null |
{
"abstract": " I make some basic observations about hard takeoff, value alignment, and\ncoherent extrapolated volition, concepts which have been central in analyses of\nsuperintelligent AI systems.\n",
"title": "Brief Notes on Hard Takeoff, Value Alignment, and Coherent Extrapolated Volition"
}
| null | null | null | null | true | null |
14414
| null |
Default
| null | null |
null |
{
"abstract": " DNA Methylation has been the most extensively studied epigenetic mark.\nUsually a change in the genotype, DNA sequence, leads to a change in the\nphenotype, observable characteristics of the individual. But DNA methylation,\nwhich happens in the context of CpG (cytosine and guanine bases linked by\nphosphate backbone) dinucleotides, does not lead to a change in the original\nDNA sequence but has the potential to change the phenotype. DNA methylation is\nimplicated in various biological processes and diseases including cancer. Hence\nthere is a strong interest in understanding the DNA methylation patterns across\nvarious epigenetic related ailments in order to distinguish and diagnose the\ntype of disease in its early stages. In this work, the relationship between\nmethylated versus unmethylated CpG regions and cancer types is explored using\nConvolutional Neural Networks (CNNs). A CNN based Deep Learning model that can\nclassify the cancer of a new DNA methylation profile based on the learning from\npublicly available DNA methylation datasets is then proposed.\n",
"title": "Convolutional Neural Networks In Classifying Cancer Through DNA Methylation"
}
| null | null |
[
"Statistics",
"Quantitative Biology"
] | null | true | null |
14415
| null |
Validated
| null | null |
null |
{
"abstract": " We consider the problem of planning a closed walk $\\mathcal W$ for a UAV to\npersistently monitor a finite number of stationary targets with equal\npriorities and dynamically changing properties. A UAV must physically visit the\ntargets in order to monitor them and collect information therein. The frequency\nof monitoring any given target is specified by a target revisit time, $i.e.$,\nthe maximum allowable time between any two successive visits to the target. The\nproblem considered in this paper is the following: Given $n$ targets and $k\n\\geq n$ allowed visits to them, find an optimal closed walk $\\mathcal W^*(k)$\nso that every target is visited at least once and the maximum revisit time over\nall the targets, $\\mathcal R(\\mathcal W(k))$, is minimized. We prove the\nfollowing: If $k \\geq n^2-n$, $\\mathcal R(\\mathcal W^*(k))$ (or simply,\n$\\mathcal R^*(k)$) takes only two values: $\\mathcal R^*(n)$ when $k$ is an\nintegral multiple of $n$, and $\\mathcal R^*(n+1)$ otherwise. This result\nsuggests significant computational savings - one only needs to determine\n$\\mathcal W^*(n)$ and $\\mathcal W^*(n+1)$ to construct an optimal solution\n$\\mathcal W^*(k)$. We provide MILP formulations for computing $\\mathcal W^*(n)$\nand $\\mathcal W^*(n+1)$. Furthermore, for {\\it any} given $k$, we prove that\n$\\mathcal R^*(k) \\geq \\mathcal R^*(k+n)$.\n",
"title": "Persistent Monitoring of Dynamically Changing Environments Using an Unmanned Vehicle"
}
| null | null |
[
"Computer Science"
] | null | true | null |
14416
| null |
Validated
| null | null |
null |
{
"abstract": " We study decay of small solutions of the Born-Infeld equation in 1+1\ndimensions, a quasilinear scalar field equation modeling nonlinear\nelectromagnetism, as well as branes in String theory and minimal surfaces in\nMinkowski space-times. From the work of Whitham, it is well-known that there is\nno decay because of arbitrary solutions traveling to the speed of light just as\nlinear wave equation. However, even if there is no global decay in 1+1\ndimensions, we are able to show that all globally small $H^{s+1}\\times H^s$,\n$s>\\frac12$ solutions do decay to the zero background state in space, inside a\nstrictly proper subset of the light cone. We prove this result by constructing\na Virial identity related to a momentum law, in the spirit of works\n\\cite{KMM,KMM1}, as well as a Lyapunov functional that controls the $\\dot H^1\n\\times L^2$ energy.\n",
"title": "Almost sharp nonlinear scattering in one-dimensional Born-Infeld equations arising in nonlinear Electrodynamics"
}
| null | null | null | null | true | null |
14417
| null |
Default
| null | null |
null |
{
"abstract": " There does not exist a general positive correlation between important\nlife-supporting properties and the entropy production rate. The simple reason\nis that nondissipative and time-symmetric kinetic aspects are also relevant for\nestablishing optimal functioning. In fact those aspects are even crucial in the\nnonlinear regimes around equilibrium where we find biological processing on\nmesoscopic scales. We make these claims specific via examples of molecular\nmotors, of circadian cycles and of sensory adaptation, whose performance in\nsome regimes is indeed spoiled by increasing the dissipated power. We use the\nrelation between dissipation and the amount of time-reversal breaking to keep\nthe discussion quantitative also in effective models where the physical entropy\nproduction is not clearly identifiable.\n",
"title": "Life efficiency does not always increase with the dissipation rate"
}
| null | null |
[
"Physics"
] | null | true | null |
14418
| null |
Validated
| null | null |
null |
{
"abstract": " We investigate the defect structures forming around two nanoparticles in a\nGay-Berne nematic liquid crystal using molecular simulations. For small\nseparations, disclinations entangle both particles forming the figure of eight,\nthe figure of omega and the figure of theta. These defect structures are\nsimilar in shape and occur with a comparable frequency to micron-sized\nparticles studied in experiments. The simulations reveal fast transitions from\none defect structure to another suggesting that particles of nanometre size\ncannot be bound together effectively. We identify the 'three-ring' structure\nobserved in previous molecular simulations as a superposition of the different\nentangled and non-entangled states over time and conclude that it is not itself\na stable defect structure.\n",
"title": "Molecular simulations of entangled defect structures around nanoparticles in nematic liquid crystals"
}
| null | null |
[
"Physics"
] | null | true | null |
14419
| null |
Validated
| null | null |
null |
{
"abstract": " This paper establishes the almost sure convergence and asymptotic normality\nof levels and differenced quasi maximum-likelihood (QML) estimators of dynamic\npanel data models. The QML estimators are robust with respect to initial\nconditions, conditional and time-series heteroskedasticity, and\nmisspecification of the log-likelihood. The paper also provides an ECME\nalgorithm for calculating levels QML estimates. Finally, it uses Monte Carlo\nexperiments to compare the finite sample performance of levels and differenced\nQML estimators, the differenced GMM estimator, and the system GMM estimator. In\nthese experiments the QML estimators usually have smaller --- typically\nsubstantially smaller --- bias and root mean squared errors than the panel data\nGMM estimators.\n",
"title": "Quasi Maximum-Likelihood Estimation of Dynamic Panel Data Models"
}
| null | null |
[
"Mathematics",
"Statistics"
] | null | true | null |
14420
| null |
Validated
| null | null |
null |
{
"abstract": " This paper contributes to an emerging literature that models votes and text\nin tandem to better understand polarization of expressed preferences. It\nintroduces a new approach to estimate preference polarization in\nmultidimensional settings, such as international relations, based on\ndevelopments in the natural language processing and network science literatures\n-- namely word embeddings, which retain valuable syntactical qualities of human\nlanguage, and community detection in multilayer networks, which locates densely\nconnected actors across multiple, complex networks. We find that the employment\nof these tools in tandem helps to better estimate states' foreign policy\npreferences expressed in UN votes and speeches beyond that permitted by votes\nalone. The utility of these located affinity blocs is demonstrated through an\napplication to conflict onset in International Relations, though these tools\nwill be of interest to all scholars faced with the measurement of preferences\nand polarization in multidimensional settings.\n",
"title": "Disunited Nations? A Multiplex Network Approach to Detecting Preference Affinity Blocs using Texts and Votes"
}
| null | null | null | null | true | null |
14421
| null |
Default
| null | null |
null |
{
"abstract": " We investigate the impact of spin anisotropic interactions, promoted by\nspin-orbit coupling, on the magnetic phase diagram of the iron-based\nsuperconductors. Three distinct magnetic phases with Bragg peaks at $(\\pi,0)$\nand $(0,\\pi)$ are possible in these systems: one $C_2$ (i.e. orthorhombic)\nsymmetric stripe magnetic phase and two $C_4$ (i.e. tetragonal) symmetric\nmagnetic phases. While the spin anisotropic interactions allow the magnetic\nmoments to point in any direction in the $C_2$ phase, they restrict the\npossible moment orientations in the $C_4$ phases. As a result, an interesting\nscenario arises in which the spin anisotropic interactions favor a $C_2$ phase,\nbut the other spin isotropic interactions favor a $C_4$ phase. We study this\nfrustration via both mean-field and renormalization-group approaches. We find\nthat, to lift this frustration, a rich magnetic landscape emerges well below\nthe magnetic transition temperature, with novel $C_2$, $C_4$, and mixed\n$C_2$-$C_4$ phases. Near the putative magnetic quantum critical point, spin\nanisotropies promote a stable Gaussian fixed point in the renormalization-group\nflow, which is absent in the spin isotropic case, and is associated with a\nnear-degeneracy between $C_2$ and $C_4$ phases. We argue that this frustration\nis the reason why most $C_4$ phases in the iron pnictides only appear inside\nthe $C_2$ phase, and discuss additional manifestations of this frustration in\nthe phase diagrams of these materials.\n",
"title": "Magnetic phase diagram of the iron pnictides in the presence of spin-orbit coupling: Frustration between $C_2$ and $C_4$ magnetic phases"
}
| null | null | null | null | true | null |
14422
| null |
Default
| null | null |
null |
{
"abstract": " A well-studied coloring problem is to assign colors to the edges of a graph\n$G$ so that, for every pair of vertices, all edges of at least one shortest\npath between them receive different colors. The minimum number of colors\nnecessary in such a coloring is the strong rainbow connection number\n($\\src(G)$) of the graph. When proving upper bounds on $\\src(G)$, it is natural\nto prove that a coloring exists where, for \\emph{every} shortest path between\nevery pair of vertices in the graph, all edges of the path receive different\ncolors. Therefore, we introduce and formally define this more restricted edge\ncoloring number, which we call \\emph{very strong rainbow connection number}\n($\\vsrc(G)$).\nIn this paper, we give upper bounds on $\\vsrc(G)$ for several graph classes,\nsome of which are tight. These immediately imply new upper bounds on $\\src(G)$\nfor these classes, showing that the study of $\\vsrc(G)$ enables meaningful\nprogress on bounding $\\src(G)$. Then we study the complexity of the problem to\ncompute $\\vsrc(G)$, particularly for graphs of bounded treewidth, and show this\nis an interesting problem in its own right. We prove that $\\vsrc(G)$ can be\ncomputed in polynomial time on cactus graphs; in contrast, this question is\nstill open for $\\src(G)$. We also observe that deciding whether $\\vsrc(G) = k$\nis fixed-parameter tractable in $k$ and the treewidth of $G$. Finally, on\ngeneral graphs, we prove that there is no polynomial-time algorithm to decide\nwhether $\\vsrc(G) \\leq 3$ nor to approximate $\\vsrc(G)$ within a factor\n$n^{1-\\varepsilon}$, unless P$=$NP.\n",
"title": "Algorithms and Bounds for Very Strong Rainbow Coloring"
}
| null | null | null | null | true | null |
14423
| null |
Default
| null | null |
null |
{
"abstract": " We present a simple result that allows us to evaluate the asymptotic order of\nthe remainder of a partial asymptotic expansion of the quantile function $h(u)$\nas $u\\to 0^+$ or $1^-$. This is focussed on important univariate distributions\nwhen $h(\\cdot)$ has no simple closed form, with a view to assessing asymptotic\nrate of decay to zero of tail dependence in the context of bivariate copulas.\nThe Introduction motivates the study in terms of the standard Normal. The\nNormal, Skew-Normal and Gamma are used as initial examples. Finally, we discuss\napproximation to the lower quantile of the Variance-Gamma and Skew-Slash\ndistributions.\n",
"title": "Quantile function expansion using regularly varying functions"
}
| null | null | null | null | true | null |
14424
| null |
Default
| null | null |
null |
{
"abstract": " Axon guidance is a crucial process for growth of the central and peripheral\nnervous systems. In this study, 3 axon guidance related disorders, namely-\nDuane Retraction Syndrome (DRS) , Horizontal Gaze Palsy with Progressive\nScoliosis (HGPPS) and Congenital fibrosis of the extraocular muscles type 3\n(CFEOM3) were studied using various Systems Biology tools to identify the genes\nand proteins involved with them to get a better idea about the underlying\nmolecular mechanisms including the regulatory mechanisms. Based on the analyses\ncarried out, 7 significant modules have been identified from the PPI network.\nFive pathways/processes have been found to be significantly associated with\nDRS, HGPPS and CFEOM3 associated genes. From the PPI network, 3 have been\nidentified as hub proteins- DRD2, UBC and CUL3.\n",
"title": "Identification of Key Proteins Involved in Axon Guidance Related Disorders: A Systems Biology Approach"
}
| null | null | null | null | true | null |
14425
| null |
Default
| null | null |
null |
{
"abstract": " Motivated by applications in Game Theory, Optimization, and Generative\nAdversarial Networks, recent work of Daskalakis et al~\\cite{DISZ17} and\nfollow-up work of Liang and Stokes~\\cite{LiangS18} have established that a\nvariant of the widely used Gradient Descent/Ascent procedure, called\n\"Optimistic Gradient Descent/Ascent (OGDA)\", exhibits last-iterate convergence\nto saddle points in {\\em unconstrained} convex-concave min-max optimization\nproblems. We show that the same holds true in the more general problem of {\\em\nconstrained} min-max optimization under a variant of the no-regret\nMultiplicative-Weights-Update method called \"Optimistic Multiplicative-Weights\nUpdate (OMWU)\". This answers an open question of Syrgkanis et al~\\cite{SALS15}.\nThe proof of our result requires fundamentally different techniques from\nthose that exist in no-regret learning literature and the aforementioned\npapers. We show that OMWU monotonically improves the Kullback-Leibler\ndivergence of the current iterate to the (appropriately normalized) min-max\nsolution until it enters a neighborhood of the solution. Inside that\nneighborhood we show that OMWU becomes a contracting map converging to the\nexact solution. We believe that our techniques will be useful in the analysis\nof the last iterate of other learning algorithms.\n",
"title": "Last-Iterate Convergence: Zero-Sum Games and Constrained Min-Max Optimization"
}
| null | null | null | null | true | null |
14426
| null |
Default
| null | null |
null |
{
"abstract": " High-mass stars form within star clusters from dense, molecular regions, but\nis the process of cluster formation slow and hydrostatic or quick and dynamic?\nWe link the physical properties of high-mass star-forming regions with their\nevolutionary stage in a systematic way, using Herschel and Spitzer data. In\norder to produce a robust estimate of the relative lifetimes of these regions,\nwe compare the fraction of dense, molecular regions above a column density\nassociated with high-mass star formation, N(H2) > 0.4-2.5 x 10^22 cm^-2, in the\n'starless (no signature of stars > 10 Msun forming) and star-forming phases in\na 2x2 degree region of the Galactic Plane centered at l=30deg. Of regions\ncapable of forming high-mass stars on ~1 pc scales, the starless (or embedded\nbeyond detection) phase occupies about 60-70% of the dense, molecular region\nlifetime and the star-forming phase occupies about 30-40%. These relative\nlifetimes are robust over a wide range of thresholds. We outline a method by\nwhich relative lifetimes can be anchored to absolute lifetimes from large-scale\nsurveys of methanol masers and UCHII regions. A simplistic application of this\nmethod estimates the absolute lifetimes of the starless phase to be 0.2-1.7 Myr\n(about 0.6-4.1 fiducial cloud free-fall times) and the star-forming phase to be\n0.1-0.7 Myr (about 0.4-2.4 free-fall times), but these are highly uncertain.\nThis work uniquely investigates the star-forming nature of high-column density\ngas pixel-by-pixel and our results demonstrate that the majority of high-column\ndensity gas is in a starless or embedded phase.\n",
"title": "The Lifetimes of Phases in High-Mass Star-Forming Regions"
}
| null | null | null | null | true | null |
14427
| null |
Default
| null | null |
null |
{
"abstract": " In this paper, we deal with the null controllability of a population dynamics\nmodel with an interior degenerate diffusion. To this end, we proved first a new\nCarleman estimate for the full adjoint system and afterwards we deduce a\nsuitable observability inequality which will be needed to establish the\nexistence of a control acting on a subset of the space which lead the\npopulation to extinction in a finite time.\n",
"title": "Null controllability of a population dynamics with interior degeneracy"
}
| null | null | null | null | true | null |
14428
| null |
Default
| null | null |
null |
{
"abstract": " This work is a part of ICLR Reproducibility Challenge 2019, we try to\nreproduce the results in the conference submission PADAM: Closing The\nGeneralization Gap of Adaptive Gradient Methods In Training Deep Neural\nNetworks. Adaptive gradient methods proposed in past demonstrate a degraded\ngeneralization performance than the stochastic gradient descent (SGD) with\nmomentum. The authors try to address this problem by designing a new\noptimization algorithm that bridges the gap between the space of Adaptive\nGradient algorithms and SGD with momentum. With this method a new tunable\nhyperparameter called partially adaptive parameter p is introduced that varies\nbetween [0, 0.5]. We build the proposed optimizer and use it to mirror the\nexperiments performed by the authors. We review and comment on the empirical\nanalysis performed by the authors. Finally, we also propose a future direction\nfor further study of Padam. Our code is available at:\nthis https URL\n",
"title": "ICLR Reproducibility Challenge Report (Padam : Closing The Generalization Gap Of Adaptive Gradient Methods in Training Deep Neural Networks)"
}
| null | null | null | null | true | null |
14429
| null |
Default
| null | null |
null |
{
"abstract": " We consider the problem of estimating the joint distribution $P$ of $n$\nindependent random variables within the Bayes paradigm from a non-asymptotic\npoint of view. Assuming that $P$ admits some density $s$ with respect to a\ngiven reference measure, we consider a density model $\\overline S$ for $s$ that\nwe endow with a prior distribution $\\pi$ (with support $\\overline S$) and we\nbuild a robust alternative to the classical Bayes posterior distribution which\npossesses similar concentration properties around $s$ whenever it belongs to\nthe model $\\overline S$. Furthermore, in density estimation, the Hellinger\ndistance between the classical and the robust posterior distributions tends to\n0, as the number of observations tends to infinity, under suitable assumptions\non the model and the prior, provided that the model $\\overline S$ contains the\ntrue density $s$. However, unlike what happens with the classical Bayes\nposterior distribution, we show that the concentration properties of this new\nposterior distribution are still preserved in the case of a misspecification of\nthe model, that is when $s$ does not belong to $\\overline S$ but is close\nenough to it with respect to the Hellinger distance.\n",
"title": "Robust Bayes-Like Estimation: Rho-Bayes estimation"
}
| null | null | null | null | true | null |
14430
| null |
Default
| null | null |
null |
{
"abstract": " Here I introduce an extension to demixed principal component analysis (dPCA),\na linear dimensionality reduction technique for analyzing the activity of\nneural populations, to the case of nonlinear dimensions. This is accomplished\nusing kernel methods, resulting in kernel demixed principal component analysis\n(kdPCA). This extension resembles kernel-based extensions to standard principal\ncomponent analysis and canonical correlation analysis. kdPCA includes dPCA as a\nspecial case when the kernel is linear. I present examples of simulated neural\nactivity that follows different low dimensional configurations and compare the\nresults of kdPCA to dPCA. These simulations demonstrate that nonlinear\ninteractions can impede the ability of dPCA to demix neural activity\ncorresponding to experimental parameters, but kdPCA can still recover\ninterpretable components. Additionally, I compare kdPCA and dPCA to a neural\npopulation from rat orbitofrontal cortex during an odor classification task in\nrecovering decision-related activity.\n",
"title": "Nonlinear demixed component analysis for neural population data as a low-rank kernel regression problem"
}
| null | null |
[
"Quantitative Biology"
] | null | true | null |
14431
| null |
Validated
| null | null |
null |
{
"abstract": " This paper deals with the asymptotic behavior of solutions to the delayed\nmonostable equation: $(*)$ $u_{t}(t,x) = u_{xx}(t,x) - u(t,x) + g(u(t-h,x)),$\n$x \\in \\mathbb{R},\\ t >0,$ where $h>0$ and the reaction term $g: \\mathbb{R}_+\n\\to \\mathbb{R}_+$ has exactly two fixed points (zero and $\\kappa >0$). Under\ncertain condition on the derivative of $g$ at $\\kappa$, the global stability of\nfast wavefronts is proved. Also, the stability of the $leading \\ edge$ of\nsemi-wavefronts for $(*)$ with $g$ satisfying $g(u)\\leq g'(0)u, u\\in\\R_+,$ is\nestablished\n",
"title": "Stability of semi-wavefronts for delayed reaction-diffusion equations"
}
| null | null | null | null | true | null |
14432
| null |
Default
| null | null |
null |
{
"abstract": " We propose an end-to-end approach to the natural language object retrieval\ntask, which localizes an object within an image according to a natural language\ndescription, i.e., referring expression. Previous works divide this problem\ninto two independent stages: first, compute region proposals from the image\nwithout the exploration of the language description; second, score the object\nproposals with regard to the referring expression and choose the top-ranked\nproposals. The object proposals are generated independently from the referring\nexpression, which makes the proposal generation redundant and even irrelevant\nto the referred object. In this work, we train an agent with deep reinforcement\nlearning, which learns to move and reshape a bounding box to localize the\nobject according to the referring expression. We incorporate both the spatial\nand temporal context information into the training procedure. By simultaneously\nexploiting local visual information, the spatial and temporal context and the\nreferring language a priori, the agent selects an appropriate action to take at\neach time. A special action is defined to indicate when the agent finds the\nreferred object, and terminate the procedure. We evaluate our model on various\ndatasets, and our algorithm significantly outperforms the compared algorithms.\nNotably, the accuracy improvement of our method over the recent method GroundeR\nand SCRC on the ReferItGame dataset are 7.67% and 18.25%, respectively.\n",
"title": "An End-to-End Approach to Natural Language Object Retrieval via Context-Aware Deep Reinforcement Learning"
}
| null | null | null | null | true | null |
14433
| null |
Default
| null | null |
null |
{
"abstract": " With access to large datasets, deep neural networks (DNN) have achieved\nhuman-level accuracy in image and speech recognition tasks. However, in\nchemistry, data is inherently small and fragmented. In this work, we develop an\napproach of using rule-based knowledge for training ChemNet, a transferable and\ngeneralizable deep neural network for chemical property prediction that learns\nin a weak-supervised manner from large unlabeled chemical databases. When\ncoupled with transfer learning approaches to predict other smaller datasets for\nchemical properties that it was not originally trained on, we show that\nChemNet's accuracy outperforms contemporary DNN models that were trained using\nconventional supervised learning. Furthermore, we demonstrate that the ChemNet\npre-training approach is equally effective on both CNN (Chemception) and RNN\n(SMILES2vec) models, indicating that this approach is network architecture\nagnostic and is effective across multiple data modalities. Our results indicate\na pre-trained ChemNet that incorporates chemistry domain knowledge, enables the\ndevelopment of generalizable neural networks for more accurate prediction of\nnovel chemical properties.\n",
"title": "Using Rule-Based Labels for Weak Supervised Learning: A ChemNet for Transferable Chemical Property Prediction"
}
| null | null | null | null | true | null |
14434
| null |
Default
| null | null |
null |
{
"abstract": " The objective of this paper is to develop an Artificial Neural Network (ANN)\nmodel to estimate simultaneously, parameters and state of a brushed DC machine.\nThe proposed ANN estimator is novel in the sense that his estimates\nsimultaneously temperature, speed and rotor resistance based only on the\nmeasurement of the voltage and current inputs. Many types of ANN estimators\nhave been designed by a lot of researchers during the last two decades. Each\ntype is designed for a specific application. The thermal behavior of the motor\nis very slow, which leads to large amounts of data sets. The standard ANN use\noften Multi-Layer Perceptron (MLP) with Levenberg-Marquardt Backpropagation\n(LMBP), among the limits of LMBP in the case of large number of data, so the\nuse of MLP based on LMBP is no longer valid in our case. As solution, we\npropose the use of Cascade-Forward Neural Network (CFNN) based Bayesian\nRegulation backpropagation (BRBP). To test our estimator robustness a random\nwhite-Gaussian noise has been added to the sets. The proposed estimator is in\nour viewpoint accurate and robust.\n",
"title": "Intelligent Sensor Based Bayesian Neural Network for Combined Parameters and States Estimation of a Brushed DC Motor"
}
| null | null |
[
"Computer Science"
] | null | true | null |
14435
| null |
Validated
| null | null |
null |
{
"abstract": " We prove that the generalised Fibonacci group F(r,n) is infinite for (r,n) in\n{(7 + 5k,5), (8 + 5k,5)} where k is greater than or equal to 0. This together\nwith previously known results yields a complete classification of the finite\nF(r,n), a problem that has its origins in a question by J H Conway in 1965. The\nmethod is to show that a related relative presentation is aspherical from which\nit can be deduced that the groups are infinite.\n",
"title": "The infinite Fibonacci groups and relative asphericity"
}
| null | null | null | null | true | null |
14436
| null |
Default
| null | null |
null |
{
"abstract": " A Rota--Baxter operator is an algebraic abstraction of integration, which is\nthe typical example of a weight zero Rota-Baxter operator. We show that\nstudying the modules over the polynomial Rota--Baxter algebra $(k[x],P)$ is\nequivalent to studying the modules over the Jordan plane, and we generalize the\ndirect decomposability results for the $(k[x],P)$-modules in [Iy] from\nalgebraically closed fields of characteristic zero to fields of characteristic\nzero. Furthermore, we provide a classification of Rota--Baxter modules up to\nisomorphism based on indecomposable $k[x]$-modules.\n",
"title": "Representations of Polynomial Rota-Baxter Algebras"
}
| null | null | null | null | true | null |
14437
| null |
Default
| null | null |
null |
{
"abstract": " The mass function of galaxy clusters is a sensitive tracer of the\ngravitational evolution of the cosmic large-scale structure and serves as an\nimportant census of the fraction of matter bound in large structures. We obtain\nthe mass function by fitting the observed cluster X-ray luminosity distribution\nfrom the REFLEX galaxy cluster survey to models of cosmological structure\nformation. We marginalise over uncertainties in the cosmological parameters as\nwell as those of the relevant galaxy cluster scaling relations. The mass\nfunction is determined with an uncertainty less than 10% in the mass range 3 x\n10^12 to 5 x 10^14 M$_\\odot$. For the cumulative mass function we find a slope\nat the low mass end consistent with a value of -1, while the mass rich end\ncut-off is milder than a Schechter function with an exponential term exp($-\nM^\\delta$) with $\\delta$ smaller than 1. Changing the Hubble parameter in the\nrange $H_0 = 67 - 73 km s^-1 Mpc^{-1}$ or allowing the total neutrino mass to\nhave a value between 0 - 0.4 eV causes variations less than the uncertainties.\nWe estimate the fraction of mass locked up in galaxy clusters: about 4.4% of\nthe matter in the Universe is bound in clusters (inside $r_200$) with a mass\nlarger than 10^14 M$_\\odot$ and 14% to clusters and groups with a mass larger\nthan 10^13 M$_\\odot$ at the present Universe. We also discuss the evolution of\nthe galaxy cluster population with redshift. Our results imply that there is\nhardly any clusters with a mass > 10^15 M$_\\odot$ above a redshift of z = 1.\n",
"title": "The extended ROSAT-ESO Flux-Limited X-ray Galaxy Cluster Survey (REFLEX II) VII The Mass Function of Galaxy Clusters"
}
| null | null | null | null | true | null |
14438
| null |
Default
| null | null |
null |
{
"abstract": " With the advent of large-scale heterogeneous search engines comes the problem\nof unified search control resulting in mismatches that could have otherwise\navoided. A mechanism is needed to determine exact patterns in web mining and\nubiquitous device searching. In this paper we demonstrate the use of an\noptimized string searching algorithm to recognize exact patterns from a large\ndatabase. The underlying principle in designing the algorithm is that each\nletter that maps to a fixed real values and some arithmetic operations which\nare applied to compute corresponding pattern and substring values. We have\nimplemented this algorithm in C. We have tested the algorithm using a large\ndataset. We created our own dataset using DNA sequences. The experimental\nresult shows the number of mismatch occurred in string search from a large\ndatabase. Furthermore, some of the inherent weaknesses in the use of this\nalgorithm are highlighted.\n",
"title": "An Optimized Pattern Recognition Algorithm for Anomaly Detection in IoT Environment"
}
| null | null |
[
"Computer Science"
] | null | true | null |
14439
| null |
Validated
| null | null |
null |
{
"abstract": " We obtain the rigorous uniform asymptotics of a particular integral where a\nstationary point is close to an endpoint. There exists a general method\nintroduced by Bleistein for obtaining uniform asymptotics in this situation.\nHowever, this method does not provide rigorous estimates for the error. Indeed,\nthe method of Bleistein starts with a change of variables, which implies that\nthe parameter governing how close the stationary point is to the endpoint\nappears in several parts of the integrand, and this means that one cannot\nobtain general error bounds. By adapting the above method to our particular\nintegral, we obtain rigorous uniform leading-order asymptotics. We also give a\nrigorous derivation of the asymptotics to all orders of the same integral; the\nnovelty of this second approach is that it does not involve a global change of\nvariables.\n",
"title": "Uniform asymptotics as a stationary point approaches an endpoint"
}
| null | null | null | null | true | null |
14440
| null |
Default
| null | null |
null |
{
"abstract": " For any undirected and weighted graph $G=(V,E,w)$ with $n$ vertices and $m$\nedges, we call a sparse subgraph $H$ of $G$, with proper reweighting of the\nedges, a $(1+\\varepsilon)$-spectral sparsifier if \\[\n(1-\\varepsilon)x^{\\intercal}L_Gx\\leq x^{\\intercal} L_{H} x\\leq (1+\\varepsilon)\nx^{\\intercal} L_Gx \\] holds for any $x\\in\\mathbb{R}^n$, where $L_G$ and $L_{H}$\nare the respective Laplacian matrices of $G$ and $H$. Noticing that $\\Omega(m)$\ntime is needed for any algorithm to construct a spectral sparsifier and a\nspectral sparsifier of $G$ requires $\\Omega(n)$ edges, a natural question is to\ninvestigate, for any constant $\\varepsilon$, if a $(1+\\varepsilon)$-spectral\nsparsifier of $G$ with $O(n)$ edges can be constructed in $\\tilde{O}(m)$ time,\nwhere the $\\tilde{O}$ notation suppresses polylogarithmic factors. All previous\nconstructions on spectral sparsification require either super-linear number of\nedges or $m^{1+\\Omega(1)}$ time.\nIn this work we answer this question affirmatively by presenting an algorithm\nthat, for any undirected graph $G$ and $\\varepsilon>0$, outputs a\n$(1+\\varepsilon)$-spectral sparsifier of $G$ with $O(n/\\varepsilon^2)$ edges in\n$\\tilde{O}(m/\\varepsilon^{O(1)})$ time. Our algorithm is based on three novel\ntechniques: (1) a new potential function which is much easier to compute yet\nhas similar guarantees as the potential functions used in previous references;\n(2) an efficient reduction from a two-sided spectral sparsifier to a one-sided\nspectral sparsifier; (3) constructing a one-sided spectral sparsifier by a\nsemi-definite program.\n",
"title": "An SDP-Based Algorithm for Linear-Sized Spectral Sparsification"
}
| null | null | null | null | true | null |
14441
| null |
Default
| null | null |
null |
{
"abstract": " Readout chips of hybrid pixel detectors use a low power amplifier and\nthreshold discrimination to process charge deposited in semiconductor sensors.\nDue to transistor mismatch each pixel circuit needs to be calibrated\nindividually to achieve response uniformity. Traditionally this is addressed by\nprogrammable threshold trimming in each pixel, but requires robustness against\nradiation effects, temperature, and time. In this paper a self-adjusting\nthreshold mechanism is presented, which corrects the threshold for both spatial\ninequality and time variation and maintains a constant response. It exploits\nthe electrical noise as relative measure for the threshold and automatically\nadjust the threshold of each pixel to always achieve a uniform frequency of\nnoise hits. A digital implementation of the method in the form of an up/down\ncounter and combinatorial logic filter is presented. The behavior of this\ncircuit has been simulated to evaluate its performance and compare it to\ntraditional calibration results. The simulation results show that this\nmechanism can perform equally well, but eliminates instability over time and is\nimmune to single event upsets.\n",
"title": "Self-Adjusting Threshold Mechanism for Pixel Detectors"
}
| null | null | null | null | true | null |
14442
| null |
Default
| null | null |
null |
{
"abstract": " The paper presents a novel analysis of a transmission problem for a network\nof flexural beams incorporating conventional Euler-Bernoulli beams as well as\nRayleigh beams with the enhanced rotational inertia. Although, in the\nlow-frequency regime, these beams have a similar dynamic response, we have\ndemonstrated novel features which occur in the transmission at higher\nfrequencies across the layer of the Rayleigh beams.\n",
"title": "Rotational inertia interface in a dynamic lattice of flexural beams"
}
| null | null |
[
"Physics"
] | null | true | null |
14443
| null |
Validated
| null | null |
null |
{
"abstract": " The terms \"acoustic/elastic meta-materials\" describe a class of periodic\nstructures with unit cells exhibiting local resonance. This localized resonant\nstructure has been shown to result in negative effective stiffness and/or mass\nat frequency ranges close to these local resonances. As a result, these\nstructures present unusual wave propagation properties at wavelengths well\nbelow the regime corresponding to band-gap generation based on spatial\nperiodicity, (i.e. \"Bragg scattering\"). Therefore, acoustic/elastic\nmeta-materials can lead to applications, especially suitable in the\nlow-frequency range. However, low frequency range applications of such\nmeta-materials require very heavy internal moving masses, as well as additional\nconstraints at the amplitudes of the internally oscillating locally resonating\nstructures, which may prohibit their practical implementation. In order to\nresolve this disadvantage, the K-Damping concept will be analyzed. According to\nthis concept, the acoustic/elastic meta-materials are designed to include\nnegative stiffness elements instead or in addition to the internally resonating\nadded masses. This concept removes the need for the heavy locally added heavy\nmasses, while it simultaneously exploits the negative stiffness damping\nphenomenon. Application of both Bloch's theory and the classical modal analysis\nat the one-dimensional mass-in-mass lattice is analyzed and corresponding\ndispersion relations are derived. The results indicate significant advantages\nover the conventional mass-in-a mass lattice, such as broader band-gaps and\nincreased damping ratio and reveal significant potential in the proposed\nsolution. Preliminary feasibility analysis for seismic meta-structures and low\nfrequency acoustic isolation-damping confirm the strong potential and\napplicability of this concept.\n",
"title": "Low-frequency wide band-gap elastic/acoustic meta-materials using the K-damping concept"
}
| null | null | null | null | true | null |
14444
| null |
Default
| null | null |
null |
{
"abstract": " Blind source separation is a common processing tool to analyse the\nconstitution of pixels of hyperspectral images. Such methods usually suppose\nthat pure pixel spectra (endmembers) are the same in all the image for each\nclass of materials. In the framework of remote sensing, such an assumption is\nno more valid in the presence of intra-class variabilities due to illumination\nconditions, weathering, slight variations of the pure materials, etc... In this\npaper, we first describe the results of investigations highlighting intra-class\nvariability measured in real images. Considering these results, a new\nformulation of the linear mixing model is presented leading to two new methods.\nUnconstrained Pixel-by-pixel NMF (UP-NMF) is a new blind source separation\nmethod based on the assumption of a linear mixing model, which can deal with\nintra-class variability. To overcome UP-NMF limitations an extended method is\nproposed, named Inertia-constrained Pixel-by-pixel NMF (IP-NMF). For each\nsensed spectrum, these extended versions of NMF extract a corresponding set of\nsource spectra. A constraint is set to limit the spreading of each source's\nestimates in IP-NMF. The methods are tested on a semi-synthetic data set built\nwith spectra extracted from a real hyperspectral image and then numerically\nmixed. We thus demonstrate the interest of our methods for realistic source\nvariabilities. Finally, IP-NMF is tested on a real data set and it is shown to\nyield better performance than state of the art methods.\n",
"title": "Inertia-Constrained Pixel-by-Pixel Nonnegative Matrix Factorisation: a Hyperspectral Unmixing Method Dealing with Intra-class Variability"
}
| null | null | null | null | true | null |
14445
| null |
Default
| null | null |
null |
{
"abstract": " Recently, B.-Y. Chen and O. J. Garay studied pointwise slant submanifolds of\nalmost Hermitian manifolds. By using this notion, we investigate pointwise\nsemi-slant submanifolds and their warped products in Sasakian manifolds. We\ngive non-trivial examples of such submanifolds and obtain several fundamental\nresults, including a characterization for warped product pointwise semi-slant\nsubmanifolds of Sasakian manifolds.\n",
"title": "Warped Product Pointwise Semi-slant Submanifolds of Sasakian Manifolds"
}
| null | null | null | null | true | null |
14446
| null |
Default
| null | null |
null |
{
"abstract": " We propose a data-efficient Gaussian process-based Bayesian approach to the\nsemi-supervised learning problem on graphs. The proposed model shows extremely\ncompetitive performance when compared to the state-of-the-art graph neural\nnetworks on semi-supervised learning benchmark experiments, and outperforms the\nneural networks in active learning experiments where labels are scarce.\nFurthermore, the model does not require a validation data set for early\nstopping to control over-fitting. Our model can be viewed as an instance of\nempirical distribution regression weighted locally by network connectivity. We\nfurther motivate the intuitive construction of the model with a Bayesian linear\nmodel interpretation where the node features are filtered by an operator\nrelated to the graph Laplacian. The method can be easily implemented by\nadapting off-the-shelf scalable variational inference algorithms for Gaussian\nprocesses.\n",
"title": "Bayesian Semi-supervised Learning with Graph Gaussian Processes"
}
| null | null |
[
"Computer Science",
"Statistics"
] | null | true | null |
14447
| null |
Validated
| null | null |
null |
{
"abstract": " Modern knowledge base systems frequently need to combine a collection of\ndatabases in different formats: e.g., relational databases, XML databases, rule\nbases, ontologies, etc. In the deductive database system DDBASE, we can manage\nthese different formats of knowledge and reason about them. Even the file\nsystems on different computers can be part of the knowledge base. Often, it is\nnecessary to handle different versions of a knowledge base. E.g., we might want\nto find out common parts or differences of two versions of a relational\ndatabase.\nWe will examine the use of abstractions of rule bases by predicate dependency\nand rule predicate graphs. Also the proof trees of derived atoms can help to\ncompare different versions of a rule base. Moreover, it might be possible to\nhave derivations joining rules with other formalisms of knowledge\nrepresentation.\nOntologies have shown their benefits in many applications of intelligent\nsystems, and there have been many proposals for rule languages compatible with\nthe semantic web stack, e.g., SWRL, the semantic web rule language. Recently,\nontologies are used in hybrid systems for specifying the provenance of the\ndifferent components.\n",
"title": "Knowledge Engineering for Hybrid Deductive Databases"
}
| null | null | null | null | true | null |
14448
| null |
Default
| null | null |
null |
{
"abstract": " We derive an algorithm to compute satisfiability bounds for arbitrary\n{\\omega}-regular properties in an Interval-valued Markov Chain (IMC)\ninterpreted in the adversarial sense. IMCs generalize regular Markov Chains by\nassigning a range of possible values to the transition probabilities between\nstates. In particular, we expand the automata-based theory of {\\omega}-regular\nproperty verification in Markov Chains to apply it to IMCs. Any\n{\\omega}-regular property can be represented by a Deterministic Rabin Automata\n(DRA) with acceptance conditions expressed by Rabin pairs. Previous works on\nMarkov Chains have shown that computing the probability of satisfying a given\n{\\omega}-regular property reduces to a reachability problem in the product\nbetween the Markov Chain and the corresponding DRA. We similarly define the\nnotion of a product between an IMC and a DRA. Then, we show that in a product\nIMC, there exists a particular assignment of the transition values that\ngenerates a largest set of non-accepting states. Subsequently, we prove that a\nlower bound is found by solving a reachability problem in that refined version\nof the original product IMC. We derive a similar approach for computing a\nsatisfiability upper bound in a product IMC with one Rabin pair. For product\nIMCs with more than one Rabin pair, we establish that computing a\nsatisfiability upper bound is equivalent to lower-bounding the satisfiability\nof the complement of the original property. A search algorithm for finding the\nlargest accepting and non-accepting sets of states in a product IMC is\nproposed. Finally, we demonstrate our findings in a case study.\n",
"title": "Satisfiability Bounds for ω-regular Properties in Interval-valued Markov Chains"
}
| null | null | null | null | true | null |
14449
| null |
Default
| null | null |
null |
{
"abstract": " This paper is concerned with optimal control problems for systems governed by\nmean-field stochastic differential equation, in which the control enters both\nthe drift and the diffusion coefficient. We prove that the relaxed state\nprocess, associated with measure valued controls, is governed by an orthogonal\nmartingale measure rather that a Brownian motion. In particular, we show by a\ncounter example that replacing the drift and diffusion coefficient by their\nrelaxed counterparts does not define a true relaxed control problem. We\nestablish the existence of an optimal relaxed control, which can be\napproximated by a sequence of strict controls. Moreover under some convexity\nconditions, we show that the optimal control is realized by a strict control.\n",
"title": "On the relaxed mean-field stochastic control problem"
}
| null | null | null | null | true | null |
14450
| null |
Default
| null | null |
null |
{
"abstract": " A novel minutia-based fingerprint matching algorithm is proposed that employs\niterative global alignment on two minutia sets. The matcher considers all\npossible minutia pairings and iteratively aligns the two sets until the number\nof minutia pairs does not exceed the maximum number of allowable one-to-one\npairings. The optimal alignment parameters are derived analytically via linear\nleast squares. The first alignment establishes a region of overlap between the\ntwo minutia sets, which is then (iteratively) refined by each successive\nalignment. After each alignment, minutia pairs that exhibit weak correspondence\nare discarded. The process is repeated until the number of remaining pairs no\nlonger exceeds the maximum number of allowable one-to-one pairings. The\nproposed algorithm is tested on both the FVC2000 and FVC2002 databases, and the\nresults indicate that the proposed matcher is both effective and efficient for\nfingerprint authentication; it is fast and does not utilize any computationally\nexpensive mathematical functions (e.g. trigonometric, exponential). In addition\nto the proposed matcher, another contribution of the paper is the analytical\nderivation of the least squares solution for the optimal alignment parameters\nfor two point-sets lacking exact correspondence.\n",
"title": "A New Point-set Registration Algorithm for Fingerprint Matching"
}
| null | null | null | null | true | null |
14451
| null |
Default
| null | null |
null |
{
"abstract": " Suppose $F:=(f_1,\\ldots,f_n)$ is a system of random $n$-variate polynomials\nwith $f_i$ having degree $\\leq\\!d_i$ and the coefficient of $x^{a_1}_1\\cdots\nx^{a_n}_n$ in $f_i$ being an independent complex Gaussian of mean $0$ and\nvariance $\\frac{d_i!}{a_1!\\cdots a_n!\\left(d_i-\\sum^n_{j=1}a_j \\right)!}$.\nRecent progress on Smale's 17th Problem by Lairez --- building upon seminal\nwork of Shub, Beltran, Pardo, Bürgisser, and Cucker --- has resulted in a\ndeterministic algorithm that finds a single (complex) approximate root of $F$\nusing just $N^{O(1)}$ arithmetic operations on average, where\n$N\\!:=\\!\\sum^n_{i=1}\\frac{(n+d_i)!}{n!d_i!}$ ($=n(n+\\max_i\nd_i)^{O(\\min\\{n,\\max_i d_i)\\}}$) is the maximum possible total number of\nmonomial terms for such an $F$. However, can one go faster when the number of\nterms is smaller, and we restrict to real coefficient and real roots? And can\none still maintain average-case polynomial-time with more general probability\nmeasures?\nWe show the answer is yes when $F$ is instead a binomial system --- a case\nwhose numerical solution is a key step in polyhedral homotopy algorithms for\nsolving arbitrary polynomial systems. We give a deterministic algorithm that\nfinds a real approximate root (or correctly decides there are none) using just\n$O(n^2(\\log(n)+\\log\\max_i d_i))$ arithmetic operations on average. Furthermore,\nour approach allows Gaussians with arbitrary variance. We also discuss briefly\nthe obstructions to maintaining average-case time polynomial in $n\\log \\max_i\nd_i$ when $F$ has more terms.\n",
"title": "A Faster Solution to Smale's 17th Problem I: Real Binomial Systems"
}
| null | null |
[
"Computer Science"
] | null | true | null |
14452
| null |
Validated
| null | null |
null |
{
"abstract": " The majority of online content is written in languages other than English,\nand is most commonly encoded in UTF-8, the world's dominant Unicode character\nencoding. Traditional compression algorithms typically operate on individual\nbytes. While this approach works well for the single-byte ASCII encoding, it\nworks poorly for UTF-8, where characters often span multiple bytes. Previous\nresearch has focused on developing Unicode compressors from scratch, which\noften failed to outperform established algorithms such as bzip2. We develop a\ntechnique to modify byte-based compressors to operate directly on Unicode\ncharacters, and implement variants of LZW and PPM that apply this technique. We\nfind that our method substantially improves compression effectiveness on a\nUTF-8 corpus, with our PPM variant outperforming the state-of-the-art PPMII\ncompressor. On ASCII and binary files, our variants perform similarly to the\noriginal unmodified compressors.\n",
"title": "Making compression algorithms for Unicode text"
}
| null | null | null | null | true | null |
14453
| null |
Default
| null | null |
null |
{
"abstract": " In this paper we study the adaptive learnability of decision trees of depth\nat most $d$ from membership queries. This has many applications in automated\nscientific discovery such as drugs development and software update problem.\nFeldman solves the problem in a randomized polynomial time algorithm that asks\n$\\tilde O(2^{2d})\\log n$ queries and Kushilevitz-Mansour in a deterministic\npolynomial time algorithm that asks $ 2^{18d+o(d)}\\log n$ queries. We improve\nthe query complexity of both algorithms. We give a randomized polynomial time\nalgorithm that asks $\\tilde O(2^{2d}) + 2^{d}\\log n$ queries and a\ndeterministic polynomial time algorithm that asks $2^{5.83d}+2^{2d+o(d)}\\log n$\nqueries.\n",
"title": "Adaptive Exact Learning of Decision Trees from Membership Queries"
}
| null | null | null | null | true | null |
14454
| null |
Default
| null | null |
null |
{
"abstract": " The details of an image with noise may be restored by removing noise through\na suitable image de-noising method. In this research, a new method of image\nde-noising based on using median filter (MF) in the wavelet domain is proposed\nand tested. Various types of wavelet transform filters are used in conjunction\nwith median filter in experimenting with the proposed approach in order to\nobtain better results for image de-noising process, and, consequently to select\nthe best suited filter. Wavelet transform working on the frequencies of\nsub-bands split from an image is a powerful method for analysis of images.\nAccording to this experimental work, the proposed method presents better\nresults than using only wavelet transform or median filter alone. The MSE and\nPSNR values are used for measuring the improvement in de-noised images.\n",
"title": "Image denoising by median filter in wavelet domain"
}
| null | null | null | null | true | null |
14455
| null |
Default
| null | null |
null |
{
"abstract": " This contribution deals with image restoration in optical systems with\ncoherent illumination, which is an important topic in astronomy, coherent\nmicroscopy and radar imaging. Such optical systems suffer from wavefront\ndistortions, which are caused by imperfect imaging components and conditions.\nKnown image restoration algorithms work well for incoherent imaging, they fail\nin case of coherent images. In this paper a novel wavefront correction\nalgorithm is presented, which allows image restoration under coherent\nconditions. In most coherent imaging systems, especially in astronomy, the\nwavefront deformation is known. Using this information, the proposed algorithm\nallows a high quality restoration even in case of severe wavefront distortions.\nWe present two versions of this algorithm, which are an evolution of the\nGerchberg-Saxton and the Hybrid-Input-Output algorithm. The algorithm is\nverified on simulated and real microscopic images.\n",
"title": "Restoration of Images with Wavefront Aberrations"
}
| null | null | null | null | true | null |
14456
| null |
Default
| null | null |
null |
{
"abstract": " Membrane proteins and lipids can self-assemble into membrane protein\npolyhedral nanoparticles (MPPNs). MPPNs have a closed spherical surface and a\npolyhedral protein arrangement, and may offer a new route for structure\ndetermination of membrane proteins and targeted drug delivery. We develop here\na general analytic model of how MPPN self-assembly depends on bilayer-protein\ninteractions and lipid bilayer mechanical properties. We find that the\nbilayer-protein hydrophobic thickness mismatch is a key molecular control\nparameter for MPPN shape that can be used to bias MPPN self-assembly towards\nhighly symmetric and uniform MPPN shapes. Our results suggest strategies for\noptimizing MPPN shape for structural studies of membrane proteins and targeted\ndrug delivery.\n",
"title": "Controlling the shape of membrane protein polyhedra"
}
| null | null | null | null | true | null |
14457
| null |
Default
| null | null |
null |
{
"abstract": " We show that every uniformly recurrent subgroup of a locally compact group is\nthe family of stabilizers of a minimal action on a compact space. More\ngenerally, every closed invariant subset of the Chabauty space is the family of\nstabilizers of an action on a compact space on which the stabilizer map is\ncontinuous everywhere. This answers a question of Glasner and Weiss. We also\nintroduce the notion of a universal minimal flow relative to a uniformly\nrecurrent subgroup and prove its existence and uniqueness.\n",
"title": "Realizing uniformly recurrent subgroups"
}
| null | null | null | null | true | null |
14458
| null |
Default
| null | null |
null |
{
"abstract": " In monotone submodular function maximization, approximation guarantees based\non the curvature of the objective function have been extensively studied in the\nliterature. However, the notion of curvature is often pessimistic, and we\nrarely obtain improved approximation guarantees, even for very simple objective\nfunctions.\nIn this paper, we provide a novel approximation guarantee by extracting an\nM$^\\natural$-concave function $h:2^E \\to \\mathbb R_+$, a notion in discrete\nconvex analysis, from the objective function $f:2^E \\to \\mathbb R_+$. We\nintroduce the notion of $h$-curvature, which measures how much $f$ deviates\nfrom $h$, and show that we can obtain a $(1-\\gamma/e-\\epsilon)$-approximation\nto the problem of maximizing $f$ under a cardinality constraint in polynomial\ntime for any constant $\\epsilon > 0$. Then, we show that we can obtain\nnontrivial approximation guarantees for various problems by applying the\nproposed algorithm.\n",
"title": "A New Approximation Guarantee for Monotone Submodular Function Maximization via Discrete Convexity"
}
| null | null | null | null | true | null |
14459
| null |
Default
| null | null |
null |
{
"abstract": " Standard models of reaction kinetics in condensed materials rely on the\nBoltzmann-Gibbs distribution for the population of reactants at the top of the\nfree energy barrier separating them from the products. While energy dissipation\nand quantum effects at the barrier top can potentially affect the transmission\ncoefficient entering the rate preexponential factor, much stronger dynamical\neffects on the reaction barrier are caused by the breakdown of ergodicity for\npopulating the reaction barrier (violation of the Boltzmann-Gibbs statistics).\nWhen the spectrum of medium modes coupled to the reaction coordinate includes\nfluctuations slower than the reaction rate, such nuclear motions dynamically\nfreeze on the reaction time-scale and do not contribute to the activation\nbarrier. Here we consider the consequences of this scenario for electrode\nreactions in slowly relaxing media. Changing electrode overpotential speeds\nelectrode electron transfer up, potentially cutting through the spectrum of\nnuclear modes coupled to the reaction coordinate. The reorganization energy of\nelectrochemical electron transfer becomes a function of the electrode\noverpotential, switching between the thermodynamic value at low rates to the\nnonergodic limit at higher rates. The sharpness of this transition depends of\nthe relaxation spectrum of the medium. The reorganization energy experiences a\nsudden drop with increasing overpotential for a medium with a Debye relaxation,\nbut becomes a much shallower function of the overpotential for media with\nstretched exponential dynamics. The latter scenario characterizes electron\ntransfer in ionic liquids. The analysis of electrode reactions in\nroom-temperature ionic liquids shows that the magnitude of the free energy of\nnuclear solvation is significantly below its thermodynamic limit.\n",
"title": "Electrode Reactions in Slowly Relaxing Media"
}
| null | null | null | null | true | null |
14460
| null |
Default
| null | null |
null |
{
"abstract": " Monocular 3D facial shape reconstruction from a single 2D facial image has\nbeen an active research area due to its wide applications. Inspired by the\nsuccess of deep neural networks (DNN), we propose a DNN-based approach for\nEnd-to-End 3D FAce Reconstruction (UH-E2FAR) from a single 2D image. Different\nfrom recent works that reconstruct and refine the 3D face in an iterative\nmanner using both an RGB image and an initial 3D facial shape rendering, our\nDNN model is end-to-end, and thus the complicated 3D rendering process can be\navoided. Moreover, we integrate in the DNN architecture two components, namely\na multi-task loss function and a fusion convolutional neural network (CNN) to\nimprove facial expression reconstruction. With the multi-task loss function, 3D\nface reconstruction is divided into neutral 3D facial shape reconstruction and\nexpressive 3D facial shape reconstruction. The neutral 3D facial shape is\nclass-specific. Therefore, higher layer features are useful. In comparison, the\nexpressive 3D facial shape favors lower or intermediate layer features. With\nthe fusion-CNN, features from different intermediate layers are fused and\ntransformed for predicting the 3D expressive facial shape. Through extensive\nexperiments, we demonstrate the superiority of our end-to-end framework in\nimproving the accuracy of 3D face reconstruction.\n",
"title": "End-to-end 3D face reconstruction with deep neural networks"
}
| null | null | null | null | true | null |
14461
| null |
Default
| null | null |
null |
{
"abstract": " Wave-particle duality is the most fundamental description of the nature of a\nquantum object which behaves like a classical particle or wave depending on the\nmeasurement apparatus. On the other hand, entanglement represents nonclassical\ncorrelations of composite quantum systems, being also a key resource in quantum\ninformation. Despite the very recent observations of wave-particle\nsuperposition and entanglement, whether these two fundamental traits of quantum\nmechanics can emerge simultaneously remains an open issue. Here we introduce\nand experimentally realize a scheme that deterministically generates\nwave-particle entanglement of two photons. The elementary tool allowing this\nachievement is a scalable single-photon setup which can be in principle\nextended to generate multiphoton wave-particle entanglement. Our study reveals\nthat photons can be entangled in their dual wave-particle nature and opens the\nway to potential applications in quantum information protocols exploiting the\nwave-particle degrees of freedom to encode qubits.\n",
"title": "Entanglement of photons in their dual wave-particle nature"
}
| null | null | null | null | true | null |
14462
| null |
Default
| null | null |
null |
{
"abstract": " Tensor train (TT) decomposition provides a space-efficient representation for\nhigher-order tensors. Despite its advantage, we face two crucial limitations\nwhen we apply the TT decomposition to machine learning problems: the lack of\nstatistical theory and of scalable algorithms. In this paper, we address the\nlimitations. First, we introduce a convex relaxation of the TT decomposition\nproblem and derive its error bound for the tensor completion task. Next, we\ndevelop an alternating optimization method with a randomization technique, in\nwhich the time complexity is as efficient as the space complexity is. In\nexperiments, we numerically confirm the derived bounds and empirically\ndemonstrate the performance of our method with a real higher-order tensor.\n",
"title": "On Tensor Train Rank Minimization: Statistical Efficiency and Scalable Algorithm"
}
| null | null | null | null | true | null |
14463
| null |
Default
| null | null |
null |
{
"abstract": " We calculate the energy of threshold fluctuation $\\delta F_{thr}$ which\ntriggers the transition of superconducting current-carrying bridge to resistive\nstate. We show that the dependence $\\delta F_{thr}(I)\\propto\nI_{dep}\\hbar(1-I/I_{dep})^{5/4}/e$, found by Langer and Ambegaokar for a long\nbridge with length $L \\gg \\xi$, holds far below the critical temperature both\nin dirty and clean limits (here $I_{dep}$ is the depairing current of the\nbridge and $\\xi$ is a coherence length). We also find that even 'weak' local\ndefect (leading to the small suppression of the critical current of the bridge\n$I_c \\lesssim I_{dep}$) provides $\\delta F_{thr}\\propto\nI_c\\hbar(1-I/I_c)^{3/2}/e$, typical for a short bridge with $L \\ll \\xi$ or a\nJosephson junction.\n",
"title": "Threshold fluctuations in a superconducting current-carrying bridge"
}
| null | null | null | null | true | null |
14464
| null |
Default
| null | null |
null |
{
"abstract": " Excitation of waves in a three-layer acoustic wavegide is studied. The wave\nfield is presented as a sum of integrals. The summation is held over all\nwaveguide modes. The integration is performed over the temporal frequency axis.\nThe dispersion diagram of the waveguide is analytically continued, and the\nintegral is transformed by deformation of the integration contour into the\ndomain of complex frequencies. As the result, the expression for the fast\ncomponents of the signal (i.e. for the transient fields) is simplified.\nThe structure of the Riemann surface of the dispersion diagram of the\nwaveguide is studied. For this, a family of auxiliary problems indexed by the\nparameters describing the links between layers is introduced. The family\ndepends on the linking parameters analytically, and the limiting case of weak\nlinks can be solved analytically.\n",
"title": "Transient phenomena in a three-layer waveguide and the analytical structure of the dispersion diagram"
}
| null | null |
[
"Mathematics"
] | null | true | null |
14465
| null |
Validated
| null | null |
null |
{
"abstract": " In this article we introduce a simple dynamical system called symplectic\nbilliards. As opposed to usual/Birkhoff billiards, where length is the\ngenerating function, for symplectic billiards symplectic area is the generating\nfunction. We explore basic properties and exhibit several similarities, but\nalso differences of symplectic billiards to Birkhoff billiards.\n",
"title": "Introducing symplectic billiards"
}
| null | null | null | null | true | null |
14466
| null |
Default
| null | null |
null |
{
"abstract": " A filling Dehn surface in a $3$-manifold $M$ is a generically immersed\nsurface in $M$ that induces a cellular decomposition of $M$. Given a tame link\n$L$ in $M$ there is a filling Dehn sphere of $M$ that \"trivializes\"\n(\\emph{diametrically splits}) it. This allows to construct filling Dehn\nsurfaces in the coverings of $M$ branched over $L$. It is shown that one of the\nsimplest filling Dehn spheres of $S^3$ (Banchoff's sphere) diametrically splits\nthe trefoil knot. Filling Dehn spheres, and their Johansson diagrams, are\nconstructed for the coverings of $S^3$ branched over the trefoil. The\nconstruction is explained in detail. Johansson diagrams for generic cyclic\ncoverings and for the simplest locally cyclic and irregular ones are\nconstructed explicitly, providing new proofs of known results about cyclic\ncoverings and the $3$-fold irregular covering over the trefoil.\n",
"title": "Banchoff's sphere and branched covers over the trefoil"
}
| null | null | null | null | true | null |
14467
| null |
Default
| null | null |
null |
{
"abstract": " Most information spreading models consider that all individuals are identical\npsychologically. They ignore, for instance, the curiosity level of people,\nwhich may indicate that they can be influenced to seek for information given\ntheir interest. For example, the game Pokémon GO spread rapidly because of\nthe aroused curiosity among users. This paper proposes an information\npropagation model considering the curiosity level of each individual, which is\na dynamical parameter that evolves over time. We evaluate the efficiency of our\nmodel in contrast to traditional information propagation models, like SIR or\nIC, and perform analysis on different types of artificial and real-world\nnetworks, like Google+, Facebook, and the United States roads map. We present a\nmean-field approach that reproduces with a good accuracy the evolution of\nmacroscopic quantities, such as the density of stiflers, for the system's\nbehavior with the curiosity. We also obtain an analytical solution of the\nmean-field equations that allows to predicts a transition from a phase where\nthe information remains confined to a small number of users to a phase where it\nspreads over a large fraction of the population. The results indicate that the\ncuriosity increases the information spreading in all networks as compared with\nthe spreading without curiosity, and that this increase is larger in spatial\nnetworks than in social networks. When the curiosity is taken into account, the\nmaximum number of informed individuals is reached close to the transition\npoint. Since curious people are more open to a new product, concepts, and\nideas, this is an important factor to be considered in propagation modeling.\nOur results contribute to the understanding of the interplay between diffusion\nprocess and dynamical heterogeneous transmission in social networks.\n",
"title": "The Impact of Social Curiosity on Information Spreading on Networks"
}
| null | null | null | null | true | null |
14468
| null |
Default
| null | null |
null |
{
"abstract": " We show that under a low complexity condition on the gradient of a\nHamiltonian, Gibbs distributions on the Boolean hypercube are approximate\nmixtures of product measures whose probability vectors are critical points of\nan associated mean-field functional. This extends a previous work by the first\nauthor. As an application, we demonstrate how this framework helps characterize\nboth Ising models satisfying a mean-field condition and the conditional\ndistributions which arise in the emerging theory of nonlinear large deviations,\nboth in the dense case and in the polynomially-sparse case.\n",
"title": "Decomposition of mean-field Gibbs distributions into product measures"
}
| null | null | null | null | true | null |
14469
| null |
Default
| null | null |
null |
{
"abstract": " Under very general conditions it is shown that if $A$ is a uniform algebra\ngenerated by real-analytic functions, then either $A$ consists of all\ncontinuous functions or else there exists a disc on which every function in $A$\nis holomorphic. This strengthens several earlier results concerning uniform\nalgebras generated by real-analytic functions.\n",
"title": "Analytic Discs and Uniform Algebras on Real-Analytic Varieties"
}
| null | null |
[
"Mathematics"
] | null | true | null |
14470
| null |
Validated
| null | null |
null |
{
"abstract": " We report an easy and versatile route for the synthesis of the parent phase\nof newest superconducting wonder material i.e. p-Terphenyl. Doped p-terphenyl\nhas recently shown superconductivity with transition temperature as high as\n120K. For crystal growth, the commercially available p-Terphenyl powder is\npelletized, encapsulated in evacuated (10-4 Torr) quartz tube and subjected to\nhigh temperature (260C) melt followed by slow cooling at 5C/hour. Simple\ntemperature controlled heating furnace is used during the process. The obtained\ncrystal is one piece, shiny and plate like. Single crystal surface XRD (X-ray\nDiffraction) showed unidirectional (00l) lines, indicating that the crystal is\ngrown along c-direction. Powder XRD of the specimen showed that as grown\np-Terphenyl is crystallized in monoclinic structure with space group P21/a\nspace group, having lattice parameters a = 8.08(2) A, b = 5.62(5) A and c=\n13.58(3) A. Scanning electron microscopy (SEM) pictures of the crystal showed\nclear layered slab like growth without any visible contamination from oxygen.\nCharacteristic reported Raman active modes related to C-C-C bending, C-H\nbending, C-C stretching and C-H stretching vibrations are seen clearly for the\nstudied p-Terphenyl crystal. The physical properties of crystal are yet\nunderway. The short letter reports an easy and versatile crystal growth method\nfor obtaining quality p-terphenyl. The same growth method may probably be\napplied to doped p-terphenyl and to subsequently achieve superconductivity to\nthe tune of as high 120K for the newest superconductivity wonder i.e., High Tc\nOraganic Superconductor (HTOS).\n",
"title": "Novel solid state vacuum quartz encapsulated growth of p-Terphenyl: the parent High Tc Oraganic Superconductor (HTOS)"
}
| null | null | null | null | true | null |
14471
| null |
Default
| null | null |
null |
{
"abstract": " This paper is intended to be a further step through our Killing spinor\nprogramme started with Class. Quantum Grav. \\textbf{32}, 175007 (2015), and we\nwill advance our programme in accordance with the road map recently given in\narXiv:1611.04424v2. In the latter reference many open problems were declared,\none of which contained the uncovered relations between specific spinors in\nspacetime represented by an arrow diagram built upon them. This work deals with\none of the arrows with almost all of its details and ends up with an important\nphysical interpretation of this setup in terms of the quantum electrodynamical\npair annihilation process. This method will shed light on the classification of\npseudo-Riemannian manifolds admitting twistors in connection with the\nclassification problem related to Killing spinors. Many physical\ninterpretations are given during the text some of which include dynamics of\nbrane immersions, quantum field theoretical considerations and black hole\nevaporation.\n",
"title": "Twistors from Killing Spinors alias Radiation from Pair Annihilation I: Theoretical Considerations"
}
| null | null | null | null | true | null |
14472
| null |
Default
| null | null |
null |
{
"abstract": " One of the main advantages of Prolog is its potential for the implicit\nexploitation of parallelism and, as a high-level language, Prolog is also often\nused as a means to explicitly control concurrent tasks. Tabling is a powerful\nimplementation technique that overcomes some limitations of traditional Prolog\nsystems in dealing with recursion and redundant sub-computations. Given these\nadvantages, the question that arises is if tabling has also the potential for\nthe exploitation of concurrency/parallelism. On one hand, tabling still\nexploits a search space as traditional Prolog but, on the other hand, the\nconcurrent model of tabling is necessarily far more complex since it also\nintroduces concurrency on the access to the tables. In this paper, we summarize\nYap's main contributions to concurrent tabled evaluation and we describe the\ndesign and implementation challenges of several alternative table space designs\nfor implicit and explicit concurrent tabled evaluation which represent\ndifferent trade-offs between concurrency and memory usage. We also motivate for\nthe advantages of using fixed-size and lock-free data structures, elaborate on\nthe key role that the engine's memory allocator plays on such environments, and\ndiscuss how Yap's mode-directed tabling support can be extended to concurrent\nevaluation. Finally, we present our future perspectives towards an efficient\nand novel concurrent framework which integrates both implicit and explicit\nconcurrent tabled evaluation in a single Prolog engine. Under consideration in\nTheory and Practice of Logic Programming (TPLP).\n",
"title": "Table Space Designs For Implicit and Explicit Concurrent Tabled Evaluation"
}
| null | null | null | null | true | null |
14473
| null |
Default
| null | null |
null |
{
"abstract": " Superconductivity was recently observed in CrAs as the helimagnetic order is\nsuppressed by applying pressure, suggesting possible unconventional\nsuperconductivity. To reveal the nature of the superconducting order parameter\nof CrAs, here we report the angular dependence of the upper critical field\nunder pressure. Upon rotating the field by 360 degrees in the $bc$-plane, six\nmaxima are observed in the upper critical field, where the oscillations have\nboth six-fold and two-fold symmetric components. Our analysis suggests the\npresence of an unconventional odd-parity spin triplet state.\n",
"title": "Evidence for triplet superconductivity near an antiferromagnetic instability in CrAs"
}
| null | null | null | null | true | null |
14474
| null |
Default
| null | null |
null |
{
"abstract": " We present the synthesis and a detailed investigation of structural and\nmagnetic properties of polycrystalline\nNH$_4$[(V$_2$O$_3$)$_2$(4,4$^\\prime$-$bpy$)$_2$(H$_2$PO$_4$)(PO$_4$)$_2$]$\\cdot$0.5H$_2$O\nby means of x-ray diffraction, magnetic susceptibility, electron spin\nresonance, and $^{31}$P nuclear magnetic resonance measurements. Temperature\ndependent magnetic susceptibility could be described well using a weakly\ncoupled spin-$1/2$ dimer model with an excitation gap $\\Delta/k_{\\rm B}\\simeq\n26.1$ K between the singlet ground state and triplet excited states and a weak\ninter-dimer exchange coupling $J^\\prime/k_{\\rm B} \\simeq 4.6$ K. A gapped chain\nmodel also describes the data well with a gap of about 20 K. The ESR intensity\nas a function of temperature traces the bulk susceptibility nicely. The\nisotropic Land$\\acute{\\rm e}$ $g$-factor is estimated to be about $g \\simeq\n1.97$, at room temperature. We are able to resolve the $^{31}$P NMR signal as\ncoming from two inequivalent P-sites in the crystal structure. The hyperfine\ncoupling constant between $^{31}$P nucleus and V$^{4+}$ spins is calculated to\nbe $A_{\\rm hf}(1) \\simeq 2963$ Oe/$\\mu_{\\rm B}$ and $A_{\\rm hf}(2) \\simeq 1466$\nOe/$\\mu_{\\rm B}$ for the P(1) and P(2) sites, respectively. Our NMR shift and\nspin-lattice relaxation rate for both the $^{31}$P sites show an activated\nbehaviour at low temperatures, further confirming the singlet ground state. The\nestimated value of the spin gap from the NMR data measured in an applied field\nof $H = 9.394$ T is consistent with the gap obtained from the magnetic\nsusceptibility analysis using the dimer model. Because of a relatively small\nspin gap,\nNH$_4$[(V$_2$O$_3$)$_2$(4,4$^\\prime$-$bpy$)$_2$(H$_2$PO$_4$)(PO$_4$)$_2$]$\\cdot$0.5H$_2$O\nis a promising compound for further experimental studies under high magnetic\nfields.\n",
"title": "Singlet ground state in the spin-$1/2$ weakly coupled dimer compound NH$_4$[(V$_2$O$_3$)$_2$(4,4$^\\prime$-$bpy$)$_2$(H$_2$PO$_4$)(PO$_4$)$_2$]$\\cdot$0.5H$_2$O"
}
| null | null | null | null | true | null |
14475
| null |
Default
| null | null |
null |
{
"abstract": " In this paper we focus our attention on the exploitation of the information\ncontained in financial news to enhance the performance of a classifier of bank\ndistress. Such information should be analyzed and inserted into the predictive\nmodel in the most efficient way and this task deals with all the issues related\nto text analysis and specifically analysis of news media. Among the different\nmodels proposed for such purpose, we investigate one of the possible deep\nlearning approaches, based on a doc2vec representation of the textual data, a\nkind of neural network able to map the sequential and symbolic text input onto\na reduced latent semantic space. Afterwards, a second supervised neural network\nis trained combining news data with standard financial figures to classify\nbanks whether in distressed or tranquil states, based on a small set of known\ndistress events. Then the final aim is not only the improvement of the\npredictive performance of the classifier but also to assess the importance of\nnews data in the classification process. Does news data really bring more\nuseful information not contained in standard financial variables? Our results\nseem to confirm such hypothesis.\n",
"title": "Deep learning bank distress from news and numerical financial data"
}
| null | null |
[
"Computer Science",
"Statistics"
] | null | true | null |
14476
| null |
Validated
| null | null |
null |
{
"abstract": " We investigate superconductivity that may exist in the doped BaCoSO, a\nmulti-orbital Mott insulator with a strong antiferromagnetic ground state. The\nsuperconductivity is studied in both t-J type and Hubbard type multi-orbital\nmodels by mean field approach and random phase approximation (RPA) analysis.\nEven if there is no C4 rotational symmetry, it is found that the system still\ncarries a d-wave like pairing symmetry state with gapless nodes and sign\nchanged superconducting order parameters on Fermi surfaces. The results are\nlargely doping insensitive. In this superconducting state, the three t2g\norbitals have very different superconducting form factors in momentum space. In\nparticular, the intra-orbital pairing of the dx2-y2 orbital has a s-wave like\npairing form factor. The two methods also predict very different pairing\nstrength on different parts of Fermi surfaces.These results suggest that BaCoSO\nand related materials can be a new ground to test and establish fundamental\nprinciples for unconventional high temperature superconductivity.\n",
"title": "Theoretical studies of superconductivity in doped BaCoSO"
}
| null | null |
[
"Physics"
] | null | true | null |
14477
| null |
Validated
| null | null |
null |
{
"abstract": " Relativizing computations of Turing machines to an oracle is a central\nconcept in the theory of computation, both in complexity theory and in\ncomputability theory(!). Inspired by lowness notions from computability theory,\nAllender introduced the concept of \"low for speed\" oracles. An oracle A is low\nfor speed if relativizing to A has essentially no effect on computational\ncomplexity, meaning that if a decidable language can be decided in time $f(n)$\nwith access to oracle A, then it can be decided in time poly(f(n)) without any\noracle. The existence of non-computable such A's was later proven by Bayer and\nSlaman, who even constructed a computably enumerable one, and exhibited a\nnumber of properties of these oracles as well as interesting connections with\ncomputability theory. In this paper, we pursue this line of research, answering\nthe questions left by Bayer and Slaman and give further evidence that the\nstructure of the class of low for speed oracles is a very rich one.\n",
"title": "On low for speed oracles"
}
| null | null | null | null | true | null |
14478
| null |
Default
| null | null |
null |
{
"abstract": " Electrical conductivity and high dielectric constant are in principle\nself-excluding, which makes the terms insulator and dielectric usually\nsynonymous. This is certainly true when the electrical carriers are electrons,\nbut not necessarily in a material where ions are extremely mobile, electronic\nconduction is negligible and the charge transfer at the interface is\nimmaterial. Here we demonstrate in a perovskite-derived structure containing\nfive-coordinated Ti atoms, a colossal dielectric constant (up to $\\mbox{10}^9$)\ntogether with very high ionic conduction $\\mbox{10}^{-3}\\mbox{S.cm}^{-1}$ at\nroom temperature. Coupled investigations of I-V and dielectric constant\nbehavior allow to demonstrate that, due to ion migration and accumulation, this\nmaterial behaves like a giant dipole, exhibiting colossal electrical\npolarization (of the order of $\\mbox{0.1\\,C.cm}^{-2}$). Therefore, it may be\nconsidered as a \"ferro-ionet\" and is extremely promising in terms of\napplications.\n",
"title": "$\\mbox{Rb}_{2}\\mbox{Ti}_2\\mbox{O}_{5-δ}$: A superionic conductor with colossal dielectric constant"
}
| null | null | null | null | true | null |
14479
| null |
Default
| null | null |
null |
{
"abstract": " Which of your team's possible lineups has the best chances against each of\nyour opponents possible lineups? In order to answer this question we develop\nLinNet. LinNet exploits the dynamics of a directed network that captures the\nperformance of lineups at their matchups. The nodes of this network represent\nthe different lineups, while an edge from node j to node i exists if lineup i\nhas outperformed lineup j. We further annotate each edge with the corresponding\nperformance margin (point margin per minute). We then utilize this structure to\nlearn a set of latent features for each node (i.e., lineup) using the node2vec\nframework. Consequently, LinNet builds a model on this latent space for the\nprobability of lineup A beating lineup B. We evaluate LinNet using NBA lineup\ndata from the five seasons between 2007-08 and 2011-12. Our results indicate\nthat our method has an out-of-sample accuracy of 69%. In comparison, utilizing\nthe adjusted plus-minus of the players within a lineup for the same prediction\nproblem provides an accuracy of 56%. More importantly, the probabilities are\nwell-calibrated as shown by the probability validation curves. One of the\nbenefits of LinNet - apart from its accuracy - is that it is generic and can be\napplied in different sports since the only input required is the lineups'\nmatchup performances, i.e., not sport-specific features are needed.\n",
"title": "LinNet: Probabilistic Lineup Evaluation Through Network Embedding"
}
| null | null | null | null | true | null |
14480
| null |
Default
| null | null |
null |
{
"abstract": " Observability of complex systems/networks is the focus of this paper, which\nis shown to be closely related to the concept of contraction. Indeed, for\nobservable network tracking it is necessary/sufficient to have one node in each\ncontraction measured. Therefore, nodes in a contraction are equivalent to\nrecover for loss of observability, implying that contraction size is a key\nfactor for observability recovery. Here, using a polynomial order contraction\ndetection algorithm, we analyze the distribution of contractions, studying its\nrelation with key network properties. Our results show that contraction size is\nrelated to network clustering coefficient and degree heterogeneity.\nParticularly, in networks with power-law degree distribution, if the clustering\ncoefficient is high there are less contractions with smaller size on average.\nThe implication is that estimation/tracking of such systems requires less\nnumber of measurements, while their observational recovery is more restrictive\nin case of sensor failure. Further, in Small-World networks higher degree\nheterogeneity implies that there are more contractions with smaller size on\naverage. Therefore, the estimation of representing system requires more\nmeasurements, and also the recovery of measurement failure is more limited.\nThese results imply that one can tune the properties of synthetic networks to\nalleviate their estimation/observability recovery.\n",
"title": "Observational Equivalence in System Estimation: Contractions in Complex Networks"
}
| null | null |
[
"Computer Science"
] | null | true | null |
14481
| null |
Validated
| null | null |
null |
{
"abstract": " Continuous appearance shifts such as changes in weather and lighting\nconditions can impact the performance of deployed machine learning models.\nWhile unsupervised domain adaptation aims to address this challenge, current\napproaches do not utilise the continuity of the occurring shifts. In\nparticular, many robotics applications exhibit these conditions and thus\nfacilitate the potential to incrementally adapt a learnt model over minor\nshifts which integrate to massive differences over time. Our work presents an\nadversarial approach for lifelong, incremental domain adaptation which benefits\nfrom unsupervised alignment to a series of intermediate domains which\nsuccessively diverge from the labelled source domain. We empirically\ndemonstrate that our incremental approach improves handling of large appearance\nchanges, e.g. day to night, on a traversable-path segmentation task compared\nwith a direct, single alignment step approach. Furthermore, by approximating\nthe feature distribution for the source domain with a generative adversarial\nnetwork, the deployment module can be rendered fully independent of retaining\npotentially large amounts of the related source training data for only a minor\nreduction in performance.\n",
"title": "Incremental Adversarial Domain Adaptation for Continually Changing Environments"
}
| null | null | null | null | true | null |
14482
| null |
Default
| null | null |
null |
{
"abstract": " We present our implementation of an automated VLBI data reduction pipeline\ndedicated to interferometric data imaging and analysis. The pipeline can handle\nmassive VLBI data efficiently which makes it an appropriate tool to investigate\nmulti-epoch multiband VLBI data. Compared to traditional manual data reduction,\nour pipeline provides more objective results since less human interference is\ninvolved. Source extraction is done in the image plane, while deconvolution and\nmodel fitting are done in both the image plane and the uv plane for parallel\ncomparison. The output from the pipeline includes catalogues of CLEANed images\nand reconstructed models, polarisation maps, proper motion estimates, core\nlight curves and multi-band spectra. We have developed a regression strip\nalgorithm to automatically detect linear or non-linear patterns in the jet\ncomponent trajectories. This algorithm offers an objective method to match jet\ncomponents at different epochs and determine their proper motions.\n",
"title": "SAND: An automated VLBI imaging and analysing pipeline - I. Stripping component trajectories"
}
| null | null | null | null | true | null |
14483
| null |
Default
| null | null |
null |
{
"abstract": " We investigate the time evolution towards the asymptotic steady state of a\none dimensional interacting system after a quantum quench. We show that at\nfinite time the latter induces entanglement between right- and left- moving\ndensity excitations, encoded in their cross-correlators, which vanishes in the\nlong-time limit. This behavior results in a universal time-decay in system\nspectral properties $ \\propto t^{-2} $, in addition to non-universal power-law\ncontributions typical of Luttinger liquids. Importantly, we argue that the\npresence of quench-induced entanglement clearly emerges in transport\nproperties, such as charge and energy currents injected in the system from a\nbiased probe, and determines their long-time dynamics. In particular, energy\nfractionalization phenomenon turns out to be a promising platform to observe\nthe universal power-law decay $ \\propto t^{-2} $ induced by entanglement and\nrepresents a novel way to study the corresponding relaxation mechanism.\n",
"title": "Quench-induced entanglement and relaxation dynamics in Luttinger liquids"
}
| null | null | null | null | true | null |
14484
| null |
Default
| null | null |
null |
{
"abstract": " Coded caching scheme, which is an effective technique to increase the\ntransmission efficiency during peak traffic times, has recently become quite\npopular among the coding community. Generally rate can be measured to the\ntransmission in the peak traffic times, i.e., this efficiency increases with\nthe decreasing of rate. In order to implement a coded caching scheme, each file\nin the library must be split in a certain number of packets. And this number\ndirectly reflects the complexity of a coded caching scheme, i.e., the\ncomplexity increases with the increasing of the packet number. However there\nexists a tradeoff between the rate and packet number. So it is meaningful to\ncharacterize this tradeoff and design the related Pareto-optimal coded caching\nschemes with respect to both parameters.\nRecently, a new concept called placement delivery array (PDA) was proposed to\ncharacterize the coded caching scheme. However as far as we know no one has yet\nproved that one of the previously known PDAs is Pareto-optimal. In this paper,\nwe first derive two lower bounds on the rate under the framework of PDA.\nConsequently, the PDA proposed by Maddah-Ali and Niesen is Pareto-optimal, and\na tradeoff between rate and packet number is obtained for some parameters.\nThen, from the above observations and the view point of combinatorial design,\ntwo new classes of Pareto-optimal PDAs are obtained. Based on these PDAs, the\nschemes with low rate and packet number are obtained. Finally the performance\nof some previously known PDAs are estimated by comparing with these two classes\nof schemes.\n",
"title": "Coded Caching Schemes with Low Rate and Subpacketizations"
}
| null | null | null | null | true | null |
14485
| null |
Default
| null | null |
null |
{
"abstract": " Online learning with streaming data in a distributed and collaborative manner\ncan be useful in a wide range of applications. This topic has been receiving\nconsiderable attention in recent years with emphasis on both single-task and\nmultitask scenarios. In single-task adaptation, agents cooperate to track an\nobjective of common interest, while in multitask adaptation agents track\nmultiple objectives simultaneously. Regularization is one useful technique to\npromote and exploit similarity among tasks in the latter scenario. This work\nexamines an alternative way to model relations among tasks by assuming that\nthey all share a common latent feature representation. As a result, a new\nmultitask learning formulation is presented and algorithms are developed for\nits solution in a distributed online manner. We present a unified framework to\nanalyze the mean-square-error performance of the adaptive strategies, and\nconduct simulations to illustrate the theoretical findings and potential\napplications.\n",
"title": "Multitask diffusion adaptation over networks with common latent representations"
}
| null | null | null | null | true | null |
14486
| null |
Default
| null | null |
null |
{
"abstract": " We report on the perpendicular magnetic anisotropy (PMA) behavior of heavy\nmetal (HM)/ Fe alloy/MgO thin film heterostructures after an ultrathin HfO2\npassivation layer is inserted between the Fe alloy and the MgO. This is\naccomplished by depositing one to two atomic layers of Hf onto the Fe alloy\nbefore the subsequent rf sputter deposition of the MgO layer. This Hf layer is\nfully oxidized during the subsequent deposition of the MgO layer, as confirmed\nby X-ray photoelectron spectroscopy measurements. As the result a strong\ninterfacial perpendicular anisotropy energy density can be achieved without any\npost-fabrication annealing treatment, for example 1.7 erg/cm^2 for the\nTa/Fe60Co20B20/HfO2/MgO heterostructure. Depending on the HM, further\nenhancements of the PMA can be realized by thermal annealing to at least 400C.\nWe show that ultra-thin HfO2 layers offer a range of options for enhancing the\nmagnetic properties of magnetic heterostructures for spintronics applications.\n",
"title": "Strong perpendicular magnetic anisotropy energy density at Fe alloy/HfO2 interfaces"
}
| null | null | null | null | true | null |
14487
| null |
Default
| null | null |
null |
{
"abstract": " We investigate the universal cover of a topological group that is not\nnecessarily connected. Its existence as a topological group is governed by a\nTaylor cocycle, an obstruction in 3-cohomology. Alternatively, it always exists\nas a topological 2-group. The splitness of this 2-group is also governed by an\nobstruction in 3-cohomology, a Sinh cocycle. We give explicit formulas for both\nobstructions and show that they are inverse of each other.\n",
"title": "Covering Groups of Nonconnected Topological Groups and 2-Groups"
}
| null | null | null | null | true | null |
14488
| null |
Default
| null | null |
null |
{
"abstract": " Synchrotron emitting bubbles arise when the outflow from a compact\nrelativistic engine, either a Black Hole or a Neutron Star, impacts on the\nenvironment. The emission properties of synchrotron radiation are widely used\nto infer the dynamical properties of these bubbles, and from them the injection\nconditions of the engine. Radio polarization offers an important tool to\ninvestigate the level and spectrum of turbulence, the magnetic field\nconfiguration, and possibly the degree of mixing. Here we introduce a formalism\nbased on Chandrasekhar-Kendall functions that allows us to properly take into\naccount the geometry of the bubble, going beyond standard analysis based on\nperiodic cartesian domains. We investigate how different turbulent spectra,\nmagnetic helicity and particle distribution function, impact on global\nproperties that are easily accessible to observations, even at low resolution,\nand we provide fitting formulae to relate observed quantities to the underlying\nmagnetic field structure.\n",
"title": "Polarization properties of turbulent synchrotron bubbles: an approach based on Chandrasekhar-Kendall functions"
}
| null | null | null | null | true | null |
14489
| null |
Default
| null | null |
null |
{
"abstract": " Efimov effect refers to quantum states with discrete scaling symmetry and a\nuniversal scaling factor, and has attracted considerable interests from nuclear\nto atomic physics communities. In a Dirac semi-metal, when an electron\ninteracts with a static impurity though a Coulomb interaction, the same scaling\nof the kinetic and interaction energies also gives rise to such a Efimov\neffect. However, even when the Fermi energy exactly lies at the Dirac point,\nthe vacuum polarization of electron-hole pair fluctuation can still screen the\nCoulomb interaction, which leads to derivation from this scaling symmetry and\neventually breakdown of the Efimov effect. This distortion of the Efimov bound\nstate energy due to vacuum polarization is a relativistic electron analogy of\nthe Lamb shift for the hydrogen atom. Motivated by recent experimental\nobservations in two- and three-dimensional Dirac semi-metals, in this paper we\ninvestigate this many-body correction to the Efimov effect, and answer the\nquestion that under what condition a good number of Efimov-like bound states\ncan still be observed in these condensed matter experiments.\n",
"title": "Efimov Effect in the Dirac Semi-metals"
}
| null | null | null | null | true | null |
14490
| null |
Default
| null | null |
null |
{
"abstract": " An edited version is given of the text of Gödel's unpublished manuscript of\nthe notes for a course in basic logic he delivered at the University of Notre\nDame in 1939. Gödel's notes deal with what is today considered as important\nlogical problems par excellence, completeness, decidability, independence of\naxioms, and with natural deduction too, which was all still a novelty at the\ntime the course was delivered. Full of regards towards beginners, the notes are\nnot excessively formalistic. Gödel presumably intended them just for himself,\nand they are full of abbreviations. This together with some other matters (like\ntwo versions of the same topic, and guessing the right order of the pages)\nrequired additional effort to obtain a readable edited version. Because of the\nquality of the material provided by Gödel, including also important\nphilosophical points, this effort should however be worthwhile. The edited\nversion of the text is accompanied by another version, called the source\nversion, which is quite close to Gödel's manuscript. It is meant to be a\nrecord of the editorial interventions involved in producing the edited version\n(in particular, how the abbreviations were disabridged), and a justification of\nthat later version.\n",
"title": "Logic Lectures: Gödel's Basic Logic Course at Notre Dame"
}
| null | null | null | null | true | null |
14491
| null |
Default
| null | null |
null |
{
"abstract": " In this paper, we present temperature and field dependent neutron diffraction\n(ND) study to unravel the structural and the magnetic properties in\nNi50Mn38Sb12 Heusler system. This alloy shows martensitic transition from high\ntemperature austenite cubic phase to low temperature martensite orthorhombic\nphase on cooling. At 3 K, the lattice parameters and magnetic moments are found\nto be almost insensitive to field. Just below the martensitic transition\ntemperature, the martensite phase fraction is found to be 85%. Upon applying\nthe field, the austenite phase becomes dominant, and the field induced reverse\nmartensitic transition is clearly observed in the ND data. Therefore, the\npresent study gives an estimate of the strength of the martensite phase or the\nsharpness of the martensitic transition. Variation of individual moments and\nthe change in the phase fraction obtained from the analysis of the ND data\nvividly show the change in the magneto-structural state of the material across\nthe transition.\n",
"title": "Field dependent neutron diffraction study in Ni50Mn38Sb12 Heusler alloy"
}
| null | null | null | null | true | null |
14492
| null |
Default
| null | null |
null |
{
"abstract": " Minimax lower bounds are pessimistic in nature: for any given estimator,\nminimax lower bounds yield the existence of a worst-case target vector\n$\\beta^*_{worst}$ for which the prediction error of the given estimator is\nbounded from below. However, minimax lower bounds shed no light on the\nprediction error of the given estimator for target vectors different than\n$\\beta^*_{worst}$. A characterization of the prediction error of any convex\nregularized least-squares is given. This characterization provide both a lower\nbound and an upper bound on the prediction error. This produces lower bounds\nthat are applicable for any target vector and not only for a single, worst-case\n$\\beta^*_{worst}$. Finally, these lower and upper bounds on the prediction\nerror are applied to the Lasso is sparse linear regression. We obtain a lower\nbound involving the compatibility constant for any tuning parameter, matching\nupper and lower bounds for the universal choice of the tuning parameter, and a\nlower bound for the Lasso with small tuning parameter.\n",
"title": "Optimistic lower bounds for convex regularized least-squares"
}
| null | null | null | null | true | null |
14493
| null |
Default
| null | null |
null |
{
"abstract": " Humans and animals have the ability to continually acquire, fine-tune, and\ntransfer knowledge and skills throughout their lifespan. This ability, referred\nto as lifelong learning, is mediated by a rich set of neurocognitive mechanisms\nthat together contribute to the development and specialization of our\nsensorimotor skills as well as to the long-term memory consolidation and\nretrieval without catastrophic forgetting. Consequently, lifelong learning\ncapabilities are crucial for autonomous agents interacting in the real world\nand processing continuous streams of information. However, lifelong learning\nremains a long-standing challenge for machine learning and neural network\nmodels since the continual acquisition of incrementally available information\nfrom non-stationary data distributions generally leads to catastrophic\nforgetting or interference. This limitation represents a major drawback for\nstate-of-the-art deep neural network models that typically learn\nrepresentations from stationary batches of training data, thus without\naccounting for situations in which information becomes incrementally available\nover time. In this review, we critically summarize the main challenges linked\nto lifelong learning for artificial learning systems and compare existing\nneural network approaches that alleviate, to different extents, catastrophic\nforgetting. We discuss well-established and emerging research motivated by\nlifelong learning factors in biological systems such as structural plasticity,\nmemory replay, curriculum and transfer learning, intrinsic motivation, and\nmultisensory integration.\n",
"title": "Continual Lifelong Learning with Neural Networks: A Review"
}
| null | null |
[
"Statistics",
"Quantitative Biology"
] | null | true | null |
14494
| null |
Validated
| null | null |
null |
{
"abstract": " Z^d-extensions of probability-preserving dynamical systems are themselves\ndynamical systems preserving an infinite measure, and generalize random walks.\nUsing the method of moments, we prove a generalized central limit theorem for\nadditive functionals of the extension of integral zero, under spectral\nassumptions. As a corollary, we get the fact that Green-Kubo's formula is\ninvariant under induction. This allows us to relate the hitting probability of\nsites with the symmetrized potential kernel, giving an alternative proof and\ngeneralizing a theorem of Spitzer. Finally, this relation is used to improve in\nturn the asumptions of the generalized central limit theorem. Applications to\nLorentz gases in finite horizon and to the geodesic flow on abelian covers of\ncompact manifolds of negative curvature are discussed.\n",
"title": "Potential kernel, hitting probabilities and distributional asymptotics"
}
| null | null | null | null | true | null |
14495
| null |
Default
| null | null |
null |
{
"abstract": " The use of renewable energy sources is a major strategy to mitigate climate\nchange. Yet Sinn (2017) argues that excessive electrical storage requirements\nlimit the further expansion of variable wind and solar energy. We question, and\nalter, strong implicit assumptions of Sinn's approach and find that storage\nneeds are considerably lower, up to two orders of magnitude. First, we move\naway from corner solutions by allowing for combinations of storage and\nrenewable curtailment. Second, we specify a parsimonious optimization model\nthat explicitly considers an economic efficiency perspective. We conclude that\nelectrical storage is unlikely to limit the transition to renewable energy.\n",
"title": "On the economics of electrical storage for variable renewable energy sources"
}
| null | null | null | null | true | null |
14496
| null |
Default
| null | null |
null |
{
"abstract": " As companies increase their efforts in retaining customers, being able to\npredict accurately ahead of time, whether a customer will churn in the\nforeseeable future is an extremely powerful tool for any marketing team. The\npaper describes in depth the application of Deep Learning in the problem of\nchurn prediction. Using abstract feature vectors, that can generated on any\nsubscription based company's user event logs, the paper proves that through the\nuse of the intrinsic property of Deep Neural Networks (learning secondary\nfeatures in an unsupervised manner), the complete pipeline can be applied to\nany subscription based company with extremely good churn predictive\nperformance. Furthermore the research documented in the paper was performed for\nFramed Data (a company that sells churn prediction as a service for other\ncompanies) in conjunction with the Data Science Institute at Lancaster\nUniversity, UK. This paper is the intellectual property of Framed Data.\n",
"title": "Deep Learning in Customer Churn Prediction: Unsupervised Feature Learning on Abstract Company Independent Feature Vectors"
}
| null | null |
[
"Computer Science",
"Statistics"
] | null | true | null |
14497
| null |
Validated
| null | null |
null |
{
"abstract": " The recent observation of discrepancies in the muonic sector motivates\nsearches for the yet undiscovered atom true muonium $(\\mu^+\\mu^-)$. To leverage\npotential experimental signals, precise theoretical calculations are required.\nI will present the on-going work to compute higher-order corrections to the\nhyperfine splitting and the Lamb shift. Further, possible detection in rare\nmeson decay experiments like REDTOP and using true muonium production to\nconstrain mesonic form factors will be discussed.\n",
"title": "Predicting and Discovering True Muonium"
}
| null | null |
[
"Physics"
] | null | true | null |
14498
| null |
Validated
| null | null |
null |
{
"abstract": " Half-metallic properties of TlCrS2, TlCrSe2 and hypothetical TlCrSSe have\nbeen investigated by first-principles all-electron full-potential linearized\naugmented plane wave plus local orbital (FP-LAPW+lo) method based on density\nfunctional theory (DFT). The results of calculations show that TlCrS2 and\nTlCrSSe are half-metals with energy gap (Eg ) ~0.12 ev for spin-down channel.\nStrong hybridization of p-state of chalchogen and d-state of Cr leads to\nbonding and antibonding states and subsequently to the appearance of a gap in\nspin-down channel of TlCrS2 and TlCrSSe. In the case of TlCrSe2, there is a\npartial hybridization and p-state is partially present in the DOS at Fermi\nlevel making this compound nearly half- metallic. The present calculations\nrevealed that total magnetic moment keeps its integer value on a relatively\nwide range of changes in volume (-10% 10%) for TlCrS2 and TlCrSSe, while total\nmagnetic moment of TlCrSe2 decreases with increasing volume approaching to\ninteger value 3{\\mu}B.\n",
"title": "Prediction of half-metallic properties in TlCrS2 and TlCrSe2 based on density functional theory"
}
| null | null |
[
"Physics"
] | null | true | null |
14499
| null |
Validated
| null | null |
null |
{
"abstract": " We study interfacial magnetocrystalline anisotropies in various\nFe/semiconductor heterostructures by means of first-principles calculations. We\nfind that many of those systems show perpendicular magnetic anisotropy (PMA)\nwith a positive value of the interfacial anisotropy constant $K_{\\rm i}$. In\nparticular, the Fe/CuInSe$_2$ interface has a large $K_{\\rm i}$ of $\\sim\n2.3\\,{\\rm mJ/m^2}$, which is about 1.6 times larger than that of Fe/MgO known\nas a typical system with relatively large PMA. We also find that the values of\n$K_{\\rm i}$ in almost all the systems studied in this work follow the\nwell-known Bruno's relation, which indicates that minority-spin states around\nthe Fermi level provide dominant contributions to the interfacial\nmagnetocrystalline anisotropies. Detailed analyses of the local density of\nstates and wave-vector-resolved anisotropy energy clarify that the large\n$K_{\\rm i}$ in Fe/CuInSe$_2$ is attributed to the preferable $3d$-orbital\nconfigurations around the Fermi level in the minority-spin states of the\ninterfacial Fe atoms. Moreover, we have shown that the locations of interfacial\nSe atoms are the key for such orbital configurations of the interfacial Fe\natoms.\n",
"title": "Giant interfacial perpendicular magnetic anisotropy in Fe/CuIn$_{1-x}$Ga$_x$Se$_2$ beyond Fe/MgO"
}
| null | null | null | null | true | null |
14500
| null |
Default
| null | null |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.