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.1016 | Manifestations of the onset of chaos in condensed matter and complex
systems | We review the occurrence of the patterns of the onset of chaos in
low-dimensional nonlinear dissipative systems in leading topics of condensed
matter physics and complex systems of various disciplines. We consider the
dynamics associated with the attractors at period-doubling accumulation points
and at tangent bifurcations to describe features of glassy dynamics, critical
fluctuations and localization transitions. We recall that trajectories
pertaining to the routes to chaos form families of time series that are readily
transformed into networks via the Horizontal Visibility algorithm, and this in
turn facilitates establish connections between entropy and Renormalization
Group properties. We discretize the replicator equation of game theory to
observe the onset of chaos in familiar social dilemmas, and also to mimic the
evolution of high-dimensional ecological models. We describe an analytical
framework of nonlinear mappings that reproduce rank distributions of large
classes of data (including Zipf's law). We extend the discussion to point out a
common circumstance of drastic contraction of configuration space driven by the
attractors of these mappings. We mention the relation of generalized entropy
expressions with the dynamics along and at the period doubling, intermittency
and quasi-periodic routes to chaos. Finally, we refer to additional natural
phenomena in complex systems where these conditions may manifest.
| cond-mat.stat-mech nlin.CD physics.soc-ph | we review the occurrence of the patterns of the onset of chaos in lowdimensional nonlinear dissipative systems in leading topics of condensed matter physics and complex systems of various disciplines we consider the dynamics associated with the attractors at perioddoubling accumulation points and at tangent bifurcations to describe features of glassy dynamics critical fluctuations and localization transitions we recall that trajectories pertaining to the routes to chaos form families of time series that are readily transformed into networks via the horizontal visibility algorithm and this in turn facilitates establish connections between entropy and renormalization group properties we discretize the replicator equation of game theory to observe the onset of chaos in familiar social dilemmas and also to mimic the evolution of highdimensional ecological models we describe an analytical framework of nonlinear mappings that reproduce rank distributions of large classes of data including zipfs law we extend the discussion to point out a common circumstance of drastic contraction of configuration space driven by the attractors of these mappings we mention the relation of generalized entropy expressions with the dynamics along and at the period doubling intermittency and quasiperiodic routes to chaos finally we refer to additional natural phenomena in complex systems where these conditions may manifest | [['we', 'review', 'the', 'occurrence', 'of', 'the', 'patterns', 'of', 'the', 'onset', 'of', 'chaos', 'in', 'lowdimensional', 'nonlinear', 'dissipative', 'systems', 'in', 'leading', 'topics', 'of', 'condensed', 'matter', 'physics', 'and', 'complex', 'systems', 'of', 'various', 'disciplines', 'we', 'consider', 'the', 'dynamics', 'associated', 'with', 'the', 'attractors', 'at', 'perioddoubling', 'accumulation', 'points', 'and', 'at', 'tangent', 'bifurcations', 'to', 'describe', 'features', 'of', 'glassy', 'dynamics', 'critical', 'fluctuations', 'and', 'localization', 'transitions', 'we', 'recall', 'that', 'trajectories', 'pertaining', 'to', 'the', 'routes', 'to', 'chaos', 'form', 'families', 'of', 'time', 'series', 'that', 'are', 'readily', 'transformed', 'into', 'networks', 'via', 'the', 'horizontal', 'visibility', 'algorithm', 'and', 'this', 'in', 'turn', 'facilitates', 'establish', 'connections', 'between', 'entropy', 'and', 'renormalization', 'group', 'properties', 'we', 'discretize', 'the', 'replicator', 'equation', 'of', 'game', 'theory', 'to', 'observe', 'the', 'onset', 'of', 'chaos', 'in', 'familiar', 'social', 'dilemmas', 'and', 'also', 'to', 'mimic', 'the', 'evolution', 'of', 'highdimensional', 'ecological', 'models', 'we', 'describe', 'an', 'analytical', 'framework', 'of', 'nonlinear', 'mappings', 'that', 'reproduce', 'rank', 'distributions', 'of', 'large', 'classes', 'of', 'data', 'including', 'zipfs', 'law', 'we', 'extend', 'the', 'discussion', 'to', 'point', 'out', 'a', 'common', 'circumstance', 'of', 'drastic', 'contraction', 'of', 'configuration', 'space', 'driven', 'by', 'the', 'attractors', 'of', 'these', 'mappings', 'we', 'mention', 'the', 'relation', 'of', 'generalized', 'entropy', 'expressions', 'with', 'the', 'dynamics', 'along', 'and', 'at', 'the', 'period', 'doubling', 'intermittency', 'and', 'quasiperiodic', 'routes', 'to', 'chaos', 'finally', 'we', 'refer', 'to', 'additional', 'natural', 'phenomena', 'in', 'complex', 'systems', 'where', 'these', 'conditions', 'may', 'manifest']] | [-0.16132062594519883, 0.13479799715661522, -0.11626702772180846, 0.09977446914843578, -0.04379894017105604, -0.10453848788605594, 0.05456874505900664, 0.3152386282457084, -0.3288041274835605, -0.24800890469696463, 0.07856211452120233, -0.2859618146370006, -0.24600351893718542, 0.16887439689031097, -0.048253589819707884, 0.057309825700230715, 0.03067229151975636, 0.02118548100541641, -0.06269572644051528, -0.19385745386683906, 0.35925709318324195, 0.01670008690789251, 0.265096292744686, 0.004382315096296313, 0.09273532402599458, -0.04799563230310635, -0.01755836604265269, -0.003710117995335789, -0.17728922957630414, 0.08579584184534303, 0.25608858207047974, 0.11841532915103727, 0.2603593067765781, -0.4329965602606535, -0.24810407817727181, 0.12087431553915916, 0.13718831153336639, 0.10636706768603223, 0.005223087937764187, -0.30284610239380017, 0.030289350862319514, -0.12466721597422914, -0.17404430974927934, -0.1303028175209808, 0.030029561500655624, 0.0674644188682844, -0.22236176366213617, 0.09884553401512321, 0.07899650121562002, 0.09552934514301852, -0.0557453899428521, -0.018325502008608566, -0.035122853161471825, 0.13129409597845884, 0.05783394595733049, -0.03829764370329496, 0.11758864581494069, -0.12843096068799043, -0.15930668029752446, 0.39018000620530874, -0.0429341168134337, -0.16253748242856889, 0.24016220345979603, -0.16773271810308826, -0.17243747350010202, 0.12572768505026655, 0.2209529451866884, 0.06476297727278463, -0.12497787434017149, 0.03094741648471937, 0.009087113168363165, 0.1179079445966281, 0.07772883392597844, 0.05106448664034648, 0.2057478721054816, 0.16437314931848426, 0.0507032583365444, 0.140152688453928, -0.030272622276722203, -0.20698938972384828, -0.29426340638410026, -0.125822281697765, -0.1072343800693932, 0.03702119554211272, -0.10878489514210875, -0.1751030155162259, 0.4227080547625608, 0.18055373870642719, 0.21601554009745397, 0.027176952024740055, 0.1961917455739728, 0.11408252678811551, 0.024425115815446166, 0.049608863331377505, 0.18212897112911067, 0.14128792207438226, 0.12649641495606884, -0.2235060926640361, 0.029312180591145213, 0.07864709779358946] |
1,802.10161 | Confinement of vorticity for the 2D Euler-alpha equations | In this article we consider weak solutions of the Euler-$\alpha$ equations in
the full plane. We take, as initial unfiltered vorticity, an arbitrary
nonnegative, compactly supported, bounded Radon measure. Global well-posedness
for the corresponding initial value problem is due M. Oliver and S. Shkoller.
We show that, for all time, the support of the unfiltered vorticity is
contained in a disk whose radius grows no faster than $\mathcal{O}((t\log
t)^{1/4})$. This result is an adaptation of the corresponding result for the
incompressible 2D Euler equations with initial vorticity compactly supported,
nonnegative, and $p$-th power integrable, $p>2$, due to D. Iftimie, T. Sideris
and P. Gamblin and, independently, to Ph. Serfati.
| math.AP | in this article we consider weak solutions of the euleralpha equations in the full plane we take as initial unfiltered vorticity an arbitrary nonnegative compactly supported bounded radon measure global wellposedness for the corresponding initial value problem is due m oliver and s shkoller we show that for all time the support of the unfiltered vorticity is contained in a disk whose radius grows no faster than mathcalotlog t14 this result is an adaptation of the corresponding result for the incompressible 2d euler equations with initial vorticity compactly supported nonnegative and pth power integrable p2 due to d iftimie t sideris and p gamblin and independently to ph serfati | [['in', 'this', 'article', 'we', 'consider', 'weak', 'solutions', 'of', 'the', 'euleralpha', 'equations', 'in', 'the', 'full', 'plane', 'we', 'take', 'as', 'initial', 'unfiltered', 'vorticity', 'an', 'arbitrary', 'nonnegative', 'compactly', 'supported', 'bounded', 'radon', 'measure', 'global', 'wellposedness', 'for', 'the', 'corresponding', 'initial', 'value', 'problem', 'is', 'due', 'm', 'oliver', 'and', 's', 'shkoller', 'we', 'show', 'that', 'for', 'all', 'time', 'the', 'support', 'of', 'the', 'unfiltered', 'vorticity', 'is', 'contained', 'in', 'a', 'disk', 'whose', 'radius', 'grows', 'no', 'faster', 'than', 'mathcalotlog', 't14', 'this', 'result', 'is', 'an', 'adaptation', 'of', 'the', 'corresponding', 'result', 'for', 'the', 'incompressible', '2d', 'euler', 'equations', 'with', 'initial', 'vorticity', 'compactly', 'supported', 'nonnegative', 'and', 'pth', 'power', 'integrable', 'p2', 'due', 'to', 'd', 'iftimie', 't', 'sideris', 'and', 'p', 'gamblin', 'and', 'independently', 'to', 'ph', 'serfati']] | [-0.17293028624866297, 0.0875587653763769, -0.06159244550724031, 0.04174635890996325, -0.054337133433566324, -0.11250105606719714, -0.05666288416466193, 0.29050712993678945, -0.28579977846324994, -0.19541224941645782, 0.12698002422284507, -0.2674849446716339, -0.06428712461557654, 0.16712787498814846, -0.06119702239003447, 0.09054121111640362, 0.060430538995812334, 0.04027773321744193, -0.06066320866510203, -0.2483668136356519, 0.33250312788489583, -0.03707903732881985, 0.21814083226921935, 0.0351553565684568, 0.10629377723860133, -0.00855061307946151, -0.04425485938985797, 0.013392613174531746, -0.20484266857029407, 0.05691602454343983, 0.21337776386213522, 0.07134171033761015, 0.27607743072978874, -0.40005321484231565, -0.16049056695946665, 0.1565277540659601, 0.12568220229715937, 0.060502317578842245, -0.014112343845664765, -0.2903655666978685, 0.17382049827224197, -0.1246483871320918, -0.20300590878900107, -0.01063940547734361, 0.1316000291801713, 0.061447276207790884, -0.3200582980643958, 0.12569019733928144, 0.1270893851329607, 0.06493813601641536, -0.16140581411956292, -0.11851265287906346, -0.06538285411079414, 0.04274690635200521, 0.05870462007307516, 0.13067558536702698, 0.046065548551268876, -0.0838570133437989, -0.019429114183704195, 0.34077873258610014, -0.10920105837309772, -0.2619268918340957, 0.1480951901981758, -0.15766112200044854, -0.07458810276282882, 0.14034239437293122, 0.14214614050514582, 0.14078494422223972, -0.05351411515881342, 0.16059392127337763, -0.09262357333877676, 0.15894080967538887, 0.11946016937468408, -0.04352011899054223, 0.11275955846778946, 0.08302341836194198, 0.1413140297178567, 0.1114723220299412, -0.04246910869335773, -0.05028697141635887, -0.33689458122373456, -0.17938315814050534, -0.22430075083091786, 0.13822790164138293, -0.09059807787168582, -0.15719416132627953, 0.3400264305183319, 0.10078922631563964, 0.19376106713294844, 0.12417826499720966, 0.24170569670214145, 0.14502690537699015, -0.020586480661424704, 0.12959339130342146, 0.1498137672380027, 0.14250396545631466, 0.15882921006737483, -0.20222729933016967, 0.02545605989224795, 0.11802301605927858] |
1,802.10162 | Interplay between musical practices and tuning in the marimba de chonta
music | In the Pacific Coast of Colombia there is a type of marimba called marimba de
chonta, which provides the melodic and harmonic contour for traditional music
with characteristic chants and dances. The tunings of this marimba are based on
the voice of female singers and allows musical practices, as a transposition
that preserves relative distances between bars. Here we show that traditional
tunings are consistent with isotonic scales, and that they have changed in the
last three decades due to the influence of Western music. Specifically, low
octaves have changed into just octaves. Additionally, consonance properties of
this instrument include the occurrence of a broad minimum of dissonance that is
used in the musical practices, while the narrow local peaks of dissonance are
avoided. We found that the main reason for this is the occurrence of
uncertainties in the tunings with respect to the mathematical successions of
isotonic scales. We conclude that in this music the emergence of tunings and
musical practices cannot be considered as separate issues. Consonance, timbre,
and musical practices are entangled.
| cs.SD eess.AS | in the pacific coast of colombia there is a type of marimba called marimba de chonta which provides the melodic and harmonic contour for traditional music with characteristic chants and dances the tunings of this marimba are based on the voice of female singers and allows musical practices as a transposition that preserves relative distances between bars here we show that traditional tunings are consistent with isotonic scales and that they have changed in the last three decades due to the influence of western music specifically low octaves have changed into just octaves additionally consonance properties of this instrument include the occurrence of a broad minimum of dissonance that is used in the musical practices while the narrow local peaks of dissonance are avoided we found that the main reason for this is the occurrence of uncertainties in the tunings with respect to the mathematical successions of isotonic scales we conclude that in this music the emergence of tunings and musical practices cannot be considered as separate issues consonance timbre and musical practices are entangled | [['in', 'the', 'pacific', 'coast', 'of', 'colombia', 'there', 'is', 'a', 'type', 'of', 'marimba', 'called', 'marimba', 'de', 'chonta', 'which', 'provides', 'the', 'melodic', 'and', 'harmonic', 'contour', 'for', 'traditional', 'music', 'with', 'characteristic', 'chants', 'and', 'dances', 'the', 'tunings', 'of', 'this', 'marimba', 'are', 'based', 'on', 'the', 'voice', 'of', 'female', 'singers', 'and', 'allows', 'musical', 'practices', 'as', 'a', 'transposition', 'that', 'preserves', 'relative', 'distances', 'between', 'bars', 'here', 'we', 'show', 'that', 'traditional', 'tunings', 'are', 'consistent', 'with', 'isotonic', 'scales', 'and', 'that', 'they', 'have', 'changed', 'in', 'the', 'last', 'three', 'decades', 'due', 'to', 'the', 'influence', 'of', 'western', 'music', 'specifically', 'low', 'octaves', 'have', 'changed', 'into', 'just', 'octaves', 'additionally', 'consonance', 'properties', 'of', 'this', 'instrument', 'include', 'the', 'occurrence', 'of', 'a', 'broad', 'minimum', 'of', 'dissonance', 'that', 'is', 'used', 'in', 'the', 'musical', 'practices', 'while', 'the', 'narrow', 'local', 'peaks', 'of', 'dissonance', 'are', 'avoided', 'we', 'found', 'that', 'the', 'main', 'reason', 'for', 'this', 'is', 'the', 'occurrence', 'of', 'uncertainties', 'in', 'the', 'tunings', 'with', 'respect', 'to', 'the', 'mathematical', 'successions', 'of', 'isotonic', 'scales', 'we', 'conclude', 'that', 'in', 'this', 'music', 'the', 'emergence', 'of', 'tunings', 'and', 'musical', 'practices', 'can', 'not', 'be', 'considered', 'as', 'separate', 'issues', 'consonance', 'timbre', 'and', 'musical', 'practices', 'are', 'entangled']] | [-0.08926397490304434, 0.13736193284296014, -0.09846977816610972, 0.10089164284183698, -0.08488524285139752, -0.11937060260920432, -0.013007156963021248, 0.4010482066586592, -0.22855281625371213, -0.313708648764349, 0.08252000879568594, -0.2693274251076469, -0.16808941144591208, 0.201162204555846, -0.11448892284366677, -0.019871803875022364, 0.04180532866411832, 0.029492851065728683, -0.059658383575252036, -0.23482588960136147, 0.3133223757499711, 0.05073784642863548, 0.28842817077509547, 0.0444735007778067, 0.09179437880393589, -0.06888059888639883, -0.040765434340306224, -0.03177805753403354, -0.08922738672560951, 0.14153562973376535, 0.31172721894543576, 0.18158302770328077, 0.3008132132690871, -0.3909580258705423, -0.17180835710966896, 0.07965010952474763, 0.1370732623029329, 0.066958753600176, 0.013903920443048808, -0.274044005938902, 0.08023071637438696, -0.1233298111193139, -0.06776487045311208, -0.018613635621237003, 0.013558379138937626, 0.0606176992393254, -0.19021641000323855, 0.0816672855303034, 0.06991204515859069, 0.14026185569364105, -0.027782916392122086, -0.16103646584154888, -0.012728724260707439, 0.18500177095103582, 0.0863524999311622, -0.006634785204954531, 0.10488548514368976, -0.10830547007357716, -0.12353592706996755, 0.3762119221447528, -0.06104343164051166, -0.14966906968841392, 0.1648925440814132, -0.10494710884495885, -0.12968093118812332, 0.08752921702950422, 0.11587735881557924, 0.04360259275738921, -0.10196825641176621, 0.018037688152512655, -0.02920823600999583, 0.21409538047302556, 0.12537986340921844, 0.03628320594307506, 0.2157654811055453, 0.14164343480309793, 0.027878858371177453, 0.10278995241902919, -0.08990620867143138, -0.08928075821096099, -0.26005663040318877, -0.12088567651433592, -0.09710575328422603, -0.018757641596379073, -0.05085495780519847, -0.17895131830618471, 0.4494544307797633, 0.16741572944822067, 0.16637754636206503, 0.03288137075162075, 0.259483551132846, 0.04547530048307374, 0.11130621490850189, 0.032468578020838655, 0.24476441174836552, 0.05247488767898845, 0.1230136703247547, -0.18128790124453303, 0.09966906444865396, -0.017750911097491866] |
1,802.10163 | Markov equivalence of marginalized local independence graphs | Symmetric independence relations are often studied using graphical
representations. Ancestral graphs or acyclic directed mixed graphs with
$m$-separation provide classes of symmetric graphical independence models that
are closed under marginalization. Asymmetric independence relations appear
naturally for multivariate stochastic processes, for instance in terms of local
independence. However, no class of graphs representing such asymmetric
independence relations, which is also closed under marginalization, has been
developed. We develop the theory of directed mixed graphs with $\mu$-separation
and show that this provides a graphical independence model class which is
closed under marginalization and which generalizes previously considered
graphical representations of local independence.
For statistical applications, it is pivotal to characterize graphs that
induce the same independence relations as such a Markov equivalence class of
graphs is the object that is ultimately identifiable from observational data.
Our main result is that for directed mixed graphs with $\mu$-separation each
Markov equivalence class contains a maximal element which can be constructed
from the independence relations alone. Moreover, we introduce the directed
mixed equivalence graph as the maximal graph with edge markings. This graph
encodes all the information about the edges that is identifiable from the
independence relations, and furthermore it can be computed efficiently from the
maximal graph.
| math.ST stat.OT stat.TH | symmetric independence relations are often studied using graphical representations ancestral graphs or acyclic directed mixed graphs with mseparation provide classes of symmetric graphical independence models that are closed under marginalization asymmetric independence relations appear naturally for multivariate stochastic processes for instance in terms of local independence however no class of graphs representing such asymmetric independence relations which is also closed under marginalization has been developed we develop the theory of directed mixed graphs with museparation and show that this provides a graphical independence model class which is closed under marginalization and which generalizes previously considered graphical representations of local independence for statistical applications it is pivotal to characterize graphs that induce the same independence relations as such a markov equivalence class of graphs is the object that is ultimately identifiable from observational data our main result is that for directed mixed graphs with museparation each markov equivalence class contains a maximal element which can be constructed from the independence relations alone moreover we introduce the directed mixed equivalence graph as the maximal graph with edge markings this graph encodes all the information about the edges that is identifiable from the independence relations and furthermore it can be computed efficiently from the maximal graph | [['symmetric', 'independence', 'relations', 'are', 'often', 'studied', 'using', 'graphical', 'representations', 'ancestral', 'graphs', 'or', 'acyclic', 'directed', 'mixed', 'graphs', 'with', 'mseparation', 'provide', 'classes', 'of', 'symmetric', 'graphical', 'independence', 'models', 'that', 'are', 'closed', 'under', 'marginalization', 'asymmetric', 'independence', 'relations', 'appear', 'naturally', 'for', 'multivariate', 'stochastic', 'processes', 'for', 'instance', 'in', 'terms', 'of', 'local', 'independence', 'however', 'no', 'class', 'of', 'graphs', 'representing', 'such', 'asymmetric', 'independence', 'relations', 'which', 'is', 'also', 'closed', 'under', 'marginalization', 'has', 'been', 'developed', 'we', 'develop', 'the', 'theory', 'of', 'directed', 'mixed', 'graphs', 'with', 'museparation', 'and', 'show', 'that', 'this', 'provides', 'a', 'graphical', 'independence', 'model', 'class', 'which', 'is', 'closed', 'under', 'marginalization', 'and', 'which', 'generalizes', 'previously', 'considered', 'graphical', 'representations', 'of', 'local', 'independence', 'for', 'statistical', 'applications', 'it', 'is', 'pivotal', 'to', 'characterize', 'graphs', 'that', 'induce', 'the', 'same', 'independence', 'relations', 'as', 'such', 'a', 'markov', 'equivalence', 'class', 'of', 'graphs', 'is', 'the', 'object', 'that', 'is', 'ultimately', 'identifiable', 'from', 'observational', 'data', 'our', 'main', 'result', 'is', 'that', 'for', 'directed', 'mixed', 'graphs', 'with', 'museparation', 'each', 'markov', 'equivalence', 'class', 'contains', 'a', 'maximal', 'element', 'which', 'can', 'be', 'constructed', 'from', 'the', 'independence', 'relations', 'alone', 'moreover', 'we', 'introduce', 'the', 'directed', 'mixed', 'equivalence', 'graph', 'as', 'the', 'maximal', 'graph', 'with', 'edge', 'markings', 'this', 'graph', 'encodes', 'all', 'the', 'information', 'about', 'the', 'edges', 'that', 'is', 'identifiable', 'from', 'the', 'independence', 'relations', 'and', 'furthermore', 'it', 'can', 'be', 'computed', 'efficiently', 'from', 'the', 'maximal', 'graph']] | [-0.09925443736433204, 0.13292204324168788, -0.08799048664919402, 0.12982103701296321, -0.16511625620833048, -0.15265234313926668, -0.01658407866199552, 0.4014122187685852, -0.3210470124277569, -0.31405778981708177, 0.10566508596176884, -0.2227048342885329, -0.1594094872018276, 0.12978489163438256, -0.08322996371055012, 0.01662212171920793, 0.0987947525006814, 0.08786888419785444, -0.04172972146194632, -0.21635143234758217, 0.34430540014354893, -0.028245329721344272, 0.271227028033527, 0.008637105001528186, 0.13394235962577886, 0.06313562468018624, -0.03663867263039991, 0.12430696321920079, -0.123545704412557, 0.14079941891189388, 0.2961604951539192, 0.20385933939520437, 0.19377722880288736, -0.3799680728391184, -0.23083792491097802, 0.2185653641458545, 0.06577287946549124, 0.07313242117846523, 0.024720230765307126, -0.2719464000333008, 0.11832358435129942, -0.15461804660324432, -0.042523188830413554, -0.06024425533780856, 0.028684973735269622, 0.030767764207508545, -0.323277681445082, 0.03969744789001152, 0.15272110376613612, 0.09540163211215204, 0.040416490724449285, -0.10406700088248695, -0.04081670367112615, 0.1258117943128747, -0.02353056330194428, -0.02714685128019446, 0.05783357462887444, -0.10661785427318186, -0.17012738200849783, 0.331015597028074, -0.011778807178352824, -0.21143543339839474, 0.16484803836144024, -0.07645504144414221, -0.24177785985523936, 0.08818745593290164, 0.11690863830255187, 0.11512352323706322, -0.1774557901949469, 0.13623246953467055, -0.15071172105954656, 0.0914861496192732, 0.07820076729398016, 0.028091568622010673, 0.16678839580929694, 0.09364147934441765, 0.10403719274280825, 0.20598517513407663, 0.004974271448801702, -0.10449233767460679, -0.32220889809564573, -0.1104298783973003, -0.16647998270733902, 0.031048893240388755, -0.19336293568924146, -0.22432192035056464, 0.3801627758478014, 0.13122652752315672, 0.16272915166510799, 0.142044726690852, 0.21880754090808519, 0.10345857072359795, 0.08154825073439832, 0.13266480804145317, 0.11897081561127112, 0.2254191235829126, -0.04041293983820325, -0.10699926871274695, 0.1768939743575464, 0.08974535899487004] |
1,802.10164 | Predicting Transportation Modes of GPS Trajectories using Feature
Engineering and Noise Removal | Understanding transportation mode from GPS (Global Positioning System) traces
is an essential topic in the data mobility domain. In this paper, a framework
is proposed to predict transportation modes. This framework follows a sequence
of five steps: (i) data preparation, where GPS points are grouped in trajectory
samples; (ii) point features generation; (iii) trajectory features extraction;
(iv) noise removal; (v) normalization. We show that the extraction of the new
point features: bearing rate, the rate of rate of change of the bearing rate
and the global and local trajectory features, like medians and percentiles
enables many classifiers to achieve high accuracy (96.5%) and f1 (96.3%)
scores. We also show that the noise removal task affects the performance of all
the models tested. Finally, the empirical tests where we compare this work
against state-of-art transportation mode prediction strategies show that our
framework is competitive and outperforms most of them.
| cs.OH | understanding transportation mode from gps global positioning system traces is an essential topic in the data mobility domain in this paper a framework is proposed to predict transportation modes this framework follows a sequence of five steps i data preparation where gps points are grouped in trajectory samples ii point features generation iii trajectory features extraction iv noise removal v normalization we show that the extraction of the new point features bearing rate the rate of rate of change of the bearing rate and the global and local trajectory features like medians and percentiles enables many classifiers to achieve high accuracy 965 and f1 963 scores we also show that the noise removal task affects the performance of all the models tested finally the empirical tests where we compare this work against stateofart transportation mode prediction strategies show that our framework is competitive and outperforms most of them | [['understanding', 'transportation', 'mode', 'from', 'gps', 'global', 'positioning', 'system', 'traces', 'is', 'an', 'essential', 'topic', 'in', 'the', 'data', 'mobility', 'domain', 'in', 'this', 'paper', 'a', 'framework', 'is', 'proposed', 'to', 'predict', 'transportation', 'modes', 'this', 'framework', 'follows', 'a', 'sequence', 'of', 'five', 'steps', 'i', 'data', 'preparation', 'where', 'gps', 'points', 'are', 'grouped', 'in', 'trajectory', 'samples', 'ii', 'point', 'features', 'generation', 'iii', 'trajectory', 'features', 'extraction', 'iv', 'noise', 'removal', 'v', 'normalization', 'we', 'show', 'that', 'the', 'extraction', 'of', 'the', 'new', 'point', 'features', 'bearing', 'rate', 'the', 'rate', 'of', 'rate', 'of', 'change', 'of', 'the', 'bearing', 'rate', 'and', 'the', 'global', 'and', 'local', 'trajectory', 'features', 'like', 'medians', 'and', 'percentiles', 'enables', 'many', 'classifiers', 'to', 'achieve', 'high', 'accuracy', '965', 'and', 'f1', '963', 'scores', 'we', 'also', 'show', 'that', 'the', 'noise', 'removal', 'task', 'affects', 'the', 'performance', 'of', 'all', 'the', 'models', 'tested', 'finally', 'the', 'empirical', 'tests', 'where', 'we', 'compare', 'this', 'work', 'against', 'stateofart', 'transportation', 'mode', 'prediction', 'strategies', 'show', 'that', 'our', 'framework', 'is', 'competitive', 'and', 'outperforms', 'most', 'of', 'them']] | [-0.09322142979520298, -0.00597392322369332, -0.07484852109966497, 0.029058934957091068, -0.017145907411955902, -0.14863901020883508, 0.08084572966342692, 0.3981685612250019, -0.2630989124716851, -0.29452258457958297, 0.10482470597835837, -0.33011609985102974, -0.16500478552267384, 0.1890101209219948, -0.1103454120252659, 0.06246885369103905, 0.12509607911625928, 0.043654728087760206, -0.03649019329600993, -0.24969522638019878, 0.28097278065035575, 0.07698448941841521, 0.4001618042758137, 0.00529405618766071, 0.101500424253597, -0.02419065380299061, -0.06081210492049797, -0.013372228521778173, -0.06648584271420692, 0.13536179460257897, 0.24707887695608774, 0.2018718641578547, 0.2757384109663198, -0.358152259990724, -0.20270500178024098, 0.09039982016877951, 0.1296660445687185, 0.09941364708985831, -0.047168959230278945, -0.28143622126505785, 0.10031167410842672, -0.140386471873294, -0.08423897928583461, -0.10172465397674288, 0.011736163945406096, 0.04057642331699262, -0.2952794222148588, 0.08641587388902318, 0.07591516458479738, 0.060324512923929235, -0.07718390263963139, -0.1268310241379171, -0.01223721940265465, 0.1832909542953948, 0.05946683177466479, 0.02488042045434987, 0.18955567412706079, -0.16647316435685483, -0.1457192643004394, 0.3568219275377389, -0.09704202195752186, -0.17517958229212593, 0.20225448894465492, -0.09751999116505848, -0.15478435267278975, 0.08817664364422043, 0.20071254124097224, 0.10599193377640552, -0.15847735153668485, -0.014029893101070303, 0.015727047393148817, 0.19958968622164763, 0.04756321914405939, 0.025806069949081772, 0.16284797429516157, 0.22397593493774734, 0.07217732892722534, 0.0856207286800585, -0.1838979410265991, -0.07247464264809103, -0.26189376334656805, -0.14053298682729537, -0.14883381339313928, -0.0229704661697552, -0.09923198528230313, -0.1011768680544117, 0.4230311307552698, 0.20932225457619172, 0.2247441400832031, 0.07659030131165039, 0.32021475770208685, 0.07354570491431356, 0.04382753913680947, 0.116621051131153, 0.22103698824444232, -0.006556316571486359, 0.07883088839416569, -0.20725389230190902, 0.07509519091517841, 0.03173290756751305] |
1,802.10165 | Extraplanar H II Regions in Spiral Galaxies. I. Low-Metallicity Gas
Accreting through the Disk-Halo Interface of NGC 4013 | The interstellar thick disks of galaxies serve as the interface between the
thin star-forming disk, where feedback-driven outflows originate, and the
distant halo, the repository for accreted gas. We present optical emission line
spectroscopy of a luminous thick disk H II region located at $z = 860$ pc above
the plane of the spiral galaxy NGC 4013 taken with the Multi-Object Double
Spectrograph on the Large Binocular Telescope. This nebula, with an H$\alpha$
luminosity $\sim4-7$ times that of the Orion nebula, surrounds a luminous
cluster of young, hot stars that ionize the surrounding interstellar gas of the
thick disk, providing a measure of the properties of that gas. We demonstrate
that strong emission line methods can provide accurate measures of relative
abundances between pairs of H II regions. From our emission line spectroscopy,
we show that the metal content of the thick disk H II region is a factor of
$\approx2$ lower than gas in H II regions at the midplane of this galaxy (with
the relative abundance of O in the thick disk lower by $-0.32\pm 0.09$ dex).
This implies incomplete mixing of material in the thick disk on small scales
(100s of parsecs) and that there is accretion of low-metallicity gas through
the thick disks of spirals. The inclusion of low-metallicity gas this close to
the plane of NGC 4013 is reminiscent of the recently-proposed "fountain-driven"
accretion models.
| astro-ph.GA | the interstellar thick disks of galaxies serve as the interface between the thin starforming disk where feedbackdriven outflows originate and the distant halo the repository for accreted gas we present optical emission line spectroscopy of a luminous thick disk h ii region located at z 860 pc above the plane of the spiral galaxy ngc 4013 taken with the multiobject double spectrograph on the large binocular telescope this nebula with an halpha luminosity sim47 times that of the orion nebula surrounds a luminous cluster of young hot stars that ionize the surrounding interstellar gas of the thick disk providing a measure of the properties of that gas we demonstrate that strong emission line methods can provide accurate measures of relative abundances between pairs of h ii regions from our emission line spectroscopy we show that the metal content of the thick disk h ii region is a factor of approx2 lower than gas in h ii regions at the midplane of this galaxy with the relative abundance of o in the thick disk lower by 032pm 009 dex this implies incomplete mixing of material in the thick disk on small scales 100s of parsecs and that there is accretion of lowmetallicity gas through the thick disks of spirals the inclusion of lowmetallicity gas this close to the plane of ngc 4013 is reminiscent of the recentlyproposed fountaindriven accretion models | [['the', 'interstellar', 'thick', 'disks', 'of', 'galaxies', 'serve', 'as', 'the', 'interface', 'between', 'the', 'thin', 'starforming', 'disk', 'where', 'feedbackdriven', 'outflows', 'originate', 'and', 'the', 'distant', 'halo', 'the', 'repository', 'for', 'accreted', 'gas', 'we', 'present', 'optical', 'emission', 'line', 'spectroscopy', 'of', 'a', 'luminous', 'thick', 'disk', 'h', 'ii', 'region', 'located', 'at', 'z', '860', 'pc', 'above', 'the', 'plane', 'of', 'the', 'spiral', 'galaxy', 'ngc', '4013', 'taken', 'with', 'the', 'multiobject', 'double', 'spectrograph', 'on', 'the', 'large', 'binocular', 'telescope', 'this', 'nebula', 'with', 'an', 'halpha', 'luminosity', 'sim47', 'times', 'that', 'of', 'the', 'orion', 'nebula', 'surrounds', 'a', 'luminous', 'cluster', 'of', 'young', 'hot', 'stars', 'that', 'ionize', 'the', 'surrounding', 'interstellar', 'gas', 'of', 'the', 'thick', 'disk', 'providing', 'a', 'measure', 'of', 'the', 'properties', 'of', 'that', 'gas', 'we', 'demonstrate', 'that', 'strong', 'emission', 'line', 'methods', 'can', 'provide', 'accurate', 'measures', 'of', 'relative', 'abundances', 'between', 'pairs', 'of', 'h', 'ii', 'regions', 'from', 'our', 'emission', 'line', 'spectroscopy', 'we', 'show', 'that', 'the', 'metal', 'content', 'of', 'the', 'thick', 'disk', 'h', 'ii', 'region', 'is', 'a', 'factor', 'of', 'approx2', 'lower', 'than', 'gas', 'in', 'h', 'ii', 'regions', 'at', 'the', 'midplane', 'of', 'this', 'galaxy', 'with', 'the', 'relative', 'abundance', 'of', 'o', 'in', 'the', 'thick', 'disk', 'lower', 'by', '032pm', '009', 'dex', 'this', 'implies', 'incomplete', 'mixing', 'of', 'material', 'in', 'the', 'thick', 'disk', 'on', 'small', 'scales', '100s', 'of', 'parsecs', 'and', 'that', 'there', 'is', 'accretion', 'of', 'lowmetallicity', 'gas', 'through', 'the', 'thick', 'disks', 'of', 'spirals', 'the', 'inclusion', 'of', 'lowmetallicity', 'gas', 'this', 'close', 'to', 'the', 'plane', 'of', 'ngc', '4013', 'is', 'reminiscent', 'of', 'the', 'recentlyproposed', 'fountaindriven', 'accretion', 'models']] | [-0.051057554935471164, 0.07131074310244034, -0.020180298629578805, 0.041392400496289554, -0.05959776628357826, -0.05060858926918829, 0.026449785088941323, 0.4487342300080576, -0.16909480956688067, -0.3061449667764218, 0.005306851674444713, -0.27446077249976747, 0.05438561967216172, 0.1835034142360363, -0.014996424749786925, -0.10285750354333134, 0.03793558443608738, -0.16650560546519466, -0.03706826572001436, -0.2356794591236648, 0.33147335743661727, 0.07965338909968034, 0.1131301489923003, -0.0342309080597062, 0.048764518110587886, -0.17625067707793746, -0.0313627250618647, -0.056586891186004705, -0.19391855660933488, 0.08115977999920994, 0.21600510238631496, 0.0928312805735437, 0.21825794564503118, -0.3671502437174125, -0.19689556721630444, 0.03372859067637392, 0.23283672430674549, -0.028991267219283436, -0.07312100964769168, -0.269876274601536, 0.05692199240189542, -0.17317348657385345, -0.2033223116721584, 0.15768442850755163, 0.05134071123290108, 0.0023021817280540822, -0.2116858686463334, 0.150722913995617, 0.05776884909354478, 0.11074782224975965, -0.08413068508763907, -0.0803095119940239, -0.1074552877544828, 0.05641845504318132, -0.007394490166217512, 0.07967449740840195, 0.27335554623049096, -0.15373998515991144, 0.05964968060692325, 0.4065482834166965, -0.1084376635250669, 0.06053740869166419, 0.2509375595910613, -0.2794605441478907, -0.1391654844460887, 0.20030624742160133, 0.14507132022352848, 0.15845864652818695, -0.09367902749538316, 0.04881317622798971, -0.12894881450607723, 0.21795105567307713, 0.04159309043788949, 0.07450462111760456, 0.3385607142603293, 0.10105446075378026, 0.045620980204843536, 0.13584469822052395, -0.2743808915248897, -0.03374879532615658, -0.2528742070566033, -0.1521572302889021, -0.10401658779904897, 0.08526714985750973, -0.1627800524005754, -0.15100051191997385, 0.257365227748099, 0.06126070027310792, 0.2745167414147374, -0.015267228898815974, 0.3386925524792036, 0.04079937979814853, 0.13931395029740645, 0.16324755249902867, 0.30508016812407684, 0.20280007219783897, 0.07170200815906506, -0.26974470265652967, 0.08368463797990933, 0.013117934470410625] |
1,802.10166 | Extraplanar H II Regions in Spiral Galaxies. II. In Situ Star Formation
in the Interstellar Thick Disk of NGC 4013 | We present observations of an H$\alpha$ emitting knot in the thick disk of
NGC 4013, demonstrating it is an H II region surrounding a cluster of young hot
stars $z = 860$ pc above the plane of this edge-on spiral galaxy. With LBT/MODS
spectroscopy we show this H II region has an H$\alpha$ luminosity $\sim 4$ - 7
times that of the Orion nebula, with an implied ionizing photon production rate
$\log Q_0 \gtrsim 49.4$ (photons s$^{-1}$). HST/WFPC2 imaging reveals an
associated blue continuum source with $M_{V} = -8.21\pm0.24$. Together these
properties demonstrate the H II region is powered by a young cluster of stars
formed {\em in situ} in the thick disk with an ionizing photon flux equivalent
to $\sim$6 O7 V stars. If we assume $\approx6$ other extraplanar \halpha
-emitting knots are H II regions, the total thick disk star formation rate of
\ngc 4013 is $\sim 5 \times 10^{-4}$ M$_\odot$ yr$^{-1}$. The star formation
likely occurs in the dense clouds of the interstellar thick disk seen in
optical images of dust extinction and CO emission.
| astro-ph.GA | we present observations of an halpha emitting knot in the thick disk of ngc 4013 demonstrating it is an h ii region surrounding a cluster of young hot stars z 860 pc above the plane of this edgeon spiral galaxy with lbtmods spectroscopy we show this h ii region has an halpha luminosity sim 4 7 times that of the orion nebula with an implied ionizing photon production rate log q_0 gtrsim 494 photons s1 hstwfpc2 imaging reveals an associated blue continuum source with m_v 821pm024 together these properties demonstrate the h ii region is powered by a young cluster of stars formed em in situ in the thick disk with an ionizing photon flux equivalent to sim6 o7 v stars if we assume approx6 other extraplanar halpha emitting knots are h ii regions the total thick disk star formation rate of ngc 4013 is sim 5 times 104 m_odot yr1 the star formation likely occurs in the dense clouds of the interstellar thick disk seen in optical images of dust extinction and co emission | [['we', 'present', 'observations', 'of', 'an', 'halpha', 'emitting', 'knot', 'in', 'the', 'thick', 'disk', 'of', 'ngc', '4013', 'demonstrating', 'it', 'is', 'an', 'h', 'ii', 'region', 'surrounding', 'a', 'cluster', 'of', 'young', 'hot', 'stars', 'z', '860', 'pc', 'above', 'the', 'plane', 'of', 'this', 'edgeon', 'spiral', 'galaxy', 'with', 'lbtmods', 'spectroscopy', 'we', 'show', 'this', 'h', 'ii', 'region', 'has', 'an', 'halpha', 'luminosity', 'sim', '4', '7', 'times', 'that', 'of', 'the', 'orion', 'nebula', 'with', 'an', 'implied', 'ionizing', 'photon', 'production', 'rate', 'log', 'q_0', 'gtrsim', '494', 'photons', 's1', 'hstwfpc2', 'imaging', 'reveals', 'an', 'associated', 'blue', 'continuum', 'source', 'with', 'm_v', '821pm024', 'together', 'these', 'properties', 'demonstrate', 'the', 'h', 'ii', 'region', 'is', 'powered', 'by', 'a', 'young', 'cluster', 'of', 'stars', 'formed', 'em', 'in', 'situ', 'in', 'the', 'thick', 'disk', 'with', 'an', 'ionizing', 'photon', 'flux', 'equivalent', 'to', 'sim6', 'o7', 'v', 'stars', 'if', 'we', 'assume', 'approx6', 'other', 'extraplanar', 'halpha', 'emitting', 'knots', 'are', 'h', 'ii', 'regions', 'the', 'total', 'thick', 'disk', 'star', 'formation', 'rate', 'of', 'ngc', '4013', 'is', 'sim', '5', 'times', '104', 'm_odot', 'yr1', 'the', 'star', 'formation', 'likely', 'occurs', 'in', 'the', 'dense', 'clouds', 'of', 'the', 'interstellar', 'thick', 'disk', 'seen', 'in', 'optical', 'images', 'of', 'dust', 'extinction', 'and', 'co', 'emission']] | [-0.07119786869011947, 0.10456824872890974, 0.01851365115659461, 0.05602417153308981, -0.058137366077166866, -0.05440914021783519, 0.0044568865412803384, 0.5199011660598475, -0.1470071454264823, -0.32331272747485373, 0.001648528961031216, -0.2862479466645197, 0.07269281496416949, 0.1658614992261757, -0.05929005848649948, -0.11862686078395994, 0.05978043457669147, -0.12826347305846197, 0.004301407504238017, -0.25333095509050435, 0.26182921725625025, 0.04822264277930211, 0.07272762361841661, -0.024541635181348043, 0.04476734601468351, -0.16399592602753948, -0.0573735612606156, -0.10219220441883836, -0.21510936516684503, 0.01482561976520409, 0.18762649269239312, 0.130771310119515, 0.1890628357824666, -0.33504490139519516, -0.18650435295020198, 0.03171438144669793, 0.2734251373591993, -0.07913278785384335, -0.04746439863376362, -0.27601591631470396, 0.05605179139268424, -0.19040240932606567, -0.22388867005282992, 0.22319282592948655, 0.10407229380925646, -0.01750901607721616, -0.23844938521305548, 0.16667184184088596, 0.004579531210180287, 0.11096206433193266, -0.09304036439166287, -0.06819228694677867, -0.09973070941244562, -0.013490540973692277, -0.03910460583156446, 0.14930550466109624, 0.2643021130800547, -0.1781880554606624, 0.007416510413903957, 0.37089000176638365, -0.09103188713900102, 0.09581007576151483, 0.2245605605836401, -0.2522334793512977, -0.15515054143355067, 0.25191717214973364, 0.06478382505198148, 0.15843353070580968, -0.13101820681972065, 0.02722567719261526, -0.08819356858302121, 0.26665515188614825, 0.06332926987937984, 0.09306675430272515, 0.31901261321772106, 0.07903356991451362, 0.014080263939873454, 0.12478670415812408, -0.33997741892924477, 0.0037693124714082687, -0.250627507668406, -0.12824850591921902, -0.07960904358642647, 0.15311432846597042, -0.19469063771055978, -0.1037863851792511, 0.23128297024578942, 0.032133155363215794, 0.2566172167252021, -0.0205657882455351, 0.28756597212076873, 0.08303216848008592, 0.10942330002923892, 0.2106689857988051, 0.2972341550476635, 0.22653089596183393, 0.05828943190528829, -0.24274874499118512, 0.02683333722585491, -0.015815979091921586] |
1,802.10167 | Uncovering Universal Wave Fluctuations In a Scaled Ray-Chaotic Cavity
With Remote Injection | The Random Coupling Model (RCM), introduced by Zheng, Antonsen and Ott,
predicts the statistical properties of waves inside a ray-chaotic enclosure in
the semi-classical regime by using Random Matrix Theory, combined with
system-specific information. Experiments on single cavities are in general
agreement with the predictions of the RCM. It is now desired to test the RCM on
more complex structures, such as a cascade or network of coupled cavities, that
represent realistic situations, but which are difficult to test due to the
large size of the structures of interest. This paper presents a novel
experimental setup that replaces a cubic-meter-scale microwave cavity with a
miniaturized cavity, scaled down by a factor of 20 in each dimension, operated
at a frequency scaled up by a factor of 20 and having wall conductivity
appropriately scaled up by a factor of 20. We demonstrate experimentally that
the miniaturized cavity maintains the statistical wave properties of the larger
cavity. This scaled setup opens the opportunity to study wave properties in
large structures such as the floor of an office building, a ship, or an
aircraft, in a controlled laboratory setting.
| physics.class-ph | the random coupling model rcm introduced by zheng antonsen and ott predicts the statistical properties of waves inside a raychaotic enclosure in the semiclassical regime by using random matrix theory combined with systemspecific information experiments on single cavities are in general agreement with the predictions of the rcm it is now desired to test the rcm on more complex structures such as a cascade or network of coupled cavities that represent realistic situations but which are difficult to test due to the large size of the structures of interest this paper presents a novel experimental setup that replaces a cubicmeterscale microwave cavity with a miniaturized cavity scaled down by a factor of 20 in each dimension operated at a frequency scaled up by a factor of 20 and having wall conductivity appropriately scaled up by a factor of 20 we demonstrate experimentally that the miniaturized cavity maintains the statistical wave properties of the larger cavity this scaled setup opens the opportunity to study wave properties in large structures such as the floor of an office building a ship or an aircraft in a controlled laboratory setting | [['the', 'random', 'coupling', 'model', 'rcm', 'introduced', 'by', 'zheng', 'antonsen', 'and', 'ott', 'predicts', 'the', 'statistical', 'properties', 'of', 'waves', 'inside', 'a', 'raychaotic', 'enclosure', 'in', 'the', 'semiclassical', 'regime', 'by', 'using', 'random', 'matrix', 'theory', 'combined', 'with', 'systemspecific', 'information', 'experiments', 'on', 'single', 'cavities', 'are', 'in', 'general', 'agreement', 'with', 'the', 'predictions', 'of', 'the', 'rcm', 'it', 'is', 'now', 'desired', 'to', 'test', 'the', 'rcm', 'on', 'more', 'complex', 'structures', 'such', 'as', 'a', 'cascade', 'or', 'network', 'of', 'coupled', 'cavities', 'that', 'represent', 'realistic', 'situations', 'but', 'which', 'are', 'difficult', 'to', 'test', 'due', 'to', 'the', 'large', 'size', 'of', 'the', 'structures', 'of', 'interest', 'this', 'paper', 'presents', 'a', 'novel', 'experimental', 'setup', 'that', 'replaces', 'a', 'cubicmeterscale', 'microwave', 'cavity', 'with', 'a', 'miniaturized', 'cavity', 'scaled', 'down', 'by', 'a', 'factor', 'of', '20', 'in', 'each', 'dimension', 'operated', 'at', 'a', 'frequency', 'scaled', 'up', 'by', 'a', 'factor', 'of', '20', 'and', 'having', 'wall', 'conductivity', 'appropriately', 'scaled', 'up', 'by', 'a', 'factor', 'of', '20', 'we', 'demonstrate', 'experimentally', 'that', 'the', 'miniaturized', 'cavity', 'maintains', 'the', 'statistical', 'wave', 'properties', 'of', 'the', 'larger', 'cavity', 'this', 'scaled', 'setup', 'opens', 'the', 'opportunity', 'to', 'study', 'wave', 'properties', 'in', 'large', 'structures', 'such', 'as', 'the', 'floor', 'of', 'an', 'office', 'building', 'a', 'ship', 'or', 'an', 'aircraft', 'in', 'a', 'controlled', 'laboratory', 'setting']] | [-0.11034710341875718, 0.15339966867059293, -0.04492311299199591, -0.0073390148712221435, -0.024558586347848178, -0.1346630888915545, 0.05328889607980444, 0.3519902983579684, -0.2455433938652277, -0.32233642369911475, 0.08628147604585801, -0.2589059859010819, -0.11931914662300433, 0.2359829795181852, -0.033309444961314265, 0.0899011863320059, 0.03870918591305412, 0.003110938087558827, -0.03812835078994819, -0.16319574190278513, 0.2688322715146618, 0.11713162862972633, 0.31172678270251364, 0.010990108677966369, 0.12641497675480473, -0.030160116292677844, 0.009875069126939855, 0.042596980639280295, -0.09404196742339205, 0.11639446102057559, 0.2256909747356297, 0.06350929612369352, 0.2855562549059254, -0.43602248626584944, -0.21834021687406946, 0.032819744169309335, 0.11170576994961783, 0.11142995669569418, -0.05077612707934128, -0.2843538657699183, 0.06670505467651261, -0.17417352914407447, -0.1737578592263162, -0.05222116971036067, -0.011672014040822113, 0.004652465224215711, -0.27923494859825115, 0.04255929922911565, 0.04330051054271895, 0.04662175802765666, 0.009430267679429538, -0.043027963580538495, 0.0382590512820595, 0.08250567681420393, -0.020876309373164297, 0.0326409849866822, 0.16639615130749205, -0.1356036895357475, -0.09094664850461019, 0.40515902959364086, -0.0772543718730024, -0.17588675161257286, 0.1788077685528913, -0.14147379011469516, -0.06198567510456652, 0.12842159847401688, 0.19610356533446827, 0.07630983841970462, -0.1507642635037317, 0.05303480796251647, -0.04841583088225987, 0.18807373832017688, 0.10895060655107168, 0.011105184205390852, 0.18901105971151108, 0.2242481063346605, 0.031996571876712745, 0.17889737539194725, -0.08024311546689353, -0.05983796570500409, -0.2684115244881124, -0.12646716209694844, -0.18099666560521802, 0.05211909050420808, -0.10720565660614395, -0.1537027950146915, 0.38916405890564865, 0.1493963246309274, 0.21640392488774818, 0.01875564733432052, 0.2913789048048391, 0.08495139855627172, 0.11418375845595792, 0.0600865205750656, 0.2511454870987281, 0.13010948137380182, 0.09498420348390937, -0.1935186672112527, 0.019877880217658506, -0.009717552167539662] |
1,802.10168 | ADMM-based Networked Stochastic Variational Inference | Owing to the recent advances in "Big Data" modeling and prediction tasks,
variational Bayesian estimation has gained popularity due to their ability to
provide exact solutions to approximate posteriors. One key technique for
approximate inference is stochastic variational inference (SVI). SVI poses
variational inference as a stochastic optimization problem and solves it
iteratively using noisy gradient estimates. It aims to handle massive data for
predictive and classification tasks by applying complex Bayesian models that
have observed as well as latent variables. This paper aims to decentralize it
allowing parallel computation, secure learning and robustness benefits. We use
Alternating Direction Method of Multipliers in a top-down setting to develop a
distributed SVI algorithm such that independent learners running inference
algorithms only require sharing the estimated model parameters instead of their
private datasets. Our work extends the distributed SVI-ADMM algorithm that we
first propose, to an ADMM-based networked SVI algorithm in which not only are
the learners working distributively but they share information according to
rules of a graph by which they form a network. This kind of work lies under the
umbrella of `deep learning over networks' and we verify our algorithm for a
topic-modeling problem for corpus of Wikipedia articles. We illustrate the
results on latent Dirichlet allocation (LDA) topic model in large document
classification, compare performance with the centralized algorithm, and use
numerical experiments to corroborate the analytical results.
| cs.LG stat.ML | owing to the recent advances in big data modeling and prediction tasks variational bayesian estimation has gained popularity due to their ability to provide exact solutions to approximate posteriors one key technique for approximate inference is stochastic variational inference svi svi poses variational inference as a stochastic optimization problem and solves it iteratively using noisy gradient estimates it aims to handle massive data for predictive and classification tasks by applying complex bayesian models that have observed as well as latent variables this paper aims to decentralize it allowing parallel computation secure learning and robustness benefits we use alternating direction method of multipliers in a topdown setting to develop a distributed svi algorithm such that independent learners running inference algorithms only require sharing the estimated model parameters instead of their private datasets our work extends the distributed sviadmm algorithm that we first propose to an admmbased networked svi algorithm in which not only are the learners working distributively but they share information according to rules of a graph by which they form a network this kind of work lies under the umbrella of deep learning over networks and we verify our algorithm for a topicmodeling problem for corpus of wikipedia articles we illustrate the results on latent dirichlet allocation lda topic model in large document classification compare performance with the centralized algorithm and use numerical experiments to corroborate the analytical results | [['owing', 'to', 'the', 'recent', 'advances', 'in', 'big', 'data', 'modeling', 'and', 'prediction', 'tasks', 'variational', 'bayesian', 'estimation', 'has', 'gained', 'popularity', 'due', 'to', 'their', 'ability', 'to', 'provide', 'exact', 'solutions', 'to', 'approximate', 'posteriors', 'one', 'key', 'technique', 'for', 'approximate', 'inference', 'is', 'stochastic', 'variational', 'inference', 'svi', 'svi', 'poses', 'variational', 'inference', 'as', 'a', 'stochastic', 'optimization', 'problem', 'and', 'solves', 'it', 'iteratively', 'using', 'noisy', 'gradient', 'estimates', 'it', 'aims', 'to', 'handle', 'massive', 'data', 'for', 'predictive', 'and', 'classification', 'tasks', 'by', 'applying', 'complex', 'bayesian', 'models', 'that', 'have', 'observed', 'as', 'well', 'as', 'latent', 'variables', 'this', 'paper', 'aims', 'to', 'decentralize', 'it', 'allowing', 'parallel', 'computation', 'secure', 'learning', 'and', 'robustness', 'benefits', 'we', 'use', 'alternating', 'direction', 'method', 'of', 'multipliers', 'in', 'a', 'topdown', 'setting', 'to', 'develop', 'a', 'distributed', 'svi', 'algorithm', 'such', 'that', 'independent', 'learners', 'running', 'inference', 'algorithms', 'only', 'require', 'sharing', 'the', 'estimated', 'model', 'parameters', 'instead', 'of', 'their', 'private', 'datasets', 'our', 'work', 'extends', 'the', 'distributed', 'sviadmm', 'algorithm', 'that', 'we', 'first', 'propose', 'to', 'an', 'admmbased', 'networked', 'svi', 'algorithm', 'in', 'which', 'not', 'only', 'are', 'the', 'learners', 'working', 'distributively', 'but', 'they', 'share', 'information', 'according', 'to', 'rules', 'of', 'a', 'graph', 'by', 'which', 'they', 'form', 'a', 'network', 'this', 'kind', 'of', 'work', 'lies', 'under', 'the', 'umbrella', 'of', 'deep', 'learning', 'over', 'networks', 'and', 'we', 'verify', 'our', 'algorithm', 'for', 'a', 'topicmodeling', 'problem', 'for', 'corpus', 'of', 'wikipedia', 'articles', 'we', 'illustrate', 'the', 'results', 'on', 'latent', 'dirichlet', 'allocation', 'lda', 'topic', 'model', 'in', 'large', 'document', 'classification', 'compare', 'performance', 'with', 'the', 'centralized', 'algorithm', 'and', 'use', 'numerical', 'experiments', 'to', 'corroborate', 'the', 'analytical', 'results']] | [-0.04734891115516977, -0.0595337218908348, -0.08676135953918392, 0.0781903176570482, -0.16702155534007207, -0.184314635456194, 0.09507372147783913, 0.4451414060587771, -0.30668276542285255, -0.3578291190137444, 0.10734320008817412, -0.22608209307728475, -0.17393185796752964, 0.18461911638743167, -0.11601159929419363, 0.11500036045624244, 0.13676987577323277, 0.010575136355979483, -0.05482392425457723, -0.30222343120738704, 0.2657507665782728, 0.06812962097322718, 0.33120087959588096, -0.017752022377986006, 0.13658160776129669, 0.0021408200894348227, -0.04695728734668393, -0.0027380129828549387, -0.08531407228165573, 0.2078736472527159, 0.34284235648862016, 0.22631073155560236, 0.3881630770064988, -0.4041974163496273, -0.21741746920547306, 0.10136849210926994, 0.17728219735390388, 0.12325176983970312, -0.020507440450357264, -0.30266651182331744, 0.07793257359006568, -0.18119140167814154, -0.01816291974828981, -0.18412549981694135, -0.06904614117203939, 0.018239792847627667, -0.3214306131622441, 0.06904451940950884, 0.060815640913893715, 0.02313944428655757, -0.052749295004208344, -0.11609464838864957, 0.07284862261751512, 0.10514307954739047, 0.07675699873748093, 0.04039485763105682, 0.11883032960028238, -0.12004733656016565, -0.17585334314926077, 0.34037813442193915, -0.02944690826771919, -0.2289233586738724, 0.16721720256391245, 0.019659712963522, -0.20212716631404243, 0.08214941082977767, 0.24712907953653485, 0.14154294039850737, -0.17945329120634815, 0.06755423063959308, -0.0567064977741056, 0.14106459632174287, -0.002735718250006242, -0.05569365748422125, 0.14092820991510852, 0.20784206407787237, 0.10075459875447033, 0.11504849901091914, -0.07720137415474126, -0.15427071257905148, -0.20227452809515706, -0.12266113576896115, -0.21509918739295292, -0.03212423911657516, -0.1273183364449852, -0.1581801869723474, 0.37235014563056285, 0.24753418024812365, 0.17912374181059335, 0.1355062880311578, 0.3497029588147022, 0.06283495246989888, 0.057600990212394086, 0.16099065068222615, 0.1431388188464624, 0.11397652268332457, 0.14674853877719557, -0.15865204103726194, 0.11118745890204026, 0.036785252011019134] |
1,802.10169 | Time Reversal Invariance in Quantum Mechanics | Symmetries have a crucial role in today's physics. In this thesis, we are
mostly concerned with time reversal invariance (T-symmetry). A physical system
is time reversal invariant if its underlying laws are not sensitive to the
direction of time. There are various accounts of time reversal transformation
resulting in different views on whether or not a given theory in physics is
time reversal invariant. With a focus on quantum mechanics, I describe the
standard account of time reversal and compare it with my alternative account,
arguing why it deserves serious attention. Then, I review three known ways to
T-violation in quantum mechanics, and explain two unique experiments made to
detect it in the neutral K and B mesons.
| physics.hist-ph quant-ph | symmetries have a crucial role in todays physics in this thesis we are mostly concerned with time reversal invariance tsymmetry a physical system is time reversal invariant if its underlying laws are not sensitive to the direction of time there are various accounts of time reversal transformation resulting in different views on whether or not a given theory in physics is time reversal invariant with a focus on quantum mechanics i describe the standard account of time reversal and compare it with my alternative account arguing why it deserves serious attention then i review three known ways to tviolation in quantum mechanics and explain two unique experiments made to detect it in the neutral k and b mesons | [['symmetries', 'have', 'a', 'crucial', 'role', 'in', 'todays', 'physics', 'in', 'this', 'thesis', 'we', 'are', 'mostly', 'concerned', 'with', 'time', 'reversal', 'invariance', 'tsymmetry', 'a', 'physical', 'system', 'is', 'time', 'reversal', 'invariant', 'if', 'its', 'underlying', 'laws', 'are', 'not', 'sensitive', 'to', 'the', 'direction', 'of', 'time', 'there', 'are', 'various', 'accounts', 'of', 'time', 'reversal', 'transformation', 'resulting', 'in', 'different', 'views', 'on', 'whether', 'or', 'not', 'a', 'given', 'theory', 'in', 'physics', 'is', 'time', 'reversal', 'invariant', 'with', 'a', 'focus', 'on', 'quantum', 'mechanics', 'i', 'describe', 'the', 'standard', 'account', 'of', 'time', 'reversal', 'and', 'compare', 'it', 'with', 'my', 'alternative', 'account', 'arguing', 'why', 'it', 'deserves', 'serious', 'attention', 'then', 'i', 'review', 'three', 'known', 'ways', 'to', 'tviolation', 'in', 'quantum', 'mechanics', 'and', 'explain', 'two', 'unique', 'experiments', 'made', 'to', 'detect', 'it', 'in', 'the', 'neutral', 'k', 'and', 'b', 'mesons']] | [-0.11902542163097986, 0.16543657443943924, -0.11149732133973453, 0.09763579682340466, -0.08619468839112986, -0.20194969502656515, -0.0002650514243060123, 0.3823556238153981, -0.2767798569984734, -0.3036584846233412, 0.08795709217557195, -0.2365934072157084, -0.14082601457100236, 0.1288829246966042, -0.048495205762496184, 0.03215375776605886, -0.0023030387947998816, 0.03278940278934157, -0.06877696889026438, -0.23872602406013124, 0.2750347976126882, 0.013482858709028085, 0.2856426156477182, 0.05779473337550032, 0.06885226942614604, -0.010536738653604131, -0.08521710235183522, 0.01646083530622645, -0.09693713874903397, 0.023106690952988437, 0.23533073349626957, 0.12114820646721933, 0.24931438548206272, -0.47686223888580326, -0.18324155320208205, 0.10352570837525399, 0.09697001733150239, 0.11542890291913586, -0.08142881918011896, -0.28184652279162686, 0.05910713610365608, -0.09923100005046039, -0.12522845014424647, -0.07921107204125846, 0.09227573659105258, -0.07706263677169711, -0.15235541946446066, 0.053681064590556944, 0.0957665664530596, 0.08444997182380314, -0.021957798445620968, -0.07302403658277244, 0.02715604647429723, 0.10634283470660764, 0.1152202789474405, 0.031952770280856954, 0.10129738697719018, -0.10072400586450693, -0.1563389277503968, 0.46933920094269815, -0.012818233604282456, -0.21279970007175106, 0.19983766471051564, -0.15882119926489827, -0.2019249824333494, 0.07195592626250523, 0.14525803047532249, 0.09640058200072371, -0.15618637200618574, 0.10284396687915186, -0.029895496035736623, 0.16027118874145513, 0.0205033691836742, 0.05968592323804811, 0.24501344022712024, 0.14443105239997286, 0.012636723997213451, 0.06505833095791987, -0.0358349916020061, -0.15747303755606634, -0.34589770767774625, -0.1813384839767685, -0.1425957752616634, 0.08826566892069315, 0.01718139996141949, -0.09335401694100919, 0.3958287418078063, 0.18325770933425717, 0.19986653018948006, -0.008316697039783506, 0.27148653645368326, 0.10396379647555493, 0.0682103346813257, 0.057877647485268316, 0.2329325265472092, 0.1069349677073059, 0.13632816866324363, -0.22201648789213307, 0.10405794597799116, 0.027217174862448314] |
1,802.1017 | A simple method to obtain the all order quantum corrected Bose-Einstein
distribution | A simple method has been introduced to derive the all order quantum corrected
Bose-Einstein distribution as the solution of the Wigner equation. The process
is a perturbative one where the Bose-Einstein distribution has been taken as
the unperturbed solution. This solution has been applied to calculate the
number density of the bosons at finite temperature. The study may be important
to investigate the properties of bosons and bose condensates at finite
temperature. This process can also be applied to obtain the quantum corrected
Fermi distribution.
| cond-mat.stat-mech | a simple method has been introduced to derive the all order quantum corrected boseeinstein distribution as the solution of the wigner equation the process is a perturbative one where the boseeinstein distribution has been taken as the unperturbed solution this solution has been applied to calculate the number density of the bosons at finite temperature the study may be important to investigate the properties of bosons and bose condensates at finite temperature this process can also be applied to obtain the quantum corrected fermi distribution | [['a', 'simple', 'method', 'has', 'been', 'introduced', 'to', 'derive', 'the', 'all', 'order', 'quantum', 'corrected', 'boseeinstein', 'distribution', 'as', 'the', 'solution', 'of', 'the', 'wigner', 'equation', 'the', 'process', 'is', 'a', 'perturbative', 'one', 'where', 'the', 'boseeinstein', 'distribution', 'has', 'been', 'taken', 'as', 'the', 'unperturbed', 'solution', 'this', 'solution', 'has', 'been', 'applied', 'to', 'calculate', 'the', 'number', 'density', 'of', 'the', 'bosons', 'at', 'finite', 'temperature', 'the', 'study', 'may', 'be', 'important', 'to', 'investigate', 'the', 'properties', 'of', 'bosons', 'and', 'bose', 'condensates', 'at', 'finite', 'temperature', 'this', 'process', 'can', 'also', 'be', 'applied', 'to', 'obtain', 'the', 'quantum', 'corrected', 'fermi', 'distribution']] | [-0.07733998362194089, 0.15972207627971383, -0.17567327823489903, 0.07860886247521301, -0.015409660036675632, -0.12716598322286327, -0.02179310900871368, 0.32093481886036257, -0.23467697940273757, -0.2514009148320731, 0.07831988531877013, -0.28719222460161237, -0.03613789278794737, 0.12421388614320142, 0.02009492645807126, 0.12773501333944937, -0.022505412195973535, 0.06384468093952712, -0.06734148886273889, -0.2876544669051381, 0.3048400425023454, 0.04706407012691831, 0.29939559485544176, 0.10250009722350274, 0.12019949319827206, -0.020939494874876213, 0.05313217729220496, 0.017035267578766628, -0.1499211373136324, 0.005184012487092439, 0.23004115382757256, 0.022572072466616244, 0.2733434816931977, -0.39107744748539786, -0.24956875630818745, 0.13687225180294585, 0.20064431657905088, 0.18901421426083234, -0.05171148027567302, -0.29272520629798665, 0.04944122381070081, -0.21361425776472864, -0.2114721533787601, -0.12584763283238692, 0.020046427769257743, 0.00569750004557564, -0.2412529040401911, 0.06650204568354906, 0.0240453856120653, 0.005587246181333766, -0.038324867260149297, -0.0914718831944115, 0.006637905518907835, 0.10840354714652195, 0.02162050957284758, 0.04985350027735181, 0.09557320572408463, -0.12008888418512309, -0.05871181744424736, 0.422280992742847, -0.10924728722722434, -0.1861643575487987, 0.14913838378098956, -0.15774830192984904, -0.06754597986445707, 0.12988432617858053, 0.18271234583328752, 0.10053834431969068, -0.2029685892164707, 0.1273853370365139, -0.04489691499209798, 0.13358451741583208, 0.061384583297459515, 0.024091079053195085, 0.235025987511172, 0.1231347142444814, 0.017100163428660702, 0.19115927832694177, -0.11072196274557534, -0.12375732427462935, -0.27099639245254153, -0.18188740863081287, -0.2448209979201612, 0.07393646312000997, -0.03548483163056731, -0.17447050584151463, 0.38134532157769974, 0.15558591423802734, 0.22020358307944501, -0.020644017308950425, 0.26586937730419724, 0.26913027543410223, 0.05538318656823214, 0.023081041105529842, 0.24238397643408355, 0.19102778558838454, 0.07690960765158868, -0.24304611433626097, 0.05195531992186957, 0.09997097532374456] |
1,802.10171 | Tell Me Where to Look: Guided Attention Inference Network | Weakly supervised learning with only coarse labels can obtain visual
explanations of deep neural network such as attention maps by back-propagating
gradients. These attention maps are then available as priors for tasks such as
object localization and semantic segmentation. In one common framework we
address three shortcomings of previous approaches in modeling such attention
maps: We (1) first time make attention maps an explicit and natural component
of the end-to-end training, (2) provide self-guidance directly on these maps by
exploring supervision form the network itself to improve them, and (3)
seamlessly bridge the gap between using weak and extra supervision if
available. Despite its simplicity, experiments on the semantic segmentation
task demonstrate the effectiveness of our methods. We clearly surpass the
state-of-the-art on Pascal VOC 2012 val. and test set. Besides, the proposed
framework provides a way not only explaining the focus of the learner but also
feeding back with direct guidance towards specific tasks. Under mild
assumptions our method can also be understood as a plug-in to existing weakly
supervised learners to improve their generalization performance.
| cs.CV cs.LG | weakly supervised learning with only coarse labels can obtain visual explanations of deep neural network such as attention maps by backpropagating gradients these attention maps are then available as priors for tasks such as object localization and semantic segmentation in one common framework we address three shortcomings of previous approaches in modeling such attention maps we 1 first time make attention maps an explicit and natural component of the endtoend training 2 provide selfguidance directly on these maps by exploring supervision form the network itself to improve them and 3 seamlessly bridge the gap between using weak and extra supervision if available despite its simplicity experiments on the semantic segmentation task demonstrate the effectiveness of our methods we clearly surpass the stateoftheart on pascal voc 2012 val and test set besides the proposed framework provides a way not only explaining the focus of the learner but also feeding back with direct guidance towards specific tasks under mild assumptions our method can also be understood as a plugin to existing weakly supervised learners to improve their generalization performance | [['weakly', 'supervised', 'learning', 'with', 'only', 'coarse', 'labels', 'can', 'obtain', 'visual', 'explanations', 'of', 'deep', 'neural', 'network', 'such', 'as', 'attention', 'maps', 'by', 'backpropagating', 'gradients', 'these', 'attention', 'maps', 'are', 'then', 'available', 'as', 'priors', 'for', 'tasks', 'such', 'as', 'object', 'localization', 'and', 'semantic', 'segmentation', 'in', 'one', 'common', 'framework', 'we', 'address', 'three', 'shortcomings', 'of', 'previous', 'approaches', 'in', 'modeling', 'such', 'attention', 'maps', 'we', '1', 'first', 'time', 'make', 'attention', 'maps', 'an', 'explicit', 'and', 'natural', 'component', 'of', 'the', 'endtoend', 'training', '2', 'provide', 'selfguidance', 'directly', 'on', 'these', 'maps', 'by', 'exploring', 'supervision', 'form', 'the', 'network', 'itself', 'to', 'improve', 'them', 'and', '3', 'seamlessly', 'bridge', 'the', 'gap', 'between', 'using', 'weak', 'and', 'extra', 'supervision', 'if', 'available', 'despite', 'its', 'simplicity', 'experiments', 'on', 'the', 'semantic', 'segmentation', 'task', 'demonstrate', 'the', 'effectiveness', 'of', 'our', 'methods', 'we', 'clearly', 'surpass', 'the', 'stateoftheart', 'on', 'pascal', 'voc', '2012', 'val', 'and', 'test', 'set', 'besides', 'the', 'proposed', 'framework', 'provides', 'a', 'way', 'not', 'only', 'explaining', 'the', 'focus', 'of', 'the', 'learner', 'but', 'also', 'feeding', 'back', 'with', 'direct', 'guidance', 'towards', 'specific', 'tasks', 'under', 'mild', 'assumptions', 'our', 'method', 'can', 'also', 'be', 'understood', 'as', 'a', 'plugin', 'to', 'existing', 'weakly', 'supervised', 'learners', 'to', 'improve', 'their', 'generalization', 'performance']] | [0.0009549097329991954, -0.03397000163377842, -0.035155439569445494, 0.08941565130755241, -0.1495350961816836, -0.1952522553910967, 0.06002128382268976, 0.4854939389677549, -0.26808590381617914, -0.3465199897393838, 0.07944229938915338, -0.2515437565558717, -0.18394133696545562, 0.2096482495408881, -0.13777380323646907, 0.0697763140081158, 0.16063778824040623, 0.050445778603799146, -0.08070330223100344, -0.28870318516287213, 0.3205198376632655, 0.04258623941578579, 0.32583449892197014, 0.06763761613447886, 0.14740747164416296, -0.05532197165302932, -0.053547726486365056, -0.016625178113992497, -0.06205362424688329, 0.17404037158419008, 0.287452496912341, 0.20201384950302204, 0.3271708990399599, -0.4143415348583155, -0.25013038121158554, 0.06835182894031856, 0.1279180778709071, 0.08751642471179366, -0.029033626403940038, -0.38087150437852624, 0.07089626661300744, -0.16390907402753577, 0.04309979796314358, -0.1795055162881247, -0.03586536773681556, 0.0004398815739973956, -0.26509159817148675, 0.010829334915549473, 0.1387146778595872, 0.061303568997738526, -0.04212699516111487, -0.11576615591448816, -0.0023709028490967203, 0.20755171557539143, 0.0444683459308263, 0.06433129392892377, 0.1438950554716443, -0.21492125860293693, -0.12057129709203517, 0.336711443325674, -0.08420116358849389, -0.23758845038669693, 0.259674858100797, -0.03796978580596095, -0.17325817108873956, 0.06689274142792617, 0.19205562062879009, 0.11173518109188246, -0.14781666805819524, 0.04029001794664178, -0.059295291462066496, 0.169082395340824, 0.05949605141160481, -0.010112173590724442, 0.1932543003455397, 0.2501627352639017, 0.05887152042851085, 0.1372616753499394, -0.12207060115129438, -0.025948156248143114, -0.24217106493994256, -0.10389337493920307, -0.17225827436513183, -0.028215605676202606, -0.09998731656750434, -0.11983701434721959, 0.37380604493426456, 0.24085881529696385, 0.2536602034365801, 0.12190615549281408, 0.3598505725914782, 0.018958113332287627, 0.11312158906498966, 0.07986894767666607, 0.2188612897562879, 0.019995828537503257, 0.1090831189040645, -0.142639469050416, 0.07912487125114157, 0.08420503769924505] |
1,802.10172 | Semi-Supervised Learning Enabled by Multiscale Deep Neural Network
Inversion | Deep Neural Networks (DNNs) provide state-of-the-art solutions in several
difficult machine perceptual tasks. However, their performance relies on the
availability of a large set of labeled training data, which limits the breadth
of their applicability. Hence, there is a need for new {\em semi-supervised
learning} methods for DNNs that can leverage both (a small amount of) labeled
and unlabeled training data. In this paper, we develop a general loss function
enabling DNNs of any topology to be trained in a semi-supervised manner without
extra hyper-parameters. As opposed to current semi-supervised techniques based
on topology-specific or unstable approaches, ours is both robust and general.
We demonstrate that our approach reaches state-of-the-art performance on the
SVHN ($9.82\%$ test error, with $500$ labels and wide Resnet) and CIFAR10
(16.38% test error, with 8000 labels and sigmoid convolutional neural network)
data sets.
| cs.LG stat.ML | deep neural networks dnns provide stateoftheart solutions in several difficult machine perceptual tasks however their performance relies on the availability of a large set of labeled training data which limits the breadth of their applicability hence there is a need for new em semisupervised learning methods for dnns that can leverage both a small amount of labeled and unlabeled training data in this paper we develop a general loss function enabling dnns of any topology to be trained in a semisupervised manner without extra hyperparameters as opposed to current semisupervised techniques based on topologyspecific or unstable approaches ours is both robust and general we demonstrate that our approach reaches stateoftheart performance on the svhn 982 test error with 500 labels and wide resnet and cifar10 1638 test error with 8000 labels and sigmoid convolutional neural network data sets | [['deep', 'neural', 'networks', 'dnns', 'provide', 'stateoftheart', 'solutions', 'in', 'several', 'difficult', 'machine', 'perceptual', 'tasks', 'however', 'their', 'performance', 'relies', 'on', 'the', 'availability', 'of', 'a', 'large', 'set', 'of', 'labeled', 'training', 'data', 'which', 'limits', 'the', 'breadth', 'of', 'their', 'applicability', 'hence', 'there', 'is', 'a', 'need', 'for', 'new', 'em', 'semisupervised', 'learning', 'methods', 'for', 'dnns', 'that', 'can', 'leverage', 'both', 'a', 'small', 'amount', 'of', 'labeled', 'and', 'unlabeled', 'training', 'data', 'in', 'this', 'paper', 'we', 'develop', 'a', 'general', 'loss', 'function', 'enabling', 'dnns', 'of', 'any', 'topology', 'to', 'be', 'trained', 'in', 'a', 'semisupervised', 'manner', 'without', 'extra', 'hyperparameters', 'as', 'opposed', 'to', 'current', 'semisupervised', 'techniques', 'based', 'on', 'topologyspecific', 'or', 'unstable', 'approaches', 'ours', 'is', 'both', 'robust', 'and', 'general', 'we', 'demonstrate', 'that', 'our', 'approach', 'reaches', 'stateoftheart', 'performance', 'on', 'the', 'svhn', '982', 'test', 'error', 'with', '500', 'labels', 'and', 'wide', 'resnet', 'and', 'cifar10', '1638', 'test', 'error', 'with', '8000', 'labels', 'and', 'sigmoid', 'convolutional', 'neural', 'network', 'data', 'sets']] | [-0.03085030647280225, -0.02285918104632275, -0.007595189588729048, 0.09162898507244531, -0.14446142331499906, -0.19486606473538237, 0.09527631009925483, 0.4688880952333447, -0.23176357135122275, -0.3646120793614401, 0.07608684283990522, -0.26995813129401774, -0.1744403483526251, 0.23828591697128748, -0.1725427835132845, 0.14044845327106134, 0.21537200313904425, 0.052816221356454786, -0.08158929681704535, -0.3525174845598067, 0.30157600689924113, 0.02242834582720054, 0.37521077298226146, 0.026533622748429214, 0.14021121515352006, -0.08312597377123787, 0.014075745198574855, -0.009557594544335819, -0.03548838239875673, 0.20456840191036463, 0.3216072918616072, 0.244678419176829, 0.3688652687264185, -0.39672019824310867, -0.21535362975576716, 0.1285496023840468, 0.1214584926309839, 0.1172461189783389, -0.02184531393475375, -0.33962367485909567, 0.11733550267178483, -0.17029040832290032, 0.06437041105389812, -0.2155239511804696, -0.041719312076014974, 0.01405550558442916, -0.3175178125745406, 0.04019172333459621, 0.0846252239259966, 0.10507914899800816, -0.04159916274208766, -0.13742919120237396, 0.027504666140778875, 0.1281055329982735, 0.024810470202189946, 0.08774022599189359, 0.13049823011400818, -0.21255591825792824, -0.15433752236982984, 0.31340362871215294, -0.07710581123624949, -0.21782618166919607, 0.22549309402476506, 0.022984210272611928, -0.1319614152838714, 0.09577512361761863, 0.2749240317816989, 0.13319176222014167, -0.14393436220087055, 0.03415662969120975, -0.019330383162863934, 0.19125614302355226, 0.03506767315395774, 0.004574169674174466, 0.1346297979645472, 0.3173032901283816, 0.02107111440060565, 0.1351942767645742, -0.17736653760109558, -0.02253647687008781, -0.21474788523190758, -0.04572927350191957, -0.22387579337347055, 0.019141626840008655, -0.16157478801377143, -0.18859771906099126, 0.36853359630977206, 0.24242955448962475, 0.2525839091067875, 0.1887352280463194, 0.3660086575270134, -0.013150061399868799, 0.1579770443206449, 0.1606823191825083, 0.20500097033333198, 0.020367419688765258, 0.12935146162571914, -0.11925237091091617, 0.078768339383681, -0.001293175269163003] |
1,802.10173 | The product of the eigenvalues of a symmetric tensor | We study E-eigenvalues of a symmetric tensor $f$ of degree $d$ on a
finite-dimensional Euclidean vector space $V$, and their relation with the
E-characteristic polynomial of $f$. We show that the leading coefficient of the
E-characteristic polynomial of $f$, when it has maximum degree, is the
$(d-2)$-th power (respectively the $((d-2)/2)$-th power) when $d$ is odd
(respectively when $d$ is even) of the $\widetilde{Q}$-discriminant, where
$\widetilde{Q}$ is the $d$-th Veronese embedding of the isotropic quadric
$Q\subseteq\mathbb{P}(V)$. This fact, together with a known formula for the
constant term of the E-characteristic polynomial of $f$, leads to a closed
formula for the product of the E-eigenvalues of $f$, which generalizes the fact
that the determinant of a symmetric matrix is equal to the product of its
eigenvalues.
| math.AG | we study eeigenvalues of a symmetric tensor f of degree d on a finitedimensional euclidean vector space v and their relation with the echaracteristic polynomial of f we show that the leading coefficient of the echaracteristic polynomial of f when it has maximum degree is the d2th power respectively the d22th power when d is odd respectively when d is even of the widetildeqdiscriminant where widetildeq is the dth veronese embedding of the isotropic quadric qsubseteqmathbbpv this fact together with a known formula for the constant term of the echaracteristic polynomial of f leads to a closed formula for the product of the eeigenvalues of f which generalizes the fact that the determinant of a symmetric matrix is equal to the product of its eigenvalues | [['we', 'study', 'eeigenvalues', 'of', 'a', 'symmetric', 'tensor', 'f', 'of', 'degree', 'd', 'on', 'a', 'finitedimensional', 'euclidean', 'vector', 'space', 'v', 'and', 'their', 'relation', 'with', 'the', 'echaracteristic', 'polynomial', 'of', 'f', 'we', 'show', 'that', 'the', 'leading', 'coefficient', 'of', 'the', 'echaracteristic', 'polynomial', 'of', 'f', 'when', 'it', 'has', 'maximum', 'degree', 'is', 'the', 'd2th', 'power', 'respectively', 'the', 'd22th', 'power', 'when', 'd', 'is', 'odd', 'respectively', 'when', 'd', 'is', 'even', 'of', 'the', 'widetildeqdiscriminant', 'where', 'widetildeq', 'is', 'the', 'dth', 'veronese', 'embedding', 'of', 'the', 'isotropic', 'quadric', 'qsubseteqmathbbpv', 'this', 'fact', 'together', 'with', 'a', 'known', 'formula', 'for', 'the', 'constant', 'term', 'of', 'the', 'echaracteristic', 'polynomial', 'of', 'f', 'leads', 'to', 'a', 'closed', 'formula', 'for', 'the', 'product', 'of', 'the', 'eeigenvalues', 'of', 'f', 'which', 'generalizes', 'the', 'fact', 'that', 'the', 'determinant', 'of', 'a', 'symmetric', 'matrix', 'is', 'equal', 'to', 'the', 'product', 'of', 'its', 'eigenvalues']] | [-0.19588530506969484, 0.08780683757937398, -0.04892290593317348, -0.01575656006620689, -0.059694579375276634, -0.1369517642219574, -0.02132177094193868, 0.2810467453750451, -0.3038938975708236, -0.20812362286623967, 0.06746096320234793, -0.26643970828072344, -0.1606818768965496, 0.16287303500431627, -0.02602988012781567, -0.004018487255300649, 0.010009175464801956, 0.17076062372585465, -0.11648221946829422, -0.30366500151489884, 0.3617420454532647, -0.012558900674204688, 0.19553987415168772, 0.08068470549500309, 0.12733367173970978, -0.0010868569081726152, -0.0036167380407698883, -0.002300231077002115, -0.11949594394741138, 0.14626635573534988, 0.2173608327630815, 0.11896556427640732, 0.2309888806386489, -0.32564216228740767, -0.12527627997439017, 0.21601073557899664, 0.09131772998116203, 0.0017500869142784436, 0.05363023965061481, -0.19784977044602317, 0.12984940304429549, -0.16832078444364496, -0.16421230380569607, -0.0262632322909449, 0.12889644933464237, 0.011424943233247508, -0.3395973088158187, 0.0833612372521465, 0.15081771106020478, 0.05203230723484673, -0.014689293198387547, -0.14646108979590175, -0.06027375412373688, 0.04696578936711962, 0.017188272937316416, 0.09178979323276372, 0.019368424199613904, -0.12384148994422217, -0.0517807513867959, 0.38170057676794117, -0.10166467852074622, -0.2417365413097557, 0.07826403357966011, -0.18602378585583662, -0.0653952064477523, 0.11491501071752042, 0.12372639282675814, 0.15398641815360958, -0.023986882526184094, 0.2235706004363192, -0.11914777598720937, 0.11062727750602279, 0.08363953501386337, -0.015293988876414201, 0.09463797985145068, 0.04789854376576841, 0.08731648723463997, 0.1777354062319356, -0.02747577982031055, -0.03750173682885722, -0.33047796680384184, -0.2002940441112319, -0.23198079373225694, 0.1310757432856466, -0.1852178177718133, -0.17541695363754176, 0.4080083450987504, 0.00935790080130716, 0.20716762383447282, 0.11327581477932601, 0.25671522811917236, 0.15531984957566192, 0.06196406797298099, 0.07020866770099095, 0.16742887078545804, 0.1919692569866407, -0.0009701771138251321, -0.20433081128088035, 0.061145947536084155, 0.1257576613171288] |
1,802.10174 | Mirrored Langevin Dynamics | We consider the problem of sampling from constrained distributions, which has
posed significant challenges to both non-asymptotic analysis and algorithmic
design. We propose a unified framework, which is inspired by the classical
mirror descent, to derive novel first-order sampling schemes. We prove that,
for a general target distribution with strongly convex potential, our framework
implies the existence of a first-order algorithm achieving
$\tilde{O}(\epsilon^{-2}d)$ convergence, suggesting that the state-of-the-art
$\tilde{O}(\epsilon^{-6}d^5)$ can be vastly improved. With the important Latent
Dirichlet Allocation (LDA) application in mind, we specialize our algorithm to
sample from Dirichlet posteriors, and derive the first non-asymptotic
$\tilde{O}(\epsilon^{-2}d^2)$ rate for first-order sampling. We further extend
our framework to the mini-batch setting and prove convergence rates when only
stochastic gradients are available. Finally, we report promising experimental
results for LDA on real datasets.
| cs.LG math.OC | we consider the problem of sampling from constrained distributions which has posed significant challenges to both nonasymptotic analysis and algorithmic design we propose a unified framework which is inspired by the classical mirror descent to derive novel firstorder sampling schemes we prove that for a general target distribution with strongly convex potential our framework implies the existence of a firstorder algorithm achieving tildeoepsilon2d convergence suggesting that the stateoftheart tildeoepsilon6d5 can be vastly improved with the important latent dirichlet allocation lda application in mind we specialize our algorithm to sample from dirichlet posteriors and derive the first nonasymptotic tildeoepsilon2d2 rate for firstorder sampling we further extend our framework to the minibatch setting and prove convergence rates when only stochastic gradients are available finally we report promising experimental results for lda on real datasets | [['we', 'consider', 'the', 'problem', 'of', 'sampling', 'from', 'constrained', 'distributions', 'which', 'has', 'posed', 'significant', 'challenges', 'to', 'both', 'nonasymptotic', 'analysis', 'and', 'algorithmic', 'design', 'we', 'propose', 'a', 'unified', 'framework', 'which', 'is', 'inspired', 'by', 'the', 'classical', 'mirror', 'descent', 'to', 'derive', 'novel', 'firstorder', 'sampling', 'schemes', 'we', 'prove', 'that', 'for', 'a', 'general', 'target', 'distribution', 'with', 'strongly', 'convex', 'potential', 'our', 'framework', 'implies', 'the', 'existence', 'of', 'a', 'firstorder', 'algorithm', 'achieving', 'tildeoepsilon2d', 'convergence', 'suggesting', 'that', 'the', 'stateoftheart', 'tildeoepsilon6d5', 'can', 'be', 'vastly', 'improved', 'with', 'the', 'important', 'latent', 'dirichlet', 'allocation', 'lda', 'application', 'in', 'mind', 'we', 'specialize', 'our', 'algorithm', 'to', 'sample', 'from', 'dirichlet', 'posteriors', 'and', 'derive', 'the', 'first', 'nonasymptotic', 'tildeoepsilon2d2', 'rate', 'for', 'firstorder', 'sampling', 'we', 'further', 'extend', 'our', 'framework', 'to', 'the', 'minibatch', 'setting', 'and', 'prove', 'convergence', 'rates', 'when', 'only', 'stochastic', 'gradients', 'are', 'available', 'finally', 'we', 'report', 'promising', 'experimental', 'results', 'for', 'lda', 'on', 'real', 'datasets']] | [-0.04297598784558417, -0.011001160848423723, -0.11791371021333129, 0.08741685995956623, -0.09280142987637903, -0.16366487489146894, 0.09255897310064283, 0.4139098940460488, -0.30000343576232474, -0.2886127006522445, 0.11415864194404016, -0.20924976916420598, -0.16398994558916766, 0.20093881261585525, -0.12004231777251517, 0.09807827003848876, 0.10187081296480614, -0.011877222603923359, -0.08685986692981087, -0.29484166234710013, 0.30822750191247567, 0.0512862347008646, 0.33348845032065416, 0.036741250880466876, 0.11049540496120851, -0.004255903574327628, -0.008598298720596718, 0.00800333666487041, -0.154008333644466, 0.17950902998992493, 0.2823255854485513, 0.1650833187935253, 0.3341298107267177, -0.39761334022365163, -0.2236326526590558, 0.11460443311767984, 0.16174248298029992, 0.1378333405294869, -0.10643389598780506, -0.2881587648334689, 0.10226706509449512, -0.13642767800538, -0.058162444816223645, -0.16742118812606546, -0.09929014965458664, 0.05512649995679137, -0.35793540054975553, 0.10573185644971654, 0.08210753862450058, 0.009052382507758546, -0.10175821517933478, -0.1744193705926873, 0.0959049799757497, 0.05483395769373629, 0.059747944738492084, 0.035347301318028636, 0.08325913827234604, -0.07299367197998619, -0.14059487579736946, 0.3391593035036164, -0.07516836860016811, -0.19638733508050904, 0.1699397249811495, -0.08926667567602424, -0.18948870697852888, 0.08294459907410219, 0.23962251859348874, 0.17501577529550869, -0.13580134539387112, 0.08366358125367555, -0.054777546428403885, 0.13761436469246482, 0.014800641608114043, -0.01768531967017641, 0.11273643255952111, 0.19648865778757216, 0.13064545564815516, 0.1997084956004306, -0.0841592985273938, -0.1515671332879353, -0.29546777106994804, -0.11944847060872833, -0.1612304691766757, -0.02646542705194808, -0.1377499679482746, -0.13320446548651355, 0.34252624469989723, 0.21953719613176603, 0.1809047644293701, 0.1702374983452578, 0.3065638840920472, 0.123500109392998, -0.015394866228276906, 0.140732515715207, 0.1793184927845186, 0.10123334570549601, 0.061473071221406606, -0.18747901947187015, 0.07170409988250959, 0.06552144028462989] |
1,802.10175 | Model-independent comparison of annual modulation and total rate with
direct detection experiments | The relative sensitivity of different direct detection experiments depends
sensitively on the astrophysical distribution and particle physics nature of
dark matter, prohibiting a model-independent comparison. The situation changes
fundamentally if two experiments employ the same target material. We show that
in this case one can compare measurements of an annual modulation and exclusion
bounds on the total rate while making no assumptions on astrophysics and no (or
only very general) assumptions on particle physics. In particular, we show that
the dark matter interpretation of the DAMA/LIBRA signal can be conclusively
tested with COSINUS, a future experiment employing the same target material. We
find that if COSINUS excludes a dark matter scattering rate of about
$0.01\,\text{kg}^{-1}\,\text{days}^{-1}$ with an energy threshold of $1.8\,$keV
and resolution of $0.2\,$keV, it will rule out all explanations of DAMA/LIBRA
in terms of dark matter scattering off sodium and/or iodine.
| hep-ph astro-ph.CO | the relative sensitivity of different direct detection experiments depends sensitively on the astrophysical distribution and particle physics nature of dark matter prohibiting a modelindependent comparison the situation changes fundamentally if two experiments employ the same target material we show that in this case one can compare measurements of an annual modulation and exclusion bounds on the total rate while making no assumptions on astrophysics and no or only very general assumptions on particle physics in particular we show that the dark matter interpretation of the damalibra signal can be conclusively tested with cosinus a future experiment employing the same target material we find that if cosinus excludes a dark matter scattering rate of about 001textkg1textdays1 with an energy threshold of 18kev and resolution of 02kev it will rule out all explanations of damalibra in terms of dark matter scattering off sodium andor iodine | [['the', 'relative', 'sensitivity', 'of', 'different', 'direct', 'detection', 'experiments', 'depends', 'sensitively', 'on', 'the', 'astrophysical', 'distribution', 'and', 'particle', 'physics', 'nature', 'of', 'dark', 'matter', 'prohibiting', 'a', 'modelindependent', 'comparison', 'the', 'situation', 'changes', 'fundamentally', 'if', 'two', 'experiments', 'employ', 'the', 'same', 'target', 'material', 'we', 'show', 'that', 'in', 'this', 'case', 'one', 'can', 'compare', 'measurements', 'of', 'an', 'annual', 'modulation', 'and', 'exclusion', 'bounds', 'on', 'the', 'total', 'rate', 'while', 'making', 'no', 'assumptions', 'on', 'astrophysics', 'and', 'no', 'or', 'only', 'very', 'general', 'assumptions', 'on', 'particle', 'physics', 'in', 'particular', 'we', 'show', 'that', 'the', 'dark', 'matter', 'interpretation', 'of', 'the', 'damalibra', 'signal', 'can', 'be', 'conclusively', 'tested', 'with', 'cosinus', 'a', 'future', 'experiment', 'employing', 'the', 'same', 'target', 'material', 'we', 'find', 'that', 'if', 'cosinus', 'excludes', 'a', 'dark', 'matter', 'scattering', 'rate', 'of', 'about', '001textkg1textdays1', 'with', 'an', 'energy', 'threshold', 'of', '18kev', 'and', 'resolution', 'of', '02kev', 'it', 'will', 'rule', 'out', 'all', 'explanations', 'of', 'damalibra', 'in', 'terms', 'of', 'dark', 'matter', 'scattering', 'off', 'sodium', 'andor', 'iodine']] | [-0.10405004579005829, 0.153718879131199, -0.12507545096297742, 0.11094285208477593, -0.1056056214688042, -0.11948837698866607, 0.059876341115541305, 0.3298591760363668, -0.21551125011479494, -0.3620986953701375, 0.06973673117013503, -0.2794164565147449, -0.06397185647853565, 0.2077205945268696, 0.012320611711776426, -0.003317303453565489, 0.06679393038655637, 0.05381562190249245, -0.068768223612206, -0.24418718883675253, 0.29183403567034516, 0.11461995662592933, 0.2600350644280936, 0.1103034904639481, 0.10635651682226106, 0.015769545620072843, -0.07478876360394854, -0.03833920587884619, -0.1324762134522869, 0.037141701077403756, 0.2137194854225501, 0.12047538790581021, 0.16071174339331845, -0.4379145819561701, -0.21844456361190595, 0.18245139798638246, 0.11590075521343486, 0.08206829431479969, -0.11031410679987348, -0.28108866027133633, 0.04585608063762717, -0.1627649628418557, -0.10410505900793571, -0.0401293934976801, -0.011941650352302068, 0.02350875213436769, -0.2384370886638153, 0.08513321683796599, 0.016416013417759306, -0.013144700885387071, -0.09584217905463215, -0.1417338298030977, 0.01837720527108891, 0.006656585444517909, 0.0716122822945026, -0.03861257175630923, 0.20046002258949563, -0.19227239125447862, -0.10741475384008695, 0.40813094110670667, -0.12013828018614163, -0.17755846179202728, 0.21490720971421412, -0.18341174739551672, -0.13106120280353417, 0.12499203351293262, 0.13717796737394222, 0.07768113850384739, -0.12430230361006572, 0.07393737951564398, -0.0745213050609917, 0.2503308089192402, 0.11465714261569876, 0.03758872251797481, 0.2930187050200312, 0.19930976862913485, 0.07638885128371259, 0.020607148540695033, -0.1543297934715788, -0.05111474879763043, -0.33971112508719775, -0.13480567539784502, -0.15211075097272925, 0.012515881320904174, -0.051170168733694885, -0.07768258975458774, 0.3274641158389496, 0.1479755927286778, 0.19528615715953104, -0.026012050134876202, 0.30239777549678554, 0.06683414566730221, -0.002254023619577394, 0.006305384312604441, 0.3328089015029952, 0.08684100226518955, 0.061589059883939985, -0.22553617569637743, 0.09721065563288458, -0.05442660457639565] |
1,802.10176 | Signal propagation in sensing and reciprocating cellular systems with
spatial and structural heterogeneity | Sensing and reciprocating cellular systems (SARs) are important for the
operation of many biological systems. Production in interferon (IFN) SARs is
achieved through activation of the Jak-Stat pathway, and downstream
upregulation of IFN regulatory factor (IRF)-3 and IFN transcription, but the
role that high and low affinity IFNs play in this process remains unclear. We
present a comparative between a minimal spatio-temporal partial differential
equation (PDE) model and a novel spatio-structural-temporal (SST) model for the
consideration of receptor, binding, and metabolic aspects of SAR behaviour.
Using the SST framework, we simulate single- and multi-cluster paradigms of IFN
communication. Simulations reveal a cyclic process between the binding of IFN
to the receptor, and the consequent increase in metabolism, decreasing the
propensity for binding due to the internal feed-back mechanism. One observes
the effect of heterogeneity between cellular clusters, allowing them to
individualise and increase local production, and within clusters, where we
observe `sub popular quiescence'; a process whereby intra-cluster
subpopulations reduce their binding and metabolism such that other such
subpopulations may augment their production. Finally, we observe the ability
for low affinity IFN to communicate a long range signal, where high affinity
cannot, and the breakdown of this relationship through the introduction of cell
motility. Biological systems may utilise cell motility where environments are
unrestrictive and may use fixed system, with low affinity communication, where
a localised response is desirable.
| q-bio.CB math.DS q-bio.MN | sensing and reciprocating cellular systems sars are important for the operation of many biological systems production in interferon ifn sars is achieved through activation of the jakstat pathway and downstream upregulation of ifn regulatory factor irf3 and ifn transcription but the role that high and low affinity ifns play in this process remains unclear we present a comparative between a minimal spatiotemporal partial differential equation pde model and a novel spatiostructuraltemporal sst model for the consideration of receptor binding and metabolic aspects of sar behaviour using the sst framework we simulate single and multicluster paradigms of ifn communication simulations reveal a cyclic process between the binding of ifn to the receptor and the consequent increase in metabolism decreasing the propensity for binding due to the internal feedback mechanism one observes the effect of heterogeneity between cellular clusters allowing them to individualise and increase local production and within clusters where we observe sub popular quiescence a process whereby intracluster subpopulations reduce their binding and metabolism such that other such subpopulations may augment their production finally we observe the ability for low affinity ifn to communicate a long range signal where high affinity cannot and the breakdown of this relationship through the introduction of cell motility biological systems may utilise cell motility where environments are unrestrictive and may use fixed system with low affinity communication where a localised response is desirable | [['sensing', 'and', 'reciprocating', 'cellular', 'systems', 'sars', 'are', 'important', 'for', 'the', 'operation', 'of', 'many', 'biological', 'systems', 'production', 'in', 'interferon', 'ifn', 'sars', 'is', 'achieved', 'through', 'activation', 'of', 'the', 'jakstat', 'pathway', 'and', 'downstream', 'upregulation', 'of', 'ifn', 'regulatory', 'factor', 'irf3', 'and', 'ifn', 'transcription', 'but', 'the', 'role', 'that', 'high', 'and', 'low', 'affinity', 'ifns', 'play', 'in', 'this', 'process', 'remains', 'unclear', 'we', 'present', 'a', 'comparative', 'between', 'a', 'minimal', 'spatiotemporal', 'partial', 'differential', 'equation', 'pde', 'model', 'and', 'a', 'novel', 'spatiostructuraltemporal', 'sst', 'model', 'for', 'the', 'consideration', 'of', 'receptor', 'binding', 'and', 'metabolic', 'aspects', 'of', 'sar', 'behaviour', 'using', 'the', 'sst', 'framework', 'we', 'simulate', 'single', 'and', 'multicluster', 'paradigms', 'of', 'ifn', 'communication', 'simulations', 'reveal', 'a', 'cyclic', 'process', 'between', 'the', 'binding', 'of', 'ifn', 'to', 'the', 'receptor', 'and', 'the', 'consequent', 'increase', 'in', 'metabolism', 'decreasing', 'the', 'propensity', 'for', 'binding', 'due', 'to', 'the', 'internal', 'feedback', 'mechanism', 'one', 'observes', 'the', 'effect', 'of', 'heterogeneity', 'between', 'cellular', 'clusters', 'allowing', 'them', 'to', 'individualise', 'and', 'increase', 'local', 'production', 'and', 'within', 'clusters', 'where', 'we', 'observe', 'sub', 'popular', 'quiescence', 'a', 'process', 'whereby', 'intracluster', 'subpopulations', 'reduce', 'their', 'binding', 'and', 'metabolism', 'such', 'that', 'other', 'such', 'subpopulations', 'may', 'augment', 'their', 'production', 'finally', 'we', 'observe', 'the', 'ability', 'for', 'low', 'affinity', 'ifn', 'to', 'communicate', 'a', 'long', 'range', 'signal', 'where', 'high', 'affinity', 'can', 'not', 'and', 'the', 'breakdown', 'of', 'this', 'relationship', 'through', 'the', 'introduction', 'of', 'cell', 'motility', 'biological', 'systems', 'may', 'utilise', 'cell', 'motility', 'where', 'environments', 'are', 'unrestrictive', 'and', 'may', 'use', 'fixed', 'system', 'with', 'low', 'affinity', 'communication', 'where', 'a', 'localised', 'response', 'is', 'desirable']] | [-0.09130305130576247, 0.15264314822421823, -0.013892645062468454, 0.06988745517907417, -0.04392002446672855, -0.17858676067532947, 0.10253246367441302, 0.3677103035746856, -0.287167939509261, -0.28457493331623857, 0.03537877118635496, -0.2711398321426205, -0.23126310854432242, 0.1502637581326404, -0.05873580294402751, -0.0008760983542855091, 0.06199430976173787, 0.014922109608936415, 0.06631297913753317, -0.16995855003537272, 0.24542350978857227, 0.1001100594625041, 0.3049674977462263, 0.0885431219655446, 0.1394264743179247, -0.015776260055973792, -0.0015300245027853759, -0.025383458228162306, -0.09123732103323327, 0.13842476905879486, 0.269722376908032, 0.16240083894360038, 0.30267893678882046, -0.46166578944493497, -0.26123403500978903, 0.11326968199614484, 0.18669350859647543, 0.08112208601620688, -0.05598290029570608, -0.20187024998228323, 0.07664521422138693, -0.18579012998441308, -0.05688933059696256, -0.05339898221094227, 0.024363079326768868, 0.06852875522113389, -0.2734552108444733, 0.12438709848808609, 0.02055942857769289, 0.08866530419881188, -0.1061650314313177, -0.07885289971259246, -0.05685201299039335, 0.20619472790568952, 0.01222800766694819, -0.011205639341427629, 0.22485120386492444, -0.15190210145342242, -0.10491820036880836, 0.3649273823273865, -0.014164213901683114, -0.17320953823301924, 0.2707999197495404, -0.11749706218954553, -0.1549217237420134, 0.11660669925355964, 0.20449304132258708, 0.050044890181346086, -0.1659609317812363, 0.002902556781165737, 0.06048694502414586, 0.18640656898204352, 0.06762235658961278, 0.03692179551503994, 0.17198129702207637, 0.24789097931416548, 0.037430596630969024, 0.10113321899591293, -0.10144585434603556, -0.1004998429559401, -0.2066063370621283, -0.1702806720282423, -0.07700649179961319, 0.03912155812477748, -0.08297149442006282, -0.13907684681994537, 0.3562092611090268, 0.10066296954255649, 0.19164413828730978, 0.05647496168813484, 0.2467736840260416, 0.05355890207854202, 0.07715370321809417, -0.0012493130237085637, 0.16614478952066752, 0.09956847730303996, 0.11013077983082917, -0.2864702238254085, 0.1481086059098054, -0.005992856321831763] |
1,802.10177 | Interface properties and built-in potential profile of a
LaCrO$_3$/SrTiO$_3$ superlattice determined by standing-wave excited
photoemission spectroscopy | LaCrO$_3$ (LCO) / SrTiO$_3$ (STO) heterojunctions are intriguing due to a
polar discontinuity along (001), two distinct and controllable interface
structures [(LaO)$^+$/(TiO$_2$)$^0$ and (SrO)$^0$/(CrO$_2$)$^-$], and
interface-induced polarization. In this study, we have used soft- and hard
x-ray standing-wave excited photoemission spectroscopy (SW-XPS) to generate a
quantitative determination of the elemental depth profiles and interface
properties, band alignments, and the depth distribution of the
interface-induced built-in potentials in the two constituent oxides. We observe
an alternating charged interface configuration: a positively charged
(LaO)$^+$/(TiO$_2$)$^0$ intermediate layer at the
LCO$_\textbf{top}$/STO$_\textbf{bottom}$ interface and a negatively charged
(SrO)$^0$/(CrO$_2$)$^-$ intermediate layer at the
STO$_\textbf{top}$/LCO$_\textbf{bottom}$ interface. Using core-level SW data,
we have determined the depth distribution of species, including through the
interfaces, and these results are in excellent agreement with scanning
transmission electron microscopy and electron energy loss spectroscopy
(STEM-EELS) mapping of local structure and composition. SW-XPS also enabled
deconvolution of the LCO-contributed and STO- contributed
matrix-element-weighted density of states (MEWDOSs) from the valence band (VB)
spectra for the LCO/STO superlattice (SL). Monitoring the VB edges of the
deconvoluted MEWDOS shifts with a change in probing profile, the alternating
charge- induced built-in potentials are observed in both constituent oxides.
Finally, using a two-step simulation approach involving first core-level
binding energy shifts and then valence-band modeling, the built-in potential
gradients across the SL are resolved in detail and represented by the depth
distribution of VB edges.
| cond-mat.mtrl-sci | lacro_3 lco srtio_3 sto heterojunctions are intriguing due to a polar discontinuity along 001 two distinct and controllable interface structures laotio_20 and sro0cro_2 and interfaceinduced polarization in this study we have used soft and hard xray standingwave excited photoemission spectroscopy swxps to generate a quantitative determination of the elemental depth profiles and interface properties band alignments and the depth distribution of the interfaceinduced builtin potentials in the two constituent oxides we observe an alternating charged interface configuration a positively charged laotio_20 intermediate layer at the lco_textbftopsto_textbfbottom interface and a negatively charged sro0cro_2 intermediate layer at the sto_textbftoplco_textbfbottom interface using corelevel sw data we have determined the depth distribution of species including through the interfaces and these results are in excellent agreement with scanning transmission electron microscopy and electron energy loss spectroscopy stemeels mapping of local structure and composition swxps also enabled deconvolution of the lcocontributed and sto contributed matrixelementweighted density of states mewdoss from the valence band vb spectra for the lcosto superlattice sl monitoring the vb edges of the deconvoluted mewdos shifts with a change in probing profile the alternating charge induced builtin potentials are observed in both constituent oxides finally using a twostep simulation approach involving first corelevel binding energy shifts and then valenceband modeling the builtin potential gradients across the sl are resolved in detail and represented by the depth distribution of vb edges | [['lacro_3', 'lco', 'srtio_3', 'sto', 'heterojunctions', 'are', 'intriguing', 'due', 'to', 'a', 'polar', 'discontinuity', 'along', '001', 'two', 'distinct', 'and', 'controllable', 'interface', 'structures', 'laotio_20', 'and', 'sro0cro_2', 'and', 'interfaceinduced', 'polarization', 'in', 'this', 'study', 'we', 'have', 'used', 'soft', 'and', 'hard', 'xray', 'standingwave', 'excited', 'photoemission', 'spectroscopy', 'swxps', 'to', 'generate', 'a', 'quantitative', 'determination', 'of', 'the', 'elemental', 'depth', 'profiles', 'and', 'interface', 'properties', 'band', 'alignments', 'and', 'the', 'depth', 'distribution', 'of', 'the', 'interfaceinduced', 'builtin', 'potentials', 'in', 'the', 'two', 'constituent', 'oxides', 'we', 'observe', 'an', 'alternating', 'charged', 'interface', 'configuration', 'a', 'positively', 'charged', 'laotio_20', 'intermediate', 'layer', 'at', 'the', 'lco_textbftopsto_textbfbottom', 'interface', 'and', 'a', 'negatively', 'charged', 'sro0cro_2', 'intermediate', 'layer', 'at', 'the', 'sto_textbftoplco_textbfbottom', 'interface', 'using', 'corelevel', 'sw', 'data', 'we', 'have', 'determined', 'the', 'depth', 'distribution', 'of', 'species', 'including', 'through', 'the', 'interfaces', 'and', 'these', 'results', 'are', 'in', 'excellent', 'agreement', 'with', 'scanning', 'transmission', 'electron', 'microscopy', 'and', 'electron', 'energy', 'loss', 'spectroscopy', 'stemeels', 'mapping', 'of', 'local', 'structure', 'and', 'composition', 'swxps', 'also', 'enabled', 'deconvolution', 'of', 'the', 'lcocontributed', 'and', 'sto', 'contributed', 'matrixelementweighted', 'density', 'of', 'states', 'mewdoss', 'from', 'the', 'valence', 'band', 'vb', 'spectra', 'for', 'the', 'lcosto', 'superlattice', 'sl', 'monitoring', 'the', 'vb', 'edges', 'of', 'the', 'deconvoluted', 'mewdos', 'shifts', 'with', 'a', 'change', 'in', 'probing', 'profile', 'the', 'alternating', 'charge', 'induced', 'builtin', 'potentials', 'are', 'observed', 'in', 'both', 'constituent', 'oxides', 'finally', 'using', 'a', 'twostep', 'simulation', 'approach', 'involving', 'first', 'corelevel', 'binding', 'energy', 'shifts', 'and', 'then', 'valenceband', 'modeling', 'the', 'builtin', 'potential', 'gradients', 'across', 'the', 'sl', 'are', 'resolved', 'in', 'detail', 'and', 'represented', 'by', 'the', 'depth', 'distribution', 'of', 'vb', 'edges']] | [-0.10798624987619573, 0.14572798560566885, -0.04718682502422156, 0.05306503630199251, 0.007499196369218112, -0.1549425838678251, 0.07766215885374567, 0.48933751611596976, -0.308590952055915, -0.3378169336463518, -0.014996789250960617, -0.34255225282625945, -0.11185033162594409, 0.1293963577658955, 0.07394126082839195, 0.0398416917659514, 0.02626785317066765, -0.1043838920143609, -0.09339424881875978, -0.12090342967183015, 0.28285499732010067, 0.04052848949833142, 0.3048076478180729, 0.11692937747425129, 0.029010325308120918, 0.06682390830380851, 0.03970687194353974, 0.03427474595571993, -0.12902539159913767, 0.14807564122596978, 0.2272505135112335, -0.0391392106949974, 0.15245098942860721, -0.45206701609602173, -0.2003510199714675, -0.044390288921940024, 0.1335741644623273, 0.08972229392853595, -0.1282969612235521, -0.2679511528839851, 0.05119315471525909, -0.11675951541036642, -0.10085613386435134, -0.04362567627055716, -0.01779485358706405, 0.03598343843915006, -0.23661525420600996, 0.09851932050732677, -0.007257142655705939, 0.09941405444169923, -0.14047231694065412, -0.13160778653876606, -0.12691949479376322, 0.0945698738694706, 0.019434887608985336, 0.03217490768802571, 0.1462702503672496, -0.11313506640190224, -0.09141770341060197, 0.3105558884933093, -0.07784474925336553, -0.10002367902686068, 0.20815437714341806, -0.15894094215542903, -0.07238320114460134, 0.1527984913520103, 0.1252827804389706, 0.13043097944496723, -0.13522271133775818, 0.09339011667273758, 0.02241970485125664, 0.19538543776454498, 0.11713325984192334, 0.05814601008080602, 0.22944247425632544, 0.12914363085024042, 0.01919563853927332, 0.12022383987564542, -0.19449245927894, -0.008896406915646115, -0.2069679347150165, -0.1809170120803442, -0.17347806673668634, -0.0012945257629426669, -0.053341707136588756, -0.19634232139601135, 0.4364421241616289, 0.07644509703316833, 0.21197512737810098, -0.06140252632158165, 0.2763724431367634, 0.10300611016356112, 0.06498687543417005, 0.022683875470031655, 0.2309989661658569, 0.16332745851309377, 0.10542678909187424, -0.2560977326600902, 0.09725966678357206, -0.011202373097689334] |
1,802.10178 | On the containment problem for fat points | Given an ideal $I$, the containment problem is concerned about finding the
values $m$ and $n$ such that the $m$-th symbolic power of $I$ is contained in
its $n$-th ordinary power. In this paper we consider this problem focusing on
two classes of ideals of fat points. In particular we study the ideal of $n$
points on a line in $\mathbb{P}^N$ and the ideal of three nonlinear points in
$\mathbb{P}^N$ for $N\geq2$.
| math.AC math.AG | given an ideal i the containment problem is concerned about finding the values m and n such that the mth symbolic power of i is contained in its nth ordinary power in this paper we consider this problem focusing on two classes of ideals of fat points in particular we study the ideal of n points on a line in mathbbpn and the ideal of three nonlinear points in mathbbpn for ngeq2 | [['given', 'an', 'ideal', 'i', 'the', 'containment', 'problem', 'is', 'concerned', 'about', 'finding', 'the', 'values', 'm', 'and', 'n', 'such', 'that', 'the', 'mth', 'symbolic', 'power', 'of', 'i', 'is', 'contained', 'in', 'its', 'nth', 'ordinary', 'power', 'in', 'this', 'paper', 'we', 'consider', 'this', 'problem', 'focusing', 'on', 'two', 'classes', 'of', 'ideals', 'of', 'fat', 'points', 'in', 'particular', 'we', 'study', 'the', 'ideal', 'of', 'n', 'points', 'on', 'a', 'line', 'in', 'mathbbpn', 'and', 'the', 'ideal', 'of', 'three', 'nonlinear', 'points', 'in', 'mathbbpn', 'for', 'ngeq2']] | [-0.22612282876960105, 0.012839227648227178, 0.014073091817812787, 4.042505558269719e-05, -0.014432096685696807, -0.10960840256625994, -0.014931255574790865, 0.29793286696076393, -0.29956672671768403, -0.18512998298845357, 0.10388842269538953, -0.3464169915403343, -0.12628696035729567, 0.18776543460747538, -0.09131631950408013, 0.05933017798916909, 0.016184724039501615, 0.1050911453138623, -0.03864089512434374, -0.27785883156725, 0.4280219710845914, -0.01967904675984755, 0.19828266793047078, -0.0033078047757347426, 0.10428040047797064, -0.010775817396481417, -0.02609562667526512, 0.06440034841135558, -0.17302944179765392, 0.13758932409594613, 0.2995691200097402, 0.1394143589811089, 0.2674080168104006, -0.389785406997564, -0.10052335894498457, 0.23389470731166917, 0.13806121435482055, -0.0076466684436632525, 0.012586585216922686, -0.15744201140478253, 0.14184709654202582, -0.11113237452486323, -0.20210368337575346, 0.029832668072130118, 0.08184382452034494, 0.03288965234726978, -0.2839645627989537, -0.02226009364757273, 0.15490437278317082, 0.14355528142510188, -0.02596929435417729, -0.10767050925157189, 0.006525409058667719, 0.06630677581738888, -0.022256526218067545, -0.021442107361508533, 0.006068450359938045, -0.16081654936877182, -0.11218316849165906, 0.4281432686580552, -0.026349588549540687, -0.22497048031073064, 0.09927439314520194, -0.18433390466250582, -0.15154193745305142, 0.09787431864404222, 0.16610087246064925, 0.17034822849867245, -0.03825071360915899, 0.16989335143039674, -0.12786389916436747, 0.11378926966184129, 0.08566763068342374, 9.182385919201706e-05, 0.17825634420862319, 0.14749776250876798, 0.09020913584390655, 0.15480079983050624, -0.039868709256148174, -0.023435744405206706, -0.35221390889233184, -0.21657148414912322, -0.18504023972976333, 0.11342367183210121, -0.10906028951568361, -0.14811595503447783, 0.426044207609569, 0.12311589060765174, 0.2383002177424108, 0.034730100913697645, 0.2802264543198463, 0.11094529520616764, -0.0902300724087076, 0.10242248158384529, 0.14237990953390384, 0.07538960294591056, 0.02136097787620707, -0.19588660289688656, 0.0005622496763761672, 0.13731953143400866] |
1,802.10179 | Enhancing radical molecular beams by skimmer cooling | A high-intensity supersonic beam source has been a key component in studies
of molecular collisions, molecule-surface interaction, chemical reactions, and
precision spectroscopy. However, the molecular density available for
experiments in a downstream science chamber is limited by skimmer clogging,
which constrains the separation between a valve and a skimmer to at least
several hundred nozzle diameters. A recent experiment (Science Advances, 2017,
3, e1602258) has introduced a new strategy to address this challenge: when a
skimmer is cooled to a temperature below the freezing point of the carrier gas,
skimmer clogging can be effectively suppressed. We go beyond this
proof-of-principle work in several key ways. Firstly, we apply the skimmer
cooling approach to discharge-produced radical and metastable beams entrained
in a carrier gas. We also identify two different processes for skimmer clogging
mitigation-shockwave suppression at temperatures around the carrier gas
freezing point and diffusive clogging at even lower temperatures. With the
carrier clogging removed, we now fully optimize the production of entrained
species such as hydroxyl radicals, resulting in a gain of 30 in density over
the best commercial devices. The gain arises from both clogging mitigation and
favorable geometry with a much shorter valve-skimmer distance.
| physics.chem-ph physics.atm-clus | a highintensity supersonic beam source has been a key component in studies of molecular collisions moleculesurface interaction chemical reactions and precision spectroscopy however the molecular density available for experiments in a downstream science chamber is limited by skimmer clogging which constrains the separation between a valve and a skimmer to at least several hundred nozzle diameters a recent experiment science advances 2017 3 e1602258 has introduced a new strategy to address this challenge when a skimmer is cooled to a temperature below the freezing point of the carrier gas skimmer clogging can be effectively suppressed we go beyond this proofofprinciple work in several key ways firstly we apply the skimmer cooling approach to dischargeproduced radical and metastable beams entrained in a carrier gas we also identify two different processes for skimmer clogging mitigationshockwave suppression at temperatures around the carrier gas freezing point and diffusive clogging at even lower temperatures with the carrier clogging removed we now fully optimize the production of entrained species such as hydroxyl radicals resulting in a gain of 30 in density over the best commercial devices the gain arises from both clogging mitigation and favorable geometry with a much shorter valveskimmer distance | [['a', 'highintensity', 'supersonic', 'beam', 'source', 'has', 'been', 'a', 'key', 'component', 'in', 'studies', 'of', 'molecular', 'collisions', 'moleculesurface', 'interaction', 'chemical', 'reactions', 'and', 'precision', 'spectroscopy', 'however', 'the', 'molecular', 'density', 'available', 'for', 'experiments', 'in', 'a', 'downstream', 'science', 'chamber', 'is', 'limited', 'by', 'skimmer', 'clogging', 'which', 'constrains', 'the', 'separation', 'between', 'a', 'valve', 'and', 'a', 'skimmer', 'to', 'at', 'least', 'several', 'hundred', 'nozzle', 'diameters', 'a', 'recent', 'experiment', 'science', 'advances', '2017', '3', 'e1602258', 'has', 'introduced', 'a', 'new', 'strategy', 'to', 'address', 'this', 'challenge', 'when', 'a', 'skimmer', 'is', 'cooled', 'to', 'a', 'temperature', 'below', 'the', 'freezing', 'point', 'of', 'the', 'carrier', 'gas', 'skimmer', 'clogging', 'can', 'be', 'effectively', 'suppressed', 'we', 'go', 'beyond', 'this', 'proofofprinciple', 'work', 'in', 'several', 'key', 'ways', 'firstly', 'we', 'apply', 'the', 'skimmer', 'cooling', 'approach', 'to', 'dischargeproduced', 'radical', 'and', 'metastable', 'beams', 'entrained', 'in', 'a', 'carrier', 'gas', 'we', 'also', 'identify', 'two', 'different', 'processes', 'for', 'skimmer', 'clogging', 'mitigationshockwave', 'suppression', 'at', 'temperatures', 'around', 'the', 'carrier', 'gas', 'freezing', 'point', 'and', 'diffusive', 'clogging', 'at', 'even', 'lower', 'temperatures', 'with', 'the', 'carrier', 'clogging', 'removed', 'we', 'now', 'fully', 'optimize', 'the', 'production', 'of', 'entrained', 'species', 'such', 'as', 'hydroxyl', 'radicals', 'resulting', 'in', 'a', 'gain', 'of', '30', 'in', 'density', 'over', 'the', 'best', 'commercial', 'devices', 'the', 'gain', 'arises', 'from', 'both', 'clogging', 'mitigation', 'and', 'favorable', 'geometry', 'with', 'a', 'much', 'shorter', 'valveskimmer', 'distance']] | [-0.09077294048590072, 0.20489595098357918, -0.0684761537425705, 0.009018851111856444, -0.005296907900628867, -0.14670109809958376, 0.07888104661348432, 0.36949615486567683, -0.27639520583761623, -0.2856132776675319, 0.0708074425868593, -0.2821426435233055, -0.045386731831968063, 0.19982355469740773, -0.01614415286894655, 0.03610749598495507, 0.006596222728452024, -0.06415891523223156, -0.056554027967649745, -0.19193878929218045, 0.23754532132079476, 0.10952453674205269, 0.2727031474544977, 0.14046547191780215, 0.11190640436082806, -0.09450457562828281, 0.03794876792047338, -0.0022117547705420293, -0.164710924710865, 0.042268332655567065, 0.28473934705137555, 0.03239837829581423, 0.28691432777319886, -0.45136549103578244, -0.2748059349760297, 0.07652936176843166, 0.15487004229604887, 0.14400299552107754, -0.0925333204237783, -0.2305569255258888, 0.02777472790815712, -0.19098530162591487, -0.14838099629916238, 0.0036423050890637874, 0.014481772369132765, 0.014228038027643683, -0.23275264263247664, 0.08484292637376711, 0.013970090854854789, 0.07597143000142144, -0.011070473330391906, -0.11627238727184401, 0.0002882122219792412, 0.09080402889912875, 0.018633364922607143, 0.05085825743541742, 0.25002981006643193, -0.13201177096258712, -0.057387629654840566, 0.36550493134806555, -0.05221133474697126, -0.0947351820395852, 0.26696351302113425, -0.1686230176104194, -0.09473250221587175, 0.23022713252945928, 0.18336712768268626, 0.09431905459981256, -0.1613468737017835, -0.016665917295237403, 0.005164144347266604, 0.17867227350294948, 0.1547504427956786, -0.0024149958953785244, 0.23835791469658338, 0.2402005705710811, 0.07057883183006197, 0.12573586154455066, -0.1567272391160562, -0.0750874233600977, -0.22496553966933183, -0.15600654897328545, -0.16348058255001283, 0.040535963247142114, -0.025944596876418775, -0.061376867844955996, 0.3333781711820241, 0.16460725177027294, 0.18953574734041467, -0.05146590449112409, 0.3460648449702906, 0.03942193423123778, 0.08205960277579531, 0.068451852525565, 0.21531146247192132, 0.1358138385839993, 0.1296045946819504, -0.2295031498639825, 0.07150684853513667, -0.015892271752818488] |
1,802.1018 | Role colouring graphs in hereditary classes | We study the computational complexity of computing role colourings of graphs
in hereditary classes. We are interested in describing the family of hereditary
classes on which a role colouring with k colours can be computed in polynomial
time. In particular, we wish to describe the boundary between the "hard" and
"easy" classes. The notion of a boundary class has been introduced by Alekseev
in order to study such boundaries. Our main results are a boundary class for
the k-role colouring problem and the related k-coupon colouring problem which
has recently received a lot of attention in the literature. The latter result
makes use of a technique for generating regular graphs of arbitrary girth which
may be of independent interest.
| cs.CC math.CO | we study the computational complexity of computing role colourings of graphs in hereditary classes we are interested in describing the family of hereditary classes on which a role colouring with k colours can be computed in polynomial time in particular we wish to describe the boundary between the hard and easy classes the notion of a boundary class has been introduced by alekseev in order to study such boundaries our main results are a boundary class for the krole colouring problem and the related kcoupon colouring problem which has recently received a lot of attention in the literature the latter result makes use of a technique for generating regular graphs of arbitrary girth which may be of independent interest | [['we', 'study', 'the', 'computational', 'complexity', 'of', 'computing', 'role', 'colourings', 'of', 'graphs', 'in', 'hereditary', 'classes', 'we', 'are', 'interested', 'in', 'describing', 'the', 'family', 'of', 'hereditary', 'classes', 'on', 'which', 'a', 'role', 'colouring', 'with', 'k', 'colours', 'can', 'be', 'computed', 'in', 'polynomial', 'time', 'in', 'particular', 'we', 'wish', 'to', 'describe', 'the', 'boundary', 'between', 'the', 'hard', 'and', 'easy', 'classes', 'the', 'notion', 'of', 'a', 'boundary', 'class', 'has', 'been', 'introduced', 'by', 'alekseev', 'in', 'order', 'to', 'study', 'such', 'boundaries', 'our', 'main', 'results', 'are', 'a', 'boundary', 'class', 'for', 'the', 'krole', 'colouring', 'problem', 'and', 'the', 'related', 'kcoupon', 'colouring', 'problem', 'which', 'has', 'recently', 'received', 'a', 'lot', 'of', 'attention', 'in', 'the', 'literature', 'the', 'latter', 'result', 'makes', 'use', 'of', 'a', 'technique', 'for', 'generating', 'regular', 'graphs', 'of', 'arbitrary', 'girth', 'which', 'may', 'be', 'of', 'independent', 'interest']] | [-0.13193642153893992, 0.0903942374398111, -0.04597046156808481, 0.040410447076468146, -0.12692895935753645, -0.10603824507650304, 0.0008501822910255799, 0.3970172308795786, -0.27453849916109596, -0.328809785810536, 0.10692227450475665, -0.23765749032845943, -0.1600777902620671, 0.17717264610183844, -0.15054204126709472, 0.08028046105656836, 0.0671982590377457, 0.06323382233553645, -0.012841235451652841, -0.27115147750256424, 0.34178602297679855, -0.030808285952119503, 0.21234451231972898, 0.0739486812913822, 0.0426340057096302, 0.007025119264499616, -0.03897161217864161, 0.09975855750963092, -0.17686449463274015, 0.12790699022372207, 0.30455969858093784, 0.11399017630772167, 0.29459100270296557, -0.35885742009948873, -0.18398316020059194, 0.20104809528635026, 0.09861635216990272, 0.10911912276208306, -0.04522351294428394, -0.2236977229763012, 0.1183945945566678, -0.14335415762517664, -0.10918751001452744, -0.026261202777909526, 0.08301164460826223, 0.007855155627574708, -0.2525848875816722, -0.025296418331721325, 0.10087706267407512, 0.052985964310148306, 0.002265090205690871, -0.1135931708731578, -0.0007743771874614186, 0.13552564993832197, 0.013308862200543538, 0.04112086730803979, 0.001495309402945183, -0.13622498611714376, -0.15137221530805958, 0.38822018362382443, 0.01166930170710025, -0.19196264873361374, 0.17799081159282035, -0.11664178531017091, -0.2161134158466327, 0.0964130612161263, 0.18349170141806037, 0.1531524737760172, -0.12740103146692705, 0.1450751786370825, -0.10490924396682373, 0.07738219472082426, 0.11650492064457513, 0.062467407072120805, 0.16197519266378071, 0.1276138731460008, 0.08426510919303776, 0.24874599760603475, 0.0017721648328006268, -0.07387785990406776, -0.2730544417252038, -0.15003438049264378, -0.1907826262916896, 0.041787979457432685, -0.10331576427428044, -0.19687645708731674, 0.4282320505461924, 0.13345261283664792, 0.17692175552533088, 0.07749635410806859, 0.2018488392379861, 0.09820638711552404, 0.07412173355913769, 0.10224901861116542, 0.15814382726547577, 0.17366469223091727, 0.03372955840017836, -0.17604598022950024, 0.11610159266866364, 0.15265212153968544] |
1,802.10181 | The effects of shear and near tip deformations on interface fracture of
symmetric sandwich beams | The effects of shear on energy release rate and mode mixity in a symmetric
sandwich beam with isotropic layers and a debond crack at the face sheet/core
interface are investigated through a semi-analytic approach based on
two-dimensional elasticity and linear elastic fracture mechanics. Semi-analytic
expressions are derived for the shear components of energy release rate and
mode mixity phase angle which depend on four numerical coefficients derived
through accurate finite element analyses. The expressions are combined with
earlier results for three-layer configurations subjected to bending-moments and
axial forces to obtain solutions for sandwich beams under general loading
conditions and for an extensive range of geometrical and material properties.
The results are applicable to laboratory specimens used for the
characterization of the fracture properties of sandwich composites for civil,
marine, energy and aeronautical applications, provided the lengths of the crack
and the ligament ahead of the crack tip are above minimum lengths. The physical
and mechanical significance of the terms of the energy release rate which
depend on the shear forces are explained using structural mechanics concepts
and introducing crack tip root rotations to account for the main effects of the
near tip deformations.
| cond-mat.soft cond-mat.mtrl-sci | the effects of shear on energy release rate and mode mixity in a symmetric sandwich beam with isotropic layers and a debond crack at the face sheetcore interface are investigated through a semianalytic approach based on twodimensional elasticity and linear elastic fracture mechanics semianalytic expressions are derived for the shear components of energy release rate and mode mixity phase angle which depend on four numerical coefficients derived through accurate finite element analyses the expressions are combined with earlier results for threelayer configurations subjected to bendingmoments and axial forces to obtain solutions for sandwich beams under general loading conditions and for an extensive range of geometrical and material properties the results are applicable to laboratory specimens used for the characterization of the fracture properties of sandwich composites for civil marine energy and aeronautical applications provided the lengths of the crack and the ligament ahead of the crack tip are above minimum lengths the physical and mechanical significance of the terms of the energy release rate which depend on the shear forces are explained using structural mechanics concepts and introducing crack tip root rotations to account for the main effects of the near tip deformations | [['the', 'effects', 'of', 'shear', 'on', 'energy', 'release', 'rate', 'and', 'mode', 'mixity', 'in', 'a', 'symmetric', 'sandwich', 'beam', 'with', 'isotropic', 'layers', 'and', 'a', 'debond', 'crack', 'at', 'the', 'face', 'sheetcore', 'interface', 'are', 'investigated', 'through', 'a', 'semianalytic', 'approach', 'based', 'on', 'twodimensional', 'elasticity', 'and', 'linear', 'elastic', 'fracture', 'mechanics', 'semianalytic', 'expressions', 'are', 'derived', 'for', 'the', 'shear', 'components', 'of', 'energy', 'release', 'rate', 'and', 'mode', 'mixity', 'phase', 'angle', 'which', 'depend', 'on', 'four', 'numerical', 'coefficients', 'derived', 'through', 'accurate', 'finite', 'element', 'analyses', 'the', 'expressions', 'are', 'combined', 'with', 'earlier', 'results', 'for', 'threelayer', 'configurations', 'subjected', 'to', 'bendingmoments', 'and', 'axial', 'forces', 'to', 'obtain', 'solutions', 'for', 'sandwich', 'beams', 'under', 'general', 'loading', 'conditions', 'and', 'for', 'an', 'extensive', 'range', 'of', 'geometrical', 'and', 'material', 'properties', 'the', 'results', 'are', 'applicable', 'to', 'laboratory', 'specimens', 'used', 'for', 'the', 'characterization', 'of', 'the', 'fracture', 'properties', 'of', 'sandwich', 'composites', 'for', 'civil', 'marine', 'energy', 'and', 'aeronautical', 'applications', 'provided', 'the', 'lengths', 'of', 'the', 'crack', 'and', 'the', 'ligament', 'ahead', 'of', 'the', 'crack', 'tip', 'are', 'above', 'minimum', 'lengths', 'the', 'physical', 'and', 'mechanical', 'significance', 'of', 'the', 'terms', 'of', 'the', 'energy', 'release', 'rate', 'which', 'depend', 'on', 'the', 'shear', 'forces', 'are', 'explained', 'using', 'structural', 'mechanics', 'concepts', 'and', 'introducing', 'crack', 'tip', 'root', 'rotations', 'to', 'account', 'for', 'the', 'main', 'effects', 'of', 'the', 'near', 'tip', 'deformations']] | [-0.10434589332642512, 0.12383131989400105, -0.06198752330767274, 0.00672106949139523, -0.055593019252623485, -0.08701228156334755, 0.004437359549709796, 0.38118823229930127, -0.2671092970208972, -0.2575471791784957, 0.12098488425628735, -0.2524645863764027, -0.11875916487434927, 0.24107789093657783, 0.00975562648540509, 0.08544338351183849, 0.06517698601587964, -0.021681012008558587, -0.04239045855642847, -0.16991446402438318, 0.27997000435006403, 0.08319174282798904, 0.3643873425015292, 0.07310160311976331, 0.10258062370365281, 0.027193983865009513, 0.005473579662847113, 0.03965695275247331, -0.2387182427038736, 0.09322804350805766, 0.20541042106406499, 0.007341486270203017, 0.184050156622735, -0.4948680203759077, -0.20940288492107853, -0.0018133573448626784, 0.07840567373265926, 0.10712101581477175, -0.018933712629143014, -0.24161207426280876, 0.0735942318021315, -0.11224171700302257, -0.1593930345779548, -0.03245546043660316, 0.008424258171653872, 0.09137794890816456, -0.27463080524832634, 0.13899478820245226, 0.028049515723616508, 0.10970351178654962, -0.1144569827553314, -0.13369243964248126, -0.05368640176776348, 0.10867551069204447, 0.06554543408345802, -0.04410720783339433, 0.21425544403198404, -0.14342124373968984, -0.03518963744620066, 0.40902492188463346, 0.010857926608497248, -0.19534199161903631, 0.18697133141384503, -0.08788755438253966, -0.04403767979421033, 0.1619743356256897, 0.20902038361457864, 0.06363743650897635, -0.14914730267784515, 0.010616121069145393, 0.053084066805078683, 0.13340795696383898, 0.12272725063888112, -0.013939708052873513, 0.1925127544996197, 0.1650475863201534, 0.0158492181573477, 0.14474205451734676, -0.12007957639133665, -0.06917905756662458, -0.3328036103319591, -0.13302649303846226, -0.1400528614618328, -0.006463047102366754, -0.11923973862953662, -0.18154709642638417, 0.3869635263916242, 0.07205990226500478, 0.13837381796752887, 0.05127816827826358, 0.26164977960544517, 0.06699480263623579, 0.06463225350681087, 0.03451721071319274, 0.30253243057730156, 0.16826140858642563, 0.07053068702606513, -0.22913368992843905, 0.07796359275765131, 0.07410527630928533] |
1,802.10182 | A hybrid machine learning model to study UV-Vis spectra of gold nano
spheres | Here, we have employed Principal Component Analysis (PCA) and Linear
Discriminant Analysis (LDA) to analyze Mie calculated UV-Vis spectra of gold
nanospheres (GNS). Eigen spectra of PCA perform the Fano type resonances.3D
vector field spectra reveal the Homoclinic orbit Lorenz attractor. Quantum
confinement effects are observed by 3D representation of LDA. Standing wave
patterns resulting from oscillations of ion acoustic phonon and electron waves
are illustrated through the eigen spectra of LDA. Such capabilities of GNPs
have brought high attention for the high energy density physics applications.
Furthermore, accurate prediction of gold nanoparticle (GNP) sizes using machine
learning could provide rapid analysis without the need for expensive analysis.
Two hybrid algorithms consist of unsupervised PCA and two different supervised
ANN have been used to estimate the diameters of GNPs. PCA based artificial
neural network (ANN) were found to estimate the diameters with a high accuracy.
| physics.comp-ph cond-mat.mes-hall physics.optics physics.plasm-ph | here we have employed principal component analysis pca and linear discriminant analysis lda to analyze mie calculated uvvis spectra of gold nanospheres gns eigen spectra of pca perform the fano type resonances3d vector field spectra reveal the homoclinic orbit lorenz attractor quantum confinement effects are observed by 3d representation of lda standing wave patterns resulting from oscillations of ion acoustic phonon and electron waves are illustrated through the eigen spectra of lda such capabilities of gnps have brought high attention for the high energy density physics applications furthermore accurate prediction of gold nanoparticle gnp sizes using machine learning could provide rapid analysis without the need for expensive analysis two hybrid algorithms consist of unsupervised pca and two different supervised ann have been used to estimate the diameters of gnps pca based artificial neural network ann were found to estimate the diameters with a high accuracy | [['here', 'we', 'have', 'employed', 'principal', 'component', 'analysis', 'pca', 'and', 'linear', 'discriminant', 'analysis', 'lda', 'to', 'analyze', 'mie', 'calculated', 'uvvis', 'spectra', 'of', 'gold', 'nanospheres', 'gns', 'eigen', 'spectra', 'of', 'pca', 'perform', 'the', 'fano', 'type', 'resonances3d', 'vector', 'field', 'spectra', 'reveal', 'the', 'homoclinic', 'orbit', 'lorenz', 'attractor', 'quantum', 'confinement', 'effects', 'are', 'observed', 'by', '3d', 'representation', 'of', 'lda', 'standing', 'wave', 'patterns', 'resulting', 'from', 'oscillations', 'of', 'ion', 'acoustic', 'phonon', 'and', 'electron', 'waves', 'are', 'illustrated', 'through', 'the', 'eigen', 'spectra', 'of', 'lda', 'such', 'capabilities', 'of', 'gnps', 'have', 'brought', 'high', 'attention', 'for', 'the', 'high', 'energy', 'density', 'physics', 'applications', 'furthermore', 'accurate', 'prediction', 'of', 'gold', 'nanoparticle', 'gnp', 'sizes', 'using', 'machine', 'learning', 'could', 'provide', 'rapid', 'analysis', 'without', 'the', 'need', 'for', 'expensive', 'analysis', 'two', 'hybrid', 'algorithms', 'consist', 'of', 'unsupervised', 'pca', 'and', 'two', 'different', 'supervised', 'ann', 'have', 'been', 'used', 'to', 'estimate', 'the', 'diameters', 'of', 'gnps', 'pca', 'based', 'artificial', 'neural', 'network', 'ann', 'were', 'found', 'to', 'estimate', 'the', 'diameters', 'with', 'a', 'high', 'accuracy']] | [-0.045078533766273826, 0.050795727149104804, -0.11212956760330901, 0.08726909482053695, -0.07028023021121044, -0.18053133412872235, -0.005130677660215749, 0.4220488622312486, -0.233968864809463, -0.3280268844035972, 0.05557588111939064, -0.3156702654992437, -0.15261889113025973, 0.19354761729159187, 0.01056987945533668, 0.14418794361861526, 0.13288264004626804, -0.008131626913988535, -0.025730061454750184, -0.19082917059874185, 0.2516945564550244, 0.07241152182218179, 0.3675451988140897, -0.027060603690592364, 0.05444345383309863, 0.014666002119257528, -0.03481313523661811, 0.006216351566965588, -0.10070610632919852, 0.19391406154641622, 0.31802969688255367, 0.08052711795284671, 0.2869286613778159, -0.4545980778768555, -0.28455071537044, 0.07098275803339978, 0.16200458445948446, 0.10230945837651638, -0.022604730546946585, -0.2769797365504524, 0.0740677203009707, -0.11931308677493588, -0.10644286098815631, -0.181422724372371, -0.004449907639354933, 0.05256818014580252, -0.24646196529970943, 0.09940428722378176, 0.033023227728942096, 0.1468866748489543, -0.08864707789163934, -0.17849918318420854, -0.036851301685803466, 0.08174894215254527, 0.0389190125085103, -0.03306909877250695, 0.19571855184363407, -0.057158117906914815, -0.12834929819736215, 0.338323762452799, -0.12005998546697406, -0.14133481791294697, 0.1864407610660742, -0.06721102205726008, -0.09799195204040087, 0.18947473101757673, 0.2219440054274552, 0.05837923377920459, -0.1316866003908217, 0.04181579551408908, -0.0011058679284461606, 0.19043185144389302, 0.10453084245091304, 0.014143066357872967, 0.17996777880115486, 0.2032862676698844, -0.036373154371782825, 0.10016927392613677, -0.18769089699587008, -0.006180007293652225, -0.1473318829214097, -0.08009931167735987, -0.22243483876162726, 0.025159830253667477, -0.12652174022484056, -0.19473034898207212, 0.4131352852176254, 0.10831084836617164, 0.17868168512682636, 0.0032741381324336138, 0.28054023757835644, 0.08556818099330282, 0.06943348983056946, 0.07968545132057948, 0.2895242332613432, 0.19517197374888282, 0.10764014478869892, -0.23750690341532593, -0.013249516327050515, 0.05329803035581588] |
1,802.10183 | Free-space NPR mode locked erbrium doped fiber laser based frequency
comb for optical frequency measurement | We have specifically investigated the free-space mode locking dynamics of
erbium-doped fiber (EDF) mode-locked ultrafast lasers via nonlinear
polarization rotation (NPR) in the normal dispersion regime. To do so, we built
a passively mode-locked fiber laser based on NPR with a repetition rate of 89
MHz producing an octave-spanning spectrum due to supercontinuum (SC) generation
in highly nonlinear fiber (HNLF). Most significantly, we have achieved highly
stable self-starting NPR mode-locked femtosecond fiber laser based frequency
comb which has been running mode locked for the past one year without any need
to redo the mode locking. By using the free-space NPR comb scheme, we have not
only shortened the cavity length, but also have obtained 5 to 10 times higher
output power (more than 30 mW at central wavelength of 1570 nm) and much
broader spectral comb bandwidth (about 54 nm) compared to conventional
all-fiber cavity structure with less than 1 mW average output power and only 10
nm spectral bandwidth. The pulse output from the NPR comb is amplified through
a 1 m long EDF, then compressed by a length of anomalous dispersion fiber to a
near transform limited pulse duration. The amplified transform limited pulse,
with an average power of 180 mW and pulse duration of 70 fs, is used to
generate a supercontinuum of 140 mW. SC generation via propagation in HNLF is
optimized for specific polling period and heating temperature of PPLN crystal
for SHG around 1030 nm.
| physics.ins-det physics.optics | we have specifically investigated the freespace mode locking dynamics of erbiumdoped fiber edf modelocked ultrafast lasers via nonlinear polarization rotation npr in the normal dispersion regime to do so we built a passively modelocked fiber laser based on npr with a repetition rate of 89 mhz producing an octavespanning spectrum due to supercontinuum sc generation in highly nonlinear fiber hnlf most significantly we have achieved highly stable selfstarting npr modelocked femtosecond fiber laser based frequency comb which has been running mode locked for the past one year without any need to redo the mode locking by using the freespace npr comb scheme we have not only shortened the cavity length but also have obtained 5 to 10 times higher output power more than 30 mw at central wavelength of 1570 nm and much broader spectral comb bandwidth about 54 nm compared to conventional allfiber cavity structure with less than 1 mw average output power and only 10 nm spectral bandwidth the pulse output from the npr comb is amplified through a 1 m long edf then compressed by a length of anomalous dispersion fiber to a near transform limited pulse duration the amplified transform limited pulse with an average power of 180 mw and pulse duration of 70 fs is used to generate a supercontinuum of 140 mw sc generation via propagation in hnlf is optimized for specific polling period and heating temperature of ppln crystal for shg around 1030 nm | [['we', 'have', 'specifically', 'investigated', 'the', 'freespace', 'mode', 'locking', 'dynamics', 'of', 'erbiumdoped', 'fiber', 'edf', 'modelocked', 'ultrafast', 'lasers', 'via', 'nonlinear', 'polarization', 'rotation', 'npr', 'in', 'the', 'normal', 'dispersion', 'regime', 'to', 'do', 'so', 'we', 'built', 'a', 'passively', 'modelocked', 'fiber', 'laser', 'based', 'on', 'npr', 'with', 'a', 'repetition', 'rate', 'of', '89', 'mhz', 'producing', 'an', 'octavespanning', 'spectrum', 'due', 'to', 'supercontinuum', 'sc', 'generation', 'in', 'highly', 'nonlinear', 'fiber', 'hnlf', 'most', 'significantly', 'we', 'have', 'achieved', 'highly', 'stable', 'selfstarting', 'npr', 'modelocked', 'femtosecond', 'fiber', 'laser', 'based', 'frequency', 'comb', 'which', 'has', 'been', 'running', 'mode', 'locked', 'for', 'the', 'past', 'one', 'year', 'without', 'any', 'need', 'to', 'redo', 'the', 'mode', 'locking', 'by', 'using', 'the', 'freespace', 'npr', 'comb', 'scheme', 'we', 'have', 'not', 'only', 'shortened', 'the', 'cavity', 'length', 'but', 'also', 'have', 'obtained', '5', 'to', '10', 'times', 'higher', 'output', 'power', 'more', 'than', '30', 'mw', 'at', 'central', 'wavelength', 'of', '1570', 'nm', 'and', 'much', 'broader', 'spectral', 'comb', 'bandwidth', 'about', '54', 'nm', 'compared', 'to', 'conventional', 'allfiber', 'cavity', 'structure', 'with', 'less', 'than', '1', 'mw', 'average', 'output', 'power', 'and', 'only', '10', 'nm', 'spectral', 'bandwidth', 'the', 'pulse', 'output', 'from', 'the', 'npr', 'comb', 'is', 'amplified', 'through', 'a', '1', 'm', 'long', 'edf', 'then', 'compressed', 'by', 'a', 'length', 'of', 'anomalous', 'dispersion', 'fiber', 'to', 'a', 'near', 'transform', 'limited', 'pulse', 'duration', 'the', 'amplified', 'transform', 'limited', 'pulse', 'with', 'an', 'average', 'power', 'of', '180', 'mw', 'and', 'pulse', 'duration', 'of', '70', 'fs', 'is', 'used', 'to', 'generate', 'a', 'supercontinuum', 'of', '140', 'mw', 'sc', 'generation', 'via', 'propagation', 'in', 'hnlf', 'is', 'optimized', 'for', 'specific', 'polling', 'period', 'and', 'heating', 'temperature', 'of', 'ppln', 'crystal', 'for', 'shg', 'around', '1030', 'nm']] | [-0.12375439414648239, 0.19593261571176432, -0.04682400163950947, -0.03867662780390689, -0.06782435420108379, -0.1991564119118749, 0.05669161697696987, 0.5377507395578618, -0.2215971371136737, -0.29196835763335105, 0.08941571117732365, -0.2148141456706086, -0.006371389130609597, 0.3077048432594938, -0.038001942670521524, 0.06616489842574641, 0.013748011875441645, -0.037638659992823335, 0.025289108891704767, -0.1468009675613361, 0.19059201031420922, 0.11287047170019028, 0.35533124953508377, -0.042113939066382736, 0.12545538632802017, -0.036706827752895, 0.025279494551569803, -0.13120019488824972, -0.11781232009247657, 0.09210561115161373, 0.2315951783125022, 0.0010253339609772709, 0.2815127579960972, -0.3866642533346945, -0.24044151130785463, 0.0588099614261066, 0.15573807253498204, 0.11101361555559368, -0.04421322606582459, -0.2410449212440193, 0.13973047581976628, -0.1780328343325793, -0.09962936045690846, 0.028153627133190137, 0.03352998893831652, 0.030856024516172538, -0.23518149611946867, 0.022300408558347126, 0.02276824643889527, 0.09501998103706792, 0.023206379012923488, -0.03724729388211255, -0.05817130963507406, -0.005714041928671826, -0.059117912993035995, 0.05538195503500765, 0.18286973936857628, -0.07982918372714923, -0.09070163892815855, 0.370655000225266, -0.15134227157223107, -0.04042912747892571, 0.0870684423330298, -0.17149918465800215, 0.028117771192813192, 0.25778734070708764, 0.13617704754392906, 0.10536559766614462, -0.08271797237839526, -0.046956150211911664, 0.06395153917519074, 0.36334074285949863, 0.25321309011781207, 0.1406929309468299, 0.16466399433508638, 0.1940195676889966, 0.03720283943916288, 0.109139840023909, -0.14409423805012453, -0.016974998825940755, -0.18686127885296958, -0.04963604878263231, -0.16594496791077587, 0.09832133444542253, -0.09149822542860261, -0.06825341737244174, 0.46116856242103693, 0.09585688539006104, 0.10819274011837063, 0.030320391521201744, 0.32109619897338115, 0.16583582101181088, 0.12061422989256651, 0.04969390394954452, 0.2880047091912803, 0.16231549825592748, 0.1318321882088232, -0.22269666299737867, -0.06467789556846579, -0.0463530082908687] |
1,802.10184 | Probes for Dark Matter Physics | The existence of cosmological dark matter is in the bedrock of the modern
cosmology. The dark matter is assumed to be nonbaryonic and to consist of new
stable particles. However if composite dark matter contains stable electrically
charged leptons and quarks bound by ordinary Coulomb interaction in elusive
dark atoms, these charged constituents of dark atoms can be the subject of
direct experimental test at the colliders. In such models the excessive
negatively double charged particles are bound with primordial helium in
O-helium atoms, maintaining specific nuclear-interacting form of the dark
matter. The successful development of composite dark matter scenarios appeals
to experimental search for doubly charged constituents of dark atoms, making
experimental search for exotic stable double charged particles experimentum
crucis for dark atoms of composite dark matter. (abridged)
| hep-ph hep-ex | the existence of cosmological dark matter is in the bedrock of the modern cosmology the dark matter is assumed to be nonbaryonic and to consist of new stable particles however if composite dark matter contains stable electrically charged leptons and quarks bound by ordinary coulomb interaction in elusive dark atoms these charged constituents of dark atoms can be the subject of direct experimental test at the colliders in such models the excessive negatively double charged particles are bound with primordial helium in ohelium atoms maintaining specific nuclearinteracting form of the dark matter the successful development of composite dark matter scenarios appeals to experimental search for doubly charged constituents of dark atoms making experimental search for exotic stable double charged particles experimentum crucis for dark atoms of composite dark matter abridged | [['the', 'existence', 'of', 'cosmological', 'dark', 'matter', 'is', 'in', 'the', 'bedrock', 'of', 'the', 'modern', 'cosmology', 'the', 'dark', 'matter', 'is', 'assumed', 'to', 'be', 'nonbaryonic', 'and', 'to', 'consist', 'of', 'new', 'stable', 'particles', 'however', 'if', 'composite', 'dark', 'matter', 'contains', 'stable', 'electrically', 'charged', 'leptons', 'and', 'quarks', 'bound', 'by', 'ordinary', 'coulomb', 'interaction', 'in', 'elusive', 'dark', 'atoms', 'these', 'charged', 'constituents', 'of', 'dark', 'atoms', 'can', 'be', 'the', 'subject', 'of', 'direct', 'experimental', 'test', 'at', 'the', 'colliders', 'in', 'such', 'models', 'the', 'excessive', 'negatively', 'double', 'charged', 'particles', 'are', 'bound', 'with', 'primordial', 'helium', 'in', 'ohelium', 'atoms', 'maintaining', 'specific', 'nuclearinteracting', 'form', 'of', 'the', 'dark', 'matter', 'the', 'successful', 'development', 'of', 'composite', 'dark', 'matter', 'scenarios', 'appeals', 'to', 'experimental', 'search', 'for', 'doubly', 'charged', 'constituents', 'of', 'dark', 'atoms', 'making', 'experimental', 'search', 'for', 'exotic', 'stable', 'double', 'charged', 'particles', 'experimentum', 'crucis', 'for', 'dark', 'atoms', 'of', 'composite', 'dark', 'matter', 'abridged']] | [-0.10551832534122066, 0.3045784813786248, -0.09467304254022356, 0.15332613622662253, -0.06366243161296901, -0.19352605200300996, -0.04287826131241253, 0.2737226602693017, -0.17761693991577396, -0.40386408841094146, -0.07017052896822301, -0.3038033590723689, 0.06254720277367876, 0.08537824238793781, 0.07255188460605076, 0.03439312176241611, 0.015990028070070994, 0.009075216548696446, 0.030508795749539366, -0.29330945033580064, 0.3043900134827709, 0.05076723031054896, 0.18552824667332551, 0.06326099942939786, 0.06278431366551489, -0.012587740598246456, -0.02030612985746792, -0.09043637075676368, -0.13276210029502042, 0.10359578804256252, 0.19122065339551436, 0.06541074057324575, 0.13578243168572393, -0.4779882960737898, -0.17585481218993665, 0.24751466752316517, 0.18689311707320694, 0.12221554228666578, -0.20816073161191664, -0.3411442573182285, 0.05307853786597172, -0.19292016255181246, -0.15298101942484768, -0.0557320377502877, -0.002930880653170439, 0.012256014750948032, -0.2325302412446875, 0.14229727008182985, -0.04154617637463021, -0.11879233469506009, -0.09941205172083126, -0.14004917862072874, -0.014442623750521586, -0.07276716105496654, 0.09445227475908513, -0.09068348694216603, 0.27592853455302807, -0.27065946275990704, -0.09425801490075313, 0.46387421649235944, -0.15036237418938142, -0.14908747470292907, 0.2141621264306685, -0.10863505559794318, -0.13774888183420095, 0.1732668382473863, 0.15715007670940115, 0.10646486713264425, -0.1395060688830339, 0.1516020420499934, -0.0840494153698763, 0.1848315163766249, 0.08855616262970635, 0.08506459769918225, 0.450876240632855, 0.23518926998457082, 0.05446722340555145, 0.04130118034977036, -0.040454207129704836, -0.09385282966809777, -0.3242546072981965, -0.23515273838286074, -0.13595320463825303, 0.007316668299384988, -0.02203276229332774, -0.1558717345711417, 0.30168773051319964, 0.015633868392167363, 0.1295344861331754, -0.09687928889090051, 0.3118295176527821, -0.012257591642152805, -0.007647587348205539, -0.004989907303108619, 0.3669205934812243, 0.1723774340021639, 0.07250574021062885, -0.21869796513436504, -0.016297446662345186, -0.012695655767590954] |
1,802.10185 | Trustless Machine Learning Contracts; Evaluating and Exchanging Machine
Learning Models on the Ethereum Blockchain | Using blockchain technology, it is possible to create contracts that offer a
reward in exchange for a trained machine learning model for a particular data
set. This would allow users to train machine learning models for a reward in a
trustless manner. The smart contract will use the blockchain to automatically
validate the solution, so there would be no debate about whether the solution
was correct or not. Users who submit the solutions won't have counterparty risk
that they won't get paid for their work. Contracts can be created easily by
anyone with a dataset, even programmatically by software agents. This creates a
market where parties who are good at solving machine learning problems can
directly monetize their skillset, and where any organization or software agent
that has a problem to solve with AI can solicit solutions from all over the
world. This will incentivize the creation of better machine learning models,
and make AI more accessible to companies and software agents.
| cs.CR | using blockchain technology it is possible to create contracts that offer a reward in exchange for a trained machine learning model for a particular data set this would allow users to train machine learning models for a reward in a trustless manner the smart contract will use the blockchain to automatically validate the solution so there would be no debate about whether the solution was correct or not users who submit the solutions wont have counterparty risk that they wont get paid for their work contracts can be created easily by anyone with a dataset even programmatically by software agents this creates a market where parties who are good at solving machine learning problems can directly monetize their skillset and where any organization or software agent that has a problem to solve with ai can solicit solutions from all over the world this will incentivize the creation of better machine learning models and make ai more accessible to companies and software agents | [['using', 'blockchain', 'technology', 'it', 'is', 'possible', 'to', 'create', 'contracts', 'that', 'offer', 'a', 'reward', 'in', 'exchange', 'for', 'a', 'trained', 'machine', 'learning', 'model', 'for', 'a', 'particular', 'data', 'set', 'this', 'would', 'allow', 'users', 'to', 'train', 'machine', 'learning', 'models', 'for', 'a', 'reward', 'in', 'a', 'trustless', 'manner', 'the', 'smart', 'contract', 'will', 'use', 'the', 'blockchain', 'to', 'automatically', 'validate', 'the', 'solution', 'so', 'there', 'would', 'be', 'no', 'debate', 'about', 'whether', 'the', 'solution', 'was', 'correct', 'or', 'not', 'users', 'who', 'submit', 'the', 'solutions', 'wont', 'have', 'counterparty', 'risk', 'that', 'they', 'wont', 'get', 'paid', 'for', 'their', 'work', 'contracts', 'can', 'be', 'created', 'easily', 'by', 'anyone', 'with', 'a', 'dataset', 'even', 'programmatically', 'by', 'software', 'agents', 'this', 'creates', 'a', 'market', 'where', 'parties', 'who', 'are', 'good', 'at', 'solving', 'machine', 'learning', 'problems', 'can', 'directly', 'monetize', 'their', 'skillset', 'and', 'where', 'any', 'organization', 'or', 'software', 'agent', 'that', 'has', 'a', 'problem', 'to', 'solve', 'with', 'ai', 'can', 'solicit', 'solutions', 'from', 'all', 'over', 'the', 'world', 'this', 'will', 'incentivize', 'the', 'creation', 'of', 'better', 'machine', 'learning', 'models', 'and', 'make', 'ai', 'more', 'accessible', 'to', 'companies', 'and', 'software', 'agents']] | [-0.055133270639437536, 0.040603851659487884, -0.13659477490575317, 0.09686158854876542, -0.20380655480951163, -0.25800307676265083, 0.09749558632388527, 0.4395853367657113, -0.2766543201567536, -0.3306790103468998, 0.1280751026387867, -0.3098330415963529, -0.11102140441042498, 0.17493005508318382, -0.13933386276533574, 0.02994657117574487, 0.10280802256189125, 0.06485671043413242, 0.04741679684634113, -0.3385119618686997, 0.2841495696346011, 0.04316007228960559, 0.2731369694430427, 0.031722910913500796, 0.06440396738212763, -0.02647327034688198, 0.033291713613262226, -0.012772405366298317, -0.0672011342780204, 0.17219396114685676, 0.4154515455045862, 0.2629332653373296, 0.43190463865750733, -0.4487932026271283, -0.14172103690604368, 0.16570725176414405, 0.1338043344684267, 0.11025087810753856, -0.029007350927758472, -0.327500901253963, 0.09311979769637095, -0.26315285160815644, -0.07272543489392617, -0.1512788749087234, -0.021804868758161677, -0.010113489410242088, -0.2981006691353051, -0.09342691042628656, 0.002461724302352027, 0.03940908813613386, -0.026216430376847216, -0.03905760054189114, -0.0050443058192477, 0.18818693243708737, 0.0727974089864285, 0.03556465392610357, 0.1573611744535788, -0.17272328618442478, -0.18145977371705718, 0.38861266317501386, 0.02252093048185616, -0.19929088323584032, 0.16194861058007787, -0.017177200312783688, -0.11010935335753509, 0.06377867604807065, 0.2377492013145928, 0.06382870742545267, -0.22966087368075494, 0.03524978462222929, -0.03554810341850015, 0.20836854574592484, 0.05941002938557232, -0.06986649619648233, 0.24263620502703512, 0.15395431119615727, 0.08821617767220524, 0.05536517608813068, 0.0552437439273939, -0.10451019801419331, -0.19453467231927968, -0.1447000060385714, -0.1466999443098443, 0.05487204514981756, -0.04540618721736713, -0.1380423684000831, 0.3386663397785598, 0.23239557789121237, 0.10762172983671872, 0.08293764023570183, 0.3146507855573738, 0.0404466878340535, 0.1360773026363286, 0.16128737130202353, 0.19880003992606093, -0.06581803235328859, 0.19798006194666673, -0.10373346854351967, 0.18902655047318542, -0.04176123670796737] |
1,802.10186 | Weighted restriction estimates and application to Falconer distance set
problem | We prove some weighted Fourier restriction estimates using polynomial
partitioning and refined Strichartz estimates. As application we obtain
improved spherical average decay rates of the Fourier transform of fractal
measures, and therefore improve the results for the Falconer distance set
conjecture in three and higher dimensions.
| math.CA | we prove some weighted fourier restriction estimates using polynomial partitioning and refined strichartz estimates as application we obtain improved spherical average decay rates of the fourier transform of fractal measures and therefore improve the results for the falconer distance set conjecture in three and higher dimensions | [['we', 'prove', 'some', 'weighted', 'fourier', 'restriction', 'estimates', 'using', 'polynomial', 'partitioning', 'and', 'refined', 'strichartz', 'estimates', 'as', 'application', 'we', 'obtain', 'improved', 'spherical', 'average', 'decay', 'rates', 'of', 'the', 'fourier', 'transform', 'of', 'fractal', 'measures', 'and', 'therefore', 'improve', 'the', 'results', 'for', 'the', 'falconer', 'distance', 'set', 'conjecture', 'in', 'three', 'and', 'higher', 'dimensions']] | [-0.06124773564869943, 0.051856965474460434, -0.14431355646608965, 0.1584492095786592, -0.05232195197807058, -0.10147962565331356, 0.05650984767176535, 0.32359404550136434, -0.28339463397455605, -0.25261187888479425, 0.1680571922257988, -0.26023146649316437, -0.11438208065279153, 0.2693221430577662, -0.08445472834231939, 0.13984987386704786, 0.06505760147600718, 0.004034772844296758, -0.1525559082283112, -0.3221573202020448, 0.29400544540713663, -0.0026920494198313227, 0.26990358940447157, 0.08364010695368052, 0.03408938020710712, 0.037154392653104405, -0.1314542220864931, -0.03897771960043389, -0.2366528997460947, 0.1956886814745224, 0.14037852136559947, 0.13821256702826562, 0.22723762079587448, -0.39237171654467995, -0.19366137457140925, 0.15876470339160575, 0.19657384063643607, 0.019031997172809813, -0.018093095672235864, -0.3042329117787354, 0.09040233475642036, -0.11169251821854193, -0.19556951861950042, -0.10960581858703138, 0.018200997647869845, 0.077759155735333, -0.34209449483972526, 0.1372938581701854, 0.09385451554502967, 0.07579653203973304, -0.15410562711970313, -0.15304623625200728, 0.05385522883000743, 0.12071743750256365, 0.01150430082950903, 0.04111231294582072, 0.06256683182943126, -0.0276836639918063, -0.12504002757613425, 0.27081295360973023, -0.09363628796342274, -0.2677632557309192, 0.12139082477306543, -0.18781320232412088, -0.16036353349361732, 0.07235903912426336, 0.17225677066523096, 0.11203600270876093, -0.06217903115422181, 0.07491870928662019, -0.05663793726378809, 0.10925680982029956, 0.20768052926691977, 0.10553947494000844, -0.007975574324676849, 0.08371009955020703, 0.1617130415878542, 0.1671886585055567, -0.092082823616574, 0.0026283270638921986, -0.27000214446983906, -0.18316136541492914, -0.23106092132587472, 0.05443510579694386, -0.2386774190530085, -0.14864047734147828, 0.3513669995995967, 0.09544333527067109, 0.17319742752158124, 0.1814014443155864, 0.24399915649353163, 0.16346402016358258, 0.009684175981775574, 0.08333954939861661, 0.15063593218054966, 0.17012206614827333, 0.05583576023902582, -0.14849011875365092, -0.0018719039330987828, 0.26734026601416583] |
1,802.10187 | Two-particle indistinguishability and identification of
boson-and-fermion species: a Fisher information approach | We present a study on two-particle indistinguishability and particle-species
identification by introducing a Fisher-information (FI) approach---in which two
particles pass through a two-wave mixing operation and the number of particles
is counted in one of the output modes. In our study, we first show that FI can
reproduce the Hong-Ou-Mandel (HOM) effect with two bosons or two fermions. In
particular, it is found that even though bosons and fermions exhibit different
physical behavior (i.e., "bunching" or "anti-bunching") due to their
indistinguishability, the aspects of HOM-like dip are quantitatively same. We
then provide a simple method for estimating the degree of two-particle
indistinguishability in a Mach-Zehnder interferometer-type setup. The presented
method also enables us to identify whether the particles are bosons or
fermions. Our study will provide useful primitives for various study of boson
and fermion characteristics.
| quant-ph | we present a study on twoparticle indistinguishability and particlespecies identification by introducing a fisherinformation fi approachin which two particles pass through a twowave mixing operation and the number of particles is counted in one of the output modes in our study we first show that fi can reproduce the hongoumandel hom effect with two bosons or two fermions in particular it is found that even though bosons and fermions exhibit different physical behavior ie bunching or antibunching due to their indistinguishability the aspects of homlike dip are quantitatively same we then provide a simple method for estimating the degree of twoparticle indistinguishability in a machzehnder interferometertype setup the presented method also enables us to identify whether the particles are bosons or fermions our study will provide useful primitives for various study of boson and fermion characteristics | [['we', 'present', 'a', 'study', 'on', 'twoparticle', 'indistinguishability', 'and', 'particlespecies', 'identification', 'by', 'introducing', 'a', 'fisherinformation', 'fi', 'approachin', 'which', 'two', 'particles', 'pass', 'through', 'a', 'twowave', 'mixing', 'operation', 'and', 'the', 'number', 'of', 'particles', 'is', 'counted', 'in', 'one', 'of', 'the', 'output', 'modes', 'in', 'our', 'study', 'we', 'first', 'show', 'that', 'fi', 'can', 'reproduce', 'the', 'hongoumandel', 'hom', 'effect', 'with', 'two', 'bosons', 'or', 'two', 'fermions', 'in', 'particular', 'it', 'is', 'found', 'that', 'even', 'though', 'bosons', 'and', 'fermions', 'exhibit', 'different', 'physical', 'behavior', 'ie', 'bunching', 'or', 'antibunching', 'due', 'to', 'their', 'indistinguishability', 'the', 'aspects', 'of', 'homlike', 'dip', 'are', 'quantitatively', 'same', 'we', 'then', 'provide', 'a', 'simple', 'method', 'for', 'estimating', 'the', 'degree', 'of', 'twoparticle', 'indistinguishability', 'in', 'a', 'machzehnder', 'interferometertype', 'setup', 'the', 'presented', 'method', 'also', 'enables', 'us', 'to', 'identify', 'whether', 'the', 'particles', 'are', 'bosons', 'or', 'fermions', 'our', 'study', 'will', 'provide', 'useful', 'primitives', 'for', 'various', 'study', 'of', 'boson', 'and', 'fermion', 'characteristics']] | [-0.13261624379083514, 0.21512711194774775, -0.1171876863131661, 0.09898108515867603, -0.02415963278304952, -0.1983096103719088, 0.024363391745988446, 0.37374325952867965, -0.2030257014418716, -0.2955954368803963, -0.0030985527303514643, -0.2830804279491083, -0.1379053216033251, 0.1718155236431717, -0.013249655357568956, 0.027383221866764517, 0.07218241368059013, 0.01166515351566764, -0.014264495350045167, -0.2490783312059105, 0.316974272943882, -0.003653991241147047, 0.25762694312342954, 0.06548966471203116, 0.09163103990757199, 0.04528137329799026, -0.0038123594530955402, -0.017579469399756072, -0.08684853155831823, 0.07108438487943095, 0.18917422852028898, 0.050062258434203914, 0.20279650131254387, -0.38453817423676323, -0.15647649533964986, 0.10655499785989106, 0.17143119989942981, 0.12328169557940104, -0.05240040703471611, -0.3028149441051394, 0.05329086409478601, -0.17598831023833691, -0.11257063097723607, -0.09765233795867483, -0.056817504455710745, -0.012876256063246905, -0.26177176071414304, 0.05128722270032384, 0.04989563067636536, 0.048161741297469654, 0.04885565219082133, -0.05166331011412749, -0.006961996973763262, 0.09776710690895735, 0.034337728301674794, -0.06687350072133452, 0.10760703814257659, -0.15834506037089027, -0.18630691906854288, 0.39578876405287144, -0.050196904876728114, -0.23153335618466805, 0.2249149144592403, -0.16530743133408754, -0.11771210095386452, 0.10163678859756675, 0.16218236442168812, 0.0686043583016509, -0.15610601651523984, 0.02901833207839961, -0.06951352495199709, 0.1769858375834579, 0.09231516706354137, 0.11559223822915732, 0.21125090928442442, 0.12943445154945296, 0.01597373929819954, 0.18268824538299397, -0.08947948449783882, -0.06005965469582284, -0.31978841543670244, -0.2055567139029892, -0.16948263188337545, 0.028612834887940492, -0.048715079702357, -0.12915474710874816, 0.4327367711603753, 0.18574038579184285, 0.22293446343322632, 0.02688887968586424, 0.2836608713120917, 0.1257138810165699, 0.032763437567793055, 0.0012882787859373127, 0.2678408140269692, 0.12565390015048766, 0.0547981855612415, -0.2376690604845618, 0.016820317064759446, 0.056501084481671786] |
1,802.10188 | Safety Control Synthesis with Input Limits: a Hybrid Approach | We introduce a hybrid (discrete--continuous) safety controller which enforces
strict state and input constraints on a system---but only acts when necessary,
preserving transparent operation of the original system within some safe region
of the state space. We define this space using a Min-Quadratic Barrier
function, which we construct along the equilibrium manifold using the Lyapunov
functions which result from linear matrix inequality controller synthesis for
locally valid uncertain linearizations. We also introduce the concept of a
barrier pair, which makes it easy to extend the approach to include
trajectory-based augmentations to the safe region, in the style of LQR-Trees.
We demonstrate our controller and barrier pair synthesis method in
simulation-based examples.
| math.OC cs.SY | we introduce a hybrid discretecontinuous safety controller which enforces strict state and input constraints on a systembut only acts when necessary preserving transparent operation of the original system within some safe region of the state space we define this space using a minquadratic barrier function which we construct along the equilibrium manifold using the lyapunov functions which result from linear matrix inequality controller synthesis for locally valid uncertain linearizations we also introduce the concept of a barrier pair which makes it easy to extend the approach to include trajectorybased augmentations to the safe region in the style of lqrtrees we demonstrate our controller and barrier pair synthesis method in simulationbased examples | [['we', 'introduce', 'a', 'hybrid', 'discretecontinuous', 'safety', 'controller', 'which', 'enforces', 'strict', 'state', 'and', 'input', 'constraints', 'on', 'a', 'systembut', 'only', 'acts', 'when', 'necessary', 'preserving', 'transparent', 'operation', 'of', 'the', 'original', 'system', 'within', 'some', 'safe', 'region', 'of', 'the', 'state', 'space', 'we', 'define', 'this', 'space', 'using', 'a', 'minquadratic', 'barrier', 'function', 'which', 'we', 'construct', 'along', 'the', 'equilibrium', 'manifold', 'using', 'the', 'lyapunov', 'functions', 'which', 'result', 'from', 'linear', 'matrix', 'inequality', 'controller', 'synthesis', 'for', 'locally', 'valid', 'uncertain', 'linearizations', 'we', 'also', 'introduce', 'the', 'concept', 'of', 'a', 'barrier', 'pair', 'which', 'makes', 'it', 'easy', 'to', 'extend', 'the', 'approach', 'to', 'include', 'trajectorybased', 'augmentations', 'to', 'the', 'safe', 'region', 'in', 'the', 'style', 'of', 'lqrtrees', 'we', 'demonstrate', 'our', 'controller', 'and', 'barrier', 'pair', 'synthesis', 'method', 'in', 'simulationbased', 'examples']] | [-0.10524295335980477, 0.024992406922306313, -0.11257472323874633, 0.07467170236702293, -0.10598578164785134, -0.16374786467187935, 0.10998410904667927, 0.39068393754186453, -0.31069744835366253, -0.2812572733878537, 0.09975267822759364, -0.19339361764421617, -0.1651174838965138, 0.18445390225301875, -0.10930401337585256, 0.09545659863700469, 0.053932112156568714, 0.01119690866390657, -0.06995995492562307, -0.17348056514661206, 0.3556930053530744, -0.008470990781292872, 0.25835783047066935, 0.03518459977392383, 0.1845582630851789, 0.047971168500629977, 0.0537736659127943, -0.00182141879135829, -0.11993201733006302, 0.1306752613767188, 0.24732231262519402, 0.16589079957662356, 0.2801389636696075, -0.4089009317534941, -0.16831082493687669, 0.09450714041034829, 0.08574187003627971, 0.12135957334087127, -0.0541651495786263, -0.28808858442223734, 0.10022369059906513, -0.20331379822110413, -0.11619074545214297, -0.10532060048340268, -0.044084886093279, -0.01010862268783428, -0.3218317972151218, -0.011566475833845928, 0.06906442570982983, 0.0012296101992466935, -0.08711704858837442, -0.06045758990135423, -0.04441042765931882, 0.10447125217830978, -0.040182714686832495, 0.016748751785295706, 0.1673002076783666, -0.053606679843613635, -0.07700183870986586, 0.32135323135837635, -0.03853752704000928, -0.260866355071172, 0.149575399381488, -0.08248153826463278, -0.12436058501825081, 0.08761201958447971, 0.16448940748900728, 0.16839539324347344, -0.15196476503627276, 0.10414660060066833, -0.022398285033112322, 0.1795224614519005, 0.016002856645543403, 0.031343162331419684, 0.14035991467190562, 0.18172729696110496, 0.18168463167320523, 0.20751721796545167, -0.036119494076249085, -0.15527372473971573, -0.35919431089941, -0.15531248746655937, -0.11663550618578922, -0.016042033762291626, -0.051653525606390624, -0.20085924211889505, 0.3953115399495733, 0.15940356983251316, 0.17603521320658425, 0.11367396460587366, 0.31955759847079646, 0.11962408017630137, 0.06904384678529352, 0.08783689679370986, 0.20861493985096416, 0.09445439309692355, 0.09290073226481953, -0.18852255404689694, 0.07116883985387783, 0.09943220581583402] |
1,802.10189 | Incremental Strong Connectivity and 2-Connectivity in Directed Graphs | In this paper, we present new incremental algorithms for maintaining data
structures that represent all connectivity cuts of size one in directed graphs
(digraphs), and the strongly connected components that result by the removal of
each of those cuts. We give a conditional lower bound that provides evidence
that our algorithms may be tight up to sub-polynomial factors. As an additional
result, with our approach we can also maintain dynamically the
$2$-vertex-connected components of a digraph during any sequence of edge
insertions in a total of $O(mn)$ time. This matches the bounds for the
incremental maintenance of the $2$-edge-connected components of a digraph.
| cs.DS | in this paper we present new incremental algorithms for maintaining data structures that represent all connectivity cuts of size one in directed graphs digraphs and the strongly connected components that result by the removal of each of those cuts we give a conditional lower bound that provides evidence that our algorithms may be tight up to subpolynomial factors as an additional result with our approach we can also maintain dynamically the 2vertexconnected components of a digraph during any sequence of edge insertions in a total of omn time this matches the bounds for the incremental maintenance of the 2edgeconnected components of a digraph | [['in', 'this', 'paper', 'we', 'present', 'new', 'incremental', 'algorithms', 'for', 'maintaining', 'data', 'structures', 'that', 'represent', 'all', 'connectivity', 'cuts', 'of', 'size', 'one', 'in', 'directed', 'graphs', 'digraphs', 'and', 'the', 'strongly', 'connected', 'components', 'that', 'result', 'by', 'the', 'removal', 'of', 'each', 'of', 'those', 'cuts', 'we', 'give', 'a', 'conditional', 'lower', 'bound', 'that', 'provides', 'evidence', 'that', 'our', 'algorithms', 'may', 'be', 'tight', 'up', 'to', 'subpolynomial', 'factors', 'as', 'an', 'additional', 'result', 'with', 'our', 'approach', 'we', 'can', 'also', 'maintain', 'dynamically', 'the', '2vertexconnected', 'components', 'of', 'a', 'digraph', 'during', 'any', 'sequence', 'of', 'edge', 'insertions', 'in', 'a', 'total', 'of', 'omn', 'time', 'this', 'matches', 'the', 'bounds', 'for', 'the', 'incremental', 'maintenance', 'of', 'the', '2edgeconnected', 'components', 'of', 'a', 'digraph']] | [-0.17254602983232262, 0.13075948328142015, -0.08616665789622416, 0.015744548885477255, -0.07876301268386898, -0.09572060663451992, 0.11432079946649379, 0.3955011784451679, -0.25609973541379555, -0.34763303505781207, 0.0906603268937669, -0.2379384345727638, -0.16688401720970328, 0.14400928030559088, -0.0897957563549461, 0.00392665440619028, 0.1367531793182987, 0.04307222705971884, 0.0030041111529198953, -0.2960910972352456, 0.2819661931383414, 0.024552616272664186, 0.19434615099820698, 0.08621578037883472, 0.05982416012500711, 0.013290719359715297, -0.021380033606247417, 0.0603790522182306, -0.12463685866695087, 0.14800698970426415, 0.258774843826456, 0.2096863929770019, 0.23973276667767068, -0.42559459827189305, -0.14304518086148552, 0.1496177213447331, 0.14156981115681527, 0.10764878765833609, 0.0026270492291710907, -0.20644781746883487, 0.13463417835334696, -0.13413504744739752, -0.09244287531660164, -0.04505676001274181, 0.0475942959412209, 0.01913516765948638, -0.2957448317732626, 0.012264154772036845, 0.14997952148878893, -0.017480519496229956, -0.04066500989087288, -0.13435301794534893, -0.01927376524047944, 0.15174022724725378, -0.023625725247327565, 0.06176501919415969, 0.06195392849791831, -0.13657931530016285, -0.21197697212829172, 0.3294579805308971, -0.05855864608316746, -0.15270370140093045, 0.15333643505910358, -0.06960471357372634, -0.22381419640540787, 0.1457881008329105, 0.19758313037093403, 0.1298252680402213, -0.13840885450430576, 0.04787947240373735, -0.09351360691186872, 0.14936560473757463, 0.07064082780943333, 0.037722570396670436, 0.11302220914060775, 0.15329896454762632, 0.1900941939503593, 0.18650695225743813, -0.013687011360832788, 0.014179266044345586, -0.30733435261018066, -0.13596385647599288, -0.1730377696357324, -0.02885386362237838, -0.194010801762382, -0.19914800553352038, 0.4302231311183242, 0.12768380975156335, 0.24968241372154754, 0.1452814887151477, 0.31170367064334237, 0.0945632532996225, 0.1035064286145481, 0.19102203845977783, 0.1760247985344127, 0.11539467960568958, 0.008786002648723068, -0.18434243094971747, 0.12734002483476323, 0.07640547178758] |
1,802.1019 | Exploiting the Natural Dynamics of Series Elastic Robots by
Actuator-Centered Sequential Linear Programming | Series elastic robots are best able to follow trajectories which obey the
limitations of their actuators, since they cannot instantly change their joint
forces. In fact, the performance of series elastic actuators can surpass that
of ideal force source actuators by storing and releasing energy. In this paper,
we formulate the trajectory optimization problem for series elastic robots in a
novel way based on sequential linear programming. Our framework is unique in
the separation of the actuator dynamics from the rest of the dynamics, and in
the use of a tunable pseudo-mass parameter that improves the discretization
accuracy of our approach. The actuator dynamics are truly linear, which allows
them to be excluded from trust-region mechanics. This causes our algorithm to
have similar run times with and without the actuator dynamics. We demonstrate
our optimization algorithm by tuning high performance behaviors for a
single-leg robot in simulation and on hardware for a single degree-of-freedom
actuator testbed. The results show that compliance allows for faster motions
and takes a similar amount of computation time.
| cs.RO math.OC | series elastic robots are best able to follow trajectories which obey the limitations of their actuators since they cannot instantly change their joint forces in fact the performance of series elastic actuators can surpass that of ideal force source actuators by storing and releasing energy in this paper we formulate the trajectory optimization problem for series elastic robots in a novel way based on sequential linear programming our framework is unique in the separation of the actuator dynamics from the rest of the dynamics and in the use of a tunable pseudomass parameter that improves the discretization accuracy of our approach the actuator dynamics are truly linear which allows them to be excluded from trustregion mechanics this causes our algorithm to have similar run times with and without the actuator dynamics we demonstrate our optimization algorithm by tuning high performance behaviors for a singleleg robot in simulation and on hardware for a single degreeoffreedom actuator testbed the results show that compliance allows for faster motions and takes a similar amount of computation time | [['series', 'elastic', 'robots', 'are', 'best', 'able', 'to', 'follow', 'trajectories', 'which', 'obey', 'the', 'limitations', 'of', 'their', 'actuators', 'since', 'they', 'can', 'not', 'instantly', 'change', 'their', 'joint', 'forces', 'in', 'fact', 'the', 'performance', 'of', 'series', 'elastic', 'actuators', 'can', 'surpass', 'that', 'of', 'ideal', 'force', 'source', 'actuators', 'by', 'storing', 'and', 'releasing', 'energy', 'in', 'this', 'paper', 'we', 'formulate', 'the', 'trajectory', 'optimization', 'problem', 'for', 'series', 'elastic', 'robots', 'in', 'a', 'novel', 'way', 'based', 'on', 'sequential', 'linear', 'programming', 'our', 'framework', 'is', 'unique', 'in', 'the', 'separation', 'of', 'the', 'actuator', 'dynamics', 'from', 'the', 'rest', 'of', 'the', 'dynamics', 'and', 'in', 'the', 'use', 'of', 'a', 'tunable', 'pseudomass', 'parameter', 'that', 'improves', 'the', 'discretization', 'accuracy', 'of', 'our', 'approach', 'the', 'actuator', 'dynamics', 'are', 'truly', 'linear', 'which', 'allows', 'them', 'to', 'be', 'excluded', 'from', 'trustregion', 'mechanics', 'this', 'causes', 'our', 'algorithm', 'to', 'have', 'similar', 'run', 'times', 'with', 'and', 'without', 'the', 'actuator', 'dynamics', 'we', 'demonstrate', 'our', 'optimization', 'algorithm', 'by', 'tuning', 'high', 'performance', 'behaviors', 'for', 'a', 'singleleg', 'robot', 'in', 'simulation', 'and', 'on', 'hardware', 'for', 'a', 'single', 'degreeoffreedom', 'actuator', 'testbed', 'the', 'results', 'show', 'that', 'compliance', 'allows', 'for', 'faster', 'motions', 'and', 'takes', 'a', 'similar', 'amount', 'of', 'computation', 'time']] | [-0.1286208114258385, 0.05494839540881918, -0.12012209332644982, -0.0313948913836701, -0.10038589724377228, -0.15266121230276591, 0.05638620909236135, 0.4035641520547901, -0.29832368139500565, -0.35408340378346814, 0.07677087551379856, -0.23224674027451486, -0.15733007017813752, 0.22241185894612805, -0.0902951094212557, 0.12360191500592288, 0.09847056567655456, 0.0034662372771801287, -0.023878542929107183, -0.22140031231491897, 0.23255988917545, 0.05914071070654802, 0.26847699680769377, 0.0028484077673981427, 0.15451026815689584, 0.02791484520296873, 0.04830276161012364, 0.022874984816874167, -0.08412815782579161, 0.12570778488597398, 0.24183698694862296, 0.10640281719839298, 0.2772952623509215, -0.4760554320571912, -0.1965675111510118, 0.061851736992554515, 0.12726634212451948, 0.10574302985871244, -0.021391279585632587, -0.27899681249191993, 0.07833738117398037, -0.1506155672903049, -0.0900069533314319, -0.11500961143480387, -0.009396345958899642, 0.05372427819253651, -0.2623866414462857, 0.05911323211473451, 0.03806079634212259, 0.01877594935691598, -0.08892366605759679, -0.05596889755782817, 0.03359935402391059, 0.1508674656250918, 0.021885144373541967, -0.009491003461645086, 0.1869177707670138, -0.11419912399535707, -0.13565508768802262, 0.4033235997672198, -0.017433947937380026, -0.23375441006793926, 0.19235108027401557, -0.08032683251059555, -0.1089048618423844, 0.14845477391069356, 0.2384108442737791, 0.11292894974329395, -0.16717885305426713, 0.05259032538961458, 0.010151631350230662, 0.1845763176894946, 0.03786345442078706, -0.023721430544886804, 0.169506093244892, 0.20691730961677313, 0.09906439896204611, 0.14650589080374, -0.05639464913741578, -0.1049895639628215, -0.2942452741318485, -0.14321463690354688, -0.17625680604055954, -0.004358772962200025, -0.08796600753472071, -0.11512925093616709, 0.3762104376676799, 0.18314251360736486, 0.18179612005307108, 0.10844053624257058, 0.34184465207956255, 0.06484828527338501, 0.08417071073149153, 0.10394311912433174, 0.2884633514244174, 0.033893803178973364, 0.12235663558835584, -0.24727518720326225, 0.08663787976892481, 0.01948249567235481] |
1,802.10191 | NMR Spin-Rotation Relaxation and Diffusion of Methane | The translational-diffusion coefficient $D_T$ and the spin-rotation
contribution to the $^1$H NMR relaxation time $T_{1J}$ for methane (CH$_4$) are
investigated using MD (molecular dynamics) simulations, over a wide range of
densities $\rho$ and temperatures $T$, spanning the liquid, supercritical, and
gas phases. The simulated $D_T$ agree well with measurements, without any
adjustable parameters in the interpretation of the simulations. A minimization
technique is developed to compute the angular-velocity for non-rigid spherical
molecules, which is used to simulate the autocorrelation function $G_{\!J}(t)$
for spin-rotation interactions. With increasing $D_T$ (i.e. decreasing $\rho$),
$G_{\!J}(t)$ shows increasing deviations from the single-exponential decay
predicted by the Langevin theory for hard spheres, and the deviations are
quantified using inverse Laplace transforms of $G_{\!J}(t)$. $T_{1J}$ is
derived from $G_{\!J}(t)$ using the kinetic model "km" for gases
($T_{1J}^{km}$), and the diffusion model "dm" for liquids ($T_{1J}^{dm}$).
$T_{1J}^{km}$ shows better agreement with $T_1$ measurements at higher $D_T$,
while $T_{1J}^{dm}$ shows better agreement with $T_1$ measurements at lower
$D_T$. $T_{1J}^{km}$ is shown to dominate over the MD simulated $^1$H-$^1$H
dipole-dipole relaxation $T_{1RT}$ at high $D_T$, while the opposite is found
at low $D_T$. At high $D_T$, the simulated spin-rotation correlation-time
$\tau_J$ agrees with the kinetic collision time $\tau_K$ for gases, from which
a new relation $1/T_{1J}^{km} \propto D_T$ is inferred, without any adjustable
parameters.
| physics.chem-ph | the translationaldiffusion coefficient d_t and the spinrotation contribution to the 1h nmr relaxation time t_1j for methane ch_4 are investigated using md molecular dynamics simulations over a wide range of densities rho and temperatures t spanning the liquid supercritical and gas phases the simulated d_t agree well with measurements without any adjustable parameters in the interpretation of the simulations a minimization technique is developed to compute the angularvelocity for nonrigid spherical molecules which is used to simulate the autocorrelation function g_jt for spinrotation interactions with increasing d_t ie decreasing rho g_jt shows increasing deviations from the singleexponential decay predicted by the langevin theory for hard spheres and the deviations are quantified using inverse laplace transforms of g_jt t_1j is derived from g_jt using the kinetic model km for gases t_1jkm and the diffusion model dm for liquids t_1jdm t_1jkm shows better agreement with t_1 measurements at higher d_t while t_1jdm shows better agreement with t_1 measurements at lower d_t t_1jkm is shown to dominate over the md simulated 1h1h dipoledipole relaxation t_1rt at high d_t while the opposite is found at low d_t at high d_t the simulated spinrotation correlationtime tau_j agrees with the kinetic collision time tau_k for gases from which a new relation 1t_1jkm propto d_t is inferred without any adjustable parameters | [['the', 'translationaldiffusion', 'coefficient', 'd_t', 'and', 'the', 'spinrotation', 'contribution', 'to', 'the', '1h', 'nmr', 'relaxation', 'time', 't_1j', 'for', 'methane', 'ch_4', 'are', 'investigated', 'using', 'md', 'molecular', 'dynamics', 'simulations', 'over', 'a', 'wide', 'range', 'of', 'densities', 'rho', 'and', 'temperatures', 't', 'spanning', 'the', 'liquid', 'supercritical', 'and', 'gas', 'phases', 'the', 'simulated', 'd_t', 'agree', 'well', 'with', 'measurements', 'without', 'any', 'adjustable', 'parameters', 'in', 'the', 'interpretation', 'of', 'the', 'simulations', 'a', 'minimization', 'technique', 'is', 'developed', 'to', 'compute', 'the', 'angularvelocity', 'for', 'nonrigid', 'spherical', 'molecules', 'which', 'is', 'used', 'to', 'simulate', 'the', 'autocorrelation', 'function', 'g_jt', 'for', 'spinrotation', 'interactions', 'with', 'increasing', 'd_t', 'ie', 'decreasing', 'rho', 'g_jt', 'shows', 'increasing', 'deviations', 'from', 'the', 'singleexponential', 'decay', 'predicted', 'by', 'the', 'langevin', 'theory', 'for', 'hard', 'spheres', 'and', 'the', 'deviations', 'are', 'quantified', 'using', 'inverse', 'laplace', 'transforms', 'of', 'g_jt', 't_1j', 'is', 'derived', 'from', 'g_jt', 'using', 'the', 'kinetic', 'model', 'km', 'for', 'gases', 't_1jkm', 'and', 'the', 'diffusion', 'model', 'dm', 'for', 'liquids', 't_1jdm', 't_1jkm', 'shows', 'better', 'agreement', 'with', 't_1', 'measurements', 'at', 'higher', 'd_t', 'while', 't_1jdm', 'shows', 'better', 'agreement', 'with', 't_1', 'measurements', 'at', 'lower', 'd_t', 't_1jkm', 'is', 'shown', 'to', 'dominate', 'over', 'the', 'md', 'simulated', '1h1h', 'dipoledipole', 'relaxation', 't_1rt', 'at', 'high', 'd_t', 'while', 'the', 'opposite', 'is', 'found', 'at', 'low', 'd_t', 'at', 'high', 'd_t', 'the', 'simulated', 'spinrotation', 'correlationtime', 'tau_j', 'agrees', 'with', 'the', 'kinetic', 'collision', 'time', 'tau_k', 'for', 'gases', 'from', 'which', 'a', 'new', 'relation', '1t_1jkm', 'propto', 'd_t', 'is', 'inferred', 'without', 'any', 'adjustable', 'parameters']] | [-0.0989957941462652, 0.20092477775585738, -0.05485621476189902, 0.05005949657428467, 0.016468876311600714, -0.16451082553361876, 0.00047553505113312195, 0.36942734812540046, -0.2661648345205569, -0.30690997569071293, 0.03631555897158851, -0.32106850982544205, -0.03878366324521637, 0.21012170701649366, 0.07406084607745231, 0.056942218684057876, 0.00916825880373385, 0.003656542195104406, -0.1242363399608983, -0.14582148364528072, 0.19515874000600747, 0.05599899472921942, 0.22691186422084286, 0.07643967104207688, 0.11814525699270076, -0.021245299863401724, 0.011800528984308894, 0.009161100695723469, -0.21110783082216036, 0.021838853741516766, 0.21665933270581536, -0.019252136141712804, 0.13413820118254538, -0.3945189542815234, -0.240041349408696, 0.08742033565272543, 0.13045459380825458, 0.06457035313925516, -0.00011051913556073186, -0.23738105449536182, 0.05643802153588571, -0.13221753458266408, -0.10677377076805976, -0.06895088230020105, 0.05571127008506576, 0.02930399193244792, -0.31804323843589904, 0.17683203694369934, -0.009117476848684233, 0.0900220683407382, -0.08806890843535584, -0.16849059660498558, -0.033002370980893744, 0.08063746973741076, 0.04371361861523078, 0.07817267338932916, 0.17348248192823482, -0.07639064290334732, -0.053877002792432904, 0.39146541699188425, -0.12546955560248127, -0.1441725016982991, 0.2218970084908753, -0.19582661719280983, -0.09234844269886504, 0.2019249420992813, 0.08028260680781316, 0.09286645142976375, -0.10762124121623132, 0.08459756713916064, -0.00656496802145995, 0.17786656692850142, 0.050842815804412786, -0.019029510721241608, 0.14548739365604932, 0.15546710601356784, 0.03812254683195966, 0.08162909859420678, -0.08719386128161681, -0.10691858123698571, -0.24466235836226385, -0.10312927863560617, -0.22693028733997778, 0.04195518364442639, -0.1201062535556136, -0.05455543184231908, 0.2824398344235712, 0.08604383562268798, 0.21033588912817242, 0.1449003039838891, 0.29092290114105035, 0.13463233895198604, 0.05250967748393079, 0.08245124408830572, 0.20903083369208192, 0.15747783936388357, 0.11321226202315443, -0.3203823480323337, 0.08636460116006506, 0.015648975543388465] |
1,802.10192 | Fractional Programming for Communication Systems--Part I: Power Control
and Beamforming | This two-part paper explores the use of FP in the design and optimization of
communication systems. Part I of this paper focuses on FP theory and on solving
continuous problems. The main theoretical contribution is a novel quadratic
transform technique for tackling the multiple-ratio concave-convex FP
problem--in contrast to conventional FP techniques that mostly can only deal
with the single-ratio or the max-min-ratio case. Multiple-ratio FP problems are
important for the optimization of communication networks, because system-level
design often involves multiple signal-to-interference-plus-noise ratio terms.
This paper considers the applications of FP to solving continuous problems in
communication system design, particularly for power control, beamforming, and
energy efficiency maximization. These application cases illustrate that the
proposed quadratic transform can greatly facilitate the optimization involving
ratios by recasting the original nonconvex problem as a sequence of convex
problems. This FP-based problem reformulation gives rise to an efficient
iterative optimization algorithm with provable convergence to a stationary
point. The paper further demonstrates close connections between the proposed FP
approach and other well-known algorithms in the literature, such as the
fixed-point iteration and the weighted minimum mean-square-error beamforming.
The optimization of discrete problems is discussed in Part II of this paper.
| cs.IT math.IT | this twopart paper explores the use of fp in the design and optimization of communication systems part i of this paper focuses on fp theory and on solving continuous problems the main theoretical contribution is a novel quadratic transform technique for tackling the multipleratio concaveconvex fp problemin contrast to conventional fp techniques that mostly can only deal with the singleratio or the maxminratio case multipleratio fp problems are important for the optimization of communication networks because systemlevel design often involves multiple signaltointerferenceplusnoise ratio terms this paper considers the applications of fp to solving continuous problems in communication system design particularly for power control beamforming and energy efficiency maximization these application cases illustrate that the proposed quadratic transform can greatly facilitate the optimization involving ratios by recasting the original nonconvex problem as a sequence of convex problems this fpbased problem reformulation gives rise to an efficient iterative optimization algorithm with provable convergence to a stationary point the paper further demonstrates close connections between the proposed fp approach and other wellknown algorithms in the literature such as the fixedpoint iteration and the weighted minimum meansquareerror beamforming the optimization of discrete problems is discussed in part ii of this paper | [['this', 'twopart', 'paper', 'explores', 'the', 'use', 'of', 'fp', 'in', 'the', 'design', 'and', 'optimization', 'of', 'communication', 'systems', 'part', 'i', 'of', 'this', 'paper', 'focuses', 'on', 'fp', 'theory', 'and', 'on', 'solving', 'continuous', 'problems', 'the', 'main', 'theoretical', 'contribution', 'is', 'a', 'novel', 'quadratic', 'transform', 'technique', 'for', 'tackling', 'the', 'multipleratio', 'concaveconvex', 'fp', 'problemin', 'contrast', 'to', 'conventional', 'fp', 'techniques', 'that', 'mostly', 'can', 'only', 'deal', 'with', 'the', 'singleratio', 'or', 'the', 'maxminratio', 'case', 'multipleratio', 'fp', 'problems', 'are', 'important', 'for', 'the', 'optimization', 'of', 'communication', 'networks', 'because', 'systemlevel', 'design', 'often', 'involves', 'multiple', 'signaltointerferenceplusnoise', 'ratio', 'terms', 'this', 'paper', 'considers', 'the', 'applications', 'of', 'fp', 'to', 'solving', 'continuous', 'problems', 'in', 'communication', 'system', 'design', 'particularly', 'for', 'power', 'control', 'beamforming', 'and', 'energy', 'efficiency', 'maximization', 'these', 'application', 'cases', 'illustrate', 'that', 'the', 'proposed', 'quadratic', 'transform', 'can', 'greatly', 'facilitate', 'the', 'optimization', 'involving', 'ratios', 'by', 'recasting', 'the', 'original', 'nonconvex', 'problem', 'as', 'a', 'sequence', 'of', 'convex', 'problems', 'this', 'fpbased', 'problem', 'reformulation', 'gives', 'rise', 'to', 'an', 'efficient', 'iterative', 'optimization', 'algorithm', 'with', 'provable', 'convergence', 'to', 'a', 'stationary', 'point', 'the', 'paper', 'further', 'demonstrates', 'close', 'connections', 'between', 'the', 'proposed', 'fp', 'approach', 'and', 'other', 'wellknown', 'algorithms', 'in', 'the', 'literature', 'such', 'as', 'the', 'fixedpoint', 'iteration', 'and', 'the', 'weighted', 'minimum', 'meansquareerror', 'beamforming', 'the', 'optimization', 'of', 'discrete', 'problems', 'is', 'discussed', 'in', 'part', 'ii', 'of', 'this', 'paper']] | [-0.1417340453825119, -0.05226186295382261, -0.05516940947390436, 0.05396133518012945, -0.10462189641892138, -0.1616269358231112, 0.04845828731445393, 0.3470899890879063, -0.33263056920937845, -0.2985263263922513, 0.1223344727096008, -0.21862760012477173, -0.2473704983212459, 0.20481644116626774, -0.14291101869031633, 0.11739493631021906, 0.06683942393539714, -0.033348296531307185, -0.08901933476466377, -0.2613361018379291, 0.2935924938206749, 0.05240224504727542, 0.3003595134079302, 0.021129011461193677, 0.09768872077388621, 0.04546663544859757, -0.02392922270587052, 0.019582791340246257, -0.0802694358118753, 0.15929761708115706, 0.32309569870821475, 0.18616118427809966, 0.37817445104951375, -0.3889732867710949, -0.19444427726105087, 0.13304589132638406, 0.19639834405255982, 0.051826759818169275, -0.06711823493604177, -0.198665383608452, 0.08486996365860684, -0.10781282531109596, -0.05676602373723606, -0.02413116032716099, -0.07244310811055833, 0.03391291602114167, -0.3126126965821523, 0.03713014340896758, 0.05895029575204467, 0.013854930230411532, -0.07283509360961712, -0.15566500855689394, 0.0885993647075456, 0.0539095339321874, 0.05775179007510447, 0.030234822712674584, 0.09171586523527386, -0.10533139843208995, -0.15669051913298435, 0.4095488244143177, 0.033330609170247084, -0.2317352791611163, 0.1707350134588971, -0.008032991992245752, -0.1481843122710604, 0.12920647433963772, 0.23935441224346626, 0.14513014490508663, -0.15625788577846758, 0.11920337331055426, -0.010437220026174358, 0.14111372692962273, 0.03681693389080465, 0.01923136032123717, 0.12431689153589463, 0.18050013782626617, 0.1652639755548504, 0.1766760801951343, -0.03808060597683848, -0.14896618133293793, -0.26523612395690155, -0.14322956862565073, -0.18898594958184123, -0.01996900171760489, -0.0758658822578676, -0.13965034185199385, 0.3952984046142722, 0.1458659329369587, 0.13429188132382583, 0.12446884315526065, 0.3699522401384739, 0.18748160589991833, -0.000949315494228, 0.05490248198886378, 0.2280258290147544, 0.12616553522014287, 0.1387492088465879, -0.26531032482982453, 0.03348191091887306, 0.0853571366371558] |
1,802.10193 | Henselian discrete valued stable fields | Let $(K, v)$ be a Henselian discrete valued field with residue field
$\widehat K$ of characteristic $q \ge 0$, and Brd$_{p}(K)$ be the Brauer
$p$-dimension of $K$, for each prime $p$. The present paper shows that if $p =
q$, then Brd$_{p}(K) \le 1$ if and only if $\widehat K$ is a $p$-quasilocal
field and the degree $[\widehat K\colon \widehat K ^{p}]$ is $\le p$. This
complements our earlier result that, in case $p \neq q$, we have Brd$_{p}(K)
\le 1$ if and only if $\widehat K$ is $p$-quasilocal and Brd$_{p}(\widehat K)
\le 1$.
| math.RA math.NT | let k v be a henselian discrete valued field with residue field widehat k of characteristic q ge 0 and brd_pk be the brauer pdimension of k for each prime p the present paper shows that if p q then brd_pk le 1 if and only if widehat k is a pquasilocal field and the degree widehat kcolon widehat k p is le p this complements our earlier result that in case p neq q we have brd_pk le 1 if and only if widehat k is pquasilocal and brd_pwidehat k le 1 | [['let', 'k', 'v', 'be', 'a', 'henselian', 'discrete', 'valued', 'field', 'with', 'residue', 'field', 'widehat', 'k', 'of', 'characteristic', 'q', 'ge', '0', 'and', 'brd_pk', 'be', 'the', 'brauer', 'pdimension', 'of', 'k', 'for', 'each', 'prime', 'p', 'the', 'present', 'paper', 'shows', 'that', 'if', 'p', 'q', 'then', 'brd_pk', 'le', '1', 'if', 'and', 'only', 'if', 'widehat', 'k', 'is', 'a', 'pquasilocal', 'field', 'and', 'the', 'degree', 'widehat', 'kcolon', 'widehat', 'k', 'p', 'is', 'le', 'p', 'this', 'complements', 'our', 'earlier', 'result', 'that', 'in', 'case', 'p', 'neq', 'q', 'we', 'have', 'brd_pk', 'le', '1', 'if', 'and', 'only', 'if', 'widehat', 'k', 'is', 'pquasilocal', 'and', 'brd_pwidehat', 'k', 'le', '1']] | [-0.2162771922050287, 0.20182458644368403, -0.1231514795622586, -0.0630829865948054, -0.03958094779290664, -0.2522922925063935, -0.0011074013878976036, 0.31620772688588855, -0.34153968919797434, -0.20883251715428702, -0.02573136788028616, -0.28874690460203134, -0.07722442105675684, 0.1101272179360461, -0.017721025090988562, -0.11525004890838476, -0.04250806165130242, 0.19887001178753766, -0.008189473113895434, -0.33073471055325604, 0.28436938841300813, -0.11258776015197129, 0.08738075873470338, 0.038998069980627166, 0.024111866632112018, 0.08102411198247549, 0.12068988898080653, -0.00019144169409232944, -0.2637881911924405, -0.03370989430898234, 0.3339556313889182, 0.1543587853970087, 0.2692734313237926, -0.22304152709472438, -0.12436987527737232, 0.2794822673768858, 0.1820571124351219, -0.12880775856825968, 0.03624386770610252, -0.19341981672155467, 0.34193380940300616, -0.06949639164873667, -0.0996980162985299, -0.04150279444318427, 0.2195739910378546, -0.013392979689144893, -0.4055684172224415, 0.014036348004162352, 0.16899236271400814, 0.17621412829485844, 0.0027260275522206466, -0.29698570607655234, -0.04729087669756669, -0.001967728229077614, -0.04688867517372431, 0.20502543371960358, 0.04258691916702841, -0.06978574797824916, -0.03680629907403667, 0.3012085194375528, -0.08836348549179408, -0.10140408354851863, 0.0415567349763992, -0.26894823851509264, -0.14638947700555233, 0.17310296333870728, 0.03085393855429214, 0.25161656002392585, 0.08134918783426932, 0.33793200389165734, -0.12425119780085009, 0.16876074989609743, 0.10742995921400902, -0.07707883467209405, 0.07601749662147916, -0.022002871538026502, 0.0612406495999059, 0.018622283922488114, -0.04140081350392986, 0.15937436536541613, -0.4006031108615191, -0.20641216729848605, -0.19412930448711646, 0.20499167300801238, -0.09006308489804961, -0.02848209743387997, 0.2519652642633604, 0.10063655458836128, 0.19467773076220232, 0.09989159827566017, 0.16651833538249458, 0.06742716337802172, -0.02033628070342314, 0.14268020340545184, 0.03338900086996348, 0.23982719072829123, -0.024961495822619483, -0.15788602173004462, -0.023999593610389402, 0.07831978806011054] |
1,802.10194 | A Search for Tensor, Vector, and Scalar Polarizations in the Stochastic
Gravitational-Wave Background | The detection of gravitational waves with Advanced LIGO and Advanced Virgo
has enabled novel tests of general relativity, including direct study of the
polarization of gravitational waves. While general relativity allows for only
two tensor gravitational-wave polarizations, general metric theories can
additionally predict two vector and two scalar polarizations. The polarization
of gravitational waves is encoded in the spectral shape of the stochastic
gravitational-wave background, formed by the superposition of cosmological and
individually-unresolved astrophysical sources. Using data recorded by Advanced
LIGO during its first observing run, we search for a stochastic background of
generically-polarized gravitational waves. We find no evidence for a background
of any polarization, and place the first direct bounds on the contributions of
vector and scalar polarizations to the stochastic background. Under log-uniform
priors for the energy in each polarization, we limit the energy-densities of
tensor, vector, and scalar modes at 95% credibility to $\Omega^T_0 < 5.6 \times
10^{-8}$, $\Omega^V_0 < 6.4\times 10^{-8}$, and $\Omega^S_0 < 1.1\times
10^{-7}$ at a reference frequency $f_0 = 25$ Hz.
| gr-qc astro-ph.CO | the detection of gravitational waves with advanced ligo and advanced virgo has enabled novel tests of general relativity including direct study of the polarization of gravitational waves while general relativity allows for only two tensor gravitationalwave polarizations general metric theories can additionally predict two vector and two scalar polarizations the polarization of gravitational waves is encoded in the spectral shape of the stochastic gravitationalwave background formed by the superposition of cosmological and individuallyunresolved astrophysical sources using data recorded by advanced ligo during its first observing run we search for a stochastic background of genericallypolarized gravitational waves we find no evidence for a background of any polarization and place the first direct bounds on the contributions of vector and scalar polarizations to the stochastic background under loguniform priors for the energy in each polarization we limit the energydensities of tensor vector and scalar modes at 95 credibility to omegat_0 56 times 108 omegav_0 64times 108 and omegas_0 11times 107 at a reference frequency f_0 25 hz | [['the', 'detection', 'of', 'gravitational', 'waves', 'with', 'advanced', 'ligo', 'and', 'advanced', 'virgo', 'has', 'enabled', 'novel', 'tests', 'of', 'general', 'relativity', 'including', 'direct', 'study', 'of', 'the', 'polarization', 'of', 'gravitational', 'waves', 'while', 'general', 'relativity', 'allows', 'for', 'only', 'two', 'tensor', 'gravitationalwave', 'polarizations', 'general', 'metric', 'theories', 'can', 'additionally', 'predict', 'two', 'vector', 'and', 'two', 'scalar', 'polarizations', 'the', 'polarization', 'of', 'gravitational', 'waves', 'is', 'encoded', 'in', 'the', 'spectral', 'shape', 'of', 'the', 'stochastic', 'gravitationalwave', 'background', 'formed', 'by', 'the', 'superposition', 'of', 'cosmological', 'and', 'individuallyunresolved', 'astrophysical', 'sources', 'using', 'data', 'recorded', 'by', 'advanced', 'ligo', 'during', 'its', 'first', 'observing', 'run', 'we', 'search', 'for', 'a', 'stochastic', 'background', 'of', 'genericallypolarized', 'gravitational', 'waves', 'we', 'find', 'no', 'evidence', 'for', 'a', 'background', 'of', 'any', 'polarization', 'and', 'place', 'the', 'first', 'direct', 'bounds', 'on', 'the', 'contributions', 'of', 'vector', 'and', 'scalar', 'polarizations', 'to', 'the', 'stochastic', 'background', 'under', 'loguniform', 'priors', 'for', 'the', 'energy', 'in', 'each', 'polarization', 'we', 'limit', 'the', 'energydensities', 'of', 'tensor', 'vector', 'and', 'scalar', 'modes', 'at', '95', 'credibility', 'to', 'omegat_0', '56', 'times', '108', 'omegav_0', '64times', '108', 'and', 'omegas_0', '11times', '107', 'at', 'a', 'reference', 'frequency', 'f_0', '25', 'hz']] | [-0.16372125615744154, 0.16013741202332313, -0.021306784011540004, 0.08360406446518028, -0.09924256699159742, -0.05872157381963916, -0.006524722004542127, 0.3152733639639337, -0.16068036406941247, -0.31425319735426455, 0.06495070143864723, -0.28238177594766967, -0.09505442477529868, 0.222487116199045, 0.08761995042441413, 0.05513500506385753, 0.048345938191050666, 0.016658648260636254, -0.07334778027725405, -0.18190716555764083, 0.2979184929252369, 0.09899849447683665, 0.23995391047938028, -0.022694743743704747, 0.15492690041937748, 0.02070975466485834, -0.09251968921162187, -0.035193653663736765, -0.0990863506012829, 0.052155112905893475, 0.24499846116377738, 0.2012056970212143, 0.21219312743633054, -0.44678233852027915, -0.21115303488913922, 0.10812598172924481, 0.05408504570459627, 0.15590380710345925, -0.03399911526721553, -0.35730173214105887, 0.07360561277600937, -0.16992735436651857, -0.09121469528472517, -0.006161483802134171, 0.05761803799541667, -0.014096381389026646, -0.278980510609108, 0.1021496465036762, 0.009555225834992598, -0.028969471156597138, -0.09575882516910497, -0.10393757420533803, -0.031112942000618204, 0.01584911886311602, 0.0788491516650538, 0.07514263443736127, 0.147089374504867, -0.11816892680362798, -0.15440296796805342, 0.36916505301196595, -0.18275769341162232, -0.1759484287322266, 0.15190720353566575, -0.21278004278719892, -0.13885590227873762, 0.14156134428922088, 0.23072344477986917, 0.11960675496975455, -0.13893764792810542, 0.07632018406620773, 0.1029024678049609, 0.1896623992564855, 0.16805450313258916, 0.06604553175166075, 0.3146538262393733, 0.10445380811142968, 0.03337153413594933, 0.08047827473492361, -0.16443327177112224, -0.004797122257878072, -0.3367769881617278, -0.10336583840544336, -0.1288970839435933, 0.0711131060103071, -0.15667165649110756, -0.09941554340948641, 0.4151429200952407, 0.11842051199346315, 0.10650569890203769, 0.0561666194756981, 0.2966014485748019, 0.09517435431916965, 0.002006117213750258, 0.05390812001878657, 0.3881535173626617, 0.16889766991953364, 0.09616321419307497, -0.15047195625957102, -0.014649205558816903, -0.02773074819124304] |
1,802.10195 | Terahertz whispering gallery mode bubble resonator | Whispering gallery mode (WGM) resonators are compelling optical devices,
however they are nearly unexplored in the terahertz (THz) domain. In this
letter, we report on THz WGMs in quartz glass bubble resonators with
sub-wavelength wall thickness. An unprecedented study of both the amplitude and
phase of THz WGMs is presented. The coherent THz frequency domain measurements
are in excellent agreement with a simple analytical model and results from
numerical simulations. A high finesse of 9 and a quality (Q) factor exceeding
440 at 0.47 THz are observed. Due to the large evanescent field the high
Q-factor THz WGM bubble resonators can be used as a compact, highly sensitive
sensor in the intriguing THz frequency range.
| physics.optics physics.app-ph | whispering gallery mode wgm resonators are compelling optical devices however they are nearly unexplored in the terahertz thz domain in this letter we report on thz wgms in quartz glass bubble resonators with subwavelength wall thickness an unprecedented study of both the amplitude and phase of thz wgms is presented the coherent thz frequency domain measurements are in excellent agreement with a simple analytical model and results from numerical simulations a high finesse of 9 and a quality q factor exceeding 440 at 047 thz are observed due to the large evanescent field the high qfactor thz wgm bubble resonators can be used as a compact highly sensitive sensor in the intriguing thz frequency range | [['whispering', 'gallery', 'mode', 'wgm', 'resonators', 'are', 'compelling', 'optical', 'devices', 'however', 'they', 'are', 'nearly', 'unexplored', 'in', 'the', 'terahertz', 'thz', 'domain', 'in', 'this', 'letter', 'we', 'report', 'on', 'thz', 'wgms', 'in', 'quartz', 'glass', 'bubble', 'resonators', 'with', 'subwavelength', 'wall', 'thickness', 'an', 'unprecedented', 'study', 'of', 'both', 'the', 'amplitude', 'and', 'phase', 'of', 'thz', 'wgms', 'is', 'presented', 'the', 'coherent', 'thz', 'frequency', 'domain', 'measurements', 'are', 'in', 'excellent', 'agreement', 'with', 'a', 'simple', 'analytical', 'model', 'and', 'results', 'from', 'numerical', 'simulations', 'a', 'high', 'finesse', 'of', '9', 'and', 'a', 'quality', 'q', 'factor', 'exceeding', '440', 'at', '047', 'thz', 'are', 'observed', 'due', 'to', 'the', 'large', 'evanescent', 'field', 'the', 'high', 'qfactor', 'thz', 'wgm', 'bubble', 'resonators', 'can', 'be', 'used', 'as', 'a', 'compact', 'highly', 'sensitive', 'sensor', 'in', 'the', 'intriguing', 'thz', 'frequency', 'range']] | [-0.17842448842914208, 0.2054891811209255, -0.0035629372598360415, -0.1151287177172692, -0.09113659384134024, -0.13716535133755078, 0.041526920799894826, 0.543392388133899, -0.1667089913526307, -0.2995291013594555, 0.0622929209144786, -0.27026937493001635, -0.09635029882597534, 0.3026383641763064, -0.03168813990752982, 0.09243077390381824, 0.04111239132876306, -0.08546780777447249, 0.05323520253675625, -0.0768222042399904, 0.16045342194240378, 0.0646754708060104, 0.38149131356698013, 0.07963001191478132, 0.09038538725884712, -0.1070377839967082, 0.05468368978118119, -0.05586998000255097, -0.17447502846303192, 0.09928977934684119, 0.33804427860709635, -0.07613598062535343, 0.2607938619735448, -0.40153041761368513, -0.18596701257578704, -0.0036377429152312487, 0.18553257037546364, 0.1334632995639644, -0.06947296896200303, -0.2688549658202607, 0.0853836629236036, -0.12272635789021202, -0.09816126815111721, -0.049087279038908686, -0.01677045309005062, 0.004707383596257347, -0.24191746929275762, 0.06211962417861366, -0.02318613652301871, 0.10682537639108688, -0.07486058133211412, -0.06837225872213426, 0.0510243259653773, 0.005034487825089498, -0.03990700627454435, 0.048089627113760164, 0.18173073043074944, -0.17191599401665608, -0.08872734969481826, 0.3821004252070966, -0.09419136380209871, -0.06658210653163817, 0.19603969667248589, -0.25495751057953936, 0.08493812136433047, 0.2254786131174668, 0.19723571275725313, 0.1109798488027477, -0.07671998944538443, 0.02733863855195839, 0.0049729266163447625, 0.2926657258421588, 0.209203476726037, 0.16837243675804728, 0.27776210899262327, 0.23154142489859267, -0.036682946259236855, 0.15606328954859433, -0.09516190583412738, 0.07570437644405857, -0.2560015298102213, -0.09566647062564025, -0.23213346083926886, 0.04451168057022859, -0.1543763367333905, -0.14867805249827062, 0.41560149717590084, 0.12483412621785765, 0.12518815419272236, -0.05387786322516268, 0.3307272058790145, 0.11174727414694169, 0.08866342426329578, -0.014947497532905444, 0.3954554012531172, 0.16903437628896664, 0.14737017919592885, -0.23682256269106722, -0.12143218412833369, -0.11294553456827998] |
1,802.10196 | OGLE-2017-BLG-0329L: A Microlensing Binary Characterized with
Dramatically Enhanced Precision Using Data from Space-based Observations | Mass measurements of gravitational microlenses require one to determine the
microlens parallax $\pie$, but precise $\pie$ measurement, in many cases, is
hampered due to the subtlety of the microlens-parallax signal combined with the
difficulty of distinguishing the signal from those induced by other
higher-order effects. In this work, we present the analysis of the binary-lens
event OGLE-2017-BLG-0329, for which $\pie$ is measured with a dramatically
improved precision using additional data from space-based $Spitzer$
observations. We find that while the parallax model based on the ground-based
data cannot be distinguished from a zero-$\pie$ model at 2$\sigma$ level, the
addition of the $Spitzer$ data enables us to identify 2 classes of solutions,
each composed of a pair of solutions according to the well-known ecliptic
degeneracy. It is found that the space-based data reduce the measurement
uncertainties of the north and east components of the microlens-parallax vector
$\pivec_{\rm E}$ by factors $\sim 18$ and $\sim 4$, respectively. With the
measured microlens parallax combined with the angular Einstein radius measured
from the resolved caustic crossings, we find that the lens is composed of a
binary with components masses of either $(M_1,M_2)\sim (1.1,0.8)\ M_\odot$ or
$\sim (0.4,0.3)\ M_\odot$ according to the two solution classes. The first
solution is significantly favored but the second cannot be securely ruled out
based on the microlensing data alone. However, the degeneracy can be resolved
from adaptive optics observations taken $\sim 10$ years after the event.
| astro-ph.SR | mass measurements of gravitational microlenses require one to determine the microlens parallax pie but precise pie measurement in many cases is hampered due to the subtlety of the microlensparallax signal combined with the difficulty of distinguishing the signal from those induced by other higherorder effects in this work we present the analysis of the binarylens event ogle2017blg0329 for which pie is measured with a dramatically improved precision using additional data from spacebased spitzer observations we find that while the parallax model based on the groundbased data cannot be distinguished from a zeropie model at 2sigma level the addition of the spitzer data enables us to identify 2 classes of solutions each composed of a pair of solutions according to the wellknown ecliptic degeneracy it is found that the spacebased data reduce the measurement uncertainties of the north and east components of the microlensparallax vector pivec_rm e by factors sim 18 and sim 4 respectively with the measured microlens parallax combined with the angular einstein radius measured from the resolved caustic crossings we find that the lens is composed of a binary with components masses of either m_1m_2sim 1108 m_odot or sim 0403 m_odot according to the two solution classes the first solution is significantly favored but the second cannot be securely ruled out based on the microlensing data alone however the degeneracy can be resolved from adaptive optics observations taken sim 10 years after the event | [['mass', 'measurements', 'of', 'gravitational', 'microlenses', 'require', 'one', 'to', 'determine', 'the', 'microlens', 'parallax', 'pie', 'but', 'precise', 'pie', 'measurement', 'in', 'many', 'cases', 'is', 'hampered', 'due', 'to', 'the', 'subtlety', 'of', 'the', 'microlensparallax', 'signal', 'combined', 'with', 'the', 'difficulty', 'of', 'distinguishing', 'the', 'signal', 'from', 'those', 'induced', 'by', 'other', 'higherorder', 'effects', 'in', 'this', 'work', 'we', 'present', 'the', 'analysis', 'of', 'the', 'binarylens', 'event', 'ogle2017blg0329', 'for', 'which', 'pie', 'is', 'measured', 'with', 'a', 'dramatically', 'improved', 'precision', 'using', 'additional', 'data', 'from', 'spacebased', 'spitzer', 'observations', 'we', 'find', 'that', 'while', 'the', 'parallax', 'model', 'based', 'on', 'the', 'groundbased', 'data', 'can', 'not', 'be', 'distinguished', 'from', 'a', 'zeropie', 'model', 'at', '2sigma', 'level', 'the', 'addition', 'of', 'the', 'spitzer', 'data', 'enables', 'us', 'to', 'identify', '2', 'classes', 'of', 'solutions', 'each', 'composed', 'of', 'a', 'pair', 'of', 'solutions', 'according', 'to', 'the', 'wellknown', 'ecliptic', 'degeneracy', 'it', 'is', 'found', 'that', 'the', 'spacebased', 'data', 'reduce', 'the', 'measurement', 'uncertainties', 'of', 'the', 'north', 'and', 'east', 'components', 'of', 'the', 'microlensparallax', 'vector', 'pivec_rm', 'e', 'by', 'factors', 'sim', '18', 'and', 'sim', '4', 'respectively', 'with', 'the', 'measured', 'microlens', 'parallax', 'combined', 'with', 'the', 'angular', 'einstein', 'radius', 'measured', 'from', 'the', 'resolved', 'caustic', 'crossings', 'we', 'find', 'that', 'the', 'lens', 'is', 'composed', 'of', 'a', 'binary', 'with', 'components', 'masses', 'of', 'either', 'm_1m_2sim', '1108', 'm_odot', 'or', 'sim', '0403', 'm_odot', 'according', 'to', 'the', 'two', 'solution', 'classes', 'the', 'first', 'solution', 'is', 'significantly', 'favored', 'but', 'the', 'second', 'can', 'not', 'be', 'securely', 'ruled', 'out', 'based', 'on', 'the', 'microlensing', 'data', 'alone', 'however', 'the', 'degeneracy', 'can', 'be', 'resolved', 'from', 'adaptive', 'optics', 'observations', 'taken', 'sim', '10', 'years', 'after', 'the', 'event']] | [-0.08750323041413839, 0.08463232284690389, -0.07811493142587571, 0.04388939999004141, -0.09500233919865204, -0.11056174995112988, 0.05331180103095328, 0.3375177998851953, -0.22701846809190118, -0.3742527219220104, 0.10882009431007358, -0.32631965360005233, -0.04954424641258282, 0.2138979971019798, -0.046811285183932155, 0.013389953889716893, 0.12795231824852207, -0.00899761138905763, -0.082110144984988, -0.22032080463464093, 0.2948355950220114, 0.06716698289522503, 0.1886952293347209, -0.003943633487145616, 0.09997803535019884, -0.017786539275135495, -0.09064403188844714, 0.02144083639896597, -0.1390473462544413, 0.07790058238519372, 0.22352730451163172, 0.13953836012281415, 0.17683997495561585, -0.34779068771709937, -0.17056076134391862, 0.11895177757534652, 0.1349825715461077, 0.06693622983646834, 0.004481389236031498, -0.3247941018417517, 0.05553099579818579, -0.1539654525854569, -0.1430336599652138, 0.0004217906185409898, 0.006089183008377878, 0.01104371280844212, -0.2495212469008178, 0.09987375516301164, 0.008892550091378583, 0.04906253991290354, -0.07649791007911245, -0.11583173081689738, -0.05933763627480301, 0.09238700918618463, 0.03923475252898235, 0.09031221537682144, 0.10094280121673861, -0.09715677632723385, -0.08383016145796093, 0.4045839155621182, -0.08008992038149801, -0.13405112362204072, 0.160383655422001, -0.18567044641145974, -0.139393948060341, 0.1700733834469659, 0.1410428619840079, 0.09550788590254691, -0.16185971061312535, 0.019046766151630312, 0.030843353739359543, 0.24278855511847025, 0.07521182232592095, 0.03549165297777225, 0.2916585754475787, 0.1329900310240471, 0.045085478698101956, 0.0572584210409938, -0.2316641765467536, -0.027571720680078633, -0.2539641780188729, -0.09440122482154924, -0.16438427824789706, 0.06798265529381067, -0.10637313670975765, -0.07681776272256373, 0.35060731498086745, 0.1605037888691116, 0.22462544643566904, 0.03769988147989632, 0.32458660858245486, 0.08042617386175144, 0.14396148389125737, 0.04432040134058772, 0.3339123317780785, 0.09734647232207319, 0.05325868672146024, -0.19978735351282806, 0.05503203177776856, -0.027356637952228386] |
1,802.10197 | Fractional Programming for Communication Systems--Part II: Uplink
Scheduling via Matching | This two-part paper develops novel methodologies for using fractional
programming (FP) techniques to design and optimize communication systems. Part
I of this paper proposes a new quadratic transform for FP and treats its
application for continuous optimization problems. In this Part II of the paper,
we study discrete problems, such as those involving user scheduling, which are
considerably more difficult to solve. Unlike the continuous problems, discrete
or mixed discrete-continuous problems normally cannot be recast as convex
problems. In contrast to the common heuristic of relaxing the discrete
variables, this work reformulates the original problem in an FP form amenable
to distributed combinatorial optimization. The paper illustrates this
methodology by tackling the important and challenging problem of uplink
coordinated multi-cell user scheduling in wireless cellular systems. Uplink
scheduling is more challenging than downlink scheduling, because uplink user
scheduling decisions significantly affect the interference pattern in nearby
cells. Further, the discrete scheduling variable needs to be optimized jointly
with continuous variables such as transmit power levels and beamformers. The
main idea of the proposed FP approach is to decouple the interaction among the
interfering links, thereby permitting a distributed and joint optimization of
the discrete and continuous variables with provable convergence. The paper
shows that the well-known weighted minimum mean-square-error (WMMSE) algorithm
can also be derived from a particular use of FP; but our proposed FP-based
method significantly outperforms WMMSE when discrete user scheduling variables
are involved, both in term of run-time efficiency and optimizing results.
| cs.IT math.IT | this twopart paper develops novel methodologies for using fractional programming fp techniques to design and optimize communication systems part i of this paper proposes a new quadratic transform for fp and treats its application for continuous optimization problems in this part ii of the paper we study discrete problems such as those involving user scheduling which are considerably more difficult to solve unlike the continuous problems discrete or mixed discretecontinuous problems normally cannot be recast as convex problems in contrast to the common heuristic of relaxing the discrete variables this work reformulates the original problem in an fp form amenable to distributed combinatorial optimization the paper illustrates this methodology by tackling the important and challenging problem of uplink coordinated multicell user scheduling in wireless cellular systems uplink scheduling is more challenging than downlink scheduling because uplink user scheduling decisions significantly affect the interference pattern in nearby cells further the discrete scheduling variable needs to be optimized jointly with continuous variables such as transmit power levels and beamformers the main idea of the proposed fp approach is to decouple the interaction among the interfering links thereby permitting a distributed and joint optimization of the discrete and continuous variables with provable convergence the paper shows that the wellknown weighted minimum meansquareerror wmmse algorithm can also be derived from a particular use of fp but our proposed fpbased method significantly outperforms wmmse when discrete user scheduling variables are involved both in term of runtime efficiency and optimizing results | [['this', 'twopart', 'paper', 'develops', 'novel', 'methodologies', 'for', 'using', 'fractional', 'programming', 'fp', 'techniques', 'to', 'design', 'and', 'optimize', 'communication', 'systems', 'part', 'i', 'of', 'this', 'paper', 'proposes', 'a', 'new', 'quadratic', 'transform', 'for', 'fp', 'and', 'treats', 'its', 'application', 'for', 'continuous', 'optimization', 'problems', 'in', 'this', 'part', 'ii', 'of', 'the', 'paper', 'we', 'study', 'discrete', 'problems', 'such', 'as', 'those', 'involving', 'user', 'scheduling', 'which', 'are', 'considerably', 'more', 'difficult', 'to', 'solve', 'unlike', 'the', 'continuous', 'problems', 'discrete', 'or', 'mixed', 'discretecontinuous', 'problems', 'normally', 'can', 'not', 'be', 'recast', 'as', 'convex', 'problems', 'in', 'contrast', 'to', 'the', 'common', 'heuristic', 'of', 'relaxing', 'the', 'discrete', 'variables', 'this', 'work', 'reformulates', 'the', 'original', 'problem', 'in', 'an', 'fp', 'form', 'amenable', 'to', 'distributed', 'combinatorial', 'optimization', 'the', 'paper', 'illustrates', 'this', 'methodology', 'by', 'tackling', 'the', 'important', 'and', 'challenging', 'problem', 'of', 'uplink', 'coordinated', 'multicell', 'user', 'scheduling', 'in', 'wireless', 'cellular', 'systems', 'uplink', 'scheduling', 'is', 'more', 'challenging', 'than', 'downlink', 'scheduling', 'because', 'uplink', 'user', 'scheduling', 'decisions', 'significantly', 'affect', 'the', 'interference', 'pattern', 'in', 'nearby', 'cells', 'further', 'the', 'discrete', 'scheduling', 'variable', 'needs', 'to', 'be', 'optimized', 'jointly', 'with', 'continuous', 'variables', 'such', 'as', 'transmit', 'power', 'levels', 'and', 'beamformers', 'the', 'main', 'idea', 'of', 'the', 'proposed', 'fp', 'approach', 'is', 'to', 'decouple', 'the', 'interaction', 'among', 'the', 'interfering', 'links', 'thereby', 'permitting', 'a', 'distributed', 'and', 'joint', 'optimization', 'of', 'the', 'discrete', 'and', 'continuous', 'variables', 'with', 'provable', 'convergence', 'the', 'paper', 'shows', 'that', 'the', 'wellknown', 'weighted', 'minimum', 'meansquareerror', 'wmmse', 'algorithm', 'can', 'also', 'be', 'derived', 'from', 'a', 'particular', 'use', 'of', 'fp', 'but', 'our', 'proposed', 'fpbased', 'method', 'significantly', 'outperforms', 'wmmse', 'when', 'discrete', 'user', 'scheduling', 'variables', 'are', 'involved', 'both', 'in', 'term', 'of', 'runtime', 'efficiency', 'and', 'optimizing', 'results']] | [-0.14694921524127627, -0.0004909314596490761, -0.05519340456107525, 0.04772464865279134, -0.14451479246296609, -0.20516752443329347, 0.09360652787438632, 0.3803600156480992, -0.3345286606307467, -0.29890255048507597, 0.09674921793564094, -0.1922968251070356, -0.2224123601421214, 0.16663751342027197, -0.17216829672300568, 0.09986823135811827, 0.06273639224075932, -0.015119242275557747, -0.050755639738426686, -0.27668014827479676, 0.2741554687694056, 0.05214878483069682, 0.3101723409623165, -0.018156065338677387, 0.06731520882406371, 0.060471928237399795, -0.04887744076351249, 0.0072371152057350285, -0.05338187394886702, 0.12835552710074385, 0.35036425755621403, 0.20304978277526675, 0.34919913221392934, -0.42679014742635646, -0.22493208899935027, 0.12331864293910776, 0.20065116694923946, 0.02647058858973451, -0.02449012451345665, -0.23769777154879326, 0.09811133605747946, -0.15875475862389052, -0.02426522632500505, -0.021058382520383997, -0.08018955600147923, 0.0396259506412865, -0.3480311131759781, 0.0571555810831667, 0.040514580500350006, 0.01209110880414463, -0.08813820305144096, -0.1383478993633232, 0.06453972223510103, 0.11383970335802174, 0.062415675895796836, 0.009807063624399101, 0.08659231458337244, -0.07859769699209165, -0.15990143478746738, 0.431051550181398, 0.04535146396694945, -0.2560583754987797, 0.16588467336165136, -0.015983511193095122, -0.17118864142472243, 0.13278068795708403, 0.25812899151947577, 0.14208202718423937, -0.18753992534949818, 0.060793927323870074, -0.025540932358007848, 0.16190946519208507, 0.04840151313881624, 0.04758540734580559, 0.1174318117772918, 0.18583652269349782, 0.16838963839369334, 0.1628019409609118, -0.04361010116157765, -0.13911296466338954, -0.227317790938087, -0.13070907199910767, -0.19385561399347323, -0.02444581929503181, -0.06590186290371249, -0.1106849908336573, 0.39553248569202737, 0.1415931710829519, 0.1001486357290116, 0.13429519764906764, 0.37469307596727114, 0.16689705496513838, 0.01881062549660058, 0.11646883337516187, 0.15480872195420362, 0.07664621990018834, 0.1559005283213001, -0.26082039006457597, 0.041103660820877345, 0.0233064936464501] |
1,802.10198 | Optical conductivity of overdoped cuprate superconductors: application
to LSCO | We argue that recent measurements on both the superfluid density and the
optical conductivity of high-quality LSCO films can be understood almost
entirely within the theory of disordered BCS d-wave superconductors. The large
scattering rates deduced from experiments are shown to arise predominantly from
weak scatterers, probably the Sr dopants out of the CuO$_2$ plane, and
correspond to significant suppression of $T_c$ relative to a pure reference
state with the same doping. Our results confirm the "conventional" viewpoint
that the overdoped side of the cuprate phase diagram can be viewed as
approaching the BCS weak-coupling description of the superconducting state,
with significant many-body renormalization of the plasma frequency. They
suggest that, while some of the decrease in $T_c$ with overdoping may be due to
weakening of the pairing, disorder plays an essential role.
| cond-mat.supr-con cond-mat.str-el | we argue that recent measurements on both the superfluid density and the optical conductivity of highquality lsco films can be understood almost entirely within the theory of disordered bcs dwave superconductors the large scattering rates deduced from experiments are shown to arise predominantly from weak scatterers probably the sr dopants out of the cuo_2 plane and correspond to significant suppression of t_c relative to a pure reference state with the same doping our results confirm the conventional viewpoint that the overdoped side of the cuprate phase diagram can be viewed as approaching the bcs weakcoupling description of the superconducting state with significant manybody renormalization of the plasma frequency they suggest that while some of the decrease in t_c with overdoping may be due to weakening of the pairing disorder plays an essential role | [['we', 'argue', 'that', 'recent', 'measurements', 'on', 'both', 'the', 'superfluid', 'density', 'and', 'the', 'optical', 'conductivity', 'of', 'highquality', 'lsco', 'films', 'can', 'be', 'understood', 'almost', 'entirely', 'within', 'the', 'theory', 'of', 'disordered', 'bcs', 'dwave', 'superconductors', 'the', 'large', 'scattering', 'rates', 'deduced', 'from', 'experiments', 'are', 'shown', 'to', 'arise', 'predominantly', 'from', 'weak', 'scatterers', 'probably', 'the', 'sr', 'dopants', 'out', 'of', 'the', 'cuo_2', 'plane', 'and', 'correspond', 'to', 'significant', 'suppression', 'of', 't_c', 'relative', 'to', 'a', 'pure', 'reference', 'state', 'with', 'the', 'same', 'doping', 'our', 'results', 'confirm', 'the', 'conventional', 'viewpoint', 'that', 'the', 'overdoped', 'side', 'of', 'the', 'cuprate', 'phase', 'diagram', 'can', 'be', 'viewed', 'as', 'approaching', 'the', 'bcs', 'weakcoupling', 'description', 'of', 'the', 'superconducting', 'state', 'with', 'significant', 'manybody', 'renormalization', 'of', 'the', 'plasma', 'frequency', 'they', 'suggest', 'that', 'while', 'some', 'of', 'the', 'decrease', 'in', 't_c', 'with', 'overdoping', 'may', 'be', 'due', 'to', 'weakening', 'of', 'the', 'pairing', 'disorder', 'plays', 'an', 'essential', 'role']] | [-0.14773347573897527, 0.20875026889706005, -0.07716511759234775, 0.028033490198195204, -0.016874922046882512, -0.1383719846004046, 0.11262824847380441, 0.3412340755917524, -0.2593818619476169, -0.25064757108492286, 0.0004804097387337483, -0.34353967275841624, -0.08545692850786604, 0.18172764493094729, -0.016337036282958507, 0.0034307167949365045, -0.015496388634428718, -0.010132756287274057, -0.15094114880557208, -0.23474322262577207, 0.3122974688684414, 0.035467142466791814, 0.3659403747808945, 0.10355524392973603, -0.03766717139239374, -0.011407961466706786, 0.08944072156857447, 0.06130873954581811, -0.11047686450998517, 0.03544664766667481, 0.3443369056357253, -0.05514833224146046, 0.16967083972395586, -0.4431761491980712, -0.24867236554093966, 0.01889201718263496, 0.17694841243529735, 0.17699840923078022, -0.044445762107029725, -0.2997470419675364, 0.03596098999154957, -0.1363232891386921, -0.1347464915816637, -0.09357324268850953, -0.06378481992961545, -0.005997004912189327, -0.2219564304757107, 0.13557851235854923, 0.08427753438325153, 0.06075998990887538, -0.08932212847845167, -0.13879871766145965, -0.06560793919733872, 0.05567789699574162, 0.09115060911814969, 0.10853324580545488, 0.1536623573217793, -0.14781455656065418, -0.05193812620766545, 0.3639699629388918, -0.04469895298869342, -0.04379351338007508, 0.1699233652614197, -0.1834917407512623, -0.0549784306615339, 0.1739391888005141, 0.08569188895670318, 0.048743729274789975, -0.09855683970254586, 0.05829105310446646, -0.05447148639425159, 0.21500690676940648, 0.026648692335037135, 0.12058758846338824, 0.2438105571650921, 0.17160855961221277, 0.024376556865478818, 0.10532323416599065, -0.11437737962574158, -0.09086796134374195, -0.27058824112540797, -0.11388917190645982, -0.19002386047662398, 0.05711827526233138, -0.09485242171961415, -0.19195911157381707, 0.33136895498526947, 0.18341044463388817, 0.22692166592425114, -0.07615306660448923, 0.20235572863874354, 0.1394859278369765, 0.09160956167493407, 0.0380200428811175, 0.30413683086455995, 0.16206883209148296, 0.09559979201364506, -0.31851313077613597, 0.08895741779570769, 0.013134693746153909] |
1,802.10199 | Local Distributed Algorithms in Highly Dynamic Networks | The present paper studies local distributed graph problems in highly dynamic
networks. Communication and changes of the graph happen in synchronous rounds
and our algorithms always, i.e., in every round, satisfy non-trivial
guarantees, no matter how dynamic the network is.
We define a (in our view) natural generalization of static graph problems to
the dynamic graph setting. Throughout the execution of an algorithm we consider
a sliding window over the last $T$, e.g., polylogarithmic, rounds. Then, in
some round, the feasibility of an output only depends on the topology of the
graphs in the current sliding window and we call a feasible output a
$T$-dynamic solution. The guarantees of a $T$-dynamic solution become stronger
the more stable the graph is during this sliding window and, in particular,
they coincide with the definition of the static graph problem if the graph is
static throughout the window. We further present an abstract framework that
allows to develop algorithms that output $T$-dynamic solutions in all rounds.
The resulting algorithms have another desirable property: If a constant
neighborhood around some part of the graph is stable during an interval
$[t_1,t_2]$, the algorithms compute a static solution for this part of the
graph throughout the interval $[t_1+T',t_2]$ for some (small) $T'>0$.
We demonstrate our generic framework with two sample problems that abstract
basic operations in dynamic networks, namely $\textit{(degree+1)-vertex
coloring}$ and $\textit{maximal independent set (MIS)}$. To illustrate the
given guarantees consider the vertex coloring problem: The sliding window of
our (randomized) algorithm is of length $T=O(\log n)$ and any conflict between
two nodes caused by a newly inserted edge is resolved within that time. During
this conflict resolving both nodes always output colors that are not in
conflict with their respective 'old' neighbors.
| cs.DS cs.DC | the present paper studies local distributed graph problems in highly dynamic networks communication and changes of the graph happen in synchronous rounds and our algorithms always ie in every round satisfy nontrivial guarantees no matter how dynamic the network is we define a in our view natural generalization of static graph problems to the dynamic graph setting throughout the execution of an algorithm we consider a sliding window over the last t eg polylogarithmic rounds then in some round the feasibility of an output only depends on the topology of the graphs in the current sliding window and we call a feasible output a tdynamic solution the guarantees of a tdynamic solution become stronger the more stable the graph is during this sliding window and in particular they coincide with the definition of the static graph problem if the graph is static throughout the window we further present an abstract framework that allows to develop algorithms that output tdynamic solutions in all rounds the resulting algorithms have another desirable property if a constant neighborhood around some part of the graph is stable during an interval t_1t_2 the algorithms compute a static solution for this part of the graph throughout the interval t_1tt_2 for some small t0 we demonstrate our generic framework with two sample problems that abstract basic operations in dynamic networks namely textitdegree1vertex coloring and textitmaximal independent set mis to illustrate the given guarantees consider the vertex coloring problem the sliding window of our randomized algorithm is of length tolog n and any conflict between two nodes caused by a newly inserted edge is resolved within that time during this conflict resolving both nodes always output colors that are not in conflict with their respective old neighbors | [['the', 'present', 'paper', 'studies', 'local', 'distributed', 'graph', 'problems', 'in', 'highly', 'dynamic', 'networks', 'communication', 'and', 'changes', 'of', 'the', 'graph', 'happen', 'in', 'synchronous', 'rounds', 'and', 'our', 'algorithms', 'always', 'ie', 'in', 'every', 'round', 'satisfy', 'nontrivial', 'guarantees', 'no', 'matter', 'how', 'dynamic', 'the', 'network', 'is', 'we', 'define', 'a', 'in', 'our', 'view', 'natural', 'generalization', 'of', 'static', 'graph', 'problems', 'to', 'the', 'dynamic', 'graph', 'setting', 'throughout', 'the', 'execution', 'of', 'an', 'algorithm', 'we', 'consider', 'a', 'sliding', 'window', 'over', 'the', 'last', 't', 'eg', 'polylogarithmic', 'rounds', 'then', 'in', 'some', 'round', 'the', 'feasibility', 'of', 'an', 'output', 'only', 'depends', 'on', 'the', 'topology', 'of', 'the', 'graphs', 'in', 'the', 'current', 'sliding', 'window', 'and', 'we', 'call', 'a', 'feasible', 'output', 'a', 'tdynamic', 'solution', 'the', 'guarantees', 'of', 'a', 'tdynamic', 'solution', 'become', 'stronger', 'the', 'more', 'stable', 'the', 'graph', 'is', 'during', 'this', 'sliding', 'window', 'and', 'in', 'particular', 'they', 'coincide', 'with', 'the', 'definition', 'of', 'the', 'static', 'graph', 'problem', 'if', 'the', 'graph', 'is', 'static', 'throughout', 'the', 'window', 'we', 'further', 'present', 'an', 'abstract', 'framework', 'that', 'allows', 'to', 'develop', 'algorithms', 'that', 'output', 'tdynamic', 'solutions', 'in', 'all', 'rounds', 'the', 'resulting', 'algorithms', 'have', 'another', 'desirable', 'property', 'if', 'a', 'constant', 'neighborhood', 'around', 'some', 'part', 'of', 'the', 'graph', 'is', 'stable', 'during', 'an', 'interval', 't_1t_2', 'the', 'algorithms', 'compute', 'a', 'static', 'solution', 'for', 'this', 'part', 'of', 'the', 'graph', 'throughout', 'the', 'interval', 't_1tt_2', 'for', 'some', 'small', 't0', 'we', 'demonstrate', 'our', 'generic', 'framework', 'with', 'two', 'sample', 'problems', 'that', 'abstract', 'basic', 'operations', 'in', 'dynamic', 'networks', 'namely', 'textitdegree1vertex', 'coloring', 'and', 'textitmaximal', 'independent', 'set', 'mis', 'to', 'illustrate', 'the', 'given', 'guarantees', 'consider', 'the', 'vertex', 'coloring', 'problem', 'the', 'sliding', 'window', 'of', 'our', 'randomized', 'algorithm', 'is', 'of', 'length', 'tolog', 'n', 'and', 'any', 'conflict', 'between', 'two', 'nodes', 'caused', 'by', 'a', 'newly', 'inserted', 'edge', 'is', 'resolved', 'within', 'that', 'time', 'during', 'this', 'conflict', 'resolving', 'both', 'nodes', 'always', 'output', 'colors', 'that', 'are', 'not', 'in', 'conflict', 'with', 'their', 'respective', 'old', 'neighbors']] | [-0.17300362183869808, 0.08444564944828409, -0.0767480570057128, 0.028916189644586306, -0.08269096925069387, -0.14896432843176122, 0.09343339827111256, 0.4061883530167389, -0.3062322629544274, -0.289916459558603, 0.11836728293575242, -0.24661251840889267, -0.16035580152819315, 0.1265113711325072, -0.10854228944655586, 0.05251348659944581, 0.10901151054120178, 0.08428246675234431, -0.014928898165239353, -0.2630431864538209, 0.2939843730307395, 0.007371761093811758, 0.23251951808752394, 0.04122539779872273, 0.0867515779595225, 0.03852021683393637, -0.015726039400697403, 0.08741775800462631, -0.130653268318342, 0.06015262253181818, 0.25050545463221674, 0.17482834262791141, 0.32673926101121337, -0.4404131727341961, -0.1654476528915898, 0.16048082055115118, 0.12873463333641766, 0.09119367582968092, -0.01580054575979153, -0.2336453517236932, 0.14761165312437816, -0.10986020949665937, -0.056529061693555385, -0.0134530792802569, 0.04101909995922747, -0.014351320274511695, -0.26625458951244446, -0.004538580417496766, 0.07193535739736054, -0.0017435886985472265, -0.03333633800482585, -0.06399878909817867, 0.027534839834284543, 0.13334381872891912, -0.011811221194476253, 0.04875609346662197, 0.09807584274179734, -0.10954486586734367, -0.1672231864556508, 0.3598387638944159, -0.020742120749385255, -0.16557412995560944, 0.14047069276580815, -0.08731117586439754, -0.17875037978010622, 0.110616207571022, 0.152844240335372, 0.15004312089086227, -0.12282670358599906, 0.10527349265254969, -0.07822234618789047, 0.1794025586388246, 0.07949655613284363, 0.03541053607629917, 0.14668074300600287, 0.18007349334851894, 0.1577344696801675, 0.153236967195085, -0.013405962555526467, -0.10706767356282794, -0.30201210950433116, -0.11545693666028436, -0.18458058313630482, -0.038584862443006386, -0.16862974056411448, -0.2001959776265696, 0.43150764141063036, 0.14741703509418003, 0.20169086675052142, 0.11797372817032636, 0.3046054602511396, 0.0769759782128874, 0.03515218964774642, 0.18238456861703342, 0.18497079010971315, 0.08722425181984915, 0.10247505611929887, -0.18805179288829854, 0.09530831942130334, 0.06744000125264275] |
1,802.102 | Brain Tumor Type Classification via Capsule Networks | Brain tumor is considered as one of the deadliest and most common form of
cancer both in children and in adults. Consequently, determining the correct
type of brain tumor in early stages is of significant importance to devise a
precise treatment plan and predict patient's response to the adopted treatment.
In this regard, there has been a recent surge of interest in designing
Convolutional Neural Networks (CNNs) for the problem of brain tumor type
classification. However, CNNs typically require large amount of training data
and can not properly handle input transformations. Capsule networks (referred
to as CapsNets) are brand new machine learning architectures proposed very
recently to overcome these shortcomings of CNNs, and posed to revolutionize
deep learning solutions. Of particular interest to this work is that Capsule
networks are robust to rotation and affine transformation, and require far less
training data, which is the case for processing medical image datasets
including brain Magnetic Resonance Imaging (MRI) images. In this paper, we
focus to achieve the following four objectives: (i) Adopt and incorporate
CapsNets for the problem of brain tumor classification to design an improved
architecture which maximizes the accuracy of the classification problem at
hand; (ii) Investigate the over-fitting problem of CapsNets based on a real set
of MRI images; (iii) Explore whether or not CapsNets are capable of providing
better fit for the whole brain images or just the segmented tumor, and; (iv)
Develop a visualization paradigm for the output of the CapsNet to better
explain the learned features. Our results show that the proposed approach can
successfully overcome CNNs for the brain tumor classification problem.
| cs.CV | brain tumor is considered as one of the deadliest and most common form of cancer both in children and in adults consequently determining the correct type of brain tumor in early stages is of significant importance to devise a precise treatment plan and predict patients response to the adopted treatment in this regard there has been a recent surge of interest in designing convolutional neural networks cnns for the problem of brain tumor type classification however cnns typically require large amount of training data and can not properly handle input transformations capsule networks referred to as capsnets are brand new machine learning architectures proposed very recently to overcome these shortcomings of cnns and posed to revolutionize deep learning solutions of particular interest to this work is that capsule networks are robust to rotation and affine transformation and require far less training data which is the case for processing medical image datasets including brain magnetic resonance imaging mri images in this paper we focus to achieve the following four objectives i adopt and incorporate capsnets for the problem of brain tumor classification to design an improved architecture which maximizes the accuracy of the classification problem at hand ii investigate the overfitting problem of capsnets based on a real set of mri images iii explore whether or not capsnets are capable of providing better fit for the whole brain images or just the segmented tumor and iv develop a visualization paradigm for the output of the capsnet to better explain the learned features our results show that the proposed approach can successfully overcome cnns for the brain tumor classification problem | [['brain', 'tumor', 'is', 'considered', 'as', 'one', 'of', 'the', 'deadliest', 'and', 'most', 'common', 'form', 'of', 'cancer', 'both', 'in', 'children', 'and', 'in', 'adults', 'consequently', 'determining', 'the', 'correct', 'type', 'of', 'brain', 'tumor', 'in', 'early', 'stages', 'is', 'of', 'significant', 'importance', 'to', 'devise', 'a', 'precise', 'treatment', 'plan', 'and', 'predict', 'patients', 'response', 'to', 'the', 'adopted', 'treatment', 'in', 'this', 'regard', 'there', 'has', 'been', 'a', 'recent', 'surge', 'of', 'interest', 'in', 'designing', 'convolutional', 'neural', 'networks', 'cnns', 'for', 'the', 'problem', 'of', 'brain', 'tumor', 'type', 'classification', 'however', 'cnns', 'typically', 'require', 'large', 'amount', 'of', 'training', 'data', 'and', 'can', 'not', 'properly', 'handle', 'input', 'transformations', 'capsule', 'networks', 'referred', 'to', 'as', 'capsnets', 'are', 'brand', 'new', 'machine', 'learning', 'architectures', 'proposed', 'very', 'recently', 'to', 'overcome', 'these', 'shortcomings', 'of', 'cnns', 'and', 'posed', 'to', 'revolutionize', 'deep', 'learning', 'solutions', 'of', 'particular', 'interest', 'to', 'this', 'work', 'is', 'that', 'capsule', 'networks', 'are', 'robust', 'to', 'rotation', 'and', 'affine', 'transformation', 'and', 'require', 'far', 'less', 'training', 'data', 'which', 'is', 'the', 'case', 'for', 'processing', 'medical', 'image', 'datasets', 'including', 'brain', 'magnetic', 'resonance', 'imaging', 'mri', 'images', 'in', 'this', 'paper', 'we', 'focus', 'to', 'achieve', 'the', 'following', 'four', 'objectives', 'i', 'adopt', 'and', 'incorporate', 'capsnets', 'for', 'the', 'problem', 'of', 'brain', 'tumor', 'classification', 'to', 'design', 'an', 'improved', 'architecture', 'which', 'maximizes', 'the', 'accuracy', 'of', 'the', 'classification', 'problem', 'at', 'hand', 'ii', 'investigate', 'the', 'overfitting', 'problem', 'of', 'capsnets', 'based', 'on', 'a', 'real', 'set', 'of', 'mri', 'images', 'iii', 'explore', 'whether', 'or', 'not', 'capsnets', 'are', 'capable', 'of', 'providing', 'better', 'fit', 'for', 'the', 'whole', 'brain', 'images', 'or', 'just', 'the', 'segmented', 'tumor', 'and', 'iv', 'develop', 'a', 'visualization', 'paradigm', 'for', 'the', 'output', 'of', 'the', 'capsnet', 'to', 'better', 'explain', 'the', 'learned', 'features', 'our', 'results', 'show', 'that', 'the', 'proposed', 'approach', 'can', 'successfully', 'overcome', 'cnns', 'for', 'the', 'brain', 'tumor', 'classification', 'problem']] | [-3.7064139015361e-05, 9.988310948620662e-05, -0.018505675333322705, 0.07635925690610476, -0.1157648695038576, -0.18514037848130535, -0.005391090882007283, 0.40420295842471465, -0.2418605850808802, -0.31871613100824403, 0.10469850307459068, -0.23893711144806568, -0.22855952903002835, 0.1958763008422927, -0.17606425544754392, 0.09731101456190348, 0.13216252832764658, 0.043504675587034546, -0.010783163186009807, -0.2833910947461411, 0.29854096432994887, 0.029094947428062883, 0.3586815734560699, 0.01289934619788581, 0.10947571742497585, -0.052090917052805365, -0.02124235813189715, 0.0005295799433517812, -0.0740840822354992, 0.17771581721226268, 0.3597845028851958, 0.23644658115452655, 0.35970434262034995, -0.471128292835262, -0.27167149393996504, 0.13406845874178272, 0.18056002882163305, 0.1046317865480317, -0.03310690109513539, -0.3063806166391083, 0.10666345438047715, -0.11975284704743926, -0.0249120827508854, -0.11156930220521875, -0.00022305067456605387, -0.037400237084349, -0.29691593772592717, 0.07221769897962836, 0.06352720754707593, 0.07689656425830421, -0.09587859163762752, -0.09249492890919114, 0.031024026220539277, 0.18801815652396225, 0.03629000831496165, 0.07487927273145195, 0.14147466069970058, -0.22625468390969447, -0.11754872016226456, 0.3333146729951363, 0.04737489909948364, -0.19137277280557344, 0.19266454840197103, -0.06842279762165177, -0.14407393799698565, 0.10418772392857598, 0.2463212421158704, 0.08803183335003811, -0.18098387711181013, -0.025178023979959163, 0.017517502450926314, 0.15774338450387065, 0.05891244703253953, -0.024225918505370786, 0.15917489989903935, 0.266422835570489, 0.007354900836875078, 0.11913376263909237, -0.15702787509052094, -0.020619880588318623, -0.19716840439628977, -0.13176053662700996, -0.1719971037219598, -0.01038224276412824, -0.06889443566501201, -0.1743247508446672, 0.4276902529284177, 0.18435409704463057, 0.1987320299090039, 0.07529202058004326, 0.29909356968949113, 0.008576396558272614, 0.15084416830456995, 0.03167002582696697, 0.21284607425158314, 0.05657877555332466, 0.12786404526081813, -0.2093822949039472, 0.09859473361162845, 0.023820217022474215] |
1,802.10201 | Dynamics of compact binary systems in scalar-tensor theories: I.
Equations of motion to the third post-Newtonian order | Scalar-tensor theories are one of the most natural and well-constrained
alternative theories of gravity, while still allowing for significant
deviations from general relativity. We present the equations of motion of
nonspinning compact binary systems at the third post-Newtonian (PN) order in
massless scalar-tensor theories. We adapt the Fokker action of point particles
in harmonic coordinates in general relativity to the specificities of
scalar-tensor theories. We use dimensional regularisation to treat both the
infrared and ultraviolet divergences, and we consistently include the tail
effects that contribute by a non-local term to the dynamics. This work is
crucial in order to compute the scalar gravitational waveform and the energy
flux at 2PN order.
| gr-qc | scalartensor theories are one of the most natural and wellconstrained alternative theories of gravity while still allowing for significant deviations from general relativity we present the equations of motion of nonspinning compact binary systems at the third postnewtonian pn order in massless scalartensor theories we adapt the fokker action of point particles in harmonic coordinates in general relativity to the specificities of scalartensor theories we use dimensional regularisation to treat both the infrared and ultraviolet divergences and we consistently include the tail effects that contribute by a nonlocal term to the dynamics this work is crucial in order to compute the scalar gravitational waveform and the energy flux at 2pn order | [['scalartensor', 'theories', 'are', 'one', 'of', 'the', 'most', 'natural', 'and', 'wellconstrained', 'alternative', 'theories', 'of', 'gravity', 'while', 'still', 'allowing', 'for', 'significant', 'deviations', 'from', 'general', 'relativity', 'we', 'present', 'the', 'equations', 'of', 'motion', 'of', 'nonspinning', 'compact', 'binary', 'systems', 'at', 'the', 'third', 'postnewtonian', 'pn', 'order', 'in', 'massless', 'scalartensor', 'theories', 'we', 'adapt', 'the', 'fokker', 'action', 'of', 'point', 'particles', 'in', 'harmonic', 'coordinates', 'in', 'general', 'relativity', 'to', 'the', 'specificities', 'of', 'scalartensor', 'theories', 'we', 'use', 'dimensional', 'regularisation', 'to', 'treat', 'both', 'the', 'infrared', 'and', 'ultraviolet', 'divergences', 'and', 'we', 'consistently', 'include', 'the', 'tail', 'effects', 'that', 'contribute', 'by', 'a', 'nonlocal', 'term', 'to', 'the', 'dynamics', 'this', 'work', 'is', 'crucial', 'in', 'order', 'to', 'compute', 'the', 'scalar', 'gravitational', 'waveform', 'and', 'the', 'energy', 'flux', 'at', '2pn', 'order']] | [-0.13424541387153235, 0.10190401104622865, -0.08549259317334036, 0.1326097767749751, -0.11079211642143426, -0.10463090514059405, -0.053928767685434434, 0.2896671142882189, -0.18152155394997313, -0.30017178083627344, 0.014835190699175672, -0.28488416682828116, -0.14303968965940111, 0.15167030159946163, -0.06481334911491554, 0.058827315605044166, -0.006845346075138665, 0.03684975857099703, -0.09204886490185452, -0.23420863910704046, 0.3743448673395088, 0.07552185543993202, 0.14245820144476654, -0.01760829253508164, 0.0987044478649156, -0.0021644279125842963, -0.014629890735319874, 0.013312062164684673, -0.1277138192990196, 0.1068935823227753, 0.23924906100859647, 0.048299426330370945, 0.21429215798569792, -0.4315650477367747, -0.27000188790597357, 0.0640770101139473, 0.0903755890935458, 0.18025640756109948, -0.00818313793321182, -0.2593085861372602, 0.02664841341404328, -0.21441585375918998, -0.16873163690052187, -0.09966541992013787, 0.028407845025261242, -0.046427256621206434, -0.24835726085616075, 0.12051063626669012, 0.04427402950235986, -0.0219217566018169, -0.07479178350259391, -0.05824954913056514, 0.012602698208915221, 0.10070258092454022, 0.1419890391606804, 0.05051923325906197, 0.0986939582696839, -0.15885820578625645, -0.10895177242576841, 0.47672620066651356, -0.13013467521444466, -0.2267711269962895, 0.19516029212254662, -0.22914466605446226, -0.1916212972740198, 0.115818235947675, 0.18482402723014085, 0.21654703755871402, -0.1902053201831206, 0.15638777642376586, 0.10988110526641076, 0.15129050235437053, 0.10678915449980277, 0.05892382593728971, 0.29655739938555, 0.06909200945986552, 0.0099153305311595, 0.09186914866488124, -0.06369655409844609, -0.12273288789878574, -0.3726914420153375, -0.122083538709007, -0.10348351515812783, 0.03320557158650109, -0.14699814201758435, -0.14161921109844772, 0.37910716569571346, 0.19823877813938484, 0.06299731294154651, 0.10108005128085597, 0.26846583935994284, 0.13064389066615453, 0.07297736144968653, 0.05762900312657695, 0.325647465297365, 0.12551969924295606, 0.08276596290755782, -0.23828862907222328, -0.07825588149769518, 0.11303012347612362] |
1,802.10202 | Termination of pseudo-effective 4-fold flips | Let $(X,\Delta)$ be a log canonical $4$-fold over an algebraically closed field of characteristic zero. We prove that any sequence of $(K_X+\Delta)$-flips terminates. | math.AG | let xdelta be a log canonical 4fold over an algebraically closed field of characteristic zero we prove that any sequence of k_xdeltaflips terminates | [['let', 'xdelta', 'be', 'a', 'log', 'canonical', '4fold', 'over', 'an', 'algebraically', 'closed', 'field', 'of', 'characteristic', 'zero', 'we', 'prove', 'that', 'any', 'sequence', 'of', 'k_xdeltaflips', 'terminates']] | [-0.29796551417728717, 0.15251376211645865, -0.17778414284641092, 0.03328060502694412, -0.031966815194623036, -0.2293726500250738, -0.017219299826220693, 0.3306611549447883, -0.3256200199354101, -0.15174100937491114, -0.03894303161227568, -0.18916691410016606, -0.06743528124537658, 0.2545066655359485, -0.10448844862085852, -0.158657034620939, 0.013049822808666662, 0.20325024629181082, -0.14662903084800663, -0.33989947416226973, 0.3505523052405227, -0.12150168177587065, 0.16849885606841947, -0.00321065118028359, 0.1561356073838066, 0.04743504539047452, 0.13941915417936715, 0.0784954903118143, -0.18367104466365577, -0.04777614552189003, 0.3247946971519427, 0.16386681713629514, 0.2512738018042662, -0.356127642899413, -0.1385879943316633, 0.3296267692507668, 0.28272897187112406, -0.013934124896133488, 0.04579994991548698, -0.17284739021719855, 0.25746546661288117, -0.09177653264487162, -0.20938410697801207, -0.0760971234518696, 0.05465423991501501, -0.0022599440576000648, -0.3030040662905032, -0.07555811157958074, 0.1264554229988293, 0.24102597650860183, -0.018195002995939416, -0.08882018911059607, -0.036206757607446474, -0.008325523972003297, -0.0134156397967176, 0.22789485972713341, 0.07381180726753717, -0.03002043805000457, -0.1056713338052346, 0.252944104923782, -0.19889481022784655, -0.16529341820966115, -0.006931200623512268, -0.1507825314659964, -0.037641323933547195, 0.22894231077622285, 0.02134605920450254, 0.23341952027245003, -0.003952698104760863, 0.26494652913375333, -0.0985995934090831, 0.19462064128707757, 0.06102384703064507, -0.06529110126112672, 0.20699742910536853, 0.03649251476268877, 0.09981921696188775, 0.08604967995779589, -0.027089585380798035, -0.05099609430710023, -0.46625169908458536, -0.2686212799427184, -0.11666187440807169, 0.3292411401529204, -0.18131876499815422, -0.256759741851552, 0.370344663546844, 0.006023623430254785, 0.2655231495472518, 0.18339965242723172, 0.20641655237837273, 0.16304268298501318, 0.009764202870428562, 0.12329137697815895, -0.04607737132094123, 0.17774361134930092, -0.13075627994575453, -0.18992650271816688, 0.014225872572172771, 0.11517462580972775] |
1,802.10203 | Behavioral Learning of Aircraft Landing Sequencing Using a Society of
Probabilistic Finite State Machines | Air Traffic Control (ATC) is a complex safety critical environment. A tower
controller would be making many decisions in real-time to sequence aircraft.
While some optimization tools exist to help the controller in some airports,
even in these situations, the real sequence of the aircraft adopted by the
controller is significantly different from the one proposed by the optimization
algorithm. This is due to the very dynamic nature of the environment. The
objective of this paper is to test the hypothesis that one can learn from the
sequence adopted by the controller some strategies that can act as heuristics
in decision support tools for aircraft sequencing. This aim is tested in this
paper by attempting to learn sequences generated from a well-known sequencing
method that is being used in the real world. The approach relies on a genetic
algorithm (GA) to learn these sequences using a society Probabilistic
Finite-state Machines (PFSMs). Each PFSM learns a different sub-space; thus,
decomposing the learning problem into a group of agents that need to work
together to learn the overall problem. Three sequence metrics (Levenshtein,
Hamming and Position distances) are compared as the fitness functions in GA. As
the results suggest, it is possible to learn the behavior of the
algorithm/heuristic that generated the original sequence from very limited
information.
| cs.NE cs.FL cs.LG | air traffic control atc is a complex safety critical environment a tower controller would be making many decisions in realtime to sequence aircraft while some optimization tools exist to help the controller in some airports even in these situations the real sequence of the aircraft adopted by the controller is significantly different from the one proposed by the optimization algorithm this is due to the very dynamic nature of the environment the objective of this paper is to test the hypothesis that one can learn from the sequence adopted by the controller some strategies that can act as heuristics in decision support tools for aircraft sequencing this aim is tested in this paper by attempting to learn sequences generated from a wellknown sequencing method that is being used in the real world the approach relies on a genetic algorithm ga to learn these sequences using a society probabilistic finitestate machines pfsms each pfsm learns a different subspace thus decomposing the learning problem into a group of agents that need to work together to learn the overall problem three sequence metrics levenshtein hamming and position distances are compared as the fitness functions in ga as the results suggest it is possible to learn the behavior of the algorithmheuristic that generated the original sequence from very limited information | [['air', 'traffic', 'control', 'atc', 'is', 'a', 'complex', 'safety', 'critical', 'environment', 'a', 'tower', 'controller', 'would', 'be', 'making', 'many', 'decisions', 'in', 'realtime', 'to', 'sequence', 'aircraft', 'while', 'some', 'optimization', 'tools', 'exist', 'to', 'help', 'the', 'controller', 'in', 'some', 'airports', 'even', 'in', 'these', 'situations', 'the', 'real', 'sequence', 'of', 'the', 'aircraft', 'adopted', 'by', 'the', 'controller', 'is', 'significantly', 'different', 'from', 'the', 'one', 'proposed', 'by', 'the', 'optimization', 'algorithm', 'this', 'is', 'due', 'to', 'the', 'very', 'dynamic', 'nature', 'of', 'the', 'environment', 'the', 'objective', 'of', 'this', 'paper', 'is', 'to', 'test', 'the', 'hypothesis', 'that', 'one', 'can', 'learn', 'from', 'the', 'sequence', 'adopted', 'by', 'the', 'controller', 'some', 'strategies', 'that', 'can', 'act', 'as', 'heuristics', 'in', 'decision', 'support', 'tools', 'for', 'aircraft', 'sequencing', 'this', 'aim', 'is', 'tested', 'in', 'this', 'paper', 'by', 'attempting', 'to', 'learn', 'sequences', 'generated', 'from', 'a', 'wellknown', 'sequencing', 'method', 'that', 'is', 'being', 'used', 'in', 'the', 'real', 'world', 'the', 'approach', 'relies', 'on', 'a', 'genetic', 'algorithm', 'ga', 'to', 'learn', 'these', 'sequences', 'using', 'a', 'society', 'probabilistic', 'finitestate', 'machines', 'pfsms', 'each', 'pfsm', 'learns', 'a', 'different', 'subspace', 'thus', 'decomposing', 'the', 'learning', 'problem', 'into', 'a', 'group', 'of', 'agents', 'that', 'need', 'to', 'work', 'together', 'to', 'learn', 'the', 'overall', 'problem', 'three', 'sequence', 'metrics', 'levenshtein', 'hamming', 'and', 'position', 'distances', 'are', 'compared', 'as', 'the', 'fitness', 'functions', 'in', 'ga', 'as', 'the', 'results', 'suggest', 'it', 'is', 'possible', 'to', 'learn', 'the', 'behavior', 'of', 'the', 'algorithmheuristic', 'that', 'generated', 'the', 'original', 'sequence', 'from', 'very', 'limited', 'information']] | [-0.07936412484600495, 0.061720810308356154, -0.11708795501133558, 0.08397960919009904, -0.10733245139088586, -0.16082405098104657, 0.06327333997349716, 0.41138700362747516, -0.3159592218335857, -0.32255682295784527, 0.12485625176031195, -0.2338720347284052, -0.1974206061078514, 0.2070302307980013, -0.1466802151125168, 0.08574791545990558, 0.09933612538418933, 0.05772067904124193, 0.0193817057645723, -0.2696154962933544, 0.3124383261294548, 0.04150081051635408, 0.2719555270692734, -0.03473571948946463, 0.10041068378285392, -0.011842053220389741, -0.004711147386604641, 0.005741946364396087, -0.042387021248312895, 0.15062694745377647, 0.33253376726518064, 0.22856744171433568, 0.35127066884616337, -0.40191539150671424, -0.19011876514498646, 0.13456760965522693, 0.12266442020451998, 0.10829805153983463, -0.019601545272129543, -0.29821351185771766, 0.12279637160609808, -0.1436811244723422, -0.0670170097526981, -0.06511603813252856, -0.049750800699291525, 0.030051389089774637, -0.2781467222582514, -0.051392509926232365, 0.04314533812124456, 0.029766614583677777, -0.07066021449254634, -0.10087862010462052, 0.0035563721669681163, 0.20261832219592044, 0.06760161557337095, 0.0674008461924174, 0.17005506055603656, -0.10446947050649699, -0.15616575265237975, 0.38779779889612137, -0.00277271261329928, -0.22478879165887902, 0.2029769933085114, -0.0509205918691652, -0.1259659418997259, 0.12633971274486594, 0.19926712047237963, 0.0947589429865687, -0.191840848126057, 0.0313234654835656, -0.022921051284968505, 0.18355000955237633, 0.046804213411148606, -0.03608088890987091, 0.16709248173250774, 0.19330310433418665, 0.1042123352192129, 0.1243801587027341, -0.047495979322860385, -0.11057000716024287, -0.21623788035218222, -0.12259214942639467, -0.2002473799729389, 9.415194688138561e-06, -0.0905496678314423, -0.13100738150605368, 0.3853201768839749, 0.2036564145324247, 0.17768109162709628, 0.10753816238247624, 0.3320778663548702, 0.048248782393818496, 0.08473706796355154, 0.07886692488818456, 0.16612713118249695, 0.045327799314215225, 0.11886617580372144, -0.22211870924916735, 0.1329311147227744, 0.047932264778031926] |
1,802.10204 | Improved Explainability of Capsule Networks: Relevance Path by Agreement | Recent advancements in signal processing and machine learning domains have
resulted in an extensive surge of interest in deep learning models due to their
unprecedented performance and high accuracy for different and challenging
problems of significant engineering importance. However, when such deep
learning architectures are utilized for making critical decisions such as the
ones that involve human lives (e.g., in medical applications), it is of
paramount importance to understand, trust, and in one word "explain" the
rational behind deep models' decisions. Currently, deep learning models are
typically considered as black-box systems, which do not provide any clue on
their internal processing actions. Although some recent efforts have been
initiated to explain behavior and decisions of deep networks, explainable
artificial intelligence (XAI) domain is still in its infancy. In this regard,
we consider capsule networks (referred to as CapsNets), which are novel deep
structures; recently proposed as an alternative counterpart to convolutional
neural networks (CNNs), and posed to change the future of machine intelligence.
In this paper, we investigate and analyze structures and behaviors of the
CapsNets and illustrate potential explainability properties of such networks.
Furthermore, we show possibility of transforming deep learning architectures in
to transparent networks via incorporation of capsules in different layers
instead of convolution layers of the CNNs.
| cs.CV | recent advancements in signal processing and machine learning domains have resulted in an extensive surge of interest in deep learning models due to their unprecedented performance and high accuracy for different and challenging problems of significant engineering importance however when such deep learning architectures are utilized for making critical decisions such as the ones that involve human lives eg in medical applications it is of paramount importance to understand trust and in one word explain the rational behind deep models decisions currently deep learning models are typically considered as blackbox systems which do not provide any clue on their internal processing actions although some recent efforts have been initiated to explain behavior and decisions of deep networks explainable artificial intelligence xai domain is still in its infancy in this regard we consider capsule networks referred to as capsnets which are novel deep structures recently proposed as an alternative counterpart to convolutional neural networks cnns and posed to change the future of machine intelligence in this paper we investigate and analyze structures and behaviors of the capsnets and illustrate potential explainability properties of such networks furthermore we show possibility of transforming deep learning architectures in to transparent networks via incorporation of capsules in different layers instead of convolution layers of the cnns | [['recent', 'advancements', 'in', 'signal', 'processing', 'and', 'machine', 'learning', 'domains', 'have', 'resulted', 'in', 'an', 'extensive', 'surge', 'of', 'interest', 'in', 'deep', 'learning', 'models', 'due', 'to', 'their', 'unprecedented', 'performance', 'and', 'high', 'accuracy', 'for', 'different', 'and', 'challenging', 'problems', 'of', 'significant', 'engineering', 'importance', 'however', 'when', 'such', 'deep', 'learning', 'architectures', 'are', 'utilized', 'for', 'making', 'critical', 'decisions', 'such', 'as', 'the', 'ones', 'that', 'involve', 'human', 'lives', 'eg', 'in', 'medical', 'applications', 'it', 'is', 'of', 'paramount', 'importance', 'to', 'understand', 'trust', 'and', 'in', 'one', 'word', 'explain', 'the', 'rational', 'behind', 'deep', 'models', 'decisions', 'currently', 'deep', 'learning', 'models', 'are', 'typically', 'considered', 'as', 'blackbox', 'systems', 'which', 'do', 'not', 'provide', 'any', 'clue', 'on', 'their', 'internal', 'processing', 'actions', 'although', 'some', 'recent', 'efforts', 'have', 'been', 'initiated', 'to', 'explain', 'behavior', 'and', 'decisions', 'of', 'deep', 'networks', 'explainable', 'artificial', 'intelligence', 'xai', 'domain', 'is', 'still', 'in', 'its', 'infancy', 'in', 'this', 'regard', 'we', 'consider', 'capsule', 'networks', 'referred', 'to', 'as', 'capsnets', 'which', 'are', 'novel', 'deep', 'structures', 'recently', 'proposed', 'as', 'an', 'alternative', 'counterpart', 'to', 'convolutional', 'neural', 'networks', 'cnns', 'and', 'posed', 'to', 'change', 'the', 'future', 'of', 'machine', 'intelligence', 'in', 'this', 'paper', 'we', 'investigate', 'and', 'analyze', 'structures', 'and', 'behaviors', 'of', 'the', 'capsnets', 'and', 'illustrate', 'potential', 'explainability', 'properties', 'of', 'such', 'networks', 'furthermore', 'we', 'show', 'possibility', 'of', 'transforming', 'deep', 'learning', 'architectures', 'in', 'to', 'transparent', 'networks', 'via', 'incorporation', 'of', 'capsules', 'in', 'different', 'layers', 'instead', 'of', 'convolution', 'layers', 'of', 'the', 'cnns']] | [-0.05242561405718821, 0.012737942357592824, -0.03299490058401785, 0.07830979345119184, -0.13115716793119767, -0.1488717665026291, 0.00635701792272717, 0.48317517609428173, -0.300826984537121, -0.3182982655696712, 0.10778556501501686, -0.24986750326203228, -0.2708292595282974, 0.19258080145743592, -0.15046054749171386, 0.1157773920239426, 0.09317510570531878, 0.0239988351655932, -0.03047088052199103, -0.27976588160130617, 0.305052030592124, 0.05786856672170978, 0.3673761988828903, 0.05707828329558268, 0.09401722987937207, -0.045887363981621083, -0.014823654413850033, -0.02685013066279874, -0.04825346347861686, 0.20265103068993917, 0.348377271994663, 0.18478451678154204, 0.36258800536111635, -0.5083147781190431, -0.3053969770451451, 0.1345454155869111, 0.18430628287582493, 0.08621586948179119, -0.04435239201099877, -0.30461924649351296, 0.08062836150302204, -0.1793108171147793, -0.034656407291696396, -0.16769500189323985, 0.02779066015445402, 0.013285341189006759, -0.20398534453910958, -0.020255053000992507, 0.08317576319650169, 0.0909062814038088, -0.046689305708289004, -0.13562240720708893, 0.054881700621344044, 0.1782495077933633, 0.06006199411851447, 0.03944923047867926, 0.12886976200637024, -0.2709632182462909, -0.1743542454547527, 0.35721815261830936, -0.0024572448839181903, -0.15411830665014015, 0.25505568462388667, -0.008112730999075547, -0.19160346170860867, 0.056671224234369696, 0.2914179013203388, 0.08837947891958906, -0.16003622938207102, 0.03032266849986282, 0.034984567566770375, 0.11986645807785763, 0.03156912803067274, 0.04556859947599788, 0.22919388734779686, 0.27234554299599184, -0.0007272143726859471, 0.09366129976984167, -0.06524928749794962, -0.09904594677974916, -0.15645418185255186, -0.12744158917874698, -0.1605936697553468, 0.010957553383623364, -0.04650202599155189, -0.15135832226192977, 0.3504185730776798, 0.23045410719916437, 0.21879327888446043, 0.03914746018214884, 0.31189992299090447, 0.04367250968151509, 0.14464134362557135, 0.06439986258692228, 0.25743975007083925, 0.07387669602303072, 0.16622364593193076, -0.12912471709062315, 0.11199495675686694, -0.016166669383901062] |
1,802.10205 | Drift Turbulence, Particle Transport, and Anomalous Dissipation at the
Reconnecting Magnetopause | Using fully kinetic 3D simulations, the reconnection dynamics of asymmetric
current sheets are examined at the Earth's magnetopause. The plasma parameters
are selected to model MMS magnetopause diffusion region crossings with guide
fields of 0.1, 0.4, and 1 of the reconnecting magnetosheath field. In each
case, strong drift-wave fluctuations are observed in the lower-hybrid frequency
range at the steep density gradient across the magnetospheric separatrix. These
fluctuations give rise to cross-field electron particle transport. In addition,
this turbulent mixing leads to significantly enhanced electron parallel heating
in comparison to 2D simulations. We study three different methods of
quantifying the anomalous dissipation produced by the drift fluctuations, based
on spatial averaging, temporal averaging, and temporal averaging followed by
integrating along magnetic field lines. Comparison of the different methods
reveals complications in identifying and measuring the anomalous dissipation.
Nevertheless, the anomalous dissipation from short wavelength drift
fluctuations appears weak for each case, and the reconnection rates observed in
3D are nearly the same as in 2D models. The 3D simulations feature a number of
interesting new features that are consistent with recent MMS observations,
including cold beams of magnetosheath electrons that penetrate into the hotter
magnetospheric inflow, the related observation of decreasing temperature in
regions of increasing total density, and an effective turbulent diffusion
coefficient that agrees with predictions from quasi-linear theory.
| physics.plasm-ph | using fully kinetic 3d simulations the reconnection dynamics of asymmetric current sheets are examined at the earths magnetopause the plasma parameters are selected to model mms magnetopause diffusion region crossings with guide fields of 01 04 and 1 of the reconnecting magnetosheath field in each case strong driftwave fluctuations are observed in the lowerhybrid frequency range at the steep density gradient across the magnetospheric separatrix these fluctuations give rise to crossfield electron particle transport in addition this turbulent mixing leads to significantly enhanced electron parallel heating in comparison to 2d simulations we study three different methods of quantifying the anomalous dissipation produced by the drift fluctuations based on spatial averaging temporal averaging and temporal averaging followed by integrating along magnetic field lines comparison of the different methods reveals complications in identifying and measuring the anomalous dissipation nevertheless the anomalous dissipation from short wavelength drift fluctuations appears weak for each case and the reconnection rates observed in 3d are nearly the same as in 2d models the 3d simulations feature a number of interesting new features that are consistent with recent mms observations including cold beams of magnetosheath electrons that penetrate into the hotter magnetospheric inflow the related observation of decreasing temperature in regions of increasing total density and an effective turbulent diffusion coefficient that agrees with predictions from quasilinear theory | [['using', 'fully', 'kinetic', '3d', 'simulations', 'the', 'reconnection', 'dynamics', 'of', 'asymmetric', 'current', 'sheets', 'are', 'examined', 'at', 'the', 'earths', 'magnetopause', 'the', 'plasma', 'parameters', 'are', 'selected', 'to', 'model', 'mms', 'magnetopause', 'diffusion', 'region', 'crossings', 'with', 'guide', 'fields', 'of', '01', '04', 'and', '1', 'of', 'the', 'reconnecting', 'magnetosheath', 'field', 'in', 'each', 'case', 'strong', 'driftwave', 'fluctuations', 'are', 'observed', 'in', 'the', 'lowerhybrid', 'frequency', 'range', 'at', 'the', 'steep', 'density', 'gradient', 'across', 'the', 'magnetospheric', 'separatrix', 'these', 'fluctuations', 'give', 'rise', 'to', 'crossfield', 'electron', 'particle', 'transport', 'in', 'addition', 'this', 'turbulent', 'mixing', 'leads', 'to', 'significantly', 'enhanced', 'electron', 'parallel', 'heating', 'in', 'comparison', 'to', '2d', 'simulations', 'we', 'study', 'three', 'different', 'methods', 'of', 'quantifying', 'the', 'anomalous', 'dissipation', 'produced', 'by', 'the', 'drift', 'fluctuations', 'based', 'on', 'spatial', 'averaging', 'temporal', 'averaging', 'and', 'temporal', 'averaging', 'followed', 'by', 'integrating', 'along', 'magnetic', 'field', 'lines', 'comparison', 'of', 'the', 'different', 'methods', 'reveals', 'complications', 'in', 'identifying', 'and', 'measuring', 'the', 'anomalous', 'dissipation', 'nevertheless', 'the', 'anomalous', 'dissipation', 'from', 'short', 'wavelength', 'drift', 'fluctuations', 'appears', 'weak', 'for', 'each', 'case', 'and', 'the', 'reconnection', 'rates', 'observed', 'in', '3d', 'are', 'nearly', 'the', 'same', 'as', 'in', '2d', 'models', 'the', '3d', 'simulations', 'feature', 'a', 'number', 'of', 'interesting', 'new', 'features', 'that', 'are', 'consistent', 'with', 'recent', 'mms', 'observations', 'including', 'cold', 'beams', 'of', 'magnetosheath', 'electrons', 'that', 'penetrate', 'into', 'the', 'hotter', 'magnetospheric', 'inflow', 'the', 'related', 'observation', 'of', 'decreasing', 'temperature', 'in', 'regions', 'of', 'increasing', 'total', 'density', 'and', 'an', 'effective', 'turbulent', 'diffusion', 'coefficient', 'that', 'agrees', 'with', 'predictions', 'from', 'quasilinear', 'theory']] | [-0.14307794582246888, 0.21887193924002615, -0.014167488480664112, 0.08349699336792003, -0.020662054368188944, -0.09130170074799522, -0.05540777630680664, 0.3664742803285745, -0.2664869548414241, -0.3269593651914461, 0.031091680051758885, -0.26935826626775616, -0.05814081408633766, 0.20273294246448628, 0.02778587546927156, 0.008456363193743693, 0.04314373796382411, -0.04380295989526944, -0.05364452336004681, -0.14175881563463588, 0.2590932591664816, 0.11194318273655054, 0.2873159982010045, 0.02641966410420454, 0.07057975071683441, -0.08109059101557663, -0.04686326038155874, 0.06899585496972907, -0.15918308533585912, 0.06397570631713527, 0.17247907659642475, -0.0031624130947007375, 0.23479419047309255, -0.4886702570640905, -0.28655124660369685, -0.007362519530579448, 0.19660939478675243, 0.07480263636574488, -0.04730566090491431, -0.2580799530106808, 0.02522729028079828, -0.12941367384469646, -0.12151840283027426, -0.015723058922991518, 0.017012207209005613, 0.06113194910364903, -0.3107551383066245, 0.16078670863472241, 0.03777763282070572, 0.08903408777815375, -0.1002024468341419, -0.08859233422421808, -0.06423550007907165, 0.08507602025955831, 0.11537723832139322, 0.05428658300026489, 0.20481413710566068, -0.15892511860742656, -0.07817427296170287, 0.32946734267540956, -0.09530391461872072, -0.12202398837967353, 0.2200893727575683, -0.2378151308702813, -0.07791013663041998, 0.24038320841077207, 0.1592887881914397, 0.06868313209005547, -0.10773421791752547, 0.011270696329831315, -0.011795993220188062, 0.09742804706435312, 0.06620071729941462, 0.0059447451986753466, 0.2690495560030368, 0.15352602745617994, 0.032928231134164064, 0.09529923965905751, -0.1986982273604636, -0.11323456916619432, -0.27262832834808665, -0.10354202886201992, -0.1359148054373112, 0.01606732661973431, -0.11344212792061047, -0.15637440979427827, 0.4014601284722713, 0.22109346852468495, 0.19732492775232954, -0.023531171113427264, 0.3105067976866849, 0.14287641464669087, 0.04673030528091741, 0.12519855797396634, 0.25834222356524233, 0.17435947295955637, 0.1490610861939124, -0.2590001130413095, 0.053383249597391116, 0.033417105698026715] |
1,802.10206 | Networking the Boids is More Robust Against Adversarial Learning | Swarm behavior using Boids-like models has been studied primarily using
close-proximity spatial sensory information (e.g. vision range). In this study,
we propose a novel approach in which the classic definition of
boids\textquoteright \ neighborhood that relies on sensory perception and
Euclidian space locality is replaced with graph-theoretic network-based
proximity mimicking communication and social networks. We demonstrate that
networking the boids leads to faster swarming and higher quality of the
formation. We further investigate the effect of adversarial learning, whereby
an observer attempts to reverse engineer the dynamics of the swarm through
observing its behavior. The results show that networking the swarm demonstrated
a more robust approach against adversarial learning than a local-proximity
neighborhood structure.
| cs.NE cs.LG | swarm behavior using boidslike models has been studied primarily using closeproximity spatial sensory information eg vision range in this study we propose a novel approach in which the classic definition of boidstextquoteright neighborhood that relies on sensory perception and euclidian space locality is replaced with graphtheoretic networkbased proximity mimicking communication and social networks we demonstrate that networking the boids leads to faster swarming and higher quality of the formation we further investigate the effect of adversarial learning whereby an observer attempts to reverse engineer the dynamics of the swarm through observing its behavior the results show that networking the swarm demonstrated a more robust approach against adversarial learning than a localproximity neighborhood structure | [['swarm', 'behavior', 'using', 'boidslike', 'models', 'has', 'been', 'studied', 'primarily', 'using', 'closeproximity', 'spatial', 'sensory', 'information', 'eg', 'vision', 'range', 'in', 'this', 'study', 'we', 'propose', 'a', 'novel', 'approach', 'in', 'which', 'the', 'classic', 'definition', 'of', 'boidstextquoteright', 'neighborhood', 'that', 'relies', 'on', 'sensory', 'perception', 'and', 'euclidian', 'space', 'locality', 'is', 'replaced', 'with', 'graphtheoretic', 'networkbased', 'proximity', 'mimicking', 'communication', 'and', 'social', 'networks', 'we', 'demonstrate', 'that', 'networking', 'the', 'boids', 'leads', 'to', 'faster', 'swarming', 'and', 'higher', 'quality', 'of', 'the', 'formation', 'we', 'further', 'investigate', 'the', 'effect', 'of', 'adversarial', 'learning', 'whereby', 'an', 'observer', 'attempts', 'to', 'reverse', 'engineer', 'the', 'dynamics', 'of', 'the', 'swarm', 'through', 'observing', 'its', 'behavior', 'the', 'results', 'show', 'that', 'networking', 'the', 'swarm', 'demonstrated', 'a', 'more', 'robust', 'approach', 'against', 'adversarial', 'learning', 'than', 'a', 'localproximity', 'neighborhood', 'structure']] | [-0.11363194567384198, 0.03884516696945701, -0.10622375502822581, 0.04493278156627308, -0.11112775484269316, -0.16009737125343898, 0.015088922442042862, 0.41828851872547107, -0.2758269843814725, -0.324303524822674, 0.02758527146017348, -0.2258194381201809, -0.29319923232224854, 0.15129901393401352, -0.13900415416679937, 0.04315158164509657, 0.03215371154418046, 0.052186753346838734, -0.0326339301081713, -0.21082455200270156, 0.3144282234493982, 0.07310540875927969, 0.34213001028084283, 0.006752667038447477, 0.1157427064481784, 0.02279850611759519, -0.001024894958192652, 0.03139519204824782, -0.11634624947427338, 0.17270648448770357, 0.2293863926732725, 0.21149013814283535, 0.3809075425823473, -0.4441974146968939, -0.28639944772320713, 0.10594040124084461, 0.16427254299461228, 0.11466843384127556, -0.0921849146735357, -0.36512881332839076, 0.10002818044105714, -0.17097650449299676, -0.05767893310297619, -0.0959095025085844, -0.011933297625827519, -0.013343257090838796, -0.23153230271736075, -0.00849963298744776, 0.048607835204298185, 0.09481556207280267, -0.034776880318002606, -0.03306089105952362, -0.0034809253009205517, 0.11747986017514697, 0.030855132654224605, 0.02428501565538516, 0.19851365104656327, -0.14632853298151696, -0.18499056465966118, 0.3720378872684457, -0.020114622102251317, -0.16435950573703104, 0.2353544091975147, -0.06425751467997377, -0.11535203132609075, 0.06882264054465023, 0.24530489936640318, 0.11989001393614507, -0.17673711185819807, 0.022733390170932663, -0.008509383054280823, 0.1676981042880057, 0.04162608842280778, 0.04451840513131835, 0.14610435111363504, 0.2662556681358679, 0.09951168716123159, 0.1521324458722533, -0.08457286983347413, -0.1591089411342347, -0.1792597127443349, -0.10280516250958581, -0.19348023516570473, 0.031726330480622976, -0.10526998585145603, -0.12528174265753478, 0.38068660426122897, 0.21959414184940132, 0.20897534898990258, 0.08682403331304984, 0.31825335047800435, 0.028623008347031745, 0.07974669855426658, 0.09552368325265971, 0.22586936038834127, 0.02553656185892495, 0.15370787473564798, -0.23622664423574777, 0.13738531351766803, 0.04287404351105744] |
1,802.10207 | Deciphering general characteristics of residues constituting allosteric
communication paths | Considering all the PDB annotated allosteric proteins (from ASD - AlloSteric
Database) belonging to four different classes (kinases, nuclear receptors,
peptidases and transcription factors), this work has attempted to decipher
certain consistent patterns present in the residues constituting the allosteric
communication sub-system (ACSS). The thermal fluctuations of hydrophobic
residues in ACSSs were found to be significantly higher than those present in
the non-ACSS part of the same proteins, while polar residues showed the
opposite trend.
The basic residues and hydroxyl residues were found to be slightly more
predominant than the acidic residues and amide residues in ACSSs, hydrophobic
residues were found extremely frequently in kinase ACSSs. Despite having
different sequences and different lengths of ACSS, they were found to be
structurally quite similar to each other - suggesting a preferred structural
template for communication. ACSS structures recorded low RMSD and high Akaike
Information Criterion(AIC) scores among themselves. While the ACSS networks for
all the groups of allosteric proteins showed low degree centrality and
closeness centrality, the betweenness centrality magnitudes revealed nonuniform
behavior. Though cliques and communities could be identified within the ACSS,
maximal-common-subgraph considering all the ACSS could not be generated,
primarily due to the diversity in the dataset. Barring one particular case, the
entire ACSS for any class of allosteric proteins did not demonstrate "small
world" behavior, though the sub-graphs of the ACSSs, in certain cases, were
found to form small-world networks.
| q-bio.BM physics.bio-ph | considering all the pdb annotated allosteric proteins from asd allosteric database belonging to four different classes kinases nuclear receptors peptidases and transcription factors this work has attempted to decipher certain consistent patterns present in the residues constituting the allosteric communication subsystem acss the thermal fluctuations of hydrophobic residues in acsss were found to be significantly higher than those present in the nonacss part of the same proteins while polar residues showed the opposite trend the basic residues and hydroxyl residues were found to be slightly more predominant than the acidic residues and amide residues in acsss hydrophobic residues were found extremely frequently in kinase acsss despite having different sequences and different lengths of acss they were found to be structurally quite similar to each other suggesting a preferred structural template for communication acss structures recorded low rmsd and high akaike information criterionaic scores among themselves while the acss networks for all the groups of allosteric proteins showed low degree centrality and closeness centrality the betweenness centrality magnitudes revealed nonuniform behavior though cliques and communities could be identified within the acss maximalcommonsubgraph considering all the acss could not be generated primarily due to the diversity in the dataset barring one particular case the entire acss for any class of allosteric proteins did not demonstrate small world behavior though the subgraphs of the acsss in certain cases were found to form smallworld networks | [['considering', 'all', 'the', 'pdb', 'annotated', 'allosteric', 'proteins', 'from', 'asd', 'allosteric', 'database', 'belonging', 'to', 'four', 'different', 'classes', 'kinases', 'nuclear', 'receptors', 'peptidases', 'and', 'transcription', 'factors', 'this', 'work', 'has', 'attempted', 'to', 'decipher', 'certain', 'consistent', 'patterns', 'present', 'in', 'the', 'residues', 'constituting', 'the', 'allosteric', 'communication', 'subsystem', 'acss', 'the', 'thermal', 'fluctuations', 'of', 'hydrophobic', 'residues', 'in', 'acsss', 'were', 'found', 'to', 'be', 'significantly', 'higher', 'than', 'those', 'present', 'in', 'the', 'nonacss', 'part', 'of', 'the', 'same', 'proteins', 'while', 'polar', 'residues', 'showed', 'the', 'opposite', 'trend', 'the', 'basic', 'residues', 'and', 'hydroxyl', 'residues', 'were', 'found', 'to', 'be', 'slightly', 'more', 'predominant', 'than', 'the', 'acidic', 'residues', 'and', 'amide', 'residues', 'in', 'acsss', 'hydrophobic', 'residues', 'were', 'found', 'extremely', 'frequently', 'in', 'kinase', 'acsss', 'despite', 'having', 'different', 'sequences', 'and', 'different', 'lengths', 'of', 'acss', 'they', 'were', 'found', 'to', 'be', 'structurally', 'quite', 'similar', 'to', 'each', 'other', 'suggesting', 'a', 'preferred', 'structural', 'template', 'for', 'communication', 'acss', 'structures', 'recorded', 'low', 'rmsd', 'and', 'high', 'akaike', 'information', 'criterionaic', 'scores', 'among', 'themselves', 'while', 'the', 'acss', 'networks', 'for', 'all', 'the', 'groups', 'of', 'allosteric', 'proteins', 'showed', 'low', 'degree', 'centrality', 'and', 'closeness', 'centrality', 'the', 'betweenness', 'centrality', 'magnitudes', 'revealed', 'nonuniform', 'behavior', 'though', 'cliques', 'and', 'communities', 'could', 'be', 'identified', 'within', 'the', 'acss', 'maximalcommonsubgraph', 'considering', 'all', 'the', 'acss', 'could', 'not', 'be', 'generated', 'primarily', 'due', 'to', 'the', 'diversity', 'in', 'the', 'dataset', 'barring', 'one', 'particular', 'case', 'the', 'entire', 'acss', 'for', 'any', 'class', 'of', 'allosteric', 'proteins', 'did', 'not', 'demonstrate', 'small', 'world', 'behavior', 'though', 'the', 'subgraphs', 'of', 'the', 'acsss', 'in', 'certain', 'cases', 'were', 'found', 'to', 'form', 'smallworld', 'networks']] | [-0.13824294656792058, 0.15500541785444719, -0.02404217189383008, 0.12380056513528778, -0.01868176345594457, -0.16056349028448322, 0.039110561547388574, 0.415945051393845, -0.24067309398680006, -0.3047383018576495, -0.011395425304959196, -0.29201961380926, -0.19081633240815318, 0.12879480319295084, -0.03386601898511502, -0.022858782362660583, 0.08884975611384023, 0.07350572854087387, 0.046984093163228116, -0.23830608480162754, 0.2223931440451728, 0.06825040677964425, 0.2708744121641577, 0.06425884310238161, 0.012160129619491521, -0.036456034775199736, -0.010672220993594222, 0.014914438405462593, -0.08584820820092498, 0.15018589788789363, 0.3518171480791192, 0.08599332281663226, 0.2294788943554402, -0.4094750362280182, -0.22527550520079972, 0.1528337495247649, 0.16877466794472631, 0.11667044408501963, 0.017653502243053527, -0.26790842118658664, 0.12684417943088624, -0.12570006395276023, -0.055285510332180016, -0.059586669788142005, 0.023746684099248065, 0.08635724502634093, -0.19374257945640233, 0.11662280557078149, -0.009547781654621274, 0.13381998558705138, -0.08272190579102429, -0.21358054509747462, -0.09377130124603394, 0.19553558635915166, 0.07129312612604563, -0.016431456524571033, 0.23220702755728548, -0.08144303881111944, -0.0968238950590603, 0.3542113801144425, 0.04263471882410311, -0.15722209167982645, 0.22504236326770372, -0.14153046786809742, -0.20622308755350927, 0.20436393633476635, 0.1213866175062101, 0.10207448904976937, -0.20085085967621286, -0.036197798523030324, 0.010509508132671994, 0.2250924947505431, 0.17076778825344763, 0.016720408233219044, 0.16127110953008889, 0.09838462586613117, 0.00957202166062472, 0.13757512572766098, -0.04570344685564548, -0.09852238940608396, -0.1593191961671681, -0.11194001841189602, -0.1271577522764803, -0.008480954107429446, -0.10626813699549016, -0.15959329633267866, 0.4051440546590638, 0.04697993259040007, 0.19672192266777092, 0.06739111743777138, 0.16626482664470024, -0.044512768148850766, 0.16984016171683217, 0.05042291380206558, 0.2084245846923728, 0.06193806301691623, 0.07417990618676669, -0.20040150531895853, 0.19379794874150585, 0.015456483033198519] |
1,802.10208 | Error Correction in Structured Optical Receivers | Integrated optics Green Machines enable better communication in
photon-starved environments, but fabrication inconsistencies induce
unpredictable internal phase errors, making them difficult to construct. We
describe and experimentally demonstrate a new method to compensate for
arbitrary phase errors by deriving a convex error space and implementing an
algorithm to learn a unique codebook of codewords corresponding to each matrix.
| quant-ph | integrated optics green machines enable better communication in photonstarved environments but fabrication inconsistencies induce unpredictable internal phase errors making them difficult to construct we describe and experimentally demonstrate a new method to compensate for arbitrary phase errors by deriving a convex error space and implementing an algorithm to learn a unique codebook of codewords corresponding to each matrix | [['integrated', 'optics', 'green', 'machines', 'enable', 'better', 'communication', 'in', 'photonstarved', 'environments', 'but', 'fabrication', 'inconsistencies', 'induce', 'unpredictable', 'internal', 'phase', 'errors', 'making', 'them', 'difficult', 'to', 'construct', 'we', 'describe', 'and', 'experimentally', 'demonstrate', 'a', 'new', 'method', 'to', 'compensate', 'for', 'arbitrary', 'phase', 'errors', 'by', 'deriving', 'a', 'convex', 'error', 'space', 'and', 'implementing', 'an', 'algorithm', 'to', 'learn', 'a', 'unique', 'codebook', 'of', 'codewords', 'corresponding', 'to', 'each', 'matrix']] | [-0.11826292538999356, 0.08108746186566161, -0.09535140709566145, 0.10293468542332793, -0.1252080250956953, -0.24539206779947312, 0.11319624624568327, 0.4744979593388993, -0.2975296852467903, -0.30591771067601853, 0.09721012247810622, -0.17221767133390853, -0.18421438836556828, 0.18306579199972853, -0.1607545485302549, 0.12336371691319449, 0.07257241451438388, -0.07675406592095206, -0.12238892689668412, -0.23492026939217386, 0.2518825666689924, 0.07562624758655398, 0.27424273415115374, -0.06212916225997795, 0.18261435116512764, 0.0005596618404900976, -0.039445097229026, -0.02736480966870721, -0.07385348561541016, 0.1509822926941681, 0.3248677923512677, 0.1325392802085342, 0.2677437402307987, -0.4164254062744821, -0.1884889441124838, 0.15120254248252202, 0.1282866560083268, 0.1837623721984183, -0.04265264384769674, -0.30521208356166707, 0.05901928099097106, -0.14922345136713783, -0.13291934945877512, -0.15395439299353367, -0.0008872476534853721, -0.03365027815593278, -0.32988649266290254, -0.031127140223016513, -0.014140646133957237, 0.010140637963496405, -0.009287888802395299, -0.08958968209857442, 0.06074524571284138, 0.14451056243530636, -0.08846407327479844, 0.06109165082131673, 0.1633413083096645, -0.05765941077923595, -0.14239489890089066, 0.3697298440504177, 0.03211555037454798, -0.20833193139847497, 0.14865059908158307, -0.06378994375700131, -0.07973185631221738, 0.18865689092540536, 0.2562724729550296, 0.02647552249856807, -0.1969958721692192, 0.0068523481163067805, 0.10010591794833026, 0.20089269183768793, 0.06405587352667774, 0.11057260769001882, 0.15978238609587325, 0.1453351835110064, 0.08795979291457555, 0.16700019910610442, -0.03738683843152228, -0.05439082019287964, -0.242279759656381, -0.17058184064507229, -0.18645215099918303, -0.020014105136114863, -0.07557677162022346, -0.18346429632596295, 0.3217620854065272, 0.22835979283112903, 0.19603545434676625, 0.10591334909007981, 0.3456141066352098, 0.04466546739547931, 0.07428404442355807, 0.12207594801318543, 0.18591539283957462, 0.12297119714865654, 0.07241477292223737, -0.22622647136449814, 0.07025615622867541, 0.02650246416732412] |
1,802.10209 | Tracing the Pathway from Drift-Wave Turbulence with Broken Symmetry to
the Generation of Sheared Axial Mean Flow | This study traces the emergence of sheared axial flow from collisional drift
wave turbulence with broken symmetry in a linear plasma device---CSDX. As the
density profile steepens, the axial Reynolds stress develops and drives a
radially sheared axial flow that is parallel to the magnetic field. Results
show that the non-diffusive piece of the Reynolds stress is driven by the
density gradient and results from the spectral asymmetry of the turbulence and
thus is dynamical in origin. Taken together, these findings constitute the
first simultaneous demonstration of the causal link between the density
gradient, turbulence and stress with broken spectral symmetry, and the mean
axial flow.
| physics.plasm-ph | this study traces the emergence of sheared axial flow from collisional drift wave turbulence with broken symmetry in a linear plasma devicecsdx as the density profile steepens the axial reynolds stress develops and drives a radially sheared axial flow that is parallel to the magnetic field results show that the nondiffusive piece of the reynolds stress is driven by the density gradient and results from the spectral asymmetry of the turbulence and thus is dynamical in origin taken together these findings constitute the first simultaneous demonstration of the causal link between the density gradient turbulence and stress with broken spectral symmetry and the mean axial flow | [['this', 'study', 'traces', 'the', 'emergence', 'of', 'sheared', 'axial', 'flow', 'from', 'collisional', 'drift', 'wave', 'turbulence', 'with', 'broken', 'symmetry', 'in', 'a', 'linear', 'plasma', 'devicecsdx', 'as', 'the', 'density', 'profile', 'steepens', 'the', 'axial', 'reynolds', 'stress', 'develops', 'and', 'drives', 'a', 'radially', 'sheared', 'axial', 'flow', 'that', 'is', 'parallel', 'to', 'the', 'magnetic', 'field', 'results', 'show', 'that', 'the', 'nondiffusive', 'piece', 'of', 'the', 'reynolds', 'stress', 'is', 'driven', 'by', 'the', 'density', 'gradient', 'and', 'results', 'from', 'the', 'spectral', 'asymmetry', 'of', 'the', 'turbulence', 'and', 'thus', 'is', 'dynamical', 'in', 'origin', 'taken', 'together', 'these', 'findings', 'constitute', 'the', 'first', 'simultaneous', 'demonstration', 'of', 'the', 'causal', 'link', 'between', 'the', 'density', 'gradient', 'turbulence', 'and', 'stress', 'with', 'broken', 'spectral', 'symmetry', 'and', 'the', 'mean', 'axial', 'flow']] | [-0.1960850752513146, 0.23259485427822385, -0.11210240947659172, 0.010819362656080297, -0.047592188675133956, -0.04497083465990034, -0.08421754686250574, 0.35300817585417205, -0.28638955371543057, -0.2622728975711479, 0.06841467911865384, -0.2128176625818014, -0.11052545537906033, 0.1197281033731997, 0.03567214518608082, 0.042688475886271116, -0.005917268343979404, -0.017814288075481143, -0.036707355533283026, -0.10054723130361665, 0.31456999192457824, 0.05948417103583259, 0.3470858023280189, 0.06800612715361197, 0.07045379634724841, -0.0676065969369596, -0.03278277866719734, 0.08390620963071428, -0.15897471276666258, 0.0669984989533467, 0.14231204490753865, 0.013308835754703199, 0.25194193578901747, -0.46832146295124577, -0.25341190583227824, -0.001973615090052287, 0.13851087810028168, 0.11779768183561308, -0.06801040709417845, -0.25729127946708885, 0.04944667418797811, -0.14084077004476317, -0.16522436365041704, -0.04865162137762776, 0.0012933802181145264, 0.05313049755558105, -0.300317022683365, 0.22271740939689888, 0.07776878630310032, 0.11250453289775621, -0.12739750224032573, -0.04653154578769491, -0.11802105505152473, 0.08558705074801332, 0.18357128661258945, 0.0714928880622167, 0.1936884487469104, -0.190313786124101, -0.035148842499724456, 0.361913278672312, -0.07574054713560534, -0.15253237641993023, 0.14337582953185551, -0.17931433658426008, -0.07486690224059636, 0.1967738547029772, 0.18686332333655584, 0.019105458082187745, -0.05633426955235856, 0.003821027364825741, -0.06069846863600625, 0.14121295913521734, 0.03785233459701495, -0.09484917588554145, 0.2559140985476829, 0.12711120005697013, 0.08230057045639981, 0.12770690647885202, -0.13064717829582237, -0.09294910663517103, -0.34501642375474884, -0.1532844730874612, -0.17513468891737008, 0.0659968135283894, -0.09905392310645852, -0.16358866503550892, 0.3899295964411327, 0.1372764652861016, 0.19603046884848957, 0.04145720183538894, 0.31698029731355964, 0.12833717808992204, 0.07176552244595119, 0.1594445281107688, 0.276933832306947, 0.26302672404175004, 0.1851437301641064, -0.29799860209404005, 0.01615177258139565, 0.043190920590201305] |
1,802.1021 | Real and complex multiplication on K3 surfaces via period integration | We report on a new approach, as well as some related experiments, to
construct families of K3 surfaces having real or complex multiplication. The
approach is based on an explicit description of the transcendental part of the
cohomology in a topological way, using topological tori. Fundamental ideas
include considering the period space of marked K3 surfaces, determining the
periods by numerical integration, as well as tracing the modular curve by a
numerical continuation method.
| math.AG math.AT math.NT | we report on a new approach as well as some related experiments to construct families of k3 surfaces having real or complex multiplication the approach is based on an explicit description of the transcendental part of the cohomology in a topological way using topological tori fundamental ideas include considering the period space of marked k3 surfaces determining the periods by numerical integration as well as tracing the modular curve by a numerical continuation method | [['we', 'report', 'on', 'a', 'new', 'approach', 'as', 'well', 'as', 'some', 'related', 'experiments', 'to', 'construct', 'families', 'of', 'k3', 'surfaces', 'having', 'real', 'or', 'complex', 'multiplication', 'the', 'approach', 'is', 'based', 'on', 'an', 'explicit', 'description', 'of', 'the', 'transcendental', 'part', 'of', 'the', 'cohomology', 'in', 'a', 'topological', 'way', 'using', 'topological', 'tori', 'fundamental', 'ideas', 'include', 'considering', 'the', 'period', 'space', 'of', 'marked', 'k3', 'surfaces', 'determining', 'the', 'periods', 'by', 'numerical', 'integration', 'as', 'well', 'as', 'tracing', 'the', 'modular', 'curve', 'by', 'a', 'numerical', 'continuation', 'method']] | [-0.1639359764175842, 0.05212029973473683, -0.11677033429008883, 0.06438615323654753, -0.08503750789709189, -0.10243717138655484, 0.042413595192310576, 0.33011086481447155, -0.2751991960308137, -0.3088260762947234, 0.14760157547582797, -0.23410628819574658, -0.24206387742762328, 0.3235254184487653, -0.08501877886167652, 0.05589375363008396, 0.017549063757443847, 0.014309240177877852, -0.10127022805799907, -0.27096504471390637, 0.4112691288260189, -0.003922141610166511, 0.1951044667071688, 0.04712603798110944, 0.07110403493248127, 0.006999010582001427, -0.06348073924773662, -0.05791921998614861, -0.12933323861452173, 0.16404289202890485, 0.2548712571623509, 0.05462897449379434, 0.174961561368577, -0.40703141062545617, -0.23942949685796694, 0.0688642954227288, 0.12660524252852476, 0.062266489251743294, -0.06102927522167463, -0.2588789159985813, 0.032747493930966466, -0.15312566910241102, -0.1946539223269635, -0.16967780349423756, 0.014805711730307824, 0.03986965785608501, -0.14861785150384782, 0.0025356679531821124, 0.032852157997596707, 0.172231079972777, -0.07567055255954934, -0.08819939021172153, -0.035216628517200414, 0.09680783044785966, 0.03375841149544293, 0.04015450141191281, 0.08193855952295298, -0.09246478729088463, -0.17891396190719427, 0.3916851331706385, -0.08358828668054696, -0.20737261906568263, 0.1704418912334871, -0.08751731316835897, -0.10615803446066943, 0.13269274402409792, 0.13533863885881933, 0.20882394081736738, -0.03279771751447304, 0.1141715027404496, -0.0786040592435244, 0.11064292737156958, 0.0772582003186029, -0.039399409490461286, 0.19108596980269696, 0.17130387566883015, 0.05462534265353571, 0.13282971175362332, -0.03905732262678243, -0.11174145660589675, -0.3748682030803851, -0.206664554554516, -0.17757261815052983, 0.10674329795497092, -0.0702410821198813, -0.20276942380980864, 0.4452354465422497, 0.031166895116503175, 0.23964205304966182, 0.06354792307860949, 0.2772405375097249, 0.08833370530801649, 0.058329941679108446, 0.020719473306844767, 0.11501908506073272, 0.14140352336815684, 0.003378410609690724, -0.15480448133815583, 0.011267385233942469, 0.1652491476223175] |
1,802.10211 | Theoretical implications of the galactic radial acceleration relation of
McGaugh, Lelli, and Schombert | Velocities in stable circular orbits about galaxies, a measure of centripetal
gravitation, exceed the expected Kepler/Newton velocity as orbital radius
increases. Standard LCDM attributes this anomaly to galactic dark matter.
McGaugh et al have recently shown for 153 disc galaxies that observed radial
acceleration is an apparently universal function of classical acceleration
computed for observed galactic baryonic mass density. This is consistent with
the empirical MOND model, not requiring dark matter. It is shown here that
suitably constrained LCDM and conformal gravity (CG) also produce such a
universal correlation function. LCDM requires a very specific dark matter
distribution, while the implied CG nonclassical acceleration must be
independent of galactic mass. All three constrained radial acceleration
functions agree with the empirical baryonic $v^4$ Tully-Fisher relation.
Accurate rotation data in the nominally flat velocity range could distinguish
between MOND, LCDM, and conformal gravity.
| astro-ph.GA | velocities in stable circular orbits about galaxies a measure of centripetal gravitation exceed the expected keplernewton velocity as orbital radius increases standard lcdm attributes this anomaly to galactic dark matter mcgaugh et al have recently shown for 153 disc galaxies that observed radial acceleration is an apparently universal function of classical acceleration computed for observed galactic baryonic mass density this is consistent with the empirical mond model not requiring dark matter it is shown here that suitably constrained lcdm and conformal gravity cg also produce such a universal correlation function lcdm requires a very specific dark matter distribution while the implied cg nonclassical acceleration must be independent of galactic mass all three constrained radial acceleration functions agree with the empirical baryonic v4 tullyfisher relation accurate rotation data in the nominally flat velocity range could distinguish between mond lcdm and conformal gravity | [['velocities', 'in', 'stable', 'circular', 'orbits', 'about', 'galaxies', 'a', 'measure', 'of', 'centripetal', 'gravitation', 'exceed', 'the', 'expected', 'keplernewton', 'velocity', 'as', 'orbital', 'radius', 'increases', 'standard', 'lcdm', 'attributes', 'this', 'anomaly', 'to', 'galactic', 'dark', 'matter', 'mcgaugh', 'et', 'al', 'have', 'recently', 'shown', 'for', '153', 'disc', 'galaxies', 'that', 'observed', 'radial', 'acceleration', 'is', 'an', 'apparently', 'universal', 'function', 'of', 'classical', 'acceleration', 'computed', 'for', 'observed', 'galactic', 'baryonic', 'mass', 'density', 'this', 'is', 'consistent', 'with', 'the', 'empirical', 'mond', 'model', 'not', 'requiring', 'dark', 'matter', 'it', 'is', 'shown', 'here', 'that', 'suitably', 'constrained', 'lcdm', 'and', 'conformal', 'gravity', 'cg', 'also', 'produce', 'such', 'a', 'universal', 'correlation', 'function', 'lcdm', 'requires', 'a', 'very', 'specific', 'dark', 'matter', 'distribution', 'while', 'the', 'implied', 'cg', 'nonclassical', 'acceleration', 'must', 'be', 'independent', 'of', 'galactic', 'mass', 'all', 'three', 'constrained', 'radial', 'acceleration', 'functions', 'agree', 'with', 'the', 'empirical', 'baryonic', 'v4', 'tullyfisher', 'relation', 'accurate', 'rotation', 'data', 'in', 'the', 'nominally', 'flat', 'velocity', 'range', 'could', 'distinguish', 'between', 'mond', 'lcdm', 'and', 'conformal', 'gravity']] | [-0.08993802687452573, 0.1430970843923985, -0.14410813718859572, 0.1675925457226445, -0.16179185804711388, -0.13633439724799246, -0.06543279980458984, 0.36625669920550924, -0.19739277942239175, -0.3689602885952419, -0.0647129943186883, -0.23021489927944327, -0.016330175288021564, 0.20133348745293916, -0.04671490686014294, 0.05521720005199313, -0.007009431009646505, -0.02151905585862031, -0.06956410168869687, -0.2686927953385748, 0.25359502861143224, 0.10519760786555707, 0.18474684870868388, -0.05675292164419911, 0.1139596267345561, -0.11657963791263423, -0.06312996682245284, 0.035921680474919934, -0.19860279186115284, 0.008220018705885325, 0.18821790179769907, 0.11656620736170485, 0.1857884358830883, -0.33666566026264005, -0.2612446837892224, 0.1457380109965535, 0.192814773108278, 0.07740588397386351, -0.09909582876134664, -0.25959282756916113, 0.02527015857132418, -0.21270683574257418, -0.1899716607960207, -0.020828642124044044, 0.07498840795098138, -0.0025463994530062857, -0.21442120484675148, 0.24546457464020932, -0.005924868084756392, 0.035118074735094394, -0.0845437376926254, -0.0987813741949919, -0.07039690107838915, -0.026612121694987372, 0.08085015187389218, 0.118517594036114, 0.24774486816022545, -0.11958028958511673, -0.017482819149985777, 0.4497800303290465, -0.08661624531461191, -0.11381453002021381, 0.1879482207370789, -0.20688217524771713, -0.15353377350111258, 0.04954927396029234, 0.10471022383509469, 0.026761794269883208, -0.14545837758508112, 0.09681217741952942, -0.07044476817495056, 0.19865865583830913, 0.0858030564517581, -0.009183686522633901, 0.3819118106305333, 0.0763724190382553, 0.055426218864574495, -0.052250626454562216, -0.11973543801910377, -0.0835176956162156, -0.2956469186947548, -0.1070268411204909, -0.16978911376375305, 0.02062298976161401, -0.17706511594068225, -0.12947444089680046, 0.2975688669431422, 0.08431437137800718, 0.21448597356544008, 0.13653234936230416, 0.312694285903126, 0.07158666866505103, 0.08533674588377055, 0.1494622420619375, 0.37155272366612085, 0.17126824137688215, 0.05225336269608566, -0.27582239239543144, 0.02494854769070766, -0.001554034261165985] |
1,802.10212 | Asymptotic behavior of R\'enyi entropy in the central limit theorem | We explore an asymptotic behavior of R\'enyi entropy along convolutions in
the central limit theorem with respect to the increasing number of i.i.d.
summands. In particular, the problem of monotonicity is addressed under
suitable moment hypotheses.
| math.PR | we explore an asymptotic behavior of renyi entropy along convolutions in the central limit theorem with respect to the increasing number of iid summands in particular the problem of monotonicity is addressed under suitable moment hypotheses | [['we', 'explore', 'an', 'asymptotic', 'behavior', 'of', 'renyi', 'entropy', 'along', 'convolutions', 'in', 'the', 'central', 'limit', 'theorem', 'with', 'respect', 'to', 'the', 'increasing', 'number', 'of', 'iid', 'summands', 'in', 'particular', 'the', 'problem', 'of', 'monotonicity', 'is', 'addressed', 'under', 'suitable', 'moment', 'hypotheses']] | [-0.1623441589375337, 0.10821532001823976, -0.08916629892256525, 0.06959204801629919, 0.013272941578179598, -0.10020123781739837, 0.0553531494305288, 0.3287763391724891, -0.2987188696861267, -0.19833843269831655, 0.10881012107064533, -0.3104256237339642, -0.041398936950524025, 0.1475822175335553, -0.1918678902115466, 0.13246286056366646, 0.027445706894569512, 0.11723571112896833, -0.08053956336031358, -0.24262483156700101, 0.3476638017843167, 0.02058055150943498, 0.318097118081318, 0.04722908994719748, 0.06088156421254906, 0.0727957768443351, -0.0011476508289989498, 0.013894192460510466, -0.17249500242501703, 0.11881329219775377, 0.2114438744675782, 0.0818312337829007, 0.3085785268081559, -0.40699285455048084, -0.12751101640363535, 0.1914993061994513, 0.13520799478929904, -0.0024581851644648444, 0.0014200218332310517, -0.2425826930234002, 0.12844378444262677, -0.17514363464174998, -0.20497494584156406, -0.06081809939092232, 0.0037054220576667124, 0.06644682590720347, -0.30708974227309227, 0.1028789986610516, 0.13944421708583832, 0.09759047661080128, -0.060045283481789134, -0.09831298986035916, 0.02873231499041948, 0.09100227938809742, 0.22142043685825127, -0.01804937362127627, 0.10658126336056739, -0.1380759801508652, -0.08208669547457248, 0.280355023064961, -0.052157680219453245, -0.2499905547334088, 0.12735959804720348, -0.18156852527883732, -0.2208584286013825, 0.06409056165203866, 0.13077562949102786, 0.14981088451006347, -0.12333257973659784, 0.14811625132440692, -0.047776901784042515, 0.1068888417341643, 0.12325276342582786, 0.06799401625822712, 0.1674425529781729, 0.08219962080086891, 0.13885192088006684, 0.27891891035768723, -0.04247453005518764, -0.12993282205813253, -0.3178006950765848, -0.1854009648733255, -0.2347013154067099, 0.08664597773652834, -0.2083971655099756, -0.16936125288096568, 0.309912944626477, 0.15683432905158648, 0.19980994265319574, 0.14152164032889736, 0.21585223311558366, 0.17276239824584788, -0.012737466824344464, 0.03226369778470447, 0.1353744621285134, 0.2589489602121628, 0.05097798239957127, -0.17005787123667282, 0.10535054963030335, 0.12142473997341262] |
1,802.10213 | Applications of Variable Discounting Dynamic Programming to Iterated
Function Systems and Related Problems | We study existence and uniqueness of the fixed points solutions of a large
class of non-linear variable discounted transfer operators associated to a
sequential decision-making process. We establish regularity properties of these
solutions, with respect to the immediate return and the variable discount. In
addition, we apply our methods to reformulating and solving, in the setting of
dynamic programming, some central variational problems on the theory of
iterated function systems, Markov decision processes, discrete Aubry-Mather
theory, Sinai-Ruelle-Bowen measures, fat solenoidal attractors, and ergodic
optimization.
| math.DS | we study existence and uniqueness of the fixed points solutions of a large class of nonlinear variable discounted transfer operators associated to a sequential decisionmaking process we establish regularity properties of these solutions with respect to the immediate return and the variable discount in addition we apply our methods to reformulating and solving in the setting of dynamic programming some central variational problems on the theory of iterated function systems markov decision processes discrete aubrymather theory sinairuellebowen measures fat solenoidal attractors and ergodic optimization | [['we', 'study', 'existence', 'and', 'uniqueness', 'of', 'the', 'fixed', 'points', 'solutions', 'of', 'a', 'large', 'class', 'of', 'nonlinear', 'variable', 'discounted', 'transfer', 'operators', 'associated', 'to', 'a', 'sequential', 'decisionmaking', 'process', 'we', 'establish', 'regularity', 'properties', 'of', 'these', 'solutions', 'with', 'respect', 'to', 'the', 'immediate', 'return', 'and', 'the', 'variable', 'discount', 'in', 'addition', 'we', 'apply', 'our', 'methods', 'to', 'reformulating', 'and', 'solving', 'in', 'the', 'setting', 'of', 'dynamic', 'programming', 'some', 'central', 'variational', 'problems', 'on', 'the', 'theory', 'of', 'iterated', 'function', 'systems', 'markov', 'decision', 'processes', 'discrete', 'aubrymather', 'theory', 'sinairuellebowen', 'measures', 'fat', 'solenoidal', 'attractors', 'and', 'ergodic', 'optimization']] | [-0.12119558935574744, 0.02925436250266752, -0.10053773279789657, 0.14093250408294417, -0.07499110840061414, -0.11364928142644376, 0.10382552475701752, 0.35067312314086374, -0.351645925126615, -0.1951143358913084, 0.18923639029353148, -0.2784760556338976, -0.15063375772331797, 0.14909900346260874, -0.10732924631364378, 0.16583458678464272, 0.048912509255820795, 0.0028237616865053063, -0.07352629522349508, -0.21020376978309027, 0.37007265233079945, -0.01417589019097033, 0.23166797152676044, -0.004807434288696164, 0.15344323250575967, 0.04785340240812816, -0.040384563007613734, 0.04236405723661717, -0.159765186054366, 0.14729050903891525, 0.2887337644407082, 0.14087808042919883, 0.3682538937954676, -0.3797148066583932, -0.1994050964962558, 0.15138329208518067, 0.08787812191682558, 0.028809080831706524, -0.014882861621334172, -0.28422508963073295, 0.07462841984150666, -0.12403422095147627, -0.16947878111109493, -0.11166393631581395, -0.03446844813879579, 0.10581308061955497, -0.3260828556625971, 0.0433682122411916, 0.09742279510412898, 0.05950370691494927, -0.15985213228434855, -0.06589339868653388, 0.0004750559552727888, 0.089196369002041, 0.10089901512054937, -0.0070971293191957685, 0.14241316004855825, -0.13010096917527594, -0.23164162198857716, 0.3097047857674105, -0.061476975008623584, -0.2593775608887275, 0.2368489000170181, -0.11987138916516588, -0.1977701872653727, 0.12769249540066258, 0.24633973544197424, 0.18587256861584528, -0.15163750935988946, 0.1189503829033735, -0.05589123653425347, 0.10841844829597644, 0.05549161673878275, 0.03946702553713251, 0.10885339124693669, 0.1570915703029771, 0.15805228582272926, 0.16335375655797266, 0.02532350618483698, -0.22498630189026395, -0.32519916551453726, -0.14494654698951526, -0.11614717953350573, 0.09339029475813732, -0.16098377315834764, -0.21989551312955363, 0.3482448327454871, 0.15412713409889311, 0.14392009871967493, 0.12986349394001687, 0.20103248894676135, 0.20760862888086454, -0.022260649251707253, 0.08388343911307554, 0.13905211758330033, 0.18200398614862934, 0.11926455827917726, -0.20957661466950195, 0.062345241429284215, 0.15281695623083838] |
1,802.10214 | Cluster Naturalistic Driving Encounters Using Deep Unsupervised Learning | Learning knowledge from driving encounters could help self-driving cars make
appropriate decisions when driving in complex settings with nearby vehicles
engaged. This paper develops an unsupervised classifier to group naturalistic
driving encounters into distinguishable clusters by combining an auto-encoder
with k-means clustering (AE-kMC). The effectiveness of AE-kMC was validated
using the data of 10,000 naturalistic driving encounters which were collected
by the University of Michigan, Ann Arbor in the past five years. We compare our
developed method with the $k$-means clustering methods and experimental results
demonstrate that the AE-kMC method outperforms the original k-means clustering
method.
| cs.LG | learning knowledge from driving encounters could help selfdriving cars make appropriate decisions when driving in complex settings with nearby vehicles engaged this paper develops an unsupervised classifier to group naturalistic driving encounters into distinguishable clusters by combining an autoencoder with kmeans clustering aekmc the effectiveness of aekmc was validated using the data of 10000 naturalistic driving encounters which were collected by the university of michigan ann arbor in the past five years we compare our developed method with the kmeans clustering methods and experimental results demonstrate that the aekmc method outperforms the original kmeans clustering method | [['learning', 'knowledge', 'from', 'driving', 'encounters', 'could', 'help', 'selfdriving', 'cars', 'make', 'appropriate', 'decisions', 'when', 'driving', 'in', 'complex', 'settings', 'with', 'nearby', 'vehicles', 'engaged', 'this', 'paper', 'develops', 'an', 'unsupervised', 'classifier', 'to', 'group', 'naturalistic', 'driving', 'encounters', 'into', 'distinguishable', 'clusters', 'by', 'combining', 'an', 'autoencoder', 'with', 'kmeans', 'clustering', 'aekmc', 'the', 'effectiveness', 'of', 'aekmc', 'was', 'validated', 'using', 'the', 'data', 'of', '10000', 'naturalistic', 'driving', 'encounters', 'which', 'were', 'collected', 'by', 'the', 'university', 'of', 'michigan', 'ann', 'arbor', 'in', 'the', 'past', 'five', 'years', 'we', 'compare', 'our', 'developed', 'method', 'with', 'the', 'kmeans', 'clustering', 'methods', 'and', 'experimental', 'results', 'demonstrate', 'that', 'the', 'aekmc', 'method', 'outperforms', 'the', 'original', 'kmeans', 'clustering', 'method']] | [-0.049735006852036655, 0.020370636433957163, -0.1340330482895903, 0.04871068811795946, -0.09975070079235593, -0.13077132064305866, 0.018752077707783126, 0.4310683304211125, -0.21159765938743172, -0.3723322608226833, 0.05081962467799409, -0.30522616595165647, -0.17661600769497454, 0.2225624840374015, -0.11972559874023621, 0.04432860928742836, 0.18709375000253203, 0.03256319918242904, 0.01081269246302933, -0.3293044335635689, 0.31060149336311343, 0.055391338935199506, 0.3388844523578882, -0.08987093144484486, 0.11212844778613847, 0.0301573579054093, -0.06390762720426817, -0.008054002185720796, -0.03375477979026679, 0.14977486494960127, 0.32058210795366904, 0.20545319811208174, 0.3927757988567464, -0.3957207647084336, -0.1976403020289581, 0.08335981952768634, 0.16762620209677456, 0.07726850390584634, -0.04879396205918359, -0.4366712329404739, 0.06278743848088197, -0.18878781571402214, -0.08383777848212048, -0.11249891313370124, -0.01877501939209954, 0.03473130655280935, -0.2680438592409094, 0.06782920683447931, -0.004612506631625972, 0.10246030569154148, -0.12637269249535166, -0.11429346957690238, 0.045682124601929296, 0.15544180760631812, 0.0441209663937722, 0.058534757825934015, 0.19061180913316397, -0.11395614728826331, -0.19930621571984375, 0.34742175025652006, -0.018304142514049698, -0.07545907183278662, 0.241021688998444, -0.02747478266246617, -0.15268918001675047, 0.09182740804196025, 0.2323727218026761, 0.0921376565747778, -0.1917616491538562, -0.02477117364530083, -0.02035481448911014, 0.16239494527690113, 0.07435347662734178, -0.14968191888086343, 0.10170075286017284, 0.2661478391473793, 0.009896432049572468, 0.12011902270630041, -0.13894333018106408, -0.07350149148229927, -0.1462437838393574, -0.03599021701180997, -0.20347583516074033, -0.04375194848398678, -0.11602791585013013, -0.05752725395723246, 0.341155317388863, 0.24249806411292715, 0.1965809497924056, 0.04434598768057185, 0.3673272794888665, 0.0011566430099871166, 0.07915138740342324, 0.1287178887044623, 0.22125176351012973, 0.0219096987057128, 0.1268180455857267, -0.19025179897774555, 0.056986971006457075, 0.04344503639731556] |
1,802.10215 | Var-CNN: A Data-Efficient Website Fingerprinting Attack Based on Deep
Learning | In recent years, there have been several works that use website
fingerprinting techniques to enable a local adversary to determine which
website a Tor user visits. While the current state-of-the-art attack, which
uses deep learning, outperforms prior art with medium to large amounts of data,
it attains marginal to no accuracy improvements when both use small amounts of
training data. In this work, we propose Var-CNN, a website fingerprinting
attack that leverages deep learning techniques along with novel insights
specific to packet sequence classification. In open-world settings with large
amounts of data, Var-CNN attains over $1\%$ higher true positive rate (TPR)
than state-of-the-art attacks while achieving $4\times$ lower false positive
rate (FPR). Var-CNN's improvements are especially notable in low-data
scenarios, where it reduces the FPR of prior art by $3.12\%$ while increasing
the TPR by $13\%$. Overall, insights used to develop Var-CNN can be applied to
future deep learning based attacks, and substantially reduce the amount of
training data needed to perform a successful website fingerprinting attack.
This shortens the time needed for data collection and lowers the likelihood of
having data staleness issues.
| cs.CR cs.LG | in recent years there have been several works that use website fingerprinting techniques to enable a local adversary to determine which website a tor user visits while the current stateoftheart attack which uses deep learning outperforms prior art with medium to large amounts of data it attains marginal to no accuracy improvements when both use small amounts of training data in this work we propose varcnn a website fingerprinting attack that leverages deep learning techniques along with novel insights specific to packet sequence classification in openworld settings with large amounts of data varcnn attains over 1 higher true positive rate tpr than stateoftheart attacks while achieving 4times lower false positive rate fpr varcnns improvements are especially notable in lowdata scenarios where it reduces the fpr of prior art by 312 while increasing the tpr by 13 overall insights used to develop varcnn can be applied to future deep learning based attacks and substantially reduce the amount of training data needed to perform a successful website fingerprinting attack this shortens the time needed for data collection and lowers the likelihood of having data staleness issues | [['in', 'recent', 'years', 'there', 'have', 'been', 'several', 'works', 'that', 'use', 'website', 'fingerprinting', 'techniques', 'to', 'enable', 'a', 'local', 'adversary', 'to', 'determine', 'which', 'website', 'a', 'tor', 'user', 'visits', 'while', 'the', 'current', 'stateoftheart', 'attack', 'which', 'uses', 'deep', 'learning', 'outperforms', 'prior', 'art', 'with', 'medium', 'to', 'large', 'amounts', 'of', 'data', 'it', 'attains', 'marginal', 'to', 'no', 'accuracy', 'improvements', 'when', 'both', 'use', 'small', 'amounts', 'of', 'training', 'data', 'in', 'this', 'work', 'we', 'propose', 'varcnn', 'a', 'website', 'fingerprinting', 'attack', 'that', 'leverages', 'deep', 'learning', 'techniques', 'along', 'with', 'novel', 'insights', 'specific', 'to', 'packet', 'sequence', 'classification', 'in', 'openworld', 'settings', 'with', 'large', 'amounts', 'of', 'data', 'varcnn', 'attains', 'over', '1', 'higher', 'true', 'positive', 'rate', 'tpr', 'than', 'stateoftheart', 'attacks', 'while', 'achieving', '4times', 'lower', 'false', 'positive', 'rate', 'fpr', 'varcnns', 'improvements', 'are', 'especially', 'notable', 'in', 'lowdata', 'scenarios', 'where', 'it', 'reduces', 'the', 'fpr', 'of', 'prior', 'art', 'by', '312', 'while', 'increasing', 'the', 'tpr', 'by', '13', 'overall', 'insights', 'used', 'to', 'develop', 'varcnn', 'can', 'be', 'applied', 'to', 'future', 'deep', 'learning', 'based', 'attacks', 'and', 'substantially', 'reduce', 'the', 'amount', 'of', 'training', 'data', 'needed', 'to', 'perform', 'a', 'successful', 'website', 'fingerprinting', 'attack', 'this', 'shortens', 'the', 'time', 'needed', 'for', 'data', 'collection', 'and', 'lowers', 'the', 'likelihood', 'of', 'having', 'data', 'staleness', 'issues']] | [-0.08748561275176338, -0.02006501290512073, -0.023529988296248548, 0.059083412471354575, -0.1270062575101486, -0.22705938848234264, 0.12802711305592737, 0.37346861938452297, -0.21326900041239755, -0.3735857462240739, 0.11768814291464053, -0.2892178165868861, -0.11077470870820877, 0.2308753586318242, -0.1605416804938857, 0.0935616937015572, 0.11973449402575284, 0.04476619380541512, -0.08424358079820628, -0.390631583442942, 0.280716707069895, 0.11218646604805049, 0.371387948307509, 0.04459111576217934, 0.09143892295602607, 0.00802869627588108, -0.036879707591562366, -0.03471489188062851, -0.09299680524271253, 0.15500540870033164, 0.3493789251629121, 0.25681743860789297, 0.35939245785031815, -0.4029682951275122, -0.2242650854569234, 0.12287241856878002, 0.14399509168550617, 0.15539749342149195, -0.07692827952165625, -0.2972702575934023, 0.12863549362210291, -0.205628690861364, -0.01399868437425549, -0.12832536017127802, -0.012588418394205023, 0.00505607562359738, -0.29314454498349646, 0.043645638219001984, 0.02264067261922555, 0.0705515232619122, 0.004821192277239157, -0.1458889369819761, 0.030795067197597416, 0.1481110110945422, 0.08360217426664354, 0.08414798556786295, 0.15595506470939247, -0.1670199639336944, -0.1209232824246394, 0.29347786603526016, -0.08743877034378937, -0.1315069554966513, 0.18001224578337877, -0.04033896245209938, -0.13686772867658079, 0.21321352485750542, 0.23384227372878968, 0.10247804858859201, -0.1309362816516357, 0.011958836544116785, 0.00356306291383798, 0.2194131866219591, 0.057537560050930484, 0.022373117863383817, 0.1250555305945295, 0.2201840407024214, 0.09909024200646481, 0.10800529324482679, -0.139147738412104, -0.06372241340475819, -0.1574134181859226, -0.10300984665308698, -0.16482318047678374, 0.013939909344345656, -0.08953594279973615, -0.07534479307611294, 0.3491181856825378, 0.2535344909360827, 0.20598904764065978, 0.10750373041949393, 0.3645653311682285, -0.0015439435946526098, 0.14156235674080628, 0.15203860537988728, 0.19459777341041043, -0.012945880688462265, 0.1378932318305393, -0.14793783687360462, 0.14120133713465388, -0.03405894662471122] |
1,802.10216 | Bound and continuum-embedded states of cyanopolyyne anions | Cyanopolyyne anions were among the first anions discovered in the
interstellar medium. The discovery have raised questions about routes of
formation of these anions in space. Some of the proposed mechanisms assumed
that anionic excited electronic states, either metastable or weakly bound, play
a key role in the formation process. Verification of this hypothesis requires
detailed knowledge of the electronic states of the anions. Here we investigate
bound and continuum states of four cyanopolyyne anions, CN$^-$, C$_3$N$^-$,
C$_5$N$^-$, and C$_7$N$^-$, by means of ab initio calculations. We employ the
equation-of-motion coupled-cluster method augmented with complex absorbing
potential. We predict that already in CN$^-$, the smallest anion in the family,
there are several low-lying metastable states of both singlet and triplet spin
symmetry. These states, identified as shape resonances, are located between
6.3-8.5 eV above the ground state of the anion (or 2.3-4.5 eV above the ground
state of the parent radical) and have widths of a few tenths of eV up to 1 eV.
We analyze the identified resonances in terms of leading molecular orbital
contributions and Dyson orbitals. As the carbon chain length increases in the
C$_{2n+1}$N$^-$ series, these resonances gradually become stabilized and
eventually turn into stable valence bound states. The trends in energies of the
transitions leading to both resonance and bound excited states can be
rationalized by means of the H\"{u}ckel model. Apart from valence excited
states, some of the cyanopolyynes can also support dipole bound states and
dipole stabilized resonances, owing to a large dipole moment of the parent
radicals in the lowest $^2\Sigma^+$ state. We discuss the consequences of
open-shell character of the neutral radicals on the dipole-stabilized states of
the respective anions.
| physics.chem-ph | cyanopolyyne anions were among the first anions discovered in the interstellar medium the discovery have raised questions about routes of formation of these anions in space some of the proposed mechanisms assumed that anionic excited electronic states either metastable or weakly bound play a key role in the formation process verification of this hypothesis requires detailed knowledge of the electronic states of the anions here we investigate bound and continuum states of four cyanopolyyne anions cn c_3n c_5n and c_7n by means of ab initio calculations we employ the equationofmotion coupledcluster method augmented with complex absorbing potential we predict that already in cn the smallest anion in the family there are several lowlying metastable states of both singlet and triplet spin symmetry these states identified as shape resonances are located between 6385 ev above the ground state of the anion or 2345 ev above the ground state of the parent radical and have widths of a few tenths of ev up to 1 ev we analyze the identified resonances in terms of leading molecular orbital contributions and dyson orbitals as the carbon chain length increases in the c_2n1n series these resonances gradually become stabilized and eventually turn into stable valence bound states the trends in energies of the transitions leading to both resonance and bound excited states can be rationalized by means of the huckel model apart from valence excited states some of the cyanopolyynes can also support dipole bound states and dipole stabilized resonances owing to a large dipole moment of the parent radicals in the lowest 2sigma state we discuss the consequences of openshell character of the neutral radicals on the dipolestabilized states of the respective anions | [['cyanopolyyne', 'anions', 'were', 'among', 'the', 'first', 'anions', 'discovered', 'in', 'the', 'interstellar', 'medium', 'the', 'discovery', 'have', 'raised', 'questions', 'about', 'routes', 'of', 'formation', 'of', 'these', 'anions', 'in', 'space', 'some', 'of', 'the', 'proposed', 'mechanisms', 'assumed', 'that', 'anionic', 'excited', 'electronic', 'states', 'either', 'metastable', 'or', 'weakly', 'bound', 'play', 'a', 'key', 'role', 'in', 'the', 'formation', 'process', 'verification', 'of', 'this', 'hypothesis', 'requires', 'detailed', 'knowledge', 'of', 'the', 'electronic', 'states', 'of', 'the', 'anions', 'here', 'we', 'investigate', 'bound', 'and', 'continuum', 'states', 'of', 'four', 'cyanopolyyne', 'anions', 'cn', 'c_3n', 'c_5n', 'and', 'c_7n', 'by', 'means', 'of', 'ab', 'initio', 'calculations', 'we', 'employ', 'the', 'equationofmotion', 'coupledcluster', 'method', 'augmented', 'with', 'complex', 'absorbing', 'potential', 'we', 'predict', 'that', 'already', 'in', 'cn', 'the', 'smallest', 'anion', 'in', 'the', 'family', 'there', 'are', 'several', 'lowlying', 'metastable', 'states', 'of', 'both', 'singlet', 'and', 'triplet', 'spin', 'symmetry', 'these', 'states', 'identified', 'as', 'shape', 'resonances', 'are', 'located', 'between', '6385', 'ev', 'above', 'the', 'ground', 'state', 'of', 'the', 'anion', 'or', '2345', 'ev', 'above', 'the', 'ground', 'state', 'of', 'the', 'parent', 'radical', 'and', 'have', 'widths', 'of', 'a', 'few', 'tenths', 'of', 'ev', 'up', 'to', '1', 'ev', 'we', 'analyze', 'the', 'identified', 'resonances', 'in', 'terms', 'of', 'leading', 'molecular', 'orbital', 'contributions', 'and', 'dyson', 'orbitals', 'as', 'the', 'carbon', 'chain', 'length', 'increases', 'in', 'the', 'c_2n1n', 'series', 'these', 'resonances', 'gradually', 'become', 'stabilized', 'and', 'eventually', 'turn', 'into', 'stable', 'valence', 'bound', 'states', 'the', 'trends', 'in', 'energies', 'of', 'the', 'transitions', 'leading', 'to', 'both', 'resonance', 'and', 'bound', 'excited', 'states', 'can', 'be', 'rationalized', 'by', 'means', 'of', 'the', 'huckel', 'model', 'apart', 'from', 'valence', 'excited', 'states', 'some', 'of', 'the', 'cyanopolyynes', 'can', 'also', 'support', 'dipole', 'bound', 'states', 'and', 'dipole', 'stabilized', 'resonances', 'owing', 'to', 'a', 'large', 'dipole', 'moment', 'of', 'the', 'parent', 'radicals', 'in', 'the', 'lowest', '2sigma', 'state', 'we', 'discuss', 'the', 'consequences', 'of', 'openshell', 'character', 'of', 'the', 'neutral', 'radicals', 'on', 'the', 'dipolestabilized', 'states', 'of', 'the', 'respective', 'anions']] | [-0.11347148448664757, 0.20412313150361786, -0.009316412665724864, 0.06837056556538884, 0.04327082500011565, -0.09591483224665977, 0.10621384208122044, 0.3690501811105187, -0.2317568671950785, -0.30334133720815687, 9.657767852836282e-05, -0.3193359114034237, -0.05759781514410011, 0.0689644209571509, 0.09659808278117792, -0.005316379192849472, 0.03709849604871974, 0.0037366747541733793, -0.03829090635591343, -0.17649969005919858, 0.2993216878958862, 0.0341898516979558, 0.2044793709442971, 0.1338135712307599, -0.0048400798303085335, -0.06752942582034935, 0.09432263648304001, -0.07492490268635724, -0.1323976156790507, 0.16343390890507598, 0.25963583103394694, 0.027468876664506155, 0.23451644694602566, -0.46985237212702086, -0.15479830980477652, 0.051734506669641224, 0.1710362078623683, 0.1540451456425562, -0.04507810247502881, -0.3390036356366872, 0.026959743541087548, -0.15538099562123853, -0.1753869816154432, -0.09295283841312503, 0.017234144785890124, 0.013450878480258976, -0.20658519588339475, 0.09954102519110616, 0.03145288515846197, 0.05182418385636355, -0.1527901266771199, -0.24223772226195497, -0.09815538782085952, 0.07801884789373317, 0.045469150432690564, -0.015186223225246598, 0.16082256077831258, -0.11249029393950273, -0.12331657809966727, 0.39106954267842486, -0.07753502794313687, -0.10416481927815607, 0.1914686593583982, -0.15785633839061824, -0.15051480309995668, 0.20385118386619827, 0.1106866925893637, 0.13959162617087395, -0.09318817872384115, 0.06128582216112664, -0.019718797749968885, 0.18173357139062815, 0.09607040296634999, 0.09613198040556299, 0.22135359236127594, 0.11035951065837685, 0.03887282567520211, 0.116350458737337, -0.11588051615802938, -0.11462683993126996, -0.22565400922657364, -0.17439366461064185, -0.18142113620653258, 0.027802811040017028, -0.003528564213690124, -0.1399619440840435, 0.40489891451192056, 0.06678862825414943, 0.1852106265247847, -0.06464112597945941, 0.1883680152971923, 0.08698715721545945, 0.055075379329849114, 0.04161646913305387, 0.283686095492848, 0.1711541173523326, -0.0035804447728161612, -0.2704482858101531, 0.09030933079758428, 0.03005528463098309] |
1,802.10217 | Investigating Human Priors for Playing Video Games | What makes humans so good at solving seemingly complex video games? Unlike
computers, humans bring in a great deal of prior knowledge about the world,
enabling efficient decision making. This paper investigates the role of human
priors for solving video games. Given a sample game, we conduct a series of
ablation studies to quantify the importance of various priors on human
performance. We do this by modifying the video game environment to
systematically mask different types of visual information that could be used by
humans as priors. We find that removal of some prior knowledge causes a drastic
degradation in the speed with which human players solve the game, e.g. from 2
minutes to over 20 minutes. Furthermore, our results indicate that general
priors, such as the importance of objects and visual consistency, are critical
for efficient game-play. Videos and the game manipulations are available at
https://rach0012.github.io/humanRL_website/
| cs.AI cs.LG | what makes humans so good at solving seemingly complex video games unlike computers humans bring in a great deal of prior knowledge about the world enabling efficient decision making this paper investigates the role of human priors for solving video games given a sample game we conduct a series of ablation studies to quantify the importance of various priors on human performance we do this by modifying the video game environment to systematically mask different types of visual information that could be used by humans as priors we find that removal of some prior knowledge causes a drastic degradation in the speed with which human players solve the game eg from 2 minutes to over 20 minutes furthermore our results indicate that general priors such as the importance of objects and visual consistency are critical for efficient gameplay videos and the game manipulations are available at httpsrach0012githubiohumanrl_website | [['what', 'makes', 'humans', 'so', 'good', 'at', 'solving', 'seemingly', 'complex', 'video', 'games', 'unlike', 'computers', 'humans', 'bring', 'in', 'a', 'great', 'deal', 'of', 'prior', 'knowledge', 'about', 'the', 'world', 'enabling', 'efficient', 'decision', 'making', 'this', 'paper', 'investigates', 'the', 'role', 'of', 'human', 'priors', 'for', 'solving', 'video', 'games', 'given', 'a', 'sample', 'game', 'we', 'conduct', 'a', 'series', 'of', 'ablation', 'studies', 'to', 'quantify', 'the', 'importance', 'of', 'various', 'priors', 'on', 'human', 'performance', 'we', 'do', 'this', 'by', 'modifying', 'the', 'video', 'game', 'environment', 'to', 'systematically', 'mask', 'different', 'types', 'of', 'visual', 'information', 'that', 'could', 'be', 'used', 'by', 'humans', 'as', 'priors', 'we', 'find', 'that', 'removal', 'of', 'some', 'prior', 'knowledge', 'causes', 'a', 'drastic', 'degradation', 'in', 'the', 'speed', 'with', 'which', 'human', 'players', 'solve', 'the', 'game', 'eg', 'from', '2', 'minutes', 'to', 'over', '20', 'minutes', 'furthermore', 'our', 'results', 'indicate', 'that', 'general', 'priors', 'such', 'as', 'the', 'importance', 'of', 'objects', 'and', 'visual', 'consistency', 'are', 'critical', 'for', 'efficient', 'gameplay', 'videos', 'and', 'the', 'game', 'manipulations', 'are', 'available', 'at', 'httpsrach0012githubiohumanrl_website']] | [-0.04890833405637476, 0.038260710744621, -0.10337920981293468, 0.09148871680731209, -0.1370019876742608, -0.13994578658347975, 0.07194264137827192, 0.4634261200561711, -0.2481614320366707, -0.3933808219312907, 0.08472910441525204, -0.2677947011814542, -0.20029122849339492, 0.16359293039597902, -0.18429091002166986, 0.04963678871409023, 0.14154472901750587, 0.050267952639443725, -0.009257874953917751, -0.2882952484787021, 0.3099667769601594, 0.04443577209436526, 0.2515831251041836, 0.023113455124237663, 0.10934626702410616, -0.010058716204247042, -0.07209945630743839, 0.005370096482132396, -0.1042354291691967, 0.13891104484704156, 0.3344380804241877, 0.21425675349756565, 0.38176750175476276, -0.4464484088515846, -0.23949927850371253, 0.10293034112323331, 0.13455500334773568, 0.11269366404293615, -0.044211667093244214, -0.3245977251216361, 0.08810246484242507, -0.14628722860592686, -0.022661872482412075, -0.09727951638043335, -8.810179831128415e-05, -0.022503720928136618, -0.28098802281581886, -0.0023615587987516023, 0.04861247126166135, 0.11824817059733841, -0.04266171389552828, -0.10902263451772679, 0.0478062098375394, 0.22990193461348646, 0.04822874222307989, 0.007602379921256016, 0.18487332621270358, -0.22031829393730332, -0.15225183798003405, 0.40375574807036824, -0.018291329408434462, -0.1652552419364427, 0.1975373939454734, -0.07395851258140644, -0.12404642418371387, 0.1155832845555006, 0.2005885445946598, 0.12404579809094995, -0.15678936435062796, -0.014957033028373213, -0.03013478556954085, 0.2017388181435582, 0.10699441745775203, 0.012871463764347264, 0.2087823338950155, 0.193886006129778, 0.04833953383487126, 0.10397158685373142, -0.044895927439290675, -0.1325110044451558, -0.21082801448997773, -0.11239456300215464, -0.13139632919784125, 0.0045833217860390876, -0.1316102856723512, -0.12535202786747418, 0.36127800475933575, 0.2548274662352027, 0.15368517259556852, 0.08302536957709068, 0.3187926895661305, 0.008940235053807854, 0.06666420226117711, 0.03230936724647931, 0.18585800904759098, 0.003979694611737377, 0.16190857328522362, -0.17606466354910694, 0.13456450831719152, -0.0309856045099728] |
1,802.10218 | Life Beyond PTF | In March 2017, the Intermediate Palomar Transient Factory (iPTF) ceased
operations. I take this occasion to review the scientific returns from iPTF and
its predecessor survey, the Palomar Transient Factory (PTF), and to summarize
the lessons learned. Succeeding iPTF on the Palomar Observatory 48-inch Schmidt
telescope is the Zwicky Transient Facility (ZTF), a new survey with an order of
magnitude faster survey speed that is now being commissioned. I describe the
design and scientific rationale for ZTF. ZTF is prototyping new alert stream
technologies being explored by the Large Synoptic Survey Telescope (LSST) to
distribute millions of transient alerts per night to downstream science users.
I describe the design of the alert system and discuss it in the context of the
wider LSST and community broker ecosystem.
| astro-ph.IM | in march 2017 the intermediate palomar transient factory iptf ceased operations i take this occasion to review the scientific returns from iptf and its predecessor survey the palomar transient factory ptf and to summarize the lessons learned succeeding iptf on the palomar observatory 48inch schmidt telescope is the zwicky transient facility ztf a new survey with an order of magnitude faster survey speed that is now being commissioned i describe the design and scientific rationale for ztf ztf is prototyping new alert stream technologies being explored by the large synoptic survey telescope lsst to distribute millions of transient alerts per night to downstream science users i describe the design of the alert system and discuss it in the context of the wider lsst and community broker ecosystem | [['in', 'march', '2017', 'the', 'intermediate', 'palomar', 'transient', 'factory', 'iptf', 'ceased', 'operations', 'i', 'take', 'this', 'occasion', 'to', 'review', 'the', 'scientific', 'returns', 'from', 'iptf', 'and', 'its', 'predecessor', 'survey', 'the', 'palomar', 'transient', 'factory', 'ptf', 'and', 'to', 'summarize', 'the', 'lessons', 'learned', 'succeeding', 'iptf', 'on', 'the', 'palomar', 'observatory', '48inch', 'schmidt', 'telescope', 'is', 'the', 'zwicky', 'transient', 'facility', 'ztf', 'a', 'new', 'survey', 'with', 'an', 'order', 'of', 'magnitude', 'faster', 'survey', 'speed', 'that', 'is', 'now', 'being', 'commissioned', 'i', 'describe', 'the', 'design', 'and', 'scientific', 'rationale', 'for', 'ztf', 'ztf', 'is', 'prototyping', 'new', 'alert', 'stream', 'technologies', 'being', 'explored', 'by', 'the', 'large', 'synoptic', 'survey', 'telescope', 'lsst', 'to', 'distribute', 'millions', 'of', 'transient', 'alerts', 'per', 'night', 'to', 'downstream', 'science', 'users', 'i', 'describe', 'the', 'design', 'of', 'the', 'alert', 'system', 'and', 'discuss', 'it', 'in', 'the', 'context', 'of', 'the', 'wider', 'lsst', 'and', 'community', 'broker', 'ecosystem']] | [-0.08492605667561293, 0.10547477830905838, -0.07774879619127184, 0.08092672330341999, -0.22072838314288246, -0.12097928517380745, 0.06258250117360607, 0.35085285742451827, -0.2418714744280877, -0.33996765799206263, 0.21520184975403442, -0.34827962575487675, -0.13501232371144878, 0.27970894753170294, -0.08762783993504883, -0.04329679589617748, 0.1863662912180339, -0.1013499085597078, 0.024910893285735033, -0.37466977653506134, 0.16897148192368858, 0.17905724072080897, 0.24287808186550602, -0.09179156042147779, 0.11393581169811408, -0.0050712228256761735, -0.13328696643717322, -0.0964532606927018, -0.13785928992883853, -0.01160802438077847, 0.32157276428531945, 0.31635383781647003, 0.31819295220253035, -0.35076716650776035, -0.06863090651857806, 0.0557947960245885, 0.09272336893472967, -0.0014802875715916551, -0.02315837400873727, -0.42738943613742986, 0.031193137590546073, -0.26329995624310387, -0.22862218148038377, 0.011485953147955768, 0.08669005362243634, 0.11976980317684668, -0.17000373065706312, -0.050892335289399925, -0.07005647487762406, 0.10708818050270064, -0.05997443455179757, -0.08842257233098237, 0.02514541356487009, 0.15236923760573168, -0.042989205651527904, 0.1008054371739877, 0.1177537521332737, -0.2156783570077153, -0.06811613830697437, 0.3300677904250526, -0.003067111775213046, 0.1908487709767119, 0.12740666664931483, -0.17867990511269713, -0.19632142723911977, 0.11057939706828562, 0.2575545768935497, 0.06866569938064795, -0.2285291756859405, 0.020950190610651984, 0.03532056521448329, 0.17657462220939654, 0.02567230762114499, 0.05997935634135731, 0.25113390977164424, 0.23664474859100393, 0.11717700522840316, 0.11964997327079864, -0.2602975035625268, 0.008015073703851287, -0.31127274823998374, -0.13603619652558266, -0.13747406762008973, 0.08077625902076288, 0.02757628594296453, -0.0658892001003379, 0.4201868794726457, 0.17248494825949232, 0.06009599263413157, -0.0007973573001937603, 0.30735516677221913, -0.03206599386423591, 0.13895614985303265, 0.08343979097008118, 0.30411028448770955, -0.033666925664301815, 0.29246687031475693, -0.1766020495895531, 0.05809499005105082, 0.04267350654301094] |
1,802.10219 | Mean-square convergence of a semi-discrete scheme for stochastic
nonlinear Maxwell equations | In this paper, we propose a semi-implicit Euler scheme to discretize the
stochastic nonlinear Maxwell equations with multiplicative Ito noise, which is
implicit in the drift term and explicit in the diffusion term of the equations,
in order to suited to Ito product. Uniform bounds with high regularities of
solutions for both the continuous and the discrete problems are obtained, which
are crucial properties to derive the mean-square convergence with certain
order. Allowing sufficient spatial regularity and utilizing the energy estimate
technique, the convergence order 1/2 in mean-square sense is obtained.
| math.NA | in this paper we propose a semiimplicit euler scheme to discretize the stochastic nonlinear maxwell equations with multiplicative ito noise which is implicit in the drift term and explicit in the diffusion term of the equations in order to suited to ito product uniform bounds with high regularities of solutions for both the continuous and the discrete problems are obtained which are crucial properties to derive the meansquare convergence with certain order allowing sufficient spatial regularity and utilizing the energy estimate technique the convergence order 12 in meansquare sense is obtained | [['in', 'this', 'paper', 'we', 'propose', 'a', 'semiimplicit', 'euler', 'scheme', 'to', 'discretize', 'the', 'stochastic', 'nonlinear', 'maxwell', 'equations', 'with', 'multiplicative', 'ito', 'noise', 'which', 'is', 'implicit', 'in', 'the', 'drift', 'term', 'and', 'explicit', 'in', 'the', 'diffusion', 'term', 'of', 'the', 'equations', 'in', 'order', 'to', 'suited', 'to', 'ito', 'product', 'uniform', 'bounds', 'with', 'high', 'regularities', 'of', 'solutions', 'for', 'both', 'the', 'continuous', 'and', 'the', 'discrete', 'problems', 'are', 'obtained', 'which', 'are', 'crucial', 'properties', 'to', 'derive', 'the', 'meansquare', 'convergence', 'with', 'certain', 'order', 'allowing', 'sufficient', 'spatial', 'regularity', 'and', 'utilizing', 'the', 'energy', 'estimate', 'technique', 'the', 'convergence', 'order', '12', 'in', 'meansquare', 'sense', 'is', 'obtained']] | [-0.10571205493697262, 0.04458674669756994, -0.07330810877361468, 0.07571972098718346, -0.08205804656576979, -0.10054058912031066, -0.019704048566591855, 0.34431820858147116, -0.32087754436441096, -0.2937377023403175, 0.13713776683920975, -0.21923579279957647, -0.14382110710913357, 0.13052574752134036, -0.08742581843142654, 0.13325831148028885, 0.0011856386253794472, 0.016413346741471317, -0.10471575288102031, -0.26716425830682555, 0.29918391055396787, 0.035575335865819846, 0.2548898716180862, -0.0006995771776188861, 0.20086840875344453, -0.047220402773326405, -0.05815687150551149, -0.008508461660572461, -0.184870699768538, 0.13469631735307092, 0.23903138726785944, -0.035391698111677646, 0.3080972144584898, -0.43380727443925954, -0.1893657418377288, 0.0882897035655013, 0.13918382712290622, 0.09463765179216452, -0.02227541769516992, -0.26720039745035407, 0.10056366379485353, -0.11835555544962267, -0.16001329757273197, -0.13819207229579872, -0.03547465490115868, 0.13116273147842059, -0.36515169490990995, 0.12869369513918083, 0.10587769462266466, 0.0064363554222406924, -0.10605920597803421, -0.08755790436599445, 0.030701347462996676, 0.0973416256928141, 0.06664994098041412, -0.013307916077242776, 0.02132820901409774, -0.10322776861273898, -0.06736805138132115, 0.3590280893923981, -0.13181606280888625, -0.32791723959802926, 0.16745788293921357, -0.15479525647402465, -0.0799934002570808, 0.17155217109657414, 0.1677543744803048, 0.14622095751750108, -0.19010334778167717, 0.1056485058065596, 0.028416048996355178, 0.14106021154221599, 0.06646847096527671, 0.06353782417232191, 0.02357325174815052, 0.14433681576993768, 0.14809524912161978, 0.1285811541781116, -0.0942017754481, -0.15260080090509012, -0.3562715324153612, -0.16179966026978507, -0.13241615655555666, 0.05356408285161296, -0.14168722150737936, -0.17698656459425954, 0.3374898412079307, 0.15794562577055052, 0.11229375559979907, 0.11300479707302996, 0.2764133728354924, 0.23539564665598836, -0.0025814290997664352, 0.10116245920749402, 0.1853093838134965, 0.19020794311558809, 0.1696787960315635, -0.2218456129533249, 0.08380748494272376, 0.17812080444143777] |
1,802.1022 | Irregularity-Aware Graph Fourier Transforms | In this paper, we present a novel generalization of the graph Fourier
transform (GFT). Our approach is based on separately considering the
definitions of signal energy and signal variation, leading to several possible
orthonormal GFTs. Our approach includes traditional definitions of the GFT as
special cases, while also leading to new GFT designs that are better at taking
into account the irregular nature of the graph. As an illustration, in the
context of sensor networks we use the Voronoi cell area of vertices in our GFT
definition, showing that it leads to a more sensible definition of graph signal
energy even when sampling is highly irregular.
| eess.SP | in this paper we present a novel generalization of the graph fourier transform gft our approach is based on separately considering the definitions of signal energy and signal variation leading to several possible orthonormal gfts our approach includes traditional definitions of the gft as special cases while also leading to new gft designs that are better at taking into account the irregular nature of the graph as an illustration in the context of sensor networks we use the voronoi cell area of vertices in our gft definition showing that it leads to a more sensible definition of graph signal energy even when sampling is highly irregular | [['in', 'this', 'paper', 'we', 'present', 'a', 'novel', 'generalization', 'of', 'the', 'graph', 'fourier', 'transform', 'gft', 'our', 'approach', 'is', 'based', 'on', 'separately', 'considering', 'the', 'definitions', 'of', 'signal', 'energy', 'and', 'signal', 'variation', 'leading', 'to', 'several', 'possible', 'orthonormal', 'gfts', 'our', 'approach', 'includes', 'traditional', 'definitions', 'of', 'the', 'gft', 'as', 'special', 'cases', 'while', 'also', 'leading', 'to', 'new', 'gft', 'designs', 'that', 'are', 'better', 'at', 'taking', 'into', 'account', 'the', 'irregular', 'nature', 'of', 'the', 'graph', 'as', 'an', 'illustration', 'in', 'the', 'context', 'of', 'sensor', 'networks', 'we', 'use', 'the', 'voronoi', 'cell', 'area', 'of', 'vertices', 'in', 'our', 'gft', 'definition', 'showing', 'that', 'it', 'leads', 'to', 'a', 'more', 'sensible', 'definition', 'of', 'graph', 'signal', 'energy', 'even', 'when', 'sampling', 'is', 'highly', 'irregular']] | [-0.07040846912203497, 0.04907050366496408, -0.14166091479589496, 0.06503614521132922, -0.12434353658332015, -0.08319793057294106, 0.022492421593271056, 0.3862370278264554, -0.24183648813709194, -0.295050807472951, 0.06740979379469107, -0.24306438304703543, -0.23199034413709393, 0.1821916615414732, -0.12598430843285793, 0.0033184320595607444, 0.06020406222867094, 0.0588782842991487, -0.048451706701735875, -0.23428041872294963, 0.3109800539260625, 0.06627994213464125, 0.29245015299211274, 0.02688793141069769, 0.08837152390635379, 0.033427626992804264, -0.0665196351759698, 0.050631018901443, -0.09974692704417976, 0.14225767604690395, 0.2382873169691214, 0.15204066066686414, 0.2566629514309033, -0.43705909365331225, -0.21728829804913335, 0.12498483460238378, 0.144906606245127, 0.10250167513292564, -0.020190454368893593, -0.2669615225761004, 0.056487340025410476, -0.15390122609810447, -0.06226982669641246, -0.10701261197391432, -0.003764679198557476, -0.013433789510943242, -0.2638211132571945, 0.04743986435312523, 0.09886327498363999, 0.00410097875296828, -0.021001570467081555, -0.1308747917185274, 0.027876134955253946, 0.09861297543816278, 0.007243067473129211, 0.032834579952869494, 0.08554686445804348, -0.11391481945844684, -0.1139293844056017, 0.4070605953347008, -0.018291429120098363, -0.21855397012418593, 0.14557886695849515, -0.11543261489110454, -0.16783209869479937, 0.11024848884520701, 0.17040946403131732, 0.08708781910124498, -0.15181466020527845, 0.05929225073404663, -0.028193200323379266, 0.10705595117343485, 0.08415241071181197, 0.08977498927918034, 0.16256116224312275, 0.20370498664879222, 0.10338306075010344, 0.19228443497668882, -0.08804820446552322, -0.12700578591507367, -0.32073931837946457, -0.12158395281448117, -0.20596547449394217, 0.007196983823306718, -0.1532222139164487, -0.17580204623101173, 0.45758067034536376, 0.17317468546471507, 0.17988195279525276, 0.06839308630727794, 0.3271044479718186, 0.11075018047254076, 0.08038112940706031, 0.051956308329091316, 0.1619673534691826, 0.1346199581715858, 0.08462907281431879, -0.14667254081105743, -0.015915489672103298, 0.06946421460301247] |
1,802.10221 | Single ferromagnetic fluctuations in UCoGe revealed by 73Ge- and
59Co-NMR studies | $^{73}$Ge and $^{59}$Co nuclear magnetic resonance (NMR) and nuclear
quadrupole resonance (NQR) measurements have been performed on a
$^{73}$Ge-enriched single-crystalline sample of the ferromagnetic
superconductor UCoGe in the paramagnetic state. The $^{73}$Ge NQR parameters
deduced from NQR and NMR are close to those of another isostructural
ferromagnetic superconductor URhGe. The Knight shifts of the Ge and Co sites
are well scaled to each other when the magnetic field is parallel to the $b$ or
$c$ axis. The hyperfine coupling constants of Ge are estimated to be close to
those of Co. The large difference of spin susceptibilities between the $a$ and
$b$ axes could lead to the different response of the superconductivity and
ferromagnetism with the field parallel to these directions. The temperature
dependence of the nuclear spin-lattice relaxation rates $1/T_1$ at the two
sites is similar to each other above 5 K. These results indicate that the
itinerant U-$5f$ electrons are responsible for the ferromagnetism in this
compound, consistent with previous studies. The similarities and differences in
the three ferromagnetic superconductors are discussed.
| cond-mat.str-el cond-mat.supr-con | 73ge and 59co nuclear magnetic resonance nmr and nuclear quadrupole resonance nqr measurements have been performed on a 73geenriched singlecrystalline sample of the ferromagnetic superconductor ucoge in the paramagnetic state the 73ge nqr parameters deduced from nqr and nmr are close to those of another isostructural ferromagnetic superconductor urhge the knight shifts of the ge and co sites are well scaled to each other when the magnetic field is parallel to the b or c axis the hyperfine coupling constants of ge are estimated to be close to those of co the large difference of spin susceptibilities between the a and b axes could lead to the different response of the superconductivity and ferromagnetism with the field parallel to these directions the temperature dependence of the nuclear spinlattice relaxation rates 1t_1 at the two sites is similar to each other above 5 k these results indicate that the itinerant u5f electrons are responsible for the ferromagnetism in this compound consistent with previous studies the similarities and differences in the three ferromagnetic superconductors are discussed | [['73ge', 'and', '59co', 'nuclear', 'magnetic', 'resonance', 'nmr', 'and', 'nuclear', 'quadrupole', 'resonance', 'nqr', 'measurements', 'have', 'been', 'performed', 'on', 'a', '73geenriched', 'singlecrystalline', 'sample', 'of', 'the', 'ferromagnetic', 'superconductor', 'ucoge', 'in', 'the', 'paramagnetic', 'state', 'the', '73ge', 'nqr', 'parameters', 'deduced', 'from', 'nqr', 'and', 'nmr', 'are', 'close', 'to', 'those', 'of', 'another', 'isostructural', 'ferromagnetic', 'superconductor', 'urhge', 'the', 'knight', 'shifts', 'of', 'the', 'ge', 'and', 'co', 'sites', 'are', 'well', 'scaled', 'to', 'each', 'other', 'when', 'the', 'magnetic', 'field', 'is', 'parallel', 'to', 'the', 'b', 'or', 'c', 'axis', 'the', 'hyperfine', 'coupling', 'constants', 'of', 'ge', 'are', 'estimated', 'to', 'be', 'close', 'to', 'those', 'of', 'co', 'the', 'large', 'difference', 'of', 'spin', 'susceptibilities', 'between', 'the', 'a', 'and', 'b', 'axes', 'could', 'lead', 'to', 'the', 'different', 'response', 'of', 'the', 'superconductivity', 'and', 'ferromagnetism', 'with', 'the', 'field', 'parallel', 'to', 'these', 'directions', 'the', 'temperature', 'dependence', 'of', 'the', 'nuclear', 'spinlattice', 'relaxation', 'rates', '1t_1', 'at', 'the', 'two', 'sites', 'is', 'similar', 'to', 'each', 'other', 'above', '5', 'k', 'these', 'results', 'indicate', 'that', 'the', 'itinerant', 'u5f', 'electrons', 'are', 'responsible', 'for', 'the', 'ferromagnetism', 'in', 'this', 'compound', 'consistent', 'with', 'previous', 'studies', 'the', 'similarities', 'and', 'differences', 'in', 'the', 'three', 'ferromagnetic', 'superconductors', 'are', 'discussed']] | [-0.14299681415576812, 0.22535418786345363, 0.012234150106356496, 0.030540916334563125, -0.0520969558550271, -0.1529174120894854, 0.05367515174768908, 0.41458972329219984, -0.23539577273791926, -0.2772140934460425, -0.011378776755135486, -0.3827844379480519, 0.005285142642322045, 0.19659900735132396, 0.1206281714012168, -0.004285964135059043, -0.05732829754195052, 0.04728111237922759, -0.14765473628938844, -0.23704392283971856, 0.2799002580718821, -0.003417697067593219, 0.29940046319425795, 0.08705082492945942, -0.021554609791596416, -0.04988919496213253, 0.15485147440892166, 0.009290655095108671, -0.14912869579265886, 0.0535250421641381, 0.2913309974929673, -0.07489374323446583, 0.14232550615800083, -0.4056410059072343, -0.1474534744972826, 0.025282330881007488, 0.10981207482269131, 0.14597911052836504, -0.05268141552011854, -0.3045635448669143, 0.0627238800738416, -0.0802346483025043, -0.07076199619958144, -0.10539344382187017, -0.03591188424902112, 0.05012759724039735, -0.28975851065075464, 0.13136539512012435, 0.09030038462830653, 0.15492070477046718, -0.15391658722406867, -0.23753560976679786, -0.0173829463512416, 0.052949479687723434, 0.11608599549202475, 0.11591645598013191, 0.1881535770842601, -0.024534472548322094, -0.12105978951880957, 0.3150413826523844, -0.038540785289719444, -0.04029602996703517, 0.18230640040064564, -0.2640187450485422, -0.11823158138943028, 0.15632115290204138, 0.09470457383404578, 0.07630752814621422, -0.15295541301987745, 0.04923352384650434, 0.0020816786742279296, 0.17624682440143885, 0.008240536987819208, 0.051478487552504316, 0.24023700481808255, 0.14053679772684985, -0.01600495016207714, 0.10226903443569263, -0.16559607924952716, -0.042111110071398616, -0.19445411265542398, -0.1445007515112961, -0.21234408939914035, 0.045569883913846115, -0.08487780507853472, -0.1139672877471571, 0.36903661343328265, 0.11173923147002483, 0.21909012585189303, -0.1118164819266884, 0.2276856970860262, 0.054923842504292164, 0.10261623859351685, 0.0368571444670266, 0.2867968209098615, 0.25878325717878997, 0.13659148304211782, -0.38088625972428375, 0.10241976685585141, -0.041252977140059405] |
1,802.10222 | Assignment of multiband luminescence due to the gallium vacancy-oxygen
defect complex in GaN | Oxygen is the most common unintentional impurity found in GaN. We study the
interaction between substitutional oxygen (ON) and the gallium vacancy (VGa) to
form a point defect complex in GaN. The formation energy of the gallium vacancy
is largely reduced in n-type GaN by complexing with oxygen, while thermodynamic
and optical transition levels remain within the band gap. We study the
spectroscopy of this complex using a hybrid quantum-mechanical
molecular-mechanical (QM/MM) embedded-crystal approach. We reveal how a single
defect center can be responsible for multiband luminescence, including the
ubiquitous yellow luminescence signature observed in n-type GaN, owing to the
coexistence of diffuse (extended) and compact (localized) holes.
| cond-mat.mtrl-sci | oxygen is the most common unintentional impurity found in gan we study the interaction between substitutional oxygen on and the gallium vacancy vga to form a point defect complex in gan the formation energy of the gallium vacancy is largely reduced in ntype gan by complexing with oxygen while thermodynamic and optical transition levels remain within the band gap we study the spectroscopy of this complex using a hybrid quantummechanical molecularmechanical qmmm embeddedcrystal approach we reveal how a single defect center can be responsible for multiband luminescence including the ubiquitous yellow luminescence signature observed in ntype gan owing to the coexistence of diffuse extended and compact localized holes | [['oxygen', 'is', 'the', 'most', 'common', 'unintentional', 'impurity', 'found', 'in', 'gan', 'we', 'study', 'the', 'interaction', 'between', 'substitutional', 'oxygen', 'on', 'and', 'the', 'gallium', 'vacancy', 'vga', 'to', 'form', 'a', 'point', 'defect', 'complex', 'in', 'gan', 'the', 'formation', 'energy', 'of', 'the', 'gallium', 'vacancy', 'is', 'largely', 'reduced', 'in', 'ntype', 'gan', 'by', 'complexing', 'with', 'oxygen', 'while', 'thermodynamic', 'and', 'optical', 'transition', 'levels', 'remain', 'within', 'the', 'band', 'gap', 'we', 'study', 'the', 'spectroscopy', 'of', 'this', 'complex', 'using', 'a', 'hybrid', 'quantummechanical', 'molecularmechanical', 'qmmm', 'embeddedcrystal', 'approach', 'we', 'reveal', 'how', 'a', 'single', 'defect', 'center', 'can', 'be', 'responsible', 'for', 'multiband', 'luminescence', 'including', 'the', 'ubiquitous', 'yellow', 'luminescence', 'signature', 'observed', 'in', 'ntype', 'gan', 'owing', 'to', 'the', 'coexistence', 'of', 'diffuse', 'extended', 'and', 'compact', 'localized', 'holes']] | [-0.035637237923654995, 0.12369480918957983, 0.0035249951782975798, 0.06396166215869424, 0.048809684038371125, -0.14480461455690108, 0.10346389697237968, 0.48014800962513293, -0.24272119555574467, -0.304203301859654, -0.019057858613467663, -0.3276036196849614, -0.14779973430036802, 0.09642916882985106, -0.026352513670729837, -0.035133425750177805, 0.00455549253786209, -0.074954584652175, -0.06275037423681433, -0.1738493320921509, 0.2945755637276953, 0.06677675980935309, 0.33598872778989447, 0.11011116572538233, -0.021454916883991145, -0.006942807920886395, 0.11355969816376672, -0.012402044548261389, -0.08387055620115912, 0.15898075090529762, 0.30029965329438746, -0.062361579645146555, 0.22413762691909464, -0.4726860485448737, -0.2452085089530343, 0.024654893963989392, 0.1474679009466667, 0.16757994237199217, -0.16532684202527922, -0.2733574394902615, 0.07645105801862186, -0.080811220299557, -0.10005608588787858, -0.007975078727527757, -0.05254124639399141, -0.025584211577900695, -0.2038434192790676, 0.11633670780476983, 0.014893891781603342, 0.04840841765424931, -0.14883937375841957, -0.10057382739941094, -0.13764109817947148, 0.04264398100655352, -0.012109662425730413, 0.011373706770436316, 0.21576163529148587, -0.06107747242960069, -0.09173005145842401, 0.3960396571467831, -0.06383454015426268, -0.05895834760936238, 0.1851048500616556, -0.16849262692103875, -0.0925480198184742, 0.1873074794692971, 0.10449855111835298, 0.14740290994120536, -0.17314093511836673, 0.08398408996796444, 0.039024287721612184, 0.1717570934231963, 0.05784118147871553, 0.10698031954397665, 0.24287912503720444, 0.23732208935805013, 0.024132492856305338, 0.12144655042227845, -0.15723519349388046, -0.04939659262319731, -0.16481425895172858, -0.21411345145451863, -0.19423798297066242, 0.10857004047998131, -0.07697386075223026, -0.20622555026349343, 0.3892914729571475, 0.08777819823682587, 0.1776911905296495, -0.12242567669991926, 0.19953098279282164, 0.08712728105303337, 0.09136909208582522, 0.02247142886621094, 0.24200496368249444, 0.13692444403847315, 0.07771571032554955, -0.31884937458802187, 0.07996298872787401, -0.02771289284541228] |
1,802.10223 | The origin of the Moon within a terrestrial synestia | The giant impact hypothesis remains the leading theory for lunar origin.
However, current models struggle to explain the Moon's composition and isotopic
similarity with Earth. Here we present a new lunar origin model. High-energy,
high-angular momentum giant impacts can create a post-impact structure that
exceeds the corotation limit (CoRoL), which defines the hottest thermal state
and angular momentum possible for a corotating body. In a typical super-CoRoL
body, traditional definitions of mantle, atmosphere and disk are not
appropriate, and the body forms a new type of planetary structure, named a
synestia. Using simulations of cooling synestias combined with dynamic,
thermodynamic and geochemical calculations, we show that satellite formation
from a synestia can produce the main features of our Moon. We find that cooling
drives mixing of the structure, and condensation generates moonlets that orbit
within the synestia, surrounded by tens of bars of bulk silicate Earth (BSE)
vapor. The moonlets and growing moon are heated by the vapor until the first
major element (Si) begins to vaporize and buffer the temperature. Moonlets
equilibrate with BSE vapor at the temperature of silicate vaporization and the
pressure of the structure, establishing the lunar isotopic composition and
pattern of moderately volatile elements. Eventually, the cooling synestia
recedes within the lunar orbit, terminating the main stage of lunar accretion.
Our model shifts the paradigm for lunar origin from specifying a certain impact
scenario to achieving a Moon-forming synestia. Giant impacts that produce
potential Moon-forming synestias were common at the end of terrestrial planet
formation.
| astro-ph.EP | the giant impact hypothesis remains the leading theory for lunar origin however current models struggle to explain the moons composition and isotopic similarity with earth here we present a new lunar origin model highenergy highangular momentum giant impacts can create a postimpact structure that exceeds the corotation limit corol which defines the hottest thermal state and angular momentum possible for a corotating body in a typical supercorol body traditional definitions of mantle atmosphere and disk are not appropriate and the body forms a new type of planetary structure named a synestia using simulations of cooling synestias combined with dynamic thermodynamic and geochemical calculations we show that satellite formation from a synestia can produce the main features of our moon we find that cooling drives mixing of the structure and condensation generates moonlets that orbit within the synestia surrounded by tens of bars of bulk silicate earth bse vapor the moonlets and growing moon are heated by the vapor until the first major element si begins to vaporize and buffer the temperature moonlets equilibrate with bse vapor at the temperature of silicate vaporization and the pressure of the structure establishing the lunar isotopic composition and pattern of moderately volatile elements eventually the cooling synestia recedes within the lunar orbit terminating the main stage of lunar accretion our model shifts the paradigm for lunar origin from specifying a certain impact scenario to achieving a moonforming synestia giant impacts that produce potential moonforming synestias were common at the end of terrestrial planet formation | [['the', 'giant', 'impact', 'hypothesis', 'remains', 'the', 'leading', 'theory', 'for', 'lunar', 'origin', 'however', 'current', 'models', 'struggle', 'to', 'explain', 'the', 'moons', 'composition', 'and', 'isotopic', 'similarity', 'with', 'earth', 'here', 'we', 'present', 'a', 'new', 'lunar', 'origin', 'model', 'highenergy', 'highangular', 'momentum', 'giant', 'impacts', 'can', 'create', 'a', 'postimpact', 'structure', 'that', 'exceeds', 'the', 'corotation', 'limit', 'corol', 'which', 'defines', 'the', 'hottest', 'thermal', 'state', 'and', 'angular', 'momentum', 'possible', 'for', 'a', 'corotating', 'body', 'in', 'a', 'typical', 'supercorol', 'body', 'traditional', 'definitions', 'of', 'mantle', 'atmosphere', 'and', 'disk', 'are', 'not', 'appropriate', 'and', 'the', 'body', 'forms', 'a', 'new', 'type', 'of', 'planetary', 'structure', 'named', 'a', 'synestia', 'using', 'simulations', 'of', 'cooling', 'synestias', 'combined', 'with', 'dynamic', 'thermodynamic', 'and', 'geochemical', 'calculations', 'we', 'show', 'that', 'satellite', 'formation', 'from', 'a', 'synestia', 'can', 'produce', 'the', 'main', 'features', 'of', 'our', 'moon', 'we', 'find', 'that', 'cooling', 'drives', 'mixing', 'of', 'the', 'structure', 'and', 'condensation', 'generates', 'moonlets', 'that', 'orbit', 'within', 'the', 'synestia', 'surrounded', 'by', 'tens', 'of', 'bars', 'of', 'bulk', 'silicate', 'earth', 'bse', 'vapor', 'the', 'moonlets', 'and', 'growing', 'moon', 'are', 'heated', 'by', 'the', 'vapor', 'until', 'the', 'first', 'major', 'element', 'si', 'begins', 'to', 'vaporize', 'and', 'buffer', 'the', 'temperature', 'moonlets', 'equilibrate', 'with', 'bse', 'vapor', 'at', 'the', 'temperature', 'of', 'silicate', 'vaporization', 'and', 'the', 'pressure', 'of', 'the', 'structure', 'establishing', 'the', 'lunar', 'isotopic', 'composition', 'and', 'pattern', 'of', 'moderately', 'volatile', 'elements', 'eventually', 'the', 'cooling', 'synestia', 'recedes', 'within', 'the', 'lunar', 'orbit', 'terminating', 'the', 'main', 'stage', 'of', 'lunar', 'accretion', 'our', 'model', 'shifts', 'the', 'paradigm', 'for', 'lunar', 'origin', 'from', 'specifying', 'a', 'certain', 'impact', 'scenario', 'to', 'achieving', 'a', 'moonforming', 'synestia', 'giant', 'impacts', 'that', 'produce', 'potential', 'moonforming', 'synestias', 'were', 'common', 'at', 'the', 'end', 'of', 'terrestrial', 'planet', 'formation']] | [-0.09334454631028943, 0.20795553347402548, -0.09486062654521293, 0.024280645532989836, -0.05787317618263893, -0.025087247787784022, 0.05803412948239475, 0.3296585227875927, -0.2521114847061774, -0.30687724264856636, 0.07498462339367598, -0.27497010081856843, -0.10349838939368217, 0.14994574223278487, -0.040312302703726065, -0.005258381893637639, 0.10031843049653683, -0.035530208912958584, -0.06470354909477494, -0.1855228023311819, 0.2891579118910728, 0.1154588704010524, 0.12764507303216371, 0.0628340275110546, 0.05947400503777843, -0.11137850108990319, 0.024098697722511716, -0.05828364964305277, -0.16666294304548457, 0.07082862911622477, 0.18218588045991158, 0.117619956203972, 0.1950413902256503, -0.47873960838238916, -0.24703951239497982, 0.031987733516213764, 0.10875188301496926, 0.06120783583696812, -0.09619236517235652, -0.231474419965981, 0.04909381710075171, -0.23068387681491165, -0.19816936956284695, 0.01507890440830325, 0.046785175418817854, -0.003043282040709024, -0.24098443219636428, 0.06505712615251241, 0.09004348355352909, 0.08405014372546572, -0.14069465617415491, -0.13878122587916422, -0.0913695816650059, 0.11012007391134494, 0.03552029556295569, -0.0119103145417215, 0.23961830065126558, -0.05896903082249634, -0.0008207266293765312, 0.42689623452543496, -0.10232353772515483, -0.02133250581175388, 0.24738467675652429, -0.21194566733177647, -0.09926625891274447, 0.18288244634313158, 0.16331133819404936, 0.08572087064946451, -0.1334741278469701, 0.015348265131273452, -0.01807760116812515, 0.17863856695020144, 0.12580364755070564, 0.005470235238270647, 0.37747785164020864, 0.20106289124005963, 0.028353845435998826, 0.0817444532039953, -0.17844609602777114, -0.10722859018275618, -0.19965660609454516, -0.14028829682981184, -0.13438304518181157, 0.029691006350632567, -0.08875657040679577, -0.17294733999783254, 0.3269161947640071, 0.14735816851497655, 0.17744482843669124, -0.0051341721120413885, 0.3186636494293091, 0.03359862311414058, 0.0943019627836574, 0.10094747748169823, 0.2857085337355568, 0.11647199433933697, 0.09797284572785459, -0.2740465599618549, 0.15569064183165687, 0.037653635022226704] |
1,802.10224 | Translucent windows: How uncertainty in competitive interactions impacts
detection of community pattern | Trait variation and similarity among coexisting species can provide a window
into the mechanisms that maintain their coexistence. Recent theoretical
explorations suggest that competitive interactions will lead to groups, or
clusters, of species with similar traits. However, theoretical predictions
typically assume complete knowledge of the map between competition and measured
traits. These assumptions limit the plausible application of these patterns for
inferring competitive interactions in nature. Here we relax these restrictions
and find that the clustering pattern is robust to contributions of unknown or
unobserved niche axes. However, it may not be visible unless measured traits
are close proxies for niche strategies. We conclude that patterns along single
niche axes may reveal properties of interspecific competition in nature, but
detecting these patterns requires natural history expertise firmly tying traits
to niches.
| q-bio.PE | trait variation and similarity among coexisting species can provide a window into the mechanisms that maintain their coexistence recent theoretical explorations suggest that competitive interactions will lead to groups or clusters of species with similar traits however theoretical predictions typically assume complete knowledge of the map between competition and measured traits these assumptions limit the plausible application of these patterns for inferring competitive interactions in nature here we relax these restrictions and find that the clustering pattern is robust to contributions of unknown or unobserved niche axes however it may not be visible unless measured traits are close proxies for niche strategies we conclude that patterns along single niche axes may reveal properties of interspecific competition in nature but detecting these patterns requires natural history expertise firmly tying traits to niches | [['trait', 'variation', 'and', 'similarity', 'among', 'coexisting', 'species', 'can', 'provide', 'a', 'window', 'into', 'the', 'mechanisms', 'that', 'maintain', 'their', 'coexistence', 'recent', 'theoretical', 'explorations', 'suggest', 'that', 'competitive', 'interactions', 'will', 'lead', 'to', 'groups', 'or', 'clusters', 'of', 'species', 'with', 'similar', 'traits', 'however', 'theoretical', 'predictions', 'typically', 'assume', 'complete', 'knowledge', 'of', 'the', 'map', 'between', 'competition', 'and', 'measured', 'traits', 'these', 'assumptions', 'limit', 'the', 'plausible', 'application', 'of', 'these', 'patterns', 'for', 'inferring', 'competitive', 'interactions', 'in', 'nature', 'here', 'we', 'relax', 'these', 'restrictions', 'and', 'find', 'that', 'the', 'clustering', 'pattern', 'is', 'robust', 'to', 'contributions', 'of', 'unknown', 'or', 'unobserved', 'niche', 'axes', 'however', 'it', 'may', 'not', 'be', 'visible', 'unless', 'measured', 'traits', 'are', 'close', 'proxies', 'for', 'niche', 'strategies', 'we', 'conclude', 'that', 'patterns', 'along', 'single', 'niche', 'axes', 'may', 'reveal', 'properties', 'of', 'interspecific', 'competition', 'in', 'nature', 'but', 'detecting', 'these', 'patterns', 'requires', 'natural', 'history', 'expertise', 'firmly', 'tying', 'traits', 'to', 'niches']] | [-0.11953744538775325, 0.1625558131424184, -0.09829231703259364, 0.12405421089768438, -0.1277717627951065, -0.1629047392625788, 0.1001360819902527, 0.4290617548270535, -0.2907215392089072, -0.3508814100943904, 0.04922301137201374, -0.27612445290193305, -0.17312995327693473, 0.1169677522950557, -0.04999097305854768, -0.05844016966075843, 0.09540216615139187, -0.03698064426279214, 0.0014292692751374863, -0.2205833855081409, 0.29124936291891085, 0.022967088100223142, 0.30638558750630907, 0.04888920649665742, 0.05717255608427502, -0.0642658345443943, -0.05111935564835791, 0.01400536879584307, -0.11423106786358625, 0.1198985338098199, 0.3005082655186189, 0.17451830181997013, 0.25032192978737805, -0.4458710641266053, -0.2412028948328536, 0.1439163617270764, 0.1823084776215113, 0.08570390661026685, -0.04433286974903281, -0.26740583286172787, 0.048492184288725114, -0.09289818071539847, -0.12199205804379827, -0.1212931877172744, 0.038253306414761386, 0.044124091955840244, -0.24958313684839442, 0.12391997129080519, 0.05147142565226225, 0.0898684949279969, -0.08173775677355931, -0.14479864040347, -0.04558372516398325, 0.21279859258117909, 0.10156789392886953, -0.042719256107958445, 0.1421153321293474, -0.14152682943354922, -0.13908309826115503, 0.37386986648464815, -0.01736987814420962, -0.1760936576290099, 0.3015113029031808, -0.15881782190746252, -0.19342365903239556, 0.09301975928602442, 0.16181658110261418, 0.05451656069330167, -0.16794420178368233, -0.021977837323228906, -0.00819227448309139, 0.21792033256497234, 0.049332951056906056, 0.08277750353663023, 0.29139839223841957, 0.15744220045793317, 0.04704325147797816, 0.030371721575342348, -0.028323367508199377, -0.1214670914026219, -0.1806926991762096, -0.0724626814107631, -0.08998350273204153, -0.020041602109056783, -0.09074296178049604, -0.15099257851936607, 0.354015230965438, 0.17980785200013316, 0.21589612571579467, 0.037823080318048596, 0.2403949440691535, -0.002637139187400578, 0.08331211461003102, -0.01417073069268283, 0.23048239705314547, 0.06265053861838488, 0.030335465545645198, -0.1891395851564487, 0.24028475452232254, -0.057701300161371705] |
1,802.10225 | Central moment inequalities using Stein's method | We derive explicit central moment inequalities for random variables that
admit a Stein coupling, such as exchangeable pairs, size--bias couplings or
local dependence, among others. The bounds are in terms of moments (not
necessarily central) of variables in the Stein coupling, which are typically
local in some sense, and therefore easier to bound. In cases where the Stein
couplings have the kind of behaviour leading to good normal approximation, the
central moments are closely bounded by those of a normal. We show how the
bounds can be used to produce concentration inequalities, and compare them to
those existing in related settings. Finally, we illustrate the power of the
theory by bounding the central moments of sums of neighbourhood statistics in
sparse Erd\H{o}s--R\'enyi random graphs.
| math.PR | we derive explicit central moment inequalities for random variables that admit a stein coupling such as exchangeable pairs sizebias couplings or local dependence among others the bounds are in terms of moments not necessarily central of variables in the stein coupling which are typically local in some sense and therefore easier to bound in cases where the stein couplings have the kind of behaviour leading to good normal approximation the central moments are closely bounded by those of a normal we show how the bounds can be used to produce concentration inequalities and compare them to those existing in related settings finally we illustrate the power of the theory by bounding the central moments of sums of neighbourhood statistics in sparse erdhosrenyi random graphs | [['we', 'derive', 'explicit', 'central', 'moment', 'inequalities', 'for', 'random', 'variables', 'that', 'admit', 'a', 'stein', 'coupling', 'such', 'as', 'exchangeable', 'pairs', 'sizebias', 'couplings', 'or', 'local', 'dependence', 'among', 'others', 'the', 'bounds', 'are', 'in', 'terms', 'of', 'moments', 'not', 'necessarily', 'central', 'of', 'variables', 'in', 'the', 'stein', 'coupling', 'which', 'are', 'typically', 'local', 'in', 'some', 'sense', 'and', 'therefore', 'easier', 'to', 'bound', 'in', 'cases', 'where', 'the', 'stein', 'couplings', 'have', 'the', 'kind', 'of', 'behaviour', 'leading', 'to', 'good', 'normal', 'approximation', 'the', 'central', 'moments', 'are', 'closely', 'bounded', 'by', 'those', 'of', 'a', 'normal', 'we', 'show', 'how', 'the', 'bounds', 'can', 'be', 'used', 'to', 'produce', 'concentration', 'inequalities', 'and', 'compare', 'them', 'to', 'those', 'existing', 'in', 'related', 'settings', 'finally', 'we', 'illustrate', 'the', 'power', 'of', 'the', 'theory', 'by', 'bounding', 'the', 'central', 'moments', 'of', 'sums', 'of', 'neighbourhood', 'statistics', 'in', 'sparse', 'erdhosrenyi', 'random', 'graphs']] | [-0.09357544115459125, 0.1194430135055295, -0.06290767079061028, 0.13220338157618478, -0.07641128200902453, -0.11848754444039397, 0.04789130460807017, 0.3365639633904662, -0.2630668675222795, -0.30420320225699293, 0.08839955991096494, -0.2933584200706513, -0.13289000063330955, 0.18216891785062128, -0.0820328954197917, 0.025838513543168382, -0.0005858914847786148, 0.08795684011983534, -0.07330235386184687, -0.28534062568759244, 0.3135849534376194, -0.01756372981734814, 0.24227895001850783, 0.027640365037856805, 0.014823418380993028, -0.017096112294483087, -0.011495747712380704, 0.04467538909456116, -0.13550333175912638, 0.15358224782657118, 0.27555422833369625, 0.06382446146885594, 0.2393912752534473, -0.43222666544569355, -0.13966399812770466, 0.17591795974200772, 0.13805733850571297, 0.057400610882811426, -0.026083876821024705, -0.2789755169933121, 0.0672827603984549, -0.1261666852965831, -0.14256490956177004, -0.1467073964961474, -0.00827816255661028, 0.14771251303083713, -0.3272591607096875, 0.1277830458411406, 0.1259152787407079, 0.007780056809180326, 0.020647085147849735, -0.14199425840202057, 0.017420178271769997, 0.12408890135984327, 0.05190708266661292, -0.020336307491356086, 0.10381182896549769, -0.12752990209405507, -0.12643902323437825, 0.30873877259211674, -0.060879529175449976, -0.25255787251291856, 0.18564894788282654, -0.19258379188155936, -0.17380543008461716, 0.07366154093535678, 0.17098544028422405, 0.1315527351102754, -0.16379145725870564, 0.11564157815601286, -0.057064719807972474, 0.07636112164736035, 0.07331692323374052, 0.058100138892299466, 0.14522461881560664, 0.031592018076128534, 0.11254877220903102, 0.13750745913280443, -0.03918625202781949, -0.1465073506528091, -0.3026836198949886, -0.11458627622144582, -0.19622170504543088, 0.048211359781435606, -0.1597844921763622, -0.17646460715613718, 0.35166987629547236, 0.12366527764900256, 0.22446717985064513, 0.08524464853267531, 0.22050123977204483, 0.12014915117329257, 0.05646838089676514, 0.09164474422540216, 0.23291153673785775, 0.20831709392293687, 0.01374736376624975, -0.13193871344875305, 0.12219806448481377, 0.1157584571914002] |
1,802.10226 | The existence of geodesics in Wasserstein spaces over path groups and
loop groups | In this work we prove the existence and uniqueness of the optimal transport
map for $L^p$-Wasserstein distance with $p>1$, and particularly present an
explicit expression of the optimal transport map for the case $p=2$. As an
application, we show the existence of geodesics connecting probability measures
satisfying suitable condition on path groups and loop groups.
| math.PR | in this work we prove the existence and uniqueness of the optimal transport map for lpwasserstein distance with p1 and particularly present an explicit expression of the optimal transport map for the case p2 as an application we show the existence of geodesics connecting probability measures satisfying suitable condition on path groups and loop groups | [['in', 'this', 'work', 'we', 'prove', 'the', 'existence', 'and', 'uniqueness', 'of', 'the', 'optimal', 'transport', 'map', 'for', 'lpwasserstein', 'distance', 'with', 'p1', 'and', 'particularly', 'present', 'an', 'explicit', 'expression', 'of', 'the', 'optimal', 'transport', 'map', 'for', 'the', 'case', 'p2', 'as', 'an', 'application', 'we', 'show', 'the', 'existence', 'of', 'geodesics', 'connecting', 'probability', 'measures', 'satisfying', 'suitable', 'condition', 'on', 'path', 'groups', 'and', 'loop', 'groups']] | [-0.20568052953617139, 0.023149028018815444, -0.08630402716384693, 0.08707184702454304, -0.023253298398445952, -0.11940935088152235, 0.06096855382096361, 0.37833538604053585, -0.3010072367689149, -0.21940871190957048, 0.12582309258551422, -0.2530462401326407, -0.1662914670326493, 0.22941663681783458, -0.06969673848626289, 0.06015496941452676, 0.05966673202135346, 0.08521260809661313, -0.07058606233278458, -0.1866518467326056, 0.39153600362214175, 0.022985138490118764, 0.2733290714465759, 0.08591616067358039, 0.14873743622817776, 0.0521068455228074, 0.019132116843353617, -0.008721349117430773, -0.23996254537593234, 0.13758546762295407, 0.21502505308863792, 0.09468177777545696, 0.21243676367131145, -0.37403167933225634, -0.17838090561668982, 0.17253640314394778, 0.13271200477399608, 0.05398437771946192, -0.08993037488438528, -0.24761661504056642, 0.08502123960378495, -0.08882969398559494, -0.18342342488467694, -0.06019331052560698, 0.050474710660901936, 0.05488763905384324, -0.28996019746092233, 0.06968187705021013, 0.07272169185294346, 0.08503907241604546, -0.1416775292293592, -0.06857502877034924, 0.0051711602983149614, 0.19763214733790269, 0.04453653794797984, 0.024531990022991192, 0.06270312734625556, -0.09185573698698797, -0.11527807553383437, 0.327142607183619, -0.05926489662379027, -0.23251803126186132, 0.13435846851630645, -0.12924526757137342, -0.15955565270375122, 0.06141924068162387, 0.10966476947069168, 0.1813914676281539, -0.11771346941928972, 0.1274526943590238, -0.08587938127192583, 0.06756604767658493, 0.1128619799729098, 0.03739120824770494, 0.10467037947978083, 0.10275169309567321, 0.22487732776631178, 0.17297904060476205, -0.05625850044783543, -0.06041907663033767, -0.3951248519799926, -0.2311669749123129, -0.09980288638987324, 0.09890585067597303, -0.11687415434306868, -0.16447538436305795, 0.33690282209691674, 0.1227690568532456, 0.1879145220938054, 0.15756335935809396, 0.2146278977394104, 0.12365004931449551, -0.05727859630926766, 0.12434537719765848, 0.1513381376015869, 0.15656917677684265, 0.018341079261153935, -0.21611256094818765, 0.03226863961158828, 0.14907386179336093] |
1,802.10227 | Painlev\'e analysis of Ricci solitons over warped products | We carry out a Painlev\'e analysis to find the cases where the cohomogeneity
one steady Ricci soliton equation can be integrable. We concentrate on two
classes of solitons: warped products and complex line bundles over a Fano
K\"ahler Einstein base. For warped products, the analysis singles out the case
with one factor where the dimension of the hypersurface is a perfect square,
with the $n=4$ particularly distinguished. The case with two factors each of
dimension $2$ is also singled out by the analysis. In the case of complex line
bundles, a 1-parameter family is singled out for every even dimension.
| math.DG | we carry out a painleve analysis to find the cases where the cohomogeneity one steady ricci soliton equation can be integrable we concentrate on two classes of solitons warped products and complex line bundles over a fano kahler einstein base for warped products the analysis singles out the case with one factor where the dimension of the hypersurface is a perfect square with the n4 particularly distinguished the case with two factors each of dimension 2 is also singled out by the analysis in the case of complex line bundles a 1parameter family is singled out for every even dimension | [['we', 'carry', 'out', 'a', 'painleve', 'analysis', 'to', 'find', 'the', 'cases', 'where', 'the', 'cohomogeneity', 'one', 'steady', 'ricci', 'soliton', 'equation', 'can', 'be', 'integrable', 'we', 'concentrate', 'on', 'two', 'classes', 'of', 'solitons', 'warped', 'products', 'and', 'complex', 'line', 'bundles', 'over', 'a', 'fano', 'kahler', 'einstein', 'base', 'for', 'warped', 'products', 'the', 'analysis', 'singles', 'out', 'the', 'case', 'with', 'one', 'factor', 'where', 'the', 'dimension', 'of', 'the', 'hypersurface', 'is', 'a', 'perfect', 'square', 'with', 'the', 'n4', 'particularly', 'distinguished', 'the', 'case', 'with', 'two', 'factors', 'each', 'of', 'dimension', '2', 'is', 'also', 'singled', 'out', 'by', 'the', 'analysis', 'in', 'the', 'case', 'of', 'complex', 'line', 'bundles', 'a', '1parameter', 'family', 'is', 'singled', 'out', 'for', 'every', 'even', 'dimension']] | [-0.19854563227621838, 0.03982280293828808, -0.03262586386874318, 0.05011831486481242, -0.08109019440598786, -0.21190292049665005, -0.049810177590698, 0.34300282621756195, -0.19178251691628248, -0.15333781033754348, 0.15493288957863116, -0.2925193460145965, -0.150948927171994, 0.18649799701059236, 0.006072617080062628, -0.0376957917958498, 0.07631468739826232, 0.10450045811012387, -0.09634181620320305, -0.3271386477793567, 0.46793795213103295, -0.014964677458629012, 0.22651267815381287, 0.02059348884271458, 0.10027445069514215, -0.013962298622354865, -0.00862804463133216, 0.03419632069662839, -0.13074560701847077, 0.07534593939082697, 0.2778915900364518, 0.04907938123913482, 0.2025619637221098, -0.3257337136412389, -0.21477008637040854, 0.19859684173483402, 0.16099849534919486, 0.07117520753294229, 0.05594256150885485, -0.27632569612236696, 0.03917583665344864, -0.12871266186237335, -0.21681464610097465, -0.08365830876398832, 0.014046681318432093, -0.030659635029733182, -0.215908471532166, 0.020689511929813307, 0.07089805448427797, 0.06500772515311837, -0.028918053852394224, -0.08466991992667318, -0.10093440164113417, 0.047279041601577775, 0.08128019264200702, -0.016368731213733553, 0.11099781781842466, -0.10510688656941056, -0.09792176860384644, 0.4001227038790239, -0.08818521045148373, -0.289516838490963, 0.11045055529801175, -0.14694483624771237, -0.16022694126702844, 0.16039981902576983, 0.1021125016734004, 0.1912339985743165, -0.05642640898673562, 0.10603227560117374, -0.11075070317834616, 0.14408260431140663, 0.13441832564305514, -0.04739727108739317, 0.20765720078721642, 0.12871687261387707, 0.09513831054209732, 0.14093140984303318, -0.0548275461490266, -0.13155330082401634, -0.35248251241631806, -0.2138638838683255, -0.07774810685776173, 0.1910393736360129, -0.14860364578882582, -0.13490109846461565, 0.4249255338078365, -0.02756700539495796, 0.21348497739993036, 0.015719371885061263, 0.20879905965179205, 0.06850866970606148, 0.06584396794438362, 0.09674632545094937, 0.2537912847101688, 0.15140350570203737, 0.029002422689227387, -0.13231759431306273, -0.11959532737731933, 0.12410001610405744] |
1,802.10228 | Risk-neutral valuation under differential funding costs, defaults and
collateralization | We develop a unified valuation theory that incorporates credit risk
(defaults), collateralization and funding costs, by expanding the replication
approach to a generality that has not yet been studied previously and reaching
valuation when replication is not assumed. This unifying theoretical framework
clarifies the relationship between the two valuation approaches: the adjusted
cash flows approach pioneered for example by Brigo, Pallavicini and co-authors
([12, 13, 34]) and the classic replication approach illustrated for example by
Bielecki and Rutkowski and co-authors ([3, 8]). In particular, results of this
work cover most previous papers where the authors studied specific replication
models.
| q-fin.PR | we develop a unified valuation theory that incorporates credit risk defaults collateralization and funding costs by expanding the replication approach to a generality that has not yet been studied previously and reaching valuation when replication is not assumed this unifying theoretical framework clarifies the relationship between the two valuation approaches the adjusted cash flows approach pioneered for example by brigo pallavicini and coauthors 12 13 34 and the classic replication approach illustrated for example by bielecki and rutkowski and coauthors 3 8 in particular results of this work cover most previous papers where the authors studied specific replication models | [['we', 'develop', 'a', 'unified', 'valuation', 'theory', 'that', 'incorporates', 'credit', 'risk', 'defaults', 'collateralization', 'and', 'funding', 'costs', 'by', 'expanding', 'the', 'replication', 'approach', 'to', 'a', 'generality', 'that', 'has', 'not', 'yet', 'been', 'studied', 'previously', 'and', 'reaching', 'valuation', 'when', 'replication', 'is', 'not', 'assumed', 'this', 'unifying', 'theoretical', 'framework', 'clarifies', 'the', 'relationship', 'between', 'the', 'two', 'valuation', 'approaches', 'the', 'adjusted', 'cash', 'flows', 'approach', 'pioneered', 'for', 'example', 'by', 'brigo', 'pallavicini', 'and', 'coauthors', '12', '13', '34', 'and', 'the', 'classic', 'replication', 'approach', 'illustrated', 'for', 'example', 'by', 'bielecki', 'and', 'rutkowski', 'and', 'coauthors', '3', '8', 'in', 'particular', 'results', 'of', 'this', 'work', 'cover', 'most', 'previous', 'papers', 'where', 'the', 'authors', 'studied', 'specific', 'replication', 'models']] | [-0.05075651682640492, 0.01781592003511961, -0.08708346170382668, 0.09288331646015961, -0.09404136863715871, -0.1778373990791163, 0.11710365948083838, 0.358479922938377, -0.21204084410176924, -0.3053527002156985, 0.10361154828893228, -0.25783733043330487, -0.1598693486867529, 0.16308426972057652, -0.15414434164348575, 0.024987354174943056, -0.011146789604816774, -0.05035641483699131, 0.05612870474637608, -0.3328762962976753, 0.2564096404568791, 0.07851931828102379, 0.3071860573019343, 0.09546962330080193, 0.07459533088511289, 0.031665533019060436, -0.11754347129508552, 0.050074046444749894, -0.1979144745175033, 0.1510876246488117, 0.28663811349296603, 0.15739159786255297, 0.4006908802372037, -0.4068969799901801, -0.2356877660548145, 0.07435253403158952, 0.07786989620312898, 0.06649747350434843, -0.02092380172601252, -0.24081559263809463, 0.028457721507157942, -0.2969589365312284, -0.09207947571489095, -0.0708949567298546, 0.06597733411425254, -0.004406833626104124, -0.25598643716563463, 0.043548839082094754, 0.08011482143304263, 0.12038391975290848, -0.08562149334671869, -0.16706883033380063, 0.004080076796012093, 0.05775788885857581, 0.09406769586811689, 0.011342697033677438, 0.09686890719552534, -0.06102356401676632, -0.22436265698210758, 0.3399405428255447, -0.015332823840318003, -0.1755344472411606, 0.1372429289610473, -0.09154236362306307, -0.15695253295842745, 0.06879714784221817, 0.09574503645846488, 0.07801801683098981, -0.19800794167715158, 0.0881185514083358, -0.06843363042365798, 0.0917783484022801, 0.11319601412561506, -0.07453118928830431, 0.09238855743950064, 0.13758166842256683, 0.002147307868745893, 0.08140255418850692, -0.005135808727995615, -0.19741778835804777, -0.2592875774187798, -0.11581457304566008, -0.12148281652480364, 0.04138567583721291, -0.03857098310871868, -0.06784297729080374, 0.3839111610343962, 0.12839051627926176, 0.13377295873384226, 0.10018147921631809, 0.2820641382813755, 0.0563349149947177, 0.03734382442339803, 0.10182530652835137, 0.1879215588454496, 0.08033788093892538, 0.11572579105356426, -0.13291227517912935, 0.12589502690425802, 0.045874532069916825] |
1,802.10229 | Collective Entity Disambiguation with Structured Gradient Tree Boosting | We present a gradient-tree-boosting-based structured learning model for
jointly disambiguating named entities in a document. Gradient tree boosting is
a widely used machine learning algorithm that underlies many top-performing
natural language processing systems. Surprisingly, most works limit the use of
gradient tree boosting as a tool for regular classification or regression
problems, despite the structured nature of language. To the best of our
knowledge, our work is the first one that employs the structured gradient tree
boosting (SGTB) algorithm for collective entity disambiguation. By defining
global features over previous disambiguation decisions and jointly modeling
them with local features, our system is able to produce globally optimized
entity assignments for mentions in a document. Exact inference is prohibitively
expensive for our globally normalized model. To solve this problem, we propose
Bidirectional Beam Search with Gold path (BiBSG), an approximate inference
algorithm that is a variant of the standard beam search algorithm. BiBSG makes
use of global information from both past and future to perform better local
search. Experiments on standard benchmark datasets show that SGTB significantly
improves upon published results. Specifically, SGTB outperforms the previous
state-of-the-art neural system by near 1\% absolute accuracy on the popular
AIDA-CoNLL dataset.
| cs.CL | we present a gradienttreeboostingbased structured learning model for jointly disambiguating named entities in a document gradient tree boosting is a widely used machine learning algorithm that underlies many topperforming natural language processing systems surprisingly most works limit the use of gradient tree boosting as a tool for regular classification or regression problems despite the structured nature of language to the best of our knowledge our work is the first one that employs the structured gradient tree boosting sgtb algorithm for collective entity disambiguation by defining global features over previous disambiguation decisions and jointly modeling them with local features our system is able to produce globally optimized entity assignments for mentions in a document exact inference is prohibitively expensive for our globally normalized model to solve this problem we propose bidirectional beam search with gold path bibsg an approximate inference algorithm that is a variant of the standard beam search algorithm bibsg makes use of global information from both past and future to perform better local search experiments on standard benchmark datasets show that sgtb significantly improves upon published results specifically sgtb outperforms the previous stateoftheart neural system by near 1 absolute accuracy on the popular aidaconll dataset | [['we', 'present', 'a', 'gradienttreeboostingbased', 'structured', 'learning', 'model', 'for', 'jointly', 'disambiguating', 'named', 'entities', 'in', 'a', 'document', 'gradient', 'tree', 'boosting', 'is', 'a', 'widely', 'used', 'machine', 'learning', 'algorithm', 'that', 'underlies', 'many', 'topperforming', 'natural', 'language', 'processing', 'systems', 'surprisingly', 'most', 'works', 'limit', 'the', 'use', 'of', 'gradient', 'tree', 'boosting', 'as', 'a', 'tool', 'for', 'regular', 'classification', 'or', 'regression', 'problems', 'despite', 'the', 'structured', 'nature', 'of', 'language', 'to', 'the', 'best', 'of', 'our', 'knowledge', 'our', 'work', 'is', 'the', 'first', 'one', 'that', 'employs', 'the', 'structured', 'gradient', 'tree', 'boosting', 'sgtb', 'algorithm', 'for', 'collective', 'entity', 'disambiguation', 'by', 'defining', 'global', 'features', 'over', 'previous', 'disambiguation', 'decisions', 'and', 'jointly', 'modeling', 'them', 'with', 'local', 'features', 'our', 'system', 'is', 'able', 'to', 'produce', 'globally', 'optimized', 'entity', 'assignments', 'for', 'mentions', 'in', 'a', 'document', 'exact', 'inference', 'is', 'prohibitively', 'expensive', 'for', 'our', 'globally', 'normalized', 'model', 'to', 'solve', 'this', 'problem', 'we', 'propose', 'bidirectional', 'beam', 'search', 'with', 'gold', 'path', 'bibsg', 'an', 'approximate', 'inference', 'algorithm', 'that', 'is', 'a', 'variant', 'of', 'the', 'standard', 'beam', 'search', 'algorithm', 'bibsg', 'makes', 'use', 'of', 'global', 'information', 'from', 'both', 'past', 'and', 'future', 'to', 'perform', 'better', 'local', 'search', 'experiments', 'on', 'standard', 'benchmark', 'datasets', 'show', 'that', 'sgtb', 'significantly', 'improves', 'upon', 'published', 'results', 'specifically', 'sgtb', 'outperforms', 'the', 'previous', 'stateoftheart', 'neural', 'system', 'by', 'near', '1', 'absolute', 'accuracy', 'on', 'the', 'popular', 'aidaconll', 'dataset']] | [-0.03262204280209974, -0.026914386879070662, -0.0761131432204184, 0.09342570317344537, -0.14798608052404355, -0.18064549588960224, 0.06221155813349884, 0.4459538669204774, -0.2808354366673253, -0.3472355264866329, 0.06329621293417954, -0.2695065452379459, -0.17124203588799067, 0.20491538707581905, -0.07749112883891543, 0.0978346126409817, 0.1571254425994579, 0.06292403173039382, -0.047903338772934796, -0.2715611588451143, 0.2759239882715722, 0.10108067249454597, 0.3568446027317659, -0.030542606853703858, 0.14252858967013618, 0.023160221497890168, -0.056819676483711085, -0.01066151168679944, -0.04316966078386502, 0.18277581775659898, 0.308661140766902, 0.2426998057484704, 0.31776782315359525, -0.36724156519600765, -0.2336753557726905, 0.09249233576732113, 0.16190025309333578, 0.13521563628553643, -0.02446817467109797, -0.28606827172252874, 0.08037160643119452, -0.14402312451944604, 0.0039051786098880164, -0.15376986854063068, -0.020991030614823103, -0.0006968402032320595, -0.2818193435901173, 0.056727266611068125, 0.10183449584382726, 0.03583846726199043, -0.032548160168554614, -0.141748877974478, 0.0677439979533303, 0.10856792754783184, 0.011808886969645407, 0.10197965580658803, 0.1362858062629332, -0.14826385082237886, -0.20529856001584273, 0.3680971687891246, -0.11075173545788028, -0.2097637180668432, 0.19958251961772305, 0.016943642612633543, -0.19125703968821875, 0.08862429263958119, 0.2170764572792952, 0.1562896820021687, -0.17303226857296544, 0.030156289180861353, -0.07460213856954957, 0.2065031213295004, 0.03674309566699046, -0.055516990060903555, 0.1563068720054951, 0.26794801220790015, 0.0901190062759835, 0.10776666144435076, -0.09030391836802504, -0.0955250601108075, -0.1964649653660587, -0.10225865286756838, -0.16524576809175234, -0.069394672162218, -0.10419805223647616, -0.1677045495963506, 0.3836963401788875, 0.24336603017514233, 0.18180757765827094, 0.12283753154321617, 0.3516644653261017, 0.019155237333332742, 0.08711329367828502, 0.13565934294776827, 0.17543216039778886, 0.01791973048193776, 0.13001490471621618, -0.17657974041356594, 0.10613281614933684, 0.09814095745041697] |
1,802.1023 | Variants of the PSS preconditioner for generalized saddle point problems
from the Navier-Stokes equations | In this paper, a class of new preconditioners based on matrix splitting are
presented for generalized saddle-point linear systems, which can be viewed as
further modified improvements of some recently published preconditioners.
Moreover, we widen the scope of the new preconditioners to solve the more
general but rarely considered saddle-point linear systems with singular leading
blocks and rank-deficient off-diagonal blocks. The new variants can result in
much better convergence properties and spectrum distributions than the original
existing preconditioners. Numerical experiments are used to illustrate the
efficiency of the new proposed preconditioners.
| math.NA | in this paper a class of new preconditioners based on matrix splitting are presented for generalized saddlepoint linear systems which can be viewed as further modified improvements of some recently published preconditioners moreover we widen the scope of the new preconditioners to solve the more general but rarely considered saddlepoint linear systems with singular leading blocks and rankdeficient offdiagonal blocks the new variants can result in much better convergence properties and spectrum distributions than the original existing preconditioners numerical experiments are used to illustrate the efficiency of the new proposed preconditioners | [['in', 'this', 'paper', 'a', 'class', 'of', 'new', 'preconditioners', 'based', 'on', 'matrix', 'splitting', 'are', 'presented', 'for', 'generalized', 'saddlepoint', 'linear', 'systems', 'which', 'can', 'be', 'viewed', 'as', 'further', 'modified', 'improvements', 'of', 'some', 'recently', 'published', 'preconditioners', 'moreover', 'we', 'widen', 'the', 'scope', 'of', 'the', 'new', 'preconditioners', 'to', 'solve', 'the', 'more', 'general', 'but', 'rarely', 'considered', 'saddlepoint', 'linear', 'systems', 'with', 'singular', 'leading', 'blocks', 'and', 'rankdeficient', 'offdiagonal', 'blocks', 'the', 'new', 'variants', 'can', 'result', 'in', 'much', 'better', 'convergence', 'properties', 'and', 'spectrum', 'distributions', 'than', 'the', 'original', 'existing', 'preconditioners', 'numerical', 'experiments', 'are', 'used', 'to', 'illustrate', 'the', 'efficiency', 'of', 'the', 'new', 'proposed', 'preconditioners']] | [-0.05693383080306576, 0.010194149697301806, -0.05969271973123426, 0.06864020110051669, -0.09358231356920121, -0.1638796607411088, -0.014956576379967832, 0.3328256383538246, -0.3050735903555875, -0.2639336972446232, 0.14269039789112387, -0.21725128690333484, -0.19132243911223998, 0.24958503548219635, -0.08733832004101394, 0.1474023847175496, 0.09452138777699444, -0.05851701278607924, -0.18190516258211253, -0.3138142445925521, 0.31215498326243935, 0.10228172319577905, 0.26234773166252523, 0.023147235683339474, 0.015952046029269695, -0.0742126669233235, -0.014675452169235591, 0.038251713839369816, -0.07555461027096588, 0.16592930695604902, 0.29767987537863, 0.1173345143446228, 0.2794112642500345, -0.4174163440181004, -0.2064352845875444, 0.094722420299569, 0.21193200002864496, 0.12911347092441436, -0.06012601234165281, -0.2862667480770212, 0.1189307088984156, -0.1919253865400186, -0.14645981282548426, -0.1727404135233303, -0.07479657914366696, 0.054672197703589366, -0.3115309603502053, 0.04993796055614539, 0.08900609151409059, -0.03101912525656459, -0.042009464268071145, -0.25711038057656527, 0.05042288685857144, 0.03452544779117618, 0.03652722740566337, -0.08845063562474244, 0.06572506078365413, -0.04542081637543391, -0.1269885312515096, 0.37704839132941115, -0.06591540008894, -0.2671288919461134, 0.20402239705435932, -0.05772752952915463, -0.14579736040188715, 0.09851474238682416, 0.22990178284081783, 0.1877317315493301, -0.15733435815507238, 0.0744356193290614, -0.037303222629886404, 0.13754696202986352, 0.028901882149831772, 0.04368428196975511, 0.1113306743062132, 0.13733429005459094, 0.12838496615762238, 0.15052001413525912, 0.0011523099754333168, -0.14017324631133085, -0.25938601347689444, -0.14135546524814524, -0.1705767976959328, -0.02767831952679534, -0.13410294012410903, -0.16106461975109446, 0.43307524186733004, 0.17453481462927392, 0.13899278504630694, 0.05617709656036203, 0.2659089491692382, 0.1584211074335214, 0.11687660233660059, 0.08154489645468337, 0.2399613464236449, 0.15950823537391293, 0.1037891025573097, -0.19063748194897487, 0.013715236831538297, 0.1247738103105963] |
1,802.10231 | Why Are Peculiar Type Ia Supernovae More Likely to Show the Signature of
a Single-degenerate Model? | Although type Ia supernovae (SNe Ia) are very useful in many astrophysical
fields, their exact progenitor nature is still unclear. A basic method to
distinguish the different progenitor models is to search the signal from the
single degenerate (SD) model, e.g. the signal for the existence of a
non-degenerate companion before or after supernova explosion. Observationally,
some SNe Ia show such signal, while the others do not. Here, we propose a
universal model to explain these observations based on the spin-up/spin-down
model, in which a white dwarf (WD) will experience a spin-down phase before
supernova explosion, and the spin-down timescale is determined by its initial
mass, i.e. the more massive the initial WD, the shorter the spin-down timescale
and then the more likely the SN Ia to show the SD signature. Therefore, our
model predicts that the SNe Ia from hybrid carbon-oxygen-neon WDs are more
likely to show the SD signature observationally, as some peculiar SNe Ia
showed.
| astro-ph.HE | although type ia supernovae sne ia are very useful in many astrophysical fields their exact progenitor nature is still unclear a basic method to distinguish the different progenitor models is to search the signal from the single degenerate sd model eg the signal for the existence of a nondegenerate companion before or after supernova explosion observationally some sne ia show such signal while the others do not here we propose a universal model to explain these observations based on the spinupspindown model in which a white dwarf wd will experience a spindown phase before supernova explosion and the spindown timescale is determined by its initial mass ie the more massive the initial wd the shorter the spindown timescale and then the more likely the sn ia to show the sd signature therefore our model predicts that the sne ia from hybrid carbonoxygenneon wds are more likely to show the sd signature observationally as some peculiar sne ia showed | [['although', 'type', 'ia', 'supernovae', 'sne', 'ia', 'are', 'very', 'useful', 'in', 'many', 'astrophysical', 'fields', 'their', 'exact', 'progenitor', 'nature', 'is', 'still', 'unclear', 'a', 'basic', 'method', 'to', 'distinguish', 'the', 'different', 'progenitor', 'models', 'is', 'to', 'search', 'the', 'signal', 'from', 'the', 'single', 'degenerate', 'sd', 'model', 'eg', 'the', 'signal', 'for', 'the', 'existence', 'of', 'a', 'nondegenerate', 'companion', 'before', 'or', 'after', 'supernova', 'explosion', 'observationally', 'some', 'sne', 'ia', 'show', 'such', 'signal', 'while', 'the', 'others', 'do', 'not', 'here', 'we', 'propose', 'a', 'universal', 'model', 'to', 'explain', 'these', 'observations', 'based', 'on', 'the', 'spinupspindown', 'model', 'in', 'which', 'a', 'white', 'dwarf', 'wd', 'will', 'experience', 'a', 'spindown', 'phase', 'before', 'supernova', 'explosion', 'and', 'the', 'spindown', 'timescale', 'is', 'determined', 'by', 'its', 'initial', 'mass', 'ie', 'the', 'more', 'massive', 'the', 'initial', 'wd', 'the', 'shorter', 'the', 'spindown', 'timescale', 'and', 'then', 'the', 'more', 'likely', 'the', 'sn', 'ia', 'to', 'show', 'the', 'sd', 'signature', 'therefore', 'our', 'model', 'predicts', 'that', 'the', 'sne', 'ia', 'from', 'hybrid', 'carbonoxygenneon', 'wds', 'are', 'more', 'likely', 'to', 'show', 'the', 'sd', 'signature', 'observationally', 'as', 'some', 'peculiar', 'sne', 'ia', 'showed']] | [-0.06285347098770516, 0.09833111401494074, -0.06276954666330462, 0.19734651459358143, -0.16993893120037037, -0.18085991074861604, 0.09515382192109394, 0.3896340282303812, -0.22162488822624843, -0.25862432050642475, 0.05994306915421982, -0.2573223010212466, -0.08481294020002449, 0.24384967887352657, -0.05645142384305415, -0.08090601479258872, 0.16607719575864693, -0.014709658060544112, -0.13489421287439526, -0.3320350674853389, 0.3241820627760107, 0.051436424131587714, 0.20228246201413294, -0.08070862201437401, 0.04022895043223648, -0.15123397299336105, -0.039721418885349094, -0.11219465837495614, -0.1371920126908156, -0.017375941588351786, 0.19498267554419865, 0.20862127350985155, 0.1848400175907425, -0.3998128692914225, -0.3181343373453504, 0.1503137185362085, 0.20745093058571853, 0.13342515189518203, -0.06442203049470974, -0.26684892623496675, 0.11135380487606118, -0.2382293019467328, -0.10381565128653487, 0.08427105727016077, 0.03206151126164802, 0.05910173632886815, -0.22862231090172677, 0.1396602678460458, 0.08137034196325554, -0.02376646369318419, -0.09805111113502467, -0.09038968315521916, -0.0514044249323462, -0.022506538841908775, 0.0682932891348035, 0.010282651279593193, 0.03254485349583475, -0.1276574794533132, 0.009226500868644046, 0.43503441506314466, -0.029661198394208013, -0.0071086633485915795, 0.23457389256675268, -0.14754781495968375, -0.1031247471736249, 0.10809160636360698, 0.13723301790106476, 0.08553319683304363, -0.21061313616206187, -0.05738721649483718, 0.03105230262514817, 0.15181623815405595, -0.016059895273359916, 0.0686378554877408, 0.330900851413136, 0.1537621271210027, 0.0077255158106755185, 0.008460767540632736, -0.20069168589838274, -0.015529990856406054, -0.24942515565884077, -0.08577913738996427, -0.17642198569624673, 0.17625483305385423, -0.11954461519891556, -0.15013903486719238, 0.35119615300688184, 0.10462526016267418, 0.2080812091037301, -0.007786512778279124, 0.28523894444497044, 0.05641261724271823, 0.07756805214942492, 0.10446930110463401, 0.344244257781634, 0.1728319740939673, 0.11486212765839234, -0.25088845143872723, 0.13276612156224024, 0.022029966292784937] |
1,802.10232 | Scatterer assisted whispering gallery mode microprobe | Fiber based whispering-gallery-mode (WGM) microprobe, combining both the high
optical field enhancement of the WGMs and the practicability of the fiber
probe, is highly demanded in sensing and imaging. Here in this paper, we
experimentally report the efficient far-field coupling of WGMs by scattering
the focused laser beam through a nanotip. With the help of Purcell effect as
well as the two-step focusing technique, a WGM excitation efficiency as high as
16.8% has been achieved. Both the input and output of the probe light propagate
along the same fiber, which makes the whole coupling system a fiber based WGM
microprobe for sensing/imaging applications.
| physics.optics | fiber based whisperinggallerymode wgm microprobe combining both the high optical field enhancement of the wgms and the practicability of the fiber probe is highly demanded in sensing and imaging here in this paper we experimentally report the efficient farfield coupling of wgms by scattering the focused laser beam through a nanotip with the help of purcell effect as well as the twostep focusing technique a wgm excitation efficiency as high as 168 has been achieved both the input and output of the probe light propagate along the same fiber which makes the whole coupling system a fiber based wgm microprobe for sensingimaging applications | [['fiber', 'based', 'whisperinggallerymode', 'wgm', 'microprobe', 'combining', 'both', 'the', 'high', 'optical', 'field', 'enhancement', 'of', 'the', 'wgms', 'and', 'the', 'practicability', 'of', 'the', 'fiber', 'probe', 'is', 'highly', 'demanded', 'in', 'sensing', 'and', 'imaging', 'here', 'in', 'this', 'paper', 'we', 'experimentally', 'report', 'the', 'efficient', 'farfield', 'coupling', 'of', 'wgms', 'by', 'scattering', 'the', 'focused', 'laser', 'beam', 'through', 'a', 'nanotip', 'with', 'the', 'help', 'of', 'purcell', 'effect', 'as', 'well', 'as', 'the', 'twostep', 'focusing', 'technique', 'a', 'wgm', 'excitation', 'efficiency', 'as', 'high', 'as', '168', 'has', 'been', 'achieved', 'both', 'the', 'input', 'and', 'output', 'of', 'the', 'probe', 'light', 'propagate', 'along', 'the', 'same', 'fiber', 'which', 'makes', 'the', 'whole', 'coupling', 'system', 'a', 'fiber', 'based', 'wgm', 'microprobe', 'for', 'sensingimaging', 'applications']] | [-0.13537996496512172, 0.14045092049876556, -0.07381067188757964, -0.07051704657422699, -0.06848726616989748, -0.14985471942425505, 0.024309515497674617, 0.47539940450851825, -0.23393150853614011, -0.2865341445248501, 0.09675760445066307, -0.2343862663370137, -0.14868136037908056, 0.2766866022127443, -0.0018516493431639438, 0.11960785268970273, 0.04135853240914716, -0.024882095183391927, 0.027276956065393546, -0.11389734139026818, 0.2701438520030648, 0.09870839995952944, 0.39213594266067386, 0.08758009561136657, 0.1539511474388122, 0.05543046868543195, 0.025888507272682937, -0.04115971531171132, -0.07398244805232275, 0.15942429324986376, 0.22214530131496563, 0.03541278655357732, 0.2628573885041417, -0.39482784596746606, -0.22597736227052176, 3.30355456646751e-05, 0.2120197759758608, 0.13058996197251677, -0.11493762061182483, -0.27070981012109446, 0.023351813408582674, -0.12758221942018352, -0.10170204678605146, -0.05722810610599231, -0.0601617370894197, 0.06206996123963857, -0.2450065648858892, -0.011689366364175929, 0.002229866600257582, 0.09268941506560818, -0.012594925778388394, -0.025926510852478518, -0.005966768794072171, 0.07918413628951884, -0.01897036570224765, 0.011769204920924762, 0.19261615599195162, -0.16144029324755585, -0.0796073491812921, 0.40421200471053664, -0.15138597386277408, -0.10906349191688658, 0.14238582540066072, -0.15924086978239024, 0.0033444213925166895, 0.1851296373894073, 0.1754111485720119, 0.15090400556686753, -0.09631608964820557, 0.031036517991999385, 0.026316144302779555, 0.21013451048273446, 0.15684012351922838, 0.1522517022037623, 0.16279864854033232, 0.26565965188338475, -0.01070723837862412, 0.1773908078287016, -0.16015226554037665, 0.03692142486083778, -0.21182283749073452, -0.17062386480792352, -0.19551492135460471, 0.03712198947209353, -0.06181428939809991, -0.11264431712162845, 0.421762500318936, 0.10939598539113707, 0.20159710037485495, -0.045278471354714724, 0.3855914161997099, 0.09825766264168802, 0.08370199646828148, -0.04273205979581119, 0.39413356141862915, 0.190302247832091, 0.1282529956204634, -0.2832604349253005, -0.025323897814743368, -0.035108962726286226] |
1,802.10233 | Apache Calcite: A Foundational Framework for Optimized Query Processing
Over Heterogeneous Data Sources | Apache Calcite is a foundational software framework that provides query
processing, optimization, and query language support to many popular
open-source data processing systems such as Apache Hive, Apache Storm, Apache
Flink, Druid, and MapD. Calcite's architecture consists of a modular and
extensible query optimizer with hundreds of built-in optimization rules, a
query processor capable of processing a variety of query languages, an adapter
architecture designed for extensibility, and support for heterogeneous data
models and stores (relational, semi-structured, streaming, and geospatial).
This flexible, embeddable, and extensible architecture is what makes Calcite an
attractive choice for adoption in big-data frameworks. It is an active project
that continues to introduce support for the new types of data sources, query
languages, and approaches to query processing and optimization.
| cs.DB | apache calcite is a foundational software framework that provides query processing optimization and query language support to many popular opensource data processing systems such as apache hive apache storm apache flink druid and mapd calcites architecture consists of a modular and extensible query optimizer with hundreds of builtin optimization rules a query processor capable of processing a variety of query languages an adapter architecture designed for extensibility and support for heterogeneous data models and stores relational semistructured streaming and geospatial this flexible embeddable and extensible architecture is what makes calcite an attractive choice for adoption in bigdata frameworks it is an active project that continues to introduce support for the new types of data sources query languages and approaches to query processing and optimization | [['apache', 'calcite', 'is', 'a', 'foundational', 'software', 'framework', 'that', 'provides', 'query', 'processing', 'optimization', 'and', 'query', 'language', 'support', 'to', 'many', 'popular', 'opensource', 'data', 'processing', 'systems', 'such', 'as', 'apache', 'hive', 'apache', 'storm', 'apache', 'flink', 'druid', 'and', 'mapd', 'calcites', 'architecture', 'consists', 'of', 'a', 'modular', 'and', 'extensible', 'query', 'optimizer', 'with', 'hundreds', 'of', 'builtin', 'optimization', 'rules', 'a', 'query', 'processor', 'capable', 'of', 'processing', 'a', 'variety', 'of', 'query', 'languages', 'an', 'adapter', 'architecture', 'designed', 'for', 'extensibility', 'and', 'support', 'for', 'heterogeneous', 'data', 'models', 'and', 'stores', 'relational', 'semistructured', 'streaming', 'and', 'geospatial', 'this', 'flexible', 'embeddable', 'and', 'extensible', 'architecture', 'is', 'what', 'makes', 'calcite', 'an', 'attractive', 'choice', 'for', 'adoption', 'in', 'bigdata', 'frameworks', 'it', 'is', 'an', 'active', 'project', 'that', 'continues', 'to', 'introduce', 'support', 'for', 'the', 'new', 'types', 'of', 'data', 'sources', 'query', 'languages', 'and', 'approaches', 'to', 'query', 'processing', 'and', 'optimization']] | [-0.1239106140262258, -0.06723290376378908, -0.059079726158482275, 0.06252783705949844, -0.16488670199405311, -0.246778500410236, 0.03307691698409314, 0.45835283537948035, -0.34170634696275237, -0.3309825296718173, 0.10011638831479733, -0.32777008542609287, -0.10849816178783729, 0.264417663436171, -0.0990451007695278, 0.13292004999409363, 0.11729101330511332, -0.01596187239103928, -0.013288336667815238, -0.2607396301175506, 0.2220692202085402, 0.09022274751943059, 0.3392512986353197, 0.007732441395188008, 0.09089734180682771, 0.024833987398845393, -0.03173735800835236, -0.03559326701532534, -0.03867914323277139, 0.185523318034044, 0.3806065660801101, 0.35590495802916405, 0.31079806408814603, -0.41886452783838035, -0.14076468541582182, 0.004400565217029515, 0.13628732768546153, 0.015034661327329715, -0.11105216109776885, -0.2905234648785516, 0.1004337430562506, -0.16974856004845806, 0.019948096065668434, -0.13642942840309163, 0.09181744666633809, -0.00031565551502190953, -0.2830243441115353, -0.11151219508421373, 0.04771831180006871, 0.12927549345252232, -0.04285828108195125, -0.05865960993034561, 0.06658236847478684, 0.09175690379357193, -0.07633335787492494, 0.10405587860405809, 0.22921674728120972, -0.09017224658878778, -0.20931791947261105, 0.44999428553794457, 0.005875182468671261, -0.1014383569032302, 0.21572838951568535, 0.07942693940235104, -0.23171691149018886, 0.05815159981479732, 0.24670906514837976, 0.03244780950490537, -0.25600092568836075, 0.1428560084806248, 0.01768919268322018, 0.23329035887055524, 0.04536586940833708, -0.009699376326478352, 0.22568770568265117, 0.33410006781237395, 0.04004900785147902, 0.16944037895740532, -0.013659014510429971, -0.07982004371403557, -0.21441787246584407, -0.2109543086234026, -0.1286069685717767, -0.07647452139999808, -0.17027661014181217, -0.2611766667668405, 0.32222220814991287, 0.22110624692773795, 0.08005054824350485, 0.11780063962995461, 0.3896753217691813, -0.06104407832121128, 0.19827884471051516, 0.20654866335595526, -0.013260514577623547, -0.06676237824622815, 0.23775488206722994, -0.09885304220914234, 0.07401431646251036, -0.025294821592032668] |
1,802.10234 | Nernst-like Effect in a Flexible Chain | We investigate heat transport via a charged flexible chain in the presence of
magnetic fields. We focus on the Nernst-like effect, where the average
positions of particles deviate in the perpendicular direction to the heat flow.
This phenomenon is induced by the nonlinear dynamics as well as nonequilibrium
state. We develop a linear response formalism to derive a thermodynamic force
which induces the Nernst-like effect, and show that the phenomenon is
quantitatively explained. We also discuss the inverse effect, where an external
ac-driving force induces finite net heat current in the homogeneous system
attached to heat baths with the same temperature.
| cond-mat.stat-mech | we investigate heat transport via a charged flexible chain in the presence of magnetic fields we focus on the nernstlike effect where the average positions of particles deviate in the perpendicular direction to the heat flow this phenomenon is induced by the nonlinear dynamics as well as nonequilibrium state we develop a linear response formalism to derive a thermodynamic force which induces the nernstlike effect and show that the phenomenon is quantitatively explained we also discuss the inverse effect where an external acdriving force induces finite net heat current in the homogeneous system attached to heat baths with the same temperature | [['we', 'investigate', 'heat', 'transport', 'via', 'a', 'charged', 'flexible', 'chain', 'in', 'the', 'presence', 'of', 'magnetic', 'fields', 'we', 'focus', 'on', 'the', 'nernstlike', 'effect', 'where', 'the', 'average', 'positions', 'of', 'particles', 'deviate', 'in', 'the', 'perpendicular', 'direction', 'to', 'the', 'heat', 'flow', 'this', 'phenomenon', 'is', 'induced', 'by', 'the', 'nonlinear', 'dynamics', 'as', 'well', 'as', 'nonequilibrium', 'state', 'we', 'develop', 'a', 'linear', 'response', 'formalism', 'to', 'derive', 'a', 'thermodynamic', 'force', 'which', 'induces', 'the', 'nernstlike', 'effect', 'and', 'show', 'that', 'the', 'phenomenon', 'is', 'quantitatively', 'explained', 'we', 'also', 'discuss', 'the', 'inverse', 'effect', 'where', 'an', 'external', 'acdriving', 'force', 'induces', 'finite', 'net', 'heat', 'current', 'in', 'the', 'homogeneous', 'system', 'attached', 'to', 'heat', 'baths', 'with', 'the', 'same', 'temperature']] | [-0.15558048000900387, 0.19696841001326776, -0.06357426231376606, 0.026664193718472846, -0.07353647247574634, -0.09307768186185472, 0.025400011622725, 0.3570235876163634, -0.32701857711446686, -0.2574886227911799, 0.024258316477235076, -0.27673259533314715, -0.12826286791132227, 0.17855420304084252, 0.01570029552601794, -0.026889756543211418, -0.013619554837667707, 0.06797320875892471, -0.0220748771853413, -0.14526889243596555, 0.30852211336374724, 0.06914256449320842, 0.3305333773836051, 0.09422112766210691, 0.11644626959310014, 0.026176619414922477, 0.049202348382239885, 0.09293429405972509, -0.15357328979288387, 0.01726356371407314, 0.16449348569045416, -0.059427707608199064, 0.21110433341916834, -0.4612899105811473, -0.24185918373894869, 0.105494958191815, 0.08190597677003998, 0.14520168657031943, -0.059478241273681495, -0.22825372291009616, -0.003980436380768176, -0.15377715259495348, -0.14797736027065922, -0.06526080105859454, 0.006926579002088102, 0.04887459984067643, -0.26980190937139903, 0.1411614604268366, 0.1031100860499203, 0.06260226108133793, -0.0771404931201867, -0.06012989534871966, -0.018830544428235972, 0.10234005270193856, 0.06405910989730665, 0.02014323810373645, 0.2238339802231824, -0.13656581841215565, -0.07935818860141358, 0.3481531039544261, -0.15283601922974321, -0.22145173866572643, 0.16306939883858407, -0.1675076729728665, -0.05301613614451841, 0.08182584908145416, 0.1800217370751618, 0.12283115010215247, -0.1913972925118143, 0.06986839943138956, -0.012352794016905056, 0.1076175996821632, 0.018061325175337272, -0.002141798818760579, 0.22670796963542994, 0.15342605685455596, 0.06188102617472558, 0.25741081127647936, -0.10752488847241026, -0.1129349822796291, -0.2741162568367649, -0.1588266766166541, -0.15723231588813044, 0.10291433966912256, -0.03374725230263505, -0.1795137151153666, 0.35758405331393134, 0.18498800379671088, 0.20720302541325292, -0.026658262281752384, 0.29654690859341387, 0.174487359727281, 0.04163830902538087, 0.09293537759821456, 0.24608095059411064, 0.18102281998225148, 0.13520981002101065, -0.35655397948541556, 0.05234919280496122, 0.05645217668578619] |
1,802.10235 | Parametrized Accelerated Methods Free of Condition Number | Analyses of accelerated (momentum-based) gradient descent usually assume
bounded condition number to obtain exponential convergence rates. However, in
many real problems, e.g., kernel methods or deep neural networks, the condition
number, even locally, can be unbounded, unknown or mis-estimated. This poses
problems in both implementing and analyzing accelerated algorithms. In this
paper, we address this issue by proposing parametrized accelerated methods by
considering the condition number as a free parameter. We provide spectral-level
analysis for several important accelerated algorithms, obtain explicit
expressions and improve worst case convergence rates. Moreover, we show that
those algorithm converge exponentially even when the condition number is
unknown or mis-estimated.
| cs.LG math.OC | analyses of accelerated momentumbased gradient descent usually assume bounded condition number to obtain exponential convergence rates however in many real problems eg kernel methods or deep neural networks the condition number even locally can be unbounded unknown or misestimated this poses problems in both implementing and analyzing accelerated algorithms in this paper we address this issue by proposing parametrized accelerated methods by considering the condition number as a free parameter we provide spectrallevel analysis for several important accelerated algorithms obtain explicit expressions and improve worst case convergence rates moreover we show that those algorithm converge exponentially even when the condition number is unknown or misestimated | [['analyses', 'of', 'accelerated', 'momentumbased', 'gradient', 'descent', 'usually', 'assume', 'bounded', 'condition', 'number', 'to', 'obtain', 'exponential', 'convergence', 'rates', 'however', 'in', 'many', 'real', 'problems', 'eg', 'kernel', 'methods', 'or', 'deep', 'neural', 'networks', 'the', 'condition', 'number', 'even', 'locally', 'can', 'be', 'unbounded', 'unknown', 'or', 'misestimated', 'this', 'poses', 'problems', 'in', 'both', 'implementing', 'and', 'analyzing', 'accelerated', 'algorithms', 'in', 'this', 'paper', 'we', 'address', 'this', 'issue', 'by', 'proposing', 'parametrized', 'accelerated', 'methods', 'by', 'considering', 'the', 'condition', 'number', 'as', 'a', 'free', 'parameter', 'we', 'provide', 'spectrallevel', 'analysis', 'for', 'several', 'important', 'accelerated', 'algorithms', 'obtain', 'explicit', 'expressions', 'and', 'improve', 'worst', 'case', 'convergence', 'rates', 'moreover', 'we', 'show', 'that', 'those', 'algorithm', 'converge', 'exponentially', 'even', 'when', 'the', 'condition', 'number', 'is', 'unknown', 'or', 'misestimated']] | [-0.11936760727817622, 0.09271595749753313, -0.0340650461999198, 0.12809306830660297, -0.06694758230318817, -0.21176333696348593, 0.023520234984551698, 0.40547650980834776, -0.30043303199076593, -0.3237658033075814, 0.15236321333997274, -0.18293626569301033, -0.16730140940322039, 0.23570226024737798, -0.09609812956589919, 0.09255193240152529, 0.1320490962859297, 0.028208238634900996, -0.07151496446413848, -0.3101243182228735, 0.2697351334455351, 0.041092563498610755, 0.26101081701031387, 0.023582871963019267, 0.09479453329829714, -0.04392563163464029, -0.023050577290212877, 0.05183776870119171, -0.10550701230700864, 0.10526458128767374, 0.27250410482072485, 0.1805387325808764, 0.3802410029591276, -0.462979971520746, -0.20995155548175368, 0.2407957925908984, 0.23612019969774478, 0.11883144831965463, -0.06289492401097399, -0.23376660110975186, 0.10355689751584297, -0.1389445168718409, -0.1374093652702868, -0.1190088186189174, -0.08104313373153743, 0.05993686286819866, -0.3165771629338941, 0.08939276812060808, 0.08442703015708293, 0.035157371401930086, -0.07050500658806413, -0.10904241158949354, 0.09740373451047792, 0.07027561564245843, 0.0984720709585907, 0.029789979491257466, 0.11046095383622181, -0.13193823675213096, -0.09755407837488186, 0.307419853625246, -0.027799236279231712, -0.2635925581248907, 0.16027960305711111, -0.06146167296593866, -0.14438237380594587, 0.10738884893502333, 0.20084701670118824, 0.1737969739814826, -0.13122456158411155, 0.12721301132002666, 0.008355659817775281, 0.10582483393283418, 0.10240544032198019, 0.01324151739782582, 0.06158727099402593, 0.10035465716590317, 0.12698279231587478, 0.14223383050389551, -0.017492543288076725, -0.09029607363761617, -0.2601337686467629, -0.09252941376269938, -0.18169111229004697, 0.023802021606780518, -0.12374740465104249, -0.1781416456662835, 0.3152973116733707, 0.16721319344763358, 0.23088060196739837, 0.11321192987872145, 0.347503310141082, 0.13130167074156746, -0.011189779898044296, 0.17029649074223785, 0.1782770286170909, 0.06376797576936391, 0.07975582924868482, -0.17258649410751575, 0.13743586519894263, 0.12131140703520661] |
1,802.10236 | Ultra-fast artificial neuron: generation of picosecond-duration spikes
in a current-driven antiferromagnetic auto-oscillator | We demonstrate analytically and numerically, that a thin film of an
antiferromagnetic (AFM) material, having biaxial magnetic anisotropy and being
driven by an external spin-transfer torque signal, can be used for the
generation of ultra-short "Dirac-delta-like" spikes. The duration of the
generated spikes is several picoseconds for typical AFM materials and is
determined by the in-plane magnetic anisotropy and the effective damping of the
AFM material. The generated output signal can consist of a single spike or a
discrete group of spikes ("bursting"), which depends on the repetition (clock)
rate, amplitude, and shape of the external control signal. The spike generation
occurs only when the amplitude of the control signal exceeds a certain
threshold, similar to the action of a biological neuron in response to an
external stimulus. The "threshold" behavior of the proposed AFM spike generator
makes possible its application not only in the traditional microwave signal
processing but also in the future neuromorphic signal processing circuits
working at clock frequencies of tens of gigahertz.
| cond-mat.mes-hall | we demonstrate analytically and numerically that a thin film of an antiferromagnetic afm material having biaxial magnetic anisotropy and being driven by an external spintransfer torque signal can be used for the generation of ultrashort diracdeltalike spikes the duration of the generated spikes is several picoseconds for typical afm materials and is determined by the inplane magnetic anisotropy and the effective damping of the afm material the generated output signal can consist of a single spike or a discrete group of spikes bursting which depends on the repetition clock rate amplitude and shape of the external control signal the spike generation occurs only when the amplitude of the control signal exceeds a certain threshold similar to the action of a biological neuron in response to an external stimulus the threshold behavior of the proposed afm spike generator makes possible its application not only in the traditional microwave signal processing but also in the future neuromorphic signal processing circuits working at clock frequencies of tens of gigahertz | [['we', 'demonstrate', 'analytically', 'and', 'numerically', 'that', 'a', 'thin', 'film', 'of', 'an', 'antiferromagnetic', 'afm', 'material', 'having', 'biaxial', 'magnetic', 'anisotropy', 'and', 'being', 'driven', 'by', 'an', 'external', 'spintransfer', 'torque', 'signal', 'can', 'be', 'used', 'for', 'the', 'generation', 'of', 'ultrashort', 'diracdeltalike', 'spikes', 'the', 'duration', 'of', 'the', 'generated', 'spikes', 'is', 'several', 'picoseconds', 'for', 'typical', 'afm', 'materials', 'and', 'is', 'determined', 'by', 'the', 'inplane', 'magnetic', 'anisotropy', 'and', 'the', 'effective', 'damping', 'of', 'the', 'afm', 'material', 'the', 'generated', 'output', 'signal', 'can', 'consist', 'of', 'a', 'single', 'spike', 'or', 'a', 'discrete', 'group', 'of', 'spikes', 'bursting', 'which', 'depends', 'on', 'the', 'repetition', 'clock', 'rate', 'amplitude', 'and', 'shape', 'of', 'the', 'external', 'control', 'signal', 'the', 'spike', 'generation', 'occurs', 'only', 'when', 'the', 'amplitude', 'of', 'the', 'control', 'signal', 'exceeds', 'a', 'certain', 'threshold', 'similar', 'to', 'the', 'action', 'of', 'a', 'biological', 'neuron', 'in', 'response', 'to', 'an', 'external', 'stimulus', 'the', 'threshold', 'behavior', 'of', 'the', 'proposed', 'afm', 'spike', 'generator', 'makes', 'possible', 'its', 'application', 'not', 'only', 'in', 'the', 'traditional', 'microwave', 'signal', 'processing', 'but', 'also', 'in', 'the', 'future', 'neuromorphic', 'signal', 'processing', 'circuits', 'working', 'at', 'clock', 'frequencies', 'of', 'tens', 'of', 'gigahertz']] | [-0.20444487604651262, 0.1925944055285072, -0.014281480237277168, 0.007286454021761363, -0.08609791855807557, -0.12542031300430553, 0.03505512801648089, 0.42293775618979423, -0.3096718008263093, -0.29977259271862833, 0.08910561650956163, -0.2686470097671686, -0.14153655796650458, 0.26217643682788494, 0.005012120758042191, 0.03355048500304816, -0.010770465838581775, 0.09044186528772116, -0.005008915031794459, -0.18125352625114222, 0.20724424607487338, 0.07949387814680284, 0.3290713480716063, -0.005938803635989175, 0.1340302439406514, -0.017133431212807245, 0.07297011649229028, -0.05189172952069026, -0.06039735635492958, 0.06180780865252018, 0.2263227465985851, 0.02712479153873794, 0.23502558713045085, -0.4865298913509557, -0.23339183070294728, 0.0890989565205845, 0.12143011726438999, 0.15532735812153214, -0.05778091082589306, -0.2747123043645512, 0.07486422638317118, -0.1379522030423466, -0.07899984595203546, -0.05380341356142184, 0.03604472846244321, 0.08087834036542159, -0.286937501362285, 0.09992901535852897, 0.10336973974291609, 0.08923364497975192, -0.07203673680849147, -0.020897254740085566, -0.022799655002062068, 0.09640506077363777, 0.03271349319192902, 0.05577550184715426, 0.2462766222027836, -0.1548999767355395, -0.11962499317120422, 0.31640126891434195, -0.07415490269265843, -0.12091530387794289, 0.12582805609810307, -0.15393354252375888, -0.03400057982847405, 0.17399379299445586, 0.145205047009795, 0.059382230765891796, -0.1362616430111688, 0.0055835104219361465, 0.08739817272025076, 0.27263805704600547, 0.11924708250232718, 0.03776513056152246, 0.2325142083816569, 0.21997166855444172, 0.033463915877721524, 0.17120903184545705, -0.1439091915164185, -0.0027419628332030366, -0.2541291250311064, -0.06102626271630553, -0.23269742838756152, 0.05209772899529939, -0.1260327114211219, -0.1770703270946714, 0.45144444528233374, 0.16428476096215575, 0.16248519530830283, -0.023846559382968046, 0.31509374138532265, 0.14322483752938833, 0.07045112004164945, 0.0015338517584358201, 0.2574171322087447, 0.1485259612034442, 0.11775669748762581, -0.2670365996672913, 0.09188593869295084, -0.04108685954671466] |
1,802.10237 | An EMG Gesture Recognition System with Flexible High-Density Sensors and
Brain-Inspired High-Dimensional Classifier | EMG-based gesture recognition shows promise for human-machine interaction.
Systems are often afflicted by signal and electrode variability which degrades
performance over time. We present an end-to-end system combating this
variability using a large-area, high-density sensor array and a robust
classification algorithm. EMG electrodes are fabricated on a flexible substrate
and interfaced to a custom wireless device for 64-channel signal acquisition
and streaming. We use brain-inspired high-dimensional (HD) computing for
processing EMG features in one-shot learning. The HD algorithm is tolerant to
noise and electrode misplacement and can quickly learn from few gestures
without gradient descent or back-propagation. We achieve an average
classification accuracy of 96.64% for five gestures, with only 7% degradation
when training and testing across different days. Our system maintains this
accuracy when trained with only three trials of gestures; it also demonstrates
comparable accuracy with the state-of-the-art when trained with one trial.
| cs.HC cs.LG eess.SP | emgbased gesture recognition shows promise for humanmachine interaction systems are often afflicted by signal and electrode variability which degrades performance over time we present an endtoend system combating this variability using a largearea highdensity sensor array and a robust classification algorithm emg electrodes are fabricated on a flexible substrate and interfaced to a custom wireless device for 64channel signal acquisition and streaming we use braininspired highdimensional hd computing for processing emg features in oneshot learning the hd algorithm is tolerant to noise and electrode misplacement and can quickly learn from few gestures without gradient descent or backpropagation we achieve an average classification accuracy of 9664 for five gestures with only 7 degradation when training and testing across different days our system maintains this accuracy when trained with only three trials of gestures it also demonstrates comparable accuracy with the stateoftheart when trained with one trial | [['emgbased', 'gesture', 'recognition', 'shows', 'promise', 'for', 'humanmachine', 'interaction', 'systems', 'are', 'often', 'afflicted', 'by', 'signal', 'and', 'electrode', 'variability', 'which', 'degrades', 'performance', 'over', 'time', 'we', 'present', 'an', 'endtoend', 'system', 'combating', 'this', 'variability', 'using', 'a', 'largearea', 'highdensity', 'sensor', 'array', 'and', 'a', 'robust', 'classification', 'algorithm', 'emg', 'electrodes', 'are', 'fabricated', 'on', 'a', 'flexible', 'substrate', 'and', 'interfaced', 'to', 'a', 'custom', 'wireless', 'device', 'for', '64channel', 'signal', 'acquisition', 'and', 'streaming', 'we', 'use', 'braininspired', 'highdimensional', 'hd', 'computing', 'for', 'processing', 'emg', 'features', 'in', 'oneshot', 'learning', 'the', 'hd', 'algorithm', 'is', 'tolerant', 'to', 'noise', 'and', 'electrode', 'misplacement', 'and', 'can', 'quickly', 'learn', 'from', 'few', 'gestures', 'without', 'gradient', 'descent', 'or', 'backpropagation', 'we', 'achieve', 'an', 'average', 'classification', 'accuracy', 'of', '9664', 'for', 'five', 'gestures', 'with', 'only', '7', 'degradation', 'when', 'training', 'and', 'testing', 'across', 'different', 'days', 'our', 'system', 'maintains', 'this', 'accuracy', 'when', 'trained', 'with', 'only', 'three', 'trials', 'of', 'gestures', 'it', 'also', 'demonstrates', 'comparable', 'accuracy', 'with', 'the', 'stateoftheart', 'when', 'trained', 'with', 'one', 'trial']] | [-0.09465632709260616, 0.005588254550376506, -0.013676306853691736, -0.017491121838651855, -0.07121606308889265, -0.2845800775361972, 0.026642076301666547, 0.5065070077350052, -0.22940243801309002, -0.36322584520813606, 0.07969172230918452, -0.29158279111531255, -0.17685704792933798, 0.2686970731511893, -0.14727975107315514, 0.09658666828181595, 0.17453280542395078, 0.03525313031018919, -0.05397607097014164, -0.2966794604031343, 0.18642239264671742, 0.05427790997782722, 0.3172384545000063, -0.003257174348820829, 0.14861925066927345, -0.016948384431695256, 0.03678622199610496, -0.04088996722647506, 0.009845036617156843, 0.112908699061437, 0.32622997497552814, 0.1374307648543941, 0.30246270889054155, -0.4176839736626587, -0.20908044553491184, 0.06160331111944591, 0.14436470367298979, 0.10159581758893586, -0.07102333811942824, -0.3558200746192597, 0.11785411849773987, -0.18819227073496828, 0.04248063047351833, -0.1027614397333107, -0.00767729703673265, 0.000281769504201495, -0.31561436492484063, 0.04784048140876015, 0.012810121456924308, 0.14353518922467223, -0.05078086665889714, -0.09161207427516477, 0.044249276295886375, 0.15372901990303944, -0.012763149805121228, 0.07357082368172188, 0.19881342919931436, -0.14984412988997065, -0.10003472104856176, 0.3289902865395157, -0.059603794600762844, -0.19026483769751698, 0.22150251016783942, -0.028135773389496736, -0.10589741757333589, 0.13292748206246566, 0.25197805541877943, 0.09224727271551576, -0.18742245538214775, -0.04769978552212706, 0.08024588068171094, 0.2478733224173387, 0.09075299587049004, -0.0008389896118185587, 0.1639068776243625, 0.29175829003442133, 0.06631597980675805, 0.13921856254779008, -0.1867678248042163, 0.003176723897922784, -0.16618131628557523, -0.10877947638800833, -0.18049330352934906, -0.00039065341277617135, -0.12561628895340013, -0.1280206771865172, 0.38115890469634905, 0.2012172887415444, 0.13842943710430214, 0.1275965953122472, 0.40980473019751823, 0.010054812007486666, 0.126593066686635, 0.10113753982457435, 0.19296649381916117, 0.0009049957265637608, 0.15163404055945445, -0.1948461250851526, 0.10315254915622063, -0.03444754096239598] |
1,802.10238 | DeepSOFA: A Continuous Acuity Score for Critically Ill Patients using
Clinically Interpretable Deep Learning | Traditional methods for assessing illness severity and predicting in-hospital
mortality among critically ill patients require time-consuming, error-prone
calculations using static variable thresholds. These methods do not capitalize
on the emerging availability of streaming electronic health record data or
capture time-sensitive individual physiological patterns, a critical task in
the intensive care unit. We propose a novel acuity score framework (DeepSOFA)
that leverages temporal measurements and interpretable deep learning models to
assess illness severity at any point during an ICU stay. We compare DeepSOFA
with SOFA (Sequential Organ Failure Assessment) baseline models using the same
model inputs and find that at any point during an ICU admission, DeepSOFA
yields significantly more accurate predictions of in-hospital mortality. A
DeepSOFA model developed in a public database and validated in a single
institutional cohort had a mean AUC for the entire ICU stay of 0.90 (95% CI
0.90-0.91) compared with baseline SOFA models with mean AUC 0.79 (95% CI
0.79-0.80) and 0.85 (95% CI 0.85-0.86). Deep models are well-suited to identify
ICU patients in need of life-saving interventions prior to the occurrence of an
unexpected adverse event and inform shared decision-making processes among
patients, providers, and families regarding goals of care and optimal resource
utilization.
| cs.LG cs.AI stat.AP stat.ML | traditional methods for assessing illness severity and predicting inhospital mortality among critically ill patients require timeconsuming errorprone calculations using static variable thresholds these methods do not capitalize on the emerging availability of streaming electronic health record data or capture timesensitive individual physiological patterns a critical task in the intensive care unit we propose a novel acuity score framework deepsofa that leverages temporal measurements and interpretable deep learning models to assess illness severity at any point during an icu stay we compare deepsofa with sofa sequential organ failure assessment baseline models using the same model inputs and find that at any point during an icu admission deepsofa yields significantly more accurate predictions of inhospital mortality a deepsofa model developed in a public database and validated in a single institutional cohort had a mean auc for the entire icu stay of 090 95 ci 090091 compared with baseline sofa models with mean auc 079 95 ci 079080 and 085 95 ci 085086 deep models are wellsuited to identify icu patients in need of lifesaving interventions prior to the occurrence of an unexpected adverse event and inform shared decisionmaking processes among patients providers and families regarding goals of care and optimal resource utilization | [['traditional', 'methods', 'for', 'assessing', 'illness', 'severity', 'and', 'predicting', 'inhospital', 'mortality', 'among', 'critically', 'ill', 'patients', 'require', 'timeconsuming', 'errorprone', 'calculations', 'using', 'static', 'variable', 'thresholds', 'these', 'methods', 'do', 'not', 'capitalize', 'on', 'the', 'emerging', 'availability', 'of', 'streaming', 'electronic', 'health', 'record', 'data', 'or', 'capture', 'timesensitive', 'individual', 'physiological', 'patterns', 'a', 'critical', 'task', 'in', 'the', 'intensive', 'care', 'unit', 'we', 'propose', 'a', 'novel', 'acuity', 'score', 'framework', 'deepsofa', 'that', 'leverages', 'temporal', 'measurements', 'and', 'interpretable', 'deep', 'learning', 'models', 'to', 'assess', 'illness', 'severity', 'at', 'any', 'point', 'during', 'an', 'icu', 'stay', 'we', 'compare', 'deepsofa', 'with', 'sofa', 'sequential', 'organ', 'failure', 'assessment', 'baseline', 'models', 'using', 'the', 'same', 'model', 'inputs', 'and', 'find', 'that', 'at', 'any', 'point', 'during', 'an', 'icu', 'admission', 'deepsofa', 'yields', 'significantly', 'more', 'accurate', 'predictions', 'of', 'inhospital', 'mortality', 'a', 'deepsofa', 'model', 'developed', 'in', 'a', 'public', 'database', 'and', 'validated', 'in', 'a', 'single', 'institutional', 'cohort', 'had', 'a', 'mean', 'auc', 'for', 'the', 'entire', 'icu', 'stay', 'of', '090', '95', 'ci', '090091', 'compared', 'with', 'baseline', 'sofa', 'models', 'with', 'mean', 'auc', '079', '95', 'ci', '079080', 'and', '085', '95', 'ci', '085086', 'deep', 'models', 'are', 'wellsuited', 'to', 'identify', 'icu', 'patients', 'in', 'need', 'of', 'lifesaving', 'interventions', 'prior', 'to', 'the', 'occurrence', 'of', 'an', 'unexpected', 'adverse', 'event', 'and', 'inform', 'shared', 'decisionmaking', 'processes', 'among', 'patients', 'providers', 'and', 'families', 'regarding', 'goals', 'of', 'care', 'and', 'optimal', 'resource', 'utilization']] | [-0.04385709517391938, 0.025063217535504462, -0.04606356112485004, 0.11130839503998986, -0.06293651753289596, -0.22236829579141237, 0.16243457620689258, 0.430427650509752, -0.14076444638070418, -0.31449530370117446, 0.12562164914590981, -0.3015521865522461, -0.1156825978500381, 0.17266775360673686, -0.18844621869153935, 0.0815336949246354, 0.15420814669131996, 0.058319695596465, -0.02631644941724572, -0.29044252286811695, 0.20369890495085247, 0.10034770745078461, 0.38105589347323615, 0.031065669527683918, 0.0859549177578901, 0.030635093622439102, -0.062051248632673986, -0.06033836325233433, -0.08190087772597651, 0.13220543636784413, 0.3704433338773504, 0.21907945430889575, 0.3954494729576642, -0.4172235635655275, -0.22213323315756803, 0.1047830987936784, 0.06885486489473866, 0.0184565309810672, 0.045430221144203926, -0.312636617845312, 0.05335094933728995, -0.20586839330330642, -0.04507804039699087, -0.10325425797435195, -0.017753540773445806, -0.026173959749746064, -0.3339240964086074, 0.1305297959742472, -0.06588511041077184, 0.17550035332636713, -0.13899108983202824, -0.15758143088350138, -0.01827726544112648, 0.1967259978764421, 0.05458468715022058, 0.061545819540503366, 0.18727412649494157, -0.15298349880211548, -0.1502748628600198, 0.3367789951200375, -0.001355559189288598, -0.14953217096567664, 0.17921825931797533, -0.07919828589003401, -0.15210009716450576, 0.11316021941933156, 0.2533827784050464, 0.0643634657708805, -0.20755430277162776, -0.08545347989352449, 0.07184438137656673, 0.2079972849587371, 0.05298544518055092, -0.06104201917462098, 0.21254612611007503, 0.22451379743929442, -0.029395822065688557, 0.027085739787110142, -0.14272269455191258, -0.06036841728946733, -0.18811757496657408, -0.10715308798018189, -0.044698391128615074, 0.024900248790763174, -0.11882326361069664, -0.1782087124600477, 0.3660604445887777, 0.23143771391948165, 0.12445793393526586, 0.12557890000256713, 0.26696507010353626, 0.011016186163051592, 0.08985949951096386, 0.08555262132759353, 0.14184400529558133, -0.051263596824734345, 0.10470722048652127, -0.20937734218030638, 0.2037326070715834, -0.04101959217710865] |
1,802.10239 | Absolute Continuity and Large-Scale Geometry of Polish Groups | We apply the theory of large-scale geometry of Polish groups to groups of
absolutely continuous homeomorphisms. Let $M$ be either the compact interval or
circle. We prove that the Polish group $\operatorname{AC}_+(M)$ of
orientation-preserving homeomorphisms $f:M\to M$ such that $f$ and $f^{-1}$ are
absolutely continuous has a trivial quasi-isometry type. We also prove that the
Polish group $\operatorname{AC}_{\mathbb Z}^\mathrm{loc}(\mathbb R)$ of
homeomorphisms $f:\mathbb R\to\mathbb R$ such that $f$ commutes with integer
translations and both $f$ and $f^{-1}$ are locally absolutely continuous is
quasi-isometric to the group of integers. To study
$\operatorname{AC}_+\left(\mathbb S^1\right)$ and $\operatorname{AC}_{\mathbb
Z}^\mathrm{loc}(\mathbb R)$ we use the observation that these groups are
Zappa-Sz\'ep products.
| math.GR math.LO | we apply the theory of largescale geometry of polish groups to groups of absolutely continuous homeomorphisms let m be either the compact interval or circle we prove that the polish group operatornameac_m of orientationpreserving homeomorphisms fmto m such that f and f1 are absolutely continuous has a trivial quasiisometry type we also prove that the polish group operatornameac_mathbb zmathrmlocmathbb r of homeomorphisms fmathbb rtomathbb r such that f commutes with integer translations and both f and f1 are locally absolutely continuous is quasiisometric to the group of integers to study operatornameac_leftmathbb s1right and operatornameac_mathbb zmathrmlocmathbb r we use the observation that these groups are zappaszep products | [['we', 'apply', 'the', 'theory', 'of', 'largescale', 'geometry', 'of', 'polish', 'groups', 'to', 'groups', 'of', 'absolutely', 'continuous', 'homeomorphisms', 'let', 'm', 'be', 'either', 'the', 'compact', 'interval', 'or', 'circle', 'we', 'prove', 'that', 'the', 'polish', 'group', 'operatornameac_m', 'of', 'orientationpreserving', 'homeomorphisms', 'fmto', 'm', 'such', 'that', 'f', 'and', 'f1', 'are', 'absolutely', 'continuous', 'has', 'a', 'trivial', 'quasiisometry', 'type', 'we', 'also', 'prove', 'that', 'the', 'polish', 'group', 'operatornameac_mathbb', 'zmathrmlocmathbb', 'r', 'of', 'homeomorphisms', 'fmathbb', 'rtomathbb', 'r', 'such', 'that', 'f', 'commutes', 'with', 'integer', 'translations', 'and', 'both', 'f', 'and', 'f1', 'are', 'locally', 'absolutely', 'continuous', 'is', 'quasiisometric', 'to', 'the', 'group', 'of', 'integers', 'to', 'study', 'operatornameac_leftmathbb', 's1right', 'and', 'operatornameac_mathbb', 'zmathrmlocmathbb', 'r', 'we', 'use', 'the', 'observation', 'that', 'these', 'groups', 'are', 'zappaszep', 'products']] | [-0.23238446525382725, 0.1471293622138675, -0.09915085417463096, 0.029716311639993255, -0.0830422809178179, -0.1417828284138155, 0.020588626166702144, 0.4731415807636398, -0.32675154795023525, -0.16293122813651206, 0.12598334058103236, -0.31595068494730505, -0.11396464331291917, 0.1999941771459587, -0.15387894092786192, -0.02070598578024091, 0.017695001425278006, 0.10998900215179104, -0.08769263221524806, -0.26547472611671746, 0.38508702297530356, -0.12722022788166398, 0.17573298566570186, -0.01183212919612274, 0.0827161665239155, -0.027857878508817668, -0.03853222246945017, 0.023004043722675754, -0.1453371611700865, 0.07419203063990507, 0.2921907167712396, 0.08243877454213987, 0.247638820698767, -0.32288989956217884, -0.17162639579989694, 0.27399599736537594, 0.06574040089235311, -0.15207519531814437, -0.053320999915777434, -0.3522589621557431, 0.1208993921296276, -0.1564529760166852, -0.11747984433866511, -0.12341684012702017, 0.13823802260366844, 0.03084362699706672, -0.2718477798766936, -9.068225615074613e-05, 0.1603976705798296, 0.12951615345523212, -0.07863880347253548, -0.045332228454450764, -0.13185890720254093, 0.16567186321451732, -0.0005076338814552685, 0.1546968232459304, 0.13847375949468427, 0.058311247901821676, -0.06425989194857804, 0.39057776695964014, -0.15750040064537615, -0.2514934160116345, 0.2008155852161122, -0.2509133332136153, -0.2219507518469008, 0.08019545673383306, 0.09904792231761596, 0.14939007769818557, -0.009223463740041056, 0.25263446727250183, -0.14899847159312682, 0.1551468235374701, 0.0495225484577017, -0.036485392042915475, 0.10667634222214345, 0.02229561579573636, 0.1716644404728831, 0.11151954249803428, 0.07255247089485026, 0.05905033901070404, -0.3428100762192649, -0.18554328982494867, -0.11930952584982445, 0.18025226737701833, -0.07511724071574839, -0.1855448730209974, 0.36344942373383526, 0.038160857504628824, 0.10777936738473598, 0.18778412350726248, 0.1651059508022636, 0.013610485524898677, 0.0025847643482113125, 0.1058930506261837, 0.05071181322993579, 0.15513685406797162, -0.13664042136885904, -0.10303508003025946, -0.07629780822452346, 0.18632410713142217] |
1,802.1024 | Neural Aesthetic Image Reviewer | Recently, there is a rising interest in perceiving image aesthetics. The
existing works deal with image aesthetics as a classification or regression
problem. To extend the cognition from rating to reasoning, a deeper
understanding of aesthetics should be based on revealing why a high- or
low-aesthetic score should be assigned to an image. From such a point of view,
we propose a model referred to as Neural Aesthetic Image Reviewer, which can
not only give an aesthetic score for an image, but also generate a textual
description explaining why the image leads to a plausible rating score.
Specifically, we propose two multi-task architectures based on shared
aesthetically semantic layers and task-specific embedding layers at a high
level for performance improvement on different tasks. To facilitate researches
on this problem, we collect the AVA-Reviews dataset, which contains 52,118
images and 312,708 comments in total. Through multi-task learning, the proposed
models can rate aesthetic images as well as produce comments in an end-to-end
manner. It is confirmed that the proposed models outperform the baselines
according to the performance evaluation on the AVA-Reviews dataset. Moreover,
we demonstrate experimentally that our model can generate textual reviews
related to aesthetics, which are consistent with human perception.
| cs.CV | recently there is a rising interest in perceiving image aesthetics the existing works deal with image aesthetics as a classification or regression problem to extend the cognition from rating to reasoning a deeper understanding of aesthetics should be based on revealing why a high or lowaesthetic score should be assigned to an image from such a point of view we propose a model referred to as neural aesthetic image reviewer which can not only give an aesthetic score for an image but also generate a textual description explaining why the image leads to a plausible rating score specifically we propose two multitask architectures based on shared aesthetically semantic layers and taskspecific embedding layers at a high level for performance improvement on different tasks to facilitate researches on this problem we collect the avareviews dataset which contains 52118 images and 312708 comments in total through multitask learning the proposed models can rate aesthetic images as well as produce comments in an endtoend manner it is confirmed that the proposed models outperform the baselines according to the performance evaluation on the avareviews dataset moreover we demonstrate experimentally that our model can generate textual reviews related to aesthetics which are consistent with human perception | [['recently', 'there', 'is', 'a', 'rising', 'interest', 'in', 'perceiving', 'image', 'aesthetics', 'the', 'existing', 'works', 'deal', 'with', 'image', 'aesthetics', 'as', 'a', 'classification', 'or', 'regression', 'problem', 'to', 'extend', 'the', 'cognition', 'from', 'rating', 'to', 'reasoning', 'a', 'deeper', 'understanding', 'of', 'aesthetics', 'should', 'be', 'based', 'on', 'revealing', 'why', 'a', 'high', 'or', 'lowaesthetic', 'score', 'should', 'be', 'assigned', 'to', 'an', 'image', 'from', 'such', 'a', 'point', 'of', 'view', 'we', 'propose', 'a', 'model', 'referred', 'to', 'as', 'neural', 'aesthetic', 'image', 'reviewer', 'which', 'can', 'not', 'only', 'give', 'an', 'aesthetic', 'score', 'for', 'an', 'image', 'but', 'also', 'generate', 'a', 'textual', 'description', 'explaining', 'why', 'the', 'image', 'leads', 'to', 'a', 'plausible', 'rating', 'score', 'specifically', 'we', 'propose', 'two', 'multitask', 'architectures', 'based', 'on', 'shared', 'aesthetically', 'semantic', 'layers', 'and', 'taskspecific', 'embedding', 'layers', 'at', 'a', 'high', 'level', 'for', 'performance', 'improvement', 'on', 'different', 'tasks', 'to', 'facilitate', 'researches', 'on', 'this', 'problem', 'we', 'collect', 'the', 'avareviews', 'dataset', 'which', 'contains', '52118', 'images', 'and', '312708', 'comments', 'in', 'total', 'through', 'multitask', 'learning', 'the', 'proposed', 'models', 'can', 'rate', 'aesthetic', 'images', 'as', 'well', 'as', 'produce', 'comments', 'in', 'an', 'endtoend', 'manner', 'it', 'is', 'confirmed', 'that', 'the', 'proposed', 'models', 'outperform', 'the', 'baselines', 'according', 'to', 'the', 'performance', 'evaluation', 'on', 'the', 'avareviews', 'dataset', 'moreover', 'we', 'demonstrate', 'experimentally', 'that', 'our', 'model', 'can', 'generate', 'textual', 'reviews', 'related', 'to', 'aesthetics', 'which', 'are', 'consistent', 'with', 'human', 'perception']] | [0.005738747573448155, -0.032361576239797005, -0.09163204962102582, 0.08735074774003991, -0.17096363058389755, -0.18482480401752935, 0.030143379047275425, 0.4885623670772326, -0.22548515787015536, -0.3558137954868452, 0.04547397658996265, -0.3126304134998556, -0.2022295321684749, 0.17134973144025675, -0.20380136261133439, 0.038209860345553036, 0.12003858750971148, 0.10473974078551543, -0.07151443916800602, -0.2983804696657676, 0.29993006268193073, 0.07227092392609588, 0.35323903523385525, 0.0712333862522465, 0.13837263385446893, -0.05519319912276174, -0.026451615584160117, 0.008247989218832618, -0.03759706462414197, 0.17666279306701785, 0.34317992208217424, 0.21588559495760318, 0.3190459813542512, -0.39501141002449225, -0.2278642960721912, 0.04374070834292441, 0.14008405151757963, 0.08251760675802314, -0.05533819970240037, -0.365163153465077, 0.07939071179312958, -0.1589443130152566, 0.04487362215105368, -0.15051374393420255, -0.026191131514734685, -0.05435673915365312, -0.28664052212487295, 0.028971196393267375, 0.07894787190028238, 0.08570452884780433, -0.05638432231368212, -0.11885769450466852, 0.018369222442353412, 0.1801116187481818, 0.057750260807830384, 0.08681504267201953, 0.13866201976589781, -0.21261774273354642, -0.1719780219867303, 0.40454701378903524, -0.03342952782155147, -0.2449636664312827, 0.2028162709388829, -0.010322464451821027, -0.12130792671339397, 0.06837223340015934, 0.23705416407117771, 0.0749129178145026, -0.1483891594249812, -0.0709872897197635, -0.09383872597554356, 0.22644806728530223, 0.05699359067021964, -0.005346063244137533, 0.24817015360850764, 0.23933968639799527, 0.006681429003650437, 0.14253626903400243, -0.09712746621427905, -0.02889813361089553, -0.20810412888876068, -0.12178125211075709, -0.17113264387399812, 0.0028407538894888213, -0.06701319140120177, -0.16167417261511924, 0.41457692289259285, 0.2652444239677291, 0.25479866997386347, 0.0853917246027517, 0.32663293808641636, 0.04203774020781417, 0.13009870335535736, 0.04721946392341384, 0.17033000391900863, -0.028143488780633375, 0.11340304414447093, -0.11954254915400846, 0.12058092119310013, 0.06485668535710179] |
1,802.10241 | The fastest pulses that implement dynamically corrected gates | Dynamically correcting for unwanted interactions between a quantum system and
its environment is vital to achieving the high-fidelity quantum control
necessary for a broad range of quantum information technologies. In recent
work, we uncovered the complete solution space of all possible driving fields
that suppress transverse quasistatic noise errors while performing single-qubit
operations. This solution space lives within a simple geometrical framework
that makes it possible to obtain globally optimal pulses subject to a set of
experimental constraints by solving certain geometrical optimization problems.
In this work, we solve such a geometrical optimization problem to find the
fastest possible pulses that implement single-qubit gates while cancelling
transverse quasistatic noise to second order. Because the time-optimized pulses
are not smooth, we provide a method based on our geometrical approach to obtain
experimentally feasible smooth pulses that approximate the time-optimal ones
with minimal loss in gate speed. We show that in the presence of realistic
constraints on pulse rise times, our smooth pulses significantly outperform
sequences based on ideal pulse shapes, highlighting the benefits of building
experimental waveform constraints directly into dynamically corrected gate
designs.
| quant-ph cond-mat.mes-hall | dynamically correcting for unwanted interactions between a quantum system and its environment is vital to achieving the highfidelity quantum control necessary for a broad range of quantum information technologies in recent work we uncovered the complete solution space of all possible driving fields that suppress transverse quasistatic noise errors while performing singlequbit operations this solution space lives within a simple geometrical framework that makes it possible to obtain globally optimal pulses subject to a set of experimental constraints by solving certain geometrical optimization problems in this work we solve such a geometrical optimization problem to find the fastest possible pulses that implement singlequbit gates while cancelling transverse quasistatic noise to second order because the timeoptimized pulses are not smooth we provide a method based on our geometrical approach to obtain experimentally feasible smooth pulses that approximate the timeoptimal ones with minimal loss in gate speed we show that in the presence of realistic constraints on pulse rise times our smooth pulses significantly outperform sequences based on ideal pulse shapes highlighting the benefits of building experimental waveform constraints directly into dynamically corrected gate designs | [['dynamically', 'correcting', 'for', 'unwanted', 'interactions', 'between', 'a', 'quantum', 'system', 'and', 'its', 'environment', 'is', 'vital', 'to', 'achieving', 'the', 'highfidelity', 'quantum', 'control', 'necessary', 'for', 'a', 'broad', 'range', 'of', 'quantum', 'information', 'technologies', 'in', 'recent', 'work', 'we', 'uncovered', 'the', 'complete', 'solution', 'space', 'of', 'all', 'possible', 'driving', 'fields', 'that', 'suppress', 'transverse', 'quasistatic', 'noise', 'errors', 'while', 'performing', 'singlequbit', 'operations', 'this', 'solution', 'space', 'lives', 'within', 'a', 'simple', 'geometrical', 'framework', 'that', 'makes', 'it', 'possible', 'to', 'obtain', 'globally', 'optimal', 'pulses', 'subject', 'to', 'a', 'set', 'of', 'experimental', 'constraints', 'by', 'solving', 'certain', 'geometrical', 'optimization', 'problems', 'in', 'this', 'work', 'we', 'solve', 'such', 'a', 'geometrical', 'optimization', 'problem', 'to', 'find', 'the', 'fastest', 'possible', 'pulses', 'that', 'implement', 'singlequbit', 'gates', 'while', 'cancelling', 'transverse', 'quasistatic', 'noise', 'to', 'second', 'order', 'because', 'the', 'timeoptimized', 'pulses', 'are', 'not', 'smooth', 'we', 'provide', 'a', 'method', 'based', 'on', 'our', 'geometrical', 'approach', 'to', 'obtain', 'experimentally', 'feasible', 'smooth', 'pulses', 'that', 'approximate', 'the', 'timeoptimal', 'ones', 'with', 'minimal', 'loss', 'in', 'gate', 'speed', 'we', 'show', 'that', 'in', 'the', 'presence', 'of', 'realistic', 'constraints', 'on', 'pulse', 'rise', 'times', 'our', 'smooth', 'pulses', 'significantly', 'outperform', 'sequences', 'based', 'on', 'ideal', 'pulse', 'shapes', 'highlighting', 'the', 'benefits', 'of', 'building', 'experimental', 'waveform', 'constraints', 'directly', 'into', 'dynamically', 'corrected', 'gate', 'designs']] | [-0.14949837109524305, 0.10005905995130089, -0.06487601717382639, 0.05285515429344601, -0.07678765274205623, -0.18835689882737594, 0.07593116763426544, 0.437937477073929, -0.2569462452339684, -0.31362286176286885, 0.07135002878443389, -0.18200911966838187, -0.15207337812970873, 0.2836414641792794, -0.09656076908628405, 0.11386680958126058, 0.08385584660508967, -0.044942003651618045, -0.09293209326966502, -0.25567515232283006, 0.25213608276265276, 0.03931715505537935, 0.2850812650554312, 0.014850920740422885, 0.14598370621308357, 0.011001985508610833, 0.03396345372055913, -0.014363370700496259, -0.10955707601129729, 0.09268012345489626, 0.2519089598362181, 0.11721952645374197, 0.24778022052167537, -0.4625252914045052, -0.2241920733043686, 0.1037071201474416, 0.11935499608312007, 0.1804057488161661, -0.06765964810907903, -0.27736902427296717, 0.06953801757113619, -0.1353414878428269, -0.09504129223341307, -0.13432716468338224, 0.020967593623816477, 0.010323952920581367, -0.30390569061337674, 0.02776188600378541, 0.06316777536003329, -0.01390419883018994, -0.038972498216425774, -0.030625463378293298, 0.040340243719753574, 0.11339015357073519, -0.01999461124037075, 0.05571095597774179, 0.16848080212110908, -0.11083486047093655, -0.13257054876597538, 0.3670807045444355, -0.010690522764599626, -0.2060033556414195, 0.1269787890263475, -0.09505039486512132, -0.09092661456184482, 0.15377175757293027, 0.17726922768058131, 0.12439384953384953, -0.16507243211278794, 0.04389689062628639, 0.024530409533366725, 0.2115792211191217, 0.062211065574876635, 0.09942711338881853, 0.18347565625579312, 0.15245093924126454, 0.13082348275162115, 0.1511372151364992, -0.03870169179140498, -0.11948128513688641, -0.3078503883648459, -0.08410843140906193, -0.17038646606238467, 0.0409425850075722, -0.06362526286462165, -0.15568828254178227, 0.41763069147530657, 0.2043010480753095, 0.16211951384192927, 0.06193094545732902, 0.36149982708905426, 0.08674473158452611, 0.054916701443009794, 0.06737988094983438, 0.23813568789685902, 0.1223605739165118, 0.050063272535795816, -0.25180020396470393, 0.033289982470015966, 0.0015344131937196765] |
1,802.10242 | Structural Disorder and Elementary Magnetic Properties of Triangular
Lattice ErMgGaO4 Single Crystals | The single crystal growth, structure, and basic magnetic properties of
ErMgGaO4 are reported. The structure consists of triangular layers of magnetic
ErO6 octahedra separated by a double layer of randomly occupied non-magnetic
(Ga,Mg)O5 bipyramids. The Er atoms are positionally disordered. Magnetic
measurements parallel and perpendicular to the c axis of a single crystal
reveal dominantly antiferromagnetic interactions, with a small degree of
magnetic anisotropy. A weighted average of the directional data suggests an
antiferromagnetic Curie Weiss temperature of approximately -30 K. Below 10 K
the temperature dependences of the inverse susceptibilities in the in-plane and
perpendicular-to plane directions are parallel, indicative of an isotropic
magnetic moment at low temperatures. No sign of magnetic ordering is observed
above 1.8 K, suggesting that ErMgGaO4 is a geometrically frustrated magnet.
| cond-mat.mtrl-sci | the single crystal growth structure and basic magnetic properties of ermggao4 are reported the structure consists of triangular layers of magnetic ero6 octahedra separated by a double layer of randomly occupied nonmagnetic gamgo5 bipyramids the er atoms are positionally disordered magnetic measurements parallel and perpendicular to the c axis of a single crystal reveal dominantly antiferromagnetic interactions with a small degree of magnetic anisotropy a weighted average of the directional data suggests an antiferromagnetic curie weiss temperature of approximately 30 k below 10 k the temperature dependences of the inverse susceptibilities in the inplane and perpendicularto plane directions are parallel indicative of an isotropic magnetic moment at low temperatures no sign of magnetic ordering is observed above 18 k suggesting that ermggao4 is a geometrically frustrated magnet | [['the', 'single', 'crystal', 'growth', 'structure', 'and', 'basic', 'magnetic', 'properties', 'of', 'ermggao4', 'are', 'reported', 'the', 'structure', 'consists', 'of', 'triangular', 'layers', 'of', 'magnetic', 'ero6', 'octahedra', 'separated', 'by', 'a', 'double', 'layer', 'of', 'randomly', 'occupied', 'nonmagnetic', 'gamgo5', 'bipyramids', 'the', 'er', 'atoms', 'are', 'positionally', 'disordered', 'magnetic', 'measurements', 'parallel', 'and', 'perpendicular', 'to', 'the', 'c', 'axis', 'of', 'a', 'single', 'crystal', 'reveal', 'dominantly', 'antiferromagnetic', 'interactions', 'with', 'a', 'small', 'degree', 'of', 'magnetic', 'anisotropy', 'a', 'weighted', 'average', 'of', 'the', 'directional', 'data', 'suggests', 'an', 'antiferromagnetic', 'curie', 'weiss', 'temperature', 'of', 'approximately', '30', 'k', 'below', '10', 'k', 'the', 'temperature', 'dependences', 'of', 'the', 'inverse', 'susceptibilities', 'in', 'the', 'inplane', 'and', 'perpendicularto', 'plane', 'directions', 'are', 'parallel', 'indicative', 'of', 'an', 'isotropic', 'magnetic', 'moment', 'at', 'low', 'temperatures', 'no', 'sign', 'of', 'magnetic', 'ordering', 'is', 'observed', 'above', '18', 'k', 'suggesting', 'that', 'ermggao4', 'is', 'a', 'geometrically', 'frustrated', 'magnet']] | [-0.24900258562506605, 0.2880856141213759, 0.05924628316338907, -0.028493366633602954, -0.07147626339106775, -0.11790502568149604, 0.05160550079852358, 0.434288022364108, -0.31584714250791757, -0.3219300572470319, -0.019755715035764714, -0.35663485181991195, -0.02147706051845653, 0.13727497151426848, 0.13925462029492636, -0.06781049563213572, -0.06190098644058663, 0.04579417422732537, -0.11528040214296674, -0.21727131165345304, 0.22292958911447253, 0.04118628404294064, 0.3071754385381326, 0.04513291957727099, 0.06747661758172249, -0.004239545989310232, 0.14033464820326505, 0.057435448151692506, -0.1251727590115181, 0.050376942049192845, 0.20527787047789478, -0.12722684921635713, 0.15800587440932506, -0.3959652740035023, -0.15195746146730285, -0.0030229801052540054, 0.12073318333342122, 0.07944587936513241, -0.05569997925280792, -0.2271718161569939, 0.08359996968361198, -0.04397163292515706, -0.16456304395620971, -0.05490103445099819, -0.01963233256132388, 0.037818006135343925, -0.282271858385848, 0.15056368490284094, 0.13314047556839975, 0.20597733421915318, -0.10853209781849787, -0.17523420925469702, -0.10179914688294539, 0.0038719880890834037, 0.03979139813588413, 0.10744873848438385, 0.17745300864831345, -0.06994893131624969, -0.11841511790598666, 0.3343616198198717, -0.022354873752252, -0.043138748775312645, 0.11542102925433609, -0.21105455570533627, -0.08499579974373833, 0.24097336411521939, 0.11715453476015264, 0.09773133989026556, -0.12391263903137754, 0.07534016198626543, -0.03810181173583737, 0.20839860897938736, 0.040143189215116566, -0.00729953093152707, 0.29139108006216463, 0.16027784678745313, 0.046863290511804524, 0.19000339816652667, -0.16377887872169863, -0.05312802551741727, -0.20192724709937226, -0.13557165064925297, -0.21944661285312175, 0.051543613428204155, -0.1615462922373048, -0.21643927498705318, 0.3474553622855026, 0.07804053697399184, 0.22788030740453816, -0.09486973337519229, 0.2299231003634021, 0.02104362874333823, 0.08252612696903315, 0.08583248499017514, 0.236771657765217, 0.2695453273395809, 0.13882117957586698, -0.243783313525291, 0.09160620949734918, -0.02460171715890775] |
1,802.10243 | Absolute continuity of spectral shift | In this paper we develop the method of double operator integrals to prove
trace formulae for functions of contractions, dissipative operators, unitary
operators and self-adjoint operators. To establish the absolute continuity of
spectral shift, we use the Sz.-Nagy theorem on the absolute continuity of the
spectrum of the minimal unitary dilation of a completely nonunitary
contraction. We also give a construction of an intermediate contraction for a
pair of contractions with trace class difference.
| math.FA math.CA math.CV math.SP | in this paper we develop the method of double operator integrals to prove trace formulae for functions of contractions dissipative operators unitary operators and selfadjoint operators to establish the absolute continuity of spectral shift we use the sznagy theorem on the absolute continuity of the spectrum of the minimal unitary dilation of a completely nonunitary contraction we also give a construction of an intermediate contraction for a pair of contractions with trace class difference | [['in', 'this', 'paper', 'we', 'develop', 'the', 'method', 'of', 'double', 'operator', 'integrals', 'to', 'prove', 'trace', 'formulae', 'for', 'functions', 'of', 'contractions', 'dissipative', 'operators', 'unitary', 'operators', 'and', 'selfadjoint', 'operators', 'to', 'establish', 'the', 'absolute', 'continuity', 'of', 'spectral', 'shift', 'we', 'use', 'the', 'sznagy', 'theorem', 'on', 'the', 'absolute', 'continuity', 'of', 'the', 'spectrum', 'of', 'the', 'minimal', 'unitary', 'dilation', 'of', 'a', 'completely', 'nonunitary', 'contraction', 'we', 'also', 'give', 'a', 'construction', 'of', 'an', 'intermediate', 'contraction', 'for', 'a', 'pair', 'of', 'contractions', 'with', 'trace', 'class', 'difference']] | [-0.12839954124914632, 0.13367432451284272, -0.11171508056891931, 0.07207151235874139, -0.050678870665865974, -0.06894407035606737, 0.04204017354483792, 0.3423336642932751, -0.3164965746974623, -0.16077871263228558, 0.11500575184048079, -0.26123025633294034, -0.13041496641833233, 0.16929337894544005, -0.09446306014433503, 0.058351153709195754, 0.06649350032613084, 0.06632996495259372, -0.21397789725026972, -0.17271208383042264, 0.44254786199009094, -0.018434120883309358, 0.1689656927892183, 0.0671369373244611, 0.11741216550581157, 0.027498435795407842, -0.08077102061990346, -0.10266736509731493, -0.1167870348168386, 0.16529255680035096, 0.21398290658268976, 0.0944388148632857, 0.23338186312970277, -0.37921911294295174, -0.1356905729260541, 0.2132621089097213, 0.08082197764510843, 0.051190038296595415, -0.025500114967832593, -0.27029502779446746, 0.035696586430374835, -0.18969322398707672, -0.19369886503429026, -0.12612862760402463, 0.04440381231315031, -0.008654321342505314, -0.319418189707338, 0.10265602992267059, 0.15899062356785745, 0.0773509207080949, -0.09700921609544673, -0.04312108866744549, 0.017639378482173826, 0.10468297334060676, -0.0319833980269126, -0.03209538434355243, 0.0874114428659448, -0.03859211471422601, -0.11478220029557878, 0.30134767375735416, -0.13002814946073182, -0.20760135669764634, 0.10470383264426444, -0.1661569669581572, -0.13673029195617986, 0.03561769104940263, 0.10230264201055507, 0.18098834509382378, -0.14481320271167802, 0.1465209667072191, -0.04556520607297283, 0.060099499400805785, 0.08447043834304488, 0.0852781391979472, 0.06754669856368187, 0.023558712759483104, 0.1767224795940156, 0.15629267346466313, 0.039746267107516726, -0.07163254287395929, -0.44294034347340866, -0.22924533879071335, -0.13279277728115385, 0.09417730357145539, -0.11916083868296433, -0.26310537861207045, 0.4344575300126815, 0.10167161000238077, 0.21986894298193826, 0.14384827222926794, 0.21404691389132594, 0.20642681525567094, 0.1138797075538015, 0.03021938801818603, 0.18483244681202277, 0.25339232337333867, 0.05967290748781493, -0.23445438380617448, -0.03354941134819308, 0.2521209487616009] |
1,802.10244 | RACORN-K: Risk-Aversion Pattern Matching-based Portfolio Selection | Portfolio selection is the central task for assets management, but it turns
out to be very challenging. Methods based on pattern matching, particularly the
CORN-K algorithm, have achieved promising performance on several stock markets.
A key shortage of the existing pattern matching methods, however, is that the
risk is largely ignored when optimizing portfolios, which may lead to
unreliable profits, particularly in volatile markets. We present a
risk-aversion CORN-K algorithm, RACORN-K, that penalizes risk when searching
for optimal portfolios. Experiments on four datasets (DJIA, MSCI, SP500(N),
HSI) demonstrate that the new algorithm can deliver notable and reliable
improvements in terms of return, Sharp ratio and maximum drawdown, especially
on volatile markets.
| q-fin.RM | portfolio selection is the central task for assets management but it turns out to be very challenging methods based on pattern matching particularly the cornk algorithm have achieved promising performance on several stock markets a key shortage of the existing pattern matching methods however is that the risk is largely ignored when optimizing portfolios which may lead to unreliable profits particularly in volatile markets we present a riskaversion cornk algorithm racornk that penalizes risk when searching for optimal portfolios experiments on four datasets djia msci sp500n hsi demonstrate that the new algorithm can deliver notable and reliable improvements in terms of return sharp ratio and maximum drawdown especially on volatile markets | [['portfolio', 'selection', 'is', 'the', 'central', 'task', 'for', 'assets', 'management', 'but', 'it', 'turns', 'out', 'to', 'be', 'very', 'challenging', 'methods', 'based', 'on', 'pattern', 'matching', 'particularly', 'the', 'cornk', 'algorithm', 'have', 'achieved', 'promising', 'performance', 'on', 'several', 'stock', 'markets', 'a', 'key', 'shortage', 'of', 'the', 'existing', 'pattern', 'matching', 'methods', 'however', 'is', 'that', 'the', 'risk', 'is', 'largely', 'ignored', 'when', 'optimizing', 'portfolios', 'which', 'may', 'lead', 'to', 'unreliable', 'profits', 'particularly', 'in', 'volatile', 'markets', 'we', 'present', 'a', 'riskaversion', 'cornk', 'algorithm', 'racornk', 'that', 'penalizes', 'risk', 'when', 'searching', 'for', 'optimal', 'portfolios', 'experiments', 'on', 'four', 'datasets', 'djia', 'msci', 'sp500n', 'hsi', 'demonstrate', 'that', 'the', 'new', 'algorithm', 'can', 'deliver', 'notable', 'and', 'reliable', 'improvements', 'in', 'terms', 'of', 'return', 'sharp', 'ratio', 'and', 'maximum', 'drawdown', 'especially', 'on', 'volatile', 'markets']] | [-0.07838503415174086, -0.004613577353411189, -0.09196542920196586, 0.14984452820689825, -0.08052168386796855, -0.17705696480453154, 0.10627018465991263, 0.4596049474012629, -0.23471089781514395, -0.29187389597077484, 0.19028665268332393, -0.28780839295848926, -0.16278742258567538, 0.2561054584161143, -0.1996322420260338, 0.0696988804744574, 0.1218661977974785, -0.028527244977722657, 0.04396704646810959, -0.3442509058410319, 0.24076293917181335, 0.11337093496259963, 0.37453199478266674, 0.09071289759703746, 0.08253392591315244, -0.04854550782730368, -0.03821312422237455, 0.02817490762186663, -0.05409960783728361, 0.17421850775886397, 0.3495280860148579, 0.15156489899643114, 0.3687549299238441, -0.390994436603701, -0.13920582523874103, 0.16259081474566292, 0.09249632501274034, 0.028038331277142975, -0.029891962477084352, -0.21205809218025654, 0.03268004453384152, -0.1733793210301866, 0.0012651830821876874, -0.14707924508289477, 0.02039746473169076, -0.02096831771244826, -0.3415645776995432, 0.07004711498663038, -0.013080324185576952, 0.02180527390424754, -0.0036484067041043923, -0.21882989839215494, 0.010688338225280918, 0.12035855826993569, 0.1489492059297964, -0.029986944340091096, 0.15237335620500217, -0.13963908535889655, -0.16678593683744145, 0.4104089314622857, -0.06937562615967521, -0.1509553749836703, 0.1383783732101356, -0.07958484567684408, -0.15668235987285586, 0.15470624782545406, 0.22006542272169458, 0.08821710870627349, -0.19382418301875842, -0.0026294068252737416, -0.04254903927201701, 0.17980238402732343, 0.08894995880905086, 0.01660816976800561, 0.2039858879386578, 0.2256386374193026, 0.18965605974021132, 0.11129148868369548, -0.07522373894560282, -0.14637564148788698, -0.1688258292295733, -0.07946597592998732, -0.17481048284076747, -0.018267987017458843, -0.17571826750455016, -0.1686673992956449, 0.34308289278463994, 0.2051497043478172, 0.11547454183803714, 0.07755575853804667, 0.3170763442345033, 0.09165936552649626, 0.051429664837979824, 0.10722443975984754, 0.20872103667461148, -0.0655037755076991, 0.12493269420533537, -0.1961400980482348, 0.2353211245064354, -0.012995696961705652] |
1,802.10245 | Sample size for a non-inferiority clinical trial with time-to-event data
in the presence of competing risks | The analysis and planning methods for competing risks model have been
described in the literatures in recent decades, and non-inferiority clinical
trials are helpful in current pharmaceutical practice. Analytical methods for
non-inferiority clinical trials in the presence of competing risks were
investigated by Parpia et al., who indicated that the proportional
sub-distribution hazard model is appropriate in the context of biological
studies. However, the analytical methods of competing risks model differ from
those appropriate for analyzing non-inferiority clinical trials with a single
outcome; thus, a corresponding method for planning such trials is necessary. A
sample size formula for non-inferiority clinical trials in the presence of
competing risks based on the proportional sub-distribution hazard model is
presented in this paper. The primary endpoint relies on the sub-distribution
hazard ratio. A total of 120 simulations and an example based on a randomized
controlled trial verified the empirical performance of the presented formula.
The results demonstrate that the empirical power of sample size formulas based
on the Weibull distribution for non-inferiority clinical trials with competing
risks can reach the targeted power.
| stat.AP stat.ME | the analysis and planning methods for competing risks model have been described in the literatures in recent decades and noninferiority clinical trials are helpful in current pharmaceutical practice analytical methods for noninferiority clinical trials in the presence of competing risks were investigated by parpia et al who indicated that the proportional subdistribution hazard model is appropriate in the context of biological studies however the analytical methods of competing risks model differ from those appropriate for analyzing noninferiority clinical trials with a single outcome thus a corresponding method for planning such trials is necessary a sample size formula for noninferiority clinical trials in the presence of competing risks based on the proportional subdistribution hazard model is presented in this paper the primary endpoint relies on the subdistribution hazard ratio a total of 120 simulations and an example based on a randomized controlled trial verified the empirical performance of the presented formula the results demonstrate that the empirical power of sample size formulas based on the weibull distribution for noninferiority clinical trials with competing risks can reach the targeted power | [['the', 'analysis', 'and', 'planning', 'methods', 'for', 'competing', 'risks', 'model', 'have', 'been', 'described', 'in', 'the', 'literatures', 'in', 'recent', 'decades', 'and', 'noninferiority', 'clinical', 'trials', 'are', 'helpful', 'in', 'current', 'pharmaceutical', 'practice', 'analytical', 'methods', 'for', 'noninferiority', 'clinical', 'trials', 'in', 'the', 'presence', 'of', 'competing', 'risks', 'were', 'investigated', 'by', 'parpia', 'et', 'al', 'who', 'indicated', 'that', 'the', 'proportional', 'subdistribution', 'hazard', 'model', 'is', 'appropriate', 'in', 'the', 'context', 'of', 'biological', 'studies', 'however', 'the', 'analytical', 'methods', 'of', 'competing', 'risks', 'model', 'differ', 'from', 'those', 'appropriate', 'for', 'analyzing', 'noninferiority', 'clinical', 'trials', 'with', 'a', 'single', 'outcome', 'thus', 'a', 'corresponding', 'method', 'for', 'planning', 'such', 'trials', 'is', 'necessary', 'a', 'sample', 'size', 'formula', 'for', 'noninferiority', 'clinical', 'trials', 'in', 'the', 'presence', 'of', 'competing', 'risks', 'based', 'on', 'the', 'proportional', 'subdistribution', 'hazard', 'model', 'is', 'presented', 'in', 'this', 'paper', 'the', 'primary', 'endpoint', 'relies', 'on', 'the', 'subdistribution', 'hazard', 'ratio', 'a', 'total', 'of', '120', 'simulations', 'and', 'an', 'example', 'based', 'on', 'a', 'randomized', 'controlled', 'trial', 'verified', 'the', 'empirical', 'performance', 'of', 'the', 'presented', 'formula', 'the', 'results', 'demonstrate', 'that', 'the', 'empirical', 'power', 'of', 'sample', 'size', 'formulas', 'based', 'on', 'the', 'weibull', 'distribution', 'for', 'noninferiority', 'clinical', 'trials', 'with', 'competing', 'risks', 'can', 'reach', 'the', 'targeted', 'power']] | [-0.036963503595341604, 0.04944267872423999, -0.05545174751935874, 0.09874520036602383, -0.036146599991447, -0.12683239167340438, 0.0956636391531434, 0.3857577021133765, -0.1393533868972991, -0.2951807127686712, 0.12711765797937677, -0.2797576588036566, -0.14078883207166346, 0.2678108714089471, -0.12902824927901121, 0.10186854780435899, 0.0688132967926183, 0.0015735992067361956, -0.0072843623926368475, -0.31046705536733743, 0.2571062564765666, 0.08056052264594342, 0.37451913431918216, 0.017637679568428734, 0.031366060608945326, 0.028759330495308013, -0.07248788751335551, 0.016408477765165984, -0.13059887090360148, 0.09563479595686082, 0.311427966738909, 0.2024095383049173, 0.3769008893924792, -0.4225614414898788, -0.2350198293715126, 0.12956906095315507, 0.0945645998768761, 0.04678856133678033, -0.035097694090214994, -0.2910036263266568, 0.010288432614067517, -0.20728719543197355, -0.09986973636767875, -0.06492547045256626, 0.00960193568640678, 0.07980997042959335, -0.3747858021218898, 0.1309587500336985, 0.0018509484932423795, 0.13168651500643141, -0.06120492699871755, -0.21036761128843504, 0.05820965777956328, 0.1192943746464769, 0.14105000031854178, 0.0018814619956801168, 0.1362429035111925, -0.12320256554837322, -0.18948136761226814, 0.30038406167410864, 0.04743042966287773, -0.18711067329813322, 0.14776402055601573, -0.0871633447911906, -0.10672928860916173, 0.10068863950206736, 0.19461113214492798, 0.1080346183277835, -0.18910590808123012, 0.0233970077588413, 0.004141696791906478, 0.13346255858926007, 0.012530193429987478, -0.08373941442045241, 0.14952469567273674, 0.20003749314421987, -0.0007323184284765673, 0.1300591270762922, -0.0986393580849856, -0.14451399762321548, -0.2814834001737168, -0.12280207915668308, -0.16919283390947548, -0.017296561952233103, -0.11000540096677464, -0.16299496997821297, 0.36083907370934376, 0.19600981872497222, 0.11531835642648534, 0.06417218494192187, 0.3177359113568377, 0.07832623926638546, 0.04960265460471481, -0.009045480918875859, 0.18821429966627962, 0.042967090654150074, 0.040124064311385155, -0.2300222805356472, 0.21519827896513383, -0.020921445051786926] |
1,802.10246 | KMT-2016-BLG-0212: First KMTNet-Only Discovery of a Substellar Companion | We present the analysis of KMT-2016-BLG-0212, a low flux-variation $(I_{\rm
flux-var}\sim 20$) microlensing event, which is well-covered by high-cadence
data from the three Korea Microlensing Telescope Network (KMTNet) telescopes.
The event shows a short anomaly that is incompletely covered due to the brief
visibility intervals that characterize the early microlensing season when the
anomaly occurred. We show that the data are consistent with two classes of
solutions, characterized respectively by low-mass brown-dwarf $(q=0.037)$ and
sub-Neptune $(q<10^{-4})$ companions, respectively. Future high-resolution
imaging should easily distinguish between these solutions.
| astro-ph.EP | we present the analysis of kmt2016blg0212 a low fluxvariation i_rm fluxvarsim 20 microlensing event which is wellcovered by highcadence data from the three korea microlensing telescope network kmtnet telescopes the event shows a short anomaly that is incompletely covered due to the brief visibility intervals that characterize the early microlensing season when the anomaly occurred we show that the data are consistent with two classes of solutions characterized respectively by lowmass browndwarf q0037 and subneptune q104 companions respectively future highresolution imaging should easily distinguish between these solutions | [['we', 'present', 'the', 'analysis', 'of', 'kmt2016blg0212', 'a', 'low', 'fluxvariation', 'i_rm', 'fluxvarsim', '20', 'microlensing', 'event', 'which', 'is', 'wellcovered', 'by', 'highcadence', 'data', 'from', 'the', 'three', 'korea', 'microlensing', 'telescope', 'network', 'kmtnet', 'telescopes', 'the', 'event', 'shows', 'a', 'short', 'anomaly', 'that', 'is', 'incompletely', 'covered', 'due', 'to', 'the', 'brief', 'visibility', 'intervals', 'that', 'characterize', 'the', 'early', 'microlensing', 'season', 'when', 'the', 'anomaly', 'occurred', 'we', 'show', 'that', 'the', 'data', 'are', 'consistent', 'with', 'two', 'classes', 'of', 'solutions', 'characterized', 'respectively', 'by', 'lowmass', 'browndwarf', 'q0037', 'and', 'subneptune', 'q104', 'companions', 'respectively', 'future', 'highresolution', 'imaging', 'should', 'easily', 'distinguish', 'between', 'these', 'solutions']] | [-0.16525867051747908, 0.12513876662039794, -0.06309698997710618, 0.13825516655468886, -0.12571465553076241, -0.11634654621313135, 0.019303645377597177, 0.3785404449746753, -0.16658820137830385, -0.3762181152432529, 0.1774208218543734, -0.3546546034021191, -0.155581065930471, 0.22374774464013347, -0.0895519928490541, -0.014338322892695307, 0.21975120344389992, -0.07384616268114243, -0.023963061007053917, -0.2676122100429093, 0.26985569845840157, 0.058100608525326454, 0.15606954324631447, 0.0013476825173360755, 0.07336223555843806, -0.035231398213766967, -0.11407504434955407, 0.04782646134669657, -0.14121397154737778, 0.017420137974332613, 0.29610321861523464, 0.1939551754102829, 0.15535324948828622, -0.33276143703744354, -0.18379943449252162, 0.10184184668854956, 0.11787790071825127, -0.0007292359207577285, -0.018408491006906492, -0.3514655254197767, 0.08773505794521175, -0.17722802521683365, -0.1068402577573097, 0.028218400036265332, 0.0641132237513112, 0.015397128466718707, -0.22745613761650152, 0.07118938364795442, -0.0116355552461492, 0.11387504487444298, -0.07052896391173982, -0.06646879941382143, -0.024457104224992175, 0.07219083575112464, 0.04058656201372484, 0.030934939615383565, 0.0542107621174171, -0.09598795779004514, -0.07488522686888968, 0.3335853302963527, -0.10206987682999258, 0.013894206154193863, 0.18921236687266907, -0.23241125629564008, -0.1800778699387987, 0.16657668806567608, 0.15826532177217528, 0.15070034679115177, -0.2241223070257503, -0.027331675630391027, 0.010051240942564356, 0.20243636538072612, 0.08252006670998702, 0.0008696165855929076, 0.36257176123649243, 0.1703653746783868, 0.05175591634967959, 0.081404059530651, -0.29045969171516867, -0.013291742697537664, -0.27516090697103956, -0.08619844121858478, -0.13599139061778873, 0.04501531672725701, -0.09388262158556399, -0.07660744775715003, 0.3824357056810734, 0.15875252495598363, 0.20678694678627582, 0.0616994406256533, 0.2792223226727851, 0.02950853791581579, 0.11963487827185407, 0.04847298676136836, 0.3372496261474598, 0.05208766242175038, 0.12420168483674705, -0.1878949244175645, 0.07673837041415005, 0.0015277529180229429] |
1,802.10247 | Coulomb-bound four- and five-particle valleytronic states in an
atomically-thin semiconductor | As hosts for tightly-bound electron-hole pairs carrying quantized angular
momentum, atomically-thin semiconductors of transition metal dichalcogenides
provide an appealing platform for optically addressing the valley degree of
freedom. In particular, the valleytronic properties of neutral and charged
excitons in these systems have been widely investigated. Meanwhile, correlated
quantum states involving more particles are so far elusive and controversial.
Here we present experimental evidence for valleytronic four-particle biexcitons
and five-particle exciton-trions in high-quality monolayer tungsten diselenide
samples. Through charge doping, thermal activation, and magnetic-field tuning
measurements, we determined that the biexciton and exciton-trion optical
emissions are bound with respect to the bright exciton and the trion
respectively. Further, both the biexciton and the exciton-trion are intervalley
bound states involving dark excitons, giving rise to emissions with large,
negative valley polarizations in contrast to that of the well-known
two-particle excitons. Our studies provide new opportunities for building
valleytronic quantum devices harnessing high-order excitations.
| cond-mat.mes-hall cond-mat.mtrl-sci | as hosts for tightlybound electronhole pairs carrying quantized angular momentum atomicallythin semiconductors of transition metal dichalcogenides provide an appealing platform for optically addressing the valley degree of freedom in particular the valleytronic properties of neutral and charged excitons in these systems have been widely investigated meanwhile correlated quantum states involving more particles are so far elusive and controversial here we present experimental evidence for valleytronic fourparticle biexcitons and fiveparticle excitontrions in highquality monolayer tungsten diselenide samples through charge doping thermal activation and magneticfield tuning measurements we determined that the biexciton and excitontrion optical emissions are bound with respect to the bright exciton and the trion respectively further both the biexciton and the excitontrion are intervalley bound states involving dark excitons giving rise to emissions with large negative valley polarizations in contrast to that of the wellknown twoparticle excitons our studies provide new opportunities for building valleytronic quantum devices harnessing highorder excitations | [['as', 'hosts', 'for', 'tightlybound', 'electronhole', 'pairs', 'carrying', 'quantized', 'angular', 'momentum', 'atomicallythin', 'semiconductors', 'of', 'transition', 'metal', 'dichalcogenides', 'provide', 'an', 'appealing', 'platform', 'for', 'optically', 'addressing', 'the', 'valley', 'degree', 'of', 'freedom', 'in', 'particular', 'the', 'valleytronic', 'properties', 'of', 'neutral', 'and', 'charged', 'excitons', 'in', 'these', 'systems', 'have', 'been', 'widely', 'investigated', 'meanwhile', 'correlated', 'quantum', 'states', 'involving', 'more', 'particles', 'are', 'so', 'far', 'elusive', 'and', 'controversial', 'here', 'we', 'present', 'experimental', 'evidence', 'for', 'valleytronic', 'fourparticle', 'biexcitons', 'and', 'fiveparticle', 'excitontrions', 'in', 'highquality', 'monolayer', 'tungsten', 'diselenide', 'samples', 'through', 'charge', 'doping', 'thermal', 'activation', 'and', 'magneticfield', 'tuning', 'measurements', 'we', 'determined', 'that', 'the', 'biexciton', 'and', 'excitontrion', 'optical', 'emissions', 'are', 'bound', 'with', 'respect', 'to', 'the', 'bright', 'exciton', 'and', 'the', 'trion', 'respectively', 'further', 'both', 'the', 'biexciton', 'and', 'the', 'excitontrion', 'are', 'intervalley', 'bound', 'states', 'involving', 'dark', 'excitons', 'giving', 'rise', 'to', 'emissions', 'with', 'large', 'negative', 'valley', 'polarizations', 'in', 'contrast', 'to', 'that', 'of', 'the', 'wellknown', 'twoparticle', 'excitons', 'our', 'studies', 'provide', 'new', 'opportunities', 'for', 'building', 'valleytronic', 'quantum', 'devices', 'harnessing', 'highorder', 'excitations']] | [-0.12313152752583846, 0.24443451650217562, 0.011811489595177894, 0.05859746798252066, -0.0115672941878438, -0.22179752187182505, 0.0716901045711711, 0.4539297343666355, -0.2003117792867124, -0.2914414438442327, -0.06270639580364029, -0.35460789054632186, -0.11007189836663504, 0.2042317795124836, 0.0879768312877665, 0.0430126035027206, 0.004362673601135612, -0.170321932049701, -0.02169768593274057, -0.16916130861112227, 0.26655756021228927, 0.02926039710485687, 0.3152310007531196, 0.16782641989334177, 0.04392310660022, -0.006716836451863249, 0.09678133524333438, -0.06915891169880828, -0.15560873748802503, 0.13014740988224124, 0.2927889276544253, -0.08710772851637254, 0.2107574561564252, -0.44619961437458794, -0.17458801493359108, 0.04917809698653097, 0.21981349486857651, 0.2004396129399538, -0.16892079941511232, -0.3212587745425602, 0.017336632485191027, -0.12563856056629447, -0.0950449215976793, -0.15411699183285235, 0.014216867129628857, 0.005655663989018649, -0.21976955773308873, 0.1177886816021055, 0.0028735824301838876, 0.0216813849308528, -0.07940735387276315, -0.15613429508928675, -0.10904813829964648, 0.06848287058062852, 0.012127794375022252, -0.03209081513807178, 0.19015252474385003, -0.17353206650043526, -0.2013942672436436, 0.3449077955322961, -0.023963394525150457, -0.10556610965072953, 0.18542803245907027, -0.1658568797307089, -0.07094879077437023, 0.16024906971491873, 0.13705033367926564, 0.16373476230849823, -0.12934326800207296, 0.027232420935373133, -0.029896678160876034, 0.1481651322171092, 0.06029804483366509, 0.28125678896903994, 0.2975335090762625, 0.15204013700752209, 0.03370647712921103, 0.12922015628001343, -0.09242871817201376, -0.07867321632647266, -0.18836603012479222, -0.22503502894580985, -0.22680522732126215, 0.11896689779125154, -0.00024378109655420605, -0.16225241689942776, 0.41373578193519883, 0.09536358253331854, 0.16349425677520532, -0.04931792549944172, 0.2535042280765871, 0.11352764357459819, 0.07649383841703336, 0.008259360458080968, 0.3187415550323203, 0.17777301491548617, 0.08606402578298003, -0.2618896101259937, 0.021518349399169287, -0.05038942483874659] |
1,802.10248 | M-eigenvalues of The Riemann Curvature Tensor | The Riemann curvature tensor is a central mathematical tool in Einstein's
theory of general relativity. Its related eigenproblem plays an important role
in mathematics and physics. We extend M-eigenvalues for the elasticity tensor
to the Riemann curvature tensor. The definition of M-eigenproblem of the
Riemann curvature tensor is introduced from the minimization of an associated
function. The M-eigenvalues of the Riemann curvature tensor always exist and
are real. They are invariants of the Riemann curvature tensor. The associated
function of the Riemann curvature tensor is always positive at a point if and
only if the M-eigenvalues of the Riemann curvature tensor are all positive at
that point. We investigate the M-eigenvalues for the simple cases, such as the
2D case, the 3D case, the constant curvature and the Schwarzschild solution,
and all the calculated M-eigenvalues are related to the curvature invariants.
| math.DG math.SP | the riemann curvature tensor is a central mathematical tool in einsteins theory of general relativity its related eigenproblem plays an important role in mathematics and physics we extend meigenvalues for the elasticity tensor to the riemann curvature tensor the definition of meigenproblem of the riemann curvature tensor is introduced from the minimization of an associated function the meigenvalues of the riemann curvature tensor always exist and are real they are invariants of the riemann curvature tensor the associated function of the riemann curvature tensor is always positive at a point if and only if the meigenvalues of the riemann curvature tensor are all positive at that point we investigate the meigenvalues for the simple cases such as the 2d case the 3d case the constant curvature and the schwarzschild solution and all the calculated meigenvalues are related to the curvature invariants | [['the', 'riemann', 'curvature', 'tensor', 'is', 'a', 'central', 'mathematical', 'tool', 'in', 'einsteins', 'theory', 'of', 'general', 'relativity', 'its', 'related', 'eigenproblem', 'plays', 'an', 'important', 'role', 'in', 'mathematics', 'and', 'physics', 'we', 'extend', 'meigenvalues', 'for', 'the', 'elasticity', 'tensor', 'to', 'the', 'riemann', 'curvature', 'tensor', 'the', 'definition', 'of', 'meigenproblem', 'of', 'the', 'riemann', 'curvature', 'tensor', 'is', 'introduced', 'from', 'the', 'minimization', 'of', 'an', 'associated', 'function', 'the', 'meigenvalues', 'of', 'the', 'riemann', 'curvature', 'tensor', 'always', 'exist', 'and', 'are', 'real', 'they', 'are', 'invariants', 'of', 'the', 'riemann', 'curvature', 'tensor', 'the', 'associated', 'function', 'of', 'the', 'riemann', 'curvature', 'tensor', 'is', 'always', 'positive', 'at', 'a', 'point', 'if', 'and', 'only', 'if', 'the', 'meigenvalues', 'of', 'the', 'riemann', 'curvature', 'tensor', 'are', 'all', 'positive', 'at', 'that', 'point', 'we', 'investigate', 'the', 'meigenvalues', 'for', 'the', 'simple', 'cases', 'such', 'as', 'the', '2d', 'case', 'the', '3d', 'case', 'the', 'constant', 'curvature', 'and', 'the', 'schwarzschild', 'solution', 'and', 'all', 'the', 'calculated', 'meigenvalues', 'are', 'related', 'to', 'the', 'curvature', 'invariants']] | [-0.1754878688636901, 0.09979674444454889, -0.06457449444902262, 0.09575966438195402, -0.1017613529992689, -0.11551084316202573, -0.1493104923757658, 0.28943201293170984, -0.2983105677612392, -0.19073585734835694, 0.13558065801958685, -0.2897732360288501, -0.22755236279751573, 0.1435438477741887, -0.023245664316761706, 0.041058626654142116, -0.002042735966720751, 0.09968951456913991, -0.10106600754661485, -0.23734023839102258, 0.43269966389551495, 0.04735738250559994, 0.23952654133983223, 0.15555904408185078, 0.09948754091081875, -0.04452780793487494, -0.02133122084196657, 0.05986232199365986, -0.12589904503324112, 0.1077142223516213, 0.23822033719625324, 0.09730649707572801, 0.23271672282634037, -0.4248728297517768, -0.21215064120478927, 0.1278180494438857, 0.021425662681992565, 0.040077173031334366, 0.010577755512869252, -0.24014903922631806, 0.11337746691757015, -0.08881866794212588, -0.15921036460702973, -0.08265342490548001, 0.014410398525485237, -0.07353641557108079, -0.17310641298868826, 0.1152896084224007, 0.0657041752461477, 0.011312169005395844, -0.13470395819500222, -0.1663363235719901, -0.06556972065674407, 0.11087451414205134, 0.13443903661100193, 0.05424148710278262, 0.08975306930286543, -0.15110261418989726, -0.0345725512730756, 0.39638295006006957, -0.09232578996036733, -0.3182972443689193, 0.0994364601559937, -0.12034425414333652, -0.1137569140260374, 0.08910357144528201, 0.13715472735930234, 0.17971199956456466, -0.04067594902257302, 0.1825797487694737, -0.03544571605910148, 0.06474982411642226, 0.1021156474282699, -0.058618262521174205, 0.23299239092905608, 0.013786124258435199, 0.0783791398188831, 0.12199103880141463, -0.05244478596557331, -0.11680042926621224, -0.41662389049306514, -0.27358463395420196, -0.23512277442995191, 0.11816962429189257, -0.1874490777856928, -0.23837550449783781, 0.4161088110479925, 0.048623862155779664, 0.10721996492107531, 0.1328575959695237, 0.2512650913359331, 0.12783470904437957, 0.052419832839430976, 0.0933436439106507, 0.27798588482130854, 0.2389856620242686, 0.07339615596990501, -0.16918116151479937, 0.000996863582570638, 0.14653692131063767] |
1,802.10249 | IM2HEIGHT: Height Estimation from Single Monocular Imagery via Fully
Residual Convolutional-Deconvolutional Network | In this paper we tackle a very novel problem, namely height estimation from a
single monocular remote sensing image, which is inherently ambiguous, and a
technically ill-posed problem, with a large source of uncertainty coming from
the overall scale. We propose a fully convolutional-deconvolutional network
architecture being trained end-to-end, encompassing residual learning, to model
the ambiguous mapping between monocular remote sensing images and height maps.
Specifically, it is composed of two parts, i.e., convolutional sub-network and
deconvolutional sub-network. The former corresponds to feature extractor that
transforms the input remote sensing image to high-level multidimensional
feature representation, whereas the latter plays the role of a height generator
that produces height map from the feature extracted from the convolutional
sub-network. Moreover, to preserve fine edge details of estimated height maps,
we introduce a skip connection to the network, which is able to shuttle
low-level visual information, e.g., object boundaries and edges, directly
across the network. To demonstrate the usefulness of single-view height
prediction, we show a practical example of instance segmentation of buildings
using estimated height map. This paper, for the first time in the remote
sensing community, attempts to estimate height from monocular vision. The
proposed network is validated using a large-scale high resolution aerial image
data set covered an area of Berlin. Both visual and quantitative analysis of
the experimental results demonstrate the effectiveness of our approach.
| cs.CV | in this paper we tackle a very novel problem namely height estimation from a single monocular remote sensing image which is inherently ambiguous and a technically illposed problem with a large source of uncertainty coming from the overall scale we propose a fully convolutionaldeconvolutional network architecture being trained endtoend encompassing residual learning to model the ambiguous mapping between monocular remote sensing images and height maps specifically it is composed of two parts ie convolutional subnetwork and deconvolutional subnetwork the former corresponds to feature extractor that transforms the input remote sensing image to highlevel multidimensional feature representation whereas the latter plays the role of a height generator that produces height map from the feature extracted from the convolutional subnetwork moreover to preserve fine edge details of estimated height maps we introduce a skip connection to the network which is able to shuttle lowlevel visual information eg object boundaries and edges directly across the network to demonstrate the usefulness of singleview height prediction we show a practical example of instance segmentation of buildings using estimated height map this paper for the first time in the remote sensing community attempts to estimate height from monocular vision the proposed network is validated using a largescale high resolution aerial image data set covered an area of berlin both visual and quantitative analysis of the experimental results demonstrate the effectiveness of our approach | [['in', 'this', 'paper', 'we', 'tackle', 'a', 'very', 'novel', 'problem', 'namely', 'height', 'estimation', 'from', 'a', 'single', 'monocular', 'remote', 'sensing', 'image', 'which', 'is', 'inherently', 'ambiguous', 'and', 'a', 'technically', 'illposed', 'problem', 'with', 'a', 'large', 'source', 'of', 'uncertainty', 'coming', 'from', 'the', 'overall', 'scale', 'we', 'propose', 'a', 'fully', 'convolutionaldeconvolutional', 'network', 'architecture', 'being', 'trained', 'endtoend', 'encompassing', 'residual', 'learning', 'to', 'model', 'the', 'ambiguous', 'mapping', 'between', 'monocular', 'remote', 'sensing', 'images', 'and', 'height', 'maps', 'specifically', 'it', 'is', 'composed', 'of', 'two', 'parts', 'ie', 'convolutional', 'subnetwork', 'and', 'deconvolutional', 'subnetwork', 'the', 'former', 'corresponds', 'to', 'feature', 'extractor', 'that', 'transforms', 'the', 'input', 'remote', 'sensing', 'image', 'to', 'highlevel', 'multidimensional', 'feature', 'representation', 'whereas', 'the', 'latter', 'plays', 'the', 'role', 'of', 'a', 'height', 'generator', 'that', 'produces', 'height', 'map', 'from', 'the', 'feature', 'extracted', 'from', 'the', 'convolutional', 'subnetwork', 'moreover', 'to', 'preserve', 'fine', 'edge', 'details', 'of', 'estimated', 'height', 'maps', 'we', 'introduce', 'a', 'skip', 'connection', 'to', 'the', 'network', 'which', 'is', 'able', 'to', 'shuttle', 'lowlevel', 'visual', 'information', 'eg', 'object', 'boundaries', 'and', 'edges', 'directly', 'across', 'the', 'network', 'to', 'demonstrate', 'the', 'usefulness', 'of', 'singleview', 'height', 'prediction', 'we', 'show', 'a', 'practical', 'example', 'of', 'instance', 'segmentation', 'of', 'buildings', 'using', 'estimated', 'height', 'map', 'this', 'paper', 'for', 'the', 'first', 'time', 'in', 'the', 'remote', 'sensing', 'community', 'attempts', 'to', 'estimate', 'height', 'from', 'monocular', 'vision', 'the', 'proposed', 'network', 'is', 'validated', 'using', 'a', 'largescale', 'high', 'resolution', 'aerial', 'image', 'data', 'set', 'covered', 'an', 'area', 'of', 'berlin', 'both', 'visual', 'and', 'quantitative', 'analysis', 'of', 'the', 'experimental', 'results', 'demonstrate', 'the', 'effectiveness', 'of', 'our', 'approach']] | [-0.07237560687574357, -0.0034556338241880777, -0.05380166049339985, 0.029022823475580252, -0.0747955893679206, -0.16193176590348285, 0.014527716880586277, 0.4367238141530673, -0.34080064372212876, -0.33820387277144953, 0.0938093783531342, -0.2532530735677112, -0.20819132168605997, 0.17238145791063914, -0.15390874710526842, 0.08364659261690773, 0.14168042958753044, 0.052057190584880404, -0.04144976725637716, -0.17722265657226222, 0.30895000979886905, 0.07342719360734726, 0.33140160094142485, 0.02242201501975402, 0.167385245335395, -0.005042096560255271, -0.059664780235313915, -0.01370892109398603, -0.055197313573893, 0.21258955272755664, 0.306704509554078, 0.1595438099717557, 0.27431353102622774, -0.411006984928631, -0.23736339877667276, 0.06552211598530083, 0.13575379071660526, 0.0965931483617233, -0.0318437574353348, -0.36128357551286266, 0.08074228140978873, -0.13777309017756437, -0.0014402063343969343, -0.04351732325596563, -0.010536826941357014, -0.0600550163467974, -0.2966467473355413, 0.040282436892685645, 0.04740415189501374, 0.0711293755384318, -0.07387908227948907, -0.05640537091243668, -0.009528654354669581, 0.23250384639439867, -0.02556202002536374, 0.07612275065380325, 0.18061035574877446, -0.18426510899549242, -0.06840914422143579, 0.344261737704474, -0.03720911702814016, -0.169174066163181, 0.17324290576797094, -0.0512173424745676, -0.12888390081832063, 0.1335119580396652, 0.20084356917847884, 0.10068924069950266, -0.13482870191124388, 0.02138354663715579, -0.08147155331388231, 0.22511076733176616, 0.062262131381238345, -0.01753807840827803, 0.1953859930567747, 0.23895468245289136, 0.08367872863083807, 0.1816586622514963, -0.22374071250156816, -0.04874231236820655, -0.23747255766481193, -0.1051443017442764, -0.2194923327923937, -0.03806505086862519, -0.0939569588119676, -0.16744262433230328, 0.4214264492930984, 0.23911395534208366, 0.2630856305931075, 0.09561839166991228, 0.37753011866386504, 0.02162787138330822, 0.11119855714075694, 0.06566912061734831, 0.1580016993515456, 0.05629727726654531, 0.11247875442162222, -0.15055728813383054, 0.06081461306509566, 0.0882445769846062] |
1,802.1025 | Joint Event Detection and Description in Continuous Video Streams | Dense video captioning is a fine-grained video understanding task that
involves two sub-problems: localizing distinct events in a long video stream,
and generating captions for the localized events. We propose the Joint Event
Detection and Description Network (JEDDi-Net), which solves the dense video
captioning task in an end-to-end fashion. Our model continuously encodes the
input video stream with three-dimensional convolutional layers, proposes
variable-length temporal events based on pooled features, and generates their
captions. Proposal features are extracted within each proposal segment through
3D Segment-of-Interest pooling from shared video feature encoding. In order to
explicitly model temporal relationships between visual events and their
captions in a single video, we also propose a two-level hierarchical captioning
module that keeps track of context. On the large-scale ActivityNet Captions
dataset, JEDDi-Net demonstrates improved results as measured by standard
metrics. We also present the first dense captioning results on the
TACoS-MultiLevel dataset.
| cs.CV | dense video captioning is a finegrained video understanding task that involves two subproblems localizing distinct events in a long video stream and generating captions for the localized events we propose the joint event detection and description network jeddinet which solves the dense video captioning task in an endtoend fashion our model continuously encodes the input video stream with threedimensional convolutional layers proposes variablelength temporal events based on pooled features and generates their captions proposal features are extracted within each proposal segment through 3d segmentofinterest pooling from shared video feature encoding in order to explicitly model temporal relationships between visual events and their captions in a single video we also propose a twolevel hierarchical captioning module that keeps track of context on the largescale activitynet captions dataset jeddinet demonstrates improved results as measured by standard metrics we also present the first dense captioning results on the tacosmultilevel dataset | [['dense', 'video', 'captioning', 'is', 'a', 'finegrained', 'video', 'understanding', 'task', 'that', 'involves', 'two', 'subproblems', 'localizing', 'distinct', 'events', 'in', 'a', 'long', 'video', 'stream', 'and', 'generating', 'captions', 'for', 'the', 'localized', 'events', 'we', 'propose', 'the', 'joint', 'event', 'detection', 'and', 'description', 'network', 'jeddinet', 'which', 'solves', 'the', 'dense', 'video', 'captioning', 'task', 'in', 'an', 'endtoend', 'fashion', 'our', 'model', 'continuously', 'encodes', 'the', 'input', 'video', 'stream', 'with', 'threedimensional', 'convolutional', 'layers', 'proposes', 'variablelength', 'temporal', 'events', 'based', 'on', 'pooled', 'features', 'and', 'generates', 'their', 'captions', 'proposal', 'features', 'are', 'extracted', 'within', 'each', 'proposal', 'segment', 'through', '3d', 'segmentofinterest', 'pooling', 'from', 'shared', 'video', 'feature', 'encoding', 'in', 'order', 'to', 'explicitly', 'model', 'temporal', 'relationships', 'between', 'visual', 'events', 'and', 'their', 'captions', 'in', 'a', 'single', 'video', 'we', 'also', 'propose', 'a', 'twolevel', 'hierarchical', 'captioning', 'module', 'that', 'keeps', 'track', 'of', 'context', 'on', 'the', 'largescale', 'activitynet', 'captions', 'dataset', 'jeddinet', 'demonstrates', 'improved', 'results', 'as', 'measured', 'by', 'standard', 'metrics', 'we', 'also', 'present', 'the', 'first', 'dense', 'captioning', 'results', 'on', 'the', 'tacosmultilevel', 'dataset']] | [-0.10419082461198519, 0.02502335284413669, -0.04416086827241979, 0.0676646792025377, -0.07917381039905277, -0.14959313267177635, -0.020946018196727065, 0.5025083210996606, -0.2717275064099919, -0.3267333544269725, -0.011297406889237725, -0.31373628782933916, -0.1872750541156197, 0.12333101028628596, -0.17206635407230758, 0.0747832565973806, 0.20820064285596657, 0.0779437485274735, -0.044951348487365914, -0.26790113446231073, 0.2943170396936732, 0.029809640232030744, 0.36370028571675084, -0.006984175404312311, 0.2126333039690304, -0.03677171630495052, -0.1010068541496888, -0.07461197397238542, -0.024785474877844407, 0.17512795804768566, 0.3361423109899034, 0.24904896356360792, 0.2797839676088595, -0.42199118639883043, -0.23248506026095025, -0.007176028626443415, 0.16417033035451403, 0.09227581457149439, -0.07794371561775752, -0.4271235093213878, 0.11606615315145859, -0.1831771090620204, 0.12692669313400984, -0.11916261552539947, 0.0036755949389059225, -0.05096725634644394, -0.3029846356647623, 0.0701530030167375, 0.07214375400518465, 0.031102666532021615, -0.06797636569464592, 0.02696135522914933, 0.02216973136035869, 0.2257427588020536, 0.0234776079920088, 0.09424552737272807, 0.1526705098722677, -0.22129387142897056, -0.14777433820812919, 0.4018475107223421, -0.08870410093739695, -0.20008544552211577, 0.1846065419527435, -0.019078988233463955, -0.14709920914830654, 0.11316120802340182, 0.24559251614195016, 0.15186708903435123, -0.19399481244390127, -0.057444684695895316, -0.12819724487648768, 0.2429115358248379, 0.07701362222205144, 0.03287784113073266, 0.2706975762803967, 0.29121874274044474, -0.04259404286064885, 0.16334284282488085, -0.16647875077299565, -0.08142558392951382, -0.20888692250237573, -0.06155377392530103, -0.1594909863836308, -0.08134371315786888, -0.12618535386123272, -0.13911051092135324, 0.4542230594304058, 0.24216336286073173, 0.2567497425194882, 0.10698039462005107, 0.36682857152309034, -0.03568553648582966, 0.10428763872171855, 0.08966598248392525, 0.06360707490320702, -0.0934294588893157, 0.14903482696419204, -0.12381052044692442, 0.06493191168011798, 0.16685404222119937] |
1,802.10251 | Nonlinear dynamics of a semiquantum Hamiltonian in the vicinity of
quantum unstable regimes | We examine the emergence of chaos in a non-linear model derived from a
semiquantum Hamiltonian describing the coupling between a classical field and a
quantum system. The latter corresponds to a bosonic version of a BCS-like
Hamiltonian, and possesses stable and unstable regimes. The dynamics of the
whole system is shown to be strongly influenced by the quantum subsystem. In
particular, chaos is seen to arise in the vicinity of a quantum critical case,
which separates the stable and unstable regimes of the bosonic system.
| quant-ph | we examine the emergence of chaos in a nonlinear model derived from a semiquantum hamiltonian describing the coupling between a classical field and a quantum system the latter corresponds to a bosonic version of a bcslike hamiltonian and possesses stable and unstable regimes the dynamics of the whole system is shown to be strongly influenced by the quantum subsystem in particular chaos is seen to arise in the vicinity of a quantum critical case which separates the stable and unstable regimes of the bosonic system | [['we', 'examine', 'the', 'emergence', 'of', 'chaos', 'in', 'a', 'nonlinear', 'model', 'derived', 'from', 'a', 'semiquantum', 'hamiltonian', 'describing', 'the', 'coupling', 'between', 'a', 'classical', 'field', 'and', 'a', 'quantum', 'system', 'the', 'latter', 'corresponds', 'to', 'a', 'bosonic', 'version', 'of', 'a', 'bcslike', 'hamiltonian', 'and', 'possesses', 'stable', 'and', 'unstable', 'regimes', 'the', 'dynamics', 'of', 'the', 'whole', 'system', 'is', 'shown', 'to', 'be', 'strongly', 'influenced', 'by', 'the', 'quantum', 'subsystem', 'in', 'particular', 'chaos', 'is', 'seen', 'to', 'arise', 'in', 'the', 'vicinity', 'of', 'a', 'quantum', 'critical', 'case', 'which', 'separates', 'the', 'stable', 'and', 'unstable', 'regimes', 'of', 'the', 'bosonic', 'system']] | [-0.21940476332161138, 0.1833819280323737, -0.12268324573250378, 0.05493714630275088, 0.055027543117894845, -0.17585289737428814, 0.03110850843710496, 0.22753688221906915, -0.28633427947540496, -0.205737847856739, 0.05588843097417232, -0.24788580302368193, -0.18068340716554837, 0.20370213978595156, -0.012447720886591603, 0.028736803275259102, 0.028363679231637542, 0.0665183201623971, -0.056502687925582426, -0.16997304952100795, 0.344327422220479, 0.018420866505681154, 0.26068331277655327, -0.015144572012564715, 0.09984281920992276, -0.009309758056941278, 0.08179914837374407, 0.04764433577108909, -0.13087172675329972, 0.07465670811121955, 0.21370294772307663, 0.027145206517375568, 0.2500477585065014, -0.36284184521612, -0.22980844424489666, 0.08378447415307164, 0.15375136580756482, 0.16932863755672076, 0.02298893970916705, -0.319583844412666, 0.026913363645401072, -0.16900585848728525, -0.17933524785672916, -0.052146588285070135, 0.00450147278196014, -0.02048408660270712, -0.2672074929482358, 0.09237905776621226, 0.10408731682006928, 0.033766094560611665, -0.049126455472672685, 0.0274557774872793, -0.060436094752238954, 0.10809323872603914, -0.004206271914710455, 0.013558006675585228, 0.12527266415383886, -0.16341233145555153, -0.0932629324221874, 0.41235345264568046, -0.08033688484471949, -0.16299772673724766, 0.23155233018264612, -0.11534715442206053, -0.08335489408277413, 0.12809330682982417, 0.12233724353068015, 0.10217384523164262, -0.10803962314830107, 0.13772276395055302, -0.02205887646688258, 0.175075515074765, 0.005864508745863157, 0.07217676394125995, 0.23739975473898298, 0.15883599052150899, 0.06837771076928167, 0.2063447065966423, -0.03969485571279245, -0.2690812984810156, -0.2921750967637362, -0.15009477852898487, -0.16961099966429175, 0.07046639336382642, -0.03780919809154618, -0.19951250147286748, 0.43279453417395847, 0.13262274858254172, 0.18958471508367974, -0.04428230821949375, 0.21159750755657167, 0.20338735588661888, 0.018629274151616675, 0.07748368839692214, 0.28662110754453085, 0.17733055356725613, 0.08706264936310404, -0.2800427526098621, 0.0036370704881846906, 0.075772373931592] |
1,802.10252 | Frank-Wolfe Network: An Interpretable Deep Structure for Non-Sparse
Coding | The problem of $L_p$-norm constrained coding is to convert signal into code
that lies inside an $L_p$-ball and most faithfully reconstructs the signal.
Previous works under the name of sparse coding considered the cases of $L_0$
and $L_1$ norms. The cases with $p>1$ values, i.e. non-sparse coding studied in
this paper, remain a difficulty. We propose an interpretable deep structure
namely Frank-Wolfe Network (F-W Net), whose architecture is inspired by
unrolling and truncating the Frank-Wolfe algorithm for solving an $L_p$-norm
constrained problem with $p\geq 1$. We show that the Frank-Wolfe solver for the
$L_p$-norm constraint leads to a novel closed-form nonlinear unit, which is
parameterized by $p$ and termed $pool_p$. The $pool_p$ unit links the
conventional pooling, activation, and normalization operations, making F-W Net
distinct from existing deep networks either heuristically designed or converted
from projected gradient descent algorithms. We further show that the
hyper-parameter $p$ can be made learnable instead of pre-chosen in F-W Net,
which gracefully solves the non-sparse coding problem even with unknown $p$. We
evaluate the performance of F-W Net on an extensive range of simulations as
well as the task of handwritten digit recognition, where F-W Net exhibits
strong learning capability. We then propose a convolutional version of F-W Net,
and apply the convolutional F-W Net into image denoising and super-resolution
tasks, where F-W Net all demonstrates impressive effectiveness, flexibility,
and robustness.
| cs.CV | the problem of l_pnorm constrained coding is to convert signal into code that lies inside an l_pball and most faithfully reconstructs the signal previous works under the name of sparse coding considered the cases of l_0 and l_1 norms the cases with p1 values ie nonsparse coding studied in this paper remain a difficulty we propose an interpretable deep structure namely frankwolfe network fw net whose architecture is inspired by unrolling and truncating the frankwolfe algorithm for solving an l_pnorm constrained problem with pgeq 1 we show that the frankwolfe solver for the l_pnorm constraint leads to a novel closedform nonlinear unit which is parameterized by p and termed pool_p the pool_p unit links the conventional pooling activation and normalization operations making fw net distinct from existing deep networks either heuristically designed or converted from projected gradient descent algorithms we further show that the hyperparameter p can be made learnable instead of prechosen in fw net which gracefully solves the nonsparse coding problem even with unknown p we evaluate the performance of fw net on an extensive range of simulations as well as the task of handwritten digit recognition where fw net exhibits strong learning capability we then propose a convolutional version of fw net and apply the convolutional fw net into image denoising and superresolution tasks where fw net all demonstrates impressive effectiveness flexibility and robustness | [['the', 'problem', 'of', 'l_pnorm', 'constrained', 'coding', 'is', 'to', 'convert', 'signal', 'into', 'code', 'that', 'lies', 'inside', 'an', 'l_pball', 'and', 'most', 'faithfully', 'reconstructs', 'the', 'signal', 'previous', 'works', 'under', 'the', 'name', 'of', 'sparse', 'coding', 'considered', 'the', 'cases', 'of', 'l_0', 'and', 'l_1', 'norms', 'the', 'cases', 'with', 'p1', 'values', 'ie', 'nonsparse', 'coding', 'studied', 'in', 'this', 'paper', 'remain', 'a', 'difficulty', 'we', 'propose', 'an', 'interpretable', 'deep', 'structure', 'namely', 'frankwolfe', 'network', 'fw', 'net', 'whose', 'architecture', 'is', 'inspired', 'by', 'unrolling', 'and', 'truncating', 'the', 'frankwolfe', 'algorithm', 'for', 'solving', 'an', 'l_pnorm', 'constrained', 'problem', 'with', 'pgeq', '1', 'we', 'show', 'that', 'the', 'frankwolfe', 'solver', 'for', 'the', 'l_pnorm', 'constraint', 'leads', 'to', 'a', 'novel', 'closedform', 'nonlinear', 'unit', 'which', 'is', 'parameterized', 'by', 'p', 'and', 'termed', 'pool_p', 'the', 'pool_p', 'unit', 'links', 'the', 'conventional', 'pooling', 'activation', 'and', 'normalization', 'operations', 'making', 'fw', 'net', 'distinct', 'from', 'existing', 'deep', 'networks', 'either', 'heuristically', 'designed', 'or', 'converted', 'from', 'projected', 'gradient', 'descent', 'algorithms', 'we', 'further', 'show', 'that', 'the', 'hyperparameter', 'p', 'can', 'be', 'made', 'learnable', 'instead', 'of', 'prechosen', 'in', 'fw', 'net', 'which', 'gracefully', 'solves', 'the', 'nonsparse', 'coding', 'problem', 'even', 'with', 'unknown', 'p', 'we', 'evaluate', 'the', 'performance', 'of', 'fw', 'net', 'on', 'an', 'extensive', 'range', 'of', 'simulations', 'as', 'well', 'as', 'the', 'task', 'of', 'handwritten', 'digit', 'recognition', 'where', 'fw', 'net', 'exhibits', 'strong', 'learning', 'capability', 'we', 'then', 'propose', 'a', 'convolutional', 'version', 'of', 'fw', 'net', 'and', 'apply', 'the', 'convolutional', 'fw', 'net', 'into', 'image', 'denoising', 'and', 'superresolution', 'tasks', 'where', 'fw', 'net', 'all', 'demonstrates', 'impressive', 'effectiveness', 'flexibility', 'and', 'robustness']] | [-0.07285567400459614, 0.003971070815136449, -0.0440543318953779, 0.032895095660868616, -0.07876584809376962, -0.19875717570591303, 0.03266008037349416, 0.43833101018021503, -0.3813066389851479, -0.2758817250840366, 0.08302901634842985, -0.24097088382061985, -0.2104577546524039, 0.14436745283659547, -0.14662793923945477, 0.1077729586119272, 0.09435730034433719, 0.04538002704761716, -0.10819041061732504, -0.254498823845966, 0.2330339062648515, 0.0378070894191559, 0.2821216033481889, 0.005912019317297058, 0.1797340149525553, 0.01923456980329421, 0.015774204553001457, 0.0027060562233641072, -0.03580187450935935, 0.134211959191598, 0.2470200447820955, 0.2067482903599739, 0.3418910545907501, -0.43642433695081206, -0.2133041136825664, 0.13115704979747533, 0.16718164491156737, 0.05942326726288431, -0.06066567507934653, -0.26040847852360455, 0.11314446341246366, -0.1447873934606711, 0.038612572266202835, -0.11372284896568292, -0.018699492203692596, 0.009734212828593122, -0.3451075084375528, 0.06412124067751898, 0.1293669800672473, 0.007969161415498497, -0.06720167217879659, -0.19890456072158283, 0.0515808734176163, 0.06682249770189325, 0.04876505934840275, 0.10982077731233504, 0.0999503320077848, -0.169205414664951, -0.12249263768187828, 0.35227015162714653, -0.0488091134512797, -0.22734905322392782, 0.12400653010441197, -0.012633126535866823, -0.13298663883366518, 0.10988843710472186, 0.22081436541034943, 0.14530020120036272, -0.11770552697099952, 0.08744838916282686, -0.07576875244370765, 0.17964647327032354, 0.07082131564306716, -0.030353662807287442, 0.12451796029280457, 0.18817398994333215, 0.10658799446006822, 0.17219153001438825, -0.13986837542926273, -0.07791854180085163, -0.21960018450963414, -0.08970178328894286, -0.2248293699608702, 0.007466877963807848, -0.0920763764814991, -0.12817589150534736, 0.3812043950479064, 0.1658666548029416, 0.20195038023301295, 0.14845429992613693, 0.3303364359152814, 0.11507978165211777, 0.11379259250382245, 0.14146784232386078, 0.18695779995216677, 0.10412242292116086, 0.06469303709765276, -0.1941302369069308, 0.05181722454364515, 0.09786480232659313] |
1,802.10253 | Theory of metal-insulator transitions in graphite under high magnetic
field | Graphite under high magnetic field exhibits consecutive metal-insulator (MI)
transitions as well as re-entrant insulator-metal (IM) transition in the
quasi-quantum limit at low temperature. In this paper, we identify the low-$T$
insulating phases as excitonic insulators with spin nematic orderings. We first
point out that graphite under the relevant field regime is in the charge
neutrality region, where electron and hole densities compensate each other.
Based on this observation, we introduce interacting electron models with
electron pocket(s) and hole pocket(s) and enumerate possible umklapp scattering
processes allowed under the charge neutrality. Employing effective boson
theories for the electron models and renormalization group (RG) analyses for
the boson theories, we show that there exist critical interaction strengths
above which the umklapp processes become relevant and the system enter
excitonic insulator phases with long-range order of spin superconducting phase
fields ("spin nematic excitonic insulator"). We argue that, when a pair of
electron and hole pockets get smaller in size, a quantum fluctuation of the
spin superconducting phase becomes larger and destabilizes the excitonic
insulator phases, resulting in the re-entrant IM transitions. We also show that
an odd-parity excitonic pairing between the electron and hole pockets
reconstruct surface chiral Fermi arc states of electron and hole into a
2-dimensional helical surface state with a gapless Dirac cone. We discuss
field- and temperature-dependences of in-plane resistance by surface transports
via these surface states.
| cond-mat.mes-hall cond-mat.dis-nn cond-mat.str-el | graphite under high magnetic field exhibits consecutive metalinsulator mi transitions as well as reentrant insulatormetal im transition in the quasiquantum limit at low temperature in this paper we identify the lowt insulating phases as excitonic insulators with spin nematic orderings we first point out that graphite under the relevant field regime is in the charge neutrality region where electron and hole densities compensate each other based on this observation we introduce interacting electron models with electron pockets and hole pockets and enumerate possible umklapp scattering processes allowed under the charge neutrality employing effective boson theories for the electron models and renormalization group rg analyses for the boson theories we show that there exist critical interaction strengths above which the umklapp processes become relevant and the system enter excitonic insulator phases with longrange order of spin superconducting phase fields spin nematic excitonic insulator we argue that when a pair of electron and hole pockets get smaller in size a quantum fluctuation of the spin superconducting phase becomes larger and destabilizes the excitonic insulator phases resulting in the reentrant im transitions we also show that an oddparity excitonic pairing between the electron and hole pockets reconstruct surface chiral fermi arc states of electron and hole into a 2dimensional helical surface state with a gapless dirac cone we discuss field and temperaturedependences of inplane resistance by surface transports via these surface states | [['graphite', 'under', 'high', 'magnetic', 'field', 'exhibits', 'consecutive', 'metalinsulator', 'mi', 'transitions', 'as', 'well', 'as', 'reentrant', 'insulatormetal', 'im', 'transition', 'in', 'the', 'quasiquantum', 'limit', 'at', 'low', 'temperature', 'in', 'this', 'paper', 'we', 'identify', 'the', 'lowt', 'insulating', 'phases', 'as', 'excitonic', 'insulators', 'with', 'spin', 'nematic', 'orderings', 'we', 'first', 'point', 'out', 'that', 'graphite', 'under', 'the', 'relevant', 'field', 'regime', 'is', 'in', 'the', 'charge', 'neutrality', 'region', 'where', 'electron', 'and', 'hole', 'densities', 'compensate', 'each', 'other', 'based', 'on', 'this', 'observation', 'we', 'introduce', 'interacting', 'electron', 'models', 'with', 'electron', 'pockets', 'and', 'hole', 'pockets', 'and', 'enumerate', 'possible', 'umklapp', 'scattering', 'processes', 'allowed', 'under', 'the', 'charge', 'neutrality', 'employing', 'effective', 'boson', 'theories', 'for', 'the', 'electron', 'models', 'and', 'renormalization', 'group', 'rg', 'analyses', 'for', 'the', 'boson', 'theories', 'we', 'show', 'that', 'there', 'exist', 'critical', 'interaction', 'strengths', 'above', 'which', 'the', 'umklapp', 'processes', 'become', 'relevant', 'and', 'the', 'system', 'enter', 'excitonic', 'insulator', 'phases', 'with', 'longrange', 'order', 'of', 'spin', 'superconducting', 'phase', 'fields', 'spin', 'nematic', 'excitonic', 'insulator', 'we', 'argue', 'that', 'when', 'a', 'pair', 'of', 'electron', 'and', 'hole', 'pockets', 'get', 'smaller', 'in', 'size', 'a', 'quantum', 'fluctuation', 'of', 'the', 'spin', 'superconducting', 'phase', 'becomes', 'larger', 'and', 'destabilizes', 'the', 'excitonic', 'insulator', 'phases', 'resulting', 'in', 'the', 'reentrant', 'im', 'transitions', 'we', 'also', 'show', 'that', 'an', 'oddparity', 'excitonic', 'pairing', 'between', 'the', 'electron', 'and', 'hole', 'pockets', 'reconstruct', 'surface', 'chiral', 'fermi', 'arc', 'states', 'of', 'electron', 'and', 'hole', 'into', 'a', '2dimensional', 'helical', 'surface', 'state', 'with', 'a', 'gapless', 'dirac', 'cone', 'we', 'discuss', 'field', 'and', 'temperaturedependences', 'of', 'inplane', 'resistance', 'by', 'surface', 'transports', 'via', 'these', 'surface', 'states']] | [-0.20558233620541974, 0.28939086909149925, -0.041486347720482465, 0.06986695405667216, -0.004494947214574272, -0.20916482496713837, 0.10637696148109863, 0.3652974785464169, -0.2093037859918997, -0.24111479662732915, -0.026098806635216368, -0.3562028798595982, -0.13382069520676695, 0.11803999931579985, 0.07786574978348351, 0.0008773557759422858, -0.07065223979125182, -0.05684319183872972, -0.15338713223318973, -0.18160577975193193, 0.3629618188529987, -0.02396789716412293, 0.30478848521007984, 0.11403298711502827, 0.05524013196341856, 0.027825223695787736, 0.1658450720961893, 0.02460741127869643, -0.17790196707289702, -0.0323426159425114, 0.2991553514462341, -0.13146868378877655, 0.16038874914568715, -0.4662390899230364, -0.21831114047997952, 0.009007038055475817, 0.14037324213239824, 0.15478712162887473, -0.0924475337795539, -0.3047199677076093, 0.011730178419956083, -0.18091865432119264, -0.11761594166080407, -0.11059805204660741, -0.0041742444218351915, -0.060803015971572574, -0.23226844522223591, 0.12247726967477943, 0.05934887421297064, 0.04603074494175873, -0.11108303587379414, -0.0925205007422203, -0.11473204294427025, 0.04197106845476095, 0.10572785318332956, 0.06170891793282076, 0.1950598654081012, -0.14096325801229959, -0.11185894461092437, 0.33173721922992616, -0.03206181300826387, -0.08325539170012008, 0.17966375243138344, -0.23483872541762008, -0.06729291966306981, 0.20369344719331792, 0.08571624595419744, 0.06563928262948254, -0.07907511890942372, 0.0916611040607105, -0.011935565402064327, 0.15696176960233163, 0.02904640928426286, 0.10702701906702079, 0.3464589534189113, 0.17437651623233616, 0.08641839601042554, 0.11813158212320098, -0.16148908825863945, -0.05079049313990969, -0.2544430694319145, -0.18767766164555763, -0.1915468058618005, 0.06055229262339041, -0.04689984642592966, -0.20910560743330153, 0.3988623775696325, 0.16488428380468445, 0.1833222319807158, -0.09380352613872006, 0.22969007506909653, 0.12190139023068576, 0.03448133110414426, 0.07334747601414351, 0.22993588407511728, 0.15899525458444577, 0.070496094324138, -0.3092666214388413, -0.00020526744250927981, 0.07218339257999669] |
1,802.10254 | Semi-Analytic Resampling in Lasso | An approximate method for conducting resampling in Lasso, the $\ell_1$
penalized linear regression, in a semi-analytic manner is developed, whereby
the average over the resampled datasets is directly computed without repeated
numerical sampling, thus enabling an inference free of the statistical
fluctuations due to sampling finiteness, as well as a significant reduction of
computational time. The proposed method is based on a message passing type
algorithm, and its fast convergence is guaranteed by the state evolution
analysis, when covariates are provided as zero-mean independently and
identically distributed Gaussian random variables. It is employed to implement
bootstrapped Lasso (Bolasso) and stability selection, both of which are
variable selection methods using resampling in conjunction with Lasso, and
resolves their disadvantage regarding computational cost. To examine
approximation accuracy and efficiency, numerical experiments were carried out
using simulated datasets. Moreover, an application to a real-world dataset, the
wine quality dataset, is presented. To process such real-world datasets, an
objective criterion for determining the relevance of selected variables is also
introduced by the addition of noise variables and resampling.
| stat.ML cond-mat.dis-nn stat.ME | an approximate method for conducting resampling in lasso the ell_1 penalized linear regression in a semianalytic manner is developed whereby the average over the resampled datasets is directly computed without repeated numerical sampling thus enabling an inference free of the statistical fluctuations due to sampling finiteness as well as a significant reduction of computational time the proposed method is based on a message passing type algorithm and its fast convergence is guaranteed by the state evolution analysis when covariates are provided as zeromean independently and identically distributed gaussian random variables it is employed to implement bootstrapped lasso bolasso and stability selection both of which are variable selection methods using resampling in conjunction with lasso and resolves their disadvantage regarding computational cost to examine approximation accuracy and efficiency numerical experiments were carried out using simulated datasets moreover an application to a realworld dataset the wine quality dataset is presented to process such realworld datasets an objective criterion for determining the relevance of selected variables is also introduced by the addition of noise variables and resampling | [['an', 'approximate', 'method', 'for', 'conducting', 'resampling', 'in', 'lasso', 'the', 'ell_1', 'penalized', 'linear', 'regression', 'in', 'a', 'semianalytic', 'manner', 'is', 'developed', 'whereby', 'the', 'average', 'over', 'the', 'resampled', 'datasets', 'is', 'directly', 'computed', 'without', 'repeated', 'numerical', 'sampling', 'thus', 'enabling', 'an', 'inference', 'free', 'of', 'the', 'statistical', 'fluctuations', 'due', 'to', 'sampling', 'finiteness', 'as', 'well', 'as', 'a', 'significant', 'reduction', 'of', 'computational', 'time', 'the', 'proposed', 'method', 'is', 'based', 'on', 'a', 'message', 'passing', 'type', 'algorithm', 'and', 'its', 'fast', 'convergence', 'is', 'guaranteed', 'by', 'the', 'state', 'evolution', 'analysis', 'when', 'covariates', 'are', 'provided', 'as', 'zeromean', 'independently', 'and', 'identically', 'distributed', 'gaussian', 'random', 'variables', 'it', 'is', 'employed', 'to', 'implement', 'bootstrapped', 'lasso', 'bolasso', 'and', 'stability', 'selection', 'both', 'of', 'which', 'are', 'variable', 'selection', 'methods', 'using', 'resampling', 'in', 'conjunction', 'with', 'lasso', 'and', 'resolves', 'their', 'disadvantage', 'regarding', 'computational', 'cost', 'to', 'examine', 'approximation', 'accuracy', 'and', 'efficiency', 'numerical', 'experiments', 'were', 'carried', 'out', 'using', 'simulated', 'datasets', 'moreover', 'an', 'application', 'to', 'a', 'realworld', 'dataset', 'the', 'wine', 'quality', 'dataset', 'is', 'presented', 'to', 'process', 'such', 'realworld', 'datasets', 'an', 'objective', 'criterion', 'for', 'determining', 'the', 'relevance', 'of', 'selected', 'variables', 'is', 'also', 'introduced', 'by', 'the', 'addition', 'of', 'noise', 'variables', 'and', 'resampling']] | [-0.04188358828147081, 0.00014685533556755333, -0.1103088475854789, 0.06829830491485687, -0.08209485097269088, -0.15786155671063254, 0.08779009968984401, 0.43967669600642273, -0.27910707996965484, -0.3189484405106512, 0.15770207974998196, -0.2435543959178887, -0.12252551895411064, 0.19489698999175994, -0.11640051819501851, 0.12611329321576892, 0.10586113484267158, -0.001535072795586425, -0.03552727845608492, -0.349493855487384, 0.21608549467924898, 0.11689536961132725, 0.32758000461604103, -0.0448919530655525, 0.13622864128498396, 0.04241359236264794, -0.09951892471019227, 0.04107570779595481, -0.05402787698796768, 0.07025627063014599, 0.26284299877836187, 0.17320170268234422, 0.3742646407389521, -0.35846393761605067, -0.20202018015472026, 0.09521000541682387, 0.16335184453590507, 0.06987560741580293, -0.049281403657193454, -0.2937797560228099, 0.0740570386191937, -0.13065020305716069, -0.054222255412639045, -0.1591808560221381, -0.05187558071505835, 0.03927837059787614, -0.3600233406385129, 0.10946505952973705, 0.022872222871814007, 0.07435870691652186, -0.009537189985470226, -0.14957073171912083, -0.0045701021518579675, 0.08613009406364089, 0.07933354967166054, 0.006620176234844558, 0.1477261328823522, -0.09197168794176916, -0.14759799000143406, 0.3400793907543023, -0.036330282417843224, -0.2499011417786623, 0.18942308996982363, -0.022970229220688986, -0.11114415525185779, 0.1250494724787215, 0.20285209954512873, 0.10638467541256191, -0.18452223132796994, 0.0473087972609444, -0.025793578347255444, 0.16139660242091244, 0.03998132702096997, -0.046456948460625674, 0.09123201338686691, 0.2097711575728702, 0.06443329870261937, 0.14391020218167325, -0.1360114894060675, -0.09615617400789954, -0.2780232273427577, -0.11037751433075588, -0.2547637825221594, -0.031113156025838536, -0.1558313701195099, -0.1854550673334656, 0.34293236908898955, 0.18627822943481392, 0.16283652419224381, 0.0951667296193037, 0.3358482682245152, 0.09803901922463536, 0.02201907436400866, 0.08106287499895083, 0.15823092864526586, 0.13242982548056706, 0.047228347482668215, -0.21827394294755897, 0.10822714330500056, 0.04688603201417397] |
1,802.10255 | Massive MIMO relaying with linear precoding in correlated channels under
limited feedback | In this paper we study on a massive MIMO relay system with linear precoding
under the conditions of imperfect channel state information at the transmitter
(CSIT) and per-user channel transmit correlation. In our system the
source-relay channels are massive multiple-input multiple-output (MIMO) ones
and the relay-destination channels are massive multiple-input single-output
(MISO) ones. Large random matrix theory (RMT) is used to derive a deterministic
equivalent of the signal-to-interference-plus-noise ratio (SINR) at each user
in massive MIMO amplify-forward and decode-forward (M-MIMO-ADF) relaying with
regularized zero-forcing (RZF) precoding, as the number of transmit antennas
and users M,K approaches to infinity and M>>K. In this paper we obtain a
closed-form expression for the deterministic equivalent of
h^H_kW(hat)_lh(hat)_k, and we give two theorems and a corollary to derive the
deterministic equivalent of the SINR at each user. Simulation results show that
the deterministic equivalent of the SINR at each user in M-MIMO-ADF relaying
and the results of Theorem 1, Theorem 2, Proposition 1 and Corollary 1 are
accurate.
| eess.SP | in this paper we study on a massive mimo relay system with linear precoding under the conditions of imperfect channel state information at the transmitter csit and peruser channel transmit correlation in our system the sourcerelay channels are massive multipleinput multipleoutput mimo ones and the relaydestination channels are massive multipleinput singleoutput miso ones large random matrix theory rmt is used to derive a deterministic equivalent of the signaltointerferenceplusnoise ratio sinr at each user in massive mimo amplifyforward and decodeforward mmimoadf relaying with regularized zeroforcing rzf precoding as the number of transmit antennas and users mk approaches to infinity and mk in this paper we obtain a closedform expression for the deterministic equivalent of hh_kwhat_lhhat_k and we give two theorems and a corollary to derive the deterministic equivalent of the sinr at each user simulation results show that the deterministic equivalent of the sinr at each user in mmimoadf relaying and the results of theorem 1 theorem 2 proposition 1 and corollary 1 are accurate | [['in', 'this', 'paper', 'we', 'study', 'on', 'a', 'massive', 'mimo', 'relay', 'system', 'with', 'linear', 'precoding', 'under', 'the', 'conditions', 'of', 'imperfect', 'channel', 'state', 'information', 'at', 'the', 'transmitter', 'csit', 'and', 'peruser', 'channel', 'transmit', 'correlation', 'in', 'our', 'system', 'the', 'sourcerelay', 'channels', 'are', 'massive', 'multipleinput', 'multipleoutput', 'mimo', 'ones', 'and', 'the', 'relaydestination', 'channels', 'are', 'massive', 'multipleinput', 'singleoutput', 'miso', 'ones', 'large', 'random', 'matrix', 'theory', 'rmt', 'is', 'used', 'to', 'derive', 'a', 'deterministic', 'equivalent', 'of', 'the', 'signaltointerferenceplusnoise', 'ratio', 'sinr', 'at', 'each', 'user', 'in', 'massive', 'mimo', 'amplifyforward', 'and', 'decodeforward', 'mmimoadf', 'relaying', 'with', 'regularized', 'zeroforcing', 'rzf', 'precoding', 'as', 'the', 'number', 'of', 'transmit', 'antennas', 'and', 'users', 'mk', 'approaches', 'to', 'infinity', 'and', 'mk', 'in', 'this', 'paper', 'we', 'obtain', 'a', 'closedform', 'expression', 'for', 'the', 'deterministic', 'equivalent', 'of', 'hh_kwhat_lhhat_k', 'and', 'we', 'give', 'two', 'theorems', 'and', 'a', 'corollary', 'to', 'derive', 'the', 'deterministic', 'equivalent', 'of', 'the', 'sinr', 'at', 'each', 'user', 'simulation', 'results', 'show', 'that', 'the', 'deterministic', 'equivalent', 'of', 'the', 'sinr', 'at', 'each', 'user', 'in', 'mmimoadf', 'relaying', 'and', 'the', 'results', 'of', 'theorem', '1', 'theorem', '2', 'proposition', '1', 'and', 'corollary', '1', 'are', 'accurate']] | [-0.27649244685477997, 0.0022339159593865367, 0.011436027123286209, 0.010638692881550454, -0.033642240960486465, -0.3476905060573394, 0.10818332198194534, 0.35248762448983534, -0.19733287652908182, -0.21803998844177455, 0.06930325426355073, -0.28884945093416925, -0.2016799029805958, 0.06282780127113928, -0.09772945428556352, 0.05401582862626507, 0.04344750178098586, 0.08045676321959737, -0.04777546981580972, -0.29135515555878233, 0.31378002330857496, 0.09238890435847437, 0.3417515631256081, -0.018616521183288548, 0.1101567719716677, 0.036531671459760565, -0.001217455412290111, -0.09572377987784443, -0.14110633341751172, -0.00456283762559341, 0.3943225557204359, 0.24015723188806856, 0.2485941218570893, -0.3729427599041543, -0.20366368323321576, 0.06094428744479458, 0.19952642998111475, 0.056733445952767914, -0.004838326009516807, -0.2758405853658683, 0.18504414485293144, -0.25067903630157806, -0.004163400544813886, 0.10581416855797587, -0.14232604543429725, 0.05679502093626522, -0.45153372148225396, 0.05614595268693932, 0.02171142166914268, 0.04886672825853323, -0.044485728597696526, -0.19536787893779298, 0.06556336943389883, 0.13159605460125745, 0.02830658889063258, -0.03997119081059112, 0.060509293756638625, -0.09458314499713666, -0.08438771697549313, 0.31238361583264856, -0.0012051965188096213, -0.28622299204840795, 0.16400202679352383, -0.12977638318903328, -0.09368292700285266, 0.1899289940512791, 0.2789320944517747, 0.07012229120526578, -0.2073890507938514, 0.025555708948508345, -0.06728933500530927, 0.16245479376188346, 0.11126405090420444, 0.185272361689843, 0.10752503242580834, 0.15257048237235835, 0.17222308172549336, 0.14448029986692604, -0.11397929671538636, -0.10539431867669828, -0.2335734210029152, -0.14089562650254758, -0.21045685670503433, 0.07085252796178279, -0.16549836923373698, -0.03241700601405377, 0.30893838225924614, 0.1299962048817958, 0.05927224887639099, 0.23836820607322343, 0.43062753549643923, 0.17402654456232114, -0.010335992047019441, 0.17198455247229763, 0.1904046151451535, 0.2309487487958825, 0.13849894262514778, -0.19989427243018096, -0.015525892206253658, -0.010692419638273] |
1,802.10256 | Monotonous manipulation of atomic density in an isovolumetric
focused-beam trap | We present an asymmetric focused-beam trap of rubidium-85 atoms where the
cloud volume only varied with the trap laser intensity. By repumping on F=2 to
F'=2 D2 transition, the Stokes Raman scattering has strongly affected the
population ratio in the two hyperfine ground states. With the volume and trap
number simultaneously and separately controlled, we have shown that the cloud
density can be monotonously manipulated from zero to the maximum value limited
by the cooling power. By solely varying the intensity of repump laser, the
scheme for precision loading of exact 1-6 atoms in the FORT, which is beyond
the practical loading limit of the blue-detuned light-assisted collision, is
described.
| physics.atom-ph | we present an asymmetric focusedbeam trap of rubidium85 atoms where the cloud volume only varied with the trap laser intensity by repumping on f2 to f2 d2 transition the stokes raman scattering has strongly affected the population ratio in the two hyperfine ground states with the volume and trap number simultaneously and separately controlled we have shown that the cloud density can be monotonously manipulated from zero to the maximum value limited by the cooling power by solely varying the intensity of repump laser the scheme for precision loading of exact 16 atoms in the fort which is beyond the practical loading limit of the bluedetuned lightassisted collision is described | [['we', 'present', 'an', 'asymmetric', 'focusedbeam', 'trap', 'of', 'rubidium85', 'atoms', 'where', 'the', 'cloud', 'volume', 'only', 'varied', 'with', 'the', 'trap', 'laser', 'intensity', 'by', 'repumping', 'on', 'f2', 'to', 'f2', 'd2', 'transition', 'the', 'stokes', 'raman', 'scattering', 'has', 'strongly', 'affected', 'the', 'population', 'ratio', 'in', 'the', 'two', 'hyperfine', 'ground', 'states', 'with', 'the', 'volume', 'and', 'trap', 'number', 'simultaneously', 'and', 'separately', 'controlled', 'we', 'have', 'shown', 'that', 'the', 'cloud', 'density', 'can', 'be', 'monotonously', 'manipulated', 'from', 'zero', 'to', 'the', 'maximum', 'value', 'limited', 'by', 'the', 'cooling', 'power', 'by', 'solely', 'varying', 'the', 'intensity', 'of', 'repump', 'laser', 'the', 'scheme', 'for', 'precision', 'loading', 'of', 'exact', '16', 'atoms', 'in', 'the', 'fort', 'which', 'is', 'beyond', 'the', 'practical', 'loading', 'limit', 'of', 'the', 'bluedetuned', 'lightassisted', 'collision', 'is', 'described']] | [-0.09720264373410663, 0.24384326263111275, 0.004956110763702203, -0.050230190719858826, 0.0709056759845804, -0.16706865079362285, 0.08467325216624885, 0.4139711055904627, -0.2542687338184227, -0.2910311595621434, 0.038674646351401776, -0.24658552023836158, 0.00577520710754801, 0.17664625328034161, 0.009719284424896944, 0.043996231664310805, -0.004842701401900161, 0.00682135300541466, 0.002758329312994399, -0.22909446352754126, 0.2876285235249353, 0.07222092598253353, 0.3002273643812673, 0.07868821151893247, 0.06640822919064455, 0.0013558453753251922, 0.07169348961165682, -0.01337007236751643, -0.11162616216229666, 0.09747717910477977, 0.1712965719232505, 0.051016077792949296, 0.21313571980731053, -0.42881644459610635, -0.19352890821597116, 0.08489120057360693, 0.17821051078234715, 0.13493620767998932, -0.028723228745035488, -0.3025792380202223, -0.029812209397046402, -0.14683715421071444, -0.12828139956955883, -0.058126304666935046, 0.03917339274829084, 0.09013571127910505, -0.29627690170468257, 0.041432251116599546, 0.004499118017371405, 0.08596188157627528, -0.06508967128624632, -0.09419734332371842, -0.02157110904174095, 0.06338048661551014, -0.014477906040106476, 0.04123560247773474, 0.21817165924320844, -0.12185564923777499, -0.0006995465648783879, 0.37539013528519055, -0.12880914897911927, -0.10976731450381604, 0.14144631153903903, -0.187235176846893, -0.03763565559532832, 0.19854638435115868, 0.13965250372579743, 0.07509946415878155, -0.0999979430608536, 0.05036862204387117, -0.016915747651364655, 0.21283338185907766, 0.15385005472397262, 0.012981909018179232, 0.19526305254548787, 0.1224414065818895, 0.061659726104699074, 0.15961081694218923, -0.1577137550402602, -0.08236535502682356, -0.23818891938479447, -0.06634927064243873, -0.22536364209478382, 0.04885434831534936, -0.06621523271288342, -0.07331094283647624, 0.34871012007891045, 0.09650713751854545, 0.2000817443921485, -0.04556952657664872, 0.32317756713706663, 0.19207851368595252, 0.05435061563145031, 0.030322118703572248, 0.2918088585138321, 0.1370096167655323, 0.10427137310193343, -0.3311926710609855, 0.018846819786862895, 0.01010628552811051] |
1,802.10257 | The correlation of extragalactic $\gamma$-rays with cosmic matter
density distributions from weak-gravitational lensing | The extragalactic $\gamma$-ray background (EGB) arises from the accumulation
of $\gamma$-ray emissions from resolved and unresolved extragalactic sources as
well as diffuse processes. It is important to study the statistical properties
of the EGB in the context of cosmological structure formation. Known
astrophysical $\gamma$-ray sources such as blazars, star-forming galaxies, and
radio galaxies are expected to trace the underlying cosmic matter density
distribution. We explore the correlation of the EGB from Fermi-LAT data with
the large-scale matter density distribution from the Subaru Hyper Suprime-Cam
(HSC) SSP survey. We reconstruct an unbiased surface matter density
distribution $\kappa$ at $z<1$ by applying weak-gravitational lensing analysis
to the first-year HSC data. We then calculate the $\gamma - \kappa$
cross-correlation. Our measurements are consistent with a null detection, but a
weak correlation is found at angular scales of 30-60 arcmin, especially when
distant source galaxies at $z > 1$ are used for the lensing $\kappa$
reconstruction. The large-scale correlation suggests strong clustering of
high-redshift $\gamma$-ray sources such as blazars. However, the inferred bias
factor of $4-5$ is larger by about a factor of two than results from other
clustering analyses. The final HSC data covering 1,400 squared degrees will
play an essential role to determine accurately the blazar bias at $z > 0.5$.
| astro-ph.CO astro-ph.HE hep-ph | the extragalactic gammaray background egb arises from the accumulation of gammaray emissions from resolved and unresolved extragalactic sources as well as diffuse processes it is important to study the statistical properties of the egb in the context of cosmological structure formation known astrophysical gammaray sources such as blazars starforming galaxies and radio galaxies are expected to trace the underlying cosmic matter density distribution we explore the correlation of the egb from fermilat data with the largescale matter density distribution from the subaru hyper suprimecam hsc ssp survey we reconstruct an unbiased surface matter density distribution kappa at z1 by applying weakgravitational lensing analysis to the firstyear hsc data we then calculate the gamma kappa crosscorrelation our measurements are consistent with a null detection but a weak correlation is found at angular scales of 3060 arcmin especially when distant source galaxies at z 1 are used for the lensing kappa reconstruction the largescale correlation suggests strong clustering of highredshift gammaray sources such as blazars however the inferred bias factor of 45 is larger by about a factor of two than results from other clustering analyses the final hsc data covering 1400 squared degrees will play an essential role to determine accurately the blazar bias at z 05 | [['the', 'extragalactic', 'gammaray', 'background', 'egb', 'arises', 'from', 'the', 'accumulation', 'of', 'gammaray', 'emissions', 'from', 'resolved', 'and', 'unresolved', 'extragalactic', 'sources', 'as', 'well', 'as', 'diffuse', 'processes', 'it', 'is', 'important', 'to', 'study', 'the', 'statistical', 'properties', 'of', 'the', 'egb', 'in', 'the', 'context', 'of', 'cosmological', 'structure', 'formation', 'known', 'astrophysical', 'gammaray', 'sources', 'such', 'as', 'blazars', 'starforming', 'galaxies', 'and', 'radio', 'galaxies', 'are', 'expected', 'to', 'trace', 'the', 'underlying', 'cosmic', 'matter', 'density', 'distribution', 'we', 'explore', 'the', 'correlation', 'of', 'the', 'egb', 'from', 'fermilat', 'data', 'with', 'the', 'largescale', 'matter', 'density', 'distribution', 'from', 'the', 'subaru', 'hyper', 'suprimecam', 'hsc', 'ssp', 'survey', 'we', 'reconstruct', 'an', 'unbiased', 'surface', 'matter', 'density', 'distribution', 'kappa', 'at', 'z1', 'by', 'applying', 'weakgravitational', 'lensing', 'analysis', 'to', 'the', 'firstyear', 'hsc', 'data', 'we', 'then', 'calculate', 'the', 'gamma', 'kappa', 'crosscorrelation', 'our', 'measurements', 'are', 'consistent', 'with', 'a', 'null', 'detection', 'but', 'a', 'weak', 'correlation', 'is', 'found', 'at', 'angular', 'scales', 'of', '3060', 'arcmin', 'especially', 'when', 'distant', 'source', 'galaxies', 'at', 'z', '1', 'are', 'used', 'for', 'the', 'lensing', 'kappa', 'reconstruction', 'the', 'largescale', 'correlation', 'suggests', 'strong', 'clustering', 'of', 'highredshift', 'gammaray', 'sources', 'such', 'as', 'blazars', 'however', 'the', 'inferred', 'bias', 'factor', 'of', '45', 'is', 'larger', 'by', 'about', 'a', 'factor', 'of', 'two', 'than', 'results', 'from', 'other', 'clustering', 'analyses', 'the', 'final', 'hsc', 'data', 'covering', '1400', 'squared', 'degrees', 'will', 'play', 'an', 'essential', 'role', 'to', 'determine', 'accurately', 'the', 'blazar', 'bias', 'at', 'z', '05']] | [-0.04227367396188394, 0.09951546159247954, -0.07845559761886603, 0.19856799890691848, -0.10540955626344742, -0.042728412087138706, -0.022150784638231096, 0.4049588858864261, -0.2065984196983531, -0.3705499592571727, 0.0273455658275408, -0.3661528147086818, -0.008405669935915655, 0.19720407816309038, 0.078791395799501, -0.008779624137955093, 0.026790300592129092, -0.08850288361952939, -0.021829748746613493, -0.2524783661729177, 0.3361146413558389, 0.16497822303225476, 0.240491835707889, -0.03973818667915659, 0.09271146685395897, -0.06276417009134605, -0.15224146969205005, 0.00751240856864137, -0.1353366913644651, 0.05249035270608853, 0.26550533285576994, 0.14413935304122064, 0.19587848175603, -0.2820125028798447, -0.24393132323618455, 0.1130333947215158, 0.17513879277806693, 0.03663859486826289, -0.047690867943671146, -0.3173718136866369, 0.06573602267839376, -0.14398465785243122, -0.1498685111632193, 0.04741747785038631, -0.013843735763622285, 0.04857634636177907, -0.21007874121271228, 0.17569734249603075, -0.016838462932178867, 0.07848184870881508, -0.09077374084609774, -0.13573641054223753, -0.030276974827024038, 0.08836470357805278, 0.05440194526963044, 0.0971480447774102, 0.19990061792924782, -0.20267637874603325, -0.04993610786985, 0.39606925808074117, -0.07280824489325559, -0.01705200223702015, 0.15778927099936216, -0.22318708432162435, -0.24361119004083998, 0.1451991179995284, 0.1750427467649061, 0.06420830448126438, -0.15867848012687352, 0.07115468835555361, 0.012609984138551014, 0.2384827922661201, 0.015340610852609704, 0.07493790291482583, 0.32395873559882993, 0.09174467967619704, 0.08993837813105325, 0.10632412063576127, -0.276891931296932, 0.018889488102483917, -0.29873997408295394, -0.04631732515222167, -0.17162922993573604, 0.1522394092624964, -0.1510967875115101, -0.1099927594121749, 0.3362828609477096, 0.11070536997749073, 0.1943279619840679, 0.0658366599332686, 0.31138409994027205, 0.05282947001978755, 0.07909110324113693, 0.08946834394857468, 0.3170866340882534, 0.15166982053666042, 0.05315436815754827, -0.17263665776112053, 0.04868143940461998, -0.04817091146296396] |
1,802.10258 | The effects of thermal and correlated noise on magnons in a quantum
ferromagnet | The dynamics and thermal equilibrium of spin waves (magnons) in a quantum
ferromagnet as well as the macroscopic magnetisation are investigated. Thermal
noise due to an interaction with lattice phonons and the effects of spatial
correlations in the noise are considered. We first present a Markovian master
equation approach with analytical solutions for any homogeneous spatial
correlation function of the noise. We find that spatially correlated noise
increases the decay rate of magnons with low wave vectors to their thermal
equilibrium, which also leads to a faster decay of the ferromagnet's
magnetisation to its steady-state value. For long correlation lengths and
higher temperature we find that additionally there is a component of the
magnetisation which decays very slowly, due to a reduced decay rate of fast
magnons. This effect could be useful for fast and noise-protected quantum or
classical information transfer and magnonics. We further compare ferromagnetic
and antiferromagnetic behaviour in noisy environments and find qualitatively
similar behaviour in Ohmic but fundamentally different behaviour in super-Ohmic
environments.
| quant-ph cond-mat.mes-hall | the dynamics and thermal equilibrium of spin waves magnons in a quantum ferromagnet as well as the macroscopic magnetisation are investigated thermal noise due to an interaction with lattice phonons and the effects of spatial correlations in the noise are considered we first present a markovian master equation approach with analytical solutions for any homogeneous spatial correlation function of the noise we find that spatially correlated noise increases the decay rate of magnons with low wave vectors to their thermal equilibrium which also leads to a faster decay of the ferromagnets magnetisation to its steadystate value for long correlation lengths and higher temperature we find that additionally there is a component of the magnetisation which decays very slowly due to a reduced decay rate of fast magnons this effect could be useful for fast and noiseprotected quantum or classical information transfer and magnonics we further compare ferromagnetic and antiferromagnetic behaviour in noisy environments and find qualitatively similar behaviour in ohmic but fundamentally different behaviour in superohmic environments | [['the', 'dynamics', 'and', 'thermal', 'equilibrium', 'of', 'spin', 'waves', 'magnons', 'in', 'a', 'quantum', 'ferromagnet', 'as', 'well', 'as', 'the', 'macroscopic', 'magnetisation', 'are', 'investigated', 'thermal', 'noise', 'due', 'to', 'an', 'interaction', 'with', 'lattice', 'phonons', 'and', 'the', 'effects', 'of', 'spatial', 'correlations', 'in', 'the', 'noise', 'are', 'considered', 'we', 'first', 'present', 'a', 'markovian', 'master', 'equation', 'approach', 'with', 'analytical', 'solutions', 'for', 'any', 'homogeneous', 'spatial', 'correlation', 'function', 'of', 'the', 'noise', 'we', 'find', 'that', 'spatially', 'correlated', 'noise', 'increases', 'the', 'decay', 'rate', 'of', 'magnons', 'with', 'low', 'wave', 'vectors', 'to', 'their', 'thermal', 'equilibrium', 'which', 'also', 'leads', 'to', 'a', 'faster', 'decay', 'of', 'the', 'ferromagnets', 'magnetisation', 'to', 'its', 'steadystate', 'value', 'for', 'long', 'correlation', 'lengths', 'and', 'higher', 'temperature', 'we', 'find', 'that', 'additionally', 'there', 'is', 'a', 'component', 'of', 'the', 'magnetisation', 'which', 'decays', 'very', 'slowly', 'due', 'to', 'a', 'reduced', 'decay', 'rate', 'of', 'fast', 'magnons', 'this', 'effect', 'could', 'be', 'useful', 'for', 'fast', 'and', 'noiseprotected', 'quantum', 'or', 'classical', 'information', 'transfer', 'and', 'magnonics', 'we', 'further', 'compare', 'ferromagnetic', 'and', 'antiferromagnetic', 'behaviour', 'in', 'noisy', 'environments', 'and', 'find', 'qualitatively', 'similar', 'behaviour', 'in', 'ohmic', 'but', 'fundamentally', 'different', 'behaviour', 'in', 'superohmic', 'environments']] | [-0.14530513817332907, 0.21283759192563942, -0.08343925134663632, 0.08499564387289038, -0.03603198625632523, -0.1464986707377359, 0.031264615355304885, 0.3789270453735026, -0.2880892852867792, -0.23947857372172757, 0.06087064969877595, -0.28971211095814575, -0.11005523533024965, 0.19102649288502951, 0.045545247500528116, 0.036462556534867824, 0.010226288044261941, 0.00452971172346148, -0.06451073922439964, -0.18721639522501898, 0.2711792128260978, 0.044733731511807415, 0.2940955710455128, 0.046970796562218205, 0.06793697123711337, -0.023027077163876353, 0.05464007273528301, 0.020605028601374455, -0.12506098738876045, -0.001260826272142683, 0.2311300905647933, -0.020618757033653692, 0.2051957350776358, -0.46198572201687776, -0.22140415698780627, 0.08335600361439907, 0.179515140844944, 0.18784126078202473, -0.035783675114462475, -0.26936164202480883, 0.027697524295640204, -0.16153520665934565, -0.1254636153113794, -0.10044251795590459, 0.045523912243651016, 0.03081676881191527, -0.2887531420505957, 0.16998624730305217, 0.08767681922463834, 0.040030970026231454, -0.0551575430986767, -0.09050602000485548, -0.025119857797064556, 0.11599910680712117, 0.0807943900665101, 0.0228481527723227, 0.1602440821062662, -0.16348915970270816, -0.10432443525126305, 0.3270298067904161, -0.12143666776800584, -0.19152842937204653, 0.21934552290225903, -0.18268872930774252, -0.056904817770498745, 0.16177821312166615, 0.15172222572306315, 0.08976485937677636, -0.17238747240127827, 0.02198123619497843, 0.05552492332430403, 0.17923313734668145, 0.018186415942988084, 0.12910695588996934, 0.21733577496756962, 0.1551403257505087, 0.03328377957048709, 0.19206738051321234, -0.08907667924733666, -0.11283367055100194, -0.2226643631176209, -0.14142875034295158, -0.19624917525073102, 0.1141833500621365, -0.10429666022023167, -0.18765554885229396, 0.36815457115741723, 0.18257926159167473, 0.17827335612926476, 0.04478694848551744, 0.2860853516519025, 0.15462431793720155, 0.008091860184512899, 0.10273946224137427, 0.24624906100463792, 0.1599123620826885, 0.15317027531787306, -0.3035644065117475, 0.0674587267305992, -0.04231965233164722] |
1,802.10259 | Spectral Efficiency of Mixed-ADC Massive MIMO | We study the spectral efficiency (SE) of a mixed-ADC massive MIMO system in
which K single-antenna users communicate with a base station (BS) equipped with
M antennas connected to N high-resolution ADCs and M-N one-bit ADCs. This
architecture has been proposed as an approach for realizing massive MIMO
systems with reasonable power consumption. First, we investigate the
effectiveness of mixed-ADC architectures in overcoming the channel estimation
error caused by coarse quantization. For the channel estimation phase, we study
to what extent one can combat the SE loss by exploiting just N << M pairs of
high-resolution ADCs. We extend the round-robin training scheme for mixed-ADC
systems to include both high-resolution and one-bit quantized observations.
Then, we analyze the impact of the resulting channel estimation error in the
data detection phase. We consider random high-resolution ADC assignment and
also analyze a simple antenna selection scheme to increase the SE. Analytical
expressions are derived for the SE for maximum ratio combining (MRC) and
numerical results are presented for zero-forcing (ZF) detection. Performance
comparisons are made against systems with uniform ADC resolution and against
mixed-ADC systems without round-robin training to illustrate under what
conditions each approach provides the greatest benefit.
| cs.IT math.IT | we study the spectral efficiency se of a mixedadc massive mimo system in which k singleantenna users communicate with a base station bs equipped with m antennas connected to n highresolution adcs and mn onebit adcs this architecture has been proposed as an approach for realizing massive mimo systems with reasonable power consumption first we investigate the effectiveness of mixedadc architectures in overcoming the channel estimation error caused by coarse quantization for the channel estimation phase we study to what extent one can combat the se loss by exploiting just n m pairs of highresolution adcs we extend the roundrobin training scheme for mixedadc systems to include both highresolution and onebit quantized observations then we analyze the impact of the resulting channel estimation error in the data detection phase we consider random highresolution adc assignment and also analyze a simple antenna selection scheme to increase the se analytical expressions are derived for the se for maximum ratio combining mrc and numerical results are presented for zeroforcing zf detection performance comparisons are made against systems with uniform adc resolution and against mixedadc systems without roundrobin training to illustrate under what conditions each approach provides the greatest benefit | [['we', 'study', 'the', 'spectral', 'efficiency', 'se', 'of', 'a', 'mixedadc', 'massive', 'mimo', 'system', 'in', 'which', 'k', 'singleantenna', 'users', 'communicate', 'with', 'a', 'base', 'station', 'bs', 'equipped', 'with', 'm', 'antennas', 'connected', 'to', 'n', 'highresolution', 'adcs', 'and', 'mn', 'onebit', 'adcs', 'this', 'architecture', 'has', 'been', 'proposed', 'as', 'an', 'approach', 'for', 'realizing', 'massive', 'mimo', 'systems', 'with', 'reasonable', 'power', 'consumption', 'first', 'we', 'investigate', 'the', 'effectiveness', 'of', 'mixedadc', 'architectures', 'in', 'overcoming', 'the', 'channel', 'estimation', 'error', 'caused', 'by', 'coarse', 'quantization', 'for', 'the', 'channel', 'estimation', 'phase', 'we', 'study', 'to', 'what', 'extent', 'one', 'can', 'combat', 'the', 'se', 'loss', 'by', 'exploiting', 'just', 'n', 'm', 'pairs', 'of', 'highresolution', 'adcs', 'we', 'extend', 'the', 'roundrobin', 'training', 'scheme', 'for', 'mixedadc', 'systems', 'to', 'include', 'both', 'highresolution', 'and', 'onebit', 'quantized', 'observations', 'then', 'we', 'analyze', 'the', 'impact', 'of', 'the', 'resulting', 'channel', 'estimation', 'error', 'in', 'the', 'data', 'detection', 'phase', 'we', 'consider', 'random', 'highresolution', 'adc', 'assignment', 'and', 'also', 'analyze', 'a', 'simple', 'antenna', 'selection', 'scheme', 'to', 'increase', 'the', 'se', 'analytical', 'expressions', 'are', 'derived', 'for', 'the', 'se', 'for', 'maximum', 'ratio', 'combining', 'mrc', 'and', 'numerical', 'results', 'are', 'presented', 'for', 'zeroforcing', 'zf', 'detection', 'performance', 'comparisons', 'are', 'made', 'against', 'systems', 'with', 'uniform', 'adc', 'resolution', 'and', 'against', 'mixedadc', 'systems', 'without', 'roundrobin', 'training', 'to', 'illustrate', 'under', 'what', 'conditions', 'each', 'approach', 'provides', 'the', 'greatest', 'benefit']] | [-0.22937611557961424, -0.004776536797607503, 0.0023451273909256775, 0.010240493657076922, -0.06594583114765927, -0.26965719044008957, 0.11385167299826839, 0.4027295986960205, -0.20418865563423963, -0.29901563253477026, 0.09812459122800572, -0.27170369239543013, -0.15971901811592812, 0.16379308084273064, -0.1344866821570892, 0.0610784605473318, 0.10188782144794051, 0.01422541899183689, -0.08244888199735623, -0.2737162692320286, 0.28513739268029376, 0.14438120943817254, 0.33468603684890025, -0.06342188968015502, 0.117080649151348, 0.007154043885042929, -0.03262989844310772, -0.014121667919110278, -0.11078176415603778, 0.06627238809359165, 0.3121379291904824, 0.17778061582036886, 0.2628326394253087, -0.3996238910250974, -0.24991773176529652, 0.05096298252821577, 0.1859825028632815, 0.07636220665822015, -0.07439785099134552, -0.26584516862901497, 0.18937842484696635, -0.2377863216372171, -0.025642038313481882, -0.025471678661771725, -0.10481596896656532, 0.04192361060520444, -0.3657551423209358, 0.001967412122490825, -0.01287699896576149, 0.058912962504035354, -0.04809825151103872, -0.16443069889720965, 0.04216612782329321, 0.13082392671744206, -0.019215341806483016, -0.03477172905636229, 0.06392026322356863, -0.09078795756142093, -0.101642762846551, 0.3262683955467857, -0.03892567472850752, -0.24145844111181036, 0.15214869300852654, -0.11038809752196302, -0.09282822770123579, 0.14154570018826587, 0.23657942033011695, 0.07005966249235658, -0.15220678995401427, 0.01577494789849805, 0.00636262275107509, 0.20253013240943227, 0.07233200695280138, 0.12311059906152172, 0.15063214415983697, 0.21876992851885377, 0.08425778314727833, 0.1298571561049784, -0.19151579478651057, -0.0733965320907039, -0.1940596744190065, -0.15030633766508225, -0.21049462666209995, 0.016392532838223388, -0.09357494546766619, -0.025968625832691182, 0.2969165906460872, 0.16750108463599403, 0.14280980550541486, 0.1240794474445521, 0.41901243289894596, 0.10912901216794793, 0.04342044636545399, 0.08877829788252711, 0.18547294438246112, 0.16377449978608638, 0.12340831339397297, -0.25419625341987273, -0.012782718874609135, 0.0039510630773218845] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.