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.0886 | Cohomologies of coherent sheaves and massless spectra in F-theory | In this PhD thesis we investigate the significance of Chow groups for zero
mode counting and anomaly cancellation in F-theory vacua.
The major part of this thesis focuses on zero mode counting. We explain that
elements of Chow group describe a subset of gauge backgrounds and give rise to
a line bundle on each matter curve. The sheaf cohomologies of these line
bundles are found to encode the chiral and anti-chiral localised zero modes in
this compactification. Therefore, it is of prime interest to compute these
sheaf cohomologies. Unfortunately, the line bundles in question are in general
non-pullback line bundles. In particular, this is the case for the hypercharge
flux employed in F-theory models of grand unified theories (GUTs).
Consequently, existing methods, such as the cohomCalg-algorithm, cannot be
applied. In collaboration with the mathematician Mohamed Barakat, we have
therefore implemented algorithms which determine the sheaf cohomologies of all
coherent sheaves on toric varieties. These algorithms are provided by the
gap-package SheafCohomologiesOnToricVarieties which extends the homalg-project
of Mohamed Barakat. We exemplify these algorithms in explicit (toy-)models of
F-theory GUTs.
As a spin-off of this analysis, we proved that in an entire class of F-theory
vacua, the matter surface fluxes satisfy a number of relations in the Chow
ring, which we related to anomaly cancellation. Based on this evidence we
conjecture that the well-known anomaly cancellation conditions in F-theory -
typically phrased as intersections in the cohomology ring - can be extended
even to relations in the Chow ring.
| hep-th | in this phd thesis we investigate the significance of chow groups for zero mode counting and anomaly cancellation in ftheory vacua the major part of this thesis focuses on zero mode counting we explain that elements of chow group describe a subset of gauge backgrounds and give rise to a line bundle on each matter curve the sheaf cohomologies of these line bundles are found to encode the chiral and antichiral localised zero modes in this compactification therefore it is of prime interest to compute these sheaf cohomologies unfortunately the line bundles in question are in general nonpullback line bundles in particular this is the case for the hypercharge flux employed in ftheory models of grand unified theories guts consequently existing methods such as the cohomcalgalgorithm cannot be applied in collaboration with the mathematician mohamed barakat we have therefore implemented algorithms which determine the sheaf cohomologies of all coherent sheaves on toric varieties these algorithms are provided by the gappackage sheafcohomologiesontoricvarieties which extends the homalgproject of mohamed barakat we exemplify these algorithms in explicit toymodels of ftheory guts as a spinoff of this analysis we proved that in an entire class of ftheory vacua the matter surface fluxes satisfy a number of relations in the chow ring which we related to anomaly cancellation based on this evidence we conjecture that the wellknown anomaly cancellation conditions in ftheory typically phrased as intersections in the cohomology ring can be extended even to relations in the chow ring | [['in', 'this', 'phd', 'thesis', 'we', 'investigate', 'the', 'significance', 'of', 'chow', 'groups', 'for', 'zero', 'mode', 'counting', 'and', 'anomaly', 'cancellation', 'in', 'ftheory', 'vacua', 'the', 'major', 'part', 'of', 'this', 'thesis', 'focuses', 'on', 'zero', 'mode', 'counting', 'we', 'explain', 'that', 'elements', 'of', 'chow', 'group', 'describe', 'a', 'subset', 'of', 'gauge', 'backgrounds', 'and', 'give', 'rise', 'to', 'a', 'line', 'bundle', 'on', 'each', 'matter', 'curve', 'the', 'sheaf', 'cohomologies', 'of', 'these', 'line', 'bundles', 'are', 'found', 'to', 'encode', 'the', 'chiral', 'and', 'antichiral', 'localised', 'zero', 'modes', 'in', 'this', 'compactification', 'therefore', 'it', 'is', 'of', 'prime', 'interest', 'to', 'compute', 'these', 'sheaf', 'cohomologies', 'unfortunately', 'the', 'line', 'bundles', 'in', 'question', 'are', 'in', 'general', 'nonpullback', 'line', 'bundles', 'in', 'particular', 'this', 'is', 'the', 'case', 'for', 'the', 'hypercharge', 'flux', 'employed', 'in', 'ftheory', 'models', 'of', 'grand', 'unified', 'theories', 'guts', 'consequently', 'existing', 'methods', 'such', 'as', 'the', 'cohomcalgalgorithm', 'can', 'not', 'be', 'applied', 'in', 'collaboration', 'with', 'the', 'mathematician', 'mohamed', 'barakat', 'we', 'have', 'therefore', 'implemented', 'algorithms', 'which', 'determine', 'the', 'sheaf', 'cohomologies', 'of', 'all', 'coherent', 'sheaves', 'on', 'toric', 'varieties', 'these', 'algorithms', 'are', 'provided', 'by', 'the', 'gappackage', 'sheafcohomologiesontoricvarieties', 'which', 'extends', 'the', 'homalgproject', 'of', 'mohamed', 'barakat', 'we', 'exemplify', 'these', 'algorithms', 'in', 'explicit', 'toymodels', 'of', 'ftheory', 'guts', 'as', 'a', 'spinoff', 'of', 'this', 'analysis', 'we', 'proved', 'that', 'in', 'an', 'entire', 'class', 'of', 'ftheory', 'vacua', 'the', 'matter', 'surface', 'fluxes', 'satisfy', 'a', 'number', 'of', 'relations', 'in', 'the', 'chow', 'ring', 'which', 'we', 'related', 'to', 'anomaly', 'cancellation', 'based', 'on', 'this', 'evidence', 'we', 'conjecture', 'that', 'the', 'wellknown', 'anomaly', 'cancellation', 'conditions', 'in', 'ftheory', 'typically', 'phrased', 'as', 'intersections', 'in', 'the', 'cohomology', 'ring', 'can', 'be', 'extended', 'even', 'to', 'relations', 'in', 'the', 'chow', 'ring']] | [-0.18814964341656673, 0.04613509691781432, -0.09535940779837745, 0.12268183870952097, -0.0922445993410632, -0.1383330124890223, -0.010475039694659195, 0.33857051246022785, -0.2234928401503944, -0.25883032395349836, 0.09891341516122036, -0.20434724890696526, -0.15957582073239804, 0.15655000743174083, -0.16867192013042348, -0.014927728311255327, -0.010554752515482086, 0.04308207617411815, -0.053294907099518084, -0.31525595750344754, 0.38616453844346726, 0.011954638422988509, 0.2914241384734164, 0.07903288339778658, 0.06343424484597208, -0.04300687745159407, -0.026371415310319033, -0.030344839254200954, -0.11832078884659926, 0.1329872545079015, 0.3583095100989472, 0.07024166741914645, 0.12825076168024319, -0.4400136266599305, -0.1605936014644137, 0.19034570404347728, 0.16752032046044474, 0.08609621626898817, -0.0032739832763525336, -0.2525840408016089, 0.08813174481453429, -0.17693573261487502, -0.11393850231475557, -0.09407309962521573, -0.011587907579491743, -0.013160047670092078, -0.20496803000028327, -0.01360187387862919, 0.03296440122533141, 0.11867969413384548, -0.05148478185794707, -0.0955030299540555, -0.04233238905092462, 0.045289859061682, 0.09063916157591022, 0.012260489449816992, 0.13386048986074126, -0.14262394412397503, -0.1560793155205293, 0.36657553174266305, -0.06709188274474992, -0.18875379454444985, 0.11178723416562653, -0.12586727971983958, -0.2231651442666457, 0.1407815584588286, 0.10278158351639866, 0.16913726983236388, -0.042186604507452964, 0.16034055227549993, -0.10318868588733475, 0.07269142137181508, 0.07954463258258133, 0.02262481014438445, 0.22973377343375406, 0.09501210583617362, 0.04911370153760603, 0.06998440689654611, -0.023720910504104808, -0.0670336480812784, -0.3982909933714142, -0.17937075162327681, -0.09387786820636197, 0.11645667962165969, -0.03620582969099161, -0.14598833262863378, 0.411758156010255, 0.13233638749577692, 0.2015241128643704, 0.06665594420971588, 0.22861117517084842, 0.05479014140246552, 0.10038589129293979, 0.018220609804630836, 0.22917748836093269, 0.19537012815123803, 0.030753577053994934, -0.16432372285091779, -0.07448547164990695, 0.18928884823238515] |
1,802.08861 | Polar flock in the presence of random quenched rotators | We study a collection of polar self-propelled particles (SPPs) on a
two-dimensional substrate in the presence of random quenched rotators. These
rotators act like obstacles which rotate the orientation of the SPPs by an
angle determined by their intrinsic orientations. In the zero self-propulsion
limit, our model reduces to the equilibrium $XY$ model with quenched disorder,
while for the clean system, it is similar to the Vicsek model for polar flock.
We note that a small amount of the quenched rotators destroys the long-range
order usually noted in the clean SPPs. The system shows a quasi-long range
order state upto some moderate density of the rotators. On further increment in
the density of rotators, the system shows a continuous transition from the
quasi-long-range order to disorder state at some critical density of rotators.
Our linearized hydrodynamic calculation predicts anisotropic higher order
fluctuation in two-point structure factors for density and velocity fields of
the SPPs. We argue that nonlinear terms probably suppress this fluctuation such
that no long-range order but only a quasi-long-range order prevails in the
system.
| cond-mat.stat-mech cond-mat.soft | we study a collection of polar selfpropelled particles spps on a twodimensional substrate in the presence of random quenched rotators these rotators act like obstacles which rotate the orientation of the spps by an angle determined by their intrinsic orientations in the zero selfpropulsion limit our model reduces to the equilibrium xy model with quenched disorder while for the clean system it is similar to the vicsek model for polar flock we note that a small amount of the quenched rotators destroys the longrange order usually noted in the clean spps the system shows a quasilong range order state upto some moderate density of the rotators on further increment in the density of rotators the system shows a continuous transition from the quasilongrange order to disorder state at some critical density of rotators our linearized hydrodynamic calculation predicts anisotropic higher order fluctuation in twopoint structure factors for density and velocity fields of the spps we argue that nonlinear terms probably suppress this fluctuation such that no longrange order but only a quasilongrange order prevails in the system | [['we', 'study', 'a', 'collection', 'of', 'polar', 'selfpropelled', 'particles', 'spps', 'on', 'a', 'twodimensional', 'substrate', 'in', 'the', 'presence', 'of', 'random', 'quenched', 'rotators', 'these', 'rotators', 'act', 'like', 'obstacles', 'which', 'rotate', 'the', 'orientation', 'of', 'the', 'spps', 'by', 'an', 'angle', 'determined', 'by', 'their', 'intrinsic', 'orientations', 'in', 'the', 'zero', 'selfpropulsion', 'limit', 'our', 'model', 'reduces', 'to', 'the', 'equilibrium', 'xy', 'model', 'with', 'quenched', 'disorder', 'while', 'for', 'the', 'clean', 'system', 'it', 'is', 'similar', 'to', 'the', 'vicsek', 'model', 'for', 'polar', 'flock', 'we', 'note', 'that', 'a', 'small', 'amount', 'of', 'the', 'quenched', 'rotators', 'destroys', 'the', 'longrange', 'order', 'usually', 'noted', 'in', 'the', 'clean', 'spps', 'the', 'system', 'shows', 'a', 'quasilong', 'range', 'order', 'state', 'upto', 'some', 'moderate', 'density', 'of', 'the', 'rotators', 'on', 'further', 'increment', 'in', 'the', 'density', 'of', 'rotators', 'the', 'system', 'shows', 'a', 'continuous', 'transition', 'from', 'the', 'quasilongrange', 'order', 'to', 'disorder', 'state', 'at', 'some', 'critical', 'density', 'of', 'rotators', 'our', 'linearized', 'hydrodynamic', 'calculation', 'predicts', 'anisotropic', 'higher', 'order', 'fluctuation', 'in', 'twopoint', 'structure', 'factors', 'for', 'density', 'and', 'velocity', 'fields', 'of', 'the', 'spps', 'we', 'argue', 'that', 'nonlinear', 'terms', 'probably', 'suppress', 'this', 'fluctuation', 'such', 'that', 'no', 'longrange', 'order', 'but', 'only', 'a', 'quasilongrange', 'order', 'prevails', 'in', 'the', 'system']] | [-0.17600040002936487, 0.22263365507326127, -0.07050753144894616, 0.0583839969864736, -0.010259463617546578, -0.08808539746497564, 0.02723194600877452, 0.36409118145935787, -0.23752959758190617, -0.2712708187873586, 0.02340681601636701, -0.2969747190179545, -0.13125286976370099, 0.12362249418277567, 0.01274959827736441, 0.02438656637434569, -0.01933307200209843, 0.007124424990961107, -0.06463781418410357, -0.22079256591965882, 0.27107688748293507, 0.007555918479969693, 0.2857420032970228, -0.008745675888122981, 0.08891002584701288, 0.011631335037113246, 0.05418912856675169, 0.046280960812849006, -0.13206428912593055, 0.04105476281831914, 0.18253748748177862, -0.0695768634625579, 0.22230650290010212, -0.3992794902500628, -0.2127999524706922, 0.08470254438392566, 0.17039791576690594, 0.16889552249096987, -0.04622162958228235, -0.27322368292758864, 0.05633054819351192, -0.1772728143641357, -0.19744226287545288, -0.07137742272372972, 0.03377520040698392, 0.04613000479504455, -0.25594755817016607, 0.13969840010230844, 0.1598926261047659, 0.08551835701248403, -0.041239531051714795, -0.06196286042298501, -0.07023815111136117, 0.09241158811186077, 0.06949088032394227, 0.052590310720905746, 0.14984944067095632, -0.1708400821784185, -0.042848799184312, 0.3884923902680929, -0.08299053997711651, -0.16411985740335894, 0.23117033027554468, -0.21765578330999588, -0.09410792976712525, 0.1840421114916687, 0.18212804398078491, 0.09087894301950973, -0.10201669959015987, 0.027441252027914496, -0.010379581049210945, 0.22436968658624565, 0.019219072388306176, 0.0324127064527165, 0.22281387263361765, 0.14581981767626678, 0.08743793582859433, 0.14371833805847217, -0.09504632479895964, -0.11014026215978724, -0.2680860028633753, -0.13638189553656738, -0.20631717109926423, 0.02046871184513478, -0.13146148864592566, -0.18422838017715426, 0.38250348822208446, 0.1698795196226677, 0.17754822118092053, 0.056614841129972816, 0.2514547967551918, 0.11581343606424828, 0.08050465202721961, 0.08953363981918763, 0.2788116267996072, 0.15490365636371875, 0.10867495958609139, -0.2752639133467386, 0.08477795731781398, 0.029513367070253455] |
1,802.08862 | Classifying surface probe images in strongly correlated electronic
systems via machine learning | Scanning probe experiments such as scanning tunneling microscopy (STM) and
atomic force microscopy (AFM) on strongly correlated electronic systems often
reveal complex pattern formation on multiple length scales. By studying the
universal scaling in these images, we have shown in several distinct correlated
electronic systems that the pattern formation is driven by proximity to a
disorder-driven critical point, revealing a unification of the pattern
formation in these materials. As an alternative approach to this image
classification problem of novel materials, here we report the first
investigation of the machine learning method to determine which underlying
physical model is driving pattern formation in a system. Using a neural network
architecture, we are able to achieve 97% accuracy on classifying configuration
images from three models with Ising symmetry. This investigation also
demonstrates that machine learning can capture the implicit universal behavior
of a physical system. This broadens our understanding of what machine learning
can do, and we expect more synergy between machine learning and condensed
matter physics in the future.
| cond-mat.str-el cond-mat.dis-nn cond-mat.stat-mech | scanning probe experiments such as scanning tunneling microscopy stm and atomic force microscopy afm on strongly correlated electronic systems often reveal complex pattern formation on multiple length scales by studying the universal scaling in these images we have shown in several distinct correlated electronic systems that the pattern formation is driven by proximity to a disorderdriven critical point revealing a unification of the pattern formation in these materials as an alternative approach to this image classification problem of novel materials here we report the first investigation of the machine learning method to determine which underlying physical model is driving pattern formation in a system using a neural network architecture we are able to achieve 97 accuracy on classifying configuration images from three models with ising symmetry this investigation also demonstrates that machine learning can capture the implicit universal behavior of a physical system this broadens our understanding of what machine learning can do and we expect more synergy between machine learning and condensed matter physics in the future | [['scanning', 'probe', 'experiments', 'such', 'as', 'scanning', 'tunneling', 'microscopy', 'stm', 'and', 'atomic', 'force', 'microscopy', 'afm', 'on', 'strongly', 'correlated', 'electronic', 'systems', 'often', 'reveal', 'complex', 'pattern', 'formation', 'on', 'multiple', 'length', 'scales', 'by', 'studying', 'the', 'universal', 'scaling', 'in', 'these', 'images', 'we', 'have', 'shown', 'in', 'several', 'distinct', 'correlated', 'electronic', 'systems', 'that', 'the', 'pattern', 'formation', 'is', 'driven', 'by', 'proximity', 'to', 'a', 'disorderdriven', 'critical', 'point', 'revealing', 'a', 'unification', 'of', 'the', 'pattern', 'formation', 'in', 'these', 'materials', 'as', 'an', 'alternative', 'approach', 'to', 'this', 'image', 'classification', 'problem', 'of', 'novel', 'materials', 'here', 'we', 'report', 'the', 'first', 'investigation', 'of', 'the', 'machine', 'learning', 'method', 'to', 'determine', 'which', 'underlying', 'physical', 'model', 'is', 'driving', 'pattern', 'formation', 'in', 'a', 'system', 'using', 'a', 'neural', 'network', 'architecture', 'we', 'are', 'able', 'to', 'achieve', '97', 'accuracy', 'on', 'classifying', 'configuration', 'images', 'from', 'three', 'models', 'with', 'ising', 'symmetry', 'this', 'investigation', 'also', 'demonstrates', 'that', 'machine', 'learning', 'can', 'capture', 'the', 'implicit', 'universal', 'behavior', 'of', 'a', 'physical', 'system', 'this', 'broadens', 'our', 'understanding', 'of', 'what', 'machine', 'learning', 'can', 'do', 'and', 'we', 'expect', 'more', 'synergy', 'between', 'machine', 'learning', 'and', 'condensed', 'matter', 'physics', 'in', 'the', 'future']] | [-0.1192717613926756, 0.0962933239540386, -0.12152027834894225, 0.08313610184580154, -0.0683080993836657, -0.16895884624682367, 0.03473820435673198, 0.4156928596397241, -0.3099791431561157, -0.3342226574646442, 0.028890771336071857, -0.265721714775455, -0.2323573723690407, 0.2146307387426662, -0.022738313041849152, 0.06677273288923538, 0.012878051154465149, -0.015223088905692012, -0.07070540918946444, -0.2198300213884154, 0.31804503506420934, 0.05017099500123766, 0.3496580439525479, 0.05258985008168522, 0.06744803506271205, -0.01336574166669466, 0.023827822066821335, 0.006173967144734759, -0.1147491368093532, 0.13853167891543958, 0.28427120991816646, 0.09501528833200046, 0.26502030315099373, -0.43381541052145794, -0.2590474907497299, 0.056178205501055345, 0.18440682541057912, 0.13064684596126122, -0.07856128550624167, -0.29131207642855034, 0.055842884562956725, -0.12946415351082882, -0.05690326882038443, -0.16074154525579484, -0.01925246812641576, 0.0008179782460155409, -0.20794074395408166, 0.043516393825571174, 0.05436750046889453, 0.110847308361415, -0.08592025282476763, -0.028487166967741877, 0.03612548686214723, 0.10930890824861958, -0.008639910081650928, 0.06299990280171014, 0.18922612432825622, -0.18718806922663048, -0.17088159702030853, 0.3868562539906374, -0.01860100073861845, -0.12911242018232033, 0.25904592134923277, -0.1336601192569582, -0.15213017536249632, 0.08717343452874393, 0.1939998624030046, 0.08810165280331039, -0.16517771048183066, 0.0020496663322167783, -0.04110824992226082, 0.21527582583924718, 0.029141802253434435, 0.037383167419604776, 0.26037235636197564, 0.2826185654433045, 0.021761289323746626, 0.10380327906126954, -0.12207672179266367, -0.09455916901961678, -0.21232027511169213, -0.1307473955454216, -0.1884291870921429, 0.04679774266523531, -0.05615445060270542, -0.15624311252499215, 0.382137402110467, 0.22628379323785858, 0.21993399402570157, -0.010140431038009757, 0.2998197261532325, 0.04064670126050866, 0.08545360764643799, 0.010176195580113147, 0.21121487257603025, 0.0723898156602878, 0.1130496765032322, -0.2527488553217457, 0.07730675907528382, 0.02832805061258287] |
1,802.08863 | Efficiency Limits of Solar Energy Harvesting via Internal Photoemission
in Carbon Materials | We describe strategies to estimate the upper limits of the efficiency of
photon energy harvesting via hot electron extraction from gapless absorbers.
Gapless materials such as noble metals can be used for harvesting the whole
solar spectrum, including visible and near-infrared light. The energy of
photo-generated non-equilibrium or hot charge carriers can be harvested before
they thermalize with the crystal lattice via the process of their internal
photo-emission (IPE) through the rectifying Schottky junction with a
semiconductor. However, the low efficiency and the high cost of noble metals
necessitates the search for cheaper abundant alternative materials, and we show
here that carbon can serve as a promising IPE material candidate. We compare
the upper limits of performance of IPE photon energy-harvesting platforms,
which incorporate either gold or carbon as the photoactive material where hot
electrons are generated. Through a combination of density functional theory,
joint electron density of states calculations, and Schottky diode efficiency
modeling, we show that the material electron band structure imposes a strict
upper limit on the achievable efficiency of the IPE devices. Our calculations
reveal that graphite is a good material candidate for the IPE absorber for
harvesting visible and near-infrared photons. Graphite electron density of
states yields a sizeable population of hot electrons with energies high enough
to be collected across the potential barrier. We also discuss the mechanisms
that prevent the IPE device efficiency from reaching the upper limits imposed
by their material electron band structures. The proposed approach is general
and allows for efficient pre-screening of materials for their potential use in
IPE energy converters and photodetectors within application-specific spectral
windows.
| cond-mat.mtrl-sci cond-mat.mes-hall physics.app-ph physics.comp-ph physics.optics | we describe strategies to estimate the upper limits of the efficiency of photon energy harvesting via hot electron extraction from gapless absorbers gapless materials such as noble metals can be used for harvesting the whole solar spectrum including visible and nearinfrared light the energy of photogenerated nonequilibrium or hot charge carriers can be harvested before they thermalize with the crystal lattice via the process of their internal photoemission ipe through the rectifying schottky junction with a semiconductor however the low efficiency and the high cost of noble metals necessitates the search for cheaper abundant alternative materials and we show here that carbon can serve as a promising ipe material candidate we compare the upper limits of performance of ipe photon energyharvesting platforms which incorporate either gold or carbon as the photoactive material where hot electrons are generated through a combination of density functional theory joint electron density of states calculations and schottky diode efficiency modeling we show that the material electron band structure imposes a strict upper limit on the achievable efficiency of the ipe devices our calculations reveal that graphite is a good material candidate for the ipe absorber for harvesting visible and nearinfrared photons graphite electron density of states yields a sizeable population of hot electrons with energies high enough to be collected across the potential barrier we also discuss the mechanisms that prevent the ipe device efficiency from reaching the upper limits imposed by their material electron band structures the proposed approach is general and allows for efficient prescreening of materials for their potential use in ipe energy converters and photodetectors within applicationspecific spectral windows | [['we', 'describe', 'strategies', 'to', 'estimate', 'the', 'upper', 'limits', 'of', 'the', 'efficiency', 'of', 'photon', 'energy', 'harvesting', 'via', 'hot', 'electron', 'extraction', 'from', 'gapless', 'absorbers', 'gapless', 'materials', 'such', 'as', 'noble', 'metals', 'can', 'be', 'used', 'for', 'harvesting', 'the', 'whole', 'solar', 'spectrum', 'including', 'visible', 'and', 'nearinfrared', 'light', 'the', 'energy', 'of', 'photogenerated', 'nonequilibrium', 'or', 'hot', 'charge', 'carriers', 'can', 'be', 'harvested', 'before', 'they', 'thermalize', 'with', 'the', 'crystal', 'lattice', 'via', 'the', 'process', 'of', 'their', 'internal', 'photoemission', 'ipe', 'through', 'the', 'rectifying', 'schottky', 'junction', 'with', 'a', 'semiconductor', 'however', 'the', 'low', 'efficiency', 'and', 'the', 'high', 'cost', 'of', 'noble', 'metals', 'necessitates', 'the', 'search', 'for', 'cheaper', 'abundant', 'alternative', 'materials', 'and', 'we', 'show', 'here', 'that', 'carbon', 'can', 'serve', 'as', 'a', 'promising', 'ipe', 'material', 'candidate', 'we', 'compare', 'the', 'upper', 'limits', 'of', 'performance', 'of', 'ipe', 'photon', 'energyharvesting', 'platforms', 'which', 'incorporate', 'either', 'gold', 'or', 'carbon', 'as', 'the', 'photoactive', 'material', 'where', 'hot', 'electrons', 'are', 'generated', 'through', 'a', 'combination', 'of', 'density', 'functional', 'theory', 'joint', 'electron', 'density', 'of', 'states', 'calculations', 'and', 'schottky', 'diode', 'efficiency', 'modeling', 'we', 'show', 'that', 'the', 'material', 'electron', 'band', 'structure', 'imposes', 'a', 'strict', 'upper', 'limit', 'on', 'the', 'achievable', 'efficiency', 'of', 'the', 'ipe', 'devices', 'our', 'calculations', 'reveal', 'that', 'graphite', 'is', 'a', 'good', 'material', 'candidate', 'for', 'the', 'ipe', 'absorber', 'for', 'harvesting', 'visible', 'and', 'nearinfrared', 'photons', 'graphite', 'electron', 'density', 'of', 'states', 'yields', 'a', 'sizeable', 'population', 'of', 'hot', 'electrons', 'with', 'energies', 'high', 'enough', 'to', 'be', 'collected', 'across', 'the', 'potential', 'barrier', 'we', 'also', 'discuss', 'the', 'mechanisms', 'that', 'prevent', 'the', 'ipe', 'device', 'efficiency', 'from', 'reaching', 'the', 'upper', 'limits', 'imposed', 'by', 'their', 'material', 'electron', 'band', 'structures', 'the', 'proposed', 'approach', 'is', 'general', 'and', 'allows', 'for', 'efficient', 'prescreening', 'of', 'materials', 'for', 'their', 'potential', 'use', 'in', 'ipe', 'energy', 'converters', 'and', 'photodetectors', 'within', 'applicationspecific', 'spectral', 'windows']] | [-0.08950386323410942, 0.15022034109431082, -0.04936380961253099, 0.03610225746223844, -0.03080846101598147, -0.16171912389890805, 0.14289648113068568, 0.42646993332500777, -0.23654570399415192, -0.3528812205690001, 0.02406425158269078, -0.32117293702197175, -0.06903664173481033, 0.23609297034772, -0.009808339382723363, 0.04646827875108305, 0.046064726452329265, -0.07380836218362674, -0.04003322278753222, -0.14855986195511628, 0.2390427144544908, 0.1199937110745918, 0.32042317085294747, 0.134874871989309, 0.076515181737786, -0.01867018393266932, 0.056069430858661326, -0.03951467781279014, -0.11202325725742467, 0.12482765082525325, 0.2779813529298043, 0.006001674476315949, 0.203336874018736, -0.4955745714007696, -0.2638857278298698, 0.04203568598422319, 0.133624669518009, 0.07115695354269831, -0.12698941285341436, -0.2200805857211157, 0.06862502910697194, -0.1781858904678166, -0.11196789064755404, -0.03786831415595431, -0.05258091155495217, 0.05598794512664413, -0.23951213918721873, 0.05803524735007946, -0.004091561832743239, -0.004148083212996099, -0.09676151356585767, -0.117668868019289, -0.10374223091465824, 0.06798683712953951, -0.0003428489280171317, -0.05973662292834983, 0.23854309269366092, -0.13615688727321554, -0.09035278258692306, 0.38867001706011484, -0.07808913701689983, -0.08495175696165759, 0.20009747745361484, -0.1357408958754794, -0.035412657584816064, 0.1840406819316211, 0.15932035974184322, 0.11739759991178289, -0.15721846178001134, 0.08321069564603863, 0.005383153195378246, 0.15508250451695396, 0.05552238825215166, 0.1626253321537932, 0.2758339632957576, 0.21319279124710097, 0.04349319116427883, 0.11289844874669659, -0.1586336427230958, 0.01593076647433049, -0.2257563064757512, -0.21968114882387887, -0.22628862649435177, 0.0749577121429472, -0.06743633091987725, -0.15577113000787238, 0.391445270252984, 0.14239913707168134, 0.1430344028127338, -0.03805955272020664, 0.3240142872021881, 0.13273524286298416, 0.07836671531766848, 0.0471353341352695, 0.2669030856975326, 0.11925404874256937, 0.10002554449732345, -0.22893910746110965, 0.048034150262863666, -0.025344332957678517] |
1,802.08864 | One Big Net For Everything | I apply recent work on "learning to think" (2015) and on PowerPlay (2011) to
the incremental training of an increasingly general problem solver, continually
learning to solve new tasks without forgetting previous skills. The problem
solver is a single recurrent neural network (or similar general purpose
computer) called ONE. ONE is unusual in the sense that it is trained in various
ways, e.g., by black box optimization / reinforcement learning / artificial
evolution as well as supervised / unsupervised learning. For example, ONE may
learn through neuroevolution to control a robot through environment-changing
actions, and learn through unsupervised gradient descent to predict future
inputs and vector-valued reward signals as suggested in 1990. User-given tasks
can be defined through extra goal-defining input patterns, also proposed in
1990. Suppose ONE has already learned many skills. Now a copy of ONE can be
re-trained to learn a new skill, e.g., through neuroevolution without a
teacher. Here it may profit from re-using previously learned subroutines, but
it may also forget previous skills. Then ONE is retrained in PowerPlay style
(2011) on stored input/output traces of (a) ONE's copy executing the new skill
and (b) previous instances of ONE whose skills are still considered worth
memorizing. Simultaneously, ONE is retrained on old traces (even those of
unsuccessful trials) to become a better predictor, without additional expensive
interaction with the enviroment. More and more control and prediction skills
are thus collapsed into ONE, like in the chunker-automatizer system of the
neural history compressor (1991). This forces ONE to relate partially analogous
skills (with shared algorithmic information) to each other, creating common
subroutines in form of shared subnetworks of ONE, to greatly speed up
subsequent learning of additional, novel but algorithmically related skills.
| cs.AI | i apply recent work on learning to think 2015 and on powerplay 2011 to the incremental training of an increasingly general problem solver continually learning to solve new tasks without forgetting previous skills the problem solver is a single recurrent neural network or similar general purpose computer called one one is unusual in the sense that it is trained in various ways eg by black box optimization reinforcement learning artificial evolution as well as supervised unsupervised learning for example one may learn through neuroevolution to control a robot through environmentchanging actions and learn through unsupervised gradient descent to predict future inputs and vectorvalued reward signals as suggested in 1990 usergiven tasks can be defined through extra goaldefining input patterns also proposed in 1990 suppose one has already learned many skills now a copy of one can be retrained to learn a new skill eg through neuroevolution without a teacher here it may profit from reusing previously learned subroutines but it may also forget previous skills then one is retrained in powerplay style 2011 on stored inputoutput traces of a ones copy executing the new skill and b previous instances of one whose skills are still considered worth memorizing simultaneously one is retrained on old traces even those of unsuccessful trials to become a better predictor without additional expensive interaction with the enviroment more and more control and prediction skills are thus collapsed into one like in the chunkerautomatizer system of the neural history compressor 1991 this forces one to relate partially analogous skills with shared algorithmic information to each other creating common subroutines in form of shared subnetworks of one to greatly speed up subsequent learning of additional novel but algorithmically related skills | [['i', 'apply', 'recent', 'work', 'on', 'learning', 'to', 'think', '2015', 'and', 'on', 'powerplay', '2011', 'to', 'the', 'incremental', 'training', 'of', 'an', 'increasingly', 'general', 'problem', 'solver', 'continually', 'learning', 'to', 'solve', 'new', 'tasks', 'without', 'forgetting', 'previous', 'skills', 'the', 'problem', 'solver', 'is', 'a', 'single', 'recurrent', 'neural', 'network', 'or', 'similar', 'general', 'purpose', 'computer', 'called', 'one', 'one', 'is', 'unusual', 'in', 'the', 'sense', 'that', 'it', 'is', 'trained', 'in', 'various', 'ways', 'eg', 'by', 'black', 'box', 'optimization', 'reinforcement', 'learning', 'artificial', 'evolution', 'as', 'well', 'as', 'supervised', 'unsupervised', 'learning', 'for', 'example', 'one', 'may', 'learn', 'through', 'neuroevolution', 'to', 'control', 'a', 'robot', 'through', 'environmentchanging', 'actions', 'and', 'learn', 'through', 'unsupervised', 'gradient', 'descent', 'to', 'predict', 'future', 'inputs', 'and', 'vectorvalued', 'reward', 'signals', 'as', 'suggested', 'in', '1990', 'usergiven', 'tasks', 'can', 'be', 'defined', 'through', 'extra', 'goaldefining', 'input', 'patterns', 'also', 'proposed', 'in', '1990', 'suppose', 'one', 'has', 'already', 'learned', 'many', 'skills', 'now', 'a', 'copy', 'of', 'one', 'can', 'be', 'retrained', 'to', 'learn', 'a', 'new', 'skill', 'eg', 'through', 'neuroevolution', 'without', 'a', 'teacher', 'here', 'it', 'may', 'profit', 'from', 'reusing', 'previously', 'learned', 'subroutines', 'but', 'it', 'may', 'also', 'forget', 'previous', 'skills', 'then', 'one', 'is', 'retrained', 'in', 'powerplay', 'style', '2011', 'on', 'stored', 'inputoutput', 'traces', 'of', 'a', 'ones', 'copy', 'executing', 'the', 'new', 'skill', 'and', 'b', 'previous', 'instances', 'of', 'one', 'whose', 'skills', 'are', 'still', 'considered', 'worth', 'memorizing', 'simultaneously', 'one', 'is', 'retrained', 'on', 'old', 'traces', 'even', 'those', 'of', 'unsuccessful', 'trials', 'to', 'become', 'a', 'better', 'predictor', 'without', 'additional', 'expensive', 'interaction', 'with', 'the', 'enviroment', 'more', 'and', 'more', 'control', 'and', 'prediction', 'skills', 'are', 'thus', 'collapsed', 'into', 'one', 'like', 'in', 'the', 'chunkerautomatizer', 'system', 'of', 'the', 'neural', 'history', 'compressor', '1991', 'this', 'forces', 'one', 'to', 'relate', 'partially', 'analogous', 'skills', 'with', 'shared', 'algorithmic', 'information', 'to', 'each', 'other', 'creating', 'common', 'subroutines', 'in', 'form', 'of', 'shared', 'subnetworks', 'of', 'one', 'to', 'greatly', 'speed', 'up', 'subsequent', 'learning', 'of', 'additional', 'novel', 'but', 'algorithmically', 'related', 'skills']] | [-0.011640565405832604, 0.07952081972580345, -0.08377619015269115, 0.09029977391473949, -0.1995697019646676, -0.24860552673926578, 0.04943323172836764, 0.4375789292838557, -0.3127445193523142, -0.3616691270244441, 0.09489570483024831, -0.2468288157555175, -0.1838123694170333, 0.2003241790982429, -0.14865128495106805, 0.06463636369486007, 0.12801890732038634, 0.08126804011429029, -0.017446028933461224, -0.32658083103846625, 0.28180997824944953, 0.029858765019369977, 0.2377076429380395, -0.04675542485783808, 0.11532121299865788, -0.001288025316482942, -0.016369789257545824, -0.03237428172100668, -0.003941205998775591, 0.13848932569318484, 0.34046918612293664, 0.22534989763129748, 0.3887323197991853, -0.4527444525089647, -0.21892476712153958, 0.09183911190567805, 0.14295393999148343, 0.10865264018398843, -0.02390390316275963, -0.31731758717256264, 0.046574262889459664, -0.16851044673322965, -0.02338188995906551, -0.12738721436222217, -0.0055730241384091125, -0.03967041195849431, -0.2716813320759684, -0.026132022319507085, 0.08436176444312359, 0.05255921014883955, -0.029545442922140605, -0.11370351682167633, -0.004266921020254293, 0.17625307214828873, 0.04127643843696985, 0.09324979881348554, 0.16206669327719803, -0.18023994795429255, -0.1758241538328418, 0.3214667050018241, -0.0075307713439022855, -0.1994450039072295, 0.22206615839552665, -0.028153680136061406, -0.16021517152133, 0.09111182393805523, 0.21562859000072682, 0.10193252501693288, -0.18800309444985552, 0.002016145155981316, -0.03555934297785695, 0.18011904502158618, 0.07669489511421748, -0.044712521937825454, 0.175050930953252, 0.19093235809622067, 0.05418609253808557, 0.13374582870684598, 0.007171818388659241, -0.09291081016500746, -0.19392573762140403, -0.12212160312265041, -0.17946371293427157, 0.015846817803269783, -0.06516602223283761, -0.11997106344783139, 0.36558126900261934, 0.18392366384879485, 0.20573818880532468, 0.07039088915833937, 0.3349322091521961, 0.02694171428385224, 0.14217637144403333, 0.12642895459430292, 0.18247084648880577, 0.02774577538200122, 0.1616466751621504, -0.14913774113603204, 0.13609286768436765, 0.05817444419621357] |
1,802.08865 | EPIC247098361b: a transiting warm Saturn on an eccentric $P=11.2$ days
orbit around a $V=9.9$ star | We report the discovery of EPIC247098361b using photometric data of the
Kepler K2 satellite coupled with ground-based spectroscopic observations.
EPIC247098361b has a mass of M$_{P}=0.397\pm 0.037$ M$_J$, a radius of
R$_{P}=1.00 \pm 0.020$ R$_J$, and a moderately low equilibrium temperature of
$T_{eq}=1030 \pm 15$ K due to its relatively large star-planet separation of
$a=0.1036$ AU. EPIC247098361b orbits its bright ($V=9.9$) late F-type host star
in an eccentric orbit ($e=0.258 \pm 0.025$) every 11.2 days, and is one of only
four well characterized warm Jupiters having hosts stars brighter than $V=10$.
We estimate a heavy element content of 20 $\pm$ 7 M$_{\oplus}$ for
EPIC247098361b, which is consistent with standard models of giant planet
formation. The bright host star of EPIC247098361b makes this system a well
suited target for detailed follow-up observations that will aid in the study of
the atmospheres and orbital evolution of giant planets at moderate separations
from their host stars.
| astro-ph.EP astro-ph.SR | we report the discovery of epic247098361b using photometric data of the kepler k2 satellite coupled with groundbased spectroscopic observations epic247098361b has a mass of m_p0397pm 0037 m_j a radius of r_p100 pm 0020 r_j and a moderately low equilibrium temperature of t_eq1030 pm 15 k due to its relatively large starplanet separation of a01036 au epic247098361b orbits its bright v99 late ftype host star in an eccentric orbit e0258 pm 0025 every 112 days and is one of only four well characterized warm jupiters having hosts stars brighter than v10 we estimate a heavy element content of 20 pm 7 m_oplus for epic247098361b which is consistent with standard models of giant planet formation the bright host star of epic247098361b makes this system a well suited target for detailed followup observations that will aid in the study of the atmospheres and orbital evolution of giant planets at moderate separations from their host stars | [['we', 'report', 'the', 'discovery', 'of', 'epic247098361b', 'using', 'photometric', 'data', 'of', 'the', 'kepler', 'k2', 'satellite', 'coupled', 'with', 'groundbased', 'spectroscopic', 'observations', 'epic247098361b', 'has', 'a', 'mass', 'of', 'm_p0397pm', '0037', 'm_j', 'a', 'radius', 'of', 'r_p100', 'pm', '0020', 'r_j', 'and', 'a', 'moderately', 'low', 'equilibrium', 'temperature', 'of', 't_eq1030', 'pm', '15', 'k', 'due', 'to', 'its', 'relatively', 'large', 'starplanet', 'separation', 'of', 'a01036', 'au', 'epic247098361b', 'orbits', 'its', 'bright', 'v99', 'late', 'ftype', 'host', 'star', 'in', 'an', 'eccentric', 'orbit', 'e0258', 'pm', '0025', 'every', '112', 'days', 'and', 'is', 'one', 'of', 'only', 'four', 'well', 'characterized', 'warm', 'jupiters', 'having', 'hosts', 'stars', 'brighter', 'than', 'v10', 'we', 'estimate', 'a', 'heavy', 'element', 'content', 'of', '20', 'pm', '7', 'm_oplus', 'for', 'epic247098361b', 'which', 'is', 'consistent', 'with', 'standard', 'models', 'of', 'giant', 'planet', 'formation', 'the', 'bright', 'host', 'star', 'of', 'epic247098361b', 'makes', 'this', 'system', 'a', 'well', 'suited', 'target', 'for', 'detailed', 'followup', 'observations', 'that', 'will', 'aid', 'in', 'the', 'study', 'of', 'the', 'atmospheres', 'and', 'orbital', 'evolution', 'of', 'giant', 'planets', 'at', 'moderate', 'separations', 'from', 'their', 'host', 'stars']] | [-0.15108640527684394, 0.15430789373662365, -0.06304201639332324, 0.025446022003538245, -0.09459998230417961, -0.09470640095780054, 0.08333972854737498, 0.3476435602770174, -0.10535305473085953, -0.3939159285302644, 0.09698413990833478, -0.3415283215525624, 0.00042861815317125657, 0.18186325682263363, -0.07478472752152138, -0.013157091219112124, 0.1594209980733106, -0.03995522980383687, -0.0774097478460546, -0.23970995996504613, 0.19532128988385633, 0.045532173330398044, 0.02126350611358983, -0.0483295289474246, 0.02023033122452333, -0.051596471027164935, -0.020396950241650315, -0.1071258211278752, -0.21544333219980505, 0.02786794405953627, 0.19153181041227768, 0.0949524542514541, 0.21597300792967722, -0.28023865234249506, -0.13859739030507226, 0.04958357997015374, 0.18215951522531576, -0.011742613601262285, -0.04013086763874003, -0.27720767939590835, 0.12968711306226172, -0.22015238479290106, -0.2223087185706739, 0.05559260952796736, 0.14000154548796684, -0.011459121928703396, -0.2584181262932922, 0.1612809775732075, 0.02074726950855645, 0.18835836366992698, -0.14120012042527277, -0.17253597518540792, -0.10529453271030359, 0.036849423200019625, 0.008738150466105913, 0.08954196374971828, 0.1151098373903389, -0.05570413009024366, 0.010649796147122723, 0.4452965070672129, -0.1281125730702738, 0.05299359709439059, 0.24884629532158986, -0.21643248655233685, -0.1534451910355192, 0.16301705117803067, 0.16422051528615444, 0.20602061141486447, -0.16812255771907225, -0.019125055034735803, 0.018063698899262418, 0.24650869868083358, 0.05124576063188788, 0.08252820742239997, 0.4389887004963135, 0.1883601591099462, 0.04723976598414656, 0.021692752104558764, -0.28027798189488173, -0.013016560050333557, -0.15959820170465805, -0.09909397527441535, -0.1622332173259291, 0.08120840820898494, -0.1394184657548154, -0.10251773777098892, 0.32407318907534727, 0.09849553492417788, 0.21407170952074484, 0.029070761133693414, 0.28235792966993295, 0.04352826026127967, 0.09996729571059704, 0.11608318420930779, 0.3221823539240413, 0.20721720547530137, 0.07919078076908952, -0.24417602230654392, 0.032918427798144315, -0.06522462342878523] |
1,802.08866 | Backbendings of Superdeformed bands in $^{36,40}$Ar | Experimentally observed superdeformed (SD) rotational bands in $^{36}$Ar and
$^{40}$Ar are studied by the cranked shell model (CSM) with the paring
correlations treated by a particle-number-conserving (PNC) method. This is the
first time the PNC-CSM calculations are performed on the light nuclear mass
region around $A=40$. The experimental kinematic moments of inertia $J^{(1)}$
versus rotational frequency are reproduced well. The backbending of the SD band
at frequency around $\hbar\omega=1.5$ MeV in $^{36}$Ar is attributed to the
sharp rise of the simultaneous alignments of the neutron and proton
$1d_{5/2}[202]5/2$ pairs and $1f_{7/2}[321]3/2$ pairs, which is the consequence
of the band crossing between the $1d_{5/2}[202]5/2$ and $1f_{7/2}[321]3/2$
configuration states. The gentle upbending at the low frequency of the SD band
in $^{40}$Ar is mainly effected by the alignments of the neutron
$1f_{7/2}[321]3/2$ pairs and proton $1d_{5/2}[202]5/2$ pairs. The PNC-CSM
calculations show that besides the diagonal parts, the off-diagonal parts of
the alignments play an important role in the rotational behavior of the SD
bands.
| nucl-th nucl-ex | experimentally observed superdeformed sd rotational bands in 36ar and 40ar are studied by the cranked shell model csm with the paring correlations treated by a particlenumberconserving pnc method this is the first time the pnccsm calculations are performed on the light nuclear mass region around a40 the experimental kinematic moments of inertia j1 versus rotational frequency are reproduced well the backbending of the sd band at frequency around hbaromega15 mev in 36ar is attributed to the sharp rise of the simultaneous alignments of the neutron and proton 1d_5220252 pairs and 1f_7232132 pairs which is the consequence of the band crossing between the 1d_5220252 and 1f_7232132 configuration states the gentle upbending at the low frequency of the sd band in 40ar is mainly effected by the alignments of the neutron 1f_7232132 pairs and proton 1d_5220252 pairs the pnccsm calculations show that besides the diagonal parts the offdiagonal parts of the alignments play an important role in the rotational behavior of the sd bands | [['experimentally', 'observed', 'superdeformed', 'sd', 'rotational', 'bands', 'in', '36ar', 'and', '40ar', 'are', 'studied', 'by', 'the', 'cranked', 'shell', 'model', 'csm', 'with', 'the', 'paring', 'correlations', 'treated', 'by', 'a', 'particlenumberconserving', 'pnc', 'method', 'this', 'is', 'the', 'first', 'time', 'the', 'pnccsm', 'calculations', 'are', 'performed', 'on', 'the', 'light', 'nuclear', 'mass', 'region', 'around', 'a40', 'the', 'experimental', 'kinematic', 'moments', 'of', 'inertia', 'j1', 'versus', 'rotational', 'frequency', 'are', 'reproduced', 'well', 'the', 'backbending', 'of', 'the', 'sd', 'band', 'at', 'frequency', 'around', 'hbaromega15', 'mev', 'in', '36ar', 'is', 'attributed', 'to', 'the', 'sharp', 'rise', 'of', 'the', 'simultaneous', 'alignments', 'of', 'the', 'neutron', 'and', 'proton', '1d_5220252', 'pairs', 'and', '1f_7232132', 'pairs', 'which', 'is', 'the', 'consequence', 'of', 'the', 'band', 'crossing', 'between', 'the', '1d_5220252', 'and', '1f_7232132', 'configuration', 'states', 'the', 'gentle', 'upbending', 'at', 'the', 'low', 'frequency', 'of', 'the', 'sd', 'band', 'in', '40ar', 'is', 'mainly', 'effected', 'by', 'the', 'alignments', 'of', 'the', 'neutron', '1f_7232132', 'pairs', 'and', 'proton', '1d_5220252', 'pairs', 'the', 'pnccsm', 'calculations', 'show', 'that', 'besides', 'the', 'diagonal', 'parts', 'the', 'offdiagonal', 'parts', 'of', 'the', 'alignments', 'play', 'an', 'important', 'role', 'in', 'the', 'rotational', 'behavior', 'of', 'the', 'sd', 'bands']] | [-0.13612543709535638, 0.1634613969270176, -0.0289395770682774, 0.12415388321304428, 0.037642082536950276, -0.06012611839593452, 0.06161646672339404, 0.38212147889577824, -0.20836397985528624, -0.28667981700497386, -0.01865890352865276, -0.2821326400471493, -0.037235343614766686, 0.13318254218598746, 0.06931418249139892, -0.05428432928895728, 0.045021042486606454, 0.002822017302933317, -0.10274713633759873, -0.12652517742873604, 0.29803712235081087, 0.09200761554566045, 0.2610245171402182, 0.08218193388549808, 0.028652152256253435, 0.019489707370282886, 0.019749828093679426, -0.07966300862500016, -0.09993194334914146, 0.06823147972214169, 0.23253935740563603, -0.006545744746668924, 0.14942887885986267, -0.40905116073879766, -0.13615851536370027, 0.05944187354921184, 0.1296743767390965, 0.10001008569115415, -0.016037768118158678, -0.2998984901246077, 0.045856925112235804, -0.18451444869311467, -0.132987417781766, -0.03362828956321113, 0.0328805066517884, 0.038831431324657356, -0.21692649928436425, 0.1336149753632475, 0.06151729436668637, 0.05711258131559137, -0.11136419741691363, -0.2035817719622868, -0.09726035911503092, 0.06902263087498152, 0.0977585767591025, 0.035680268854278815, 0.10473577967434196, -0.0675146210615477, -0.07217396998789555, 0.3871420037857494, -0.0185714904623835, -0.10509798026742032, 0.13103208985896955, -0.1728287621427281, -0.0900238642775633, 0.18499225437039543, 0.10546809401412303, 0.11578261071052517, -0.09549397416485138, 0.06028034113132777, -0.010338548886132722, 0.15602145137508278, 0.07039696219093773, 0.03912950665415236, 0.2345599404171757, 0.14458892807387602, -0.03221322359193279, 0.06458720273876227, -0.2212408919607561, -0.06558366853350438, -0.27462437951948887, -0.07762362995410557, -0.19175269741345174, -0.015007464796332179, -0.04045556010691064, -0.09513421098684302, 0.40655573875706946, -0.0064626836776697245, 0.20666416670826282, -0.035211994874534074, 0.2582585173919334, 0.0922168156519671, 0.09348171460731476, 0.06290645527137119, 0.32038377214986713, 0.1903814562315827, 0.058802651740344505, -0.32262986362188684, 0.06105568676735766, 0.021560710859889892] |
1,802.08867 | Results from The Latin American Giant Observatory Space Weather
Simulation Chain | The Space Weather program of the Latin American Giant Observatory (LAGO)
Collaboration was designed to study the variation of the flux of atmospheric
secondary particles at ground level produced during the interaction of cosmic
rays with the air. This work complements and expands the inference capabilities
of the LAGO detection network to identify the influence of solar activity on
the particle flux, at places having different geomagnetic rigidity cut-offs and
atmospheric depths. This program is developed through a series of Monte Carlo
sequential simulations to compute the intensity spectrum of the various
components of the radiation field on the ground. A key feature of these
calculations is that we performed detailed radiation transport computations as
a function of incident direction, time, altitude, as well as latitude and
longitude. Magnetic rigidity calculations and corrections for geomagnetic field
activity are established by using the MAGNETOCOSMICS code, and the estimation
of the flux of secondaries at ground level is implemented by using the CORSIKA
code; thus we can examine the local peculiarities in the penumbral regions with
a more realistic description of the atmospheric and geomagnetic response in
these complex regions of the rigidity space. As an example of our calculation
scheme, we report some result on the flux at ground level for two LAGO
locations: Bucaramanga-Colombia and San Carlos de Bariloche-Argentina, for the
geomagnetically active period of May 2005.
| physics.geo-ph astro-ph.IM | the space weather program of the latin american giant observatory lago collaboration was designed to study the variation of the flux of atmospheric secondary particles at ground level produced during the interaction of cosmic rays with the air this work complements and expands the inference capabilities of the lago detection network to identify the influence of solar activity on the particle flux at places having different geomagnetic rigidity cutoffs and atmospheric depths this program is developed through a series of monte carlo sequential simulations to compute the intensity spectrum of the various components of the radiation field on the ground a key feature of these calculations is that we performed detailed radiation transport computations as a function of incident direction time altitude as well as latitude and longitude magnetic rigidity calculations and corrections for geomagnetic field activity are established by using the magnetocosmics code and the estimation of the flux of secondaries at ground level is implemented by using the corsika code thus we can examine the local peculiarities in the penumbral regions with a more realistic description of the atmospheric and geomagnetic response in these complex regions of the rigidity space as an example of our calculation scheme we report some result on the flux at ground level for two lago locations bucaramangacolombia and san carlos de barilocheargentina for the geomagnetically active period of may 2005 | [['the', 'space', 'weather', 'program', 'of', 'the', 'latin', 'american', 'giant', 'observatory', 'lago', 'collaboration', 'was', 'designed', 'to', 'study', 'the', 'variation', 'of', 'the', 'flux', 'of', 'atmospheric', 'secondary', 'particles', 'at', 'ground', 'level', 'produced', 'during', 'the', 'interaction', 'of', 'cosmic', 'rays', 'with', 'the', 'air', 'this', 'work', 'complements', 'and', 'expands', 'the', 'inference', 'capabilities', 'of', 'the', 'lago', 'detection', 'network', 'to', 'identify', 'the', 'influence', 'of', 'solar', 'activity', 'on', 'the', 'particle', 'flux', 'at', 'places', 'having', 'different', 'geomagnetic', 'rigidity', 'cutoffs', 'and', 'atmospheric', 'depths', 'this', 'program', 'is', 'developed', 'through', 'a', 'series', 'of', 'monte', 'carlo', 'sequential', 'simulations', 'to', 'compute', 'the', 'intensity', 'spectrum', 'of', 'the', 'various', 'components', 'of', 'the', 'radiation', 'field', 'on', 'the', 'ground', 'a', 'key', 'feature', 'of', 'these', 'calculations', 'is', 'that', 'we', 'performed', 'detailed', 'radiation', 'transport', 'computations', 'as', 'a', 'function', 'of', 'incident', 'direction', 'time', 'altitude', 'as', 'well', 'as', 'latitude', 'and', 'longitude', 'magnetic', 'rigidity', 'calculations', 'and', 'corrections', 'for', 'geomagnetic', 'field', 'activity', 'are', 'established', 'by', 'using', 'the', 'magnetocosmics', 'code', 'and', 'the', 'estimation', 'of', 'the', 'flux', 'of', 'secondaries', 'at', 'ground', 'level', 'is', 'implemented', 'by', 'using', 'the', 'corsika', 'code', 'thus', 'we', 'can', 'examine', 'the', 'local', 'peculiarities', 'in', 'the', 'penumbral', 'regions', 'with', 'a', 'more', 'realistic', 'description', 'of', 'the', 'atmospheric', 'and', 'geomagnetic', 'response', 'in', 'these', 'complex', 'regions', 'of', 'the', 'rigidity', 'space', 'as', 'an', 'example', 'of', 'our', 'calculation', 'scheme', 'we', 'report', 'some', 'result', 'on', 'the', 'flux', 'at', 'ground', 'level', 'for', 'two', 'lago', 'locations', 'bucaramangacolombia', 'and', 'san', 'carlos', 'de', 'barilocheargentina', 'for', 'the', 'geomagnetically', 'active', 'period', 'of', 'may', '2005']] | [-0.12317472856129623, 0.1639398870188355, -0.06193888718883196, 0.09195250006599559, -0.020309324328684146, -0.0186401440265278, 0.02255874991313451, 0.3818438215388192, -0.20211582097742292, -0.3958100296722518, 0.08468704640968806, -0.268904202601148, -0.10016455642723789, 0.2017051904034128, -0.004745000046160486, 0.013953625162442525, 0.08719912452416287, -0.005066829431388113, -0.016363718299932467, -0.18780980326545735, 0.2878648998019182, 0.20059253077954053, 0.23813285902556447, 0.05702390865008864, 0.09713301026572783, 0.006567278849995799, -0.05546076785113352, -0.0037078413892433874, -0.11678259726422968, 0.0937432534330421, 0.2154109790903102, 0.12576436180052245, 0.20174536651569522, -0.43908495117392804, -0.22895231378057765, 0.046897556148469445, 0.0850345632671896, 0.04818062356569701, -0.012695458766603326, -0.2930533642280433, 0.025508145578205587, -0.1516825138342877, -0.14099688755865727, -0.001758299246430397, -0.028805998381641176, 0.03623884851630363, -0.25387807453465133, 0.006768719996843073, -0.009813585278526363, 0.1462052838560582, -0.07651472307327721, -0.12242493599860205, -0.05503745758129905, 0.16450557618557166, 0.08116073016229267, 0.04180737902190433, 0.1577122769649658, -0.10631678296563526, -0.09497719760466782, 0.35872299931529494, -0.07925303108938453, -0.08748457159950501, 0.19365286474348978, -0.17981567830675177, -0.15440263925327194, 0.17237909722659323, 0.18952678167700973, 0.10214203194818564, -0.13554197102992072, 0.05750984263114838, -0.013855366255674097, 0.12555558435515396, 0.06037425703265601, -0.021526913990577063, 0.22351524338540105, 0.15236807032695246, 0.06299196204374312, 0.1220496383888854, -0.21086959154138135, -0.06020927054290142, -0.2890158945860134, -0.13609546520850724, -0.15018641433575086, 0.009432879000798696, -0.06000721094670654, -0.16251359494403006, 0.44430537066065073, 0.1463273653931295, 0.13408148082283636, 0.023081281029929717, 0.3049024800873465, 0.058023640919580226, 0.032854773603806585, 0.08164918835688796, 0.25205329467917587, 0.11413848477933142, 0.1382174417655915, -0.2415077565362056, 0.07301728434653745, 0.0723547371611413] |
1,802.08868 | Stability Limits of Circumbinary Planets: Is There a Pile-up in the
Kepler CBPs? | The stability limit for circumbinary planets (CBPs) is not well defined and
can depend on initial parameters defining either the planetary orbit or the
inner binary orbit. We expand on the work of Holman & Wiegert (1999, AJ 117,
621) to develop numerical tools for quick, easy, and accurate determination of
the stability limit. The results of our simulations, as well as our numerical
tools, are available to the community through $\texttt{Zenodo}$ and
$\texttt{GitHub}$, respectively. We employ a grid interpolation method based on
$\sim$150 million full N-body simulations of initially circular, coplanar
systems and compare to the 9 known Kepler CBP systems. Using a formalism from
planet packing studies, we find that 55% of the Kepler CBP systems allow for an
additional equal-mass planet to potentially exist on an interior orbit relative
to the observed planet. Therefore, we do $\textit{not}$ find strong evidence
for a pile-up in the Kepler CBP systems and more detections are needed to
adequately characterize the formation mechanisms for the CBP population.
Observations from the Transiting Exoplanet Survey Satellite are expected to
substantially increase the number of detections using the unique geometry of
CBP systems, where multiple transits can occur during a single conjunction.
| astro-ph.EP | the stability limit for circumbinary planets cbps is not well defined and can depend on initial parameters defining either the planetary orbit or the inner binary orbit we expand on the work of holman wiegert 1999 aj 117 621 to develop numerical tools for quick easy and accurate determination of the stability limit the results of our simulations as well as our numerical tools are available to the community through textttzenodo and textttgithub respectively we employ a grid interpolation method based on sim150 million full nbody simulations of initially circular coplanar systems and compare to the 9 known kepler cbp systems using a formalism from planet packing studies we find that 55 of the kepler cbp systems allow for an additional equalmass planet to potentially exist on an interior orbit relative to the observed planet therefore we do textitnot find strong evidence for a pileup in the kepler cbp systems and more detections are needed to adequately characterize the formation mechanisms for the cbp population observations from the transiting exoplanet survey satellite are expected to substantially increase the number of detections using the unique geometry of cbp systems where multiple transits can occur during a single conjunction | [['the', 'stability', 'limit', 'for', 'circumbinary', 'planets', 'cbps', 'is', 'not', 'well', 'defined', 'and', 'can', 'depend', 'on', 'initial', 'parameters', 'defining', 'either', 'the', 'planetary', 'orbit', 'or', 'the', 'inner', 'binary', 'orbit', 'we', 'expand', 'on', 'the', 'work', 'of', 'holman', 'wiegert', '1999', 'aj', '117', '621', 'to', 'develop', 'numerical', 'tools', 'for', 'quick', 'easy', 'and', 'accurate', 'determination', 'of', 'the', 'stability', 'limit', 'the', 'results', 'of', 'our', 'simulations', 'as', 'well', 'as', 'our', 'numerical', 'tools', 'are', 'available', 'to', 'the', 'community', 'through', 'textttzenodo', 'and', 'textttgithub', 'respectively', 'we', 'employ', 'a', 'grid', 'interpolation', 'method', 'based', 'on', 'sim150', 'million', 'full', 'nbody', 'simulations', 'of', 'initially', 'circular', 'coplanar', 'systems', 'and', 'compare', 'to', 'the', '9', 'known', 'kepler', 'cbp', 'systems', 'using', 'a', 'formalism', 'from', 'planet', 'packing', 'studies', 'we', 'find', 'that', '55', 'of', 'the', 'kepler', 'cbp', 'systems', 'allow', 'for', 'an', 'additional', 'equalmass', 'planet', 'to', 'potentially', 'exist', 'on', 'an', 'interior', 'orbit', 'relative', 'to', 'the', 'observed', 'planet', 'therefore', 'we', 'do', 'textitnot', 'find', 'strong', 'evidence', 'for', 'a', 'pileup', 'in', 'the', 'kepler', 'cbp', 'systems', 'and', 'more', 'detections', 'are', 'needed', 'to', 'adequately', 'characterize', 'the', 'formation', 'mechanisms', 'for', 'the', 'cbp', 'population', 'observations', 'from', 'the', 'transiting', 'exoplanet', 'survey', 'satellite', 'are', 'expected', 'to', 'substantially', 'increase', 'the', 'number', 'of', 'detections', 'using', 'the', 'unique', 'geometry', 'of', 'cbp', 'systems', 'where', 'multiple', 'transits', 'can', 'occur', 'during', 'a', 'single', 'conjunction']] | [-0.12296707594516472, 0.06855627877461629, -0.07097703091418132, 0.0674058316508308, -0.10809922700938888, -0.07873708498306, 0.09541999285515303, 0.3388863675869428, -0.19178765287192967, -0.365441199645209, 0.14251192178463754, -0.2768771820438978, -0.11830248288356532, 0.252320936065203, -0.07627582232921551, 0.08327571863475709, 0.16201568712981848, -0.03186745380815596, -0.042735186621594506, -0.27286132416353587, 0.25381364240669285, 0.0748694678529715, 0.09300169520892011, -0.037123970279376056, 0.0365789394837637, 0.00702566183410967, -0.039305559432325075, -0.022031061246226995, -0.19481665844665633, 0.07303401140543894, 0.21280971768503196, 0.1390115114627406, 0.20947434203975343, -0.3988349536433816, -0.20669455096985284, 0.06561137206721096, 0.17232831937428086, 0.09716698314564733, -0.026844302325834856, -0.25466829877263175, 0.11047658080187364, -0.20537041811606824, -0.15847403251876432, -0.05111966045537534, 0.058483160552210534, 0.045788587214281924, -0.2797741090449003, 0.04444381111564163, 0.07305115697452447, 0.11450394844779602, -0.13325435306208255, -0.11163206406606313, -0.06756077937734051, 0.12769642821632518, -0.00771103521498541, 0.01502046334819916, 0.1295914379426111, -0.037562092188268136, -0.1016417233261447, 0.387025752526302, -0.0630148574232291, -0.10179718521972879, 0.28173384961003484, -0.1800842055489715, -0.13650878669503025, 0.1439916934280728, 0.20302406916967952, 0.13294069679082335, -0.1362506442668233, 0.010959005730453497, -0.029606075168181305, 0.20462808643754285, 0.07040329645507229, 0.002136716200635792, 0.32800900667714766, 0.1199469867365387, 0.07367195095568417, 0.08981890761747192, -0.18669584377621037, -0.0977793432932977, -0.20767844466235824, -0.12773473552013642, -0.1490402220748365, 0.013073627960059243, -0.05290248151473068, -0.15667379605225645, 0.3357880449943388, 0.17109955162681545, 0.1769964618094934, 0.030768199079932692, 0.30765530052953044, 0.07644488003630287, 0.06985461456325795, 0.08345610882179477, 0.3114601155050481, 0.13578998857440475, 0.07436333940967392, -0.22097408923839865, 0.05339763551496733, 0.002061554044485092] |
1,802.08869 | Effectiveness of Diffusing Information through a Social Network in
Multiple Phases | We study the effectiveness of using multiple phases for maximizing the extent
of information diffusion through a social network, and present insights while
considering various aspects. In particular, we focus on the independent cascade
model with the possibility of adaptively selecting seed nodes in multiple
phases based on the observed diffusion in preceding phases, and conduct a
detailed simulation study on real-world network datasets and various values of
seeding budgets. We first present a negative result that more phases do not
guarantee a better spread, however the adaptability advantage of more phases
generally leads to a better spread in practice, as observed on real-world
datasets. We study how diffusing in multiple phases affects the mean and
standard deviation of the distribution representing the extent of diffusion. We
then study how the number of phases impacts the effectiveness of multiphase
diffusion, how the diffusion progresses phase-by-phase, and what is an optimal
way to split the total seeding budget across phases. Our experiments suggest a
significant gain when we move from single phase to two phases, and an
appreciable gain when we further move to three phases, but the marginal gain
thereafter is usually not very significant. Our main conclusion is that, given
the number of phases, an optimal way to split the budget across phases is such
that the number of nodes influenced in each phase is almost the same.
| cs.SI physics.soc-ph | we study the effectiveness of using multiple phases for maximizing the extent of information diffusion through a social network and present insights while considering various aspects in particular we focus on the independent cascade model with the possibility of adaptively selecting seed nodes in multiple phases based on the observed diffusion in preceding phases and conduct a detailed simulation study on realworld network datasets and various values of seeding budgets we first present a negative result that more phases do not guarantee a better spread however the adaptability advantage of more phases generally leads to a better spread in practice as observed on realworld datasets we study how diffusing in multiple phases affects the mean and standard deviation of the distribution representing the extent of diffusion we then study how the number of phases impacts the effectiveness of multiphase diffusion how the diffusion progresses phasebyphase and what is an optimal way to split the total seeding budget across phases our experiments suggest a significant gain when we move from single phase to two phases and an appreciable gain when we further move to three phases but the marginal gain thereafter is usually not very significant our main conclusion is that given the number of phases an optimal way to split the budget across phases is such that the number of nodes influenced in each phase is almost the same | [['we', 'study', 'the', 'effectiveness', 'of', 'using', 'multiple', 'phases', 'for', 'maximizing', 'the', 'extent', 'of', 'information', 'diffusion', 'through', 'a', 'social', 'network', 'and', 'present', 'insights', 'while', 'considering', 'various', 'aspects', 'in', 'particular', 'we', 'focus', 'on', 'the', 'independent', 'cascade', 'model', 'with', 'the', 'possibility', 'of', 'adaptively', 'selecting', 'seed', 'nodes', 'in', 'multiple', 'phases', 'based', 'on', 'the', 'observed', 'diffusion', 'in', 'preceding', 'phases', 'and', 'conduct', 'a', 'detailed', 'simulation', 'study', 'on', 'realworld', 'network', 'datasets', 'and', 'various', 'values', 'of', 'seeding', 'budgets', 'we', 'first', 'present', 'a', 'negative', 'result', 'that', 'more', 'phases', 'do', 'not', 'guarantee', 'a', 'better', 'spread', 'however', 'the', 'adaptability', 'advantage', 'of', 'more', 'phases', 'generally', 'leads', 'to', 'a', 'better', 'spread', 'in', 'practice', 'as', 'observed', 'on', 'realworld', 'datasets', 'we', 'study', 'how', 'diffusing', 'in', 'multiple', 'phases', 'affects', 'the', 'mean', 'and', 'standard', 'deviation', 'of', 'the', 'distribution', 'representing', 'the', 'extent', 'of', 'diffusion', 'we', 'then', 'study', 'how', 'the', 'number', 'of', 'phases', 'impacts', 'the', 'effectiveness', 'of', 'multiphase', 'diffusion', 'how', 'the', 'diffusion', 'progresses', 'phasebyphase', 'and', 'what', 'is', 'an', 'optimal', 'way', 'to', 'split', 'the', 'total', 'seeding', 'budget', 'across', 'phases', 'our', 'experiments', 'suggest', 'a', 'significant', 'gain', 'when', 'we', 'move', 'from', 'single', 'phase', 'to', 'two', 'phases', 'and', 'an', 'appreciable', 'gain', 'when', 'we', 'further', 'move', 'to', 'three', 'phases', 'but', 'the', 'marginal', 'gain', 'thereafter', 'is', 'usually', 'not', 'very', 'significant', 'our', 'main', 'conclusion', 'is', 'that', 'given', 'the', 'number', 'of', 'phases', 'an', 'optimal', 'way', 'to', 'split', 'the', 'budget', 'across', 'phases', 'is', 'such', 'that', 'the', 'number', 'of', 'nodes', 'influenced', 'in', 'each', 'phase', 'is', 'almost', 'the', 'same']] | [-0.1237177658147534, 0.11779283716928228, -0.08355806907230433, 0.024816959485178813, -0.04689766580990532, -0.085669517299577, 0.09541304607665281, 0.40556326550186467, -0.2731034834971325, -0.3350943435298018, 0.08185272055408477, -0.27484688172607047, -0.17689380594815143, 0.16578709387185722, -0.039750836957082675, -0.009254283010752835, 0.05804514637157697, 0.005436774375930167, -0.044946150801638794, -0.2886530894688086, 0.3278734808452754, 0.06484949256685611, 0.32759208208064367, 0.04506281638270849, 0.06467156080945738, -0.033462794638532946, -0.019561781662336568, 0.04203805188814856, -0.10755681385001624, 0.0706545060884469, 0.21485401269583554, 0.12624611799819513, 0.29086292982755, -0.45720275556219314, -0.23498558808575598, 0.13177065253707074, 0.17127930320974996, 0.0883395944809053, -0.07229670531000522, -0.2344299712659497, 0.059986182487735185, -0.1497547065148849, -0.06938046408947884, -0.06088322718840158, -0.010128773871417108, 0.018865213701103226, -0.26252764674810397, 0.06571205667314005, 0.030204994573355896, 0.027763759006599064, -0.04885875225463359, -0.11610685568507108, -0.03801741861644315, 0.19866426278384638, 0.058310018176837876, -0.02217027622534436, 0.11393522092635465, -0.15423698939195132, -0.11726422084029764, 0.37999852850720217, -0.03977096853103783, -0.18688668890676477, 0.20551748307658718, -0.13905902167760742, -0.11800877996128085, 0.13898604546097645, 0.20963188713792255, 0.11567503374004573, -0.12609458250555786, -0.030988920216562594, -0.03272651864997961, 0.19342679241590463, 0.00822460663294534, 0.02534638473196282, 0.19303070558153354, 0.21345376478928843, 0.07546722689100231, 0.15239685195372563, -0.09638873924472648, -0.14475731810620218, -0.2598547656209057, -0.1436242276257345, -0.16544674031064732, 0.004761086250047747, -0.12206881747669397, -0.1326533246707792, 0.4424876440673854, 0.21070565931752258, 0.2247405910901235, 0.022483452284257254, 0.3023751370400484, 0.05334915156657971, 0.02144310384449598, 0.061403275371463804, 0.22908315006561839, 0.058192871370058706, 0.09754675693234037, -0.215432422338748, 0.11189671885477494, -0.009633342169731725] |
1,802.0887 | Topological nanophononic states by band inversion | Nanophononics is essential for the engineering of thermal transport in
nanostructured electronic devices, it greatly facilitates the manipulation of
mechanical resonators in the quantum regime, and could unveil a new route in
quantum communications using phonons as carriers of information. Acoustic
phonons also constitute a versatile platform for the study of fundamental wave
dynamics, including Bloch oscillations, Wannier Stark ladders and other
localization phenomena. Many of the phenomena studied in nanophononics were
indeed inspired by their counterparts in optics and electronics. In these
fields, the consideration of topological invariants to control wave dynamics
has already had a great impact for the generation of robust confined states.
Interestingly, the use of topological phases to engineer nanophononic devices
remains an unexplored and promising field. Conversely, the use of acoustic
phonons could constitute a rich platform to study topological states. Here, we
introduce the concept of topological invariants to nanophononics and
experimentally implement a nanophononic system supporting a robust topological
interface state at 350 GHz. The state is constructed through band inversion,
i.e. by concatenating two semiconductor superlattices with inverted spatial
mode symmetries. The existence of this state is purely determined by the Zak
phases of the constituent superlattices, i.e. that one-dimensional Berry phase.
We experimentally evidenced the mode through Raman spectroscopy. The reported
robust topological interface states could become part of nanophononic devices
requiring resonant structures such as sensors or phonon lasers.
| cond-mat.mes-hall cond-mat.mtrl-sci physics.optics | nanophononics is essential for the engineering of thermal transport in nanostructured electronic devices it greatly facilitates the manipulation of mechanical resonators in the quantum regime and could unveil a new route in quantum communications using phonons as carriers of information acoustic phonons also constitute a versatile platform for the study of fundamental wave dynamics including bloch oscillations wannier stark ladders and other localization phenomena many of the phenomena studied in nanophononics were indeed inspired by their counterparts in optics and electronics in these fields the consideration of topological invariants to control wave dynamics has already had a great impact for the generation of robust confined states interestingly the use of topological phases to engineer nanophononic devices remains an unexplored and promising field conversely the use of acoustic phonons could constitute a rich platform to study topological states here we introduce the concept of topological invariants to nanophononics and experimentally implement a nanophononic system supporting a robust topological interface state at 350 ghz the state is constructed through band inversion ie by concatenating two semiconductor superlattices with inverted spatial mode symmetries the existence of this state is purely determined by the zak phases of the constituent superlattices ie that onedimensional berry phase we experimentally evidenced the mode through raman spectroscopy the reported robust topological interface states could become part of nanophononic devices requiring resonant structures such as sensors or phonon lasers | [['nanophononics', 'is', 'essential', 'for', 'the', 'engineering', 'of', 'thermal', 'transport', 'in', 'nanostructured', 'electronic', 'devices', 'it', 'greatly', 'facilitates', 'the', 'manipulation', 'of', 'mechanical', 'resonators', 'in', 'the', 'quantum', 'regime', 'and', 'could', 'unveil', 'a', 'new', 'route', 'in', 'quantum', 'communications', 'using', 'phonons', 'as', 'carriers', 'of', 'information', 'acoustic', 'phonons', 'also', 'constitute', 'a', 'versatile', 'platform', 'for', 'the', 'study', 'of', 'fundamental', 'wave', 'dynamics', 'including', 'bloch', 'oscillations', 'wannier', 'stark', 'ladders', 'and', 'other', 'localization', 'phenomena', 'many', 'of', 'the', 'phenomena', 'studied', 'in', 'nanophononics', 'were', 'indeed', 'inspired', 'by', 'their', 'counterparts', 'in', 'optics', 'and', 'electronics', 'in', 'these', 'fields', 'the', 'consideration', 'of', 'topological', 'invariants', 'to', 'control', 'wave', 'dynamics', 'has', 'already', 'had', 'a', 'great', 'impact', 'for', 'the', 'generation', 'of', 'robust', 'confined', 'states', 'interestingly', 'the', 'use', 'of', 'topological', 'phases', 'to', 'engineer', 'nanophononic', 'devices', 'remains', 'an', 'unexplored', 'and', 'promising', 'field', 'conversely', 'the', 'use', 'of', 'acoustic', 'phonons', 'could', 'constitute', 'a', 'rich', 'platform', 'to', 'study', 'topological', 'states', 'here', 'we', 'introduce', 'the', 'concept', 'of', 'topological', 'invariants', 'to', 'nanophononics', 'and', 'experimentally', 'implement', 'a', 'nanophononic', 'system', 'supporting', 'a', 'robust', 'topological', 'interface', 'state', 'at', '350', 'ghz', 'the', 'state', 'is', 'constructed', 'through', 'band', 'inversion', 'ie', 'by', 'concatenating', 'two', 'semiconductor', 'superlattices', 'with', 'inverted', 'spatial', 'mode', 'symmetries', 'the', 'existence', 'of', 'this', 'state', 'is', 'purely', 'determined', 'by', 'the', 'zak', 'phases', 'of', 'the', 'constituent', 'superlattices', 'ie', 'that', 'onedimensional', 'berry', 'phase', 'we', 'experimentally', 'evidenced', 'the', 'mode', 'through', 'raman', 'spectroscopy', 'the', 'reported', 'robust', 'topological', 'interface', 'states', 'could', 'become', 'part', 'of', 'nanophononic', 'devices', 'requiring', 'resonant', 'structures', 'such', 'as', 'sensors', 'or', 'phonon', 'lasers']] | [-0.19874766749005926, 0.2256019156350901, -0.07401535405686287, 0.012583562209139294, -0.07065205697537116, -0.1727818418537145, 0.06585575135212149, 0.3884462035483802, -0.2780604560090148, -0.26676743584280105, 0.06357832026475554, -0.28013188503366265, -0.19205147715832066, 0.23768711951662502, 0.011527226414814915, 0.08239036589663516, -0.00897859546062334, -0.07552185469894143, -0.028565317190900122, -0.1256537092014459, 0.2708592310284629, 0.01917650393999951, 0.3515857721678913, 0.06142856707270055, 0.0629389248251834, 0.00747712580892055, 0.0676505714400264, -0.030172022765137904, -0.11334439059994664, 0.11810211644168822, 0.2943214866079633, -0.029903998457903862, 0.2238207101892761, -0.46525230642570103, -0.2669660277831692, 0.01777914111583453, 0.15499934480505306, 0.16183320045491437, -0.10593553504440933, -0.32874147270441706, 0.035364866418683014, -0.13227178388902835, -0.13324894505817414, -0.13415738641051575, 0.010216451369215855, -0.04026246112163948, -0.16429627744238015, 0.04361519870720298, 0.02078824442477249, 0.07054765894300426, -0.059810283185683856, -0.049002187841308664, -0.06436417904763442, 0.1062401451241306, -0.04783943063559254, -0.0252666843848799, 0.13821411503190378, -0.14556085996395585, -0.18689344826802287, 0.3988478381596708, -0.034181437653529906, -0.1286333026125288, 0.21010903952258597, -0.11562566184299573, -0.06910213143969683, 0.12042600979785556, 0.13856003002425574, 0.08280256951794676, -0.12774388193274322, 0.05936218822025694, 0.031089880005785508, 0.1601525303440766, 0.03729810066743875, 0.1752444265228089, 0.2753932735234823, 0.18760216536769725, 0.04707240919941915, 0.17617775675633152, -0.07632348392482685, -0.04921851871818628, -0.22150814618267442, -0.20786607639317442, -0.23683305294126394, 0.05538289715047501, -0.0031470841570610543, -0.1861265541277016, 0.45449981603204553, 0.13428390303489995, 0.12280045242362615, -0.07419750356297616, 0.2656369639236642, 0.09618513730516576, 0.08786256362420872, 0.021791056881699224, 0.29387697957901526, 0.1758077904121424, 0.1129328703922827, -0.23974758527752862, 0.028737984718147504, 0.00015130223005341932] |
1,802.08871 | Integrating a Computational Perspective in Physics Courses | In this contribution we discuss how to develop a physics curriculum for
undergraduate students that includes computing as a central element. Our
contribution starts with a definition of computing and pertinent learning
outcomes and assessment studies and programs. We end with a discussion on how
to implement computing in various physics courses by presenting our experiences
from Michigan State University in the USA and the University of Oslo in Norway.
| physics.ed-ph physics.comp-ph | in this contribution we discuss how to develop a physics curriculum for undergraduate students that includes computing as a central element our contribution starts with a definition of computing and pertinent learning outcomes and assessment studies and programs we end with a discussion on how to implement computing in various physics courses by presenting our experiences from michigan state university in the usa and the university of oslo in norway | [['in', 'this', 'contribution', 'we', 'discuss', 'how', 'to', 'develop', 'a', 'physics', 'curriculum', 'for', 'undergraduate', 'students', 'that', 'includes', 'computing', 'as', 'a', 'central', 'element', 'our', 'contribution', 'starts', 'with', 'a', 'definition', 'of', 'computing', 'and', 'pertinent', 'learning', 'outcomes', 'and', 'assessment', 'studies', 'and', 'programs', 'we', 'end', 'with', 'a', 'discussion', 'on', 'how', 'to', 'implement', 'computing', 'in', 'various', 'physics', 'courses', 'by', 'presenting', 'our', 'experiences', 'from', 'michigan', 'state', 'university', 'in', 'the', 'usa', 'and', 'the', 'university', 'of', 'oslo', 'in', 'norway']] | [0.0014930470979639462, 0.10611779224127531, -0.16321227354928852, 0.047561216306140915, -0.09631021137216261, -0.11291665308443563, 0.09095192339404352, 0.31963948998600245, -0.16669282152184417, -0.37547542745513574, 0.10038988109278892, -0.2978580139976527, -0.1518856916842716, 0.2020527727369751, -0.10465907365349787, -0.027612073772719927, 0.08550125283322164, -0.014261896509144988, -0.07123261730718826, -0.24191420235271965, 0.32430105566579315, 0.1099354647366064, 0.3014946746240769, 0.06900349313925419, 0.079008474573493, 0.029330608198818352, -0.06510953280542578, -0.018583953779722964, -0.10360168019428134, 0.18176692697618688, 0.4282714235995497, 0.2175422219226935, 0.4018832995423249, -0.4062890208193234, -0.09636067489960363, -0.0018864180859444397, 0.03952420022937336, 0.12166775526212795, -0.11441102435845615, -0.29562101574348554, -0.005829561248953854, -0.23893985844084195, -0.13002055190902737, -0.04712751124586378, 0.0016444523153560503, -0.010390378800886018, -0.18926456418952772, -0.016946264555943863, -0.00012461484210299595, 0.1541233076647456, -0.02753691766743681, -0.2014619344712368, 0.09470275351611365, 0.17214628202574594, -0.008550192256058966, 0.025960910034232905, 0.1594553441208388, -0.1830125980910712, -0.19003239342543696, 0.38544849306344986, -0.03662011937371322, -0.108187996356615, 0.21502319519807186, -0.16243057890928217, -0.18310678651323542, -0.011356323059382183, 0.2795334386772343, 0.02848137949061181, -0.15236235500446388, 0.08629021452070447, 0.03589680713734456, 0.1331328999550481, -0.009342173859477044, -0.09695994358376733, 0.1883495702408254, 0.1995703566287245, -0.004657127648325903, 0.14624871047479765, -0.03351021032846932, -0.14554237349491034, -0.3288039444280522, -0.18895417640783957, -0.15178646833436296, 0.014286595616223557, 0.07669707361824944, -0.12039923188941819, 0.4354397183018071, 0.2017784122377634, 0.11045449033179985, 0.016171302433524812, 0.2743191575232361, 0.05138344052912933, 0.02160900543842997, 0.1312263045859124, 0.17569483013025353, 0.09070773114383753, 0.21714628046777631, -0.17627929922392857, 0.030941545271447726, 0.02569521396944765] |
1,802.08872 | Deep learning for conifer/deciduous classification of airborne LiDAR 3D
point clouds representing individual trees | The purpose of this study was to investigate the use of deep learning for
coniferous/deciduous classification of individual trees from airborne LiDAR
data. To enable efficient processing by a deep convolutional neural network
(CNN), we designed two discrete representations using leaf-off and leaf-on
LiDAR data: a digital surface model with four channels (DSMx4) and a set of
four 2D views (4x2D). A training dataset of labeled tree crowns was generated
via segmentation of tree crowns, followed by co-registration with field data.
Potential mislabels due to GPS error or tree leaning were corrected using a
statistical ensemble filtering procedure. Because the training data was heavily
unbalanced (~8% conifers), we trained an ensemble of CNNs on random balanced
sub-samples of augmented data (180 rotational variations per instance). The
4x2D representation yielded similar classification accuracies to the DSMx4
representation (~82% coniferous and ~90% deciduous) while converging faster.
The data augmentation improved the classification accuracies, but more real
training instances (especially coniferous) likely results in much stronger
improvements. Leaf-off LiDAR data were the primary source of useful
information, which is likely due to the perennial nature of coniferous foliage.
LiDAR intensity values also proved to be useful, but normalization yielded no
significant improvements. Lastly, the classification accuracies of overstory
trees (~90%) were more balanced than those of understory trees (~90% deciduous
and ~65% coniferous), which is likely due to the incomplete capture of
understory tree crowns via airborne LiDAR. Automatic derivation of optimal
features via deep learning provide the opportunity for remarkable improvements
in prediction tasks where captured data are not friendly to human visual system
- likely yielding sub-optimal human-designed features.
| cs.LG cs.CV | the purpose of this study was to investigate the use of deep learning for coniferousdeciduous classification of individual trees from airborne lidar data to enable efficient processing by a deep convolutional neural network cnn we designed two discrete representations using leafoff and leafon lidar data a digital surface model with four channels dsmx4 and a set of four 2d views 4x2d a training dataset of labeled tree crowns was generated via segmentation of tree crowns followed by coregistration with field data potential mislabels due to gps error or tree leaning were corrected using a statistical ensemble filtering procedure because the training data was heavily unbalanced 8 conifers we trained an ensemble of cnns on random balanced subsamples of augmented data 180 rotational variations per instance the 4x2d representation yielded similar classification accuracies to the dsmx4 representation 82 coniferous and 90 deciduous while converging faster the data augmentation improved the classification accuracies but more real training instances especially coniferous likely results in much stronger improvements leafoff lidar data were the primary source of useful information which is likely due to the perennial nature of coniferous foliage lidar intensity values also proved to be useful but normalization yielded no significant improvements lastly the classification accuracies of overstory trees 90 were more balanced than those of understory trees 90 deciduous and 65 coniferous which is likely due to the incomplete capture of understory tree crowns via airborne lidar automatic derivation of optimal features via deep learning provide the opportunity for remarkable improvements in prediction tasks where captured data are not friendly to human visual system likely yielding suboptimal humandesigned features | [['the', 'purpose', 'of', 'this', 'study', 'was', 'to', 'investigate', 'the', 'use', 'of', 'deep', 'learning', 'for', 'coniferousdeciduous', 'classification', 'of', 'individual', 'trees', 'from', 'airborne', 'lidar', 'data', 'to', 'enable', 'efficient', 'processing', 'by', 'a', 'deep', 'convolutional', 'neural', 'network', 'cnn', 'we', 'designed', 'two', 'discrete', 'representations', 'using', 'leafoff', 'and', 'leafon', 'lidar', 'data', 'a', 'digital', 'surface', 'model', 'with', 'four', 'channels', 'dsmx4', 'and', 'a', 'set', 'of', 'four', '2d', 'views', '4x2d', 'a', 'training', 'dataset', 'of', 'labeled', 'tree', 'crowns', 'was', 'generated', 'via', 'segmentation', 'of', 'tree', 'crowns', 'followed', 'by', 'coregistration', 'with', 'field', 'data', 'potential', 'mislabels', 'due', 'to', 'gps', 'error', 'or', 'tree', 'leaning', 'were', 'corrected', 'using', 'a', 'statistical', 'ensemble', 'filtering', 'procedure', 'because', 'the', 'training', 'data', 'was', 'heavily', 'unbalanced', '8', 'conifers', 'we', 'trained', 'an', 'ensemble', 'of', 'cnns', 'on', 'random', 'balanced', 'subsamples', 'of', 'augmented', 'data', '180', 'rotational', 'variations', 'per', 'instance', 'the', '4x2d', 'representation', 'yielded', 'similar', 'classification', 'accuracies', 'to', 'the', 'dsmx4', 'representation', '82', 'coniferous', 'and', '90', 'deciduous', 'while', 'converging', 'faster', 'the', 'data', 'augmentation', 'improved', 'the', 'classification', 'accuracies', 'but', 'more', 'real', 'training', 'instances', 'especially', 'coniferous', 'likely', 'results', 'in', 'much', 'stronger', 'improvements', 'leafoff', 'lidar', 'data', 'were', 'the', 'primary', 'source', 'of', 'useful', 'information', 'which', 'is', 'likely', 'due', 'to', 'the', 'perennial', 'nature', 'of', 'coniferous', 'foliage', 'lidar', 'intensity', 'values', 'also', 'proved', 'to', 'be', 'useful', 'but', 'normalization', 'yielded', 'no', 'significant', 'improvements', 'lastly', 'the', 'classification', 'accuracies', 'of', 'overstory', 'trees', '90', 'were', 'more', 'balanced', 'than', 'those', 'of', 'understory', 'trees', '90', 'deciduous', 'and', '65', 'coniferous', 'which', 'is', 'likely', 'due', 'to', 'the', 'incomplete', 'capture', 'of', 'understory', 'tree', 'crowns', 'via', 'airborne', 'lidar', 'automatic', 'derivation', 'of', 'optimal', 'features', 'via', 'deep', 'learning', 'provide', 'the', 'opportunity', 'for', 'remarkable', 'improvements', 'in', 'prediction', 'tasks', 'where', 'captured', 'data', 'are', 'not', 'friendly', 'to', 'human', 'visual', 'system', 'likely', 'yielding', 'suboptimal', 'humandesigned', 'features']] | [-0.03861897479532583, 0.05137454954403813, -0.05819805019991726, 0.08189541537537519, -0.09947795843694664, -0.16241437737405995, 0.08540321856235238, 0.4291986506142389, -0.2170206696295147, -0.37095073675048257, 0.11477629498738057, -0.29801559435196423, -0.13974365399577854, 0.2192040614961331, -0.13437652026209346, 0.09497381089911353, 0.18460326371460806, 0.04341224897736665, -0.03955673841045669, -0.29776247788459814, 0.23504072989623429, 0.08687588206280823, 0.3508211875077091, -0.029614514806253496, 0.1330484423531828, -0.005846207151515591, -0.0946665100453436, -0.013125247279895969, -0.023114009936075614, 0.16863993526407398, 0.30447474260477475, 0.18691493887526747, 0.2573348988519786, -0.383271966844114, -0.20135085323394245, 0.11597790781423044, 0.14043182208237207, 0.10226032024445121, -0.012333334759824477, -0.3507104875983721, 0.08993888076970984, -0.14571908651579332, -0.001520347676501729, -0.09874084608716317, 0.0020155480520161963, -0.021352205201050318, -0.283541203878733, 0.05165795105904004, 0.059024272061221246, 0.12876595269910382, -0.053733559972642835, -0.1544448997927757, -0.0384777534634404, 0.13688014307265906, -0.03567019584355423, 0.09622151299030067, 0.13448699565191213, -0.17291246706000185, -0.11054056190526845, 0.35844012329188185, -0.04469252404819581, -0.1478316476070304, 0.202396708303258, -0.051922932357784606, -0.1483771251106874, 0.1979172873104187, 0.2182702996468186, 0.09000007979252923, -0.19682140582411436, -0.04778516503387939, -0.00813372025505462, 0.1613158117486019, 0.115354262540617, -0.03531819990027971, 0.1789706734725698, 0.22566550175826056, 0.02156732625559929, 0.1258095230002152, -0.1897500870916503, -0.03360489042156923, -0.14020937490222635, -0.06805989544309589, -0.15530013797917053, 0.0029586776040683785, -0.12310492175025141, -0.1415159958242602, 0.36066892926838495, 0.20556762554421876, 0.2078705894658188, 0.09676411650360993, 0.3209270552916865, 0.014848449330467545, 0.12120881968210469, 0.08171058801077088, 0.18233201291470097, 0.05893229525028963, 0.09544319443083966, -0.10554431295040488, 0.07671456612784285, 0.028422974765297128] |
1,802.08873 | On the Convergence Rates of GMsFEMs for Heterogeneous Elliptic Problems
without Oversampling Techniques | This work is concerned with the rigorous analysis on the Generalized
Multiscale Finite Element Methods (GMsFEMs) for elliptic problems with
high-contrast heterogeneous coefficients. GMsFEMs are popular numerical methods
for solving flow problems with heterogeneous high-contrast coefficients, and it
has demonstrated extremely promising numerical results for a wide range of
applications. However, the mathematical justification of the efficiency of the
method is still largely missing.
In this work, we analyze two types of multiscale basis functions, i.e., local
spectral basis functions and basis functions of local harmonic extension type,
within the GMsFEM framework. These constructions have found many applications
in the past few years. We establish their optimal convergence in the energy
norm under a very mild assumption that the source term belongs to some weighted
$L^2$ space, and without the help of any oversampling technique. Furthermore,
we analyze the model order reduction of the local harmonic extension basis and
prove its convergence in the energy norm. These theoretical findings shed
insights into the mechanism behind the efficiency of the GMsFEMs.
| math.NA | this work is concerned with the rigorous analysis on the generalized multiscale finite element methods gmsfems for elliptic problems with highcontrast heterogeneous coefficients gmsfems are popular numerical methods for solving flow problems with heterogeneous highcontrast coefficients and it has demonstrated extremely promising numerical results for a wide range of applications however the mathematical justification of the efficiency of the method is still largely missing in this work we analyze two types of multiscale basis functions ie local spectral basis functions and basis functions of local harmonic extension type within the gmsfem framework these constructions have found many applications in the past few years we establish their optimal convergence in the energy norm under a very mild assumption that the source term belongs to some weighted l2 space and without the help of any oversampling technique furthermore we analyze the model order reduction of the local harmonic extension basis and prove its convergence in the energy norm these theoretical findings shed insights into the mechanism behind the efficiency of the gmsfems | [['this', 'work', 'is', 'concerned', 'with', 'the', 'rigorous', 'analysis', 'on', 'the', 'generalized', 'multiscale', 'finite', 'element', 'methods', 'gmsfems', 'for', 'elliptic', 'problems', 'with', 'highcontrast', 'heterogeneous', 'coefficients', 'gmsfems', 'are', 'popular', 'numerical', 'methods', 'for', 'solving', 'flow', 'problems', 'with', 'heterogeneous', 'highcontrast', 'coefficients', 'and', 'it', 'has', 'demonstrated', 'extremely', 'promising', 'numerical', 'results', 'for', 'a', 'wide', 'range', 'of', 'applications', 'however', 'the', 'mathematical', 'justification', 'of', 'the', 'efficiency', 'of', 'the', 'method', 'is', 'still', 'largely', 'missing', 'in', 'this', 'work', 'we', 'analyze', 'two', 'types', 'of', 'multiscale', 'basis', 'functions', 'ie', 'local', 'spectral', 'basis', 'functions', 'and', 'basis', 'functions', 'of', 'local', 'harmonic', 'extension', 'type', 'within', 'the', 'gmsfem', 'framework', 'these', 'constructions', 'have', 'found', 'many', 'applications', 'in', 'the', 'past', 'few', 'years', 'we', 'establish', 'their', 'optimal', 'convergence', 'in', 'the', 'energy', 'norm', 'under', 'a', 'very', 'mild', 'assumption', 'that', 'the', 'source', 'term', 'belongs', 'to', 'some', 'weighted', 'l2', 'space', 'and', 'without', 'the', 'help', 'of', 'any', 'oversampling', 'technique', 'furthermore', 'we', 'analyze', 'the', 'model', 'order', 'reduction', 'of', 'the', 'local', 'harmonic', 'extension', 'basis', 'and', 'prove', 'its', 'convergence', 'in', 'the', 'energy', 'norm', 'these', 'theoretical', 'findings', 'shed', 'insights', 'into', 'the', 'mechanism', 'behind', 'the', 'efficiency', 'of', 'the', 'gmsfems']] | [-0.0773548658389379, 0.014644733252113356, -0.09911469260593603, 0.07971777888665468, -0.07028670473681653, -0.10394569787963787, 0.017339902079445035, 0.3802593160858926, -0.3002946794087834, -0.2623930090709644, 0.14508528030093978, -0.2259344372268328, -0.1652848814285415, 0.23965603966019391, -0.05625551234834882, 0.10929512102670474, 0.10072315777925885, -0.007781538627493908, -0.09211408145253218, -0.2423904569258037, 0.31757272823905464, 0.039456727826173474, 0.3006519352702205, 0.08200937230790527, 0.09554344388272833, -0.02417138146017404, -0.07955023969852311, -0.0031371855041738054, -0.13231027080452323, 0.17894308326854919, 0.25682670395437845, 0.09321197245290558, 0.3523569688420085, -0.42825768509989276, -0.2542634931995588, 0.11569767150178771, 0.12949566044844688, 0.07025019576060859, -0.07755712833296617, -0.22140589092365082, 0.11207739376627347, -0.14318410427145223, -0.15772223050760872, -0.12020279514014393, -0.027835083607693805, 0.06911070093423512, -0.2898458528058494, 0.07881766571389402, 0.06366267087458469, 0.06881616324295893, -0.09857447298092986, -0.1395227591479745, 0.05879824673483039, 0.07775434644838028, 0.05252053818103912, -0.009540380757329438, 0.05432802160160945, -0.11244615496355383, -0.09400666704237023, 0.36028834677246563, -0.045729697101941226, -0.23457748729817787, 0.1924102899892365, -0.11144601049771367, -0.14687348223729607, 0.10634688569013687, 0.18379207549287993, 0.14946399116888642, -0.14077087874688646, 0.11182640616864185, -0.046950752131969614, 0.14696887172210743, 0.041482704098555534, 0.0662362795213566, 0.12144359340480364, 0.17285657647504088, 0.08348570283920066, 0.10679026533548228, -0.04953701574875809, -0.11299504419610672, -0.3042545039425878, -0.13297242422259467, -0.17018117128926166, -0.010811016240896767, -0.13339844288489344, -0.15949658893377466, 0.4118073725168977, 0.13921638844425188, 0.15756381016005488, 0.04443014366004397, 0.2795359462883104, 0.13103752430418836, 0.05119183946756975, 0.06665903771405711, 0.22058595586653718, 0.1486989958170692, 0.10913683369700962, -0.20089145680232084, 0.042638133002636844, 0.11904158143271856] |
1,802.08874 | Phase-locked bi-frequency Raman lasing in a double-$\Lambda$ system | We show that it is possible to realize simultaneous Raman lasing at two
different frequencies using a double-$\Lambda$ system pumped by a bi-frequency
field. The Raman lasers are phase-locked to one another, and the beat-frequency
matches the energy difference between the two meta-stable ground states. Akin
to a conventional Raman laser, the phase-locked Raman laser pair is expected to
be subluminal. As such, it is expected to be highly stable against
perturbations in cavity length, and have a quantum noise limited linewidth that
is far below that of a conventional laser. Because of these properties, the
phase-locked Raman laser pair may find important applications in precision
metrology, including atomic interferometry and magnetometry. To elucidate the
behavior of this laser pair, we develop an analytical model that describes the
stimulated Raman interaction in a double-$\Lambda$ system using an effective
2-level transition. The approximation is valid as long as the excited states
adiabatically follow the ground states, as verified by numerical simulations.
The effective model is used to identify the optimal operating conditions for
the bi-frequency Raman lasing process. This model may also prove useful in
other potential applications of the double-$\Lambda$ system, including
generation of squeezed light and spatial solitons.
| quant-ph | we show that it is possible to realize simultaneous raman lasing at two different frequencies using a doublelambda system pumped by a bifrequency field the raman lasers are phaselocked to one another and the beatfrequency matches the energy difference between the two metastable ground states akin to a conventional raman laser the phaselocked raman laser pair is expected to be subluminal as such it is expected to be highly stable against perturbations in cavity length and have a quantum noise limited linewidth that is far below that of a conventional laser because of these properties the phaselocked raman laser pair may find important applications in precision metrology including atomic interferometry and magnetometry to elucidate the behavior of this laser pair we develop an analytical model that describes the stimulated raman interaction in a doublelambda system using an effective 2level transition the approximation is valid as long as the excited states adiabatically follow the ground states as verified by numerical simulations the effective model is used to identify the optimal operating conditions for the bifrequency raman lasing process this model may also prove useful in other potential applications of the doublelambda system including generation of squeezed light and spatial solitons | [['we', 'show', 'that', 'it', 'is', 'possible', 'to', 'realize', 'simultaneous', 'raman', 'lasing', 'at', 'two', 'different', 'frequencies', 'using', 'a', 'doublelambda', 'system', 'pumped', 'by', 'a', 'bifrequency', 'field', 'the', 'raman', 'lasers', 'are', 'phaselocked', 'to', 'one', 'another', 'and', 'the', 'beatfrequency', 'matches', 'the', 'energy', 'difference', 'between', 'the', 'two', 'metastable', 'ground', 'states', 'akin', 'to', 'a', 'conventional', 'raman', 'laser', 'the', 'phaselocked', 'raman', 'laser', 'pair', 'is', 'expected', 'to', 'be', 'subluminal', 'as', 'such', 'it', 'is', 'expected', 'to', 'be', 'highly', 'stable', 'against', 'perturbations', 'in', 'cavity', 'length', 'and', 'have', 'a', 'quantum', 'noise', 'limited', 'linewidth', 'that', 'is', 'far', 'below', 'that', 'of', 'a', 'conventional', 'laser', 'because', 'of', 'these', 'properties', 'the', 'phaselocked', 'raman', 'laser', 'pair', 'may', 'find', 'important', 'applications', 'in', 'precision', 'metrology', 'including', 'atomic', 'interferometry', 'and', 'magnetometry', 'to', 'elucidate', 'the', 'behavior', 'of', 'this', 'laser', 'pair', 'we', 'develop', 'an', 'analytical', 'model', 'that', 'describes', 'the', 'stimulated', 'raman', 'interaction', 'in', 'a', 'doublelambda', 'system', 'using', 'an', 'effective', '2level', 'transition', 'the', 'approximation', 'is', 'valid', 'as', 'long', 'as', 'the', 'excited', 'states', 'adiabatically', 'follow', 'the', 'ground', 'states', 'as', 'verified', 'by', 'numerical', 'simulations', 'the', 'effective', 'model', 'is', 'used', 'to', 'identify', 'the', 'optimal', 'operating', 'conditions', 'for', 'the', 'bifrequency', 'raman', 'lasing', 'process', 'this', 'model', 'may', 'also', 'prove', 'useful', 'in', 'other', 'potential', 'applications', 'of', 'the', 'doublelambda', 'system', 'including', 'generation', 'of', 'squeezed', 'light', 'and', 'spatial', 'solitons']] | [-0.12371492479815517, 0.21444837497585295, -0.0822845281022203, 0.04764822603649018, 0.010830133739038694, -0.1698673522619334, 0.057116581806819416, 0.44346401144062453, -0.2659697532969709, -0.2411171744703947, 0.04338704977633815, -0.26475401448282465, -0.11292930022490459, 0.25074605631815206, 0.012375423925736892, 0.07432996998710707, 0.03075542578113326, 0.003514000969288412, 0.024997265112349978, -0.1351048142880894, 0.27874843805593125, 0.057071779425789476, 0.3269289637068708, 0.027380049605409254, 0.09363731811403404, -0.015717030804716613, 0.08828323571498145, -0.06255114666331353, -0.09294128152568142, 0.0666698006958111, 0.2713670826828705, 0.023968241610985493, 0.25083174384035284, -0.4152219165958951, -0.24308296496088935, 0.07125980074546825, 0.15089617456407778, 0.1904921631864623, -0.048389287535030974, -0.30277009644831093, 0.028122352020833734, -0.13198586503727053, -0.15265142788230698, -0.12272327072712494, -0.0035498173194867207, 0.032383381224111024, -0.28463626674484066, 0.0030800664106245858, 0.018873689592793706, 0.030402631470793157, -0.05195550531167631, -0.028672661796684876, -0.035152751406895735, 0.08596198869712332, -0.013346771758322338, 0.012576732102397773, 0.1596636150038717, -0.11007345741352619, -0.13895953185247942, 0.38782486353238027, -0.13104149706816143, -0.09829639445934164, 0.2017423494107057, -0.1216064281644646, -0.04581774718563386, 0.15685501881411776, 0.1043636902149453, 0.12098644848856795, -0.1213968663275167, 0.0026564454816600034, -0.010960827979385553, 0.22850167670816032, 0.13150216238666793, 0.1330405732911623, 0.20785420412787392, 0.18719347898647115, 0.04851063039626496, 0.16672739188038235, -0.09472705566338334, -0.07651232379101376, -0.25782831468099926, -0.09278632071449529, -0.18747698441241403, 0.04732646095688132, -0.029651352725088703, -0.1295412223570835, 0.39341380674597903, 0.15935978651981, 0.1382294902156795, -0.048460013336085496, 0.3404817225612775, 0.17877562359050292, 0.02862399243445477, -0.005931017542463826, 0.32861954550815736, 0.1566640440445983, 0.08225698221531046, -0.284978024654521, -0.0025120617063650536, -0.0034942746188154623] |
1,802.08875 | Dynamics of large-scale solar-wind streams obtained by the double
superposed epoch analysis. 3. Deflection of speed vector | This work is a continuation of our previous articles (Yermolaev et al. in J.
Geophys.Res. 120, 7094, 2015, Yermolaev et al. in Solar Phys. 292, 193, 2017),
which describe the average temporal profiles of interplanetary plasma and field
parameters in large-scale solar-wind (SW) streams: corotating interaction
regions (CIRs), interplanetary coronal mass ejections (ICMEs including both
magnetic clouds (MCs) and ejecta), and sheaths as well as interplanetary shocks
(ISs). Changes of longitude angle {\phi} in CIRs from -2 to +2{\deg} agree with
earlier observations. Besides we have for the first time analyzed the average
temporal profiles of bulk velocity angles in Sheaths and ICMEs and found that
the angle {\phi} in ICME changes from 2 to -2{\deg} while in Sheath it changes
from -2 to 2{\deg} (similar to change in CIR), i.e., the streams in CIR/Sheath
and ICME deflects in the opposite side. When averaging the latitude angle
{\theta} on all intervals of the chosen SW type, the angle {\theta} is almost
constant ~1{\deg}. We made selection of SW events with increasing and
decreasing angle {\theta} for the first time and found that average temporal
profiles for angle {\theta} in selected events have the same <<integral-like>>
shape as for angle {\phi}. The difference in average profiles for angles {\phi}
and {\theta} is explained by the fact that most events have increasing profiles
for angle in ecliptic plane due to solar rotation while for angle in meridional
plane numbers of increasing and decreasing profiles are equal.
| physics.space-ph | this work is a continuation of our previous articles yermolaev et al in j geophysres 120 7094 2015 yermolaev et al in solar phys 292 193 2017 which describe the average temporal profiles of interplanetary plasma and field parameters in largescale solarwind sw streams corotating interaction regions cirs interplanetary coronal mass ejections icmes including both magnetic clouds mcs and ejecta and sheaths as well as interplanetary shocks iss changes of longitude angle phi in cirs from 2 to 2deg agree with earlier observations besides we have for the first time analyzed the average temporal profiles of bulk velocity angles in sheaths and icmes and found that the angle phi in icme changes from 2 to 2deg while in sheath it changes from 2 to 2deg similar to change in cir ie the streams in cirsheath and icme deflects in the opposite side when averaging the latitude angle theta on all intervals of the chosen sw type the angle theta is almost constant 1deg we made selection of sw events with increasing and decreasing angle theta for the first time and found that average temporal profiles for angle theta in selected events have the same integrallike shape as for angle phi the difference in average profiles for angles phi and theta is explained by the fact that most events have increasing profiles for angle in ecliptic plane due to solar rotation while for angle in meridional plane numbers of increasing and decreasing profiles are equal | [['this', 'work', 'is', 'a', 'continuation', 'of', 'our', 'previous', 'articles', 'yermolaev', 'et', 'al', 'in', 'j', 'geophysres', '120', '7094', '2015', 'yermolaev', 'et', 'al', 'in', 'solar', 'phys', '292', '193', '2017', 'which', 'describe', 'the', 'average', 'temporal', 'profiles', 'of', 'interplanetary', 'plasma', 'and', 'field', 'parameters', 'in', 'largescale', 'solarwind', 'sw', 'streams', 'corotating', 'interaction', 'regions', 'cirs', 'interplanetary', 'coronal', 'mass', 'ejections', 'icmes', 'including', 'both', 'magnetic', 'clouds', 'mcs', 'and', 'ejecta', 'and', 'sheaths', 'as', 'well', 'as', 'interplanetary', 'shocks', 'iss', 'changes', 'of', 'longitude', 'angle', 'phi', 'in', 'cirs', 'from', '2', 'to', '2deg', 'agree', 'with', 'earlier', 'observations', 'besides', 'we', 'have', 'for', 'the', 'first', 'time', 'analyzed', 'the', 'average', 'temporal', 'profiles', 'of', 'bulk', 'velocity', 'angles', 'in', 'sheaths', 'and', 'icmes', 'and', 'found', 'that', 'the', 'angle', 'phi', 'in', 'icme', 'changes', 'from', '2', 'to', '2deg', 'while', 'in', 'sheath', 'it', 'changes', 'from', '2', 'to', '2deg', 'similar', 'to', 'change', 'in', 'cir', 'ie', 'the', 'streams', 'in', 'cirsheath', 'and', 'icme', 'deflects', 'in', 'the', 'opposite', 'side', 'when', 'averaging', 'the', 'latitude', 'angle', 'theta', 'on', 'all', 'intervals', 'of', 'the', 'chosen', 'sw', 'type', 'the', 'angle', 'theta', 'is', 'almost', 'constant', '1deg', 'we', 'made', 'selection', 'of', 'sw', 'events', 'with', 'increasing', 'and', 'decreasing', 'angle', 'theta', 'for', 'the', 'first', 'time', 'and', 'found', 'that', 'average', 'temporal', 'profiles', 'for', 'angle', 'theta', 'in', 'selected', 'events', 'have', 'the', 'same', 'integrallike', 'shape', 'as', 'for', 'angle', 'phi', 'the', 'difference', 'in', 'average', 'profiles', 'for', 'angles', 'phi', 'and', 'theta', 'is', 'explained', 'by', 'the', 'fact', 'that', 'most', 'events', 'have', 'increasing', 'profiles', 'for', 'angle', 'in', 'ecliptic', 'plane', 'due', 'to', 'solar', 'rotation', 'while', 'for', 'angle', 'in', 'meridional', 'plane', 'numbers', 'of', 'increasing', 'and', 'decreasing', 'profiles', 'are', 'equal']] | [-0.17056692720398586, 0.1893654281922705, -0.0053870956649176805, 0.05301576536206753, -0.04237979421531202, -0.07465864178295638, 0.025273283544533665, 0.4363071747642026, -0.21070136265859155, -0.3839917229411204, 0.017953791546430516, -0.28113256811132437, -0.10458217746446767, 0.19609313332031314, -0.03832854012643756, 0.01753757794578927, 0.02686201904985389, -0.05025776724390979, -0.09051307538404474, -0.1793756771516789, 0.22022254435399632, 0.106391645407138, 0.18786877497638907, 0.003951989467877941, 0.07227455121291129, -0.0009185012075332712, -0.04038867962071324, 0.03881640034376091, -0.13279842133446007, 0.0007552800957474344, 0.1904061507084407, 0.07460781878644902, 0.15625751627555032, -0.40237808712715617, -0.2094747579455592, -0.018812872609510027, 0.16547055004543287, -0.03331729769561811, -0.024505381375315494, -0.28003792559700974, 0.04252349594955746, -0.15640625211082232, -0.16734373396363, 0.094540386588247, 0.1459226253769975, 0.08499096915139372, -0.29448352366129393, 0.13850364916623645, -0.005285475093434677, 0.1315967369741563, -0.07795907101686657, -0.1173244639979946, -0.07934210328501166, 0.09742730611481673, 0.13956655885858066, 0.1441648694115625, 0.16899414467760573, -0.11007161518554995, -0.049622700781526655, 0.3499943168410699, -0.05062338259820807, -0.11859300966989017, 0.15355367924538885, -0.253773663604547, -0.10598911878679922, 0.1709544830192344, 0.17532742547433577, 0.0850919187861143, -0.08398922286181144, 0.03571106977441978, -0.07167928811757829, 0.16540300488835238, 0.16221088879061593, -0.031607224619502966, 0.20989924771286145, 0.013517086570927896, 0.05811912612023443, 0.07767326565105777, -0.21933377627379946, -0.07419678822248649, -0.23558050761949967, -0.13396583974392334, -0.08399909691879318, -0.011850149175577267, -0.11666234306490177, -0.11355797143718731, 0.38825965152968384, 0.15758855802903562, 0.25300572519248576, -0.019437853428071434, 0.2712497004729027, 0.06481389521598947, 0.04134970251458728, 0.14390140102550203, 0.30404601489866145, 0.13722066896198573, 0.20605038596448563, -0.19364636465501334, 0.12684390148731467, 0.028765799263040574] |
1,802.08876 | Lov\'asz Meets Weisfeiler and Leman | In this paper, we relate a beautiful theory by Lov\'asz with a popular
heuristic algorithm for the graph isomorphism problem, namely the color
refinement algorithm and its k-dimensional generalization known as the
Weisfeiler-Leman algorithm. We prove that two graphs G and H are
indistinguishable by the color refinement algorithm if and only if, for all
trees T, the number Hom(T,G) of homomorphisms from T to G equals the
corresponding number Hom(T,H) for H.
There is a natural system of linear equations whose nonnegative integer
solutions correspond to the isomorphisms between two graphs. The nonnegative
real solutions to this system are called fractional isomorphisms, and two
graphs are fractionally isomorphic if and only if the color refinement
algorithm cannot distinguish them (Tinhofer 1986, 1991). We show that, if we
drop the nonnegativity constraints, that is, if we look for arbitrary real
solutions, then a solution to the linear system exists if and only if, for all
t, the two graphs have the same number of length-t walks.
We lift the results for trees to an equivalence between numbers of
homomorphisms from graphs of tree width k, the k-dimensional Weisfeiler-Leman
algorithm, and the level-k Sherali-Adams relaxation of our linear program. We
also obtain a partial result for graphs of bounded path width and solutions to
our system where we drop the nonnegativity constraints. A consequence of our
results is a quasi-linear time algorithm to decide whether, for two given
graphs G and H, there is a tree T with Hom(T,G) = Hom(T,H).
| cs.DS math.CO | in this paper we relate a beautiful theory by lovasz with a popular heuristic algorithm for the graph isomorphism problem namely the color refinement algorithm and its kdimensional generalization known as the weisfeilerleman algorithm we prove that two graphs g and h are indistinguishable by the color refinement algorithm if and only if for all trees t the number homtg of homomorphisms from t to g equals the corresponding number homth for h there is a natural system of linear equations whose nonnegative integer solutions correspond to the isomorphisms between two graphs the nonnegative real solutions to this system are called fractional isomorphisms and two graphs are fractionally isomorphic if and only if the color refinement algorithm cannot distinguish them tinhofer 1986 1991 we show that if we drop the nonnegativity constraints that is if we look for arbitrary real solutions then a solution to the linear system exists if and only if for all t the two graphs have the same number of lengtht walks we lift the results for trees to an equivalence between numbers of homomorphisms from graphs of tree width k the kdimensional weisfeilerleman algorithm and the levelk sheraliadams relaxation of our linear program we also obtain a partial result for graphs of bounded path width and solutions to our system where we drop the nonnegativity constraints a consequence of our results is a quasilinear time algorithm to decide whether for two given graphs g and h there is a tree t with homtg homth | [['in', 'this', 'paper', 'we', 'relate', 'a', 'beautiful', 'theory', 'by', 'lovasz', 'with', 'a', 'popular', 'heuristic', 'algorithm', 'for', 'the', 'graph', 'isomorphism', 'problem', 'namely', 'the', 'color', 'refinement', 'algorithm', 'and', 'its', 'kdimensional', 'generalization', 'known', 'as', 'the', 'weisfeilerleman', 'algorithm', 'we', 'prove', 'that', 'two', 'graphs', 'g', 'and', 'h', 'are', 'indistinguishable', 'by', 'the', 'color', 'refinement', 'algorithm', 'if', 'and', 'only', 'if', 'for', 'all', 'trees', 't', 'the', 'number', 'homtg', 'of', 'homomorphisms', 'from', 't', 'to', 'g', 'equals', 'the', 'corresponding', 'number', 'homth', 'for', 'h', 'there', 'is', 'a', 'natural', 'system', 'of', 'linear', 'equations', 'whose', 'nonnegative', 'integer', 'solutions', 'correspond', 'to', 'the', 'isomorphisms', 'between', 'two', 'graphs', 'the', 'nonnegative', 'real', 'solutions', 'to', 'this', 'system', 'are', 'called', 'fractional', 'isomorphisms', 'and', 'two', 'graphs', 'are', 'fractionally', 'isomorphic', 'if', 'and', 'only', 'if', 'the', 'color', 'refinement', 'algorithm', 'can', 'not', 'distinguish', 'them', 'tinhofer', '1986', '1991', 'we', 'show', 'that', 'if', 'we', 'drop', 'the', 'nonnegativity', 'constraints', 'that', 'is', 'if', 'we', 'look', 'for', 'arbitrary', 'real', 'solutions', 'then', 'a', 'solution', 'to', 'the', 'linear', 'system', 'exists', 'if', 'and', 'only', 'if', 'for', 'all', 't', 'the', 'two', 'graphs', 'have', 'the', 'same', 'number', 'of', 'lengtht', 'walks', 'we', 'lift', 'the', 'results', 'for', 'trees', 'to', 'an', 'equivalence', 'between', 'numbers', 'of', 'homomorphisms', 'from', 'graphs', 'of', 'tree', 'width', 'k', 'the', 'kdimensional', 'weisfeilerleman', 'algorithm', 'and', 'the', 'levelk', 'sheraliadams', 'relaxation', 'of', 'our', 'linear', 'program', 'we', 'also', 'obtain', 'a', 'partial', 'result', 'for', 'graphs', 'of', 'bounded', 'path', 'width', 'and', 'solutions', 'to', 'our', 'system', 'where', 'we', 'drop', 'the', 'nonnegativity', 'constraints', 'a', 'consequence', 'of', 'our', 'results', 'is', 'a', 'quasilinear', 'time', 'algorithm', 'to', 'decide', 'whether', 'for', 'two', 'given', 'graphs', 'g', 'and', 'h', 'there', 'is', 'a', 'tree', 't', 'with', 'homtg', 'homth']] | [-0.1284444713347917, 0.10236378940179744, -0.07647103200251439, 0.05687310995490114, -0.10067475129322834, -0.1716700406337389, 0.03542727171387299, 0.3666157632258283, -0.34419072778469106, -0.31378194544441906, 0.11292691924281972, -0.2885674057719129, -0.171412568776887, 0.1613714420339504, -0.07425938234346578, 0.03788689566176781, 0.0921895685727263, 0.08305814242491641, -0.033734482949614585, -0.2987557209147576, 0.32124689432519327, -0.06788380027759865, 0.16877661903069008, 0.07210130519401955, 0.13478680144449373, -0.0014673572206162814, 0.010507729723600739, 0.07965544116193331, -0.16766336441914206, 0.053830202243919205, 0.24495190641577225, 0.18217673575614082, 0.2412979706124137, -0.3589923498837883, -0.10490175974312198, 0.2208285442872317, 0.097485179093715, 0.06195066110174879, 0.0025843317315625736, -0.2151077866860961, 0.16403399398138963, -0.10180965910972392, -0.05450260321643338, -0.03600809390630468, 0.09974162432600756, 0.012892233013328779, -0.30561862137340695, -3.6041548963725924e-06, 0.12706230204256933, 0.01112967564746126, -0.02616404502673157, -0.1230459126071578, -0.04780732933408487, 0.0921097258031069, -0.023753695553692288, 0.055072916789451636, 0.01945471255404194, -0.09829931306310492, -0.18167634921926393, 0.36472385398385276, -0.05908521964218483, -0.2083775398338281, 0.15587286534952935, -0.12463729865624602, -0.18242370220832527, 0.10657899133977013, 0.11987634652095985, 0.16678326211525613, -0.0797093006965506, 0.13418774211561368, -0.14503075149523686, 0.1322371815462189, 0.10547831530185289, -0.014231228516493217, 0.11813709376292536, 0.10046768237006323, 0.15849041558117663, 0.15638489983078227, 0.009304832303256029, -0.027295211768717537, -0.3047503774572373, -0.14361736207198067, -0.17954677070610703, 0.04440355409002427, -0.1491762193876069, -0.18823840264904212, 0.3648764188158285, 0.11468642407628038, 0.20346209642021024, 0.16749389582579155, 0.24603580859401844, 0.10209527534402787, 0.02597248495133766, 0.1507711198375407, 0.1221018995524919, 0.1898020020504688, 0.007606692503703885, -0.1827010049631475, 0.034535120694849444, 0.17406701110881972] |
1,802.08877 | Exponents of Bogomolov multipliers | We prove that if $G$ is a finite group, then the exponent of its Bogomolov
multiplier divides the exponent of $G$ in the following four cases: (i) $G$ is
metabelian, (ii) $\exp G=4$, (iii) $G$ is nilpotent of class $\le 5$, or (iv)
$G$ is a $4$-Engel group.
| math.GR | we prove that if g is a finite group then the exponent of its bogomolov multiplier divides the exponent of g in the following four cases i g is metabelian ii exp g4 iii g is nilpotent of class le 5 or iv g is a 4engel group | [['we', 'prove', 'that', 'if', 'g', 'is', 'a', 'finite', 'group', 'then', 'the', 'exponent', 'of', 'its', 'bogomolov', 'multiplier', 'divides', 'the', 'exponent', 'of', 'g', 'in', 'the', 'following', 'four', 'cases', 'i', 'g', 'is', 'metabelian', 'ii', 'exp', 'g4', 'iii', 'g', 'is', 'nilpotent', 'of', 'class', 'le', '5', 'or', 'iv', 'g', 'is', 'a', '4engel', 'group']] | [-0.23387598430660242, 0.13397017542350417, -0.09803586209212274, -0.012078159886489933, -0.1150745273650197, -0.23161078276461922, 0.0037463462164547914, 0.3619421316155543, -0.2827302558289375, -0.21348568057874218, 0.08704635180038167, -0.29386693704873323, -0.10969268832801997, 0.16636968490881068, -0.12139474870249008, -0.12407217693908024, 0.0001469258665262411, 0.17213488083022335, -0.0859490136548023, -0.29313341753246885, 0.3286025231548895, -0.11971851114261274, 0.1560391004944298, 0.01599564082183254, 0.06299903482431546, -0.02994538049097173, -0.00613182252466989, 0.004257726771925263, -0.17515893923291515, 0.00047273782547563314, 0.23818559556578597, 0.10179017307139777, 0.2989814735483378, -0.2358467218776544, -0.13435092938986296, 0.21999049031486115, 0.1398539344469706, -0.09415596203568082, -0.022466839724074816, -0.1879879521438852, 0.22114270617021248, -0.20663931500166655, -0.14933951561882472, 0.07857634586980566, 0.24964951071888208, -0.01160729888821758, -0.31670072555425577, 0.06144517858047038, 0.115065472467298, 0.11113369218461837, 0.05710345176582147, -0.14909022480333078, -0.05480463810575505, 0.07012751824125492, -0.05736367903106535, 0.03932265915015402, 0.10618926826282404, -0.0753229307786872, -0.037804687968067206, 0.40538855313207023, -0.08335164637537673, -0.10790041480019379, 0.07756147127171668, -0.21165626561075138, -0.21096189194940962, 0.11125516706185105, 0.01325769275717903, 0.21363675533333057, 0.017021701554767787, 0.2918629952861617, -0.11696504793750744, 0.12275472768427183, 0.005040214261195312, -0.10834330945848099, 0.039617897350884355, 0.0827007999032503, 0.12362046758668536, 0.0491448628793781, -0.028223097091540694, 0.1842062787230437, -0.42039638509353, -0.21038013310559714, -0.1593892277451232, 0.14778163699277988, -0.13216712686698884, -0.11450760202327122, 0.42399619286879897, 0.03290010961548736, 0.08997611444889723, 0.10891068975130717, 0.11522333116348212, 0.09592550048061337, 0.023855150347420324, 0.17105422265982875, 0.10792992869392037, 0.23337833648353504, -0.1314493836641001, -0.21422427323219986, -0.027481915283715352, 0.26093494917828747] |
1,802.08878 | Tales from the prehistory of Quantum Gravity. L\'eon Rosenfeld's
earliest contribution | The main purpose of this paper is to analyse the earliest work of L\'eon
Rosenfeld, one of the pioneers in the search of Quantum Gravity, the supposed
theory unifying quantum theory and general relativity. We describe how and why
Rosenfeld tried to face this problem in 1927, analysing the role of his
mentors: Oskar Klein, Louis de Broglie and Th\'eophile De Donder. Rosenfeld
asked himself how quantum mechanics should \textit{concretely} modify general
relativity. In the context of a five-dimensional theory, Rosenfeld tried to
construct a unifying framework for the gravitational and electromagnetic
interaction and wave mechanics. Using a sort of "general relativistic quantum
mechanics" Rosenfeld introduced a wave equation on a curved background. He
investigated the metric created by what he called `quantum phenomena',
represented by wave functions. Rosenfeld integrated Einstein equations in the
weak field limit, with wave functions as source of the gravitational field. The
author performed a sort of semi-classical approximation obtaining at the first
order the Reissner-Nordstr\"om metric. We analyse how Rosenfeld's work is part
of the history of Quantum Mechanics, because in his investigation Rosenfeld was
guided by Bohr's correspondence principle. Finally we briefly discuss how his
contribution is connected with the task of finding out which metric can be
generated by a quantum field, a problem that quantum field theory on curved
backgrounds will start to address 35 years later.
| physics.hist-ph gr-qc | the main purpose of this paper is to analyse the earliest work of leon rosenfeld one of the pioneers in the search of quantum gravity the supposed theory unifying quantum theory and general relativity we describe how and why rosenfeld tried to face this problem in 1927 analysing the role of his mentors oskar klein louis de broglie and theophile de donder rosenfeld asked himself how quantum mechanics should textitconcretely modify general relativity in the context of a fivedimensional theory rosenfeld tried to construct a unifying framework for the gravitational and electromagnetic interaction and wave mechanics using a sort of general relativistic quantum mechanics rosenfeld introduced a wave equation on a curved background he investigated the metric created by what he called quantum phenomena represented by wave functions rosenfeld integrated einstein equations in the weak field limit with wave functions as source of the gravitational field the author performed a sort of semiclassical approximation obtaining at the first order the reissnernordstrom metric we analyse how rosenfelds work is part of the history of quantum mechanics because in his investigation rosenfeld was guided by bohrs correspondence principle finally we briefly discuss how his contribution is connected with the task of finding out which metric can be generated by a quantum field a problem that quantum field theory on curved backgrounds will start to address 35 years later | [['the', 'main', 'purpose', 'of', 'this', 'paper', 'is', 'to', 'analyse', 'the', 'earliest', 'work', 'of', 'leon', 'rosenfeld', 'one', 'of', 'the', 'pioneers', 'in', 'the', 'search', 'of', 'quantum', 'gravity', 'the', 'supposed', 'theory', 'unifying', 'quantum', 'theory', 'and', 'general', 'relativity', 'we', 'describe', 'how', 'and', 'why', 'rosenfeld', 'tried', 'to', 'face', 'this', 'problem', 'in', '1927', 'analysing', 'the', 'role', 'of', 'his', 'mentors', 'oskar', 'klein', 'louis', 'de', 'broglie', 'and', 'theophile', 'de', 'donder', 'rosenfeld', 'asked', 'himself', 'how', 'quantum', 'mechanics', 'should', 'textitconcretely', 'modify', 'general', 'relativity', 'in', 'the', 'context', 'of', 'a', 'fivedimensional', 'theory', 'rosenfeld', 'tried', 'to', 'construct', 'a', 'unifying', 'framework', 'for', 'the', 'gravitational', 'and', 'electromagnetic', 'interaction', 'and', 'wave', 'mechanics', 'using', 'a', 'sort', 'of', 'general', 'relativistic', 'quantum', 'mechanics', 'rosenfeld', 'introduced', 'a', 'wave', 'equation', 'on', 'a', 'curved', 'background', 'he', 'investigated', 'the', 'metric', 'created', 'by', 'what', 'he', 'called', 'quantum', 'phenomena', 'represented', 'by', 'wave', 'functions', 'rosenfeld', 'integrated', 'einstein', 'equations', 'in', 'the', 'weak', 'field', 'limit', 'with', 'wave', 'functions', 'as', 'source', 'of', 'the', 'gravitational', 'field', 'the', 'author', 'performed', 'a', 'sort', 'of', 'semiclassical', 'approximation', 'obtaining', 'at', 'the', 'first', 'order', 'the', 'reissnernordstrom', 'metric', 'we', 'analyse', 'how', 'rosenfelds', 'work', 'is', 'part', 'of', 'the', 'history', 'of', 'quantum', 'mechanics', 'because', 'in', 'his', 'investigation', 'rosenfeld', 'was', 'guided', 'by', 'bohrs', 'correspondence', 'principle', 'finally', 'we', 'briefly', 'discuss', 'how', 'his', 'contribution', 'is', 'connected', 'with', 'the', 'task', 'of', 'finding', 'out', 'which', 'metric', 'can', 'be', 'generated', 'by', 'a', 'quantum', 'field', 'a', 'problem', 'that', 'quantum', 'field', 'theory', 'on', 'curved', 'backgrounds', 'will', 'start', 'to', 'address', '35', 'years', 'later']] | [-0.09996549282680332, 0.1303866565129803, -0.15040401106983023, 0.1308447604491708, -0.1092518076891013, -0.12712641358692572, -0.016015882289398826, 0.24899209462455474, -0.21204117005358317, -0.29460570360866506, 0.01537780496281422, -0.26669262009922284, -0.21162863429552609, 0.1522872036834347, -0.09068330185358978, 0.04195300594789485, 0.0023642242553510834, 0.04138829402238896, -0.048067626199813925, -0.26513772704181193, 0.3461723960468329, 0.12442919906792278, 0.2535030656456781, 0.052366147158733965, 0.1053989201567934, 0.05327075203292354, -0.044853964373552505, 0.054834853664423075, -0.1621871081579554, 0.11842103279039813, 0.2763861803866478, 0.1551675078028763, 0.3078394568957655, -0.45000533883493127, -0.23378574419517203, 0.034790142243374636, 0.08523691314102118, 0.15709475495792244, -0.028915756532764396, -0.340086751513549, 0.01654832225228477, -0.17059891092607618, -0.18913101930437343, -0.015729563060761263, 0.05163810327524386, -0.06108458962158433, -0.10582442061318684, 0.04933918431717237, 0.06902895889028773, 0.013933937235768619, -0.034448276486468137, -0.027706476683566246, 0.07359210273716599, 0.07395501475756257, 0.050178496296991525, 0.07952976773438943, 0.11012177998600237, -0.09983079161195617, -0.1572778844108273, 0.41831232235459276, -0.06147119684750838, -0.18675183881714474, 0.12116414495540084, -0.12745374312154517, -0.14174111252889685, 0.02981749946983265, 0.12288218059620704, 0.13630325088784698, -0.16996715452439407, 0.1656821459335853, -0.01382529764019377, 0.11207729390766222, 0.14887272403471538, -0.012937768229676294, 0.24689383540576923, 0.07686824459233321, -0.0456282486640183, 0.10030942233476837, 0.0021049125677531527, -0.1632352425159687, -0.3503691422686513, -0.21229279396837747, -0.18125361771672033, 0.11752489306646956, -0.02793862689798386, -0.15162576497407695, 0.3600370799083196, 0.16143803151914785, 0.08769949617369223, 0.018507312365337775, 0.21606880691147776, 0.12624049528494652, -0.03225715608381766, 0.03746386109950046, 0.2922528046931672, 0.20349864091778208, 0.16935333637749345, -0.2010050092427004, -0.043384136648715606, 0.15306351640901994] |
1,802.08879 | Multi-megawatt, self-seeded Mamyshev oscillator | We demonstrate a fiber oscillator that achieves 3 MW peak power, is easily
started and is environmentally stable. The Mamyshev oscillator delivers 190-nJ
pulses that can be compressed externally to 35 fs duration. Accurate numerical
modeling of the gain medium provides insight into the behavior and performance
of the device.
| physics.optics | we demonstrate a fiber oscillator that achieves 3 mw peak power is easily started and is environmentally stable the mamyshev oscillator delivers 190nj pulses that can be compressed externally to 35 fs duration accurate numerical modeling of the gain medium provides insight into the behavior and performance of the device | [['we', 'demonstrate', 'a', 'fiber', 'oscillator', 'that', 'achieves', '3', 'mw', 'peak', 'power', 'is', 'easily', 'started', 'and', 'is', 'environmentally', 'stable', 'the', 'mamyshev', 'oscillator', 'delivers', '190nj', 'pulses', 'that', 'can', 'be', 'compressed', 'externally', 'to', '35', 'fs', 'duration', 'accurate', 'numerical', 'modeling', 'of', 'the', 'gain', 'medium', 'provides', 'insight', 'into', 'the', 'behavior', 'and', 'performance', 'of', 'the', 'device']] | [-0.1463301532369639, 0.11205881638143554, -0.14805073973399643, -0.0012098387553717714, -0.08432440454026266, -0.1881982624359733, 0.04812221341215226, 0.49951088124391985, -0.2120820256140159, -0.2917441990872731, 0.06266487082846615, -0.263476811254359, -0.09689882443267472, 0.31562775086459455, -0.07877018396761648, -0.004215722903609276, 0.09378774232250087, -0.006231366162549476, -0.003233848524526978, -0.2039355579383519, 0.16251553604569363, 0.1308424937519796, 0.306346912545209, 0.019486675209993004, 0.12521238532867662, -0.061393658811112445, 0.07496003601319935, -0.04699111619622123, -0.06634458986126428, 0.10267138024031812, 0.22915831132202732, 0.09631777322870128, 0.27171272723650447, -0.4159760152807041, -0.2447073948688387, 0.035947116928137075, 0.14629371186756357, 0.09292522137414436, -0.07002714783789551, -0.2430550859176687, 0.1232255444842942, -0.18835808846111202, -0.13031849916074045, -0.10728009930830829, -0.006662371967520032, 0.06438426454361453, -0.3128528225102595, 0.04737940193058885, 0.05042561259576861, 0.007014511115088755, -0.03288652420956261, -0.044389652107291074, -0.01185862643036003, 0.09816122650910093, -0.0688378675840795, 0.020153341586796606, 0.22677747162096962, -0.09351288895978004, -0.02191720948535569, 0.3896900744424487, -0.10005055846912521, -0.07944317384413918, 0.1303461703034688, -0.1451184275198956, 0.029648142144540136, 0.224037197779636, 0.15850785272005868, 0.019421293343208273, -0.12946609149173816, 0.008454833671507634, 0.04559413865873856, 0.28098319942245675, 0.09602362565620214, 0.059276698252224196, 0.1645178952092799, 0.26380933110355115, 0.06045126188926551, 0.1727440047662287, -0.0778413333797029, -0.04837029503316295, -0.21083849543059358, -0.12169456001096737, -0.12476767502173934, 0.09251446078284359, -0.09657285991540578, -0.019199004396796227, 0.4723399120325945, 0.1299614032103243, 0.13805081008705405, 0.04719146240825708, 0.3412390400712587, 0.1709540220623722, 0.013491425891311802, 0.05354618606138594, 0.28429626513804707, 0.11740664042988602, 0.10299931226264951, -0.2120873016704406, -0.005139367113232004, -0.040309226140379906] |
1,802.0888 | Asynchronous Stochastic Proximal Methods for Nonconvex Nonsmooth
Optimization | We study stochastic algorithms for solving nonconvex optimization problems
with a convex yet possibly nonsmooth regularizer, which find wide applications
in many practical machine learning applications. However, compared to
asynchronous parallel stochastic gradient descent (AsynSGD), an algorithm
targeting smooth optimization, the understanding of the behavior of stochastic
algorithms for nonsmooth regularized optimization problems is limited,
especially when the objective function is nonconvex. To fill this theoretical
gap, in this paper, we propose and analyze asynchronous parallel stochastic
proximal gradient (Asyn-ProxSGD) methods for nonconvex problems. We establish
an ergodic convergence rate of $O(1/\sqrt{K})$ for the proposed Asyn-ProxSGD,
where $K$ is the number of updates made on the model, matching the convergence
rate currently known for AsynSGD (for smooth problems). To our knowledge, this
is the first work that provides convergence rates of asynchronous parallel
ProxSGD algorithms for nonconvex problems. Furthermore, our results are also
the first to show the convergence of any stochastic proximal methods without
assuming an increasing batch size or the use of additional variance reduction
techniques. We implement the proposed algorithms on Parameter Server and
demonstrate its convergence behavior and near-linear speedup, as the number of
workers increases, on two real-world datasets.
| cs.LG | we study stochastic algorithms for solving nonconvex optimization problems with a convex yet possibly nonsmooth regularizer which find wide applications in many practical machine learning applications however compared to asynchronous parallel stochastic gradient descent asynsgd an algorithm targeting smooth optimization the understanding of the behavior of stochastic algorithms for nonsmooth regularized optimization problems is limited especially when the objective function is nonconvex to fill this theoretical gap in this paper we propose and analyze asynchronous parallel stochastic proximal gradient asynproxsgd methods for nonconvex problems we establish an ergodic convergence rate of o1sqrtk for the proposed asynproxsgd where k is the number of updates made on the model matching the convergence rate currently known for asynsgd for smooth problems to our knowledge this is the first work that provides convergence rates of asynchronous parallel proxsgd algorithms for nonconvex problems furthermore our results are also the first to show the convergence of any stochastic proximal methods without assuming an increasing batch size or the use of additional variance reduction techniques we implement the proposed algorithms on parameter server and demonstrate its convergence behavior and nearlinear speedup as the number of workers increases on two realworld datasets | [['we', 'study', 'stochastic', 'algorithms', 'for', 'solving', 'nonconvex', 'optimization', 'problems', 'with', 'a', 'convex', 'yet', 'possibly', 'nonsmooth', 'regularizer', 'which', 'find', 'wide', 'applications', 'in', 'many', 'practical', 'machine', 'learning', 'applications', 'however', 'compared', 'to', 'asynchronous', 'parallel', 'stochastic', 'gradient', 'descent', 'asynsgd', 'an', 'algorithm', 'targeting', 'smooth', 'optimization', 'the', 'understanding', 'of', 'the', 'behavior', 'of', 'stochastic', 'algorithms', 'for', 'nonsmooth', 'regularized', 'optimization', 'problems', 'is', 'limited', 'especially', 'when', 'the', 'objective', 'function', 'is', 'nonconvex', 'to', 'fill', 'this', 'theoretical', 'gap', 'in', 'this', 'paper', 'we', 'propose', 'and', 'analyze', 'asynchronous', 'parallel', 'stochastic', 'proximal', 'gradient', 'asynproxsgd', 'methods', 'for', 'nonconvex', 'problems', 'we', 'establish', 'an', 'ergodic', 'convergence', 'rate', 'of', 'o1sqrtk', 'for', 'the', 'proposed', 'asynproxsgd', 'where', 'k', 'is', 'the', 'number', 'of', 'updates', 'made', 'on', 'the', 'model', 'matching', 'the', 'convergence', 'rate', 'currently', 'known', 'for', 'asynsgd', 'for', 'smooth', 'problems', 'to', 'our', 'knowledge', 'this', 'is', 'the', 'first', 'work', 'that', 'provides', 'convergence', 'rates', 'of', 'asynchronous', 'parallel', 'proxsgd', 'algorithms', 'for', 'nonconvex', 'problems', 'furthermore', 'our', 'results', 'are', 'also', 'the', 'first', 'to', 'show', 'the', 'convergence', 'of', 'any', 'stochastic', 'proximal', 'methods', 'without', 'assuming', 'an', 'increasing', 'batch', 'size', 'or', 'the', 'use', 'of', 'additional', 'variance', 'reduction', 'techniques', 'we', 'implement', 'the', 'proposed', 'algorithms', 'on', 'parameter', 'server', 'and', 'demonstrate', 'its', 'convergence', 'behavior', 'and', 'nearlinear', 'speedup', 'as', 'the', 'number', 'of', 'workers', 'increases', 'on', 'two', 'realworld', 'datasets']] | [-0.10533758025175255, -0.0559472628382776, -0.055330423295105756, 0.0789025157377565, -0.08700018767635093, -0.1688002183187851, 0.0433211281920146, 0.42595310993002433, -0.3460313292979998, -0.29805417706895815, 0.13667027816838143, -0.21905089818480375, -0.17972944626020954, 0.2438402535540885, -0.14434238937438318, 0.12494169305979372, 0.10090079660478392, -0.007172579297452773, -0.1255231091948716, -0.3408824360696599, 0.24032344798018274, 0.011677968350092048, 0.27893532745564653, 0.04892466862220317, 0.12510018879241358, -0.01191871939226985, 0.022495649440066986, 0.024868296287757784, -0.09096975840622785, 0.13596178105493126, 0.2995250682101438, 0.19685273641769432, 0.4109799202923712, -0.4144686339521094, -0.18449904605207082, 0.15247448514472986, 0.17883642674347164, 0.09941236909094425, -0.08558811420930157, -0.2153586336877197, 0.10285680304452972, -0.09000988447315697, -0.04032980252660835, -0.1315259035382616, -0.061734099784179736, 0.07687706866632461, -0.34815754380420244, 0.05041803780707261, 0.06575816166832259, 0.04513784272498206, -0.06872495034109115, -0.14941098439066033, 0.09748694271486448, 0.05177143171297901, 0.10868495681604959, 0.04862428775216502, 0.13136865833872244, -0.1161171409362731, -0.1808082986426981, 0.3212572494913873, -0.032552516011913356, -0.2195578634787939, 0.19894611927509112, -0.007726970829657818, -0.18489160179727293, 0.14520886910491085, 0.27812522358328445, 0.2107976862891136, -0.15862324430682317, 0.10760979001367416, -0.01631582185233894, 0.12455739105169318, 0.0011025561902083848, -0.022292118719288784, 0.05699926083294773, 0.22015997602138668, 0.21422326099587066, 0.16747751796348512, -0.04145320490995226, -0.16882622382162432, -0.24997279501863215, -0.11574563567379588, -0.2041921672313229, -0.025382001949535486, -0.15527260422340508, -0.18241552864936622, 0.34681394743291954, 0.17003277903422714, 0.18086839661394294, 0.16595137694507445, 0.3755694685013671, 0.10853410934306387, 0.011764114759372253, 0.1636492870944111, 0.20801471108631966, 0.11105804342016774, 0.13931588393538014, -0.26749729074623535, 0.09878586467208439, 0.06038412387087622] |
1,802.08881 | The effect of transmission-line dynamics on grid-forming dispatchable
virtual oscillator control | In this work, we analyze the effect of transmission line dynamics on
grid-forming control for inverter-based AC power systems. In particular, we
investigate a dispatchable virtual oscillator control (dVOC) strategy that was
recently proposed in the literature. When the dynamics of the transmission
lines are neglected, i.e., if an algebraic model of the transmission network is
used, dVOC ensures almost global asymptotic stability of a network of AC power
inverters with respect to a pre-specified solution of the AC power-flow
equations. While this approximation is typically justified for conventional
power systems, the electromagnetic transients of the transmission lines can
compromise the stability of an inverter-based power system. In this work, we
establish explicit bounds on the controller setpoints, branch powers, and
control gains that guarantee almost global asymptotic stability of dVOC in
combination with a dynamic model of the transmission network.
| math.OC | in this work we analyze the effect of transmission line dynamics on gridforming control for inverterbased ac power systems in particular we investigate a dispatchable virtual oscillator control dvoc strategy that was recently proposed in the literature when the dynamics of the transmission lines are neglected ie if an algebraic model of the transmission network is used dvoc ensures almost global asymptotic stability of a network of ac power inverters with respect to a prespecified solution of the ac powerflow equations while this approximation is typically justified for conventional power systems the electromagnetic transients of the transmission lines can compromise the stability of an inverterbased power system in this work we establish explicit bounds on the controller setpoints branch powers and control gains that guarantee almost global asymptotic stability of dvoc in combination with a dynamic model of the transmission network | [['in', 'this', 'work', 'we', 'analyze', 'the', 'effect', 'of', 'transmission', 'line', 'dynamics', 'on', 'gridforming', 'control', 'for', 'inverterbased', 'ac', 'power', 'systems', 'in', 'particular', 'we', 'investigate', 'a', 'dispatchable', 'virtual', 'oscillator', 'control', 'dvoc', 'strategy', 'that', 'was', 'recently', 'proposed', 'in', 'the', 'literature', 'when', 'the', 'dynamics', 'of', 'the', 'transmission', 'lines', 'are', 'neglected', 'ie', 'if', 'an', 'algebraic', 'model', 'of', 'the', 'transmission', 'network', 'is', 'used', 'dvoc', 'ensures', 'almost', 'global', 'asymptotic', 'stability', 'of', 'a', 'network', 'of', 'ac', 'power', 'inverters', 'with', 'respect', 'to', 'a', 'prespecified', 'solution', 'of', 'the', 'ac', 'powerflow', 'equations', 'while', 'this', 'approximation', 'is', 'typically', 'justified', 'for', 'conventional', 'power', 'systems', 'the', 'electromagnetic', 'transients', 'of', 'the', 'transmission', 'lines', 'can', 'compromise', 'the', 'stability', 'of', 'an', 'inverterbased', 'power', 'system', 'in', 'this', 'work', 'we', 'establish', 'explicit', 'bounds', 'on', 'the', 'controller', 'setpoints', 'branch', 'powers', 'and', 'control', 'gains', 'that', 'guarantee', 'almost', 'global', 'asymptotic', 'stability', 'of', 'dvoc', 'in', 'combination', 'with', 'a', 'dynamic', 'model', 'of', 'the', 'transmission', 'network']] | [-0.22523722682414074, -0.006317978234200388, -0.06055161481680256, -0.011336121646231635, -0.027866592049493013, -0.14847518327969608, 0.08760823541261414, 0.35916490781497445, -0.26786782558972727, -0.26066308531865595, 0.11705424841608958, -0.24606627370858342, -0.1621353019380625, 0.20019650642086376, -0.09217270188519057, 0.10335753246042084, 0.011336848552583169, 0.038805841076920956, -0.00564069436295024, -0.20710303088491586, 0.29962795805384185, 0.0876388359478021, 0.3456238613345046, 0.0055272539595393, 0.10408418990856579, -0.015800733616284972, 0.024968168978969044, 0.036902835303240504, -0.09831818869943873, 0.10896459592717654, 0.22818334050582234, 0.10071374881345488, 0.2774913809889703, -0.4265284513896133, -0.22450346776436195, 0.11565720567691094, 0.1608523257268289, 0.08041072731461138, -0.015792182839891696, -0.2001345677644754, 0.1140977467760338, -0.19391300486308252, -0.11598846400387797, -0.07745491371470246, -0.03556468725329965, 0.09180014884282657, -0.3137931046703606, 0.014195275915694153, 0.05671438373004397, 0.09053058799435483, -0.10474615573473539, -0.03864310772805508, -0.024193507388022773, 0.11965671139674307, 0.006526687208906556, -0.07077990437970094, 0.11172536446990326, -0.13334953444283323, -0.1185252266400989, 0.34212609356705176, -0.05502920080115028, -0.18850693633740254, 0.10368363067081714, -0.10404889338570548, -0.0872965542606164, 0.12805877895224904, 0.2063363465771132, 0.11108059391828505, -0.1672162907715129, 0.08166931692885684, -0.0207389334963093, 0.17995936514030322, 0.05626795142690869, 0.04983718177065887, 0.153000487952579, 0.17508421966753213, 0.13384904520889968, 0.14000438915809998, -0.04990315930802269, -0.1070963043343038, -0.2703251463182746, -0.10057729833052619, -0.13075933387195063, 0.04401134803944023, -0.06845387133190917, -0.15671586080087704, 0.4268079880915635, 0.12308470529986294, 0.13478719773173914, 0.08804908307295636, 0.3837678653670224, 0.19050248597372085, 0.012775867044635065, 0.08930121657128136, 0.2899525784325938, 0.12514543796374283, 0.14649266312526316, -0.29139048794403355, 0.08075504153900852, 0.035693083044326473] |
1,802.08882 | A Block-wise, Asynchronous and Distributed ADMM Algorithm for General
Form Consensus Optimization | Many machine learning models, including those with non-smooth regularizers,
can be formulated as consensus optimization problems, which can be solved by
the alternating direction method of multipliers (ADMM). Many recent efforts
have been made to develop asynchronous distributed ADMM to handle large amounts
of training data. However, all existing asynchronous distributed ADMM methods
are based on full model updates and require locking all global model parameters
to handle concurrency, which essentially serializes the updates from different
workers. In this paper, we present a novel block-wise, asynchronous and
distributed ADMM algorithm, which allows different blocks of model parameters
to be updated in parallel. The lock-free block-wise algorithm may greatly
speedup sparse optimization problems, a common scenario in reality, in which
most model updates only modify a subset of all decision variables. We
theoretically prove the convergence of our proposed algorithm to stationary
points for non-convex general form consensus problems with possibly non-smooth
regularizers. We implement the proposed ADMM algorithm on the Parameter Server
framework and demonstrate its convergence and near-linear speedup performance
as the number of workers increases.
| cs.LG | many machine learning models including those with nonsmooth regularizers can be formulated as consensus optimization problems which can be solved by the alternating direction method of multipliers admm many recent efforts have been made to develop asynchronous distributed admm to handle large amounts of training data however all existing asynchronous distributed admm methods are based on full model updates and require locking all global model parameters to handle concurrency which essentially serializes the updates from different workers in this paper we present a novel blockwise asynchronous and distributed admm algorithm which allows different blocks of model parameters to be updated in parallel the lockfree blockwise algorithm may greatly speedup sparse optimization problems a common scenario in reality in which most model updates only modify a subset of all decision variables we theoretically prove the convergence of our proposed algorithm to stationary points for nonconvex general form consensus problems with possibly nonsmooth regularizers we implement the proposed admm algorithm on the parameter server framework and demonstrate its convergence and nearlinear speedup performance as the number of workers increases | [['many', 'machine', 'learning', 'models', 'including', 'those', 'with', 'nonsmooth', 'regularizers', 'can', 'be', 'formulated', 'as', 'consensus', 'optimization', 'problems', 'which', 'can', 'be', 'solved', 'by', 'the', 'alternating', 'direction', 'method', 'of', 'multipliers', 'admm', 'many', 'recent', 'efforts', 'have', 'been', 'made', 'to', 'develop', 'asynchronous', 'distributed', 'admm', 'to', 'handle', 'large', 'amounts', 'of', 'training', 'data', 'however', 'all', 'existing', 'asynchronous', 'distributed', 'admm', 'methods', 'are', 'based', 'on', 'full', 'model', 'updates', 'and', 'require', 'locking', 'all', 'global', 'model', 'parameters', 'to', 'handle', 'concurrency', 'which', 'essentially', 'serializes', 'the', 'updates', 'from', 'different', 'workers', 'in', 'this', 'paper', 'we', 'present', 'a', 'novel', 'blockwise', 'asynchronous', 'and', 'distributed', 'admm', 'algorithm', 'which', 'allows', 'different', 'blocks', 'of', 'model', 'parameters', 'to', 'be', 'updated', 'in', 'parallel', 'the', 'lockfree', 'blockwise', 'algorithm', 'may', 'greatly', 'speedup', 'sparse', 'optimization', 'problems', 'a', 'common', 'scenario', 'in', 'reality', 'in', 'which', 'most', 'model', 'updates', 'only', 'modify', 'a', 'subset', 'of', 'all', 'decision', 'variables', 'we', 'theoretically', 'prove', 'the', 'convergence', 'of', 'our', 'proposed', 'algorithm', 'to', 'stationary', 'points', 'for', 'nonconvex', 'general', 'form', 'consensus', 'problems', 'with', 'possibly', 'nonsmooth', 'regularizers', 'we', 'implement', 'the', 'proposed', 'admm', 'algorithm', 'on', 'the', 'parameter', 'server', 'framework', 'and', 'demonstrate', 'its', 'convergence', 'and', 'nearlinear', 'speedup', 'performance', 'as', 'the', 'number', 'of', 'workers', 'increases']] | [-0.12560984850098184, -0.01708539761471336, -0.07784866191457304, 0.03369778670083816, -0.13381261285131343, -0.2352844168574123, 0.051600655795359135, 0.44469614371415334, -0.3508680163847156, -0.3503329300526845, 0.12327109362488076, -0.1672826428822206, -0.14472983376317694, 0.18413079831759724, -0.14416837128205487, 0.14819349124297596, 0.1196705566108816, -0.030471620626095156, -0.08393201270103876, -0.3695328776483913, 0.19173478210505393, -0.001098842750761216, 0.27773641524599646, -0.0399053176650567, 0.1112118957223539, 0.001347916050798307, 0.014820091161313914, 0.026877724876006443, -0.016298288021678643, 0.1344940028242809, 0.3145594977208133, 0.21312364309205342, 0.3687488004896727, -0.45000586080980504, -0.17182239796440144, 0.1429979710834427, 0.21042062729691802, 0.1047573929157971, -0.04415838492213417, -0.2724967258850818, 0.1016696587660071, -0.171841980116626, -0.014047071861239982, -0.15896138488341355, -0.09519717230798287, 0.06933112022345939, -0.34577246294698893, 0.03840868477512277, 0.04088098785213831, 0.010283001093456975, -0.06285142254888075, -0.15158036957813248, 0.07154449876424157, 0.03528258882826036, 0.10299472605788522, 0.04301985649465673, 0.14480127678923624, -0.05248761589876981, -0.19085951128811443, 0.3360200558215548, 0.01577113002030926, -0.23442603226673478, 0.17702890069244986, 0.014903550918903307, -0.19822580944355392, 0.12746989492874192, 0.27778395931210137, 0.17813155066884928, -0.1807864688357896, 0.09215219024079457, -0.05602395553983706, 0.14002216527880418, -0.0024764130765435387, -0.012813205250484953, 0.09120166288178393, 0.17184212892763528, 0.1699663952083753, 0.12121389573193313, -0.023902363152082714, -0.1614028364604097, -0.21835726870508013, -0.10009567297753053, -0.17885274377106924, -0.0775056286046734, -0.14641636904917057, -0.16616207345436185, 0.39699844689118957, 0.22710273759031804, 0.19044629846420666, 0.12003995846144035, 0.36411801935042026, 0.058052488673073215, 0.10681410671848446, 0.20004861091005768, 0.17877887344608703, 0.0959520863229672, 0.13516448692176597, -0.20443245504014615, 0.12428321521584534, 0.08416134886240381] |
1,802.08883 | Approximation of Kolmogorov-Smirnov Test Statistics | Motivated by the weak limit of the Kolmogorov-Smirnov test statistics, in
this contribution, we concern the asymptotics of \begin{align*}
\mathbb{P}\left\{\sup_{\boldsymbol{x}\in [0,1]^n}\left(W(\boldsymbol{x})\Big|
W(\boldsymbol{1})=w\right)>u\right\}, \ w\in\mathbb{R}, \end{align*} for large
$u$ where $W(\boldsymbol{x})$ is the multivariate Brownian sheet based on a
distribution function $F$. The results related to general $F$ are investigated
and some important examples are also showed.
| math.PR | motivated by the weak limit of the kolmogorovsmirnov test statistics in this contribution we concern the asymptotics of beginalign mathbbpleftsup_boldsymbolxin 01nleftwboldsymbolxbig wboldsymbol1wrighturight winmathbbr endalign for large u where wboldsymbolx is the multivariate brownian sheet based on a distribution function f the results related to general f are investigated and some important examples are also showed | [['motivated', 'by', 'the', 'weak', 'limit', 'of', 'the', 'kolmogorovsmirnov', 'test', 'statistics', 'in', 'this', 'contribution', 'we', 'concern', 'the', 'asymptotics', 'of', 'beginalign', 'mathbbpleftsup_boldsymbolxin', '01nleftwboldsymbolxbig', 'wboldsymbol1wrighturight', 'winmathbbr', 'endalign', 'for', 'large', 'u', 'where', 'wboldsymbolx', 'is', 'the', 'multivariate', 'brownian', 'sheet', 'based', 'on', 'a', 'distribution', 'function', 'f', 'the', 'results', 'related', 'to', 'general', 'f', 'are', 'investigated', 'and', 'some', 'important', 'examples', 'are', 'also', 'showed']] | [-0.11514207456260919, 0.0650996573176235, -0.04383473288267851, 0.11913902964442968, -0.014358766740188003, -0.10652570287697018, 0.003041129820048809, 0.31671949226409196, -0.25475841034203767, -0.23197041111066938, 0.10211592292180285, -0.3406724698469043, -0.1580635053291917, 0.26013714358210566, -0.07684888469986617, 0.09967538884840905, 0.03167037023231387, 0.014786902517080307, -0.009383204001933336, -0.2512542395479977, 0.3207617629319429, -0.015159920882433653, 0.27093468599021436, 0.07151540013961494, 0.0631046891771257, -0.010519998790696263, -0.05414838185533881, 0.01616140708560124, -0.22587736233137548, 0.09737157808616757, 0.18614046797156333, 0.06312164914794266, 0.33395907634869215, -0.36930338863283396, -0.14195555737242102, 0.119501280374825, 0.10510060828179121, -0.006200485751032829, -0.04442058130400255, -0.30426941998302937, 0.09710973743349313, -0.08212118191644549, -0.12954752321355045, -0.04713571969419718, 0.07481029056012631, 0.11426264356821775, -0.34568695962429047, 0.15362266381678638, 0.10668652859283612, 0.03793400751426816, -0.0007592631410807371, -0.1763381920172833, 0.03283630575984717, 0.07904906135983765, 0.11131105931010098, 0.042687874343246224, 0.07767086145468056, -0.1271725649898872, -0.018933925293385983, 0.34960636593401434, -0.10107967209070921, -0.2560280752182007, 0.11619130933191628, -0.23748507576994599, -0.20363547353073955, 0.04216717628762126, 0.15044743133708835, 0.15925892755389215, -0.1554241894930601, 0.16277905843104234, -0.07623701598495244, 0.09163563072681427, 0.0573103843908757, -0.024693130686646327, 0.15577302678488195, 0.12761686066165567, 0.037377557046711446, 0.1872932554432191, -0.07992802602704614, -0.06160496906377375, -0.37824222892522813, -0.12934007737785577, -0.23557890115305782, 0.09335674354806542, -0.07979846250469563, -0.14955176698975264, 0.35068511247634887, 0.15048825656063855, 0.20503748943097888, 0.07709558997303248, 0.19952373184263705, 0.1727291548147332, -0.03421524119563401, 0.043858725493773815, 0.1665832674811827, 0.16617096948437393, 0.05602446368895471, -0.16294316186569632, 0.07221651606261731, 0.054851796198636296] |
1,802.08884 | The Duration of Energy Deposition on Unresolved Flaring Loops in the
Solar Corona | Solar flares form and release energy across a large number of magnetic loops.
The global parameters of flares, such as the total energy released, duration,
physical size, etc., are routinely measured, and the hydrodynamics of a coronal
loop subjected to intense heating have been extensively studied. It is not
clear, however, how many loops comprise a flare, nor how the total energy is
partitioned between them. In this work, we employ a hydrodynamic model to
better understand the energy partition by synthesizing Si IV and Fe XXI line
emission and comparing to observations of these lines with IRIS. We find that
the observed temporal evolution of the Doppler shifts holds important
information on the heating duration. To demonstrate this we first examine a
single loop model, and find that the properties of chromospheric evaporation
seen in Fe XXI can be reproduced by loops heated for long durations, while
persistent red-shifts seen in Si IV cannot be reproduced by any single loop
model. We then examine a multi-threaded model, assuming both a fixed heating
duration on all loops, and a distribution of heating durations. For a fixed
heating duration, we find that durations of 100 -- 200 s do a fair job of
reproducing both the red- and blue-shifts, while a distribution of durations,
with a median of about 50 -- 100 s, does a better job. Finally, we compare our
simulations directly to observations of an M-class flare seen by IRIS, and find
good agreement between the modeled and observed values given these constraints.
| astro-ph.SR | solar flares form and release energy across a large number of magnetic loops the global parameters of flares such as the total energy released duration physical size etc are routinely measured and the hydrodynamics of a coronal loop subjected to intense heating have been extensively studied it is not clear however how many loops comprise a flare nor how the total energy is partitioned between them in this work we employ a hydrodynamic model to better understand the energy partition by synthesizing si iv and fe xxi line emission and comparing to observations of these lines with iris we find that the observed temporal evolution of the doppler shifts holds important information on the heating duration to demonstrate this we first examine a single loop model and find that the properties of chromospheric evaporation seen in fe xxi can be reproduced by loops heated for long durations while persistent redshifts seen in si iv cannot be reproduced by any single loop model we then examine a multithreaded model assuming both a fixed heating duration on all loops and a distribution of heating durations for a fixed heating duration we find that durations of 100 200 s do a fair job of reproducing both the red and blueshifts while a distribution of durations with a median of about 50 100 s does a better job finally we compare our simulations directly to observations of an mclass flare seen by iris and find good agreement between the modeled and observed values given these constraints | [['solar', 'flares', 'form', 'and', 'release', 'energy', 'across', 'a', 'large', 'number', 'of', 'magnetic', 'loops', 'the', 'global', 'parameters', 'of', 'flares', 'such', 'as', 'the', 'total', 'energy', 'released', 'duration', 'physical', 'size', 'etc', 'are', 'routinely', 'measured', 'and', 'the', 'hydrodynamics', 'of', 'a', 'coronal', 'loop', 'subjected', 'to', 'intense', 'heating', 'have', 'been', 'extensively', 'studied', 'it', 'is', 'not', 'clear', 'however', 'how', 'many', 'loops', 'comprise', 'a', 'flare', 'nor', 'how', 'the', 'total', 'energy', 'is', 'partitioned', 'between', 'them', 'in', 'this', 'work', 'we', 'employ', 'a', 'hydrodynamic', 'model', 'to', 'better', 'understand', 'the', 'energy', 'partition', 'by', 'synthesizing', 'si', 'iv', 'and', 'fe', 'xxi', 'line', 'emission', 'and', 'comparing', 'to', 'observations', 'of', 'these', 'lines', 'with', 'iris', 'we', 'find', 'that', 'the', 'observed', 'temporal', 'evolution', 'of', 'the', 'doppler', 'shifts', 'holds', 'important', 'information', 'on', 'the', 'heating', 'duration', 'to', 'demonstrate', 'this', 'we', 'first', 'examine', 'a', 'single', 'loop', 'model', 'and', 'find', 'that', 'the', 'properties', 'of', 'chromospheric', 'evaporation', 'seen', 'in', 'fe', 'xxi', 'can', 'be', 'reproduced', 'by', 'loops', 'heated', 'for', 'long', 'durations', 'while', 'persistent', 'redshifts', 'seen', 'in', 'si', 'iv', 'can', 'not', 'be', 'reproduced', 'by', 'any', 'single', 'loop', 'model', 'we', 'then', 'examine', 'a', 'multithreaded', 'model', 'assuming', 'both', 'a', 'fixed', 'heating', 'duration', 'on', 'all', 'loops', 'and', 'a', 'distribution', 'of', 'heating', 'durations', 'for', 'a', 'fixed', 'heating', 'duration', 'we', 'find', 'that', 'durations', 'of', '100', '200', 's', 'do', 'a', 'fair', 'job', 'of', 'reproducing', 'both', 'the', 'red', 'and', 'blueshifts', 'while', 'a', 'distribution', 'of', 'durations', 'with', 'a', 'median', 'of', 'about', '50', '100', 's', 'does', 'a', 'better', 'job', 'finally', 'we', 'compare', 'our', 'simulations', 'directly', 'to', 'observations', 'of', 'an', 'mclass', 'flare', 'seen', 'by', 'iris', 'and', 'find', 'good', 'agreement', 'between', 'the', 'modeled', 'and', 'observed', 'values', 'given', 'these', 'constraints']] | [-0.08395225163770052, 0.16319282589948012, -0.01909807376405261, 0.13810541249973618, -0.03308908779380232, -0.1288540009022672, 0.04344932767636191, 0.4723292592684683, -0.2048848911064075, -0.3807155484952062, 0.06325718074192187, -0.25533538306934445, -0.056461956109041755, 0.213061260310252, -0.024687923232402667, 0.00020466756547033683, 0.08150689332035514, 0.004575342986283625, -0.04915105502522392, -0.21350071525841716, 0.23283699659258864, 0.09801820133308413, 0.22359886354667396, 0.04304746433212735, 0.06389840220914704, -0.05785983104052633, -0.037237082052655635, 0.0650601256473115, -0.11857448939347098, 0.037396378584874226, 0.18918436179268855, 0.12151296443688746, 0.24907833065013052, -0.44556567891548743, -0.2713527257730006, 0.08056697528257141, 0.14829894037721236, 0.02954880869855346, -0.0191958947410888, -0.211938509059584, 0.06098283160838626, -0.14404315453412916, -0.09741084920352862, 0.00833379353761025, 0.04933278812850152, 0.04498735122638479, -0.2603750633418177, 0.05803028619691744, 0.04498942689960933, 0.07796076045412084, -0.07933259985074695, -0.05161973553996813, -0.07679279076704837, 0.13049034390040845, 0.038870208925225226, 0.018585530534412403, 0.14657288634256468, -0.09010074787548644, -0.10792893079098446, 0.37603679334693274, -0.07815521777347062, -0.036160742253177384, 0.16792117945643753, -0.1876716822718929, -0.13119551011640945, 0.1767788117460671, 0.13360798367383805, 0.10269944147729561, -0.14239391849446204, -0.020303117295611177, -0.021993254200489126, 0.2014750568969212, 0.05767860321931747, 0.020475558094281598, 0.2541793644200024, 0.12177390664983394, -0.023482444942993272, 0.12656786901233977, -0.1764992886776677, -0.07158856712863321, -0.3012293891460366, -0.11616570574853555, -0.11808013821088822, 0.06720202012742656, -0.05973889487430871, -0.1684736276547914, 0.40199988336383324, 0.16043234423075328, 0.26921927282428404, 0.04725302508542141, 0.2919721119860445, 0.11202070331237768, 0.08854231048235486, 0.1301877872959486, 0.2401500789268244, 0.11153949585857363, 0.1360168853910868, -0.23306430041745835, 0.08020365478014463, 0.005923050949938978] |
1,802.08885 | Importance of initial conditions in the polarization of complex networks | Currently used models of opinion formation use random initial conditions. In
reality, most people in a social network, except for a small fraction of the
population, are initially either unaware of, or indifferent to, the disputed
issue. To explore the consequences of such specific initial conditions, we
study the polarization of social networks when conflicting ideas arise on two
different seed nodes and then spread according to a majority rule. Using the
configuration model and the stochastic block model as examples, we show that
this framework leads to substantially different outcomes than those which
employ random initial conditions. Moreover, the empirically observed splits in
the karate and the dolphins' networks naturally come out of this paradigm. Our
work thus suggests that the existing opinion dynamics models should be
reevaluated to incorporate the initial condition dependence.
| cs.SI cs.DM nlin.CG physics.soc-ph | currently used models of opinion formation use random initial conditions in reality most people in a social network except for a small fraction of the population are initially either unaware of or indifferent to the disputed issue to explore the consequences of such specific initial conditions we study the polarization of social networks when conflicting ideas arise on two different seed nodes and then spread according to a majority rule using the configuration model and the stochastic block model as examples we show that this framework leads to substantially different outcomes than those which employ random initial conditions moreover the empirically observed splits in the karate and the dolphins networks naturally come out of this paradigm our work thus suggests that the existing opinion dynamics models should be reevaluated to incorporate the initial condition dependence | [['currently', 'used', 'models', 'of', 'opinion', 'formation', 'use', 'random', 'initial', 'conditions', 'in', 'reality', 'most', 'people', 'in', 'a', 'social', 'network', 'except', 'for', 'a', 'small', 'fraction', 'of', 'the', 'population', 'are', 'initially', 'either', 'unaware', 'of', 'or', 'indifferent', 'to', 'the', 'disputed', 'issue', 'to', 'explore', 'the', 'consequences', 'of', 'such', 'specific', 'initial', 'conditions', 'we', 'study', 'the', 'polarization', 'of', 'social', 'networks', 'when', 'conflicting', 'ideas', 'arise', 'on', 'two', 'different', 'seed', 'nodes', 'and', 'then', 'spread', 'according', 'to', 'a', 'majority', 'rule', 'using', 'the', 'configuration', 'model', 'and', 'the', 'stochastic', 'block', 'model', 'as', 'examples', 'we', 'show', 'that', 'this', 'framework', 'leads', 'to', 'substantially', 'different', 'outcomes', 'than', 'those', 'which', 'employ', 'random', 'initial', 'conditions', 'moreover', 'the', 'empirically', 'observed', 'splits', 'in', 'the', 'karate', 'and', 'the', 'dolphins', 'networks', 'naturally', 'come', 'out', 'of', 'this', 'paradigm', 'our', 'work', 'thus', 'suggests', 'that', 'the', 'existing', 'opinion', 'dynamics', 'models', 'should', 'be', 'reevaluated', 'to', 'incorporate', 'the', 'initial', 'condition', 'dependence']] | [-0.08687186431553628, 0.10508042474415291, -0.08502881190291157, 0.10702728142237497, -0.07988499645488682, -0.14281940203573967, 0.07504730104830944, 0.3826448771085038, -0.26134974073911843, -0.30576266624999265, 0.0863976850286471, -0.23892363806910538, -0.17532133074580794, 0.1337495930855059, -0.045855323566744724, 0.010201750882832265, 0.10230664083630675, 0.04172775686063148, 0.0030982457308305635, -0.2783563016784481, 0.37065487984843826, 0.04183030882505355, 0.31265460066497325, 0.016008926289052598, 0.07045396266643096, -0.021106677081573894, -0.02562383135297784, 0.03789209159887698, -0.11526527024721468, 0.08275680220513432, 0.2390576094051034, 0.16962887825168393, 0.33257150062601326, -0.46553799841139054, -0.24043028070418923, 0.1391713776556706, 0.12851656308824508, 0.14875169252821555, -0.007623666265324034, -0.27342073224071, 0.08977412290405481, -0.18791078580025997, -0.1286211899438597, -0.020809214812255016, -0.020695489598438144, 0.030304886716314487, -0.28058342527322194, 0.038512069897519215, 0.05719680203883736, 0.023674164805561303, -0.07412768136882396, -0.12246075475381481, -0.0377062004732175, 0.14449436235935773, 0.07081478581487856, -0.008808661667906025, 0.14731131178430384, -0.1360804763018947, -0.11498048237904354, 0.38200381785562193, -0.014665243021510024, -0.1890016697347164, 0.2198526228898791, -0.10100055092738734, -0.1686062346962798, 0.054398185532126164, 0.20179599554243463, 0.10158968941886323, -0.16856605576370687, -0.013680959879706347, -0.05077674377847601, 0.14972802177416505, 0.05058602000483208, 0.012549349335367206, 0.20630581365311862, 0.13626567707397044, 0.046459966152906415, 0.11288310598357822, -0.0395653888358976, -0.1629765387572762, -0.23184307971279378, -0.06866038867651865, -0.14203512267968446, 0.06631159159975747, -0.09251714192160526, -0.15090944323067865, 0.3853502464653165, 0.2130294969427201, 0.23912403074403604, 0.040431607734515436, 0.2505727406798138, 0.04665360925977843, 0.06173135654793845, 0.05658627513934065, 0.20508230792324025, 0.06514579005295808, 0.11126620095757836, -0.1609519599591968, 0.1460983677663737, -0.008277204625860408] |
1,802.08886 | Holomorphic torsion and geometric zeta functions for certain Hermitian
locally symmetric manifolds | We give a dynamical description, in terms of a Weil-type zeta function, to
the holomorphic torsion with coefficients for certain compact Hermitian locally
symmetric manifolds, whose connected group G of isometries of the universal
cover has only one conjugacy class of cuspidal maximal parabolic subgroup and
satisfies a technical Ansatz relative to the given coefficients. A
distinguishing feature of our zeta function is that its construction involves
in an essential way the geometry of a standard compactification of the
universal cover. The two senior authors are indebted to their junior colleague,
Jan Frahm, for his laborious work shedding light on the scope of the validity
of the Ansatz, and for writing up the attached Appendix. The results therein
show that for real rank one groups G the Ansatz is satisfied with respect to
any coefficients, for some rank two groups G it is satisfied with respect to
certain coefficients, and also that there are groups G which do not obey the
Ansatz.
| math.RT math.DG | we give a dynamical description in terms of a weiltype zeta function to the holomorphic torsion with coefficients for certain compact hermitian locally symmetric manifolds whose connected group g of isometries of the universal cover has only one conjugacy class of cuspidal maximal parabolic subgroup and satisfies a technical ansatz relative to the given coefficients a distinguishing feature of our zeta function is that its construction involves in an essential way the geometry of a standard compactification of the universal cover the two senior authors are indebted to their junior colleague jan frahm for his laborious work shedding light on the scope of the validity of the ansatz and for writing up the attached appendix the results therein show that for real rank one groups g the ansatz is satisfied with respect to any coefficients for some rank two groups g it is satisfied with respect to certain coefficients and also that there are groups g which do not obey the ansatz | [['we', 'give', 'a', 'dynamical', 'description', 'in', 'terms', 'of', 'a', 'weiltype', 'zeta', 'function', 'to', 'the', 'holomorphic', 'torsion', 'with', 'coefficients', 'for', 'certain', 'compact', 'hermitian', 'locally', 'symmetric', 'manifolds', 'whose', 'connected', 'group', 'g', 'of', 'isometries', 'of', 'the', 'universal', 'cover', 'has', 'only', 'one', 'conjugacy', 'class', 'of', 'cuspidal', 'maximal', 'parabolic', 'subgroup', 'and', 'satisfies', 'a', 'technical', 'ansatz', 'relative', 'to', 'the', 'given', 'coefficients', 'a', 'distinguishing', 'feature', 'of', 'our', 'zeta', 'function', 'is', 'that', 'its', 'construction', 'involves', 'in', 'an', 'essential', 'way', 'the', 'geometry', 'of', 'a', 'standard', 'compactification', 'of', 'the', 'universal', 'cover', 'the', 'two', 'senior', 'authors', 'are', 'indebted', 'to', 'their', 'junior', 'colleague', 'jan', 'frahm', 'for', 'his', 'laborious', 'work', 'shedding', 'light', 'on', 'the', 'scope', 'of', 'the', 'validity', 'of', 'the', 'ansatz', 'and', 'for', 'writing', 'up', 'the', 'attached', 'appendix', 'the', 'results', 'therein', 'show', 'that', 'for', 'real', 'rank', 'one', 'groups', 'g', 'the', 'ansatz', 'is', 'satisfied', 'with', 'respect', 'to', 'any', 'coefficients', 'for', 'some', 'rank', 'two', 'groups', 'g', 'it', 'is', 'satisfied', 'with', 'respect', 'to', 'certain', 'coefficients', 'and', 'also', 'that', 'there', 'are', 'groups', 'g', 'which', 'do', 'not', 'obey', 'the', 'ansatz']] | [-0.1712778792177603, 0.07638183124099332, -0.11235997340653414, 0.03667916460422638, -0.15237518853542428, -0.16117719754958984, 0.017000168519537253, 0.3330004722279508, -0.2548898137404503, -0.25153911661250333, 0.09374063152727889, -0.2542600876847167, -0.14003986326897125, 0.2250537771025937, -0.09513067693254094, 0.003693531065414671, 0.03826693593478405, 0.11468866969930169, -0.08732427695599373, -0.2942411392685716, 0.3931296912142662, -0.012078329529843213, 0.22178545285642928, 0.04848909539308537, 0.10537753089900231, -0.003224326530471444, -0.04367504605770479, -0.02702125300722266, -0.1253110800666665, 0.13643288018503857, 0.2701661160365207, 0.07143612251937516, 0.23070068691891651, -0.3337319614365697, -0.16078739226016037, 0.16197133684001955, 0.07932774733211616, -0.0011853961939463553, 0.005727932859574341, -0.262854910283177, 0.09947877048434299, -0.17245306524183648, -0.19437315187095033, -0.07803490623417828, 0.06957488551442684, 0.009546916673166884, -0.22928301620090175, 0.030751115064543418, 0.08317321624660205, 0.06361582545839527, -0.035620509920624537, -0.11042535167408785, -0.026663826420661754, 0.1289484516809476, 0.04106720163987053, 0.03720439951521931, 0.08356376631001447, -0.11520234669449475, -0.07574884861098304, 0.38489103843285527, -0.03888082228540615, -0.22816485309122522, 0.15992246789823253, -0.1594593538191273, -0.18395724212017808, 0.10818676967576238, 0.08869683648528601, 0.14185892834283562, -0.0841559875342581, 0.15835377880248866, -0.11286330809759229, 0.10576950605702874, 0.1153010962082556, -0.019024597817204066, 0.13728285480842548, 0.05279348997893617, 0.0648603818255741, 0.0999703347283404, 0.06080838964165499, -0.026424358880584253, -0.3875649425741515, -0.17076044457976816, -0.15413998851385888, 0.10569989114446798, -0.09737130484651892, -0.18898777919390272, 0.41705245387820916, 0.0683973253917317, 0.1706505608407171, 0.10876583934683974, 0.1886238388017964, 0.09349171873138941, 0.08046361908207383, 0.08162303826463392, 0.14834326415205587, 0.19758854497994446, -0.01534799205708421, -0.1723538261937426, 0.025504578137770295, 0.15948393826522392] |
1,802.08887 | Water from Two Rocks: Maximizing the Mutual Information | We build a natural connection between the learning problem, co-training, and
forecast elicitation without verification (related to peer-prediction) and
address them simultaneously using the same information theoretic approach.
In co-training/multiview learning, the goal is to aggregate two views of data
into a prediction for a latent label. We show how to optimally combine two
views of data by reducing the problem to an optimization problem. Our work
gives a unified and rigorous approach to the general setting.
In forecast elicitation without verification we seek to design a mechanism
that elicits high quality forecasts from agents in the setting where the
mechanism does not have access to the ground truth. By assuming the agents'
information is independent conditioning on the outcome, we propose mechanisms
where truth-telling is a strict equilibrium for both the single-task and
multi-task settings. Our multi-task mechanism additionally has the property
that the truth-telling equilibrium pays better than any other strategy profile
and strictly better than any other "non-permutation" strategy profile when the
prior satisfies some mild conditions.
| cs.LG cs.GT cs.IT math.IT | we build a natural connection between the learning problem cotraining and forecast elicitation without verification related to peerprediction and address them simultaneously using the same information theoretic approach in cotrainingmultiview learning the goal is to aggregate two views of data into a prediction for a latent label we show how to optimally combine two views of data by reducing the problem to an optimization problem our work gives a unified and rigorous approach to the general setting in forecast elicitation without verification we seek to design a mechanism that elicits high quality forecasts from agents in the setting where the mechanism does not have access to the ground truth by assuming the agents information is independent conditioning on the outcome we propose mechanisms where truthtelling is a strict equilibrium for both the singletask and multitask settings our multitask mechanism additionally has the property that the truthtelling equilibrium pays better than any other strategy profile and strictly better than any other nonpermutation strategy profile when the prior satisfies some mild conditions | [['we', 'build', 'a', 'natural', 'connection', 'between', 'the', 'learning', 'problem', 'cotraining', 'and', 'forecast', 'elicitation', 'without', 'verification', 'related', 'to', 'peerprediction', 'and', 'address', 'them', 'simultaneously', 'using', 'the', 'same', 'information', 'theoretic', 'approach', 'in', 'cotrainingmultiview', 'learning', 'the', 'goal', 'is', 'to', 'aggregate', 'two', 'views', 'of', 'data', 'into', 'a', 'prediction', 'for', 'a', 'latent', 'label', 'we', 'show', 'how', 'to', 'optimally', 'combine', 'two', 'views', 'of', 'data', 'by', 'reducing', 'the', 'problem', 'to', 'an', 'optimization', 'problem', 'our', 'work', 'gives', 'a', 'unified', 'and', 'rigorous', 'approach', 'to', 'the', 'general', 'setting', 'in', 'forecast', 'elicitation', 'without', 'verification', 'we', 'seek', 'to', 'design', 'a', 'mechanism', 'that', 'elicits', 'high', 'quality', 'forecasts', 'from', 'agents', 'in', 'the', 'setting', 'where', 'the', 'mechanism', 'does', 'not', 'have', 'access', 'to', 'the', 'ground', 'truth', 'by', 'assuming', 'the', 'agents', 'information', 'is', 'independent', 'conditioning', 'on', 'the', 'outcome', 'we', 'propose', 'mechanisms', 'where', 'truthtelling', 'is', 'a', 'strict', 'equilibrium', 'for', 'both', 'the', 'singletask', 'and', 'multitask', 'settings', 'our', 'multitask', 'mechanism', 'additionally', 'has', 'the', 'property', 'that', 'the', 'truthtelling', 'equilibrium', 'pays', 'better', 'than', 'any', 'other', 'strategy', 'profile', 'and', 'strictly', 'better', 'than', 'any', 'other', 'nonpermutation', 'strategy', 'profile', 'when', 'the', 'prior', 'satisfies', 'some', 'mild', 'conditions']] | [-0.051512377011485, 0.013479561879132192, -0.13010925455873049, 0.09745867199542761, -0.15401527865172623, -0.2014137195180771, 0.1266936670503849, 0.41538257187524447, -0.28325400020673697, -0.32139815241318836, 0.07880296802889424, -0.26052895265482584, -0.14581162817142462, 0.13433598864206373, -0.13435157339953813, 0.04788408669802917, 0.06435885905844749, 0.053935261412948014, -0.04185190088578539, -0.26815665326461463, 0.3427389557831563, 0.06224930812136309, 0.3512950533967928, 0.017084121808806467, 0.12232683869161418, 0.031083495471868994, 0.005288112679904205, -0.004035841916087111, -0.11324848097615763, 0.13869551428216206, 0.2913910690405731, 0.23266072325664539, 0.38256642400953894, -0.43343708041460205, -0.22653112287175725, 0.14592531951524582, 0.0857665421456352, 0.09411201713546097, -0.01007871114932684, -0.2639144733989027, 0.08751599073200625, -0.15054376331879896, -0.028931821883826918, -0.1018642386939575, -0.061032300156447485, -0.04779345369153827, -0.3640210648155468, 0.015972716408677003, 0.09871862954928501, 0.02523275937047407, -0.10530485128487885, -0.09009020018856972, 0.014357687483855783, 0.15192606447752946, 0.049914517253912855, 0.027470999952548973, 0.11543914459793161, -0.15501299508456032, -0.15167409908260665, 0.3767740136927225, -0.02989523334669076, -0.235597238710602, 0.17449762384798487, -0.05917213379664446, -0.1465428619336932, 0.07058636427405098, 0.17306724101988344, 0.10958945296274927, -0.17017593926561725, 0.002128405097979479, -0.07492945347940164, 0.18391198987008991, 0.011120541085979554, -0.013617160143854218, 0.15690538929375825, 0.19355636991466776, 0.13696751109401548, 0.12221499223237273, -0.03207583876189599, -0.12305889297938029, -0.23485689792098732, -0.11622647716548051, -0.15342843152869207, 0.005628756528596956, -0.11347983578265129, -0.10336511713292824, 0.3598706726557933, 0.21784930068382322, 0.20376092120013117, 0.10957477498557087, 0.3595110161020558, 0.06459459613115918, 0.03162436111218478, 0.08422176720582765, 0.19331152970608484, 0.011883260059506583, 0.09459587001688118, -0.18148136835134748, 0.16107905648384221, 0.01671421755182408] |
1,802.08888 | N-GCN: Multi-scale Graph Convolution for Semi-supervised Node
Classification | Graph Convolutional Networks (GCNs) have shown significant improvements in
semi-supervised learning on graph-structured data. Concurrently, unsupervised
learning of graph embeddings has benefited from the information contained in
random walks. In this paper, we propose a model: Network of GCNs (N-GCN), which
marries these two lines of work. At its core, N-GCN trains multiple instances
of GCNs over node pairs discovered at different distances in random walks, and
learns a combination of the instance outputs which optimizes the classification
objective. Our experiments show that our proposed N-GCN model improves
state-of-the-art baselines on all of the challenging node classification tasks
we consider: Cora, Citeseer, Pubmed, and PPI. In addition, our proposed method
has other desirable properties, including generalization to recently proposed
semi-supervised learning methods such as GraphSAGE, allowing us to propose
N-SAGE, and resilience to adversarial input perturbations.
| cs.LG cs.SI stat.ML | graph convolutional networks gcns have shown significant improvements in semisupervised learning on graphstructured data concurrently unsupervised learning of graph embeddings has benefited from the information contained in random walks in this paper we propose a model network of gcns ngcn which marries these two lines of work at its core ngcn trains multiple instances of gcns over node pairs discovered at different distances in random walks and learns a combination of the instance outputs which optimizes the classification objective our experiments show that our proposed ngcn model improves stateoftheart baselines on all of the challenging node classification tasks we consider cora citeseer pubmed and ppi in addition our proposed method has other desirable properties including generalization to recently proposed semisupervised learning methods such as graphsage allowing us to propose nsage and resilience to adversarial input perturbations | [['graph', 'convolutional', 'networks', 'gcns', 'have', 'shown', 'significant', 'improvements', 'in', 'semisupervised', 'learning', 'on', 'graphstructured', 'data', 'concurrently', 'unsupervised', 'learning', 'of', 'graph', 'embeddings', 'has', 'benefited', 'from', 'the', 'information', 'contained', 'in', 'random', 'walks', 'in', 'this', 'paper', 'we', 'propose', 'a', 'model', 'network', 'of', 'gcns', 'ngcn', 'which', 'marries', 'these', 'two', 'lines', 'of', 'work', 'at', 'its', 'core', 'ngcn', 'trains', 'multiple', 'instances', 'of', 'gcns', 'over', 'node', 'pairs', 'discovered', 'at', 'different', 'distances', 'in', 'random', 'walks', 'and', 'learns', 'a', 'combination', 'of', 'the', 'instance', 'outputs', 'which', 'optimizes', 'the', 'classification', 'objective', 'our', 'experiments', 'show', 'that', 'our', 'proposed', 'ngcn', 'model', 'improves', 'stateoftheart', 'baselines', 'on', 'all', 'of', 'the', 'challenging', 'node', 'classification', 'tasks', 'we', 'consider', 'cora', 'citeseer', 'pubmed', 'and', 'ppi', 'in', 'addition', 'our', 'proposed', 'method', 'has', 'other', 'desirable', 'properties', 'including', 'generalization', 'to', 'recently', 'proposed', 'semisupervised', 'learning', 'methods', 'such', 'as', 'graphsage', 'allowing', 'us', 'to', 'propose', 'nsage', 'and', 'resilience', 'to', 'adversarial', 'input', 'perturbations']] | [-0.04293361956693439, -0.02448656132824167, -0.054889804155876236, 0.025428767408313298, -0.10918104924192583, -0.1796187815428884, 0.032405116071890075, 0.4561285034098007, -0.2659531954917367, -0.3274824783757881, 0.0008062057266080821, -0.305730130692461, -0.22952541653756742, 0.16720951146411675, -0.13343755272734498, 0.10339762160028504, 0.16986809256314128, 0.07618348346850662, -0.030177469930128643, -0.31834563819682915, 0.2990624367621624, 0.01908155295101029, 0.35165057028643787, 0.031573537664694916, 0.14685684790558837, -0.00926816024714046, -0.04403621271140529, 0.01588054116970549, -0.05536270124338679, 0.17405867801151342, 0.33246721386320943, 0.22515592869647122, 0.326493459822679, -0.3870002642308396, -0.2848787204414192, 0.13680272520416312, 0.14160465402183708, 0.11050922637805342, -0.00567017370507259, -0.36318429112434386, 0.10407235437348761, -0.1751174712622607, 0.0695225066419139, -0.1423302300895254, -0.029566420583675306, 0.010681071077232008, -0.279758725039385, 0.005585173412260634, 0.10851811265089997, 0.016910277145453383, -0.0164054966919745, -0.14614503962436207, 0.01860215661322905, 0.1456483193569713, -0.0015173721342795978, 0.07561490224174189, 0.10443624323923831, -0.13942817771738325, -0.2287436599670737, 0.3339778457802755, -0.0630082389736479, -0.16737921922640117, 0.21536382754781733, -0.0011427427676540833, -0.2231809759133116, 0.06367955083648363, 0.2875091870349866, 0.1269061433772246, -0.13549674947021736, 0.017912102154783765, -0.09351711284231257, 0.12810775925301843, 0.06443034155742713, 0.007175040984940198, 0.1299572288045763, 0.25379844338943564, 0.03864714261316867, 0.1520108477824747, -0.13596475075205994, -0.07106321600300294, -0.16123260773278567, -0.03780352607697111, -0.20337063043154086, -0.02796374436950794, -0.1484525649460179, -0.14027353618358676, 0.4571145222970733, 0.23900538109656838, 0.23530263492699574, 0.14141713565870845, 0.3117705361986602, -0.027347883501055617, 0.12712240375371442, 0.14591537832748144, 0.1576695918450477, 0.05086621362026091, 0.1180422382524099, -0.12975010695884487, 0.09308443893807837, 0.05746755710354558] |
1,802.08889 | Remarks on the Ostrovsky's Theorem | In this paper we prove that the condition one-to-one of continuous
open-resolvable mapping is necessary in the Ostrovsky's Theorem. Also we get
that the Ostrovsky's Problem (Is every open-LCn function between Polish spaces
piecewise open for n = 2, 3, ... ?) has a negative solution for any n > 1.
| math.GN | in this paper we prove that the condition onetoone of continuous openresolvable mapping is necessary in the ostrovskys theorem also we get that the ostrovskys problem is every openlcn function between polish spaces piecewise open for n 2 3 has a negative solution for any n 1 | [['in', 'this', 'paper', 'we', 'prove', 'that', 'the', 'condition', 'onetoone', 'of', 'continuous', 'openresolvable', 'mapping', 'is', 'necessary', 'in', 'the', 'ostrovskys', 'theorem', 'also', 'we', 'get', 'that', 'the', 'ostrovskys', 'problem', 'is', 'every', 'openlcn', 'function', 'between', 'polish', 'spaces', 'piecewise', 'open', 'for', 'n', '2', '3', 'has', 'a', 'negative', 'solution', 'for', 'any', 'n', '1']] | [-0.1363099954892383, 0.11680676993848972, -0.0816335666729787, 0.08237996161644628, -0.014042046354260556, -0.16150735386885529, 0.033537194541612164, 0.40192331425672356, -0.2796894561412723, -0.22136754105084164, 0.12697736589173073, -0.2626773644845153, -0.1997548376080082, 0.1931897649368228, -0.08446392895610527, 0.014536087769408559, 0.04562083132521704, 0.06342777804753115, -0.0922732594163092, -0.2513982062769491, 0.39389817815187367, -0.10590234359856261, 0.19527019913373297, 0.12410082405996184, 0.14824027544277352, 0.013617672340208015, 0.019517117461492848, -0.0009577861407685072, -0.15198238477683465, 0.07599332729127085, 0.2735630633352801, 0.18579764886715905, 0.35412794719775054, -0.33655981694247983, -0.15487047640043636, 0.23140226897978505, 0.11480204829253084, 0.03917410196519868, -0.06398264356065801, -0.19785058399835645, 0.18430078512620787, -0.10826009935374524, -0.1480428549396091, -0.00950604690195516, 0.11498749095859916, -0.025760987297047015, -0.33800203950945723, 0.01103215683508816, 0.1434770541828732, 0.04886168033577675, -0.12475554034287153, -0.005744210812588071, 0.00903268093459828, 0.1781293846082029, -0.03589778320950478, 0.14608402014168542, -0.024189745705455627, -0.05430698706118693, -0.0873336285125291, 0.33625056557790484, -0.07963780653771273, -0.30008369008469027, 0.1271089698123031, -0.16098000444905008, -0.20947245725019034, 0.07175976892413441, 0.0975823711473928, 0.12740920059556185, -0.08209513426693373, 0.20069907961933073, -0.1688844483605651, 0.1909226540470669, 0.09444792395414309, -0.03297697945476272, 0.07174605867543886, 0.14051578300030426, 0.1976179153506839, 0.15888958898654512, 0.024250531958979228, 0.01745280852611718, -0.36830479478420214, -0.21842147098031156, -0.1848165312522026, 0.09313124050061371, -0.11670281670900971, -0.16292723857386168, 0.32345478899430397, 0.11423330651163015, 0.17594278326561286, 0.1432763247988945, 0.239436617857495, 0.132428276829075, -0.04185619497628406, 0.1189432950733706, 0.1574660250267317, 0.10578308269641427, 0.06142586816188901, -0.09840364760697581, 0.029102520486556514, 0.12309817796529726] |
1,802.0889 | Scalar Resonant Relaxation of Stars Around a Massive Black Hole | In nuclear star clusters, the potential is governed by the central massive
black hole, so that stars move on nearly Keplerian orbits and the total
potential is almost stationary in time. Yet, the deviations of the potential
from the Keplerian one, due to the enclosed stellar mass and general
relativity, will cause the stellar orbits to precess. Moreover, as a result of
the finite number of stars, small deviations of the potential from spherical
symmetry induce residual torques that can change the stars' angular momentum
faster than the standard two-body relaxation. The combination of these two
effects drives a stochastic evolution of orbital angular momentum, a process
named "resonant relaxation". Owing to recent developments in the description of
the relaxation of self-gravitating systems, we can now fully describe scalar
resonant relaxation (relaxation of the magnitude of the angular momentum) as a
diffusion process. In this framework, the potential fluctuations due to the
complex orbital motion of the stars are described by a random correlated noise,
whose statistical properties are fully characterized by the stars' mean field
motion. On long timescales, the cluster can be regarded as a diffusive system,
whose diffusion coefficients depend explicitly on the mean field stellar
distribution through the properties of the noise. We show here, for the first
time, how the diffusion coefficients of scalar resonant relaxation, for a
spherically symmetric system, can be fully calculated from first principles,
without any free parameters. We also provide an open source code that evaluates
these diffusion coefficients numerically.
| astro-ph.GA | in nuclear star clusters the potential is governed by the central massive black hole so that stars move on nearly keplerian orbits and the total potential is almost stationary in time yet the deviations of the potential from the keplerian one due to the enclosed stellar mass and general relativity will cause the stellar orbits to precess moreover as a result of the finite number of stars small deviations of the potential from spherical symmetry induce residual torques that can change the stars angular momentum faster than the standard twobody relaxation the combination of these two effects drives a stochastic evolution of orbital angular momentum a process named resonant relaxation owing to recent developments in the description of the relaxation of selfgravitating systems we can now fully describe scalar resonant relaxation relaxation of the magnitude of the angular momentum as a diffusion process in this framework the potential fluctuations due to the complex orbital motion of the stars are described by a random correlated noise whose statistical properties are fully characterized by the stars mean field motion on long timescales the cluster can be regarded as a diffusive system whose diffusion coefficients depend explicitly on the mean field stellar distribution through the properties of the noise we show here for the first time how the diffusion coefficients of scalar resonant relaxation for a spherically symmetric system can be fully calculated from first principles without any free parameters we also provide an open source code that evaluates these diffusion coefficients numerically | [['in', 'nuclear', 'star', 'clusters', 'the', 'potential', 'is', 'governed', 'by', 'the', 'central', 'massive', 'black', 'hole', 'so', 'that', 'stars', 'move', 'on', 'nearly', 'keplerian', 'orbits', 'and', 'the', 'total', 'potential', 'is', 'almost', 'stationary', 'in', 'time', 'yet', 'the', 'deviations', 'of', 'the', 'potential', 'from', 'the', 'keplerian', 'one', 'due', 'to', 'the', 'enclosed', 'stellar', 'mass', 'and', 'general', 'relativity', 'will', 'cause', 'the', 'stellar', 'orbits', 'to', 'precess', 'moreover', 'as', 'a', 'result', 'of', 'the', 'finite', 'number', 'of', 'stars', 'small', 'deviations', 'of', 'the', 'potential', 'from', 'spherical', 'symmetry', 'induce', 'residual', 'torques', 'that', 'can', 'change', 'the', 'stars', 'angular', 'momentum', 'faster', 'than', 'the', 'standard', 'twobody', 'relaxation', 'the', 'combination', 'of', 'these', 'two', 'effects', 'drives', 'a', 'stochastic', 'evolution', 'of', 'orbital', 'angular', 'momentum', 'a', 'process', 'named', 'resonant', 'relaxation', 'owing', 'to', 'recent', 'developments', 'in', 'the', 'description', 'of', 'the', 'relaxation', 'of', 'selfgravitating', 'systems', 'we', 'can', 'now', 'fully', 'describe', 'scalar', 'resonant', 'relaxation', 'relaxation', 'of', 'the', 'magnitude', 'of', 'the', 'angular', 'momentum', 'as', 'a', 'diffusion', 'process', 'in', 'this', 'framework', 'the', 'potential', 'fluctuations', 'due', 'to', 'the', 'complex', 'orbital', 'motion', 'of', 'the', 'stars', 'are', 'described', 'by', 'a', 'random', 'correlated', 'noise', 'whose', 'statistical', 'properties', 'are', 'fully', 'characterized', 'by', 'the', 'stars', 'mean', 'field', 'motion', 'on', 'long', 'timescales', 'the', 'cluster', 'can', 'be', 'regarded', 'as', 'a', 'diffusive', 'system', 'whose', 'diffusion', 'coefficients', 'depend', 'explicitly', 'on', 'the', 'mean', 'field', 'stellar', 'distribution', 'through', 'the', 'properties', 'of', 'the', 'noise', 'we', 'show', 'here', 'for', 'the', 'first', 'time', 'how', 'the', 'diffusion', 'coefficients', 'of', 'scalar', 'resonant', 'relaxation', 'for', 'a', 'spherically', 'symmetric', 'system', 'can', 'be', 'fully', 'calculated', 'from', 'first', 'principles', 'without', 'any', 'free', 'parameters', 'we', 'also', 'provide', 'an', 'open', 'source', 'code', 'that', 'evaluates', 'these', 'diffusion', 'coefficients', 'numerically']] | [-0.13162091021076777, 0.17637892935291166, -0.0953707064166665, 0.07080021447602484, -0.06751505021657794, -0.05905233749188483, -0.0065312101794406776, 0.3422304031532258, -0.2968026415016502, -0.29194361456483603, 0.060250928677618505, -0.24853159092087299, -0.0903471279554069, 0.1952590919137001, -0.010536291729891673, 0.0428281879471615, 0.05891780048236251, 0.016729792312835345, -0.06681830468447879, -0.22194896921608598, 0.33113991145044563, 0.050486726430244745, 0.16644706907682122, 0.0033679253633599727, 0.092948917130474, -0.010763721145223826, -0.003234801115002483, 0.026692477701231836, -0.1303211354049563, 0.0580763668238651, 0.16067627528123557, 0.05597947093565017, 0.2326059472300112, -0.41938422111980617, -0.21666431888611987, 0.06119528321735561, 0.18022921566746664, 0.1373538947813213, -0.06283499283483251, -0.24745533583546056, 0.03944952332600951, -0.18721554650738836, -0.17472798229195177, -0.06754720187187195, 0.05326542149670422, 0.05149553998792544, -0.24559365309996065, 0.15327913007407915, 0.10148301701433957, 0.023384389771468703, -0.10451936115231365, -0.09416740301065146, -0.0477317755445838, 0.10577157877385616, 0.07411499231099151, 0.027615853892639278, 0.1778150745932944, -0.10661986899469048, -0.09171139122662135, 0.4052630853834562, -0.10769477834861027, -0.20827034403011202, 0.177030584490858, -0.20059869849681855, -0.07410948816640303, 0.15625432992354035, 0.20946178765036166, 0.16095026701141615, -0.20942325560189784, 0.0702541545923159, 0.01582509054802358, 0.1667754566585645, 0.05318685701396316, 0.04482224635151215, 0.29682231694459915, 0.12133642169833184, 0.04847314673941582, 0.09221748984325677, -0.13036916068289428, -0.14616097106970846, -0.2661232169121504, -0.1098782647550106, -0.1917530963914469, 0.09481613364064834, -0.10217108463484328, -0.15608193309046328, 0.38385610898956657, 0.10250962159223855, 0.19570674634352325, 0.03647652452252805, 0.2902271046116948, 0.1449377564699389, 0.08693768138065934, 0.10507586708012968, 0.28539225609600544, 0.17383499270677566, 0.08874918397329748, -0.30270573566015807, 0.06728534065792337, 0.02502526474650949] |
1,802.08891 | Affine elliptic surfaces with type-A singularities and orbi-conifolds | Following the work of Castano-Bernard and Matessi on conifold transition in
the Gross-Siebert program, we construct orbi-conifold transitions of the
Shoen's Calabi-Yau threefold and their mirrors. The construction glues together
the local models for orbi-conifold transitions in the previous work with
Kanazawa.
| math.AG | following the work of castanobernard and matessi on conifold transition in the grosssiebert program we construct orbiconifold transitions of the shoens calabiyau threefold and their mirrors the construction glues together the local models for orbiconifold transitions in the previous work with kanazawa | [['following', 'the', 'work', 'of', 'castanobernard', 'and', 'matessi', 'on', 'conifold', 'transition', 'in', 'the', 'grosssiebert', 'program', 'we', 'construct', 'orbiconifold', 'transitions', 'of', 'the', 'shoens', 'calabiyau', 'threefold', 'and', 'their', 'mirrors', 'the', 'construction', 'glues', 'together', 'the', 'local', 'models', 'for', 'orbiconifold', 'transitions', 'in', 'the', 'previous', 'work', 'with', 'kanazawa']] | [-0.11754262326536952, 0.05143756734056247, -0.07961314805858843, 0.019834219251532812, -0.02805986919918576, -0.13068899779102286, 0.07156781083904207, 0.35096652332592654, -0.1736103026951487, -0.30698160630827015, 0.09904897190957658, -0.27259955917661255, -0.17212182983151963, 0.10705286032847457, -0.10892227800512636, 0.005797252058982849, -0.023096768651157618, -0.06310874384802741, -0.11234800459666026, -0.2647267322282533, 0.4391970005188439, 0.022769439361385396, 0.25456134677940123, 0.04760215912215613, 0.059402468803061825, -0.015408373890897713, -0.019305303230302762, -0.04521637606258328, -0.18900327983538848, 0.14965844803766623, 0.26098691556743125, 0.06456373701174115, 0.10403789912123938, -0.4717263050780103, -0.15619412232489274, 0.0856721902303901, 0.07118838038798925, 0.17715153239063314, 0.010828131970295028, -0.2900586140316886, -0.005957143688008089, -0.10564046662703559, -0.12440085154328798, -0.07585228081616396, -0.02989178760027563, 0.03689382376300322, -0.16969157924019806, -0.043883301292520924, 0.11951285560388823, 0.07812259456998594, -0.06508449397075015, -0.0677145802088686, -0.07631930744124425, 0.10122857610317501, 0.04059071331662503, 0.08623709501950322, 0.051299303631625465, -0.13890047431797595, -0.1673061395114338, 0.32423938000323, -0.04753237884693049, -0.10168738847573262, 0.15060718507329757, -0.1288000557672333, -0.2116684802128254, 0.10757125652634313, 0.1257974378500335, 0.2071538134603887, -0.04152343397003573, 0.1119311181796916, 0.03020228319675536, 0.09567644580493907, 0.06428722838392935, -0.017265014526610438, 0.18913457606843598, 0.14651687463393082, 0.023715509202431987, 0.14295217830285029, -0.03728290189787544, -0.1141728499048465, -0.38028688859697934, -0.17790157356176753, -0.11446522287017591, 0.05158659561562377, -0.022538282618247526, -0.13755712753816232, 0.44117069616913795, 0.08930785292004412, 0.2563694158468295, 0.09840033653922178, 0.2429689999632034, 0.031718409519541906, 0.04808100704984689, -0.02217544673161732, 0.2506021583402479, 0.11637221936237167, 0.09354673338600912, -0.22817404714186448, -0.046210373349085045, 0.13963993457523552] |
1,802.08892 | Decompositions of linear spaces induced by $n$-linear maps | Let $\mathbb V$ be an arbitrary linear space and $f:\mathbb V \times \ldots
\times \mathbb V \to \mathbb V$ an $n$-linear map. It is proved that, for each
choice of a basis ${\mathcal B}$ of $\mathbb V$, the $n$-linear map $f$ induces
a (nontrivial) decomposition $\mathbb V= \oplus V_j$ as a direct sum of linear
subspaces of $\mathbb V$, with respect to ${\mathcal B}$. It is shown that this
decomposition is $f$-orthogonal in the sense that $f(\mathbb V, \ldots, V_j,
\ldots, V_k, \ldots, \mathbb V) =0$ when $j \neq k$, and in such a way that any
$V_j$ is strongly $f$-invariant, meaning that $f(\mathbb V, \ldots, V_j,
\ldots, \mathbb V) \subset V_j.$ A sufficient condition for two different
decompositions of $\mathbb V$ induced by an $n$-linear map $f$, with respect to
two different bases of $\mathbb V$, being isomorphic is deduced. The
$f$-simplicity -- an analogue of the usual simplicity in the framework of
$n$-liner maps -- of any linear subspace $V_j$ of a certain decomposition
induced by $f$ is characterized. Finally, an application to the structure
theory of arbitrary $n$-ary algebras is provided. This work is a close
generalization the results obtained by A. J. Calder\'on (2018).
| math.RA | let mathbb v be an arbitrary linear space and fmathbb v times ldots times mathbb v to mathbb v an nlinear map it is proved that for each choice of a basis mathcal b of mathbb v the nlinear map f induces a nontrivial decomposition mathbb v oplus v_j as a direct sum of linear subspaces of mathbb v with respect to mathcal b it is shown that this decomposition is forthogonal in the sense that fmathbb v ldots v_j ldots v_k ldots mathbb v 0 when j neq k and in such a way that any v_j is strongly finvariant meaning that fmathbb v ldots v_j ldots mathbb v subset v_j a sufficient condition for two different decompositions of mathbb v induced by an nlinear map f with respect to two different bases of mathbb v being isomorphic is deduced the fsimplicity an analogue of the usual simplicity in the framework of nliner maps of any linear subspace v_j of a certain decomposition induced by f is characterized finally an application to the structure theory of arbitrary nary algebras is provided this work is a close generalization the results obtained by a j calderon 2018 | [['let', 'mathbb', 'v', 'be', 'an', 'arbitrary', 'linear', 'space', 'and', 'fmathbb', 'v', 'times', 'ldots', 'times', 'mathbb', 'v', 'to', 'mathbb', 'v', 'an', 'nlinear', 'map', 'it', 'is', 'proved', 'that', 'for', 'each', 'choice', 'of', 'a', 'basis', 'mathcal', 'b', 'of', 'mathbb', 'v', 'the', 'nlinear', 'map', 'f', 'induces', 'a', 'nontrivial', 'decomposition', 'mathbb', 'v', 'oplus', 'v_j', 'as', 'a', 'direct', 'sum', 'of', 'linear', 'subspaces', 'of', 'mathbb', 'v', 'with', 'respect', 'to', 'mathcal', 'b', 'it', 'is', 'shown', 'that', 'this', 'decomposition', 'is', 'forthogonal', 'in', 'the', 'sense', 'that', 'fmathbb', 'v', 'ldots', 'v_j', 'ldots', 'v_k', 'ldots', 'mathbb', 'v', '0', 'when', 'j', 'neq', 'k', 'and', 'in', 'such', 'a', 'way', 'that', 'any', 'v_j', 'is', 'strongly', 'finvariant', 'meaning', 'that', 'fmathbb', 'v', 'ldots', 'v_j', 'ldots', 'mathbb', 'v', 'subset', 'v_j', 'a', 'sufficient', 'condition', 'for', 'two', 'different', 'decompositions', 'of', 'mathbb', 'v', 'induced', 'by', 'an', 'nlinear', 'map', 'f', 'with', 'respect', 'to', 'two', 'different', 'bases', 'of', 'mathbb', 'v', 'being', 'isomorphic', 'is', 'deduced', 'the', 'fsimplicity', 'an', 'analogue', 'of', 'the', 'usual', 'simplicity', 'in', 'the', 'framework', 'of', 'nliner', 'maps', 'of', 'any', 'linear', 'subspace', 'v_j', 'of', 'a', 'certain', 'decomposition', 'induced', 'by', 'f', 'is', 'characterized', 'finally', 'an', 'application', 'to', 'the', 'structure', 'theory', 'of', 'arbitrary', 'nary', 'algebras', 'is', 'provided', 'this', 'work', 'is', 'a', 'close', 'generalization', 'the', 'results', 'obtained', 'by', 'a', 'j', 'calderon', '2018']] | [-0.22356459197957415, 0.08086919440585369, -0.006766009462968364, -0.08747181227072408, -0.06817956590286693, -0.19526239426642503, -0.07227732214794393, 0.3824603083046452, -0.3943782159021134, -0.0978877806506443, 0.026801457067039538, -0.3138930769347697, -0.11698725372263341, 0.13000973534089913, -0.098188211937517, -0.055394230313946545, 0.01960340641207337, 0.11740003391217267, -0.11835141986285197, -0.2598284800057999, 0.28818108635312767, -0.1237808336549646, 0.1932022514010519, -0.0036731308007641778, 0.1349718474778178, -0.002643118909236835, 0.02720242806733224, -0.005214777380171343, -0.22465771074510701, 0.08263336778907926, 0.25214318222718535, 0.14300639116461028, 0.2938011470389519, -0.3130364324414977, -0.12149676353878154, 0.2768913200221608, 0.1796455138792414, -0.13005542073524293, 0.03175134102518639, -0.3098518360729469, 0.1138345834876319, -0.13022852855025177, -0.13636584353869674, -0.05676907841888271, 0.24645623499817104, 0.011788650579904953, -0.4321236736650839, -0.0021311164136319735, 0.16875121631017775, 0.0863228737069155, -0.01902362386517497, -0.19093909059709102, -0.16074870013598103, 0.023481094772557106, -0.09325001919111285, 0.2515630133430729, 0.04801123804736091, -0.010459522944706168, -0.07814634904576649, 0.41498140335430445, -0.10446812456064747, -0.2473495287067918, 0.06264662829473847, -0.16136450587091436, -0.10550738083695693, 0.0658884240143059, 0.03841940827493995, 0.16393571579346308, -0.039581648647797854, 0.26235775894502306, -0.15754928176352812, 0.06121290442135687, 0.09261892356673362, 0.017725341017189113, 0.11887987014485302, -0.0016657427095668148, 0.13313945203324673, 0.07912368484268477, 0.027396010131203602, 0.09141678626557397, -0.4044213331270712, -0.13216393662452544, -0.2066486664502423, 0.18449483751053947, -0.12673681383919927, -0.09308813760401512, 0.3297472746796674, 0.06230873434075729, 0.26300319350792645, 0.05677754316678623, 0.19106811200090024, 0.10175476743691297, -0.0019395262421557555, 0.09803377841285628, 0.007975852443870408, 0.21731236983220928, -0.030525147258617717, -0.15012147697472916, -0.01643341282923064, 0.17630048699126882] |
1,802.08893 | Accurate estimations of electromagnetic transitions of Sn IV for stellar
and interstellar media | Here we report on accurate ab initio calculations to study astrophysically
important electromagnetic transition parameters among different low-lying
states of Sn IV. Our ab initio calculations are based on the sophisticated
relativistic coupled-cluster theory, which almost exhausts many important
electron correlations. To establish the accuracy of the calculations, we
compare our results with the available experiments and estimates the transition
amplitudes in length and velocity gauged forms. Most of these allowed and
forbidden transition wavelengths lie in the infrared region, and they can be
observed in the different cool stellar and interstellar media. For the
improvement of uncertainty, we use experimental energies to the estimations of
the above transition parameters. The presented data will be helpful to find the
abundances of the ion in different astrophysical and laboratory plasma.
| physics.atom-ph | here we report on accurate ab initio calculations to study astrophysically important electromagnetic transition parameters among different lowlying states of sn iv our ab initio calculations are based on the sophisticated relativistic coupledcluster theory which almost exhausts many important electron correlations to establish the accuracy of the calculations we compare our results with the available experiments and estimates the transition amplitudes in length and velocity gauged forms most of these allowed and forbidden transition wavelengths lie in the infrared region and they can be observed in the different cool stellar and interstellar media for the improvement of uncertainty we use experimental energies to the estimations of the above transition parameters the presented data will be helpful to find the abundances of the ion in different astrophysical and laboratory plasma | [['here', 'we', 'report', 'on', 'accurate', 'ab', 'initio', 'calculations', 'to', 'study', 'astrophysically', 'important', 'electromagnetic', 'transition', 'parameters', 'among', 'different', 'lowlying', 'states', 'of', 'sn', 'iv', 'our', 'ab', 'initio', 'calculations', 'are', 'based', 'on', 'the', 'sophisticated', 'relativistic', 'coupledcluster', 'theory', 'which', 'almost', 'exhausts', 'many', 'important', 'electron', 'correlations', 'to', 'establish', 'the', 'accuracy', 'of', 'the', 'calculations', 'we', 'compare', 'our', 'results', 'with', 'the', 'available', 'experiments', 'and', 'estimates', 'the', 'transition', 'amplitudes', 'in', 'length', 'and', 'velocity', 'gauged', 'forms', 'most', 'of', 'these', 'allowed', 'and', 'forbidden', 'transition', 'wavelengths', 'lie', 'in', 'the', 'infrared', 'region', 'and', 'they', 'can', 'be', 'observed', 'in', 'the', 'different', 'cool', 'stellar', 'and', 'interstellar', 'media', 'for', 'the', 'improvement', 'of', 'uncertainty', 'we', 'use', 'experimental', 'energies', 'to', 'the', 'estimations', 'of', 'the', 'above', 'transition', 'parameters', 'the', 'presented', 'data', 'will', 'be', 'helpful', 'to', 'find', 'the', 'abundances', 'of', 'the', 'ion', 'in', 'different', 'astrophysical', 'and', 'laboratory', 'plasma']] | [-0.06470504483792844, 0.1585012401288101, -0.05238481590798659, 0.0945578872139544, -0.043541554819572316, -0.08032559165225704, 0.0519412888183309, 0.43284792367859865, -0.1734435953278376, -0.3202256042827932, 0.01934750079242296, -0.3147804698105468, -0.07630149419455565, 0.20126860336826521, 0.0714035322472305, 0.06652313905908878, 0.08859612802476731, 9.302936436593995e-05, -0.10818516365667559, -0.193760520266008, 0.30055796010997293, 0.10008594297710084, 0.22637581925247183, 0.08867271145618008, 0.013867841612515149, -0.05511670718113928, -0.030708243362894353, -0.007335534275964249, -0.19702930395640775, 0.13722325335644805, 0.31182975981875444, 0.06429740194187955, 0.1724159271815474, -0.4598007064363233, -0.22303727743497423, 0.022661559453392908, 0.13919644538573053, 0.1379745817705339, -0.05091640382622506, -0.2822169406671626, 0.02399522694984682, -0.1224229415741482, -0.12233377766773798, -0.0949115410750342, 0.020822270049590818, 0.044834407351463455, -0.2699824078441706, 0.07130760449533488, -0.035751292687775785, 0.05980086905996598, -0.12409832467714887, -0.16751685570618643, -0.024949987177094516, 0.11460800519819524, 0.03766990171803176, 0.00964405263644145, 0.16327270797576554, -0.09307771747888521, -0.07208706659098812, 0.4222840167881647, -0.055270561702953754, -0.07367920043134643, 0.20985983759922863, -0.20209711286881865, -0.17740712647304632, 0.14147440681067952, 0.14653454016345416, 0.12968567331400951, -0.12666651136566734, 0.034075571863926485, -0.010066287817664502, 0.1571749050398107, 0.03149374032031218, 0.05999337749324681, 0.19003451661777127, 0.1362980378921642, -0.04002179909459597, 0.055368468019314464, -0.1331803943535905, -0.07901389148201822, -0.3036741864860289, -0.11061269088633369, -0.13237313337104264, 0.03346932579062937, -0.09241756167302952, -0.14441523697342754, 0.39108949660841563, 0.22086740118025464, 0.15596721002240052, -0.024070015421693118, 0.27575904509240345, 0.0926470866647022, 0.04397432105399148, 0.07508528771514232, 0.3330479289419487, 0.1612405746050771, 0.04511554232011585, -0.2683939639219018, 0.04196375058675113, 0.010806077188819416] |
1,802.08894 | Improving Recall of In Situ Sequencing by Self-Learned Features and a
Graphical Model | Image-based sequencing of mRNA makes it possible to see where in a tissue
sample a given gene is active, and thus discern large numbers of different cell
types in parallel. This is crucial for gaining a better understanding of tissue
development and disease such as cancer. Signals are collected over multiple
staining and imaging cycles, and signal density together with noise makes
signal decoding challenging. Previous approaches have led to low signal recall
in efforts to maintain high sensitivity. We propose an approach where signal
candidates are generously included, and true-signal probability at the cycle
level is self-learned using a convolutional neural network. Signal candidates
and probability predictions are thereafter fed into a graphical model searching
for signal candidates across sequencing cycles. The graphical model combines
intensity, probability and spatial distance to find optimal paths representing
decoded signal sequences. We evaluate our approach in relation to
state-of-the-art, and show that we increase recall by $27\%$ at maintained
sensitivity. Furthermore, visual examination shows that most of the now
correctly resolved signals were previously lost due to high signal density.
Thus, the proposed approach has the potential to significantly improve further
analysis of spatial statistics in in situ sequencing experiments.
| q-bio.QM cs.CV | imagebased sequencing of mrna makes it possible to see where in a tissue sample a given gene is active and thus discern large numbers of different cell types in parallel this is crucial for gaining a better understanding of tissue development and disease such as cancer signals are collected over multiple staining and imaging cycles and signal density together with noise makes signal decoding challenging previous approaches have led to low signal recall in efforts to maintain high sensitivity we propose an approach where signal candidates are generously included and truesignal probability at the cycle level is selflearned using a convolutional neural network signal candidates and probability predictions are thereafter fed into a graphical model searching for signal candidates across sequencing cycles the graphical model combines intensity probability and spatial distance to find optimal paths representing decoded signal sequences we evaluate our approach in relation to stateoftheart and show that we increase recall by 27 at maintained sensitivity furthermore visual examination shows that most of the now correctly resolved signals were previously lost due to high signal density thus the proposed approach has the potential to significantly improve further analysis of spatial statistics in in situ sequencing experiments | [['imagebased', 'sequencing', 'of', 'mrna', 'makes', 'it', 'possible', 'to', 'see', 'where', 'in', 'a', 'tissue', 'sample', 'a', 'given', 'gene', 'is', 'active', 'and', 'thus', 'discern', 'large', 'numbers', 'of', 'different', 'cell', 'types', 'in', 'parallel', 'this', 'is', 'crucial', 'for', 'gaining', 'a', 'better', 'understanding', 'of', 'tissue', 'development', 'and', 'disease', 'such', 'as', 'cancer', 'signals', 'are', 'collected', 'over', 'multiple', 'staining', 'and', 'imaging', 'cycles', 'and', 'signal', 'density', 'together', 'with', 'noise', 'makes', 'signal', 'decoding', 'challenging', 'previous', 'approaches', 'have', 'led', 'to', 'low', 'signal', 'recall', 'in', 'efforts', 'to', 'maintain', 'high', 'sensitivity', 'we', 'propose', 'an', 'approach', 'where', 'signal', 'candidates', 'are', 'generously', 'included', 'and', 'truesignal', 'probability', 'at', 'the', 'cycle', 'level', 'is', 'selflearned', 'using', 'a', 'convolutional', 'neural', 'network', 'signal', 'candidates', 'and', 'probability', 'predictions', 'are', 'thereafter', 'fed', 'into', 'a', 'graphical', 'model', 'searching', 'for', 'signal', 'candidates', 'across', 'sequencing', 'cycles', 'the', 'graphical', 'model', 'combines', 'intensity', 'probability', 'and', 'spatial', 'distance', 'to', 'find', 'optimal', 'paths', 'representing', 'decoded', 'signal', 'sequences', 'we', 'evaluate', 'our', 'approach', 'in', 'relation', 'to', 'stateoftheart', 'and', 'show', 'that', 'we', 'increase', 'recall', 'by', '27', 'at', 'maintained', 'sensitivity', 'furthermore', 'visual', 'examination', 'shows', 'that', 'most', 'of', 'the', 'now', 'correctly', 'resolved', 'signals', 'were', 'previously', 'lost', 'due', 'to', 'high', 'signal', 'density', 'thus', 'the', 'proposed', 'approach', 'has', 'the', 'potential', 'to', 'significantly', 'improve', 'further', 'analysis', 'of', 'spatial', 'statistics', 'in', 'in', 'situ', 'sequencing', 'experiments']] | [-0.06485896925134632, 0.06830294687972524, -0.05318423796936794, 0.06070061561623163, -0.05583367589979343, -0.16738183334053772, 0.08007597919024036, 0.41549510961909053, -0.2423246404951495, -0.35296598814728053, 0.0678246438213409, -0.2806881760521248, -0.18459871914273193, 0.1829502104942895, -0.10341115370345524, 0.06502232506403198, 0.11740599250241282, 0.04204871625637135, 0.008933795570823728, -0.2476307170738603, 0.19911647579331468, 0.10592413531039573, 0.3370109084464118, 0.013567317135367296, 0.12881242272592985, -0.014617714801623586, -0.0982249557078452, -0.007904479816688348, -0.07777813662188943, 0.10220076525252937, 0.33462909776788335, 0.20742933084209672, 0.26703436814513304, -0.4382112854427991, -0.24485574330340334, 0.11100591464573281, 0.1633479022468218, 0.12562496713859025, -0.04347459004357514, -0.28042015068346476, 0.13573378462375138, -0.1241802112908495, -0.04141443119701092, -0.08580805176424647, 0.025155364510929448, 0.014434256911783617, -0.28552101048325346, 0.09486687102657625, 0.005668370651647325, 0.07763129708872456, -0.039039188390834076, -0.11960713770760573, -0.009031208103220096, 0.16219883940896482, 0.038252456942194986, 0.07233765021957538, 0.13830352216004038, -0.1492331633955547, -0.11753731333239353, 0.313845201485275, -0.046139048270616434, -0.16391607074700484, 0.2074521255495055, -0.13050740926058463, -0.14423793171849197, 0.17761097418683283, 0.19910711778249818, 0.06033236194912552, -0.17279174305181855, -0.01414224798398135, 0.058868869452448895, 0.20269021572460075, 0.09919629508965096, 0.03675271260556836, 0.2164789451839317, 0.23275534438943196, 0.030381401277473432, 0.11902848122698174, -0.185302176849614, -0.0441314444601238, -0.18165958148449762, -0.1335604823227537, -0.14865038263227975, -0.004090522668267681, -0.07830244142516057, -0.11617505125143579, 0.3972066506355774, 0.19848537019354665, 0.19604352885871407, 0.08841390036466663, 0.3185228441137499, 0.059036312592901326, 0.10168514534745951, 0.003979844206632091, 0.19418169202301935, 0.1088711304046736, 0.07814422284718603, -0.16353663303156568, 0.0935312008584476, -0.02119875182681315] |
1,802.08895 | A Semi-Smooth Newton Algorithm for High-Dimensional Nonconvex Sparse
Learning | The smoothly clipped absolute deviation (SCAD) and the minimax concave
penalty (MCP) penalized regression models are two important and widely used
nonconvex sparse learning tools that can handle variable selection and
parameter estimation simultaneously, and thus have potential applications in
various fields such as mining biological data in high-throughput biomedical
studies. Theoretically, these two models enjoy the oracle property even in the
high-dimensional settings, where the number of predictors $p$ may be much
larger than the number of observations $n$. However, numerically, it is quite
challenging to develop fast and stable algorithms due to their non-convexity
and non-smoothness. In this paper we develop a fast algorithm for SCAD and MCP
penalized learning problems. First, we show that the global minimizers of both
models are roots of the nonsmooth equations. Then, a semi-smooth Newton (SSN)
algorithm is employed to solve the equations. We prove that the SSN algorithm
converges locally and superlinearly to the Karush-Kuhn-Tucker (KKT) points.
Computational complexity analysis shows that the cost of the SSN algorithm per
iteration is $O(np)$. Combined with the warm-start technique, the SSN algorithm
can be very efficient and accurate. Simulation studies and a real data example
suggest that our SSN algorithm, with comparable solution accuracy with the
coordinate descent (CD) and the difference of convex (DC) proximal Newton
algorithms, is more computationally efficient.
| stat.CO stat.ME | the smoothly clipped absolute deviation scad and the minimax concave penalty mcp penalized regression models are two important and widely used nonconvex sparse learning tools that can handle variable selection and parameter estimation simultaneously and thus have potential applications in various fields such as mining biological data in highthroughput biomedical studies theoretically these two models enjoy the oracle property even in the highdimensional settings where the number of predictors p may be much larger than the number of observations n however numerically it is quite challenging to develop fast and stable algorithms due to their nonconvexity and nonsmoothness in this paper we develop a fast algorithm for scad and mcp penalized learning problems first we show that the global minimizers of both models are roots of the nonsmooth equations then a semismooth newton ssn algorithm is employed to solve the equations we prove that the ssn algorithm converges locally and superlinearly to the karushkuhntucker kkt points computational complexity analysis shows that the cost of the ssn algorithm per iteration is onp combined with the warmstart technique the ssn algorithm can be very efficient and accurate simulation studies and a real data example suggest that our ssn algorithm with comparable solution accuracy with the coordinate descent cd and the difference of convex dc proximal newton algorithms is more computationally efficient | [['the', 'smoothly', 'clipped', 'absolute', 'deviation', 'scad', 'and', 'the', 'minimax', 'concave', 'penalty', 'mcp', 'penalized', 'regression', 'models', 'are', 'two', 'important', 'and', 'widely', 'used', 'nonconvex', 'sparse', 'learning', 'tools', 'that', 'can', 'handle', 'variable', 'selection', 'and', 'parameter', 'estimation', 'simultaneously', 'and', 'thus', 'have', 'potential', 'applications', 'in', 'various', 'fields', 'such', 'as', 'mining', 'biological', 'data', 'in', 'highthroughput', 'biomedical', 'studies', 'theoretically', 'these', 'two', 'models', 'enjoy', 'the', 'oracle', 'property', 'even', 'in', 'the', 'highdimensional', 'settings', 'where', 'the', 'number', 'of', 'predictors', 'p', 'may', 'be', 'much', 'larger', 'than', 'the', 'number', 'of', 'observations', 'n', 'however', 'numerically', 'it', 'is', 'quite', 'challenging', 'to', 'develop', 'fast', 'and', 'stable', 'algorithms', 'due', 'to', 'their', 'nonconvexity', 'and', 'nonsmoothness', 'in', 'this', 'paper', 'we', 'develop', 'a', 'fast', 'algorithm', 'for', 'scad', 'and', 'mcp', 'penalized', 'learning', 'problems', 'first', 'we', 'show', 'that', 'the', 'global', 'minimizers', 'of', 'both', 'models', 'are', 'roots', 'of', 'the', 'nonsmooth', 'equations', 'then', 'a', 'semismooth', 'newton', 'ssn', 'algorithm', 'is', 'employed', 'to', 'solve', 'the', 'equations', 'we', 'prove', 'that', 'the', 'ssn', 'algorithm', 'converges', 'locally', 'and', 'superlinearly', 'to', 'the', 'karushkuhntucker', 'kkt', 'points', 'computational', 'complexity', 'analysis', 'shows', 'that', 'the', 'cost', 'of', 'the', 'ssn', 'algorithm', 'per', 'iteration', 'is', 'onp', 'combined', 'with', 'the', 'warmstart', 'technique', 'the', 'ssn', 'algorithm', 'can', 'be', 'very', 'efficient', 'and', 'accurate', 'simulation', 'studies', 'and', 'a', 'real', 'data', 'example', 'suggest', 'that', 'our', 'ssn', 'algorithm', 'with', 'comparable', 'solution', 'accuracy', 'with', 'the', 'coordinate', 'descent', 'cd', 'and', 'the', 'difference', 'of', 'convex', 'dc', 'proximal', 'newton', 'algorithms', 'is', 'more', 'computationally', 'efficient']] | [-0.059463686600527366, -0.015250964376216406, -0.11136351867906374, 0.11530647685867734, -0.10424636148413872, -0.22097153448155277, 0.03216382867144208, 0.41815228543359123, -0.3202371841560216, -0.3245853371471677, 0.14428560479999133, -0.2593098102396856, -0.20520483332231096, 0.21107806939393553, -0.12038959426056917, 0.1305141558288065, 0.10315125792757204, -0.0012075768275501113, -0.08278303233546218, -0.314170199320928, 0.20343457187523803, 0.02294845730874296, 0.28347152290274663, -0.017872507350102543, 0.114333790770549, -0.032735023979250696, 0.0011934563554780871, 0.07966835798534085, -0.06925934719612964, 0.14622468652722498, 0.3138134157888002, 0.1908827218169678, 0.37854296172284374, -0.4032460109269051, -0.1670156292644963, 0.1704477497523217, 0.14629968922036662, 0.061188387748313276, -0.04965885674835291, -0.2042965626739578, 0.10234547116699072, -0.08705305312901042, -0.0818142478511622, -0.14658464425983392, -0.03574467722972915, 0.06938179850431593, -0.3480192921220083, 0.07407287540569153, 0.007552973527384744, 0.022919220546872853, -0.056949691811882676, -0.15689083703763818, 0.029455014964306227, 0.04146445894052517, 0.10259769547977336, 0.06033244816433281, 0.11240373341819553, -0.09137274239522715, -0.10531766888564326, 0.3458416584547456, -0.025085214711845317, -0.2187284429442801, 0.20337142593325136, -0.05896526446765859, -0.16206855648388602, 0.14694960125972895, 0.22963950720514154, 0.1810663478261872, -0.133177756823038, 0.09745466771145397, -0.017298616376412036, 0.14276927667053324, 0.02251117593783154, -0.036732937755835554, 0.07598398557596214, 0.16312333642075597, 0.16301071725585858, 0.1129043309302941, -0.10888710341732057, -0.09337962535635215, -0.24918482297516883, -0.12519066758738506, -0.2183955991321741, -0.04533610912837241, -0.18269789969628586, -0.1769530981158217, 0.35130483106833343, 0.1612171531100493, 0.16839253287507247, 0.12937419810311096, 0.3380530859050277, 0.11583637583311902, 0.0683709649333505, 0.14330507582168164, 0.2065233369910724, 0.11645112744932272, 0.09632058821703078, -0.2504903956727852, 0.07887095901434689, 0.09276235369714529] |
1,802.08896 | Vector-soliton storage and three-pulse-area theorem | In the present manuscript, we present a high-speed method to control,
manipulate and retrieve an intense vector soliton stored in the ground state
coherences of a four-level atomic system. Additionally, we show the importance
of the pulse area in determining the evolution of the system and present a
constant in the evolution defined as the three-pulse area, a surprising
extension to previously defined pulse areas.
| physics.atom-ph nlin.SI quant-ph | in the present manuscript we present a highspeed method to control manipulate and retrieve an intense vector soliton stored in the ground state coherences of a fourlevel atomic system additionally we show the importance of the pulse area in determining the evolution of the system and present a constant in the evolution defined as the threepulse area a surprising extension to previously defined pulse areas | [['in', 'the', 'present', 'manuscript', 'we', 'present', 'a', 'highspeed', 'method', 'to', 'control', 'manipulate', 'and', 'retrieve', 'an', 'intense', 'vector', 'soliton', 'stored', 'in', 'the', 'ground', 'state', 'coherences', 'of', 'a', 'fourlevel', 'atomic', 'system', 'additionally', 'we', 'show', 'the', 'importance', 'of', 'the', 'pulse', 'area', 'in', 'determining', 'the', 'evolution', 'of', 'the', 'system', 'and', 'present', 'a', 'constant', 'in', 'the', 'evolution', 'defined', 'as', 'the', 'threepulse', 'area', 'a', 'surprising', 'extension', 'to', 'previously', 'defined', 'pulse', 'areas']] | [-0.17158018602774694, 0.11753849154539729, -0.06599859050833262, 0.050711331774409, 0.00741217818397742, -0.08677782737291777, 0.04032370898371133, 0.39588260662097197, -0.28111405475781515, -0.3084792989091231, 0.07969571669371082, -0.23886433772456186, -0.1246144518829309, 0.20810937116352413, -0.043095097823355064, 0.055367089879627414, 0.03541660648272507, 0.040305048449394795, -0.02197892705981548, -0.19910983732686593, 0.29247228438751055, 0.03446000878914045, 0.2794996693873635, 0.023123699369338842, 0.14879406147564833, 0.030488863164702288, 0.015709013463660645, -0.023770706785412935, -0.1268973983466052, 0.14855696911422106, 0.2342671382527512, 0.11456611115091409, 0.26059806200030905, -0.4205777921785529, -0.22060629037710336, 0.05984971727459477, 0.16828376166522502, 0.16308931411745456, -0.10292093686472911, -0.2882616414760168, 0.0023346221790863917, -0.17766982953135785, -0.16133197312458203, -0.0575243623712315, 0.07035288561422091, 0.049112437106668946, -0.2108062735543801, 0.009574086018479788, 0.04020671998150647, 0.06808329046918796, -0.10784050081498348, -0.01317380450021189, 0.036972003609228594, 0.13658041448977132, -0.034841596263532455, 0.06481409510955788, 0.13495387433526607, -0.1430887431336137, -0.09904402998777537, 0.3607834475544783, -0.13092375068853682, -0.1390530242656286, 0.11109774639973273, -0.12699537653332718, -0.0680124499118672, 0.10696164102723392, 0.17509716681133097, 0.14105733511253046, -0.14237316149788407, 0.01896231783231577, -0.041304521835767306, 0.23019527663978245, 0.05366816716985061, 0.09400062509454214, 0.18329597430733535, 0.18403625138677082, 0.06404999564222705, 0.2278730253688991, -0.11033086192149383, -0.10165756660012099, -0.28286537879074997, -0.17733422139516244, -0.1844626615397059, 0.03702174870727154, 0.01493743771302084, -0.1500652915153366, 0.4570566626265645, 0.1488739316423352, 0.18668657218894133, -0.046723359622634374, 0.29468438929090135, 0.1119665046598619, 0.01970891165905274, 0.052815265256839876, 0.23874278830794188, 0.14419251183907572, 0.1549765563211762, -0.26684378021611616, 0.03614809489450776, 0.013260460301087454] |
1,802.08897 | Applications of Picard and Magnus expansions to the Rabi model | We apply the Picard and Magnus expansions to both the semiclassical and the
quantum Rabi model, with a switchable matter-field coupling. The case of the
quantum Rabi model ia a paradigmatic example of finite-time quantum
electrodynamics (QED), and in this case we build an intuitive diagrammatic
representation of the Picard series. In particular, we show that regular
oscillations in the mean number of photons, ascribed to the dynamical Casimir
effect (DCE) for the the generation of photons and to the anti-DCE for their
destruction, take place at twice the resonator frequency $\omega$. Such
oscillations, which are a clear dynamical "smoking gun" of the ultrastrong
coupling regime, can be predicted by first-order Picard expansion. We also show
that the Magnus expansion can be used, through concatenation, as an efficient
numerical integrator for both the semiclassical and the quantum Rabi model. In
the first case, we find distinctive features in the Fourier spectrum of motion,
with a single peak at the Rabi frequency $\Omega$ and doublets at frequencies
$2n\omega\pm\Omega$, with $n$ positive integer. We explain these doublets,
which are a feature beyond the rotating wave approximation (RWA), on the basis
of the Picard series.
| quant-ph cond-mat.mes-hall | we apply the picard and magnus expansions to both the semiclassical and the quantum rabi model with a switchable matterfield coupling the case of the quantum rabi model ia a paradigmatic example of finitetime quantum electrodynamics qed and in this case we build an intuitive diagrammatic representation of the picard series in particular we show that regular oscillations in the mean number of photons ascribed to the dynamical casimir effect dce for the the generation of photons and to the antidce for their destruction take place at twice the resonator frequency omega such oscillations which are a clear dynamical smoking gun of the ultrastrong coupling regime can be predicted by firstorder picard expansion we also show that the magnus expansion can be used through concatenation as an efficient numerical integrator for both the semiclassical and the quantum rabi model in the first case we find distinctive features in the fourier spectrum of motion with a single peak at the rabi frequency omega and doublets at frequencies 2nomegapmomega with n positive integer we explain these doublets which are a feature beyond the rotating wave approximation rwa on the basis of the picard series | [['we', 'apply', 'the', 'picard', 'and', 'magnus', 'expansions', 'to', 'both', 'the', 'semiclassical', 'and', 'the', 'quantum', 'rabi', 'model', 'with', 'a', 'switchable', 'matterfield', 'coupling', 'the', 'case', 'of', 'the', 'quantum', 'rabi', 'model', 'ia', 'a', 'paradigmatic', 'example', 'of', 'finitetime', 'quantum', 'electrodynamics', 'qed', 'and', 'in', 'this', 'case', 'we', 'build', 'an', 'intuitive', 'diagrammatic', 'representation', 'of', 'the', 'picard', 'series', 'in', 'particular', 'we', 'show', 'that', 'regular', 'oscillations', 'in', 'the', 'mean', 'number', 'of', 'photons', 'ascribed', 'to', 'the', 'dynamical', 'casimir', 'effect', 'dce', 'for', 'the', 'the', 'generation', 'of', 'photons', 'and', 'to', 'the', 'antidce', 'for', 'their', 'destruction', 'take', 'place', 'at', 'twice', 'the', 'resonator', 'frequency', 'omega', 'such', 'oscillations', 'which', 'are', 'a', 'clear', 'dynamical', 'smoking', 'gun', 'of', 'the', 'ultrastrong', 'coupling', 'regime', 'can', 'be', 'predicted', 'by', 'firstorder', 'picard', 'expansion', 'we', 'also', 'show', 'that', 'the', 'magnus', 'expansion', 'can', 'be', 'used', 'through', 'concatenation', 'as', 'an', 'efficient', 'numerical', 'integrator', 'for', 'both', 'the', 'semiclassical', 'and', 'the', 'quantum', 'rabi', 'model', 'in', 'the', 'first', 'case', 'we', 'find', 'distinctive', 'features', 'in', 'the', 'fourier', 'spectrum', 'of', 'motion', 'with', 'a', 'single', 'peak', 'at', 'the', 'rabi', 'frequency', 'omega', 'and', 'doublets', 'at', 'frequencies', '2nomegapmomega', 'with', 'n', 'positive', 'integer', 'we', 'explain', 'these', 'doublets', 'which', 'are', 'a', 'feature', 'beyond', 'the', 'rotating', 'wave', 'approximation', 'rwa', 'on', 'the', 'basis', 'of', 'the', 'picard', 'series']] | [-0.15679755901030376, 0.15102150047509394, -0.0815508573520831, 0.08047895345541878, -0.06326901636218057, -0.1398545688503368, 0.03335770577952968, 0.3407206556598866, -0.25378153866253844, -0.24409421474224258, 0.01618623124442858, -0.25668070484708544, -0.14204381990821846, 0.2260097080332115, 0.010392007035817658, 0.03572276769649647, 0.01765096089339459, 0.05548231087683539, -0.040186235203934315, -0.19825773203565072, 0.28701755381067384, 0.024945847721799662, 0.26198876198595733, 0.019773628796128977, 0.10745427224794842, -0.03939022988944037, 0.08119130227470975, -0.03961345234505481, -0.09796524239411146, 0.05452775939109282, 0.22555743890243987, 0.01832287583782957, 0.25543394743303977, -0.43200718989859077, -0.1923760800526102, 0.0848391466281567, 0.17935111530671258, 0.17782058928976158, -0.0345426769640677, -0.3061181476512797, 0.00752290275133171, -0.19363545706368865, -0.12044063239743573, -0.10736680360076978, 0.004781960348808329, 0.00690438085191771, -0.28203174666652736, 0.08402922595787125, 0.054501396241532, 0.050211471549347436, -0.01812892319654061, -0.046870228875896536, 0.02279673188593219, 0.07854769539565862, 0.012261430343127863, -0.023716793824060386, 0.09572131377833783, -0.11058354029719625, -0.1362974253953654, 0.38890394193963856, -0.14391796235653392, -0.15481664177459417, 0.14670624104035893, -0.21242944394233418, -0.09816361886402836, 0.09411955404703942, 0.13608784185166603, 0.11517745123552012, -0.056365521738052135, 0.07904009999773168, -0.008838294303036754, 0.1685257921036801, 0.09787693358494544, 0.049781499542686014, 0.20972946833780143, 0.11758106331589646, 0.01301992754086228, 0.13761442131606658, -0.08404410252876639, -0.09828718365151777, -0.3474351699069064, -0.13883397154417376, -0.17808867380978705, 0.07961026827842228, -0.09676309525969692, -0.17156692856132827, 0.4289361191962246, 0.13984413826789374, 0.17721752181200612, 0.038692597944669775, 0.3110038730905864, 0.19125500331079362, 0.05401828284716692, 0.034897895717593545, 0.27878730447051064, 0.15759920018861626, 0.056165313543215474, -0.30708397928800885, -0.039828558443894324, 0.08881971691564428] |
1,802.08898 | Dimensionally Tight Bounds for Second-Order Hamiltonian Monte Carlo | Hamiltonian Monte Carlo (HMC) is a widely deployed method to sample from
high-dimensional distributions in Statistics and Machine learning. HMC is known
to run very efficiently in practice and its popular second-order "leapfrog"
implementation has long been conjectured to run in $d^{1/4}$ gradient
evaluations. Here we show that this conjecture is true when sampling from
strongly log-concave target distributions that satisfy a weak third-order
regularity property associated with the input data. Our regularity condition is
weaker than the Lipschitz Hessian property and allows us to show faster
convergence bounds for a much larger class of distributions than would be
possible with the usual Lipschitz Hessian constant alone. Important
distributions that satisfy our regularity condition include posterior
distributions used in Bayesian logistic regression for which the data satisfies
an "incoherence" property. Our result compares favorably with the best
available bounds for the class of strongly log-concave distributions, which
grow like $d^{{1}/{2}}$ gradient evaluations with the dimension. Moreover, our
simulations on synthetic data suggest that, when our regularity condition is
satisfied, leapfrog HMC performs better than its competitors -- both in terms
of accuracy and in terms of the number of gradient evaluations it requires.
| cs.DS cs.LG math.PR stat.CO stat.ML | hamiltonian monte carlo hmc is a widely deployed method to sample from highdimensional distributions in statistics and machine learning hmc is known to run very efficiently in practice and its popular secondorder leapfrog implementation has long been conjectured to run in d14 gradient evaluations here we show that this conjecture is true when sampling from strongly logconcave target distributions that satisfy a weak thirdorder regularity property associated with the input data our regularity condition is weaker than the lipschitz hessian property and allows us to show faster convergence bounds for a much larger class of distributions than would be possible with the usual lipschitz hessian constant alone important distributions that satisfy our regularity condition include posterior distributions used in bayesian logistic regression for which the data satisfies an incoherence property our result compares favorably with the best available bounds for the class of strongly logconcave distributions which grow like d12 gradient evaluations with the dimension moreover our simulations on synthetic data suggest that when our regularity condition is satisfied leapfrog hmc performs better than its competitors both in terms of accuracy and in terms of the number of gradient evaluations it requires | [['hamiltonian', 'monte', 'carlo', 'hmc', 'is', 'a', 'widely', 'deployed', 'method', 'to', 'sample', 'from', 'highdimensional', 'distributions', 'in', 'statistics', 'and', 'machine', 'learning', 'hmc', 'is', 'known', 'to', 'run', 'very', 'efficiently', 'in', 'practice', 'and', 'its', 'popular', 'secondorder', 'leapfrog', 'implementation', 'has', 'long', 'been', 'conjectured', 'to', 'run', 'in', 'd14', 'gradient', 'evaluations', 'here', 'we', 'show', 'that', 'this', 'conjecture', 'is', 'true', 'when', 'sampling', 'from', 'strongly', 'logconcave', 'target', 'distributions', 'that', 'satisfy', 'a', 'weak', 'thirdorder', 'regularity', 'property', 'associated', 'with', 'the', 'input', 'data', 'our', 'regularity', 'condition', 'is', 'weaker', 'than', 'the', 'lipschitz', 'hessian', 'property', 'and', 'allows', 'us', 'to', 'show', 'faster', 'convergence', 'bounds', 'for', 'a', 'much', 'larger', 'class', 'of', 'distributions', 'than', 'would', 'be', 'possible', 'with', 'the', 'usual', 'lipschitz', 'hessian', 'constant', 'alone', 'important', 'distributions', 'that', 'satisfy', 'our', 'regularity', 'condition', 'include', 'posterior', 'distributions', 'used', 'in', 'bayesian', 'logistic', 'regression', 'for', 'which', 'the', 'data', 'satisfies', 'an', 'incoherence', 'property', 'our', 'result', 'compares', 'favorably', 'with', 'the', 'best', 'available', 'bounds', 'for', 'the', 'class', 'of', 'strongly', 'logconcave', 'distributions', 'which', 'grow', 'like', 'd12', 'gradient', 'evaluations', 'with', 'the', 'dimension', 'moreover', 'our', 'simulations', 'on', 'synthetic', 'data', 'suggest', 'that', 'when', 'our', 'regularity', 'condition', 'is', 'satisfied', 'leapfrog', 'hmc', 'performs', 'better', 'than', 'its', 'competitors', 'both', 'in', 'terms', 'of', 'accuracy', 'and', 'in', 'terms', 'of', 'the', 'number', 'of', 'gradient', 'evaluations', 'it', 'requires']] | [-0.03623386753800636, 0.048627303955148214, -0.11769195212521784, 0.12450583019381156, -0.11005862228679082, -0.1674199639892322, -0.014919164590537548, 0.40834196342984797, -0.2567725886910921, -0.2988955253943762, 0.1104058653084697, -0.26187973269414516, -0.10715810469385663, 0.21719119638152762, -0.07196589036660346, 0.11374470557287471, 0.13419357367577808, 0.022816475900375128, -0.10909207709513187, -0.32000957195365726, 0.2686362860926863, 0.06323803977769178, 0.3130498049407227, 0.012734055453620385, 0.09896955853704033, -0.02401313732601314, 0.00990060152253136, -0.005211979199202688, -0.1369428354817804, 0.10959159307337056, 0.21553303562662526, 0.16819331984394617, 0.30014610504986194, -0.38021882151448, -0.19486998152691135, 0.15321235189730942, 0.13562264616969819, 0.060194743227233026, -0.026768370166602534, -0.2504320927837398, 0.09969830321127422, -0.11975754919694737, -0.14059166283626232, -0.14419502877960136, -0.04455590532355321, 0.04316456757139046, -0.3634428318958574, 0.10768148516399378, 0.07997927489244223, 0.037803536933400515, 0.004306772319675171, -0.1606140417570714, -0.024835182483608758, 0.04030648241465921, 0.08187358611818733, 0.06640137571230298, 0.09079140678901847, -0.11731355529749028, -0.08120233286111518, 0.3512458903399723, -0.0843043431825663, -0.25890290037568775, 0.211978167341537, -0.13640577962602643, -0.1740054960228008, 0.12666812679041564, 0.15104666369249267, 0.16507198649802982, -0.10944524033235818, 0.08963651038963387, -0.053847495686568436, 0.15428360091755167, 0.03381193266553358, 0.010936246395431226, 0.03173262050404446, 0.14189749886281788, 0.15663081067517245, 0.14438713980962348, -0.07313203029631647, -0.1518648717007333, -0.2809834068660469, -0.12853140646863417, -0.25293169708311325, 0.029026187188719632, -0.15861113385684197, -0.1739523515655795, 0.3195531996122251, 0.21686222854380807, 0.16628079360331563, 0.1795005911226326, 0.2992320101329824, 0.10064724687072157, 0.08584542623066227, 0.14172711740441932, 0.19369075745150136, 0.1357281738310121, 0.06973657474009087, -0.16543908683403666, 0.15193228323672278, 0.05529991784472562] |
1,802.08899 | Longitudinal Mapping Knot Invariant for SU(2) | The knot coloring polynomial defined by Eisermann for a finite pointed group
is generalized to an infinite pointed group as the longitudinal mapping
invariant of a knot. In turn this can be thought of as a generalization of the
quandle 2-cocycle invariant for finite quandles. If the group is a topological
group then this invariant can be thought of a topological generalization of the
2-cocycle invariant. The longitudinal mapping invariant is based on a
meridian-longitude pair in the knot group. We also give an interpretation of
the invariant in terms of quandle colorings of a 1-tangle for generalized
Alexander quandles without use of a meridian-longitude pair in the knot group.
The invariant values are concretely evaluated for the torus knots $T(2,n)$,
their mirror images, and the figure eight knot for the group $SU(2)$.
| math.GT | the knot coloring polynomial defined by eisermann for a finite pointed group is generalized to an infinite pointed group as the longitudinal mapping invariant of a knot in turn this can be thought of as a generalization of the quandle 2cocycle invariant for finite quandles if the group is a topological group then this invariant can be thought of a topological generalization of the 2cocycle invariant the longitudinal mapping invariant is based on a meridianlongitude pair in the knot group we also give an interpretation of the invariant in terms of quandle colorings of a 1tangle for generalized alexander quandles without use of a meridianlongitude pair in the knot group the invariant values are concretely evaluated for the torus knots t2n their mirror images and the figure eight knot for the group su2 | [['the', 'knot', 'coloring', 'polynomial', 'defined', 'by', 'eisermann', 'for', 'a', 'finite', 'pointed', 'group', 'is', 'generalized', 'to', 'an', 'infinite', 'pointed', 'group', 'as', 'the', 'longitudinal', 'mapping', 'invariant', 'of', 'a', 'knot', 'in', 'turn', 'this', 'can', 'be', 'thought', 'of', 'as', 'a', 'generalization', 'of', 'the', 'quandle', '2cocycle', 'invariant', 'for', 'finite', 'quandles', 'if', 'the', 'group', 'is', 'a', 'topological', 'group', 'then', 'this', 'invariant', 'can', 'be', 'thought', 'of', 'a', 'topological', 'generalization', 'of', 'the', '2cocycle', 'invariant', 'the', 'longitudinal', 'mapping', 'invariant', 'is', 'based', 'on', 'a', 'meridianlongitude', 'pair', 'in', 'the', 'knot', 'group', 'we', 'also', 'give', 'an', 'interpretation', 'of', 'the', 'invariant', 'in', 'terms', 'of', 'quandle', 'colorings', 'of', 'a', '1tangle', 'for', 'generalized', 'alexander', 'quandles', 'without', 'use', 'of', 'a', 'meridianlongitude', 'pair', 'in', 'the', 'knot', 'group', 'the', 'invariant', 'values', 'are', 'concretely', 'evaluated', 'for', 'the', 'torus', 'knots', 't2n', 'their', 'mirror', 'images', 'and', 'the', 'figure', 'eight', 'knot', 'for', 'the', 'group', 'su2']] | [-0.24679315282793884, 0.13414276560092042, -0.168615633727644, 0.10149080639045376, -0.1332545175285883, -0.12538564622853743, 0.01592459399817568, 0.3460473745891994, -0.32121029338150314, -0.26521922483207716, 0.0975990795502157, -0.20191342832174886, -0.16277368466200476, 0.17514096019140474, -0.13173033961687575, 0.0004936090669864577, 0.022067912476786383, 0.13561966232814346, -0.1142231341712459, -0.2243146417172146, 0.3669762371432488, -0.026432814061549972, 0.1897722361538785, 0.056138974064114416, 0.11901649833431072, -0.001915480204237004, -0.06073101426502972, 0.03303354287830492, -0.12943122381429104, 0.06562495514029279, 0.2743008532561362, 0.0045206175841899085, 0.11238983904618319, -0.29179607970207033, -0.13723439101313212, 0.15003680188039487, 0.14312549420829976, -0.0034705345892827168, -0.03321778453678372, -0.33240844111776713, 0.12294707396491007, -0.24981486835432323, -0.1432811607298914, -0.05543893152339892, 0.07788273763832297, -0.021088189297271045, -0.16832277829279052, -0.024662535639601465, 0.04223714007248142, 0.13684700852172682, 0.02907147871993595, -0.04154933812661153, -0.05817942304367369, 0.1269167206694626, 0.002727678785573296, 0.11612135755730736, 0.11700146983970296, -0.14016712894028222, -0.19465296031469762, 0.46156225418389746, -0.08698791745259907, -0.2795890022746541, 0.08697983877606351, -0.11684613928523366, -0.2260720062909196, 0.17531915361089914, 0.04673924348599306, 0.12173761895885973, -0.059626666409189275, 0.11085897703808521, -0.22177300109020012, 0.08445906225648342, 0.06482433084624284, -0.004835573159101786, 0.17043521566930311, 0.050480309298798216, 0.08624059675529486, 0.20968986391336797, -0.0076859923640520056, -0.011003436471307368, -0.33613527158388135, -0.26438198662468826, -0.1439580170783412, 0.10570280099372295, -0.09978933537819433, -0.16130442397358516, 0.4495171119360197, 0.02311629936185923, 0.15416387129560905, 0.10713662056293811, 0.21278043248016867, 0.0754916985981364, 0.11412283951931661, 0.04803032873050225, 0.11795326043978673, 0.20374020886304084, -0.08205250147236229, -0.16507501471752414, -0.04311499292750589, 0.2433272963742528] |
1,802.089 | Powers of tight Hamilton cycles in randomly perturbed hypergraphs | For $k\ge 2$ and $r\ge 1$ such that $k+r\ge 4$, we prove that, for any
$\alpha>0$, there exists $\epsilon>0$ such that the union of an $n$-vertex
$k$-graph with minimum codegree
$\left(1-\binom{k+r-2}{k-1}^{-1}+\alpha\right)n$ and a binomial random
$k$-graph $\mathbb{G}^{(k)}(n,p)$ with $p\ge
n^{-\binom{k+r-2}{k-1}^{-1}-\epsilon}$ on the same vertex set contains the
$r^{\text{th}}$ power of a tight Hamilton cycle with high probability. This
result for $r=1$ was first proved by McDowell and Mycroft.
| math.CO | for kge 2 and rge 1 such that krge 4 we prove that for any alpha0 there exists epsilon0 such that the union of an nvertex kgraph with minimum codegree left1binomkr2k11alpharightn and a binomial random kgraph mathbbgknp with pge nbinomkr2k11epsilon on the same vertex set contains the rtextth power of a tight hamilton cycle with high probability this result for r1 was first proved by mcdowell and mycroft | [['for', 'kge', '2', 'and', 'rge', '1', 'such', 'that', 'krge', '4', 'we', 'prove', 'that', 'for', 'any', 'alpha0', 'there', 'exists', 'epsilon0', 'such', 'that', 'the', 'union', 'of', 'an', 'nvertex', 'kgraph', 'with', 'minimum', 'codegree', 'left1binomkr2k11alpharightn', 'and', 'a', 'binomial', 'random', 'kgraph', 'mathbbgknp', 'with', 'pge', 'nbinomkr2k11epsilon', 'on', 'the', 'same', 'vertex', 'set', 'contains', 'the', 'rtextth', 'power', 'of', 'a', 'tight', 'hamilton', 'cycle', 'with', 'high', 'probability', 'this', 'result', 'for', 'r1', 'was', 'first', 'proved', 'by', 'mcdowell', 'and', 'mycroft']] | [-0.1876266557665076, 0.1321818060653186, -0.0019328986090840772, 0.014607062827053596, 0.008083732675004285, -0.21693311523995362, 0.02315710404946003, 0.35815575807282585, -0.22536166150530335, -0.28799668555438984, 0.08780735627078684, -0.3360995724215172, -0.14675968369920156, 0.1348988508398179, -0.08734546063351445, 0.0372500162338838, 0.11017605788219953, 0.13229418196715415, 0.06143052781771985, -0.27491492169792764, 0.308878454787191, -0.053231036668876186, 0.10579855290234264, 0.09101174537499901, 0.1504467726990697, 0.0520284655958676, 0.06423840032948647, 0.05303210046258755, -0.24874400645592232, 0.017769390797184315, 0.23358644402469508, 0.18142598518534214, 0.2697420675831381, -0.34303248897049343, -0.16398885076341685, 0.23551552349090343, 0.07841021045169327, 0.0008136330943671055, -0.040564595816249494, -0.14270916782697896, 0.2143144669244066, -0.1357252533780411, -0.16159033547592117, 0.009042995356139727, 0.14739494791137986, 0.02039476003847085, -0.3799409140483476, -0.0090877286347677, 0.17407245447975583, 0.05069184293870421, 0.013523404690204188, -0.2129459823772777, -0.04601381977045094, 0.0960766783427971, -0.07983001142565627, 0.11740020720390021, -0.043369805738620926, -0.06663489117408972, -0.16284700157120824, 0.34417041143751703, -0.07096844303305261, -0.11809765531506855, 0.08164717850740999, -0.17452751989185344, -0.23295958903327119, 0.10993422905085026, 0.024305080238264054, 0.10785269000916742, -0.027407966430473607, 0.16548811889242643, -0.13468081246537622, 0.17645960100344382, 0.1730907014616605, -0.03051983811019454, 0.0752702633762965, 0.07920182610541815, 0.2176442457889607, 0.12468400735815521, 0.0026964152821165044, 0.06649569597357186, -0.3600331926572835, -0.1175917445361847, -0.25390275274185115, 0.1627643350038852, -0.2546638749329304, -0.1702847889973782, 0.33426722248259466, 0.06313545789816999, 0.16097958717909933, 0.1870053392049158, 0.18886488321550132, 0.11136781898517256, -0.019158631503159995, 0.23018016806599917, 0.13341962099366356, 0.12236548576402129, -0.044532674299262, -0.12964253907557577, 0.012036579959385563, 0.15145435513113625] |
1,802.08901 | A quasi-physical dynamic reduced order model for thermospheric mass
density via Hermitian Space Dynamic Mode Decomposition | Thermospheric mass density is a major driver of satellite drag, the largest
source of uncertainty in accurately predicting the orbit of satellites in low
Earth orbit (LEO) pertinent to space situational awareness. Most existing
models for thermosphere are either physics-based or empirical. Physics-based
models offer the potential for good predictive/forecast capabilities but
require dedicated parallel resources for real-time evaluation and data
assimilative capabilities that have yet to be developed. Empirical models are
fast to evaluate, but offer very limited forecasting abilities. This paper
presents a methodology of developing a reduced-order dynamic model from
high-dimensional physics-based models by capturing the underlying dynamical
behavior. This work develops a quasi-physical reduced order model (ROM) for
thermospheric mass density using simulated output from NCAR's
Thermosphere-Ionosphere-Electrodynamics General Circular Model (TIE-GCM). The
ROM is derived using a dynamic system formulation from a large dataset of
TIE-GCM simulations spanning 12 years and covering a complete solar cycle.
Towards this end, a new reduced order modeling approach, based on Dynamic Mode
Decomposition with control (DMDc), that uses the Hermitian space of the problem
to derive the dynamics and input matrices in a tractable manner is developed.
Results show that the ROM performs well in serving as a reduced order surrogate
for TIE-GCM while almost always maintaining the forecast error to within 5\% of
the simulated densities after 24 hours.
| physics.space-ph physics.ao-ph physics.data-an | thermospheric mass density is a major driver of satellite drag the largest source of uncertainty in accurately predicting the orbit of satellites in low earth orbit leo pertinent to space situational awareness most existing models for thermosphere are either physicsbased or empirical physicsbased models offer the potential for good predictiveforecast capabilities but require dedicated parallel resources for realtime evaluation and data assimilative capabilities that have yet to be developed empirical models are fast to evaluate but offer very limited forecasting abilities this paper presents a methodology of developing a reducedorder dynamic model from highdimensional physicsbased models by capturing the underlying dynamical behavior this work develops a quasiphysical reduced order model rom for thermospheric mass density using simulated output from ncars thermosphereionosphereelectrodynamics general circular model tiegcm the rom is derived using a dynamic system formulation from a large dataset of tiegcm simulations spanning 12 years and covering a complete solar cycle towards this end a new reduced order modeling approach based on dynamic mode decomposition with control dmdc that uses the hermitian space of the problem to derive the dynamics and input matrices in a tractable manner is developed results show that the rom performs well in serving as a reduced order surrogate for tiegcm while almost always maintaining the forecast error to within 5 of the simulated densities after 24 hours | [['thermospheric', 'mass', 'density', 'is', 'a', 'major', 'driver', 'of', 'satellite', 'drag', 'the', 'largest', 'source', 'of', 'uncertainty', 'in', 'accurately', 'predicting', 'the', 'orbit', 'of', 'satellites', 'in', 'low', 'earth', 'orbit', 'leo', 'pertinent', 'to', 'space', 'situational', 'awareness', 'most', 'existing', 'models', 'for', 'thermosphere', 'are', 'either', 'physicsbased', 'or', 'empirical', 'physicsbased', 'models', 'offer', 'the', 'potential', 'for', 'good', 'predictiveforecast', 'capabilities', 'but', 'require', 'dedicated', 'parallel', 'resources', 'for', 'realtime', 'evaluation', 'and', 'data', 'assimilative', 'capabilities', 'that', 'have', 'yet', 'to', 'be', 'developed', 'empirical', 'models', 'are', 'fast', 'to', 'evaluate', 'but', 'offer', 'very', 'limited', 'forecasting', 'abilities', 'this', 'paper', 'presents', 'a', 'methodology', 'of', 'developing', 'a', 'reducedorder', 'dynamic', 'model', 'from', 'highdimensional', 'physicsbased', 'models', 'by', 'capturing', 'the', 'underlying', 'dynamical', 'behavior', 'this', 'work', 'develops', 'a', 'quasiphysical', 'reduced', 'order', 'model', 'rom', 'for', 'thermospheric', 'mass', 'density', 'using', 'simulated', 'output', 'from', 'ncars', 'thermosphereionosphereelectrodynamics', 'general', 'circular', 'model', 'tiegcm', 'the', 'rom', 'is', 'derived', 'using', 'a', 'dynamic', 'system', 'formulation', 'from', 'a', 'large', 'dataset', 'of', 'tiegcm', 'simulations', 'spanning', '12', 'years', 'and', 'covering', 'a', 'complete', 'solar', 'cycle', 'towards', 'this', 'end', 'a', 'new', 'reduced', 'order', 'modeling', 'approach', 'based', 'on', 'dynamic', 'mode', 'decomposition', 'with', 'control', 'dmdc', 'that', 'uses', 'the', 'hermitian', 'space', 'of', 'the', 'problem', 'to', 'derive', 'the', 'dynamics', 'and', 'input', 'matrices', 'in', 'a', 'tractable', 'manner', 'is', 'developed', 'results', 'show', 'that', 'the', 'rom', 'performs', 'well', 'in', 'serving', 'as', 'a', 'reduced', 'order', 'surrogate', 'for', 'tiegcm', 'while', 'almost', 'always', 'maintaining', 'the', 'forecast', 'error', 'to', 'within', '5', 'of', 'the', 'simulated', 'densities', 'after', '24', 'hours']] | [-0.07330614412331594, 0.06487857205729179, -0.06789686600891275, 0.0686628899404591, -0.06810095221756898, -0.12533808950977743, 0.045577713464057805, 0.36827432866626925, -0.22404781519381944, -0.36317991760533747, 0.12030775897918321, -0.22171136116557713, -0.1371335491224047, 0.22314585073223048, -0.08335439050877357, 0.09418009886542952, 0.117427784884725, -0.01107386960498476, -0.06544886270021046, -0.19662386322727238, 0.22976618393008177, 0.10350716538052288, 0.2576849308172497, -0.027843313572560906, 0.12474386056793273, -0.014707092275851569, -0.049171367912887544, 0.015115469895728326, -0.10043645082433456, 0.13891910128946922, 0.27311429059766545, 0.15876401254027192, 0.28739831336013494, -0.43437055808731245, -0.2645787538473554, 0.059491960148630375, 0.10854354970703978, 0.0778420840511782, -0.03436720932603156, -0.24361337532520022, 0.05932161276690115, -0.22994218269200706, -0.13295507357763384, -0.08952701202040504, 0.0231093488785293, -0.009942986131720502, -0.3049021833367996, 0.08160667820543119, 0.020048175818674532, 0.0941512999124825, -0.07387019223704455, -0.11156257780144897, -0.01639340840463757, 0.13690974914261628, 0.005256400193694398, 0.03803800179520536, 0.12984244216237764, -0.09965659072158731, -0.09245656352755058, 0.40700122871683964, -0.06958436146549402, -0.17541561680450746, 0.18748004116340106, -0.11100006042210676, -0.12313460398875518, 0.1433036945655583, 0.22584342608765545, 0.07586057192203802, -0.18160101340724788, 0.05564380585418378, -0.002964414063405348, 0.19082665042054558, -0.006591411015881789, -0.03974900268944228, 0.2067353416302609, 0.25234234499223873, 0.09234342215168333, 0.07926980609665923, -0.1072053689254104, -0.11121157157435638, -0.21275141831154193, -0.10311797926951506, -0.1469505852222637, 0.0026422046112118784, -0.08756838865620095, -0.14548402385136813, 0.4177240740225881, 0.2018955068432068, 0.17876322373401785, 0.10126957074320371, 0.37265437638062404, 0.0962162287686866, 0.053119853162420315, 0.10534763195094815, 0.21921303433818964, 0.07840117604381361, 0.11703363303073741, -0.18383492071313973, 0.07948301859635758, 0.06037829699071654] |
1,802.08902 | Galois descent for higher Brauer groups | For $X$ a smooth projective variety over a field $k$, we consider the problem
of Galois descent for higher Brauer groups. More precisely, we extend a
finiteness result of Colliot-Th\'el\`ene and Skorobogatov to higher Brauer
groups.
| math.AG | for x a smooth projective variety over a field k we consider the problem of galois descent for higher brauer groups more precisely we extend a finiteness result of colliotthelene and skorobogatov to higher brauer groups | [['for', 'x', 'a', 'smooth', 'projective', 'variety', 'over', 'a', 'field', 'k', 'we', 'consider', 'the', 'problem', 'of', 'galois', 'descent', 'for', 'higher', 'brauer', 'groups', 'more', 'precisely', 'we', 'extend', 'a', 'finiteness', 'result', 'of', 'colliotthelene', 'and', 'skorobogatov', 'to', 'higher', 'brauer', 'groups']] | [-0.20418214286716344, 0.0379747138876054, -0.14563188810522357, 0.09708769309024017, -0.11076638449190392, -0.13193573545302367, 0.008447652579181723, 0.33981083757761454, -0.32681834356238443, -0.24493201873782608, 0.03872911510471669, -0.18387170443828735, -0.11226117281734736, 0.27269105018220013, -0.2221551907197055, -0.07611398005651103, -0.030741161220551778, 0.09715081570256087, -0.14554571988992393, -0.4069709130627517, 0.405435623601079, -0.0911135556590226, 0.19946540773121846, 0.02150695662324627, 0.11425811683552133, 0.09604647459410545, 0.05241595006858309, 0.009697964207993614, -0.15286159028376764, 0.15937932192335008, 0.4020023031367196, 0.06134440222134193, 0.24689274607226253, -0.32864201187880504, -0.19489315299627682, 0.2895229208774658, 0.11322452446782133, 0.08963078307634634, -0.04020161389497742, -0.2586559247639444, 0.18277053538218346, -0.20155059018482765, -0.1330543076619506, -0.04221978426600496, 0.06630115561872824, -0.01165064527756638, -0.20938860469808182, -0.02094842969543404, 0.0688582719821069, 0.24004930863156915, -0.05885267071425915, -0.13828567336572128, -0.0548297583979244, 0.06161272030375484, -0.048324286048429914, 0.06680030106670326, 0.09544766810722649, -0.11742874317699009, -0.11241672881361511, 0.3385255036668645, -0.10448870352572864, -0.1293985838484433, 0.09728601942252782, -0.19107011519372463, -0.2076930452345146, 0.18080804667746028, 0.12406306196418074, 0.26955443314444794, 0.03938506217673421, 0.1650362149278711, -0.17420659899815089, 0.031170475219065946, 0.09897945880786413, -0.10028366366815236, 0.05495283986803972, 0.05901522221716328, 0.17987640559052429, 0.13039727747026417, 0.048846217997682594, 0.06912766483664098, -0.3319354651288854, -0.2527273174168335, 0.005037344125513401, 0.1692952216706342, -0.11165530781686862, -0.12341641907631937, 0.3959506905327241, 0.11548319857360588, 0.18119083924425972, 0.20624702594553432, 0.18615049946432313, -0.004296976245111889, 0.03761664539989498, 0.007079630055361324, 0.033077399608575635, 0.3494015291022758, -0.040759253228316084, -0.12037068766464169, -0.07435316607976954, 0.22220523531238237] |
1,802.08903 | Product Kernel Interpolation for Scalable Gaussian Processes | Recent work shows that inference for Gaussian processes can be performed
efficiently using iterative methods that rely only on matrix-vector
multiplications (MVMs). Structured Kernel Interpolation (SKI) exploits these
techniques by deriving approximate kernels with very fast MVMs. Unfortunately,
such strategies suffer badly from the curse of dimensionality. We develop a new
technique for MVM based learning that exploits product kernel structure. We
demonstrate that this technique is broadly applicable, resulting in linear
rather than exponential runtime with dimension for SKI, as well as
state-of-the-art asymptotic complexity for multi-task GPs.
| cs.LG stat.ML | recent work shows that inference for gaussian processes can be performed efficiently using iterative methods that rely only on matrixvector multiplications mvms structured kernel interpolation ski exploits these techniques by deriving approximate kernels with very fast mvms unfortunately such strategies suffer badly from the curse of dimensionality we develop a new technique for mvm based learning that exploits product kernel structure we demonstrate that this technique is broadly applicable resulting in linear rather than exponential runtime with dimension for ski as well as stateoftheart asymptotic complexity for multitask gps | [['recent', 'work', 'shows', 'that', 'inference', 'for', 'gaussian', 'processes', 'can', 'be', 'performed', 'efficiently', 'using', 'iterative', 'methods', 'that', 'rely', 'only', 'on', 'matrixvector', 'multiplications', 'mvms', 'structured', 'kernel', 'interpolation', 'ski', 'exploits', 'these', 'techniques', 'by', 'deriving', 'approximate', 'kernels', 'with', 'very', 'fast', 'mvms', 'unfortunately', 'such', 'strategies', 'suffer', 'badly', 'from', 'the', 'curse', 'of', 'dimensionality', 'we', 'develop', 'a', 'new', 'technique', 'for', 'mvm', 'based', 'learning', 'that', 'exploits', 'product', 'kernel', 'structure', 'we', 'demonstrate', 'that', 'this', 'technique', 'is', 'broadly', 'applicable', 'resulting', 'in', 'linear', 'rather', 'than', 'exponential', 'runtime', 'with', 'dimension', 'for', 'ski', 'as', 'well', 'as', 'stateoftheart', 'asymptotic', 'complexity', 'for', 'multitask', 'gps']] | [0.00032259103988579817, 0.014272272335679343, -0.10168194468394759, 0.10009687469246682, -0.13630634200434838, -0.20982650317398183, 0.0599450619545964, 0.43500506986727877, -0.28607478266414466, -0.27745129641019894, 0.14261102041601087, -0.17977813961967992, -0.22529887774268562, 0.26408200343715005, -0.10716711209166084, 0.14554733880684356, 0.12900796180507274, -0.04703925048220861, -0.11850257994858233, -0.2449746614588906, 0.31083515477419066, 0.0677448460581095, 0.3019875262476755, -0.03560453162690771, 0.1417089102559545, 0.034626667869141266, -0.055597794781114616, 0.0037586676856774964, -0.002177397036739217, 0.16937806260029084, 0.32029455044997457, 0.21351594729819912, 0.3004872390210335, -0.4467569465508287, -0.23055379636836856, 0.0928337334712779, 0.17995734383375644, 0.09284676670023564, -0.049432903464119674, -0.2565816060713168, 0.0837580995383055, -0.1589103865206995, -0.06046866811288709, -0.23126837310873055, -0.08663687789865006, 0.03808916205268228, -0.33847698925934167, 0.09628706081676182, 0.09873274169545726, 0.0474914144672286, 0.04432258741626662, -0.19502967727904238, 0.1207151067720496, 0.035263490390942925, 0.012899270466936941, 0.012483091376135859, 0.12304458795952496, -0.08045329726719705, -0.17317095258681292, 0.3016507284286735, -0.07046428876173594, -0.20828230328481184, 0.22864052018391365, -0.030430927804639834, -0.16218334321570949, 0.12976021131270388, 0.21627349506938057, 0.14280577046777712, -0.12627253577890127, 0.14279188927304878, -0.01259155147656631, 0.17316439599740538, 0.06535295942233185, 0.015125863384874014, 0.04320521140471101, 0.19215815086074675, 0.11626912108387044, 0.11243735088344162, -0.08429797248799731, -0.10455277109037289, -0.191301192875083, -0.09824227525727049, -0.23228386575303805, 0.022186150219751878, -0.13921250262182583, -0.20061056696799365, 0.31469448646949083, 0.18689809526379608, 0.2188648666108676, 0.1509926307611586, 0.3790233123503374, 0.11740900484813649, 0.12756125360277346, 0.1780625355963463, 0.16086148476526352, 0.06869341374709784, 0.09381117491218983, -0.15724572385373536, 0.10949190627139982, 0.12555945605520955] |
1,802.08904 | Finding Long Lost Lexell's Comet: The Fate of the First Discovered
Near-Earth Object | Jupiter-family Comet D/1770 L1 (Lexell) was the first discovered Near-Earth
Object (NEO), and passed the Earth on 1770 Jul 1 at a recorded distance of
0.015 au. The comet was subsequently lost due to unfavorable observing
circumstances during its next apparition followed by a close encounter with
Jupiter in 1779. Since then, the fate of D/Lexell has attracted interest from
the scientific community, and now we revisit this long-standing question. We
investigate the dynamical evolution of D/Lexell based on a set of orbits
recalculated using the observations made by Charles Messier, the comet's
discoverer, and find that there is a $98\%$ chance that D/Lexell remains in the
Solar System by the year of 2000. This finding remains valid even if a moderate
non-gravitational effect is imposed. Messier's observations also suggest that
the comet is one of the largest known near-Earth comets, with a nucleus of
$\gtrsim 10$ km in diameter. This implies that the comet should have been
detected by contemporary NEO surveys regardless of its activity level if it has
remained in the inner Solar System. We identify asteroid 2010 JL$_{33}$ as a
possible descendant of D/Lexell, with a $0.8\%$ probability of chance
alignment, but a direct orbital linkage of the two bodies has not been
successfully accomplished. We also use the recalculated orbit to investigate
the meteors potentially originating from D/Lexell. While no associated meteors
have been unambiguously detected, we show that meteor observations can be used
to better constrain the orbit of D/Lexell despite the comet being long lost.
| astro-ph.EP | jupiterfamily comet d1770 l1 lexell was the first discovered nearearth object neo and passed the earth on 1770 jul 1 at a recorded distance of 0015 au the comet was subsequently lost due to unfavorable observing circumstances during its next apparition followed by a close encounter with jupiter in 1779 since then the fate of dlexell has attracted interest from the scientific community and now we revisit this longstanding question we investigate the dynamical evolution of dlexell based on a set of orbits recalculated using the observations made by charles messier the comets discoverer and find that there is a 98 chance that dlexell remains in the solar system by the year of 2000 this finding remains valid even if a moderate nongravitational effect is imposed messiers observations also suggest that the comet is one of the largest known nearearth comets with a nucleus of gtrsim 10 km in diameter this implies that the comet should have been detected by contemporary neo surveys regardless of its activity level if it has remained in the inner solar system we identify asteroid 2010 jl_33 as a possible descendant of dlexell with a 08 probability of chance alignment but a direct orbital linkage of the two bodies has not been successfully accomplished we also use the recalculated orbit to investigate the meteors potentially originating from dlexell while no associated meteors have been unambiguously detected we show that meteor observations can be used to better constrain the orbit of dlexell despite the comet being long lost | [['jupiterfamily', 'comet', 'd1770', 'l1', 'lexell', 'was', 'the', 'first', 'discovered', 'nearearth', 'object', 'neo', 'and', 'passed', 'the', 'earth', 'on', '1770', 'jul', '1', 'at', 'a', 'recorded', 'distance', 'of', '0015', 'au', 'the', 'comet', 'was', 'subsequently', 'lost', 'due', 'to', 'unfavorable', 'observing', 'circumstances', 'during', 'its', 'next', 'apparition', 'followed', 'by', 'a', 'close', 'encounter', 'with', 'jupiter', 'in', '1779', 'since', 'then', 'the', 'fate', 'of', 'dlexell', 'has', 'attracted', 'interest', 'from', 'the', 'scientific', 'community', 'and', 'now', 'we', 'revisit', 'this', 'longstanding', 'question', 'we', 'investigate', 'the', 'dynamical', 'evolution', 'of', 'dlexell', 'based', 'on', 'a', 'set', 'of', 'orbits', 'recalculated', 'using', 'the', 'observations', 'made', 'by', 'charles', 'messier', 'the', 'comets', 'discoverer', 'and', 'find', 'that', 'there', 'is', 'a', '98', 'chance', 'that', 'dlexell', 'remains', 'in', 'the', 'solar', 'system', 'by', 'the', 'year', 'of', '2000', 'this', 'finding', 'remains', 'valid', 'even', 'if', 'a', 'moderate', 'nongravitational', 'effect', 'is', 'imposed', 'messiers', 'observations', 'also', 'suggest', 'that', 'the', 'comet', 'is', 'one', 'of', 'the', 'largest', 'known', 'nearearth', 'comets', 'with', 'a', 'nucleus', 'of', 'gtrsim', '10', 'km', 'in', 'diameter', 'this', 'implies', 'that', 'the', 'comet', 'should', 'have', 'been', 'detected', 'by', 'contemporary', 'neo', 'surveys', 'regardless', 'of', 'its', 'activity', 'level', 'if', 'it', 'has', 'remained', 'in', 'the', 'inner', 'solar', 'system', 'we', 'identify', 'asteroid', '2010', 'jl_33', 'as', 'a', 'possible', 'descendant', 'of', 'dlexell', 'with', 'a', '08', 'probability', 'of', 'chance', 'alignment', 'but', 'a', 'direct', 'orbital', 'linkage', 'of', 'the', 'two', 'bodies', 'has', 'not', 'been', 'successfully', 'accomplished', 'we', 'also', 'use', 'the', 'recalculated', 'orbit', 'to', 'investigate', 'the', 'meteors', 'potentially', 'originating', 'from', 'dlexell', 'while', 'no', 'associated', 'meteors', 'have', 'been', 'unambiguously', 'detected', 'we', 'show', 'that', 'meteor', 'observations', 'can', 'be', 'used', 'to', 'better', 'constrain', 'the', 'orbit', 'of', 'dlexell', 'despite', 'the', 'comet', 'being', 'long', 'lost']] | [-0.09143144526167298, 0.14835321878730115, -0.09590674649707105, 0.06744389390866515, -0.04884875849839375, -0.06546021297613316, 0.053778528095593296, 0.3548551620990337, -0.19613060795040016, -0.34579905520855303, 0.12656407189989335, -0.2821112588911979, -0.12540092290076146, 0.1654012967156453, -0.12156812251212606, 0.017278026119278964, 0.12997060181782488, 0.024338727132940895, -0.02410105290662789, -0.26775156533584954, 0.22358413325271095, 0.1165734923857986, 0.10948000305769853, 0.010685683393143314, 0.1271835374290565, -0.05513265576869837, -0.020795232753117895, -0.031815560439220035, -0.12596748835465288, 0.0732053374089899, 0.1936697722309789, 0.1697383569544144, 0.25692062389786285, -0.3792211425277483, -0.20422773422059942, 0.08556436477874192, 0.13488784010464094, 0.055054294352184036, -0.042832077169476686, -0.3092233492650585, 0.08968548521964743, -0.22502954130296607, -0.18892712679380236, 0.050930483902553954, 0.13445130142180603, -0.027751412647299422, -0.17837514038979407, 0.0492164481500908, 0.05041249559658774, 0.119353276890624, -0.09575214960152306, -0.1308144407859259, -0.06425391138441501, 0.14008329462925773, 0.10797816741721607, 0.06469550745874497, 0.11926859656505916, -0.048128906886156904, -0.06773374569284389, 0.4271107723021947, -0.04720412730940629, -0.023801063980353646, 0.22555390282077753, -0.2192098372681328, -0.17416266166047759, 0.1758254349472966, 0.14220890990387364, 0.10089496881644948, -0.16454832445190523, 0.044119224192838306, -0.06833916725558098, 0.19767959474494315, 0.12496083956324013, 0.005866278746870957, 0.29716239426234536, 0.14468469694406394, 0.04032209772760625, 0.09856786393096678, -0.21448932681910612, -0.032157660090040986, -0.16513768552679076, -0.11873632627768427, -0.18291954368251903, 0.073491063842844, -0.015834368164284084, -0.07203410522857762, 0.3418235341685424, 0.15293533320119793, 0.20477973665653104, -0.013064846762990856, 0.24880079551035142, 0.025407494192657316, 0.09787580816834476, 0.09613856173543088, 0.3874567403667513, 0.08238399682199979, 0.07716339855868862, -0.16722498714117834, 0.17361003383302157, 0.0322292537641633] |
1,802.08905 | Bubble tree convergence for harmonic maps into compact locally CAT(1)
spaces | We determine bubble tree convergence for a sequence of harmonic maps, with
uniform energy bounds, from a compact Riemann surface into a compact locally
CAT(1) space. In particular, we demonstrate energy quantization and the no-neck
property for such a sequence. In the smooth setting, Jost and Parker
respectively established these results by exploiting now classical arguments
for harmonic maps. Our work demonstrates that these results can be
reinterpreted geometrically. In the absence of a PDE, we take advantage of the
local convexity properties of the target space. Included in this paper are an
$\epsilon$-regularity theorem, an energy gap theorem, and a removable
singularity theorem for harmonic maps for harmonic maps into metric spaces with
upper curvature bounds. We also prove an isoperimetric inequality for conformal
harmonic maps with small image.
| math.DG | we determine bubble tree convergence for a sequence of harmonic maps with uniform energy bounds from a compact riemann surface into a compact locally cat1 space in particular we demonstrate energy quantization and the noneck property for such a sequence in the smooth setting jost and parker respectively established these results by exploiting now classical arguments for harmonic maps our work demonstrates that these results can be reinterpreted geometrically in the absence of a pde we take advantage of the local convexity properties of the target space included in this paper are an epsilonregularity theorem an energy gap theorem and a removable singularity theorem for harmonic maps for harmonic maps into metric spaces with upper curvature bounds we also prove an isoperimetric inequality for conformal harmonic maps with small image | [['we', 'determine', 'bubble', 'tree', 'convergence', 'for', 'a', 'sequence', 'of', 'harmonic', 'maps', 'with', 'uniform', 'energy', 'bounds', 'from', 'a', 'compact', 'riemann', 'surface', 'into', 'a', 'compact', 'locally', 'cat1', 'space', 'in', 'particular', 'we', 'demonstrate', 'energy', 'quantization', 'and', 'the', 'noneck', 'property', 'for', 'such', 'a', 'sequence', 'in', 'the', 'smooth', 'setting', 'jost', 'and', 'parker', 'respectively', 'established', 'these', 'results', 'by', 'exploiting', 'now', 'classical', 'arguments', 'for', 'harmonic', 'maps', 'our', 'work', 'demonstrates', 'that', 'these', 'results', 'can', 'be', 'reinterpreted', 'geometrically', 'in', 'the', 'absence', 'of', 'a', 'pde', 'we', 'take', 'advantage', 'of', 'the', 'local', 'convexity', 'properties', 'of', 'the', 'target', 'space', 'included', 'in', 'this', 'paper', 'are', 'an', 'epsilonregularity', 'theorem', 'an', 'energy', 'gap', 'theorem', 'and', 'a', 'removable', 'singularity', 'theorem', 'for', 'harmonic', 'maps', 'for', 'harmonic', 'maps', 'into', 'metric', 'spaces', 'with', 'upper', 'curvature', 'bounds', 'we', 'also', 'prove', 'an', 'isoperimetric', 'inequality', 'for', 'conformal', 'harmonic', 'maps', 'with', 'small', 'image']] | [-0.11358141633323753, 0.06796613082574018, -0.11356169561354014, 0.11668592691690159, -0.0528937485642158, -0.08381090531698786, 0.02123406476323278, 0.37089240474339863, -0.2924338486081419, -0.22166434560651677, 0.1181495016378064, -0.24201541897446777, -0.13922665579459415, 0.25422293787392286, -0.11042487775692, 0.05031451584341434, 0.06702401246159123, 0.013346821241653883, -0.07137366595964592, -0.22920855320363234, 0.3884421033354906, -0.004852912102181178, 0.21604525573157635, 0.11290883947736942, 0.10831709669258159, -0.002809315645852341, -0.01469134046123005, 0.022187039280722205, -0.19708068330907666, 0.14978779847375476, 0.24772982760332524, 0.07857308715331153, 0.25281039928802507, -0.39641426707116456, -0.2193226593331649, 0.14259036615705833, 0.1030581459026927, 0.06633103876911964, -0.07520543132156421, -0.31156736961924114, 0.07986688355449587, -0.07164684483387436, -0.17477140927042525, -0.10846277518833701, -0.02769518759674751, 0.037681609912453076, -0.2811961928919817, 0.05799870688553291, 0.190092568916197, 0.05406066903356427, -0.12877155464778367, -0.04850592506834521, -0.04299925600644201, 0.10206694594369485, 0.00035352320052110234, 0.06976217869310998, 0.07731959406250657, -0.06797904124519286, -0.09371873177677537, 0.3143618025458776, -0.13062451643726, -0.26798218205893554, 0.11758750823612969, -0.14617110748882764, -0.18708177100902854, 0.10574540588377904, 0.14705303902379596, 0.11559694286865684, -0.1076451788799694, 0.14777369827900727, -0.05838949837220403, 0.11613521427990725, 0.12793574267102836, 0.0347214513243391, 0.16270618192278422, 0.08527623823879717, 0.16472021408128337, 0.1899858024642946, -0.06314650811478854, -0.06234562122755541, -0.34561025989600097, -0.20329474814666004, -0.20542278186633037, 0.07739810825038988, -0.1591098246591103, -0.17532968239393085, 0.34936104003483287, 0.026879996676423337, 0.18740852921126552, 0.1399932381470325, 0.2582470318911454, 0.12091219843669723, 0.014621333394629451, 0.09791327411165604, 0.21694087801644435, 0.176382373031587, 0.05100702088451586, -0.10168781386903272, -0.07165906715672463, 0.18134933101604334] |
1,802.08906 | Multi-frequency Raman amplifiers | In its usual implementation, the Raman amplifier features only one pump
carrier frequency. However, pulses with well-separated frequencies can also be
Raman amplified while compressed in time. Amplification with
frequency-separated pumps is shown to hold even in the highly nonlinear,
pump-depletion regime, as derived through a fluid model, and demonstrated via
particle-in-cell (PIC) simulations. The resulting efficiency is similar to
single-frequency amplifiers, but, due to the beat-wave waveform of both the
pump lasers and the amplified seed pulses, these amplifiers feature higher seed
intensities with a shorter spike duration. Advantageously, these amplifiers
also suffer less noise backscattering, because the total fluence is split
between the different spectral components.
| physics.plasm-ph physics.optics | in its usual implementation the raman amplifier features only one pump carrier frequency however pulses with wellseparated frequencies can also be raman amplified while compressed in time amplification with frequencyseparated pumps is shown to hold even in the highly nonlinear pumpdepletion regime as derived through a fluid model and demonstrated via particleincell pic simulations the resulting efficiency is similar to singlefrequency amplifiers but due to the beatwave waveform of both the pump lasers and the amplified seed pulses these amplifiers feature higher seed intensities with a shorter spike duration advantageously these amplifiers also suffer less noise backscattering because the total fluence is split between the different spectral components | [['in', 'its', 'usual', 'implementation', 'the', 'raman', 'amplifier', 'features', 'only', 'one', 'pump', 'carrier', 'frequency', 'however', 'pulses', 'with', 'wellseparated', 'frequencies', 'can', 'also', 'be', 'raman', 'amplified', 'while', 'compressed', 'in', 'time', 'amplification', 'with', 'frequencyseparated', 'pumps', 'is', 'shown', 'to', 'hold', 'even', 'in', 'the', 'highly', 'nonlinear', 'pumpdepletion', 'regime', 'as', 'derived', 'through', 'a', 'fluid', 'model', 'and', 'demonstrated', 'via', 'particleincell', 'pic', 'simulations', 'the', 'resulting', 'efficiency', 'is', 'similar', 'to', 'singlefrequency', 'amplifiers', 'but', 'due', 'to', 'the', 'beatwave', 'waveform', 'of', 'both', 'the', 'pump', 'lasers', 'and', 'the', 'amplified', 'seed', 'pulses', 'these', 'amplifiers', 'feature', 'higher', 'seed', 'intensities', 'with', 'a', 'shorter', 'spike', 'duration', 'advantageously', 'these', 'amplifiers', 'also', 'suffer', 'less', 'noise', 'backscattering', 'because', 'the', 'total', 'fluence', 'is', 'split', 'between', 'the', 'different', 'spectral', 'components']] | [-0.11701658647177952, 0.21371233351704366, -0.038337388888598896, 0.011689560695437117, -0.031146881276003596, -0.2098168792238213, 0.012465519394576198, 0.4845107873936869, -0.27018289038700594, -0.2816914347777987, 0.06566582939736897, -0.24250159554572268, -0.07539767141998657, 0.2913725156104192, -0.02569102082963822, 0.02135314336892235, 0.03852893880629947, -0.051226303613973116, 0.018022060307524748, -0.15827351876639956, 0.19696360589268636, 0.1407446252041549, 0.3700348374561213, -0.03891437018799754, 0.11751401859757332, -0.06363448043318712, 0.01718325140657571, -0.09130727976367299, -0.019249133592172753, 0.01169243309963143, 0.30152783674662403, 0.0027392245669858005, 0.25331544868191175, -0.47023913761565705, -0.2853919794466698, 0.06363760007387202, 0.15392508865378024, 0.1487609119866184, -0.04943755254992899, -0.24622645544520808, 0.07039376241726063, -0.14560542480563218, -0.042361679333174286, -0.03267138445187571, -0.01980174581502687, 0.10074536421364788, -0.277520588959374, 0.05481097367449382, 0.0776240959904104, -0.007482312927198298, 0.0041070265952445, -0.028131268760365136, -0.07332675738857602, 0.027572760935038118, 0.04038609328069109, -0.01709224288088252, 0.17192178044714174, -0.14726278398467121, -0.08408657572109182, 0.3507379563964622, -0.07576163479496005, -0.12927221917170584, 0.19631652364052637, -0.18803005279832571, 0.008624950889497995, 0.2309031720615853, 0.1223317167407587, 0.10260251752663192, -0.09059491095996357, -0.0404977795640078, 0.08653589857759762, 0.2923705346919684, 0.19383534222384388, 0.13623898345449903, 0.16949178305243687, 0.1354234320658505, 0.03411260220590915, 0.15771305727451723, -0.1279065189619531, -0.01586207388988081, -0.22962651973730833, -0.009228861477788328, -0.17973708061343235, 0.04488140774258184, -0.0773193319237523, -0.12198456412017618, 0.42051746928185785, 0.1760301149366775, 0.12238449002668275, 0.01912292838975225, 0.38582343277785014, 0.22168821084888582, 0.08016170584596694, 0.03290281559885392, 0.30394281962675584, 0.18726182646856135, 0.10064935411836179, -0.23799150875541117, -0.005532063745875966, -0.027009675395675004] |
1,802.08907 | Muon Hunter: a Zooniverse project | The large datasets and often low signal-to-noise inherent to the raw data of
modern astroparticle experiments calls out for increasingly sophisticated event
classification techniques. Machine learning algorithms, such as neural
networks, have the potential to outperform traditional analysis methods, but
come with the major challenge of identifying reliably classified training
samples from real data. Citizen science represents an effective approach to
sort through the large datasets efficiently and meet this challenge. Muon
Hunter is a project hosted on the Zooniverse platform, wherein volunteers sort
through pictures of data from the VERITAS cameras to identify muon ring images.
Each image is classified multiple times to produce a "clean" dataset used to
train and validate a convolutional neural network model both able to reject
background events and identify suitable calibration data to monitor the
telescope performance as a function of time.
| astro-ph.IM astro-ph.HE physics.data-an | the large datasets and often low signaltonoise inherent to the raw data of modern astroparticle experiments calls out for increasingly sophisticated event classification techniques machine learning algorithms such as neural networks have the potential to outperform traditional analysis methods but come with the major challenge of identifying reliably classified training samples from real data citizen science represents an effective approach to sort through the large datasets efficiently and meet this challenge muon hunter is a project hosted on the zooniverse platform wherein volunteers sort through pictures of data from the veritas cameras to identify muon ring images each image is classified multiple times to produce a clean dataset used to train and validate a convolutional neural network model both able to reject background events and identify suitable calibration data to monitor the telescope performance as a function of time | [['the', 'large', 'datasets', 'and', 'often', 'low', 'signaltonoise', 'inherent', 'to', 'the', 'raw', 'data', 'of', 'modern', 'astroparticle', 'experiments', 'calls', 'out', 'for', 'increasingly', 'sophisticated', 'event', 'classification', 'techniques', 'machine', 'learning', 'algorithms', 'such', 'as', 'neural', 'networks', 'have', 'the', 'potential', 'to', 'outperform', 'traditional', 'analysis', 'methods', 'but', 'come', 'with', 'the', 'major', 'challenge', 'of', 'identifying', 'reliably', 'classified', 'training', 'samples', 'from', 'real', 'data', 'citizen', 'science', 'represents', 'an', 'effective', 'approach', 'to', 'sort', 'through', 'the', 'large', 'datasets', 'efficiently', 'and', 'meet', 'this', 'challenge', 'muon', 'hunter', 'is', 'a', 'project', 'hosted', 'on', 'the', 'zooniverse', 'platform', 'wherein', 'volunteers', 'sort', 'through', 'pictures', 'of', 'data', 'from', 'the', 'veritas', 'cameras', 'to', 'identify', 'muon', 'ring', 'images', 'each', 'image', 'is', 'classified', 'multiple', 'times', 'to', 'produce', 'a', 'clean', 'dataset', 'used', 'to', 'train', 'and', 'validate', 'a', 'convolutional', 'neural', 'network', 'model', 'both', 'able', 'to', 'reject', 'background', 'events', 'and', 'identify', 'suitable', 'calibration', 'data', 'to', 'monitor', 'the', 'telescope', 'performance', 'as', 'a', 'function', 'of', 'time']] | [-0.029596045236404744, -0.003261733544624424, -0.07408665314236347, 0.11166573215440156, -0.12978225246426925, -0.19206863084955395, 0.03193726916227945, 0.39301773132555345, -0.24482106745432353, -0.4171810265657284, 0.11981055638652376, -0.3304762505731887, -0.11285526984205416, 0.25164376229396185, -0.09767680372305804, 0.08371727576599919, 0.1591949850821653, -0.0008479998574304066, -0.01740496593239389, -0.3037747584497757, 0.24687455786834303, 0.10555471442371821, 0.3665185900766858, -0.04244334874473673, 0.12492233347847033, -0.041492067096527106, -0.0894121241660725, -0.03402892910630824, -0.026169858016944724, 0.0997583451965596, 0.36888622786018915, 0.23015139182600722, 0.2889943254521961, -0.4438570230770454, -0.1747405556961894, 0.13290282965322836, 0.12801034365472444, 0.06990447699212932, -0.043913041468435, -0.36782163022447834, 0.07192969128067384, -0.15644337216780768, -0.04824870687125505, -0.13758990850480501, -0.00823123746789429, -0.006695231730989415, -0.25888370089701934, -0.007352218872125482, -0.03328876971206862, 0.0703497977084363, -0.026716865242371778, -0.08821740998005455, 0.026095269845879013, 0.19980637568699047, 0.05141367641589169, 0.08463455220892115, 0.1490123649446039, -0.16588056414608388, -0.1523075432000722, 0.37652536036225587, -0.03305076322645592, -0.12610810272154405, 0.21975461493594667, -0.046627198613965685, -0.15361207007370192, 0.13646060511094632, 0.28599161116017713, 0.07762825910651909, -0.21132417259697647, -0.014036977304130619, 0.002539025626326208, 0.19661609215742284, 0.00290339071095901, -0.024182950086194834, 0.2237862986713487, 0.26263613459526847, -0.0048184130596677045, 0.10762115279648105, -0.19364321311573973, -0.01536177808298267, -0.19274940871568264, -0.09837681753225892, -0.20702084081193847, 0.021198865167776512, -0.054791041685472636, -0.16209719475800935, 0.3632722449674867, 0.21546177095030067, 0.18906511802547912, 0.04528648728544978, 0.3783168801083062, -0.02148775318880371, 0.19549514416256825, 0.04863481431958272, 0.17599745528862926, 0.015016425282358553, 0.14602492647681037, -0.13545277233908903, 0.026094683496241302, -0.0076172106611214095] |
1,802.08908 | Scalable Private Learning with PATE | The rapid adoption of machine learning has increased concerns about the
privacy implications of machine learning models trained on sensitive data, such
as medical records or other personal information. To address those concerns,
one promising approach is Private Aggregation of Teacher Ensembles, or PATE,
which transfers to a "student" model the knowledge of an ensemble of "teacher"
models, with intuitive privacy provided by training teachers on disjoint data
and strong privacy guaranteed by noisy aggregation of teachers' answers.
However, PATE has so far been evaluated only on simple classification tasks
like MNIST, leaving unclear its utility when applied to larger-scale learning
tasks and real-world datasets.
In this work, we show how PATE can scale to learning tasks with large numbers
of output classes and uncurated, imbalanced training data with errors. For
this, we introduce new noisy aggregation mechanisms for teacher ensembles that
are more selective and add less noise, and prove their tighter
differential-privacy guarantees. Our new mechanisms build on two insights: the
chance of teacher consensus is increased by using more concentrated noise and,
lacking consensus, no answer need be given to a student. The consensus answers
used are more likely to be correct, offer better intuitive privacy, and incur
lower-differential privacy cost. Our evaluation shows our mechanisms improve on
the original PATE on all measures, and scale to larger tasks with both high
utility and very strong privacy ($\varepsilon$ < 1.0).
| stat.ML cs.CR cs.LG | the rapid adoption of machine learning has increased concerns about the privacy implications of machine learning models trained on sensitive data such as medical records or other personal information to address those concerns one promising approach is private aggregation of teacher ensembles or pate which transfers to a student model the knowledge of an ensemble of teacher models with intuitive privacy provided by training teachers on disjoint data and strong privacy guaranteed by noisy aggregation of teachers answers however pate has so far been evaluated only on simple classification tasks like mnist leaving unclear its utility when applied to largerscale learning tasks and realworld datasets in this work we show how pate can scale to learning tasks with large numbers of output classes and uncurated imbalanced training data with errors for this we introduce new noisy aggregation mechanisms for teacher ensembles that are more selective and add less noise and prove their tighter differentialprivacy guarantees our new mechanisms build on two insights the chance of teacher consensus is increased by using more concentrated noise and lacking consensus no answer need be given to a student the consensus answers used are more likely to be correct offer better intuitive privacy and incur lowerdifferential privacy cost our evaluation shows our mechanisms improve on the original pate on all measures and scale to larger tasks with both high utility and very strong privacy varepsilon 10 | [['the', 'rapid', 'adoption', 'of', 'machine', 'learning', 'has', 'increased', 'concerns', 'about', 'the', 'privacy', 'implications', 'of', 'machine', 'learning', 'models', 'trained', 'on', 'sensitive', 'data', 'such', 'as', 'medical', 'records', 'or', 'other', 'personal', 'information', 'to', 'address', 'those', 'concerns', 'one', 'promising', 'approach', 'is', 'private', 'aggregation', 'of', 'teacher', 'ensembles', 'or', 'pate', 'which', 'transfers', 'to', 'a', 'student', 'model', 'the', 'knowledge', 'of', 'an', 'ensemble', 'of', 'teacher', 'models', 'with', 'intuitive', 'privacy', 'provided', 'by', 'training', 'teachers', 'on', 'disjoint', 'data', 'and', 'strong', 'privacy', 'guaranteed', 'by', 'noisy', 'aggregation', 'of', 'teachers', 'answers', 'however', 'pate', 'has', 'so', 'far', 'been', 'evaluated', 'only', 'on', 'simple', 'classification', 'tasks', 'like', 'mnist', 'leaving', 'unclear', 'its', 'utility', 'when', 'applied', 'to', 'largerscale', 'learning', 'tasks', 'and', 'realworld', 'datasets', 'in', 'this', 'work', 'we', 'show', 'how', 'pate', 'can', 'scale', 'to', 'learning', 'tasks', 'with', 'large', 'numbers', 'of', 'output', 'classes', 'and', 'uncurated', 'imbalanced', 'training', 'data', 'with', 'errors', 'for', 'this', 'we', 'introduce', 'new', 'noisy', 'aggregation', 'mechanisms', 'for', 'teacher', 'ensembles', 'that', 'are', 'more', 'selective', 'and', 'add', 'less', 'noise', 'and', 'prove', 'their', 'tighter', 'differentialprivacy', 'guarantees', 'our', 'new', 'mechanisms', 'build', 'on', 'two', 'insights', 'the', 'chance', 'of', 'teacher', 'consensus', 'is', 'increased', 'by', 'using', 'more', 'concentrated', 'noise', 'and', 'lacking', 'consensus', 'no', 'answer', 'need', 'be', 'given', 'to', 'a', 'student', 'the', 'consensus', 'answers', 'used', 'are', 'more', 'likely', 'to', 'be', 'correct', 'offer', 'better', 'intuitive', 'privacy', 'and', 'incur', 'lowerdifferential', 'privacy', 'cost', 'our', 'evaluation', 'shows', 'our', 'mechanisms', 'improve', 'on', 'the', 'original', 'pate', 'on', 'all', 'measures', 'and', 'scale', 'to', 'larger', 'tasks', 'with', 'both', 'high', 'utility', 'and', 'very', 'strong', 'privacy', 'varepsilon', '10']] | [-0.04415792109519324, 0.03697574770263773, -0.04172484924234611, 0.12834785582605565, -0.1490515892260841, -0.24294670842571822, 0.1037102848426459, 0.42261074693042994, -0.26103734848133864, -0.3698397948037736, 0.07946161163952685, -0.28658776407763037, -0.13795032216290423, 0.20202185371910822, -0.1776967145345331, 0.08172817283901648, 0.12700004557584055, 0.047993327035403356, -0.010189423132214083, -0.36111271389139193, 0.322134162674787, 0.08383282080183846, 0.3335301998964394, 0.04989966873313377, 0.10258901850733648, -0.0412693958683141, -0.016327818040232058, -0.010949028361068628, -0.05664485894074665, 0.17069946462742064, 0.32242465673712634, 0.24231815450316804, 0.4078766101612447, -0.4140420278042426, -0.18040864028084974, 0.09912290830705396, 0.1224143360801912, 0.10963873043199003, -0.06746347136063516, -0.3378370503866763, 0.09399012639489654, -0.15482876357095868, 0.005673377767600345, -0.18181022162774974, -0.02425359356422703, -0.007729720117653281, -0.2822247837867701, 0.03594251994035525, 0.08680585141644462, 0.13051047207771507, -0.010628066374920309, -0.14679290834024097, 0.0030103248236116294, 0.18263166997285896, 0.07613845426983586, 0.01865129455524896, 0.16744229045910236, -0.1811673436656562, -0.17178389667815558, 0.35922223032810985, 0.002364014767239362, -0.1963439119617642, 0.21961386460312984, -0.06423761029844928, -0.1517161105394573, 0.07989873104119971, 0.2462457147793788, 0.07004852530554549, -0.16579565099971943, -0.004014490585768136, -0.01794742393504941, 0.2075146375671513, 0.04288539726053288, 0.030432825564866425, 0.1484808846380868, 0.20527623328093028, 0.07842531064384137, 0.1010341817501517, -0.024819464740132736, -0.08736868619715223, -0.181173660247627, -0.09077591259935588, -0.17960296613637972, 0.05009668517970678, -0.09762709618799814, -0.12051776960568736, 0.34065067620939893, 0.23528920310787307, 0.20911285260821252, 0.10217185171968123, 0.3426518599740613, 0.024423268064251775, 0.09130051779007393, 0.12014417562964352, 0.187103086562416, 0.016170957003764454, 0.1326844390311371, -0.13166399875925894, 0.15794297354447037, -0.047619753311593814] |
1,802.08909 | Free-breathing cardiac MRI using bandlimited manifold modelling | We introduce a novel bandlimited manifold framework and an algorithm to
recover freebreathing and ungated cardiac MR images from highly undersampled
measurements. The image frames in the free breathing and ungated dataset are
assumed to be points on a bandlimited manifold. We introduce a novel kernel
low-rank algorithm to estimate the manifold structure (Laplacian) from a
navigator-based acquisition scheme. The structure of the manifold is then used
to recover the images from highly undersampled measurements. A computationally
efficient algorithm, which relies on the bandlimited approximation of the
Laplacian matrix, is used to recover the images. The proposed scheme is
demonstrated on several patients with different breathing patterns and cardiac
rates, without requiring the need for manually tuning the reconstruction
parameters in each case. The proposed scheme enabled the recovery of
free-breathing and ungated data, providing reconstructions that are
qualitatively similar to breath-held scans performed on the same patients. This
shows the potential of the technique as a clinical protocol for free-breathing
cardiac scans.
| cs.CV | we introduce a novel bandlimited manifold framework and an algorithm to recover freebreathing and ungated cardiac mr images from highly undersampled measurements the image frames in the free breathing and ungated dataset are assumed to be points on a bandlimited manifold we introduce a novel kernel lowrank algorithm to estimate the manifold structure laplacian from a navigatorbased acquisition scheme the structure of the manifold is then used to recover the images from highly undersampled measurements a computationally efficient algorithm which relies on the bandlimited approximation of the laplacian matrix is used to recover the images the proposed scheme is demonstrated on several patients with different breathing patterns and cardiac rates without requiring the need for manually tuning the reconstruction parameters in each case the proposed scheme enabled the recovery of freebreathing and ungated data providing reconstructions that are qualitatively similar to breathheld scans performed on the same patients this shows the potential of the technique as a clinical protocol for freebreathing cardiac scans | [['we', 'introduce', 'a', 'novel', 'bandlimited', 'manifold', 'framework', 'and', 'an', 'algorithm', 'to', 'recover', 'freebreathing', 'and', 'ungated', 'cardiac', 'mr', 'images', 'from', 'highly', 'undersampled', 'measurements', 'the', 'image', 'frames', 'in', 'the', 'free', 'breathing', 'and', 'ungated', 'dataset', 'are', 'assumed', 'to', 'be', 'points', 'on', 'a', 'bandlimited', 'manifold', 'we', 'introduce', 'a', 'novel', 'kernel', 'lowrank', 'algorithm', 'to', 'estimate', 'the', 'manifold', 'structure', 'laplacian', 'from', 'a', 'navigatorbased', 'acquisition', 'scheme', 'the', 'structure', 'of', 'the', 'manifold', 'is', 'then', 'used', 'to', 'recover', 'the', 'images', 'from', 'highly', 'undersampled', 'measurements', 'a', 'computationally', 'efficient', 'algorithm', 'which', 'relies', 'on', 'the', 'bandlimited', 'approximation', 'of', 'the', 'laplacian', 'matrix', 'is', 'used', 'to', 'recover', 'the', 'images', 'the', 'proposed', 'scheme', 'is', 'demonstrated', 'on', 'several', 'patients', 'with', 'different', 'breathing', 'patterns', 'and', 'cardiac', 'rates', 'without', 'requiring', 'the', 'need', 'for', 'manually', 'tuning', 'the', 'reconstruction', 'parameters', 'in', 'each', 'case', 'the', 'proposed', 'scheme', 'enabled', 'the', 'recovery', 'of', 'freebreathing', 'and', 'ungated', 'data', 'providing', 'reconstructions', 'that', 'are', 'qualitatively', 'similar', 'to', 'breathheld', 'scans', 'performed', 'on', 'the', 'same', 'patients', 'this', 'shows', 'the', 'potential', 'of', 'the', 'technique', 'as', 'a', 'clinical', 'protocol', 'for', 'freebreathing', 'cardiac', 'scans']] | [-0.059454784861632755, 2.4701032721761454e-05, -0.08687654026836064, 0.04510088869867997, -0.08715767110264079, -0.1587135363775103, 0.024027092317234933, 0.41821807315168175, -0.252232603821325, -0.2847110062016186, 0.12692575908543668, -0.24346927258978535, -0.1940359534216345, 0.23361903346889878, -0.13509189773073293, 0.10233310869495783, 0.13494913548127002, 0.041748004329176795, -0.06746669514943493, -0.21120733323923502, 0.27007497352640497, 0.046581453528046976, 0.33560695798246204, -0.02867822779518963, 0.14502049581746437, 0.010100873698399442, -0.02033423658124871, -0.026871197261147617, -0.08150167458117484, 0.13146783597911968, 0.274582505677335, 0.14751049805640803, 0.2638867955006983, -0.41879980571521735, -0.2265993167085122, 0.08534287676354002, 0.12653044158280452, 0.11990599289047676, -0.053779065285039986, -0.33988102281940463, 0.1149028545413282, -0.0763927243739621, -0.023680682256470742, -0.1378552845306116, -0.08937515972994893, -0.052250490124736516, -0.37590387899512484, 0.11431359126296195, -0.010599196894291025, 0.041818784544047735, -0.12876540314267326, -0.0697735920302593, 0.02694492330716819, 0.15847445535762755, -0.00017285989799901196, 0.07915266116673231, 0.14046115849618307, -0.09199873576524974, -0.09536459974175238, 0.34958613326668925, -0.016435599988557814, -0.23935507274932744, 0.15639532806267903, -0.1198419827059698, -0.07074980941306082, 0.16800547510194622, 0.1972116356461037, 0.14606254938006494, -0.1594565518913351, 0.01949699563465966, -0.006596513347040793, 0.17670227019174128, 0.042488408795563704, -0.02435956768957632, 0.07705802789177768, 0.15876447291385312, 0.060919975711507084, 0.13213121674243383, -0.19997425389805842, 0.014990622652058276, -0.22364930042372264, -0.11017764120808114, -0.24282439248144672, 0.0034234557367329088, -0.09865753513698318, -0.19835264070295028, 0.46426714373474903, 0.15863216454481346, 0.2373677954997474, 0.043484255851547214, 0.34730414893501294, 0.031634587685357755, 0.0956222474682058, 0.05391308574746392, 0.15466651964284803, 0.11638597575716259, 0.1117934488664455, -0.19804601876429564, 0.045936674053161784, 0.07044767274851015] |
1,802.0891 | Correlating Cellular Features with Gene Expression using CCA | To understand the biology of cancer, joint analysis of multiple data
modalities, including imaging and genomics, is crucial. The involved nature of
gene-microenvironment interactions necessitates the use of algorithms which
treat both data types equally. We propose the use of canonical correlation
analysis (CCA) and a sparse variant as a preliminary discovery tool for
identifying connections across modalities, specifically between gene expression
and features describing cell and nucleus shape, texture, and stain intensity in
histopathological images. Applied to 615 breast cancer samples from The Cancer
Genome Atlas, CCA revealed significant correlation of several image features
with expression of PAM50 genes, known to be linked to outcome, while Sparse CCA
revealed associations with enrichment of pathways implicated in cancer without
leveraging prior biological understanding. These findings affirm the utility of
CCA for joint phenotype-genotype analysis of cancer.
| eess.SP eess.IV q-bio.CB q-bio.QM stat.AP | to understand the biology of cancer joint analysis of multiple data modalities including imaging and genomics is crucial the involved nature of genemicroenvironment interactions necessitates the use of algorithms which treat both data types equally we propose the use of canonical correlation analysis cca and a sparse variant as a preliminary discovery tool for identifying connections across modalities specifically between gene expression and features describing cell and nucleus shape texture and stain intensity in histopathological images applied to 615 breast cancer samples from the cancer genome atlas cca revealed significant correlation of several image features with expression of pam50 genes known to be linked to outcome while sparse cca revealed associations with enrichment of pathways implicated in cancer without leveraging prior biological understanding these findings affirm the utility of cca for joint phenotypegenotype analysis of cancer | [['to', 'understand', 'the', 'biology', 'of', 'cancer', 'joint', 'analysis', 'of', 'multiple', 'data', 'modalities', 'including', 'imaging', 'and', 'genomics', 'is', 'crucial', 'the', 'involved', 'nature', 'of', 'genemicroenvironment', 'interactions', 'necessitates', 'the', 'use', 'of', 'algorithms', 'which', 'treat', 'both', 'data', 'types', 'equally', 'we', 'propose', 'the', 'use', 'of', 'canonical', 'correlation', 'analysis', 'cca', 'and', 'a', 'sparse', 'variant', 'as', 'a', 'preliminary', 'discovery', 'tool', 'for', 'identifying', 'connections', 'across', 'modalities', 'specifically', 'between', 'gene', 'expression', 'and', 'features', 'describing', 'cell', 'and', 'nucleus', 'shape', 'texture', 'and', 'stain', 'intensity', 'in', 'histopathological', 'images', 'applied', 'to', '615', 'breast', 'cancer', 'samples', 'from', 'the', 'cancer', 'genome', 'atlas', 'cca', 'revealed', 'significant', 'correlation', 'of', 'several', 'image', 'features', 'with', 'expression', 'of', 'pam50', 'genes', 'known', 'to', 'be', 'linked', 'to', 'outcome', 'while', 'sparse', 'cca', 'revealed', 'associations', 'with', 'enrichment', 'of', 'pathways', 'implicated', 'in', 'cancer', 'without', 'leveraging', 'prior', 'biological', 'understanding', 'these', 'findings', 'affirm', 'the', 'utility', 'of', 'cca', 'for', 'joint', 'phenotypegenotype', 'analysis', 'of', 'cancer']] | [-0.009155019262322673, -0.014812005690678403, -0.04818876953666202, 0.12037315062091997, -0.06370148987129882, -0.15955924163400023, 0.06043433084808014, 0.3767911512439174, -0.24976508920943297, -0.29955790420925177, 0.032484027124182496, -0.2975142994550643, -0.26944655726612027, 0.1855377500048942, -0.06644530609870951, 0.02503478641587275, 0.13146441541612147, -0.010054390242806188, 0.04190411369005839, -0.21170386319755818, 0.2743413126613531, 0.05763778604429077, 0.340915737947863, 0.0025937776245107806, 0.09425216287684937, 0.029845739694105256, -0.1587296900856826, -0.009523103972551999, -0.06982598446861461, 0.19003652770210194, 0.40372708357042736, 0.28737308451974836, 0.3151623235773985, -0.4462164563299329, -0.2616998928995734, 0.11616213022369064, 0.16825365902995043, 0.09720420715726774, -0.05731561635448425, -0.26499622787728355, 0.025700300323013733, -0.09595430456446828, -0.04386439478257671, -0.11965156765999617, 0.007754623468672098, -0.01204392061120382, -0.29963102814336134, 0.1660541793624698, 0.02136633185048898, 0.1512480744667334, -0.10897449453758007, -0.13954722543281536, -0.015103626158088445, 0.20876245991223388, 0.08556826321011478, 0.02794839505934053, 0.17743841885692543, -0.17409930374059412, -0.14709930040839095, 0.3048736896538348, 0.029513061012106913, -0.14353943134451078, 0.24594124272741652, -0.1158466004335356, -0.18296057456690404, 0.11747033991333511, 0.17653671444083255, 0.05638280718035444, -0.22666061753062186, -0.031693435752229694, 0.014553579639781404, 0.20586087242355225, 0.09747985991890784, 0.0020756790828373698, 0.17869113415686622, 0.22905144554873308, -0.03516983277750788, 0.13499283240331958, -0.18935118362445522, -0.061644514487987315, -0.17703003590900657, -0.13749634708726297, -0.12660175104004642, -0.009690910050886925, -0.11533604266964917, -0.18939591004616685, 0.40846917323630166, 0.11757663061359415, 0.20883594451696372, 0.016058623296407018, 0.2746045440280189, -0.061518687203836936, 0.1398164799781861, -0.05532539878385486, 0.12382769597935732, 0.14102196208442802, 0.08371464174189087, -0.2562621024488989, 0.14042640333581302, 0.004312338478242358] |
1,802.08911 | Conformal bootstrap for percolation and polymers | The conformal bootstrap is applied to percolation and dilute self-avoiding
polymers, two theories with Virasoro central charge $c=0$ in two dimensions. In
both cases we propose a spectrum of operators motivated by Virasoro symmetry
which is devoid of a stress energy tensor as an approximate means of enforcing
$c=0$. Percolation is treated in $2\leq D \leq 6$ dimensions, and the
self-avoiding walk in $2 \leq D \leq 4$.
| hep-th cond-mat.stat-mech math-ph math.MP | the conformal bootstrap is applied to percolation and dilute selfavoiding polymers two theories with virasoro central charge c0 in two dimensions in both cases we propose a spectrum of operators motivated by virasoro symmetry which is devoid of a stress energy tensor as an approximate means of enforcing c0 percolation is treated in 2leq d leq 6 dimensions and the selfavoiding walk in 2 leq d leq 4 | [['the', 'conformal', 'bootstrap', 'is', 'applied', 'to', 'percolation', 'and', 'dilute', 'selfavoiding', 'polymers', 'two', 'theories', 'with', 'virasoro', 'central', 'charge', 'c0', 'in', 'two', 'dimensions', 'in', 'both', 'cases', 'we', 'propose', 'a', 'spectrum', 'of', 'operators', 'motivated', 'by', 'virasoro', 'symmetry', 'which', 'is', 'devoid', 'of', 'a', 'stress', 'energy', 'tensor', 'as', 'an', 'approximate', 'means', 'of', 'enforcing', 'c0', 'percolation', 'is', 'treated', 'in', '2leq', 'd', 'leq', '6', 'dimensions', 'and', 'the', 'selfavoiding', 'walk', 'in', '2', 'leq', 'd', 'leq', '4']] | [-0.1753837405143285, 0.21699023732478107, 0.021103920079493785, 0.008164209462633795, 0.023603455653167602, -0.2353084572344361, -0.03385178446221877, 0.3776245306191199, -0.1853356385973337, -0.2000203018593739, 0.08777554066139548, -0.31502507407875624, -0.11207953922669678, 0.05739397243322695, -0.011537619811647078, 0.06515290003324695, -0.08566655666457818, 0.041844227515599304, -0.05727783972328967, -0.24310853853753275, 0.25995517860385864, -0.05209584571147228, 0.23187242120141438, 0.09709752842044349, 0.06058387252200833, 0.04536193043938564, 0.04433919568820035, 0.028888671917630906, -0.2196280381998376, 0.07590184214196223, 0.23599882171872785, 0.03350967960432172, 0.20973856731400112, -0.3951792695100748, -0.2115301039919038, 0.12566016241908073, 0.22704655751038125, 0.06852505994816858, 0.0017933763652656447, -0.23098632864489713, 0.09941870193271075, -0.1518223034491872, -0.1825883714002831, -0.037889181170612574, 0.08676785471684792, -0.05615624041734811, -0.30518192233627334, 0.17600886966444224, 0.07078802569166702, 0.08344321989673464, -0.03059183558284798, -0.13138497329782695, -0.05104621536755825, 0.07826576103894588, 0.03656166304683532, 0.06414149696116939, 0.11594464664299534, -0.1561492047039792, -0.14478810734855121, 0.3377914279288448, -0.010812843958025469, -0.24655604017350605, 0.1481051463428337, -0.17496666390969254, -0.23073851766393466, 0.08120481927386101, 0.07849254716625985, 0.1988254862371832, -0.1303928007837385, 0.2059207975792507, -0.04252382951295551, 0.12461713680942707, 0.12018383665503386, -0.05734794252716443, 0.17935061780051054, 0.13930537388660014, 0.06637083910754882, 0.16403881196096978, -0.037535409278729386, -0.0592553681721363, -0.3631759996745078, -0.14659930410904481, -0.2638160862329909, 0.14671894880901912, -0.23422256528925467, -0.132700550260351, 0.30111016456366463, 0.12164206815920325, 0.20846862732244464, 0.13178231753580108, 0.13034156485296347, 0.06842634035103187, 0.06813171728486743, 0.13110681755386075, 0.14832284926395753, 0.19952462833059734, 0.046693515790941414, -0.12607112646048121, -0.08060063149177414, 0.2017629677977632] |
1,802.08912 | Large Scale Environment of a $z=6.61$ Luminous Quasar Probed by
Ly$\alpha$ Emitters and Lyman Break Galaxies | Quasars (QSOs) hosting supermassive black holes are believed to reside in
massive halos harboring galaxy overdensities. However, many observations
revealed average or low galaxy densities around $z\gtrsim6$ QSOs. This could be
partly because they measured galaxy densities in only tens of arcmin$^2$ around
QSOs and might have overlooked potential larger scale galaxy overdensities.
Some previous studies also observed only Lyman break galaxies (LBGs, massive
older galaxies) and missed low mass young galaxies like Ly$\alpha$ emitters
(LAEs) around QSOs. Here we present observations of LAE and LBG candidates in
$\sim700$ arcmin$^2$ around a $z=6.61$ luminous QSO using Subaru Telescope
Suprime-Cam with narrow/broadbands. We compare their sky distributions, number
densities and angular correlation functions with those of LAEs/LBGs detected in
the same manner and comparable data quality in our control blank field. In the
QSO field, LAEs and LBGs are clustering in 4-20 comoving Mpc angular scales,
but LAEs show mostly underdensity over the field while LBGs are forming
$30\times60$ comoving Mpc$^2$ large scale structure containing 3-$7\sigma$ high
density clumps. The highest density clump includes a bright (23.78 mag in the
narrowband) extended ($\gtrsim 16$ kpc) Ly$\alpha$ blob candidate, indicative
of a dense environment. The QSO could be part of the structure but is not
located exactly at any of the high density peaks. Near the QSO, LAEs show
underdensity while LBGs average to $4\sigma$ excess densities compared to the
control field. If these environments reflect halo mass, the QSO may not be in
the most massive halo, but still in a moderately massive one.
| astro-ph.GA | quasars qsos hosting supermassive black holes are believed to reside in massive halos harboring galaxy overdensities however many observations revealed average or low galaxy densities around zgtrsim6 qsos this could be partly because they measured galaxy densities in only tens of arcmin2 around qsos and might have overlooked potential larger scale galaxy overdensities some previous studies also observed only lyman break galaxies lbgs massive older galaxies and missed low mass young galaxies like lyalpha emitters laes around qsos here we present observations of lae and lbg candidates in sim700 arcmin2 around a z661 luminous qso using subaru telescope suprimecam with narrowbroadbands we compare their sky distributions number densities and angular correlation functions with those of laeslbgs detected in the same manner and comparable data quality in our control blank field in the qso field laes and lbgs are clustering in 420 comoving mpc angular scales but laes show mostly underdensity over the field while lbgs are forming 30times60 comoving mpc2 large scale structure containing 37sigma high density clumps the highest density clump includes a bright 2378 mag in the narrowband extended gtrsim 16 kpc lyalpha blob candidate indicative of a dense environment the qso could be part of the structure but is not located exactly at any of the high density peaks near the qso laes show underdensity while lbgs average to 4sigma excess densities compared to the control field if these environments reflect halo mass the qso may not be in the most massive halo but still in a moderately massive one | [['quasars', 'qsos', 'hosting', 'supermassive', 'black', 'holes', 'are', 'believed', 'to', 'reside', 'in', 'massive', 'halos', 'harboring', 'galaxy', 'overdensities', 'however', 'many', 'observations', 'revealed', 'average', 'or', 'low', 'galaxy', 'densities', 'around', 'zgtrsim6', 'qsos', 'this', 'could', 'be', 'partly', 'because', 'they', 'measured', 'galaxy', 'densities', 'in', 'only', 'tens', 'of', 'arcmin2', 'around', 'qsos', 'and', 'might', 'have', 'overlooked', 'potential', 'larger', 'scale', 'galaxy', 'overdensities', 'some', 'previous', 'studies', 'also', 'observed', 'only', 'lyman', 'break', 'galaxies', 'lbgs', 'massive', 'older', 'galaxies', 'and', 'missed', 'low', 'mass', 'young', 'galaxies', 'like', 'lyalpha', 'emitters', 'laes', 'around', 'qsos', 'here', 'we', 'present', 'observations', 'of', 'lae', 'and', 'lbg', 'candidates', 'in', 'sim700', 'arcmin2', 'around', 'a', 'z661', 'luminous', 'qso', 'using', 'subaru', 'telescope', 'suprimecam', 'with', 'narrowbroadbands', 'we', 'compare', 'their', 'sky', 'distributions', 'number', 'densities', 'and', 'angular', 'correlation', 'functions', 'with', 'those', 'of', 'laeslbgs', 'detected', 'in', 'the', 'same', 'manner', 'and', 'comparable', 'data', 'quality', 'in', 'our', 'control', 'blank', 'field', 'in', 'the', 'qso', 'field', 'laes', 'and', 'lbgs', 'are', 'clustering', 'in', '420', 'comoving', 'mpc', 'angular', 'scales', 'but', 'laes', 'show', 'mostly', 'underdensity', 'over', 'the', 'field', 'while', 'lbgs', 'are', 'forming', '30times60', 'comoving', 'mpc2', 'large', 'scale', 'structure', 'containing', '37sigma', 'high', 'density', 'clumps', 'the', 'highest', 'density', 'clump', 'includes', 'a', 'bright', '2378', 'mag', 'in', 'the', 'narrowband', 'extended', 'gtrsim', '16', 'kpc', 'lyalpha', 'blob', 'candidate', 'indicative', 'of', 'a', 'dense', 'environment', 'the', 'qso', 'could', 'be', 'part', 'of', 'the', 'structure', 'but', 'is', 'not', 'located', 'exactly', 'at', 'any', 'of', 'the', 'high', 'density', 'peaks', 'near', 'the', 'qso', 'laes', 'show', 'underdensity', 'while', 'lbgs', 'average', 'to', '4sigma', 'excess', 'densities', 'compared', 'to', 'the', 'control', 'field', 'if', 'these', 'environments', 'reflect', 'halo', 'mass', 'the', 'qso', 'may', 'not', 'be', 'in', 'the', 'most', 'massive', 'halo', 'but', 'still', 'in', 'a', 'moderately', 'massive', 'one']] | [-0.0717198979754719, 0.10551187964380686, -0.034803696908056736, 0.14951513531857663, -0.11944967666809189, -0.06473972607613447, -0.005766277841991749, 0.4871494431258086, -0.0035116031067445874, -0.3937517124579763, -0.007155007496663186, -0.35275032511542004, 0.01948340583020395, 0.1434237352778183, 0.005975419152378437, -0.055051770727954294, -0.0005035197872380506, -0.1467141120892811, 0.008971582011630138, -0.37605071889356256, 0.26373924015194594, 0.0932283569019789, 0.1637127536711803, -0.09422210688622347, 0.10610284040033084, -0.15302712549586373, -0.09320441286613039, 0.012597998061841989, -0.11984164812733011, -0.02675277763396973, 0.32365185781251116, 0.11177441165090565, 0.3056504321864331, -0.28877469744293927, -0.19900586655415803, 0.101112244166359, 0.31154096814014587, 0.036186061163683496, -0.08663261824485707, -0.33811842956875704, 0.11343037407194455, -0.13871949651824633, -0.1753836783980689, 0.1353437810290949, -0.005286719517251215, 0.04411300570876094, -0.14081234322408734, 0.24203657356535466, -0.07394229330451613, 0.0978895977333966, -0.09603127022975136, -0.08857909041872046, -0.1048891506673035, -0.016648270466540712, -0.0020008917260226837, 0.11515147560724921, 0.28505491460467797, -0.23247226203808627, 0.013810829974076969, 0.4020709310355316, -0.03300028782988708, 0.05939329772379743, 0.22216065002109267, -0.30003087279614976, -0.23476550480852046, 0.18135676616671903, 0.16273813899166986, 0.14130497088349128, -0.13244886487679383, 0.016339541135877596, -0.026316408530330234, 0.2927274040683326, 0.030786048563900423, 0.14737634882578687, 0.3991261497513956, 0.021734651246848685, 0.07794793384887436, 0.03686748700352932, -0.2628105364634233, 0.018040564648029077, -0.20236955071429172, -0.06524880340904461, -0.14783907612415412, 0.1257007888533001, -0.18333383568763137, -0.1151714011405905, 0.2872257975087198, 0.1600081286365989, 0.25731207443991244, 0.12454810823654255, 0.28757003163173434, 0.09074361906639379, 0.20861742991007803, 0.14062459223593274, 0.327517366467486, 0.15492557693108258, 0.03388027117043419, -0.14538644915250276, 0.0025988067729383647, -0.04964568620139965] |
1,802.08913 | Constraining the $\bar{p}/p$ Ratio in TeV Cosmic Rays with Observations
of the Moon Shadow by HAWC | An indirect measurement of the antiproton flux in cosmic rays is possible as
the particles undergo deflection by the geomagnetic field. This effect can be
measured by studying the deficit in the flux, or shadow, created by the Moon as
it absorbs cosmic rays that are headed towards the Earth. The shadow is
displaced from the actual position of the Moon due to geomagnetic deflection,
which is a function of the energy and charge of the cosmic rays. The
displacement provides a natural tool for momentum/charge discrimination that
can be used to study the composition of cosmic rays. Using 33 months of data
comprising more than 80 billion cosmic rays measured by the High Altitude Water
Cherenkov (HAWC) observatory, we have analyzed the Moon shadow to search for
TeV antiprotons in cosmic rays. We present our first upper limits on the
$\bar{p}/p$ fraction, which in the absence of any direct measurements, provide
the tightest available constraints of $\sim1\%$ on the antiproton fraction for
energies between 1 and 10 TeV.
| astro-ph.HE astro-ph.IM | an indirect measurement of the antiproton flux in cosmic rays is possible as the particles undergo deflection by the geomagnetic field this effect can be measured by studying the deficit in the flux or shadow created by the moon as it absorbs cosmic rays that are headed towards the earth the shadow is displaced from the actual position of the moon due to geomagnetic deflection which is a function of the energy and charge of the cosmic rays the displacement provides a natural tool for momentumcharge discrimination that can be used to study the composition of cosmic rays using 33 months of data comprising more than 80 billion cosmic rays measured by the high altitude water cherenkov hawc observatory we have analyzed the moon shadow to search for tev antiprotons in cosmic rays we present our first upper limits on the barpp fraction which in the absence of any direct measurements provide the tightest available constraints of sim1 on the antiproton fraction for energies between 1 and 10 tev | [['an', 'indirect', 'measurement', 'of', 'the', 'antiproton', 'flux', 'in', 'cosmic', 'rays', 'is', 'possible', 'as', 'the', 'particles', 'undergo', 'deflection', 'by', 'the', 'geomagnetic', 'field', 'this', 'effect', 'can', 'be', 'measured', 'by', 'studying', 'the', 'deficit', 'in', 'the', 'flux', 'or', 'shadow', 'created', 'by', 'the', 'moon', 'as', 'it', 'absorbs', 'cosmic', 'rays', 'that', 'are', 'headed', 'towards', 'the', 'earth', 'the', 'shadow', 'is', 'displaced', 'from', 'the', 'actual', 'position', 'of', 'the', 'moon', 'due', 'to', 'geomagnetic', 'deflection', 'which', 'is', 'a', 'function', 'of', 'the', 'energy', 'and', 'charge', 'of', 'the', 'cosmic', 'rays', 'the', 'displacement', 'provides', 'a', 'natural', 'tool', 'for', 'momentumcharge', 'discrimination', 'that', 'can', 'be', 'used', 'to', 'study', 'the', 'composition', 'of', 'cosmic', 'rays', 'using', '33', 'months', 'of', 'data', 'comprising', 'more', 'than', '80', 'billion', 'cosmic', 'rays', 'measured', 'by', 'the', 'high', 'altitude', 'water', 'cherenkov', 'hawc', 'observatory', 'we', 'have', 'analyzed', 'the', 'moon', 'shadow', 'to', 'search', 'for', 'tev', 'antiprotons', 'in', 'cosmic', 'rays', 'we', 'present', 'our', 'first', 'upper', 'limits', 'on', 'the', 'barpp', 'fraction', 'which', 'in', 'the', 'absence', 'of', 'any', 'direct', 'measurements', 'provide', 'the', 'tightest', 'available', 'constraints', 'of', 'sim1', 'on', 'the', 'antiproton', 'fraction', 'for', 'energies', 'between', '1', 'and', '10', 'tev']] | [-0.09230948007491985, 0.2338342145947256, -0.056650592234624916, 0.1320792151265089, -0.04212009816391934, 0.011094172038799206, 0.009061504966860428, 0.351999919889109, -0.23219862004146863, -0.41282395508206454, 0.024219041708140418, -0.3344923570316792, -0.0036162422617247118, 0.24408644715808994, 0.013068699531810212, -0.007090113395769921, 0.07973972450633197, 0.002890911696033729, -0.0035767680899923414, -0.2093837184627601, 0.23172746672840602, 0.2504117102830632, 0.19915997318802237, 0.11032213475114319, 0.11273834023131443, -0.00290738923072859, -0.055789531317412766, -0.029127074400040174, -0.10346021635925257, 0.10711807077068604, 0.20228627670594881, 0.16120036029030937, 0.1115705693035921, -0.42560768461463827, -0.20964258608336633, 0.1522891992336613, 0.10699205355961207, 0.016050402145314762, -0.0808913213061892, -0.3111737571193798, 0.07054781110698258, -0.16127733371534644, -0.15367231604687254, 0.07401934266365932, 0.005286730953337922, 0.017463539163554472, -0.19075841049700706, 0.07189259496820573, -0.006513866254255264, 0.06279743913497043, -0.09591219203337234, -0.11150832022898473, -0.02351076328801818, 0.09490278636011676, 0.1131401825296698, 0.06699703649353214, 0.2005549445059481, -0.10105708345340994, -0.09495977754566885, 0.41346858356412525, -0.09852200324866527, -0.10892064920378595, 0.14558293857162588, -0.22386451260071005, -0.120107516855795, 0.23213915076635822, 0.1877022179824537, 0.0731570400137829, -0.19080958992088512, 0.07067842175288555, -0.014774452365890763, 0.15331695056878603, 0.1265519920284667, 0.0007461045741946739, 0.29418374077808224, 0.14056386339985186, 0.14617767164651746, 0.09520459475723156, -0.23512693618380925, 0.027671517449852696, -0.2993781719489034, -0.1460640535926854, -0.17122163691629583, 0.10490306047171619, -0.08530954160960391, -0.09719880209056407, 0.36095627119555274, 0.1140091531584866, 0.2030040761015031, -0.008068602365447132, 0.3256819820604645, 0.04910064895758571, 0.03792302488740644, 0.07469534131935274, 0.382776550784674, 0.09845797929047613, 0.14242220828006563, -0.18570733902088682, 0.08285476245019122, 0.02233258699832936] |
1,802.08914 | Breakdown of zero-energy quantum Hall state in graphene in the light of
current fluctuations and shot noise | We have investigated the cross-over from Zener tunneling of single charge
carriers to avalanche type of bunched electron transport in a suspended
graphene Corbino disk in the zeroth Landau level. At low bias, we find a
tunneling current that follows the gyrotropic Zener tunneling behavior. At
larger bias, we find avalanche type of transport that sets in at a smaller
current the larger the magnetic field is. The low-frequency noise indicates
strong bunching of the electrons in the avalanches. On the basis of the
measured low-frequency switching noise power, we deduce the characteristic
switching rates of the avalanche sequence. The simultaneous microwave shot
noise measurement also reveals intrinsic correlations within the avalanche
pulses and indicate decrease of correlations with increasing bias.
| cond-mat.mes-hall cond-mat.str-el | we have investigated the crossover from zener tunneling of single charge carriers to avalanche type of bunched electron transport in a suspended graphene corbino disk in the zeroth landau level at low bias we find a tunneling current that follows the gyrotropic zener tunneling behavior at larger bias we find avalanche type of transport that sets in at a smaller current the larger the magnetic field is the lowfrequency noise indicates strong bunching of the electrons in the avalanches on the basis of the measured lowfrequency switching noise power we deduce the characteristic switching rates of the avalanche sequence the simultaneous microwave shot noise measurement also reveals intrinsic correlations within the avalanche pulses and indicate decrease of correlations with increasing bias | [['we', 'have', 'investigated', 'the', 'crossover', 'from', 'zener', 'tunneling', 'of', 'single', 'charge', 'carriers', 'to', 'avalanche', 'type', 'of', 'bunched', 'electron', 'transport', 'in', 'a', 'suspended', 'graphene', 'corbino', 'disk', 'in', 'the', 'zeroth', 'landau', 'level', 'at', 'low', 'bias', 'we', 'find', 'a', 'tunneling', 'current', 'that', 'follows', 'the', 'gyrotropic', 'zener', 'tunneling', 'behavior', 'at', 'larger', 'bias', 'we', 'find', 'avalanche', 'type', 'of', 'transport', 'that', 'sets', 'in', 'at', 'a', 'smaller', 'current', 'the', 'larger', 'the', 'magnetic', 'field', 'is', 'the', 'lowfrequency', 'noise', 'indicates', 'strong', 'bunching', 'of', 'the', 'electrons', 'in', 'the', 'avalanches', 'on', 'the', 'basis', 'of', 'the', 'measured', 'lowfrequency', 'switching', 'noise', 'power', 'we', 'deduce', 'the', 'characteristic', 'switching', 'rates', 'of', 'the', 'avalanche', 'sequence', 'the', 'simultaneous', 'microwave', 'shot', 'noise', 'measurement', 'also', 'reveals', 'intrinsic', 'correlations', 'within', 'the', 'avalanche', 'pulses', 'and', 'indicate', 'decrease', 'of', 'correlations', 'with', 'increasing', 'bias']] | [-0.17816979470393382, 0.19466210098567704, -0.05462712119910712, 0.08111788925603186, 0.03398328410530817, -0.14340052596670538, 0.0630169542793046, 0.35513085621016577, -0.27844370705314164, -0.27513247979650934, -0.045108216179704126, -0.3162346190180291, -0.08904777177078418, 0.21019181982452464, -0.010780877955180923, -0.004723944788806386, -0.028508718779757004, -0.04091978190882393, -0.030194097187000613, -0.1570114639033525, 0.29072377797647203, 0.06736888504810323, 0.37993052615668654, 0.03881478582100927, 0.09641702353861953, 0.002174033252291443, 0.021711207458687837, 0.044895219018159446, -0.13824672853126294, -0.006225416706182247, 0.1893230952391755, -0.10545437450497604, 0.21932617855481495, -0.46823367936736787, -0.1974238173142345, 0.016319244145608144, 0.15157974231218505, 0.15456061513540298, -0.06419877327948785, -0.24102763986900017, 0.047051276986618054, -0.14869262690921428, -0.08681745786789405, 0.01415196145030339, 0.01430983065285004, 0.08373541738799473, -0.27122006223590905, 0.15954666555939004, 0.08226256566252059, 0.0711780794403585, -0.03951955405602709, -0.0831301855923962, -0.016012829582183814, 0.07390499542551962, 0.04023542742183324, -0.0010548244018303923, 0.2564297420139163, -0.13230715467294385, -0.13036016885899315, 0.24279084503804602, -0.10412114585965318, -0.09684360108130481, 0.13153403938540126, -0.3234684875481262, -0.055365323577815095, 0.21464341003755646, 0.0888146010250592, 0.02126811278506744, -0.11963638997817612, 0.026428080369547118, 0.03226410134980255, 0.1862431945440875, 0.08505935334092514, 0.09750481454216806, 0.24753563473201243, 0.2091012799887233, 0.05885186007300253, 0.13108492011015788, -0.20500283356378823, -0.016789747540615806, -0.28893679695219293, -0.11312669589018742, -0.2039100377443285, 0.1437135652450398, -0.07816753497196666, -0.18212714429544516, 0.4393398672657873, 0.16967992503042065, 0.1651838855810217, 0.011034213629943774, 0.2923951974554249, 0.22128206711697337, 0.07438308350002963, 0.016920721447018307, 0.27245513170241753, 0.13894259751859037, 0.14512962633589946, -0.32747006640877296, 0.050254025146334376, -0.04364338987083598] |
1,802.08915 | Security: Doing Whatever is Needed... and Not a Thing More! | As malware, exploits, and cyber-attacks advance over time, so do the
mitigation techniques available to the user. However, while attackers often
abandon one form of exploitation in favor of a more lucrative one, mitigation
techniques are rarely abandoned. Mitigations are rarely retired or disabled
since proving they have outlived their usefulness is often impossible. As a
result, performance overheads, maintenance costs, and false positive rates
induced by the different mitigations accumulate, culminating in an outdated,
inefficient, and costly security solution.
We advocate for a new kind of tunable framework on which to base security
mechanisms. This new framework enables a more reactive approach to security
allowing us to optimize the deployment of security mechanisms based on the
current state of attacks. Based on actual evidence of exploitation collected
from the field, our framework can choose which mechanisms to enable/disable so
that we can minimize the overall costs and false positive rates while
maintaining a satisfactory level of security in the system.
We use real-world Snort signatures to simulate the benefits of reactively
disabling signatures when no evidence of exploitation is observed and compare
them to the costs of the current state of deployment. Additionally, we evaluate
the responsiveness of our framework and show that in case disabling a security
mechanism triggers a reappearance of an attack we can respond in time to
prevent mass exploitation.
Through large-scale simulations that use integer linear and Bayesian solvers,
we discover that our responsive strategy is both computationally affordable and
results in significant reductions in false positives (~20% over traces that are
about 9 years long), at the cost of introducing a moderate number of false
negatives. Finding the optimal sampling strategy takes less than 2.5 minutes in
the vast majority of cases.
| cs.CR | as malware exploits and cyberattacks advance over time so do the mitigation techniques available to the user however while attackers often abandon one form of exploitation in favor of a more lucrative one mitigation techniques are rarely abandoned mitigations are rarely retired or disabled since proving they have outlived their usefulness is often impossible as a result performance overheads maintenance costs and false positive rates induced by the different mitigations accumulate culminating in an outdated inefficient and costly security solution we advocate for a new kind of tunable framework on which to base security mechanisms this new framework enables a more reactive approach to security allowing us to optimize the deployment of security mechanisms based on the current state of attacks based on actual evidence of exploitation collected from the field our framework can choose which mechanisms to enabledisable so that we can minimize the overall costs and false positive rates while maintaining a satisfactory level of security in the system we use realworld snort signatures to simulate the benefits of reactively disabling signatures when no evidence of exploitation is observed and compare them to the costs of the current state of deployment additionally we evaluate the responsiveness of our framework and show that in case disabling a security mechanism triggers a reappearance of an attack we can respond in time to prevent mass exploitation through largescale simulations that use integer linear and bayesian solvers we discover that our responsive strategy is both computationally affordable and results in significant reductions in false positives 20 over traces that are about 9 years long at the cost of introducing a moderate number of false negatives finding the optimal sampling strategy takes less than 25 minutes in the vast majority of cases | [['as', 'malware', 'exploits', 'and', 'cyberattacks', 'advance', 'over', 'time', 'so', 'do', 'the', 'mitigation', 'techniques', 'available', 'to', 'the', 'user', 'however', 'while', 'attackers', 'often', 'abandon', 'one', 'form', 'of', 'exploitation', 'in', 'favor', 'of', 'a', 'more', 'lucrative', 'one', 'mitigation', 'techniques', 'are', 'rarely', 'abandoned', 'mitigations', 'are', 'rarely', 'retired', 'or', 'disabled', 'since', 'proving', 'they', 'have', 'outlived', 'their', 'usefulness', 'is', 'often', 'impossible', 'as', 'a', 'result', 'performance', 'overheads', 'maintenance', 'costs', 'and', 'false', 'positive', 'rates', 'induced', 'by', 'the', 'different', 'mitigations', 'accumulate', 'culminating', 'in', 'an', 'outdated', 'inefficient', 'and', 'costly', 'security', 'solution', 'we', 'advocate', 'for', 'a', 'new', 'kind', 'of', 'tunable', 'framework', 'on', 'which', 'to', 'base', 'security', 'mechanisms', 'this', 'new', 'framework', 'enables', 'a', 'more', 'reactive', 'approach', 'to', 'security', 'allowing', 'us', 'to', 'optimize', 'the', 'deployment', 'of', 'security', 'mechanisms', 'based', 'on', 'the', 'current', 'state', 'of', 'attacks', 'based', 'on', 'actual', 'evidence', 'of', 'exploitation', 'collected', 'from', 'the', 'field', 'our', 'framework', 'can', 'choose', 'which', 'mechanisms', 'to', 'enabledisable', 'so', 'that', 'we', 'can', 'minimize', 'the', 'overall', 'costs', 'and', 'false', 'positive', 'rates', 'while', 'maintaining', 'a', 'satisfactory', 'level', 'of', 'security', 'in', 'the', 'system', 'we', 'use', 'realworld', 'snort', 'signatures', 'to', 'simulate', 'the', 'benefits', 'of', 'reactively', 'disabling', 'signatures', 'when', 'no', 'evidence', 'of', 'exploitation', 'is', 'observed', 'and', 'compare', 'them', 'to', 'the', 'costs', 'of', 'the', 'current', 'state', 'of', 'deployment', 'additionally', 'we', 'evaluate', 'the', 'responsiveness', 'of', 'our', 'framework', 'and', 'show', 'that', 'in', 'case', 'disabling', 'a', 'security', 'mechanism', 'triggers', 'a', 'reappearance', 'of', 'an', 'attack', 'we', 'can', 'respond', 'in', 'time', 'to', 'prevent', 'mass', 'exploitation', 'through', 'largescale', 'simulations', 'that', 'use', 'integer', 'linear', 'and', 'bayesian', 'solvers', 'we', 'discover', 'that', 'our', 'responsive', 'strategy', 'is', 'both', 'computationally', 'affordable', 'and', 'results', 'in', 'significant', 'reductions', 'in', 'false', 'positives', '20', 'over', 'traces', 'that', 'are', 'about', '9', 'years', 'long', 'at', 'the', 'cost', 'of', 'introducing', 'a', 'moderate', 'number', 'of', 'false', 'negatives', 'finding', 'the', 'optimal', 'sampling', 'strategy', 'takes', 'less', 'than', '25', 'minutes', 'in', 'the', 'vast', 'majority', 'of', 'cases']] | [-0.14028284179845027, 0.035303351082064324, -0.051292517670277725, 0.08636606460394994, -0.10086577010538936, -0.17540322174399262, 0.15224258302474064, 0.37612445048747734, -0.23419879614956593, -0.3506033626686821, 0.13099122597780793, -0.2591074715692547, -0.15445022760543206, 0.21191271421140975, -0.12992638653267552, 0.049484145856796655, 0.05838914873899457, -0.013773218095821787, -0.021206396885616995, -0.3079310963060123, 0.28160548675034636, 0.10129835443872998, 0.30584204530843145, 0.06733311278696755, 0.0640429395367797, -0.01582941246536992, -0.03900198178294436, -0.009007622819196991, -0.06536173449327966, 0.10020246934989396, 0.2933172226237711, 0.2209816422955967, 0.37436561103754445, -0.4620637252005239, -0.181534929492248, 0.12298358602527179, 0.1326665460953054, 0.12653337046585147, -0.06127566120648691, -0.2642637834655452, 0.1320212508348151, -0.22054887273696086, -0.08573593305203193, -0.11899446956983699, -0.013233802645979936, -0.005222531024996153, -0.26285066705307425, 0.021994605002915064, 0.028233249752071626, 0.05410762584544329, -0.04663534893148063, -0.09222400193597524, -0.015808424327477085, 0.15226615653935097, 0.07985542452154286, -0.022261139288855366, 0.1528905120877815, -0.15020680833481254, -0.15770676843448825, 0.3474254398395791, -0.012964868306627299, -0.16591537444290902, 0.22539612581752214, -0.06211086968852382, -0.12913293083837638, 0.17526389729192657, 0.223519960381837, 0.11584222059898104, -0.14428399877610756, 0.0028561785710060432, 0.036702675012326456, 0.20218410355343974, 0.05850427420136522, 0.05353732632379005, 0.19594053400417574, 0.1761382875829377, 0.10470887501513138, 0.10174396819474, -0.08172361452332438, -0.10714130246369266, -0.23893866477573114, -0.15358484158363803, -0.13168109153342217, 0.02756831748573311, -0.04399542195944745, -0.11228445273554699, 0.3542902370101938, 0.22692355430337766, 0.14536141479961437, 0.0766048652415232, 0.3665591926258771, 0.04094302199597597, 0.10366339044932309, 0.11080215878148632, 0.23150808803529482, -0.01666566929439219, 0.1187582632051359, -0.17246818572983716, 0.16588834527626842, -0.0398261040880731] |
1,802.08916 | SAT-based Reverse Engineering of Gate-Level Schematics using Fault
Injection and Probing | Gate camouflaging is a known security enhancement technique that tries to
thwart reverse engineering by hiding the functions of gates or the connections
between them. A number of works on SAT-based attacks have shown that it is
often possible to reverse engineer a circuit function by combining a
camouflaged circuit model and the ability to have oracle access to the
obfuscated combinational circuit. Especially in small circuits it is easy to
reverse engineer the circuit function in this way, but SAT-based reverse
engineering techniques provide no guarantees of recovering a circuit that is
gate-by-gate equivalent to the original design. In this work we show that an
attacker who does not know gate functions or connections of an aggressively
camouflaged circuit cannot learn the correct gate-level schematic even if able
to control inputs and probe all combinational nodes of the circuit. We then
present a stronger attack that extends SAT-based reverse engineering with fault
analysis to allow an attacker to recover the correct gate-level schematic. We
analyze our reverse engineering approach on an S-Box circuit.
| cs.CR | gate camouflaging is a known security enhancement technique that tries to thwart reverse engineering by hiding the functions of gates or the connections between them a number of works on satbased attacks have shown that it is often possible to reverse engineer a circuit function by combining a camouflaged circuit model and the ability to have oracle access to the obfuscated combinational circuit especially in small circuits it is easy to reverse engineer the circuit function in this way but satbased reverse engineering techniques provide no guarantees of recovering a circuit that is gatebygate equivalent to the original design in this work we show that an attacker who does not know gate functions or connections of an aggressively camouflaged circuit cannot learn the correct gatelevel schematic even if able to control inputs and probe all combinational nodes of the circuit we then present a stronger attack that extends satbased reverse engineering with fault analysis to allow an attacker to recover the correct gatelevel schematic we analyze our reverse engineering approach on an sbox circuit | [['gate', 'camouflaging', 'is', 'a', 'known', 'security', 'enhancement', 'technique', 'that', 'tries', 'to', 'thwart', 'reverse', 'engineering', 'by', 'hiding', 'the', 'functions', 'of', 'gates', 'or', 'the', 'connections', 'between', 'them', 'a', 'number', 'of', 'works', 'on', 'satbased', 'attacks', 'have', 'shown', 'that', 'it', 'is', 'often', 'possible', 'to', 'reverse', 'engineer', 'a', 'circuit', 'function', 'by', 'combining', 'a', 'camouflaged', 'circuit', 'model', 'and', 'the', 'ability', 'to', 'have', 'oracle', 'access', 'to', 'the', 'obfuscated', 'combinational', 'circuit', 'especially', 'in', 'small', 'circuits', 'it', 'is', 'easy', 'to', 'reverse', 'engineer', 'the', 'circuit', 'function', 'in', 'this', 'way', 'but', 'satbased', 'reverse', 'engineering', 'techniques', 'provide', 'no', 'guarantees', 'of', 'recovering', 'a', 'circuit', 'that', 'is', 'gatebygate', 'equivalent', 'to', 'the', 'original', 'design', 'in', 'this', 'work', 'we', 'show', 'that', 'an', 'attacker', 'who', 'does', 'not', 'know', 'gate', 'functions', 'or', 'connections', 'of', 'an', 'aggressively', 'camouflaged', 'circuit', 'can', 'not', 'learn', 'the', 'correct', 'gatelevel', 'schematic', 'even', 'if', 'able', 'to', 'control', 'inputs', 'and', 'probe', 'all', 'combinational', 'nodes', 'of', 'the', 'circuit', 'we', 'then', 'present', 'a', 'stronger', 'attack', 'that', 'extends', 'satbased', 'reverse', 'engineering', 'with', 'fault', 'analysis', 'to', 'allow', 'an', 'attacker', 'to', 'recover', 'the', 'correct', 'gatelevel', 'schematic', 'we', 'analyze', 'our', 'reverse', 'engineering', 'approach', 'on', 'an', 'sbox', 'circuit']] | [-0.09838094816866984, 0.02022106000175432, -0.06240169613905808, 0.08587372013844079, -0.1409310600385819, -0.2717181318439543, 0.12324658127357091, 0.40435132298393756, -0.29184431874664263, -0.3226299166449228, 0.07974414808753257, -0.22599982794631143, -0.2101285124081187, 0.23468097834178814, -0.13397640611269865, 0.08211288834793558, -0.0036873640105343723, -0.023595700540744443, -0.031006648023572655, -0.2608472710106008, 0.23560336947002203, 0.04847685646683235, 0.2902139108439027, 0.03988228729735704, 0.07633602883581114, -0.002395520910042627, 0.038512943601556895, -0.009023887680672195, -0.06631699305108177, 0.10349589549593799, 0.2910761884654519, 0.2038620950228631, 0.2839810786502511, -0.4957017622347493, -0.17504080344291253, 0.10728138776284632, 0.12503212391554067, 0.18155770018782424, -0.03287141224845773, -0.2460173543585443, 0.1323107989751145, -0.18290990016733608, -0.07886217611834498, -0.09912568719618707, -0.0025345287125172287, -0.006237741301489201, -0.24831136251296634, -0.09653959932854805, 0.12142230348190529, 0.0071436692987322465, 0.04210843200843524, -0.0416551161819705, 0.03528681119245573, 0.1414666392414927, -0.0539250966842586, 0.05668361746470562, 0.17256798324624784, -0.12552443482436712, -0.18278832736976403, 0.28980280142331005, 0.02417281345897836, -0.19554234881639138, 0.17994342708756783, -0.03735979709602978, -0.11303024593173344, 0.09214148210661335, 0.14487630636939758, 0.041718449633589935, -0.17651057407800536, 0.07073128349401978, -0.01645810913358783, 0.26869896975956087, 0.05619806934003558, 6.337916738107458e-05, 0.10066101431375606, 0.13553160858901228, 0.12453567118105617, 0.18985631760884206, -0.0005453435997492045, -0.038534647514494993, -0.2926686689894561, -0.15613517318798723, -0.18917433178151327, 0.0531063200673423, -0.021581041697384628, -0.1994121945264914, 0.4115797033233718, 0.22684440686067717, 0.13932212375639, 0.062058398339512016, 0.37379957922873486, 0.09905513975268829, 0.13969629874483724, 0.1010291757404633, 0.21544088941534456, 0.11965429916142903, 0.07447570109814834, -0.19538601438565736, 0.1667076629377773, 0.00850066048328647] |
1,802.08917 | Permissive Barrier Certificates for Safe Stabilization Using
Sum-of-squares | Motivated by the need to simultaneously guarantee safety and stability of
safety-critical dynamical systems, we construct permissive barrier certificates
in this paper that explicitly maximize the region where the system can be
stabilized without violating safety constraints. An optimization strategy is
developed to search for the maximum volume barrier certified region of safe
stabilization. The barrier certified region, which is allowed to take any
arbitrary shape, is proved to be strictly larger than safe regions generated
with Lyapunov sublevel set based methods. The proposed approach effectively
unites a Lyapunov function with multiple barrier functions that might not be
compatible with each other. Iterative search algorithms are developed using
sum-of-squares to compute the most permissive, that is, the maximum volume,
barrier certificates. Simulation results of the iterative search algorithm
demonstrate the effectiveness of the proposed method.
| math.OC | motivated by the need to simultaneously guarantee safety and stability of safetycritical dynamical systems we construct permissive barrier certificates in this paper that explicitly maximize the region where the system can be stabilized without violating safety constraints an optimization strategy is developed to search for the maximum volume barrier certified region of safe stabilization the barrier certified region which is allowed to take any arbitrary shape is proved to be strictly larger than safe regions generated with lyapunov sublevel set based methods the proposed approach effectively unites a lyapunov function with multiple barrier functions that might not be compatible with each other iterative search algorithms are developed using sumofsquares to compute the most permissive that is the maximum volume barrier certificates simulation results of the iterative search algorithm demonstrate the effectiveness of the proposed method | [['motivated', 'by', 'the', 'need', 'to', 'simultaneously', 'guarantee', 'safety', 'and', 'stability', 'of', 'safetycritical', 'dynamical', 'systems', 'we', 'construct', 'permissive', 'barrier', 'certificates', 'in', 'this', 'paper', 'that', 'explicitly', 'maximize', 'the', 'region', 'where', 'the', 'system', 'can', 'be', 'stabilized', 'without', 'violating', 'safety', 'constraints', 'an', 'optimization', 'strategy', 'is', 'developed', 'to', 'search', 'for', 'the', 'maximum', 'volume', 'barrier', 'certified', 'region', 'of', 'safe', 'stabilization', 'the', 'barrier', 'certified', 'region', 'which', 'is', 'allowed', 'to', 'take', 'any', 'arbitrary', 'shape', 'is', 'proved', 'to', 'be', 'strictly', 'larger', 'than', 'safe', 'regions', 'generated', 'with', 'lyapunov', 'sublevel', 'set', 'based', 'methods', 'the', 'proposed', 'approach', 'effectively', 'unites', 'a', 'lyapunov', 'function', 'with', 'multiple', 'barrier', 'functions', 'that', 'might', 'not', 'be', 'compatible', 'with', 'each', 'other', 'iterative', 'search', 'algorithms', 'are', 'developed', 'using', 'sumofsquares', 'to', 'compute', 'the', 'most', 'permissive', 'that', 'is', 'the', 'maximum', 'volume', 'barrier', 'certificates', 'simulation', 'results', 'of', 'the', 'iterative', 'search', 'algorithm', 'demonstrate', 'the', 'effectiveness', 'of', 'the', 'proposed', 'method']] | [-0.11985304675720355, 0.04608314365107583, -0.10156264489999524, 0.07817472145909926, -0.09461381882084188, -0.189618828479649, 0.07338089380775475, 0.33216534759159444, -0.27731314832430887, -0.33255192695392505, 0.13929892051878764, -0.20128326672474267, -0.12885521632722682, 0.22111672730943946, -0.07626855685310956, 0.11536119992551566, 0.04604228342348641, -0.00454577396761764, -0.030770149314776063, -0.26893761809397904, 0.3022658736479503, 0.050813066566587184, 0.2655761165820338, 0.091495957053094, 0.07823346327576372, -0.0027596730230100177, 0.044658730920680144, 0.05817992682353145, -0.11945727481587609, 0.14360302351328924, 0.2795788733047192, 0.20184031517969236, 0.3070044284617459, -0.40628802808070624, -0.17490634716771267, 0.17644940541574247, 0.15096401208149338, 0.09505750804156479, -0.056332805297440953, -0.2901818014819313, 0.16728355836606137, -0.17161013997953248, -0.12635297808382245, -0.11288191591975866, -0.05121083294420883, 0.019068629943110326, -0.34438065401174955, -0.027620902167702164, 0.009165595995081174, 0.00887779257501717, -0.05837789428489352, -0.08303254949946508, -0.042790717833365, 0.08415561884779621, 0.0027555941293636956, 0.01888218362712198, 0.18034110431973305, -0.048713573427543184, -0.15884139334343167, 0.32220016123933926, -0.002381057574745716, -0.21668688155089816, 0.14915132712555565, -0.0778684851506518, -0.0879061125356842, 0.1875090075208357, 0.1699563015597286, 0.18096290888195787, -0.18937165404635448, 0.09594914892093381, 0.012250757241552626, 0.20168402653394474, 0.05766311370491706, -0.005622348818859016, 0.14943157184903544, 0.15951223615556956, 0.17336101070632814, 0.1513872134710524, -0.03336557891323334, -0.13880312707257905, -0.2927065267576836, -0.12254281387905831, -0.19097283777125457, -0.08399657025681033, -0.08769443554585989, -0.156538438534847, 0.3439539419211171, 0.1729522228896342, 0.1298772761736203, 0.10490422508144683, 0.33810249217613425, 0.14229728700172725, 0.1077026723159684, 0.11499002138152718, 0.24131421255879104, 0.031496369583032056, 0.06178659322085204, -0.2322022992927857, 0.1355852765013912, 0.10849530912107891] |
1,802.08918 | Anti-Ramsey number of edge-disjoint rainbow spanning trees | An edge-colored graph $G$ is called rainbow if every edge of $G$ receives a
different color. The anti-Ramsey number of $t$ edge-disjoint rainbow spanning
trees, denoted by $r(n,t)$, is defined as the maximum number of colors in an
edge-coloring of $K_n$ containing no $t$ edge-disjoint rainbow spanning trees.
Jahanbekam and West [J. Graph Theory, 2014] conjectured that for any fixed $t$,
$r(n,t)=\binom{n-2}{2}+t$ whenever $n\geq 2t+2 \geq 6$. In this paper, we prove
this conjecture. We also determine $r(n,t)$ when $n = 2t+1$. Together with
previous results, this gives the anti-Ramsey number of $t$ edge-disjoint
rainbow spanning trees for all values of $n$ and $t$.
| math.CO | an edgecolored graph g is called rainbow if every edge of g receives a different color the antiramsey number of t edgedisjoint rainbow spanning trees denoted by rnt is defined as the maximum number of colors in an edgecoloring of k_n containing no t edgedisjoint rainbow spanning trees jahanbekam and west j graph theory 2014 conjectured that for any fixed t rntbinomn22t whenever ngeq 2t2 geq 6 in this paper we prove this conjecture we also determine rnt when n 2t1 together with previous results this gives the antiramsey number of t edgedisjoint rainbow spanning trees for all values of n and t | [['an', 'edgecolored', 'graph', 'g', 'is', 'called', 'rainbow', 'if', 'every', 'edge', 'of', 'g', 'receives', 'a', 'different', 'color', 'the', 'antiramsey', 'number', 'of', 't', 'edgedisjoint', 'rainbow', 'spanning', 'trees', 'denoted', 'by', 'rnt', 'is', 'defined', 'as', 'the', 'maximum', 'number', 'of', 'colors', 'in', 'an', 'edgecoloring', 'of', 'k_n', 'containing', 'no', 't', 'edgedisjoint', 'rainbow', 'spanning', 'trees', 'jahanbekam', 'and', 'west', 'j', 'graph', 'theory', '2014', 'conjectured', 'that', 'for', 'any', 'fixed', 't', 'rntbinomn22t', 'whenever', 'ngeq', '2t2', 'geq', '6', 'in', 'this', 'paper', 'we', 'prove', 'this', 'conjecture', 'we', 'also', 'determine', 'rnt', 'when', 'n', '2t1', 'together', 'with', 'previous', 'results', 'this', 'gives', 'the', 'antiramsey', 'number', 'of', 't', 'edgedisjoint', 'rainbow', 'spanning', 'trees', 'for', 'all', 'values', 'of', 'n', 'and', 't']] | [-0.2297657884168669, 0.2584402986717443, -0.026769093910951426, -0.021440791824860223, -0.11772476507369245, -0.1448170124036767, 0.06919713563626946, 0.3666797704662722, -0.2112141327914035, -0.3811906137530194, -0.005554516350223434, -0.36914790275801745, -0.13181641554496815, 0.03702465745408346, -0.13668879336161116, -0.026318420034615406, 0.11142807278671477, 0.13886114162402136, 0.10911273769342737, -0.31780545411015965, 0.20623625590844025, -0.10475206347228498, 0.11005896601352223, 0.09521657462683644, 0.09461853077570621, 0.1288567254790059, -0.008922845291176646, 0.1307120400545473, -0.287071204848376, -0.007932447196712883, 0.3019780246448694, 0.19453306199918216, 0.24089169338124222, -0.3488378896603319, -0.17443220561951178, 0.2641139477675799, 0.13471216548321824, -0.019331057184827652, 0.060380840286760044, -0.0955895342735002, 0.16975961056639358, -0.109135920059692, -0.08670649859630088, 0.09583227771638643, 0.2397924473158794, -0.03555647572410284, -0.3164663641519918, -0.06152977074506822, 0.11443581380466424, 0.04464879113775078, 0.1398304645582978, -0.2284033456079588, -0.11872461873410951, 0.0711958598069464, -0.0940013877346669, 0.14721777738708228, -0.06314437419676341, -0.08982277046289701, -0.20011553673608468, 0.3008031359145252, -0.04493317320149871, -0.047127287318505864, 0.06521697810823375, -0.13727064113510717, -0.2449615939916803, 0.1024565240368247, 0.03563649002647046, 0.22455412921689377, -0.10303632795910402, 0.16321004308312947, -0.18951213283298335, 0.08677622860316003, 0.2543164227102505, 0.013569184446403074, 0.12416449021363613, 0.11607081883605386, 0.17829520307887015, 0.1851227984574651, 0.03125911765261599, 0.10456799824104303, -0.31905666118174203, -0.07829417353772586, -0.2481376650929912, 0.11755078186806624, -0.23699811305637508, -0.19330472586731803, 0.32414138926617286, 0.11857768658105985, 0.21134230589014616, 0.15829072403029934, 0.19151831585176216, 0.04678890654370004, -0.005423957020929545, 0.250475632294201, 0.05563792754149083, 0.23308186045165477, -0.06090476158729727, -0.17285888819375517, -0.02986977283962735, 0.19058563385048125] |
1,802.08919 | Privacy Leakages in Approximate Adders | Approximate computing has recently emerged as a promising method to meet the
low power requirements of digital designs. The erroneous outputs produced in
approximate computing can be partially a function of each chip's process
variation. We show that, in such schemes, the erroneous outputs produced on
each chip instance can reveal the identity of the chip that performed the
computation, possibly jeopardizing user privacy. In this work, we perform
simulation experiments on 32-bit Ripple Carry Adders, Carry Lookahead Adders,
and Han-Carlson Adders running at over-scaled operating points. Our results
show that identification is possible, we contrast the identifiability of each
type of adder, and we quantify how success of identification varies with the
extent of over-scaling and noise. Our results are the first to show that
approximate digital computations may compromise privacy. Designers of future
approximate computing systems should be aware of the possible privacy leakages
and decide whether mitigation is warranted in their application.
| cs.CR cs.AR | approximate computing has recently emerged as a promising method to meet the low power requirements of digital designs the erroneous outputs produced in approximate computing can be partially a function of each chips process variation we show that in such schemes the erroneous outputs produced on each chip instance can reveal the identity of the chip that performed the computation possibly jeopardizing user privacy in this work we perform simulation experiments on 32bit ripple carry adders carry lookahead adders and hancarlson adders running at overscaled operating points our results show that identification is possible we contrast the identifiability of each type of adder and we quantify how success of identification varies with the extent of overscaling and noise our results are the first to show that approximate digital computations may compromise privacy designers of future approximate computing systems should be aware of the possible privacy leakages and decide whether mitigation is warranted in their application | [['approximate', 'computing', 'has', 'recently', 'emerged', 'as', 'a', 'promising', 'method', 'to', 'meet', 'the', 'low', 'power', 'requirements', 'of', 'digital', 'designs', 'the', 'erroneous', 'outputs', 'produced', 'in', 'approximate', 'computing', 'can', 'be', 'partially', 'a', 'function', 'of', 'each', 'chips', 'process', 'variation', 'we', 'show', 'that', 'in', 'such', 'schemes', 'the', 'erroneous', 'outputs', 'produced', 'on', 'each', 'chip', 'instance', 'can', 'reveal', 'the', 'identity', 'of', 'the', 'chip', 'that', 'performed', 'the', 'computation', 'possibly', 'jeopardizing', 'user', 'privacy', 'in', 'this', 'work', 'we', 'perform', 'simulation', 'experiments', 'on', '32bit', 'ripple', 'carry', 'adders', 'carry', 'lookahead', 'adders', 'and', 'hancarlson', 'adders', 'running', 'at', 'overscaled', 'operating', 'points', 'our', 'results', 'show', 'that', 'identification', 'is', 'possible', 'we', 'contrast', 'the', 'identifiability', 'of', 'each', 'type', 'of', 'adder', 'and', 'we', 'quantify', 'how', 'success', 'of', 'identification', 'varies', 'with', 'the', 'extent', 'of', 'overscaling', 'and', 'noise', 'our', 'results', 'are', 'the', 'first', 'to', 'show', 'that', 'approximate', 'digital', 'computations', 'may', 'compromise', 'privacy', 'designers', 'of', 'future', 'approximate', 'computing', 'systems', 'should', 'be', 'aware', 'of', 'the', 'possible', 'privacy', 'leakages', 'and', 'decide', 'whether', 'mitigation', 'is', 'warranted', 'in', 'their', 'application']] | [-0.15950827471138848, -0.0003565992441734457, -0.07069291247152328, 0.03601075828254835, -0.07675384452834336, -0.1902148859831048, 0.09589388174327468, 0.4004238119555844, -0.24927791362944868, -0.3401405605977535, 0.1223062986197571, -0.2654741707005313, -0.15561964518993215, 0.2174948267699554, -0.1073173123160362, 0.10523403740755824, 0.07582243726880965, 0.015667566580697324, -0.07452239369398311, -0.3129534184899135, 0.2297795575851684, 0.10694073666544522, 0.30930727140466663, 0.025660485316834906, 0.0851324689604975, -0.03834179309470689, -0.0630470339263625, -0.012922952783840338, -0.07032165695605738, 0.08765888489551502, 0.29359484582628104, 0.20110231689086147, 0.30629368357701237, -0.4576190971081553, -0.14300228499204798, 0.11995835367626712, 0.15791594033476478, 0.10509553610718524, -0.08261813318624703, -0.2544490398680852, 0.15497642674968803, -0.18935084507307587, -0.05948520909380046, -0.11191511033327331, -0.03500199892475982, 0.04196446253826805, -0.2829832922685526, -0.025290303597275434, 0.040806454375806246, 0.028444318277335245, 0.0059512797986565075, -0.10590826529473846, -0.02409919713824695, 0.1710468157266078, -0.02240122069652821, -0.009551442736528472, 0.17761616099297123, -0.09602907786733209, -0.20737811958027724, 0.33510430881546605, 0.010560666516824973, -0.20963966928337233, 0.14243701619881333, -0.07494531552881015, -0.13513921169005638, 0.10382063162141765, 0.2191487999109466, 0.05324614069917623, -0.10696834750059578, 0.038085291946034425, -0.0012603209603553505, 0.20275661746478257, 0.08887529002618215, 0.07819548469444651, 0.18982100346143924, 0.1837705208560805, 0.06767503889216707, 0.13294873919088418, -0.08578004027424636, -0.07856449424943528, -0.28210768691611054, -0.1656810958851494, -0.17607064552459062, 0.018185344695119687, -0.04557966316701674, -0.1396245920263669, 0.3755101853665086, 0.24243972359569074, 0.14393279989390007, 0.06725647929961508, 0.37836484883735383, 0.1147918964213436, 0.10647022569235536, 0.09188482363242656, 0.20867610585821025, 0.04153331285312139, 0.11095427441124628, -0.19530806089660116, 0.1215051172888576, -0.013414456303614904] |
1,802.0892 | Geometric Surface-Based Tracking Control of a Quadrotor UAV | New quadrotor UAV control algorithms are developed, based on nonlinear
surfaces composed of tracking errors that evolve directly on the nonlinear
configuration manifold, thus inherently including in the control design the
nonlinear characteristics of the SE(3) configuration space. In particular,
geometric surface-based controllers are developed and are shown, through
rigorous stability proofs, to have desirable almost global closed loop
properties. For the first time in regards to the geometric literature, a region
of attraction independent of the position error is identified and its effects
are analyzed. The effectiveness of the proposed "surface based" controllers are
illustrated by simulations of aggressive maneuvers in the presence of
disturbances and motor saturation.
| cs.SY math.DS | new quadrotor uav control algorithms are developed based on nonlinear surfaces composed of tracking errors that evolve directly on the nonlinear configuration manifold thus inherently including in the control design the nonlinear characteristics of the se3 configuration space in particular geometric surfacebased controllers are developed and are shown through rigorous stability proofs to have desirable almost global closed loop properties for the first time in regards to the geometric literature a region of attraction independent of the position error is identified and its effects are analyzed the effectiveness of the proposed surface based controllers are illustrated by simulations of aggressive maneuvers in the presence of disturbances and motor saturation | [['new', 'quadrotor', 'uav', 'control', 'algorithms', 'are', 'developed', 'based', 'on', 'nonlinear', 'surfaces', 'composed', 'of', 'tracking', 'errors', 'that', 'evolve', 'directly', 'on', 'the', 'nonlinear', 'configuration', 'manifold', 'thus', 'inherently', 'including', 'in', 'the', 'control', 'design', 'the', 'nonlinear', 'characteristics', 'of', 'the', 'se3', 'configuration', 'space', 'in', 'particular', 'geometric', 'surfacebased', 'controllers', 'are', 'developed', 'and', 'are', 'shown', 'through', 'rigorous', 'stability', 'proofs', 'to', 'have', 'desirable', 'almost', 'global', 'closed', 'loop', 'properties', 'for', 'the', 'first', 'time', 'in', 'regards', 'to', 'the', 'geometric', 'literature', 'a', 'region', 'of', 'attraction', 'independent', 'of', 'the', 'position', 'error', 'is', 'identified', 'and', 'its', 'effects', 'are', 'analyzed', 'the', 'effectiveness', 'of', 'the', 'proposed', 'surface', 'based', 'controllers', 'are', 'illustrated', 'by', 'simulations', 'of', 'aggressive', 'maneuvers', 'in', 'the', 'presence', 'of', 'disturbances', 'and', 'motor', 'saturation']] | [-0.1644831098014822, 0.06211577752314576, -0.06753203059640636, 0.016713356563966688, -0.08040828744821045, -0.12936797879055278, -0.01207255955717159, 0.39527757456440715, -0.24225377312801574, -0.30377805209077824, 0.1491182014397388, -0.21045726353148803, -0.19200057293279865, 0.24358871956825803, -0.12866144005979258, 0.13174389664953096, 0.05215266395206435, 0.009770302811141955, -0.03739016147868691, -0.21616241250746807, 0.3081114321280647, 0.03577581697374309, 0.29546126335594425, -0.0241841154574596, 0.1449360818679043, -0.014407057955929446, -0.01954294399383965, 0.054870254791356675, -0.10776374304760301, 0.11431856648120688, 0.22812379778730213, 0.08071212278119098, 0.2731552348224395, -0.46089076410141694, -0.22464354613949672, 0.030701128014047212, 0.13340026999336727, 0.06663526972294401, -0.05997195809763438, -0.34604880300888774, 0.09429201271722452, -0.09538921731985558, -0.13130274616233115, -0.1148048185512697, 0.008953053952801392, 0.08556653667185797, -0.23269488132738192, 0.024273141710207276, 0.03514643864056796, 0.08209033040415256, -0.09632474353746298, -0.09681960602863393, -0.06624407108463005, 0.17647038663869913, 0.03309098411342898, -0.03520456444335367, 0.19101779636234864, -0.09747281497122225, -0.14295232805654134, 0.3547720630576304, 0.02145967963407961, -0.2607782672612219, 0.17906188547884652, -0.08375393145572428, -0.09062267335371003, 0.16895320565106536, 0.23363799465939813, 0.13131473104495112, -0.158160092928575, 0.06877658337433694, 0.02479938049843415, 0.14574486229338024, 0.01230091496729591, 0.029671099592307838, 0.13334399612124906, 0.20947989466634298, 0.12101261315380282, 0.12483371833527307, -0.07555969608701987, -0.18069388983859852, -0.30104591543658066, -0.0957035215127222, -0.1337364176565935, -0.05958707433262276, -0.05906399106994002, -0.15183377867204634, 0.40313571911100127, 0.13396081183139885, 0.1405413145575365, 0.04743604003152716, 0.33528324257616604, 0.08252623342319367, 0.03602876222837682, 0.07394560305145356, 0.30014241668993796, 0.12133299845800556, 0.06804298546694972, -0.26764758745498884, 0.10134960696049923, 0.06039152719900696] |
1,802.08921 | Rigidity of $\ell^p$ Roe-type algebras | We investigate the rigidity of the $\ell^p$ analog of Roe-type algebras. In
particular, we show that if $p\in[1,\infty)\setminus\{2\}$, then an isometric
isomorphism between the $\ell^p$ uniform Roe algebras of two metric spaces with
bounded geometry yields a bijective coarse equivalence between the underlying
metric spaces, while a stable isometric isomorphism yields a coarse
equivalence. We also obtain similar results for other $\ell^p$ Roe-type
algebras. In this paper, we do not assume that the metric spaces have Yu's
property A or finite decomposition complexity.
| math.OA math.FA | we investigate the rigidity of the ellp analog of roetype algebras in particular we show that if pin1inftysetminus2 then an isometric isomorphism between the ellp uniform roe algebras of two metric spaces with bounded geometry yields a bijective coarse equivalence between the underlying metric spaces while a stable isometric isomorphism yields a coarse equivalence we also obtain similar results for other ellp roetype algebras in this paper we do not assume that the metric spaces have yus property a or finite decomposition complexity | [['we', 'investigate', 'the', 'rigidity', 'of', 'the', 'ellp', 'analog', 'of', 'roetype', 'algebras', 'in', 'particular', 'we', 'show', 'that', 'if', 'pin1inftysetminus2', 'then', 'an', 'isometric', 'isomorphism', 'between', 'the', 'ellp', 'uniform', 'roe', 'algebras', 'of', 'two', 'metric', 'spaces', 'with', 'bounded', 'geometry', 'yields', 'a', 'bijective', 'coarse', 'equivalence', 'between', 'the', 'underlying', 'metric', 'spaces', 'while', 'a', 'stable', 'isometric', 'isomorphism', 'yields', 'a', 'coarse', 'equivalence', 'we', 'also', 'obtain', 'similar', 'results', 'for', 'other', 'ellp', 'roetype', 'algebras', 'in', 'this', 'paper', 'we', 'do', 'not', 'assume', 'that', 'the', 'metric', 'spaces', 'have', 'yus', 'property', 'a', 'or', 'finite', 'decomposition', 'complexity']] | [-0.12882748216663192, 0.11450533525008146, -0.1228490270469792, 0.13867393988269813, -0.0967456164610822, -0.12618506698664733, -0.023484376564383416, 0.4399430586859902, -0.39020687805079834, -0.1623035571339154, 0.1135407119574843, -0.21663136832506918, -0.16675842082321007, 0.15294524893113526, -0.19744876120239496, -0.001562204819581494, 0.09743663841267912, 0.08857768994369884, -0.19940037756772122, -0.24476792915474352, 0.43581463544197924, -0.049153722081583265, 0.2706862115187616, 0.05042120441226516, 0.15672644462845312, -0.004630651733860737, -0.01257078897026254, 0.06064083754644366, -0.21916392406469307, 0.13306026676351704, 0.273568555848991, 0.09248314518481493, 0.24222226217161955, -0.33121998328715563, -0.13589957650614584, 0.2462420993223332, 0.1291886387710891, -0.009146980898704653, -0.08274069876500928, -0.2551960491734307, 0.10161399300687196, -0.141685086336532, -0.052279495790305476, -0.10450705718078719, 0.0268166670533147, -0.006933912351619589, -0.25620046204592034, -0.009170628633000888, 0.20486263679794786, 0.07383870104009785, -0.15509020258025152, -0.03619083355567077, -0.048538828518514224, 0.10859267413332241, -0.041435377252083724, 0.0456914948469891, 0.0483882458789683, -0.005050736113178839, -0.1491298007327359, 0.3521828172137825, -0.053535534852615946, -0.2842394593597685, 0.17103235905694708, -0.14871557805653116, -0.20307024043598554, 0.060318668554650574, 0.068571209816671, 0.14914940385057068, -0.024789639544196246, 0.22645602901125464, -0.12254601700526731, 0.11831131854617014, 0.11374289178993643, 0.04106417715140596, 0.02941094781839993, 0.07791373308282346, 0.1757458533421613, 0.1692951123788101, 0.08393132572542172, -0.028349036760429467, -0.336276449955909, -0.18943905743781658, -0.09349692623108262, 0.12671761790864744, -0.18634871927816876, -0.2168345182520769, 0.32801925499991674, 0.1013457852234019, 0.1892212649080448, 0.18096339698063163, 0.23840828047974444, -0.011855675696917787, 0.032703741544448744, 0.08723933971486986, 0.21843189151003595, 0.2331643224943702, -0.012613054498371372, -0.1164981023147248, -0.05052018793095357, 0.292280859388262] |
1,802.08922 | Positively curved Killing foliations via deformations | We show that a compact manifold admitting a Killing foliation with positive
transverse curvature fibers over finite quotients of spheres or weighted
complex projective spaces, provided that the singular foliation defined by the
closures of the leaves has maximal dimension. This result is obtained by
deforming the foliation into a closed one while maintaining transverse
geometric properties, which allows us to apply results from the Riemannian
geometry of orbifolds to the space of leaves. We also show that the basic Euler
characteristic is preserved by such deformations. Using this fact we prove that
a Riemannian foliation of a compact manifold with finite fundamental group and
nonvanishing Euler characteristic is closed. As another application we obtain
that, for a positively curved Killing foliation of a compact manifold, if the
structural algebra has sufficiently large dimension then the basic Euler
characteristic is positive.
| math.DG | we show that a compact manifold admitting a killing foliation with positive transverse curvature fibers over finite quotients of spheres or weighted complex projective spaces provided that the singular foliation defined by the closures of the leaves has maximal dimension this result is obtained by deforming the foliation into a closed one while maintaining transverse geometric properties which allows us to apply results from the riemannian geometry of orbifolds to the space of leaves we also show that the basic euler characteristic is preserved by such deformations using this fact we prove that a riemannian foliation of a compact manifold with finite fundamental group and nonvanishing euler characteristic is closed as another application we obtain that for a positively curved killing foliation of a compact manifold if the structural algebra has sufficiently large dimension then the basic euler characteristic is positive | [['we', 'show', 'that', 'a', 'compact', 'manifold', 'admitting', 'a', 'killing', 'foliation', 'with', 'positive', 'transverse', 'curvature', 'fibers', 'over', 'finite', 'quotients', 'of', 'spheres', 'or', 'weighted', 'complex', 'projective', 'spaces', 'provided', 'that', 'the', 'singular', 'foliation', 'defined', 'by', 'the', 'closures', 'of', 'the', 'leaves', 'has', 'maximal', 'dimension', 'this', 'result', 'is', 'obtained', 'by', 'deforming', 'the', 'foliation', 'into', 'a', 'closed', 'one', 'while', 'maintaining', 'transverse', 'geometric', 'properties', 'which', 'allows', 'us', 'to', 'apply', 'results', 'from', 'the', 'riemannian', 'geometry', 'of', 'orbifolds', 'to', 'the', 'space', 'of', 'leaves', 'we', 'also', 'show', 'that', 'the', 'basic', 'euler', 'characteristic', 'is', 'preserved', 'by', 'such', 'deformations', 'using', 'this', 'fact', 'we', 'prove', 'that', 'a', 'riemannian', 'foliation', 'of', 'a', 'compact', 'manifold', 'with', 'finite', 'fundamental', 'group', 'and', 'nonvanishing', 'euler', 'characteristic', 'is', 'closed', 'as', 'another', 'application', 'we', 'obtain', 'that', 'for', 'a', 'positively', 'curved', 'killing', 'foliation', 'of', 'a', 'compact', 'manifold', 'if', 'the', 'structural', 'algebra', 'has', 'sufficiently', 'large', 'dimension', 'then', 'the', 'basic', 'euler', 'characteristic', 'is', 'positive']] | [-0.19588077302810783, 0.12733297352844203, -0.11492232344251999, 0.06092859830555394, -0.14756761166987056, -0.1529758891638976, -0.09324429308374722, 0.34714176079773523, -0.28734587675872003, -0.16828971069821336, 0.10449821621151509, -0.23276463815794204, -0.15698720856424395, 0.19510208087286363, -0.12913526687440827, -0.0046844847850395855, 0.08681982554039581, 0.12413884964540389, -0.12474547788758386, -0.2544210460697505, 0.49759374508726684, -0.03261865632185805, 0.22828611131783919, 0.07885886021107039, 0.2351861630652285, -0.008706276404096725, 0.030340584331845985, 0.110567516051786, -0.15160035803640165, 0.11483614224649913, 0.24827160767662662, 0.08630903582551008, 0.20198716459042848, -0.35787109082155194, -0.21947915163815868, 0.16671527227954874, 0.14794567420233226, 0.02370824022358944, -0.02931645685470009, -0.28926987393845055, 0.14142857299100423, -0.08588384145355606, -0.22695392539645445, -0.12560446511009538, 0.05161201704544484, -0.02399906138963799, -0.17507079920685248, -0.009643377444140467, 0.1416585901620012, 0.10681098933391114, -0.08960089607350859, -0.035668040410258825, -0.08335794457267467, 0.08419326446778702, 0.04039737628772855, 0.06336882628718431, 0.12643902905694876, -0.03687805580701811, -0.09888143759181207, 0.34050921258410927, -0.10386141750248189, -0.3280549527720568, 0.12348519015977992, -0.19153697432038633, -0.14368026351212715, 0.16684257482171905, 0.11203974708650552, 0.17521556596278298, -0.03515274687637145, 0.18036220556889587, -0.09142947015814906, 0.06911260309028076, 0.10831891596053086, -0.04567021294992338, 0.13481328361469538, 0.12386587348350502, 0.16926501705212163, 0.11403624713916252, -0.028678436076651652, -0.06384335237461083, -0.3603304599193817, -0.23954566788747378, -0.14580092540816636, 0.21866324397979686, -0.1541903325890526, -0.2025562045461637, 0.4012423635605749, -0.024778692124424673, 0.2252551174676376, 0.12825700336099596, 0.26340122872894195, 0.048661065922805655, 0.07400935763453549, 0.1145009768830884, 0.14431833310039544, 0.21648322381838786, -0.007409141143843373, -0.13998778792038719, -0.03727695333989377, 0.1607191108517243] |
1,802.08923 | The Strong Trotter Property for Locally $\mu$-convex Lie Groups | We show that an infinite dimensional Lie group in Milnor's sense has the
strong Trotter property if it is locally $\mu$-convex. This is a continuity
condition imposed on the Lie group multiplication that generalizes the triangle
inequality for locally convex vector spaces, and is equivalent to
$C^0$-continuity of the evolution map on its domain. In particular, the result
proven in this paper significantly extends the respective result obtained by
Gl\"ockner in the context of measurable regularity.
| math.FA math.DG | we show that an infinite dimensional lie group in milnors sense has the strong trotter property if it is locally muconvex this is a continuity condition imposed on the lie group multiplication that generalizes the triangle inequality for locally convex vector spaces and is equivalent to c0continuity of the evolution map on its domain in particular the result proven in this paper significantly extends the respective result obtained by glockner in the context of measurable regularity | [['we', 'show', 'that', 'an', 'infinite', 'dimensional', 'lie', 'group', 'in', 'milnors', 'sense', 'has', 'the', 'strong', 'trotter', 'property', 'if', 'it', 'is', 'locally', 'muconvex', 'this', 'is', 'a', 'continuity', 'condition', 'imposed', 'on', 'the', 'lie', 'group', 'multiplication', 'that', 'generalizes', 'the', 'triangle', 'inequality', 'for', 'locally', 'convex', 'vector', 'spaces', 'and', 'is', 'equivalent', 'to', 'c0continuity', 'of', 'the', 'evolution', 'map', 'on', 'its', 'domain', 'in', 'particular', 'the', 'result', 'proven', 'in', 'this', 'paper', 'significantly', 'extends', 'the', 'respective', 'result', 'obtained', 'by', 'glockner', 'in', 'the', 'context', 'of', 'measurable', 'regularity']] | [-0.14118606643130382, 0.07776169162418228, -0.09492696115126212, 0.05019130327583601, -0.09875653624534607, -0.08188085262974103, 0.0006031883306180437, 0.3764912924667199, -0.33528462978079915, -0.18637900068735083, 0.14082659168789785, -0.20144579862225023, -0.1537170329938332, 0.20984597090631724, -0.15985900847862164, 0.0030106151468741395, 0.06757561940699816, 0.11211353627343973, -0.09000400100834667, -0.28115221466558676, 0.40519057419151067, -0.02680053930108746, 0.2818334826858093, 0.07554489215835929, 0.11562045520792405, 0.029853200390934944, -0.014260506369173526, 0.04055598326027393, -0.140151080074138, 0.12284895993148287, 0.2195855670173963, 0.0881866651152571, 0.259780201256508, -0.341343528367579, -0.1846318633854389, 0.1545760386561354, 0.11729002500573794, 0.007348029824594656, -0.04298909518091629, -0.29885088637471197, 0.1310049360866348, -0.11365088876336812, -0.15370878755425413, -0.05392660894120733, 0.028183836415410043, -0.021221852439145247, -0.25985708923389517, 0.05228911634534597, 0.16616715490818024, 0.04802811536937952, -0.09305753633535156, -0.037417639872680104, -0.039890615244706475, 0.0697642837294067, 0.005938684058686097, 0.10212407475337386, 0.07487545475984612, -0.06804171035813246, -0.0806712421371291, 0.3653766783575217, -0.06990039865796764, -0.2529682365308205, 0.16235004199668765, -0.19819439191992083, -0.17717004746198653, 0.06551671082153916, 0.07740434434264898, 0.1289527334024509, -0.1046583326285084, 0.23155817055376246, -0.1402584896205614, 0.09269633306811254, 0.09803993962705135, 0.015057433707018694, 0.051151626060406366, 0.10144700864640376, 0.19156421441584826, 0.13457927284762264, 0.04237969898308317, -0.04948162795587753, -0.32955731951942047, -0.1850639393677314, -0.19220712252892555, 0.07305565644676487, -0.10279046592593659, -0.1483327029707531, 0.34233238277801625, 0.10513513277828072, 0.15891751079509656, 0.11979488871991634, 0.22187227827807268, 0.1382978465159734, 0.07029294121700029, 0.09104753333454331, 0.20655703581248722, 0.20599990921405453, 0.038683916069567205, -0.16208841459825635, 0.05224906198758011, 0.18298171532029908] |
1,802.08924 | Time Series Learning using Monotonic Logical Properties | Cyber-physical systems of today are generating large volumes of time-series
data. As manual inspection of such data is not tractable, the need for learning
methods to help discover logical structure in the data has increased. We
propose a logic-based framework that allows domain-specific knowledge to be
embedded into formulas in a parametric logical specification over time-series
data. The key idea is to then map a time series to a surface in the parameter
space of the formula. Given this mapping, we identify the Hausdorff distance
between boundaries as a natural distance metric between two time-series data
under the lens of the parametric specification. This enables embedding
non-trivial domain-specific knowledge into the distance metric and then using
off-the-shelf machine learning tools to label the data. After labeling the
data, we demonstrate how to extract a logical specification for each label.
Finally, we showcase our technique on real world traffic data to learn
classifiers/monitors for slow-downs and traffic jams.
| cs.LG | cyberphysical systems of today are generating large volumes of timeseries data as manual inspection of such data is not tractable the need for learning methods to help discover logical structure in the data has increased we propose a logicbased framework that allows domainspecific knowledge to be embedded into formulas in a parametric logical specification over timeseries data the key idea is to then map a time series to a surface in the parameter space of the formula given this mapping we identify the hausdorff distance between boundaries as a natural distance metric between two timeseries data under the lens of the parametric specification this enables embedding nontrivial domainspecific knowledge into the distance metric and then using offtheshelf machine learning tools to label the data after labeling the data we demonstrate how to extract a logical specification for each label finally we showcase our technique on real world traffic data to learn classifiersmonitors for slowdowns and traffic jams | [['cyberphysical', 'systems', 'of', 'today', 'are', 'generating', 'large', 'volumes', 'of', 'timeseries', 'data', 'as', 'manual', 'inspection', 'of', 'such', 'data', 'is', 'not', 'tractable', 'the', 'need', 'for', 'learning', 'methods', 'to', 'help', 'discover', 'logical', 'structure', 'in', 'the', 'data', 'has', 'increased', 'we', 'propose', 'a', 'logicbased', 'framework', 'that', 'allows', 'domainspecific', 'knowledge', 'to', 'be', 'embedded', 'into', 'formulas', 'in', 'a', 'parametric', 'logical', 'specification', 'over', 'timeseries', 'data', 'the', 'key', 'idea', 'is', 'to', 'then', 'map', 'a', 'time', 'series', 'to', 'a', 'surface', 'in', 'the', 'parameter', 'space', 'of', 'the', 'formula', 'given', 'this', 'mapping', 'we', 'identify', 'the', 'hausdorff', 'distance', 'between', 'boundaries', 'as', 'a', 'natural', 'distance', 'metric', 'between', 'two', 'timeseries', 'data', 'under', 'the', 'lens', 'of', 'the', 'parametric', 'specification', 'this', 'enables', 'embedding', 'nontrivial', 'domainspecific', 'knowledge', 'into', 'the', 'distance', 'metric', 'and', 'then', 'using', 'offtheshelf', 'machine', 'learning', 'tools', 'to', 'label', 'the', 'data', 'after', 'labeling', 'the', 'data', 'we', 'demonstrate', 'how', 'to', 'extract', 'a', 'logical', 'specification', 'for', 'each', 'label', 'finally', 'we', 'showcase', 'our', 'technique', 'on', 'real', 'world', 'traffic', 'data', 'to', 'learn', 'classifiersmonitors', 'for', 'slowdowns', 'and', 'traffic', 'jams']] | [-0.0740397116333509, 0.0025227709273353983, -0.1072773251007908, 0.09051189833553508, -0.17047104261552867, -0.12356300524865779, 0.09256984298236859, 0.41308621232373977, -0.31293192143456483, -0.3353514956095471, 0.09527089375814494, -0.27259732184206653, -0.14257693085938883, 0.22018644347106323, -0.13238742905890924, 0.10560783295510098, 0.086806397283605, 0.045879350727400146, -0.0700414252291338, -0.2175084502564576, 0.3589014466195248, -0.024633748307585333, 0.3072123574212385, 0.0149491740348122, 0.11705583779630849, 0.0011114818312657566, -0.040002868111537866, -0.020024775799239974, -0.10216941982934002, 0.18240860682458448, 0.3599470126941108, 0.28902220424825853, 0.30136780556924164, -0.4292485758614464, -0.20822680309319344, 0.11127520740056077, 0.10191987802047664, 0.10754692691709632, 0.004978771723705368, -0.3413297937084467, 0.08934350087731265, -0.156454424543951, -0.04540460091718556, -0.15158232817283043, 0.0287909547959526, -0.026381640515934963, -0.275168350076479, -0.030771601864566598, 0.061197906613158874, 0.09026435847418049, -0.03725519059681131, -0.010741393432582323, -0.014730715513742791, 0.1852221166750846, 0.02974717983773026, 0.04083723551593721, 0.11109259304327843, -0.09385111436952287, -0.11461777742713308, 0.358783010792626, -0.0462921523740545, -0.21818044018716767, 0.1636637248157058, -0.05136969222878225, -0.1636608966285936, 0.09271957836179541, 0.2513435672377594, 0.05893980130181612, -0.20246032318764498, 0.06089686565862324, -0.004803669501621372, 0.21613011823799938, 0.030340007342135485, -0.016141017543701217, 0.17360710913840777, 0.23010334188643938, 0.05921511799514962, 0.1395557350919355, -0.1228904436261823, -0.06766933342143415, -0.27018049469169897, -0.15760211917595604, -0.19947513790789229, -0.008967495338229362, -0.14762904557368856, -0.17317677272652732, 0.3678717971749556, 0.2027782620772576, 0.21642655998360938, 0.10348478711108701, 0.34660025822141993, 0.04779465123936415, 0.11388239947458108, 0.08076517530030404, 0.11663885397884326, 0.03845019380633648, 0.10973575996542469, -0.13831017723527905, 0.07285449652520654, 0.03513075399976701] |
1,802.08925 | Generating retinal flow maps from structural optical coherence
tomography with artificial intelligence | Despite significant advances in artificial intelligence (AI) for computer
vision, its application in medical imaging has been limited by the burden and
limits of expert-generated labels. We used images from optical coherence
tomography angiography (OCTA), a relatively new imaging modality that measures
perfusion of the retinal vasculature, to train an AI algorithm to generate
vasculature maps from standard structural optical coherence tomography (OCT)
images of the same retinae, both exceeding the ability and bypassing the need
for expert labeling. Deep learning was able to infer perfusion of
microvasculature from structural OCT images with similar fidelity to OCTA and
significantly better than expert clinicians (P < 0.00001). OCTA suffers from
need of specialized hardware, laborious acquisition protocols, and motion
artifacts; whereas our model works directly from standard OCT which are
ubiquitous and quick to obtain, and allows unlocking of large volumes of
previously collected standard OCT data both in existing clinical trials and
clinical practice. This finding demonstrates a novel application of AI to
medical imaging, whereby subtle regularities between different modalities are
used to image the same body part and AI is used to generate detailed and
accurate inferences of tissue function from structure imaging.
| cs.CV cs.AI stat.ML | despite significant advances in artificial intelligence ai for computer vision its application in medical imaging has been limited by the burden and limits of expertgenerated labels we used images from optical coherence tomography angiography octa a relatively new imaging modality that measures perfusion of the retinal vasculature to train an ai algorithm to generate vasculature maps from standard structural optical coherence tomography oct images of the same retinae both exceeding the ability and bypassing the need for expert labeling deep learning was able to infer perfusion of microvasculature from structural oct images with similar fidelity to octa and significantly better than expert clinicians p 000001 octa suffers from need of specialized hardware laborious acquisition protocols and motion artifacts whereas our model works directly from standard oct which are ubiquitous and quick to obtain and allows unlocking of large volumes of previously collected standard oct data both in existing clinical trials and clinical practice this finding demonstrates a novel application of ai to medical imaging whereby subtle regularities between different modalities are used to image the same body part and ai is used to generate detailed and accurate inferences of tissue function from structure imaging | [['despite', 'significant', 'advances', 'in', 'artificial', 'intelligence', 'ai', 'for', 'computer', 'vision', 'its', 'application', 'in', 'medical', 'imaging', 'has', 'been', 'limited', 'by', 'the', 'burden', 'and', 'limits', 'of', 'expertgenerated', 'labels', 'we', 'used', 'images', 'from', 'optical', 'coherence', 'tomography', 'angiography', 'octa', 'a', 'relatively', 'new', 'imaging', 'modality', 'that', 'measures', 'perfusion', 'of', 'the', 'retinal', 'vasculature', 'to', 'train', 'an', 'ai', 'algorithm', 'to', 'generate', 'vasculature', 'maps', 'from', 'standard', 'structural', 'optical', 'coherence', 'tomography', 'oct', 'images', 'of', 'the', 'same', 'retinae', 'both', 'exceeding', 'the', 'ability', 'and', 'bypassing', 'the', 'need', 'for', 'expert', 'labeling', 'deep', 'learning', 'was', 'able', 'to', 'infer', 'perfusion', 'of', 'microvasculature', 'from', 'structural', 'oct', 'images', 'with', 'similar', 'fidelity', 'to', 'octa', 'and', 'significantly', 'better', 'than', 'expert', 'clinicians', 'p', '000001', 'octa', 'suffers', 'from', 'need', 'of', 'specialized', 'hardware', 'laborious', 'acquisition', 'protocols', 'and', 'motion', 'artifacts', 'whereas', 'our', 'model', 'works', 'directly', 'from', 'standard', 'oct', 'which', 'are', 'ubiquitous', 'and', 'quick', 'to', 'obtain', 'and', 'allows', 'unlocking', 'of', 'large', 'volumes', 'of', 'previously', 'collected', 'standard', 'oct', 'data', 'both', 'in', 'existing', 'clinical', 'trials', 'and', 'clinical', 'practice', 'this', 'finding', 'demonstrates', 'a', 'novel', 'application', 'of', 'ai', 'to', 'medical', 'imaging', 'whereby', 'subtle', 'regularities', 'between', 'different', 'modalities', 'are', 'used', 'to', 'image', 'the', 'same', 'body', 'part', 'and', 'ai', 'is', 'used', 'to', 'generate', 'detailed', 'and', 'accurate', 'inferences', 'of', 'tissue', 'function', 'from', 'structure', 'imaging']] | [0.04018255574580456, 0.028058967901194116, -0.06553525454123442, 0.07088884058977848, -0.1173342415204011, -0.15870752095587437, 0.011802809428751778, 0.43230646539846235, -0.27025476191554776, -0.35894149128309033, 0.11809686338830584, -0.2789547228948195, -0.18040211176393564, 0.25500009239680216, -0.18558687992741407, 0.1255469604401098, 0.13736870461879444, 0.014612435076115508, -0.027659748513203287, -0.20538906065986606, 0.21079513058790195, 0.010377949595763807, 0.3629583905636782, -0.007527113740134579, 0.10887268402341059, 0.012696443960418047, -0.04834743644776778, -0.01918554401816559, -0.05434113516915774, 0.20000854236136523, 0.3649784396137135, 0.24758225888221336, 0.3041838423235564, -0.4672016003144992, -0.22006410527298798, 0.09785532273974637, 0.15690494530322754, 0.11094113541441279, -0.016616030668579234, -0.3483783043341933, 0.04387970137713873, -0.09169450493461882, -0.006159461651074608, -0.13236177681071848, 0.009945868691212348, -0.037426313537672416, -0.29426678036215326, 0.08569874572977809, -0.012245330383815353, 0.1762002227306752, -0.07347871801288741, -0.08797389380585575, 0.03332454043529793, 0.22481962771352787, 0.0017656549670217183, 0.10775305440533578, 0.16179062844461573, -0.23157387240512364, -0.12667804589094545, 0.3439251257328635, 0.03567482020132608, -0.13599268334719877, 0.25192815637809507, -0.1020648875539167, -0.09464415674064057, 0.1665270596047757, 0.1845979914150606, 0.08067810661979792, -0.17839946184660804, -0.016270319161842545, 0.046563434293927924, 0.2381210276335864, 0.06740077982724214, 0.004222979719649247, 0.13623961617137484, 0.20276631567496903, -0.015206660899222669, 0.12057197164416004, -0.17485717905279963, -0.012423855817148105, -0.1673637782416543, -0.13914291318914662, -0.17888052548267372, 0.04735283144940308, -0.07135600030626993, -0.1571226797592609, 0.3653035949423446, 0.2565297186917534, 0.1459878587334084, 0.007882715062928322, 0.37796796029168206, 0.002077649225036908, 0.16379443098371124, -0.012136913326911513, 0.1876294247545495, 0.056346972228372906, 0.16943593049624578, -0.19398145774292513, 0.08737112688132287, -0.006473149352108606] |
1,802.08926 | Global existence and stability of nearly aligned flocks | We study regularity of a hydrodynamic singular model of collective behavior
introduced in \cite{ST1}. In this note we address the question of global
well-posedness in multi-dimensional settings. It is shown that any initial data
$(u,\rho)$ with small velocity variations $|u(x) - u(y)| < \e$ relative to its
higher order norms, gives rise to a unique global regular solution which aligns
and flocks exponentially fast. Moreover, we prove that the limiting flocks are
stable.
| math.AP | we study regularity of a hydrodynamic singular model of collective behavior introduced in citest1 in this note we address the question of global wellposedness in multidimensional settings it is shown that any initial data urho with small velocity variations ux uy e relative to its higher order norms gives rise to a unique global regular solution which aligns and flocks exponentially fast moreover we prove that the limiting flocks are stable | [['we', 'study', 'regularity', 'of', 'a', 'hydrodynamic', 'singular', 'model', 'of', 'collective', 'behavior', 'introduced', 'in', 'citest1', 'in', 'this', 'note', 'we', 'address', 'the', 'question', 'of', 'global', 'wellposedness', 'in', 'multidimensional', 'settings', 'it', 'is', 'shown', 'that', 'any', 'initial', 'data', 'urho', 'with', 'small', 'velocity', 'variations', 'ux', 'uy', 'e', 'relative', 'to', 'its', 'higher', 'order', 'norms', 'gives', 'rise', 'to', 'a', 'unique', 'global', 'regular', 'solution', 'which', 'aligns', 'and', 'flocks', 'exponentially', 'fast', 'moreover', 'we', 'prove', 'that', 'the', 'limiting', 'flocks', 'are', 'stable']] | [-0.170703527450391, 0.0824325852830645, -0.1092928313899418, 0.10472936376037312, -0.055685052228435665, -0.13124605991654623, -0.016997969138737714, 0.34559269631150324, -0.31371435092788347, -0.19858729970497144, 0.10102566948872138, -0.27023036717633964, -0.1825763668314042, 0.1329687469356864, -0.12277761259785211, 0.03242197824219032, 0.08183792244616739, 0.03924827441625612, -0.051879587983319035, -0.2495712658101824, 0.3092493855617416, 0.0004359287419684336, 0.24902695611702988, 0.01441760005717966, 0.1103437890669226, -0.04433714673185433, -0.010090858741125591, 0.05666871514486175, -0.18856974087207098, 0.12573490508923857, 0.20894705403504343, 0.09319123338160276, 0.3068322111249075, -0.38760631001705276, -0.15897506200314931, 0.1565791007892137, 0.1563218502675406, 0.0910550026324722, -0.021667007852057125, -0.2598976072868411, 0.13798828007043404, -0.15011094775523098, -0.23852003465445948, -0.14736248728569964, 0.08871035479848653, 0.06195282042157692, -0.3163774173287019, 0.09964467432927078, 0.12844975601972333, 0.06543556920869249, -0.1574500026460081, -0.028477057958887497, -0.03752350747178663, 0.07946065918240748, 0.12319271217762742, 0.04593708713434007, 0.03660732805712516, -0.1216760168055361, -0.048937427680152405, 0.3603295648345907, -0.08564309861911067, -0.20721984875034277, 0.2299526781696354, -0.18790665488611435, -0.1287960985898447, 0.12521722047051914, 0.18627019957836036, 0.13003155086714197, -0.09115076423163565, 0.10193066453539872, -0.10802179449328064, 0.15544660541583116, 0.08482004364322819, 0.020684042015821268, 0.11055747031981886, 0.15082071023717733, 0.16416451778971183, 0.09534270302589301, -0.058758344837385686, -0.0886665684708827, -0.2800628082485686, -0.12610517240877092, -0.13117932153104897, 0.09894932112918878, -0.09689559127039335, -0.17492264543428795, 0.3739303257709867, 0.16095255017542923, 0.22997856228022087, 0.06245764952421871, 0.20702390382263128, 0.09617479416397466, -0.010749957583267505, 0.10254531968253809, 0.19848161428825747, 0.10127590332035973, 0.17641167001615107, -0.2043725662523697, 0.06009618175858763, 0.08103068920613175] |
1,802.08927 | Evaluating Design Tradeoffs in Numeric Static Analysis for Java | Numeric static analysis for Java has a broad range of potentially useful
applications, including array bounds checking and resource usage estimation.
However, designing a scalable numeric static analysis for real-world Java
programs presents a multitude of design choices, each of which may interact
with others. For example, an analysis could handle method calls via either a
top-down or bottom-up interprocedural analysis. Moreover, this choice could
interact with how we choose to represent aliasing in the heap and/or whether we
use a relational numeric domain, e.g., convex polyhedra. In this paper, we
present a family of abstract interpretation-based numeric static analyses for
Java and systematically evaluate the impact of 162 analysis configurations on
the DaCapo benchmark suite. Our experiment considered the precision and
performance of the analyses for discharging array bounds checks. We found that
top-down analysis is generally a better choice than bottom-up analysis, and
that using access paths to describe heap objects is better than using summary
objects corresponding to points-to analysis locations. Moreover, these two
choices are the most significant, while choices about the numeric domain,
representation of abstract objects, and context-sensitivity make much less
difference to the precision/performance tradeoff.
| cs.PL | numeric static analysis for java has a broad range of potentially useful applications including array bounds checking and resource usage estimation however designing a scalable numeric static analysis for realworld java programs presents a multitude of design choices each of which may interact with others for example an analysis could handle method calls via either a topdown or bottomup interprocedural analysis moreover this choice could interact with how we choose to represent aliasing in the heap andor whether we use a relational numeric domain eg convex polyhedra in this paper we present a family of abstract interpretationbased numeric static analyses for java and systematically evaluate the impact of 162 analysis configurations on the dacapo benchmark suite our experiment considered the precision and performance of the analyses for discharging array bounds checks we found that topdown analysis is generally a better choice than bottomup analysis and that using access paths to describe heap objects is better than using summary objects corresponding to pointsto analysis locations moreover these two choices are the most significant while choices about the numeric domain representation of abstract objects and contextsensitivity make much less difference to the precisionperformance tradeoff | [['numeric', 'static', 'analysis', 'for', 'java', 'has', 'a', 'broad', 'range', 'of', 'potentially', 'useful', 'applications', 'including', 'array', 'bounds', 'checking', 'and', 'resource', 'usage', 'estimation', 'however', 'designing', 'a', 'scalable', 'numeric', 'static', 'analysis', 'for', 'realworld', 'java', 'programs', 'presents', 'a', 'multitude', 'of', 'design', 'choices', 'each', 'of', 'which', 'may', 'interact', 'with', 'others', 'for', 'example', 'an', 'analysis', 'could', 'handle', 'method', 'calls', 'via', 'either', 'a', 'topdown', 'or', 'bottomup', 'interprocedural', 'analysis', 'moreover', 'this', 'choice', 'could', 'interact', 'with', 'how', 'we', 'choose', 'to', 'represent', 'aliasing', 'in', 'the', 'heap', 'andor', 'whether', 'we', 'use', 'a', 'relational', 'numeric', 'domain', 'eg', 'convex', 'polyhedra', 'in', 'this', 'paper', 'we', 'present', 'a', 'family', 'of', 'abstract', 'interpretationbased', 'numeric', 'static', 'analyses', 'for', 'java', 'and', 'systematically', 'evaluate', 'the', 'impact', 'of', '162', 'analysis', 'configurations', 'on', 'the', 'dacapo', 'benchmark', 'suite', 'our', 'experiment', 'considered', 'the', 'precision', 'and', 'performance', 'of', 'the', 'analyses', 'for', 'discharging', 'array', 'bounds', 'checks', 'we', 'found', 'that', 'topdown', 'analysis', 'is', 'generally', 'a', 'better', 'choice', 'than', 'bottomup', 'analysis', 'and', 'that', 'using', 'access', 'paths', 'to', 'describe', 'heap', 'objects', 'is', 'better', 'than', 'using', 'summary', 'objects', 'corresponding', 'to', 'pointsto', 'analysis', 'locations', 'moreover', 'these', 'two', 'choices', 'are', 'the', 'most', 'significant', 'while', 'choices', 'about', 'the', 'numeric', 'domain', 'representation', 'of', 'abstract', 'objects', 'and', 'contextsensitivity', 'make', 'much', 'less', 'difference', 'to', 'the', 'precisionperformance', 'tradeoff']] | [-0.09271227098338267, 0.013059122512359002, -0.09389327831702862, 0.07885694148504122, -0.16700442607577948, -0.17761163988165285, 0.08278165907411304, 0.4104040710606578, -0.21416775482226436, -0.36998538364514866, 0.13447279847228255, -0.2647671451480055, -0.11614005729350071, 0.21810040731075664, -0.06012745873749022, 0.05827807831634031, 0.1203556982312761, -0.018193240813832945, -0.0696466421102465, -0.19021602499686396, 0.27042579912908615, 0.058275821543157254, 0.27367519986137984, 0.017506851598956062, 0.031953222446231395, 0.030230289917556247, -0.07176411030228927, 0.05469444368634353, -0.11095721122398253, 0.1720940336299797, 0.30669602477211133, 0.21247181710567695, 0.27845961946009107, -0.42015636471436596, -0.18499051822661494, 0.07789210622876648, 0.1554290728306938, 0.10639368199087504, -0.04453635587435001, -0.2717549869600508, 0.1210723708100929, -0.18275141582400076, -0.06217374836938232, -0.14838258419746622, 0.019463858036909507, -0.0005100427572712965, -0.2772490902784334, -0.03038718123494828, 0.04235195330708624, 0.09159638121217022, -0.02945202235156836, -0.141460183342152, 0.02354347456066201, 0.11780646008302834, 0.012773440069828612, -0.0015068835114416573, 0.15361488480072136, -0.09219225265992487, -0.16566846326495768, 0.3721641559328723, 0.006366830954726795, -0.24118995640843774, 0.24114267937156386, -0.04706749342216169, -0.1780891735716211, 0.06516677216158605, 0.2025341052654643, 0.13791041970813736, -0.15375908566590066, 0.03258441524983613, -0.024242956202881926, 0.2523507476584371, 0.09255629030899852, 0.03798916027751685, 0.20102089896422679, 0.2265325642400543, 0.04382272777562054, 0.1672282501304259, -0.03646476441355549, -0.10808811229482995, -0.28808327644322246, -0.12813825236224444, -0.10535366766774022, -0.020120263772563162, -0.13697468714033684, -0.18136562638994091, 0.3845043931039372, 0.20691552979893574, 0.13021664787083864, 0.08502183409306557, 0.32992144579467664, 0.04101787304751946, 0.06397935529653939, 0.07055219522243394, 0.1434595389145363, 0.008612626822206986, 0.10765514248422547, -0.15527431527030758, 0.09642620494403921, 0.007581889594012764] |
1,802.08928 | Curvature estimates and sheeting theorems for weakly stable CMC
hypersurfaces | Weakly stable constant mean curvature (CMC) hypersurfaces are stable critical
points of the area functional with respect to volume preserving deformations.
We establish a pointwise curvature estimate (in the non-singular dimensions)
and a sheeting theorem (in all dimensions) for weakly stable CMC hypersurfaces,
giving an effective version of the compactness theorem for weakly stable CMC
hypersurfaces established in the recent work of the first and third-named
authors. Our results generalize the curvature estimate and the sheeting theorem
proven respectively by Schoen--Simon--Yau and Schoen--Simon for strongly stable
hypersurfaces.
| math.DG math.AP | weakly stable constant mean curvature cmc hypersurfaces are stable critical points of the area functional with respect to volume preserving deformations we establish a pointwise curvature estimate in the nonsingular dimensions and a sheeting theorem in all dimensions for weakly stable cmc hypersurfaces giving an effective version of the compactness theorem for weakly stable cmc hypersurfaces established in the recent work of the first and thirdnamed authors our results generalize the curvature estimate and the sheeting theorem proven respectively by schoensimonyau and schoensimon for strongly stable hypersurfaces | [['weakly', 'stable', 'constant', 'mean', 'curvature', 'cmc', 'hypersurfaces', 'are', 'stable', 'critical', 'points', 'of', 'the', 'area', 'functional', 'with', 'respect', 'to', 'volume', 'preserving', 'deformations', 'we', 'establish', 'a', 'pointwise', 'curvature', 'estimate', 'in', 'the', 'nonsingular', 'dimensions', 'and', 'a', 'sheeting', 'theorem', 'in', 'all', 'dimensions', 'for', 'weakly', 'stable', 'cmc', 'hypersurfaces', 'giving', 'an', 'effective', 'version', 'of', 'the', 'compactness', 'theorem', 'for', 'weakly', 'stable', 'cmc', 'hypersurfaces', 'established', 'in', 'the', 'recent', 'work', 'of', 'the', 'first', 'and', 'thirdnamed', 'authors', 'our', 'results', 'generalize', 'the', 'curvature', 'estimate', 'and', 'the', 'sheeting', 'theorem', 'proven', 'respectively', 'by', 'schoensimonyau', 'and', 'schoensimon', 'for', 'strongly', 'stable', 'hypersurfaces']] | [-0.1686488904253861, 0.09906661667915868, -0.0644511941950335, 0.09090302266223832, 0.005104913081849254, -0.14128890773281455, -0.017421465540348097, 0.29981390109588935, -0.19560709114316419, -0.20829011571152287, 0.1486944547586338, -0.2719689351181651, -0.12449018377404616, 0.17706612452084936, -0.16341577277540467, 0.06933863296411759, 0.045519509731770255, 0.07326354190360668, -0.06011743600436941, -0.32554813522065795, 0.3949951332842195, -0.016267133714241343, 0.24462558190489925, 0.12791091688979028, 0.12082472150105723, 0.015768788251376082, 0.0019993724972876005, 0.07377900604191127, -0.26965956383406425, 0.19674575946098843, 0.22183477206610488, 0.01738473429712792, 0.22056601818131152, -0.3307275573701359, -0.2284344519206951, 0.1554628415655908, 0.07548528817092437, 0.050644714363612404, -0.03821263653848883, -0.3130075847513454, 0.12896681388130757, -0.04282445784016556, -0.26797087668159675, -0.14412074990917084, -0.0017128423300333494, -0.0006512438142022421, -0.20277035451862355, 0.13869664882855262, 0.14752194582116465, 0.08674415699098, -0.13348229336660616, -0.05614726588963856, -0.053884445654423255, 0.052937828794901456, 0.07107364009459351, 0.04016499834806593, 0.06941025148600687, -0.05265939439278702, -0.056073913978802604, 0.2802874373466989, -0.11626571521899381, -0.2411854572507531, 0.141619315197648, -0.10223737065030565, -0.13409557223839816, 0.12165430945149341, 0.12835011843505295, 0.2359282752325715, -0.0635130689506484, 0.16536190059187628, 0.0026010536523752435, 0.10544667305793007, 0.14194683133906058, -0.03760433653477839, 0.14268077915361108, 0.07041767921277084, 0.19640913886711175, 0.09744829997937411, -0.01403769419723472, -0.12918676570772605, -0.3220271262405224, -0.24256051252704375, -0.13303429000269146, 0.0869986736215651, -0.1814874433039222, -0.2110374953630272, 0.3614399573484132, 0.009422189821380862, 0.1987574478708814, 0.18527059210464358, 0.22985137957906307, 0.02828255543339088, 0.006470764342825426, 0.13977701884022978, 0.2620509318076074, 0.2400581464848243, 0.06572896542114227, -0.07318716953226993, -0.040310919104782905, 0.16517259377639654] |
1,802.08929 | Market based embedded Real Time Operation for Distributed Resources and
Flexibility | We build upon previous work out of UC Berkeley's energy, controls, and
applications laboratory (eCal) that developed a model for price prediction of
the energy day-ahead market (DAM) and a stochastic load scheduling for
distributed energy resources (DER) with DAM based objective\cite{Travacca}. In
similar fashion to the work of Travacca et al., in this project we take the
standpoint of a DER aggregator pooling a large number of electricity consumers
- each of which have an electric vehicle and solar PV panels - to bid their
pooled energy resources into the electricity markets. The primary contribution
of this project is the optimization of an aggregated load schedule for
participation in the California Independent System Operator (CAISO) real time
(15-minute) electricity market. The goal of the aggregator is to optimally
manage its pool of resources, particularly the flexible resources, in order to
minimize its cost in the real time market. We achieves this through the use of
a model predictive control scheme. A critical difference between the prior work
in \cite{Travacca} is that the structure of the optimization problem is
drastically different. Based upon our review of the current and public
literature, no similar approaches exist. The main objective of this project
were building methods. Nevertheless, to illustrate a simulation with 100
prosumers was realized. The results should therefore be taken with a grain of
salt. We find that the Real Time operation does not substantially decrease or
increase the total cost the aggregator faces in the RT market, but this is
probably due to parameters that need further tuning and data, that need better
processing.
| cs.SY | we build upon previous work out of uc berkeleys energy controls and applications laboratory ecal that developed a model for price prediction of the energy dayahead market dam and a stochastic load scheduling for distributed energy resources der with dam based objectivecitetravacca in similar fashion to the work of travacca et al in this project we take the standpoint of a der aggregator pooling a large number of electricity consumers each of which have an electric vehicle and solar pv panels to bid their pooled energy resources into the electricity markets the primary contribution of this project is the optimization of an aggregated load schedule for participation in the california independent system operator caiso real time 15minute electricity market the goal of the aggregator is to optimally manage its pool of resources particularly the flexible resources in order to minimize its cost in the real time market we achieves this through the use of a model predictive control scheme a critical difference between the prior work in citetravacca is that the structure of the optimization problem is drastically different based upon our review of the current and public literature no similar approaches exist the main objective of this project were building methods nevertheless to illustrate a simulation with 100 prosumers was realized the results should therefore be taken with a grain of salt we find that the real time operation does not substantially decrease or increase the total cost the aggregator faces in the rt market but this is probably due to parameters that need further tuning and data that need better processing | [['we', 'build', 'upon', 'previous', 'work', 'out', 'of', 'uc', 'berkeleys', 'energy', 'controls', 'and', 'applications', 'laboratory', 'ecal', 'that', 'developed', 'a', 'model', 'for', 'price', 'prediction', 'of', 'the', 'energy', 'dayahead', 'market', 'dam', 'and', 'a', 'stochastic', 'load', 'scheduling', 'for', 'distributed', 'energy', 'resources', 'der', 'with', 'dam', 'based', 'objectivecitetravacca', 'in', 'similar', 'fashion', 'to', 'the', 'work', 'of', 'travacca', 'et', 'al', 'in', 'this', 'project', 'we', 'take', 'the', 'standpoint', 'of', 'a', 'der', 'aggregator', 'pooling', 'a', 'large', 'number', 'of', 'electricity', 'consumers', 'each', 'of', 'which', 'have', 'an', 'electric', 'vehicle', 'and', 'solar', 'pv', 'panels', 'to', 'bid', 'their', 'pooled', 'energy', 'resources', 'into', 'the', 'electricity', 'markets', 'the', 'primary', 'contribution', 'of', 'this', 'project', 'is', 'the', 'optimization', 'of', 'an', 'aggregated', 'load', 'schedule', 'for', 'participation', 'in', 'the', 'california', 'independent', 'system', 'operator', 'caiso', 'real', 'time', '15minute', 'electricity', 'market', 'the', 'goal', 'of', 'the', 'aggregator', 'is', 'to', 'optimally', 'manage', 'its', 'pool', 'of', 'resources', 'particularly', 'the', 'flexible', 'resources', 'in', 'order', 'to', 'minimize', 'its', 'cost', 'in', 'the', 'real', 'time', 'market', 'we', 'achieves', 'this', 'through', 'the', 'use', 'of', 'a', 'model', 'predictive', 'control', 'scheme', 'a', 'critical', 'difference', 'between', 'the', 'prior', 'work', 'in', 'citetravacca', 'is', 'that', 'the', 'structure', 'of', 'the', 'optimization', 'problem', 'is', 'drastically', 'different', 'based', 'upon', 'our', 'review', 'of', 'the', 'current', 'and', 'public', 'literature', 'no', 'similar', 'approaches', 'exist', 'the', 'main', 'objective', 'of', 'this', 'project', 'were', 'building', 'methods', 'nevertheless', 'to', 'illustrate', 'a', 'simulation', 'with', '100', 'prosumers', 'was', 'realized', 'the', 'results', 'should', 'therefore', 'be', 'taken', 'with', 'a', 'grain', 'of', 'salt', 'we', 'find', 'that', 'the', 'real', 'time', 'operation', 'does', 'not', 'substantially', 'decrease', 'or', 'increase', 'the', 'total', 'cost', 'the', 'aggregator', 'faces', 'in', 'the', 'rt', 'market', 'but', 'this', 'is', 'probably', 'due', 'to', 'parameters', 'that', 'need', 'further', 'tuning', 'and', 'data', 'that', 'need', 'better', 'processing']] | [-0.11009983399148601, 0.05703935201264148, -0.07990254891158727, 0.03211140888922203, -0.07928857393294143, -0.12012898821670276, 0.11791570441743646, 0.38169900122850847, -0.2681874120088581, -0.3438633418641984, 0.10288232092710901, -0.2872412816952699, -0.11929972226476261, 0.18194540909294468, -0.13642962128640368, 0.043235559791523534, 0.05353109838011173, -0.0066194910779953575, 0.023506564577557863, -0.3050594333317489, 0.26618178971066997, 0.13540563937634803, 0.33837531921991076, 0.05416245824621561, 0.07877422121819108, -0.03117743260674895, -0.03250025587174325, 0.0030159551489095274, -0.09857013832373084, 0.15976987626770725, 0.29432734427257223, 0.1338493377984168, 0.360965148510877, -0.4638088439662869, -0.1796925755074391, 0.11927085039787926, 0.06098636628000979, 0.04151388366769355, -0.01503067419353801, -0.19433873508913585, 0.0478397360841672, -0.22524029011121735, -0.06780354350966473, -0.04278201766562863, -0.010098484471941796, 0.04541841601872315, -0.29966542873858437, 0.02301945392257319, 0.018697692846986823, 0.026006123330444098, -0.09211999590042978, -0.10700667346603811, -0.0421058154799259, 0.16734974450306395, 0.06709126171324617, 0.006016741617797659, 0.15820264882842403, -0.10529073057785773, -0.11171788194646629, 0.3983353413032511, -0.009315002200310118, -0.14727743713077732, 0.1317595005196591, -0.0957084748786516, -0.10979899727345373, 0.10472020302097987, 0.22348889768338548, 0.05860620792238758, -0.18871168931789445, 0.05248621575100025, -0.02624467054489427, 0.19848522083887543, 0.03779777595773339, -0.028875625332763704, 0.17486230720443507, 0.20570915595901448, 0.12522411589833118, 0.11752470656199596, -0.04956640921031626, -0.12454200578034103, -0.2447433725411359, -0.17016269755281077, -0.20121332137630535, 0.016522698503831635, -0.06971028991946905, -0.1370774708939, 0.3963781357667148, 0.18001798700603944, 0.149361447035335, 0.05927564475792818, 0.34972270040128095, 0.10264393778074568, 0.07539895719382912, 0.10665888413965989, 0.19160206143592054, -0.02515702425555971, 0.19719286084448237, -0.2351250431135458, 0.08807316633442847, -0.005453251687756094] |
1,802.0893 | Twisted Calabi-Yau ring spectra, string topology, and gauge symmetry | In this paper, we import the theory of "Calabi-Yau" algebras and categories
from symplectic topology and topological field theories to the setting of
spectra in stable homotopy theory. Twistings in this theory will be
particularly important. There will be two types of Calabi-Yau structures in the
setting of ring spectra: one that applies to compact algebras and one that
applies to smooth algebras. The main application of twisted compact Calabi-Yau
ring spectra that we will study is to describe, prove, and explain a certain
duality phenomenon in string topology. This is a duality between the manifold
string topology of Chas-Sullivan and the Lie group string topology of
Chataur-Menichi. This will extend and generalize work of Gruher. Then,
generalizing work of the first author and Jones, we show how the gauge group of
the principal bundle acts on this compact Calabi-Yau structure, and compute
some explicit examples. We then extend the notion of the Calabi-Yau structure
to smooth ring spectra, and prove that Thom ring spectra of (virtual) bundles
over the loop space, $\Omega M$, have this structure. In the case when $M$ is a
sphere we will use these twisted smooth Calabi-Yau ring spectra to study
Lagrangian immersions of the sphere into its cotangent bundle. We recast the
work of Abouzaid-Kragh to show that the topological Hochschild homology of the
Thom ring spectrum induced by the $h$-principle classifying map of the
Lagrangian immersion, detects whether that immersion can be Lagrangian isotopic
to an embedding. We then compute some examples. Finally, we interpret these
Calabi-Yau structures directly in terms of topological Hochschild homology and
cohomology.
| math.AT math.SG | in this paper we import the theory of calabiyau algebras and categories from symplectic topology and topological field theories to the setting of spectra in stable homotopy theory twistings in this theory will be particularly important there will be two types of calabiyau structures in the setting of ring spectra one that applies to compact algebras and one that applies to smooth algebras the main application of twisted compact calabiyau ring spectra that we will study is to describe prove and explain a certain duality phenomenon in string topology this is a duality between the manifold string topology of chassullivan and the lie group string topology of chataurmenichi this will extend and generalize work of gruher then generalizing work of the first author and jones we show how the gauge group of the principal bundle acts on this compact calabiyau structure and compute some explicit examples we then extend the notion of the calabiyau structure to smooth ring spectra and prove that thom ring spectra of virtual bundles over the loop space omega m have this structure in the case when m is a sphere we will use these twisted smooth calabiyau ring spectra to study lagrangian immersions of the sphere into its cotangent bundle we recast the work of abouzaidkragh to show that the topological hochschild homology of the thom ring spectrum induced by the hprinciple classifying map of the lagrangian immersion detects whether that immersion can be lagrangian isotopic to an embedding we then compute some examples finally we interpret these calabiyau structures directly in terms of topological hochschild homology and cohomology | [['in', 'this', 'paper', 'we', 'import', 'the', 'theory', 'of', 'calabiyau', 'algebras', 'and', 'categories', 'from', 'symplectic', 'topology', 'and', 'topological', 'field', 'theories', 'to', 'the', 'setting', 'of', 'spectra', 'in', 'stable', 'homotopy', 'theory', 'twistings', 'in', 'this', 'theory', 'will', 'be', 'particularly', 'important', 'there', 'will', 'be', 'two', 'types', 'of', 'calabiyau', 'structures', 'in', 'the', 'setting', 'of', 'ring', 'spectra', 'one', 'that', 'applies', 'to', 'compact', 'algebras', 'and', 'one', 'that', 'applies', 'to', 'smooth', 'algebras', 'the', 'main', 'application', 'of', 'twisted', 'compact', 'calabiyau', 'ring', 'spectra', 'that', 'we', 'will', 'study', 'is', 'to', 'describe', 'prove', 'and', 'explain', 'a', 'certain', 'duality', 'phenomenon', 'in', 'string', 'topology', 'this', 'is', 'a', 'duality', 'between', 'the', 'manifold', 'string', 'topology', 'of', 'chassullivan', 'and', 'the', 'lie', 'group', 'string', 'topology', 'of', 'chataurmenichi', 'this', 'will', 'extend', 'and', 'generalize', 'work', 'of', 'gruher', 'then', 'generalizing', 'work', 'of', 'the', 'first', 'author', 'and', 'jones', 'we', 'show', 'how', 'the', 'gauge', 'group', 'of', 'the', 'principal', 'bundle', 'acts', 'on', 'this', 'compact', 'calabiyau', 'structure', 'and', 'compute', 'some', 'explicit', 'examples', 'we', 'then', 'extend', 'the', 'notion', 'of', 'the', 'calabiyau', 'structure', 'to', 'smooth', 'ring', 'spectra', 'and', 'prove', 'that', 'thom', 'ring', 'spectra', 'of', 'virtual', 'bundles', 'over', 'the', 'loop', 'space', 'omega', 'm', 'have', 'this', 'structure', 'in', 'the', 'case', 'when', 'm', 'is', 'a', 'sphere', 'we', 'will', 'use', 'these', 'twisted', 'smooth', 'calabiyau', 'ring', 'spectra', 'to', 'study', 'lagrangian', 'immersions', 'of', 'the', 'sphere', 'into', 'its', 'cotangent', 'bundle', 'we', 'recast', 'the', 'work', 'of', 'abouzaidkragh', 'to', 'show', 'that', 'the', 'topological', 'hochschild', 'homology', 'of', 'the', 'thom', 'ring', 'spectrum', 'induced', 'by', 'the', 'hprinciple', 'classifying', 'map', 'of', 'the', 'lagrangian', 'immersion', 'detects', 'whether', 'that', 'immersion', 'can', 'be', 'lagrangian', 'isotopic', 'to', 'an', 'embedding', 'we', 'then', 'compute', 'some', 'examples', 'finally', 'we', 'interpret', 'these', 'calabiyau', 'structures', 'directly', 'in', 'terms', 'of', 'topological', 'hochschild', 'homology', 'and', 'cohomology']] | [-0.2018324237249565, 0.05034295037972428, -0.12616701641725553, 0.1117540382193189, -0.11174338955092226, -0.12256472203313964, -0.05110355005103797, 0.37534915335023133, -0.3298705324845764, -0.21551828826830755, 0.08319439083212073, -0.2142343729266989, -0.2150312491016243, 0.1538979103412486, -0.17520261562195652, -0.06601494182491703, 0.04431059678924401, 0.06624126039886273, -0.09854680077728777, -0.27694270076378896, 0.47113121117327095, -0.0017026335946257675, 0.21983901105313255, 0.07836772368144343, 0.062349890574756234, -0.01134682761172378, -0.00876540880112027, 0.024936057936941085, -0.17150015952573522, 0.16769802898209288, 0.30220272545012233, 0.05420334921519453, 0.10598531724290193, -0.4091594028198107, -0.16067539494061495, 0.1540228681746842, 0.13190424609876206, 0.042867984417330175, -0.0020911781787482787, -0.2750382099624638, 0.13309956119774696, -0.1845543640311595, -0.14579383833130233, -0.12185370924744486, 0.03895497747241898, -0.005484479232053821, -0.166451826546219, -0.0596615125933315, 0.08174695623082466, 0.08803622562353262, -0.08972952580885048, -0.007855214152888824, -0.08568350337587383, 0.10386297297577671, 0.01075961457943002, 0.04322200652367715, 0.13408875255402844, -0.09653366226419637, -0.14500523523955178, 0.36677123424898084, -0.08344474991720645, -0.19746245512889987, 0.1116270689690351, -0.17107735446764036, -0.2158739449502369, 0.12418008102776887, 0.09988816039983764, 0.17459765892164222, -0.01924263331123952, 0.1906301836308779, -0.10372684008225855, 0.0819666840954057, 0.08590168850018357, 0.012709098707613652, 0.16617378066364719, 0.1024219164223775, 0.08964315050935812, 0.14998221817070498, -0.03190289789495614, -0.07343132139675801, -0.3661614851636578, -0.23569916826566617, -0.09871980237965773, 0.1657056665736757, -0.06958283699936935, -0.14902103276916218, 0.4238910895078213, 0.0814838330086565, 0.22050841860278392, 0.09392987125191993, 0.2503752708488176, 0.02518031511171597, 0.061604114295383594, 0.02644852207470756, 0.15989684057178527, 0.23102786198184036, 0.025498060368359117, -0.13092318657890117, -0.11913138262913367, 0.2065191670416539] |
1,802.08931 | Fast, accurate solutions for curvilinear earthquake faults and anelastic
strain | Imaging the anelastic deformation within the crust and lithosphere using
surface geophysical data remains a significant challenge in part due to the
wide range of physical processes operating at different depths and to various
levels of localization that they embody. Models of Earth's elastic properties
from seismological imaging combined with geodetic modeling may form the basis
of comprehensive rheological models of Earth's interior. However, representing
the structural complexity of faults and shear zones in numerical models of
deformation still constitutes a major difficulty. Here, we present numerical
techniques for high-precision models of deformation and stress around both
curvilinear faults and volumes undergoing anelastic (irreversible) strain in a
heterogenous elastic half-space. To that end, we enhance the software Gamra to
model triangular and rectangular fault patches and tetrahedral and cuboidal
strain volumes. This affords a means of rapid and accurate calculations of
elasto-static Green's functions for localized (e.g., faulting) and distributed
(e.g., viscoelastic) deformation in Earth's crust and lithosphere. We
demonstrate the correctness of the method with analytic tests, and we
illustrate its practical performance by solving for coseismic and postseismic
deformation following the 2015 Mw 7.8 Gorkha, Nepal earthquake to extremely
high precision.
| physics.geo-ph | imaging the anelastic deformation within the crust and lithosphere using surface geophysical data remains a significant challenge in part due to the wide range of physical processes operating at different depths and to various levels of localization that they embody models of earths elastic properties from seismological imaging combined with geodetic modeling may form the basis of comprehensive rheological models of earths interior however representing the structural complexity of faults and shear zones in numerical models of deformation still constitutes a major difficulty here we present numerical techniques for highprecision models of deformation and stress around both curvilinear faults and volumes undergoing anelastic irreversible strain in a heterogenous elastic halfspace to that end we enhance the software gamra to model triangular and rectangular fault patches and tetrahedral and cuboidal strain volumes this affords a means of rapid and accurate calculations of elastostatic greens functions for localized eg faulting and distributed eg viscoelastic deformation in earths crust and lithosphere we demonstrate the correctness of the method with analytic tests and we illustrate its practical performance by solving for coseismic and postseismic deformation following the 2015 mw 78 gorkha nepal earthquake to extremely high precision | [['imaging', 'the', 'anelastic', 'deformation', 'within', 'the', 'crust', 'and', 'lithosphere', 'using', 'surface', 'geophysical', 'data', 'remains', 'a', 'significant', 'challenge', 'in', 'part', 'due', 'to', 'the', 'wide', 'range', 'of', 'physical', 'processes', 'operating', 'at', 'different', 'depths', 'and', 'to', 'various', 'levels', 'of', 'localization', 'that', 'they', 'embody', 'models', 'of', 'earths', 'elastic', 'properties', 'from', 'seismological', 'imaging', 'combined', 'with', 'geodetic', 'modeling', 'may', 'form', 'the', 'basis', 'of', 'comprehensive', 'rheological', 'models', 'of', 'earths', 'interior', 'however', 'representing', 'the', 'structural', 'complexity', 'of', 'faults', 'and', 'shear', 'zones', 'in', 'numerical', 'models', 'of', 'deformation', 'still', 'constitutes', 'a', 'major', 'difficulty', 'here', 'we', 'present', 'numerical', 'techniques', 'for', 'highprecision', 'models', 'of', 'deformation', 'and', 'stress', 'around', 'both', 'curvilinear', 'faults', 'and', 'volumes', 'undergoing', 'anelastic', 'irreversible', 'strain', 'in', 'a', 'heterogenous', 'elastic', 'halfspace', 'to', 'that', 'end', 'we', 'enhance', 'the', 'software', 'gamra', 'to', 'model', 'triangular', 'and', 'rectangular', 'fault', 'patches', 'and', 'tetrahedral', 'and', 'cuboidal', 'strain', 'volumes', 'this', 'affords', 'a', 'means', 'of', 'rapid', 'and', 'accurate', 'calculations', 'of', 'elastostatic', 'greens', 'functions', 'for', 'localized', 'eg', 'faulting', 'and', 'distributed', 'eg', 'viscoelastic', 'deformation', 'in', 'earths', 'crust', 'and', 'lithosphere', 'we', 'demonstrate', 'the', 'correctness', 'of', 'the', 'method', 'with', 'analytic', 'tests', 'and', 'we', 'illustrate', 'its', 'practical', 'performance', 'by', 'solving', 'for', 'coseismic', 'and', 'postseismic', 'deformation', 'following', 'the', '2015', 'mw', '78', 'gorkha', 'nepal', 'earthquake', 'to', 'extremely', 'high', 'precision']] | [-0.09817222968497831, 0.10748999635079456, -0.05139082123852135, 0.01598959438276053, -0.06142735101419126, -0.042864870994366436, 0.028763203914594197, 0.368870521125174, -0.27246360500899014, -0.3035728056373865, 0.12595142938040627, -0.23850857857273433, -0.17452274094925735, 0.21885241522253807, -0.06829967093166374, 0.11857117299467121, 0.08857118963446475, -0.06184346085238753, -0.07263230062175191, -0.17338352068936871, 0.22713429758786005, 0.08661058705534143, 0.28832673640429235, 0.05998390400050822, 0.08103148999602013, -0.007079538167576204, -0.005295357647405557, 0.03514104789483766, -0.14531413405069762, 0.13139906885615593, 0.2758968776743036, 0.07248736125616971, 0.23290723810918357, -0.5306137903491084, -0.24393122734901793, 0.03766440588332401, 0.08886757357389159, 0.10060819754796346, -0.018097832896478514, -0.23680124514009707, 0.0636286574759623, -0.16266501314830795, -0.14118233005789288, -0.09992420388609952, 0.05958406291707024, 0.022477747525663862, -0.24290256064229143, 0.1297680475110315, 0.04943361754787608, 0.13980165254461052, -0.16050450413680456, -0.10153016225917567, -0.02836265334072011, 0.10239979506748197, 0.05148120864272527, -0.016446372301498164, 0.17654627259925534, -0.1369285767261641, -0.04027280218762721, 0.4194122795234995, -0.010052821481007966, -0.16193507347958094, 0.23748943810619375, -0.1409809690368659, -0.11336474337844246, 0.15466552174708645, 0.24342623141750264, 0.08012325741857758, -0.14454268473316306, 0.042700833468807674, 0.05976636365119426, 0.14123707150318782, 0.08990150595605569, -0.05402644002975906, 0.2297042725761348, 0.2251036904791263, 0.0029101829856380585, 0.10945386616805695, -0.15809606376204016, -0.06801804946857402, -0.27599046483187306, -0.13245372261987032, -0.14280800791018453, 0.00588278674778982, -0.126864149940614, -0.22516910750808986, 0.37221093852553244, 0.15543476719572574, 0.12739198492457163, 0.023728934376310382, 0.2819143768432867, 0.027715489224418608, 0.06221693555010161, 0.05710756533940113, 0.27365785711676527, 0.13984940116322986, 0.09695342331344545, -0.21306070388740914, 0.07348401400050958, 0.025516326005292658] |
1,802.08932 | Auxiliary field diffusion Monte Carlo calculations of light and
medium-mass nuclei with local chiral interactions | Quantum Monte Carlo methods have recently been employed to study properties
of nuclei and infinite matter using local chiral effective field theory
interactions. In this work, we present a detailed description of the auxiliary
field diffusion Monte Carlo algorithm for nuclei in combination with local
chiral two- and three-nucleon interactions up to next-to-next-to-leading order.
We show results for the binding energy, charge radius, charge form factor, and
Coulomb sum rule in nuclei with $3\le A\le16$. Particular attention is devoted
to the effect of different operator structures in the three-body force for
different cutoffs. The outcomes suggest that local chiral interactions fit to
few-body observables give a very good description of the ground-state
properties of nuclei up to $^{16}$O, with the exception of one fit for the
softer cutoff which predicts overbinding in larger nuclei.
| nucl-th | quantum monte carlo methods have recently been employed to study properties of nuclei and infinite matter using local chiral effective field theory interactions in this work we present a detailed description of the auxiliary field diffusion monte carlo algorithm for nuclei in combination with local chiral two and threenucleon interactions up to nexttonexttoleading order we show results for the binding energy charge radius charge form factor and coulomb sum rule in nuclei with 3le ale16 particular attention is devoted to the effect of different operator structures in the threebody force for different cutoffs the outcomes suggest that local chiral interactions fit to fewbody observables give a very good description of the groundstate properties of nuclei up to 16o with the exception of one fit for the softer cutoff which predicts overbinding in larger nuclei | [['quantum', 'monte', 'carlo', 'methods', 'have', 'recently', 'been', 'employed', 'to', 'study', 'properties', 'of', 'nuclei', 'and', 'infinite', 'matter', 'using', 'local', 'chiral', 'effective', 'field', 'theory', 'interactions', 'in', 'this', 'work', 'we', 'present', 'a', 'detailed', 'description', 'of', 'the', 'auxiliary', 'field', 'diffusion', 'monte', 'carlo', 'algorithm', 'for', 'nuclei', 'in', 'combination', 'with', 'local', 'chiral', 'two', 'and', 'threenucleon', 'interactions', 'up', 'to', 'nexttonexttoleading', 'order', 'we', 'show', 'results', 'for', 'the', 'binding', 'energy', 'charge', 'radius', 'charge', 'form', 'factor', 'and', 'coulomb', 'sum', 'rule', 'in', 'nuclei', 'with', '3le', 'ale16', 'particular', 'attention', 'is', 'devoted', 'to', 'the', 'effect', 'of', 'different', 'operator', 'structures', 'in', 'the', 'threebody', 'force', 'for', 'different', 'cutoffs', 'the', 'outcomes', 'suggest', 'that', 'local', 'chiral', 'interactions', 'fit', 'to', 'fewbody', 'observables', 'give', 'a', 'very', 'good', 'description', 'of', 'the', 'groundstate', 'properties', 'of', 'nuclei', 'up', 'to', '16o', 'with', 'the', 'exception', 'of', 'one', 'fit', 'for', 'the', 'softer', 'cutoff', 'which', 'predicts', 'overbinding', 'in', 'larger', 'nuclei']] | [-0.05912862162856749, 0.14973630749487452, -0.11154677530118663, 0.12763860356587833, -0.018702290404265874, -0.10710370593487208, 0.010866252249421874, 0.39475901280634834, -0.194405296127683, -0.3222821419831713, -0.060120560800397585, -0.31000376559962006, -0.0715254644865058, 0.11921081065963533, 0.08151142643694591, 0.055860212765970176, 0.03510978805335393, 0.029596168006931368, -0.0953553639425847, -0.20182604777374605, 0.3082739080694553, 0.09044648674964428, 0.2112285217648386, 0.09340217657023131, 0.04235785182817538, 0.045475206329116134, 0.014199424261941497, 0.004803024687545192, -0.17577391418067545, 0.1076794401497433, 0.23615416471279205, -0.02169619423785436, 0.2061808441828628, -0.45556317700451254, -0.2080601680624698, 0.11342754139375866, 0.1586301364556053, 0.1706967474428825, -0.0817285971348419, -0.25156756934422747, 0.02654675470404257, -0.25001612652961475, -0.18675685298622102, -0.1688629055143635, 0.020237584460064545, 0.044443957414828185, -0.281999981577011, 0.09113988561684412, 0.005010884711203775, 0.07091915977180452, -0.07136226223634654, -0.1661152881745221, 0.03465060755624471, 0.08196265707002547, 0.09144928221261703, 0.03768687850018417, 0.1436517694159726, -0.1478016220778927, -0.130675266675399, 0.3876751602760383, -0.013718808319286577, -0.1415829204873679, 0.15820649579251395, -0.1431597450930149, -0.17154745459013893, 0.17854274385013527, 0.1546914742601321, 0.12785654065822413, -0.16582885805405395, 0.09571584448773288, 0.0043805329281402594, 0.16848366764720699, 0.007126915093539353, 0.05597098709497237, 0.16357687310336677, 0.17073139536222512, 0.024732419091830014, 0.08343299661931071, -0.07237988433457519, -0.1728924915222521, -0.29951185347246273, -0.09016958884527221, -0.1535138348205001, 0.05824100206557073, -0.07688171090525348, -0.1455699436793706, 0.3602319882731426, 0.11850046743883898, 0.19783252767196163, 0.010013022012763509, 0.2731017326424949, 0.0779969892429566, 0.09427016175919234, 0.03894872284193236, 0.31230970081187, 0.18769259244567693, 0.015306419514371712, -0.283016933042458, -0.02029940134432531, 0.124513260368958] |
1,802.08933 | Circular support in random sorting networks | A sorting network is a shortest path from $12 \cdots n$ to $n \cdots 2 1$ in
the Cayley graph of the symmetric group generated by adjacent transpositions.
For a uniform random sorting network, we prove that in the global limit,
particle trajectories are supported on $\pi$-Lipschitz paths. We show that the
weak limit of the permutation matrix of a random sorting network at any fixed
time is supported within a particular ellipse. This is conjectured to be an
optimal bound on the support. We also show that in the global limit,
trajectories of particles that start within distance $\epsilon$ of the edge are
within $\sqrt{2\epsilon}$ of a sine curve in uniform norm.
| math.PR math.CO | a sorting network is a shortest path from 12 cdots n to n cdots 2 1 in the cayley graph of the symmetric group generated by adjacent transpositions for a uniform random sorting network we prove that in the global limit particle trajectories are supported on pilipschitz paths we show that the weak limit of the permutation matrix of a random sorting network at any fixed time is supported within a particular ellipse this is conjectured to be an optimal bound on the support we also show that in the global limit trajectories of particles that start within distance epsilon of the edge are within sqrt2epsilon of a sine curve in uniform norm | [['a', 'sorting', 'network', 'is', 'a', 'shortest', 'path', 'from', '12', 'cdots', 'n', 'to', 'n', 'cdots', '2', '1', 'in', 'the', 'cayley', 'graph', 'of', 'the', 'symmetric', 'group', 'generated', 'by', 'adjacent', 'transpositions', 'for', 'a', 'uniform', 'random', 'sorting', 'network', 'we', 'prove', 'that', 'in', 'the', 'global', 'limit', 'particle', 'trajectories', 'are', 'supported', 'on', 'pilipschitz', 'paths', 'we', 'show', 'that', 'the', 'weak', 'limit', 'of', 'the', 'permutation', 'matrix', 'of', 'a', 'random', 'sorting', 'network', 'at', 'any', 'fixed', 'time', 'is', 'supported', 'within', 'a', 'particular', 'ellipse', 'this', 'is', 'conjectured', 'to', 'be', 'an', 'optimal', 'bound', 'on', 'the', 'support', 'we', 'also', 'show', 'that', 'in', 'the', 'global', 'limit', 'trajectories', 'of', 'particles', 'that', 'start', 'within', 'distance', 'epsilon', 'of', 'the', 'edge', 'are', 'within', 'sqrt2epsilon', 'of', 'a', 'sine', 'curve', 'in', 'uniform', 'norm']] | [-0.18342698609607444, 0.17710722890078942, -0.08033117578760302, 0.02369605140080927, 0.00030443887645798223, -0.09858162591217069, 0.08309994614473334, 0.40412699155979326, -0.29938924953609974, -0.2213068870231845, 0.09773411791821993, -0.28816766946299655, -0.14739534915382932, 0.14720045123773687, -0.05553441394439286, 0.04868237323102516, 0.08272956685909817, 0.10826341932857628, -0.03215756122996141, -0.23347833632362527, 0.27770730235456825, -0.02270384786465952, 0.229014984902565, 0.0015917298995453428, 0.09380963149371448, 0.016433038748800755, 0.012528196749117997, 0.034386644581425097, -0.11837156451027211, 0.0909371015695469, 0.17918642282251035, 0.12598386707061246, 0.23708770527747702, -0.43296551980447395, -0.16164726784100403, 0.16257751841299437, 0.1772057050251746, 0.06426929064128581, -0.016289907704770297, -0.24525913519382075, 0.1735767366213573, -0.10995307442237127, -0.1310582743110219, 0.020960537144108803, 0.10132307343621243, 0.06027420870288535, -0.3271604030653163, 0.021643856135228446, 0.10187383355186866, 0.0272803299636622, 0.007857353199978132, -0.1145801672728749, -0.007622256560402142, 0.12657553679309785, -0.0044133820222808165, 0.07817689672968275, 0.09472455371691434, -0.08649544598039675, -0.14508199023905102, 0.3575012870132923, -0.07518289572567688, -0.22200061218930525, 0.08750738832902431, -0.14117735706118717, -0.14932242143681054, 0.12562204799656798, 0.14726333272316167, 0.13658408892366128, -0.10719069647225174, 0.12529677364908093, -0.13482030108990567, 0.15906843964140527, 0.11614762399941347, -0.018081848400535883, 0.15636213412195044, 0.15604308380762133, 0.159657244247527, 0.1388553704527366, -0.06489010886519912, -0.08555469763473617, -0.3276138701014691, -0.14581208263140022, -0.2689680159511464, 0.08372829251226273, -0.17875269612901518, -0.1714930860409597, 0.3608449794486299, 0.10914372913707215, 0.2297341034051266, 0.13804241997265332, 0.2231208997703082, 0.09323658345283957, 0.028121325825047387, 0.15056530627430426, 0.168474658342028, 0.108352795278922, -0.016809217086447788, -0.15765058058985248, 0.03192606003040464, 0.12963359107406022] |
1,802.08934 | The Archimedean limit of random sorting networks | A sorting network (also known as a reduced decomposition of the reverse
permutation), is a shortest path from $12 \cdots n$ to $n \cdots 21$ in the
Cayley graph of the symmetric group $S_n$ generated by adjacent transpositions.
We prove that in a uniform random $n$-element sorting network $\sigma^n$, all
particle trajectories are close to sine curves with high probability. We also
find the weak limit of the time-$t$ permutation matrix measures of $\sigma^n$.
As a corollary of these results, we show that if $S_n$ is embedded into
$\mathbb{R}^n$ via the map $\tau \mapsto (\tau(1), \tau(2), \dots \tau(n))$,
then with high probability, the path $\sigma^n$ is close to a great circle on a
particular $(n-2)$-dimensional sphere in $\mathbb{R}^n$. These results prove
conjectures of Angel, Holroyd, Romik, and Virag.
| math.PR math.CO | a sorting network also known as a reduced decomposition of the reverse permutation is a shortest path from 12 cdots n to n cdots 21 in the cayley graph of the symmetric group s_n generated by adjacent transpositions we prove that in a uniform random nelement sorting network sigman all particle trajectories are close to sine curves with high probability we also find the weak limit of the timet permutation matrix measures of sigman as a corollary of these results we show that if s_n is embedded into mathbbrn via the map tau mapsto tau1 tau2 dots taun then with high probability the path sigman is close to a great circle on a particular n2dimensional sphere in mathbbrn these results prove conjectures of angel holroyd romik and virag | [['a', 'sorting', 'network', 'also', 'known', 'as', 'a', 'reduced', 'decomposition', 'of', 'the', 'reverse', 'permutation', 'is', 'a', 'shortest', 'path', 'from', '12', 'cdots', 'n', 'to', 'n', 'cdots', '21', 'in', 'the', 'cayley', 'graph', 'of', 'the', 'symmetric', 'group', 's_n', 'generated', 'by', 'adjacent', 'transpositions', 'we', 'prove', 'that', 'in', 'a', 'uniform', 'random', 'nelement', 'sorting', 'network', 'sigman', 'all', 'particle', 'trajectories', 'are', 'close', 'to', 'sine', 'curves', 'with', 'high', 'probability', 'we', 'also', 'find', 'the', 'weak', 'limit', 'of', 'the', 'timet', 'permutation', 'matrix', 'measures', 'of', 'sigman', 'as', 'a', 'corollary', 'of', 'these', 'results', 'we', 'show', 'that', 'if', 's_n', 'is', 'embedded', 'into', 'mathbbrn', 'via', 'the', 'map', 'tau', 'mapsto', 'tau1', 'tau2', 'dots', 'taun', 'then', 'with', 'high', 'probability', 'the', 'path', 'sigman', 'is', 'close', 'to', 'a', 'great', 'circle', 'on', 'a', 'particular', 'n2dimensional', 'sphere', 'in', 'mathbbrn', 'these', 'results', 'prove', 'conjectures', 'of', 'angel', 'holroyd', 'romik', 'and', 'virag']] | [-0.16297474961174885, 0.17537793007068103, -0.05150660678191343, 0.04029966388679895, -0.02268649595862371, -0.14818695496069267, 0.05879553688282613, 0.3769738980336115, -0.3101036453372217, -0.19785837875497236, 0.08612700920639327, -0.3455673159623984, -0.17224282121605938, 0.15646997710700816, -0.09214675781549886, 0.06207140689366497, 0.06923588889912935, 0.0984118381384178, -0.06022459701944172, -0.25120094703493123, 0.2606139963172609, -0.06312384917873715, 0.2150917929247953, 0.029914858293977886, 0.0998390759632457, 0.00883783831159235, 0.0020515901196631603, -0.0063099027138378005, -0.18511582501798785, 0.05520122282905504, 0.20287692846613936, 0.12167586442956235, 0.21430292147670116, -0.3779264864970173, -0.11404601283174998, 0.20999006580404966, 0.19537524134113937, -0.01427481491373328, -0.006817992792093719, -0.28511520120082423, 0.1555784106894862, -0.11114315212034853, -0.13029931424898678, 0.02118292680643208, 0.11514791934678215, 0.06727572980162222, -0.31230256048729643, 0.010925703146767773, 0.11742067050727201, 0.011796262191637652, 0.05171786067876383, -0.17655774982995354, -0.037641740793333156, 0.09762548795515613, 0.008747147034227964, 0.12116934827281511, 0.07308664436641266, -0.04928635817122995, -0.13893243174243253, 0.3574973229551688, -0.07103420107523561, -0.22480974566133227, 0.06790344277942495, -0.19952453391670133, -0.1773093072588381, 0.11042981856007827, 0.11306051673454931, 0.1428862486172875, -0.06639067911783059, 0.13895612490841813, -0.16409254189784406, 0.11413166257170815, 0.1581265784916468, -0.018648190023668576, 0.12857924072488913, 0.08765816468257981, 0.12511282175182714, 0.17505344816618162, -0.04852587207824399, -0.02944293824293709, -0.30294173666334245, -0.1708282298695849, -0.2387251662885319, 0.16988171550474362, -0.20514656240618478, -0.16253059967857553, 0.30418233340606093, 0.06838100086315535, 0.22103532251321667, 0.16002144716185285, 0.1941715904395096, 0.08358536969717534, 0.0009937489739968441, 0.09956947445243713, 0.05642579442792339, 0.19471027195140778, -0.03923685209520045, -0.1522565813629626, -0.014952278203054448, 0.16598950822663028] |
1,802.08935 | Identifying the occurrence or non occurrence of cognitive bias in
situations resembling the Monty Hall problem | People reason heuristically in situations resembling inferential puzzles such
as Bertrand's box paradox and the Monty Hall problem. The practical
significance of that fact for economic decision making is uncertain because a
departure from sound reasoning may, but does not necessarily, result in a
"cognitively biased" outcome different from what sound reasoning would have
produced. Criteria are derived here, applicable to both experimental and
non-experimental situations, for heuristic reasoning in an inferential-puzzle
situations to result, or not to result, in cognitively bias. In some
situations, neither of these criteria is satisfied, and whether or not agents'
posterior probability assessments or choices are cognitively biased cannot be
determined.
| econ.EM | people reason heuristically in situations resembling inferential puzzles such as bertrands box paradox and the monty hall problem the practical significance of that fact for economic decision making is uncertain because a departure from sound reasoning may but does not necessarily result in a cognitively biased outcome different from what sound reasoning would have produced criteria are derived here applicable to both experimental and nonexperimental situations for heuristic reasoning in an inferentialpuzzle situations to result or not to result in cognitively bias in some situations neither of these criteria is satisfied and whether or not agents posterior probability assessments or choices are cognitively biased cannot be determined | [['people', 'reason', 'heuristically', 'in', 'situations', 'resembling', 'inferential', 'puzzles', 'such', 'as', 'bertrands', 'box', 'paradox', 'and', 'the', 'monty', 'hall', 'problem', 'the', 'practical', 'significance', 'of', 'that', 'fact', 'for', 'economic', 'decision', 'making', 'is', 'uncertain', 'because', 'a', 'departure', 'from', 'sound', 'reasoning', 'may', 'but', 'does', 'not', 'necessarily', 'result', 'in', 'a', 'cognitively', 'biased', 'outcome', 'different', 'from', 'what', 'sound', 'reasoning', 'would', 'have', 'produced', 'criteria', 'are', 'derived', 'here', 'applicable', 'to', 'both', 'experimental', 'and', 'nonexperimental', 'situations', 'for', 'heuristic', 'reasoning', 'in', 'an', 'inferentialpuzzle', 'situations', 'to', 'result', 'or', 'not', 'to', 'result', 'in', 'cognitively', 'bias', 'in', 'some', 'situations', 'neither', 'of', 'these', 'criteria', 'is', 'satisfied', 'and', 'whether', 'or', 'not', 'agents', 'posterior', 'probability', 'assessments', 'or', 'choices', 'are', 'cognitively', 'biased', 'can', 'not', 'be', 'determined']] | [-0.059495304830842345, 0.09984505848176277, -0.13631162551344833, 0.15812373621972434, -0.20239532759813506, -0.2261264228836468, 0.08996296857666468, 0.4062936996571093, -0.2462034083154296, -0.32940459748399314, 0.09991319010917654, -0.23353931104555448, -0.14439763808753517, 0.21023212835218794, -0.20393868369511634, 0.026467430936259643, 0.06039057249229436, 0.04179684438298796, 0.0012169454157543935, -0.2536974663402293, 0.2793694978545063, 0.018471862720412627, 0.2715203893962795, 0.05904462776434059, 0.04914329748679057, -0.018117585502321197, -0.003593449554815192, 0.09843138754955345, -0.0804270628895355, 0.03615787617805649, 0.38529876809323504, 0.2356259091887797, 0.3377553766993719, -0.4224289457757618, -0.1892090227071927, 0.13710775595837246, 0.1665480641526318, 0.13344214164225437, 0.014421941987761061, -0.29607372734451964, 0.0597508886587484, -0.1659066115558217, -0.11558374734900057, -0.08779818078102632, -0.005703796116878914, -0.045607684393387256, -0.29246219419047376, 0.09380935367292542, 0.12531046561785825, 0.07558874478650705, -0.022566045223186924, -0.11156521620507413, 0.031173743081287803, 0.1104468320880986, 0.08813382808345362, -0.04186638463375585, 0.17547113801761766, -0.19196832131281077, -0.17188980712372565, 0.411947647927799, 0.08110382467090527, -0.2674115545420459, 0.22746416304269196, -0.11864552811380023, -0.15096212581026358, 0.05907533442270811, 0.10174498301996006, 0.09937547784403106, -0.1765338779072425, -0.020007860073797998, -0.045965627111085455, 0.16645550022824346, 0.09271388762917752, 0.006782196105292467, 0.24099238941045564, 0.0782853793570441, 0.049238747423166564, 0.00977585818422697, 0.02790563541386172, -0.13139533989183674, -0.2970860669929012, -0.0854168717540522, -0.17450975426081045, 0.07683590444326553, -0.04129187813940976, -0.18094808707518556, 0.26218755170702934, 0.23708046380991865, 0.16122588085306583, 0.05583437022135079, 0.28386432415518525, 0.10195487077352286, 0.014718147050673643, 0.043948932180929684, 0.21209826675394908, 0.038719935107662855, 0.07255640774791207, -0.10098362982786635, 0.22967124538426506, -0.0170837765576962] |
1,802.08936 | A Dataset To Evaluate The Representations Learned By Video Prediction
Models | We present a parameterized synthetic dataset called Moving Symbols to support
the objective study of video prediction networks. Using several instantiations
of the dataset in which variation is explicitly controlled, we highlight issues
in an existing state-of-the-art approach and propose the use of a performance
metric with greater semantic meaning to improve experimental interpretability.
Our dataset provides canonical test cases that will help the community better
understand, and eventually improve, the representations learned by such
networks in the future. Code is available at
https://github.com/rszeto/moving-symbols .
| cs.CV | we present a parameterized synthetic dataset called moving symbols to support the objective study of video prediction networks using several instantiations of the dataset in which variation is explicitly controlled we highlight issues in an existing stateoftheart approach and propose the use of a performance metric with greater semantic meaning to improve experimental interpretability our dataset provides canonical test cases that will help the community better understand and eventually improve the representations learned by such networks in the future code is available at httpsgithubcomrszetomovingsymbols | [['we', 'present', 'a', 'parameterized', 'synthetic', 'dataset', 'called', 'moving', 'symbols', 'to', 'support', 'the', 'objective', 'study', 'of', 'video', 'prediction', 'networks', 'using', 'several', 'instantiations', 'of', 'the', 'dataset', 'in', 'which', 'variation', 'is', 'explicitly', 'controlled', 'we', 'highlight', 'issues', 'in', 'an', 'existing', 'stateoftheart', 'approach', 'and', 'propose', 'the', 'use', 'of', 'a', 'performance', 'metric', 'with', 'greater', 'semantic', 'meaning', 'to', 'improve', 'experimental', 'interpretability', 'our', 'dataset', 'provides', 'canonical', 'test', 'cases', 'that', 'will', 'help', 'the', 'community', 'better', 'understand', 'and', 'eventually', 'improve', 'the', 'representations', 'learned', 'by', 'such', 'networks', 'in', 'the', 'future', 'code', 'is', 'available', 'at', 'httpsgithubcomrszetomovingsymbols']] | [-0.056568467086293255, -0.021431510814806414, -0.06409171023630504, 0.09369097994247744, -0.12757728532719684, -0.134710236766701, 0.0378104433938384, 0.4341454450714301, -0.26148523542334334, -0.33988986130248394, 0.07037280553093472, -0.2886198774339205, -0.179613415858742, 0.2039218614640904, -0.14296679974657045, 0.0673396199582571, 0.15877913363300353, 0.06902920690376356, -0.07492213192990566, -0.3075516400073307, 0.3330433331065284, 0.11378357032067087, 0.32588074296847525, 0.07156510177595787, 0.09239794191461147, -0.06372693648242043, -0.06278037798804152, 0.004436041032263402, -0.09739265018936978, 0.1934561369707808, 0.3011982610914856, 0.2465929063990802, 0.3124556636622916, -0.4051756929628641, -0.24322246201336384, 0.09127237499657884, 0.1448158008012786, 0.08327316865745753, -0.019570594845642615, -0.3351520692862301, 0.09718116932932191, -0.1789506222514144, -0.04878017745059298, -0.16633087559322635, -0.0460299796660442, -0.0082054754806099, -0.27407144070659056, -0.0021591512149715998, 0.03894968012190727, 0.06864222311919713, -0.05039456385434661, -0.11504007663286056, 0.03574274698867047, 0.1971065461837563, 0.018039588210543234, 0.07859126180242074, 0.10829571336058967, -0.15544149633609208, -0.17090511696303756, 0.3781872950045459, -0.0851658363321639, -0.2387113126376307, 0.18594509035528425, -0.05040915459057832, -0.13305552423853112, 0.05783620116536517, 0.23988954983202807, 0.0976423204438873, -0.14588782553145863, 0.0027308732100077963, -0.04997668952221073, 0.18171327802807047, 0.015966562127851577, 0.0076547475441931245, 0.17638572956525148, 0.2787906817239092, 0.007628944471018411, 0.18205401721040168, -0.08856075703648918, -0.04559243764414127, -0.23374886666031847, -0.12663410846368375, -0.15616552875915835, -0.058012862442936526, -0.11559546332075597, -0.10745118481544666, 0.4311224103692066, 0.29220777780311297, 0.1900904196572591, 0.11742994153215718, 0.3312095444065979, -0.010089807396092597, 0.08671725736594343, 0.08310801922960813, 0.1790129716665181, 0.001404189782396677, 0.11204138735354126, -0.18237278429813772, 0.07894077948126269, 0.02739157504121582] |
1,802.08937 | Detecting Comma-shaped Clouds for Severe Weather Forecasting using Shape
and Motion | Meteorologists use shapes and movements of clouds in satellite images as
indicators of several major types of severe storms. Satellite imaginary data
are in increasingly higher resolution, both spatially and temporally, making it
impossible for humans to fully leverage the data in their forecast. Automatic
satellite imagery analysis methods that can find storm-related cloud patterns
as soon as they are detectable are in demand. We propose a machine learning and
pattern recognition based approach to detect "comma-shaped" clouds in satellite
images, which are specific cloud distribution patterns strongly associated with
the cyclone formulation. In order to detect regions with the targeted movement
patterns, our method is trained on manually annotated cloud examples
represented by both shape and motion-sensitive features. Sliding windows in
different scales are used to ensure that dense clouds will be captured, and we
implement effective selection rules to shrink the region of interest among
these sliding windows. Finally, we evaluate the method on a hold-out annotated
comma-shaped cloud dataset and cross-match the results with recorded storm
events in the severe weather database. The validated utility and accuracy of
our method suggest a high potential for assisting meteorologists in weather
forecasting.
| cs.CV | meteorologists use shapes and movements of clouds in satellite images as indicators of several major types of severe storms satellite imaginary data are in increasingly higher resolution both spatially and temporally making it impossible for humans to fully leverage the data in their forecast automatic satellite imagery analysis methods that can find stormrelated cloud patterns as soon as they are detectable are in demand we propose a machine learning and pattern recognition based approach to detect commashaped clouds in satellite images which are specific cloud distribution patterns strongly associated with the cyclone formulation in order to detect regions with the targeted movement patterns our method is trained on manually annotated cloud examples represented by both shape and motionsensitive features sliding windows in different scales are used to ensure that dense clouds will be captured and we implement effective selection rules to shrink the region of interest among these sliding windows finally we evaluate the method on a holdout annotated commashaped cloud dataset and crossmatch the results with recorded storm events in the severe weather database the validated utility and accuracy of our method suggest a high potential for assisting meteorologists in weather forecasting | [['meteorologists', 'use', 'shapes', 'and', 'movements', 'of', 'clouds', 'in', 'satellite', 'images', 'as', 'indicators', 'of', 'several', 'major', 'types', 'of', 'severe', 'storms', 'satellite', 'imaginary', 'data', 'are', 'in', 'increasingly', 'higher', 'resolution', 'both', 'spatially', 'and', 'temporally', 'making', 'it', 'impossible', 'for', 'humans', 'to', 'fully', 'leverage', 'the', 'data', 'in', 'their', 'forecast', 'automatic', 'satellite', 'imagery', 'analysis', 'methods', 'that', 'can', 'find', 'stormrelated', 'cloud', 'patterns', 'as', 'soon', 'as', 'they', 'are', 'detectable', 'are', 'in', 'demand', 'we', 'propose', 'a', 'machine', 'learning', 'and', 'pattern', 'recognition', 'based', 'approach', 'to', 'detect', 'commashaped', 'clouds', 'in', 'satellite', 'images', 'which', 'are', 'specific', 'cloud', 'distribution', 'patterns', 'strongly', 'associated', 'with', 'the', 'cyclone', 'formulation', 'in', 'order', 'to', 'detect', 'regions', 'with', 'the', 'targeted', 'movement', 'patterns', 'our', 'method', 'is', 'trained', 'on', 'manually', 'annotated', 'cloud', 'examples', 'represented', 'by', 'both', 'shape', 'and', 'motionsensitive', 'features', 'sliding', 'windows', 'in', 'different', 'scales', 'are', 'used', 'to', 'ensure', 'that', 'dense', 'clouds', 'will', 'be', 'captured', 'and', 'we', 'implement', 'effective', 'selection', 'rules', 'to', 'shrink', 'the', 'region', 'of', 'interest', 'among', 'these', 'sliding', 'windows', 'finally', 'we', 'evaluate', 'the', 'method', 'on', 'a', 'holdout', 'annotated', 'commashaped', 'cloud', 'dataset', 'and', 'crossmatch', 'the', 'results', 'with', 'recorded', 'storm', 'events', 'in', 'the', 'severe', 'weather', 'database', 'the', 'validated', 'utility', 'and', 'accuracy', 'of', 'our', 'method', 'suggest', 'a', 'high', 'potential', 'for', 'assisting', 'meteorologists', 'in', 'weather', 'forecasting']] | [-0.087273023393266, 0.06600004378145473, -0.07974488829129683, 0.11309166539872445, -0.07724806319688159, -0.10915128501492957, 0.04393519189072217, 0.4636898765685427, -0.235745754409874, -0.37079058669468495, 0.1407895442494557, -0.2999951855952398, -0.15331710994497175, 0.22055890392609603, -0.1288466099846233, 0.05781471879948028, 0.1147261359759348, -0.006873882614583245, 0.012208058595710985, -0.2590382196428498, 0.2614998173734163, 0.06636415678442148, 0.3095676981215, 0.008095050103845397, 0.06787320569947518, -0.07460369968650307, -0.09795151523275408, 0.012199458524740803, -0.04711206087085884, 0.1357384787918756, 0.3093195806759658, 0.18540157386496742, 0.26274207936531585, -0.4477023937500506, -0.2277315595028471, 0.0744231907743473, 0.1406753548434375, 0.05731996855057327, -0.03583343187712757, -0.36151695507944254, 0.09013323734742369, -0.1712253372038956, -0.08134231364588541, -0.12026954510340471, 0.021639097002895638, 0.03980391807561613, -0.2659078207310699, 0.05784422173990663, -0.02448226811354541, 0.12247038743804886, -0.08542254518385957, -0.0475163053525691, -0.030475937195517812, 0.1742348571732172, 0.0361824081752008, 0.014060271426021117, 0.17560982689534493, -0.16059108333195424, -0.08978937754038166, 0.41003331336246424, -0.03920214441306255, -0.14903460784342276, 0.23564991101632335, -0.10246969979617218, -0.14527678755794637, 0.12064118558511684, 0.24313345757259436, 0.09869974270750675, -0.15773895294624943, -0.05650222695558161, -0.008885168683159297, 0.1716675201738107, 0.07176794157959569, -0.010120991622317211, 0.23973022574980632, 0.17173680653112955, 0.05011882906882044, 0.11888598654655672, -0.2042557428915819, -0.08083651051978478, -0.20855057333152333, -0.07197906066424638, -0.1526880798378657, -0.08596674726327579, -0.09183592855369889, -0.14707625129854998, 0.34165879907037733, 0.23180743433537843, 0.21195988783247754, 0.04015412346608644, 0.339106179412981, 0.030617217353181864, 0.13749932477382348, 0.06980742919575715, 0.1621884152540664, -0.0264834822411527, 0.1419454550087764, -0.15732456307434015, 0.08825779687710769, 0.012511763419847477] |
1,802.08938 | DID: Distributed Incremental Block Coordinate Descent for Nonnegative
Matrix Factorization | Nonnegative matrix factorization (NMF) has attracted much attention in the
last decade as a dimension reduction method in many applications. Due to the
explosion in the size of data, naturally the samples are collected and stored
distributively in local computational nodes. Thus, there is a growing need to
develop algorithms in a distributed memory architecture. We propose a novel
distributed algorithm, called \textit{distributed incremental block coordinate
descent} (DID), to solve the problem. By adapting the block coordinate descent
framework, closed-form update rules are obtained in DID. Moreover, DID performs
updates incrementally based on the most recently updated residual matrix. As a
result, only one communication step per iteration is required. The correctness,
efficiency, and scalability of the proposed algorithm are verified in a series
of numerical experiments.
| cs.LG cs.AI math.OC stat.ML | nonnegative matrix factorization nmf has attracted much attention in the last decade as a dimension reduction method in many applications due to the explosion in the size of data naturally the samples are collected and stored distributively in local computational nodes thus there is a growing need to develop algorithms in a distributed memory architecture we propose a novel distributed algorithm called textitdistributed incremental block coordinate descent did to solve the problem by adapting the block coordinate descent framework closedform update rules are obtained in did moreover did performs updates incrementally based on the most recently updated residual matrix as a result only one communication step per iteration is required the correctness efficiency and scalability of the proposed algorithm are verified in a series of numerical experiments | [['nonnegative', 'matrix', 'factorization', 'nmf', 'has', 'attracted', 'much', 'attention', 'in', 'the', 'last', 'decade', 'as', 'a', 'dimension', 'reduction', 'method', 'in', 'many', 'applications', 'due', 'to', 'the', 'explosion', 'in', 'the', 'size', 'of', 'data', 'naturally', 'the', 'samples', 'are', 'collected', 'and', 'stored', 'distributively', 'in', 'local', 'computational', 'nodes', 'thus', 'there', 'is', 'a', 'growing', 'need', 'to', 'develop', 'algorithms', 'in', 'a', 'distributed', 'memory', 'architecture', 'we', 'propose', 'a', 'novel', 'distributed', 'algorithm', 'called', 'textitdistributed', 'incremental', 'block', 'coordinate', 'descent', 'did', 'to', 'solve', 'the', 'problem', 'by', 'adapting', 'the', 'block', 'coordinate', 'descent', 'framework', 'closedform', 'update', 'rules', 'are', 'obtained', 'in', 'did', 'moreover', 'did', 'performs', 'updates', 'incrementally', 'based', 'on', 'the', 'most', 'recently', 'updated', 'residual', 'matrix', 'as', 'a', 'result', 'only', 'one', 'communication', 'step', 'per', 'iteration', 'is', 'required', 'the', 'correctness', 'efficiency', 'and', 'scalability', 'of', 'the', 'proposed', 'algorithm', 'are', 'verified', 'in', 'a', 'series', 'of', 'numerical', 'experiments']] | [-0.11869078686490185, 0.011208347299715548, -0.08139981553105154, 0.018769856144520123, -0.11350099685213227, -0.19324318924552109, 0.058112215228730765, 0.4229783970955668, -0.30166934967118014, -0.3079327857048493, 0.13384540264648714, -0.23964943773457853, -0.16302186317052544, 0.14623938392349115, -0.12004698122169559, 0.11721086540666416, 0.11658361580728839, 0.061281655297713636, -0.09251804346783365, -0.3277832320597991, 0.2078245740904524, 0.08589369367155444, 0.31086033554821035, -0.01690884356159629, 0.12520793549749473, 0.006980599384520232, -0.0635661022759622, 0.015142018205530237, -0.020611031705102936, 0.15059236250176117, 0.2917379916454922, 0.22518789829634953, 0.36640548158077685, -0.4718841839963057, -0.1795793923395356, 0.111982849993061, 0.20966056489026336, 0.13558471402681366, -0.09281566717174256, -0.21808192121620312, 0.1174960583219246, -0.19342573877152672, -0.04972530392871246, -0.10215169338025445, -0.006500314642477223, 0.0030611362757425255, -0.2944600099081716, 0.031037684718850912, 0.031899012039474206, 0.01614431783146276, -0.014088894878550777, -0.14436312279055322, 0.05057482863298006, 0.07341583770072806, 0.03553339981613314, 0.024148070308431163, 0.12687360606060957, -0.051820641438528076, -0.1397966620050312, 0.35177183436141823, -0.009683551002792485, -0.18760797285518838, 0.12977571903240287, -0.008073109092088197, -0.19192083858642875, 0.1468814834017365, 0.22584616049677758, 0.13542263968444362, -0.15376522720564068, 0.10525232655139215, -0.04655095628704729, 0.16175962863196655, 0.03381794659002853, -0.0090994584469462, 0.09213783065458452, 0.19172407680477097, 0.11024986646334296, 0.13473204543858064, -0.06063284197506884, -0.12855287227508297, -0.2266950705858666, -0.13672248164089176, -0.25092081284502477, -0.025632186787290952, -0.0875443200043157, -0.12256402372727244, 0.3826509123800073, 0.16890630550227884, 0.2250399474482195, 0.0831017148768984, 0.3377900156449145, 0.07717709651942856, 0.1398474037354834, 0.14092596217725925, 0.1676989765306128, 0.11313307666821097, 0.17875107996327083, -0.18602221214586473, 0.12301197819646419, 0.13054317701607943] |
1,802.08939 | Constraining the Collective Radio Emission of Large Scale Accretion
Shocks | Accretion of gas onto already virialized structures like galaxy clusters
should give rise to accretion shocks which can potentially accelerate cosmic
rays. Here, we use the radio emission detected from Coma cluster and models of
evolution of cosmic accretion shocks, to constrain the possible contribution of
unresolved galaxy clusters to the cosmic radio background. We assume that Coma
is a typical galaxy cluster and that its entire radio emission is produced by
cosmic rays accelerated in accretion shocks, making our prediction an upper
limit. Our models predict that at lower frequencies accretion shocks can have a
potentially large contribution to the cosmic radio background, while on larger
frequencies, e.g. 5 GHz, their contribution must be lower than < 2-35%,
depending on the models of evolution of accretion shocks that we use.
| astro-ph.HE | accretion of gas onto already virialized structures like galaxy clusters should give rise to accretion shocks which can potentially accelerate cosmic rays here we use the radio emission detected from coma cluster and models of evolution of cosmic accretion shocks to constrain the possible contribution of unresolved galaxy clusters to the cosmic radio background we assume that coma is a typical galaxy cluster and that its entire radio emission is produced by cosmic rays accelerated in accretion shocks making our prediction an upper limit our models predict that at lower frequencies accretion shocks can have a potentially large contribution to the cosmic radio background while on larger frequencies eg 5 ghz their contribution must be lower than 235 depending on the models of evolution of accretion shocks that we use | [['accretion', 'of', 'gas', 'onto', 'already', 'virialized', 'structures', 'like', 'galaxy', 'clusters', 'should', 'give', 'rise', 'to', 'accretion', 'shocks', 'which', 'can', 'potentially', 'accelerate', 'cosmic', 'rays', 'here', 'we', 'use', 'the', 'radio', 'emission', 'detected', 'from', 'coma', 'cluster', 'and', 'models', 'of', 'evolution', 'of', 'cosmic', 'accretion', 'shocks', 'to', 'constrain', 'the', 'possible', 'contribution', 'of', 'unresolved', 'galaxy', 'clusters', 'to', 'the', 'cosmic', 'radio', 'background', 'we', 'assume', 'that', 'coma', 'is', 'a', 'typical', 'galaxy', 'cluster', 'and', 'that', 'its', 'entire', 'radio', 'emission', 'is', 'produced', 'by', 'cosmic', 'rays', 'accelerated', 'in', 'accretion', 'shocks', 'making', 'our', 'prediction', 'an', 'upper', 'limit', 'our', 'models', 'predict', 'that', 'at', 'lower', 'frequencies', 'accretion', 'shocks', 'can', 'have', 'a', 'potentially', 'large', 'contribution', 'to', 'the', 'cosmic', 'radio', 'background', 'while', 'on', 'larger', 'frequencies', 'eg', '5', 'ghz', 'their', 'contribution', 'must', 'be', 'lower', 'than', '235', 'depending', 'on', 'the', 'models', 'of', 'evolution', 'of', 'accretion', 'shocks', 'that', 'we', 'use']] | [-0.05997129925571454, 0.16459033631533831, -0.07789696680668455, 0.15222663699756733, -0.1451024886757995, -0.004617210026257313, 0.00019055622128339914, 0.42749346296231333, -0.21950511386116536, -0.3422369988921743, 0.0608871055722165, -0.27372216075085676, 0.02029557399308452, 0.2345980224127953, 0.04956665766926912, -0.09908174846831781, 0.04956545694014774, -0.10390692833954325, -0.0040496135206642345, -0.2679391932387192, 0.29715431239455936, 0.20300496561596026, 0.1781547505605536, 0.005617765573641429, 0.08211020098354381, -0.17690715733199167, -0.07996542246725696, -0.03422586165207366, -0.12049007099950149, 0.07340432685853626, 0.2188603337229254, 0.16930033890771135, 0.18709381120637633, -0.44085352541162415, -0.27990993682939846, 0.10381274020563488, 0.2509951584886249, 0.061540136175552526, -0.044005096626754565, -0.23856313940710747, 0.07437679889643242, -0.23137784210535195, -0.14508924320555078, 0.09946970181324734, 0.003979952690693048, 0.028004321215513092, -0.19129424014916788, 0.14069704414846806, 0.03832741084983214, -0.013347788701559274, -0.13356280305082552, -0.02943803231106498, -0.02907358700266251, 0.08005226601201754, 0.06072601079582595, 0.07303978552898535, 0.27146753872243257, -0.15014420795039488, -0.07753012330593685, 0.4284851300207755, -0.0955066992745672, -0.013432422516724237, 0.2783023434906052, -0.2538098183567994, -0.22834202252829877, 0.19311464723521987, 0.22555404897206105, 0.04942841811033969, -0.12696272110423215, 0.005133180445633255, 0.014404814153050002, 0.18849250079634097, 0.07796062194527342, 0.02059524320995059, 0.3634474002684538, 0.08061491610625615, 0.07149637062281657, 0.1147321507970516, -0.2011314606759697, 0.03967984594503203, -0.2261402673088014, -0.045495609593434405, -0.14981155324584017, 0.14243105910628892, -0.14138145941072322, -0.15311416680566392, 0.3123884334014012, 0.12816977491960502, 0.19074894554483202, 0.06274883264335446, 0.30677221563573065, 0.07451321325811128, 0.055334165176519984, 0.19945189437578217, 0.3244462062962926, 0.15807163377399913, 0.060823220607394785, -0.20629096585325896, 0.09884940538770304, -0.02229084577053212] |
1,802.0894 | M\"ossbauer spectroscopy study of magnetic fluctuations in
superconducting RbGd$_2$Fe$_4$As$_4$O$_2$ | $^{57}$Fe M\"ossbauer spectra were measured at different temperatures between
5.9 K and 300 K on the recently discovered self-doped superconducting
RbGd$_2$Fe$_4$As$_4$O$_2$ with T$_c$ as high as 35 K. Singlet pattern was
observed down to the lowest temperature measured in this work, indicating the
absence of static magnetic order on the Fe site. The intermediate isomer shift
in comparison with that of the samples RbFe$_2$As$_2$ and GdFeAsO confirms the
self doping induced local electronic structure change. Surprisingly, we observe
two magnetic fluctuation induced spectral broadenings below $\sim$15 K and
$\sim$100 K which are believed to be originated from the transferred magnetic
fluctuations of the Gd$^{3+}$ moments and that of the magnetic fluctuations of
the Fe atoms, respectively.
| cond-mat.supr-con cond-mat.str-el | 57fe mossbauer spectra were measured at different temperatures between 59 k and 300 k on the recently discovered selfdoped superconducting rbgd_2fe_4as_4o_2 with t_c as high as 35 k singlet pattern was observed down to the lowest temperature measured in this work indicating the absence of static magnetic order on the fe site the intermediate isomer shift in comparison with that of the samples rbfe_2as_2 and gdfeaso confirms the self doping induced local electronic structure change surprisingly we observe two magnetic fluctuation induced spectral broadenings below sim15 k and sim100 k which are believed to be originated from the transferred magnetic fluctuations of the gd3 moments and that of the magnetic fluctuations of the fe atoms respectively | [['57fe', 'mossbauer', 'spectra', 'were', 'measured', 'at', 'different', 'temperatures', 'between', '59', 'k', 'and', '300', 'k', 'on', 'the', 'recently', 'discovered', 'selfdoped', 'superconducting', 'rbgd_2fe_4as_4o_2', 'with', 't_c', 'as', 'high', 'as', '35', 'k', 'singlet', 'pattern', 'was', 'observed', 'down', 'to', 'the', 'lowest', 'temperature', 'measured', 'in', 'this', 'work', 'indicating', 'the', 'absence', 'of', 'static', 'magnetic', 'order', 'on', 'the', 'fe', 'site', 'the', 'intermediate', 'isomer', 'shift', 'in', 'comparison', 'with', 'that', 'of', 'the', 'samples', 'rbfe_2as_2', 'and', 'gdfeaso', 'confirms', 'the', 'self', 'doping', 'induced', 'local', 'electronic', 'structure', 'change', 'surprisingly', 'we', 'observe', 'two', 'magnetic', 'fluctuation', 'induced', 'spectral', 'broadenings', 'below', 'sim15', 'k', 'and', 'sim100', 'k', 'which', 'are', 'believed', 'to', 'be', 'originated', 'from', 'the', 'transferred', 'magnetic', 'fluctuations', 'of', 'the', 'gd3', 'moments', 'and', 'that', 'of', 'the', 'magnetic', 'fluctuations', 'of', 'the', 'fe', 'atoms', 'respectively']] | [-0.12870052125223952, 0.26825880382776907, 0.009195060104779575, 0.03720680422392552, 0.008532969030025213, -0.09418372046202421, 0.10663508526049555, 0.3970464790806822, -0.2516949947923422, -0.3989928502751433, -0.03297478756867349, -0.3666851945383393, -0.0042506033109258054, 0.13909993479433266, 0.12735846005785076, -0.07920549927360337, -0.06655845999231805, 0.058795360641290796, -0.11775421332821007, -0.19915602127616497, 0.2536955184019778, 0.0688059317919871, 0.3080003361015216, 0.09599861595577196, 0.03172347654548028, -0.058047170792807544, 0.07975529626659725, 0.044593659180985845, -0.12059883140293254, 0.03483586169212409, 0.2441813730796718, -0.06296687152884577, 0.1553391872520518, -0.37743715060793837, -0.19331635355888663, 0.057191573346600584, 0.11885993270932332, 0.08804799223865342, -0.03158397593550667, -0.26822858460085547, 0.12158289793980025, -0.07450439144209352, -0.10280847698450088, -0.07212100647966904, -0.006697780954773011, -0.014795198526395404, -0.23452106835168746, 0.12767497562530006, 0.08288672316981399, 0.17380785879719515, -0.13405440330262416, -0.1936629156784519, -0.0963949961344833, 0.03632673963742412, 0.05393087524596764, 0.0946746057830751, 0.18977735783985775, -0.024196085849594647, -0.06903832464721864, 0.3262291639233413, -0.11223934716140123, 0.06503246198003383, 0.1498430277828289, -0.2463952718788515, -0.10207607520582235, 0.243166965989234, 0.06419307616255854, 0.10754805827999245, -0.12598091401159764, 0.051274280239949406, 0.02622591769727676, 0.2004627433888938, 0.08944879482378779, 0.061921434400036286, 0.21726394050714115, 0.10547553842846791, -0.007957538719410481, 0.13426047024701762, -0.19499494739727158, -0.018649248620900123, -0.1927930941157367, -0.1160494005299963, -0.1897967395818104, 0.081789287932865, -0.06815659323980545, -0.13117826194704874, 0.3512345687850662, 0.11159448608270157, 0.24479917242475177, -0.09045625281337973, 0.2180888572545803, 0.08386613665675016, 0.09281504065527216, 0.05260935666485001, 0.25466775968670846, 0.2294181652913761, 0.15694468031313433, -0.3288752350854971, 0.08259328519723014, -0.02388633700978497] |
1,802.08941 | Gradient Primal-Dual Algorithm Converges to Second-Order Stationary
Solutions for Nonconvex Distributed Optimization | In this work, we study two first-order primal-dual based algorithms, the
Gradient Primal-Dual Algorithm (GPDA) and the Gradient Alternating Direction
Method of Multipliers (GADMM), for solving a class of linearly constrained
non-convex optimization problems. We show that with random initialization of
the primal and dual variables, both algorithms are able to compute second-order
stationary solutions (ss2) with probability one. This is the first result
showing that primal-dual algorithm is capable of finding ss2 when only using
first-order information, it also extends the existing results for first-order,
but primal-only algorithms.
An important implication of our result is that it also gives rise to the
first global convergence result to the ss2, for two classes of unconstrained
distributed non-convex learning problems over multi-agent networks.
| math.OC cs.IT math.IT | in this work we study two firstorder primaldual based algorithms the gradient primaldual algorithm gpda and the gradient alternating direction method of multipliers gadmm for solving a class of linearly constrained nonconvex optimization problems we show that with random initialization of the primal and dual variables both algorithms are able to compute secondorder stationary solutions ss2 with probability one this is the first result showing that primaldual algorithm is capable of finding ss2 when only using firstorder information it also extends the existing results for firstorder but primalonly algorithms an important implication of our result is that it also gives rise to the first global convergence result to the ss2 for two classes of unconstrained distributed nonconvex learning problems over multiagent networks | [['in', 'this', 'work', 'we', 'study', 'two', 'firstorder', 'primaldual', 'based', 'algorithms', 'the', 'gradient', 'primaldual', 'algorithm', 'gpda', 'and', 'the', 'gradient', 'alternating', 'direction', 'method', 'of', 'multipliers', 'gadmm', 'for', 'solving', 'a', 'class', 'of', 'linearly', 'constrained', 'nonconvex', 'optimization', 'problems', 'we', 'show', 'that', 'with', 'random', 'initialization', 'of', 'the', 'primal', 'and', 'dual', 'variables', 'both', 'algorithms', 'are', 'able', 'to', 'compute', 'secondorder', 'stationary', 'solutions', 'ss2', 'with', 'probability', 'one', 'this', 'is', 'the', 'first', 'result', 'showing', 'that', 'primaldual', 'algorithm', 'is', 'capable', 'of', 'finding', 'ss2', 'when', 'only', 'using', 'firstorder', 'information', 'it', 'also', 'extends', 'the', 'existing', 'results', 'for', 'firstorder', 'but', 'primalonly', 'algorithms', 'an', 'important', 'implication', 'of', 'our', 'result', 'is', 'that', 'it', 'also', 'gives', 'rise', 'to', 'the', 'first', 'global', 'convergence', 'result', 'to', 'the', 'ss2', 'for', 'two', 'classes', 'of', 'unconstrained', 'distributed', 'nonconvex', 'learning', 'problems', 'over', 'multiagent', 'networks']] | [-0.090726682425399, -0.006864859046254423, -0.09703862281360974, 0.05061890941287857, -0.09564891750536238, -0.1825612896393674, 0.013119683453502754, 0.4258000596348817, -0.33835589098356045, -0.2851676337304525, 0.12085666438506451, -0.21213576928712427, -0.1971303016024952, 0.22036143163374314, -0.08539450753790637, 0.09633800501469522, 0.06238892881568366, 0.007965531557177503, -0.13300031558028422, -0.31720214899008475, 0.2798675404017558, -0.0357450696406886, 0.24481239481829106, 0.03715193455961222, 0.1511981938732788, -0.006839125506424655, 0.023135997852659785, 0.065200789750088, -0.07559295345848417, 0.1423952919508641, 0.2897272827006721, 0.1904293479320283, 0.33892382859873277, -0.3634096266546597, -0.1399141458280307, 0.15406362219170358, 0.1545802110534472, 0.12431322727352381, -0.06879851852233211, -0.24102009812680383, 0.10898976229364052, -0.09539294725594422, -0.07138107309583575, -0.10215699936573704, -0.051387613745949544, 0.06603811199117142, -0.3362593770027161, 0.03721707200020319, 0.13414585743642723, -0.03358650192385539, -0.10230512940906919, -0.11764985834015533, 0.07377792970704225, 0.03040847522909947, 0.09187017467532617, 0.07684649568303333, 0.07369497714098543, -0.07322671090175087, -0.17515855915165351, 0.33917965705816944, -0.04164093466727839, -0.2070439201546833, 0.1636292134896697, -0.02580678934464231, -0.1991707495142085, 0.15099553021912773, 0.197681141726207, 0.25535366100181517, -0.14292433541134716, 0.0819010815845104, -0.08790084190356234, 0.13736513587258134, 0.006220745617368569, -0.020163051485239218, 0.08998302209850711, 0.15727035275582846, 0.23940170619171114, 0.16140262109038303, -0.022910073469878018, -0.1852293598271596, -0.2720023788822194, -0.11891309081887205, -0.17948914382141085, -0.04615732053449998, -0.1351363243299905, -0.1771418384819602, 0.383747945430999, 0.1725190594268497, 0.16967853294530263, 0.15529665897677963, 0.33078891212741535, 0.13250374289636965, 0.007330551836639642, 0.15762243604985998, 0.23700796537062463, 0.142590816396599, 0.11767594817695984, -0.23847363443734745, 0.060980984712174786, 0.16144486066962901] |
1,802.08942 | Local quantum uncertainty guarantees the measurement precision for two
coupled two-level systems in non-Markovian environment | Quantum Fisher information (QFI) is an important feature for the precision of
quantum parameter estimation based on the quantum Cram\'er-Rao inequality. When
the quantum state satisfies the von Neumann-Landau equation, the local quantum
uncertainty (LQU), as a kind of quantum correlation, present in a bipartite
mixed state guarantees a lower bound on QFI in the optimal phase estimation
protocol [Phys. Rev. Lett. 110 (2013) 240402]. However, in the open quantum
systems, there is not an explicit relation between LQU and QFI generally. In
this paper, we study the relation between LQU and QFI in open systems which is
composed of two interacting two-level systems coupled to independent
non-Markovian environments with the entangled initial state embedded by a phase
parameter $\theta$. The analytical calculations show that the QFI does't depend
on the phase parameter $\theta$, and its decay can be restrained through
enhancing the coupling strength or non-Markovianity. Meanwhile, the LQU is
related to the phase parameter $\theta$ and shows plentiful phenomena. In
particular, we find that the LQU can well bound the QFI when the coupling
between the two systems is switched off or the initial state is Bell state.
| quant-ph | quantum fisher information qfi is an important feature for the precision of quantum parameter estimation based on the quantum cramerrao inequality when the quantum state satisfies the von neumannlandau equation the local quantum uncertainty lqu as a kind of quantum correlation present in a bipartite mixed state guarantees a lower bound on qfi in the optimal phase estimation protocol phys rev lett 110 2013 240402 however in the open quantum systems there is not an explicit relation between lqu and qfi generally in this paper we study the relation between lqu and qfi in open systems which is composed of two interacting twolevel systems coupled to independent nonmarkovian environments with the entangled initial state embedded by a phase parameter theta the analytical calculations show that the qfi doest depend on the phase parameter theta and its decay can be restrained through enhancing the coupling strength or nonmarkovianity meanwhile the lqu is related to the phase parameter theta and shows plentiful phenomena in particular we find that the lqu can well bound the qfi when the coupling between the two systems is switched off or the initial state is bell state | [['quantum', 'fisher', 'information', 'qfi', 'is', 'an', 'important', 'feature', 'for', 'the', 'precision', 'of', 'quantum', 'parameter', 'estimation', 'based', 'on', 'the', 'quantum', 'cramerrao', 'inequality', 'when', 'the', 'quantum', 'state', 'satisfies', 'the', 'von', 'neumannlandau', 'equation', 'the', 'local', 'quantum', 'uncertainty', 'lqu', 'as', 'a', 'kind', 'of', 'quantum', 'correlation', 'present', 'in', 'a', 'bipartite', 'mixed', 'state', 'guarantees', 'a', 'lower', 'bound', 'on', 'qfi', 'in', 'the', 'optimal', 'phase', 'estimation', 'protocol', 'phys', 'rev', 'lett', '110', '2013', '240402', 'however', 'in', 'the', 'open', 'quantum', 'systems', 'there', 'is', 'not', 'an', 'explicit', 'relation', 'between', 'lqu', 'and', 'qfi', 'generally', 'in', 'this', 'paper', 'we', 'study', 'the', 'relation', 'between', 'lqu', 'and', 'qfi', 'in', 'open', 'systems', 'which', 'is', 'composed', 'of', 'two', 'interacting', 'twolevel', 'systems', 'coupled', 'to', 'independent', 'nonmarkovian', 'environments', 'with', 'the', 'entangled', 'initial', 'state', 'embedded', 'by', 'a', 'phase', 'parameter', 'theta', 'the', 'analytical', 'calculations', 'show', 'that', 'the', 'qfi', 'doest', 'depend', 'on', 'the', 'phase', 'parameter', 'theta', 'and', 'its', 'decay', 'can', 'be', 'restrained', 'through', 'enhancing', 'the', 'coupling', 'strength', 'or', 'nonmarkovianity', 'meanwhile', 'the', 'lqu', 'is', 'related', 'to', 'the', 'phase', 'parameter', 'theta', 'and', 'shows', 'plentiful', 'phenomena', 'in', 'particular', 'we', 'find', 'that', 'the', 'lqu', 'can', 'well', 'bound', 'the', 'qfi', 'when', 'the', 'coupling', 'between', 'the', 'two', 'systems', 'is', 'switched', 'off', 'or', 'the', 'initial', 'state', 'is', 'bell', 'state']] | [-0.18790958269632288, 0.19054772210243975, -0.08681632131436672, 0.026732797482514153, -0.009317534911648306, -0.2013804355621456, 0.08458243034812055, 0.3051304544849449, -0.24495071468476134, -0.278215521039865, 0.06813339750336671, -0.2833446072311037, -0.15333754619615517, 0.22611458190450712, -0.04572580632058874, 0.10043266194314504, 0.05173827743492823, 0.08648508359313445, -0.09336378461331445, -0.24955041895043992, 0.317672763719524, 0.040565986625441204, 0.3076770383157526, 0.05805088662931686, 0.08524063178313472, 0.011837237731371292, 0.08821379517022737, -0.03138329463434361, -0.18216114586612478, 0.053133497448273434, 0.236814985885445, 0.11020407417850543, 0.23393624740721727, -0.3558322626644026, -0.17064987288581002, 0.13178501565196604, 0.12425055858930426, 0.13343909585037855, 0.00277390816709687, -0.36184230593658945, -0.0529229495349148, -0.16664602481710808, -0.0751497799348303, -0.06774148908345197, 0.03547271453435459, -0.05005672715404736, -0.28867235752413906, 0.18032095576611856, 0.06082250156856226, 0.014796799547357728, 0.0015454856776164244, -0.059802008270428926, 0.005048104705998585, 0.09130099076296021, -0.06710977398263163, 0.05411460365922678, 0.11772856535882782, -0.147549746198353, -0.11855986545437691, 0.2973149197038125, -0.03764851492455121, -0.23614788885233262, 0.13745767468766423, -0.1150333399357146, -0.1179957664497788, 0.028569563479216957, 0.13526123282425698, 0.07417196373667115, -0.12746315277825238, 0.1164040167430396, -0.027308909498431063, 0.25289118713231157, 0.017697918450548536, 0.1283459600465244, 0.16312224565014716, 0.10265722374275336, 0.08741790863929227, 0.18536166925286313, -0.05931303724301634, -0.20221714097107193, -0.298863703591956, -0.2018383566361591, -0.2416645190810967, 0.09933951068997553, -0.09011695853024278, -0.123025667456979, 0.34095136718282465, 0.14960315191586102, 0.1759113434914046, -0.017330111899393458, 0.2597143247467342, 0.1663077702267199, -0.03920762420991662, 0.11741368802481149, 0.2961125333569254, 0.18403319752942673, 0.0534685706453664, -0.28294577075552846, 0.11127468891066553, 0.04605603830583354] |
1,802.08943 | A Model for Innovation Diffusion with Intergroup Suppression | We present a new model for the diffusion of innovation. Here, the population
is segmented into distinct groups. Adoption by a particular group of some
cultural product may be inhibited both by large numbers of its own members
already having adopted but also, in particular, by members of another group
having adopted. Intergroup migration is also permitted. We determine the
equilibrium points and carry out stability analysis for the model for a
two-group population. We also simulate a discrete time version of the model.
Lastly, we present data on tablet use in eight countries from 2012-2016 and
show that the relationship between use in the "under 25" age group and "55+"
age group conforms to the model.
| physics.soc-ph cs.SI | we present a new model for the diffusion of innovation here the population is segmented into distinct groups adoption by a particular group of some cultural product may be inhibited both by large numbers of its own members already having adopted but also in particular by members of another group having adopted intergroup migration is also permitted we determine the equilibrium points and carry out stability analysis for the model for a twogroup population we also simulate a discrete time version of the model lastly we present data on tablet use in eight countries from 20122016 and show that the relationship between use in the under 25 age group and 55 age group conforms to the model | [['we', 'present', 'a', 'new', 'model', 'for', 'the', 'diffusion', 'of', 'innovation', 'here', 'the', 'population', 'is', 'segmented', 'into', 'distinct', 'groups', 'adoption', 'by', 'a', 'particular', 'group', 'of', 'some', 'cultural', 'product', 'may', 'be', 'inhibited', 'both', 'by', 'large', 'numbers', 'of', 'its', 'own', 'members', 'already', 'having', 'adopted', 'but', 'also', 'in', 'particular', 'by', 'members', 'of', 'another', 'group', 'having', 'adopted', 'intergroup', 'migration', 'is', 'also', 'permitted', 'we', 'determine', 'the', 'equilibrium', 'points', 'and', 'carry', 'out', 'stability', 'analysis', 'for', 'the', 'model', 'for', 'a', 'twogroup', 'population', 'we', 'also', 'simulate', 'a', 'discrete', 'time', 'version', 'of', 'the', 'model', 'lastly', 'we', 'present', 'data', 'on', 'tablet', 'use', 'in', 'eight', 'countries', 'from', '20122016', 'and', 'show', 'that', 'the', 'relationship', 'between', 'use', 'in', 'the', 'under', '25', 'age', 'group', 'and', '55', 'age', 'group', 'conforms', 'to', 'the', 'model']] | [-0.08226555850929938, 0.08858539869125263, -0.11713204251872933, 0.06076073282772405, -0.058897324232782565, -0.116088842228851, 0.13476317152619743, 0.3959735723005401, -0.24637316504859516, -0.31164580137413156, 0.13783152531295156, -0.2516030964131157, -0.14059026383906284, 0.167782516982884, -0.06372435357119156, -0.07146915435267644, 0.052302694994892575, 0.056067754874706395, -0.021162430053322107, -0.2278260208455384, 0.338174982688939, 0.030504813744899474, 0.2533541497412241, -0.018592172456033625, 0.07734223032214989, -0.01728261762863805, -0.06273532102409846, 0.02301234511547109, -0.1251782270919648, 0.10385708444807519, 0.2001887252395097, 0.1418638171965299, 0.3035062577925686, -0.3943815799828014, -0.17920798709631985, 0.09692254918826441, 0.15367552237664786, 0.08373544823067884, -0.0906497395495908, -0.2580188415689856, 0.07580191021562259, -0.23630242166706386, -0.14463590390773284, -0.03806627915105504, 0.04395689459917589, 0.01713051088950318, -0.20732744425857583, 0.07750116263712263, -0.009834943446688928, 0.1115247139818648, -0.08158742446098158, -0.1245163640118817, -0.03879962035287649, 0.17841427511352503, 0.03418063505305948, -0.04836208168735616, 0.11088537206698178, -0.09303027607946314, -0.08832439277161899, 0.39927544949464816, -0.06374176658299935, -0.16794687969626015, 0.2084603252259489, -0.15409876244206333, -0.16988626070336527, 0.07517572532161179, 0.19624899996396822, 0.08652217415535551, -0.16200002583746725, 0.05384881780771379, -0.0778912984742186, 0.17176170592220166, 0.021253172905208208, -0.03222759120946384, 0.17808198807231235, 0.1698341319998169, 0.05662131363637427, 0.1238976072621508, -0.090411879037682, -0.10253604540489933, -0.26415261999966627, -0.1718613313845335, -0.10737110392397477, 0.030452643390784725, -0.0938210780927603, -0.1183202476061594, 0.4104546408654533, 0.1638935560402341, 0.16701956692700967, 0.0669527574100046, 0.20795171471057922, 0.04821896607963703, 0.0972303423879302, 0.09178087579357064, 0.19336361121749465, 0.11262231168305326, 0.049376923762038984, -0.18159668326465428, 0.0927973459673743, 0.019102717737834424] |
1,802.08944 | Real Time Quantum Dynamics of Spontaneous Translational Symmetry
Breakage in the Early Stage of Photo-induced Structural Phase Transitions | Real time quantum dynamics of the spontaneous translational symmetry breakage
in the early stage of photoinduced structural phase transitions is reviewed and
supplementally explained, under the guide of the Toyozawa theory, which is
exactly in compliance with the conservation laws of the total momentum and
energy. At the Franck Condon state, an electronic excitation just created by a
visible light, is in a plane wave state, extended all over the crystal. While,
after the lattice relaxation having been completed, it is localized around a
certain lattice site of the crystal, as a new excitation. Is there a sudden
shrinkage of the excitation wave function, in between. The wave function never
shrinks, but only the spatial, or inter lattice site quantum coherence,
interference of the excitation disappears, as the lattice relaxation proceeds.
This is nothing but the spontaneous breakage of translational symmetry.
| cond-mat.mtrl-sci | real time quantum dynamics of the spontaneous translational symmetry breakage in the early stage of photoinduced structural phase transitions is reviewed and supplementally explained under the guide of the toyozawa theory which is exactly in compliance with the conservation laws of the total momentum and energy at the franck condon state an electronic excitation just created by a visible light is in a plane wave state extended all over the crystal while after the lattice relaxation having been completed it is localized around a certain lattice site of the crystal as a new excitation is there a sudden shrinkage of the excitation wave function in between the wave function never shrinks but only the spatial or inter lattice site quantum coherence interference of the excitation disappears as the lattice relaxation proceeds this is nothing but the spontaneous breakage of translational symmetry | [['real', 'time', 'quantum', 'dynamics', 'of', 'the', 'spontaneous', 'translational', 'symmetry', 'breakage', 'in', 'the', 'early', 'stage', 'of', 'photoinduced', 'structural', 'phase', 'transitions', 'is', 'reviewed', 'and', 'supplementally', 'explained', 'under', 'the', 'guide', 'of', 'the', 'toyozawa', 'theory', 'which', 'is', 'exactly', 'in', 'compliance', 'with', 'the', 'conservation', 'laws', 'of', 'the', 'total', 'momentum', 'and', 'energy', 'at', 'the', 'franck', 'condon', 'state', 'an', 'electronic', 'excitation', 'just', 'created', 'by', 'a', 'visible', 'light', 'is', 'in', 'a', 'plane', 'wave', 'state', 'extended', 'all', 'over', 'the', 'crystal', 'while', 'after', 'the', 'lattice', 'relaxation', 'having', 'been', 'completed', 'it', 'is', 'localized', 'around', 'a', 'certain', 'lattice', 'site', 'of', 'the', 'crystal', 'as', 'a', 'new', 'excitation', 'is', 'there', 'a', 'sudden', 'shrinkage', 'of', 'the', 'excitation', 'wave', 'function', 'in', 'between', 'the', 'wave', 'function', 'never', 'shrinks', 'but', 'only', 'the', 'spatial', 'or', 'inter', 'lattice', 'site', 'quantum', 'coherence', 'interference', 'of', 'the', 'excitation', 'disappears', 'as', 'the', 'lattice', 'relaxation', 'proceeds', 'this', 'is', 'nothing', 'but', 'the', 'spontaneous', 'breakage', 'of', 'translational', 'symmetry']] | [-0.16496022164355964, 0.24339650861812906, -0.08654880468467517, 0.034762109296363114, -0.027984752755479087, -0.10254498516275946, 0.0675422263456442, 0.3723429441052888, -0.28562566145722357, -0.22420125109077033, 0.08479676499098007, -0.2582336344889232, -0.10430524029735742, 0.08136470163340813, 0.05810504481196403, 0.03081179910514038, -0.016456862968126578, 0.0509661242232791, -0.07622735201979854, -0.1878579252981581, 0.2657397108684693, 0.061487756453113565, 0.32606542116430187, 0.07810726847757386, 0.10006152072788349, 0.044224950473289934, 0.06605235673653494, -0.03609042734772499, -0.10224938515706786, 0.021511846049023526, 0.19194371094927193, 0.042455871739990214, 0.24241248271760663, -0.44994561390153, -0.24266624765753347, 0.049920680403842455, 0.12233240169755716, 0.1747138337173965, -0.03900403196457773, -0.27335572018886783, -0.004658260748588613, -0.1288012288045138, -0.16328916848038455, -0.025031117482909135, 0.02272843523782545, -0.0037345203508656207, -0.2057254776633012, 0.14250676841807686, 0.08203376209962049, 0.10290682914700093, -0.07437835190378661, -0.05389988240120666, -0.11463150092999318, 0.07469454098027199, 0.05632782270134028, 0.07879874482750893, 0.13346847257676667, -0.13339314206137454, -0.10662344994322796, 0.42910352397177903, -0.006617792110357966, -0.1308396641031972, 0.14803030186033408, -0.1747176540716152, -0.08101265365590475, 0.22567270811913268, 0.09359381102008878, 0.09566806838182466, -0.11441540131137506, 0.06463088484930007, 0.00997064503306839, 0.17640754177368112, 0.09034612700675747, 0.050518564440842184, 0.21650854992746774, 0.1734263495741678, 0.05634522790621434, 0.15733975899305994, -0.0805034896970288, -0.1598712964149724, -0.3193311697071684, -0.1446794565592427, -0.23512733611111927, 0.07115386892868887, -0.03404217918848319, -0.14459674222660915, 0.42750734222520675, 0.04048006633363132, 0.17870834168778466, -0.028315524832578376, 0.23496457266737708, 0.14505260182444804, 0.0958124389306509, 0.014627901993558875, 0.2546298135471131, 0.11860484935709142, 0.1189418550123394, -0.3041321459525664, 0.06179646191054157, 0.040037723055242426] |
1,802.08945 | Validation and Initial Characterization of the Long Period Planet
Kepler-1654 b | Fewer than 20 transiting Kepler planets have periods longer than one year.
Our early search of the Kepler light curves revealed one such system,
Kepler-1654 b (originally KIC~8410697b), which shows exactly two transit events
and whose second transit occurred only 5 days before the failure of the second
of two reaction wheels brought the primary Kepler mission to an end. A number
of authors have also examined light curves from the Kepler mission searching
for long period planets and identified this candidate. Starting in Sept. 2014
we began an observational program of imaging, reconnaissance spectroscopy and
precision radial velocity measurements which confirm with a high degree of
confidence that Kepler-1654 b is a {\it bona fide} transiting planet orbiting a
mature G2V star (T$_{eff}= 5580$K, [Fe/H]=-0.08) with a semi-major axis of 2.03
AU, a period of 1047.84 days and a radius of 0.82$\pm$0.02 R$_{Jup}$. Radial
Velocity (RV) measurements using Keck's HIRES spectrometer obtained over 2.5
years set a limit to the planet's mass of $<0.5\ (3\sigma$) M$_{Jup}$. The bulk
density of the planet is similar to that of Saturn or possibly lower. We assess
the suitability of temperate gas giants like Kepler-1654b for transit
spectroscopy with the James Webb Space Telescope since their relatively cold
equilibrium temperatures (T$_{pl}\sim 200$K) make them interesting from the
standpoint of exo-planet atmospheric physics. Unfortunately, these low
temperatures also make the atmospheric scale heights small and thus
transmission spectroscopy challenging. Finally, the long time between transits
can make scheduling JWST observations difficult---as is the case with
Kepler-1654b.
| astro-ph.EP astro-ph.SR | fewer than 20 transiting kepler planets have periods longer than one year our early search of the kepler light curves revealed one such system kepler1654 b originally kic8410697b which shows exactly two transit events and whose second transit occurred only 5 days before the failure of the second of two reaction wheels brought the primary kepler mission to an end a number of authors have also examined light curves from the kepler mission searching for long period planets and identified this candidate starting in sept 2014 we began an observational program of imaging reconnaissance spectroscopy and precision radial velocity measurements which confirm with a high degree of confidence that kepler1654 b is a it bona fide transiting planet orbiting a mature g2v star t_eff 5580k feh008 with a semimajor axis of 203 au a period of 104784 days and a radius of 082pm002 r_jup radial velocity rv measurements using kecks hires spectrometer obtained over 25 years set a limit to the planets mass of 05 3sigma m_jup the bulk density of the planet is similar to that of saturn or possibly lower we assess the suitability of temperate gas giants like kepler1654b for transit spectroscopy with the james webb space telescope since their relatively cold equilibrium temperatures t_plsim 200k make them interesting from the standpoint of exoplanet atmospheric physics unfortunately these low temperatures also make the atmospheric scale heights small and thus transmission spectroscopy challenging finally the long time between transits can make scheduling jwst observations difficultas is the case with kepler1654b | [['fewer', 'than', '20', 'transiting', 'kepler', 'planets', 'have', 'periods', 'longer', 'than', 'one', 'year', 'our', 'early', 'search', 'of', 'the', 'kepler', 'light', 'curves', 'revealed', 'one', 'such', 'system', 'kepler1654', 'b', 'originally', 'kic8410697b', 'which', 'shows', 'exactly', 'two', 'transit', 'events', 'and', 'whose', 'second', 'transit', 'occurred', 'only', '5', 'days', 'before', 'the', 'failure', 'of', 'the', 'second', 'of', 'two', 'reaction', 'wheels', 'brought', 'the', 'primary', 'kepler', 'mission', 'to', 'an', 'end', 'a', 'number', 'of', 'authors', 'have', 'also', 'examined', 'light', 'curves', 'from', 'the', 'kepler', 'mission', 'searching', 'for', 'long', 'period', 'planets', 'and', 'identified', 'this', 'candidate', 'starting', 'in', 'sept', '2014', 'we', 'began', 'an', 'observational', 'program', 'of', 'imaging', 'reconnaissance', 'spectroscopy', 'and', 'precision', 'radial', 'velocity', 'measurements', 'which', 'confirm', 'with', 'a', 'high', 'degree', 'of', 'confidence', 'that', 'kepler1654', 'b', 'is', 'a', 'it', 'bona', 'fide', 'transiting', 'planet', 'orbiting', 'a', 'mature', 'g2v', 'star', 't_eff', '5580k', 'feh008', 'with', 'a', 'semimajor', 'axis', 'of', '203', 'au', 'a', 'period', 'of', '104784', 'days', 'and', 'a', 'radius', 'of', '082pm002', 'r_jup', 'radial', 'velocity', 'rv', 'measurements', 'using', 'kecks', 'hires', 'spectrometer', 'obtained', 'over', '25', 'years', 'set', 'a', 'limit', 'to', 'the', 'planets', 'mass', 'of', '05', '3sigma', 'm_jup', 'the', 'bulk', 'density', 'of', 'the', 'planet', 'is', 'similar', 'to', 'that', 'of', 'saturn', 'or', 'possibly', 'lower', 'we', 'assess', 'the', 'suitability', 'of', 'temperate', 'gas', 'giants', 'like', 'kepler1654b', 'for', 'transit', 'spectroscopy', 'with', 'the', 'james', 'webb', 'space', 'telescope', 'since', 'their', 'relatively', 'cold', 'equilibrium', 'temperatures', 't_plsim', '200k', 'make', 'them', 'interesting', 'from', 'the', 'standpoint', 'of', 'exoplanet', 'atmospheric', 'physics', 'unfortunately', 'these', 'low', 'temperatures', 'also', 'make', 'the', 'atmospheric', 'scale', 'heights', 'small', 'and', 'thus', 'transmission', 'spectroscopy', 'challenging', 'finally', 'the', 'long', 'time', 'between', 'transits', 'can', 'make', 'scheduling', 'jwst', 'observations', 'difficultas', 'is', 'the', 'case', 'with', 'kepler1654b']] | [-0.11314117475922103, 0.18414701639279277, -0.10418721822510027, 0.044249287247657774, -0.12637859688935957, -0.13028016585934285, 0.105094931985271, 0.3389042143874879, -0.17050536067402694, -0.40336144536267965, 0.11686461322775964, -0.31632617527757245, -0.07080161942285486, 0.2458662251146355, -0.08818216830744253, 0.06681229674719967, 0.16918112395020823, -0.03227737518269957, -0.030241804249817504, -0.33237283064590883, 0.20199877044651657, 0.09532891134731472, 0.05214454503948218, -0.04500879832606491, 0.040326766118232625, -0.04097374886817609, -0.053893973881349665, -0.05911235946429467, -0.1817598112667838, 0.031692864714811246, 0.23504009049599214, 0.14293002495154117, 0.2310158881979684, -0.33541533519746736, -0.211425861963653, 0.07656465098261833, 0.11337651939669134, 0.00017402517745116104, -0.01590996661943791, -0.29328375359570297, 0.050060628080973404, -0.18475669682235699, -0.2061343125378092, 0.02440971189547175, 0.13300064891615573, -0.020098011100587124, -0.22769532474849258, 0.05584124988987848, -0.011742208370318015, 0.2086314979455589, -0.15437377963292723, -0.15626674554708492, -0.07286076192637363, 0.07237861486343415, 0.0244741808361141, 0.05718027179112444, 0.10999208104913123, -0.04719715100460841, -0.034383406995038966, 0.390392941327688, -0.1032681976705741, 0.04177544852233647, 0.23395857414385926, -0.23997496130371776, -0.12732481486552086, 0.16785369816881637, 0.16054196238595372, 0.152780607965542, -0.17846723461795289, -0.016890405454250867, -0.005107071182768171, 0.22663446206415755, 0.14127512361349848, 0.0536816511497212, 0.3755096664419398, 0.1504895114689134, 0.09257471886909723, 0.02708026343510331, -0.2882422839312009, -0.04461257801449392, -0.1839034011825182, -0.16382232857965087, -0.14817467104585375, 0.058369233373135404, -0.0814096420301818, -0.09402754076484901, 0.35992265136264906, 0.1458494526237094, 0.1865091120377959, 0.04022637377638603, 0.32867973124763616, 0.05297092388603535, 0.10219998806872657, 0.07838887750500968, 0.3238566001566748, 0.13396636126951003, 0.1309717505563943, -0.20906914963488815, 0.04865726652302935, -0.028181180128012785] |
1,802.08946 | Teacher Improves Learning by Selecting a Training Subset | We call a learner super-teachable if a teacher can trim down an iid training
set while making the learner learn even better. We provide sharp super-teaching
guarantees on two learners: the maximum likelihood estimator for the mean of a
Gaussian, and the large margin classifier in 1D. For general learners, we
provide a mixed-integer nonlinear programming-based algorithm to find a super
teaching set. Empirical experiments show that our algorithm is able to find
good super-teaching sets for both regression and classification problems.
| stat.ML cs.AI cs.LG | we call a learner superteachable if a teacher can trim down an iid training set while making the learner learn even better we provide sharp superteaching guarantees on two learners the maximum likelihood estimator for the mean of a gaussian and the large margin classifier in 1d for general learners we provide a mixedinteger nonlinear programmingbased algorithm to find a super teaching set empirical experiments show that our algorithm is able to find good superteaching sets for both regression and classification problems | [['we', 'call', 'a', 'learner', 'superteachable', 'if', 'a', 'teacher', 'can', 'trim', 'down', 'an', 'iid', 'training', 'set', 'while', 'making', 'the', 'learner', 'learn', 'even', 'better', 'we', 'provide', 'sharp', 'superteaching', 'guarantees', 'on', 'two', 'learners', 'the', 'maximum', 'likelihood', 'estimator', 'for', 'the', 'mean', 'of', 'a', 'gaussian', 'and', 'the', 'large', 'margin', 'classifier', 'in', '1d', 'for', 'general', 'learners', 'we', 'provide', 'a', 'mixedinteger', 'nonlinear', 'programmingbased', 'algorithm', 'to', 'find', 'a', 'super', 'teaching', 'set', 'empirical', 'experiments', 'show', 'that', 'our', 'algorithm', 'is', 'able', 'to', 'find', 'good', 'superteaching', 'sets', 'for', 'both', 'regression', 'and', 'classification', 'problems']] | [0.0012869617070625477, -0.008740301318930851, -0.10141240771199707, 0.15143355270228762, -0.14832265610818432, -0.24125967593863606, 0.11951354512638307, 0.44644105264657663, -0.2691406704532572, -0.30044594326327684, 0.0749755254165635, -0.2703460464843466, -0.1767882896923236, 0.20082004362613382, -0.1305357129489885, 0.0945969109152314, 0.13625385725864833, 0.077592661775961, -0.06236733315229605, -0.3643378515645296, 0.25756700605719907, 0.02385293230225768, 0.28541570749794004, -0.020097120796165227, 0.1656625776233364, 0.007407268921880028, 0.03620718947104827, 0.04483821238332157, -0.067077757841248, 0.12832986332971272, 0.3132474718591835, 0.227399940254709, 0.4165017498492063, -0.36982270785241944, -0.133334371001943, 0.11959223808201996, 0.10402142317063777, 0.11695273419476668, -0.02744064750768763, -0.26417817969370305, 0.07641463327704917, -0.13291587760742707, -0.016614248592972378, -0.17553011579085379, -0.07395666309549839, -0.012787206194958874, -0.4508861269613233, -0.01793503575026989, 0.09399233090608747, 0.08458158728088948, -0.05375234805684112, -0.13712592965988088, 0.047106522032283715, 0.0916601657053998, 0.014914130423618834, 0.049275326054790826, 0.08313785412619952, -0.1427628253409757, -0.1349323219324969, 0.32317592117558175, -0.07342668456656128, -0.21570020385935337, 0.1846829409699274, -0.08992321012966052, -0.11609959848154383, 0.0886876751916318, 0.28194691559087626, 0.09633715424828138, -0.14882195980989527, 0.022148352722000754, -0.11654993364163026, 0.1770953689525022, 0.010578640397708816, -0.07257311701217573, 0.16516223031131527, 0.24105947646842915, 0.13238881175889622, 0.16388541741791782, -0.08415152239495347, -0.021533106701283514, -0.29529759305517506, -0.11840462916872546, -0.19498869524443452, -0.000426824063156979, -0.18534545524339074, -0.19693199814318627, 0.34972492058443116, 0.18581116841988096, 0.1940146148016181, 0.24172321432329055, 0.2775924307871846, 0.07942567967781738, 0.01914771217734942, 0.19853501354898268, 0.2150664364070266, 0.06526359171854167, 0.05368468598934197, -0.17826198072679625, 0.10176138634074337, 0.03430818138007499] |
1,802.08947 | $2$-groups behaving as automorphism groups of regular $3$-polytopes | In this paper, we classify regular polytopes with automorphism groups of
order $2^n$ and Schl\"afli types $\{4, 2^{n-3}\}, \{4, 2^{n-4}\}$ and $\{4,
2^{n-5}\}$ for $n \geq 10$, therefore giving a partial answer to a problem
proposed by Schulte and Weiss in [Problems on polytopes, their groups, and
realizations, Periodica Math. Hungarica 53(2006) 231-255].
| math.CO | in this paper we classify regular polytopes with automorphism groups of order 2n and schlafli types 4 2n3 4 2n4 and 4 2n5 for n geq 10 therefore giving a partial answer to a problem proposed by schulte and weiss in problems on polytopes their groups and realizations periodica math hungarica 532006 231255 | [['in', 'this', 'paper', 'we', 'classify', 'regular', 'polytopes', 'with', 'automorphism', 'groups', 'of', 'order', '2n', 'and', 'schlafli', 'types', '4', '2n3', '4', '2n4', 'and', '4', '2n5', 'for', 'n', 'geq', '10', 'therefore', 'giving', 'a', 'partial', 'answer', 'to', 'a', 'problem', 'proposed', 'by', 'schulte', 'and', 'weiss', 'in', 'problems', 'on', 'polytopes', 'their', 'groups', 'and', 'realizations', 'periodica', 'math', 'hungarica', '532006', '231255']] | [-0.1578977636289688, 0.09542927216282304, 0.02567429473737673, 0.05152660523474749, -0.05215416415309419, -0.16513160222723167, 0.04630753517920645, 0.3462380514461167, -0.2516670045537912, -0.38566480394528835, 0.1704838981267483, -0.3572711083961993, -0.17383273604458996, 0.13779373033143275, -0.14780748015915862, -0.03287362664633868, -0.02229099772034251, 0.058667538744606534, -0.08406153439106989, -0.43139651877691554, 0.32963813921170576, -0.10376679395534555, 0.12519726327534916, 0.0594596548804215, 0.09569746909701095, 0.009381467096355497, -0.009544268307485143, 0.011255514375599367, -0.18860886319616468, 0.14418443297843772, 0.3059526757166094, 0.0852746924632514, 0.17948634131830565, -0.35235247411289994, -0.12066562568094125, 0.16441686093636163, 0.15157200357097447, 0.03118178823354597, 0.02509701275504289, -0.2243353473212646, 0.1405013020453875, -0.1355650227752096, -0.16462845424646322, -0.031118332522408088, 0.16266813718390707, -0.06904818112866914, -0.26399220039649884, 0.031365966984446214, 0.1559166673722924, 0.15115526068138377, -0.016449224983094906, -0.19451605619824663, 0.011904517036615585, 0.07202016332243778, -0.09545057814742978, 0.04173100460320711, -0.039705409297757614, -0.022914083565262203, -0.20974176574726494, 0.36176698594068996, 0.060821755644295136, -0.22556124553464504, 0.1667117478744108, -0.16359186473739695, -0.20625020964641352, 0.14853771726543807, 0.15985692657378256, 0.19145796560131165, -0.032662406459222644, 0.12077059858592645, -0.09297271823624567, 0.11726654936293406, 0.21028478607079204, -0.06124301163517699, 0.06682446640821135, 0.06768601342123381, 0.10157005886110115, 0.120276144575488, 0.052646475012547204, 0.052805507432061194, -0.2738274448665277, -0.138142996144538, -0.09322013166181896, 0.1296191423827288, -0.1292007232948482, -0.07786523337875094, 0.37400188650555755, 0.0675238229486407, 0.15624153938581598, 0.15379422021155453, 0.14016728696166253, -0.036621866158532856, -0.004017606895531015, 0.14396526229244713, 0.057353764644120724, 0.21390014988066133, 0.007749917755397607, -0.10533603098319501, -0.0937853407076731, 0.17783118164813033] |
1,802.08948 | Multi-Oriented Scene Text Detection via Corner Localization and Region
Segmentation | Previous deep learning based state-of-the-art scene text detection methods
can be roughly classified into two categories. The first category treats scene
text as a type of general objects and follows general object detection paradigm
to localize scene text by regressing the text box locations, but troubled by
the arbitrary-orientation and large aspect ratios of scene text. The second one
segments text regions directly, but mostly needs complex post processing. In
this paper, we present a method that combines the ideas of the two types of
methods while avoiding their shortcomings. We propose to detect scene text by
localizing corner points of text bounding boxes and segmenting text regions in
relative positions. In inference stage, candidate boxes are generated by
sampling and grouping corner points, which are further scored by segmentation
maps and suppressed by NMS. Compared with previous methods, our method can
handle long oriented text naturally and doesn't need complex post processing.
The experiments on ICDAR2013, ICDAR2015, MSRA-TD500, MLT and COCO-Text
demonstrate that the proposed algorithm achieves better or comparable results
in both accuracy and efficiency. Based on VGG16, it achieves an F-measure of
84.3% on ICDAR2015 and 81.5% on MSRA-TD500.
| cs.CV | previous deep learning based stateoftheart scene text detection methods can be roughly classified into two categories the first category treats scene text as a type of general objects and follows general object detection paradigm to localize scene text by regressing the text box locations but troubled by the arbitraryorientation and large aspect ratios of scene text the second one segments text regions directly but mostly needs complex post processing in this paper we present a method that combines the ideas of the two types of methods while avoiding their shortcomings we propose to detect scene text by localizing corner points of text bounding boxes and segmenting text regions in relative positions in inference stage candidate boxes are generated by sampling and grouping corner points which are further scored by segmentation maps and suppressed by nms compared with previous methods our method can handle long oriented text naturally and doesnt need complex post processing the experiments on icdar2013 icdar2015 msratd500 mlt and cocotext demonstrate that the proposed algorithm achieves better or comparable results in both accuracy and efficiency based on vgg16 it achieves an fmeasure of 843 on icdar2015 and 815 on msratd500 | [['previous', 'deep', 'learning', 'based', 'stateoftheart', 'scene', 'text', 'detection', 'methods', 'can', 'be', 'roughly', 'classified', 'into', 'two', 'categories', 'the', 'first', 'category', 'treats', 'scene', 'text', 'as', 'a', 'type', 'of', 'general', 'objects', 'and', 'follows', 'general', 'object', 'detection', 'paradigm', 'to', 'localize', 'scene', 'text', 'by', 'regressing', 'the', 'text', 'box', 'locations', 'but', 'troubled', 'by', 'the', 'arbitraryorientation', 'and', 'large', 'aspect', 'ratios', 'of', 'scene', 'text', 'the', 'second', 'one', 'segments', 'text', 'regions', 'directly', 'but', 'mostly', 'needs', 'complex', 'post', 'processing', 'in', 'this', 'paper', 'we', 'present', 'a', 'method', 'that', 'combines', 'the', 'ideas', 'of', 'the', 'two', 'types', 'of', 'methods', 'while', 'avoiding', 'their', 'shortcomings', 'we', 'propose', 'to', 'detect', 'scene', 'text', 'by', 'localizing', 'corner', 'points', 'of', 'text', 'bounding', 'boxes', 'and', 'segmenting', 'text', 'regions', 'in', 'relative', 'positions', 'in', 'inference', 'stage', 'candidate', 'boxes', 'are', 'generated', 'by', 'sampling', 'and', 'grouping', 'corner', 'points', 'which', 'are', 'further', 'scored', 'by', 'segmentation', 'maps', 'and', 'suppressed', 'by', 'nms', 'compared', 'with', 'previous', 'methods', 'our', 'method', 'can', 'handle', 'long', 'oriented', 'text', 'naturally', 'and', 'doesnt', 'need', 'complex', 'post', 'processing', 'the', 'experiments', 'on', 'icdar2013', 'icdar2015', 'msratd500', 'mlt', 'and', 'cocotext', 'demonstrate', 'that', 'the', 'proposed', 'algorithm', 'achieves', 'better', 'or', 'comparable', 'results', 'in', 'both', 'accuracy', 'and', 'efficiency', 'based', 'on', 'vgg16', 'it', 'achieves', 'an', 'fmeasure', 'of', '843', 'on', 'icdar2015', 'and', '815', 'on', 'msratd500']] | [-0.032768219687606584, -0.0018530924900048485, -0.022715256144402365, 0.04464254357257166, -0.09461982114757386, -0.1529105248475808, 0.02534526182735992, 0.43220918104467004, -0.22921022073199962, -0.3627685023452209, 0.08610681767687592, -0.31095233146120743, -0.12212471294470366, 0.19739087256700463, -0.17025133407874649, 0.03979572625489447, 0.13228694584719833, 0.04898004832126551, -0.04035846972483008, -0.28301599220718937, 0.2997386424853442, -0.001319988875885138, 0.335704987634617, 0.01284152491588672, 0.12197424276336949, -0.04845282027293094, -0.09019465263230794, 0.007758303401572386, -0.035440682701498916, 0.1579105393529543, 0.30847742751299245, 0.1909689663114582, 0.2487528435428778, -0.39744801343423536, -0.19818186334758528, 0.04090048933154245, 0.19393289309416786, 0.07906040348690394, -0.018489506431484684, -0.41507249046970374, 0.1386375713566835, -0.11019966154266636, 0.07790068922203561, -0.10092168777001076, 0.0076579997286746635, -0.010359050183379, -0.23912083498246148, 0.0707278039144274, 0.11967330665044341, 0.06888144729402665, -0.028600667526516382, -0.13353499374718097, 0.05235267627779492, 0.16090359241477364, 0.017259655242385978, 0.09375883083234673, 0.1557016542634844, -0.18439051833525494, -0.15161097971771245, 0.4031311254704576, -0.05067069426846949, -0.21204353488386848, 0.19359502023151778, -0.04618532388441811, -0.13258667267780966, 0.13071096867185175, 0.17589185342219468, 0.1708729827608709, -0.11158350603344895, 0.0018284021781060202, -0.0307127200024378, 0.20161325854117645, 0.11617418406263033, -0.05016925037024526, 0.1978759166287229, 0.2219807660567979, 0.003919290282083334, 0.09981315933638472, -0.2050995319272289, -0.04630605764053177, -0.2084492660659068, -0.10983291777650489, -0.17235216217515356, -0.07733723342007864, -0.12196608432816983, -0.12875656039376027, 0.3876799785029826, 0.23112486061854629, 0.2442853924091808, 0.08704126302545392, 0.3463944947220268, -0.0016462108368999983, 0.09011168380911555, 0.08174222898888962, 0.15379184714752536, -0.02864505909139495, 0.10841484972414761, -0.10555550000457829, 0.061429301837546975, 0.12995108351762363] |
1,802.08949 | OhioState at SemEval-2018 Task 7: Exploiting Data Augmentation for
Relation Classification in Scientific Papers using Piecewise Convolutional
Neural Networks | We describe our system for SemEval-2018 Shared Task on Semantic Relation
Extraction and Classification in Scientific Papers where we focus on the
Classification task. Our simple piecewise convolution neural encoder performs
decently in an end to end manner. A simple inter-task data augmentation
signifi- cantly boosts the performance of the model. Our best-performing
systems stood 8th out of 20 teams on the classification task on noisy data and
12th out of 28 teams on the classification task on clean data.
| cs.CL | we describe our system for semeval2018 shared task on semantic relation extraction and classification in scientific papers where we focus on the classification task our simple piecewise convolution neural encoder performs decently in an end to end manner a simple intertask data augmentation signifi cantly boosts the performance of the model our bestperforming systems stood 8th out of 20 teams on the classification task on noisy data and 12th out of 28 teams on the classification task on clean data | [['we', 'describe', 'our', 'system', 'for', 'semeval2018', 'shared', 'task', 'on', 'semantic', 'relation', 'extraction', 'and', 'classification', 'in', 'scientific', 'papers', 'where', 'we', 'focus', 'on', 'the', 'classification', 'task', 'our', 'simple', 'piecewise', 'convolution', 'neural', 'encoder', 'performs', 'decently', 'in', 'an', 'end', 'to', 'end', 'manner', 'a', 'simple', 'intertask', 'data', 'augmentation', 'signifi', 'cantly', 'boosts', 'the', 'performance', 'of', 'the', 'model', 'our', 'bestperforming', 'systems', 'stood', '8th', 'out', 'of', '20', 'teams', 'on', 'the', 'classification', 'task', 'on', 'noisy', 'data', 'and', '12th', 'out', 'of', '28', 'teams', 'on', 'the', 'classification', 'task', 'on', 'clean', 'data']] | [-0.0800792355730664, -0.06371065737457685, -0.043005203327629714, 0.029096642980584876, -0.10112522373092361, -0.15950062139309013, 0.10311799671326298, 0.43203863627277317, -0.2106913645984605, -0.3420677126268856, 0.07846348336606752, -0.3042403005529195, -0.15005672930274158, 0.24002997397619766, -0.16537273191497662, 0.0625255640828982, 0.18334197625154047, 0.08499295915826224, -0.06869962303899228, -0.38816355129238217, 0.30581142717273907, 0.07854122574208304, 0.3907435722183436, -0.010911626415327192, 0.12458139731170377, 0.0008650407136883587, -0.10585020837534102, -0.09099990989343495, -0.02916874993243255, 0.13004848022246734, 0.30385386827401817, 0.15700716286810348, 0.27842465857393106, -0.3427801895188168, -0.1359095694264397, 0.0346584154642187, 0.08675031522870995, 0.06764009795151651, 0.03308467583556194, -0.3457727914559655, 0.03323852655885275, -0.1963802285026759, 0.09040877878433093, -0.1378902414580807, 0.004084413987584412, -0.07127004754729568, -0.2198349475977011, 0.05340824545128271, 0.11051252481993287, 0.13250159610179252, -0.06402956030797213, -0.11553092576068594, 0.029193928834865802, 0.17737458008923568, -0.02027544275770197, 0.08011350746965036, 0.1251456734142266, -0.17756127513712272, -0.14864848845318193, 0.36420999532565473, -0.04229454630694818, -0.19394069891422988, 0.23394100090954453, -0.03225042409612797, -0.23520052415115061, 0.02048794617294334, 0.2906783319776878, 0.10297463723109104, -0.16809471361339093, -0.011766468816495035, -0.058738579205237326, 0.22528331321664155, 0.06002897155995015, -0.11475410291095614, 0.1702899175841594, 0.2957503041718155, 0.025766683951951565, 0.11891319857459166, -0.10005502693238669, -0.05787903510499746, -0.22412891644053162, -0.08597488202503882, -0.18563351207121742, -0.007722495240159333, -0.08214134662957803, -0.11214654345531017, 0.42309565558098255, 0.19706858921563253, 0.18596265838714315, 0.12878551160392818, 0.33494047218700873, -0.008261447427503298, 0.08621616515447386, 0.09627420440956484, 0.18223160137422384, -0.00730599972885102, 0.14352790487464517, -0.16643391873221844, 0.038058128074044364, 0.0722649143775925] |
1,802.0895 | Multi-Segment Reconstruction Using Invariant Features | Multi-segment reconstruction (MSR) problem consists of recovering a signal
from noisy segments with unknown positions of the observation windows. One
example arises in DNA sequence assembly, which is typically solved by matching
short reads to form longer sequences. Instead of trying to locate the segment
within the sequence through pair-wise matching, we propose a new approach that
uses shift-invariant features to estimate both the underlying signal and the
distribution of the positions of the segments. Using the invariant features, we
formulate the problem as a constrained nonlinear least-squares. The
non-convexity of the problem leads to its sensitivity to the initialization.
However, with clean data, we show empirically that for longer segment lengths,
random initialization achieves exact recovery. Furthermore, we compare the
performance of our approach to the results of expectation maximization and
demonstrate that the new approach is robust to noise and computationally more
efficient.
| eess.SP | multisegment reconstruction msr problem consists of recovering a signal from noisy segments with unknown positions of the observation windows one example arises in dna sequence assembly which is typically solved by matching short reads to form longer sequences instead of trying to locate the segment within the sequence through pairwise matching we propose a new approach that uses shiftinvariant features to estimate both the underlying signal and the distribution of the positions of the segments using the invariant features we formulate the problem as a constrained nonlinear leastsquares the nonconvexity of the problem leads to its sensitivity to the initialization however with clean data we show empirically that for longer segment lengths random initialization achieves exact recovery furthermore we compare the performance of our approach to the results of expectation maximization and demonstrate that the new approach is robust to noise and computationally more efficient | [['multisegment', 'reconstruction', 'msr', 'problem', 'consists', 'of', 'recovering', 'a', 'signal', 'from', 'noisy', 'segments', 'with', 'unknown', 'positions', 'of', 'the', 'observation', 'windows', 'one', 'example', 'arises', 'in', 'dna', 'sequence', 'assembly', 'which', 'is', 'typically', 'solved', 'by', 'matching', 'short', 'reads', 'to', 'form', 'longer', 'sequences', 'instead', 'of', 'trying', 'to', 'locate', 'the', 'segment', 'within', 'the', 'sequence', 'through', 'pairwise', 'matching', 'we', 'propose', 'a', 'new', 'approach', 'that', 'uses', 'shiftinvariant', 'features', 'to', 'estimate', 'both', 'the', 'underlying', 'signal', 'and', 'the', 'distribution', 'of', 'the', 'positions', 'of', 'the', 'segments', 'using', 'the', 'invariant', 'features', 'we', 'formulate', 'the', 'problem', 'as', 'a', 'constrained', 'nonlinear', 'leastsquares', 'the', 'nonconvexity', 'of', 'the', 'problem', 'leads', 'to', 'its', 'sensitivity', 'to', 'the', 'initialization', 'however', 'with', 'clean', 'data', 'we', 'show', 'empirically', 'that', 'for', 'longer', 'segment', 'lengths', 'random', 'initialization', 'achieves', 'exact', 'recovery', 'furthermore', 'we', 'compare', 'the', 'performance', 'of', 'our', 'approach', 'to', 'the', 'results', 'of', 'expectation', 'maximization', 'and', 'demonstrate', 'that', 'the', 'new', 'approach', 'is', 'robust', 'to', 'noise', 'and', 'computationally', 'more', 'efficient']] | [-0.09787836505726365, 0.02148397238282808, -0.0875363888283228, 0.07142642560447085, -0.07232718111882949, -0.13591487474322062, 0.05210029336639905, 0.42601141125477593, -0.321017206711534, -0.3240233845751861, 0.11281660165364758, -0.25829975439299796, -0.16466301924605245, 0.15686204428945122, -0.08224003958066219, 0.08387903264876262, 0.11551598330542188, 0.03798651338137429, -0.08039038907254821, -0.22260596575616892, 0.265130640335927, 0.05007979802401929, 0.28906188608018746, -0.021913824712151083, 0.13540072255077418, 0.04996925558862758, -0.01857810470552569, -0.0069225241526447495, -0.08490399265865563, 0.16119688338648272, 0.2426044708872535, 0.17683395975478122, 0.2806415596848418, -0.39288177449127726, -0.171850437754444, 0.12603571267541627, 0.13386516281371486, 0.14974709362482075, -0.03537231486758362, -0.2716556089095257, 0.12813513427330503, -0.06145109848183548, -0.05196144602678973, -0.06200338751077652, -0.012036142729479692, 0.003166182328754201, -0.32848461818206925, 0.09558156823161347, 0.03646372002629756, -0.024451662542234208, -0.05805313280414276, -0.08694105757368278, 0.04910809135160826, 0.156098540005242, 0.052592295315116645, 0.03609886623493492, 0.11584299881460852, -0.11123175721230177, -0.10566240439657122, 0.37737418535197603, -0.08710020445849233, -0.208364509476413, 0.16065538034870708, -0.0653102544393262, -0.11603746094002292, 0.16997475117958824, 0.15627140160007724, 0.135326116480704, -0.16454588925016336, 0.018667211350262294, -0.04240685728185906, 0.19438157201551928, 0.04902235917136844, 0.02258542003832629, 0.1725921933555269, 0.18383861958723643, 0.09956511180077134, 0.19245640459903998, -0.1487082782940104, -0.0889692932881158, -0.25050853973832626, -0.07949022593354035, -0.22960380461580795, -0.010541419684886932, -0.08065718153525737, -0.19110154151145753, 0.4234775786817973, 0.21460300090329837, 0.25488269674623837, 0.13865162128470196, 0.3414034047806314, 0.08983825520002123, 0.05342337580092637, 0.06086443448760386, 0.1749603534566945, 0.07009288512716262, 0.03284314737759595, -0.2212983299223385, 0.07499462377344226, 0.05911265670739371] |
1,802.08951 | On the discrete analog of gamma-Lomax distribution: properties and
applications | This article represents how certain types of blockades in any industrial
(heavy industries) production, in particular, industrial strikes can be modeled
with the proposed discrete probabilistic distribution as a baseline
distribution. We considered the number of outbreaks of strikes in the coal
mining industry, the vehicle manufacturing industry, and the transpose industry
in the UK obtained from Consul (1989). We fitted those data sets with the
proposed discrete gamma-Lomax distribution and compared the fit with the
discrete generalized Pareto distribution (Consul, 1989). For this purpose, we
explore the basic properties of the discrete gamma-Lomax distribution including
but not limited to: cumulative distribution, survival, probability mass,
quantile and hazard functions, genesis and rth-order moments; consider maximum
likelihood estimation under the normal set up as well as under the censored
data set scenario. It is observed that the newly proposed model can be useful
to describe strikes arising from various types of industries.
| math.ST stat.TH | this article represents how certain types of blockades in any industrial heavy industries production in particular industrial strikes can be modeled with the proposed discrete probabilistic distribution as a baseline distribution we considered the number of outbreaks of strikes in the coal mining industry the vehicle manufacturing industry and the transpose industry in the uk obtained from consul 1989 we fitted those data sets with the proposed discrete gammalomax distribution and compared the fit with the discrete generalized pareto distribution consul 1989 for this purpose we explore the basic properties of the discrete gammalomax distribution including but not limited to cumulative distribution survival probability mass quantile and hazard functions genesis and rthorder moments consider maximum likelihood estimation under the normal set up as well as under the censored data set scenario it is observed that the newly proposed model can be useful to describe strikes arising from various types of industries | [['this', 'article', 'represents', 'how', 'certain', 'types', 'of', 'blockades', 'in', 'any', 'industrial', 'heavy', 'industries', 'production', 'in', 'particular', 'industrial', 'strikes', 'can', 'be', 'modeled', 'with', 'the', 'proposed', 'discrete', 'probabilistic', 'distribution', 'as', 'a', 'baseline', 'distribution', 'we', 'considered', 'the', 'number', 'of', 'outbreaks', 'of', 'strikes', 'in', 'the', 'coal', 'mining', 'industry', 'the', 'vehicle', 'manufacturing', 'industry', 'and', 'the', 'transpose', 'industry', 'in', 'the', 'uk', 'obtained', 'from', 'consul', '1989', 'we', 'fitted', 'those', 'data', 'sets', 'with', 'the', 'proposed', 'discrete', 'gammalomax', 'distribution', 'and', 'compared', 'the', 'fit', 'with', 'the', 'discrete', 'generalized', 'pareto', 'distribution', 'consul', '1989', 'for', 'this', 'purpose', 'we', 'explore', 'the', 'basic', 'properties', 'of', 'the', 'discrete', 'gammalomax', 'distribution', 'including', 'but', 'not', 'limited', 'to', 'cumulative', 'distribution', 'survival', 'probability', 'mass', 'quantile', 'and', 'hazard', 'functions', 'genesis', 'and', 'rthorder', 'moments', 'consider', 'maximum', 'likelihood', 'estimation', 'under', 'the', 'normal', 'set', 'up', 'as', 'well', 'as', 'under', 'the', 'censored', 'data', 'set', 'scenario', 'it', 'is', 'observed', 'that', 'the', 'newly', 'proposed', 'model', 'can', 'be', 'useful', 'to', 'describe', 'strikes', 'arising', 'from', 'various', 'types', 'of', 'industries']] | [-0.009088455011830634, 0.0776132918806784, -0.08645775449312224, 0.1049698471019807, -0.0387790973842044, -0.10525249268222076, 0.048765160524655106, 0.3642714047310686, -0.27505220538442765, -0.3270808915270105, 0.11222210716481176, -0.27921512766097417, -0.10595478919403464, 0.17875941989524602, -0.1247478687210671, 0.10898231806846073, 0.02253716690903342, -0.0049053841214252, 0.0003331608760901946, -0.23758648477429087, 0.26761026946584, 0.03193994401915049, 0.3559775988715107, 0.018460123592693882, 0.07273890091975113, 0.02653844317033787, -0.0441081433509314, -0.028631635116500742, -0.10340192746364195, 0.1042962851215329, 0.27233999842721596, 0.20026034653036787, 0.2660267376046469, -0.38586784652965583, -0.22586183251200506, 0.16949757336695123, 0.083772596600778, 0.0003766250496202042, -0.038166578984100544, -0.26651591598837565, 0.023948598038967723, -0.24957331016365963, -0.15942552958717868, -0.05621466443767684, 0.0006118776157948395, 0.09573232898201119, -0.31441779283731675, 0.06704887372110314, 0.004628970981934951, 0.052229069268655955, -0.031837581284969246, -0.17012539305630447, -0.042789136808859374, 0.12817996291712477, 0.09970701293357266, -0.0565948237246215, 0.1290509722438944, -0.11400648758409938, -0.10195109437551074, 0.39225280506773885, -0.05332151671946549, -0.1726407734333419, 0.1564677404755439, -0.12825172130899792, -0.14251136735094175, 0.0729522055246236, 0.2280527781472454, 0.07079768408989946, -0.2053205931509201, 0.04562593659467295, -0.05923389625616822, 0.10199875917891978, 0.10404584630417493, -0.048767596863728994, 0.17709597412671818, 0.19191291992593207, 0.045741858767133034, 0.16178489242517857, -0.1255955649727343, -0.14196165968607735, -0.2857298142942381, -0.11282797299025443, -0.18111302571577464, 0.00749988689397121, -0.08178799603432854, -0.1728311663105984, 0.38519304511356073, 0.14500599185742388, 0.1681744657869407, 0.06262593296193987, 0.2897952371808207, 0.1121758836778209, 0.029513375730497525, 0.08282929451529862, 0.15235246446775896, 0.07342287255826112, 0.10675947225633883, -0.1500699217571883, 0.16173723140956472, -0.014707963943368936] |
1,802.08952 | Efficient nonparametric causal inference with missing exposure
information | Missing exposure information is a very common feature of many observational
studies. Here we study identifiability and efficient estimation of causal
effects on vector outcomes, in such cases where treatment is unconfounded but
partially missing. We consider a missing at random setting where missingness in
treatment can depend not only on complex covariates, but also on post-treatment
outcomes. We give a new identifying expression for average treatment effects in
this setting, along with the efficient influence function for this parameter in
a nonparametric model, which yields a nonparametric efficiency bound. We use
this latter result to construct nonparametric estimators that are less
sensitive to the curse of dimensionality than usual, e.g., by having faster
rates of convergence than the complex nuisance estimators they rely on. Further
we show that these estimators can be root-n consistent and asymptotically
normal under weak nonparametric conditions, even when constructed using
flexible machine learning. Finally we apply these results to the problem of
causal inference with a partially missing instrumental variable.
| stat.ME | missing exposure information is a very common feature of many observational studies here we study identifiability and efficient estimation of causal effects on vector outcomes in such cases where treatment is unconfounded but partially missing we consider a missing at random setting where missingness in treatment can depend not only on complex covariates but also on posttreatment outcomes we give a new identifying expression for average treatment effects in this setting along with the efficient influence function for this parameter in a nonparametric model which yields a nonparametric efficiency bound we use this latter result to construct nonparametric estimators that are less sensitive to the curse of dimensionality than usual eg by having faster rates of convergence than the complex nuisance estimators they rely on further we show that these estimators can be rootn consistent and asymptotically normal under weak nonparametric conditions even when constructed using flexible machine learning finally we apply these results to the problem of causal inference with a partially missing instrumental variable | [['missing', 'exposure', 'information', 'is', 'a', 'very', 'common', 'feature', 'of', 'many', 'observational', 'studies', 'here', 'we', 'study', 'identifiability', 'and', 'efficient', 'estimation', 'of', 'causal', 'effects', 'on', 'vector', 'outcomes', 'in', 'such', 'cases', 'where', 'treatment', 'is', 'unconfounded', 'but', 'partially', 'missing', 'we', 'consider', 'a', 'missing', 'at', 'random', 'setting', 'where', 'missingness', 'in', 'treatment', 'can', 'depend', 'not', 'only', 'on', 'complex', 'covariates', 'but', 'also', 'on', 'posttreatment', 'outcomes', 'we', 'give', 'a', 'new', 'identifying', 'expression', 'for', 'average', 'treatment', 'effects', 'in', 'this', 'setting', 'along', 'with', 'the', 'efficient', 'influence', 'function', 'for', 'this', 'parameter', 'in', 'a', 'nonparametric', 'model', 'which', 'yields', 'a', 'nonparametric', 'efficiency', 'bound', 'we', 'use', 'this', 'latter', 'result', 'to', 'construct', 'nonparametric', 'estimators', 'that', 'are', 'less', 'sensitive', 'to', 'the', 'curse', 'of', 'dimensionality', 'than', 'usual', 'eg', 'by', 'having', 'faster', 'rates', 'of', 'convergence', 'than', 'the', 'complex', 'nuisance', 'estimators', 'they', 'rely', 'on', 'further', 'we', 'show', 'that', 'these', 'estimators', 'can', 'be', 'rootn', 'consistent', 'and', 'asymptotically', 'normal', 'under', 'weak', 'nonparametric', 'conditions', 'even', 'when', 'constructed', 'using', 'flexible', 'machine', 'learning', 'finally', 'we', 'apply', 'these', 'results', 'to', 'the', 'problem', 'of', 'causal', 'inference', 'with', 'a', 'partially', 'missing', 'instrumental', 'variable']] | [-0.04853748368351448, 0.08447503439341504, -0.08891619219169784, 0.14729482089926724, -0.12842630972967944, -0.19030246675485768, 0.07805588464280702, 0.42422854723072195, -0.2150620599880433, -0.27834497505787714, 0.1420516542815435, -0.2213206479539085, -0.14971984551198422, 0.20233190180705748, -0.13205317885710308, 0.05401368056008794, 0.09457490573278124, 0.006542827387716262, -0.07340542283904997, -0.2972852841302954, 0.3161883634902223, 0.05602092460128871, 0.2835986784954572, -0.02340176872276499, 0.10085299613896802, 0.07069547003673682, -0.058604443806268454, 0.05851845965792903, -0.13817236048678927, 0.10849124597349058, 0.28825213339219025, 0.15013014398941613, 0.34826280612004806, -0.3816152033410091, -0.25808643898926675, 0.15360467899478522, 0.13161267749907335, 0.12846942241051157, -0.024292057506313705, -0.23195537197801946, 0.06504453871545034, -0.14996206899263323, -0.04889855888414096, -0.1371616003249424, -0.05258477563375091, -0.03091520553381822, -0.35096812107129, 0.1616102367629373, 0.06811186453293874, 0.060238785546620835, -0.04749263531292777, -0.14378745046146887, 0.03442623778330499, 0.05240848402619637, 0.10257129552802183, -0.016340204566546734, 0.11086642705181092, -0.13869770066616272, -0.08688683514567429, 0.309089898715267, -0.043278471312691816, -0.2967060802010707, 0.209559595296496, -0.15124582787919566, -0.1927715621212587, 0.08433433367410698, 0.23610601452998367, 0.13630992866048297, -0.1658142027126924, 0.035448588452621714, -0.036980596101696954, 0.14059939721307482, 0.021585369140403456, 0.024761579118680255, 0.13458157924890338, 0.1589124216936551, 0.10559428306485819, 0.10895518835771448, -0.09104349711595709, -0.06722466327833483, -0.3034496791155852, -0.10419147670253584, -0.15745356387503626, 0.04190595977645471, -0.12805089061635866, -0.22408109511731258, 0.35770122140242033, 0.21820439608677863, 0.21765860502540796, 0.07979791801694938, 0.3085730280264292, 0.0939240679481482, 0.035990806523688045, 0.08240099537960556, 0.19865083609741316, 0.09832540687723422, -0.01714852012144065, -0.15261495644991085, 0.1952559956046472, -0.01119752078603235] |
1,802.08953 | Robust Target-relative Localization with Ultra-Wideband Ranging and
Communication | In this paper we propose a method to achieve relative positioning and
tracking of a target by a quadcopter using Ultra-wideband (UWB) ranging
sensors, which are strategically installed to help retrieve both relative
position and bearing between the quadcopter and target. To achieve robust
localization for autonomous flight even with uncertainty in the speed of the
target, two main features are developed. First, an estimator based on Extended
Kalman Filter (EKF) is developed to fuse UWB ranging measurements with data
from onboard sensors including inertial measurement unit (IMU), altimeters and
optical flow. Second, to properly handle the coupling of the target's
orientation with the range measurements, UWB based communication capability is
utilized to transfer the target's orientation to the quadcopter. Experiment
results demonstrate the ability of the quadcopter to control its position
relative to the target autonomously in both cases when the target is static and
moving.
| cs.SY cs.RO | in this paper we propose a method to achieve relative positioning and tracking of a target by a quadcopter using ultrawideband uwb ranging sensors which are strategically installed to help retrieve both relative position and bearing between the quadcopter and target to achieve robust localization for autonomous flight even with uncertainty in the speed of the target two main features are developed first an estimator based on extended kalman filter ekf is developed to fuse uwb ranging measurements with data from onboard sensors including inertial measurement unit imu altimeters and optical flow second to properly handle the coupling of the targets orientation with the range measurements uwb based communication capability is utilized to transfer the targets orientation to the quadcopter experiment results demonstrate the ability of the quadcopter to control its position relative to the target autonomously in both cases when the target is static and moving | [['in', 'this', 'paper', 'we', 'propose', 'a', 'method', 'to', 'achieve', 'relative', 'positioning', 'and', 'tracking', 'of', 'a', 'target', 'by', 'a', 'quadcopter', 'using', 'ultrawideband', 'uwb', 'ranging', 'sensors', 'which', 'are', 'strategically', 'installed', 'to', 'help', 'retrieve', 'both', 'relative', 'position', 'and', 'bearing', 'between', 'the', 'quadcopter', 'and', 'target', 'to', 'achieve', 'robust', 'localization', 'for', 'autonomous', 'flight', 'even', 'with', 'uncertainty', 'in', 'the', 'speed', 'of', 'the', 'target', 'two', 'main', 'features', 'are', 'developed', 'first', 'an', 'estimator', 'based', 'on', 'extended', 'kalman', 'filter', 'ekf', 'is', 'developed', 'to', 'fuse', 'uwb', 'ranging', 'measurements', 'with', 'data', 'from', 'onboard', 'sensors', 'including', 'inertial', 'measurement', 'unit', 'imu', 'altimeters', 'and', 'optical', 'flow', 'second', 'to', 'properly', 'handle', 'the', 'coupling', 'of', 'the', 'targets', 'orientation', 'with', 'the', 'range', 'measurements', 'uwb', 'based', 'communication', 'capability', 'is', 'utilized', 'to', 'transfer', 'the', 'targets', 'orientation', 'to', 'the', 'quadcopter', 'experiment', 'results', 'demonstrate', 'the', 'ability', 'of', 'the', 'quadcopter', 'to', 'control', 'its', 'position', 'relative', 'to', 'the', 'target', 'autonomously', 'in', 'both', 'cases', 'when', 'the', 'target', 'is', 'static', 'and', 'moving']] | [-0.07188679772859984, 0.05283970897789604, -0.05498969359766869, -0.057805677050673944, -0.07018514272129657, -0.20689323616727273, 0.0003493799506068914, 0.4627057955866413, -0.2582927942814521, -0.37168428799150144, 0.11353662726231756, -0.2731991851049773, -0.10206266044366623, 0.21438416278585284, -0.15890284576675012, 0.12065453086718347, 0.06921083692993436, 0.0563883067735908, -0.03210841892382168, -0.1660713582991806, 0.22938834901480953, 0.09653415845795757, 0.31606215197548626, -0.014270316098252831, 0.19575144020526916, 0.05016123270774323, -0.027248633797375525, -0.01763049379492475, -0.05354153069661183, 0.17064333064671683, 0.2917262713003549, 0.10973738272972151, 0.2544047775564297, -0.3953368422530946, -0.19126730663131694, 0.062161059856896295, 0.09383172556745256, 0.07354291528859334, -0.036847535493074075, -0.40515445908975034, 0.0888870199730455, -0.17477122196914996, -0.09603280690973814, -0.036896612216420724, -0.010894742673959863, 0.09027534309413512, -0.30117241080793344, -0.03460440297807459, -0.008666714296256886, 0.07083781024909952, -0.12059790403546518, -0.03203076631370077, 0.027033931578883307, 0.23699820314658343, -2.752137877249799e-05, 0.015970058533280682, 0.19643044194878162, -0.10372231343007159, -0.09960673919239012, 0.39865222629032976, -0.037550786164823644, -0.23364693367993142, 0.20150719087913024, -0.11488409221907254, -0.03496234261962984, 0.12237201630752408, 0.26348339890974865, 0.11738924046370144, -0.1800310519722102, -0.00782182511634377, 0.036619183879827155, 0.20526684643574009, 0.04000056042735066, 0.030083501125352463, 0.16307518079553787, 0.19146856739578552, 0.1398446392798543, 0.09867333001013667, -0.2548424764108673, -0.0783732652174765, -0.23730755615092458, -0.11708949056064367, -0.17744460560026623, -0.05222011663551841, -0.02938435410676432, -0.0841099696335237, 0.36425045436742354, 0.24398806250850563, 0.17637959013053148, 0.04942802218862866, 0.3923940161515509, 0.04209349612819449, 0.05054184296453486, 0.04916748579046657, 0.2786845308253352, 0.09656843016095155, 0.1260151760240852, -0.22324371910958907, 0.04577298601455733, 0.004705121984616632] |
1,802.08954 | Polarization as a probe of dusty environments around Type Ia supernovae:
radiative transfer models for SN 2012dn | Geometry of circumstellar (CS) medium around supernovae (SNe) provides
important diagnostics to understand the nature of their progenitors. In this
paper, properties of CS dust around SN 2012dn, a super-Chandrasekhar candidate
Type Ia supernova (SC-SN), have been studied through detailed three dimensional
radiation transfer simulations. With the detected near-infrared excess from SN
2012dn, we show that it has a disk-like dusty CS environment whose mass is
roughly consistent with a branch of an accreting white dwarf system (the single
degenerate scenario). We show that a similar system should produce polarization
signals up to $\sim 8$ \% in the $B$ band, depending on the viewing direction
if polarimetric observation is performed. We predict that the maximum
polarization is reached around $\sim 60$ days after the $B$-band maximum. We
show that the temporal and wavelength dependence of the polarization signals,
together with other unique features, can be easily distinguished from the
interstellar polarization and intrinsic SN polarization. Indeed, the small
polarization degree observed for normal Type Ia SNe (SNe Ia) can constrain a
parameter space in the CS dust mass and distribution. We thus encourage
multi-band polarimetric observations for SNe Ia, especially for outliers
including SC-SNe for which some arguments for the single degenerate scenario
exist but the polarization data are very rare so far.
| astro-ph.HE astro-ph.SR | geometry of circumstellar cs medium around supernovae sne provides important diagnostics to understand the nature of their progenitors in this paper properties of cs dust around sn 2012dn a superchandrasekhar candidate type ia supernova scsn have been studied through detailed three dimensional radiation transfer simulations with the detected nearinfrared excess from sn 2012dn we show that it has a disklike dusty cs environment whose mass is roughly consistent with a branch of an accreting white dwarf system the single degenerate scenario we show that a similar system should produce polarization signals up to sim 8 in the b band depending on the viewing direction if polarimetric observation is performed we predict that the maximum polarization is reached around sim 60 days after the bband maximum we show that the temporal and wavelength dependence of the polarization signals together with other unique features can be easily distinguished from the interstellar polarization and intrinsic sn polarization indeed the small polarization degree observed for normal type ia sne sne ia can constrain a parameter space in the cs dust mass and distribution we thus encourage multiband polarimetric observations for sne ia especially for outliers including scsne for which some arguments for the single degenerate scenario exist but the polarization data are very rare so far | [['geometry', 'of', 'circumstellar', 'cs', 'medium', 'around', 'supernovae', 'sne', 'provides', 'important', 'diagnostics', 'to', 'understand', 'the', 'nature', 'of', 'their', 'progenitors', 'in', 'this', 'paper', 'properties', 'of', 'cs', 'dust', 'around', 'sn', '2012dn', 'a', 'superchandrasekhar', 'candidate', 'type', 'ia', 'supernova', 'scsn', 'have', 'been', 'studied', 'through', 'detailed', 'three', 'dimensional', 'radiation', 'transfer', 'simulations', 'with', 'the', 'detected', 'nearinfrared', 'excess', 'from', 'sn', '2012dn', 'we', 'show', 'that', 'it', 'has', 'a', 'disklike', 'dusty', 'cs', 'environment', 'whose', 'mass', 'is', 'roughly', 'consistent', 'with', 'a', 'branch', 'of', 'an', 'accreting', 'white', 'dwarf', 'system', 'the', 'single', 'degenerate', 'scenario', 'we', 'show', 'that', 'a', 'similar', 'system', 'should', 'produce', 'polarization', 'signals', 'up', 'to', 'sim', '8', 'in', 'the', 'b', 'band', 'depending', 'on', 'the', 'viewing', 'direction', 'if', 'polarimetric', 'observation', 'is', 'performed', 'we', 'predict', 'that', 'the', 'maximum', 'polarization', 'is', 'reached', 'around', 'sim', '60', 'days', 'after', 'the', 'bband', 'maximum', 'we', 'show', 'that', 'the', 'temporal', 'and', 'wavelength', 'dependence', 'of', 'the', 'polarization', 'signals', 'together', 'with', 'other', 'unique', 'features', 'can', 'be', 'easily', 'distinguished', 'from', 'the', 'interstellar', 'polarization', 'and', 'intrinsic', 'sn', 'polarization', 'indeed', 'the', 'small', 'polarization', 'degree', 'observed', 'for', 'normal', 'type', 'ia', 'sne', 'sne', 'ia', 'can', 'constrain', 'a', 'parameter', 'space', 'in', 'the', 'cs', 'dust', 'mass', 'and', 'distribution', 'we', 'thus', 'encourage', 'multiband', 'polarimetric', 'observations', 'for', 'sne', 'ia', 'especially', 'for', 'outliers', 'including', 'scsne', 'for', 'which', 'some', 'arguments', 'for', 'the', 'single', 'degenerate', 'scenario', 'exist', 'but', 'the', 'polarization', 'data', 'are', 'very', 'rare', 'so', 'far']] | [-0.0673923636413232, 0.09502681428496561, -0.05607528315378212, 0.07584598544328298, -0.12600652296601286, -0.14855960103076934, 0.05512060396887256, 0.4407244808796161, -0.21747890713856388, -0.2853219057762785, 0.061204309915994154, -0.30259150485859587, -0.05238147988643076, 0.19103221610223628, -0.041098904994763666, -0.05902342376835152, 0.09333757388203423, -0.07344031492539216, -0.0963869590003632, -0.2647943953584818, 0.29108415262714327, 0.07107684067186881, 0.21205343090366782, -0.06397734148063222, 0.05579188470437657, -0.10231105339458599, -0.04110657668426492, -0.01488398815264139, -0.11805684270432223, 0.013593066613330453, 0.21389192607857008, 0.15915953311333345, 0.15320729340848355, -0.3623784832241242, -0.2857772594203575, 0.1371509020807351, 0.19015799630883606, 0.08509410658295548, -0.06759195779790697, -0.25582871337878116, 0.0782926485203547, -0.16217868971559582, -0.16875261173076722, 0.04089456747004868, 0.0254875696143399, 0.01176545194367755, -0.2592400980279737, 0.12120414938874331, 0.0228904385607303, 0.061594289339824033, -0.08476587564147403, -0.11689882906470096, -0.07972375281322044, 0.00025628023739148565, 0.029440132470006333, 0.02582656738253855, 0.08008652458114018, -0.1171411822492958, -0.006622687588393126, 0.41325070002837816, -0.08180867108397784, -0.009515641549852554, 0.20573636611708318, -0.21765713692524136, -0.1374033406565739, 0.1617402408139139, 0.16692912423508768, 0.11200796696577081, -0.1647778601639076, -0.013552588481787715, -0.018590296015696915, 0.1903924800484125, 0.03841857883841994, 0.12787742519967135, 0.32454682152964315, 0.14537632554980381, -0.0045269376407201705, 0.06581744778242933, -0.23041531146077862, 0.011166307467853053, -0.2609873150298504, -0.10919325119724611, -0.16882198318434916, 0.14052281410785894, -0.15227708617810937, -0.09605124692283219, 0.3498198171146214, 0.1014751943038614, 0.21455454195515727, -0.019188975544650776, 0.2617555742749487, 0.05834169940856057, 0.09114919380940506, 0.1028734323401707, 0.35967512882848923, 0.15888487879309873, 0.1174345435464825, -0.22655224203069493, 0.09455886604659751, -0.03677887790660673] |
1,802.08955 | On the Broadcast Routing Problem in Computer Networks | Given an undirected graph $G = (V, E)$, and a vertex $r\in V$, an $r$-acyclic
orientation of $G$ is an orientation $OE$ of the edges of $G$ such that the
digraph $OG = (V, OE)$ is acyclic and $r$ is the unique vertex with indegree
equal to 0. For $w\in \mathbb{R}^E_+$, $k(G, w)$ is the value of the
$w$-maximum packing of $r$-arborescences for all $r\in V$ and all $r$-acyclic
orientations $OE$ of $G$. In this case, the Broadcast Routing (in Computers
Networks) Problem (BRP) is to compute $k(G, w)$, by finding an optimal $r$ and
an optimal $r$-acyclic orientation. BRP is a mathematical formulation of
multipath broadcast routing in computer networks. In this paper, we provide a
polynomial time algorithm to solve BRP in outerplanar graphs. Outerplanar
graphs are encountered in many applications such as computational geometry,
robotics, etc.
| cs.DS math.CO math.OC | given an undirected graph g v e and a vertex rin v an racyclic orientation of g is an orientation oe of the edges of g such that the digraph og v oe is acyclic and r is the unique vertex with indegree equal to 0 for win mathbbre_ kg w is the value of the wmaximum packing of rarborescences for all rin v and all racyclic orientations oe of g in this case the broadcast routing in computers networks problem brp is to compute kg w by finding an optimal r and an optimal racyclic orientation brp is a mathematical formulation of multipath broadcast routing in computer networks in this paper we provide a polynomial time algorithm to solve brp in outerplanar graphs outerplanar graphs are encountered in many applications such as computational geometry robotics etc | [['given', 'an', 'undirected', 'graph', 'g', 'v', 'e', 'and', 'a', 'vertex', 'rin', 'v', 'an', 'racyclic', 'orientation', 'of', 'g', 'is', 'an', 'orientation', 'oe', 'of', 'the', 'edges', 'of', 'g', 'such', 'that', 'the', 'digraph', 'og', 'v', 'oe', 'is', 'acyclic', 'and', 'r', 'is', 'the', 'unique', 'vertex', 'with', 'indegree', 'equal', 'to', '0', 'for', 'win', 'mathbbre_', 'kg', 'w', 'is', 'the', 'value', 'of', 'the', 'wmaximum', 'packing', 'of', 'rarborescences', 'for', 'all', 'rin', 'v', 'and', 'all', 'racyclic', 'orientations', 'oe', 'of', 'g', 'in', 'this', 'case', 'the', 'broadcast', 'routing', 'in', 'computers', 'networks', 'problem', 'brp', 'is', 'to', 'compute', 'kg', 'w', 'by', 'finding', 'an', 'optimal', 'r', 'and', 'an', 'optimal', 'racyclic', 'orientation', 'brp', 'is', 'a', 'mathematical', 'formulation', 'of', 'multipath', 'broadcast', 'routing', 'in', 'computer', 'networks', 'in', 'this', 'paper', 'we', 'provide', 'a', 'polynomial', 'time', 'algorithm', 'to', 'solve', 'brp', 'in', 'outerplanar', 'graphs', 'outerplanar', 'graphs', 'are', 'encountered', 'in', 'many', 'applications', 'such', 'as', 'computational', 'geometry', 'robotics', 'etc']] | [-0.21563637267742583, 0.0677642247987322, 0.003496455334460557, -0.045680560800594405, -0.12589888436608573, -0.18666160784300362, 0.015715985399941956, 0.45781889366708806, -0.31963731901747966, -0.32357358314777174, 0.0463215877043966, -0.27299610000631924, -0.13293604020362915, 0.12320672956976428, -0.13394791742008347, 0.021553720881877497, 0.08138125987181356, 0.13281609458390992, 0.03270686516684216, -0.27570503233665244, 0.20399849064849707, -0.023749028735641223, 0.17891072066945593, 0.05367798279665077, 0.09260239378451857, 0.037620281606022994, 0.04202551585830637, 0.06681354029743529, -0.19428576401865097, 0.0658507056850523, 0.31315042492203804, 0.17130428082796176, 0.26657495555926614, -0.3437395562459506, -0.14177541521641968, 0.18428933371463097, 0.08042635776644656, 0.01473567163599516, 0.03008427049742261, -0.22537360748852978, 0.16244547955566713, -0.13727295255364932, -0.06404019070358308, 0.06757582280673642, 0.19625659621973982, 0.0017059159034223698, -0.3090507005230148, -0.04038097948503139, 0.08467608649950864, 0.06415466231697087, 0.02426007035563686, -0.1743489865060729, -0.0324501122778921, 0.1040745197774481, -0.09176963503444706, 0.13204355492367784, 0.05846931830868681, -0.17045432045263476, -0.19576335263285619, 0.4024684415476869, -0.011514868835724001, -0.1471506636033752, 0.08447455322376883, -0.06911733044909119, -0.14072205712706018, 0.11656702628859611, 0.15691728742598599, 0.15699964753741316, -0.10392000818835335, 0.17222315466914104, -0.09728871664504082, 0.1053991937877805, 0.1023770820022797, -0.026741378853764774, 0.09241781972432092, 0.13591687864304255, 0.20873190044493192, 0.1320047774803894, -0.01254626054233357, 0.04692072041138117, -0.27929515948991723, -0.12316347360819467, -0.22537058724069606, 0.0700422050274992, -0.19108068325805283, -0.1625285883531419, 0.38081977662366273, 0.1266052425428947, 0.17588093519600026, 0.08182031097613386, 0.22511506872772893, 0.08942378266043823, 0.007614635610900847, 0.20754639042798542, 0.11569713345040748, 0.20724286183318708, 0.05346669233056592, -0.19531265368907533, 0.0710681777485688, 0.08140072073620647] |
1,802.08956 | Muliti-scale regularity of axisymmetric Navier-Stokes equations | By applying the delicate \textit{a priori} estimates for the equations of
$(\Phi,\Gamma)$, which is introduced in the previous work, we obtain some
multi-scale regularity criteria of the swirl component $u^{\theta}$ for the 3D
axisymmetric Navier-Stokes equations. In particularly, the solution
$\mathbf{u}$ can be continued beyond the time $T$, provided that $u^{\theta}$
satiesfies $$ u^{\theta} \in
L^{p}_{T}L^{q_{v}}_{v}L^{q_{h},w}_{h},~~\frac{2}{p}+\frac{1}{q_{v}}+\frac{2}{q_{h}}\leq
1, ~2<q_{h}\leq\infty,~\frac{1}{q_{v}}+\frac{2}{q_{h}}<1. $$
| math.AP | by applying the delicate textita priori estimates for the equations of phigamma which is introduced in the previous work we obtain some multiscale regularity criteria of the swirl component utheta for the 3d axisymmetric navierstokes equations in particularly the solution mathbfu can be continued beyond the time t provided that utheta satiesfies utheta in lp_tlq_v_vlq_hw_hfrac2pfrac1q_vfrac2q_hleq 1 2q_hleqinftyfrac1q_vfrac2q_h1 | [['by', 'applying', 'the', 'delicate', 'textita', 'priori', 'estimates', 'for', 'the', 'equations', 'of', 'phigamma', 'which', 'is', 'introduced', 'in', 'the', 'previous', 'work', 'we', 'obtain', 'some', 'multiscale', 'regularity', 'criteria', 'of', 'the', 'swirl', 'component', 'utheta', 'for', 'the', '3d', 'axisymmetric', 'navierstokes', 'equations', 'in', 'particularly', 'the', 'solution', 'mathbfu', 'can', 'be', 'continued', 'beyond', 'the', 'time', 't', 'provided', 'that', 'utheta', 'satiesfies', 'utheta', 'in', 'lp_tlq_v_vlq_hw_hfrac2pfrac1q_vfrac2q_hleq', '1', '2q_hleqinftyfrac1q_vfrac2q_h1']] | [-0.14038215039504898, 0.04732847999764123, -0.09672052723666032, 0.042103049494067415, -0.09024152419253907, -0.12058006340844764, -0.026583763736265677, 0.25923137373670385, -0.2687647191859368, -0.24956535946370828, 0.15769191853124304, -0.24942718564394722, -0.08401003566191152, 0.18238402037294926, -0.0689604357574825, 0.12358020768604344, 0.04832048143725842, 0.0029360192862373812, -0.0616910396600832, -0.20242749072645824, 0.3399806200975069, -0.026744794738651427, 0.1813349739510428, -0.004057008669608169, 0.09755885097439643, -0.04398158505662448, -0.03612108281986029, 0.013531872795687782, -0.23359185990651626, 0.045450866826016595, 0.2092208900247459, 0.07839678144686062, 0.284473725059932, -0.4419649484463864, -0.22083803680207995, 0.06612434094185354, 0.18813266696546366, 0.08404340909543896, -0.04556254121578402, -0.3111759839941644, 0.13526864632688188, -0.10029866456709526, -0.1861916707087032, -0.08009393571841496, 0.019744722172617912, 0.07102849230998093, -0.34322574862313493, 0.14137132755584186, 0.13288006090334858, 0.05170725427429985, -0.1316113415243173, -0.11608944523700133, -0.023743830741969525, 0.08105598625520037, 0.07234398615913017, 0.08172665545889349, 0.012476597774635863, -0.14734078636737885, -0.006622961066939213, 0.34426650536005143, -0.0723177514521888, -0.3101642246323603, 0.11736576976599516, -0.16024719746955843, -0.11869174573156568, 0.12236370719727818, 0.11531507744695302, 0.15777622428032811, -0.14537496202521855, 0.1431952850220518, -0.0766126078001603, 0.14570648098123018, 0.0913743174082979, -0.05438560646682702, 0.04293594335171359, 0.11838778653354556, 0.10594359847406547, 0.0627015429458374, -0.0787363015546429, -0.05184650469433378, -0.3539260669645888, -0.17801037627806957, -0.16910145721501774, 0.08298024204042223, -0.13129548273152775, -0.12524010134102018, 0.341241791844368, 0.16500014586684605, 0.1347149625696518, 0.0421515527306366, 0.2680913092076985, 0.16293328902597917, 0.005160765564411391, 0.1271576413936499, 0.24774429627480762, 0.16214953573351656, 0.1626465499263119, -0.19019312826330187, 0.04416380055179751, 0.19296867270195098] |
1,802.08957 | Measuring quantum discord using the most distinguishable steered states | Any two-qubit state can be represented, geometrically, as an ellipsoid with a
certain size and a center located within the Bloch sphere of one of the qubits.
Points of this ellipsoid represent the post-measurement states when the other
qubit is measured. Based on the most demolition concept in the definition of
quantum discord, we study the amount of demolition when the two
post-measurement states, represented as two points on the steering ellipsoid,
have the most distinguishability. We use trace distance as a measure of
distinguishability and obtain the maximum distinguishability for some classes
of states, analytically. Using the optimum measurement that gives the most
distinguishable steered states, we extract quantum correlation of the state and
compare the result with the quantum discord. It is shown that there are some
important classes of states for which the most demolition happens exactly at
the most distinguished steered points. Correlations gathered from the most
distinguished post-measurement states provide a faithful and tight upper bound
touching the quantum discord in most of the cases.
| quant-ph cs.IT math.IT | any twoqubit state can be represented geometrically as an ellipsoid with a certain size and a center located within the bloch sphere of one of the qubits points of this ellipsoid represent the postmeasurement states when the other qubit is measured based on the most demolition concept in the definition of quantum discord we study the amount of demolition when the two postmeasurement states represented as two points on the steering ellipsoid have the most distinguishability we use trace distance as a measure of distinguishability and obtain the maximum distinguishability for some classes of states analytically using the optimum measurement that gives the most distinguishable steered states we extract quantum correlation of the state and compare the result with the quantum discord it is shown that there are some important classes of states for which the most demolition happens exactly at the most distinguished steered points correlations gathered from the most distinguished postmeasurement states provide a faithful and tight upper bound touching the quantum discord in most of the cases | [['any', 'twoqubit', 'state', 'can', 'be', 'represented', 'geometrically', 'as', 'an', 'ellipsoid', 'with', 'a', 'certain', 'size', 'and', 'a', 'center', 'located', 'within', 'the', 'bloch', 'sphere', 'of', 'one', 'of', 'the', 'qubits', 'points', 'of', 'this', 'ellipsoid', 'represent', 'the', 'postmeasurement', 'states', 'when', 'the', 'other', 'qubit', 'is', 'measured', 'based', 'on', 'the', 'most', 'demolition', 'concept', 'in', 'the', 'definition', 'of', 'quantum', 'discord', 'we', 'study', 'the', 'amount', 'of', 'demolition', 'when', 'the', 'two', 'postmeasurement', 'states', 'represented', 'as', 'two', 'points', 'on', 'the', 'steering', 'ellipsoid', 'have', 'the', 'most', 'distinguishability', 'we', 'use', 'trace', 'distance', 'as', 'a', 'measure', 'of', 'distinguishability', 'and', 'obtain', 'the', 'maximum', 'distinguishability', 'for', 'some', 'classes', 'of', 'states', 'analytically', 'using', 'the', 'optimum', 'measurement', 'that', 'gives', 'the', 'most', 'distinguishable', 'steered', 'states', 'we', 'extract', 'quantum', 'correlation', 'of', 'the', 'state', 'and', 'compare', 'the', 'result', 'with', 'the', 'quantum', 'discord', 'it', 'is', 'shown', 'that', 'there', 'are', 'some', 'important', 'classes', 'of', 'states', 'for', 'which', 'the', 'most', 'demolition', 'happens', 'exactly', 'at', 'the', 'most', 'distinguished', 'steered', 'points', 'correlations', 'gathered', 'from', 'the', 'most', 'distinguished', 'postmeasurement', 'states', 'provide', 'a', 'faithful', 'and', 'tight', 'upper', 'bound', 'touching', 'the', 'quantum', 'discord', 'in', 'most', 'of', 'the', 'cases']] | [-0.14075060994021923, 0.16139574095629058, -0.11017199479700888, 0.044452485930421115, 0.03713697975720553, -0.20072912480408217, 0.037168107274919746, 0.3050921467899838, -0.25033785006072484, -0.2541833775391912, 0.07206392783589442, -0.31395063916810184, -0.09515307093970478, 0.21760494106120484, -0.04362176518805106, 0.07457393130821668, 0.07949643910841961, 0.09415987898640144, -0.08235025078003459, -0.23535381367101388, 0.3421463895849336, -0.004385627787012388, 0.2547828996389666, 0.021043459542424363, 0.09148302197675495, 0.013822934732717626, 0.0642575351137887, 0.02747335244895272, -0.12137091752074947, 0.11371415736331769, 0.26465562784030816, 0.17529829469892907, 0.23021093115539235, -0.3962732021642082, -0.15510853658402887, 0.15399296766092233, 0.09059422499267385, 0.13676763245055232, -0.004199200686450829, -0.34142715530059137, -0.0013192442656659027, -0.12469514607287505, -0.10627698069986175, -0.05384443420985276, 0.01998964363216039, -0.052208628321943035, -0.1899090117391418, 0.07272768211824929, 0.05818140780388871, 0.04255781448566053, -0.01499385068549172, -0.09645303854691413, -0.03520212715546436, 0.1636440971225966, -0.0494630698381062, 0.014481394358581917, 0.14696748062749118, -0.1099796649054898, -0.15766203021596406, 0.3527755739386467, -0.023010636496302837, -0.23510912078268387, 0.16831038537407841, -0.15681710974450278, -0.0946222645449726, 0.034312367515967175, 0.10051728086546063, 0.10827255173490438, -0.11164480710508275, 0.023788355448392823, -0.07956929415163091, 0.17797726140193204, 0.08868233799413942, 0.14955609057317762, 0.20785396502366946, 0.057820867582032566, 0.13841405142824548, 0.20208195035297916, -0.11027744590743062, -0.13975954096052137, -0.3398095428395797, -0.20159528571461766, -0.2874105779180194, 0.08090932659311768, -0.0807694201135104, -0.14314433297412882, 0.4227148067425279, 0.09934737985090845, 0.22987727615434458, 0.010160718485499006, 0.2521741720354732, 0.12283991744591143, 0.04000284709515708, 0.11890740318442969, 0.28643932076451806, 0.17229209226651993, -0.015433517947573873, -0.2148858729215777, 0.10142213820534594, 0.03467559193754021] |
1,802.08958 | Group theory approach to unification of gravity with internal symmetry
gauge interactions: I. Canonical electrogravity | The infinite group of deformed diffeomorphisms of the spacetime continuum is
put into the basis of the gauge theory of gravity. This gives rise to some new
ways for unification of gravity with other gauge interactions.
| gr-qc hep-th | the infinite group of deformed diffeomorphisms of the spacetime continuum is put into the basis of the gauge theory of gravity this gives rise to some new ways for unification of gravity with other gauge interactions | [['the', 'infinite', 'group', 'of', 'deformed', 'diffeomorphisms', 'of', 'the', 'spacetime', 'continuum', 'is', 'put', 'into', 'the', 'basis', 'of', 'the', 'gauge', 'theory', 'of', 'gravity', 'this', 'gives', 'rise', 'to', 'some', 'new', 'ways', 'for', 'unification', 'of', 'gravity', 'with', 'other', 'gauge', 'interactions']] | [-0.18016460127869827, 0.193292033755117, -0.18209479535289574, 0.08740131665642063, -0.1405149519753953, -0.1649259589612484, -0.027455564371646486, 0.26983983333533007, -0.20595518478916752, -0.27280904703851167, 0.013450194978051715, -0.21528250579204825, -0.09137515113171604, 0.10149345164083773, -0.04698643372911546, -0.05005830726844983, -0.07666566880005929, 0.05408140018375383, -0.09618277930551106, -0.2449022572901514, 0.37480824765387094, 0.05225628997302718, 0.21333268750458956, 0.02085328691949447, 0.13263345604193294, -0.02984626526530418, -0.03783004505870243, 0.021312790741730068, -0.09260204387828708, 0.18340760676397216, 0.17788671818561852, 0.06910268325979511, 0.19861481923403013, -0.45184577590165037, -0.2537711001932621, 0.03914387462039789, 0.1356191368152698, 0.15489126317616966, -0.048855085973627865, -0.3665483938400737, -0.03193048403287927, -0.20262119225743744, -0.1826643648156379, -0.06739315129299131, 0.024558337250103552, -0.09073289918402831, -0.2048667804079337, 0.034300102089117795, 0.046244002322459385, 0.04050203267898825, -0.06065204197592619, -0.064137888710118, -0.04011534925343262, 0.11093263806671733, 0.17220197428509387, 0.06099609021718303, 0.08376562719543774, -0.13239555029172656, -0.11581445718184114, 0.4967768340268069, -0.07996998132309979, -0.25345400669094587, 0.19195822080493802, -0.17193585882584253, -0.22866855109006995, 0.10133380634296271, 0.14004196826782492, 0.06583366408530208, -0.11088239132530159, 0.22497489662944442, -0.06501207073840003, 0.08726701952723993, 0.04095015317822496, 0.08925030569338964, 0.2704473580233753, 0.11533924489695993, 0.08635443705134094, 0.12310862443054146, 0.03909072492064701, -0.10549370901814352, -0.4457518230709765, -0.15649077614458898, -0.03479944617073569, 0.09762120373650557, -0.1644495193872394, -0.19354144235452017, 0.38510053796279764, 0.14310349599044356, 0.10724143689731136, 0.08319719528986348, 0.1544468816783693, 0.1030911919919567, 0.09872197443878071, -0.03988042004251232, 0.26043631430446923, 0.22340276491983482, -0.029782020655046735, -0.22443887908270377, -0.13664364523719996, 0.19844330682988381] |
1,802.08959 | Parity Anomaly and Duality Web | We review the parity anomaly and a duality web in 2+1 dimensions. An odd
dimensional non-interacting Dirac fermion theory is not parity invariant at
quantum level. We demonstrate the parity anomaly in a three dimensional
non-interacting Dirac fermion theory and a one dimensional non-interacting
Dirac fermion theory. These theories can generate non-gauge invariant Abelian
Chern-Simons terms at a finite temperature through an effective action. The
parity anomaly also leads us to study the duality web in 2+1 dimensions, in
which the 2+1 dimensional duality web begins from the conjecture of a duality
between a three dimensional Dirac fermion theory and a three dimensional
interacting scalar field theory at the Wilson-Fisher fixed point. We first
review the duality web for the flat background, then we discuss its extension
to the spin$_c$ manifold to avoid inconsistency from the spin structure. This
also leads a global effect. We discuss that the composite fermions approach of
the quantum Hall system also suffers from the same issue of the global
description. Finally, we use perspective of the electric-magnetic duality of
the Abelian gauge theory in 3+1 dimensions to study the 2+1 dimensional duality
web.
| hep-th | we review the parity anomaly and a duality web in 21 dimensions an odd dimensional noninteracting dirac fermion theory is not parity invariant at quantum level we demonstrate the parity anomaly in a three dimensional noninteracting dirac fermion theory and a one dimensional noninteracting dirac fermion theory these theories can generate nongauge invariant abelian chernsimons terms at a finite temperature through an effective action the parity anomaly also leads us to study the duality web in 21 dimensions in which the 21 dimensional duality web begins from the conjecture of a duality between a three dimensional dirac fermion theory and a three dimensional interacting scalar field theory at the wilsonfisher fixed point we first review the duality web for the flat background then we discuss its extension to the spin_c manifold to avoid inconsistency from the spin structure this also leads a global effect we discuss that the composite fermions approach of the quantum hall system also suffers from the same issue of the global description finally we use perspective of the electricmagnetic duality of the abelian gauge theory in 31 dimensions to study the 21 dimensional duality web | [['we', 'review', 'the', 'parity', 'anomaly', 'and', 'a', 'duality', 'web', 'in', '21', 'dimensions', 'an', 'odd', 'dimensional', 'noninteracting', 'dirac', 'fermion', 'theory', 'is', 'not', 'parity', 'invariant', 'at', 'quantum', 'level', 'we', 'demonstrate', 'the', 'parity', 'anomaly', 'in', 'a', 'three', 'dimensional', 'noninteracting', 'dirac', 'fermion', 'theory', 'and', 'a', 'one', 'dimensional', 'noninteracting', 'dirac', 'fermion', 'theory', 'these', 'theories', 'can', 'generate', 'nongauge', 'invariant', 'abelian', 'chernsimons', 'terms', 'at', 'a', 'finite', 'temperature', 'through', 'an', 'effective', 'action', 'the', 'parity', 'anomaly', 'also', 'leads', 'us', 'to', 'study', 'the', 'duality', 'web', 'in', '21', 'dimensions', 'in', 'which', 'the', '21', 'dimensional', 'duality', 'web', 'begins', 'from', 'the', 'conjecture', 'of', 'a', 'duality', 'between', 'a', 'three', 'dimensional', 'dirac', 'fermion', 'theory', 'and', 'a', 'three', 'dimensional', 'interacting', 'scalar', 'field', 'theory', 'at', 'the', 'wilsonfisher', 'fixed', 'point', 'we', 'first', 'review', 'the', 'duality', 'web', 'for', 'the', 'flat', 'background', 'then', 'we', 'discuss', 'its', 'extension', 'to', 'the', 'spin_c', 'manifold', 'to', 'avoid', 'inconsistency', 'from', 'the', 'spin', 'structure', 'this', 'also', 'leads', 'a', 'global', 'effect', 'we', 'discuss', 'that', 'the', 'composite', 'fermions', 'approach', 'of', 'the', 'quantum', 'hall', 'system', 'also', 'suffers', 'from', 'the', 'same', 'issue', 'of', 'the', 'global', 'description', 'finally', 'we', 'use', 'perspective', 'of', 'the', 'electricmagnetic', 'duality', 'of', 'the', 'abelian', 'gauge', 'theory', 'in', '31', 'dimensions', 'to', 'study', 'the', '21', 'dimensional', 'duality', 'web']] | [-0.1608043211332409, 0.18808226795542476, -0.09207380055628529, 0.10066730497779433, -0.07169319928879973, -0.1690985811948185, 0.0291239650939744, 0.2837010604679269, -0.22001479058304713, -0.27255843031508403, 0.03138273285403749, -0.2798802399005071, -0.1938817640273738, 0.06950101277066602, -0.010175455001887506, 0.007763613729612044, -0.0518650772252056, 0.08825187773626081, -0.16555466270443822, -0.2901165753506893, 0.36875659981791775, 0.0030798768986844355, 0.3273522178383751, 0.09611894889049745, 0.11007000671985445, 0.027220857652426555, -0.006523212483867254, 0.03772386338896852, -0.07959093963475584, 0.10056087456485897, 0.24497471381195637, 0.016095891920110537, 0.14444727042724412, -0.40160738087934317, -0.19917483041407885, 0.06468297772740246, 0.11386146157962719, 0.1568328023256202, -0.06541400548395893, -0.3001970490687108, 0.054128738935721454, -0.2003975766242812, -0.1993394865680279, -0.06721980422271709, -0.04741811434179052, -0.17225813228549514, -0.23230614252394638, 0.06908906109153082, 0.0308153600870538, 0.10465535740786917, -0.055117820890339474, -0.046902568708420314, -0.034533688808402054, 0.07050063897899929, 0.09212314063638803, 0.01651659162506269, 0.06996269206265135, -0.1723202747970289, -0.19296459078347733, 0.3913871474051602, -0.09881903738720914, -0.21036821692965177, 0.23690728474255632, -0.12655285342778794, -0.19372038661241137, 0.07815105682756338, 0.12830801608494272, 0.11302565704666512, -0.1276363998053413, 0.22993635049578856, -0.11263590557352891, 0.12381442930631305, 0.08171374755591233, 0.02968229579359845, 0.29612862732182577, 0.0917873437856398, 0.0657772560746818, 0.14532312336402436, -0.0511832732747915, -0.14127452671035098, -0.35781173617948614, -0.20486568962593402, -0.1431133979229286, 0.14648905845130142, -0.11159630280664676, -0.14155974825745615, 0.3928394050056499, 0.1729918550813901, 0.1569426915480228, 0.020944562695659304, 0.24854770282569227, 0.12596091231892978, 0.04436775439581464, 0.02520264311423821, 0.17474563634879248, 0.1606015004562559, 0.09116626877667845, -0.25166600876181044, -0.19000706555341523, 0.19871933611415366] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.