id float64 706 1.8k | title stringlengths 1 343 | abstract stringlengths 6 6.09k | categories stringlengths 5 125 | processed_abstract stringlengths 2 5.96k | tokenized_abstract stringlengths 8 8.74k | centroid stringlengths 2.1k 2.17k |
|---|---|---|---|---|---|---|
1,802.0626 | A Collaborative Computer Aided Diagnosis (C-CAD) System with
Eye-Tracking, Sparse Attentional Model, and Deep Learning | There are at least two categories of errors in radiology screening that can
lead to suboptimal diagnostic decisions and interventions:(i)human fallibility
and (ii)complexity of visual search. Computer aided diagnostic (CAD) tools are
developed to help radiologists to compensate for some of these errors. However,
desp... | cs.CV cs.AI cs.LG | there are at least two categories of errors in radiology screening that can lead to suboptimal diagnostic decisions and interventionsihuman fallibility and iicomplexity of visual search computer aided diagnostic cad tools are developed to help radiologists to compensate for some of these errors however despite their si... | [['there', 'are', 'at', 'least', 'two', 'categories', 'of', 'errors', 'in', 'radiology', 'screening', 'that', 'can', 'lead', 'to', 'suboptimal', 'diagnostic', 'decisions', 'and', 'interventionsihuman', 'fallibility', 'and', 'iicomplexity', 'of', 'visual', 'search', 'computer', 'aided', 'diagnostic', 'cad', 'tools', 'ar... | [-0.018799098501296935, 0.025834252345756634, -0.10574101677904015, 0.09644644686255453, -0.16408760754497695, -0.21425473402247436, 0.05543433034729199, 0.4490071970401058, -0.23086722400630072, -0.36258112756631283, 0.09373384779952604, -0.2871303435702644, -0.21521886794567657, 0.21388849575733354, -0.17813115140341... |
1,802.06261 | Non-degeneracy of cohomological traces for general Landau-Ginzburg
models | We prove non-degeneracy of the cohomological bulk and boundary traces for
general open-closed Landau-Ginzburg models associated to a pair $(X,W)$, where
$X$ is a non-compact complex manifold with trivial canonical line bundle and
$W$ is a complex-valued holomorphic function defined on $X$, assuming only that
the crit... | math.AG hep-th math.CV | we prove nondegeneracy of the cohomological bulk and boundary traces for general openclosed landauginzburg models associated to a pair xw where x is a noncompact complex manifold with trivial canonical line bundle and w is a complexvalued holomorphic function defined on x assuming only that the critical locus of w is c... | [['we', 'prove', 'nondegeneracy', 'of', 'the', 'cohomological', 'bulk', 'and', 'boundary', 'traces', 'for', 'general', 'openclosed', 'landauginzburg', 'models', 'associated', 'to', 'a', 'pair', 'xw', 'where', 'x', 'is', 'a', 'noncompact', 'complex', 'manifold', 'with', 'trivial', 'canonical', 'line', 'bundle', 'and', '... | [-0.20117179962585024, 0.0609195903974173, -0.08401263136699123, 0.09690525832769202, -0.12180740630338122, -0.17412656012800384, -0.008055209495188271, 0.3378962237372628, -0.34419229840401744, -0.1787847783511932, 0.0762743979585586, -0.2068159391303913, -0.1302005847988528, 0.17198281683272026, -0.1677797317054489, ... |
1,802.06262 | Probing Patchy Saturation of Fluids in Nanoporous Media by Ultrasound | Nanoporous materials provide high surface area per unit mass and are capable
of fluids adsorption. While the measurements of overall amount of fluid
adsorbed by a nanopororus sample are straightforward, probing the fluid spacial
distribution is non-trivial. We consider published data on adsorption and
desorption of f... | physics.geo-ph physics.app-ph | nanoporous materials provide high surface area per unit mass and are capable of fluids adsorption while the measurements of overall amount of fluid adsorbed by a nanopororus sample are straightforward probing the fluid spacial distribution is nontrivial we consider published data on adsorption and desorption of fluids ... | [['nanoporous', 'materials', 'provide', 'high', 'surface', 'area', 'per', 'unit', 'mass', 'and', 'are', 'capable', 'of', 'fluids', 'adsorption', 'while', 'the', 'measurements', 'of', 'overall', 'amount', 'of', 'fluid', 'adsorbed', 'by', 'a', 'nanopororus', 'sample', 'are', 'straightforward', 'probing', 'the', 'fluid', ... | [-0.07205246506674477, 0.14258463567792445, -0.05920284575482538, -0.03300634065877708, -0.020208941926517763, -0.09535831764478944, 0.010425070802919751, 0.4007221256067191, -0.2022574332442658, -0.3389859085687059, 0.052371172616373717, -0.3316335702114854, -0.07547238930936687, 0.1478985667003565, -0.012602340680650... |
1,802.06263 | Stochastic multiscale flux basis for Stokes-Darcy flows | Three algorithms are developed for uncertainty quantification in modeling
coupled Stokes and Darcy flows. The porous media may consist of multiple
regions with different properties. The permeability is modeled as a
non-stationary stochastic variable, with its log represented as a sum of local
Karhunen-Lo\`eve (KL) ex... | math.NA | three algorithms are developed for uncertainty quantification in modeling coupled stokes and darcy flows the porous media may consist of multiple regions with different properties the permeability is modeled as a nonstationary stochastic variable with its log represented as a sum of local karhunenloeve kl expansions th... | [['three', 'algorithms', 'are', 'developed', 'for', 'uncertainty', 'quantification', 'in', 'modeling', 'coupled', 'stokes', 'and', 'darcy', 'flows', 'the', 'porous', 'media', 'may', 'consist', 'of', 'multiple', 'regions', 'with', 'different', 'properties', 'the', 'permeability', 'is', 'modeled', 'as', 'a', 'nonstationa... | [-0.10418581461191785, 0.05073185554587957, -0.0634631759829211, 0.0012847441804538272, -0.0720975463810776, -0.15334445624992404, 0.004783882272942942, 0.3692040291662347, -0.34636750064258065, -0.262817889432974, 0.13675163690266864, -0.22868182662190223, -0.1025273865659018, 0.16136782312271547, -0.05542914135184386... |
1,802.06264 | Monotonicity in inverse medium scattering on unbounded domains | We discuss a time-harmonic inverse scattering problem for the Helmholtz
equation with compactly supported penetrable and possibly inhomogeneous
scattering objects in an unbounded homogeneous background medium, and we
develop a monotonicity relation for the far field operator that maps
superpositions of incident plane... | math.AP | we discuss a timeharmonic inverse scattering problem for the helmholtz equation with compactly supported penetrable and possibly inhomogeneous scattering objects in an unbounded homogeneous background medium and we develop a monotonicity relation for the far field operator that maps superpositions of incident plane wav... | [['we', 'discuss', 'a', 'timeharmonic', 'inverse', 'scattering', 'problem', 'for', 'the', 'helmholtz', 'equation', 'with', 'compactly', 'supported', 'penetrable', 'and', 'possibly', 'inhomogeneous', 'scattering', 'objects', 'in', 'an', 'unbounded', 'homogeneous', 'background', 'medium', 'and', 'we', 'develop', 'a', 'mo... | [-0.12125801989838245, 0.14588647786484446, -0.06838819624211827, 0.07908039653387966, -0.09768082771115202, -0.0692814993228586, -7.376950800852486e-05, 0.402011892058586, -0.3040320328165772, -0.26270082252957516, 0.11763702076859772, -0.3075270463722369, -0.12725833518721322, 0.1886105393712463, -0.03930384895940454... |
1,802.06265 | Statistical Link Label Modeling for Sign Prediction: Smoothing Sparsity
by Joining Local and Global Information | One of the major issues in signed networks is to use network structure to
predict the missing sign of an edge. In this paper, we introduce a novel
probabilistic approach for the sign prediction problem. The main characteristic
of the proposed models is their ability to adapt to the sparsity level of an
input network.... | cs.SI physics.soc-ph | one of the major issues in signed networks is to use network structure to predict the missing sign of an edge in this paper we introduce a novel probabilistic approach for the sign prediction problem the main characteristic of the proposed models is their ability to adapt to the sparsity level of an input network the s... | [['one', 'of', 'the', 'major', 'issues', 'in', 'signed', 'networks', 'is', 'to', 'use', 'network', 'structure', 'to', 'predict', 'the', 'missing', 'sign', 'of', 'an', 'edge', 'in', 'this', 'paper', 'we', 'introduce', 'a', 'novel', 'probabilistic', 'approach', 'for', 'the', 'sign', 'prediction', 'problem', 'the', 'main'... | [-0.07389250350330134, -0.013222986781482883, -0.08807824875074852, 0.07580937675882193, -0.1005229263336551, -0.12833970010217735, 0.04340302002692854, 0.40247105291498364, -0.29865182855241157, -0.3289874163436613, 0.10263793040135726, -0.22971880378570989, -0.20626956022065526, 0.15622722996690583, -0.11821474641549... |
1,802.06266 | An analysis of training and generalization errors in shallow and deep
networks | This paper is motivated by an open problem around deep networks, namely, the
apparent absence of over-fitting despite large over-parametrization which
allows perfect fitting of the training data. In this paper, we analyze this
phenomenon in the case of regression problems when each unit evaluates a
periodic activatio... | cs.LG cs.NA math.NA | this paper is motivated by an open problem around deep networks namely the apparent absence of overfitting despite large overparametrization which allows perfect fitting of the training data in this paper we analyze this phenomenon in the case of regression problems when each unit evaluates a periodic activation functi... | [['this', 'paper', 'is', 'motivated', 'by', 'an', 'open', 'problem', 'around', 'deep', 'networks', 'namely', 'the', 'apparent', 'absence', 'of', 'overfitting', 'despite', 'large', 'overparametrization', 'which', 'allows', 'perfect', 'fitting', 'of', 'the', 'training', 'data', 'in', 'this', 'paper', 'we', 'analyze', 'th... | [-0.07282179672150843, -0.011253797835876956, -0.0649690045133954, 0.15727527018095697, -0.06550176843039451, -0.11330917074134754, 0.09772589054078826, 0.36181139865769973, -0.3000423147072715, -0.3172301633824264, 0.12995036679034633, -0.2475892742495841, -0.1863356714876699, 0.18003137609545863, -0.1759488963792401,... |
1,802.06267 | Gelation of patchy gold nanoparticles decorated by liquid-crystalline
ligands: computer simulation study | We consider patchy gold nanoparticles decorated by liquid crystalline
ligands. The cases of two, three, four and six symmetrically arranged patches
of ligands are discussed, as well as the cases of their equatorial and uniform
arrangement. A solution of decorated nanoparticles is considered within a flat
pore with th... | cond-mat.soft | we consider patchy gold nanoparticles decorated by liquid crystalline ligands the cases of two three four and six symmetrically arranged patches of ligands are discussed as well as the cases of their equatorial and uniform arrangement a solution of decorated nanoparticles is considered within a flat pore with the solid... | [['we', 'consider', 'patchy', 'gold', 'nanoparticles', 'decorated', 'by', 'liquid', 'crystalline', 'ligands', 'the', 'cases', 'of', 'two', 'three', 'four', 'and', 'six', 'symmetrically', 'arranged', 'patches', 'of', 'ligands', 'are', 'discussed', 'as', 'well', 'as', 'the', 'cases', 'of', 'their', 'equatorial', 'and', '... | [-0.11027200938067364, 0.18794648631525632, -0.029754127446874862, -0.013786475793529615, 0.0016122228067851703, -0.14699712639873605, 0.05425937481594222, 0.41984684409872264, -0.2532657343069561, -0.2761656246352443, 0.06890508706702758, -0.2914136996251026, -0.12187880916407204, 0.08344211759230563, 0.02429857799065... |
1,802.06268 | McKean-Vlasov diffusion and the well-posedness of the Hookean
bead-spring-chain model for dilute polymeric fluids: small-mass limit and
equilibration in momentum space | We reformulate a general class of classical bead-spring-chain models for
dilute polymeric fluids, with Hookean spring potentials, as McKean-Vlasov
diffusion. This results in a coupled system of partial differential equations
involving the unsteady incompressible linearized Navier-Stokes equations,
referred to as the ... | math.AP | we reformulate a general class of classical beadspringchain models for dilute polymeric fluids with hookean spring potentials as mckeanvlasov diffusion this results in a coupled system of partial differential equations involving the unsteady incompressible linearized navierstokes equations referred to as the oseen syst... | [['we', 'reformulate', 'a', 'general', 'class', 'of', 'classical', 'beadspringchain', 'models', 'for', 'dilute', 'polymeric', 'fluids', 'with', 'hookean', 'spring', 'potentials', 'as', 'mckeanvlasov', 'diffusion', 'this', 'results', 'in', 'a', 'coupled', 'system', 'of', 'partial', 'differential', 'equations', 'involvin... | [-0.12279913035379122, 0.10186990997153184, -0.09235099222891593, 0.006824892854833755, -0.06760492237905662, -0.1147864112650515, -0.03756577904606538, 0.2864107551273479, -0.3146417934137086, -0.22323290383197888, 0.09568274801381693, -0.2572158432255189, -0.1345396539827268, 0.14395311207295225, -0.01899829833087341... |
1,802.06269 | Initial-boundary value problems for multi-term time-fractional diffusion
equations with x-dependent coefficients | In this paper, we discuss an initial-boundary value problem (IBVP) for the
multi-term time-fractional diffusion equation with x-dependent coefficients. By
means of the Mittag-Leffler functions and the eigenfunction expansion, we
reduce the IBVP to an equivalent integral equation to show the unique existence
and the a... | math.AP | in this paper we discuss an initialboundary value problem ibvp for the multiterm timefractional diffusion equation with xdependent coefficients by means of the mittagleffler functions and the eigenfunction expansion we reduce the ibvp to an equivalent integral equation to show the unique existence and the analyticity o... | [['in', 'this', 'paper', 'we', 'discuss', 'an', 'initialboundary', 'value', 'problem', 'ibvp', 'for', 'the', 'multiterm', 'timefractional', 'diffusion', 'equation', 'with', 'xdependent', 'coefficients', 'by', 'means', 'of', 'the', 'mittagleffler', 'functions', 'and', 'the', 'eigenfunction', 'expansion', 'we', 'reduce',... | [-0.11625243538493613, 0.024717556628344867, -0.04826964981710682, 0.06082076689747807, -0.0976167011522473, -0.04613197546165723, -0.03530068667515969, 0.29040254066483334, -0.3744753502452603, -0.20326224520014455, 0.19740312205260405, -0.31901870088365214, -0.1233897533124456, 0.16767481197244846, 0.0288136946986644... |
1,802.0627 | MAVIS: Managing Datacenters using Smartphones | Distributed monitoring plays a crucial role in managing the activities of
cloud-based datacenters. System administrators have long relied on monitoring
systems such as Nagios and Ganglia to obtain status alerts on their
desktop-class machines. However, the popularity of mobile devices is pushing
the community to deve... | cs.DC | distributed monitoring plays a crucial role in managing the activities of cloudbased datacenters system administrators have long relied on monitoring systems such as nagios and ganglia to obtain status alerts on their desktopclass machines however the popularity of mobile devices is pushing the community to develop dat... | [['distributed', 'monitoring', 'plays', 'a', 'crucial', 'role', 'in', 'managing', 'the', 'activities', 'of', 'cloudbased', 'datacenters', 'system', 'administrators', 'have', 'long', 'relied', 'on', 'monitoring', 'systems', 'such', 'as', 'nagios', 'and', 'ganglia', 'to', 'obtain', 'status', 'alerts', 'on', 'their', 'des... | [-0.1336536054759226, 0.019198839631523395, -0.045772421324660105, 0.018235676102685155, -0.1017635840172362, -0.16057383912805193, 0.09294163420175512, 0.38596408487043204, -0.255826283470486, -0.3259678678673313, 0.20310911067429482, -0.301281845473029, -0.14216106618685578, 0.23342565991225894, -0.09422455985461259,... |
1,802.06271 | Lower Bounds on Sparse Spanners, Emulators, and Diameter-reducing
shortcuts | We prove better lower bounds on additive spanners and emulators, which are
lossy compression schemes for undirected graphs, as well as lower bounds on
shortcut sets, which reduce the diameter of directed graphs. We show that any
$O(n)$-size shortcut set cannot bring the diameter below $\Omega(n^{1/6})$, and
that any ... | cs.DS | we prove better lower bounds on additive spanners and emulators which are lossy compression schemes for undirected graphs as well as lower bounds on shortcut sets which reduce the diameter of directed graphs we show that any onsize shortcut set cannot bring the diameter below omegan16 and that any omsize shortcut set c... | [['we', 'prove', 'better', 'lower', 'bounds', 'on', 'additive', 'spanners', 'and', 'emulators', 'which', 'are', 'lossy', 'compression', 'schemes', 'for', 'undirected', 'graphs', 'as', 'well', 'as', 'lower', 'bounds', 'on', 'shortcut', 'sets', 'which', 'reduce', 'the', 'diameter', 'of', 'directed', 'graphs', 'we', 'show... | [-0.06755335248269878, 0.14808751923124214, -0.044239818005935176, 0.08505427716606921, -0.09583053166804077, -0.20969137423518266, 0.144715187869004, 0.38305503342832836, -0.25051802662866457, -0.411910404763338, 0.10619921844636837, -0.24140524182591463, -0.17734952310898475, 0.287204808054062, -0.13169974238089807, ... |
1,802.06272 | Superconductivity induced by flexural modes in non $\sigma_{\rm
h}$-symmetric Dirac-like two-dimensional materials: A theoretical study for
silicene and germanene | In two-dimensional crystals that lack symmetry under reflections on the
horizontal plane of the lattice (non-$\sigma_{\rm h}$-symmetric), electrons can
couple to flexural modes (ZA phonons) at first order. We show that in materials
of this type that also exhibit a Dirac-like electron dispersion, the strong
coupling c... | cond-mat.supr-con | in twodimensional crystals that lack symmetry under reflections on the horizontal plane of the lattice nonsigma_rm hsymmetric electrons can couple to flexural modes za phonons at first order we show that in materials of this type that also exhibit a diraclike electron dispersion the strong coupling can result in electr... | [['in', 'twodimensional', 'crystals', 'that', 'lack', 'symmetry', 'under', 'reflections', 'on', 'the', 'horizontal', 'plane', 'of', 'the', 'lattice', 'nonsigma_rm', 'hsymmetric', 'electrons', 'can', 'couple', 'to', 'flexural', 'modes', 'za', 'phonons', 'at', 'first', 'order', 'we', 'show', 'that', 'in', 'materials', 'o... | [-0.1901851466172957, 0.21781139554574716, -0.019054971240014613, 0.05102732804066553, -0.06473780198818228, -0.17410302727027252, 0.08495934902930458, 0.3974565376023141, -0.2766917126403617, -0.2514862912503304, 0.042567590240044716, -0.30859483157109935, -0.13606415714821196, 0.1717358204902363, 0.05433120168648505,... |
1,802.06273 | Derivatives of Eisenstein series of weight 2 and intersections of
modular correspondences | We give a formula for certain values and derivatives of Siegel series and use
them to compute Fourier coefficients of derivatives of the Siegel Eisenstein
series of weight g/2 and genus g. When g=4, the Fourier coefficient is
approximated by a certain Fourier coefficient of the central derivative of the
Siegel Eisens... | math.NT | we give a formula for certain values and derivatives of siegel series and use them to compute fourier coefficients of derivatives of the siegel eisenstein series of weight g2 and genus g when g4 the fourier coefficient is approximated by a certain fourier coefficient of the central derivative of the siegel eisenstein s... | [['we', 'give', 'a', 'formula', 'for', 'certain', 'values', 'and', 'derivatives', 'of', 'siegel', 'series', 'and', 'use', 'them', 'to', 'compute', 'fourier', 'coefficients', 'of', 'derivatives', 'of', 'the', 'siegel', 'eisenstein', 'series', 'of', 'weight', 'g2', 'and', 'genus', 'g', 'when', 'g4', 'the', 'fourier', 'co... | [-0.20996562976681862, 0.05520070876634444, -0.1286128458485613, 0.05719499127569059, -0.10619578801140368, -0.0909170028416956, 0.004315523340939039, 0.2913809450545225, -0.3163592477878892, -0.2420126676211605, 0.11827536905184388, -0.2707795863634492, -0.1835888600852116, 0.24104448752365557, -0.07354526571278651, 0... |
1,802.06274 | Automatic Classification of Roof Shapes for Multicopter Emergency
Landing Site Selection | Geographic information systems (GIS) now provide accurate maps of terrain,
roads, waterways, and building footprints and heights. Aircraft, particularly
small unmanned aircraft systems, can exploit additional information such as
building roof structure to improve navigation accuracy and safety particularly
in urban r... | cs.RO | geographic information systems gis now provide accurate maps of terrain roads waterways and building footprints and heights aircraft particularly small unmanned aircraft systems can exploit additional information such as building roof structure to improve navigation accuracy and safety particularly in urban regions thi... | [['geographic', 'information', 'systems', 'gis', 'now', 'provide', 'accurate', 'maps', 'of', 'terrain', 'roads', 'waterways', 'and', 'building', 'footprints', 'and', 'heights', 'aircraft', 'particularly', 'small', 'unmanned', 'aircraft', 'systems', 'can', 'exploit', 'additional', 'information', 'such', 'as', 'building'... | [-0.0747146451752983, 0.01988779075436742, -0.044521548622900524, 0.08547228992622542, -0.13851067683610477, -0.20083557891955292, 0.03828190909996208, 0.43681693593866394, -0.2553071707445092, -0.3396105287295479, 0.12978142490295372, -0.3038844351019514, -0.1745427537786501, 0.23263063156781227, -0.16207617085385032,... |
1,802.06275 | Protein motion in the nucleus: from anomalous diffusion to weak
interactions | Understanding how transcription factors (TFs) regulate mammalian gene
expression in space and time is a central topic in biology. To activate a gene,
a TF has first to diffuse in the available space of the nucleus until it
reaches a target DNA sequence or protein (target site). This eventually results
in the recruitm... | q-bio.SC physics.bio-ph | understanding how transcription factors tfs regulate mammalian gene expression in space and time is a central topic in biology to activate a gene a tf has first to diffuse in the available space of the nucleus until it reaches a target dna sequence or protein target site this eventually results in the recruitment of th... | [['understanding', 'how', 'transcription', 'factors', 'tfs', 'regulate', 'mammalian', 'gene', 'expression', 'in', 'space', 'and', 'time', 'is', 'a', 'central', 'topic', 'in', 'biology', 'to', 'activate', 'a', 'gene', 'a', 'tf', 'has', 'first', 'to', 'diffuse', 'in', 'the', 'available', 'space', 'of', 'the', 'nucleus', ... | [-0.09402411935992777, 0.16985286717632211, -0.0580278817197497, 0.11981899870683867, -0.04198823608212957, -0.12889885514120297, 0.06493277653143216, 0.3836379911386429, -0.30467364548432424, -0.2869709026391436, 0.04593298919638969, -0.280852599563913, -0.2094757918975687, 0.15248936611180425, 0.012307283927203346, -... |
1,802.06276 | Interactive Estimation of the Fractal Properties of Carbonate Rocks | Scale invariance of intrinsic patterns is an important concept in geology
that can be observed in numerous geological objects and phenomena. These
geological objects and phenomena are described as containing statistically
selfsimilar patterns often modeled with fractal geometry. Fractal geometry has
been used extensi... | physics.geo-ph | scale invariance of intrinsic patterns is an important concept in geology that can be observed in numerous geological objects and phenomena these geological objects and phenomena are described as containing statistically selfsimilar patterns often modeled with fractal geometry fractal geometry has been used extensively... | [['scale', 'invariance', 'of', 'intrinsic', 'patterns', 'is', 'an', 'important', 'concept', 'in', 'geology', 'that', 'can', 'be', 'observed', 'in', 'numerous', 'geological', 'objects', 'and', 'phenomena', 'these', 'geological', 'objects', 'and', 'phenomena', 'are', 'described', 'as', 'containing', 'statistically', 'sel... | [-0.04270915796167284, 0.11549122589502037, -0.10524963441392335, 0.10054765973569445, -0.07007212932375954, -0.08878035483063708, -0.044298469558491975, 0.3878882708058831, -0.28831177568629135, -0.33009236421724214, 0.1410642999535663, -0.286274844044768, -0.16325300544383292, 0.21302843231898191, -0.0834534047866106... |
1,802.06277 | Neutron lifetime, dark matter and search for sterile neutrino | A review is focused on experimental measurements on neutron lifetime. The
latest measurements with a gravitational trap (PNPI NRC KI) and a magnetic trap
(LANL, USA) confirmed PNPI result of 2005. The results of measurements with
storage of ultra cold neutrons are in agreement, yet, there is discrepancy with
a beam e... | nucl-ex | a review is focused on experimental measurements on neutron lifetime the latest measurements with a gravitational trap pnpi nrc ki and a magnetic trap lanl usa confirmed pnpi result of 2005 the results of measurements with storage of ultra cold neutrons are in agreement yet there is discrepancy with a beam experiment b... | [['a', 'review', 'is', 'focused', 'on', 'experimental', 'measurements', 'on', 'neutron', 'lifetime', 'the', 'latest', 'measurements', 'with', 'a', 'gravitational', 'trap', 'pnpi', 'nrc', 'ki', 'and', 'a', 'magnetic', 'trap', 'lanl', 'usa', 'confirmed', 'pnpi', 'result', 'of', '2005', 'the', 'results', 'of', 'measuremen... | [-0.0784423865562493, 0.20496300568096285, -0.06939918144003246, 0.09219219824315164, -0.03445536784898675, -0.09990276833071234, 0.07334753293432422, 0.3191445188513919, -0.18039369830632046, -0.36286104389100354, 0.045467964054084514, -0.31595853793160505, -0.003996656094486378, 0.19984469509584676, -0.00845736296917... |
1,802.06278 | A discrete extrinsic and intrinsic Dirac operator | In differential geometry of surfaces the Dirac operator appears intrinsically
as a tool to address the immersion problem as well as in an extrinsic flavour
(that comes with spin transformations to comformally transfrom immersions) and
the two are naturally related.
In this paper we consider a corresponding pair of ... | math.DG | in differential geometry of surfaces the dirac operator appears intrinsically as a tool to address the immersion problem as well as in an extrinsic flavour that comes with spin transformations to comformally transfrom immersions and the two are naturally related in this paper we consider a corresponding pair of discret... | [['in', 'differential', 'geometry', 'of', 'surfaces', 'the', 'dirac', 'operator', 'appears', 'intrinsically', 'as', 'a', 'tool', 'to', 'address', 'the', 'immersion', 'problem', 'as', 'well', 'as', 'in', 'an', 'extrinsic', 'flavour', 'that', 'comes', 'with', 'spin', 'transformations', 'to', 'comformally', 'transfrom', '... | [-0.11922517794716571, 0.10398176870661033, -0.03485767298130965, 0.09537532695388536, -0.0629318994707523, -0.1308051461059296, -0.04581960644668006, 0.38953169862198056, -0.32522124793304474, -0.26930617900299175, 0.11844331950272377, -0.30535225843421504, -0.20087481753862635, 0.16982119654932495, -0.114938129547375... |
1,802.06279 | Statistical Reasoning: Choosing and Checking the Ingredients, Inferences
Based on a Measure of Statistical Evidence with Some Applications | The features of a logically sound approach to a theory of statistical
reasoning are discussed. A particular approach that satisfies these criteria is
reviewed. This is seen to involve selection of a model, model checking,
elicitation of a prior, checking the prior for bias, checking for prior-data
conflict and estima... | math.ST stat.TH | the features of a logically sound approach to a theory of statistical reasoning are discussed a particular approach that satisfies these criteria is reviewed this is seen to involve selection of a model model checking elicitation of a prior checking the prior for bias checking for priordata conflict and estimation and ... | [['the', 'features', 'of', 'a', 'logically', 'sound', 'approach', 'to', 'a', 'theory', 'of', 'statistical', 'reasoning', 'are', 'discussed', 'a', 'particular', 'approach', 'that', 'satisfies', 'these', 'criteria', 'is', 'reviewed', 'this', 'is', 'seen', 'to', 'involve', 'selection', 'of', 'a', 'model', 'model', 'checki... | [-0.08881664200394292, 0.0009375694691441069, -0.13176553508247993, 0.11166973895689641, -0.14162603657542153, -0.17066989964664434, 0.09821520847705842, 0.36558344784061036, -0.23359476544452135, -0.3503269162781612, 0.1293686467335757, -0.21285329144824333, -0.1651582657312504, 0.18753563727762532, -0.086545637239598... |
1,802.0628 | Spatial field reconstruction with INLA: Application to IFU galaxy data | Astronomical observations of extended sources, such as cubes of integral
field spectroscopy (IFS), encode auto-correlated spatial structures that cannot
be optimally exploited by standard methodologies. This work introduces a novel
technique to model IFS datasets, which treats the observed galaxy properties as
realiz... | astro-ph.IM astro-ph.GA | astronomical observations of extended sources such as cubes of integral field spectroscopy ifs encode autocorrelated spatial structures that cannot be optimally exploited by standard methodologies this work introduces a novel technique to model ifs datasets which treats the observed galaxy properties as realizations of... | [['astronomical', 'observations', 'of', 'extended', 'sources', 'such', 'as', 'cubes', 'of', 'integral', 'field', 'spectroscopy', 'ifs', 'encode', 'autocorrelated', 'spatial', 'structures', 'that', 'can', 'not', 'be', 'optimally', 'exploited', 'by', 'standard', 'methodologies', 'this', 'work', 'introduces', 'a', 'novel'... | [-0.03259680109547316, 0.020875999020141554, -0.10757779231375103, 0.09235349098741207, -0.09963084558045031, -0.09505057266302487, 0.01191727472506764, 0.4403306226576528, -0.2587269226324454, -0.3234279918464361, 0.09417919911098696, -0.27206539350151215, -0.10847236848204247, 0.19874469275894244, -0.0724859060995000... |
1,802.06281 | Representations of the inverse hull of a 0-left cancellative semigroup | A semigroup S containing a zero element is said to be 0-left cancellative if
st = sr \neq 0 implies that t = r. Given such an S we build an inverse
semigroup H(S), called the inverse hull of S. Motivated by the study of certain
C*-algebras associated to H(S) (a task that we will address in a subsequent
article) we ca... | math.OA math.DS | a semigroup s containing a zero element is said to be 0left cancellative if st sr neq 0 implies that t r given such an s we build an inverse semigroup hs called the inverse hull of s motivated by the study of certain calgebras associated to hs a task that we will address in a subsequent article we carry out a detailed ... | [['a', 'semigroup', 's', 'containing', 'a', 'zero', 'element', 'is', 'said', 'to', 'be', '0left', 'cancellative', 'if', 'st', 'sr', 'neq', '0', 'implies', 'that', 't', 'r', 'given', 'such', 'an', 's', 'we', 'build', 'an', 'inverse', 'semigroup', 'hs', 'called', 'the', 'inverse', 'hull', 'of', 's', 'motivated', 'by', 't... | [-0.13048568858045148, 0.11849552904588864, -0.06482393632391525, 0.0449654843945319, -0.07401750789972399, -0.11980232458984467, 0.0386761369639322, 0.3432515457478221, -0.3072908576092243, -0.20987016247139753, 0.11292213018543652, -0.31373097305186093, -0.13369233863988172, 0.16245820818388937, -0.11185964620015099,... |
1,802.06282 | Large Rank-Based Models with Common Noise | For large systems of Brownian particles interacting through their ranks
introduced in (Banner, Fernholz, Karatzas, 2005), the empirical cumulative
distribution function satisfies a porous medium PDE. However, when we introduce
a common noise, the limit is no longer deterministic. Instead, we show that
this limit is a... | math.PR | for large systems of brownian particles interacting through their ranks introduced in banner fernholz karatzas 2005 the empirical cumulative distribution function satisfies a porous medium pde however when we introduce a common noise the limit is no longer deterministic instead we show that this limit is a solution of ... | [['for', 'large', 'systems', 'of', 'brownian', 'particles', 'interacting', 'through', 'their', 'ranks', 'introduced', 'in', 'banner', 'fernholz', 'karatzas', '2005', 'the', 'empirical', 'cumulative', 'distribution', 'function', 'satisfies', 'a', 'porous', 'medium', 'pde', 'however', 'when', 'we', 'introduce', 'a', 'com... | [-0.09316566110223154, 0.08434274637057812, -0.12069421094146711, 0.09501878206346985, -0.09764310450564269, -0.12765693948663112, 0.022563873636948912, 0.2890463086122152, -0.28979656943179005, -0.2788239414744739, 0.09016309201546438, -0.3214077465236187, -0.16646686620137927, 0.11696645054565388, -0.1783892727232998... |
1,802.06283 | Almost Sure Productivity | We define Almost Sure Productivity (ASP), a probabilistic generalization of
the productivity condition for coinductively defined structures. Intuitively, a
probabilistic coinductive stream or tree is ASP if it produces infinitely many
outputs with probability 1. Formally, we define almost sure productivity using
a fi... | cs.PL cs.LO | we define almost sure productivity asp a probabilistic generalization of the productivity condition for coinductively defined structures intuitively a probabilistic coinductive stream or tree is asp if it produces infinitely many outputs with probability 1 formally we define almost sure productivity using a final coalg... | [['we', 'define', 'almost', 'sure', 'productivity', 'asp', 'a', 'probabilistic', 'generalization', 'of', 'the', 'productivity', 'condition', 'for', 'coinductively', 'defined', 'structures', 'intuitively', 'a', 'probabilistic', 'coinductive', 'stream', 'or', 'tree', 'is', 'asp', 'if', 'it', 'produces', 'infinitely', 'ma... | [-0.1047097398841288, 0.039100796417187667, -0.09830659690972728, 0.19559742646379163, -0.18405505473492667, -0.1693265104064873, 0.12904591019711611, 0.3738489353951688, -0.3375577427796088, -0.2735566473226451, 0.0684605664088546, -0.2353709105955204, -0.12258631042641355, 0.16955676051778332, -0.15736904495300527, 0... |
1,802.06284 | Similarities on Graphs: Kernels versus Proximity Measures | We analytically study proximity and distance properties of various kernels
and similarity measures on graphs. This helps to understand the mathematical
nature of such measures and can potentially be useful for recommending the
adoption of specific similarity measures in data analysis.
| math.CO math.MG | we analytically study proximity and distance properties of various kernels and similarity measures on graphs this helps to understand the mathematical nature of such measures and can potentially be useful for recommending the adoption of specific similarity measures in data analysis | [['we', 'analytically', 'study', 'proximity', 'and', 'distance', 'properties', 'of', 'various', 'kernels', 'and', 'similarity', 'measures', 'on', 'graphs', 'this', 'helps', 'to', 'understand', 'the', 'mathematical', 'nature', 'of', 'such', 'measures', 'and', 'can', 'potentially', 'be', 'useful', 'for', 'recommending', ... | [-0.09192181349073242, 0.008866708180526407, -0.1237627697381668, 0.18996628797215567, -0.1275111184932473, -0.0829102612759282, 0.08867415281512388, 0.42920311367729813, -0.303878613088916, -0.3245433500581762, 0.09813870530200713, -0.3297481826228294, -0.1872566601193351, 0.20118818550211628, -0.08134514996327641, 0.... |
1,802.06285 | Greening Geographical Power Allocation for Cellular Networks | Harvesting energy from nature (solar, wind etc.) is envisioned as a key
enabler for realizing green wireless networks. However, green energy sources
are geographically distributed and the power amount is random which may not
enough to power a base station by a single energy site. Burning brown energy
sources such as ... | cs.IT math.IT | harvesting energy from nature solar wind etc is envisioned as a key enabler for realizing green wireless networks however green energy sources are geographically distributed and the power amount is random which may not enough to power a base station by a single energy site burning brown energy sources such as coal and ... | [['harvesting', 'energy', 'from', 'nature', 'solar', 'wind', 'etc', 'is', 'envisioned', 'as', 'a', 'key', 'enabler', 'for', 'realizing', 'green', 'wireless', 'networks', 'however', 'green', 'energy', 'sources', 'are', 'geographically', 'distributed', 'and', 'the', 'power', 'amount', 'is', 'random', 'which', 'may', 'not... | [-0.17234485387783863, 0.07056926331350434, -0.019724875496809974, 0.06731110377044316, -0.07743306275840629, -0.15165997306158877, 0.12408451593706987, 0.38925384049869927, -0.2363670076455866, -0.34434364735167106, 0.05976901091886319, -0.2712779828922494, -0.1253080035898807, 0.19077527109652245, -0.1249210816943862... |
1,802.06286 | Nonconvex Matrix Factorization from Rank-One Measurements | We consider the problem of recovering low-rank matrices from random rank-one
measurements, which spans numerous applications including covariance sketching,
phase retrieval, quantum state tomography, and learning shallow polynomial
neural networks, among others. Our approach is to directly estimate the
low-rank facto... | cs.IT cs.LG math.IT stat.ML | we consider the problem of recovering lowrank matrices from random rankone measurements which spans numerous applications including covariance sketching phase retrieval quantum state tomography and learning shallow polynomial neural networks among others our approach is to directly estimate the lowrank factor by minimi... | [['we', 'consider', 'the', 'problem', 'of', 'recovering', 'lowrank', 'matrices', 'from', 'random', 'rankone', 'measurements', 'which', 'spans', 'numerous', 'applications', 'including', 'covariance', 'sketching', 'phase', 'retrieval', 'quantum', 'state', 'tomography', 'and', 'learning', 'shallow', 'polynomial', 'neural'... | [-0.05828010175964269, -0.001527344322165399, -0.06652214638570682, 0.0743784556217399, -0.10667404663237101, -0.1695337734399913, 0.06791182589624656, 0.4262574762105942, -0.3212473156185161, -0.31251451800004665, 0.11157199686974495, -0.22971153845122988, -0.15841818998693574, 0.13885388222540387, -0.1225450891592490... |
1,802.06287 | Unsupervised vehicle recognition using incremental reseeding of acoustic
signatures | Vehicle recognition and classification have broad applications, ranging from
traffic flow management to military target identification. We demonstrate an
unsupervised method for automated identification of moving vehicles from
roadside audio sensors. Using a short-time Fourier transform to decompose audio
signals, we... | stat.ML cs.LG physics.data-an | vehicle recognition and classification have broad applications ranging from traffic flow management to military target identification we demonstrate an unsupervised method for automated identification of moving vehicles from roadside audio sensors using a shorttime fourier transform to decompose audio signals we treat ... | [['vehicle', 'recognition', 'and', 'classification', 'have', 'broad', 'applications', 'ranging', 'from', 'traffic', 'flow', 'management', 'to', 'military', 'target', 'identification', 'we', 'demonstrate', 'an', 'unsupervised', 'method', 'for', 'automated', 'identification', 'of', 'moving', 'vehicles', 'from', 'roadside... | [-0.07831383685728437, 0.000329376381399159, -0.12205702514926854, 0.012672266236653454, -0.12085315552295038, -0.1389013595781044, 0.04558928658983572, 0.45467898610881285, -0.2908671822398901, -0.2884968708122247, 0.10961400717129245, -0.2874206733938895, -0.16191769365809466, 0.21430600891379933, -0.1288796919839162... |
1,802.06288 | Implementation of Neural Network and feature extraction to classify ECG
signals | This paper presents a suitable and efficient implementation of a feature
extraction algorithm (Pan Tompkins algorithm) on electrocardiography (ECG)
signals, for detection and classification of four cardiac diseases: Sleep
Apnea, Arrhythmia, Supraventricular Arrhythmia and Long Term Atrial
Fibrillation (AF) and differ... | cs.NE | this paper presents a suitable and efficient implementation of a feature extraction algorithm pan tompkins algorithm on electrocardiography ecg signals for detection and classification of four cardiac diseases sleep apnea arrhythmia supraventricular arrhythmia and long term atrial fibrillation af and differentiating th... | [['this', 'paper', 'presents', 'a', 'suitable', 'and', 'efficient', 'implementation', 'of', 'a', 'feature', 'extraction', 'algorithm', 'pan', 'tompkins', 'algorithm', 'on', 'electrocardiography', 'ecg', 'signals', 'for', 'detection', 'and', 'classification', 'of', 'four', 'cardiac', 'diseases', 'sleep', 'apnea', 'arrhy... | [-0.08734784518678983, -0.04671656809747219, -0.05981904437144597, 0.041270023508307836, -0.06842766071359317, -0.2366332927159965, 0.0450310144542406, 0.3621199210298558, -0.21292655603339275, -0.21979164448877175, 0.15438273866971333, -0.2619518357266982, -0.27854621067643165, 0.26271422366301217, -0.1394159102803920... |
1,802.06289 | Faster Algorithms for Integer Programs with Block Structure | We consider integer programming problems $\max \{ c^T x : \mathcal{A} x = b,
l \leq x \leq u, x \in \mathbb{Z}^{nt}\}$ where $\mathcal{A}$ has a (recursive)
block-structure generalizing "$n$-fold integer programs" which recently
received considerable attention in the literature. An $n$-fold IP is an integer
program w... | cs.DM cs.DS | we consider integer programming problems max ct x mathcala x b l leq x leq u x in mathbbznt where mathcala has a recursive blockstructure generalizing nfold integer programs which recently received considerable attention in the literature an nfold ip is an integer program where mathcala consists of n repetitions of sub... | [['we', 'consider', 'integer', 'programming', 'problems', 'max', 'ct', 'x', 'mathcala', 'x', 'b', 'l', 'leq', 'x', 'leq', 'u', 'x', 'in', 'mathbbznt', 'where', 'mathcala', 'has', 'a', 'recursive', 'blockstructure', 'generalizing', 'nfold', 'integer', 'programs', 'which', 'recently', 'received', 'considerable', 'attenti... | [-0.1679449982005435, 0.09301392406445955, -0.02808215433099079, 0.0040093618585675395, -0.043462335276153855, -0.17286543606270877, 0.07672099429237621, 0.3402131160475173, -0.2933270282410788, -0.2599335908960059, 0.1159912650921505, -0.2726103184349343, -0.12877822542246783, 0.18488832967320704, -0.04727205769773924... |
1,802.0629 | TabVec: Table Vectors for Classification of Web Tables | There are hundreds of millions of tables in Web pages that contain useful
information for many applications. Leveraging data within these tables is
difficult because of the wide variety of structures, formats and data encoded
in these tables. TabVec is an unsupervised method to embed tables into a vector
space to sup... | cs.IR | there are hundreds of millions of tables in web pages that contain useful information for many applications leveraging data within these tables is difficult because of the wide variety of structures formats and data encoded in these tables tabvec is an unsupervised method to embed tables into a vector space to support ... | [['there', 'are', 'hundreds', 'of', 'millions', 'of', 'tables', 'in', 'web', 'pages', 'that', 'contain', 'useful', 'information', 'for', 'many', 'applications', 'leveraging', 'data', 'within', 'these', 'tables', 'is', 'difficult', 'because', 'of', 'the', 'wide', 'variety', 'of', 'structures', 'formats', 'and', 'data', ... | [-0.09147380311768603, 0.006759663915578582, 0.00039053004044685923, 0.07253404249637693, -0.1301031083167687, -0.11833167381339917, 0.08108789169222769, 0.4265417893226836, -0.24887363930117257, -0.3704250600502527, 0.107857472557289, -0.3009817420103907, -0.11059223419313666, 0.25573287042279313, -0.11879859087193372... |
1,802.06291 | Domination of Sample Maxima and Related Extremal Dependence Measures | For a given $d$-dimensional distribution function (df) $H$ we introduce the
class of dependence measures $ \mu(H,Q) = - \mathbb{E}\{ \ln H(Z_1, \ldots,
Z_d)\},$ where the random vector $(Z_1, \ldots, Z_d)$ has df $Q$ which has the
same marginal df's as $H$. If both $H$ and $Q$ are max-stable df's, we show
that for a ... | math.PR stat.ME | for a given ddimensional distribution function df h we introduce the class of dependence measures muhq mathbbe ln hz_1 ldots z_d where the random vector z_1 ldots z_d has df q which has the same marginal dfs as h if both h and q are maxstable dfs we show that for a df f in the maxdomain of attraction of h this dependen... | [['for', 'a', 'given', 'ddimensional', 'distribution', 'function', 'df', 'h', 'we', 'introduce', 'the', 'class', 'of', 'dependence', 'measures', 'muhq', 'mathbbe', 'ln', 'hz_1', 'ldots', 'z_d', 'where', 'the', 'random', 'vector', 'z_1', 'ldots', 'z_d', 'has', 'df', 'q', 'which', 'has', 'the', 'same', 'marginal', 'dfs',... | [-0.13297126133486553, 0.14696492791780966, -0.10990913385378497, 0.05119650975120287, -0.011822210739456534, -0.14459552731468972, 0.03141509408549628, 0.36930266765140113, -0.23549802636439313, -0.21509436067184293, 0.042314853573567825, -0.27785349444386925, -0.12585631917764994, 0.14400907634842555, -0.032137809498... |
1,802.06292 | Nonparametric Estimation of Low Rank Matrix Valued Function | Let $A:[0,1]\rightarrow\mathbb{H}_m$ (the space of Hermitian matrices) be a
matrix valued function which is low rank with entries in H\"{o}lder class
$\Sigma(\beta,L)$. The goal of this paper is to study statistical estimation of
$A$ based on the regression model $\mathbb{E}(Y_j|\tau_j,X_j) = \langle
A(\tau_j), X_j \... | stat.ML cs.LG math.ST stat.TH | let a01rightarrowmathbbh_m the space of hermitian matrices be a matrix valued function which is low rank with entries in holder class sigmabetal the goal of this paper is to study statistical estimation of a based on the regression model mathbbey_jtau_jx_j langle atau_j x_j rangle where tau_j are iid uniformly distribu... | [['let', 'a01rightarrowmathbbh_m', 'the', 'space', 'of', 'hermitian', 'matrices', 'be', 'a', 'matrix', 'valued', 'function', 'which', 'is', 'low', 'rank', 'with', 'entries', 'in', 'holder', 'class', 'sigmabetal', 'the', 'goal', 'of', 'this', 'paper', 'is', 'to', 'study', 'statistical', 'estimation', 'of', 'a', 'based',... | [-0.07510070597994967, 0.08444285708570677, -0.07187779519824038, 0.06649976003767744, -0.0432525505206553, -0.1802671441918839, 0.03864124626869015, 0.4215097825100782, -0.3039354370685957, -0.2340368323506903, 0.16642450306519846, -0.2567851778098756, -0.1565102689865303, 0.17511540844689233, -0.14426233391224874, 0.... |
1,802.06293 | Black-Box Reductions for Parameter-free Online Learning in Banach Spaces | We introduce several new black-box reductions that significantly improve the
design of adaptive and parameter-free online learning algorithms by simplifying
analysis, improving regret guarantees, and sometimes even improving runtime. We
reduce parameter-free online learning to online exp-concave optimization, we
redu... | cs.LG math.OC stat.ML | we introduce several new blackbox reductions that significantly improve the design of adaptive and parameterfree online learning algorithms by simplifying analysis improving regret guarantees and sometimes even improving runtime we reduce parameterfree online learning to online expconcave optimization we reduce optimiz... | [['we', 'introduce', 'several', 'new', 'blackbox', 'reductions', 'that', 'significantly', 'improve', 'the', 'design', 'of', 'adaptive', 'and', 'parameterfree', 'online', 'learning', 'algorithms', 'by', 'simplifying', 'analysis', 'improving', 'regret', 'guarantees', 'and', 'sometimes', 'even', 'improving', 'runtime', 'w... | [-0.022637173584054992, -0.038580957734349955, -0.08998792821986844, 0.12097712631499313, -0.19248648441862315, -0.18560315930770468, 0.11832284253171604, 0.46028407537580834, -0.2996382066656066, -0.361046545005039, 0.1384451447608982, -0.19177860291877194, -0.18876834391520117, 0.22210488787411875, -0.167518497429504... |
1,802.06294 | Dynamics of strongly interacting unstable two-solitons for generalized
Korteweg-de Vries equations | We consider the generalized Korteweg-de Vries equation $\partial_t u =
-\partial_x(\partial_x^2 u + f(u))$, where $f(u)$ is an odd function of class
$C^3$. Under some assumptions on $f$, this equation admits \emph{solitary
waves}, that is solutions of the form $u(t, x) = Q_v(x - vt - x_0)$, for $v$ in
some range $(0,... | math.AP | we consider the generalized kortewegde vries equation partial_t u partial_xpartial_x2 u fu where fu is an odd function of class c3 under some assumptions on f this equation admits emphsolitary waves that is solutions of the form ut x q_vx vt x_0 for v in some range 0 v_ we study pure twosolitons in the case of the same... | [['we', 'consider', 'the', 'generalized', 'kortewegde', 'vries', 'equation', 'partial_t', 'u', 'partial_xpartial_x2', 'u', 'fu', 'where', 'fu', 'is', 'an', 'odd', 'function', 'of', 'class', 'c3', 'under', 'some', 'assumptions', 'on', 'f', 'this', 'equation', 'admits', 'emphsolitary', 'waves', 'that', 'is', 'solutions',... | [-0.22305564213997853, 0.10048065856207335, -0.012084551818239002, 0.0071747583517721165, -0.04547723075162279, -0.21391853747459558, -0.03691832114679691, 0.31482724287809855, -0.3044148031383371, -0.15639759948811469, 0.08798129167459989, -0.3796602361716139, -0.09917166711201365, 0.1484085632184407, -0.0578269339845... |
1,802.06295 | Resonance line broadened quasilinear (RBQ) model for fast ion
distribution relaxation due to Alfv\'enic eigenmodes | The burning plasma performance is limited by the confinement of the
superalfvenic fusion products such as alpha particles and the auxiliary heating
ions capable of exciting the Alfv\'enic eigenmodes (AEs). In this work the
effect of AEs on fast ions is formulated within the quasi-linear (QL) theory
generalized for th... | physics.plasm-ph | the burning plasma performance is limited by the confinement of the superalfvenic fusion products such as alpha particles and the auxiliary heating ions capable of exciting the alfvenic eigenmodes aes in this work the effect of aes on fast ions is formulated within the quasilinear ql theory generalized for this problem... | [['the', 'burning', 'plasma', 'performance', 'is', 'limited', 'by', 'the', 'confinement', 'of', 'the', 'superalfvenic', 'fusion', 'products', 'such', 'as', 'alpha', 'particles', 'and', 'the', 'auxiliary', 'heating', 'ions', 'capable', 'of', 'exciting', 'the', 'alfvenic', 'eigenmodes', 'aes', 'in', 'this', 'work', 'the'... | [-0.09617637551220304, 0.19328266124833715, -0.026849723668684336, 0.05282136061578058, -0.02499578629556874, -0.14233915191011462, -0.05662288155078634, 0.34334266975268046, -0.29064759217117997, -0.27565993710251696, 0.0412953658124686, -0.26860760246742177, -0.042244194006674333, 0.19224838018840687, 0.0568138689490... |
1,802.06296 | Collaborative model based design of automated and robotic agricultural
vehicles in the Crescendo Tool | This paper describes a collaborative modelling approach to automated and
robotic agricultural vehicle design. The Cresendo technology allows engineers
from different disciplines to collaborate and produce system models. The
combined models are called co-models and their execution co-simulation. To
support future deve... | cs.RO | this paper describes a collaborative modelling approach to automated and robotic agricultural vehicle design the cresendo technology allows engineers from different disciplines to collaborate and produce system models the combined models are called comodels and their execution cosimulation to support future development... | [['this', 'paper', 'describes', 'a', 'collaborative', 'modelling', 'approach', 'to', 'automated', 'and', 'robotic', 'agricultural', 'vehicle', 'design', 'the', 'cresendo', 'technology', 'allows', 'engineers', 'from', 'different', 'disciplines', 'to', 'collaborate', 'and', 'produce', 'system', 'models', 'the', 'combined... | [-0.09844822368879275, 0.002846748788329818, -0.06535702793683101, -0.03093228785571857, -0.14416385557619738, -0.17117022743474666, 0.020039377195135384, 0.39190368129630815, -0.27249857892080415, -0.34611750493425275, 0.13896577595977333, -0.23935071464110624, -0.20924269071929938, 0.26257760338224734, -0.14896421351... |
1,802.06297 | Vortex interaction with a rough wall formed by a hexagonal lattice of
posts | An experimental study is reported which investigates the head-on collision of
a laminar vortex ring of diameter D (Re{\Gamma}= 3000) on a fakir-like surface
composed of circular posts of height h*=0.068 located on a planar bed. Lattices
of the posts in hexagonal and random distribution (average porosity of e = 0.94
i... | physics.flu-dyn | an experimental study is reported which investigates the headon collision of a laminar vortex ring of diameter d regamma 3000 on a fakirlike surface composed of circular posts of height h0068 located on a planar bed lattices of the posts in hexagonal and random distribution average porosity of e 094 in the layer are co... | [['an', 'experimental', 'study', 'is', 'reported', 'which', 'investigates', 'the', 'headon', 'collision', 'of', 'a', 'laminar', 'vortex', 'ring', 'of', 'diameter', 'd', 'regamma', '3000', 'on', 'a', 'fakirlike', 'surface', 'composed', 'of', 'circular', 'posts', 'of', 'height', 'h0068', 'located', 'on', 'a', 'planar', '... | [-0.19163831201635978, 0.16767441939049274, -0.0648860357041386, -0.02004727871411226, -0.0726515604081479, -0.10658820339182222, -0.013766218183392829, 0.38743896393761545, -0.29429168297147207, -0.26764420799720523, 0.07903689269780774, -0.2818761748397215, -0.06921876056543128, 0.14246919266625563, -0.01647475951181... |
1,802.06298 | Unimodality of the independence polynomials of non-regular caterpillars | The independence polynomial $I(G, x)$ of a graph $G$ is the polynomial in
variable $x$ in which the coefficient $a_n$ on $x^n$ gives the number of
independent subsets $S \subseteq V(G)$ of vertices of $G$ such that $|S| = n$.
$I(G, x)$ is unimodal if there is an index $\mu$ such that that $a_0 \leq a_1
\leq$...$\leq ... | math.CO | the independence polynomial ig x of a graph g is the polynomial in variable x in which the coefficient a_n on xn gives the number of independent subsets s subseteq vg of vertices of g such that s n ig x is unimodal if there is an index mu such that that a_0 leq a_1 leqleq a_mu1 leq a_mu geq a_mu 1 geqgeq a_d1 geq a_d w... | [['the', 'independence', 'polynomial', 'ig', 'x', 'of', 'a', 'graph', 'g', 'is', 'the', 'polynomial', 'in', 'variable', 'x', 'in', 'which', 'the', 'coefficient', 'a_n', 'on', 'xn', 'gives', 'the', 'number', 'of', 'independent', 'subsets', 's', 'subseteq', 'vg', 'of', 'vertices', 'of', 'g', 'such', 'that', 's', 'n', 'ig... | [-0.20253664096235297, 0.16289640181462345, -0.030075188506937897, 0.030345145213262488, -0.07402672298873464, -0.18152883201449488, -0.017575206053152215, 0.3819053920606772, -0.3375669892101238, -0.21087503443316866, 0.06766179445936965, -0.3160396964677299, -0.1133620641756958, 0.1573733161902055, -0.059746276338895... |
1,802.06299 | Robotic design choice overview using co-simulation | Rapid robotic system development sets a demand for multi-disciplinary methods
and tools to explore and compare design alternatives. In this paper, we present
collaborative modeling that combines discrete-event models of controller
software with continuous-time models of physical robot components. The
presented co-mod... | cs.RO | rapid robotic system development sets a demand for multidisciplinary methods and tools to explore and compare design alternatives in this paper we present collaborative modeling that combines discreteevent models of controller software with continuoustime models of physical robot components the presented comodeling met... | [['rapid', 'robotic', 'system', 'development', 'sets', 'a', 'demand', 'for', 'multidisciplinary', 'methods', 'and', 'tools', 'to', 'explore', 'and', 'compare', 'design', 'alternatives', 'in', 'this', 'paper', 'we', 'present', 'collaborative', 'modeling', 'that', 'combines', 'discreteevent', 'models', 'of', 'controller'... | [-0.10285453963499601, -0.00537660283616856, -0.08797256015521243, 0.018771238316942874, -0.12354129471613053, -0.1907489959087531, 0.001232904027552253, 0.4137218136032273, -0.2095022701581282, -0.34642019030056836, 0.10213468833108734, -0.23448780379293108, -0.19312184308900646, 0.2382912130333147, -0.103704014737018... |
1,802.063 | Exact and Robust Conformal Inference Methods for Predictive Machine
Learning With Dependent Data | We extend conformal inference to general settings that allow for time series
data. Our proposal is developed as a randomization method and accounts for
potential serial dependence by including block structures in the permutation
scheme. As a result, the proposed method retains the exact, model-free validity
when the ... | stat.ML cs.LG | we extend conformal inference to general settings that allow for time series data our proposal is developed as a randomization method and accounts for potential serial dependence by including block structures in the permutation scheme as a result the proposed method retains the exact modelfree validity when the data ar... | [['we', 'extend', 'conformal', 'inference', 'to', 'general', 'settings', 'that', 'allow', 'for', 'time', 'series', 'data', 'our', 'proposal', 'is', 'developed', 'as', 'a', 'randomization', 'method', 'and', 'accounts', 'for', 'potential', 'serial', 'dependence', 'by', 'including', 'block', 'structures', 'in', 'the', 'pe... | [-0.04214630132814501, -0.00433689409996881, -0.10534909724929305, 0.1271918905008216, -0.10483054646973086, -0.18281039243650643, 0.04082967098369155, 0.39786871807476465, -0.21704144827848257, -0.2665457746208927, 0.11142422294455342, -0.21403497462377472, -0.1386227612045247, 0.218679609619146, -0.07834734112500798,... |
1,802.06301 | Structural Properties of Bichromatic Non-crossing Matchings | Given a set of $n$ red and $n$ blue points in the plane, we are interested in
matching red points with blue points by straight line segments so that the
segments do not cross. We develop a range of tools for dealing with the
non-crossing matchings of points in convex position. It turns out that the
points naturally p... | cs.CG | given a set of n red and n blue points in the plane we are interested in matching red points with blue points by straight line segments so that the segments do not cross we develop a range of tools for dealing with the noncrossing matchings of points in convex position it turns out that the points naturally partition i... | [['given', 'a', 'set', 'of', 'n', 'red', 'and', 'n', 'blue', 'points', 'in', 'the', 'plane', 'we', 'are', 'interested', 'in', 'matching', 'red', 'points', 'with', 'blue', 'points', 'by', 'straight', 'line', 'segments', 'so', 'that', 'the', 'segments', 'do', 'not', 'cross', 'we', 'develop', 'a', 'range', 'of', 'tools', ... | [-0.14861165207992422, 0.04119098400237484, -0.0696560113986091, 0.045908086476762346, -0.07043970926386509, -0.10464272687421748, 0.12871009472575856, 0.39628175508213886, -0.25207664087278453, -0.2893330839508009, 0.08355598949838611, -0.3199924167995227, -0.15020033045211897, 0.19483634681943462, -0.1110094375482465... |
1,802.06302 | Improving the accuracy of the fast inverse square root algorithm | We present improved algorithms for fast calculation of the inverse square
root for single-precision floating-point numbers. The algorithms are much more
accurate than the famous fast inverse square root algorithm and have the same
or similar computational cost. The main idea of our work consists in modifying
the Newt... | cs.NA | we present improved algorithms for fast calculation of the inverse square root for singleprecision floatingpoint numbers the algorithms are much more accurate than the famous fast inverse square root algorithm and have the same or similar computational cost the main idea of our work consists in modifying the newtonraph... | [['we', 'present', 'improved', 'algorithms', 'for', 'fast', 'calculation', 'of', 'the', 'inverse', 'square', 'root', 'for', 'singleprecision', 'floatingpoint', 'numbers', 'the', 'algorithms', 'are', 'much', 'more', 'accurate', 'than', 'the', 'famous', 'fast', 'inverse', 'square', 'root', 'algorithm', 'and', 'have', 'th... | [-0.08363046917802422, 0.07627223146264442, -0.053332568053156136, 0.13009577511547832, -0.09056861815042794, -0.15593791399151086, -0.011485777047346346, 0.36998118152841925, -0.2783479394449387, -0.31592758384067565, 0.1521069512455142, -0.2736244583502412, -0.17301128978142516, 0.24508969776507, -0.05982496974174865... |
1,802.06303 | Links between functions and subdifferentials | A function in a class $\mathcal{F}(X)$ is said to be subdifferentially
determined in $\mathcal{F}(X)$ if it is equal up to an additive constant to any
function in $\mathcal{F}(X)$ with the same subdifferential. A function is said
to be subdifferentially representable if it can be recovered from a
subdifferential. We ... | math.OC | a function in a class mathcalfx is said to be subdifferentially determined in mathcalfx if it is equal up to an additive constant to any function in mathcalfx with the same subdifferential a function is said to be subdifferentially representable if it can be recovered from a subdifferential we identify large classes of... | [['a', 'function', 'in', 'a', 'class', 'mathcalfx', 'is', 'said', 'to', 'be', 'subdifferentially', 'determined', 'in', 'mathcalfx', 'if', 'it', 'is', 'equal', 'up', 'to', 'an', 'additive', 'constant', 'to', 'any', 'function', 'in', 'mathcalfx', 'with', 'the', 'same', 'subdifferential', 'a', 'function', 'is', 'said', 't... | [-0.06879711129392187, 0.12151248695081449, -0.11423965447271864, 0.08415441030131963, -0.10780031884399553, -0.1338640435754011, 0.005875623261090368, 0.39548129551112654, -0.38387311743572355, -0.20335731838519375, 0.09302109809553562, -0.26410440120768425, -0.1530695809982717, 0.18776150314758222, -0.125516046133513... |
1,802.06304 | Lagrangian mean curvature flow of Whitney spheres | It is shown that an equivariant Lagrangian sphere with a positivity condition
on its Ricci curvature develops a type-II singularity under the Lagrangian mean
curvature flow that rescales to the product of a grim reaper with a flat
Lagrangian subspace. In particular this result applies to the Whitney spheres.
| math.DG math.AP | it is shown that an equivariant lagrangian sphere with a positivity condition on its ricci curvature develops a typeii singularity under the lagrangian mean curvature flow that rescales to the product of a grim reaper with a flat lagrangian subspace in particular this result applies to the whitney spheres | [['it', 'is', 'shown', 'that', 'an', 'equivariant', 'lagrangian', 'sphere', 'with', 'a', 'positivity', 'condition', 'on', 'its', 'ricci', 'curvature', 'develops', 'a', 'typeii', 'singularity', 'under', 'the', 'lagrangian', 'mean', 'curvature', 'flow', 'that', 'rescales', 'to', 'the', 'product', 'of', 'a', 'grim', 'reap... | [-0.23020040192308702, 0.06630016003565492, -0.1583608253383819, 0.0680730045221898, -0.09762658969480165, -0.16283396531694702, -0.10193331872246095, 0.32797717485500844, -0.2844153879286379, -0.15139601650239176, 0.10365020353299546, -0.23011772182522988, -0.1576376061848536, 0.09629169565492443, -0.14370816657129598... |
1,802.06305 | Machine learning for Internet of Things data analysis: A survey | Rapid developments in hardware, software, and communication technologies have
allowed the emergence of Internet-connected sensory devices that provide
observation and data measurement from the physical world. By 2020, it is
estimated that the total number of Internet-connected devices being used will
be between 25 an... | cs.LG cs.CY cs.DC | rapid developments in hardware software and communication technologies have allowed the emergence of internetconnected sensory devices that provide observation and data measurement from the physical world by 2020 it is estimated that the total number of internetconnected devices being used will be between 25 and 50 bil... | [['rapid', 'developments', 'in', 'hardware', 'software', 'and', 'communication', 'technologies', 'have', 'allowed', 'the', 'emergence', 'of', 'internetconnected', 'sensory', 'devices', 'that', 'provide', 'observation', 'and', 'data', 'measurement', 'from', 'the', 'physical', 'world', 'by', '2020', 'it', 'is', 'estimate... | [-0.131754342114805, 0.07551670354164682, -0.0360554195442298, 0.043077944497797456, -0.119854073922707, -0.1443630523479434, 0.034880346210884934, 0.32921064344913936, -0.26717774638719044, -0.3640705765180257, 0.14314701641130964, -0.31281256323322393, -0.14294347661754775, 0.25819625856769657, -0.1353620257478728, 0... |
1,802.06306 | Learning Data-Driven Objectives to Optimize Interactive Systems | Effective optimization is essential for interactive systems to provide a
satisfactory user experience. However, it is often challenging to find an
objective to optimize for. Generally, such objectives are manually crafted and
rarely capture complex user needs in an accurate manner. We propose an approach
that infers ... | cs.AI cs.HC cs.IR cs.LG | effective optimization is essential for interactive systems to provide a satisfactory user experience however it is often challenging to find an objective to optimize for generally such objectives are manually crafted and rarely capture complex user needs in an accurate manner we propose an approach that infers the obj... | [['effective', 'optimization', 'is', 'essential', 'for', 'interactive', 'systems', 'to', 'provide', 'a', 'satisfactory', 'user', 'experience', 'however', 'it', 'is', 'often', 'challenging', 'to', 'find', 'an', 'objective', 'to', 'optimize', 'for', 'generally', 'such', 'objectives', 'are', 'manually', 'crafted', 'and', ... | [-0.08115197064569302, -0.03192318854835482, -0.0979962791135922, 0.11691201731162887, -0.1637188723162476, -0.1906757041259743, 0.02146128830458738, 0.4647888856387771, -0.27181098015105304, -0.4141749194205071, 0.03627809449778952, -0.232628002801943, -0.2173921520104714, 0.20398979961245725, -0.13393250304331952, 0.... |
1,802.06307 | Out-of-sample extension of graph adjacency spectral embedding | Many popular dimensionality reduction procedures have out-of-sample
extensions, which allow a practitioner to apply a learned embedding to
observations not seen in the initial training sample. In this work, we consider
the problem of obtaining an out-of-sample extension for the adjacency spectral
embedding, a procedu... | stat.ML | many popular dimensionality reduction procedures have outofsample extensions which allow a practitioner to apply a learned embedding to observations not seen in the initial training sample in this work we consider the problem of obtaining an outofsample extension for the adjacency spectral embedding a procedure for emb... | [['many', 'popular', 'dimensionality', 'reduction', 'procedures', 'have', 'outofsample', 'extensions', 'which', 'allow', 'a', 'practitioner', 'to', 'apply', 'a', 'learned', 'embedding', 'to', 'observations', 'not', 'seen', 'in', 'the', 'initial', 'training', 'sample', 'in', 'this', 'work', 'we', 'consider', 'the', 'pro... | [-0.03607716634227284, -0.0012913273606280763, -0.11365082616885674, 0.1094139671145842, -0.10874188374085673, -0.14082646664424703, 0.08041866910001584, 0.4011629196847307, -0.27586208428737935, -0.2752556789248925, 0.12977761130153748, -0.2591788843916408, -0.13934318687333244, 0.15885786588046827, -0.129410130341119... |
1,802.06308 | Nonparametric Testing under Random Projection | A common challenge in nonparametric inference is its high computational
complexity when data volume is large. In this paper, we develop computationally
efficient nonparametric testing by employing a random projection strategy. In
the specific kernel ridge regression setup, a simple distance-based test
statistic is pr... | math.ST stat.ME stat.ML stat.TH | a common challenge in nonparametric inference is its high computational complexity when data volume is large in this paper we develop computationally efficient nonparametric testing by employing a random projection strategy in the specific kernel ridge regression setup a simple distancebased test statistic is proposed ... | [['a', 'common', 'challenge', 'in', 'nonparametric', 'inference', 'is', 'its', 'high', 'computational', 'complexity', 'when', 'data', 'volume', 'is', 'large', 'in', 'this', 'paper', 'we', 'develop', 'computationally', 'efficient', 'nonparametric', 'testing', 'by', 'employing', 'a', 'random', 'projection', 'strategy', '... | [-0.08616567880380899, -0.002462770780025662, -0.11635900405666756, 0.11023285312478913, -0.10266917395077783, -0.15182822911258512, 0.0947530133071942, 0.38515967899648884, -0.2338257969197541, -0.2996033046015159, 0.1605757573981666, -0.20763103039590297, -0.14483679148058096, 0.1922505159573457, -0.12088128130589784... |
1,802.06309 | Learning Adversarially Fair and Transferable Representations | In this paper, we advocate for representation learning as the key to
mitigating unfair prediction outcomes downstream. Motivated by a scenario where
learned representations are used by third parties with unknown objectives, we
propose and explore adversarial representation learning as a natural method of
ensuring tho... | cs.LG stat.ML | in this paper we advocate for representation learning as the key to mitigating unfair prediction outcomes downstream motivated by a scenario where learned representations are used by third parties with unknown objectives we propose and explore adversarial representation learning as a natural method of ensuring those pa... | [['in', 'this', 'paper', 'we', 'advocate', 'for', 'representation', 'learning', 'as', 'the', 'key', 'to', 'mitigating', 'unfair', 'prediction', 'outcomes', 'downstream', 'motivated', 'by', 'a', 'scenario', 'where', 'learned', 'representations', 'are', 'used', 'by', 'third', 'parties', 'with', 'unknown', 'objectives', '... | [-0.07311869510684256, 0.021938885770617797, -0.10285693212356536, 0.09089226778420549, -0.1300490027363999, -0.2054521988729062, 0.10028258609260675, 0.45243184781875934, -0.24990190513932906, -0.32765372794027586, 0.010276339532408332, -0.24410885096598073, -0.18505854947402478, 0.134165711186341, -0.1711535128068272... |
1,802.0631 | Characterizing and Learning Equivalence Classes of Causal DAGs under
Interventions | We consider the problem of learning causal DAGs in the setting where both
observational and interventional data is available. This setting is common in
biology, where gene regulatory networks can be intervened on using chemical
reagents or gene deletions. Hauser and B\"uhlmann (2012) previously
characterized the iden... | stat.ME math.ST stat.AP stat.TH | we consider the problem of learning causal dags in the setting where both observational and interventional data is available this setting is common in biology where gene regulatory networks can be intervened on using chemical reagents or gene deletions hauser and buhlmann 2012 previously characterized the identifiabili... | [['we', 'consider', 'the', 'problem', 'of', 'learning', 'causal', 'dags', 'in', 'the', 'setting', 'where', 'both', 'observational', 'and', 'interventional', 'data', 'is', 'available', 'this', 'setting', 'is', 'common', 'in', 'biology', 'where', 'gene', 'regulatory', 'networks', 'can', 'be', 'intervened', 'on', 'using',... | [-0.06806886361783925, 0.08356525566613743, -0.017544021055045475, 0.10985725777461869, -0.13312770629955725, -0.16991827084562022, 0.11292956376942372, 0.42314976888872285, -0.2757798559423394, -0.32977651769849864, 0.08064824575380572, -0.21379921077004144, -0.212460846087419, 0.15681715037865665, -0.1501791788876511... |
1,802.06311 | Virtual Element Method: an equilibrium-based stress recovery procedure | Within the framework of the displacement-based Virtual Element Method (VEM)
for plane elasticity a significant problem is represented by an accurate
evaluation of the stress field. In particular, in the classical VEM
formulation, a suitable operator which maps to the strain field is introduced
in order to allow the c... | math.NA | within the framework of the displacementbased virtual element method vem for plane elasticity a significant problem is represented by an accurate evaluation of the stress field in particular in the classical vem formulation a suitable operator which maps to the strain field is introduced in order to allow the calculati... | [['within', 'the', 'framework', 'of', 'the', 'displacementbased', 'virtual', 'element', 'method', 'vem', 'for', 'plane', 'elasticity', 'a', 'significant', 'problem', 'is', 'represented', 'by', 'an', 'accurate', 'evaluation', 'of', 'the', 'stress', 'field', 'in', 'particular', 'in', 'the', 'classical', 'vem', 'formulati... | [-0.10722530185086772, 0.09225639978066259, -0.06842793763065949, 0.020477677934253827, -0.053396209029671855, -0.10523448156145139, -0.009507281937821506, 0.382185392607099, -0.30716711410488456, -0.2697948103066152, 0.10660101926306453, -0.2019344144500792, -0.17378103459486738, 0.20296372589058218, -0.06523296521761... |
1,802.06312 | Counting linear extensions of restricted posets | The classical 1991 result by Brightwell and Winkler states that the number of
linear extensions of a poset is #P-complete. We extend this result to posets
with certain restrictions. First, we prove that the number of linear extension
for posets of height two is #P-complete. Furthermore, we prove that this holds
for i... | math.CO | the classical 1991 result by brightwell and winkler states that the number of linear extensions of a poset is pcomplete we extend this result to posets with certain restrictions first we prove that the number of linear extension for posets of height two is pcomplete furthermore we prove that this holds for incidence po... | [['the', 'classical', '1991', 'result', 'by', 'brightwell', 'and', 'winkler', 'states', 'that', 'the', 'number', 'of', 'linear', 'extensions', 'of', 'a', 'poset', 'is', 'pcomplete', 'we', 'extend', 'this', 'result', 'to', 'posets', 'with', 'certain', 'restrictions', 'first', 'we', 'prove', 'that', 'the', 'number', 'of'... | [-0.14563407779981694, 0.12596654421132472, -0.005898698168392811, 0.11429986749135423, -0.1223979209898971, -0.1268036718182783, 0.03423615679558781, 0.33738295594230294, -0.34864631601117757, -0.2601903665862564, 0.09246470331143225, -0.22381595793801048, -0.17048745209144223, 0.19573516033900282, -0.1603892268095579... |
1,802.06313 | Deformation of a Half-Space from Anelastic Strain Confined in a
Tetrahedral Volume | Deformation in the lithosphere-asthenosphere system can be accommodated by
faulting and plastic flow. However, incorporating structural data in models of
distributed deformation still represents a challenge. Here, I present solutions
for the displacements and stress in a half-space caused by distributed
anelastic str... | physics.geo-ph | deformation in the lithosphereasthenosphere system can be accommodated by faulting and plastic flow however incorporating structural data in models of distributed deformation still represents a challenge here i present solutions for the displacements and stress in a halfspace caused by distributed anelastic strain conf... | [['deformation', 'in', 'the', 'lithosphereasthenosphere', 'system', 'can', 'be', 'accommodated', 'by', 'faulting', 'and', 'plastic', 'flow', 'however', 'incorporating', 'structural', 'data', 'in', 'models', 'of', 'distributed', 'deformation', 'still', 'represents', 'a', 'challenge', 'here', 'i', 'present', 'solutions',... | [-0.11271641400964123, 0.11107317618399846, -0.06329153406442004, 0.0014141702579449763, -0.04528209918170376, -0.09998690514141216, -0.03271449172861083, 0.37347438521023874, -0.3400140280291372, -0.2494236031728508, 0.14160701736037215, -0.21792330513749503, -0.16842660929315387, 0.17659369637196537, -0.1023602287652... |
1,802.06314 | Autonomous Vehicle Speed Control for Safe Navigation of Occluded
Pedestrian Crosswalk | Both humans and the sensors on an autonomous vehicle have limited sensing
capabilities. When these limitations coincide with scenarios involving
vulnerable road users, it becomes important to account for these limitations in
the motion planner. For the scenario of an occluded pedestrian crosswalk, the
speed of the ap... | cs.RO cs.AI cs.SY | both humans and the sensors on an autonomous vehicle have limited sensing capabilities when these limitations coincide with scenarios involving vulnerable road users it becomes important to account for these limitations in the motion planner for the scenario of an occluded pedestrian crosswalk the speed of the approach... | [['both', 'humans', 'and', 'the', 'sensors', 'on', 'an', 'autonomous', 'vehicle', 'have', 'limited', 'sensing', 'capabilities', 'when', 'these', 'limitations', 'coincide', 'with', 'scenarios', 'involving', 'vulnerable', 'road', 'users', 'it', 'becomes', 'important', 'to', 'account', 'for', 'these', 'limitations', 'in',... | [-0.1136472775354324, 0.0797701351662445, -0.06531232069520389, 0.05214241143497858, -0.10976038840781971, -0.18250099661778293, 0.07105975217350266, 0.41233520984065297, -0.3039504190788184, -0.3202354286742561, 0.1540788782347626, -0.2360334996882753, -0.12415954045147873, 0.21824726860230678, -0.16818466031120397, 0... |
1,802.06315 | Center of mass and K\"ahler structures | There is a sequence of positive numbers $\delta_{2n}$, such that for any
connected $2n$-dimensional Riemannian manifold $M$, there are two mutually
exclusive possibilities: $1)$ There is a complex structure on $M$ making it
into a K\"ahler manifold, or $2)$ For any almost complex structure $J$
compatible with the met... | math.DG | there is a sequence of positive numbers delta_2n such that for any connected 2ndimensional riemannian manifold m there are two mutually exclusive possibilities 1 there is a complex structure on m making it into a kahler manifold or 2 for any almost complex structure j compatible with the metric at every point pin m the... | [['there', 'is', 'a', 'sequence', 'of', 'positive', 'numbers', 'delta_2n', 'such', 'that', 'for', 'any', 'connected', '2ndimensional', 'riemannian', 'manifold', 'm', 'there', 'are', 'two', 'mutually', 'exclusive', 'possibilities', '1', 'there', 'is', 'a', 'complex', 'structure', 'on', 'm', 'making', 'it', 'into', 'a', ... | [-0.23927153767301487, 0.15939580847939047, -0.04425898152761734, 0.049431698824852134, -0.07144877304537939, -0.23503484591268575, 0.0006434581618612775, 0.43329661482801807, -0.24167421898589683, -0.20516168383451608, 0.07549272236915736, -0.3050464533269405, -0.16507746229449716, 0.19728867191678057, -0.016209756382... |
1,802.06316 | Projective dimension and regularity of edge ideal of some weighted
oriented graphs | In this paper we provide some exact formulas for the projective dimension and
the regularity of edge ideals associated to vertex weighted rooted forests and
oriented cycles. As some consequences, we give some exact formulas for the
depth of these ideals.
| math.AC | in this paper we provide some exact formulas for the projective dimension and the regularity of edge ideals associated to vertex weighted rooted forests and oriented cycles as some consequences we give some exact formulas for the depth of these ideals | [['in', 'this', 'paper', 'we', 'provide', 'some', 'exact', 'formulas', 'for', 'the', 'projective', 'dimension', 'and', 'the', 'regularity', 'of', 'edge', 'ideals', 'associated', 'to', 'vertex', 'weighted', 'rooted', 'forests', 'and', 'oriented', 'cycles', 'as', 'some', 'consequences', 'we', 'give', 'some', 'exact', 'fo... | [-0.15667534410590078, 0.0798590429944963, -0.010683150598552169, 0.11926077763697632, -0.10960613003727503, -0.11124716051740617, 0.0402592824028078, 0.38566398756896575, -0.3039318129602002, -0.18076410644301555, 0.16263404591633687, -0.27504028400360814, -0.1658626622861115, 0.17604281587480772, -0.13030340413707764... |
1,802.06317 | Spontaneous emission from radiative chiral nematic liquid crystals at
the photonic band gap edge: an investigation into the role of the density of
photon states near resonance | In this article, we investigate the spontaneous emission properties of
radiating molecules embedded in a chiral nematic liquid crystal, under the
assumption that the electronic transition frequency is close to the photonic
edge mode of the structure, i.e. at resonance. We take into account the
transition broadening a... | physics.optics | in this article we investigate the spontaneous emission properties of radiating molecules embedded in a chiral nematic liquid crystal under the assumption that the electronic transition frequency is close to the photonic edge mode of the structure ie at resonance we take into account the transition broadening and the d... | [['in', 'this', 'article', 'we', 'investigate', 'the', 'spontaneous', 'emission', 'properties', 'of', 'radiating', 'molecules', 'embedded', 'in', 'a', 'chiral', 'nematic', 'liquid', 'crystal', 'under', 'the', 'assumption', 'that', 'the', 'electronic', 'transition', 'frequency', 'is', 'close', 'to', 'the', 'photonic', '... | [-0.1398762656436504, 0.14865122193131475, -0.07806132518301677, 0.038303878985892006, -0.017855075804982336, -0.07971185591608367, 0.015545020780004764, 0.4033469834405443, -0.2526156575297532, -0.26929512110174353, 0.04052405255775818, -0.30529953174434765, -0.13139861332981484, 0.14244450262707212, 0.069370178365573... |
1,802.06318 | Large Neighborhood-Based Metaheuristic and Branch-and-Price for the
Pickup and Delivery Problem with Split Loads | We consider the multi-vehicle one-to-one pickup and delivery problem with
split loads, a NP-hard problem linked with a variety of applications for bulk
product transportation, bike-sharing systems and inventory re-balancing. This
problem is notoriously difficult due to the interaction of two challenging
vehicle routi... | cs.AI | we consider the multivehicle onetoone pickup and delivery problem with split loads a nphard problem linked with a variety of applications for bulk product transportation bikesharing systems and inventory rebalancing this problem is notoriously difficult due to the interaction of two challenging vehicle routing attribut... | [['we', 'consider', 'the', 'multivehicle', 'onetoone', 'pickup', 'and', 'delivery', 'problem', 'with', 'split', 'loads', 'a', 'nphard', 'problem', 'linked', 'with', 'a', 'variety', 'of', 'applications', 'for', 'bulk', 'product', 'transportation', 'bikesharing', 'systems', 'and', 'inventory', 'rebalancing', 'this', 'pro... | [-0.1393865970246772, 0.017633526483935208, -0.023263825973858256, 0.0488151438150774, -0.10468656026623402, -0.18778769568144027, 0.11980066898571774, 0.3802702417470751, -0.281851612872442, -0.3931967184385833, 0.0902129517472033, -0.27595856603934554, -0.13860555024653234, 0.2090056394943251, -0.07892616876143946, 0... |
1,802.06319 | Consensus in Software Engineering: A Cognitive Mapping Study | Background: Philosophers of science including Collins, Feyerabend, Kuhn and
Latour have all emphasized the importance of consensus within scientific
communities of practice. Consensus is important for maintaining legitimacy with
outsiders, orchestrating future research, developing educational curricula and
agreeing i... | cs.SE | background philosophers of science including collins feyerabend kuhn and latour have all emphasized the importance of consensus within scientific communities of practice consensus is important for maintaining legitimacy with outsiders orchestrating future research developing educational curricula and agreeing industry ... | [['background', 'philosophers', 'of', 'science', 'including', 'collins', 'feyerabend', 'kuhn', 'and', 'latour', 'have', 'all', 'emphasized', 'the', 'importance', 'of', 'consensus', 'within', 'scientific', 'communities', 'of', 'practice', 'consensus', 'is', 'important', 'for', 'maintaining', 'legitimacy', 'with', 'outsi... | [-0.11334264928106373, 0.09056443709414452, -0.061118837603781784, 0.0936949255274764, -0.15024272686536683, -0.1579907966398524, 0.08108098674112828, 0.41998579857043095, -0.2060634796300696, -0.3704290301733029, 0.0846691573847137, -0.24345855515243278, -0.14053519223493316, 0.15804515327197602, -0.12635833996011772,... |
1,802.0632 | Mass problem in the Standard Model | We propose a new $\mathrm{SU}(3)_C \otimes \mathrm{SU}(2)_{L}\otimes
\mathrm{U}(1)_{Y}\otimes \mathrm{U}(1)_{X}$ gauge model which is non universal
respect to the three fermion families of the Standard Model. We introduce
additional one top-like quark, two bottom-like quarks and three right handed
neutrinos in order ... | hep-ph | we propose a new mathrmsu3_c otimes mathrmsu2_lotimes mathrmu1_yotimes mathrmu1_x gauge model which is non universal respect to the three fermion families of the standard model we introduce additional one toplike quark two bottomlike quarks and three right handed neutrinos in order to have an anomaly free theory we als... | [['we', 'propose', 'a', 'new', 'mathrmsu3_c', 'otimes', 'mathrmsu2_lotimes', 'mathrmu1_yotimes', 'mathrmu1_x', 'gauge', 'model', 'which', 'is', 'non', 'universal', 'respect', 'to', 'the', 'three', 'fermion', 'families', 'of', 'the', 'standard', 'model', 'we', 'introduce', 'additional', 'one', 'toplike', 'quark', 'two',... | [-0.0868719646743856, 0.3149354809805255, -0.009589026123524504, 0.1709721482132421, -0.08514867490157485, -0.18937199988581035, 0.04368897799437559, 0.3491446849035278, -0.21307221067549456, -0.291960948437918, 0.033130314957816154, -0.29977486752075694, -0.031289498863920365, 0.10346883432206072, 0.04408332406784797,... |
1,802.06321 | The Dangerous Dogmas of Software Engineering | To legitimize itself as a scientific discipline, the software engineering
academic community must let go of its non-empirical dogmas. A dogma is belief
held regardless of evidence. This paper analyzes the nature and detrimental
effects of four software engineering dogmas - 1) the belief that software has
"requirement... | cs.SE | to legitimize itself as a scientific discipline the software engineering academic community must let go of its nonempirical dogmas a dogma is belief held regardless of evidence this paper analyzes the nature and detrimental effects of four software engineering dogmas 1 the belief that software has requirements 2 the di... | [['to', 'legitimize', 'itself', 'as', 'a', 'scientific', 'discipline', 'the', 'software', 'engineering', 'academic', 'community', 'must', 'let', 'go', 'of', 'its', 'nonempirical', 'dogmas', 'a', 'dogma', 'is', 'belief', 'held', 'regardless', 'of', 'evidence', 'this', 'paper', 'analyzes', 'the', 'nature', 'and', 'detrim... | [-0.10687167703982789, 0.0376734018897299, -0.10412380852821199, 0.07505331221336471, -0.1315073512642729, -0.18800266988039244, 0.053386462874407174, 0.3806521014141088, -0.24755473665991853, -0.3238784037812641, 0.12380836556125856, -0.23502293132795868, -0.21733347105680767, 0.19200428160591843, -0.10283998593292905... |
1,802.06322 | Spin Solid versus Magnetic Charge Ordered State in Artificial Honeycomb
Lattice of Connected Elements | The nature of magnetic correlation at low temperature in two-dimensional
artificial magnetic honeycomb lattice is a strongly debated issue. While
theoretical researches suggest that the system will develop a novel zero
entropy spin solid state as T --> 0 K, a confirmation to this effect in
artificial honeycomb lattic... | cond-mat.mes-hall | the nature of magnetic correlation at low temperature in twodimensional artificial magnetic honeycomb lattice is a strongly debated issue while theoretical researches suggest that the system will develop a novel zero entropy spin solid state as t 0 k a confirmation to this effect in artificial honeycomb lattice of conn... | [['the', 'nature', 'of', 'magnetic', 'correlation', 'at', 'low', 'temperature', 'in', 'twodimensional', 'artificial', 'magnetic', 'honeycomb', 'lattice', 'is', 'a', 'strongly', 'debated', 'issue', 'while', 'theoretical', 'researches', 'suggest', 'that', 'the', 'system', 'will', 'develop', 'a', 'novel', 'zero', 'entropy... | [-0.19803878544379308, 0.24213786812438426, -0.03966072067851201, -0.014019637416704032, -0.06875613459471977, -0.11655945492574298, 0.05211216991301626, 0.41707582063163107, -0.25628432483189617, -0.27719603984555957, 0.03311246319840986, -0.2933152972103056, -0.11050458623440532, 0.1612427320442689, 0.090454957857930... |
1,802.06323 | New Description of Evolution of Magnetic Phases in Artificial Honeycomb
Lattice | Artificial magnetic honeycomb lattice provides a two-dimensional archetypal
system to explore novel phenomena of geometrically frustrated magnets.
According to theoretical reports, an artificial magnetic honeycomb lattice is
expected to exhibit several phase transitions to unique magnetic states as a
function of redu... | cond-mat.mes-hall | artificial magnetic honeycomb lattice provides a twodimensional archetypal system to explore novel phenomena of geometrically frustrated magnets according to theoretical reports an artificial magnetic honeycomb lattice is expected to exhibit several phase transitions to unique magnetic states as a function of reducing ... | [['artificial', 'magnetic', 'honeycomb', 'lattice', 'provides', 'a', 'twodimensional', 'archetypal', 'system', 'to', 'explore', 'novel', 'phenomena', 'of', 'geometrically', 'frustrated', 'magnets', 'according', 'to', 'theoretical', 'reports', 'an', 'artificial', 'magnetic', 'honeycomb', 'lattice', 'is', 'expected', 'to... | [-0.20548856720644315, 0.22975333095954348, -0.026598549057130834, 0.0022335453474495027, -0.08627244672139309, -0.15446327411835747, 0.06889225105655246, 0.38512574325847837, -0.24492499898853046, -0.3135920423881284, 0.0423195852137204, -0.3072131034286161, -0.09707150498371837, 0.143408892736105, 0.06803521903763925... |
1,802.06324 | Fractional electrical dimensionality in the spin solid phase of
artificial honeycomb lattice | Two-dimensional artificial magnetic honeycomb lattice is at the forefront of
research on unconventional magnetic materials. Among the many emergent magnetic
phases that are predicted to arise as a function of temperature, the low
temperature spin solid phase with zero magnetization and entropy is of special
importanc... | cond-mat.mes-hall | twodimensional artificial magnetic honeycomb lattice is at the forefront of research on unconventional magnetic materials among the many emergent magnetic phases that are predicted to arise as a function of temperature the low temperature spin solid phase with zero magnetization and entropy is of special importance her... | [['twodimensional', 'artificial', 'magnetic', 'honeycomb', 'lattice', 'is', 'at', 'the', 'forefront', 'of', 'research', 'on', 'unconventional', 'magnetic', 'materials', 'among', 'the', 'many', 'emergent', 'magnetic', 'phases', 'that', 'are', 'predicted', 'to', 'arise', 'as', 'a', 'function', 'of', 'temperature', 'the',... | [-0.19811291459145172, 0.24737487426893112, -0.0260994203793081, -0.03004956294975464, -0.0465181008437771, -0.15249651389833735, 0.07369355625767064, 0.363125738222152, -0.29442794660204336, -0.2760321236350329, 0.060049198808356824, -0.3177371404002004, -0.13915759107974163, 0.18127328248106336, 0.03201642241267683, ... |
1,802.06325 | Scaling of nonlinear susceptibilities in artificial permalloy honeycomb
lattice | Two-dimensional artificial magnetic honeycomb lattice is predicted to
manifest thermodynamic phase transition to the spin solid order ground state at
low temperature. Nonlinear susceptibilities are very sensitive to thermodynamic
phase transition. We have performed the analysis of nonlinear susceptibility to
explore ... | cond-mat.mes-hall | twodimensional artificial magnetic honeycomb lattice is predicted to manifest thermodynamic phase transition to the spin solid order ground state at low temperature nonlinear susceptibilities are very sensitive to thermodynamic phase transition we have performed the analysis of nonlinear susceptibility to explore the t... | [['twodimensional', 'artificial', 'magnetic', 'honeycomb', 'lattice', 'is', 'predicted', 'to', 'manifest', 'thermodynamic', 'phase', 'transition', 'to', 'the', 'spin', 'solid', 'order', 'ground', 'state', 'at', 'low', 'temperature', 'nonlinear', 'susceptibilities', 'are', 'very', 'sensitive', 'to', 'thermodynamic', 'ph... | [-0.17133073675905786, 0.2527841930103593, -0.04395799062464362, 0.015398029975282649, -0.06260489083954371, -0.14669238578138594, 0.1001560838095649, 0.3607666965831205, -0.24747709659068218, -0.2788113740035424, 0.05746477873755461, -0.3443576258795908, -0.10399252166241116, 0.12365331525193053, 0.09183931609713077, ... |
1,802.06326 | Sensitivity and Bifurcation Analysis of a DAE Model for a Microbial
Electrolysis Cell | Microbial electrolysis cells (MECs) are a promising new technology for
producing hydrogen cheaply, efficiently, and sustainably. However, to scale up
this technology, we need a better understanding of the processes in the
devices. In this effort, we present a differential-algebraic equation (DAE)
model of a microbial... | math.DS q-bio.OT | microbial electrolysis cells mecs are a promising new technology for producing hydrogen cheaply efficiently and sustainably however to scale up this technology we need a better understanding of the processes in the devices in this effort we present a differentialalgebraic equation dae model of a microbial electrolysis ... | [['microbial', 'electrolysis', 'cells', 'mecs', 'are', 'a', 'promising', 'new', 'technology', 'for', 'producing', 'hydrogen', 'cheaply', 'efficiently', 'and', 'sustainably', 'however', 'to', 'scale', 'up', 'this', 'technology', 'we', 'need', 'a', 'better', 'understanding', 'of', 'the', 'processes', 'in', 'the', 'device... | [-0.13718284658294042, 0.10682137566833785, -0.045978899658313345, 0.04260838863504181, -0.02481344390790982, -0.14632062584520517, 0.10507765856701953, 0.3280070981650399, -0.2735250603230054, -0.30198855090212323, 0.12348150684097818, -0.27969986750610204, -0.10855553844211631, 0.1549914609695194, -0.0195814462827975... |
1,802.06327 | Directional and Causal Information Flow in EEG for Assessing Perceived
Audio Quality | In this paper, electroencephalography (EEG) measurements are used to infer
change in cortical functional connectivity in response to change in audio
stimulus. Experiments are conducted wherein the EEG activity of human subjects
is recorded as they listen to audio sequences whose quality varies with time. A
causal inf... | eess.SP eess.AS q-bio.NC | in this paper electroencephalography eeg measurements are used to infer change in cortical functional connectivity in response to change in audio stimulus experiments are conducted wherein the eeg activity of human subjects is recorded as they listen to audio sequences whose quality varies with time a causal informatio... | [['in', 'this', 'paper', 'electroencephalography', 'eeg', 'measurements', 'are', 'used', 'to', 'infer', 'change', 'in', 'cortical', 'functional', 'connectivity', 'in', 'response', 'to', 'change', 'in', 'audio', 'stimulus', 'experiments', 'are', 'conducted', 'wherein', 'the', 'eeg', 'activity', 'of', 'human', 'subjects'... | [-0.07611298080999404, 0.06587704831916198, -0.08714101092307829, 0.10167855016537942, -0.11566784397349693, -0.16533984516980127, 0.027771747125079856, 0.4286995607893914, -0.3009069302957505, -0.33123428889084605, 0.05386931562388782, -0.3224155927496031, -0.1803286448121071, 0.1684532444132492, -0.13890843700617553,... |
1,802.06328 | Minimum length RNA folding trajectories | The Kinfold and KFOLD programs for RNA folding kinetics implement the
Gillespie algorithm to generate stochastic folding trajectories from an initial
structure s to a target structure t, in which each intermediate secondary
structure is obtained from its predecessor by the addition, removal or shift of
a single base ... | cs.DS q-bio.BM | the kinfold and kfold programs for rna folding kinetics implement the gillespie algorithm to generate stochastic folding trajectories from an initial structure s to a target structure t in which each intermediate secondary structure is obtained from its predecessor by the addition removal or shift of a single base pair... | [['the', 'kinfold', 'and', 'kfold', 'programs', 'for', 'rna', 'folding', 'kinetics', 'implement', 'the', 'gillespie', 'algorithm', 'to', 'generate', 'stochastic', 'folding', 'trajectories', 'from', 'an', 'initial', 'structure', 's', 'to', 'a', 'target', 'structure', 't', 'in', 'which', 'each', 'intermediate', 'secondar... | [-0.1651438395872255, 0.09191851777936275, -0.04918476179132968, 0.0914857850811741, -0.12074718114428713, -0.21341790647361933, 0.09869432612236985, 0.4114741740923975, -0.3709661004989793, -0.3378492312202223, 0.03717201255814551, -0.24353377389532452, -0.16515837287131166, 0.15038118723800387, -0.05855442725817908, ... |
1,802.06329 | Metrics in projective differential geometry: the geometry of solutions
to the metrizability equation | Pseudo-Riemannian metrics with Levi-Civita connection in the projective class
of a given torsion free affine connection can be obtained from (and are
equivalent to) the maximal rank solutions of a certain overdetermined
projectively invariant differential equation often called the metrizability
equation. Dropping thi... | math.DG | pseudoriemannian metrics with levicivita connection in the projective class of a given torsion free affine connection can be obtained from and are equivalent to the maximal rank solutions of a certain overdetermined projectively invariant differential equation often called the metrizability equation dropping this rank ... | [['pseudoriemannian', 'metrics', 'with', 'levicivita', 'connection', 'in', 'the', 'projective', 'class', 'of', 'a', 'given', 'torsion', 'free', 'affine', 'connection', 'can', 'be', 'obtained', 'from', 'and', 'are', 'equivalent', 'to', 'the', 'maximal', 'rank', 'solutions', 'of', 'a', 'certain', 'overdetermined', 'proje... | [-0.17031111725851958, 0.022176561140338388, -0.08756946383681131, 0.07688306131625944, -0.13061648798457376, -0.14535509782855388, -0.006442272467175861, 0.2979218135688664, -0.30084139886372663, -0.22343298304297868, 0.11857726516653642, -0.25001585282772393, -0.1732516741718758, 0.19891922802007173, -0.1171902677072... |
1,802.0633 | The Category of Factorization | We introduce and investigate the category of factorization of a
multiplicative, commutative, cancellative, pre-ordered monoid $A$, which we
denote $\mathcal{F}(A)$. The objects of $\mathcal{F}(A)$ are factorizations of
elements of $A$, and the morphisms in $\mathcal{F}(A)$ encode combinatorial
similarities and differ... | math.AC math.CT | we introduce and investigate the category of factorization of a multiplicative commutative cancellative preordered monoid a which we denote mathcalfa the objects of mathcalfa are factorizations of elements of a and the morphisms in mathcalfa encode combinatorial similarities and differences between the factorizations w... | [['we', 'introduce', 'and', 'investigate', 'the', 'category', 'of', 'factorization', 'of', 'a', 'multiplicative', 'commutative', 'cancellative', 'preordered', 'monoid', 'a', 'which', 'we', 'denote', 'mathcalfa', 'the', 'objects', 'of', 'mathcalfa', 'are', 'factorizations', 'of', 'elements', 'of', 'a', 'and', 'the', 'mo... | [-0.14676118450747294, 0.04490751362609444, -0.07136477322571656, 0.11694348650582304, -0.13329948373562234, -0.10302443996241147, 0.001457774012603543, 0.4184597050601786, -0.43522810143503277, -0.17656596546823328, 0.08614765280614269, -0.25734749217941, -0.13607728359374133, 0.12267434160140428, -0.1389247558841651,... |
1,802.06331 | On the general dual Orlicz-Minkowski problem | For $K\subseteq \mathbb{R}^n$ a convex body with the origin $o$ in its
interior, and $\phi:\mathbb{R}^n\setminus\{o\}\rightarrow(0, \infty)$ a
continuous function, define the general dual ($L_{\phi})$ Orlicz
quermassintegral of $K$ by $$\mathcal{V}_\phi(K)=\int_{\mathbb{R}^n \setminus
K} \phi(x)\,dx.$$ Under certain ... | math.MG math.AP | for ksubseteq mathbbrn a convex body with the origin o in its interior and phimathbbrnsetminusorightarrow0 infty a continuous function define the general dual l_phi orlicz quermassintegral of k by mathcalv_phikint_mathbbrn setminus k phixdx under certain conditions on phi we prove a variational formula for the general ... | [['for', 'ksubseteq', 'mathbbrn', 'a', 'convex', 'body', 'with', 'the', 'origin', 'o', 'in', 'its', 'interior', 'and', 'phimathbbrnsetminusorightarrow0', 'infty', 'a', 'continuous', 'function', 'define', 'the', 'general', 'dual', 'l_phi', 'orlicz', 'quermassintegral', 'of', 'k', 'by', 'mathcalv_phikint_mathbbrn', 'setm... | [-0.14333760623885378, 0.09098016179409946, -0.09347413412953733, 0.07993947330100024, -0.07042966532123507, -0.17159344504178045, 0.026948684890262167, 0.31055368751192547, -0.3386654818377155, -0.12506199854716754, 0.11131481926926785, -0.2691255110526564, -0.1169139471225393, 0.1514807594524827, -0.13122277812747535... |
1,802.06332 | A rank-based Cram\'er-von-Mises-type test for two samples | We study a rank based univariate two-sample distribution-free test. The test
statistic is the difference between the average of between-group rank distances
and the average of within-group rank distances. This test statistic is closely
related to the two-sample Cram\'er-von Mises criterion. They are different
empiric... | stat.ME | we study a rank based univariate twosample distributionfree test the test statistic is the difference between the average of betweengroup rank distances and the average of withingroup rank distances this test statistic is closely related to the twosample cramervon mises criterion they are different empirical versions o... | [['we', 'study', 'a', 'rank', 'based', 'univariate', 'twosample', 'distributionfree', 'test', 'the', 'test', 'statistic', 'is', 'the', 'difference', 'between', 'the', 'average', 'of', 'betweengroup', 'rank', 'distances', 'and', 'the', 'average', 'of', 'withingroup', 'rank', 'distances', 'this', 'test', 'statistic', 'is... | [-0.038770866413999884, 0.009108089762074606, -0.18094801804375102, 0.14878280202763564, -0.07535203803796321, -0.1652199608007712, 0.05400565015085574, 0.3504439082848174, -0.2174526300520769, -0.28200594980535765, 0.11628644432872534, -0.24383126092276403, -0.12286755135548966, 0.212319930855717, -0.09372279191522725... |
1,802.06333 | Explicit equations of a fake projective plane | Fake projective planes are smooth complex surfaces of general type with Betti
numbers equal to those of the usual projective plane. They come in complex
conjugate pairs and have been classified as quotients of the two-dimensional
ball by explicitly written arithmetic subgroups. In this paper we find
equations of a pr... | math.AG | fake projective planes are smooth complex surfaces of general type with betti numbers equal to those of the usual projective plane they come in complex conjugate pairs and have been classified as quotients of the twodimensional ball by explicitly written arithmetic subgroups in this paper we find equations of a project... | [['fake', 'projective', 'planes', 'are', 'smooth', 'complex', 'surfaces', 'of', 'general', 'type', 'with', 'betti', 'numbers', 'equal', 'to', 'those', 'of', 'the', 'usual', 'projective', 'plane', 'they', 'come', 'in', 'complex', 'conjugate', 'pairs', 'and', 'have', 'been', 'classified', 'as', 'quotients', 'of', 'the', ... | [-0.20126308903098106, 0.07797802297573071, -0.03175571334858735, 0.07349803225913396, -0.08159495695494115, -0.11555304575711489, -0.03697865269922962, 0.32951858078440033, -0.3063396969437599, -0.26387077011168003, 0.08085693922204276, -0.2892548603564501, -0.13236648411800464, 0.21644114354935784, -0.134678748703251... |
1,802.06334 | New Physics Searches Using Precision Spectroscopy | The exceptional precision attainable using modern spectroscopic techniques
provides a promising avenue to search for signatures of physics beyond the
Standard Model in tiny shifts of the energy levels of atoms and molecules. We
briefly review three categories of new-physics searches based in precision
measurements: t... | physics.atom-ph | the exceptional precision attainable using modern spectroscopic techniques provides a promising avenue to search for signatures of physics beyond the standard model in tiny shifts of the energy levels of atoms and molecules we briefly review three categories of newphysics searches based in precision measurements tests ... | [['the', 'exceptional', 'precision', 'attainable', 'using', 'modern', 'spectroscopic', 'techniques', 'provides', 'a', 'promising', 'avenue', 'to', 'search', 'for', 'signatures', 'of', 'physics', 'beyond', 'the', 'standard', 'model', 'in', 'tiny', 'shifts', 'of', 'the', 'energy', 'levels', 'of', 'atoms', 'and', 'molecul... | [-0.11192771141556487, 0.1801004386629077, -0.0011183626403839424, 0.05979028806804904, -0.030356659404077065, -0.12410459679219572, 0.0983556553510007, 0.3184875513095109, -0.2206890496543084, -0.3585866737452432, 0.04948503297389667, -0.28446629714092303, -0.024929397528049076, 0.22893268824019736, 0.0934182293284898... |
1,802.06335 | A Pieri-type formula and a factorization formula for sums of
$K$-$k$-Schur functions | We give a Pieri-type formula for the sum of $K$-$k$-Schur functions
$\sum_{\mu\le\lambda} g^{(k)}_{\mu}$ over a principal order ideal of the poset
of $k$-bounded partitions under the strong Bruhat order, which sum we denote by
$\widetilde{g}^{(k)}_{\lambda}$. As an application of this, we also give a
$k$-rectangle fa... | math.CO | we give a pieritype formula for the sum of kkschur functions sum_mulelambda gk_mu over a principal order ideal of the poset of kbounded partitions under the strong bruhat order which sum we denote by widetildegk_lambda as an application of this we also give a krectangle factorization formula widetildegk_r_tcuplambdawid... | [['we', 'give', 'a', 'pieritype', 'formula', 'for', 'the', 'sum', 'of', 'kkschur', 'functions', 'sum_mulelambda', 'gk_mu', 'over', 'a', 'principal', 'order', 'ideal', 'of', 'the', 'poset', 'of', 'kbounded', 'partitions', 'under', 'the', 'strong', 'bruhat', 'order', 'which', 'sum', 'we', 'denote', 'by', 'widetildegk_lam... | [-0.16367158891633152, 0.045270961581554726, -0.11310897499322892, 0.042140022951643916, -0.08107471558265388, -0.03693198493681848, 0.05950227078050375, 0.29739612044766545, -0.3173369850218296, -0.1768122972920537, 0.08545754791237414, -0.22714853316545486, -0.1721469149366021, 0.16799759875983, -0.03862850086763501,... |
1,802.06336 | Uniqueness of power of a meromorphic function with its differential
polynomial | In this paper, taking the question of Zhang and L\"{u} into the background,
we present one theorem which will improve and extend some recent results
related to the Br\"{u}ck Conjecture.
| math.CV | in this paper taking the question of zhang and lu into the background we present one theorem which will improve and extend some recent results related to the bruck conjecture | [['in', 'this', 'paper', 'taking', 'the', 'question', 'of', 'zhang', 'and', 'lu', 'into', 'the', 'background', 'we', 'present', 'one', 'theorem', 'which', 'will', 'improve', 'and', 'extend', 'some', 'recent', 'results', 'related', 'to', 'the', 'bruck', 'conjecture']] | [-0.05749794367390374, 0.04475020087944965, -0.07638223643104235, 0.015600444977947821, -0.07166225990901391, -0.08644154760986567, 0.05444832878420129, 0.2650085193105042, -0.26107152352730434, -0.2862787805187205, 0.11960027888029193, -0.24488219853956253, -0.1733930978924036, 0.20921341540912788, -0.1767119038229187... |
1,802.06337 | Large thermoelectric response in a diluted ferroelectric system:
Ba0.7Eu0.3Ti1-xNbxO3 | We investigated the electrical conductivity, thermal conductivity and
thermopower as a function of Nb content (x) in Ba0.7Eu0.3Ti1-xNbxO3 (x = 0.001-
0.10) in the temperature range T = 400-2 K. The substitution of Nb destabilizes
the ferroelectric insulating ground state of Ba0.7Eu0.3TiO3 and transforms into
a parama... | cond-mat.mtrl-sci | we investigated the electrical conductivity thermal conductivity and thermopower as a function of nb content x in ba07eu03ti1xnbxo3 x 0001 010 in the temperature range t 4002 k the substitution of nb destabilizes the ferroelectric insulating ground state of ba07eu03tio3 and transforms into a paramagnetic metal for x 01... | [['we', 'investigated', 'the', 'electrical', 'conductivity', 'thermal', 'conductivity', 'and', 'thermopower', 'as', 'a', 'function', 'of', 'nb', 'content', 'x', 'in', 'ba07eu03ti1xnbxo3', 'x', '0001', '010', 'in', 'the', 'temperature', 'range', 't', '4002', 'k', 'the', 'substitution', 'of', 'nb', 'destabilizes', 'the',... | [-0.12196439385665687, 0.23795828466362523, 0.02478696986492295, -0.06489769116461534, 0.017439875617254012, -0.15523397008588688, 0.17324121388634828, 0.3927092570383316, -0.3120112826749308, -0.30946614369535924, -0.025496093579032725, -0.43366561861087877, 0.009244467447586786, 0.1753461803604003, 0.0288306947198064... |
1,802.06338 | Sequence-to-Sequence Prediction of Vehicle Trajectory via LSTM
Encoder-Decoder Architecture | In this paper, we propose a deep learning based vehicle trajectory prediction
technique which can generate the future trajectory sequence of surrounding
vehicles in real time. We employ the encoder-decoder architecture which
analyzes the pattern underlying in the past trajectory using the long
short-term memory (LSTM... | cs.LG | in this paper we propose a deep learning based vehicle trajectory prediction technique which can generate the future trajectory sequence of surrounding vehicles in real time we employ the encoderdecoder architecture which analyzes the pattern underlying in the past trajectory using the long shortterm memory lstm based ... | [['in', 'this', 'paper', 'we', 'propose', 'a', 'deep', 'learning', 'based', 'vehicle', 'trajectory', 'prediction', 'technique', 'which', 'can', 'generate', 'the', 'future', 'trajectory', 'sequence', 'of', 'surrounding', 'vehicles', 'in', 'real', 'time', 'we', 'employ', 'the', 'encoderdecoder', 'architecture', 'which', ... | [-0.11414196577511336, 0.025005115228786803, -0.10348481139813534, 0.022381634985529735, -0.07025934625090215, -0.18409377695551435, 0.08326761078869663, 0.4565998341626765, -0.2910578815121481, -0.3140755089963868, 0.0749769650017761, -0.23564426628709362, -0.19940649569361357, 0.18922412047507814, -0.0860559736978948... |
1,802.06339 | Level-zero van der Kallen modules and specialization of nonsymmetric
Macdonald polynomials at $t = \infty$ | Let $\lambda \in P^{+}$ be a level-zero dominant integral weight, and $w$ an
arbitrary coset representative of minimal length for the cosets in
$W/W_{\lambda}$, where $W_{\lambda}$ is the stabilizer of $\lambda$ in a finite
Weyl group $W$. In this paper, we give a module $\mathbb{K}_{w}(\lambda)$ over
the negative pa... | math.QA math.RT | let lambda in p be a levelzero dominant integral weight and w an arbitrary coset representative of minimal length for the cosets in ww_lambda where w_lambda is the stabilizer of lambda in a finite weyl group w in this paper we give a module mathbbk_wlambda over the negative part of a quantum affine algebra whose graded... | [['let', 'lambda', 'in', 'p', 'be', 'a', 'levelzero', 'dominant', 'integral', 'weight', 'and', 'w', 'an', 'arbitrary', 'coset', 'representative', 'of', 'minimal', 'length', 'for', 'the', 'cosets', 'in', 'ww_lambda', 'where', 'w_lambda', 'is', 'the', 'stabilizer', 'of', 'lambda', 'in', 'a', 'finite', 'weyl', 'group', 'w... | [-0.19078144006404682, 0.13713066765127443, -0.0401679283199528, -0.006393355210906172, -0.07017405693095627, -0.17746303264540456, -0.011981392173585317, 0.2956994433775016, -0.3825806776946741, -0.14700964382719184, 0.050213144205391726, -0.24839965526529767, -0.0953290445535239, 0.18177118887200105, -0.0592133940052... |
1,802.0634 | Graphical Models for Non-Negative Data Using Generalized Score Matching | A common challenge in estimating parameters of probability density functions
is the intractability of the normalizing constant. While in such cases maximum
likelihood estimation may be implemented using numerical integration, the
approach becomes computationally intensive. In contrast, the score matching
method of Hy... | stat.ME | a common challenge in estimating parameters of probability density functions is the intractability of the normalizing constant while in such cases maximum likelihood estimation may be implemented using numerical integration the approach becomes computationally intensive in contrast the score matching method of hyvarine... | [['a', 'common', 'challenge', 'in', 'estimating', 'parameters', 'of', 'probability', 'density', 'functions', 'is', 'the', 'intractability', 'of', 'the', 'normalizing', 'constant', 'while', 'in', 'such', 'cases', 'maximum', 'likelihood', 'estimation', 'may', 'be', 'implemented', 'using', 'numerical', 'integration', 'the... | [-0.052198340812617025, -0.01912104957534567, -0.08801582290831467, 0.058083360891222305, -0.08181183563504854, -0.13810117149361126, 0.07137508813150065, 0.3947088129170563, -0.20922337611327352, -0.3159002740503005, 0.08399088833400088, -0.2520463771713169, -0.15911308675295796, 0.17369509368487027, -0.13266576908771... |
1,802.06341 | The Mu2e Calorimeter Final Technical Design Report | Since the first version of the Mu2e TDR released at the beginning of 2015,
the Mu2e Calorimeter system has undergone a long list of changes to arrive to
its final design. These changes were primarily caused by two reasons: (i) the
technology choice between the TDR proposed solution of BaF2 crystals readout
with solar... | physics.ins-det hep-ex | since the first version of the mu2e tdr released at the beginning of 2015 the mu2e calorimeter system has undergone a long list of changes to arrive to its final design these changes were primarily caused by two reasons i the technology choice between the tdr proposed solution of baf2 crystals readout with solar blind ... | [['since', 'the', 'first', 'version', 'of', 'the', 'mu2e', 'tdr', 'released', 'at', 'the', 'beginning', 'of', '2015', 'the', 'mu2e', 'calorimeter', 'system', 'has', 'undergone', 'a', 'long', 'list', 'of', 'changes', 'to', 'arrive', 'to', 'its', 'final', 'design', 'these', 'changes', 'were', 'primarily', 'caused', 'by',... | [-0.08670372976633035, 0.12603447535817008, -0.032761029884697195, -0.08499670416565892, -0.028885281174979377, -0.1996777064488393, 0.0068709574473931135, 0.38788994489056344, -0.20444377350303616, -0.3919723552025327, 0.1252449250623452, -0.33499074340344664, -0.053654683779088566, 0.1628800089088829, -0.068370236792... |
1,802.06342 | Stability Theorems for Group Actions on Uniform Spaces | We extend the notions of topological stability, shadowing and persistence
from homeomorphisms to finitely generated group actions on uniform spaces and
prove that an expansive action with either shadowing or persistence is
topologically stable. Using the concept of null set of a Borel measure $\mu$,
we introduce the ... | math.DS | we extend the notions of topological stability shadowing and persistence from homeomorphisms to finitely generated group actions on uniform spaces and prove that an expansive action with either shadowing or persistence is topologically stable using the concept of null set of a borel measure mu we introduce the notions ... | [['we', 'extend', 'the', 'notions', 'of', 'topological', 'stability', 'shadowing', 'and', 'persistence', 'from', 'homeomorphisms', 'to', 'finitely', 'generated', 'group', 'actions', 'on', 'uniform', 'spaces', 'and', 'prove', 'that', 'an', 'expansive', 'action', 'with', 'either', 'shadowing', 'or', 'persistence', 'is', ... | [-0.15993799301130432, 0.2056707886398986, -0.13843058736196587, 0.07027087058938508, -0.035401705067072596, -0.08670972525807363, 0.0363222665419536, 0.4155455668057714, -0.33877960299806936, -0.134437182153176, 0.14978697329892643, -0.2834011856998716, -0.12910050846237156, 0.17388929978146084, -0.15451557920979603, ... |
1,802.06343 | On an infinite limit of BGG categories O | We study a version of the BGG category O for Dynkin Borel subalgebras of
root-reductive Lie algebras g, such as gl(\infty). We prove results about
extension fullness and compute the higher extensions of simple modules by Verma
modules. In addition, we show that our category O is Ringel self-dual and
initiate the stud... | math.RT | we study a version of the bgg category o for dynkin borel subalgebras of rootreductive lie algebras g such as glinfty we prove results about extension fullness and compute the higher extensions of simple modules by verma modules in addition we show that our category o is ringel selfdual and initiate the study of koszul... | [['we', 'study', 'a', 'version', 'of', 'the', 'bgg', 'category', 'o', 'for', 'dynkin', 'borel', 'subalgebras', 'of', 'rootreductive', 'lie', 'algebras', 'g', 'such', 'as', 'glinfty', 'we', 'prove', 'results', 'about', 'extension', 'fullness', 'and', 'compute', 'the', 'higher', 'extensions', 'of', 'simple', 'modules', '... | [-0.15097663111599355, -0.01913244396832172, -0.02946293322990338, 0.09983026242986236, -0.12063258918451852, -0.1479386939538707, -0.02648212503770302, 0.415878808618277, -0.3651813763868192, -0.1812469850109633, 0.08042382410374181, -0.1822232379278318, -0.12689997244026813, 0.17385426623447017, -0.21134090695754978,... |
1,802.06344 | CGC/saturation approach: an impact-parameter dependent model for
diffraction production in DIS | In the paper we discussed the evolution equations for diffractive production
in the framework of CGC/saturation approach, and found the analytical solutions
for several kinematic regions. The most impressive features of these solutions
are, that diffractive production does not exibit geometric scaling behaviour
i.e. ... | hep-ph | in the paper we discussed the evolution equations for diffractive production in the framework of cgcsaturation approach and found the analytical solutions for several kinematic regions the most impressive features of these solutions are that diffractive production does not exibit geometric scaling behaviour ie being a ... | [['in', 'the', 'paper', 'we', 'discussed', 'the', 'evolution', 'equations', 'for', 'diffractive', 'production', 'in', 'the', 'framework', 'of', 'cgcsaturation', 'approach', 'and', 'found', 'the', 'analytical', 'solutions', 'for', 'several', 'kinematic', 'regions', 'the', 'most', 'impressive', 'features', 'of', 'these',... | [-0.06941445650061889, 0.0926321430612337, -0.13569238877707077, 0.10788953910245751, -0.04968036226901776, -0.08074924001994077, 0.009177751530263446, 0.35421481785703113, -0.21424930092987118, -0.2892323888478462, 0.06564832134344298, -0.33164689266017044, -0.09704663063166663, 0.20325444370180115, 0.0180813117441919... |
1,802.06345 | Resolving Two Conjectures on Staircase Encodings and Boundary Grids of
$132$ and $123$-avoiding permutations | This paper analyzes relations between pattern avoidance of certain
permutations and graphs on staircase grids and boundary grids, and proves two
conjectures posed by Bean, Tannock, and Ulfarsson (2015). More specifically,
this paper enumerates a certain family of staircase encodings and proves that
the downcore graph... | math.CO | this paper analyzes relations between pattern avoidance of certain permutations and graphs on staircase grids and boundary grids and proves two conjectures posed by bean tannock and ulfarsson 2015 more specifically this paper enumerates a certain family of staircase encodings and proves that the downcore graph a certai... | [['this', 'paper', 'analyzes', 'relations', 'between', 'pattern', 'avoidance', 'of', 'certain', 'permutations', 'and', 'graphs', 'on', 'staircase', 'grids', 'and', 'boundary', 'grids', 'and', 'proves', 'two', 'conjectures', 'posed', 'by', 'bean', 'tannock', 'and', 'ulfarsson', '2015', 'more', 'specifically', 'this', 'p... | [-0.1780401043280209, 0.12514606608925127, -0.0536313785899741, 0.05944316407193481, -0.08671122633515754, -0.13787694052896565, 0.0876706113502021, 0.33266894933250213, -0.2907687839017146, -0.3206603442473958, 0.15044650472474233, -0.24328512394115226, -0.1894012375592461, 0.14073070799834872, -0.17334752487173924, 0... |
1,802.06346 | Design and status of the Mu2e crystal calorimeter | The Mu2e experiment at Fermilab searches for the charged-lepton flavour
violating (CLFV) conversion of a negative muon into an electron in the field of
an aluminum nucleus, with a distinctive signature of a mono-energetic electron
of energy slightly below the muon rest mass (104.967 MeV). The Mu2e goal is to
improve ... | physics.ins-det hep-ex | the mu2e experiment at fermilab searches for the chargedlepton flavour violating clfv conversion of a negative muon into an electron in the field of an aluminum nucleus with a distinctive signature of a monoenergetic electron of energy slightly below the muon rest mass 104967 mev the mu2e goal is to improve by four ord... | [['the', 'mu2e', 'experiment', 'at', 'fermilab', 'searches', 'for', 'the', 'chargedlepton', 'flavour', 'violating', 'clfv', 'conversion', 'of', 'a', 'negative', 'muon', 'into', 'an', 'electron', 'in', 'the', 'field', 'of', 'an', 'aluminum', 'nucleus', 'with', 'a', 'distinctive', 'signature', 'of', 'a', 'monoenergetic',... | [-0.0914331031870274, 0.19806333228515483, -0.0262884480131528, 0.03947522111649593, -0.024426005239675475, -0.11953697082969031, -0.004412789796762339, 0.3738793660479353, -0.17991680774327365, -0.38994722079929184, 0.049268554264020895, -0.3261915218437395, 0.045037480120763126, 0.1942713894591819, 0.0172070625801163... |
1,802.06347 | Optimal stopping, randomized stopping and singular control with partial
information flow | The purpose of this paper is two-fold:
We extend the well-known relation between optimal stopping and randomized
stopping of a given stochastic process to a situation where the available
information flow is a filtration with no a priori assumed relation to the
filtration of the process. We call these problems optim... | math.OC | the purpose of this paper is twofold we extend the wellknown relation between optimal stopping and randomized stopping of a given stochastic process to a situation where the available information flow is a filtration with no a priori assumed relation to the filtration of the process we call these problems optimal stopp... | [['the', 'purpose', 'of', 'this', 'paper', 'is', 'twofold', 'we', 'extend', 'the', 'wellknown', 'relation', 'between', 'optimal', 'stopping', 'and', 'randomized', 'stopping', 'of', 'a', 'given', 'stochastic', 'process', 'to', 'a', 'situation', 'where', 'the', 'available', 'information', 'flow', 'is', 'a', 'filtration',... | [-0.090636768551395, 0.05072911539997399, -0.12000591996892364, 0.08661436117826615, -0.12661915739371846, -0.1539463152968844, 0.065548282863564, 0.35357333485663467, -0.39771658488738854, -0.2326149146929713, 0.17367508279188512, -0.2533877561944413, -0.1676884092044382, 0.13984350420007136, -0.15060269627390446, 0.0... |
1,802.06348 | Quantitative Predictions in Quantum Decision Theory | Quantum Decision Theory, advanced earlier by the authors, and illustrated for
lotteries with gains, is generalized to the games containing lotteries with
gains as well as losses. The mathematical structure of the approach is based on
the theory of quantum measurements, which makes this approach relevant both for
the ... | physics.soc-ph quant-ph | quantum decision theory advanced earlier by the authors and illustrated for lotteries with gains is generalized to the games containing lotteries with gains as well as losses the mathematical structure of the approach is based on the theory of quantum measurements which makes this approach relevant both for the descrip... | [['quantum', 'decision', 'theory', 'advanced', 'earlier', 'by', 'the', 'authors', 'and', 'illustrated', 'for', 'lotteries', 'with', 'gains', 'is', 'generalized', 'to', 'the', 'games', 'containing', 'lotteries', 'with', 'gains', 'as', 'well', 'as', 'losses', 'the', 'mathematical', 'structure', 'of', 'the', 'approach', '... | [-0.07022124625466487, 0.08154162226164323, -0.09456815999461177, 0.08699306875487421, -0.09408058151516512, -0.1690172785806849, 0.09716717888497645, 0.36055534823372226, -0.21079519507187752, -0.32833718587098254, 0.07521313771729093, -0.26680859214522773, -0.1748814680642322, 0.22063810958952448, -0.0749615824574397... |
1,802.06349 | Isotropic LQC and LQC--inspired Models with a massless scalar field as
Generalised Brans--Dicke theories | We explore whether generalised Brans -- Dicke theories, which have a scalar
field $\Phi$ and a function $\omega(\Phi)$, can be the effective actions
leading to the effective equations of motion of the LQC and the LQC--inspired
models, which have a massless scalar field $\sigma$ and a function $f(m) \;$.
We find that ... | gr-qc hep-th | we explore whether generalised brans dicke theories which have a scalar field phi and a function omegaphi can be the effective actions leading to the effective equations of motion of the lqc and the lqcinspired models which have a massless scalar field sigma and a function fm we find that this is possible for isotropic... | [['we', 'explore', 'whether', 'generalised', 'brans', 'dicke', 'theories', 'which', 'have', 'a', 'scalar', 'field', 'phi', 'and', 'a', 'function', 'omegaphi', 'can', 'be', 'the', 'effective', 'actions', 'leading', 'to', 'the', 'effective', 'equations', 'of', 'motion', 'of', 'the', 'lqc', 'and', 'the', 'lqcinspired', 'm... | [-0.12841399172179377, 0.17712490566909028, -0.11116496184085672, 0.11578891862410347, -0.08082715570737885, -0.18394609767238837, -0.023806981412014244, 0.3280845214235219, -0.21383183009645626, -0.26611593444957526, 0.03727365637314506, -0.2561869917097627, -0.1744319061210656, 0.1582029856886161, 0.00989000749698764... |
1,802.0635 | Spatial modelling with R-INLA: A review | Coming up with Bayesian models for spatial data is easy, but performing
inference with them can be challenging. Writing fast inference code for a
complex spatial model with realistically-sized datasets from scratch is
time-consuming, and if changes are made to the model, there is little guarantee
that the code perfor... | stat.ME stat.CO | coming up with bayesian models for spatial data is easy but performing inference with them can be challenging writing fast inference code for a complex spatial model with realisticallysized datasets from scratch is timeconsuming and if changes are made to the model there is little guarantee that the code performs well ... | [['coming', 'up', 'with', 'bayesian', 'models', 'for', 'spatial', 'data', 'is', 'easy', 'but', 'performing', 'inference', 'with', 'them', 'can', 'be', 'challenging', 'writing', 'fast', 'inference', 'code', 'for', 'a', 'complex', 'spatial', 'model', 'with', 'realisticallysized', 'datasets', 'from', 'scratch', 'is', 'tim... | [-0.02630898878350472, 0.07124321129887277, -0.06759632557065638, 0.092432619077268, -0.10147691562344305, -0.1863223670430283, -0.0167387278295374, 0.41447157429704884, -0.2958266100479809, -0.3317213376724451, 0.1347483521147028, -0.24115404998740472, -0.14027424915560108, 0.18923049253701676, -0.06327695479868438, 0... |
1,802.06351 | Mixing angle and decay constants of $J^P=1^+$ heavy-light mesons | The mass spectra, mixing angle and decay constants of the $J^P=1^+$
heavy-light mesons are systematically studied within the framework of the
Bethe-Salpeter equation (BSE). The full $1^+$ Salpeter wave function is given
for the first time. The mixing between the $1^{+-}$ and $1^{++}$ in the $1^+$
heavy-light systems ... | hep-ph hep-ex | the mass spectra mixing angle and decay constants of the jp1 heavylight mesons are systematically studied within the framework of the bethesalpeter equation bse the full 1 salpeter wave function is given for the first time the mixing between the 1 and 1 in the 1 heavylight systems are automatically determined by the dy... | [['the', 'mass', 'spectra', 'mixing', 'angle', 'and', 'decay', 'constants', 'of', 'the', 'jp1', 'heavylight', 'mesons', 'are', 'systematically', 'studied', 'within', 'the', 'framework', 'of', 'the', 'bethesalpeter', 'equation', 'bse', 'the', 'full', '1', 'salpeter', 'wave', 'function', 'is', 'given', 'for', 'the', 'fir... | [-0.10350598972494322, 0.250193563094722, -0.028110754040013897, 0.17120866527363576, -0.0187368332026679, -0.13162499396741145, 0.050458690369135285, 0.34957173712999445, -0.21981666446790668, -0.27345327026327776, 0.010079288855195045, -0.28479446090574634, -0.0458373908141801, 0.08674528077753678, 0.0692980806597717... |
1,802.06352 | Dynamic spin injection into a quantum well coupled to a spin-split bound
state | We present a theoretical analysis of dynamic spin injection due to
spin-dependent tunneling between a quantum well (QW) and a bound state split in
spin projection due to an exchange interaction or external magnetic field. We
focus on the impact of Coulomb correlations at the bound state on spin
polarization and sheet... | cond-mat.mes-hall | we present a theoretical analysis of dynamic spin injection due to spindependent tunneling between a quantum well qw and a bound state split in spin projection due to an exchange interaction or external magnetic field we focus on the impact of coulomb correlations at the bound state on spin polarization and sheet densi... | [['we', 'present', 'a', 'theoretical', 'analysis', 'of', 'dynamic', 'spin', 'injection', 'due', 'to', 'spindependent', 'tunneling', 'between', 'a', 'quantum', 'well', 'qw', 'and', 'a', 'bound', 'state', 'split', 'in', 'spin', 'projection', 'due', 'to', 'an', 'exchange', 'interaction', 'or', 'external', 'magnetic', 'fie... | [-0.15452734960143513, 0.22138698661388329, -0.080546448338976, 0.08447594087600514, -0.0037323371372643232, -0.1303375241120556, 0.06284112830961264, 0.3683226012296415, -0.2773727334099095, -0.3160021217927509, -0.027041334863429124, -0.2907554377354897, -0.09773333506481022, 0.18909431684821457, 0.08471981148811521,... |
1,802.06353 | On the well-posedness of a multiscale mathematical model for Lithium-ion
batteries | We consider the mathematical treatment of a system of nonlinear partial
differential equations based on a model, proposed in 1972 by J. Newman, in
which the coupling between the Lithium concentration, the phase potentials and
temperature in the electrodes and the electrolyte of a Lithium battery cell is
considered. A... | math.AP | we consider the mathematical treatment of a system of nonlinear partial differential equations based on a model proposed in 1972 by j newman in which the coupling between the lithium concentration the phase potentials and temperature in the electrodes and the electrolyte of a lithium battery cell is considered after in... | [['we', 'consider', 'the', 'mathematical', 'treatment', 'of', 'a', 'system', 'of', 'nonlinear', 'partial', 'differential', 'equations', 'based', 'on', 'a', 'model', 'proposed', 'in', '1972', 'by', 'j', 'newman', 'in', 'which', 'the', 'coupling', 'between', 'the', 'lithium', 'concentration', 'the', 'phase', 'potentials'... | [-0.11023988844979493, 0.04095594907278714, -0.05776867517804513, 0.026650557938589118, -0.029900657371846866, -0.10646845782786364, 0.07402826082266745, 0.31510019765739317, -0.23647449146498178, -0.2965814749801867, 0.10845336826903684, -0.24440912025614228, -0.16614892061601286, 0.1865487957457233, -0.07704304062406... |
1,802.06354 | K2SUPERSTAMP: The release of calibrated mosaics for the {\em Kepler/K2}
Mission | We describe the release of a new High Level Science Product (HLSP) available
at the MAST archive. The HLSP, called K2Superstamp, consists of a series of
FITS images for four open star clusters observed by the K2 Mission using
so-called "superstamp" pixel masks: M35, the $\sim$150 Myr old open cluster
observed during ... | astro-ph.IM | we describe the release of a new high level science product hlsp available at the mast archive the hlsp called k2superstamp consists of a series of fits images for four open star clusters observed by the k2 mission using socalled superstamp pixel masks m35 the sim150 myr old open cluster observed during k2 campaign 0 m... | [['we', 'describe', 'the', 'release', 'of', 'a', 'new', 'high', 'level', 'science', 'product', 'hlsp', 'available', 'at', 'the', 'mast', 'archive', 'the', 'hlsp', 'called', 'k2superstamp', 'consists', 'of', 'a', 'series', 'of', 'fits', 'images', 'for', 'four', 'open', 'star', 'clusters', 'observed', 'by', 'the', 'k2', ... | [-0.04802233926112773, 0.10168211096916452, -0.061685496354521724, 0.05209779583001724, -0.09478059998542845, -0.11317571363755327, 0.07253633250654122, 0.43561750319371423, -0.2017252394689782, -0.41276372105141385, 0.15516049595028716, -0.3015846635594199, -0.008440732156585829, 0.20198556970422257, -0.05720734016610... |
1,802.06355 | Stochastic Chebyshev Gradient Descent for Spectral Optimization | A large class of machine learning techniques requires the solution of
optimization problems involving spectral functions of parametric matrices, e.g.
log-determinant and nuclear norm. Unfortunately, computing the gradient of a
spectral function is generally of cubic complexity, as such gradient descent
methods are ra... | cs.LG cs.CC stat.ML | a large class of machine learning techniques requires the solution of optimization problems involving spectral functions of parametric matrices eg logdeterminant and nuclear norm unfortunately computing the gradient of a spectral function is generally of cubic complexity as such gradient descent methods are rather expe... | [['a', 'large', 'class', 'of', 'machine', 'learning', 'techniques', 'requires', 'the', 'solution', 'of', 'optimization', 'problems', 'involving', 'spectral', 'functions', 'of', 'parametric', 'matrices', 'eg', 'logdeterminant', 'and', 'nuclear', 'norm', 'unfortunately', 'computing', 'the', 'gradient', 'of', 'a', 'spectr... | [-0.054275631869925144, -0.009681669585799992, -0.1240469585682149, 0.11812925940327484, -0.09791018103962724, -0.11140005264995977, 0.03763908348752166, 0.42338221212675636, -0.30279617529719116, -0.27541587637623455, 0.1300084266453694, -0.21166372077146042, -0.17795744261511184, 0.22050421380690557, -0.0954832775477... |
1,802.06356 | Lamellar ordering, droplet formation and phase inversion in exotic
active emulsions | We study numerically the behaviour of a mixture of a passive isotropic fluid
and an active polar gel, in the presence of a surfactant favouring
emulsification. Focussing on parameters for which the underlying free energy
favours the lamellar phase in the passive limit, we show that the interplay
between nonequilibriu... | physics.bio-ph cond-mat.soft | we study numerically the behaviour of a mixture of a passive isotropic fluid and an active polar gel in the presence of a surfactant favouring emulsification focussing on parameters for which the underlying free energy favours the lamellar phase in the passive limit we show that the interplay between nonequilibrium and... | [['we', 'study', 'numerically', 'the', 'behaviour', 'of', 'a', 'mixture', 'of', 'a', 'passive', 'isotropic', 'fluid', 'and', 'an', 'active', 'polar', 'gel', 'in', 'the', 'presence', 'of', 'a', 'surfactant', 'favouring', 'emulsification', 'focussing', 'on', 'parameters', 'for', 'which', 'the', 'underlying', 'free', 'ene... | [-0.16176194727251475, 0.27787908025323294, -0.07742593016523819, 0.005661774065357621, -0.02932879776246362, -0.11913262611835615, 0.04969158464915712, 0.38756950712436206, -0.25175393916448796, -0.3096274264684467, 0.050108171586709264, -0.23215371106944785, -0.1631008576867836, 0.1309999313187338, -0.009297606104368... |
1,802.06357 | Convergence of Online Mirror Descent | In this paper we consider online mirror descent (OMD) algorithms, a class of
scalable online learning algorithms exploiting data geometric structures
through mirror maps. Necessary and sufficient conditions are presented in terms
of the step size sequence $\{\eta_t\}_{t}$ for the convergence of an OMD
algorithm with ... | cs.LG cs.AI math.OC stat.ML | in this paper we consider online mirror descent omd algorithms a class of scalable online learning algorithms exploiting data geometric structures through mirror maps necessary and sufficient conditions are presented in terms of the step size sequence eta_t_t for the convergence of an omd algorithm with respect to the ... | [['in', 'this', 'paper', 'we', 'consider', 'online', 'mirror', 'descent', 'omd', 'algorithms', 'a', 'class', 'of', 'scalable', 'online', 'learning', 'algorithms', 'exploiting', 'data', 'geometric', 'structures', 'through', 'mirror', 'maps', 'necessary', 'and', 'sufficient', 'conditions', 'are', 'presented', 'in', 'term... | [-0.10247825095555871, 0.03243553856274859, -0.10141176668725707, 0.08125693382021996, -0.03129174086781269, -0.13602430085538308, 0.049324869971904856, 0.41978464351111167, -0.3023438549071953, -0.28875100249747077, 0.15280787010733793, -0.20211653820415204, -0.17056341397511535, 0.19484666994193922, -0.14011653794000... |
1,802.06358 | Comments on $^"$Cosmic evolution in Brans-Dicke chameleon cosmology$^"$ | The authors of Ref. \cite{1-2}, investigated cosmic evolution in an external
interacting model of scalar tensor gravity namely Brans Dicke chameleon
scenario. The procedure of this work contains novelties but, it shall be
observed from this comment, their report faces three fundamental drawbacks. One
of them concerns... | gr-qc | the authors of ref cite12 investigated cosmic evolution in an external interacting model of scalar tensor gravity namely brans dicke chameleon scenario the procedure of this work contains novelties but it shall be observed from this comment their report faces three fundamental drawbacks one of them concerns the energy ... | [['the', 'authors', 'of', 'ref', 'cite12', 'investigated', 'cosmic', 'evolution', 'in', 'an', 'external', 'interacting', 'model', 'of', 'scalar', 'tensor', 'gravity', 'namely', 'brans', 'dicke', 'chameleon', 'scenario', 'the', 'procedure', 'of', 'this', 'work', 'contains', 'novelties', 'but', 'it', 'shall', 'be', 'obse... | [-0.107071378918749, 0.08981760432594918, -0.10004311050741105, 0.07710476083097063, -0.13961960265915546, -0.19779720647437943, -0.040467288731301704, 0.27740593041692463, -0.22102379108158252, -0.35388762768476256, 0.04394470784159023, -0.28115154240309953, -0.14888802127883075, 0.1398139881609481, -0.079216123216726... |
1,802.06359 | Geostatistical methods for disease mapping and visualization using data
from spatio-temporally referenced prevalence surveys | In this paper we set out general principles and develop geostatistical
methods for the analysis of data from spatio-temporally referenced prevalence
surveys. Our objective is to provide a tutorial guide that can be used in order
to identify parsimonious geostatistical models for prevalence mapping. A
general variogra... | stat.ME | in this paper we set out general principles and develop geostatistical methods for the analysis of data from spatiotemporally referenced prevalence surveys our objective is to provide a tutorial guide that can be used in order to identify parsimonious geostatistical models for prevalence mapping a general variogrambase... | [['in', 'this', 'paper', 'we', 'set', 'out', 'general', 'principles', 'and', 'develop', 'geostatistical', 'methods', 'for', 'the', 'analysis', 'of', 'data', 'from', 'spatiotemporally', 'referenced', 'prevalence', 'surveys', 'our', 'objective', 'is', 'to', 'provide', 'a', 'tutorial', 'guide', 'that', 'can', 'be', 'used'... | [-0.006148664963605939, 0.00688921653589694, -0.11718044795466272, 0.15078993350926417, -0.11166938492342045, -0.10886886923938816, 0.05919048217961249, 0.4072526290479024, -0.24610657824750728, -0.301368439499267, 0.1253833097539507, -0.255392943261115, -0.18403674763414943, 0.21568521387379463, -0.09842619483293802, ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.