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.0716 | Performance analysis of a novel hybrid FSO / RF communication system | In this paper, a novel dual-hop relay-assisted hybrid Free Space Optical /
Radio Frequency (FSO / RF) communication system is presented. In this structure
an access point connects users within the building to the Base Station via a
hybrid parallel FSO / RF link, this link is proposed firstly. Parallel
combination of FSO and RF links and use of an access point, will increase
capacity, reliability and data rate of the system. It is the first time that
the effect of number of users on the performance of a dual-hop relay-assisted
hybrid parallel FSO / RF system is investigated. FSO link is considered in
Gamma-Gamma atmospheric turbulence with the effect of pointing error and RF
link is considered in Rayleigh fading. For the first time, closed-form
expressions are derived for Bit Error Rate (BER) and Outage Probability (P_out)
of the proposed system. Derived expressions are verified through MATLAB
simulations. It is shown that the performance of the proposed system is almost
independent of atmospheric turbulence intensity, thereby when atmospheric
turbulence strengthens, low power consumption is required for maintenance of
the system performance. Hence the proposed structure is particularly suitable
for mobile communication systems in which a small mobile battery supplies
transmitter power. Also the proposed system performance of the system is
preferable even at low signal to noise ratio (SNR). Therefore, proposed
structure significantly reduces power consumption while maintaining performance
of the system.
| eess.SP | in this paper a novel dualhop relayassisted hybrid free space optical radio frequency fso rf communication system is presented in this structure an access point connects users within the building to the base station via a hybrid parallel fso rf link this link is proposed firstly parallel combination of fso and rf links and use of an access point will increase capacity reliability and data rate of the system it is the first time that the effect of number of users on the performance of a dualhop relayassisted hybrid parallel fso rf system is investigated fso link is considered in gammagamma atmospheric turbulence with the effect of pointing error and rf link is considered in rayleigh fading for the first time closedform expressions are derived for bit error rate ber and outage probability p_out of the proposed system derived expressions are verified through matlab simulations it is shown that the performance of the proposed system is almost independent of atmospheric turbulence intensity thereby when atmospheric turbulence strengthens low power consumption is required for maintenance of the system performance hence the proposed structure is particularly suitable for mobile communication systems in which a small mobile battery supplies transmitter power also the proposed system performance of the system is preferable even at low signal to noise ratio snr therefore proposed structure significantly reduces power consumption while maintaining performance of the system | [['in', 'this', 'paper', 'a', 'novel', 'dualhop', 'relayassisted', 'hybrid', 'free', 'space', 'optical', 'radio', 'frequency', 'fso', 'rf', 'communication', 'system', 'is', 'presented', 'in', 'this', 'structure', 'an', 'access', 'point', 'connects', 'users', 'within', 'the', 'building', 'to', 'the', 'base', 'station', 'via', 'a', 'hybrid', 'parallel', 'fso', 'rf', 'link', 'this', 'link', 'is', 'proposed', 'firstly', 'parallel', 'combination', 'of', 'fso', 'and', 'rf', 'links', 'and', 'use', 'of', 'an', 'access', 'point', 'will', 'increase', 'capacity', 'reliability', 'and', 'data', 'rate', 'of', 'the', 'system', 'it', 'is', 'the', 'first', 'time', 'that', 'the', 'effect', 'of', 'number', 'of', 'users', 'on', 'the', 'performance', 'of', 'a', 'dualhop', 'relayassisted', 'hybrid', 'parallel', 'fso', 'rf', 'system', 'is', 'investigated', 'fso', 'link', 'is', 'considered', 'in', 'gammagamma', 'atmospheric', 'turbulence', 'with', 'the', 'effect', 'of', 'pointing', 'error', 'and', 'rf', 'link', 'is', 'considered', 'in', 'rayleigh', 'fading', 'for', 'the', 'first', 'time', 'closedform', 'expressions', 'are', 'derived', 'for', 'bit', 'error', 'rate', 'ber', 'and', 'outage', 'probability', 'p_out', 'of', 'the', 'proposed', 'system', 'derived', 'expressions', 'are', 'verified', 'through', 'matlab', 'simulations', 'it', 'is', 'shown', 'that', 'the', 'performance', 'of', 'the', 'proposed', 'system', 'is', 'almost', 'independent', 'of', 'atmospheric', 'turbulence', 'intensity', 'thereby', 'when', 'atmospheric', 'turbulence', 'strengthens', 'low', 'power', 'consumption', 'is', 'required', 'for', 'maintenance', 'of', 'the', 'system', 'performance', 'hence', 'the', 'proposed', 'structure', 'is', 'particularly', 'suitable', 'for', 'mobile', 'communication', 'systems', 'in', 'which', 'a', 'small', 'mobile', 'battery', 'supplies', 'transmitter', 'power', 'also', 'the', 'proposed', 'system', 'performance', 'of', 'the', 'system', 'is', 'preferable', 'even', 'at', 'low', 'signal', 'to', 'noise', 'ratio', 'snr', 'therefore', 'proposed', 'structure', 'significantly', 'reduces', 'power', 'consumption', 'while', 'maintaining', 'performance', 'of', 'the', 'system']] | [-0.29510223706264055, 0.049029243737992965, 0.006386894399227013, 0.00159410642971911, -0.03993668324440132, -0.2058485086324043, 0.10146775939979684, 0.38358257054102174, -0.24138714046132095, -0.2647260441632909, 0.0762228846202267, -0.20871980713403837, -0.16196637126356853, 0.24040821993186678, -0.09651643020409977, 0.07658256090543025, 0.07900772769996432, 0.05117870679259398, -0.012809019212968908, -0.2506305775960997, 0.2600896219157626, 0.2110413585862706, 0.39648109726103503, 0.035446726062282205, 0.09926699003963182, -0.02183135509120878, -0.017465351299915513, -0.05210515910133772, -0.08155822950318978, 0.05258822898018503, 0.2899648646588181, 0.14681904235222212, 0.23309622142223974, -0.38778674350360076, -0.2763744760711381, 0.04618682986222956, 0.16638473327440417, 0.004857308644593966, -0.04291010798182843, -0.23888137775542434, 0.12294543560545518, -0.26723168103032496, -0.0426180456037019, 0.02902384080993231, -0.05651390436613794, 0.08062468546388801, -0.3252601065938808, 0.019919787711381514, 0.01738996517246662, 0.07882133198446517, -0.06259713680625743, -0.09243725220861898, 0.01501324720574974, 0.1746143065617922, 0.021166460031407628, -0.008825946106132136, 0.09865430755719673, -0.11078088528143169, -0.06104442261069948, 0.3788622780753845, -0.025685283929866017, -0.23408709281819617, 0.17757764370607693, -0.09245058772556776, -0.06914578311096503, 0.20264451625257707, 0.21072899972548195, 0.002138590730938198, -0.1985805114862986, 0.04294881288584436, 0.02793382551098104, 0.19170781531839887, 0.05726565137062238, 0.09987038982560345, 0.1600235313732242, 0.22737878433217226, 0.11898180318174795, 0.15227484422040427, -0.15024765809147933, -0.09369433150264764, -0.21037183813832083, -0.17967049909784055, -0.231220565117615, 0.005579865915806533, -0.07203623097242257, -0.07627699311299546, 0.36514889825273744, 0.15048773123452636, 0.07758467257079794, 0.10799996264118246, 0.45081752073426434, 0.15803298974861127, 0.01566170996835854, 0.1305143769391239, 0.22426070614543023, 0.12914691785936078, 0.15490128730391214, -0.24912327698606787, 0.0664631777979824, 0.005246373108998917] |
1,802.07161 | Fourier optics: basic concepts | Based on diffraction theory and the propagation of the light, Fourier optics
is a powerful tool allowing the estimation of a visible-range imaging system to
transfer the spatial frequency components of an object. The analyses of the
imaging systems can thus be performed and the the performance retrieved. For a
better understanding of the optical study, we present a short introduction of
the Fourier optics and we review the mathematical treatment depending on the
illumination conditions of the imaging system. Furthermore, resolution criteria
based on Fourier optics are detailed. Also, the impact of aberrations on the
imaging quality are discussed.
| physics.gen-ph physics.optics | based on diffraction theory and the propagation of the light fourier optics is a powerful tool allowing the estimation of a visiblerange imaging system to transfer the spatial frequency components of an object the analyses of the imaging systems can thus be performed and the the performance retrieved for a better understanding of the optical study we present a short introduction of the fourier optics and we review the mathematical treatment depending on the illumination conditions of the imaging system furthermore resolution criteria based on fourier optics are detailed also the impact of aberrations on the imaging quality are discussed | [['based', 'on', 'diffraction', 'theory', 'and', 'the', 'propagation', 'of', 'the', 'light', 'fourier', 'optics', 'is', 'a', 'powerful', 'tool', 'allowing', 'the', 'estimation', 'of', 'a', 'visiblerange', 'imaging', 'system', 'to', 'transfer', 'the', 'spatial', 'frequency', 'components', 'of', 'an', 'object', 'the', 'analyses', 'of', 'the', 'imaging', 'systems', 'can', 'thus', 'be', 'performed', 'and', 'the', 'the', 'performance', 'retrieved', 'for', 'a', 'better', 'understanding', 'of', 'the', 'optical', 'study', 'we', 'present', 'a', 'short', 'introduction', 'of', 'the', 'fourier', 'optics', 'and', 'we', 'review', 'the', 'mathematical', 'treatment', 'depending', 'on', 'the', 'illumination', 'conditions', 'of', 'the', 'imaging', 'system', 'furthermore', 'resolution', 'criteria', 'based', 'on', 'fourier', 'optics', 'are', 'detailed', 'also', 'the', 'impact', 'of', 'aberrations', 'on', 'the', 'imaging', 'quality', 'are', 'discussed']] | [-0.10299896271666512, 0.04768609955572174, -0.16746303862892092, 0.03926219960791059, -0.0770520603726618, -0.08690350160934031, 0.0038972270500380545, 0.4038131532724947, -0.2466795471869409, -0.29865254977718, 0.18256764313438908, -0.23488602785859258, -0.16391921122092754, 0.2814426359347999, -0.06009349275380373, 0.0809448141354369, 0.0860020518489182, -0.003054637317545712, -0.0865254454407841, -0.1807214117795229, 0.27889495556708427, 0.11423224252648652, 0.3016155595798045, 0.033917792188003656, 0.10631148715503513, 0.09027857471257449, -0.09381992029026151, -0.008212422132492065, -0.11903268956928514, 0.16507971522398293, 0.18759720366448163, 0.13205033126170748, 0.2524318915605545, -0.4283438569866121, -0.2422594349924475, 0.013390250974334777, 0.12774047481594608, 0.0796118356473744, -0.07161405975464731, -0.2908664486836642, -0.01080230568535626, -0.061513645907398315, -0.10318937841337174, -0.07856164906173944, -0.05168303712736815, 0.0432183521904517, -0.2629472153261304, 0.033557579496118706, 0.033951368066482246, 0.13197294148383662, -0.07850490808865289, -0.08463181659346447, 0.03414683819515631, 0.13413893682416528, -0.05117574340896681, -0.023714289085473864, 0.11324060404673218, -0.18452356996014715, -0.08103387511335314, 0.3883670742809773, -0.02773481940384954, -0.18392763704061507, 0.22049778174143284, -0.17270676259038736, -0.07855432295473293, 0.13494622407713905, 0.21223087570630014, 0.14987385062500835, -0.1568538877775427, 0.026899569242377765, 0.010472039114683867, 0.23657291748560966, 0.05748797482810915, 0.1253811203315854, 0.20311517553636804, 0.22905659602954984, 0.018132964458127388, 0.13138507977011613, -0.19653719182126225, -0.010849152051378042, -0.2853311843238771, -0.1653746482450515, -0.16928892978234217, 0.013157289577648043, -0.07067467845001374, -0.14648274561390282, 0.4313856183923781, 0.18880981156136842, 0.11937292108312249, -0.02428303034277633, 0.36746508702635766, 0.12836846588877962, 0.0521979774933061, -0.03598665853496641, 0.2629413814749569, 0.1595783841231605, 0.1398339276202023, -0.2555813796957955, 0.010570178618654608, 0.033943190928548576] |
1,802.07162 | Marginal Stability of Sweet-Parker Type Current Sheets at Low Lundquist
Numbers | Magnetohydrodynamic simulations have shown that a non-unique critical
Lundquist number $S_c$ exists, hovering around $S_c \sim 10^4$, above which
threshold Sweet-Parker type stationary reconnecting configurations become
unstable to a fast tearing mode dominated by plasmoid generation. It is known
that the flow along the sheet plays a stabilizing role, though a satisfactory
explanation of the non-universality and variable critical Lundquist numbers
observed is still lacking. Here we discuss this question using 2D linear MHD
simulations and linear stability analyses of Sweet-Parker type current sheets
in the presence of background stationary inflows and outflows at low Lundquist
numbers ($S\le 10^4$). Simulations show that the inhomogeneous outflow
stabilizes the current sheet by stretching the growing magnetic islands and at
the same time evacuating the magnetic islands out of the current sheet. This
limits the time during which fluctuations which begin at any given wave-length
can remain unstable, rendering the instability non-exponential. We find that
the linear theory based on the expanding-wavelength assumption works well for
$S$ larger than $\sim 1000$. However we also find that the inflow and location
of the initial perturbation also affect the stability threshold.
| physics.plasm-ph astro-ph.SR physics.space-ph | magnetohydrodynamic simulations have shown that a nonunique critical lundquist number s_c exists hovering around s_c sim 104 above which threshold sweetparker type stationary reconnecting configurations become unstable to a fast tearing mode dominated by plasmoid generation it is known that the flow along the sheet plays a stabilizing role though a satisfactory explanation of the nonuniversality and variable critical lundquist numbers observed is still lacking here we discuss this question using 2d linear mhd simulations and linear stability analyses of sweetparker type current sheets in the presence of background stationary inflows and outflows at low lundquist numbers sle 104 simulations show that the inhomogeneous outflow stabilizes the current sheet by stretching the growing magnetic islands and at the same time evacuating the magnetic islands out of the current sheet this limits the time during which fluctuations which begin at any given wavelength can remain unstable rendering the instability nonexponential we find that the linear theory based on the expandingwavelength assumption works well for s larger than sim 1000 however we also find that the inflow and location of the initial perturbation also affect the stability threshold | [['magnetohydrodynamic', 'simulations', 'have', 'shown', 'that', 'a', 'nonunique', 'critical', 'lundquist', 'number', 's_c', 'exists', 'hovering', 'around', 's_c', 'sim', '104', 'above', 'which', 'threshold', 'sweetparker', 'type', 'stationary', 'reconnecting', 'configurations', 'become', 'unstable', 'to', 'a', 'fast', 'tearing', 'mode', 'dominated', 'by', 'plasmoid', 'generation', 'it', 'is', 'known', 'that', 'the', 'flow', 'along', 'the', 'sheet', 'plays', 'a', 'stabilizing', 'role', 'though', 'a', 'satisfactory', 'explanation', 'of', 'the', 'nonuniversality', 'and', 'variable', 'critical', 'lundquist', 'numbers', 'observed', 'is', 'still', 'lacking', 'here', 'we', 'discuss', 'this', 'question', 'using', '2d', 'linear', 'mhd', 'simulations', 'and', 'linear', 'stability', 'analyses', 'of', 'sweetparker', 'type', 'current', 'sheets', 'in', 'the', 'presence', 'of', 'background', 'stationary', 'inflows', 'and', 'outflows', 'at', 'low', 'lundquist', 'numbers', 'sle', '104', 'simulations', 'show', 'that', 'the', 'inhomogeneous', 'outflow', 'stabilizes', 'the', 'current', 'sheet', 'by', 'stretching', 'the', 'growing', 'magnetic', 'islands', 'and', 'at', 'the', 'same', 'time', 'evacuating', 'the', 'magnetic', 'islands', 'out', 'of', 'the', 'current', 'sheet', 'this', 'limits', 'the', 'time', 'during', 'which', 'fluctuations', 'which', 'begin', 'at', 'any', 'given', 'wavelength', 'can', 'remain', 'unstable', 'rendering', 'the', 'instability', 'nonexponential', 'we', 'find', 'that', 'the', 'linear', 'theory', 'based', 'on', 'the', 'expandingwavelength', 'assumption', 'works', 'well', 'for', 's', 'larger', 'than', 'sim', '1000', 'however', 'we', 'also', 'find', 'that', 'the', 'inflow', 'and', 'location', 'of', 'the', 'initial', 'perturbation', 'also', 'affect', 'the', 'stability', 'threshold']] | [-0.1951111155153076, 0.22580376348483402, -0.007431036060222902, 0.08947556424521011, -0.02362133396059476, -0.11173037344438805, 0.029354620648774546, 0.2913663454717214, -0.2340121948789503, -0.2788860495630148, 0.10942460446228348, -0.2414573419386068, -0.09293633773167793, 0.21561864974681993, 0.03959628409655715, 0.03923171467047084, 0.04827430305398397, -0.026462835810977865, -0.02445570421845627, -0.19708802578467371, 0.28072974517488397, 0.10466717737852721, 0.314697246897865, 0.009144004557684467, 0.06710614087060093, -0.10009345748285586, 0.020979010016103652, 0.061240792178825755, -0.21055364457460127, -0.022436439438181854, 0.17863247976764232, 0.039008090222204056, 0.28002773801720626, -0.4799749110120575, -0.20983895001479902, 0.037082515443624876, 0.21997794859312675, 0.09328191269604438, -0.042106443421751565, -0.19917088187979282, 0.12166042936261039, -0.12926028723752983, -0.17350873477203219, -0.020311487369188988, 0.08898330861702561, 0.016991637835304278, -0.28620285012356533, 0.12758911407798076, 0.08394812196556076, 0.05367841214142941, -0.07663993812543718, -0.049738736787961944, -0.08253522237284562, 0.024498113672047652, 0.12040690985835485, 0.07327727006207145, 0.21633406347135786, -0.16300867086628804, -0.06113237016708464, 0.3316831072238651, -0.0341652946386996, -0.13981341375289735, 0.1992776416619686, -0.22854785344286546, -0.1257153437762345, 0.18674632777912994, 0.11215413982501707, 0.10208944214155545, -0.033205107461057, 0.048145208026855124, -0.05290506847479658, 0.15941936127916986, 0.09634202642341119, -0.020390835497528313, 0.27486068360457144, 0.18297172852955457, 0.07154848808800247, 0.08411073584323497, -0.1193125726692882, -0.10624498014866902, -0.30187544213557566, -0.09227138882049837, -0.12674663074210765, 0.0887368968901904, -0.10012241430679726, -0.19402707184183512, 0.36027097695985355, 0.18309554201236145, 0.1945925616004781, 0.030408607071542457, 0.2802733461441774, 0.14415949072399353, 0.03360940089096894, 0.15236705739705547, 0.27957116430373613, 0.12688942435480705, 0.1399284184262207, -0.24945331316667835, 0.08002894628994368, 0.03639852858425395] |
1,802.07163 | Transport-Based Pattern Theory: A Signal Transformation Approach | In many scientific fields imaging is used to relate a certain physical
quantity to other dependent variables. Therefore, images can be considered as a
map from a real-world coordinate system to the non-negative measurements being
acquired. In this work we describe an approach for simultaneous modeling and
inference of such data, using the mathematics of optimal transport. To achieve
this, we describe a numerical implementation of the linear optimal transport
transform, based on the solution of the Monge-Ampere equation, which uses
Brenier's theorem to characterize the solution of the Monge functional as the
derivative of a convex potential function. We use our implementation of the
transform to compute a curl-free mapping between two images, and show that it
is able to match images with lower error that existing methods. Moreover, we
provide theoretical justification for properties of the linear optimal
transport framework observed in the literature, including a theorem for the
linear separation of data classes. Finally, we use our optimal transport method
to empirically demonstrate that the linear separability theorem holds, by
rendering non-linearly separable data as linearly separable following transform
to transport space.
| cs.CV | in many scientific fields imaging is used to relate a certain physical quantity to other dependent variables therefore images can be considered as a map from a realworld coordinate system to the nonnegative measurements being acquired in this work we describe an approach for simultaneous modeling and inference of such data using the mathematics of optimal transport to achieve this we describe a numerical implementation of the linear optimal transport transform based on the solution of the mongeampere equation which uses breniers theorem to characterize the solution of the monge functional as the derivative of a convex potential function we use our implementation of the transform to compute a curlfree mapping between two images and show that it is able to match images with lower error that existing methods moreover we provide theoretical justification for properties of the linear optimal transport framework observed in the literature including a theorem for the linear separation of data classes finally we use our optimal transport method to empirically demonstrate that the linear separability theorem holds by rendering nonlinearly separable data as linearly separable following transform to transport space | [['in', 'many', 'scientific', 'fields', 'imaging', 'is', 'used', 'to', 'relate', 'a', 'certain', 'physical', 'quantity', 'to', 'other', 'dependent', 'variables', 'therefore', 'images', 'can', 'be', 'considered', 'as', 'a', 'map', 'from', 'a', 'realworld', 'coordinate', 'system', 'to', 'the', 'nonnegative', 'measurements', 'being', 'acquired', 'in', 'this', 'work', 'we', 'describe', 'an', 'approach', 'for', 'simultaneous', 'modeling', 'and', 'inference', 'of', 'such', 'data', 'using', 'the', 'mathematics', 'of', 'optimal', 'transport', 'to', 'achieve', 'this', 'we', 'describe', 'a', 'numerical', 'implementation', 'of', 'the', 'linear', 'optimal', 'transport', 'transform', 'based', 'on', 'the', 'solution', 'of', 'the', 'mongeampere', 'equation', 'which', 'uses', 'breniers', 'theorem', 'to', 'characterize', 'the', 'solution', 'of', 'the', 'monge', 'functional', 'as', 'the', 'derivative', 'of', 'a', 'convex', 'potential', 'function', 'we', 'use', 'our', 'implementation', 'of', 'the', 'transform', 'to', 'compute', 'a', 'curlfree', 'mapping', 'between', 'two', 'images', 'and', 'show', 'that', 'it', 'is', 'able', 'to', 'match', 'images', 'with', 'lower', 'error', 'that', 'existing', 'methods', 'moreover', 'we', 'provide', 'theoretical', 'justification', 'for', 'properties', 'of', 'the', 'linear', 'optimal', 'transport', 'framework', 'observed', 'in', 'the', 'literature', 'including', 'a', 'theorem', 'for', 'the', 'linear', 'separation', 'of', 'data', 'classes', 'finally', 'we', 'use', 'our', 'optimal', 'transport', 'method', 'to', 'empirically', 'demonstrate', 'that', 'the', 'linear', 'separability', 'theorem', 'holds', 'by', 'rendering', 'nonlinearly', 'separable', 'data', 'as', 'linearly', 'separable', 'following', 'transform', 'to', 'transport', 'space']] | [-0.07027290612459183, -0.00242996062207149, -0.1310870654597828, 0.06981683976608455, -0.10354106697832813, -0.12197053147656088, 0.028865151640933912, 0.37082402129229664, -0.33543338330361894, -0.2850322007956738, 0.13159780348588185, -0.2526931593144262, -0.17622227606841842, 0.24441175569553633, -0.0730317857179388, 0.09729127878121831, 0.05570913482318959, 0.0011211100640090032, -0.09968657378182821, -0.23691114828154142, 0.31539358969375086, 0.006929041087828778, 0.2943238742347505, 0.028756924283162164, 0.15659559170677753, 0.023085311932388594, -0.021762740577105432, 0.0265332968048185, -0.12803136545946867, 0.1491914173138227, 0.2827140620141919, 0.16814751082376853, 0.26681856818094446, -0.40744745526462794, -0.21062897668799033, 0.08859899224260369, 0.10723772243017683, 0.09354330612271017, -0.04837223558523063, -0.2445424040880155, 0.07138163598782911, -0.11498957799395194, -0.11097826456802116, -0.14071543972838568, -0.009024601805376242, 0.040142686687711926, -0.3111991013324744, 0.07251664678994063, 0.05539801534614526, 0.022377619857119547, -0.10221352565630867, -0.08243297218625131, 0.0028007259214850697, 0.11796024539350608, 0.03764591940703827, 0.03526842350996024, 0.10421462159956227, -0.0844061130997599, -0.11824477014157014, 0.3603938325031384, -0.08434055430997113, -0.24789050612850366, 0.1771036646769357, -0.11544202500450852, -0.12706371405338113, 0.08846178970828053, 0.20306910969744865, 0.14112493357293912, -0.17502560106836057, 0.07386698510585907, -0.08545612148638512, 0.15599124629767863, 0.028356663361695168, 0.03764304505107371, 0.10879908933782496, 0.15549014216742, 0.1033363342684744, 0.15600622652910298, -0.07490844547471685, -0.07758922612646947, -0.3058104535388584, -0.17358963368712244, -0.21539374082223386, 0.03774434671284178, -0.07257839312912216, -0.172975839508345, 0.3794902462738793, 0.20327480345763066, 0.17738800775008023, 0.08879117624066468, 0.30147716270105257, 0.1285323230977598, 0.050364101620239986, 0.07666738071554416, 0.21154209307168384, 0.14356822498847505, 0.09068021610429561, -0.21528560698686822, 0.019303826967606675, 0.06816266350750182] |
1,802.07164 | Cubic graphs, their Ehrhart quasi-polynomials, and a scissors congruence
phenomenon | The scissors congruence conjecture for the unimodular group is an analogue of
Hilbert's third problem, for the equidecomposability of polytopes. Liu and
Osserman studied the Ehrhart quasi-polynomials of polytopes naturally
associated to graphs whose vertices have degree one or three. In this paper, we
prove the scissors congruence conjecture, posed by Haase and McAllister, for
this class of polytopes. The key ingredient in the proofs is the nearest
neighbor interchange on graphs and a naturally arising piecewise unimodular
transformation.
| math.CO cs.DM | the scissors congruence conjecture for the unimodular group is an analogue of hilberts third problem for the equidecomposability of polytopes liu and osserman studied the ehrhart quasipolynomials of polytopes naturally associated to graphs whose vertices have degree one or three in this paper we prove the scissors congruence conjecture posed by haase and mcallister for this class of polytopes the key ingredient in the proofs is the nearest neighbor interchange on graphs and a naturally arising piecewise unimodular transformation | [['the', 'scissors', 'congruence', 'conjecture', 'for', 'the', 'unimodular', 'group', 'is', 'an', 'analogue', 'of', 'hilberts', 'third', 'problem', 'for', 'the', 'equidecomposability', 'of', 'polytopes', 'liu', 'and', 'osserman', 'studied', 'the', 'ehrhart', 'quasipolynomials', 'of', 'polytopes', 'naturally', 'associated', 'to', 'graphs', 'whose', 'vertices', 'have', 'degree', 'one', 'or', 'three', 'in', 'this', 'paper', 'we', 'prove', 'the', 'scissors', 'congruence', 'conjecture', 'posed', 'by', 'haase', 'and', 'mcallister', 'for', 'this', 'class', 'of', 'polytopes', 'the', 'key', 'ingredient', 'in', 'the', 'proofs', 'is', 'the', 'nearest', 'neighbor', 'interchange', 'on', 'graphs', 'and', 'a', 'naturally', 'arising', 'piecewise', 'unimodular', 'transformation']] | [-0.1740952607301724, 0.06120970669144299, -0.020808987484513958, 0.08329342537312003, -0.12127257513377486, -0.14265133971584182, 0.0036260758178850894, 0.28079708541236537, -0.3861501505480537, -0.24070333477251138, 0.12537877859924978, -0.2916069476322943, -0.1991345785894207, 0.13533175840113265, -0.1483454669153766, 0.02813490712425754, 0.024318759739281066, 0.05507309697391583, -0.03531944606146669, -0.3602997465648606, 0.38382123246836136, -0.0012241026528085335, 0.20295138417778513, 0.09220263656063736, 0.10056355832766482, 0.058277163896238125, -0.01133711841193181, -0.012937237722268681, -0.15631832934244053, 0.1704770150709355, 0.2654454102386025, 0.09273236613025111, 0.2193694374133734, -0.33742383664733244, -0.10427487418173423, 0.17702737370435195, 0.10564007290603616, 0.05785086999435119, -0.027314158551442095, -0.2467197318903253, 0.06927926926225235, -0.09428582437608327, -0.20204971080551606, -0.03448166417199647, 0.07243650671849146, -0.013776765146021601, -0.2348796515195053, 0.041537957274952915, 0.19900219223780347, 0.12734192305338818, -0.00455065866154206, -0.1185606429176523, 0.005858931593196113, 0.030888736846302695, -0.0027315551002474524, 0.04018919400965111, -0.04688501066257116, -0.053014787271341804, -0.22886431697885729, 0.4420661409208669, 0.04853010348551258, -0.1967397670002206, 0.09173723218278794, -0.14531467226039194, -0.2496586727461766, 0.07594082711995402, 0.12459064126486265, 0.1707265495405167, -0.05994589346213431, 0.15144185230645787, -0.1838211314281142, 0.01993878003021207, 0.20796923999544942, -0.04138037630745882, 0.1537237329455682, 0.051081547260142954, 0.07178388744934544, 0.19165606013664244, 0.05028215865530899, -0.06265371661821875, -0.2899318751937981, -0.18066252558786847, -0.21338524041060783, 0.10413145898735221, -0.1592849675454332, -0.18561199878024148, 0.3788328503930493, 0.02958729780055111, 0.13576684318058477, 0.14097163411258143, 0.17293731127629836, 0.053318674275297906, 0.052526860951764294, 0.06991408062697965, 0.1618919905888129, 0.25108546999731113, -0.011492337176835612, -0.14965722174678422, 0.008859433198371265, 0.2856182635561386] |
1,802.07165 | On a certain identity involving the Gamma function | The goal of this paper is to prove the identity \begin{align}\sum
\limits_{j=0}^{\lfloor
s\rfloor}\frac{(-1)^j}{s^j}\eta_s(j)+\frac{1}{e^{s-1}s^s}\sum
\limits_{j=0}^{\lfloor
s\rfloor}(-1)^{j+1}\alpha_s(j)+\bigg(\frac{1-((-1)^{s-\lfloor s\rfloor
+2})^{1/(s-\lfloor s\rfloor +2)}}{2}\bigg)\nonumber \\ \bigg(\sum
\limits_{j=\lfloor s\rfloor
+1}^{\infty}\frac{(-1)^j}{s^j}\eta_s(j)+\frac{1}{e^{s-1}s^s}\sum
\limits_{j=\lfloor s\rfloor
+1}^{\infty}(-1)^{j+1}\alpha_s(j)\bigg)=\frac{1}{\Gamma(s+1)},\nonumber
\end{align}where \begin{align}\eta_s(j):=\bigg(e^{\gamma (s-j)}\prod
\limits_{m=1}^{\infty}\bigg(1+\frac{s-j}{m}\bigg)\nonumber
\\e^{-(s-j)/m}\bigg)\bigg(2+\log s-\frac{j}{s}+\sum
\limits_{m=1}^{\infty}\frac{s}{m(s+m)}-\sum
\limits_{m=1}^{\infty}\frac{s-j}{m(s-j+m)}\bigg), \nonumber \end{align}and
\begin{align}\alpha_s(j):=\bigg(e^{\gamma (s-j)}\prod
\limits_{m=1}^{\infty}\bigg(1+\frac{s-j}{m}\bigg)e^{-(s-j)/m}\bigg)\bigg(\sum
\limits_{m=1}^{\infty}\frac{s}{m(s+m)}-\sum
\limits_{m=1}^{\infty}\frac{s-j}{m(s-j+m)}\bigg),\nonumber \end{align}where
$\Gamma(s+1)$ is the Gamma function defined by $\Gamma(s):=\int
\limits_{0}^{\infty}e^{-t}t^{s-1}dt$ and $\gamma =\lim
\limits_{n\longrightarrow \infty}\bigg(\sum \limits_{k=1}^{n}\frac{1}{k}-\log
n\bigg)=0.577215664\cdots $ is the Euler-Mascheroni constant.
| math.GM | the goal of this paper is to prove the identity beginalignsum limits_j0lfloor srfloorfrac1jsjeta_sjfrac1es1sssum limits_j0lfloor srfloor1j1alpha_sjbiggfrac11slfloor srfloor 21slfloor srfloor 22biggnonumber biggsum limits_jlfloor srfloor 1inftyfrac1jsjeta_sjfrac1es1sssum limits_jlfloor srfloor 1infty1j1alpha_sjbiggfrac1gammas1nonumber endalignwhere beginaligneta_sjbiggegamma sjprod limits_m1inftybigg1fracsjmbiggnonumber esjmbiggbigg2log sfracjssum limits_m1inftyfracsmsmsum limits_m1inftyfracsjmsjmbigg nonumber endalignand beginalignalpha_sjbiggegamma sjprod limits_m1inftybigg1fracsjmbiggesjmbiggbiggsum limits_m1inftyfracsmsmsum limits_m1inftyfracsjmsjmbiggnonumber endalignwhere gammas1 is the gamma function defined by gammasint limits_0inftyetts1dt and gamma lim limits_nlongrightarrow inftybiggsum limits_k1nfrac1klog nbigg0577215664cdots is the eulermascheroni constant | [['the', 'goal', 'of', 'this', 'paper', 'is', 'to', 'prove', 'the', 'identity', 'beginalignsum', 'limits_j0lfloor', 'srfloorfrac1jsjeta_sjfrac1es1sssum', 'limits_j0lfloor', 'srfloor1j1alpha_sjbiggfrac11slfloor', 'srfloor', '21slfloor', 'srfloor', '22biggnonumber', 'biggsum', 'limits_jlfloor', 'srfloor', '1inftyfrac1jsjeta_sjfrac1es1sssum', 'limits_jlfloor', 'srfloor', '1infty1j1alpha_sjbiggfrac1gammas1nonumber', 'endalignwhere', 'beginaligneta_sjbiggegamma', 'sjprod', 'limits_m1inftybigg1fracsjmbiggnonumber', 'esjmbiggbigg2log', 'sfracjssum', 'limits_m1inftyfracsmsmsum', 'limits_m1inftyfracsjmsjmbigg', 'nonumber', 'endalignand', 'beginalignalpha_sjbiggegamma', 'sjprod', 'limits_m1inftybigg1fracsjmbiggesjmbiggbiggsum', 'limits_m1inftyfracsmsmsum', 'limits_m1inftyfracsjmsjmbiggnonumber', 'endalignwhere', 'gammas1', 'is', 'the', 'gamma', 'function', 'defined', 'by', 'gammasint', 'limits_0inftyetts1dt', 'and', 'gamma', 'lim', 'limits_nlongrightarrow', 'inftybiggsum', 'limits_k1nfrac1klog', 'nbigg0577215664cdots', 'is', 'the', 'eulermascheroni', 'constant']] | [-0.18360527226080497, 0.1198713030355672, -0.06434042478601137, 0.03207204308516035, -0.06152741946280003, -0.1143098408356309, 0.0302546371667025, 0.2764803275465965, -0.2982379513482253, -0.1845179246738553, 0.05530466064810753, -0.320752939209342, -0.12307056691497564, 0.15331640417377154, -0.11004737510035435, 0.03075678205738465, -0.061052203209449846, 0.04576684331210951, 0.02358335315560301, -0.17975133433938026, 0.291923469491303, 0.024843753688037394, 0.1681080790857474, 0.11759711944808562, 0.07814006945118308, 0.008175592093418041, 0.006099935434758663, -0.1316186875104904, -0.24222409476836523, 0.05684239749486248, 0.21390983988530934, 0.13272590769920498, 0.25206410909692445, -0.18817803754160803, -0.05541112991049886, 0.17367954937120278, 0.09928568893034632, -0.12066315353537599, 0.07896295319466541, -0.2600934329132239, 0.1758779008562366, -0.13736242068310578, -0.11862376880211135, 0.04202677384018898, 0.06829736701523265, 0.03315817024558783, -0.3512872969110807, 0.08998207378511627, 0.08166242552300294, -0.01630482990294695, 0.017369136648873486, -0.1737928168537716, 0.0363056680187583, 0.050520293042063714, 0.05255465818724284, 0.23715470352520546, 0.04639203545326988, -0.048598127680209775, -0.03744871400607129, 0.3603171507517497, -0.08643111654867729, -0.16453513900438946, -0.0017139037760595481, -0.1266908593320598, -0.15640570836452147, 0.05901569922765096, 0.015843691987295946, 0.15987289622426032, -0.12664218026523788, 0.2589479346740215, -0.08123066608483592, 0.12260695453733206, 0.07600996547068159, -0.07172209007355074, -0.008500573287407557, 0.07929943464696407, 0.06734333358084162, 0.092841287702322, -0.024590665008872747, 0.07758759179462989, -0.29871014604965845, -0.21528494842350482, -0.18184404435257118, 0.17287563603992265, -0.06825339345523389, -0.07992828985055288, 0.26010377531250317, 0.006425221636891365, 0.1747882132108013, 0.1519474866023908, 0.21588059390584627, 0.16222275377561649, -0.03670374870610734, 0.09111235874394576, 0.15707919920484226, 0.16611989101705452, 0.024734151860078175, -0.17910194327123463, 0.08036161482644578, 0.1331058486054341] |
1,802.07166 | Closed, Two Dimensional Surface Dynamics | We present dynamic equations for two dimensional closed surfaces and
analytically solve it for some simplified cases. We derive final equations for
surface normal motions by two different ways. The solution of the equations of
motions in normal direction indicates that any closed, two dimensional,
homogeneous surface with time invariable surface energy density adopts constant
mean curvature shape when it comes in equilibrium with environment. As an
example, we apply the formalism to analyze equilibrium shapes of micelles and
explain why they adopt spherical, lamellar and cylindrical shapes. We show that
theoretical calculation for micellar optimal radius is in good agreement with
all atom simulations and experiments.
| physics.bio-ph cond-mat.soft | we present dynamic equations for two dimensional closed surfaces and analytically solve it for some simplified cases we derive final equations for surface normal motions by two different ways the solution of the equations of motions in normal direction indicates that any closed two dimensional homogeneous surface with time invariable surface energy density adopts constant mean curvature shape when it comes in equilibrium with environment as an example we apply the formalism to analyze equilibrium shapes of micelles and explain why they adopt spherical lamellar and cylindrical shapes we show that theoretical calculation for micellar optimal radius is in good agreement with all atom simulations and experiments | [['we', 'present', 'dynamic', 'equations', 'for', 'two', 'dimensional', 'closed', 'surfaces', 'and', 'analytically', 'solve', 'it', 'for', 'some', 'simplified', 'cases', 'we', 'derive', 'final', 'equations', 'for', 'surface', 'normal', 'motions', 'by', 'two', 'different', 'ways', 'the', 'solution', 'of', 'the', 'equations', 'of', 'motions', 'in', 'normal', 'direction', 'indicates', 'that', 'any', 'closed', 'two', 'dimensional', 'homogeneous', 'surface', 'with', 'time', 'invariable', 'surface', 'energy', 'density', 'adopts', 'constant', 'mean', 'curvature', 'shape', 'when', 'it', 'comes', 'in', 'equilibrium', 'with', 'environment', 'as', 'an', 'example', 'we', 'apply', 'the', 'formalism', 'to', 'analyze', 'equilibrium', 'shapes', 'of', 'micelles', 'and', 'explain', 'why', 'they', 'adopt', 'spherical', 'lamellar', 'and', 'cylindrical', 'shapes', 'we', 'show', 'that', 'theoretical', 'calculation', 'for', 'micellar', 'optimal', 'radius', 'is', 'in', 'good', 'agreement', 'with', 'all', 'atom', 'simulations', 'and', 'experiments']] | [-0.10840063303639398, 0.11591726872609236, -0.10411603803198054, 0.07105442092135966, -0.03157246845614418, -0.15075765725521145, -0.02340616032733608, 0.43173160360447155, -0.23542156901045172, -0.28007039892602553, 0.05352971923132819, -0.23314884293141175, -0.15538145653973115, 0.17638629823096236, -0.01511718786732842, 0.027746667580626834, 0.0688685156779242, -2.955522814713349e-05, -0.10036914378826758, -0.20289218550870003, 0.3211674449582384, -0.012921288888031077, 0.28801104866803806, 0.0034821193619570304, 0.10510478522378307, -0.012895434492084886, 0.0337980834845558, 0.10803947200309896, -0.24054861191954469, 0.060066618511636055, 0.23321406687305213, 0.05525335669517517, 0.18806603644478403, -0.488950790175907, -0.21210436305960326, 0.06679024402852927, 0.14386324869973638, 0.133690945138267, -0.06357984031780697, -0.20234158534173655, 0.054968164328520544, -0.1199921096335644, -0.24071173874278354, -0.0950746329362008, 0.04687638763364439, 0.03558544603733468, -0.21752323559267778, 0.12790945331374548, 0.04478959465033819, 0.03218502945823717, -0.14984956318425519, -0.11535059444815199, -0.02310287235217674, 0.10094637274943405, 0.05264617591153446, -0.025015504016741134, 0.12837408531063332, -0.09257642450161979, -0.05561373942307519, 0.3878767500483544, -0.0884440288929025, -0.26020314899995645, 0.18929829764197292, -0.1488667169594528, -0.08414851129055023, 0.15385352842788272, 0.1626946239353584, 0.12234651093223245, -0.13608783185680584, 0.0735745012485988, -0.054228361145480075, 0.14688434850459345, 0.10389806216835071, -0.07554448999865165, 0.18718777840225914, 0.130806149007474, 0.07125945951001911, 0.15022455672428847, -0.08297446183642704, -0.15713474346394432, -0.29607918377199743, -0.1801178576596417, -0.12641823579117692, 0.04246848888660424, -0.12121741224687424, -0.1854910059401191, 0.3274091117292921, 0.07964072172273229, 0.18292418759420653, 0.0605497850697035, 0.3052183911421937, 0.08925365498202427, -0.02148667017213356, 0.10797234780860142, 0.2247614283955147, 0.14044542792122636, 0.04924989371586626, -0.22134599627961762, 0.0299457389051878, 0.0644835761626399] |
1,802.07167 | High-Quality Prediction Intervals for Deep Learning: A
Distribution-Free, Ensembled Approach | This paper considers the generation of prediction intervals (PIs) by neural
networks for quantifying uncertainty in regression tasks. It is axiomatic that
high-quality PIs should be as narrow as possible, whilst capturing a specified
portion of data. We derive a loss function directly from this axiom that
requires no distributional assumption. We show how its form derives from a
likelihood principle, that it can be used with gradient descent, and that model
uncertainty is accounted for in ensembled form. Benchmark experiments show the
method outperforms current state-of-the-art uncertainty quantification methods,
reducing average PI width by over 10%.
| stat.ML | this paper considers the generation of prediction intervals pis by neural networks for quantifying uncertainty in regression tasks it is axiomatic that highquality pis should be as narrow as possible whilst capturing a specified portion of data we derive a loss function directly from this axiom that requires no distributional assumption we show how its form derives from a likelihood principle that it can be used with gradient descent and that model uncertainty is accounted for in ensembled form benchmark experiments show the method outperforms current stateoftheart uncertainty quantification methods reducing average pi width by over 10 | [['this', 'paper', 'considers', 'the', 'generation', 'of', 'prediction', 'intervals', 'pis', 'by', 'neural', 'networks', 'for', 'quantifying', 'uncertainty', 'in', 'regression', 'tasks', 'it', 'is', 'axiomatic', 'that', 'highquality', 'pis', 'should', 'be', 'as', 'narrow', 'as', 'possible', 'whilst', 'capturing', 'a', 'specified', 'portion', 'of', 'data', 'we', 'derive', 'a', 'loss', 'function', 'directly', 'from', 'this', 'axiom', 'that', 'requires', 'no', 'distributional', 'assumption', 'we', 'show', 'how', 'its', 'form', 'derives', 'from', 'a', 'likelihood', 'principle', 'that', 'it', 'can', 'be', 'used', 'with', 'gradient', 'descent', 'and', 'that', 'model', 'uncertainty', 'is', 'accounted', 'for', 'in', 'ensembled', 'form', 'benchmark', 'experiments', 'show', 'the', 'method', 'outperforms', 'current', 'stateoftheart', 'uncertainty', 'quantification', 'methods', 'reducing', 'average', 'pi', 'width', 'by', 'over', '10']] | [-0.06796775197552651, 0.03001706915686733, -0.09298826316755611, 0.10090408336428791, -0.08502686146608333, -0.14446394229019732, 0.0673844454169139, 0.40959299793562937, -0.27545588550916345, -0.3333575331135509, 0.06596937863943503, -0.26173555267225834, -0.1488515334155833, 0.22830316708567217, -0.10240505746392936, 0.06220354133504011, 0.14604117734280905, 0.03251849953565247, -0.0890553713273305, -0.2286564787470534, 0.26763927993441444, 0.02801718615888397, 0.30829803649691345, 0.028353030056471832, 0.1331320332432857, 0.004977684400822084, -0.017198244903054202, 0.05244069481652576, -0.06877884222164549, 0.1706761024489077, 0.27615515496005716, 0.2320779297865697, 0.3300083139431231, -0.36349515290450807, -0.26458096887781907, 0.11792277832774772, 0.13515101405839944, 0.09576310623033914, 0.017001580588577182, -0.2753666295698777, 0.0912799138057324, -0.19874740107292213, -0.04814379252781419, -0.12379406588920153, -0.00669529446947974, -0.0005964107929066438, -0.3055981669536571, 0.1247354302550522, 0.07264750920831389, 0.05634453248463033, -0.016331622438246058, -0.14127041431163082, 0.00944238321702044, 0.10090172006124534, 0.05192052465191437, 0.0556144236404564, 0.14412057526426428, -0.11726867584281732, -0.11347956198373253, 0.376395545170172, -0.12218974460607644, -0.24597180431190224, 0.08475976328835967, -0.0705208207538217, -0.1436799035357196, 0.09158810578795515, 0.16804617546263545, 0.08990285177859142, -0.18431564556319535, 0.03653176677036435, -0.061092925325189666, 0.20670949197230265, 0.05603486325198151, -0.0110638686347772, 0.17782866933680685, 0.20829606885762558, 0.06514329052189384, 0.12862653878383032, -0.10403951910353199, -0.07096957665035195, -0.30033825529912084, -0.12213838766280984, -0.16327886191225544, 0.011528294130238061, -0.0828038619964122, -0.10931002671503913, 0.3403176323645124, 0.22951608566452086, 0.18521211403854115, 0.13898376260221618, 0.33833960704889493, 0.12027527882775157, 0.10838192497792933, 0.09307426017152202, 0.21224307491607272, 0.054704734573102334, 0.032337895713352896, -0.16053670656761712, 0.16493071754914276, 0.030252503744835398] |
1,802.07168 | Some results relating to (p,q)-th relative Gol'dberg order and
(p,q)-relative Gol'dberg type of entire functions of several variables | In this paper we introduce the notions of (p,q)-th relative Gol'dberg order
and (p,q)-th relative Gol'dberg type of entire functions of several complex
variables where p,q are any positive integers. Then we study some growth
properties of entire functions of several complex variables on the basis of
their (p,q)-th relative Gol'dberg order and (p,q)-th relative Gol'dberg type.
| math.CV | in this paper we introduce the notions of pqth relative goldberg order and pqth relative goldberg type of entire functions of several complex variables where pq are any positive integers then we study some growth properties of entire functions of several complex variables on the basis of their pqth relative goldberg order and pqth relative goldberg type | [['in', 'this', 'paper', 'we', 'introduce', 'the', 'notions', 'of', 'pqth', 'relative', 'goldberg', 'order', 'and', 'pqth', 'relative', 'goldberg', 'type', 'of', 'entire', 'functions', 'of', 'several', 'complex', 'variables', 'where', 'pq', 'are', 'any', 'positive', 'integers', 'then', 'we', 'study', 'some', 'growth', 'properties', 'of', 'entire', 'functions', 'of', 'several', 'complex', 'variables', 'on', 'the', 'basis', 'of', 'their', 'pqth', 'relative', 'goldberg', 'order', 'and', 'pqth', 'relative', 'goldberg', 'type']] | [-0.16874651248125652, 0.08606161247416023, -0.04049197175098877, 0.0865456064440016, -0.09415397896807183, -0.028941076804409948, 0.028452462829208297, 0.3014104877304482, -0.30330812274233293, -0.2296094147227051, 0.10086105374022991, -0.2543926013535575, -0.17377118762631558, 0.1627480407294474, -0.10607356012782507, -0.0013581055641305028, -0.05516210680402685, 0.03498376788277375, -0.11279277809029609, -0.35480686598620786, 0.4244848617859054, -0.046988380713421, 0.17390228878183847, 0.006823428694093437, 0.09343849588185549, 0.015202757036476805, -0.09013184954069163, -0.0029941330124673093, -0.19528097280284815, 0.19570490718704828, 0.19525418574349923, 0.14314727608539296, 0.3225025343790389, -0.3690747301045217, -0.10582395736128092, 0.22076391199963136, 0.07392049334910616, -0.0045847882998682424, 0.06263250382739659, -0.2309791791383504, 0.11023886014887116, -0.1780072053273519, -0.11370471790187846, -0.10306137384389315, 0.09160242397991712, 0.14875469484321543, -0.247343591414392, 0.03169086740531942, 0.11293914162792805, 0.10858230400634439, -0.07852997572039735, -0.14548946330487206, 0.007899985321911803, 0.09018397454597187, 0.022475025763637142, 0.04514016232477795, 0.022247434332313246, -0.0869155947502964, -0.16603505275653382, 0.33685788234467046, -0.033643241992154925, -0.2305784650931233, 0.1563157160406965, -0.19136520739840834, -0.14199617752609284, 0.03527142567429365, 0.16591372628483855, 0.19178443202716217, -0.056572914021416454, 0.16355734110785355, -0.04857477418294078, 0.13608088814898542, 0.18445405376290805, 0.06038561620210346, 0.03570921637379287, 0.02145237835091457, 0.031140043792363844, 0.12540849512279556, 0.023985672207026368, -0.08944132375906695, -0.30097575936662524, -0.22384923676911153, -0.09577227841343797, 0.08561470173299313, -0.15289794050694214, -0.1768784581667237, 0.43983518920446696, 0.09115475564868304, 0.19794397056102753, 0.0761170716335376, 0.20468925004988386, 0.0755486420862246, -0.0002329903777296606, 0.028334538599378185, 0.1288869097249852, 0.18612304689329967, 0.07732477330749757, -0.15647639116076262, 0.08268374787937653, 0.1828679299439516] |
1,802.07169 | Self-organization principles of intracellular pattern formation | Dynamic patterning of specific proteins is essential for the spatiotemporal
regulation of many important intracellular processes in procaryotes,
eucaryotes, and multicellular organisms. The emergence of patterns generated by
interactions of diffusing proteins is a paradigmatic example for
self-organization. In this article we review quantitative models for
intracellular Min protein patterns in E. coli, Cdc42 polarization in S.
cerevisiae, and the bipolar PAR protein patterns found in C. elegans. By
analyzing the molecular processes driving these systems we derive a theoretical
perspective on general principles underlying self-organized pattern formation.
We argue that intracellular pattern formation is not captured by concepts such
as "activators"', "inhibitors", or "substrate-depletion". Instead,
intracellular pattern formation is based on the redistribution of proteins by
cytosolic diffusion, and the cycling of proteins between distinct
conformational states. Therefore, mass-conserving reaction-diffusion equations
provide the most appropriate framework to study intracellular pattern
formation. We conclude that directed transport, e.g. cytosolic diffusion along
an actively maintained cytosolic gradient, is the key process underlying
pattern formation. Thus the basic principle of self-organization is the
establishment and maintenance of directed transport by intracellular protein
dynamics.
| physics.bio-ph q-bio.SC | dynamic patterning of specific proteins is essential for the spatiotemporal regulation of many important intracellular processes in procaryotes eucaryotes and multicellular organisms the emergence of patterns generated by interactions of diffusing proteins is a paradigmatic example for selforganization in this article we review quantitative models for intracellular min protein patterns in e coli cdc42 polarization in s cerevisiae and the bipolar par protein patterns found in c elegans by analyzing the molecular processes driving these systems we derive a theoretical perspective on general principles underlying selforganized pattern formation we argue that intracellular pattern formation is not captured by concepts such as activators inhibitors or substratedepletion instead intracellular pattern formation is based on the redistribution of proteins by cytosolic diffusion and the cycling of proteins between distinct conformational states therefore massconserving reactiondiffusion equations provide the most appropriate framework to study intracellular pattern formation we conclude that directed transport eg cytosolic diffusion along an actively maintained cytosolic gradient is the key process underlying pattern formation thus the basic principle of selforganization is the establishment and maintenance of directed transport by intracellular protein dynamics | [['dynamic', 'patterning', 'of', 'specific', 'proteins', 'is', 'essential', 'for', 'the', 'spatiotemporal', 'regulation', 'of', 'many', 'important', 'intracellular', 'processes', 'in', 'procaryotes', 'eucaryotes', 'and', 'multicellular', 'organisms', 'the', 'emergence', 'of', 'patterns', 'generated', 'by', 'interactions', 'of', 'diffusing', 'proteins', 'is', 'a', 'paradigmatic', 'example', 'for', 'selforganization', 'in', 'this', 'article', 'we', 'review', 'quantitative', 'models', 'for', 'intracellular', 'min', 'protein', 'patterns', 'in', 'e', 'coli', 'cdc42', 'polarization', 'in', 's', 'cerevisiae', 'and', 'the', 'bipolar', 'par', 'protein', 'patterns', 'found', 'in', 'c', 'elegans', 'by', 'analyzing', 'the', 'molecular', 'processes', 'driving', 'these', 'systems', 'we', 'derive', 'a', 'theoretical', 'perspective', 'on', 'general', 'principles', 'underlying', 'selforganized', 'pattern', 'formation', 'we', 'argue', 'that', 'intracellular', 'pattern', 'formation', 'is', 'not', 'captured', 'by', 'concepts', 'such', 'as', 'activators', 'inhibitors', 'or', 'substratedepletion', 'instead', 'intracellular', 'pattern', 'formation', 'is', 'based', 'on', 'the', 'redistribution', 'of', 'proteins', 'by', 'cytosolic', 'diffusion', 'and', 'the', 'cycling', 'of', 'proteins', 'between', 'distinct', 'conformational', 'states', 'therefore', 'massconserving', 'reactiondiffusion', 'equations', 'provide', 'the', 'most', 'appropriate', 'framework', 'to', 'study', 'intracellular', 'pattern', 'formation', 'we', 'conclude', 'that', 'directed', 'transport', 'eg', 'cytosolic', 'diffusion', 'along', 'an', 'actively', 'maintained', 'cytosolic', 'gradient', 'is', 'the', 'key', 'process', 'underlying', 'pattern', 'formation', 'thus', 'the', 'basic', 'principle', 'of', 'selforganization', 'is', 'the', 'establishment', 'and', 'maintenance', 'of', 'directed', 'transport', 'by', 'intracellular', 'protein', 'dynamics']] | [-0.1491366581928529, 0.21732710205285688, 0.00783581779569942, 0.07397567904579037, -0.017638847821462755, -0.12472592290030436, 0.031118520030626252, 0.3757723447856274, -0.3208316278642598, -0.22966193651853736, 0.016135427457924012, -0.2065270364655998, -0.3049777391944813, 0.13993177390683526, -0.03682608753076514, -0.017839600310498704, 0.06524891666466308, -0.030733858743843392, 0.1299416257848105, -0.112994447910342, 0.23252104460314083, 0.06931557705667749, 0.3192251945919033, 0.059843269022432775, 0.11219016643760339, -0.039401932098913225, -0.007903741639934146, -0.04281618372338374, -0.1945885470496874, 0.1636697876059811, 0.28015334345492304, 0.16156692549146795, 0.25323633673526297, -0.5179388734689924, -0.3055241909041593, 0.07495707199971578, 0.1930047919256109, 0.13701628055995765, -0.07992004054687457, -0.23389570547393365, 0.08659001537552888, -0.07992789251180471, -0.09307573296213417, -0.05878994808652637, 0.07616432634799668, 0.10163797769732145, -0.23178846906449416, 0.1493185858250062, 0.07552991129243432, 0.15409515993251058, -0.09830243925673866, -0.06315338541426581, -0.07765602313500065, 0.17336272862033522, 0.02648645040501966, -0.005503717450205278, 0.28871109479190676, -0.13996873210247063, -0.160660270320283, 0.3679735658420878, -0.0019090757476364713, -0.19694240038999974, 0.2251595075025087, -0.09871568667684065, -0.17489114877757397, 0.12846525464981293, 0.15191722104817712, 0.09734013707905463, -0.2307258655390378, -0.00676659409092802, 0.01368183338261874, 0.16508998874616757, 0.0870258974099762, -0.013248985380475838, 0.20347485756187628, 0.27019476986573904, 0.0358738246857152, 0.08674369226706874, -0.04104970740167466, -0.17120693424020716, -0.20046698384698522, -0.15148861563811603, -0.10316859030824028, 0.08493456823152576, -0.09082097888844391, -0.14816811201005672, 0.39683603220148367, 0.062060986173400015, 0.1698561335313448, -0.0025833120812881697, 0.20453439517930316, -0.0008985715600389861, 0.038266182056329937, -0.005204590118563409, 0.10272341093514115, 0.11243992940433784, 0.14184357013175358, -0.3220999098194533, 0.21957222205649518, 0.05481474777537115] |
1,802.0717 | CytonMT: an Efficient Neural Machine Translation Open-source Toolkit
Implemented in C++ | This paper presents an open-source neural machine translation toolkit named
CytonMT (https://github.com/arthurxlw/cytonMt). The toolkit is built from
scratch only using C++ and NVIDIA's GPU-accelerated libraries. The toolkit
features training efficiency, code simplicity and translation quality.
Benchmarks show that CytonMT accelerates the training speed by 64.5% to 110.8%
on neural networks of various sizes, and achieves competitive translation
quality.
| cs.CL | this paper presents an opensource neural machine translation toolkit named cytonmt httpsgithubcomarthurxlwcytonmt the toolkit is built from scratch only using c and nvidias gpuaccelerated libraries the toolkit features training efficiency code simplicity and translation quality benchmarks show that cytonmt accelerates the training speed by 645 to 1108 on neural networks of various sizes and achieves competitive translation quality | [['this', 'paper', 'presents', 'an', 'opensource', 'neural', 'machine', 'translation', 'toolkit', 'named', 'cytonmt', 'httpsgithubcomarthurxlwcytonmt', 'the', 'toolkit', 'is', 'built', 'from', 'scratch', 'only', 'using', 'c', 'and', 'nvidias', 'gpuaccelerated', 'libraries', 'the', 'toolkit', 'features', 'training', 'efficiency', 'code', 'simplicity', 'and', 'translation', 'quality', 'benchmarks', 'show', 'that', 'cytonmt', 'accelerates', 'the', 'training', 'speed', 'by', '645', 'to', '1108', 'on', 'neural', 'networks', 'of', 'various', 'sizes', 'and', 'achieves', 'competitive', 'translation', 'quality']] | [-0.028532039255581117, -0.03966253061794718, 0.005899094400758093, 0.013804907571863045, -0.0975195166908882, -0.204711407863281, -0.009619805942797526, 0.49708049351518807, -0.282963231917132, -0.370987553674389, 0.03859849114986983, -0.2430008795451034, -0.12022961618548089, 0.3157523728399114, -0.10146323296834123, 0.14862805402583695, 0.2662123706191778, -0.01636446542529897, -0.07762839002958076, -0.3250602837990631, 0.23928103752603586, 0.15902139525860548, 0.4611932874911211, 0.05415089600190351, 0.17397927257486365, -0.11562680650333113, 0.0029247064143419267, -0.07494625836949456, -0.04737546551954107, 0.20755525316873735, 0.2104504922193221, 0.33317527356980875, 0.30670116848566314, -0.3500620793551207, -0.14826941573145716, -0.03587228733707558, 0.12918922429142352, 0.11311932688748294, -0.07255561032798141, -0.30765047549185426, 0.11630468084476889, -0.2147347227754918, 0.02567317635667595, -0.20883079133927823, -0.031801223780282516, 0.0021510687064040792, -0.21345012384382162, -0.04094241412187165, 0.108935298262672, 0.1742324072782966, 0.0036898722364143892, -0.14547469367019156, -0.001021605351177806, 0.12304351709105751, -0.009879980646920476, 0.15573421681130475, 0.1701779543337497, -0.14656596860679036, -0.17392360696738415, 0.40122107809240165, -0.11308557734909383, -0.16635263716082344, 0.22838575950061732, 0.09977865284308791, -0.16433826999061488, 0.08659995818849314, 0.3289646456526084, 0.06174472577192567, -0.20345221050083637, 0.11267502226295288, 0.04465198784389279, 0.3021859842267903, 0.06770595075054602, -0.12016338632357391, 0.11012934491207654, 0.30722692039879884, -0.11490988336842169, 0.19290348887443542, -0.10814611094326458, -0.0603662311268801, -0.17634732372720133, -0.16410582187500866, -0.16142897289246322, -0.03038839525119825, -0.08334823195658497, -0.1662788175046444, 0.4040964158421213, 0.235508935356682, 0.09826962455091151, 0.21750197442756458, 0.39911590167744593, -0.08650566396218809, 0.1879920023853298, 0.26266320292753254, 0.144439090246504, -0.06942061015235429, 0.1920622872368602, -0.16996766585348683, 0.029033998721702533, 0.08261488586325537] |
1,802.07171 | Constrained minimum Riesz and Green energy problems for vector measures
associated with a generalized condenser | For a finite collection $\mathbf A=(A_i)_{i\in I}$ of locally closed sets in
$\mathbb R^n$, $n\geqslant3$, with the sign $\pm1$ prescribed such that the
oppositely charged plates are mutually disjoint, we consider the minimum energy
problem relative to the $\alpha$-Riesz kernel $|x-y|^{\alpha-n}$,
$\alpha\in(0,2]$, over positive vector Radon measures
$\boldsymbol\mu=(\mu^i)_{i\in I}$ such that each $\mu^i$, $i\in I$, is carried
by $A_i$ and normalized by $\mu^i(A_i)=a_i\in(0,\infty)$. We show that, though
the closures of oppositely charged plates may intersect each other even in a
set of nonzero capacity, this problem has a solution
$\boldsymbol\lambda^{\boldsymbol\xi}_{\mathbf A}=(\lambda^i_{\mathbf A})_{i\in
I}$ (also in the presence of an external field) if we restrict ourselves to
$\boldsymbol\mu$ with $\mu^i\leqslant\xi^i$, $i\in I$, where the constraint
$\boldsymbol\xi=(\xi^i)_{i\in I}$ is properly chosen. We establish the
sharpness of the sufficient conditions on the solvability thus obtained,
provide descriptions of the weighted vector $\alpha$-Riesz potentials of the
solutions, single out their characteristic properties, and analyze the supports
of the $\lambda^i_{\mathbf A}$, $i\in I$. Our approach is based on the
simultaneous use of the vague topology and an appropriate semimetric structure
defined in terms of the $\alpha$-Riesz energy on a set of vector measures
associated with $\mathbf A$, as well as on the establishment of an intimate
relationship between the constrained minimum $\alpha$-Riesz energy problem and
a constrained minimum $\alpha$-Green energy problem, suitably formulated. The
results are illustrated by examples.
| math.CA | for a finite collection mathbf aa_i_iin i of locally closed sets in mathbb rn ngeqslant3 with the sign pm1 prescribed such that the oppositely charged plates are mutually disjoint we consider the minimum energy problem relative to the alphariesz kernel xyalphan alphain02 over positive vector radon measures boldsymbolmumui_iin i such that each mui iin i is carried by a_i and normalized by muia_ia_iin0infty we show that though the closures of oppositely charged plates may intersect each other even in a set of nonzero capacity this problem has a solution boldsymbollambdaboldsymbolxi_mathbf alambdai_mathbf a_iin i also in the presence of an external field if we restrict ourselves to boldsymbolmu with muileqslantxii iin i where the constraint boldsymbolxixii_iin i is properly chosen we establish the sharpness of the sufficient conditions on the solvability thus obtained provide descriptions of the weighted vector alphariesz potentials of the solutions single out their characteristic properties and analyze the supports of the lambdai_mathbf a iin i our approach is based on the simultaneous use of the vague topology and an appropriate semimetric structure defined in terms of the alphariesz energy on a set of vector measures associated with mathbf a as well as on the establishment of an intimate relationship between the constrained minimum alphariesz energy problem and a constrained minimum alphagreen energy problem suitably formulated the results are illustrated by examples | [['for', 'a', 'finite', 'collection', 'mathbf', 'aa_i_iin', 'i', 'of', 'locally', 'closed', 'sets', 'in', 'mathbb', 'rn', 'ngeqslant3', 'with', 'the', 'sign', 'pm1', 'prescribed', 'such', 'that', 'the', 'oppositely', 'charged', 'plates', 'are', 'mutually', 'disjoint', 'we', 'consider', 'the', 'minimum', 'energy', 'problem', 'relative', 'to', 'the', 'alphariesz', 'kernel', 'xyalphan', 'alphain02', 'over', 'positive', 'vector', 'radon', 'measures', 'boldsymbolmumui_iin', 'i', 'such', 'that', 'each', 'mui', 'iin', 'i', 'is', 'carried', 'by', 'a_i', 'and', 'normalized', 'by', 'muia_ia_iin0infty', 'we', 'show', 'that', 'though', 'the', 'closures', 'of', 'oppositely', 'charged', 'plates', 'may', 'intersect', 'each', 'other', 'even', 'in', 'a', 'set', 'of', 'nonzero', 'capacity', 'this', 'problem', 'has', 'a', 'solution', 'boldsymbollambdaboldsymbolxi_mathbf', 'alambdai_mathbf', 'a_iin', 'i', 'also', 'in', 'the', 'presence', 'of', 'an', 'external', 'field', 'if', 'we', 'restrict', 'ourselves', 'to', 'boldsymbolmu', 'with', 'muileqslantxii', 'iin', 'i', 'where', 'the', 'constraint', 'boldsymbolxixii_iin', 'i', 'is', 'properly', 'chosen', 'we', 'establish', 'the', 'sharpness', 'of', 'the', 'sufficient', 'conditions', 'on', 'the', 'solvability', 'thus', 'obtained', 'provide', 'descriptions', 'of', 'the', 'weighted', 'vector', 'alphariesz', 'potentials', 'of', 'the', 'solutions', 'single', 'out', 'their', 'characteristic', 'properties', 'and', 'analyze', 'the', 'supports', 'of', 'the', 'lambdai_mathbf', 'a', 'iin', 'i', 'our', 'approach', 'is', 'based', 'on', 'the', 'simultaneous', 'use', 'of', 'the', 'vague', 'topology', 'and', 'an', 'appropriate', 'semimetric', 'structure', 'defined', 'in', 'terms', 'of', 'the', 'alphariesz', 'energy', 'on', 'a', 'set', 'of', 'vector', 'measures', 'associated', 'with', 'mathbf', 'a', 'as', 'well', 'as', 'on', 'the', 'establishment', 'of', 'an', 'intimate', 'relationship', 'between', 'the', 'constrained', 'minimum', 'alphariesz', 'energy', 'problem', 'and', 'a', 'constrained', 'minimum', 'alphagreen', 'energy', 'problem', 'suitably', 'formulated', 'the', 'results', 'are', 'illustrated', 'by', 'examples']] | [-0.16127682853842043, 0.09872156640423262, -0.007323832081605075, 0.03726063891580062, -0.0422083982642019, -0.15075163015117224, 0.03331823498632948, 0.3668442259205737, -0.288229106878218, -0.205763508293194, 0.09614576717349378, -0.3114685607550468, -0.10206963031226554, 0.1449815988774553, -0.07688406062599976, 0.02326094858296868, 0.045718138445220234, 0.09326997354816031, -0.05993441943602834, -0.22522635372572317, 0.3647438714040383, -0.009282216908247104, 0.2463037949742123, 0.060418560948600555, 0.12271116007106542, 0.01973696748730362, -0.012034459499865428, 0.07194985330860186, -0.17397435478946438, 0.1025222304860808, 0.19487039170824505, 0.1565581956934098, 0.2772518734110751, -0.3992240815342958, -0.16789148749637714, 0.1864602940869496, 0.10810558325589596, -0.006951692003396249, -0.021465223662266594, -0.2628985447251165, 0.10817198998140265, -0.11630913527137364, -0.1185335663725592, -0.025207903420430295, 0.03960104259900526, 0.08917085607943859, -0.3029021384413912, 0.040290622243819726, 0.07429789310949023, 0.05697527512787811, -0.12154649625519454, -0.1258383322644481, -0.0300304299619581, 0.07472141551536246, 0.037049126029679816, 0.043488740918338126, 0.04262171161370695, -0.09517233843125472, -0.0798076813652133, 0.3660521177738081, -0.07181906724597589, -0.26699799636147126, 0.1476823855803052, -0.12285080940999393, -0.0872150172698333, 0.09160513331585732, 0.13393142250096124, 0.13864251689272955, -0.12017046300833026, 0.13189063356944664, -0.09021478536225477, 0.09646075120874925, 0.047610845425367906, 0.032407492864876986, 0.1977664777227948, 0.09767216222772744, 0.09914667579701625, 0.13730266526012042, -0.053184866128663195, -0.04970239939206722, -0.3779369475457319, -0.14469558756888634, -0.19902455996322846, 0.0885442494273117, -0.1089640639178897, -0.1703606611847328, 0.36622231011815404, 0.0863710394915631, 0.23029621649739518, 0.043184393892399454, 0.22726503629580758, 0.1231448363403045, 0.014003879773700911, 0.08218759535017857, 0.18360397365579406, 0.13424580271059672, 0.05070873981712961, -0.20778419817948052, 0.02560312950700384, 0.10236700256848665] |
1,802.07172 | Spin-1/2 anisotropic Heisenberg antiferromagnet with
Dzyaloshinskii-Moriya interaction via mean-field approximation | The spin-1/2 anisotropic Heisenberg model with antiferromagnetic exchange
interactions in the presence of a external magnetic field and a
Dzyaloshinskii-Moriya interaction is studied by employing the usual mean-field
approximation. The magnetic properties are obtained and it is shown that only
second-order phase transitions take place for any values of the theoretical
Hamiltonian parameters. Contrary to previous results from effective field
theory, no anomalies have been observed at low temperatures. However, some
re-entrancies still persist in some region of the phase diagram.
| cond-mat.stat-mech | the spin12 anisotropic heisenberg model with antiferromagnetic exchange interactions in the presence of a external magnetic field and a dzyaloshinskiimoriya interaction is studied by employing the usual meanfield approximation the magnetic properties are obtained and it is shown that only secondorder phase transitions take place for any values of the theoretical hamiltonian parameters contrary to previous results from effective field theory no anomalies have been observed at low temperatures however some reentrancies still persist in some region of the phase diagram | [['the', 'spin12', 'anisotropic', 'heisenberg', 'model', 'with', 'antiferromagnetic', 'exchange', 'interactions', 'in', 'the', 'presence', 'of', 'a', 'external', 'magnetic', 'field', 'and', 'a', 'dzyaloshinskiimoriya', 'interaction', 'is', 'studied', 'by', 'employing', 'the', 'usual', 'meanfield', 'approximation', 'the', 'magnetic', 'properties', 'are', 'obtained', 'and', 'it', 'is', 'shown', 'that', 'only', 'secondorder', 'phase', 'transitions', 'take', 'place', 'for', 'any', 'values', 'of', 'the', 'theoretical', 'hamiltonian', 'parameters', 'contrary', 'to', 'previous', 'results', 'from', 'effective', 'field', 'theory', 'no', 'anomalies', 'have', 'been', 'observed', 'at', 'low', 'temperatures', 'however', 'some', 'reentrancies', 'still', 'persist', 'in', 'some', 'region', 'of', 'the', 'phase', 'diagram']] | [-0.1909409014202538, 0.2099440540361684, -0.06047742091832333, 0.08380287002946715, -0.06464042765146587, -0.12550650684861467, 0.02530143795738695, 0.3853727933485061, -0.21840211495291442, -0.31143714288191404, 0.05413738401257433, -0.2896257239248371, -0.11929646495264024, 0.14725291403883603, 0.10104342087543046, -0.027669140237958346, -0.0055955441843252626, 0.0801240088090708, -0.095819731746451, -0.21943974981550127, 0.26602667550323533, 0.005224756701500155, 0.2690499151009135, 0.06644340979401023, 0.03244385499274358, 0.006942471355432645, 0.10813630416523665, 0.07763602047925815, -0.13883917926186767, -0.004482245278632035, 0.20980838738687452, -0.07608970791479805, 0.18385103539330885, -0.4414593986934051, -0.29027208308689295, 0.08267388519016095, 0.12248761863447725, 0.1661068125249585, -0.07926191126607592, -0.3034980250406079, 0.027370183786842972, -0.16099784433608874, -0.12687794453304377, -0.12009620290482417, -0.020772277112700976, -0.0005014881913666614, -0.2778713202686049, 0.10345261820293672, 0.09358816475141793, 0.11481642278376966, -0.1060565538064111, -0.1294714792398736, -0.029173215822083876, 0.1118733741575852, 0.07704419417277678, 0.09230830694432371, 0.08580510084284469, -0.15115674747503363, -0.09234620534116403, 0.3736669676378369, -0.048860413013608196, -0.13188015753403307, 0.1738509361166507, -0.18029319959459827, -0.138624542823527, 0.17472518822178246, 0.0797204278409481, 0.07070800137007609, -0.1692677491111681, 0.1637012156559649, 0.013829267706023529, 0.14928153140936046, -0.01579505952249747, 0.037990320478274955, 0.2104973539710045, 0.12043105890043079, -0.00943672925059218, 0.1113461773522431, -0.06559682931401767, -0.19140752571402117, -0.24478712698910385, -0.06757583510479889, -0.19512652872945183, 0.007913013081997633, -0.10607138588638917, -0.1532826092396135, 0.3498141351097729, 0.2157599342695903, 0.1901012439513579, -0.03345595590362791, 0.2749112098943442, 0.13649328150204382, 0.07290069300797768, 0.05743616867111996, 0.3541747984862013, 0.20826032810437028, 0.10420663569821045, -0.23545034033304546, 0.08140732165775262, 0.04682686247979291] |
1,802.07173 | Existence of the gauge for fractional Laplacian Schr\"{o}dinger
operators | Let $\Omega \subseteq \mathbb{R}^n$ be an open set, where $n \geq 2$. Suppose
$\omega $ is a locally finite Borel measure on $\Omega$. For $\alpha \in
(0,2)$, define the fractional Laplacian $(-\triangle )^{\alpha/2}$ via the
Fourier transform on $\mathbb{R}^n$, and let $G $ be the corresponding Green's
operator of order $\alpha$ on $\Omega$. Define $T(u) = G(u \omega).$ If $\Vert
T \Vert_{L^2(\omega) \rightarrow L^2 (\omega)} <1$, we obtain a representation
for the unique weak solution $u$ in the homogeneous Sobolev space $L^{\alpha/2,
2}_0 (\Omega)$ of
\[ (-\triangle)^{\alpha/2} u = u \omega + \nu \,\,\, \mbox{on} \,\,\, \Omega,
\,\,\, u=0 \,\,\, \mbox{on} \,\,\, \Omega^c, \] for $\nu$ in the dual Sobolev
space $L^{-\alpha/2, 2} (\Omega)$. If $\Omega$ is a bounded $C^{1,1}$ domain,
this representation yields matching exponential upper and lower pointwise
estimates for the solution when $\nu = \chi_{\Omega}$. These estimates are used
to study the existence of a solution $u_1$ (called the "gauge") of the integral
equation $u_1=1+G(u_1 \omega)$ corresponding to the problem \[
(-\triangle)^{\alpha/2} u = u \omega \,\,\, \mbox{on} \,\,\, \Omega, \,\,\, u
\geq 0 \,\,\, \mbox{on} \,\,\, \Omega, \,\,\, u=1 \,\,\, \mbox{on} \,\,\,
\Omega^c . \] We show that if $\Vert T \Vert <1$, then $u_1$ always exists if
$0<\alpha <1$. For $1 \leq \alpha <2$, a solution exists if the norm of $T$ is
sufficiently small. We also show that the condition $\Vert T \Vert <1$ does not
imply the existence of a solution if $1 < \alpha <2$.
| math.AP math.CA | let omega subseteq mathbbrn be an open set where n geq 2 suppose omega is a locally finite borel measure on omega for alpha in 02 define the fractional laplacian triangle alpha2 via the fourier transform on mathbbrn and let g be the corresponding greens operator of order alpha on omega define tu gu omega if vert t vert_l2omega rightarrow l2 omega 1 we obtain a representation for the unique weak solution u in the homogeneous sobolev space lalpha2 2_0 omega of trianglealpha2 u u omega nu mboxon omega u0 mboxon omegac for nu in the dual sobolev space lalpha2 2 omega if omega is a bounded c11 domain this representation yields matching exponential upper and lower pointwise estimates for the solution when nu chi_omega these estimates are used to study the existence of a solution u_1 called the gauge of the integral equation u_11gu_1 omega corresponding to the problem trianglealpha2 u u omega mboxon omega u geq 0 mboxon omega u1 mboxon omegac we show that if vert t vert 1 then u_1 always exists if 0alpha 1 for 1 leq alpha 2 a solution exists if the norm of t is sufficiently small we also show that the condition vert t vert 1 does not imply the existence of a solution if 1 alpha 2 | [['let', 'omega', 'subseteq', 'mathbbrn', 'be', 'an', 'open', 'set', 'where', 'n', 'geq', '2', 'suppose', 'omega', 'is', 'a', 'locally', 'finite', 'borel', 'measure', 'on', 'omega', 'for', 'alpha', 'in', '02', 'define', 'the', 'fractional', 'laplacian', 'triangle', 'alpha2', 'via', 'the', 'fourier', 'transform', 'on', 'mathbbrn', 'and', 'let', 'g', 'be', 'the', 'corresponding', 'greens', 'operator', 'of', 'order', 'alpha', 'on', 'omega', 'define', 'tu', 'gu', 'omega', 'if', 'vert', 't', 'vert_l2omega', 'rightarrow', 'l2', 'omega', '1', 'we', 'obtain', 'a', 'representation', 'for', 'the', 'unique', 'weak', 'solution', 'u', 'in', 'the', 'homogeneous', 'sobolev', 'space', 'lalpha2', '2_0', 'omega', 'of', 'trianglealpha2', 'u', 'u', 'omega', 'nu', 'mboxon', 'omega', 'u0', 'mboxon', 'omegac', 'for', 'nu', 'in', 'the', 'dual', 'sobolev', 'space', 'lalpha2', '2', 'omega', 'if', 'omega', 'is', 'a', 'bounded', 'c11', 'domain', 'this', 'representation', 'yields', 'matching', 'exponential', 'upper', 'and', 'lower', 'pointwise', 'estimates', 'for', 'the', 'solution', 'when', 'nu', 'chi_omega', 'these', 'estimates', 'are', 'used', 'to', 'study', 'the', 'existence', 'of', 'a', 'solution', 'u_1', 'called', 'the', 'gauge', 'of', 'the', 'integral', 'equation', 'u_11gu_1', 'omega', 'corresponding', 'to', 'the', 'problem', 'trianglealpha2', 'u', 'u', 'omega', 'mboxon', 'omega', 'u', 'geq', '0', 'mboxon', 'omega', 'u1', 'mboxon', 'omegac', 'we', 'show', 'that', 'if', 'vert', 't', 'vert', '1', 'then', 'u_1', 'always', 'exists', 'if', '0alpha', '1', 'for', '1', 'leq', 'alpha', '2', 'a', 'solution', 'exists', 'if', 'the', 'norm', 'of', 't', 'is', 'sufficiently', 'small', 'we', 'also', 'show', 'that', 'the', 'condition', 'vert', 't', 'vert', '1', 'does', 'not', 'imply', 'the', 'existence', 'of', 'a', 'solution', 'if', '1', 'alpha', '2']] | [-0.21456303305501798, 0.13987830982748342, -0.009022056437494607, 0.02049284123828652, -0.08146262914921532, -0.2005842936292691, 0.01195777555118167, 0.3368623222607388, -0.34508703920607253, -0.12499180456153422, 0.10077810193064936, -0.384330881306919, -0.025440012275896286, 0.1315077937901168, -0.029117538506669975, -0.011344172060489655, 0.022286383382906425, 0.15198799565208154, -0.042078709401729926, -0.14570678782727675, 0.329931526338229, -0.22252042809605738, 0.14160964080506813, 0.05809522064176397, 0.08192299895976435, -0.07159375342340252, 0.09727491414452964, -0.05640581231830842, -0.33574786218391595, 0.020409294299098064, 0.2093591829206986, 0.11605807876640878, 0.334016289031046, -0.3029491526866767, -0.10475669853894093, 0.2381878816522658, 0.18560496993062617, -0.16918950142321465, 0.03313103798618018, -0.3409358061998038, 0.1927102977066153, -0.06093906896802483, -0.17186235902432753, -0.053786145453558906, 0.19863671058284066, 0.019477154825657397, -0.44168580314100975, 0.11252725473700295, 0.10811470704758104, -0.03338585807476737, -0.1019075776093474, -0.2114988428357745, -0.03544672537338267, 0.03189154066785704, -0.023564877923116713, 0.26654981315531984, -0.003090765962603493, -0.0803773726856719, 0.009717682060985782, 0.3434432654023588, -0.14991839565217024, -0.32681885495712265, 0.03953894362436764, -0.2899617537549832, -0.1416224216341659, 0.06727715315532252, 0.06268221697830986, 0.19490543008068245, -0.03375559438067047, 0.3489766913356268, -0.08816241687511868, 0.20369935301339218, 0.12675858124498732, 0.00295387770736886, -0.008139352614460426, 0.08118083672467445, 0.2014386572463821, 0.035436836246479406, -0.03900932630188937, 0.09193756901354433, -0.45436277388481894, -0.10051579026518408, -0.16969035360331117, 0.20501432168003983, -0.12562978938948166, -0.14506010347803203, 0.21469265823121939, 0.023802705476861273, 0.19677471632146598, 0.0762721062028589, 0.15672501127309574, 0.1646368641349314, -0.06608196063060749, 0.14448804284889163, 0.04314374540841085, 0.1393894403879139, 0.07179258338602207, -0.2505276678869866, -0.03904313416324695, 0.1637524685358806] |
1,802.07174 | Soft-photon corrections to the Bethe-Heitler process in the $\gamma
p\rightarrow l^+l^-p$ reaction | We report on the calculation of first-order QED corrections for the $\gamma
p\rightarrow l^+l^-p^{\prime}$ process. An upcoming experiment at MAMI (Mainz)
aims to compare the cross sections of muon- and electron-pair production in
this reaction to test lepton universality. Precise knowledge of the
electromagnetic radiative corrections is needed for these measurements. As a
first step, we present the leading QED radiative corrections in the soft-photon
approximation when accounting for the finite lepton mass. For the kinematics at
MAMI, we find corrections of the percent level for muons, and of order $10\%$
for electrons.
| hep-ph nucl-ex nucl-th | we report on the calculation of firstorder qed corrections for the gamma prightarrow llpprime process an upcoming experiment at mami mainz aims to compare the cross sections of muon and electronpair production in this reaction to test lepton universality precise knowledge of the electromagnetic radiative corrections is needed for these measurements as a first step we present the leading qed radiative corrections in the softphoton approximation when accounting for the finite lepton mass for the kinematics at mami we find corrections of the percent level for muons and of order 10 for electrons | [['we', 'report', 'on', 'the', 'calculation', 'of', 'firstorder', 'qed', 'corrections', 'for', 'the', 'gamma', 'prightarrow', 'llpprime', 'process', 'an', 'upcoming', 'experiment', 'at', 'mami', 'mainz', 'aims', 'to', 'compare', 'the', 'cross', 'sections', 'of', 'muon', 'and', 'electronpair', 'production', 'in', 'this', 'reaction', 'to', 'test', 'lepton', 'universality', 'precise', 'knowledge', 'of', 'the', 'electromagnetic', 'radiative', 'corrections', 'is', 'needed', 'for', 'these', 'measurements', 'as', 'a', 'first', 'step', 'we', 'present', 'the', 'leading', 'qed', 'radiative', 'corrections', 'in', 'the', 'softphoton', 'approximation', 'when', 'accounting', 'for', 'the', 'finite', 'lepton', 'mass', 'for', 'the', 'kinematics', 'at', 'mami', 'we', 'find', 'corrections', 'of', 'the', 'percent', 'level', 'for', 'muons', 'and', 'of', 'order', '10', 'for', 'electrons']] | [-0.01789302901243386, 0.1902893645115989, -0.018214470245331304, 0.13957848516112947, 0.007972759174425964, -0.07694644564459019, 0.05030505439398163, 0.31033779630113556, -0.14414892191290046, -0.3033925873156556, -0.0401307445439591, -0.38153924612814316, 0.054097281989094845, 0.1736382483555328, 0.1114329544969065, 0.14801740354817847, 0.07251873383622455, -0.00734473085132144, -0.07532009338636113, -0.1777848629179694, 0.32488842901733256, 0.1550768692775265, 0.20580935778865672, 0.1897170710903795, 0.08600156573052316, -0.0014892702608409784, -0.0723632820344115, -0.09031407004627197, -0.13990340291765396, 0.032979474792702364, 0.252642455224502, 0.04677202131690295, 0.13474301169828876, -0.42568449721590657, -0.086138384889953, 0.07904593508346411, 0.12089847714599708, 0.15435156165419714, -0.06675865443084268, -0.24546773034228903, 0.07991936587242653, -0.21287998634026103, -0.13819122970428155, -0.07862675419765645, -0.0028137804474681616, -0.06448303737029758, -0.35678507469634974, 0.03560455194573202, -0.02492507246484899, 0.02512151120564617, -0.027105487136514454, -0.16036147478481996, 0.04524090419948587, 0.11626837899530074, 0.07505456540124926, 0.04521289491410995, 0.14343039844812744, -0.16896822732498706, -0.18332302531369193, 0.45376081817338, -0.07438034753684643, -0.14398929085987416, 0.06969348437395757, -0.2872854292736915, -0.17344636261797228, 0.169878288820062, 0.23755315356918247, 0.1112376539657935, -0.1765441321965583, 0.10641053789067487, 0.04519788087497506, 0.1449966640186334, 0.05571140104945263, -0.01452641810654946, 0.14132709704015567, 0.19654009342649142, -0.015280169718291449, 0.07673040196380537, -0.15645291899462513, -0.022669722194499944, -0.4608748027973849, -0.164416062200199, -0.06054496635561404, 0.10056977123578849, -0.03659695041009716, -0.09755210974443522, 0.3517020991395997, 0.1284421771339586, 0.18298269823350458, 0.052589412902623575, 0.3767278171346887, 0.14212128593024556, 0.06359221751336008, 0.02770613337887208, 0.33959592558676377, 0.16391126185898547, 0.11911159733553296, -0.29202751528329984, 0.04392846609445532, 0.07664821042841219] |
1,802.07175 | The parameterized complexity of finding a 2-sphere in a simplicial
complex | We consider the problem of finding a subcomplex K' of a simplicial complex K
such that K' is homeomorphic to the 2-dimensional sphere, S^2. We study two
variants of this problem. The first asks if there exists such a K' with at most
k triangles, and we show that this variant is W[1]-hard and, assuming ETH,
admits no O(n^{o(sqrt(k))}) time algorithm. We also give an algorithm that is
tight with regards to this lower bound. The second problem is the dual of the
first, and asks if K' can be found by removing at most k triangles from K. This
variant has an immediate O(3^k poly(|K|)) time algorithm, and we show that it
admits a polynomial kernelization to O(k^2) triangles, as well as a polynomial
compression to a weighted version with bit-size O(k log k).
| cs.DS math.CO | we consider the problem of finding a subcomplex k of a simplicial complex k such that k is homeomorphic to the 2dimensional sphere s2 we study two variants of this problem the first asks if there exists such a k with at most k triangles and we show that this variant is w1hard and assuming eth admits no onosqrtk time algorithm we also give an algorithm that is tight with regards to this lower bound the second problem is the dual of the first and asks if k can be found by removing at most k triangles from k this variant has an immediate o3k polyk time algorithm and we show that it admits a polynomial kernelization to ok2 triangles as well as a polynomial compression to a weighted version with bitsize ok log k | [['we', 'consider', 'the', 'problem', 'of', 'finding', 'a', 'subcomplex', 'k', 'of', 'a', 'simplicial', 'complex', 'k', 'such', 'that', 'k', 'is', 'homeomorphic', 'to', 'the', '2dimensional', 'sphere', 's2', 'we', 'study', 'two', 'variants', 'of', 'this', 'problem', 'the', 'first', 'asks', 'if', 'there', 'exists', 'such', 'a', 'k', 'with', 'at', 'most', 'k', 'triangles', 'and', 'we', 'show', 'that', 'this', 'variant', 'is', 'w1hard', 'and', 'assuming', 'eth', 'admits', 'no', 'onosqrtk', 'time', 'algorithm', 'we', 'also', 'give', 'an', 'algorithm', 'that', 'is', 'tight', 'with', 'regards', 'to', 'this', 'lower', 'bound', 'the', 'second', 'problem', 'is', 'the', 'dual', 'of', 'the', 'first', 'and', 'asks', 'if', 'k', 'can', 'be', 'found', 'by', 'removing', 'at', 'most', 'k', 'triangles', 'from', 'k', 'this', 'variant', 'has', 'an', 'immediate', 'o3k', 'polyk', 'time', 'algorithm', 'and', 'we', 'show', 'that', 'it', 'admits', 'a', 'polynomial', 'kernelization', 'to', 'ok2', 'triangles', 'as', 'well', 'as', 'a', 'polynomial', 'compression', 'to', 'a', 'weighted', 'version', 'with', 'bitsize', 'ok', 'log', 'k']] | [-0.16964027667835133, 0.07390475984330032, -0.06937520610474383, 0.0274823347520111, -0.08450642916193205, -0.1772072835297171, 0.07400918345717686, 0.37720007737820493, -0.31723420126815394, -0.30681901295850084, 0.08470796602222123, -0.3060425979905386, -0.18252045194159694, 0.15822974294285053, -0.056076013086947485, 0.0013941895553786585, 0.054474251358700335, 0.12475029728027867, -0.04156946355421374, -0.32084843576990013, 0.26404478380442664, 0.004480714796792104, 0.13187032005464686, 0.09595918966415547, 0.1075066538986319, 0.007626489388631351, 0.05161435590751136, 0.06735377844923468, -0.17944816367482636, 0.05146780704693702, 0.2682645121909011, 0.19251280685247324, 0.2690132561959882, -0.3617930529055311, -0.13516390181855478, 0.2344602998624097, 0.13498227621790077, 0.06114210906341227, 0.004264292003128177, -0.1698716219041997, 0.16321863508053513, -0.039110661206294355, -0.08891023523973496, -0.027628278556113033, 0.08348312398502186, -0.0863013861721743, -0.27716614547838914, 0.0033514944907302147, 0.135511544589544, 0.028260425661009416, -0.0013500836038433793, -0.15420145769395047, 0.04039710478461, 0.040816458296586776, -0.01340071771227852, 0.12364185351788053, 0.00933913082412597, -0.06756747267973512, -0.13991422273232532, 0.4239883270642873, -0.09858607863937852, -0.1519182159898997, 0.13261665651268922, -0.11049997278857532, -0.17879645575407838, 0.14115728891051527, 0.09192386985436748, 0.18578177951832317, -0.06067983589852715, 0.16930428942241496, -0.1902276716653758, 0.17500455685849511, 0.1207561734021266, -0.02775780230833551, 0.10153438690910811, 0.14548215067792516, 0.20019483944373345, 0.21053937062840047, -0.030273810873475315, -0.009049141157501892, -0.2761705510888193, -0.16366148176959217, -0.19886921077389827, 0.07362331814869348, -0.1460887849354359, -0.15675717388599444, 0.3007849282932593, 0.08969744476107464, 0.2477607244370269, 0.13741515952148545, 0.2854123483577034, 0.11401433537457027, 0.013953562355044283, 0.19581917271629642, 0.10666580390490925, 0.11895623913125149, -0.00014020473376583697, -0.19248524181038287, 0.04963197891683832, 0.14704219987198933] |
1,802.07176 | Adaptive Sampling for Coarse Ranking | We consider the problem of active coarse ranking, where the goal is to sort
items according to their means into clusters of pre-specified sizes, by
adaptively sampling from their reward distributions. This setting is useful in
many social science applications involving human raters and the approximate
rank of every item is desired. Approximate or coarse ranking can significantly
reduce the number of ratings required in comparison to the number needed to
find an exact ranking. We propose a computationally efficient PAC algorithm
LUCBRank for coarse ranking, and derive an upper bound on its sample
complexity. We also derive a nearly matching distribution-dependent lower
bound. Experiments on synthetic as well as real-world data show that LUCBRank
performs better than state-of-the-art baseline methods, even when these methods
have the advantage of knowing the underlying parametric model.
| cs.LG stat.ML | we consider the problem of active coarse ranking where the goal is to sort items according to their means into clusters of prespecified sizes by adaptively sampling from their reward distributions this setting is useful in many social science applications involving human raters and the approximate rank of every item is desired approximate or coarse ranking can significantly reduce the number of ratings required in comparison to the number needed to find an exact ranking we propose a computationally efficient pac algorithm lucbrank for coarse ranking and derive an upper bound on its sample complexity we also derive a nearly matching distributiondependent lower bound experiments on synthetic as well as realworld data show that lucbrank performs better than stateoftheart baseline methods even when these methods have the advantage of knowing the underlying parametric model | [['we', 'consider', 'the', 'problem', 'of', 'active', 'coarse', 'ranking', 'where', 'the', 'goal', 'is', 'to', 'sort', 'items', 'according', 'to', 'their', 'means', 'into', 'clusters', 'of', 'prespecified', 'sizes', 'by', 'adaptively', 'sampling', 'from', 'their', 'reward', 'distributions', 'this', 'setting', 'is', 'useful', 'in', 'many', 'social', 'science', 'applications', 'involving', 'human', 'raters', 'and', 'the', 'approximate', 'rank', 'of', 'every', 'item', 'is', 'desired', 'approximate', 'or', 'coarse', 'ranking', 'can', 'significantly', 'reduce', 'the', 'number', 'of', 'ratings', 'required', 'in', 'comparison', 'to', 'the', 'number', 'needed', 'to', 'find', 'an', 'exact', 'ranking', 'we', 'propose', 'a', 'computationally', 'efficient', 'pac', 'algorithm', 'lucbrank', 'for', 'coarse', 'ranking', 'and', 'derive', 'an', 'upper', 'bound', 'on', 'its', 'sample', 'complexity', 'we', 'also', 'derive', 'a', 'nearly', 'matching', 'distributiondependent', 'lower', 'bound', 'experiments', 'on', 'synthetic', 'as', 'well', 'as', 'realworld', 'data', 'show', 'that', 'lucbrank', 'performs', 'better', 'than', 'stateoftheart', 'baseline', 'methods', 'even', 'when', 'these', 'methods', 'have', 'the', 'advantage', 'of', 'knowing', 'the', 'underlying', 'parametric', 'model']] | [-0.023896936458847697, 0.04316953521695475, -0.06275901397351515, 0.1263174009315359, -0.12123989492167973, -0.1504210734574096, 0.11175968852881907, 0.44381902703422715, -0.2504702230993037, -0.40132439303014317, 0.0785058502613703, -0.24656716738051423, -0.143962765424724, 0.19632871098336624, -0.10396033869774053, 0.0776816653788873, 0.07869204033561276, 0.08787712034289584, -0.0523333304798033, -0.33804124723379075, 0.27568673930716503, 0.08405475959245284, 0.306965565395358, -0.006500212585017311, 0.08983838398125954, 0.008596091093667465, -0.05675940026148138, 0.03506678019452507, -0.1211195729647443, 0.161055050131946, 0.2984468819446523, 0.22385344218293374, 0.3527974875636794, -0.39834410629704176, -0.1511156653075225, 0.14674142858535616, 0.1377337329419485, 0.11266483629129431, -0.01643231832316484, -0.2701140030950421, 0.09718160761897734, -0.1456625142847329, -0.030663052753714674, -0.1278604658630987, -0.01886862461282307, 0.018522705324523322, -0.3329193538379376, 0.03559450324907878, 0.039726486578178025, 0.02930978062420653, -0.036111460793163686, -0.16714389119861703, 0.025080733600947442, 0.16791735261887714, 0.02876414898536027, 0.004076094218445095, 0.12175434971339366, -0.15235669741752755, -0.14363823980304666, 0.3951490890434467, -0.026493032190046506, -0.210507712432776, 0.19492373883964098, -0.06034925547569538, -0.13000998111215956, 0.12473319284617901, 0.24029408137765573, 0.14108223557691832, -0.11443090969734124, 0.03490580278219457, -0.10383573224923263, 0.19974660212315168, 0.040385457173794166, 0.025959958107154252, 0.1229445441576624, 0.19464152640571367, 0.16065954317640385, 0.15100584055339408, -0.05263337703901484, -0.07264597674436642, -0.21402967142851345, -0.11243067799968588, -0.22355421828670483, 0.011340100720355456, -0.17107906438137765, -0.15046388779018977, 0.3552928889226733, 0.20058429305208847, 0.2113859954318314, 0.13815049282063477, 0.34597561983250535, 0.08147719447945499, 0.02018885528245433, 0.11244556349067186, 0.16947902970820328, 0.02564506926467981, 0.03128588556975239, -0.17216193498902474, 0.14026111413047396, 0.0809520670886603] |
1,802.07177 | Wireless Expanders | This paper introduces an extended notion of expansion suitable for radio
networks. A graph $G=(V,E)$ is called an $(\alpha_w, \beta_w)$-{wireless
expander} if for every subset $S \subseteq V$ s.t. $|S|\leq \alpha_w \cdot
|V|$, there exists a subset $S'\subseteq S$ s.t. there are at least $\beta_w
\cdot |S|$ vertices in $V\backslash S$ adjacent in $G$ to exactly one vertex in
$S'$. The main question we ask is the following: to what extent are ordinary
expanders also good {wireless} expanders? We answer this question in a nearly
tight manner. On the positive side, we show that any $(\alpha, \beta)$-expander
with maximum degree $\Delta$ and $\beta\geq 1/\Delta$ is also a $(\alpha_w,
\beta_w)$ wireless expander for $\beta_w = \Omega(\beta / \log (2 \cdot
\min\{\Delta / \beta, \Delta \cdot \beta\}))$. Thus the wireless expansion is
smaller than the ordinary expansion by at most a factor logarithmic in
$\min\{\Delta / \beta, \Delta \cdot \beta\}$, which depends on the graph
\emph{average degree} rather than maximum degree; e.g., for low arboricity
graphs, the wireless expansion matches the ordinary expansion up to a constant.
We complement this positive result by presenting an explicit construction of a
"bad" $(\alpha, \beta)$-expander for which the wireless expansion is $\beta_w =
O(\beta / \log (2 \cdot \min\{\Delta / \beta, \Delta \cdot \beta\})$.
We also analyze the theoretical properties of wireless expanders and their
connection to unique neighbor expanders, and demonstrate their applicability:
Our results yield improved bounds for the {spokesmen election problem} that was
introduced in the seminal paper of Chlamtac and Weinstein (1991) to devise
efficient broadcasting for multihop radio networks. Our negative result yields
a significantly simpler proof than that from the seminal paper of Kushilevitz
and Mansour (1998) for a lower bound on the broadcast time in radio networks.
| cs.DS | this paper introduces an extended notion of expansion suitable for radio networks a graph gve is called an alpha_w beta_wwireless expander if for every subset s subseteq v st sleq alpha_w cdot v there exists a subset ssubseteq s st there are at least beta_w cdot s vertices in vbackslash s adjacent in g to exactly one vertex in s the main question we ask is the following to what extent are ordinary expanders also good wireless expanders we answer this question in a nearly tight manner on the positive side we show that any alpha betaexpander with maximum degree delta and betageq 1delta is also a alpha_w beta_w wireless expander for beta_w omegabeta log 2 cdot mindelta beta delta cdot beta thus the wireless expansion is smaller than the ordinary expansion by at most a factor logarithmic in mindelta beta delta cdot beta which depends on the graph emphaverage degree rather than maximum degree eg for low arboricity graphs the wireless expansion matches the ordinary expansion up to a constant we complement this positive result by presenting an explicit construction of a bad alpha betaexpander for which the wireless expansion is beta_w obeta log 2 cdot mindelta beta delta cdot beta we also analyze the theoretical properties of wireless expanders and their connection to unique neighbor expanders and demonstrate their applicability our results yield improved bounds for the spokesmen election problem that was introduced in the seminal paper of chlamtac and weinstein 1991 to devise efficient broadcasting for multihop radio networks our negative result yields a significantly simpler proof than that from the seminal paper of kushilevitz and mansour 1998 for a lower bound on the broadcast time in radio networks | [['this', 'paper', 'introduces', 'an', 'extended', 'notion', 'of', 'expansion', 'suitable', 'for', 'radio', 'networks', 'a', 'graph', 'gve', 'is', 'called', 'an', 'alpha_w', 'beta_wwireless', 'expander', 'if', 'for', 'every', 'subset', 's', 'subseteq', 'v', 'st', 'sleq', 'alpha_w', 'cdot', 'v', 'there', 'exists', 'a', 'subset', 'ssubseteq', 's', 'st', 'there', 'are', 'at', 'least', 'beta_w', 'cdot', 's', 'vertices', 'in', 'vbackslash', 's', 'adjacent', 'in', 'g', 'to', 'exactly', 'one', 'vertex', 'in', 's', 'the', 'main', 'question', 'we', 'ask', 'is', 'the', 'following', 'to', 'what', 'extent', 'are', 'ordinary', 'expanders', 'also', 'good', 'wireless', 'expanders', 'we', 'answer', 'this', 'question', 'in', 'a', 'nearly', 'tight', 'manner', 'on', 'the', 'positive', 'side', 'we', 'show', 'that', 'any', 'alpha', 'betaexpander', 'with', 'maximum', 'degree', 'delta', 'and', 'betageq', '1delta', 'is', 'also', 'a', 'alpha_w', 'beta_w', 'wireless', 'expander', 'for', 'beta_w', 'omegabeta', 'log', '2', 'cdot', 'mindelta', 'beta', 'delta', 'cdot', 'beta', 'thus', 'the', 'wireless', 'expansion', 'is', 'smaller', 'than', 'the', 'ordinary', 'expansion', 'by', 'at', 'most', 'a', 'factor', 'logarithmic', 'in', 'mindelta', 'beta', 'delta', 'cdot', 'beta', 'which', 'depends', 'on', 'the', 'graph', 'emphaverage', 'degree', 'rather', 'than', 'maximum', 'degree', 'eg', 'for', 'low', 'arboricity', 'graphs', 'the', 'wireless', 'expansion', 'matches', 'the', 'ordinary', 'expansion', 'up', 'to', 'a', 'constant', 'we', 'complement', 'this', 'positive', 'result', 'by', 'presenting', 'an', 'explicit', 'construction', 'of', 'a', 'bad', 'alpha', 'betaexpander', 'for', 'which', 'the', 'wireless', 'expansion', 'is', 'beta_w', 'obeta', 'log', '2', 'cdot', 'mindelta', 'beta', 'delta', 'cdot', 'beta', 'we', 'also', 'analyze', 'the', 'theoretical', 'properties', 'of', 'wireless', 'expanders', 'and', 'their', 'connection', 'to', 'unique', 'neighbor', 'expanders', 'and', 'demonstrate', 'their', 'applicability', 'our', 'results', 'yield', 'improved', 'bounds', 'for', 'the', 'spokesmen', 'election', 'problem', 'that', 'was', 'introduced', 'in', 'the', 'seminal', 'paper', 'of', 'chlamtac', 'and', 'weinstein', '1991', 'to', 'devise', 'efficient', 'broadcasting', 'for', 'multihop', 'radio', 'networks', 'our', 'negative', 'result', 'yields', 'a', 'significantly', 'simpler', 'proof', 'than', 'that', 'from', 'the', 'seminal', 'paper', 'of', 'kushilevitz', 'and', 'mansour', '1998', 'for', 'a', 'lower', 'bound', 'on', 'the', 'broadcast', 'time', 'in', 'radio', 'networks']] | [-0.19078591425370958, 0.1178482253500988, -0.0055853755945073705, 0.02526413763657079, -0.06579865342355333, -0.2161938787055468, 0.07779009636568454, 0.3596170280793948, -0.2543701939006236, -0.2836356285626867, 0.035832065921152075, -0.32720033011033334, -0.1389353460050188, 0.16706693732786723, -0.07838089896499047, -0.016297789991118146, 0.032754995647285665, 0.06588931923574169, -0.025668080136944937, -0.26441022470098685, 0.24946209309190245, 0.05289318544257964, 0.18820095383811608, 0.07136944317524986, 0.0677206062246114, -0.01380935824709013, 0.012317810556331616, -0.018012584162144258, -0.22433995867039422, 0.08854769077443052, 0.24216181630119016, 0.1386628220273581, 0.2742965897029665, -0.3368494127289783, -0.1672968621102752, 0.16467171790094914, 0.14666130153774637, -0.01776484528839189, 0.012744366505025287, -0.20807588144504865, 0.14096774589810854, -0.15567627995016145, -0.10378090095140838, 0.014146878231050713, 0.12077407663621541, -0.016134845482052438, -0.33852315522131643, 0.0481659806209791, 0.09115550904202142, 0.003400381498587584, 0.06256618147100589, -0.17814370805031754, 0.04720287360562777, 0.058740487079402166, -0.04431141940198943, 0.1401058341476268, 0.000910083759767336, -0.09988090321338469, -0.1036768916019355, 0.33591338420020683, -0.07593420067314582, -0.13286987470429656, 0.08885894587063896, -0.1349751323095656, -0.1715503528701707, 0.09295893565951181, 0.11433513926624853, 0.15654223510563106, -0.08032545552788568, 0.16425144945793102, -0.07079591891462249, 0.17307665767231292, 0.1444893593667075, 0.0294693204291564, 0.06827227372227103, 0.12716408364108897, 0.15939081814763734, 0.08789120248735084, -2.4921574160024257e-05, -0.005204283470188135, -0.2834305806617652, -0.11387499070666049, -0.21591925267712214, 0.13786430100028935, -0.18966991670037844, -0.13762169793273124, 0.3523994279792532, 0.08910688715072215, 0.19399353273745093, 0.12344440470000596, 0.24814211790258664, 0.09107311010385664, -0.0005780589808377304, 0.20497089977475946, 0.14769210752232798, 0.1389519307729123, 0.06529617793525436, -0.16387775436326463, 0.07340856985455113, 0.11505900865304283] |
1,802.07178 | Primitive abundant and weird numbers with many prime factors | We give an algorithm to enumerate all primitive abundant numbers (briefly,
PANs) with a fixed $\Omega$ (the number of prime factors counted with their
multiplicity), and explicitly find all PANs up to $\Omega=6$, count all PANs
and square-free PANs up to $\Omega=7$ and count all odd PANs and odd
square-free PANs up to $\Omega=8$. We find primitive weird numbers (briefly,
PWNs) with up to 16 prime factors, improving the previous results of
[Amato-Hasler-Melfi-Parton] where PWNs with up to 6 prime factors have been
given. The largest PWN we find has 14712 digits: as far as we know, this is the
largest example existing, the previous one being 5328 digits long [Melfi]. We
find hundreds of PWNs with exactly one square odd prime factor: as far as we
know, only five were known before. We find all PWNs with at least one odd prime
factor with multiplicity greater than one and $\Omega = 7$ and prove that there
are none with $\Omega < 7$. Regarding PWNs with a cubic (or higher) odd prime
factor, we prove that there are none with $\Omega\le 7$, and we did not find
any with larger $\Omega$. Finally, we find several PWNs with 2 square odd prime
factors, and one with 3 square odd prime factors. These are the first such
examples.
| math.NT | we give an algorithm to enumerate all primitive abundant numbers briefly pans with a fixed omega the number of prime factors counted with their multiplicity and explicitly find all pans up to omega6 count all pans and squarefree pans up to omega7 and count all odd pans and odd squarefree pans up to omega8 we find primitive weird numbers briefly pwns with up to 16 prime factors improving the previous results of amatohaslermelfiparton where pwns with up to 6 prime factors have been given the largest pwn we find has 14712 digits as far as we know this is the largest example existing the previous one being 5328 digits long melfi we find hundreds of pwns with exactly one square odd prime factor as far as we know only five were known before we find all pwns with at least one odd prime factor with multiplicity greater than one and omega 7 and prove that there are none with omega 7 regarding pwns with a cubic or higher odd prime factor we prove that there are none with omegale 7 and we did not find any with larger omega finally we find several pwns with 2 square odd prime factors and one with 3 square odd prime factors these are the first such examples | [['we', 'give', 'an', 'algorithm', 'to', 'enumerate', 'all', 'primitive', 'abundant', 'numbers', 'briefly', 'pans', 'with', 'a', 'fixed', 'omega', 'the', 'number', 'of', 'prime', 'factors', 'counted', 'with', 'their', 'multiplicity', 'and', 'explicitly', 'find', 'all', 'pans', 'up', 'to', 'omega6', 'count', 'all', 'pans', 'and', 'squarefree', 'pans', 'up', 'to', 'omega7', 'and', 'count', 'all', 'odd', 'pans', 'and', 'odd', 'squarefree', 'pans', 'up', 'to', 'omega8', 'we', 'find', 'primitive', 'weird', 'numbers', 'briefly', 'pwns', 'with', 'up', 'to', '16', 'prime', 'factors', 'improving', 'the', 'previous', 'results', 'of', 'amatohaslermelfiparton', 'where', 'pwns', 'with', 'up', 'to', '6', 'prime', 'factors', 'have', 'been', 'given', 'the', 'largest', 'pwn', 'we', 'find', 'has', '14712', 'digits', 'as', 'far', 'as', 'we', 'know', 'this', 'is', 'the', 'largest', 'example', 'existing', 'the', 'previous', 'one', 'being', '5328', 'digits', 'long', 'melfi', 'we', 'find', 'hundreds', 'of', 'pwns', 'with', 'exactly', 'one', 'square', 'odd', 'prime', 'factor', 'as', 'far', 'as', 'we', 'know', 'only', 'five', 'were', 'known', 'before', 'we', 'find', 'all', 'pwns', 'with', 'at', 'least', 'one', 'odd', 'prime', 'factor', 'with', 'multiplicity', 'greater', 'than', 'one', 'and', 'omega', '7', 'and', 'prove', 'that', 'there', 'are', 'none', 'with', 'omega', '7', 'regarding', 'pwns', 'with', 'a', 'cubic', 'or', 'higher', 'odd', 'prime', 'factor', 'we', 'prove', 'that', 'there', 'are', 'none', 'with', 'omegale', '7', 'and', 'we', 'did', 'not', 'find', 'any', 'with', 'larger', 'omega', 'finally', 'we', 'find', 'several', 'pwns', 'with', '2', 'square', 'odd', 'prime', 'factors', 'and', 'one', 'with', '3', 'square', 'odd', 'prime', 'factors', 'these', 'are', 'the', 'first', 'such', 'examples']] | [-0.15351312863418742, 0.14587805314672767, 0.023054085465680274, 0.06700182052861367, -0.06425899564443777, -0.17830000881416103, -0.021401494020773543, 0.35688060165959457, -0.22813097522372291, -0.3737324701267339, 0.0913350113490153, -0.3468311444102299, -0.08989815228241718, 0.19781329436782039, -0.0003464058695715808, 0.0030939441303157113, 0.010743546732036131, 0.1467418535834267, -0.019111982469136517, -0.3661856764661414, 0.3001786756684028, -0.018950459813433036, 0.106451084513572, 0.018261305161840505, 0.07576266909184466, -0.029416742758448456, -0.01305614798135745, 0.000446704520644354, -0.16415130125526395, 0.057383345370735264, 0.2470643511252655, 0.10096680290797459, 0.2453166722109364, -0.3847325242257544, -0.10909545331794236, 0.19848419590686847, 0.16483365840034647, 0.04978263250419072, 0.00782247736372353, -0.12151642374783045, 0.20014264574939652, -0.19539420266990506, -0.17962893574897731, -0.08649900551175788, 0.08809081866361555, 0.03739862141332456, -0.2297872233625856, 0.01560283004516913, 0.06415169557024325, 0.12305623633077457, -0.013707710051953438, -0.28368785531991825, 0.0455393761139151, 0.13390609046244728, 0.06133103341950725, 0.03605037225809481, 0.015900619682811555, -0.10311469094317761, -0.1456863313383933, 0.3720648341767845, -0.020237461229789047, -0.16311090873288256, 0.1542597998177544, -0.2614077228875387, -0.18689804362754028, 0.17555231500771784, 0.06112194579493787, 0.07314810313816582, -0.01256413592823914, 0.034972328992028325, -0.10214612134510563, 0.1844393937477088, 0.16392948109257435, 0.006703288422986156, 0.1192383401472831, 0.08319537014744821, 0.03458392615984416, 0.128842946786123, -0.08327410649508238, 0.0382924074240561, -0.29896627139034015, -0.11599575011059642, -0.12485119580524043, 0.1399243961587975, -0.09850345819778297, -0.11346871060363593, 0.317089130046467, 0.08817451742610762, 0.18646560637502088, 0.08941574987866693, 0.2623745203816465, 0.09019450582785621, 0.11995723360949861, 0.16967552748835824, 0.16627904738166502, 0.07603234523752084, -0.028944882253805797, -0.11974696044787941, -0.03465078271969798, 0.03022934306146843] |
1,802.07179 | Finite temperature electronic structure of Diamond and Silicon | The electron-phonon interaction contribution to the electronic energies is
included in density functional total energy calculations with ab initio
pseudopotentials via the Allen formalism [Phys. Rev. B 18, 5217 (1978)] to
obtain temperature dependent electronic structure of diamond and silicon. This
method allows us to obtain the thermally-averaged ab initio electronic
structure in a straightforward and computationally inexpensive way. Our
investigations on the finite temperature electronic structure of diamond and
silicon lead to a new criterion, temperature transferability, which is required
in the ab initio pseudopotentials for temperature dependent studies. The
temperature transferability of the Troullier-Martins pseudopotentials used in
this work is strongly dependent on the cut-off radius and the inclusion of the
unbound 3d$^0$ state. The finite temperature indirect band gaps are highly
sensitive to the choice of cut-off radius used in the pseudopotentials. The
finite temperature band structures and density of states show that thermal
vibrations affect the electron energies throughout the valence and conduction
band. We compare our results on the band gap shifts with that due to the
Debye-Waller term in the Allen-Heine theory and discuss the observed
differences in the zero point and high temperature band gap shifts. Although,
the electron energy shifts in the highest occupied valence band and lowest
unoccupied conduction band enable to obtain the changes in the indirect and
direct band gaps at finite temperatures, the shifts in other electronic levels
with temperature enable investigations into the finite temperature valence
charge distribution in the bonding region. Thus, we demonstrate that the Allen
theory provides a simple and theoretically justified formalism to obtain finite
temperature valence electron charge densities that go beyond the rigid
pseudo-atom approximation.
| cond-mat.mtrl-sci | the electronphonon interaction contribution to the electronic energies is included in density functional total energy calculations with ab initio pseudopotentials via the allen formalism phys rev b 18 5217 1978 to obtain temperature dependent electronic structure of diamond and silicon this method allows us to obtain the thermallyaveraged ab initio electronic structure in a straightforward and computationally inexpensive way our investigations on the finite temperature electronic structure of diamond and silicon lead to a new criterion temperature transferability which is required in the ab initio pseudopotentials for temperature dependent studies the temperature transferability of the troulliermartins pseudopotentials used in this work is strongly dependent on the cutoff radius and the inclusion of the unbound 3d0 state the finite temperature indirect band gaps are highly sensitive to the choice of cutoff radius used in the pseudopotentials the finite temperature band structures and density of states show that thermal vibrations affect the electron energies throughout the valence and conduction band we compare our results on the band gap shifts with that due to the debyewaller term in the allenheine theory and discuss the observed differences in the zero point and high temperature band gap shifts although the electron energy shifts in the highest occupied valence band and lowest unoccupied conduction band enable to obtain the changes in the indirect and direct band gaps at finite temperatures the shifts in other electronic levels with temperature enable investigations into the finite temperature valence charge distribution in the bonding region thus we demonstrate that the allen theory provides a simple and theoretically justified formalism to obtain finite temperature valence electron charge densities that go beyond the rigid pseudoatom approximation | [['the', 'electronphonon', 'interaction', 'contribution', 'to', 'the', 'electronic', 'energies', 'is', 'included', 'in', 'density', 'functional', 'total', 'energy', 'calculations', 'with', 'ab', 'initio', 'pseudopotentials', 'via', 'the', 'allen', 'formalism', 'phys', 'rev', 'b', '18', '5217', '1978', 'to', 'obtain', 'temperature', 'dependent', 'electronic', 'structure', 'of', 'diamond', 'and', 'silicon', 'this', 'method', 'allows', 'us', 'to', 'obtain', 'the', 'thermallyaveraged', 'ab', 'initio', 'electronic', 'structure', 'in', 'a', 'straightforward', 'and', 'computationally', 'inexpensive', 'way', 'our', 'investigations', 'on', 'the', 'finite', 'temperature', 'electronic', 'structure', 'of', 'diamond', 'and', 'silicon', 'lead', 'to', 'a', 'new', 'criterion', 'temperature', 'transferability', 'which', 'is', 'required', 'in', 'the', 'ab', 'initio', 'pseudopotentials', 'for', 'temperature', 'dependent', 'studies', 'the', 'temperature', 'transferability', 'of', 'the', 'troulliermartins', 'pseudopotentials', 'used', 'in', 'this', 'work', 'is', 'strongly', 'dependent', 'on', 'the', 'cutoff', 'radius', 'and', 'the', 'inclusion', 'of', 'the', 'unbound', '3d0', 'state', 'the', 'finite', 'temperature', 'indirect', 'band', 'gaps', 'are', 'highly', 'sensitive', 'to', 'the', 'choice', 'of', 'cutoff', 'radius', 'used', 'in', 'the', 'pseudopotentials', 'the', 'finite', 'temperature', 'band', 'structures', 'and', 'density', 'of', 'states', 'show', 'that', 'thermal', 'vibrations', 'affect', 'the', 'electron', 'energies', 'throughout', 'the', 'valence', 'and', 'conduction', 'band', 'we', 'compare', 'our', 'results', 'on', 'the', 'band', 'gap', 'shifts', 'with', 'that', 'due', 'to', 'the', 'debyewaller', 'term', 'in', 'the', 'allenheine', 'theory', 'and', 'discuss', 'the', 'observed', 'differences', 'in', 'the', 'zero', 'point', 'and', 'high', 'temperature', 'band', 'gap', 'shifts', 'although', 'the', 'electron', 'energy', 'shifts', 'in', 'the', 'highest', 'occupied', 'valence', 'band', 'and', 'lowest', 'unoccupied', 'conduction', 'band', 'enable', 'to', 'obtain', 'the', 'changes', 'in', 'the', 'indirect', 'and', 'direct', 'band', 'gaps', 'at', 'finite', 'temperatures', 'the', 'shifts', 'in', 'other', 'electronic', 'levels', 'with', 'temperature', 'enable', 'investigations', 'into', 'the', 'finite', 'temperature', 'valence', 'charge', 'distribution', 'in', 'the', 'bonding', 'region', 'thus', 'we', 'demonstrate', 'that', 'the', 'allen', 'theory', 'provides', 'a', 'simple', 'and', 'theoretically', 'justified', 'formalism', 'to', 'obtain', 'finite', 'temperature', 'valence', 'electron', 'charge', 'densities', 'that', 'go', 'beyond', 'the', 'rigid', 'pseudoatom', 'approximation']] | [-0.0762146497485194, 0.16973847235947248, -0.07886992186056382, 0.055274265767737925, -0.0210891531535635, -0.08251333722749549, 0.14665860390837854, 0.41870354912345753, -0.2481244013586972, -0.3043856906439484, -0.042636409021207015, -0.30566955930609674, -0.0760648321278774, 0.12869896610559772, 0.050291550730547974, 0.013405331699381563, 0.02379964135695983, -0.041264866704136524, -0.1337955244459946, -0.16036858974130022, 0.26053167157976403, 0.1187890822570907, 0.29199509777767707, 0.19334144516122345, -0.006418468147274285, 0.032500451741685726, 0.044979990493968454, 0.015077626096411017, -0.18164959334896666, 0.10448342509531411, 0.29211231972363666, -0.07111101607744494, 0.22460960479449807, -0.4380312815179409, -0.21529123094102817, -0.010774603162817385, 0.061891259185385204, 0.1392839708408837, -0.018840193586597342, -0.24040123918875508, 0.022896523150635787, -0.18384634790029444, -0.15953714564700958, -0.12615650204982418, 0.016008451074552146, -0.012370000042728264, -0.22547389580303104, 0.1336696788663428, -0.012361701886359955, 0.03851175738260533, -0.13069627962069225, -0.18585846267885317, -0.0841879751643737, 0.06223698831813403, -0.008450314871852972, 0.027366466595906847, 0.169399824793906, -0.04253439898866086, -0.05703759392261179, 0.381121381155358, -0.07236100050423594, -0.10551004090013295, 0.1867864719544449, -0.17304092371601776, -0.08012936976194436, 0.1742184591149473, 0.0910822133428288, 0.08918960334384307, -0.11941626540917978, 0.14115044876383312, 0.031327899084231024, 0.19108791602361203, 0.06082988032955595, 0.0768582341278203, 0.19661962989391418, 0.1303587216385946, 0.054393970059149345, 0.07906657304843365, -0.1353526254775968, -0.0589319628673558, -0.243357059625107, -0.12603585745434104, -0.23412121881103742, 0.024397607508666107, -0.05222307575965788, -0.22161820056732662, 0.42650830858373456, 0.148311996416114, 0.16029807142862357, -0.02274870691968835, 0.24636588461126072, 0.13400733239296994, 0.06751694494920416, 0.07318826511767387, 0.2610027013587881, 0.19832247688203886, 0.06469890371773963, -0.3089604504282389, 0.013174462341193627, 0.012607530043222499] |
1,802.0718 | Comparison of threshold-based algorithms for sparse signal recovery | Intensively growing approach in signal processing and acquisition, the
Compressive Sensing approach, allows sparse signals to be recovered from small
number of randomly acquired signal coefficients. This paper analyses some of
the commonly used threshold-based algorithms for sparse signal reconstruction.
Signals satisfy the conditions required by the Compressive Sensing theory. The
Orthogonal Matching Pursuit, Iterative Hard Thresholding and Single Iteration
Reconstruction algorithms are observed. Comparison in terms of reconstruction
error and execution time is performed within the experimental part of the
paper.
| eess.SP cs.MM | intensively growing approach in signal processing and acquisition the compressive sensing approach allows sparse signals to be recovered from small number of randomly acquired signal coefficients this paper analyses some of the commonly used thresholdbased algorithms for sparse signal reconstruction signals satisfy the conditions required by the compressive sensing theory the orthogonal matching pursuit iterative hard thresholding and single iteration reconstruction algorithms are observed comparison in terms of reconstruction error and execution time is performed within the experimental part of the paper | [['intensively', 'growing', 'approach', 'in', 'signal', 'processing', 'and', 'acquisition', 'the', 'compressive', 'sensing', 'approach', 'allows', 'sparse', 'signals', 'to', 'be', 'recovered', 'from', 'small', 'number', 'of', 'randomly', 'acquired', 'signal', 'coefficients', 'this', 'paper', 'analyses', 'some', 'of', 'the', 'commonly', 'used', 'thresholdbased', 'algorithms', 'for', 'sparse', 'signal', 'reconstruction', 'signals', 'satisfy', 'the', 'conditions', 'required', 'by', 'the', 'compressive', 'sensing', 'theory', 'the', 'orthogonal', 'matching', 'pursuit', 'iterative', 'hard', 'thresholding', 'and', 'single', 'iteration', 'reconstruction', 'algorithms', 'are', 'observed', 'comparison', 'in', 'terms', 'of', 'reconstruction', 'error', 'and', 'execution', 'time', 'is', 'performed', 'within', 'the', 'experimental', 'part', 'of', 'the', 'paper']] | [-0.10377297671966074, 0.04521946504530383, -0.08680430812783903, -0.00027340733468896007, -0.06522946498958712, -0.1604816846793699, 0.012325994580950043, 0.4070231048755842, -0.3365268123040839, -0.32144363306281043, 0.18329987464978065, -0.21487971001731307, -0.20450463735430344, 0.15380742091958116, -0.10634122234939529, 0.18834858684141825, 0.12533125260890257, 0.043263344111193605, -0.08789612027736972, -0.23499841256657752, 0.16397779826472356, 0.101018794312528, 0.3492748828252732, -0.09292621624360724, 0.08117211697532273, 0.0740949668866162, -0.09507032483674177, -0.00476212154437856, -0.05506959944827164, 0.13294066184359352, 0.34645985725631073, 0.2056074568945627, 0.2755688998121314, -0.46782931814924245, -0.19508074480676796, 0.13019785238429904, 0.16304968230187802, 0.08892265790164834, -0.10312591507326721, -0.2770721735887048, 0.13239099761817558, -0.09386028229009087, 0.026160404818677683, -0.06379577392575944, -0.0947785491191941, -0.011420837319569617, -0.36051831096865056, 0.1102759060031087, -0.0034461026534256412, 0.03078427233892243, -0.08757979723286996, -0.13366018049418926, 0.11689120810478926, 0.10360600228035231, 0.04299873034412995, 0.034507479649264275, 0.16984436683720205, -0.08651900943084734, -0.1339132011862381, 0.3715707286567677, -0.02124459837086317, -0.1851532487880166, 0.16374492469220991, -0.0823963690498026, -0.1713394442368753, 0.21341168603337393, 0.22832240518672312, 0.1099224343552345, -0.15726107820050744, 0.061729122121483314, 0.020515903342151788, 0.1591613195473101, 0.10004346379044853, 0.05173593041736905, 0.09531457006658722, 0.14642909805222257, 0.07807525993529253, 0.1290765103952187, -0.1465520871485152, -0.0050755857103844965, -0.24115219772310656, -0.048846726956004956, -0.26233667720438597, -0.09246061521400584, -0.13073377075506426, -0.14065623592880622, 0.4047471602197464, 0.17883148523638162, 0.16299431273577417, 0.06311313362462764, 0.4303050692670229, 0.11464719884324728, 0.03670571799242369, 0.05392719340715103, 0.23078169247949007, 0.1802419496376476, 0.1334748763091317, -0.18112043507408532, 0.0930488764921703, 0.06574863512296139] |
1,802.07181 | Algorithmic Information Dynamics of Persistent Patterns and Colliding
Particles in the Game of Life | Without loss of generalisation to other systems, including possibly
non-deterministic ones, we demonstrate the application of methods drawn from
algorithmic information dynamics to the characterisation and classification of
emergent and persistent patterns, motifs and colliding particles in Conway's
Game of Life (GoL), a cellular automaton serving as a case study illustrating
the way in which such ideas can be applied to a typical discrete dynamical
system. We explore the issue of local observations of closed systems whose
orbits may appear open because of inaccessibility to the global rules governing
the overall system. We also investigate aspects of symmetry related to
complexity in the distribution of patterns that occur with high frequency in
GoL (which we thus call motifs) and analyse the distribution of these motifs
with a view to tracking the changes in their algorithmic probability over time.
We demonstrate how the tools introduced are an alternative to other computable
measures that are unable to capture changes in emergent structures in evolving
complex systems that are often too small or too subtle to be properly
characterised by methods such as lossless compression and Shannon entropy.
| nlin.CG cs.IT math.DS math.IT | without loss of generalisation to other systems including possibly nondeterministic ones we demonstrate the application of methods drawn from algorithmic information dynamics to the characterisation and classification of emergent and persistent patterns motifs and colliding particles in conways game of life gol a cellular automaton serving as a case study illustrating the way in which such ideas can be applied to a typical discrete dynamical system we explore the issue of local observations of closed systems whose orbits may appear open because of inaccessibility to the global rules governing the overall system we also investigate aspects of symmetry related to complexity in the distribution of patterns that occur with high frequency in gol which we thus call motifs and analyse the distribution of these motifs with a view to tracking the changes in their algorithmic probability over time we demonstrate how the tools introduced are an alternative to other computable measures that are unable to capture changes in emergent structures in evolving complex systems that are often too small or too subtle to be properly characterised by methods such as lossless compression and shannon entropy | [['without', 'loss', 'of', 'generalisation', 'to', 'other', 'systems', 'including', 'possibly', 'nondeterministic', 'ones', 'we', 'demonstrate', 'the', 'application', 'of', 'methods', 'drawn', 'from', 'algorithmic', 'information', 'dynamics', 'to', 'the', 'characterisation', 'and', 'classification', 'of', 'emergent', 'and', 'persistent', 'patterns', 'motifs', 'and', 'colliding', 'particles', 'in', 'conways', 'game', 'of', 'life', 'gol', 'a', 'cellular', 'automaton', 'serving', 'as', 'a', 'case', 'study', 'illustrating', 'the', 'way', 'in', 'which', 'such', 'ideas', 'can', 'be', 'applied', 'to', 'a', 'typical', 'discrete', 'dynamical', 'system', 'we', 'explore', 'the', 'issue', 'of', 'local', 'observations', 'of', 'closed', 'systems', 'whose', 'orbits', 'may', 'appear', 'open', 'because', 'of', 'inaccessibility', 'to', 'the', 'global', 'rules', 'governing', 'the', 'overall', 'system', 'we', 'also', 'investigate', 'aspects', 'of', 'symmetry', 'related', 'to', 'complexity', 'in', 'the', 'distribution', 'of', 'patterns', 'that', 'occur', 'with', 'high', 'frequency', 'in', 'gol', 'which', 'we', 'thus', 'call', 'motifs', 'and', 'analyse', 'the', 'distribution', 'of', 'these', 'motifs', 'with', 'a', 'view', 'to', 'tracking', 'the', 'changes', 'in', 'their', 'algorithmic', 'probability', 'over', 'time', 'we', 'demonstrate', 'how', 'the', 'tools', 'introduced', 'are', 'an', 'alternative', 'to', 'other', 'computable', 'measures', 'that', 'are', 'unable', 'to', 'capture', 'changes', 'in', 'emergent', 'structures', 'in', 'evolving', 'complex', 'systems', 'that', 'are', 'often', 'too', 'small', 'or', 'too', 'subtle', 'to', 'be', 'properly', 'characterised', 'by', 'methods', 'such', 'as', 'lossless', 'compression', 'and', 'shannon', 'entropy']] | [-0.12267455056803679, 0.11319699418625631, -0.10866792163736111, 0.12287319077971719, -0.04924787064082921, -0.12555559764653948, 0.0642165589102267, 0.37185101456738806, -0.31194769186848725, -0.3163199151438233, 0.11132320002967341, -0.2506611594527557, -0.19977758895681316, 0.18472902116718123, -0.11259849751116456, 0.03677532336599118, 0.0288684303102019, 0.04122056820417276, -0.04884615666649896, -0.2228000387266228, 0.3069913443933065, 0.04571309183422174, 0.2550494262948632, 0.013656476109817222, 0.0632453709941458, -0.028237572616922696, -0.042867147835676335, 0.06518878200771035, -0.10143668940475657, 0.1282058482304549, 0.2859549494686763, 0.16691549712464818, 0.2481589094282606, -0.43692514971905466, -0.22916470115903664, 0.1268157784235538, 0.1649028630043078, 0.11716472320132763, -0.020354857395176548, -0.27703904977093474, 0.09447112117478675, -0.16119242159876268, -0.13948698299811096, -0.10129958128657293, 0.016993662142694294, 0.06838800161951096, -0.22191175947821623, 0.040621363460809946, 0.08683251278345926, 0.06910607899362976, -0.05818699109619735, -0.046358805938900724, -0.019600182219181913, 0.1548426893753679, 0.050359938834869375, -0.027865335601381956, 0.13787062480303183, -0.14239781695619427, -0.1593679138333411, 0.40840505625347834, -0.026383925983178857, -0.2008366602762426, 0.2521573891951325, -0.11557537939248455, -0.1608117810072931, 0.10945593832262061, 0.2008721041688192, 0.08524763687589282, -0.13293970408157219, 0.02710062714790724, 0.0015617759445229092, 0.1624870247679536, 0.06781281891052385, 0.08470684438503373, 0.20752686911161888, 0.14723167416161378, 0.05426236493261279, 0.14806180240372446, -0.03669008332826952, -0.14110901104915585, -0.2276651416729028, -0.12935957244087665, -0.14167260709344534, 0.04107181702715319, -0.05232792280927439, -0.19064895540957238, 0.3763956941708661, 0.158627527109599, 0.20087536429822944, 0.03891201436809088, 0.25752571027449056, 0.07725725975768591, 0.0639723380159184, 0.052253990581359815, 0.15176554745239382, 0.0974515158720818, 0.09150574377523987, -0.20019980673929927, 0.08186879851320457, 0.04049543973712905] |
1,802.07182 | The Gaussian Process Autoregressive Regression Model (GPAR) | Multi-output regression models must exploit dependencies between outputs to
maximise predictive performance. The application of Gaussian processes (GPs) to
this setting typically yields models that are computationally demanding and
have limited representational power. We present the Gaussian Process
Autoregressive Regression (GPAR) model, a scalable multi-output GP model that
is able to capture nonlinear, possibly input-varying, dependencies between
outputs in a simple and tractable way: the product rule is used to decompose
the joint distribution over the outputs into a set of conditionals, each of
which is modelled by a standard GP. GPAR's efficacy is demonstrated on a
variety of synthetic and real-world problems, outperforming existing GP models
and achieving state-of-the-art performance on established benchmarks.
| stat.ML | multioutput regression models must exploit dependencies between outputs to maximise predictive performance the application of gaussian processes gps to this setting typically yields models that are computationally demanding and have limited representational power we present the gaussian process autoregressive regression gpar model a scalable multioutput gp model that is able to capture nonlinear possibly inputvarying dependencies between outputs in a simple and tractable way the product rule is used to decompose the joint distribution over the outputs into a set of conditionals each of which is modelled by a standard gp gpars efficacy is demonstrated on a variety of synthetic and realworld problems outperforming existing gp models and achieving stateoftheart performance on established benchmarks | [['multioutput', 'regression', 'models', 'must', 'exploit', 'dependencies', 'between', 'outputs', 'to', 'maximise', 'predictive', 'performance', 'the', 'application', 'of', 'gaussian', 'processes', 'gps', 'to', 'this', 'setting', 'typically', 'yields', 'models', 'that', 'are', 'computationally', 'demanding', 'and', 'have', 'limited', 'representational', 'power', 'we', 'present', 'the', 'gaussian', 'process', 'autoregressive', 'regression', 'gpar', 'model', 'a', 'scalable', 'multioutput', 'gp', 'model', 'that', 'is', 'able', 'to', 'capture', 'nonlinear', 'possibly', 'inputvarying', 'dependencies', 'between', 'outputs', 'in', 'a', 'simple', 'and', 'tractable', 'way', 'the', 'product', 'rule', 'is', 'used', 'to', 'decompose', 'the', 'joint', 'distribution', 'over', 'the', 'outputs', 'into', 'a', 'set', 'of', 'conditionals', 'each', 'of', 'which', 'is', 'modelled', 'by', 'a', 'standard', 'gp', 'gpars', 'efficacy', 'is', 'demonstrated', 'on', 'a', 'variety', 'of', 'synthetic', 'and', 'realworld', 'problems', 'outperforming', 'existing', 'gp', 'models', 'and', 'achieving', 'stateoftheart', 'performance', 'on', 'established', 'benchmarks']] | [-0.02066179268641045, -0.04055411308198362, -0.06684518851306256, 0.08206515545652446, -0.10572620808474116, -0.20353599239627387, 0.02437922132184712, 0.4548642914910037, -0.2833841197394036, -0.28890033229044426, 0.07237551505596121, -0.22905350231506802, -0.1691147777066264, 0.23245911702496913, -0.09075025482908697, 0.13248582084470237, 0.09248467619837103, -0.006769178934428874, -0.060200067156262964, -0.28567687884342297, 0.2625052856432425, 0.048364251306666446, 0.3230041786860507, -0.04850264123498319, 0.1711840971104532, -0.014466438274662773, -0.03100771752714708, -0.005791040798145774, -0.02633834823974941, 0.162492950912565, 0.3034234135330071, 0.2053253862939708, 0.3176405589926887, -0.3929501931095991, -0.2952776700845576, 0.14255807001504475, 0.10942144026803607, 0.034104155329358135, 0.03798707502239661, -0.2772690451427086, 0.07882021815591567, -0.19321213620672892, 0.002996889949851745, -0.1645457194698555, -0.02611879111888508, 0.02250623132462974, -0.3905708293539581, 0.058860160368452735, 0.07935194250800319, 0.023034046336941352, -0.011655679048114532, -0.13428524357837265, 0.020519931223830796, 0.11543452760271795, -0.020401265600387863, -0.02418796072487493, 0.11983293063491834, -0.14669293905230793, -0.1716418449708202, 0.36616275260678016, -0.08329917015172206, -0.2891066907191867, 0.22880711769349538, -0.04380065392333645, -0.13253507097797082, 0.10925814085681965, 0.27822660641725855, 0.07742446718888508, -0.1759967646133658, 0.07203716856347783, -0.03095097509674258, 0.17654258346705287, 0.00880260003713874, -0.026322076290107525, 0.19417977928150412, 0.26067108949142936, 0.02700839592311699, 0.14011218936207728, -0.10416486711023157, -0.16243390032711127, -0.23212698075148436, -0.06526546518377087, -0.17180037622650465, -0.022850089607894555, -0.09985200324890765, -0.1692288835776282, 0.3883528306467777, 0.20568414700326618, 0.21675743681152124, 0.17039744271099702, 0.37282947716009507, 0.12158776678657264, 0.06547475166551701, 0.0900265230704938, 0.14922040921996707, 0.119430454533866, 0.030645690479752113, -0.14238534599274127, 0.133383986061892, -0.03407538269944321] |
1,802.07183 | Unitary Scheme Model Calculations of the Ground- and Excited-State
Characteristics of 3H and 4He | The ground and excited states of the 3H and 4He nuclei are studied in the
framework of group-theoretical methods. Basis functions of the unitary scheme
model corresponding to even numbers of quanta of excitation in the range from
zero to twenty are constructed for the even-parity states of these two nuclei,
and bases from one to nineteen are constructed for the odd-parity states of the
4He nucleus. The ground-state and first-excited-state energies and wave
functions, the ground S-, P- and D-state probabilities, the root-mean-square
radius and the magnetic dipole moment of Triton are calculated. Furthermore,
for the 4He nucleus, the spectrum and the wave functions, the ground S-, P- and
D-state probabilities, the root-mean-square radius and the total integral cross
section of the dipole electric transition accompanying the photoabsorption of
gamma quanta by this nucleus are calculated. The GPT and AV8' two-body
interactions and the Urbana nine three-nucleon interaction are used in these
investigations. Moreover, the convergence of the calculations is examined by
incrementally extrapolating the nuclear characteristics calculated for N less
than or equal to twenty to N equals thirty.
| nucl-th | the ground and excited states of the 3h and 4he nuclei are studied in the framework of grouptheoretical methods basis functions of the unitary scheme model corresponding to even numbers of quanta of excitation in the range from zero to twenty are constructed for the evenparity states of these two nuclei and bases from one to nineteen are constructed for the oddparity states of the 4he nucleus the groundstate and firstexcitedstate energies and wave functions the ground s p and dstate probabilities the rootmeansquare radius and the magnetic dipole moment of triton are calculated furthermore for the 4he nucleus the spectrum and the wave functions the ground s p and dstate probabilities the rootmeansquare radius and the total integral cross section of the dipole electric transition accompanying the photoabsorption of gamma quanta by this nucleus are calculated the gpt and av8 twobody interactions and the urbana nine threenucleon interaction are used in these investigations moreover the convergence of the calculations is examined by incrementally extrapolating the nuclear characteristics calculated for n less than or equal to twenty to n equals thirty | [['the', 'ground', 'and', 'excited', 'states', 'of', 'the', '3h', 'and', '4he', 'nuclei', 'are', 'studied', 'in', 'the', 'framework', 'of', 'grouptheoretical', 'methods', 'basis', 'functions', 'of', 'the', 'unitary', 'scheme', 'model', 'corresponding', 'to', 'even', 'numbers', 'of', 'quanta', 'of', 'excitation', 'in', 'the', 'range', 'from', 'zero', 'to', 'twenty', 'are', 'constructed', 'for', 'the', 'evenparity', 'states', 'of', 'these', 'two', 'nuclei', 'and', 'bases', 'from', 'one', 'to', 'nineteen', 'are', 'constructed', 'for', 'the', 'oddparity', 'states', 'of', 'the', '4he', 'nucleus', 'the', 'groundstate', 'and', 'firstexcitedstate', 'energies', 'and', 'wave', 'functions', 'the', 'ground', 's', 'p', 'and', 'dstate', 'probabilities', 'the', 'rootmeansquare', 'radius', 'and', 'the', 'magnetic', 'dipole', 'moment', 'of', 'triton', 'are', 'calculated', 'furthermore', 'for', 'the', '4he', 'nucleus', 'the', 'spectrum', 'and', 'the', 'wave', 'functions', 'the', 'ground', 's', 'p', 'and', 'dstate', 'probabilities', 'the', 'rootmeansquare', 'radius', 'and', 'the', 'total', 'integral', 'cross', 'section', 'of', 'the', 'dipole', 'electric', 'transition', 'accompanying', 'the', 'photoabsorption', 'of', 'gamma', 'quanta', 'by', 'this', 'nucleus', 'are', 'calculated', 'the', 'gpt', 'and', 'av8', 'twobody', 'interactions', 'and', 'the', 'urbana', 'nine', 'threenucleon', 'interaction', 'are', 'used', 'in', 'these', 'investigations', 'moreover', 'the', 'convergence', 'of', 'the', 'calculations', 'is', 'examined', 'by', 'incrementally', 'extrapolating', 'the', 'nuclear', 'characteristics', 'calculated', 'for', 'n', 'less', 'than', 'or', 'equal', 'to', 'twenty', 'to', 'n', 'equals', 'thirty']] | [-0.10113787819317527, 0.21292099176239715, -0.04286791756395405, 0.125866680676169, 0.06385927877352876, -0.07990818400738647, 0.031566687677253694, 0.34229597105588044, -0.1905468562437808, -0.2886076115588889, -0.023282571370939812, -0.3673892747868079, -0.013726868758039827, 0.14903959344419038, 0.13354910165586031, 0.07271036118762927, 0.020645955111831427, 0.0895176933671847, -0.09349272053467511, -0.18965921306581293, 0.3359570398782663, 0.03852343828628323, 0.22832928377188208, 0.06821283120680466, 0.022691792103549394, 0.0156022520383398, 0.019882417175898236, -0.055588823658264966, -0.12793526693519966, 0.14585640687334755, 0.22974847276207544, 0.0604796115597144, 0.16892108180205137, -0.44102711230516434, -0.1324529065699085, 0.10330242308201423, 0.12301508638974361, 0.12913654434355748, 0.03640130789402502, -0.31572671850000955, 0.036208496930705415, -0.20495589647586174, -0.1714085264013082, -0.10521231211197063, 0.10304154936759347, 0.06872051473300472, -0.2522192027378642, 0.06061534805336545, -0.0023014368270703935, 0.04589907771315862, -0.15073903227862978, -0.2596924185562488, -0.05318820417359554, 0.10002496569592362, 0.0677920676727949, 0.039696518545301415, 0.15181510103094645, -0.1068869891990676, -0.07644248328773685, 0.3774457319603605, -0.01863109088769422, -0.1313748481704015, 0.10337532893368635, -0.18512995126888732, -0.0701040239169813, 0.21003387620909272, 0.11997797736095378, 0.13352377686549224, -0.11474128336084811, 0.06301244771113176, 0.005322140509176495, 0.15643220726858556, 0.08134343843516065, 0.04675596260378209, 0.14687461444808333, 0.08724731007251292, -0.016091337293715768, 0.08595124760241304, -0.15527721224301264, -0.09803056015902538, -0.31171793077470356, -0.09646388270393096, -0.19942110123182583, 0.03578085106979536, -0.02607491922671572, -0.10976507390195823, 0.387272252268424, 0.032037012340778805, 0.17648993659949763, 0.002489063639234937, 0.26262416278181894, 0.10595859590151156, 0.047236249967380455, 0.04598886760283591, 0.31022292358584663, 0.21084073384019716, 0.007278393961756763, -0.2729559218805561, 0.02316882733245334, 0.08414614480503356] |
1,802.07184 | Comment on the Bekenstein bound | We propose a rigorous derivation of the Bekenstein upper limit for the
entropy/information that can be contained by a physical system in a given
finite region of space with given finite energy. The starting point is the
observation that the derivation of such a bound provided by Casini [6] is
similar to the description of the black hole incremental free energy that had
been given by the first named author [23]. The approach here is different but
close in the spirit to [6]. Our bound is obtained by operator algebraic
methods, in particular Connes' bimodules, Tomita-Takesaki modular theory and
Jones' index are essential ingredients inasmuch as the von Neumann algebras in
question are typically of type III. We rely on the general mathematical
framework, recently set up in [26], concerning quantum information of infinite
systems.
| math-ph gr-qc hep-th math.MP math.OA | we propose a rigorous derivation of the bekenstein upper limit for the entropyinformation that can be contained by a physical system in a given finite region of space with given finite energy the starting point is the observation that the derivation of such a bound provided by casini 6 is similar to the description of the black hole incremental free energy that had been given by the first named author 23 the approach here is different but close in the spirit to 6 our bound is obtained by operator algebraic methods in particular connes bimodules tomitatakesaki modular theory and jones index are essential ingredients inasmuch as the von neumann algebras in question are typically of type iii we rely on the general mathematical framework recently set up in 26 concerning quantum information of infinite systems | [['we', 'propose', 'a', 'rigorous', 'derivation', 'of', 'the', 'bekenstein', 'upper', 'limit', 'for', 'the', 'entropyinformation', 'that', 'can', 'be', 'contained', 'by', 'a', 'physical', 'system', 'in', 'a', 'given', 'finite', 'region', 'of', 'space', 'with', 'given', 'finite', 'energy', 'the', 'starting', 'point', 'is', 'the', 'observation', 'that', 'the', 'derivation', 'of', 'such', 'a', 'bound', 'provided', 'by', 'casini', '6', 'is', 'similar', 'to', 'the', 'description', 'of', 'the', 'black', 'hole', 'incremental', 'free', 'energy', 'that', 'had', 'been', 'given', 'by', 'the', 'first', 'named', 'author', '23', 'the', 'approach', 'here', 'is', 'different', 'but', 'close', 'in', 'the', 'spirit', 'to', '6', 'our', 'bound', 'is', 'obtained', 'by', 'operator', 'algebraic', 'methods', 'in', 'particular', 'connes', 'bimodules', 'tomitatakesaki', 'modular', 'theory', 'and', 'jones', 'index', 'are', 'essential', 'ingredients', 'inasmuch', 'as', 'the', 'von', 'neumann', 'algebras', 'in', 'question', 'are', 'typically', 'of', 'type', 'iii', 'we', 'rely', 'on', 'the', 'general', 'mathematical', 'framework', 'recently', 'set', 'up', 'in', '26', 'concerning', 'quantum', 'information', 'of', 'infinite', 'systems']] | [-0.09338506036093114, 0.09791791809688288, -0.10666000171805974, 0.07198141046834212, -0.06096255073530806, -0.12745608663600352, 0.04141334272593398, 0.27844927470820646, -0.2310221511370468, -0.3120175239526563, 0.11872778261615033, -0.2687546654190454, -0.14424418649394755, 0.21006921918510837, -0.11837410102964861, 0.048058794645799534, 0.04298508960615705, 0.08817561340250972, -0.07961351255782777, -0.24286957908835677, 0.3801479886294584, 0.054035973153077066, 0.2453421310176728, 0.07452928784984612, 0.096889535261801, 0.010940768812886543, -0.03946700120620705, 0.02191431143437512, -0.15996733380527953, 0.1466160375745622, 0.2569831262998007, 0.1107904142562162, 0.2682864059027957, -0.3897617909367438, -0.19529247460628135, 0.06922690151604237, 0.13518607485004597, 0.10677126028609496, -0.0208460249532773, -0.26609649131143537, 0.10114234337859132, -0.2123398644780671, -0.12498148287887927, -0.045337073418691205, 0.05062216997396684, -0.021763119153264496, -0.21856015894768965, 0.06386704650811023, 0.11024457968564497, 0.0760320836037863, -0.08240261903136141, -0.0885345660193168, 0.011521702794427121, 0.10171131573410498, -0.02551421752475478, 0.03342628432351544, 0.09767285602650157, -0.058844840909457866, -0.1294357089912174, 0.341988695199015, -0.040433479221192774, -0.18667373845560684, 0.15324105830104262, -0.1397457878029888, -0.14426573446641366, 0.0968990563346004, 0.07605919399195248, 0.1108534032271968, -0.14036001271257798, 0.16562536230474642, -0.08976236652513897, 0.11435097806539421, 0.07828132134896737, 0.030831570549505867, 0.16322096157819033, 0.12725720673075153, 0.048792699958991124, 0.12264057250469233, 0.0014526329468935728, -0.097813730203995, -0.33982302229161615, -0.16495177480521508, -0.20640740922341744, 0.08714348055698254, -0.09099333409071228, -0.16238346709179932, 0.3588260673021001, 0.10992258120526525, 0.17644410185533127, 0.04837689976276899, 0.24154716278253882, 0.15975687515122075, 0.037540784692046816, 0.09223468035321544, 0.23228771724151792, 0.16104713909465956, 0.07921047400062282, -0.14304764051404265, 0.022077623565025902, 0.18280379808145678] |
1,802.07185 | The Planetary Nebula Luminosity Function (PNLF): Contamination from
Supernova Remnants | The planetary nebula luminosity function (PNLF) has been used as an
extragalactic distance indicator since the 1980's, but there are still unsolved
problems associated with its use. One of the most serious involves PNLF
distances beyond ~ 10 Mpc, which tend to be slightly smaller than those of
other methods. We consider the implications of previous spectroscopic
investigations that found that several of the brightest planetary nebula (PN)
candidates in M74 are actually compact supernova remnants (SNRs). Using
narrow-band imaging data from the KPNO 4-m telescope, we measure the [O III]
$\lambda$5007 and H$\alpha$ fluxes of all the known SNRs in M31 and M33, and
test whether those objects could be misidentified as bright PNe at distances
beyond ~ 10 Mpc. Our results suggest that compact SNRs are not an important
source of contamination in photometric surveys for extragalactic PNe.
| astro-ph.GA astro-ph.SR | the planetary nebula luminosity function pnlf has been used as an extragalactic distance indicator since the 1980s but there are still unsolved problems associated with its use one of the most serious involves pnlf distances beyond 10 mpc which tend to be slightly smaller than those of other methods we consider the implications of previous spectroscopic investigations that found that several of the brightest planetary nebula pn candidates in m74 are actually compact supernova remnants snrs using narrowband imaging data from the kpno 4m telescope we measure the o iii lambda5007 and halpha fluxes of all the known snrs in m31 and m33 and test whether those objects could be misidentified as bright pne at distances beyond 10 mpc our results suggest that compact snrs are not an important source of contamination in photometric surveys for extragalactic pne | [['the', 'planetary', 'nebula', 'luminosity', 'function', 'pnlf', 'has', 'been', 'used', 'as', 'an', 'extragalactic', 'distance', 'indicator', 'since', 'the', '1980s', 'but', 'there', 'are', 'still', 'unsolved', 'problems', 'associated', 'with', 'its', 'use', 'one', 'of', 'the', 'most', 'serious', 'involves', 'pnlf', 'distances', 'beyond', '10', 'mpc', 'which', 'tend', 'to', 'be', 'slightly', 'smaller', 'than', 'those', 'of', 'other', 'methods', 'we', 'consider', 'the', 'implications', 'of', 'previous', 'spectroscopic', 'investigations', 'that', 'found', 'that', 'several', 'of', 'the', 'brightest', 'planetary', 'nebula', 'pn', 'candidates', 'in', 'm74', 'are', 'actually', 'compact', 'supernova', 'remnants', 'snrs', 'using', 'narrowband', 'imaging', 'data', 'from', 'the', 'kpno', '4m', 'telescope', 'we', 'measure', 'the', 'o', 'iii', 'lambda5007', 'and', 'halpha', 'fluxes', 'of', 'all', 'the', 'known', 'snrs', 'in', 'm31', 'and', 'm33', 'and', 'test', 'whether', 'those', 'objects', 'could', 'be', 'misidentified', 'as', 'bright', 'pne', 'at', 'distances', 'beyond', '10', 'mpc', 'our', 'results', 'suggest', 'that', 'compact', 'snrs', 'are', 'not', 'an', 'important', 'source', 'of', 'contamination', 'in', 'photometric', 'surveys', 'for', 'extragalactic', 'pne']] | [-0.013336930746226099, 0.017664009281914965, -0.059169102001233376, 0.16553897374862994, -0.12435337547820223, -0.10806246839828142, 0.004610629057160754, 0.4526367040378028, -0.15407050201632216, -0.35201724435108295, 0.07528483645359486, -0.317861489303734, -0.03639661932391101, 0.281351542201541, -0.04780919186895767, -0.04763421261526199, 0.10997896058657004, -0.10019626124235599, -0.025747889400193253, -0.31392095483454835, 0.2738162327584797, 0.08999569855117495, 0.12907253774524113, -0.04874794396396349, 0.010591173732646512, -0.14363271128420002, -0.0846285053015943, -0.01308099941883668, -0.1200040332640102, 0.0496844611275594, 0.2790889796541297, 0.20511366657582045, 0.21045505928982428, -0.351808343021928, -0.2145315054458215, 0.11133005532547427, 0.2606687887430029, 0.009534976828127992, -0.03440002555810455, -0.30091275690474373, 0.07675370026634587, -0.16371495242945958, -0.22380306921305432, 0.13383342872670703, 0.07289458475534574, 0.06589853573604014, -0.16271739927174497, 0.10122833411425244, -0.023960699239556772, 0.11108849565431043, -0.11836572377554451, -0.19782111897011814, -0.0034046252924557507, 0.09195301006548107, 0.004665880998853, 0.0888108155231221, 0.12477268038007121, -0.1612126603115188, -0.06134596456895056, 0.42366124870444555, -0.006814037911628501, 0.011491217103827259, 0.2646570444525476, -0.21234753609810403, -0.1989776984235083, 0.15197795682816187, 0.13463989539266788, 0.14643507978399756, -0.2043271282201876, 0.029311451209334493, -0.027753487021824265, 0.17417255344301247, 0.04461797248180686, 0.13372509475980685, 0.26065724254864187, 0.06950548080646474, 0.07745519524062242, 0.08275902543286118, -0.30057121204942855, 0.0006064231089059857, -0.24829147314733785, -0.09356621162210038, -0.14921881068933188, 0.11169201198577682, -0.13751754761925322, -0.12522560818647238, 0.2783548939784152, 0.13891393637649066, 0.15948608477660658, 0.006606089161283782, 0.2909648326306563, 0.029086067443342366, 0.15590279858873185, 0.11915473991573072, 0.3733636413471422, 0.15530586986384098, 0.0653770075760026, -0.1547022742359305, 0.09428713351245159, -0.0012220759467775192] |
1,802.07186 | Stochastic compressible Euler equations and inviscid limits | We prove the existence of a unique local strong solution to the stochastic
compressible Euler system with nonlinear multiplicative noise. This solution
exists up to a positive stopping time and is strong in both the PDE and
probabilistic sense. Based on this existence result, we study the inviscid
limit of the stochastic compressible Navier--Stokes system. As the viscosity
tends to zero, any sequence of finite energy weak martingale solutions
converges to the compressible Euler system.
| math.AP math.PR physics.flu-dyn | we prove the existence of a unique local strong solution to the stochastic compressible euler system with nonlinear multiplicative noise this solution exists up to a positive stopping time and is strong in both the pde and probabilistic sense based on this existence result we study the inviscid limit of the stochastic compressible navierstokes system as the viscosity tends to zero any sequence of finite energy weak martingale solutions converges to the compressible euler system | [['we', 'prove', 'the', 'existence', 'of', 'a', 'unique', 'local', 'strong', 'solution', 'to', 'the', 'stochastic', 'compressible', 'euler', 'system', 'with', 'nonlinear', 'multiplicative', 'noise', 'this', 'solution', 'exists', 'up', 'to', 'a', 'positive', 'stopping', 'time', 'and', 'is', 'strong', 'in', 'both', 'the', 'pde', 'and', 'probabilistic', 'sense', 'based', 'on', 'this', 'existence', 'result', 'we', 'study', 'the', 'inviscid', 'limit', 'of', 'the', 'stochastic', 'compressible', 'navierstokes', 'system', 'as', 'the', 'viscosity', 'tends', 'to', 'zero', 'any', 'sequence', 'of', 'finite', 'energy', 'weak', 'martingale', 'solutions', 'converges', 'to', 'the', 'compressible', 'euler', 'system']] | [-0.2063871379569173, 0.02540466796606779, -0.10260841578866045, 0.05677928744039188, -0.06907479340831439, -0.14820676941424607, -0.00488333756569773, 0.22454138338565827, -0.37196468748152256, -0.19061341118067504, 0.14016302511794493, -0.2607653244771063, -0.08336900712301333, 0.12258520775785049, -0.057119853626936674, 0.1373285090442126, 0.07309713947276274, -0.017875963719561697, -0.05736787235597149, -0.21289575474336744, 0.3419911355835696, -0.011590304160490632, 0.25622158384571475, 0.0015740697334210077, 0.20451337189103166, -0.08053623343507449, 0.02913875865439574, 0.051985183271269005, -0.18601542978237073, 0.005854899324476719, 0.2318738904874772, 0.0208309005231907, 0.3592957270145416, -0.4099574293072025, -0.18098915527264278, 0.15223476249103746, 0.11601226275088265, 0.12756529482702414, -0.024623246835544704, -0.2815223981564244, 0.16110039435327053, -0.12225051081894586, -0.18413159829874834, -0.09038190179814895, 0.005518055879510939, 0.11671343522456785, -0.3070355441172918, 0.11729515471030026, 0.1698280716439088, 0.002811709196927647, -0.14107835315167905, -0.046921465112827715, -0.00018667892863353093, 0.08585611948743463, 0.1201310800233235, 0.025938882636837662, 0.03976862302670876, -0.15386310513441762, -0.045594526710920034, 0.3563291231915355, -0.1942596896396329, -0.30093484374694524, 0.2649375833105296, -0.14290555299570162, -0.06090638412783543, 0.19080299913883209, 0.17227867036436995, 0.1383127351105213, -0.1165865575025479, 0.1213366623952364, -0.1366532134078443, 0.19542730373640854, 0.05504668772220612, -0.01614346435914437, 0.11122450155516465, 0.18348368305092055, 0.21810699534912903, 0.12496761306499442, -0.048573409309610724, -0.1412036398301522, -0.3421022041638692, -0.20099655527621507, -0.16570041770736377, 0.17791839034607013, -0.12811791357855934, -0.25295356459915636, 0.3283557468218108, 0.15242277677170932, 0.10509824273486933, 0.13492977745831014, 0.2662390111371254, 0.2368684007584428, -0.10876723028098544, 0.11705086373413602, 0.2013474276328149, 0.17106300415083145, 0.17758974094564717, -0.2684564805962145, 0.040434733781342706, 0.2057375395918886] |
1,802.07187 | Leader-follower based Coalition Formation in Large-scale UAV Networks, A
Quantum Evolutionary Approach | The problem of decentralized multiple Point of Interests (PoIs) detection and
associated task completion in an unknown environment with multiple
resource-constrained and self-interested Unmanned Aerial Vehicles (UAVs) is
studied. The UAVs form several coalitions to efficiently complete the compound
tasks which are impossible to be performed individually. The objectives of such
coalition formation are to firstly minimize resource consumption in completing
the encountered tasks on time, secondly to enhance the reliability of the
coalitions, and lastly in segregating the most trusted UAVs amid the self
interested of them. As many previous publications have merely focused on
minimizing costs, this study considers a multi-objective optimization coalition
formation problem that considers the three aforementioned objectives. In doing
so, a leader-follower- inspired coalition formation algorithm amalgamating the
three objectives to address the problem of the computational complexity of
coalition formation in large-scale UAV networks is proposed. This algorithm
attempts to form the coalitions with minimally exceeding the required resources
for the encountered tasks while maximizing the number of completed tasks. The
proposed algorithm is based on Quantum Evolutionary Algorithms(QEA) which are a
combination of quantum computing and evolutionary algorithms. Results from
simulations show that the proposed algorithm significantly outperforms the
existing coalition formation algorithms such as merge-and-split and a famous
multi-objective genetic algorithm called NSGA-II.
| cs.MA cs.GT | the problem of decentralized multiple point of interests pois detection and associated task completion in an unknown environment with multiple resourceconstrained and selfinterested unmanned aerial vehicles uavs is studied the uavs form several coalitions to efficiently complete the compound tasks which are impossible to be performed individually the objectives of such coalition formation are to firstly minimize resource consumption in completing the encountered tasks on time secondly to enhance the reliability of the coalitions and lastly in segregating the most trusted uavs amid the self interested of them as many previous publications have merely focused on minimizing costs this study considers a multiobjective optimization coalition formation problem that considers the three aforementioned objectives in doing so a leaderfollower inspired coalition formation algorithm amalgamating the three objectives to address the problem of the computational complexity of coalition formation in largescale uav networks is proposed this algorithm attempts to form the coalitions with minimally exceeding the required resources for the encountered tasks while maximizing the number of completed tasks the proposed algorithm is based on quantum evolutionary algorithmsqea which are a combination of quantum computing and evolutionary algorithms results from simulations show that the proposed algorithm significantly outperforms the existing coalition formation algorithms such as mergeandsplit and a famous multiobjective genetic algorithm called nsgaii | [['the', 'problem', 'of', 'decentralized', 'multiple', 'point', 'of', 'interests', 'pois', 'detection', 'and', 'associated', 'task', 'completion', 'in', 'an', 'unknown', 'environment', 'with', 'multiple', 'resourceconstrained', 'and', 'selfinterested', 'unmanned', 'aerial', 'vehicles', 'uavs', 'is', 'studied', 'the', 'uavs', 'form', 'several', 'coalitions', 'to', 'efficiently', 'complete', 'the', 'compound', 'tasks', 'which', 'are', 'impossible', 'to', 'be', 'performed', 'individually', 'the', 'objectives', 'of', 'such', 'coalition', 'formation', 'are', 'to', 'firstly', 'minimize', 'resource', 'consumption', 'in', 'completing', 'the', 'encountered', 'tasks', 'on', 'time', 'secondly', 'to', 'enhance', 'the', 'reliability', 'of', 'the', 'coalitions', 'and', 'lastly', 'in', 'segregating', 'the', 'most', 'trusted', 'uavs', 'amid', 'the', 'self', 'interested', 'of', 'them', 'as', 'many', 'previous', 'publications', 'have', 'merely', 'focused', 'on', 'minimizing', 'costs', 'this', 'study', 'considers', 'a', 'multiobjective', 'optimization', 'coalition', 'formation', 'problem', 'that', 'considers', 'the', 'three', 'aforementioned', 'objectives', 'in', 'doing', 'so', 'a', 'leaderfollower', 'inspired', 'coalition', 'formation', 'algorithm', 'amalgamating', 'the', 'three', 'objectives', 'to', 'address', 'the', 'problem', 'of', 'the', 'computational', 'complexity', 'of', 'coalition', 'formation', 'in', 'largescale', 'uav', 'networks', 'is', 'proposed', 'this', 'algorithm', 'attempts', 'to', 'form', 'the', 'coalitions', 'with', 'minimally', 'exceeding', 'the', 'required', 'resources', 'for', 'the', 'encountered', 'tasks', 'while', 'maximizing', 'the', 'number', 'of', 'completed', 'tasks', 'the', 'proposed', 'algorithm', 'is', 'based', 'on', 'quantum', 'evolutionary', 'algorithmsqea', 'which', 'are', 'a', 'combination', 'of', 'quantum', 'computing', 'and', 'evolutionary', 'algorithms', 'results', 'from', 'simulations', 'show', 'that', 'the', 'proposed', 'algorithm', 'significantly', 'outperforms', 'the', 'existing', 'coalition', 'formation', 'algorithms', 'such', 'as', 'mergeandsplit', 'and', 'a', 'famous', 'multiobjective', 'genetic', 'algorithm', 'called', 'nsgaii']] | [-0.16938237155598954, -0.0007032672090481269, -0.02780243644813049, 0.055810431375993654, -0.09862526618295625, -0.15599487261996733, 0.09024905106378278, 0.4080573074802121, -0.28036171879886396, -0.37152562706214837, 0.07586095389309759, -0.221517071962937, -0.19562619094741288, 0.1260851627735474, -0.15305076141607776, 0.10592426252231373, 0.08744545520577907, 0.044564489873293874, 0.03560617837008813, -0.3394902784010987, 0.28957014420219823, 0.055362067250446616, 0.2827005296596878, 0.014034069906831918, 0.091911766110915, -0.017824881533558053, -0.018890906149031533, 0.022042838517814804, -0.10718130789804689, 0.13622586292344901, 0.36133102978186865, 0.2625664421644115, 0.4009364631415402, -0.4597885723918747, -0.19989864385335915, 0.1627728755186396, 0.15349927434909613, 0.051899663801636034, -0.03211671478938206, -0.2823646034520137, 0.09659070423384908, -0.18848659156080141, -0.02103088671226778, -0.011653338227933052, -0.053457611977559695, 0.051126791779735344, -0.28279129699395605, -0.02486480208405104, -0.009347884854940714, 0.015621520622999747, -0.08123956878241416, -0.12747811527163566, 0.02749111629929835, 0.16119622568968436, 0.041152433236239926, 0.0011443236591161992, 0.17907471045348528, -0.15472553733083028, -0.23400823870823848, 0.4270473105603414, 0.060216305806120564, -0.17855225449154302, 0.17981955883538978, -0.02546145445203753, -0.18901375907151055, 0.11909609317356915, 0.20360679668705398, 0.15726944853406027, -0.17438952523279247, 0.026112214520201748, -0.04417882243312578, 0.12489383694259516, 0.055311512219679865, 0.02267278398064923, 0.17513822436760845, 0.23486404644404824, 0.16882828772658376, 0.12088706594686602, -0.022589589955072223, -0.1772130237984961, -0.1654570357761379, -0.11746684481694376, -0.20931998462972376, -0.055332308287524855, -0.04643911140455293, -0.10902491298954387, 0.36468027311187434, 0.14970542914212032, 0.13996742319418293, 0.1256224808230184, 0.37780767013605737, 0.03536862891246852, 0.06067874141244915, 0.11122404515574426, 0.17130909206884168, 0.018914954696000682, 0.09941569584757266, -0.2786003179634122, 0.11349332426681284, 0.03544915807367219] |
1,802.07188 | Adjoint Sensitivity Analysis of Hybrid Multibody Dynamical Systems | Sensitivity analysis of multibody systems computes the derivatives of general
cost functions that depend on the system solution with respect to parameters or
initial conditions. This work develops adjoint sensitivity analysis for hybrid
multibody dynamic systems. Hybrid systems are characterized by trajectories
that are piecewise continuous in time, with finitely-many discontinuities being
caused by events such as elastic/inelastic impacts or sudden changes in
constraints. The corresponding direct and adjoint sensitivity variables are
also discontinuous at the time of events. The framework discussed herein uses a
jump sensitivity matrix to relate the jump conditions for the direct and
adjoint sensitivities before and after the time event, and provides analytical
jump equations for the adjoint variables. The theoretical framework for
sensitivities for hybrid systems is validated on a five-bar mechanism with
non-smooth contacts.
| math.OC | sensitivity analysis of multibody systems computes the derivatives of general cost functions that depend on the system solution with respect to parameters or initial conditions this work develops adjoint sensitivity analysis for hybrid multibody dynamic systems hybrid systems are characterized by trajectories that are piecewise continuous in time with finitelymany discontinuities being caused by events such as elasticinelastic impacts or sudden changes in constraints the corresponding direct and adjoint sensitivity variables are also discontinuous at the time of events the framework discussed herein uses a jump sensitivity matrix to relate the jump conditions for the direct and adjoint sensitivities before and after the time event and provides analytical jump equations for the adjoint variables the theoretical framework for sensitivities for hybrid systems is validated on a fivebar mechanism with nonsmooth contacts | [['sensitivity', 'analysis', 'of', 'multibody', 'systems', 'computes', 'the', 'derivatives', 'of', 'general', 'cost', 'functions', 'that', 'depend', 'on', 'the', 'system', 'solution', 'with', 'respect', 'to', 'parameters', 'or', 'initial', 'conditions', 'this', 'work', 'develops', 'adjoint', 'sensitivity', 'analysis', 'for', 'hybrid', 'multibody', 'dynamic', 'systems', 'hybrid', 'systems', 'are', 'characterized', 'by', 'trajectories', 'that', 'are', 'piecewise', 'continuous', 'in', 'time', 'with', 'finitelymany', 'discontinuities', 'being', 'caused', 'by', 'events', 'such', 'as', 'elasticinelastic', 'impacts', 'or', 'sudden', 'changes', 'in', 'constraints', 'the', 'corresponding', 'direct', 'and', 'adjoint', 'sensitivity', 'variables', 'are', 'also', 'discontinuous', 'at', 'the', 'time', 'of', 'events', 'the', 'framework', 'discussed', 'herein', 'uses', 'a', 'jump', 'sensitivity', 'matrix', 'to', 'relate', 'the', 'jump', 'conditions', 'for', 'the', 'direct', 'and', 'adjoint', 'sensitivities', 'before', 'and', 'after', 'the', 'time', 'event', 'and', 'provides', 'analytical', 'jump', 'equations', 'for', 'the', 'adjoint', 'variables', 'the', 'theoretical', 'framework', 'for', 'sensitivities', 'for', 'hybrid', 'systems', 'is', 'validated', 'on', 'a', 'fivebar', 'mechanism', 'with', 'nonsmooth', 'contacts']] | [-0.13236076686929427, 0.10706287494750395, -0.07454995459206899, 0.05611503288618161, -0.0661771601378804, -0.12685110104334263, 0.03808703102910792, 0.35664204054490756, -0.2585333085206572, -0.2757754132479522, 0.15549870928614365, -0.26000759435305726, -0.14401081928233297, 0.20127622450822752, -0.033942465515778834, 0.11518633815651859, 0.09803335156419692, 0.017153473405650894, -0.12507207065026227, -0.16934887336865637, 0.3044794996292153, 0.022304562892665275, 0.2203996667055456, 0.04092459165924833, 0.14401583725014233, 0.002520069367970333, -0.032853012606377165, 0.004004349229139283, -0.08290297864771444, 0.04908146285981816, 0.22809069509838373, 0.08973505576887658, 0.25438945632044024, -0.45045660864135234, -0.20380706038638835, 0.09511289660968171, 0.07828847853864991, 0.04614925026100036, -0.029140471511001464, -0.30623308119883064, 0.06986083886550583, -0.14229171100349827, -0.15439761312010178, -0.10506054943512755, 0.03658157564656994, 0.07750506844115622, -0.34007430182617043, 0.12136277146366396, 0.006432262974442871, 0.05494200298918112, -0.0665745356632041, -0.10629978540125978, -0.02811722719032346, 0.07252591773369954, 0.04524044935300036, -0.017714602783862644, 0.14941297702754328, -0.10642226867000963, -0.1322977182274073, 0.34480078174298956, -0.07037916402901231, -0.24155882443123647, 0.22027927364101846, -0.0970712268284259, -0.13419974556562442, 0.16216691524387544, 0.20271132219554358, 0.12657209527003402, -0.17573901281500134, 0.07130298641766243, 0.06579958815358665, 0.1408762024113027, 0.03569233506377644, 0.032691054290092995, 0.16916313389927604, 0.19269519029114082, 0.08537611822537253, 0.09301005210371986, -0.03633092886604767, -0.16154519181328875, -0.33032552701712564, -0.1442087155461084, -0.12793401932301185, -0.040399729291986645, -0.0698324506258137, -0.14033203707112155, 0.3924772903778171, 0.14097532987566166, 0.18193572825745088, 0.08222285419603, 0.30181276965139875, 0.18798453226340722, 0.013139508202501381, 0.0176040978003862, 0.2229442187720014, 0.11471727258127666, 0.11576395092233446, -0.2373498542099224, 0.12568583976715547, 0.07692979904467538] |
1,802.07189 | On configuration space, Born's rule and ontological states | It is shown how configuration space, possibly encompassing ordinary spatial
structures, Born's rule, and ontological states aiming to address an underlying
reality beyond Quantum Mechanics relate to each other in models of Hamiltonian
cellular automata.
| quant-ph physics.hist-ph | it is shown how configuration space possibly encompassing ordinary spatial structures borns rule and ontological states aiming to address an underlying reality beyond quantum mechanics relate to each other in models of hamiltonian cellular automata | [['it', 'is', 'shown', 'how', 'configuration', 'space', 'possibly', 'encompassing', 'ordinary', 'spatial', 'structures', 'borns', 'rule', 'and', 'ontological', 'states', 'aiming', 'to', 'address', 'an', 'underlying', 'reality', 'beyond', 'quantum', 'mechanics', 'relate', 'to', 'each', 'other', 'in', 'models', 'of', 'hamiltonian', 'cellular', 'automata']] | [-0.08853621011533375, 0.1492793886693627, -0.09210858834641321, 0.1754771136978109, -0.0951033109000751, -0.2371484411614282, 0.05051870966064079, 0.33786237026963917, -0.33591554948527896, -0.2521054919276919, 0.0050619544694200155, -0.20890231206680515, -0.20079185398561614, 0.08048376840140138, -0.0831995714655412, 0.07011508809435847, 0.023453694741640774, 0.06993854979851416, -0.024874933968697277, -0.20085594823384392, 0.32869027597563605, 0.0875452453104247, 0.3081273073596614, -0.042176940667975164, 0.08190144396253994, 0.009397959589426007, 0.008126083069614001, 0.02193097481420929, -0.060447559399264196, 0.1192023361417731, 0.3376476469895611, 0.2148929618531838, 0.26909352192389113, -0.5023389287825142, -0.28270006837057216, 0.09421189004289253, 0.10495982928467648, 0.11478410317961658, 0.12374730655657394, -0.33766477927565575, -0.006141247826495341, -0.17149467383112227, -0.19396703557244369, -0.11375135029000895, 0.028877435444987245, -0.0654793407768011, -0.15482361572129386, -0.004792542529425451, 0.08351677942888013, 0.0389268837336983, -0.07840995374135673, -0.0791696870965617, -0.0010274496993848256, 0.10769002079697591, -0.0642305433168076, -0.04440492625747408, 0.11158803710713983, -0.1328533085329192, -0.2792591467233641, 0.4623193522116968, 0.0702488429245672, -0.2684307427810771, 0.23084516615739892, -0.11054034640214273, -0.14989466832152434, 0.10485954933932849, 0.08185685857066087, 0.019602870009839533, -0.1585566423567278, 0.1211212648860445, -0.027886867549802574, 0.18153110205062797, 0.038676715455949306, 0.09252169579267502, 0.2594002296349832, 0.15755749179848602, 0.0738035145082644, 0.05572414353123999, 0.004738907728876386, -0.2899506402867181, -0.2849746895687921, -0.17641304599653398, -0.14555343280413321, 0.09528206153107541, -0.018895950979536533, -0.17870662026356773, 0.32987077619930333, 0.19149400064987795, 0.15432205168264254, 0.0362100381503946, 0.24650899225047657, 0.10033891767795597, 0.07206200951976435, 0.00019691510658179011, 0.15948937077607428, 0.19155907716069903, 0.10176130505278706, -0.17126513923119221, 0.03578603641529168, 0.09872540568134615] |
1,802.0719 | Evolutionary games: natural selection of strategies | In this paper, I model and study the process of natural selection between all
possible mixed strategies in classical two-player two-strategy games. I derive
and solve an equation that is a natural generalization of the Taylor-Jonker
replicator equation that describes dynamics of pure strategy frequencies. I
then investigate the evolution of not only frequencies of pure strategies but
also of total distribution of mixed strategies. I show that the process of
natural selection of strategies for all games obeys the dynamical Principle of
minimum of information gain.
| q-bio.PE q-bio.QM | in this paper i model and study the process of natural selection between all possible mixed strategies in classical twoplayer twostrategy games i derive and solve an equation that is a natural generalization of the taylorjonker replicator equation that describes dynamics of pure strategy frequencies i then investigate the evolution of not only frequencies of pure strategies but also of total distribution of mixed strategies i show that the process of natural selection of strategies for all games obeys the dynamical principle of minimum of information gain | [['in', 'this', 'paper', 'i', 'model', 'and', 'study', 'the', 'process', 'of', 'natural', 'selection', 'between', 'all', 'possible', 'mixed', 'strategies', 'in', 'classical', 'twoplayer', 'twostrategy', 'games', 'i', 'derive', 'and', 'solve', 'an', 'equation', 'that', 'is', 'a', 'natural', 'generalization', 'of', 'the', 'taylorjonker', 'replicator', 'equation', 'that', 'describes', 'dynamics', 'of', 'pure', 'strategy', 'frequencies', 'i', 'then', 'investigate', 'the', 'evolution', 'of', 'not', 'only', 'frequencies', 'of', 'pure', 'strategies', 'but', 'also', 'of', 'total', 'distribution', 'of', 'mixed', 'strategies', 'i', 'show', 'that', 'the', 'process', 'of', 'natural', 'selection', 'of', 'strategies', 'for', 'all', 'games', 'obeys', 'the', 'dynamical', 'principle', 'of', 'minimum', 'of', 'information', 'gain']] | [-0.0829669221840409, 0.08675061448542862, -0.12722949843940345, 0.07896142451487363, -0.037073129441502484, -0.1783829742926173, 0.0909342589195233, 0.3389517846057018, -0.3114410290077632, -0.26497777186464083, 0.07006334431529002, -0.20180299412459135, -0.19938633703561717, 0.10219225759596326, -0.09767499600732049, -0.025759131653061092, 0.062132530807799034, 0.008118375973386128, -0.0032197015155594104, -0.24088945274436196, 0.38198371684222027, 0.01255621416710837, 0.2800940809294928, -0.01352170581907727, 0.1627900771753386, 0.01713497305917012, -0.042049665491334924, 0.033740661572664976, -0.17702257872393645, 0.05789699823443973, 0.2250578920248636, 0.23274811217019897, 0.32342623502860757, -0.3957051448740585, -0.1942247792504468, 0.1660576238524342, 0.09020454916280023, 0.14116936306967293, 0.002459073959048404, -0.19480483162455087, 0.06358921076279393, -0.1618349449228506, -0.11670532633095633, -0.02664389530586642, 0.047760671497387594, 0.03645400078913067, -0.3041242292464906, 0.0649467362453051, 0.11535887897581804, 0.038251311031777986, -0.0958491058527427, -0.14804889227068702, -0.019627051319667074, 0.12515091746883078, -0.0005508589519047026, -0.08969724152729912, 0.060710326183673946, -0.177071294495511, -0.21545995993344763, 0.4114343301761289, -0.0903379206212649, -0.1774370228698434, 0.16036727176546012, -0.10462105058696727, -0.13953197381437518, 0.09192889841100157, 0.17889090002579397, 0.18443440653513685, -0.2011258464176641, 0.06523675808201132, -0.07042231558020724, 0.1564220927241475, 0.03972886683592616, 0.06799543366854101, 0.13713022407014355, 0.16998049558335265, 0.11703490121506674, 0.12819928671558237, -0.00912133730449822, -0.20066026828406097, -0.31694255450870407, -0.1584766608944466, -0.13947495935907112, 0.03240764240729541, -0.0878057638017412, -0.13961585157355944, 0.3648457653214072, 0.15779660108464033, 0.09771322808228433, 0.07573105098116537, 0.24157319841689842, 0.13744852456892298, -0.02928115284749913, 0.0382078409216605, 0.188583601731807, 0.12364530524368895, 0.10156941307751938, -0.28396055131181425, 0.06385162284836, 0.017272867933782035] |
1,802.07191 | Neural Architecture Search with Bayesian Optimisation and Optimal
Transport | Bayesian Optimisation (BO) refers to a class of methods for global
optimisation of a function $f$ which is only accessible via point evaluations.
It is typically used in settings where $f$ is expensive to evaluate. A common
use case for BO in machine learning is model selection, where it is not
possible to analytically model the generalisation performance of a statistical
model, and we resort to noisy and expensive training and validation procedures
to choose the best model. Conventional BO methods have focused on Euclidean and
categorical domains, which, in the context of model selection, only permits
tuning scalar hyper-parameters of machine learning algorithms. However, with
the surge of interest in deep learning, there is an increasing demand to tune
neural network \emph{architectures}. In this work, we develop NASBOT, a
Gaussian process based BO framework for neural architecture search. To
accomplish this, we develop a distance metric in the space of neural network
architectures which can be computed efficiently via an optimal transport
program. This distance might be of independent interest to the deep learning
community as it may find applications outside of BO. We demonstrate that NASBOT
outperforms other alternatives for architecture search in several cross
validation based model selection tasks on multi-layer perceptrons and
convolutional neural networks.
| cs.LG stat.ML | bayesian optimisation bo refers to a class of methods for global optimisation of a function f which is only accessible via point evaluations it is typically used in settings where f is expensive to evaluate a common use case for bo in machine learning is model selection where it is not possible to analytically model the generalisation performance of a statistical model and we resort to noisy and expensive training and validation procedures to choose the best model conventional bo methods have focused on euclidean and categorical domains which in the context of model selection only permits tuning scalar hyperparameters of machine learning algorithms however with the surge of interest in deep learning there is an increasing demand to tune neural network empharchitectures in this work we develop nasbot a gaussian process based bo framework for neural architecture search to accomplish this we develop a distance metric in the space of neural network architectures which can be computed efficiently via an optimal transport program this distance might be of independent interest to the deep learning community as it may find applications outside of bo we demonstrate that nasbot outperforms other alternatives for architecture search in several cross validation based model selection tasks on multilayer perceptrons and convolutional neural networks | [['bayesian', 'optimisation', 'bo', 'refers', 'to', 'a', 'class', 'of', 'methods', 'for', 'global', 'optimisation', 'of', 'a', 'function', 'f', 'which', 'is', 'only', 'accessible', 'via', 'point', 'evaluations', 'it', 'is', 'typically', 'used', 'in', 'settings', 'where', 'f', 'is', 'expensive', 'to', 'evaluate', 'a', 'common', 'use', 'case', 'for', 'bo', 'in', 'machine', 'learning', 'is', 'model', 'selection', 'where', 'it', 'is', 'not', 'possible', 'to', 'analytically', 'model', 'the', 'generalisation', 'performance', 'of', 'a', 'statistical', 'model', 'and', 'we', 'resort', 'to', 'noisy', 'and', 'expensive', 'training', 'and', 'validation', 'procedures', 'to', 'choose', 'the', 'best', 'model', 'conventional', 'bo', 'methods', 'have', 'focused', 'on', 'euclidean', 'and', 'categorical', 'domains', 'which', 'in', 'the', 'context', 'of', 'model', 'selection', 'only', 'permits', 'tuning', 'scalar', 'hyperparameters', 'of', 'machine', 'learning', 'algorithms', 'however', 'with', 'the', 'surge', 'of', 'interest', 'in', 'deep', 'learning', 'there', 'is', 'an', 'increasing', 'demand', 'to', 'tune', 'neural', 'network', 'empharchitectures', 'in', 'this', 'work', 'we', 'develop', 'nasbot', 'a', 'gaussian', 'process', 'based', 'bo', 'framework', 'for', 'neural', 'architecture', 'search', 'to', 'accomplish', 'this', 'we', 'develop', 'a', 'distance', 'metric', 'in', 'the', 'space', 'of', 'neural', 'network', 'architectures', 'which', 'can', 'be', 'computed', 'efficiently', 'via', 'an', 'optimal', 'transport', 'program', 'this', 'distance', 'might', 'be', 'of', 'independent', 'interest', 'to', 'the', 'deep', 'learning', 'community', 'as', 'it', 'may', 'find', 'applications', 'outside', 'of', 'bo', 'we', 'demonstrate', 'that', 'nasbot', 'outperforms', 'other', 'alternatives', 'for', 'architecture', 'search', 'in', 'several', 'cross', 'validation', 'based', 'model', 'selection', 'tasks', 'on', 'multilayer', 'perceptrons', 'and', 'convolutional', 'neural', 'networks']] | [-0.034842067117829924, -0.016566669707298413, -0.07346588752042611, 0.07697579280101335, -0.12043631893302341, -0.21017415991089153, 0.067111439799474, 0.45957160633491373, -0.2946659256817176, -0.30673244784956855, 0.07300971008925382, -0.19536227886405383, -0.22209294735300308, 0.20383535364407648, -0.09290867462275025, 0.11766253492921519, 0.09698418346889208, 0.038730052448989985, -0.06388556304104057, -0.28184325172502583, 0.28598731083529505, 0.04537975896365751, 0.3265520800628419, -0.011551823609427195, 0.10237053982140407, 0.009721938904953523, 0.014814482394321054, -0.004338174816421617, -0.09202784165029795, 0.16388173622375318, 0.31425688969134125, 0.20800992416681183, 0.3714331502085823, -0.39545331311240356, -0.26496954194441874, 0.16130320444585555, 0.15704574149771078, 0.10062734047131776, 0.014148942074507873, -0.25920720936310054, 0.06574133698584385, -0.1731560974300204, -0.004194714668098367, -0.1655070977104665, -0.013269410970467098, -0.012548854637289763, -0.33116330287997947, 0.0010362703068344627, 0.0357619972268879, 0.043263977999319726, -0.020987180540862592, -0.11750737068614045, 0.03863736088116409, 0.09193284353422164, 0.03691470797687022, 0.08954642508495418, 0.14560271252751422, -0.1663533480387185, -0.16596363344087348, 0.3579607204561239, -0.05532942230935272, -0.23652577881127126, 0.19868248219045728, -0.0031198425245588845, -0.16796186314194997, 0.077119947935554, 0.2582650418117534, 0.15046844044383795, -0.1834793792702981, 0.07464155273651026, -0.012885520320602702, 0.16395373331612875, 0.007169231468386659, -0.035167658797609934, 0.16210154126719256, 0.2758409827744172, 0.06766502395638455, 0.1297685009875511, -0.11472566048100419, -0.11801687614722133, -0.23132008347587968, -0.109546187238822, -0.21932650442027207, -0.016017883272264583, -0.061594100885680375, -0.18459631817740868, 0.37174931380364284, 0.21533855766078314, 0.2073149012370053, 0.07658486615005175, 0.321205409053539, 0.0758437954078121, 0.12502432772799313, 0.09665933047597595, 0.23162304066478737, 0.059515878992173275, 0.09730691685978757, -0.1418519011886284, 0.09425517166422191, 0.047743273686472944] |
1,802.07192 | Robust Optimal Eco-driving Control with Uncertain Traffic Signal Timing | This paper proposes a robust optimal eco-driving control strategy considering
multiple signalized intersections with uncertain traffic signal timing. A
spatial vehicle velocity profile optimization formulation is developed to
minimize the global fuel consumption, with driving time as one state variable.
We introduce the concept of effective red-light duration (ERD), formulated as a
random variable, to describe the feasible passing time through signalized
intersections. A chance constraint is appended to the optimal control problem
to incorporate robustness with respect to uncertain signal timing. The optimal
eco-driving control problem is solved via dynamic programming (DP). Simulation
results demonstrate that the optimal eco-driving can save fuel consumption by
50-57% while maintaining arrival time at the same level, compared with a
modified intelligent driver model as the benchmark. The robust formulation
significantly reduces traffic intersection violations, in the face of uncertain
signal timing, with small sacrifice on fuel economy compared to a non-robust
approach.
| math.OC cs.SY | this paper proposes a robust optimal ecodriving control strategy considering multiple signalized intersections with uncertain traffic signal timing a spatial vehicle velocity profile optimization formulation is developed to minimize the global fuel consumption with driving time as one state variable we introduce the concept of effective redlight duration erd formulated as a random variable to describe the feasible passing time through signalized intersections a chance constraint is appended to the optimal control problem to incorporate robustness with respect to uncertain signal timing the optimal ecodriving control problem is solved via dynamic programming dp simulation results demonstrate that the optimal ecodriving can save fuel consumption by 5057 while maintaining arrival time at the same level compared with a modified intelligent driver model as the benchmark the robust formulation significantly reduces traffic intersection violations in the face of uncertain signal timing with small sacrifice on fuel economy compared to a nonrobust approach | [['this', 'paper', 'proposes', 'a', 'robust', 'optimal', 'ecodriving', 'control', 'strategy', 'considering', 'multiple', 'signalized', 'intersections', 'with', 'uncertain', 'traffic', 'signal', 'timing', 'a', 'spatial', 'vehicle', 'velocity', 'profile', 'optimization', 'formulation', 'is', 'developed', 'to', 'minimize', 'the', 'global', 'fuel', 'consumption', 'with', 'driving', 'time', 'as', 'one', 'state', 'variable', 'we', 'introduce', 'the', 'concept', 'of', 'effective', 'redlight', 'duration', 'erd', 'formulated', 'as', 'a', 'random', 'variable', 'to', 'describe', 'the', 'feasible', 'passing', 'time', 'through', 'signalized', 'intersections', 'a', 'chance', 'constraint', 'is', 'appended', 'to', 'the', 'optimal', 'control', 'problem', 'to', 'incorporate', 'robustness', 'with', 'respect', 'to', 'uncertain', 'signal', 'timing', 'the', 'optimal', 'ecodriving', 'control', 'problem', 'is', 'solved', 'via', 'dynamic', 'programming', 'dp', 'simulation', 'results', 'demonstrate', 'that', 'the', 'optimal', 'ecodriving', 'can', 'save', 'fuel', 'consumption', 'by', '5057', 'while', 'maintaining', 'arrival', 'time', 'at', 'the', 'same', 'level', 'compared', 'with', 'a', 'modified', 'intelligent', 'driver', 'model', 'as', 'the', 'benchmark', 'the', 'robust', 'formulation', 'significantly', 'reduces', 'traffic', 'intersection', 'violations', 'in', 'the', 'face', 'of', 'uncertain', 'signal', 'timing', 'with', 'small', 'sacrifice', 'on', 'fuel', 'economy', 'compared', 'to', 'a', 'nonrobust', 'approach']] | [-0.1571187515564938, 0.024874108579422304, -0.06034283332945466, 0.06063522544889492, -0.09552099451347686, -0.21807836273047548, 0.11556991881412773, 0.36332211692211214, -0.31357594997928345, -0.35745639290743436, 0.1423763742681355, -0.2253841471720812, -0.10281663674286148, 0.1613771786160092, -0.17116269281746557, 0.1299130779604315, 0.06563671047943051, 0.005666318719881593, -0.01910130375599326, -0.23547074629850184, 0.19276052288986092, 0.10150618775241427, 0.3308210521186358, 0.00936777728778504, 0.16074305317745913, 0.03731179226192977, -0.019429195936356714, 0.03395975413638473, -0.04123766303724405, 0.09861054337558481, 0.30455106615570166, 0.1616456026372331, 0.31655356044187244, -0.4569824235482554, -0.24144355645997062, 0.12670359467062475, 0.09998156092342164, 0.07087371624918692, -0.02312228504346446, -0.257483987518955, 0.09747282696275303, -0.1871497007649417, -0.13313704878935628, -0.026076528000732846, -0.01832751759121682, 0.036357965223075536, -0.30341654501842874, 0.05040314279699029, -0.0178638935251624, 0.0021094212296025065, -0.08424083396890857, -0.06835803184377016, -0.024700977717645015, 0.11053222326261786, 0.045952602044285445, 0.03128648067190899, 0.17196668974270782, -0.08023571731653939, -0.15132808773747128, 0.39955439519187147, -0.03350277244888446, -0.2339126296878961, 0.11880250200129196, -0.019448302589331896, -0.09951640856796062, 0.15667444363317684, 0.24761640939599017, 0.1072828135728186, -0.1805683952215559, 0.00490571157194224, 0.0010818930392797362, 0.20470965265658927, 0.051058935536690456, 0.013190538456801, 0.1678384947887428, 0.24927381369841578, 0.2131393965483712, 0.148052420245246, -0.08063478247557873, -0.14935176195764302, -0.23060246605790163, -0.05431188452963861, -0.13226244589095099, 0.0020731305766025646, -0.1105227779109506, -0.08444044142867745, 0.38601965014666517, 0.182536526530006, 0.14574892714700893, 0.12752541153997982, 0.3962164954688625, 0.14652008148638418, 0.013179646975254552, 0.10410919447660746, 0.18088435110301654, 0.032470984729756944, 0.14252647930824966, -0.2928802622575938, 0.14942848315656235, 0.03435850605968661] |
1,802.07193 | Construction of Milnorian representations | We prove a partial converse to the main theorem of the author's previous
paper "Proper affine actions: a sufficient criterion" (submitted; available at
arXiv:1612.08942). More precisely, let $G$ be a semisimple real Lie group with
a representation $\rho$ on a finite-dimensional real vector space $V$, that
does not satisfy the criterion from the previous paper. Assuming that $\rho$ is
irreducible and under some additional assumptions on $G$ and $\rho$, we then
prove that there does not exist a group of affine transformations acting
properly discontinuously on $V$ whose linear part is Zariski-dense in
$\rho(G)$.
| math.GR math.RT | we prove a partial converse to the main theorem of the authors previous paper proper affine actions a sufficient criterion submitted available at arxiv161208942 more precisely let g be a semisimple real lie group with a representation rho on a finitedimensional real vector space v that does not satisfy the criterion from the previous paper assuming that rho is irreducible and under some additional assumptions on g and rho we then prove that there does not exist a group of affine transformations acting properly discontinuously on v whose linear part is zariskidense in rhog | [['we', 'prove', 'a', 'partial', 'converse', 'to', 'the', 'main', 'theorem', 'of', 'the', 'authors', 'previous', 'paper', 'proper', 'affine', 'actions', 'a', 'sufficient', 'criterion', 'submitted', 'available', 'at', 'arxiv161208942', 'more', 'precisely', 'let', 'g', 'be', 'a', 'semisimple', 'real', 'lie', 'group', 'with', 'a', 'representation', 'rho', 'on', 'a', 'finitedimensional', 'real', 'vector', 'space', 'v', 'that', 'does', 'not', 'satisfy', 'the', 'criterion', 'from', 'the', 'previous', 'paper', 'assuming', 'that', 'rho', 'is', 'irreducible', 'and', 'under', 'some', 'additional', 'assumptions', 'on', 'g', 'and', 'rho', 'we', 'then', 'prove', 'that', 'there', 'does', 'not', 'exist', 'a', 'group', 'of', 'affine', 'transformations', 'acting', 'properly', 'discontinuously', 'on', 'v', 'whose', 'linear', 'part', 'is', 'zariskidense', 'in', 'rhog']] | [-0.1761898156393179, 0.1023468285278287, -0.13688928291441932, -0.011971340682457692, -0.17847799507760873, -0.16808492639252254, 0.054516251362930306, 0.396032302209767, -0.27958019328133393, -0.1860112623081252, 0.10926573944243012, -0.231453072610161, -0.1736592251121477, 0.18829377316018586, -0.1435254872826639, -0.037884577102358305, 0.08519492685915, 0.18774201709937344, -0.09045135616124557, -0.2963235455775453, 0.38725112915359516, -0.10304860157832023, 0.20853348590573798, 0.060547764730384396, 0.139736300654633, 0.05379017236171871, -0.03243367639069836, 0.020191030993354155, -0.16227085711001055, 0.05308801913133231, 0.2737818225737541, 0.09117524882638327, 0.27524403956348215, -0.3467871451409914, -0.18037391451978554, 0.2586461463592626, 0.10844100286723465, -0.013170345553687663, 0.010731564116662979, -0.28522963086844133, 0.14798930004459396, -0.14701712265972458, -0.11979355514850668, -0.04960690445757361, 0.08885052341527196, -0.024721947010426272, -0.3008623764179246, 0.03128254129200853, 0.14838921836507257, 0.10764824177178564, -0.09263291434755408, -0.11061961636928622, -0.07785480600150843, 0.0765713060585161, -0.056278082538366074, 0.10134524348822813, 0.10073773574925238, -0.03672005929132943, -0.044288731986276246, 0.39908396588858736, -0.06788622917387113, -0.25843642748171286, 0.16192951952658033, -0.18411661400359564, -0.18935600144698495, 0.0767621348501854, 0.14204298483548305, 0.12241379828542791, -0.06294751067155151, 0.1953131766596769, -0.16519338644600362, 0.13287106552912342, 0.03395935091921078, -0.02493684222641331, 0.08837872116716318, 0.021545685572369445, 0.1329325966146444, 0.06311308902873587, 0.06537986362743523, 0.04587712747755871, -0.4411068311942521, -0.13675544367131767, -0.15472191417219258, 0.14029012692082043, -0.053297823103475236, -0.1437715374694396, 0.3283667885297809, 0.08558818241781606, 0.18093548008110574, 0.10485702504213619, 0.23632451050704525, 0.09886503624867507, 0.06053772165630293, 0.1293142832495192, 0.1083969831612507, 0.19864352388928333, -0.04919375607904087, -0.14294839322614553, 0.02581938964775413, 0.14626911079751387] |
1,802.07194 | A Note on "Quantum Algorithm for Linear Systems of Equations" | Recently, an efficient quantum algorithm for linear systems of equations
introduced by Harrow, Hassidim, and Lloyd, has received great concern from the
academic community. However, the error and complexity analysis for this
algorithm seems so complicated that it may not be applicable to other filter
functions for other tasks. In this note, a concise proof is proposed. We hope
that it may inspire some novel HHL-based algorithms that can compute
$F(A)|b\rangle$ for any computable $F$.
| quant-ph | recently an efficient quantum algorithm for linear systems of equations introduced by harrow hassidim and lloyd has received great concern from the academic community however the error and complexity analysis for this algorithm seems so complicated that it may not be applicable to other filter functions for other tasks in this note a concise proof is proposed we hope that it may inspire some novel hhlbased algorithms that can compute fabrangle for any computable f | [['recently', 'an', 'efficient', 'quantum', 'algorithm', 'for', 'linear', 'systems', 'of', 'equations', 'introduced', 'by', 'harrow', 'hassidim', 'and', 'lloyd', 'has', 'received', 'great', 'concern', 'from', 'the', 'academic', 'community', 'however', 'the', 'error', 'and', 'complexity', 'analysis', 'for', 'this', 'algorithm', 'seems', 'so', 'complicated', 'that', 'it', 'may', 'not', 'be', 'applicable', 'to', 'other', 'filter', 'functions', 'for', 'other', 'tasks', 'in', 'this', 'note', 'a', 'concise', 'proof', 'is', 'proposed', 'we', 'hope', 'that', 'it', 'may', 'inspire', 'some', 'novel', 'hhlbased', 'algorithms', 'that', 'can', 'compute', 'fabrangle', 'for', 'any', 'computable', 'f']] | [-0.06952322010359127, 0.044466182980439244, -0.13813269094959513, 0.09604523577631693, -0.15001338756043617, -0.21725534986423917, 0.03201929547135042, 0.3787159236045937, -0.2526087629774662, -0.29744593857800306, 0.09741747752150955, -0.20739413723859884, -0.2555308115719626, 0.29972185686945096, -0.15544746253537398, 0.10248461631062912, 0.08249550362513082, 0.01899460835816109, -0.053177180830772, -0.3295599350527133, 0.23444753242273852, 0.0691970262265037, 0.2638174381668437, 0.0839250978363091, 0.07539687741847632, -0.012230529960193862, -0.030501254649245985, 0.0388540737458492, -0.11174405166990528, 0.11758030013321605, 0.3428570720532986, 0.22705649250276286, 0.35600228893430264, -0.38745284321628615, -0.21291822799774882, 0.13874568439356677, 0.18692432873091366, 0.1646052842117744, -0.08631234008767834, -0.2847349335732934, 0.10519599424171172, -0.17278719933269776, -0.07623470903131856, -0.14427722748113822, 0.06309044985929886, -0.007633330206361229, -0.26336662808739364, 0.007447358807676459, 0.11339847025244612, 0.01079379536262522, 0.019948073790395912, -0.14958912311504557, 0.06680169416119484, 0.07913461032846611, 0.010292395764374978, 0.0747878924426814, 0.06336426479129555, -0.07311215138139382, -0.15665042622346584, 0.36018086292410956, -0.005695985821522262, -0.21864437486670196, 0.19804357132262052, -0.04013259526444216, -0.21750369737218198, 0.11584934629882647, 0.17538897534322045, 0.11295282676152579, -0.16320981885855124, 0.10402814088204289, -0.05445169675967669, 0.169563274728517, 0.03910694785467158, 0.026761877943748888, 0.12931184606843513, 0.08942180412043244, 0.12012721909439728, 0.11019273018719603, 0.03551342425076929, -0.06556260924984075, -0.21574896951652553, -0.17680593166653424, -0.22866883069876429, 0.006275410748171391, -0.02779260685959231, -0.14671183595663473, 0.3513415268533034, 0.20356420604575884, 0.08967685594848573, 0.08682152183968829, 0.2959311378048095, 0.12852403087771103, 0.08018690353412539, 0.13037622401057042, 0.22794919628020033, 0.08584620986350697, 0.12285370124529486, -0.1455662172504586, 0.11389360891348899, 0.07981629703474576] |
1,802.07195 | Ultrafast magnetization dynamics in pure and doped Heusler and inverse
Heusler alloys | By using a multiscale approach based on first-principles density functional
theory combined with atomistic spin dynamics, we investigate the electronic
structure and magnetization dynamics of an inverse Heusler and a Heusler
compound and their alloys, i. e. Mn$_{2-x}Z_x$CoAl and Mn$_{2-x}Z_x$VAl, where
$Z$ = Mo, W, Os and Ru, respectively. A signature of the ferrimagnetic ordering
of Mn$_{2}$CoAl and Mn$_{2}$VAl Heusler alloys is reflected in the calculated
Heisenberg exchange constants. They decay very rapidly with the interatomic
distance and have short range, which is a consequence of the existence of the
finite gap in the minority spin band. The calculated Gilbert damping parameter
of both Mn$_2$CoAl and Mn$_2$VAl is high compared to other half-metals, but
interestingly in the particular case of the inverse Mn$_{2}$CoAl alloys and due
to the spin-gapless semiconducting property, the damping parameters decrease
with the doping concentration in clear contradiction to the general trend.
Atomistic spin dynamics simulations predict ultrafast magnetisation switching
in Mn$_{2}$CoAl and Mn$_{2}$VAl under the influence of an external magnetic
field, starting from a threshold field of $2\text{T}$. Our overall finding
extends with Heusler and inverse Heusler alloys, the class of materials that
exhibits laser induced magnetic switching.
| cond-mat.mtrl-sci | by using a multiscale approach based on firstprinciples density functional theory combined with atomistic spin dynamics we investigate the electronic structure and magnetization dynamics of an inverse heusler and a heusler compound and their alloys i e mn_2xz_xcoal and mn_2xz_xval where z mo w os and ru respectively a signature of the ferrimagnetic ordering of mn_2coal and mn_2val heusler alloys is reflected in the calculated heisenberg exchange constants they decay very rapidly with the interatomic distance and have short range which is a consequence of the existence of the finite gap in the minority spin band the calculated gilbert damping parameter of both mn_2coal and mn_2val is high compared to other halfmetals but interestingly in the particular case of the inverse mn_2coal alloys and due to the spingapless semiconducting property the damping parameters decrease with the doping concentration in clear contradiction to the general trend atomistic spin dynamics simulations predict ultrafast magnetisation switching in mn_2coal and mn_2val under the influence of an external magnetic field starting from a threshold field of 2textt our overall finding extends with heusler and inverse heusler alloys the class of materials that exhibits laser induced magnetic switching | [['by', 'using', 'a', 'multiscale', 'approach', 'based', 'on', 'firstprinciples', 'density', 'functional', 'theory', 'combined', 'with', 'atomistic', 'spin', 'dynamics', 'we', 'investigate', 'the', 'electronic', 'structure', 'and', 'magnetization', 'dynamics', 'of', 'an', 'inverse', 'heusler', 'and', 'a', 'heusler', 'compound', 'and', 'their', 'alloys', 'i', 'e', 'mn_2xz_xcoal', 'and', 'mn_2xz_xval', 'where', 'z', 'mo', 'w', 'os', 'and', 'ru', 'respectively', 'a', 'signature', 'of', 'the', 'ferrimagnetic', 'ordering', 'of', 'mn_2coal', 'and', 'mn_2val', 'heusler', 'alloys', 'is', 'reflected', 'in', 'the', 'calculated', 'heisenberg', 'exchange', 'constants', 'they', 'decay', 'very', 'rapidly', 'with', 'the', 'interatomic', 'distance', 'and', 'have', 'short', 'range', 'which', 'is', 'a', 'consequence', 'of', 'the', 'existence', 'of', 'the', 'finite', 'gap', 'in', 'the', 'minority', 'spin', 'band', 'the', 'calculated', 'gilbert', 'damping', 'parameter', 'of', 'both', 'mn_2coal', 'and', 'mn_2val', 'is', 'high', 'compared', 'to', 'other', 'halfmetals', 'but', 'interestingly', 'in', 'the', 'particular', 'case', 'of', 'the', 'inverse', 'mn_2coal', 'alloys', 'and', 'due', 'to', 'the', 'spingapless', 'semiconducting', 'property', 'the', 'damping', 'parameters', 'decrease', 'with', 'the', 'doping', 'concentration', 'in', 'clear', 'contradiction', 'to', 'the', 'general', 'trend', 'atomistic', 'spin', 'dynamics', 'simulations', 'predict', 'ultrafast', 'magnetisation', 'switching', 'in', 'mn_2coal', 'and', 'mn_2val', 'under', 'the', 'influence', 'of', 'an', 'external', 'magnetic', 'field', 'starting', 'from', 'a', 'threshold', 'field', 'of', '2textt', 'our', 'overall', 'finding', 'extends', 'with', 'heusler', 'and', 'inverse', 'heusler', 'alloys', 'the', 'class', 'of', 'materials', 'that', 'exhibits', 'laser', 'induced', 'magnetic', 'switching']] | [-0.13312741077909118, 0.18042066512415653, -0.020228379681982375, 0.027903930202160997, -0.05389422943283405, -0.10924835328909534, 0.07860510167727375, 0.43041280816708294, -0.30234976950647907, -0.2875660943685385, 0.008860945083181221, -0.3114094995799913, -0.11489926109080592, 0.16799099079121357, 0.08774685839969645, 0.013700754716795273, -0.03171361604872992, -0.04955711825036262, -0.14003620184797833, -0.18401945011182713, 0.2580865582318178, 0.04847290577836921, 0.2819822581790427, 0.06112075385498376, 0.0646814608579334, 0.03623425367253798, 0.12884905687582596, 0.03736250635813035, -0.18011203327570535, 0.06486126810075744, 0.2230116814195065, -0.10815317681054314, 0.19834957395005162, -0.4254715036571262, -0.18995253708233278, -0.005209916315618015, 0.08437791581649984, 0.11818102624072699, -0.0885219196450192, -0.24549382427958624, 0.1087568569682026, -0.153073303524661, -0.08711040625348687, -0.08966700805821727, 0.04101301194168627, 0.03788073380630483, -0.2686540425509318, 0.09839223407420808, 0.10112514619828847, 0.11992692884960748, -0.1547903127059163, -0.16820605614631579, -0.09489750719589807, 0.008290632712290125, 0.08627108620878841, 0.05409917599526505, 0.15947965246122625, -0.09873951302604779, -0.13193436322066066, 0.3680697469109738, -0.04797795346430527, -0.0779497669073482, 0.14299661280690795, -0.19092986355018285, -0.0735621046910565, 0.1417744812314157, 0.11129774415090055, 0.10731947832253008, -0.12532960587808192, 0.1427745549023649, 0.04307635587630251, 0.19474963046531513, 0.01606757983826495, 0.05590436949238191, 0.16641471618737178, 0.2014203494643822, 0.008144336115696994, 0.11446302201908092, -0.11766099610437378, -0.07047824261626277, -0.17756329240430166, -0.17894651101182693, -0.23406112164495482, 0.1209101049560886, -0.10254942509384207, -0.2128213593815133, 0.38915833572871866, 0.13572249421233892, 0.145226569973159, -0.021656476980612353, 0.16694002227719734, 0.11087132433476173, 0.05148378742252669, 0.025080763880242274, 0.22966883957900955, 0.22680291166977473, 0.14785744333590464, -0.31172348248585074, 0.14408358880910016, -0.02049159253060463] |
1,802.07196 | On Davenport constant of finite abelian groups | $G$ be an additive finite abelian group. The Davenport constant $\mathsf
D(G)$ is the smallest integer $t$ such that every sequence (multiset) $S$ over
$G$ of length $|S|\ge t$ has a non-empty zero-sum subsequence. Recently, B.
Girard proved that for every fixed integer $r > 1$ the Davenport constant
$\mathsf D(C_n^r)$ is asymptotic to $rn$ when $n$ tends to infinity. In this
paper, for every fixed positive integer $r$, we prove that $$\mathsf
D(C_n^r)=rn+O(\frac{n}{\ln n}).$$ This is an explicit version of the above
result of B. Girard. Furthermore, we can get better estimates of the error term
for some $n$ of special types. Finally, we get an asymptotic result for some
finite abelian groups of special types. Our proof combines a classical argument
in the zero-sum theory together with some basic tools and results from analytic
number theory.
| math.CO | g be an additive finite abelian group the davenport constant mathsf dg is the smallest integer t such that every sequence multiset s over g of length sge t has a nonempty zerosum subsequence recently b girard proved that for every fixed integer r 1 the davenport constant mathsf dc_nr is asymptotic to rn when n tends to infinity in this paper for every fixed positive integer r we prove that mathsf dc_nrrnofracnln n this is an explicit version of the above result of b girard furthermore we can get better estimates of the error term for some n of special types finally we get an asymptotic result for some finite abelian groups of special types our proof combines a classical argument in the zerosum theory together with some basic tools and results from analytic number theory | [['g', 'be', 'an', 'additive', 'finite', 'abelian', 'group', 'the', 'davenport', 'constant', 'mathsf', 'dg', 'is', 'the', 'smallest', 'integer', 't', 'such', 'that', 'every', 'sequence', 'multiset', 's', 'over', 'g', 'of', 'length', 'sge', 't', 'has', 'a', 'nonempty', 'zerosum', 'subsequence', 'recently', 'b', 'girard', 'proved', 'that', 'for', 'every', 'fixed', 'integer', 'r', '1', 'the', 'davenport', 'constant', 'mathsf', 'dc_nr', 'is', 'asymptotic', 'to', 'rn', 'when', 'n', 'tends', 'to', 'infinity', 'in', 'this', 'paper', 'for', 'every', 'fixed', 'positive', 'integer', 'r', 'we', 'prove', 'that', 'mathsf', 'dc_nrrnofracnln', 'n', 'this', 'is', 'an', 'explicit', 'version', 'of', 'the', 'above', 'result', 'of', 'b', 'girard', 'furthermore', 'we', 'can', 'get', 'better', 'estimates', 'of', 'the', 'error', 'term', 'for', 'some', 'n', 'of', 'special', 'types', 'finally', 'we', 'get', 'an', 'asymptotic', 'result', 'for', 'some', 'finite', 'abelian', 'groups', 'of', 'special', 'types', 'our', 'proof', 'combines', 'a', 'classical', 'argument', 'in', 'the', 'zerosum', 'theory', 'together', 'with', 'some', 'basic', 'tools', 'and', 'results', 'from', 'analytic', 'number', 'theory']] | [-0.19017543471935722, 0.12437003082024468, -0.08846965739158569, 0.04158649418278839, -0.08808952880747341, -0.22113148582995765, 0.04828785056748462, 0.3086463885174857, -0.33035512562427255, -0.21847827500767178, 0.08742534066119266, -0.30661735387725964, -0.12674937370164252, 0.1719434657772244, -0.1455750151278658, -0.003057749634091225, 0.03796282435801846, 0.14001381133027652, -0.027827142044056757, -0.32074400830875943, 0.29683049101106546, -0.06364917207371305, 0.13195780813004132, 0.041263780591112596, 0.08253632363285525, 0.022298063744825347, -0.013893966628583493, 0.03697694553821175, -0.20660518232503414, 0.03997665474674216, 0.2944177949663114, 0.10570247462536726, 0.34755593799054624, -0.3163417118017269, -0.15886045770926607, 0.1973917410812444, 0.1480006157593043, 0.05645138436510159, -0.01420232271430669, -0.21082057115897812, 0.21838485175674713, -0.16621412687193327, -0.1465867453047799, -0.01811098377737734, 0.17214186617811383, 0.019098873414892564, -0.3454190720700555, -0.040654498111042714, 0.1256590798980108, 0.08909404508217618, -0.017806521661717582, -0.2036859425181454, 0.014495841246443214, 0.09971474204492686, 0.05523023080874096, 0.10102875900316846, -0.007791035561132486, -0.01682097213342786, -0.11967920708573526, 0.299051124519772, -0.13694833602488937, -0.1994519823541244, 0.10326031816226465, -0.1306824715014685, -0.185639698503332, 0.08129610668488399, 0.04364164544321183, 0.19833744821932028, -0.016367104510384336, 0.23359214298177028, -0.1644449684423981, 0.15304133576099518, 0.11408930470546087, 0.029395174345484488, 0.0922086723493757, 0.07694943715059371, 0.1279141916927916, 0.12325448622254448, 0.02504010450232912, 0.02763048952307414, -0.4073829660261119, -0.17044661458305738, -0.18281439787156328, 0.15172126504972025, -0.19309425071491945, -0.16814651081028084, 0.30442817694059127, 0.0849505258288614, 0.14111266100296269, 0.17032280657440424, 0.2108335475747784, 0.10137709496215123, -0.014649957717672267, 0.12092313994653522, 0.04426807251012953, 0.19922129634371097, -0.02379653431492409, -0.19219697947199973, 0.009900233453070676, 0.22166962393180087] |
1,802.07197 | Topological nature of spinons and holons: Elementary excitations from
matrix product states with conserved symmetries | We develop variational matrix product state (MPS) methods with symmetries to
determine dispersion relations of one dimensional quantum lattices as a
function of momentum and preset quantum number. We test our methods on the XXZ
spin chain, the Hubbard model and a non-integrable extended Hubbard model, and
determine the excitation spectra with a precision similar to the one of the
ground state. The formulation in terms of quantum numbers makes the topological
nature of spinons and holons very explicit. In addition, the method also
enables an easy and efficient direct calculation of the necessary magnetic
field or chemical potential required for a certain ground state magnetization
or particle density.
| cond-mat.str-el quant-ph | we develop variational matrix product state mps methods with symmetries to determine dispersion relations of one dimensional quantum lattices as a function of momentum and preset quantum number we test our methods on the xxz spin chain the hubbard model and a nonintegrable extended hubbard model and determine the excitation spectra with a precision similar to the one of the ground state the formulation in terms of quantum numbers makes the topological nature of spinons and holons very explicit in addition the method also enables an easy and efficient direct calculation of the necessary magnetic field or chemical potential required for a certain ground state magnetization or particle density | [['we', 'develop', 'variational', 'matrix', 'product', 'state', 'mps', 'methods', 'with', 'symmetries', 'to', 'determine', 'dispersion', 'relations', 'of', 'one', 'dimensional', 'quantum', 'lattices', 'as', 'a', 'function', 'of', 'momentum', 'and', 'preset', 'quantum', 'number', 'we', 'test', 'our', 'methods', 'on', 'the', 'xxz', 'spin', 'chain', 'the', 'hubbard', 'model', 'and', 'a', 'nonintegrable', 'extended', 'hubbard', 'model', 'and', 'determine', 'the', 'excitation', 'spectra', 'with', 'a', 'precision', 'similar', 'to', 'the', 'one', 'of', 'the', 'ground', 'state', 'the', 'formulation', 'in', 'terms', 'of', 'quantum', 'numbers', 'makes', 'the', 'topological', 'nature', 'of', 'spinons', 'and', 'holons', 'very', 'explicit', 'in', 'addition', 'the', 'method', 'also', 'enables', 'an', 'easy', 'and', 'efficient', 'direct', 'calculation', 'of', 'the', 'necessary', 'magnetic', 'field', 'or', 'chemical', 'potential', 'required', 'for', 'a', 'certain', 'ground', 'state', 'magnetization', 'or', 'particle', 'density']] | [-0.12959323793547142, 0.16948020860989077, -0.06525133431402094, 0.08949367106900713, -0.060877734359456315, -0.15302943862086044, 0.06766306184693624, 0.36696746169563826, -0.23237483528946792, -0.29227541852742434, 0.05146062690358814, -0.23964777995977515, -0.09614398434262621, 0.15859394096833473, 0.06320119845689437, 0.08616831060498953, 0.04632889788913959, 0.06034678166065741, -0.12068854052564898, -0.22498168709576813, 0.29727496682674787, 0.01829075393023465, 0.2807601149270841, 0.059823989648149785, 0.10024347875497962, 0.05827602595859848, 0.08523803303037437, -0.009762855725140747, -0.14361213227528907, 0.12193835165924094, 0.20971007628041669, 0.011482817992362955, 0.19669111853961005, -0.4328154887012932, -0.18292078548837282, 0.07655508385612331, 0.13250333985523108, 0.18454590466710816, -0.012767043995346294, -0.2927122369511138, -0.011319376391555192, -0.23854529157007506, -0.17540895262169182, -0.17446090350858867, -0.03477572678660957, -0.0179368769151902, -0.2649688174982273, 0.09215971158252423, 0.03239400021586601, 0.0686587281525135, -0.07813232543305793, -0.12015112800899586, -0.04975672819707201, 0.10185880446379338, 0.006997082289521916, 0.03146707740347456, 0.081327150063162, -0.16229210756036908, -0.14069117926095331, 0.3695648510795121, -0.044624492504693775, -0.21997273458518224, 0.22053588757188905, -0.11261686947786274, -0.1011477522220924, 0.11023978877880979, 0.10892146346671934, 0.10161170023365305, -0.11521498256559493, 0.1016830879305233, -0.007720036258058059, 0.18692324290034967, -0.03208834265247671, 0.061072083548941745, 0.2158635379319344, 0.11499473212902016, 0.09617117008273361, 0.16434519601251008, -0.10513913030565264, -0.13887543377782638, -0.27243030847075883, -0.21539357423658456, -0.24435550872441553, 0.06699778148989885, -0.08590210065335876, -0.20520515903967237, 0.44097623475101017, 0.1541841146645728, 0.1663964630762508, 0.010599820537133774, 0.2643898372333326, 0.1401643822730066, 0.024316837959880128, 0.060362005602021554, 0.16606918011510044, 0.22710680394484703, 0.07051891807056622, -0.2706130130062683, -0.006344938249147813, 0.10271814781873392] |
1,802.07198 | DarkSide-50 532-day Dark Matter Search with Low-Radioactivity Argon | The DarkSide-50 direct-detection dark matter experiment is a dual-phase argon
time projection chamber operating at Laboratori Nazionali del Gran Sasso. This
paper reports on the blind analysis of a (16,660+-270) kg d exposure using a
target of low-radioactivity argon extracted from underground sources. We find
no events in the dark matter selection box and set a 90% C.L. upper limit on
the dark matter-nucleon spin-independent cross section of 1.14E-44 cm^2
(3.78E-44 cm^2, 3.43E-43 cm^2) for a WIMP mass of 100 GeV/c^2 (1 TeV/c^2, 10
TeV/c^2).
| astro-ph.CO astro-ph.IM | the darkside50 directdetection dark matter experiment is a dualphase argon time projection chamber operating at laboratori nazionali del gran sasso this paper reports on the blind analysis of a 16660270 kg d exposure using a target of lowradioactivity argon extracted from underground sources we find no events in the dark matter selection box and set a 90 cl upper limit on the dark matternucleon spinindependent cross section of 114e44 cm2 378e44 cm2 343e43 cm2 for a wimp mass of 100 gevc2 1 tevc2 10 tevc2 | [['the', 'darkside50', 'directdetection', 'dark', 'matter', 'experiment', 'is', 'a', 'dualphase', 'argon', 'time', 'projection', 'chamber', 'operating', 'at', 'laboratori', 'nazionali', 'del', 'gran', 'sasso', 'this', 'paper', 'reports', 'on', 'the', 'blind', 'analysis', 'of', 'a', '16660270', 'kg', 'd', 'exposure', 'using', 'a', 'target', 'of', 'lowradioactivity', 'argon', 'extracted', 'from', 'underground', 'sources', 'we', 'find', 'no', 'events', 'in', 'the', 'dark', 'matter', 'selection', 'box', 'and', 'set', 'a', '90', 'cl', 'upper', 'limit', 'on', 'the', 'dark', 'matternucleon', 'spinindependent', 'cross', 'section', 'of', '114e44', 'cm2', '378e44', 'cm2', '343e43', 'cm2', 'for', 'a', 'wimp', 'mass', 'of', '100', 'gevc2', '1', 'tevc2', '10', 'tevc2']] | [-0.08135923887545496, 0.17819415886001086, -0.07646487362935771, 0.09910894398014118, 0.010184112982249555, -0.12076358918537512, 0.07415514716585339, 0.26723122454167886, -0.02641219481319925, -0.4289422037516847, 0.034146676597438384, -0.41755310066596224, 0.13041409307423932, 0.19299452761073171, 0.07322784263157735, 0.03015551411541018, 0.03854264926602259, 0.019631932466578336, -0.06261012037888307, -0.29599309905811594, 0.1377463869371072, 0.12829317502321008, 0.2525678987235383, 0.13355116858894442, 0.23764352547292264, -0.008306927024674268, -0.022213144618787883, -0.1938535296674358, -0.16410657605386259, -0.02524901282640151, 0.36551550636355434, 0.10075078447015932, 0.08555017812982385, -0.4310600881085352, -0.09390545862850469, 0.19585190291435997, 0.04642928050210079, -0.05279594214840068, -0.09864455286268271, -0.44943213236897633, 0.05936387363378602, -0.2659570681995477, -0.07552573986762537, 0.15979428969921522, -0.01650595696022113, -0.08654647396969391, -0.21713462781827944, 0.08766730974232893, -0.10568782732028652, 0.014804217685229593, -0.04859243052218248, -0.24420148635536065, 0.09101315080418171, -0.14372329400668357, -0.03229664784948123, 0.0606299855855558, 0.34529375241793414, -0.14038825181979733, -0.022386793035691903, 0.36088676980616136, -0.19140494722918963, -0.05533085595586418, 0.1525231621423621, -0.18427651464640174, -0.15133402288465955, 0.26080242259266934, 0.21410685788012213, 0.11063668014263206, -0.22254457721705145, 0.15928944499723408, -0.10068217743142152, 0.2880245354256512, 0.17814484674391556, -0.05640212996477652, 0.2934194299288922, 0.33824014815467374, 0.13940507290815865, -0.0710581115448422, -0.29913507541641593, 0.08292067658018183, -0.43266162644197914, -0.17188417699969846, -0.04408186165914859, 0.05381315724814978, -0.0014595951147328625, -0.009048329004414242, 0.28753125524999185, 0.07371520002683003, 0.18156300546072515, 0.019031302566513603, 0.33928858102471743, -0.027740339111690524, -0.01314281196804878, -0.0404104398682794, 0.3389429544834535, 0.15147258531026267, 0.11070149382691324, -0.14975791021227192, -0.0012869121978220381, 0.0012118020957266843] |
1,802.07199 | A Parametric MPC Approach to Balancing the Cost of Abstraction for
Differential-Drive Mobile Robots | When designing control strategies for differential-drive mobile robots, one
standard tool is the consideration of a point at a fixed distance along a line
orthogonal to the wheel axis instead of the full pose of the vehicle. This
abstraction supports replacing the non-holonomic, three-state unicycle model
with a much simpler two-state single-integrator model (i.e., a
velocity-controlled point). Yet this transformation comes at a performance
cost, through the robot's precision and maneuverability. This work contains
derivations for expressions of these precision and maneuverability costs in
terms of the transformation's parameters. Furthermore, these costs show that
only selecting the parameter once over the course of an application may cause
an undue loss of precision. Model Predictive Control (MPC) represents one such
method to ameliorate this condition. However, MPC typically realizes a control
signal, rather than a parameter, so this work also proposes a Parametric Model
Predictive Control (PMPC) method for parameter and sampling horizon
optimization. Experimental results are presented that demonstrate the effects
of the parameterization on the deployment of algorithms developed for the
single-integrator model on actual differential-drive mobile robots.
| cs.RO cs.SY | when designing control strategies for differentialdrive mobile robots one standard tool is the consideration of a point at a fixed distance along a line orthogonal to the wheel axis instead of the full pose of the vehicle this abstraction supports replacing the nonholonomic threestate unicycle model with a much simpler twostate singleintegrator model ie a velocitycontrolled point yet this transformation comes at a performance cost through the robots precision and maneuverability this work contains derivations for expressions of these precision and maneuverability costs in terms of the transformations parameters furthermore these costs show that only selecting the parameter once over the course of an application may cause an undue loss of precision model predictive control mpc represents one such method to ameliorate this condition however mpc typically realizes a control signal rather than a parameter so this work also proposes a parametric model predictive control pmpc method for parameter and sampling horizon optimization experimental results are presented that demonstrate the effects of the parameterization on the deployment of algorithms developed for the singleintegrator model on actual differentialdrive mobile robots | [['when', 'designing', 'control', 'strategies', 'for', 'differentialdrive', 'mobile', 'robots', 'one', 'standard', 'tool', 'is', 'the', 'consideration', 'of', 'a', 'point', 'at', 'a', 'fixed', 'distance', 'along', 'a', 'line', 'orthogonal', 'to', 'the', 'wheel', 'axis', 'instead', 'of', 'the', 'full', 'pose', 'of', 'the', 'vehicle', 'this', 'abstraction', 'supports', 'replacing', 'the', 'nonholonomic', 'threestate', 'unicycle', 'model', 'with', 'a', 'much', 'simpler', 'twostate', 'singleintegrator', 'model', 'ie', 'a', 'velocitycontrolled', 'point', 'yet', 'this', 'transformation', 'comes', 'at', 'a', 'performance', 'cost', 'through', 'the', 'robots', 'precision', 'and', 'maneuverability', 'this', 'work', 'contains', 'derivations', 'for', 'expressions', 'of', 'these', 'precision', 'and', 'maneuverability', 'costs', 'in', 'terms', 'of', 'the', 'transformations', 'parameters', 'furthermore', 'these', 'costs', 'show', 'that', 'only', 'selecting', 'the', 'parameter', 'once', 'over', 'the', 'course', 'of', 'an', 'application', 'may', 'cause', 'an', 'undue', 'loss', 'of', 'precision', 'model', 'predictive', 'control', 'mpc', 'represents', 'one', 'such', 'method', 'to', 'ameliorate', 'this', 'condition', 'however', 'mpc', 'typically', 'realizes', 'a', 'control', 'signal', 'rather', 'than', 'a', 'parameter', 'so', 'this', 'work', 'also', 'proposes', 'a', 'parametric', 'model', 'predictive', 'control', 'pmpc', 'method', 'for', 'parameter', 'and', 'sampling', 'horizon', 'optimization', 'experimental', 'results', 'are', 'presented', 'that', 'demonstrate', 'the', 'effects', 'of', 'the', 'parameterization', 'on', 'the', 'deployment', 'of', 'algorithms', 'developed', 'for', 'the', 'singleintegrator', 'model', 'on', 'actual', 'differentialdrive', 'mobile', 'robots']] | [-0.1289804143435712, 0.048689083435394485, -0.06401733120619814, -0.0038616964463456718, -0.09943575557456585, -0.19003029469291383, 0.08754043476838182, 0.39323337727835056, -0.25384877202772227, -0.3217888340671344, 0.11008678140998662, -0.21958302961276746, -0.1365760851888163, 0.21474695385839562, -0.11389651378114608, 0.07376141309889044, 0.09139505480858368, 0.04638796713848354, -0.04934239136698973, -0.21126925003813715, 0.24165755170644598, 0.07448982313150466, 0.2726067545298258, 0.007437710816758638, 0.15853585671456583, 0.027776417863560457, 0.02209476745744657, 0.007769474551581138, -0.10384521829707395, 0.12552072661382527, 0.2442217056103592, 0.13220449271104584, 0.31843504628072905, -0.3937749265063575, -0.21664657598548678, 0.11079777481848005, 0.12639289918907154, 0.11313563058745928, -0.03472908022917558, -0.2742903227664208, 0.06476400767754784, -0.1880260661202769, -0.14395237041574865, -0.042234866829151965, -0.017663096077740192, -0.005025140928786103, -0.30560670772765103, 0.016036382030760552, 0.04739052327948118, 0.0810092902175208, -0.052661290597794945, -0.09147090452863683, -0.002438563106883338, 0.11786464273922442, 0.018375040459259303, 0.017589363735819537, 0.16984007680039415, -0.14372730970251968, -0.14939187749746832, 0.39768149679254833, 0.035483096366180446, -0.24749354948289692, 0.15532133375377755, -0.05542960014927862, -0.1334892950312094, 0.10584575432878217, 0.2140850535517184, 0.10575938421983126, -0.16823693847079832, 0.07391141263498825, -0.001969012452612043, 0.18154049339065556, 0.025396844268094895, -0.009001277616070636, 0.17030631526966458, 0.2141854111248284, 0.14183232274072963, 0.09730267094828023, -0.06469979673017899, -0.14317108767221592, -0.2897001299408769, -0.13314650617617926, -0.1441028462254635, -0.001223031986197821, -0.1154811336401513, -0.1302546984373004, 0.3932709563081283, 0.1832917379560053, 0.1889556655172498, 0.11742242803151964, 0.3705484420997637, 0.09901153321726529, 0.07523677556504958, 0.06423874439765288, 0.22745793302707354, 0.022271275284242237, 0.08106833326502823, -0.2083986517940726, 0.0911907678568871, 0.0325011904689603] |
1,802.072 | Asymptotics of Hitchin's metric on the Hitchin section | We consider Hitchin's hyperk\"ahler metric $g$ on the moduli space
$\mathcal{M}$ of degree zero $\mathrm{SL}(2)$-Higgs bundles over a compact
Riemann surface. It has been conjectured that, when one goes to infinity along
a generic ray in $\mathcal{M}$, $g$ converges to an explicit "semiflat" metric
$g^{\mathrm{sf}}$, with an exponential rate of convergence. We show that this
is indeed the case for the restriction of $g$ to the tangent bundle of the
Hitchin section $\mathcal{B} \subset \mathcal{M}$.
| math.DG | we consider hitchins hyperkahler metric g on the moduli space mathcalm of degree zero mathrmsl2higgs bundles over a compact riemann surface it has been conjectured that when one goes to infinity along a generic ray in mathcalm g converges to an explicit semiflat metric gmathrmsf with an exponential rate of convergence we show that this is indeed the case for the restriction of g to the tangent bundle of the hitchin section mathcalb subset mathcalm | [['we', 'consider', 'hitchins', 'hyperkahler', 'metric', 'g', 'on', 'the', 'moduli', 'space', 'mathcalm', 'of', 'degree', 'zero', 'mathrmsl2higgs', 'bundles', 'over', 'a', 'compact', 'riemann', 'surface', 'it', 'has', 'been', 'conjectured', 'that', 'when', 'one', 'goes', 'to', 'infinity', 'along', 'a', 'generic', 'ray', 'in', 'mathcalm', 'g', 'converges', 'to', 'an', 'explicit', 'semiflat', 'metric', 'gmathrmsf', 'with', 'an', 'exponential', 'rate', 'of', 'convergence', 'we', 'show', 'that', 'this', 'is', 'indeed', 'the', 'case', 'for', 'the', 'restriction', 'of', 'g', 'to', 'the', 'tangent', 'bundle', 'of', 'the', 'hitchin', 'section', 'mathcalb', 'subset', 'mathcalm']] | [-0.2176342698783703, 0.06079585440034264, -0.09916403699564198, 0.0435358548268982, -0.13962640328179687, -0.12333688618334597, -0.022306742312463178, 0.36304190350466803, -0.2955913849379102, -0.14540861131087557, 0.057558209014967186, -0.26450190105641336, -0.14147300847282965, 0.1788590299475887, -0.15364321305939596, 0.010831099564898503, 0.07233516268483171, 0.1675597691066461, -0.10424047920929447, -0.31760333054093004, 0.43446503142022513, 0.0036355807981772784, 0.26372245579243525, 0.043826083340107985, 0.18088047736251012, -0.024503045960980123, 0.06578523547656528, -0.013325409294338897, -0.16446002282633618, 0.08151906261807434, 0.2675528777380512, 0.10197995095641339, 0.22583459641733397, -0.36097140547066725, -0.1986051060421606, 0.2360565152453029, 0.1255720485359022, -0.04489039831271727, 0.04990503257491358, -0.2550453653221006, 0.11553161485720273, -0.1432375497400381, -0.20951223388722498, -0.03717510272072603, 0.1126179106482496, -0.036276025531736956, -0.21657100104892704, -0.06826720588317473, 0.10420170751693722, 0.030709811524577336, -0.0509909240749014, -0.06379947124993147, -0.1356896760758676, 0.042063648243552736, 0.09822410503434247, 0.15194828418555528, 0.08869438379849881, -0.042179030197200505, -0.03902572866733352, 0.33909518870027505, -0.15161898086000591, -0.28089376138395644, 0.09864735448962614, -0.16665488947182894, -0.14800756807400756, 0.17712358847158413, 0.1187275998575026, 0.19575146463546544, 0.011933290956769942, 0.24034288456689004, -0.14407990889445152, 0.07612978849457959, 0.09364184804822076, -0.055549308861771673, 0.13717293366789818, 0.13434492190661904, 0.1774633029246167, 0.11336506786437271, -0.03645771053262463, 0.003015303933253027, -0.4178955211903747, -0.23218825067814491, -0.1367940126522763, 0.23180861623115737, -0.1537119359214956, -0.18506664695052352, 0.34250404728474476, 0.02244793188643374, 0.25469410527905784, 0.14387219130023293, 0.21227837180438108, 0.06625614957947744, 0.008880075922057237, 0.10680268290769612, 0.19208097721973103, 0.22792335160153165, -0.047213937010781915, -0.14365979578754265, -0.053652276323266225, 0.18752421110817422] |
1,802.07201 | Inference of gene loss rates after whole genome duplications at early
vertebrates through ancient genome reconstructions | The famous 2R hypothesis was first proposed by Susumu Ohno in 1970. It states
that the two whole genome duplications had shaped the genome of early
vertebrates. The most convincing evidence for 2R hypothesis comes from the 4:1
ratio chromosomal regions that have preserved both gene content and order in
vertebrates compared with closely related. However, due to the shortage of such
strict evidence, the 2R hypothesis is still under debates.
Here, we present a combined perspective of phylogenetic and genomic homology
to revisit the hypothesis of 2R whole genome duplications. Ancestral vertebrate
genomes as well as ancient duplication events were created from 17 extant
vertebrate species. Extant descendants from the duplication events at early
vertebrates were extracted and reorganized to partial genomes. We then examined
the gene order based synteny, and projected back to phylogenetic gene trees for
examination of synteny evidence of the reconstructed early vertebrate genes. We
identified 7877 ancestral genes that were created from 3026 duplication events
at early vertebrates, and more than 50% of the duplication events show synteny
evidence. Thus, our reconstructions provide very strong evidence for the 2R
hypothesis.
We also reconstructed the genome of early vertebrates, and built a model of
the gene gains and losses in early vertebrates. We estimated that there were
about 12,000 genes in early vertebrates before 2R, and the probability of a
random gene get lost after the first round of whole genome duplication is
around 0.45, and the probability of a random gene get lost after the second
round of whole genome duplication is around 0.55.
This research provides convincing evidence for the 2R hypothesis, and may
provide further insights in vertebral evolution.
Data availability: https://github.com/haimingt/Ohnologs-and-2R-WGD
| q-bio.PE q-bio.GN | the famous 2r hypothesis was first proposed by susumu ohno in 1970 it states that the two whole genome duplications had shaped the genome of early vertebrates the most convincing evidence for 2r hypothesis comes from the 41 ratio chromosomal regions that have preserved both gene content and order in vertebrates compared with closely related however due to the shortage of such strict evidence the 2r hypothesis is still under debates here we present a combined perspective of phylogenetic and genomic homology to revisit the hypothesis of 2r whole genome duplications ancestral vertebrate genomes as well as ancient duplication events were created from 17 extant vertebrate species extant descendants from the duplication events at early vertebrates were extracted and reorganized to partial genomes we then examined the gene order based synteny and projected back to phylogenetic gene trees for examination of synteny evidence of the reconstructed early vertebrate genes we identified 7877 ancestral genes that were created from 3026 duplication events at early vertebrates and more than 50 of the duplication events show synteny evidence thus our reconstructions provide very strong evidence for the 2r hypothesis we also reconstructed the genome of early vertebrates and built a model of the gene gains and losses in early vertebrates we estimated that there were about 12000 genes in early vertebrates before 2r and the probability of a random gene get lost after the first round of whole genome duplication is around 045 and the probability of a random gene get lost after the second round of whole genome duplication is around 055 this research provides convincing evidence for the 2r hypothesis and may provide further insights in vertebral evolution data availability httpsgithubcomhaimingtohnologsand2rwgd | [['the', 'famous', '2r', 'hypothesis', 'was', 'first', 'proposed', 'by', 'susumu', 'ohno', 'in', '1970', 'it', 'states', 'that', 'the', 'two', 'whole', 'genome', 'duplications', 'had', 'shaped', 'the', 'genome', 'of', 'early', 'vertebrates', 'the', 'most', 'convincing', 'evidence', 'for', '2r', 'hypothesis', 'comes', 'from', 'the', '41', 'ratio', 'chromosomal', 'regions', 'that', 'have', 'preserved', 'both', 'gene', 'content', 'and', 'order', 'in', 'vertebrates', 'compared', 'with', 'closely', 'related', 'however', 'due', 'to', 'the', 'shortage', 'of', 'such', 'strict', 'evidence', 'the', '2r', 'hypothesis', 'is', 'still', 'under', 'debates', 'here', 'we', 'present', 'a', 'combined', 'perspective', 'of', 'phylogenetic', 'and', 'genomic', 'homology', 'to', 'revisit', 'the', 'hypothesis', 'of', '2r', 'whole', 'genome', 'duplications', 'ancestral', 'vertebrate', 'genomes', 'as', 'well', 'as', 'ancient', 'duplication', 'events', 'were', 'created', 'from', '17', 'extant', 'vertebrate', 'species', 'extant', 'descendants', 'from', 'the', 'duplication', 'events', 'at', 'early', 'vertebrates', 'were', 'extracted', 'and', 'reorganized', 'to', 'partial', 'genomes', 'we', 'then', 'examined', 'the', 'gene', 'order', 'based', 'synteny', 'and', 'projected', 'back', 'to', 'phylogenetic', 'gene', 'trees', 'for', 'examination', 'of', 'synteny', 'evidence', 'of', 'the', 'reconstructed', 'early', 'vertebrate', 'genes', 'we', 'identified', '7877', 'ancestral', 'genes', 'that', 'were', 'created', 'from', '3026', 'duplication', 'events', 'at', 'early', 'vertebrates', 'and', 'more', 'than', '50', 'of', 'the', 'duplication', 'events', 'show', 'synteny', 'evidence', 'thus', 'our', 'reconstructions', 'provide', 'very', 'strong', 'evidence', 'for', 'the', '2r', 'hypothesis', 'we', 'also', 'reconstructed', 'the', 'genome', 'of', 'early', 'vertebrates', 'and', 'built', 'a', 'model', 'of', 'the', 'gene', 'gains', 'and', 'losses', 'in', 'early', 'vertebrates', 'we', 'estimated', 'that', 'there', 'were', 'about', '12000', 'genes', 'in', 'early', 'vertebrates', 'before', '2r', 'and', 'the', 'probability', 'of', 'a', 'random', 'gene', 'get', 'lost', 'after', 'the', 'first', 'round', 'of', 'whole', 'genome', 'duplication', 'is', 'around', '045', 'and', 'the', 'probability', 'of', 'a', 'random', 'gene', 'get', 'lost', 'after', 'the', 'second', 'round', 'of', 'whole', 'genome', 'duplication', 'is', 'around', '055', 'this', 'research', 'provides', 'convincing', 'evidence', 'for', 'the', '2r', 'hypothesis', 'and', 'may', 'provide', 'further', 'insights', 'in', 'vertebral', 'evolution', 'data', 'availability', 'httpsgithubcomhaimingtohnologsand2rwgd']] | [-0.08381255146154683, 0.10948477369827296, -0.03898430333277572, 0.13828687871712184, -0.0044109659363593, -0.10426661341925175, 0.09194355356399414, 0.33316092943228004, -0.21330320967120936, -0.2949404707649178, 0.08463245625094938, -0.304760412081054, -0.19320956386612317, 0.13263572553350902, -0.10856414480397095, -0.01625124281961538, 0.1694051244763476, 0.0580947362392929, 0.07163605372932494, -0.28267905215685685, 0.22928497660910377, 0.09564543020027262, 0.2410210340051821, -0.011446575941400272, 0.0864934669706688, -0.060908620486150256, -0.09650816958706947, -0.03454894265529804, -0.15469730780714205, 0.09396097302060265, 0.30720616926502986, 0.29577526329959397, 0.2885818714813904, -0.4508231730008706, -0.17245151710676346, 0.11519667114860745, 0.1989270657206808, 0.16483197856815499, -0.06795014883585934, -0.25920201185082054, 0.1306136561459307, -0.12333554780490642, -0.08258564456362641, 0.024619026871949487, 0.06220858809176752, -0.03101595847939716, -0.23211828151226904, 0.18004603050924445, 0.04700552458355425, 0.1492090000886981, -0.07072632307218664, -0.16626855593833684, -0.11307564618508605, 0.183452282716194, 0.12446585497844104, 0.05920900107068867, 0.141475429552076, -0.07020768459587079, -0.13861593319143467, 0.2932582198556459, 0.0020169666679874434, -0.09747646876782287, 0.20184371922087826, -0.1589771477772017, -0.18838530339784787, 0.1686099625565784, 0.09145563517424819, 0.059386173266554355, -0.2110980596781678, -0.016406189405278635, -0.001790749268343215, 0.18126135936766755, 0.18699921943106107, -0.029394634518543735, 0.2178580744380286, 0.1759892261380835, -0.02869343129490983, 0.115178400895639, -0.12638260863365924, -0.07758684946322437, -0.20799168880598323, -0.15771971100652155, -0.10861802615674165, 0.06305381840360536, -0.11914691503415227, -0.151954044222904, 0.37872557872099405, 0.09568045198112989, 0.20707016441019568, 0.09970821243196402, 0.2105701633389461, -0.04660323570231951, 0.13298746655450963, 0.015078904782169724, 0.12214464326271458, 0.07042756133766623, 0.07047940985995617, -0.19728084805848947, 0.18508207757111692, 0.01021914859344369] |
1,802.07202 | Regularity of bicyclic Graphs and their powers | Let $I(G)$ be the edge ideal of a bicyclic graph. In this paper, we
characterize the Castelnuovo-Mumford regularity of $I(G)$ in terms of the
induced matching number of $G$. For the base case of this family of graphs,
i.e. dumbbell graph, we explicitly compute the induced matching number.
Moreover, we prove that $
\operatorname{reg}(I(G)^q)=2q+\operatorname{reg}(I(G))-2$, for all $ q\geq 1 $,
when $ G $ is a dumbbell graph with a connecting path having no more than two
vertices.
| math.AC | let ig be the edge ideal of a bicyclic graph in this paper we characterize the castelnuovomumford regularity of ig in terms of the induced matching number of g for the base case of this family of graphs ie dumbbell graph we explicitly compute the induced matching number moreover we prove that operatornameregigq2qoperatornameregig2 for all qgeq 1 when g is a dumbbell graph with a connecting path having no more than two vertices | [['let', 'ig', 'be', 'the', 'edge', 'ideal', 'of', 'a', 'bicyclic', 'graph', 'in', 'this', 'paper', 'we', 'characterize', 'the', 'castelnuovomumford', 'regularity', 'of', 'ig', 'in', 'terms', 'of', 'the', 'induced', 'matching', 'number', 'of', 'g', 'for', 'the', 'base', 'case', 'of', 'this', 'family', 'of', 'graphs', 'ie', 'dumbbell', 'graph', 'we', 'explicitly', 'compute', 'the', 'induced', 'matching', 'number', 'moreover', 'we', 'prove', 'that', 'operatornameregigq2qoperatornameregig2', 'for', 'all', 'qgeq', '1', 'when', 'g', 'is', 'a', 'dumbbell', 'graph', 'with', 'a', 'connecting', 'path', 'having', 'no', 'more', 'than', 'two', 'vertices']] | [-0.20416010395436185, 0.102780426826535, -0.021440586670198374, 0.0010838957758904952, -0.07964550038256372, -0.10122138595518966, -0.0026057289974738117, 0.38698921590629554, -0.28452948744719225, -0.30531186592351234, 0.056151726325171895, -0.30880149169307614, -0.15364889016685387, 0.11916625494551328, -0.07646078546693186, -0.03619369435020619, 0.0918110636412166, 0.1416688659745786, 0.016486175820722967, -0.22011006873112315, 0.3505602835664629, -0.06399497921099989, 0.17181883553146488, 0.05136184907880508, 0.055662465928536325, 0.04632881278747744, 0.01782646648805692, 0.12464625691387078, -0.22033149250122128, 0.1600163542882203, 0.23932690752877128, 0.091778862066955, 0.22292390204448667, -0.4051606863374925, -0.164219696721476, 0.2792458818035407, 0.11381812026310298, 0.027130299002035625, 0.016163416432189277, -0.16002291508549307, 0.21878674213722762, -0.17160282667545187, -0.11438748235296872, 0.017957646018152848, 0.0930884232899795, 0.0001433126162737608, -0.3235820945119485, -0.03445813954911298, 0.1143663633071507, 0.0943626506616258, 0.05192384385089907, -0.13684957951772958, -0.08121926146688768, 0.08229460389904691, -0.07249214027089895, 0.05027994598236142, 0.016390499484259635, -0.17410593059806465, -0.1545567620915891, 0.3769000711383544, -0.05238618164670091, -0.16841960487525082, 0.11916629303919359, -0.16158321951904023, -0.1540898614588918, 0.08053911357031514, 0.1068209683160401, 0.15062201154392418, -0.07818834541608845, 0.13030967987530553, -0.13413221173606063, 0.08138316344573265, 0.15454286040686485, 0.03731129487763004, 0.09445003380955717, 0.15301794719481324, 0.19644500070717186, 0.22042526428089737, -0.015299152776909372, 0.04529343505985, -0.32699389182703775, -0.16563614203672236, -0.24905035846717916, 0.07826131622035366, -0.18669089811414274, -0.1872734256192214, 0.4555515793359114, 0.11178834940720764, 0.19836981907590395, 0.1161687300967363, 0.21773703210055828, 0.0734582992671575, -0.019136870422193572, 0.2114043815397761, 0.10890908468152499, 0.16102042944274014, -0.07271540578868654, -0.16855110311492658, 0.05234442087627637, 0.13821813161484897] |
1,802.07203 | Endomorphisms of Koszul complexes: formality and application to
deformation theory | We study the differential graded Lie algebra of endomorphisms of the Koszul
resolution of a regular sequence on a unitary commutative $K$-algebra $R$ and
we prove that it is homotopy abelian over $K$, while it is generally not formal
over $R$. We apply this result to prove an annihilation theorem for
obstructions of (derived) deformations of locally complete intersection ideal
sheaves on projective schemes.
| math.AG math.QA | we study the differential graded lie algebra of endomorphisms of the koszul resolution of a regular sequence on a unitary commutative kalgebra r and we prove that it is homotopy abelian over k while it is generally not formal over r we apply this result to prove an annihilation theorem for obstructions of derived deformations of locally complete intersection ideal sheaves on projective schemes | [['we', 'study', 'the', 'differential', 'graded', 'lie', 'algebra', 'of', 'endomorphisms', 'of', 'the', 'koszul', 'resolution', 'of', 'a', 'regular', 'sequence', 'on', 'a', 'unitary', 'commutative', 'kalgebra', 'r', 'and', 'we', 'prove', 'that', 'it', 'is', 'homotopy', 'abelian', 'over', 'k', 'while', 'it', 'is', 'generally', 'not', 'formal', 'over', 'r', 'we', 'apply', 'this', 'result', 'to', 'prove', 'an', 'annihilation', 'theorem', 'for', 'obstructions', 'of', 'derived', 'deformations', 'of', 'locally', 'complete', 'intersection', 'ideal', 'sheaves', 'on', 'projective', 'schemes']] | [-0.21333170950310887, -0.015750740208886782, -0.10887597338296473, 0.058482921094764606, -0.10553078938391991, -0.15668747380550485, -0.054322137859344366, 0.3862922436092049, -0.39811244735028595, -0.1248490948419203, 0.09802358001616085, -0.19141874139313586, -0.10435515927383676, 0.22333115978108253, -0.20126496441662312, -0.0724590529625857, 0.07108006021007895, 0.1411867205897579, -0.08505077627341961, -0.3428266721748514, 0.43974501150660217, -0.02535016674664803, 0.21475512862781443, 0.046635737062388216, 0.12794883075912367, 0.042547356089926325, -0.0569014356151456, 0.013979117029521149, -0.19644158514404353, 0.09867649422085378, 0.3751758490689099, 0.060137024825962726, 0.15716257886379026, -0.34333749453071505, -0.09510719163517933, 0.21802694014331792, 0.14631426247797208, 0.01654785341452225, 0.019092483231361257, -0.25906105744070373, 0.18547471429337747, -0.23830140819154622, -0.11000840322230943, -0.11596180647029541, 0.11295670106483158, -0.01630626992573525, -0.27223268415127677, -0.02825577241674182, 0.15821788963512518, 0.21160473251075018, -0.07498175663931761, -0.007404524811136071, -0.10070564660600212, -0.0021660994098056108, -0.09108551120880293, 0.007508486025471939, 0.1290834247120074, -0.04758187596235075, -0.13087056385120377, 0.35052575354347937, -0.06256948465306778, -0.21007947652833536, 0.11412434937301441, -0.20492153393570334, -0.15342861877434189, 0.14442019919806626, 0.020031319960253313, 0.22982537282223348, 0.010010294507083017, 0.24699510652772005, -0.17271703365258873, 0.07054782054910902, 0.09057180416129995, 0.004766632519022096, 0.14018857194241718, 0.09335931619716575, 0.13717487952089868, 0.08310526219429448, 0.06553345549764344, -0.015165566066571046, -0.37415997456992045, -0.20448047888930887, -0.09744539587336476, 0.21812305585285685, -0.10081152947873306, -0.17942912147555035, 0.3818414976121858, 0.10536805734591326, 0.1542529632570222, 0.1698420804896159, 0.2499664601054974, 0.03401429463701788, 0.07348078663926572, 0.04379526156117208, 0.10454764470341615, 0.29017650565947406, -0.04272778607264627, -0.09392837772611529, -0.08123377674928633, 0.2490337764029391] |
1,802.07204 | Automation of gene function prediction through modeling human curators'
decisions in GO phylogenetic annotation project | The Gene Ontology Consortium launched the GO-PAINT project (Phylogenetic
Annotation and INference Tool) 9 years ago and is currently being used in the
GO Reference Genome Annotation Project to support inference of GO function
terms (molecular function, cellular component and biological process) by
homology. PAINT uses a phylogenetic model to infer gene function by homology, a
process that requires manual curation of experienced biocurators. Tremendous
amount of time and efforts have been spent on the GO-PAINT project yielding
more than 4000 fully annotated phylogenetic families with more than 170,000
annotations. These preliminary data have thus enabled potential algorithmic
representation and automatic solvation of the additional 9000 unannoated
phylogenetic families. Here we present an automated pipeline for phylogenetic
annotation and inference, which simulates the standard annotation procedures of
curators and models the curators' decisions during the manual curation process.
The pipeline has been built into the newest version of PAINT software available
at http://www.pantherdb.org/downloads/index.jsp. The standalone automation
pipeline and datasets are available at
https://github.com/haimingt/GO-PAINT-automation
| q-bio.QM q-bio.GN | the gene ontology consortium launched the gopaint project phylogenetic annotation and inference tool 9 years ago and is currently being used in the go reference genome annotation project to support inference of go function terms molecular function cellular component and biological process by homology paint uses a phylogenetic model to infer gene function by homology a process that requires manual curation of experienced biocurators tremendous amount of time and efforts have been spent on the gopaint project yielding more than 4000 fully annotated phylogenetic families with more than 170000 annotations these preliminary data have thus enabled potential algorithmic representation and automatic solvation of the additional 9000 unannoated phylogenetic families here we present an automated pipeline for phylogenetic annotation and inference which simulates the standard annotation procedures of curators and models the curators decisions during the manual curation process the pipeline has been built into the newest version of paint software available at httpwwwpantherdborgdownloadsindexjsp the standalone automation pipeline and datasets are available at httpsgithubcomhaimingtgopaintautomation | [['the', 'gene', 'ontology', 'consortium', 'launched', 'the', 'gopaint', 'project', 'phylogenetic', 'annotation', 'and', 'inference', 'tool', '9', 'years', 'ago', 'and', 'is', 'currently', 'being', 'used', 'in', 'the', 'go', 'reference', 'genome', 'annotation', 'project', 'to', 'support', 'inference', 'of', 'go', 'function', 'terms', 'molecular', 'function', 'cellular', 'component', 'and', 'biological', 'process', 'by', 'homology', 'paint', 'uses', 'a', 'phylogenetic', 'model', 'to', 'infer', 'gene', 'function', 'by', 'homology', 'a', 'process', 'that', 'requires', 'manual', 'curation', 'of', 'experienced', 'biocurators', 'tremendous', 'amount', 'of', 'time', 'and', 'efforts', 'have', 'been', 'spent', 'on', 'the', 'gopaint', 'project', 'yielding', 'more', 'than', '4000', 'fully', 'annotated', 'phylogenetic', 'families', 'with', 'more', 'than', '170000', 'annotations', 'these', 'preliminary', 'data', 'have', 'thus', 'enabled', 'potential', 'algorithmic', 'representation', 'and', 'automatic', 'solvation', 'of', 'the', 'additional', '9000', 'unannoated', 'phylogenetic', 'families', 'here', 'we', 'present', 'an', 'automated', 'pipeline', 'for', 'phylogenetic', 'annotation', 'and', 'inference', 'which', 'simulates', 'the', 'standard', 'annotation', 'procedures', 'of', 'curators', 'and', 'models', 'the', 'curators', 'decisions', 'during', 'the', 'manual', 'curation', 'process', 'the', 'pipeline', 'has', 'been', 'built', 'into', 'the', 'newest', 'version', 'of', 'paint', 'software', 'available', 'at', 'httpwwwpantherdborgdownloadsindexjsp', 'the', 'standalone', 'automation', 'pipeline', 'and', 'datasets', 'are', 'available', 'at', 'httpsgithubcomhaimingtgopaintautomation']] | [-0.017919123053397466, 0.0232352304996818, -0.054415495836329236, 0.07477264457636783, -0.13017378032761567, -0.13560858269846893, 0.0719587910622712, 0.41107046918330503, -0.21910676263166662, -0.40010846753993745, 0.08907959123195114, -0.2853242236991189, -0.10275474220884175, 0.19296655222873757, -0.0843456368893385, 0.07982057501573729, 0.2176389605030889, -0.0038201883582610497, 0.03315152546620775, -0.2979368874744241, 0.26351325508355183, 0.09884888678052332, 0.29596543546524373, -0.008620562203218527, 0.10281438898675356, -0.0404798807237368, -0.15358373686955665, -0.06659318158061162, -0.12169735468622876, 0.17393747775497126, 0.351885523765995, 0.3057677516996672, 0.32258431332280174, -0.45571685149157537, -0.1953966380745361, 0.07444808729246401, 0.1778656075136807, 0.11355162257650245, -0.01776069975505978, -0.3137821902909988, 0.0552039915029714, -0.2170428539069275, -0.022809377329164666, -0.10978676602052807, 0.029393600193854376, -0.043133864238198046, -0.21421707807038026, 0.030035490292430963, 0.010752717899512263, 0.19021702704868645, -0.022477466568845927, -0.13761782891977625, -0.06854014959896597, 0.20980364769178478, 0.01690603565749612, 0.12074539638301239, 0.167979191611462, -0.10530211735233853, -0.14714748212843662, 0.3296060131603404, 0.008383438733359025, -0.15448819768108144, 0.20129518283389602, -0.03486263785876711, -0.2161874608799839, 0.15923829149171898, 0.16559238656412198, 0.08640686747959897, -0.26889848278222395, 0.05160183293296944, 0.06931030660236985, 0.22457284170653835, 0.062398818524884464, -0.060238882589089104, 0.20444665022217964, 0.2823235598817185, -0.0032751557706041804, 0.10703294914027181, -0.09126125518203111, -0.06771058380114552, -0.18882161007510334, -0.16303084675764926, -0.11782825353431597, -1.7571102391598345e-05, -0.08657297257354625, -0.19926223551406513, 0.35418293148255614, 0.17761486067872825, 0.07370804164255085, 0.09361534839852631, 0.32132693431988546, -0.052269051765103505, 0.1689357132457224, 0.04075116730189022, 0.11333175593562707, 0.008805625136246126, 0.14542215538234746, -0.11803756092153371, 0.16108715845215948, 0.056241812134350214] |
1,802.07205 | Information gain and loss for a quantum Maxwell's demon | We use continuous weak measurements of a driven superconducting qubit to
experimentally study the information dynamics of a quantum Maxwell's demon. We
show how information gained by a demon who can track single quantum
trajectories of the qubit can be converted into work using quantum coherent
feedback. We verify the validity of a quantum fluctuation theorem with feedback
by utilizing information obtained along single trajectories. We demonstrate, in
particular, that quantum backaction can lead to a loss of information in
imperfect measurements. We furthermore probe the transition between information
gain and loss by varying the initial purity of the qubit.
| quant-ph cond-mat.mes-hall cond-mat.stat-mech | we use continuous weak measurements of a driven superconducting qubit to experimentally study the information dynamics of a quantum maxwells demon we show how information gained by a demon who can track single quantum trajectories of the qubit can be converted into work using quantum coherent feedback we verify the validity of a quantum fluctuation theorem with feedback by utilizing information obtained along single trajectories we demonstrate in particular that quantum backaction can lead to a loss of information in imperfect measurements we furthermore probe the transition between information gain and loss by varying the initial purity of the qubit | [['we', 'use', 'continuous', 'weak', 'measurements', 'of', 'a', 'driven', 'superconducting', 'qubit', 'to', 'experimentally', 'study', 'the', 'information', 'dynamics', 'of', 'a', 'quantum', 'maxwells', 'demon', 'we', 'show', 'how', 'information', 'gained', 'by', 'a', 'demon', 'who', 'can', 'track', 'single', 'quantum', 'trajectories', 'of', 'the', 'qubit', 'can', 'be', 'converted', 'into', 'work', 'using', 'quantum', 'coherent', 'feedback', 'we', 'verify', 'the', 'validity', 'of', 'a', 'quantum', 'fluctuation', 'theorem', 'with', 'feedback', 'by', 'utilizing', 'information', 'obtained', 'along', 'single', 'trajectories', 'we', 'demonstrate', 'in', 'particular', 'that', 'quantum', 'backaction', 'can', 'lead', 'to', 'a', 'loss', 'of', 'information', 'in', 'imperfect', 'measurements', 'we', 'furthermore', 'probe', 'the', 'transition', 'between', 'information', 'gain', 'and', 'loss', 'by', 'varying', 'the', 'initial', 'purity', 'of', 'the', 'qubit']] | [-0.12694296942674554, 0.1771172573650256, -0.1291715010558255, 0.02728964876383543, -0.04633797693997622, -0.18220543138217182, 0.1045730653614737, 0.36727028007619084, -0.28215692633297296, -0.29949904887937007, 0.03858163172611967, -0.28616936003323645, -0.11971923852455803, 0.24406417332589625, -0.07745215156581253, 0.09855373827274888, 0.09797257946804167, 0.03624247539322823, -0.0963648235076107, -0.22821575450710951, 0.3229315448179841, 0.05353127857553772, 0.3014388698711991, 0.04531857149675488, 0.18364600101020187, 0.03635391584131867, 0.0343276200722903, 0.0427547830180265, -0.1382975458450528, 0.10018946477212012, 0.23182768656639383, 0.12039549093460664, 0.29288287840783594, -0.46827262625098226, -0.24786858941428364, 0.06266364153241738, 0.10789690809353487, 0.2050911698769778, -0.0818072519917041, -0.35185457618907096, 0.04946070742793381, -0.167193920314312, -0.04946944058872759, -0.11894476970424876, -0.09777378522790968, 0.0029309339511746657, -0.25476654407102617, 0.06939013996627182, 0.08627992984373123, 0.012625321662053466, -0.007582255406305194, 0.07173220098251477, -0.019508190031629055, 0.18204278369201346, -0.09196696419268846, -0.02069787132437341, 0.20314247938804328, -0.13386540124658494, -0.18959218552103266, 0.2981009090412408, -0.08968247118173167, -0.21271212339401246, 0.09899247698485851, -0.1469365508062765, -0.050613581808283924, 0.0704488536529243, 0.15168727887794375, 0.06908854415640235, -0.18247420177329332, 0.011212310278206133, -0.013369779400527478, 0.23715704487171024, 0.05217652510851622, 0.12874824391212314, 0.220874451296404, 0.11587423956254497, 0.028594104209914803, 0.21886750087025575, -0.07773190751671791, -0.1568340937141329, -0.2878306655911729, -0.18395758625585587, -0.22071124618873, 0.15165276575600728, -0.039249255214672304, -0.058882968556135895, 0.3586844572424889, 0.18108140472322704, 0.18602750116493552, -0.04100205780938268, 0.3237386265164241, 0.1387685721437447, 0.025458903862163425, 0.03759604647755623, 0.27053141249343754, 0.17487849885364995, 0.10412542775273323, -0.2935709908232093, 0.04231626775115729, -0.004464938584715128] |
1,802.07206 | The Fifth Force in the Local Cosmic Web | Extensions of the standard models of particle physics and cosmology often
lead to long-range fifth forces with properties dependent on gravitational
environment. Fifth forces on astrophysical scales are best studied in the
cosmic web where perturbation theory breaks down. We present constraints on
chameleon- and symmetron-screened fifth forces with Yukawa coupling and
megaparsec range -- as well as unscreened fifth forces with differential
coupling to galactic mass components -- by searching for the displacements they
predict between galaxies' stars and gas. Taking data from the Alfalfa HI
survey, identifying galaxies' gravitational environments with the maps of
Desmond et al. (2018a) and forward-modelling with a Bayesian likelihood
framework, we set upper bounds on fifth-force strength relative to Newtonian
gravity from $\Delta G/G_N < \text{few} \: \times 10^{-4}$ for range $\lambda_C
= 50$ Mpc, to $\Delta G/G_N \lesssim 0.1$ for $\lambda_C = 500$ kpc. In $f(R)$
gravity this requires $f_{R0} < \text{few} \: \times \: 10^{-8}$. The analogous
bounds without screening are $\Delta G/G_N < \text{few} \: \times 10^{-4}$ and
$\Delta G/G_N < \text{few} \times 10^{-3}$. These are the tightest and among
the only fifth-force constraints on galaxy scales. We show how our results may
be strengthened with future survey data and identify the key features of an
observational programme for furthering fifth-force tests beyond the Solar
System.
| astro-ph.CO astro-ph.GA gr-qc | extensions of the standard models of particle physics and cosmology often lead to longrange fifth forces with properties dependent on gravitational environment fifth forces on astrophysical scales are best studied in the cosmic web where perturbation theory breaks down we present constraints on chameleon and symmetronscreened fifth forces with yukawa coupling and megaparsec range as well as unscreened fifth forces with differential coupling to galactic mass components by searching for the displacements they predict between galaxies stars and gas taking data from the alfalfa hi survey identifying galaxies gravitational environments with the maps of desmond et al 2018a and forwardmodelling with a bayesian likelihood framework we set upper bounds on fifthforce strength relative to newtonian gravity from delta gg_n textfew times 104 for range lambda_c 50 mpc to delta gg_n lesssim 01 for lambda_c 500 kpc in fr gravity this requires f_r0 textfew times 108 the analogous bounds without screening are delta gg_n textfew times 104 and delta gg_n textfew times 103 these are the tightest and among the only fifthforce constraints on galaxy scales we show how our results may be strengthened with future survey data and identify the key features of an observational programme for furthering fifthforce tests beyond the solar system | [['extensions', 'of', 'the', 'standard', 'models', 'of', 'particle', 'physics', 'and', 'cosmology', 'often', 'lead', 'to', 'longrange', 'fifth', 'forces', 'with', 'properties', 'dependent', 'on', 'gravitational', 'environment', 'fifth', 'forces', 'on', 'astrophysical', 'scales', 'are', 'best', 'studied', 'in', 'the', 'cosmic', 'web', 'where', 'perturbation', 'theory', 'breaks', 'down', 'we', 'present', 'constraints', 'on', 'chameleon', 'and', 'symmetronscreened', 'fifth', 'forces', 'with', 'yukawa', 'coupling', 'and', 'megaparsec', 'range', 'as', 'well', 'as', 'unscreened', 'fifth', 'forces', 'with', 'differential', 'coupling', 'to', 'galactic', 'mass', 'components', 'by', 'searching', 'for', 'the', 'displacements', 'they', 'predict', 'between', 'galaxies', 'stars', 'and', 'gas', 'taking', 'data', 'from', 'the', 'alfalfa', 'hi', 'survey', 'identifying', 'galaxies', 'gravitational', 'environments', 'with', 'the', 'maps', 'of', 'desmond', 'et', 'al', '2018a', 'and', 'forwardmodelling', 'with', 'a', 'bayesian', 'likelihood', 'framework', 'we', 'set', 'upper', 'bounds', 'on', 'fifthforce', 'strength', 'relative', 'to', 'newtonian', 'gravity', 'from', 'delta', 'gg_n', 'textfew', 'times', '104', 'for', 'range', 'lambda_c', '50', 'mpc', 'to', 'delta', 'gg_n', 'lesssim', '01', 'for', 'lambda_c', '500', 'kpc', 'in', 'fr', 'gravity', 'this', 'requires', 'f_r0', 'textfew', 'times', '108', 'the', 'analogous', 'bounds', 'without', 'screening', 'are', 'delta', 'gg_n', 'textfew', 'times', '104', 'and', 'delta', 'gg_n', 'textfew', 'times', '103', 'these', 'are', 'the', 'tightest', 'and', 'among', 'the', 'only', 'fifthforce', 'constraints', 'on', 'galaxy', 'scales', 'we', 'show', 'how', 'our', 'results', 'may', 'be', 'strengthened', 'with', 'future', 'survey', 'data', 'and', 'identify', 'the', 'key', 'features', 'of', 'an', 'observational', 'programme', 'for', 'furthering', 'fifthforce', 'tests', 'beyond', 'the', 'solar', 'system']] | [-0.11560777025599736, 0.13153121513196134, -0.014521610829237318, 0.10991299789348691, -0.09608111818841494, -0.09658294093256414, 0.025303343405111638, 0.2909095512529579, -0.1746276125229676, -0.4033602569183773, 0.040403735180221056, -0.3031484605790134, -0.03229013316141551, 0.22846218074190283, 0.0392681334370875, -0.002758082394447068, -0.02032728488191816, -0.0551861664582747, -0.04238323320226068, -0.2666424702682907, 0.263104619252879, 0.08813260245027349, 0.14809668496480513, 0.03887702561997667, 0.06319503073338602, -0.07066618960394122, -0.04360534370575538, -0.029676528115683765, -0.2083029381418087, 0.018499683838693753, 0.19987475721464923, 0.12310923548762266, 0.20823291290149676, -0.4023436714675935, -0.1796963805168429, 0.10814520874855053, 0.14173630747816288, 0.0753921104741155, -0.014374921669585485, -0.3509671200915952, 0.0573452447787014, -0.16433585977282228, -0.10858611417272329, -0.013984581982881269, 0.07115112968969305, 0.04408815414325206, -0.2975617801934919, 0.16207130517589166, -0.02238151081876947, 0.02907811093930778, -0.05832770127488081, -0.14194537582578978, 0.0169259448314323, 0.03178062666105974, 0.06643454495197683, 0.10117553670601874, 0.20671319254324771, -0.14206931047031984, -0.030524503362054627, 0.45342305477927713, -0.1056285864983425, -0.09280084951337901, 0.20182693730720191, -0.17205785063218654, -0.1672518018555517, 0.05999368286860522, 0.18734444752058776, 0.07356574002872496, -0.1629892425935752, 0.12424632624093004, 0.03158999275982234, 0.2029229699275639, 0.06445724298200552, 0.047679579500682474, 0.2723098082511284, 0.13871897750661946, 0.08566066425823117, -0.006197137442558967, -0.13869702144402968, -0.05313416720538026, -0.29311165012939666, -0.043288508231532484, -0.10636495037789584, 0.06438541806339487, -0.19031752587019868, -0.07043160284828286, 0.29307227866842833, 0.1725677203680343, 0.19129054154059394, 0.11697860346883353, 0.2663993143245998, 0.038394463301123255, 0.10032666225543282, 0.08025751670014442, 0.33144481798780023, 0.1530508224335362, 0.06025177161620163, -0.19508624992187262, -0.0037134141300567518, 0.03173311482475815] |
1,802.07207 | AutoPrognosis: Automated Clinical Prognostic Modeling via Bayesian
Optimization with Structured Kernel Learning | Clinical prognostic models derived from largescale healthcare data can inform
critical diagnostic and therapeutic decisions. To enable off-theshelf usage of
machine learning (ML) in prognostic research, we developed AUTOPROGNOSIS: a
system for automating the design of predictive modeling pipelines tailored for
clinical prognosis. AUTOPROGNOSIS optimizes ensembles of pipeline
configurations efficiently using a novel batched Bayesian optimization (BO)
algorithm that learns a low-dimensional decomposition of the pipelines
high-dimensional hyperparameter space in concurrence with the BO procedure.
This is achieved by modeling the pipelines performances as a black-box function
with a Gaussian process prior, and modeling the similarities between the
pipelines baseline algorithms via a sparse additive kernel with a Dirichlet
prior. Meta-learning is used to warmstart BO with external data from similar
patient cohorts by calibrating the priors using an algorithm that mimics the
empirical Bayes method. The system automatically explains its predictions by
presenting the clinicians with logical association rules that link patients
features to predicted risk strata. We demonstrate the utility of AUTOPROGNOSIS
using 10 major patient cohorts representing various aspects of cardiovascular
patient care.
| cs.LG stat.ML | clinical prognostic models derived from largescale healthcare data can inform critical diagnostic and therapeutic decisions to enable offtheshelf usage of machine learning ml in prognostic research we developed autoprognosis a system for automating the design of predictive modeling pipelines tailored for clinical prognosis autoprognosis optimizes ensembles of pipeline configurations efficiently using a novel batched bayesian optimization bo algorithm that learns a lowdimensional decomposition of the pipelines highdimensional hyperparameter space in concurrence with the bo procedure this is achieved by modeling the pipelines performances as a blackbox function with a gaussian process prior and modeling the similarities between the pipelines baseline algorithms via a sparse additive kernel with a dirichlet prior metalearning is used to warmstart bo with external data from similar patient cohorts by calibrating the priors using an algorithm that mimics the empirical bayes method the system automatically explains its predictions by presenting the clinicians with logical association rules that link patients features to predicted risk strata we demonstrate the utility of autoprognosis using 10 major patient cohorts representing various aspects of cardiovascular patient care | [['clinical', 'prognostic', 'models', 'derived', 'from', 'largescale', 'healthcare', 'data', 'can', 'inform', 'critical', 'diagnostic', 'and', 'therapeutic', 'decisions', 'to', 'enable', 'offtheshelf', 'usage', 'of', 'machine', 'learning', 'ml', 'in', 'prognostic', 'research', 'we', 'developed', 'autoprognosis', 'a', 'system', 'for', 'automating', 'the', 'design', 'of', 'predictive', 'modeling', 'pipelines', 'tailored', 'for', 'clinical', 'prognosis', 'autoprognosis', 'optimizes', 'ensembles', 'of', 'pipeline', 'configurations', 'efficiently', 'using', 'a', 'novel', 'batched', 'bayesian', 'optimization', 'bo', 'algorithm', 'that', 'learns', 'a', 'lowdimensional', 'decomposition', 'of', 'the', 'pipelines', 'highdimensional', 'hyperparameter', 'space', 'in', 'concurrence', 'with', 'the', 'bo', 'procedure', 'this', 'is', 'achieved', 'by', 'modeling', 'the', 'pipelines', 'performances', 'as', 'a', 'blackbox', 'function', 'with', 'a', 'gaussian', 'process', 'prior', 'and', 'modeling', 'the', 'similarities', 'between', 'the', 'pipelines', 'baseline', 'algorithms', 'via', 'a', 'sparse', 'additive', 'kernel', 'with', 'a', 'dirichlet', 'prior', 'metalearning', 'is', 'used', 'to', 'warmstart', 'bo', 'with', 'external', 'data', 'from', 'similar', 'patient', 'cohorts', 'by', 'calibrating', 'the', 'priors', 'using', 'an', 'algorithm', 'that', 'mimics', 'the', 'empirical', 'bayes', 'method', 'the', 'system', 'automatically', 'explains', 'its', 'predictions', 'by', 'presenting', 'the', 'clinicians', 'with', 'logical', 'association', 'rules', 'that', 'link', 'patients', 'features', 'to', 'predicted', 'risk', 'strata', 'we', 'demonstrate', 'the', 'utility', 'of', 'autoprognosis', 'using', '10', 'major', 'patient', 'cohorts', 'representing', 'various', 'aspects', 'of', 'cardiovascular', 'patient', 'care']] | [-0.005817141137826679, -0.022513096040959434, -0.11291217049768999, 0.08629633848056528, -0.11093781015105461, -0.20622822965114293, 0.10901102910892488, 0.4358325287572701, -0.2517370515693487, -0.31600821124580264, 0.08155374884757872, -0.2249546861947403, -0.18571578611259942, 0.2334194738015702, -0.12261898986550725, 0.1521991966576686, 0.14496074978457976, -0.00957284208164889, -0.05460405308060052, -0.2737041573484682, 0.26902040137528355, 0.07372763568260284, 0.3476828032832021, -0.07041537879294166, 0.10291863719811029, 0.02602523262447159, -0.051235803057021585, -0.02757101404677087, -0.07814115948642873, 0.18646236394256863, 0.3825856672320821, 0.2820265374506231, 0.3951035790272396, -0.3828544873866287, -0.24660397753839128, 0.09609461190517653, 0.11752413043657063, 0.05800596336567568, 0.005027602236209946, -0.3106476415573111, 0.029091032466650093, -0.18534925145054745, -0.042756936463940125, -0.16860291988334872, -0.07427815134922805, -0.0030486823670798913, -0.35141736550510605, 0.07304593157790475, -0.0047150991965529765, 0.11689179703005886, -0.09748450017187596, -0.1680153780709423, 0.014004759307268118, 0.1538664693706034, 0.056275808085543264, 0.06268829177332175, 0.19884447677098002, -0.16032297434470488, -0.17378784987423304, 0.3243613657753237, -0.016193013539040377, -0.20089240036428568, 0.16074570383088113, 0.0065317901264114134, -0.14920278132459233, 0.09523307527045043, 0.22998944449301978, 0.06928409378319471, -0.22244473875087517, 0.009016660504461139, 0.06314312014728785, 0.16588780032179784, 0.012048038504541513, -0.11499057701042727, 0.18238214698794764, 0.25670176051260735, -0.006228281110617734, 0.12912174413742666, -0.13002428627276624, -0.06613726840970974, -0.20001405382274903, -0.11999883208706953, -0.13539630658289586, -0.01918818729675629, -0.16889967001026723, -0.1839655342522416, 0.38385098514845595, 0.19143960349505174, 0.14907741649304543, 0.08386110570757989, 0.34942104515159206, 0.03873962434789229, 0.0830184737850769, 0.059917650278128516, 0.13244656625399578, 0.04080796043325046, 0.0900611640271646, -0.2104797376748386, 0.14809286157304252, 0.014923154140640028] |
1,802.07208 | Experimental single-photon pulse characterization by electro-optic
shearing interferometry | The ability to characterize the complete quantum state of light is essential
for both fundamental and applied science. For single photons the quantum state
is provided by the mode that it occupies. The spectral temporal mode structure
of light has recently emerged as an essential means for quantum information
science. Here we experimentally demonstrate a self-referencing technique to
completely determine the pulse-mode structure of single photons by means of
spectral shearing interferometry. We detail the calibration and resolution of
the measurement and discuss challenges and critical requirements for future
advances of this method.
| physics.optics quant-ph | the ability to characterize the complete quantum state of light is essential for both fundamental and applied science for single photons the quantum state is provided by the mode that it occupies the spectral temporal mode structure of light has recently emerged as an essential means for quantum information science here we experimentally demonstrate a selfreferencing technique to completely determine the pulsemode structure of single photons by means of spectral shearing interferometry we detail the calibration and resolution of the measurement and discuss challenges and critical requirements for future advances of this method | [['the', 'ability', 'to', 'characterize', 'the', 'complete', 'quantum', 'state', 'of', 'light', 'is', 'essential', 'for', 'both', 'fundamental', 'and', 'applied', 'science', 'for', 'single', 'photons', 'the', 'quantum', 'state', 'is', 'provided', 'by', 'the', 'mode', 'that', 'it', 'occupies', 'the', 'spectral', 'temporal', 'mode', 'structure', 'of', 'light', 'has', 'recently', 'emerged', 'as', 'an', 'essential', 'means', 'for', 'quantum', 'information', 'science', 'here', 'we', 'experimentally', 'demonstrate', 'a', 'selfreferencing', 'technique', 'to', 'completely', 'determine', 'the', 'pulsemode', 'structure', 'of', 'single', 'photons', 'by', 'means', 'of', 'spectral', 'shearing', 'interferometry', 'we', 'detail', 'the', 'calibration', 'and', 'resolution', 'of', 'the', 'measurement', 'and', 'discuss', 'challenges', 'and', 'critical', 'requirements', 'for', 'future', 'advances', 'of', 'this', 'method']] | [-0.0668450584265864, 0.13115860613564315, -0.09315850794996305, 0.03298128958696359, -0.055356808928071814, -0.11851172543240972, 0.03631230213138605, 0.3900778128575253, -0.2754567993544443, -0.31491736677645515, 0.10478010700554938, -0.24128144964455597, -0.1356170783620528, 0.2383921845786033, -0.03165213622012606, 0.12642756383052417, 0.06012344460493775, 0.008569230972728204, -0.008251531397603372, -0.17250194592321272, 0.3028876125131563, 0.10435085625623063, 0.3342906814218769, 0.07730471375848978, 0.13712352204326822, 0.05049769702037015, -0.03800978646763871, -0.013424589253601528, -0.1295468921508541, 0.141164182114505, 0.24158312701770374, 0.15305710135288136, 0.2701405268512987, -0.4026380912350711, -0.25426444732984627, 0.06359093365389654, 0.15689975127417555, 0.12479417252614694, -0.07439076305887792, -0.26849662085934994, 0.0521100317947917, -0.12001305313840989, -0.15365580655634403, -0.13632089448391752, 0.011665263469831677, -0.028852133225569482, -0.22072601661346453, 0.019973433626595365, 0.03742271425297624, 0.04254350788210348, -0.005638198175978276, -0.031124281737032116, 0.01781486811414261, 0.1730968741830238, -0.0626575291527295, 0.00034697935040239045, 0.0859413774163332, -0.15605880211918585, -0.15046938496731943, 0.38529247287861124, -0.03892518181170891, -0.1345423947649217, 0.13773964881216005, -0.13486500506249247, -0.11182173762109972, 0.09608975213061097, 0.11577427344176397, 0.1023710177290023, -0.12399954905718445, 0.0667681584500217, 0.03573859100460365, 0.2095680179134492, 0.031148811827303582, 0.1295202555565504, 0.24963153278835679, 0.20396153535693884, 0.04394560277722375, 0.15442465711385012, -0.15266982196599885, -0.07375101488764568, -0.266769574239089, -0.1970013428168992, -0.20079964816117138, 0.04056696040475721, -0.022877268329818522, -0.1067991849956333, 0.43584278298001133, 0.13984476266208515, 0.14410468910680582, -0.060618274414571384, 0.3442311037171592, 0.1099309565296637, 0.04362329473138176, 0.026235427817590133, 0.2915069253173887, 0.17461890284152282, 0.12118697649128335, -0.24648710867760562, 0.02270832536141238, -0.0019348688844230868] |
1,802.07209 | Distributed Symmetry-Breaking Algorithms for Congested Cliques | The {Congested Clique} is a distributed-computing model for single-hop
networks with restricted bandwidth that has been very intensively studied
recently. It models a network by an $n$-vertex graph in which any pair of
vertices can communicate one with another by transmitting $O(\log n )$ bits in
each round. Various problems have been studied in this setting, but for some of
them the best-known results are those for general networks. In this paper we
devise significantly improved algorithms for various symmetry-breaking
problems, such as forests-decompositions, vertex-colorings, and maximal
independent set.
We analyze the running time of our algorithms as a function of the arboricity
$a$ of a clique subgraph that is given as input. Our algorithms are especially
efficient in Trees, planar graphs, graphs with constant genus, and many other
graphs that have bounded arboricity, but unbounded size. We obtain
$O(a)$-forest-decomposition algorithm with $O(\log a)$ time that improves the
previously-known $O(\log n)$ time, $O(a^{2 + \epsilon})$-coloring in $O(\log^*
n)$ time that improves upon an $O(\log n)$-time algorithm, $O(a)$-coloring in
$O(a^{\epsilon})$-time that improves upon several previous algorithms, and a
maximal independent set algorithm with $O(\sqrt a)$ time that improves at least
quadratically upon the state-of-the-art for small and moderate values of $a$.
Those results are achieved using several techniques. First, we produce a
forest decomposition with a helpful structure called {$H$-partition} within
$O(\log a)$ rounds. In general graphs this structure requires $\Theta(\log n)$
time, but in Congested Cliques we are able to compute it faster. We employ this
structure in conjunction with partitioning techniques that allow us to solve
various symmetry-breaking problems efficiently.
| cs.DC cs.DS | the congested clique is a distributedcomputing model for singlehop networks with restricted bandwidth that has been very intensively studied recently it models a network by an nvertex graph in which any pair of vertices can communicate one with another by transmitting olog n bits in each round various problems have been studied in this setting but for some of them the bestknown results are those for general networks in this paper we devise significantly improved algorithms for various symmetrybreaking problems such as forestsdecompositions vertexcolorings and maximal independent set we analyze the running time of our algorithms as a function of the arboricity a of a clique subgraph that is given as input our algorithms are especially efficient in trees planar graphs graphs with constant genus and many other graphs that have bounded arboricity but unbounded size we obtain oaforestdecomposition algorithm with olog a time that improves the previouslyknown olog n time oa2 epsiloncoloring in olog n time that improves upon an olog ntime algorithm oacoloring in oaepsilontime that improves upon several previous algorithms and a maximal independent set algorithm with osqrt a time that improves at least quadratically upon the stateoftheart for small and moderate values of a those results are achieved using several techniques first we produce a forest decomposition with a helpful structure called hpartition within olog a rounds in general graphs this structure requires thetalog n time but in congested cliques we are able to compute it faster we employ this structure in conjunction with partitioning techniques that allow us to solve various symmetrybreaking problems efficiently | [['the', 'congested', 'clique', 'is', 'a', 'distributedcomputing', 'model', 'for', 'singlehop', 'networks', 'with', 'restricted', 'bandwidth', 'that', 'has', 'been', 'very', 'intensively', 'studied', 'recently', 'it', 'models', 'a', 'network', 'by', 'an', 'nvertex', 'graph', 'in', 'which', 'any', 'pair', 'of', 'vertices', 'can', 'communicate', 'one', 'with', 'another', 'by', 'transmitting', 'olog', 'n', 'bits', 'in', 'each', 'round', 'various', 'problems', 'have', 'been', 'studied', 'in', 'this', 'setting', 'but', 'for', 'some', 'of', 'them', 'the', 'bestknown', 'results', 'are', 'those', 'for', 'general', 'networks', 'in', 'this', 'paper', 'we', 'devise', 'significantly', 'improved', 'algorithms', 'for', 'various', 'symmetrybreaking', 'problems', 'such', 'as', 'forestsdecompositions', 'vertexcolorings', 'and', 'maximal', 'independent', 'set', 'we', 'analyze', 'the', 'running', 'time', 'of', 'our', 'algorithms', 'as', 'a', 'function', 'of', 'the', 'arboricity', 'a', 'of', 'a', 'clique', 'subgraph', 'that', 'is', 'given', 'as', 'input', 'our', 'algorithms', 'are', 'especially', 'efficient', 'in', 'trees', 'planar', 'graphs', 'graphs', 'with', 'constant', 'genus', 'and', 'many', 'other', 'graphs', 'that', 'have', 'bounded', 'arboricity', 'but', 'unbounded', 'size', 'we', 'obtain', 'oaforestdecomposition', 'algorithm', 'with', 'olog', 'a', 'time', 'that', 'improves', 'the', 'previouslyknown', 'olog', 'n', 'time', 'oa2', 'epsiloncoloring', 'in', 'olog', 'n', 'time', 'that', 'improves', 'upon', 'an', 'olog', 'ntime', 'algorithm', 'oacoloring', 'in', 'oaepsilontime', 'that', 'improves', 'upon', 'several', 'previous', 'algorithms', 'and', 'a', 'maximal', 'independent', 'set', 'algorithm', 'with', 'osqrt', 'a', 'time', 'that', 'improves', 'at', 'least', 'quadratically', 'upon', 'the', 'stateoftheart', 'for', 'small', 'and', 'moderate', 'values', 'of', 'a', 'those', 'results', 'are', 'achieved', 'using', 'several', 'techniques', 'first', 'we', 'produce', 'a', 'forest', 'decomposition', 'with', 'a', 'helpful', 'structure', 'called', 'hpartition', 'within', 'olog', 'a', 'rounds', 'in', 'general', 'graphs', 'this', 'structure', 'requires', 'thetalog', 'n', 'time', 'but', 'in', 'congested', 'cliques', 'we', 'are', 'able', 'to', 'compute', 'it', 'faster', 'we', 'employ', 'this', 'structure', 'in', 'conjunction', 'with', 'partitioning', 'techniques', 'that', 'allow', 'us', 'to', 'solve', 'various', 'symmetrybreaking', 'problems', 'efficiently']] | [-0.15223778507915203, 0.09920418896841662, -0.03521317512849751, 0.030527524284976112, -0.07134593434801156, -0.20428289244827547, 0.08429302374432932, 0.4202087136443793, -0.2471492540371041, -0.3618916255226837, 0.10779467426247806, -0.2681198200917703, -0.15580801855084364, 0.1786396076595374, -0.0807854435857562, 0.09750063780686227, 0.102978642511811, 0.06055508530514661, 0.0004504496791204916, -0.3374614926463908, 0.23906624003135407, 0.015267778176946838, 0.21268329491448615, 0.037912024886314226, 0.06970456241641061, 0.0025283475461684666, 0.004975968870617773, 0.07868683769362114, -0.12008293800947731, 0.08617149361891473, 0.28972365543874185, 0.17167844633674645, 0.27599529068265477, -0.44317751268859906, -0.20949109463507068, 0.18081471123898277, 0.18900559292627653, 0.1334037397709296, -0.006237830386014854, -0.20706893312707986, 0.1171197728962516, -0.12136708446980818, -0.06025038894439363, -0.04992543844084656, 0.03195277420553588, 0.006122565639606519, -0.2923846178052656, -0.014677562599950157, 0.06334961702211543, -0.031503530013054726, 0.0363146469347628, -0.15729958128474889, 0.06336354826192331, 0.11170094983151602, -0.03620595239947657, 0.10632999732229019, 0.046959913889748656, -0.10388583772062976, -0.2095248717593817, 0.3460910990576558, -0.06593101569856315, -0.1711298673516765, 0.1486304605236137, -0.08333959402847785, -0.22407445516216426, 0.1393491515692824, 0.18295197254470127, 0.18073557767825635, -0.09529258282335196, 0.1306534281337317, -0.10528347464167907, 0.18021820201961833, 0.112858128223178, 0.03747489056945687, 0.02574718634716673, 0.1866951367777327, 0.15191633636366553, 0.1511853743409425, 0.016964845818429705, -0.06462932556955946, -0.21348147848510576, -0.08793324803778894, -0.2087110111199084, -0.010215173916718204, -0.20790544788885987, -0.15622505180265298, 0.3889571658147889, 0.1456635704387362, 0.24771843029907628, 0.16288430763918377, 0.31728662364184856, 0.06302741909707463, 0.07565383442512827, 0.20638464503321546, 0.16342734019955338, 0.08164515411628506, 0.06300598645735561, -0.16040427111210706, 0.11241499933767549, 0.09813280568361281] |
1,802.0721 | Real-Time Dense Stereo Matching With ELAS on FPGA Accelerated Embedded
Devices | For many applications in low-power real-time robotics, stereo cameras are the
sensors of choice for depth perception as they are typically cheaper and more
versatile than their active counterparts. Their biggest drawback, however, is
that they do not directly sense depth maps; instead, these must be estimated
through data-intensive processes. Therefore, appropriate algorithm selection
plays an important role in achieving the desired performance characteristics.
Motivated by applications in space and mobile robotics, we implement and
evaluate a FPGA-accelerated adaptation of the ELAS algorithm. Despite offering
one of the best trade-offs between efficiency and accuracy, ELAS has only been
shown to run at 1.5-3 fps on a high-end CPU. Our system preserves all
intriguing properties of the original algorithm, such as the slanted plane
priors, but can achieve a frame rate of 47fps whilst consuming under 4W of
power. Unlike previous FPGA based designs, we take advantage of both components
on the CPU/FPGA System-on-Chip to showcase the strategy necessary to accelerate
more complex and computationally diverse algorithms for such low power,
real-time systems.
| cs.CV cs.RO | for many applications in lowpower realtime robotics stereo cameras are the sensors of choice for depth perception as they are typically cheaper and more versatile than their active counterparts their biggest drawback however is that they do not directly sense depth maps instead these must be estimated through dataintensive processes therefore appropriate algorithm selection plays an important role in achieving the desired performance characteristics motivated by applications in space and mobile robotics we implement and evaluate a fpgaaccelerated adaptation of the elas algorithm despite offering one of the best tradeoffs between efficiency and accuracy elas has only been shown to run at 153 fps on a highend cpu our system preserves all intriguing properties of the original algorithm such as the slanted plane priors but can achieve a frame rate of 47fps whilst consuming under 4w of power unlike previous fpga based designs we take advantage of both components on the cpufpga systemonchip to showcase the strategy necessary to accelerate more complex and computationally diverse algorithms for such low power realtime systems | [['for', 'many', 'applications', 'in', 'lowpower', 'realtime', 'robotics', 'stereo', 'cameras', 'are', 'the', 'sensors', 'of', 'choice', 'for', 'depth', 'perception', 'as', 'they', 'are', 'typically', 'cheaper', 'and', 'more', 'versatile', 'than', 'their', 'active', 'counterparts', 'their', 'biggest', 'drawback', 'however', 'is', 'that', 'they', 'do', 'not', 'directly', 'sense', 'depth', 'maps', 'instead', 'these', 'must', 'be', 'estimated', 'through', 'dataintensive', 'processes', 'therefore', 'appropriate', 'algorithm', 'selection', 'plays', 'an', 'important', 'role', 'in', 'achieving', 'the', 'desired', 'performance', 'characteristics', 'motivated', 'by', 'applications', 'in', 'space', 'and', 'mobile', 'robotics', 'we', 'implement', 'and', 'evaluate', 'a', 'fpgaaccelerated', 'adaptation', 'of', 'the', 'elas', 'algorithm', 'despite', 'offering', 'one', 'of', 'the', 'best', 'tradeoffs', 'between', 'efficiency', 'and', 'accuracy', 'elas', 'has', 'only', 'been', 'shown', 'to', 'run', 'at', '153', 'fps', 'on', 'a', 'highend', 'cpu', 'our', 'system', 'preserves', 'all', 'intriguing', 'properties', 'of', 'the', 'original', 'algorithm', 'such', 'as', 'the', 'slanted', 'plane', 'priors', 'but', 'can', 'achieve', 'a', 'frame', 'rate', 'of', '47fps', 'whilst', 'consuming', 'under', '4w', 'of', 'power', 'unlike', 'previous', 'fpga', 'based', 'designs', 'we', 'take', 'advantage', 'of', 'both', 'components', 'on', 'the', 'cpufpga', 'systemonchip', 'to', 'showcase', 'the', 'strategy', 'necessary', 'to', 'accelerate', 'more', 'complex', 'and', 'computationally', 'diverse', 'algorithms', 'for', 'such', 'low', 'power', 'realtime', 'systems']] | [-0.1046321659383145, 0.023876309905095053, -0.04551812517833348, 0.04731542548945393, -0.10617141536409583, -0.1738276909215047, 0.025626046302290085, 0.48318186062114205, -0.2243795085876413, -0.3726257852223866, 0.12780618065598365, -0.21898808554773602, -0.16819816210909802, 0.295452192952336, -0.1257655593457029, 0.10452398103661835, 0.07373504212249399, 0.004490084917394116, -0.05756221364307053, -0.27287982458810267, 0.19488154530306073, 0.09948770065846689, 0.3270717787391999, 0.012841667031855596, 0.13063584737863174, -3.308120007311706e-05, -0.020145040043794058, -0.011444332012530032, -0.03267288875123246, 0.14010813144610865, 0.28288325300056705, 0.17153404425035285, 0.32681720978854334, -0.45145970057620777, -0.20167836760348803, 0.10826474619568804, 0.17698130857555525, 0.04173142008675153, -0.046645733223276156, -0.24605079279829037, 0.11718990277731792, -0.14536287281679344, -0.06005149557364776, -0.12355473077811492, 0.0267606213414932, 0.03250607941984473, -0.25482270808013924, 0.001415460545788793, 0.03239853470860159, 0.04836239650955095, -0.02236425549558857, -0.11664038272232145, 0.018966077362625476, 0.17232961202971636, -0.005294906332924524, 0.01651328534764402, 0.17986292053555028, -0.1777946612369252, -0.12278104999225915, 0.419805961321382, 0.015345537189568858, -0.19175301962626262, 0.24282367289312842, -0.04809211821552976, -0.1388500953257522, 0.12199860635925741, 0.20196093629004763, 0.10866883897003443, -0.13676053860964363, 0.06231575701779494, 0.04583862867952763, 0.18263379499617527, 0.0608247477807762, 0.09136558918227607, 0.1925455217838616, 0.19817595108898411, 0.10584133602742976, 0.09712765827049118, -0.06414552426431328, -0.09635340102729113, -0.1894770834923667, -0.15165294925648007, -0.17551820489290335, -0.025097646034812307, -0.0951261544975911, -0.12089193647586988, 0.3468316574087914, 0.2151815252707285, 0.1714671372415443, 0.05545253624235663, 0.3805578696048435, 0.06420455568346797, 0.11300290187320891, 0.1105306522352347, 0.22644433022531515, 0.013986304018865614, 0.1400841730455046, -0.15976334074238205, 0.08842676820178681, 0.007743368090150932] |
1,802.07211 | An algorithm for determining the rotation count of pulsars | We present here a simple, systematic method for determining the correct
global rotation count of a radio pulsar; an essential step for the derivation
of an accurate phase-coherent ephemeris. We then build on this method by
developing a new algorithm for determining the global rotational count for
pulsars with sparse timing data sets. This makes it possible to obtain
phase-coherent ephemerides for pulsars for which this has been impossible until
now. As an example, we do this for PSR J0024-7205aa, an extremely faint MSP
recently discovered in the globular cluster 47 Tucanae. This algorithm has the
potential to significantly reduce the number of observations and the amount of
telescope time needed to follow up on new pulsar discoveries.
| astro-ph.IM astro-ph.HE | we present here a simple systematic method for determining the correct global rotation count of a radio pulsar an essential step for the derivation of an accurate phasecoherent ephemeris we then build on this method by developing a new algorithm for determining the global rotational count for pulsars with sparse timing data sets this makes it possible to obtain phasecoherent ephemerides for pulsars for which this has been impossible until now as an example we do this for psr j00247205aa an extremely faint msp recently discovered in the globular cluster 47 tucanae this algorithm has the potential to significantly reduce the number of observations and the amount of telescope time needed to follow up on new pulsar discoveries | [['we', 'present', 'here', 'a', 'simple', 'systematic', 'method', 'for', 'determining', 'the', 'correct', 'global', 'rotation', 'count', 'of', 'a', 'radio', 'pulsar', 'an', 'essential', 'step', 'for', 'the', 'derivation', 'of', 'an', 'accurate', 'phasecoherent', 'ephemeris', 'we', 'then', 'build', 'on', 'this', 'method', 'by', 'developing', 'a', 'new', 'algorithm', 'for', 'determining', 'the', 'global', 'rotational', 'count', 'for', 'pulsars', 'with', 'sparse', 'timing', 'data', 'sets', 'this', 'makes', 'it', 'possible', 'to', 'obtain', 'phasecoherent', 'ephemerides', 'for', 'pulsars', 'for', 'which', 'this', 'has', 'been', 'impossible', 'until', 'now', 'as', 'an', 'example', 'we', 'do', 'this', 'for', 'psr', 'j00247205aa', 'an', 'extremely', 'faint', 'msp', 'recently', 'discovered', 'in', 'the', 'globular', 'cluster', '47', 'tucanae', 'this', 'algorithm', 'has', 'the', 'potential', 'to', 'significantly', 'reduce', 'the', 'number', 'of', 'observations', 'and', 'the', 'amount', 'of', 'telescope', 'time', 'needed', 'to', 'follow', 'up', 'on', 'new', 'pulsar', 'discoveries']] | [-0.08219607735180065, 0.07534028731065635, -0.09415548552687351, 0.08274369504457961, -0.1642505751015284, -0.08780025135582456, 0.126212147789864, 0.38258697176909345, -0.2216564701615363, -0.36302452678115577, 0.0938340110821713, -0.23460801487040317, -0.11255099356341629, 0.29581794465203476, -0.08234282933637245, 0.05868653751288851, 0.09925335619252118, -0.004892235959613393, -0.0393563178810689, -0.2629568434305963, 0.21802621996269012, 0.11058736858395939, 0.17034573812021786, -0.03455908808252241, 0.14417466872399592, -0.01576181723234745, -0.05251309863474761, -0.04367259095828885, -0.13164926856819892, 0.10995093480739583, 0.242630291557035, 0.1647701007254326, 0.21105831804183814, -0.40211756232903045, -0.17662896847642925, 0.12147544184102653, 0.19101083823519513, 0.1352718336911649, -0.07976130736219642, -0.27645988028464663, 0.10295855831036456, -0.22769286405518013, -0.21107013923967752, -0.08629310841902964, 0.10920032034190293, 0.011295741372224357, -0.20543549394903657, 0.04037016454256243, 0.03027400713509474, 0.050252531986966185, -0.09592988085734029, -0.09249549694200102, 0.09985811634558356, 0.12377665559044825, 0.029547036544849668, 0.06574345632002522, 0.010598316667283066, -0.08698060667006952, -0.1074379823751684, 0.3587601661809489, -0.016540505557169773, -0.08157173395913063, 0.15820697892425406, -0.128876106452364, -0.27244281256969416, 0.13186686043428558, 0.1755850665931964, 0.10288764829707579, -0.22758833709089324, 0.015966047018937543, -0.04981834723606196, 0.21844315150370583, 0.038554696509471305, 0.02076807525804919, 0.261916079888773, 0.18970150836548394, 0.13374127913863423, 0.1041370989778676, -0.2308946745320916, 0.00710168203814592, -0.2215139000620852, -0.1307613873926666, -0.1724153931181018, 0.07950126408384396, -0.0811295649612623, -0.17151477596221062, 0.403262441436577, 0.15438787843713647, 0.13547354998986405, 0.07485445943147613, 0.323310488787217, 0.14960365479664767, 0.05840046805703742, 0.09988996560056494, 0.2801898653563271, 0.13084897036170667, 0.10152558069755761, -0.22724888143010247, 0.10192768385586067, 0.01266571091245223] |
1,802.07212 | Acoustic microstreaming near a plane wall due to a pulsating free/coated
bubble: Nyborg result revisited and vortices | Acoustic microstreaming due to an oscillating microbubble is analytically
investigated to obtain the circular streaming motion adjacent to a nearby wall.
Classical theory due to Nyborg is carefully derived in the radial coordinates.
The theory is used to obtain the flow field and the vortical motion caused by
the microbubble motion. The length of the vertices are decreasing when the
microbubble is excited at distances close to the rigid wall, while the maximum
shear stress is increasing.
| physics.flu-dyn | acoustic microstreaming due to an oscillating microbubble is analytically investigated to obtain the circular streaming motion adjacent to a nearby wall classical theory due to nyborg is carefully derived in the radial coordinates the theory is used to obtain the flow field and the vortical motion caused by the microbubble motion the length of the vertices are decreasing when the microbubble is excited at distances close to the rigid wall while the maximum shear stress is increasing | [['acoustic', 'microstreaming', 'due', 'to', 'an', 'oscillating', 'microbubble', 'is', 'analytically', 'investigated', 'to', 'obtain', 'the', 'circular', 'streaming', 'motion', 'adjacent', 'to', 'a', 'nearby', 'wall', 'classical', 'theory', 'due', 'to', 'nyborg', 'is', 'carefully', 'derived', 'in', 'the', 'radial', 'coordinates', 'the', 'theory', 'is', 'used', 'to', 'obtain', 'the', 'flow', 'field', 'and', 'the', 'vortical', 'motion', 'caused', 'by', 'the', 'microbubble', 'motion', 'the', 'length', 'of', 'the', 'vertices', 'are', 'decreasing', 'when', 'the', 'microbubble', 'is', 'excited', 'at', 'distances', 'close', 'to', 'the', 'rigid', 'wall', 'while', 'the', 'maximum', 'shear', 'stress', 'is', 'increasing']] | [-0.14101497081483338, 0.19624874150163538, -0.06000604953725713, 0.002996498835273087, -0.08782466543330388, -0.05809859144682815, -0.026769532286864402, 0.367953648282723, -0.3488139688557425, -0.2652173687328959, 0.06934594084786905, -0.2798534949391766, -0.07224592114133495, 0.1424938819141357, -0.07321305322013312, 0.03722381340218829, 0.02407319295407551, 0.08228737698843727, 0.015946982821569453, -0.16002164202343142, 0.23266678760674867, 0.04924634415293475, 0.3164416326621136, 0.037711976821739955, 0.08222479134338437, -0.014746518672718712, -0.0018580423716407317, 0.08105552064817302, -0.1839218808084049, 0.10085199708300462, 0.17258682821018548, -0.02057292768973615, 0.23131451938398084, -0.4384694289319314, -0.1958638590022728, 0.05574332088740035, 0.16225437281574667, 0.15728896989051688, 0.017316120428746785, -0.28906525831137386, 0.11798800055131123, -0.09273863843243037, -0.19823307735700305, 0.004267863445467763, 0.10950497729709832, 0.02702233356396462, -0.2446847456906523, 0.13784609275095938, 0.010304491313827503, 0.04709394441844968, -0.07581725061641305, -0.03058431428167727, -0.06096987026537974, 0.13487566370621334, 0.11247231691104152, 0.10649185484371983, 0.1854193801810215, -0.14232206496397976, -0.02674620146197932, 0.40543954205009847, -0.0447533572298269, -0.2179695571933014, 0.19043741432357242, -0.1524729633570782, 0.031069129076483962, 0.17674819017191987, 0.1813196720821517, 0.11176101492669482, -0.14893869788165948, 0.034618590969755614, 0.025757599779247464, 0.12469764280302281, 0.15388922563258123, -0.039299358163246666, 0.2344237689485217, 0.11335340423158721, 0.06449514343221853, 0.17940784659381812, -0.14802228636410716, -0.07516782887751697, -0.23787702051559825, -0.0722287403337972, -0.1794445846976664, -0.002228620316978399, -0.08957763576812819, -0.17424838395498984, 0.3289185773532886, 0.0884058974439871, 0.19474873801106707, 0.009154216833896452, 0.3147789343417465, 0.1574748596902211, 0.08433532638342253, 0.09756476012989879, 0.32856670975104557, 0.19276319742777276, 0.07914666123022991, -0.30340650211414927, 0.014323905334118512, 0.08325156222351572] |
1,802.07213 | Heegaard splittings of graph manifolds | In this paper we give a method to construct Heegaard splittings of oriented
graph manifolds with orientable bases. A graph manifold is a closed
$3$-manifold admitting only Seifert-fibered pieces in its Jaco-Shalen
decomposition; for technical reasons, we restrict our attention to the fully
oriented case, i.e. both the pieces and the bases are oriented.
| math.GT | in this paper we give a method to construct heegaard splittings of oriented graph manifolds with orientable bases a graph manifold is a closed 3manifold admitting only seifertfibered pieces in its jacoshalen decomposition for technical reasons we restrict our attention to the fully oriented case ie both the pieces and the bases are oriented | [['in', 'this', 'paper', 'we', 'give', 'a', 'method', 'to', 'construct', 'heegaard', 'splittings', 'of', 'oriented', 'graph', 'manifolds', 'with', 'orientable', 'bases', 'a', 'graph', 'manifold', 'is', 'a', 'closed', '3manifold', 'admitting', 'only', 'seifertfibered', 'pieces', 'in', 'its', 'jacoshalen', 'decomposition', 'for', 'technical', 'reasons', 'we', 'restrict', 'our', 'attention', 'to', 'the', 'fully', 'oriented', 'case', 'ie', 'both', 'the', 'pieces', 'and', 'the', 'bases', 'are', 'oriented']] | [-0.21107427837362266, 0.06765282677732548, -0.1027695036247232, 0.07353433896348162, -0.16781495578305902, -0.1435740296992491, -0.012482976134567749, 0.4608493635676942, -0.25416707409159195, -0.2724996779535739, 0.0963035081381435, -0.2660662731120609, -0.14820332483406057, 0.12855990955997082, -0.176452915990321, -0.06840586882053856, 0.17262190736759947, 0.05961158411261046, -0.05432650550567317, -0.2519018548806549, 0.43511651934317824, -0.09568740794751442, 0.20669038276152932, 0.08564553620021369, 0.14624988301745, -0.043713125180593636, 0.026061704241723386, 0.06692055661125847, -0.1753803904361601, 0.21723941903350488, 0.3451852467403097, 0.07059071353583965, 0.13616370100457714, -0.3969374138440164, -0.12309553363483469, 0.17315549767172, 0.11493432911921223, 0.09070249511596729, -0.0397658012631648, -0.24090868810560764, 0.11835342682546603, -0.10105969215620239, -0.11063101386897406, -0.0902110069269701, 0.02218216271930427, -0.06702168240159187, -0.18245384538598922, -0.08445815188493931, 0.13043800579770556, 0.09581425634898105, -0.00791435610318451, -0.14175210067264313, -0.027009011663601926, 0.1762593464205428, -0.010010401687567245, 0.11993557637346522, 0.051004010463520044, -0.04211240492427265, -0.1563637804872585, 0.3714592680686487, -0.04620345871684686, -0.35763403984173286, 0.10027786356590267, -0.09567439224887288, -0.2258005915473233, 0.1174959844716315, 0.13185837323654373, 0.171739531642228, -0.06800944939747734, 0.15734279067760756, -0.061793853476081254, 0.11311424364564272, 0.05523347788718792, -0.05949122314604948, 0.15815017976850834, 0.1489686635059287, 0.1346979242011483, 0.17863153764661752, 0.01745579271348861, -0.03120447675925943, -0.2890370160446696, -0.22678496266873377, -0.13029108938040598, 0.12435086851473898, -0.08623836421433019, -0.24895878740639057, 0.42901404648316355, -0.0054337614444348046, 0.1747953866626013, 0.14750178335761688, 0.31557892312137586, -0.023508178305214726, 0.054999952740475255, 0.15738227672628918, 0.11924290621899208, 0.21693634786555227, -0.01753384904619658, -0.05602708905232402, -0.010213404656651447, 0.16311335918616574] |
1,802.07214 | Inverse Design of Discrete Mechanical Metamaterials | Mechanical and phononic metamaterials exhibiting negative elastic moduli,
gapped vibrational spectra, or topologically protected modes enable precise
control of structural and acoustic functionalities. While much progress has
been made in their experimental and theoretical characterization, the inverse
design of mechanical metamaterials with arbitrarily programmable spectral
properties and mode localization remains an unsolved problem. Here, we present
a flexible computational inverse-design framework that allows the efficient
tuning of one or more gaps at nearly arbitrary positions in the spectrum of
discrete phononic metamaterial structures. The underlying algorithm optimizes
the linear response of elastic networks directly, is applicable to ordered and
disordered structures, scales efficiently in 2D and 3D, and can be combined
with a wide range of numerical optimization schemes. We illustrate the broad
practical potential of this approach by designing mechanical bandgap switches
that open and close pre-programmed spectral gaps in response to an externally
applied stimulus such as shear or compression. We further show that the
designed structures can host topologically protected edge modes, and validate
the numerical predictions through explicit 3D finite element simulations of
continuum elastica with experimentally relevant material parameters. Generally,
this network-based inverse design paradigm offers a direct pathway towards
manufacturing phononic metamaterials, DNA origami structures and topolectric
circuits that can realize a wide range of static and dynamic target
functionalities.
| cond-mat.mtrl-sci cond-mat.soft | mechanical and phononic metamaterials exhibiting negative elastic moduli gapped vibrational spectra or topologically protected modes enable precise control of structural and acoustic functionalities while much progress has been made in their experimental and theoretical characterization the inverse design of mechanical metamaterials with arbitrarily programmable spectral properties and mode localization remains an unsolved problem here we present a flexible computational inversedesign framework that allows the efficient tuning of one or more gaps at nearly arbitrary positions in the spectrum of discrete phononic metamaterial structures the underlying algorithm optimizes the linear response of elastic networks directly is applicable to ordered and disordered structures scales efficiently in 2d and 3d and can be combined with a wide range of numerical optimization schemes we illustrate the broad practical potential of this approach by designing mechanical bandgap switches that open and close preprogrammed spectral gaps in response to an externally applied stimulus such as shear or compression we further show that the designed structures can host topologically protected edge modes and validate the numerical predictions through explicit 3d finite element simulations of continuum elastica with experimentally relevant material parameters generally this networkbased inverse design paradigm offers a direct pathway towards manufacturing phononic metamaterials dna origami structures and topolectric circuits that can realize a wide range of static and dynamic target functionalities | [['mechanical', 'and', 'phononic', 'metamaterials', 'exhibiting', 'negative', 'elastic', 'moduli', 'gapped', 'vibrational', 'spectra', 'or', 'topologically', 'protected', 'modes', 'enable', 'precise', 'control', 'of', 'structural', 'and', 'acoustic', 'functionalities', 'while', 'much', 'progress', 'has', 'been', 'made', 'in', 'their', 'experimental', 'and', 'theoretical', 'characterization', 'the', 'inverse', 'design', 'of', 'mechanical', 'metamaterials', 'with', 'arbitrarily', 'programmable', 'spectral', 'properties', 'and', 'mode', 'localization', 'remains', 'an', 'unsolved', 'problem', 'here', 'we', 'present', 'a', 'flexible', 'computational', 'inversedesign', 'framework', 'that', 'allows', 'the', 'efficient', 'tuning', 'of', 'one', 'or', 'more', 'gaps', 'at', 'nearly', 'arbitrary', 'positions', 'in', 'the', 'spectrum', 'of', 'discrete', 'phononic', 'metamaterial', 'structures', 'the', 'underlying', 'algorithm', 'optimizes', 'the', 'linear', 'response', 'of', 'elastic', 'networks', 'directly', 'is', 'applicable', 'to', 'ordered', 'and', 'disordered', 'structures', 'scales', 'efficiently', 'in', '2d', 'and', '3d', 'and', 'can', 'be', 'combined', 'with', 'a', 'wide', 'range', 'of', 'numerical', 'optimization', 'schemes', 'we', 'illustrate', 'the', 'broad', 'practical', 'potential', 'of', 'this', 'approach', 'by', 'designing', 'mechanical', 'bandgap', 'switches', 'that', 'open', 'and', 'close', 'preprogrammed', 'spectral', 'gaps', 'in', 'response', 'to', 'an', 'externally', 'applied', 'stimulus', 'such', 'as', 'shear', 'or', 'compression', 'we', 'further', 'show', 'that', 'the', 'designed', 'structures', 'can', 'host', 'topologically', 'protected', 'edge', 'modes', 'and', 'validate', 'the', 'numerical', 'predictions', 'through', 'explicit', '3d', 'finite', 'element', 'simulations', 'of', 'continuum', 'elastica', 'with', 'experimentally', 'relevant', 'material', 'parameters', 'generally', 'this', 'networkbased', 'inverse', 'design', 'paradigm', 'offers', 'a', 'direct', 'pathway', 'towards', 'manufacturing', 'phononic', 'metamaterials', 'dna', 'origami', 'structures', 'and', 'topolectric', 'circuits', 'that', 'can', 'realize', 'a', 'wide', 'range', 'of', 'static', 'and', 'dynamic', 'target', 'functionalities']] | [-0.15008222136354119, 0.15376759793861164, -0.056164974028374566, -0.010256636351195359, -0.13332007053892972, -0.18492253364908487, 0.045619204842897, 0.47451243691666184, -0.31030625167930886, -0.30244205847902356, 0.06303240840734783, -0.23399545035851568, -0.22207929585129021, 0.21394518698392392, -0.01173547899976087, 0.15049478733955426, 0.028960379148660183, -0.09083905393734228, -0.05207559237863089, -0.12489366781096473, 0.23812040537812335, 0.059022930268804695, 0.3360173839014457, 0.05398638998591449, 0.061819968505784174, -0.008982787509773707, 0.03228760272979216, 0.04081708388294765, -0.1443591665186876, 0.16160361856861083, 0.3152653897883706, 0.0238196209408776, 0.24741138619002562, -0.46359253607170525, -0.2640266048093868, 0.05119110258447743, 0.16573923226272644, 0.14637123242908612, -0.07551992937718074, -0.2593148305405711, 0.09980651044698302, -0.14809303852285496, -0.13171343145198947, -0.14531028757608214, 0.0033439046107665744, -0.004798328197225495, -0.21773246740380864, 0.02974159243559941, 0.029238357174015323, 0.06433102486622629, -0.09839682853158001, -0.07853267516204437, -0.021936109701041564, 0.10410492022056132, -0.045319247238208044, -0.04843778473455026, 0.1677479691419014, -0.11970500297963532, -0.15189720119598732, 0.40428240307455143, 0.010091887908272965, -0.190928202006576, 0.21091353914018202, -0.06455855125258135, -0.05322009451514067, 0.17841553496695015, 0.20005532575034818, 0.08582296145140453, -0.10895198946223096, 0.06598008910416041, 0.01903965535660296, 0.20252462909069605, 0.041049261553602855, 0.07540536094456911, 0.24408450614725954, 0.2084444359334749, 0.06544883024992508, 0.17212553936284208, -0.042713139743847384, -0.0279735685131231, -0.23893107622861862, -0.13020505555363934, -0.18636206209180378, 0.03263511298397599, -0.08795428644875226, -0.2272324720538373, 0.42281517904078547, 0.12207713098546794, 0.14963180993001388, 0.026249027906288934, 0.3010388320631369, 0.05331412669173767, 0.08602160752404395, 0.034453823958891766, 0.2520303843196395, 0.13002888163400078, 0.07886965233334449, -0.22983357432558266, 0.023801920582475357, -0.03161342079902804] |
1,802.07215 | Preparation contextuality as an essential feature underlying quantum
communication advantage | The study of ontology (hidden variables) provides for a vital ground on which
significant non-classical features of quantum theory are revealed. One such
non-classical ontic-feature is preparation contextuality (PC) and advantage in
oblivious communication tasks is one of its operational signatures. This
article primarily pursues the ontic-feature underlying quantum advantage in
communication complexity (CC). We construct oblivious communication tasks
tailored to given CC problems. We upper-bound the classical success probability
of these oblivious communication tasks, obtaining preparation non-contextual
inequalities. We use the very states and measurements responsible for advantage
in CC problems along with the orthogonal mixtures of these states to
orchestrate an advantageous protocol for the associated oblivious communication
tasks and the violation of the associated inequalities, thereby unveiling PC.
To showcase the vitality of our results, we find a criterion for unbounded
violation of these inequalities and demonstrate the same for two widely studied
CC problems.
| quant-ph | the study of ontology hidden variables provides for a vital ground on which significant nonclassical features of quantum theory are revealed one such nonclassical onticfeature is preparation contextuality pc and advantage in oblivious communication tasks is one of its operational signatures this article primarily pursues the onticfeature underlying quantum advantage in communication complexity cc we construct oblivious communication tasks tailored to given cc problems we upperbound the classical success probability of these oblivious communication tasks obtaining preparation noncontextual inequalities we use the very states and measurements responsible for advantage in cc problems along with the orthogonal mixtures of these states to orchestrate an advantageous protocol for the associated oblivious communication tasks and the violation of the associated inequalities thereby unveiling pc to showcase the vitality of our results we find a criterion for unbounded violation of these inequalities and demonstrate the same for two widely studied cc problems | [['the', 'study', 'of', 'ontology', 'hidden', 'variables', 'provides', 'for', 'a', 'vital', 'ground', 'on', 'which', 'significant', 'nonclassical', 'features', 'of', 'quantum', 'theory', 'are', 'revealed', 'one', 'such', 'nonclassical', 'onticfeature', 'is', 'preparation', 'contextuality', 'pc', 'and', 'advantage', 'in', 'oblivious', 'communication', 'tasks', 'is', 'one', 'of', 'its', 'operational', 'signatures', 'this', 'article', 'primarily', 'pursues', 'the', 'onticfeature', 'underlying', 'quantum', 'advantage', 'in', 'communication', 'complexity', 'cc', 'we', 'construct', 'oblivious', 'communication', 'tasks', 'tailored', 'to', 'given', 'cc', 'problems', 'we', 'upperbound', 'the', 'classical', 'success', 'probability', 'of', 'these', 'oblivious', 'communication', 'tasks', 'obtaining', 'preparation', 'noncontextual', 'inequalities', 'we', 'use', 'the', 'very', 'states', 'and', 'measurements', 'responsible', 'for', 'advantage', 'in', 'cc', 'problems', 'along', 'with', 'the', 'orthogonal', 'mixtures', 'of', 'these', 'states', 'to', 'orchestrate', 'an', 'advantageous', 'protocol', 'for', 'the', 'associated', 'oblivious', 'communication', 'tasks', 'and', 'the', 'violation', 'of', 'the', 'associated', 'inequalities', 'thereby', 'unveiling', 'pc', 'to', 'showcase', 'the', 'vitality', 'of', 'our', 'results', 'we', 'find', 'a', 'criterion', 'for', 'unbounded', 'violation', 'of', 'these', 'inequalities', 'and', 'demonstrate', 'the', 'same', 'for', 'two', 'widely', 'studied', 'cc', 'problems']] | [-0.16767370138374757, 0.06700897611482691, -0.06674850320807109, 0.09780528751115812, -0.045800710122470986, -0.2285742894523101, 0.09324600555246683, 0.3410809647023984, -0.282943012958316, -0.29950325193572536, 0.06209139727304804, -0.22294768011069868, -0.11551545112559648, 0.22398637611999445, -0.08004384315317523, 0.12876409037662223, 0.08026767454001645, 0.00974710169886175, -0.05255216371095803, -0.24455260870378617, 0.29047694190226697, 0.01822808744507038, 0.29629762242835217, 0.06208676778494495, 0.09645742739622333, 0.025329339560376456, -0.03881241838218109, -0.04190645676922716, -0.11338090773891939, 0.16803420149666984, 0.3476493794675151, 0.20346145349401623, 0.2946008946204379, -0.4133916694977104, -0.18272777604360185, 0.14343048946306824, 0.122647753371283, 0.12254364989707502, -0.032550302031928394, -0.33881321513055734, 0.05025713677097061, -0.1413538771655972, -0.09144368756256283, -0.07738111202432837, 0.00034990097868115933, -0.016148750939763673, -0.2527522684317337, 0.05883843135343839, 0.064739070657309, 0.06081197483780832, -0.010290386462233297, -0.07943471145021971, 0.06411619539123845, 0.13457601686320841, -0.022810125674044536, -0.01997097211567787, 0.12346616886517875, -0.13056963925052129, -0.2334529329792992, 0.38641247898340225, 0.02150234634579759, -0.1797949316535043, 0.19866293716588862, -0.05656807634450036, -0.20265847425716482, 0.058061785586114516, 0.16582776012324907, 0.07418425050596004, -0.12338807650408005, 0.05607751967889346, -0.02219443248380741, 0.16619560110369977, 0.034216156277218704, 0.1581405447158095, 0.13659847207520515, 0.12724516244783793, 0.06920841554768244, 0.1611444738594662, -0.05911057265969759, -0.16652488633224818, -0.2843492275154958, -0.21903208011046868, -0.1960741319272616, 0.041491734993018926, -0.10603482199454846, -0.09115717045273887, 0.34342764432172046, 0.1424338578159621, 0.13356910135329075, 0.06416473127598556, 0.30733161500482886, 0.04307693878845758, 0.07211598464963984, 0.10216301875683313, 0.22455695081400137, 0.1543078946989438, 0.08720786567483965, -0.22990817009560663, 0.13694964427730605, 0.0004441141890846703] |
1,802.07216 | Cosmic Visions Dark Energy: Small Projects Portfolio | Understanding cosmic acceleration is one of the key science drivers for
astrophysics and high-energy physics in the coming decade (2014 P5 Report).
With the Large Synoptic Survey Telescope (LSST) and the Dark Energy
Spectroscopic Instrument (DESI) and other new facilities beginning operations
soon, we are entering an exciting phase during which we expect an order of
magnitude improvement in constraints on dark energy and the physics of the
accelerating Universe. This is a key moment for a matching Small Projects
portfolio that can (1) greatly enhance the science reach of these flagship
projects, (2) have immediate scientific impact, and (3) lay the groundwork for
the next stages of the Cosmic Frontier Dark Energy program. In this White
Paper, we outline a balanced portfolio that can accomplish these goals through
a combination of observational, experimental, and theory and simulation
efforts.
| astro-ph.CO | understanding cosmic acceleration is one of the key science drivers for astrophysics and highenergy physics in the coming decade 2014 p5 report with the large synoptic survey telescope lsst and the dark energy spectroscopic instrument desi and other new facilities beginning operations soon we are entering an exciting phase during which we expect an order of magnitude improvement in constraints on dark energy and the physics of the accelerating universe this is a key moment for a matching small projects portfolio that can 1 greatly enhance the science reach of these flagship projects 2 have immediate scientific impact and 3 lay the groundwork for the next stages of the cosmic frontier dark energy program in this white paper we outline a balanced portfolio that can accomplish these goals through a combination of observational experimental and theory and simulation efforts | [['understanding', 'cosmic', 'acceleration', 'is', 'one', 'of', 'the', 'key', 'science', 'drivers', 'for', 'astrophysics', 'and', 'highenergy', 'physics', 'in', 'the', 'coming', 'decade', '2014', 'p5', 'report', 'with', 'the', 'large', 'synoptic', 'survey', 'telescope', 'lsst', 'and', 'the', 'dark', 'energy', 'spectroscopic', 'instrument', 'desi', 'and', 'other', 'new', 'facilities', 'beginning', 'operations', 'soon', 'we', 'are', 'entering', 'an', 'exciting', 'phase', 'during', 'which', 'we', 'expect', 'an', 'order', 'of', 'magnitude', 'improvement', 'in', 'constraints', 'on', 'dark', 'energy', 'and', 'the', 'physics', 'of', 'the', 'accelerating', 'universe', 'this', 'is', 'a', 'key', 'moment', 'for', 'a', 'matching', 'small', 'projects', 'portfolio', 'that', 'can', '1', 'greatly', 'enhance', 'the', 'science', 'reach', 'of', 'these', 'flagship', 'projects', '2', 'have', 'immediate', 'scientific', 'impact', 'and', '3', 'lay', 'the', 'groundwork', 'for', 'the', 'next', 'stages', 'of', 'the', 'cosmic', 'frontier', 'dark', 'energy', 'program', 'in', 'this', 'white', 'paper', 'we', 'outline', 'a', 'balanced', 'portfolio', 'that', 'can', 'accomplish', 'these', 'goals', 'through', 'a', 'combination', 'of', 'observational', 'experimental', 'and', 'theory', 'and', 'simulation', 'efforts']] | [-0.09525051114372173, 0.14645152850090795, -0.08925870409664169, 0.08430084861520169, -0.12190068956705735, -0.04447522781087461, 0.01141308661568709, 0.326765960788232, -0.2591086092853932, -0.3992398251518071, 0.13306722567976192, -0.2741666065843896, -0.07532811934704618, 0.2512201649378047, -0.017819558719186473, 0.02056475625902736, 0.1134635699098836, -0.06106427432207069, -0.011395651572417441, -0.32512260275464105, 0.28104736143555625, 0.1761381120367391, 0.24236480654895695, 0.045707732325138375, 0.09046632920813968, -0.021890885978870147, -0.09629655110803868, -0.03247822036551271, -0.1807355394210246, 0.11969177762428365, 0.303315081492924, 0.21032238742604636, 0.32231092535247424, -0.4394712749191915, -0.17178751138648649, 0.11016917958555797, 0.11611262249438722, 0.07315213676364489, -0.08901165277285086, -0.25651438667928034, -0.001293635499167839, -0.1970785040368172, -0.14846939669265377, -0.04995097141217092, -0.0032724778925021774, 0.05403058160190209, -0.21558461919185712, -0.006843570549469843, -0.010308081176962783, 0.03568308965617911, -0.07030234810487508, -0.15600794029228218, 0.03566230778170334, 0.1297518781188661, 0.03226719269522285, 0.07389028746594521, 0.1160947563488492, -0.21473160024611748, -0.13566371885952438, 0.397628802816608, -0.07699086453025263, 0.00023870926648512374, 0.14285748219117522, -0.18083718972340923, -0.20231358838274324, 0.0830265331783888, 0.21275312321515177, 0.06483784417132679, -0.13043138403684176, 0.09436119652039994, 0.05155887509689486, 0.1633301931818639, 0.023136290386587165, 0.04955776464177309, 0.3247229018308919, 0.22933083223245984, 0.11512319675616153, 0.05724372531466602, -0.1391071570239854, -0.05025108998118759, -0.3547139720214035, -0.18273550192507237, -0.12355867084182745, 0.053820598448405595, -0.03415542580834305, -0.06131408375640996, 0.40127575036352703, 0.17159225316316212, 0.09399772576130122, -0.022938568516058192, 0.3230655832314971, 0.0245913122613117, 0.05433576594595965, 0.024312734245423146, 0.3142161342757587, 0.04379339278642115, 0.157569971590524, -0.16626327387023743, 0.025628407471545257, -0.01379039968370641] |
1,802.07217 | Measuring frequency fluctuations in nonlinear nanomechanical resonators | Advances in nanomechanics within recent years have demonstrated an always
expanding range of devices, from top-down structures to appealing bottom-up
MoS$_2$ and graphene membranes, used for both sensing and component-oriented
applications. One of the main concerns in all of these devices is frequency
noise, which ultimately limits their applicability. This issue has attracted a
lot of attention recently, and the origin of this noise remains elusive up to
date. In this Letter we present a very simple technique to measure frequency
noise in nonlinear mechanical devices, based on the presence of bistability. It
is illustrated on silicon-nitride high-stress doubly-clamped beams, in a
cryogenic environment. We report on the same $T/f$ dependence of the frequency
noise power spectra as reported in the literature. But we also find unexpected
{\it damping fluctuations}, amplified in the vicinity of the bifurcation
points; this effect is clearly distinct from already reported nonlinear
dephasing, and poses a fundamental limit on the measurement of bifurcation
frequencies. The technique is further applied to the measurement of frequency
noise as a function of mode number, within the same device. The relative
frequency noise for the fundamental flexure $\delta f/f_0$ lies in the range
$0.5 - 0.01~$ppm (consistent with literature for cryogenic MHz devices), and
decreases with mode number in the range studied. The technique can be applied
to {\it any types} of nano-mechanical structures, enabling progresses towards
the understanding of intrinsic sources of noise in these devices.
| cond-mat.mes-hall | advances in nanomechanics within recent years have demonstrated an always expanding range of devices from topdown structures to appealing bottomup mos_2 and graphene membranes used for both sensing and componentoriented applications one of the main concerns in all of these devices is frequency noise which ultimately limits their applicability this issue has attracted a lot of attention recently and the origin of this noise remains elusive up to date in this letter we present a very simple technique to measure frequency noise in nonlinear mechanical devices based on the presence of bistability it is illustrated on siliconnitride highstress doublyclamped beams in a cryogenic environment we report on the same tf dependence of the frequency noise power spectra as reported in the literature but we also find unexpected it damping fluctuations amplified in the vicinity of the bifurcation points this effect is clearly distinct from already reported nonlinear dephasing and poses a fundamental limit on the measurement of bifurcation frequencies the technique is further applied to the measurement of frequency noise as a function of mode number within the same device the relative frequency noise for the fundamental flexure delta ff_0 lies in the range 05 001ppm consistent with literature for cryogenic mhz devices and decreases with mode number in the range studied the technique can be applied to it any types of nanomechanical structures enabling progresses towards the understanding of intrinsic sources of noise in these devices | [['advances', 'in', 'nanomechanics', 'within', 'recent', 'years', 'have', 'demonstrated', 'an', 'always', 'expanding', 'range', 'of', 'devices', 'from', 'topdown', 'structures', 'to', 'appealing', 'bottomup', 'mos_2', 'and', 'graphene', 'membranes', 'used', 'for', 'both', 'sensing', 'and', 'componentoriented', 'applications', 'one', 'of', 'the', 'main', 'concerns', 'in', 'all', 'of', 'these', 'devices', 'is', 'frequency', 'noise', 'which', 'ultimately', 'limits', 'their', 'applicability', 'this', 'issue', 'has', 'attracted', 'a', 'lot', 'of', 'attention', 'recently', 'and', 'the', 'origin', 'of', 'this', 'noise', 'remains', 'elusive', 'up', 'to', 'date', 'in', 'this', 'letter', 'we', 'present', 'a', 'very', 'simple', 'technique', 'to', 'measure', 'frequency', 'noise', 'in', 'nonlinear', 'mechanical', 'devices', 'based', 'on', 'the', 'presence', 'of', 'bistability', 'it', 'is', 'illustrated', 'on', 'siliconnitride', 'highstress', 'doublyclamped', 'beams', 'in', 'a', 'cryogenic', 'environment', 'we', 'report', 'on', 'the', 'same', 'tf', 'dependence', 'of', 'the', 'frequency', 'noise', 'power', 'spectra', 'as', 'reported', 'in', 'the', 'literature', 'but', 'we', 'also', 'find', 'unexpected', 'it', 'damping', 'fluctuations', 'amplified', 'in', 'the', 'vicinity', 'of', 'the', 'bifurcation', 'points', 'this', 'effect', 'is', 'clearly', 'distinct', 'from', 'already', 'reported', 'nonlinear', 'dephasing', 'and', 'poses', 'a', 'fundamental', 'limit', 'on', 'the', 'measurement', 'of', 'bifurcation', 'frequencies', 'the', 'technique', 'is', 'further', 'applied', 'to', 'the', 'measurement', 'of', 'frequency', 'noise', 'as', 'a', 'function', 'of', 'mode', 'number', 'within', 'the', 'same', 'device', 'the', 'relative', 'frequency', 'noise', 'for', 'the', 'fundamental', 'flexure', 'delta', 'ff_0', 'lies', 'in', 'the', 'range', '05', '001ppm', 'consistent', 'with', 'literature', 'for', 'cryogenic', 'mhz', 'devices', 'and', 'decreases', 'with', 'mode', 'number', 'in', 'the', 'range', 'studied', 'the', 'technique', 'can', 'be', 'applied', 'to', 'it', 'any', 'types', 'of', 'nanomechanical', 'structures', 'enabling', 'progresses', 'towards', 'the', 'understanding', 'of', 'intrinsic', 'sources', 'of', 'noise', 'in', 'these', 'devices']] | [-0.14078912267883673, 0.11546062051089948, -0.045630594222190776, -0.020366567296027285, -0.05423433081665218, -0.11452134161108761, 0.07732195528401693, 0.3931664282898024, -0.24763079318691486, -0.2994906483267402, 0.08901381799068216, -0.2541480374707982, -0.16117637419246406, 0.2658649789745588, -0.08309826054149244, 0.06910523959984055, 0.016464037357008684, -0.0004746813289584371, -0.007314697353433723, -0.15998607105180873, 0.26027021344585377, 0.07265027523385084, 0.3435982708361442, 0.04418098183656585, 0.10020064991519992, -0.041705514296447324, 0.0038079714473589496, -0.004833481791508147, -0.11055062435196429, 0.08550374319784786, 0.26201364321444753, 0.031246336413614236, 0.2901938212246208, -0.40446995127693575, -0.24492884370087945, 0.08609741177188895, 0.15596012573716847, 0.1470155651680262, -0.08336709471670042, -0.26399784851710756, 0.08017681556816955, -0.14584213372525143, -0.1090817125229894, -0.04554607192600951, 0.04686156105076484, 0.012133936198444058, -0.20088259205054412, 0.07602198211507284, 0.05787813054882725, 0.06044589572695135, -0.03797601982838942, -0.12403088232691763, 0.03016349412816561, 0.12095822626132897, 0.03326142649560914, -0.0008163319356044975, 0.17097887033162543, -0.1302757691226947, -0.10388791267917949, 0.36837367841310925, -0.05454890172281381, -0.1433142116826059, 0.21119169310382488, -0.1739419367760262, -0.11964034220998933, 0.12983083583698687, 0.16837375013994338, 0.08901201823209703, -0.1463579764718908, 0.06519688281375655, 0.04883458138585596, 0.19122780856313343, 0.10232237593756231, 0.11534330040469008, 0.21957489096863447, 0.23199148451804846, 0.049974098955517854, 0.14691128914606544, -0.10443863944176159, -0.031736386628126945, -0.24440008633320173, -0.101545099212425, -0.18543260826623675, 0.0557939811240708, -0.0452523544907123, -0.14341908498145284, 0.412710130380435, 0.18861185286344045, 0.19184575535720055, -0.0169152164159903, 0.3216780198548557, 0.12874149005185276, 0.08740877790398248, 0.0013190073610315006, 0.2976003336854342, 0.1624415425664619, 0.13859492814872745, -0.21723415898119683, 0.03195162388048198, -0.05979567896811513] |
1,802.07218 | A 3D Game Theoretical Framework for the Evaluation of Unmanned Aircraft
Systems Airspace Integration Concepts | Predicting the outcomes of integrating Unmanned Aerial Systems (UAS) into the
National Airspace System (NAS) is a complex problem which is required to be
addressed by simulation studies before allowing the routine access of UAS into
the NAS. This paper focuses on providing a 3-dimensional (3D) simulation
framework using a game theoretical methodology to evaluate integration concepts
using scenarios where manned and unmanned air vehicles co-exist. In the
proposed method, human pilot interactive decision making process is
incorporated into airspace models which can fill the gap in the literature
where the pilot behavior is generally assumed to be known a priori. The
proposed human pilot behavior is modeled using dynamic level-k reasoning
concept and approximate reinforcement learning. The level-k reasoning concept
is a notion in game theory and is based on the assumption that humans have
various levels of decision making. In the conventional "static" approach, each
agent makes assumptions about his or her opponents and chooses his or her
actions accordingly. On the other hand, in the dynamic level-k reasoning,
agents can update their beliefs about their opponents and revise their level-k
rule. In this study, Neural Fitted Q Iteration, which is an approximate
reinforcement learning method, is used to model time-extended decisions of
pilots with 3D maneuvers. An analysis of UAS integration is conducted using an
example 3D scenario in the presence of manned aircraft and fully autonomous UAS
equipped with sense and avoid algorithms.
| cs.GT cs.RO | predicting the outcomes of integrating unmanned aerial systems uas into the national airspace system nas is a complex problem which is required to be addressed by simulation studies before allowing the routine access of uas into the nas this paper focuses on providing a 3dimensional 3d simulation framework using a game theoretical methodology to evaluate integration concepts using scenarios where manned and unmanned air vehicles coexist in the proposed method human pilot interactive decision making process is incorporated into airspace models which can fill the gap in the literature where the pilot behavior is generally assumed to be known a priori the proposed human pilot behavior is modeled using dynamic levelk reasoning concept and approximate reinforcement learning the levelk reasoning concept is a notion in game theory and is based on the assumption that humans have various levels of decision making in the conventional static approach each agent makes assumptions about his or her opponents and chooses his or her actions accordingly on the other hand in the dynamic levelk reasoning agents can update their beliefs about their opponents and revise their levelk rule in this study neural fitted q iteration which is an approximate reinforcement learning method is used to model timeextended decisions of pilots with 3d maneuvers an analysis of uas integration is conducted using an example 3d scenario in the presence of manned aircraft and fully autonomous uas equipped with sense and avoid algorithms | [['predicting', 'the', 'outcomes', 'of', 'integrating', 'unmanned', 'aerial', 'systems', 'uas', 'into', 'the', 'national', 'airspace', 'system', 'nas', 'is', 'a', 'complex', 'problem', 'which', 'is', 'required', 'to', 'be', 'addressed', 'by', 'simulation', 'studies', 'before', 'allowing', 'the', 'routine', 'access', 'of', 'uas', 'into', 'the', 'nas', 'this', 'paper', 'focuses', 'on', 'providing', 'a', '3dimensional', '3d', 'simulation', 'framework', 'using', 'a', 'game', 'theoretical', 'methodology', 'to', 'evaluate', 'integration', 'concepts', 'using', 'scenarios', 'where', 'manned', 'and', 'unmanned', 'air', 'vehicles', 'coexist', 'in', 'the', 'proposed', 'method', 'human', 'pilot', 'interactive', 'decision', 'making', 'process', 'is', 'incorporated', 'into', 'airspace', 'models', 'which', 'can', 'fill', 'the', 'gap', 'in', 'the', 'literature', 'where', 'the', 'pilot', 'behavior', 'is', 'generally', 'assumed', 'to', 'be', 'known', 'a', 'priori', 'the', 'proposed', 'human', 'pilot', 'behavior', 'is', 'modeled', 'using', 'dynamic', 'levelk', 'reasoning', 'concept', 'and', 'approximate', 'reinforcement', 'learning', 'the', 'levelk', 'reasoning', 'concept', 'is', 'a', 'notion', 'in', 'game', 'theory', 'and', 'is', 'based', 'on', 'the', 'assumption', 'that', 'humans', 'have', 'various', 'levels', 'of', 'decision', 'making', 'in', 'the', 'conventional', 'static', 'approach', 'each', 'agent', 'makes', 'assumptions', 'about', 'his', 'or', 'her', 'opponents', 'and', 'chooses', 'his', 'or', 'her', 'actions', 'accordingly', 'on', 'the', 'other', 'hand', 'in', 'the', 'dynamic', 'levelk', 'reasoning', 'agents', 'can', 'update', 'their', 'beliefs', 'about', 'their', 'opponents', 'and', 'revise', 'their', 'levelk', 'rule', 'in', 'this', 'study', 'neural', 'fitted', 'q', 'iteration', 'which', 'is', 'an', 'approximate', 'reinforcement', 'learning', 'method', 'is', 'used', 'to', 'model', 'timeextended', 'decisions', 'of', 'pilots', 'with', '3d', 'maneuvers', 'an', 'analysis', 'of', 'uas', 'integration', 'is', 'conducted', 'using', 'an', 'example', '3d', 'scenario', 'in', 'the', 'presence', 'of', 'manned', 'aircraft', 'and', 'fully', 'autonomous', 'uas', 'equipped', 'with', 'sense', 'and', 'avoid', 'algorithms']] | [-0.11325325510947953, 0.044019118061607, -0.11153030663361294, 0.03874131428491318, -0.1375667629282104, -0.18189803911530206, 0.10411928415510661, 0.40951313109054593, -0.2456259313609278, -0.3589191511155495, 0.11163282523890525, -0.24497372018102603, -0.18548034623713244, 0.15055730505178402, -0.14709368896305183, 0.06667202121660679, 0.07898226353626714, 0.060765277415529714, 0.01470361629556, -0.23434507509473443, 0.28784438457442174, 0.0750515132038245, 0.2834816796681549, -0.021239923566721285, 0.1307456323828839, 0.0467253871299405, -0.03434549970159362, 0.00562589788487189, -0.07185765512633056, 0.13308215039862784, 0.3351412345721114, 0.20321200946778184, 0.3587156618269404, -0.44949018647540595, -0.20444351081826767, 0.08886272218304328, 0.12515537243018138, 0.053171481011250694, 0.022975520738243334, -0.36905072638489905, 0.08304131133206787, -0.2118166987902096, -0.08942023879958451, -0.053751741283482826, -0.05217571714441076, -0.01465507788067381, -0.29622557369269087, -0.06310141595858562, 0.036227153631355535, 0.10922627798222666, -0.09042751714233545, -0.0825621117449676, 0.019202178782775588, 0.20328492370438034, 0.03451557370884647, 0.01943731565423357, 0.17208859847292682, -0.12351311572391087, -0.1878110016288456, 0.3934653709929452, 0.033307921971520604, -0.22268430713096532, 0.17377229757461587, -0.030021064229042344, -0.10408814754170063, 0.09941027002342297, 0.20707416045295274, 0.1461803584029497, -0.1789536257765653, 0.049149555920668435, -0.028903088819251282, 0.18285369157362807, 0.027709745605503707, -0.047717010248688206, 0.18294440884583232, 0.2546285267738539, 0.0838820870861584, 0.07872804624587494, -0.050205043910507445, -0.18117821686272412, -0.20287442277873305, -0.12805548252514268, -0.1380159842382865, 0.0043148907262022425, -0.05250148444672514, -0.11070058375640227, 0.31215607741934087, 0.1974550756392018, 0.1269437047782578, 0.09188159632856097, 0.38388259297841965, 0.07745599739041321, 0.042595330039275035, 0.07580509071360157, 0.17989480484793757, 0.018325227995762673, 0.14884732669132922, -0.18632628159196693, 0.14300034536866132, 0.05365791983847439] |
1,802.07219 | Leibniz algebras as non-associative algebras | In this paper we define the basic concepts for left or right Leibniz algebras
and prove some of the main results. Our proofs are often variations of the
known proofs and several results seem to be new.
| math.RA | in this paper we define the basic concepts for left or right leibniz algebras and prove some of the main results our proofs are often variations of the known proofs and several results seem to be new | [['in', 'this', 'paper', 'we', 'define', 'the', 'basic', 'concepts', 'for', 'left', 'or', 'right', 'leibniz', 'algebras', 'and', 'prove', 'some', 'of', 'the', 'main', 'results', 'our', 'proofs', 'are', 'often', 'variations', 'of', 'the', 'known', 'proofs', 'and', 'several', 'results', 'seem', 'to', 'be', 'new']] | [-0.05677019652117648, 0.048407092891834876, -0.07955010831859466, 0.11523010660705434, -0.128304843614633, -0.13332682540891944, -0.030657019739895052, 0.3547970968726519, -0.3432462209382573, -0.2551947921212461, 0.21546974858407536, -0.2587833316568789, -0.1843785873198932, 0.23063525666382062, -0.20350704608938178, -0.03547449895759692, 0.03914421490972509, 0.06320886948221438, -0.08360490556554617, -0.27268861047923565, 0.38296838255750165, -0.05123962344274529, 0.15089109300862294, 0.13595832805023403, 0.0355144769230203, -0.07393416811435206, -0.08550151012133102, -0.02613500299284587, -0.18314475991536636, 0.16725542763801846, 0.26707135372467944, 0.12428392265369562, 0.27396584669681817, -0.42607008726210205, -0.07969039190258528, 0.09795094207495551, 0.17712862816060315, 0.08193392593750252, -0.027332493374627585, -0.29959899952282776, 0.13698898265893394, -0.11851992251703868, -0.12347523971284563, -0.11232670207784788, -0.010749951520985042, 0.08812233397888171, -0.2218123810567163, -0.004384104049185643, 0.185627549987387, 0.07294823820828586, -0.08390994891020898, -0.18065061853141398, 0.049235980913697464, 0.1273298771435244, 0.05469614380618205, -0.03370239312533994, 0.07492726031892202, -0.0786213638902818, -0.19781251875935374, 0.37725101884555173, 0.060773323994834684, -0.1895224874134402, 0.22060805307449521, -0.15992404156792406, -0.22414109915041844, -0.01671865091633958, 0.05084358840375333, 0.15466038102435098, -0.1382879278547055, 0.03683348248926671, -0.09540453925728798, 0.09133564348559121, 0.07701998207768476, 0.08821101728323344, 0.12944347884606672, 0.1005924557511871, 0.03297576726087042, 0.09552640740671572, 0.03186025017419377, -0.06854061100229218, -0.3799380901445811, -0.19315503706299775, -0.07425292206273691, 0.037687504872116515, -0.06599717719301053, -0.1557969136818035, 0.4187304291974854, 0.22649882547557354, 0.1744293353042087, 0.1510615952161921, 0.2620950153135267, 0.07830954827934604, 0.07667192927486188, 0.05898813417533765, 0.18398111452414603, 0.18737151740571936, 0.08858212415833731, -0.06610086040470649, 0.03393799743640262, 0.09549626515473465] |
1,802.0722 | Thermoelectricity in correlated narrow-gap semiconductors | We review many-body effects, their microscopic origin, as well as their
impact onto thermoelectricity in correlated narrow-gap semiconductors. Members
of this class---such as FeSi and FeSb$_2$---display an unusual temperature
dependence in various observables: insulating with large thermopowers at low
temperatures, they turn bad metals at temperatures much smaller than the size
of their gaps. This insulator-to-metal crossover is accompanied by spectral
weight-transfers over large energies in the optical conductivity and by a
gradual transition from activated to Curie-Weiss-like behaviour in the magnetic
susceptibility. We show a retrospective of the understanding of these
phenomena, discuss the relation to heavy-fermion Kondo insulators---such as
Ce$_3$Bi$_4$Pt$_3$ for which we present new results---and propose a general
classification of paramagnetic insulators. From the latter FeSi emerges as an
orbital-selective Kondo insulator. Focussing on intermetallics such as
silicides, antimonides, skutterudites, and Heusler compounds we showcase
successes and challenges for the realistic simulation of transport properties
in the presence of electronic correlations. Further, we advert to new avenues
in which electronic correlations may contribute to the improvement of
thermoelectric performance.
| cond-mat.str-el cond-mat.mtrl-sci | we review manybody effects their microscopic origin as well as their impact onto thermoelectricity in correlated narrowgap semiconductors members of this classsuch as fesi and fesb_2display an unusual temperature dependence in various observables insulating with large thermopowers at low temperatures they turn bad metals at temperatures much smaller than the size of their gaps this insulatortometal crossover is accompanied by spectral weighttransfers over large energies in the optical conductivity and by a gradual transition from activated to curieweisslike behaviour in the magnetic susceptibility we show a retrospective of the understanding of these phenomena discuss the relation to heavyfermion kondo insulatorssuch as ce_3bi_4pt_3 for which we present new resultsand propose a general classification of paramagnetic insulators from the latter fesi emerges as an orbitalselective kondo insulator focussing on intermetallics such as silicides antimonides skutterudites and heusler compounds we showcase successes and challenges for the realistic simulation of transport properties in the presence of electronic correlations further we advert to new avenues in which electronic correlations may contribute to the improvement of thermoelectric performance | [['we', 'review', 'manybody', 'effects', 'their', 'microscopic', 'origin', 'as', 'well', 'as', 'their', 'impact', 'onto', 'thermoelectricity', 'in', 'correlated', 'narrowgap', 'semiconductors', 'members', 'of', 'this', 'classsuch', 'as', 'fesi', 'and', 'fesb_2display', 'an', 'unusual', 'temperature', 'dependence', 'in', 'various', 'observables', 'insulating', 'with', 'large', 'thermopowers', 'at', 'low', 'temperatures', 'they', 'turn', 'bad', 'metals', 'at', 'temperatures', 'much', 'smaller', 'than', 'the', 'size', 'of', 'their', 'gaps', 'this', 'insulatortometal', 'crossover', 'is', 'accompanied', 'by', 'spectral', 'weighttransfers', 'over', 'large', 'energies', 'in', 'the', 'optical', 'conductivity', 'and', 'by', 'a', 'gradual', 'transition', 'from', 'activated', 'to', 'curieweisslike', 'behaviour', 'in', 'the', 'magnetic', 'susceptibility', 'we', 'show', 'a', 'retrospective', 'of', 'the', 'understanding', 'of', 'these', 'phenomena', 'discuss', 'the', 'relation', 'to', 'heavyfermion', 'kondo', 'insulatorssuch', 'as', 'ce_3bi_4pt_3', 'for', 'which', 'we', 'present', 'new', 'resultsand', 'propose', 'a', 'general', 'classification', 'of', 'paramagnetic', 'insulators', 'from', 'the', 'latter', 'fesi', 'emerges', 'as', 'an', 'orbitalselective', 'kondo', 'insulator', 'focussing', 'on', 'intermetallics', 'such', 'as', 'silicides', 'antimonides', 'skutterudites', 'and', 'heusler', 'compounds', 'we', 'showcase', 'successes', 'and', 'challenges', 'for', 'the', 'realistic', 'simulation', 'of', 'transport', 'properties', 'in', 'the', 'presence', 'of', 'electronic', 'correlations', 'further', 'we', 'advert', 'to', 'new', 'avenues', 'in', 'which', 'electronic', 'correlations', 'may', 'contribute', 'to', 'the', 'improvement', 'of', 'thermoelectric', 'performance']] | [-0.12380257643720445, 0.1926657647586364, -0.04512726622938533, 0.06857167541290567, -0.03536933517621253, -0.1303093518723645, 0.10713609874281767, 0.37133754158137544, -0.25925899841933553, -0.3092923257054714, 0.017967271902653875, -0.35036840355661253, -0.16109106345296217, 0.18800301946924133, 0.00416655998976369, 0.00496309222736662, -0.04938290262639168, -0.06839696547207755, -0.16321140704912113, -0.20706124713234159, 0.27648722100587164, 0.05862888026638843, 0.2894378964112894, 0.1317552331962534, -0.005733289689357791, -0.03071530897536182, 0.13509857968061365, 0.04289339439301763, -0.15321814638099612, 0.040107994783847106, 0.30951704253675416, -0.06410935060730913, 0.21747846610378474, -0.42333378774734837, -0.22024215410749007, 0.01278294758854567, 0.1348803930367077, 0.13412340478611268, -0.09815228155916668, -0.28399854726012563, 0.026440463490351767, -0.18266226322434487, -0.09560648506920275, -0.146767535289525, -0.003974609580750223, -0.003139853710308671, -0.20534672965628228, 0.12700332148510607, 0.05918299349598653, 0.13803039864121405, -0.08871368929699418, -0.18289448727695604, -0.03147722877647972, 0.08228902872707251, 0.06642757770688539, -0.008298828083622669, 0.1514128260175875, -0.15547904585366182, -0.11571732250186392, 0.39470649929162827, -0.049025491441733765, -0.020876151104901163, 0.21564214604551948, -0.19107873842031473, -0.11753956854642768, 0.1399801601350884, 0.1612915230382766, 0.07945060832814003, -0.1321451890038415, 0.03541008089935834, 0.01206761021265785, 0.13145727458842366, -0.036918004646265344, 0.16113940369887997, 0.28101473058424226, 0.23407560456655033, -0.008839949925285986, 0.15978434708501613, -0.08467531518545002, -0.0347017715075275, -0.21197016692409912, -0.17490379562756667, -0.20288025517947972, 0.09889542749373331, -0.07593238584862168, -0.21029759562086492, 0.41235449296488824, 0.20287282225451367, 0.20860431948676705, -0.051791376360814045, 0.2174297328872074, 0.08051401356905921, 0.07695554144863438, 0.02621463910188703, 0.22112126029068827, 0.12705893491372644, 0.14430818409545326, -0.28460312604771126, 0.11093206798042436, -0.0031774133344047834] |
1,802.07221 | Geometric structures and representations of discrete groups | We describe recent links between two topics: geometric structures on
manifolds in the sense of Ehresmann and Thurston, and dynamics "at infinity"
for representations of discrete groups into Lie groups.
| math.GT | we describe recent links between two topics geometric structures on manifolds in the sense of ehresmann and thurston and dynamics at infinity for representations of discrete groups into lie groups | [['we', 'describe', 'recent', 'links', 'between', 'two', 'topics', 'geometric', 'structures', 'on', 'manifolds', 'in', 'the', 'sense', 'of', 'ehresmann', 'and', 'thurston', 'and', 'dynamics', 'at', 'infinity', 'for', 'representations', 'of', 'discrete', 'groups', 'into', 'lie', 'groups']] | [-0.15368288001045585, 0.09279397927845517, -0.1555785779686024, 0.0936823258176446, -0.09877313518275817, -0.1048134820535779, 0.009689101266364257, 0.43749949242919683, -0.33360859925548236, -0.25851179572443167, 0.0757634445054767, -0.26792347282171247, -0.1998338522389531, 0.19784253068889182, -0.13868191257740062, -0.07384649409602086, 0.046435731928795576, 0.07725412740061681, -0.09375678344319265, -0.2747649074221651, 0.46326853297650816, -0.031536222280313574, 0.2758887288471063, 0.023528403513288745, 0.15964551317544343, -0.01845115766239663, -0.09262002110481263, -0.02130224967064957, -0.15521678055326144, 0.16139890781293312, 0.317243074439466, 0.009795010151962439, 0.21714493283846725, -0.43446050488079585, -0.19112575904776652, 0.12544606635347008, 0.11367381019517779, 0.015884636404613652, 0.01141417217052852, -0.3601659187115729, 0.04154276559129357, -0.07228589160367846, -0.0703129225410521, -0.049884387850761415, 0.06337886371960243, 0.043415188789367676, -0.07490240742142001, 0.01999823938434323, 0.06631593521063527, 0.13933877587939303, -0.08955238529791434, -0.0818759593491753, -0.02176298126578331, 0.18668756109351914, 0.022755667039503654, -0.0486450947355479, 0.09767122195723156, -0.07684832426408926, -0.17737532140454276, 0.3697338004906972, 0.011123500329752763, -0.24117074670890967, 0.2578180701782306, -0.16278195530176162, -0.25633503310382366, 0.08859220057105024, 0.1885287918150425, 0.08527705068700016, -0.02353592434277137, 0.13292779591477785, -0.05147789269685745, -0.004020754577747236, 0.11996433898651351, 0.007225385742882887, 0.16436666684846082, 0.10671899449080229, 0.1039393011170129, 0.10485081883768241, 0.06147502271536117, -0.09614791025718053, -0.3345888509104649, -0.18474362846463918, -0.07453383047444125, 0.07267162849505743, -0.07634923524747136, -0.11031897920183838, 0.41077330919603505, -0.011401228482524554, 0.22046708256627123, 0.1345151654056584, 0.1613362591403226, -0.07162653105333447, 0.046736073680222034, 0.11402653763070703, 0.10470206306005518, 0.2771185401827097, 0.015004475973546505, -0.08478589989244938, -0.10206554053584113, 0.2351599180760483] |
1,802.07222 | 007: Democratically Finding The Cause of Packet Drops | Network failures continue to plague datacenter operators as their symptoms
may not have direct correlation with where or why they occur. We introduce 007,
a lightweight, always-on diagnosis application that can find problematic links
and also pinpoint problems for each TCP connection. 007 is completely contained
within the end host. During its two month deployment in a tier-1 datacenter, it
detected every problem found by previously deployed monitoring tools while also
finding the sources of other problems previously undetected.
| cs.NI | network failures continue to plague datacenter operators as their symptoms may not have direct correlation with where or why they occur we introduce 007 a lightweight alwayson diagnosis application that can find problematic links and also pinpoint problems for each tcp connection 007 is completely contained within the end host during its two month deployment in a tier1 datacenter it detected every problem found by previously deployed monitoring tools while also finding the sources of other problems previously undetected | [['network', 'failures', 'continue', 'to', 'plague', 'datacenter', 'operators', 'as', 'their', 'symptoms', 'may', 'not', 'have', 'direct', 'correlation', 'with', 'where', 'or', 'why', 'they', 'occur', 'we', 'introduce', '007', 'a', 'lightweight', 'alwayson', 'diagnosis', 'application', 'that', 'can', 'find', 'problematic', 'links', 'and', 'also', 'pinpoint', 'problems', 'for', 'each', 'tcp', 'connection', '007', 'is', 'completely', 'contained', 'within', 'the', 'end', 'host', 'during', 'its', 'two', 'month', 'deployment', 'in', 'a', 'tier1', 'datacenter', 'it', 'detected', 'every', 'problem', 'found', 'by', 'previously', 'deployed', 'monitoring', 'tools', 'while', 'also', 'finding', 'the', 'sources', 'of', 'other', 'problems', 'previously', 'undetected']] | [-0.16524363764196257, 0.08248622296672739, -0.020496446922232833, 0.08560146341436319, -0.09311875496708046, -0.23486467515106632, 0.10361284248625176, 0.41213813966399504, -0.23574275745644788, -0.33064731799914865, 0.1788196315903429, -0.3062382994714794, -0.17388995501354243, 0.19272479073356696, -0.10160867931450941, 0.012689110757399917, 0.1041926723209363, 0.023673919560034062, -0.05513077320735842, -0.2643311769565968, 0.24596712704087736, 0.03303611140456522, 0.23317919348814536, 0.09081999667554716, 0.022229109089114244, -0.01752690246322817, -0.049814157308774844, -0.010418897820341907, -0.0538703876705376, 0.021599485642052715, 0.37104565244686755, 0.16933507151029345, 0.32402503728731, -0.4508010114854809, -0.2418945421924508, 0.1610018482455347, 0.20215146057528763, 0.010782474728560523, -0.011785633844335246, -0.2615973455919825, 0.10316999825424975, -0.2354556798663792, -0.1412032490118725, -0.010052647040803222, 0.0018984799485512172, -0.015806075386685332, -0.16738636140959173, 0.05883266114190669, -0.03692218017524191, 0.038406905138281565, -0.0414073015695815, -0.06455377682666236, -0.01950082927942276, 0.16497915752432485, 0.03801522242152899, 0.04224331832573384, 0.15137432105294016, -0.08115901903078385, -0.1621777797582017, 0.3787963820143921, 0.05269380924115075, -0.1306087035638622, 0.2187876084736914, -0.047144442560929284, -0.22198823328966957, 0.10807257653744537, 0.1588338490905641, 0.08743412464951412, -0.20094609897748766, -0.01227476658915535, 0.022038294297136083, 0.1816108576950464, 0.0601988981118355, 0.06728132205272588, 0.22978527094473283, 0.13381178763730428, 0.09810978436217749, 0.10444935816236996, -0.10776475977294053, -0.025671319770803558, -0.2216924649510014, -0.08172638066513818, -0.11908164206019874, 0.03401889436000728, -0.05450031552791648, -0.1580688456431491, 0.34771733166343427, 0.18927168845098843, 0.15753797966474078, 0.07381694398443156, 0.322963179195229, 0.03992742585177427, 0.1615979206907457, 0.1326148892234115, 0.24324295898498613, 0.041264871552386145, 0.16937161128838324, -0.10103579771209838, 0.15114982471553773, -0.019793254559081565] |
1,802.07223 | Stable processes conditioned to avoid an interval | Conditioning Markov processes to avoid a domain is a classical problem that
has been studied in many settings. Ingredients for standard arguments involve
the leading order tail asymptotics of the distribution of the first hitting
time of the domain of interest and its relation to an underlying harmonic
function.
In the present article we condition stable processes to avoid intervals. The
required tail asymptotics in the stable setting for $\alpha\geq 1$ go back to
classical work of Blumenthal et al. and Port from the 1960s. For $\alpha<1$, we
appeal to recent results centred around the so-called deep factorisation of the
stable process to compute hitting probabilities and, moreover, to identify the
associated harmonic functions for all $\alpha\in (0,2)$. With these in hand, we
thus prove that conditioning to avoid an interval is possible in the classical
sense and that the resulting process is a Doob $h$-transform of the stable
process killed on entering the aforesaid interval. Appealing to the
representation of the conditioned process as a Doob $h$-transform, we verify
that the conditioned process is transient.
| math.PR | conditioning markov processes to avoid a domain is a classical problem that has been studied in many settings ingredients for standard arguments involve the leading order tail asymptotics of the distribution of the first hitting time of the domain of interest and its relation to an underlying harmonic function in the present article we condition stable processes to avoid intervals the required tail asymptotics in the stable setting for alphageq 1 go back to classical work of blumenthal et al and port from the 1960s for alpha1 we appeal to recent results centred around the socalled deep factorisation of the stable process to compute hitting probabilities and moreover to identify the associated harmonic functions for all alphain 02 with these in hand we thus prove that conditioning to avoid an interval is possible in the classical sense and that the resulting process is a doob htransform of the stable process killed on entering the aforesaid interval appealing to the representation of the conditioned process as a doob htransform we verify that the conditioned process is transient | [['conditioning', 'markov', 'processes', 'to', 'avoid', 'a', 'domain', 'is', 'a', 'classical', 'problem', 'that', 'has', 'been', 'studied', 'in', 'many', 'settings', 'ingredients', 'for', 'standard', 'arguments', 'involve', 'the', 'leading', 'order', 'tail', 'asymptotics', 'of', 'the', 'distribution', 'of', 'the', 'first', 'hitting', 'time', 'of', 'the', 'domain', 'of', 'interest', 'and', 'its', 'relation', 'to', 'an', 'underlying', 'harmonic', 'function', 'in', 'the', 'present', 'article', 'we', 'condition', 'stable', 'processes', 'to', 'avoid', 'intervals', 'the', 'required', 'tail', 'asymptotics', 'in', 'the', 'stable', 'setting', 'for', 'alphageq', '1', 'go', 'back', 'to', 'classical', 'work', 'of', 'blumenthal', 'et', 'al', 'and', 'port', 'from', 'the', '1960s', 'for', 'alpha1', 'we', 'appeal', 'to', 'recent', 'results', 'centred', 'around', 'the', 'socalled', 'deep', 'factorisation', 'of', 'the', 'stable', 'process', 'to', 'compute', 'hitting', 'probabilities', 'and', 'moreover', 'to', 'identify', 'the', 'associated', 'harmonic', 'functions', 'for', 'all', 'alphain', '02', 'with', 'these', 'in', 'hand', 'we', 'thus', 'prove', 'that', 'conditioning', 'to', 'avoid', 'an', 'interval', 'is', 'possible', 'in', 'the', 'classical', 'sense', 'and', 'that', 'the', 'resulting', 'process', 'is', 'a', 'doob', 'htransform', 'of', 'the', 'stable', 'process', 'killed', 'on', 'entering', 'the', 'aforesaid', 'interval', 'appealing', 'to', 'the', 'representation', 'of', 'the', 'conditioned', 'process', 'as', 'a', 'doob', 'htransform', 'we', 'verify', 'that', 'the', 'conditioned', 'process', 'is', 'transient']] | [-0.05131346154270101, 0.09904644452184254, -0.10910606563001321, 0.08151498692306673, -0.07993167896215296, -0.08894727090955712, 0.08237862138511529, 0.3703404545535291, -0.31009424027235416, -0.21065594238065055, 0.14412540610712973, -0.2579168902858245, -0.11656894374490631, 0.18315785597819326, -0.09891172081486067, 0.09278640813499806, 0.03120365029528991, 0.042214856614340206, -0.019195668747587744, -0.23393653782973575, 0.3108379654850895, 0.059664447351182884, 0.2416024630881359, 0.027298653376585044, 0.12898464809669266, 0.01832459327256815, -0.02602919534282674, -0.051910944187759676, -0.15260471146641727, 0.09117731320690257, 0.20535943139905363, 0.10476050672481176, 0.29794109968299215, -0.41138174351495266, -0.1895576602229002, 0.15302401661491868, 0.13448677935362371, 0.06822582503346811, -0.001983363065598744, -0.2722417418236463, 0.09544060421335003, -0.13950019756951157, -0.1829403379339386, -0.0349910310681232, 0.05618180582479743, 0.018131739221809603, -0.31810613317859615, 0.07736250916919248, 0.15268841752285053, -0.0335616010918536, -0.0055012225377802015, -0.0911841641037344, 0.011762543136931279, 0.1462881603140638, 0.07082534194589905, 0.011817662656540051, 0.0934132999391295, -0.11785094684455544, -0.1420426334853718, 0.33431631801332434, -0.04628935653586681, -0.17614320738622072, 0.1813198114528363, -0.16509287871039388, -0.1602035025425721, 0.12525040520929245, 0.1357907506370049, 0.15598345711921205, -0.1392014346201904, 0.1280470395299331, 0.00466626248486467, 0.09903318522000601, 0.11681757642443037, 0.004571407539928755, 0.12077272088473281, 0.13038248516518666, 0.09238317210871504, 0.15408340545863294, -0.06709177409522288, -0.15553128838192523, -0.3279524480511265, -0.17229315870601816, -0.202306001617134, 0.05082395008966242, -0.06794671610028176, -0.1954093015400841, 0.3461882644915022, 0.18023659762647268, 0.2338207722006535, 0.09883698681634004, 0.2279259595300325, 0.16423450845799048, -0.01737824969247661, 0.04407672865041108, 0.16692263913732444, 0.13137222879000052, 0.08767058583643203, -0.1523989769616905, 0.10049747195642506, 0.09188941374238559] |
1,802.07224 | Precision temperature sensing in the presence of magnetic field noise
and vice-versa using nitrogen-vacancy centers in diamond | We demonstrate a technique for precision sensing of temperature or the
magnetic field by simultaneously driving two hyperfine transitions involving
distinct electronic states of the nitrogen-vacancy center in diamond. Frequency
modulation of both driving fields is used with either the same or opposite
phase, resulting in the immunity to fluctuations in either the magnetic field
or the temperature, respectively. In this way, a sensitivity of 1.4 nT
Hz$^{-1/2}$ or 430 $\mu$K Hz$^{-1/2}$ is demonstrated. The presented technique
only requires a single frequency demodulator and enables the use of
phase-sensitive camera imaging sensors. A simple extension of the method
utilizing two demodulators allows for simultaneous, independent, and
high-bandwidth monitoring of both the magnetic field and temperature.
| cond-mat.mes-hall physics.ins-det quant-ph | we demonstrate a technique for precision sensing of temperature or the magnetic field by simultaneously driving two hyperfine transitions involving distinct electronic states of the nitrogenvacancy center in diamond frequency modulation of both driving fields is used with either the same or opposite phase resulting in the immunity to fluctuations in either the magnetic field or the temperature respectively in this way a sensitivity of 14 nt hz12 or 430 muk hz12 is demonstrated the presented technique only requires a single frequency demodulator and enables the use of phasesensitive camera imaging sensors a simple extension of the method utilizing two demodulators allows for simultaneous independent and highbandwidth monitoring of both the magnetic field and temperature | [['we', 'demonstrate', 'a', 'technique', 'for', 'precision', 'sensing', 'of', 'temperature', 'or', 'the', 'magnetic', 'field', 'by', 'simultaneously', 'driving', 'two', 'hyperfine', 'transitions', 'involving', 'distinct', 'electronic', 'states', 'of', 'the', 'nitrogenvacancy', 'center', 'in', 'diamond', 'frequency', 'modulation', 'of', 'both', 'driving', 'fields', 'is', 'used', 'with', 'either', 'the', 'same', 'or', 'opposite', 'phase', 'resulting', 'in', 'the', 'immunity', 'to', 'fluctuations', 'in', 'either', 'the', 'magnetic', 'field', 'or', 'the', 'temperature', 'respectively', 'in', 'this', 'way', 'a', 'sensitivity', 'of', '14', 'nt', 'hz12', 'or', '430', 'muk', 'hz12', 'is', 'demonstrated', 'the', 'presented', 'technique', 'only', 'requires', 'a', 'single', 'frequency', 'demodulator', 'and', 'enables', 'the', 'use', 'of', 'phasesensitive', 'camera', 'imaging', 'sensors', 'a', 'simple', 'extension', 'of', 'the', 'method', 'utilizing', 'two', 'demodulators', 'allows', 'for', 'simultaneous', 'independent', 'and', 'highbandwidth', 'monitoring', 'of', 'both', 'the', 'magnetic', 'field', 'and', 'temperature']] | [-0.16280544048742107, 0.185616795649833, -0.015890733812652203, -0.050984294529315896, -0.009304636785679537, -0.13852406770962736, 0.06951433669714986, 0.43200353429369304, -0.2388168787178786, -0.3230244342075742, 0.09602790083736182, -0.22868127039160438, -0.08008565459724354, 0.22623312223054792, -0.0016398527679721945, 0.028163155864762222, -0.013251827584336634, 0.061714858205422114, -0.04412188379235728, -0.1325300878804663, 0.23543943295498257, 0.03184781543424596, 0.33063119154261505, 0.03183072374161819, 0.13928282752268664, 0.046992520842215287, 0.02106519510726566, 0.00696619682661865, -0.04368379258186273, 0.07245143391748728, 0.22098716715269762, 0.03634148488553879, 0.24780705033437064, -0.41499021541651177, -0.19945198078032422, 0.10012022735470015, 0.12288347829244627, 0.1242987028485083, -0.0776698253866609, -0.288662805950836, 0.042421523821742635, -0.1265312269653963, -0.11869128101464847, -0.07695405650883913, -0.04286253818857443, 0.016277769604778808, -0.33352081109972104, 0.07211055243387818, 0.028394197102423514, 0.12115260476610906, -0.08146109384251758, -0.09136610262743805, 0.02576046738287677, 0.10162306508130353, -0.04694502794629206, 0.06422313868027667, 0.19506021462704826, -0.1321296248625478, -0.13180843842742235, 0.3321852291590008, -0.10696854102425277, -0.11488047585539196, 0.18213193262724772, -0.18127369502073395, -0.07168558381659829, 0.1587163243503512, 0.1249102105791478, 0.1211785252287012, -0.15486310037946246, 0.04977436000329402, 0.09428305804688969, 0.22211006958361554, 0.09436425391544143, 0.06569503212104673, 0.20563052099441056, 0.16606336321236323, 0.0761296872333016, 0.13770748099676616, -0.22169953105242357, -0.00809082528171332, -0.21716297236473664, -0.14700315264053643, -0.18958347059948288, 0.049594313294991206, -0.0895655295038444, -0.12354293682248048, 0.4373861886155994, 0.17788645629771055, 0.1651498875702205, -0.051890641681687985, 0.34746851370386456, 0.09928825004431216, 0.08967610631623994, 0.02821472449147183, 0.2582280107004487, 0.21004981915466486, 0.1144658507536287, -0.2497839980697988, -0.03942027045413852, -0.03232242052807756] |
1,802.07225 | The logic of behavior of atoms | Understanding of the atomic structures and ways in which the atoms
interacting is critical to the understanding of chemistry. In this paper
applied the concepts of game theory in explaining reactions between elements of
the periodic table. The findings in this study suggest that the coordination
and anti coordination, also cooperation and non-cooperation between atoms and
molecules lead to bonding formation according to the game theory. Therefore,
the chemical behavior and physical treats of any chemical reaction can be
predicted. Multiple examples of each batch of the chemical reactions is
expressed to support the useability of our claims.
| physics.atm-clus physics.chem-ph | understanding of the atomic structures and ways in which the atoms interacting is critical to the understanding of chemistry in this paper applied the concepts of game theory in explaining reactions between elements of the periodic table the findings in this study suggest that the coordination and anti coordination also cooperation and noncooperation between atoms and molecules lead to bonding formation according to the game theory therefore the chemical behavior and physical treats of any chemical reaction can be predicted multiple examples of each batch of the chemical reactions is expressed to support the useability of our claims | [['understanding', 'of', 'the', 'atomic', 'structures', 'and', 'ways', 'in', 'which', 'the', 'atoms', 'interacting', 'is', 'critical', 'to', 'the', 'understanding', 'of', 'chemistry', 'in', 'this', 'paper', 'applied', 'the', 'concepts', 'of', 'game', 'theory', 'in', 'explaining', 'reactions', 'between', 'elements', 'of', 'the', 'periodic', 'table', 'the', 'findings', 'in', 'this', 'study', 'suggest', 'that', 'the', 'coordination', 'and', 'anti', 'coordination', 'also', 'cooperation', 'and', 'noncooperation', 'between', 'atoms', 'and', 'molecules', 'lead', 'to', 'bonding', 'formation', 'according', 'to', 'the', 'game', 'theory', 'therefore', 'the', 'chemical', 'behavior', 'and', 'physical', 'treats', 'of', 'any', 'chemical', 'reaction', 'can', 'be', 'predicted', 'multiple', 'examples', 'of', 'each', 'batch', 'of', 'the', 'chemical', 'reactions', 'is', 'expressed', 'to', 'support', 'the', 'useability', 'of', 'our', 'claims']] | [-0.10536171693700491, 0.13088879116076363, -0.08041081502919623, 0.03594550499980597, 0.010665141737338193, -0.10723022845832958, 0.12240169419710208, 0.32974000513246376, -0.2746348131601651, -0.3140105411083889, -0.026737497668214066, -0.26258196661575245, -0.1895775391489805, 0.09067691115604848, -0.02939340208186624, -0.037015819941292105, 0.01757315049408791, 0.021459173171099313, -0.013311586839617374, -0.23716664735765494, 0.3383152742591715, 0.06764723512718511, 0.25777396311042544, 0.12040527337758812, 0.018242873683495007, -0.03769406530833275, -0.020817312267944983, -0.007691331810906611, -0.11206004017108592, 0.1614296053891483, 0.30132767984393943, 0.10005259828776428, 0.2388419590352737, -0.49612773835812646, -0.2346990240267334, 0.08631754252752386, 0.14447341193493032, 0.14464131719552786, -0.057371829737208245, -0.24966807242905356, 0.055897519834334816, -0.14116842179443956, -0.13931939574246555, -0.054080044985124746, 0.016591426983629306, 0.088227186439026, -0.27432498149573803, -0.001530558420837252, 0.05383682575499274, 0.09168545421712178, -0.11910593184671298, -0.1004721364294438, -0.03026291699455955, 0.17105169460710293, 0.029038483540997983, -0.015332559472581218, 0.17875497756986736, -0.11326756923142628, -0.14435308796267227, 0.46270705160406445, -0.018272821618647305, -0.16029834079066502, 0.2581380905449083, -0.126432990655303, -0.13754866245327538, 0.07727660035676102, 0.1609080878960103, 0.08520552969163227, -0.15021808670603276, 0.0381416070254606, 0.0029579541410713157, 0.15443652758816467, 0.08179715325691037, 0.03408917478890609, 0.20321030725638584, 0.19577300581197762, 0.022710947771124618, 0.0815545041054084, -0.0039073662429126264, -0.18866418565133797, -0.2549515842734932, -0.21065020934707418, -0.13642328714030152, 0.020680489776459206, -0.0751721457685956, -0.1496636429177501, 0.365323894234739, 0.14860983447834236, 0.18262887997648766, -0.03571618197740238, 0.2437857595877242, 0.059782726580958775, 0.04999141640404297, 0.005078182128478878, 0.21947964236917952, 0.1596407724818042, 0.10842991869454992, -0.2798030779975438, 0.13041709573728213, 0.012938517529863058] |
1,802.07226 | Implicit Argument Prediction with Event Knowledge | Implicit arguments are not syntactically connected to their predicates, and
are therefore hard to extract. Previous work has used models with large numbers
of features, evaluated on very small datasets. We propose to train models for
implicit argument prediction on a simple cloze task, for which data can be
generated automatically at scale. This allows us to use a neural model, which
draws on narrative coherence and entity salience for predictions. We show that
our model has superior performance on both synthetic and natural data.
| cs.CL | implicit arguments are not syntactically connected to their predicates and are therefore hard to extract previous work has used models with large numbers of features evaluated on very small datasets we propose to train models for implicit argument prediction on a simple cloze task for which data can be generated automatically at scale this allows us to use a neural model which draws on narrative coherence and entity salience for predictions we show that our model has superior performance on both synthetic and natural data | [['implicit', 'arguments', 'are', 'not', 'syntactically', 'connected', 'to', 'their', 'predicates', 'and', 'are', 'therefore', 'hard', 'to', 'extract', 'previous', 'work', 'has', 'used', 'models', 'with', 'large', 'numbers', 'of', 'features', 'evaluated', 'on', 'very', 'small', 'datasets', 'we', 'propose', 'to', 'train', 'models', 'for', 'implicit', 'argument', 'prediction', 'on', 'a', 'simple', 'cloze', 'task', 'for', 'which', 'data', 'can', 'be', 'generated', 'automatically', 'at', 'scale', 'this', 'allows', 'us', 'to', 'use', 'a', 'neural', 'model', 'which', 'draws', 'on', 'narrative', 'coherence', 'and', 'entity', 'salience', 'for', 'predictions', 'we', 'show', 'that', 'our', 'model', 'has', 'superior', 'performance', 'on', 'both', 'synthetic', 'and', 'natural', 'data']] | [-0.02396925231989692, 0.016383021675488527, -0.12313163791344885, 0.12105105983175557, -0.1719135400291313, -0.18262850739993156, 0.05283527705708847, 0.4638021728352589, -0.24403017017004244, -0.3620330622782657, 0.07205805033993196, -0.2717289777830421, -0.12021805722102084, 0.24041294170105282, -0.11001705127384732, 0.06334778092363301, 0.11944875250953962, 0.05079283096334514, -0.010657940478995442, -0.2543108129326035, 0.3250700452529332, 0.04161414758247488, 0.3288177964770619, 0.064596617232789, 0.14137916108319426, -0.061594674089813936, -0.02762443505720619, 0.00204142104176914, -0.06638607445544467, 0.18950037271441783, 0.28199783589199584, 0.18579508995308597, 0.2616052411332288, -0.43782466474701376, -0.20730937754406648, 0.08292430941672886, 0.1126217036809334, 0.12784363983407862, -0.0006980652975685456, -0.3117789840654415, 0.12990750668241696, -0.16288682994816234, 0.006075658977908247, -0.22844339788014836, 0.009570132793091676, -0.01022002764922731, -0.30341961678007945, 0.03490860529024811, 0.05599602751214715, 0.048100447630071465, -0.027987287631806204, -0.07050457337104223, 0.02414435504059143, 0.14987279246835147, 0.04976390278418822, 0.02800550477798371, 0.0933174725402804, -0.12176058919935981, -0.14684356499244186, 0.36913112473728904, -0.06966627853758195, -0.2516871019211762, 0.26296834163915583, -0.03499860313227948, -0.16958401463925837, 0.06911563115769669, 0.2336720506715424, 0.13334899123018498, -0.12079693583552452, -0.006793037486290012, -0.08364850892959272, 0.23853314613704296, 0.019115026952589258, -0.035558856881278404, 0.19761282148880555, 0.20786805649233214, -0.05389410679721657, 0.11021686244399889, -0.09218838281710358, -0.07682158050866907, -0.2178052801748409, -0.06050662822364008, -0.19923882861347758, 0.0025009517614414697, -0.07864581790208296, -0.15853805075235228, 0.3932148441672325, 0.2762235585052301, 0.23586440473137532, 0.15641590861110566, 0.3145494855940342, 0.05555551898638334, 0.13006209405960845, 0.0515763504204669, 0.14620324854793795, 0.014388034383163733, 0.0994768405223594, -0.11900619312244302, 0.10962379374267424, 0.059577307833687344] |
1,802.07227 | The reduced ring order and lower semi-lattices | Every reduced ring $R$ has a natural partial order defined by $a\le b$ if
$a^2=ab$; it generalizes the natural order on a boolean ring. The article
examines when $R$ is a lower semi-lattice in this order with examples drawn
from weakly Baer rings (pp-rings) and rings of continuous functions. Locally
connected spaces and basically disconnected spaces give rings $C(X)$ which are
such lower semi-lattices. Liftings of countable orthogonal (in this order) sets
over surjective ring homomorphisms are studied.
| math.RA | every reduced ring r has a natural partial order defined by ale b if a2ab it generalizes the natural order on a boolean ring the article examines when r is a lower semilattice in this order with examples drawn from weakly baer rings pprings and rings of continuous functions locally connected spaces and basically disconnected spaces give rings cx which are such lower semilattices liftings of countable orthogonal in this order sets over surjective ring homomorphisms are studied | [['every', 'reduced', 'ring', 'r', 'has', 'a', 'natural', 'partial', 'order', 'defined', 'by', 'ale', 'b', 'if', 'a2ab', 'it', 'generalizes', 'the', 'natural', 'order', 'on', 'a', 'boolean', 'ring', 'the', 'article', 'examines', 'when', 'r', 'is', 'a', 'lower', 'semilattice', 'in', 'this', 'order', 'with', 'examples', 'drawn', 'from', 'weakly', 'baer', 'rings', 'pprings', 'and', 'rings', 'of', 'continuous', 'functions', 'locally', 'connected', 'spaces', 'and', 'basically', 'disconnected', 'spaces', 'give', 'rings', 'cx', 'which', 'are', 'such', 'lower', 'semilattices', 'liftings', 'of', 'countable', 'orthogonal', 'in', 'this', 'order', 'sets', 'over', 'surjective', 'ring', 'homomorphisms', 'are', 'studied']] | [-0.20842430371694365, 0.0988546157159008, -0.005098976736114203, 0.0433930893437695, -0.06646429876760616, -0.13383792523996202, -0.05060893956983051, 0.37929561792255995, -0.3624556112199925, -0.11566860603120227, 0.12364748158265743, -0.2596727554238849, -0.0968898176713567, 0.1721397991686781, -0.14194772015749055, -0.02318016200193337, 0.0006675438157149724, 0.11984343644134797, -0.10134664161566209, -0.3426667374207989, 0.40887427160685713, -0.04082926411133308, 0.1853753604938264, 0.004914568180774713, 0.07163760467589676, 0.005039671651396126, -0.05928252820627063, 0.07079093320319405, -0.21557889894473475, 0.11382233159156976, 0.34543346613645554, 0.0794080451868668, 0.21731879546415883, -0.36354734871178174, -0.09793327884845339, 0.22508376130422988, 0.09152980799810936, -0.05551696975878742, -0.00729611663256663, -0.2786024059592323, 0.13134574956055006, -0.23930471963793426, -0.057280827077807156, -0.0913288283657718, 0.16287168370371394, 0.06438740531538988, -0.29829446145321253, -0.04325351919736955, 0.16945695937550687, 0.13715284221273447, -0.003985720239095874, -0.07220154571310654, -0.06297527193152286, 0.01772177514397878, -0.09351845205664731, 0.0820103056499033, 0.09486925538989123, 0.013937997138853391, -0.12402621336136159, 0.39390492288686046, -0.0414711462406369, -0.1913330275928239, 0.18381935775328379, -0.21681709574874153, -0.11884429745448681, 0.15911095195099131, 0.06030263523147865, 0.1749843172184736, -0.027647277205168002, 0.2528926967567607, -0.1890853944706259, 0.09419409550919935, 0.12788534961495693, 0.0598972236749704, 0.1589252579013829, 0.08972541656187892, 0.14263411688235855, 0.17115437988699836, 0.10322818761485834, -0.0003791313222307083, -0.31586030382034064, -0.11072026979323331, -0.12553975541543747, 0.09377767966475108, -0.06201448384823592, -0.17405074641302035, 0.37879873981530016, 0.03389103386502761, 0.16098505987894612, 0.09223241906903394, 0.23113011629260205, 0.04022283153003686, 0.07493251335713408, 0.08106863599681816, 0.06237915102634337, 0.23350961990473043, -0.03580920756401421, -0.05505717738966953, -0.007746691767174702, 0.1875409926650683] |
1,802.07228 | The Malicious Use of Artificial Intelligence: Forecasting, Prevention,
and Mitigation | This report surveys the landscape of potential security threats from
malicious uses of AI, and proposes ways to better forecast, prevent, and
mitigate these threats. After analyzing the ways in which AI may influence the
threat landscape in the digital, physical, and political domains, we make four
high-level recommendations for AI researchers and other stakeholders. We also
suggest several promising areas for further research that could expand the
portfolio of defenses, or make attacks less effective or harder to execute.
Finally, we discuss, but do not conclusively resolve, the long-term equilibrium
of attackers and defenders.
| cs.AI cs.CR cs.CY | this report surveys the landscape of potential security threats from malicious uses of ai and proposes ways to better forecast prevent and mitigate these threats after analyzing the ways in which ai may influence the threat landscape in the digital physical and political domains we make four highlevel recommendations for ai researchers and other stakeholders we also suggest several promising areas for further research that could expand the portfolio of defenses or make attacks less effective or harder to execute finally we discuss but do not conclusively resolve the longterm equilibrium of attackers and defenders | [['this', 'report', 'surveys', 'the', 'landscape', 'of', 'potential', 'security', 'threats', 'from', 'malicious', 'uses', 'of', 'ai', 'and', 'proposes', 'ways', 'to', 'better', 'forecast', 'prevent', 'and', 'mitigate', 'these', 'threats', 'after', 'analyzing', 'the', 'ways', 'in', 'which', 'ai', 'may', 'influence', 'the', 'threat', 'landscape', 'in', 'the', 'digital', 'physical', 'and', 'political', 'domains', 'we', 'make', 'four', 'highlevel', 'recommendations', 'for', 'ai', 'researchers', 'and', 'other', 'stakeholders', 'we', 'also', 'suggest', 'several', 'promising', 'areas', 'for', 'further', 'research', 'that', 'could', 'expand', 'the', 'portfolio', 'of', 'defenses', 'or', 'make', 'attacks', 'less', 'effective', 'or', 'harder', 'to', 'execute', 'finally', 'we', 'discuss', 'but', 'do', 'not', 'conclusively', 'resolve', 'the', 'longterm', 'equilibrium', 'of', 'attackers', 'and', 'defenders']] | [-0.0888931832692929, 0.036857015061143195, -0.10414041029779535, 0.12242380503724379, -0.1742913362423056, -0.21744718541832347, 0.12726232225663567, 0.38056710234500074, -0.26090277845138, -0.3503777267999555, 0.10598630003484064, -0.32376715291879676, -0.2081292312739319, 0.18453509239602442, -0.16636575770466344, 0.0520904597973353, 0.013498365720979085, -0.0399328793251985, 0.009957250004242125, -0.3345648412690743, 0.3388666050704686, 0.047327188892584096, 0.2599137815793878, 0.11496185839764382, -0.022903078578804668, -0.04084500104777123, -0.06280253610916828, -0.005061619883819826, -0.11003221920729725, 0.1392614857930886, 0.3668588670460801, 0.2763809301743382, 0.4098302982453453, -0.4943363644672852, -0.2037665183018697, 0.1288127045049087, 0.18177582368646797, 0.12926108738481018, -0.029775469411948793, -0.33383746027554334, 0.08413067928110984, -0.2574478796634235, -0.1462241374838509, -0.1683142215662979, 0.019096765755430647, 0.04587865326627109, -0.18754154155888644, -0.047480726481635906, 0.019107841146423627, 0.08420521776731077, -0.05526564141098214, -0.12269886002483729, 0.017955009109879794, 0.20681650812100422, 0.11326089803325502, -0.04002106117672826, 0.21049473560170123, -0.1848539420035913, -0.18305986937821694, 0.3649252209028131, 0.035323500149809804, -0.12576822426758313, 0.18765508649184515, -0.03278288824581786, -0.18319932874782305, 0.02930301632241983, 0.21471597789541672, 0.05661366457413686, -0.16349040877172036, -0.013445149691113711, 0.08866237223295396, 0.18765864303629648, 0.04678978161812809, 0.031498139885891424, 0.267958308991633, 0.14111847919657042, 0.1637246084325996, 0.10326506629843558, -0.08788785760928142, -0.09590562259484278, -0.18412692621595372, -0.1227516576224987, -0.06219915673626881, 0.0697368641802122, -0.03149007734716992, -0.1273354897912788, 0.4120104815222715, 0.3051607211720885, 0.09726772908317416, 0.013393605658539424, 0.3500516164753782, -0.037787705826524055, 0.07986614110046311, 0.08410174193007773, 0.2533134992724579, -0.0840981504438739, 0.16605949129321074, -0.14810580420797984, 0.1604907089648278, -0.09660292688365045] |
1,802.07229 | Actively Avoiding Nonsense in Generative Models | A generative model may generate utter nonsense when it is fit to maximize the
likelihood of observed data. This happens due to "model error," i.e., when the
true data generating distribution does not fit within the class of generative
models being learned. To address this, we propose a model of active
distribution learning using a binary invalidity oracle that identifies some
examples as clearly invalid, together with random positive examples sampled
from the true distribution. The goal is to maximize the likelihood of the
positive examples subject to the constraint of (almost) never generating
examples labeled invalid by the oracle. Guarantees are agnostic compared to a
class of probability distributions. We show that, while proper learning often
requires exponentially many queries to the invalidity oracle, improper
distribution learning can be done using polynomially many queries.
| cs.LG cs.DS stat.ML | a generative model may generate utter nonsense when it is fit to maximize the likelihood of observed data this happens due to model error ie when the true data generating distribution does not fit within the class of generative models being learned to address this we propose a model of active distribution learning using a binary invalidity oracle that identifies some examples as clearly invalid together with random positive examples sampled from the true distribution the goal is to maximize the likelihood of the positive examples subject to the constraint of almost never generating examples labeled invalid by the oracle guarantees are agnostic compared to a class of probability distributions we show that while proper learning often requires exponentially many queries to the invalidity oracle improper distribution learning can be done using polynomially many queries | [['a', 'generative', 'model', 'may', 'generate', 'utter', 'nonsense', 'when', 'it', 'is', 'fit', 'to', 'maximize', 'the', 'likelihood', 'of', 'observed', 'data', 'this', 'happens', 'due', 'to', 'model', 'error', 'ie', 'when', 'the', 'true', 'data', 'generating', 'distribution', 'does', 'not', 'fit', 'within', 'the', 'class', 'of', 'generative', 'models', 'being', 'learned', 'to', 'address', 'this', 'we', 'propose', 'a', 'model', 'of', 'active', 'distribution', 'learning', 'using', 'a', 'binary', 'invalidity', 'oracle', 'that', 'identifies', 'some', 'examples', 'as', 'clearly', 'invalid', 'together', 'with', 'random', 'positive', 'examples', 'sampled', 'from', 'the', 'true', 'distribution', 'the', 'goal', 'is', 'to', 'maximize', 'the', 'likelihood', 'of', 'the', 'positive', 'examples', 'subject', 'to', 'the', 'constraint', 'of', 'almost', 'never', 'generating', 'examples', 'labeled', 'invalid', 'by', 'the', 'oracle', 'guarantees', 'are', 'agnostic', 'compared', 'to', 'a', 'class', 'of', 'probability', 'distributions', 'we', 'show', 'that', 'while', 'proper', 'learning', 'often', 'requires', 'exponentially', 'many', 'queries', 'to', 'the', 'invalidity', 'oracle', 'improper', 'distribution', 'learning', 'can', 'be', 'done', 'using', 'polynomially', 'many', 'queries']] | [-0.03196129685060845, 0.050367053730965214, -0.06580777738450302, 0.15329603810656678, -0.12955145822079092, -0.19572517743541135, 0.08721360370378803, 0.4074159089786311, -0.28173096684945953, -0.3421420357224566, 0.0795438990238364, -0.2927814582845679, -0.12997718774627343, 0.17109046099121095, -0.16298874130351815, 0.1123688163511731, 0.07996074586278862, 0.06440032091405656, -0.05317689235218697, -0.3049235816665546, 0.30422650440423576, 0.05148806107355523, 0.2839364843236076, -0.04558772760339909, 0.10463886134222977, -0.00824516964731393, -0.009181321688703503, 0.032644185349690144, -0.06940524578148378, 0.12882131404691824, 0.2840200714468665, 0.2325570070978116, 0.3480359432977383, -0.36334147896548663, -0.19827739195208308, 0.17678061775104315, 0.14755893316792532, 0.11561862163901053, -0.01890415953023842, -0.27330652957316487, 0.09848625021814196, -0.14786647163607455, -0.07624485852645227, -0.12452292813126135, -0.04249866729671205, 0.028114947782725924, -0.35229742708788425, 0.021840530943504913, 0.10890127832621888, 0.008145274297782668, -0.029150155438455165, -0.09323261110457005, 0.017108187224302025, 0.10597872992296255, 0.10362532299995009, 0.058039834862574934, 0.10054508180323023, -0.13671396386214635, -0.11152316317031229, 0.3545676926909773, -0.035526016092410795, -0.22076480857751987, 0.15499767853567997, -0.0990314932367592, -0.1326948402846163, 0.148477799790325, 0.1832933501512916, 0.10154097681451175, -0.1772304018728728, 0.06572866630567997, -0.07567145649205756, 0.17912851783567696, 0.024521156450888763, -0.010078304864604164, 0.16906221479315447, 0.12073906772873468, 0.03412230281004061, 0.15924074791147616, -0.07267420934858146, -0.1085944249191218, -0.3023426639743977, -0.0842295643735539, -0.27578227622779433, 0.03492629156734674, -0.08325838452825944, -0.19657784589669772, 0.3516563223467933, 0.21044312761320422, 0.24373138877390713, 0.15602587148788627, 0.2864047223357139, 0.07998295763628212, 0.06894531205503476, 0.11491058888603692, 0.16870431312019246, 0.061249800392047124, 0.03993276073252437, -0.12350968529332292, 0.20379048310634162, -0.00921987902580036] |
1,802.0723 | A Minimaxmax Problem for Improving the Torsional Stability of
Rectangular Plates | We use a gap function in order to compare the torsional performances of
different reinforced plates under the action of external forces. Then, we
address a shape optimization problem, whose target is to minimize the torsional
displacements of the plate: this leads us to set up a minimaxmax problem, which
includes a new kind of worst-case optimization. Two kinds of reinforcements are
considered: one aims at strengthening the plate, the other aims at weakening
the action of the external forces. For both of them, we study the existence of
optima within suitable classes of external forces and reinforcements. Our
results are complemented with numerical experiments and with a number of open
problems and conjectures.
| math.AP math.CA math.OC | we use a gap function in order to compare the torsional performances of different reinforced plates under the action of external forces then we address a shape optimization problem whose target is to minimize the torsional displacements of the plate this leads us to set up a minimaxmax problem which includes a new kind of worstcase optimization two kinds of reinforcements are considered one aims at strengthening the plate the other aims at weakening the action of the external forces for both of them we study the existence of optima within suitable classes of external forces and reinforcements our results are complemented with numerical experiments and with a number of open problems and conjectures | [['we', 'use', 'a', 'gap', 'function', 'in', 'order', 'to', 'compare', 'the', 'torsional', 'performances', 'of', 'different', 'reinforced', 'plates', 'under', 'the', 'action', 'of', 'external', 'forces', 'then', 'we', 'address', 'a', 'shape', 'optimization', 'problem', 'whose', 'target', 'is', 'to', 'minimize', 'the', 'torsional', 'displacements', 'of', 'the', 'plate', 'this', 'leads', 'us', 'to', 'set', 'up', 'a', 'minimaxmax', 'problem', 'which', 'includes', 'a', 'new', 'kind', 'of', 'worstcase', 'optimization', 'two', 'kinds', 'of', 'reinforcements', 'are', 'considered', 'one', 'aims', 'at', 'strengthening', 'the', 'plate', 'the', 'other', 'aims', 'at', 'weakening', 'the', 'action', 'of', 'the', 'external', 'forces', 'for', 'both', 'of', 'them', 'we', 'study', 'the', 'existence', 'of', 'optima', 'within', 'suitable', 'classes', 'of', 'external', 'forces', 'and', 'reinforcements', 'our', 'results', 'are', 'complemented', 'with', 'numerical', 'experiments', 'and', 'with', 'a', 'number', 'of', 'open', 'problems', 'and', 'conjectures']] | [-0.14652662576316336, 0.08273611053004366, -0.06749345592132448, 0.014394589205297221, -0.09490587494739916, -0.10205629304364587, 0.051053962404468814, 0.3876693146715386, -0.2911611578995939, -0.33103379130000826, 0.09063949905216397, -0.2767295111980355, -0.13083428291777, 0.1918347133570804, -0.06634646303234704, 0.08114277908116975, 0.05216936718783778, 0.022892680027382036, -0.065534634262208, -0.23708562811721215, 0.33893117552573704, 0.02185208068550688, 0.2539239027331361, 0.05623255127503133, 0.10152448673806755, -0.016488200964290746, -0.008811021388500137, 0.079412639211138, -0.12583793313613376, 0.15684331326119075, 0.20234409760914546, 0.05895574510806298, 0.32296490232435476, -0.45815435904119395, -0.1666674875629555, 0.09021598604235766, 0.03668990920607384, 0.10381409801044131, -0.010325878652521468, -0.25734752220456053, 0.07909382089243097, -0.11316330009964254, -0.1504678789452048, -0.04491823690786826, -0.018436025251197603, 0.0655616251813594, -0.29167584436574734, 0.02473965678899755, 0.055249690803476664, 0.043593749296810244, -0.11985532141628519, -0.10076904601821329, 0.06057342400246885, 0.16843623571938512, 0.10217196488365597, 0.008982537694448458, 0.12754342630835233, -0.13844665297949935, -0.10736774720366946, 0.3964119815325315, -0.044516740578012456, -0.22265883653828528, 0.23959413700761784, -0.06422131227131571, -0.10445656306192741, 0.11622620412700735, 0.19150536092805914, 0.12255821362203728, -0.15312238745556206, 0.03717412023065381, -0.03362191791761568, 0.1238399912362127, 0.10825644173057733, -0.021229300218885683, 0.1892154658402819, 0.1847296084104254, 0.10055951281673217, 0.2309935407541008, -0.07410426124383333, -0.06694108056135278, -0.33879644084161364, -0.11932212596066889, -0.12406715323769413, -0.0021821494699472282, -0.05343951752980598, -0.15754028187191063, 0.41107531647255596, 0.14645799658203548, 0.1768191403635176, 0.0546179569987745, 0.26323910321282074, 0.048781792831682366, 0.058655562110047424, 0.04190118040114773, 0.2605380510120133, 0.13064001221415808, 0.04246463001071088, -0.2441400762099311, 0.02535623445101412, 0.06580211596349173] |
1,802.07231 | Frictionless Authentication System: Security & Privacy Analysis and
Potential Solutions | This paper proposes a frictionless authentication system, provides a
comprehensive security analysis of and proposes potential solutions for this
system. It first presents a system that allows users to authenticate to
services in a frictionless manner, i.e., without the need to perform any
particular authentication-related actions. Based on this system model, the
paper analyses security problems and potential privacy threats imposed on
users, leading to the specification of a set of security and privacy
requirements. These requirements can be used as a guidance on designing secure
and privacy-friendly frictionless authentication systems. The paper also
sketches three potential solutions for such systems and highlights their
advantages and disadvantages.
| cs.CR | this paper proposes a frictionless authentication system provides a comprehensive security analysis of and proposes potential solutions for this system it first presents a system that allows users to authenticate to services in a frictionless manner ie without the need to perform any particular authenticationrelated actions based on this system model the paper analyses security problems and potential privacy threats imposed on users leading to the specification of a set of security and privacy requirements these requirements can be used as a guidance on designing secure and privacyfriendly frictionless authentication systems the paper also sketches three potential solutions for such systems and highlights their advantages and disadvantages | [['this', 'paper', 'proposes', 'a', 'frictionless', 'authentication', 'system', 'provides', 'a', 'comprehensive', 'security', 'analysis', 'of', 'and', 'proposes', 'potential', 'solutions', 'for', 'this', 'system', 'it', 'first', 'presents', 'a', 'system', 'that', 'allows', 'users', 'to', 'authenticate', 'to', 'services', 'in', 'a', 'frictionless', 'manner', 'ie', 'without', 'the', 'need', 'to', 'perform', 'any', 'particular', 'authenticationrelated', 'actions', 'based', 'on', 'this', 'system', 'model', 'the', 'paper', 'analyses', 'security', 'problems', 'and', 'potential', 'privacy', 'threats', 'imposed', 'on', 'users', 'leading', 'to', 'the', 'specification', 'of', 'a', 'set', 'of', 'security', 'and', 'privacy', 'requirements', 'these', 'requirements', 'can', 'be', 'used', 'as', 'a', 'guidance', 'on', 'designing', 'secure', 'and', 'privacyfriendly', 'frictionless', 'authentication', 'systems', 'the', 'paper', 'also', 'sketches', 'three', 'potential', 'solutions', 'for', 'such', 'systems', 'and', 'highlights', 'their', 'advantages', 'and', 'disadvantages']] | [-0.20731558432837702, -0.08764757867902517, -0.08971801774470874, 0.031200266057704488, -0.09666759576999916, -0.23652292529718494, 0.11648000966217194, 0.34375820521546424, -0.25222383005509397, -0.3187849874397353, 0.13999000785516505, -0.29269921678826233, -0.18702156391908537, 0.18650659182293447, -0.1736013339601791, 0.16323941901220745, 0.039839636086363275, -0.02013265747436375, -0.0170282722617728, -0.2696817172273888, 0.3570276675482263, 0.03093169754335903, 0.3150141512324928, 0.10340201664926871, 0.0748122938126677, 0.012849509364591455, 0.01568445554393001, 0.0003722776606116655, -0.10958241791068192, 0.16673645068768342, 0.29656996901305216, 0.2038020827359397, 0.3719887620997879, -0.4203489047281866, -0.16823751735940295, 0.08716697489649479, 0.17358911062924648, 0.09485307042399105, -0.09862020468440363, -0.30713929929155503, 0.08949910229036831, -0.26798727481081236, -0.09598088186489032, -0.1565838735946015, -0.03390757059337975, 0.025774143750445462, -0.3048310138698105, -0.047885890521014655, 0.04758472220515305, 0.08601860694130356, -0.07859299284513635, -0.012855200127716054, 0.03344971691214321, 0.1808047061302822, 0.04300144753959206, -0.04583904607977086, 0.16306211410160615, -0.12057128406507578, -0.15264441676103985, 0.44969844747826737, 0.03645309715373617, -0.2296957751408764, 0.22184417008989016, 0.004638189700309117, -0.15270252349645883, 0.05673529735748779, 0.2577288981333797, 0.05030008388698576, -0.2404220715288143, 0.030256329114188633, 0.019256539431945333, 0.2108278067185069, 0.011726199276964971, 0.07765334896866302, 0.20938303789897067, 0.21830182970404835, 0.11821342178813692, 0.1228289903605023, -0.008682273699515412, -0.07043010051766375, -0.27611683195188885, -0.18753003033826937, -0.10057887731049701, -4.391655883804526e-05, -0.033419913743273355, -0.14131864372922, 0.39284783303034754, 0.2519549763418804, 0.11644171449830229, 0.09971695251428997, 0.4281109177489888, 0.03891554573467902, 0.037602343594321526, 0.10189640123115958, 0.17848326807911946, -0.019390923533377784, 0.21208227478090744, -0.11199230036504988, 0.11987779491124148, 0.025435882363521126] |
1,802.07232 | Observational constraints on the free parameters of an interacting
Bose-Einstein gas as a dark-energy model | Dark energy is modelled by a Bose-Einstein gas of particles with an
attractive interaction. It is coupled to cold dark matter, within a flat
universe, for the late-expansion description, producing variations in
particle-number densities. The model's parameters, and physical association,
are: $\Omega_{G0}$, $\Omega_{m0}$, the dark-energy rest-mass energy density and
the dark-matter term scaling as a mass term, respectively; $\Omega_{i0}$, the
self-interaction intensity; $x$, the energy exchange rate. Energy conservation
relates such parameters. The Hubble equation omits $\Omega_{G0}$, but also
contains $h$, the present-day expansion rate of the flat
Friedman--Lem\^aitre--Robertson--Walker metric, and $\Omega_{b0}$, the baryon
energy density, used as a prior. This results in the four effective chosen
parameters $\Omega_{b0}$, $h$, $\Omega_{m0}$, $\Omega_{i0}$, fit with the
Hubble expansion rate $H(z)$, and data from its value today, near distance, and
supernovas. We derive wide $1\sigma$ and $2\sigma$ likelihood regions
compatible with definite positive total CDM and IBEG mass terms. Additionally,
the best-fit value of parameter $x$ relieves the coincidence problem, and a
second potential coincidence problem related to the choice of $\Omega_{G0}$.
| astro-ph.CO | dark energy is modelled by a boseeinstein gas of particles with an attractive interaction it is coupled to cold dark matter within a flat universe for the lateexpansion description producing variations in particlenumber densities the models parameters and physical association are omega_g0 omega_m0 the darkenergy restmass energy density and the darkmatter term scaling as a mass term respectively omega_i0 the selfinteraction intensity x the energy exchange rate energy conservation relates such parameters the hubble equation omits omega_g0 but also contains h the presentday expansion rate of the flat friedmanlemaitrerobertsonwalker metric and omega_b0 the baryon energy density used as a prior this results in the four effective chosen parameters omega_b0 h omega_m0 omega_i0 fit with the hubble expansion rate hz and data from its value today near distance and supernovas we derive wide 1sigma and 2sigma likelihood regions compatible with definite positive total cdm and ibeg mass terms additionally the bestfit value of parameter x relieves the coincidence problem and a second potential coincidence problem related to the choice of omega_g0 | [['dark', 'energy', 'is', 'modelled', 'by', 'a', 'boseeinstein', 'gas', 'of', 'particles', 'with', 'an', 'attractive', 'interaction', 'it', 'is', 'coupled', 'to', 'cold', 'dark', 'matter', 'within', 'a', 'flat', 'universe', 'for', 'the', 'lateexpansion', 'description', 'producing', 'variations', 'in', 'particlenumber', 'densities', 'the', 'models', 'parameters', 'and', 'physical', 'association', 'are', 'omega_g0', 'omega_m0', 'the', 'darkenergy', 'restmass', 'energy', 'density', 'and', 'the', 'darkmatter', 'term', 'scaling', 'as', 'a', 'mass', 'term', 'respectively', 'omega_i0', 'the', 'selfinteraction', 'intensity', 'x', 'the', 'energy', 'exchange', 'rate', 'energy', 'conservation', 'relates', 'such', 'parameters', 'the', 'hubble', 'equation', 'omits', 'omega_g0', 'but', 'also', 'contains', 'h', 'the', 'presentday', 'expansion', 'rate', 'of', 'the', 'flat', 'friedmanlemaitrerobertsonwalker', 'metric', 'and', 'omega_b0', 'the', 'baryon', 'energy', 'density', 'used', 'as', 'a', 'prior', 'this', 'results', 'in', 'the', 'four', 'effective', 'chosen', 'parameters', 'omega_b0', 'h', 'omega_m0', 'omega_i0', 'fit', 'with', 'the', 'hubble', 'expansion', 'rate', 'hz', 'and', 'data', 'from', 'its', 'value', 'today', 'near', 'distance', 'and', 'supernovas', 'we', 'derive', 'wide', '1sigma', 'and', '2sigma', 'likelihood', 'regions', 'compatible', 'with', 'definite', 'positive', 'total', 'cdm', 'and', 'ibeg', 'mass', 'terms', 'additionally', 'the', 'bestfit', 'value', 'of', 'parameter', 'x', 'relieves', 'the', 'coincidence', 'problem', 'and', 'a', 'second', 'potential', 'coincidence', 'problem', 'related', 'to', 'the', 'choice', 'of', 'omega_g0']] | [-0.12514186250579465, 0.1396621567550721, -0.05592845707100683, 0.12354446606436145, -0.0885308343290706, -0.10150770296777842, 0.021346683020792193, 0.2966658520163037, -0.22829779160591507, -0.3548613090353597, 0.03631879194290377, -0.2810951341830549, 0.019824932255904145, 0.1330802991163052, 0.015079132978003361, 0.017279079962463584, 0.015909298276667306, 0.05786376347255316, -0.06834768829867244, -0.22934031313551323, 0.3188700649216549, 0.12021312895341821, 0.22161116606938386, 0.033931315959697325, 0.12968317730909412, -0.043044204298417925, -0.02904014478969787, -0.018267487480659924, -0.2398218027582126, 0.04677395940858072, 0.18179543288570563, 0.0931239359716918, 0.21493634755218713, -0.3250059713664952, -0.22722245109201009, 0.18130935460794717, 0.12771149141259402, 0.054555141649741144, -0.05209620741827946, -0.2558833145802574, -0.03068623702468661, -0.19404608909930435, -0.15312678341121813, -0.019787216328993617, 0.03107082827704116, 0.01641281349362717, -0.2801571988190214, 0.23282276105081628, -0.0886620217463046, -0.0632023632615095, -0.1378808755841982, -0.13924833911143997, -0.07411049525364347, -0.003124662090115072, 0.07193475827391792, 0.07621692168080092, 0.16641747338386872, -0.17043483242863053, 0.009950967846504812, 0.3924080422757903, -0.13753818248923858, -0.15956959767555373, 0.12326180986877132, -0.12091759983671918, -0.09312022663930077, 0.13079559020393172, 0.09911202483635861, 0.044784550017322455, -0.1455706735695934, 0.1606789839951532, 0.022899484046016976, 0.22417447123873335, 0.08922295333745535, 0.027537056340536634, 0.2794705447075622, 0.12464301805898902, 0.05250617810192385, 0.017227773417419354, -0.1201399392282058, -0.08486202497512013, -0.3381901783286594, -0.1099931449086095, -0.1777211408646378, 0.04537104814967495, -0.1881647345192808, -0.13758401551915864, 0.3518319831983674, 0.0844887057929078, 0.23712681158490123, 0.05880397404654927, 0.2992565576583036, 0.13036459876734408, 0.05153288441665825, 0.07403568490242053, 0.2676355488254644, 0.14460744427023678, 0.08158714482228138, -0.2336215779153766, 0.01286361098755151, 0.02010363738130157] |
1,802.07233 | Frictionless Authentication Systems: Emerging Trends, Research
Challenges and Opportunities | Authentication and authorization are critical security layers to protect a
wide range of online systems, services and content. However, the increased
prevalence of wearable and mobile devices, the expectations of a frictionless
experience and the diverse user environments will challenge the way users are
authenticated. Consumers demand secure and privacy-aware access from any
device, whenever and wherever they are, without any obstacles. This paper
reviews emerging trends and challenges with frictionless authentication systems
and identifies opportunities for further research related to the enrollment of
users, the usability of authentication schemes, as well as security and privacy
trade-offs of mobile and wearable continuous authentication systems.
| cs.CR | authentication and authorization are critical security layers to protect a wide range of online systems services and content however the increased prevalence of wearable and mobile devices the expectations of a frictionless experience and the diverse user environments will challenge the way users are authenticated consumers demand secure and privacyaware access from any device whenever and wherever they are without any obstacles this paper reviews emerging trends and challenges with frictionless authentication systems and identifies opportunities for further research related to the enrollment of users the usability of authentication schemes as well as security and privacy tradeoffs of mobile and wearable continuous authentication systems | [['authentication', 'and', 'authorization', 'are', 'critical', 'security', 'layers', 'to', 'protect', 'a', 'wide', 'range', 'of', 'online', 'systems', 'services', 'and', 'content', 'however', 'the', 'increased', 'prevalence', 'of', 'wearable', 'and', 'mobile', 'devices', 'the', 'expectations', 'of', 'a', 'frictionless', 'experience', 'and', 'the', 'diverse', 'user', 'environments', 'will', 'challenge', 'the', 'way', 'users', 'are', 'authenticated', 'consumers', 'demand', 'secure', 'and', 'privacyaware', 'access', 'from', 'any', 'device', 'whenever', 'and', 'wherever', 'they', 'are', 'without', 'any', 'obstacles', 'this', 'paper', 'reviews', 'emerging', 'trends', 'and', 'challenges', 'with', 'frictionless', 'authentication', 'systems', 'and', 'identifies', 'opportunities', 'for', 'further', 'research', 'related', 'to', 'the', 'enrollment', 'of', 'users', 'the', 'usability', 'of', 'authentication', 'schemes', 'as', 'well', 'as', 'security', 'and', 'privacy', 'tradeoffs', 'of', 'mobile', 'and', 'wearable', 'continuous', 'authentication', 'systems']] | [-0.23152342604365772, 0.007018518403548604, 0.00046544831443148164, 0.03581898505777085, -0.09510889596556528, -0.3009323548086776, 0.13180903401875044, 0.398607802290756, -0.2799690329657796, -0.3491024411498354, 0.13400394120253623, -0.3612238694376384, -0.153736794877869, 0.2071514035252711, -0.19630563783889207, 0.13237168764373144, 0.004284605062611473, -0.015306140405860228, -0.005669128222507425, -0.3024779779393262, 0.31601154249018204, 0.026130285597621247, 0.38453965009942365, 0.12948795181896108, 0.014630829978089493, 0.012542503420263529, -0.03458608862442466, -0.06559243578857814, -0.06911368850985757, 0.17740342172328383, 0.41294302619420564, 0.20263692982888853, 0.3669441428411609, -0.4221098340349272, -0.17511876257888687, 0.044213014242884055, 0.17226506020569315, 0.06465707777981432, -0.1321066822677564, -0.34880492438633853, 0.1266143468998892, -0.319836487102573, -0.0744627939822329, -0.0689104437120617, -0.0027674029608113835, 0.10727701500805918, -0.29114799791400753, -0.0598132849823182, -0.018504830935853533, 0.14413600875055776, -0.05640212077126377, -0.008487078294050522, -0.005442003085940646, 0.2677306885777328, 0.08076628182271424, -0.05754374001788584, 0.2360842354918042, -0.1961967859444065, -0.16451918301978508, 0.4304224028466986, 0.11350507865874813, -0.13130397581013453, 0.2458309415624871, -0.00977907816055589, -0.10230120799790782, 0.05367156146810605, 0.2571089187068327, 0.01346650595167795, -0.2217029340995046, 0.008823687937155437, 0.030349084874615073, 0.18930501100392297, 0.018516238729576938, 0.13979693403178736, 0.22756816278426692, 0.16767920218766308, 0.11828785503390603, 0.028758185575357996, 0.006457520738387337, -0.09867104128128491, -0.20212745626206294, -0.2068149101956246, -0.14345313669988313, -0.0008521313877561345, -0.0763721368395916, -0.11838132567488803, 0.31052326248027384, 0.2338254900308899, 0.08877303490701777, 0.051430468066917874, 0.4307124184516187, -0.01694245889218739, 0.09177311795512931, 0.1348263777953644, 0.11774353871386176, -0.0428374720370182, 0.2742260016160659, -0.0809373523045976, 0.17596517520276114, -0.06342472714963011] |
1,802.07234 | A support theorem for nested Hilbert schemes of planar curves | Consider a family of integral complex locally planar curves. We show that
under some assumptions on the basis, the relative nested Hilbert scheme is
smooth. In this case, the decomposition theorem of Beilinson, Bernstein and
Deligne asserts that the pushforward of the constant sheaf on the relative
nested Hilbert scheme splits as a direct sum of shifted semisimple perverse
sheaves. We will show that no summand is supported in positive codimension.
| math.AG | consider a family of integral complex locally planar curves we show that under some assumptions on the basis the relative nested hilbert scheme is smooth in this case the decomposition theorem of beilinson bernstein and deligne asserts that the pushforward of the constant sheaf on the relative nested hilbert scheme splits as a direct sum of shifted semisimple perverse sheaves we will show that no summand is supported in positive codimension | [['consider', 'a', 'family', 'of', 'integral', 'complex', 'locally', 'planar', 'curves', 'we', 'show', 'that', 'under', 'some', 'assumptions', 'on', 'the', 'basis', 'the', 'relative', 'nested', 'hilbert', 'scheme', 'is', 'smooth', 'in', 'this', 'case', 'the', 'decomposition', 'theorem', 'of', 'beilinson', 'bernstein', 'and', 'deligne', 'asserts', 'that', 'the', 'pushforward', 'of', 'the', 'constant', 'sheaf', 'on', 'the', 'relative', 'nested', 'hilbert', 'scheme', 'splits', 'as', 'a', 'direct', 'sum', 'of', 'shifted', 'semisimple', 'perverse', 'sheaves', 'we', 'will', 'show', 'that', 'no', 'summand', 'is', 'supported', 'in', 'positive', 'codimension']] | [-0.23346775004961592, 0.0373715533101013, -0.1383692452447935, 0.06422614753016756, -0.0987210958199182, -0.11455390088155236, -3.7898283294388946e-05, 0.362954835373823, -0.36347588702616557, -0.08476759486792373, 0.06572322956365075, -0.17092578231134045, -0.1706765122501783, 0.2530321909875517, -0.18155710370292966, -0.04473242226620795, 0.10465197694081237, 0.06343970857035945, -0.0703131473708478, -0.29463748282647995, 0.49174481228282546, -0.055456799202480575, 0.3045121102764363, 0.06655455827565444, 0.11596308221948713, 0.04438945401827214, -0.021620808300417915, -0.05654727566567525, -0.12540344672077122, 0.15613480886234574, 0.29071035526666633, 0.08499665027090782, 0.2620966209911964, -0.3842450615254716, -0.13370962469825443, 0.2156209584561662, 0.09134440871716386, -0.006702007699600407, 0.01503507525686332, -0.23224824267229668, 0.0796311096924449, -0.1719373131669323, -0.17923006108424194, -0.10149288110592415, 0.02355414630294266, 0.019422816414333566, -0.2544687731243985, 0.01505495518655844, 0.0983812404924784, 0.10671164996554734, -0.09952709986172406, -0.13176731719359966, -0.09835699438051858, -0.03043788836606529, -0.03333748736858211, 0.043689843941099524, 0.09278017942282096, -0.035746835142662615, -0.139246259579881, 0.3407618021354748, -0.1181156544234525, -0.2550364361131485, 0.09871863888602861, -0.18152935360230402, -0.13993633262367106, 0.13760441801392695, 0.026325825391940668, 0.18837759163702877, 0.06484432900193292, 0.20072627794177889, -0.18749108520979194, 0.07202314146020462, 0.1595585538126843, 0.009035022245575739, 0.09676767644328131, 0.060742572074572385, 0.12072364215962064, 0.11872363027388519, -0.009351743076941078, -0.0717902859135098, -0.4007304084133094, -0.21825647507597443, -0.1655952670040842, 0.1721408126324835, -0.10651878839539869, -0.18595510174218619, 0.36020904180991814, 0.022366562241714606, 0.19306911833085855, 0.13817276325876968, 0.2846428881543623, 0.10114148022233128, 0.02933164456741176, 0.019440314811195285, 0.14946703170631145, 0.19976879508254236, -0.0755455613818387, -0.11533943234785447, -0.01260449153594148, 0.24814068287296195] |
1,802.07235 | A note on a weakly singular elliptic equation from theory of elasticity | Qualitative properties of a second order elliptic equation from the
anisotropic elasticity are investigated. Some explicit solutions for a disk are
presented. Behaviour of these solutions in dependence of coefficients is
investigated. The problem of presence of singularities of solutions at the
origin of coordinates is discussed.
| cond-mat.soft | qualitative properties of a second order elliptic equation from the anisotropic elasticity are investigated some explicit solutions for a disk are presented behaviour of these solutions in dependence of coefficients is investigated the problem of presence of singularities of solutions at the origin of coordinates is discussed | [['qualitative', 'properties', 'of', 'a', 'second', 'order', 'elliptic', 'equation', 'from', 'the', 'anisotropic', 'elasticity', 'are', 'investigated', 'some', 'explicit', 'solutions', 'for', 'a', 'disk', 'are', 'presented', 'behaviour', 'of', 'these', 'solutions', 'in', 'dependence', 'of', 'coefficients', 'is', 'investigated', 'the', 'problem', 'of', 'presence', 'of', 'singularities', 'of', 'solutions', 'at', 'the', 'origin', 'of', 'coordinates', 'is', 'discussed']] | [-0.21044268764238408, 0.019897847475999212, -0.09593359641532631, 0.07457548828220907, -0.0873527134511065, -0.07925212898469985, -0.07104218216176997, 0.31786553313995297, -0.2694403493499502, -0.2240260219637384, 0.16005015148077795, -0.36613477813079953, -0.1379919291097433, 0.1821467090556596, 0.010657260234051563, 0.09862299910449285, 0.004435615519933561, 0.02752289358288684, -0.10023873497514015, -0.21877757812592577, 0.3746973473895737, -0.00803508831465498, 0.20921764443529414, 0.0673360925643368, 0.111654746019222, -0.08245864813711415, -0.015556429156122055, 0.05645537955012727, -0.19225005971446157, 0.10800156316056134, 0.2566770296940144, -0.0059468112885952, 0.21768703668358477, -0.41004353389143944, -0.22038641461032502, 0.039586795969529354, 0.13480234570167166, 0.09077183109648684, -0.08363078061015682, -0.20604431446879468, 0.11602997312203367, -0.09050498823536203, -0.2623791852941182, -0.04948194647465456, 0.033247175210333886, 0.11817095599117432, -0.23397717002699983, 0.14299380874380152, 0.07011668853699526, 0.08766720170511845, -0.15768764848682157, -0.09617514702233862, -0.01384684786279785, 0.07170244269667471, 0.11878079139290655, -0.07400561786910638, 0.03406902468030123, -0.18292423664651652, -0.07198560693638122, 0.40723398411052025, -0.030071934856018646, -0.2594740977312656, 0.13655187780077152, -0.15077840007762325, -0.10340192712387665, 0.15754082885154702, 0.16805196150225846, 0.18751585945249238, -0.14900611339018066, 0.13297413881035877, -0.013104282161022754, 0.1370771628745059, 0.09100400508341795, 0.03911743271461827, 0.16331332858572614, 0.11674852653386746, -0.005630681628083929, 0.15083351867035666, 0.007224644633366707, -0.14974421334076435, -0.3718475105359833, -0.12507847343829084, -0.13340761429293357, 0.03938946512309795, -0.1285517368406216, -0.17537391780221717, 0.4179981346935668, 0.08762517276200209, 0.1957434906644073, -0.017536099078728162, 0.20195783182800292, 0.16763275701235583, -0.028458129495699355, 0.046140655974282865, 0.25979290779078124, 0.15318435656421997, 0.11916827784970085, -0.2488166577525764, 0.09594801090102881, 0.12845437788959355] |
1,802.07236 | The Fourier transform on negatively curved harmonic manifolds | Let $X$ be a complete, simply connected harmonic manifold with sectional
curvatures $K$ satisfying $K \leq -1$, and let $\partial X$ denote the boundary
at infinity of $X$. Let $h > 0$ denote the mean curvature of horospheres in
$X$, and let $\rho = h/2$. Fixing a basepoint $o \in X$, for $\xi \in \partial
X$, let $B_{\xi}$ denote the Busemann function at $\xi$ such that $B_{\xi}(o) =
0$, then for $\lambda \in \mathbb{C}$ the function $e^{(i\lambda -
\rho)B_{\xi}}$ is an eigenfunction of the Laplace-Beltrami operator with
eigenvalue $-(\lambda^2 + \rho^2)$.
For a function $f$ on $X$, we define the Fourier transform of $f$ by
$$\tilde{f}(\lambda, \xi) := \int_X f(x) e^{(-i\lambda - \rho)B_{\xi}(x)}
dvol(x)$$ for all $\lambda \in \mathbb{C}, \xi \in \partial X$ for which the
integral converges. We prove a Fourier inversion formula $$f(x) = C_0
\int_{0}^{\infty} \int_{\partial X} \tilde{f}(\lambda, \xi) e^{(i\lambda -
\rho)B_{\xi}(x)} d\lambda_o(\xi) |c(\lambda)|^{-2} d\lambda$$ for $f \in
C^{\infty}_c(X)$, where $c$ is a certain function on $\mathbb{R} - \{0\}$,
$\lambda_o$ is the visibility measure on $\partial X$ with respect to the
basepoint $o \in X$ and $C_0 > 0$ is a constant. We also prove a Plancherel
theorem. This generalizes the corresponding results for rank one symmetric
spaces of noncompact type and negatively curved harmonic $NA$ groups (or
Damek-Ricci spaces).
| math.DG | let x be a complete simply connected harmonic manifold with sectional curvatures k satisfying k leq 1 and let partial x denote the boundary at infinity of x let h 0 denote the mean curvature of horospheres in x and let rho h2 fixing a basepoint o in x for xi in partial x let b_xi denote the busemann function at xi such that b_xio 0 then for lambda in mathbbc the function eilambda rhob_xi is an eigenfunction of the laplacebeltrami operator with eigenvalue lambda2 rho2 for a function f on x we define the fourier transform of f by tildeflambda xi int_x fx eilambda rhob_xix dvolx for all lambda in mathbbc xi in partial x for which the integral converges we prove a fourier inversion formula fx c_0 int_0infty int_partial x tildeflambda xi eilambda rhob_xix dlambda_oxi clambda2 dlambda for f in cinfty_cx where c is a certain function on mathbbr 0 lambda_o is the visibility measure on partial x with respect to the basepoint o in x and c_0 0 is a constant we also prove a plancherel theorem this generalizes the corresponding results for rank one symmetric spaces of noncompact type and negatively curved harmonic na groups or damekricci spaces | [['let', 'x', 'be', 'a', 'complete', 'simply', 'connected', 'harmonic', 'manifold', 'with', 'sectional', 'curvatures', 'k', 'satisfying', 'k', 'leq', '1', 'and', 'let', 'partial', 'x', 'denote', 'the', 'boundary', 'at', 'infinity', 'of', 'x', 'let', 'h', '0', 'denote', 'the', 'mean', 'curvature', 'of', 'horospheres', 'in', 'x', 'and', 'let', 'rho', 'h2', 'fixing', 'a', 'basepoint', 'o', 'in', 'x', 'for', 'xi', 'in', 'partial', 'x', 'let', 'b_xi', 'denote', 'the', 'busemann', 'function', 'at', 'xi', 'such', 'that', 'b_xio', '0', 'then', 'for', 'lambda', 'in', 'mathbbc', 'the', 'function', 'eilambda', 'rhob_xi', 'is', 'an', 'eigenfunction', 'of', 'the', 'laplacebeltrami', 'operator', 'with', 'eigenvalue', 'lambda2', 'rho2', 'for', 'a', 'function', 'f', 'on', 'x', 'we', 'define', 'the', 'fourier', 'transform', 'of', 'f', 'by', 'tildeflambda', 'xi', 'int_x', 'fx', 'eilambda', 'rhob_xix', 'dvolx', 'for', 'all', 'lambda', 'in', 'mathbbc', 'xi', 'in', 'partial', 'x', 'for', 'which', 'the', 'integral', 'converges', 'we', 'prove', 'a', 'fourier', 'inversion', 'formula', 'fx', 'c_0', 'int_0infty', 'int_partial', 'x', 'tildeflambda', 'xi', 'eilambda', 'rhob_xix', 'dlambda_oxi', 'clambda2', 'dlambda', 'for', 'f', 'in', 'cinfty_cx', 'where', 'c', 'is', 'a', 'certain', 'function', 'on', 'mathbbr', '0', 'lambda_o', 'is', 'the', 'visibility', 'measure', 'on', 'partial', 'x', 'with', 'respect', 'to', 'the', 'basepoint', 'o', 'in', 'x', 'and', 'c_0', '0', 'is', 'a', 'constant', 'we', 'also', 'prove', 'a', 'plancherel', 'theorem', 'this', 'generalizes', 'the', 'corresponding', 'results', 'for', 'rank', 'one', 'symmetric', 'spaces', 'of', 'noncompact', 'type', 'and', 'negatively', 'curved', 'harmonic', 'na', 'groups', 'or', 'damekricci', 'spaces']] | [-0.20203629586941158, 0.11432570243166246, -0.04308765493810941, -0.00593861043990518, -0.050936601673945404, -0.19617420604739053, 0.0026535624184478553, 0.3673050205772504, -0.3116078732347187, -0.08899357196522685, 0.036041639566134945, -0.35030161052560194, -0.05336865376537809, 0.1382051374345349, -0.08063333296002104, -0.03281287009684512, -0.02865427016423872, 0.1502670716878828, -0.12471140323517223, -0.21859748495790438, 0.35916856098442507, -0.1331182291253637, 0.12569691859758816, 0.06634087412773321, 0.11755549420228747, -0.0005222244367290001, 0.047533716950028275, -0.053755269223489825, -0.2547143094064384, 0.06052669315324284, 0.252898115841433, 0.0770264218441951, 0.2869110925170856, -0.28269663176093346, -0.145186876744414, 0.23510646092203946, 0.1538873901280264, -0.20309824674951438, 0.07225293806121232, -0.30084037569184335, 0.14772965408718355, -0.03474298054591203, -0.17897355497981876, -0.03579996356215232, 0.16614489793264045, 0.04273679249991591, -0.3775750081699628, 0.048848429017622645, 0.08572020534163294, 0.06321648296016531, -0.03509864831247773, -0.20661905197044594, -0.1120362839088417, -0.005234940225879351, -0.030956799399633056, 0.21102178996333326, 0.05285038250283553, -0.014649985430953213, 0.0006558469801138226, 0.32913218995508475, -0.16386856147780632, -0.28773659290984654, -0.0021259414294782356, -0.2553197293351285, -0.1390396815784371, 0.12240174365206025, 0.09701028456195043, 0.2260990291095088, 0.017171877577232243, 0.32020658387993584, -0.07659484924545559, 0.14491861414534446, 0.11800698379580027, -0.019867933720636825, 0.0734099709142286, 0.02976524331487524, 0.12783981036776915, 0.08673742398386822, -0.015560833159356545, 0.06893535896192472, -0.41238503717841246, -0.21805741698600542, -0.16550451821665493, 0.2521468269471557, -0.16379183762742636, -0.16359418423918004, 0.268802286283328, -0.0012810046832339886, 0.22825512582412325, 0.13525550126229438, 0.15530900917947293, 0.11211857590585565, -0.03795200313131015, 0.06806149288343313, -0.006507582698638241, 0.2236728348948348, 0.020692841190462694, -0.15551400447550875, -0.010548630301864483, 0.1888946069046282] |
1,802.07237 | Interpreting top-quark LHC measurements in the standard-model effective
field theory | This note proposes common standards and prescriptions for the
effective-field-theory interpretation of top-quark measurements at the LHC.
| hep-ph hep-ex | this note proposes common standards and prescriptions for the effectivefieldtheory interpretation of topquark measurements at the lhc | [['this', 'note', 'proposes', 'common', 'standards', 'and', 'prescriptions', 'for', 'the', 'effectivefieldtheory', 'interpretation', 'of', 'topquark', 'measurements', 'at', 'the', 'lhc']] | [-0.08919213799869313, 0.09053515752791153, -0.13336320629562526, 0.09860516927780255, -0.08160603177898071, -0.14701994420850978, 0.09104047124000157, 0.2916734080542536, -0.16403534131891587, -0.26959300731473107, 0.012260520228129975, -0.27466195602627363, 0.0037383800920318157, 0.15124400773578706, -0.06777694876141407, 0.14025595302090926, 0.16293784581563053, -0.09098947848028996, -0.10070641108733766, -0.20944191351094665, 0.31985196164425683, 0.12041595490539775, 0.26731769537881894, 0.1525350775131408, 0.1241644728819237, 0.07001078786218867, -0.20649842994616313, -0.1205653701634968, -0.2394017893821001, 0.1418169624555637, 0.34185557352269397, 0.16057766152217107, 0.15636409008327654, -0.3326573257937151, -0.07846295543234139, 0.08271982887869372, 0.12495509578901179, 0.14510995303006732, -0.04141475397216923, -0.212434289538685, 0.09008011682068601, -0.2555072075303863, -0.1107266173862359, -0.01736943653839476, -0.01985461955123088, -0.09762584352317978, -0.3346503430648762, 0.08334248628029052, -0.053319305482813543, 0.14263565443894444, -0.015621490776538849, -0.20380903265493758, 0.05934354364324142, -0.015562325168181868, 0.08432091797893758, 0.03223935884478338, 0.1351468545549056, -0.12445375190445167, -0.21888349128558354, 0.3681314355310272, -0.026019052328432307, -0.12425227638553171, 0.2083820093642263, -0.17916089252513998, -0.24833415974588954, -0.054002176970243454, 0.18051554615992835, 0.0335809897412272, -0.2949818715124446, 0.10965852293884382, 0.03328509979388293, 0.0873446906095042, 0.0528609555981615, 0.11374885939499911, 0.32284025782171416, 0.1878499053966473, -0.01114581125404905, -0.004969564567813102, -0.08365611534784823, 0.0028007859911988765, -0.5214430420549915, -0.1067123431712389, -0.029997741474824792, 0.031001477118800667, -0.029515840331441723, -0.10174520215129151, 0.42198348757536974, 0.25231721800039797, 0.1967725817607168, 0.05466648476088748, 0.44585033045972094, 0.09534516886068399, 0.07545287342851653, 0.005197574055808432, 0.2923483769683277, 0.1065650818979039, 0.25337364297250614, -0.1891575394307866, 0.08857092713279759, 0.11453412549898905] |
1,802.07238 | Quadratic conservative scheme for relativistic Vlasov--Maxwell system | For more than half a century, most of the plasma scientists have encountered
a violation of the conservation laws of charge, momentum, and energy whenever
they have numerically solve the first-principle equations of kinetic plasmas,
such as the relativistic Vlasov--Maxwell system. This fatal problem is brought
by the fact that both the Vlasov and Maxwell equations are indirectly
associated with the conservation laws by means of some mathematical
manipulations. Here we propose a quadratic conservative scheme, which can
strictly maintain the conservation laws by discretizing the relativistic
Vlasov--Maxwell system. A discrete product rule and summation-by-parts are the
key players in the construction of the quadratic conservative scheme. Numerical
experiments of the relativistic two-stream instability and relativistic Weibel
instability prove the validity of our computational theory, and the proposed
strategy will open the doors to the first-principle studies of mesoscopic and
macroscopic plasma physics.
| physics.plasm-ph physics.comp-ph | for more than half a century most of the plasma scientists have encountered a violation of the conservation laws of charge momentum and energy whenever they have numerically solve the firstprinciple equations of kinetic plasmas such as the relativistic vlasovmaxwell system this fatal problem is brought by the fact that both the vlasov and maxwell equations are indirectly associated with the conservation laws by means of some mathematical manipulations here we propose a quadratic conservative scheme which can strictly maintain the conservation laws by discretizing the relativistic vlasovmaxwell system a discrete product rule and summationbyparts are the key players in the construction of the quadratic conservative scheme numerical experiments of the relativistic twostream instability and relativistic weibel instability prove the validity of our computational theory and the proposed strategy will open the doors to the firstprinciple studies of mesoscopic and macroscopic plasma physics | [['for', 'more', 'than', 'half', 'a', 'century', 'most', 'of', 'the', 'plasma', 'scientists', 'have', 'encountered', 'a', 'violation', 'of', 'the', 'conservation', 'laws', 'of', 'charge', 'momentum', 'and', 'energy', 'whenever', 'they', 'have', 'numerically', 'solve', 'the', 'firstprinciple', 'equations', 'of', 'kinetic', 'plasmas', 'such', 'as', 'the', 'relativistic', 'vlasovmaxwell', 'system', 'this', 'fatal', 'problem', 'is', 'brought', 'by', 'the', 'fact', 'that', 'both', 'the', 'vlasov', 'and', 'maxwell', 'equations', 'are', 'indirectly', 'associated', 'with', 'the', 'conservation', 'laws', 'by', 'means', 'of', 'some', 'mathematical', 'manipulations', 'here', 'we', 'propose', 'a', 'quadratic', 'conservative', 'scheme', 'which', 'can', 'strictly', 'maintain', 'the', 'conservation', 'laws', 'by', 'discretizing', 'the', 'relativistic', 'vlasovmaxwell', 'system', 'a', 'discrete', 'product', 'rule', 'and', 'summationbyparts', 'are', 'the', 'key', 'players', 'in', 'the', 'construction', 'of', 'the', 'quadratic', 'conservative', 'scheme', 'numerical', 'experiments', 'of', 'the', 'relativistic', 'twostream', 'instability', 'and', 'relativistic', 'weibel', 'instability', 'prove', 'the', 'validity', 'of', 'our', 'computational', 'theory', 'and', 'the', 'proposed', 'strategy', 'will', 'open', 'the', 'doors', 'to', 'the', 'firstprinciple', 'studies', 'of', 'mesoscopic', 'and', 'macroscopic', 'plasma', 'physics']] | [-0.15386691481022366, 0.14165873322766143, -0.10775373555342113, 0.08626050081989774, -0.07437245149191443, -0.1421801388504674, -0.005830673394249296, 0.23627834271808917, -0.27399135165492894, -0.2978412455364645, 0.05529840879217181, -0.2383320334699604, -0.11094641986374672, 0.2017555380129366, -0.019831850740511518, 0.11657682181436933, 0.06114804302993511, -0.04223811700353985, -0.05347582675969241, -0.21316938457841222, 0.3341739548848929, 0.09017797203252574, 0.2626517631758291, 0.05105455181971713, 0.1419411277678515, -0.054573465801345616, -0.02678617307675312, 0.04397677420719911, -0.11619778302864707, 0.08381437182253865, 0.2198181978778562, 0.08715527924266156, 0.34174838376563643, -0.4913067107929008, -0.24670368184679892, 0.01549329862513065, 0.1277736975392978, 0.1354982836157331, -0.06178242247276923, -0.25543311397525503, 0.04626645286033464, -0.21103679903594036, -0.17657367368326424, -0.09587247596428423, -0.0048655263242683, 0.05716359105377972, -0.23994014080014678, 0.0997828156247709, 0.08638981004877315, 0.0455774831995889, -0.08623018428777715, -0.08106708480533656, -0.04314687527826876, 0.03339556343788346, 0.06052807998726262, -0.02449317609441916, 0.10725895142820957, -0.1275010547043847, -0.1373141131923905, 0.46394904693783995, 0.02164847034278368, -0.26035101752129053, 0.1814725255150791, -0.15290641783772466, -0.1028209710949576, 0.13695984622919477, 0.13843667747166294, 0.12905382350334652, -0.17381844773784383, 0.08617568517289405, -0.0739822350751765, 0.09166617468048303, 0.047949458203779965, 0.005376500836280468, 0.19177361926181125, 0.1349126899849389, 0.031253946505460914, 0.054699422565689375, -0.017829630168568394, -0.1669250996620557, -0.33680027103136206, -0.16002585025934887, -0.15640164721574817, 0.05269823720152783, -0.05422183398301453, -0.13327631303532558, 0.36863563440827013, 0.16079971302053206, 0.03918002181119852, 0.018208034016628315, 0.30895019415766, 0.20547563255881773, 0.02687517018423748, 0.11287257951111175, 0.2675038212643679, 0.176757542649284, 0.1481565795252686, -0.28821708062351065, 0.0028896780775768773, 0.138286381775116] |
1,802.07239 | Continual Reinforcement Learning with Complex Synapses | Unlike humans, who are capable of continual learning over their lifetimes,
artificial neural networks have long been known to suffer from a phenomenon
known as catastrophic forgetting, whereby new learning can lead to abrupt
erasure of previously acquired knowledge. Whereas in a neural network the
parameters are typically modelled as scalar values, an individual synapse in
the brain comprises a complex network of interacting biochemical components
that evolve at different timescales. In this paper, we show that by equipping
tabular and deep reinforcement learning agents with a synaptic model that
incorporates this biological complexity (Benna & Fusi, 2016), catastrophic
forgetting can be mitigated at multiple timescales. In particular, we find that
as well as enabling continual learning across sequential training of two simple
tasks, it can also be used to overcome within-task forgetting by reducing the
need for an experience replay database.
| cs.AI cs.LG cs.NE | unlike humans who are capable of continual learning over their lifetimes artificial neural networks have long been known to suffer from a phenomenon known as catastrophic forgetting whereby new learning can lead to abrupt erasure of previously acquired knowledge whereas in a neural network the parameters are typically modelled as scalar values an individual synapse in the brain comprises a complex network of interacting biochemical components that evolve at different timescales in this paper we show that by equipping tabular and deep reinforcement learning agents with a synaptic model that incorporates this biological complexity benna fusi 2016 catastrophic forgetting can be mitigated at multiple timescales in particular we find that as well as enabling continual learning across sequential training of two simple tasks it can also be used to overcome withintask forgetting by reducing the need for an experience replay database | [['unlike', 'humans', 'who', 'are', 'capable', 'of', 'continual', 'learning', 'over', 'their', 'lifetimes', 'artificial', 'neural', 'networks', 'have', 'long', 'been', 'known', 'to', 'suffer', 'from', 'a', 'phenomenon', 'known', 'as', 'catastrophic', 'forgetting', 'whereby', 'new', 'learning', 'can', 'lead', 'to', 'abrupt', 'erasure', 'of', 'previously', 'acquired', 'knowledge', 'whereas', 'in', 'a', 'neural', 'network', 'the', 'parameters', 'are', 'typically', 'modelled', 'as', 'scalar', 'values', 'an', 'individual', 'synapse', 'in', 'the', 'brain', 'comprises', 'a', 'complex', 'network', 'of', 'interacting', 'biochemical', 'components', 'that', 'evolve', 'at', 'different', 'timescales', 'in', 'this', 'paper', 'we', 'show', 'that', 'by', 'equipping', 'tabular', 'and', 'deep', 'reinforcement', 'learning', 'agents', 'with', 'a', 'synaptic', 'model', 'that', 'incorporates', 'this', 'biological', 'complexity', 'benna', 'fusi', '2016', 'catastrophic', 'forgetting', 'can', 'be', 'mitigated', 'at', 'multiple', 'timescales', 'in', 'particular', 'we', 'find', 'that', 'as', 'well', 'as', 'enabling', 'continual', 'learning', 'across', 'sequential', 'training', 'of', 'two', 'simple', 'tasks', 'it', 'can', 'also', 'be', 'used', 'to', 'overcome', 'withintask', 'forgetting', 'by', 'reducing', 'the', 'need', 'for', 'an', 'experience', 'replay', 'database']] | [-0.05840607266203105, 0.13819494413353484, -0.04617265108537277, 0.06260971815271718, -0.11836235975618843, -0.1849561455398262, 0.03553161014745802, 0.45264343929430134, -0.3028662384172781, -0.3523726976282305, 0.047354311637057785, -0.19842069183322167, -0.24421227573778936, 0.21057869118584735, -0.15350991526028987, 0.057030907332191155, 0.10109033934410205, 0.04226228813540271, -0.01734875336209004, -0.2797170323286232, 0.31460840795725153, 0.044518047033326714, 0.25669312212455403, -0.030903398293395452, 0.12297632784596074, -0.03912295329404606, 0.006096645601750385, -0.005421778356334824, -0.016502405826057637, 0.09114051749092265, 0.3540851938866561, 0.1854196693262474, 0.3762405858569437, -0.4864367443880589, -0.30573825871826504, 0.15148208622499068, 0.1944935182511485, 0.13684759042544037, -0.013380989703691478, -0.29467338632470624, 0.07838935957946848, -0.2143472491884135, -0.011250575977585298, -0.1268252100688305, -0.009771646134448137, 0.038445271893840775, -0.27013479435159793, 0.037302021031634776, 0.09319523554010545, 0.07993366727278829, -0.059316109373441915, -0.08659885072638449, 0.015011019848970523, 0.17952403787183474, 0.03045119960179298, 0.03702723442596926, 0.17946268092144094, -0.16121660805937144, -0.16822377615901407, 0.29052774405287807, -0.033093862356149036, -0.13738145748278538, 0.23256025438468314, 0.007916993796557402, -0.1387855718146822, 0.13570413135809542, 0.23713864939850118, 0.0751246453075261, -0.1948336451280889, -0.016112524751831756, 0.0037869920337693297, 0.15893632425464316, 0.07740397405937957, 0.009690964842389384, 0.19368484644420284, 0.2492875371433178, -0.00659849664591891, 0.10485616522479346, -0.07040021611836558, -0.13355634557820267, -0.19306985183037723, -0.07996490821175331, -0.1718878269617667, 0.0655574180749446, -0.0802822087273938, -0.1442178795583171, 0.3364862976796764, 0.1773949042264131, 0.2647626250756939, 0.11904602815717855, 0.31047758701250705, 0.05644995150685632, 0.1795640055596051, 0.0877831731202657, 0.22149697311302954, 0.018465840245978974, 0.1610202864817471, -0.1876720461522048, 0.16776332909093916, -0.03208902817916313] |
1,802.0724 | Cobalt: BFT Governance in Open Networks | We present Cobalt, a novel atomic broadcast algorithm that works in networks
with non-uniform trust and no global agreement on participants, and is
probabilistically guaranteed to make forward progress even in the presence of
maximal faults and arbitrary asynchrony. The exact properties that Cobalt
satisfies makes it particularly applicable to designing an efficient
decentralized "voting network" that allows a public, open-entry group of nodes
to agree on changes to some shared set of rules in a fair and consistent manner
while tolerating some trusted nodes and arbitrarily many untrusted nodes
behaving maliciously. We also define a new set of properties which must be
satisfied by any safe decentralized governance algorithm, and all of which
Cobalt satisfies.
| cs.DC | we present cobalt a novel atomic broadcast algorithm that works in networks with nonuniform trust and no global agreement on participants and is probabilistically guaranteed to make forward progress even in the presence of maximal faults and arbitrary asynchrony the exact properties that cobalt satisfies makes it particularly applicable to designing an efficient decentralized voting network that allows a public openentry group of nodes to agree on changes to some shared set of rules in a fair and consistent manner while tolerating some trusted nodes and arbitrarily many untrusted nodes behaving maliciously we also define a new set of properties which must be satisfied by any safe decentralized governance algorithm and all of which cobalt satisfies | [['we', 'present', 'cobalt', 'a', 'novel', 'atomic', 'broadcast', 'algorithm', 'that', 'works', 'in', 'networks', 'with', 'nonuniform', 'trust', 'and', 'no', 'global', 'agreement', 'on', 'participants', 'and', 'is', 'probabilistically', 'guaranteed', 'to', 'make', 'forward', 'progress', 'even', 'in', 'the', 'presence', 'of', 'maximal', 'faults', 'and', 'arbitrary', 'asynchrony', 'the', 'exact', 'properties', 'that', 'cobalt', 'satisfies', 'makes', 'it', 'particularly', 'applicable', 'to', 'designing', 'an', 'efficient', 'decentralized', 'voting', 'network', 'that', 'allows', 'a', 'public', 'openentry', 'group', 'of', 'nodes', 'to', 'agree', 'on', 'changes', 'to', 'some', 'shared', 'set', 'of', 'rules', 'in', 'a', 'fair', 'and', 'consistent', 'manner', 'while', 'tolerating', 'some', 'trusted', 'nodes', 'and', 'arbitrarily', 'many', 'untrusted', 'nodes', 'behaving', 'maliciously', 'we', 'also', 'define', 'a', 'new', 'set', 'of', 'properties', 'which', 'must', 'be', 'satisfied', 'by', 'any', 'safe', 'decentralized', 'governance', 'algorithm', 'and', 'all', 'of', 'which', 'cobalt', 'satisfies']] | [-0.21950203687681452, 0.06809959016935191, -0.04753562599501532, 0.05674957603560356, -0.12391296542128143, -0.24974572341079299, 0.15042495363918335, 0.42957588892187115, -0.24371094424024467, -0.2827906117005193, 0.07867630360668282, -0.2615569507522235, -0.12961715137909935, 0.15073117179715115, -0.11545734878113169, 0.06652655876849009, 0.06728936459707177, 0.04372483348959814, -0.007314537493916957, -0.28636639298790173, 0.2811318754542457, 0.04589856367598733, 0.2916345139641477, 0.028747544138003952, 0.11072597007024224, 0.024294950764464297, 0.015190347335453186, 0.07084058679275862, -0.06240480862774269, 0.1392579668602, 0.3151568630143352, 0.13825221758983705, 0.29938792170065903, -0.46271896393078826, -0.13532286241002706, 0.145543109945467, 0.14305144034164108, 0.11085411323558376, -0.05008565710817018, -0.28383876158977334, 0.151536885333126, -0.19815616070738304, -0.10600037880484825, -0.12713520916624238, -0.02547182781500337, 0.03657400687377009, -0.32431859462926893, 0.005169927302251934, 0.031136304579432245, 0.03384841904853997, -0.027739801845493038, -0.049778694772849914, -0.02475178383047814, 0.1471750848521681, -0.0042876947043544575, 0.014260404619752714, 0.13654821525307614, -0.10083970027753031, -0.13997538782980132, 0.3623594000125709, 0.029902913550967757, -0.1656155087215745, 0.17691548483992886, -0.03606959094657846, -0.19714394545121847, 0.09279857627723528, 0.1654275227985952, 0.08813267918101148, -0.19911269024824318, 0.04196184907974068, -0.08740887212688508, 0.21422124130084463, 0.06209188632505096, 0.08325074625893689, 0.1397582849001755, 0.12809235464943491, 0.15591948947454196, 0.11613544232475206, 0.020364453367706713, -0.10368496519310967, -0.27030591023276035, -0.13193638614561085, -0.18528262996418482, 0.008680899587014446, -0.10898366055334918, -0.16264307553191548, 0.3457997727005378, 0.18038809870815148, 0.17401921110981872, 0.08479284060633054, 0.31703636361002596, 0.009973296565864154, 0.0656365182655661, 0.17457447873590434, 0.17872397673933807, 0.06348844005564308, 0.10049050161007629, -0.17196558517322916, 0.2008457392697101, 0.0020221498592392258] |
1,802.07241 | Influence of crystalline structure on RF dissipation in Niobium: flux
trapping, hydride precipitate, doping behavior... | Bulk niobium is the material mostly used in RF superconducting cavities for
accelerator. Predicting and reducing the surface dissipation in RF is
mandatory, since it has a tremendous cost impact on most of the large
accelerator projects. The theoretical approach of superconducting
radiofrequency (SRF) behavior has been far less explored than DC behavior and
is still based on the description of relatively simple systems, quite remote
from the realistic material in use. Nevertheless, because the actual
crystalline substructure is not taken into account, it is still difficult to
predict surface dissipation accurately. Moreover, Niobium with its large lambda
(~40 nm), exhibit an original behavior compared to the usual superconductors
used in applied superconductivity, and generalities (e.g. pinning at grain
boundaries) needs to be reconsidered. In this paper we hope to demonstrate that
sources of dissipation usually attributed to external causes (mainly flux
trapping during cooldown and hydrides precipitates) are related to the same
type of crystalline defects which are not grain boundaries; that they affect
the local superconducting properties and can also be at the source of early
vortex penetration at the surface. We want also to stretch out how those
defects can explain some of the discrepancies observed from lab to lab on
recent results obtained i.e. in doping experiments. Understanding the origin
and the role of these defects could provide indications for updating
specification as well as fabrication follow up. Rather than new results the
author wishes to present to the superconducting accelerators community the
synthesis of multiple experimental results scattered in the literature that
provide a new lighting on recently published work, in particular in the domain
of SRF cavity doping as well as issues such as sensitivity to trapped flux
during cooldown.
| physics.acc-ph | bulk niobium is the material mostly used in rf superconducting cavities for accelerator predicting and reducing the surface dissipation in rf is mandatory since it has a tremendous cost impact on most of the large accelerator projects the theoretical approach of superconducting radiofrequency srf behavior has been far less explored than dc behavior and is still based on the description of relatively simple systems quite remote from the realistic material in use nevertheless because the actual crystalline substructure is not taken into account it is still difficult to predict surface dissipation accurately moreover niobium with its large lambda 40 nm exhibit an original behavior compared to the usual superconductors used in applied superconductivity and generalities eg pinning at grain boundaries needs to be reconsidered in this paper we hope to demonstrate that sources of dissipation usually attributed to external causes mainly flux trapping during cooldown and hydrides precipitates are related to the same type of crystalline defects which are not grain boundaries that they affect the local superconducting properties and can also be at the source of early vortex penetration at the surface we want also to stretch out how those defects can explain some of the discrepancies observed from lab to lab on recent results obtained ie in doping experiments understanding the origin and the role of these defects could provide indications for updating specification as well as fabrication follow up rather than new results the author wishes to present to the superconducting accelerators community the synthesis of multiple experimental results scattered in the literature that provide a new lighting on recently published work in particular in the domain of srf cavity doping as well as issues such as sensitivity to trapped flux during cooldown | [['bulk', 'niobium', 'is', 'the', 'material', 'mostly', 'used', 'in', 'rf', 'superconducting', 'cavities', 'for', 'accelerator', 'predicting', 'and', 'reducing', 'the', 'surface', 'dissipation', 'in', 'rf', 'is', 'mandatory', 'since', 'it', 'has', 'a', 'tremendous', 'cost', 'impact', 'on', 'most', 'of', 'the', 'large', 'accelerator', 'projects', 'the', 'theoretical', 'approach', 'of', 'superconducting', 'radiofrequency', 'srf', 'behavior', 'has', 'been', 'far', 'less', 'explored', 'than', 'dc', 'behavior', 'and', 'is', 'still', 'based', 'on', 'the', 'description', 'of', 'relatively', 'simple', 'systems', 'quite', 'remote', 'from', 'the', 'realistic', 'material', 'in', 'use', 'nevertheless', 'because', 'the', 'actual', 'crystalline', 'substructure', 'is', 'not', 'taken', 'into', 'account', 'it', 'is', 'still', 'difficult', 'to', 'predict', 'surface', 'dissipation', 'accurately', 'moreover', 'niobium', 'with', 'its', 'large', 'lambda', '40', 'nm', 'exhibit', 'an', 'original', 'behavior', 'compared', 'to', 'the', 'usual', 'superconductors', 'used', 'in', 'applied', 'superconductivity', 'and', 'generalities', 'eg', 'pinning', 'at', 'grain', 'boundaries', 'needs', 'to', 'be', 'reconsidered', 'in', 'this', 'paper', 'we', 'hope', 'to', 'demonstrate', 'that', 'sources', 'of', 'dissipation', 'usually', 'attributed', 'to', 'external', 'causes', 'mainly', 'flux', 'trapping', 'during', 'cooldown', 'and', 'hydrides', 'precipitates', 'are', 'related', 'to', 'the', 'same', 'type', 'of', 'crystalline', 'defects', 'which', 'are', 'not', 'grain', 'boundaries', 'that', 'they', 'affect', 'the', 'local', 'superconducting', 'properties', 'and', 'can', 'also', 'be', 'at', 'the', 'source', 'of', 'early', 'vortex', 'penetration', 'at', 'the', 'surface', 'we', 'want', 'also', 'to', 'stretch', 'out', 'how', 'those', 'defects', 'can', 'explain', 'some', 'of', 'the', 'discrepancies', 'observed', 'from', 'lab', 'to', 'lab', 'on', 'recent', 'results', 'obtained', 'ie', 'in', 'doping', 'experiments', 'understanding', 'the', 'origin', 'and', 'the', 'role', 'of', 'these', 'defects', 'could', 'provide', 'indications', 'for', 'updating', 'specification', 'as', 'well', 'as', 'fabrication', 'follow', 'up', 'rather', 'than', 'new', 'results', 'the', 'author', 'wishes', 'to', 'present', 'to', 'the', 'superconducting', 'accelerators', 'community', 'the', 'synthesis', 'of', 'multiple', 'experimental', 'results', 'scattered', 'in', 'the', 'literature', 'that', 'provide', 'a', 'new', 'lighting', 'on', 'recently', 'published', 'work', 'in', 'particular', 'in', 'the', 'domain', 'of', 'srf', 'cavity', 'doping', 'as', 'well', 'as', 'issues', 'such', 'as', 'sensitivity', 'to', 'trapped', 'flux', 'during', 'cooldown']] | [-0.07335195811367691, 0.140894987697396, -0.05362292160312612, 0.0376822869496915, -0.08406662324303435, -0.1416672514657933, 0.057174754045721324, 0.41022792811525033, -0.22642517264914483, -0.33944219252798, 0.08216430017866286, -0.27543844671102186, -0.08728965075028787, 0.2434428618452349, -0.07439986115705768, 0.05009971559556507, 0.01631874412907144, -0.013315301862100816, -0.06208178311056405, -0.24682709401623196, 0.28449507701003895, 0.10371994702601349, 0.3330186873737892, 0.09830902832140169, 0.02207284645011349, -0.0802817435388069, 0.0300293513948189, 0.020605124367101418, -0.10658771989716383, 0.07435308567918283, 0.28414708534760363, 0.0357364290123203, 0.23067833011859207, -0.5059064281062333, -0.24325539300973703, 0.06590537734450186, 0.16158496910946116, 0.12907320651969828, -0.06194235905483886, -0.24203592872856042, 0.07378348308758667, -0.13051780189836878, -0.12943001397742102, -0.05874277108879695, 0.00012474902091430618, 0.008756315878631508, -0.18785321558793108, 0.029317857909880878, 0.05213563478148015, 0.08057445690273535, -0.0795105972284145, -0.12146639275906763, -0.018334069803366892, 0.09580971465008073, 0.05774354036829037, 0.05123553361330129, 0.1842075145691047, -0.13606465448563515, -0.06594327803199682, 0.38915670145355113, -0.017949394981553485, -0.12562051842109645, 0.21739942979855606, -0.16025509753417536, -0.1169831295598663, 0.1393319712615966, 0.1644412445256949, 0.05279519065638184, -0.15807337842725375, 0.024723939151890653, 0.030153487886748296, 0.16419270864062638, 0.08252002559504569, 0.06025166588613985, 0.22940866753354772, 0.20337082321451933, 0.02871208413914367, 0.14371008936631643, -0.10216659814497078, -0.030984323222672083, -0.2751462604845239, -0.14346158082297372, -0.18522979678192103, 0.03858055547136716, -0.015531687861836802, -0.16262786989600944, 0.36594519753113286, 0.18157899057186513, 0.18578903737363578, -0.0495381650683418, 0.26650126059897816, 0.06403826530151707, 0.12211518877546525, 0.04303917405521172, 0.2703167149261612, 0.1056167875881424, 0.14233683050818532, -0.23476768100440462, 0.11698233946230607, -0.026362343245166373] |
1,802.07242 | Analysis of the XRP Ledger Consensus Protocol | The XRP Ledger Consensus Protocol is a previously developed consensus
protocol powering the XRP Ledger. It is a low-latency Byzantine agreement
protocol, capable of reaching consensus without full agreement on which nodes
are members of the network. We present a detailed explanation of the algorithm
and derive conditions for its safety and liveness.
| cs.DC | the xrp ledger consensus protocol is a previously developed consensus protocol powering the xrp ledger it is a lowlatency byzantine agreement protocol capable of reaching consensus without full agreement on which nodes are members of the network we present a detailed explanation of the algorithm and derive conditions for its safety and liveness | [['the', 'xrp', 'ledger', 'consensus', 'protocol', 'is', 'a', 'previously', 'developed', 'consensus', 'protocol', 'powering', 'the', 'xrp', 'ledger', 'it', 'is', 'a', 'lowlatency', 'byzantine', 'agreement', 'protocol', 'capable', 'of', 'reaching', 'consensus', 'without', 'full', 'agreement', 'on', 'which', 'nodes', 'are', 'members', 'of', 'the', 'network', 'we', 'present', 'a', 'detailed', 'explanation', 'of', 'the', 'algorithm', 'and', 'derive', 'conditions', 'for', 'its', 'safety', 'and', 'liveness']] | [-0.30231953576593745, -0.03178859962466753, -0.06181771391651259, 0.03578011648079275, -0.04834041605211513, -0.26655803691103774, 0.17046760811189296, 0.39877661886923715, -0.15970777990384344, -0.34080808595666345, 0.11072527848289541, -0.20963043099234127, -0.10610820045518987, 0.14670160894703893, -0.088866429790011, 0.14675287679079393, 0.12736700078525212, 0.07635935868646176, 0.05775963057440438, -0.263470026826978, 0.22921026072833897, 0.08345897167147893, 0.29689679326893725, 0.025857262120072572, 0.12106888792213966, -0.007770407567117011, 0.01926028596694177, -0.029672706392066518, -0.12265996682404909, 0.07995362381257538, 0.2363758819915776, 0.2370475631400521, 0.29033349011585396, -0.4104295538843803, -0.13550420432298813, 0.10957557400512807, 0.12622225782746133, 0.16464072948910366, -0.07100685750230935, -0.3335085028677054, 0.15320258728175792, -0.246742644421932, -0.11173644519569177, -0.06547155320855244, -0.020651086075407155, 0.042165681473770235, -0.2796798230693588, 0.036772950255874334, 0.04001842312216056, 0.06921727273542926, -0.051908851529247534, -0.00029980873618766946, 0.020744378098620557, 0.13943865883410117, -0.07419937981714336, 0.01739483448140815, 0.13541978226869172, -0.11389444527690704, -0.16162343707620958, 0.3512257416293306, 0.08268452456818437, -0.0482187014603592, 0.13741916251140382, 0.019961801339995186, -0.18901135311198403, 0.09395799483611898, 0.1103752010769896, 0.08579536991299323, -0.23749047398286047, 0.02041208354606873, -0.09668757320153264, 0.18934987513524182, -0.01614571502432227, 0.08115420191530094, 0.15561595791072216, 0.21276785837451243, 0.1538063591381289, 0.06703618457013706, 0.003161553262715351, -0.15477107908084708, -0.2750305663618558, -0.15924775846443087, -0.13505510933134915, -0.01027177745160067, -0.10928560746778769, -0.13784826211279855, 0.390036555411259, 0.19019544595536195, 0.1234734246929018, 0.14375468247069292, 0.37532388475143685, 0.019742603062318183, 0.061269353996118846, 0.2089705176229747, 0.2619070073519394, 0.11044198418703843, 0.15700723621818535, -0.1826399085375498, 0.25897991111642626, 0.03334858377446544] |
1,802.07243 | Value iteration for approximate dynamic programming under convexity | This paper studies value iteration for infinite horizon contracting Markov
decision processes under convexity assumptions and when the state space is
uncountable. The original value iteration is replaced with a more tractable
form and the fixed points from the modified Bellman operators will be shown to
converge uniformly on compacts sets to their original counterparts. This holds
under various sampling approaches for the random disturbances. Moreover, this
paper will present conditions in which these fixed points form monotone
sequences of lower bounding or upper bounding functions for the original fixed
point. This approach is then demonstrated numerically on a perpetual Bermudan
put option.
| math.OC | this paper studies value iteration for infinite horizon contracting markov decision processes under convexity assumptions and when the state space is uncountable the original value iteration is replaced with a more tractable form and the fixed points from the modified bellman operators will be shown to converge uniformly on compacts sets to their original counterparts this holds under various sampling approaches for the random disturbances moreover this paper will present conditions in which these fixed points form monotone sequences of lower bounding or upper bounding functions for the original fixed point this approach is then demonstrated numerically on a perpetual bermudan put option | [['this', 'paper', 'studies', 'value', 'iteration', 'for', 'infinite', 'horizon', 'contracting', 'markov', 'decision', 'processes', 'under', 'convexity', 'assumptions', 'and', 'when', 'the', 'state', 'space', 'is', 'uncountable', 'the', 'original', 'value', 'iteration', 'is', 'replaced', 'with', 'a', 'more', 'tractable', 'form', 'and', 'the', 'fixed', 'points', 'from', 'the', 'modified', 'bellman', 'operators', 'will', 'be', 'shown', 'to', 'converge', 'uniformly', 'on', 'compacts', 'sets', 'to', 'their', 'original', 'counterparts', 'this', 'holds', 'under', 'various', 'sampling', 'approaches', 'for', 'the', 'random', 'disturbances', 'moreover', 'this', 'paper', 'will', 'present', 'conditions', 'in', 'which', 'these', 'fixed', 'points', 'form', 'monotone', 'sequences', 'of', 'lower', 'bounding', 'or', 'upper', 'bounding', 'functions', 'for', 'the', 'original', 'fixed', 'point', 'this', 'approach', 'is', 'then', 'demonstrated', 'numerically', 'on', 'a', 'perpetual', 'bermudan', 'put', 'option']] | [-0.09410401522091509, 0.11046536840064433, -0.10884545433778063, 0.10112200451232674, -0.09023941125838285, -0.16539488665452137, 0.11860880976569957, 0.38591301362527514, -0.28373513626639996, -0.18700053636888855, 0.1859712380570025, -0.2727363386182386, -0.1182838108309192, 0.18590126371743537, -0.11355778679830357, 0.10458739861864054, 0.08882310569910243, 0.04976501995788037, -0.09087471377321528, -0.29562353131189506, 0.3495431395374166, 0.031241365851104277, 0.2601447677153877, -0.02164293844727528, 0.12439095564367413, -0.0013578180381937802, 0.02383960283460837, 0.026124859739318763, -0.1594044935337982, 0.11567969043632897, 0.24841678750167773, 0.12486569469487205, 0.3525556360271949, -0.4036964255094628, -0.16909621784336937, 0.18279477568723043, 0.12774735197732315, 0.0576003913313277, -0.019744223554068227, -0.2874677249601165, 0.10257010489195875, -0.09891628009692124, -0.13778990485877232, -0.0678223887892458, -0.0006906883926718559, 0.023002397052003343, -0.3314686061959099, -0.03774990951551974, 0.09821648114062484, 0.026764181186840645, -0.08068575442415997, -0.13072194596210007, 0.008322106659620349, 0.06261312317931618, 0.061664688000817175, 0.04088179051460138, 0.12251504822136852, -0.06941297528270668, -0.08849300394169263, 0.328556633554399, -0.02727197167617314, -0.29235843455111515, 0.16010308431154027, -0.12464988251551262, -0.15979787493486283, 0.11802418789943879, 0.1412015093396671, 0.15100477216765285, -0.16573126517189327, 0.13080773413185826, -0.06234443697680547, 0.11543999454464303, 0.12302921954723238, 0.005274868737544539, 0.14207634950526854, 0.10271362860255323, 0.1991477695212347, 0.1775117234713443, -0.016282493596697607, -0.15143800524596884, -0.32540490487319174, -0.105119358662864, -0.17043147281770712, 0.05211812476808368, -0.13303997637947018, -0.20866275445453017, 0.3053378920812268, 0.16595135699252336, 0.1662518081879153, 0.17050476172075435, 0.28034961813138526, 0.207147198476042, -0.0022377805943709335, 0.12489568844021669, 0.16874452082901398, 0.060244327998783403, 0.06900125153778681, -0.11754785319654615, 0.10753271378151782, 0.15276683469131155] |
1,802.07244 | Steering Social Activity: A Stochastic Optimal Control Point Of View | User engagement in online social networking depends critically on the level
of social activity in the corresponding platform--the number of online actions,
such as posts, shares or replies, taken by their users. Can we design
data-driven algorithms to increase social activity? At a user level, such
algorithms may increase activity by helping users decide when to take an action
to be more likely to be noticed by their peers. At a network level, they may
increase activity by incentivizing a few influential users to take more
actions, which in turn will trigger additional actions by other users. In this
paper, we model social activity using the framework of marked temporal point
processes, derive an alternate representation of these processes using
stochastic differential equations (SDEs) with jumps and, exploiting this
alternate representation, develop two efficient online algorithms with provable
guarantees to steer social activity both at a user and at a network level. In
doing so, we establish a previously unexplored connection between optimal
control of jump SDEs and doubly stochastic marked temporal point processes,
which is of independent interest. Finally, we experiment both with synthetic
and real data gathered from Twitter and show that our algorithms consistently
steer social activity more effectively than the state of the art.
| cs.SI cs.LG stat.ML | user engagement in online social networking depends critically on the level of social activity in the corresponding platformthe number of online actions such as posts shares or replies taken by their users can we design datadriven algorithms to increase social activity at a user level such algorithms may increase activity by helping users decide when to take an action to be more likely to be noticed by their peers at a network level they may increase activity by incentivizing a few influential users to take more actions which in turn will trigger additional actions by other users in this paper we model social activity using the framework of marked temporal point processes derive an alternate representation of these processes using stochastic differential equations sdes with jumps and exploiting this alternate representation develop two efficient online algorithms with provable guarantees to steer social activity both at a user and at a network level in doing so we establish a previously unexplored connection between optimal control of jump sdes and doubly stochastic marked temporal point processes which is of independent interest finally we experiment both with synthetic and real data gathered from twitter and show that our algorithms consistently steer social activity more effectively than the state of the art | [['user', 'engagement', 'in', 'online', 'social', 'networking', 'depends', 'critically', 'on', 'the', 'level', 'of', 'social', 'activity', 'in', 'the', 'corresponding', 'platformthe', 'number', 'of', 'online', 'actions', 'such', 'as', 'posts', 'shares', 'or', 'replies', 'taken', 'by', 'their', 'users', 'can', 'we', 'design', 'datadriven', 'algorithms', 'to', 'increase', 'social', 'activity', 'at', 'a', 'user', 'level', 'such', 'algorithms', 'may', 'increase', 'activity', 'by', 'helping', 'users', 'decide', 'when', 'to', 'take', 'an', 'action', 'to', 'be', 'more', 'likely', 'to', 'be', 'noticed', 'by', 'their', 'peers', 'at', 'a', 'network', 'level', 'they', 'may', 'increase', 'activity', 'by', 'incentivizing', 'a', 'few', 'influential', 'users', 'to', 'take', 'more', 'actions', 'which', 'in', 'turn', 'will', 'trigger', 'additional', 'actions', 'by', 'other', 'users', 'in', 'this', 'paper', 'we', 'model', 'social', 'activity', 'using', 'the', 'framework', 'of', 'marked', 'temporal', 'point', 'processes', 'derive', 'an', 'alternate', 'representation', 'of', 'these', 'processes', 'using', 'stochastic', 'differential', 'equations', 'sdes', 'with', 'jumps', 'and', 'exploiting', 'this', 'alternate', 'representation', 'develop', 'two', 'efficient', 'online', 'algorithms', 'with', 'provable', 'guarantees', 'to', 'steer', 'social', 'activity', 'both', 'at', 'a', 'user', 'and', 'at', 'a', 'network', 'level', 'in', 'doing', 'so', 'we', 'establish', 'a', 'previously', 'unexplored', 'connection', 'between', 'optimal', 'control', 'of', 'jump', 'sdes', 'and', 'doubly', 'stochastic', 'marked', 'temporal', 'point', 'processes', 'which', 'is', 'of', 'independent', 'interest', 'finally', 'we', 'experiment', 'both', 'with', 'synthetic', 'and', 'real', 'data', 'gathered', 'from', 'twitter', 'and', 'show', 'that', 'our', 'algorithms', 'consistently', 'steer', 'social', 'activity', 'more', 'effectively', 'than', 'the', 'state', 'of', 'the', 'art']] | [-0.09567458425133359, 0.08823532345302623, -0.06792186198369173, 0.09215180735286001, -0.14689570293955254, -0.17983258838184935, 0.13106122005175222, 0.44287828748352864, -0.28078409828637063, -0.34072240875754956, 0.07792648820573203, -0.3120769435947014, -0.20940200429902397, 0.14899445058899405, -0.10078206489757963, -0.0037293167265159063, 0.06389800677354929, 0.08790535396549869, 0.005969010606736556, -0.2974923514459588, 0.298373530668337, 0.08534790029308358, 0.27699054045161764, 0.025639452962519755, 0.10841054549937897, 0.0020947082790406645, -0.07194490694994296, 0.018788161717922143, -0.05599592332993235, 0.13989668193268748, 0.3588167441545441, 0.18530887806394272, 0.36722222213961797, -0.45758640939810713, -0.18897204231110892, 0.0953721869095782, 0.15962470323044203, 0.09089846158026749, -0.039414828305696765, -0.349010661246642, 0.08313610181122442, -0.1841039272263682, -0.06222127926319945, -0.07908001848932913, -0.012275391118825921, 0.033660217667457415, -0.2812951382537539, -0.009137767938456097, 0.01785389469837509, 0.10252110865237056, -0.020823331992929253, -0.05007194009258587, -0.01773539279218637, 0.21971360776319782, 0.08038472235011576, -0.00812496036540825, 0.18427391952817027, -0.14314204545979556, -0.19193441679044335, 0.33915901371246376, -0.02643710435183937, -0.17528684773360906, 0.21437561124954643, -0.09922092504898347, -0.15184601168890577, 0.13671784852698876, 0.28453484354405734, 0.08150214174366444, -0.18355014440998635, -0.021778045287681968, -0.0209716793536636, 0.1756238443228632, 0.045310665579998625, 0.018843918111949153, 0.1698257019855802, 0.17764071091573128, 0.12455917373389581, 0.06997568105546542, 0.0012858344820116598, -0.09837151315414171, -0.21785955857665498, -0.10706820018513011, -0.1223190591112679, 0.04778093429831203, -0.126458370280528, -0.1001483279545814, 0.38820147196928734, 0.17011122368073658, 0.18652207275474633, 0.07590258427882109, 0.27322759322714113, 0.09517869764740988, 0.034835243127466255, 0.11412581495247817, 0.1707125436447129, 0.009525979838698455, 0.16769133093159483, -0.17988904863753433, 0.150052799978226, 0.02684417638968753] |
1,802.07245 | Meta-Reinforcement Learning of Structured Exploration Strategies | Exploration is a fundamental challenge in reinforcement learning (RL). Many
of the current exploration methods for deep RL use task-agnostic objectives,
such as information gain or bonuses based on state visitation. However, many
practical applications of RL involve learning more than a single task, and
prior tasks can be used to inform how exploration should be performed in new
tasks. In this work, we explore how prior tasks can inform an agent about how
to explore effectively in new situations. We introduce a novel gradient-based
fast adaptation algorithm -- model agnostic exploration with structured noise
(MAESN) -- to learn exploration strategies from prior experience. The prior
experience is used both to initialize a policy and to acquire a latent
exploration space that can inject structured stochasticity into a policy,
producing exploration strategies that are informed by prior knowledge and are
more effective than random action-space noise. We show that MAESN is more
effective at learning exploration strategies when compared to prior meta-RL
methods, RL without learned exploration strategies, and task-agnostic
exploration methods. We evaluate our method on a variety of simulated tasks:
locomotion with a wheeled robot, locomotion with a quadrupedal walker, and
object manipulation.
| cs.LG cs.AI cs.NE | exploration is a fundamental challenge in reinforcement learning rl many of the current exploration methods for deep rl use taskagnostic objectives such as information gain or bonuses based on state visitation however many practical applications of rl involve learning more than a single task and prior tasks can be used to inform how exploration should be performed in new tasks in this work we explore how prior tasks can inform an agent about how to explore effectively in new situations we introduce a novel gradientbased fast adaptation algorithm model agnostic exploration with structured noise maesn to learn exploration strategies from prior experience the prior experience is used both to initialize a policy and to acquire a latent exploration space that can inject structured stochasticity into a policy producing exploration strategies that are informed by prior knowledge and are more effective than random actionspace noise we show that maesn is more effective at learning exploration strategies when compared to prior metarl methods rl without learned exploration strategies and taskagnostic exploration methods we evaluate our method on a variety of simulated tasks locomotion with a wheeled robot locomotion with a quadrupedal walker and object manipulation | [['exploration', 'is', 'a', 'fundamental', 'challenge', 'in', 'reinforcement', 'learning', 'rl', 'many', 'of', 'the', 'current', 'exploration', 'methods', 'for', 'deep', 'rl', 'use', 'taskagnostic', 'objectives', 'such', 'as', 'information', 'gain', 'or', 'bonuses', 'based', 'on', 'state', 'visitation', 'however', 'many', 'practical', 'applications', 'of', 'rl', 'involve', 'learning', 'more', 'than', 'a', 'single', 'task', 'and', 'prior', 'tasks', 'can', 'be', 'used', 'to', 'inform', 'how', 'exploration', 'should', 'be', 'performed', 'in', 'new', 'tasks', 'in', 'this', 'work', 'we', 'explore', 'how', 'prior', 'tasks', 'can', 'inform', 'an', 'agent', 'about', 'how', 'to', 'explore', 'effectively', 'in', 'new', 'situations', 'we', 'introduce', 'a', 'novel', 'gradientbased', 'fast', 'adaptation', 'algorithm', 'model', 'agnostic', 'exploration', 'with', 'structured', 'noise', 'maesn', 'to', 'learn', 'exploration', 'strategies', 'from', 'prior', 'experience', 'the', 'prior', 'experience', 'is', 'used', 'both', 'to', 'initialize', 'a', 'policy', 'and', 'to', 'acquire', 'a', 'latent', 'exploration', 'space', 'that', 'can', 'inject', 'structured', 'stochasticity', 'into', 'a', 'policy', 'producing', 'exploration', 'strategies', 'that', 'are', 'informed', 'by', 'prior', 'knowledge', 'and', 'are', 'more', 'effective', 'than', 'random', 'actionspace', 'noise', 'we', 'show', 'that', 'maesn', 'is', 'more', 'effective', 'at', 'learning', 'exploration', 'strategies', 'when', 'compared', 'to', 'prior', 'metarl', 'methods', 'rl', 'without', 'learned', 'exploration', 'strategies', 'and', 'taskagnostic', 'exploration', 'methods', 'we', 'evaluate', 'our', 'method', 'on', 'a', 'variety', 'of', 'simulated', 'tasks', 'locomotion', 'with', 'a', 'wheeled', 'robot', 'locomotion', 'with', 'a', 'quadrupedal', 'walker', 'and', 'object', 'manipulation']] | [0.0014713282617250163, 0.050788909057844556, -0.1372882110324051, 0.07075038849265854, -0.19867949485288638, -0.20049857262669032, 0.09212560643883128, 0.5150335833430291, -0.2680669607937728, -0.384554086772627, 0.08148020276995865, -0.17121039357918658, -0.21142709041136856, 0.21177238906598894, -0.15658404533506223, 0.048643759990993296, 0.10043718116357922, -0.008442937327842964, -0.05836596943003027, -0.24249371159331579, 0.27247786850693, 0.030863073243802462, 0.29469965810054227, -0.06662142819626943, 0.1300399391274703, 0.01248355846803047, -0.024765257240812244, -0.018149765517323672, -0.09242185837965257, 0.1733265542866368, 0.35369266807836924, 0.23408401889334385, 0.400802956247016, -0.4180275025483417, -0.27926288645984115, 0.12900660400720018, 0.145122986162498, 0.12124395722792924, -0.04506002069369731, -0.3359407078670828, 0.04125073552376738, -0.17226144863893034, -0.0027288846610310047, -0.21302900559906113, -0.04068399248522167, -0.025810768767137473, -0.32574175715348436, -0.057654938716625206, 0.07665426903894465, 0.030332854457542694, -0.03789894821146797, -0.1279010973919771, 0.05096140614049019, 0.18155094483502723, 0.01787146563752015, 0.0735757710675611, 0.2117861997581234, -0.2158492151007139, -0.21251009027718715, 0.3555391358897874, -0.009563098403802877, -0.22991314123531706, 0.2423024966865533, -0.01963364605938918, -0.13483219245007555, 0.09087059018202126, 0.29153122365486955, 0.16063486850624414, -0.14446741012882405, 0.0025122459521394616, 0.01423656966684288, 0.16928853531012703, -0.01465373818186651, -0.035816890326034474, 0.18326192299198163, 0.28116629824017814, 0.128121711764068, 0.10407151235144978, -0.05398140000914665, -0.11739653907716274, -0.17948778966980938, -0.10982173892154702, -0.17554130340117569, 0.0049556148385531025, -0.08422357306140169, -0.06766506033607966, 0.3378620858867898, 0.26373075679630825, 0.205224399141183, 0.07451790718753872, 0.36161053324804493, -0.0013838840789455725, 0.060852962961469435, 0.13280389191503147, 0.18152771987217037, -0.01947713767202865, 0.13728812062181533, -0.1817872112531117, 0.1382469767753623, -0.010483036298108728] |
1,802.07246 | Exact equations of state for nematics | We propose a novel approach to the solution of nematic Liquid Crystal models
based on the derivation of a system of nonlinear wave equations for order
parameters such that the occurrence of uniaxial and biaxial phase transitions
can be interpreted as the propagation of a two-dimensional shock wave in the
space of thermodynamic parameters. We obtain the exact equations of state for
an integrable model of biaxial nematic liquid crystals and show that the
classical transition from isotropic to uniaxial phase in absence of external
fields is the result of a van der Waals type phase transition, where the jump
in the order parameters is a classical shock generated from a gradient
catastrophe at a non-zero isotropic field. The study of the equations of state
provides the first analytical description of the rich structure of nematics
phase diagrams in presence of external fields.
| cond-mat.soft nlin.SI physics.class-ph | we propose a novel approach to the solution of nematic liquid crystal models based on the derivation of a system of nonlinear wave equations for order parameters such that the occurrence of uniaxial and biaxial phase transitions can be interpreted as the propagation of a twodimensional shock wave in the space of thermodynamic parameters we obtain the exact equations of state for an integrable model of biaxial nematic liquid crystals and show that the classical transition from isotropic to uniaxial phase in absence of external fields is the result of a van der waals type phase transition where the jump in the order parameters is a classical shock generated from a gradient catastrophe at a nonzero isotropic field the study of the equations of state provides the first analytical description of the rich structure of nematics phase diagrams in presence of external fields | [['we', 'propose', 'a', 'novel', 'approach', 'to', 'the', 'solution', 'of', 'nematic', 'liquid', 'crystal', 'models', 'based', 'on', 'the', 'derivation', 'of', 'a', 'system', 'of', 'nonlinear', 'wave', 'equations', 'for', 'order', 'parameters', 'such', 'that', 'the', 'occurrence', 'of', 'uniaxial', 'and', 'biaxial', 'phase', 'transitions', 'can', 'be', 'interpreted', 'as', 'the', 'propagation', 'of', 'a', 'twodimensional', 'shock', 'wave', 'in', 'the', 'space', 'of', 'thermodynamic', 'parameters', 'we', 'obtain', 'the', 'exact', 'equations', 'of', 'state', 'for', 'an', 'integrable', 'model', 'of', 'biaxial', 'nematic', 'liquid', 'crystals', 'and', 'show', 'that', 'the', 'classical', 'transition', 'from', 'isotropic', 'to', 'uniaxial', 'phase', 'in', 'absence', 'of', 'external', 'fields', 'is', 'the', 'result', 'of', 'a', 'van', 'der', 'waals', 'type', 'phase', 'transition', 'where', 'the', 'jump', 'in', 'the', 'order', 'parameters', 'is', 'a', 'classical', 'shock', 'generated', 'from', 'a', 'gradient', 'catastrophe', 'at', 'a', 'nonzero', 'isotropic', 'field', 'the', 'study', 'of', 'the', 'equations', 'of', 'state', 'provides', 'the', 'first', 'analytical', 'description', 'of', 'the', 'rich', 'structure', 'of', 'nematics', 'phase', 'diagrams', 'in', 'presence', 'of', 'external', 'fields']] | [-0.19236121231273234, 0.16318758346323148, -0.088274930033937, -0.00634618481243407, -0.06786559777451562, -0.07562368963291491, 0.03132643488356258, 0.3237921940162778, -0.2703372390478381, -0.25214984883404484, 0.05841097150851119, -0.260374815802422, -0.17452615276109296, 0.14362671647474848, 0.06457715156696528, 0.03853628100579852, -0.037672090038031965, 0.006767902244859329, -0.1348325054802756, -0.16181418358126876, 0.32497873717358894, -0.004671914112213608, 0.2910227711227807, -0.0017359668642959812, 0.12226605328724727, -0.005399611522932049, 0.1041778036705837, 0.041420341413785616, -0.19356736760650406, 0.03791480746699849, 0.23157398666571552, -0.020278223135697465, 0.20192408942864962, -0.4556596981218228, -0.26561379721844114, 0.05523672510407396, 0.10070359148085117, 0.19227539990878814, -0.048010024617400046, -0.304912044347583, 0.00965322924686687, -0.17556581532882226, -0.19146704639575177, -0.08747459545575238, -0.026851712650345912, 0.0660146636855007, -0.2686198636571147, 0.1426124687052586, 0.10591989261801582, 0.05192779085983138, -0.125653433463686, -0.05308927699900721, -0.035048645256751484, 0.05665601763249069, 0.04294268748237771, 0.05262416787934001, 0.10575313723509337, -0.1974046586563329, -0.09430377766281575, 0.4189980233062085, -0.08448606763373721, -0.1466418501816794, 0.14868527491108052, -0.12816539219921697, -0.06892089499486284, 0.19070553735315382, 0.17706223813958558, 0.07918085486113609, -0.11697842400900407, 0.07708307725810479, -0.003864357042593647, 0.1792480867173705, 0.03058468324125751, -0.017210668793039306, 0.21740448271035107, 0.15828122068001152, 0.026885769792370028, 0.1916050206523037, -0.07582285654587814, -0.11927562964090205, -0.3271657347001813, -0.20935258273461874, -0.18943585134990565, 0.04290238827189359, -0.12163460877267286, -0.2573661641120077, 0.3868369391233615, 0.13866315562509235, 0.1412850317088936, -0.039856071466697264, 0.23115957923513558, 0.11695921505635305, -0.011293376353080873, 0.015946973965119023, 0.28560877750933794, 0.17061511523389888, 0.08857894959449247, -0.23811447181758452, 0.05828045791672816, 0.09918838933474951] |
1,802.07247 | Reverse Monte Carlo reconstruction of electron spin-label coordinates
from scanned-probe magnetic resonance microscope signals | Individual electron spins have been observed using magnetic resonance in
combination with a number of distinct detection approaches. The coordinates of
an individual electron spin can then in principle be determined by introducing
a 10 to 100 nm diameter magnetic needle, scanning the needle, and collecting
signal as a function of the needle's position. Although individual electrons
have recently been localized with nanometer precision in this way using a
nitrogen-vacancy center in diamond as the spin detector, the experiment's low
signal-to-noise ratio limited acquisition to two-dimensional scanning of just a
few dozen data points and was incompatible with nitroxide spin labels widely
used to label proteins and nucleic acids. We introduce and numerically simulate
a protocol for detecting and imaging individual nitroxide electron spins
mechanically with high spatial resolution. In our protocol a scanned
magnet-tipped cantilever is brought near the sample, modulated microwaves are
applied to resonantly excite electron spins, and changes in spin magnetization
are detected as a shift in the mechanical frequency of the cantilever. By
carefully applying resonant microwaves in short bursts in synchrony with the
cantilever's oscillation, we propose to retain high spatial resolution even at
large cantilever amplitude where sensitivity is highest. Numerical simulations
reveal nanometer-diameter rings of frequency-shift signal as the tip is
scanned. Our primary finding is that it is possible --- using a Bayesian,
reverse Monte Carlo algorithm introduced here --- to obtain the full
three-dimensional distribution of electron coordinates from the signal rings
revealed in a two-dimensional frequency-shift map. This reduction in
dimensionality brings within reach, on a practical timescale, the
angstrom-resolution three-dimensional imaging of spin-labeled macromolecules.
| cond-mat.mes-hall | individual electron spins have been observed using magnetic resonance in combination with a number of distinct detection approaches the coordinates of an individual electron spin can then in principle be determined by introducing a 10 to 100 nm diameter magnetic needle scanning the needle and collecting signal as a function of the needles position although individual electrons have recently been localized with nanometer precision in this way using a nitrogenvacancy center in diamond as the spin detector the experiments low signaltonoise ratio limited acquisition to twodimensional scanning of just a few dozen data points and was incompatible with nitroxide spin labels widely used to label proteins and nucleic acids we introduce and numerically simulate a protocol for detecting and imaging individual nitroxide electron spins mechanically with high spatial resolution in our protocol a scanned magnettipped cantilever is brought near the sample modulated microwaves are applied to resonantly excite electron spins and changes in spin magnetization are detected as a shift in the mechanical frequency of the cantilever by carefully applying resonant microwaves in short bursts in synchrony with the cantilevers oscillation we propose to retain high spatial resolution even at large cantilever amplitude where sensitivity is highest numerical simulations reveal nanometerdiameter rings of frequencyshift signal as the tip is scanned our primary finding is that it is possible using a bayesian reverse monte carlo algorithm introduced here to obtain the full threedimensional distribution of electron coordinates from the signal rings revealed in a twodimensional frequencyshift map this reduction in dimensionality brings within reach on a practical timescale the angstromresolution threedimensional imaging of spinlabeled macromolecules | [['individual', 'electron', 'spins', 'have', 'been', 'observed', 'using', 'magnetic', 'resonance', 'in', 'combination', 'with', 'a', 'number', 'of', 'distinct', 'detection', 'approaches', 'the', 'coordinates', 'of', 'an', 'individual', 'electron', 'spin', 'can', 'then', 'in', 'principle', 'be', 'determined', 'by', 'introducing', 'a', '10', 'to', '100', 'nm', 'diameter', 'magnetic', 'needle', 'scanning', 'the', 'needle', 'and', 'collecting', 'signal', 'as', 'a', 'function', 'of', 'the', 'needles', 'position', 'although', 'individual', 'electrons', 'have', 'recently', 'been', 'localized', 'with', 'nanometer', 'precision', 'in', 'this', 'way', 'using', 'a', 'nitrogenvacancy', 'center', 'in', 'diamond', 'as', 'the', 'spin', 'detector', 'the', 'experiments', 'low', 'signaltonoise', 'ratio', 'limited', 'acquisition', 'to', 'twodimensional', 'scanning', 'of', 'just', 'a', 'few', 'dozen', 'data', 'points', 'and', 'was', 'incompatible', 'with', 'nitroxide', 'spin', 'labels', 'widely', 'used', 'to', 'label', 'proteins', 'and', 'nucleic', 'acids', 'we', 'introduce', 'and', 'numerically', 'simulate', 'a', 'protocol', 'for', 'detecting', 'and', 'imaging', 'individual', 'nitroxide', 'electron', 'spins', 'mechanically', 'with', 'high', 'spatial', 'resolution', 'in', 'our', 'protocol', 'a', 'scanned', 'magnettipped', 'cantilever', 'is', 'brought', 'near', 'the', 'sample', 'modulated', 'microwaves', 'are', 'applied', 'to', 'resonantly', 'excite', 'electron', 'spins', 'and', 'changes', 'in', 'spin', 'magnetization', 'are', 'detected', 'as', 'a', 'shift', 'in', 'the', 'mechanical', 'frequency', 'of', 'the', 'cantilever', 'by', 'carefully', 'applying', 'resonant', 'microwaves', 'in', 'short', 'bursts', 'in', 'synchrony', 'with', 'the', 'cantilevers', 'oscillation', 'we', 'propose', 'to', 'retain', 'high', 'spatial', 'resolution', 'even', 'at', 'large', 'cantilever', 'amplitude', 'where', 'sensitivity', 'is', 'highest', 'numerical', 'simulations', 'reveal', 'nanometerdiameter', 'rings', 'of', 'frequencyshift', 'signal', 'as', 'the', 'tip', 'is', 'scanned', 'our', 'primary', 'finding', 'is', 'that', 'it', 'is', 'possible', 'using', 'a', 'bayesian', 'reverse', 'monte', 'carlo', 'algorithm', 'introduced', 'here', 'to', 'obtain', 'the', 'full', 'threedimensional', 'distribution', 'of', 'electron', 'coordinates', 'from', 'the', 'signal', 'rings', 'revealed', 'in', 'a', 'twodimensional', 'frequencyshift', 'map', 'this', 'reduction', 'in', 'dimensionality', 'brings', 'within', 'reach', 'on', 'a', 'practical', 'timescale', 'the', 'angstromresolution', 'threedimensional', 'imaging', 'of', 'spinlabeled', 'macromolecules']] | [-0.10677104474855766, 0.16574745206929106, -0.019214160828134763, 0.014713557332736224, -0.029430740114408903, -0.17299249533814592, 0.033110923181252125, 0.43963818132268406, -0.262581976592684, -0.354161035890082, 0.05567972313370914, -0.2916809442703827, -0.06564815093566162, 0.20275649309623986, -0.011479576592011233, 0.05143746201065369, 0.05744772345776884, -0.007016101998026268, -0.04695889725406652, -0.1690300502291323, 0.20408654092758438, 0.09754325635193918, 0.28644350885162845, 0.01357527564664801, 0.15327790052621051, 0.03226550278755335, 0.043965962418140124, 0.01852273096760305, -0.10592446633753962, 0.0861408282418639, 0.27580822669775584, 0.030155605127891668, 0.2347032721906614, -0.4513515418501461, -0.20335833250831525, 0.05808878731913865, 0.18343959945665958, 0.16186840122905918, -0.06590323153247413, -0.2883680771248272, 0.05994816525803449, -0.11996856116904663, -0.12701509026362776, -0.07790302363081048, -0.010549077808033103, 0.044317638549882056, -0.2309701041246836, 0.09846150266060319, -0.0016986598222641848, 0.11865592279041616, -0.03810615849394638, -0.05152493073837831, -0.0008236571071812739, 0.08758058042507261, 0.001753888478448901, 0.05767884089056259, 0.2035700637417344, -0.069671427202411, -0.13044171467817461, 0.3224424239628626, -0.04723886103154375, -0.1680088113916169, 0.16327363004585585, -0.2108933111258711, -0.07438142477857092, 0.1835442002504491, 0.13669097233863656, 0.1313539719988162, -0.16468753921329224, 0.01863673283649125, 0.002114536606061917, 0.2256618888439754, 0.13238375251575446, 0.03774886346207215, 0.24988961447066127, 0.22281751823163806, 0.047374448597502825, 0.14101565803284757, -0.2352075810624788, -0.013654187354124868, -0.17596938034806114, -0.1247378168376879, -0.23028684191253537, 0.07032888830424501, -0.05349641373222067, -0.13402505138387474, 0.38654921246119417, 0.1410341231438976, 0.19599510160937475, -0.04584771362043774, 0.3177744135041184, 0.07346954676233089, 0.10629836088046432, -0.008675193627221653, 0.25733930258653487, 0.16602475655784543, 0.09079983237808427, -0.24059000991266938, 0.021902863238490403, -0.014553833684812372] |
1,802.07248 | Gelfand-Tsetlin variety for $\mathfrak{gl}_n$ | S. Ovsienko proved that the Gelfand-Tsetlin variety for $\mathfrak{gl}_n$ is
equidimensional (i.e. all its irreducible components have the same dimension)
with dimension equals $\frac{n(n-1)}{2}$. This result has important
consequences in Representation Theory of Algebras, implying, in particular, the
equidimensionality of the nilfiber of the Kostant-Wallach map. In this paper we
will present the generalization of this result and will address a weak version
of Ovsienko's Theorem which includes the regular case.
| math.RT math.AG | s ovsienko proved that the gelfandtsetlin variety for mathfrakgl_n is equidimensional ie all its irreducible components have the same dimension with dimension equals fracnn12 this result has important consequences in representation theory of algebras implying in particular the equidimensionality of the nilfiber of the kostantwallach map in this paper we will present the generalization of this result and will address a weak version of ovsienkos theorem which includes the regular case | [['s', 'ovsienko', 'proved', 'that', 'the', 'gelfandtsetlin', 'variety', 'for', 'mathfrakgl_n', 'is', 'equidimensional', 'ie', 'all', 'its', 'irreducible', 'components', 'have', 'the', 'same', 'dimension', 'with', 'dimension', 'equals', 'fracnn12', 'this', 'result', 'has', 'important', 'consequences', 'in', 'representation', 'theory', 'of', 'algebras', 'implying', 'in', 'particular', 'the', 'equidimensionality', 'of', 'the', 'nilfiber', 'of', 'the', 'kostantwallach', 'map', 'in', 'this', 'paper', 'we', 'will', 'present', 'the', 'generalization', 'of', 'this', 'result', 'and', 'will', 'address', 'a', 'weak', 'version', 'of', 'ovsienkos', 'theorem', 'which', 'includes', 'the', 'regular', 'case']] | [-0.1548574381183995, 0.060230886698633, -0.08292563408073308, 0.029259425692557208, -0.028449259799621675, -0.11726124625167121, -0.05052241831140566, 0.28205415085497976, -0.2864149055997099, -0.1910462936764394, 0.1178170806488724, -0.2257440910283206, -0.17985237512629534, 0.1843304237742247, -0.15430073506043604, -0.04317700795819173, 0.0841928691117336, 0.09680244015981916, -0.08224388804502678, -0.27932451473737974, 0.38783033947338874, -0.009009707236554528, 0.2406946338908882, 0.08455607556886431, 0.11761786334513538, 0.05679493640428004, -0.040783766029483595, -0.010776053952134174, -0.14705183766362598, 0.14883064378079944, 0.2897801767710758, 0.11343456060369161, 0.2381073175996974, -0.31403821620388306, -0.15591678273040746, 0.2102976325845373, 0.15184750921511347, 0.08387231219904093, 0.007158592113874097, -0.23146695238403112, 0.12444684559317387, -0.2013304749422747, -0.21681032526860203, -0.04863428784048428, 0.07831699700783128, -0.022053600677189526, -0.23192825489610003, 0.030877411729939606, 0.19009171244418382, 0.08913972963131053, -0.052208359530398055, -0.10549884227414925, -0.024242896073754284, 0.09773332136683166, 0.0032654847862009983, 0.04403537029292488, 0.019347321802237326, -0.10117733499129722, -0.1294321375021684, 0.3683640983198648, -0.04382752548849237, -0.1944120490140673, 0.17714916703466704, -0.17472184915095568, -0.21111480191862886, 0.06813107873988, 0.10432664722717111, 0.12080278516193663, -0.06822786667802627, 0.20558211315959773, -0.15067022372091163, 0.06676551424290823, 0.10473466142202201, 0.04921502990486181, 0.1288140997749524, 0.12384099135026876, 0.08935663040524494, 0.17543972738465105, -0.02425132035885168, -0.006686326579032196, -0.3285610854787671, -0.19001723555982977, -0.1322732525523347, 0.12057691514222087, -0.08302256290820272, -0.15217968392307343, 0.40618442422777845, 0.13450873502111738, 0.16405201684413612, 0.08998678687561736, 0.22614216599343478, 0.11563399558940875, 0.06688887108306306, 0.06665644862864545, 0.18171139153908344, 0.20016986020989175, 0.04153065180972866, -0.11865120642460829, 0.03549865445972461, 0.19874146849294935] |
1,802.07249 | Three Dimensional Imaging of the Nucleon | We study the Wigner distributions of quarks and gluons in light-front dressed
quark model using the overlap of light front wave functions (LFWFs). We take
the target to be a dressed quark, this is a composite spin $-1/2$ state of
quark dressed with a gluon. This state allows us to calculate the quark and
gluon Wigner distributions analytically in terms of LFWFs using Hamiltonian
perturbation theory. We analyze numerically the Wigner distributions of quark
and gluon and report their nature in the contour plots. We use an improved
numerical technique to remove the cutoff dependence of the Fourier transformed
integral over ${\bf \Delta}_\perp$.
| hep-ph | we study the wigner distributions of quarks and gluons in lightfront dressed quark model using the overlap of light front wave functions lfwfs we take the target to be a dressed quark this is a composite spin 12 state of quark dressed with a gluon this state allows us to calculate the quark and gluon wigner distributions analytically in terms of lfwfs using hamiltonian perturbation theory we analyze numerically the wigner distributions of quark and gluon and report their nature in the contour plots we use an improved numerical technique to remove the cutoff dependence of the fourier transformed integral over bf delta_perp | [['we', 'study', 'the', 'wigner', 'distributions', 'of', 'quarks', 'and', 'gluons', 'in', 'lightfront', 'dressed', 'quark', 'model', 'using', 'the', 'overlap', 'of', 'light', 'front', 'wave', 'functions', 'lfwfs', 'we', 'take', 'the', 'target', 'to', 'be', 'a', 'dressed', 'quark', 'this', 'is', 'a', 'composite', 'spin', '12', 'state', 'of', 'quark', 'dressed', 'with', 'a', 'gluon', 'this', 'state', 'allows', 'us', 'to', 'calculate', 'the', 'quark', 'and', 'gluon', 'wigner', 'distributions', 'analytically', 'in', 'terms', 'of', 'lfwfs', 'using', 'hamiltonian', 'perturbation', 'theory', 'we', 'analyze', 'numerically', 'the', 'wigner', 'distributions', 'of', 'quark', 'and', 'gluon', 'and', 'report', 'their', 'nature', 'in', 'the', 'contour', 'plots', 'we', 'use', 'an', 'improved', 'numerical', 'technique', 'to', 'remove', 'the', 'cutoff', 'dependence', 'of', 'the', 'fourier', 'transformed', 'integral', 'over', 'bf', 'delta_perp']] | [-0.053683595578141, 0.25151352168106617, -0.2188047740011684, 0.13540011594067464, -0.05910095448709699, -0.025255387997055807, 0.081600812683108, 0.3895518938893253, -0.18100821211916004, -0.20423320155518437, -0.06498171289528278, -0.2683060222241216, -0.051595348442081836, 0.07158912645734268, 0.04955371226030357, 0.11744358040193476, 0.03260972670695374, -0.018121854912996, -0.15023868823948416, -0.20926986844957018, 0.3568769464025147, -0.03679840822785514, 0.22262922824514145, 0.1287476483718899, 0.11507037811849302, 0.09877868286035593, -0.04307627575291158, -0.10464670749616276, -0.09974697111084045, 0.0665103697208959, 0.16138726733658842, 0.0556163882963287, 0.1626904319691499, -0.3957207323892892, -0.14796445732800634, 0.050931273100590244, 0.17822156056368416, 0.12684051019763484, 0.018744398649890446, -0.2994034188410756, 0.0017483494633320465, -0.2610841417703235, -0.2241247130040242, -0.1693323435153342, -0.01431926058659565, -0.00571310580301198, -0.31513075652595574, 0.10182839947598941, -0.05434595142916134, -0.04334711627944291, -0.02328189069839495, -0.1629856958876825, -0.05781888646453402, 0.06722463482484511, 0.045519713381438426, 0.1043471828243216, 0.1157602794023086, -0.21226341172022004, -0.10839779442628321, 0.3491283380562096, -0.08801239045580976, -0.2647697111248102, 0.09670582744609384, -0.2207537867689451, -0.06833812516878893, 0.12048541248134038, 0.21173920078221167, 0.14039440274021578, -0.2041715927313543, 0.10517868331127159, -0.05330446102072652, 0.16370639574795381, 0.13149756782923291, 0.0687444945300016, 0.2023673217237285, 0.12498601618476067, -0.06311181080256345, 0.17264124381161539, -0.10576947561456161, -0.1427699414452592, -0.34758011338490885, -0.12391519822006214, -0.20474251325793782, 0.04082041107684948, -0.10081828510314136, -0.1797589403803198, 0.47441325598911754, 0.12869276196551194, 0.19822913176126922, 0.01279607886059698, 0.2616658546889508, 0.20375565028505274, 0.025223795855779527, 0.07888586705243125, 0.21745226335105966, 0.24621406504974783, 0.12868896227452037, -0.29911864283539863, -0.06288969733761353, 0.10424869904493533] |
1,802.0725 | Bifurcations in the theory of current transfer to cathodes of dc
discharges and observations of transitions between different modes | General scenarios of transitions between different spot patterns on
electrodes of dc gas discharges and their relation to bifurcations of
steady-state solutions are analyzed. In the case of cathodes of arc discharges,
it is shown that any transition between different modes of current transfer is
related to a bifurcation of steady-state solutions. In particular, transitions
between diffuse and spot modes on axially symmetric cathodes, frequently
observed in the experiment, represent an indication of the presence of
pitchfork or fold bifurcations of steady-state solutions. Experimental
observations of transitions on cathodes of dc glow microdischarges are analyzed
and those potentially related to bifurcations of steady-state solutions are
identified. The relevant bifurcations are investigated numerically and the
computed patterns are found to conform to those observed in the course of the
corresponding transitions in the experiment.
| physics.plasm-ph | general scenarios of transitions between different spot patterns on electrodes of dc gas discharges and their relation to bifurcations of steadystate solutions are analyzed in the case of cathodes of arc discharges it is shown that any transition between different modes of current transfer is related to a bifurcation of steadystate solutions in particular transitions between diffuse and spot modes on axially symmetric cathodes frequently observed in the experiment represent an indication of the presence of pitchfork or fold bifurcations of steadystate solutions experimental observations of transitions on cathodes of dc glow microdischarges are analyzed and those potentially related to bifurcations of steadystate solutions are identified the relevant bifurcations are investigated numerically and the computed patterns are found to conform to those observed in the course of the corresponding transitions in the experiment | [['general', 'scenarios', 'of', 'transitions', 'between', 'different', 'spot', 'patterns', 'on', 'electrodes', 'of', 'dc', 'gas', 'discharges', 'and', 'their', 'relation', 'to', 'bifurcations', 'of', 'steadystate', 'solutions', 'are', 'analyzed', 'in', 'the', 'case', 'of', 'cathodes', 'of', 'arc', 'discharges', 'it', 'is', 'shown', 'that', 'any', 'transition', 'between', 'different', 'modes', 'of', 'current', 'transfer', 'is', 'related', 'to', 'a', 'bifurcation', 'of', 'steadystate', 'solutions', 'in', 'particular', 'transitions', 'between', 'diffuse', 'and', 'spot', 'modes', 'on', 'axially', 'symmetric', 'cathodes', 'frequently', 'observed', 'in', 'the', 'experiment', 'represent', 'an', 'indication', 'of', 'the', 'presence', 'of', 'pitchfork', 'or', 'fold', 'bifurcations', 'of', 'steadystate', 'solutions', 'experimental', 'observations', 'of', 'transitions', 'on', 'cathodes', 'of', 'dc', 'glow', 'microdischarges', 'are', 'analyzed', 'and', 'those', 'potentially', 'related', 'to', 'bifurcations', 'of', 'steadystate', 'solutions', 'are', 'identified', 'the', 'relevant', 'bifurcations', 'are', 'investigated', 'numerically', 'and', 'the', 'computed', 'patterns', 'are', 'found', 'to', 'conform', 'to', 'those', 'observed', 'in', 'the', 'course', 'of', 'the', 'corresponding', 'transitions', 'in', 'the', 'experiment']] | [-0.1628520585035492, 0.13171849282525386, -0.03656602300759545, 0.0755683610065231, 0.019264521052766787, -0.14095617143465275, 0.0382548868262272, 0.36043548583284135, -0.2161808009644536, -0.2802744068737541, 0.10432848888466877, -0.3265685786430101, -0.14385000583575688, 0.21018371582416384, -0.017140425048432405, 0.0603889114830881, 0.02878072232014983, -0.009791165982422075, -0.04022122407857245, -0.13933869198496854, 0.30182617552634466, 0.00974039485173902, 0.3033658361755648, 0.01772062821270849, 0.025126061388256408, -0.15953231391784056, 0.013665954109729457, 0.016860009769776037, -0.1524018858740727, 0.0238027772726141, 0.28272534771717356, 0.06515994383971017, 0.14329329266780078, -0.48058663403853435, -0.20355740737141972, 0.09620998072073816, 0.1469119347989055, 0.102857728845867, -0.04292893545838647, -0.2789116910102084, 0.06859039198047012, -0.10239108624041808, -0.1336880124251085, -0.05615813379645124, 0.05283177827302843, 0.11565237438754368, -0.24766473250841736, 0.10354065880725595, 0.036287152019322366, 0.08870707903253405, -0.11427210327027772, -0.05998138024006039, -0.09636918729857395, 0.1289852695886214, 0.08631658479501318, -0.05004519067837724, 0.1622766161239461, -0.12403190418328613, -0.13676416605738992, 0.3650551180082156, -0.023539969690592216, -0.14010830354330628, 0.23947610563941693, -0.20599019825738624, -0.05764296319321694, 0.17765311266845302, 0.15176917522921599, 0.11544928241072965, -0.13919625620364695, -0.025930077896656512, -0.008322064726284347, 0.10893943379335526, 0.14513443594210243, -0.032784581959468165, 0.24033183047085777, 0.1456832515576476, 0.016641226443076942, 0.18198938931065395, -0.08800458761205182, -0.14855596276098176, -0.2715420264136256, -0.08115548127211798, -0.09366932280949856, -0.0014456994376404392, -0.023407208428217478, -0.18134974542356627, 0.4512514627811716, 0.08751783725154355, 0.17673273496259762, -0.04679310205217479, 0.24439633315905257, 0.1335991771674638, 0.02702212886695743, 0.027080017219024494, 0.2903658015849559, 0.15134746549104838, 0.11719520641770914, -0.2602891053381215, 0.07513629466197208, 0.006449453271855425] |
1,802.07251 | A fuzzy logic feedback filter design tuned with PSO for L1 adaptive
controller | L1 adaptive controller has been recognized for having a structure that allows
decoupling between robustness and adaption owing to the introduction of a low
pass filter with adjustable gain in the feedback loop. The trade-off between
performance, fast adaptation and robustness, is the main criteria when
selecting the structure or the coefficients of the filter. Several off-line
methods with varying levels of complexity exist to help finding bounds or
initial values for these coefficients. Such values may require further
refinement using trial-and-error procedures upon implementation. Subsequently,
these approaches suggest that once implemented these values are kept fixed
leading to sub-optimal performance in both speed of adaptation and robustness.
In this paper, a new practical approach based on fuzzy rules for online
continuous tuning of these coefficients is proposed. The fuzzy controller is
optimally tuned using Particle Swarm Optimization (PSO) taking into accounts
both the tracking error and the controller output signal range. The simulation
of several examples of systems with moderate to severe nonlinearities
demonstrate that the proposed approach offers improved control performance.
Keywords: Fuzzy logic control, single-objective, multi-objective particle swarm
optimization, L1 Adaptive control, fuzzy L1 adaptive controller, L1 fuzzy
adaptive control, L1 fuzzy adaptive controller, fuzzy L1 adaptive control,
Filter tuning, Fuzzy membership function tuning, optimal, optimal tuning, Fuzzy
membership function optimization, Robustness, Adaptation, multi-input
multi-output, single-input single-output, estimate, PSO, FLC, nonlinear,
adaptive, online, off-line, Fuzzy adaptive controller, Fuzzy adaptive control,
single input single output, multi input multi output, SISO, MIMO, robust,
uncertain, uncertain nonlinear system, disturbance, unknown, Adaptive Fuzzy
Control Design, stable.
| cs.SY | l1 adaptive controller has been recognized for having a structure that allows decoupling between robustness and adaption owing to the introduction of a low pass filter with adjustable gain in the feedback loop the tradeoff between performance fast adaptation and robustness is the main criteria when selecting the structure or the coefficients of the filter several offline methods with varying levels of complexity exist to help finding bounds or initial values for these coefficients such values may require further refinement using trialanderror procedures upon implementation subsequently these approaches suggest that once implemented these values are kept fixed leading to suboptimal performance in both speed of adaptation and robustness in this paper a new practical approach based on fuzzy rules for online continuous tuning of these coefficients is proposed the fuzzy controller is optimally tuned using particle swarm optimization pso taking into accounts both the tracking error and the controller output signal range the simulation of several examples of systems with moderate to severe nonlinearities demonstrate that the proposed approach offers improved control performance keywords fuzzy logic control singleobjective multiobjective particle swarm optimization l1 adaptive control fuzzy l1 adaptive controller l1 fuzzy adaptive control l1 fuzzy adaptive controller fuzzy l1 adaptive control filter tuning fuzzy membership function tuning optimal optimal tuning fuzzy membership function optimization robustness adaptation multiinput multioutput singleinput singleoutput estimate pso flc nonlinear adaptive online offline fuzzy adaptive controller fuzzy adaptive control single input single output multi input multi output siso mimo robust uncertain uncertain nonlinear system disturbance unknown adaptive fuzzy control design stable | [['l1', 'adaptive', 'controller', 'has', 'been', 'recognized', 'for', 'having', 'a', 'structure', 'that', 'allows', 'decoupling', 'between', 'robustness', 'and', 'adaption', 'owing', 'to', 'the', 'introduction', 'of', 'a', 'low', 'pass', 'filter', 'with', 'adjustable', 'gain', 'in', 'the', 'feedback', 'loop', 'the', 'tradeoff', 'between', 'performance', 'fast', 'adaptation', 'and', 'robustness', 'is', 'the', 'main', 'criteria', 'when', 'selecting', 'the', 'structure', 'or', 'the', 'coefficients', 'of', 'the', 'filter', 'several', 'offline', 'methods', 'with', 'varying', 'levels', 'of', 'complexity', 'exist', 'to', 'help', 'finding', 'bounds', 'or', 'initial', 'values', 'for', 'these', 'coefficients', 'such', 'values', 'may', 'require', 'further', 'refinement', 'using', 'trialanderror', 'procedures', 'upon', 'implementation', 'subsequently', 'these', 'approaches', 'suggest', 'that', 'once', 'implemented', 'these', 'values', 'are', 'kept', 'fixed', 'leading', 'to', 'suboptimal', 'performance', 'in', 'both', 'speed', 'of', 'adaptation', 'and', 'robustness', 'in', 'this', 'paper', 'a', 'new', 'practical', 'approach', 'based', 'on', 'fuzzy', 'rules', 'for', 'online', 'continuous', 'tuning', 'of', 'these', 'coefficients', 'is', 'proposed', 'the', 'fuzzy', 'controller', 'is', 'optimally', 'tuned', 'using', 'particle', 'swarm', 'optimization', 'pso', 'taking', 'into', 'accounts', 'both', 'the', 'tracking', 'error', 'and', 'the', 'controller', 'output', 'signal', 'range', 'the', 'simulation', 'of', 'several', 'examples', 'of', 'systems', 'with', 'moderate', 'to', 'severe', 'nonlinearities', 'demonstrate', 'that', 'the', 'proposed', 'approach', 'offers', 'improved', 'control', 'performance', 'keywords', 'fuzzy', 'logic', 'control', 'singleobjective', 'multiobjective', 'particle', 'swarm', 'optimization', 'l1', 'adaptive', 'control', 'fuzzy', 'l1', 'adaptive', 'controller', 'l1', 'fuzzy', 'adaptive', 'control', 'l1', 'fuzzy', 'adaptive', 'controller', 'fuzzy', 'l1', 'adaptive', 'control', 'filter', 'tuning', 'fuzzy', 'membership', 'function', 'tuning', 'optimal', 'optimal', 'tuning', 'fuzzy', 'membership', 'function', 'optimization', 'robustness', 'adaptation', 'multiinput', 'multioutput', 'singleinput', 'singleoutput', 'estimate', 'pso', 'flc', 'nonlinear', 'adaptive', 'online', 'offline', 'fuzzy', 'adaptive', 'controller', 'fuzzy', 'adaptive', 'control', 'single', 'input', 'single', 'output', 'multi', 'input', 'multi', 'output', 'siso', 'mimo', 'robust', 'uncertain', 'uncertain', 'nonlinear', 'system', 'disturbance', 'unknown', 'adaptive', 'fuzzy', 'control', 'design', 'stable']] | [-0.11928174037157613, 0.010905910869911953, -0.07387609365122283, 0.052010073471704825, -0.13891273904409188, -0.29062963211543713, 0.07432473451310002, 0.44396941640651694, -0.29747492682700066, -0.3475154588912048, 0.162810028087366, -0.17024889555034986, -0.18643869470334704, 0.15565121219831282, -0.15996063426821766, 0.1949119642086432, 0.04370761930431221, -0.0005473906886489953, -0.053593629863062944, -0.25462938487785414, 0.2391767012083209, 0.08910263549746471, 0.30296419530595636, -0.11582929836403505, 0.18558529831615148, 0.05743134518555713, -0.03714108323660113, 0.00999706812686853, -0.09465495037624279, 0.09830218157959263, 0.3125577466464236, 0.17786853958158663, 0.41191955044975176, -0.3463123517877915, -0.18342303093888013, 0.08769267756017107, 0.17339933845671077, 0.015039971761186334, -0.0917050617607767, -0.2808366674582894, 0.1032123500579402, -0.17021196752640547, -0.046219683865852214, -0.11109411833150422, -0.0784683881984914, 0.06525378977665455, -0.40082113109757284, -0.024589724880734496, 0.04221674412415893, 0.062239441898618325, -0.1251255961973905, -0.13209368848177952, 0.020992387379017458, 0.09411752023973831, -0.050092065985332807, -0.011538583661119144, 0.20105858039106334, -0.08274081300843653, -0.1965622295625508, 0.26050330154944723, 0.029711450041983934, -0.3071198503103326, 0.1728282583893423, 0.007311569811666713, -0.09300837214287444, 0.15760030541386383, 0.23845216708951722, 0.0717032334582387, -0.1496780926136268, 0.05358556061446685, 0.03288759216734701, 0.2729457873449314, 0.06296559240869885, 0.0749521242692044, 0.1217340389010953, 0.2542259834624608, 0.15180931123083127, 0.158155403291697, -0.08096017648212557, -0.18644891071370712, -0.2383666078067001, -0.04512111216820046, -0.11213069821287897, -0.0930756949052653, -0.17571298202257787, -0.15846601742840208, 0.34971665621315146, 0.19303094437848045, 0.11539203128332327, 0.07542433807462015, 0.3978730865882016, 0.1497637085744417, 0.05619268646364171, 0.06894268569554768, 0.24470777429238547, 0.0828939436304876, 0.11178203257823399, -0.3030828763518537, 0.07750614875854522, 0.07875379006122696] |
1,802.07252 | Properties of dirty two-bands superconductors with repulsive interband
interaction: normal modes, length scales, vortices and magnetic response | Disorder in two-band superconductors with repulsive interband interaction
induces a frustrated competition between the phase-locking preferences of the
various potential and kinetic terms. This frustrated interaction can result in
the formation of an $s+is$ superconducting state, that breaks the time-reversal
symmetry. In this paper we study the normal modes and their associated
coherence lengths in such materials. We especially focus on the consequences of
the soft modes stemming from the frustration and time-reversal-symmetry
breakdown. We find that two-bands superconductors with such impurity-induced
frustrated interactions display a rich spectrum of physical properties that are
absent in their clean counterparts. It features a mixing of Leggett's and
Anderson-Higgs modes, and a soft mode with diverging coherence length at the
impurity-induced second order phase transition from $s_{\pm}/s_{++}$ states to
the $s+is$ state. Such a soft mode generically results in long-range attractive
intervortex forces that can trigger the formation of vortex clusters. We find
that, if such clusters are formed, their size and internal flux density have a
characteristic temperature dependence that could be probed in
muon-spin-rotation experiments. We also comment on the appearance of
spontaneous magnetic fields due to spatially varying impurities.
| cond-mat.supr-con | disorder in twoband superconductors with repulsive interband interaction induces a frustrated competition between the phaselocking preferences of the various potential and kinetic terms this frustrated interaction can result in the formation of an sis superconducting state that breaks the timereversal symmetry in this paper we study the normal modes and their associated coherence lengths in such materials we especially focus on the consequences of the soft modes stemming from the frustration and timereversalsymmetry breakdown we find that twobands superconductors with such impurityinduced frustrated interactions display a rich spectrum of physical properties that are absent in their clean counterparts it features a mixing of leggetts and andersonhiggs modes and a soft mode with diverging coherence length at the impurityinduced second order phase transition from s_pms_ states to the sis state such a soft mode generically results in longrange attractive intervortex forces that can trigger the formation of vortex clusters we find that if such clusters are formed their size and internal flux density have a characteristic temperature dependence that could be probed in muonspinrotation experiments we also comment on the appearance of spontaneous magnetic fields due to spatially varying impurities | [['disorder', 'in', 'twoband', 'superconductors', 'with', 'repulsive', 'interband', 'interaction', 'induces', 'a', 'frustrated', 'competition', 'between', 'the', 'phaselocking', 'preferences', 'of', 'the', 'various', 'potential', 'and', 'kinetic', 'terms', 'this', 'frustrated', 'interaction', 'can', 'result', 'in', 'the', 'formation', 'of', 'an', 'sis', 'superconducting', 'state', 'that', 'breaks', 'the', 'timereversal', 'symmetry', 'in', 'this', 'paper', 'we', 'study', 'the', 'normal', 'modes', 'and', 'their', 'associated', 'coherence', 'lengths', 'in', 'such', 'materials', 'we', 'especially', 'focus', 'on', 'the', 'consequences', 'of', 'the', 'soft', 'modes', 'stemming', 'from', 'the', 'frustration', 'and', 'timereversalsymmetry', 'breakdown', 'we', 'find', 'that', 'twobands', 'superconductors', 'with', 'such', 'impurityinduced', 'frustrated', 'interactions', 'display', 'a', 'rich', 'spectrum', 'of', 'physical', 'properties', 'that', 'are', 'absent', 'in', 'their', 'clean', 'counterparts', 'it', 'features', 'a', 'mixing', 'of', 'leggetts', 'and', 'andersonhiggs', 'modes', 'and', 'a', 'soft', 'mode', 'with', 'diverging', 'coherence', 'length', 'at', 'the', 'impurityinduced', 'second', 'order', 'phase', 'transition', 'from', 's_pms_', 'states', 'to', 'the', 'sis', 'state', 'such', 'a', 'soft', 'mode', 'generically', 'results', 'in', 'longrange', 'attractive', 'intervortex', 'forces', 'that', 'can', 'trigger', 'the', 'formation', 'of', 'vortex', 'clusters', 'we', 'find', 'that', 'if', 'such', 'clusters', 'are', 'formed', 'their', 'size', 'and', 'internal', 'flux', 'density', 'have', 'a', 'characteristic', 'temperature', 'dependence', 'that', 'could', 'be', 'probed', 'in', 'muonspinrotation', 'experiments', 'we', 'also', 'comment', 'on', 'the', 'appearance', 'of', 'spontaneous', 'magnetic', 'fields', 'due', 'to', 'spatially', 'varying', 'impurities']] | [-0.20664095827576487, 0.2607991615406447, -0.06361023592594538, 0.09294816297652359, -0.06681467632223119, -0.12202354631525406, 0.04732357555916136, 0.3832681139415883, -0.26183850127006036, -0.2602732238815503, 0.023857337287057467, -0.32019908809439934, -0.14791409082790005, 0.10396011781314031, 0.056817283834614964, -0.030411463307632888, -0.03142095429815372, -0.009365869071730908, -0.08932274228526636, -0.1688365021775021, 0.3274264317987353, 0.007804086901237594, 0.320778540925103, 0.1123590076693948, 0.01661023400981534, -0.010753916398785573, 0.10668538652587697, 0.038699650520240846, -0.13989164668655188, 0.026868240215798266, 0.22226571504514606, -0.048756996971512326, 0.18220127769745886, -0.4604207385489915, -0.21088155489315855, 0.09940149044330687, 0.14945352595903852, 0.1627483501797542, -0.06190833886911934, -0.30591970131896, 0.010854540551279454, -0.1612035077327783, -0.12854628080079217, -0.09563831300623318, -0.0009461569937597464, 0.02041841359521718, -0.2513784080102267, 0.13480037443839543, 0.09375448288963216, 0.07768720144187992, -0.06550730458470656, -0.04979172071189362, -0.07907056246891599, 0.06431737765570746, 0.08379820411271871, -0.0032554417563741035, 0.13327901392411615, -0.18086513702044302, -0.11642147619227701, 0.35880871965832256, -0.050079227625169455, -0.11015967564147085, 0.241257441017103, -0.139248890919918, -0.13055864710142798, 0.1607131257856344, 0.14195072921884663, 0.05669019413874187, -0.10058734674462454, 0.04223275601063815, 0.007200664921757824, 0.18784734373169137, 0.03474158987259254, 0.14108130743013733, 0.262585752257245, 0.17735302584751092, 0.016910027119360786, 0.1585949303246688, -0.11947899629670614, -0.08452276850832587, -0.27149610836653315, -0.09947434903191839, -0.20430961938697517, 0.03794297953061958, -0.06410700520094945, -0.17969615225670266, 0.3968318873441139, 0.15570712575386775, 0.21239081609042415, -0.03228071112522578, 0.2116646500913664, 0.09507927349106002, 0.09580059046516483, 0.029871136234934502, 0.27815991421254904, 0.13656251120846719, 0.07209727446349867, -0.31558178269017634, 0.05748917416550536, 0.00047858336697669424] |
1,802.07253 | Neuro-adaptive distributed control with prescribed performance for the
synchronization of unknown nonlinear networked systems | This paper proposes a neuro-adaptive distributive cooperative tracking
control with prescribed performance function (PPF) for highly nonlinear
multi-agent systems. PPF allows error tracking from a predefined large set to
be trapped into a predefined small set. The key idea is to transform the
constrained system into unconstrained one through transformation of the output
error. Agents' dynamics are assumed to be completely unknown, and the
controller is developed for strongly connected structured network. The proposed
controller allows all agents to follow the trajectory of the leader node, while
satisfying necessary dynamic requirements. The proposed approach guarantees
uniform ultimate boundedness of the transformed error and the adaptive neural
network weights. Simulations include two examples to validate the robustness
and smoothness of the proposed controller against highly nonlinear
heterogeneous networked system with time varying uncertain parameters and
external disturbances.
| math.OC cs.SY | this paper proposes a neuroadaptive distributive cooperative tracking control with prescribed performance function ppf for highly nonlinear multiagent systems ppf allows error tracking from a predefined large set to be trapped into a predefined small set the key idea is to transform the constrained system into unconstrained one through transformation of the output error agents dynamics are assumed to be completely unknown and the controller is developed for strongly connected structured network the proposed controller allows all agents to follow the trajectory of the leader node while satisfying necessary dynamic requirements the proposed approach guarantees uniform ultimate boundedness of the transformed error and the adaptive neural network weights simulations include two examples to validate the robustness and smoothness of the proposed controller against highly nonlinear heterogeneous networked system with time varying uncertain parameters and external disturbances | [['this', 'paper', 'proposes', 'a', 'neuroadaptive', 'distributive', 'cooperative', 'tracking', 'control', 'with', 'prescribed', 'performance', 'function', 'ppf', 'for', 'highly', 'nonlinear', 'multiagent', 'systems', 'ppf', 'allows', 'error', 'tracking', 'from', 'a', 'predefined', 'large', 'set', 'to', 'be', 'trapped', 'into', 'a', 'predefined', 'small', 'set', 'the', 'key', 'idea', 'is', 'to', 'transform', 'the', 'constrained', 'system', 'into', 'unconstrained', 'one', 'through', 'transformation', 'of', 'the', 'output', 'error', 'agents', 'dynamics', 'are', 'assumed', 'to', 'be', 'completely', 'unknown', 'and', 'the', 'controller', 'is', 'developed', 'for', 'strongly', 'connected', 'structured', 'network', 'the', 'proposed', 'controller', 'allows', 'all', 'agents', 'to', 'follow', 'the', 'trajectory', 'of', 'the', 'leader', 'node', 'while', 'satisfying', 'necessary', 'dynamic', 'requirements', 'the', 'proposed', 'approach', 'guarantees', 'uniform', 'ultimate', 'boundedness', 'of', 'the', 'transformed', 'error', 'and', 'the', 'adaptive', 'neural', 'network', 'weights', 'simulations', 'include', 'two', 'examples', 'to', 'validate', 'the', 'robustness', 'and', 'smoothness', 'of', 'the', 'proposed', 'controller', 'against', 'highly', 'nonlinear', 'heterogeneous', 'networked', 'system', 'with', 'time', 'varying', 'uncertain', 'parameters', 'and', 'external', 'disturbances']] | [-0.15171797913225257, 0.04205857986337779, -0.04174573474002125, 0.008521596487673163, -0.10970258671338395, -0.2330506071482566, 0.036372836046639885, 0.37962163371198315, -0.3247004696441924, -0.3066123179177178, 0.09989283224293853, -0.19395869385184863, -0.16262665864932763, 0.15443215328474147, -0.1450155908592826, 0.18849753231659314, 0.06729027778868947, 0.024068062101244268, 0.0187371736015741, -0.2609902979833457, 0.31389818337458353, 0.05912322414737633, 0.2958167663138524, -0.05938667138723437, 0.17511653164311772, 0.019247767423033055, -0.0050508089993587316, 0.03209624788210289, -0.07355308886069585, 0.11623040851041236, 0.25595036227605306, 0.15782596709151916, 0.3586424157187781, -0.4282799974316731, -0.1985724751233219, 0.10847005603136495, 0.12072832271609085, 0.0765171620005276, -0.01121179221509545, -0.3470653612029684, 0.11348423998980947, -0.15799595995614416, -0.09285502188482925, -0.09447609330356285, -0.05345645503086202, 0.07898440571486443, -0.35021388877922777, 0.0031444348673015637, 0.05370027727878872, 0.0064030908089240685, -0.11635908163032796, -0.05552184478865991, -0.010889439175918917, 0.1689834388303365, -0.022244606447844383, 0.02370423682184671, 0.18218656104770214, -0.07746867952793014, -0.1063094088980613, 0.36601961613975137, 0.012480632009957096, -0.2840773416477639, 0.1707988949081696, -0.053757386966882384, -0.09772802388761193, 0.1566385889549137, 0.2587858361315311, 0.0763424661332358, -0.1987293867414872, 0.022531901554697576, -0.005760505548952257, 0.21843656345770476, -0.005323714395190644, 0.01916508622440126, 0.1445129322605413, 0.2222114699474974, 0.1534388474366792, 0.14868945542976314, -0.03055470082236913, -0.15190705706225024, -0.2768232211066574, -0.04888254548559951, -0.1589174426943132, -0.03699970985625816, -0.09974283669169595, -0.15554244446513407, 0.40886771410484524, 0.16279316954109269, 0.14640085575143424, 0.13686512048897223, 0.3608810423380312, 0.09493284417604787, 0.05145373719621121, 0.1190820163978702, 0.20777651321944124, 0.09702343152842813, 0.09477484918469974, -0.24202098259496885, 0.12756830439491965, 0.0477077169720467] |
1,802.07254 | Observed Type II supernova colours from the Carnegie Supernova Project-I | We present a study of observed Type II supernova (SN~II) colours using
optical/near-infrared photometric data from the \textit{Carnegie Supernovae
Project-I}. We analyse four colours ($B-V$, $u-g$, $g-r$, and $g-Y$) and find
that SN~II colour curves can be described by two linear regimes during the
photospheric phase. The first ($s_{\rm 1,colour}$) is steeper and has a median
duration of $\sim 40$ days. The second, shallower slope ($s_{\rm 2,colour}$)
lasts until the end of the "plateau" ($\sim 80$ days). The two slopes correlate
in the sense that steeper initial colour curves also imply steeper colour
curves at later phases. As suggested by recent studies, SNe~II form a
continuous population of objects from the colour point of view as well. We
investigate correlations between the observed colours and a range of
photometric and spectroscopic parameters including the absolute magnitude, the
$V$-band light-curve slopes, and metal-line strengths. We find that less
luminous SNe~II appear redder, a trend that we argue is not driven by
uncorrected host-galaxy reddening. While there is significant dispersion, we
find evidence that redder SNe~II (mainly at early epochs) display stronger
metal-line equivalent widths. Host-galaxy reddening does not appear to be a
dominant parameter, neither driving observed trends nor dominating the
dispersion in observed colours. Intrinsic SN~II colours are most probably
dominated by photospheric temperature differences, with progenitor metallicity
possibly playing a minor role. Such temperature differences could be related to
differences in progenitor radius, together with the presence or absence of
circumstellar material close to the progenitor stars.
| astro-ph.HE | we present a study of observed type ii supernova snii colours using opticalnearinfrared photometric data from the textitcarnegie supernovae projecti we analyse four colours bv ug gr and gy and find that snii colour curves can be described by two linear regimes during the photospheric phase the first s_rm 1colour is steeper and has a median duration of sim 40 days the second shallower slope s_rm 2colour lasts until the end of the plateau sim 80 days the two slopes correlate in the sense that steeper initial colour curves also imply steeper colour curves at later phases as suggested by recent studies sneii form a continuous population of objects from the colour point of view as well we investigate correlations between the observed colours and a range of photometric and spectroscopic parameters including the absolute magnitude the vband lightcurve slopes and metalline strengths we find that less luminous sneii appear redder a trend that we argue is not driven by uncorrected hostgalaxy reddening while there is significant dispersion we find evidence that redder sneii mainly at early epochs display stronger metalline equivalent widths hostgalaxy reddening does not appear to be a dominant parameter neither driving observed trends nor dominating the dispersion in observed colours intrinsic snii colours are most probably dominated by photospheric temperature differences with progenitor metallicity possibly playing a minor role such temperature differences could be related to differences in progenitor radius together with the presence or absence of circumstellar material close to the progenitor stars | [['we', 'present', 'a', 'study', 'of', 'observed', 'type', 'ii', 'supernova', 'snii', 'colours', 'using', 'opticalnearinfrared', 'photometric', 'data', 'from', 'the', 'textitcarnegie', 'supernovae', 'projecti', 'we', 'analyse', 'four', 'colours', 'bv', 'ug', 'gr', 'and', 'gy', 'and', 'find', 'that', 'snii', 'colour', 'curves', 'can', 'be', 'described', 'by', 'two', 'linear', 'regimes', 'during', 'the', 'photospheric', 'phase', 'the', 'first', 's_rm', '1colour', 'is', 'steeper', 'and', 'has', 'a', 'median', 'duration', 'of', 'sim', '40', 'days', 'the', 'second', 'shallower', 'slope', 's_rm', '2colour', 'lasts', 'until', 'the', 'end', 'of', 'the', 'plateau', 'sim', '80', 'days', 'the', 'two', 'slopes', 'correlate', 'in', 'the', 'sense', 'that', 'steeper', 'initial', 'colour', 'curves', 'also', 'imply', 'steeper', 'colour', 'curves', 'at', 'later', 'phases', 'as', 'suggested', 'by', 'recent', 'studies', 'sneii', 'form', 'a', 'continuous', 'population', 'of', 'objects', 'from', 'the', 'colour', 'point', 'of', 'view', 'as', 'well', 'we', 'investigate', 'correlations', 'between', 'the', 'observed', 'colours', 'and', 'a', 'range', 'of', 'photometric', 'and', 'spectroscopic', 'parameters', 'including', 'the', 'absolute', 'magnitude', 'the', 'vband', 'lightcurve', 'slopes', 'and', 'metalline', 'strengths', 'we', 'find', 'that', 'less', 'luminous', 'sneii', 'appear', 'redder', 'a', 'trend', 'that', 'we', 'argue', 'is', 'not', 'driven', 'by', 'uncorrected', 'hostgalaxy', 'reddening', 'while', 'there', 'is', 'significant', 'dispersion', 'we', 'find', 'evidence', 'that', 'redder', 'sneii', 'mainly', 'at', 'early', 'epochs', 'display', 'stronger', 'metalline', 'equivalent', 'widths', 'hostgalaxy', 'reddening', 'does', 'not', 'appear', 'to', 'be', 'a', 'dominant', 'parameter', 'neither', 'driving', 'observed', 'trends', 'nor', 'dominating', 'the', 'dispersion', 'in', 'observed', 'colours', 'intrinsic', 'snii', 'colours', 'are', 'most', 'probably', 'dominated', 'by', 'photospheric', 'temperature', 'differences', 'with', 'progenitor', 'metallicity', 'possibly', 'playing', 'a', 'minor', 'role', 'such', 'temperature', 'differences', 'could', 'be', 'related', 'to', 'differences', 'in', 'progenitor', 'radius', 'together', 'with', 'the', 'presence', 'or', 'absence', 'of', 'circumstellar', 'material', 'close', 'to', 'the', 'progenitor', 'stars']] | [-0.033009079315252904, 0.16195452815618336, -0.10516134516063441, 0.14247410227989446, -0.10172633786981063, -0.13119207991985604, 0.054572748139546046, 0.4969280862431156, -0.15025274129087537, -0.3478254323325506, 0.017012223417253603, -0.3167032252607216, -0.051640606328075545, 0.1726505982246229, -0.10765067520664368, -0.07797094144644519, 0.06242903608240081, -0.10559313428944082, -0.08855339219108437, -0.26094133198418373, 0.28673719755956917, -0.016876928038834556, 0.1724770826919807, -0.0540880923144277, -0.004377060192182842, -0.09253982397371797, -0.09408688344670899, 0.02987305443673357, -0.1662618040835792, -0.0359422234047916, 0.2030531670101393, 0.0957148011236232, 0.21237533640616188, -0.32720048633655835, -0.2152291564327642, 0.1572438271884708, 0.18414496584810558, 0.0235153268776622, -0.07113049877736513, -0.19139704732527216, 0.05172028384603015, -0.14616427944009608, -0.1793885918843325, 0.10442554041065609, 0.11040220550087289, 0.020223218406033815, -0.21414140365048637, 0.178886678728452, 0.019085437224560787, 0.15365507739844042, -0.09896869799955105, -0.14991862716425847, -0.1489677374247401, 0.043100964694427764, 0.03575022481627974, 0.07933581951623253, 0.1234217810773904, -0.14353855970368637, -0.0003506471521251388, 0.4012160128875961, -0.10325035667436139, 0.08200274170016704, 0.18617246073587396, -0.17476960248414405, -0.13357702513486602, 0.13851141092287966, 0.10228885349967115, 0.07611105148112629, -0.1479603141608716, -0.03464041689617964, 0.04610402386766154, 0.2369019662327468, 0.041436934814318954, 0.10778580663094085, 0.30133205265605567, 0.06171779396254721, 0.0010963034673169923, 0.0473712721955016, -0.20011630854039356, -0.03250598695273019, -0.2735653194462562, -0.04966995384112546, -0.09836437139561688, 0.09894862194618681, -0.17599165842007577, -0.12911549819362675, 0.343922241635401, 0.0976854831049393, 0.24814764107754966, 0.05976045116303277, 0.25440113063772946, 0.13831827657702342, 0.1449103615307287, 0.12575239602692154, 0.3500338205007639, 0.15045046651304314, 0.09519426116617624, -0.245837682365119, 0.13187125783339823, 0.024429244057434362] |
1,802.07255 | Enhancing the Sensitivity of Searches for Gravitational Waves from
Core-Collapse Supernovae with a Bayesian classification of candidate events | We demonstrate how a morphological veto involving Bayesian statistics can
improve the receiver-operating characteristic (ROC) curves of the current
search for core-collapse supernovae (CCSNe) as implemented by the coherent
Waveburst (cWB) algorithm. Examples involving two implementations of BayesWave
(BW), one that makes no assumption of the polarization state of the
gravitational wave (GW) and one that uses the same elliptical polarization
settings adopted in previous usages for Binary systems are provided on the set
of waveforms currently adopted for the first and second Advanced LIGO (aLIGO)
science runs for the targeted CCSNe search. A comparison of the performance for
all-sky searches versus the targeted searches with optical triggers is
provided. The average cWB+BW ROC range improvements with respect to a fixed
false-alarm rate (FAR) for slowly-rotating waveforms ranged from [+1.30%,
+15.76%] while the improvement for rapidly-rotating waveforms were on the order
of [+1.19%, +22.05%]. The application of BW to CCSN GW triggers also shows a
significant reduction of the FAR while maintaining detection efficiency and
remaining sensitive to a wide range of morphological CCSNe signals. It appears
that the code developed for arbitrarily polarized signals outperforms the
previous code for the GW morphologies tested.
| astro-ph.HE | we demonstrate how a morphological veto involving bayesian statistics can improve the receiveroperating characteristic roc curves of the current search for corecollapse supernovae ccsne as implemented by the coherent waveburst cwb algorithm examples involving two implementations of bayeswave bw one that makes no assumption of the polarization state of the gravitational wave gw and one that uses the same elliptical polarization settings adopted in previous usages for binary systems are provided on the set of waveforms currently adopted for the first and second advanced ligo aligo science runs for the targeted ccsne search a comparison of the performance for allsky searches versus the targeted searches with optical triggers is provided the average cwbbw roc range improvements with respect to a fixed falsealarm rate far for slowlyrotating waveforms ranged from 130 1576 while the improvement for rapidlyrotating waveforms were on the order of 119 2205 the application of bw to ccsn gw triggers also shows a significant reduction of the far while maintaining detection efficiency and remaining sensitive to a wide range of morphological ccsne signals it appears that the code developed for arbitrarily polarized signals outperforms the previous code for the gw morphologies tested | [['we', 'demonstrate', 'how', 'a', 'morphological', 'veto', 'involving', 'bayesian', 'statistics', 'can', 'improve', 'the', 'receiveroperating', 'characteristic', 'roc', 'curves', 'of', 'the', 'current', 'search', 'for', 'corecollapse', 'supernovae', 'ccsne', 'as', 'implemented', 'by', 'the', 'coherent', 'waveburst', 'cwb', 'algorithm', 'examples', 'involving', 'two', 'implementations', 'of', 'bayeswave', 'bw', 'one', 'that', 'makes', 'no', 'assumption', 'of', 'the', 'polarization', 'state', 'of', 'the', 'gravitational', 'wave', 'gw', 'and', 'one', 'that', 'uses', 'the', 'same', 'elliptical', 'polarization', 'settings', 'adopted', 'in', 'previous', 'usages', 'for', 'binary', 'systems', 'are', 'provided', 'on', 'the', 'set', 'of', 'waveforms', 'currently', 'adopted', 'for', 'the', 'first', 'and', 'second', 'advanced', 'ligo', 'aligo', 'science', 'runs', 'for', 'the', 'targeted', 'ccsne', 'search', 'a', 'comparison', 'of', 'the', 'performance', 'for', 'allsky', 'searches', 'versus', 'the', 'targeted', 'searches', 'with', 'optical', 'triggers', 'is', 'provided', 'the', 'average', 'cwbbw', 'roc', 'range', 'improvements', 'with', 'respect', 'to', 'a', 'fixed', 'falsealarm', 'rate', 'far', 'for', 'slowlyrotating', 'waveforms', 'ranged', 'from', '130', '1576', 'while', 'the', 'improvement', 'for', 'rapidlyrotating', 'waveforms', 'were', 'on', 'the', 'order', 'of', '119', '2205', 'the', 'application', 'of', 'bw', 'to', 'ccsn', 'gw', 'triggers', 'also', 'shows', 'a', 'significant', 'reduction', 'of', 'the', 'far', 'while', 'maintaining', 'detection', 'efficiency', 'and', 'remaining', 'sensitive', 'to', 'a', 'wide', 'range', 'of', 'morphological', 'ccsne', 'signals', 'it', 'appears', 'that', 'the', 'code', 'developed', 'for', 'arbitrarily', 'polarized', 'signals', 'outperforms', 'the', 'previous', 'code', 'for', 'the', 'gw', 'morphologies', 'tested']] | [-0.11530153957452664, 0.04348700424937609, -0.026855114350231208, 0.11027901761614582, -0.08697247578796426, -0.10329789239403908, 0.07186558689257556, 0.36678052828938235, -0.16765345481447488, -0.32204437523523666, 0.09405039341254451, -0.3004967054487982, -0.07842608487650675, 0.30717212032808067, 0.007378644883184886, 0.06253889349560875, 0.1246377514495786, -0.015122175791475456, -0.105913351040878, -0.2619856213083646, 0.2443602314669988, 0.11737503496018083, 0.2469581031909911, -0.046052462013904005, 0.08215421672624264, 0.008009847605611261, -0.07466099681035605, -0.04811616410188435, -0.09482812592671053, 0.04787040459632408, 0.2784209298976445, 0.20232978729958026, 0.20438735529508753, -0.3458752801573913, -0.2404363503762094, 0.10990587871250075, 0.11768691669340114, 0.10959057118210087, -0.07304836014372995, -0.2933835266485403, 0.1238615410256898, -0.22173512811787077, -0.07369980404473608, -0.017154121720295734, 0.038019404516641465, 0.07767011508197659, -0.2807182088242068, 0.062382415387067645, 0.019019121731616906, 0.03162733479499972, -0.043011402061286695, -0.13991803583242776, 0.005182698147109477, 0.07227299781758727, 0.02616057969983861, 0.07644316381902172, 0.13940521243497037, -0.1318006496264085, -0.1417413680901518, 0.3936114056268707, -0.07839402611049688, -0.10580271011349396, 0.21950067211643423, -0.12901075701483933, -0.12399283062162188, 0.17818206971060135, 0.1787530592021843, 0.12435620951994981, -0.14198682576049274, 0.0003285520012165459, 0.06649305873732676, 0.21156740451745767, 0.08517662221129285, 0.054173012688503754, 0.235034146833641, 0.17772318731537476, 0.03424261132749962, 0.10864689776947974, -0.1986633039972124, -0.035038581074938215, -0.28055103519606445, -0.09108414443714234, -0.1434006199306168, 0.020814145721412085, -0.08766999829799715, -0.12327546248585956, 0.41888107684402104, 0.14314707231642387, 0.09984452423062369, 0.0618537941275766, 0.3044018260649561, 0.03928623912550696, 0.07875401079460669, 0.07400507595593808, 0.34787100485603634, 0.0862055396452585, 0.09133277573467542, -0.18910261592842895, 0.08638784785580356, -0.014135490913758986] |
1,802.07256 | Hampering G\"{o}rtler vortices via optimal control in the framework of
nonlinear boundary region equations | The control of stream-wise vortices in high Reynolds number boundary layer
flows often aims at reducing the vortex energy as a means of mitigating the
growth of secondary instabilities, which eventually delay the transition from
laminar to turbulent flow. In this paper, we aim at utilizing such an energy
reduction strategy using optimal control theory to limit the growth of
G\"{o}rtler vortices developing in an incompressible laminar boundary layer
flow over a concave wall, and excited by a row of roughness elements with
span-wise separation in the same order of magnitude as the boundary layer
thickness. Commensurate with control theory formalism, we transform a
constrained optimization problem into an unconstrained one by applying the
method of Lagrange multipliers. A high Reynolds number asymptotic framework is
utilized, wherein the Navier-Stokes equations are reduced to the boundary
region equations (BRE), in which wall deformations enter the problem through an
appropriate Prandtl transformation. In the optimal control strategy, the wall
displacement or the wall transpiration velocity serve as control variables,
while the cost functional is defined in terms of the wall shear stress. Our
numerical results indicate, among other things, that the optimal control
algorithm is very effective in reducing the amplitude of the G\"{o}rtler
vortices, especially for the control based on wall displacement.
| physics.flu-dyn | the control of streamwise vortices in high reynolds number boundary layer flows often aims at reducing the vortex energy as a means of mitigating the growth of secondary instabilities which eventually delay the transition from laminar to turbulent flow in this paper we aim at utilizing such an energy reduction strategy using optimal control theory to limit the growth of gortler vortices developing in an incompressible laminar boundary layer flow over a concave wall and excited by a row of roughness elements with spanwise separation in the same order of magnitude as the boundary layer thickness commensurate with control theory formalism we transform a constrained optimization problem into an unconstrained one by applying the method of lagrange multipliers a high reynolds number asymptotic framework is utilized wherein the navierstokes equations are reduced to the boundary region equations bre in which wall deformations enter the problem through an appropriate prandtl transformation in the optimal control strategy the wall displacement or the wall transpiration velocity serve as control variables while the cost functional is defined in terms of the wall shear stress our numerical results indicate among other things that the optimal control algorithm is very effective in reducing the amplitude of the gortler vortices especially for the control based on wall displacement | [['the', 'control', 'of', 'streamwise', 'vortices', 'in', 'high', 'reynolds', 'number', 'boundary', 'layer', 'flows', 'often', 'aims', 'at', 'reducing', 'the', 'vortex', 'energy', 'as', 'a', 'means', 'of', 'mitigating', 'the', 'growth', 'of', 'secondary', 'instabilities', 'which', 'eventually', 'delay', 'the', 'transition', 'from', 'laminar', 'to', 'turbulent', 'flow', 'in', 'this', 'paper', 'we', 'aim', 'at', 'utilizing', 'such', 'an', 'energy', 'reduction', 'strategy', 'using', 'optimal', 'control', 'theory', 'to', 'limit', 'the', 'growth', 'of', 'gortler', 'vortices', 'developing', 'in', 'an', 'incompressible', 'laminar', 'boundary', 'layer', 'flow', 'over', 'a', 'concave', 'wall', 'and', 'excited', 'by', 'a', 'row', 'of', 'roughness', 'elements', 'with', 'spanwise', 'separation', 'in', 'the', 'same', 'order', 'of', 'magnitude', 'as', 'the', 'boundary', 'layer', 'thickness', 'commensurate', 'with', 'control', 'theory', 'formalism', 'we', 'transform', 'a', 'constrained', 'optimization', 'problem', 'into', 'an', 'unconstrained', 'one', 'by', 'applying', 'the', 'method', 'of', 'lagrange', 'multipliers', 'a', 'high', 'reynolds', 'number', 'asymptotic', 'framework', 'is', 'utilized', 'wherein', 'the', 'navierstokes', 'equations', 'are', 'reduced', 'to', 'the', 'boundary', 'region', 'equations', 'bre', 'in', 'which', 'wall', 'deformations', 'enter', 'the', 'problem', 'through', 'an', 'appropriate', 'prandtl', 'transformation', 'in', 'the', 'optimal', 'control', 'strategy', 'the', 'wall', 'displacement', 'or', 'the', 'wall', 'transpiration', 'velocity', 'serve', 'as', 'control', 'variables', 'while', 'the', 'cost', 'functional', 'is', 'defined', 'in', 'terms', 'of', 'the', 'wall', 'shear', 'stress', 'our', 'numerical', 'results', 'indicate', 'among', 'other', 'things', 'that', 'the', 'optimal', 'control', 'algorithm', 'is', 'very', 'effective', 'in', 'reducing', 'the', 'amplitude', 'of', 'the', 'gortler', 'vortices', 'especially', 'for', 'the', 'control', 'based', 'on', 'wall', 'displacement']] | [-0.16942511904519603, 0.15013173526683735, -0.09030226059257984, -0.0122278975400085, -0.06183807533432981, -0.09710164457091718, 0.025501751689068198, 0.29990482739431085, -0.3327144839496339, -0.2942062704277697, 0.13040521399060626, -0.2152479593377225, -0.11006135622732412, 0.1758837955970741, -0.069673156088921, 0.11472328996365246, 0.00794327204166448, -0.01193521498974608, -0.03042869879648981, -0.1925647005933156, 0.28732940895644005, 0.028393635813199796, 0.3285001506399964, 0.02577846200907188, 0.1002384152735685, -0.022093985062004266, 0.014490798442355264, 0.06638647968907316, -0.16856211876035013, 0.08237843728024001, 0.24271781941306428, -0.01113422383373312, 0.30362713772150296, -0.4861640299171633, -0.21634303866411114, 0.021084139720532354, 0.18839966630015823, 0.09839307020972284, -0.027572534976182814, -0.23182392019946216, 0.07798674075877497, -0.14400491325882092, -0.1461584090380168, -0.0043495742050198155, -0.011286731105368425, 0.04217012788713093, -0.30146677536068933, 0.10788525687135804, 0.02937409470533131, 0.08009403431567394, -0.13093855214124253, -0.0726549841962331, -0.078759266640682, 0.1116745086945152, 0.10054138393011121, 0.04252854317329577, 0.17011433414523425, -0.18550143309348038, -0.05290515493806805, 0.35424448668038677, -0.03300141491783756, -0.26348922525695856, 0.15407934232164722, -0.10273409028365431, -0.03549496171845926, 0.19069249937597715, 0.20091539291197089, 0.12777422663137225, -0.10437121301871764, 0.03730759627634871, -0.030777291569117262, 0.15260543511856028, 0.10656457376044014, -0.03541262624829442, 0.1818856777624951, 0.2153913255491828, 0.16167307748807974, 0.15549648120010082, -0.09657950180150145, -0.10979729375837291, -0.3179776900209557, -0.1384998219863351, -0.16873661192217887, -0.013720157205334631, -0.12058321954796954, -0.1711077761540622, 0.35543852814106863, 0.11517756248237256, 0.1618601623496374, 0.0358893805309265, 0.31532478657834145, 0.14718662881870617, 0.06508137030147404, 0.11656663256754737, 0.2350126034050509, 0.15172635309919008, 0.14658125659717927, -0.2867415825498701, 0.03543218526486042, 0.12385625091615306] |
1,802.07257 | Predicting Natural Hazards with Neuronal Networks | Gravitational mass flows, such as avalanches, debris flows and rockfalls are
common events in alpine regions with high impact on transport routes. Within
the last few decades, hazard zone maps have been developed to systematically
approach this threat. These maps mark vulnerable zones in habitable areas to
allow effective planning of hazard mitigation measures and development of
settlements. Hazard zone maps have shown to be an effective tool to reduce
fatalities during extreme events. They are created in a complex process, based
on experience, empirical models, physical simulations and historical data. The
generation of such maps is therefore expensive and limited to crucially
important regions, e.g. permanently inhabited areas.
In this work we interpret the task of hazard zone mapping as a classification
problem. Every point in a specific area has to be classified according to its
vulnerability. On a regional scale this leads to a segmentation problem, where
the total area has to be divided in the respective hazard zones. The recent
developments in artificial intelligence, namely convolutional neuronal
networks, have led to major improvement in a very similar task, image
classification and semantic segmentation, i.e. computer vision. We use a
convolutional neuronal network to identify terrain formations with the
potential for catastrophic snow avalanches and label points in their reach as
vulnerable. Repeating this procedure for all points allows us to generate an
artificial hazard zone map. We demonstrate that the approach is feasible and
promising based on the hazard zone map of the Tirolean Oberland. However, more
training data and further improvement of the method is required before such
techniques can be applied reliably.
| eess.IV cs.AI | gravitational mass flows such as avalanches debris flows and rockfalls are common events in alpine regions with high impact on transport routes within the last few decades hazard zone maps have been developed to systematically approach this threat these maps mark vulnerable zones in habitable areas to allow effective planning of hazard mitigation measures and development of settlements hazard zone maps have shown to be an effective tool to reduce fatalities during extreme events they are created in a complex process based on experience empirical models physical simulations and historical data the generation of such maps is therefore expensive and limited to crucially important regions eg permanently inhabited areas in this work we interpret the task of hazard zone mapping as a classification problem every point in a specific area has to be classified according to its vulnerability on a regional scale this leads to a segmentation problem where the total area has to be divided in the respective hazard zones the recent developments in artificial intelligence namely convolutional neuronal networks have led to major improvement in a very similar task image classification and semantic segmentation ie computer vision we use a convolutional neuronal network to identify terrain formations with the potential for catastrophic snow avalanches and label points in their reach as vulnerable repeating this procedure for all points allows us to generate an artificial hazard zone map we demonstrate that the approach is feasible and promising based on the hazard zone map of the tirolean oberland however more training data and further improvement of the method is required before such techniques can be applied reliably | [['gravitational', 'mass', 'flows', 'such', 'as', 'avalanches', 'debris', 'flows', 'and', 'rockfalls', 'are', 'common', 'events', 'in', 'alpine', 'regions', 'with', 'high', 'impact', 'on', 'transport', 'routes', 'within', 'the', 'last', 'few', 'decades', 'hazard', 'zone', 'maps', 'have', 'been', 'developed', 'to', 'systematically', 'approach', 'this', 'threat', 'these', 'maps', 'mark', 'vulnerable', 'zones', 'in', 'habitable', 'areas', 'to', 'allow', 'effective', 'planning', 'of', 'hazard', 'mitigation', 'measures', 'and', 'development', 'of', 'settlements', 'hazard', 'zone', 'maps', 'have', 'shown', 'to', 'be', 'an', 'effective', 'tool', 'to', 'reduce', 'fatalities', 'during', 'extreme', 'events', 'they', 'are', 'created', 'in', 'a', 'complex', 'process', 'based', 'on', 'experience', 'empirical', 'models', 'physical', 'simulations', 'and', 'historical', 'data', 'the', 'generation', 'of', 'such', 'maps', 'is', 'therefore', 'expensive', 'and', 'limited', 'to', 'crucially', 'important', 'regions', 'eg', 'permanently', 'inhabited', 'areas', 'in', 'this', 'work', 'we', 'interpret', 'the', 'task', 'of', 'hazard', 'zone', 'mapping', 'as', 'a', 'classification', 'problem', 'every', 'point', 'in', 'a', 'specific', 'area', 'has', 'to', 'be', 'classified', 'according', 'to', 'its', 'vulnerability', 'on', 'a', 'regional', 'scale', 'this', 'leads', 'to', 'a', 'segmentation', 'problem', 'where', 'the', 'total', 'area', 'has', 'to', 'be', 'divided', 'in', 'the', 'respective', 'hazard', 'zones', 'the', 'recent', 'developments', 'in', 'artificial', 'intelligence', 'namely', 'convolutional', 'neuronal', 'networks', 'have', 'led', 'to', 'major', 'improvement', 'in', 'a', 'very', 'similar', 'task', 'image', 'classification', 'and', 'semantic', 'segmentation', 'ie', 'computer', 'vision', 'we', 'use', 'a', 'convolutional', 'neuronal', 'network', 'to', 'identify', 'terrain', 'formations', 'with', 'the', 'potential', 'for', 'catastrophic', 'snow', 'avalanches', 'and', 'label', 'points', 'in', 'their', 'reach', 'as', 'vulnerable', 'repeating', 'this', 'procedure', 'for', 'all', 'points', 'allows', 'us', 'to', 'generate', 'an', 'artificial', 'hazard', 'zone', 'map', 'we', 'demonstrate', 'that', 'the', 'approach', 'is', 'feasible', 'and', 'promising', 'based', 'on', 'the', 'hazard', 'zone', 'map', 'of', 'the', 'tirolean', 'oberland', 'however', 'more', 'training', 'data', 'and', 'further', 'improvement', 'of', 'the', 'method', 'is', 'required', 'before', 'such', 'techniques', 'can', 'be', 'applied', 'reliably']] | [-0.06304478128599426, 0.057613720183519145, -0.06489718490929315, 0.08648621512776172, -0.07096118171466514, -0.09629799240836732, 0.07626767957514279, 0.40784489491488785, -0.24598284304727602, -0.31803745187988336, 0.14857274345316304, -0.27157795095775905, -0.19429498018210076, 0.21777467196807265, -0.16601631005819814, 0.09202832779093031, 0.08202919894018013, 0.00011283828026727971, -0.003751159108078079, -0.26013202149470366, 0.28905779932304565, 0.09009305249359882, 0.2991087683661714, 0.04997978800868926, 0.07438933940570816, -0.05765219389506841, -0.04860619481857584, -0.005476539484279232, -0.09818186811414555, 0.106692146775348, 0.3374013177647502, 0.17242125564371236, 0.3199979306717234, -0.46495519718982076, -0.2827271727719838, 0.1348731423151383, 0.14229454953419918, 0.07883993467928094, -0.01213032116516622, -0.2972389972860445, 0.054919836859687966, -0.18596780270331004, -0.07629296550117998, -0.07010622611701503, 0.05425927777612356, 0.0042251761009207585, -0.2587887522540493, 0.03535635341827539, 0.02854714488388378, 0.0963317945351071, -0.045372713513092036, -0.0718163423130825, -0.02645232765258477, 0.19784582614727586, 0.052587634015005526, 0.06508686628623048, 0.19309744213497845, -0.1320811748673529, -0.10982719968485595, 0.36912340913885133, -0.012754103826768132, -0.1840207931906634, 0.22576609863829095, -0.092149134286129, -0.15775547938943474, 0.14665679974925958, 0.25034672536011465, 0.08789327893155684, -0.1602702193547774, -0.014493423217517733, 0.011101992310476348, 0.10566782299660686, 0.07053502859564491, -0.036167300007284874, 0.2737974437609823, 0.2321429269271021, 0.11208681306831722, 0.10956272555984359, -0.17152559389533603, -0.06755948773317152, -0.20050709838202843, -0.11186105680782489, -0.1433958662378383, -0.020912546317876233, -0.060583544585934956, -0.1712057712671098, 0.39325903852427885, 0.21914033970719946, 0.20378774261828794, 0.025740247877723905, 0.289660299362202, 0.06067942440153495, 0.14324790740537344, 0.07013971095148008, 0.20689152237460032, 0.042610888507845106, 0.11515056071132704, -0.13185446101697657, 0.12463704243771534, 0.026306040872551614] |
1,802.07258 | Rank dynamics of word usage at multiple scales | The recent dramatic increase in online data availability has allowed
researchers to explore human culture with unprecedented detail, such as the
growth and diversification of language. In particular, it provides statistical
tools to explore whether word use is similar across languages, and if so,
whether these generic features appear at different scales of language
structure. Here we use the Google Books $N$-grams dataset to analyze the
temporal evolution of word usage in several languages. We apply measures
proposed recently to study rank dynamics, such as the diversity of $N$-grams in
a given rank, the probability that an $N$-gram changes rank between successive
time intervals, the rank entropy, and the rank complexity. Using different
methods, results show that there are generic properties for different languages
at different scales, such as a core of words necessary to minimally understand
a language. We also propose a null model to explore the relevance of linguistic
structure across multiple scales, concluding that $N$-gram statistics cannot be
reduced to word statistics. We expect our results to be useful in improving
text prediction algorithms, as well as in shedding light on the large-scale
features of language use, beyond linguistic and cultural differences across
human populations.
| physics.soc-ph | the recent dramatic increase in online data availability has allowed researchers to explore human culture with unprecedented detail such as the growth and diversification of language in particular it provides statistical tools to explore whether word use is similar across languages and if so whether these generic features appear at different scales of language structure here we use the google books ngrams dataset to analyze the temporal evolution of word usage in several languages we apply measures proposed recently to study rank dynamics such as the diversity of ngrams in a given rank the probability that an ngram changes rank between successive time intervals the rank entropy and the rank complexity using different methods results show that there are generic properties for different languages at different scales such as a core of words necessary to minimally understand a language we also propose a null model to explore the relevance of linguistic structure across multiple scales concluding that ngram statistics cannot be reduced to word statistics we expect our results to be useful in improving text prediction algorithms as well as in shedding light on the largescale features of language use beyond linguistic and cultural differences across human populations | [['the', 'recent', 'dramatic', 'increase', 'in', 'online', 'data', 'availability', 'has', 'allowed', 'researchers', 'to', 'explore', 'human', 'culture', 'with', 'unprecedented', 'detail', 'such', 'as', 'the', 'growth', 'and', 'diversification', 'of', 'language', 'in', 'particular', 'it', 'provides', 'statistical', 'tools', 'to', 'explore', 'whether', 'word', 'use', 'is', 'similar', 'across', 'languages', 'and', 'if', 'so', 'whether', 'these', 'generic', 'features', 'appear', 'at', 'different', 'scales', 'of', 'language', 'structure', 'here', 'we', 'use', 'the', 'google', 'books', 'ngrams', 'dataset', 'to', 'analyze', 'the', 'temporal', 'evolution', 'of', 'word', 'usage', 'in', 'several', 'languages', 'we', 'apply', 'measures', 'proposed', 'recently', 'to', 'study', 'rank', 'dynamics', 'such', 'as', 'the', 'diversity', 'of', 'ngrams', 'in', 'a', 'given', 'rank', 'the', 'probability', 'that', 'an', 'ngram', 'changes', 'rank', 'between', 'successive', 'time', 'intervals', 'the', 'rank', 'entropy', 'and', 'the', 'rank', 'complexity', 'using', 'different', 'methods', 'results', 'show', 'that', 'there', 'are', 'generic', 'properties', 'for', 'different', 'languages', 'at', 'different', 'scales', 'such', 'as', 'a', 'core', 'of', 'words', 'necessary', 'to', 'minimally', 'understand', 'a', 'language', 'we', 'also', 'propose', 'a', 'null', 'model', 'to', 'explore', 'the', 'relevance', 'of', 'linguistic', 'structure', 'across', 'multiple', 'scales', 'concluding', 'that', 'ngram', 'statistics', 'can', 'not', 'be', 'reduced', 'to', 'word', 'statistics', 'we', 'expect', 'our', 'results', 'to', 'be', 'useful', 'in', 'improving', 'text', 'prediction', 'algorithms', 'as', 'well', 'as', 'in', 'shedding', 'light', 'on', 'the', 'largescale', 'features', 'of', 'language', 'use', 'beyond', 'linguistic', 'and', 'cultural', 'differences', 'across', 'human', 'populations']] | [-0.03044687025483005, 0.07358605664344235, -0.07669454551039816, 0.16229496583612824, -0.11544301822528842, -0.11525122720476745, 0.0586758765939567, 0.42077426153501896, -0.3188954400003656, -0.31543361861024743, 0.057050686506273686, -0.2799466667546488, -0.1771630917900434, 0.19452251510691113, -0.0961400248372375, 0.03113723547407309, 0.07159746056375792, 0.08820253444704504, -0.06906060135722085, -0.27951367734580407, 0.32103923263131223, 0.052136173443728354, 0.31668673413361065, 0.04479524159298545, 0.07744173013637938, -0.045212503337774, -0.0627092789605859, 0.01709601420782806, -0.10459413560368115, 0.1344158455279984, 0.3532594094853193, 0.2431895088324857, 0.30922626817467896, -0.40632129007547946, -0.22024399996852156, 0.08917273807540611, 0.14257151189133824, 0.11534038010338818, 0.001934895259164386, -0.2851984449217667, 0.09173573249595324, -0.1890718409909759, -0.02574330637109789, -0.12114310902707166, 0.04239350994264979, 0.025022679975258665, -0.1976800641371405, 0.0390342162457241, 0.0582547543465684, 0.1163184697068198, -0.007827473123412785, -0.1004466702365995, 0.0076033058903886746, 0.19613137677424217, 0.09750046000737538, 0.007355744123281022, 0.11507516825833737, -0.12719858202137915, -0.1749164789175643, 0.3825435403584685, -0.07745791599154472, -0.21165767496442375, 0.26553384844452405, -0.1285992538341176, -0.18525883543946262, 0.03682192041065974, 0.23101050031298875, 0.04333689461895686, -0.1287356592561516, 0.04392088523184899, -0.036327117586031035, 0.2418410760916807, 0.11213755921399848, 0.048549598504686216, 0.21019369384376846, 0.21563071778498066, -0.005893730097473716, 0.11952789426762517, -0.06158413293060084, -0.059372105133771225, -0.21463125256438922, -0.13943924886834383, -0.14371726860938097, -0.01904460723064641, -0.12912032898514292, -0.18559774490138845, 0.4288076366480421, 0.2211642817236675, 0.17655206170756763, 0.10293129922885882, 0.2592682977342725, 0.017609993763380315, 0.09093359873709667, 0.07762786371741051, 0.11459737717017213, 0.02145345213275459, 0.1166616626172771, -0.17068107495664728, 0.10372286071636991, 0.03431642244401184] |
1,802.07259 | Multigrid Renormalization | We combine the multigrid (MG) method with state-of-the-art concepts from the
variational formulation of the numerical renormalization group. The resulting
MG renormalization (MGR) method is a natural generalization of the MG method
for solving partial differential equations. When the solution on a grid of $N$
points is sought, our MGR method has a computational cost scaling as
$\mathcal{O}(\log(N))$, as opposed to $\mathcal{O}(N)$ for the best standard MG
method. Therefore MGR can exponentially speed up standard MG computations. To
illustrate our method, we develop a novel algorithm for the ground state
computation of the nonlinear Schr\"{o}dinger equation. Our algorithm acts
variationally on tensor products and updates the tensors one after another by
solving a local nonlinear optimization problem. We compare several different
methods for the nonlinear tensor update and find that the Newton method is the
most efficient as well as precise. The combination of MGR with our nonlinear
ground state algorithm produces accurate results for the nonlinear
Schr\"{o}dinger equation on $N = 10^{18}$ grid points in three spatial
dimensions.
| physics.comp-ph quant-ph | we combine the multigrid mg method with stateoftheart concepts from the variational formulation of the numerical renormalization group the resulting mg renormalization mgr method is a natural generalization of the mg method for solving partial differential equations when the solution on a grid of n points is sought our mgr method has a computational cost scaling as mathcalologn as opposed to mathcalon for the best standard mg method therefore mgr can exponentially speed up standard mg computations to illustrate our method we develop a novel algorithm for the ground state computation of the nonlinear schrodinger equation our algorithm acts variationally on tensor products and updates the tensors one after another by solving a local nonlinear optimization problem we compare several different methods for the nonlinear tensor update and find that the newton method is the most efficient as well as precise the combination of mgr with our nonlinear ground state algorithm produces accurate results for the nonlinear schrodinger equation on n 1018 grid points in three spatial dimensions | [['we', 'combine', 'the', 'multigrid', 'mg', 'method', 'with', 'stateoftheart', 'concepts', 'from', 'the', 'variational', 'formulation', 'of', 'the', 'numerical', 'renormalization', 'group', 'the', 'resulting', 'mg', 'renormalization', 'mgr', 'method', 'is', 'a', 'natural', 'generalization', 'of', 'the', 'mg', 'method', 'for', 'solving', 'partial', 'differential', 'equations', 'when', 'the', 'solution', 'on', 'a', 'grid', 'of', 'n', 'points', 'is', 'sought', 'our', 'mgr', 'method', 'has', 'a', 'computational', 'cost', 'scaling', 'as', 'mathcalologn', 'as', 'opposed', 'to', 'mathcalon', 'for', 'the', 'best', 'standard', 'mg', 'method', 'therefore', 'mgr', 'can', 'exponentially', 'speed', 'up', 'standard', 'mg', 'computations', 'to', 'illustrate', 'our', 'method', 'we', 'develop', 'a', 'novel', 'algorithm', 'for', 'the', 'ground', 'state', 'computation', 'of', 'the', 'nonlinear', 'schrodinger', 'equation', 'our', 'algorithm', 'acts', 'variationally', 'on', 'tensor', 'products', 'and', 'updates', 'the', 'tensors', 'one', 'after', 'another', 'by', 'solving', 'a', 'local', 'nonlinear', 'optimization', 'problem', 'we', 'compare', 'several', 'different', 'methods', 'for', 'the', 'nonlinear', 'tensor', 'update', 'and', 'find', 'that', 'the', 'newton', 'method', 'is', 'the', 'most', 'efficient', 'as', 'well', 'as', 'precise', 'the', 'combination', 'of', 'mgr', 'with', 'our', 'nonlinear', 'ground', 'state', 'algorithm', 'produces', 'accurate', 'results', 'for', 'the', 'nonlinear', 'schrodinger', 'equation', 'on', 'n', '1018', 'grid', 'points', 'in', 'three', 'spatial', 'dimensions']] | [-0.05943899746697363, 0.008621054395223923, -0.06620727971174001, 0.02868209813147717, -0.07516560268898805, -0.1605345986844484, 0.013722339112843786, 0.3629561861023484, -0.2662977766906676, -0.3256949088314459, 0.09545054285540357, -0.27784190580825363, -0.1717457838619469, 0.21029371533534555, -0.007437617892026624, 0.09665416123399544, 0.09256404672383464, 0.038131020486443526, -0.10606808942455766, -0.2662480293795289, 0.294537074081572, 0.01620357797115243, 0.2577200521648462, -0.008841658065128806, 0.13398182636869715, -0.03681702267966189, -0.013071807242730367, 0.07190644822549075, -0.07622125548875504, 0.137594596662287, 0.22722631037963548, 0.14295495728653068, 0.3133171598116557, -0.4116218139617039, -0.21697757185237215, 0.05264729713477815, 0.13494333930291413, 0.16592049843443202, -0.02514184290512709, -0.2829771174140097, 0.08130822182145148, -0.1291782770061954, -0.13925814318991753, -0.13719580747835738, -0.028887860111093948, -0.0037697229113074996, -0.3008602678642741, 0.07458136633725926, 0.011469057132628569, 0.0030793762018999716, -0.07073273955445204, -0.15507525586456591, 0.010494774822117983, 0.058659528506333505, -0.0022624074800617, 0.026826400057567906, 0.08343230364178973, -0.08042396847962491, -0.11138294476162021, 0.39931597507425715, -0.11214745241782761, -0.2359334042384511, 0.14382868690881878, -0.021034376360365144, -0.1266661402630797, 0.1398108843201217, 0.19069874109256835, 0.2065838552883915, -0.09705425395778937, 0.12802311337006922, -0.03058214940635177, 0.1652806746729073, -0.0012412815509984891, -0.02529107064418938, 0.06570863169534798, 0.18150346839268292, 0.15849260489423095, 0.07979443760372565, -0.04147399912749063, -0.1131657902650269, -0.3010402177238748, -0.1812616278717282, -0.19869911434528018, 0.034238384439266245, -0.17121262420065855, -0.16702722680998877, 0.3978956602624662, 0.15036467742590634, 0.1702650570971725, 0.07259576748834834, 0.3234375753949973, 0.15123480362152414, 0.015547179228936633, 0.11131253897301144, 0.17873913004240466, 0.1495883356602419, 0.1022086799022786, -0.2799645274506128, 0.01111723740939938, 0.18590655440043302] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.