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": " Here we detail the dynamic evolution of localised reconnection regions about\nthree-dimensional (3D) magnetic null points by using numerical simulation. We\ndemonstrate for the first time that reconnection triggered by the localised\ncollapse of a 3D null point due to an external MHD wave involves a\nself-generated oscillation, whereby the current sheet and outflow jets undergo\na reconnection reversal process during which back-pressure formation at the jet\nheads acts to prise open the collapsed field before overshooting the\nequilibrium into an opposite-polarity configuration. The discovery that\nreconnection at fully 3D nulls can proceed naturally in a time-dependent and\nperiodic fashion is suggestive that oscillatory reconnection mechanisms may\nplay a role in explaining periodicity in astrophysical phenomena associated\nwith magnetic reconnection, such as the observed quasi-periodicity of solar and\nstellar flare emission. Furthermore, we find a consequence of oscillatory\nreconnection is the generation of a plethora of freely-propagating MHD waves\nwhich escape the vicinity of the reconnection region\n",
"title": "Three-dimensional oscillatory magnetic reconnection"
} | null | null | null | null | true | null | 18401 | null | Default | null | null |
null | {
"abstract": " Most risk analysis models systematically underestimate the probability and\nimpact of catastrophic events (e.g., economic crises, natural disasters, and\nterrorism) by not taking into account interconnectivity and interdependence of\nrisks. To address this weakness, we propose the Cascading Alternating Renewal\nProcess (CARP) to forecast interconnected global risks. However, assessments of\nthe model's prediction precision are limited by lack of sufficient ground truth\ndata. Here, we establish prediction precision as a function of input data size\nby using alternative long ground truth data generated by simulations of the\nCARP model with known parameters. We illustrate the approach on a model of\nfires in artificial cities assembled from basic city blocks with diverse\nhousing. The results confirm that parameter recovery variance exhibits power\nlaw decay as a function of the length of available ground truth data. Using\nCARP, we also demonstrate estimation using a disparate dataset that also has\ndependencies: real-world prediction precision for the global risk model based\non the World Economic Forum Global Risk Report. We conclude that the CARP model\nis an efficient method for predicting catastrophic cascading events with\npotential applications to emerging local and global interconnected risks.\n",
"title": "Limits of Risk Predictability in a Cascading Alternating Renewal Process Model"
} | null | null | [
"Computer Science",
"Physics"
]
| null | true | null | 18402 | null | Validated | null | null |
null | {
"abstract": " A curve $\\theta$: $I\\to E$ in a metric space $E$ equipped with the distance\n$d$, where $I\\subset \\R$ is a (possibly unbounded) interval, is called\nself-contracted, if for any triple of instances of time $\\{t_i\\}_{i=1}^3\\subset\nI$ with $t_1\\leq t_2\\leq t_3$ one has $d(\\theta(t_3),\\theta(t_2))\\leq\nd(\\theta(t_3),\\theta(t_1))$. We prove that if $E$ is a finite-dimensional\nnormed space with an arbitrary norm, the trace of $\\theta$ is bounded, then\n$\\theta$ has finite length, i.e. is rectifiable, thus answering positively the\nquestion raised in~\\cite{Lemenant16sc-rectif}.\n",
"title": "Self-contracted curves have finite length"
} | null | null | null | null | true | null | 18403 | null | Default | null | null |
null | {
"abstract": " We consider learning of fundamental properties of communities in large noisy\nnetworks, in the prototypical situation where the nodes or users are split into\ntwo classes according to a binary property, e.g., according to their opinions\nor preferences on a topic. For learning these properties, we propose a\nnonparametric, unsupervised, and scalable graph scan procedure that is, in\naddition, robust against a class of powerful adversaries. In our setup, one of\nthe communities can fall under the influence of a knowledgeable adversarial\nleader, who knows the full network structure, has unlimited computational\nresources and can completely foresee our planned actions on the network. We\nprove strong consistency of our results in this setup with minimal assumptions.\nIn particular, the learning procedure estimates the baseline activity of normal\nusers asymptotically correctly with probability 1; the only assumption being\nthe existence of a single implicit community of asymptotically negligible\nlogarithmic size. We provide experiments on real and synthetic data to\nillustrate the performance of our method, including examples with adversaries.\n",
"title": "Unsupervised robust nonparametric learning of hidden community properties"
} | null | null | null | null | true | null | 18404 | null | Default | null | null |
null | {
"abstract": " Artificial Intelligence methods to solve continuous- control tasks have made\nsignificant progress in recent years. However, these algorithms have important\nlimitations and still need significant improvement to be used in industry and\nreal- world applications. This means that this area is still in an active\nresearch phase. To involve a large number of research groups, standard\nbenchmarks are needed to evaluate and compare proposed algorithms. In this\npaper, we propose a physical environment benchmark framework to facilitate\ncollaborative research in this area by enabling different research groups to\nintegrate their designed benchmarks in a unified cloud-based repository and\nalso share their actual implemented benchmarks via the cloud. We demonstrate\nthe proposed framework using an actual implementation of the classical\nmountain-car example and present the results obtained using a Reinforcement\nLearning algorithm.\n",
"title": "OPEB: Open Physical Environment Benchmark for Artificial Intelligence"
} | null | null | [
"Computer Science"
]
| null | true | null | 18405 | null | Validated | null | null |
null | {
"abstract": " The workhorse of atomic physics: quantum electrodynamics is one of the best\ntested theories in physics. However recent discrepancies have shed doubt on its\naccuracy for complex atomic systems. To facilitate the development of the\ntheory further we aim to measure transition dipole matrix elements of\nmetastable helium (He*) (the ideal 3 body test-bed) to the highest accuracy\nthus far. We have undertaken a measurement of the `tune-out wavelength' which\noccurs when the contributions to the dynamic polarizability from all atomic\ntransitions sum to zero; thus illuminating an atom with this wavelength of\nlight then produces no net energy shift. This provides a strict constraint on\nthe transition dipole matrix elements without the complication and inaccuracy\nof other methods.\nUsing a novel atom-laser based technique we have made the first measurement\nof the the tune-out wavelength in metastable helium between the\n$3^{3}P_{1,2,3}$ and $2^{3}P_{1,2,3}$ states at 413.07(2)nm which compares well\nwith the predicted value\\cite{Mitroy2013} of 413.02(9). We have additionally\ndeveloped many of the methods necessary to improve this measurement to the\n100fm level of accuracy where it will form the most accurate determination of\ntransition rate information ever made in He* and provide a stringent test for\natomic QED simulations. We believe this measurement to be one of the most\nsensitive ever made of an optical dipole potential, able to detect changes in\npotentials of $\\sim200pK$ and is widely applicable to other species and areas\nof atom optics.\n",
"title": "The First Measurement of the $2^{3}S_{1} \\rightarrow 3^{3}P - 2^{3}P$ Tune-Out Wavelength in He*"
} | null | null | null | null | true | null | 18406 | null | Default | null | null |
null | {
"abstract": " Feedback control theory has been extensively implemented to theoretically\nmodel human sensorimotor control. However, experimental platforms capable of\nmanipulating important components of multiple feedback loops lack development.\nThis paper describes the WheelCon, which is an open source platform aimed at\nresolving such insufficiencies. WheelCon enables safely simulation of the\ncanonical sensorimotor task such as riding a mountain bike down a steep,\ntwisting, bumpy trail etc., with provided only a computer, standard display,\nand an inexpensive gaming steering wheel with a force feedback motor. The\nplatform provides flexibility, as will be demonstrated in the demos provided,\nso that researchers may manipulate the disturbances, delay, and quantization\n(data rate) in the layered feedback loops, including a high-level advanced plan\nlayer and a low-level delayed reflex layer. In this paper, we illustrate\nWheelCon's graphical user interface (GUI), the input and output of existing\ndemos, and how to design new games. In addition, we present the basic feedback\nmodel, and we show the testing results from our demo games which align well\nwith prediction from the model. In short, the platform is featured as cheap,\nsimple to use, and flexible to program for effective sensorimotor neuroscience\nresearch and control engineering education.\n",
"title": "WheelCon: A wheel control-based gaming platform for studying human sensorimotor control"
} | null | null | [
"Quantitative Biology"
]
| null | true | null | 18407 | null | Validated | null | null |
null | {
"abstract": " Users suffering from mental health conditions often turn to online resources\nfor support, including specialized online support communities or general\ncommunities such as Twitter and Reddit. In this work, we present a neural\nframework for supporting and studying users in both types of communities. We\npropose methods for identifying posts in support communities that may indicate\na risk of self-harm, and demonstrate that our approach outperforms strong\npreviously proposed methods for identifying such posts. Self-harm is closely\nrelated to depression, which makes identifying depressed users on general\nforums a crucial related task. We introduce a large-scale general forum dataset\n(\"RSDD\") consisting of users with self-reported depression diagnoses matched\nwith control users. We show how our method can be applied to effectively\nidentify depressed users from their use of language alone. We demonstrate that\nour method outperforms strong baselines on this general forum dataset.\n",
"title": "Depression and Self-Harm Risk Assessment in Online Forums"
} | null | null | null | null | true | null | 18408 | null | Default | null | null |
null | {
"abstract": " The famous pentagon identity for quantum dilogarithms has a generalization\nfor every Dynkin quiver, due to Reineke. A more advanced generalization is\nassociated with a pair of alternating Dynkin quivers, due to Keller. The\ndescription and proof of Keller's identities involves cluster algebras and\ncluster categories, and the statement of the identity is implicit. In this\npaper we describe Keller's identities explicitly, and prove them by a dimension\ncounting argument. Namely, we consider quiver representations\n$\\boldsymbol{\\mathrm{Rep}}_\\gamma$ together with a superpotential function\n$W_\\gamma$, and calculate the Betti numbers of the equivariant $W_\\gamma$ rapid\ndecay cohomology algebra of $\\boldsymbol{\\mathrm{Rep}}_\\gamma$ in two different\nways corresponding to two natural stratifications of\n$\\boldsymbol{\\mathrm{Rep}}_\\gamma$. This approach is suggested by Kontsevich\nand Soibelman in relation with the Cohomological Hall Algebra of quivers, and\nthe associated Donaldson-Thomas invariants.\n",
"title": "Quantum dilogarithm identities for the square product of A-type Dynkin quivers"
} | null | null | null | null | true | null | 18409 | null | Default | null | null |
null | {
"abstract": " Traditional Linear Genetic Programming (LGP) algorithms are based only on the\nselection mechanism to guide the search. Genetic operators combine or mutate\nrandom portions of the individuals, without knowing if the result will lead to\na fitter individual. Probabilistic Model Building Genetic Programming (PMB-GP)\nmethods were proposed to overcome this issue through a probability model that\ncaptures the structure of the fit individuals and use it to sample new\nindividuals. This work proposes the use of LGP with a Stochastic Context-Free\nGrammar (SCFG), that has a probability distribution that is updated according\nto selected individuals. We proposed a method for adapting the grammar into the\nlinear representation of LGP. Tests performed with the proposed probabilistic\nmethod, and with two hybrid approaches, on several symbolic regression\nbenchmark problems show that the results are statistically better than the\nobtained by the traditional LGP.\n",
"title": "A Probabilistic Linear Genetic Programming with Stochastic Context-Free Grammar for solving Symbolic Regression problems"
} | null | null | null | null | true | null | 18410 | null | Default | null | null |
null | {
"abstract": " Given a link $L\\subset S^3$, a representation $\\pi_1(S^3-L)\\to{\\rm\nSL}(2,\\mathbb{C})$ is {\\it trace-free} if it sends each meridian to an element\nwith trace zero. We present a method for completely determining trace-free\n${\\rm SL}(2,\\mathbb{C})$-representations for arborescent links. Concrete\ncomputations are done for a class of 3-bridge arborescent links.\n",
"title": "Trace-free ${\\rm SL}(2,\\mathbb{C})$-representations of arborescent links"
} | null | null | null | null | true | null | 18411 | null | Default | null | null |
null | {
"abstract": " It is well-known that every non-negative univariate real polynomial can be\nwritten as the sum of two polynomial squares with real coefficients. When one\nallows a weighted sum of finitely many squares instead of a sum of two squares,\nthen one can choose all coefficients in the representation to lie in the field\ngenerated by the coefficients of the polynomial.\nIn this article, we describe, analyze and compare both from the theoretical\nand practical points of view, two algorithms computing such a weighted sums of\nsquares decomposition for univariate polynomials with rational coefficients.\nThe first algorithm, due to the third author relies on real root isolation,\nquadratic approximations of positive polynomials and square-free decomposition\nbut its complexity was not analyzed. We provide bit complexity estimates, both\non runtime and output size of this algorithm. They are exponential in the\ndegree of the input univariate polynomial and linear in the maximum bitsize of\nits complexity. This analysis is obtained using quantifier elimination and root\nisolation bounds.\nThe second algorithm, due to Chevillard, Harrison, Joldes and Lauter, relies\non complex root isolation and square-free decomposition and has been introduced\nfor certifying positiveness of polynomials in the context of computer\narithmetics. Again, its complexity was not analyzed. We provide bit complexity\nestimates, both on runtime and output size of this algorithm, which are\npolynomial in the degree of the input polynomial and linear in the maximum\nbitsize of its complexity. This analysis is obtained using Vieta's formula and\nroot isolation bounds.\nFinally, we report on our implementations of both algorithms. While the\nsecond algorithm is, as expected from the complexity result, more efficient on\nmost of examples, we exhibit families of non-negative polynomials for which the\nfirst algorithm is better.\n",
"title": "Algorithms for Weighted Sums of Squares Decomposition of Non-negative Univariate Polynomials"
} | null | null | [
"Computer Science"
]
| null | true | null | 18412 | null | Validated | null | null |
null | {
"abstract": " We discuss the existence of (injectively) universal C*-algebras and prove\nthat all C*-algebras of density character $\\aleph_1$ embed into the Calkin\nalgebra, $Q(H)$. Together with other results, this shows that each of the\nfollowing assertions is relatively consistent with ZFC: (i) $Q(H)$ is a\n$2^{\\aleph_0}$-universal C*-algebra. (ii) There exists a\n$2^{\\aleph_0}$-universal C*-algebra, but $Q(H)$ is not\n$2^{\\aleph_0}$-universal. (iii) A $2^{\\aleph_0}$-universal C*-algebra does not\nexist. We also prove that it is relatively consistent with ZFC that (iv) there\nis no $\\aleph_1$-universal nuclear C*-algebra, and that (v) there is no\n$\\aleph_1$-universal simple nuclear C*-algebra.\n",
"title": "The Calkin algebra is $\\aleph_1$-universal"
} | null | null | null | null | true | null | 18413 | null | Default | null | null |
null | {
"abstract": " Numerous embedding models have been recently explored to incorporate semantic\nknowledge into visual recognition. Existing methods typically focus on\nminimizing the distance between the corresponding images and texts in the\nembedding space but do not explicitly optimize the underlying structure. Our\nkey observation is that modeling the pairwise image-image relationship improves\nthe discrimination ability of the embedding model. In this paper, we propose\nthe structured discriminative and difference constraints to learn\nvisual-semantic embeddings. First, we exploit the discriminative constraints to\ncapture the intra- and inter-class relationships of image embeddings. The\ndiscriminative constraints encourage separability for image instances of\ndifferent classes. Second, we align the difference vector between a pair of\nimage embeddings with that of the corresponding word embeddings. The difference\nconstraints help regularize image embeddings to preserve the semantic\nrelationships among word embeddings. Extensive evaluations demonstrate the\neffectiveness of the proposed structured embeddings for single-label\nclassification, multi-label classification, and zero-shot recognition.\n",
"title": "Learning Structured Semantic Embeddings for Visual Recognition"
} | null | null | null | null | true | null | 18414 | null | Default | null | null |
null | {
"abstract": " In the present paper we propose and study estimators for a wide class of\nbivariate measures of concordance for copulas. These measures of concordance\nare generated by a copula and generalize Spearman's rho and Gini's gamma. In\nthe case of Spearman's rho and Gini's gamma the estimators turn out to be the\nusual sample versions of these measures of concordance.\n",
"title": "Estimators for a Class of Bivariate Measures of Concordance for Copulas"
} | null | null | null | null | true | null | 18415 | null | Default | null | null |
null | {
"abstract": " The Complex Kohn variational method for electron-polyatomic molecule\nscattering is formulated using an overset grid representation of the scattering\nwave function. The overset grid consists of a central grid and multiple dense,\natom-centered subgrids that allow the simultaneous spherical expansions of the\nwave function about multiple centers. Scattering boundary conditions are\nenforced by using a basis formed by the repeated application of the free\nparticle Green's function and potential, $\\hat{G}^+_0\\hat{V}$ on the overset\ngrid in a \"Born-Arnoldi\" solution of the working equations. The theory is shown\nto be equivalent to a specific Padé approximant to the $T$-matrix, and has\nrapid convergence properties, both in the number of numerical basis functions\nemployed and the number of partial waves employed in the spherical expansions.\nThe method is demonstrated in calculations on methane and CF$_4$ in the\nstatic-exchange approximation, and compared in detail with calculations\nperformed with the numerical Schwinger variational approach based on single\ncenter expansions. An efficient procedure for operating with the free-particle\nGreen's function and exchange operators (to which no approximation is made) is\nalso described.\n",
"title": "Variational treatment of electron-polyatomic molecule scattering calculations using adaptive overset grids"
} | null | null | null | null | true | null | 18416 | null | Default | null | null |
null | {
"abstract": " We develop a geometric approach to quantum mechanics based on the concept of\nthe Tulczyjew triple. Our approach is genuinely infinite-dimensional and\nincluding a Lagrangian formalism in which self-adjoint (Schroedinger) operators\nare obtained as Lagrangian submanifolds associated with the Lagrangian. As a\nbyproduct we obtain also results concerning coadjoint orbits of the unitary\ngroup in infinite dimension, embedding of the Hilbert projective space of pure\nstates in the unitary group, and an approach to self-adjoint extensions of\nsymmetric relations.\n",
"title": "Geometry of quantum dynamics in infinite dimension"
} | null | null | null | null | true | null | 18417 | null | Default | null | null |
null | {
"abstract": " Given a relatively projective birational morphism $f\\colon X\\to Y$ of smooth\nalgebraic spaces with dimension of fibers bounded by 1, we construct tilting\nrelative (over $Y$) generators $T_{X,f}$ and $S_{X,f}$ in $\\mathcal{D}^b(X)$.\nWe develop a piece of general theory of strict admissible lattice filtrations\nin triangulated categories and show that $\\mathcal{D}^b(X)$ has such a\nfiltration $\\mathcal{L}$ where the lattice is the set of all birational\ndecompositions $f \\colon X \\xrightarrow{g} Z \\xrightarrow{h} Y$ with smooth\n$Z$. The $t$-structures related to $T_{X,f}$ and $S_{X,f}$ are proved to be\nglued via filtrations left and right dual to $\\mathcal{L}$. We realise all such\n$Z$ as the fine moduli spaces of simple quotients of $\\mathcal{O}_X$ in the\nheart of the $t$-structure for which $S_{X,g}$ is a relative projective\ngenerator over $Y$. This implements the program of interpreting relevant smooth\ncontractions of $X$ in terms of a suitable system of $t$-structures on\n$\\mathcal{D}^b(X)$.\n",
"title": "Canonical tilting relative generators"
} | null | null | [
"Mathematics"
]
| null | true | null | 18418 | null | Validated | null | null |
null | {
"abstract": " Current theories hold that brain function is highly related to long-range\nphysical connections through axonal bundles, namely extrinsic connectiv-ity.\nHowever, obtaining a groupwise cortical parcellation based on extrinsic\nconnectivity remains challenging. Current parcellation methods are\ncompu-tationally expensive; need tuning of several parameters or rely on ad-hoc\nconstraints. Furthermore, none of these methods present a model for the\ncortical extrinsic connectivity of the cortex. To tackle these problems, we\npropose a parsimonious model for the extrinsic connectivity and an efficient\nparceling technique based on clustering of tractograms. Our technique allows\nthe creation of single subject and groupwise parcellations of the whole cortex.\nThe parcellations obtained with our technique are in agreement with structural\nand functional parcellations in the literature. In particular, the motor and\nsensory cortex are subdivided in agreement with the human ho-munculus of\nPenfield. We illustrate this by comparing our resulting parcels with the motor\nstrip mapping included in the Human Connectome Project data.\n",
"title": "Groupwise Structural Parcellation of the Cortex: A Sound Approach Based on Logistic Models"
} | null | null | null | null | true | null | 18419 | null | Default | null | null |
null | {
"abstract": " As computer scientists working in bioinformatics/computational biology, we\noften face the challenge of coming up with an algorithm to answer a biological\nquestion. This occurs in many areas, such as variant calling, alignment, and\nassembly. In this tutorial, we use the example of the genome assembly problem\nto demonstrate how to go from a question in the biological realm to a solution\nin the computer science realm. We show the modeling process step-by-step,\nincluding all the intermediate failed attempts.\n",
"title": "Modeling Biological Problems in Computer Science: A Case Study in Genome Assembly"
} | null | null | [
"Computer Science"
]
| null | true | null | 18420 | null | Validated | null | null |
null | {
"abstract": " Convolution is a critical component in modern deep neural networks, thus\nseveral algorithms for convolution have been developed. Direct convolution is\nsimple but suffers from poor performance. As an alternative, multiple indirect\nmethods have been proposed including im2col-based convolution, FFT-based\nconvolution, or Winograd-based algorithm. However, all these indirect methods\nhave high memory-overhead, which creates performance degradation and offers a\npoor trade-off between performance and memory consumption. In this work, we\npropose a memory-efficient convolution or MEC with compact lowering, which\nreduces memory-overhead substantially and accelerates convolution process. MEC\nlowers the input matrix in a simple yet efficient/compact way (i.e., much less\nmemory-overhead), and then executes multiple small matrix multiplications in\nparallel to get convolution completed. Additionally, the reduced memory\nfootprint improves memory sub-system efficiency, improving performance. Our\nexperimental results show that MEC reduces memory consumption significantly\nwith good speedup on both mobile and server platforms, compared with other\nindirect convolution algorithms.\n",
"title": "MEC: Memory-efficient Convolution for Deep Neural Network"
} | null | null | null | null | true | null | 18421 | null | Default | null | null |
null | {
"abstract": " In this paper we present results of our studying of famous very young pair of\nasteroids 6070 Rheinland and 54827 (2001 NQ8). We have done numeric integration\nof orbits of pair with only planet perturbations and include Ceres and Vesta\neffect. We have confirmed results of previous studying, obtained with different\nintegrators. And we confirm significant effect of Ceres and Vesta perturbation\non dynamic of this pair. We find that effect of other massive asteroids is\ninsignificant. According our results, more probable age of 6070 Rheinland and\n54827 (2001 NQ8) pair is 16.2 kyrs. Our value of age is very close to most\nrecent age determination by Vokrouhlicky et al [12], obtained with different\nmethod. After the compare our results, we can conclude, that non-gravitational\nforces are small and large number of clones is not necessary in studying of\nthis pair. As an additional way of studying of close orbits dynamics, we\ncalculate relative velocity in pair during numeric integration. Normal\ncomponent of velocity show a very good convergence at epoch of closest\nencounter in pair.\n",
"title": "On age of 6070 Rheinland and 54827 (2001 NQ8) asteroid pair"
} | null | null | null | null | true | null | 18422 | null | Default | null | null |
null | {
"abstract": " We apply the first-order reversal curve (FORC) method, borrowed from studies\nof ferromagnetic materials, to the magneto-structural phase transition of FeTe.\nFORC measurements reveal two features in the hysteretic phase transition, even\nin samples where traditional temperature measurements display only a single\ntransition. For Fe1.13Te, the influence of magnetic field suggests that the\nmain feature is primarily structural while a smaller, slightly\nhigher-temperature transition is magnetic in origin. By contrast Fe1.03Te has a\nsingle transition which shows a uniform response to magnetic field, indicating\na stronger coupling of the magnetic and structural phase transitions. We also\nintroduce uniaxial stress, which spreads the distribution width without\nchanging the underlying energy barrier of the transformation. The work shows\nhow FORC can help disentangle the roles of the magnetic and structural phase\ntransitions in FeTe.\n",
"title": "First-Order Reversal Curves of the Magnetostructural Phase Transition in FeTe"
} | null | null | null | null | true | null | 18423 | null | Default | null | null |
null | {
"abstract": " The data-driven economy has led to a significant shortage of data scientists.\nTo address this shortage, this study explores the prospects of outsourcing data\nanalysis tasks to freelancers available on online labor markets (OLMs) by\nidentifying the essential factors for this endeavor. Specifically, we explore\nthe skills required from freelancers, collect information about the skills\npresent on major OLMs, and identify the main hurdles for out-/crowd-sourcing\ndata analysis. Adopting a sequential mixed-method approach, we interviewed 20\ndata scientists and subsequently surveyed 80 respondents from OLMs. Besides\nconfirming the need for expected skills such as technical/mathematical\ncapabilities, it also identifies less known ones such as domain understanding,\nan eye for aesthetic data visualization, good communication skills, and a\nnatural understanding of the possibilities/limitations of data analysis in\ngeneral. Finally, it elucidates obstacles for crowdsourcing like the\ncommunication overhead, knowledge gaps, quality assurance, and data\nconfidentiality, which need to be mitigated.\n",
"title": "Data Analytics on Online Labor Markets: Opportunities and Challenges"
} | null | null | [
"Computer Science"
]
| null | true | null | 18424 | null | Validated | null | null |
null | {
"abstract": " Motivated by safety-critical applications, test-time attacks on classifiers\nvia adversarial examples has recently received a great deal of attention.\nHowever, there is a general lack of understanding on why adversarial examples\narise; whether they originate due to inherent properties of data or due to lack\nof training samples remains ill-understood. In this work, we introduce a\ntheoretical framework analogous to bias-variance theory for understanding these\neffects.\nWe use our framework to analyze the robustness of a canonical non-parametric\nclassifier - the k-nearest neighbors. Our analysis shows that its robustness\nproperties depend critically on the value of k - the classifier may be\ninherently non-robust for small k, but its robustness approaches that of the\nBayes Optimal classifier for fast-growing k. We propose a novel modified\n1-nearest neighbor classifier, and guarantee its robustness in the large sample\nlimit. Our experiments suggest that this classifier may have good robustness\nproperties even for reasonable data set sizes.\n",
"title": "Analyzing the Robustness of Nearest Neighbors to Adversarial Examples"
} | null | null | null | null | true | null | 18425 | null | Default | null | null |
null | {
"abstract": " In this paper, we proposed a non-uniform power delivery network (PDN)\nsynthesis methodology. It first constructs initial PDN using uniform approach.\nThen preliminary power integrity analysis is performed to derive IR-safe\ncandidate window. Congestion map is obtained based global route congestion\nestimation. A self-adaptive non-uniform PDN synthesis is then performed to\nglobally and locally optimize PDN over selected regions. The PDN synthesis is\ncongestion-driven and IR- guarded. Experimental results show significant timing\nimportant in trade-off small PDN length reduction with no EM/IR impact. We\nfurther explored potential power savings using our non-uniform PDN synthesis\nmethodology.\n",
"title": "Non Uniform On Chip Power Delivery Network Synthesis Methodology"
} | null | null | null | null | true | null | 18426 | null | Default | null | null |
null | {
"abstract": " Competition to bind microRNAs induces an effective positive crosstalk between\ntheir targets, therefore known as `competing endogenous RNAs' or ceRNAs. While\nsuch an effect is known to play a significant role in specific conditions,\nestimating its strength from data and, experimentally, in physiological\nconditions appears to be far from simple. Here we show that the susceptibility\nof ceRNAs to different types of perturbations affecting their competitors (and\nhence their tendency to crosstalk) can be encoded in quantities as intuitive\nand as simple to measure as correlation functions. We confirm this scenario by\nextensive numerical simulations and validate it by re-analyzing PTEN's\ncrosstalk pattern from TCGA breast cancer dataset. These results clarify the\nlinks between different quantities used to estimate the intensity of ceRNA\ncrosstalk and provide new keys to analyze transcriptional datasets and\neffectively probe ceRNA networks in silico.\n",
"title": "Translating ceRNA susceptibilities into correlation functions"
} | null | null | null | null | true | null | 18427 | null | Default | null | null |
null | {
"abstract": " Long range frequency chirping of Bernstein-Greene-Kruskal modes, whose\nexistence is determined by the fast particles, is investigated in cases where\nthese particles do not move freely and their motion is bounded to restricted\norbits. An equilibrium oscillating potential, which creates different orbit\ntopologies of energetic particles, is included into the bump-on-tail\ninstability problem of a plasma wave. With respect to fast particles dynamics,\nthe extended model captures the range of particles motion (trapped/passing)\nwith energy and thus represents a more realistic 1D picture of the long range\nsweeping events observed for weakly damped modes, e.g. global Alfven\neigenmodes, in tokamaks. The Poisson equation is solved numerically along with\nbounce averaging the Vlasov equation in the adiabatic regime. We demonstrate\nthat the shape and the saturation amplitude of the nonlinear mode structure\ndepends not only on the amount of deviation from the initial eigenfrequency but\nalso on the initial energy of the resonant electrons in the equilibrium\npotential. Similarly, the results reveal that the resonant electrons following\ndifferent equilibrium orbits in the electrostatic potential lead to different\nrates of frequency evolution. As compared to the previous model [Breizman B.N.\n2010 Nucl. Fusion 50 084014], it is shown that the frequency sweeps with lower\nrates. The additional physics included in the model enables a more complete 1D\ndescription of the range of phenomena observed in experiments.\n",
"title": "Impact of energetic particle orbits on long range frequency chirping of BGK modes"
} | null | null | null | null | true | null | 18428 | null | Default | null | null |
null | {
"abstract": " Type inference is an application domain that is a natural fit for logic\nprogramming (LP). LP systems natively support unification, which serves as a\nbasic building block of typical type inference algorithms. In particular,\npolymorphic type inference in the Hindley--Milner type system (HM) can be\nsuccinctly specified and executed in Prolog. In our previous work, we have\ndemonstrated that more advanced features of parametric polymorphism beyond HM,\nsuch as type-constructor polymorphism and kind polymorphism, can be similarly\nspecified in Prolog. Here, we demonstrate a specification for records, which is\none of the most widely supported compound data structures in real-world\nprogramming languages, and discuss the advantages and limitations of Prolog as\na specification language for type systems. Record types are specified as\norder-irrelevant collections of named fields mapped to their corresponding\ntypes. In addition, an open-ended collection is used to support row\npolymorphism for record types to be extensible.\n",
"title": "An Executable Specification of Typing Rules for Extensible Records based on Row Polymorphism"
} | null | null | null | null | true | null | 18429 | null | Default | null | null |
null | {
"abstract": " We introduce a multi-factor stochastic volatility model for commodities that\nincorporates seasonality and the Samuelson effect. Conditions on the seasonal\nterm under which the corresponding volatility factor is well-defined are given,\nand five different specifications of the seasonality pattern are proposed. We\ncalculate the joint characteristic function of two futures prices for different\nmaturities in the risk-neutral measure. The model is then presented under the\nphysical measure, and its state-space representation is derived, in order to\nestimate the parameters with the Kalman filter for time series of corn, cotton,\nsoybean, sugar and wheat futures from 2007 to 2017. The seasonal model\nsignificantly outperforms the nested non-seasonal model in all five markets,\nand we show which seasonality patterns are particularly well-suited in each\ncase. We also confirm the importance of correctly modelling the Samuelson\neffect in order to account for futures with different maturities. Our results\nare clearly confirmed in a robustness check carried out with an alternative\ndataset of constant maturity futures for the same agricultural markets.\n",
"title": "Seasonal Stochastic Volatility and the Samuelson Effect in Agricultural Futures Markets"
} | null | null | [
"Quantitative Finance"
]
| null | true | null | 18430 | null | Validated | null | null |
null | {
"abstract": " Single-Photon Avalanche Diodes (SPAD) are affordable photodetectors, capable\nto collect extremely fast low-energy events, due to their single-photon\nsensibility. This makes them very suitable for time-of-flight-based range\nimaging systems, allowing to reduce costs and power requirements, without\nsacrifizing much temporal resolution. In this work we describe a computational\nmodel to simulate the behaviour of SPAD sensors, aiming to provide a realistic\ncamera model for time-resolved light transport simulation, with applications on\nprototyping new reconstructions techniques based on SPAD time-of-flight data.\nOur model accounts for the major effects of the sensor on the incoming signal.\nWe compare our model against real-world measurements, and apply it to a variety\nof scenarios, including complex multiply-scattered light transport.\n",
"title": "A Computational Model of a Single-Photon Avalanche Diode Sensor for Transient Imaging"
} | null | null | null | null | true | null | 18431 | null | Default | null | null |
null | {
"abstract": " We give a complete picture of when the tensor product of an induced module\nand a Weyl module is a tilting module for the algebraic group $SL_2$ over an\nalgebraically closed field of characteristic $p$. Whilst the result is\nrecursive by nature, we give an explicit statement in terms of the $p$-adic\nexpansions of the highest weight of each module.\n",
"title": "On Certain Tilting Modules for SL2"
} | null | null | [
"Mathematics"
]
| null | true | null | 18432 | null | Validated | null | null |
null | {
"abstract": " We establish that first-order methods avoid saddle points for almost all\ninitializations. Our results apply to a wide variety of first-order methods,\nincluding gradient descent, block coordinate descent, mirror descent and\nvariants thereof. The connecting thread is that such algorithms can be studied\nfrom a dynamical systems perspective in which appropriate instantiations of the\nStable Manifold Theorem allow for a global stability analysis. Thus, neither\naccess to second-order derivative information nor randomness beyond\ninitialization is necessary to provably avoid saddle points.\n",
"title": "First-order Methods Almost Always Avoid Saddle Points"
} | null | null | [
"Computer Science",
"Statistics"
]
| null | true | null | 18433 | null | Validated | null | null |
null | {
"abstract": " Connectivity related concepts are of fundamental interest in graph theory.\nThe area has received extensive attention over four decades, but many problems\nremain unsolved, especially for directed graphs. A directed graph is\n2-edge-connected (resp., 2-vertex-connected) if the removal of any edge (resp.,\nvertex) leaves the graph strongly connected. In this paper we present improved\nalgorithms for computing the maximal 2-edge- and 2-vertex-connected subgraphs\nof a given directed graph. These problems were first studied more than 35 years\nago, with $\\widetilde{O}(mn)$ time algorithms for graphs with m edges and n\nvertices being known since the late 1980s. In contrast, the same problems for\nundirected graphs are known to be solvable in linear time. Henzinger et al.\n[ICALP 2015] recently introduced $O(n^2)$ time algorithms for the directed\ncase, thus improving the running times for dense graphs. Our new algorithms run\nin time $O(m^{3/2})$, which further improves the running times for sparse\ngraphs.\nThe notion of 2-connectivity naturally generalizes to k-connectivity for\n$k>2$. For constant values of k, we extend one of our algorithms to compute the\nmaximal k-edge-connected in time $O(m^{3/2} \\log{n})$, improving again for\nsparse graphs the best known algorithm by Henzinger et al. [ICALP 2015] that\nruns in $O(n^2 \\log n)$ time.\n",
"title": "Faster Algorithms for Computing Maximal 2-Connected Subgraphs in Sparse Directed Graphs"
} | null | null | null | null | true | null | 18434 | null | Default | null | null |
null | {
"abstract": " Generative adversarial networks (GANs) are an exciting alternative to\nalgorithms for solving density estimation problems---using data to assess how\nlikely samples are to be drawn from the same distribution. Instead of\nexplicitly computing these probabilities, GANs learn a generator that can match\nthe given probabilistic source. This paper looks particularly at this matching\ncapability in the context of problems with one-dimensional outputs. We identify\na class of function decompositions with properties that make them well suited\nto the critic role in a leading approach to GANs known as Wasserstein GANs. We\nshow that Taylor and Fourier series decompositions belong to our class, provide\nexamples of these critics outperforming standard GAN approaches, and suggest\nhow they can be scaled to higher dimensional problems in the future.\n",
"title": "Summable Reparameterizations of Wasserstein Critics in the One-Dimensional Setting"
} | null | null | null | null | true | null | 18435 | null | Default | null | null |
null | {
"abstract": " We study fingering instabilities and pattern formation at the interface of an\noppositely polarized two-component Bose-Einstein condensate with strong\ndipole-dipole interactions in three dimensions. It is shown that the rotational\nsymmetry is spontaneously broken by fingering instability when the\ndipole-dipole interactions are strengthened. Frog-shaped and mushroom-shaped\npatterns emerge during the dynamics due to the dipolar interactions. We also\ndemonstrate the spontaneous density modulation and domain growth of a\ntwo-component dipolar BEC in the dynamics. Bogoliubov analyses in the\ntwo-dimensional approximation are performed, and the characteristic lengths of\nthe domains are estimated analytically. Patterns resembling those in magnetic\nclassical fluids are modulated when the number ratio of atoms, the trap ratio\nof the external potential, or tilted polarization with respect to the z\ndirection is varied.\n",
"title": "Fingering instabilities and pattern formation in a two-component dipolar Bose-Einstein condensate"
} | null | null | null | null | true | null | 18436 | null | Default | null | null |
null | {
"abstract": " Information-theoretic Bayesian optimisation techniques have demonstrated\nstate-of-the-art performance in tackling important global optimisation\nproblems. However, current information-theoretic approaches require many\napproximations in implementation, introduce often-prohibitive computational\noverhead and limit the choice of kernels available to model the objective. We\ndevelop a fast information-theoretic Bayesian Optimisation method, FITBO, that\navoids the need for sampling the global minimiser, thus significantly reducing\ncomputational overhead. Moreover, in comparison with existing approaches, our\nmethod faces fewer constraints on kernel choice and enjoys the merits of\ndealing with the output space. We demonstrate empirically that FITBO inherits\nthe performance associated with information-theoretic Bayesian optimisation,\nwhile being even faster than simpler Bayesian optimisation approaches, such as\nExpected Improvement.\n",
"title": "Fast Information-theoretic Bayesian Optimisation"
} | null | null | null | null | true | null | 18437 | null | Default | null | null |
null | {
"abstract": " H$_3^+$ is a ubiquitous and important astronomical species whose spectrum has\nbeen observed in the interstellar medium, planets and tentatively in the\nremnants of supernova SN1897a. Its role as a cooler is important for gas giant\nplanets and exoplanets, and possibly the early Universe. All this makes the\nspectral properties, cooling function and partition function of H$_3^+$ key\nparameters for astronomical models and analysis. A new high-accuracy, very\nextensive line list for H$_3^+$ called MiZATeP was computed as part of the\nExoMol project alongside a temperature-dependent cooling function and partition\nfunction as well as lifetimes for %individual excited states. These data are\nmade available in electronic form as supplementary data to this article and at\nthis http URL\n",
"title": "ExoMol molecular line lists XX: a comprehensive line list for H$_3^+$"
} | null | null | null | null | true | null | 18438 | null | Default | null | null |
null | {
"abstract": " The generalized linear model (GLM) plays a key role in regression analyses.\nIn high-dimensional data, the sparse GLM has been used but it is not robust\nagainst outliers. Recently, the robust methods have been proposed for the\nspecific example of the sparse GLM. Among them, we focus on the robust and\nsparse linear regression based on the $\\gamma$-divergence. The estimator of the\n$\\gamma$-divergence has strong robustness under heavy contamination. In this\npaper, we extend the robust and sparse linear regression based on the\n$\\gamma$-divergence to the robust and sparse GLM based on the\n$\\gamma$-divergence with a stochastic optimization approach in order to obtain\nthe estimate. We adopt the randomized stochastic projected gradient descent as\na stochastic optimization approach and extend the established convergence\nproperty to the classical first-order necessary condition. By virtue of the\nstochastic optimization approach, we can efficiently estimate parameters for\nvery large problems. Particularly, we show the linear regression, logistic\nregression and Poisson regression with $L_1$ regularization in detail as\nspecific examples of robust and sparse GLM. In numerical experiments and real\ndata analysis, the proposed method outperformed comparative methods.\n",
"title": "Robust and Sparse Regression in GLM by Stochastic Optimization"
} | null | null | null | null | true | null | 18439 | null | Default | null | null |
null | {
"abstract": " Test Case Prioritization (TCP) techniques aim at proposing new test case\nexecution orders to favor the achievement of certain testing goal, such as\nfault detection. Current TCP research focus mainly on code-based regression\ntesting; however in the Model-Based Testing (MBT) context, we still need more\ninvestigation. General TCP techniques do not use historical information, since\nthis information is often unavailable. Therefore, techniques use different\nsources of information to guide prioritization. We propose a novel technique\nthat guides its operation using provided hints, the Hint-Based Adaptive Random\nPrioritization - HARP. Hints are indications or suggestions provided by\ndevelopers about error-prone functionalities. As hints may be hard to collect\nautomatically, we also propose an approach of collecting them. To validate our\nfindings, we performed an experiment measuring the effect of introducing hints\nto HARP. It shows that hints can improve HARP's performance comparing to its\nbaseline. Then, we investigated the ability of developers/managers to provide\ngood hints and used them in a case study. This analysis showed that developers\nand managers are able to provide useful hints, which improves HARP's fault\ndetection comparing to its baseline. Nonetheless, the provided hints should be\nconsensual among the development team members.\n",
"title": "A Hint-Based Technique for System Level Model-Based Test Case Prioritization"
} | null | null | null | null | true | null | 18440 | null | Default | null | null |
null | {
"abstract": " Birhythmicity occurs in many natural and artificial systems. In this paper we\npropose a self-feedback scheme to control birhythmicity. To establish the\nefficacy and generality of the proposed control scheme, we apply it on three\nbirhythmic oscillators from diverse fields of natural science, namely, an\nenergy harvesting system, the p53-Mdm2 network for protein genesis (the OAK\nmodel) and a glycolysis model (modified Decroly-Goldbeter model). Using the\nharmonic decomposition technique and energy balance method we derive the\nanalytical conditions for the control of birhythmicity. A detailed numerical\nbifurcation analysis in the parameter space establishes that the control scheme\nis capable of eliminating birhythmicity and it can also induce transitions\nbetween different forms of bistability. As the proposed control scheme is quite\ngeneral, it can be applied for control of several real systems, particularly in\nbiochemical and engineering systems.\n",
"title": "Control of birhythmicity: A self-feedback approach"
} | null | null | [
"Physics"
]
| null | true | null | 18441 | null | Validated | null | null |
null | {
"abstract": " El Nino is probably the most influential climate phenomenon on interannual\ntime scales. It affects the global climate system and is associated with\nnatural disasters and serious consequences in many aspects of human life.\nHowever, the forecasting of the onset and in particular the magnitude of El\nNino are still not accurate, at least more than half a year in advance. Here,\nwe introduce a new forecasting index based on network links representing the\nsimilarity of low frequency temporal temperature anomaly variations between\ndifferent sites in the El Nino 3.4 region. We find that significant upward\ntrends and peaks in this index forecast with high accuracy both the onset and\nmagnitude of El Nino approximately 1 year ahead. The forecasting procedure we\ndeveloped improves in particular the prediction of the magnitude of El Nino and\nis validated based on several, up to more than a century long, datasets.\n",
"title": "Forecasting the magnitude and onset of El Nino based on climate network"
} | null | null | null | null | true | null | 18442 | null | Default | null | null |
null | {
"abstract": " Recent results of Grepstad and Lev are used to show that weighted\ncut-and-project sets with one-dimensional physical space and one-dimensional\ninternal space are bounded distance equivalent to some lattice if the weight\nfunction $h$ is continuous on the internal space, and if $h$ is either\npiecewise linear, or twice differentiable with bounded curvature.\n",
"title": "Weighted $1\\times1$ cut-and-project sets in bounded distance to a lattice"
} | null | null | null | null | true | null | 18443 | null | Default | null | null |
null | {
"abstract": " We investigate the ordinal invariants height, length, and width of well quasi\norders (WQO), with particular emphasis on width, an invariant of interest for\nthe larger class of orders with finite antichain condition (FAC). We show that\nthe width in the class of FAC orders is completely determined by the width in\nthe class of WQOs, in the sense that if we know how to calculate the width of\nany WQO then we have a procedure to calculate the width of any given FAC order.\nWe show how the width of WQO orders obtained via some classical constructions\ncan sometimes be computed in a compositional way. In particular, this allows\nproving that every ordinal can be obtained as the width of some WQO poset. One\nof the difficult questions is to give a complete formula for the width of\nCartesian products of WQOs. Even the width of the product of two ordinals is\nonly known through a complex recursive formula. Although we have not given a\ncomplete answer to this question we have advanced the state of knowledge by\nconsidering some more complex special cases and in particular by calculating\nthe width of certain products containing three factors. In the course of\nwriting the paper we have discovered that some of the relevant literature was\nwritten on cross-purposes and some of the notions re-discovered several times.\nTherefore we also use the occasion to give a unified presentation of the known\nresults.\n",
"title": "On Ordinal Invariants in Well Quasi Orders and Finite Antichain Orders"
} | null | null | null | null | true | null | 18444 | null | Default | null | null |
null | {
"abstract": " With XML becoming a standard for business information representation and\nexchange, stor-ing, indexing, and querying XML documents have rapidly become\nmajor issues in database research. In this context, query processing and\noptimization are primordial, native-XML data-bases not being mature yet. Data\nstructures such as indices, which help enhance performances substantially, are\nextensively researched, especially since XML data bear numerous specifici-ties\nwith respect to relational data. In this paper, we survey state-of-the-art XML\nindices and discuss the main issues, tradeoffs and future trends in XML\nindexing. We also present an in-dex that we specifically designed for the\nparticular architecture of XML data warehouses.\n",
"title": "Indices in XML Databases"
} | null | null | null | null | true | null | 18445 | null | Default | null | null |
null | {
"abstract": " We deal with kernel theorems for modulation spaces. We completely\ncharacterize the continuity of a linear operator on the modulation spaces $M^p$\nfor every $1\\leq p\\leq\\infty$, by the membership of its kernel to (mixed)\nmodulation spaces. Whereas Feichtinger's kernel theorem (which we recapture as\na special case) is the modulation space counterpart of Schwartz' kernel theorem\nfor temperate distributions, our results do not have a couterpart in\ndistribution theory. This reveals the superiority, in some respects, of the\nmodulation space formalism upon distribution theory, as already emphasized in\nFeichtinger's manifesto for a post-modern harmonic analysis, tailored to the\nneeds of mathematical signal processing. The proof uses in an essential way a\ndiscretization of the problem by means of Gabor frames. We also show the\nequivalence of the operator norm and the modulation space norm of the\ncorresponding kernel. For operators acting on $M^{p,q}$ a similar\ncharacterization is not expected, but sufficient conditions for boundedness can\nbe sated in the same spirit.\n",
"title": "Kernel theorems for modulation spaces"
} | null | null | null | null | true | null | 18446 | null | Default | null | null |
null | {
"abstract": " Artificial Neural Networks (ANNs) have received increasing attention in\nrecent years with applications that span a wide range of disciplines including\nvital domains such as medicine, network security and autonomous transportation.\nHowever, neural network architectures are becoming increasingly complex and\nwith an increasing need to obtain real-time results from such models, it has\nbecome pivotal to use parallelization as a mechanism for speeding up network\ntraining and deployment. In this work we propose an implementation of Network\nParallel Training through Cannon's Algorithm for matrix multiplication. We show\nthat increasing the number of processes speeds up training until the point\nwhere process communication costs become prohibitive; this point varies by\nnetwork complexity. We also show through empirical efficiency calculations that\nthe speedup obtained is superlinear.\n",
"title": "On the Performance of Network Parallel Training in Artificial Neural Networks"
} | null | null | null | null | true | null | 18447 | null | Default | null | null |
null | {
"abstract": " The potential lack of fairness in the outputs of machine learning algorithms\nhas recently gained attention both within the research community as well as in\nsociety more broadly. Surprisingly, there is no prior work developing\ntree-induction algorithms for building fair decision trees or fair random\nforests. These methods have widespread popularity as they are one of the few to\nbe simultaneously interpretable, non-linear, and easy-to-use. In this paper we\ndevelop, to our knowledge, the first technique for the induction of fair\ndecision trees. We show that our \"Fair Forest\" retains the benefits of the\ntree-based approach, while providing both greater accuracy and fairness than\nother alternatives, for both \"group fairness\" and \"individual fairness.'\" We\nalso introduce new measures for fairness which are able to handle multinomial\nand continues attributes as well as regression problems, as opposed to binary\nattributes and labels only. Finally, we demonstrate a new, more robust\nevaluation procedure for algorithms that considers the dataset in its entirety\nrather than only a specific protected attribute.\n",
"title": "Fair Forests: Regularized Tree Induction to Minimize Model Bias"
} | null | null | null | null | true | null | 18448 | null | Default | null | null |
null | {
"abstract": " The vertices of the four dimensional $120$-cell form a non-crystallographic\nroot system whose corresponding symmetry group is the Coxeter group $H_{4}$.\nThere are two special coordinate representations of this root system in which\nthey and their corresponding Coxeter groups involve only rational numbers and\nthe golden ratio $\\tau$. The two are related by the conjugation $\\tau\n\\mapsto\\tau' = -1/\\tau$. This paper investigates what happens when the two root\nsystems are combined and the group generated by both versions of $H_{4}$ is\nallowed to operate on them. The result is a new, but infinite, `root system'\n$\\Sigma$ which itself turns out to have a natural structure of the unitary\ngroup $SU(2,\\mathcal R)$ over the ring $\\mathcal R = \\mathbb\nZ[\\frac{1}{2},\\tau]$ (called here golden numbers). Acting upon it is the\nnaturally associated infinite reflection group $H^{\\infty}$, which we prove is\nof index $2$ in the orthogonal group $O(4,\\mathcal R)$. The paper makes\nextensive use of the quaternions over $\\mathcal R$ and leads to highly\nstructured discretized filtration of $SU(2)$. We use this to offer a simple and\neffective way to approximate any element of $SU(2)$ to any degree of accuracy\nrequired using the repeated actions of just five fixed reflections, a process\nthat may find application in computational methods in quantum mechanics.\n",
"title": "Discretization of SU(2) and the Orthogonal Group Using Icosahedral Symmetries and the Golden Numbers"
} | null | null | null | null | true | null | 18449 | null | Default | null | null |
null | {
"abstract": " The study of single-crystal Raman spectra of a series of crystalline\nsecondary amides (acetanilide, methacetin, phenacetine, orthorhombic and\nmonoclinic polymorphs of paracetamol) as well as simple amides formanilide and\nbenzanilide in the temperature range 5-300 K was carried out. The series of\ncompounds with the same molecular fragment, i.e. acetamide group, can serve as\na model system to study the interrelation between the latter and the properties\nof the intermolecular \"peptide-type\" NH...O=C hydrogen bonds. For all the\n\"acetamide family\" of compounds, similar changes in the Raman spectra were\nobserved on cooling the samples: an appearance of new Amide I(-) and Amide I(+)\nbands that are red and blue shifted respectively from the conventional Amide I\nband by around of 5-10 inverse centimeters. An appropriated changes in the same\ntemperature range were observed for the N-H out-of-plane bending (Amide V) and\nN-H stretching vibrations of the N-H...O=C hydrogen bond. All the spectral\nchanges on cooling the samples can be supposed to result from delocalization of\nthe Amide I and N-H modes and appearance of dynamical splitting at low\ntemperature.\n",
"title": "Raman spectra of crystalline secondary amides"
} | null | null | null | null | true | null | 18450 | null | Default | null | null |
null | {
"abstract": " In a real-world setting, visual recognition systems can be brought to make\npredictions for images belonging to previously unknown class labels. In order\nto make semantically meaningful predictions for such inputs, we propose a\ntwo-step approach that utilizes information from knowledge graphs. First, a\nknowledge-graph representation is learned to embed a large set of entities into\na semantic space. Second, an image representation is learned to embed images\ninto the same space. Under this setup, we are able to predict structured\nproperties in the form of relationship triples for any open-world image. This\nis true even when a set of labels has been omitted from the training protocols\nof both the knowledge graph and image embeddings. Furthermore, we append this\nlearning framework with appropriate smoothness constraints and show how prior\nknowledge can be incorporated into the model. Both these improvements combined\nincrease performance for visual recognition by a factor of six compared to our\nbaseline. Finally, we propose a new, extended dataset which we use for\nexperiments.\n",
"title": "Open-World Visual Recognition Using Knowledge Graphs"
} | null | null | null | null | true | null | 18451 | null | Default | null | null |
null | {
"abstract": " A repulsive Hubbard model with both spin-asymmetric hopping (${t_\\uparrow\\neq\nt_\\downarrow}$) and a staggered potential (of strength $\\Delta$) is studied in\none dimension. The model is a compound of the mass-imbalanced (${t_\\uparrow\\neq\nt_\\downarrow}$, ${\\Delta=0}$) and ionic (${t_\\uparrow = t_\\downarrow}$,\n${\\Delta>0}$) Hubbard models, and may be realized by cold atoms in engineered\noptical lattices. We use mostly mean-field theory to determine the phases and\nphase transitions in the ground state for a half-filled band (one particle per\nsite). We find that a period-two modulation of the particle (or charge) density\nand an alternating spin density coexist for arbitrary Hubbard interaction\nstrength, ${U\\geqslant 0}$. The amplitude of the charge modulation is largest\nat ${U=0}$, decreases with increasing $U$ and tends to zero for\n${U\\rightarrow\\infty}$. The amplitude for spin alternation increases with $U$\nand tends to saturation for ${U\\rightarrow\\infty}$. Charge order dominates\nbelow a critical value $U_c$, whereas magnetic order dominates above. The\nmean-field Hamiltonian has two gap parameters, $\\Delta_\\uparrow$ and\n$\\Delta_\\downarrow$, which have to be determined self-consistently. For\n${U<U_c}$ both parameters are positive, for ${U>U_c}$ they have different\nsigns, and for ${U=U_c}$ one gap parameter jumps from a positive to a negative\nvalue. The weakly first-order phase transition at $U_c$ can be interpreted in\nterms of an avoided criticality (or metallicity). The system is reluctant to\nrestore a symmetry that has been broken explicitly.\n",
"title": "Mass-Imbalanced Ionic Hubbard Chain"
} | null | null | [
"Physics"
]
| null | true | null | 18452 | null | Validated | null | null |
null | {
"abstract": " Optical properties of color centers in diamond have been the subject of\nintense research due to their promising applications in quantum photonics. In\nthis work we study the optical properties of Xe related color centers implanted\ninto nitrogen rich (type IIA) and an ultrapure, electronic grade diamond. The\nXe defect has two zero phonon lines at ~ 794 and 811 nm, which can be\neffectively excited using both green and red excitation, however, its emission\nin the nitrogen rich diamond is brighter. Near resonant excitation is performed\nat cryogenic temperatures and luminescence is probed under strong magnetic\nfield. Our results are important towards the understanding of the Xe related\ndefect and other near infrared color centers in diamond.\n",
"title": "Optical properties of Xe color centers in diamond"
} | null | null | [
"Physics"
]
| null | true | null | 18453 | null | Validated | null | null |
null | {
"abstract": " Julian Besag was an outstanding statistical scientist, distinguished for his\npioneering work on the statistical theory and analysis of spatial processes,\nespecially conditional lattice systems. His work has been seminal in\nstatistical developments over the last several decades ranging from image\nanalysis to Markov chain Monte Carlo methods. He clarified the role of\nauto-logistic and auto-normal models as instances of Markov random fields and\npaved the way for their use in diverse applications. Later work included\ninvestigations into the efficacy of nearest neighbour models to accommodate\nspatial dependence in the analysis of data from agricultural field trials,\nimage restoration from noisy data, and texture generation using lattice models.\n",
"title": "Julian Ernst Besag, 26 March 1945 -- 6 August 2010, a biographical memoir"
} | null | null | null | null | true | null | 18454 | null | Default | null | null |
null | {
"abstract": " Dielectric lined waveguides are under extensive study as accelerating\nstructures that can be excited by electron beams. Rectangular dielectric\nstructures are used both in proof of principle experiments for new accelerating\nschemes and for studying the electronic properties of the structure loading\nmaterial. Analysis of Cherenkov radiation generated by high current\nrelativistic electron bunch passing through a rectangular waveguide with\ntransversal isotropic dielectric loading has been carried out. Some of the\nmaterials used for the waveguide loading of accelerating structures (sapphire,\nceramic films) possess significant anisotropic properties. In turn, it can\ninfluence excitation parameters of the wakefields generated by an electron\nbeam. General solutions for the fields generated by a relativistic electron\nbeam propagating in a rectangular dielectric waveguide have been derived using\nthe orthogonal eigenmode decomposition method for the transverse operators of\nthe Helmholtz equation. The analytical expression for the combined Cherenkov\nand Coulomb fields in terms of a superposition of LSM and LSE-modes of\nrectangular waveguide with transversal isotropic dielectric loading has been\nobtained. Numerical modelling of the longitudinal and transverse (deflecting)\nwakefields has been carried out as well. It is shown that the dielectric\nanisotropy causes frequency shift in comparison to the dielectric-lined\nwaveguide with the isotropic dielectric loading.\n",
"title": "Wake fields in a rectangular dielectric-lined accelerating structure with transversal isotropic loading"
} | null | null | null | null | true | null | 18455 | null | Default | null | null |
null | {
"abstract": " The rotational and hyperfine spectrum of the $X^1\\Sigma^+ \\rightarrow\nB^3\\Pi_1$ transition in TlF molecules was measured using laser-induced\nfluorescence from both a thermal and a cryogenic molecular beam. Rotational and\nhyperfine constants for the $B$ state are obtained. The large magnetic\nhyperfine interaction of the Tl nuclear spin leads to significant mixing of the\nlowest $B$ state rotational levels. Updated, more precise measurements of the\n$B\\rightarrow X$ vibrational branching fractions are also presented. The\ncombined rovibrational branching fractions allow for the prediction of the\nnumber of photons that can be scattered in a given TlF optical cycling scheme.\n",
"title": "Hyperfine Structure of the $B^3Π_1$ State and Predictions of Optical Cycling Behavior in the $X\\rightarrow B$ transition of TlF"
} | null | null | null | null | true | null | 18456 | null | Default | null | null |
null | {
"abstract": " The domain name system translates human friendly web addresses to a computer\nreadable internet protocol address. This basic infrastructure is insecure and\ncan be manipulated. Deployment of technology to secure the DNS system has been\nslow, reaching about 20% of all web sites based in the USA. Little is known\nabout the efforts hospitals and health systems make to secure the domain name\nsystem for their websites. To investigate the prevalence of implementing Domain\nName System Security Extensions (DNSSEC), we analyzed the websites of the 210\npublic hospitals in the state of Illinois, USA. Only one Illinois hospital\nwebsite was found to have implemented DNSSEC by December, 2017.\n",
"title": "Prevalence of DNSSEC for hospital websites in Illinois"
} | null | null | null | null | true | null | 18457 | null | Default | null | null |
null | {
"abstract": " In this article, we study the plasmonic resonance of infinite photonic\ncrystal mounted by the double negative nanoparticles in two dimensions. The\ncorresponding physical model is described by the Helmholz equation with so\ncalled Bloch wave condition in a periodic domain. By using the quasi-periodic\nlayer potential techniques and the spectral theorem of quasi-periodic\nNeumann-Poincar{é} operator, the quasi-static expansion of the near field in\nthe presence of nanoparticles is derived. Furthermore, when the magnetic\npermeability of nanoparticles satisfies the Drude model, we give the conditions\nunder which the plasmonic resonance occurs, and the rate of blow up of near\nfield energy with respect to nanoparticle's bulk electron relaxation rate and\nfilling factor are also obtained. It indicates that one can appropriately\ncontrol the bulk electron relaxation rate or filling factor of nanoparticle in\nphotonic crystal structure such that the near field energy attains its maximum,\nand enhancing the efficiency of energy utilization.\n",
"title": "Mathematical analysis of plasmonic resonance for 2-D photonic crystal"
} | null | null | null | null | true | null | 18458 | null | Default | null | null |
null | {
"abstract": " We investigate, numerically and experimentally, the effect of thermo-optical\n(TO) chaos on direct soliton generation (DSG) in microresonators. When the pump\nlaser is scanned from blue to red and then stopped at a fixed wavelength, we\nfind that the solitons generated sometimes remain (survive) and sometimes\nannihilate subsequent to the end of the scan. We refer to the possibility of\nthese different outcomes arising under identical laser scan conditions as\ncoexistence of soliton annihilation and survival. Numerical simulations that\ninclude the thermal dynamics show that the coexistence of soliton annihilation\nand survival is explained by TO chaos accompanying comb generation. The random\nfluctuations of the cavity resonance occurring under TO chaos are also found to\ntrigger spontaneous soliton generation after the laser scan ends. The\ncoexistence of soliton annihilation and survival as well as spontaneous soliton\ngeneration are observed experimentally in a silicon-nitride microresonator. The\nelucidation of the role of TO chaos provides important insights into the\nsoliton generation dynamics in microresonators, which may eventually facilitate\nstraightforward soliton generation in fully-integrated microresonators.\n",
"title": "Thermo-Optical Chaos and Direct Soliton Generation in Microresonators"
} | null | null | null | null | true | null | 18459 | null | Default | null | null |
null | {
"abstract": " We show that one-dimensional circle is the only case for closed smooth metric\nmeasure spaces with nonnegative Bakry-Émery Ricci curvature whose spectrum\nof the weighted Laplacian has an optimal positive upper bound. This result\nextends the work of Hang-Wang in the manifold case (Int. Math. Res. Not. 18\n(2007), Art. ID rnm064, 9pp).\n",
"title": "Rigidity of closed metric measure spaces with nonnegative curvature"
} | null | null | null | null | true | null | 18460 | null | Default | null | null |
null | {
"abstract": " In the field of software engineering there are many new archetypes are\nintroducing day to day Improve the efficiency and effectiveness of software\ndevelopment. Due to dynamic environment organizations are frequently exchanging\ntheir software constraint to meet their objectives. The propose research is a\nnew approach by integrating the traditional V model and agile methodology to\ncombining the strength of these models while minimizing their individual\nweakness.The fluctuating requirements of emerging a carried software system and\naccumulative cost of operational software are imposing researchers and experts\nto determine innovative and superior means for emerging software application at\nslight business or at enterprise level are viewing for. Agile methodology has\nits own benefits but there are deficiency several of the features of\ntraditional software development methodologies that are essential for success.\nThats why an embedded approach will be the right answer for software industry\nrather than a pure agile approach. This research shows how agile embedded\ntraditional can play a vital role in development of software. A survey\nconducted to find the impact of this approach in industry. Both qualitative and\nquantitative analysis performed.\n",
"title": "Combining Agile with Traditional V Model for Enhancement of Maturity in Software Development"
} | null | null | null | null | true | null | 18461 | null | Default | null | null |
null | {
"abstract": " 3D feature descriptor provide information between corresponding models and\nscenes. 3D objection recognition in cluttered scenes, however, remains a\nlargely unsolved problem. Practical applications impose several challenges\nwhich are not fully addressed by existing methods. Especially in cluttered\nscenes there are many feature mismatches between scenes and models. We\ntherefore propose Histograms of Gaussian Normal Distribution (HGND) for\nextracting salient features on a local reference frame (LRF) that enables us to\nsolve this problem. We propose a LRF on each local surface patches using the\nscatter matrix's eigenvectors. Then the HGND information of each salient point\nis calculated on the LRF, for which we use both the mesh and point data of the\ndepth image. Experiments on 45 cluttered scenes of the Bologna Dataset and 50\ncluttered scenes of the UWA Dataset are made to evaluate the robustness and\ndescriptiveness of our HGND. Experiments carried out by us demonstrate that\nHGND obtains a more reliable matching rate than state-of-the-art approaches in\ncluttered situations.\n",
"title": "Histograms of Gaussian normal distribution for feature matching in clutter scenes"
} | null | null | [
"Computer Science"
]
| null | true | null | 18462 | null | Validated | null | null |
null | {
"abstract": " We propose and throughly investigate a temporalized version of the popular\nMassey's technique for rating actors in sport competitions. The method can be\ndescribed as a dynamic temporal process in which team ratings are updated at\nevery match according to their performance during the match and the strength of\nthe opponent team. Using the Italian soccer dataset, we empirically show that\nthe method has a good foresight prediction accuracy.\n",
"title": "The temporalized Massey's method"
} | null | null | null | null | true | null | 18463 | null | Default | null | null |
null | {
"abstract": " In this paper, we introduce and provide a short overview of nonnegative\nmatrix factorization (NMF). Several aspects of NMF are discussed, namely, the\napplication in hyperspectral imaging, geometry and uniqueness of NMF solutions,\ncomplexity, algorithms, and its link with extended formulations of polyhedra.\nIn order to put NMF into perspective, the more general problem class of\nconstrained low-rank matrix approximation problems is first briefly introduced.\n",
"title": "Introduction to Nonnegative Matrix Factorization"
} | null | null | null | null | true | null | 18464 | null | Default | null | null |
null | {
"abstract": " This paper presents a randomized algorithm for computing the near-optimal\nlow-rank dynamic mode decomposition (DMD). Randomized algorithms are emerging\ntechniques to compute low-rank matrix approximations at a fraction of the cost\nof deterministic algorithms, easing the computational challenges arising in the\narea of `big data'. The idea is to derive a small matrix from the\nhigh-dimensional data, which is then used to efficiently compute the dynamic\nmodes and eigenvalues. The algorithm is presented in a modular probabilistic\nframework, and the approximation quality can be controlled via oversampling and\npower iterations. The effectiveness of the resulting randomized DMD (rDMD)\nalgorithm is demonstrated on several benchmark examples of increasing\ncomplexity, providing an accurate and efficient approach to extract\nspatiotemporal coherent structures from big data in a framework that scales\nwith the intrinsic rank of the data, rather than the ambient measurement\ndimension.\n",
"title": "Randomized Dynamic Mode Decomposition"
} | null | null | null | null | true | null | 18465 | null | Default | null | null |
null | {
"abstract": " Obtaining reliable numerical simulations of turbulent fluids is a challenging\nproblem in computational fluid mechanics. The Large Eddy Simulations (LES)\nmodels are efficient tools to approximate turbulent fluids and an important\nstep in the validation of these models is the ability to reproduce relevant\nproperties of the flow. In this paper we consider a fully discrete\napproximation of the Navier-Stokes-Voigt model by an implicit Euler algorithm\n(with respect to the time variable) and a Fourier-Galerkin method (in the space\nvariables). We prove the convergence to weak solutions of the incompressible\nNavier-Stokes equations satisfying the natural local entropy condition, hence\nselecting the so-called physically relevant solutions\n",
"title": "On the convergence of a fully discrete scheme of LES type to physically relevant solutions of the incompressible Navier-Stokes"
} | null | null | [
"Mathematics"
]
| null | true | null | 18466 | null | Validated | null | null |
null | {
"abstract": " By using, among other things, the Fourier analysis techniques on hyperbolic\nand symmetric spaces, we establish the Hardy-Sobolev-Maz'ya inequalities for\nhigher order derivatives on half spaces. The proof relies on a\nHardy-Littlewood-Sobolev inequality on hyperbolic spaces which is of its\nindependent interest. We also give an alternative proof of Benguria, Frank and\nLoss' work concerning the sharp constant in the Hardy-Sobolev-Maz'ya inequality\nin the three dimensional upper half space. Finally, we show the sharp constant\nin the Hardy-Sobolev-Maz'ya inequality for bi-Laplacian in the upper half space\nof dimension five coincides with the Sobolev constant.\n",
"title": "Hardy-Sobolev-Maz'ya inequalities for higher order derivatives on half spaces"
} | null | null | null | null | true | null | 18467 | null | Default | null | null |
null | {
"abstract": " We study focus-focus singularities (also known as nodal singularities, or\npinched tori) of Lagrangian fibrations on symplectic $4$-manifolds. We show\nthat, in contrast to elliptic and hyperbolic singularities, there exist\nhomeomorphic focus-focus singularities which are not diffeomorphic.\nFurthermore, we obtain an algebraic description of the moduli space of\nfocus-focus singularities up to smooth equivalence, and show that for double\npinched tori this space is one-dimensional. Finally, we apply our construction\nto disprove Zung's conjecture which says that any non-degenerate singularity\ncan be smoothly decomposed into an almost direct product of standard\nsingularities.\n",
"title": "Smooth invariants of focus-focus singularities and obstructions to product decomposition"
} | null | null | null | null | true | null | 18468 | null | Default | null | null |
null | {
"abstract": " Using implicit loci in GeoGebra Euler's $R\\geq 2r$ inequality can be\ninvestigated in a novel way. Some unavoidable side effects of the implicit\nlocus computation introduce unexpected algebraic curves. By using a mixture of\nsymbolic and numerical methods a possible approach is sketched up to\ninvestigate the situation.\n",
"title": "A note about Euler's inequality and automated reasoning with dynamic geometry"
} | null | null | null | null | true | null | 18469 | null | Default | null | null |
null | {
"abstract": " We study the physical and dynamical properties of the ionized gas in the\nprototypical HII galaxy Henize 2-10 using MUSE integral field spectroscopy. The\nlarge scale dynamics is dominated by extended outflowing bubbles, probably the\nresults of massive gas ejection from the central star forming regions. We\nderive a mass outflow rate dMout/dt~0.30 Msun/yr, corresponding to mass loading\nfactor eta~0.4, in range with similar measurements in local LIRGs. Such a\nmassive outflow has a total kinetic energy that is sustainable by the stellar\nwinds and Supernova Remnants expected in the galaxy. We use classical emission\nline diagnostic to study the dust extinction, electron density and ionization\nconditions all across the galaxy, confirming the extreme nature of the highly\nstar forming knots in the core of the galaxy, which show high density and high\nionization parameter. We measure the gas phase metallicity in the galaxy taking\ninto account the strong variation of the ionization parameter, finding that the\nexternal parts of the galaxy have abundances as low as 12 + log(O/H)~8.3, while\nthe central star forming knots are highly enriched with super solar\nmetallicity. We find no sign of AGN ionization in the galaxy, despite the\nrecent claim of the presence of a super massive active Black Hole in the core\nof He~2-10. We therefore reanalyze the X-ray data that were used to propose the\npresence of the AGN, but we conclude that the observed X-ray emission can be\nbetter explained with sources of a different nature, such as a Supernova\nRemnant.\n",
"title": "The MUSE view of He 2-10: no AGN ionization but a sparkling starburst"
} | null | null | [
"Physics"
]
| null | true | null | 18470 | null | Validated | null | null |
null | {
"abstract": " Recovery of multispecies oral biofilms is investigated following treatment by\nchlorhexidine gluconate (CHX), iodine-potassium iodide (IPI) and Sodium\nhypochlorite (NaOCl) both experimentally and theoretically. Experimentally,\nbiofilms taken from two donors were exposed to the three antibacterial\nsolutions (irrigants) for 10 minutes, respectively. We observe that (a) live\nbacterial cell ratios decline for a week after the exposure and the trend\nreverses beyond a week; after fifteen weeks, live bacterial cell ratios in\nbiofilms fully return to their pretreatment levels; (b) NaOCl is shown as the\nstrongest antibacterial agent for the oral biofilms; (c) multispecies oral\nbiofilms from different donors showed no difference in their susceptibility to\nall the bacterial solutions. Guided by the experiment, a mathematical model for\nbiofilm dynamics is developed, accounting for multiple bacterial phenotypes,\nquorum sensing, and growth factor proteins, to describe the nonlinear time\nevolutionary behavior of the biofilms. The model captures time evolutionary\ndynamics of biofilms before and after antibacterial treatment very well. It\nreveals the crucial role played by quorum sensing molecules and growth factors\nin biofilm recovery and verifies that the source of biofilms has a minimal to\ntheir recovery. The model is also applied to describe the state of biofilms of\nvarious ages treated by CHX, IPI and NaOCl, taken from different donors. Good\nagreement with experimental data predicted by the model is obtained as well,\nconfirming its applicability to modeling biofilm dynamics in general.\n",
"title": "Modeling Oral Multispecies Biofilm Recovery After Antibacterial Treatment"
} | null | null | null | null | true | null | 18471 | null | Default | null | null |
null | {
"abstract": " The multi-commodity flow-cut gap is a fundamental parameter that affects the\nperformance of several divide \\& conquer algorithms, and has been extensively\nstudied for various classes of undirected graphs. It has been shown by Linial,\nLondon and Rabinovich \\cite{linial1994geometry} and by Aumann and Rabani\n\\cite{aumann1998log} that for general $n$-vertex graphs it is bounded by\n$O(\\log n)$ and the Gupta-Newman-Rabinovich-Sinclair conjecture\n\\cite{gupta2004cuts} asserts that it is $O(1)$ for any family of graphs that\nexcludes some fixed minor.\nThe flow-cut gap is poorly understood for the case of directed graphs. We\nshow that for uniform demands it is $O(1)$ on directed series-parallel graphs,\nand on directed graphs of bounded pathwidth. These are the first constant upper\nbounds of this type for some non-trivial family of directed graphs. We also\nobtain $O(1)$ upper bounds for the general multi-commodity flow-cut gap on\ndirected trees and cycles. These bounds are obtained via new embeddings and\nLipschitz quasipartitions for quasimetric spaces, which generalize analogous\nresults form the metric case, and could be of independent interest. Finally, we\ndiscuss limitations of methods that were developed for undirected graphs, such\nas random partitions, and random embeddings.\n",
"title": "On constant multi-commodity flow-cut gaps for directed minor-free graphs"
} | null | null | null | null | true | null | 18472 | null | Default | null | null |
null | {
"abstract": " Post-starbursts (PSBs) are candidate for rapidly transitioning from\nstar-bursting to quiescent galaxies. We study the molecular gas evolution of\nPSBs at z ~ 0.03 - 0.2. We undertook new CO (2-1) observations of 22 Seyfert\nPSBs candidates using the ARO Submillimeter Telescope. This sample complements\nprevious samples of PSBs by including green valley PSBs with Seyfert-like\nemission, allowing us to analyze for the first time the molecular gas\nproperties of 116 PSBs with a variety of AGN properties. The distribution of\nmolecular gas to stellar mass fractions in PSBs is significantly different than\nnormal star-forming galaxies in the COLD GASS survey. The combined samples of\nPSBs with Seyfert-like emission line ratios have a gas fraction distribution\nwhich is even more significantly different and is broader (~ 0.03-0.3). Most of\nthem have lower gas fractions than normal star-forming galaxies. We find a\nhighly significant correlation between the WISE 12 micron to 4.6 micron flux\nratios and molecular gas fractions in both PSBs and normal galaxies. We detect\nmolecular gas in 27% of our Seyfert PSBs. Taking into account the upper limits,\nthe mean and the dispersion of the distribution of the gas fraction in our\nSeyfert PSB sample are much smaller (mean = 0.025, std dev. = 0.018) than\nprevious samples of Seyfert PSBs or PSBs in general (mean ~ 0.1 - 0.2, std dev.\n~ 0.1 - 0.2).\n",
"title": "Molecular Gas during the Post-Starburst Phase: Low Gas Fractions in Green Valley Seyfert Post-Starburst Galaxies"
} | null | null | null | null | true | null | 18473 | null | Default | null | null |
null | {
"abstract": " We point out that two of Milne's fourth-order integrators are well-suited to\nbit-reversible simulations. The fourth-order method improves on the accuracy of\nLevesque and Verlet's algorithm and simplifies the definition of the velocity\n$v$ and energy $e = (q^2 + v^2)/2$ . ( We use this one-dimensional oscillator\nproblem as an illustration throughout this paper ). Milne's integrator is\nparticularly useful for the analysis of Lyapunov ( exponential ) instability in\ndynamical systems, including manybody molecular dynamics. We include the\ndetails necessary to the implementation of Milne's Algorithms.\n",
"title": "Bit-Reversible Version of Milne's Fourth-Order Time-Reversible Integrator for Molecular Dynamics"
} | null | null | null | null | true | null | 18474 | null | Default | null | null |
null | {
"abstract": " The conventional theory of hydrodynamics describes the evolution in time of\nchaotic many-particle systems from local to global equilibrium. In a quantum\nintegrable system, local equilibrium is characterized by a local generalized\nGibbs ensemble or equivalently a local distribution of pseudo-momenta. We study\ntime evolution from local equilibria in such models by solving a certain\nkinetic equation, the \"Bethe-Boltzmann\" equation satisfied by the local\npseudo-momentum density. Explicit comparison with density matrix\nrenormalization group time evolution of a thermal expansion in the XXZ model\nshows that hydrodynamical predictions from smooth initial conditions can be\nremarkably accurate, even for small system sizes. Solutions are also obtained\nin the Lieb-Liniger model for free expansion into vacuum and collisions between\nclouds of particles, which model experiments on ultracold one-dimensional Bose\ngases.\n",
"title": "Solvable Hydrodynamics of Quantum Integrable Systems"
} | null | null | [
"Physics"
]
| null | true | null | 18475 | null | Validated | null | null |
null | {
"abstract": " We consider the problems of compressed sensing and optimal denoising for\nsignals $\\mathbf{x_0}\\in\\mathbb{R}^N$ that are monotone, i.e.,\n$\\mathbf{x_0}(i+1) \\geq \\mathbf{x_0}(i)$, and sparsely varying, i.e.,\n$\\mathbf{x_0}(i+1) > \\mathbf{x_0}(i)$ only for a small number $k$ of indices\n$i$. We approach the compressed sensing problem by minimizing the total\nvariation norm restricted to the class of monotone signals subject to equality\nconstraints obtained from a number of measurements $A\\mathbf{x_0}$. For random\nGaussian sensing matrices $A\\in\\mathbb{R}^{m\\times N}$ we derive a closed form\nexpression for the number of measurements $m$ required for successful\nreconstruction with high probability. We show that the probability undergoes a\nphase transition as $m$ varies, and depends not only on the number of change\npoints, but also on their location. For denoising we regularize with the same\nnorm and derive a formula for the optimal regularizer weight that depends only\nmildly on $\\mathbf{x_0}$. We obtain our results using the statistical dimension\ntool.\n",
"title": "Compressed sensing and optimal denoising of monotone signals"
} | null | null | null | null | true | null | 18476 | null | Default | null | null |
null | {
"abstract": " For the problem of nonparametric estimation of signal in Gaussian noise we\npoint out the strong asymptotically minimax estimators on maxisets for linear\nestimators (see \\cite{ker93,rio}). It turns out that the order of rates of\nconvergence of Pinsker estimator on this maxisets is worse than the order of\nrates of convergence for the class of linear estimators considered on this\nmaxisets. We show that balls in Sobolev spaces are maxisets for Pinsker\nestimators.\n",
"title": "On minimax nonparametric estimation of signal in Gaussian noise"
} | null | null | null | null | true | null | 18477 | null | Default | null | null |
null | {
"abstract": " We show that gradient descent on full-width linear convolutional networks of\ndepth $L$ converges to a linear predictor related to the $\\ell_{2/L}$ bridge\npenalty in the frequency domain. This is in contrast to linearly fully\nconnected networks, where gradient descent converges to the hard margin linear\nsupport vector machine solution, regardless of depth.\n",
"title": "Implicit Bias of Gradient Descent on Linear Convolutional Networks"
} | null | null | null | null | true | null | 18478 | null | Default | null | null |
null | {
"abstract": " In this work, we study degradation of clofibric acid (CFA) in aqueous\nsolution using either ionizing radiation from a $^{60}$Co source or a\nnon-thermal plasma produced by discharges in the air above the solution. The\nresults obtained with the two technologies are compared in terms of\neffectiveness of CFA degradation and its by-products. In both cases the CFA\ndegradation follows a quasi-exponential decay in time well modelled by a\nkinetic scheme which considers the competition between CFA and all reaction\nintermediates for the reactive species generated in solution as well as the\namount of the end product formed. A new degradation law is deduced to explain\nthe results. Although the end-product CO$_2$ was detected and the CFA\nconversion found to be very high under the studied conditions, HPLC analysis\nreveals several degradation intermediates still bearing the aromatic ring with\nthe chlorine substituent. The extent of mineralization is rather limited. The\nenergy yield is found to be higher in the gamma radiation experiments.\n",
"title": "Oxidation of clofibric acid in aqueous solution using a non-thermal plasma discharge or gamma radiation"
} | null | null | [
"Physics"
]
| null | true | null | 18479 | null | Validated | null | null |
null | {
"abstract": " The stability against quench is one of the main issue to be pursued in a\nsuperconducting material which should be able to perform at very high levels of\ncurrent densities. Here we focus on the connection between the critical current\n$I_c$ and the quenching current $I^*$ associated to the so-called flux-flow\ninstability phenomenon, which sets in as an abrupt transition from the flux\nflow state to the normal state. To this purpose, we analyze several\ncurrent-voltage characteristics of three types of iron-based thin films,\nacquired at different temperature and applied magnetic field values. For these\nsamples, we discuss the impact of a possible coexistence of intrinsic\nelectronic mechanisms and extrinsic thermal effects on the quenching current\ndependence upon the applied magnetic field. The differences between the\nquenching current and the critical current are reported also in the case of\npredominant intrinsic mechanisms. Carrying out a comparison with\nhigh-temperature cuprate superconductors, we suggest which material can be the\nbest trade-off between maximum operating temperature, higher upper critical\nfield and stability under high current bias.\n",
"title": "Quenching current by flux-flow instability in iron-chalcogenides thin films"
} | null | null | null | null | true | null | 18480 | null | Default | null | null |
null | {
"abstract": " This paper presents new methods to estimate the cardinalities of data sets\nrecorded by HyperLogLog sketches. A theoretically motivated extension to the\noriginal estimator is presented that eliminates the bias for small and large\ncardinalities. Based on the maximum likelihood principle a second unbiased\nmethod is derived together with a robust and efficient numerical algorithm to\ncalculate the estimate. The maximum likelihood approach can also be applied to\nmore than a single HyperLogLog sketch. In particular, it is shown that it gives\nmore precise cardinality estimates for union, intersection, or relative\ncomplements of two sets that are both represented by HyperLogLog sketches\ncompared to the conventional technique using the inclusion-exclusion principle.\nAll the new methods are demonstrated and verified by extensive simulations.\n",
"title": "New cardinality estimation algorithms for HyperLogLog sketches"
} | null | null | null | null | true | null | 18481 | null | Default | null | null |
null | {
"abstract": " The TurLab facility is a laboratory, equipped with a 5 m diameter and 1 m\ndepth rotating tank, located in the Physics Department of the University of\nTurin. The tank has been built mainly to study problems where system rotation\nplays a key role in the fluid behaviour such as in atmospheric and oceanic\nflows at different scales. The tank can be filled with different fluids of\nvariable density, which enables studies in layered conditions such as sea\nwaves. The tank can be also used to simulate the terrestrial surface with the\noptical characteristics of different environments such as snow, grass, ocean,\nland with soil, stones etc., fogs and clouds. As it is located in an extremely\ndark place, the light intensity can be controlled artificially. Such\ncapabilities of the TurLab facility are applied to perform experiments related\nto the observation of Extreme Energy Cosmic Rays (EECRs) from space using the\nfluorescence technique, as in the case of the JEM-EUSO mission, where the\ndiffuse night brightness and artificial light sources can vary significantly in\ntime and space inside the Field of View (FoV) of the telescope. Here we will\nreport the currently ongoing activity at the TurLab facility in the framework\nof the JEM-EUSO mission (EUSO@TurLab).\n",
"title": "The EUSO@TurLab Project"
} | null | null | null | null | true | null | 18482 | null | Default | null | null |
null | {
"abstract": " Electrical machines employing superconductors are attractive solutions in a\nvariety of application domains. Numerical models are powerful and necessary\ntools to optimize their design and predict their performance. The\nelectromagnetic modeling of superconductors by finite-element method (FEM) is\nusually based on a power-law resistivity for their electrical behavior. The\nimplementation of such constitutive law in conventional models of electrical\nmachines is quite problematic: the magnetic vector potential directly gives the\nelectric field and requires using a power-law depending on it. This power-law\nis a non-bounded function that can generate enormous uneven values in low\nelectric field regions that can destroy the reliability of solutions. The\nmethod proposed here consists in separating the model of an electrical machine\nin two parts, where the magnetic field is calculated with the most appropriate\nformulation: the H-formulation in the part containing the superconductors and\nthe A-formulation in the part containing conventional conductors (and possibly\npermanent magnets). The main goal of this work is to determine and to correctly\napply the continuity conditions on the boundary separating the two regions.\nDepending on the location of such boundary -- in the fixed or rotating part of\nthe machine -- the conditions that one needs to apply are different. In\naddition, the application of those conditions requires the use of Lagrange\nmultipliers satisfying the field transforms of the electromagnetic quantities\nin the two reference systems, the fixed and the rotating one. In this article,\nseveral exemplary cases for the possible configurations are presented. In order\nto emphasize and capture the essential point of this modeling strategy, the\ndiscussed examples are rather simple. Nevertheless, they constitute a solid\nstarting point for modeling more complex and realistic devices.\n",
"title": "A finite element method framework for modeling rotating machines with superconducting windings"
} | null | null | [
"Physics"
]
| null | true | null | 18483 | null | Validated | null | null |
null | {
"abstract": " Deterministic recursive algorithms for the computation of matrix triangular\ndecompositions with permutations like LU and Bruhat decomposition are presented\nfor the case of commutative domains. This decomposition can be considered as a\ngeneralization of LU and Bruhat decompositions, because they both may be easily\nobtained from this triangular decomposition. Algorithms have the same\ncomplexity as the algorithm of matrix multiplication.\n",
"title": "Triangular Decomposition of Matrices in a Domain"
} | null | null | null | null | true | null | 18484 | null | Default | null | null |
null | {
"abstract": " We provide a method to solve optimization problem when objective function is\na complex stochastic simulator of an urban transportation system. To reach this\ngoal, a Bayesian optimization framework is introduced. We show how the choice\nof prior and inference algorithm effect the outcome of our optimization\nprocedure. We develop dimensionality reduction techniques that allow for our\noptimization techniques to be applicable for real-life problems. We develop a\ndistributed, Gaussian Process Bayesian regression and active learning models\nthat allow parallel execution of our algorithms and enable usage of high\nperformance computing. We present a fully Bayesian approach that is more sample\nefficient and reduces computational budget. Our framework is supported by\ntheoretical analysis and an empirical study. We demonstrate our framework on\nthe problem of calibrating a multi-modal transportation network of city of\nBloomington, Illinois. Finally, we discuss directions for further research.\n",
"title": "Practical Bayesian Optimization for Transportation Simulators"
} | null | null | null | null | true | null | 18485 | null | Default | null | null |
null | {
"abstract": " It is shown that the Ising distribution can be treated as a latent variable\nmodel, where a set of N real-valued, correlated random variables are drawn and\nused to generate N binary spins independently. This allows to approximate the\nIsing distribution by a simpler model where the latent variables follow a\nmultivariate normal distribution, the so-called Cox distribution. The\napproximation is formally related to an advanced mean field technique known as\nadaptive TAP, and its domain of validity is similar. When valid, it allows a\nprincipled replacement of the Ising distribution by a distribution much easier\nto sample and manipulate.\n",
"title": "The Ising distribution as a latent variable model"
} | null | null | null | null | true | null | 18486 | null | Default | null | null |
null | {
"abstract": " Multi-agent systems (MAS) is able to characterize the behavior of individual\nagent and the interaction between agents. Thus, it motivates us to leverage the\ndistributed constraint optimization problem (DCOP), a framework of modeling\nMAS, to solve the user association problem in heterogeneous networks (HetNets).\nTwo issues we have to consider when we take DCOP into the application of HetNet\nincluding: (i) How to set up an effective model by DCOP taking account of the\nnegtive impact of the increment of users on the modeling process (ii) Which\nkind of algorithms is more suitable to balance the time consumption and the\nquality of soltuion. Aiming to overcome these issues, we firstly come up with\nan ECAV-$\\eta$ (Each Connection As Variable) model in which a parameter $\\eta$\nwith an adequate assignment ($\\eta=3$ in this paper) is able to control the\nscale of the model. After that, a Markov chain (MC) based algorithm is proposed\non the basis of log-sum-exp function. Experimental results show that the\nsolution obtained by DCOP framework is better than the one obtained by the\nMax-SINR algorithm. Comparing with the Lagrange dual decomposition based method\n(LDD), the solution performance has been improved since there is no need to\ntransform original problem into a satisfied one. In addition, it is also\napparent that the DCOP based method has better robustness than LDD when the\nnumber of users increases but the available resource at base stations are\nlimited.\n",
"title": "Applying DCOP to User Association Problem in Heterogeneous Networks with Markov Chain Based Algorithm"
} | null | null | null | null | true | null | 18487 | null | Default | null | null |
null | {
"abstract": " Streaming instability is a powerful mechanism which concentrates dust grains\nin pro- toplanetary discs, eventually up to the stage where they collapse\ngravitationally and form planetesimals. Previous studies inferred that it\nshould be ineffective in viscous discs, too efficient in inviscid discs, and\nmay not operate in local pressure maxima where solids accumulate. From a linear\nanalysis of stability, we show that streaming instability behaves differently\ninside local pressure maxima. Under the action of the strong differential\nadvection imposed by the bump, a novel unstable mode develops and grows even\nwhen gas viscosity is large. Hence, pressure bumps are found to be the only\nplaces where streaming instability occurs in viscous discs. This offers a\npromising way to conciliate models of planet formation with recent observations\nof young discs.\n",
"title": "Linear growth of streaming instability in pressure bumps"
} | null | null | null | null | true | null | 18488 | null | Default | null | null |
null | {
"abstract": " The micro-local Gevrey regularity of a class of \"sums of squares\" with real\nanalytic coefficients is studied in detail. Some partial regularity result is\nalso given.\n",
"title": "On the Gevrey regularity for Sums of Squares of vector fields, study of some models"
} | null | null | null | null | true | null | 18489 | null | Default | null | null |
null | {
"abstract": " We give a new formulation and proof of a theorem of Halmos and Wallen on the\nstructure of power partial isometries on Hilbert space. We then use this\ntheorem to give a structure theorem for a finite set of partial isometries\nwhich star-commute: each operator commutes with the others and with their\nadjoints.\n",
"title": "Structure theorems for star-commuting power partial isometries"
} | null | null | null | null | true | null | 18490 | null | Default | null | null |
null | {
"abstract": " We construct a linear basis of a free GDN superalgebra over a field of\ncharacteristic $\\neq 2$.\nAs applications, we prove a PBW theorem, that is, any GDN superalgebra can be\nembedded into its universal enveloping commutative associative differential\nsuperalgebra. An Engel theorem under some assumptions is given.\n",
"title": "On free Gelfand--Dorfman--Novikov superalgebras and a PBW type theorem"
} | null | null | null | null | true | null | 18491 | null | Default | null | null |
null | {
"abstract": " In this article we investigate an inexact iterative regularization method\nbased on generalized Bregman distances of an optimal control problem with\ncontrol constraints. We show robustness and convergence of the inexact Bregman\nmethod under a regularity assumption, which is a combination of a source\ncondition and a regularity assumption on the active sets. We also take the\ndiscretization error into account. Numerical results are presented to\ndemonstrate the algorithm.\n",
"title": "An inexact iterative Bregman method for optimal control problems"
} | null | null | [
"Mathematics"
]
| null | true | null | 18492 | null | Validated | null | null |
null | {
"abstract": " Mixture models combine multiple components into a single probability density\nfunction. They are a natural statistical model for many situations in\nastronomy, such as surveys containing multiple types of objects, cluster\nanalysis in various data spaces, and complicated distribution functions. This\nchapter in the CRC Handbook of Mixture Analysis is concerned with astronomical\napplications of mixture models for cluster analysis, classification, and\nsemi-parametric density estimation. We present several classification examples\nfrom the literature, including identification of a new class, analysis of\ncontaminants, and overlapping populations. In most cases, mixtures of normal\n(Gaussian) distributions are used, but it is sometimes necessary to use\ndifferent distribution functions derived from astrophysical experience. We also\naddress the use of mixture models for the analysis of spatial distributions of\nobjects, like galaxies in redshift surveys or young stars in star-forming\nregions. In the case of galaxy clustering, mixture models may not be the\noptimal choice for understanding the homogeneous and isotropic structure of\nvoids and filaments. However, we show that mixture models, using astrophysical\nmodels for star clusters, may provide a natural solution to the problem of\nsubdividing a young stellar population into subclusters. Finally, we explore\nhow mixture models can be used for mathematically advanced modeling of data\nwith heteroscedastic uncertainties or missing values, providing two example\nalgorithms, the measurement error regression model of Kelly (2007) and the\nExtreme Deconvolution model of Bovy et al. (2011). The challenges presented by\nastronomical science, aided by the public availability of catalogs from major\nsurveys and missions, are a rich area for collaboration between statisticians\nand astronomers.\n",
"title": "Mixture Models in Astronomy"
} | null | null | null | null | true | null | 18493 | null | Default | null | null |
null | {
"abstract": " Most of the existing medicine recommendation systems that are mainly based on\nelectronic medical records (EMRs) are significantly assisting doctors to make\nbetter clinical decisions benefiting both patients and caregivers. Even though\nthe growth of EMRs is at a lighting fast speed in the era of big data, content\nlimitations in EMRs restrain the existed recommendation systems to reflect\nrelevant medical facts, such as drug-drug interactions. Many medical knowledge\ngraphs that contain drug-related information, such as DrugBank, may give hope\nfor the recommendation systems. However, the direct use of these knowledge\ngraphs in the systems suffers from robustness caused by the incompleteness of\nthe graphs. To address these challenges, we stand on recent advances in graph\nembedding learning techniques and propose a novel framework, called Safe\nMedicine Recommendation (SMR), in this paper. Specifically, SMR first\nconstructs a high-quality heterogeneous graph by bridging EMRs (MIMIC-III) and\nmedical knowledge graphs (ICD-9 ontology and DrugBank). Then, SMR jointly\nembeds diseases, medicines, patients, and their corresponding relations into a\nshared lower dimensional space. Finally, SMR uses the embeddings to decompose\nthe medicine recommendation into a link prediction process while considering\nthe patient's diagnoses and adverse drug reactions. To our best knowledge, SMR\nis the first to learn embeddings of a patient-disease-medicine graph for\nmedicine recommendation in the world. Extensive experiments on real datasets\nare conducted to evaluate the effectiveness of proposed framework.\n",
"title": "Safe Medicine Recommendation via Medical Knowledge Graph Embedding"
} | null | null | null | null | true | null | 18494 | null | Default | null | null |
null | {
"abstract": " Deep neural networks (DNNs) have achieved great success in solving a variety\nof machine learning (ML) problems, especially in the domain of image\nrecognition. However, recent research showed that DNNs can be highly vulnerable\nto adversarially generated instances, which look seemingly normal to human\nobservers, but completely confuse DNNs. These adversarial samples are crafted\nby adding small perturbations to normal, benign images. Such perturbations,\nwhile imperceptible to the human eye, are picked up by DNNs and cause them to\nmisclassify the manipulated instances with high confidence. In this work, we\nexplore and demonstrate how systematic JPEG compression can work as an\neffective pre-processing step in the classification pipeline to counter\nadversarial attacks and dramatically reduce their effects (e.g., Fast Gradient\nSign Method, DeepFool). An important component of JPEG compression is its\nability to remove high frequency signal components, inside square blocks of an\nimage. Such an operation is equivalent to selective blurring of the image,\nhelping remove additive perturbations. Further, we propose an ensemble-based\ntechnique that can be constructed quickly from a given well-performing DNN, and\nempirically show how such an ensemble that leverages JPEG compression can\nprotect a model from multiple types of adversarial attacks, without requiring\nknowledge about the model.\n",
"title": "Keeping the Bad Guys Out: Protecting and Vaccinating Deep Learning with JPEG Compression"
} | null | null | null | null | true | null | 18495 | null | Default | null | null |
null | {
"abstract": " Magnetic Resonance Imaging (MRI) is a widely applied non-invasive imaging\nmodality based on non-ionizing radiation which gives excellent images and soft\ntissue contrast of living tissues. We consider the modified Bloch problem as a\nmodel of MRI for flowing spins in an incompressible flow field. After\nestablishing the well-posedness of the corresponding evolution problem, we\nanalyze its spatial semidiscretization using discontinuous Galerkin methods.\nThe high frequency time evolution requires a proper explicit and adaptive\ntemporal discretization. The applicability of the approach is shown for basic\nexamples.\n",
"title": "Numerical Simulation of Bloch Equations for Dynamic Magnetic Resonance Imaging"
} | null | null | null | null | true | null | 18496 | null | Default | null | null |
null | {
"abstract": " Speech enhancement model is used to map a noisy speech to a clean speech. In\nthe training stage, an objective function is often adopted to optimize the\nmodel parameters. However, in most studies, there is an inconsistency between\nthe model optimization criterion and the evaluation criterion on the enhanced\nspeech. For example, in measuring speech intelligibility, most of the\nevaluation metric is based on a short-time objective intelligibility (STOI)\nmeasure, while the frame based minimum mean square error (MMSE) between\nestimated and clean speech is widely used in optimizing the model. Due to the\ninconsistency, there is no guarantee that the trained model can provide optimal\nperformance in applications. In this study, we propose an end-to-end\nutterance-based speech enhancement framework using fully convolutional neural\nnetworks (FCN) to reduce the gap between the model optimization and evaluation\ncriterion. Because of the utterance-based optimization, temporal correlation\ninformation of long speech segments, or even at the entire utterance level, can\nbe considered when perception-based objective functions are used for the direct\noptimization. As an example, we implement the proposed FCN enhancement\nframework to optimize the STOI measure. Experimental results show that the STOI\nof test speech is better than conventional MMSE-optimized speech due to the\nconsistency between the training and evaluation target. Moreover, by\nintegrating the STOI in model optimization, the intelligibility of human\nsubjects and automatic speech recognition (ASR) system on the enhanced speech\nis also substantially improved compared to those generated by the MMSE\ncriterion.\n",
"title": "End-to-End Waveform Utterance Enhancement for Direct Evaluation Metrics Optimization by Fully Convolutional Neural Networks"
} | null | null | null | null | true | null | 18497 | null | Default | null | null |
null | {
"abstract": " `Double edge swaps' transform one graph into another while preserving the\ngraph's degree sequence, and have thus been used in a number of popular Markov\nchain Monte Carlo (MCMC) sampling techniques. However, while double edge-swaps\ncan transform, for any fixed degree sequence, any two graphs inside the classes\nof simple graphs, multigraphs, and pseudographs, this is not true for graphs\nwhich allow self-loops but not multiedges (loopy graphs). Indeed, we exactly\ncharacterize the degree sequences where double edge swaps cannot reach every\nvalid loopy graph and develop an efficient algorithm to determine such degree\nsequences. The same classification scheme to characterize degree sequences can\nbe used to prove that, for all degree sequences, loopy graphs are connected by\na combination of double and triple edge swaps. Thus, we contribute the first\nMCMC sampler that uniformly samples loopy graphs with any given sequence.\n",
"title": "The connectivity of graphs of graphs with self-loops and a given degree sequence"
} | null | null | null | null | true | null | 18498 | null | Default | null | null |
null | {
"abstract": " Background has played an important role in X-ray missions, limiting the\nexploitation of science data in several and sometimes unexpected ways. In this\npresentation I review past X-ray missions focusing on some important lessons we\ncan learn from them. I then go on discussing prospects for overcoming\nbackground related limitations in future ones.\n",
"title": "The role of the background in past and future X-ray missions"
} | null | null | null | null | true | null | 18499 | null | Default | null | null |
null | {
"abstract": " Widespread interest in the emerging area of predictive analytics is driving\nindustries such as manufacturing to explore new approaches to the collection\nand management of data provided from Industrial Internet of Things (IIoT)\ndevices. Often, analytics processing for Business Intelligence (BI) is an\nintensive task, and it also presents both an opportunity for competitive\nadvantage as well as a security vulnerability in terms of the potential for\nlosing Intellectual Property (IP). This article explores two approaches to\nsecuring BI in the manufacturing domain. Simulation results indicate that a\nUnified Threat Management (UTM) model is simpler to maintain and has less\npotential vulnerabilities than a distributed security model. Conversely, a\ndistributed model of security out-performs the UTM model and offers more scope\nfor the use of existing hardware resources. In conclusion, a hybrid security\nmodel is proposed where security controls are segregated into a multi-cloud\narchitecture.\n",
"title": "Securing Manufacturing Intelligence for the Industrial Internet of Things"
} | null | null | null | null | true | null | 18500 | null | Default | null | null |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.