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.0526 | Permutation polynomials over $\mathbb{F}_{q^2}$ from rational functions | Let $\mu_{q+1}$ denote the set of $(q+1)$-th roots of unity in
$\mathbb{F}_{q^2 }$. We construct permutation polynomials over
$\mathbb{F}_{q^2}$ by using rational functions of any degree that induce
bijections either on $\mu_{q+1}$ or between $\mu_{q+1}$ and $\mathbb{F}_q \cup
\{\infty\}$. In particular, we generalize results from Zieve.
| math.CO math.NT | let mu_q1 denote the set of q1th roots of unity in mathbbf_q2 we construct permutation polynomials over mathbbf_q2 by using rational functions of any degree that induce bijections either on mu_q1 or between mu_q1 and mathbbf_q cup infty in particular we generalize results from zieve | [['let', 'mu_q1', 'denote', 'the', 'set', 'of', 'q1th', 'roots', 'of', 'unity', 'in', 'mathbbf_q2', 'we', 'construct', 'permutation', 'polynomials', 'over', 'mathbbf_q2', 'by', 'using', 'rational', 'functions', 'of', 'any', 'degree', 'that', 'induce', 'bijections', 'either', 'on', 'mu_q1', 'or', 'between', 'mu_q1', 'and', 'mathbbf_q', 'cup', 'infty', 'in', 'particular', 'we', 'generalize', 'results', 'from', 'zieve']] | [-0.2065872883838084, 0.13037312727214562, -0.04444012672950824, -0.061629408753166595, -0.033320086242424114, -0.12875144556164742, 0.034574550121194786, 0.31122755410356656, -0.331049223533935, -0.16411931487835116, 0.015071166653393043, -0.33108963444828987, -0.1291854077587939, 0.2051591463231792, -0.11103027117335135, -0.059474721452635194, -0.016590577679582767, 0.07359344599147638, -0.11728100914818546, -0.2854296529251668, 0.35486103528075746, -0.11414651961790191, 0.1326279170397255, 0.014166921630708708, 0.11705346507951617, 0.037090368268804415, 0.026231139391246768, -0.016548399709992938, -0.2148319532016305, 0.024872418824169372, 0.3156689372172372, 0.17237624193852147, 0.2013308169113265, -0.3717115337649981, -0.05755390775286489, 0.3420361432764265, 0.1999895317479968, -0.09506558486156994, 0.04861607013218519, -0.22669648692632716, 0.15320361436655125, -0.1667168504121946, -0.12396790352132585, -0.06968730830897887, 0.04088489664718509, 0.11123802903004819, -0.34831381365656855, -0.02994083252011074, 0.06764643361998929, 0.2434089467343357, 0.012173613264328904, -0.20648148546202316, -0.01418442587989072, 0.0767070532310754, -0.07024623511566055, 0.12347626752323575, -0.008479027305212286, -0.04016190939065483, -0.18241594442062908, 0.3364965038167106, -0.04457416815890206, -0.25506405391626885, 0.04472186656461822, -0.21698448222337496, -0.10710670143986742, 0.08158773111386432, 0.16139704675103228, 0.1580621086061001, 0.05965201618770758, 0.2145714578516264, -0.17714407383981678, 0.08425689594716662, 0.1953163628776868, -0.054376131306505864, 0.13231551150480905, -0.08515237019811239, 0.01393126282427046, 0.17606665384697004, 0.04897708060323364, 0.01228410682330529, -0.33917342383000587, -0.10872660455190473, -0.17701040440135532, 0.16730745466290198, -0.16509545384356494, -0.15231149515344036, 0.36991807955006756, 0.13773374158061213, 0.1839941158476803, 0.1874663552062379, 0.14809440730346574, 0.051233570647956285, 0.0803359377094441, 0.06029852764307483, -0.0064520716667175295, 0.19326025879321, -0.11313218329774423, -0.11475747218872938, 0.03952795201912522, 0.23126723025408055] |
1,802.05261 | Single-Volume Neutron Scatter Camera for High-Efficiency Neutron Imaging
and Spectroscopy | Neutron detection provides an effective method to detect, locate, and
characterize sources of interest to nuclear security applications. Current
neutron imaging systems based on double-scatter kinematic reconstruction
provide good signal vs. background discrimination and spectral capability, but
suffer from poor sensitivity due to geometrical constraints. This weakness can
be overcome if both neutron-proton scattering interactions are detected and
resolved within one large contiguous active detector volume. We describe here a
maximum likelihood approach to event reconstruction in a single-volume system
with no optical segmentation and sensitivity to individual optical photons on
the surfaces of the scintillator. We present results from a Geant4-based
simulation establishing the feasibility of this single-volume neutron scatter
camera concept given notional performance of existing photodetector and readout
technologies.
| physics.ins-det | neutron detection provides an effective method to detect locate and characterize sources of interest to nuclear security applications current neutron imaging systems based on doublescatter kinematic reconstruction provide good signal vs background discrimination and spectral capability but suffer from poor sensitivity due to geometrical constraints this weakness can be overcome if both neutronproton scattering interactions are detected and resolved within one large contiguous active detector volume we describe here a maximum likelihood approach to event reconstruction in a singlevolume system with no optical segmentation and sensitivity to individual optical photons on the surfaces of the scintillator we present results from a geant4based simulation establishing the feasibility of this singlevolume neutron scatter camera concept given notional performance of existing photodetector and readout technologies | [['neutron', 'detection', 'provides', 'an', 'effective', 'method', 'to', 'detect', 'locate', 'and', 'characterize', 'sources', 'of', 'interest', 'to', 'nuclear', 'security', 'applications', 'current', 'neutron', 'imaging', 'systems', 'based', 'on', 'doublescatter', 'kinematic', 'reconstruction', 'provide', 'good', 'signal', 'vs', 'background', 'discrimination', 'and', 'spectral', 'capability', 'but', 'suffer', 'from', 'poor', 'sensitivity', 'due', 'to', 'geometrical', 'constraints', 'this', 'weakness', 'can', 'be', 'overcome', 'if', 'both', 'neutronproton', 'scattering', 'interactions', 'are', 'detected', 'and', 'resolved', 'within', 'one', 'large', 'contiguous', 'active', 'detector', 'volume', 'we', 'describe', 'here', 'a', 'maximum', 'likelihood', 'approach', 'to', 'event', 'reconstruction', 'in', 'a', 'singlevolume', 'system', 'with', 'no', 'optical', 'segmentation', 'and', 'sensitivity', 'to', 'individual', 'optical', 'photons', 'on', 'the', 'surfaces', 'of', 'the', 'scintillator', 'we', 'present', 'results', 'from', 'a', 'geant4based', 'simulation', 'establishing', 'the', 'feasibility', 'of', 'this', 'singlevolume', 'neutron', 'scatter', 'camera', 'concept', 'given', 'notional', 'performance', 'of', 'existing', 'photodetector', 'and', 'readout', 'technologies']] | [-0.06390176751205413, 0.04188280046663982, -0.07256520106043467, 0.0648227246951558, -0.07885198870843108, -0.14961472211005397, 0.049416081446861805, 0.40877752129204015, -0.22208551118104172, -0.3834171176018301, 0.09492057914295318, -0.32433699493196383, -0.07211786113421563, 0.21547567515012478, -0.09358103651253213, 0.06222217559260278, 0.1079680538728587, -0.031926620570502114, -0.09299900279426562, -0.1743659837438902, 0.23492263518812612, 0.1059066363329391, 0.31317664612438684, 0.07478287554353721, 0.12712148456025604, 0.03525962403682946, -0.068605373313358, 0.0070335875267224495, -0.09830748482630396, 0.11103043482015448, 0.3127660642662817, 0.15744137675462921, 0.1673228838288587, -0.41156503943002914, -0.2046297115450802, 0.12267777784765999, 0.14568098964581405, 0.07479585833296233, -0.10878375398903346, -0.3065211603048542, 0.05221397337534519, -0.17529079772932224, -0.09439851943988445, -0.07937403299849603, -0.04716352543462653, 0.03594472518283104, -0.22732298561441136, 0.04839344854415625, -0.01473150772719898, 0.0340123091678112, -0.05389892234089823, -0.09216841259944322, 0.07088639938718955, 0.1051810170477641, -0.005526644905090086, 0.030998833442861137, 0.17998645753284132, -0.16462555941586837, -0.09589452721363256, 0.33159211136339123, -0.015642759342069837, -0.16072436764235953, 0.19977089693608177, -0.15089499819177118, -0.10794398657331043, 0.20497401027886336, 0.21392886963103366, 0.09411010299308979, -0.19403843757935052, -0.0056683235664174636, 0.049945751459083775, 0.24293265791132676, 0.05203941809629237, 0.09361575411782747, 0.2519580788211897, 0.2544377937851366, 0.05626276543042584, 0.11741124816510196, -0.23982339403361144, -0.0002741886010347319, -0.26589943160310636, -0.09989057353520689, -0.16681558578198175, 0.033324225313099455, -0.059264952289339826, -0.13837029790642386, 0.3439666353905004, 0.19782985402533326, 0.13612511300112407, 0.006207097631548185, 0.37653836964298626, 0.0391470919794226, 0.07735556275130409, 0.0025579046404127738, 0.3156877679573295, 0.13564881817572405, 0.08500360683653473, -0.24688745731841927, 0.04749503087306257, 7.8520229594274e-05] |
1,802.05262 | Three-Dimensional Nonlinear Stokes - Mueller Polarimetry | The formalism is developed for a tree-dimensional ($3D$) nonlinear
Stokes-Mueller polarimetry. The expressions are derived for the generalized
$3D$ linear and nonlinear Stokes vectors, and the corresponding nonlinear
Mueller matrix. The coherency-like Hermitian square matrix $X$ of
susceptibilities is introduced, which is derived from the nonlinear Mueller
matrix. The $X$-matrix is characterized by the index of depolarization. Several
decompositions of the $X$-matrix are introduced. The $3D$ nonlinear
Stokes-Mueller polarimetry formalism can be applied for three and higher wave
mixing processes. The $3D$ polarimetric measurements can be used for structural
investigations of materials, including heterogeneous biological structures. The
$3D$ polarimetry is applicable for nonlinear microscopy with high numerical
aperture objectives.
| physics.gen-ph | the formalism is developed for a treedimensional 3d nonlinear stokesmueller polarimetry the expressions are derived for the generalized 3d linear and nonlinear stokes vectors and the corresponding nonlinear mueller matrix the coherencylike hermitian square matrix x of susceptibilities is introduced which is derived from the nonlinear mueller matrix the xmatrix is characterized by the index of depolarization several decompositions of the xmatrix are introduced the 3d nonlinear stokesmueller polarimetry formalism can be applied for three and higher wave mixing processes the 3d polarimetric measurements can be used for structural investigations of materials including heterogeneous biological structures the 3d polarimetry is applicable for nonlinear microscopy with high numerical aperture objectives | [['the', 'formalism', 'is', 'developed', 'for', 'a', 'treedimensional', '3d', 'nonlinear', 'stokesmueller', 'polarimetry', 'the', 'expressions', 'are', 'derived', 'for', 'the', 'generalized', '3d', 'linear', 'and', 'nonlinear', 'stokes', 'vectors', 'and', 'the', 'corresponding', 'nonlinear', 'mueller', 'matrix', 'the', 'coherencylike', 'hermitian', 'square', 'matrix', 'x', 'of', 'susceptibilities', 'is', 'introduced', 'which', 'is', 'derived', 'from', 'the', 'nonlinear', 'mueller', 'matrix', 'the', 'xmatrix', 'is', 'characterized', 'by', 'the', 'index', 'of', 'depolarization', 'several', 'decompositions', 'of', 'the', 'xmatrix', 'are', 'introduced', 'the', '3d', 'nonlinear', 'stokesmueller', 'polarimetry', 'formalism', 'can', 'be', 'applied', 'for', 'three', 'and', 'higher', 'wave', 'mixing', 'processes', 'the', '3d', 'polarimetric', 'measurements', 'can', 'be', 'used', 'for', 'structural', 'investigations', 'of', 'materials', 'including', 'heterogeneous', 'biological', 'structures', 'the', '3d', 'polarimetry', 'is', 'applicable', 'for', 'nonlinear', 'microscopy', 'with', 'high', 'numerical', 'aperture', 'objectives']] | [-0.05583581700921059, 0.11163010323502089, -0.008297074887970532, 0.03936501304700936, -0.08141786908661877, -0.1437688411339574, -0.11765365309515295, 0.3792269013615118, -0.27175504883268364, -0.2505875488018824, 0.1317880868187381, -0.2732851443881238, -0.23404940143141342, 0.21169488256176314, 0.005235560807502932, 0.1605728262759469, 0.011862742671467088, -0.09141823366991486, -0.1246347360537146, -0.16536405418796843, 0.2851001646335202, 0.020868820960728313, 0.2661963841636424, -0.0027594383637834755, 0.1365064124757838, 0.0504556519617499, -0.08873996687880545, 0.07275304407704863, -0.07172086556373095, 0.1377291367758786, 0.2922819484266694, 0.10041688229992157, 0.15265928477876717, -0.41940542394122865, -0.2654458749241679, 0.008461413258272741, 0.07842997889275904, 0.08812096906735355, -0.010315041591335708, -0.2884590062140315, 0.04840994759083346, -0.1027437995955417, -0.1421599150419718, -0.1177896127014214, 0.007833436599294483, 0.022309895751445933, -0.3586519132497617, 0.0668397740745503, 0.018829868576075468, 0.06428470976512742, -0.07364871402926466, -0.13145586990544367, -0.03625997839305826, 0.10680401348077727, -0.06515725912672847, -0.022962945582414115, 0.07268225161048274, -0.11895158262362841, -0.09570906153466138, 0.41811330485399123, -0.03449763131276187, -0.23679921867463877, 0.12862585736352397, -0.1485096054556952, -0.056721829845897714, 0.1642479187683892, 0.19454093551677135, 0.14922939470960517, -0.15623421563456455, 0.08664641461466628, -0.061100026864113276, 0.14936810750859203, 0.047539192312224594, 0.015134897195147696, 0.1637548451544717, 0.13381595197306187, 0.0034356453818165595, 0.11268211036480756, -0.14071317848370032, -0.03684310138191062, -0.2501293652070065, -0.13808714428489988, -0.211132639954384, 0.05648620398669327, -0.1361813608604684, -0.1336672826739097, 0.4124339274087645, 0.0944663601823979, 0.12051439735417564, 0.011915828464595877, 0.2774530652494394, 0.18481327469904768, 0.05771208758448699, -0.005282303490848453, 0.276637209734569, 0.27617409074446186, 0.13127710151537839, -0.22984550068051451, 0.02667809154027728, 0.09314488302657588] |
1,802.05263 | Metriplectic particle-in-cell integrators for the Landau collision
operator | In this paper, we present a new framework for addressing the nonlinear Landau
collision operator in terms of particle-in-cell methods. We employ the
underlying metriplectic structure of the collision operator and, using a macro
particle discretization for the distribution function, we transform the
infinite-dimensional system into a finite-dimensional time-continuous
metriplectic system for advancing the macro particle weights. Temporal
discretization is accomplished using the concept of discrete gradients. The
conservation of density, momentum, and energy, as well as the positive
semi-definite production of entropy in both the time-continuous and the fully
discrete system is demonstrated algebraically. The new algorithm is fully
compatible with the existing particle-in-cell Poisson integrators for the
Vlasov-Maxwell system.
| physics.comp-ph math.NA physics.plasm-ph | in this paper we present a new framework for addressing the nonlinear landau collision operator in terms of particleincell methods we employ the underlying metriplectic structure of the collision operator and using a macro particle discretization for the distribution function we transform the infinitedimensional system into a finitedimensional timecontinuous metriplectic system for advancing the macro particle weights temporal discretization is accomplished using the concept of discrete gradients the conservation of density momentum and energy as well as the positive semidefinite production of entropy in both the timecontinuous and the fully discrete system is demonstrated algebraically the new algorithm is fully compatible with the existing particleincell poisson integrators for the vlasovmaxwell system | [['in', 'this', 'paper', 'we', 'present', 'a', 'new', 'framework', 'for', 'addressing', 'the', 'nonlinear', 'landau', 'collision', 'operator', 'in', 'terms', 'of', 'particleincell', 'methods', 'we', 'employ', 'the', 'underlying', 'metriplectic', 'structure', 'of', 'the', 'collision', 'operator', 'and', 'using', 'a', 'macro', 'particle', 'discretization', 'for', 'the', 'distribution', 'function', 'we', 'transform', 'the', 'infinitedimensional', 'system', 'into', 'a', 'finitedimensional', 'timecontinuous', 'metriplectic', 'system', 'for', 'advancing', 'the', 'macro', 'particle', 'weights', 'temporal', 'discretization', 'is', 'accomplished', 'using', 'the', 'concept', 'of', 'discrete', 'gradients', 'the', 'conservation', 'of', 'density', 'momentum', 'and', 'energy', 'as', 'well', 'as', 'the', 'positive', 'semidefinite', 'production', 'of', 'entropy', 'in', 'both', 'the', 'timecontinuous', 'and', 'the', 'fully', 'discrete', 'system', 'is', 'demonstrated', 'algebraically', 'the', 'new', 'algorithm', 'is', 'fully', 'compatible', 'with', 'the', 'existing', 'particleincell', 'poisson', 'integrators', 'for', 'the', 'vlasovmaxwell', 'system']] | [-0.12071885706160453, 0.08772513431891261, -0.1061151764158428, 0.07253615386565929, -0.030768938597526635, -0.11091597403634575, -0.034394206249507495, 0.3395437931490911, -0.3359249484062463, -0.2496372722844417, 0.0614846280182351, -0.19798206934403326, -0.1206023349921714, 0.15952294574303738, -0.028063155081425165, 0.1476438302160786, 0.09277167168513008, 0.00010005690929320481, -0.07550249979118104, -0.16314064012211119, 0.37058482523839753, 0.08862895336471968, 0.2509983138323904, 0.023951070936950477, 0.2216444439419885, 0.01630591507371817, -0.028384083480813314, 0.02024495407418759, -0.09164448343385179, 0.096295047308075, 0.21448676724003646, 0.1065136056796119, 0.29845819757571695, -0.42168568522744887, -0.22717475548789307, 0.045620759680598706, 0.17988131110564815, 0.08817004693697232, -0.04573047182917058, -0.30127781738636195, 0.05551340745610965, -0.22760002328468873, -0.11479617442163798, -0.0978646567940863, -0.04725369168361565, 0.051966860249579826, -0.29794658519807987, 0.10252297852557522, 0.07042579154110606, 0.06574290280381369, -0.11713466913279919, -0.08365813941015182, -0.026597287541523844, 0.06515651998772949, -0.028561580705934682, -0.006814374174159188, 0.09730307693668716, -0.06847635258685562, -0.14164639479136681, 0.3852244509753209, -0.059633292039638165, -0.33286663076026485, 0.17706558634401173, -0.13218577776464993, -0.11700409106272566, 0.11086994173374397, 0.20204456843989524, 0.1341295082390577, -0.17086232718770383, 0.12635371457577707, -0.016634209552435792, 0.11627892226710715, -0.001773649482643819, 0.024822838386302597, 0.13713698604286792, 0.22329970053187362, 0.08977328947334139, 0.11091825899642867, -0.07451823353557638, -0.17364012380340346, -0.34955401319238516, -0.19613741782938574, -0.1959387541597558, 0.010296674738931763, -0.06582529115375774, -0.16066949111451437, 0.4176695624886601, 0.11479870652410763, 0.13919100786248842, 0.09002582486383282, 0.3204700599365809, 0.2242458241025242, 0.015757755086933438, 0.09116623953387544, 0.1663515464998446, 0.16768412865270432, 0.15783329694091366, -0.2570145991211338, -0.006084848405071744, 0.1567385902330447] |
1,802.05264 | Stock Market Visualization | We provide complete source code for a front-end GUI and its back-end
counterpart for a stock market visualization tool. It is built based on the
"functional visualization" concept we discuss, whereby functionality is not
sacrificed for fancy graphics. The GUI, among other things, displays a
color-coded signal (computed by the back-end code) based on how "out-of-whack"
each stock is trading compared with its peers ("mean-reversion"), and the most
sizable changes in the signal ("momentum"). The GUI also allows to efficiently
filter/tier stocks by various parameters (e.g., sector, exchange, signal,
liquidity, market cap) and functionally display them. The tool can be run as a
web-based or local application.
| q-fin.PM q-fin.GN q-fin.RM | we provide complete source code for a frontend gui and its backend counterpart for a stock market visualization tool it is built based on the functional visualization concept we discuss whereby functionality is not sacrificed for fancy graphics the gui among other things displays a colorcoded signal computed by the backend code based on how outofwhack each stock is trading compared with its peers meanreversion and the most sizable changes in the signal momentum the gui also allows to efficiently filtertier stocks by various parameters eg sector exchange signal liquidity market cap and functionally display them the tool can be run as a webbased or local application | [['we', 'provide', 'complete', 'source', 'code', 'for', 'a', 'frontend', 'gui', 'and', 'its', 'backend', 'counterpart', 'for', 'a', 'stock', 'market', 'visualization', 'tool', 'it', 'is', 'built', 'based', 'on', 'the', 'functional', 'visualization', 'concept', 'we', 'discuss', 'whereby', 'functionality', 'is', 'not', 'sacrificed', 'for', 'fancy', 'graphics', 'the', 'gui', 'among', 'other', 'things', 'displays', 'a', 'colorcoded', 'signal', 'computed', 'by', 'the', 'backend', 'code', 'based', 'on', 'how', 'outofwhack', 'each', 'stock', 'is', 'trading', 'compared', 'with', 'its', 'peers', 'meanreversion', 'and', 'the', 'most', 'sizable', 'changes', 'in', 'the', 'signal', 'momentum', 'the', 'gui', 'also', 'allows', 'to', 'efficiently', 'filtertier', 'stocks', 'by', 'various', 'parameters', 'eg', 'sector', 'exchange', 'signal', 'liquidity', 'market', 'cap', 'and', 'functionally', 'display', 'them', 'the', 'tool', 'can', 'be', 'run', 'as', 'a', 'webbased', 'or', 'local', 'application']] | [-0.08649879698419854, 0.030478646761427322, -0.1145106493451056, 0.11164122628203282, -0.1746187446905034, -0.22571035764579261, 0.03641645474001832, 0.4280840425264268, -0.28850701298464887, -0.3202993134657542, 0.14768733532456238, -0.2998603222737854, -0.14791654966372464, 0.24813137103892152, -0.03180151877694741, -0.004165563506207295, 0.07639717024617962, 0.022072732036412204, 0.03872737784293436, -0.23302506107304777, 0.22488836218558605, 0.08517878773688738, 0.293384132618528, 0.05187040318491026, 0.09590449966712013, 0.054936077459050076, -0.07280843038378017, -0.025222364400646517, -0.08661170630671439, 0.12344423751076516, 0.30825185871550015, 0.19692803344112778, 0.2666031139414935, -0.4327312690338918, -0.12335068120044612, 0.056903477979912645, 0.06976276168286512, 0.03936751526558683, -0.048859613042856964, -0.2892906932958535, 0.06571079912107615, -0.2689391820824572, -0.07702564948371478, -0.11382016994702142, 0.01354106492141173, 0.020888701192147675, -0.25549110736298775, -0.022703406820350904, -0.005951126088343916, 0.08997385700266543, 0.00921348093376894, -0.07046658761267151, -0.07036031096663681, 0.16812339592946782, 0.040196126624054855, 0.00031076473671765557, 0.21249554672588905, -0.10296970650642401, -0.14007013596904774, 0.3855972226443035, -0.06314586789923765, -0.19587224816371288, 0.17148230072731774, -0.04230749501979777, -0.12087151579381454, 0.09182262358122638, 0.19553682172582262, -0.009314487725939779, -0.21524527274249566, 0.07577706432424575, 0.02073300074608553, 0.23278717538120136, 0.014827078240480096, 0.017574417307263328, 0.21557285324670375, 0.17511152507116398, 0.07499401368023384, 0.17160705115335684, -0.0809884128584859, -0.060706389908279694, -0.24175423303885119, -0.17585186986696152, -0.1664190617700418, -0.03601065624957084, -0.14174348232959996, -0.17181832258190427, 0.42721929933343616, 0.16925056031683372, 0.08555913455784321, 0.03596046755888632, 0.3352280818812904, 0.06201052122771562, 0.12073777420889764, 0.13614062876662328, 0.12376873285642692, -0.004472661756777338, 0.19946625582164243, -0.132337416925778, 0.16625855436459894, 0.0266519150386254] |
1,802.05265 | New approach for multiconfigurational Exchange-Correlation Functional | New density functional theory approach based on a complete active space
self-consistent field (CASSCF) reference function in Extended Koopmans'
approximation is discussed. Recently, the number of generalizations of density
functional theory based on a multiconfigurational CASSCF reference function
with exact exchange (CASDFT) was introduced. It was shown by one of the authors
(Dr. Gusarov) that such a theory could be formulated by introducing a special
form of exchange-correlation potential. To take into account an active space
and to avoid double counting of correlation energy the dependence from on-top
pair density as a new variable was introduced. Unfortunately, this requires a
deep review and reparametrization of existing functional expressions which lead
to additional computational difficulties. The presented approach does not
require introducing additional variables (like on-top pair density, and based
on Extended Koopmans' theorem (EKT) approximation for multiconfigurational wave
function within CASSCF method.
| physics.chem-ph quant-ph | new density functional theory approach based on a complete active space selfconsistent field casscf reference function in extended koopmans approximation is discussed recently the number of generalizations of density functional theory based on a multiconfigurational casscf reference function with exact exchange casdft was introduced it was shown by one of the authors dr gusarov that such a theory could be formulated by introducing a special form of exchangecorrelation potential to take into account an active space and to avoid double counting of correlation energy the dependence from ontop pair density as a new variable was introduced unfortunately this requires a deep review and reparametrization of existing functional expressions which lead to additional computational difficulties the presented approach does not require introducing additional variables like ontop pair density and based on extended koopmans theorem ekt approximation for multiconfigurational wave function within casscf method | [['new', 'density', 'functional', 'theory', 'approach', 'based', 'on', 'a', 'complete', 'active', 'space', 'selfconsistent', 'field', 'casscf', 'reference', 'function', 'in', 'extended', 'koopmans', 'approximation', 'is', 'discussed', 'recently', 'the', 'number', 'of', 'generalizations', 'of', 'density', 'functional', 'theory', 'based', 'on', 'a', 'multiconfigurational', 'casscf', 'reference', 'function', 'with', 'exact', 'exchange', 'casdft', 'was', 'introduced', 'it', 'was', 'shown', 'by', 'one', 'of', 'the', 'authors', 'dr', 'gusarov', 'that', 'such', 'a', 'theory', 'could', 'be', 'formulated', 'by', 'introducing', 'a', 'special', 'form', 'of', 'exchangecorrelation', 'potential', 'to', 'take', 'into', 'account', 'an', 'active', 'space', 'and', 'to', 'avoid', 'double', 'counting', 'of', 'correlation', 'energy', 'the', 'dependence', 'from', 'ontop', 'pair', 'density', 'as', 'a', 'new', 'variable', 'was', 'introduced', 'unfortunately', 'this', 'requires', 'a', 'deep', 'review', 'and', 'reparametrization', 'of', 'existing', 'functional', 'expressions', 'which', 'lead', 'to', 'additional', 'computational', 'difficulties', 'the', 'presented', 'approach', 'does', 'not', 'require', 'introducing', 'additional', 'variables', 'like', 'ontop', 'pair', 'density', 'and', 'based', 'on', 'extended', 'koopmans', 'theorem', 'ekt', 'approximation', 'for', 'multiconfigurational', 'wave', 'function', 'within', 'casscf', 'method']] | [-0.07070579849283344, 0.05357821590826331, -0.14702079360972026, 0.11309998972075326, -0.07334484022576362, -0.13036863022883025, 0.06784927117654921, 0.32928489189861077, -0.19907621650823526, -0.34068902684375646, 0.009278412935756413, -0.22527527272967354, -0.17170141424451554, 0.14016360221098045, -0.014929847065026739, 0.07138783496338874, 0.00219925553621059, 0.015737743788797942, -0.09905060930343877, -0.21748131430109163, 0.28573054563852823, 0.07088475590384664, 0.27783506806673747, 0.061598245054483414, 0.10293656522075513, 0.12124677245072754, -0.042780536090556, 0.06315675948571879, -0.10795716076749419, 0.13665571289935283, 0.22487737633553997, 0.09049808068999222, 0.33268491765484215, -0.4699310794555848, -0.27084992841285255, 0.021283229492006023, 0.10945197796182973, 0.1179657791624777, -0.06512161796147536, -0.28451662573165126, 0.02421332557153489, -0.21420493694354914, -0.1428199558344204, -0.13914212133801943, 0.0013840881284392838, 0.06936167856412274, -0.28976322822938005, 0.08508039632413004, -0.00662540852957006, 0.006942044677478927, -0.090170559719471, -0.15108855834031212, -0.0009788751369342208, 0.023149493273480662, 0.010767818786137338, 0.11223229174502194, 0.11090915029386192, -0.06338432233148654, -0.07262797860852775, 0.3317740403980549, -0.07944499353346016, -0.2375519531512899, 0.15043101232731715, -0.055912073329091073, -0.16084949219200229, 0.14240402078139597, 0.11216279721619295, 0.12555150842194313, -0.17943707362615635, 0.14890360943515718, 0.0022995274415214748, 0.16139112579902368, 0.06044281896403325, 0.02101856071302401, 0.15314682043556657, 0.12330504948539393, 0.05754089694902567, 0.09516631762547019, -0.06663011826208926, -0.14202666663830835, -0.31867750539594064, -0.14797501993182646, -0.2084412462277604, 0.030769350972176264, -0.024095234440859974, -0.2147833170308981, 0.37273359145536755, 0.10198167959959911, 0.1401419288312484, 4.705536661536566e-05, 0.2705490946287422, 0.18110397998534608, 0.10891388225967863, 0.029011408369322974, 0.2017710744923014, 0.15643277348052445, 0.02780556486187769, -0.19022722907996337, 0.038736555410598936, 0.14979260218762128] |
1,802.05266 | Circular (Yet Sound) Proofs | Proofs in propositional logic are typically presented as trees of derived
formulas or, alternatively, as directed acyclic graphs of derived formulas.
This distinction between tree-like vs. dag-like structure is particularly
relevant when making quantitative considerations regarding, for example, proof
size. Here we analyze a more general type of structural restriction for proofs
in rule-based proof systems. In this definition, proofs are directed graphs of
derived formulas in which cycles are allowed as long as every formula is
derived at least as many times as it is required as a premise. We call such
proofs "circular". We show that, for all sets of standard inference rules with
single or multiple conclusions, circular proofs are sound. We start the study
of the proof complexity of circular proofs at Circular Resolution, the circular
version of Resolution. We immediately see that Circular Resolution is stronger
than Dag-like Resolution since, as we show, the propositional encoding of the
pigeonhole principle has circular Resolution proofs of polynomial size.
Furthermore, for derivations of clauses from clauses, we show that Circular
Resolution is, surprisingly, equivalent to Sherali-Adams, a proof system for
reasoning through polynomial inequalities that has linear programming at its
base. As corollaries we get: 1) polynomial-time (LP-based) algorithms that find
Circular Resolution proofs of constant width, 2) examples that separate
Circular from Dag-like Resolution, such as the pigeonhole principle and its
variants, and 3) exponentially hard cases for Circular Resolution. Contrary to
the case of Circular Resolution, for Frege we show that circular proofs can be
converted into tree-like proofs with at most polynomial overhead.
| cs.LO | proofs in propositional logic are typically presented as trees of derived formulas or alternatively as directed acyclic graphs of derived formulas this distinction between treelike vs daglike structure is particularly relevant when making quantitative considerations regarding for example proof size here we analyze a more general type of structural restriction for proofs in rulebased proof systems in this definition proofs are directed graphs of derived formulas in which cycles are allowed as long as every formula is derived at least as many times as it is required as a premise we call such proofs circular we show that for all sets of standard inference rules with single or multiple conclusions circular proofs are sound we start the study of the proof complexity of circular proofs at circular resolution the circular version of resolution we immediately see that circular resolution is stronger than daglike resolution since as we show the propositional encoding of the pigeonhole principle has circular resolution proofs of polynomial size furthermore for derivations of clauses from clauses we show that circular resolution is surprisingly equivalent to sheraliadams a proof system for reasoning through polynomial inequalities that has linear programming at its base as corollaries we get 1 polynomialtime lpbased algorithms that find circular resolution proofs of constant width 2 examples that separate circular from daglike resolution such as the pigeonhole principle and its variants and 3 exponentially hard cases for circular resolution contrary to the case of circular resolution for frege we show that circular proofs can be converted into treelike proofs with at most polynomial overhead | [['proofs', 'in', 'propositional', 'logic', 'are', 'typically', 'presented', 'as', 'trees', 'of', 'derived', 'formulas', 'or', 'alternatively', 'as', 'directed', 'acyclic', 'graphs', 'of', 'derived', 'formulas', 'this', 'distinction', 'between', 'treelike', 'vs', 'daglike', 'structure', 'is', 'particularly', 'relevant', 'when', 'making', 'quantitative', 'considerations', 'regarding', 'for', 'example', 'proof', 'size', 'here', 'we', 'analyze', 'a', 'more', 'general', 'type', 'of', 'structural', 'restriction', 'for', 'proofs', 'in', 'rulebased', 'proof', 'systems', 'in', 'this', 'definition', 'proofs', 'are', 'directed', 'graphs', 'of', 'derived', 'formulas', 'in', 'which', 'cycles', 'are', 'allowed', 'as', 'long', 'as', 'every', 'formula', 'is', 'derived', 'at', 'least', 'as', 'many', 'times', 'as', 'it', 'is', 'required', 'as', 'a', 'premise', 'we', 'call', 'such', 'proofs', 'circular', 'we', 'show', 'that', 'for', 'all', 'sets', 'of', 'standard', 'inference', 'rules', 'with', 'single', 'or', 'multiple', 'conclusions', 'circular', 'proofs', 'are', 'sound', 'we', 'start', 'the', 'study', 'of', 'the', 'proof', 'complexity', 'of', 'circular', 'proofs', 'at', 'circular', 'resolution', 'the', 'circular', 'version', 'of', 'resolution', 'we', 'immediately', 'see', 'that', 'circular', 'resolution', 'is', 'stronger', 'than', 'daglike', 'resolution', 'since', 'as', 'we', 'show', 'the', 'propositional', 'encoding', 'of', 'the', 'pigeonhole', 'principle', 'has', 'circular', 'resolution', 'proofs', 'of', 'polynomial', 'size', 'furthermore', 'for', 'derivations', 'of', 'clauses', 'from', 'clauses', 'we', 'show', 'that', 'circular', 'resolution', 'is', 'surprisingly', 'equivalent', 'to', 'sheraliadams', 'a', 'proof', 'system', 'for', 'reasoning', 'through', 'polynomial', 'inequalities', 'that', 'has', 'linear', 'programming', 'at', 'its', 'base', 'as', 'corollaries', 'we', 'get', '1', 'polynomialtime', 'lpbased', 'algorithms', 'that', 'find', 'circular', 'resolution', 'proofs', 'of', 'constant', 'width', '2', 'examples', 'that', 'separate', 'circular', 'from', 'daglike', 'resolution', 'such', 'as', 'the', 'pigeonhole', 'principle', 'and', 'its', 'variants', 'and', '3', 'exponentially', 'hard', 'cases', 'for', 'circular', 'resolution', 'contrary', 'to', 'the', 'case', 'of', 'circular', 'resolution', 'for', 'frege', 'we', 'show', 'that', 'circular', 'proofs', 'can', 'be', 'converted', 'into', 'treelike', 'proofs', 'with', 'at', 'most', 'polynomial', 'overhead']] | [-0.08684929034269943, 0.056341401150299085, -0.0856997421565088, 0.09862011951137277, -0.12052761721083154, -0.1950736952941994, 0.03505169918480182, 0.39233603834760694, -0.28851712266438095, -0.3127369033801999, 0.1461572547377587, -0.24124232911177584, -0.09509626675116682, 0.23655183361052143, -0.08738626550230634, 0.027413663031842603, 0.08611811907570018, 0.03839257696345017, -0.06677431598463919, -0.2085836998539398, 0.2574791069597394, 0.007776162673406389, 0.19801085059887022, 0.07028703468502949, 0.10982692850933232, 0.05290303528974099, -0.014130320399999619, 0.08153367121205421, -0.14557583658051076, 0.09471879329471256, 0.28865123627002576, 0.18600244317779094, 0.23527091587030663, -0.42463261611940806, -0.11281168862501281, 0.07809185309328398, 0.1675076604383444, 0.1393406113108951, 0.02580429757485646, -0.2172101412411657, 0.13400496070319967, -0.12112002861847863, -0.12598715325759932, -0.08292228210012655, 0.0777650011207146, 0.021693742439837616, -0.22393844540174296, 0.02413298494881918, 0.18798980564885848, 0.10701562107934412, -0.000831234545723812, -0.14402944447641697, 0.012753535655388271, 0.03830043608145195, -0.0008101639846649064, -0.03326008972913228, 0.08135720461936898, -0.09031048790609256, -0.20189441968129523, 0.3420371645018746, -0.011336950105482364, -0.1848313893159154, 0.16099048526705922, -0.13874814226417928, -0.20092548074067704, 0.1053917948228512, 0.11039883992544818, 0.15458670866848276, -0.08645617732519516, 0.09076467888388409, -0.12043337388553847, 0.20245310550278708, 0.20984479167200193, 0.07299554602060518, 0.16530667848949784, 0.1403075273276368, 0.10662534168915118, 0.15352822046926512, -0.019163334607344453, -0.08305605467225508, -0.3144466363697701, -0.13047452133803353, -0.15031339812791875, 0.046847891051261095, -0.13022617911944673, -0.15494661227868273, 0.30558908118733336, 0.11083029668497706, 0.1639675746346432, 0.20330602457543698, 0.30206134621526787, 0.11725847065650127, 0.07824775702895374, 0.06870834280747531, 0.1766166114706805, 0.16734747716871137, 0.07699381596944564, -0.10861198346644756, 0.0838661544909521, 0.11589999550245127] |
1,802.05267 | Reinforcement Learning with Neural Networks for Quantum Feedback | Machine learning with artificial neural networks is revolutionizing science.
The most advanced challenges require discovering answers autonomously. This is
the domain of reinforcement learning, where control strategies are improved
according to a reward function. The power of neural-network-based reinforcement
learning has been highlighted by spectacular recent successes, such as playing
Go, but its benefits for physics are yet to be demonstrated. Here, we show how
a network-based "agent" can discover complete quantum-error-correction
strategies, protecting a collection of qubits against noise. These strategies
require feedback adapted to measurement outcomes. Finding them from scratch,
without human guidance, tailored to different hardware resources, is a
formidable challenge due to the combinatorially large search space. To solve
this, we develop two ideas: two-stage learning with teacher/student networks
and a reward quantifying the capability to recover the quantum information
stored in a multi-qubit system. Beyond its immediate impact on quantum
computation, our work more generally demonstrates the promise of
neural-network-based reinforcement learning in physics.
| quant-ph | machine learning with artificial neural networks is revolutionizing science the most advanced challenges require discovering answers autonomously this is the domain of reinforcement learning where control strategies are improved according to a reward function the power of neuralnetworkbased reinforcement learning has been highlighted by spectacular recent successes such as playing go but its benefits for physics are yet to be demonstrated here we show how a networkbased agent can discover complete quantumerrorcorrection strategies protecting a collection of qubits against noise these strategies require feedback adapted to measurement outcomes finding them from scratch without human guidance tailored to different hardware resources is a formidable challenge due to the combinatorially large search space to solve this we develop two ideas twostage learning with teacherstudent networks and a reward quantifying the capability to recover the quantum information stored in a multiqubit system beyond its immediate impact on quantum computation our work more generally demonstrates the promise of neuralnetworkbased reinforcement learning in physics | [['machine', 'learning', 'with', 'artificial', 'neural', 'networks', 'is', 'revolutionizing', 'science', 'the', 'most', 'advanced', 'challenges', 'require', 'discovering', 'answers', 'autonomously', 'this', 'is', 'the', 'domain', 'of', 'reinforcement', 'learning', 'where', 'control', 'strategies', 'are', 'improved', 'according', 'to', 'a', 'reward', 'function', 'the', 'power', 'of', 'neuralnetworkbased', 'reinforcement', 'learning', 'has', 'been', 'highlighted', 'by', 'spectacular', 'recent', 'successes', 'such', 'as', 'playing', 'go', 'but', 'its', 'benefits', 'for', 'physics', 'are', 'yet', 'to', 'be', 'demonstrated', 'here', 'we', 'show', 'how', 'a', 'networkbased', 'agent', 'can', 'discover', 'complete', 'quantumerrorcorrection', 'strategies', 'protecting', 'a', 'collection', 'of', 'qubits', 'against', 'noise', 'these', 'strategies', 'require', 'feedback', 'adapted', 'to', 'measurement', 'outcomes', 'finding', 'them', 'from', 'scratch', 'without', 'human', 'guidance', 'tailored', 'to', 'different', 'hardware', 'resources', 'is', 'a', 'formidable', 'challenge', 'due', 'to', 'the', 'combinatorially', 'large', 'search', 'space', 'to', 'solve', 'this', 'we', 'develop', 'two', 'ideas', 'twostage', 'learning', 'with', 'teacherstudent', 'networks', 'and', 'a', 'reward', 'quantifying', 'the', 'capability', 'to', 'recover', 'the', 'quantum', 'information', 'stored', 'in', 'a', 'multiqubit', 'system', 'beyond', 'its', 'immediate', 'impact', 'on', 'quantum', 'computation', 'our', 'work', 'more', 'generally', 'demonstrates', 'the', 'promise', 'of', 'neuralnetworkbased', 'reinforcement', 'learning', 'in', 'physics']] | [-0.04145495561202045, 0.05956778107001004, -0.08112013266463115, 0.05454611636571515, -0.16919426948621963, -0.22512374942108423, 0.05223232190289735, 0.42175567187840424, -0.2996267978716465, -0.3595121343490444, 0.08137823452088463, -0.2448558550787783, -0.21768452009021105, 0.21148343665283645, -0.15209429671886948, 0.1079434397795438, 0.0950471828396939, 0.011962282941440899, -0.025925749308677224, -0.2878556236273998, 0.29215445311716465, 0.060196734533079346, 0.3071519882017393, 0.021908628724845527, 0.11864977138105166, -0.019298647160500382, -0.02644054155319316, -0.01997430262855244, -0.07055065988436271, 0.17347383781968428, 0.3947271670721754, 0.2385435078331399, 0.42536097775284154, -0.45104302718197997, -0.25120811914152735, 0.1449182508719637, 0.12785957537332102, 0.1625862103869219, -0.10183187317196353, -0.32309384940669555, 0.057008875529517576, -0.1877554684223112, -0.05830755982182543, -0.16391563460177777, -0.016370376539593445, -0.02943305649243277, -0.2599479766102814, -0.06775388107458248, 0.0582977344777105, 0.048802018236321736, 0.010893835170383129, -0.10251629030364388, 0.08565630597398392, 0.18671668376817804, 0.005349645262533988, 0.054042215708825926, 0.18803744848163303, -0.20578083839220337, -0.22734701401801616, 0.35427990059450837, 0.011785192241232041, -0.1816438228404739, 0.21903477996127987, -0.029625621562399253, -0.15519382194556955, 0.06732619467156031, 0.23224834539585665, 0.08385498935203481, -0.17770719741577212, 0.052867857178251695, 0.028077180479664968, 0.1651103077191105, -0.00937948977100203, 0.04453314451170685, 0.20813254828128633, 0.26553854777748825, 0.0642313250326522, 0.10833199846461014, -0.042050905714490855, -0.1379497721106038, -0.18638087483417667, -0.12518620029197935, -0.20961574717466072, 0.05430955337611015, -0.05014697036732068, -0.10739899622394314, 0.35572318259119706, 0.21396494395750917, 0.16384157549318729, 0.08911827431190052, 0.35184625463112246, 0.026878712781339506, 0.10452947456609234, 0.08139216783898588, 0.24020700253210253, 0.04378266196367862, 0.14865552884809485, -0.20028234758897673, 0.1225076815433199, -0.015048522512499196] |
1,802.05268 | A "Lagrangian" for the E7 Superconformal Theory | We find an N=1 gauge theory that flows to the rank-one N=2 superconformal
field theory with $E_7$ flavor symmetry. We first obtain a Lagrangian
description for the $R_{0, N}$ theory, which appears in the S-dual description
of the SU(N) gauge theory with 2N fundamental hypermultiplets. This is a
straightforward generalization of the proposed Lagrangian description for the
$E_6$ theory. The $E_7$ theory is then obtained via partial Higgsing of the
$R_{0, 4}$ theory. From this Lagrangian description, we compute the full
superconformal index. We also consider twisted dimensional reduction on $S^2$
to obtain N=(0, 4) theory for the $E_7$ one instanton string and compute its
elliptic genus.
| hep-th | we find an n1 gauge theory that flows to the rankone n2 superconformal field theory with e_7 flavor symmetry we first obtain a lagrangian description for the r_0 n theory which appears in the sdual description of the sun gauge theory with 2n fundamental hypermultiplets this is a straightforward generalization of the proposed lagrangian description for the e_6 theory the e_7 theory is then obtained via partial higgsing of the r_0 4 theory from this lagrangian description we compute the full superconformal index we also consider twisted dimensional reduction on s2 to obtain n0 4 theory for the e_7 one instanton string and compute its elliptic genus | [['we', 'find', 'an', 'n1', 'gauge', 'theory', 'that', 'flows', 'to', 'the', 'rankone', 'n2', 'superconformal', 'field', 'theory', 'with', 'e_7', 'flavor', 'symmetry', 'we', 'first', 'obtain', 'a', 'lagrangian', 'description', 'for', 'the', 'r_0', 'n', 'theory', 'which', 'appears', 'in', 'the', 'sdual', 'description', 'of', 'the', 'sun', 'gauge', 'theory', 'with', '2n', 'fundamental', 'hypermultiplets', 'this', 'is', 'a', 'straightforward', 'generalization', 'of', 'the', 'proposed', 'lagrangian', 'description', 'for', 'the', 'e_6', 'theory', 'the', 'e_7', 'theory', 'is', 'then', 'obtained', 'via', 'partial', 'higgsing', 'of', 'the', 'r_0', '4', 'theory', 'from', 'this', 'lagrangian', 'description', 'we', 'compute', 'the', 'full', 'superconformal', 'index', 'we', 'also', 'consider', 'twisted', 'dimensional', 'reduction', 'on', 's2', 'to', 'obtain', 'n0', '4', 'theory', 'for', 'the', 'e_7', 'one', 'instanton', 'string', 'and', 'compute', 'its', 'elliptic', 'genus']] | [-0.14322239461694367, 0.14127021716055177, -0.0770402751667436, 0.09832329446641362, -0.06134899042407486, -0.1653687058878349, -0.03510646549027378, 0.2589176495289691, -0.1952279929385007, -0.2538253505252928, 0.060078156497285956, -0.26471575950141824, -0.2058138566235272, 0.07563653400724876, -0.06261791831979127, -0.025739475845894557, -0.03996955576378887, 0.13281909567434516, -0.14440315067724577, -0.2850629455283737, 0.2717984651833355, -0.06711287470969642, 0.23740759478864548, 0.05516157550389104, 0.0817311032605575, 0.061236140722948536, -0.005500808305968748, -0.05470444561008399, -0.19115522483214964, 0.17866922485877143, 0.2644581627579423, 0.06802970857281133, 0.06544824209168693, -0.4485938427534616, -0.22311008971502186, 0.07446863509227182, 0.17506906215240745, 0.14512868245919974, 0.004434761931797681, -0.218134610209762, 0.11500086829000453, -0.2118178767230466, -0.23327822026483297, -0.08566115177892014, 0.028443845194572947, -0.15096112753255903, -0.2673160202418254, 0.053928173562483514, -0.01661921294284201, 0.11555111568671908, -0.03414947395191188, -0.08219344491817962, -0.08012007563331416, 0.04395063759358687, 0.11578960366716835, 0.0810943998170094, 0.08479014575311687, -0.18517895737559825, -0.13595437588579257, 0.4044793468212413, -0.0518345660312432, -0.22374098287529756, 0.09902459473096739, -0.09513009538891438, -0.23135218034263386, 0.10468649980829697, 0.08851502349199815, 0.19003957301317323, -0.05054396913151875, 0.2501635309303327, -0.11513670365474074, 0.1436867392143217, 0.08458427879437108, -0.023211323042513332, 0.16516767726845552, 0.0786334705826278, 0.07594679068843617, 0.07148020543924002, 0.012965268705684308, -0.1259543067714739, -0.4528506637037357, -0.12930290375522852, -0.08407817957008902, 0.19471917636300845, -0.18776084999589218, -0.15633386801319005, 0.37333297010545974, 0.08522129853236463, 0.14987626435696452, 0.12077545952682914, 0.2032952496834169, 0.14420637520569785, 0.03482575520054899, 0.006208423424999569, 0.1780362858863495, 0.2497009957104782, -0.007017576157454854, -0.23153718589113104, -0.248611066790698, 0.30718636863525506] |
1,802.05269 | Empirical Tidal Dissipation in Exoplanet Hosts From Tidal Spin-Up | Stars with hot Jupiters tend to be rotating faster than other stars of the
same age and mass. This trend has been attributed to tidal interactions between
the star and planet. A constraint on the dissipation parameter $Q_\star'$
follows from the assumption that tides have managed to spin up the star to the
observed rate within the age of the system. This technique was applied
previously to HATS-18 and WASP-19. Here we analyze the sample of all 188 known
hot Jupiters with an orbital period $< 3.5$ days and a "cool" host star
($T_{eff} < 6100$ K). We find evidence that the tidal dissipation parameter
($Q_\star'$) increases sharply with forcing frequency, from $10^5$ at 0.5
day$^{-1}$ to $10^7$ at 2 day$^{-1}$. This helps to resolve a number of
apparent discrepancies between studies of tidal dissipation in binary stars,
hot Jupiters, and warm Jupiters. It may also allow for a hot Jupiter to damp
the obliquity of its host star prior to being destroyed by tidal decay.
| astro-ph.SR astro-ph.EP | stars with hot jupiters tend to be rotating faster than other stars of the same age and mass this trend has been attributed to tidal interactions between the star and planet a constraint on the dissipation parameter q_star follows from the assumption that tides have managed to spin up the star to the observed rate within the age of the system this technique was applied previously to hats18 and wasp19 here we analyze the sample of all 188 known hot jupiters with an orbital period 35 days and a cool host star t_eff 6100 k we find evidence that the tidal dissipation parameter q_star increases sharply with forcing frequency from 105 at 05 day1 to 107 at 2 day1 this helps to resolve a number of apparent discrepancies between studies of tidal dissipation in binary stars hot jupiters and warm jupiters it may also allow for a hot jupiter to damp the obliquity of its host star prior to being destroyed by tidal decay | [['stars', 'with', 'hot', 'jupiters', 'tend', 'to', 'be', 'rotating', 'faster', 'than', 'other', 'stars', 'of', 'the', 'same', 'age', 'and', 'mass', 'this', 'trend', 'has', 'been', 'attributed', 'to', 'tidal', 'interactions', 'between', 'the', 'star', 'and', 'planet', 'a', 'constraint', 'on', 'the', 'dissipation', 'parameter', 'q_star', 'follows', 'from', 'the', 'assumption', 'that', 'tides', 'have', 'managed', 'to', 'spin', 'up', 'the', 'star', 'to', 'the', 'observed', 'rate', 'within', 'the', 'age', 'of', 'the', 'system', 'this', 'technique', 'was', 'applied', 'previously', 'to', 'hats18', 'and', 'wasp19', 'here', 'we', 'analyze', 'the', 'sample', 'of', 'all', '188', 'known', 'hot', 'jupiters', 'with', 'an', 'orbital', 'period', '35', 'days', 'and', 'a', 'cool', 'host', 'star', 't_eff', '6100', 'k', 'we', 'find', 'evidence', 'that', 'the', 'tidal', 'dissipation', 'parameter', 'q_star', 'increases', 'sharply', 'with', 'forcing', 'frequency', 'from', '105', 'at', '05', 'day1', 'to', '107', 'at', '2', 'day1', 'this', 'helps', 'to', 'resolve', 'a', 'number', 'of', 'apparent', 'discrepancies', 'between', 'studies', 'of', 'tidal', 'dissipation', 'in', 'binary', 'stars', 'hot', 'jupiters', 'and', 'warm', 'jupiters', 'it', 'may', 'also', 'allow', 'for', 'a', 'hot', 'jupiter', 'to', 'damp', 'the', 'obliquity', 'of', 'its', 'host', 'star', 'prior', 'to', 'being', 'destroyed', 'by', 'tidal', 'decay']] | [-0.10619199859404656, 0.20661707499382873, -0.078706234614379, 0.07540889041251275, -0.12484197799867394, -0.04620918930542269, 0.09837116359835263, 0.3508930283303304, -0.1891911066784637, -0.3909580056760006, 0.05434891265013437, -0.29287822625213644, -0.02288364485564937, 0.20495480150211512, -0.0817899794236859, -0.018329505119032634, 0.07312579342964809, 0.010587164567124734, -0.03293603828472153, -0.2623443697726854, 0.23434047922264875, 0.06906270768447983, 0.05648054921766743, 0.012627177151976289, 0.013079360862853141, -0.11837052410644502, -0.009426627403072638, -0.06365596014358921, -0.20122423910909606, -0.026642017861510197, 0.20471940836414876, 0.10548807628503887, 0.24957866388055064, -0.37306378921471706, -0.21405835673812829, 0.05732706750575567, 0.17516467694005725, 0.03691775614974975, -0.016490681523530993, -0.23384211622192752, 0.10543043523027402, -0.2532695604136168, -0.16229739327110754, 0.03843861084826086, 0.11577567606653291, -0.01636487341815288, -0.28269577227396575, 0.15650969311909427, 0.09681363380230146, 0.10473264313711808, -0.1158831591636976, -0.11540887139030596, -0.0706034941292118, 0.050949418962728685, 0.11023710128033488, 0.10421165239588334, 0.17951918507233353, -0.05052498158950518, 0.0035040866038421304, 0.4006771710133407, -0.12703939450334362, -0.0026053036392734547, 0.2650278649355353, -0.2330197280005938, -0.10996340760459311, 0.16387632487358797, 0.17097153660657435, 0.10994039344737624, -0.1664356031112952, -0.06299484235116723, 0.010298784311133914, 0.19778149023370975, 0.10482787257543107, 0.04353701892002236, 0.37358105182647705, 0.12259177593713082, 0.04527210456421372, 0.06989169484763917, -0.21839282972945423, -0.05592129277647473, -0.12202733187950798, -0.06151578217555297, -0.13432093671410877, 0.06287646248351737, -0.11285479593886809, -0.08202019792402208, 0.32308447788428324, 0.15643195762858364, 0.20134424995744554, 0.030816566180608167, 0.2918444489378755, 0.09279357171872994, 0.14529497495814434, 0.1725647469028467, 0.31557101458765385, 0.21273443520370097, 0.08590538213675467, -0.30588444705382445, 0.0750116920666542, -0.05833993787116303] |
1,802.0527 | Digital Fourier transform spectroscopy: a high-performance, scalable
technology for on-chip spectrum analysis | Optical spectrum analysis is the cornerstone of spectroscopic sensing,
optical network performance monitoring, and hyperspectral imaging. While
conventional high-performance spectrometers used to perform such analysis are
often large benchtop instruments, on-chip spectrometers have recently emerged
as a promising alternative with apparent Size, Weight, and Power (SWaP)
advantages. Existing on-chip spectrometer designs, however, are limited in
spectral channel count and signal-to-noise ratio (SNR). Here we demonstrate a
transformative on-chip digital Fourier transform (dFT) spectrometer that can
acquire high-resolution spectra via time- domain modulation of a reconfigurable
Mach-Zehnder interferometer. The device, fabricated and packaged using
industry-standard silicon photonics technology, claims the multiplex advantage
to dramatically boost SNR and unprecedented scalability capable of addressing
exponentially increasing numbers of spectral channels. We further implemented
machine learning regularization techniques to spectrum reconstruction and
achieved significant noise suppression and spectral resolution enhancement
beyond the classical Rayleigh criterion.
| physics.app-ph physics.optics | optical spectrum analysis is the cornerstone of spectroscopic sensing optical network performance monitoring and hyperspectral imaging while conventional highperformance spectrometers used to perform such analysis are often large benchtop instruments onchip spectrometers have recently emerged as a promising alternative with apparent size weight and power swap advantages existing onchip spectrometer designs however are limited in spectral channel count and signaltonoise ratio snr here we demonstrate a transformative onchip digital fourier transform dft spectrometer that can acquire highresolution spectra via time domain modulation of a reconfigurable machzehnder interferometer the device fabricated and packaged using industrystandard silicon photonics technology claims the multiplex advantage to dramatically boost snr and unprecedented scalability capable of addressing exponentially increasing numbers of spectral channels we further implemented machine learning regularization techniques to spectrum reconstruction and achieved significant noise suppression and spectral resolution enhancement beyond the classical rayleigh criterion | [['optical', 'spectrum', 'analysis', 'is', 'the', 'cornerstone', 'of', 'spectroscopic', 'sensing', 'optical', 'network', 'performance', 'monitoring', 'and', 'hyperspectral', 'imaging', 'while', 'conventional', 'highperformance', 'spectrometers', 'used', 'to', 'perform', 'such', 'analysis', 'are', 'often', 'large', 'benchtop', 'instruments', 'onchip', 'spectrometers', 'have', 'recently', 'emerged', 'as', 'a', 'promising', 'alternative', 'with', 'apparent', 'size', 'weight', 'and', 'power', 'swap', 'advantages', 'existing', 'onchip', 'spectrometer', 'designs', 'however', 'are', 'limited', 'in', 'spectral', 'channel', 'count', 'and', 'signaltonoise', 'ratio', 'snr', 'here', 'we', 'demonstrate', 'a', 'transformative', 'onchip', 'digital', 'fourier', 'transform', 'dft', 'spectrometer', 'that', 'can', 'acquire', 'highresolution', 'spectra', 'via', 'time', 'domain', 'modulation', 'of', 'a', 'reconfigurable', 'machzehnder', 'interferometer', 'the', 'device', 'fabricated', 'and', 'packaged', 'using', 'industrystandard', 'silicon', 'photonics', 'technology', 'claims', 'the', 'multiplex', 'advantage', 'to', 'dramatically', 'boost', 'snr', 'and', 'unprecedented', 'scalability', 'capable', 'of', 'addressing', 'exponentially', 'increasing', 'numbers', 'of', 'spectral', 'channels', 'we', 'further', 'implemented', 'machine', 'learning', 'regularization', 'techniques', 'to', 'spectrum', 'reconstruction', 'and', 'achieved', 'significant', 'noise', 'suppression', 'and', 'spectral', 'resolution', 'enhancement', 'beyond', 'the', 'classical', 'rayleigh', 'criterion']] | [-0.12096064254073492, 0.04486265221358019, -0.08045712619663235, 0.0020413213753775554, -0.08908403395008005, -0.24314967151533098, 0.0348305354647814, 0.4949223948378407, -0.24013043456572167, -0.35596287142194755, 0.11607865767936545, -0.2589883722739743, -0.1298098186929281, 0.2609646463294428, -0.07647275941195429, 0.1530870501825533, 0.12341218693710282, -0.11809077989951446, -0.03440932069631815, -0.1660242071903661, 0.1704078650858306, 0.18651940283887353, 0.42726439957222934, 0.006616137413215552, 0.11939511797550846, -0.0057464137488434505, -0.07293925583296527, -0.028703259338017102, -0.054585465286449274, 0.1250749399971402, 0.3271170551839106, 0.1336676816832512, 0.2635967248773321, -0.42829280398482233, -0.2702199874971316, 0.08286606019085392, 0.224378320011591, 0.00979039187424202, -0.10370311886815235, -0.27446451175013387, 0.05882070960430759, -0.1939552768516678, -0.08145911906885499, -0.13246878552731914, -0.05540808315590315, 0.012581383449055175, -0.24113650849181498, 0.01169800158616499, -0.030142508949159732, 0.08926949121969495, -0.010725653192015194, -0.14278640622497663, 0.07601101821328098, 0.07241436328197308, -0.08801511270927054, -0.027325200693060953, 0.17603443940797597, -0.12297126297436073, -0.1335056668249824, 0.29597419577465783, -0.06711427264694944, -0.08826130810391872, 0.16059378887970885, -0.133492554535475, -0.0769331979281302, 0.16600272668267976, 0.17503617207498243, 0.048921609242902474, -0.12295494737856566, 0.04606429686652602, 0.08557321213132946, 0.24783459254903784, 0.10877724931119605, 0.21943835818856056, 0.1894188232584493, 0.2316032826623067, 0.025409572690078024, 0.13346195432558947, -0.2225980257932493, -0.002617330739525616, -0.15984202847413137, -0.1548163118022527, -0.2361308534209392, 0.03438589252789128, -0.08695330939361749, -0.11219634512498816, 0.3432319442550024, 0.16529138465634885, 0.10653655601546486, 0.005272209934943112, 0.45546289187268163, 0.08649949506953102, 0.17235692663131452, -0.016456152322365247, 0.2278352569076992, 0.1555463490439645, 0.19165248565329568, -0.21759613145866055, -0.045708671090620774, -0.04103817439519186] |
1,802.05271 | From mean-field localized magnetism to itinerant spin fluctuations in
the "Non-metallic metal" - FeCrAs | FeCrAs displays an unusual electrical response that is neither metallic in
character nor divergent at low temperatures, as expected for an insulating
response, and therefore it has been termed a "nonmetal-metal". We carried out
neutron scattering experiments on powder and single crystal samples to study
the magnetic dynamics and critical fluctuations in FeCrAs. Magnetic neutron
diffraction measurements find Cr3+ magnetic order setting in at 115 K with the
mean-field critical exponent. Neutron spectroscopy, however, observes gapless
stiff magnetic fluctuations emanating from magnetic positions with propagation
wave vector q_0=(1/3,1/3), which persists up to at least 80 meV. The magnetism
in FeCrAs therefore displays a response which resembles that of itinerant
magnets at high energy transfers, such as chromium alloys. We suggest that the
presence of stiff high-energy spin fluctuations is the origin of the unusual
temperature dependence of the resistivity.
| cond-mat.str-el | fecras displays an unusual electrical response that is neither metallic in character nor divergent at low temperatures as expected for an insulating response and therefore it has been termed a nonmetalmetal we carried out neutron scattering experiments on powder and single crystal samples to study the magnetic dynamics and critical fluctuations in fecras magnetic neutron diffraction measurements find cr3 magnetic order setting in at 115 k with the meanfield critical exponent neutron spectroscopy however observes gapless stiff magnetic fluctuations emanating from magnetic positions with propagation wave vector q_01313 which persists up to at least 80 mev the magnetism in fecras therefore displays a response which resembles that of itinerant magnets at high energy transfers such as chromium alloys we suggest that the presence of stiff highenergy spin fluctuations is the origin of the unusual temperature dependence of the resistivity | [['fecras', 'displays', 'an', 'unusual', 'electrical', 'response', 'that', 'is', 'neither', 'metallic', 'in', 'character', 'nor', 'divergent', 'at', 'low', 'temperatures', 'as', 'expected', 'for', 'an', 'insulating', 'response', 'and', 'therefore', 'it', 'has', 'been', 'termed', 'a', 'nonmetalmetal', 'we', 'carried', 'out', 'neutron', 'scattering', 'experiments', 'on', 'powder', 'and', 'single', 'crystal', 'samples', 'to', 'study', 'the', 'magnetic', 'dynamics', 'and', 'critical', 'fluctuations', 'in', 'fecras', 'magnetic', 'neutron', 'diffraction', 'measurements', 'find', 'cr3', 'magnetic', 'order', 'setting', 'in', 'at', '115', 'k', 'with', 'the', 'meanfield', 'critical', 'exponent', 'neutron', 'spectroscopy', 'however', 'observes', 'gapless', 'stiff', 'magnetic', 'fluctuations', 'emanating', 'from', 'magnetic', 'positions', 'with', 'propagation', 'wave', 'vector', 'q_01313', 'which', 'persists', 'up', 'to', 'at', 'least', '80', 'mev', 'the', 'magnetism', 'in', 'fecras', 'therefore', 'displays', 'a', 'response', 'which', 'resembles', 'that', 'of', 'itinerant', 'magnets', 'at', 'high', 'energy', 'transfers', 'such', 'as', 'chromium', 'alloys', 'we', 'suggest', 'that', 'the', 'presence', 'of', 'stiff', 'highenergy', 'spin', 'fluctuations', 'is', 'the', 'origin', 'of', 'the', 'unusual', 'temperature', 'dependence', 'of', 'the', 'resistivity']] | [-0.1618075246848436, 0.26566591967707937, -0.06927225474551645, 0.02874637416570677, -0.04970827781526959, -0.12890666398638184, 0.05817645878625521, 0.3755364798927221, -0.24577505097366395, -0.30739004357947386, 0.019123455965081634, -0.39674726039495156, -0.07795013274754518, 0.16346991172843223, 0.09021548056625761, -0.010690642024069413, -0.05971335083840118, 0.043491822533711005, -0.10779487217381678, -0.15308218158737663, 0.25198857557109516, 0.08829686083945622, 0.3191930710783471, 0.083475941277541, 0.09081013650849354, 0.014863688837858323, 0.1532958435414332, 0.02952907852612544, -0.10039310094446367, -0.05504103011174964, 0.2721432233094305, -0.1129082868911623, 0.1773128589493749, -0.43369640428927203, -0.225348436732547, 0.03221568923807987, 0.14063079585658683, 0.08877885213924869, -0.07912725726297747, -0.21228298027257342, 0.06467972057525649, -0.1034690284818087, -0.1753676965895136, -0.1359613056908753, -0.0006882635525603225, 0.008052629642222293, -0.2480263377175383, 0.1363300759449898, 0.05659711822206019, 0.12649504970624179, -0.1329394554199678, -0.12075371231607067, -0.04545772412751356, 0.013116826337046814, 0.08726815312115503, 0.09011321957729271, 0.18128855772100497, -0.13667056984875514, -0.0857439281999309, 0.33474633105747076, -0.043536523941641106, -0.006153337913902773, 0.17050124617610668, -0.25156770953701885, -0.12735508388731684, 0.26079824747369235, 0.12121498528690806, 0.08873963547344117, -0.1318993210873526, 0.02439445097811783, 0.0011533056774920703, 0.2149914604395736, 0.04087178016324406, 0.06930810549174962, 0.29930407792140823, 0.22008868626764286, -0.019943466011866712, 0.1413393812658994, -0.18264533823146822, -0.016444188238971907, -0.2235989473807369, -0.10165180665933514, -0.2050408559490292, 0.1073182337051443, -0.07538155780776583, -0.20640800521811098, 0.32661212255260436, 0.15870205134421628, 0.15206184114693946, -0.07952960814936491, 0.24370665845872017, 0.0978034139261581, 0.06585096850302881, 0.09306031959873719, 0.26133031926144834, 0.1906918127535154, 0.17283002543263137, -0.30701152186510083, 0.09707031680770434, -0.04468966942226541] |
1,802.05272 | The JWST Extragalactic Mock Catalog: Modeling galaxy populations from
the UV through the near-IR over thirteen billion years of cosmic history | We present an original phenomenological model to describe the evolution of
galaxy number counts, morphologies, and spectral energy distributions across a
wide range of redshifts (0.2<z<15) and stellar masses [Log10 M/Msun >6]. Our
model follows observed mass and luminosity functions of both star-forming and
quiescent galaxies, and reproduces the redshift evolution of colors, sizes,
star-formation and chemical properties of the observed galaxy population.
Unlike other existing approaches, our model includes a self-consistent
treatment of stellar and photoionized gas emission and dust attenuation based
on the BEAGLE tool. The mock galaxy catalogs generated with our new model can
be used to simulate and optimize extragalactic surveys with future facilities
such as the James Webb Space Telescope (JWST), and to enable critical
assessments of analysis procedures, interpretation tools, and measurement
systematics for both photometric and spectroscopic data. As a first application
of this work, we make predictions for the upcoming JWST Advanced Deep
Extragalactic Survey (JADES), a joint program of the JWST/NIRCam and NIRSpec
Guaranteed Time Observations teams. We show that JADES will detect, with NIRCam
imaging, thousands of galaxies at z>6, and tens at z>10 at m_AB<30 (5-sigma)
within the 236 arcmin^2 of the survey. The JADES data will enable accurate
constraints on the evolution of the UV luminosity function at z>8, and resolve
the current debate about the rate of evolution of galaxies at z>8. Ready to use
mock catalogs and software to generate new realizations are publicly available
as the JAdes extraGalactic Ultradeep Artificial Realizations (JAGUAR) package.
| astro-ph.GA | we present an original phenomenological model to describe the evolution of galaxy number counts morphologies and spectral energy distributions across a wide range of redshifts 02z15 and stellar masses log10 mmsun 6 our model follows observed mass and luminosity functions of both starforming and quiescent galaxies and reproduces the redshift evolution of colors sizes starformation and chemical properties of the observed galaxy population unlike other existing approaches our model includes a selfconsistent treatment of stellar and photoionized gas emission and dust attenuation based on the beagle tool the mock galaxy catalogs generated with our new model can be used to simulate and optimize extragalactic surveys with future facilities such as the james webb space telescope jwst and to enable critical assessments of analysis procedures interpretation tools and measurement systematics for both photometric and spectroscopic data as a first application of this work we make predictions for the upcoming jwst advanced deep extragalactic survey jades a joint program of the jwstnircam and nirspec guaranteed time observations teams we show that jades will detect with nircam imaging thousands of galaxies at z6 and tens at z10 at m_ab30 5sigma within the 236 arcmin2 of the survey the jades data will enable accurate constraints on the evolution of the uv luminosity function at z8 and resolve the current debate about the rate of evolution of galaxies at z8 ready to use mock catalogs and software to generate new realizations are publicly available as the jades extragalactic ultradeep artificial realizations jaguar package | [['we', 'present', 'an', 'original', 'phenomenological', 'model', 'to', 'describe', 'the', 'evolution', 'of', 'galaxy', 'number', 'counts', 'morphologies', 'and', 'spectral', 'energy', 'distributions', 'across', 'a', 'wide', 'range', 'of', 'redshifts', '02z15', 'and', 'stellar', 'masses', 'log10', 'mmsun', '6', 'our', 'model', 'follows', 'observed', 'mass', 'and', 'luminosity', 'functions', 'of', 'both', 'starforming', 'and', 'quiescent', 'galaxies', 'and', 'reproduces', 'the', 'redshift', 'evolution', 'of', 'colors', 'sizes', 'starformation', 'and', 'chemical', 'properties', 'of', 'the', 'observed', 'galaxy', 'population', 'unlike', 'other', 'existing', 'approaches', 'our', 'model', 'includes', 'a', 'selfconsistent', 'treatment', 'of', 'stellar', 'and', 'photoionized', 'gas', 'emission', 'and', 'dust', 'attenuation', 'based', 'on', 'the', 'beagle', 'tool', 'the', 'mock', 'galaxy', 'catalogs', 'generated', 'with', 'our', 'new', 'model', 'can', 'be', 'used', 'to', 'simulate', 'and', 'optimize', 'extragalactic', 'surveys', 'with', 'future', 'facilities', 'such', 'as', 'the', 'james', 'webb', 'space', 'telescope', 'jwst', 'and', 'to', 'enable', 'critical', 'assessments', 'of', 'analysis', 'procedures', 'interpretation', 'tools', 'and', 'measurement', 'systematics', 'for', 'both', 'photometric', 'and', 'spectroscopic', 'data', 'as', 'a', 'first', 'application', 'of', 'this', 'work', 'we', 'make', 'predictions', 'for', 'the', 'upcoming', 'jwst', 'advanced', 'deep', 'extragalactic', 'survey', 'jades', 'a', 'joint', 'program', 'of', 'the', 'jwstnircam', 'and', 'nirspec', 'guaranteed', 'time', 'observations', 'teams', 'we', 'show', 'that', 'jades', 'will', 'detect', 'with', 'nircam', 'imaging', 'thousands', 'of', 'galaxies', 'at', 'z6', 'and', 'tens', 'at', 'z10', 'at', 'm_ab30', '5sigma', 'within', 'the', '236', 'arcmin2', 'of', 'the', 'survey', 'the', 'jades', 'data', 'will', 'enable', 'accurate', 'constraints', 'on', 'the', 'evolution', 'of', 'the', 'uv', 'luminosity', 'function', 'at', 'z8', 'and', 'resolve', 'the', 'current', 'debate', 'about', 'the', 'rate', 'of', 'evolution', 'of', 'galaxies', 'at', 'z8', 'ready', 'to', 'use', 'mock', 'catalogs', 'and', 'software', 'to', 'generate', 'new', 'realizations', 'are', 'publicly', 'available', 'as', 'the', 'jades', 'extragalactic', 'ultradeep', 'artificial', 'realizations', 'jaguar', 'package']] | [-0.005802250125921498, 0.054323295101571197, -0.08286173479646687, 0.12708346398757409, -0.12554539492868674, -0.049076072038794924, 0.0325226332695125, 0.4466401591624429, -0.13469601682637158, -0.3992726897718612, 0.07082157446037433, -0.31027337332347, -0.018839774083542992, 0.24010952824075532, 0.013354796637038936, 0.03671281121489478, 0.07993886871376961, -0.16219079397368905, -0.026156763581602127, -0.3315357606956448, 0.27466010417016906, 0.12219279200466618, 0.19871617002389963, -0.03774633958398145, 0.08807665285961021, -0.05504932509625437, -0.15264710402485301, -0.053474635438642434, -0.19519075612839604, 0.041668423440125654, 0.2926422154523311, 0.21393447890839865, 0.23480996965597256, -0.3454861242316542, -0.20507898928627857, 0.07834779535518671, 0.15886524421553558, 0.05865116651752979, -0.03774532290910015, -0.297431519285329, 0.02774251192667128, -0.1745229823707898, -0.17881602859427412, 0.002185711435542056, -0.017159038106910884, 0.056834702146224436, -0.23573970160758448, 0.09213884627423817, -0.0748323200604636, 0.10562102985000466, -0.11596057006315048, -0.11363231216943483, -0.0696915422553931, 0.10612525805387063, -0.04404775483715462, 0.09885348255577596, 0.17249836071348953, -0.17914767576759205, -0.04674539752058473, 0.3856250884151465, -0.07746397084045428, 0.025403435300369332, 0.2044421956463664, -0.18012526390952913, -0.2045352672474228, 0.08465116351324217, 0.20989392742105736, 0.09587968439166623, -0.1747223733454882, 0.029931328878397258, 0.02426532652168497, 0.2189825234094226, -0.014889972787956155, 0.0782110549452619, 0.3180545960729033, 0.1326704069778486, 0.03320460622691042, 0.06477379026850903, -0.22494962170901822, 0.011178138010900437, -0.28221087541092355, -0.09235218793528327, -0.14377296448787447, 0.085390620168802, -0.11418247933791027, -0.10537670582532409, 0.37234838979651896, 0.20581275468116733, 0.1826804137374161, 0.1454007719179409, 0.3273501745198013, 0.018439912689637725, 0.13534738475549588, 0.04633065625056019, 0.2548989651557172, 0.11042129514621556, 0.0854015239974393, -0.1884627260979477, 0.023544397436998543, -0.03608341277737882] |
1,802.05273 | Reinterpreting Low Frequency LIGO/Virgo Events as Magnified Stellar-Mass
Black Holes at Cosmological Distances | Gravitational waves can be focussed by the gravity of an intervening galaxy,
just like light, thereby magnifying binary merging events in the far Universe.
High magnification by galaxies is found to be responsible for the brightest
sources detected in sky surveys, but the low angular resolution of LIGO/Virgo
is insufficient to check this lensing possibility directly. Here we find that
the first six binary black hole (BBH) merging events reported by LIGO/Virgo
show clear evidence for lensing in the plane of observed mass and source
distance. The four lowest frequency events follow an apparent locus in this
plane, which we can reproduce by galaxy lensing, where the higher the
magnification, the generally more distant the source so the wave train is
stretched more by the Universal expansion, by factors of 2-4. This revises the
reported BBH distances upwards by an order of magnitude, equal to the square
root of the magnification. Furthermore, the reported black hole masses must be
decreased by 2-4 to counter the larger stretch factor, since the orbital
frequency is used to derive the black hole masses. This lowers the masses to
5-15 solar masses, well below the puzzlingly high values of 20-35 solar masses
otherwise estimated, with the attraction of finding agreement in mass with
black holes orbiting stars in our own Galaxy, thereby implying a stellar origin
for the low frequency events in the far Universe. We also show that the other
two BBH events of higher frequency detected by LIGO/VIRGO, lie well below the
lensing locus, consistent with being nearby and unlensed. If this apparent
division between local and distant lensed events is reinforced by new
detections then the spins and masses of stellar black holes can be compared
over a timespan of 10 billion years by LIGO/Virgo.
| astro-ph.CO gr-qc | gravitational waves can be focussed by the gravity of an intervening galaxy just like light thereby magnifying binary merging events in the far universe high magnification by galaxies is found to be responsible for the brightest sources detected in sky surveys but the low angular resolution of ligovirgo is insufficient to check this lensing possibility directly here we find that the first six binary black hole bbh merging events reported by ligovirgo show clear evidence for lensing in the plane of observed mass and source distance the four lowest frequency events follow an apparent locus in this plane which we can reproduce by galaxy lensing where the higher the magnification the generally more distant the source so the wave train is stretched more by the universal expansion by factors of 24 this revises the reported bbh distances upwards by an order of magnitude equal to the square root of the magnification furthermore the reported black hole masses must be decreased by 24 to counter the larger stretch factor since the orbital frequency is used to derive the black hole masses this lowers the masses to 515 solar masses well below the puzzlingly high values of 2035 solar masses otherwise estimated with the attraction of finding agreement in mass with black holes orbiting stars in our own galaxy thereby implying a stellar origin for the low frequency events in the far universe we also show that the other two bbh events of higher frequency detected by ligovirgo lie well below the lensing locus consistent with being nearby and unlensed if this apparent division between local and distant lensed events is reinforced by new detections then the spins and masses of stellar black holes can be compared over a timespan of 10 billion years by ligovirgo | [['gravitational', 'waves', 'can', 'be', 'focussed', 'by', 'the', 'gravity', 'of', 'an', 'intervening', 'galaxy', 'just', 'like', 'light', 'thereby', 'magnifying', 'binary', 'merging', 'events', 'in', 'the', 'far', 'universe', 'high', 'magnification', 'by', 'galaxies', 'is', 'found', 'to', 'be', 'responsible', 'for', 'the', 'brightest', 'sources', 'detected', 'in', 'sky', 'surveys', 'but', 'the', 'low', 'angular', 'resolution', 'of', 'ligovirgo', 'is', 'insufficient', 'to', 'check', 'this', 'lensing', 'possibility', 'directly', 'here', 'we', 'find', 'that', 'the', 'first', 'six', 'binary', 'black', 'hole', 'bbh', 'merging', 'events', 'reported', 'by', 'ligovirgo', 'show', 'clear', 'evidence', 'for', 'lensing', 'in', 'the', 'plane', 'of', 'observed', 'mass', 'and', 'source', 'distance', 'the', 'four', 'lowest', 'frequency', 'events', 'follow', 'an', 'apparent', 'locus', 'in', 'this', 'plane', 'which', 'we', 'can', 'reproduce', 'by', 'galaxy', 'lensing', 'where', 'the', 'higher', 'the', 'magnification', 'the', 'generally', 'more', 'distant', 'the', 'source', 'so', 'the', 'wave', 'train', 'is', 'stretched', 'more', 'by', 'the', 'universal', 'expansion', 'by', 'factors', 'of', '24', 'this', 'revises', 'the', 'reported', 'bbh', 'distances', 'upwards', 'by', 'an', 'order', 'of', 'magnitude', 'equal', 'to', 'the', 'square', 'root', 'of', 'the', 'magnification', 'furthermore', 'the', 'reported', 'black', 'hole', 'masses', 'must', 'be', 'decreased', 'by', '24', 'to', 'counter', 'the', 'larger', 'stretch', 'factor', 'since', 'the', 'orbital', 'frequency', 'is', 'used', 'to', 'derive', 'the', 'black', 'hole', 'masses', 'this', 'lowers', 'the', 'masses', 'to', '515', 'solar', 'masses', 'well', 'below', 'the', 'puzzlingly', 'high', 'values', 'of', '2035', 'solar', 'masses', 'otherwise', 'estimated', 'with', 'the', 'attraction', 'of', 'finding', 'agreement', 'in', 'mass', 'with', 'black', 'holes', 'orbiting', 'stars', 'in', 'our', 'own', 'galaxy', 'thereby', 'implying', 'a', 'stellar', 'origin', 'for', 'the', 'low', 'frequency', 'events', 'in', 'the', 'far', 'universe', 'we', 'also', 'show', 'that', 'the', 'other', 'two', 'bbh', 'events', 'of', 'higher', 'frequency', 'detected', 'by', 'ligovirgo', 'lie', 'well', 'below', 'the', 'lensing', 'locus', 'consistent', 'with', 'being', 'nearby', 'and', 'unlensed', 'if', 'this', 'apparent', 'division', 'between', 'local', 'and', 'distant', 'lensed', 'events', 'is', 'reinforced', 'by', 'new', 'detections', 'then', 'the', 'spins', 'and', 'masses', 'of', 'stellar', 'black', 'holes', 'can', 'be', 'compared', 'over', 'a', 'timespan', 'of', '10', 'billion', 'years', 'by', 'ligovirgo']] | [-0.11833788633590475, 0.15613586590188788, -0.006214265838316103, 0.13166103568751694, -0.09283792737971985, -0.05724319314337051, 0.0374091321089286, 0.35316304472547505, -0.15740864404441937, -0.36862316150788443, 0.06188511902440282, -0.3190627603785319, -0.05426146128036412, 0.2338859997285834, -0.010362672410053233, -0.010250689781721932, 0.04992616449508081, -0.00642393601956923, -0.08078417646204483, -0.2822081861814775, 0.3104345671718027, 0.12555497007279778, 0.16311093504527951, -0.03755089326533584, 0.09363632086430024, -0.04854206826544183, -0.05310115871216855, 0.003903180867636285, -0.13190954037789346, 0.025918140373870628, 0.23908499388584906, 0.13359058936614365, 0.21257451411533063, -0.3431170333357414, -0.19783923522427482, 0.09117436190262487, 0.19887287503498016, 0.10200876650399668, -0.06372505277017097, -0.31142290045117615, 0.09463956352120557, -0.20792312129493923, -0.17824181270639913, 0.06256079652186698, 0.06997811554322894, 0.017195379137786956, -0.18543593286295884, 0.16886807192339906, 0.030696271048370926, -0.001991204955444044, -0.08178151158859864, -0.061909089468381535, -0.07348759972678852, 0.08096766900144467, 0.07570495692574336, 0.08546652241378744, 0.16675224562720428, -0.10093167034804593, -0.10036567604837647, 0.3817008396192473, -0.05588541773177975, -0.06015152344876128, 0.1695654286142141, -0.2744228554759681, -0.12188755489290268, 0.16354502018914893, 0.14911948194090582, 0.10753976931884769, -0.19307887278395058, -0.014331888290459519, 0.039073301643993606, 0.2320286319468354, 0.1311383993708573, 0.051965134895370434, 0.39333459082990885, 0.11446620005049876, 0.0606854643869106, 0.07822843897651381, -0.18503733978093584, 0.006368979800581222, -0.2192958126630203, -0.06444035649305957, -0.17726989387697697, 0.0996466227626443, -0.17239089076526837, -0.09427284351395614, 0.3363318065162368, 0.13691387703914676, 0.22790626668985806, 0.05984515550848869, 0.300976571089753, 0.09718105239955215, 0.13234461254446583, 0.08051527811999933, 0.4011871427500329, 0.11515572402692799, 0.053680931717287245, -0.19725430974511898, 0.035839298706767816, 0.008340412464157558] |
1,802.05274 | Hydrodynamical Neutron-star Kicks in Electron-capture Supernovae and
Implications for the CRAB Supernova | Neutron stars (NSs) obtain kicks of typically several 100 km/s at birth. The
gravitational tug-boat mechanism can explain these kicks as consequences of
asymmetric mass ejection during the supernova (SN) explosion. Support for this
hydrodynamic explanation is provided by observations of SN remnants with
associated NSs, which confirm the prediction that the bulk of the explosion
ejecta, in particular chemical elements between silicon and the iron group, are
dominantly expelled in the hemisphere opposite to the direction of the NS kick.
Here, we present a large set of two- and three-dimensional explosion
simulations of electron-capture SNe, considering explosion energies between
~3x10^49 erg and ~1.6x10^50 erg. We find that the fast acceleration of the SN
shock in the steep density gradient delimiting the O-Ne-Mg core of the
progenitor enables such a rapid expansion of neutrino-heated matter that the
growth of neutrino-driven convection freezes out quickly in a high-mode
spherical harmonics pattern. Since the corresponding momentum asymmetry of the
ejecta is very small and the gravitational acceleration by the fast-expanding
ejecta abates rapidly, the NS kick velocities are at most a few km/s. The
extremely low core compactness of O-Ne-Mg-core progenitors therefore favors
hydrodynamic NS kicks much below the ~160 km/s measured for the Crab pulsar.
This suggests either that the Crab Nebula is not the remnant of an
electron-capture SN, but of a low-mass iron-core progenitor, or that the Crab
pulsar was not accelerated by the gravitational tug-boat mechanism but received
its kick by a non-hydrodynamic mechanism such as, e.g., anisotropic neutrino
emission.
| astro-ph.HE hep-ph | neutron stars nss obtain kicks of typically several 100 kms at birth the gravitational tugboat mechanism can explain these kicks as consequences of asymmetric mass ejection during the supernova sn explosion support for this hydrodynamic explanation is provided by observations of sn remnants with associated nss which confirm the prediction that the bulk of the explosion ejecta in particular chemical elements between silicon and the iron group are dominantly expelled in the hemisphere opposite to the direction of the ns kick here we present a large set of two and threedimensional explosion simulations of electroncapture sne considering explosion energies between 3x1049 erg and 16x1050 erg we find that the fast acceleration of the sn shock in the steep density gradient delimiting the onemg core of the progenitor enables such a rapid expansion of neutrinoheated matter that the growth of neutrinodriven convection freezes out quickly in a highmode spherical harmonics pattern since the corresponding momentum asymmetry of the ejecta is very small and the gravitational acceleration by the fastexpanding ejecta abates rapidly the ns kick velocities are at most a few kms the extremely low core compactness of onemgcore progenitors therefore favors hydrodynamic ns kicks much below the 160 kms measured for the crab pulsar this suggests either that the crab nebula is not the remnant of an electroncapture sn but of a lowmass ironcore progenitor or that the crab pulsar was not accelerated by the gravitational tugboat mechanism but received its kick by a nonhydrodynamic mechanism such as eg anisotropic neutrino emission | [['neutron', 'stars', 'nss', 'obtain', 'kicks', 'of', 'typically', 'several', '100', 'kms', 'at', 'birth', 'the', 'gravitational', 'tugboat', 'mechanism', 'can', 'explain', 'these', 'kicks', 'as', 'consequences', 'of', 'asymmetric', 'mass', 'ejection', 'during', 'the', 'supernova', 'sn', 'explosion', 'support', 'for', 'this', 'hydrodynamic', 'explanation', 'is', 'provided', 'by', 'observations', 'of', 'sn', 'remnants', 'with', 'associated', 'nss', 'which', 'confirm', 'the', 'prediction', 'that', 'the', 'bulk', 'of', 'the', 'explosion', 'ejecta', 'in', 'particular', 'chemical', 'elements', 'between', 'silicon', 'and', 'the', 'iron', 'group', 'are', 'dominantly', 'expelled', 'in', 'the', 'hemisphere', 'opposite', 'to', 'the', 'direction', 'of', 'the', 'ns', 'kick', 'here', 'we', 'present', 'a', 'large', 'set', 'of', 'two', 'and', 'threedimensional', 'explosion', 'simulations', 'of', 'electroncapture', 'sne', 'considering', 'explosion', 'energies', 'between', '3x1049', 'erg', 'and', '16x1050', 'erg', 'we', 'find', 'that', 'the', 'fast', 'acceleration', 'of', 'the', 'sn', 'shock', 'in', 'the', 'steep', 'density', 'gradient', 'delimiting', 'the', 'onemg', 'core', 'of', 'the', 'progenitor', 'enables', 'such', 'a', 'rapid', 'expansion', 'of', 'neutrinoheated', 'matter', 'that', 'the', 'growth', 'of', 'neutrinodriven', 'convection', 'freezes', 'out', 'quickly', 'in', 'a', 'highmode', 'spherical', 'harmonics', 'pattern', 'since', 'the', 'corresponding', 'momentum', 'asymmetry', 'of', 'the', 'ejecta', 'is', 'very', 'small', 'and', 'the', 'gravitational', 'acceleration', 'by', 'the', 'fastexpanding', 'ejecta', 'abates', 'rapidly', 'the', 'ns', 'kick', 'velocities', 'are', 'at', 'most', 'a', 'few', 'kms', 'the', 'extremely', 'low', 'core', 'compactness', 'of', 'onemgcore', 'progenitors', 'therefore', 'favors', 'hydrodynamic', 'ns', 'kicks', 'much', 'below', 'the', '160', 'kms', 'measured', 'for', 'the', 'crab', 'pulsar', 'this', 'suggests', 'either', 'that', 'the', 'crab', 'nebula', 'is', 'not', 'the', 'remnant', 'of', 'an', 'electroncapture', 'sn', 'but', 'of', 'a', 'lowmass', 'ironcore', 'progenitor', 'or', 'that', 'the', 'crab', 'pulsar', 'was', 'not', 'accelerated', 'by', 'the', 'gravitational', 'tugboat', 'mechanism', 'but', 'received', 'its', 'kick', 'by', 'a', 'nonhydrodynamic', 'mechanism', 'such', 'as', 'eg', 'anisotropic', 'neutrino', 'emission']] | [-0.09557310485001654, 0.19993365278566488, -0.045361484964378175, 0.13960481884563342, -0.1393973882002756, -0.07333846453763544, 0.03779650471825153, 0.3853453287389129, -0.20114626016141846, -0.2968836363144219, 0.05075903981924057, -0.25341394942253825, 0.01982592208031565, 0.20031906550284476, 0.017718295665225012, -0.08518189682601951, 0.16280618001520633, -0.03081413116771728, -0.12300326878484338, -0.20968546341673935, 0.2855348858572543, 0.10305225701536984, 0.1604207700220868, 0.005330582590773702, 0.10757727804034949, -0.14641551915369927, 0.030382203429937363, -0.08074784470908344, -0.10992742001431179, 0.009390513999387623, 0.14396909497195157, 0.14774938206002117, 0.20063653591275216, -0.4492672969922423, -0.26073448889888823, 0.08441551924031228, 0.2214932958429563, 0.09032334124483168, -0.10027207224164159, -0.25408261107467117, 0.07135814748704433, -0.3024117589164525, -0.18880050851404667, 0.08985299929231405, 0.05764123428566381, 0.083620673609199, -0.21447110614553094, 0.15148965639667586, 0.05477930670743808, -0.00413804784975946, -0.09152121605770662, -0.07464292957307771, -0.0823551865098998, -0.034806083685252814, 0.12480855710525066, 0.04372154647856951, 0.14518870942573994, -0.12885924222227185, 0.010366582193411886, 0.43969010083377363, -0.018531376025173813, 0.006626489244401455, 0.19785650271270425, -0.2230547314696014, -0.11000436908192933, 0.21984161705430597, 0.13458953818492592, 0.09196835807384923, -0.1322446163985878, -0.052303911739843896, 0.001153877843171358, 0.14298583119735123, 0.08000509446300566, 0.01860925548654632, 0.3313430137038231, 0.16307121333968827, -0.0032030349895358088, 0.04932620087591931, -0.2213994932419155, -0.010421006398275494, -0.2657294855620712, -0.09289424728089944, -0.16133107446227224, 0.14482069534913172, -0.17180937943677418, -0.13761300276219846, 0.3412127758078277, 0.0917017805557698, 0.191638424532488, -0.03333939222444315, 0.2667365681920201, 0.07888137894688407, 0.06541218465194105, 0.14543262272514404, 0.34847405351698396, 0.2147965022660792, 0.16659909478295595, -0.2759443336324766, 0.12086194946151227, 0.04999159976374358] |
1,802.05275 | A UV-to-NIR Study of Molecular Gas in the Dust Cavity Around RY Lupi | We present a study of molecular gas in the inner disk $\left(r < 20 \,
\text{AU} \right)$ around RY Lupi, with spectra from HST-COS, HST-STIS, and
VLT-CRIRES. We model the radial distribution of flux from hot gas in a surface
layer between $r = 0.1-10$ AU, as traced by Ly$\alpha$-pumped H$_2$. The result
shows H$_2$ emission originating in a ring centered at $\sim$3 AU that declines
within $r < 0.1$ AU, which is consistent with the behavior of disks with dust
cavities. An analysis of the H$_2$ line shapes shows that a two-component
Gaussian profile $\left(\text{FWHM}_{broad, H_2} = 105 \pm 15 \, \text{km
s}^{-1}; \, \text{FWHM}_{narrow, H_2} = 43 \pm 13 \, \text{km s}^{-1} \right)$
is statistically preferred to a single-component Gaussian. We interpret this as
tentative evidence for gas emitting from radially separated disk regions
$\left( \left \langle r_{broad, H_2} \right \rangle \sim 0.4 \pm 0.1 \,
\text{AU}; \, \left \langle r_{narrow, H_2} \right \rangle \sim 3 \pm 2 \,
\text{AU} \right)$. The 4.7 $\mu$m $^{12}$CO emission lines are also well fit
by two-component profiles $\left( \left \langle r_{broad, CO} \right \rangle =
0.4 \pm 0.1 \, \text{AU}; \, \left \langle r_{narrow, CO} \right \rangle = 15
\pm 2 \, \text{AU} \right)$. We combine these results with 10 $\mu$m
observations to form a picture of gapped structure within the mm-imaged dust
cavity, providing the first such overview of the inner regions of a young disk.
The HST SED of RY Lupi is available online for use in modeling efforts.
| astro-ph.SR astro-ph.GA | we present a study of molecular gas in the inner disk leftr 20 textau right around ry lupi with spectra from hstcos hststis and vltcrires we model the radial distribution of flux from hot gas in a surface layer between r 0110 au as traced by lyalphapumped h_2 the result shows h_2 emission originating in a ring centered at sim3 au that declines within r 01 au which is consistent with the behavior of disks with dust cavities an analysis of the h_2 line shapes shows that a twocomponent gaussian profile lefttextfwhm_broad h_2 105 pm 15 textkm s1 textfwhm_narrow h_2 43 pm 13 textkm s1 right is statistically preferred to a singlecomponent gaussian we interpret this as tentative evidence for gas emitting from radially separated disk regions left left langle r_broad h_2 right rangle sim 04 pm 01 textau left langle r_narrow h_2 right rangle sim 3 pm 2 textau right the 47 mum 12co emission lines are also well fit by twocomponent profiles left left langle r_broad co right rangle 04 pm 01 textau left langle r_narrow co right rangle 15 pm 2 textau right we combine these results with 10 mum observations to form a picture of gapped structure within the mmimaged dust cavity providing the first such overview of the inner regions of a young disk the hst sed of ry lupi is available online for use in modeling efforts | [['we', 'present', 'a', 'study', 'of', 'molecular', 'gas', 'in', 'the', 'inner', 'disk', 'leftr', '20', 'textau', 'right', 'around', 'ry', 'lupi', 'with', 'spectra', 'from', 'hstcos', 'hststis', 'and', 'vltcrires', 'we', 'model', 'the', 'radial', 'distribution', 'of', 'flux', 'from', 'hot', 'gas', 'in', 'a', 'surface', 'layer', 'between', 'r', '0110', 'au', 'as', 'traced', 'by', 'lyalphapumped', 'h_2', 'the', 'result', 'shows', 'h_2', 'emission', 'originating', 'in', 'a', 'ring', 'centered', 'at', 'sim3', 'au', 'that', 'declines', 'within', 'r', '01', 'au', 'which', 'is', 'consistent', 'with', 'the', 'behavior', 'of', 'disks', 'with', 'dust', 'cavities', 'an', 'analysis', 'of', 'the', 'h_2', 'line', 'shapes', 'shows', 'that', 'a', 'twocomponent', 'gaussian', 'profile', 'lefttextfwhm_broad', 'h_2', '105', 'pm', '15', 'textkm', 's1', 'textfwhm_narrow', 'h_2', '43', 'pm', '13', 'textkm', 's1', 'right', 'is', 'statistically', 'preferred', 'to', 'a', 'singlecomponent', 'gaussian', 'we', 'interpret', 'this', 'as', 'tentative', 'evidence', 'for', 'gas', 'emitting', 'from', 'radially', 'separated', 'disk', 'regions', 'left', 'left', 'langle', 'r_broad', 'h_2', 'right', 'rangle', 'sim', '04', 'pm', '01', 'textau', 'left', 'langle', 'r_narrow', 'h_2', 'right', 'rangle', 'sim', '3', 'pm', '2', 'textau', 'right', 'the', '47', 'mum', '12co', 'emission', 'lines', 'are', 'also', 'well', 'fit', 'by', 'twocomponent', 'profiles', 'left', 'left', 'langle', 'r_broad', 'co', 'right', 'rangle', '04', 'pm', '01', 'textau', 'left', 'langle', 'r_narrow', 'co', 'right', 'rangle', '15', 'pm', '2', 'textau', 'right', 'we', 'combine', 'these', 'results', 'with', '10', 'mum', 'observations', 'to', 'form', 'a', 'picture', 'of', 'gapped', 'structure', 'within', 'the', 'mmimaged', 'dust', 'cavity', 'providing', 'the', 'first', 'such', 'overview', 'of', 'the', 'inner', 'regions', 'of', 'a', 'young', 'disk', 'the', 'hst', 'sed', 'of', 'ry', 'lupi', 'is', 'available', 'online', 'for', 'use', 'in', 'modeling', 'efforts']] | [-0.053690181526407185, 0.12415316609723959, 0.01241109937015507, 0.0059158713267081315, 0.022830885031984913, -0.13228591062128545, -0.021131070153270332, 0.4839692362729046, -0.21718322452985578, -0.2773419702880912, 0.04712259522949656, -0.360589398621685, 0.07273021168903344, 0.13157200787216425, 0.023108019189288218, -0.06970241296622488, -0.030802764932935437, -0.10257583835550274, -0.07965098967568741, -0.14153312869059542, 0.1844769852484266, 0.025029060299404795, 0.08291520014612211, 0.023978384509165254, 0.0360825622730772, -0.12162738357153204, -0.016850288757123053, -0.10896656659742196, -0.2441449012279433, 0.05340112526073224, 0.16229253405601615, 0.07047314340455664, 0.22303692479980075, -0.3296511992098143, -0.10153871346821285, 0.04041585645741887, 0.24654879053640696, -0.08952756739997615, 0.010513475434337225, -0.29056876158134803, 0.09178904037922621, -0.20780873499810695, -0.17542758411417406, 0.10240409607623911, 0.11621224001463916, -0.04466608821621371, -0.28125121414997717, 0.2181226361717563, 0.030977654799612033, 0.14848772521337703, -0.09729984908261233, -0.1763445308100846, -0.09601964505363463, 0.0037572033579150836, -0.02798224113208966, 0.17728571016237968, 0.19956193299136227, -0.10638941536657512, 0.006107413224979407, 0.39067447292514973, -0.16893982001761387, -0.02454804803762171, 0.1520666563635071, -0.24967304279510347, -0.11461810698525773, 0.20506433080053993, 0.045966084586171845, 0.12205384732534488, -0.09626969287501803, 0.060362495821124566, -0.10600660786963999, 0.27598768243359195, 0.08055247266259458, 0.03969952686896755, 0.3143050233295394, 0.05420600375522756, 0.01578579319498709, 0.054011350793815735, -0.25790870663399496, -0.026429570427992276, -0.2762244644926654, -0.13404302517779998, -0.07248720748091324, 0.14696793702534502, -0.12534294925623626, -0.0673115801335209, 0.2912568441643897, 0.07945993962697685, 0.3104571345324318, 0.03221484013263964, 0.2613153262601958, 0.06931412762005089, 0.030657474698705806, 0.15867049273517397, 0.19257453065365554, 0.19619117700650046, 0.0851573257934716, -0.1785544236863239, -0.009822386696727739, -0.03257079605427053] |
1,802.05276 | Andreev Reflection Enhancement in Semiconductor-Superconductor
Structures | We develop a new theoretical approach for modelling a wide range of
semiconductor-superconductor structures with arbitrary potential barriers and a
spatially-dependent superconducting order parameter. We demonstrate asymmetry
in the conductance spectrum as a result of a Schottky barrier shape. We further
show that Andreev reflection process can be significantly enhanced through
resonant tunneling with appropriate barrier configuration, which can
incorporate the Schottky barrier as a contributing component of the device.
Moreover, we show that resonant tunneling can be achieved in superlattice
structures as well. These theoretically demonstrated effects along with our
modelling approach enable much more efficient Cooper pair injection into
semiconductor-superconductor structures, including superconducting
optoelectronic devices.
| cond-mat.supr-con cond-mat.mes-hall quant-ph | we develop a new theoretical approach for modelling a wide range of semiconductorsuperconductor structures with arbitrary potential barriers and a spatiallydependent superconducting order parameter we demonstrate asymmetry in the conductance spectrum as a result of a schottky barrier shape we further show that andreev reflection process can be significantly enhanced through resonant tunneling with appropriate barrier configuration which can incorporate the schottky barrier as a contributing component of the device moreover we show that resonant tunneling can be achieved in superlattice structures as well these theoretically demonstrated effects along with our modelling approach enable much more efficient cooper pair injection into semiconductorsuperconductor structures including superconducting optoelectronic devices | [['we', 'develop', 'a', 'new', 'theoretical', 'approach', 'for', 'modelling', 'a', 'wide', 'range', 'of', 'semiconductorsuperconductor', 'structures', 'with', 'arbitrary', 'potential', 'barriers', 'and', 'a', 'spatiallydependent', 'superconducting', 'order', 'parameter', 'we', 'demonstrate', 'asymmetry', 'in', 'the', 'conductance', 'spectrum', 'as', 'a', 'result', 'of', 'a', 'schottky', 'barrier', 'shape', 'we', 'further', 'show', 'that', 'andreev', 'reflection', 'process', 'can', 'be', 'significantly', 'enhanced', 'through', 'resonant', 'tunneling', 'with', 'appropriate', 'barrier', 'configuration', 'which', 'can', 'incorporate', 'the', 'schottky', 'barrier', 'as', 'a', 'contributing', 'component', 'of', 'the', 'device', 'moreover', 'we', 'show', 'that', 'resonant', 'tunneling', 'can', 'be', 'achieved', 'in', 'superlattice', 'structures', 'as', 'well', 'these', 'theoretically', 'demonstrated', 'effects', 'along', 'with', 'our', 'modelling', 'approach', 'enable', 'much', 'more', 'efficient', 'cooper', 'pair', 'injection', 'into', 'semiconductorsuperconductor', 'structures', 'including', 'superconducting', 'optoelectronic', 'devices']] | [-0.16632921641548903, 0.12615360306340886, -0.09062938680263044, 0.056800499635237346, -0.06122165640041441, -0.1872462055680699, 0.08831225834551885, 0.44870303062913575, -0.2780759567177254, -0.3483492402037797, -0.04089840320287116, -0.2234975639208455, -0.18624347182660947, 0.28063625197397396, 0.019474657073999955, 0.05126607726180108, 0.046543684692304826, -0.09233717416700359, -0.025678296751891063, -0.15390792900531022, 0.307546225402539, 0.033535188292457815, 0.30853618767599916, 0.1505016889945369, 0.041889444541917224, 0.009119391419585341, 0.11201410724946828, 0.037724347802523144, -0.10361070815698466, 0.0954916157246193, 0.26747299560615534, -0.06701433106769468, 0.20112445707667934, -0.4742234438379234, -0.28937254621425346, 0.021499943440762635, 0.22046624449523444, 0.1615772899990971, -0.11780830763705254, -0.29415260819352673, 0.09970967485525897, -0.22311110630909972, -0.11212721045950981, -0.0935596048431558, -0.04776973272108029, 0.019234862613761537, -0.2739459754916552, 0.038325756999324556, 0.043749975677031296, -0.002572287779266589, -0.037830108073436675, -0.0716844821244339, -0.05933035294325135, 0.03129175658746858, -0.04136118658619202, -0.04379880327892394, 0.19447417099846998, -0.08379109017061348, -0.15971621719981047, 0.3062060033080003, -0.05589020801990981, -0.1462440147623855, 0.1361699759346546, -0.13906621444909442, -0.019223037658903364, 0.1269506352244241, 0.14084618139542013, 0.10553555639251788, -0.13480198536520807, 0.07555267112884478, 0.037323410379064975, 0.15298208091451534, 0.0721286086139278, 0.08265371231153329, 0.23674525411051012, 0.22867743646134145, 0.09570801204285871, 0.15190683882988154, -0.13330877722876372, -0.038207315761491514, -0.27751963154769665, -0.18448354685940196, -0.13750618462946929, 0.06530526018414264, -0.052694276836782336, -0.20461564551098882, 0.4180481424294064, 0.1713388908053879, 0.23732845150978765, -0.02977582841358696, 0.29591936980173966, 0.17492426966021063, 0.11574437613729562, -0.015475802480408522, 0.199337440151199, 0.1229210674031594, 0.07313344785160272, -0.24942091077775042, 0.0693295494583653, -0.06340509916821094] |
1,802.05277 | 275 Candidates and 149 Validated Planets Orbiting Bright Stars in K2
Campaigns 0-10 | Since 2014, NASA's K2 mission has observed large portions of the ecliptic
plane in search of transiting planets and has detected hundreds of planet
candidates. With observations planned until at least early 2018, K2 will
continue to identify more planet candidates. We present here 275 planet
candidates observed during Campaigns 0-10 of the K2 mission that are orbiting
stars brighter than 13 mag (in Kepler band) and for which we have obtained
high-resolution spectra (R = 44,000). These candidates are analyzed using the
VESPA package (Morton 2012, 2015b) in order to calculate their false-positive
probabilities (FPP). We find that 149 candidates are validated with an FPP
lower than 0.1%, 39 of which were previously only candidates and 56 of which
were previously undetected. The processes of data reduction, candidate
identification, and statistical validation are described, and the demographics
of the candidates and newly validated planets are explored. We show tentative
evidence of a gap in the planet radius distribution of our candidate sample.
Comparing our sample to the Kepler candidate sample investigated by Fulton et
al. (2017), we conclude that more planets are required to quantitatively
confirm the gap with K2 candidates or validated planets. This work, in addition
to increasing the population of validated K2 planets by nearly 50% and
providing new targets for follow-up observations, will also serve as a
framework for validating candidates from upcoming K2 campaigns and the
Transiting Exoplanet Survey Satellite, expected to launch in 2018.
| astro-ph.EP | since 2014 nasas k2 mission has observed large portions of the ecliptic plane in search of transiting planets and has detected hundreds of planet candidates with observations planned until at least early 2018 k2 will continue to identify more planet candidates we present here 275 planet candidates observed during campaigns 010 of the k2 mission that are orbiting stars brighter than 13 mag in kepler band and for which we have obtained highresolution spectra r 44000 these candidates are analyzed using the vespa package morton 2012 2015b in order to calculate their falsepositive probabilities fpp we find that 149 candidates are validated with an fpp lower than 01 39 of which were previously only candidates and 56 of which were previously undetected the processes of data reduction candidate identification and statistical validation are described and the demographics of the candidates and newly validated planets are explored we show tentative evidence of a gap in the planet radius distribution of our candidate sample comparing our sample to the kepler candidate sample investigated by fulton et al 2017 we conclude that more planets are required to quantitatively confirm the gap with k2 candidates or validated planets this work in addition to increasing the population of validated k2 planets by nearly 50 and providing new targets for followup observations will also serve as a framework for validating candidates from upcoming k2 campaigns and the transiting exoplanet survey satellite expected to launch in 2018 | [['since', '2014', 'nasas', 'k2', 'mission', 'has', 'observed', 'large', 'portions', 'of', 'the', 'ecliptic', 'plane', 'in', 'search', 'of', 'transiting', 'planets', 'and', 'has', 'detected', 'hundreds', 'of', 'planet', 'candidates', 'with', 'observations', 'planned', 'until', 'at', 'least', 'early', '2018', 'k2', 'will', 'continue', 'to', 'identify', 'more', 'planet', 'candidates', 'we', 'present', 'here', '275', 'planet', 'candidates', 'observed', 'during', 'campaigns', '010', 'of', 'the', 'k2', 'mission', 'that', 'are', 'orbiting', 'stars', 'brighter', 'than', '13', 'mag', 'in', 'kepler', 'band', 'and', 'for', 'which', 'we', 'have', 'obtained', 'highresolution', 'spectra', 'r', '44000', 'these', 'candidates', 'are', 'analyzed', 'using', 'the', 'vespa', 'package', 'morton', '2012', '2015b', 'in', 'order', 'to', 'calculate', 'their', 'falsepositive', 'probabilities', 'fpp', 'we', 'find', 'that', '149', 'candidates', 'are', 'validated', 'with', 'an', 'fpp', 'lower', 'than', '01', '39', 'of', 'which', 'were', 'previously', 'only', 'candidates', 'and', '56', 'of', 'which', 'were', 'previously', 'undetected', 'the', 'processes', 'of', 'data', 'reduction', 'candidate', 'identification', 'and', 'statistical', 'validation', 'are', 'described', 'and', 'the', 'demographics', 'of', 'the', 'candidates', 'and', 'newly', 'validated', 'planets', 'are', 'explored', 'we', 'show', 'tentative', 'evidence', 'of', 'a', 'gap', 'in', 'the', 'planet', 'radius', 'distribution', 'of', 'our', 'candidate', 'sample', 'comparing', 'our', 'sample', 'to', 'the', 'kepler', 'candidate', 'sample', 'investigated', 'by', 'fulton', 'et', 'al', '2017', 'we', 'conclude', 'that', 'more', 'planets', 'are', 'required', 'to', 'quantitatively', 'confirm', 'the', 'gap', 'with', 'k2', 'candidates', 'or', 'validated', 'planets', 'this', 'work', 'in', 'addition', 'to', 'increasing', 'the', 'population', 'of', 'validated', 'k2', 'planets', 'by', 'nearly', '50', 'and', 'providing', 'new', 'targets', 'for', 'followup', 'observations', 'will', 'also', 'serve', 'as', 'a', 'framework', 'for', 'validating', 'candidates', 'from', 'upcoming', 'k2', 'campaigns', 'and', 'the', 'transiting', 'exoplanet', 'survey', 'satellite', 'expected', 'to', 'launch', 'in', '2018']] | [-0.07958741898085767, 0.1034878111847623, -0.057220776440226474, 0.04787938347193024, -0.12985397997545078, -0.09824844781930248, 0.12512001045203458, 0.3524908675751552, -0.10812013327958994, -0.46145819274242966, 0.11651315827669653, -0.3645397272892296, -0.10483147809184933, 0.24260430942910413, -0.058861725721120216, 0.0731007876204482, 0.12503152299595968, -0.07409535229283695, 0.02180662414660522, -0.3778853444819106, 0.18664746208378347, 0.12541311140327405, 0.0799487751093693, -0.06770494639640674, -0.004702494021330494, -0.045202338107143684, -0.11104502177525623, -0.046135564668414494, -0.21686459986325038, 0.03959092214039022, 0.27308936179130494, 0.14792053360530796, 0.2105138785603534, -0.30944081686081215, -0.200387989008838, 0.06149086482085598, 0.1394899374397937, 0.016017555661286074, -0.06520660254718677, -0.33487906432613573, 0.1400247604828716, -0.17629026098875328, -0.17926477214981182, -0.02986985888176908, 0.1359881618390015, 0.006311945913087887, -0.25578788281806436, 0.0591277370009872, 0.008001914205184828, 0.14268866334023186, -0.15921157101984135, -0.19730639072367923, -0.06348752335761673, 0.08589405587893756, 0.000788914249278605, 0.04260954900819343, 0.07369744613727865, -0.07349100465556452, -0.10384370206738822, 0.38209624829081196, -0.06810954165521252, 0.03571214217784776, 0.21048122223777074, -0.20245866846526042, -0.16293123283151847, 0.1351921493813279, 0.17336926695170404, 0.1669624589116817, -0.20364341360206406, -0.02215535929423519, -0.0185705309981131, 0.18487699179483266, 0.07748193849887078, 0.0266787223527596, 0.3345884413734893, 0.1551073640429725, 0.032211192595423196, 0.10046931095227289, -0.2841539266790884, -0.018790273737734727, -0.20730771716916935, -0.1434643783014811, -0.18993063368883062, -0.005240565848119634, -0.026930928227860324, -0.044128600034552316, 0.33675262292575403, 0.16524342468183023, 0.16829573433205952, 0.04487107355040886, 0.25270556546165607, 0.0469158350417274, 0.09132780761283357, 0.10117879413495151, 0.3659616295869152, 0.07234994343792399, 0.06603728841485766, -0.13990949545501888, 0.05801145954950092, -0.05409743767619754] |
1,802.05278 | Matrix Product State description of the Halperin States | Many fractional quantum Hall states can be expressed as a correlator of a
given conformal field theory used to describe their edge physics. As a
consequence, these states admit an economical representation as an exact Matrix
Product States (MPS) that was extensively studied for the systems without any
spin or any other internal degrees of freedom. In that case, the correlators
are built from a single electronic operator, which is primary with respect to
the underlying conformal field theory. We generalize this construction to the
archetype of Abelian multicomponent fractional quantum Hall wavefunctions, the
Halperin states. These latest can be written as conformal blocks involving
multiple electronic operators and we explicitly derive their exact MPS
representation. In particular, we deal with the caveat of the full wavefunction
symmetry and show that any additional SU(2) symmetry is preserved by the
natural MPS truncation scheme provided by the conformal dimension. We use our
method to characterize the topological order of the Halperin states by
extracting the topological entanglement entropy. We also evaluate their bulk
correlation length which are compared to plasma analogy arguments.
| cond-mat.str-el | many fractional quantum hall states can be expressed as a correlator of a given conformal field theory used to describe their edge physics as a consequence these states admit an economical representation as an exact matrix product states mps that was extensively studied for the systems without any spin or any other internal degrees of freedom in that case the correlators are built from a single electronic operator which is primary with respect to the underlying conformal field theory we generalize this construction to the archetype of abelian multicomponent fractional quantum hall wavefunctions the halperin states these latest can be written as conformal blocks involving multiple electronic operators and we explicitly derive their exact mps representation in particular we deal with the caveat of the full wavefunction symmetry and show that any additional su2 symmetry is preserved by the natural mps truncation scheme provided by the conformal dimension we use our method to characterize the topological order of the halperin states by extracting the topological entanglement entropy we also evaluate their bulk correlation length which are compared to plasma analogy arguments | [['many', 'fractional', 'quantum', 'hall', 'states', 'can', 'be', 'expressed', 'as', 'a', 'correlator', 'of', 'a', 'given', 'conformal', 'field', 'theory', 'used', 'to', 'describe', 'their', 'edge', 'physics', 'as', 'a', 'consequence', 'these', 'states', 'admit', 'an', 'economical', 'representation', 'as', 'an', 'exact', 'matrix', 'product', 'states', 'mps', 'that', 'was', 'extensively', 'studied', 'for', 'the', 'systems', 'without', 'any', 'spin', 'or', 'any', 'other', 'internal', 'degrees', 'of', 'freedom', 'in', 'that', 'case', 'the', 'correlators', 'are', 'built', 'from', 'a', 'single', 'electronic', 'operator', 'which', 'is', 'primary', 'with', 'respect', 'to', 'the', 'underlying', 'conformal', 'field', 'theory', 'we', 'generalize', 'this', 'construction', 'to', 'the', 'archetype', 'of', 'abelian', 'multicomponent', 'fractional', 'quantum', 'hall', 'wavefunctions', 'the', 'halperin', 'states', 'these', 'latest', 'can', 'be', 'written', 'as', 'conformal', 'blocks', 'involving', 'multiple', 'electronic', 'operators', 'and', 'we', 'explicitly', 'derive', 'their', 'exact', 'mps', 'representation', 'in', 'particular', 'we', 'deal', 'with', 'the', 'caveat', 'of', 'the', 'full', 'wavefunction', 'symmetry', 'and', 'show', 'that', 'any', 'additional', 'su2', 'symmetry', 'is', 'preserved', 'by', 'the', 'natural', 'mps', 'truncation', 'scheme', 'provided', 'by', 'the', 'conformal', 'dimension', 'we', 'use', 'our', 'method', 'to', 'characterize', 'the', 'topological', 'order', 'of', 'the', 'halperin', 'states', 'by', 'extracting', 'the', 'topological', 'entanglement', 'entropy', 'we', 'also', 'evaluate', 'their', 'bulk', 'correlation', 'length', 'which', 'are', 'compared', 'to', 'plasma', 'analogy', 'arguments']] | [-0.13565472403453735, 0.18714202746626077, -0.09816737929925076, 0.08594206058952793, -0.06695830120540415, -0.13088831994476732, -0.012576514151389839, 0.3325387966402328, -0.2565048612661927, -0.26570373098912664, 0.10316541641358883, -0.2501515683496772, -0.1624895155414404, 0.1261659551782338, -0.009125701767631719, 0.07868325959335375, 0.0010936088700526656, 0.05876151224577707, -0.13365473967426308, -0.22072827214123011, 0.33018479889865904, 0.0033845328301376565, 0.2661966926814443, 0.0472462931249126, 0.07910300393264678, 0.021385707043481795, 0.009338057703835098, 0.01297466874296921, -0.09762193737327261, 0.12449799104142183, 0.2689097281802672, 0.0606153705594701, 0.17804740214957057, -0.4564152031838482, -0.21514960900669433, 0.06358344792722832, 0.12938480359085358, 0.15942807257232045, 0.003872920951975808, -0.3231422763809212, 0.06438335035130052, -0.2281759480909748, -0.18132539183796686, -0.15123263388506822, -0.02019469273657389, -0.07466636745784, -0.22257705362004265, 0.07196660145962204, 0.04387380643258931, 0.04321437305063318, -0.047925857574619785, -0.10874374036018566, -0.06708249519579113, 0.12957825363312658, 0.011021575450547327, 0.04739544469508142, 0.11603688345630318, -0.14676321343256216, -0.2048583808097762, 0.35793308653091777, -0.04421206343808412, -0.2545695343770046, 0.18149821578334627, -0.11650930647352371, -0.13217776832145056, 0.06021291952006498, 0.10403104504127858, 0.10250863901890032, -0.12095517314744095, 0.12759920380152864, -0.07688722712147301, 0.15232908154145727, 0.05394109245261064, 0.10752466054715587, 0.1948153180281184, 0.04633924007307717, 0.04336062025308393, 0.1796181081187685, -0.008727921372361851, -0.11251591360042108, -0.32044893910996464, -0.1996613134964799, -0.23664101197137316, 0.10387349077783402, -0.08339041485615173, -0.17255183075714178, 0.41931496484362946, 0.12114737660898081, 0.16108588964963919, 0.01613424316779273, 0.22625831330905138, 0.16664951190272687, 0.09094742402943747, 0.06472789923768511, 0.18123965238115508, 0.18274937430332358, 0.03393591269696368, -0.24093876194944658, -0.00733291535401583, 0.11844218401907228] |
1,802.05279 | Gemini Follow-up of two massive HI clouds discovered with the Australian
Square Kilometer Array Pathfinder | Using the Gemini Multi Object Spectrograph (GMOS) we search for optical
counterparts of two massive (~10^9 solar masses) neutral hydrogen clouds near
the spiral galaxy IC 5270, located in the outskirts of the IC 1459 group. These
two HI clouds were recently discovered using the Australian Square Kilometer
Array Pathfinder (ASKAP). Two low surface brightness optical counterparts to
one of these HI clouds are identified in the new Gemini data that reaches down
to magnitudes of ~27.5 mag in the g-band. The observed HI mass to light ratio
derived with these new data, M_(HI)/L_g =242, is among the highest reported to
date. We are also able to rule out that the two HI clouds are dwarf companions
of IC 5270. Tidal interactions and ram pressure stripping are plausible
explanations for the physical origin of these two clouds.
| astro-ph.GA | using the gemini multi object spectrograph gmos we search for optical counterparts of two massive 109 solar masses neutral hydrogen clouds near the spiral galaxy ic 5270 located in the outskirts of the ic 1459 group these two hi clouds were recently discovered using the australian square kilometer array pathfinder askap two low surface brightness optical counterparts to one of these hi clouds are identified in the new gemini data that reaches down to magnitudes of 275 mag in the gband the observed hi mass to light ratio derived with these new data m_hil_g 242 is among the highest reported to date we are also able to rule out that the two hi clouds are dwarf companions of ic 5270 tidal interactions and ram pressure stripping are plausible explanations for the physical origin of these two clouds | [['using', 'the', 'gemini', 'multi', 'object', 'spectrograph', 'gmos', 'we', 'search', 'for', 'optical', 'counterparts', 'of', 'two', 'massive', '109', 'solar', 'masses', 'neutral', 'hydrogen', 'clouds', 'near', 'the', 'spiral', 'galaxy', 'ic', '5270', 'located', 'in', 'the', 'outskirts', 'of', 'the', 'ic', '1459', 'group', 'these', 'two', 'hi', 'clouds', 'were', 'recently', 'discovered', 'using', 'the', 'australian', 'square', 'kilometer', 'array', 'pathfinder', 'askap', 'two', 'low', 'surface', 'brightness', 'optical', 'counterparts', 'to', 'one', 'of', 'these', 'hi', 'clouds', 'are', 'identified', 'in', 'the', 'new', 'gemini', 'data', 'that', 'reaches', 'down', 'to', 'magnitudes', 'of', '275', 'mag', 'in', 'the', 'gband', 'the', 'observed', 'hi', 'mass', 'to', 'light', 'ratio', 'derived', 'with', 'these', 'new', 'data', 'm_hil_g', '242', 'is', 'among', 'the', 'highest', 'reported', 'to', 'date', 'we', 'are', 'also', 'able', 'to', 'rule', 'out', 'that', 'the', 'two', 'hi', 'clouds', 'are', 'dwarf', 'companions', 'of', 'ic', '5270', 'tidal', 'interactions', 'and', 'ram', 'pressure', 'stripping', 'are', 'plausible', 'explanations', 'for', 'the', 'physical', 'origin', 'of', 'these', 'two', 'clouds']] | [-0.11047727407832794, 0.07913395072169163, -0.024398903015347004, 0.10073312819997013, -0.12667078684556626, -0.07219336075050865, 0.041626914049950704, 0.46092299076125903, -0.16307482024421915, -0.34702301370527816, 0.09012130852651727, -0.3348864579354139, -0.06476877859848387, 0.20823187548632952, 0.029779266675605494, -0.026072865054148305, 0.03135819905155051, -0.10433676069164101, -0.030583222013186005, -0.3395095666004208, 0.26333553196095366, 0.08961730073753964, 0.15394340339116752, -0.05202202334989766, 0.08209303535199176, -0.15201247031098533, -0.07806786449424073, -0.08330844847574446, -0.12671837358967047, 0.04560775388552643, 0.22048852741649813, 0.09534538232872043, 0.18566010689691587, -0.3728049577022081, -0.1489970433553133, 0.06544696620446355, 0.19948019165038952, -0.006995961302891374, -0.056999846731367355, -0.3289384217847221, 0.07442993129028336, -0.17519981432825957, -0.21574476030347048, 0.10458702912471969, 0.021336196327705264, 0.06409321436726981, -0.1799461616353844, 0.12034554583485313, -0.05972504411029684, 0.12333952001491151, -0.1591735585620079, -0.1812182028147885, -0.03753422710852807, 0.07715507752864677, -0.05894234544779037, 0.06308130827999454, 0.18823809696443597, -0.15889510938979903, -0.008197393145083505, 0.42024688833557505, -0.06651153545980752, 0.05791161463061786, 0.27917216180632, -0.22414821356548653, -0.18464070122675313, 0.16786990932750462, 0.15591381520532785, 0.016939080666120657, -0.21645295302904047, -0.034266000151546905, -0.06534208587083198, 0.1623479443403673, 0.07901967532747864, 0.1031373971440831, 0.3476416970438817, 0.07979791255681501, 0.020673093413386273, 0.08138134948197095, -0.34643022122669637, -0.039179079837220555, -0.1959968047312406, -0.09727927274755477, -0.11521049144742873, 0.044840358858517206, -0.11477704058897335, -0.07910948246032656, 0.2685294035811025, 0.13896913268356859, 0.19393838896854398, 0.016069642954629242, 0.33426594297976836, 0.03187023234717986, 0.16168794240665568, 0.09513609397211387, 0.3510815451051766, 0.16638664293328903, 0.07135428010951728, -0.21107437610557742, -0.004535693421905094, 0.010404203093939406] |
1,802.0528 | Spin-lattice Coupling in U(1) Quantum Spin Liquids | Quantum spin liquids (QSLs) are exotic phases with intrinsic massive
entanglements. Instead of microscopic spins, fractionalized particles and gauge
fluctuations are emergent, revealing QSLs' exotic natures. Quantum spins with
strong spin-orbit coupling on a pyrchlore lattice, for example Pr2Zr2O7, are
suggested to host a U(1) QSL with emergent photons, gapless excitations without
breaking any symmetries, as well as emergent monopoles. One of the key issues
in QSLs is an interplay between emergent degrees of freedom of QSLs and
conventional degrees of freedom, and we investigate the interplay by
constructing a general theory of spin-lattice coupling in U(1) QSLs. We find
that the coupling induces characteristic interplay between phonons and photons.
For example, photons become qualitatively more stable than phonons at low
temperature. We also propose mechanisms to detect emergent photons in
experiments such as sound attenuation and thermal transport relying on
spin-lattice coupling in U(1) QSLs.
| cond-mat.str-el | quantum spin liquids qsls are exotic phases with intrinsic massive entanglements instead of microscopic spins fractionalized particles and gauge fluctuations are emergent revealing qsls exotic natures quantum spins with strong spinorbit coupling on a pyrchlore lattice for example pr2zr2o7 are suggested to host a u1 qsl with emergent photons gapless excitations without breaking any symmetries as well as emergent monopoles one of the key issues in qsls is an interplay between emergent degrees of freedom of qsls and conventional degrees of freedom and we investigate the interplay by constructing a general theory of spinlattice coupling in u1 qsls we find that the coupling induces characteristic interplay between phonons and photons for example photons become qualitatively more stable than phonons at low temperature we also propose mechanisms to detect emergent photons in experiments such as sound attenuation and thermal transport relying on spinlattice coupling in u1 qsls | [['quantum', 'spin', 'liquids', 'qsls', 'are', 'exotic', 'phases', 'with', 'intrinsic', 'massive', 'entanglements', 'instead', 'of', 'microscopic', 'spins', 'fractionalized', 'particles', 'and', 'gauge', 'fluctuations', 'are', 'emergent', 'revealing', 'qsls', 'exotic', 'natures', 'quantum', 'spins', 'with', 'strong', 'spinorbit', 'coupling', 'on', 'a', 'pyrchlore', 'lattice', 'for', 'example', 'pr2zr2o7', 'are', 'suggested', 'to', 'host', 'a', 'u1', 'qsl', 'with', 'emergent', 'photons', 'gapless', 'excitations', 'without', 'breaking', 'any', 'symmetries', 'as', 'well', 'as', 'emergent', 'monopoles', 'one', 'of', 'the', 'key', 'issues', 'in', 'qsls', 'is', 'an', 'interplay', 'between', 'emergent', 'degrees', 'of', 'freedom', 'of', 'qsls', 'and', 'conventional', 'degrees', 'of', 'freedom', 'and', 'we', 'investigate', 'the', 'interplay', 'by', 'constructing', 'a', 'general', 'theory', 'of', 'spinlattice', 'coupling', 'in', 'u1', 'qsls', 'we', 'find', 'that', 'the', 'coupling', 'induces', 'characteristic', 'interplay', 'between', 'phonons', 'and', 'photons', 'for', 'example', 'photons', 'become', 'qualitatively', 'more', 'stable', 'than', 'phonons', 'at', 'low', 'temperature', 'we', 'also', 'propose', 'mechanisms', 'to', 'detect', 'emergent', 'photons', 'in', 'experiments', 'such', 'as', 'sound', 'attenuation', 'and', 'thermal', 'transport', 'relying', 'on', 'spinlattice', 'coupling', 'in', 'u1', 'qsls']] | [-0.24585780477058947, 0.36700446382255275, -0.032609188033203625, 0.09430785101822353, -0.07107830468468881, -0.20935128300675543, 0.018058654308672352, 0.35961635730646807, -0.22327415352879926, -0.3316470066406603, -0.0033953815473821655, -0.3411416470169507, -0.1428044892847538, 0.10814061846327165, 0.08552406771622341, -0.04482552534418887, -0.11060617979744385, -0.038209400698542596, -0.08966576087786335, -0.16968327664352698, 0.2723062763301704, 0.016153751013415128, 0.31011404355602534, 0.09425725096772457, 0.13501803440138183, -0.016970566119035257, 0.11572008162801121, -0.03888599374170961, -0.10158232450028601, 0.047995364409068535, 0.24252574838826368, -0.07481967310324825, 0.10557051780794201, -0.4922585008473232, -0.2600722507734237, 0.04217631819112034, 0.1843944143664477, 0.1822597376263604, -0.07579864147972268, -0.30931002285716863, -0.03283566347612389, -0.14190615005791188, -0.13796605536120077, -0.16233521735231424, -0.01943087268877646, -0.071911398257161, -0.21462794730504012, 0.13549317101253486, 0.04331441558656636, 0.14725465085839146, -0.03839981751034743, -0.033826716455374044, -0.09031415027245109, 0.0646954869514267, 0.1311624726007596, 0.007896361422949824, 0.16662699310430165, -0.20361161979943, -0.2021607072895457, 0.36831537973264167, -0.02213644004147901, -0.15399368752821765, 0.2451751013800245, -0.10917408969704913, -0.12856311307706195, 0.14453841691900943, 0.12063298673922966, 0.07741644162170846, -0.08338934554365174, 0.050097278601706735, -0.01252045559632624, 0.1634773945676741, -0.02535417595524983, 0.2238153567557737, 0.3765291582407623, 0.15591172367205908, 0.031062542897616993, 0.15192769430577754, -0.056641846737856494, -0.14794220657826498, -0.300757939471253, -0.17179109128192066, -0.20625708063679007, 0.1312151718467217, -0.10121646852318823, -0.1187506293299897, 0.3837457282340218, 0.15859267764628449, 0.1392122784756229, -0.060808981322394366, 0.2234160529963415, 0.04490191444899116, 0.0712903001120892, 0.08701295943866516, 0.27860158412107106, 0.19342119571239014, 0.019680922594049882, -0.3120131651292844, -0.015110154690799014, 0.058671061601489785] |
1,802.05281 | Fast Self-forced Inspirals | We present a new, fast method for computing the inspiral trajectory and
gravitational waves from extreme mass-ratio inspirals that can incorporate all
known (and future) self-force results. Using near-identity (averaging)
transformations we formulate equations of motion that do not explicitly depend
upon the orbital phases of the inspiral, making them fast to evaluate, and
whose solutions track the evolving constants of motion, orbital phases and
waveform phase of a full self-force inspiral to $O(\eta)$, where $\eta$ is the
(small) mass ratio. As a concrete example, we implement these equations for
inspirals of non-spinning (Schwarzschild) binaries. Our code computes inspiral
trajectories in milliseconds which is a speed up of 2-5 orders of magnitude
(depending on the mass-ratio) over previous self-force inspiral models which
take minutes to hours to evaluate. Computing two-year duration waveforms using
our new model we find a mismatch better than $\sim 10^{-4}$ with respect to
waveforms computed using the (slower) full self-force models. The speed of our
new approach is comparable with kludge models but has the added benefit of
easily incorporating self-force results which will, once known, allow the
waveform phase to be tracked to sub-radian accuracy over an inspiral.
| gr-qc hep-th | we present a new fast method for computing the inspiral trajectory and gravitational waves from extreme massratio inspirals that can incorporate all known and future selfforce results using nearidentity averaging transformations we formulate equations of motion that do not explicitly depend upon the orbital phases of the inspiral making them fast to evaluate and whose solutions track the evolving constants of motion orbital phases and waveform phase of a full selfforce inspiral to oeta where eta is the small mass ratio as a concrete example we implement these equations for inspirals of nonspinning schwarzschild binaries our code computes inspiral trajectories in milliseconds which is a speed up of 25 orders of magnitude depending on the massratio over previous selfforce inspiral models which take minutes to hours to evaluate computing twoyear duration waveforms using our new model we find a mismatch better than sim 104 with respect to waveforms computed using the slower full selfforce models the speed of our new approach is comparable with kludge models but has the added benefit of easily incorporating selfforce results which will once known allow the waveform phase to be tracked to subradian accuracy over an inspiral | [['we', 'present', 'a', 'new', 'fast', 'method', 'for', 'computing', 'the', 'inspiral', 'trajectory', 'and', 'gravitational', 'waves', 'from', 'extreme', 'massratio', 'inspirals', 'that', 'can', 'incorporate', 'all', 'known', 'and', 'future', 'selfforce', 'results', 'using', 'nearidentity', 'averaging', 'transformations', 'we', 'formulate', 'equations', 'of', 'motion', 'that', 'do', 'not', 'explicitly', 'depend', 'upon', 'the', 'orbital', 'phases', 'of', 'the', 'inspiral', 'making', 'them', 'fast', 'to', 'evaluate', 'and', 'whose', 'solutions', 'track', 'the', 'evolving', 'constants', 'of', 'motion', 'orbital', 'phases', 'and', 'waveform', 'phase', 'of', 'a', 'full', 'selfforce', 'inspiral', 'to', 'oeta', 'where', 'eta', 'is', 'the', 'small', 'mass', 'ratio', 'as', 'a', 'concrete', 'example', 'we', 'implement', 'these', 'equations', 'for', 'inspirals', 'of', 'nonspinning', 'schwarzschild', 'binaries', 'our', 'code', 'computes', 'inspiral', 'trajectories', 'in', 'milliseconds', 'which', 'is', 'a', 'speed', 'up', 'of', '25', 'orders', 'of', 'magnitude', 'depending', 'on', 'the', 'massratio', 'over', 'previous', 'selfforce', 'inspiral', 'models', 'which', 'take', 'minutes', 'to', 'hours', 'to', 'evaluate', 'computing', 'twoyear', 'duration', 'waveforms', 'using', 'our', 'new', 'model', 'we', 'find', 'a', 'mismatch', 'better', 'than', 'sim', '104', 'with', 'respect', 'to', 'waveforms', 'computed', 'using', 'the', 'slower', 'full', 'selfforce', 'models', 'the', 'speed', 'of', 'our', 'new', 'approach', 'is', 'comparable', 'with', 'kludge', 'models', 'but', 'has', 'the', 'added', 'benefit', 'of', 'easily', 'incorporating', 'selfforce', 'results', 'which', 'will', 'once', 'known', 'allow', 'the', 'waveform', 'phase', 'to', 'be', 'tracked', 'to', 'subradian', 'accuracy', 'over', 'an', 'inspiral']] | [-0.135993124495144, 0.10789124794556908, -0.08959654390249246, 0.04398262401991815, -0.1120157990953885, -0.08159249627351528, 0.01761535655593131, 0.3519596085243393, -0.16765641320913952, -0.3327612438827903, 0.06391084446598445, -0.2438503934184458, -0.11145986722355399, 0.283965228925202, -0.042471210721487296, 0.07571852964307861, 0.1387835361432129, 0.006968353541803178, -0.15815641195998373, -0.2470616502082521, 0.24876178854174213, 0.06456233688125697, 0.12106608019288008, -0.050389053038088605, 0.12730244238628075, 0.00014695440586365294, -0.02350251092138933, -0.04616203105373037, -0.1359433539839756, 0.020172990285573178, 0.23579412827664706, 0.14893745806330116, 0.19672712347043367, -0.4172533739183564, -0.20803685564897023, 0.050839669802371645, 0.16146807621407788, 0.16608115182377028, -0.008312636322443723, -0.31036711437870207, 0.07901752078244802, -0.2800176797536551, -0.09244398167841912, -0.1114022598194424, 0.08618873006586607, 0.02393565335751191, -0.2697196739415328, 0.09147001328286326, 0.03255566432684039, -0.06502440445910906, -0.09391135674983768, -0.08999643758822155, 0.013775187579691798, 0.134597727538979, 0.08574614022230283, 0.09544780728659437, 0.16506128477916113, -0.05501006567093706, -0.12157326966583544, 0.4113100134030295, -0.0713364579694371, -0.19392912562761921, 0.17748697063264748, -0.18307423988168617, -0.07235061600173746, 0.1888547400291524, 0.2511984466715755, 0.2106526647718662, -0.13929131066349024, 0.010249294256936992, 0.11738725107958696, 0.24837579209148922, 0.10360498569086, -0.013061531778172744, 0.2950842137458191, 0.13397936632827623, 0.02300588562563159, 0.08660627545699147, -0.126652543401633, -0.10235486903699591, -0.2727120896258081, -0.08341286691412127, -0.15496606375381816, 0.05519684023731012, -0.1671647572168998, -0.17064727829468515, 0.4003266694004803, 0.21744351951080412, 0.1551403626059861, 0.1063712016845481, 0.3524956149049103, 0.12069996534107001, 0.05300079827444885, 0.10118583032696431, 0.31861921773815993, 0.05370135852960326, 0.07056223871647187, -0.20638284362333556, 0.017445551937271375, 0.08651233944495591] |
1,802.05282 | Further constraints on neutron star crustal properties in the low-mass
X-ray binary 1RXS J180408.9$-$342058 | We report on two new quiescent {\it XMM-Newton} observations (in addition to
the earlier {\it Swift}/XRT and {\it XMM-Newton} coverage) of the cooling
neutron star crust in the low-mass X-ray binary 1RXS J180408.9$-$342058. Its
crust was heated during the $\sim$4.5 month accretion outburst of the source.
From our quiescent observations, fitting the spectra with a neutron star
atmosphere model, we found that the crust had cooled from $\sim$ 100 eV to
$\sim$73 eV from $\sim$8 days to $\sim$479 days after the end of its outburst.
However, during the most recent observation, taken $\sim$860 days after the end
of the outburst, we found that the crust appeared not to have cooled further.
This suggested that the crust had returned to thermal equilibrium with the
neutron star core. We model the quiescent thermal evolution with the
theoretical crustal cooling code NSCool and find that the source requires a
shallow heat source, in addition to the standard deep crustal heating
processes, contributing $\sim$0.9 MeV per accreted nucleon during outburst to
explain its observed temperature decay. Our high quality {\it XMM-Newton} data
required an additional hard component to adequately fit the spectra. This
slightly complicates our interpretation of the quiescent data of 1RXS
J180408.9$-$342058. The origin of this component is not fully understood.
| astro-ph.HE | we report on two new quiescent it xmmnewton observations in addition to the earlier it swiftxrt and it xmmnewton coverage of the cooling neutron star crust in the lowmass xray binary 1rxs j1804089342058 its crust was heated during the sim45 month accretion outburst of the source from our quiescent observations fitting the spectra with a neutron star atmosphere model we found that the crust had cooled from sim 100 ev to sim73 ev from sim8 days to sim479 days after the end of its outburst however during the most recent observation taken sim860 days after the end of the outburst we found that the crust appeared not to have cooled further this suggested that the crust had returned to thermal equilibrium with the neutron star core we model the quiescent thermal evolution with the theoretical crustal cooling code nscool and find that the source requires a shallow heat source in addition to the standard deep crustal heating processes contributing sim09 mev per accreted nucleon during outburst to explain its observed temperature decay our high quality it xmmnewton data required an additional hard component to adequately fit the spectra this slightly complicates our interpretation of the quiescent data of 1rxs j1804089342058 the origin of this component is not fully understood | [['we', 'report', 'on', 'two', 'new', 'quiescent', 'it', 'xmmnewton', 'observations', 'in', 'addition', 'to', 'the', 'earlier', 'it', 'swiftxrt', 'and', 'it', 'xmmnewton', 'coverage', 'of', 'the', 'cooling', 'neutron', 'star', 'crust', 'in', 'the', 'lowmass', 'xray', 'binary', '1rxs', 'j1804089342058', 'its', 'crust', 'was', 'heated', 'during', 'the', 'sim45', 'month', 'accretion', 'outburst', 'of', 'the', 'source', 'from', 'our', 'quiescent', 'observations', 'fitting', 'the', 'spectra', 'with', 'a', 'neutron', 'star', 'atmosphere', 'model', 'we', 'found', 'that', 'the', 'crust', 'had', 'cooled', 'from', 'sim', '100', 'ev', 'to', 'sim73', 'ev', 'from', 'sim8', 'days', 'to', 'sim479', 'days', 'after', 'the', 'end', 'of', 'its', 'outburst', 'however', 'during', 'the', 'most', 'recent', 'observation', 'taken', 'sim860', 'days', 'after', 'the', 'end', 'of', 'the', 'outburst', 'we', 'found', 'that', 'the', 'crust', 'appeared', 'not', 'to', 'have', 'cooled', 'further', 'this', 'suggested', 'that', 'the', 'crust', 'had', 'returned', 'to', 'thermal', 'equilibrium', 'with', 'the', 'neutron', 'star', 'core', 'we', 'model', 'the', 'quiescent', 'thermal', 'evolution', 'with', 'the', 'theoretical', 'crustal', 'cooling', 'code', 'nscool', 'and', 'find', 'that', 'the', 'source', 'requires', 'a', 'shallow', 'heat', 'source', 'in', 'addition', 'to', 'the', 'standard', 'deep', 'crustal', 'heating', 'processes', 'contributing', 'sim09', 'mev', 'per', 'accreted', 'nucleon', 'during', 'outburst', 'to', 'explain', 'its', 'observed', 'temperature', 'decay', 'our', 'high', 'quality', 'it', 'xmmnewton', 'data', 'required', 'an', 'additional', 'hard', 'component', 'to', 'adequately', 'fit', 'the', 'spectra', 'this', 'slightly', 'complicates', 'our', 'interpretation', 'of', 'the', 'quiescent', 'data', 'of', '1rxs', 'j1804089342058', 'the', 'origin', 'of', 'this', 'component', 'is', 'not', 'fully', 'understood']] | [-0.01613514018267537, 0.1787662317370799, -0.1192160776708329, 0.06992650382864123, -0.13209344599812722, -0.05872846085686183, 0.11801329418254233, 0.41766442549257465, -0.21310264689809585, -0.357936995457138, 0.10378860845905391, -0.3164875642216544, 0.021576586222177112, 0.19036690057069738, -0.04275600385856657, -0.0025442378696139702, 0.13222452007450056, -0.008754162350669503, -0.061014611423600484, -0.29429538764120283, 0.21947685664054006, 0.12351476638518827, 0.17062630159622913, 0.013607256721867167, 0.040977054483657654, -0.08455623820613044, -0.028809369299594528, -0.12106783832490876, -0.13091157286853647, -0.00391426245605456, 0.22222081092321247, 0.10939881180082381, 0.17339297540284523, -0.45196092838718405, -0.25371610582918647, 0.05555013660566458, 0.12669079660793434, -0.022783876690847107, -0.017034551241786045, -0.22239896689107472, 0.03585228375001734, -0.26029471998611364, -0.14114003896191357, 0.036924525982911745, 0.046649030188240834, -0.05300277478797226, -0.17434291744790015, 0.13047821747346056, 0.06440317229894192, 0.017168036414589284, -0.21758100320191398, -0.09576160650349398, -0.04315055261033133, 0.0370274732105326, 0.10149242525643574, 0.09853269708689284, 0.17045144303049442, -0.10185131281366851, -0.0059932912092493925, 0.3337630904122179, -0.06859291910648274, 0.09687032793020911, 0.1850923461443632, -0.20650826859994284, -0.1962317942702414, 0.2196554699462753, 0.09537527179750412, 0.0926030880573615, -0.17290350579873745, -0.055142755917687386, -0.026499825399279017, 0.27043045194063714, 0.041942574404369014, -0.00528790567583148, 0.33366653241204763, 0.19162148161249118, -0.05915656384948983, 0.16095579089596868, -0.25301438969883905, -0.005660455077796598, -0.23782271015624276, -0.025865375408779038, -0.13107186246546354, 0.10769139531370509, -0.05933846199897946, -0.11142335559920845, 0.3688083978882734, 0.10370846894448219, 0.1761711441601316, -0.003090299358861386, 0.3147245577878458, 0.09056625163783252, 0.08814850258573458, 0.15722831761113543, 0.3701970619666908, 0.1868449207721503, 0.18566156428190317, -0.28083441479037097, 0.09541390442170185, -0.030418070138922493] |
1,802.05283 | NeVAE: A Deep Generative Model for Molecular Graphs | Deep generative models have been praised for their ability to learn smooth
latent representation of images, text, and audio, which can then be used to
generate new, plausible data. However, current generative models are unable to
work with molecular graphs due to their unique characteristics-their underlying
structure is not Euclidean or grid-like, they remain isomorphic under
permutation of the nodes labels, and they come with a different number of nodes
and edges. In this paper, we first propose a novel variational autoencoder for
molecular graphs, whose encoder and decoder are specially designed to account
for the above properties by means of several technical innovations. Moreover,
in contrast with the state of the art, our decoder is able to provide the
spatial coordinates of the atoms of the molecules it generates. Then, we
develop a gradient-based algorithm to optimize the decoder of our model so that
it learns to generate molecules that maximize the value of certain property of
interest and, given a molecule of interest, it is able to optimize the spatial
configuration of its atoms for greater stability. Experiments reveal that our
variational autoencoder can discover plausible, diverse and novel molecules
more effectively than several state of the art models. Moreover, for several
properties of interest, our optimized decoder is able to identify molecules
with property values 121% higher than those identified by several state of the
art methods based on Bayesian optimization and reinforcement learning
| cs.LG physics.soc-ph stat.ML | deep generative models have been praised for their ability to learn smooth latent representation of images text and audio which can then be used to generate new plausible data however current generative models are unable to work with molecular graphs due to their unique characteristicstheir underlying structure is not euclidean or gridlike they remain isomorphic under permutation of the nodes labels and they come with a different number of nodes and edges in this paper we first propose a novel variational autoencoder for molecular graphs whose encoder and decoder are specially designed to account for the above properties by means of several technical innovations moreover in contrast with the state of the art our decoder is able to provide the spatial coordinates of the atoms of the molecules it generates then we develop a gradientbased algorithm to optimize the decoder of our model so that it learns to generate molecules that maximize the value of certain property of interest and given a molecule of interest it is able to optimize the spatial configuration of its atoms for greater stability experiments reveal that our variational autoencoder can discover plausible diverse and novel molecules more effectively than several state of the art models moreover for several properties of interest our optimized decoder is able to identify molecules with property values 121 higher than those identified by several state of the art methods based on bayesian optimization and reinforcement learning | [['deep', 'generative', 'models', 'have', 'been', 'praised', 'for', 'their', 'ability', 'to', 'learn', 'smooth', 'latent', 'representation', 'of', 'images', 'text', 'and', 'audio', 'which', 'can', 'then', 'be', 'used', 'to', 'generate', 'new', 'plausible', 'data', 'however', 'current', 'generative', 'models', 'are', 'unable', 'to', 'work', 'with', 'molecular', 'graphs', 'due', 'to', 'their', 'unique', 'characteristicstheir', 'underlying', 'structure', 'is', 'not', 'euclidean', 'or', 'gridlike', 'they', 'remain', 'isomorphic', 'under', 'permutation', 'of', 'the', 'nodes', 'labels', 'and', 'they', 'come', 'with', 'a', 'different', 'number', 'of', 'nodes', 'and', 'edges', 'in', 'this', 'paper', 'we', 'first', 'propose', 'a', 'novel', 'variational', 'autoencoder', 'for', 'molecular', 'graphs', 'whose', 'encoder', 'and', 'decoder', 'are', 'specially', 'designed', 'to', 'account', 'for', 'the', 'above', 'properties', 'by', 'means', 'of', 'several', 'technical', 'innovations', 'moreover', 'in', 'contrast', 'with', 'the', 'state', 'of', 'the', 'art', 'our', 'decoder', 'is', 'able', 'to', 'provide', 'the', 'spatial', 'coordinates', 'of', 'the', 'atoms', 'of', 'the', 'molecules', 'it', 'generates', 'then', 'we', 'develop', 'a', 'gradientbased', 'algorithm', 'to', 'optimize', 'the', 'decoder', 'of', 'our', 'model', 'so', 'that', 'it', 'learns', 'to', 'generate', 'molecules', 'that', 'maximize', 'the', 'value', 'of', 'certain', 'property', 'of', 'interest', 'and', 'given', 'a', 'molecule', 'of', 'interest', 'it', 'is', 'able', 'to', 'optimize', 'the', 'spatial', 'configuration', 'of', 'its', 'atoms', 'for', 'greater', 'stability', 'experiments', 'reveal', 'that', 'our', 'variational', 'autoencoder', 'can', 'discover', 'plausible', 'diverse', 'and', 'novel', 'molecules', 'more', 'effectively', 'than', 'several', 'state', 'of', 'the', 'art', 'models', 'moreover', 'for', 'several', 'properties', 'of', 'interest', 'our', 'optimized', 'decoder', 'is', 'able', 'to', 'identify', 'molecules', 'with', 'property', 'values', '121', 'higher', 'than', 'those', 'identified', 'by', 'several', 'state', 'of', 'the', 'art', 'methods', 'based', 'on', 'bayesian', 'optimization', 'and', 'reinforcement', 'learning']] | [-0.030070122688642696, 0.061503402346161085, -0.07180965733536819, 0.06586726487617174, -0.12264248707442213, -0.1747903276444018, 0.03648725252053937, 0.4545039178771993, -0.2939465020475436, -0.3242102157782321, 0.0648828270217163, -0.24539352963299696, -0.1742542104655482, 0.14783273883345457, -0.08170511671322224, 0.08732381215995084, 0.07501421114025338, 0.06414147450845645, -0.06127917816294199, -0.2801719896231866, 0.30747351057381545, 0.050028028835663846, 0.2863679417553042, 0.00576505719923801, 0.14127326682180372, -0.06699635683937724, 0.02958555330751243, -0.012201230104823234, -0.10673311143129806, 0.1996957857410376, 0.2911177395411931, 0.18397110544531842, 0.28946800779115206, -0.45131847302634587, -0.23211246098281216, 0.11916111810606415, 0.13196925011905447, 0.12416082793813182, -0.021546168078942683, -0.31119362281445984, 0.12112148354763276, -0.1425937823428362, -0.02542172575574684, -0.1529043911289329, -0.03892463526315593, 0.036934547991515534, -0.276232595801387, -0.0003175982796997463, 0.0720535368874168, 0.009558973772751198, -0.05681341678107363, -0.13547578436062055, -0.03004248582825096, 0.14552032970527376, 0.031272163128744715, 0.05779949948783585, 0.09914294345860795, -0.1527316456663588, -0.12742327852667926, 0.3740596006608615, -0.02926057663618417, -0.2209836938375902, 0.208806878314906, -0.06456991706351292, -0.1455286776358893, 0.14557943059431422, 0.19804499991301258, 0.13338923460401406, -0.1571855568230819, -0.0008624807684346875, -0.04845277367996336, 0.17859390868915845, 0.030094007913110052, 0.047355533003317726, 0.17091391641563752, 0.17965155387281487, 0.06251916373508659, 0.15722797769348737, -0.11379898065144702, -0.09490702162749308, -0.2160877183995257, -0.13325269518309604, -0.21050286246463656, -0.008049978930796635, -0.07029140718835969, -0.15300626213095295, 0.41684865536342963, 0.2225235023464755, 0.21743822751282635, 0.0849050412618484, 0.28058731309493407, 0.03745204003101562, 0.09244091866806275, 0.09943209681166652, 0.18993767308686876, 0.11026478762203439, 0.05202021085365154, -0.1532072414904517, 0.1173061605679045, 0.01882740753785198] |
1,802.05284 | MOCCA-SURVEY Database I: Galactic Globular Clusters Harbouring a Black
Hole Subsystem | There have been increasing theoretical speculations and observational
indications that certain globular clusters (GCs) could contain a sizeable
population of stellar mass black holes (BHs). In this paper, we shortlist at
least 29 Galactic GCs that could be hosting a subsystem of BHs (BHS). In a
companion paper, we analysed results from a wide array of GC models (simulated
with the MOCCA code for cluster simulations) that retained few tens to several
hundreds of BHs at 12 Gyr and showed that the properties of the BHS in those
GCs correlate with the GC's observable properties. Building on those results,
we use available observational properties of 140 Galactic GCs to identify 29
GCs that could potentially be harbouring up to a few hundreds of BHs. Utilizing
observational properties and theoretical scaling relations, we estimate the
density, size and mass of the BHS in these GCs. We also calculate the total
number of BHs and the fraction of BHs contained in a binary system for our
shortlisted Galactic GCs. Additionally, we mention other Galactic GCs that
could also contain significant number of single BHs or BHs in binary systems.
| astro-ph.GA astro-ph.SR | there have been increasing theoretical speculations and observational indications that certain globular clusters gcs could contain a sizeable population of stellar mass black holes bhs in this paper we shortlist at least 29 galactic gcs that could be hosting a subsystem of bhs bhs in a companion paper we analysed results from a wide array of gc models simulated with the mocca code for cluster simulations that retained few tens to several hundreds of bhs at 12 gyr and showed that the properties of the bhs in those gcs correlate with the gcs observable properties building on those results we use available observational properties of 140 galactic gcs to identify 29 gcs that could potentially be harbouring up to a few hundreds of bhs utilizing observational properties and theoretical scaling relations we estimate the density size and mass of the bhs in these gcs we also calculate the total number of bhs and the fraction of bhs contained in a binary system for our shortlisted galactic gcs additionally we mention other galactic gcs that could also contain significant number of single bhs or bhs in binary systems | [['there', 'have', 'been', 'increasing', 'theoretical', 'speculations', 'and', 'observational', 'indications', 'that', 'certain', 'globular', 'clusters', 'gcs', 'could', 'contain', 'a', 'sizeable', 'population', 'of', 'stellar', 'mass', 'black', 'holes', 'bhs', 'in', 'this', 'paper', 'we', 'shortlist', 'at', 'least', '29', 'galactic', 'gcs', 'that', 'could', 'be', 'hosting', 'a', 'subsystem', 'of', 'bhs', 'bhs', 'in', 'a', 'companion', 'paper', 'we', 'analysed', 'results', 'from', 'a', 'wide', 'array', 'of', 'gc', 'models', 'simulated', 'with', 'the', 'mocca', 'code', 'for', 'cluster', 'simulations', 'that', 'retained', 'few', 'tens', 'to', 'several', 'hundreds', 'of', 'bhs', 'at', '12', 'gyr', 'and', 'showed', 'that', 'the', 'properties', 'of', 'the', 'bhs', 'in', 'those', 'gcs', 'correlate', 'with', 'the', 'gcs', 'observable', 'properties', 'building', 'on', 'those', 'results', 'we', 'use', 'available', 'observational', 'properties', 'of', '140', 'galactic', 'gcs', 'to', 'identify', '29', 'gcs', 'that', 'could', 'potentially', 'be', 'harbouring', 'up', 'to', 'a', 'few', 'hundreds', 'of', 'bhs', 'utilizing', 'observational', 'properties', 'and', 'theoretical', 'scaling', 'relations', 'we', 'estimate', 'the', 'density', 'size', 'and', 'mass', 'of', 'the', 'bhs', 'in', 'these', 'gcs', 'we', 'also', 'calculate', 'the', 'total', 'number', 'of', 'bhs', 'and', 'the', 'fraction', 'of', 'bhs', 'contained', 'in', 'a', 'binary', 'system', 'for', 'our', 'shortlisted', 'galactic', 'gcs', 'additionally', 'we', 'mention', 'other', 'galactic', 'gcs', 'that', 'could', 'also', 'contain', 'significant', 'number', 'of', 'single', 'bhs', 'or', 'bhs', 'in', 'binary', 'systems']] | [-0.09858462313329552, 0.12626871923208835, -0.06221851284172446, 0.1535221049090521, -0.10624866107762616, -0.031038257432852517, 0.0723500534516067, 0.4008768701746582, -0.11587779142988477, -0.39682859106656704, 0.042330317072231664, -0.3635044185753493, -0.0350711257206301, 0.2455296926573915, -0.028025389135999477, -0.005991133901086402, 0.1245930754719053, -0.03541349747248074, -0.04601356174913857, -0.32988853989677, 0.3064255077929739, 0.039812016589716476, 0.08301477915984654, -0.07107073768604806, 0.05671618080867285, -0.10321134318258952, -0.0030737000338255083, 0.026963659572131173, -0.1602280813867424, 0.061525089165412467, 0.2547447660711339, 0.20048162129453637, 0.23554488301854878, -0.3901520871462669, -0.20902637758835113, 0.08463912010118166, 0.2611456709430817, 0.12155153766463705, -0.1848595574638871, -0.22363057922083826, 0.1406375651003763, -0.24634095744533654, -0.1929282511230857, 0.034407646997886544, 0.04702242950405826, 0.06339800344055566, -0.16715402849579483, 0.15648900993127265, 0.030348831471454174, 0.012892729438403073, -0.12811255397805496, -0.12518281499509087, -0.053230364303936295, 0.06986341338273497, 0.06055083724963952, 0.030316637768559557, 0.19740038017996334, -0.07238865724296613, -0.07525087575263836, 0.353319476931331, -0.009190110301718435, -0.03134663836447831, 0.24594854659034826, -0.2472067415330778, -0.25349773741252524, 0.057305687196791806, 0.22325695585957503, 0.13267974295643442, -0.1922829375990771, 0.012063103029193148, -0.049690258391027184, 0.25556311676189064, 0.05591912968532446, 0.09833029053861246, 0.3711152915409542, 0.10684226135558941, -0.00021364579828864433, 0.0720240475207114, -0.15285018121669278, -0.04154800345503631, -0.1905395793305202, -0.09096102317157674, -0.10075137203927824, 0.10410307077342336, -0.1846129672702515, -0.11998670884622212, 0.3253633522871822, 0.13731268435756472, 0.2232518626294811, 0.051559778138307887, 0.2289280926241307, 0.03210862179505913, 0.15620516814829352, 0.1429374776581392, 0.30273367819142216, 0.17754668413965222, 0.03542184722821482, -0.21011719620353317, 0.03572671588779213, -0.054377589661149896] |
1,802.05285 | Phase Transitions and Conductivties of Floquet Fluids | We investigate the phase structure and conductivity of a relativistic fluid
in a circulating electric field with a transverse magnetic field. This system
exhibits behavior similar to other driven systems such as strongly coupled
driven CFTs [Rangamani2015] or a simple anharmonic oscillator. We identify
distinct regions of fluid behavior as a function of driving frequency, and
argue that a "phase" transition will occur. Such a transition could be
measurable in graphene, and may be characterized by sudden discontinuous
increase in the Hall conductivity. The presence of the discontinuity depends on
how the boundary is approached as the frequency or amplitude is dialed. In the
region where two solution exists the measured conductivity will depend on how
the system is prepared.
| hep-th | we investigate the phase structure and conductivity of a relativistic fluid in a circulating electric field with a transverse magnetic field this system exhibits behavior similar to other driven systems such as strongly coupled driven cfts rangamani2015 or a simple anharmonic oscillator we identify distinct regions of fluid behavior as a function of driving frequency and argue that a phase transition will occur such a transition could be measurable in graphene and may be characterized by sudden discontinuous increase in the hall conductivity the presence of the discontinuity depends on how the boundary is approached as the frequency or amplitude is dialed in the region where two solution exists the measured conductivity will depend on how the system is prepared | [['we', 'investigate', 'the', 'phase', 'structure', 'and', 'conductivity', 'of', 'a', 'relativistic', 'fluid', 'in', 'a', 'circulating', 'electric', 'field', 'with', 'a', 'transverse', 'magnetic', 'field', 'this', 'system', 'exhibits', 'behavior', 'similar', 'to', 'other', 'driven', 'systems', 'such', 'as', 'strongly', 'coupled', 'driven', 'cfts', 'rangamani2015', 'or', 'a', 'simple', 'anharmonic', 'oscillator', 'we', 'identify', 'distinct', 'regions', 'of', 'fluid', 'behavior', 'as', 'a', 'function', 'of', 'driving', 'frequency', 'and', 'argue', 'that', 'a', 'phase', 'transition', 'will', 'occur', 'such', 'a', 'transition', 'could', 'be', 'measurable', 'in', 'graphene', 'and', 'may', 'be', 'characterized', 'by', 'sudden', 'discontinuous', 'increase', 'in', 'the', 'hall', 'conductivity', 'the', 'presence', 'of', 'the', 'discontinuity', 'depends', 'on', 'how', 'the', 'boundary', 'is', 'approached', 'as', 'the', 'frequency', 'or', 'amplitude', 'is', 'dialed', 'in', 'the', 'region', 'where', 'two', 'solution', 'exists', 'the', 'measured', 'conductivity', 'will', 'depend', 'on', 'how', 'the', 'system', 'is', 'prepared']] | [-0.2171860432737515, 0.23549823523225152, -0.0781947242960866, -0.019200996399911886, -0.03815061428012843, -0.15693287544750742, 0.013866200720296562, 0.35944103458191917, -0.26965208910405636, -0.2416140299853908, 0.09730536898034585, -0.2865202927163669, -0.1657334437805126, 0.1874250276835964, -0.022467636184604494, -0.0165082053565068, -0.020554497705952524, 0.040688981505564784, -0.06702579284564224, -0.12042611108177162, 0.3176952221767366, 0.002006298932833832, 0.28335965989830614, 0.06357572704725781, 0.06539475694474835, -0.05220886262744164, 0.08062595505259555, 0.1160067655537434, -0.1106471714406287, -0.010635580237516585, 0.2190431757133548, -0.014223982846098287, 0.2251780059522687, -0.41269570312799275, -0.22517942429027138, 0.0936741857210315, 0.15982429037934967, 0.11482144337726616, -0.04636712938824966, -0.24699309932365388, -0.009142818672879905, -0.16331313440122275, -0.1573082687716712, -0.06997546545785516, 0.008242101371366562, 0.030009432965811312, -0.2615910490819237, 0.1257827667990981, 0.042493046218325864, 0.06679985123616056, -0.08103152891589689, -0.049790126692206296, -0.05036851654157919, 0.10509507975173223, 0.03336139568988578, 0.07746972569788829, 0.2097998401463157, -0.1669489062731663, -0.08072279105667307, 0.37676726995396015, -0.10755995257186289, -0.18107719532754116, 0.19907148386265675, -0.21778793499546767, -0.05939420453515373, 0.1390362587217398, 0.18153997784198708, 0.09061555917366963, -0.11006861353662852, 0.052867474704061265, 0.0180530069061328, 0.18573041221502573, 0.057636841577908195, 0.030413163305424592, 0.27372683235150647, 0.1820844660205923, 0.033859032089821994, 0.1870932172677683, -0.07334826554625663, -0.06610072228447103, -0.28706127912306983, -0.13859276779528176, -0.202728935298236, 0.07436113034476753, -0.04722758345738808, -0.23092804643122025, 0.4031248878092826, 0.14346279607627915, 0.2060450887434212, -0.07169210801425413, 0.240172142267595, 0.21097207563819692, 0.043491351449502114, 0.056479763654412846, 0.2824299654555546, 0.10863339351372746, 0.1404818042079691, -0.2845407342733894, 0.06318797985827472, 0.02594996277955087] |
1,802.05286 | Covariant Galilean versus Carrollian hydrodynamics from relativistic
fluids | We provide the set of equations for non-relativistic fluid dynamics on
arbitrary, possibly time-dependent spaces, in general coordinates. These
equations are fully covariant under either local Galilean or local Carrollian
transformations, and are obtained from standard relativistic hydrodynamics in
the limit of infinite or vanishing velocity of light. All dissipative phenomena
such as friction and heat conduction are included in our description. Part of
our work consists in designing the appropriate coordinate frames for
relativistic spacetimes, invariant under Galilean or Carrollian
diffeomorphisms. The guide for the former is the dynamics of relativistic point
particles, and leads to the Zermelo frame. For the latter, the relevant objects
are relativistic instantonic space-filling branes in Randers-Papapetrou
backgrounds. We apply our results for obtaining the general
first-derivative-order Galilean fluid equations, in particular for
incompressible fluids (Navier-Stokes equations) and further illustrate our
findings with two applications: Galilean fluids in rotating frames or inflating
surfaces and Carrollian conformal fluids on two-dimensional time-dependent
geometries. The first is useful in atmospheric physics, while the dynamics
emerging in the second is governed by the Robinson-Trautman equation,
describing a Calabi flow on the surface, and known to appear when solving
Einstein's equations for algebraically special Ricci-flat or Einstein
spacetimes.
| hep-th gr-qc physics.flu-dyn | we provide the set of equations for nonrelativistic fluid dynamics on arbitrary possibly timedependent spaces in general coordinates these equations are fully covariant under either local galilean or local carrollian transformations and are obtained from standard relativistic hydrodynamics in the limit of infinite or vanishing velocity of light all dissipative phenomena such as friction and heat conduction are included in our description part of our work consists in designing the appropriate coordinate frames for relativistic spacetimes invariant under galilean or carrollian diffeomorphisms the guide for the former is the dynamics of relativistic point particles and leads to the zermelo frame for the latter the relevant objects are relativistic instantonic spacefilling branes in randerspapapetrou backgrounds we apply our results for obtaining the general firstderivativeorder galilean fluid equations in particular for incompressible fluids navierstokes equations and further illustrate our findings with two applications galilean fluids in rotating frames or inflating surfaces and carrollian conformal fluids on twodimensional timedependent geometries the first is useful in atmospheric physics while the dynamics emerging in the second is governed by the robinsontrautman equation describing a calabi flow on the surface and known to appear when solving einsteins equations for algebraically special ricciflat or einstein spacetimes | [['we', 'provide', 'the', 'set', 'of', 'equations', 'for', 'nonrelativistic', 'fluid', 'dynamics', 'on', 'arbitrary', 'possibly', 'timedependent', 'spaces', 'in', 'general', 'coordinates', 'these', 'equations', 'are', 'fully', 'covariant', 'under', 'either', 'local', 'galilean', 'or', 'local', 'carrollian', 'transformations', 'and', 'are', 'obtained', 'from', 'standard', 'relativistic', 'hydrodynamics', 'in', 'the', 'limit', 'of', 'infinite', 'or', 'vanishing', 'velocity', 'of', 'light', 'all', 'dissipative', 'phenomena', 'such', 'as', 'friction', 'and', 'heat', 'conduction', 'are', 'included', 'in', 'our', 'description', 'part', 'of', 'our', 'work', 'consists', 'in', 'designing', 'the', 'appropriate', 'coordinate', 'frames', 'for', 'relativistic', 'spacetimes', 'invariant', 'under', 'galilean', 'or', 'carrollian', 'diffeomorphisms', 'the', 'guide', 'for', 'the', 'former', 'is', 'the', 'dynamics', 'of', 'relativistic', 'point', 'particles', 'and', 'leads', 'to', 'the', 'zermelo', 'frame', 'for', 'the', 'latter', 'the', 'relevant', 'objects', 'are', 'relativistic', 'instantonic', 'spacefilling', 'branes', 'in', 'randerspapapetrou', 'backgrounds', 'we', 'apply', 'our', 'results', 'for', 'obtaining', 'the', 'general', 'firstderivativeorder', 'galilean', 'fluid', 'equations', 'in', 'particular', 'for', 'incompressible', 'fluids', 'navierstokes', 'equations', 'and', 'further', 'illustrate', 'our', 'findings', 'with', 'two', 'applications', 'galilean', 'fluids', 'in', 'rotating', 'frames', 'or', 'inflating', 'surfaces', 'and', 'carrollian', 'conformal', 'fluids', 'on', 'twodimensional', 'timedependent', 'geometries', 'the', 'first', 'is', 'useful', 'in', 'atmospheric', 'physics', 'while', 'the', 'dynamics', 'emerging', 'in', 'the', 'second', 'is', 'governed', 'by', 'the', 'robinsontrautman', 'equation', 'describing', 'a', 'calabi', 'flow', 'on', 'the', 'surface', 'and', 'known', 'to', 'appear', 'when', 'solving', 'einsteins', 'equations', 'for', 'algebraically', 'special', 'ricciflat', 'or', 'einstein', 'spacetimes']] | [-0.156399262636465, 0.15113339487340322, -0.08565260910371149, 0.07566635718339874, -0.0776867360032641, -0.15474050571707074, -0.1036600634653055, 0.28874133442183436, -0.21498222862308855, -0.25508734403026817, 0.07113118239898272, -0.264608915392924, -0.11131211809298676, 0.19542901321174813, -0.06293031563367789, 0.08044784146876353, 0.02374437146791763, 0.012649265704304215, -0.10238583395340324, -0.21192578846638369, 0.3726021288515915, 0.0321185307690713, 0.2508994346451449, -0.022612790239686476, 0.12853568564594586, -0.003035410598090609, -0.03468120485180185, 0.07507861989696846, -0.1437101606073521, 0.052200539347238194, 0.2376146117097646, 0.02194248662131654, 0.16975890859006548, -0.48586435594269767, -0.283958666707356, 0.02912989678629556, 0.13139683001575433, 0.18001111586658558, -0.05385811241204155, -0.33294490147334743, -0.006289587230870718, -0.10949286247182846, -0.20032368318135213, -0.1092074639855312, 0.02954045272559911, 0.01365901303222299, -0.22088365181855063, 0.12823298778195824, 0.09962983601484306, 0.054686261727894196, -0.15345420301206372, -0.037359225785898675, -0.03591153897973827, 0.06328255696730986, 0.0857506334311258, 0.005197879988321949, 0.13605106530503044, -0.1538274633174592, -0.07815634088146353, 0.4848850366900566, -0.072649716529617, -0.3206955261391394, 0.20127364797494018, -0.1501172321522372, -0.11713084736649836, 0.11710378308815948, 0.1764708554187818, 0.17615879540742957, -0.16102406276937464, 0.1294450243056851, -0.04098919384786623, 0.035369334216046426, 0.09810215490988367, -0.0107983969179157, 0.233634769980356, 0.0893490450092719, 0.02911454748579769, 0.10127561978716876, -0.007480940845355316, -0.1680404793540238, -0.4038265869305067, -0.18310368339162378, -0.11050917201871667, 0.09968179977513131, -0.12736339431901955, -0.15460220549898554, 0.3340803666777795, 0.11211530328809513, 0.08597633856476336, 0.040835333221620376, 0.24719542722562848, 0.08737568156730187, 0.0012038087089390017, 0.15678601977202644, 0.27262702762494384, 0.15583650706463545, 0.121319479323205, -0.20690640821821898, -0.07028758881860625, 0.16582358558071295] |
1,802.05287 | What is Gab? A Bastion of Free Speech or an Alt-Right Echo Chamber? | Over the past few years, a number of new "fringe" communities, like 4chan or
certain subreddits, have gained traction on the Web at a rapid pace. However,
more often than not, little is known about how they evolve or what kind of
activities they attract, despite recent research has shown that they influence
how false information reaches mainstream communities. This motivates the need
to monitor these communities and analyze their impact on the Web's information
ecosystem. In August 2016, a new social network called Gab was created as an
alternative to Twitter. It positions itself as putting "people and free speech
first'", welcoming users banned or suspended from other social networks. In
this paper, we provide, to the best of our knowledge, the first
characterization of Gab. We collect and analyze 22M posts produced by 336K
users between August 2016 and January 2018, finding that Gab is predominantly
used for the dissemination and discussion of news and world events, and that it
attracts alt-right users, conspiracy theorists, and other trolls. We also
measure the prevalence of hate speech on the platform, finding it to be much
higher than Twitter, but lower than 4chan's Politically Incorrect board.
| cs.SI cs.CY | over the past few years a number of new fringe communities like 4chan or certain subreddits have gained traction on the web at a rapid pace however more often than not little is known about how they evolve or what kind of activities they attract despite recent research has shown that they influence how false information reaches mainstream communities this motivates the need to monitor these communities and analyze their impact on the webs information ecosystem in august 2016 a new social network called gab was created as an alternative to twitter it positions itself as putting people and free speech first welcoming users banned or suspended from other social networks in this paper we provide to the best of our knowledge the first characterization of gab we collect and analyze 22m posts produced by 336k users between august 2016 and january 2018 finding that gab is predominantly used for the dissemination and discussion of news and world events and that it attracts altright users conspiracy theorists and other trolls we also measure the prevalence of hate speech on the platform finding it to be much higher than twitter but lower than 4chans politically incorrect board | [['over', 'the', 'past', 'few', 'years', 'a', 'number', 'of', 'new', 'fringe', 'communities', 'like', '4chan', 'or', 'certain', 'subreddits', 'have', 'gained', 'traction', 'on', 'the', 'web', 'at', 'a', 'rapid', 'pace', 'however', 'more', 'often', 'than', 'not', 'little', 'is', 'known', 'about', 'how', 'they', 'evolve', 'or', 'what', 'kind', 'of', 'activities', 'they', 'attract', 'despite', 'recent', 'research', 'has', 'shown', 'that', 'they', 'influence', 'how', 'false', 'information', 'reaches', 'mainstream', 'communities', 'this', 'motivates', 'the', 'need', 'to', 'monitor', 'these', 'communities', 'and', 'analyze', 'their', 'impact', 'on', 'the', 'webs', 'information', 'ecosystem', 'in', 'august', '2016', 'a', 'new', 'social', 'network', 'called', 'gab', 'was', 'created', 'as', 'an', 'alternative', 'to', 'twitter', 'it', 'positions', 'itself', 'as', 'putting', 'people', 'and', 'free', 'speech', 'first', 'welcoming', 'users', 'banned', 'or', 'suspended', 'from', 'other', 'social', 'networks', 'in', 'this', 'paper', 'we', 'provide', 'to', 'the', 'best', 'of', 'our', 'knowledge', 'the', 'first', 'characterization', 'of', 'gab', 'we', 'collect', 'and', 'analyze', '22m', 'posts', 'produced', 'by', '336k', 'users', 'between', 'august', '2016', 'and', 'january', '2018', 'finding', 'that', 'gab', 'is', 'predominantly', 'used', 'for', 'the', 'dissemination', 'and', 'discussion', 'of', 'news', 'and', 'world', 'events', 'and', 'that', 'it', 'attracts', 'altright', 'users', 'conspiracy', 'theorists', 'and', 'other', 'trolls', 'we', 'also', 'measure', 'the', 'prevalence', 'of', 'hate', 'speech', 'on', 'the', 'platform', 'finding', 'it', 'to', 'be', 'much', 'higher', 'than', 'twitter', 'but', 'lower', 'than', '4chans', 'politically', 'incorrect', 'board']] | [-0.08194324674968345, 0.1015357174153159, -0.08456348556583412, 0.09381732478833352, -0.1828354803666186, -0.14107514006355837, 0.07885546849336093, 0.4196962316639912, -0.2061613743742689, -0.3630728302935425, 0.11544767680864494, -0.3763866307452703, -0.2018608673905524, 0.19181024146218523, -0.10852145815495019, -0.04016833012111676, 0.08308971739159181, 0.09072791474456421, 0.024210921954960586, -0.344312650949145, 0.27622462992842955, 0.09798480285188327, 0.3188397138976516, 0.07549690022730292, 0.0550846052618745, -0.017508795105207423, -0.0884056200619596, -0.015716283556479867, -0.11805516721091967, 0.14187349133336774, 0.29826743808598855, 0.23436408134368367, 0.34652409981458615, -0.45125231040784947, -0.16954385084219467, 0.11689422379474705, 0.14056229907541704, 0.07283409008374199, -0.040823819880890184, -0.3674712749866721, 0.06093266626628928, -0.22172930258063553, -0.04581046769968592, -0.04754747766583489, 0.0715724301046859, -0.012160936187212475, -0.14796937194246895, 0.00782768940896345, 0.02753234289210433, 0.11167609518011794, 0.023152066509311016, -0.09227052637590812, -0.020964238149090073, 0.22390176557386532, 0.10835162209681211, 0.027518545230850577, 0.15677497858802478, -0.14758984492614102, -0.11484875633882788, 0.3599183844653173, -0.004017043548251073, -0.09278338330332189, 0.23582136374719154, -0.09967152008619637, -0.14132451051846145, 0.08681143202747289, 0.2528023843390819, 0.08102366397730433, -0.17490241560511866, -0.03473075269243847, -0.06009090059244325, 0.2103119226029286, 0.129376187060888, 0.01520984161328763, 0.2124895615921093, 0.16495428579644514, 0.08576020905151008, 0.048075184563491254, -0.02345578221050882, -0.07813492132446323, -0.16125431324665745, -0.13487692040910657, -0.1410127079532219, 0.05594016239054513, -0.02192709537025971, -0.13306698830699762, 0.3700959431914947, 0.18258354983841762, 0.1426846811332955, 0.01786720495766554, 0.24593708050461152, -0.007996640440960151, 0.09171548927178941, 0.10235382037667128, 0.21953910599008966, 0.006008851546077774, 0.2166142623244713, -0.07365771000398896, 0.12576646599978303, -0.02043836991278789] |
1,802.05288 | Preliminary test of cosmological models in the scale-dependent scenario | In the present work, we study for the first time a scale--dependent
gravitational theory in a cosmological context in a matter--dominated era. In
particular, starting from the Einstein Hilbert action with cosmological
constant assuming scale--dependent couplings, we derive the corresponding
effective Friedmann equations for the model and we solve them. We analyse in
detail our results by comparing them with observational $\Lambda$CDM data as
well as the very well-known running vacuum models. Finally, we have provided,
in figures, the evolution of the Hubble parameter respect to the redshift as
well as the gravitational coupling respect to the Hubble parameter and they
show an agreement with the current observations.
| gr-qc hep-th | in the present work we study for the first time a scaledependent gravitational theory in a cosmological context in a matterdominated era in particular starting from the einstein hilbert action with cosmological constant assuming scaledependent couplings we derive the corresponding effective friedmann equations for the model and we solve them we analyse in detail our results by comparing them with observational lambdacdm data as well as the very wellknown running vacuum models finally we have provided in figures the evolution of the hubble parameter respect to the redshift as well as the gravitational coupling respect to the hubble parameter and they show an agreement with the current observations | [['in', 'the', 'present', 'work', 'we', 'study', 'for', 'the', 'first', 'time', 'a', 'scaledependent', 'gravitational', 'theory', 'in', 'a', 'cosmological', 'context', 'in', 'a', 'matterdominated', 'era', 'in', 'particular', 'starting', 'from', 'the', 'einstein', 'hilbert', 'action', 'with', 'cosmological', 'constant', 'assuming', 'scaledependent', 'couplings', 'we', 'derive', 'the', 'corresponding', 'effective', 'friedmann', 'equations', 'for', 'the', 'model', 'and', 'we', 'solve', 'them', 'we', 'analyse', 'in', 'detail', 'our', 'results', 'by', 'comparing', 'them', 'with', 'observational', 'lambdacdm', 'data', 'as', 'well', 'as', 'the', 'very', 'wellknown', 'running', 'vacuum', 'models', 'finally', 'we', 'have', 'provided', 'in', 'figures', 'the', 'evolution', 'of', 'the', 'hubble', 'parameter', 'respect', 'to', 'the', 'redshift', 'as', 'well', 'as', 'the', 'gravitational', 'coupling', 'respect', 'to', 'the', 'hubble', 'parameter', 'and', 'they', 'show', 'an', 'agreement', 'with', 'the', 'current', 'observations']] | [-0.0920309351834779, 0.08018900102656011, -0.08942043891659489, 0.09470772488836061, -0.09428852442565754, -0.07504814274660829, -0.02905374202398687, 0.34812100016063563, -0.22259272639510325, -0.33445313227625945, 0.08775159548235091, -0.25836659633313064, -0.11992423756358524, 0.2055658872532486, -0.00039123649131161747, 0.048250645230938166, 0.03820076086817102, 0.021456641265777527, -0.07168674428450889, -0.27190398132532007, 0.36902573809493333, 0.11253011255973468, 0.18501102188397286, -0.032998081964992536, 0.10675501754977396, -0.07471587654651592, -0.08468920332207172, 0.06853973157962577, -0.23180943041936392, 0.02117694432295307, 0.21813192956853056, 0.10788957778950808, 0.2263718982037433, -0.39884270046389214, -0.2197435361298698, 0.09472476660394696, 0.14296725776512176, 0.1916827180991984, -0.06014672479876834, -0.31160454648650354, 0.0033480347375626916, -0.18796386745008123, -0.13669998934320002, -0.06820011155300394, -0.013059285426236413, -0.006538544647844025, -0.23963831337082578, 0.10982853320671927, -0.06077142044065382, -0.02976584426748256, -0.14073295310286252, -0.061449859612535136, 0.013422964058850927, 0.08341937262513158, 0.10876717442254259, 0.06102306222224056, 0.07057172940026417, -0.1797227784204383, -0.08771957350567121, 0.434699477351926, -0.19872979375024982, -0.1559883159681232, 0.13369833399903858, -0.15696827539122077, -0.1508506351598987, -0.004820565848300855, 0.13578856636390643, 0.0792683390641792, -0.1339450462643678, 0.16388381865086826, 0.01603956818063226, 0.1392338163935131, 0.05645369464979955, 0.022389307591664773, 0.22388456119396896, 0.13929162346714832, 0.0219827141306639, 0.10496271126774243, -0.06623756977421215, -0.09030251423569603, -0.36909502832956304, -0.12440960721061048, -0.1427166929287422, 0.05623706207714147, -0.18367802724215262, -0.14175097424002295, 0.38011689065024257, 0.1869623874986751, 0.2420885879934455, 0.12507904064841568, 0.29362195918198536, 0.09380608110977509, 0.03469322099300808, 0.0672465470119345, 0.33223310798078914, 0.10458017754825522, 0.12965237086259382, -0.2207153504347877, -0.0043950092556231, 0.02867422423204752] |
1,802.05289 | Rejuvenating the Contract of Academia With Society | Academia owes the public a fresh look at its education and research mission.
First and foremost, researchers must communicate the results of their latest
studies in a truthful and meaningful way. Second, the traditional boundaries
among disciplines should be blurred since innovation often blossoms along these
boundaries. Third, universities should develop courses which are relevant for
the skills required in the job market today. Finally, professors should mentor
the future leaders of science, technology, arts and humanities and not just
replicate themselves.
| physics.pop-ph astro-ph.IM | academia owes the public a fresh look at its education and research mission first and foremost researchers must communicate the results of their latest studies in a truthful and meaningful way second the traditional boundaries among disciplines should be blurred since innovation often blossoms along these boundaries third universities should develop courses which are relevant for the skills required in the job market today finally professors should mentor the future leaders of science technology arts and humanities and not just replicate themselves | [['academia', 'owes', 'the', 'public', 'a', 'fresh', 'look', 'at', 'its', 'education', 'and', 'research', 'mission', 'first', 'and', 'foremost', 'researchers', 'must', 'communicate', 'the', 'results', 'of', 'their', 'latest', 'studies', 'in', 'a', 'truthful', 'and', 'meaningful', 'way', 'second', 'the', 'traditional', 'boundaries', 'among', 'disciplines', 'should', 'be', 'blurred', 'since', 'innovation', 'often', 'blossoms', 'along', 'these', 'boundaries', 'third', 'universities', 'should', 'develop', 'courses', 'which', 'are', 'relevant', 'for', 'the', 'skills', 'required', 'in', 'the', 'job', 'market', 'today', 'finally', 'professors', 'should', 'mentor', 'the', 'future', 'leaders', 'of', 'science', 'technology', 'arts', 'and', 'humanities', 'and', 'not', 'just', 'replicate', 'themselves']] | [-0.03902777681189657, 0.1313525249006045, -0.10083154593764736, 0.11039213096245942, -0.23580502055403663, -0.18329724133946002, 0.07621117539294972, 0.4100987129708434, -0.24907295664817822, -0.34874383361283234, 0.11876999093191244, -0.3123158638524573, -0.1319044993724674, 0.18277864212669978, -0.1542715521368891, 0.012667938952601128, 0.07820054320277782, 0.04032327136359882, 0.027839590923111068, -0.36079572684063416, 0.23730853282017406, 0.08404059879618084, 0.3245838355505839, 0.05296311730791519, -0.0014166987455654435, -0.04817242277062089, -0.12208804030471095, -0.050339152985366016, -0.11232007902488965, 0.1729295511571009, 0.4377070668653199, 0.23757640434792493, 0.453933391038601, -0.4592134315157082, -0.13307389451571308, 0.04337269578855939, 0.1200464846134731, 0.052813746368728307, -0.013664395764197519, -0.3351902214401379, 0.015785439748447615, -0.19394507201206757, -0.10145951576229957, -0.06263891706334018, 0.011192888907361321, -0.0003155940780188979, -0.17082536702680334, -0.025442482699163077, 0.011587665268651596, 0.12483387585252342, -0.043753753908875787, -0.17204777865454826, -0.024550167605190014, 0.2842943420883541, 0.07582191335899463, 0.0024294856873272757, 0.1708454626240404, -0.18449948916904538, -0.16696355252231404, 0.4396703377729509, 0.07718113187073003, -0.08027071602324523, 0.19929858636417677, -0.1595611974665123, -0.19408512501068775, 0.006249120708827566, 0.24002907698883152, 0.024635928830631624, -0.19305420595948108, 0.02963213902321735, 0.034826746806729494, 0.12870966811187384, 0.0701242669133424, -0.016069389243678348, 0.29395964755602155, 0.12186973064956141, 0.0675225244698728, 0.02905473340353815, 0.04087052560161527, -0.13232967737925852, -0.24887431657123493, -0.19585515453945845, -0.13518986726043428, -0.04468213448499006, 0.0024126070835868963, -0.09462853251933688, 0.3542588856752689, 0.17008074125411307, 0.031337749474204896, 0.011612643335843685, 0.3232816498408594, -0.030819677072009298, 0.09532340774142252, 0.10639449257244606, 0.2262367826670681, -0.010091199698608095, 0.2732105809604613, -0.0578836025702114, 0.14940377875094915, -0.059427582037708974] |
1,802.0529 | Spacetime orientation and the meaning of Lorentz invariance in general
relativity | The parity violation at the level of weak interactions and other similar
discrete symmetries breaking show that the invariance of laws under the full
group of Lorentz transformations can not be taken granted. We examine the
principle of Lorentz invariance under the general theory of relativity, and
demonstrate the importance of a concept of the spacetime orientation as part of
the causal structure of spacetime.
| gr-qc | the parity violation at the level of weak interactions and other similar discrete symmetries breaking show that the invariance of laws under the full group of lorentz transformations can not be taken granted we examine the principle of lorentz invariance under the general theory of relativity and demonstrate the importance of a concept of the spacetime orientation as part of the causal structure of spacetime | [['the', 'parity', 'violation', 'at', 'the', 'level', 'of', 'weak', 'interactions', 'and', 'other', 'similar', 'discrete', 'symmetries', 'breaking', 'show', 'that', 'the', 'invariance', 'of', 'laws', 'under', 'the', 'full', 'group', 'of', 'lorentz', 'transformations', 'can', 'not', 'be', 'taken', 'granted', 'we', 'examine', 'the', 'principle', 'of', 'lorentz', 'invariance', 'under', 'the', 'general', 'theory', 'of', 'relativity', 'and', 'demonstrate', 'the', 'importance', 'of', 'a', 'concept', 'of', 'the', 'spacetime', 'orientation', 'as', 'part', 'of', 'the', 'causal', 'structure', 'of', 'spacetime']] | [-0.17844041648249215, 0.14424511730097808, -0.11673522512876214, 0.10800949486975486, -0.08599224445911555, -0.0840847230158173, 0.012618281926888113, 0.30305239674993434, -0.29086721112521796, -0.27912514769257263, 0.06966394755559471, -0.17613958515799963, -0.13210258054045532, 0.10191473770313537, -0.01854793680115388, 0.03438279714005498, -0.02949870667205407, 0.06646770397201181, -0.13364206760620267, -0.20161127719956523, 0.34632302406602183, 0.0839076861882439, 0.35855139586358115, 0.034794118762231215, 0.14576200977540932, 0.046942275339880817, -0.026821902824135928, 0.07475736661312672, -0.05133695172989974, 0.07561702782718036, 0.14560124726536183, 0.1174168190990503, 0.2182845062110573, -0.45035481452941895, -0.21986847530978804, 0.0666196808218956, 0.0198942274804442, 0.1382254296913743, -0.03749397773868762, -0.3817228692440459, 0.06162785066005129, -0.1337802567304327, -0.19720825985647164, -0.08941600067863384, -0.01494097147996609, -0.05608235738025262, -0.2146132902501939, 0.11440705778793647, 0.11949891511064309, 0.09349428069992707, -0.04841175462620763, -0.011598042867934475, -0.0575482370546804, 0.1399140451891491, 0.14426376811013772, -0.05394696098743365, 0.11936761876568198, -0.11873426268307062, -0.13364852271042765, 0.5215675767797691, -0.024393227538810326, -0.23415045170829846, 0.1517580428805489, -0.21178992235889801, -0.2103887457973682, 0.07016485033270259, 0.16307154283500636, 0.09741115706901138, -0.12682679924630344, 0.17578160702429999, -0.06788787224258368, 0.12852870787565523, 0.06734380250653395, 0.09336289008810686, 0.1789354828114693, 0.04659276269376278, 0.07458519810953966, 0.08943931683808422, -0.03812357878061728, -0.08689271726000768, -0.4623273096118982, -0.16157558336137579, -0.1465035610044232, 0.09345147546689707, -0.12562925747479312, -0.07449024201442415, 0.3759208327302566, 0.10779642936272117, 0.10396637101299487, 0.050158101184150344, 0.19636570277552193, 0.10587208210669745, 0.11454063808688751, 0.01405222976150421, 0.30314549323028095, 0.14111093603647673, 0.046442389292105174, -0.28049454647474564, 0.029345120310496825, 0.0837798130340301] |
1,802.05291 | Robust dynamics, invariant structures and topological classification | This text is about geometric structures imposed by robust dynamical
behaviour. We explain recent results towards the classification of partially
hyperbolic systems in dimension 3 using the theory of foliations and its
interaction with topology. We also present recent examples which introduce a
challenge in the classification program and we propose some steps to continue
this classification. Finally, we give some suggestions on what to do after
classification is achieved.
| math.DS math.GT | this text is about geometric structures imposed by robust dynamical behaviour we explain recent results towards the classification of partially hyperbolic systems in dimension 3 using the theory of foliations and its interaction with topology we also present recent examples which introduce a challenge in the classification program and we propose some steps to continue this classification finally we give some suggestions on what to do after classification is achieved | [['this', 'text', 'is', 'about', 'geometric', 'structures', 'imposed', 'by', 'robust', 'dynamical', 'behaviour', 'we', 'explain', 'recent', 'results', 'towards', 'the', 'classification', 'of', 'partially', 'hyperbolic', 'systems', 'in', 'dimension', '3', 'using', 'the', 'theory', 'of', 'foliations', 'and', 'its', 'interaction', 'with', 'topology', 'we', 'also', 'present', 'recent', 'examples', 'which', 'introduce', 'a', 'challenge', 'in', 'the', 'classification', 'program', 'and', 'we', 'propose', 'some', 'steps', 'to', 'continue', 'this', 'classification', 'finally', 'we', 'give', 'some', 'suggestions', 'on', 'what', 'to', 'do', 'after', 'classification', 'is', 'achieved']] | [-0.12795846748964063, 0.052455143317846314, -0.09515756315418653, 0.055734313199562686, -0.09024518908533667, -0.11763511130619528, 0.045174728947625094, 0.42116244597626584, -0.2624963955155441, -0.30322072154709273, 0.15709557949365782, -0.24997091431702886, -0.23750857585608692, 0.1760067271351415, -0.16336991589625022, 0.04742592748370953, 0.08156533118869577, 0.051854138315788334, -0.09609498881202723, -0.3230990550979706, 0.3793326192735029, 0.02588429907336831, 0.2289015509487529, 0.08640304908455748, 0.0647042239350932, -0.0100827119412965, -0.04845342224996005, 0.027513651609686867, -0.17342340031505696, 0.1737585111487923, 0.25384028149253157, 0.1403171111829579, 0.2549845524897267, -0.41274572696004597, -0.22004386828547076, 0.08097475958721978, 0.13130048954460238, 0.15441033083978775, -0.08766232357260638, -0.3110193433605933, 0.10755496089779107, -0.13902488946914673, -0.1279720580438152, -0.14814465067216329, 0.012595433382583517, -0.0372922679808523, -0.16279311114423242, 0.04682042907017084, 0.14624742480186148, 0.09870722459995054, -0.05511705924124856, -0.06949711403077734, 0.05959599276206323, 0.10996149885301877, 0.046330283788431965, 0.031170066871813364, 0.06250041217011, -0.14353564764106913, -0.1684255400739078, 0.352588221770046, -0.013957801337320623, -0.2097103852512581, 0.2363838043130402, -0.11452055563484984, -0.22137791010152016, 0.059935237560421226, 0.19787492899756345, 0.10243924492970109, -0.11129937246109226, 0.039609971115299104, -0.03715811065797295, 0.1486088348951723, 0.00864270960113832, -0.01759146475898368, 0.17618792022445373, 0.21993886482502734, 0.051847710836279606, 0.1501995562742065, -0.05624749113339931, -0.03289609857435737, -0.29930780587185707, -0.12090102438149708, -0.08011648763702917, 0.08475921456702054, -0.02953667909397544, -0.11539531692064234, 0.42082694682425686, 0.1988560842084033, 0.25857558378151485, 0.0951872115106588, 0.2808412390960647, 0.05445258734897444, 0.026099997113591858, 0.05681727983922299, 0.21361713485675865, 0.0963321516855753, 0.10843583196401596, -0.13433570006662712, 0.018362203310243786, 0.09814942512395126] |
1,802.05292 | Loss-based approach to two-piece location-scale distributions with
applications to dependent data | Two-piece location-scale models are used for modeling data presenting
departures from symmetry. In this paper, we propose an objective Bayesian
methodology for the tail parameter of two particular distributions of the above
family: the skewed exponential power distribution and the skewed generalised
logistic distribution. We apply the proposed objective approach to time series
models and linear regression models where the error terms follow the
distributions object of study. The performance of the proposed approach is
illustrated through simulation experiments and real data analysis. The
methodology yields improvements in density forecasts, as shown by the analysis
we carry out on the electricity prices in Nordpool markets.
| stat.ME stat.OT | twopiece locationscale models are used for modeling data presenting departures from symmetry in this paper we propose an objective bayesian methodology for the tail parameter of two particular distributions of the above family the skewed exponential power distribution and the skewed generalised logistic distribution we apply the proposed objective approach to time series models and linear regression models where the error terms follow the distributions object of study the performance of the proposed approach is illustrated through simulation experiments and real data analysis the methodology yields improvements in density forecasts as shown by the analysis we carry out on the electricity prices in nordpool markets | [['twopiece', 'locationscale', 'models', 'are', 'used', 'for', 'modeling', 'data', 'presenting', 'departures', 'from', 'symmetry', 'in', 'this', 'paper', 'we', 'propose', 'an', 'objective', 'bayesian', 'methodology', 'for', 'the', 'tail', 'parameter', 'of', 'two', 'particular', 'distributions', 'of', 'the', 'above', 'family', 'the', 'skewed', 'exponential', 'power', 'distribution', 'and', 'the', 'skewed', 'generalised', 'logistic', 'distribution', 'we', 'apply', 'the', 'proposed', 'objective', 'approach', 'to', 'time', 'series', 'models', 'and', 'linear', 'regression', 'models', 'where', 'the', 'error', 'terms', 'follow', 'the', 'distributions', 'object', 'of', 'study', 'the', 'performance', 'of', 'the', 'proposed', 'approach', 'is', 'illustrated', 'through', 'simulation', 'experiments', 'and', 'real', 'data', 'analysis', 'the', 'methodology', 'yields', 'improvements', 'in', 'density', 'forecasts', 'as', 'shown', 'by', 'the', 'analysis', 'we', 'carry', 'out', 'on', 'the', 'electricity', 'prices', 'in', 'nordpool', 'markets']] | [-0.03808898780642686, -0.024276877828294977, -0.14692861957099432, 0.11489360380241684, -0.03372780265411935, -0.11395755571384843, 0.04945764953131752, 0.4003637549467385, -0.24526113430217195, -0.30104057733954576, 0.10019454621159149, -0.2925434651193567, -0.16401328907634777, 0.20785823403499448, -0.06703318069832256, 0.13082345071821833, 0.05824339257266659, -0.037336605856230914, -0.04813455939382458, -0.26836799178272486, 0.3202331550867082, 0.10082727446793936, 0.35807152047681695, -0.02652940133926817, 0.08471888310920733, -0.014310309144023519, -0.08574712615406427, -0.007721078026896486, -0.12956237630882803, 0.1461998728862874, 0.24407644531615566, 0.17195493320021063, 0.29612490641347206, -0.37842274209162075, -0.23412964625570637, 0.12461927332557164, 0.10883229324826971, 0.03420615116080556, -0.03992714212262609, -0.2655224608830534, 0.009017345616414856, -0.22609313849646312, -0.11334489286841395, -0.13726328969082366, -0.04502481161258542, 0.05837370723691912, -0.323984712026476, 0.12254409942733428, 0.073227871025805, 0.058885490729992926, -0.054878361124652796, -0.15305908233858645, -0.0017225300275290816, 0.07526194512879905, 0.11602924415582003, -0.0648572641366627, 0.09826954084452993, -0.10103283823208095, -0.12156597235634063, 0.35018486252374714, -0.10213740265820749, -0.22945865170242122, 0.10701438701541449, -0.11865884308756974, -0.1587258289644244, 0.0785748275140157, 0.26190861721093267, 0.11038482147985353, -0.159930191857991, 0.05980471870694041, -0.042168757212213956, 0.1295815686507222, -0.000761971341069931, -0.0892259503598325, 0.18328915180217548, 0.18739365626690693, 0.041094981286173254, 0.16877471202930722, -0.1397641663475392, -0.16415267926640809, -0.30348831987402475, -0.09428277746953356, -0.18935209535993636, -0.03226515815297786, -0.11938011243028786, -0.15154474572577434, 0.43217800521793276, 0.20719457556977153, 0.20921575826986766, 0.14143305142128015, 0.302272121135432, 0.1407781789569596, 0.00068476209596086, 0.06880855062312409, 0.15141540273235968, 0.07409032489970112, 0.10089129132057469, -0.1683485579806774, 0.11897172935781643, -0.00571126280612169] |
1,802.05293 | Symmetry-protected coherent relaxation of open quantum systems | We compute the effect of Markovian bulk dephasing noise on the staggered
magnetization of the spin-1/2 XXZ Heisenberg chain, as the system evolves after
a N\'eel quench. For sufficiently weak system-bath coupling, the unitary
dynamics are found to be preserved up to a single exponential damping factor.
This is a consequence of the interplay between $\mathbb{PT}$ symmetry and weak
symmetries, which strengthens previous predictions for $\mathbb{PT}$-symmetric
Liouvillian dynamics. Requirements are a non-degenerate $\mathbb{PT}$-symmetric
generator of time evolution $\hat{\mathcal{L}}$, a weak parity symmetry and an
observable that is anti-symmetric under this parity transformation. The
spectrum of $\hat{\mathcal{L}}$ then splits up into symmetry sectors, yielding
the same decay rate for all modes that contribute to the observable's time
evolution. This phenomenon may be realized in trapped ion experiments and has
possible implications for the control of decoherence in out-of-equilibrium
many-body systems.
| quant-ph cond-mat.stat-mech | we compute the effect of markovian bulk dephasing noise on the staggered magnetization of the spin12 xxz heisenberg chain as the system evolves after a neel quench for sufficiently weak systembath coupling the unitary dynamics are found to be preserved up to a single exponential damping factor this is a consequence of the interplay between mathbbpt symmetry and weak symmetries which strengthens previous predictions for mathbbptsymmetric liouvillian dynamics requirements are a nondegenerate mathbbptsymmetric generator of time evolution hatmathcall a weak parity symmetry and an observable that is antisymmetric under this parity transformation the spectrum of hatmathcall then splits up into symmetry sectors yielding the same decay rate for all modes that contribute to the observables time evolution this phenomenon may be realized in trapped ion experiments and has possible implications for the control of decoherence in outofequilibrium manybody systems | [['we', 'compute', 'the', 'effect', 'of', 'markovian', 'bulk', 'dephasing', 'noise', 'on', 'the', 'staggered', 'magnetization', 'of', 'the', 'spin12', 'xxz', 'heisenberg', 'chain', 'as', 'the', 'system', 'evolves', 'after', 'a', 'neel', 'quench', 'for', 'sufficiently', 'weak', 'systembath', 'coupling', 'the', 'unitary', 'dynamics', 'are', 'found', 'to', 'be', 'preserved', 'up', 'to', 'a', 'single', 'exponential', 'damping', 'factor', 'this', 'is', 'a', 'consequence', 'of', 'the', 'interplay', 'between', 'mathbbpt', 'symmetry', 'and', 'weak', 'symmetries', 'which', 'strengthens', 'previous', 'predictions', 'for', 'mathbbptsymmetric', 'liouvillian', 'dynamics', 'requirements', 'are', 'a', 'nondegenerate', 'mathbbptsymmetric', 'generator', 'of', 'time', 'evolution', 'hatmathcall', 'a', 'weak', 'parity', 'symmetry', 'and', 'an', 'observable', 'that', 'is', 'antisymmetric', 'under', 'this', 'parity', 'transformation', 'the', 'spectrum', 'of', 'hatmathcall', 'then', 'splits', 'up', 'into', 'symmetry', 'sectors', 'yielding', 'the', 'same', 'decay', 'rate', 'for', 'all', 'modes', 'that', 'contribute', 'to', 'the', 'observables', 'time', 'evolution', 'this', 'phenomenon', 'may', 'be', 'realized', 'in', 'trapped', 'ion', 'experiments', 'and', 'has', 'possible', 'implications', 'for', 'the', 'control', 'of', 'decoherence', 'in', 'outofequilibrium', 'manybody', 'systems']] | [-0.2076262068547254, 0.2462346377574548, -0.08002135494424806, 0.06589183840394211, -0.02979161628746312, -0.16684129983730558, 0.006557844727075774, 0.3501992739845801, -0.29911525144724405, -0.2252129316856799, 0.061320380162002426, -0.2467560870131056, -0.05607479488830606, 0.1560780184180306, 0.06724448464589915, 0.035381464532365764, 0.04602042004384481, 0.025664913085676783, -0.11097383009053997, -0.2260738294843557, 0.2920418559492015, 0.05185724486512758, 0.290691759066833, 0.056498098004877866, 0.07955554500732054, 0.0015361330397155163, 0.0958855615684042, -0.04037611759467438, -0.10382682048721174, 0.0009926757375866065, 0.19896517542061687, 0.013710932904704862, 0.19330569098356867, -0.4249342524983587, -0.18658823707059408, 0.09674075045401952, 0.1441230891462769, 0.18095242584474303, -0.03039434812640105, -0.3253035444195253, 0.015149969953438607, -0.17876521741332363, -0.15913617598015245, -0.11366698151984572, 0.030422120185120263, -0.05291075412401535, -0.2945054652990202, 0.1326027783246515, 0.12135239407406563, 0.05815835125458828, -0.03480040909804023, -0.025536166027317463, -0.057114804435494174, 0.1323555396002187, 0.08035057751431272, 0.0031869683132581686, 0.13587079500612959, -0.10177194569973669, -0.1370068049928459, 0.3717521224170923, -0.10112622383485691, -0.16859930343142063, 0.15706802880133156, -0.14302851137514805, -0.15290087116984175, 0.1250616387739424, 0.1228434923070952, 0.06768820223731607, -0.15257150484045057, 0.13029769901058766, -0.00981268554545232, 0.167623084014411, 0.03023158275372736, 0.09007963488544643, 0.20679606122889277, 0.14825327543501002, 0.08910203795458604, 0.16131915937292127, -0.0173399905686056, -0.14849311164044945, -0.31152084633626426, -0.12529099492668888, -0.17834920436908647, 0.1323922846473101, -0.060328355716413096, -0.12196619406233739, 0.41764259846867435, 0.11361784993541534, 0.18316194216591597, 0.030893926195168092, 0.2192258972123972, 0.15713380787599776, 0.055033335135909765, 0.041305539627501275, 0.24255611895019338, 0.16882605841859197, 0.05395828802427481, -0.3421784226415529, 0.03700447551069958, 0.04003798132116505] |
1,802.05294 | Dynamic Fair Division Problem with General Valuations | In this paper, we focus on how to dynamically allocate a divisible resource
fairly among n players who arrive and depart over time. The players may have
general heterogeneous valuations over the resource. It is known that the exact
envy-free and proportional allocations may not exist in the dynamic setting
[Walsh, 2011]. Thus, we will study to what extent we can guarantee the fairness
in the dynamic setting. We first design two algorithms which are O(log
n)-proportional and O(n)-envy-free for the setting with general valuations, and
by constructing the adversary instances such that all dynamic algorithms must
be at least Omega(1)-proportional and Omega(n/log n)-envy-free, we show that
the bounds are tight up to a logarithmic factor. Moreover, we introduce the
setting where the players' valuations are uniform on the resource but with
different demands, which generalize the setting of [Friedman et al., 2015]. We
prove an O(log n) upper bound and a tight lower bound for this case.
| cs.GT | in this paper we focus on how to dynamically allocate a divisible resource fairly among n players who arrive and depart over time the players may have general heterogeneous valuations over the resource it is known that the exact envyfree and proportional allocations may not exist in the dynamic setting walsh 2011 thus we will study to what extent we can guarantee the fairness in the dynamic setting we first design two algorithms which are olog nproportional and onenvyfree for the setting with general valuations and by constructing the adversary instances such that all dynamic algorithms must be at least omega1proportional and omeganlog nenvyfree we show that the bounds are tight up to a logarithmic factor moreover we introduce the setting where the players valuations are uniform on the resource but with different demands which generalize the setting of friedman et al 2015 we prove an olog n upper bound and a tight lower bound for this case | [['in', 'this', 'paper', 'we', 'focus', 'on', 'how', 'to', 'dynamically', 'allocate', 'a', 'divisible', 'resource', 'fairly', 'among', 'n', 'players', 'who', 'arrive', 'and', 'depart', 'over', 'time', 'the', 'players', 'may', 'have', 'general', 'heterogeneous', 'valuations', 'over', 'the', 'resource', 'it', 'is', 'known', 'that', 'the', 'exact', 'envyfree', 'and', 'proportional', 'allocations', 'may', 'not', 'exist', 'in', 'the', 'dynamic', 'setting', 'walsh', '2011', 'thus', 'we', 'will', 'study', 'to', 'what', 'extent', 'we', 'can', 'guarantee', 'the', 'fairness', 'in', 'the', 'dynamic', 'setting', 'we', 'first', 'design', 'two', 'algorithms', 'which', 'are', 'olog', 'nproportional', 'and', 'onenvyfree', 'for', 'the', 'setting', 'with', 'general', 'valuations', 'and', 'by', 'constructing', 'the', 'adversary', 'instances', 'such', 'that', 'all', 'dynamic', 'algorithms', 'must', 'be', 'at', 'least', 'omega1proportional', 'and', 'omeganlog', 'nenvyfree', 'we', 'show', 'that', 'the', 'bounds', 'are', 'tight', 'up', 'to', 'a', 'logarithmic', 'factor', 'moreover', 'we', 'introduce', 'the', 'setting', 'where', 'the', 'players', 'valuations', 'are', 'uniform', 'on', 'the', 'resource', 'but', 'with', 'different', 'demands', 'which', 'generalize', 'the', 'setting', 'of', 'friedman', 'et', 'al', '2015', 'we', 'prove', 'an', 'olog', 'n', 'upper', 'bound', 'and', 'a', 'tight', 'lower', 'bound', 'for', 'this', 'case']] | [-0.13981006082068742, 0.0979041821473957, -0.08418616807305968, 0.07407746855214892, -0.0909254178283857, -0.19233411646677884, 0.12474141792751782, 0.3988401166090814, -0.24965519902550362, -0.34222809661500303, 0.08441229787271155, -0.23413782398663946, -0.15537919489328156, 0.15659827119580094, -0.14601597924680484, 0.025239066426436623, 0.0008686444141551272, 0.026537743409152156, 0.016813612475011546, -0.3934905337723117, 0.3053669837097843, 0.06952534163636821, 0.24421669704863777, 0.043382557183080775, 0.04132106513776756, 0.006576115315475398, -0.002594057364727963, 0.03818097544868791, -0.1757274367778041, 0.11193970413031903, 0.30059407386541753, 0.15788954714549003, 0.32404283621021873, -0.4231903882358562, -0.12766278581911103, 0.19053799079129374, 0.11489564612169158, 0.08894649938402044, 0.01313625581187571, -0.2160786188392017, 0.10018323660811543, -0.15798002999584349, -0.048503188191090604, -0.08349140734689964, 0.019098550882553317, 0.00902218692603388, -0.33977414306870046, -0.009229798136012895, 0.08953576083234571, -0.030804884996659777, -0.08101400559731796, -0.11617538224536829, 0.06601410531801741, 0.13730340607331268, 0.012518749480111549, 0.011197482382382763, 0.06422237234716244, -0.08277568102862637, -0.1747743297344098, 0.3561820458536121, -0.023971818844098356, -0.18780292181128805, 0.17457068193093087, -0.1311166827950941, -0.18186758477059375, 0.06188072625233175, 0.21300724908020105, 0.14266269033405832, -0.12481467638654421, 0.11360086465720087, -0.16661116902795076, 0.1572726051226355, 0.12094301340478629, 0.08331431527758114, 0.09249438433424122, 0.09142743411486025, 0.16693646596992606, 0.13849893077080103, 0.031472555905967564, -0.13498251308882064, -0.27431997872114955, -0.12011002811503842, -0.17328672142708432, 0.04855916525893799, -0.1047652126586612, -0.0952582878367552, 0.3315197177557879, 0.1271480811539094, 0.18385599933975896, 0.17810783641801786, 0.2896726625584453, 0.10908497432730609, 0.006019374488719872, 0.23316195485932004, 0.2003198707560924, 0.006647560858869223, 0.06701046553011016, -0.14027337786740043, 0.11684421286029989, 0.04675293757879574] |
1,802.05295 | Some remarks on Schr{\"o}dinger operators | The problem we consider is given a mixed model $F(\gamma) \rightarrow \gamma
\rightarrow \tilde{\gamma}$ and a potential $\widehat{V}$ such that $\log
\widehat{V} \in L^{1}$, to determine a movement $U$ such that $F(U
\gamma)=F(\gamma) + \widehat{V}$.
| math.AP | the problem we consider is given a mixed model fgamma rightarrow gamma rightarrow tildegamma and a potential widehatv such that log widehatv in l1 to determine a movement u such that fu gammafgamma widehatv | [['the', 'problem', 'we', 'consider', 'is', 'given', 'a', 'mixed', 'model', 'fgamma', 'rightarrow', 'gamma', 'rightarrow', 'tildegamma', 'and', 'a', 'potential', 'widehatv', 'such', 'that', 'log', 'widehatv', 'in', 'l1', 'to', 'determine', 'a', 'movement', 'u', 'such', 'that', 'fu', 'gammafgamma', 'widehatv']] | [-0.11978052471849052, 0.08010355874218723, -0.006956681214047201, 0.09208048344236996, -0.044888157566839997, -0.15411034069786017, 0.07599127237600359, 0.3612565222111615, -0.34767815405785135, -0.18395577213077835, 0.07718063614006634, -0.35460417627385166, -0.12153382497754964, 0.13972471687575858, -0.06560255045240576, 0.02626545631298513, 0.03570347544596051, 0.06642587014445753, -0.008398107295347885, -0.10820140142812196, 0.24765330448633793, -0.09699714522470128, 0.09508065961893987, 0.03793593750081279, 0.06162827272871227, 0.013028106606339641, 0.05686249740591103, -0.03288810683245009, -0.22497483163191867, -0.02976678069469265, 0.2263778726372755, 0.16213757268181353, 0.25463400250582985, -0.295560897469069, -0.19766516128385608, 0.2712706539102576, 0.10314117360747221, -0.06314514517417234, 0.0020577833903106775, -0.2675147687621189, 0.13445515341520536, -0.14702220227230678, -0.10602326413870534, 0.01162813895974647, 0.13876766937248636, 0.009870323578290867, -0.3974266014993191, 0.02616439660954656, 0.05162871534279971, -0.02284495524046096, -0.07455632152656715, -0.1435471521690488, -0.03942324937970349, 0.05221177605121876, 0.01785867331041531, 0.23652539304880935, 0.011118197827741053, -0.10879694687371905, -0.052675231656228956, 0.40237002368226193, -0.1480507833713835, -0.1964144239371473, 0.15387513254289376, -0.11215037531501641, -0.1888930803080174, 0.06642327488710482, 0.15020417543410353, 0.15381776722091617, -0.07708742861833537, 0.22704707830967946, -0.0692833958927429, 0.1734934574218862, 0.06523859040868102, -0.0346016450079553, 0.04461489369471868, 0.15530818187151896, 0.1004165358079428, 0.0770815329231096, -0.10308190627080022, 0.05528350332469651, -0.3816484892458627, -0.17924599970380464, -0.1524292520727172, 0.1649710516671114, -0.033991535066778655, -0.15160992188435612, 0.28320502817179216, 0.020196836215980125, 0.2767083372807864, 0.049979033125000016, 0.19584731359712101, 0.15910869701342148, -0.04365416277538647, 0.08742942292751237, 0.11588377237432834, 0.05613420294089751, 0.024444731065269672, -0.2832706999457018, 0.018371689189789875, 0.10497957849028436] |
1,802.05296 | Stronger generalization bounds for deep nets via a compression approach | Deep nets generalize well despite having more parameters than the number of
training samples. Recent works try to give an explanation using PAC-Bayes and
Margin-based analyses, but do not as yet result in sample complexity bounds
better than naive parameter counting. The current paper shows generalization
bounds that're orders of magnitude better in practice. These rely upon new
succinct reparametrizations of the trained net --- a compression that is
explicit and efficient. These yield generalization bounds via a simple
compression-based framework introduced here. Our results also provide some
theoretical justification for widespread empirical success in compressing deep
nets. Analysis of correctness of our compression relies upon some newly
identified \textquotedblleft noise stability\textquotedblright properties of
trained deep nets, which are also experimentally verified. The study of these
properties and resulting generalization bounds are also extended to
convolutional nets, which had eluded earlier attempts on proving
generalization.
| cs.LG | deep nets generalize well despite having more parameters than the number of training samples recent works try to give an explanation using pacbayes and marginbased analyses but do not as yet result in sample complexity bounds better than naive parameter counting the current paper shows generalization bounds thatre orders of magnitude better in practice these rely upon new succinct reparametrizations of the trained net a compression that is explicit and efficient these yield generalization bounds via a simple compressionbased framework introduced here our results also provide some theoretical justification for widespread empirical success in compressing deep nets analysis of correctness of our compression relies upon some newly identified textquotedblleft noise stabilitytextquotedblright properties of trained deep nets which are also experimentally verified the study of these properties and resulting generalization bounds are also extended to convolutional nets which had eluded earlier attempts on proving generalization | [['deep', 'nets', 'generalize', 'well', 'despite', 'having', 'more', 'parameters', 'than', 'the', 'number', 'of', 'training', 'samples', 'recent', 'works', 'try', 'to', 'give', 'an', 'explanation', 'using', 'pacbayes', 'and', 'marginbased', 'analyses', 'but', 'do', 'not', 'as', 'yet', 'result', 'in', 'sample', 'complexity', 'bounds', 'better', 'than', 'naive', 'parameter', 'counting', 'the', 'current', 'paper', 'shows', 'generalization', 'bounds', 'thatre', 'orders', 'of', 'magnitude', 'better', 'in', 'practice', 'these', 'rely', 'upon', 'new', 'succinct', 'reparametrizations', 'of', 'the', 'trained', 'net', 'a', 'compression', 'that', 'is', 'explicit', 'and', 'efficient', 'these', 'yield', 'generalization', 'bounds', 'via', 'a', 'simple', 'compressionbased', 'framework', 'introduced', 'here', 'our', 'results', 'also', 'provide', 'some', 'theoretical', 'justification', 'for', 'widespread', 'empirical', 'success', 'in', 'compressing', 'deep', 'nets', 'analysis', 'of', 'correctness', 'of', 'our', 'compression', 'relies', 'upon', 'some', 'newly', 'identified', 'textquotedblleft', 'noise', 'stabilitytextquotedblright', 'properties', 'of', 'trained', 'deep', 'nets', 'which', 'are', 'also', 'experimentally', 'verified', 'the', 'study', 'of', 'these', 'properties', 'and', 'resulting', 'generalization', 'bounds', 'are', 'also', 'extended', 'to', 'convolutional', 'nets', 'which', 'had', 'eluded', 'earlier', 'attempts', 'on', 'proving', 'generalization']] | [-0.023244266454819064, 0.026790682555272238, -0.09616595084293628, 0.11536460233160334, -0.14934525368931953, -0.14055505312297126, 0.09541854307688379, 0.39664362691028016, -0.20043021503468633, -0.34228098917831207, 0.08714832521689742, -0.2311976527185245, -0.20219354268202794, 0.2611289322187691, -0.13762266416115765, 0.09617725585121661, 0.08667584211060542, 0.014956757805226567, -0.09284337747901102, -0.3342425005418629, 0.25268424102301956, 0.08707039370828695, 0.3345045738519025, 0.05104182977852425, 0.056584261613570046, -0.030344912677373683, -0.06087033154974154, 0.01925803423190201, -0.15172107853709668, 0.16360760957632267, 0.24711317614763711, 0.17366063451840424, 0.266209973638851, -0.4508800561091281, -0.2387135735955614, 0.11678137182599117, 0.17889070616129943, 0.12799589210485016, -0.054812135633665736, -0.27863321303140737, 0.08951767812594509, -0.16220129282594148, -0.060965500755602836, -0.1924905698930084, -0.030543436024101898, 0.020055975312445785, -0.23308301980043172, 0.04596233029926071, 0.17986251861201336, 0.08670873015431989, -0.016843188070351074, -0.19062969124913676, 0.058891741681883346, 0.04902035585591491, 0.04094518175919239, 0.0297832571500486, 0.07204996940063339, -0.13703275225322012, -0.16823441686082474, 0.27979818677765805, -0.042740038338463265, -0.18707395522383002, 0.21851850515493834, -0.035736032028708765, -0.1726708901245934, 0.10186435186802606, 0.16820077529229538, 0.12099131086552647, -0.15177093564965566, 0.026312279185808172, -0.09258763646234719, 0.1576761762073762, 0.07725724804831642, 0.08024073468068693, 0.12886609195593848, 0.20889263721117357, 0.04115263963754381, 0.1474874462410939, -0.030770426555405517, -0.11135922278225108, -0.2632502718454778, -0.09424305469999548, -0.1727959321283827, 0.01743789403676793, -0.0991729526698768, -0.15807855889384806, 0.3552049165567003, 0.21501263117411135, 0.23112241254830865, 0.1802760573566406, 0.323328323936103, 0.07992926266939629, 0.11136668471580136, 0.08677155444805155, 0.27381732174675766, 0.12566873387918925, 0.05731877666557024, -0.09808186861738877, 0.13787040103007187, 0.11027203177833195] |
1,802.05297 | Totally real theta characteristics | A totally real theta characteristic of a real curve is a theta characteristic
which is linearly equivalent to a sum of only real points. These are closely
related to the facets of the convex hull of the canonical embedding of the
curve.
| math.AG | a totally real theta characteristic of a real curve is a theta characteristic which is linearly equivalent to a sum of only real points these are closely related to the facets of the convex hull of the canonical embedding of the curve | [['a', 'totally', 'real', 'theta', 'characteristic', 'of', 'a', 'real', 'curve', 'is', 'a', 'theta', 'characteristic', 'which', 'is', 'linearly', 'equivalent', 'to', 'a', 'sum', 'of', 'only', 'real', 'points', 'these', 'are', 'closely', 'related', 'to', 'the', 'facets', 'of', 'the', 'convex', 'hull', 'of', 'the', 'canonical', 'embedding', 'of', 'the', 'curve']] | [-0.19111642254782574, 0.08804701938338223, -0.1346432798278069, 0.03541211822136704, -0.09907813275986839, -0.1236899839935913, 0.0022712628955819775, 0.3246168762977634, -0.36210971733643893, -0.16392705463139073, 0.11252487193615664, -0.2935711186201799, -0.21292567151110797, 0.2481707315891981, -0.09805147941889507, 0.029586023673237788, -0.009430665855429001, 0.12841249124280044, -0.11386487701730359, -0.33434548503941014, 0.3816254135398638, -0.07599391480020824, 0.22009602623681226, 0.02886572466897113, 0.12784351373002642, -0.01374214869879541, 0.029801626445814258, 0.06398570364607233, -0.0651108959601039, 0.17049653437875567, 0.23545880101266362, 0.15444334251584396, 0.16165816005585448, -0.2858220905375977, -0.1413911370383132, 0.19065969743366754, 0.08207925106398761, -0.047875637446330596, 0.07009464551118158, -0.20480225042306952, 0.10905759783227473, -0.01492327813147789, -0.16139181038098677, -0.00928288498627288, 0.07410418866423979, 0.06162480114116555, -0.2729608647392264, -0.004606796761176416, 0.04313281230861321, 0.11250259292622407, -0.029007509378494604, -0.12264427901910883, -0.020226500451653487, 0.040926678239234855, 0.05273301426010827, 0.09743446124983686, 0.1108411537328114, -0.08229509370756291, -0.07596261699550919, 0.4299456280257021, 0.001574383250304631, -0.21379002981952258, 0.17145229685342028, -0.17829464486844482, 0.0010920654028831493, 0.21664330101616325, 0.14983782473774182, 0.18714539955059686, -0.07272753239210163, 0.1410942847530047, -0.14318926131264084, 0.1333257427350396, 0.04573782370425761, -0.0867466840759984, 0.2235166079675158, 0.05223320231639913, 0.08787959574588708, 0.16130348211819573, -0.04581489542587882, -0.13261369532085068, -0.3951498993805477, -0.2113523629405314, -0.23549319555362067, 0.12215493122736613, -0.1347013944316478, -0.23147220879660121, 0.4692900030031091, -0.014602440032398417, 0.2928458141007771, 0.0866506495097253, 0.28041589579411913, 0.13933095969315173, 0.044467366699661524, 0.006103384241993938, 0.11774041376719695, 0.1428246402758218, -0.03532857456732364, -0.19880437011653113, 0.021318518262844355, 0.03078178988237466] |
1,802.05298 | Temperature-dependent conformations of exciton-coupled Cy3 dimers in
double-stranded DNA | Understanding the properties of electronically interacting molecular
chromophores, which involve internally coupled electronic-vibrational motions,
is important to the spectroscopy of many biologically relevant systems. Here we
apply linear absorption, circular dichroism (CD), and two-dimensional
fluorescence spectroscopy (2DFS) to study the polarized collective excitations
of excitonically coupled cyanine dimers (Cy3)2 that are rigidly positioned
within the opposing sugar-phosphate backbones of the double-stranded region of
a double-stranded (ss) - single-stranded (ss) DNA fork construct. We show that
the exciton-coupling strength of the (Cy3)2-DNA construct can be systematically
varied with temperature below the ds - ss DNA denaturation transition. We
interpret spectroscopic measurements in terms of the Holstein vibronic dimer
model, from which we obtain information about the local conformation of the
(Cy3)2 dimer, as well as the degree of static disorder experienced by the Cy3
monomer and the (Cy3)2 dimer probe locally within their respective DNA duplex
environments. The properties of the (Cy3)2-DNA construct we determine suggest
that it may be employed as a useful model system to test fundamental concepts
of protein-DNA interactions, and the role of electronic-vibrational coherence
in electronic energy migration within exciton-coupled bio-molecular arrays.
| physics.chem-ph quant-ph | understanding the properties of electronically interacting molecular chromophores which involve internally coupled electronicvibrational motions is important to the spectroscopy of many biologically relevant systems here we apply linear absorption circular dichroism cd and twodimensional fluorescence spectroscopy 2dfs to study the polarized collective excitations of excitonically coupled cyanine dimers cy32 that are rigidly positioned within the opposing sugarphosphate backbones of the doublestranded region of a doublestranded ss singlestranded ss dna fork construct we show that the excitoncoupling strength of the cy32dna construct can be systematically varied with temperature below the ds ss dna denaturation transition we interpret spectroscopic measurements in terms of the holstein vibronic dimer model from which we obtain information about the local conformation of the cy32 dimer as well as the degree of static disorder experienced by the cy3 monomer and the cy32 dimer probe locally within their respective dna duplex environments the properties of the cy32dna construct we determine suggest that it may be employed as a useful model system to test fundamental concepts of proteindna interactions and the role of electronicvibrational coherence in electronic energy migration within excitoncoupled biomolecular arrays | [['understanding', 'the', 'properties', 'of', 'electronically', 'interacting', 'molecular', 'chromophores', 'which', 'involve', 'internally', 'coupled', 'electronicvibrational', 'motions', 'is', 'important', 'to', 'the', 'spectroscopy', 'of', 'many', 'biologically', 'relevant', 'systems', 'here', 'we', 'apply', 'linear', 'absorption', 'circular', 'dichroism', 'cd', 'and', 'twodimensional', 'fluorescence', 'spectroscopy', '2dfs', 'to', 'study', 'the', 'polarized', 'collective', 'excitations', 'of', 'excitonically', 'coupled', 'cyanine', 'dimers', 'cy32', 'that', 'are', 'rigidly', 'positioned', 'within', 'the', 'opposing', 'sugarphosphate', 'backbones', 'of', 'the', 'doublestranded', 'region', 'of', 'a', 'doublestranded', 'ss', 'singlestranded', 'ss', 'dna', 'fork', 'construct', 'we', 'show', 'that', 'the', 'excitoncoupling', 'strength', 'of', 'the', 'cy32dna', 'construct', 'can', 'be', 'systematically', 'varied', 'with', 'temperature', 'below', 'the', 'ds', 'ss', 'dna', 'denaturation', 'transition', 'we', 'interpret', 'spectroscopic', 'measurements', 'in', 'terms', 'of', 'the', 'holstein', 'vibronic', 'dimer', 'model', 'from', 'which', 'we', 'obtain', 'information', 'about', 'the', 'local', 'conformation', 'of', 'the', 'cy32', 'dimer', 'as', 'well', 'as', 'the', 'degree', 'of', 'static', 'disorder', 'experienced', 'by', 'the', 'cy3', 'monomer', 'and', 'the', 'cy32', 'dimer', 'probe', 'locally', 'within', 'their', 'respective', 'dna', 'duplex', 'environments', 'the', 'properties', 'of', 'the', 'cy32dna', 'construct', 'we', 'determine', 'suggest', 'that', 'it', 'may', 'be', 'employed', 'as', 'a', 'useful', 'model', 'system', 'to', 'test', 'fundamental', 'concepts', 'of', 'proteindna', 'interactions', 'and', 'the', 'role', 'of', 'electronicvibrational', 'coherence', 'in', 'electronic', 'energy', 'migration', 'within', 'excitoncoupled', 'biomolecular', 'arrays']] | [-0.13859478257862584, 0.17008354285332775, -0.027553113410249352, 0.04866252155721208, 0.0037259233560269843, -0.1685615489771078, 0.039762053556822156, 0.4079188033273177, -0.27694899637692166, -0.251008615875105, 0.0058844356815545605, -0.2704577277981226, -0.17114620803149191, 0.13563932038096527, 0.04841012215663316, -0.012524801781682481, 0.04159259133342817, 0.003563320678709955, 0.013142054853193297, -0.14848914357147866, 0.2282870676506638, 0.05533008460530495, 0.2677620280723364, 0.07302108301351276, 0.04841145477385598, 0.033365636165599226, 0.07433257019211241, 0.007805030882501831, -0.2073497938645532, 0.15603405856373873, 0.26594852801964997, 0.021186836697110027, 0.19372897418369386, -0.45538103820981235, -0.22460558956775528, 0.05700942805001082, 0.18132087402045727, 0.17376595147588586, 0.0013302867748559667, -0.2599912388442125, 0.02350442208302371, -0.1406364279261382, -0.12521447290175156, -0.09890404103226591, -0.002539446159741831, 0.1000968414873069, -0.19452878674185212, 0.10201841938196794, 0.02843532535732995, 0.08120955581582345, -0.08662442819235826, -0.0767887229768938, -0.10362591824473834, 0.12692137918522028, 0.0007915329213694229, 0.009920706978236622, 0.2530913948910413, -0.09650225914723067, -0.11180897369203004, 0.3805340685482536, -0.06377950168961843, -0.1296215195267635, 0.20047391643543, -0.13344891878755782, -0.12663744576998948, 0.14587480146924015, 0.12504322715084437, 0.1299494408406215, -0.1649732533867911, 0.039611373256935464, -0.01938659842906438, 0.22369206090621485, 0.08914266423460424, 0.09003985609480558, 0.25787459783112776, 0.1894442400441551, -0.002095882289922684, 0.19581913620433106, -0.10325182793191173, -0.12565027401593237, -0.19570316706181523, -0.14219866885169113, -0.15783615231839077, 0.05488178411698235, -0.05355685158956676, -0.1823146548557126, 0.37539400819402474, 0.08281108232504167, 0.1635873660501662, -0.02091866959996808, 0.21249037523943276, 0.019246217007953467, 0.06847686464975046, -0.027679705352696416, 0.2370034740088958, 0.16920068119729326, 0.03919332077378755, -0.315841396504266, 0.05035244637926283, 0.019982358808552456] |
1,802.05299 | On vector-valued twisted conjugate invariant functions on a group | We study the space of vector-valued (twisted) conjugate invariant functions
on a connected reductive group.
| math.RT | we study the space of vectorvalued twisted conjugate invariant functions on a connected reductive group | [['we', 'study', 'the', 'space', 'of', 'vectorvalued', 'twisted', 'conjugate', 'invariant', 'functions', 'on', 'a', 'connected', 'reductive', 'group']] | [-0.3201146158079306, 0.1278940474614501, -0.13090254018704098, 0.10842290157452225, -0.23059492607911428, -0.03390308838958542, -0.010914454360802968, 0.4251989771922429, -0.31608610103527707, -0.08655176113049189, 0.07873515185589591, -0.20544624843945106, -0.21965713519603014, 0.22314566224813462, -0.11620569831381242, 0.021822879711786907, 0.0317605149311324, 0.13355065435171126, -0.2153660960495472, -0.22061622763673464, 0.5725738356510798, -0.12283249547084173, 0.2753191201016307, -0.043198185476164025, 0.13567389771342278, 0.11260801246389747, -0.08839091761037707, -0.06721426332563472, -0.11581422369927168, 0.1587397796412309, 0.2887060783803463, -0.05939545448248585, 0.22543680419524512, -0.32597397913535436, -0.16872934123190741, 0.2371983028948307, 0.11142719201743603, -0.1771580179532369, -0.020747023859682183, -0.3649521891027689, 0.0685456436748306, -0.16749454587697982, -0.16559109340111414, -0.13152081593871118, -0.041286012871811786, -0.013755517965182661, -0.218355773948133, 0.015122658386826516, -0.0681127706542611, 0.10917226355522872, -0.08334916445116201, -0.042477538188298546, -0.0945087995690604, 0.04304481015230219, -0.07623152943948905, 0.15778849318933982, 0.1880103321435551, -0.005091655626893043, -0.05892943783352773, 0.3325561633023123, -0.16224342671533426, -0.3290852493296067, 0.13492027260363101, -0.18109907992184163, -0.2551167351504167, 0.0295114666223526, 0.27469455177585284, 0.22886735474069914, 0.0018004022538661956, 0.19253633717695873, -0.2216323340932528, 0.01937813200056553, 0.026044242518643537, -0.051390133798122406, 0.071204114643236, 0.034899213102956614, 0.16114599375675123, 0.1664441573123137, 0.15466991956345738, -0.04596948220084111, -0.4233125259478887, -0.22211072916785876, -0.11352954885611931, 0.1361902003486951, -0.09407121278345584, -0.19715019663174946, 0.5174512075570722, -0.039281977464755376, 0.17530848781267802, 0.09643097283939521, 0.17818073332309722, 0.09145126721511285, 0.10131260603666306, 0.07443394909302394, 0.0138585248341163, 0.31514284101625284, -0.16025253866488734, -0.18053654295702776, -0.13094405957187216, 0.23838072794800003] |
1,802.053 | Using Trusted Data to Train Deep Networks on Labels Corrupted by Severe
Noise | The growing importance of massive datasets used for deep learning makes
robustness to label noise a critical property for classifiers to have. Sources
of label noise include automatic labeling, non-expert labeling, and label
corruption by data poisoning adversaries. Numerous previous works assume that
no source of labels can be trusted. We relax this assumption and assume that a
small subset of the training data is trusted. This enables substantial label
corruption robustness performance gains. In addition, particularly severe label
noise can be combated by using a set of trusted data with clean labels. We
utilize trusted data by proposing a loss correction technique that utilizes
trusted examples in a data-efficient manner to mitigate the effects of label
noise on deep neural network classifiers. Across vision and natural language
processing tasks, we experiment with various label noises at several strengths,
and show that our method significantly outperforms existing methods.
| cs.LG cs.CL cs.CV cs.NE | the growing importance of massive datasets used for deep learning makes robustness to label noise a critical property for classifiers to have sources of label noise include automatic labeling nonexpert labeling and label corruption by data poisoning adversaries numerous previous works assume that no source of labels can be trusted we relax this assumption and assume that a small subset of the training data is trusted this enables substantial label corruption robustness performance gains in addition particularly severe label noise can be combated by using a set of trusted data with clean labels we utilize trusted data by proposing a loss correction technique that utilizes trusted examples in a dataefficient manner to mitigate the effects of label noise on deep neural network classifiers across vision and natural language processing tasks we experiment with various label noises at several strengths and show that our method significantly outperforms existing methods | [['the', 'growing', 'importance', 'of', 'massive', 'datasets', 'used', 'for', 'deep', 'learning', 'makes', 'robustness', 'to', 'label', 'noise', 'a', 'critical', 'property', 'for', 'classifiers', 'to', 'have', 'sources', 'of', 'label', 'noise', 'include', 'automatic', 'labeling', 'nonexpert', 'labeling', 'and', 'label', 'corruption', 'by', 'data', 'poisoning', 'adversaries', 'numerous', 'previous', 'works', 'assume', 'that', 'no', 'source', 'of', 'labels', 'can', 'be', 'trusted', 'we', 'relax', 'this', 'assumption', 'and', 'assume', 'that', 'a', 'small', 'subset', 'of', 'the', 'training', 'data', 'is', 'trusted', 'this', 'enables', 'substantial', 'label', 'corruption', 'robustness', 'performance', 'gains', 'in', 'addition', 'particularly', 'severe', 'label', 'noise', 'can', 'be', 'combated', 'by', 'using', 'a', 'set', 'of', 'trusted', 'data', 'with', 'clean', 'labels', 'we', 'utilize', 'trusted', 'data', 'by', 'proposing', 'a', 'loss', 'correction', 'technique', 'that', 'utilizes', 'trusted', 'examples', 'in', 'a', 'dataefficient', 'manner', 'to', 'mitigate', 'the', 'effects', 'of', 'label', 'noise', 'on', 'deep', 'neural', 'network', 'classifiers', 'across', 'vision', 'and', 'natural', 'language', 'processing', 'tasks', 'we', 'experiment', 'with', 'various', 'label', 'noises', 'at', 'several', 'strengths', 'and', 'show', 'that', 'our', 'method', 'significantly', 'outperforms', 'existing', 'methods']] | [-0.07699847534751973, 0.006306467467692454, -0.023907323226307495, 0.07622304603668258, -0.13464092908464875, -0.2255733397103393, 0.11021154310327728, 0.4585139934125756, -0.26678965024876633, -0.3440946721899751, 0.04206244741264429, -0.30118704702063287, -0.14920032149608675, 0.17572833207747396, -0.2112059547326754, 0.0867627576194905, 0.18200325220823288, 0.03565032193059656, -0.015580145226841842, -0.2979785355651197, 0.34474063940453215, 0.04295255403888626, 0.33591244450292074, 0.007088301665577534, 0.11614999923590771, -0.037779458889712556, -0.051213567752809566, 0.006324450213641457, 0.017531115110810985, 0.1158232382511267, 0.34890257329774416, 0.21446576905499742, 0.37295348233719533, -0.4037306535347189, -0.2662530738948467, 0.14759581636738134, 0.11353584880802177, 0.1574547188900249, -0.06393432711971596, -0.3754949938707255, 0.1275539687092139, -0.19937993972751036, 0.027593390811612276, -0.1619726727493233, -0.048640786028290924, -0.012487798277917947, -0.32462390494844373, 0.03991311653580114, 0.09083204122804533, 0.05468249659846864, 0.011978138049410001, -0.09994984586798661, 0.021902866291064717, 0.14813185358936018, 0.026051356916542392, 0.04260529736937905, 0.15853112523532095, -0.18202513422363917, -0.1633053196356569, 0.3080209274524571, -0.05339243905807568, -0.2447718542298881, 0.19950742241486, -0.007179260683384397, -0.18969909568015184, 0.112434537335601, 0.2354926731991204, 0.06135040187163631, -0.17991870933690587, 0.033022988369535794, -0.0034159316045760707, 0.22044074935586871, 0.03767464317796702, 0.042543242008242804, 0.12741063699610783, 0.22036056995794578, 0.0564079504142314, 0.15452544741502433, -0.16195150360156707, -0.003821729959265606, -0.2231987764479945, -0.06091004260658362, -0.23704518688641288, -0.011940034970049621, -0.12164218788235008, -0.1273917766265112, 0.3486233528363644, 0.3021481985515739, 0.1951131696712125, 0.09668870112442607, 0.4079736348845669, -0.007709223692005695, 0.14415497118072282, 0.1274463234727296, 0.16340463304564962, 0.002481998032512697, 0.08772651532136307, -0.14160041221751002, 0.1481921102448895, -0.026761064277584286] |
1,802.05301 | A Submillimeter Galaxy Projected on the Debris Disk of HD 95086 | We present sensitive observations carried out with the Atacama Large
Millimeter/Submillimeter Array (ALMA) of the dusty debris disk HD 95086. These
observations were made in bands 6 (223 GHz) and 7 (338 GHz) with an angular
resolution of about 1$''$ which allowed us to resolve well the debris disk with
a deconvolved size of 7.0$''$ $\times$ 6.0$''$ and with an inner depression of
about 2$''$. We do not detect emission from the star itself and the possible
inner dusty belt. We also do not detect CO (J=2-1) and (J=3-2) emission,
excluding the possibility of an evolved gaseous primordial disk as noted in
previous studies of HD95086. We estimated a lower limit for the gas mass of
$\leq$0.01 M$_\oplus$ for the debris disk of HD95086. From the mm. emission, we
computed a dust mass for the debris disk HD95086 of 0.5$\pm$0.2 M$_\oplus$,
resulting in a dust-to-gas ratio of $\geq$50. Finally, we confirm the detection
of a strong submillimeter source to the northwest of the disk (ALMA-SMM1)
revealed by recent ALMA observations. This new source might be interpreted as a
planet in formation on the periphery of the debris disk HD 95086 or as a strong
impact between dwarf planets. However, given the absence of the proper motions
of ALMA-SMM1 similar to those reported in the debris disk (estimated from these
new ALMA observations) and for the optical star, this is more likely to be a
submillimeter background galaxy.
| astro-ph.SR astro-ph.GA | we present sensitive observations carried out with the atacama large millimetersubmillimeter array alma of the dusty debris disk hd 95086 these observations were made in bands 6 223 ghz and 7 338 ghz with an angular resolution of about 1 which allowed us to resolve well the debris disk with a deconvolved size of 70 times 60 and with an inner depression of about 2 we do not detect emission from the star itself and the possible inner dusty belt we also do not detect co j21 and j32 emission excluding the possibility of an evolved gaseous primordial disk as noted in previous studies of hd95086 we estimated a lower limit for the gas mass of leq001 m_oplus for the debris disk of hd95086 from the mm emission we computed a dust mass for the debris disk hd95086 of 05pm02 m_oplus resulting in a dusttogas ratio of geq50 finally we confirm the detection of a strong submillimeter source to the northwest of the disk almasmm1 revealed by recent alma observations this new source might be interpreted as a planet in formation on the periphery of the debris disk hd 95086 or as a strong impact between dwarf planets however given the absence of the proper motions of almasmm1 similar to those reported in the debris disk estimated from these new alma observations and for the optical star this is more likely to be a submillimeter background galaxy | [['we', 'present', 'sensitive', 'observations', 'carried', 'out', 'with', 'the', 'atacama', 'large', 'millimetersubmillimeter', 'array', 'alma', 'of', 'the', 'dusty', 'debris', 'disk', 'hd', '95086', 'these', 'observations', 'were', 'made', 'in', 'bands', '6', '223', 'ghz', 'and', '7', '338', 'ghz', 'with', 'an', 'angular', 'resolution', 'of', 'about', '1', 'which', 'allowed', 'us', 'to', 'resolve', 'well', 'the', 'debris', 'disk', 'with', 'a', 'deconvolved', 'size', 'of', '70', 'times', '60', 'and', 'with', 'an', 'inner', 'depression', 'of', 'about', '2', 'we', 'do', 'not', 'detect', 'emission', 'from', 'the', 'star', 'itself', 'and', 'the', 'possible', 'inner', 'dusty', 'belt', 'we', 'also', 'do', 'not', 'detect', 'co', 'j21', 'and', 'j32', 'emission', 'excluding', 'the', 'possibility', 'of', 'an', 'evolved', 'gaseous', 'primordial', 'disk', 'as', 'noted', 'in', 'previous', 'studies', 'of', 'hd95086', 'we', 'estimated', 'a', 'lower', 'limit', 'for', 'the', 'gas', 'mass', 'of', 'leq001', 'm_oplus', 'for', 'the', 'debris', 'disk', 'of', 'hd95086', 'from', 'the', 'mm', 'emission', 'we', 'computed', 'a', 'dust', 'mass', 'for', 'the', 'debris', 'disk', 'hd95086', 'of', '05pm02', 'm_oplus', 'resulting', 'in', 'a', 'dusttogas', 'ratio', 'of', 'geq50', 'finally', 'we', 'confirm', 'the', 'detection', 'of', 'a', 'strong', 'submillimeter', 'source', 'to', 'the', 'northwest', 'of', 'the', 'disk', 'almasmm1', 'revealed', 'by', 'recent', 'alma', 'observations', 'this', 'new', 'source', 'might', 'be', 'interpreted', 'as', 'a', 'planet', 'in', 'formation', 'on', 'the', 'periphery', 'of', 'the', 'debris', 'disk', 'hd', '95086', 'or', 'as', 'a', 'strong', 'impact', 'between', 'dwarf', 'planets', 'however', 'given', 'the', 'absence', 'of', 'the', 'proper', 'motions', 'of', 'almasmm1', 'similar', 'to', 'those', 'reported', 'in', 'the', 'debris', 'disk', 'estimated', 'from', 'these', 'new', 'alma', 'observations', 'and', 'for', 'the', 'optical', 'star', 'this', 'is', 'more', 'likely', 'to', 'be', 'a', 'submillimeter', 'background', 'galaxy']] | [-0.0725301110241642, 0.06755550734341782, -0.02352594998325401, 0.03800318164445156, -0.08978821719744814, -0.03698753334917608, 0.028525929038648697, 0.40498052919563304, -0.1678653264022532, -0.3408041129587218, 0.10726336752766016, -0.2539818583080313, -0.027643458073351196, 0.16670049330251605, -0.044016649631799354, -0.0023252014010792894, 0.08029330388169192, -0.13952402528695154, -0.016624908288990752, -0.21393365011342638, 0.26870054324245474, 0.13695654719208603, 0.027252880087953717, 0.015438537091384501, 0.03732623014391236, -0.1603152212574918, -0.09534016268551669, -0.05615984433022819, -0.18569062713757478, 0.05115593201181024, 0.2336245948956408, 0.11045197892310538, 0.19518907751504316, -0.384785136112008, -0.20756145190887748, 0.04683789831901952, 0.172549406710506, 0.01626924799441444, -0.0035986455591208635, -0.3119923185643064, 0.09404668041460952, -0.20697402387313832, -0.20612245125200424, 0.10494019332203951, 0.07559699294169317, -0.0340775809627498, -0.2519071574478766, 0.10358458400547581, 0.059127797675418946, 0.12468425954528185, -0.14229213110526126, -0.14390031534023262, -0.08134358803353917, 0.07236081624429577, -0.010025824134361974, 0.09239116044866937, 0.1893595179578873, -0.11429942057511965, -0.04728868261954943, 0.37226811212751326, -0.12756813833037342, -0.02200285963516267, 0.2695827983377717, -0.2691580867134994, -0.2002418195322164, 0.19362453288546574, 0.14530385911560623, 0.12215869194556171, -0.11047178167897745, -0.030576107285311245, -0.08431064714018112, 0.2667669385038076, 0.1052112109767265, 0.07368029998082022, 0.4033913959805502, 0.09706218488406503, 0.050110300159473535, 0.14630530026437547, -0.3153148184804238, -0.035105908722486825, -0.20695324434275247, -0.12787723340305934, -0.1645545452696275, 0.12204929583522595, -0.11693650668644588, -0.08884364042966726, 0.28874724598545504, 0.11966582283036896, 0.2544572064023497, 0.02608082134350575, 0.3099508562061312, 0.030330786216192653, 0.14096896431724593, 0.13392109179053888, 0.3301993422130275, 0.15043219633684235, 0.1100476210358075, -0.23516866156347735, 0.048326302466158606, -0.07351074299411328] |
1,802.05302 | Systematics of electronic and magnetic properties in the transition
metal doped Sb$_2$Te$_3$ quantum anomalous Hall platform | The quantum anomalous Hall effect (QAHE) has recently been reported to emerge
in magnetically-doped topological insulators. Although its general
phenomenology is well established, the microscopic origin is far from being
properly understood and controlled. Here we report on a detailed and systematic
investigation of transition-metal (TM)-doped Sb$_2$Te$_3$. By combining density
functional theory (DFT) calculations with complementary experimental
techniques, i.e., scanning tunneling microscopy (STM), resonant photoemission
(resPES), and x-ray magnetic circular dichroism (XMCD), we provide a complete
spectroscopic characterization of both electronic and magnetic properties. Our
results reveal that the TM dopants not only affect the magnetic state of the
host material, but also significantly alter the electronic structure by
generating impurity-derived energy bands. Our findings demonstrate the
existence of a delicate interplay between electronic and magnetic properties in
TM-doped TIs. In particular, we find that the fate of the topological surface
states critically depends on the specific character of the TM impurity: while
V- and Fe-doped Sb$_2$Te$_3$ display resonant impurity states in the vicinity
of the Dirac point, Cr and Mn impurities leave the energy gap unaffected. The
single-ion magnetic anisotropy energy and easy axis, which control the magnetic
gap opening and its stability, are also found to be strongly TM
impurity-dependent and can vary from in-plane to out-of-plane depending on the
impurity and its distance from the surface. Overall, our results provide
general guidelines for the realization of a robust QAHE in TM-doped
Sb$_2$Te$_3$ in the ferromagnetic state.
| cond-mat.mes-hall | the quantum anomalous hall effect qahe has recently been reported to emerge in magneticallydoped topological insulators although its general phenomenology is well established the microscopic origin is far from being properly understood and controlled here we report on a detailed and systematic investigation of transitionmetal tmdoped sb_2te_3 by combining density functional theory dft calculations with complementary experimental techniques ie scanning tunneling microscopy stm resonant photoemission respes and xray magnetic circular dichroism xmcd we provide a complete spectroscopic characterization of both electronic and magnetic properties our results reveal that the tm dopants not only affect the magnetic state of the host material but also significantly alter the electronic structure by generating impurityderived energy bands our findings demonstrate the existence of a delicate interplay between electronic and magnetic properties in tmdoped tis in particular we find that the fate of the topological surface states critically depends on the specific character of the tm impurity while v and fedoped sb_2te_3 display resonant impurity states in the vicinity of the dirac point cr and mn impurities leave the energy gap unaffected the singleion magnetic anisotropy energy and easy axis which control the magnetic gap opening and its stability are also found to be strongly tm impuritydependent and can vary from inplane to outofplane depending on the impurity and its distance from the surface overall our results provide general guidelines for the realization of a robust qahe in tmdoped sb_2te_3 in the ferromagnetic state | [['the', 'quantum', 'anomalous', 'hall', 'effect', 'qahe', 'has', 'recently', 'been', 'reported', 'to', 'emerge', 'in', 'magneticallydoped', 'topological', 'insulators', 'although', 'its', 'general', 'phenomenology', 'is', 'well', 'established', 'the', 'microscopic', 'origin', 'is', 'far', 'from', 'being', 'properly', 'understood', 'and', 'controlled', 'here', 'we', 'report', 'on', 'a', 'detailed', 'and', 'systematic', 'investigation', 'of', 'transitionmetal', 'tmdoped', 'sb_2te_3', 'by', 'combining', 'density', 'functional', 'theory', 'dft', 'calculations', 'with', 'complementary', 'experimental', 'techniques', 'ie', 'scanning', 'tunneling', 'microscopy', 'stm', 'resonant', 'photoemission', 'respes', 'and', 'xray', 'magnetic', 'circular', 'dichroism', 'xmcd', 'we', 'provide', 'a', 'complete', 'spectroscopic', 'characterization', 'of', 'both', 'electronic', 'and', 'magnetic', 'properties', 'our', 'results', 'reveal', 'that', 'the', 'tm', 'dopants', 'not', 'only', 'affect', 'the', 'magnetic', 'state', 'of', 'the', 'host', 'material', 'but', 'also', 'significantly', 'alter', 'the', 'electronic', 'structure', 'by', 'generating', 'impurityderived', 'energy', 'bands', 'our', 'findings', 'demonstrate', 'the', 'existence', 'of', 'a', 'delicate', 'interplay', 'between', 'electronic', 'and', 'magnetic', 'properties', 'in', 'tmdoped', 'tis', 'in', 'particular', 'we', 'find', 'that', 'the', 'fate', 'of', 'the', 'topological', 'surface', 'states', 'critically', 'depends', 'on', 'the', 'specific', 'character', 'of', 'the', 'tm', 'impurity', 'while', 'v', 'and', 'fedoped', 'sb_2te_3', 'display', 'resonant', 'impurity', 'states', 'in', 'the', 'vicinity', 'of', 'the', 'dirac', 'point', 'cr', 'and', 'mn', 'impurities', 'leave', 'the', 'energy', 'gap', 'unaffected', 'the', 'singleion', 'magnetic', 'anisotropy', 'energy', 'and', 'easy', 'axis', 'which', 'control', 'the', 'magnetic', 'gap', 'opening', 'and', 'its', 'stability', 'are', 'also', 'found', 'to', 'be', 'strongly', 'tm', 'impuritydependent', 'and', 'can', 'vary', 'from', 'inplane', 'to', 'outofplane', 'depending', 'on', 'the', 'impurity', 'and', 'its', 'distance', 'from', 'the', 'surface', 'overall', 'our', 'results', 'provide', 'general', 'guidelines', 'for', 'the', 'realization', 'of', 'a', 'robust', 'qahe', 'in', 'tmdoped', 'sb_2te_3', 'in', 'the', 'ferromagnetic', 'state']] | [-0.15601867153013355, 0.17708030433008573, -0.04850082957780599, 0.04979297890011886, -0.07570328506320215, -0.13956100971754953, 0.1084974976571985, 0.4129646752624452, -0.2701138445616899, -0.31675576286374774, -0.0047452418464275095, -0.33022643148531244, -0.16215694898606411, 0.20182069537436254, 0.05171026535200869, 0.010536577477474, -0.006127623341265409, -0.04847517772455418, -0.10937106198858187, -0.18928520735059137, 0.29088693007654626, 0.05212871959391872, 0.32440568665101216, 0.14544340093158373, -0.008868922749455986, 0.018795228602380313, 0.10010294935899834, 0.05551717852872303, -0.15492466876133856, 0.08220523032858702, 0.22741106829504257, -0.07586164722520419, 0.16142659449945948, -0.4725336143512185, -0.20522123309509718, -0.04307458353103647, 0.11528316724599347, 0.14069804239347028, -0.11785006056835155, -0.30842631633154766, 0.07341383978481866, -0.08820384571000058, -0.11494133304491513, -0.141598186728118, -0.022864547075531073, 0.0017541293485262314, -0.1869181176696947, 0.09064675552037764, 0.06237993323089586, 0.11978975307225605, -0.13847517685430563, -0.10954556185576063, -0.12951637596036739, 0.07511342346409977, 0.04617302177743908, 0.0412474966220589, 0.17481642580755494, -0.09592017085103616, -0.12460525390425962, 0.3523189473668301, -0.02334231716979827, -0.10250107160605051, 0.17564267132963454, -0.21326646789323397, -0.10535968863405287, 0.12105227557222258, 0.09815439240011081, 0.11314226119943402, -0.09831935330905497, 0.12702393446713411, -0.014219601419969547, 0.18520851925070722, 0.00867865129643973, 0.1346247069123827, 0.26474763827883646, 0.16795545321607477, 0.0439900771456481, 0.10294572828179069, -0.13312357155598326, -0.005649816845504551, -0.20089948845698552, -0.18843290352599085, -0.23347864420928, 0.08187479319295722, -0.033278038857630435, -0.2130955124426508, 0.4320921744943886, 0.13959348343608424, 0.17502647763540766, -0.09313348170023553, 0.2570475613181831, 0.09004668341783274, 0.03335337618565453, 0.033974206835685, 0.3016714248595908, 0.17314808739900997, 0.10466262048693421, -0.32744753547257377, 0.10480530493053365, -0.019456047083431183] |
1,802.05303 | Generalized Egorov's statement for ideals | We consider the generalized Egorov's statement (Egorov's Theorem without the
assumption on measurability of the functions, see \cite{tw:nget}) in the case
of an ideal convergence and a number of different types of ideal convergence
notion. We prove that in those cases the generalized Egorov's statement is
independent from ZFC.
| math.LO math.CA | we consider the generalized egorovs statement egorovs theorem without the assumption on measurability of the functions see citetwnget in the case of an ideal convergence and a number of different types of ideal convergence notion we prove that in those cases the generalized egorovs statement is independent from zfc | [['we', 'consider', 'the', 'generalized', 'egorovs', 'statement', 'egorovs', 'theorem', 'without', 'the', 'assumption', 'on', 'measurability', 'of', 'the', 'functions', 'see', 'citetwnget', 'in', 'the', 'case', 'of', 'an', 'ideal', 'convergence', 'and', 'a', 'number', 'of', 'different', 'types', 'of', 'ideal', 'convergence', 'notion', 'we', 'prove', 'that', 'in', 'those', 'cases', 'the', 'generalized', 'egorovs', 'statement', 'is', 'independent', 'from', 'zfc']] | [-0.13956142081102976, 0.059685009563509084, -0.10136632485470425, 0.11279881296650274, -0.025867062562610954, -0.09795934542974767, 0.04422647785880448, 0.2687686269637197, -0.3122388074504367, -0.18278130353428423, 0.10028979957860429, -0.2561821286605361, -0.09457371306295197, 0.21151570828321078, -0.1595872022638408, 0.020420551494074363, 0.05047720809428332, 0.06822918204125017, -0.07538784779899288, -0.2814648851538853, 0.3801159079497059, -0.07025535511881269, 0.31446617587547127, 0.0414052380171294, 0.07428120771267761, 0.09354163478322637, -0.014518403419060633, 0.04097806530167721, -0.19321263052385498, 0.05946750381068947, 0.20144214659618834, 0.15525935818353295, 0.305211620638147, -0.3731964516919106, -0.13245079253101721, 0.16415378195233643, 0.05040635620631898, 0.0725371279695537, 0.021391538362270996, -0.22730149382550735, 0.13089125450399783, -0.15453736872101823, -0.22359564708312973, -0.05786021092596153, -0.036883809632854536, 0.04879892171205332, -0.30017027887515724, 0.08643256038582574, 0.2409104345521579, 0.11374643657472916, -0.07412729509330045, -0.07186583497483905, 0.03553590551503779, 0.039308640465606004, 0.05722309216556217, -0.01633306227116312, 0.06965345627395436, -0.0851174967053036, -0.1071343495665739, 0.3384687187014303, -0.07396646920824423, -0.282622636994347, 0.16382679801123837, -0.1490573988412507, -0.20462704697274603, 0.027002396062016487, 0.05919944397949924, 0.13594279358706748, -0.081478797190357, 0.13575861164402644, -0.17733578942716122, 0.10229076043469831, 0.1191148070890146, 0.05524100354523398, 0.10103691838836919, 0.05554214616616567, 0.11678525616055897, 0.20704841963015497, 0.016985701353405602, -0.079126131478309, -0.3798187848490973, -0.18228503118734807, -0.1732129988182957, 0.1383367595456851, -0.13937573542322448, -0.17251711492038643, 0.3259603034045237, 0.14937111883773468, 0.11190807179082185, 0.12702598426646242, 0.2530739292657624, 0.09925573183378826, -0.033666187373455614, 0.07494358568025443, 0.22517475998029113, 0.18820715006828928, 0.054837079611994945, -0.1089406801960043, 0.06543891558734079, 0.1811033634148771] |
1,802.05304 | A new general relativistic contribution to Mercury's perihelion advance | We point out the existence of a new general relativistic contribution to the
perihelion advance of Mercury that, while smaller than the contributions
arising from the solar quadrupole moment and angular momentum, is 100 times
larger than the second-post-Newtonian contribution. It arises in part from
relativistic "cross-terms" in the post-Newtonian equations of motion between
Mercury's interaction with the Sun and with the other planets, and in part from
an interaction between Mercury's motion and the gravitomagnetic field of the
moving planets. At a few parts in $10^6$ of the leading general relativistic
precession of 42.98 arcseconds per century, these effects are likely to be
detectable by the BepiColombo mission to place and track two orbiters around
Mercury, scheduled for launch around 2018.
| gr-qc | we point out the existence of a new general relativistic contribution to the perihelion advance of mercury that while smaller than the contributions arising from the solar quadrupole moment and angular momentum is 100 times larger than the secondpostnewtonian contribution it arises in part from relativistic crossterms in the postnewtonian equations of motion between mercurys interaction with the sun and with the other planets and in part from an interaction between mercurys motion and the gravitomagnetic field of the moving planets at a few parts in 106 of the leading general relativistic precession of 4298 arcseconds per century these effects are likely to be detectable by the bepicolombo mission to place and track two orbiters around mercury scheduled for launch around 2018 | [['we', 'point', 'out', 'the', 'existence', 'of', 'a', 'new', 'general', 'relativistic', 'contribution', 'to', 'the', 'perihelion', 'advance', 'of', 'mercury', 'that', 'while', 'smaller', 'than', 'the', 'contributions', 'arising', 'from', 'the', 'solar', 'quadrupole', 'moment', 'and', 'angular', 'momentum', 'is', '100', 'times', 'larger', 'than', 'the', 'secondpostnewtonian', 'contribution', 'it', 'arises', 'in', 'part', 'from', 'relativistic', 'crossterms', 'in', 'the', 'postnewtonian', 'equations', 'of', 'motion', 'between', 'mercurys', 'interaction', 'with', 'the', 'sun', 'and', 'with', 'the', 'other', 'planets', 'and', 'in', 'part', 'from', 'an', 'interaction', 'between', 'mercurys', 'motion', 'and', 'the', 'gravitomagnetic', 'field', 'of', 'the', 'moving', 'planets', 'at', 'a', 'few', 'parts', 'in', '106', 'of', 'the', 'leading', 'general', 'relativistic', 'precession', 'of', '4298', 'arcseconds', 'per', 'century', 'these', 'effects', 'are', 'likely', 'to', 'be', 'detectable', 'by', 'the', 'bepicolombo', 'mission', 'to', 'place', 'and', 'track', 'two', 'orbiters', 'around', 'mercury', 'scheduled', 'for', 'launch', 'around', '2018']] | [-0.12088057673994268, 0.1840272504297423, -0.041709931082207684, 0.045313193597334635, -0.08478011978698559, -0.02914014393005703, -0.01028000737123428, 0.273381413800306, -0.21667735409335095, -0.3776197301407085, 0.05087961220816083, -0.33440021741524584, -0.05364566729938398, 0.21982573909440734, -0.05117780012536611, -0.028135876785811097, 0.07764603183261257, 0.04303535434692243, -0.07841560928738814, -0.19468102164444376, 0.2701915132385663, 0.10389125751728406, 0.07211858168488643, 0.0024452665210014483, 0.07856459191191148, -0.03761331293136492, 0.005428037787482264, -0.03292933765218639, -0.09338309873329889, 0.08611271615888251, 0.18824084013696668, 0.05124810317409088, 0.234134919832942, -0.45083874615184105, -0.1411537095583731, 0.013455684966651997, 0.07238750178061548, 0.1028064316287484, -0.02227974152497825, -0.3235806187339982, 0.0216391676174263, -0.2186073961316562, -0.18035272357328871, 0.0012647281973393726, 0.11631216240577308, -0.029856436825300123, -0.23078586982532603, 0.10870726931397422, 0.06835572607433577, 0.07148536672905377, -0.11443903211305742, -0.13203026895834988, -0.023016281376333266, 0.12288516437726431, 0.13938659263896894, 0.10090836815413881, 0.13706862157378652, -0.08535507477850454, -0.06461036478104375, 0.4824290750700919, -0.07441697329340968, -0.1030633121148729, 0.15289356578790322, -0.2849371021224155, -0.09927983109869795, 0.19355103801783236, 0.21618172590101717, 0.1496578270498354, -0.13964287470453648, 0.010032220733577202, 0.05699019877194259, 0.13989428536261272, 0.11288815814253615, 0.01155194963927793, 0.3456069939372847, 0.10866365039751666, 0.06789056356942862, 0.05501384031529477, -0.21324898135375048, -0.13112555980323584, -0.2687482485036198, -0.11723342213634645, -0.14238158304656504, 0.05421524520650445, -0.08510745877767895, -0.057228534108363704, 0.37445246296186674, 0.19643762146626584, 0.15260260190326172, -0.013740644805499764, 0.3255646379939357, 0.068291309105469, 0.10234150908062936, 0.1216869614713016, 0.38675983517705537, 0.10618799263191578, 0.10598421027906789, -0.21541922584225684, 0.032135778564776556, 0.05268066802604093] |
1,802.05305 | Influential User Subscription on Time-Decaying Social Streams | Influence maximization which asks for $k$-size seed set from a social network
such that maximizing the influence over all other users (called influence
spread) has widely attracted attention due to its significant applications in
viral marketing and rumor control. In real world scenarios, people are
interested in the most influential users in particular topics, and want to
subscribe the topics-of-interests over social networks. In this paper, we
formulate the problem of influential users subscription on time-decaying social
stream, which asks for maintaining the $k$-size influential users sets for each
topic-aware subscription queries. We first analyze the widely adopted sliding
window model and propose a newly time-decaying influence model to overcome the
shortages when calculating the influence over social stream. Developed from
sieve based streaming algorithm, we propose an efficient algorithm to support
the calculation of time-decaying influence over dynamically updating social
networks. Using information among subscriptions, we then construct the Prefix
Tree Structure to allow us minimizing the times of calculating influence of
each update and easily maintained. Pruning techniques are also applied to the
Prefix Tree to optimize the performance of social stream update. Our approach
ensures a $\frac{1}{2}-\epsilon$ approximation ratio. Experimental results show
that our approach significantly outperforms the baseline approaches in
efficiency and result quality.
| cs.SI cs.DB | influence maximization which asks for ksize seed set from a social network such that maximizing the influence over all other users called influence spread has widely attracted attention due to its significant applications in viral marketing and rumor control in real world scenarios people are interested in the most influential users in particular topics and want to subscribe the topicsofinterests over social networks in this paper we formulate the problem of influential users subscription on timedecaying social stream which asks for maintaining the ksize influential users sets for each topicaware subscription queries we first analyze the widely adopted sliding window model and propose a newly timedecaying influence model to overcome the shortages when calculating the influence over social stream developed from sieve based streaming algorithm we propose an efficient algorithm to support the calculation of timedecaying influence over dynamically updating social networks using information among subscriptions we then construct the prefix tree structure to allow us minimizing the times of calculating influence of each update and easily maintained pruning techniques are also applied to the prefix tree to optimize the performance of social stream update our approach ensures a frac12epsilon approximation ratio experimental results show that our approach significantly outperforms the baseline approaches in efficiency and result quality | [['influence', 'maximization', 'which', 'asks', 'for', 'ksize', 'seed', 'set', 'from', 'a', 'social', 'network', 'such', 'that', 'maximizing', 'the', 'influence', 'over', 'all', 'other', 'users', 'called', 'influence', 'spread', 'has', 'widely', 'attracted', 'attention', 'due', 'to', 'its', 'significant', 'applications', 'in', 'viral', 'marketing', 'and', 'rumor', 'control', 'in', 'real', 'world', 'scenarios', 'people', 'are', 'interested', 'in', 'the', 'most', 'influential', 'users', 'in', 'particular', 'topics', 'and', 'want', 'to', 'subscribe', 'the', 'topicsofinterests', 'over', 'social', 'networks', 'in', 'this', 'paper', 'we', 'formulate', 'the', 'problem', 'of', 'influential', 'users', 'subscription', 'on', 'timedecaying', 'social', 'stream', 'which', 'asks', 'for', 'maintaining', 'the', 'ksize', 'influential', 'users', 'sets', 'for', 'each', 'topicaware', 'subscription', 'queries', 'we', 'first', 'analyze', 'the', 'widely', 'adopted', 'sliding', 'window', 'model', 'and', 'propose', 'a', 'newly', 'timedecaying', 'influence', 'model', 'to', 'overcome', 'the', 'shortages', 'when', 'calculating', 'the', 'influence', 'over', 'social', 'stream', 'developed', 'from', 'sieve', 'based', 'streaming', 'algorithm', 'we', 'propose', 'an', 'efficient', 'algorithm', 'to', 'support', 'the', 'calculation', 'of', 'timedecaying', 'influence', 'over', 'dynamically', 'updating', 'social', 'networks', 'using', 'information', 'among', 'subscriptions', 'we', 'then', 'construct', 'the', 'prefix', 'tree', 'structure', 'to', 'allow', 'us', 'minimizing', 'the', 'times', 'of', 'calculating', 'influence', 'of', 'each', 'update', 'and', 'easily', 'maintained', 'pruning', 'techniques', 'are', 'also', 'applied', 'to', 'the', 'prefix', 'tree', 'to', 'optimize', 'the', 'performance', 'of', 'social', 'stream', 'update', 'our', 'approach', 'ensures', 'a', 'frac12epsilon', 'approximation', 'ratio', 'experimental', 'results', 'show', 'that', 'our', 'approach', 'significantly', 'outperforms', 'the', 'baseline', 'approaches', 'in', 'efficiency', 'and', 'result', 'quality']] | [-0.09715459458416373, 0.011419629570871887, -0.052454362418956874, 0.07571388156346341, -0.14871010454825875, -0.15575295759296817, 0.14602882414885865, 0.41475398714949446, -0.28573792292679684, -0.3057358693081613, 0.05350619935794029, -0.28823587535994083, -0.21583541341171394, 0.16449624031963872, -0.08190554646865987, 0.04560095058419038, 0.08897928081611853, 0.08935831390752844, 0.03164155733567185, -0.3357191478617762, 0.29175465115595883, 0.06837977573002983, 0.34938290805737604, 0.06989687639856484, 0.0902080370294975, 0.06957489033456801, -0.08830642208525138, 0.032389005681886, -0.11916402088877143, 0.14269942086269488, 0.3153570784698808, 0.24409369016066193, 0.3753943011902909, -0.4181627010495016, -0.21515168870640236, 0.14044922324715228, 0.16170827998586634, 0.09041116475809093, -0.014571127461882808, -0.2792664411318738, 0.13209189091150353, -0.21881979713443575, -0.013545258359120387, -0.04534935565869801, 0.003587891247759505, 0.029454595743246922, -0.2920943778226856, -0.014977646671468392, -0.024116314092378428, 0.02646211989950843, -0.038699666057605435, -0.10795188340721878, 0.04132030062809041, 0.19294127365077346, 0.08363740634309445, 0.007304507622881452, 0.16873506712613673, -0.11792725353138295, -0.15774854997445534, 0.40026492886472403, -0.03037615826626013, -0.18295668610996316, 0.14118413550483927, -0.018335746826104275, -0.14718996037320212, 0.09457588143896584, 0.28137335597264873, 0.107606916658285, -0.16901511039716907, 0.014663974424272565, -0.05249714896128309, 0.15106483809649945, 0.10562886667505997, 0.01862501143818585, 0.1443093516988816, 0.18950303774781344, 0.11485026805071023, 0.12144591515889482, -0.053572634063524804, -0.12884073189755038, -0.14614185638407745, -0.10797708105386758, -0.14967046820490462, -0.011071441018181603, -0.13504333225293255, -0.15695198490625112, 0.43011472022569763, 0.23878738556238938, 0.15792253731818098, 0.08041318888050539, 0.2992713852126787, 0.03456867057439678, 0.06876427322716974, 0.15509284180475444, 0.1438011166191001, 0.03299698373529969, 0.13941983166264324, -0.18565478122213902, 0.16748972889618016, 0.049166917089918036] |
1,802.05306 | Model-independent measurements of the sodium magneto-optical trap's
excited-state population | We present model-independent measurements of the excited-state population of
atoms in a sodium (Na) magneto-optical trap (MOT) using a hybrid ion-neutral
trap composed of a MOT and a linear Paul trap (LPT). We photoionize excited Na
atoms trapped in the MOT and use two independent methods to measure the
resulting ions: directly by trapping them in our LPT, and indirectly by
monitoring changes in MOT fluorescence. By measuring the ionization rate via
these two independent methods, we have enough information to directly determine
the population of MOT atoms in the excited-state. The resulting measurement
reveals that there is a range of trapping-laser intensities where the
excited-state population of atoms in our MOT follows the standard two-level
model intensity-dependence. However, an experimentally determined effective
saturation intensity must be used instead of the theoretically predicted value
from the two-level model. We measured the effective saturation intensity to be
$I_\mathrm{se}=22.9(3)\:\textrm{mW}/\textrm{cm}^2$ for the type-I Na MOT and
$I_\mathrm{se}=48.9(7)\;\textrm{mW}/\textrm{cm}^2$ for the type-II Na MOT,
approximately 1.7 and 3.6 times the theoretical estimate, respectively. Lastly,
at large trapping-laser intensities, our experiment reveals a clear departure
from the two-level model at a critical intensity that we believe is due to a
state-mixing effect, whose critical intensity can be determined by a simple
power broadening model.
| physics.atom-ph | we present modelindependent measurements of the excitedstate population of atoms in a sodium na magnetooptical trap mot using a hybrid ionneutral trap composed of a mot and a linear paul trap lpt we photoionize excited na atoms trapped in the mot and use two independent methods to measure the resulting ions directly by trapping them in our lpt and indirectly by monitoring changes in mot fluorescence by measuring the ionization rate via these two independent methods we have enough information to directly determine the population of mot atoms in the excitedstate the resulting measurement reveals that there is a range of trappinglaser intensities where the excitedstate population of atoms in our mot follows the standard twolevel model intensitydependence however an experimentally determined effective saturation intensity must be used instead of the theoretically predicted value from the twolevel model we measured the effective saturation intensity to be i_mathrmse2293textrmmwtextrmcm2 for the typei na mot and i_mathrmse4897textrmmwtextrmcm2 for the typeii na mot approximately 17 and 36 times the theoretical estimate respectively lastly at large trappinglaser intensities our experiment reveals a clear departure from the twolevel model at a critical intensity that we believe is due to a statemixing effect whose critical intensity can be determined by a simple power broadening model | [['we', 'present', 'modelindependent', 'measurements', 'of', 'the', 'excitedstate', 'population', 'of', 'atoms', 'in', 'a', 'sodium', 'na', 'magnetooptical', 'trap', 'mot', 'using', 'a', 'hybrid', 'ionneutral', 'trap', 'composed', 'of', 'a', 'mot', 'and', 'a', 'linear', 'paul', 'trap', 'lpt', 'we', 'photoionize', 'excited', 'na', 'atoms', 'trapped', 'in', 'the', 'mot', 'and', 'use', 'two', 'independent', 'methods', 'to', 'measure', 'the', 'resulting', 'ions', 'directly', 'by', 'trapping', 'them', 'in', 'our', 'lpt', 'and', 'indirectly', 'by', 'monitoring', 'changes', 'in', 'mot', 'fluorescence', 'by', 'measuring', 'the', 'ionization', 'rate', 'via', 'these', 'two', 'independent', 'methods', 'we', 'have', 'enough', 'information', 'to', 'directly', 'determine', 'the', 'population', 'of', 'mot', 'atoms', 'in', 'the', 'excitedstate', 'the', 'resulting', 'measurement', 'reveals', 'that', 'there', 'is', 'a', 'range', 'of', 'trappinglaser', 'intensities', 'where', 'the', 'excitedstate', 'population', 'of', 'atoms', 'in', 'our', 'mot', 'follows', 'the', 'standard', 'twolevel', 'model', 'intensitydependence', 'however', 'an', 'experimentally', 'determined', 'effective', 'saturation', 'intensity', 'must', 'be', 'used', 'instead', 'of', 'the', 'theoretically', 'predicted', 'value', 'from', 'the', 'twolevel', 'model', 'we', 'measured', 'the', 'effective', 'saturation', 'intensity', 'to', 'be', 'i_mathrmse2293textrmmwtextrmcm2', 'for', 'the', 'typei', 'na', 'mot', 'and', 'i_mathrmse4897textrmmwtextrmcm2', 'for', 'the', 'typeii', 'na', 'mot', 'approximately', '17', 'and', '36', 'times', 'the', 'theoretical', 'estimate', 'respectively', 'lastly', 'at', 'large', 'trappinglaser', 'intensities', 'our', 'experiment', 'reveals', 'a', 'clear', 'departure', 'from', 'the', 'twolevel', 'model', 'at', 'a', 'critical', 'intensity', 'that', 'we', 'believe', 'is', 'due', 'to', 'a', 'statemixing', 'effect', 'whose', 'critical', 'intensity', 'can', 'be', 'determined', 'by', 'a', 'simple', 'power', 'broadening', 'model']] | [-0.008451838859785898, 0.17320827556966994, -0.02219389956169234, 0.023998878637742794, 0.06494601538147905, -0.1732723484609478, 0.09621922421932055, 0.4087666517738345, -0.2241662516282456, -0.305836537816181, 0.00627990856220753, -0.2856908195555724, -0.04861995865380979, 0.17837773414392924, -0.010881898828938126, 0.03308605738534716, 0.024922798406057465, -0.008909470649445292, -0.020339570168791146, -0.19646352823832866, 0.26121576086289977, 0.07480196613047657, 0.2731269121105815, 0.06537921105057294, 0.10412493951760893, -0.04760006418809515, 0.05182428997505475, 0.011330891918996578, -0.1158480365888079, 0.13950882088757846, 0.22248626259852916, 0.07726040654842974, 0.2508004276366363, -0.4281918861412356, -0.1937695261334147, 0.09650249634479434, 0.16739012497067773, 0.2036659201971838, -0.07661070211519821, -0.28927561999046303, -0.02078073460200407, -0.11189510526130976, -0.12095359899103642, -0.056136450023743616, 0.03624793680916939, 0.040523875835626916, -0.31527989447171906, 0.04897960751252065, 0.021958300155665487, 0.11491744271181341, -0.07981075793206509, -0.09500911158023247, 0.019684548291327257, 0.04667946212957132, -0.032493492248903945, 0.009465887378430994, 0.21965664296222878, -0.07594146868535157, -0.06187070539367977, 0.3949919516218395, -0.16493387797014705, -0.08865487687903333, 0.1556351042370968, -0.18279099851053007, -0.05300965248102441, 0.18117424074486999, 0.15422473545071527, 0.10978323331313768, -0.14186687295880224, 0.00703384355542117, -0.040344777583543746, 0.21289978252971553, 0.07716845863457457, 0.0245827343406642, 0.2027483676133558, 0.15084805260377987, 0.012734455656342833, 0.13216098086229466, -0.1853476133820626, -0.06996969102554682, -0.2281912413283522, -0.1061746285983999, -0.18847942799146244, 0.02754507880552392, -0.06548293832532678, -0.08313517133691554, 0.4051520710104498, 0.14151492037493826, 0.21625108436309717, -0.03955969041479485, 0.30657158919789007, 0.16126386072885776, 0.055052885345843953, 0.027621486054485656, 0.30855480676948144, 0.12794893504730587, 0.0721511277762985, -0.3269834771013722, 0.0329171162708823, 0.016056468698833818] |
1,802.05307 | Mean-field equation for a stochastic many-particle model of
quorum-sensing microbial populations | We prove a mean-field equation for the dynamics of quorum-sensing microbial
populations. In the stochastic many-particle process, individuals of a
population produce public good molecules to different degrees. Individual
production is metabolically costly such that non-producers replicate faster
than producers. In addition, individuals sense the average production level in
the well-mixed population and adjust their production in response ("quorum
sensing"). Here we prove that the temporal evolution of such quorum-sensing
populations converges to a macroscopic mean-field equation for increasing
population sizes. To prove convergence, we introduce an auxiliary stochastic
mean-field process that mimics the dynamics of the mean-field equation and that
samples independently the individual's production degrees between consecutive
update steps. This way, the law of large numbers is separated from the
propagation of errors due to correlations. Our developed method of an auxiliary
stochastic mean-field process may help to prove mean-field equations for other
stochastic many-particle processes.
| math-ph math.MP physics.bio-ph | we prove a meanfield equation for the dynamics of quorumsensing microbial populations in the stochastic manyparticle process individuals of a population produce public good molecules to different degrees individual production is metabolically costly such that nonproducers replicate faster than producers in addition individuals sense the average production level in the wellmixed population and adjust their production in response quorum sensing here we prove that the temporal evolution of such quorumsensing populations converges to a macroscopic meanfield equation for increasing population sizes to prove convergence we introduce an auxiliary stochastic meanfield process that mimics the dynamics of the meanfield equation and that samples independently the individuals production degrees between consecutive update steps this way the law of large numbers is separated from the propagation of errors due to correlations our developed method of an auxiliary stochastic meanfield process may help to prove meanfield equations for other stochastic manyparticle processes | [['we', 'prove', 'a', 'meanfield', 'equation', 'for', 'the', 'dynamics', 'of', 'quorumsensing', 'microbial', 'populations', 'in', 'the', 'stochastic', 'manyparticle', 'process', 'individuals', 'of', 'a', 'population', 'produce', 'public', 'good', 'molecules', 'to', 'different', 'degrees', 'individual', 'production', 'is', 'metabolically', 'costly', 'such', 'that', 'nonproducers', 'replicate', 'faster', 'than', 'producers', 'in', 'addition', 'individuals', 'sense', 'the', 'average', 'production', 'level', 'in', 'the', 'wellmixed', 'population', 'and', 'adjust', 'their', 'production', 'in', 'response', 'quorum', 'sensing', 'here', 'we', 'prove', 'that', 'the', 'temporal', 'evolution', 'of', 'such', 'quorumsensing', 'populations', 'converges', 'to', 'a', 'macroscopic', 'meanfield', 'equation', 'for', 'increasing', 'population', 'sizes', 'to', 'prove', 'convergence', 'we', 'introduce', 'an', 'auxiliary', 'stochastic', 'meanfield', 'process', 'that', 'mimics', 'the', 'dynamics', 'of', 'the', 'meanfield', 'equation', 'and', 'that', 'samples', 'independently', 'the', 'individuals', 'production', 'degrees', 'between', 'consecutive', 'update', 'steps', 'this', 'way', 'the', 'law', 'of', 'large', 'numbers', 'is', 'separated', 'from', 'the', 'propagation', 'of', 'errors', 'due', 'to', 'correlations', 'our', 'developed', 'method', 'of', 'an', 'auxiliary', 'stochastic', 'meanfield', 'process', 'may', 'help', 'to', 'prove', 'meanfield', 'equations', 'for', 'other', 'stochastic', 'manyparticle', 'processes']] | [-0.09223767599040592, 0.16760563651100588, -0.11047293068023047, 0.11650499630764603, -0.014793518018229184, -0.12844462677949686, 0.08307035159118273, 0.3298732423903169, -0.3275331654711752, -0.2726866858633789, -0.001987032057415392, -0.29260567649317953, -0.13435561579850352, 0.10455728283567303, -0.053101890154082225, 0.009874180664081831, 0.08257870858132436, -0.008521224825164757, 0.057698471572350814, -0.25847148884094096, 0.2792625726258455, 0.023584155718217027, 0.26679455673611546, -0.04416998316584205, 0.14875909887455604, 0.012984131239480464, 0.02111204107436729, -0.016774391472289287, -0.10736421760540563, 0.09455672589231383, 0.24814022431854862, 0.1179255010446886, 0.3397379651086757, -0.4755922917817795, -0.22239567574689392, 0.14039136402032062, 0.2015670555874995, 0.18130008984715804, -0.041593942018792136, -0.26289606377532754, 0.02095364292963987, -0.18224128171474346, -0.1884134766422338, -0.07507848534795984, 0.000927301705814898, 0.10004314925911761, -0.3046853060494303, 0.12305703824008438, 0.014855961981575584, 0.07329394385797551, -0.055015049229778755, -0.10624449685014584, -0.0459795793238398, 0.14943558219002206, 0.03350794651467712, -0.03697856676326656, 0.17823305340386247, -0.13373982394428774, -0.12745919242277867, 0.3124573313933168, -0.06556396446447596, -0.20059224347130875, 0.22241726519250488, -0.145293366855185, -0.1487504894864066, 0.12803331460501696, 0.21336356206715257, 0.12481081501897967, -0.22428752093204624, 0.023220972569401352, 0.0029472524042216106, 0.1872018576612243, 0.012516193772269715, 0.028619754438074557, 0.12198464973275927, 0.2045978280161885, 0.08065448114270898, 0.09512703732596836, -0.03367844049982425, -0.22513672111027344, -0.24184238411662345, -0.12496611259946902, -0.12482116848696023, 0.0999765890002301, -0.11412777282227604, -0.17137328067769272, 0.3398324725740413, 0.2004249148217118, 0.14414941194165196, 0.12039596911494595, 0.264673350265602, 0.1304018354221134, 0.011614958291583872, 0.06604042499502366, 0.18236782965313242, 0.12491954688133823, 0.08577905288217841, -0.2693546794093768, 0.13740655262891605, 0.03747882424992182] |
1,802.05308 | On a Vector-host Epidemic Model with Spatial Structure | In this paper, we study a reaction-diffusion vector-host epidemic model. We
define the basic reproduction number $R_0$ and show that $R_0$ is a threshold
parameter: if $R_0\le 1$ the disease free steady state is globally stable; if
$R_0>1$ the model has a unique globally stable positive steady state. We then
write $R_0$ as the spectral radius of the product of one multiplicative
operator $R(x)$ and two compact operators with spectral radius equalling one.
Here $R(x)$ corresponds to the basic reproduction number of the model without
diffusion and is thus called local basic reproduction number. We study the
relationship between $R_0$ and $R(x)$ as the diffusion rates vary.
| math.AP | in this paper we study a reactiondiffusion vectorhost epidemic model we define the basic reproduction number r_0 and show that r_0 is a threshold parameter if r_0le 1 the disease free steady state is globally stable if r_01 the model has a unique globally stable positive steady state we then write r_0 as the spectral radius of the product of one multiplicative operator rx and two compact operators with spectral radius equalling one here rx corresponds to the basic reproduction number of the model without diffusion and is thus called local basic reproduction number we study the relationship between r_0 and rx as the diffusion rates vary | [['in', 'this', 'paper', 'we', 'study', 'a', 'reactiondiffusion', 'vectorhost', 'epidemic', 'model', 'we', 'define', 'the', 'basic', 'reproduction', 'number', 'r_0', 'and', 'show', 'that', 'r_0', 'is', 'a', 'threshold', 'parameter', 'if', 'r_0le', '1', 'the', 'disease', 'free', 'steady', 'state', 'is', 'globally', 'stable', 'if', 'r_01', 'the', 'model', 'has', 'a', 'unique', 'globally', 'stable', 'positive', 'steady', 'state', 'we', 'then', 'write', 'r_0', 'as', 'the', 'spectral', 'radius', 'of', 'the', 'product', 'of', 'one', 'multiplicative', 'operator', 'rx', 'and', 'two', 'compact', 'operators', 'with', 'spectral', 'radius', 'equalling', 'one', 'here', 'rx', 'corresponds', 'to', 'the', 'basic', 'reproduction', 'number', 'of', 'the', 'model', 'without', 'diffusion', 'and', 'is', 'thus', 'called', 'local', 'basic', 'reproduction', 'number', 'we', 'study', 'the', 'relationship', 'between', 'r_0', 'and', 'rx', 'as', 'the', 'diffusion', 'rates', 'vary']] | [-0.15038101801737433, 0.12080957745645372, -0.04910871526669888, 0.0664565798272157, -0.029400041879021694, -0.19749018069622773, 0.036405523911872434, 0.3376848734416334, -0.2912939994108109, -0.19720686279414665, 0.14341479227046616, -0.268769433313892, -0.14389933484296005, 0.14276485906337344, -0.039682032332001696, -0.010332473779895476, 0.02855629871732422, 0.13415319490290822, -0.005912328349603783, -0.20092389254520338, 0.365877463322665, 0.022526050447708085, 0.2087227579960156, 0.01983152957012256, 0.10731316297536804, -0.024404709950266848, 0.008068188834225847, 0.013196722027801332, -0.22092969053282147, 0.03640818122685665, 0.18116038293755127, 0.18387751664877647, 0.29375578746909187, -0.34361185181353776, -0.18737883878250916, 0.18754881074918167, 0.15653563251807576, 0.06955909934144335, 0.03165182042645202, -0.17772343069802793, 0.1251921199572583, -0.22666340196904328, -0.20098367113442647, -0.012006722656743867, 0.08682550950020197, 0.07127513527160599, -0.28225741169991947, 0.11928804613028963, 0.013962068854432021, 0.0369300047733954, -0.08853094623024975, -0.0785763696013462, -0.06542485752808196, 0.13305629797812019, 0.04643133797882391, 0.01967848038101303, 0.1245352793662321, -0.11505304919777527, -0.039039690065241994, 0.29590687940695454, -0.04926670448233684, -0.20601875868936378, 0.1495653813882243, -0.16946889378928712, -0.083135986328125, 0.0998690845799588, 0.12363649045250245, 0.13034928478300573, -0.11974409659437481, 0.07220094408174711, -0.07749899270323415, 0.22424130918724197, 0.058456443134872686, 0.02128598564526155, 0.13318030655029275, 0.19775226851481767, 0.1110248362911599, 0.07048291932525379, -0.09375164121211994, -0.09989027402008928, -0.3288493058865979, -0.1469036092272117, -0.13237040543130466, 0.11197440927471256, -0.13178453713245247, -0.1686606109053606, 0.41337735086147276, 0.10122623895960195, 0.22195714939651745, 0.08589855738516365, 0.25998402308628316, 0.11902724243700505, -0.01872986265946002, 0.1004404896232743, 0.16717940065566272, 0.18042592774283894, 0.03753480608020687, -0.24448157609218643, 0.0806117476540662, 0.08927874756267383] |
1,802.05309 | The Dynamical Mordell-Lang Conjecture for endomorphisms of semiabelian
varieties defined over fields of positive characteristic | Let K be an algebraically closed field of prime characteristic p, let X be a
semiabelian variety defined over a finite subfield of K, let f be a regular
self-map on X defined over K, let V be a subvariety of X defined over K, and
let x be a K-point of X. The Dynamical Mordell-Lang Conjecture in
characteristic p predicts that the set S consisting of all positive integers n
for which f^n(x) lies on V is a union of finitely many arithmetic progressions,
along with finitely many p-sets, which are sets consisting of all integers of
the form c_1 p^{k_1 n_1} + ... + c_m p^{k_m n_m} (as we vary n_1,..,n_m among
all positive integers), for some given positive integer m, some rational
numbers c_i and some non-negative integers k_i. We prove that this conjecture
is equivalent with some difficult Diophantine problem in characteristic 0. In
the case X is an algebraic torus, we can prove the conjecture in two cases:
either when the dimension of V is at most 2, or when no iterate of f is a group
endomorphism which induces the action of a power of the Frobenius on a positive
dimensional algebraic subgroup of X.
| math.NT math.AG math.DS math.LO | let k be an algebraically closed field of prime characteristic p let x be a semiabelian variety defined over a finite subfield of k let f be a regular selfmap on x defined over k let v be a subvariety of x defined over k and let x be a kpoint of x the dynamical mordelllang conjecture in characteristic p predicts that the set s consisting of all positive integers n for which fnx lies on v is a union of finitely many arithmetic progressions along with finitely many psets which are sets consisting of all integers of the form c_1 pk_1 n_1 c_m pk_m n_m as we vary n_1n_m among all positive integers for some given positive integer m some rational numbers c_i and some nonnegative integers k_i we prove that this conjecture is equivalent with some difficult diophantine problem in characteristic 0 in the case x is an algebraic torus we can prove the conjecture in two cases either when the dimension of v is at most 2 or when no iterate of f is a group endomorphism which induces the action of a power of the frobenius on a positive dimensional algebraic subgroup of x | [['let', 'k', 'be', 'an', 'algebraically', 'closed', 'field', 'of', 'prime', 'characteristic', 'p', 'let', 'x', 'be', 'a', 'semiabelian', 'variety', 'defined', 'over', 'a', 'finite', 'subfield', 'of', 'k', 'let', 'f', 'be', 'a', 'regular', 'selfmap', 'on', 'x', 'defined', 'over', 'k', 'let', 'v', 'be', 'a', 'subvariety', 'of', 'x', 'defined', 'over', 'k', 'and', 'let', 'x', 'be', 'a', 'kpoint', 'of', 'x', 'the', 'dynamical', 'mordelllang', 'conjecture', 'in', 'characteristic', 'p', 'predicts', 'that', 'the', 'set', 's', 'consisting', 'of', 'all', 'positive', 'integers', 'n', 'for', 'which', 'fnx', 'lies', 'on', 'v', 'is', 'a', 'union', 'of', 'finitely', 'many', 'arithmetic', 'progressions', 'along', 'with', 'finitely', 'many', 'psets', 'which', 'are', 'sets', 'consisting', 'of', 'all', 'integers', 'of', 'the', 'form', 'c_1', 'pk_1', 'n_1', 'c_m', 'pk_m', 'n_m', 'as', 'we', 'vary', 'n_1n_m', 'among', 'all', 'positive', 'integers', 'for', 'some', 'given', 'positive', 'integer', 'm', 'some', 'rational', 'numbers', 'c_i', 'and', 'some', 'nonnegative', 'integers', 'k_i', 'we', 'prove', 'that', 'this', 'conjecture', 'is', 'equivalent', 'with', 'some', 'difficult', 'diophantine', 'problem', 'in', 'characteristic', '0', 'in', 'the', 'case', 'x', 'is', 'an', 'algebraic', 'torus', 'we', 'can', 'prove', 'the', 'conjecture', 'in', 'two', 'cases', 'either', 'when', 'the', 'dimension', 'of', 'v', 'is', 'at', 'most', '2', 'or', 'when', 'no', 'iterate', 'of', 'f', 'is', 'a', 'group', 'endomorphism', 'which', 'induces', 'the', 'action', 'of', 'a', 'power', 'of', 'the', 'frobenius', 'on', 'a', 'positive', 'dimensional', 'algebraic', 'subgroup', 'of', 'x']] | [-0.294786092502122, 0.13348576695582834, -0.06250584752973626, -0.03669268048691506, -0.040491638372519186, -0.21782971021056421, -0.010167046193489614, 0.3125002131303202, -0.3461580985060617, -0.17848321894297794, 0.03259812114161572, -0.2920392055446947, -0.08014987862303055, 0.22977359281681783, -0.08000180359967814, -0.07061058308570456, -0.009861328152046368, 0.1765291085015336, -0.06131248040438383, -0.3526759714230287, 0.35429437499616906, -0.16255358668467107, 0.11373594448645125, 0.0415291853892921, 0.10666389100500667, -0.009570579997225836, 0.062391771345722435, 0.037929953568399635, -0.14954843458267253, 0.06987051329900967, 0.33909956062668745, 0.12141689786340623, 0.30849899075051046, -0.3214923749126646, -0.1578348618427206, 0.28701882382940347, 0.16601793666142134, -0.10521693425003573, 0.014538148784539568, -0.19434861806090636, 0.21711458760665311, -0.10477893306322549, -0.14065533134211994, -0.03375266953751597, 0.17677605680810116, 0.027213224598292108, -0.33587964670257453, -0.04043088496866997, 0.10318220793718011, 0.1700155153837618, -0.013815501460102292, -0.20370623544309935, -0.051486897333382575, 0.0372310229122748, -0.011787779937567765, 0.12863671514728314, 0.0460049404135468, -0.03127830626838157, -0.07292574838742885, 0.36646593243064246, -0.09004344672085812, -0.2130812756070981, 0.08083009874277121, -0.20493885399346068, -0.1287868916275626, 0.16121682704412094, 0.09216253487725876, 0.19217271583953074, 0.025310663158776076, 0.264138312943218, -0.19229455083627633, 0.124539502232326, 0.11378424057062259, -0.010208603601109199, 0.190791617530132, 0.02480703081736075, 0.08448044896216075, 0.09389306995863266, 0.022419960940095157, 0.05957364594345266, -0.37466662721613386, -0.15618090000483492, -0.17044011857990193, 0.265566467844444, -0.13695742338120687, -0.1778954860435951, 0.35559402416194125, 0.04312781246981289, 0.21680849762775992, 0.11732259106058188, 0.19079510671827865, 0.07441144556940678, -0.0028593975252338816, 0.086708451227813, -0.03764650964223286, 0.20953445794174866, -0.09139970853231011, -0.12940062080956616, 0.036771127799696914, 0.1497821305172841] |
1,802.0531 | Double Indirect Interlayer Exciton in a MoSe2/WSe2 van der Waals
Heterostructure | An emerging class of semiconductor heterostructures involves stacking
discrete monolayers such as the transition metal dichalcogenides (TMDs) to form
van der Waals heterostructures. In these structures, it is possible to create
interlayer excitons (ILEs), spatially indirect, bound electron-hole pairs with
the electron in one TMD layer and the hole in an adjacent layer. We are able to
clearly resolve two distinct emission peaks separated by 24 meV from an ILE in
a MoSe2/WSe2 heterostructure fabricated using state-of-the-art preparation
techniques. These peaks have nearly equal intensity, indicating they are of
common character, and have opposite circular polarizations when excited with
circularly polarized light. Ab initio calculations successfully account for
these observations - they show that both emission features originate from
excitonic transitions that are indirect in momentum space, are split by
spin-orbit coupling, and that including interlayer hybridization is essential
in correctly describing the ILE transition. Although well separated in momentum
space, we find that in real space the electron has significant weight in both
the MoSe2 and WSe2 layers, contrary to the commonly assumed model. This is a
significant consideration for understanding the static and dynamic properties
of TMD heterostructures.
| cond-mat.mtrl-sci | an emerging class of semiconductor heterostructures involves stacking discrete monolayers such as the transition metal dichalcogenides tmds to form van der waals heterostructures in these structures it is possible to create interlayer excitons iles spatially indirect bound electronhole pairs with the electron in one tmd layer and the hole in an adjacent layer we are able to clearly resolve two distinct emission peaks separated by 24 mev from an ile in a mose2wse2 heterostructure fabricated using stateoftheart preparation techniques these peaks have nearly equal intensity indicating they are of common character and have opposite circular polarizations when excited with circularly polarized light ab initio calculations successfully account for these observations they show that both emission features originate from excitonic transitions that are indirect in momentum space are split by spinorbit coupling and that including interlayer hybridization is essential in correctly describing the ile transition although well separated in momentum space we find that in real space the electron has significant weight in both the mose2 and wse2 layers contrary to the commonly assumed model this is a significant consideration for understanding the static and dynamic properties of tmd heterostructures | [['an', 'emerging', 'class', 'of', 'semiconductor', 'heterostructures', 'involves', 'stacking', 'discrete', 'monolayers', 'such', 'as', 'the', 'transition', 'metal', 'dichalcogenides', 'tmds', 'to', 'form', 'van', 'der', 'waals', 'heterostructures', 'in', 'these', 'structures', 'it', 'is', 'possible', 'to', 'create', 'interlayer', 'excitons', 'iles', 'spatially', 'indirect', 'bound', 'electronhole', 'pairs', 'with', 'the', 'electron', 'in', 'one', 'tmd', 'layer', 'and', 'the', 'hole', 'in', 'an', 'adjacent', 'layer', 'we', 'are', 'able', 'to', 'clearly', 'resolve', 'two', 'distinct', 'emission', 'peaks', 'separated', 'by', '24', 'mev', 'from', 'an', 'ile', 'in', 'a', 'mose2wse2', 'heterostructure', 'fabricated', 'using', 'stateoftheart', 'preparation', 'techniques', 'these', 'peaks', 'have', 'nearly', 'equal', 'intensity', 'indicating', 'they', 'are', 'of', 'common', 'character', 'and', 'have', 'opposite', 'circular', 'polarizations', 'when', 'excited', 'with', 'circularly', 'polarized', 'light', 'ab', 'initio', 'calculations', 'successfully', 'account', 'for', 'these', 'observations', 'they', 'show', 'that', 'both', 'emission', 'features', 'originate', 'from', 'excitonic', 'transitions', 'that', 'are', 'indirect', 'in', 'momentum', 'space', 'are', 'split', 'by', 'spinorbit', 'coupling', 'and', 'that', 'including', 'interlayer', 'hybridization', 'is', 'essential', 'in', 'correctly', 'describing', 'the', 'ile', 'transition', 'although', 'well', 'separated', 'in', 'momentum', 'space', 'we', 'find', 'that', 'in', 'real', 'space', 'the', 'electron', 'has', 'significant', 'weight', 'in', 'both', 'the', 'mose2', 'and', 'wse2', 'layers', 'contrary', 'to', 'the', 'commonly', 'assumed', 'model', 'this', 'is', 'a', 'significant', 'consideration', 'for', 'understanding', 'the', 'static', 'and', 'dynamic', 'properties', 'of', 'tmd', 'heterostructures']] | [-0.11937665899047657, 0.1733342285545034, -0.020284955456012752, 0.04667375996960179, -0.008835363233364655, -0.18121894665811428, 0.0248689045932479, 0.49938385625660575, -0.2561426107037477, -0.2932104158101889, -0.06829850046917618, -0.339965478626601, -0.14195941292210212, 0.17250001643138824, 0.07426311185727605, 0.00833252891553221, -0.00016620698712628196, -0.1426527484950841, -0.06142419294199152, -0.18474598346347673, 0.3353059059316933, -0.022298892139501515, 0.31206720920338754, 0.09542887199610944, 0.019088496408479476, -0.0016881949810321054, 0.08500917580855823, -0.014465353454594997, -0.1350590051208788, 0.07014051834170623, 0.3046637926504469, -0.09644655383157509, 0.2226730451091296, -0.463799558589777, -0.19763556264880452, 0.004690597536012767, 0.16190415830967367, 0.13646524865673018, -0.07749164315364349, -0.28320680284705113, 0.04889482536929704, -0.1419768702268364, -0.045053747896518975, -0.08887972018130803, 0.01486904303686171, 0.025752138265127702, -0.2418530766640312, 0.0786741377007236, 0.05090118390347848, -0.00017269080981061543, -0.0867156749837613, -0.1489805785677933, -0.110758187193867, 0.08584819738238818, 0.028901773914522318, 0.046268567164482736, 0.1484285515533494, -0.10088642619466458, -0.12461860329356222, 0.3733143770337972, -0.057831576535054455, -0.10093413786617694, 0.1826021475027557, -0.17434354584538453, -0.07707132559476627, 0.1715904680430574, 0.12440041315904449, 0.1092553245662539, -0.11742874245670878, 0.055039603480879495, -0.02763523430460029, 0.18027627838851895, 0.10270772421721458, 0.11885251651306158, 0.2840260223007549, 0.12978050391381932, 0.005251256113369313, 0.07120946860039438, -0.11835685301702667, -0.06483022763582301, -0.1973593150704074, -0.17193806476098925, -0.22624563491070476, 0.07716292710038562, -0.04948289284355404, -0.2027925212261459, 0.3883578345024337, 0.11293211205069113, 0.19588273556018496, -0.06893043188999097, 0.2723767292185652, 0.10833211728216459, 0.11258374749332982, 0.024075483666762473, 0.3038985703624637, 0.1409426157925741, 0.052274496290862324, -0.18391613575270171, 0.06582584866663199, -0.01994682537766282] |
1,802.05311 | Dynamic Surface Modification due to Effusion of Na in Na$_2$IrO$_3$ | The honeycomb lattice iridate Na$_2$IrO$_3$ shows frustrated magnetism and
can potentially display Kitaev-like exchange interactions. Recently, it was
shown that the electronic properties of the surface of crystalline
Na$_2$IrO$_3$ can be tuned by Ar plasma treatment in a controlled manner
leading to various phases of matter ranging from a fully gapped to a metallic
surface, where the possibility of a charge-density wave (CDW) like transition
is also expected. Here, through direct imaging with an atomic force microscope
(AFM) in air, we show that the surface of crystalline Na$_2$IrO$_3$ evolves
rapidly as elemental Na effuses out of the interleave planes to the surface and
undergoes sublimation thereby disappearing from the surface gradually over
time. Using conductive AFM we recorded a series of topographs and surface
current maps simultaneously and found that the modification of the surface
leads to change in the electronic properties in a dynamic fashion until the
whole system reaches a dynamic equilibrium. These observations are important in
the context of the exotic electronic and magnetic properties that the surface
of Na$_2$IrO$_3$ displays.
| cond-mat.mtrl-sci | the honeycomb lattice iridate na_2iro_3 shows frustrated magnetism and can potentially display kitaevlike exchange interactions recently it was shown that the electronic properties of the surface of crystalline na_2iro_3 can be tuned by ar plasma treatment in a controlled manner leading to various phases of matter ranging from a fully gapped to a metallic surface where the possibility of a chargedensity wave cdw like transition is also expected here through direct imaging with an atomic force microscope afm in air we show that the surface of crystalline na_2iro_3 evolves rapidly as elemental na effuses out of the interleave planes to the surface and undergoes sublimation thereby disappearing from the surface gradually over time using conductive afm we recorded a series of topographs and surface current maps simultaneously and found that the modification of the surface leads to change in the electronic properties in a dynamic fashion until the whole system reaches a dynamic equilibrium these observations are important in the context of the exotic electronic and magnetic properties that the surface of na_2iro_3 displays | [['the', 'honeycomb', 'lattice', 'iridate', 'na_2iro_3', 'shows', 'frustrated', 'magnetism', 'and', 'can', 'potentially', 'display', 'kitaevlike', 'exchange', 'interactions', 'recently', 'it', 'was', 'shown', 'that', 'the', 'electronic', 'properties', 'of', 'the', 'surface', 'of', 'crystalline', 'na_2iro_3', 'can', 'be', 'tuned', 'by', 'ar', 'plasma', 'treatment', 'in', 'a', 'controlled', 'manner', 'leading', 'to', 'various', 'phases', 'of', 'matter', 'ranging', 'from', 'a', 'fully', 'gapped', 'to', 'a', 'metallic', 'surface', 'where', 'the', 'possibility', 'of', 'a', 'chargedensity', 'wave', 'cdw', 'like', 'transition', 'is', 'also', 'expected', 'here', 'through', 'direct', 'imaging', 'with', 'an', 'atomic', 'force', 'microscope', 'afm', 'in', 'air', 'we', 'show', 'that', 'the', 'surface', 'of', 'crystalline', 'na_2iro_3', 'evolves', 'rapidly', 'as', 'elemental', 'na', 'effuses', 'out', 'of', 'the', 'interleave', 'planes', 'to', 'the', 'surface', 'and', 'undergoes', 'sublimation', 'thereby', 'disappearing', 'from', 'the', 'surface', 'gradually', 'over', 'time', 'using', 'conductive', 'afm', 'we', 'recorded', 'a', 'series', 'of', 'topographs', 'and', 'surface', 'current', 'maps', 'simultaneously', 'and', 'found', 'that', 'the', 'modification', 'of', 'the', 'surface', 'leads', 'to', 'change', 'in', 'the', 'electronic', 'properties', 'in', 'a', 'dynamic', 'fashion', 'until', 'the', 'whole', 'system', 'reaches', 'a', 'dynamic', 'equilibrium', 'these', 'observations', 'are', 'important', 'in', 'the', 'context', 'of', 'the', 'exotic', 'electronic', 'and', 'magnetic', 'properties', 'that', 'the', 'surface', 'of', 'na_2iro_3', 'displays']] | [-0.13218831621457666, 0.22111356422122408, -0.09282300666255898, -0.005946439429121684, -0.026456346766953978, -0.10754716782050067, 0.06793516975419725, 0.4040264818962728, -0.2959506600140325, -0.30752368957730214, 0.03967930419529341, -0.3104389776513411, -0.17568289353162309, 0.18100754611161834, 0.043659115623937775, 0.014266008999600073, -0.023111234717824728, -0.03002214601473355, -0.12609414228728053, -0.20049755714868728, 0.271638498076297, 0.028372890735179658, 0.28211773298626946, 0.07293064654616348, 0.045651663035205486, -0.00923931740603384, 0.093666331386806, 0.06551099119178354, -0.14299164612811513, 0.056724932517134986, 0.24499322592840675, -0.039813461623321465, 0.17777674802245216, -0.4897812445664165, -0.2346640982430924, -0.004965728742334281, 0.12230280432661704, 0.1275662998265097, -0.06871730394424558, -0.2829805476472557, 0.04396501241381027, -0.1512313325851725, -0.1175922932011759, -0.10271240297080464, -0.013526882034204255, -6.784847802940131e-06, -0.2235701279082158, 0.07905254178028419, 0.05047272640748778, 0.10093848996343512, -0.12204879553143387, -0.06272724383534875, -0.13473100798820936, 0.0956106114973761, 0.0374307874543054, 0.07928072148530255, 0.18207333667602152, -0.12855892820550247, -0.08028029830523395, 0.3874605330557837, -0.06381932997670983, -0.054320789717482346, 0.212912930669586, -0.1801738769874667, -0.062369295405331635, 0.21156731995113323, 0.1162673701166116, 0.07063684379513714, -0.12768406732104762, 0.061560437603748665, -0.017591310109094597, 0.19077427629946672, 0.029654375321872404, 0.05356735716751545, 0.28093647473421746, 0.21401575667719017, 0.06142662280115348, 0.1608742344189123, -0.14405994071770525, -0.0452919724085126, -0.18845596784073726, -0.19742003858164814, -0.19120776183456398, 0.031359503146868625, -0.04821995724535297, -0.21462867897043592, 0.39290214331034634, 0.12144974393519772, 0.18394128365086854, -0.10041327779908056, 0.23513691170098033, 0.04953565878855506, 0.05946792236857676, 0.018639132516079102, 0.25396204677092804, 0.1377039207508949, 0.1199304265410214, -0.265972491951304, 0.09549938465301701, 0.020381206361243145] |
1,802.05312 | Learning Deep Disentangled Embeddings with the F-Statistic Loss | Deep-embedding methods aim to discover representations of a domain that make
explicit the domain's class structure and thereby support few-shot learning.
Disentangling methods aim to make explicit compositional or factorial
structure. We combine these two active but independent lines of research and
propose a new paradigm suitable for both goals. We propose and evaluate a novel
loss function based on the $F$ statistic, which describes the separation of two
or more distributions. By ensuring that distinct classes are well separated on
a subset of embedding dimensions, we obtain embeddings that are useful for
few-shot learning. By not requiring separation on all dimensions, we encourage
the discovery of disentangled representations. Our embedding method matches or
beats state-of-the-art, as evaluated by performance on recall@$k$ and few-shot
learning tasks. Our method also obtains performance superior to a variety of
alternatives on disentangling, as evaluated by two key properties of a
disentangled representation: modularity and explicitness. The goal of our work
is to obtain more interpretable, manipulable, and generalizable deep
representations of concepts and categories.
| cs.LG cs.AI stat.ML | deepembedding methods aim to discover representations of a domain that make explicit the domains class structure and thereby support fewshot learning disentangling methods aim to make explicit compositional or factorial structure we combine these two active but independent lines of research and propose a new paradigm suitable for both goals we propose and evaluate a novel loss function based on the f statistic which describes the separation of two or more distributions by ensuring that distinct classes are well separated on a subset of embedding dimensions we obtain embeddings that are useful for fewshot learning by not requiring separation on all dimensions we encourage the discovery of disentangled representations our embedding method matches or beats stateoftheart as evaluated by performance on recallk and fewshot learning tasks our method also obtains performance superior to a variety of alternatives on disentangling as evaluated by two key properties of a disentangled representation modularity and explicitness the goal of our work is to obtain more interpretable manipulable and generalizable deep representations of concepts and categories | [['deepembedding', 'methods', 'aim', 'to', 'discover', 'representations', 'of', 'a', 'domain', 'that', 'make', 'explicit', 'the', 'domains', 'class', 'structure', 'and', 'thereby', 'support', 'fewshot', 'learning', 'disentangling', 'methods', 'aim', 'to', 'make', 'explicit', 'compositional', 'or', 'factorial', 'structure', 'we', 'combine', 'these', 'two', 'active', 'but', 'independent', 'lines', 'of', 'research', 'and', 'propose', 'a', 'new', 'paradigm', 'suitable', 'for', 'both', 'goals', 'we', 'propose', 'and', 'evaluate', 'a', 'novel', 'loss', 'function', 'based', 'on', 'the', 'f', 'statistic', 'which', 'describes', 'the', 'separation', 'of', 'two', 'or', 'more', 'distributions', 'by', 'ensuring', 'that', 'distinct', 'classes', 'are', 'well', 'separated', 'on', 'a', 'subset', 'of', 'embedding', 'dimensions', 'we', 'obtain', 'embeddings', 'that', 'are', 'useful', 'for', 'fewshot', 'learning', 'by', 'not', 'requiring', 'separation', 'on', 'all', 'dimensions', 'we', 'encourage', 'the', 'discovery', 'of', 'disentangled', 'representations', 'our', 'embedding', 'method', 'matches', 'or', 'beats', 'stateoftheart', 'as', 'evaluated', 'by', 'performance', 'on', 'recallk', 'and', 'fewshot', 'learning', 'tasks', 'our', 'method', 'also', 'obtains', 'performance', 'superior', 'to', 'a', 'variety', 'of', 'alternatives', 'on', 'disentangling', 'as', 'evaluated', 'by', 'two', 'key', 'properties', 'of', 'a', 'disentangled', 'representation', 'modularity', 'and', 'explicitness', 'the', 'goal', 'of', 'our', 'work', 'is', 'to', 'obtain', 'more', 'interpretable', 'manipulable', 'and', 'generalizable', 'deep', 'representations', 'of', 'concepts', 'and', 'categories']] | [-0.04375924799207817, 0.01522123118972077, -0.09681637194007635, 0.07917401567991714, -0.12436243895824779, -0.16792549877975355, 0.03699273765361046, 0.4405398759552661, -0.2546654259594267, -0.3129956616188043, 0.06624784548629951, -0.22980148133219164, -0.18226700025774978, 0.22482910074622314, -0.08847739113878239, 0.03592556445475887, 0.08881986960220863, 0.030042103221913908, -0.09923945640022044, -0.26871777917258444, 0.3778296121135902, -0.017054906176738716, 0.33380631438733815, 0.019381947900332947, 0.1355534232372199, -0.015353258301997009, -0.04572932721827837, 0.00782788286314291, -0.07260067873178153, 0.23932598826530224, 0.2952285835546825, 0.19921435520274614, 0.2896726022899041, -0.35312413606135284, -0.22893344293731976, 0.0753213836975834, 0.14476064050446866, 0.06671268426032517, -0.04733430865607635, -0.31793929452953096, 0.09862151075811947, -0.15917116109528304, -0.024083987521076138, -0.22648647909107453, -0.029942237761090784, -0.01712934632840402, -0.286368329571697, 0.00830434804682976, 0.11173888412543902, 0.049649950935888816, -0.06611864115248489, -0.16319235470556817, 0.06003019001663608, 0.16428320294465212, 0.02153145632953109, 0.03829795824610354, 0.10165696603739087, -0.17302294631094006, -0.1583428705604199, 0.3401053253862569, -0.06488029995166203, -0.22176611396785387, 0.26881022487958783, -0.042802108446245685, -0.1538389977889464, 0.06275408255374607, 0.21328153771293515, 0.16346259295960944, -0.13692789418033927, 0.015926978110185112, -0.014059568018488148, 0.16849157237516277, 0.043329531294019785, 0.018052668065544876, 0.20127843152868616, 0.2032845165279201, 0.05714253387687837, 0.1530082149119527, -0.06885380955166458, -0.053533903983257275, -0.26017946358770133, -0.14399892296642064, -0.175899852567818, -0.011451288193433464, -0.0789373830667019, -0.13591134803753127, 0.43677257461582913, 0.19011019795503029, 0.2448404790559674, 0.10691382279688054, 0.3130885552286225, 0.013221566261970165, 0.07641082401387393, 0.08015869995853042, 0.16630088683656033, 0.058833879020119856, 0.028837658144424065, -0.15136751231038942, 0.08726755575249519, 0.0837948343333076] |
1,802.05313 | Reinforcement Learning from Imperfect Demonstrations | Robust real-world learning should benefit from both demonstrations and
interactions with the environment. Current approaches to learning from
demonstration and reward perform supervised learning on expert demonstration
data and use reinforcement learning to further improve performance based on the
reward received from the environment. These tasks have divergent losses which
are difficult to jointly optimize and such methods can be very sensitive to
noisy demonstrations. We propose a unified reinforcement learning algorithm,
Normalized Actor-Critic (NAC), that effectively normalizes the Q-function,
reducing the Q-values of actions unseen in the demonstration data. NAC learns
an initial policy network from demonstrations and refines the policy in the
environment, surpassing the demonstrator's performance. Crucially, both
learning from demonstration and interactive refinement use the same objective,
unlike prior approaches that combine distinct supervised and reinforcement
losses. This makes NAC robust to suboptimal demonstration data since the method
is not forced to mimic all of the examples in the dataset. We show that our
unified reinforcement learning algorithm can learn robustly and outperform
existing baselines when evaluated on several realistic driving games.
| cs.AI cs.LG stat.ML | robust realworld learning should benefit from both demonstrations and interactions with the environment current approaches to learning from demonstration and reward perform supervised learning on expert demonstration data and use reinforcement learning to further improve performance based on the reward received from the environment these tasks have divergent losses which are difficult to jointly optimize and such methods can be very sensitive to noisy demonstrations we propose a unified reinforcement learning algorithm normalized actorcritic nac that effectively normalizes the qfunction reducing the qvalues of actions unseen in the demonstration data nac learns an initial policy network from demonstrations and refines the policy in the environment surpassing the demonstrators performance crucially both learning from demonstration and interactive refinement use the same objective unlike prior approaches that combine distinct supervised and reinforcement losses this makes nac robust to suboptimal demonstration data since the method is not forced to mimic all of the examples in the dataset we show that our unified reinforcement learning algorithm can learn robustly and outperform existing baselines when evaluated on several realistic driving games | [['robust', 'realworld', 'learning', 'should', 'benefit', 'from', 'both', 'demonstrations', 'and', 'interactions', 'with', 'the', 'environment', 'current', 'approaches', 'to', 'learning', 'from', 'demonstration', 'and', 'reward', 'perform', 'supervised', 'learning', 'on', 'expert', 'demonstration', 'data', 'and', 'use', 'reinforcement', 'learning', 'to', 'further', 'improve', 'performance', 'based', 'on', 'the', 'reward', 'received', 'from', 'the', 'environment', 'these', 'tasks', 'have', 'divergent', 'losses', 'which', 'are', 'difficult', 'to', 'jointly', 'optimize', 'and', 'such', 'methods', 'can', 'be', 'very', 'sensitive', 'to', 'noisy', 'demonstrations', 'we', 'propose', 'a', 'unified', 'reinforcement', 'learning', 'algorithm', 'normalized', 'actorcritic', 'nac', 'that', 'effectively', 'normalizes', 'the', 'qfunction', 'reducing', 'the', 'qvalues', 'of', 'actions', 'unseen', 'in', 'the', 'demonstration', 'data', 'nac', 'learns', 'an', 'initial', 'policy', 'network', 'from', 'demonstrations', 'and', 'refines', 'the', 'policy', 'in', 'the', 'environment', 'surpassing', 'the', 'demonstrators', 'performance', 'crucially', 'both', 'learning', 'from', 'demonstration', 'and', 'interactive', 'refinement', 'use', 'the', 'same', 'objective', 'unlike', 'prior', 'approaches', 'that', 'combine', 'distinct', 'supervised', 'and', 'reinforcement', 'losses', 'this', 'makes', 'nac', 'robust', 'to', 'suboptimal', 'demonstration', 'data', 'since', 'the', 'method', 'is', 'not', 'forced', 'to', 'mimic', 'all', 'of', 'the', 'examples', 'in', 'the', 'dataset', 'we', 'show', 'that', 'our', 'unified', 'reinforcement', 'learning', 'algorithm', 'can', 'learn', 'robustly', 'and', 'outperform', 'existing', 'baselines', 'when', 'evaluated', 'on', 'several', 'realistic', 'driving', 'games']] | [0.02057474532127592, 0.006054898457477975, -0.10956622397861793, 0.05842257740137442, -0.17186862166537056, -0.1971498966635078, 0.048004674284708344, 0.5049351014577869, -0.2673214933020063, -0.35641911744394084, 0.06734599685362562, -0.25428289114444685, -0.2030064661164281, 0.22957785337083889, -0.1712362044887744, 0.08793678613305515, 0.13764734377565963, 0.04102965895171193, -0.06081026247623165, -0.2772277519318529, 0.30726075209994713, 0.03352250549042682, 0.3564077805177393, -0.006299490667350421, 0.1714236270384969, -0.0028089061862291683, 0.004271020348162644, -0.020268785455713936, -0.04978229083706703, 0.12637405508443902, 0.3663661011060784, 0.22462800658699547, 0.37229347775891336, -0.40504196704767476, -0.20099263250780164, 0.10565680539531802, 0.12237806020791388, 0.1331825916045504, -0.03463982466531557, -0.38803814563222905, 0.02094319688992321, -0.17457784650402822, 0.05723626792049882, -0.1922690869700587, -0.09066881261175942, -0.002335790310594761, -0.345856741089268, -0.038223479204382536, 0.056403227007566864, 0.023523204229687424, -0.07685567732815715, -0.12110836617648602, 0.0674141035230026, 0.19947742501658053, 0.03771465983829165, 0.05329847576715772, 0.1929216600924106, -0.18060821720924156, -0.19310788742256013, 0.31249618119644845, -0.06499471364581537, -0.1721077711276435, 0.2343289030891769, -0.012569369245532223, -0.12038438646546142, 0.12015916541911958, 0.26647483579952014, 0.1445258842326108, -0.13400634263011438, -0.0035304152009881695, -0.016989466903561897, 0.17828375957535833, -0.013166499049640895, -0.008387277249395001, 0.12752325486508198, 0.22669719851083672, 0.05557303065672221, 0.12054116864601383, -0.06471777043374129, -0.11742515713756968, -0.20745432786961002, -0.06612195538102904, -0.23696181766321056, -0.022134555399134115, -0.09151342631230364, -0.09473186385771855, 0.34049972899348097, 0.286846213741228, 0.20136117705524983, 0.16216545539910757, 0.39630883416711266, 0.024739192308598747, 0.1056603604123335, 0.11617397372505035, 0.24647225547497245, -0.018898590822407805, 0.13955542899202555, -0.22256415365501941, 0.12541539023302242, -0.010871833318643357] |
1,802.05314 | Connecting bright and dark states through accidental degeneracy caused
by lack of symmetry | Coupled excitonic structures are found in natural and artificial light
harvesting systems where optical transitions link different excitation
manifolds. In systems with symmetry, some optical transitions are allowed,
while others are forbidden. Here we examine an excitonic ring structure and
identify an accidental degeneracy between two categories of double-excitation
eigenstates with distinct symmetries and optical transition properties. To
understand the accidental degeneracy, a complete selection rule between two
arbitrary excitation manifolds is derived with a physically motivated proof.
Remarkably, symmetry analysis shows the lack of certain symmetry elements in
the Hamiltonian is responsible for this degeneracy, which is unique to rings
with size N=4l+2 (l being an integer).
| quant-ph | coupled excitonic structures are found in natural and artificial light harvesting systems where optical transitions link different excitation manifolds in systems with symmetry some optical transitions are allowed while others are forbidden here we examine an excitonic ring structure and identify an accidental degeneracy between two categories of doubleexcitation eigenstates with distinct symmetries and optical transition properties to understand the accidental degeneracy a complete selection rule between two arbitrary excitation manifolds is derived with a physically motivated proof remarkably symmetry analysis shows the lack of certain symmetry elements in the hamiltonian is responsible for this degeneracy which is unique to rings with size n4l2 l being an integer | [['coupled', 'excitonic', 'structures', 'are', 'found', 'in', 'natural', 'and', 'artificial', 'light', 'harvesting', 'systems', 'where', 'optical', 'transitions', 'link', 'different', 'excitation', 'manifolds', 'in', 'systems', 'with', 'symmetry', 'some', 'optical', 'transitions', 'are', 'allowed', 'while', 'others', 'are', 'forbidden', 'here', 'we', 'examine', 'an', 'excitonic', 'ring', 'structure', 'and', 'identify', 'an', 'accidental', 'degeneracy', 'between', 'two', 'categories', 'of', 'doubleexcitation', 'eigenstates', 'with', 'distinct', 'symmetries', 'and', 'optical', 'transition', 'properties', 'to', 'understand', 'the', 'accidental', 'degeneracy', 'a', 'complete', 'selection', 'rule', 'between', 'two', 'arbitrary', 'excitation', 'manifolds', 'is', 'derived', 'with', 'a', 'physically', 'motivated', 'proof', 'remarkably', 'symmetry', 'analysis', 'shows', 'the', 'lack', 'of', 'certain', 'symmetry', 'elements', 'in', 'the', 'hamiltonian', 'is', 'responsible', 'for', 'this', 'degeneracy', 'which', 'is', 'unique', 'to', 'rings', 'with', 'size', 'n4l2', 'l', 'being', 'an', 'integer']] | [-0.22951361943889304, 0.1578585093433775, -0.03713548109457593, 0.07444346674596107, -0.0763244174864735, -0.20852527084159794, 0.014947948489930028, 0.41425231140037283, -0.27614823316232623, -0.3202949577733596, 0.05678673035728475, -0.2725176466933547, -0.1492116788672022, 0.09380460813833034, -0.006642298646723834, -0.016584016783075913, -0.007289581214051659, -0.02447115277836674, -0.07302525406268155, -0.15251809809243777, 0.35142501531316783, -0.005706142725544833, 0.2892718053788434, 0.034566533268716566, 0.03749328897177964, -0.0377178962525224, 0.032143396327041406, -0.05042205634744507, -0.11730077912352074, 0.10230967655307918, 0.2705391559501779, 0.01316923225107037, 0.16490010824272078, -0.3859365393590426, -0.18017899902824697, 0.1426314842151739, 0.16248149212850171, 0.14435448146003046, -0.05041903230387752, -0.2939199187214025, 0.010028160085779763, -0.1139668332737605, -0.15287633305502552, -0.1001933292903563, 0.04927975633268671, -0.004517366933401361, -0.24263164841311016, 0.031139289744842414, 0.06311795087618248, 0.1330034134160971, -0.08141451543545193, -0.06690919746113853, -0.11562256803126814, 0.09549372541831336, 0.016477280542271856, -0.06941887157943065, 0.0772693863902328, -0.10180378936135392, -0.13450292174956788, 0.41553831267579694, 0.009283188327920631, -0.15125180785892375, 0.21332355671579661, -0.10597546916524662, -0.15450462800990267, 0.17573810377045074, 0.06812754767798931, 0.07683906000037895, -0.12408782172758812, 0.07146803615451573, -0.01921144438576754, 0.1568202021124851, 0.04947173372933763, 0.13602327571085124, 0.25340997699265166, 0.11983065260465423, 0.07756131954048325, 0.13077742938783507, -0.022022640406563182, -0.10954988582460122, -0.2825464409923999, -0.1155883321129482, -0.16179222257363948, 0.09841777425516118, -0.03385887916864083, -0.13759424349414967, 0.39265856617696093, 0.0783365036265176, 0.236604940285471, -0.02046205473913611, 0.2366833414612599, 0.11489043350409821, 0.06566430452915135, 0.018685682550525277, 0.2529457686613118, 0.1690116031356504, -0.009646735861288192, -0.26842413790889574, -0.023163072747465607, 0.02999037238290516] |
1,802.05315 | Online Learning for Non-Stationary A/B Tests | The rollout of new versions of a feature in modern applications is a manual
multi-stage process, as the feature is released to ever larger groups of users,
while its performance is carefully monitored. This kind of A/B testing is
ubiquitous, but suboptimal, as the monitoring requires heavy human
intervention, is not guaranteed to capture consistent, but short-term
fluctuations in performance, and is inefficient, as better versions take a long
time to reach the full population.
In this work we formulate this question as that of expert learning, and give
a new algorithm Follow-The-Best-Interval, FTBI, that works in dynamic,
non-stationary environments. Our approach is practical, simple, and efficient,
and has rigorous guarantees on its performance. Finally, we perform a thorough
evaluation on synthetic and real world datasets and show that our approach
outperforms current state-of-the-art methods.
| cs.LG stat.ML | the rollout of new versions of a feature in modern applications is a manual multistage process as the feature is released to ever larger groups of users while its performance is carefully monitored this kind of ab testing is ubiquitous but suboptimal as the monitoring requires heavy human intervention is not guaranteed to capture consistent but shortterm fluctuations in performance and is inefficient as better versions take a long time to reach the full population in this work we formulate this question as that of expert learning and give a new algorithm followthebestinterval ftbi that works in dynamic nonstationary environments our approach is practical simple and efficient and has rigorous guarantees on its performance finally we perform a thorough evaluation on synthetic and real world datasets and show that our approach outperforms current stateoftheart methods | [['the', 'rollout', 'of', 'new', 'versions', 'of', 'a', 'feature', 'in', 'modern', 'applications', 'is', 'a', 'manual', 'multistage', 'process', 'as', 'the', 'feature', 'is', 'released', 'to', 'ever', 'larger', 'groups', 'of', 'users', 'while', 'its', 'performance', 'is', 'carefully', 'monitored', 'this', 'kind', 'of', 'ab', 'testing', 'is', 'ubiquitous', 'but', 'suboptimal', 'as', 'the', 'monitoring', 'requires', 'heavy', 'human', 'intervention', 'is', 'not', 'guaranteed', 'to', 'capture', 'consistent', 'but', 'shortterm', 'fluctuations', 'in', 'performance', 'and', 'is', 'inefficient', 'as', 'better', 'versions', 'take', 'a', 'long', 'time', 'to', 'reach', 'the', 'full', 'population', 'in', 'this', 'work', 'we', 'formulate', 'this', 'question', 'as', 'that', 'of', 'expert', 'learning', 'and', 'give', 'a', 'new', 'algorithm', 'followthebestinterval', 'ftbi', 'that', 'works', 'in', 'dynamic', 'nonstationary', 'environments', 'our', 'approach', 'is', 'practical', 'simple', 'and', 'efficient', 'and', 'has', 'rigorous', 'guarantees', 'on', 'its', 'performance', 'finally', 'we', 'perform', 'a', 'thorough', 'evaluation', 'on', 'synthetic', 'and', 'real', 'world', 'datasets', 'and', 'show', 'that', 'our', 'approach', 'outperforms', 'current', 'stateoftheart', 'methods']] | [-0.07102740508035049, 0.0035631135526232255, -0.09276413127667922, 0.08737545687916938, -0.11263362344536454, -0.14663782520779878, 0.0710468086575095, 0.44785535100259277, -0.20761451171711087, -0.319913768916762, 0.11976405235245488, -0.23611594386979995, -0.16323741324529528, 0.24864040352964312, -0.1436142330600607, 0.0517868289183055, 0.1394851918899475, 0.037412965488164945, -0.052851389516712845, -0.28939887578774215, 0.2444840672905592, 0.0979877347389194, 0.3204800357054779, 0.04170870001925001, 0.09460294270372417, -0.029919103096078214, -0.03737333136141524, 0.018480372678180385, -0.043328690695297586, 0.11307676459305492, 0.2854854123705396, 0.19922670075333768, 0.3490913762409884, -0.4182263091066502, -0.2249458698604844, 0.09250630315960406, 0.15223626344494479, 0.09155383847115117, -0.0544330273051151, -0.28183504356477496, 0.10153303218259707, -0.16921657825210937, -0.06331688635527416, -0.15280901426379395, 0.02073622947992911, -0.02335208120775108, -0.3072340753720723, 0.06292688074133086, 0.0670567655697801, 0.0654367490538529, -0.029742083513997215, -0.09822444130204394, 0.0627553110348789, 0.17459760309035952, 0.04416300042482492, 0.017836703092588068, 0.13886001779648818, -0.12856130438324595, -0.16423609623286342, 0.38767692054397795, -0.04894389743134169, -0.17179762600059795, 0.23408041857323028, -0.04229281370745117, -0.1571467981176605, 0.10599919755705037, 0.2150300018755453, 0.15717227310222343, -0.15783906089145466, 0.05626224259814402, -0.047532446101251846, 0.18173451709413999, -0.013613276980131081, 0.01838128859986012, 0.15192626244948715, 0.27994173829604807, 0.07332889160974637, 0.12681782741057582, -0.05410771155764902, -0.11045984535204961, -0.23546668415875138, -0.1542909706739667, -0.19353373745050198, 0.014745311193711726, -0.052080377690621855, -0.16884281967514495, 0.39855218743135157, 0.23400641519478277, 0.16506650603439352, 0.09394137795552387, 0.3933552942279012, 0.05577008686504586, 0.07373988612281873, 0.07980850677328058, 0.2173244143254999, -0.011296006334469394, 0.1375114949773717, -0.18527161288495295, 0.10728298301749016, -0.0028443170214225923] |
1,802.05316 | Sharkzor: Interactive Deep Learning for Image Triage, Sort and Summary | Sharkzor is a web application for machine-learning assisted image sort and
summary. Deep learning algorithms are leveraged to infer, augment, and automate
the user's mental model. Initially, images uploaded by the user are spread out
on a canvas. The user then interacts with the images to impute their mental
model into the application's algorithmic underpinnings. Methods of interaction
within Sharkzor's user interface and user experience support three primary user
tasks; triage, organize and automate. The user triages the large pile of
overlapping images by moving images of interest into proximity. The user then
organizes said images into meaningful groups. After interacting with the images
and groups, deep learning helps to automate the user's interactions. The loop
of interaction, automation, and response by the user allows the system to
quickly make sense of large amounts of data.
| cs.HC | sharkzor is a web application for machinelearning assisted image sort and summary deep learning algorithms are leveraged to infer augment and automate the users mental model initially images uploaded by the user are spread out on a canvas the user then interacts with the images to impute their mental model into the applications algorithmic underpinnings methods of interaction within sharkzors user interface and user experience support three primary user tasks triage organize and automate the user triages the large pile of overlapping images by moving images of interest into proximity the user then organizes said images into meaningful groups after interacting with the images and groups deep learning helps to automate the users interactions the loop of interaction automation and response by the user allows the system to quickly make sense of large amounts of data | [['sharkzor', 'is', 'a', 'web', 'application', 'for', 'machinelearning', 'assisted', 'image', 'sort', 'and', 'summary', 'deep', 'learning', 'algorithms', 'are', 'leveraged', 'to', 'infer', 'augment', 'and', 'automate', 'the', 'users', 'mental', 'model', 'initially', 'images', 'uploaded', 'by', 'the', 'user', 'are', 'spread', 'out', 'on', 'a', 'canvas', 'the', 'user', 'then', 'interacts', 'with', 'the', 'images', 'to', 'impute', 'their', 'mental', 'model', 'into', 'the', 'applications', 'algorithmic', 'underpinnings', 'methods', 'of', 'interaction', 'within', 'sharkzors', 'user', 'interface', 'and', 'user', 'experience', 'support', 'three', 'primary', 'user', 'tasks', 'triage', 'organize', 'and', 'automate', 'the', 'user', 'triages', 'the', 'large', 'pile', 'of', 'overlapping', 'images', 'by', 'moving', 'images', 'of', 'interest', 'into', 'proximity', 'the', 'user', 'then', 'organizes', 'said', 'images', 'into', 'meaningful', 'groups', 'after', 'interacting', 'with', 'the', 'images', 'and', 'groups', 'deep', 'learning', 'helps', 'to', 'automate', 'the', 'users', 'interactions', 'the', 'loop', 'of', 'interaction', 'automation', 'and', 'response', 'by', 'the', 'user', 'allows', 'the', 'system', 'to', 'quickly', 'make', 'sense', 'of', 'large', 'amounts', 'of', 'data']] | [-0.05150250576548558, 0.03262375698501902, -0.08094774886372295, 0.09045911440013074, -0.1823301657380473, -0.2016573120608814, 0.08734047193762048, 0.4183082681261283, -0.2785726606817846, -0.358705653248817, 0.04032258416133884, -0.32078867998244187, -0.14373836138012602, 0.1282041787898126, -0.10372530048033853, 0.02063917995542568, 0.11166291913591829, 0.08904492236232679, 0.0231148295587671, -0.29646995106249824, 0.32141921506438376, 0.04849685084283058, 0.3237238557154971, 0.008737297224483095, 0.0783632470695722, 0.04920519598938273, -0.09414965330265966, -0.026017724655400542, -0.04499617092227353, 0.15603833875174222, 0.35028817623773156, 0.23541368702006407, 0.34776418954063965, -0.46961322378479226, -0.18065330295655457, 0.016396606206207684, 0.165763360437678, 0.05084773447168501, -0.05141967551562151, -0.42131873984870155, 0.08329390405495196, -0.18945110264003165, -0.014290917997381516, -0.09144148897183568, -0.02887099270036626, 0.005872928159297409, -0.30000156606109885, -0.0495358827817989, -0.003525237933578516, 0.09318648763631183, -0.052023519951363506, -0.015011852714793295, -0.011940713303121632, 0.28375006772759825, 0.057497818407662125, 0.01831673320620916, 0.21188694060450994, -0.21124896353558825, -0.08926814370280958, 0.39161853863913704, 0.04865064929568566, -0.17184023493970918, 0.2323418930680596, -0.03048768855589337, -0.10515432648668836, 0.17234959790861248, 0.2720796862981261, 0.05410901779883114, -0.2021887507587251, 0.02233892716589923, 0.0019016294789157416, 0.19184150614012452, 0.036032046626857654, -0.047579498797010886, 0.25867276603909195, 0.19078156797397405, 0.020007722471889696, 0.14738405753571288, -0.06920885701691802, -0.04213388761351431, -0.1869619172101462, -0.15337720572514305, -0.1671775028151565, -0.030507045442630585, -0.089502857591654, -0.11496720689565952, 0.40649404656141996, 0.233129790122577, 0.1679796003561495, 0.06721739302025198, 0.3385979005352671, -0.009178499782219865, 0.1412143630305059, 0.0539977215528068, 0.09363972878300662, 0.025702864525111436, 0.16074477178499774, -0.15560700229712224, 0.10979474772860233, 0.03307633008107655] |
1,802.05317 | Communication via FRET in Nanonetworks of Mobile Proteins | A practical, biologically motivated case of protein complexes (immunoglobulin
G and FcRII receptors) moving on the surface of mastcells, that are common
parts of an immunological system, is investigated. Proteins are considered as
nanomachines creating a nanonetwork. Accurate molecular models of the proteins
and the fluorophores which act as their nanoantennas are used to simulate the
communication between the nanomachines when they are close to each other. The
theory of diffusion-based Brownian motion is applied to model movements of the
proteins. It is assumed that fluorophore molecules send and receive signals
using the Forster Resonance Energy Transfer. The probability of the efficient
signal transfer and the respective bit error rate are calculated and discussed.
| q-bio.MN physics.bio-ph | a practical biologically motivated case of protein complexes immunoglobulin g and fcrii receptors moving on the surface of mastcells that are common parts of an immunological system is investigated proteins are considered as nanomachines creating a nanonetwork accurate molecular models of the proteins and the fluorophores which act as their nanoantennas are used to simulate the communication between the nanomachines when they are close to each other the theory of diffusionbased brownian motion is applied to model movements of the proteins it is assumed that fluorophore molecules send and receive signals using the forster resonance energy transfer the probability of the efficient signal transfer and the respective bit error rate are calculated and discussed | [['a', 'practical', 'biologically', 'motivated', 'case', 'of', 'protein', 'complexes', 'immunoglobulin', 'g', 'and', 'fcrii', 'receptors', 'moving', 'on', 'the', 'surface', 'of', 'mastcells', 'that', 'are', 'common', 'parts', 'of', 'an', 'immunological', 'system', 'is', 'investigated', 'proteins', 'are', 'considered', 'as', 'nanomachines', 'creating', 'a', 'nanonetwork', 'accurate', 'molecular', 'models', 'of', 'the', 'proteins', 'and', 'the', 'fluorophores', 'which', 'act', 'as', 'their', 'nanoantennas', 'are', 'used', 'to', 'simulate', 'the', 'communication', 'between', 'the', 'nanomachines', 'when', 'they', 'are', 'close', 'to', 'each', 'other', 'the', 'theory', 'of', 'diffusionbased', 'brownian', 'motion', 'is', 'applied', 'to', 'model', 'movements', 'of', 'the', 'proteins', 'it', 'is', 'assumed', 'that', 'fluorophore', 'molecules', 'send', 'and', 'receive', 'signals', 'using', 'the', 'forster', 'resonance', 'energy', 'transfer', 'the', 'probability', 'of', 'the', 'efficient', 'signal', 'transfer', 'and', 'the', 'respective', 'bit', 'error', 'rate', 'are', 'calculated', 'and', 'discussed']] | [-0.13312864834941657, 0.12448747084908973, -0.008741621123460521, 0.06888455245124143, -0.011316607278006683, -0.20447260833212308, 0.03645518916865902, 0.4244862394241084, -0.27506080371261177, -0.2592980155771199, 0.0347462406311284, -0.288276895078265, -0.18845800408494792, 0.19229592608462553, -0.05453320928583188, 0.026047229962257137, 0.06675914291658305, 0.08503279704226381, 0.07373922587534512, -0.18138371395512617, 0.21591271489575906, 0.08495675641045507, 0.2449436878086999, 0.034051773441855664, 0.12080024009836572, -0.03713086845735753, 0.017264777929605252, -0.06735984553649489, -0.13478954400034127, 0.19752279534337244, 0.28393114174355105, 0.09783984922770676, 0.24180059733667544, -0.4605209125022936, -0.25756523587707697, 0.0944117073252398, 0.1436751036131422, 0.1399505240707575, -0.04786365486402896, -0.28057525611075107, 0.08342748175657887, -0.11686275022553413, -0.040563695047499744, -0.034648413950760314, 0.015961908803936758, 0.12764785293256864, -0.2620923994774265, 0.08741087357962637, 0.0014763514710856335, 0.043957776755892804, -0.06651373421274391, -0.1323517743928408, -0.05415382525058833, 0.2440287642065024, 0.024184058146991965, 0.011405833082140557, 0.27727515897796756, -0.11236105250126067, -0.1019097096328291, 0.4009633941210008, 0.0009773365537902074, -0.24434855670136, 0.24190724561412935, -0.07148661350532036, -0.061431644914721674, 0.1480505214837779, 0.16628563861844928, 0.13543595170735248, -0.1954325210074655, 0.005763077149562638, 0.02897631622285449, 0.1779801146497318, 0.08747029393478963, 0.03418267731155668, 0.19977702390419186, 0.16137005406614793, 0.017296844448927522, 0.11473290986499965, -0.11894902725595914, -0.1205527703153036, -0.21172331622957635, -0.16559203108863585, -0.23361262365610205, 0.013755987431587917, -0.03430595512054424, -0.12974420845525206, 0.33958986689270076, 0.09248303130568404, 0.17380736083058373, 0.05066492818981975, 0.28290364189472583, 0.06610745816682798, 0.06697194038549371, 0.0241472114077104, 0.19195349630483957, 0.1544086131949111, 0.05633879121160135, -0.24368957199996139, 0.08368613686928127, 0.0022854898935682805] |
1,802.05318 | Nonlinear Shape Regression For Filtering Segmentation Results From
Calcium Imaging | A shape filter is presented to repair segmentation results obtained in
calcium imaging of neurons in vivo. This post-segmentation algorithm can
automatically smooth the shapes obtained from a preliminary segmentation, while
precluding the cases where two neurons are counted as one combined component.
The shape filter is realized using a square-root velocity to project the shapes
on a shape manifold in which distances between shapes are based on elastic
changes. Two data-driven weighting methods are proposed to achieve a trade-off
between shape smoothness and consistency with the data. Intuitive comparisons
of proposed methods via projection onto Cartesian maps demonstrate the
smoothing ability of the shape filter. Quantitative measures also prove the
superiority of our methods over models that do not employ any weighting
criterion.
| eess.IV | a shape filter is presented to repair segmentation results obtained in calcium imaging of neurons in vivo this postsegmentation algorithm can automatically smooth the shapes obtained from a preliminary segmentation while precluding the cases where two neurons are counted as one combined component the shape filter is realized using a squareroot velocity to project the shapes on a shape manifold in which distances between shapes are based on elastic changes two datadriven weighting methods are proposed to achieve a tradeoff between shape smoothness and consistency with the data intuitive comparisons of proposed methods via projection onto cartesian maps demonstrate the smoothing ability of the shape filter quantitative measures also prove the superiority of our methods over models that do not employ any weighting criterion | [['a', 'shape', 'filter', 'is', 'presented', 'to', 'repair', 'segmentation', 'results', 'obtained', 'in', 'calcium', 'imaging', 'of', 'neurons', 'in', 'vivo', 'this', 'postsegmentation', 'algorithm', 'can', 'automatically', 'smooth', 'the', 'shapes', 'obtained', 'from', 'a', 'preliminary', 'segmentation', 'while', 'precluding', 'the', 'cases', 'where', 'two', 'neurons', 'are', 'counted', 'as', 'one', 'combined', 'component', 'the', 'shape', 'filter', 'is', 'realized', 'using', 'a', 'squareroot', 'velocity', 'to', 'project', 'the', 'shapes', 'on', 'a', 'shape', 'manifold', 'in', 'which', 'distances', 'between', 'shapes', 'are', 'based', 'on', 'elastic', 'changes', 'two', 'datadriven', 'weighting', 'methods', 'are', 'proposed', 'to', 'achieve', 'a', 'tradeoff', 'between', 'shape', 'smoothness', 'and', 'consistency', 'with', 'the', 'data', 'intuitive', 'comparisons', 'of', 'proposed', 'methods', 'via', 'projection', 'onto', 'cartesian', 'maps', 'demonstrate', 'the', 'smoothing', 'ability', 'of', 'the', 'shape', 'filter', 'quantitative', 'measures', 'also', 'prove', 'the', 'superiority', 'of', 'our', 'methods', 'over', 'models', 'that', 'do', 'not', 'employ', 'any', 'weighting', 'criterion']] | [-0.02713135380025317, -0.015112079666715449, -0.13407756658498107, 0.05705924763825033, -0.07349496978009498, -0.136028297453725, -0.017618488963329938, 0.48289299192951946, -0.25087887111945245, -0.2947749644063595, 0.0770347136672874, -0.2489105962080563, -0.17602688839660988, 0.21647227542546799, -0.11934624675933908, 0.06667731636453693, 0.10401611166960764, 0.004648959521597963, -0.10600359896690077, -0.22318496160318968, 0.2555608278882455, 0.027225738410209494, 0.32596002357852893, -0.013723482676910433, 0.13517369669610094, -0.0042681797574145525, -0.05274599762179139, 0.03649475200327879, -0.1188102754922437, 0.15232518138048073, 0.24551644590362073, 0.16027955323972595, 0.27552405539597197, -0.39383675839479376, -0.2237799280227022, 0.10273143934555412, 0.16768086944447405, 0.063778959238349, -0.03627070808419731, -0.3090093143102599, 0.0663181895473442, -0.0939946166179105, -0.053959872520612025, -0.11015719980213458, -0.037402908508457636, 0.07042531055782551, -0.30666061942806333, 0.06813146715498211, 0.05203059432664659, 0.06151214210748127, -0.08669504305211509, -0.1100657178747763, -0.03312274435822799, 0.1356392672883604, -0.0016840433255140858, 0.011333583081822569, 0.16458741595639234, -0.11954835549988822, -0.12100895946254818, 0.31942453221380107, -0.030058599372462528, -0.2912859620518861, 0.18148690823851743, -0.09001274014694419, -0.0922384780218325, 0.1559839564375816, 0.1698753385903026, 0.09770354215146565, -0.11629548441141663, 0.012644996911540961, -0.022124061956282373, 0.19698404939466618, 0.08201952799927534, -0.01983483664585444, 0.1503641600985595, 0.16809791593804835, 0.07048697599277991, 0.12728597270135533, -0.1655097417381963, -0.06920936509561763, -0.2937009076415599, -0.08179004760686218, -0.20078929519750238, -0.06107661402678993, -0.1330335771747083, -0.17029916305791556, 0.3956226706807691, 0.15387047241570626, 0.2570117145579884, 0.09292274511445738, 0.33798979704336424, 0.024906404070344154, 0.10674330795361714, 0.030834290797148292, 0.21695570081351248, 0.09505395186171542, 0.052809359228458044, -0.2206726911273308, 0.088286186568439, 0.09718316163852568] |
1,802.05319 | 500+ Times Faster Than Deep Learning (A Case Study Exploring Faster
Methods for Text Mining StackOverflow) | Deep learning methods are useful for high-dimensional data and are becoming
widely used in many areas of software engineering. Deep learners utilizes
extensive computational power and can take a long time to train-- making it
difficult to widely validate and repeat and improve their results. Further,
they are not the best solution in all domains. For example, recent results show
that for finding related Stack Overflow posts, a tuned SVM performs similarly
to a deep learner, but is significantly faster to train. This paper extends
that recent result by clustering the dataset, then tuning very learners within
each cluster. This approach is over 500 times faster than deep learning (and
over 900 times faster if we use all the cores on a standard laptop computer).
Significantly, this faster approach generates classifiers nearly as good
(within 2\% F1 Score) as the much slower deep learning method. Hence we
recommend this faster methods since it is much easier to reproduce and utilizes
far fewer CPU resources. More generally, we recommend that before researchers
release research results, that they compare their supposedly sophisticated
methods against simpler alternatives (e.g applying simpler learners to build
local models).
| cs.SE cs.LG stat.ML | deep learning methods are useful for highdimensional data and are becoming widely used in many areas of software engineering deep learners utilizes extensive computational power and can take a long time to train making it difficult to widely validate and repeat and improve their results further they are not the best solution in all domains for example recent results show that for finding related stack overflow posts a tuned svm performs similarly to a deep learner but is significantly faster to train this paper extends that recent result by clustering the dataset then tuning very learners within each cluster this approach is over 500 times faster than deep learning and over 900 times faster if we use all the cores on a standard laptop computer significantly this faster approach generates classifiers nearly as good within 2 f1 score as the much slower deep learning method hence we recommend this faster methods since it is much easier to reproduce and utilizes far fewer cpu resources more generally we recommend that before researchers release research results that they compare their supposedly sophisticated methods against simpler alternatives eg applying simpler learners to build local models | [['deep', 'learning', 'methods', 'are', 'useful', 'for', 'highdimensional', 'data', 'and', 'are', 'becoming', 'widely', 'used', 'in', 'many', 'areas', 'of', 'software', 'engineering', 'deep', 'learners', 'utilizes', 'extensive', 'computational', 'power', 'and', 'can', 'take', 'a', 'long', 'time', 'to', 'train', 'making', 'it', 'difficult', 'to', 'widely', 'validate', 'and', 'repeat', 'and', 'improve', 'their', 'results', 'further', 'they', 'are', 'not', 'the', 'best', 'solution', 'in', 'all', 'domains', 'for', 'example', 'recent', 'results', 'show', 'that', 'for', 'finding', 'related', 'stack', 'overflow', 'posts', 'a', 'tuned', 'svm', 'performs', 'similarly', 'to', 'a', 'deep', 'learner', 'but', 'is', 'significantly', 'faster', 'to', 'train', 'this', 'paper', 'extends', 'that', 'recent', 'result', 'by', 'clustering', 'the', 'dataset', 'then', 'tuning', 'very', 'learners', 'within', 'each', 'cluster', 'this', 'approach', 'is', 'over', '500', 'times', 'faster', 'than', 'deep', 'learning', 'and', 'over', '900', 'times', 'faster', 'if', 'we', 'use', 'all', 'the', 'cores', 'on', 'a', 'standard', 'laptop', 'computer', 'significantly', 'this', 'faster', 'approach', 'generates', 'classifiers', 'nearly', 'as', 'good', 'within', '2', 'f1', 'score', 'as', 'the', 'much', 'slower', 'deep', 'learning', 'method', 'hence', 'we', 'recommend', 'this', 'faster', 'methods', 'since', 'it', 'is', 'much', 'easier', 'to', 'reproduce', 'and', 'utilizes', 'far', 'fewer', 'cpu', 'resources', 'more', 'generally', 'we', 'recommend', 'that', 'before', 'researchers', 'release', 'research', 'results', 'that', 'they', 'compare', 'their', 'supposedly', 'sophisticated', 'methods', 'against', 'simpler', 'alternatives', 'eg', 'applying', 'simpler', 'learners', 'to', 'build', 'local', 'models']] | [0.021837748060230904, 0.03320779387286166, -0.07760302862152457, 0.11882155730260517, -0.13971352836718628, -0.2112729824584676, 0.05773607909274384, 0.49079736694693565, -0.23631330389647096, -0.3451150372347911, 0.10578464554540308, -0.26436770121775527, -0.1532944648023431, 0.29166166111341835, -0.08449008347209504, 0.04206213293946348, 0.13762779175400888, 0.04006527193268994, -0.072212397405868, -0.36730383269605227, 0.2152651879368932, 0.07982713511819384, 0.3319093131722184, -0.020122941661005218, 0.0470808466343442, -0.03533144185833711, -0.038419004963846724, 0.0021450605175535506, -0.06951178833530018, 0.15186898085448775, 0.3143083077699013, 0.21095945694105467, 0.3745079116245809, -0.44742547308366437, -0.2045001100147298, 0.09022832437888913, 0.19349929856154327, 0.12593623218344874, 0.017113322888311206, -0.26283572169268155, 0.12232836343415936, -0.1928479429310149, -0.03438546313069916, -0.17845120349981394, 0.00977838731129547, -0.008803764433347775, -0.2534336618470358, 0.02145155638148329, 0.048699585895216536, 0.03484789224118382, -0.016456861329061212, -0.1485499311481059, 0.048047536656667944, 0.11848113996529719, 0.06552649227645209, 0.09942214186715621, 0.15801170233802017, -0.15495597133061287, -0.11409388699030387, 0.3616081665483459, -0.05861982710886574, -0.1613753021811135, 0.27004568905006937, -0.02686623922151436, -0.12484080744373689, 0.12094804262354349, 0.20089312522941327, 0.1530609919342775, -0.14708252069006753, -0.025572173442318064, -0.019118044310744153, 0.2120189855195349, 0.050582667918206425, -0.03226785484002903, 0.14756931940792128, 0.2389557703548538, 0.0719479698561069, 0.09837073440758104, -0.05740592121219379, -0.10477841465763049, -0.15315044128268104, -0.10807629012303248, -0.16280025924303723, 0.005798476944695115, -0.07633287724896338, -0.12227974980002425, 0.3722287404634699, 0.25696578582089086, 0.18126989856925016, 0.1296914224367356, 0.3567002536340927, 0.026473258116311627, 0.17212608650879702, 0.15589269860599111, 0.209165619671694, 0.0181299583564396, 0.1342402730503333, -0.10101833919907222, 0.07290725659428669, -0.0018514295528196574] |
1,802.0532 | Entanglement of two non-interacting qubits via a mesoscopic system | We propose a method for entangling two non-interacting qubits by measuring
their parity indirectly through an intermediate mesoscopic system. The protocol
is designed to require only global control and course-grained collective
measurement of the mesoscopic system along with local interactions between the
target qubits and mesoscopic system. A generalization of the method measures
the hamming weight of the qubits' state and probabilistically produces an
entangled state by post-selecting on hamming weight one. Our technique provides
a new design element that can be integrated into quantum processor
architectures and quantum measurement devices.
| quant-ph | we propose a method for entangling two noninteracting qubits by measuring their parity indirectly through an intermediate mesoscopic system the protocol is designed to require only global control and coursegrained collective measurement of the mesoscopic system along with local interactions between the target qubits and mesoscopic system a generalization of the method measures the hamming weight of the qubits state and probabilistically produces an entangled state by postselecting on hamming weight one our technique provides a new design element that can be integrated into quantum processor architectures and quantum measurement devices | [['we', 'propose', 'a', 'method', 'for', 'entangling', 'two', 'noninteracting', 'qubits', 'by', 'measuring', 'their', 'parity', 'indirectly', 'through', 'an', 'intermediate', 'mesoscopic', 'system', 'the', 'protocol', 'is', 'designed', 'to', 'require', 'only', 'global', 'control', 'and', 'coursegrained', 'collective', 'measurement', 'of', 'the', 'mesoscopic', 'system', 'along', 'with', 'local', 'interactions', 'between', 'the', 'target', 'qubits', 'and', 'mesoscopic', 'system', 'a', 'generalization', 'of', 'the', 'method', 'measures', 'the', 'hamming', 'weight', 'of', 'the', 'qubits', 'state', 'and', 'probabilistically', 'produces', 'an', 'entangled', 'state', 'by', 'postselecting', 'on', 'hamming', 'weight', 'one', 'our', 'technique', 'provides', 'a', 'new', 'design', 'element', 'that', 'can', 'be', 'integrated', 'into', 'quantum', 'processor', 'architectures', 'and', 'quantum', 'measurement', 'devices']] | [-0.17796426837762389, 0.17158720411320605, -0.10194333276908416, -0.013936632500889782, 0.019612022665339512, -0.2655602602114144, 0.07667563255405524, 0.37378097861841486, -0.2768713402060362, -0.30698717205406545, 0.014503754793082947, -0.2690100444552417, -0.07350917074542779, 0.21587267227389, -0.016139024387594764, 0.12080098287417339, 0.09516076700618634, 0.019000711617991328, -0.058193645312113094, -0.2310534537728917, 0.3229218411852943, 0.058387731291496985, 0.3100203672362553, 0.010977110835713344, 0.15893068361597565, 0.028906764275813988, 0.0586123716208961, -0.029766070620658305, -0.050875187291559675, 0.15197770347675452, 0.23565251883733404, 0.14170920138073329, 0.26639042467206386, -0.4512890394531436, -0.1610083357778961, 0.08358351631438012, 0.12212911941070151, 0.17784063100231465, -0.017667799982099004, -0.3463787991389796, 0.04036675447311539, -0.19221577220238173, -0.05513239288328415, -0.1193394141353585, -0.02241318355631697, -0.021822233899281576, -0.239398437582857, 0.04449598260919799, 0.04676915108287646, 0.028726026191469536, -0.007498842952702614, -0.033964808437983496, 0.04007054817514842, 0.13569175644654904, -0.14067192175323245, 0.0014835375918914656, 0.1782818337810318, -0.09439954233028322, -0.18024340706908112, 0.3159684859994021, -0.00921941049407226, -0.24234981098273708, 0.15707259717049424, -0.041978194183864434, -0.06000277776895398, 0.037202416571205134, 0.16664244478650309, 0.09816697766942965, -0.17327304625024015, 0.012410520123072213, -0.0031048980551761584, 0.24288415900881882, -0.006961165111163979, 0.1254723261642669, 0.2143544274699557, 0.16917981819382735, 0.1360050558149661, 0.19516386506070926, -0.09331341753880094, -0.12132255614295111, -0.2936081077780697, -0.19941163639241194, -0.2615074505517771, 0.07239361331225015, -0.0943983044254, -0.12397694871198017, 0.4168701387409653, 0.12537481823992394, 0.1712907759880821, 0.01382195250039081, 0.31862618446677593, 0.08266046213543882, 0.10536366060202183, 0.061392653973998276, 0.19576784312356632, 0.14096365681245596, 0.03325292292360605, -0.29026882365924195, 0.0773448272906295, 0.0669414280289477] |
1,802.05321 | OSLO: Automatic Cell Counting and Segmentation for Oligodendrocyte
Progenitor Cells | Reliable cell counting and segmentation of oligodendrocyte progenitor cells
(OPCs) are critical image analysis steps that could potentially unlock
mysteries regarding OPC function during pathology. We propose a saliency-based
method to detect OPCs and use a marker-controlled watershed algorithm to
segment the OPCs. This method first implements frequency-tuned saliency
detection on separate channels to obtain regions of cell candidates. Final
detection results and internal markers can be computed by combining information
from separate saliency maps. An optimal saliency level for OPCs (OSLO) is
highlighted in this work. Here, watershed segmentation is performed efficiently
with effective internal markers. Experiments show that our method outperforms
existing methods in terms of accuracy.
| eess.IV | reliable cell counting and segmentation of oligodendrocyte progenitor cells opcs are critical image analysis steps that could potentially unlock mysteries regarding opc function during pathology we propose a saliencybased method to detect opcs and use a markercontrolled watershed algorithm to segment the opcs this method first implements frequencytuned saliency detection on separate channels to obtain regions of cell candidates final detection results and internal markers can be computed by combining information from separate saliency maps an optimal saliency level for opcs oslo is highlighted in this work here watershed segmentation is performed efficiently with effective internal markers experiments show that our method outperforms existing methods in terms of accuracy | [['reliable', 'cell', 'counting', 'and', 'segmentation', 'of', 'oligodendrocyte', 'progenitor', 'cells', 'opcs', 'are', 'critical', 'image', 'analysis', 'steps', 'that', 'could', 'potentially', 'unlock', 'mysteries', 'regarding', 'opc', 'function', 'during', 'pathology', 'we', 'propose', 'a', 'saliencybased', 'method', 'to', 'detect', 'opcs', 'and', 'use', 'a', 'markercontrolled', 'watershed', 'algorithm', 'to', 'segment', 'the', 'opcs', 'this', 'method', 'first', 'implements', 'frequencytuned', 'saliency', 'detection', 'on', 'separate', 'channels', 'to', 'obtain', 'regions', 'of', 'cell', 'candidates', 'final', 'detection', 'results', 'and', 'internal', 'markers', 'can', 'be', 'computed', 'by', 'combining', 'information', 'from', 'separate', 'saliency', 'maps', 'an', 'optimal', 'saliency', 'level', 'for', 'opcs', 'oslo', 'is', 'highlighted', 'in', 'this', 'work', 'here', 'watershed', 'segmentation', 'is', 'performed', 'efficiently', 'with', 'effective', 'internal', 'markers', 'experiments', 'show', 'that', 'our', 'method', 'outperforms', 'existing', 'methods', 'in', 'terms', 'of', 'accuracy']] | [-0.006963296222373309, 0.0018291821611961091, -0.09457113786979958, 0.052811677369323594, -0.06416738031570006, -0.1447786414668102, 0.06497243680900687, 0.4235915620552583, -0.2088655285394149, -0.33392703334835394, 0.07130408877532722, -0.26728672984366614, -0.20299917120482186, 0.19438576374064992, -0.12125260212579397, 0.05156605167711085, 0.15382356638050018, 9.861569506702599e-05, -0.02328363633326565, -0.24125899695812864, 0.22885270577777797, 0.07270692729529131, 0.32427683926653117, 0.04772381476747493, 0.1490489728446981, -0.06417327228700742, -0.09478822185256933, -0.003133210633812403, -0.11472243174581241, 0.14786335272300574, 0.3188453241320396, 0.2137944712044878, 0.25036932684532887, -0.3945132045213271, -0.25284920154027296, 0.07627083444364231, 0.2012370675586647, 0.13022451299346155, -0.04416466366900648, -0.34812327936567644, 0.1183143654187141, -0.10430671869242494, -0.01918070049335559, -0.12398426863364875, -0.0497748182086205, -0.032389920084150856, -0.2741010151286092, 0.10857267200130823, -0.025565972208386047, 0.04351832092463694, -0.0724416442249936, -0.09888214934875982, 0.019676717569516902, 0.18330256072092904, -0.02683628457425921, 0.084991523271903, 0.20171982088315957, -0.13965003406284032, -0.16067559480736102, 0.3075090183928195, -0.03721647843485698, -0.19587260869297166, 0.17555812862701714, -0.05591174653144898, -0.17979104058058173, 0.14708378274183445, 0.17763333416681876, 0.1342055635975191, -0.16532056012699656, -0.037138607755575016, 0.00010053896241717869, 0.1916775794902437, 0.08549054579688581, -0.05282874670336713, 0.21038206591684785, 0.2224444388239472, 0.04593340800191207, 0.14013249965285435, -0.2148017512949149, -0.026691964361816645, -0.22445743318854106, -0.15201179504704973, -0.1597047890471812, -0.0791143322507937, -0.06593635260018076, -0.14153094128791796, 0.4109434566495043, 0.23200700813645703, 0.1789771934412851, 0.05886034107189281, 0.36619499084298257, 0.025349850388010964, 0.10393235632390888, 0.026409787121573807, 0.17898913887243165, 0.021690325177688565, 0.05586561404979201, -0.20062383062301065, 0.08655372122518236, 0.12764687496409924] |
1,802.05322 | Classifying movie genres by analyzing text reviews | This paper proposes a method for classifying movie genres by only looking at
text reviews. The data used are from Large Movie Review Dataset v1.0 and IMDb.
This paper compared a K-nearest neighbors (KNN) model and a multilayer
perceptron (MLP) that uses tf-idf as input features. The paper also discusses
different evaluation metrics used when doing multi-label classification. For
the data used in this research, the KNN model performed the best with an
accuracy of 55.4\% and a Hamming loss of 0.047.
| cs.CL | this paper proposes a method for classifying movie genres by only looking at text reviews the data used are from large movie review dataset v10 and imdb this paper compared a knearest neighbors knn model and a multilayer perceptron mlp that uses tfidf as input features the paper also discusses different evaluation metrics used when doing multilabel classification for the data used in this research the knn model performed the best with an accuracy of 554 and a hamming loss of 0047 | [['this', 'paper', 'proposes', 'a', 'method', 'for', 'classifying', 'movie', 'genres', 'by', 'only', 'looking', 'at', 'text', 'reviews', 'the', 'data', 'used', 'are', 'from', 'large', 'movie', 'review', 'dataset', 'v10', 'and', 'imdb', 'this', 'paper', 'compared', 'a', 'knearest', 'neighbors', 'knn', 'model', 'and', 'a', 'multilayer', 'perceptron', 'mlp', 'that', 'uses', 'tfidf', 'as', 'input', 'features', 'the', 'paper', 'also', 'discusses', 'different', 'evaluation', 'metrics', 'used', 'when', 'doing', 'multilabel', 'classification', 'for', 'the', 'data', 'used', 'in', 'this', 'research', 'the', 'knn', 'model', 'performed', 'the', 'best', 'with', 'an', 'accuracy', 'of', '554', 'and', 'a', 'hamming', 'loss', 'of', '0047']] | [-0.01321081693352359, -0.06344875212167475, -0.040647348954069726, 0.09368345855945358, -0.10287328656172244, -0.1816948064171323, 0.08880803742440327, 0.4206735360004553, -0.2419669340001192, -0.3257694304466429, 0.07566190090615348, -0.38453317483569066, -0.18920242827862682, 0.16483131020398037, -0.10872878089956031, 0.07423146024755226, 0.17017684221585713, 0.1041249237023294, -0.06176240050813138, -0.3433576281886639, 0.32703949292133583, 0.06246733175102258, 0.35478656832128763, 0.005385734572461466, 0.09404764069164763, 0.012271145602869914, -0.07440996692493194, 0.007896540902282407, -0.09128765028480103, 0.17609611561056226, 0.3261831509142478, 0.2088955643334108, 0.33468173056977185, -0.3022481555164587, -0.16415710256593982, 0.057828384110840354, 0.15085299092163218, 0.07697872400692687, -0.010904317375317944, -0.3391652664839767, 0.09256586009386654, -0.22101636336571195, 0.048673201517042956, -0.11560569857474326, -0.001923702055270352, -0.00445276617339426, -0.256846595691835, 0.03838222486317646, 0.05898049380630255, 0.12717348392825664, -0.07748878933489323, -0.18894533280328643, 0.04231286105109242, 0.12575478728458842, 0.03407621920597172, 0.12599219055278454, 0.0815560975361888, -0.16584534152970287, -0.18770080418666688, 0.42680452577769756, -0.12166391091319029, -0.1930909672632768, 0.15891564262054134, 0.029347863036957456, -0.14127876237034798, 0.021580829728031305, 0.29052102558950826, 0.13286359260631045, -0.19189669429015782, -0.032967646632530934, -0.055426527663679205, 0.20986919634316753, 0.06444002357425123, -0.053328078938648105, 0.14328629807455512, 0.28561493016995215, -0.04218538918691438, 0.14968576282262802, -0.18822220407096987, 0.0019606273712181464, -0.23632182987838438, -0.11718722117110723, -0.20415956039186112, -0.041323076774616066, -0.14522547394597318, -0.14199883735415003, 0.43859983894337967, 0.24783083012259408, 0.236788928407605, 0.10427691981696137, 0.3358043697549076, -0.024056034470715266, 0.06911175496160711, 0.10728571558280325, 0.1685094236802287, -0.0024823624691812365, 0.16174000870754443, -0.07943618252430475, 0.07122176410573558, 0.08484081595727219] |
1,802.05323 | A Security Credential Management System for V2X Communications | The US Department of Transportation (USDOT) issued a proposed rule on January
12th, 2017 to mandate vehicle-to-vehicle (V2V) safety communications in light
vehicles in the US. Cybersecurity and privacy are major challenges for such a
deployment. The authors present a Security Credential Management System (SCMS)
for vehicle-to-everything (V2X) communications in this paper, which has been
developed by the Crash Avoidance Metrics Partners LLC (CAMP) under a
Cooperative Agreement with the USDOT. This system design is currently
transitioning from research to Proof-of-Concept, and is a leading candidate to
support the establishment of a nationwide Public Key Infrastructure (PKI) for
V2X security. It issues digital certificates to participating vehicles and
infrastructure nodes for trustworthy communications among them, which is
necessary for safety and mobility applications that are based on V2X
communications. The main design goal is to provide both security and privacy to
the largest extent reasonable and possible. To achieve a reasonable level of
privacy in this context, vehicles are issued pseudonym certificates, and the
generation and provisioning of those certificates are divided among multiple
organizations. Given the large number of pseudonym certificates per vehicle,
one of the main challenges is to facilitate efficient revocation of misbehaving
or malfunctioning vehicles, while preserving privacy against attacks from
insiders. The proposed SCMS supports all identified V2X use-cases and
certificate types necessary for V2X communication security.
This paper is based upon work supported by the USDOT. Any opinions, findings,
and conclusions or recommendations expressed in this publication are those of
the Authors ("we") and do not necessarily reflect the view of the USDOT.
| cs.CR | the us department of transportation usdot issued a proposed rule on january 12th 2017 to mandate vehicletovehicle v2v safety communications in light vehicles in the us cybersecurity and privacy are major challenges for such a deployment the authors present a security credential management system scms for vehicletoeverything v2x communications in this paper which has been developed by the crash avoidance metrics partners llc camp under a cooperative agreement with the usdot this system design is currently transitioning from research to proofofconcept and is a leading candidate to support the establishment of a nationwide public key infrastructure pki for v2x security it issues digital certificates to participating vehicles and infrastructure nodes for trustworthy communications among them which is necessary for safety and mobility applications that are based on v2x communications the main design goal is to provide both security and privacy to the largest extent reasonable and possible to achieve a reasonable level of privacy in this context vehicles are issued pseudonym certificates and the generation and provisioning of those certificates are divided among multiple organizations given the large number of pseudonym certificates per vehicle one of the main challenges is to facilitate efficient revocation of misbehaving or malfunctioning vehicles while preserving privacy against attacks from insiders the proposed scms supports all identified v2x usecases and certificate types necessary for v2x communication security this paper is based upon work supported by the usdot any opinions findings and conclusions or recommendations expressed in this publication are those of the authors we and do not necessarily reflect the view of the usdot | [['the', 'us', 'department', 'of', 'transportation', 'usdot', 'issued', 'a', 'proposed', 'rule', 'on', 'january', '12th', '2017', 'to', 'mandate', 'vehicletovehicle', 'v2v', 'safety', 'communications', 'in', 'light', 'vehicles', 'in', 'the', 'us', 'cybersecurity', 'and', 'privacy', 'are', 'major', 'challenges', 'for', 'such', 'a', 'deployment', 'the', 'authors', 'present', 'a', 'security', 'credential', 'management', 'system', 'scms', 'for', 'vehicletoeverything', 'v2x', 'communications', 'in', 'this', 'paper', 'which', 'has', 'been', 'developed', 'by', 'the', 'crash', 'avoidance', 'metrics', 'partners', 'llc', 'camp', 'under', 'a', 'cooperative', 'agreement', 'with', 'the', 'usdot', 'this', 'system', 'design', 'is', 'currently', 'transitioning', 'from', 'research', 'to', 'proofofconcept', 'and', 'is', 'a', 'leading', 'candidate', 'to', 'support', 'the', 'establishment', 'of', 'a', 'nationwide', 'public', 'key', 'infrastructure', 'pki', 'for', 'v2x', 'security', 'it', 'issues', 'digital', 'certificates', 'to', 'participating', 'vehicles', 'and', 'infrastructure', 'nodes', 'for', 'trustworthy', 'communications', 'among', 'them', 'which', 'is', 'necessary', 'for', 'safety', 'and', 'mobility', 'applications', 'that', 'are', 'based', 'on', 'v2x', 'communications', 'the', 'main', 'design', 'goal', 'is', 'to', 'provide', 'both', 'security', 'and', 'privacy', 'to', 'the', 'largest', 'extent', 'reasonable', 'and', 'possible', 'to', 'achieve', 'a', 'reasonable', 'level', 'of', 'privacy', 'in', 'this', 'context', 'vehicles', 'are', 'issued', 'pseudonym', 'certificates', 'and', 'the', 'generation', 'and', 'provisioning', 'of', 'those', 'certificates', 'are', 'divided', 'among', 'multiple', 'organizations', 'given', 'the', 'large', 'number', 'of', 'pseudonym', 'certificates', 'per', 'vehicle', 'one', 'of', 'the', 'main', 'challenges', 'is', 'to', 'facilitate', 'efficient', 'revocation', 'of', 'misbehaving', 'or', 'malfunctioning', 'vehicles', 'while', 'preserving', 'privacy', 'against', 'attacks', 'from', 'insiders', 'the', 'proposed', 'scms', 'supports', 'all', 'identified', 'v2x', 'usecases', 'and', 'certificate', 'types', 'necessary', 'for', 'v2x', 'communication', 'security', 'this', 'paper', 'is', 'based', 'upon', 'work', 'supported', 'by', 'the', 'usdot', 'any', 'opinions', 'findings', 'and', 'conclusions', 'or', 'recommendations', 'expressed', 'in', 'this', 'publication', 'are', 'those', 'of', 'the', 'authors', 'we', 'and', 'do', 'not', 'necessarily', 'reflect', 'the', 'view', 'of', 'the', 'usdot']] | [-0.22685575224800777, -0.015480150882169086, -0.015848675075717068, 0.0509014583995537, -0.10642248015261065, -0.20146499500289905, 0.1200969013430198, 0.33163456266573327, -0.20521442611741342, -0.33031967203186746, 0.1529482194599174, -0.2969063485291172, -0.13469340128156188, 0.19054987356938696, -0.19743108843420865, 0.10044558130279516, 0.030762402209521606, -0.0028768224293558454, 0.08182557773552511, -0.30058499583866605, 0.29736081033434475, 0.06571881260370484, 0.35509592816449387, 0.1227120119351516, 0.03584499843463546, 0.007949348724299761, -0.038808611990222314, -0.058198177297042256, -0.07774540701531918, 0.18151015546676275, 0.3739683737755397, 0.24610477428016717, 0.35583714597128535, -0.435970428482446, -0.17197937867424404, 0.07694124970872775, 0.11356326501814713, 0.06247569450705841, -0.06080733073388072, -0.3504061950172898, 0.13105686325543922, -0.26873377147831856, -0.12021668719552084, -0.047793001321263066, -0.018820369015645568, 0.06846612414145577, -0.26940824351413717, -0.044445244302796956, -0.007858997574040098, 0.09605514364583152, -0.025175474941439235, -0.05247958690650819, -0.019425599370151758, 0.22134068060682505, 0.04885391862325831, -0.023891507613209247, 0.14330502971220208, -0.12195195594211881, -0.17225024610412626, 0.4039300648445213, 0.0732388494798777, -0.13357963387829228, 0.18039596541171163, -0.011333930068811164, -0.17061958003350494, 0.07616705864642721, 0.23165589472832712, 0.03367774020390527, -0.22013455470772209, 0.0021193515287773346, -0.0008352988931749548, 0.1686635294544392, 0.06989224029625819, 0.05867712963958478, 0.18899607391440054, 0.17757558214417965, 0.14849999444073778, 0.04555580100947164, -0.018311974509914935, -0.1365143668596924, -0.25914612545341464, -0.17256379005603464, -0.1419822933537972, -0.0016310079385410512, -0.015278384673175884, -0.08695722721304931, 0.36210242669281467, 0.2042168300099038, 0.07254524861235877, 0.050391267921279355, 0.38869262206760097, 0.015823874342107865, 0.10873063155683657, 0.16386134562920418, 0.1933959723035823, 0.014618539529165763, 0.2011826781337563, -0.13378871339067644, 0.16766809043204808, -0.012020033877702523] |
1,802.05324 | Advancing System Performance with Redundancy: From Biological to
Artificial Designs | Redundancy is a fundamental characteristic of many biological processes such
as those in the genetic, visual, muscular and nervous system; yet its function
has not been fully understood. The conventional interpretation of redundancy is
that it serves as a fault-tolerance mechanism, which leads to redundancy's de
facto application in man-made systems for reliability enhancement. On the
contrary, our previous works have demonstrated an example where redundancy can
be engineered solely for enhancing other aspects of the system, namely accuracy
and precision. This design was inspired by the binocular structure of the human
vision which we believe may share a similar operation. In this paper, we
present a unified theory describing how such utilization of redundancy is
feasible through two complementary mechanisms: representational redundancy
(RPR) and entangled redundancy (ETR). Besides the previous works, we point out
two additional examples where our new understanding of redundancy can be
applied to justify a system's superior performance. One is the human
musculoskeletal system (HMS) - a biological instance, and one is the deep
residual neural network (ResNet) - an artificial counterpart. We envision that
our theory would provide a framework for the future development of bio-inspired
redundant artificial systems as well as assist the studies of the fundamental
mechanisms governing various biological processes.
| cs.IT cs.NE math.IT | redundancy is a fundamental characteristic of many biological processes such as those in the genetic visual muscular and nervous system yet its function has not been fully understood the conventional interpretation of redundancy is that it serves as a faulttolerance mechanism which leads to redundancys de facto application in manmade systems for reliability enhancement on the contrary our previous works have demonstrated an example where redundancy can be engineered solely for enhancing other aspects of the system namely accuracy and precision this design was inspired by the binocular structure of the human vision which we believe may share a similar operation in this paper we present a unified theory describing how such utilization of redundancy is feasible through two complementary mechanisms representational redundancy rpr and entangled redundancy etr besides the previous works we point out two additional examples where our new understanding of redundancy can be applied to justify a systems superior performance one is the human musculoskeletal system hms a biological instance and one is the deep residual neural network resnet an artificial counterpart we envision that our theory would provide a framework for the future development of bioinspired redundant artificial systems as well as assist the studies of the fundamental mechanisms governing various biological processes | [['redundancy', 'is', 'a', 'fundamental', 'characteristic', 'of', 'many', 'biological', 'processes', 'such', 'as', 'those', 'in', 'the', 'genetic', 'visual', 'muscular', 'and', 'nervous', 'system', 'yet', 'its', 'function', 'has', 'not', 'been', 'fully', 'understood', 'the', 'conventional', 'interpretation', 'of', 'redundancy', 'is', 'that', 'it', 'serves', 'as', 'a', 'faulttolerance', 'mechanism', 'which', 'leads', 'to', 'redundancys', 'de', 'facto', 'application', 'in', 'manmade', 'systems', 'for', 'reliability', 'enhancement', 'on', 'the', 'contrary', 'our', 'previous', 'works', 'have', 'demonstrated', 'an', 'example', 'where', 'redundancy', 'can', 'be', 'engineered', 'solely', 'for', 'enhancing', 'other', 'aspects', 'of', 'the', 'system', 'namely', 'accuracy', 'and', 'precision', 'this', 'design', 'was', 'inspired', 'by', 'the', 'binocular', 'structure', 'of', 'the', 'human', 'vision', 'which', 'we', 'believe', 'may', 'share', 'a', 'similar', 'operation', 'in', 'this', 'paper', 'we', 'present', 'a', 'unified', 'theory', 'describing', 'how', 'such', 'utilization', 'of', 'redundancy', 'is', 'feasible', 'through', 'two', 'complementary', 'mechanisms', 'representational', 'redundancy', 'rpr', 'and', 'entangled', 'redundancy', 'etr', 'besides', 'the', 'previous', 'works', 'we', 'point', 'out', 'two', 'additional', 'examples', 'where', 'our', 'new', 'understanding', 'of', 'redundancy', 'can', 'be', 'applied', 'to', 'justify', 'a', 'systems', 'superior', 'performance', 'one', 'is', 'the', 'human', 'musculoskeletal', 'system', 'hms', 'a', 'biological', 'instance', 'and', 'one', 'is', 'the', 'deep', 'residual', 'neural', 'network', 'resnet', 'an', 'artificial', 'counterpart', 'we', 'envision', 'that', 'our', 'theory', 'would', 'provide', 'a', 'framework', 'for', 'the', 'future', 'development', 'of', 'bioinspired', 'redundant', 'artificial', 'systems', 'as', 'well', 'as', 'assist', 'the', 'studies', 'of', 'the', 'fundamental', 'mechanisms', 'governing', 'various', 'biological', 'processes']] | [-0.12160897565422381, 0.05864477060744833, -0.0870971113343913, 0.062401140160695874, -0.08963244322922478, -0.16405385662123417, 0.01951150565173079, 0.36937789572854934, -0.2834646133355597, -0.2966674285032673, 0.09203186525920297, -0.2364815479976315, -0.28463943454536417, 0.2147042240234865, -0.13668983238884835, 0.0820765855619842, 0.06019736125328334, 0.03938252864718026, -0.002749154703619266, -0.23717650416130834, 0.2773343224888803, 0.10407421767168556, 0.3286815618754826, 0.04169806522018846, 0.09353199666953708, -0.009746783886565963, -0.0007872952225175008, 0.00409776421130445, -0.03845282475874043, 0.16001999497275746, 0.2988195705987079, 0.19374605291410016, 0.309379146293086, -0.43461869149107163, -0.2992765110684559, 0.08332907548908922, 0.17393242772239106, 0.12122593705601159, -0.04661880535338056, -0.24960121914780545, 0.08606074626859304, -0.18107826257174273, -0.0987330595069809, -0.12256524694893618, -0.022552999310312426, -0.004343260380832786, -0.2482155826978625, 0.002493987174125985, 0.0958374491694962, 0.0879883334209896, -0.04813119351470536, -0.1121130559703073, 0.01918412271143362, 0.17728466504407162, 0.0019990571099785565, 0.029045545629698116, 0.15744356344933214, -0.14006738052296552, -0.17616139251503696, 0.37250112694715265, -0.0070692507416751345, -0.2015741658939537, 0.2582282081429476, -0.018783457694774113, -0.16257879844961634, 0.06790698810652332, 0.17057613715997363, 0.07944343606624933, -0.19420129492527408, 0.04989789921487456, -0.017982026914731393, 0.18000842998602803, 0.044202354437111, 0.10001560356422752, 0.21703715427796746, 0.2709030231949195, 0.021009314283943346, 0.11631080980138012, -0.053524830524393725, -0.09181727394371213, -0.2528938118467849, -0.1637240073878716, -0.15048749700134384, 0.032654448722116765, -0.0749052897820733, -0.12129946317957732, 0.36649862042112835, 0.18761531626907385, 0.17042254994948874, 0.032111183823836806, 0.3302090284052911, 0.06276557471736524, 0.12758981704811376, 0.006368716218558511, 0.2455519273418264, 0.0480075217263538, 0.11974881813427415, -0.20889038683900846, 0.10747264691818396, 0.02931063840995335] |
1,802.05325 | Cooperativity of short-time dynamics revisited | Using molecular dynamics simulations we examine the system size dependence of
the fast dynamics in two model glass forming liquids, one of them a
Lennard-Jones mixture for which cooperative fast relaxation has been reported.
We find no indication of a temperature-dependent dynamic length scale
characterizing these fast dynamics; the size effects in the short time range
are temperature independent, and the consequence of cutting off of long
wavelength acoustic modes. In a molecular liquid exhibiting a clear
Johari-Goldstein (JG) relaxation, significant size effects are again present
both for the vibrational motion and long-time {\alpha} relaxation (only the
latter having a significant temperature dependence), but absent for the JG
relaxation.
| cond-mat.soft | using molecular dynamics simulations we examine the system size dependence of the fast dynamics in two model glass forming liquids one of them a lennardjones mixture for which cooperative fast relaxation has been reported we find no indication of a temperaturedependent dynamic length scale characterizing these fast dynamics the size effects in the short time range are temperature independent and the consequence of cutting off of long wavelength acoustic modes in a molecular liquid exhibiting a clear joharigoldstein jg relaxation significant size effects are again present both for the vibrational motion and longtime alpha relaxation only the latter having a significant temperature dependence but absent for the jg relaxation | [['using', 'molecular', 'dynamics', 'simulations', 'we', 'examine', 'the', 'system', 'size', 'dependence', 'of', 'the', 'fast', 'dynamics', 'in', 'two', 'model', 'glass', 'forming', 'liquids', 'one', 'of', 'them', 'a', 'lennardjones', 'mixture', 'for', 'which', 'cooperative', 'fast', 'relaxation', 'has', 'been', 'reported', 'we', 'find', 'no', 'indication', 'of', 'a', 'temperaturedependent', 'dynamic', 'length', 'scale', 'characterizing', 'these', 'fast', 'dynamics', 'the', 'size', 'effects', 'in', 'the', 'short', 'time', 'range', 'are', 'temperature', 'independent', 'and', 'the', 'consequence', 'of', 'cutting', 'off', 'of', 'long', 'wavelength', 'acoustic', 'modes', 'in', 'a', 'molecular', 'liquid', 'exhibiting', 'a', 'clear', 'joharigoldstein', 'jg', 'relaxation', 'significant', 'size', 'effects', 'are', 'again', 'present', 'both', 'for', 'the', 'vibrational', 'motion', 'and', 'longtime', 'alpha', 'relaxation', 'only', 'the', 'latter', 'having', 'a', 'significant', 'temperature', 'dependence', 'but', 'absent', 'for', 'the', 'jg', 'relaxation']] | [-0.1613273459226064, 0.2066437257197472, -0.11055175680667162, 0.04781265856715244, -0.012898275833747802, -0.1350701745971183, 0.029166531516239047, 0.3954195391489278, -0.28876599180058216, -0.2539506352019556, 0.06523720971885386, -0.2473515001202532, -0.10081734614224609, 0.1679305686987082, 0.08588301026851895, 0.02793381365716731, -0.0014039291701185594, -0.028534349961924034, -0.05733393541742287, -0.14835888677097242, 0.1827459643849112, 0.056102159734251436, 0.2638756725851686, 0.07663960308007417, 0.09112764476721577, 0.02210579880239835, 0.016403684343442047, 0.0494547638232572, -0.18915051968614444, -0.021384656728339304, 0.19778283056375837, -0.0034953573107353087, 0.26658908677620624, -0.4288839583003193, -0.24328683646515423, 0.08484463696581644, 0.14715880845083829, 0.15059056859612976, -0.04929509911891244, -0.18481817931938627, -0.010190970702267705, -0.1223997771996287, -0.1329852359160063, -0.07537257943490366, 0.1168273846541933, 0.027655875327123262, -0.20123973392898542, 0.17184286063789056, 0.09594735879143444, 0.07798493495467332, -0.07360869258804538, -0.1358666879737989, 0.022967875828334223, 0.09616519501026925, 0.049792890059932586, -0.00749468229018972, 0.19282107910893242, -0.1097183429033692, -0.07262509335857739, 0.35435921512544155, -0.08842808382645455, -0.12999675557905926, 0.2701391667606087, -0.17679657797764883, -0.11155622912177798, 0.22499364692239313, 0.14898730466706217, 0.11847402144291806, -0.14692321794808183, 0.03461968741025092, -0.016322374638648482, 0.23816264606157847, 0.06472478389158981, 0.06573797327812352, 0.22149186964689352, 0.2721998265970054, 0.001804754009829202, 0.15171605401561347, -0.12118410272764067, -0.13603999929656402, -0.2306311843968039, -0.12022148453365636, -0.18157139579432274, 0.06779347619451924, -0.11254477657248488, -0.17412939549791157, 0.38353285153445554, 0.07919387644319155, 0.198198791025121, 0.06532532574903699, 0.24968180314150698, 0.08571984979042083, 0.07640263051170548, 0.08061675304427333, 0.24630515504662598, 0.10750853540824401, 0.08839991362338219, -0.3473908303459303, 0.10045532503703591, 0.007312960897085317] |
1,802.05326 | Analysis of Financial Credit Risk Using Machine Learning | Corporate insolvency can have a devastating effect on the economy. With an
increasing number of companies making expansion overseas to capitalize on
foreign resources, a multinational corporate bankruptcy can disrupt the world's
financial ecosystem. Corporations do not fail instantaneously; objective
measures and rigorous analysis of qualitative (e.g. brand) and quantitative
(e.g. econometric factors) data can help identify a company's financial risk.
Gathering and storage of data about a corporation has become less difficult
with recent advancements in communication and information technologies. The
remaining challenge lies in mining relevant information about a company's
health hidden under the vast amounts of data, and using it to forecast
insolvency so that managers and stakeholders have time to react. In recent
years, machine learning has become a popular field in big data analytics
because of its success in learning complicated models. Methods such as support
vector machines, adaptive boosting, artificial neural networks, and Gaussian
processes can be used for recognizing patterns in the data (with a high degree
of accuracy) that may not be apparent to human analysts. This thesis studied
corporate bankruptcy of manufacturing companies in Korea and Poland using
experts' opinions and financial measures, respectively. Using publicly
available datasets, several machine learning methods were applied to learn the
relationship between the company's current state and its fate in the near
future. Results showed that predictions with accuracy greater than 95% were
achievable using any machine learning technique when informative features like
experts' assessment were used. However, when using purely financial factors to
predict whether or not a company will go bankrupt, the correlation is not as
strong.
| q-fin.ST econ.EM q-fin.MF | corporate insolvency can have a devastating effect on the economy with an increasing number of companies making expansion overseas to capitalize on foreign resources a multinational corporate bankruptcy can disrupt the worlds financial ecosystem corporations do not fail instantaneously objective measures and rigorous analysis of qualitative eg brand and quantitative eg econometric factors data can help identify a companys financial risk gathering and storage of data about a corporation has become less difficult with recent advancements in communication and information technologies the remaining challenge lies in mining relevant information about a companys health hidden under the vast amounts of data and using it to forecast insolvency so that managers and stakeholders have time to react in recent years machine learning has become a popular field in big data analytics because of its success in learning complicated models methods such as support vector machines adaptive boosting artificial neural networks and gaussian processes can be used for recognizing patterns in the data with a high degree of accuracy that may not be apparent to human analysts this thesis studied corporate bankruptcy of manufacturing companies in korea and poland using experts opinions and financial measures respectively using publicly available datasets several machine learning methods were applied to learn the relationship between the companys current state and its fate in the near future results showed that predictions with accuracy greater than 95 were achievable using any machine learning technique when informative features like experts assessment were used however when using purely financial factors to predict whether or not a company will go bankrupt the correlation is not as strong | [['corporate', 'insolvency', 'can', 'have', 'a', 'devastating', 'effect', 'on', 'the', 'economy', 'with', 'an', 'increasing', 'number', 'of', 'companies', 'making', 'expansion', 'overseas', 'to', 'capitalize', 'on', 'foreign', 'resources', 'a', 'multinational', 'corporate', 'bankruptcy', 'can', 'disrupt', 'the', 'worlds', 'financial', 'ecosystem', 'corporations', 'do', 'not', 'fail', 'instantaneously', 'objective', 'measures', 'and', 'rigorous', 'analysis', 'of', 'qualitative', 'eg', 'brand', 'and', 'quantitative', 'eg', 'econometric', 'factors', 'data', 'can', 'help', 'identify', 'a', 'companys', 'financial', 'risk', 'gathering', 'and', 'storage', 'of', 'data', 'about', 'a', 'corporation', 'has', 'become', 'less', 'difficult', 'with', 'recent', 'advancements', 'in', 'communication', 'and', 'information', 'technologies', 'the', 'remaining', 'challenge', 'lies', 'in', 'mining', 'relevant', 'information', 'about', 'a', 'companys', 'health', 'hidden', 'under', 'the', 'vast', 'amounts', 'of', 'data', 'and', 'using', 'it', 'to', 'forecast', 'insolvency', 'so', 'that', 'managers', 'and', 'stakeholders', 'have', 'time', 'to', 'react', 'in', 'recent', 'years', 'machine', 'learning', 'has', 'become', 'a', 'popular', 'field', 'in', 'big', 'data', 'analytics', 'because', 'of', 'its', 'success', 'in', 'learning', 'complicated', 'models', 'methods', 'such', 'as', 'support', 'vector', 'machines', 'adaptive', 'boosting', 'artificial', 'neural', 'networks', 'and', 'gaussian', 'processes', 'can', 'be', 'used', 'for', 'recognizing', 'patterns', 'in', 'the', 'data', 'with', 'a', 'high', 'degree', 'of', 'accuracy', 'that', 'may', 'not', 'be', 'apparent', 'to', 'human', 'analysts', 'this', 'thesis', 'studied', 'corporate', 'bankruptcy', 'of', 'manufacturing', 'companies', 'in', 'korea', 'and', 'poland', 'using', 'experts', 'opinions', 'and', 'financial', 'measures', 'respectively', 'using', 'publicly', 'available', 'datasets', 'several', 'machine', 'learning', 'methods', 'were', 'applied', 'to', 'learn', 'the', 'relationship', 'between', 'the', 'companys', 'current', 'state', 'and', 'its', 'fate', 'in', 'the', 'near', 'future', 'results', 'showed', 'that', 'predictions', 'with', 'accuracy', 'greater', 'than', '95', 'were', 'achievable', 'using', 'any', 'machine', 'learning', 'technique', 'when', 'informative', 'features', 'like', 'experts', 'assessment', 'were', 'used', 'however', 'when', 'using', 'purely', 'financial', 'factors', 'to', 'predict', 'whether', 'or', 'not', 'a', 'company', 'will', 'go', 'bankrupt', 'the', 'correlation', 'is', 'not', 'as', 'strong']] | [-0.042720603739034455, 0.06004798705563309, -0.08893620609042217, 0.11710698669249157, -0.14926501980473128, -0.16559343150693853, 0.09028283041146284, 0.4099116112070404, -0.2494076330777047, -0.3263250728664955, 0.17032111783968812, -0.3553936931322206, -0.13651245521855945, 0.19965777622737904, -0.13708075515328433, 0.06934645338871358, 0.09275597156429628, 0.058988931202241836, 0.027465798474303534, -0.3183729837578282, 0.261639229735834, 0.07749459569360007, 0.3538396302522775, 0.0651596049222445, 0.05884323385456261, -0.016207895420913426, -0.05320176894794095, -0.009871135736754678, -0.07506609581318083, 0.18547621971382847, 0.38060924650301975, 0.2492389184440363, 0.4221182677086513, -0.46487964390478326, -0.19770593502842118, 0.16226977702111603, 0.10338193096741068, 0.052636612620136594, 0.0065141695235276, -0.3187669321530024, 0.03130051280472884, -0.23305035885560704, -0.08551160471408435, -0.14948257404310356, 0.014778073782041967, 0.012355210313810703, -0.25920983062143316, 0.017594303839119536, -0.01480890835200454, 0.12923030486244727, -0.018899215201689107, -0.12141374369450617, -0.02440134093499268, 0.20834904541019877, 0.10802881095716554, 0.007996604613573202, 0.1821340612346693, -0.1935624775520684, -0.18228163487378965, 0.35480788427774074, -0.039521627212745, -0.1544741094643953, 0.18350487196651058, -0.09062620755372885, -0.16082969943131759, 0.06965159670151068, 0.2645030777918983, 0.004445606857573368, -0.19416539120347293, 0.013099992868736527, 0.025375850303227605, 0.1957081219989736, 0.06752617329113045, -0.017912177837295633, 0.20584918485146086, 0.22470096618393964, 0.028391108508573248, 0.054479324662144175, -0.05592029960474597, -0.11450357228201234, -0.15654166180130868, -0.11746415601920267, -0.15335124620205706, 0.045741783272044485, -0.08423710444992637, -0.14534129470763596, 0.3207386993688865, 0.21404834650720486, 0.12351376721459739, 0.031268207522829605, 0.31205193564506634, 0.019454515046211627, 0.12116738929290254, 0.11701627717230399, 0.19743199375335058, -0.0071556260062487055, 0.1908118798766496, -0.10654952554735092, 0.20289141336227504, -0.06602619751971567] |
1,802.05327 | On the Fundamentality of Meaning | The mainstream view of meaning is that it is emergent, not fundamental, but
some have disputed this, asserting that there is a more fundamental level of
reality than that addressed by current physical theories, and that matter and
meaning are in some way entangled. In this regard there are intriguing
parallels between the quantum and biological domains, suggesting that there may
be a more fundamental level underlying both. I argue that the organisation of
this fundamental level is already to a considerable extent understood by
biosemioticians, who have fruitfully integrated Peirce's sign theory into
biology; things will happen there resembling what happens with familiar life,
but the agencies involved will differ in ways reflecting their fundamentality,
in other words they will be less complex, but still have structures complex
enough for what they have to do. According to one approach involving a
collaboration with which I have been involved, a part of what they have to do,
along with the need to survive and reproduce, is to stop situations becoming
too chaotic, a concept that accords with familiar 'edge of chaos' ideas. Such
an extension of sign theory (semiophysics?) needs to be explored by physicists,
possible tools being computational models, existing insights into complexity,
and dynamical systems theory. Such a theory will not be mathematical in the
same way that conventional physics theories are mathematical: rather than being
foundational, mathematics will be 'something that life does', something that
sufficiently evolved life does because in the appropriate context so doing is
of value to life.
| physics.gen-ph | the mainstream view of meaning is that it is emergent not fundamental but some have disputed this asserting that there is a more fundamental level of reality than that addressed by current physical theories and that matter and meaning are in some way entangled in this regard there are intriguing parallels between the quantum and biological domains suggesting that there may be a more fundamental level underlying both i argue that the organisation of this fundamental level is already to a considerable extent understood by biosemioticians who have fruitfully integrated peirces sign theory into biology things will happen there resembling what happens with familiar life but the agencies involved will differ in ways reflecting their fundamentality in other words they will be less complex but still have structures complex enough for what they have to do according to one approach involving a collaboration with which i have been involved a part of what they have to do along with the need to survive and reproduce is to stop situations becoming too chaotic a concept that accords with familiar edge of chaos ideas such an extension of sign theory semiophysics needs to be explored by physicists possible tools being computational models existing insights into complexity and dynamical systems theory such a theory will not be mathematical in the same way that conventional physics theories are mathematical rather than being foundational mathematics will be something that life does something that sufficiently evolved life does because in the appropriate context so doing is of value to life | [['the', 'mainstream', 'view', 'of', 'meaning', 'is', 'that', 'it', 'is', 'emergent', 'not', 'fundamental', 'but', 'some', 'have', 'disputed', 'this', 'asserting', 'that', 'there', 'is', 'a', 'more', 'fundamental', 'level', 'of', 'reality', 'than', 'that', 'addressed', 'by', 'current', 'physical', 'theories', 'and', 'that', 'matter', 'and', 'meaning', 'are', 'in', 'some', 'way', 'entangled', 'in', 'this', 'regard', 'there', 'are', 'intriguing', 'parallels', 'between', 'the', 'quantum', 'and', 'biological', 'domains', 'suggesting', 'that', 'there', 'may', 'be', 'a', 'more', 'fundamental', 'level', 'underlying', 'both', 'i', 'argue', 'that', 'the', 'organisation', 'of', 'this', 'fundamental', 'level', 'is', 'already', 'to', 'a', 'considerable', 'extent', 'understood', 'by', 'biosemioticians', 'who', 'have', 'fruitfully', 'integrated', 'peirces', 'sign', 'theory', 'into', 'biology', 'things', 'will', 'happen', 'there', 'resembling', 'what', 'happens', 'with', 'familiar', 'life', 'but', 'the', 'agencies', 'involved', 'will', 'differ', 'in', 'ways', 'reflecting', 'their', 'fundamentality', 'in', 'other', 'words', 'they', 'will', 'be', 'less', 'complex', 'but', 'still', 'have', 'structures', 'complex', 'enough', 'for', 'what', 'they', 'have', 'to', 'do', 'according', 'to', 'one', 'approach', 'involving', 'a', 'collaboration', 'with', 'which', 'i', 'have', 'been', 'involved', 'a', 'part', 'of', 'what', 'they', 'have', 'to', 'do', 'along', 'with', 'the', 'need', 'to', 'survive', 'and', 'reproduce', 'is', 'to', 'stop', 'situations', 'becoming', 'too', 'chaotic', 'a', 'concept', 'that', 'accords', 'with', 'familiar', 'edge', 'of', 'chaos', 'ideas', 'such', 'an', 'extension', 'of', 'sign', 'theory', 'semiophysics', 'needs', 'to', 'be', 'explored', 'by', 'physicists', 'possible', 'tools', 'being', 'computational', 'models', 'existing', 'insights', 'into', 'complexity', 'and', 'dynamical', 'systems', 'theory', 'such', 'a', 'theory', 'will', 'not', 'be', 'mathematical', 'in', 'the', 'same', 'way', 'that', 'conventional', 'physics', 'theories', 'are', 'mathematical', 'rather', 'than', 'being', 'foundational', 'mathematics', 'will', 'be', 'something', 'that', 'life', 'does', 'something', 'that', 'sufficiently', 'evolved', 'life', 'does', 'because', 'in', 'the', 'appropriate', 'context', 'so', 'doing', 'is', 'of', 'value', 'to', 'life']] | [-0.06768422601153216, 0.18501560823371244, -0.14747606267753458, 0.13937702626941564, -0.1371032692536357, -0.17988714856688776, 0.02125743517039126, 0.3821407296724381, -0.2627150382077883, -0.3150414205433446, 0.12004562889757965, -0.2527229899119231, -0.20799258903458567, 0.19258129872688431, -0.11884922671523536, -0.025433818931647, 0.0445599895366098, 0.06665515175019021, -0.026853698984413067, -0.25385730647821986, 0.303600149522517, 0.0384830116836672, 0.2383547122839705, 0.042822258127021735, 0.010787960055047676, -0.06858134216495923, -0.009634041318407519, 0.05960531269464275, -0.08552333874410131, 0.13848135456935287, 0.32663155232975916, 0.18713281641834734, 0.3254183294521349, -0.47242240563020227, -0.2404764870556796, 0.13234948533557592, 0.17885236651821446, 0.10667778408045821, -0.04589281572522836, -0.2384087250444166, 0.08969506214045742, -0.14678353443095046, -0.1473624472097967, -0.08560534141863518, 0.05157483213752996, -0.044717749807912495, -0.14811976575629882, 0.02316787817177274, 0.07893250076437927, 0.06339426037840663, 0.005735153367462021, -0.10331380500140348, -0.011407957747689493, 0.15355930746059923, 0.07258602092319745, 0.03914854349141168, 0.1227154518285441, -0.16121171894926756, -0.1221067397522607, 0.4338344220101597, 0.032383239525578186, -0.20700946560458441, 0.2662127227409251, -0.16626395103946653, -0.17145430109840595, 0.08376042153718623, 0.10118715900563753, 0.03568071833560391, -0.14892707962361681, 0.08425916676614656, -0.0358001667533129, 0.171619735507568, 0.06599295040082541, 0.06711688247049183, 0.2672352111706185, 0.1303981342685542, 0.04593926137091503, 0.011708707845952761, 0.054026953754983544, -0.15844543853849505, -0.25922419702900307, -0.15142102724510348, -0.1394702631532998, 0.08939147237718331, 0.010662892305152213, -0.140940483402653, 0.33105277858807575, 0.20281596921822279, 0.15163797316488722, -0.003997409717634409, 0.2661088102216285, 0.10806426323353431, 0.1310408951646264, 0.04273345896194408, 0.2634124935365334, 0.07439838458242501, 0.13759765977276459, -0.09402414463785669, 0.11984484682611693, -0.002241182626993765] |
1,802.05328 | Vortex dynamics and Reynolds number effects of an oscillating hydrofoil
in energy harvesting mode | The energy extraction and vortex dynamics from the sinusoidal heaving and
pitching motion of an elliptical hydrofoil is explored through large-eddy
simulations (LES) at a Reynolds number of $50,000$. The LES is able to capture
the time-dependent vortex shedding and dynamic stall properties of the foil as
it undergoes high relative angles of attack. Results of the computations are
validated against experimental flume data in terms of power extraction and
leading edge vortex (LEV) position and trajectory. The kinematics for optimal
efficiency are found in the range of heave amplitude $h_o/c=0.5-1$ and pitch
amplitude $\theta_o=60^{\circ}-65^{\circ}$ for $fc/U_{\infty}=0.1$ and of
$h_o/c=1-1.5$ and $\theta_o=75^{\circ}-85^{\circ}$ for $fc/U_{\infty}=0.15$.
Direct comparison with low Reynolds number simulations and experiments
demonstrate strong agreement in energy harvesting performance between Reynolds
numbers of $1000$ to $50,000$, with the high Reynolds number flows
demonstrating a moderate $0.8-6.7\%$ increase in power compared to the low
Reynolds number flow. In the high Reynolds number flows, the coherent LEV,
which is critical for high-efficiency energy conversion, forms earlier and is
slightly stronger, resulting in more power extraction. After the LEV is shed
from the foil, the LEV trajectory is demonstrated to be relatively independent
of Reynolds number, but has a very strong nonlinear dependence with kinematics.
It is shown that the LEV trajectories are highly influenced by the heave and
pitch amplitudes as well as the oscillation frequency. This has strong
implications for arrays of oscillating foils since the coherent LEVs can
influence the energy extraction efficiency and performance of downstream foils.
| physics.flu-dyn | the energy extraction and vortex dynamics from the sinusoidal heaving and pitching motion of an elliptical hydrofoil is explored through largeeddy simulations les at a reynolds number of 50000 the les is able to capture the timedependent vortex shedding and dynamic stall properties of the foil as it undergoes high relative angles of attack results of the computations are validated against experimental flume data in terms of power extraction and leading edge vortex lev position and trajectory the kinematics for optimal efficiency are found in the range of heave amplitude h_oc051 and pitch amplitude theta_o60circ65circ for fcu_infty01 and of h_oc115 and theta_o75circ85circ for fcu_infty015 direct comparison with low reynolds number simulations and experiments demonstrate strong agreement in energy harvesting performance between reynolds numbers of 1000 to 50000 with the high reynolds number flows demonstrating a moderate 0867 increase in power compared to the low reynolds number flow in the high reynolds number flows the coherent lev which is critical for highefficiency energy conversion forms earlier and is slightly stronger resulting in more power extraction after the lev is shed from the foil the lev trajectory is demonstrated to be relatively independent of reynolds number but has a very strong nonlinear dependence with kinematics it is shown that the lev trajectories are highly influenced by the heave and pitch amplitudes as well as the oscillation frequency this has strong implications for arrays of oscillating foils since the coherent levs can influence the energy extraction efficiency and performance of downstream foils | [['the', 'energy', 'extraction', 'and', 'vortex', 'dynamics', 'from', 'the', 'sinusoidal', 'heaving', 'and', 'pitching', 'motion', 'of', 'an', 'elliptical', 'hydrofoil', 'is', 'explored', 'through', 'largeeddy', 'simulations', 'les', 'at', 'a', 'reynolds', 'number', 'of', '50000', 'the', 'les', 'is', 'able', 'to', 'capture', 'the', 'timedependent', 'vortex', 'shedding', 'and', 'dynamic', 'stall', 'properties', 'of', 'the', 'foil', 'as', 'it', 'undergoes', 'high', 'relative', 'angles', 'of', 'attack', 'results', 'of', 'the', 'computations', 'are', 'validated', 'against', 'experimental', 'flume', 'data', 'in', 'terms', 'of', 'power', 'extraction', 'and', 'leading', 'edge', 'vortex', 'lev', 'position', 'and', 'trajectory', 'the', 'kinematics', 'for', 'optimal', 'efficiency', 'are', 'found', 'in', 'the', 'range', 'of', 'heave', 'amplitude', 'h_oc051', 'and', 'pitch', 'amplitude', 'theta_o60circ65circ', 'for', 'fcu_infty01', 'and', 'of', 'h_oc115', 'and', 'theta_o75circ85circ', 'for', 'fcu_infty015', 'direct', 'comparison', 'with', 'low', 'reynolds', 'number', 'simulations', 'and', 'experiments', 'demonstrate', 'strong', 'agreement', 'in', 'energy', 'harvesting', 'performance', 'between', 'reynolds', 'numbers', 'of', '1000', 'to', '50000', 'with', 'the', 'high', 'reynolds', 'number', 'flows', 'demonstrating', 'a', 'moderate', '0867', 'increase', 'in', 'power', 'compared', 'to', 'the', 'low', 'reynolds', 'number', 'flow', 'in', 'the', 'high', 'reynolds', 'number', 'flows', 'the', 'coherent', 'lev', 'which', 'is', 'critical', 'for', 'highefficiency', 'energy', 'conversion', 'forms', 'earlier', 'and', 'is', 'slightly', 'stronger', 'resulting', 'in', 'more', 'power', 'extraction', 'after', 'the', 'lev', 'is', 'shed', 'from', 'the', 'foil', 'the', 'lev', 'trajectory', 'is', 'demonstrated', 'to', 'be', 'relatively', 'independent', 'of', 'reynolds', 'number', 'but', 'has', 'a', 'very', 'strong', 'nonlinear', 'dependence', 'with', 'kinematics', 'it', 'is', 'shown', 'that', 'the', 'lev', 'trajectories', 'are', 'highly', 'influenced', 'by', 'the', 'heave', 'and', 'pitch', 'amplitudes', 'as', 'well', 'as', 'the', 'oscillation', 'frequency', 'this', 'has', 'strong', 'implications', 'for', 'arrays', 'of', 'oscillating', 'foils', 'since', 'the', 'coherent', 'levs', 'can', 'influence', 'the', 'energy', 'extraction', 'efficiency', 'and', 'performance', 'of', 'downstream', 'foils']] | [-0.16553382650439324, 0.18761873888403968, -0.0644320957992636, 0.016400119895307125, -0.046945539531163843, -0.10025158137995213, -0.012674453591644274, 0.3267877983626883, -0.23945151708268947, -0.355287637722529, 0.0678175816958226, -0.25966035660524917, -0.08151159221268117, 0.27932578211060033, -0.040065282983552095, 0.090237777320373, 0.08201180314673916, -8.779295064784862e-05, 0.02646655576981972, -0.1646803912520792, 0.22879907425776613, 0.13538707729137728, 0.34352616694422416, 0.06966403979758268, 0.11373292205236285, -0.05049038348363644, -0.012656279782086242, 0.04561817723636826, -0.13127384169344955, 0.05411622607735572, 0.23107964288895574, 0.0309720538020191, 0.25729563522608684, -0.43325637258711913, -0.1844166806580905, 0.01825865107701532, 0.13933030851573372, 0.09151333447214247, -0.05564059734272861, -0.23302295887191232, 0.12706229041010494, -0.1759089311247561, -0.10634685281056666, -0.08255927369128836, 0.06550368722604871, 0.11053879644698751, -0.2657460093775136, 0.10077973365627513, 0.01980136067634894, 0.10073251071397538, -0.02070964963573947, -0.08600672872146829, -0.08258950800266991, 0.10327182367248576, 0.10538217580755439, 0.013823991918307825, 0.16217401252921532, -0.20051316222187454, -0.04674544332763602, 0.3689897412370982, -0.025034462630656767, -0.17115819926369827, 0.20041352026634027, -0.15908730599201387, -0.024463034211945386, 0.20603608904759027, 0.17903753082601376, 0.09478391587629784, -0.03385313307059691, -0.007873249352083698, -0.033432754884864906, 0.1799512072174078, 0.1447149599852508, -0.026220471316781097, 0.20038894525898712, 0.19578803781086557, 0.0362656916388207, 0.1199232994637705, -0.16990570887662623, -0.08833321558652683, -0.24219268893462764, -0.11311029602386395, -0.1624534231832887, 0.009550024019439279, -0.08354922012895932, -0.12256003378968544, 0.3735543926966994, 0.12394507024667145, 0.21402935177392476, 0.04270428184989012, 0.3249955363686622, 0.10866891011191386, 0.034497185334287306, 0.08346184431345283, 0.2934616275338663, 0.15655001960100737, 0.15299263679893849, -0.26374443281832854, 0.0564090608266554, 0.04662726434338608] |
1,802.05329 | Beam shaping algorithm with optimization parameters | In this article, we present a general mode-conversion algorithm allowing to
build an optical system composed of an alternation of phase masks and free
propagations. The originality of our approach lies in the introduction of free
parameters that can be used to perform an optimization regarding some
properties of interest. Here, we apply this algorithm to overlap balancing, for
the conversion of an important number of modes with limited phase resources.
Moreover, we discuss about the convergence and the limitations of such an
algorithm, notably concerning the loss of unitarity that tends to occur in a
practical implementation.
| physics.comp-ph | in this article we present a general modeconversion algorithm allowing to build an optical system composed of an alternation of phase masks and free propagations the originality of our approach lies in the introduction of free parameters that can be used to perform an optimization regarding some properties of interest here we apply this algorithm to overlap balancing for the conversion of an important number of modes with limited phase resources moreover we discuss about the convergence and the limitations of such an algorithm notably concerning the loss of unitarity that tends to occur in a practical implementation | [['in', 'this', 'article', 'we', 'present', 'a', 'general', 'modeconversion', 'algorithm', 'allowing', 'to', 'build', 'an', 'optical', 'system', 'composed', 'of', 'an', 'alternation', 'of', 'phase', 'masks', 'and', 'free', 'propagations', 'the', 'originality', 'of', 'our', 'approach', 'lies', 'in', 'the', 'introduction', 'of', 'free', 'parameters', 'that', 'can', 'be', 'used', 'to', 'perform', 'an', 'optimization', 'regarding', 'some', 'properties', 'of', 'interest', 'here', 'we', 'apply', 'this', 'algorithm', 'to', 'overlap', 'balancing', 'for', 'the', 'conversion', 'of', 'an', 'important', 'number', 'of', 'modes', 'with', 'limited', 'phase', 'resources', 'moreover', 'we', 'discuss', 'about', 'the', 'convergence', 'and', 'the', 'limitations', 'of', 'such', 'an', 'algorithm', 'notably', 'concerning', 'the', 'loss', 'of', 'unitarity', 'that', 'tends', 'to', 'occur', 'in', 'a', 'practical', 'implementation']] | [-0.11983428968648825, 0.07522959474249083, -0.08184635350528192, 0.020279136655034915, -0.07259855738707952, -0.08109866053208101, 0.08291643898582504, 0.3956069300445367, -0.2835788560499038, -0.3102635818733169, 0.11265387169289764, -0.22266111078158934, -0.1725448827587106, 0.20571735349236703, -0.10329221154810214, 0.05353941796917697, 0.053033350738791785, 0.020751792707062344, -0.07530355080665203, -0.23602119084371595, 0.3006960546184445, 0.0806535949778496, 0.2582074195118051, 0.08253646798298828, 0.08735422414195325, 0.02103740049345533, 0.0038020555809026167, -0.006533739252053961, -0.14073233378232025, 0.15231073851107943, 0.2139308773247259, 0.164601062101369, 0.30215585095883934, -0.41906195631896964, -0.17824026861475134, 0.10811414391904765, 0.18001214921360417, 0.13228371250918325, -0.06084169434592584, -0.2242766737270321, 0.04474685275903428, -0.16253199537607785, -0.14334693496894776, -0.10057810743871544, -0.031924466432632914, 0.01595906291765218, -0.269801907193828, 0.027257545043391233, 0.08252268858558061, 0.03874576177919635, -0.04545053792553146, -0.08708569682820948, 0.05080263044599596, 0.14232200956238167, 0.04336327472131471, -0.008248462398745576, 0.07207027828910065, -0.13490809630887696, -0.1262333131186208, 0.39465569982267157, -0.01833334851924482, -0.19306638468132944, 0.1899175497855307, -0.0643574883115991, -0.1417881899717625, 0.12512026837556528, 0.20069449068443868, 0.12105729231107219, -0.10850623260580042, 0.042137185694906404, -0.010428811765599007, 0.1934937922835198, 0.04755481130595566, 0.06046242252460263, 0.15440241369295257, 0.202955429641796, 0.08352301982041373, 0.1852295964977666, -0.07761985604052565, -0.07601702544001901, -0.32967831134054887, -0.18198047124315053, -0.1750282944199078, 0.007349262158956607, -0.059459824537637415, -0.18390700595491394, 0.4088105897951339, 0.24307661348174572, 0.19369288237423313, 0.02688842476583181, 0.31609082254296056, 0.12025640965843269, 0.030949091336247986, 0.06691956051568292, 0.2339610024275168, 0.11935370134151711, 0.07677529688582432, -0.23032807022789303, 0.03114599984006158, 0.013872480141093992] |
1,802.0533 | GapFlyt: Active Vision Based Minimalist Structure-less Gap Detection For
Quadrotor Flight | Although quadrotors, and aerial robots in general, are inherently active
agents, their perceptual capabilities in literature so far have been mostly
passive in nature. Researchers and practitioners today use traditional computer
vision algorithms with the aim of building a representation of general
applicability: a 3D reconstruction of the scene. Using this representation,
planning tasks are constructed and accomplished to allow the quadrotor to
demonstrate autonomous behavior. These methods are inefficient as they are not
task driven and such methodologies are not utilized by flying insects and
birds. Such agents have been solving the problem of navigation and complex
control for ages without the need to build a 3D map and are highly task driven.
In this paper, we propose this framework of bio-inspired perceptual design for
quadrotors. We use this philosophy to design a minimalist sensori-motor
framework for a quadrotor to fly though unknown gaps without a 3D
reconstruction of the scene using only a monocular camera and onboard sensing.
We successfully evaluate and demonstrate the proposed approach in many
real-world experiments with different settings and window shapes, achieving a
success rate of 85% at 2.5ms$^{-1}$ even with a minimum tolerance of just 5cm.
To our knowledge, this is the first paper which addresses the problem of gap
detection of an unknown shape and location with a monocular camera and onboard
sensing.
| cs.RO | although quadrotors and aerial robots in general are inherently active agents their perceptual capabilities in literature so far have been mostly passive in nature researchers and practitioners today use traditional computer vision algorithms with the aim of building a representation of general applicability a 3d reconstruction of the scene using this representation planning tasks are constructed and accomplished to allow the quadrotor to demonstrate autonomous behavior these methods are inefficient as they are not task driven and such methodologies are not utilized by flying insects and birds such agents have been solving the problem of navigation and complex control for ages without the need to build a 3d map and are highly task driven in this paper we propose this framework of bioinspired perceptual design for quadrotors we use this philosophy to design a minimalist sensorimotor framework for a quadrotor to fly though unknown gaps without a 3d reconstruction of the scene using only a monocular camera and onboard sensing we successfully evaluate and demonstrate the proposed approach in many realworld experiments with different settings and window shapes achieving a success rate of 85 at 25ms1 even with a minimum tolerance of just 5cm to our knowledge this is the first paper which addresses the problem of gap detection of an unknown shape and location with a monocular camera and onboard sensing | [['although', 'quadrotors', 'and', 'aerial', 'robots', 'in', 'general', 'are', 'inherently', 'active', 'agents', 'their', 'perceptual', 'capabilities', 'in', 'literature', 'so', 'far', 'have', 'been', 'mostly', 'passive', 'in', 'nature', 'researchers', 'and', 'practitioners', 'today', 'use', 'traditional', 'computer', 'vision', 'algorithms', 'with', 'the', 'aim', 'of', 'building', 'a', 'representation', 'of', 'general', 'applicability', 'a', '3d', 'reconstruction', 'of', 'the', 'scene', 'using', 'this', 'representation', 'planning', 'tasks', 'are', 'constructed', 'and', 'accomplished', 'to', 'allow', 'the', 'quadrotor', 'to', 'demonstrate', 'autonomous', 'behavior', 'these', 'methods', 'are', 'inefficient', 'as', 'they', 'are', 'not', 'task', 'driven', 'and', 'such', 'methodologies', 'are', 'not', 'utilized', 'by', 'flying', 'insects', 'and', 'birds', 'such', 'agents', 'have', 'been', 'solving', 'the', 'problem', 'of', 'navigation', 'and', 'complex', 'control', 'for', 'ages', 'without', 'the', 'need', 'to', 'build', 'a', '3d', 'map', 'and', 'are', 'highly', 'task', 'driven', 'in', 'this', 'paper', 'we', 'propose', 'this', 'framework', 'of', 'bioinspired', 'perceptual', 'design', 'for', 'quadrotors', 'we', 'use', 'this', 'philosophy', 'to', 'design', 'a', 'minimalist', 'sensorimotor', 'framework', 'for', 'a', 'quadrotor', 'to', 'fly', 'though', 'unknown', 'gaps', 'without', 'a', '3d', 'reconstruction', 'of', 'the', 'scene', 'using', 'only', 'a', 'monocular', 'camera', 'and', 'onboard', 'sensing', 'we', 'successfully', 'evaluate', 'and', 'demonstrate', 'the', 'proposed', 'approach', 'in', 'many', 'realworld', 'experiments', 'with', 'different', 'settings', 'and', 'window', 'shapes', 'achieving', 'a', 'success', 'rate', 'of', '85', 'at', '25ms1', 'even', 'with', 'a', 'minimum', 'tolerance', 'of', 'just', '5cm', 'to', 'our', 'knowledge', 'this', 'is', 'the', 'first', 'paper', 'which', 'addresses', 'the', 'problem', 'of', 'gap', 'detection', 'of', 'an', 'unknown', 'shape', 'and', 'location', 'with', 'a', 'monocular', 'camera', 'and', 'onboard', 'sensing']] | [-0.07657228051331863, 0.055577778749495044, -0.053068989266249526, -0.0013332715806102472, -0.13041778769116527, -0.15771803010794508, -0.0016986000566528393, 0.47105046560064934, -0.24906813781244924, -0.4075074462447636, 0.11544597248928158, -0.2252586577487983, -0.22247256146432048, 0.21537865019862737, -0.17720071991855, 0.13110212922703088, 0.10573142022737281, 0.01093207772850687, -0.022684837248475538, -0.20689998364615428, 0.2585953637110533, 0.03956259271694659, 0.28403182857041986, -0.00011997461335826244, 0.16415388687256707, -0.0005799543388541873, -0.00912781346724179, 0.013077451969703398, -0.07054868392721113, 0.17838241123358353, 0.34487385137377485, 0.18187880258885006, 0.31205229097092313, -0.4482464177991744, -0.23281191046414496, 0.10402833358321457, 0.1622577766952109, 0.09975247657636593, -0.06605102342439655, -0.35279599919797205, 0.08669115336953212, -0.1710142006031427, -0.06340459625476895, -0.09016696694496665, -0.0124947007374661, -0.004242925216734612, -0.25146686261186874, -0.019764517349132014, 0.016510434866971357, 0.12048377166502178, -0.08509256985940343, -0.058858637252350535, 0.0680497081695352, 0.23276428909597252, 0.012492538013124662, 0.02007350945798891, 0.17222743551852604, -0.20031949890878475, -0.14595471476352187, 0.41500966928528443, 0.038868023271196234, -0.22762139067180218, 0.21849827977093317, -0.06171417266985916, -0.13503453834614468, 0.1088064372986218, 0.22417428304980683, 0.1575376796683642, -0.17834143774642933, 0.04231100605181271, -0.00884876339970266, 0.1581755151626616, 0.02817863122796075, -0.018141598113584942, 0.19938645785046546, 0.23649769968445922, 0.07950826619443066, 0.07847451199819566, -0.12325225480278001, -0.09356097339197353, -0.19401003621788315, -0.11715928240672883, -0.18104825353005488, -0.035879237971208545, -0.02814079927648228, -0.11678708672135799, 0.37029033385815596, 0.23062114667134756, 0.1823133137077093, 0.09126361655503326, 0.38999944152436916, 0.026531436706037678, 0.0669067365052052, 0.08485774184646701, 0.23509915298740147, -0.001900119558440277, 0.14252783494845572, -0.1678810937604572, 0.0716316127218306, 0.020742471721781865] |
1,802.05331 | Graphs with at most two trees in a forest building process | Given a graph, we can form a spanning forest by first sorting the edges in
some order, and then only keep edges incident to a vertex which is not incident
to any previous edge. The resulting forest is dependent on the ordering of the
edges, and so we can ask, for example, how likely is it for the process to
produce a graph with $k$ trees.
We look at all graphs which can produce at most two trees in this process and
determine the probabilities of having either one or two trees. From this we
construct infinite families of graphs which are non-isomorphic but produce the
same probabilities.
| math.CO | given a graph we can form a spanning forest by first sorting the edges in some order and then only keep edges incident to a vertex which is not incident to any previous edge the resulting forest is dependent on the ordering of the edges and so we can ask for example how likely is it for the process to produce a graph with k trees we look at all graphs which can produce at most two trees in this process and determine the probabilities of having either one or two trees from this we construct infinite families of graphs which are nonisomorphic but produce the same probabilities | [['given', 'a', 'graph', 'we', 'can', 'form', 'a', 'spanning', 'forest', 'by', 'first', 'sorting', 'the', 'edges', 'in', 'some', 'order', 'and', 'then', 'only', 'keep', 'edges', 'incident', 'to', 'a', 'vertex', 'which', 'is', 'not', 'incident', 'to', 'any', 'previous', 'edge', 'the', 'resulting', 'forest', 'is', 'dependent', 'on', 'the', 'ordering', 'of', 'the', 'edges', 'and', 'so', 'we', 'can', 'ask', 'for', 'example', 'how', 'likely', 'is', 'it', 'for', 'the', 'process', 'to', 'produce', 'a', 'graph', 'with', 'k', 'trees', 'we', 'look', 'at', 'all', 'graphs', 'which', 'can', 'produce', 'at', 'most', 'two', 'trees', 'in', 'this', 'process', 'and', 'determine', 'the', 'probabilities', 'of', 'having', 'either', 'one', 'or', 'two', 'trees', 'from', 'this', 'we', 'construct', 'infinite', 'families', 'of', 'graphs', 'which', 'are', 'nonisomorphic', 'but', 'produce', 'the', 'same', 'probabilities']] | [-0.10235824773769343, 0.18263152463327129, -0.06981601698013644, 0.04398744989039524, -0.12372109481495702, -0.11262398452877447, 0.07912628362127752, 0.4426231700582085, -0.284415280046502, -0.32825249909095605, 0.11006015834734878, -0.3398358732530916, -0.13646596797129693, 0.11485320322551867, -0.027496824181138503, 5.02235456628518e-05, 0.08792292011289478, 0.12298318895476835, 0.04014523448077617, -0.2684826843243273, 0.3222303412470932, 0.0004056469985732326, 0.18439730754363592, 0.03790285662506466, 0.09536488994059188, 0.012317295838901945, -0.004639628470478648, 0.07150402773792545, -0.12857827204236486, 0.09056055965764379, 0.2790674089316141, 0.14054487909931965, 0.20664126222470292, -0.4089357758941198, -0.18823374553445588, 0.20670599581811716, 0.12888730506636892, 0.16034393155994756, 0.013098967881416212, -0.17454002741551786, 0.13325782270274228, -0.11250023200625071, -0.05559289269580471, -0.007628648515997661, 0.04174183702303304, 0.02418931013111163, -0.28289801371714995, -0.05042732124113374, 0.09769160089220989, -0.01811738606516479, 0.04233267892117577, -0.12908971932268254, -0.06617115546638767, 0.1383714420236949, -0.049393790410249494, 0.02876712135211737, 0.051617993964572194, -0.11941025412158558, -0.1649727339261315, 0.3807816542340098, -0.018791534425906354, -0.18719715769920084, 0.1973378703362498, -0.16355965471033146, -0.16152436398314657, 0.12282957593022191, 0.16179573409587006, 0.13758956823773957, -0.13985759338053563, 0.02605292426812445, -0.060103980013755734, 0.1240618417074007, 0.14581104002772244, -0.021015916778533546, 0.19883219990879297, 0.10525407183579066, 0.1397738822830703, 0.16269416009351886, -0.034345477493911016, -0.0001543782246126621, -0.2635977759577886, -0.10889152806959357, -0.1815321291732188, 0.04413217018561597, -0.11595532549418514, -0.2324868315158205, 0.43138653557980433, 0.17329848981333068, 0.28997958410117364, 0.08627872079227085, 0.2565241325043004, 0.1207550526553489, 0.07676283281762153, 0.13844724899347596, 0.1552630903738814, 0.08485758859293398, -0.02110293750323493, -0.09547057418213054, 0.11593068943141217, 0.08086592216838014] |
1,802.05332 | Electron dynamics driven by light pulse derivatives | We demonstrate that ultrashort pulses carry the possibility for a new regime
of light-matter interaction with nonadiabatic electron processes sensitive to
the envelope-derivative of the light pulse. A standard single pulse with its
two peaks in the derivative separated by the width of the pulse acts in this
regime like a traditional double pulse. The two ensuing nonadiabatic ionization
bursts have slightly different ionization amplitudes. This difference is due to
redistribution of continuum electron energy during the bursts, negligible in
standard photo-ionization. A time-dependent close- coupling approach based on
cycle-averaged potentials in the Kramers-Henneberger reference frame permits a
detailed understanding of light pulse derivative-driven electron dynamics.
| physics.optics physics.atom-ph | we demonstrate that ultrashort pulses carry the possibility for a new regime of lightmatter interaction with nonadiabatic electron processes sensitive to the envelopederivative of the light pulse a standard single pulse with its two peaks in the derivative separated by the width of the pulse acts in this regime like a traditional double pulse the two ensuing nonadiabatic ionization bursts have slightly different ionization amplitudes this difference is due to redistribution of continuum electron energy during the bursts negligible in standard photoionization a timedependent close coupling approach based on cycleaveraged potentials in the kramershenneberger reference frame permits a detailed understanding of light pulse derivativedriven electron dynamics | [['we', 'demonstrate', 'that', 'ultrashort', 'pulses', 'carry', 'the', 'possibility', 'for', 'a', 'new', 'regime', 'of', 'lightmatter', 'interaction', 'with', 'nonadiabatic', 'electron', 'processes', 'sensitive', 'to', 'the', 'envelopederivative', 'of', 'the', 'light', 'pulse', 'a', 'standard', 'single', 'pulse', 'with', 'its', 'two', 'peaks', 'in', 'the', 'derivative', 'separated', 'by', 'the', 'width', 'of', 'the', 'pulse', 'acts', 'in', 'this', 'regime', 'like', 'a', 'traditional', 'double', 'pulse', 'the', 'two', 'ensuing', 'nonadiabatic', 'ionization', 'bursts', 'have', 'slightly', 'different', 'ionization', 'amplitudes', 'this', 'difference', 'is', 'due', 'to', 'redistribution', 'of', 'continuum', 'electron', 'energy', 'during', 'the', 'bursts', 'negligible', 'in', 'standard', 'photoionization', 'a', 'timedependent', 'close', 'coupling', 'approach', 'based', 'on', 'cycleaveraged', 'potentials', 'in', 'the', 'kramershenneberger', 'reference', 'frame', 'permits', 'a', 'detailed', 'understanding', 'of', 'light', 'pulse', 'derivativedriven', 'electron', 'dynamics']] | [-0.11951098823472141, 0.19388042058338983, -0.09518641842889618, 0.09743834346814904, -0.01401850644302053, -0.1458780875210113, 0.06213213619552194, 0.43648861814290285, -0.2413262332467219, -0.2910734687645275, -0.043287224610909246, -0.25068785716967584, -0.03967769448466312, 0.23496476650829068, 0.012041836444181032, 0.01067739577746789, 0.06766115945692246, -0.0398651002592837, -0.06598669775681068, -0.11966787457304935, 0.2827090724066903, 0.08409519988792734, 0.2683663658300737, 0.05428968664581099, 0.0851179433431333, 0.03114265890997978, 0.002540124548921505, -0.09304288829354426, -0.09205364079760049, 0.056823822924903095, 0.17763567161623192, -0.00585720131549841, 0.2636813150915819, -0.4704860010757469, -0.270801179155779, 0.02734468170316317, 0.14304434556442386, 0.13591424933222768, -0.07068382203243136, -0.2509366790674484, -0.06584413729321498, -0.16572628994114125, -0.125773714206074, 0.003989267870425605, 0.037372442248922125, 0.09987309037667448, -0.25814231214238903, 0.0789178319212694, 0.030114733263662156, -0.013120725840473404, -0.016839905096835885, 0.005940175521223305, 0.0010502100362478255, 0.04698427110158194, 0.034199422608183414, 0.04694824929958066, 0.18602982762520417, -0.10276614191780727, -0.08208261750405654, 0.38995021253671996, -0.13916258039311147, -0.11069644189690454, 0.1530703870297517, -0.1910196416474019, -0.061156549864860535, 0.2415629547644515, 0.11584372771232246, 0.1197312472795602, -0.13144458598421457, 0.031361545382354125, 0.06076978646720258, 0.20534249679901853, 0.10185076607068858, 0.09400241121273631, 0.2383581498406084, 0.1740139764196311, -0.004912915691070689, 0.10842451322465561, -0.16466062630822237, -0.08993544986095423, -0.29135708026408863, -0.0696851015874507, -0.12351448365594618, 0.07006063221398598, -0.05122129955382731, -0.16005626529491004, 0.4858473652678255, 0.10715096944477409, 0.12915720984948656, -0.03978226956230803, 0.32435673171690166, 0.17477617694888836, 0.01295746446479685, 0.008585749443857192, 0.31640807594969655, 0.16453144978955747, 0.11450750942682274, -0.31108954447979786, 0.022104060828076817, -3.103363829163405e-07] |
1,802.05333 | Bootstrap-Assisted Unit Root Testing With Piecewise Locally Stationary
Errors | In unit root testing, a piecewise locally stationary process is adopted to
accommodate nonstationary errors that can have both smooth and abrupt changes
in second- or higher-order properties. Under this framework, the limiting null
distributions of the conventional unit root test statistics are derived and
shown to contain a number of unknown parameters. To circumvent the difficulty
of direct consistent estimation, we propose to use the dependent wild bootstrap
to approximate the non-pivotal limiting null distributions and provide a
rigorous theoretical justification for bootstrap consistency. The proposed
method is compared through finite sample simulations with the recolored wild
bootstrap procedure, which was developed for errors that follow a
heteroscedastic linear process. Further, a combination of autoregressive sieve
recoloring with the dependent wild bootstrap is shown to perform well. The
validity of the dependent wild bootstrap in a nonstationary setting is
demonstrated for the first time, showing the possibility of extensions to other
inference problems associated with locally stationary processes.
| econ.EM math.ST stat.TH | in unit root testing a piecewise locally stationary process is adopted to accommodate nonstationary errors that can have both smooth and abrupt changes in second or higherorder properties under this framework the limiting null distributions of the conventional unit root test statistics are derived and shown to contain a number of unknown parameters to circumvent the difficulty of direct consistent estimation we propose to use the dependent wild bootstrap to approximate the nonpivotal limiting null distributions and provide a rigorous theoretical justification for bootstrap consistency the proposed method is compared through finite sample simulations with the recolored wild bootstrap procedure which was developed for errors that follow a heteroscedastic linear process further a combination of autoregressive sieve recoloring with the dependent wild bootstrap is shown to perform well the validity of the dependent wild bootstrap in a nonstationary setting is demonstrated for the first time showing the possibility of extensions to other inference problems associated with locally stationary processes | [['in', 'unit', 'root', 'testing', 'a', 'piecewise', 'locally', 'stationary', 'process', 'is', 'adopted', 'to', 'accommodate', 'nonstationary', 'errors', 'that', 'can', 'have', 'both', 'smooth', 'and', 'abrupt', 'changes', 'in', 'second', 'or', 'higherorder', 'properties', 'under', 'this', 'framework', 'the', 'limiting', 'null', 'distributions', 'of', 'the', 'conventional', 'unit', 'root', 'test', 'statistics', 'are', 'derived', 'and', 'shown', 'to', 'contain', 'a', 'number', 'of', 'unknown', 'parameters', 'to', 'circumvent', 'the', 'difficulty', 'of', 'direct', 'consistent', 'estimation', 'we', 'propose', 'to', 'use', 'the', 'dependent', 'wild', 'bootstrap', 'to', 'approximate', 'the', 'nonpivotal', 'limiting', 'null', 'distributions', 'and', 'provide', 'a', 'rigorous', 'theoretical', 'justification', 'for', 'bootstrap', 'consistency', 'the', 'proposed', 'method', 'is', 'compared', 'through', 'finite', 'sample', 'simulations', 'with', 'the', 'recolored', 'wild', 'bootstrap', 'procedure', 'which', 'was', 'developed', 'for', 'errors', 'that', 'follow', 'a', 'heteroscedastic', 'linear', 'process', 'further', 'a', 'combination', 'of', 'autoregressive', 'sieve', 'recoloring', 'with', 'the', 'dependent', 'wild', 'bootstrap', 'is', 'shown', 'to', 'perform', 'well', 'the', 'validity', 'of', 'the', 'dependent', 'wild', 'bootstrap', 'in', 'a', 'nonstationary', 'setting', 'is', 'demonstrated', 'for', 'the', 'first', 'time', 'showing', 'the', 'possibility', 'of', 'extensions', 'to', 'other', 'inference', 'problems', 'associated', 'with', 'locally', 'stationary', 'processes']] | [-0.036677087886689476, 0.04071775074673336, -0.09912678937328125, 0.10133110279589032, -0.08766302627470321, -0.15759824188250415, 0.05116160507255334, 0.38286473169782254, -0.25064624904555344, -0.2562255180856717, 0.1372548679143202, -0.2162491350065706, -0.1342859604357853, 0.20344084592824568, -0.11473793944976521, 0.13609145800202335, 0.055275014134522224, 0.01576597347680579, -0.07617903256799101, -0.2774683204801671, 0.27863787045503186, 0.062418460643867836, 0.3515288744402944, -0.03286070260658579, 0.11060841282340551, 0.023346667090114556, -0.06655175206192869, 0.04170834412212548, -0.09196801365943663, 0.10202125896691124, 0.2192776576343502, 0.10393338550303904, 0.2989146044659399, -0.4049216544768775, -0.2357554791448345, 0.11056585823707048, 0.14965474242695942, 0.09573686254026263, -0.021066706428456608, -0.26876337133910294, 0.11056601125219802, -0.15741596365663804, -0.16019829419008075, -0.09971969633263612, -0.008549214234581487, 0.02712822108494364, -0.3565235883348955, 0.12103126563260672, 0.07175307521382757, 0.05363517424454854, -0.019109849018519216, -0.07877442965858013, 0.01949990636364516, 0.09209454578088315, 0.07545641437722019, -0.021063747060186457, 0.11054293587276677, -0.07404283993092582, -0.12922640093719387, 0.3141276798615197, -0.04845443577944951, -0.2634769234946876, 0.1865122473942198, -0.13054047325046136, -0.15723118648583176, 0.11685585031731043, 0.17776374959345884, 0.1288304732667294, -0.16640169606924807, 0.08684863006797144, -0.0013141040778103864, 0.12680443759521456, 0.032418996912761115, -0.06898451489308532, 0.14723957148116995, 0.1586363514674441, 0.04935445455371537, 0.15825845107308784, -0.11787799564841842, -0.1042237156480785, -0.3466018867216208, -0.11857216394727511, -0.18383830972308726, -0.0003859342863701237, -0.11233316863762177, -0.24138469458813924, 0.35820835079915775, 0.19860016457434837, 0.19042960406462633, 0.12863347233703606, 0.25366634973061253, 0.14884264780056178, 0.043150408019944325, 0.0577708515148235, 0.1786376686192721, 0.14430188627198995, 0.024786426091226953, -0.18053698725723838, 0.11749434816715477, 0.03856039366614566] |
1,802.05334 | A Modular Supersonic Ping Pong Gun | A vacuum-powered device that shoots ping pong balls at high subsonic speeds
has been used for physics demonstrations for more than a decade. It uses
physics that are easily understood by students, even though its operation is
not immediately intuitive. The addition of a pressure plenum and nozzle results
in muzzle velocities exceeding Mach 1.5. Balls are readily fired through ping
pong paddles and sheets of plywood up to 12.7mm (1/2 inch) thick. Popular
reaction to the device indicates that it is an effective way to spark interest
in physics and engineering.
| physics.ed-ph physics.pop-ph | a vacuumpowered device that shoots ping pong balls at high subsonic speeds has been used for physics demonstrations for more than a decade it uses physics that are easily understood by students even though its operation is not immediately intuitive the addition of a pressure plenum and nozzle results in muzzle velocities exceeding mach 15 balls are readily fired through ping pong paddles and sheets of plywood up to 127mm 12 inch thick popular reaction to the device indicates that it is an effective way to spark interest in physics and engineering | [['a', 'vacuumpowered', 'device', 'that', 'shoots', 'ping', 'pong', 'balls', 'at', 'high', 'subsonic', 'speeds', 'has', 'been', 'used', 'for', 'physics', 'demonstrations', 'for', 'more', 'than', 'a', 'decade', 'it', 'uses', 'physics', 'that', 'are', 'easily', 'understood', 'by', 'students', 'even', 'though', 'its', 'operation', 'is', 'not', 'immediately', 'intuitive', 'the', 'addition', 'of', 'a', 'pressure', 'plenum', 'and', 'nozzle', 'results', 'in', 'muzzle', 'velocities', 'exceeding', 'mach', '15', 'balls', 'are', 'readily', 'fired', 'through', 'ping', 'pong', 'paddles', 'and', 'sheets', 'of', 'plywood', 'up', 'to', '127mm', '12', 'inch', 'thick', 'popular', 'reaction', 'to', 'the', 'device', 'indicates', 'that', 'it', 'is', 'an', 'effective', 'way', 'to', 'spark', 'interest', 'in', 'physics', 'and', 'engineering']] | [-0.028109730830571302, 0.18150990100516032, -0.1143625210637563, 0.03537277191515184, -0.09071029839623306, -0.18373734743541315, 0.02738445682140688, 0.39943249060048, -0.20734446854848002, -0.345301162203153, 0.11007261504160447, -0.2727988064289093, -0.060223256258500946, 0.29231139272128026, -0.09390302663151588, 0.04161225138943539, 0.055230485671199855, -0.022030009588019716, -0.012363144325920276, -0.23969827333672178, 0.19457852950112686, 0.08798148112319824, 0.27351261647676844, 0.0655573140622841, 0.12784181603023576, -0.07051869507154657, 0.06016560875189801, 0.022848294944398932, -0.1088763847467716, 0.05549051352492016, 0.2844619997673564, 0.10943020733280315, 0.316898534907442, -0.42597342319786546, -0.20831183083355426, 0.0017242601206008759, 0.13983468319185907, 0.0748593353976806, -0.0896818655560815, -0.2583071004909774, 0.10998339243750606, -0.1889315840943406, -0.13131115161813794, -0.040694170067500736, 0.06454369587202867, -0.011238973828343053, -0.2376843185694371, 0.029303084995222484, 0.06746654893375105, 0.05359064329079249, 0.02899958434799272, -0.11450490345661012, -0.011695765341735548, 0.10065535412997835, 0.01679529567870001, 0.06119033228250272, 0.20320915238310894, -0.13248228161957942, -0.09087597072745363, 0.3991289775404665, -0.014306438153693712, -0.10989446213158469, 0.23984095739821593, -0.1560833885696613, -0.048311628504759736, 0.18283284430443827, 0.14517305597869887, 0.07777000225388393, -0.1424974998420415, 0.027024997644669688, -0.03031505782985025, 0.14493419239038807, 0.15659895673937474, -0.05750770818235146, 0.18842762160735826, 0.1872935354606145, 0.05959124329706861, 0.05831402944038726, -0.05965650075684405, -0.05482442030002454, -0.2424799893128996, -0.1709273220350345, -0.16497437992754083, 0.054569880398048554, -0.04168514351622434, -0.08877413330289224, 0.3136917329393327, 0.14437665866894855, 0.1268096417136904, -0.00796518452051613, 0.29729889252533515, 0.0322053442735018, 0.12230022012049126, 0.1374324568754269, 0.2520823823288083, 0.09885280157646371, 0.1719470065863182, -0.08416146966111329, 0.08058298523279114, -0.001431932910862896] |
1,802.05335 | Multimodal Generative Models for Scalable Weakly-Supervised Learning | Multiple modalities often co-occur when describing natural phenomena.
Learning a joint representation of these modalities should yield deeper and
more useful representations. Previous generative approaches to multi-modal
input either do not learn a joint distribution or require additional
computation to handle missing data. Here, we introduce a multimodal variational
autoencoder (MVAE) that uses a product-of-experts inference network and a
sub-sampled training paradigm to solve the multi-modal inference problem.
Notably, our model shares parameters to efficiently learn under any combination
of missing modalities. We apply the MVAE on four datasets and match
state-of-the-art performance using many fewer parameters. In addition, we show
that the MVAE is directly applicable to weakly-supervised learning, and is
robust to incomplete supervision. We then consider two case studies, one of
learning image transformations---edge detection, colorization,
segmentation---as a set of modalities, followed by one of machine translation
between two languages. We find appealing results across this range of tasks.
| cs.LG stat.ML | multiple modalities often cooccur when describing natural phenomena learning a joint representation of these modalities should yield deeper and more useful representations previous generative approaches to multimodal input either do not learn a joint distribution or require additional computation to handle missing data here we introduce a multimodal variational autoencoder mvae that uses a productofexperts inference network and a subsampled training paradigm to solve the multimodal inference problem notably our model shares parameters to efficiently learn under any combination of missing modalities we apply the mvae on four datasets and match stateoftheart performance using many fewer parameters in addition we show that the mvae is directly applicable to weaklysupervised learning and is robust to incomplete supervision we then consider two case studies one of learning image transformationsedge detection colorization segmentationas a set of modalities followed by one of machine translation between two languages we find appealing results across this range of tasks | [['multiple', 'modalities', 'often', 'cooccur', 'when', 'describing', 'natural', 'phenomena', 'learning', 'a', 'joint', 'representation', 'of', 'these', 'modalities', 'should', 'yield', 'deeper', 'and', 'more', 'useful', 'representations', 'previous', 'generative', 'approaches', 'to', 'multimodal', 'input', 'either', 'do', 'not', 'learn', 'a', 'joint', 'distribution', 'or', 'require', 'additional', 'computation', 'to', 'handle', 'missing', 'data', 'here', 'we', 'introduce', 'a', 'multimodal', 'variational', 'autoencoder', 'mvae', 'that', 'uses', 'a', 'productofexperts', 'inference', 'network', 'and', 'a', 'subsampled', 'training', 'paradigm', 'to', 'solve', 'the', 'multimodal', 'inference', 'problem', 'notably', 'our', 'model', 'shares', 'parameters', 'to', 'efficiently', 'learn', 'under', 'any', 'combination', 'of', 'missing', 'modalities', 'we', 'apply', 'the', 'mvae', 'on', 'four', 'datasets', 'and', 'match', 'stateoftheart', 'performance', 'using', 'many', 'fewer', 'parameters', 'in', 'addition', 'we', 'show', 'that', 'the', 'mvae', 'is', 'directly', 'applicable', 'to', 'weaklysupervised', 'learning', 'and', 'is', 'robust', 'to', 'incomplete', 'supervision', 'we', 'then', 'consider', 'two', 'case', 'studies', 'one', 'of', 'learning', 'image', 'transformationsedge', 'detection', 'colorization', 'segmentationas', 'a', 'set', 'of', 'modalities', 'followed', 'by', 'one', 'of', 'machine', 'translation', 'between', 'two', 'languages', 'we', 'find', 'appealing', 'results', 'across', 'this', 'range', 'of', 'tasks']] | [-0.017351599288716293, 0.003457270286356409, -0.08356229631851117, 0.12081115269800648, -0.17898734538195035, -0.21445154428792496, 0.014978850713620583, 0.4725437381118536, -0.3113687613947938, -0.3336761592918386, 0.039211087483757484, -0.25230656982089084, -0.17431639523090173, 0.19440358223160728, -0.15344529147240488, 0.07871627306876083, 0.17214134049291413, 0.04244205054827035, -0.09399323997398218, -0.26258722483490904, 0.32504664957368123, -0.04928759907372296, 0.32431397209254403, -0.0428530587880717, 0.15148281902462865, 0.022310401774787655, -0.02979666746376703, -0.004855716679400454, -0.05596207858267008, 0.21393674205911034, 0.34955519614585984, 0.24602646290014188, 0.3342775378143415, -0.4246906217932701, -0.2632499525385598, 0.12779991627826046, 0.14136605389416218, 0.1223373422609681, -0.006126200360886287, -0.30296297010344764, 0.057771849536026515, -0.15487029298829535, 0.05715043722341458, -0.18858885730306307, -0.06525678482372314, -0.04924820281642799, -0.3484272880029554, 0.05211810706804196, 0.095051694875195, 0.04433925459064388, -0.05528496137432133, -0.11241851181276918, 0.04456022053879375, 0.1444483978279944, 0.03440797099067519, 0.04169707152371605, 0.12381202350991467, -0.18722446606339266, -0.16185672776928792, 0.3293111304504176, -0.03369863756466657, -0.2359440679848194, 0.2564836552614967, -0.04107267653569579, -0.21133554842943947, 0.08084717841198047, 0.21002787534147502, 0.11846269393300948, -0.17106849816210645, -0.0002969656776015957, -0.05562344623108705, 0.20826369132458541, 0.0573374773748219, -0.009603148160288887, 0.16963090985858192, 0.213584036831744, 0.026574633062118665, 0.13526726350343476, -0.13507973143365234, -0.060043296211709576, -0.2014019724885778, -0.08954084214443962, -0.19168912979618957, -0.03607698463204239, -0.07381465119270918, -0.13892020558104073, 0.37947148093332844, 0.26255300720222297, 0.2535604997553552, 0.11650886929419357, 0.3565601156403621, 0.020983893638573742, 0.11456639074604028, 0.0754625897303534, 0.1345480305297921, 0.01394849705354621, 0.10421925441051523, -0.12670136127310494, 0.07703347175692518, 0.013159233809759219] |
1,802.05336 | Casimir (vacuum) energy in planar QED with strong coupling | The essentially non-perturbative vacuum polarization effects, caused by an
extended external supercritical Coulomb source, are explored for a planar
Dirac-Coulomb (DC) system with strong coupling (similar to graphene and
graphene-based heterostructures). Taking account of results, obtained in
\cite{partI2018} for the induced charge density $\rho_{VP}(\vec{r})$, in the
present paper the evaluation of the Casimir (vacuum) energy $\mathcal{E}_{VP}$
is presented. The main result is that for a wide range of the system parameters
in the overcritical region $\mathcal{E}_{VP}$ turns out to be a rapidly
decreasing negative function $\sim - Z^3/R_0\, $ with $Z\, , R_0$ being the
charge and the size of the external source. By an explicit calculation the
possibility for complete screening of the electrostatic reflection self-energy
of the external source by such polarization effects for $Z \gg Z_{cr,1}$ is
demonstrated. The dependence of the Casimir energy on the screening of the
Coulomb asymptotics of the external source at some $R_1>R_0$ is also explored
in detail, and some peculiar effects in the partial channels with the lowest
rotational numbers $m_j=\pm 1/2\, , \pm3/2$ in the screened case are also
discussed.
| cond-mat.mes-hall | the essentially nonperturbative vacuum polarization effects caused by an extended external supercritical coulomb source are explored for a planar diraccoulomb dc system with strong coupling similar to graphene and graphenebased heterostructures taking account of results obtained in citeparti2018 for the induced charge density rho_vpvecr in the present paper the evaluation of the casimir vacuum energy mathcale_vp is presented the main result is that for a wide range of the system parameters in the overcritical region mathcale_vp turns out to be a rapidly decreasing negative function sim z3r_0 with z r_0 being the charge and the size of the external source by an explicit calculation the possibility for complete screening of the electrostatic reflection selfenergy of the external source by such polarization effects for z gg z_cr1 is demonstrated the dependence of the casimir energy on the screening of the coulomb asymptotics of the external source at some r_1r_0 is also explored in detail and some peculiar effects in the partial channels with the lowest rotational numbers m_jpm 12 pm32 in the screened case are also discussed | [['the', 'essentially', 'nonperturbative', 'vacuum', 'polarization', 'effects', 'caused', 'by', 'an', 'extended', 'external', 'supercritical', 'coulomb', 'source', 'are', 'explored', 'for', 'a', 'planar', 'diraccoulomb', 'dc', 'system', 'with', 'strong', 'coupling', 'similar', 'to', 'graphene', 'and', 'graphenebased', 'heterostructures', 'taking', 'account', 'of', 'results', 'obtained', 'in', 'citeparti2018', 'for', 'the', 'induced', 'charge', 'density', 'rho_vpvecr', 'in', 'the', 'present', 'paper', 'the', 'evaluation', 'of', 'the', 'casimir', 'vacuum', 'energy', 'mathcale_vp', 'is', 'presented', 'the', 'main', 'result', 'is', 'that', 'for', 'a', 'wide', 'range', 'of', 'the', 'system', 'parameters', 'in', 'the', 'overcritical', 'region', 'mathcale_vp', 'turns', 'out', 'to', 'be', 'a', 'rapidly', 'decreasing', 'negative', 'function', 'sim', 'z3r_0', 'with', 'z', 'r_0', 'being', 'the', 'charge', 'and', 'the', 'size', 'of', 'the', 'external', 'source', 'by', 'an', 'explicit', 'calculation', 'the', 'possibility', 'for', 'complete', 'screening', 'of', 'the', 'electrostatic', 'reflection', 'selfenergy', 'of', 'the', 'external', 'source', 'by', 'such', 'polarization', 'effects', 'for', 'z', 'gg', 'z_cr1', 'is', 'demonstrated', 'the', 'dependence', 'of', 'the', 'casimir', 'energy', 'on', 'the', 'screening', 'of', 'the', 'coulomb', 'asymptotics', 'of', 'the', 'external', 'source', 'at', 'some', 'r_1r_0', 'is', 'also', 'explored', 'in', 'detail', 'and', 'some', 'peculiar', 'effects', 'in', 'the', 'partial', 'channels', 'with', 'the', 'lowest', 'rotational', 'numbers', 'm_jpm', '12', 'pm32', 'in', 'the', 'screened', 'case', 'are', 'also', 'discussed']] | [-0.1554048637144974, 0.16363502177961797, -0.027905124643731904, 0.06523815474483645, -0.0032193425871517465, -0.09638983407593064, 0.025008568100647294, 0.3519445923959901, -0.22107866119550562, -0.28420565471095943, 0.033431855928227734, -0.2741849666070621, -0.07851764342035755, 0.20036468240593014, 0.04143626961824297, 0.017388086881081777, -0.007363342570312236, -0.004794574473802557, -0.049778935656047844, -0.1941563454371323, 0.33449676485020324, 0.07252231318417979, 0.24722439785562883, 0.1458998884063685, 0.05815137441045251, 0.028273564073510216, -0.0026309195261625252, 0.03758235390554985, -0.12374651726926898, 0.021518087338377862, 0.1915210417857201, -0.03246388651280739, 0.2361005811869092, -0.3726109728302764, -0.19860852569416593, 0.050010645419530486, 0.12314280887614754, 0.1324303538067502, -0.07976934017073939, -0.2876439922082441, 0.07498530642900231, -0.18450937228245212, -0.16356975768476018, -0.025119171560816896, 0.056192141142339266, 0.03380569594580381, -0.2762769615577384, 0.09007047303255122, 0.04801613897427745, 0.027404302395291454, -0.089714999819153, -0.14931033037726008, -0.04524067831332742, 0.10037815472748045, 0.07507163747588451, 0.054580284214990706, 0.14767105815712706, -0.16279560654697106, -0.04597854838792192, 0.3557935208938588, -0.054603871652567436, -0.18178867699910256, 0.13826661857096587, -0.17749543784014965, -0.07517138003617868, 0.1528519954607319, 0.11331283718872087, 0.1096088282801425, -0.15933276030727417, 0.13576068595518764, 0.02657025848480541, 0.14370526967505956, 0.06960772366086342, 0.055322521945579385, 0.2129658843208661, 0.1226558244242547, 0.019945028599287415, 0.175300508449202, -0.0868794795663642, -0.06032384850416632, -0.346851685127222, -0.10942937511798187, -0.1671175345451967, 0.06269928594400849, -0.10120195932825157, -0.16183203954287087, 0.3762351719400947, 0.1252133603496798, 0.16120259147190927, -0.023919462989721363, 0.27628563360803515, 0.16822848377492408, 0.08052959660972715, 0.02969767415532093, 0.28002428951647784, 0.1517597402381743, 0.09945367411951181, -0.2892857032678165, 0.01715358170070525, 0.02082032178616922] |
1,802.05337 | Link transmission centrality in large-scale social networks | Understanding the importance of links in transmitting information in a
network can provide ways to hinder or postpone ongoing dynamical phenomena like
the spreading of epidemic or the diffusion of information. In this work, we
propose a new measure based on stochastic diffusion processes, the
\textit{transmission centrality}, that captures the importance of links by
estimating the average number of nodes to whom they transfer information during
a global spreading diffusion process. We propose a simple algorithmic solution
to compute transmission centrality and to approximate it in very large networks
at low computational cost. Finally we apply transmission centrality in the
identification of weak ties in three large empirical social networks, showing
that this metric outperforms other centrality measures in identifying links
that drive spreading processes in a social network.
| cs.SI physics.soc-ph | understanding the importance of links in transmitting information in a network can provide ways to hinder or postpone ongoing dynamical phenomena like the spreading of epidemic or the diffusion of information in this work we propose a new measure based on stochastic diffusion processes the textittransmission centrality that captures the importance of links by estimating the average number of nodes to whom they transfer information during a global spreading diffusion process we propose a simple algorithmic solution to compute transmission centrality and to approximate it in very large networks at low computational cost finally we apply transmission centrality in the identification of weak ties in three large empirical social networks showing that this metric outperforms other centrality measures in identifying links that drive spreading processes in a social network | [['understanding', 'the', 'importance', 'of', 'links', 'in', 'transmitting', 'information', 'in', 'a', 'network', 'can', 'provide', 'ways', 'to', 'hinder', 'or', 'postpone', 'ongoing', 'dynamical', 'phenomena', 'like', 'the', 'spreading', 'of', 'epidemic', 'or', 'the', 'diffusion', 'of', 'information', 'in', 'this', 'work', 'we', 'propose', 'a', 'new', 'measure', 'based', 'on', 'stochastic', 'diffusion', 'processes', 'the', 'textittransmission', 'centrality', 'that', 'captures', 'the', 'importance', 'of', 'links', 'by', 'estimating', 'the', 'average', 'number', 'of', 'nodes', 'to', 'whom', 'they', 'transfer', 'information', 'during', 'a', 'global', 'spreading', 'diffusion', 'process', 'we', 'propose', 'a', 'simple', 'algorithmic', 'solution', 'to', 'compute', 'transmission', 'centrality', 'and', 'to', 'approximate', 'it', 'in', 'very', 'large', 'networks', 'at', 'low', 'computational', 'cost', 'finally', 'we', 'apply', 'transmission', 'centrality', 'in', 'the', 'identification', 'of', 'weak', 'ties', 'in', 'three', 'large', 'empirical', 'social', 'networks', 'showing', 'that', 'this', 'metric', 'outperforms', 'other', 'centrality', 'measures', 'in', 'identifying', 'links', 'that', 'drive', 'spreading', 'processes', 'in', 'a', 'social', 'network']] | [-0.1621551469052065, 0.07273319451087445, -0.0872394876096223, 0.10686512504851464, -0.07985530065889179, -0.16518755294328002, 0.09283047915596399, 0.40341262372385245, -0.2987953333322366, -0.27722857459957595, 0.05523118635392166, -0.3056917361136584, -0.23007527648223913, 0.11818923586906749, -0.060575202101972536, 0.02517406770857633, 0.09403286117958487, 0.059851326759826406, 0.0026563630185592046, -0.226204569436959, 0.32978218449443375, 0.09142616312419705, 0.3160520986402844, 0.1109077250403061, 0.09347497282215045, 0.03362003083748277, -0.08541486297599477, 0.04915398634875601, -0.13567740343654577, 0.14656775745243067, 0.3059226402765489, 0.19056549245942733, 0.3380233634961769, -0.4129307007879106, -0.2751857644034317, 0.13386251899464696, 0.1632653054691673, 0.11192894166015321, -0.030176813125763147, -0.24974430373549694, 0.05186271599814063, -0.1953275789055624, -0.07312625426493469, -0.07425053743099852, 0.0028243856904737186, 0.05493963475601049, -0.2528386415724526, 0.08463036618559272, 0.019234452413684267, 0.05726620540372096, 0.017646272961428622, -0.05132376442452369, -0.010651367563696112, 0.1885968443020829, 0.03673539250644353, -0.040170876697629865, 0.15756204124409123, -0.18238893994202954, -0.17862682342820335, 0.3427406245828024, -0.03772025227908671, -0.21104474849562394, 0.21090606901452702, -0.11071697365332511, -0.16664830935769714, 0.11485433055349858, 0.29554460749204736, 0.0863921038198896, -0.18665651836340658, -0.051406866294428255, -0.006276325213548262, 0.11738698732597186, 0.0362609357907786, 0.0508876961794158, 0.1257986398486537, 0.22659912465314846, 0.12282904623862123, 0.09741330721635677, -0.07704937216340113, -0.13749535184615524, -0.21561900939559564, -0.14396849664262845, -0.18528255597993848, 0.07590422401881369, -0.15452552547856158, -0.14280344655708177, 0.4187424383999314, 0.2091119464566873, 0.22754183088909485, 0.07105644273178768, 0.2894441405314865, 0.04662652002116374, 0.04570457554746099, 0.11025602248264477, 0.19962711399421096, 0.07883739937096834, 0.16668604538790532, -0.18930667179301963, 0.1790581161621958, 0.037430947014627236] |
1,802.05338 | The A_f condition and relative conormal spaces for functions with
non-vanishing derivative | We introduce a join construction as a way of completing the description of
the relative conormal space of an analytic function on a complex analytic space
that has a non-vanishing derivative at the origin. Then we show how to obtain a
numerical criterion for Thom's A_f condition.
| math.AG math.CV | we introduce a join construction as a way of completing the description of the relative conormal space of an analytic function on a complex analytic space that has a nonvanishing derivative at the origin then we show how to obtain a numerical criterion for thoms a_f condition | [['we', 'introduce', 'a', 'join', 'construction', 'as', 'a', 'way', 'of', 'completing', 'the', 'description', 'of', 'the', 'relative', 'conormal', 'space', 'of', 'an', 'analytic', 'function', 'on', 'a', 'complex', 'analytic', 'space', 'that', 'has', 'a', 'nonvanishing', 'derivative', 'at', 'the', 'origin', 'then', 'we', 'show', 'how', 'to', 'obtain', 'a', 'numerical', 'criterion', 'for', 'thoms', 'a_f', 'condition']] | [-0.1648284485365482, 0.03148050260751142, -0.16183333841717226, 0.08786692597130512, -0.12335087652219102, -0.05417323180850833, 0.051094916490639776, 0.32315252634122016, -0.2585824545809722, -0.21091216346843444, 0.10387051026237772, -0.2041923057367193, -0.2044627075578938, 0.20234543630021048, -0.0629214816033206, -0.013751668597948043, 0.04504878713967318, 0.08252033955873327, -0.15622419425524137, -0.21321968818975098, 0.38034462841584327, -0.0022329125711892514, 0.1867458613965898, 0.07786487031014676, 0.16644289170158408, 0.01624870334969873, 0.0004785395564234003, -0.012271517314304143, -0.23460172376910626, 0.1362005220924286, 0.19581109284363846, 0.1291610590935229, 0.265690407141092, -0.3674121563263396, -0.17268416703061915, 0.14325768276652756, 0.1174152224185936, 0.06889435224373766, -0.03649212831403426, -0.22482041978931172, 0.12123627602023647, -0.1745929662534531, -0.20893528521001498, -0.1474490120135089, 0.041809678077697754, -0.02137489953732237, -0.3077593209479559, -0.01261408270356503, 0.07033947771591595, 0.06253262541871121, -0.09266337978237486, -0.034423499189792796, -0.0186610528109397, 0.07912136316101284, 0.001761488896358679, 0.0903192094844231, 0.06833968175812921, -0.10271599700060138, -0.08140394631575079, 0.36411122042447963, -0.1037963215222067, -0.2672172403953811, 0.15803033229399552, -0.1506185394691977, -0.12791226191961386, 0.08489068185592763, 0.13436146474819868, 0.14578489555006333, -0.07101819822762875, 0.150077752749178, -0.0912074438752012, 0.0909274206595852, 0.06950475898214635, 0.020276797846197448, 0.15724721903655123, 0.12048143790440356, 0.15308881751162576, 0.17638298207299508, -0.020343594773216768, -0.04796559367566667, -0.422313812604927, -0.24291892146178956, -0.15826830055881688, 0.10638125638101012, -0.0863826503838472, -0.21710667745309306, 0.40631833008708473, 0.0805166797276507, 0.27307666657849194, 0.11348553170311323, 0.31242801867266917, 0.13250485993674063, 0.00031249074542776065, 0.015610701642296415, 0.14218812027668698, 0.15221244400426587, 0.04145120061498056, -0.17092400322608808, 0.025558207689368343, 0.16994240002191446] |
1,802.05339 | Two- and Multi-dimensional Curve Fitting using Bayesian Inference | Fitting models to data using Bayesian inference is quite common, but when
each point in parameter space gives a curve, fitting the curve to a data set
requires new nuisance parameters, which specify the metric embedding the
one-dimensional curve into the higher-dimensional space occupied by the data. A
generic formalism for curve fitting in the context of Bayesian inference is
developed which shows how the aforementioned metric arises. The result is a
natural generalization of previous works, and is compared to oft-used
frequentist approaches and similar Bayesian techniques.
| physics.data-an astro-ph.IM math.ST stat.TH | fitting models to data using bayesian inference is quite common but when each point in parameter space gives a curve fitting the curve to a data set requires new nuisance parameters which specify the metric embedding the onedimensional curve into the higherdimensional space occupied by the data a generic formalism for curve fitting in the context of bayesian inference is developed which shows how the aforementioned metric arises the result is a natural generalization of previous works and is compared to oftused frequentist approaches and similar bayesian techniques | [['fitting', 'models', 'to', 'data', 'using', 'bayesian', 'inference', 'is', 'quite', 'common', 'but', 'when', 'each', 'point', 'in', 'parameter', 'space', 'gives', 'a', 'curve', 'fitting', 'the', 'curve', 'to', 'a', 'data', 'set', 'requires', 'new', 'nuisance', 'parameters', 'which', 'specify', 'the', 'metric', 'embedding', 'the', 'onedimensional', 'curve', 'into', 'the', 'higherdimensional', 'space', 'occupied', 'by', 'the', 'data', 'a', 'generic', 'formalism', 'for', 'curve', 'fitting', 'in', 'the', 'context', 'of', 'bayesian', 'inference', 'is', 'developed', 'which', 'shows', 'how', 'the', 'aforementioned', 'metric', 'arises', 'the', 'result', 'is', 'a', 'natural', 'generalization', 'of', 'previous', 'works', 'and', 'is', 'compared', 'to', 'oftused', 'frequentist', 'approaches', 'and', 'similar', 'bayesian', 'techniques']] | [-0.04127305617757057, -0.016587992733217437, -0.1493176167185249, 0.12512615042082456, -0.1465152026556263, -0.1892421857072887, 0.08010638089300218, 0.35357763403391634, -0.2685901062266732, -0.3080484772270376, 0.08741734697832726, -0.24873556962914087, -0.11515127319249917, 0.2236309515058317, -0.13598161554810675, 0.07231994426216591, 0.08705487490673973, 0.014274377354674718, -0.10463798338208687, -0.23455079578244212, 0.3377442032585598, 0.05800057074520737, 0.31346769724041224, -0.06541907857172191, 0.09054220297283874, 0.047182045517150654, -0.04243694177024405, 0.019157226524839643, -0.1560402205901813, 0.15118509039960124, 0.2663518035967007, 0.2141815968365832, 0.23312646478668533, -0.31244971899485047, -0.29857926607258956, 0.13196198309411888, 0.14316327389414338, 0.09599809004761152, 0.02717564729127017, -0.2534080508630723, 0.00110819025113332, -0.1266944186698476, -0.09722495361612263, -0.11734199610708113, -0.005684786222197793, -0.050623035143044864, -0.29987265984527767, 0.04377266283633865, 0.06594045957502782, 0.047411539783173466, -0.04500619702792557, -0.10382780568695373, -0.011249644541583786, 0.061045270295752824, 0.06707975272068077, 0.08850391770035705, 0.08739081381777809, -0.08965868772727183, -0.08941706685635092, 0.3850185823923146, -0.06372052322628653, -0.21858219235119494, 0.13495743691402656, -0.07726289743070745, -0.14879342501940715, 0.1162738234270364, 0.12545880542496557, 0.11716915811517868, -0.1878384879285229, 0.14330088933374183, -0.03415521104100414, 0.1562328347288051, -0.017912249609997325, -0.06982797330287709, 0.18146758926609022, 0.18559949606159618, 0.03273361108519814, 0.12410223394611174, -0.12994906084019353, -0.145331231162841, -0.28333538453179324, -0.10771618940605715, -0.17022380377007226, -0.007482896889665757, -0.1637642357590349, -0.1908066597005183, 0.41507743122267793, 0.1363637265114283, 0.2521433924822221, 0.06766694679655219, 0.3232439388944344, 0.1339071220786123, 0.06331410575446418, 0.06728682673102329, 0.20663330247969663, 0.0981434726510832, 0.03287699480742132, -0.10931144682267173, 0.0777240866181356, 0.04086619421352886] |
1,802.0534 | From Gameplay to Symbolic Reasoning: Learning SAT Solver Heuristics in
the Style of Alpha(Go) Zero | Despite the recent successes of deep neural networks in various fields such
as image and speech recognition, natural language processing, and reinforcement
learning, we still face big challenges in bringing the power of numeric
optimization to symbolic reasoning. Researchers have proposed different avenues
such as neural machine translation for proof synthesis, vectorization of
symbols and expressions for representing symbolic patterns, and coupling of
neural back-ends for dimensionality reduction with symbolic front-ends for
decision making. However, these initial explorations are still only point
solutions, and bear other shortcomings such as lack of correctness guarantees.
In this paper, we present our approach of casting symbolic reasoning as games,
and directly harnessing the power of deep reinforcement learning in the style
of Alpha(Go) Zero on symbolic problems. Using the Boolean Satisfiability (SAT)
problem as showcase, we demonstrate the feasibility of our method, and the
advantages of modularity, efficiency, and correctness guarantees.
| cs.AI | despite the recent successes of deep neural networks in various fields such as image and speech recognition natural language processing and reinforcement learning we still face big challenges in bringing the power of numeric optimization to symbolic reasoning researchers have proposed different avenues such as neural machine translation for proof synthesis vectorization of symbols and expressions for representing symbolic patterns and coupling of neural backends for dimensionality reduction with symbolic frontends for decision making however these initial explorations are still only point solutions and bear other shortcomings such as lack of correctness guarantees in this paper we present our approach of casting symbolic reasoning as games and directly harnessing the power of deep reinforcement learning in the style of alphago zero on symbolic problems using the boolean satisfiability sat problem as showcase we demonstrate the feasibility of our method and the advantages of modularity efficiency and correctness guarantees | [['despite', 'the', 'recent', 'successes', 'of', 'deep', 'neural', 'networks', 'in', 'various', 'fields', 'such', 'as', 'image', 'and', 'speech', 'recognition', 'natural', 'language', 'processing', 'and', 'reinforcement', 'learning', 'we', 'still', 'face', 'big', 'challenges', 'in', 'bringing', 'the', 'power', 'of', 'numeric', 'optimization', 'to', 'symbolic', 'reasoning', 'researchers', 'have', 'proposed', 'different', 'avenues', 'such', 'as', 'neural', 'machine', 'translation', 'for', 'proof', 'synthesis', 'vectorization', 'of', 'symbols', 'and', 'expressions', 'for', 'representing', 'symbolic', 'patterns', 'and', 'coupling', 'of', 'neural', 'backends', 'for', 'dimensionality', 'reduction', 'with', 'symbolic', 'frontends', 'for', 'decision', 'making', 'however', 'these', 'initial', 'explorations', 'are', 'still', 'only', 'point', 'solutions', 'and', 'bear', 'other', 'shortcomings', 'such', 'as', 'lack', 'of', 'correctness', 'guarantees', 'in', 'this', 'paper', 'we', 'present', 'our', 'approach', 'of', 'casting', 'symbolic', 'reasoning', 'as', 'games', 'and', 'directly', 'harnessing', 'the', 'power', 'of', 'deep', 'reinforcement', 'learning', 'in', 'the', 'style', 'of', 'alphago', 'zero', 'on', 'symbolic', 'problems', 'using', 'the', 'boolean', 'satisfiability', 'sat', 'problem', 'as', 'showcase', 'we', 'demonstrate', 'the', 'feasibility', 'of', 'our', 'method', 'and', 'the', 'advantages', 'of', 'modularity', 'efficiency', 'and', 'correctness', 'guarantees']] | [-0.050750476385252805, -0.0370811045333441, -0.046449200646649744, 0.05152418967446539, -0.14123345049400185, -0.16801433531391258, 0.041335738036699744, 0.4156689732020872, -0.32525285338429183, -0.344580366312781, 0.12378849106765277, -0.2336172821075731, -0.21798039059236496, 0.23282748864762284, -0.1351776590312806, 0.1872404652924554, 0.1251682124314578, 0.004161039066840769, -0.05060206578943778, -0.26884819231486906, 0.3013023844152387, 0.00222031788773067, 0.30707751018171375, 0.06107707556834243, 0.13925007408771134, -0.008042169576731033, -0.0075410384263188855, -0.023127966412544453, -0.016611754275210253, 0.19671517555488627, 0.3891726449758091, 0.3231652040456145, 0.37037606673894097, -0.4632206060923636, -0.20601254571905686, 0.07464377774020839, 0.15026998413393172, 0.11572886300524948, -0.07560075110538762, -0.31916748428390035, 0.11454645667155902, -0.17746990379512412, 0.002421889778201443, -0.2064085800666362, 0.00775063518400153, 0.03422216761434872, -0.21776669430216095, -0.04703252249070116, 0.1572202999007926, 0.15894799184280675, -0.04371581937350031, -0.15561238158104085, 0.06280816710991408, 0.13113092405192955, 0.06431154844766432, 0.007481064424044578, 0.13702298656445802, -0.2270901576266624, -0.22988543842252143, 0.35716084166543205, -0.005757136880797711, -0.18019945253743916, 0.21113666644747797, 0.01668898405576427, -0.2170433712324027, 0.04525608699642927, 0.20516258260357897, 0.09409548643649228, -0.11499325244851108, 0.09012852835852804, 0.004418379885169702, 0.18067601814058237, 0.11061916409714802, 0.033111634494334054, 0.19566298884220068, 0.27059846937757087, -0.0009131617450809761, 0.13870662730462485, -0.041617322321414844, -0.13553707450754135, -0.19683967997647217, -0.1403317383574668, -0.1580635135980776, -0.017029668552945746, -0.12902003969931095, -0.1628427593072096, 0.38643948434273134, 0.2295424802530859, 0.14267071601431314, 0.17758999133759454, 0.37028142880346326, 0.0909549366325656, 0.08721382591269307, 0.07414712513343909, 0.16248528625284372, 0.0798507316802578, 0.1677046191494761, -0.20018013953734692, 0.09361160824758101, 0.04656158447363162] |
1,802.05341 | Phase-Space Analysis of Fluid-Dynamical Models of Traffic Flow | The present research article is devoted to the study of two fluid-dynamical
traffic models and their steady states by first analyzing the kinetic-type
Borsche-Kimathi-Klar model and the Navier-Stokes-type Helbing model. To fulfill
this purpose, the study is made by means of a general analysis in the phase
space. Phase space paths are constructed in several cases for both models,
evaluating explicitly some phase space trajectories. Ultimately, the results of
these analyses are discussed.
| physics.soc-ph cond-mat.stat-mech | the present research article is devoted to the study of two fluiddynamical traffic models and their steady states by first analyzing the kinetictype borschekimathiklar model and the navierstokestype helbing model to fulfill this purpose the study is made by means of a general analysis in the phase space phase space paths are constructed in several cases for both models evaluating explicitly some phase space trajectories ultimately the results of these analyses are discussed | [['the', 'present', 'research', 'article', 'is', 'devoted', 'to', 'the', 'study', 'of', 'two', 'fluiddynamical', 'traffic', 'models', 'and', 'their', 'steady', 'states', 'by', 'first', 'analyzing', 'the', 'kinetictype', 'borschekimathiklar', 'model', 'and', 'the', 'navierstokestype', 'helbing', 'model', 'to', 'fulfill', 'this', 'purpose', 'the', 'study', 'is', 'made', 'by', 'means', 'of', 'a', 'general', 'analysis', 'in', 'the', 'phase', 'space', 'phase', 'space', 'paths', 'are', 'constructed', 'in', 'several', 'cases', 'for', 'both', 'models', 'evaluating', 'explicitly', 'some', 'phase', 'space', 'trajectories', 'ultimately', 'the', 'results', 'of', 'these', 'analyses', 'are', 'discussed']] | [-0.13046512186095546, 0.12128725903393286, -0.07473639468985817, 0.08169364981747801, -0.01284827449126169, -0.07205875969318892, 0.03684152952822236, 0.35265544056892395, -0.21596614530749825, -0.2888715790274243, 0.14787474062824105, -0.2585051058170696, -0.182503785394753, 0.21035534536672962, -0.017747784757779703, 0.08323445456982073, 0.06554016372602847, -0.0252352892259498, -0.06592838213934253, -0.23840048390169008, 0.36130651600584923, 0.030121986353252497, 0.29150294676785254, 0.01457656234399312, 0.03984702517563063, -0.022315125923746057, -0.09115005055597673, 0.022363106432926036, -0.1808603972895071, 0.12237037525644862, 0.2364773415915301, 0.12639205281286398, 0.24982884109744596, -0.4224554447767635, -0.2599485126686179, 0.13495777663774788, 0.0974239371328925, 0.11668555783237228, -0.010026528383605182, -0.3118032378066952, 0.05203841917682439, -0.14638931264117774, -0.14024579707377902, -0.12383609459114571, -0.00701259324947993, 0.016765888722147793, -0.18796103110071272, 0.000564286653469834, 0.053777780810681484, 0.041702100098417655, -0.09299097278724527, -0.08669203751196619, -0.0015386512451287773, 0.14236912208919725, 0.07749388037417601, 0.005809658831114777, 0.038335523503418595, -0.1172022786761065, -0.10299210650151104, 0.40158053743653, -0.019442737257728975, -0.21051770265007186, 0.1611006478520317, -0.12567293459950532, -0.14801715734776938, 0.09910660432392938, 0.17791174857928935, 0.12431062012910843, -0.21730563668016759, 0.0658009217052798, -0.009798887884244323, 0.0890686171543267, -0.0067018573689791895, -0.016689888022988777, 0.19139269256912586, 0.18746448512603012, -0.016385591765154257, 0.15835164622209655, -0.03665016172453761, -0.15645079968898143, -0.31798681078685653, -0.17299265044372683, -0.14194077488759327, -0.06325771035982244, -0.024493564965976274, -0.10065625173350175, 0.43759294129106113, 0.15611984849803978, 0.1976960995881301, 0.03533203111469953, 0.2691432394656456, 0.09138029509793139, -0.039223945883956425, 0.0536779421252302, 0.24179047014533556, 0.11758137601039682, 0.12571256197083536, -0.18078887608862715, 0.06893591130048865, 0.09132929302480382] |
1,802.05342 | Spatial Coherence of Oriented White Matter Microstructure: Applications
to White Matter Regions Associated with Genetic Similarity | We present a method to discover differences between populations with respect
to the spatial coherence of their oriented white matter microstructure in
arbitrarily shaped white matter regions. This method is applied to diffusion
MRI scans of a subset of the Human Connectome Project dataset: 57 pairs of
monozygotic and 52 pairs of dizygotic twins. After controlling for
morphological similarity between twins, we identify 3.7% of all white matter as
being associated with genetic similarity (35.1k voxels, $p < 10^{-4}$, false
discovery rate 1.5%), 75% of which spatially clusters into twenty-two
contiguous white matter regions. Furthermore, we show that the orientation
similarity within these regions generalizes to a subset of 47 pairs of non-twin
siblings, and show that these siblings are on average as similar as dizygotic
twins. The regions are located in deep white matter including the superior
longitudinal fasciculus, the optic radiations, the middle cerebellar peduncle,
the corticospinal tract, and within the anterior temporal lobe, as well as the
cerebellum, brain stem, and amygdalae.
These results extend previous work using undirected fractional anisotrophy
for measuring putative heritable influences in white matter. Our
multidirectional extension better accounts for crossing fiber connections
within voxels. This bottom up approach has at its basis a novel measurement of
coherence within neighboring voxel dyads between subjects, and avoids some of
the fundamental ambiguities encountered with tractographic approaches to white
matter analysis that estimate global connectivity.
| stat.AP cs.CV q-bio.QM | we present a method to discover differences between populations with respect to the spatial coherence of their oriented white matter microstructure in arbitrarily shaped white matter regions this method is applied to diffusion mri scans of a subset of the human connectome project dataset 57 pairs of monozygotic and 52 pairs of dizygotic twins after controlling for morphological similarity between twins we identify 37 of all white matter as being associated with genetic similarity 351k voxels p 104 false discovery rate 15 75 of which spatially clusters into twentytwo contiguous white matter regions furthermore we show that the orientation similarity within these regions generalizes to a subset of 47 pairs of nontwin siblings and show that these siblings are on average as similar as dizygotic twins the regions are located in deep white matter including the superior longitudinal fasciculus the optic radiations the middle cerebellar peduncle the corticospinal tract and within the anterior temporal lobe as well as the cerebellum brain stem and amygdalae these results extend previous work using undirected fractional anisotrophy for measuring putative heritable influences in white matter our multidirectional extension better accounts for crossing fiber connections within voxels this bottom up approach has at its basis a novel measurement of coherence within neighboring voxel dyads between subjects and avoids some of the fundamental ambiguities encountered with tractographic approaches to white matter analysis that estimate global connectivity | [['we', 'present', 'a', 'method', 'to', 'discover', 'differences', 'between', 'populations', 'with', 'respect', 'to', 'the', 'spatial', 'coherence', 'of', 'their', 'oriented', 'white', 'matter', 'microstructure', 'in', 'arbitrarily', 'shaped', 'white', 'matter', 'regions', 'this', 'method', 'is', 'applied', 'to', 'diffusion', 'mri', 'scans', 'of', 'a', 'subset', 'of', 'the', 'human', 'connectome', 'project', 'dataset', '57', 'pairs', 'of', 'monozygotic', 'and', '52', 'pairs', 'of', 'dizygotic', 'twins', 'after', 'controlling', 'for', 'morphological', 'similarity', 'between', 'twins', 'we', 'identify', '37', 'of', 'all', 'white', 'matter', 'as', 'being', 'associated', 'with', 'genetic', 'similarity', '351k', 'voxels', 'p', '104', 'false', 'discovery', 'rate', '15', '75', 'of', 'which', 'spatially', 'clusters', 'into', 'twentytwo', 'contiguous', 'white', 'matter', 'regions', 'furthermore', 'we', 'show', 'that', 'the', 'orientation', 'similarity', 'within', 'these', 'regions', 'generalizes', 'to', 'a', 'subset', 'of', '47', 'pairs', 'of', 'nontwin', 'siblings', 'and', 'show', 'that', 'these', 'siblings', 'are', 'on', 'average', 'as', 'similar', 'as', 'dizygotic', 'twins', 'the', 'regions', 'are', 'located', 'in', 'deep', 'white', 'matter', 'including', 'the', 'superior', 'longitudinal', 'fasciculus', 'the', 'optic', 'radiations', 'the', 'middle', 'cerebellar', 'peduncle', 'the', 'corticospinal', 'tract', 'and', 'within', 'the', 'anterior', 'temporal', 'lobe', 'as', 'well', 'as', 'the', 'cerebellum', 'brain', 'stem', 'and', 'amygdalae', 'these', 'results', 'extend', 'previous', 'work', 'using', 'undirected', 'fractional', 'anisotrophy', 'for', 'measuring', 'putative', 'heritable', 'influences', 'in', 'white', 'matter', 'our', 'multidirectional', 'extension', 'better', 'accounts', 'for', 'crossing', 'fiber', 'connections', 'within', 'voxels', 'this', 'bottom', 'up', 'approach', 'has', 'at', 'its', 'basis', 'a', 'novel', 'measurement', 'of', 'coherence', 'within', 'neighboring', 'voxel', 'dyads', 'between', 'subjects', 'and', 'avoids', 'some', 'of', 'the', 'fundamental', 'ambiguities', 'encountered', 'with', 'tractographic', 'approaches', 'to', 'white', 'matter', 'analysis', 'that', 'estimate', 'global', 'connectivity']] | [-0.06686445205928326, 0.11733902862812454, -0.05261908899090101, 0.07752619222030126, -0.04812151384498875, -0.08999325641090387, 0.07924044078461095, 0.39516404354001194, -0.22669983221759551, -0.36770161402376883, 0.029990502111088408, -0.31503263704011025, -0.15099782283194282, 0.14762374309880355, -0.09705088742355311, -0.012333076142619819, 0.0639600899434107, 0.049108661385560776, -0.03417155368454623, -0.22409776523596472, 0.2799547773145861, 0.007945254913686122, 0.25757837320251253, -0.04264085014284171, 0.1006584895589073, -0.04091431302867731, -0.06903641327837634, -0.00564579784435257, -0.09586731422153924, 0.11961259448409516, 0.2507725705911656, 0.12894282958702089, 0.2836153169987223, -0.3799543867117442, -0.22521129106109888, 0.09797886105680978, 0.16125431459905817, 0.03138485378103684, -0.03527778388351809, -0.32662414837965026, 0.12242782453181722, -0.13347386094969224, -0.07682707316179592, -0.015808416210475996, 0.03257272514362824, 0.022202101642253606, -0.21902151759108734, 0.1707765671100451, 0.025830797861855364, 0.0691496746589959, -0.09300161556890521, -0.1285140234894952, -0.027892261308654815, 0.16101641608720096, 0.012253898254386457, 0.05300901186540169, 0.1649228218360291, -0.13516408914704253, -0.09631475990654548, 0.32527038603708236, -0.03645214971333398, -0.14869678689788468, 0.20769928379285885, -0.17363997298653858, -0.09703986718840404, 0.1249251318480081, 0.1733313500676058, 0.09564487408592247, -0.1529636276139168, -0.020782512122106692, -0.01562540363089596, 0.16653639362511607, 0.12076233985571248, 0.03526845304674924, 0.24565429914545778, 0.1914641986486178, 0.012697788829287507, 0.1038762161852833, -0.1881676097754348, -0.06218610715022565, -0.24849034857726965, -0.1269954633755437, -0.10851479994311584, -0.013983865747780084, -0.1113574894389116, -0.15791049437999463, 0.3958592245905016, 0.11655802547661531, 0.2073928472821371, 0.02511052114248998, 0.24168349140106254, -0.030553994499278227, 0.09557260959901506, 0.0625193547461303, 0.1989186163587826, 0.16889759377137417, 0.0548238988149304, -0.20510580908560444, 0.05862425361751755, 0.0050835298417374036] |
1,802.05343 | Geometry of biperiodic alternating links | A biperiodic alternating link has an alternating quotient link in the
thickened torus. In this paper, we focus on semi-regular links, a class of
biperiodic alternating links whose hyperbolic structure can be immediately
determined from a corresponding Euclidean tiling. Consequently, we determine
the exact volumes of semi-regular links. We relate their commensurability and
arithmeticity to the corresponding tiling, and assuming a conjecture of Milnor,
we show there exist infinitely many pairwise incommensurable semi-regular links
with the same invariant trace field. We show that only two semi-regular links
have totally geodesic checkerboard surfaces; these two links satisfy the Volume
Density Conjecture. Finally, we give conditions implying that many additional
biperiodic alternating links are hyperbolic and admit a positively oriented,
unimodular geometric triangulation. We also provide sharp upper and lower
volume bounds for these links.
| math.GT | a biperiodic alternating link has an alternating quotient link in the thickened torus in this paper we focus on semiregular links a class of biperiodic alternating links whose hyperbolic structure can be immediately determined from a corresponding euclidean tiling consequently we determine the exact volumes of semiregular links we relate their commensurability and arithmeticity to the corresponding tiling and assuming a conjecture of milnor we show there exist infinitely many pairwise incommensurable semiregular links with the same invariant trace field we show that only two semiregular links have totally geodesic checkerboard surfaces these two links satisfy the volume density conjecture finally we give conditions implying that many additional biperiodic alternating links are hyperbolic and admit a positively oriented unimodular geometric triangulation we also provide sharp upper and lower volume bounds for these links | [['a', 'biperiodic', 'alternating', 'link', 'has', 'an', 'alternating', 'quotient', 'link', 'in', 'the', 'thickened', 'torus', 'in', 'this', 'paper', 'we', 'focus', 'on', 'semiregular', 'links', 'a', 'class', 'of', 'biperiodic', 'alternating', 'links', 'whose', 'hyperbolic', 'structure', 'can', 'be', 'immediately', 'determined', 'from', 'a', 'corresponding', 'euclidean', 'tiling', 'consequently', 'we', 'determine', 'the', 'exact', 'volumes', 'of', 'semiregular', 'links', 'we', 'relate', 'their', 'commensurability', 'and', 'arithmeticity', 'to', 'the', 'corresponding', 'tiling', 'and', 'assuming', 'a', 'conjecture', 'of', 'milnor', 'we', 'show', 'there', 'exist', 'infinitely', 'many', 'pairwise', 'incommensurable', 'semiregular', 'links', 'with', 'the', 'same', 'invariant', 'trace', 'field', 'we', 'show', 'that', 'only', 'two', 'semiregular', 'links', 'have', 'totally', 'geodesic', 'checkerboard', 'surfaces', 'these', 'two', 'links', 'satisfy', 'the', 'volume', 'density', 'conjecture', 'finally', 'we', 'give', 'conditions', 'implying', 'that', 'many', 'additional', 'biperiodic', 'alternating', 'links', 'are', 'hyperbolic', 'and', 'admit', 'a', 'positively', 'oriented', 'unimodular', 'geometric', 'triangulation', 'we', 'also', 'provide', 'sharp', 'upper', 'and', 'lower', 'volume', 'bounds', 'for', 'these', 'links']] | [-0.2873151634480188, 0.16182228321609127, -0.0750674036912676, 0.09607733583298365, -0.1171520613606571, -0.1762210203446728, 0.05161249720757561, 0.43454251457285836, -0.29988676406919285, -0.24355251320350663, 0.1272012144397188, -0.24378915006098778, -0.24607625617680692, 0.1592587065161731, -0.11558180676135969, -0.02532096654421797, 0.07432947101953782, 0.07347320355811941, -0.09881305167997691, -0.31056126269259793, 0.3315860255152211, -0.09850290449882361, 0.21782834735117795, 0.08911687815369324, 0.08683020924250823, -0.00024159792880702735, -0.08455693996616435, 0.05875455444552621, -0.2398209405781332, 0.1337474940932895, 0.20078867273335171, 0.03367315502697252, 0.11564064468257129, -0.426401015861254, -0.13905758463910647, 0.19282368464129312, 0.16301769001367397, 0.013230368581204851, -0.04061511629943813, -0.22065110917770325, 0.10782301915753492, -0.12482765275036174, -0.17386566473633275, -0.033370888511881344, -0.0033912829856941463, 0.07701911895423848, -0.17229045056291556, 0.008678614748142926, 0.13194820517323969, 0.1174476308469342, -0.033728534138684436, -0.07376343731880468, -0.03408223911559671, 0.1310238282649631, 0.005472913072829632, 0.006311233944077521, -0.0022840907594147033, -0.05957470432841184, -0.12152887053815718, 0.318233093912048, -0.023906891838615916, -0.281968191557317, 0.20307399994952785, -0.13075247608804444, -0.20288358288431974, 0.1863170292042896, 0.12925004687412342, 0.08170329637237285, -0.07556406402289938, 0.0884558011136977, -0.19672828139404633, 0.11673112898448804, 0.18716767327019707, 0.013151592039328096, 0.2157632455341798, 0.029897593882607112, 0.16662977499050557, 0.19475264184674093, -0.0504303901382771, -0.05989716635820897, -0.28135193568563327, -0.19988748230498732, -0.16059689046429904, 0.1182674833475367, -0.1438224878633934, -0.22153644507341227, 0.3407008861702748, 0.0030850788746449283, 0.1830703516567784, 0.12691730676771185, 0.21587245199913369, 0.06225792129254459, 0.04992558178141769, 0.12399160009773827, 0.14477634797558972, 0.18900219281729227, -0.03460217666500633, -0.12613264905224042, 0.006410003895346159, 0.18554460602686426] |
1,802.05344 | Some Properties of Lattice Congruences Preserving Involutions and Their
Largest Numbers in the Finite Case | In this paper, we characterize the congruences of an arbitrary i--lattice,
investigate the structure of the lattice they form and how it relates to the
structure of the lattice of lattice congruences, then, for an arbitrary
non--zero natural number $n$, we determine the largest possible number of
congruences of an $n$--element i--lattice, along with the structures of the
$n$--element i--lattices with this number of congruences. Our characterizations
of the congruences of i--lattices have useful corollaries: determining the
congruences of i--chains, the congruence extension property of the variety of
distributive i--lattices, a description of the atoms of the congruence lattices
of i--lattices, characterizations for the subdirect irreducibility of
i--lattices. In terms of the relation between the above--mentioned problem on
numbers of congruences of finite i--lattices and its analogue for lattices,
while the $n$--element i--lattices with the largest number of congruences turn
out to be exactly the $n$--element lattices whose number of congruences is
either the largest or the second largest possible, we provide examples of pairs
of $n$--element i--lattices and even pseudo--Kleene algebras such that one of
them has strictly more congruences, but strictly less lattice congruences than
the other.
| math.RA | in this paper we characterize the congruences of an arbitrary ilattice investigate the structure of the lattice they form and how it relates to the structure of the lattice of lattice congruences then for an arbitrary nonzero natural number n we determine the largest possible number of congruences of an nelement ilattice along with the structures of the nelement ilattices with this number of congruences our characterizations of the congruences of ilattices have useful corollaries determining the congruences of ichains the congruence extension property of the variety of distributive ilattices a description of the atoms of the congruence lattices of ilattices characterizations for the subdirect irreducibility of ilattices in terms of the relation between the abovementioned problem on numbers of congruences of finite ilattices and its analogue for lattices while the nelement ilattices with the largest number of congruences turn out to be exactly the nelement lattices whose number of congruences is either the largest or the second largest possible we provide examples of pairs of nelement ilattices and even pseudokleene algebras such that one of them has strictly more congruences but strictly less lattice congruences than the other | [['in', 'this', 'paper', 'we', 'characterize', 'the', 'congruences', 'of', 'an', 'arbitrary', 'ilattice', 'investigate', 'the', 'structure', 'of', 'the', 'lattice', 'they', 'form', 'and', 'how', 'it', 'relates', 'to', 'the', 'structure', 'of', 'the', 'lattice', 'of', 'lattice', 'congruences', 'then', 'for', 'an', 'arbitrary', 'nonzero', 'natural', 'number', 'n', 'we', 'determine', 'the', 'largest', 'possible', 'number', 'of', 'congruences', 'of', 'an', 'nelement', 'ilattice', 'along', 'with', 'the', 'structures', 'of', 'the', 'nelement', 'ilattices', 'with', 'this', 'number', 'of', 'congruences', 'our', 'characterizations', 'of', 'the', 'congruences', 'of', 'ilattices', 'have', 'useful', 'corollaries', 'determining', 'the', 'congruences', 'of', 'ichains', 'the', 'congruence', 'extension', 'property', 'of', 'the', 'variety', 'of', 'distributive', 'ilattices', 'a', 'description', 'of', 'the', 'atoms', 'of', 'the', 'congruence', 'lattices', 'of', 'ilattices', 'characterizations', 'for', 'the', 'subdirect', 'irreducibility', 'of', 'ilattices', 'in', 'terms', 'of', 'the', 'relation', 'between', 'the', 'abovementioned', 'problem', 'on', 'numbers', 'of', 'congruences', 'of', 'finite', 'ilattices', 'and', 'its', 'analogue', 'for', 'lattices', 'while', 'the', 'nelement', 'ilattices', 'with', 'the', 'largest', 'number', 'of', 'congruences', 'turn', 'out', 'to', 'be', 'exactly', 'the', 'nelement', 'lattices', 'whose', 'number', 'of', 'congruences', 'is', 'either', 'the', 'largest', 'or', 'the', 'second', 'largest', 'possible', 'we', 'provide', 'examples', 'of', 'pairs', 'of', 'nelement', 'ilattices', 'and', 'even', 'pseudokleene', 'algebras', 'such', 'that', 'one', 'of', 'them', 'has', 'strictly', 'more', 'congruences', 'but', 'strictly', 'less', 'lattice', 'congruences', 'than', 'the', 'other']] | [-0.21532256804167518, 0.13038906613073778, -0.05270992461088542, 0.06157845530747058, -0.1003632445995872, -0.06339326511716117, 0.02355526704215319, 0.31689724667954283, -0.3104949326556478, -0.253661412911842, 0.08480603368323598, -0.3307042043517671, -0.09083139088155853, 0.20100253223743592, 0.016293784904268544, 0.02192532644808494, 0.010620584591379156, 0.1241178443203869, -0.07473776646436671, -0.32066177903750054, 0.36333254019452915, 0.008493772510288133, 0.2256307597410538, 0.03630954781547189, 0.07425067872815841, 0.017376860932799408, 0.009835548714004659, 0.03354234749803672, -0.18639301748059822, 0.18148549884192747, 0.22761388925986514, 0.1304583703922863, 0.21518395779956434, -0.3860632163900379, -0.0836948803198096, 0.2009373168158974, 0.14520427895256796, 0.027990027435274945, 0.017424875822758326, -0.21597231511227988, 0.10958801140958394, -0.1330887701689593, -0.1751587996611724, -0.08096825739217771, 0.08684321836241193, 0.08582749759394524, -0.2328503883777287, -0.0045476999083483545, 0.18061348802152064, 0.15949476779111335, -0.03907135337326877, -0.12431187068892492, -0.001192538272841154, 0.08782914659839022, 0.032171397916720926, -0.04742655571097055, -0.021399786053980525, -0.11876013984878522, -0.15559786514920257, 0.4321472478678098, 0.06280549661519094, -0.17837024621313086, 0.1361922857716579, -0.17466726869697102, -0.1546877873709073, 0.11268508745911153, 0.1098358156184691, 0.1291805324471883, -0.046771675562863615, 0.10260869440201016, -0.18206200389745267, 0.11805888178783494, 0.1636712815713238, 0.06784933906904346, 0.18287907075640317, 0.08358401307974615, 0.05827488098671106, 0.22048585513524863, 0.03040975265541567, -0.0013541165040805935, -0.34647362521673375, -0.2110707852209138, -0.15008977290897355, 0.09825440992701899, -0.1587391467561247, -0.2287063202040421, 0.3687689253745752, 0.11490515031272898, 0.1751888480440185, 0.08511067012173903, 0.18659662945397398, 0.05118972256188155, 0.09347715938111414, 0.02881164668203407, 0.12634551011755862, 0.20181639337459126, -0.06568854140948403, -0.1810957302907293, -0.008591988763293704, 0.1505095056283313] |
1,802.05345 | Infinitesimal isometries of connection metric and generalized moment map
equation | Let $(M,g)$ be a smooth Riemannian manifold, $K$ a compact Lie group and
$p:P\to M$ a principal $K$-bundle over $M$ endowed with a connection $A$.
Fixing a bi invariant inner product on Lie algebra $\mathfrak{k}$ of $K$, the
connection $A$ and metric $g$ define a Riemannian metric $g_A$ on $P$. Let
$\tilde {X}$ be the horizontal lift of vector field $X$ on $M$ and, let
$\xi^\nu$ be the vertical field associated with section $\nu\in
A^0(\mathrm{ad}( P))$ of the adjoint bundle. It is proved that the connection
$A$ is invariant under the 1-parameter group of local diffeomorphism generated
by $\tilde{ X}+\xi^\nu$ if and only if $X$ and $\nu$ satisfy the generalized
moment map equation $\iota_XF_A=-\nabla^A\nu$. The Lie algebra of fiber
preserving Killing fields of $(P,g_A)$ is studied, in the case where $K$ is
compact, connected and semisimple.
| math.DG | let mg be a smooth riemannian manifold k a compact lie group and ppto m a principal kbundle over m endowed with a connection a fixing a bi invariant inner product on lie algebra mathfrakk of k the connection a and metric g define a riemannian metric g_a on p let tilde x be the horizontal lift of vector field x on m and let xinu be the vertical field associated with section nuin a0mathrmad p of the adjoint bundle it is proved that the connection a is invariant under the 1parameter group of local diffeomorphism generated by tilde xxinu if and only if x and nu satisfy the generalized moment map equation iota_xf_anablaanu the lie algebra of fiber preserving killing fields of pg_a is studied in the case where k is compact connected and semisimple | [['let', 'mg', 'be', 'a', 'smooth', 'riemannian', 'manifold', 'k', 'a', 'compact', 'lie', 'group', 'and', 'ppto', 'm', 'a', 'principal', 'kbundle', 'over', 'm', 'endowed', 'with', 'a', 'connection', 'a', 'fixing', 'a', 'bi', 'invariant', 'inner', 'product', 'on', 'lie', 'algebra', 'mathfrakk', 'of', 'k', 'the', 'connection', 'a', 'and', 'metric', 'g', 'define', 'a', 'riemannian', 'metric', 'g_a', 'on', 'p', 'let', 'tilde', 'x', 'be', 'the', 'horizontal', 'lift', 'of', 'vector', 'field', 'x', 'on', 'm', 'and', 'let', 'xinu', 'be', 'the', 'vertical', 'field', 'associated', 'with', 'section', 'nuin', 'a0mathrmad', 'p', 'of', 'the', 'adjoint', 'bundle', 'it', 'is', 'proved', 'that', 'the', 'connection', 'a', 'is', 'invariant', 'under', 'the', '1parameter', 'group', 'of', 'local', 'diffeomorphism', 'generated', 'by', 'tilde', 'xxinu', 'if', 'and', 'only', 'if', 'x', 'and', 'nu', 'satisfy', 'the', 'generalized', 'moment', 'map', 'equation', 'iota_xf_anablaanu', 'the', 'lie', 'algebra', 'of', 'fiber', 'preserving', 'killing', 'fields', 'of', 'pg_a', 'is', 'studied', 'in', 'the', 'case', 'where', 'k', 'is', 'compact', 'connected', 'and', 'semisimple']] | [-0.259963861394984, 0.1339321263543697, -0.08325208654401428, -0.017347324958818994, -0.14892436073260437, -0.1830349024491046, -0.01589643471710257, 0.36879647094191925, -0.29421373089479114, -0.19264895552910413, 0.07890516796187237, -0.24864446826871822, -0.10237827116207247, 0.14363747430351478, -0.07861710991710424, -0.08863839186431671, 0.04476679697682178, 0.19511810364201665, -0.12512305614015504, -0.21839052545361815, 0.4200878380374475, -0.04792906086676697, 0.1993358967628217, -0.00640524392391936, 0.18200666932953577, -0.0007044883289684852, 0.02268974662222194, 0.027479868294022075, -0.13956064860201767, 0.08802077160957693, 0.25351024610978184, 0.05061482462792121, 0.18444699913291543, -0.3023322931293285, -0.14589247615058962, 0.22276804026808927, 0.09617504031242181, -0.16091235866064602, -0.0007383457365601013, -0.31534108633676433, 0.17039010843092744, -0.11913740057074888, -0.12653502240198466, -0.04638094754155838, 0.11911266722370673, -0.060684498201942806, -0.2875677026899983, -0.018209800434609253, 0.09184327904244349, 0.10415528105063872, -0.03790393236065001, -0.09451261193757862, -0.13682958750392904, 0.015674567608529644, -0.01664939308256814, 0.1938838210189715, 0.14877606550175132, -0.01856150676736213, -0.06589744261564744, 0.39073722359766677, -0.1282634069035394, -0.2785273504965572, 0.06709253427812434, -0.1913681831528348, -0.12649221629412336, 0.11418033364426458, 0.13778909767808561, 0.18489528754126336, -0.03265194200370884, 0.29417062834148633, -0.11690089763424387, 0.051739548170713315, 0.07310201107721889, -0.06744639803020452, 0.14557196535028968, 0.0847390399342685, 0.15002635849470441, 0.03606576904404034, 0.011384340233758629, 0.023605598623610356, -0.3866156413304535, -0.22385949208260034, -0.1306528964796047, 0.2408005070068281, -0.14464451289655478, -0.12538480233739724, 0.33758834296498785, -0.031035165133124046, 0.23613396751920157, 0.07554012868609844, 0.18188264064850623, 0.08189130185355405, 0.068039902983318, 0.12586903435206323, 0.08516963750871857, 0.33712305717177293, -0.05053042082175979, -0.16890160630591158, -0.06226767653204275, 0.15210910969427927] |
1,802.05346 | Rescaled Whittaker driven stochastic differential equations converge to
the additive stochastic heat equation | We study SDEs arising from limiting fluctuations in a $(2+1)$-dimensional
surface growth model called the Whittaker driven particle system, which is
believed to be in the anisotropic Kardar--Parisi--Zhang class.
The main result of this paper proves an irrelevance of nonlinearity in the
surface growth model in the continuum by weak convergence in a path space; the
first instance of this irrelevance is obtained recently for this model in terms
of the covariance functions along certain diverging characteristics. With the
same limiting scheme, we prove that the derived SDEs converge in distribution
to the additive stochastic heat equation in $C(\Bbb R_+,\mathcal S'(\Bbb
R^2))$. The proof addresses the solutions as stochastic convolutions where the
convolution structures are broken by discretization of the diverging
characteristics.
| math.PR | we study sdes arising from limiting fluctuations in a 21dimensional surface growth model called the whittaker driven particle system which is believed to be in the anisotropic kardarparisizhang class the main result of this paper proves an irrelevance of nonlinearity in the surface growth model in the continuum by weak convergence in a path space the first instance of this irrelevance is obtained recently for this model in terms of the covariance functions along certain diverging characteristics with the same limiting scheme we prove that the derived sdes converge in distribution to the additive stochastic heat equation in cbbb r_mathcal sbbb r2 the proof addresses the solutions as stochastic convolutions where the convolution structures are broken by discretization of the diverging characteristics | [['we', 'study', 'sdes', 'arising', 'from', 'limiting', 'fluctuations', 'in', 'a', '21dimensional', 'surface', 'growth', 'model', 'called', 'the', 'whittaker', 'driven', 'particle', 'system', 'which', 'is', 'believed', 'to', 'be', 'in', 'the', 'anisotropic', 'kardarparisizhang', 'class', 'the', 'main', 'result', 'of', 'this', 'paper', 'proves', 'an', 'irrelevance', 'of', 'nonlinearity', 'in', 'the', 'surface', 'growth', 'model', 'in', 'the', 'continuum', 'by', 'weak', 'convergence', 'in', 'a', 'path', 'space', 'the', 'first', 'instance', 'of', 'this', 'irrelevance', 'is', 'obtained', 'recently', 'for', 'this', 'model', 'in', 'terms', 'of', 'the', 'covariance', 'functions', 'along', 'certain', 'diverging', 'characteristics', 'with', 'the', 'same', 'limiting', 'scheme', 'we', 'prove', 'that', 'the', 'derived', 'sdes', 'converge', 'in', 'distribution', 'to', 'the', 'additive', 'stochastic', 'heat', 'equation', 'in', 'cbbb', 'r_mathcal', 'sbbb', 'r2', 'the', 'proof', 'addresses', 'the', 'solutions', 'as', 'stochastic', 'convolutions', 'where', 'the', 'convolution', 'structures', 'are', 'broken', 'by', 'discretization', 'of', 'the', 'diverging', 'characteristics']] | [-0.12143710342075553, 0.09371654011920327, -0.08269832488989122, 0.07767554606429347, -0.0322795732091868, -0.10161789134908163, -0.04024123268098891, 0.29477882866946153, -0.33400300775700414, -0.2118370316876862, 0.10692567331525574, -0.25598854091797085, -0.18154858577362887, 0.17050058685804215, -0.09282956298318554, 0.07080656260664224, 0.004093086436680961, -0.025906407344918392, -0.05528571755247435, -0.2127545080758387, 0.3605220709759437, 0.004389236803303977, 0.2867834715661211, 0.007542947185088376, 0.11804328786617634, -0.023132119142187026, -0.02523817483060917, 0.006446190090367158, -0.14691714080820886, 0.09243024468658584, 0.20911133164142975, 0.01752961829560427, 0.28386717555181123, -0.379546907898344, -0.23159491112761077, 0.1079277554603263, 0.1402180702840627, 0.1047209947413887, -0.019165143029016184, -0.2913844116093194, 0.08047671272556801, -0.1501772017752538, -0.1836893201927792, -0.006894537726737803, -0.0026058119861981604, 0.08844799687990491, -0.27386315795211275, 0.10565159360488846, 0.13199736631750206, 0.020165210234795193, -0.0816147915759414, -0.06588902379687661, -0.02995311687166085, 0.07727435515185849, 0.08482479798840359, 0.028446334319715924, 0.06707425258259793, -0.15514468984701288, -0.0912585911287575, 0.3568130793034664, -0.11863831587357172, -0.2529941758705822, 0.14280523801199543, -0.17982372528583299, -0.1511066016267802, 0.15114538391601662, 0.159982321573971, 0.11607893854074303, -0.18787540809526185, 0.13785699920606662, -0.04590799780486182, 0.10806731375117527, 0.04976298232165883, 0.01710643368528881, 0.11994314391232051, 0.16488416055522737, 0.08343251301052018, 0.16994800967771223, -0.03187777214973676, -0.1379534347158414, -0.34839410519944963, -0.16048690646153982, -0.20069427865740583, 0.08182127635876389, -0.12144012377047758, -0.2180857151044441, 0.370339775254818, 0.14372314696513178, 0.18357051859350235, 0.09392835453751909, 0.21614969055336275, 0.1963152710460966, 0.02164579089921823, 0.08468156481699896, 0.18645637363222137, 0.16043564772756283, 0.10059121844633559, -0.20480225861003837, 0.08425420654372724, 0.15075061181712834] |
1,802.05347 | Measurement of the solar system acceleration using the Earth scale
factor | We propose an alternative method to detect the secular aberration drift
induced by the solar system acceleration due to the attraction to the Galaxy
centre. This method is free of the individual radio source proper motion caused
by intrinsic structure variation. We developed a procedure to estimate the
scale factor directly from very long baseline interferometry (VLBI) data
analysis in a source-wise mode within a global solution. The scale factor is
estimated for each reference radio source individually as a function of
astrometric coordinates (right ascension and declination). This approach splits
the systematic dipole effect and uncorrelated motions on the level of
observational parameters. We processed VLBI observations from 1979.7 to 2016.5
to obtain the scale factor estimates for more than 4,000 reference radio
sources. We show that the estimates highlight a dipole systematics aligned with
the direction to the centre of the Galaxy. With this method we obtained a
Galactocentric acceleration vector with an amplitude of 5.2 $\pm$ 0.2 \mu as/yr
and direction $\alpha_G = 281\deg \pm 3\deg$ and $\delta_G = -35\deg \pm
3\deg$.
| astro-ph.GA astro-ph.IM | we propose an alternative method to detect the secular aberration drift induced by the solar system acceleration due to the attraction to the galaxy centre this method is free of the individual radio source proper motion caused by intrinsic structure variation we developed a procedure to estimate the scale factor directly from very long baseline interferometry vlbi data analysis in a sourcewise mode within a global solution the scale factor is estimated for each reference radio source individually as a function of astrometric coordinates right ascension and declination this approach splits the systematic dipole effect and uncorrelated motions on the level of observational parameters we processed vlbi observations from 19797 to 20165 to obtain the scale factor estimates for more than 4000 reference radio sources we show that the estimates highlight a dipole systematics aligned with the direction to the centre of the galaxy with this method we obtained a galactocentric acceleration vector with an amplitude of 52 pm 02 mu asyr and direction alpha_g 281deg pm 3deg and delta_g 35deg pm 3deg | [['we', 'propose', 'an', 'alternative', 'method', 'to', 'detect', 'the', 'secular', 'aberration', 'drift', 'induced', 'by', 'the', 'solar', 'system', 'acceleration', 'due', 'to', 'the', 'attraction', 'to', 'the', 'galaxy', 'centre', 'this', 'method', 'is', 'free', 'of', 'the', 'individual', 'radio', 'source', 'proper', 'motion', 'caused', 'by', 'intrinsic', 'structure', 'variation', 'we', 'developed', 'a', 'procedure', 'to', 'estimate', 'the', 'scale', 'factor', 'directly', 'from', 'very', 'long', 'baseline', 'interferometry', 'vlbi', 'data', 'analysis', 'in', 'a', 'sourcewise', 'mode', 'within', 'a', 'global', 'solution', 'the', 'scale', 'factor', 'is', 'estimated', 'for', 'each', 'reference', 'radio', 'source', 'individually', 'as', 'a', 'function', 'of', 'astrometric', 'coordinates', 'right', 'ascension', 'and', 'declination', 'this', 'approach', 'splits', 'the', 'systematic', 'dipole', 'effect', 'and', 'uncorrelated', 'motions', 'on', 'the', 'level', 'of', 'observational', 'parameters', 'we', 'processed', 'vlbi', 'observations', 'from', '19797', 'to', '20165', 'to', 'obtain', 'the', 'scale', 'factor', 'estimates', 'for', 'more', 'than', '4000', 'reference', 'radio', 'sources', 'we', 'show', 'that', 'the', 'estimates', 'highlight', 'a', 'dipole', 'systematics', 'aligned', 'with', 'the', 'direction', 'to', 'the', 'centre', 'of', 'the', 'galaxy', 'with', 'this', 'method', 'we', 'obtained', 'a', 'galactocentric', 'acceleration', 'vector', 'with', 'an', 'amplitude', 'of', '52', 'pm', '02', 'mu', 'asyr', 'and', 'direction', 'alpha_g', '281deg', 'pm', '3deg', 'and', 'delta_g', '35deg', 'pm', '3deg']] | [-0.10496969596715644, 0.08175699994644035, -0.07233668983728783, 0.04468493243578647, -0.10456921482643886, -0.06825506853490144, 0.046972620625005304, 0.43400635869291265, -0.2733469623309827, -0.3316668516449761, 0.06485687195369702, -0.26842475869850807, -0.030722006982837786, 0.18385047213091346, -0.029604648829475916, -0.01686936824675105, 0.0711917229397059, -0.027756183229833406, -0.063337966865092, -0.1434862531179682, 0.21301053402732992, 0.12974274318055276, 0.24399482306638973, -0.03474648393981965, 0.1306022021252994, -0.043713172256391035, -0.07357347111778649, 0.0124701082172711, -0.13479811058411878, 0.10206143129943755, 0.18179565912646334, 0.08639224172891145, 0.24511305525032967, -0.3230941963017161, -0.15189050660708275, 0.0654585124252157, 0.14359021930797408, 0.08188695794418019, -0.013255966897820373, -0.33307237534277273, 0.0758807922193334, -0.17923456507705, -0.2056282417826921, 0.029217894461376275, 0.05818161603379232, 0.007561406787152658, -0.27966579672919956, 0.14457431712735183, -0.006360374543576213, 0.07867580183307853, -0.11513813084848525, -0.1332931862429209, 0.025611109454293696, 0.10587065352116064, 0.06797857812131967, 0.14407644063940309, 0.1546679088813171, -0.06381650824387074, -0.062092488887583654, 0.3978125212788282, -0.09736917048397581, -0.15789272649110192, 0.10912065994953028, -0.19423484279568531, -0.1278395101956326, 0.12553512101873146, 0.16686570470368392, 0.09617085111387379, -0.15865849050841627, 0.0007439287180592965, 0.022371807568624877, 0.2393306787861021, 0.07384115618882342, 0.02451281844824144, 0.23464326816474834, 0.11847804228595474, 0.12028255662880838, 0.07224969702026648, -0.2551349835100649, -0.0037435972246161677, -0.28606560584484486, -0.04740437191001504, -0.13006405229050508, 0.08738743108011339, -0.13773656868728487, -0.11280797350670385, 0.3846515380390729, 0.1360873222345628, 0.20424469282077243, 0.03332982129248523, 0.3279939374194769, 0.09092009909333912, 0.10394332911928146, 0.09761879012963533, 0.27987017671234515, 0.13112166189801014, 0.07244806152316388, -0.22925992184509222, 0.02971360137841354, 0.03325801679309] |
1,802.05348 | Power Control and Mode Selection for VBR Video Streaming in D2D Networks | In this paper, we investigate the problem of power control for streaming
variable-bit-rate (VBR) videos in a device-to-device (D2D) wireless network. A
VBR video traffic model that considers video frame sizes and playout buffers at
the mobile users is adopted. A setup with one pair of D2D users (DUs) and one
cellular user (CU) is considered and three modes, namely cellular mode,
dedicated mode and reuse mode, are employed. Mode selection for the data
delivery is determined and the transmit powers of the base station (BS) and
device transmitter are optimized with the goal of maximizing the overall
transmission rate while VBR video data can be delivered to the CU and DU
without causing playout buffer underflows or overflows. A low-complexity
algorithm is proposed. Through simulations with VBR video traces over fading
channels, we demonstrate that video delivery with mode selection and power
control achieves a better performance than just using a single mode throughout
the transmission.
| cs.NI cs.MM | in this paper we investigate the problem of power control for streaming variablebitrate vbr videos in a devicetodevice d2d wireless network a vbr video traffic model that considers video frame sizes and playout buffers at the mobile users is adopted a setup with one pair of d2d users dus and one cellular user cu is considered and three modes namely cellular mode dedicated mode and reuse mode are employed mode selection for the data delivery is determined and the transmit powers of the base station bs and device transmitter are optimized with the goal of maximizing the overall transmission rate while vbr video data can be delivered to the cu and du without causing playout buffer underflows or overflows a lowcomplexity algorithm is proposed through simulations with vbr video traces over fading channels we demonstrate that video delivery with mode selection and power control achieves a better performance than just using a single mode throughout the transmission | [['in', 'this', 'paper', 'we', 'investigate', 'the', 'problem', 'of', 'power', 'control', 'for', 'streaming', 'variablebitrate', 'vbr', 'videos', 'in', 'a', 'devicetodevice', 'd2d', 'wireless', 'network', 'a', 'vbr', 'video', 'traffic', 'model', 'that', 'considers', 'video', 'frame', 'sizes', 'and', 'playout', 'buffers', 'at', 'the', 'mobile', 'users', 'is', 'adopted', 'a', 'setup', 'with', 'one', 'pair', 'of', 'd2d', 'users', 'dus', 'and', 'one', 'cellular', 'user', 'cu', 'is', 'considered', 'and', 'three', 'modes', 'namely', 'cellular', 'mode', 'dedicated', 'mode', 'and', 'reuse', 'mode', 'are', 'employed', 'mode', 'selection', 'for', 'the', 'data', 'delivery', 'is', 'determined', 'and', 'the', 'transmit', 'powers', 'of', 'the', 'base', 'station', 'bs', 'and', 'device', 'transmitter', 'are', 'optimized', 'with', 'the', 'goal', 'of', 'maximizing', 'the', 'overall', 'transmission', 'rate', 'while', 'vbr', 'video', 'data', 'can', 'be', 'delivered', 'to', 'the', 'cu', 'and', 'du', 'without', 'causing', 'playout', 'buffer', 'underflows', 'or', 'overflows', 'a', 'lowcomplexity', 'algorithm', 'is', 'proposed', 'through', 'simulations', 'with', 'vbr', 'video', 'traces', 'over', 'fading', 'channels', 'we', 'demonstrate', 'that', 'video', 'delivery', 'with', 'mode', 'selection', 'and', 'power', 'control', 'achieves', 'a', 'better', 'performance', 'than', 'just', 'using', 'a', 'single', 'mode', 'throughout', 'the', 'transmission']] | [-0.26010033237795305, 0.017141356069155653, -0.011379755527347588, -0.03761405294099645, -0.0771574585751933, -0.27549587662337693, 0.13951273390112717, 0.42805494236756875, -0.2724860902092639, -0.2627541172039357, 0.08061207593477977, -0.28598108109395215, -0.12867211276564486, 0.138263825972262, -0.1516989028781273, 0.049549592047882306, 0.08017378259201054, 0.0691524486896837, 0.044993972622308955, -0.27057630401164007, 0.2494477141577347, 0.12976931969214017, 0.4015998190363786, 0.000616221976389361, 0.0870243889968516, 0.03305286829579313, -0.05949926124233159, -0.06317877461080837, -0.07909191628982191, 0.07921281117266697, 0.34268857112634854, 0.21497246536728778, 0.30293977471768474, -0.43423930171411484, -0.2615028380884961, 0.04692274394629013, 0.1724951155305763, 0.031857533543518966, -0.07591698244866577, -0.24276588028771387, 0.18526690264950227, -0.25419160275857977, 0.02032761849985001, 0.04640143158234608, -0.0822075694474276, 0.05757636845498909, -0.3907979457953553, -0.018913706094263846, -0.05236414545304646, 0.036317265328541876, -0.06482452467368667, -0.03182858313510942, -0.014276519230905043, 0.17890812440813894, 0.04702348191703367, -0.016245254351027832, 0.16102533971677255, -0.08881154592196415, -0.10803667650767111, 0.4328527618184757, -0.029066828738436086, -0.20264790869880747, 0.14339180477556718, -0.0541644083798691, -0.027970447792274176, 0.17938644998961953, 0.2478018074836226, 0.06558748857551225, -0.1780728986872372, -0.03307832416835105, -0.009654283956594907, 0.2079941609112107, 0.14635187924904808, 0.10737272281908566, 0.15449104482563106, 0.25490940468397677, 0.11086819357695474, 0.10120175479226123, -0.15182818046468458, -0.05839644221494057, -0.1780959491434086, -0.1334403496914822, -0.1984739530817487, -0.04402786700921074, -0.08567629105805948, -0.02164563052593523, 0.3832472739978486, 0.07556024311810353, 0.12750826020292036, 0.1214692858907922, 0.42602222868401535, 0.07481849869819963, 0.09179950539604019, 0.14699996899587997, 0.12163670523569305, 0.0026340996440122597, 0.21911229921473713, -0.23836859230064805, 0.053418554739350345, 0.006650871551257505] |
1,802.05349 | Generating dense packings of hard spheres by soft interaction design | Packing spheres efficiently in large dimension $d$ is a particularly
difficult optimization problem. In this paper we add an isotropic interaction
potential to the pure hard-core repulsion, and show that one can tune it in
order to maximize a lower bound on packing density. Our results suggest that
exponentially many (in the number of particles) distinct disordered sphere
packings can be effectively constructed by this method, up to a packing
fraction close to $7\, d\, 2^{-d}$. The latter is determined by solving the
inverse problem of maximizing the dynamical glass transition over the space of
the interaction potentials. Our method crucially exploits a recent exact
formulation of the thermodynamics and the dynamics of simple liquids in
infinite dimension.
| cond-mat.dis-nn cond-mat.soft cond-mat.stat-mech | packing spheres efficiently in large dimension d is a particularly difficult optimization problem in this paper we add an isotropic interaction potential to the pure hardcore repulsion and show that one can tune it in order to maximize a lower bound on packing density our results suggest that exponentially many in the number of particles distinct disordered sphere packings can be effectively constructed by this method up to a packing fraction close to 7 d 2d the latter is determined by solving the inverse problem of maximizing the dynamical glass transition over the space of the interaction potentials our method crucially exploits a recent exact formulation of the thermodynamics and the dynamics of simple liquids in infinite dimension | [['packing', 'spheres', 'efficiently', 'in', 'large', 'dimension', 'd', 'is', 'a', 'particularly', 'difficult', 'optimization', 'problem', 'in', 'this', 'paper', 'we', 'add', 'an', 'isotropic', 'interaction', 'potential', 'to', 'the', 'pure', 'hardcore', 'repulsion', 'and', 'show', 'that', 'one', 'can', 'tune', 'it', 'in', 'order', 'to', 'maximize', 'a', 'lower', 'bound', 'on', 'packing', 'density', 'our', 'results', 'suggest', 'that', 'exponentially', 'many', 'in', 'the', 'number', 'of', 'particles', 'distinct', 'disordered', 'sphere', 'packings', 'can', 'be', 'effectively', 'constructed', 'by', 'this', 'method', 'up', 'to', 'a', 'packing', 'fraction', 'close', 'to', '7', 'd', '2d', 'the', 'latter', 'is', 'determined', 'by', 'solving', 'the', 'inverse', 'problem', 'of', 'maximizing', 'the', 'dynamical', 'glass', 'transition', 'over', 'the', 'space', 'of', 'the', 'interaction', 'potentials', 'our', 'method', 'crucially', 'exploits', 'a', 'recent', 'exact', 'formulation', 'of', 'the', 'thermodynamics', 'and', 'the', 'dynamics', 'of', 'simple', 'liquids', 'in', 'infinite', 'dimension']] | [-0.11591394045942668, 0.18173287851625947, -0.0863343010285585, 0.0458316893032673, -0.028919081969218233, -0.13436828070355705, 0.04397030810182283, 0.33251544027352486, -0.2903714589695683, -0.3153701018131638, 0.06364967128147482, -0.29634964213927545, -0.1822514928940494, 0.12569265334346033, -0.011593922633298878, 0.07399146377219487, 0.02277751627646513, 0.020203979176832206, -0.056384450456095955, -0.29020750497751946, 0.2801013520674117, 0.013642486887273647, 0.2557967867291832, 0.10706050278839924, 0.07525157053181428, 0.042301270716144874, 0.050559142778106664, 0.08664437618192435, -0.16754814323841424, 0.1358496306239138, 0.23197041406252786, 0.05131568603407023, 0.2541414693124213, -0.38343862915348453, -0.21769910181825192, 0.1329177527873919, 0.16102681108513625, 0.11431832756784002, -0.021541671887616295, -0.23640828481007178, 0.05757926854105682, -0.1563400446488601, -0.14648061778427937, -0.07491536939642944, 0.04090199696878761, 0.002654827018347332, -0.2500527507814942, 0.0694528990040407, 0.06822803336609021, -0.02260298517303762, -0.08859029067364538, -0.0848187910692798, 0.024552638950299913, 0.0818410120545334, 0.015179657957406115, 0.062107880497193436, 0.12746386464795698, -0.12625236866080156, -0.09250185797799979, 0.39519065607465426, -0.034729150988129995, -0.2419060430441632, 0.24024148015068622, -0.13776225588379143, -0.11615400479601348, 0.20688470961305044, 0.20253261202409611, 0.1283515028821273, -0.11739695754091618, 0.10209030054916107, -0.07620983853269274, 0.18544688248233396, 0.04509153694577389, -0.03738173164458851, 0.18151664670548892, 0.17265025426838862, 0.12243400986841091, 0.20349598732891383, -0.028610565129399173, -0.12540292777357845, -0.22935411731823016, -0.14876681540143613, -0.28346304868355837, 0.04351765802130103, -0.14157922859515765, -0.15660956992483618, 0.3314888876669456, 0.13537408460042108, 0.22907206001770447, 0.06472404016244968, 0.27936766598515717, 0.0938310400569038, 0.042918942375424304, 0.06870808579438066, 0.24805025456836288, 0.12184104713230488, 0.04642831764412823, -0.22860354028880928, 0.008747931768115356, 0.1101602045128564] |
1,802.0535 | Two-Time Correlations for Probing the Aging Dynamics of Jammed Colloids | We present results for the aging dynamics of a jammed 2D colloidal system
obtained with molecular dynamics simulations. We performed extensive
simulations to gather detailed statistics about rare rearrangement events. With
a simple criterion for identifying irreversible events based on Voronoi
tessellations, we find that the rate of those events decelerates
hyperbolically. We track the probability density function for particle
displacements, the van-Hove function, with sufficient statistics as to reveal
its two-time dependence that is indicative of aging. Those displacements,
measured from a waiting time $t_{w}$ after the quench up to times
$t=t_{w}+\Delta t$, exhibit a data collapse as a function of $\Delta t/t_{w}$.
These findings can be explained comprehensively as manifestations of "record
dynamics", i.e., a relaxation dynamic driven by record-breaking fluctuations.
We show that an on-lattice model of a colloid that was built on record dynamics
indeed reproduces the experimental results in great detail.
| cond-mat.soft | we present results for the aging dynamics of a jammed 2d colloidal system obtained with molecular dynamics simulations we performed extensive simulations to gather detailed statistics about rare rearrangement events with a simple criterion for identifying irreversible events based on voronoi tessellations we find that the rate of those events decelerates hyperbolically we track the probability density function for particle displacements the vanhove function with sufficient statistics as to reveal its twotime dependence that is indicative of aging those displacements measured from a waiting time t_w after the quench up to times tt_wdelta t exhibit a data collapse as a function of delta tt_w these findings can be explained comprehensively as manifestations of record dynamics ie a relaxation dynamic driven by recordbreaking fluctuations we show that an onlattice model of a colloid that was built on record dynamics indeed reproduces the experimental results in great detail | [['we', 'present', 'results', 'for', 'the', 'aging', 'dynamics', 'of', 'a', 'jammed', '2d', 'colloidal', 'system', 'obtained', 'with', 'molecular', 'dynamics', 'simulations', 'we', 'performed', 'extensive', 'simulations', 'to', 'gather', 'detailed', 'statistics', 'about', 'rare', 'rearrangement', 'events', 'with', 'a', 'simple', 'criterion', 'for', 'identifying', 'irreversible', 'events', 'based', 'on', 'voronoi', 'tessellations', 'we', 'find', 'that', 'the', 'rate', 'of', 'those', 'events', 'decelerates', 'hyperbolically', 'we', 'track', 'the', 'probability', 'density', 'function', 'for', 'particle', 'displacements', 'the', 'vanhove', 'function', 'with', 'sufficient', 'statistics', 'as', 'to', 'reveal', 'its', 'twotime', 'dependence', 'that', 'is', 'indicative', 'of', 'aging', 'those', 'displacements', 'measured', 'from', 'a', 'waiting', 'time', 't_w', 'after', 'the', 'quench', 'up', 'to', 'times', 'tt_wdelta', 't', 'exhibit', 'a', 'data', 'collapse', 'as', 'a', 'function', 'of', 'delta', 'tt_w', 'these', 'findings', 'can', 'be', 'explained', 'comprehensively', 'as', 'manifestations', 'of', 'record', 'dynamics', 'ie', 'a', 'relaxation', 'dynamic', 'driven', 'by', 'recordbreaking', 'fluctuations', 'we', 'show', 'that', 'an', 'onlattice', 'model', 'of', 'a', 'colloid', 'that', 'was', 'built', 'on', 'record', 'dynamics', 'indeed', 'reproduces', 'the', 'experimental', 'results', 'in', 'great', 'detail']] | [-0.10679456636566541, 0.1630005466728672, -0.14540387635793664, 0.09059875711943184, 0.02076429310736471, -0.08391342095645338, 0.0463962471064437, 0.37919179899939176, -0.24444932984027626, -0.29415915866607223, 0.05120167131535709, -0.3014314496311648, -0.173906558710311, 0.19727238754757906, 0.0009463792160988368, 0.04768685789995602, 0.07016893565526296, 0.008093830015799351, -0.07278309457630304, -0.2112566331732147, 0.2139344929155476, 0.0852328555786918, 0.258389063155407, 0.027623698722314217, 0.11499620163888502, 0.001000191883087672, -0.005295552907447363, 0.06904651872845816, -0.2020267974338414, 0.003368651314542211, 0.1959168252631508, 0.09090567392714578, 0.23566223976587683, -0.45766217106118284, -0.2291397737403368, 0.08102436359522158, 0.11959957830158287, 0.09752182159893985, -0.077783164730424, -0.28606192228095284, 0.05173067744692852, -0.12909312512532906, -0.1531551879340911, -0.0966152335484994, 0.04395028991175109, 0.0859027887698552, -0.26727511511296675, 0.1616463944123223, 0.024227456491568992, 0.07827264246819862, -0.05888725917160126, -0.05257674694655399, -0.022972022584671604, 0.11180511979739471, 0.047662601299214596, 0.02320284201073107, 0.22916434306715583, -0.10873774948433555, -0.13796696209123938, 0.36603330687202257, -0.06756743913564574, -0.1444494337036178, 0.19934442383076612, -0.20178262851811174, -0.12836711158421982, 0.18615466970308073, 0.15959652920478376, 0.10025956176205314, -0.16821959430416084, -0.02640263287607452, -0.02593882065346657, 0.1738341094219479, 0.015254350835136299, 0.006004581568313056, 0.21397358999940855, 0.22224864080339543, -0.008463619585181105, 0.1606257879400048, -0.09480702817311575, -0.13951977713290473, -0.29060423370643423, -0.1175359207301818, -0.20588484708348226, 0.08304171733526064, -0.07238280093698794, -0.16034837100044663, 0.37194482149748964, 0.15108144238514923, 0.2321401936869169, 0.08462694395526216, 0.20873545606556382, 0.08826478278978953, 0.04160182665037954, 0.04178134063258767, 0.16882125759529398, 0.08637895808908447, 0.11243675085234231, -0.2432970852960415, 0.10380776435907545, 0.03890634252818237] |
1,802.05351 | Stealing Hyperparameters in Machine Learning | Hyperparameters are critical in machine learning, as different
hyperparameters often result in models with significantly different
performance. Hyperparameters may be deemed confidential because of their
commercial value and the confidentiality of the proprietary algorithms that the
learner uses to learn them. In this work, we propose attacks on stealing the
hyperparameters that are learned by a learner. We call our attacks
hyperparameter stealing attacks. Our attacks are applicable to a variety of
popular machine learning algorithms such as ridge regression, logistic
regression, support vector machine, and neural network. We evaluate the
effectiveness of our attacks both theoretically and empirically. For instance,
we evaluate our attacks on Amazon Machine Learning. Our results demonstrate
that our attacks can accurately steal hyperparameters. We also study
countermeasures. Our results highlight the need for new defenses against our
hyperparameter stealing attacks for certain machine learning algorithms.
| cs.CR cs.LG stat.ML | hyperparameters are critical in machine learning as different hyperparameters often result in models with significantly different performance hyperparameters may be deemed confidential because of their commercial value and the confidentiality of the proprietary algorithms that the learner uses to learn them in this work we propose attacks on stealing the hyperparameters that are learned by a learner we call our attacks hyperparameter stealing attacks our attacks are applicable to a variety of popular machine learning algorithms such as ridge regression logistic regression support vector machine and neural network we evaluate the effectiveness of our attacks both theoretically and empirically for instance we evaluate our attacks on amazon machine learning our results demonstrate that our attacks can accurately steal hyperparameters we also study countermeasures our results highlight the need for new defenses against our hyperparameter stealing attacks for certain machine learning algorithms | [['hyperparameters', 'are', 'critical', 'in', 'machine', 'learning', 'as', 'different', 'hyperparameters', 'often', 'result', 'in', 'models', 'with', 'significantly', 'different', 'performance', 'hyperparameters', 'may', 'be', 'deemed', 'confidential', 'because', 'of', 'their', 'commercial', 'value', 'and', 'the', 'confidentiality', 'of', 'the', 'proprietary', 'algorithms', 'that', 'the', 'learner', 'uses', 'to', 'learn', 'them', 'in', 'this', 'work', 'we', 'propose', 'attacks', 'on', 'stealing', 'the', 'hyperparameters', 'that', 'are', 'learned', 'by', 'a', 'learner', 'we', 'call', 'our', 'attacks', 'hyperparameter', 'stealing', 'attacks', 'our', 'attacks', 'are', 'applicable', 'to', 'a', 'variety', 'of', 'popular', 'machine', 'learning', 'algorithms', 'such', 'as', 'ridge', 'regression', 'logistic', 'regression', 'support', 'vector', 'machine', 'and', 'neural', 'network', 'we', 'evaluate', 'the', 'effectiveness', 'of', 'our', 'attacks', 'both', 'theoretically', 'and', 'empirically', 'for', 'instance', 'we', 'evaluate', 'our', 'attacks', 'on', 'amazon', 'machine', 'learning', 'our', 'results', 'demonstrate', 'that', 'our', 'attacks', 'can', 'accurately', 'steal', 'hyperparameters', 'we', 'also', 'study', 'countermeasures', 'our', 'results', 'highlight', 'the', 'need', 'for', 'new', 'defenses', 'against', 'our', 'hyperparameter', 'stealing', 'attacks', 'for', 'certain', 'machine', 'learning', 'algorithms']] | [-0.04546816923972616, -0.046857510979042935, -0.07678568391591734, 0.11523760465082732, -0.16989294970606236, -0.2717148986503033, 0.11083422415618989, 0.46179932199999796, -0.26217139719371146, -0.2939391073288647, 0.09987292816310936, -0.28156804092928556, -0.24139343068690589, 0.2527675997360167, -0.18148641752290492, 0.1692737873762529, 0.10420238340920801, -0.0016433636902283269, -0.019459616791635277, -0.41895564859534834, 0.3559235597214272, 0.029641905105970007, 0.357766690168609, 0.022250982756059325, 0.06166445387936864, -0.024187792066141224, 0.036017151902832674, -0.05083384686430375, -0.06255753871282779, 0.1202842490483366, 0.3888857042071864, 0.29915915689173533, 0.4198494726752347, -0.3690766915414773, -0.2186873382756632, 0.1166272753922282, 0.13012456870802963, 0.12957190611921515, -0.02856250232950857, -0.3731673881609706, 0.11740714547237553, -0.22961543435197826, 0.023815639696830343, -0.25918601065583474, -0.0846375343307245, 0.05704355546180819, -0.29084777262669503, -0.056925196423738576, 0.060697791326777835, 0.07944157028055572, -0.007881451090995936, -0.15047243606061378, 0.04946931181739725, 0.11816626345963342, 0.11742373961948704, -0.009420968664823271, 0.25992663092052576, -0.1747830947141736, -0.23900160029636208, 0.3018704998465453, -0.03538006858517092, -0.21052408259996075, 0.2021879071843685, 0.10400829008278431, -0.18414282156418718, 0.02371162795032381, 0.3291664155611293, 0.10343436900103557, -0.12804616347668654, -0.010758271280276517, -0.03819027615724303, 0.17829809026422758, 0.00250851289957022, -0.04992972460000756, 0.1073345308677551, 0.22337980156579446, 0.04016120241730348, 0.13725673541647931, -0.12255132462724495, -0.068521363201637, -0.2094262798534746, -0.08922040390993423, -0.1960520916255125, -0.028941600946775566, -0.13781847697090283, -0.15190741211864917, 0.3837891326926596, 0.3312657452890227, 0.19293916096633418, 0.14391296562170675, 0.41918878777263063, -0.02793230584175293, 0.11165194441762535, 0.20317805141412013, 0.22289120659384057, -0.028601243845946717, 0.10854048346308001, -0.15950158456049807, 0.21370625813286884, -0.04604191787818328] |
1,802.05352 | Gibbs Partitions, Riemann-Liouville Fractional Operators, Mittag-Leffler
Functions, and Fragmentations Derived From Stable Subordinators | Pitman(2003)(and subsequently Gnedin and Pitman (2006) showed that a large
class of random partitions of the integers derived from a stable subordinator
of index $\alpha\in(0,1)$ have infinite Gibbs (product) structure as a
characterizing feature. The most notable case are random partitions derived
from the two-parameter Poisson-Dirichlet distribution,
$\mathrm{PD}(\alpha,\theta)$, which are induced by mixing over variables with
generalized Mittag-Leffler distributions, denoted by
$\mathrm{ML}(\alpha,\theta).$ Our aim in this work is to provide indications on
the utility of the wider class of Gibbs partitions as it relates to a study of
Riemann-Liouville fractional integrals and size-biased sampling, decompositions
of special functions, and its potential use in the understanding of various
constructions of more exotic processes. We provide novel characterizations of
general laws associated with two nested families of
$\mathrm{PD}(\alpha,\theta)$ mass partitions that are constructed from notable
fragmentation operations described in Dong, Goldschmidt and Martin(2006) and
Pitman(1999), respectively. These operations are known to be related in
distribution to various constructions of discrete random trees/graphs in $[n],$
and their scaling limits, such as stable trees. A centerpiece of our work are
results related to Mittag-Leffler functions, which play a key role in
fractional calculus and are otherwise Laplace transforms of the
$\mathrm{ML}(\alpha,\theta)$ variables. Notably, this leads to an
interpretation of $\mathrm{PD}(\alpha,\theta)$ laws within a mixed Poisson
waiting time framework based on $\mathrm{ML}(\alpha,\theta)$ variables, which
suggests connections to recent construction of P\'olya urn models with random
immigration by Pek\"oz, R\"ollin and Ross(2018). Simplifications in the
Brownian case are highlighted.
| math.PR | pitman2003and subsequently gnedin and pitman 2006 showed that a large class of random partitions of the integers derived from a stable subordinator of index alphain01 have infinite gibbs product structure as a characterizing feature the most notable case are random partitions derived from the twoparameter poissondirichlet distribution mathrmpdalphatheta which are induced by mixing over variables with generalized mittagleffler distributions denoted by mathrmmlalphatheta our aim in this work is to provide indications on the utility of the wider class of gibbs partitions as it relates to a study of riemannliouville fractional integrals and sizebiased sampling decompositions of special functions and its potential use in the understanding of various constructions of more exotic processes we provide novel characterizations of general laws associated with two nested families of mathrmpdalphatheta mass partitions that are constructed from notable fragmentation operations described in dong goldschmidt and martin2006 and pitman1999 respectively these operations are known to be related in distribution to various constructions of discrete random treesgraphs in n and their scaling limits such as stable trees a centerpiece of our work are results related to mittagleffler functions which play a key role in fractional calculus and are otherwise laplace transforms of the mathrmmlalphatheta variables notably this leads to an interpretation of mathrmpdalphatheta laws within a mixed poisson waiting time framework based on mathrmmlalphatheta variables which suggests connections to recent construction of polya urn models with random immigration by pekoz rollin and ross2018 simplifications in the brownian case are highlighted | [['pitman2003and', 'subsequently', 'gnedin', 'and', 'pitman', '2006', 'showed', 'that', 'a', 'large', 'class', 'of', 'random', 'partitions', 'of', 'the', 'integers', 'derived', 'from', 'a', 'stable', 'subordinator', 'of', 'index', 'alphain01', 'have', 'infinite', 'gibbs', 'product', 'structure', 'as', 'a', 'characterizing', 'feature', 'the', 'most', 'notable', 'case', 'are', 'random', 'partitions', 'derived', 'from', 'the', 'twoparameter', 'poissondirichlet', 'distribution', 'mathrmpdalphatheta', 'which', 'are', 'induced', 'by', 'mixing', 'over', 'variables', 'with', 'generalized', 'mittagleffler', 'distributions', 'denoted', 'by', 'mathrmmlalphatheta', 'our', 'aim', 'in', 'this', 'work', 'is', 'to', 'provide', 'indications', 'on', 'the', 'utility', 'of', 'the', 'wider', 'class', 'of', 'gibbs', 'partitions', 'as', 'it', 'relates', 'to', 'a', 'study', 'of', 'riemannliouville', 'fractional', 'integrals', 'and', 'sizebiased', 'sampling', 'decompositions', 'of', 'special', 'functions', 'and', 'its', 'potential', 'use', 'in', 'the', 'understanding', 'of', 'various', 'constructions', 'of', 'more', 'exotic', 'processes', 'we', 'provide', 'novel', 'characterizations', 'of', 'general', 'laws', 'associated', 'with', 'two', 'nested', 'families', 'of', 'mathrmpdalphatheta', 'mass', 'partitions', 'that', 'are', 'constructed', 'from', 'notable', 'fragmentation', 'operations', 'described', 'in', 'dong', 'goldschmidt', 'and', 'martin2006', 'and', 'pitman1999', 'respectively', 'these', 'operations', 'are', 'known', 'to', 'be', 'related', 'in', 'distribution', 'to', 'various', 'constructions', 'of', 'discrete', 'random', 'treesgraphs', 'in', 'n', 'and', 'their', 'scaling', 'limits', 'such', 'as', 'stable', 'trees', 'a', 'centerpiece', 'of', 'our', 'work', 'are', 'results', 'related', 'to', 'mittagleffler', 'functions', 'which', 'play', 'a', 'key', 'role', 'in', 'fractional', 'calculus', 'and', 'are', 'otherwise', 'laplace', 'transforms', 'of', 'the', 'mathrmmlalphatheta', 'variables', 'notably', 'this', 'leads', 'to', 'an', 'interpretation', 'of', 'mathrmpdalphatheta', 'laws', 'within', 'a', 'mixed', 'poisson', 'waiting', 'time', 'framework', 'based', 'on', 'mathrmmlalphatheta', 'variables', 'which', 'suggests', 'connections', 'to', 'recent', 'construction', 'of', 'polya', 'urn', 'models', 'with', 'random', 'immigration', 'by', 'pekoz', 'rollin', 'and', 'ross2018', 'simplifications', 'in', 'the', 'brownian', 'case', 'are', 'highlighted']] | [-0.07548117870220351, 0.1503203879399719, -0.11164619364313969, 0.09150002746473011, -0.058521674885297144, -0.11389069479475376, 0.05326507501392195, 0.34693932307868447, -0.27352059606810986, -0.27647645407974597, 0.09079433984989926, -0.2395272382795263, -0.16990726258891375, 0.1942924041527973, -0.11762097347116865, 0.07158927058927253, 0.009593023336003339, -0.007972633970672452, -0.043164714789331086, -0.23798581283879974, 0.3320651315602654, 0.02961655322045573, 0.24298643095403158, -0.024110869551499367, 0.07343249687995418, 0.005395176458493376, -0.10826660554754321, -0.016660829166639128, -0.15093562556969975, 0.11780291678728301, 0.22526488675459344, 0.09684718055885379, 0.26040202164298565, -0.3624429132988943, -0.19156635752495108, 0.12967251375084743, 0.1209821157331555, 0.019632068997299877, -0.027240255241345383, -0.28113106636921364, 0.05256834582175214, -0.18400961671321958, -0.1319432425641767, -0.09299776270915167, 0.04868372575528607, 0.10853042049595632, -0.2854719818053677, 0.07030249471744883, 0.11744907243419908, 0.01921888568317283, -0.03131982110667692, -0.1855884186445125, -0.019038082839052405, 0.07214804874105035, 0.046453898969720735, -0.02092437953942557, 0.07506061030332656, -0.0892260230455485, -0.179632309456395, 0.3398846925163892, -0.01520554008140393, -0.2296735558877973, 0.16654858396666422, -0.14005424621702806, -0.20577677244226597, 0.09694412084660266, 0.14539202113690622, 0.12756857983063624, -0.1541954104266689, 0.0946001623260523, -0.06365674150693856, 0.05436147684918642, 0.1206864319661507, 0.04488415032270083, 0.15525369891043783, 0.12023431435227394, 0.05666270175901782, 0.17748486402272365, -0.019070071865512964, -0.19713572652603523, -0.30480154370008616, -0.15060112529207792, -0.18487632427826337, 0.06460453051608545, -0.13821133447002948, -0.20505884493223758, 0.3607793472533138, 0.11252850203133118, 0.21473499336436452, 0.10069293698380083, 0.18162142251375593, 0.1363572783551977, 0.032957795793151466, 0.041436954577523874, 0.09423367051650308, 0.20556829781824246, 0.051137689148377186, -0.1198409611416468, 0.0819183979195664, 0.10679361015409544] |
1,802.05353 | Predicting optimal hematocrit in silico | Optimal hematocrit $H_o$ maximizes oxygen transport. In healthy humans, the
average hematocrit $H$ is in the range of 40-45$\%$, but it can significantly
change in blood pathologies such as severe anemia (low $H$) and polycythemia
(high $H$). Whether the hematocrit level in humans corresponds to the optimal
one is a long standing physiological question. Here, using numerical
simulations with the Lattice Boltzmann method and two mechanical models of the
red blood cell (RBC) we predict the optimal hematocrit, and explore how
altering the mechanical properties of RBCs affects $H_o$. We develop a
simplified analytical theory that accounts for results obtained from numerical
simulations and provides insight into the physical mechanisms determining
$H_o$. Our numerical and analytical models can easily be modified to
incorporate a wide range of mechanical properties of RBCs as well as other soft
particles thereby providing means for the rational design of blood substitutes.
Our work lays the foundations for systematic theoretical study of the optimal
hematocrit and its link with pathological RBCs associated with various diseases
(e.g. sickle cell anemia, diabetes mellitus, malaria, elliptocytosis).
| cond-mat.soft physics.bio-ph physics.flu-dyn | optimal hematocrit h_o maximizes oxygen transport in healthy humans the average hematocrit h is in the range of 4045 but it can significantly change in blood pathologies such as severe anemia low h and polycythemia high h whether the hematocrit level in humans corresponds to the optimal one is a long standing physiological question here using numerical simulations with the lattice boltzmann method and two mechanical models of the red blood cell rbc we predict the optimal hematocrit and explore how altering the mechanical properties of rbcs affects h_o we develop a simplified analytical theory that accounts for results obtained from numerical simulations and provides insight into the physical mechanisms determining h_o our numerical and analytical models can easily be modified to incorporate a wide range of mechanical properties of rbcs as well as other soft particles thereby providing means for the rational design of blood substitutes our work lays the foundations for systematic theoretical study of the optimal hematocrit and its link with pathological rbcs associated with various diseases eg sickle cell anemia diabetes mellitus malaria elliptocytosis | [['optimal', 'hematocrit', 'h_o', 'maximizes', 'oxygen', 'transport', 'in', 'healthy', 'humans', 'the', 'average', 'hematocrit', 'h', 'is', 'in', 'the', 'range', 'of', '4045', 'but', 'it', 'can', 'significantly', 'change', 'in', 'blood', 'pathologies', 'such', 'as', 'severe', 'anemia', 'low', 'h', 'and', 'polycythemia', 'high', 'h', 'whether', 'the', 'hematocrit', 'level', 'in', 'humans', 'corresponds', 'to', 'the', 'optimal', 'one', 'is', 'a', 'long', 'standing', 'physiological', 'question', 'here', 'using', 'numerical', 'simulations', 'with', 'the', 'lattice', 'boltzmann', 'method', 'and', 'two', 'mechanical', 'models', 'of', 'the', 'red', 'blood', 'cell', 'rbc', 'we', 'predict', 'the', 'optimal', 'hematocrit', 'and', 'explore', 'how', 'altering', 'the', 'mechanical', 'properties', 'of', 'rbcs', 'affects', 'h_o', 'we', 'develop', 'a', 'simplified', 'analytical', 'theory', 'that', 'accounts', 'for', 'results', 'obtained', 'from', 'numerical', 'simulations', 'and', 'provides', 'insight', 'into', 'the', 'physical', 'mechanisms', 'determining', 'h_o', 'our', 'numerical', 'and', 'analytical', 'models', 'can', 'easily', 'be', 'modified', 'to', 'incorporate', 'a', 'wide', 'range', 'of', 'mechanical', 'properties', 'of', 'rbcs', 'as', 'well', 'as', 'other', 'soft', 'particles', 'thereby', 'providing', 'means', 'for', 'the', 'rational', 'design', 'of', 'blood', 'substitutes', 'our', 'work', 'lays', 'the', 'foundations', 'for', 'systematic', 'theoretical', 'study', 'of', 'the', 'optimal', 'hematocrit', 'and', 'its', 'link', 'with', 'pathological', 'rbcs', 'associated', 'with', 'various', 'diseases', 'eg', 'sickle', 'cell', 'anemia', 'diabetes', 'mellitus', 'malaria', 'elliptocytosis']] | [-0.052607621473725885, 0.1345616954034664, -0.06074482980925082, 0.05371731668393212, -0.06675744856395548, -0.13846799478315833, 0.09258468460955721, 0.36086854930247436, -0.23600815439501524, -0.3021892808160787, 0.09146578758637505, -0.26149340748617594, -0.2036649394060739, 0.20607579065836035, -0.11271231509850953, 0.05257888534602402, 0.06676471187543856, 0.0036932425626384265, 0.023856158484704792, -0.18664244755001907, 0.21636988877435215, 0.06104723864700645, 0.29277187954523304, 0.08219324398140254, 0.09125150295387191, -0.030575939085048794, -0.015871119455286218, 0.028218173707666046, -0.21927705833269845, 0.09934016258921474, 0.25933002023641, 0.11034211400494148, 0.32887207403440366, -0.43852971764069726, -0.2683146383854116, 0.0829084750413048, 0.17721392337352881, 0.10355674243129959, -0.022371137943330476, -0.2175080236523751, 0.09544710681273666, -0.13448168322528628, -0.13494764613940127, -0.058087892047214235, -0.02088720263616944, 0.038768431871589695, -0.26930613539298065, 0.15001563152195144, -0.01819101422006497, 0.12305154334568545, -0.11765564794437854, -0.14976995068784824, -0.07080980450303866, 0.20756604147953278, 0.04285578008619433, -0.0007328576319361508, 0.23820667949356986, -0.18543858004638672, -0.06812890544163318, 0.39616978804009373, -0.013900753835597161, -0.19784576590940228, 0.2049758332855576, -0.11697730611459436, -0.06840745891730132, 0.11752073673679578, 0.15253591200929473, 0.08232947438293857, -0.14108145014721563, -0.023243837813094036, -0.01726315298318778, 0.14176199102737222, 0.0860150814022001, -0.02095024954376806, 0.17377608530064623, 0.2155815726251934, -0.020198818155966528, 0.13149317443491204, -0.0751146321421071, -0.05789407833204181, -0.2353586261584, -0.1493871955211613, -0.06993573210307989, 0.04824859961676835, -0.12672141502860707, -0.1666761699968695, 0.37438504213721235, 0.13445722684925634, 0.14890552682018923, 0.04213110422080552, 0.25546665978617966, 0.05028214125129373, 0.036038485095063647, 0.0033915261013713793, 0.2232259668529547, 0.10630857713774523, 0.07766077936288308, -0.3103140910230154, 0.09598134213328277, 0.011442217508209234] |
1,802.05354 | Scalar hidden-charm tetraquark states with QCD sum rules | In this article, we study the masses and pole residues of the
pseudoscalar-diquark-pseudoscalar-antidiquark type and
vector-diquark-vector-antidiquark type scalar hidden-charm $cu\bar{c}\bar{d}$
($cu\bar{c}\bar{s}$) tetraquark states with QCD sum rules by taking into
account the contributions of the vacuum condensates up to dimension-10 in the
operator product expansion. The predicted masses can be confronted with the
experimental data in the future. Possible decays of those tetraquark states are
also discussed.
| hep-ph | in this article we study the masses and pole residues of the pseudoscalardiquarkpseudoscalarantidiquark type and vectordiquarkvectorantidiquark type scalar hiddencharm cubarcbard cubarcbars tetraquark states with qcd sum rules by taking into account the contributions of the vacuum condensates up to dimension10 in the operator product expansion the predicted masses can be confronted with the experimental data in the future possible decays of those tetraquark states are also discussed | [['in', 'this', 'article', 'we', 'study', 'the', 'masses', 'and', 'pole', 'residues', 'of', 'the', 'pseudoscalardiquarkpseudoscalarantidiquark', 'type', 'and', 'vectordiquarkvectorantidiquark', 'type', 'scalar', 'hiddencharm', 'cubarcbard', 'cubarcbars', 'tetraquark', 'states', 'with', 'qcd', 'sum', 'rules', 'by', 'taking', 'into', 'account', 'the', 'contributions', 'of', 'the', 'vacuum', 'condensates', 'up', 'to', 'dimension10', 'in', 'the', 'operator', 'product', 'expansion', 'the', 'predicted', 'masses', 'can', 'be', 'confronted', 'with', 'the', 'experimental', 'data', 'in', 'the', 'future', 'possible', 'decays', 'of', 'those', 'tetraquark', 'states', 'are', 'also', 'discussed']] | [-0.09827801126700181, 0.23059015221034104, -0.05868509619926604, 0.1326617387535337, -0.04973935894668102, -0.07783175563583007, 0.07826001197278787, 0.30696332950431565, -0.17994374747997008, -0.20487231011144244, 0.05279552526234721, -0.31398006601688955, -0.03820927891020592, 0.07993296422064304, 0.07723490868050319, 0.06834230937350255, 0.07714950890781788, 0.029783381070368566, -0.048349733056966215, -0.24448307348558537, 0.40402592033720935, -0.03562790072308137, 0.18016425268724562, 0.15383472952705163, -0.03252989555028482, -0.06058910573975971, -0.006728905883546059, -0.04185851584546841, -0.1159869567988118, 0.09515777566792587, 0.2078638456117075, 0.09905758083869631, 0.1364643294364214, -0.3921502948810275, -0.1046889720341334, 0.13135180032024016, 0.19006512695923447, 0.11985949301519074, 0.013252764825637524, -0.38134584779349656, 0.09109167566505046, -0.204428444781269, -0.20010266003843682, -0.14070060923695565, -0.03159507802472665, -0.04609034995978268, -0.3089535877824976, 0.09218391567925349, -0.0898927066475153, -0.03651482486524261, -0.11535186113144916, -0.2726585398069941, -0.035101208477639236, 0.06773350879263419, 0.09690397241367743, 0.04166878177784383, 0.09617136545264376, -0.14907990294651915, -0.18572813117912468, 0.4101891216177207, -0.09116436025271049, -0.17966988244308876, 0.08333424103374665, -0.14800872022572617, -0.10963294359210592, 0.0940327644169044, 0.14119772721941654, 0.08266123618545512, -0.1691463559579391, 0.07713348302237977, -0.013828797767368646, 0.08979872147051188, 0.09560945943141212, 0.10163428875116201, 0.27296522901608394, 0.13059407531355435, -0.08833260897260446, 0.11425044706915147, 0.0042391889227124365, -0.11761000958862357, -0.3706319422246172, -0.14278637202313313, -0.10988182827400474, 0.07334575940353366, -0.04839228231844922, -0.09028367361483666, 0.40471020352381926, 0.06530291283359894, 0.23166755008770942, 0.011343674848859127, 0.2613807919291923, 0.1074330074300703, 0.12040058701084211, 0.035542372915034114, 0.3010235377694838, 0.1959849602650278, 0.1097073765614858, -0.2573299933511477, -0.04316491333481211, 0.05613971114373551] |
1,802.05355 | The Role of Information Complexity and Randomization in Representation
Learning | A grand challenge in representation learning is to learn the different
explanatory factors of variation behind the high dimen- sional data. Encoder
models are often determined to optimize performance on training data when the
real objective is to generalize well to unseen data. Although there is enough
numerical evidence suggesting that noise injection (during training) at the
representation level might improve the generalization ability of encoders, an
information-theoretic understanding of this principle remains elusive. This
paper presents a sample-dependent bound on the generalization gap of the
cross-entropy loss that scales with the information complexity (IC) of the
representations, meaning the mutual information between inputs and their
representations. The IC is empirically investigated for standard multi-layer
neural networks with SGD on MNIST and CIFAR-10 datasets; the behaviour of the
gap and the IC appear to be in direct correlation, suggesting that SGD selects
encoders to implicitly minimize the IC. We specialize the IC to study the role
of Dropout on the generalization capacity of deep encoders which is shown to be
directly related to the encoder capacity, being a measure of the
distinguishability among samples from their representations. Our results
support some recent regularization methods.
| stat.ML cs.LG | a grand challenge in representation learning is to learn the different explanatory factors of variation behind the high dimen sional data encoder models are often determined to optimize performance on training data when the real objective is to generalize well to unseen data although there is enough numerical evidence suggesting that noise injection during training at the representation level might improve the generalization ability of encoders an informationtheoretic understanding of this principle remains elusive this paper presents a sampledependent bound on the generalization gap of the crossentropy loss that scales with the information complexity ic of the representations meaning the mutual information between inputs and their representations the ic is empirically investigated for standard multilayer neural networks with sgd on mnist and cifar10 datasets the behaviour of the gap and the ic appear to be in direct correlation suggesting that sgd selects encoders to implicitly minimize the ic we specialize the ic to study the role of dropout on the generalization capacity of deep encoders which is shown to be directly related to the encoder capacity being a measure of the distinguishability among samples from their representations our results support some recent regularization methods | [['a', 'grand', 'challenge', 'in', 'representation', 'learning', 'is', 'to', 'learn', 'the', 'different', 'explanatory', 'factors', 'of', 'variation', 'behind', 'the', 'high', 'dimen', 'sional', 'data', 'encoder', 'models', 'are', 'often', 'determined', 'to', 'optimize', 'performance', 'on', 'training', 'data', 'when', 'the', 'real', 'objective', 'is', 'to', 'generalize', 'well', 'to', 'unseen', 'data', 'although', 'there', 'is', 'enough', 'numerical', 'evidence', 'suggesting', 'that', 'noise', 'injection', 'during', 'training', 'at', 'the', 'representation', 'level', 'might', 'improve', 'the', 'generalization', 'ability', 'of', 'encoders', 'an', 'informationtheoretic', 'understanding', 'of', 'this', 'principle', 'remains', 'elusive', 'this', 'paper', 'presents', 'a', 'sampledependent', 'bound', 'on', 'the', 'generalization', 'gap', 'of', 'the', 'crossentropy', 'loss', 'that', 'scales', 'with', 'the', 'information', 'complexity', 'ic', 'of', 'the', 'representations', 'meaning', 'the', 'mutual', 'information', 'between', 'inputs', 'and', 'their', 'representations', 'the', 'ic', 'is', 'empirically', 'investigated', 'for', 'standard', 'multilayer', 'neural', 'networks', 'with', 'sgd', 'on', 'mnist', 'and', 'cifar10', 'datasets', 'the', 'behaviour', 'of', 'the', 'gap', 'and', 'the', 'ic', 'appear', 'to', 'be', 'in', 'direct', 'correlation', 'suggesting', 'that', 'sgd', 'selects', 'encoders', 'to', 'implicitly', 'minimize', 'the', 'ic', 'we', 'specialize', 'the', 'ic', 'to', 'study', 'the', 'role', 'of', 'dropout', 'on', 'the', 'generalization', 'capacity', 'of', 'deep', 'encoders', 'which', 'is', 'shown', 'to', 'be', 'directly', 'related', 'to', 'the', 'encoder', 'capacity', 'being', 'a', 'measure', 'of', 'the', 'distinguishability', 'among', 'samples', 'from', 'their', 'representations', 'our', 'results', 'support', 'some', 'recent', 'regularization', 'methods']] | [-0.07157623472073854, 0.022882113874168015, -0.08642593525186873, 0.12295248747752864, -0.11487103404822885, -0.1641935975009998, 0.07051835757663436, 0.41537887459985684, -0.3100663886895192, -0.3109367101059593, 0.07640165985998765, -0.28491120555524513, -0.18022204267062708, 0.18314887385469736, -0.1339737008632996, 0.03941731298697594, 0.08799019318071588, 0.05494174734358052, -0.08744209546946258, -0.31598967010366547, 0.3280563054038644, 0.10775999655600843, 0.34698374005566834, 0.023893061636457432, 0.12286879409215, -0.05803845553975744, -0.005536053376212313, -0.0717824400953478, -0.06324218803012027, 0.14769309044085904, 0.28422067361036885, 0.16625003160227128, 0.2833907637545916, -0.3641595554576476, -0.23070216721605472, 0.1178015049729381, 0.13280385233025, 0.07647726890523306, -0.0021759409456845067, -0.284682822120904, 0.09893762470059789, -0.12676542052835918, 0.005059703914946685, -0.09352305095364369, -0.049178733874458015, -0.0024357922417207706, -0.2981925264202519, 0.06525411734179853, 0.09136810003763027, 0.04610314674922397, -0.07320478165608629, -0.13396579624854565, 0.018788959209317554, 0.15579390886060285, 0.07472105146044884, 0.06992118671064183, 0.10434936163658948, -0.18456666345333622, -0.13175503422053694, 0.3131749153811696, -0.02271376307285631, -0.20279604673716264, 0.21517655430553653, -0.08209574633498781, -0.1148565113976521, 0.08867295421947985, 0.21801264405000917, 0.055503718077310735, -0.150770961594202, 0.011031153576134118, -0.03678854335982775, 0.1699991684188567, 0.03291473062420936, 0.06798498457796949, 0.16171530837351553, 0.21982844988575456, 0.023791096532074063, 0.16227497055060855, -0.11594241352430959, -0.09745973294850477, -0.24666336533786326, -0.11001578545871134, -0.2294619572624929, 0.023836770284556084, -0.10192113965844253, -0.11985305130513824, 0.3453676888200733, 0.19688335947750002, 0.24422177894415392, 0.13071053609619224, 0.32858391385525465, 0.05945440637819066, 0.12800384774028814, 0.11896906745111205, 0.22681275408156337, 0.1259346926373612, 0.08236169747914639, -0.20826106724874163, 0.12915552718854106, 0.017975937803131864] |
1,802.05356 | Quit Using Pseudorapidity, Transverse Energy, and Massless Constituents | Use a massive jet's true-rapidity instead of its pseudorapidity, even for
event displays and for determining if a jet is near a calorimeter edge. Use
transverse momentum instead of transverse energy since only the former is
conserved. Use massive constituents because using massless constituents reduces
the jet mass by an amount proportional to the square of the number of hadrons
in the jet, and can amount to several GeV. These three recommendations are
important for precision measurements when jets are constructed by adding
constituent 4-vectors.
| hep-ph | use a massive jets truerapidity instead of its pseudorapidity even for event displays and for determining if a jet is near a calorimeter edge use transverse momentum instead of transverse energy since only the former is conserved use massive constituents because using massless constituents reduces the jet mass by an amount proportional to the square of the number of hadrons in the jet and can amount to several gev these three recommendations are important for precision measurements when jets are constructed by adding constituent 4vectors | [['use', 'a', 'massive', 'jets', 'truerapidity', 'instead', 'of', 'its', 'pseudorapidity', 'even', 'for', 'event', 'displays', 'and', 'for', 'determining', 'if', 'a', 'jet', 'is', 'near', 'a', 'calorimeter', 'edge', 'use', 'transverse', 'momentum', 'instead', 'of', 'transverse', 'energy', 'since', 'only', 'the', 'former', 'is', 'conserved', 'use', 'massive', 'constituents', 'because', 'using', 'massless', 'constituents', 'reduces', 'the', 'jet', 'mass', 'by', 'an', 'amount', 'proportional', 'to', 'the', 'square', 'of', 'the', 'number', 'of', 'hadrons', 'in', 'the', 'jet', 'and', 'can', 'amount', 'to', 'several', 'gev', 'these', 'three', 'recommendations', 'are', 'important', 'for', 'precision', 'measurements', 'when', 'jets', 'are', 'constructed', 'by', 'adding', 'constituent', '4vectors']] | [-0.10689443248944978, 0.24789409790277464, -0.03493120326727096, 0.10669425945074874, -0.09137975892406844, -0.08971425213496245, -0.041899074999881644, 0.3752114868146323, -0.18534446425647252, -0.35145069281792357, 0.049453065025209936, -0.32170388679064454, 0.03595590069224792, 0.16215829959227926, 0.009071652763634034, 0.0323366654165078, 0.11670038657198997, 0.05366646176913664, -0.05362147025603224, -0.17642302517335684, 0.3340061670169234, 0.09399176737116206, 0.21802644556044556, 0.06618977135457542, 0.1356040220264168, 0.06262024716817818, -0.059230018429280745, 0.02539476767803232, -0.05916115589484218, 0.05736961365411324, 0.19287472438632644, 0.060409595840610564, 0.2152164644749497, -0.3733025836713967, -0.14742365162376136, 0.08726668545222353, 0.19403153060314557, 0.046259113873973204, -0.04163977538146788, -0.1795262630940193, 0.11498962253487359, -0.22740636912307569, -0.15309510841256097, -0.06981341112848549, 0.015656651252703296, 0.0005450433430572351, -0.2583882643708161, 0.11918329901527613, -0.0047918288258924375, 0.012990357595429356, 0.005496416117585752, -0.12765278037460076, -0.1034537761172812, 0.07638210070304229, 0.12345682652778037, 0.06798331177006253, 0.17611280300410553, -0.2203739490138278, -0.10917361845661487, 0.38843225355127026, 0.0374883685920698, -0.22888348098578198, 0.174555198450218, -0.17409020746847437, -0.10805468600509423, 0.19623923989101535, 0.2035013140259599, 0.08316300411353864, -0.17670759690978835, 0.026145344787177498, -0.04393862844500247, 0.17348174586714732, 0.07883304772743334, 0.0859747470933057, 0.27701038652144017, 0.13681984508487707, 0.028550896228158047, 0.12091328994193602, -0.1435903703261699, -0.06772729796579197, -0.33443697410014767, -0.1714530845416621, -0.20085637102879228, 0.05934261924232401, -0.0955317925625076, -0.0903334346477918, 0.3908281543602546, 0.06514538130501196, 0.23791448776388452, -0.014208669879562444, 0.3306953743366258, 0.07354193314261336, 0.113206448798467, 0.15137880472909837, 0.29086953676527455, 0.14371318117870638, 0.13686654504965104, -0.1827612780318651, 0.038983361230098774, 0.07965202976594724] |
1,802.05357 | An Efficient MILP Formulation of Economic Dispatch with Adjustable
Transformer Ratio and Phase Shifter | In this short paper, we study the economic dispatch with adjustable
transformer ratio and phase shifter, both of which, along with the transmission
line, are formulated into a generalized branch model. Resulted nonlinear parts
are thereafter exactly linearized using the piecewise liner technique to make
the derived ED problem computationally tractable. Numerical studies based on
modified IEEE systems demonstrate the effectiveness of the proposed method to
efficiency and flexibility of power system operation.
| math.OC | in this short paper we study the economic dispatch with adjustable transformer ratio and phase shifter both of which along with the transmission line are formulated into a generalized branch model resulted nonlinear parts are thereafter exactly linearized using the piecewise liner technique to make the derived ed problem computationally tractable numerical studies based on modified ieee systems demonstrate the effectiveness of the proposed method to efficiency and flexibility of power system operation | [['in', 'this', 'short', 'paper', 'we', 'study', 'the', 'economic', 'dispatch', 'with', 'adjustable', 'transformer', 'ratio', 'and', 'phase', 'shifter', 'both', 'of', 'which', 'along', 'with', 'the', 'transmission', 'line', 'are', 'formulated', 'into', 'a', 'generalized', 'branch', 'model', 'resulted', 'nonlinear', 'parts', 'are', 'thereafter', 'exactly', 'linearized', 'using', 'the', 'piecewise', 'liner', 'technique', 'to', 'make', 'the', 'derived', 'ed', 'problem', 'computationally', 'tractable', 'numerical', 'studies', 'based', 'on', 'modified', 'ieee', 'systems', 'demonstrate', 'the', 'effectiveness', 'of', 'the', 'proposed', 'method', 'to', 'efficiency', 'and', 'flexibility', 'of', 'power', 'system', 'operation']] | [-0.10503918390516957, -0.03227126169375667, -0.03006692324471596, -0.028406738282870245, -0.07265869512745779, -0.18757977186740465, 0.0459224700509915, 0.4018428412151255, -0.25559882909196674, -0.29610624345504255, 0.10849983451651946, -0.21112406182370774, -0.2011761112937589, 0.22364723322313432, -0.06677992308946097, 0.10984972129537635, 0.051718618302950506, -0.04034933973142035, -0.05392668899531438, -0.24685540330302838, 0.26089545372516326, 0.09091316058128204, 0.34907852524049476, 0.033650872272069324, 0.13184163356455017, 0.0006592484758784101, -0.030887288934461875, 0.060764313508016504, -0.10333888722928114, 0.13369327408982415, 0.23465902239326641, 0.13210356243796748, 0.2807309086600395, -0.442950224325265, -0.2299945648402384, 0.06049479243875009, 0.12207709677670509, 0.031246094564167298, -0.00600100796803679, -0.24549118833846018, 0.09205460121651014, -0.2280638843315513, -0.09927804700468909, -0.05212918369176045, -0.04134326308889136, 0.046666850173233514, -0.29567896883475453, 0.046089679981926326, 0.020267009556497614, 0.02687058781516062, -0.0642730195126305, -0.09824846733890934, -0.01791676707336143, 0.04755699154179326, 0.029729496440467462, -0.0580992398828217, 0.10087404927168654, -0.05888404941173551, -0.10931279939880008, 0.3759604481699532, -0.03140900763427864, -0.20675080286160316, 0.1488135620339276, -0.045363200818864656, -0.0967111317632235, 0.1327369742554753, 0.21433966551996667, 0.11782496233713137, -0.1578762219287455, 0.05480696460110939, 0.007408451563232157, 0.1912315380695748, 0.060586067745844796, -0.015208060553373948, 0.15598749593920905, 0.19162368931335538, 0.044783417135477066, 0.19402512086376753, -0.06354361804112894, -0.15259800441818286, -0.25435673051245816, -0.09802333049935429, -0.1563772349921374, -0.04365314522196781, -0.06962618893865585, -0.14898547046651986, 0.4324838685331075, 0.15377510655416202, 0.1423114803683472, 0.0955157248440441, 0.3808399225546889, 0.18369472930718161, 0.005973735415976341, 0.0719063990073253, 0.234589965982133, 0.10680941906949021, 0.1263144928005154, -0.26980267636069694, 0.01428297808240742, 0.1007442155674304] |
1,802.05358 | Braid group actions from categorical symmetric Howe duality on deformed
Webster algebras | We construct a 2-representation categorifying the symmetric Howe
representation of $\mathfrak{gl}_m$ using a deformation of an algebra
introduced by Webster. As a consequence, we obtain a categorical braid group
action taking values in a homotopy category.
| math.QA | we construct a 2representation categorifying the symmetric howe representation of mathfrakgl_m using a deformation of an algebra introduced by webster as a consequence we obtain a categorical braid group action taking values in a homotopy category | [['we', 'construct', 'a', '2representation', 'categorifying', 'the', 'symmetric', 'howe', 'representation', 'of', 'mathfrakgl_m', 'using', 'a', 'deformation', 'of', 'an', 'algebra', 'introduced', 'by', 'webster', 'as', 'a', 'consequence', 'we', 'obtain', 'a', 'categorical', 'braid', 'group', 'action', 'taking', 'values', 'in', 'a', 'homotopy', 'category']] | [-0.1618955606698162, 0.026357333318527607, -0.17201766294116774, 0.07387868195979132, -0.14776430134144095, -0.11042737118744601, -0.013500861771818664, 0.3256380500064956, -0.3712999909702275, -0.1991151839029044, 0.07639209276466216, -0.13461113508795583, -0.20288508380245832, 0.133018006493027, -0.24077819124795496, -0.13856427225618972, 0.0477597416482038, 0.14817515874488485, -0.13928939315438685, -0.18907742569636968, 0.403684392467969, -0.007435192355640336, 0.22054407403276047, -0.048590461426000625, 0.17638524125019708, 0.06716388007367237, -0.023041679058223963, 0.019827022799290717, -0.14703670301565175, 0.15835395833063456, 0.3116014824546356, 0.023629361207389996, 0.18526965722170038, -0.3160108107452591, -0.0918827974754903, 0.1465438407742315, 0.11126372538920906, 0.07926840650745565, -0.09306413988168868, -0.3807016265475088, 0.04230674468756964, -0.3706376387013329, -0.08065509432668073, -0.10540164971543062, 0.07173361593029565, -0.08439292117125458, -0.2798033087617821, -0.07975754904974666, 0.054557186008120574, 0.16794092246952155, -0.13105584639641973, -0.057230240354935326, -0.06982298692067464, 0.11553010989963594, -0.07092497488742487, 0.049168460743708745, 0.11530271984843744, -0.10924407857884136, -0.18959482862717575, 0.4030138798471954, -0.0815490735694766, -0.26679471010963124, 0.06903963861986995, -0.08980541050227152, -0.21827452634978625, 0.07636032266438836, -0.004379173016382588, 0.1293650887091644, -0.023729652632027864, 0.21672733148766887, -0.17930584501785538, 0.033768874939091295, 0.11909924121573567, -0.05042605821250214, 0.12291920123000939, 0.11966972278120618, -0.0030923927358041206, 0.20903348059962606, 0.0401357375861456, -0.018812479192598, -0.37796822454159457, -0.2457857817514903, -0.07800999937009895, 0.19025934821305177, -0.11162660902159081, -0.19036240234143204, 0.40088989396786523, 0.03256291295919153, 0.2264188860152798, 0.1805612479802221, 0.15122910470624143, 0.07110957912259942, 0.11299914232869115, 0.004642564777491821, 0.06807820421333115, 0.34990933548478, -0.05616899719461799, -0.07248677750531998, -0.09462830562066908, 0.3627304130544265] |
1,802.05359 | Resolution of Conjectures Related to Lights Out! and Cartesian Products | Lights Out! is a game played on a $5 \times 5$ grid of lights, or more
generally on a graph. Pressing lights on the grid allows the player to turn off
neighboring lights. The goal of the game is to start with a given initial
configuration of lit lights and reach a state where all lights are out. Two
conjectures posed in a recently published paper about Lights Out! on Cartesian
products of graphs are resolved.
| math.CO math.RA | lights out is a game played on a 5 times 5 grid of lights or more generally on a graph pressing lights on the grid allows the player to turn off neighboring lights the goal of the game is to start with a given initial configuration of lit lights and reach a state where all lights are out two conjectures posed in a recently published paper about lights out on cartesian products of graphs are resolved | [['lights', 'out', 'is', 'a', 'game', 'played', 'on', 'a', '5', 'times', '5', 'grid', 'of', 'lights', 'or', 'more', 'generally', 'on', 'a', 'graph', 'pressing', 'lights', 'on', 'the', 'grid', 'allows', 'the', 'player', 'to', 'turn', 'off', 'neighboring', 'lights', 'the', 'goal', 'of', 'the', 'game', 'is', 'to', 'start', 'with', 'a', 'given', 'initial', 'configuration', 'of', 'lit', 'lights', 'and', 'reach', 'a', 'state', 'where', 'all', 'lights', 'are', 'out', 'two', 'conjectures', 'posed', 'in', 'a', 'recently', 'published', 'paper', 'about', 'lights', 'out', 'on', 'cartesian', 'products', 'of', 'graphs', 'are', 'resolved']] | [-0.15837450111499302, 0.13053935802982827, -0.13159527475210397, 0.03675404177231126, -0.08297985920829601, -0.14980591677962557, 0.13671572531395787, 0.4078117510499923, -0.19158440958831066, -0.33361897534249646, 0.15104307347485846, -0.3213675546302463, -0.06437792862140525, 0.17710548137103233, -0.11463157202754366, -0.012204548411414419, 0.08545999530102372, 0.0335931143061699, 0.029276479504340768, -0.29592539159631615, 0.34044217533971133, -0.02285925539112405, 0.21100061411332144, 0.08153760818593007, 0.10979871916290569, 0.0178991156679235, -0.08038504711523849, 0.06487530246867161, -0.04619264944554552, 0.09627120339504663, 0.19553734378055915, 0.13141489935132036, 0.2725498833644547, -0.5022465979288283, -0.18389936476504723, 0.11973289938300456, 0.10705663029914017, 0.0476581689803616, 0.010182156946508545, -0.2628903263003418, 0.049534155270329824, -0.07727638661469284, -0.12478503779704242, 0.020443290815149482, 0.03791546801987447, 0.007037702678261619, -0.24410730602807904, -0.12101659347229686, 0.044478692521806806, 0.06530278997103635, 0.03667615907876385, -0.14819733217652692, -0.03736592745285874, 0.17660951202943628, -0.028204084135052796, 0.051047605241795906, 0.10198510763554, -0.12960990873704614, -0.1049839785126479, 0.4187053544201741, 0.026317457876805412, -0.1759057000254918, 0.13192713720491156, -0.11452950596025116, -0.09615805938741878, 0.09897596766485979, 0.16653581678034052, 0.18696790818419112, -0.08956560717993661, -0.02124515581511476, -0.10513171059765707, 0.17711760941892862, 0.1398229288353928, -0.02091646771632919, 0.26382334146795694, 0.20491592157141944, 0.17236838366615734, 0.09371378505602479, -0.04287879801306285, -0.1627119681859193, -0.23783828454141162, -0.07871275092475116, -0.13035523641921923, 0.12621503061075745, -0.056129687263340826, -0.07378023963323549, 0.41644827188237715, 0.13891819836326727, 0.16987667156775532, 0.00204421724437883, 0.29721156197544923, 0.0489926332742662, -0.001958278861007114, 0.06377937959041446, 0.20432056756199976, 0.13847792599546282, 0.1557452672216306, -0.13950726584727435, 0.042623922159883046, 0.05191138679909177] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.