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.0866 | A Semantic Framework for the Security Analysis of Ethereum smart
contracts | Smart contracts are programs running on cryptocurrency (e.g., Ethereum)
blockchains, whose popularity stem from the possibility to perform financial
transactions, such as payments and auctions, in a distributed environment
without need for any trusted third party. Given their financial nature, bugs or
vulnerabilities in these programs may lead to catastrophic consequences, as
witnessed by recent attacks. Unfortunately, programming smart contracts is a
delicate task that requires strong expertise: Ethereum smart contracts are
written in Solidity, a dedicated language resembling JavaScript, and shipped
over the blockchain in the EVM bytecode format. In order to rigorously verify
the security of smart contracts, it is of paramount importance to formalize
their semantics as well as the security properties of interest, in particular
at the level of the bytecode being executed.
In this paper, we present the first complete small-step semantics of EVM
bytecode, which we formalize in the F* proof assistant, obtaining executable
code that we successfully validate against the official Ethereum test suite.
Furthermore, we formally define for the first time a number of central security
properties for smart contracts, such as call integrity, atomicity, and
independence from miner controlled parameters. This formalization relies on a
combination of hyper- and safety properties. Along this work, we identified
various mistakes and imprecisions in existing semantics and verification tools
for Ethereum smart contracts, thereby demonstrating once more the importance of
rigorous semantic foundations for the design of security verification
techniques.
| cs.CR | smart contracts are programs running on cryptocurrency eg ethereum blockchains whose popularity stem from the possibility to perform financial transactions such as payments and auctions in a distributed environment without need for any trusted third party given their financial nature bugs or vulnerabilities in these programs may lead to catastrophic consequences as witnessed by recent attacks unfortunately programming smart contracts is a delicate task that requires strong expertise ethereum smart contracts are written in solidity a dedicated language resembling javascript and shipped over the blockchain in the evm bytecode format in order to rigorously verify the security of smart contracts it is of paramount importance to formalize their semantics as well as the security properties of interest in particular at the level of the bytecode being executed in this paper we present the first complete smallstep semantics of evm bytecode which we formalize in the f proof assistant obtaining executable code that we successfully validate against the official ethereum test suite furthermore we formally define for the first time a number of central security properties for smart contracts such as call integrity atomicity and independence from miner controlled parameters this formalization relies on a combination of hyper and safety properties along this work we identified various mistakes and imprecisions in existing semantics and verification tools for ethereum smart contracts thereby demonstrating once more the importance of rigorous semantic foundations for the design of security verification techniques | [['smart', 'contracts', 'are', 'programs', 'running', 'on', 'cryptocurrency', 'eg', 'ethereum', 'blockchains', 'whose', 'popularity', 'stem', 'from', 'the', 'possibility', 'to', 'perform', 'financial', 'transactions', 'such', 'as', 'payments', 'and', 'auctions', 'in', 'a', 'distributed', 'environment', 'without', 'need', 'for', 'any', 'trusted', 'third', 'party', 'given', 'their', 'financial', 'nature', 'bugs', 'or', 'vulnerabilities', 'in', 'these', 'programs', 'may', 'lead', 'to', 'catastrophic', 'consequences', 'as', 'witnessed', 'by', 'recent', 'attacks', 'unfortunately', 'programming', 'smart', 'contracts', 'is', 'a', 'delicate', 'task', 'that', 'requires', 'strong', 'expertise', 'ethereum', 'smart', 'contracts', 'are', 'written', 'in', 'solidity', 'a', 'dedicated', 'language', 'resembling', 'javascript', 'and', 'shipped', 'over', 'the', 'blockchain', 'in', 'the', 'evm', 'bytecode', 'format', 'in', 'order', 'to', 'rigorously', 'verify', 'the', 'security', 'of', 'smart', 'contracts', 'it', 'is', 'of', 'paramount', 'importance', 'to', 'formalize', 'their', 'semantics', 'as', 'well', 'as', 'the', 'security', 'properties', 'of', 'interest', 'in', 'particular', 'at', 'the', 'level', 'of', 'the', 'bytecode', 'being', 'executed', 'in', 'this', 'paper', 'we', 'present', 'the', 'first', 'complete', 'smallstep', 'semantics', 'of', 'evm', 'bytecode', 'which', 'we', 'formalize', 'in', 'the', 'f', 'proof', 'assistant', 'obtaining', 'executable', 'code', 'that', 'we', 'successfully', 'validate', 'against', 'the', 'official', 'ethereum', 'test', 'suite', 'furthermore', 'we', 'formally', 'define', 'for', 'the', 'first', 'time', 'a', 'number', 'of', 'central', 'security', 'properties', 'for', 'smart', 'contracts', 'such', 'as', 'call', 'integrity', 'atomicity', 'and', 'independence', 'from', 'miner', 'controlled', 'parameters', 'this', 'formalization', 'relies', 'on', 'a', 'combination', 'of', 'hyper', 'and', 'safety', 'properties', 'along', 'this', 'work', 'we', 'identified', 'various', 'mistakes', 'and', 'imprecisions', 'in', 'existing', 'semantics', 'and', 'verification', 'tools', 'for', 'ethereum', 'smart', 'contracts', 'thereby', 'demonstrating', 'once', 'more', 'the', 'importance', 'of', 'rigorous', 'semantic', 'foundations', 'for', 'the', 'design', 'of', 'security', 'verification', 'techniques']] | [-0.1438410869812873, -0.024776207253542112, -0.06762143918628788, 0.08564053229707436, -0.13725993986501975, -0.1709222998174097, 0.10401576131279383, 0.35887037461299953, -0.2795629059497299, -0.34321224199750033, 0.1598475912809806, -0.2622657671602348, -0.09418650877847479, 0.2101553940895937, -0.16281458843199503, 0.11276896479066019, 0.021718720847275108, -0.019926131418827226, 0.0067733983327713555, -0.2944786369650609, 0.2836066606751509, 0.04037986232867559, 0.2792310214490961, 0.08315497829669581, 0.04488237822868356, 0.034212871925250264, -0.019596866460495344, -0.008548127103525892, -0.061321026311954976, 0.12385045391136497, 0.3587606561812178, 0.2710398222611807, 0.3887568522793225, -0.4695885981733011, -0.09978828649135243, 0.052580588869158555, 0.07196919157008702, 0.06908078439744837, -0.04398193684737326, -0.3258055485390379, 0.11138448013205839, -0.3033210826461535, -0.10612587588326217, -0.13848388031267134, 0.006283658987771467, 0.030629195335076458, -0.2058854995101051, -0.07605503477014096, 0.08188112351256106, 0.13336014174483815, 0.03778201016110084, -0.06130034043414171, -0.06918402238683855, 0.15659829512064866, 0.059177879094623694, -0.05691088804068987, 0.17943133541651196, -0.10484483135001876, -0.19000593970541574, 0.38586808422627716, 0.00654173937332185, -0.1262673043401249, 0.15709697443970194, 0.02684327247513111, -0.2098366638874414, 0.031335417863960234, 0.21294540422376623, 0.08278010599611138, -0.18339097204468197, 0.0795931386697487, 0.008609523270594872, 0.23179610882603596, 0.07334614652174454, 0.04771012795291904, 0.221530790918485, 0.20072236300448065, 0.05346711625550258, 0.12750768345401828, 0.03636560606241416, -0.11544076245380723, -0.29688508651353485, -0.19327935199014018, -0.13336864781715924, -0.0005292971426092278, -0.07992116906209079, -0.16760999220028772, 0.3655193194103727, 0.2481682243726366, 0.06378531853581573, 0.10346287139839398, 0.40874443315581216, 0.008633089850171296, 0.11557359058780879, 0.10817462460890657, 0.15665422184703579, -0.012904704856629319, 0.2054752275930773, -0.11089352515952314, 0.23155659497804323, 0.04086311571832778] |
1,802.08661 | The modular Cauchy kernel for the Hilbert modular surface | In this paper we construct the modular Cauchy kernel on the Hilbert modular
surface $\Xi_{\mathrm{Hil},m}(z)(z_2-\bar{z_2})$, i.e. the function of two
variables, $(z_1, z_2) \in \mathbb{H} \times \mathbb{H}$, which is invariant
under the action of the Hilbert modular group, with the first order pole on the
Hirzebruch-Zagier divisors. The derivative of this function with respect to
$\bar{z_2}$ is the function $\omega_m (z_1, z_2)$ introduced by Don Zagier in
\cite{Za1}. We consider the question of the convergence and the Fourier
expansion of the kernel function. The paper generalizes the first part of the
results obtained in the preprint \cite{Sa}
| math.AG | in this paper we construct the modular cauchy kernel on the hilbert modular surface xi_mathrmhilmzz_2barz_2 ie the function of two variables z_1 z_2 in mathbbh times mathbbh which is invariant under the action of the hilbert modular group with the first order pole on the hirzebruchzagier divisors the derivative of this function with respect to barz_2 is the function omega_m z_1 z_2 introduced by don zagier in citeza1 we consider the question of the convergence and the fourier expansion of the kernel function the paper generalizes the first part of the results obtained in the preprint citesa | [['in', 'this', 'paper', 'we', 'construct', 'the', 'modular', 'cauchy', 'kernel', 'on', 'the', 'hilbert', 'modular', 'surface', 'xi_mathrmhilmzz_2barz_2', 'ie', 'the', 'function', 'of', 'two', 'variables', 'z_1', 'z_2', 'in', 'mathbbh', 'times', 'mathbbh', 'which', 'is', 'invariant', 'under', 'the', 'action', 'of', 'the', 'hilbert', 'modular', 'group', 'with', 'the', 'first', 'order', 'pole', 'on', 'the', 'hirzebruchzagier', 'divisors', 'the', 'derivative', 'of', 'this', 'function', 'with', 'respect', 'to', 'barz_2', 'is', 'the', 'function', 'omega_m', 'z_1', 'z_2', 'introduced', 'by', 'don', 'zagier', 'in', 'citeza1', 'we', 'consider', 'the', 'question', 'of', 'the', 'convergence', 'and', 'the', 'fourier', 'expansion', 'of', 'the', 'kernel', 'function', 'the', 'paper', 'generalizes', 'the', 'first', 'part', 'of', 'the', 'results', 'obtained', 'in', 'the', 'preprint', 'citesa']] | [-0.17910290534231574, 0.06963381988610676, -0.1339310202190276, 0.03650887492806353, -0.05448808378361641, -0.020299697750584877, -0.0280126366576061, 0.30767936219877384, -0.2974918704762302, -0.19306888217118845, 0.12009747877736833, -0.26441601123858954, -0.1719313312490332, 0.14787206009149234, -0.0898282091972973, 0.05648487792944813, -0.023931509527833537, 0.07968483381765953, -0.1211949556897533, -0.32696530692764814, 0.42647907048701605, 0.005714565297549075, 0.20472689231045227, 0.016718236082406874, 0.10863895401200081, 0.03230285065426947, -0.04409882461929575, -0.1418099981395805, -0.1800912780330536, 0.12158429206527294, 0.2061357247869811, 0.045712544087399824, 0.22710732342873483, -0.39321392893474155, -0.1128694393989095, 0.16276509405926187, 0.11436726030536946, -0.03966026575468044, 0.01941749974441259, -0.316205473497827, 0.049964953820775954, -0.1613343712239665, -0.13584726108139025, -0.04421667878991587, 0.01615282475076457, -0.01679850472731793, -0.25551174974386043, 0.0611928118333379, 0.051929503981459964, 0.07326273614184019, -0.07724954227996157, -0.10917543284000551, -0.013151405468345322, 0.05265237145284389, 0.0887780913456462, 0.13332466045493616, 0.052303805863088436, -0.09932425617180923, -0.06236431117546051, 0.35183754509830095, -0.10039030879914285, -0.2543550396308382, 0.089074847248799, -0.20479648249679583, -0.1765072029282121, 0.06419864119168855, 0.11355832535179054, 0.14504672749403943, -0.07109810602157673, 0.21069188540779113, -0.10076281170241852, 0.0987941881027469, 0.08923703839289064, -0.006575088650780789, 0.07975308850724647, 0.07656331553540015, 0.08565994154939309, 0.17233532507893967, -0.03786190620009253, -0.06686695634407248, -0.3720756137466177, -0.2206395463423526, -0.2182076145211195, 0.07738137128267517, -0.11611943770719549, -0.16513965402709993, 0.47346612755605516, 0.08939444717574627, 0.22784652256040258, 0.11828457589008588, 0.2391002086174496, 0.17353176833947803, 0.06482336000648346, 0.04696745657797982, 0.11792438794323738, 0.13480767024373833, 0.02788273658246753, -0.1894717924296856, 0.020235180929105017, 0.19137196788722846] |
1,802.08662 | General theory of photoexcitation induced photoelectron circular
dichroism | The photoionization of chiral molecules prepared in a coherent superposition
of excited states can give access to the underlying chiral coherent dynamics in
a procedure known as photoexcitation induced photoelectron circular dichroism
(PXECD). This exclusive dependence on coherence can also be seen in a different
part of the angular spectrum, where it is not contingent on the chirality of
the molecule, thus allowing extension of PXECD's sensitivity to tracking
coherence to non-chiral molecules. Here we present a general theory of PXECD
based on angular momentum algebra and derive explicit expressions for all
pertinent asymmetry parameters which arise for arbitrary polarisation of pump
and probe pulses. The theory is developed in a way that clearly and simply
separates chiral and non-chiral contributions to the photoelectron angular
distribution, and also demonstrates how PXECD and PECD-type contributions,
which may be distinguished by whether pump or ionizing probe enables chiral
response, are mixed when arbitrary polarization is used.
| physics.atm-clus physics.chem-ph | the photoionization of chiral molecules prepared in a coherent superposition of excited states can give access to the underlying chiral coherent dynamics in a procedure known as photoexcitation induced photoelectron circular dichroism pxecd this exclusive dependence on coherence can also be seen in a different part of the angular spectrum where it is not contingent on the chirality of the molecule thus allowing extension of pxecds sensitivity to tracking coherence to nonchiral molecules here we present a general theory of pxecd based on angular momentum algebra and derive explicit expressions for all pertinent asymmetry parameters which arise for arbitrary polarisation of pump and probe pulses the theory is developed in a way that clearly and simply separates chiral and nonchiral contributions to the photoelectron angular distribution and also demonstrates how pxecd and pecdtype contributions which may be distinguished by whether pump or ionizing probe enables chiral response are mixed when arbitrary polarization is used | [['the', 'photoionization', 'of', 'chiral', 'molecules', 'prepared', 'in', 'a', 'coherent', 'superposition', 'of', 'excited', 'states', 'can', 'give', 'access', 'to', 'the', 'underlying', 'chiral', 'coherent', 'dynamics', 'in', 'a', 'procedure', 'known', 'as', 'photoexcitation', 'induced', 'photoelectron', 'circular', 'dichroism', 'pxecd', 'this', 'exclusive', 'dependence', 'on', 'coherence', 'can', 'also', 'be', 'seen', 'in', 'a', 'different', 'part', 'of', 'the', 'angular', 'spectrum', 'where', 'it', 'is', 'not', 'contingent', 'on', 'the', 'chirality', 'of', 'the', 'molecule', 'thus', 'allowing', 'extension', 'of', 'pxecds', 'sensitivity', 'to', 'tracking', 'coherence', 'to', 'nonchiral', 'molecules', 'here', 'we', 'present', 'a', 'general', 'theory', 'of', 'pxecd', 'based', 'on', 'angular', 'momentum', 'algebra', 'and', 'derive', 'explicit', 'expressions', 'for', 'all', 'pertinent', 'asymmetry', 'parameters', 'which', 'arise', 'for', 'arbitrary', 'polarisation', 'of', 'pump', 'and', 'probe', 'pulses', 'the', 'theory', 'is', 'developed', 'in', 'a', 'way', 'that', 'clearly', 'and', 'simply', 'separates', 'chiral', 'and', 'nonchiral', 'contributions', 'to', 'the', 'photoelectron', 'angular', 'distribution', 'and', 'also', 'demonstrates', 'how', 'pxecd', 'and', 'pecdtype', 'contributions', 'which', 'may', 'be', 'distinguished', 'by', 'whether', 'pump', 'or', 'ionizing', 'probe', 'enables', 'chiral', 'response', 'are', 'mixed', 'when', 'arbitrary', 'polarization', 'is', 'used']] | [-0.1025264520614751, 0.20940002387444684, -0.11926469533998323, 0.05008157161769065, -0.07101139154799871, -0.13437543003390984, 0.01832732081866676, 0.40224650720330446, -0.2555857453185844, -0.2771000599206768, 0.018209481161504396, -0.24357605642504304, -0.10276165823482811, 0.1572672969257263, 0.011333178430121686, 0.02524900839566008, -0.01916152196262326, -0.01658283607531829, -0.032586764273123424, -0.1413813807058001, 0.2966563319481027, 0.02664901803118961, 0.2756412983136742, 0.10897259273884916, 0.09342591067328804, 0.04643114051462984, 0.0030567159563744148, 0.003788015131201399, -0.08517285491406686, 0.10729268672194418, 0.26730888294007044, 0.05366934602161085, 0.14578869663129904, -0.4438678841658035, -0.1797207669649077, 0.055721939413495805, 0.17207048132465724, 0.16721468247736707, -0.02964497011644677, -0.2675232595800863, 0.006730141715563245, -0.15690587367096573, -0.15531150797170612, -0.12973510467073587, 0.024825194810737708, -0.011858245269027784, -0.30073226595260694, 0.07559095773697329, 0.04055086994125495, 0.02872826821648663, -0.042609832021346515, -0.06851990410895699, -0.08021486939641793, 0.08994564611872959, 0.009883636879844983, 0.021790558481466417, 0.17087734592036882, -0.11474232411312282, -0.1482148227208343, 0.359766795937168, -0.06735657293067657, -0.20379365994104823, 0.12692181854110554, -0.1888462049476067, -0.1091698368132041, 0.14187960200912417, 0.1426816375184755, 0.1595110263063505, -0.12208105613181512, 0.04595739748650598, -0.036597642753469314, 0.18713739815498948, 0.11429895232983031, 0.12924030205230289, 0.2533046372172018, 0.09429186915727578, 0.04512341549056337, 0.14701439872672045, -0.09590662928071413, -0.06274299216027812, -0.2982215736854797, -0.1009304185342779, -0.18587566402780603, 0.10649743305657466, -0.0008565805920194467, -0.12931193911936134, 0.4247858542826419, 0.12279330572116458, 0.16752721774422466, -0.014063612622282418, 0.3164000316694575, 0.11872264655156821, 0.04247266447208332, 0.0022532010763442437, 0.26035411965935246, 0.19219107228778548, 0.05224659751279672, -0.2847985504608675, 0.0661140870223263, 0.0016423134703042084] |
1,802.08663 | Synchronization Strings: List Decoding for Insertions and Deletions | We study codes that are list-decodable under insertions and deletions.
Specifically, we consider the setting where a codeword over some finite
alphabet of size $q$ may suffer from $\delta$ fraction of adversarial deletions
and $\gamma$ fraction of adversarial insertions. A code is said to be
$L$-list-decodable if there is an (efficient) algorithm that, given a received
word, reports a list of $L$ codewords that include the original codeword.
Using the concept of synchronization strings, introduced by the first two
authors [STOC 2017], we show some surprising results. We show that for every
$0\leq\delta<1$, every $0\leq\gamma<\infty$ and every $\epsilon>0$ there exist
efficient codes of rate $1-\delta-\epsilon$ and constant alphabet (so
$q=O_{\delta,\gamma,\epsilon}(1)$) and sub-logarithmic list sizes. We stress
that the fraction of insertions can be arbitrarily large and the rate is
independent of this parameter. Our result sheds light on the remarkable
asymmetry between the impact of insertions and deletions from the point of view
of error-correction: Whereas deletions cost in the rate of the code, insertion
costs are borne by the adversary and not the code!
We also prove several tight bounds on the parameters of list-decodable insdel
codes. In particular, we show that the alphabet size of insdel codes needs to
be exponentially large in $\epsilon^{-1}$, where $\epsilon$ is the gap to
capacity above. Our result even applies to settings where the unique-decoding
capacity equals the list-decoding capacity and when it does so, it shows that
the alphabet size needs to be exponentially large in the gap to capacity. This
is sharp contrast to the Hamming error model where alphabet size polynomial in
$\epsilon^{-1}$ suffices for unique decoding and also shows that the
exponential dependence on the alphabet size in previous works that constructed
insdel codes is actually necessary!
| cs.IT cs.DS math.IT | we study codes that are listdecodable under insertions and deletions specifically we consider the setting where a codeword over some finite alphabet of size q may suffer from delta fraction of adversarial deletions and gamma fraction of adversarial insertions a code is said to be llistdecodable if there is an efficient algorithm that given a received word reports a list of l codewords that include the original codeword using the concept of synchronization strings introduced by the first two authors stoc 2017 we show some surprising results we show that for every 0leqdelta1 every 0leqgammainfty and every epsilon0 there exist efficient codes of rate 1deltaepsilon and constant alphabet so qo_deltagammaepsilon1 and sublogarithmic list sizes we stress that the fraction of insertions can be arbitrarily large and the rate is independent of this parameter our result sheds light on the remarkable asymmetry between the impact of insertions and deletions from the point of view of errorcorrection whereas deletions cost in the rate of the code insertion costs are borne by the adversary and not the code we also prove several tight bounds on the parameters of listdecodable insdel codes in particular we show that the alphabet size of insdel codes needs to be exponentially large in epsilon1 where epsilon is the gap to capacity above our result even applies to settings where the uniquedecoding capacity equals the listdecoding capacity and when it does so it shows that the alphabet size needs to be exponentially large in the gap to capacity this is sharp contrast to the hamming error model where alphabet size polynomial in epsilon1 suffices for unique decoding and also shows that the exponential dependence on the alphabet size in previous works that constructed insdel codes is actually necessary | [['we', 'study', 'codes', 'that', 'are', 'listdecodable', 'under', 'insertions', 'and', 'deletions', 'specifically', 'we', 'consider', 'the', 'setting', 'where', 'a', 'codeword', 'over', 'some', 'finite', 'alphabet', 'of', 'size', 'q', 'may', 'suffer', 'from', 'delta', 'fraction', 'of', 'adversarial', 'deletions', 'and', 'gamma', 'fraction', 'of', 'adversarial', 'insertions', 'a', 'code', 'is', 'said', 'to', 'be', 'llistdecodable', 'if', 'there', 'is', 'an', 'efficient', 'algorithm', 'that', 'given', 'a', 'received', 'word', 'reports', 'a', 'list', 'of', 'l', 'codewords', 'that', 'include', 'the', 'original', 'codeword', 'using', 'the', 'concept', 'of', 'synchronization', 'strings', 'introduced', 'by', 'the', 'first', 'two', 'authors', 'stoc', '2017', 'we', 'show', 'some', 'surprising', 'results', 'we', 'show', 'that', 'for', 'every', '0leqdelta1', 'every', '0leqgammainfty', 'and', 'every', 'epsilon0', 'there', 'exist', 'efficient', 'codes', 'of', 'rate', '1deltaepsilon', 'and', 'constant', 'alphabet', 'so', 'qo_deltagammaepsilon1', 'and', 'sublogarithmic', 'list', 'sizes', 'we', 'stress', 'that', 'the', 'fraction', 'of', 'insertions', 'can', 'be', 'arbitrarily', 'large', 'and', 'the', 'rate', 'is', 'independent', 'of', 'this', 'parameter', 'our', 'result', 'sheds', 'light', 'on', 'the', 'remarkable', 'asymmetry', 'between', 'the', 'impact', 'of', 'insertions', 'and', 'deletions', 'from', 'the', 'point', 'of', 'view', 'of', 'errorcorrection', 'whereas', 'deletions', 'cost', 'in', 'the', 'rate', 'of', 'the', 'code', 'insertion', 'costs', 'are', 'borne', 'by', 'the', 'adversary', 'and', 'not', 'the', 'code', 'we', 'also', 'prove', 'several', 'tight', 'bounds', 'on', 'the', 'parameters', 'of', 'listdecodable', 'insdel', 'codes', 'in', 'particular', 'we', 'show', 'that', 'the', 'alphabet', 'size', 'of', 'insdel', 'codes', 'needs', 'to', 'be', 'exponentially', 'large', 'in', 'epsilon1', 'where', 'epsilon', 'is', 'the', 'gap', 'to', 'capacity', 'above', 'our', 'result', 'even', 'applies', 'to', 'settings', 'where', 'the', 'uniquedecoding', 'capacity', 'equals', 'the', 'listdecoding', 'capacity', 'and', 'when', 'it', 'does', 'so', 'it', 'shows', 'that', 'the', 'alphabet', 'size', 'needs', 'to', 'be', 'exponentially', 'large', 'in', 'the', 'gap', 'to', 'capacity', 'this', 'is', 'sharp', 'contrast', 'to', 'the', 'hamming', 'error', 'model', 'where', 'alphabet', 'size', 'polynomial', 'in', 'epsilon1', 'suffices', 'for', 'unique', 'decoding', 'and', 'also', 'shows', 'that', 'the', 'exponential', 'dependence', 'on', 'the', 'alphabet', 'size', 'in', 'previous', 'works', 'that', 'constructed', 'insdel', 'codes', 'is', 'actually', 'necessary']] | [-0.1760467972183541, 0.13190786859318623, -0.030866719683625674, 0.06022552490339684, -0.026048475998213562, -0.19934340497946149, 0.1407313266096064, 0.3694162229655019, -0.29715382428543624, -0.28161591938252534, 0.10027370571883645, -0.2768439602324009, -0.1602881354384302, 0.17988686272940294, -0.15082673705943989, 0.0696396016344665, 0.08609900919246642, 0.07428766627937503, -0.0527935940140855, -0.35158636427629253, 0.2827798522924083, 0.09571882946229154, 0.21351046350787892, 0.06476133388064821, 0.030253467936967187, -0.0052120944282678435, -0.004232630313805209, 0.0013752782161186314, -0.1555823441581727, 0.03569609996148586, 0.26481277753299515, 0.18110398810486744, 0.2512961996093149, -0.36731426346096435, -0.1943437960533616, 0.1326000840853992, 0.1400704828120584, 0.15799100998321766, -0.05202914998897881, -0.18186612515019207, 0.16870958026080612, -0.15160315390840803, -0.022545992926194237, 0.0004747065114081169, 0.07656847945555992, 0.015047566442793175, -0.31919425989372835, 0.004613944031289933, 0.11188719556140368, -0.0030423640364010953, -0.009955313649479392, -0.1444308885328748, 0.021789805462597064, 0.13017250538210043, 0.048023118437580475, 0.0981600872786426, 0.054354136282546844, -0.07094489735289553, -0.1042699861309784, 0.33309906307779014, -0.05141309260262354, -0.20934464171686779, 0.11123280564048278, -0.13710867177922106, -0.13103072157675932, 0.15307134343352327, 0.19522135057519502, 0.10384068732699478, -0.059311041525614866, 0.1414001827212972, -0.09085449864166417, 0.2587268469472006, 0.11817199122094856, 0.08276092671285723, 0.10993858170572195, 0.10165576018782188, 0.07689876705835913, 0.18703754313615917, -0.059301050628334705, -0.05911677860494048, -0.3190765884480079, -0.12053397140801347, -0.21410187038711467, 0.05061149015096501, -0.13989445023424182, -0.17588560288243799, 0.3304412459424786, 0.1526310395868166, 0.20244810653921602, 0.156806773618818, 0.26928285374174504, 0.048295245710316084, 0.10678093071493021, 0.205338829114383, 0.1563976747273836, 0.07355935923103572, -0.003198336436357283, -0.21166647558368729, 0.1267942158277426, 0.07035125839086283] |
1,802.08664 | Modeling goal chances in soccer: a Bayesian inference approach | We consider the task of determining the number of chances a soccer team
creates, along with the composite nature of each chance-the players involved
and the locations on the pitch of the assist and the chance. We propose an
interpretable Bayesian inference approach and implement a Poisson model to
capture chance occurrences, from which we infer team abilities. We then use a
Gaussian mixture model to capture the areas on the pitch a player makes an
assist/takes a chance. This approach allows the visualization of differences
between players in the way they approach attacking play (making assists/taking
chances). We apply the resulting scheme to the 2016/2017 English Premier
League, capturing team abilities to create chances, before highlighting key
areas where players have most impact.
| stat.AP | we consider the task of determining the number of chances a soccer team creates along with the composite nature of each chancethe players involved and the locations on the pitch of the assist and the chance we propose an interpretable bayesian inference approach and implement a poisson model to capture chance occurrences from which we infer team abilities we then use a gaussian mixture model to capture the areas on the pitch a player makes an assisttakes a chance this approach allows the visualization of differences between players in the way they approach attacking play making assiststaking chances we apply the resulting scheme to the 20162017 english premier league capturing team abilities to create chances before highlighting key areas where players have most impact | [['we', 'consider', 'the', 'task', 'of', 'determining', 'the', 'number', 'of', 'chances', 'a', 'soccer', 'team', 'creates', 'along', 'with', 'the', 'composite', 'nature', 'of', 'each', 'chancethe', 'players', 'involved', 'and', 'the', 'locations', 'on', 'the', 'pitch', 'of', 'the', 'assist', 'and', 'the', 'chance', 'we', 'propose', 'an', 'interpretable', 'bayesian', 'inference', 'approach', 'and', 'implement', 'a', 'poisson', 'model', 'to', 'capture', 'chance', 'occurrences', 'from', 'which', 'we', 'infer', 'team', 'abilities', 'we', 'then', 'use', 'a', 'gaussian', 'mixture', 'model', 'to', 'capture', 'the', 'areas', 'on', 'the', 'pitch', 'a', 'player', 'makes', 'an', 'assisttakes', 'a', 'chance', 'this', 'approach', 'allows', 'the', 'visualization', 'of', 'differences', 'between', 'players', 'in', 'the', 'way', 'they', 'approach', 'attacking', 'play', 'making', 'assiststaking', 'chances', 'we', 'apply', 'the', 'resulting', 'scheme', 'to', 'the', '20162017', 'english', 'premier', 'league', 'capturing', 'team', 'abilities', 'to', 'create', 'chances', 'before', 'highlighting', 'key', 'areas', 'where', 'players', 'have', 'most', 'impact']] | [-0.042962927840773234, 0.0225604397520396, -0.12381305118391583, 0.08359460942812787, -0.1279436872833339, -0.15495384558034705, 0.10698366353734712, 0.3989815276331645, -0.24977250381522959, -0.3737921231534055, 0.004294247103831923, -0.2752011610708086, -0.19212787335907872, 0.1233003991809943, -0.11260660784511466, 0.007123856594562839, 0.06773898108548572, 0.05020454548268525, 0.052883455985488395, -0.27894943844996517, 0.28748411322320416, 0.08346357693787941, 0.27215874547616015, -0.039131262722571405, 0.11646969232338765, 0.04094764847627818, -0.05843396028426807, -0.0022051549431952562, -0.11939960726621476, 0.1376259538310403, 0.29347231355303327, 0.206588962915823, 0.4067863315528582, -0.42069115729863976, -0.14205665108247484, 0.1437683537552395, 0.09575693867042322, 0.12233590310312469, 0.0008883284133558801, -0.32302301605655387, 0.020330051783749387, -0.19986612658874586, -0.09460934889233433, -0.07101685843191856, -0.01427742655240846, -0.004773237723241414, -0.2763166674451271, -0.012444050347601826, 0.04459393273823518, 0.022217997511433177, -0.02785323954558708, -0.10828639898249064, 0.02137826580154009, 0.23163868820156194, 0.056059943750685404, -0.0023979533633047886, 0.12834398622224338, -0.1941518644371247, -0.14278422210996677, 0.40492659575144246, 0.006636915836206152, -0.17213311575330054, 0.17827753640695915, -0.09188442329745278, -0.13946997786367943, 0.08315331104773381, 0.2326260356940637, 0.0929633962964131, -0.11230975841287492, -0.016576263293035114, -0.021986856714587596, 0.2143146342940413, 0.08207673162668327, -0.02994463342234246, 0.26461571248725424, 0.2210958027261625, 0.08692227316104369, 0.11062571741948443, -0.13564491794975705, -0.13442070626322766, -0.2221899935129014, -0.15003390497458743, -0.09224286341023716, -0.0406393104515227, -0.050043550069460235, -0.12366584932416184, 0.4209198443487434, 0.2240523382124668, 0.17870813279127903, 0.08170589141274441, 0.295407088812102, 0.016413126679614556, 0.02679949312678669, 0.061075826325119, 0.18159623151598883, 0.03969216426403439, 0.06783263371152849, -0.18243045322327636, 0.1715569509662811, 0.03375609244449903] |
1,802.08665 | Learning Latent Permutations with Gumbel-Sinkhorn Networks | Permutations and matchings are core building blocks in a variety of latent
variable models, as they allow us to align, canonicalize, and sort data.
Learning in such models is difficult, however, because exact marginalization
over these combinatorial objects is intractable. In response, this paper
introduces a collection of new methods for end-to-end learning in such models
that approximate discrete maximum-weight matching using the continuous Sinkhorn
operator. Sinkhorn iteration is attractive because it functions as a simple,
easy-to-implement analog of the softmax operator. With this, we can define the
Gumbel-Sinkhorn method, an extension of the Gumbel-Softmax method (Jang et al.
2016, Maddison2016 et al. 2016) to distributions over latent matchings. We
demonstrate the effectiveness of our method by outperforming competitive
baselines on a range of qualitatively different tasks: sorting numbers, solving
jigsaw puzzles, and identifying neural signals in worms.
| stat.ML cs.LG | permutations and matchings are core building blocks in a variety of latent variable models as they allow us to align canonicalize and sort data learning in such models is difficult however because exact marginalization over these combinatorial objects is intractable in response this paper introduces a collection of new methods for endtoend learning in such models that approximate discrete maximumweight matching using the continuous sinkhorn operator sinkhorn iteration is attractive because it functions as a simple easytoimplement analog of the softmax operator with this we can define the gumbelsinkhorn method an extension of the gumbelsoftmax method jang et al 2016 maddison2016 et al 2016 to distributions over latent matchings we demonstrate the effectiveness of our method by outperforming competitive baselines on a range of qualitatively different tasks sorting numbers solving jigsaw puzzles and identifying neural signals in worms | [['permutations', 'and', 'matchings', 'are', 'core', 'building', 'blocks', 'in', 'a', 'variety', 'of', 'latent', 'variable', 'models', 'as', 'they', 'allow', 'us', 'to', 'align', 'canonicalize', 'and', 'sort', 'data', 'learning', 'in', 'such', 'models', 'is', 'difficult', 'however', 'because', 'exact', 'marginalization', 'over', 'these', 'combinatorial', 'objects', 'is', 'intractable', 'in', 'response', 'this', 'paper', 'introduces', 'a', 'collection', 'of', 'new', 'methods', 'for', 'endtoend', 'learning', 'in', 'such', 'models', 'that', 'approximate', 'discrete', 'maximumweight', 'matching', 'using', 'the', 'continuous', 'sinkhorn', 'operator', 'sinkhorn', 'iteration', 'is', 'attractive', 'because', 'it', 'functions', 'as', 'a', 'simple', 'easytoimplement', 'analog', 'of', 'the', 'softmax', 'operator', 'with', 'this', 'we', 'can', 'define', 'the', 'gumbelsinkhorn', 'method', 'an', 'extension', 'of', 'the', 'gumbelsoftmax', 'method', 'jang', 'et', 'al', '2016', 'maddison2016', 'et', 'al', '2016', 'to', 'distributions', 'over', 'latent', 'matchings', 'we', 'demonstrate', 'the', 'effectiveness', 'of', 'our', 'method', 'by', 'outperforming', 'competitive', 'baselines', 'on', 'a', 'range', 'of', 'qualitatively', 'different', 'tasks', 'sorting', 'numbers', 'solving', 'jigsaw', 'puzzles', 'and', 'identifying', 'neural', 'signals', 'in', 'worms']] | [-0.04581931629218161, 0.020493612072695053, -0.09399061559302294, 0.06604034490352634, -0.14781186854302444, -0.14409802825128495, 0.06012215849648997, 0.4138647417507052, -0.2982798583449467, -0.36144101785441096, 0.06979584110034492, -0.25355115849935617, -0.2072659019887557, 0.1973616047488416, -0.15479017685078467, 0.11183415434104116, 0.08947340198724038, -0.042337756972034075, -0.05398820641702889, -0.2820597581346245, 0.26082101379014444, 0.04504153202972649, 0.29034557751626433, -0.015007579031482558, 0.1408230130610344, 0.008376656491343644, -0.037295860286309, 0.008142241684254259, -0.06985512580013165, 0.1301827092470108, 0.31469761952605363, 0.19857899300576023, 0.2883782890344532, -0.38022181324092397, -0.2017213381237953, 0.15173569468863526, 0.15090028073652373, 0.1187972397704417, -0.01647587511465912, -0.27936096650356534, 0.06915760040625601, -0.18693320987992645, -0.023433538718724296, -0.1379100137992817, 0.037377697877887195, 0.03085407397199614, -0.316195032258025, 0.05419077873675098, 0.08449167717224233, 0.02304036571235081, -0.03179209713604959, -0.14451365816571257, 0.05599864318398485, 0.07333418532439015, 0.0033782748933470644, 0.03610437978332972, 0.06994724678053685, -0.12236175711287241, -0.18773769043207936, 0.3354208358864793, -0.026550896214115816, -0.2086253232521224, 0.1992728132780244, 0.005121776652659345, -0.17186654080732672, 0.08756425049197038, 0.19839228040676543, 0.18339842288097477, -0.13725242238176769, 0.07893376837369835, -0.11651352537549375, 0.12816965575877795, 0.08357269392570957, -0.03885104776675101, 0.16758122878587423, 0.19646827258881838, 0.064725532223854, 0.1331418903256931, -0.05593884976876913, -0.11582357680291512, -0.21593453887951053, -0.13219794320192543, -0.215486723696813, -0.024051157237194917, -0.11009093562643102, -0.19213769602870076, 0.39833605529993826, 0.210871325680808, 0.23092119204503594, 0.10965624652967296, 0.28518850505968335, 0.06922639972403619, 0.07765624069896362, 0.12827212369644686, 0.13924627611755996, 0.10474324431989397, 0.08047665729057318, -0.16487497994025677, 0.08578399222974173, 0.1199577487697003] |
1,802.08666 | Numerical performance of optimized Frolov lattices in tensor product
reproducing kernel Sobolev spaces | In this paper, we deal with several aspects of the universal Frolov cubature
method, that is known to achieve optimal asymptotic convergence rates in a
broad range of function spaces. Even though every admissible lattice has this
favorable asymptotic behavior, there are significant differences concerning the
precise numerical behavior of the worst-case error. To this end, we propose new
generating polynomials that promise a significant reduction of the integration
error compared to the classical polynomials. Moreover, we develop a new
algorithm to enumerate the Frolov points from non-orthogonal lattices for
numerical cubature in the $d$-dimensional unit cube $[0,1]^d$. Finally, we
study Sobolev spaces with anisotropic mixed smoothness and compact support in
$[0,1]^d$ and derive explicit formulas for their reproducing kernels. This
allows for the simulation of exact worst-case errors which numerically validate
our theoretical results.
| math.NA cs.NA | in this paper we deal with several aspects of the universal frolov cubature method that is known to achieve optimal asymptotic convergence rates in a broad range of function spaces even though every admissible lattice has this favorable asymptotic behavior there are significant differences concerning the precise numerical behavior of the worstcase error to this end we propose new generating polynomials that promise a significant reduction of the integration error compared to the classical polynomials moreover we develop a new algorithm to enumerate the frolov points from nonorthogonal lattices for numerical cubature in the ddimensional unit cube 01d finally we study sobolev spaces with anisotropic mixed smoothness and compact support in 01d and derive explicit formulas for their reproducing kernels this allows for the simulation of exact worstcase errors which numerically validate our theoretical results | [['in', 'this', 'paper', 'we', 'deal', 'with', 'several', 'aspects', 'of', 'the', 'universal', 'frolov', 'cubature', 'method', 'that', 'is', 'known', 'to', 'achieve', 'optimal', 'asymptotic', 'convergence', 'rates', 'in', 'a', 'broad', 'range', 'of', 'function', 'spaces', 'even', 'though', 'every', 'admissible', 'lattice', 'has', 'this', 'favorable', 'asymptotic', 'behavior', 'there', 'are', 'significant', 'differences', 'concerning', 'the', 'precise', 'numerical', 'behavior', 'of', 'the', 'worstcase', 'error', 'to', 'this', 'end', 'we', 'propose', 'new', 'generating', 'polynomials', 'that', 'promise', 'a', 'significant', 'reduction', 'of', 'the', 'integration', 'error', 'compared', 'to', 'the', 'classical', 'polynomials', 'moreover', 'we', 'develop', 'a', 'new', 'algorithm', 'to', 'enumerate', 'the', 'frolov', 'points', 'from', 'nonorthogonal', 'lattices', 'for', 'numerical', 'cubature', 'in', 'the', 'ddimensional', 'unit', 'cube', '01d', 'finally', 'we', 'study', 'sobolev', 'spaces', 'with', 'anisotropic', 'mixed', 'smoothness', 'and', 'compact', 'support', 'in', '01d', 'and', 'derive', 'explicit', 'formulas', 'for', 'their', 'reproducing', 'kernels', 'this', 'allows', 'for', 'the', 'simulation', 'of', 'exact', 'worstcase', 'errors', 'which', 'numerically', 'validate', 'our', 'theoretical', 'results']] | [-0.11864005224434314, 0.01681191079594471, -0.08866290995782172, 0.10208098159292368, -0.0753420071469413, -0.11087407474233596, 0.0914043271853761, 0.3940953538546132, -0.2398462469879262, -0.22286218646913766, 0.1310454885656428, -0.2430305130970535, -0.17892319095769413, 0.2236315719541852, -0.12266923778084607, 0.1321587400510907, 0.07534771386223535, -0.012173185566509212, -0.13938160501248031, -0.30419666391831857, 0.3095784066727868, 0.056947080904824865, 0.2683384835444115, 0.03506795127220728, 0.10611895973604449, -0.02823761854044817, -0.008894942545642456, -0.01292240841107236, -0.20187031626065383, 0.17502439755394503, 0.2680623542360047, 0.08173406090828832, 0.28600184339340085, -0.3787060238720625, -0.17080383498083662, 0.1617198192074688, 0.16843096253427642, 0.09775172006597535, -0.07592619212033848, -0.23934720407791987, 0.11445989019616887, -0.13913996117620694, -0.16250628651361224, -0.14696244956166657, 0.02365007912395177, 0.07308599759859068, -0.33537191045643006, 0.05891151424428379, 0.0622118957237237, 0.06020383067705013, -0.061081981033310986, -0.13784668004933606, 0.07022268174181658, 0.10974818082802273, 0.017669014541294287, 0.037600933225756444, 0.004766368283243436, -0.044045728583026814, -0.15390005872964307, 0.337669616220174, -0.013535451529012924, -0.25681879919160294, 0.15622057469768658, -0.1658866249093855, -0.1506681299009533, 0.14425000684611775, 0.18901726731651083, 0.1229210618538437, -0.10056145158078936, 0.10767350484082407, -0.07713506593955335, 0.11910000178549025, 0.08314416183296729, 0.06638356220770489, 0.09892912514645744, 0.1263795129161466, 0.0737629945355433, 0.19001043850762978, -0.04398130332119763, -0.14599319730488652, -0.33767823118164586, -0.15942521009990876, -0.18010902593119277, 0.020549568758104687, -0.18539322062753383, -0.19983390293739461, 0.36239282366716197, 0.1868266501890806, 0.16749068133670975, 0.17265763233191575, 0.25843208183844885, 0.10825388515626805, 0.0045718891597870326, 0.1027102503735848, 0.18474566155734162, 0.11361625445834189, 0.05412446968257427, -0.19814596421913142, 0.030535320846225927, 0.10269223161179711] |
1,802.08667 | De-Biased Machine Learning of Global and Local Parameters Using
Regularized Riesz Representers | We provide adaptive inference methods, based on $\ell_1$ regularization, for
regular (semi-parametric) and non-regular (nonparametric) linear functionals of
the conditional expectation function. Examples of regular functionals include
average treatment effects, policy effects, and derivatives. Examples of
non-regular functionals include average treatment effects, policy effects, and
derivatives conditional on a covariate subvector fixed at a point. We construct
a Neyman orthogonal equation for the target parameter that is approximately
invariant to small perturbations of the nuisance parameters. To achieve this
property, we include the Riesz representer for the functional as an additional
nuisance parameter. Our analysis yields weak ``double sparsity robustness'':
either the approximation to the regression or the approximation to the
representer can be ``completely dense'' as long as the other is sufficiently
``sparse''. Our main results are non-asymptotic and imply asymptotic uniform
validity over large classes of models, translating into honest confidence bands
for both global and local parameters.
| stat.ML econ.EM math.ST stat.TH | we provide adaptive inference methods based on ell_1 regularization for regular semiparametric and nonregular nonparametric linear functionals of the conditional expectation function examples of regular functionals include average treatment effects policy effects and derivatives examples of nonregular functionals include average treatment effects policy effects and derivatives conditional on a covariate subvector fixed at a point we construct a neyman orthogonal equation for the target parameter that is approximately invariant to small perturbations of the nuisance parameters to achieve this property we include the riesz representer for the functional as an additional nuisance parameter our analysis yields weak double sparsity robustness either the approximation to the regression or the approximation to the representer can be completely dense as long as the other is sufficiently sparse our main results are nonasymptotic and imply asymptotic uniform validity over large classes of models translating into honest confidence bands for both global and local parameters | [['we', 'provide', 'adaptive', 'inference', 'methods', 'based', 'on', 'ell_1', 'regularization', 'for', 'regular', 'semiparametric', 'and', 'nonregular', 'nonparametric', 'linear', 'functionals', 'of', 'the', 'conditional', 'expectation', 'function', 'examples', 'of', 'regular', 'functionals', 'include', 'average', 'treatment', 'effects', 'policy', 'effects', 'and', 'derivatives', 'examples', 'of', 'nonregular', 'functionals', 'include', 'average', 'treatment', 'effects', 'policy', 'effects', 'and', 'derivatives', 'conditional', 'on', 'a', 'covariate', 'subvector', 'fixed', 'at', 'a', 'point', 'we', 'construct', 'a', 'neyman', 'orthogonal', 'equation', 'for', 'the', 'target', 'parameter', 'that', 'is', 'approximately', 'invariant', 'to', 'small', 'perturbations', 'of', 'the', 'nuisance', 'parameters', 'to', 'achieve', 'this', 'property', 'we', 'include', 'the', 'riesz', 'representer', 'for', 'the', 'functional', 'as', 'an', 'additional', 'nuisance', 'parameter', 'our', 'analysis', 'yields', 'weak', 'double', 'sparsity', 'robustness', 'either', 'the', 'approximation', 'to', 'the', 'regression', 'or', 'the', 'approximation', 'to', 'the', 'representer', 'can', 'be', 'completely', 'dense', 'as', 'long', 'as', 'the', 'other', 'is', 'sufficiently', 'sparse', 'our', 'main', 'results', 'are', 'nonasymptotic', 'and', 'imply', 'asymptotic', 'uniform', 'validity', 'over', 'large', 'classes', 'of', 'models', 'translating', 'into', 'honest', 'confidence', 'bands', 'for', 'both', 'global', 'and', 'local', 'parameters']] | [-0.057707922113671276, 0.03236718485607222, -0.10384843725400666, 0.161655212706731, -0.10354725341778248, -0.1437187002816548, 0.07065127801460525, 0.38704654524102805, -0.26913144294871016, -0.2527119164556886, 0.1343458173206697, -0.2538454729566971, -0.12497404436736058, 0.1686861309176311, -0.10107341927165786, 0.11120292383867006, 0.04889561778555314, 0.009127276789901467, -0.10294022962606202, -0.2852618194790557, 0.2974877910641953, 0.057341387439519165, 0.264738171727707, -0.009329367248962323, 0.1381646387744695, 0.054647368177150685, -0.01731966497997443, 0.02863457746182879, -0.13082381516874497, 0.08394695249696572, 0.2718958718436625, 0.11774725395565232, 0.36724998970826467, -0.3764618820572893, -0.24503475224599242, 0.1288243698173513, 0.08174758951334904, 0.08241170673165471, 0.0035408182814717294, -0.2863614679748813, 0.06348525882698595, -0.15935024733965594, -0.09271864229192336, -0.17162589474658793, -0.0393449792265892, 0.06516599290072918, -0.40234907688573, 0.1335640113047945, 0.10791922069775561, 0.0509530631142358, -0.0806808512378484, -0.1767215563294788, -0.0016229294209430616, 0.08057089467998595, 0.07680391042803725, -0.002815428839142745, 0.11341517779491066, -0.0926672919637834, -0.08570606908838575, 0.2942515020507077, -0.09137060869329919, -0.2944591260344411, 0.15962999819312246, -0.11564979346469045, -0.155347042074427, 0.08622066277700166, 0.21865015011280775, 0.1243334437161684, -0.12402503501002987, 0.13358337609834658, -0.007955473636587461, 0.1442156948640089, 0.04241910615004599, 0.055072501786053184, 0.1245010680363824, 0.11435646674595773, 0.13906727868442734, 0.11592589148126232, -0.08227484769226673, -0.09187458692739407, -0.35797113077715037, -0.08427114012961587, -0.15713502597995102, -0.004419153890727709, -0.19600878576699568, -0.254584505148232, 0.3776806280016899, 0.13321032198766866, 0.15964355012091497, 0.13233801372038823, 0.27967902877368034, 0.13778935790605223, 0.04135063811205328, 0.07059893483606478, 0.18922295717522503, 0.13291420119504133, -0.040572755256822954, -0.1514608177713429, 0.11161743859915683, 0.08174913567801316] |
1,802.08668 | 3D superconducting gap in FeSe from ARPES | We present a systematic angle-resolved photoemission spectroscopy study of
the superconducting gap in FeSe. The gap function is determined in a full
Brillouin zone including all Fermi surfaces and kz-dependence. We find
significant anisotropy of the superconducting gap in all momentum directions.
While the in-plane anisotropy can be explained by both, nematicity-induced
pairing anisotropy and orbital-selective pairing, the kz-anisotropy requires
additional refinement of theoretical approaches.
| cond-mat.supr-con | we present a systematic angleresolved photoemission spectroscopy study of the superconducting gap in fese the gap function is determined in a full brillouin zone including all fermi surfaces and kzdependence we find significant anisotropy of the superconducting gap in all momentum directions while the inplane anisotropy can be explained by both nematicityinduced pairing anisotropy and orbitalselective pairing the kzanisotropy requires additional refinement of theoretical approaches | [['we', 'present', 'a', 'systematic', 'angleresolved', 'photoemission', 'spectroscopy', 'study', 'of', 'the', 'superconducting', 'gap', 'in', 'fese', 'the', 'gap', 'function', 'is', 'determined', 'in', 'a', 'full', 'brillouin', 'zone', 'including', 'all', 'fermi', 'surfaces', 'and', 'kzdependence', 'we', 'find', 'significant', 'anisotropy', 'of', 'the', 'superconducting', 'gap', 'in', 'all', 'momentum', 'directions', 'while', 'the', 'inplane', 'anisotropy', 'can', 'be', 'explained', 'by', 'both', 'nematicityinduced', 'pairing', 'anisotropy', 'and', 'orbitalselective', 'pairing', 'the', 'kzanisotropy', 'requires', 'additional', 'refinement', 'of', 'theoretical', 'approaches']] | [-0.24755723534091825, 0.17587129452318373, -0.07578538867434667, 0.06986977025723806, -0.08201577113340458, -0.09281437376874589, 0.1396591633430592, 0.434797337699321, -0.28334963477907643, -0.32598377612509555, -0.08673086356664557, -0.3353806213746148, -0.07032405802108828, 0.19248470769173676, 0.0633445356581961, 0.0524371893055016, -0.0022509812918161194, -0.14707852559795062, -0.19660148206317135, -0.19226615908443026, 0.3684477118715163, 0.03796594792736634, 0.32148096002938764, 0.15488077489839447, -0.009518464478934485, 0.03393901875543018, 0.07729825013948063, 0.026499929222007914, -0.17987985530447576, 0.07424876699224114, 0.31281537622694044, -0.1394257191117973, 0.20390871054522933, -0.4170352377057556, -0.26163319927910644, -0.016092114541078766, 0.1749686066271557, 0.14594913087597478, -0.04712153018842782, -0.24410874399566843, 0.02331883602985932, -0.1559864140506233, -0.11267486410666137, -0.15016826263238345, -0.08533635871454832, -0.04425905151161245, -0.1746025285646019, 0.10909306492295957, 0.06660701898527482, 0.1645403785420762, -0.11985536980547852, -0.1395448312884377, -0.08540912879811179, 0.01760677864114123, 0.086943524450274, 0.08780050083559247, 0.07314436250336227, -0.08732475866112978, -0.09260766236336841, 0.32563308196803253, -0.02631772650525935, -0.06470197468626147, 0.06178958009507868, -0.2218233159397759, -0.06388732096961429, 0.15018321961284645, 0.05988304377082856, 0.04616575815053957, -0.09911497443493816, 0.1291373810419182, -0.020566173543732975, 0.18952633299294017, 0.021892708591035297, 0.07248992978354855, 0.2543459987688449, 0.2125011969098611, 0.06517621195845065, 0.11156601323032632, -0.18279006904659553, 0.010438433142318841, -0.2746067632049803, -0.18452955869537208, -0.2398575214451299, 0.00566169373961466, -0.05234701139805463, -0.16311846903314994, 0.42498390911327255, 0.12284191002348258, 0.2333508808045618, -0.09059569290688922, 0.2600347914642865, 0.08444497771110505, 0.10270439055297644, 0.07406266144056234, 0.29551513865590096, 0.11661709414704913, 0.08595501370502696, -0.3556652555257202, 0.09768358874510252, -0.01639884783165349] |
1,802.08669 | Common envelope jets supernova (CEJSN) impostors resulting from a
neutron star companion | We propose a new type of repeating transient outburst initiated by a neutron
star (NS) entering the envelope of an evolved massive star, accreting envelope
material and subsequently launching jets which interact with their
surroundings. This interaction is the result of either a rapid expansion of the
primary star due to an instability in its core near the end of its nuclear
evolution, or due to a dynamical process which rapidly brings the NS into the
primary star. The ejecta can reach velocities of 10,000 km/s despite not being
a supernova, and might explain such velocities in the 2011 outburst of the
luminous blue variable progenitor of SN 2009ip. The typical transient duration
and kinetic energy are weeks to months, and up to approximately 1 foe,
respectively. The interaction of a NS with a giant envelope might be a phase in
the evolution of the progenitors of most NS-NS binary systems that later
undergo a merger event. If the NS spirals in all the way to the core of the
primary star and brings about its complete disruption we term this a `common
envelope jets supernova' (CEJSN), which is a possible explanation for the
peculiar supernova iPTF14hls. For a limited interaction of the NS with the
envelope we get a less luminous transient, which we term a CEJSN impostor.
| astro-ph.HE | we propose a new type of repeating transient outburst initiated by a neutron star ns entering the envelope of an evolved massive star accreting envelope material and subsequently launching jets which interact with their surroundings this interaction is the result of either a rapid expansion of the primary star due to an instability in its core near the end of its nuclear evolution or due to a dynamical process which rapidly brings the ns into the primary star the ejecta can reach velocities of 10000 kms despite not being a supernova and might explain such velocities in the 2011 outburst of the luminous blue variable progenitor of sn 2009ip the typical transient duration and kinetic energy are weeks to months and up to approximately 1 foe respectively the interaction of a ns with a giant envelope might be a phase in the evolution of the progenitors of most nsns binary systems that later undergo a merger event if the ns spirals in all the way to the core of the primary star and brings about its complete disruption we term this a common envelope jets supernova cejsn which is a possible explanation for the peculiar supernova iptf14hls for a limited interaction of the ns with the envelope we get a less luminous transient which we term a cejsn impostor | [['we', 'propose', 'a', 'new', 'type', 'of', 'repeating', 'transient', 'outburst', 'initiated', 'by', 'a', 'neutron', 'star', 'ns', 'entering', 'the', 'envelope', 'of', 'an', 'evolved', 'massive', 'star', 'accreting', 'envelope', 'material', 'and', 'subsequently', 'launching', 'jets', 'which', 'interact', 'with', 'their', 'surroundings', 'this', 'interaction', 'is', 'the', 'result', 'of', 'either', 'a', 'rapid', 'expansion', 'of', 'the', 'primary', 'star', 'due', 'to', 'an', 'instability', 'in', 'its', 'core', 'near', 'the', 'end', 'of', 'its', 'nuclear', 'evolution', 'or', 'due', 'to', 'a', 'dynamical', 'process', 'which', 'rapidly', 'brings', 'the', 'ns', 'into', 'the', 'primary', 'star', 'the', 'ejecta', 'can', 'reach', 'velocities', 'of', '10000', 'kms', 'despite', 'not', 'being', 'a', 'supernova', 'and', 'might', 'explain', 'such', 'velocities', 'in', 'the', '2011', 'outburst', 'of', 'the', 'luminous', 'blue', 'variable', 'progenitor', 'of', 'sn', '2009ip', 'the', 'typical', 'transient', 'duration', 'and', 'kinetic', 'energy', 'are', 'weeks', 'to', 'months', 'and', 'up', 'to', 'approximately', '1', 'foe', 'respectively', 'the', 'interaction', 'of', 'a', 'ns', 'with', 'a', 'giant', 'envelope', 'might', 'be', 'a', 'phase', 'in', 'the', 'evolution', 'of', 'the', 'progenitors', 'of', 'most', 'nsns', 'binary', 'systems', 'that', 'later', 'undergo', 'a', 'merger', 'event', 'if', 'the', 'ns', 'spirals', 'in', 'all', 'the', 'way', 'to', 'the', 'core', 'of', 'the', 'primary', 'star', 'and', 'brings', 'about', 'its', 'complete', 'disruption', 'we', 'term', 'this', 'a', 'common', 'envelope', 'jets', 'supernova', 'cejsn', 'which', 'is', 'a', 'possible', 'explanation', 'for', 'the', 'peculiar', 'supernova', 'iptf14hls', 'for', 'a', 'limited', 'interaction', 'of', 'the', 'ns', 'with', 'the', 'envelope', 'we', 'get', 'a', 'less', 'luminous', 'transient', 'which', 'we', 'term', 'a', 'cejsn', 'impostor']] | [-0.11138571028068202, 0.15242151683634977, -0.09390159893449243, 0.08214443608762205, -0.14734044615562036, -0.07071264360799585, 0.06949987546987321, 0.3678516360535605, -0.2135908120597785, -0.3021549662419905, 0.11082008460932093, -0.26241231053965547, -0.03930228468459673, 0.16384744684534974, -0.03395299953259698, -0.07775595271933322, 0.14462698509461633, 0.028299475356630268, -0.10487703593542425, -0.2517750717058446, 0.3055000286177226, 0.07076856233689884, 0.10136883603685352, -0.030529967396515825, 0.08764182594360265, -0.08914726527862796, -0.009167545753877746, -0.08420989576506016, -0.10458336983288168, 0.03111186066161858, 0.16919974191559503, 0.16205468798507022, 0.24636579887581603, -0.4180586394571091, -0.24258011666293464, 0.07115047234301902, 0.18620292016743048, 0.07400940341136597, -0.06182132251603214, -0.2475494837933794, 0.08695582258748953, -0.2859001571363578, -0.1833947566805671, 0.09023393682931384, 0.07473547451334185, 0.05378484648621012, -0.23110712783785375, 0.11841432124878105, 0.0942634970887158, -0.01777813431528316, -0.082516741499275, -0.025527764687454966, -0.05355886267030348, 0.05210303785555813, 0.07281567489228118, 0.09555800817056334, 0.11943455854405279, -0.16576734817263641, -0.012331451174535164, 0.4059886429108016, -0.03414411941643158, 0.01949867499422401, 0.24900246878924298, -0.17919759316259323, -0.12204736822229474, 0.19831375010124488, 0.14603048144519695, 0.13433781820647078, -0.17016045170194005, -0.07606548152052793, 0.05312783221079496, 0.17110962527389448, 0.05878858047443948, 0.049252204828996365, 0.32967882022925027, 0.19098630866256955, -0.0067007395483502374, 0.11238126711203338, -0.18437036279095634, -0.048595273700600156, -0.2510632255761012, -0.11675702255798906, -0.1226143211399558, 0.1430489101748702, -0.11229888118183416, -0.13327516182261992, 0.38112733525449416, 0.049069539330193784, 0.2067879587975352, -0.036528066884020355, 0.2530842213056871, 0.09922338316836883, 0.09046798085126193, 0.14204580699238228, 0.31172113600676055, 0.17948219627801107, 0.1444491241850197, -0.2529372752125303, 0.09204226226777638, 0.017887123545725324] |
1,802.0867 | On a new conjecture about super-monochromatic factorisations and
ultimate periodicity | We study a conjecture linking ultimate periodicity of infnite words to the
existence of colorings on finite words avoiding monochromatic factorisation of
suffixes, with the extra condition that the ordered concatenation of elements
of this factorisation remains monochromatic. This type of results shows the
limits of Ramsey theory in the context of combinatorics on words. We show some
reductions of the problem and the example of the Zimin word. Using the new
notion of consecutive length, we show that words avoiding large squares fulfill
the conjecture.
| math.CO | we study a conjecture linking ultimate periodicity of infnite words to the existence of colorings on finite words avoiding monochromatic factorisation of suffixes with the extra condition that the ordered concatenation of elements of this factorisation remains monochromatic this type of results shows the limits of ramsey theory in the context of combinatorics on words we show some reductions of the problem and the example of the zimin word using the new notion of consecutive length we show that words avoiding large squares fulfill the conjecture | [['we', 'study', 'a', 'conjecture', 'linking', 'ultimate', 'periodicity', 'of', 'infnite', 'words', 'to', 'the', 'existence', 'of', 'colorings', 'on', 'finite', 'words', 'avoiding', 'monochromatic', 'factorisation', 'of', 'suffixes', 'with', 'the', 'extra', 'condition', 'that', 'the', 'ordered', 'concatenation', 'of', 'elements', 'of', 'this', 'factorisation', 'remains', 'monochromatic', 'this', 'type', 'of', 'results', 'shows', 'the', 'limits', 'of', 'ramsey', 'theory', 'in', 'the', 'context', 'of', 'combinatorics', 'on', 'words', 'we', 'show', 'some', 'reductions', 'of', 'the', 'problem', 'and', 'the', 'example', 'of', 'the', 'zimin', 'word', 'using', 'the', 'new', 'notion', 'of', 'consecutive', 'length', 'we', 'show', 'that', 'words', 'avoiding', 'large', 'squares', 'fulfill', 'the', 'conjecture']] | [-0.18431362908517637, 0.15417307718158807, -0.06757711132360232, 0.09354670918384177, -0.07704458275246759, -0.052403687169168926, 0.09563100749902903, 0.3224494688126237, -0.33619113799271194, -0.25816855268812805, 0.08106048986570216, -0.2888728130208112, -0.12959235181035691, 0.15199932352596418, -0.12469264269308296, 0.02569552755584334, 0.10562162684969777, 0.07207919245445017, -0.07067980381746798, -0.2893679027396882, 0.3467624049124763, -0.04562543347467084, 0.24521232210099697, 0.0567515489325837, 0.12138623545531096, 0.05692766705354632, -0.07890151277574342, 0.007263941257152446, -0.14382658741618967, 0.1562979829641124, 0.22943964031752373, 0.17660352207590327, 0.2297162729813609, -0.38692726688676105, -0.14674803510113338, 0.14495998538684013, 0.10406155396945947, 0.11864343281770341, -0.010579186494375557, -0.2406078455861398, 0.16014307655047538, -0.1315825296197693, -0.11824685655707537, 0.010036778896180697, 0.03663663813021294, 0.05173280500389939, -0.21592689345612429, 0.012562838659166943, 0.17066458655997765, 0.08371110311384465, -0.0119726583469919, -0.10176567692136348, 0.06065178069632587, 0.09646844253117262, 0.08384985192462283, -0.023656052854020407, -0.027852623847984644, -0.14110879225353168, -0.1850037414006629, 0.37299449252354544, -0.05524200453357988, -0.1627159621566534, 0.14649133931109032, -0.14216279399819498, -0.19009171485857562, 0.07596552124528518, 0.09071912870980627, 0.09627451942583849, -0.0468812957568484, 0.12125981809926047, -0.1901105231670446, 0.1988865053930948, 0.21350695683382626, 0.09215271118811744, 0.1706002215573261, 0.1652364190045181, 0.059396454715169966, 0.1561695288157437, -0.028440414879167843, -0.025396596624104435, -0.3293434657632958, -0.15709505285147232, -0.15203915947647548, 0.041865014287015036, -0.13524673223413586, -0.24996589206505654, 0.38038810022543507, 0.17495321284784654, 0.16471220189055732, 0.11076505850394104, 0.2238591506773996, 0.09501496491260654, 0.06970366090536118, 0.020074543093742674, 0.107113003764954, 0.1711193007961197, -0.03127852252273019, -0.22581364281562177, 0.03548679373573598, 0.1908967096824199] |
1,802.08671 | Langevin Monte Carlo and JKO splitting | Algorithms based on discretizing Langevin diffusion are popular tools for
sampling from high-dimensional distributions. We develop novel connections
between such Monte Carlo algorithms, the theory of Wasserstein gradient flow,
and the operator splitting approach to solving PDEs. In particular, we show
that a proximal version of the Unadjusted Langevin Algorithm corresponds to a
scheme that alternates between solving the gradient flows of two specific
functionals on the space of probability measures. Using this perspective, we
derive some new non-asymptotic results on the convergence properties of this
algorithm.
| stat.CO | algorithms based on discretizing langevin diffusion are popular tools for sampling from highdimensional distributions we develop novel connections between such monte carlo algorithms the theory of wasserstein gradient flow and the operator splitting approach to solving pdes in particular we show that a proximal version of the unadjusted langevin algorithm corresponds to a scheme that alternates between solving the gradient flows of two specific functionals on the space of probability measures using this perspective we derive some new nonasymptotic results on the convergence properties of this algorithm | [['algorithms', 'based', 'on', 'discretizing', 'langevin', 'diffusion', 'are', 'popular', 'tools', 'for', 'sampling', 'from', 'highdimensional', 'distributions', 'we', 'develop', 'novel', 'connections', 'between', 'such', 'monte', 'carlo', 'algorithms', 'the', 'theory', 'of', 'wasserstein', 'gradient', 'flow', 'and', 'the', 'operator', 'splitting', 'approach', 'to', 'solving', 'pdes', 'in', 'particular', 'we', 'show', 'that', 'a', 'proximal', 'version', 'of', 'the', 'unadjusted', 'langevin', 'algorithm', 'corresponds', 'to', 'a', 'scheme', 'that', 'alternates', 'between', 'solving', 'the', 'gradient', 'flows', 'of', 'two', 'specific', 'functionals', 'on', 'the', 'space', 'of', 'probability', 'measures', 'using', 'this', 'perspective', 'we', 'derive', 'some', 'new', 'nonasymptotic', 'results', 'on', 'the', 'convergence', 'properties', 'of', 'this', 'algorithm']] | [-0.06569680786456099, 0.020548901311924744, -0.18026186104050312, 0.11100358174492915, -0.05269764582144803, -0.13519796012932883, 0.04301865172342279, 0.4251680526582674, -0.32892681602335094, -0.26961574431016355, 0.07556932750452396, -0.25891782665068563, -0.21377160455817465, 0.23581907551617887, -0.08413167882860563, 0.09333856809541755, 0.09592156153943004, -0.03746706429312284, -0.153548215109127, -0.2163935089229617, 0.32264199844914776, 0.02070422830252812, 0.29315372248148097, -0.001765641217985078, 0.20533107356007757, 0.00016156786346230013, -0.02169693561656208, 0.03231701086209712, -0.1740416515006044, 0.19622331011729935, 0.19152989955458405, 0.142626380146449, 0.3544625587622239, -0.3961601670531706, -0.19978370723025551, 0.10872161962712805, 0.12838030608113984, 0.13565670440894093, -0.08236353699754838, -0.2838493625943859, 0.04420900606582391, -0.10948547262741232, -0.05034303370175412, -0.13624599269837484, -0.08931588053960225, 0.08421269186569014, -0.2958571292759701, 0.09831268006892896, 0.012928579901826793, 0.04058245007997786, -0.039097755264233924, -0.14354922056690544, 0.06359071522180376, 0.058540800489999094, 0.05214635604837289, 0.010501752655696252, 0.10108612568469601, -0.07110597855336535, -0.18077064634183015, 0.3184854730364235, -0.09365893013497022, -0.28649170038654287, 0.17246249411522743, -0.05756818108132173, -0.1924749485768335, 0.10665176980647034, 0.2572737958218003, 0.21627146757111468, -0.18106580170235415, 0.0924886968622423, -0.02298260315310681, 0.07124541847613351, -0.016593067505364788, -0.03391243336486748, 0.050881808377459814, 0.19003845833445332, 0.17611630086455193, 0.13320648811233027, -0.0870738197894146, -0.23328245194607425, -0.2994842954921996, -0.15767960913008314, -0.1966246319640342, 0.00025120630175217817, -0.17659892319502904, -0.18263414390813346, 0.34602275585377523, 0.20768510357054598, 0.17927495122555342, 0.12014841262636514, 0.2999623589720791, 0.15796151482125467, -0.02724448425545432, 0.15312426608797142, 0.15516260600462822, 0.18825695906690826, 0.08388058046392839, -0.23912547058532893, 0.05676905876667849, 0.20643284989670777] |
1,802.08672 | The Poset of Mesh Patterns | We introduce the poset of mesh patterns, which generalises the permutation
pattern poset. We fully classify the mesh patterns for which the interval
[1^\emptyset,m] is non-pure, where 1^\emptyset is the unshaded singleton mesh
pattern. We present some results on the M\"obius function of the poset, and
show that {\mu}(1^\emptyset,m) is almost always zero. Finally, we introduce a
class of disconnected and non-shellable intervals by generalising the direct
product operation from permutations to mesh patterns.
| math.CO | we introduce the poset of mesh patterns which generalises the permutation pattern poset we fully classify the mesh patterns for which the interval 1emptysetm is nonpure where 1emptyset is the unshaded singleton mesh pattern we present some results on the mobius function of the poset and show that mu1emptysetm is almost always zero finally we introduce a class of disconnected and nonshellable intervals by generalising the direct product operation from permutations to mesh patterns | [['we', 'introduce', 'the', 'poset', 'of', 'mesh', 'patterns', 'which', 'generalises', 'the', 'permutation', 'pattern', 'poset', 'we', 'fully', 'classify', 'the', 'mesh', 'patterns', 'for', 'which', 'the', 'interval', '1emptysetm', 'is', 'nonpure', 'where', '1emptyset', 'is', 'the', 'unshaded', 'singleton', 'mesh', 'pattern', 'we', 'present', 'some', 'results', 'on', 'the', 'mobius', 'function', 'of', 'the', 'poset', 'and', 'show', 'that', 'mu1emptysetm', 'is', 'almost', 'always', 'zero', 'finally', 'we', 'introduce', 'a', 'class', 'of', 'disconnected', 'and', 'nonshellable', 'intervals', 'by', 'generalising', 'the', 'direct', 'product', 'operation', 'from', 'permutations', 'to', 'mesh', 'patterns']] | [-0.16787723687962747, 0.1368641268370122, -0.07005235614110782, 0.0395725419807156, -0.09741630129070139, -0.08272157968218688, 0.06356845408822344, 0.3916010050181772, -0.35891927547857794, -0.2246038252618951, 0.11124442714187775, -0.24432301912194407, -0.17108238363822162, 0.09624190784623506, -0.12171380450411266, 0.022293353322106347, 0.08432025672264502, 0.035618097114730886, -0.06149154365994036, -0.23764231648217415, 0.40733071393005443, 0.001869287971459644, 0.27529025110284944, 0.032103467706433485, 0.07177614929600501, -0.0006487632078499021, -0.07744865536912751, 0.048666769894443344, -0.17770482971331739, 0.05801477923359669, 0.216309190111261, 0.1533990009346793, 0.17158303009083783, -0.37461780360571934, -0.13073169929303333, 0.1461919645900169, 0.15251519348682233, 0.09739845485793767, -0.01507945141007363, -0.256036377538153, 0.17197948733580784, -0.16542392390662095, -0.0926142258858177, -0.03290085068208651, 0.02812704368835499, 0.02821073789866051, -0.30489511522923557, -0.006728982028197235, 0.10833673989793784, 0.0977521813802526, 0.01662695872216997, -0.09492583858491985, -0.02222930649164277, 0.11605946023777967, -0.033877593684862824, 0.03232652317194767, 0.03935769999163671, -0.03332763684677406, -0.14980270417118577, 0.37949572208429305, 0.011150052842297132, -0.2733123373686218, 0.10995170478643455, -0.19419694236073065, -0.1277248615621996, 0.10273087090274817, 0.10201503433333053, 0.1492763238526146, -0.04510477729613932, 0.08942637993121179, -0.14537568633037973, 0.12168929479281668, 0.1317710803401932, -0.013308267207475195, 0.12469675830027586, 0.15291675066732816, 0.14814163899888666, 0.2103065025146631, -0.055778318252020946, -0.0630228736792022, -0.31747189300580764, -0.12922665811288106, -0.132615095161846, -0.007487147377515343, -0.12325461871649834, -0.26328957495345195, 0.4370538431783797, 0.1331977249864279, 0.1799364796951151, 0.1505319162658875, 0.22148485994622322, 0.04606523589086785, 0.09499684069141694, 0.04979101760627728, 0.0626289938649484, 0.11279918231778371, 0.002583425091973073, -0.16953205881627198, 0.041658371641025156, 0.20459197800029333] |
1,802.08673 | Generalized entropies in quantum and classical statistical theories | We study a version of the generalized (h, {\phi})-entropies, introduced by
Salicr\'u et al, for a wide family of probabilistic models that includes
quantum and classical statistical theories as particular cases. We extend
previous works by exploring how to define (h, {\phi})-entropies in infinite
dimensional models.
| quant-ph | we study a version of the generalized h phientropies introduced by salicru et al for a wide family of probabilistic models that includes quantum and classical statistical theories as particular cases we extend previous works by exploring how to define h phientropies in infinite dimensional models | [['we', 'study', 'a', 'version', 'of', 'the', 'generalized', 'h', 'phientropies', 'introduced', 'by', 'salicru', 'et', 'al', 'for', 'a', 'wide', 'family', 'of', 'probabilistic', 'models', 'that', 'includes', 'quantum', 'and', 'classical', 'statistical', 'theories', 'as', 'particular', 'cases', 'we', 'extend', 'previous', 'works', 'by', 'exploring', 'how', 'to', 'define', 'h', 'phientropies', 'in', 'infinite', 'dimensional', 'models']] | [-0.030747600264199402, 0.11478543650034977, -0.03950891906962446, 0.07050351296430049, -0.06532281240367371, -0.1440335218794644, 0.02971851128740641, 0.29597928221135034, -0.21147233635470594, -0.3069358050580258, 0.039461909155563815, -0.20105194363176174, -0.20973209133776632, 0.2173113038196512, -0.14026301099068444, 0.06443845345031309, 0.019081657347471817, -0.048171576598416206, -0.0778590131161289, -0.2790070852953131, 0.3243249889827617, 0.0660601579533566, 0.2129151110496858, -0.01604949541227973, 0.07526590180223929, 0.08701145037522783, -0.05979390418075997, 0.09821285151286682, -0.26919246024187055, 0.12418084051055105, 0.2333319942011693, 0.12616725914868648, 0.28655124479985755, -0.32785661793921306, -0.33539384868724836, 0.12940969824305046, 0.1003844317899126, 0.11378887927402621, -0.005792666570809873, -0.2758954712797118, 0.059411254225541714, -0.2292990905293466, -0.13182794766338624, -0.11373731692362091, 0.05345344233691045, 0.0057503727983440394, -0.25266837391435454, 0.07297450431075919, 0.149340122067572, 0.051702991229198546, 0.007459938850091851, -0.105943798188768, 0.015495121823218853, 0.02073163409595904, -0.04471393305879167, -0.00390856546278962, 0.02147935292400096, -0.08873822538225795, -0.22498392305620338, 0.33776203865241056, -0.10747146043602539, -0.18385566941098028, 0.21260628385631286, -0.06666514170153634, -0.21978956262540558, -0.020237707451957722, 0.17131124720301316, 0.16425552761749082, -0.11344422541720711, 0.23597675804732085, -0.1255986464979208, 0.07953337073052788, 0.06010789873645357, 0.0015681922617975783, 0.12006242903273391, 0.07400825378262317, 0.007450635775255606, 0.19957713114664608, -0.01728562964632621, -0.16061125679128885, -0.29791475947865326, -0.16376808889048255, -0.118492064952, 0.06592838137673782, -0.022850022342185104, -0.16382092743626106, 0.3719787606564553, 0.16558820916005693, 0.2072803783432945, 0.06082827954188637, 0.18878309363904205, 0.09534954750384002, 0.010116005043053756, 0.07511350156678616, 0.16459319615640436, 0.19398402682829485, 0.061155726201832294, -0.10532476976716323, -0.0073503566622410135, 0.1682255597906592] |
1,802.08674 | An Algorithmic Framework to Control Bias in Bandit-based Personalization | Personalization is pervasive in the online space as it leads to higher
efficiency and revenue by allowing the most relevant content to be served to
each user. However, recent studies suggest that personalization methods can
propagate societal or systemic biases and polarize opinions; this has led to
calls for regulatory mechanisms and algorithms to combat bias and inequality.
Algorithmically, bandit optimization has enjoyed great success in learning user
preferences and personalizing content or feeds accordingly. We propose an
algorithmic framework that allows for the possibility to control bias or
discrimination in such bandit-based personalization. Our model allows for the
specification of general fairness constraints on the sensitive types of the
content that can be displayed to a user. The challenge, however, is to come up
with a scalable and low regret algorithm for the constrained optimization
problem that arises. Our main technical contribution is a provably fast and
low-regret algorithm for the fairness-constrained bandit optimization problem.
Our proofs crucially leverage the special structure of our problem. Experiments
on synthetic and real-world data sets show that our algorithmic framework can
control bias with only a minor loss to revenue.
| cs.LG cs.AI cs.CY cs.IR | personalization is pervasive in the online space as it leads to higher efficiency and revenue by allowing the most relevant content to be served to each user however recent studies suggest that personalization methods can propagate societal or systemic biases and polarize opinions this has led to calls for regulatory mechanisms and algorithms to combat bias and inequality algorithmically bandit optimization has enjoyed great success in learning user preferences and personalizing content or feeds accordingly we propose an algorithmic framework that allows for the possibility to control bias or discrimination in such banditbased personalization our model allows for the specification of general fairness constraints on the sensitive types of the content that can be displayed to a user the challenge however is to come up with a scalable and low regret algorithm for the constrained optimization problem that arises our main technical contribution is a provably fast and lowregret algorithm for the fairnessconstrained bandit optimization problem our proofs crucially leverage the special structure of our problem experiments on synthetic and realworld data sets show that our algorithmic framework can control bias with only a minor loss to revenue | [['personalization', 'is', 'pervasive', 'in', 'the', 'online', 'space', 'as', 'it', 'leads', 'to', 'higher', 'efficiency', 'and', 'revenue', 'by', 'allowing', 'the', 'most', 'relevant', 'content', 'to', 'be', 'served', 'to', 'each', 'user', 'however', 'recent', 'studies', 'suggest', 'that', 'personalization', 'methods', 'can', 'propagate', 'societal', 'or', 'systemic', 'biases', 'and', 'polarize', 'opinions', 'this', 'has', 'led', 'to', 'calls', 'for', 'regulatory', 'mechanisms', 'and', 'algorithms', 'to', 'combat', 'bias', 'and', 'inequality', 'algorithmically', 'bandit', 'optimization', 'has', 'enjoyed', 'great', 'success', 'in', 'learning', 'user', 'preferences', 'and', 'personalizing', 'content', 'or', 'feeds', 'accordingly', 'we', 'propose', 'an', 'algorithmic', 'framework', 'that', 'allows', 'for', 'the', 'possibility', 'to', 'control', 'bias', 'or', 'discrimination', 'in', 'such', 'banditbased', 'personalization', 'our', 'model', 'allows', 'for', 'the', 'specification', 'of', 'general', 'fairness', 'constraints', 'on', 'the', 'sensitive', 'types', 'of', 'the', 'content', 'that', 'can', 'be', 'displayed', 'to', 'a', 'user', 'the', 'challenge', 'however', 'is', 'to', 'come', 'up', 'with', 'a', 'scalable', 'and', 'low', 'regret', 'algorithm', 'for', 'the', 'constrained', 'optimization', 'problem', 'that', 'arises', 'our', 'main', 'technical', 'contribution', 'is', 'a', 'provably', 'fast', 'and', 'lowregret', 'algorithm', 'for', 'the', 'fairnessconstrained', 'bandit', 'optimization', 'problem', 'our', 'proofs', 'crucially', 'leverage', 'the', 'special', 'structure', 'of', 'our', 'problem', 'experiments', 'on', 'synthetic', 'and', 'realworld', 'data', 'sets', 'show', 'that', 'our', 'algorithmic', 'framework', 'can', 'control', 'bias', 'with', 'only', 'a', 'minor', 'loss', 'to', 'revenue']] | [-0.07344978764238592, -0.013662498864456687, -0.07394318115264974, 0.08515816071459197, -0.17697927493846075, -0.18936117629914043, 0.1073708864567642, 0.43780926349049903, -0.30119759097189847, -0.3596090689216825, 0.09284479036070606, -0.26833464763451614, -0.16755378890856054, 0.18850820870163607, -0.1628822159709379, 0.060567089642228726, 0.060932802131030965, 0.002468574328975563, -0.002027403697730067, -0.3170042221103222, 0.29550898159271416, 0.07822133248602164, 0.3203706871867578, 0.09113261727416977, 0.10549274101784269, 0.005286123205155612, -0.015639339289179738, 0.0377197876324526, -0.07370281179596945, 0.15671996915785166, 0.32818182738980944, 0.2515992762635768, 0.38441283015887884, -0.38195143491129346, -0.1952686661774701, 0.10256043045512615, 0.14684120620436528, 0.11099051891323079, -0.10230042230472328, -0.28682115175985395, 0.08622090139066461, -0.17702311267428858, -0.02670188590057473, -0.12046277548938511, -0.03819221614195124, -0.0023447305180710107, -0.3455355746941118, 0.024187574239651906, 0.046123485534108256, -0.008191021253917624, -0.030147791911728363, -0.10815264543961674, 0.027411551423928635, 0.16632448915855333, 0.10972044483526923, 0.03040236616407566, 0.163578283836079, -0.13983113105647904, -0.1843748331365031, 0.39324134381059656, -0.002366892291222983, -0.1888901604424146, 0.18725221557293664, -0.04714941064936712, -0.17370898513133354, 0.10879067642636657, 0.2526018627331577, 0.0964823161565604, -0.1564931298514584, 0.036475399372268735, -0.020745897361819438, 0.1921060693793915, 0.014875775191903034, 0.016274397813324085, 0.17182668297611337, 0.20319914885044577, 0.14421985538883064, 0.11198900366372573, -0.015670050114871346, -0.10489058988866083, -0.18958755993448637, -0.12042950084034533, -0.1241212073653777, 0.010678359337230737, -0.11554557191056104, -0.1220380768707809, 0.3721755120061577, 0.2109253344992624, 0.1563656860738395, 0.0913157485435433, 0.34838440546636434, 0.07871766463837233, 0.07833523789101983, 0.08638375194962411, 0.19206295669810936, 0.0235048923855442, 0.12561026510389092, -0.18735584213752002, 0.16193708875353502, -0.01662288200767601] |
1,802.08675 | Space-time fractional diffusion in cell movement models with delay | The movement of organisms and cells can be governed by occasional long
distance runs, according to an approximate L\'evy walk. For T cells migrating
through chronically-infected brain tissue, runs are further interrupted by long
pauses, and the aim here is to clarify the form of continuous model equations
which describe such movements. Starting from a microscopic velocity-jump model
based on experimental observations, we include power-law distributions of run
and waiting times and investigate the relevant parabolic limit from a kinetic
equation for resting and moving individuals. In biologically relevant regimes
we derive nonlocal diffusion equations, including fractional Laplacians in
space and fractional time derivatives. Its analysis and numerical experiments
shed light on how the searching strategy, and the impact from chemokinesis
responses to chemokines, shorten the average time taken to find rare targets in
the absence of direct guidance information such as chemotaxis.
| physics.bio-ph math.AP math.NA | the movement of organisms and cells can be governed by occasional long distance runs according to an approximate levy walk for t cells migrating through chronicallyinfected brain tissue runs are further interrupted by long pauses and the aim here is to clarify the form of continuous model equations which describe such movements starting from a microscopic velocityjump model based on experimental observations we include powerlaw distributions of run and waiting times and investigate the relevant parabolic limit from a kinetic equation for resting and moving individuals in biologically relevant regimes we derive nonlocal diffusion equations including fractional laplacians in space and fractional time derivatives its analysis and numerical experiments shed light on how the searching strategy and the impact from chemokinesis responses to chemokines shorten the average time taken to find rare targets in the absence of direct guidance information such as chemotaxis | [['the', 'movement', 'of', 'organisms', 'and', 'cells', 'can', 'be', 'governed', 'by', 'occasional', 'long', 'distance', 'runs', 'according', 'to', 'an', 'approximate', 'levy', 'walk', 'for', 't', 'cells', 'migrating', 'through', 'chronicallyinfected', 'brain', 'tissue', 'runs', 'are', 'further', 'interrupted', 'by', 'long', 'pauses', 'and', 'the', 'aim', 'here', 'is', 'to', 'clarify', 'the', 'form', 'of', 'continuous', 'model', 'equations', 'which', 'describe', 'such', 'movements', 'starting', 'from', 'a', 'microscopic', 'velocityjump', 'model', 'based', 'on', 'experimental', 'observations', 'we', 'include', 'powerlaw', 'distributions', 'of', 'run', 'and', 'waiting', 'times', 'and', 'investigate', 'the', 'relevant', 'parabolic', 'limit', 'from', 'a', 'kinetic', 'equation', 'for', 'resting', 'and', 'moving', 'individuals', 'in', 'biologically', 'relevant', 'regimes', 'we', 'derive', 'nonlocal', 'diffusion', 'equations', 'including', 'fractional', 'laplacians', 'in', 'space', 'and', 'fractional', 'time', 'derivatives', 'its', 'analysis', 'and', 'numerical', 'experiments', 'shed', 'light', 'on', 'how', 'the', 'searching', 'strategy', 'and', 'the', 'impact', 'from', 'chemokinesis', 'responses', 'to', 'chemokines', 'shorten', 'the', 'average', 'time', 'taken', 'to', 'find', 'rare', 'targets', 'in', 'the', 'absence', 'of', 'direct', 'guidance', 'information', 'such', 'as', 'chemotaxis']] | [-0.06513481695825855, 0.14853642528295824, -0.08740925466219056, 0.06778901837459032, -0.07550599717812494, -0.14626191694170554, 0.07113189595245346, 0.36237289469874073, -0.28165055622994, -0.2938451125610171, 0.10525016960149618, -0.2809537469297119, -0.17024271962966056, 0.18201140154331447, -0.036208220818641446, 0.05318604684921959, 0.05331362789688328, 0.006365656520814654, 0.021054296812921074, -0.1919473751344064, 0.2323203514699976, 0.02727416053526632, 0.22641575372619357, 0.0008325071622293891, 0.13203491312649815, -0.008786102069924908, -0.09181982490848353, -0.0205140052459154, -0.16624916755224425, 0.05300181955495413, 0.21229635378187325, 0.07795203739697946, 0.27751932584792904, -0.5460082501146599, -0.24312933673751905, 0.09127786543867583, 0.14750347329065838, 0.09066089876128215, -0.014694205661971412, -0.3297347915755149, 0.020681353167016456, -0.10928119957473473, -0.12301331901830351, -0.07513615355582524, 0.07115421880115853, 0.08656783128844191, -0.2712719933598811, 0.11855594876242127, 0.01779157315143087, 0.04551013140668366, -0.10211603431417508, -0.08785030853452412, -0.0061566880331349935, 0.16354961957739575, 0.08062814905288372, -0.019438000157283922, 0.1544537388006265, -0.12499738770953202, -0.1333720621434932, 0.3651156154930169, -0.06186280146171834, -0.20703547503402892, 0.1882000621754993, -0.14608177567785935, -0.08181410025415532, 0.13103506984915717, 0.21817781571761197, 0.11998315239804037, -0.1700949709241589, 0.03787190575773517, 0.015426849384944067, 0.12945093376172298, 0.06128630350948252, 0.012624867201009964, 0.17634585023203747, 0.22035221524325246, 0.03306448875252712, 0.09121825196945392, -0.09031328578881676, -0.14542090664584692, -0.294537671735999, -0.14834149401793453, -0.14672866306954613, 0.07949065853608772, -0.09120539675036557, -0.11347819346908136, 0.38392352297116095, 0.1563615561875759, 0.20631178937264527, 0.09127046223250977, 0.22209408040099005, 0.1044353476175642, 0.029802609575212212, 0.052321264770250196, 0.15205459142969063, 0.0723091653706704, 0.12944954354481125, -0.25425359041179063, 0.10340633166290106, 0.042511278220141925] |
1,802.08676 | A Quantum-Search-Aided Dynamic Programming Framework for Pareto Optimal
Routing in Wireless Multihop Networks | Wireless Multihop Networks (WMHNs) have to strike a trade-off among diverse
and often conflicting Quality-of-Service (QoS) requirements. The resultant
solutions may be included by the Pareto Front under the concept of Pareto
Optimality. However, the problem of finding all the Pareto-optimal routes in
WMHNs is classified as NP-hard, since the number of legitimate routes increases
exponentially, as the nodes proliferate. Quantum Computing offers an attractive
framework of rendering the Pareto-optimal routing problem tractable. In this
context, a pair of quantum-assisted algorithms have been proposed, namely the
Non-Dominated Quantum Optimization (NDQO) and the Non-Dominated Quantum
Iterative Optimization (NDQIO). However, their complexity is proportional to
$\sqrt{N}$, where $N$ corresponds to the total number of legitimate routes,
thus still failing to find the solutions in "polynomial time". As a remedy, we
devise a dynamic programming framework and propose the so-called Evolutionary
Quantum Pareto Optimization (EQPO) algorithm. We analytically characterize the
complexity imposed by the EQPO algorithm and demonstrate that it succeeds in
solving the Pareto-optimal routing problem in polynomial time. Finally, we
demonstrate by simulations that the EQPO algorithm achieves a complexity
reduction, which is at least an order of magnitude, when compared to its
predecessors, albeit at the cost of a modest heuristic accuracy reduction.
| quant-ph cs.DS | wireless multihop networks wmhns have to strike a tradeoff among diverse and often conflicting qualityofservice qos requirements the resultant solutions may be included by the pareto front under the concept of pareto optimality however the problem of finding all the paretooptimal routes in wmhns is classified as nphard since the number of legitimate routes increases exponentially as the nodes proliferate quantum computing offers an attractive framework of rendering the paretooptimal routing problem tractable in this context a pair of quantumassisted algorithms have been proposed namely the nondominated quantum optimization ndqo and the nondominated quantum iterative optimization ndqio however their complexity is proportional to sqrtn where n corresponds to the total number of legitimate routes thus still failing to find the solutions in polynomial time as a remedy we devise a dynamic programming framework and propose the socalled evolutionary quantum pareto optimization eqpo algorithm we analytically characterize the complexity imposed by the eqpo algorithm and demonstrate that it succeeds in solving the paretooptimal routing problem in polynomial time finally we demonstrate by simulations that the eqpo algorithm achieves a complexity reduction which is at least an order of magnitude when compared to its predecessors albeit at the cost of a modest heuristic accuracy reduction | [['wireless', 'multihop', 'networks', 'wmhns', 'have', 'to', 'strike', 'a', 'tradeoff', 'among', 'diverse', 'and', 'often', 'conflicting', 'qualityofservice', 'qos', 'requirements', 'the', 'resultant', 'solutions', 'may', 'be', 'included', 'by', 'the', 'pareto', 'front', 'under', 'the', 'concept', 'of', 'pareto', 'optimality', 'however', 'the', 'problem', 'of', 'finding', 'all', 'the', 'paretooptimal', 'routes', 'in', 'wmhns', 'is', 'classified', 'as', 'nphard', 'since', 'the', 'number', 'of', 'legitimate', 'routes', 'increases', 'exponentially', 'as', 'the', 'nodes', 'proliferate', 'quantum', 'computing', 'offers', 'an', 'attractive', 'framework', 'of', 'rendering', 'the', 'paretooptimal', 'routing', 'problem', 'tractable', 'in', 'this', 'context', 'a', 'pair', 'of', 'quantumassisted', 'algorithms', 'have', 'been', 'proposed', 'namely', 'the', 'nondominated', 'quantum', 'optimization', 'ndqo', 'and', 'the', 'nondominated', 'quantum', 'iterative', 'optimization', 'ndqio', 'however', 'their', 'complexity', 'is', 'proportional', 'to', 'sqrtn', 'where', 'n', 'corresponds', 'to', 'the', 'total', 'number', 'of', 'legitimate', 'routes', 'thus', 'still', 'failing', 'to', 'find', 'the', 'solutions', 'in', 'polynomial', 'time', 'as', 'a', 'remedy', 'we', 'devise', 'a', 'dynamic', 'programming', 'framework', 'and', 'propose', 'the', 'socalled', 'evolutionary', 'quantum', 'pareto', 'optimization', 'eqpo', 'algorithm', 'we', 'analytically', 'characterize', 'the', 'complexity', 'imposed', 'by', 'the', 'eqpo', 'algorithm', 'and', 'demonstrate', 'that', 'it', 'succeeds', 'in', 'solving', 'the', 'paretooptimal', 'routing', 'problem', 'in', 'polynomial', 'time', 'finally', 'we', 'demonstrate', 'by', 'simulations', 'that', 'the', 'eqpo', 'algorithm', 'achieves', 'a', 'complexity', 'reduction', 'which', 'is', 'at', 'least', 'an', 'order', 'of', 'magnitude', 'when', 'compared', 'to', 'its', 'predecessors', 'albeit', 'at', 'the', 'cost', 'of', 'a', 'modest', 'heuristic', 'accuracy', 'reduction']] | [-0.17716120175591007, 0.02123102650121063, -0.06529220302973814, 0.06591039296385567, -0.07016245041862686, -0.2036811207068982, 0.1215654151092529, 0.3627565539214964, -0.3102208334600451, -0.3583275556207556, 0.07759334303760689, -0.24055976076318017, -0.17830205776506283, 0.14590899854555578, -0.10544845726994324, 0.13126304357825774, 0.03904989248127746, 0.004127235948635191, -0.031973918729904224, -0.3277340708821734, 0.23988905071630723, 0.0726775002980892, 0.3112353808188635, 0.03504937075035628, 0.11319601956513983, -0.041273895698305293, 0.021746094589960293, 0.04239389483135805, -0.1135257873560368, 0.07877856068311963, 0.3259459510955274, 0.22821351582189067, 0.36183167981512065, -0.4126738676180442, -0.16195398115956072, 0.1499690705358945, 0.18587415904010557, 0.08103929376009555, -0.019365148084812718, -0.23322345659748386, 0.11816594794691443, -0.1456099759569549, -0.0861341026194616, -0.0472449525444773, -0.008206743740045758, 0.02000872447706796, -0.2850901021515552, 0.006519709914153562, -0.013890753217523371, -0.031205120751291365, -0.0348597024874391, -0.09213169419846094, 0.027270049656004602, 0.08274716559223558, 0.044396697503217904, 0.02637275322386763, 0.07256593409258483, -0.1392420563517852, -0.19071233304407428, 0.4114502617378084, 0.047212604277208914, -0.2018347664035258, 0.15176683050853695, -0.004471080227110961, -0.11401715349311597, 0.18203549747776926, 0.18965753364325755, 0.11479827411129923, -0.156482299061539, 0.08580877309299041, -0.03907610031669561, 0.12902017071870947, 0.08680713491338254, 0.05675832692079654, 0.13107764655932672, 0.2099925091117157, 0.19291678127781742, 0.16650932007793579, -0.0346050103801993, -0.16404521825204404, -0.2224879101826925, -0.14124529688985119, -0.20064448978605945, -0.017969561650403844, -0.15060500355190667, -0.12943028119063718, 0.3630451792202408, 0.15793190587286499, 0.14128801345695458, 0.14967272555355945, 0.3503762729192588, 0.12152063023861942, 0.014015348453540355, 0.16584992208964058, 0.2093139951307308, 0.03053624176800214, 0.09774757181531726, -0.2718895035506277, 0.14100029980254114, 0.05370326739601532] |
1,802.08677 | Plasma-Cascade micro-bunching Amplifier and Coherent electron Cooling of
a Hadron Beams | In this paper we describe an instability, which we called a Plasma-Cascade
Amplifier, occurring in electron beams propagating along a straight trajectory.
| physics.acc-ph | in this paper we describe an instability which we called a plasmacascade amplifier occurring in electron beams propagating along a straight trajectory | [['in', 'this', 'paper', 'we', 'describe', 'an', 'instability', 'which', 'we', 'called', 'a', 'plasmacascade', 'amplifier', 'occurring', 'in', 'electron', 'beams', 'propagating', 'along', 'a', 'straight', 'trajectory']] | [-0.2466967614988486, 0.2038706958666721, -0.1086837894150189, 0.014812392287976331, -0.03366338718859922, -0.12434398999348992, -0.01213314168576506, 0.4588059926671641, -0.28956942615054904, -0.14126437992256666, 0.02660503946909947, -0.2898999596280711, -0.1475125951692462, 0.17612932711130097, -0.10226388523976009, 0.020612115661303203, 0.05116206303327566, -0.01958209392060304, -0.01263298759503024, -0.048989532604104, 0.2629993478102343, 0.08622956669534601, 0.28254118455307825, -0.018887146109981195, 0.19905811087006614, 0.02357554981218917, 0.0789198526846511, 0.03315001335882005, -0.19020387982683523, 0.06586957030231133, 0.23483586870133877, 0.06288702617443744, 0.25545436037438257, -0.47362214504253297, -0.19648944001112664, 0.039221201092004776, 0.26344055717899684, 0.19734842604624905, -0.09998530158329577, -0.19753268256872183, -0.02809293204475017, -0.1896953106458698, -0.19262901888716788, 0.05732641723893937, -0.06886906203414712, 0.01757320983424073, -0.24731990091857456, -0.02894189834062542, 0.11119911376209486, 0.059362905543474925, 0.001521912979937735, 0.08569707375551973, 0.056579362867133956, -0.02827031258493662, 0.03376066188017527, 0.10274698977757778, 0.09414381396380209, -0.10204919457568654, -0.13226126289616028, 0.33972788389239994, -0.054078241322366966, -0.19512213571440606, 0.09733248466537112, -0.15145192738799823, -0.08375361065069835, 0.19279622650217443, 0.29111374648553984, 0.11412038966747266, -0.14592134821716518, -0.05090075301095134, -0.051069460720533415, 0.11566911071228485, 0.19320917279193445, -0.012032768556049891, 0.23898925339537008, 0.21937704795882815, 0.03661778453914892, 0.1926038976137837, -0.1494893595753681, -0.0417452941515616, -0.39182923095566885, -0.18577148216510458, -0.05783218583313837, 0.025840609556152708, 0.0875704274291084, -0.25419298240116667, 0.5009797768933433, 0.18503558316401073, 0.23350942028420313, -0.07954559816114072, 0.3415129235723898, 0.13254581799819357, -0.006941808653729302, 0.13148249801070916, 0.22376036040839695, 0.11562649568631536, 0.09931092766956204, -0.1670912000395003, -0.043083295093051026, 0.025004160634818532] |
1,802.08678 | Verifying Controllers Against Adversarial Examples with Bayesian
Optimization | Recent successes in reinforcement learning have lead to the development of
complex controllers for real-world robots. As these robots are deployed in
safety-critical applications and interact with humans, it becomes critical to
ensure safety in order to avoid causing harm. A first step in this direction is
to test the controllers in simulation. To be able to do this, we need to
capture what we mean by safety and then efficiently search the space of all
behaviors to see if they are safe. In this paper, we present an active-testing
framework based on Bayesian Optimization. We specify safety constraints using
logic and exploit structure in the problem in order to test the system for
adversarial counter examples that violate the safety specifications. These
specifications are defined as complex boolean combinations of smooth functions
on the trajectories and, unlike reward functions in reinforcement learning, are
expressive and impose hard constraints on the system. In our framework, we
exploit regularity assumptions on individual functions in form of a Gaussian
Process (GP) prior. We combine these into a coherent optimization framework
using problem structure. The resulting algorithm is able to provably verify
complex safety specifications or alternatively find counter examples.
Experimental results show that the proposed method is able to find adversarial
examples quickly.
| cs.SY cs.LG cs.RO stat.ML | recent successes in reinforcement learning have lead to the development of complex controllers for realworld robots as these robots are deployed in safetycritical applications and interact with humans it becomes critical to ensure safety in order to avoid causing harm a first step in this direction is to test the controllers in simulation to be able to do this we need to capture what we mean by safety and then efficiently search the space of all behaviors to see if they are safe in this paper we present an activetesting framework based on bayesian optimization we specify safety constraints using logic and exploit structure in the problem in order to test the system for adversarial counter examples that violate the safety specifications these specifications are defined as complex boolean combinations of smooth functions on the trajectories and unlike reward functions in reinforcement learning are expressive and impose hard constraints on the system in our framework we exploit regularity assumptions on individual functions in form of a gaussian process gp prior we combine these into a coherent optimization framework using problem structure the resulting algorithm is able to provably verify complex safety specifications or alternatively find counter examples experimental results show that the proposed method is able to find adversarial examples quickly | [['recent', 'successes', 'in', 'reinforcement', 'learning', 'have', 'lead', 'to', 'the', 'development', 'of', 'complex', 'controllers', 'for', 'realworld', 'robots', 'as', 'these', 'robots', 'are', 'deployed', 'in', 'safetycritical', 'applications', 'and', 'interact', 'with', 'humans', 'it', 'becomes', 'critical', 'to', 'ensure', 'safety', 'in', 'order', 'to', 'avoid', 'causing', 'harm', 'a', 'first', 'step', 'in', 'this', 'direction', 'is', 'to', 'test', 'the', 'controllers', 'in', 'simulation', 'to', 'be', 'able', 'to', 'do', 'this', 'we', 'need', 'to', 'capture', 'what', 'we', 'mean', 'by', 'safety', 'and', 'then', 'efficiently', 'search', 'the', 'space', 'of', 'all', 'behaviors', 'to', 'see', 'if', 'they', 'are', 'safe', 'in', 'this', 'paper', 'we', 'present', 'an', 'activetesting', 'framework', 'based', 'on', 'bayesian', 'optimization', 'we', 'specify', 'safety', 'constraints', 'using', 'logic', 'and', 'exploit', 'structure', 'in', 'the', 'problem', 'in', 'order', 'to', 'test', 'the', 'system', 'for', 'adversarial', 'counter', 'examples', 'that', 'violate', 'the', 'safety', 'specifications', 'these', 'specifications', 'are', 'defined', 'as', 'complex', 'boolean', 'combinations', 'of', 'smooth', 'functions', 'on', 'the', 'trajectories', 'and', 'unlike', 'reward', 'functions', 'in', 'reinforcement', 'learning', 'are', 'expressive', 'and', 'impose', 'hard', 'constraints', 'on', 'the', 'system', 'in', 'our', 'framework', 'we', 'exploit', 'regularity', 'assumptions', 'on', 'individual', 'functions', 'in', 'form', 'of', 'a', 'gaussian', 'process', 'gp', 'prior', 'we', 'combine', 'these', 'into', 'a', 'coherent', 'optimization', 'framework', 'using', 'problem', 'structure', 'the', 'resulting', 'algorithm', 'is', 'able', 'to', 'provably', 'verify', 'complex', 'safety', 'specifications', 'or', 'alternatively', 'find', 'counter', 'examples', 'experimental', 'results', 'show', 'that', 'the', 'proposed', 'method', 'is', 'able', 'to', 'find', 'adversarial', 'examples', 'quickly']] | [-0.07144922174269422, 0.01840297513304644, -0.09129996513504357, 0.08707859745569467, -0.1223273825499096, -0.14702781092685957, 0.0229434472059698, 0.44905072836471455, -0.2679705270477349, -0.33843451550762566, 0.11216807807185909, -0.2443936914649038, -0.196101787184099, 0.1872738596700531, -0.1387274636776142, 0.12874041461563182, 0.04875997060167027, 0.0310740346953805, -0.029693813273306228, -0.2650523482622313, 0.3152364149867069, -0.010025668860457483, 0.256431693410767, 0.02861225145281337, 0.09253574157399791, -0.011362829321019707, 0.03210181247531658, 0.01900692877257132, -0.08862078111040839, 0.1277535219643531, 0.32059417312654354, 0.22816706381383398, 0.3191501159026908, -0.48097730659480603, -0.18633724214852831, 0.12866541974224327, 0.11579229142087223, 0.08278730950717415, -0.014767270630580328, -0.30112892046814693, 0.12165522055334545, -0.17715763047647973, -0.08464575209211381, -0.1712206118074911, -0.059545869927942044, 0.03972388485091783, -0.2982454833447091, -0.043133348341853846, 0.07064719361452652, 0.0178192031702825, -0.0527554573956877, -0.0462560408604553, 0.02573860571719706, 0.13854686869862712, 0.03796825800188041, -0.006406962585502437, 0.14603313801455356, -0.1386743186695856, -0.14961206432476284, 0.3607237215907801, 0.0004250800608479906, -0.25340576114886926, 0.20749592370675168, -0.07504303029161834, -0.1898720902324255, 0.0993256120432523, 0.2692866365425289, 0.12575989231201154, -0.15593728495240655, 0.05298107755453592, -0.0041440586359905345, 0.17476702895725058, 0.03464501546252342, -0.0012187472256343988, 0.16402132522447832, 0.19170489783199238, 0.10287944431793654, 0.14296899290638976, -0.01869287522443171, -0.12496067611722364, -0.29428871719920563, -0.11891497531129668, -0.1183310295893101, -0.013459667531285613, -0.037567378119551686, -0.14078232162809443, 0.34322962019747744, 0.24529558600569587, 0.1836374378940534, 0.12177658232727222, 0.34393350857620436, 0.0942240836115421, 0.09757228353992105, 0.10303522284763554, 0.2341023925691843, 0.04966134644180004, 0.10781761906331494, -0.1763084639451422, 0.12589973195932716, 0.0038590907329870833] |
1,802.08679 | Learning Optimal Policies from Observational Data | Choosing optimal (or at least better) policies is an important problem in
domains from medicine to education to finance and many others. One approach to
this problem is through controlled experiments/trials - but controlled
experiments are expensive. Hence it is important to choose the best policies on
the basis of observational data. This presents two difficult challenges: (i)
missing counterfactuals, and (ii) selection bias. This paper presents
theoretical bounds on estimation errors of counterfactuals from observational
data by making connections to domain adaptation theory. It also presents a
principled way of choosing optimal policies using domain adversarial neural
networks. We illustrate the effectiveness of domain adversarial training
together with various features of our algorithm on a semi-synthetic breast
cancer dataset and a supervised UCI dataset (Statlog).
| cs.AI cs.LG stat.ML | choosing optimal or at least better policies is an important problem in domains from medicine to education to finance and many others one approach to this problem is through controlled experimentstrials but controlled experiments are expensive hence it is important to choose the best policies on the basis of observational data this presents two difficult challenges i missing counterfactuals and ii selection bias this paper presents theoretical bounds on estimation errors of counterfactuals from observational data by making connections to domain adaptation theory it also presents a principled way of choosing optimal policies using domain adversarial neural networks we illustrate the effectiveness of domain adversarial training together with various features of our algorithm on a semisynthetic breast cancer dataset and a supervised uci dataset statlog | [['choosing', 'optimal', 'or', 'at', 'least', 'better', 'policies', 'is', 'an', 'important', 'problem', 'in', 'domains', 'from', 'medicine', 'to', 'education', 'to', 'finance', 'and', 'many', 'others', 'one', 'approach', 'to', 'this', 'problem', 'is', 'through', 'controlled', 'experimentstrials', 'but', 'controlled', 'experiments', 'are', 'expensive', 'hence', 'it', 'is', 'important', 'to', 'choose', 'the', 'best', 'policies', 'on', 'the', 'basis', 'of', 'observational', 'data', 'this', 'presents', 'two', 'difficult', 'challenges', 'i', 'missing', 'counterfactuals', 'and', 'ii', 'selection', 'bias', 'this', 'paper', 'presents', 'theoretical', 'bounds', 'on', 'estimation', 'errors', 'of', 'counterfactuals', 'from', 'observational', 'data', 'by', 'making', 'connections', 'to', 'domain', 'adaptation', 'theory', 'it', 'also', 'presents', 'a', 'principled', 'way', 'of', 'choosing', 'optimal', 'policies', 'using', 'domain', 'adversarial', 'neural', 'networks', 'we', 'illustrate', 'the', 'effectiveness', 'of', 'domain', 'adversarial', 'training', 'together', 'with', 'various', 'features', 'of', 'our', 'algorithm', 'on', 'a', 'semisynthetic', 'breast', 'cancer', 'dataset', 'and', 'a', 'supervised', 'uci', 'dataset', 'statlog']] | [-0.03694867673784313, -0.018964985039958738, -0.062193973508580185, 0.10139255030213182, -0.17812668803200973, -0.19605653778824017, 0.11461588076686835, 0.4347206810300004, -0.2600740883953688, -0.3404238278697419, 0.1275738142440247, -0.2876257713055011, -0.19127387859161973, 0.22563892119654977, -0.19010490135903038, 0.09281859611638071, 0.12444865679542526, -0.020934697978834554, 0.010675946197555802, -0.3116578543634434, 0.33393794133108323, 0.0563744230165593, 0.3445725935043737, 0.02137875100364672, 0.11536192572183483, -0.05609343703306181, -0.04544598394171978, -0.006728858058530141, -0.10086699940143078, 0.18910312662999018, 0.37224188238586775, 0.24233988784935054, 0.4032628410760828, -0.397076830411769, -0.19021139228035036, 0.09298961998788806, 0.1511373075569518, 0.14922248141279792, -0.037303910836789425, -0.31476106281520994, 0.06587101550909077, -0.13924734071450784, -0.017798746026942612, -0.1225164161419602, -0.03070520573651524, -0.03827109373821991, -0.3457013324009088, 0.05542410644906103, 0.02022942971453313, 0.10365866282121922, -0.05879167316110456, -0.14791882250124846, 0.049420188306982256, 0.15260170020988378, 0.10416320891392122, 0.052506952739615996, 0.13410583374325216, -0.15650236648242405, -0.17373240749707552, 0.3434000137920787, 0.012347525326398814, -0.22820180167568985, 0.18689707624233834, -0.03498446665007651, -0.13829445716266225, 0.047836973873247216, 0.2272947410621294, 0.11384655327755745, -0.18962090133833207, 0.024525093413014874, -0.0036844265064209457, 0.15571863649647713, 0.019631717219661043, -0.04809480643172453, 0.13331198690050258, 0.2634396498901694, 0.08539006184754379, 0.13932753960427835, -0.061568104762326534, -0.06682978029082703, -0.28142524257726304, -0.05268417825028906, -0.17725163079586212, -0.006803263387665516, -0.10713738811780164, -0.14185281397634739, 0.3841596065577483, 0.2368921456267921, 0.18061965596067106, 0.056996267445563395, 0.35321583722271327, 0.005182359277694751, 0.055306070889308445, 0.06653501203934836, 0.15621039312242008, 0.012713564512494013, 0.12090205611297633, -0.1797715419055364, 0.12265984059833898, -0.007173244851334702] |
1,802.0868 | Advantages of versatile neural-network decoding for topological codes | Finding optimal correction of errors in generic stabilizer codes is a
computationally hard problem, even for simple noise models. While this task can
be simplified for codes with some structure, such as topological stabilizer
codes, developing good and efficient decoders still remains a challenge. In our
work, we systematically study a very versatile class of decoders based on
feedforward neural networks. To demonstrate adaptability, we apply neural
decoders to the triangular color and toric codes under various noise models
with realistic features, such as spatially-correlated errors. We report that
neural decoders provide significant improvement over leading efficient decoders
in terms of the error-correction threshold. Using neural networks simplifies
the process of designing well-performing decoders, and does not require prior
knowledge of the underlying noise model.
| quant-ph stat.ML | finding optimal correction of errors in generic stabilizer codes is a computationally hard problem even for simple noise models while this task can be simplified for codes with some structure such as topological stabilizer codes developing good and efficient decoders still remains a challenge in our work we systematically study a very versatile class of decoders based on feedforward neural networks to demonstrate adaptability we apply neural decoders to the triangular color and toric codes under various noise models with realistic features such as spatiallycorrelated errors we report that neural decoders provide significant improvement over leading efficient decoders in terms of the errorcorrection threshold using neural networks simplifies the process of designing wellperforming decoders and does not require prior knowledge of the underlying noise model | [['finding', 'optimal', 'correction', 'of', 'errors', 'in', 'generic', 'stabilizer', 'codes', 'is', 'a', 'computationally', 'hard', 'problem', 'even', 'for', 'simple', 'noise', 'models', 'while', 'this', 'task', 'can', 'be', 'simplified', 'for', 'codes', 'with', 'some', 'structure', 'such', 'as', 'topological', 'stabilizer', 'codes', 'developing', 'good', 'and', 'efficient', 'decoders', 'still', 'remains', 'a', 'challenge', 'in', 'our', 'work', 'we', 'systematically', 'study', 'a', 'very', 'versatile', 'class', 'of', 'decoders', 'based', 'on', 'feedforward', 'neural', 'networks', 'to', 'demonstrate', 'adaptability', 'we', 'apply', 'neural', 'decoders', 'to', 'the', 'triangular', 'color', 'and', 'toric', 'codes', 'under', 'various', 'noise', 'models', 'with', 'realistic', 'features', 'such', 'as', 'spatiallycorrelated', 'errors', 'we', 'report', 'that', 'neural', 'decoders', 'provide', 'significant', 'improvement', 'over', 'leading', 'efficient', 'decoders', 'in', 'terms', 'of', 'the', 'errorcorrection', 'threshold', 'using', 'neural', 'networks', 'simplifies', 'the', 'process', 'of', 'designing', 'wellperforming', 'decoders', 'and', 'does', 'not', 'require', 'prior', 'knowledge', 'of', 'the', 'underlying', 'noise', 'model']] | [-0.11778201612085104, 0.016068392331711947, -0.04937090906500816, 0.11527718516679306, -0.05647168841958046, -0.28085686153545975, 0.051443610172718764, 0.47390897561237216, -0.2726459927149117, -0.2905689101107419, 0.09043892456125469, -0.1746027668491006, -0.25237303580436854, 0.21819191168062388, -0.170880493439734, 0.16033920598775148, 0.13019625770673154, -0.0032613384816795586, -0.15113950631814077, -0.3048698700424284, 0.28412253719568253, 0.14414711429178714, 0.30840214420109985, 0.005712667511310428, 0.10263792084902525, -0.04498267518356443, 0.023851740628480913, -0.036461067251861094, -0.07931339576496975, 0.11710788579424843, 0.31238167107180925, 0.12903620049729944, 0.2309457615185529, -0.4370550511330366, -0.2896855519711971, 0.1086188408397138, 0.14366895481385292, 0.21853110538236797, -0.044604729381389915, -0.2199357925057411, 0.14240771427657456, -0.19307025404274464, 0.04606710102409124, -0.13533385165035725, -0.052127134658396246, -0.009245173180941492, -0.31286362698161974, 0.013790709920227528, 0.11988281997293233, 0.06628985538519919, 0.007709083076566457, -0.1539094285070896, 0.06388181435037404, 0.13234592476114632, -0.035321096966275944, 0.06594310094602406, 0.09804343334957957, -0.17998454598896205, -0.16736150958575308, 0.35552337108552456, -0.03684555706754327, -0.2609081393480301, 0.15330372079648077, -0.0012205451875925064, -0.16766797979176046, 0.1304137084297836, 0.24044701452553272, 0.09627286152495071, -0.1406038580466993, 0.05151346970582381, 0.0059908306300640105, 0.20098811324313284, 0.008982792757451534, 0.11517992165498435, 0.1712341078259051, 0.2243517286963761, 0.03285889733769, 0.18439486168976874, -0.08732789986394346, -0.06271699029952288, -0.25308193155378106, -0.06812885549664498, -0.16221029058098793, 0.027472076100413686, -0.10443612571025733, -0.21081272003054619, 0.4088155875355005, 0.20138438184931876, 0.1534565623626113, 0.14612040864676237, 0.33924715912342074, 0.011660375679843129, 0.11105016707628966, 0.1845608332983684, 0.17857794853043743, 0.11611880518496037, 0.02345519856456667, -0.1538707169853151, 0.13032013608142734, 0.0406309492662549] |
1,802.08681 | Polariton Chemistry: controlling molecular dynamics with optical
cavities | Molecular polaritons are the optical excitations which emerge when molecular
transitions interact strongly with confined electromagnetic fields. Increasing
interest in the hybrid molecular-photonic materials that host these excitations
stems from recent observations of their novel and tunable chemistry. Some of
the remarkable functionalities exhibited by polaritons include the ability to
induce long-range excitation energy transfer, enhance charge conductivity, and
inhibit or enhance chemical reactions. In this review, we explain the effective
theories of molecular polaritons which form a basis for the interpretation and
guidance of experiments at the strong coupling limit. The theoretical
discussion is illustrated with the analysis of innovative applications of
strongly coupled molecular-photonic systems to chemical phenomena of
fundamental importance to future technologies.
| cond-mat.mes-hall physics.chem-ph | molecular polaritons are the optical excitations which emerge when molecular transitions interact strongly with confined electromagnetic fields increasing interest in the hybrid molecularphotonic materials that host these excitations stems from recent observations of their novel and tunable chemistry some of the remarkable functionalities exhibited by polaritons include the ability to induce longrange excitation energy transfer enhance charge conductivity and inhibit or enhance chemical reactions in this review we explain the effective theories of molecular polaritons which form a basis for the interpretation and guidance of experiments at the strong coupling limit the theoretical discussion is illustrated with the analysis of innovative applications of strongly coupled molecularphotonic systems to chemical phenomena of fundamental importance to future technologies | [['molecular', 'polaritons', 'are', 'the', 'optical', 'excitations', 'which', 'emerge', 'when', 'molecular', 'transitions', 'interact', 'strongly', 'with', 'confined', 'electromagnetic', 'fields', 'increasing', 'interest', 'in', 'the', 'hybrid', 'molecularphotonic', 'materials', 'that', 'host', 'these', 'excitations', 'stems', 'from', 'recent', 'observations', 'of', 'their', 'novel', 'and', 'tunable', 'chemistry', 'some', 'of', 'the', 'remarkable', 'functionalities', 'exhibited', 'by', 'polaritons', 'include', 'the', 'ability', 'to', 'induce', 'longrange', 'excitation', 'energy', 'transfer', 'enhance', 'charge', 'conductivity', 'and', 'inhibit', 'or', 'enhance', 'chemical', 'reactions', 'in', 'this', 'review', 'we', 'explain', 'the', 'effective', 'theories', 'of', 'molecular', 'polaritons', 'which', 'form', 'a', 'basis', 'for', 'the', 'interpretation', 'and', 'guidance', 'of', 'experiments', 'at', 'the', 'strong', 'coupling', 'limit', 'the', 'theoretical', 'discussion', 'is', 'illustrated', 'with', 'the', 'analysis', 'of', 'innovative', 'applications', 'of', 'strongly', 'coupled', 'molecularphotonic', 'systems', 'to', 'chemical', 'phenomena', 'of', 'fundamental', 'importance', 'to', 'future', 'technologies']] | [-0.13695056416429252, 0.20555877351006002, -0.03527196210792713, 0.02326180936545011, -0.06645633998375974, -0.1402688028756529, 0.056578796471289376, 0.3743875875268458, -0.2579710022137876, -0.3014756497363315, 0.00450133426694951, -0.2991724397921771, -0.1857558043955482, 0.17960468406601107, 0.04478064085879739, 0.006000655956500978, 0.04174013154912054, -0.0671739208985839, -0.02001585781353673, -0.14673529296353655, 0.2785536861333081, 0.06754658999444361, 0.32638860346030507, 0.15250525912351645, 0.04507417059013326, -0.032249883446319585, 0.007147708979206519, -0.023978007262932102, -0.1348095542911196, 0.18200322549398007, 0.2743873884411235, 0.015358487795629915, 0.23516405684661054, -0.48268435544154625, -0.3014993950512195, 0.04757779227210242, 0.16428507891843064, 0.13487879550207013, -0.11926749854740736, -0.28758253436127124, -0.011820223336128453, -0.1357835923064206, -0.17464125410882397, -0.12977544326751836, -0.006541015318872636, 0.10275290787154645, -0.21150707139780647, 0.05453223449442528, 0.05109442366193163, 0.07789596179173443, -0.06941166126961705, -0.10489049108633608, -0.0439702323617479, 0.1060835598335344, 0.021322093964268436, 0.020971932746633365, 0.2122734704978045, -0.19254706944226646, -0.12911904120425644, 0.39595107564277815, -0.06092017986035595, -0.1290517009860068, 0.28646723050705825, -0.13962109063000402, -0.10416922502713931, 0.16138914446428157, 0.1998285589006468, 0.08451916522085014, -0.12230962469804676, 0.04726279470834702, 0.055256522709928584, 0.13703959720748426, 0.011406342444835198, 0.1665852135639605, 0.31371849572710825, 0.18967931011585487, -0.03375202318522753, 0.10092136939464692, -0.015385024778656213, -0.11257834500518807, -0.2229805972034994, -0.16184554380577124, -0.18045366172711447, 0.044360772564495596, -0.022010887413910638, -0.14374966165377645, 0.394571537366382, 0.1845444551538349, 0.15341283839294, -0.06095410657948569, 0.26010322351449805, 0.10327903729487668, 0.09154084700020847, -0.01187646376038493, 0.30282694808735405, 0.18379420256283002, 0.10441152711823713, -0.2897221860741347, 0.017588121543858984, -0.02292937139588359] |
1,802.08682 | Critical behavior in 3-d gravitational collapse of massless scalar
fields | We present results from the first study of critical behavior in 3-d
gravitational collapse. The source of the gravitational field is a massless
scalar field. This is a well-studied case for spherically symmetric
gravitational collapse, allowing us to understand the reliability and accuracy
of the simulations. We study both supercritical and subcritical evolutions to
see if one provides more accurate results than the other. We find that even for
non-spherical initial data with 35 percent of the power in the $\ell=2$
spherical harmonic, the critical solution is the same as in spherical symmetry.
| gr-qc | we present results from the first study of critical behavior in 3d gravitational collapse the source of the gravitational field is a massless scalar field this is a wellstudied case for spherically symmetric gravitational collapse allowing us to understand the reliability and accuracy of the simulations we study both supercritical and subcritical evolutions to see if one provides more accurate results than the other we find that even for nonspherical initial data with 35 percent of the power in the ell2 spherical harmonic the critical solution is the same as in spherical symmetry | [['we', 'present', 'results', 'from', 'the', 'first', 'study', 'of', 'critical', 'behavior', 'in', '3d', 'gravitational', 'collapse', 'the', 'source', 'of', 'the', 'gravitational', 'field', 'is', 'a', 'massless', 'scalar', 'field', 'this', 'is', 'a', 'wellstudied', 'case', 'for', 'spherically', 'symmetric', 'gravitational', 'collapse', 'allowing', 'us', 'to', 'understand', 'the', 'reliability', 'and', 'accuracy', 'of', 'the', 'simulations', 'we', 'study', 'both', 'supercritical', 'and', 'subcritical', 'evolutions', 'to', 'see', 'if', 'one', 'provides', 'more', 'accurate', 'results', 'than', 'the', 'other', 'we', 'find', 'that', 'even', 'for', 'nonspherical', 'initial', 'data', 'with', '35', 'percent', 'of', 'the', 'power', 'in', 'the', 'ell2', 'spherical', 'harmonic', 'the', 'critical', 'solution', 'is', 'the', 'same', 'as', 'in', 'spherical', 'symmetry']] | [-0.12654956537223752, 0.0824929404683331, -0.06670901503273717, 0.08556946220066679, -0.07074301337863328, -0.0932106185624356, -0.029262185855317983, 0.32267918980490135, -0.16491877207512495, -0.2792995714091806, 0.10053990394382747, -0.2623118545799967, -0.12397714381316496, 0.20590634714131073, 0.026854422593098736, 0.03664779389697698, 0.04046726416576133, 0.0678955583923286, -0.10230117545322946, -0.21389476806726507, 0.36291561149541407, 0.057076990594386416, 0.23495086513820193, 0.029804843542997235, 0.016809374951477093, -0.007403680373744298, -0.0010452299048343012, 0.009298287549867265, -0.15984167895939824, 0.06936614555356804, 0.17296039440759248, 0.11835145163199594, 0.24748293098102334, -0.41284336323939985, -0.21941526706821174, 0.13054103890473964, 0.13056319455305734, 0.17759291882256187, -0.08263668391721508, -0.2533957599787422, 0.10259630377855032, -0.17274319334456356, -0.20241835853585632, -0.05287007282498062, 0.04509412474499675, 0.030295353170023652, -0.2771881248411392, 0.13300282795542992, 0.07234956527639541, -0.004732491358393623, -0.1121148930772418, -0.03806759439088324, -0.023297263614793298, 0.13004789402412992, 0.06770303853416956, 0.05670297804278552, 0.11349077553923932, -0.1674528025886825, -0.0611609799439408, 0.45643299932201065, -0.08824771825773066, -0.1916689117469134, 0.19471711146655263, -0.2396698381992117, -0.1285736137570473, 0.14704303204843033, 0.17870732356784164, 0.13251329210376547, -0.09961743688871784, 0.05445506297407411, -0.014800987476783415, 0.174347920939126, 0.08690997411406809, -0.04396135649914222, 0.2301619489206582, 0.16446811028866357, 0.06805104709240378, 0.1862538096661459, -0.10063916139344695, -0.1068257882349914, -0.306377835711965, -0.13939689483849696, -0.15207205524027187, 0.08654563263138776, -0.13018433419675868, -0.15474125435663466, 0.38325264710702645, 0.15739287068486535, 0.1426595733050377, 0.0627023603827242, 0.2816918172162547, 0.09655728797248055, 0.021335341927585422, 0.08978763082370123, 0.31514694302352847, 0.131889660131707, 0.11617238176686148, -0.20791675250787006, -0.03952455501102151, 0.0231157336384058] |
1,802.08683 | Kinematic Flexibility Analysis: Hydrogen Bonding Patterns Impart a
Spatial Hierarchy of Protein Motion | Elastic network models (ENM) and constraint-based, topological rigidity
analysis are two distinct, coarse-grained approaches to study conformational
flexibility of macromolecules. In the two decades since their introduction,
both have contributed significantly to insights into protein molecular
mechanisms and function. However, despite a shared purpose of these approaches,
the topological nature of rigidity analysis, and thereby the absence of motion
modes, has impeded a direct comparison. Here, we present an alternative,
kinematic approach to rigidity analysis, which circumvents these drawbacks. We
introduce a novel protein hydrogen bond network spectral decomposition, which
provides an orthonormal basis for collective motions modulated by non-covalent
interactions, analogous to the eigenspectrum of normal modes, and decomposes
proteins into rigid clusters identical to those from topological rigidity. Our
kinematic flexibility analysis bridges topological rigidity theory and ENM, and
enables a detailed analysis of motion modes obtained from both approaches. Our
analysis reveals that collectivity of protein motions, reported by the Shannon
entropy, is significantly lower for rigidity theory versus normal mode
approaches. Strikingly, kinematic flexibility analysis suggests that the
hydrogen bonding network encodes a protein-fold specific, spatial hierarchy of
motions, which goes nearly undetected in ENM. This hierarchy reveals distinct
motion regimes that rationalize protein stiffness changes observed from
experiment and molecular dynamics simulations. A formal expression for changes
in free energy derived from the spectral decomposition indicates that motions
across nearly 40% of modes obey enthalpy-entropy compensation. Taken together,
our analysis suggests that hydrogen bond networks have evolved to modulate
protein structure and dynamics.
| q-bio.BM cs.CG | elastic network models enm and constraintbased topological rigidity analysis are two distinct coarsegrained approaches to study conformational flexibility of macromolecules in the two decades since their introduction both have contributed significantly to insights into protein molecular mechanisms and function however despite a shared purpose of these approaches the topological nature of rigidity analysis and thereby the absence of motion modes has impeded a direct comparison here we present an alternative kinematic approach to rigidity analysis which circumvents these drawbacks we introduce a novel protein hydrogen bond network spectral decomposition which provides an orthonormal basis for collective motions modulated by noncovalent interactions analogous to the eigenspectrum of normal modes and decomposes proteins into rigid clusters identical to those from topological rigidity our kinematic flexibility analysis bridges topological rigidity theory and enm and enables a detailed analysis of motion modes obtained from both approaches our analysis reveals that collectivity of protein motions reported by the shannon entropy is significantly lower for rigidity theory versus normal mode approaches strikingly kinematic flexibility analysis suggests that the hydrogen bonding network encodes a proteinfold specific spatial hierarchy of motions which goes nearly undetected in enm this hierarchy reveals distinct motion regimes that rationalize protein stiffness changes observed from experiment and molecular dynamics simulations a formal expression for changes in free energy derived from the spectral decomposition indicates that motions across nearly 40 of modes obey enthalpyentropy compensation taken together our analysis suggests that hydrogen bond networks have evolved to modulate protein structure and dynamics | [['elastic', 'network', 'models', 'enm', 'and', 'constraintbased', 'topological', 'rigidity', 'analysis', 'are', 'two', 'distinct', 'coarsegrained', 'approaches', 'to', 'study', 'conformational', 'flexibility', 'of', 'macromolecules', 'in', 'the', 'two', 'decades', 'since', 'their', 'introduction', 'both', 'have', 'contributed', 'significantly', 'to', 'insights', 'into', 'protein', 'molecular', 'mechanisms', 'and', 'function', 'however', 'despite', 'a', 'shared', 'purpose', 'of', 'these', 'approaches', 'the', 'topological', 'nature', 'of', 'rigidity', 'analysis', 'and', 'thereby', 'the', 'absence', 'of', 'motion', 'modes', 'has', 'impeded', 'a', 'direct', 'comparison', 'here', 'we', 'present', 'an', 'alternative', 'kinematic', 'approach', 'to', 'rigidity', 'analysis', 'which', 'circumvents', 'these', 'drawbacks', 'we', 'introduce', 'a', 'novel', 'protein', 'hydrogen', 'bond', 'network', 'spectral', 'decomposition', 'which', 'provides', 'an', 'orthonormal', 'basis', 'for', 'collective', 'motions', 'modulated', 'by', 'noncovalent', 'interactions', 'analogous', 'to', 'the', 'eigenspectrum', 'of', 'normal', 'modes', 'and', 'decomposes', 'proteins', 'into', 'rigid', 'clusters', 'identical', 'to', 'those', 'from', 'topological', 'rigidity', 'our', 'kinematic', 'flexibility', 'analysis', 'bridges', 'topological', 'rigidity', 'theory', 'and', 'enm', 'and', 'enables', 'a', 'detailed', 'analysis', 'of', 'motion', 'modes', 'obtained', 'from', 'both', 'approaches', 'our', 'analysis', 'reveals', 'that', 'collectivity', 'of', 'protein', 'motions', 'reported', 'by', 'the', 'shannon', 'entropy', 'is', 'significantly', 'lower', 'for', 'rigidity', 'theory', 'versus', 'normal', 'mode', 'approaches', 'strikingly', 'kinematic', 'flexibility', 'analysis', 'suggests', 'that', 'the', 'hydrogen', 'bonding', 'network', 'encodes', 'a', 'proteinfold', 'specific', 'spatial', 'hierarchy', 'of', 'motions', 'which', 'goes', 'nearly', 'undetected', 'in', 'enm', 'this', 'hierarchy', 'reveals', 'distinct', 'motion', 'regimes', 'that', 'rationalize', 'protein', 'stiffness', 'changes', 'observed', 'from', 'experiment', 'and', 'molecular', 'dynamics', 'simulations', 'a', 'formal', 'expression', 'for', 'changes', 'in', 'free', 'energy', 'derived', 'from', 'the', 'spectral', 'decomposition', 'indicates', 'that', 'motions', 'across', 'nearly', '40', 'of', 'modes', 'obey', 'enthalpyentropy', 'compensation', 'taken', 'together', 'our', 'analysis', 'suggests', 'that', 'hydrogen', 'bond', 'networks', 'have', 'evolved', 'to', 'modulate', 'protein', 'structure', 'and', 'dynamics']] | [-0.12132335792065632, 0.11536007600674794, -0.13131330691222365, 0.052805753765997256, -0.058968004097064826, -0.1296993125657087, 0.0692020991538097, 0.371551567243661, -0.2746002647633615, -0.281095819404492, -0.003077221184550419, -0.2507327776703878, -0.19941993714932368, 0.14088317596538347, -0.008900910342557107, 0.01611747152406745, 0.10643873999669662, -0.04594235145769682, -0.03657484188796538, -0.10570858622361955, 0.26225844731126435, 0.04357109267475755, 0.338335537183879, 0.04752933777404972, 0.07621203114086317, -0.0021988935925611785, -0.048316750971426965, 0.04208719362749865, -0.18431397969154042, 0.1746841724611454, 0.2413730217661429, 0.08898443786327459, 0.23522698244754875, -0.43785918035133464, -0.26782105937185374, 0.04497108738002205, 0.1938978030496213, 0.12834282726405738, -0.0003352432468385711, -0.2727301964283683, 0.04656142285348176, -0.149425039602338, -0.11141923705383623, -0.1526725033452727, 0.016335248479596998, 0.011143361173498515, -0.19001542483404588, 0.1343815364737746, 0.0854206563648485, 0.10103419707213276, -0.12807652149582752, -0.1294479896111776, -0.05455357699441961, 0.13858735621746568, 0.07452705581549947, -0.009363526363408396, 0.1962311679413938, -0.09024144244674397, -0.11448870885924922, 0.37613170921259564, -0.017638279894283907, -0.1689284614528631, 0.24843940064160205, -0.09073776716596413, -0.18926396184065472, 0.19329167548981815, 0.12843473666340022, 0.04418503778877287, -0.16149833963958637, 0.015112103079916978, 0.025487614768700532, 0.19737688073066445, 0.07544817023454348, 0.03796669430012705, 0.2061130936438527, 0.17829623962432026, 0.044944624980225376, 0.13466518894987942, -0.07295219020292103, -0.1353449261849105, -0.2167209436031066, -0.1412653503446983, -0.1498473455528738, 0.046312423840990886, -0.10356239187104631, -0.1716088310595996, 0.416335553092965, 0.09479695910598276, 0.17790458737853687, 0.060946758120459306, 0.27146583417174125, 0.021970537759793494, 0.07053715477462835, 0.016558396656382906, 0.2331807847485429, 0.17263282562968008, 0.0732148926241346, -0.23730844495014894, 0.07086427189053417, 0.05685492569527887] |
1,802.08684 | Inverse spectrum problem for quasi-stationary states | In this work we present a semi-classical approach to solve the inverse
spectrum problem for one-dimensional wave equations for a specific class of
potentials that admits quasi-stationary states. We show how inverse methods for
potential wells and potential barriers can be generalized to reconstruct
significant parts for the combined potentials. For the reconstruction one
assumes the knowledge of the complex valued spectrum and uses the exponential
smallness of its imaginary part. Analytic spectra are studied and a recent
application of the method in the literature for gravitational wave physics is
discussed. The method allows for a simple reconstruction of quasi-stationary
state potentials from a given spectrum. Thus it might be interesting for
different branches of physics and related fields.
| quant-ph gr-qc | in this work we present a semiclassical approach to solve the inverse spectrum problem for onedimensional wave equations for a specific class of potentials that admits quasistationary states we show how inverse methods for potential wells and potential barriers can be generalized to reconstruct significant parts for the combined potentials for the reconstruction one assumes the knowledge of the complex valued spectrum and uses the exponential smallness of its imaginary part analytic spectra are studied and a recent application of the method in the literature for gravitational wave physics is discussed the method allows for a simple reconstruction of quasistationary state potentials from a given spectrum thus it might be interesting for different branches of physics and related fields | [['in', 'this', 'work', 'we', 'present', 'a', 'semiclassical', 'approach', 'to', 'solve', 'the', 'inverse', 'spectrum', 'problem', 'for', 'onedimensional', 'wave', 'equations', 'for', 'a', 'specific', 'class', 'of', 'potentials', 'that', 'admits', 'quasistationary', 'states', 'we', 'show', 'how', 'inverse', 'methods', 'for', 'potential', 'wells', 'and', 'potential', 'barriers', 'can', 'be', 'generalized', 'to', 'reconstruct', 'significant', 'parts', 'for', 'the', 'combined', 'potentials', 'for', 'the', 'reconstruction', 'one', 'assumes', 'the', 'knowledge', 'of', 'the', 'complex', 'valued', 'spectrum', 'and', 'uses', 'the', 'exponential', 'smallness', 'of', 'its', 'imaginary', 'part', 'analytic', 'spectra', 'are', 'studied', 'and', 'a', 'recent', 'application', 'of', 'the', 'method', 'in', 'the', 'literature', 'for', 'gravitational', 'wave', 'physics', 'is', 'discussed', 'the', 'method', 'allows', 'for', 'a', 'simple', 'reconstruction', 'of', 'quasistationary', 'state', 'potentials', 'from', 'a', 'given', 'spectrum', 'thus', 'it', 'might', 'be', 'interesting', 'for', 'different', 'branches', 'of', 'physics', 'and', 'related', 'fields']] | [-0.08032110843713544, 0.06642232417762906, -0.11286723534693989, 0.11497225993539856, -0.08325928131885388, -0.1277647841909603, -0.0147698604670048, 0.3425891263833066, -0.276067613549687, -0.2627428188419142, 0.07833122525818083, -0.25539731918533326, -0.1723463372053469, 0.2357325266201456, 0.003906277427058511, 0.0859065746038393, 0.0706468922851075, 0.03934773694363838, -0.0634448236038423, -0.17003122017476238, 0.36294029919947146, 0.015519450812897951, 0.23529815948333496, 0.07977306337620155, 0.095882786598307, 0.01769887127310914, 0.0017236123299774002, 0.005308792182878286, -0.11374178542120884, 0.12332507935910243, 0.24066824374423057, 0.11772064366103972, 0.24285958218583917, -0.4219771347971273, -0.2656062155210671, 0.11362891913853398, 0.15263472986994547, 0.15655027362009308, -0.09224325733869768, -0.2665820640644857, 0.06327583503854625, -0.1446980897067193, -0.1870394329454343, -0.0904525972026236, 0.0504090695156708, 0.010488236577351805, -0.29704540476453406, 0.10746842299337585, 0.03543897245779727, -0.017398353716937685, -0.1227693096631864, -0.11619729889134149, 0.04615413811558686, 0.10384451220312915, 0.02717853562530725, 0.0032663043351656125, 0.07902530038498436, -0.13789792401723938, -0.12211943661183619, 0.37014742334913303, -0.07201256576393332, -0.21168397451523974, 0.1784439743770396, -0.11480860105332207, -0.11561880777237796, 0.13533913578932025, 0.17742366698265327, 0.1329634364756967, -0.143606656716213, 0.15205522427264945, -0.0017919672274973807, 0.1053455116893967, 0.047730471981892814, 0.0036287176141030146, 0.19863508394214974, 0.12336746677208472, 0.06634968916392502, 0.14719804252317847, -0.06432747401829277, -0.1074723719928351, -0.30774121750302674, -0.1474990353629995, -0.20722309333280103, 0.0375910579946436, -0.03033075957048387, -0.1890481149605593, 0.48224668129652487, 0.13057717040952535, 0.1824588525273344, 0.02535756691769861, 0.2845078312455356, 0.1666696218767853, 0.04299848496829778, 0.02379800277064357, 0.22956947106163667, 0.16306781130960257, 0.11421198629433711, -0.19442172789312273, 0.0030754401178310522, 0.044334809951280724] |
1,802.08685 | Quantum Mechanics with Contextually Labeled Observables | In the Contextuality-by-Default theory random variables representing
measurement outcomes are labeled contextually, i.e., not only by what they
measure but also under what conditions (in what contexts) the measurements are
made, including but not reducible to what other measurements are made
"together" with the given one. We propose in this paper that the quantum
observables generating these random variables be labeled contextually as well,
making the sets of the observables in different contexts disjoint. A quantum
observable is defined as a pair consisting of the observable's label and a
self-adjoint operator in a Hilbert space. If a system is consistently connected
(i.e., obeys "non-disturbance," "non-invasivenes," or "non-signaling"
conditions), the observables measuring the same property in different contexts
have the same operator. A set of random variables possessing a joint
distribution is represented by commuting observables. The reverse, however, is
not true: random variables from different contexts do not have a joint
distribution irrespective of whether the corresponding observables commute. We
illustrate this view of observables by deriving the Tsirelson bound for
consistently connected cyclic systems of rank 3.
| quant-ph math.QA | in the contextualitybydefault theory random variables representing measurement outcomes are labeled contextually ie not only by what they measure but also under what conditions in what contexts the measurements are made including but not reducible to what other measurements are made together with the given one we propose in this paper that the quantum observables generating these random variables be labeled contextually as well making the sets of the observables in different contexts disjoint a quantum observable is defined as a pair consisting of the observables label and a selfadjoint operator in a hilbert space if a system is consistently connected ie obeys nondisturbance noninvasivenes or nonsignaling conditions the observables measuring the same property in different contexts have the same operator a set of random variables possessing a joint distribution is represented by commuting observables the reverse however is not true random variables from different contexts do not have a joint distribution irrespective of whether the corresponding observables commute we illustrate this view of observables by deriving the tsirelson bound for consistently connected cyclic systems of rank 3 | [['in', 'the', 'contextualitybydefault', 'theory', 'random', 'variables', 'representing', 'measurement', 'outcomes', 'are', 'labeled', 'contextually', 'ie', 'not', 'only', 'by', 'what', 'they', 'measure', 'but', 'also', 'under', 'what', 'conditions', 'in', 'what', 'contexts', 'the', 'measurements', 'are', 'made', 'including', 'but', 'not', 'reducible', 'to', 'what', 'other', 'measurements', 'are', 'made', 'together', 'with', 'the', 'given', 'one', 'we', 'propose', 'in', 'this', 'paper', 'that', 'the', 'quantum', 'observables', 'generating', 'these', 'random', 'variables', 'be', 'labeled', 'contextually', 'as', 'well', 'making', 'the', 'sets', 'of', 'the', 'observables', 'in', 'different', 'contexts', 'disjoint', 'a', 'quantum', 'observable', 'is', 'defined', 'as', 'a', 'pair', 'consisting', 'of', 'the', 'observables', 'label', 'and', 'a', 'selfadjoint', 'operator', 'in', 'a', 'hilbert', 'space', 'if', 'a', 'system', 'is', 'consistently', 'connected', 'ie', 'obeys', 'nondisturbance', 'noninvasivenes', 'or', 'nonsignaling', 'conditions', 'the', 'observables', 'measuring', 'the', 'same', 'property', 'in', 'different', 'contexts', 'have', 'the', 'same', 'operator', 'a', 'set', 'of', 'random', 'variables', 'possessing', 'a', 'joint', 'distribution', 'is', 'represented', 'by', 'commuting', 'observables', 'the', 'reverse', 'however', 'is', 'not', 'true', 'random', 'variables', 'from', 'different', 'contexts', 'do', 'not', 'have', 'a', 'joint', 'distribution', 'irrespective', 'of', 'whether', 'the', 'corresponding', 'observables', 'commute', 'we', 'illustrate', 'this', 'view', 'of', 'observables', 'by', 'deriving', 'the', 'tsirelson', 'bound', 'for', 'consistently', 'connected', 'cyclic', 'systems', 'of', 'rank', '3']] | [-0.1153533806456095, 0.19658059814858045, -0.09535800006850964, 0.08849238666000718, -0.06313092902823651, -0.17254168886459817, 0.025227762153635255, 0.34899827777697456, -0.28986889529068255, -0.2623907490002023, 0.08104907536463507, -0.2801547005909395, -0.09798580985437384, 0.1585575176112217, -0.09545454371978376, 0.05087580841750243, 0.0785982664122041, 0.09382700805531256, -0.09481598432820375, -0.2506777606411221, 0.36818544522696045, -0.009063989493606539, 0.25491982200156665, -0.03127511579044805, 0.11813864480219992, 0.029600889736386596, -0.04431362891843343, 0.08559403038767198, -0.07395969950193625, 0.07625583092495272, 0.2760323517624352, 0.18817233494193542, 0.23943057912007226, -0.3948087752559933, -0.20306341368757652, 0.18155016826128975, 0.09844571493281903, 0.07980461984130917, 0.041076478215544825, -0.28950274604146425, 0.04608057723196465, -0.14549078602122806, -0.09287105184206265, -0.0840604060545227, 0.02013305752567084, 0.026619228796828223, -0.2948483518524737, 0.05624610213362243, 0.06857681410495023, 0.06842798854113888, -0.021361548316764966, -0.0882665952187463, -0.019065018398634625, 0.14329616805685863, -0.004768780191260585, 0.009752811457551384, 0.1203565863802987, -0.11056490685517169, -0.15089802146497272, 0.3797658499340806, 0.007713984441877695, -0.2827549989698297, 0.1732339774268958, -0.17958155127663472, -0.17963334972217762, 0.026269825709468057, 0.11266453759771072, 0.12882187292239586, -0.19938528838193853, 0.08823101451366581, -0.10775990240107484, 0.1360694285229606, 0.06143465469851774, 0.10369965346466939, 0.20232004756476246, 0.06803486694050374, 0.06193063962325917, 0.0948763629365686, 0.012402256642926043, -0.10524802645773622, -0.34256441682303523, -0.11421228178262469, -0.21608526073790835, 0.0735834100231723, -0.08391395786316411, -0.1786625107308313, 0.38142542888036807, 0.1516729446106964, 0.2536332333555161, 0.04030408194725333, 0.25618667048165356, 0.11595766170624194, 0.08407013879439104, 0.06050957657007427, 0.18755345936801474, 0.12662943929176, 0.04034268421168297, -0.11977099486374122, 0.14218288961545392, 0.06282459435942399] |
1,802.08686 | Adversarial vulnerability for any classifier | Despite achieving impressive performance, state-of-the-art classifiers remain
highly vulnerable to small, imperceptible, adversarial perturbations. This
vulnerability has proven empirically to be very intricate to address. In this
paper, we study the phenomenon of adversarial perturbations under the
assumption that the data is generated with a smooth generative model. We derive
fundamental upper bounds on the robustness to perturbations of any
classification function, and prove the existence of adversarial perturbations
that transfer well across different classifiers with small risk. Our analysis
of the robustness also provides insights onto key properties of generative
models, such as their smoothness and dimensionality of latent space. We
conclude with numerical experimental results showing that our bounds provide
informative baselines to the maximal achievable robustness on several datasets.
| cs.LG cs.CR cs.CV stat.ML | despite achieving impressive performance stateoftheart classifiers remain highly vulnerable to small imperceptible adversarial perturbations this vulnerability has proven empirically to be very intricate to address in this paper we study the phenomenon of adversarial perturbations under the assumption that the data is generated with a smooth generative model we derive fundamental upper bounds on the robustness to perturbations of any classification function and prove the existence of adversarial perturbations that transfer well across different classifiers with small risk our analysis of the robustness also provides insights onto key properties of generative models such as their smoothness and dimensionality of latent space we conclude with numerical experimental results showing that our bounds provide informative baselines to the maximal achievable robustness on several datasets | [['despite', 'achieving', 'impressive', 'performance', 'stateoftheart', 'classifiers', 'remain', 'highly', 'vulnerable', 'to', 'small', 'imperceptible', 'adversarial', 'perturbations', 'this', 'vulnerability', 'has', 'proven', 'empirically', 'to', 'be', 'very', 'intricate', 'to', 'address', 'in', 'this', 'paper', 'we', 'study', 'the', 'phenomenon', 'of', 'adversarial', 'perturbations', 'under', 'the', 'assumption', 'that', 'the', 'data', 'is', 'generated', 'with', 'a', 'smooth', 'generative', 'model', 'we', 'derive', 'fundamental', 'upper', 'bounds', 'on', 'the', 'robustness', 'to', 'perturbations', 'of', 'any', 'classification', 'function', 'and', 'prove', 'the', 'existence', 'of', 'adversarial', 'perturbations', 'that', 'transfer', 'well', 'across', 'different', 'classifiers', 'with', 'small', 'risk', 'our', 'analysis', 'of', 'the', 'robustness', 'also', 'provides', 'insights', 'onto', 'key', 'properties', 'of', 'generative', 'models', 'such', 'as', 'their', 'smoothness', 'and', 'dimensionality', 'of', 'latent', 'space', 'we', 'conclude', 'with', 'numerical', 'experimental', 'results', 'showing', 'that', 'our', 'bounds', 'provide', 'informative', 'baselines', 'to', 'the', 'maximal', 'achievable', 'robustness', 'on', 'several', 'datasets']] | [-0.09432727772337919, 0.025294969049206036, -0.07399085078953353, 0.10127652492507773, -0.07419460440497296, -0.1483640164446055, 0.03870052198944308, 0.40278404510625804, -0.2508742346668799, -0.32362566584507463, 0.1084802126212305, -0.2568262072325852, -0.23051924738636026, 0.22346450647980462, -0.16407103159037403, 0.10082174292536544, 0.11065884841392275, 0.007860071018393549, -0.06376564608825767, -0.33628664657351426, 0.35221271425844397, 0.08170713006722032, 0.3348963005452982, 0.06407500878424903, 0.08386906641096518, -0.09579904617543225, 0.0002413510600654561, -0.0007027754615935054, -0.11874526081606507, 0.16420654199834242, 0.2779610336434774, 0.19141258179309364, 0.3177552752150986, -0.38876014569302886, -0.2492719023931222, 0.13756301525797024, 0.0936580799695593, 0.12232666146346524, -0.08404319850559973, -0.3544214972004783, 0.13864046838478047, -0.13945195774288208, -0.07487514428031004, -0.21116290020863296, -0.03904019874047305, 0.016718988476672254, -0.29791593501252717, 0.04331384632964504, 0.12616518617380548, 0.046928927716255175, -0.07367265281328535, -0.09601202469746598, -0.02187737032244379, 0.14165509650560065, 0.11411957603165514, 0.0015863675689019386, 0.10626862021153563, -0.16189215428073753, -0.1130350471596371, 0.32120641353769136, -0.10894823929516324, -0.24136049155425948, 0.22961505007792693, -0.0794776788164602, -0.14376423892671944, 0.07623973235365797, 0.24459537270204088, 0.10703254940721099, -0.10640868029297619, 0.03653678324905636, -0.059573781119323654, 0.15441919542604782, 0.04698712248584164, 0.0806095384664406, 0.13480060237849162, 0.2386682584240544, 0.0819389424134107, 0.18665672621983637, -0.09849234940255153, -0.07600282531109501, -0.24787402345386686, -0.027152202078274863, -0.1790043468755044, 0.04419933193073165, -0.15788696247861972, -0.182378631777924, 0.41109041884526243, 0.26521563002473264, 0.24468449722273183, 0.14022940484454788, 0.36368070188986107, 0.029142545544748485, 0.04817887785325407, 0.10935053834309955, 0.254645083122505, 0.08485167155416347, 0.013375399836537535, -0.1687944136716456, 0.15349925349019927, -0.015123247397971934] |
1,802.08687 | Electroweak Logarithms in Inclusive Cross Sections | We develop the framework to perform all-orders resummation of electroweak
logarithms of Q/M for inclusive scattering processes at energies Q much above
the electroweak scale M. We calculate all ingredients needed at next-to-leading
logarithmic (NLL) order and provide an explicit recipe to implement this for 2
$\to$ 2 processes. PDF evolution including electroweak corrections, which lead
to Sudakov double logarithms, is computed. If only the invariant mass of the
final state is measured, all electroweak logarithms can be resummed by the PDF
evolution, at least to LL. However, simply identifying a lepton in the final
state requires the corresponding fragmentation function and introduces angular
dependence through the exchange of soft gauge bosons. Furthermore, we show the
importance of polarization effects for gauge bosons, due to the chiral nature
of SU(2) - even the gluon distribution in an unpolarized proton becomes
polarized at high scales due to electroweak effects. We justify our approach
with a factorization analysis, finding that the objects entering the
factorization theorem do not need to be SU(2) $\times$ U(1) gauge singlets,
even though we perform the factorization and resummation in the symmetric
phase. We also discuss a range of extensions, including jets and how to
calculate the EW logarithms when you are fully exclusive in the central
(detector) region and fully inclusive in the forward (beam) regions.
| hep-ph | we develop the framework to perform allorders resummation of electroweak logarithms of qm for inclusive scattering processes at energies q much above the electroweak scale m we calculate all ingredients needed at nexttoleading logarithmic nll order and provide an explicit recipe to implement this for 2 to 2 processes pdf evolution including electroweak corrections which lead to sudakov double logarithms is computed if only the invariant mass of the final state is measured all electroweak logarithms can be resummed by the pdf evolution at least to ll however simply identifying a lepton in the final state requires the corresponding fragmentation function and introduces angular dependence through the exchange of soft gauge bosons furthermore we show the importance of polarization effects for gauge bosons due to the chiral nature of su2 even the gluon distribution in an unpolarized proton becomes polarized at high scales due to electroweak effects we justify our approach with a factorization analysis finding that the objects entering the factorization theorem do not need to be su2 times u1 gauge singlets even though we perform the factorization and resummation in the symmetric phase we also discuss a range of extensions including jets and how to calculate the ew logarithms when you are fully exclusive in the central detector region and fully inclusive in the forward beam regions | [['we', 'develop', 'the', 'framework', 'to', 'perform', 'allorders', 'resummation', 'of', 'electroweak', 'logarithms', 'of', 'qm', 'for', 'inclusive', 'scattering', 'processes', 'at', 'energies', 'q', 'much', 'above', 'the', 'electroweak', 'scale', 'm', 'we', 'calculate', 'all', 'ingredients', 'needed', 'at', 'nexttoleading', 'logarithmic', 'nll', 'order', 'and', 'provide', 'an', 'explicit', 'recipe', 'to', 'implement', 'this', 'for', '2', 'to', '2', 'processes', 'pdf', 'evolution', 'including', 'electroweak', 'corrections', 'which', 'lead', 'to', 'sudakov', 'double', 'logarithms', 'is', 'computed', 'if', 'only', 'the', 'invariant', 'mass', 'of', 'the', 'final', 'state', 'is', 'measured', 'all', 'electroweak', 'logarithms', 'can', 'be', 'resummed', 'by', 'the', 'pdf', 'evolution', 'at', 'least', 'to', 'll', 'however', 'simply', 'identifying', 'a', 'lepton', 'in', 'the', 'final', 'state', 'requires', 'the', 'corresponding', 'fragmentation', 'function', 'and', 'introduces', 'angular', 'dependence', 'through', 'the', 'exchange', 'of', 'soft', 'gauge', 'bosons', 'furthermore', 'we', 'show', 'the', 'importance', 'of', 'polarization', 'effects', 'for', 'gauge', 'bosons', 'due', 'to', 'the', 'chiral', 'nature', 'of', 'su2', 'even', 'the', 'gluon', 'distribution', 'in', 'an', 'unpolarized', 'proton', 'becomes', 'polarized', 'at', 'high', 'scales', 'due', 'to', 'electroweak', 'effects', 'we', 'justify', 'our', 'approach', 'with', 'a', 'factorization', 'analysis', 'finding', 'that', 'the', 'objects', 'entering', 'the', 'factorization', 'theorem', 'do', 'not', 'need', 'to', 'be', 'su2', 'times', 'u1', 'gauge', 'singlets', 'even', 'though', 'we', 'perform', 'the', 'factorization', 'and', 'resummation', 'in', 'the', 'symmetric', 'phase', 'we', 'also', 'discuss', 'a', 'range', 'of', 'extensions', 'including', 'jets', 'and', 'how', 'to', 'calculate', 'the', 'ew', 'logarithms', 'when', 'you', 'are', 'fully', 'exclusive', 'in', 'the', 'central', 'detector', 'region', 'and', 'fully', 'inclusive', 'in', 'the', 'forward', 'beam', 'regions']] | [-0.07360550622587607, 0.20396661267099694, -0.13060009646012563, 0.1771125487784417, -0.047675237057466895, -0.09995164500563257, 0.006091355068261467, 0.35886540903484443, -0.20890160550822645, -0.2697943246851093, 0.033030535015235035, -0.27839154173879455, -0.01763337877681096, 0.08416672513477895, 0.05463290138111118, 0.08708267760586384, 0.02775188493563636, -0.03558189835551952, -0.08588335916642355, -0.24865024091280385, 0.3436158119440908, 0.043602643115658604, 0.20235450902196778, 0.14138992578025109, 0.090910401225056, 0.07185135711596845, -0.05123882404992093, -0.062271973094796616, -0.08973164959310594, 0.04754094391865613, 0.257575682681224, 0.025098967128837284, 0.16233516742758927, -0.3819165460331595, -0.1037481783051469, 0.10076777047805113, 0.18104194093029946, 0.13715595376787315, -0.004563860899288224, -0.24233761723642344, 0.11215226550386649, -0.23904645357059834, -0.14792129029434803, -0.15242124018238085, -0.027181909389296318, -0.08595042624330089, -0.3406505779986223, 0.07547274764005805, 0.006538929572949807, -0.013649318779746419, 0.04214543388884293, -0.1290398804368834, -0.03556146343094063, 0.06774966367140314, 0.10848155321891433, 0.06602620427203301, 0.16108787016194637, -0.23580026702921345, -0.15477368641500128, 0.41075750345525813, -0.022482181784960538, -0.1716938853140529, 0.11649222107185263, -0.23384722768457725, -0.16953246531259591, 0.17074729381001566, 0.20144227234706213, 0.1056582181789959, -0.12035862038096203, 0.14481545841299023, 0.026573109772209436, 0.17999991713215058, 0.055751216619118166, 0.06334432252984681, 0.17535749965317582, 0.11950442221995919, 0.01049884625489411, 0.08359954646548265, -0.06812489401234408, -0.10586049747079203, -0.4297838855926032, -0.10430789424412668, -0.07783949527715132, 0.07142556007250082, -0.08910500328023291, -0.1307913459854447, 0.3608768796760878, 0.15659548995854783, 0.25949621521527605, 0.0630720671235486, 0.320093151623145, 0.13854065483710282, 0.10291091484532236, 0.0867661611245069, 0.26494231344664204, 0.14539042401625074, 0.08763488504576357, -0.2352455271318657, 0.019601654992800324, 0.11462407970424107] |
1,802.08688 | Chandra and XMM-Newton Observations of the Abell 3391/Abell 3395
Intercluster Filament | We present Chandra and XMM-Newton X-ray observations of the Abell 3391/Abell
3395 intercluster filament. It has been suggested that the galaxy clusters
Abell 3395, Abell 3391, and the galaxy group ESO-161 located between the two
clusters, are in alignment along a large-scale intercluster filament. We find
that the filament is aligned close to the plane of the sky, in contrast to
previous results. We find a global projected filament temperature kT =
$4.45_{-0.55}^{+0.89}$~keV, electron density $n_e=1.08^{+0.06}_{-0.05} \times
10^{-4}$~cm$^{-3}$, and $M_{\rm gas} = 2.7^{+0.2}_{-0.1} \times
10^{13}$~M$_\odot$. The thermodynamic properties of the filament are consistent
with that of intracluster medium (ICM) of Abell 3395 and Abell 3391, suggesting
that the filament emission is dominated by ICM gas that has been tidally
disrupted during an early stage merger between these two clusters. We present
temperature, density, entropy, and abundance profiles across the filament. We
find that the galaxy group ESO-161 may be undergoing ram pressure stripping in
the low density environment at or near the virial radius of both clusters due
to its rapid motion through the filament.
| astro-ph.HE astro-ph.GA | we present chandra and xmmnewton xray observations of the abell 3391abell 3395 intercluster filament it has been suggested that the galaxy clusters abell 3395 abell 3391 and the galaxy group eso161 located between the two clusters are in alignment along a largescale intercluster filament we find that the filament is aligned close to the plane of the sky in contrast to previous results we find a global projected filament temperature kt 445_055089kev electron density n_e108006_005 times 104cm3 and m_rm gas 2702_01 times 1013m_odot the thermodynamic properties of the filament are consistent with that of intracluster medium icm of abell 3395 and abell 3391 suggesting that the filament emission is dominated by icm gas that has been tidally disrupted during an early stage merger between these two clusters we present temperature density entropy and abundance profiles across the filament we find that the galaxy group eso161 may be undergoing ram pressure stripping in the low density environment at or near the virial radius of both clusters due to its rapid motion through the filament | [['we', 'present', 'chandra', 'and', 'xmmnewton', 'xray', 'observations', 'of', 'the', 'abell', '3391abell', '3395', 'intercluster', 'filament', 'it', 'has', 'been', 'suggested', 'that', 'the', 'galaxy', 'clusters', 'abell', '3395', 'abell', '3391', 'and', 'the', 'galaxy', 'group', 'eso161', 'located', 'between', 'the', 'two', 'clusters', 'are', 'in', 'alignment', 'along', 'a', 'largescale', 'intercluster', 'filament', 'we', 'find', 'that', 'the', 'filament', 'is', 'aligned', 'close', 'to', 'the', 'plane', 'of', 'the', 'sky', 'in', 'contrast', 'to', 'previous', 'results', 'we', 'find', 'a', 'global', 'projected', 'filament', 'temperature', 'kt', '445_055089kev', 'electron', 'density', 'n_e108006_005', 'times', '104cm3', 'and', 'm_rm', 'gas', '2702_01', 'times', '1013m_odot', 'the', 'thermodynamic', 'properties', 'of', 'the', 'filament', 'are', 'consistent', 'with', 'that', 'of', 'intracluster', 'medium', 'icm', 'of', 'abell', '3395', 'and', 'abell', '3391', 'suggesting', 'that', 'the', 'filament', 'emission', 'is', 'dominated', 'by', 'icm', 'gas', 'that', 'has', 'been', 'tidally', 'disrupted', 'during', 'an', 'early', 'stage', 'merger', 'between', 'these', 'two', 'clusters', 'we', 'present', 'temperature', 'density', 'entropy', 'and', 'abundance', 'profiles', 'across', 'the', 'filament', 'we', 'find', 'that', 'the', 'galaxy', 'group', 'eso161', 'may', 'be', 'undergoing', 'ram', 'pressure', 'stripping', 'in', 'the', 'low', 'density', 'environment', 'at', 'or', 'near', 'the', 'virial', 'radius', 'of', 'both', 'clusters', 'due', 'to', 'its', 'rapid', 'motion', 'through', 'the', 'filament']] | [-0.1180976420302156, 0.11863013871739449, -0.10201056621143383, 0.027164028696074503, -0.08031213291276604, 0.013287935330683065, 0.0014451016605034203, 0.48430422834304726, -0.1645638567066478, -0.30824401252205946, 0.046795126286678264, -0.29189528833097406, -0.04796540739522232, 0.1460936637581354, 0.06489481339175365, -0.05994105745702257, 0.05111910275519619, -0.056298270461868916, -0.04936363227096593, -0.293025596684938, 0.2635148897351248, 0.09512827477367695, 0.18894590498059766, -0.0015849165205737788, 0.09518944384240194, -0.0852915986028394, -0.03450514916832486, 0.01935976870848747, -0.1616768970970353, -0.025878684911709613, 0.19566482047321732, 0.07930189462289393, 0.24352103348509102, -0.4041927478033603, -0.2084409019625383, 0.03591928936117245, 0.23627928467634732, 0.00892006794358799, -0.07437259280039164, -0.31884929705076587, 0.0810722554894443, -0.20941907213164304, -0.16536706981937885, 0.10771141892778659, 0.02852735018168024, 0.03918801768945006, -0.15636534731790513, 0.2818097063133906, -0.01898786552810852, 0.01707914537711147, -0.13206003970343866, -0.05502018123909742, -0.07304965560240838, 0.06326429293390565, 0.019264058031498672, 0.11924495169067544, 0.29730474179008315, -0.13622380645309914, 0.038577682929793876, 0.3981731329447852, -0.014847442814466838, 0.08579962361537054, 0.2726478814732975, -0.19823359883729155, -0.22133219477436142, 0.14120856952758695, 0.11783130707297318, -0.0030067562304080244, -0.14605052620562875, -0.0076869176144775805, -0.09096106090638675, 0.22651504332751793, 0.06258475175963904, -0.03666536288984569, 0.32933004450298353, 0.07205459117836426, 0.0681955695297279, 0.1608383652362359, -0.23485059023752508, -0.042130473521565966, -0.18489882510579275, -0.08964327068073664, -0.11409107281779034, 0.0018348684422894866, -0.1398070066783704, -0.1383882933379915, 0.28786645557809465, 0.10549939259911838, 0.2417293407892931, 0.011907595238881186, 0.31133472105253956, 0.05045665501237674, 0.09248458790107669, 0.18852448402792438, 0.2942131035654488, 0.25794260602159996, 0.06678162769185836, -0.2748474981050247, 0.04977213654633678, 0.005072924825725352] |
1,802.08689 | Enhanced stellar activity for slow antisolar differential rotation? | High precision photometry of solar-like members of the open cluster M67 with
Kepler/K2 data has recently revealed enhanced activity for stars with a large
Rossby number, which is the ratio of rotation period to the convective turnover
time. Contrary to the well established behavior for shorter rotation periods
and smaller Rossby numbers, the chromospheric activity of the more slowly
rotating stars of M67 was found to increase with increasing Rossby number. Such
behavior has never been reported before, although it was theoretically
predicted to emerge as a consequence of antisolar differential rotation (DR)
for stars with Rossby numbers larger than that of the Sun, because in those
models the absolute value of the DR was found to exceed that for solar-like DR.
Using gyrochronological relations and an approximate age of 4 Gyr for the
members of M67, we compare with computed rotation rates using just the B-V
color. The resulting rotation--activity relation is found to be compatible with
that obtained by employing the measured rotation rate. This provides additional
support for the unconventional enhancement of activity at comparatively low
rotation rates and the possible presence of antisolar differential rotation.
| astro-ph.SR | high precision photometry of solarlike members of the open cluster m67 with keplerk2 data has recently revealed enhanced activity for stars with a large rossby number which is the ratio of rotation period to the convective turnover time contrary to the well established behavior for shorter rotation periods and smaller rossby numbers the chromospheric activity of the more slowly rotating stars of m67 was found to increase with increasing rossby number such behavior has never been reported before although it was theoretically predicted to emerge as a consequence of antisolar differential rotation dr for stars with rossby numbers larger than that of the sun because in those models the absolute value of the dr was found to exceed that for solarlike dr using gyrochronological relations and an approximate age of 4 gyr for the members of m67 we compare with computed rotation rates using just the bv color the resulting rotationactivity relation is found to be compatible with that obtained by employing the measured rotation rate this provides additional support for the unconventional enhancement of activity at comparatively low rotation rates and the possible presence of antisolar differential rotation | [['high', 'precision', 'photometry', 'of', 'solarlike', 'members', 'of', 'the', 'open', 'cluster', 'm67', 'with', 'keplerk2', 'data', 'has', 'recently', 'revealed', 'enhanced', 'activity', 'for', 'stars', 'with', 'a', 'large', 'rossby', 'number', 'which', 'is', 'the', 'ratio', 'of', 'rotation', 'period', 'to', 'the', 'convective', 'turnover', 'time', 'contrary', 'to', 'the', 'well', 'established', 'behavior', 'for', 'shorter', 'rotation', 'periods', 'and', 'smaller', 'rossby', 'numbers', 'the', 'chromospheric', 'activity', 'of', 'the', 'more', 'slowly', 'rotating', 'stars', 'of', 'm67', 'was', 'found', 'to', 'increase', 'with', 'increasing', 'rossby', 'number', 'such', 'behavior', 'has', 'never', 'been', 'reported', 'before', 'although', 'it', 'was', 'theoretically', 'predicted', 'to', 'emerge', 'as', 'a', 'consequence', 'of', 'antisolar', 'differential', 'rotation', 'dr', 'for', 'stars', 'with', 'rossby', 'numbers', 'larger', 'than', 'that', 'of', 'the', 'sun', 'because', 'in', 'those', 'models', 'the', 'absolute', 'value', 'of', 'the', 'dr', 'was', 'found', 'to', 'exceed', 'that', 'for', 'solarlike', 'dr', 'using', 'gyrochronological', 'relations', 'and', 'an', 'approximate', 'age', 'of', '4', 'gyr', 'for', 'the', 'members', 'of', 'm67', 'we', 'compare', 'with', 'computed', 'rotation', 'rates', 'using', 'just', 'the', 'bv', 'color', 'the', 'resulting', 'rotationactivity', 'relation', 'is', 'found', 'to', 'be', 'compatible', 'with', 'that', 'obtained', 'by', 'employing', 'the', 'measured', 'rotation', 'rate', 'this', 'provides', 'additional', 'support', 'for', 'the', 'unconventional', 'enhancement', 'of', 'activity', 'at', 'comparatively', 'low', 'rotation', 'rates', 'and', 'the', 'possible', 'presence', 'of', 'antisolar', 'differential', 'rotation']] | [-0.1035893490216473, 0.1834401963753706, -0.06408022968173975, 0.10938785221888413, -0.08165962416210543, -0.07606123643311322, 0.08521507923348398, 0.34927160421967823, -0.19784242195131443, -0.38871419496302095, 0.09047212909658257, -0.25059767567664115, -0.06778170043237941, 0.262244447512631, -0.09131676457063467, 0.02984835839184819, 0.0647272920912309, 0.051410289863173766, -0.03563658889258655, -0.25984210435241933, 0.2532865829844639, 0.05923081523733874, 0.19810598158762943, -0.08143473062516442, 0.04589126900173526, -0.11085902843205504, -0.03989042849825059, 0.021696308206412055, -0.13730533507638876, 0.06294762221948495, 0.2115950857866939, 0.0998989387166504, 0.20855431257939291, -0.36857476148744506, -0.19594195085176064, 0.04666070024872189, 0.19838552639164306, 0.08616126109611874, -0.0669098192535337, -0.23228358071563499, 0.11741213744171161, -0.1671613299856997, -0.191578851590209, -0.012177759062045466, 0.16372956905178923, 0.043650765892206914, -0.2686905431910033, 0.14580617470250382, 0.007283748330168978, 0.20520577994889763, -0.10403495749998247, -0.13892874175623532, -0.10736666148572806, 0.10667531670760437, 0.12980844862709837, 0.0772255068822276, 0.09411034311005284, -0.10233051611342167, -0.050925433692379445, 0.3548996670506698, -0.11496913043214513, -0.06477183525982712, 0.1969846880122546, -0.22303686824765195, -0.10564785641889093, 0.13900297760184874, 0.12374145398470796, 0.1284812426714414, -0.10170460653013338, -0.04589257780268478, -0.025563494727340718, 0.20583471144172585, 0.10578317983598305, 0.02320389833335799, 0.22651037301809068, 0.15829349359159886, 0.04275293494870384, 0.06317240990594858, -0.1960951105849177, -0.07906626063434742, -0.18242240519257924, -0.09966364374172396, -0.08700014693630495, 0.04404053069335758, -0.07992687935932606, -0.11924911700386219, 0.32568985156261576, 0.09876498947210767, 0.2096902087039626, 0.0695018540660077, 0.2669019532271676, 0.18115596151873764, 0.15892549004707862, 0.10955649859915, 0.32714358724379006, 0.21675548962780605, 0.1192245667346965, -0.2879253360282669, 0.11094148409498668, 0.014753357533158528] |
1,802.0869 | "You are no Jack Kennedy": On Media Selection of Highlights from
Presidential Debates | Political speeches and debates play an important role in shaping the images
of politicians, and the public often relies on media outlets to select bits of
political communication from a large pool of utterances. It is an important
research question to understand what factors impact this selection process.
To quantitatively explore the selection process, we build a three- decade
dataset of presidential debate transcripts and post-debate coverage. We first
examine the effect of wording and propose a binary classification framework
that controls for both the speaker and the debate situation. We find that
crowdworkers can only achieve an accuracy of 60% in this task, indicating that
media choices are not entirely obvious. Our classifiers outperform crowdworkers
on average, mainly in primary debates. We also compare important factors from
crowdworkers' free-form explanations with those from data-driven methods and
find interesting differences. Few crowdworkers mentioned that "context
matters", whereas our data show that well-quoted sentences are more distinct
from the previous utterance by the same speaker than less-quoted sentences.
Finally, we examine the aggregate effect of media preferences towards different
wordings to understand the extent of fragmentation among media outlets. By
analyzing a bipartite graph built from quoting behavior in our data, we observe
a decreasing trend in bipartisan coverage.
| cs.SI cs.CL physics.soc-ph | political speeches and debates play an important role in shaping the images of politicians and the public often relies on media outlets to select bits of political communication from a large pool of utterances it is an important research question to understand what factors impact this selection process to quantitatively explore the selection process we build a three decade dataset of presidential debate transcripts and postdebate coverage we first examine the effect of wording and propose a binary classification framework that controls for both the speaker and the debate situation we find that crowdworkers can only achieve an accuracy of 60 in this task indicating that media choices are not entirely obvious our classifiers outperform crowdworkers on average mainly in primary debates we also compare important factors from crowdworkers freeform explanations with those from datadriven methods and find interesting differences few crowdworkers mentioned that context matters whereas our data show that wellquoted sentences are more distinct from the previous utterance by the same speaker than lessquoted sentences finally we examine the aggregate effect of media preferences towards different wordings to understand the extent of fragmentation among media outlets by analyzing a bipartite graph built from quoting behavior in our data we observe a decreasing trend in bipartisan coverage | [['political', 'speeches', 'and', 'debates', 'play', 'an', 'important', 'role', 'in', 'shaping', 'the', 'images', 'of', 'politicians', 'and', 'the', 'public', 'often', 'relies', 'on', 'media', 'outlets', 'to', 'select', 'bits', 'of', 'political', 'communication', 'from', 'a', 'large', 'pool', 'of', 'utterances', 'it', 'is', 'an', 'important', 'research', 'question', 'to', 'understand', 'what', 'factors', 'impact', 'this', 'selection', 'process', 'to', 'quantitatively', 'explore', 'the', 'selection', 'process', 'we', 'build', 'a', 'three', 'decade', 'dataset', 'of', 'presidential', 'debate', 'transcripts', 'and', 'postdebate', 'coverage', 'we', 'first', 'examine', 'the', 'effect', 'of', 'wording', 'and', 'propose', 'a', 'binary', 'classification', 'framework', 'that', 'controls', 'for', 'both', 'the', 'speaker', 'and', 'the', 'debate', 'situation', 'we', 'find', 'that', 'crowdworkers', 'can', 'only', 'achieve', 'an', 'accuracy', 'of', '60', 'in', 'this', 'task', 'indicating', 'that', 'media', 'choices', 'are', 'not', 'entirely', 'obvious', 'our', 'classifiers', 'outperform', 'crowdworkers', 'on', 'average', 'mainly', 'in', 'primary', 'debates', 'we', 'also', 'compare', 'important', 'factors', 'from', 'crowdworkers', 'freeform', 'explanations', 'with', 'those', 'from', 'datadriven', 'methods', 'and', 'find', 'interesting', 'differences', 'few', 'crowdworkers', 'mentioned', 'that', 'context', 'matters', 'whereas', 'our', 'data', 'show', 'that', 'wellquoted', 'sentences', 'are', 'more', 'distinct', 'from', 'the', 'previous', 'utterance', 'by', 'the', 'same', 'speaker', 'than', 'lessquoted', 'sentences', 'finally', 'we', 'examine', 'the', 'aggregate', 'effect', 'of', 'media', 'preferences', 'towards', 'different', 'wordings', 'to', 'understand', 'the', 'extent', 'of', 'fragmentation', 'among', 'media', 'outlets', 'by', 'analyzing', 'a', 'bipartite', 'graph', 'built', 'from', 'quoting', 'behavior', 'in', 'our', 'data', 'we', 'observe', 'a', 'decreasing', 'trend', 'in', 'bipartisan', 'coverage']] | [-0.06932043417004823, 0.057432790896386796, -0.08703848089477638, 0.11624847837170464, -0.12765538245893834, -0.1158495375591262, 0.09573787872952114, 0.4343078978677712, -0.23286751284741047, -0.3401482071909236, 0.07011884710319885, -0.3460643594584814, -0.16644248687321456, 0.16428601383572308, -0.09875014054149044, -0.022913858674966345, 0.08488068755534364, 0.0350868164056276, 0.01230482444871308, -0.31053119216685, 0.34927592856309764, 0.052376529662983444, 0.35604381500402604, 0.04908471131561006, 0.06631645911725284, -0.014620589121530917, -0.11147816560526447, -0.027681318137840163, -0.1045423495376315, 0.11178637739929666, 0.32418301609322064, 0.18726507475054482, 0.35484619173562015, -0.3949384541318911, -0.20085460845744466, 0.07246007547691101, 0.13367922139558486, 0.10517617045197546, -0.04733976676141582, -0.31650811652596134, 0.042367308014981085, -0.17754391423489035, -0.011009220715339591, -0.07360053245665324, 0.04054328232106367, -0.0190257236350146, -0.21734749734537995, 0.060232242477188884, 0.08258278310844085, 0.10781949603157799, -0.04131809130152006, -0.11690111918397611, 0.018400084834954724, 0.20687250397281676, 0.10849818652126621, 0.01555337901511116, 0.1468299541355497, -0.19772321670060614, -0.1523241710553809, 0.4141198347118206, -0.020140757694025523, -0.15650283953674682, 0.17755885630698376, -0.11935185120418304, -0.14130651373189035, 0.055931500951396075, 0.23855334122824232, 0.08581785348175866, -0.17768600531349743, -0.06655855629672637, -0.08658960893318603, 0.24283686652552428, 0.0843183162417717, 0.011628228653699342, 0.20926826359567846, 0.18831078875355603, -0.0019059222305148112, 0.1382908528216365, -0.03620430539339417, -0.0772616540195375, -0.20196564713856432, -0.0955194736751387, -0.10997162789628818, 0.01789429740002095, -0.07733215548782382, -0.11094209366001007, 0.3792906795878236, 0.23792688035826404, 0.18689651899039744, 0.03642615878091353, 0.25924997730407773, -0.016882095384275222, 0.06334077088707467, 0.0701866668350881, 0.20439696725139894, -0.006781067938839153, 0.11757998600738441, -0.15744424803954798, 0.1407799824390833, -0.03733925535911467] |
1,802.08691 | From few- to many-body quantum systems | How many particles are necessary to make a quantum system many-body? To
answer this question, we take as reference for the many-body limit a quantum
system at half-filling and compare its properties with those of a system with
$N$ particles, gradually increasing $N$ from 1. We show that convergence for
the static properties of the system with few particles to the many-body limit
is fast. For $N \gsim 4$, the density of states is already very close to
Gaussian and signatures of many-body quantum chaos, such as level repulsion and
fully extended eigenstates, become evident. The dynamics, on the other hand,
depend on the initial state and time scale. In dilute systems, as the particles
move away from each other, the entropy growth changes in time from linear, as
typical for many-body systems, to logarithmic.
| cond-mat.stat-mech cond-mat.quant-gas cond-mat.str-el | how many particles are necessary to make a quantum system manybody to answer this question we take as reference for the manybody limit a quantum system at halffilling and compare its properties with those of a system with n particles gradually increasing n from 1 we show that convergence for the static properties of the system with few particles to the manybody limit is fast for n gsim 4 the density of states is already very close to gaussian and signatures of manybody quantum chaos such as level repulsion and fully extended eigenstates become evident the dynamics on the other hand depend on the initial state and time scale in dilute systems as the particles move away from each other the entropy growth changes in time from linear as typical for manybody systems to logarithmic | [['how', 'many', 'particles', 'are', 'necessary', 'to', 'make', 'a', 'quantum', 'system', 'manybody', 'to', 'answer', 'this', 'question', 'we', 'take', 'as', 'reference', 'for', 'the', 'manybody', 'limit', 'a', 'quantum', 'system', 'at', 'halffilling', 'and', 'compare', 'its', 'properties', 'with', 'those', 'of', 'a', 'system', 'with', 'n', 'particles', 'gradually', 'increasing', 'n', 'from', '1', 'we', 'show', 'that', 'convergence', 'for', 'the', 'static', 'properties', 'of', 'the', 'system', 'with', 'few', 'particles', 'to', 'the', 'manybody', 'limit', 'is', 'fast', 'for', 'n', 'gsim', '4', 'the', 'density', 'of', 'states', 'is', 'already', 'very', 'close', 'to', 'gaussian', 'and', 'signatures', 'of', 'manybody', 'quantum', 'chaos', 'such', 'as', 'level', 'repulsion', 'and', 'fully', 'extended', 'eigenstates', 'become', 'evident', 'the', 'dynamics', 'on', 'the', 'other', 'hand', 'depend', 'on', 'the', 'initial', 'state', 'and', 'time', 'scale', 'in', 'dilute', 'systems', 'as', 'the', 'particles', 'move', 'away', 'from', 'each', 'other', 'the', 'entropy', 'growth', 'changes', 'in', 'time', 'from', 'linear', 'as', 'typical', 'for', 'manybody', 'systems', 'to', 'logarithmic']] | [-0.10204648935684452, 0.19867812137084978, -0.09729030707989025, 0.07612157471357259, 0.03398122205834187, -0.16793107258121448, 0.028115509425643486, 0.3148857062579029, -0.2862572390655125, -0.28829430882146373, 0.09631422666867298, -0.346734743943024, -0.10170404510400086, 0.18298898265283142, 0.02893389794561598, 0.09263885606865019, 0.058144832376597656, 0.07612511413516822, -0.06463956112490483, -0.22358937927832206, 0.3100713112770959, 0.04234598395328417, 0.20241330200030158, 0.04065629570158543, 0.060769686171853986, 0.009860934748279827, 0.09155772137283175, 0.023208729336383165, -0.09320955980009683, 0.04401162183693722, 0.22770843999287874, 0.06061250376574376, 0.26643362000791565, -0.45072019000848135, -0.19889859596991705, 0.07348431229453396, 0.16936231165848398, 0.17559971902174532, -0.025769386628504705, -0.3000456159485987, 0.05649598592685329, -0.17063919225086768, -0.15954847610383122, -0.0797335962868399, 0.0589731062417505, 0.03267805019471173, -0.22486993219979384, 0.07877938677039412, 0.06025274550645716, 0.029610012199177787, -0.03499271429264573, -0.07859362602509834, -0.001548461829898534, 0.16321173830095817, 0.02180987204520298, 0.019967745842317256, 0.16322980550359245, -0.15659324157534651, -0.08418037633377093, 0.4076840440570204, -0.06078548936035346, -0.18135970987517525, 0.2739601227696295, -0.17629024670631796, -0.1440617813038881, 0.12484298111974365, 0.16956796883432954, 0.09082967036369222, -0.10031317624228972, 0.10423332775115139, 0.0029823926251588595, 0.20392499717849272, 0.01768627546693164, 0.11033566142432391, 0.2076850999008726, 0.1476569889527228, 0.11393271744535823, 0.1294536653500809, -0.048749752118493674, -0.16022026624047644, -0.2605553888336376, -0.14760062043917263, -0.22904706281713313, 0.07324783087328628, -0.06559667354751447, -0.18132086954304855, 0.3654388496928193, 0.17761857370259584, 0.23866049354137095, 0.06695844978439035, 0.24137925212099046, 0.12623814887677628, 0.020009946543723345, 0.07273730157046682, 0.22840978236937964, 0.10676007174921257, 0.10119634758405112, -0.22881121668033302, 0.022034732486914704, 0.04521232399296154] |
1,802.08692 | X-ray properties of high-richness CAMIRA clusters in the Hyper
Suprime-Cam Subaru Strategic Program field | We present the first results of a pilot X-ray study of 37 rich galaxy
clusters at $0.1<z<1.1$ in the Hyper Suprime-Cam Subaru Strategic Program
(HSC-SSP) field. Diffuse X-ray emissions from these clusters were
serendipitously detected in the XMM-Newton fields of view. We systematically
analyze X-ray images of 37 clusters and emission spectra of a subsample of 17
clusters with high photon statistics by using the XMM-Newton archive data. The
frequency distribution of the offset between the X-ray centroid or peak and the
position of the brightest cluster galaxy was derived for the optical cluster
sample. The fraction of relaxed clusters estimated from the X-ray peak offsets
in 17 clusters is $29\pm11(\pm13)$\%, which is smaller than that of the X-ray
cluster samples such as HIFLUGCS. Since the optical cluster search is immune to
the physical state of X-ray-emitting gas, it is likely to cover a larger range
of the cluster morphology. We also derived the luminosity-temperature relation
and found that the slope is marginally shallower than those of X-ray-selected
samples and consistent with the self-similar model prediction of 2.
Accordingly, our results show that the X-ray properties of the optical clusters
are marginally different from those observed in the X-ray samples. The
implication of the results and future prospects are briefly discussed.
| astro-ph.CO | we present the first results of a pilot xray study of 37 rich galaxy clusters at 01z11 in the hyper suprimecam subaru strategic program hscssp field diffuse xray emissions from these clusters were serendipitously detected in the xmmnewton fields of view we systematically analyze xray images of 37 clusters and emission spectra of a subsample of 17 clusters with high photon statistics by using the xmmnewton archive data the frequency distribution of the offset between the xray centroid or peak and the position of the brightest cluster galaxy was derived for the optical cluster sample the fraction of relaxed clusters estimated from the xray peak offsets in 17 clusters is 29pm11pm13 which is smaller than that of the xray cluster samples such as hiflugcs since the optical cluster search is immune to the physical state of xrayemitting gas it is likely to cover a larger range of the cluster morphology we also derived the luminositytemperature relation and found that the slope is marginally shallower than those of xrayselected samples and consistent with the selfsimilar model prediction of 2 accordingly our results show that the xray properties of the optical clusters are marginally different from those observed in the xray samples the implication of the results and future prospects are briefly discussed | [['we', 'present', 'the', 'first', 'results', 'of', 'a', 'pilot', 'xray', 'study', 'of', '37', 'rich', 'galaxy', 'clusters', 'at', '01z11', 'in', 'the', 'hyper', 'suprimecam', 'subaru', 'strategic', 'program', 'hscssp', 'field', 'diffuse', 'xray', 'emissions', 'from', 'these', 'clusters', 'were', 'serendipitously', 'detected', 'in', 'the', 'xmmnewton', 'fields', 'of', 'view', 'we', 'systematically', 'analyze', 'xray', 'images', 'of', '37', 'clusters', 'and', 'emission', 'spectra', 'of', 'a', 'subsample', 'of', '17', 'clusters', 'with', 'high', 'photon', 'statistics', 'by', 'using', 'the', 'xmmnewton', 'archive', 'data', 'the', 'frequency', 'distribution', 'of', 'the', 'offset', 'between', 'the', 'xray', 'centroid', 'or', 'peak', 'and', 'the', 'position', 'of', 'the', 'brightest', 'cluster', 'galaxy', 'was', 'derived', 'for', 'the', 'optical', 'cluster', 'sample', 'the', 'fraction', 'of', 'relaxed', 'clusters', 'estimated', 'from', 'the', 'xray', 'peak', 'offsets', 'in', '17', 'clusters', 'is', '29pm11pm13', 'which', 'is', 'smaller', 'than', 'that', 'of', 'the', 'xray', 'cluster', 'samples', 'such', 'as', 'hiflugcs', 'since', 'the', 'optical', 'cluster', 'search', 'is', 'immune', 'to', 'the', 'physical', 'state', 'of', 'xrayemitting', 'gas', 'it', 'is', 'likely', 'to', 'cover', 'a', 'larger', 'range', 'of', 'the', 'cluster', 'morphology', 'we', 'also', 'derived', 'the', 'luminositytemperature', 'relation', 'and', 'found', 'that', 'the', 'slope', 'is', 'marginally', 'shallower', 'than', 'those', 'of', 'xrayselected', 'samples', 'and', 'consistent', 'with', 'the', 'selfsimilar', 'model', 'prediction', 'of', '2', 'accordingly', 'our', 'results', 'show', 'that', 'the', 'xray', 'properties', 'of', 'the', 'optical', 'clusters', 'are', 'marginally', 'different', 'from', 'those', 'observed', 'in', 'the', 'xray', 'samples', 'the', 'implication', 'of', 'the', 'results', 'and', 'future', 'prospects', 'are', 'briefly', 'discussed']] | [-0.03184019222085009, 0.1023781414936474, -0.09542846721042657, 0.1077149486706947, -0.07798787668635625, -0.024617452447169594, 0.08839471874913822, 0.4515283253221285, -0.19895067790833612, -0.39124614696816673, 0.06854669425104346, -0.3666743529250934, -0.04965307748366502, 0.22331702604202464, 0.02487576545349189, -0.008995187522045204, 0.06203109318878324, -0.0549323619831176, -0.04345085859420665, -0.29632523395121096, 0.30544057885805764, 0.08363121302044463, 0.24609608193415972, -0.06647785938832732, 0.053312658011314594, -0.026919534166033068, -0.0937485635912578, 0.0333808251185387, -0.11197309161552334, 0.08348570287621225, 0.22600701800991027, 0.1121815281920135, 0.2054152422761988, -0.3136706157053552, -0.18047576078402233, 0.05147007972645085, 0.18042550138752197, 0.0236747309205211, -0.05590071242435702, -0.2957287493383601, 0.09456069381724644, -0.15818213674328513, -0.16547444770112635, 0.08959010625258088, 0.023972092474633385, 0.0745955105216819, -0.1714721731131985, 0.1548737391462228, -0.023281758778639847, 0.07399205820457566, -0.1750193809253341, -0.11533985702720072, -0.04207071282878695, 0.08127361206293461, -0.028149815539585517, 0.04471345169114924, 0.17126837281421536, -0.15749308211019353, -0.05377300257484118, 0.3837135680951178, 0.0002508882004933964, 0.04961706651152954, 0.19117552146795094, -0.22567894760563614, -0.20558157105974498, 0.14642657642474488, 0.12512022060053868, 0.08657400392063816, -0.18040198790563625, 0.005660411884864083, -0.05166568510411751, 0.2632445942255713, 0.02467612921304646, 0.07785790056070602, 0.2620629735601445, 0.10821945061020198, 0.018544800240280372, 0.19458085076462123, -0.2727204969064111, 0.0006966781087352762, -0.23185743592967767, -0.06544043472081068, -0.13883167167881594, 0.03517667950197522, -0.1157095090194378, -0.12148110519906151, 0.331716371451815, 0.10140101427567147, 0.1973065108193883, 0.06552177443601458, 0.2738254276858199, 0.08470898533761058, 0.10312012013136632, 0.061276679694475165, 0.3075635770025353, 0.14090779734819772, 0.07281925007534612, -0.22393928208787525, 0.043071943667850325, -0.042071402996052276] |
1,802.08693 | Populations of planets in multiple star systems | Astronomers have discovered that both planets and binaries are abundant
throughout the Galaxy. In combination, we know of over 100 planets in binary
and higher-order multi-star systems, in both circumbinary and circumstellar
configurations. In this chapter we review these findings and some of their
implications for the formation of both stars and planets. Most of the planets
found have been circumstellar, where there is seemingly a ruinous influence of
the second star if sufficiently close (<50 AU). Hosts of hot Jupiters have been
a particularly popular target for binary star studies, showing an enhanced rate
of stellar multiplicity for moderately wide binaries (>100 AU). This was
thought to be a sign of Kozai-Lidov migration, however recent studies have
shown this mechanism to be too inefficient to account for the majority of hot
Jupiters. A couple of dozen circumbinary planets have been proposed around both
main sequence and evolved binaries. Around main sequence binaries there are
preliminary indications that the frequency of gas giants is as high as those
around single stars. There is however a conspicuous absence of circumbinary
planets around the tightest main sequence binaries with periods of just a few
days, suggesting a unique, more disruptive formation history of such close
stellar pairs.
| astro-ph.EP astro-ph.SR | astronomers have discovered that both planets and binaries are abundant throughout the galaxy in combination we know of over 100 planets in binary and higherorder multistar systems in both circumbinary and circumstellar configurations in this chapter we review these findings and some of their implications for the formation of both stars and planets most of the planets found have been circumstellar where there is seemingly a ruinous influence of the second star if sufficiently close 50 au hosts of hot jupiters have been a particularly popular target for binary star studies showing an enhanced rate of stellar multiplicity for moderately wide binaries 100 au this was thought to be a sign of kozailidov migration however recent studies have shown this mechanism to be too inefficient to account for the majority of hot jupiters a couple of dozen circumbinary planets have been proposed around both main sequence and evolved binaries around main sequence binaries there are preliminary indications that the frequency of gas giants is as high as those around single stars there is however a conspicuous absence of circumbinary planets around the tightest main sequence binaries with periods of just a few days suggesting a unique more disruptive formation history of such close stellar pairs | [['astronomers', 'have', 'discovered', 'that', 'both', 'planets', 'and', 'binaries', 'are', 'abundant', 'throughout', 'the', 'galaxy', 'in', 'combination', 'we', 'know', 'of', 'over', '100', 'planets', 'in', 'binary', 'and', 'higherorder', 'multistar', 'systems', 'in', 'both', 'circumbinary', 'and', 'circumstellar', 'configurations', 'in', 'this', 'chapter', 'we', 'review', 'these', 'findings', 'and', 'some', 'of', 'their', 'implications', 'for', 'the', 'formation', 'of', 'both', 'stars', 'and', 'planets', 'most', 'of', 'the', 'planets', 'found', 'have', 'been', 'circumstellar', 'where', 'there', 'is', 'seemingly', 'a', 'ruinous', 'influence', 'of', 'the', 'second', 'star', 'if', 'sufficiently', 'close', '50', 'au', 'hosts', 'of', 'hot', 'jupiters', 'have', 'been', 'a', 'particularly', 'popular', 'target', 'for', 'binary', 'star', 'studies', 'showing', 'an', 'enhanced', 'rate', 'of', 'stellar', 'multiplicity', 'for', 'moderately', 'wide', 'binaries', '100', 'au', 'this', 'was', 'thought', 'to', 'be', 'a', 'sign', 'of', 'kozailidov', 'migration', 'however', 'recent', 'studies', 'have', 'shown', 'this', 'mechanism', 'to', 'be', 'too', 'inefficient', 'to', 'account', 'for', 'the', 'majority', 'of', 'hot', 'jupiters', 'a', 'couple', 'of', 'dozen', 'circumbinary', 'planets', 'have', 'been', 'proposed', 'around', 'both', 'main', 'sequence', 'and', 'evolved', 'binaries', 'around', 'main', 'sequence', 'binaries', 'there', 'are', 'preliminary', 'indications', 'that', 'the', 'frequency', 'of', 'gas', 'giants', 'is', 'as', 'high', 'as', 'those', 'around', 'single', 'stars', 'there', 'is', 'however', 'a', 'conspicuous', 'absence', 'of', 'circumbinary', 'planets', 'around', 'the', 'tightest', 'main', 'sequence', 'binaries', 'with', 'periods', 'of', 'just', 'a', 'few', 'days', 'suggesting', 'a', 'unique', 'more', 'disruptive', 'formation', 'history', 'of', 'such', 'close', 'stellar', 'pairs']] | [-0.12772809334905683, 0.13949638835513659, -0.0399048973902742, 0.0919391518487118, -0.10799020648473964, -0.06616273014692635, 0.047223384893590174, 0.3907230535612964, -0.15834157065113597, -0.3295578717958273, 0.08208388057963287, -0.2992283489221491, -0.1085144290530191, 0.23483961513493118, -0.07776547246726184, 0.015499467282306131, 0.16187376223686264, -0.02462438363127592, -0.017210959270596505, -0.2988439323335159, 0.31648088957114917, 0.04497562040185851, 0.026220414464975274, 0.002131620571925873, 0.014896992825698561, -0.09890756942558943, -0.014437227787041082, -0.06756013372413269, -0.13968782384074918, 0.0208700136167974, 0.28518533761635784, 0.13792227333661441, 0.2843209560619803, -0.3832874313087725, -0.2365248700785564, 0.06915802496326406, 0.21070247609054715, 0.05534173219532865, -0.11935414469200357, -0.21701558187444944, 0.15313336319948842, -0.24643534917622895, -0.14443072130585588, 0.012962925306907513, 0.11644783725326018, 0.04201203411950435, -0.21430170807487717, 0.07331389508482705, 0.12006523447429261, 0.11828965028611625, -0.11284367007021678, -0.13791814527088186, -0.053553494949620674, 0.09306576256299527, 0.08449807143315854, 0.05604879520549552, 0.13597408971612954, -0.09331380354762986, -0.04747238761813539, 0.4130778298417969, -0.07471432819417337, -0.03139877850871261, 0.31106906758803055, -0.2359611371327646, -0.17545707846946287, 0.1421458173316063, 0.17577317108218443, 0.20136968141376246, -0.17377188678819505, -0.04454584469871096, -0.019502425066581588, 0.19546974785398782, 0.11225890346416613, 0.08993850081098527, 0.4448741752654314, 0.16415732904428207, 0.016045855972688736, 0.0668646347879364, -0.17697806985730805, -0.10645948941308278, -0.1265453345028729, -0.10646343665515504, -0.1534036367563758, 0.04709016651074152, -0.08563608937831482, -0.13323358066604338, 0.31947078881118013, 0.11033357076528595, 0.21687319803437807, -0.016555109943785683, 0.2691785963933642, 0.06561279937783937, 0.1305481546160924, 0.13156669610293537, 0.34016459856662196, 0.1569155040742239, 0.07656644929552496, -0.19195809055633684, 0.12332083701053861, -0.07826834304681297] |
1,802.08694 | Scale-dependent galaxy bias, CMB lensing-galaxy cross-correlation, and
neutrino masses | One of the most powerful cosmological datasets when it comes to constraining
neutrino masses is represented by galaxy power spectrum measurements,
$P_{gg}(k)$. The constraining power of $P_{gg}(k)$ is however severely limited
by uncertainties in the modeling of the scale-dependent galaxy bias $b(k)$. In
this Letter we present a new method to constrain $b(k)$ by using the
cross-correlation between the Cosmic Microwave Background (CMB) lensing signal
and galaxy maps ($C_\ell^{\rm \kappa g}$) using a simple but theoretically
well-motivated parametrization for $b(k)$. We apply the method using
$C_\ell^{\rm \kappa g}$ measured by cross-correlating Planck lensing maps and
the Baryon Oscillation Spectroscopic Survey (BOSS) Data Release 11 (DR11) CMASS
galaxy sample, and $P_{gg}(k)$ measured from the BOSS DR12 CMASS sample. We
detect a non-zero scale-dependence at moderate significance, which suggests
that a proper modeling of $b(k)$ is necessary in order to reduce the impact of
non-linearities and minimize the corresponding systematics. The accomplished
increase in constraining power of $P_{gg}(k)$ is demonstrated by determining a
95% C.L. upper bound on the sum of the three active neutrino masses $M_{\nu}$
of $M_{\nu}<0.19\, {\rm eV}$. This limit represents a significant improvement
over previous bounds with comparable datasets. Our method will prove especially
powerful and important as future large-scale structure surveys will overlap
more significantly with the CMB lensing kernel providing a large
cross-correlation signal.
| astro-ph.CO astro-ph.GA astro-ph.HE gr-qc hep-ph | one of the most powerful cosmological datasets when it comes to constraining neutrino masses is represented by galaxy power spectrum measurements p_ggk the constraining power of p_ggk is however severely limited by uncertainties in the modeling of the scaledependent galaxy bias bk in this letter we present a new method to constrain bk by using the crosscorrelation between the cosmic microwave background cmb lensing signal and galaxy maps c_ellrm kappa g using a simple but theoretically wellmotivated parametrization for bk we apply the method using c_ellrm kappa g measured by crosscorrelating planck lensing maps and the baryon oscillation spectroscopic survey boss data release 11 dr11 cmass galaxy sample and p_ggk measured from the boss dr12 cmass sample we detect a nonzero scaledependence at moderate significance which suggests that a proper modeling of bk is necessary in order to reduce the impact of nonlinearities and minimize the corresponding systematics the accomplished increase in constraining power of p_ggk is demonstrated by determining a 95 cl upper bound on the sum of the three active neutrino masses m_nu of m_nu019 rm ev this limit represents a significant improvement over previous bounds with comparable datasets our method will prove especially powerful and important as future largescale structure surveys will overlap more significantly with the cmb lensing kernel providing a large crosscorrelation signal | [['one', 'of', 'the', 'most', 'powerful', 'cosmological', 'datasets', 'when', 'it', 'comes', 'to', 'constraining', 'neutrino', 'masses', 'is', 'represented', 'by', 'galaxy', 'power', 'spectrum', 'measurements', 'p_ggk', 'the', 'constraining', 'power', 'of', 'p_ggk', 'is', 'however', 'severely', 'limited', 'by', 'uncertainties', 'in', 'the', 'modeling', 'of', 'the', 'scaledependent', 'galaxy', 'bias', 'bk', 'in', 'this', 'letter', 'we', 'present', 'a', 'new', 'method', 'to', 'constrain', 'bk', 'by', 'using', 'the', 'crosscorrelation', 'between', 'the', 'cosmic', 'microwave', 'background', 'cmb', 'lensing', 'signal', 'and', 'galaxy', 'maps', 'c_ellrm', 'kappa', 'g', 'using', 'a', 'simple', 'but', 'theoretically', 'wellmotivated', 'parametrization', 'for', 'bk', 'we', 'apply', 'the', 'method', 'using', 'c_ellrm', 'kappa', 'g', 'measured', 'by', 'crosscorrelating', 'planck', 'lensing', 'maps', 'and', 'the', 'baryon', 'oscillation', 'spectroscopic', 'survey', 'boss', 'data', 'release', '11', 'dr11', 'cmass', 'galaxy', 'sample', 'and', 'p_ggk', 'measured', 'from', 'the', 'boss', 'dr12', 'cmass', 'sample', 'we', 'detect', 'a', 'nonzero', 'scaledependence', 'at', 'moderate', 'significance', 'which', 'suggests', 'that', 'a', 'proper', 'modeling', 'of', 'bk', 'is', 'necessary', 'in', 'order', 'to', 'reduce', 'the', 'impact', 'of', 'nonlinearities', 'and', 'minimize', 'the', 'corresponding', 'systematics', 'the', 'accomplished', 'increase', 'in', 'constraining', 'power', 'of', 'p_ggk', 'is', 'demonstrated', 'by', 'determining', 'a', '95', 'cl', 'upper', 'bound', 'on', 'the', 'sum', 'of', 'the', 'three', 'active', 'neutrino', 'masses', 'm_nu', 'of', 'm_nu019', 'rm', 'ev', 'this', 'limit', 'represents', 'a', 'significant', 'improvement', 'over', 'previous', 'bounds', 'with', 'comparable', 'datasets', 'our', 'method', 'will', 'prove', 'especially', 'powerful', 'and', 'important', 'as', 'future', 'largescale', 'structure', 'surveys', 'will', 'overlap', 'more', 'significantly', 'with', 'the', 'cmb', 'lensing', 'kernel', 'providing', 'a', 'large', 'crosscorrelation', 'signal']] | [-0.09423030105385659, 0.07859527641394463, -0.05106612615510478, 0.12501651426017593, -0.12408972788958333, -0.0700563369812401, 0.03516763327793489, 0.3163938548304312, -0.19467928498599266, -0.34565894792826357, 0.042038583022881354, -0.3308783751160812, -0.02978290407703803, 0.25499316475950695, 0.03565809695953546, 0.033409229800006386, 0.07573831630700033, -0.08028779826277206, -0.029949033732122574, -0.2893658260168928, 0.2897847049240847, 0.1501078526596732, 0.26470859393837953, -0.010128325896449216, 0.10406585279068897, -0.060654384251158204, -0.16795637625728815, 0.017243587178036503, -0.17340346512684202, 0.07126566022741801, 0.2354261729799743, 0.161138246022594, 0.2011268065865731, -0.2876162466982434, -0.20405341409069533, 0.17136404936283414, 0.17732210638439325, 0.09732327305441958, -0.03624776431311336, -0.29099671224192264, 0.08661194949495082, -0.1730390390540014, -0.08618068988426923, -0.04864083936444402, -0.014334632085919518, -0.001075538197716844, -0.2817934580645653, 0.18511685044483242, -0.009698268481045274, 0.045765352949220045, -0.03303867304045278, -0.15647510399029071, -0.046341373622717875, 0.053154119444514245, -0.0020257720202293402, 0.07525513692402758, 0.12922765870582878, -0.15179284430036002, -0.022799014963621644, 0.4018367871273017, -0.1358352881509699, -0.07974463144600528, 0.06909853272560623, -0.19854860813442773, -0.19058759133910871, 0.07056995833234664, 0.17760073885826977, 0.03981465508320158, -0.17516510631232726, 0.11030555295748293, 0.01220409539520144, 0.2441145519464178, 0.054080502666567325, 0.01680531337120128, 0.2556886641943853, 0.15346856781577667, 0.11740392037830423, 0.06669258196142927, -0.1817029945709, 0.07711537970521826, -0.27698365702993377, -0.010024327437408389, -0.18084013578589267, 0.09477130149293708, -0.15697130390456587, -0.09152031055378539, 0.3818137796235181, 0.1693094820266993, 0.2232091421280743, 0.09139084186960733, 0.3551398871706859, 0.07767812201210345, 0.08394108808809711, 0.016060649316483242, 0.3114512582805248, 0.1726643171146392, 0.059572913473652254, -0.23654475161260688, 0.008854584738371833, -0.008832645425487156] |
1,802.08695 | Short-lived radioisotopes in meteorites from Galactic-scale correlated
star formation | Meteoritic evidence shows that the Solar system at birth contained
significant quantities of short-lived radioisotopes (SLRs) such as 60Fe and
26Al (with half-lives of 2.6 and 0.7 Myr respectively) produced in supernova
explosions and in the Wolf-Rayet winds that precede them. Proposed explanations
for the high SLR abundance include formation of the Sun in a
supernova-triggered collapse or in a giant molecular cloud (GMC) that was
massive enough to survive multiple supernovae (SNe) and confine their ejecta.
However, the former scenario is possible only if the Sun is a rare outlier
among massive stars, while the latter appears to be inconsistent with the
observation that 26Al is distributed with a scale height significantly larger
than GMCs. In this paper, we present a high-resolution chemo-hydrodynamical
simulation of the entire Milky-Way Galaxy, including stochastic star formation,
HII regions, SNe, and element injection, that allows us to measure for the
distribution of 60Fe/56Fe and 26Al/27Al ratios over all stars in the Galaxy. We
show that the Solar System's abundance ratios are well within the normal range,
but that SLRs originate neither from triggering nor from confinement in
long-lived clouds as previously conjectured. Instead, we find that SLRs are
abundant in newborn stars because star formation is correlated on galactic
scales, so that ejecta preferentially enrich atomic gas that will subsequently
be accreted onto existing GMCs or will form new ones. Thus new generations of
stars preferentially form in patches of the Galaxy contaminated by previous
generations of stellar winds and supernovae.
| astro-ph.GA astro-ph.EP astro-ph.SR | meteoritic evidence shows that the solar system at birth contained significant quantities of shortlived radioisotopes slrs such as 60fe and 26al with halflives of 26 and 07 myr respectively produced in supernova explosions and in the wolfrayet winds that precede them proposed explanations for the high slr abundance include formation of the sun in a supernovatriggered collapse or in a giant molecular cloud gmc that was massive enough to survive multiple supernovae sne and confine their ejecta however the former scenario is possible only if the sun is a rare outlier among massive stars while the latter appears to be inconsistent with the observation that 26al is distributed with a scale height significantly larger than gmcs in this paper we present a highresolution chemohydrodynamical simulation of the entire milkyway galaxy including stochastic star formation hii regions sne and element injection that allows us to measure for the distribution of 60fe56fe and 26al27al ratios over all stars in the galaxy we show that the solar systems abundance ratios are well within the normal range but that slrs originate neither from triggering nor from confinement in longlived clouds as previously conjectured instead we find that slrs are abundant in newborn stars because star formation is correlated on galactic scales so that ejecta preferentially enrich atomic gas that will subsequently be accreted onto existing gmcs or will form new ones thus new generations of stars preferentially form in patches of the galaxy contaminated by previous generations of stellar winds and supernovae | [['meteoritic', 'evidence', 'shows', 'that', 'the', 'solar', 'system', 'at', 'birth', 'contained', 'significant', 'quantities', 'of', 'shortlived', 'radioisotopes', 'slrs', 'such', 'as', '60fe', 'and', '26al', 'with', 'halflives', 'of', '26', 'and', '07', 'myr', 'respectively', 'produced', 'in', 'supernova', 'explosions', 'and', 'in', 'the', 'wolfrayet', 'winds', 'that', 'precede', 'them', 'proposed', 'explanations', 'for', 'the', 'high', 'slr', 'abundance', 'include', 'formation', 'of', 'the', 'sun', 'in', 'a', 'supernovatriggered', 'collapse', 'or', 'in', 'a', 'giant', 'molecular', 'cloud', 'gmc', 'that', 'was', 'massive', 'enough', 'to', 'survive', 'multiple', 'supernovae', 'sne', 'and', 'confine', 'their', 'ejecta', 'however', 'the', 'former', 'scenario', 'is', 'possible', 'only', 'if', 'the', 'sun', 'is', 'a', 'rare', 'outlier', 'among', 'massive', 'stars', 'while', 'the', 'latter', 'appears', 'to', 'be', 'inconsistent', 'with', 'the', 'observation', 'that', '26al', 'is', 'distributed', 'with', 'a', 'scale', 'height', 'significantly', 'larger', 'than', 'gmcs', 'in', 'this', 'paper', 'we', 'present', 'a', 'highresolution', 'chemohydrodynamical', 'simulation', 'of', 'the', 'entire', 'milkyway', 'galaxy', 'including', 'stochastic', 'star', 'formation', 'hii', 'regions', 'sne', 'and', 'element', 'injection', 'that', 'allows', 'us', 'to', 'measure', 'for', 'the', 'distribution', 'of', '60fe56fe', 'and', '26al27al', 'ratios', 'over', 'all', 'stars', 'in', 'the', 'galaxy', 'we', 'show', 'that', 'the', 'solar', 'systems', 'abundance', 'ratios', 'are', 'well', 'within', 'the', 'normal', 'range', 'but', 'that', 'slrs', 'originate', 'neither', 'from', 'triggering', 'nor', 'from', 'confinement', 'in', 'longlived', 'clouds', 'as', 'previously', 'conjectured', 'instead', 'we', 'find', 'that', 'slrs', 'are', 'abundant', 'in', 'newborn', 'stars', 'because', 'star', 'formation', 'is', 'correlated', 'on', 'galactic', 'scales', 'so', 'that', 'ejecta', 'preferentially', 'enrich', 'atomic', 'gas', 'that', 'will', 'subsequently', 'be', 'accreted', 'onto', 'existing', 'gmcs', 'or', 'will', 'form', 'new', 'ones', 'thus', 'new', 'generations', 'of', 'stars', 'preferentially', 'form', 'in', 'patches', 'of', 'the', 'galaxy', 'contaminated', 'by', 'previous', 'generations', 'of', 'stellar', 'winds', 'and', 'supernovae']] | [-0.04114108132353988, 0.18343422611560747, -0.029756537243287428, 0.13313610697502595, -0.06790556563611184, -0.03427441617820849, 0.06251974948936402, 0.39336240682223067, -0.1693485057139807, -0.319198374964508, 0.022027533753541287, -0.28832463496785304, -0.033436826088084924, 0.1949273238711715, -0.04101773583042004, -0.08193339148313863, 0.13042646813852551, -0.05901632186115874, -0.02446754197311976, -0.2735663476981683, 0.3035902448431193, 0.07192265537948261, 0.1471632313914597, -0.03535702209429521, 0.015917283890067566, -0.18729394622927584, -0.039195103712214026, -0.05555324513005161, -0.11298270055017696, 0.05309081280619087, 0.20806785458530372, 0.18749473599089225, 0.19793250798323164, -0.4350681554767405, -0.25239295935869094, 0.10725955798777069, 0.2829353100192961, 0.062016710775681896, -0.11776874038185321, -0.25526959101456453, 0.10443567889007299, -0.22280068345922177, -0.14345508773796078, 0.06519608567524202, 0.046399789925019905, 0.05581991179108144, -0.2489829110016121, 0.15024683360285634, 0.03643783058208576, 0.05539602607767652, -0.09614067299829736, -0.10590810965188602, -0.06538021957279308, 0.058019136083368894, 0.054753187443374804, 0.030775519900696977, 0.2044172845501594, -0.11773573353732013, 0.002965209134646997, 0.4480661632151905, -0.05423063785621288, -0.003997111072771341, 0.2568721325704187, -0.24085469998472073, -0.18925528539540737, 0.16162088630638022, 0.15859524126741742, 0.1286158188677917, -0.1616855785891655, -0.04015550848548131, -0.02675033721018032, 0.170734860512017, 0.05636977870394344, 0.07620823643931357, 0.32331249416100716, 0.12864563371118928, 0.02336231735252176, 0.05252660936600555, -0.18044402849917518, -0.08189216084511543, -0.21873443673090512, -0.1395312257420728, -0.10538799484940962, 0.0914108031299149, -0.10737793298909744, -0.13054769961606438, 0.2870779517106712, 0.11580595180396036, 0.2108739817454687, 0.0020314908995545705, 0.2840647048463947, 0.02317329356164072, 0.162059096246675, 0.1330415940719095, 0.2939301264389354, 0.16527519376311256, 0.08416739617321671, -0.22793123387681652, 0.1518340017750241, -0.0033600383309971707] |
1,802.08696 | Correlation Functions of the Quantum Sine-Gordon Model in and out of
Equilibrium | Complete information on the equilibrium behaviour and dynamics of a quantum
field theory (QFT) is provided by multipoint correlation functions. However,
their theoretical calculation is a challenging problem, even for exactly
solvable models. This has recently become an experimentally relevant problem,
due to progress in cold-atom experiments simulating QFT models and directly
measuring higher order correlations. Here we compute correlation functions of
the quantum sine-Gordon model, a prototype integrable model of central interest
from both theoretical and experimental points of view. Building upon the
so-called Truncated Conformal Space Approach, we numerically construct higher
order correlations in a system of finite size in various physical states of
experimental relevance, both in and out of equilibrium. We measure deviations
from Gaussianity due to the presence of interaction and analyse their
dependence on temperature, explaining the experimentally observed crossover
between Gaussian and non-Gaussian regimes. We find that correlations of excited
states are markedly different from the thermal case, which can be explained by
the integrability of the system. We also study dynamics after a quench,
observing the effects of the interaction on the time evolution of correlation
functions, their spatial dependence, and their non-Gaussianity as measured by
the kurtosis.
| cond-mat.stat-mech cond-mat.quant-gas hep-th quant-ph | complete information on the equilibrium behaviour and dynamics of a quantum field theory qft is provided by multipoint correlation functions however their theoretical calculation is a challenging problem even for exactly solvable models this has recently become an experimentally relevant problem due to progress in coldatom experiments simulating qft models and directly measuring higher order correlations here we compute correlation functions of the quantum sinegordon model a prototype integrable model of central interest from both theoretical and experimental points of view building upon the socalled truncated conformal space approach we numerically construct higher order correlations in a system of finite size in various physical states of experimental relevance both in and out of equilibrium we measure deviations from gaussianity due to the presence of interaction and analyse their dependence on temperature explaining the experimentally observed crossover between gaussian and nongaussian regimes we find that correlations of excited states are markedly different from the thermal case which can be explained by the integrability of the system we also study dynamics after a quench observing the effects of the interaction on the time evolution of correlation functions their spatial dependence and their nongaussianity as measured by the kurtosis | [['complete', 'information', 'on', 'the', 'equilibrium', 'behaviour', 'and', 'dynamics', 'of', 'a', 'quantum', 'field', 'theory', 'qft', 'is', 'provided', 'by', 'multipoint', 'correlation', 'functions', 'however', 'their', 'theoretical', 'calculation', 'is', 'a', 'challenging', 'problem', 'even', 'for', 'exactly', 'solvable', 'models', 'this', 'has', 'recently', 'become', 'an', 'experimentally', 'relevant', 'problem', 'due', 'to', 'progress', 'in', 'coldatom', 'experiments', 'simulating', 'qft', 'models', 'and', 'directly', 'measuring', 'higher', 'order', 'correlations', 'here', 'we', 'compute', 'correlation', 'functions', 'of', 'the', 'quantum', 'sinegordon', 'model', 'a', 'prototype', 'integrable', 'model', 'of', 'central', 'interest', 'from', 'both', 'theoretical', 'and', 'experimental', 'points', 'of', 'view', 'building', 'upon', 'the', 'socalled', 'truncated', 'conformal', 'space', 'approach', 'we', 'numerically', 'construct', 'higher', 'order', 'correlations', 'in', 'a', 'system', 'of', 'finite', 'size', 'in', 'various', 'physical', 'states', 'of', 'experimental', 'relevance', 'both', 'in', 'and', 'out', 'of', 'equilibrium', 'we', 'measure', 'deviations', 'from', 'gaussianity', 'due', 'to', 'the', 'presence', 'of', 'interaction', 'and', 'analyse', 'their', 'dependence', 'on', 'temperature', 'explaining', 'the', 'experimentally', 'observed', 'crossover', 'between', 'gaussian', 'and', 'nongaussian', 'regimes', 'we', 'find', 'that', 'correlations', 'of', 'excited', 'states', 'are', 'markedly', 'different', 'from', 'the', 'thermal', 'case', 'which', 'can', 'be', 'explained', 'by', 'the', 'integrability', 'of', 'the', 'system', 'we', 'also', 'study', 'dynamics', 'after', 'a', 'quench', 'observing', 'the', 'effects', 'of', 'the', 'interaction', 'on', 'the', 'time', 'evolution', 'of', 'correlation', 'functions', 'their', 'spatial', 'dependence', 'and', 'their', 'nongaussianity', 'as', 'measured', 'by', 'the', 'kurtosis']] | [-0.0995601436874012, 0.14313371006551742, -0.12733446357638709, 0.11686487893908931, 0.0016584553974395503, -0.12263029891455889, 0.019600218479706888, 0.3462045587960403, -0.25337773473097047, -0.2852191581789936, 0.08397232921204853, -0.29478362890207493, -0.15658688931060688, 0.18180551851519897, 0.046303170516953936, 0.09159375241172396, 0.012468751900347083, -0.006722207449623669, -0.10394236130392825, -0.22030809920100608, 0.331074830423803, 0.0672229825630689, 0.3013210612306447, 0.08821169668167107, 0.07624839752679691, 0.0023554512941069447, -0.012367767054642247, 0.04202803404932267, -0.12241925254817701, 0.07564235315242383, 0.21154283261514176, 0.07355210246525382, 0.24579023809067677, -0.432059020526251, -0.2291309680202881, 0.11381108789319856, 0.13895342855747522, 0.14448250812295424, -0.03380501294824561, -0.2991567592953845, 0.009031867760480667, -0.16705597161400912, -0.1313870705257892, -0.11591351368673602, 0.028341043344342474, -0.005761795031020836, -0.2365602306654553, 0.10631622228404977, 0.027559548497618158, 0.08012786455017296, -0.05980858954776801, -0.06049955671068699, -0.019135211156657422, 0.12237721195739067, 0.024352125943476827, 0.0005788393894790158, 0.12967101683631083, -0.15954185881038976, -0.1229836905724963, 0.36695399828616304, -0.07070824564897873, -0.19608589222925543, 0.18502679732937025, -0.19179205780573266, -0.11706245946222726, 0.08907836222812077, 0.16944263862892606, 0.1048284126297162, -0.13776203461837175, 0.09535881431033236, -0.011259585692623288, 0.1351006657757668, 0.02050460832863476, 0.06704006890281655, 0.23699203365938548, 0.13715186709839833, -7.558451984457823e-05, 0.16543059672789687, -0.07390601456768772, -0.16413919602007587, -0.2970854832211091, -0.08053561364661674, -0.2048889747654487, 0.045245484279098025, -0.09299051850431002, -0.13862403700180465, 0.431562270425089, 0.19798631984251966, 0.19919132296357075, 0.05483922671125156, 0.25075620495505174, 0.14382399181652414, 0.03494235463333506, 0.01823954603858102, 0.2470613242345577, 0.14894234744846174, 0.07957683093026185, -0.26048182956137866, 0.08186822905019876, 0.024846519623902077] |
1,802.08697 | Photochemistry, mixing and transport in Jupiter's stratosphere
constrained by Cassini | We aim at constraining the diffusive and advective transport processes in
Jupiter's stratosphere. The IR spectrum recorded by Cassini/CIRS during the
Jupiter flyby contains the fingerprints of several atmospheric compounds and
allows probing its atmospheric composition. C2H2 and C2H6, the main compounds
produced by methane photochemistry, were retrieved as a function of latitude at
certain pressure levels. CIRS observations suggest a different meridional
distribution for these two species, difficult to reconcile with their
photochemical histories, which are thought to be coupled to the methane
photolysis. While the C2H2 abundance decreases with latitude, C2H6 becomes more
abundant at high latitudes. A new 2D (latitude-altitude) seasonal photochemical
model is developed to study whether the addition of stratospheric transport
processes, such as meridional diffusion and advection, can explain the
latitudinal behavior of C2H2 and C2H6. C2H2 observations are fairly well
reproduced without meridional diffusion. Adding meridional diffusion to the
model provides an improved agreement with the C2H6 observations by flattening
its meridional distribution, but degrades the fit to the C2H2 distribution.
Meridional diffusion alone cannot produce the observed increase with latitude
of C2H6. When adding advective transport between 30 mbar and 0.01 mbar, with
upwelling winds at the equator and downwelling winds at high latitudes, we can
reproduce the C2H6 abundance increase with latitude. However, the fit to the
C2H2 distribution is degraded. The strength of the advective winds needed to
reproduce the C2H6 abundances is very sensitive to the value of the meridional
eddy diffusion coefficient. The coupled fate of C2H2 and C2H6 suggests that an
additional process is missing in the model. Ion-neutral chemistry was not
accounted for in this work and might be a good candidate to solve this issue.
| astro-ph.EP | we aim at constraining the diffusive and advective transport processes in jupiters stratosphere the ir spectrum recorded by cassinicirs during the jupiter flyby contains the fingerprints of several atmospheric compounds and allows probing its atmospheric composition c2h2 and c2h6 the main compounds produced by methane photochemistry were retrieved as a function of latitude at certain pressure levels cirs observations suggest a different meridional distribution for these two species difficult to reconcile with their photochemical histories which are thought to be coupled to the methane photolysis while the c2h2 abundance decreases with latitude c2h6 becomes more abundant at high latitudes a new 2d latitudealtitude seasonal photochemical model is developed to study whether the addition of stratospheric transport processes such as meridional diffusion and advection can explain the latitudinal behavior of c2h2 and c2h6 c2h2 observations are fairly well reproduced without meridional diffusion adding meridional diffusion to the model provides an improved agreement with the c2h6 observations by flattening its meridional distribution but degrades the fit to the c2h2 distribution meridional diffusion alone cannot produce the observed increase with latitude of c2h6 when adding advective transport between 30 mbar and 001 mbar with upwelling winds at the equator and downwelling winds at high latitudes we can reproduce the c2h6 abundance increase with latitude however the fit to the c2h2 distribution is degraded the strength of the advective winds needed to reproduce the c2h6 abundances is very sensitive to the value of the meridional eddy diffusion coefficient the coupled fate of c2h2 and c2h6 suggests that an additional process is missing in the model ionneutral chemistry was not accounted for in this work and might be a good candidate to solve this issue | [['we', 'aim', 'at', 'constraining', 'the', 'diffusive', 'and', 'advective', 'transport', 'processes', 'in', 'jupiters', 'stratosphere', 'the', 'ir', 'spectrum', 'recorded', 'by', 'cassinicirs', 'during', 'the', 'jupiter', 'flyby', 'contains', 'the', 'fingerprints', 'of', 'several', 'atmospheric', 'compounds', 'and', 'allows', 'probing', 'its', 'atmospheric', 'composition', 'c2h2', 'and', 'c2h6', 'the', 'main', 'compounds', 'produced', 'by', 'methane', 'photochemistry', 'were', 'retrieved', 'as', 'a', 'function', 'of', 'latitude', 'at', 'certain', 'pressure', 'levels', 'cirs', 'observations', 'suggest', 'a', 'different', 'meridional', 'distribution', 'for', 'these', 'two', 'species', 'difficult', 'to', 'reconcile', 'with', 'their', 'photochemical', 'histories', 'which', 'are', 'thought', 'to', 'be', 'coupled', 'to', 'the', 'methane', 'photolysis', 'while', 'the', 'c2h2', 'abundance', 'decreases', 'with', 'latitude', 'c2h6', 'becomes', 'more', 'abundant', 'at', 'high', 'latitudes', 'a', 'new', '2d', 'latitudealtitude', 'seasonal', 'photochemical', 'model', 'is', 'developed', 'to', 'study', 'whether', 'the', 'addition', 'of', 'stratospheric', 'transport', 'processes', 'such', 'as', 'meridional', 'diffusion', 'and', 'advection', 'can', 'explain', 'the', 'latitudinal', 'behavior', 'of', 'c2h2', 'and', 'c2h6', 'c2h2', 'observations', 'are', 'fairly', 'well', 'reproduced', 'without', 'meridional', 'diffusion', 'adding', 'meridional', 'diffusion', 'to', 'the', 'model', 'provides', 'an', 'improved', 'agreement', 'with', 'the', 'c2h6', 'observations', 'by', 'flattening', 'its', 'meridional', 'distribution', 'but', 'degrades', 'the', 'fit', 'to', 'the', 'c2h2', 'distribution', 'meridional', 'diffusion', 'alone', 'can', 'not', 'produce', 'the', 'observed', 'increase', 'with', 'latitude', 'of', 'c2h6', 'when', 'adding', 'advective', 'transport', 'between', '30', 'mbar', 'and', '001', 'mbar', 'with', 'upwelling', 'winds', 'at', 'the', 'equator', 'and', 'downwelling', 'winds', 'at', 'high', 'latitudes', 'we', 'can', 'reproduce', 'the', 'c2h6', 'abundance', 'increase', 'with', 'latitude', 'however', 'the', 'fit', 'to', 'the', 'c2h2', 'distribution', 'is', 'degraded', 'the', 'strength', 'of', 'the', 'advective', 'winds', 'needed', 'to', 'reproduce', 'the', 'c2h6', 'abundances', 'is', 'very', 'sensitive', 'to', 'the', 'value', 'of', 'the', 'meridional', 'eddy', 'diffusion', 'coefficient', 'the', 'coupled', 'fate', 'of', 'c2h2', 'and', 'c2h6', 'suggests', 'that', 'an', 'additional', 'process', 'is', 'missing', 'in', 'the', 'model', 'ionneutral', 'chemistry', 'was', 'not', 'accounted', 'for', 'in', 'this', 'work', 'and', 'might', 'be', 'a', 'good', 'candidate', 'to', 'solve', 'this', 'issue']] | [-0.057792990701688855, 0.19707329965136264, -0.013086588277467724, 0.08455005773683166, -0.029463782111374064, -0.10317999279691971, 0.008689320204679721, 0.3929327131515103, -0.26288523568073285, -0.3660039730636137, 0.06158853456540133, -0.2780556929872026, -0.07135272707242361, 0.15105476570398813, -0.07911375875035966, -0.014020408278780191, 0.054188260272660826, -0.11582733759423718, 0.0455093934215256, -0.2085110745268009, 0.19133244928172125, 0.16568579023338056, 0.16250745410299194, 0.07783541370382799, 0.03818601914182571, -0.17269870760709247, -0.04210890016152657, -0.0515015497670642, -0.15051603082613707, 0.0640741168837329, 0.25647033787265955, 0.05306647832704974, 0.11793472336971068, -0.4398002513019102, -0.3059373350551531, 0.04836954928385759, 0.1612178242927517, 0.05112424355258034, -0.022541471988422147, -0.17955980380814124, -0.005415618013233013, -0.13697518405429687, -0.17152054649029327, -0.03201449262310884, -0.008994177770208417, -0.006940033121125972, -0.32330977830071267, 0.14857464856301833, 0.005890888959194334, 0.17708215722481588, -0.11958370334323262, -0.18275629783747718, -0.17542258149644893, 0.10816291590921796, 0.09929608800562814, 0.029540830859748114, 0.20813572768654143, -0.12721422220586517, 0.016176855372863688, 0.42362098558140654, -0.1836979685856412, -0.0935827369668654, 0.2389026480926467, -0.21498823218197297, -0.122519855133474, 0.23233276039671702, 0.1393314312079123, 0.10314768867933058, -0.15423944151869884, -0.041020043661826225, -0.04043656617827115, 0.1673639907568161, 0.0930642111592793, -0.024386393736416982, 0.27171053590219735, 0.1295871414526898, 0.06493094573421071, 0.054194065039752916, -0.22213723411051822, -0.07995928079139308, -0.181851765407399, -0.13363329735917173, -0.0829953079502697, 0.0388856771717006, -0.10423801485818071, -0.10406700993688511, 0.3325957017692937, 0.16346602659427195, 0.21990390686634262, -0.003021527169455242, 0.32886744158209436, 0.09014106894776758, 0.06543289880937664, 0.12229909035876127, 0.2712910434081485, 0.16873207299920198, 0.17714693410837623, -0.2914542172952289, 0.20422853424346873, -0.0064651630170244195] |
1,802.08698 | Emergence and the Swampland Conjectures | The Ooguri-Vafa Swampland Conjectures claim that in any consistent theory of
quantum gravity, when venturing to large distances in scalar field space, a
tower of particles will become light at a rate that is exponential in the field
space distance. We provide a novel viewpoint on this claim: if we assume that a
tower of states becomes light near a particular point in field space, and we
further demand that loop corrections drive both gravity and the scalar to
strong coupling at a common energy scale, then the requirement that the
particles become light exponentially fast in the field-space distance in Planck
units follows automatically. Furthermore, the same assumption of a common
strong-coupling scale for scalar fields and gravitons implies that when a
scalar field evolves over a super-Planckian distance, the average particle mass
changes by an amount of order the cutoff energy. This supports earlier
suggestions that significantly super-Planckian excursions in field space cannot
be described within a single effective field theory. We comment on the
relationship of our results to the Weak Gravity Conjecture.
| hep-th | the oogurivafa swampland conjectures claim that in any consistent theory of quantum gravity when venturing to large distances in scalar field space a tower of particles will become light at a rate that is exponential in the field space distance we provide a novel viewpoint on this claim if we assume that a tower of states becomes light near a particular point in field space and we further demand that loop corrections drive both gravity and the scalar to strong coupling at a common energy scale then the requirement that the particles become light exponentially fast in the fieldspace distance in planck units follows automatically furthermore the same assumption of a common strongcoupling scale for scalar fields and gravitons implies that when a scalar field evolves over a superplanckian distance the average particle mass changes by an amount of order the cutoff energy this supports earlier suggestions that significantly superplanckian excursions in field space cannot be described within a single effective field theory we comment on the relationship of our results to the weak gravity conjecture | [['the', 'oogurivafa', 'swampland', 'conjectures', 'claim', 'that', 'in', 'any', 'consistent', 'theory', 'of', 'quantum', 'gravity', 'when', 'venturing', 'to', 'large', 'distances', 'in', 'scalar', 'field', 'space', 'a', 'tower', 'of', 'particles', 'will', 'become', 'light', 'at', 'a', 'rate', 'that', 'is', 'exponential', 'in', 'the', 'field', 'space', 'distance', 'we', 'provide', 'a', 'novel', 'viewpoint', 'on', 'this', 'claim', 'if', 'we', 'assume', 'that', 'a', 'tower', 'of', 'states', 'becomes', 'light', 'near', 'a', 'particular', 'point', 'in', 'field', 'space', 'and', 'we', 'further', 'demand', 'that', 'loop', 'corrections', 'drive', 'both', 'gravity', 'and', 'the', 'scalar', 'to', 'strong', 'coupling', 'at', 'a', 'common', 'energy', 'scale', 'then', 'the', 'requirement', 'that', 'the', 'particles', 'become', 'light', 'exponentially', 'fast', 'in', 'the', 'fieldspace', 'distance', 'in', 'planck', 'units', 'follows', 'automatically', 'furthermore', 'the', 'same', 'assumption', 'of', 'a', 'common', 'strongcoupling', 'scale', 'for', 'scalar', 'fields', 'and', 'gravitons', 'implies', 'that', 'when', 'a', 'scalar', 'field', 'evolves', 'over', 'a', 'superplanckian', 'distance', 'the', 'average', 'particle', 'mass', 'changes', 'by', 'an', 'amount', 'of', 'order', 'the', 'cutoff', 'energy', 'this', 'supports', 'earlier', 'suggestions', 'that', 'significantly', 'superplanckian', 'excursions', 'in', 'field', 'space', 'can', 'not', 'be', 'described', 'within', 'a', 'single', 'effective', 'field', 'theory', 'we', 'comment', 'on', 'the', 'relationship', 'of', 'our', 'results', 'to', 'the', 'weak', 'gravity', 'conjecture']] | [-0.16396960361708102, 0.22351329744667522, -0.13606480403019294, 0.117692194123342, -0.07605192089968987, -0.12699058932373247, 0.034735642848431135, 0.3270808544409814, -0.24495155762586385, -0.2850861054776752, 0.06288437199144818, -0.23809476214787254, -0.11555787178261553, 0.1749354518225185, -0.05315538334639185, -0.014941558083992893, 0.034853437844740154, 0.07258134747156215, -0.04449282445692283, -0.23814137176068573, 0.3564818600339994, 0.07483375830888896, 0.25384853470354934, 0.07140627763323527, 0.08513147607550951, 0.0004523845763066731, 0.027914053591436543, 0.06355500143395584, -0.10771147414559655, 0.09631551015536902, 0.16173234338330178, 0.09313018359559572, 0.26633092969403427, -0.4098097728683724, -0.24300921017088334, 0.12330645358579306, 0.15909429834137795, 0.13469587795510046, -0.07138093540281858, -0.2492376674061357, 0.06253551025638136, -0.13270757977171974, -0.17091809200533367, -0.028647091965148974, 0.039762408752783626, -0.05044513194832299, -0.2896414240427568, 0.038372997740924224, 0.013270057467506978, 0.014399950372812859, -0.05459361742145387, -0.04460871467987696, -0.004152956643631145, 0.05875103377591093, 0.11808563378971007, 0.10519890829731347, 0.14590808319185708, -0.16372129756504786, -0.07847204625259264, 0.33816162236876746, -0.1589867713786188, -0.16872867239944342, 0.15312084361731923, -0.16860810307967397, -0.13284271380385268, 0.11680894454357103, 0.1482598362132081, 0.0985946874976116, -0.09724596139743377, 0.1582104727237549, -0.0309467294469139, 0.19566611573116532, 0.0735819399110857, 0.067223284664527, 0.2797388139070343, 0.09153664257445789, 0.06618556396846297, 0.07691615747122126, -0.06087715172677138, -0.1099383208721792, -0.35840023959865847, -0.18006399405678197, -0.17648224076150923, 0.060523872125691915, -0.13475422286022373, -0.15996941154043975, 0.3564925129435914, 0.1741475409454545, 0.19143519371137613, 0.1008435366688412, 0.2605633433483341, 0.10364903006926285, 0.09528209876248055, 0.10857704268862318, 0.30013945035762707, 0.10285514242036826, 0.10310827004710096, -0.20018258054693372, -0.052623307724393865, 0.0381901177240925] |
1,802.08699 | Local effectivity in projective spaces | In this note we introduce a Waldschmidt decomposition of divisors which might
be viewed as a generalization of Zariski decomposition based on the effectivity
rather than the nefness of divisors. As an immediate application we prove a
recursive formula providing new effective lower bounds on Waldschmidt constants
of very general points in projective spaces. We use these bounds in order to
verify Demailly's conjecture in a number of new cases.
| math.AG math.AC | in this note we introduce a waldschmidt decomposition of divisors which might be viewed as a generalization of zariski decomposition based on the effectivity rather than the nefness of divisors as an immediate application we prove a recursive formula providing new effective lower bounds on waldschmidt constants of very general points in projective spaces we use these bounds in order to verify demaillys conjecture in a number of new cases | [['in', 'this', 'note', 'we', 'introduce', 'a', 'waldschmidt', 'decomposition', 'of', 'divisors', 'which', 'might', 'be', 'viewed', 'as', 'a', 'generalization', 'of', 'zariski', 'decomposition', 'based', 'on', 'the', 'effectivity', 'rather', 'than', 'the', 'nefness', 'of', 'divisors', 'as', 'an', 'immediate', 'application', 'we', 'prove', 'a', 'recursive', 'formula', 'providing', 'new', 'effective', 'lower', 'bounds', 'on', 'waldschmidt', 'constants', 'of', 'very', 'general', 'points', 'in', 'projective', 'spaces', 'we', 'use', 'these', 'bounds', 'in', 'order', 'to', 'verify', 'demaillys', 'conjecture', 'in', 'a', 'number', 'of', 'new', 'cases']] | [-0.1751466855839161, 0.020108872979887695, -0.13722334364429117, 0.12200548315387486, -0.10385282534573759, -0.09865701179119891, 0.08472075190262071, 0.28689757835652147, -0.2584683099695082, -0.2416335718573204, 0.12649143825817322, -0.19093429191769765, -0.1770386714887406, 0.2753333072577204, -0.1756485715375415, -0.002869990042277745, 0.014035719811051553, 0.058495752466842535, -0.11019216068089008, -0.29819298153410534, 0.3660585991772158, 0.0028129238103117263, 0.20796436379397554, 0.13806336325194155, 0.07753017318568059, 0.005092887207865715, 0.0059506583293633805, 0.0007754921898335201, -0.18934492687029497, 0.2138667547543134, 0.2835258418694139, 0.12078185663891158, 0.24965547706399646, -0.39932494099651067, -0.10306036037592484, 0.18215888506134173, 0.1695266231628401, 0.0770537828111888, -0.043514849238895946, -0.21161330662268613, 0.0804181876459292, -0.1590752173614289, -0.19663730224128811, -0.14240867138973304, -0.011795955424063972, 0.020079746123935496, -0.2732786580254989, -0.019527689875186688, 0.08757789021224847, 0.12235075057189014, -0.04709733289533428, -0.15687118870971192, 0.042605428151520235, 0.03618227485567331, 0.026426119254236775, -0.004049267260623829, 0.035256162897816724, -0.09891543261640307, -0.13241487548553518, 0.3612148882089449, -0.09588913782437365, -0.23700342173022884, 0.13465474357362836, -0.10640942323952914, -0.19338129266564336, 0.06085285855723279, 0.16486945364491215, 0.21987180417137486, -0.03132965531466263, 0.10587952598663312, -0.15012978749083622, 0.0723910013812461, 0.14812561266922525, 0.08394037345174833, 0.11236828329108123, 0.11963505896606616, 0.1275000396267777, 0.185354612912384, -0.0030124632575150045, -0.020551103183035074, -0.3621650474412101, -0.22784628653898836, -0.1632117669906555, 0.13816535627203327, -0.16002793131130083, -0.20712978418450803, 0.3702471467001098, 0.12870313771002526, 0.22785445455727832, 0.14274019987621744, 0.25547356234331214, 0.09164396468217352, 0.03621932792344264, 0.06075340355081218, 0.18857823433354498, 0.1894195292145014, -0.009029980689021094, -0.09001418829263587, 0.0393479194957763, 0.242222412170044] |
1,802.087 | The Sprague-Grundy function for some selective compound games | We analyze the Sprague-Grundy functions for a class of almost disjoint
selective compound games played on Nim heaps. Surprisingly, we find that these
functions behave chaotically for smaller Sprague-Grundy values of each
component game yet predictably when any one heap is sufficiently large.
| math.CO | we analyze the spraguegrundy functions for a class of almost disjoint selective compound games played on nim heaps surprisingly we find that these functions behave chaotically for smaller spraguegrundy values of each component game yet predictably when any one heap is sufficiently large | [['we', 'analyze', 'the', 'spraguegrundy', 'functions', 'for', 'a', 'class', 'of', 'almost', 'disjoint', 'selective', 'compound', 'games', 'played', 'on', 'nim', 'heaps', 'surprisingly', 'we', 'find', 'that', 'these', 'functions', 'behave', 'chaotically', 'for', 'smaller', 'spraguegrundy', 'values', 'of', 'each', 'component', 'game', 'yet', 'predictably', 'when', 'any', 'one', 'heap', 'is', 'sufficiently', 'large']] | [-0.1496872798929554, 0.22079790935331825, -0.12761618129822405, 0.13799573356816328, -0.06102848676748054, -0.26135802464992847, 0.0810563988160602, 0.4172704016226669, -0.2685882214803335, -0.2528011549350827, 0.03818506115660353, -0.27994957577090623, -0.1688223593370166, 0.1288867714100106, -0.07041882747394401, 0.0025438828218517133, 0.06235702029499767, 0.056317996710192324, 0.03718201433265105, -0.27848027828474375, 0.36346939803902495, -0.05238125135385713, 0.18992864391441608, -0.03166830834261207, 0.10965530531004418, 0.04442853507650799, 0.0751345364030364, 0.11112604916182368, -0.15186576155467138, 0.008097757433736048, 0.27395745106907776, 0.09020022945045385, 0.35336770405343104, -0.3866487869148164, -0.07566295585021117, 0.18269641562040115, 0.14579522449774993, 0.0955392062923936, -0.020154996723651366, -0.15482019217208373, 0.10163307850530674, -0.1888857754813724, -0.10841500852257013, -0.04861160242107025, 0.09760002111799496, 0.06143323119816392, -0.26277153035707035, -0.08707900291178809, 0.10589705810470637, 0.05909821829693609, -0.047763456476765664, -0.23457589019956285, 0.004699868117567412, 0.17617498123598674, 0.0013588503636636359, -0.03125272706410913, 0.11526259205975505, -0.14237194759554642, -0.12852199666938463, 0.34441110270834246, -0.03524082430183541, -0.18194905954391458, 0.13006557192826687, -0.1583865770212575, -0.18577688412610874, 0.09627475537532984, 0.09955543054397716, 0.18469501298657337, -0.05556422716370773, 0.011972740010986494, -0.18700748380966659, 0.21592054420778917, 0.16670238716137964, 0.07358708588926252, 0.18393884451929912, 0.0997089014096229, 0.14501411430970873, 0.2030119929289402, 0.02904085839318848, -0.20463003551717415, -0.25107220542985337, -0.1022628626547927, -0.15567366752860157, 0.0252635212571815, -0.14363911648302577, -0.2725971578512081, 0.3615964198225113, 0.07024539609677917, 0.1718538823255966, 0.15623417143644983, 0.22586653009057045, 0.09882797517402228, 0.1283733126853571, 0.10552004873102834, 0.14577011781376462, 0.06745374640233295, 0.0834443693504084, -0.12667118247901632, 0.16111682329413501, 0.07428061159674165] |
1,802.08701 | Machine learning based hyperspectral image analysis: A survey | Hyperspectral sensors enable the study of the chemical properties of scene
materials remotely for the purpose of identification, detection, and chemical
composition analysis of objects in the environment. Hence, hyperspectral images
captured from earth observing satellites and aircraft have been increasingly
important in agriculture, environmental monitoring, urban planning, mining, and
defense. Machine learning algorithms due to their outstanding predictive power
have become a key tool for modern hyperspectral image analysis. Therefore, a
solid understanding of machine learning techniques have become essential for
remote sensing researchers and practitioners. This paper reviews and compares
recent machine learning-based hyperspectral image analysis methods published in
literature. We organize the methods by the image analysis task and by the type
of machine learning algorithm, and present a two-way mapping between the image
analysis tasks and the types of machine learning algorithms that can be applied
to them. The paper is comprehensive in coverage of both hyperspectral image
analysis tasks and machine learning algorithms. The image analysis tasks
considered are land cover classification, target detection, unmixing, and
physical parameter estimation. The machine learning algorithms covered are
Gaussian models, linear regression, logistic regression, support vector
machines, Gaussian mixture model, latent linear models, sparse linear models,
Gaussian mixture models, ensemble learning, directed graphical models,
undirected graphical models, clustering, Gaussian processes, Dirichlet
processes, and deep learning. We also discuss the open challenges in the field
of hyperspectral image analysis and explore possible future directions.
| cs.CV eess.IV | hyperspectral sensors enable the study of the chemical properties of scene materials remotely for the purpose of identification detection and chemical composition analysis of objects in the environment hence hyperspectral images captured from earth observing satellites and aircraft have been increasingly important in agriculture environmental monitoring urban planning mining and defense machine learning algorithms due to their outstanding predictive power have become a key tool for modern hyperspectral image analysis therefore a solid understanding of machine learning techniques have become essential for remote sensing researchers and practitioners this paper reviews and compares recent machine learningbased hyperspectral image analysis methods published in literature we organize the methods by the image analysis task and by the type of machine learning algorithm and present a twoway mapping between the image analysis tasks and the types of machine learning algorithms that can be applied to them the paper is comprehensive in coverage of both hyperspectral image analysis tasks and machine learning algorithms the image analysis tasks considered are land cover classification target detection unmixing and physical parameter estimation the machine learning algorithms covered are gaussian models linear regression logistic regression support vector machines gaussian mixture model latent linear models sparse linear models gaussian mixture models ensemble learning directed graphical models undirected graphical models clustering gaussian processes dirichlet processes and deep learning we also discuss the open challenges in the field of hyperspectral image analysis and explore possible future directions | [['hyperspectral', 'sensors', 'enable', 'the', 'study', 'of', 'the', 'chemical', 'properties', 'of', 'scene', 'materials', 'remotely', 'for', 'the', 'purpose', 'of', 'identification', 'detection', 'and', 'chemical', 'composition', 'analysis', 'of', 'objects', 'in', 'the', 'environment', 'hence', 'hyperspectral', 'images', 'captured', 'from', 'earth', 'observing', 'satellites', 'and', 'aircraft', 'have', 'been', 'increasingly', 'important', 'in', 'agriculture', 'environmental', 'monitoring', 'urban', 'planning', 'mining', 'and', 'defense', 'machine', 'learning', 'algorithms', 'due', 'to', 'their', 'outstanding', 'predictive', 'power', 'have', 'become', 'a', 'key', 'tool', 'for', 'modern', 'hyperspectral', 'image', 'analysis', 'therefore', 'a', 'solid', 'understanding', 'of', 'machine', 'learning', 'techniques', 'have', 'become', 'essential', 'for', 'remote', 'sensing', 'researchers', 'and', 'practitioners', 'this', 'paper', 'reviews', 'and', 'compares', 'recent', 'machine', 'learningbased', 'hyperspectral', 'image', 'analysis', 'methods', 'published', 'in', 'literature', 'we', 'organize', 'the', 'methods', 'by', 'the', 'image', 'analysis', 'task', 'and', 'by', 'the', 'type', 'of', 'machine', 'learning', 'algorithm', 'and', 'present', 'a', 'twoway', 'mapping', 'between', 'the', 'image', 'analysis', 'tasks', 'and', 'the', 'types', 'of', 'machine', 'learning', 'algorithms', 'that', 'can', 'be', 'applied', 'to', 'them', 'the', 'paper', 'is', 'comprehensive', 'in', 'coverage', 'of', 'both', 'hyperspectral', 'image', 'analysis', 'tasks', 'and', 'machine', 'learning', 'algorithms', 'the', 'image', 'analysis', 'tasks', 'considered', 'are', 'land', 'cover', 'classification', 'target', 'detection', 'unmixing', 'and', 'physical', 'parameter', 'estimation', 'the', 'machine', 'learning', 'algorithms', 'covered', 'are', 'gaussian', 'models', 'linear', 'regression', 'logistic', 'regression', 'support', 'vector', 'machines', 'gaussian', 'mixture', 'model', 'latent', 'linear', 'models', 'sparse', 'linear', 'models', 'gaussian', 'mixture', 'models', 'ensemble', 'learning', 'directed', 'graphical', 'models', 'undirected', 'graphical', 'models', 'clustering', 'gaussian', 'processes', 'dirichlet', 'processes', 'and', 'deep', 'learning', 'we', 'also', 'discuss', 'the', 'open', 'challenges', 'in', 'the', 'field', 'of', 'hyperspectral', 'image', 'analysis', 'and', 'explore', 'possible', 'future', 'directions']] | [-0.008166141615823862, -0.005603776607622808, -0.10380881706331956, 0.07271138852600881, -0.10793149044459804, -0.2282499491395627, 0.01376659142923482, 0.46058441203959444, -0.28476700275898614, -0.3340344207658571, 0.14168166341241498, -0.26047590819999894, -0.18664780296781597, 0.19079068776992883, -0.13107527971188437, 0.17598708525220763, 0.14818929976565723, 0.002579279741311961, -0.021191376143759315, -0.27042854868390775, 0.2692530188630236, 0.040841065682941415, 0.36976921140275737, -0.026785408609368382, 0.08560898183049892, 0.02796566569781367, -0.1285363954947667, -0.04098710045565237, -0.07941147082369462, 0.20338519897529894, 0.43742268106505705, 0.2521874725511496, 0.3417327952135275, -0.37611905055001693, -0.31939805388262377, 0.15461627280914245, 0.1521555984330839, 0.06352869961212607, -0.04782588840759498, -0.3306759944542291, 0.01896358020975195, -0.13564494080009296, -0.00268768924783836, -0.1725863511892075, -0.010910834436443575, -0.0033866985790193716, -0.26006119232228464, 0.029494372943411284, 0.09253433194962588, 0.16332511180575857, -0.11491229346200348, -0.1639226780689143, 0.06687785377329651, 0.1504344112239778, 0.04096635923252758, 0.013524879391324964, 0.20278905624365237, -0.22544940931801782, -0.17248011579776698, 0.3601511416827982, -0.030687656384357748, -0.16806910509005824, 0.2366203935123346, 0.00770167546554845, -0.20728848764791769, 0.06555279960578426, 0.31670284368335566, 0.09181659156852898, -0.18557242547419478, 0.07201840382049533, -0.0062748465429436654, 0.1346325015129046, 0.020157007889901386, -0.04331727679571176, 0.2239568518355806, 0.2749011567496556, 0.0253299852763798, 0.1040572648669811, -0.16972475473959733, -0.05903279962676993, -0.16073851119677357, -0.12592991261168363, -0.18514262868804818, -0.07457798353218018, -0.11856057074916687, -0.15904581188917793, 0.37930308591891476, 0.2255790056958002, 0.1608786335834203, 0.02955437289907577, 0.40040701735526957, 0.007987656357866572, 0.07367836926578286, 0.08479160099324988, 0.14805270405486226, 0.11895059917686863, 0.1633552792957647, -0.14713088813277478, 0.07374363642116573, 0.015265597733966213] |
1,802.08702 | Quantum spin dynamics of individual neutral impurities coupled to a
Bose-Einstein condensate | We report on spin dynamics of individual, localized neutral impurities
immersed in a Bose-Einstein condensate. Single Cesium atoms are transported
into a cloud of Rubidium atoms, thermalize with the bath, and the ensuing
spin-exchange between localized impurities with quasi-spin $F_i=3$ and bath
atoms with $F_b=1$ is resolved. Comparing our data to numerical simulations of
spin dynamics we find that, for gas densities in the BEC regime, the dynamics
is dominated by the condensed fraction of the cloud. We spatially resolve the
density overlap of impurities and gas by the spin-population of impurities.
Finally we trace the coherence of impurities prepared in a coherent
superposition of internal states when coupled to a gas of different densities.
For our choice of states we show that, despite high bath densities and thus
fast thermalization rates, the impurity coherence is not affected by the bath,
realizing a regime of sympathetic cooling while maintaining internal state
coherence. Our work paves the way toward non-destructive probing of quantum
many-body systems via localized impurities.
| cond-mat.quant-gas physics.atom-ph quant-ph | we report on spin dynamics of individual localized neutral impurities immersed in a boseeinstein condensate single cesium atoms are transported into a cloud of rubidium atoms thermalize with the bath and the ensuing spinexchange between localized impurities with quasispin f_i3 and bath atoms with f_b1 is resolved comparing our data to numerical simulations of spin dynamics we find that for gas densities in the bec regime the dynamics is dominated by the condensed fraction of the cloud we spatially resolve the density overlap of impurities and gas by the spinpopulation of impurities finally we trace the coherence of impurities prepared in a coherent superposition of internal states when coupled to a gas of different densities for our choice of states we show that despite high bath densities and thus fast thermalization rates the impurity coherence is not affected by the bath realizing a regime of sympathetic cooling while maintaining internal state coherence our work paves the way toward nondestructive probing of quantum manybody systems via localized impurities | [['we', 'report', 'on', 'spin', 'dynamics', 'of', 'individual', 'localized', 'neutral', 'impurities', 'immersed', 'in', 'a', 'boseeinstein', 'condensate', 'single', 'cesium', 'atoms', 'are', 'transported', 'into', 'a', 'cloud', 'of', 'rubidium', 'atoms', 'thermalize', 'with', 'the', 'bath', 'and', 'the', 'ensuing', 'spinexchange', 'between', 'localized', 'impurities', 'with', 'quasispin', 'f_i3', 'and', 'bath', 'atoms', 'with', 'f_b1', 'is', 'resolved', 'comparing', 'our', 'data', 'to', 'numerical', 'simulations', 'of', 'spin', 'dynamics', 'we', 'find', 'that', 'for', 'gas', 'densities', 'in', 'the', 'bec', 'regime', 'the', 'dynamics', 'is', 'dominated', 'by', 'the', 'condensed', 'fraction', 'of', 'the', 'cloud', 'we', 'spatially', 'resolve', 'the', 'density', 'overlap', 'of', 'impurities', 'and', 'gas', 'by', 'the', 'spinpopulation', 'of', 'impurities', 'finally', 'we', 'trace', 'the', 'coherence', 'of', 'impurities', 'prepared', 'in', 'a', 'coherent', 'superposition', 'of', 'internal', 'states', 'when', 'coupled', 'to', 'a', 'gas', 'of', 'different', 'densities', 'for', 'our', 'choice', 'of', 'states', 'we', 'show', 'that', 'despite', 'high', 'bath', 'densities', 'and', 'thus', 'fast', 'thermalization', 'rates', 'the', 'impurity', 'coherence', 'is', 'not', 'affected', 'by', 'the', 'bath', 'realizing', 'a', 'regime', 'of', 'sympathetic', 'cooling', 'while', 'maintaining', 'internal', 'state', 'coherence', 'our', 'work', 'paves', 'the', 'way', 'toward', 'nondestructive', 'probing', 'of', 'quantum', 'manybody', 'systems', 'via', 'localized', 'impurities']] | [-0.14232620707234783, 0.297303185444774, -0.03734600477072085, 0.012523010880153358, 0.10296146178068256, -0.14307433001539974, 0.0817576631348221, 0.38407067323372845, -0.22097399702060025, -0.24837778270502675, -0.013867720974895385, -0.31301952121465143, 0.00046204243287309465, 0.13427429930313983, 0.060532146003041194, 0.004366215127688575, 0.05297097059090184, -0.05471788648044668, -0.06981214193672121, -0.22666916105172497, 0.31960340447903396, 0.065771538777563, 0.2777359892434654, 0.1006673831515104, 0.08674250416393134, -0.010029137966290385, 0.07316982343579721, -0.011966700918119714, -0.08424418341939643, 0.09988532702688195, 0.23055476277887102, -0.0009486203233386019, 0.23336062686383185, -0.5228045876418431, -0.23441077544948602, 0.057170036518160834, 0.19697177595005186, 0.21772391054111656, -0.09172644564413454, -0.3439254235400515, -0.06258883798377117, -0.14360098864922458, -0.1623502209002758, -0.11196598599956606, 0.015176908214049167, 0.018567539473465386, -0.23913498206838338, 0.15554729465911366, 0.05694901927883445, 0.05002556223610236, -0.07478983707007873, -0.03139152459334582, -0.017044609766004675, 0.06671850406862824, -0.0457670660717525, -0.004562066587428731, 0.24472594677739923, -0.1534496535286195, -0.0292313442599163, 0.35673013140436216, -0.12816762813564717, -0.1368146754344729, 0.235889973517238, -0.16546925080165895, -0.06124781266539302, 0.14773614934073334, 0.12452036547418459, 0.11294151254486383, -0.14050488305744135, 0.023373612564573265, -0.041427605331339594, 0.19048686636084444, 0.03787065403401313, 0.12452238933491823, 0.2887184361566745, 0.18342830844262772, 0.0524234152286796, 0.19488127690638943, -0.1229259712686089, -0.14954840436056033, -0.22130644261691135, -0.17820083993698851, -0.24197429864027772, 0.07196651147659208, -0.02515517599868072, -0.12038292805103204, 0.353684646582388, 0.14607346803370683, 0.18926524707811873, -0.0469361322241869, 0.27526738922005095, 0.10081294885870204, 0.019968353315671705, 0.06747157636367862, 0.2319154147709529, 0.20529525840784008, 0.0505115690631287, -0.3729043164857136, 0.010316644065889967, -0.0017429161185667996] |
1,802.08703 | Large data limit for a phase transition model with the p-Laplacian on
point clouds | The consistency of a nonlocal anisotropic Ginzburg-Landau type functional for
data classification and clustering is studied. The Ginzburg-Landau objective
functional combines a double well potential, that favours indicator valued
function, and the $p$-Laplacian, that enforces regularity. Under appropriate
scaling between the two terms minimisers exhibit a phase transition on the
order of $\epsilon=\epsilon_n$ where $n$ is the number of data points. We study
the large data asymptotics, i.e. as $n\to \infty$, in the regime where
$\epsilon_n\to 0$. The mathematical tool used to address this question is
$\Gamma$-convergence. In particular, it is proved that the discrete model
converges to a weighted anisotropic perimeter.
| math.AP | the consistency of a nonlocal anisotropic ginzburglandau type functional for data classification and clustering is studied the ginzburglandau objective functional combines a double well potential that favours indicator valued function and the plaplacian that enforces regularity under appropriate scaling between the two terms minimisers exhibit a phase transition on the order of epsilonepsilon_n where n is the number of data points we study the large data asymptotics ie as nto infty in the regime where epsilon_nto 0 the mathematical tool used to address this question is gammaconvergence in particular it is proved that the discrete model converges to a weighted anisotropic perimeter | [['the', 'consistency', 'of', 'a', 'nonlocal', 'anisotropic', 'ginzburglandau', 'type', 'functional', 'for', 'data', 'classification', 'and', 'clustering', 'is', 'studied', 'the', 'ginzburglandau', 'objective', 'functional', 'combines', 'a', 'double', 'well', 'potential', 'that', 'favours', 'indicator', 'valued', 'function', 'and', 'the', 'plaplacian', 'that', 'enforces', 'regularity', 'under', 'appropriate', 'scaling', 'between', 'the', 'two', 'terms', 'minimisers', 'exhibit', 'a', 'phase', 'transition', 'on', 'the', 'order', 'of', 'epsilonepsilon_n', 'where', 'n', 'is', 'the', 'number', 'of', 'data', 'points', 'we', 'study', 'the', 'large', 'data', 'asymptotics', 'ie', 'as', 'nto', 'infty', 'in', 'the', 'regime', 'where', 'epsilon_nto', '0', 'the', 'mathematical', 'tool', 'used', 'to', 'address', 'this', 'question', 'is', 'gammaconvergence', 'in', 'particular', 'it', 'is', 'proved', 'that', 'the', 'discrete', 'model', 'converges', 'to', 'a', 'weighted', 'anisotropic', 'perimeter']] | [-0.1322472487751505, 0.05628362517933001, -0.10350354888135253, 0.1360957355890884, -0.07086775754347886, -0.12980097138534974, 0.042678537990639705, 0.30157960360261177, -0.2862879560319799, -0.25345839744452203, 0.08779562091095244, -0.31668284592578316, -0.16445868745639847, 0.11675947246897855, -0.04172410943088961, 0.09001285784721079, 0.00737678302949903, 0.05929502830517912, -0.03247370343369496, -0.18913715306927661, 0.34807581679738764, -0.034553197645905, 0.3248742722841625, 0.04317455690257288, 0.0678899486498483, 0.019916248032915414, 0.03482730844804999, 0.043339223029221045, -0.18920747272658456, 0.06804586938434824, 0.2646795307541967, 0.04945820076321943, 0.3188635384350425, -0.37289477427407064, -0.21435388595345292, 0.14579218750275524, 0.14774904215689932, 0.019099788422152254, -0.0010054794354548695, -0.25062153154485173, 0.08409043462338424, -0.08951485299016579, -0.17232645347732867, -0.09428713820404419, 0.010543814039613941, 0.07115567215294162, -0.35382989239832846, 0.11240644584234694, 0.06927064933357668, 0.04048698189861999, -0.09357761931006271, -0.06937380406157215, -0.023921443022658476, 0.08329586551460151, 0.07003233953273053, 0.0739532885842468, 0.057237058107990145, -0.11161000731327378, -0.05343438848267577, 0.364811962332097, -0.09118511752423711, -0.2161004875445425, 0.15260990098635158, -0.1098959004681668, -0.1475503891983097, 0.06850826143665184, 0.12387348951121774, 0.1393363400924914, -0.13968578462908504, 0.17178235371657047, -0.04094300626565029, 0.13515525475365692, 0.04638305834798825, 0.011039413714615426, 0.08730192203535744, 0.2183379631577115, 0.10092101424084146, 0.14588960026054285, -0.08903321262223111, -0.12428793981025862, -0.34339061040099306, -0.13313723772321598, -0.24052883017033633, 0.07134620298511617, -0.14436031904245616, -0.21621778357478946, 0.3477047544046499, 0.11181434704968245, 0.20556004516927912, 0.09590719778570209, 0.20595150935638806, 0.15670814223951743, 0.011911538041122995, 0.04739162411153464, 0.17379310896786132, 0.1405974354913071, 0.10141952025547328, -0.21459154831706592, 0.05387348096499607, 0.11607511789713165] |
1,802.08704 | Jordan derivations on semirings of triangular matrices | We explore Jordan derivations of triangular matrices with entries from an
additively idempotent semiring. The main result states that for any matrix A
over additively idempotent semiring, if we put all the elements of the family
of dense submatrices of A to be zeroes, we find a derivative of A. The set of
derivations of this type is established.
| math.RA | we explore jordan derivations of triangular matrices with entries from an additively idempotent semiring the main result states that for any matrix a over additively idempotent semiring if we put all the elements of the family of dense submatrices of a to be zeroes we find a derivative of a the set of derivations of this type is established | [['we', 'explore', 'jordan', 'derivations', 'of', 'triangular', 'matrices', 'with', 'entries', 'from', 'an', 'additively', 'idempotent', 'semiring', 'the', 'main', 'result', 'states', 'that', 'for', 'any', 'matrix', 'a', 'over', 'additively', 'idempotent', 'semiring', 'if', 'we', 'put', 'all', 'the', 'elements', 'of', 'the', 'family', 'of', 'dense', 'submatrices', 'of', 'a', 'to', 'be', 'zeroes', 'we', 'find', 'a', 'derivative', 'of', 'a', 'the', 'set', 'of', 'derivations', 'of', 'this', 'type', 'is', 'established']] | [-0.15326475558834055, 0.0735731669881685, -0.04555333780432594, 0.0003682723963412188, -0.05112555994794278, -0.06586134730506751, 0.06395021666599027, 0.34534290054086914, -0.366873711473861, -0.11833219658741254, 0.11085352729374574, -0.2993624771992534, -0.1616385327809948, 0.12825971462969052, -0.07788525461771731, -0.027241805955073087, 0.0667679303846622, 0.10102758316670434, -0.14598808581625128, -0.2616246434212741, 0.39054233871274074, -0.0293020260346643, 0.1343509562597689, 0.008216797453114542, 0.11007825804527029, -0.01168836384885392, -0.03181925785364741, 0.016402065169887018, -0.07066361597895532, 0.12608016072673786, 0.3053928344052727, 0.14977661869094028, 0.24426514323863943, -0.4108833747963279, -0.09684375755615153, 0.2190059246258589, 0.10111458305964026, 0.02483747991086063, -0.029256381157596233, -0.24114331555694846, 0.1252978011507983, -0.2531547853565317, -0.12622727478175597, -0.06876792080337339, 0.08411716194665533, 0.018232204035808473, -0.3644130489773164, -0.021759844637649545, 0.135092488333427, 0.08469026619410616, -0.048048006575870314, -0.1978709074131892, 0.01819840852186968, 0.07440211468423574, -0.0518173543475884, -0.05808745240950483, 0.06576799920176045, -0.02924111396689915, -0.09998327825155298, 0.3464338308450829, -0.037341878007529146, -0.21888184286969697, 0.08964229353024798, -0.18235506541963856, -0.10305685613904211, 0.1048098412610655, 0.08705720494864351, 0.1180065365792331, -0.11071400227561845, 0.17935899624569437, -0.23027285731444924, 0.13907393293802517, 0.06751570018734467, 0.03793395488420343, 0.18067165358402468, 0.07455794256717219, 0.104684761220242, 0.14834211716010093, 0.04241332525418977, -0.02879756402571575, -0.35272406300498266, -0.19284859474874655, -0.1954277111473888, 0.08762066792381012, -0.11397838569246233, -0.25172717004256734, 0.4734752365719464, 0.12251652693533796, 0.1974852097741628, 0.09807966196499134, 0.2163233661834719, 0.10727820365311838, 0.10073415175774846, 0.0768205906517046, 0.11418375690167738, 0.24950469288406735, -0.029225614624318934, -0.12136218319962716, 0.02015867616223582, 0.1882996216290078] |
1,802.08705 | PDDLStream: Integrating Symbolic Planners and Blackbox Samplers via
Optimistic Adaptive Planning | Many planning applications involve complex relationships defined on
high-dimensional, continuous variables. For example, robotic manipulation
requires planning with kinematic, collision, visibility, and motion constraints
involving robot configurations, object poses, and robot trajectories. These
constraints typically require specialized procedures to sample satisfying
values. We extend PDDL to support a generic, declarative specification for
these procedures that treats their implementation as black boxes. We provide
domain-independent algorithms that reduce PDDLStream problems to a sequence of
finite PDDL problems. We also introduce an algorithm that dynamically balances
exploring new candidate plans and exploiting existing ones. This enables the
algorithm to greedily search the space of parameter bindings to more quickly
solve tightly-constrained problems as well as locally optimize to produce
low-cost solutions. We evaluate our algorithms on three simulated robotic
planning domains as well as several real-world robotic tasks.
| cs.AI cs.RO | many planning applications involve complex relationships defined on highdimensional continuous variables for example robotic manipulation requires planning with kinematic collision visibility and motion constraints involving robot configurations object poses and robot trajectories these constraints typically require specialized procedures to sample satisfying values we extend pddl to support a generic declarative specification for these procedures that treats their implementation as black boxes we provide domainindependent algorithms that reduce pddlstream problems to a sequence of finite pddl problems we also introduce an algorithm that dynamically balances exploring new candidate plans and exploiting existing ones this enables the algorithm to greedily search the space of parameter bindings to more quickly solve tightlyconstrained problems as well as locally optimize to produce lowcost solutions we evaluate our algorithms on three simulated robotic planning domains as well as several realworld robotic tasks | [['many', 'planning', 'applications', 'involve', 'complex', 'relationships', 'defined', 'on', 'highdimensional', 'continuous', 'variables', 'for', 'example', 'robotic', 'manipulation', 'requires', 'planning', 'with', 'kinematic', 'collision', 'visibility', 'and', 'motion', 'constraints', 'involving', 'robot', 'configurations', 'object', 'poses', 'and', 'robot', 'trajectories', 'these', 'constraints', 'typically', 'require', 'specialized', 'procedures', 'to', 'sample', 'satisfying', 'values', 'we', 'extend', 'pddl', 'to', 'support', 'a', 'generic', 'declarative', 'specification', 'for', 'these', 'procedures', 'that', 'treats', 'their', 'implementation', 'as', 'black', 'boxes', 'we', 'provide', 'domainindependent', 'algorithms', 'that', 'reduce', 'pddlstream', 'problems', 'to', 'a', 'sequence', 'of', 'finite', 'pddl', 'problems', 'we', 'also', 'introduce', 'an', 'algorithm', 'that', 'dynamically', 'balances', 'exploring', 'new', 'candidate', 'plans', 'and', 'exploiting', 'existing', 'ones', 'this', 'enables', 'the', 'algorithm', 'to', 'greedily', 'search', 'the', 'space', 'of', 'parameter', 'bindings', 'to', 'more', 'quickly', 'solve', 'tightlyconstrained', 'problems', 'as', 'well', 'as', 'locally', 'optimize', 'to', 'produce', 'lowcost', 'solutions', 'we', 'evaluate', 'our', 'algorithms', 'on', 'three', 'simulated', 'robotic', 'planning', 'domains', 'as', 'well', 'as', 'several', 'realworld', 'robotic', 'tasks']] | [-0.08926675684180939, 0.016738098760726173, -0.05463439265300554, 0.08490875467175135, -0.21593290190039963, -0.18331280143034678, 0.04441160957794636, 0.46076545507681593, -0.2639495842779676, -0.3943965025280637, 0.12113035519917806, -0.19862832676757264, -0.1583718692538915, 0.27914104901978537, -0.12313499240963548, 0.1540662589242587, 0.1339466764902075, -0.02979638424887391, -0.048335766493929205, -0.24925302402806226, 0.26437434941806176, -0.02979925307272761, 0.2206150394829887, -0.02240620424315609, 0.1564023134867764, 0.059872010698610985, -0.006794040805349747, 0.033186371365553455, -0.09657591676282377, 0.12956841189621224, 0.3554770507470325, 0.2690183772429548, 0.29728144342424695, -0.4451330299796946, -0.194156804577344, 0.11250953299372836, 0.1523341787116671, 0.08524266884110317, -0.01716743181642852, -0.32158900775636234, 0.04994438075357013, -0.15875831513613875, -0.08700959615719815, -0.1908204443304351, -0.001435897875301264, 0.03437463700495384, -0.310456601826957, -0.038781134687855635, 0.021534821523905352, 0.031619242787430134, -0.08656272765559454, -0.10462179701016457, 0.05158919026833717, 0.1639216978240896, 0.016109580030078414, 0.017877379635831823, 0.18332680315986552, -0.1376536256525368, -0.22436655287337662, 0.4087043432449853, 0.06614986865056885, -0.2580715331386913, 0.2548666291628723, -0.003188359516638297, -0.18942091785785226, 0.08143609808412967, 0.2572929489607405, 0.196119936797078, -0.16894976200742853, 0.05128879704279825, -0.0017758167124594802, 0.13908607741748846, 0.04222303301923805, 0.007978688394305882, 0.1865944409398017, 0.2223759970455258, 0.14501203804199272, 0.16126196748680538, -0.027978532454343858, -0.1312453378405836, -0.2625221261849489, -0.11772592672733245, -0.12378161661154419, -0.06920028904547777, -0.10101441328071006, -0.18093514863177443, 0.3037157840112707, 0.2124812538486569, 0.19172147331000478, 0.11531772138001138, 0.351364897357093, 0.02636950423475355, 0.07990334847709164, 0.07257611608753602, 0.13543950874634364, 1.5926585291270856e-05, 0.13255556595546228, -0.18670072454993647, 0.06287085767512003, 0.04707738916579358] |
1,802.08706 | Higher Jones Algebras and their simple Modules | Let $G$ be a connected reductive algebraic group over a field of positive
characteristic $p$ and denote by $\mathcal T$ the category of tilting modules
for $G$. The higher Jones algebras are the endomorphism algebras of objects in
the fusion quotient category of $\mathcal T$. We determine the simple modules
and their dimensions for these semisimple algebras as well as their quantized
analogues. This provides a general approach for determining various classes of
simple modules for many well-studied algebras such as group algebras for
symmetric groups, Brauer algebras, Temperley--Lieb algebras, Hecke algebras and
$BMW$-algebras. We treat each of these cases in some detail and give several
examples.
| math.RT | let g be a connected reductive algebraic group over a field of positive characteristic p and denote by mathcal t the category of tilting modules for g the higher jones algebras are the endomorphism algebras of objects in the fusion quotient category of mathcal t we determine the simple modules and their dimensions for these semisimple algebras as well as their quantized analogues this provides a general approach for determining various classes of simple modules for many wellstudied algebras such as group algebras for symmetric groups brauer algebras temperleylieb algebras hecke algebras and bmwalgebras we treat each of these cases in some detail and give several examples | [['let', 'g', 'be', 'a', 'connected', 'reductive', 'algebraic', 'group', 'over', 'a', 'field', 'of', 'positive', 'characteristic', 'p', 'and', 'denote', 'by', 'mathcal', 't', 'the', 'category', 'of', 'tilting', 'modules', 'for', 'g', 'the', 'higher', 'jones', 'algebras', 'are', 'the', 'endomorphism', 'algebras', 'of', 'objects', 'in', 'the', 'fusion', 'quotient', 'category', 'of', 'mathcal', 't', 'we', 'determine', 'the', 'simple', 'modules', 'and', 'their', 'dimensions', 'for', 'these', 'semisimple', 'algebras', 'as', 'well', 'as', 'their', 'quantized', 'analogues', 'this', 'provides', 'a', 'general', 'approach', 'for', 'determining', 'various', 'classes', 'of', 'simple', 'modules', 'for', 'many', 'wellstudied', 'algebras', 'such', 'as', 'group', 'algebras', 'for', 'symmetric', 'groups', 'brauer', 'algebras', 'temperleylieb', 'algebras', 'hecke', 'algebras', 'and', 'bmwalgebras', 'we', 'treat', 'each', 'of', 'these', 'cases', 'in', 'some', 'detail', 'and', 'give', 'several', 'examples']] | [-0.182561655365203, 0.06792113389644139, -0.03384858947950152, 0.07040029785152138, -0.12410324575590356, -0.1858638873156863, -0.08816726839626735, 0.37416790933172517, -0.411218275373169, -0.2084422681726656, 0.11023982278431572, -0.19725569600309684, -0.1334434886691424, 0.22236148608883596, -0.17543410605153525, -0.11569643611053251, 0.04709091117379188, 0.1841093421702818, -0.11770547109102514, -0.29367989876289974, 0.4433762050005344, -0.04104461468193891, 0.1952796817036732, -0.007680993287753806, 0.08417480264105043, 0.04847848465235658, -0.0053215536930299595, 0.013426534079337457, -0.15656866220854013, 0.09795386671035919, 0.40721255499113984, 0.035189770495975915, 0.20972901234570188, -0.33309123306623045, -0.08763460716548956, 0.230110807001661, 0.19866458893498792, -0.005919000281038571, -0.03022221320326317, -0.2778107597633212, 0.09157296858358917, -0.2787845587129441, -0.10033563071563137, -0.09399716350478383, 0.15775786682563606, 0.00607384194813247, -0.2504340825945069, -0.02005151791919796, 0.06189374498394757, 0.1977030794259231, -0.12527703437383092, -0.1532700505779775, -0.09307955584009969, 0.11721579812221089, -0.14112255348217725, -0.040234300221167155, 0.15037604598855636, -0.10942952566613215, -0.2129528044266099, 0.36735729860440597, 0.02213702663638682, -0.19033768086008868, 0.15010311884172964, -0.19163232652101456, -0.18643693809116366, 0.06487671310907968, 0.03939389725619892, 0.1879473851273223, -0.006236011513842727, 0.20392975666041854, -0.1607400683668565, -0.10618562507552956, 0.08108247936492399, 0.020661475012223852, 0.1520406566077035, 0.09192356935104812, 0.0024663890796529026, 0.13986038412121213, 0.0992961855657961, 0.07406444999143341, -0.38378317664676115, -0.1967916394592667, -0.024614988158474554, 0.11389181730864605, -0.14134429023932787, -0.17891041824005474, 0.45041638141155316, 0.11729821322907535, 0.17467908467218843, 0.1814486328336709, 0.1559226356868474, 0.032557579465781535, 0.16247045722315615, 0.03035264567733975, 0.0501205558849626, 0.37034759396590505, -0.06938362655225473, -0.10409385498331965, -0.07119320228889163, 0.2324298278402256] |
1,802.08707 | On Degenerations of Lie Superalgebras | We give necessary conditions for the existence of degenerations between two
complex Lie superalgebras of dimension $(m,n)$. As an application, we study the
variety $\mathcal{LS}^{(2,2)}$ of complex Lie superalgebras of dimension
$(2,2)$. First we give the algebraic classification and then obtain that
$\mathcal{LS}^{(2,2)}$ is the union of seven irreducible components, three of
which are the Zariski closures of rigid Lie superalgebras. As byproduct, we
obtain an example of a nilpotent rigid Lie superalgebra, in contrast to the
classical case where no example is known.
| math.RA | we give necessary conditions for the existence of degenerations between two complex lie superalgebras of dimension mn as an application we study the variety mathcalls22 of complex lie superalgebras of dimension 22 first we give the algebraic classification and then obtain that mathcalls22 is the union of seven irreducible components three of which are the zariski closures of rigid lie superalgebras as byproduct we obtain an example of a nilpotent rigid lie superalgebra in contrast to the classical case where no example is known | [['we', 'give', 'necessary', 'conditions', 'for', 'the', 'existence', 'of', 'degenerations', 'between', 'two', 'complex', 'lie', 'superalgebras', 'of', 'dimension', 'mn', 'as', 'an', 'application', 'we', 'study', 'the', 'variety', 'mathcalls22', 'of', 'complex', 'lie', 'superalgebras', 'of', 'dimension', '22', 'first', 'we', 'give', 'the', 'algebraic', 'classification', 'and', 'then', 'obtain', 'that', 'mathcalls22', 'is', 'the', 'union', 'of', 'seven', 'irreducible', 'components', 'three', 'of', 'which', 'are', 'the', 'zariski', 'closures', 'of', 'rigid', 'lie', 'superalgebras', 'as', 'byproduct', 'we', 'obtain', 'an', 'example', 'of', 'a', 'nilpotent', 'rigid', 'lie', 'superalgebra', 'in', 'contrast', 'to', 'the', 'classical', 'case', 'where', 'no', 'example', 'is', 'known']] | [-0.1890775892860824, 0.02026284994627065, -0.01926207242578995, 0.05099685974248753, -0.1447134697156754, -0.133040248290011, -0.055497492802692804, 0.35414321040280344, -0.2710776099957889, -0.23469309126049642, 0.1562496110024612, -0.20548961634134374, -0.19569060014469958, 0.21261344737623158, -0.10632872484942399, -0.09755605607429838, 0.015932461485357548, 0.15808610852932695, -0.12137773824662607, -0.30042901364859287, 0.42929130258243076, -0.07708053424579614, 0.1912063019486462, 0.01085842186130765, 0.12530382883894006, 0.005220112396495008, 0.048241313285671356, -0.05413476813857148, -0.14052930864175034, 0.11536017446437986, 0.33611971053590134, 0.07853615686592715, 0.1402565741502657, -0.38010986744448905, -0.08255783401475084, 0.19848888027964431, 0.18828803585365234, 0.06762978179442765, -0.021960783976970648, -0.224395143137904, 0.07279428364936172, -0.19431470728070452, -0.20065887300751922, -0.09860000286887331, 0.07173596475296086, -0.02632709601950809, -0.20804228551299653, 0.03806916488016524, 0.1272306518697339, 0.17455593074058615, -0.15202599754216287, -0.12469313761716987, -0.05818820956004102, 0.11773816240871916, -0.05488474672183213, -0.030973684443047315, 0.0978669214400281, -0.06890014603325142, -0.1820584134846108, 0.3906682295293161, 0.020048150077189613, -0.23143092588317105, 0.21844749806289812, -0.1505445465048003, -0.20092489347202566, 0.0962332954982341, 0.10058943884129204, 0.15701421318439449, -0.09067405947688513, 0.16227927363247657, -0.13198323597813524, -0.0074921554953950205, 0.090572187978002, -0.003357821792966073, 0.10513073055175837, 0.17121126740125986, 0.08821073714734223, 0.13924440950518702, -0.013428897528750141, 0.0009287864242385073, -0.417277245078145, -0.20854344607966885, -0.07988385900817198, 0.15204262388188663, -0.13749025935834563, -0.17530779012410744, 0.41694043894729965, 0.0875863510023564, 0.22626162131839408, 0.11104134051271192, 0.20564405515608264, 0.05860459355058194, 0.05375519489710469, 0.057691455489342534, 0.17279241189769493, 0.2725970802896815, -0.07137495847191752, -0.11283818203899101, -0.1074490555811946, 0.18099450723448393] |
1,802.08708 | Probing the network structure of health deficits in human aging | We confront a network model of human aging and mortality in which nodes
represent health attributes that interact within a scale-free network topology,
with observational data that uses both clinical and laboratory (pre-clinical)
health deficits as network nodes. We find that individual health attributes
exhibit a wide range of mutual information with mortality and that, with a re-
construction of their relative connectivity, higher-ranked nodes are more
informative. Surprisingly, we find a broad and overlapping range of mutual
information of laboratory measures as compared with clinical measures. We
confirm similar behavior between most-connected and least-connected model
nodes, controlled by the nearest-neighbor connectivity. Furthermore, in both
model and observational data, we find that the least-connected (laboratory)
nodes damage earlier than the most-connected (clinical) deficits. A mean-field
theory of our network model captures and explains this phenomenon, which
results from the connectivity of nodes and of their connected neighbors. We
find that other network topologies, including random, small-world, and
assortative scale-free net- works, exhibit qualitatively different behavior.
Our disassortative scale-free network model behaves consistently with our
expanded phenomenology observed in human aging, and so is a useful tool to
explore mechanisms of and to develop new predictive measures for human aging
and mortality.
| q-bio.PE physics.soc-ph | we confront a network model of human aging and mortality in which nodes represent health attributes that interact within a scalefree network topology with observational data that uses both clinical and laboratory preclinical health deficits as network nodes we find that individual health attributes exhibit a wide range of mutual information with mortality and that with a re construction of their relative connectivity higherranked nodes are more informative surprisingly we find a broad and overlapping range of mutual information of laboratory measures as compared with clinical measures we confirm similar behavior between mostconnected and leastconnected model nodes controlled by the nearestneighbor connectivity furthermore in both model and observational data we find that the leastconnected laboratory nodes damage earlier than the mostconnected clinical deficits a meanfield theory of our network model captures and explains this phenomenon which results from the connectivity of nodes and of their connected neighbors we find that other network topologies including random smallworld and assortative scalefree net works exhibit qualitatively different behavior our disassortative scalefree network model behaves consistently with our expanded phenomenology observed in human aging and so is a useful tool to explore mechanisms of and to develop new predictive measures for human aging and mortality | [['we', 'confront', 'a', 'network', 'model', 'of', 'human', 'aging', 'and', 'mortality', 'in', 'which', 'nodes', 'represent', 'health', 'attributes', 'that', 'interact', 'within', 'a', 'scalefree', 'network', 'topology', 'with', 'observational', 'data', 'that', 'uses', 'both', 'clinical', 'and', 'laboratory', 'preclinical', 'health', 'deficits', 'as', 'network', 'nodes', 'we', 'find', 'that', 'individual', 'health', 'attributes', 'exhibit', 'a', 'wide', 'range', 'of', 'mutual', 'information', 'with', 'mortality', 'and', 'that', 'with', 'a', 're', 'construction', 'of', 'their', 'relative', 'connectivity', 'higherranked', 'nodes', 'are', 'more', 'informative', 'surprisingly', 'we', 'find', 'a', 'broad', 'and', 'overlapping', 'range', 'of', 'mutual', 'information', 'of', 'laboratory', 'measures', 'as', 'compared', 'with', 'clinical', 'measures', 'we', 'confirm', 'similar', 'behavior', 'between', 'mostconnected', 'and', 'leastconnected', 'model', 'nodes', 'controlled', 'by', 'the', 'nearestneighbor', 'connectivity', 'furthermore', 'in', 'both', 'model', 'and', 'observational', 'data', 'we', 'find', 'that', 'the', 'leastconnected', 'laboratory', 'nodes', 'damage', 'earlier', 'than', 'the', 'mostconnected', 'clinical', 'deficits', 'a', 'meanfield', 'theory', 'of', 'our', 'network', 'model', 'captures', 'and', 'explains', 'this', 'phenomenon', 'which', 'results', 'from', 'the', 'connectivity', 'of', 'nodes', 'and', 'of', 'their', 'connected', 'neighbors', 'we', 'find', 'that', 'other', 'network', 'topologies', 'including', 'random', 'smallworld', 'and', 'assortative', 'scalefree', 'net', 'works', 'exhibit', 'qualitatively', 'different', 'behavior', 'our', 'disassortative', 'scalefree', 'network', 'model', 'behaves', 'consistently', 'with', 'our', 'expanded', 'phenomenology', 'observed', 'in', 'human', 'aging', 'and', 'so', 'is', 'a', 'useful', 'tool', 'to', 'explore', 'mechanisms', 'of', 'and', 'to', 'develop', 'new', 'predictive', 'measures', 'for', 'human', 'aging', 'and', 'mortality']] | [-0.09626067864803588, 0.10577887812610809, -0.07687476204142939, 0.11339538805742762, -0.06509308755601668, -0.18963026361069665, 0.09201422841253398, 0.4180721957421866, -0.21655983260290615, -0.32409664803179933, 0.018908017218609303, -0.31636983498384186, -0.25199235082877364, 0.14086307402102471, -0.08090226467240101, 0.0019948546964656654, 0.08515821129954722, 0.06078600821214721, 0.02659640455269834, -0.22675575549999225, 0.28123611016477, 0.053681704784895236, 0.3187418591876315, 0.04312256346769464, 0.06682243131550576, -0.023333938435572594, -0.014158812960822931, 0.06699450607921242, -0.11355742461745111, 0.13348269117625422, 0.2958525687975077, 0.17125859914176092, 0.2821067903487392, -0.43221290115804517, -0.2808393365111311, 0.12030921625297758, 0.10392449134312089, 0.07842194992673597, -0.0007153997770122563, -0.3228087214919836, 0.06991156811167981, -0.21875617098739714, -0.07971689599422525, -0.09898622323809868, -0.005679390462699221, 0.05172887179524602, -0.28863169796838983, 0.11354019208139374, 0.0036033413633058398, 0.12133071800017386, -0.0631085219874107, -0.09116557268750164, -0.07158081650627378, 0.191719632190351, 0.0669030215346778, 0.005996651952710948, 0.15766870895335774, -0.15373394565902354, -0.14529887543741002, 0.32867229552661525, 0.01118251178910277, -0.13030219897510548, 0.22867845299749853, -0.13506666217369967, -0.14562281384248638, 0.0486255509220527, 0.22183196477485423, 0.037049879982548564, -0.16840297621280992, -0.03771004727601412, -0.03412590391322303, 0.1510515824488517, -0.0076463040281828515, 0.0483918144448069, 0.1547138829905521, 0.23075670707943058, 0.03281838741079343, 0.10340714953470262, -0.07470711033828371, -0.11928923583047381, -0.20763848971260424, -0.07599466403529849, -0.14884881684510268, 0.009845390649447542, -0.1774921581494872, -0.1783629958587351, 0.4165309646922113, 0.2013766374856011, 0.22086913374007044, 0.12823101948826246, 0.23313301834115638, -0.014219679037428726, 0.09648953499480971, 0.08514384126327747, 0.17752340931333288, 0.05798149641848804, 0.11637466247494689, -0.19091846002960827, 0.17805936200711042, -0.04421603793321196] |
1,802.08709 | Ionization Electron Signal Processing in Single Phase LArTPCs I.
Algorithm Description and Quantitative Evaluation with MicroBooNE Simulation | We describe the concept and procedure of drifted-charge extraction developed
in the MicroBooNE experiment, a single-phase liquid argon time projection
chamber (LArTPC). This technique converts the raw digitized TPC waveform to the
number of ionization electrons passing through a wire plane at a given time. A
robust recovery of the number of ionization electrons from both induction and
collection anode wire planes will augment the 3D reconstruction, and is
particularly important for tomographic reconstruction algorithms. A number of
building blocks of the overall procedure are described. The performance of the
signal processing is quantitatively evaluated by comparing extracted charge
with the true charge through a detailed TPC detector simulation taking into
account position-dependent induced current inside a single wire region and
across multiple wires. Some areas for further improvement of the performance of
the charge extraction procedure are also discussed.
| physics.ins-det hep-ex nucl-ex | we describe the concept and procedure of driftedcharge extraction developed in the microboone experiment a singlephase liquid argon time projection chamber lartpc this technique converts the raw digitized tpc waveform to the number of ionization electrons passing through a wire plane at a given time a robust recovery of the number of ionization electrons from both induction and collection anode wire planes will augment the 3d reconstruction and is particularly important for tomographic reconstruction algorithms a number of building blocks of the overall procedure are described the performance of the signal processing is quantitatively evaluated by comparing extracted charge with the true charge through a detailed tpc detector simulation taking into account positiondependent induced current inside a single wire region and across multiple wires some areas for further improvement of the performance of the charge extraction procedure are also discussed | [['we', 'describe', 'the', 'concept', 'and', 'procedure', 'of', 'driftedcharge', 'extraction', 'developed', 'in', 'the', 'microboone', 'experiment', 'a', 'singlephase', 'liquid', 'argon', 'time', 'projection', 'chamber', 'lartpc', 'this', 'technique', 'converts', 'the', 'raw', 'digitized', 'tpc', 'waveform', 'to', 'the', 'number', 'of', 'ionization', 'electrons', 'passing', 'through', 'a', 'wire', 'plane', 'at', 'a', 'given', 'time', 'a', 'robust', 'recovery', 'of', 'the', 'number', 'of', 'ionization', 'electrons', 'from', 'both', 'induction', 'and', 'collection', 'anode', 'wire', 'planes', 'will', 'augment', 'the', '3d', 'reconstruction', 'and', 'is', 'particularly', 'important', 'for', 'tomographic', 'reconstruction', 'algorithms', 'a', 'number', 'of', 'building', 'blocks', 'of', 'the', 'overall', 'procedure', 'are', 'described', 'the', 'performance', 'of', 'the', 'signal', 'processing', 'is', 'quantitatively', 'evaluated', 'by', 'comparing', 'extracted', 'charge', 'with', 'the', 'true', 'charge', 'through', 'a', 'detailed', 'tpc', 'detector', 'simulation', 'taking', 'into', 'account', 'positiondependent', 'induced', 'current', 'inside', 'a', 'single', 'wire', 'region', 'and', 'across', 'multiple', 'wires', 'some', 'areas', 'for', 'further', 'improvement', 'of', 'the', 'performance', 'of', 'the', 'charge', 'extraction', 'procedure', 'are', 'also', 'discussed']] | [-0.087392161776171, 0.10806118398435789, -0.05090214566347732, 0.0018674103960247457, 0.007024108482484552, -0.14136676035030818, 0.02965782044569312, 0.37543419461777744, -0.24629362832031232, -0.3372397052137543, 0.052757960173850815, -0.29137583478628626, -0.043064329826788934, 0.23868466174839695, -0.013127385948746123, 0.0751709035780321, 0.08621462703206771, -0.02023580250926584, -0.1275011291492918, -0.21040532721889962, 0.19864321299058071, 0.11513788008848004, 0.3424270860582804, 0.03920922863210062, 0.14322626495251445, 0.03964095973248909, -0.0861722258683428, 0.037253225900621405, -0.07318283133661013, 0.0599134819801535, 0.2917147569304748, 0.11390593568894931, 0.1998473635318575, -0.48069766151765697, -0.18369104659600224, 0.04665106166951465, 0.142154193851802, 0.11176215900148419, -0.1234814780613528, -0.30509747720906416, 0.06282134757715566, -0.16127809623537734, -0.08389721035943937, -0.01853321015704155, -0.04432258476911903, 0.01399117644533696, -0.24471317840699883, 0.03082105912843538, 0.04716725560347382, 0.005811202450380694, -0.031345532253960806, -0.10080250262838902, 0.018724967883028788, 0.12740021523945838, -0.015858030100788574, 0.0497901614875995, 0.23783004289097656, -0.1062978654078094, -0.06171865447377451, 0.33520025089919137, -0.021360481412505076, -0.19511801233262213, 0.12499435964918179, -0.15044485770036942, -0.03501444839178953, 0.22218967966815764, 0.17828744929953874, 0.0712521755364355, -0.171173260558946, 0.033588553105513216, -0.002204129834183686, 0.151646004731787, 0.08112533859784628, 0.0013184189736146293, 0.23325073001102256, 0.26630998530472033, 0.05187496815292205, 0.14956361858556114, -0.19698901554710305, -0.024234245544661293, -0.3279273940368368, -0.20617116203451222, -0.1924178262581218, -0.033242192477818656, -0.06130904363252209, -0.15451907176229593, 0.45010522613636883, 0.1365220018280603, 0.1734152471499263, -0.028520598669457685, 0.37716343245140727, 0.04851378135302727, 0.05478490440496545, -0.00243962936022942, 0.18590288095573204, 0.1307517465676362, 0.1283454566778575, -0.2491387550370674, 0.05689276419345477, 0.08577685921935352] |
1,802.0871 | Extending \textit{ab initio} plasma-surface simulations to
experimentally relevant scales | The physical processes at the interface of a low-temperature plasma and a
solid are extremely complex. They involve a huge number of elementary processes
in the plasma, in the solid as well as charge, momentum and energy transfer
across the interface. In the majority of plasma simulations these surface
processes are either neglected or treated via phenomenological parameters.
However, those parameters are known only in some cases, so such an approach is
very inaccurate and does not have predictive capability. Therefore,
improvements are highly needed. In this paper we briefly summarize relevant
theoretical methods from solid state and surface physics that are able to
contribute to an improved simulation of plasma-surface interaction in the near
future. Full \textit{ab initio} quantum simulations are feasible only for
extremely short times and/or small system sizes. A substantial simplification
is achieved when electronic quantum effects are not treated explicitly. Then
one arrives at semi-classical molecular dynamics (MD) simulations for the heavy
particles that have become the main workhorse in surface science simulations.
Using microscopically founded potentials and force fields as an input, these MD
simulations approach the quality of \textit{ab initio} simulations, in many
cases. However, despite their simplified nature, these simulations require a
time step that is of the order or below one femtosecond making it prohibitive
to reach experimentally relevant scales of minutes. To bridge this gap in
length and time scales without compromising the first principles character of
the simulations, many physical and computational strategies have been put
forward in surface science. This paper presents a brief overview on different
methods and their underlying physical ideas, and we compare their strengths and
weaknesses.
| physics.plasm-ph physics.comp-ph | the physical processes at the interface of a lowtemperature plasma and a solid are extremely complex they involve a huge number of elementary processes in the plasma in the solid as well as charge momentum and energy transfer across the interface in the majority of plasma simulations these surface processes are either neglected or treated via phenomenological parameters however those parameters are known only in some cases so such an approach is very inaccurate and does not have predictive capability therefore improvements are highly needed in this paper we briefly summarize relevant theoretical methods from solid state and surface physics that are able to contribute to an improved simulation of plasmasurface interaction in the near future full textitab initio quantum simulations are feasible only for extremely short times andor small system sizes a substantial simplification is achieved when electronic quantum effects are not treated explicitly then one arrives at semiclassical molecular dynamics md simulations for the heavy particles that have become the main workhorse in surface science simulations using microscopically founded potentials and force fields as an input these md simulations approach the quality of textitab initio simulations in many cases however despite their simplified nature these simulations require a time step that is of the order or below one femtosecond making it prohibitive to reach experimentally relevant scales of minutes to bridge this gap in length and time scales without compromising the first principles character of the simulations many physical and computational strategies have been put forward in surface science this paper presents a brief overview on different methods and their underlying physical ideas and we compare their strengths and weaknesses | [['the', 'physical', 'processes', 'at', 'the', 'interface', 'of', 'a', 'lowtemperature', 'plasma', 'and', 'a', 'solid', 'are', 'extremely', 'complex', 'they', 'involve', 'a', 'huge', 'number', 'of', 'elementary', 'processes', 'in', 'the', 'plasma', 'in', 'the', 'solid', 'as', 'well', 'as', 'charge', 'momentum', 'and', 'energy', 'transfer', 'across', 'the', 'interface', 'in', 'the', 'majority', 'of', 'plasma', 'simulations', 'these', 'surface', 'processes', 'are', 'either', 'neglected', 'or', 'treated', 'via', 'phenomenological', 'parameters', 'however', 'those', 'parameters', 'are', 'known', 'only', 'in', 'some', 'cases', 'so', 'such', 'an', 'approach', 'is', 'very', 'inaccurate', 'and', 'does', 'not', 'have', 'predictive', 'capability', 'therefore', 'improvements', 'are', 'highly', 'needed', 'in', 'this', 'paper', 'we', 'briefly', 'summarize', 'relevant', 'theoretical', 'methods', 'from', 'solid', 'state', 'and', 'surface', 'physics', 'that', 'are', 'able', 'to', 'contribute', 'to', 'an', 'improved', 'simulation', 'of', 'plasmasurface', 'interaction', 'in', 'the', 'near', 'future', 'full', 'textitab', 'initio', 'quantum', 'simulations', 'are', 'feasible', 'only', 'for', 'extremely', 'short', 'times', 'andor', 'small', 'system', 'sizes', 'a', 'substantial', 'simplification', 'is', 'achieved', 'when', 'electronic', 'quantum', 'effects', 'are', 'not', 'treated', 'explicitly', 'then', 'one', 'arrives', 'at', 'semiclassical', 'molecular', 'dynamics', 'md', 'simulations', 'for', 'the', 'heavy', 'particles', 'that', 'have', 'become', 'the', 'main', 'workhorse', 'in', 'surface', 'science', 'simulations', 'using', 'microscopically', 'founded', 'potentials', 'and', 'force', 'fields', 'as', 'an', 'input', 'these', 'md', 'simulations', 'approach', 'the', 'quality', 'of', 'textitab', 'initio', 'simulations', 'in', 'many', 'cases', 'however', 'despite', 'their', 'simplified', 'nature', 'these', 'simulations', 'require', 'a', 'time', 'step', 'that', 'is', 'of', 'the', 'order', 'or', 'below', 'one', 'femtosecond', 'making', 'it', 'prohibitive', 'to', 'reach', 'experimentally', 'relevant', 'scales', 'of', 'minutes', 'to', 'bridge', 'this', 'gap', 'in', 'length', 'and', 'time', 'scales', 'without', 'compromising', 'the', 'first', 'principles', 'character', 'of', 'the', 'simulations', 'many', 'physical', 'and', 'computational', 'strategies', 'have', 'been', 'put', 'forward', 'in', 'surface', 'science', 'this', 'paper', 'presents', 'a', 'brief', 'overview', 'on', 'different', 'methods', 'and', 'their', 'underlying', 'physical', 'ideas', 'and', 'we', 'compare', 'their', 'strengths', 'and', 'weaknesses']] | [-0.08574552465699312, 0.14318456805946933, -0.08061574977781515, 0.07913512826095992, -0.04923639100846177, -0.11690828111365109, 0.03409495189150809, 0.41576486026786047, -0.2631667181027724, -0.3355407676409574, 0.09221537179350622, -0.2594246225917767, -0.12675525099214557, 0.2283917411490727, -0.0003540518775801448, 0.07527212551619467, 0.07941430592729697, -0.01938717296562733, -0.06221983502131051, -0.217344268640291, 0.2605627961388296, 0.09560975142641623, 0.23823438365498611, 0.08383716516254935, 0.06337048316216919, -0.03504714254685335, -0.02349006766812903, 0.02349698736756021, -0.13027678370751936, 0.08180135711368433, 0.27927280033477203, 0.06220500794862507, 0.2782867346523905, -0.5418086521574023, -0.24827470762230566, 0.04039336264309788, 0.15476380531318307, 0.15619180472533437, -0.056982164073013014, -0.21205268556471257, 0.05525916972756557, -0.1552678539763506, -0.11711927806776229, -0.1146713612260475, 0.015191475189674427, 0.033176811933277775, -0.21169915693719624, 0.06091100065249494, 0.01687873452080085, 0.061830762793440096, -0.0380710371370215, -0.14721715515470885, -0.001988733311437125, 0.1413581231588657, 0.04084544108627597, 0.020223751244296127, 0.16310348152696594, -0.15642571154560703, -0.09635898477576763, 0.406509404310354, -0.010177534834142802, -0.19010502300422077, 0.265983891178193, -0.11999523246434846, -0.13913835640757016, 0.15560931582106552, 0.16512972017255165, 0.11936897649481099, -0.1528786217487483, 0.07512991051044082, 0.023563266090658383, 0.1630316170870655, 0.02435424573281232, 0.05811957588165944, 0.22451289650908782, 0.18990326375334168, -0.018498647457711154, 0.055567308007191646, -0.07428682594507015, -0.1335488111294313, -0.2896481765543713, -0.130266009213408, -0.19884431982234888, 0.03321100628786285, -0.036537027657900845, -0.13948617875918418, 0.36144336452836046, 0.20069517136503504, 0.15929965127725154, 0.0009951831922508597, 0.32446567229678347, 0.0703067245781045, 0.04180970899709363, 0.057330005232121464, 0.2569105336875937, 0.09787727939178961, 0.09933089341810795, -0.20053104799744154, 0.08226284874656224, -0.0028518211825832944] |
1,802.08711 | Dirac ocillator in the cosmic string spacetime in the context of
gravity's rainbow | In this paper we consider the Dirac oscillator in the context of Doubly
General Relativity or Gravity's Rainbow. In order to obtain the energy levels
of the Dirac oscillator, we solve the Dirac equation in the cosmic string
spacetime modified by gravity's rainbow scenarios described by two rainbow
functions. We then obtain that, as a consequence of the modification of the
cosmic string line element by the two rainbow functions, the energy levels of
the Dirac oscillator are appreciable altered. The results are plotted and
compared with the standard case, without gravity's rainbow effects.
| gr-qc hep-th quant-ph | in this paper we consider the dirac oscillator in the context of doubly general relativity or gravitys rainbow in order to obtain the energy levels of the dirac oscillator we solve the dirac equation in the cosmic string spacetime modified by gravitys rainbow scenarios described by two rainbow functions we then obtain that as a consequence of the modification of the cosmic string line element by the two rainbow functions the energy levels of the dirac oscillator are appreciable altered the results are plotted and compared with the standard case without gravitys rainbow effects | [['in', 'this', 'paper', 'we', 'consider', 'the', 'dirac', 'oscillator', 'in', 'the', 'context', 'of', 'doubly', 'general', 'relativity', 'or', 'gravitys', 'rainbow', 'in', 'order', 'to', 'obtain', 'the', 'energy', 'levels', 'of', 'the', 'dirac', 'oscillator', 'we', 'solve', 'the', 'dirac', 'equation', 'in', 'the', 'cosmic', 'string', 'spacetime', 'modified', 'by', 'gravitys', 'rainbow', 'scenarios', 'described', 'by', 'two', 'rainbow', 'functions', 'we', 'then', 'obtain', 'that', 'as', 'a', 'consequence', 'of', 'the', 'modification', 'of', 'the', 'cosmic', 'string', 'line', 'element', 'by', 'the', 'two', 'rainbow', 'functions', 'the', 'energy', 'levels', 'of', 'the', 'dirac', 'oscillator', 'are', 'appreciable', 'altered', 'the', 'results', 'are', 'plotted', 'and', 'compared', 'with', 'the', 'standard', 'case', 'without', 'gravitys', 'rainbow', 'effects']] | [-0.1716827310701, 0.17675645906537613, -0.04091451274468861, 0.15337865407692586, -0.06610741817015917, -0.1170446403829896, 0.009897714472088487, 0.32565874837715414, -0.19095894772599034, -0.3291265936271149, -0.01997506702715095, -0.3065009096617553, -0.15494023587188108, 0.0921490065372014, -0.03804903879682434, 0.028721022910061986, 0.05777972645344252, 0.06828421932902742, -0.05629648808934825, -0.23554257914285234, 0.4111713100462518, 0.08904453838600758, 0.21669713575194807, 0.053002877165860635, 0.07177750963440284, 0.004237724686081105, -0.005674392708200723, 0.09763797143712005, -0.18519678106817894, 0.05044749382625711, 0.21079333823055346, 0.07794376678685559, 0.18903301065748043, -0.4626801043768671, -0.26708952923047735, 0.0940107629000348, 0.11335276266401435, 0.13767558983229894, -0.06472682730453287, -0.25518447957051166, 0.05150992488934401, -0.1765831332713207, -0.16060908353253406, 0.020847364308986257, -0.043373466994454886, 0.011496956757408507, -0.18189429608669053, 0.0699313363317955, 0.03531214764757835, -0.06293144121647198, -0.0281797093636495, -0.08139053032674054, -0.03257464794838365, 0.026905046000660574, 0.07448288453420862, -0.005134469775007444, 0.06041045054456497, -0.09750816826163693, -0.1257097676366647, 0.4560863614439013, -0.13114432279798302, -0.23920049129965457, 0.05207821576202169, -0.16890073449479692, -0.09993346922218482, 0.04622009071580907, 0.11346598938008413, 0.14084587448296396, -0.17309172269690068, 0.1729976204490974, 0.014038583055693419, 0.09362550634157626, 0.19094022614088782, 0.06425225685481874, 0.23104419402698886, 0.08728447589191034, 0.031208759906919712, 0.15775856858446322, -0.03377414366448338, -0.07360047965429406, -0.3487369363453794, -0.12530346285363542, -0.1682252448963675, 0.056242538021599994, -0.15069852731214772, -0.1804689967241931, 0.4127959913197667, 0.09159491355828148, 0.14283341841098476, -0.004067263744295912, 0.25807678819376423, 0.1716039704166333, 0.015535866592123986, 0.07006125593993892, 0.29964276481954816, 0.15609353894437167, 0.08768035720122304, -0.27923937761621115, -0.08738438050421153, 0.1191101086306128] |
1,802.08712 | Discrete geometry and isotropic surfaces | We consider smooth isotropic immersions from the 2-dimensional torus into
$R^{2n}$, for $n \geq 2$. When $n = 2$ the image of such map is an immersed
Lagrangian torus of $R^4$. We prove that such isotropic immersions can be
approximated by arbitrarily $C^0$-close piecewise linear isotropic maps. If $n
\geq 3$ the piecewise linear isotropic maps can be chosen so that they are
piecewise linear isotropic immersions as well. The proofs are obtained using
analogies with an infinite dimensional moment map geometry due to Donaldson. As
a byproduct of these considerations, we introduce a numerical flow in finite
dimension, whose limit provide, from an experimental perspective, many examples
of piecewise linear Lagrangian tori in $R^4$. The DMMF program, which is freely
available, is based on the Euler method and shows the evolution equation of
discrete surfaces in real time, as a movie.
| math.DG math.SG | we consider smooth isotropic immersions from the 2dimensional torus into r2n for n geq 2 when n 2 the image of such map is an immersed lagrangian torus of r4 we prove that such isotropic immersions can be approximated by arbitrarily c0close piecewise linear isotropic maps if n geq 3 the piecewise linear isotropic maps can be chosen so that they are piecewise linear isotropic immersions as well the proofs are obtained using analogies with an infinite dimensional moment map geometry due to donaldson as a byproduct of these considerations we introduce a numerical flow in finite dimension whose limit provide from an experimental perspective many examples of piecewise linear lagrangian tori in r4 the dmmf program which is freely available is based on the euler method and shows the evolution equation of discrete surfaces in real time as a movie | [['we', 'consider', 'smooth', 'isotropic', 'immersions', 'from', 'the', '2dimensional', 'torus', 'into', 'r2n', 'for', 'n', 'geq', '2', 'when', 'n', '2', 'the', 'image', 'of', 'such', 'map', 'is', 'an', 'immersed', 'lagrangian', 'torus', 'of', 'r4', 'we', 'prove', 'that', 'such', 'isotropic', 'immersions', 'can', 'be', 'approximated', 'by', 'arbitrarily', 'c0close', 'piecewise', 'linear', 'isotropic', 'maps', 'if', 'n', 'geq', '3', 'the', 'piecewise', 'linear', 'isotropic', 'maps', 'can', 'be', 'chosen', 'so', 'that', 'they', 'are', 'piecewise', 'linear', 'isotropic', 'immersions', 'as', 'well', 'the', 'proofs', 'are', 'obtained', 'using', 'analogies', 'with', 'an', 'infinite', 'dimensional', 'moment', 'map', 'geometry', 'due', 'to', 'donaldson', 'as', 'a', 'byproduct', 'of', 'these', 'considerations', 'we', 'introduce', 'a', 'numerical', 'flow', 'in', 'finite', 'dimension', 'whose', 'limit', 'provide', 'from', 'an', 'experimental', 'perspective', 'many', 'examples', 'of', 'piecewise', 'linear', 'lagrangian', 'tori', 'in', 'r4', 'the', 'dmmf', 'program', 'which', 'is', 'freely', 'available', 'is', 'based', 'on', 'the', 'euler', 'method', 'and', 'shows', 'the', 'evolution', 'equation', 'of', 'discrete', 'surfaces', 'in', 'real', 'time', 'as', 'a', 'movie']] | [-0.12708896036950007, 0.11733851696179565, -0.06465589071490935, 0.05692562874589514, -0.05721314513191048, -0.1744202654110268, -0.0836955545008615, 0.3868285628833941, -0.31729086226384556, -0.23056364367449922, 0.14029661128214294, -0.2833323453137252, -0.16173862030430297, 0.21665848870761692, -0.05683768547314685, 0.06236206314060837, 0.012273871193506888, 0.025032019074881517, -0.10078796036624615, -0.26263104192413655, 0.34618153321290657, -0.045033014000260406, 0.16641258524863847, 0.02597524469518768, 0.14948849336776351, -0.02125451369543693, -0.0037366057080881936, 0.06691123191267252, -0.16280710450425562, 0.09044016314936536, 0.2790448011115326, 0.0655021087129301, 0.1806838519239266, -0.426201967589025, -0.23820927262838398, 0.14629870389721222, 0.14747450569245432, 0.064496696228993, -0.02133412880440509, -0.27144833938218654, 0.04855054686610986, -0.10692747534319226, -0.18449834070135174, -0.11019190940340715, 0.030669611153591958, 0.054465746783119225, -0.24263262595050036, 0.02872692675196699, 0.14574194323753806, 0.10697531974209207, -0.07636143201296883, -0.07711758757276195, -0.07146327179424199, 0.10235325343029607, 0.0006405965533174043, 0.09605982840460325, 0.08785916035579118, -0.06682393991239743, -0.07827596364908719, 0.405273716121779, -0.13464524873998016, -0.3210892192487206, 0.13746611564004393, -0.11305637413835419, -0.1173430197206991, 0.15190944230915712, 0.18132552416729075, 0.15277759047624256, -0.06672633222988225, 0.20919500258377022, -0.12405923714894536, 0.15954989058497762, 0.0733939385906394, -0.07470599189068057, 0.1504805462501411, 0.09617240243824199, 0.11635371305871689, 0.1535105962871707, -0.02677881912178626, -0.07486832733598671, -0.3707964046459113, -0.15584833447355778, -0.18755171066648993, 0.1699317868599402, -0.16096781227793794, -0.18577509984773186, 0.2994796947742413, -0.002346309642390614, 0.23982612111472656, 0.13088268479373905, 0.2690874392302898, 0.09643785299517081, -0.005627558277254658, 0.13184174680417138, 0.16127642386792493, 0.11893681373746534, -0.0071295982126944836, -0.09573255615209096, -0.05066274792355086, 0.16979840601062668] |
1,802.08713 | Integrating human and machine intelligence in galaxy morphology
classification tasks | Quantifying galaxy morphology is a challenging yet scientifically rewarding
task. As the scale of data continues to increase with upcoming surveys,
traditional classification methods will struggle to handle the load. We present
a solution through an integration of visual and automated classifications,
preserving the best features of both human and machine. We demonstrate the
effectiveness of such a system through a re-analysis of visual galaxy
morphology classifications collected during the Galaxy Zoo 2 (GZ2) project. We
reprocess the top level question of the GZ2 decision tree with a Bayesian
classification aggregation algorithm dubbed SWAP, originally developed for the
Space Warps gravitational lens project. Through a simple binary classification
scheme we increase the classification rate nearly 5-fold, classifying 226,124
galaxies in 92 days of GZ2 project time while reproducing labels derived from
GZ2 classification data with 95.7% accuracy.
We next combine this with a Random Forest machine learning algorithm that
learns on a suite of nonparametric morphology indicators widely used for
automated morphologies. We develop a decision engine that delegates tasks
between human and machine, and demonstrate that the combined system provides at
least a factor of 8 increase in the classification rate, classifying 210,803
galaxies in just 32 days of GZ2 project time with 93.1% accuracy. As the Random
Forest algorithm requires a minimal amount of computation cost, this result has
important implications for galaxy morphology identification tasks in the era of
Euclid and other large scale surveys.
| astro-ph.IM astro-ph.GA | quantifying galaxy morphology is a challenging yet scientifically rewarding task as the scale of data continues to increase with upcoming surveys traditional classification methods will struggle to handle the load we present a solution through an integration of visual and automated classifications preserving the best features of both human and machine we demonstrate the effectiveness of such a system through a reanalysis of visual galaxy morphology classifications collected during the galaxy zoo 2 gz2 project we reprocess the top level question of the gz2 decision tree with a bayesian classification aggregation algorithm dubbed swap originally developed for the space warps gravitational lens project through a simple binary classification scheme we increase the classification rate nearly 5fold classifying 226124 galaxies in 92 days of gz2 project time while reproducing labels derived from gz2 classification data with 957 accuracy we next combine this with a random forest machine learning algorithm that learns on a suite of nonparametric morphology indicators widely used for automated morphologies we develop a decision engine that delegates tasks between human and machine and demonstrate that the combined system provides at least a factor of 8 increase in the classification rate classifying 210803 galaxies in just 32 days of gz2 project time with 931 accuracy as the random forest algorithm requires a minimal amount of computation cost this result has important implications for galaxy morphology identification tasks in the era of euclid and other large scale surveys | [['quantifying', 'galaxy', 'morphology', 'is', 'a', 'challenging', 'yet', 'scientifically', 'rewarding', 'task', 'as', 'the', 'scale', 'of', 'data', 'continues', 'to', 'increase', 'with', 'upcoming', 'surveys', 'traditional', 'classification', 'methods', 'will', 'struggle', 'to', 'handle', 'the', 'load', 'we', 'present', 'a', 'solution', 'through', 'an', 'integration', 'of', 'visual', 'and', 'automated', 'classifications', 'preserving', 'the', 'best', 'features', 'of', 'both', 'human', 'and', 'machine', 'we', 'demonstrate', 'the', 'effectiveness', 'of', 'such', 'a', 'system', 'through', 'a', 'reanalysis', 'of', 'visual', 'galaxy', 'morphology', 'classifications', 'collected', 'during', 'the', 'galaxy', 'zoo', '2', 'gz2', 'project', 'we', 'reprocess', 'the', 'top', 'level', 'question', 'of', 'the', 'gz2', 'decision', 'tree', 'with', 'a', 'bayesian', 'classification', 'aggregation', 'algorithm', 'dubbed', 'swap', 'originally', 'developed', 'for', 'the', 'space', 'warps', 'gravitational', 'lens', 'project', 'through', 'a', 'simple', 'binary', 'classification', 'scheme', 'we', 'increase', 'the', 'classification', 'rate', 'nearly', '5fold', 'classifying', '226124', 'galaxies', 'in', '92', 'days', 'of', 'gz2', 'project', 'time', 'while', 'reproducing', 'labels', 'derived', 'from', 'gz2', 'classification', 'data', 'with', '957', 'accuracy', 'we', 'next', 'combine', 'this', 'with', 'a', 'random', 'forest', 'machine', 'learning', 'algorithm', 'that', 'learns', 'on', 'a', 'suite', 'of', 'nonparametric', 'morphology', 'indicators', 'widely', 'used', 'for', 'automated', 'morphologies', 'we', 'develop', 'a', 'decision', 'engine', 'that', 'delegates', 'tasks', 'between', 'human', 'and', 'machine', 'and', 'demonstrate', 'that', 'the', 'combined', 'system', 'provides', 'at', 'least', 'a', 'factor', 'of', '8', 'increase', 'in', 'the', 'classification', 'rate', 'classifying', '210803', 'galaxies', 'in', 'just', '32', 'days', 'of', 'gz2', 'project', 'time', 'with', '931', 'accuracy', 'as', 'the', 'random', 'forest', 'algorithm', 'requires', 'a', 'minimal', 'amount', 'of', 'computation', 'cost', 'this', 'result', 'has', 'important', 'implications', 'for', 'galaxy', 'morphology', 'identification', 'tasks', 'in', 'the', 'era', 'of', 'euclid', 'and', 'other', 'large', 'scale', 'surveys']] | [-0.05471418697536939, -0.013539371032786253, -0.07719366672183427, 0.07238488258168464, -0.11992828965865833, -0.11853686792078483, 0.07732772833955774, 0.4348787637762883, -0.2020631443582854, -0.37430808360893597, 0.11504519924766116, -0.2722081055162254, -0.12901700062921934, 0.2186701184422788, -0.09634920758561732, 0.07251340413063576, 0.13612293954879456, -0.018506330862183566, -0.03991503441648092, -0.3436783566849969, 0.2628572484704279, 0.10083551412661386, 0.2933017630524681, -0.036821233652240076, 0.13523460676946866, -0.0001277494731643316, -0.11319884406876261, -0.02195207082374925, -0.08701475803743158, 0.11342941784059186, 0.31328613045467535, 0.23007940730845589, 0.32429650116522435, -0.31624405313445003, -0.18050518541170632, 0.11200108077432329, 0.16443040993230384, 0.08830244970898601, -0.04951138679055059, -0.3025548296523778, 0.06973587665647679, -0.20513287861831486, -0.07186433947566202, -0.06277942734324547, 0.012672603584163018, -0.025611317825308306, -0.21619414387693062, 0.09239722445500635, 0.0329824100069453, 0.1302841567765858, -0.07527150094639352, -0.0674039581169027, -0.0035471005377091342, 0.15540061555447657, -0.01235796766596357, 0.0841107791852279, 0.15609164819231364, -0.19503676525703867, -0.15812027056590985, 0.40083663553883464, -0.05974289849282132, -0.08941582615104487, 0.2192081319616113, -0.08960532738977128, -0.19368037079180733, 0.09342480029800307, 0.24227633417529248, 0.08331760349219776, -0.14655821512540076, 0.00858550000678298, -0.005156803722256574, 0.22767092552631935, 0.0240111436548848, -0.03864546584921654, 0.22532217695093634, 0.2619132764353338, 0.04646310188523415, 0.11901847046224787, -0.14780857107085096, -0.006131221238381656, -0.2154256021367165, -0.124058843602158, -0.13783858098894736, 0.021973952569138512, -0.11980415781992201, -0.12940609904590172, 0.3770791190076032, 0.1558290182443146, 0.21042050813103758, 0.12543940428206382, 0.3211172842104935, -0.0013162127239195536, 0.10838606395221995, 0.08771162727819085, 0.20394975510504793, 0.03276729500769653, 0.09683834634606837, -0.17953613067282093, 0.07324650198698707, 0.05116528229121024] |
1,802.08714 | Deep Multi-View Spatial-Temporal Network for Taxi Demand Prediction | Taxi demand prediction is an important building block to enabling intelligent
transportation systems in a smart city. An accurate prediction model can help
the city pre-allocate resources to meet travel demand and to reduce empty taxis
on streets which waste energy and worsen the traffic congestion. With the
increasing popularity of taxi requesting services such as Uber and Didi Chuxing
(in China), we are able to collect large-scale taxi demand data continuously.
How to utilize such big data to improve the demand prediction is an interesting
and critical real-world problem. Traditional demand prediction methods mostly
rely on time series forecasting techniques, which fail to model the complex
non-linear spatial and temporal relations. Recent advances in deep learning
have shown superior performance on traditionally challenging tasks such as
image classification by learning the complex features and correlations from
large-scale data. This breakthrough has inspired researchers to explore deep
learning techniques on traffic prediction problems. However, existing methods
on traffic prediction have only considered spatial relation (e.g., using CNN)
or temporal relation (e.g., using LSTM) independently. We propose a Deep
Multi-View Spatial-Temporal Network (DMVST-Net) framework to model both spatial
and temporal relations. Specifically, our proposed model consists of three
views: temporal view (modeling correlations between future demand values with
near time points via LSTM), spatial view (modeling local spatial correlation
via local CNN), and semantic view (modeling correlations among regions sharing
similar temporal patterns). Experiments on large-scale real taxi demand data
demonstrate effectiveness of our approach over state-of-the-art methods.
| cs.LG stat.ML | taxi demand prediction is an important building block to enabling intelligent transportation systems in a smart city an accurate prediction model can help the city preallocate resources to meet travel demand and to reduce empty taxis on streets which waste energy and worsen the traffic congestion with the increasing popularity of taxi requesting services such as uber and didi chuxing in china we are able to collect largescale taxi demand data continuously how to utilize such big data to improve the demand prediction is an interesting and critical realworld problem traditional demand prediction methods mostly rely on time series forecasting techniques which fail to model the complex nonlinear spatial and temporal relations recent advances in deep learning have shown superior performance on traditionally challenging tasks such as image classification by learning the complex features and correlations from largescale data this breakthrough has inspired researchers to explore deep learning techniques on traffic prediction problems however existing methods on traffic prediction have only considered spatial relation eg using cnn or temporal relation eg using lstm independently we propose a deep multiview spatialtemporal network dmvstnet framework to model both spatial and temporal relations specifically our proposed model consists of three views temporal view modeling correlations between future demand values with near time points via lstm spatial view modeling local spatial correlation via local cnn and semantic view modeling correlations among regions sharing similar temporal patterns experiments on largescale real taxi demand data demonstrate effectiveness of our approach over stateoftheart methods | [['taxi', 'demand', 'prediction', 'is', 'an', 'important', 'building', 'block', 'to', 'enabling', 'intelligent', 'transportation', 'systems', 'in', 'a', 'smart', 'city', 'an', 'accurate', 'prediction', 'model', 'can', 'help', 'the', 'city', 'preallocate', 'resources', 'to', 'meet', 'travel', 'demand', 'and', 'to', 'reduce', 'empty', 'taxis', 'on', 'streets', 'which', 'waste', 'energy', 'and', 'worsen', 'the', 'traffic', 'congestion', 'with', 'the', 'increasing', 'popularity', 'of', 'taxi', 'requesting', 'services', 'such', 'as', 'uber', 'and', 'didi', 'chuxing', 'in', 'china', 'we', 'are', 'able', 'to', 'collect', 'largescale', 'taxi', 'demand', 'data', 'continuously', 'how', 'to', 'utilize', 'such', 'big', 'data', 'to', 'improve', 'the', 'demand', 'prediction', 'is', 'an', 'interesting', 'and', 'critical', 'realworld', 'problem', 'traditional', 'demand', 'prediction', 'methods', 'mostly', 'rely', 'on', 'time', 'series', 'forecasting', 'techniques', 'which', 'fail', 'to', 'model', 'the', 'complex', 'nonlinear', 'spatial', 'and', 'temporal', 'relations', 'recent', 'advances', 'in', 'deep', 'learning', 'have', 'shown', 'superior', 'performance', 'on', 'traditionally', 'challenging', 'tasks', 'such', 'as', 'image', 'classification', 'by', 'learning', 'the', 'complex', 'features', 'and', 'correlations', 'from', 'largescale', 'data', 'this', 'breakthrough', 'has', 'inspired', 'researchers', 'to', 'explore', 'deep', 'learning', 'techniques', 'on', 'traffic', 'prediction', 'problems', 'however', 'existing', 'methods', 'on', 'traffic', 'prediction', 'have', 'only', 'considered', 'spatial', 'relation', 'eg', 'using', 'cnn', 'or', 'temporal', 'relation', 'eg', 'using', 'lstm', 'independently', 'we', 'propose', 'a', 'deep', 'multiview', 'spatialtemporal', 'network', 'dmvstnet', 'framework', 'to', 'model', 'both', 'spatial', 'and', 'temporal', 'relations', 'specifically', 'our', 'proposed', 'model', 'consists', 'of', 'three', 'views', 'temporal', 'view', 'modeling', 'correlations', 'between', 'future', 'demand', 'values', 'with', 'near', 'time', 'points', 'via', 'lstm', 'spatial', 'view', 'modeling', 'local', 'spatial', 'correlation', 'via', 'local', 'cnn', 'and', 'semantic', 'view', 'modeling', 'correlations', 'among', 'regions', 'sharing', 'similar', 'temporal', 'patterns', 'experiments', 'on', 'largescale', 'real', 'taxi', 'demand', 'data', 'demonstrate', 'effectiveness', 'of', 'our', 'approach', 'over', 'stateoftheart', 'methods']] | [-0.05847118719414409, -0.0020329124772355757, -0.06002214007193641, 0.0963281814023206, -0.11123433146644764, -0.1770496216849709, 0.0500303536273387, 0.4430628116527686, -0.28752666040874864, -0.35923363539908193, 0.09243342116123483, -0.3271938474756209, -0.18539795115000893, 0.2109660197305968, -0.14291858627289838, 0.12216907746463833, 0.1130945579804556, 0.021535161821817864, -0.02149007790436854, -0.26629430716714764, 0.2640373107682609, 0.0541678671407922, 0.44237678880822295, 0.05864224722989055, 0.10616498315871375, 0.009521884808544906, -0.08670213604535984, 0.0020511310789924193, -0.05096444164685506, 0.2002096037385149, 0.34756396932299344, 0.20677073820237526, 0.3380899178738497, -0.506898656692736, -0.30614813438198546, 0.11849578847842557, 0.13420062544696243, 0.0340619554391549, -0.010856033537574873, -0.3460128893752639, 0.04563263016634107, -0.1765251494107806, -0.025813152891944864, -0.14404673863354386, -0.010368282397334673, 0.03685430259377297, -0.2760611520581214, 0.031214540774639393, -0.010580688553425123, 0.09043294495572717, -0.03565272655461592, -0.059377269332810324, -0.007561195167541808, 0.204941433802133, 0.06919567549259079, 0.010859868551927561, 0.12596110450674075, -0.16185858322649585, -0.1702990410623749, 0.3675176168848969, -0.02398778452937092, -0.16495902673436366, 0.20752123411060597, -0.031192304738512148, -0.14165080863868398, 0.04970649780553518, 0.29845817836372146, 0.05652857101427353, -0.1657627264645939, -0.005950224758791072, -0.03149200661668592, 0.1762232632319234, 0.03361907889496307, 0.00940685751040143, 0.21517692570460542, 0.29812307179506337, 0.08956112343323779, 0.03448854853798236, -0.13390856632886797, -0.12894745942737376, -0.13511181545386813, -0.06374280839933948, -0.15979336950623868, -0.02175382640858998, -0.1461546969238897, -0.10327796876770254, 0.38887965254941764, 0.23982720463061516, 0.191720911332083, 0.08459709885397128, 0.37742164808572554, 0.04415352451900134, 0.1177526430930106, 0.11819809141036655, 0.09760347433977437, -0.03545539300337586, 0.24667060361671433, -0.16600173451671643, 0.0940123093138658, 0.04549681368873131] |
1,802.08715 | Detection of Sparse Mixtures: Higher Criticism and Scan Statistic | We consider the problem of detecting a sparse mixture as studied by Ingster
(1997) and Donoho and Jin (2004). We consider a wide array of base
distributions. In particular, we study the situation when the base distribution
has polynomial tails, a situation that has not received much attention in the
literature. Perhaps surprisingly, we find that in the context of such a
power-law distribution, the higher criticism does not achieve the detection
boundary. However, the scan statistic does.
| math.ST stat.TH | we consider the problem of detecting a sparse mixture as studied by ingster 1997 and donoho and jin 2004 we consider a wide array of base distributions in particular we study the situation when the base distribution has polynomial tails a situation that has not received much attention in the literature perhaps surprisingly we find that in the context of such a powerlaw distribution the higher criticism does not achieve the detection boundary however the scan statistic does | [['we', 'consider', 'the', 'problem', 'of', 'detecting', 'a', 'sparse', 'mixture', 'as', 'studied', 'by', 'ingster', '1997', 'and', 'donoho', 'and', 'jin', '2004', 'we', 'consider', 'a', 'wide', 'array', 'of', 'base', 'distributions', 'in', 'particular', 'we', 'study', 'the', 'situation', 'when', 'the', 'base', 'distribution', 'has', 'polynomial', 'tails', 'a', 'situation', 'that', 'has', 'not', 'received', 'much', 'attention', 'in', 'the', 'literature', 'perhaps', 'surprisingly', 'we', 'find', 'that', 'in', 'the', 'context', 'of', 'such', 'a', 'powerlaw', 'distribution', 'the', 'higher', 'criticism', 'does', 'not', 'achieve', 'the', 'detection', 'boundary', 'however', 'the', 'scan', 'statistic', 'does']] | [-0.1119422764899448, 0.05472043206771979, -0.09592061249825817, 0.08214866424289842, -0.07596190870464899, -0.1428316484969587, 0.045695818769626126, 0.37228176771448207, -0.1959726248617069, -0.2894193386623206, 0.10180977372100386, -0.2400417330328566, -0.16695379381939673, 0.13392323148078644, -0.1312423190460182, 0.02377085468898981, 0.05521860323512019, 0.032373723741143175, -0.07222978267460488, -0.23613750354912227, 0.27794498100112647, 0.09260408975518285, 0.3300737227575901, 0.021527834406767327, 0.06449054020982331, 0.03946022372931624, -0.040607449759800844, 0.03588202286463899, -0.11727178901622747, 0.058092476529940866, 0.23494784436069238, 0.16022546189383435, 0.31778339300758374, -0.3718203999675237, -0.28227335322075164, 0.19766211060162348, 0.14451516510990375, 0.08997769916477875, -0.046151691056692444, -0.20757105603861886, 0.07792647925014488, -0.22104582246025437, -0.09518593048023131, -0.014875321472899463, 0.0643237058359843, 0.014142240148383932, -0.2844985910357, 0.06930987016321757, 0.13185740537786236, 0.06440523238136218, 0.011198609828566894, -0.1447007002738806, 0.03587778406934096, 0.06973364989113552, 0.05919287807176797, 0.011536155190044202, 0.06101103304909208, -0.16232647634565067, -0.08438626297104818, 0.36679857162436325, -0.07255715902488774, -0.19750122634323838, 0.18870077340696484, -0.2109191466260176, -0.18251155706074756, 0.0828402977830802, 0.1698700779189284, 0.13357602015066034, -0.11225357518075423, 0.1253033950163696, -0.12236965993174519, 0.13938447434861118, 0.11297278893060791, -0.02668022373930002, 0.1438572822819249, 0.11565829194986667, 0.06682075360694374, 0.1571643997927029, -0.1440398894304123, -0.08846102356433104, -0.23950233090764436, -0.10642054822677985, -0.2311174794792747, 0.02983726332455169, -0.008232391689745829, -0.1607405039577339, 0.38364765401452017, 0.14349577349359885, 0.23294116931859976, 0.056192463574310146, 0.2370323262249048, 0.09936214646605106, 0.02591017426516956, 0.0877387182882581, 0.2324175286309746, 0.09311484679496154, 0.12355032546493487, -0.13090788266167808, 0.11267384223472805, 0.0038622849059697143] |
1,802.08716 | Exact results in 3d $\mathcal{N}=2$ $Spin(7)$ gauge theories with vector
and spinor matters | We study three-dimensional $\mathcal{N}=2$ $Spin(7)$ gauge theories with
$N_S$ spinorial matters and with $N_f$ vectorial matters. The quantum Coulomb
branch on the moduli space of vacua is one- or two-dimensional depending on the
matter contents. For particular values of $(N_f,N_S)$, we find s-confinement
phases and derive exact superpotentials. The 3d dynamics of $Spin(7)$ is
connected to the 4d dynamics via KK-monopoles. Along the Higgs branch of the
$Spin(7)$ theories, we obtain 3d $\mathcal{N}=2$ $G_2$ or $SU(4)$ theories and
some of them lead to new s-confinement phases. As a check of our analysis we
compute superconformal indices for these theories.
| hep-th | we study threedimensional mathcaln2 spin7 gauge theories with n_s spinorial matters and with n_f vectorial matters the quantum coulomb branch on the moduli space of vacua is one or twodimensional depending on the matter contents for particular values of n_fn_s we find sconfinement phases and derive exact superpotentials the 3d dynamics of spin7 is connected to the 4d dynamics via kkmonopoles along the higgs branch of the spin7 theories we obtain 3d mathcaln2 g_2 or su4 theories and some of them lead to new sconfinement phases as a check of our analysis we compute superconformal indices for these theories | [['we', 'study', 'threedimensional', 'mathcaln2', 'spin7', 'gauge', 'theories', 'with', 'n_s', 'spinorial', 'matters', 'and', 'with', 'n_f', 'vectorial', 'matters', 'the', 'quantum', 'coulomb', 'branch', 'on', 'the', 'moduli', 'space', 'of', 'vacua', 'is', 'one', 'or', 'twodimensional', 'depending', 'on', 'the', 'matter', 'contents', 'for', 'particular', 'values', 'of', 'n_fn_s', 'we', 'find', 'sconfinement', 'phases', 'and', 'derive', 'exact', 'superpotentials', 'the', '3d', 'dynamics', 'of', 'spin7', 'is', 'connected', 'to', 'the', '4d', 'dynamics', 'via', 'kkmonopoles', 'along', 'the', 'higgs', 'branch', 'of', 'the', 'spin7', 'theories', 'we', 'obtain', '3d', 'mathcaln2', 'g_2', 'or', 'su4', 'theories', 'and', 'some', 'of', 'them', 'lead', 'to', 'new', 'sconfinement', 'phases', 'as', 'a', 'check', 'of', 'our', 'analysis', 'we', 'compute', 'superconformal', 'indices', 'for', 'these', 'theories']] | [-0.1443623463832298, 0.17455345205962658, -0.06374799404578398, 0.09543754939911697, -0.08278845094990138, -0.17676858579720922, -0.026653752374766887, 0.3472034073605829, -0.1178373594409596, -0.29909885305987327, 0.0760759657096802, -0.29040819529101863, -0.1919144183891464, 0.09045381727806596, -0.03540624931872803, 0.008612219190934188, -0.021729999271753644, 0.053211416402945716, -0.1666407368041347, -0.2679467229932851, 0.3826454073114663, -0.08796277420466994, 0.2746483463109756, 0.03319843180895764, 0.0575547148283495, -0.013340496949908532, 0.02097861711125897, -0.03626751005964363, -0.18455932009014853, 0.13242221001193535, 0.20010001463245372, 0.0445494848797668, 0.04636526685588214, -0.4764747028619203, -0.22213551315612026, 0.11654245026756496, 0.18264344241470098, 0.13249751882703634, -0.013660810992349776, -0.31700172790383196, 0.03900018191364195, -0.14230792773222284, -0.17111513157950106, -0.12813215501302358, -0.021803986466470724, -0.08528565141438905, -0.24319909151871594, 0.041222646139319793, -0.07725874187747891, 0.06630433670112065, -0.05788927507700817, -0.09024808220880115, -0.1419497383687151, 0.10533960473875763, 0.13187259627145012, 0.027031815658342475, 0.09820462911620223, -0.26020655001760745, -0.14397670767906748, 0.41057411791775755, -0.02150265227204987, -0.22100581821500875, 0.1676443122631433, -0.10899205041641835, -0.19711701978682256, 0.05313898349532439, 0.10765990047544545, 0.1987177076129117, -0.015310361634521765, 0.20387914767120585, -0.03508737390594823, 0.12263747018628887, 0.028735494022542725, 0.049977292354237667, 0.27888349290671094, 0.11189979343789117, 0.03874098384106646, 0.10946286964819443, -0.005087595735023235, -0.10940619509391562, -0.3831540978684717, -0.18702240790387767, -0.07836525254331682, 0.12674599097761308, -0.18355592828180417, -0.19747258191548137, 0.4150651748739397, 0.08109346267943061, 0.1480786930983506, 0.06276033214074844, 0.16587544175587138, 0.06790354491059421, 0.03706879271384405, 0.011578450554373617, 0.2196800961715706, 0.19445521186927942, 0.0414504465000818, -0.21966388403457038, -0.19184854054557426, 0.22250112824674165] |
1,802.08717 | Deep learning in radiology: an overview of the concepts and a survey of
the state of the art | Deep learning is a branch of artificial intelligence where networks of simple
interconnected units are used to extract patterns from data in order to solve
complex problems. Deep learning algorithms have shown groundbreaking
performance in a variety of sophisticated tasks, especially those related to
images. They have often matched or exceeded human performance. Since the
medical field of radiology mostly relies on extracting useful information from
images, it is a very natural application area for deep learning, and research
in this area has rapidly grown in recent years. In this article, we review the
clinical reality of radiology and discuss the opportunities for application of
deep learning algorithms. We also introduce basic concepts of deep learning
including convolutional neural networks. Then, we present a survey of the
research in deep learning applied to radiology. We organize the studies by the
types of specific tasks that they attempt to solve and review the broad range
of utilized deep learning algorithms. Finally, we briefly discuss opportunities
and challenges for incorporating deep learning in the radiology practice of the
future.
| cs.CV cs.LG stat.AP stat.ML | deep learning is a branch of artificial intelligence where networks of simple interconnected units are used to extract patterns from data in order to solve complex problems deep learning algorithms have shown groundbreaking performance in a variety of sophisticated tasks especially those related to images they have often matched or exceeded human performance since the medical field of radiology mostly relies on extracting useful information from images it is a very natural application area for deep learning and research in this area has rapidly grown in recent years in this article we review the clinical reality of radiology and discuss the opportunities for application of deep learning algorithms we also introduce basic concepts of deep learning including convolutional neural networks then we present a survey of the research in deep learning applied to radiology we organize the studies by the types of specific tasks that they attempt to solve and review the broad range of utilized deep learning algorithms finally we briefly discuss opportunities and challenges for incorporating deep learning in the radiology practice of the future | [['deep', 'learning', 'is', 'a', 'branch', 'of', 'artificial', 'intelligence', 'where', 'networks', 'of', 'simple', 'interconnected', 'units', 'are', 'used', 'to', 'extract', 'patterns', 'from', 'data', 'in', 'order', 'to', 'solve', 'complex', 'problems', 'deep', 'learning', 'algorithms', 'have', 'shown', 'groundbreaking', 'performance', 'in', 'a', 'variety', 'of', 'sophisticated', 'tasks', 'especially', 'those', 'related', 'to', 'images', 'they', 'have', 'often', 'matched', 'or', 'exceeded', 'human', 'performance', 'since', 'the', 'medical', 'field', 'of', 'radiology', 'mostly', 'relies', 'on', 'extracting', 'useful', 'information', 'from', 'images', 'it', 'is', 'a', 'very', 'natural', 'application', 'area', 'for', 'deep', 'learning', 'and', 'research', 'in', 'this', 'area', 'has', 'rapidly', 'grown', 'in', 'recent', 'years', 'in', 'this', 'article', 'we', 'review', 'the', 'clinical', 'reality', 'of', 'radiology', 'and', 'discuss', 'the', 'opportunities', 'for', 'application', 'of', 'deep', 'learning', 'algorithms', 'we', 'also', 'introduce', 'basic', 'concepts', 'of', 'deep', 'learning', 'including', 'convolutional', 'neural', 'networks', 'then', 'we', 'present', 'a', 'survey', 'of', 'the', 'research', 'in', 'deep', 'learning', 'applied', 'to', 'radiology', 'we', 'organize', 'the', 'studies', 'by', 'the', 'types', 'of', 'specific', 'tasks', 'that', 'they', 'attempt', 'to', 'solve', 'and', 'review', 'the', 'broad', 'range', 'of', 'utilized', 'deep', 'learning', 'algorithms', 'finally', 'we', 'briefly', 'discuss', 'opportunities', 'and', 'challenges', 'for', 'incorporating', 'deep', 'learning', 'in', 'the', 'radiology', 'practice', 'of', 'the', 'future']] | [-0.01907624993512754, 0.005609993880751443, -0.06592999004211676, 0.08335190483153203, -0.13967561132358755, -0.14131448702659133, 0.010865764291220381, 0.4567524034656205, -0.2806017208452426, -0.3361391793320871, 0.1174806871650067, -0.2689107887362693, -0.25287002625370053, 0.24696010039030117, -0.15046522557067207, 0.08681025666232078, 0.11084680870901477, 0.037662241223799645, -0.05042162089277122, -0.3010747380453388, 0.3266997240841557, 0.01874560766621877, 0.35605493308923675, 0.05433308612160637, 0.10559364359386497, -0.02292339524811944, -0.058795042976600216, 0.0069784427766746045, -0.10807954522227443, 0.23599055011383135, 0.41381853513714284, 0.2507512057568394, 0.3757966667845172, -0.4639920654185748, -0.24557437522515738, 0.10574141588051525, 0.17086916372422023, 0.11520769290733257, -0.06673795420026649, -0.3162101165281009, 0.062492360175116314, -0.14151189378383805, -0.02028336415299488, -0.15351130268839056, -0.010046242139733654, 0.009709792208034376, -0.2058641953120208, -0.02110223742981315, 0.03322149699489391, 0.11960138475501352, -0.037846192806343534, -0.14576338132248803, 0.12080383641740024, 0.17069892819029, 0.05854571752492233, 0.05042238744294092, 0.14350862212552778, -0.2637153022927837, -0.14742440657984823, 0.33265388850648864, -0.012418615914247193, -0.11844585093243395, 0.21640921675857935, -0.01875084484953665, -0.21285263273738703, 0.07607888412006768, 0.29398737162730454, 0.12279593340571086, -0.18651700277134017, 0.04291295389234388, -0.008381633103777797, 0.11426064335230716, 0.02195006112520725, 0.00511656497278919, 0.21736242181205817, 0.2831580260831673, -0.01936810027734287, 0.12354356394607131, -0.12590495138534338, -0.0761671765802144, -0.18101991808020884, -0.10818393507414618, -0.15333341081537263, 0.007490120550596529, -0.031687424907205615, -0.13691466877886127, 0.398194115040666, 0.2399805848932158, 0.17734253937825772, 0.03956471274128068, 0.3181592733362469, 0.021600524221394357, 0.1548802618043876, 0.06861285076313521, 0.22889032812215557, 0.06988506361784276, 0.20956817503734412, -0.11305846905041128, 0.04007201001776835, -0.022621754066239896] |
1,802.08718 | Learning with Abandonment | Consider a platform that wants to learn a personalized policy for each user,
but the platform faces the risk of a user abandoning the platform if she is
dissatisfied with the actions of the platform. For example, a platform is
interested in personalizing the number of newsletters it sends, but faces the
risk that the user unsubscribes forever. We propose a general thresholded
learning model for scenarios like this, and discuss the structure of optimal
policies. We describe salient features of optimal personalization algorithms
and how feedback the platform receives impacts the results. Furthermore, we
investigate how the platform can efficiently learn the heterogeneity across
users by interacting with a population and provide performance guarantees.
| stat.ML cs.AI cs.LG | consider a platform that wants to learn a personalized policy for each user but the platform faces the risk of a user abandoning the platform if she is dissatisfied with the actions of the platform for example a platform is interested in personalizing the number of newsletters it sends but faces the risk that the user unsubscribes forever we propose a general thresholded learning model for scenarios like this and discuss the structure of optimal policies we describe salient features of optimal personalization algorithms and how feedback the platform receives impacts the results furthermore we investigate how the platform can efficiently learn the heterogeneity across users by interacting with a population and provide performance guarantees | [['consider', 'a', 'platform', 'that', 'wants', 'to', 'learn', 'a', 'personalized', 'policy', 'for', 'each', 'user', 'but', 'the', 'platform', 'faces', 'the', 'risk', 'of', 'a', 'user', 'abandoning', 'the', 'platform', 'if', 'she', 'is', 'dissatisfied', 'with', 'the', 'actions', 'of', 'the', 'platform', 'for', 'example', 'a', 'platform', 'is', 'interested', 'in', 'personalizing', 'the', 'number', 'of', 'newsletters', 'it', 'sends', 'but', 'faces', 'the', 'risk', 'that', 'the', 'user', 'unsubscribes', 'forever', 'we', 'propose', 'a', 'general', 'thresholded', 'learning', 'model', 'for', 'scenarios', 'like', 'this', 'and', 'discuss', 'the', 'structure', 'of', 'optimal', 'policies', 'we', 'describe', 'salient', 'features', 'of', 'optimal', 'personalization', 'algorithms', 'and', 'how', 'feedback', 'the', 'platform', 'receives', 'impacts', 'the', 'results', 'furthermore', 'we', 'investigate', 'how', 'the', 'platform', 'can', 'efficiently', 'learn', 'the', 'heterogeneity', 'across', 'users', 'by', 'interacting', 'with', 'a', 'population', 'and', 'provide', 'performance', 'guarantees']] | [-0.09891442762965565, 0.03234231559837466, -0.10132185588672496, 0.07864527141761132, -0.1472294014682503, -0.2536287028996045, 0.11716140131925624, 0.4247500481116667, -0.2853233565069866, -0.2898033000855592, 0.08462043069691087, -0.31677447133615877, -0.22152136353543028, 0.16838488392654413, -0.10394906559795664, 0.02054879531721797, 0.06585582741127725, 0.10293040163186991, 0.018093969092884084, -0.2877161488459821, 0.31724609204633325, 0.06432023073808012, 0.3063300658393194, 0.05170989672555343, 0.12258099966372053, 0.011578118542960862, 0.025281814286452636, -0.009103984848735038, -0.10155718861999942, 0.14966029367458664, 0.3097867387461296, 0.24541622566941537, 0.3940309265714237, -0.40193850164742845, -0.16210256330668926, 0.07779828879345012, 0.08405759120196626, 0.0955979841957359, -0.10293551767244935, -0.3031984037850379, 0.079159261856898, -0.2157255795359481, -0.09161037932101049, -0.08735690439904206, -0.042879501210623665, -0.017844781827223318, -0.3307628550453381, -0.04754922161565015, 0.010006325915782597, 0.007816261517929664, -0.04356420179420527, -0.03419100627683005, 0.011987230613860384, 0.24584851135385402, 0.044153774073429145, -0.026975227597480018, 0.1737102415012359, -0.17172850195212258, -0.16761325851180836, 0.42448416918418125, -0.003781152831946026, -0.20738874970559487, 0.1618913850142506, -0.09400311442859993, -0.10498850267347798, 0.06136447124248534, 0.2748924769836952, 0.09060515193963065, -0.1662892098666226, 0.0527203100056412, -0.0687737740482318, 0.16908638798958509, -0.02853134260798821, 0.040169334564492794, 0.21378146409947557, 0.2198330245895736, 0.10081528408836835, 0.1628717097245451, -0.03497561596726116, -0.05309120824625879, -0.2311460640232422, -0.18690734566597825, -0.13360329515406894, 0.007842174355398145, -0.09171731963208897, -0.11793759077498403, 0.42151408439926935, 0.22188772231936782, 0.16302278261272268, 0.09974495429324043, 0.3335439537553803, 0.035622464950408855, 0.04864287007142577, 0.1523573961141601, 0.131942755283314, -0.04510754415164947, 0.13839755388663003, -0.20178746564820277, 0.15946643621856837, -0.003774491808654969] |
1,802.08719 | Spontaneous helical order of a chiral p-wave superfluid confined in
nano-scale channels | Strong interactions that favor chiral p-wave pairing, combined with strong
pair breaking by confining boundaries, are shown to lead to new equilibrium
states with different broken symmetries. Based on a strong-coupling
Ginzburg-Landau (GL) theory that accurately accounts for the thermodynamics and
phase diagram of the bulk phases of superfluid $^3$He, we predict new phases of
superfluid $^3$He for confined geometries that spontaneously break rotational
and translational symmetry in combination with parity and time-reversal
symmetry. One of the newly predicted phases exhibits a unique combination of
chiral and helical order that is energetically stable in cylindrical channels
of radius approaching the Cooper pair coherence length, e.g. $R\sim
100\,\mbox{nm}$. Precise numerical mimimization of the GL free energy yields a
broad region of stability of the helical phase as a function of pressure and
temperature, in addition to three translationally invariant phases with
distinct broken spin- and orbital rotation symmetries. The helical phase is
stable at both high and low pressures and favored by boundaries with strong
pair-breaking. We present calculations of transverse NMR frequency shifts as
functions of rf pulse tipping angle, magnetic field orientation, and
temperature as signatures of these broken symmetry phases.
| cond-mat.supr-con | strong interactions that favor chiral pwave pairing combined with strong pair breaking by confining boundaries are shown to lead to new equilibrium states with different broken symmetries based on a strongcoupling ginzburglandau gl theory that accurately accounts for the thermodynamics and phase diagram of the bulk phases of superfluid 3he we predict new phases of superfluid 3he for confined geometries that spontaneously break rotational and translational symmetry in combination with parity and timereversal symmetry one of the newly predicted phases exhibits a unique combination of chiral and helical order that is energetically stable in cylindrical channels of radius approaching the cooper pair coherence length eg rsim 100mboxnm precise numerical mimimization of the gl free energy yields a broad region of stability of the helical phase as a function of pressure and temperature in addition to three translationally invariant phases with distinct broken spin and orbital rotation symmetries the helical phase is stable at both high and low pressures and favored by boundaries with strong pairbreaking we present calculations of transverse nmr frequency shifts as functions of rf pulse tipping angle magnetic field orientation and temperature as signatures of these broken symmetry phases | [['strong', 'interactions', 'that', 'favor', 'chiral', 'pwave', 'pairing', 'combined', 'with', 'strong', 'pair', 'breaking', 'by', 'confining', 'boundaries', 'are', 'shown', 'to', 'lead', 'to', 'new', 'equilibrium', 'states', 'with', 'different', 'broken', 'symmetries', 'based', 'on', 'a', 'strongcoupling', 'ginzburglandau', 'gl', 'theory', 'that', 'accurately', 'accounts', 'for', 'the', 'thermodynamics', 'and', 'phase', 'diagram', 'of', 'the', 'bulk', 'phases', 'of', 'superfluid', '3he', 'we', 'predict', 'new', 'phases', 'of', 'superfluid', '3he', 'for', 'confined', 'geometries', 'that', 'spontaneously', 'break', 'rotational', 'and', 'translational', 'symmetry', 'in', 'combination', 'with', 'parity', 'and', 'timereversal', 'symmetry', 'one', 'of', 'the', 'newly', 'predicted', 'phases', 'exhibits', 'a', 'unique', 'combination', 'of', 'chiral', 'and', 'helical', 'order', 'that', 'is', 'energetically', 'stable', 'in', 'cylindrical', 'channels', 'of', 'radius', 'approaching', 'the', 'cooper', 'pair', 'coherence', 'length', 'eg', 'rsim', '100mboxnm', 'precise', 'numerical', 'mimimization', 'of', 'the', 'gl', 'free', 'energy', 'yields', 'a', 'broad', 'region', 'of', 'stability', 'of', 'the', 'helical', 'phase', 'as', 'a', 'function', 'of', 'pressure', 'and', 'temperature', 'in', 'addition', 'to', 'three', 'translationally', 'invariant', 'phases', 'with', 'distinct', 'broken', 'spin', 'and', 'orbital', 'rotation', 'symmetries', 'the', 'helical', 'phase', 'is', 'stable', 'at', 'both', 'high', 'and', 'low', 'pressures', 'and', 'favored', 'by', 'boundaries', 'with', 'strong', 'pairbreaking', 'we', 'present', 'calculations', 'of', 'transverse', 'nmr', 'frequency', 'shifts', 'as', 'functions', 'of', 'rf', 'pulse', 'tipping', 'angle', 'magnetic', 'field', 'orientation', 'and', 'temperature', 'as', 'signatures', 'of', 'these', 'broken', 'symmetry', 'phases']] | [-0.22222260812444514, 0.29501899569172807, -0.07736030494285698, 0.038220202947329536, -0.044366639165060694, -0.17828166257148903, 0.05932153106336237, 0.3707332753809169, -0.23005778091763587, -0.27407201610407544, 0.01811886582505203, -0.2483049693725709, -0.06781261135505415, 0.08862321518091976, 0.06241364219504727, 0.04799421094848137, -0.07195935949291053, -0.021582318940444996, -0.1530407702801504, -0.11998397750093749, 0.3069322625542746, -0.00838240584064471, 0.3360645559616387, 0.06580138829120091, 0.038959594066928775, -0.013087968294214653, 0.10658328059178433, 0.032428923092390365, -0.15783820625128053, 0.003392737844995664, 0.21237913326737104, -0.06572663232586101, 0.09586071241401921, -0.4437197556081963, -0.22174744066341143, 0.0516789625815459, 0.12884210388591255, 0.14650930976985316, -0.06618175405800637, -0.31877392116737996, 0.03919670838482776, -0.16988384230184908, -0.19877427487732155, -0.15188509662464064, 0.025204240847501513, -0.012224313442742354, -0.2499639974171786, 0.1578759017670037, 0.05436315642375695, 0.1125767736226599, -0.0842877225889089, -0.08639497947817865, -0.12919519949753425, 0.05045830896982041, 0.10166304251914354, 0.053392619175199225, 0.1218498330575561, -0.1308134637788355, -0.10186905468152346, 0.39459153399312574, -0.050730547555232125, -0.09634295164264346, 0.19346213592338915, -0.16148710110581688, -0.10523768944273654, 0.21848846912187966, 0.1126906139690331, 0.08689036621638623, -0.06087343963046901, 0.030729969714517018, 0.005275415568489973, 0.18541710968742048, 0.06121205141841385, 0.06232176833344918, 0.2928542063718564, 0.1447013584584439, 0.05205853830189689, 0.1273320816579814, -0.12949738369727704, -0.1277356003754233, -0.3078142022910087, -0.12749505549375165, -0.17818109259548548, -0.01546424766634836, -0.06328251254185728, -0.1584577706585773, 0.40511019933772713, 0.08351329130696525, 0.18152220218295329, -0.03016257330677227, 0.2390860162093304, 0.09022308802048333, 0.06361935085028803, 0.033508516959600936, 0.2619109774939716, 0.18663973825812144, 0.05281278369121106, -0.3171978532152839, 0.0018063099282842718, 0.05702399426740349] |
1,802.0872 | A Robust Power Grid Defense Model Considering Load Demand and Wind
Generation Uncertainties | It is a major task to develop effective strategies for defending the power
system against deliberate attacks. It is critical to comprehensively consider
the human-related and environmental risks and uncertainties, which is missing
in existing literature. This paper considers the load demand uncertainties and
wind generation uncertainties in addition to the interactive attacker/defender
behaviors. Specifically, a defender-attacker-nature-operator model is proposed,
which incorporates the attack/defense interaction, the corrective re-dispatch
of the operator, the coordination between the attack strategy and the
stochastic nature of load demands and wind generations. The
Column-and-Constraint Generation (C&CG) algorithm is adopted for solving the
proposed model by decomposing the proposed model into a master problem and a
sub-problem. Simulations are performed using MATLAB and CPLEX on a modified
IEEE RTS79 system. The simulation results verify the validity of the proposed
model.
| math.OC | it is a major task to develop effective strategies for defending the power system against deliberate attacks it is critical to comprehensively consider the humanrelated and environmental risks and uncertainties which is missing in existing literature this paper considers the load demand uncertainties and wind generation uncertainties in addition to the interactive attackerdefender behaviors specifically a defenderattackernatureoperator model is proposed which incorporates the attackdefense interaction the corrective redispatch of the operator the coordination between the attack strategy and the stochastic nature of load demands and wind generations the columnandconstraint generation ccg algorithm is adopted for solving the proposed model by decomposing the proposed model into a master problem and a subproblem simulations are performed using matlab and cplex on a modified ieee rts79 system the simulation results verify the validity of the proposed model | [['it', 'is', 'a', 'major', 'task', 'to', 'develop', 'effective', 'strategies', 'for', 'defending', 'the', 'power', 'system', 'against', 'deliberate', 'attacks', 'it', 'is', 'critical', 'to', 'comprehensively', 'consider', 'the', 'humanrelated', 'and', 'environmental', 'risks', 'and', 'uncertainties', 'which', 'is', 'missing', 'in', 'existing', 'literature', 'this', 'paper', 'considers', 'the', 'load', 'demand', 'uncertainties', 'and', 'wind', 'generation', 'uncertainties', 'in', 'addition', 'to', 'the', 'interactive', 'attackerdefender', 'behaviors', 'specifically', 'a', 'defenderattackernatureoperator', 'model', 'is', 'proposed', 'which', 'incorporates', 'the', 'attackdefense', 'interaction', 'the', 'corrective', 'redispatch', 'of', 'the', 'operator', 'the', 'coordination', 'between', 'the', 'attack', 'strategy', 'and', 'the', 'stochastic', 'nature', 'of', 'load', 'demands', 'and', 'wind', 'generations', 'the', 'columnandconstraint', 'generation', 'ccg', 'algorithm', 'is', 'adopted', 'for', 'solving', 'the', 'proposed', 'model', 'by', 'decomposing', 'the', 'proposed', 'model', 'into', 'a', 'master', 'problem', 'and', 'a', 'subproblem', 'simulations', 'are', 'performed', 'using', 'matlab', 'and', 'cplex', 'on', 'a', 'modified', 'ieee', 'rts79', 'system', 'the', 'simulation', 'results', 'verify', 'the', 'validity', 'of', 'the', 'proposed', 'model']] | [-0.13368302682382902, -0.010774489469247672, -0.04964060157142354, 0.06582316570689506, -0.06533524951417789, -0.17231625233155987, 0.07221911870257111, 0.3371058253917109, -0.24827952036690532, -0.3498177568738659, 0.12359442054752656, -0.2611126020183843, -0.16680852881682134, 0.1862000478678524, -0.09403190162794833, 0.10468409653527266, 0.06821575145692226, -0.0363512939357227, 0.021508176211324153, -0.2649352347591158, 0.2916757383182729, 0.09586786832237108, 0.3317809472156858, 0.0543885827576036, 0.11667353452790077, -0.00101186589436662, -0.03589600514775763, 0.013664574175367527, -0.06380027590256016, 0.12085107163875364, 0.22743177086434144, 0.17848304353978936, 0.32123377678252646, -0.4122183770646877, -0.24579595020887526, 0.07432192928073081, 0.09401114113257569, 0.0952551783835092, -0.03832906915428766, -0.28123095281647914, 0.08301567192415171, -0.24968105431109894, -0.062426462695425886, -0.05383822392446525, -0.022861763505109895, 0.012517609619394396, -0.339799371413943, 0.03082776203937652, 0.023478999262971974, 0.01925721749042471, -0.05642137056036683, -0.09284314556068486, 0.0015432163755494084, 0.13130678623565473, 0.057860521761926284, -0.007663636288436299, 0.1491205284035073, -0.10344682605125743, -0.13219641155482156, 0.42407954504685197, 0.0028203430649062448, -0.21940325209024278, 0.14090627295390182, -0.004988729664491433, -0.11892136655197563, 0.06538321313476472, 0.22446643032669794, 0.0870193798468928, -0.19509877767554965, 0.0424045889226501, 0.005629541144254758, 0.16463188731083364, -0.025349091969529225, -0.06411703353197398, 0.14697079895642784, 0.22978142043575644, 0.05326214689182851, 0.13742552411735454, -0.07164293319819438, -0.14579606179684174, -0.2542301879306747, -0.10536496172602655, -0.13132977880410512, -0.06467048235759704, -0.05837668649859772, -0.09913287859649933, 0.4273899406420462, 0.24026162397455086, 0.09382922506086867, 0.0813485339837798, 0.41405154667992256, 0.12550868825620096, 0.0469059099736059, 0.1158164855561071, 0.20677005056517594, 0.06001813281115822, 0.13692113406476425, -0.2696237181292169, 0.12556803945952913, 0.06721780904935616] |
1,802.08721 | Measurement of the normalized $^{238}$U(n,f)/$^{235}$U(n,f) cross
section ratio from threshold to 30 MeV with the fission Time Projection
Chamber | The normalized $^{238}$U(n,f)/$^{235}$U(n,f) cross section ratio has been
measured using the NIFFTE fission Time Projection Chamber from the reaction
threshold to $30$~MeV. The fissionTPC is a two-volume MICROMEGAS time
projection chamber that allows for full three-dimensional reconstruction of
fission-fragment ionization profiles from neutron-induced fission. The
measurement was performed at the Los Alamos Neutron Science Center, where the
neutron energy is determined from neutron time-of-flight. The
$^{238}$U(n,f)/$^{235}$U(n,f) ratio reported here is the first cross section
measurement made with the fissionTPC, and will provide new experimental data
for evaluation of the $^{238}$U(n,f) cross section, an important standard used
in neutron-flux measurements. Use of a development target in this work
prevented the determination of an absolute normalization, to be addressed in
future measurements. Instead, the measured cross section ratio has been
normalized to ENDF/B-VIII.$\beta$5 at 14.5 MeV.
| nucl-ex physics.ins-det | the normalized 238unf235unf cross section ratio has been measured using the niffte fission time projection chamber from the reaction threshold to 30mev the fissiontpc is a twovolume micromegas time projection chamber that allows for full threedimensional reconstruction of fissionfragment ionization profiles from neutroninduced fission the measurement was performed at the los alamos neutron science center where the neutron energy is determined from neutron timeofflight the 238unf235unf ratio reported here is the first cross section measurement made with the fissiontpc and will provide new experimental data for evaluation of the 238unf cross section an important standard used in neutronflux measurements use of a development target in this work prevented the determination of an absolute normalization to be addressed in future measurements instead the measured cross section ratio has been normalized to endfbviiibeta5 at 145 mev | [['the', 'normalized', '238unf235unf', 'cross', 'section', 'ratio', 'has', 'been', 'measured', 'using', 'the', 'niffte', 'fission', 'time', 'projection', 'chamber', 'from', 'the', 'reaction', 'threshold', 'to', '30mev', 'the', 'fissiontpc', 'is', 'a', 'twovolume', 'micromegas', 'time', 'projection', 'chamber', 'that', 'allows', 'for', 'full', 'threedimensional', 'reconstruction', 'of', 'fissionfragment', 'ionization', 'profiles', 'from', 'neutroninduced', 'fission', 'the', 'measurement', 'was', 'performed', 'at', 'the', 'los', 'alamos', 'neutron', 'science', 'center', 'where', 'the', 'neutron', 'energy', 'is', 'determined', 'from', 'neutron', 'timeofflight', 'the', '238unf235unf', 'ratio', 'reported', 'here', 'is', 'the', 'first', 'cross', 'section', 'measurement', 'made', 'with', 'the', 'fissiontpc', 'and', 'will', 'provide', 'new', 'experimental', 'data', 'for', 'evaluation', 'of', 'the', '238unf', 'cross', 'section', 'an', 'important', 'standard', 'used', 'in', 'neutronflux', 'measurements', 'use', 'of', 'a', 'development', 'target', 'in', 'this', 'work', 'prevented', 'the', 'determination', 'of', 'an', 'absolute', 'normalization', 'to', 'be', 'addressed', 'in', 'future', 'measurements', 'instead', 'the', 'measured', 'cross', 'section', 'ratio', 'has', 'been', 'normalized', 'to', 'endfbviiibeta5', 'at', '145', 'mev']] | [-0.016901250318587982, 0.11609214461654922, -0.09972355191892757, 0.03446372726015284, 0.0010359017690553423, -0.06195763042268827, -0.0007083573299207429, 0.3490306159495845, -0.20781414238591642, -0.31740066395754846, 0.026395685285827968, -0.32649900859716807, 0.0572754141167095, 0.22851198999023484, 0.01235149575888302, 0.13089464542044457, 0.10346993690269977, 0.05848154013226523, -0.09790786681606528, -0.18194196653297864, 0.26665244877244554, 0.19460798319169256, 0.30923628530197944, 0.13586479351068884, 0.11974739826685034, 0.03663490231278851, -0.08499280072373244, -0.03714468479950645, -0.1869418012635812, 0.057849544699686443, 0.29555901025003184, 0.11121039935062792, 0.12497001163690358, -0.3976138297417887, -0.123018514621252, 0.11496570369936238, 0.11662986735242975, 0.07744030240388919, -0.08282515054294305, -0.2712978427912029, 0.07481425592825611, -0.21555100368018182, -0.11220919201511514, 0.0076331118150621425, 0.01930048438005669, 0.0015248076127509968, -0.22553869027846543, 0.038579858299850146, -0.06320487777161043, 0.0425356700872035, -0.08272673232641518, -0.19985264550186982, 0.025003130446628545, 0.07736874704859256, 0.02121339406449954, 0.06150845491057515, 0.20090608168826546, -0.07237622878774135, -0.09756609508876017, 0.34932085620455966, -0.06548453966253112, -0.1334714076502967, 0.06481734235489438, -0.18749850280149732, -0.11884149000618982, 0.20871556989213294, 0.1730865353588448, 0.11198664063140172, -0.17498891672855893, 0.03945953907154486, 0.008789681668877024, 0.19593461565023593, 0.11625297937195661, -0.05900856556890662, 0.162077200562917, 0.22640465698638107, 0.01026607218898775, 0.04178890333575911, -0.2528432449001039, -0.038441639523520026, -0.3274351786136223, -0.16966316779324597, -0.11840103222725032, 0.07135115835234494, 0.018883558253819925, -0.07840930420703204, 0.3307243242657693, 0.07046284560879418, 0.22690417466670737, -0.034941164421119775, 0.36700815964641786, 0.11977793599926513, 0.10310170361086322, -0.018602784481188354, 0.33264268477187425, 0.19251392655392258, 0.14650737575089284, -0.20982797079098722, 0.14160460765769547, 0.01826568153260868] |
1,802.08722 | A Weighted Sparse Sampling and Smoothing Frame Transition Approach for
Semantic Fast-Forward First-Person Videos | Thanks to the advances in the technology of low-cost digital cameras and the
popularity of the self-recording culture, the amount of visual data on the
Internet is going to the opposite side of the available time and patience of
the users. Thus, most of the uploaded videos are doomed to be forgotten and
unwatched in a computer folder or website. In this work, we address the problem
of creating smooth fast-forward videos without losing the relevant content. We
present a new adaptive frame selection formulated as a weighted minimum
reconstruction problem, which combined with a smoothing frame transition method
accelerates first-person videos emphasizing the relevant segments and avoids
visual discontinuities. The experiments show that our method is able to
fast-forward videos to retain as much relevant information and smoothness as
the state-of-the-art techniques in less time. We also present a new 80-hour
multimodal (RGB-D, IMU, and GPS) dataset of first-person videos with
annotations for recorder profile, frame scene, activities, interaction, and
attention.
| cs.CV | thanks to the advances in the technology of lowcost digital cameras and the popularity of the selfrecording culture the amount of visual data on the internet is going to the opposite side of the available time and patience of the users thus most of the uploaded videos are doomed to be forgotten and unwatched in a computer folder or website in this work we address the problem of creating smooth fastforward videos without losing the relevant content we present a new adaptive frame selection formulated as a weighted minimum reconstruction problem which combined with a smoothing frame transition method accelerates firstperson videos emphasizing the relevant segments and avoids visual discontinuities the experiments show that our method is able to fastforward videos to retain as much relevant information and smoothness as the stateoftheart techniques in less time we also present a new 80hour multimodal rgbd imu and gps dataset of firstperson videos with annotations for recorder profile frame scene activities interaction and attention | [['thanks', 'to', 'the', 'advances', 'in', 'the', 'technology', 'of', 'lowcost', 'digital', 'cameras', 'and', 'the', 'popularity', 'of', 'the', 'selfrecording', 'culture', 'the', 'amount', 'of', 'visual', 'data', 'on', 'the', 'internet', 'is', 'going', 'to', 'the', 'opposite', 'side', 'of', 'the', 'available', 'time', 'and', 'patience', 'of', 'the', 'users', 'thus', 'most', 'of', 'the', 'uploaded', 'videos', 'are', 'doomed', 'to', 'be', 'forgotten', 'and', 'unwatched', 'in', 'a', 'computer', 'folder', 'or', 'website', 'in', 'this', 'work', 'we', 'address', 'the', 'problem', 'of', 'creating', 'smooth', 'fastforward', 'videos', 'without', 'losing', 'the', 'relevant', 'content', 'we', 'present', 'a', 'new', 'adaptive', 'frame', 'selection', 'formulated', 'as', 'a', 'weighted', 'minimum', 'reconstruction', 'problem', 'which', 'combined', 'with', 'a', 'smoothing', 'frame', 'transition', 'method', 'accelerates', 'firstperson', 'videos', 'emphasizing', 'the', 'relevant', 'segments', 'and', 'avoids', 'visual', 'discontinuities', 'the', 'experiments', 'show', 'that', 'our', 'method', 'is', 'able', 'to', 'fastforward', 'videos', 'to', 'retain', 'as', 'much', 'relevant', 'information', 'and', 'smoothness', 'as', 'the', 'stateoftheart', 'techniques', 'in', 'less', 'time', 'we', 'also', 'present', 'a', 'new', '80hour', 'multimodal', 'rgbd', 'imu', 'and', 'gps', 'dataset', 'of', 'firstperson', 'videos', 'with', 'annotations', 'for', 'recorder', 'profile', 'frame', 'scene', 'activities', 'interaction', 'and', 'attention']] | [-0.07175743073787329, 0.027195919004895684, -0.07989648929335845, 0.05849330507346236, -0.13273031681002873, -0.15077466489864313, 0.03431624622500074, 0.44232303879821216, -0.26726984873534115, -0.3303982677559058, 0.10813828665798284, -0.30880953587661936, -0.13905611625175524, 0.18365368507538904, -0.19197779231406045, 0.051506465046854, 0.12841523018205808, 0.08357086418630005, -0.051067867882274465, -0.27352821178084136, 0.2662782677633793, 0.05749566781879315, 0.29516797097481834, 0.03148371605905441, 0.15295560153804533, 0.0029728890509409067, -0.09335551320709898, -0.014301866187520747, -0.07056518637234932, 0.17258153215003838, 0.29853598056866276, 0.198118745926299, 0.33297445304375495, -0.44797605540861124, -0.2162652359279634, 0.04025170019441197, 0.15514664851281346, 0.12135307370676254, -0.10089642842484743, -0.382957273531916, 0.06747725004851583, -0.16017703885529572, -0.023653140853879588, -0.06645497685714197, 0.03373694800590194, -0.001303257025286274, -0.2505363416653009, 0.037756986366753294, 0.024326792921074345, 0.08203072348351842, -0.05493702078618859, -0.03983132378344641, 0.010203809818580933, 0.2300635077873444, 0.07484306686458254, 0.06459039934609179, 0.1526336812153576, -0.20574992907573264, -0.08735540215183729, 0.42407742851419644, -0.04549041489555073, -0.17893478554913644, 0.1822421812985397, -0.06266875633583316, -0.09701686933835817, 0.12768169445038405, 0.22271793652560162, 0.14891542564292656, -0.16262933444934632, -0.007572572542509685, -0.040595936193570215, 0.19279786586869835, 0.07520698310379759, 0.03470638465815745, 0.1814391408701363, 0.21866971284514233, 0.06275261814102719, 0.1042789949159835, -0.12491831842827487, -0.057844717859483835, -0.23676256360647227, -0.1427549791739047, -0.20124495520883198, -0.044270452750413296, -0.07823485667231923, -0.12058774809464344, 0.3894187409676752, 0.2435635069645824, 0.19405612690555835, 0.08163217890424854, 0.3654170202343203, 0.0009658917471321311, 0.10838180448590491, 0.06222335056477935, 0.13710833617717427, -0.025256104087867076, 0.23526787592109832, -0.16090867864612327, 0.06744405077536057, 0.0583786498667356] |
1,802.08723 | Reactive species involved in higher seeds germination and shoots vigor
through direct plasma exposure and plasma-activated liquids | Cold atmospheric plasma treatments have been applied on lenses seeds and
shoots to improve their germination and vigor rates. Two approaches have been
considered: direct plasma exposure and plasma activation of liquids (tap water,
demineralized water and liquid fertilizer). A special focus has been drawn on
reactive oxygen species generated in the plasma phase but also in plasma
activated media to understand their impact on germination process as well as on
plants growth.
| q-bio.OT physics.app-ph physics.plasm-ph | cold atmospheric plasma treatments have been applied on lenses seeds and shoots to improve their germination and vigor rates two approaches have been considered direct plasma exposure and plasma activation of liquids tap water demineralized water and liquid fertilizer a special focus has been drawn on reactive oxygen species generated in the plasma phase but also in plasma activated media to understand their impact on germination process as well as on plants growth | [['cold', 'atmospheric', 'plasma', 'treatments', 'have', 'been', 'applied', 'on', 'lenses', 'seeds', 'and', 'shoots', 'to', 'improve', 'their', 'germination', 'and', 'vigor', 'rates', 'two', 'approaches', 'have', 'been', 'considered', 'direct', 'plasma', 'exposure', 'and', 'plasma', 'activation', 'of', 'liquids', 'tap', 'water', 'demineralized', 'water', 'and', 'liquid', 'fertilizer', 'a', 'special', 'focus', 'has', 'been', 'drawn', 'on', 'reactive', 'oxygen', 'species', 'generated', 'in', 'the', 'plasma', 'phase', 'but', 'also', 'in', 'plasma', 'activated', 'media', 'to', 'understand', 'their', 'impact', 'on', 'germination', 'process', 'as', 'well', 'as', 'on', 'plants', 'growth']] | [-0.015485937573168783, 0.21260303783243242, -0.045102842343486334, 0.03294388069672058, -0.01088274607741057, -0.12421382017663285, 0.04676866130775785, 0.44377116775395326, -0.17664743865495675, -0.3063793737849552, 0.1353434021297638, -0.29880005499820084, -0.060037206662244685, 0.19467278074454006, -0.013115660306576588, 0.08096590112537554, -0.011891216894433107, -0.03230220066664154, 0.07035508193075657, -0.2555578268349987, 0.23565490083284166, 0.11174926340375861, 0.31473015202847243, 0.12079177813425865, 0.11720205962096583, -0.0913774248289123, -0.039911891021191664, 0.019329884408475603, -0.14221908316021778, -0.03295295816297605, 0.24591399132184785, 0.07172802329854402, 0.248764948307039, -0.5511031479459919, -0.36557001712387555, 0.05293442939140209, 0.14121412495725266, 0.0862936506124392, -0.10650889975439808, -0.2107906542903399, -0.02629199475432708, -0.20166659834858489, -0.056804690943801237, -0.006147824171994341, 0.01788860910079938, 0.07957727514719272, -0.2221329493052645, 0.044168133444506805, -0.0007170239361385777, 0.0814573581183763, -0.08204206783796521, -0.19315359703175825, -0.08455625198437028, 0.13408159515629076, 0.101744649178677, -0.012398639457836135, 0.3022583237249557, -0.1277598824020322, -0.03330796852401675, 0.39844811479369663, -0.043648604858564595, -0.13283225198671833, 0.2957300946167479, -0.14376917822375793, -0.10559595674786666, 0.18660962124425307, 0.25176421856533177, 0.10082647535505015, -0.16651554750151012, -0.045787769360212636, -0.010781605995885313, 0.11100978710471768, 0.18373654433845044, -0.008575118347772793, 0.2335988302932006, 0.2194229840390282, 0.0027101169314796792, 0.09993727321494116, -0.06047383894863194, -0.029201933909973055, -0.08878510509783478, -0.1503082022377073, -0.10625989019411476, 0.0006460229840690959, 0.012135901057387842, -0.18104293319868714, 0.35621540404039703, 0.10933219376801552, 0.09886024591882955, -0.07556269178804878, 0.2508193482070753, 0.03810163390542036, 0.05406025992961575, -0.013220526645604316, 0.2542739741772107, 0.1620323581442441, 0.16178620093795534, -0.23536683241071257, 0.19011535606831823, 0.026607785817261222] |
1,802.08724 | A Weighted POD Method for Elliptic PDEs with Random Inputs | In this work we propose and analyze a weighted proper orthogonal
decomposition method to solve elliptic partial differential equations depending
on random input data, for stochastic problems that can be transformed into
parametric systems. The algorithm is introduced alongside the weighted greedy
method. Our proposed method aims to minimize the error in a $L^2$ norm and, in
contrast to the weighted greedy approach, it does not require the availability
of an error bound. Moreover, we consider sparse discretization of the input
space in the construction of the reduced model; for high-dimensional problems,
provided the sampling is done accordingly to the parameters distribution, this
enables a sensible reduction of computational costs, while keeping a very good
accuracy with respect to high fidelity solutions. We provide many numerical
tests to asses the performance of the proposed method compared to an equivalent
reduced order model without weighting, as well as to the weighted greedy
approach, in both low and higher dimensional problems.
| math.NA | in this work we propose and analyze a weighted proper orthogonal decomposition method to solve elliptic partial differential equations depending on random input data for stochastic problems that can be transformed into parametric systems the algorithm is introduced alongside the weighted greedy method our proposed method aims to minimize the error in a l2 norm and in contrast to the weighted greedy approach it does not require the availability of an error bound moreover we consider sparse discretization of the input space in the construction of the reduced model for highdimensional problems provided the sampling is done accordingly to the parameters distribution this enables a sensible reduction of computational costs while keeping a very good accuracy with respect to high fidelity solutions we provide many numerical tests to asses the performance of the proposed method compared to an equivalent reduced order model without weighting as well as to the weighted greedy approach in both low and higher dimensional problems | [['in', 'this', 'work', 'we', 'propose', 'and', 'analyze', 'a', 'weighted', 'proper', 'orthogonal', 'decomposition', 'method', 'to', 'solve', 'elliptic', 'partial', 'differential', 'equations', 'depending', 'on', 'random', 'input', 'data', 'for', 'stochastic', 'problems', 'that', 'can', 'be', 'transformed', 'into', 'parametric', 'systems', 'the', 'algorithm', 'is', 'introduced', 'alongside', 'the', 'weighted', 'greedy', 'method', 'our', 'proposed', 'method', 'aims', 'to', 'minimize', 'the', 'error', 'in', 'a', 'l2', 'norm', 'and', 'in', 'contrast', 'to', 'the', 'weighted', 'greedy', 'approach', 'it', 'does', 'not', 'require', 'the', 'availability', 'of', 'an', 'error', 'bound', 'moreover', 'we', 'consider', 'sparse', 'discretization', 'of', 'the', 'input', 'space', 'in', 'the', 'construction', 'of', 'the', 'reduced', 'model', 'for', 'highdimensional', 'problems', 'provided', 'the', 'sampling', 'is', 'done', 'accordingly', 'to', 'the', 'parameters', 'distribution', 'this', 'enables', 'a', 'sensible', 'reduction', 'of', 'computational', 'costs', 'while', 'keeping', 'a', 'very', 'good', 'accuracy', 'with', 'respect', 'to', 'high', 'fidelity', 'solutions', 'we', 'provide', 'many', 'numerical', 'tests', 'to', 'asses', 'the', 'performance', 'of', 'the', 'proposed', 'method', 'compared', 'to', 'an', 'equivalent', 'reduced', 'order', 'model', 'without', 'weighting', 'as', 'well', 'as', 'to', 'the', 'weighted', 'greedy', 'approach', 'in', 'both', 'low', 'and', 'higher', 'dimensional', 'problems']] | [-0.057348994022739005, -0.004108580756081713, -0.07720347427863353, 0.07597336964388876, -0.08320915799312668, -0.12692669817720945, 0.06783992029673788, 0.3922337236691196, -0.2946547841413075, -0.32339625982985004, 0.11054128304976127, -0.23365156973108836, -0.14087774594894276, 0.20810932674410068, -0.15151995153945386, 0.13747522894457076, 0.09684013420680784, 0.03575926752187716, -0.11693634068938968, -0.3001315940066047, 0.26777379912376964, 0.07891991535939698, 0.31117267995697895, -0.0005128417316379037, 0.15034031185377156, -0.007259516850840183, -0.0450362283590033, 0.04617140304759209, -0.09586487573436235, 0.1555150406810004, 0.25662845933118705, 0.14879313389237667, 0.32789545451179614, -0.40130608717459926, -0.19799620859488207, 0.14186627612853386, 0.15453700530295167, 0.11752173053129993, 0.00514508847150155, -0.24586686817050543, 0.10687644457965854, -0.15053546243001642, -0.09663245782150694, -0.13261475833865036, -0.08166434252693218, 0.014137982765326873, -0.3456256889867005, 0.05881976561456825, 0.04453699732471679, -0.0030337553837412744, -0.07547423289795904, -0.12482996077610636, 0.033464062455221544, 0.09041867062666178, 0.024761802410712734, 0.04467258152241508, 0.037442644289987594, -0.09617835807281074, -0.1288988627610529, 0.3999139811347953, -0.07529972612809495, -0.29503686998461215, 0.1478008199307435, -0.06647521690260502, -0.1219896595491647, 0.13989168799953805, 0.2400479055340724, 0.134139575497628, -0.12229624814090301, 0.054657635976576524, -0.0082061028096286, 0.16405112828558557, 0.029738828610136825, 0.020036051339768577, 0.05531016463536839, 0.18410871018591168, 0.1514435846577457, 0.14937334406005112, -0.05948680005059724, -0.0999191994075927, -0.27101870656669513, -0.12830324906694013, -0.19652255064994398, -0.02754889057614949, -0.12852544887729045, -0.18213032091434742, 0.37214267146978647, 0.17868269872287898, 0.20962238521791068, 0.08751345668046635, 0.33934797191517957, 0.15730420367297301, 0.03180113405394866, 0.07568013921684627, 0.18515600291894949, 0.1247214480880637, 0.08454222961785798, -0.24279722018876118, 0.05519741496990827, 0.1080134431304375] |
1,802.08725 | On the statistics of the polarized submillimetre emission maps from
thermal dust in the turbulent, magnetized, diffuse ISM | [abridged] The interstellar medium is now widely recognized to display
features ascribable to magnetized turbulence. With the public release of Planck
data and the current balloon-borne and ground-based experiments, the growing
amount of data tracing the polarized thermal emission from Galactic dust in the
submillimetre provides choice diagnostics to constrain the properties of this
magnetized turbulence. We aim to constrain these properties in a statistical
way, focusing in particular on the power spectral index of the turbulent
component of the interstellar magnetic field in a diffuse molecular cloud, the
Polaris Flare. We present an analysis framework which is based on simulating
polarized thermal dust emission maps using model dust density (proportional to
gas density) and magnetic field cubes, integrated along the line of sight, and
comparing these statistically to actual data. The model fields are derived from
fBm processes, which allow a precise control of their one- and two-point
statistics. We explore the nine-dimensional parameter space of these models
through a MCMC analysis, which yields best-fitting parameters and associated
uncertainties. We find that the power spectrum of the turbulent component of
the magnetic field in the Polaris Flare molecular cloud scales with wavenumber
as a power law with a spectral index $2.8\pm 0.2$. It complements a uniform
field whose norm in the POS is approximately twice the norm of the fluctuations
of the turbulent component. The density field is well represented by a
log-normally distributed field with a mean gas density $40\,\mathrm{cm}^{-3}$
and a power spectrum with as spectral index $1.7^{+0.4}_{-0.3}$. The agreement
between the Planck data and the simulated maps for these best-fitting
parameters is quantified by a $\chi^2$ value that is only slightly larger than
unity.
| astro-ph.GA | abridged the interstellar medium is now widely recognized to display features ascribable to magnetized turbulence with the public release of planck data and the current balloonborne and groundbased experiments the growing amount of data tracing the polarized thermal emission from galactic dust in the submillimetre provides choice diagnostics to constrain the properties of this magnetized turbulence we aim to constrain these properties in a statistical way focusing in particular on the power spectral index of the turbulent component of the interstellar magnetic field in a diffuse molecular cloud the polaris flare we present an analysis framework which is based on simulating polarized thermal dust emission maps using model dust density proportional to gas density and magnetic field cubes integrated along the line of sight and comparing these statistically to actual data the model fields are derived from fbm processes which allow a precise control of their one and twopoint statistics we explore the ninedimensional parameter space of these models through a mcmc analysis which yields bestfitting parameters and associated uncertainties we find that the power spectrum of the turbulent component of the magnetic field in the polaris flare molecular cloud scales with wavenumber as a power law with a spectral index 28pm 02 it complements a uniform field whose norm in the pos is approximately twice the norm of the fluctuations of the turbulent component the density field is well represented by a lognormally distributed field with a mean gas density 40mathrmcm3 and a power spectrum with as spectral index 1704_03 the agreement between the planck data and the simulated maps for these bestfitting parameters is quantified by a chi2 value that is only slightly larger than unity | [['abridged', 'the', 'interstellar', 'medium', 'is', 'now', 'widely', 'recognized', 'to', 'display', 'features', 'ascribable', 'to', 'magnetized', 'turbulence', 'with', 'the', 'public', 'release', 'of', 'planck', 'data', 'and', 'the', 'current', 'balloonborne', 'and', 'groundbased', 'experiments', 'the', 'growing', 'amount', 'of', 'data', 'tracing', 'the', 'polarized', 'thermal', 'emission', 'from', 'galactic', 'dust', 'in', 'the', 'submillimetre', 'provides', 'choice', 'diagnostics', 'to', 'constrain', 'the', 'properties', 'of', 'this', 'magnetized', 'turbulence', 'we', 'aim', 'to', 'constrain', 'these', 'properties', 'in', 'a', 'statistical', 'way', 'focusing', 'in', 'particular', 'on', 'the', 'power', 'spectral', 'index', 'of', 'the', 'turbulent', 'component', 'of', 'the', 'interstellar', 'magnetic', 'field', 'in', 'a', 'diffuse', 'molecular', 'cloud', 'the', 'polaris', 'flare', 'we', 'present', 'an', 'analysis', 'framework', 'which', 'is', 'based', 'on', 'simulating', 'polarized', 'thermal', 'dust', 'emission', 'maps', 'using', 'model', 'dust', 'density', 'proportional', 'to', 'gas', 'density', 'and', 'magnetic', 'field', 'cubes', 'integrated', 'along', 'the', 'line', 'of', 'sight', 'and', 'comparing', 'these', 'statistically', 'to', 'actual', 'data', 'the', 'model', 'fields', 'are', 'derived', 'from', 'fbm', 'processes', 'which', 'allow', 'a', 'precise', 'control', 'of', 'their', 'one', 'and', 'twopoint', 'statistics', 'we', 'explore', 'the', 'ninedimensional', 'parameter', 'space', 'of', 'these', 'models', 'through', 'a', 'mcmc', 'analysis', 'which', 'yields', 'bestfitting', 'parameters', 'and', 'associated', 'uncertainties', 'we', 'find', 'that', 'the', 'power', 'spectrum', 'of', 'the', 'turbulent', 'component', 'of', 'the', 'magnetic', 'field', 'in', 'the', 'polaris', 'flare', 'molecular', 'cloud', 'scales', 'with', 'wavenumber', 'as', 'a', 'power', 'law', 'with', 'a', 'spectral', 'index', '28pm', '02', 'it', 'complements', 'a', 'uniform', 'field', 'whose', 'norm', 'in', 'the', 'pos', 'is', 'approximately', 'twice', 'the', 'norm', 'of', 'the', 'fluctuations', 'of', 'the', 'turbulent', 'component', 'the', 'density', 'field', 'is', 'well', 'represented', 'by', 'a', 'lognormally', 'distributed', 'field', 'with', 'a', 'mean', 'gas', 'density', '40mathrmcm3', 'and', 'a', 'power', 'spectrum', 'with', 'as', 'spectral', 'index', '1704_03', 'the', 'agreement', 'between', 'the', 'planck', 'data', 'and', 'the', 'simulated', 'maps', 'for', 'these', 'bestfitting', 'parameters', 'is', 'quantified', 'by', 'a', 'chi2', 'value', 'that', 'is', 'only', 'slightly', 'larger', 'than', 'unity']] | [-0.08763938072534865, 0.12457170316818097, -0.09429506407025695, 0.06824512034021925, -0.05612796920531369, -0.045315120893908475, -0.004949442326492778, 0.38664984023879684, -0.25497490893125674, -0.33881834320187487, 0.078778265952217, -0.27100229395411746, -0.026440399344605597, 0.20835046111049293, 0.023242864551465955, 0.032722251006381826, 0.006014090180700726, -0.04772672054874103, -0.00984651553385513, -0.17201175273689645, 0.3155323452711868, 0.13264626346569022, 0.2548953257129946, -0.007445469885420027, 0.05981274412740764, -0.08542290127640455, -0.0914310233876703, 0.031178360354755096, -0.149103362477088, 0.12117574634485999, 0.18588482388900773, 0.0987365717166171, 0.1905216193265295, -0.38139905179074657, -0.2653692545153309, 0.09446233723471212, 0.1378373855377372, 0.033863985290551776, -0.024712409345817792, -0.23902805210968506, 0.032328750533886945, -0.15248665091854965, -0.15906381219510746, -0.00544026701549149, 0.02451990623165435, 0.051581810252147094, -0.2928424784854608, 0.1193003738315884, -0.000627928580481397, 0.09952330682426691, -0.08838640408846887, -0.0945267324788037, -0.05989121716297434, 0.07638348838773326, 0.050883441820970154, 0.07539884963678534, 0.19884478227628488, -0.1562996195845198, -0.03705221049207519, 0.39735902731932793, -0.10936488768287667, -0.11038533223398954, 0.14655035241351774, -0.1912016534867386, -0.1399307101695002, 0.16229061657424504, 0.15173870009923543, 0.06547629936700843, -0.13208738146046095, 0.050339523805777775, -0.03860566367718317, 0.22888713186198467, 0.0015442924906391704, 0.026044420466227482, 0.2688616127177712, 0.12042962646439159, 0.04996990540024379, 0.13289328598909997, -0.18687971817195395, -0.08588456160868045, -0.2557111757590631, -0.1200468134787946, -0.18412196336557035, 0.05786155417065501, -0.14093792336221878, -0.16606817044742891, 0.39307741290025844, 0.15565196306282736, 0.2097963526038507, 0.035357739909238226, 0.3522933856179209, 0.12179200346253165, 0.06724953052732904, 0.13090975801173624, 0.26117543649076874, 0.19154592809449558, 0.12973028746015136, -0.20978088141334633, 0.03656270157923733, -0.0013075425623632643] |
1,802.08726 | Longitudinal Face Aging in the Wild - Recent Deep Learning Approaches | Face Aging has raised considerable attentions and interest from the computer
vision community in recent years. Numerous approaches ranging from purely image
processing techniques to deep learning structures have been proposed in
literature. In this paper, we aim to give a review of recent developments of
modern deep learning based approaches, i.e. Deep Generative Models, for Face
Aging task. Their structures, formulation, learning algorithms as well as
synthesized results are also provided with systematic discussions. Moreover,
the aging databases used in most methods to learn the aging process are also
reviewed.
| cs.CV | face aging has raised considerable attentions and interest from the computer vision community in recent years numerous approaches ranging from purely image processing techniques to deep learning structures have been proposed in literature in this paper we aim to give a review of recent developments of modern deep learning based approaches ie deep generative models for face aging task their structures formulation learning algorithms as well as synthesized results are also provided with systematic discussions moreover the aging databases used in most methods to learn the aging process are also reviewed | [['face', 'aging', 'has', 'raised', 'considerable', 'attentions', 'and', 'interest', 'from', 'the', 'computer', 'vision', 'community', 'in', 'recent', 'years', 'numerous', 'approaches', 'ranging', 'from', 'purely', 'image', 'processing', 'techniques', 'to', 'deep', 'learning', 'structures', 'have', 'been', 'proposed', 'in', 'literature', 'in', 'this', 'paper', 'we', 'aim', 'to', 'give', 'a', 'review', 'of', 'recent', 'developments', 'of', 'modern', 'deep', 'learning', 'based', 'approaches', 'ie', 'deep', 'generative', 'models', 'for', 'face', 'aging', 'task', 'their', 'structures', 'formulation', 'learning', 'algorithms', 'as', 'well', 'as', 'synthesized', 'results', 'are', 'also', 'provided', 'with', 'systematic', 'discussions', 'moreover', 'the', 'aging', 'databases', 'used', 'in', 'most', 'methods', 'to', 'learn', 'the', 'aging', 'process', 'are', 'also', 'reviewed']] | [0.034523669098104746, -0.01728520502981085, -0.10457369679032447, 0.024166753911641126, -0.12011956197342702, -0.15214673630831824, -0.04379064937577593, 0.4834094156900032, -0.28280130206417947, -0.33820093017849295, 0.12730428234643335, -0.27988977900163814, -0.2662290634259909, 0.23567123905561127, -0.18469014656243865, 0.15412000350904867, 0.11276316499480835, 0.01678280807151408, -0.07926263347790055, -0.3259918612407541, 0.26263385863749533, 0.04553181884693913, 0.35801243262140303, 0.05279398974092616, 0.08086633704606556, -0.05394667689560575, -0.07243855321104382, 0.016877219817795597, -0.13897310322211995, 0.20879021076137547, 0.3806200982959366, 0.23189543805514964, 0.3560779993217643, -0.4836567162157415, -0.2908964494888026, 0.08788444231786244, 0.15118697205312795, 0.14972831401973963, -0.13261453188177977, -0.31984267097253066, 0.05530214320950128, -0.1820052670478657, 0.03621471697300836, -0.1432190603118615, 0.047631161737736766, -0.023127197554068907, -0.1686400029972032, 0.004293664547251435, 0.08311675157357049, 0.13851490444861925, -0.044867967710840506, -0.19606349392087905, 0.11351384400840399, 0.17370346243810522, 0.1294212766745829, 0.06221321017921462, 0.13946956062975985, -0.21715971367730463, -0.2196743493838297, 0.3648671088842573, -0.0020629454731613726, -0.10694907014872265, 0.26359060395682987, -0.0165152008988086, -0.235333171181872, 0.09179138207992354, 0.2680192871510491, 0.10748719553985112, -0.19123242014589217, 0.07266371275469723, 0.0013001810370402021, 0.10240330771225822, 0.011524036792772157, 0.024475555334772383, 0.20420817123050547, 0.2688332547198285, -0.0533695442750436, 0.10224878087711449, -0.0809628130013512, -0.11792610144590611, -0.1355258758988354, -0.05874563942939698, -0.17006340833728786, -0.007872315410238046, -0.01003847412421537, -0.12399984014193031, 0.35635946809754265, 0.23946446517052558, 0.21013388598521987, 0.04696498273431764, 0.33338667474850847, 0.013297376783237188, 0.12910846122642877, 0.04344188711531767, 0.21400553076962972, 0.11163376191897052, 0.2062965992858613, -0.09528315896654481, 0.08927210660620623, 0.01747629735209457] |
1,802.08727 | Bayesian Semiparametric Functional Mixed Models for Serially Correlated
Functional Data, with Application to Glaucoma Data | Glaucoma, a leading cause of blindness, is characterized by optic nerve
damage related to intraocular pressure (IOP), but its full etiology is unknown.
Researchers at UAB have devised a custom device to measure scleral strain
continuously around the eye under fixed levels of IOP, which here is used to
assess how strain varies around the posterior pole, with IOP, and across
glaucoma risk factors such as age. The hypothesis is that scleral strain
decreases with age, which could alter biomechanics of the optic nerve head and
cause damage that could eventually lead to glaucoma. To evaluate this
hypothesis, we adapted Bayesian Functional Mixed Models to model these complex
data consisting of correlated functions on spherical scleral surface, with
nonparametric age effects allowed to vary in magnitude and smoothness across
the scleral surface, multi-level random effect functions to capture
within-subject correlation, and functional growth curve terms to capture serial
correlation across IOPs that can vary around the scleral surface. Our method
yields fully Bayesian inference on the scleral surface or any aggregation or
transformation thereof, and reveals interesting insights into the biomechanical
etiology of glaucoma. The general modeling framework described is very flexible
and applicable to many complex, high-dimensional functional data.
| stat.ME | glaucoma a leading cause of blindness is characterized by optic nerve damage related to intraocular pressure iop but its full etiology is unknown researchers at uab have devised a custom device to measure scleral strain continuously around the eye under fixed levels of iop which here is used to assess how strain varies around the posterior pole with iop and across glaucoma risk factors such as age the hypothesis is that scleral strain decreases with age which could alter biomechanics of the optic nerve head and cause damage that could eventually lead to glaucoma to evaluate this hypothesis we adapted bayesian functional mixed models to model these complex data consisting of correlated functions on spherical scleral surface with nonparametric age effects allowed to vary in magnitude and smoothness across the scleral surface multilevel random effect functions to capture withinsubject correlation and functional growth curve terms to capture serial correlation across iops that can vary around the scleral surface our method yields fully bayesian inference on the scleral surface or any aggregation or transformation thereof and reveals interesting insights into the biomechanical etiology of glaucoma the general modeling framework described is very flexible and applicable to many complex highdimensional functional data | [['glaucoma', 'a', 'leading', 'cause', 'of', 'blindness', 'is', 'characterized', 'by', 'optic', 'nerve', 'damage', 'related', 'to', 'intraocular', 'pressure', 'iop', 'but', 'its', 'full', 'etiology', 'is', 'unknown', 'researchers', 'at', 'uab', 'have', 'devised', 'a', 'custom', 'device', 'to', 'measure', 'scleral', 'strain', 'continuously', 'around', 'the', 'eye', 'under', 'fixed', 'levels', 'of', 'iop', 'which', 'here', 'is', 'used', 'to', 'assess', 'how', 'strain', 'varies', 'around', 'the', 'posterior', 'pole', 'with', 'iop', 'and', 'across', 'glaucoma', 'risk', 'factors', 'such', 'as', 'age', 'the', 'hypothesis', 'is', 'that', 'scleral', 'strain', 'decreases', 'with', 'age', 'which', 'could', 'alter', 'biomechanics', 'of', 'the', 'optic', 'nerve', 'head', 'and', 'cause', 'damage', 'that', 'could', 'eventually', 'lead', 'to', 'glaucoma', 'to', 'evaluate', 'this', 'hypothesis', 'we', 'adapted', 'bayesian', 'functional', 'mixed', 'models', 'to', 'model', 'these', 'complex', 'data', 'consisting', 'of', 'correlated', 'functions', 'on', 'spherical', 'scleral', 'surface', 'with', 'nonparametric', 'age', 'effects', 'allowed', 'to', 'vary', 'in', 'magnitude', 'and', 'smoothness', 'across', 'the', 'scleral', 'surface', 'multilevel', 'random', 'effect', 'functions', 'to', 'capture', 'withinsubject', 'correlation', 'and', 'functional', 'growth', 'curve', 'terms', 'to', 'capture', 'serial', 'correlation', 'across', 'iops', 'that', 'can', 'vary', 'around', 'the', 'scleral', 'surface', 'our', 'method', 'yields', 'fully', 'bayesian', 'inference', 'on', 'the', 'scleral', 'surface', 'or', 'any', 'aggregation', 'or', 'transformation', 'thereof', 'and', 'reveals', 'interesting', 'insights', 'into', 'the', 'biomechanical', 'etiology', 'of', 'glaucoma', 'the', 'general', 'modeling', 'framework', 'described', 'is', 'very', 'flexible', 'and', 'applicable', 'to', 'many', 'complex', 'highdimensional', 'functional', 'data']] | [-0.04751981944951694, 0.09544147974811494, -0.11033188974950463, 0.0859355419059284, -0.08477108679595403, -0.15609893172746525, 0.03885002549737692, 0.3983271155576222, -0.2855114923091605, -0.2995352125429781, 0.08293861936486792, -0.24240829582093285, -0.18742781004635617, 0.19213844831683674, -0.14296351948782104, 0.02404684705630643, 0.029253569854190573, 0.003596849862951785, -0.0370576994062867, -0.20782745373435318, 0.2722465988295153, 0.05960536705097184, 0.3157606219674926, 0.05696824957238277, 0.08791445003007539, 0.0347108241636306, -0.0270377077232115, 0.012289808174828068, -0.11810005223316694, 0.1189540223509539, 0.27645694397471743, 0.124907471742481, 0.2896610988932662, -0.4234678926412016, -0.24220846930984408, 0.0880308467845316, 0.1161708628560882, 0.0518711060739588, 0.02528329843946267, -0.268538438329706, 0.07252158183546271, -0.15544143063947558, -0.13570769218960776, -0.08468695241957903, -0.007547183119459078, -0.003948933089559432, -0.26807575493352487, 0.14060067651915234, -0.011977320939768105, 0.09252534860512242, -0.09163891915522981, -0.10559870745462831, -0.06406916130683385, 0.15605799237731843, 0.07073285907681566, 0.06839751987485215, 0.22105792324291543, -0.10424894227147888, -0.0555087177810492, 0.32573030606843534, -0.021916966036660598, -0.19673244366655127, 0.19629039183433633, -0.1323540794150904, -0.10919113638345151, 0.153141703363508, 0.23150269128382206, 0.055888809984899125, -0.15489901611348614, 9.061798631591955e-05, 0.08180730139894876, 0.18307170304935425, 0.09012712091207505, -0.03441136859677499, 0.19255006722174584, 0.17274439179105683, 0.022697162358963397, 0.09528030164074153, -0.13019679215038196, -0.07854569335584528, -0.21653673704015092, -0.13072582532069646, -0.10255825751915836, 0.021224078483064658, -0.10536019794133608, -0.2463612041529268, 0.38849679904058576, 0.14491953840479255, 0.14718385017244145, 0.04358835129489307, 0.24030184186063708, 0.060901650633313695, 0.13370643499249127, 0.011877364357933401, 0.17076038863044232, 0.09562374821049162, 0.042148226015269755, -0.21524300630320795, 0.18275721693586092, -0.03290404695377219] |
1,802.08728 | Unraveling open-system quantum dynamics of non-interacting Fermions | The Lindblad equation is commonly used for studying quantum dynamics in open
systems that cannot be completely isolated from an environment, relevant to a
broad variety of research fields, such as atomic physics, materials science,
quantum biology and quantum information and computing. For electrons in
condensed matter systems, the Lindblad dynamics is intractable even if their
mutual Coulomb repulsion could somehow be switched off. This is because they
would still be able to affect each other by interacting with the bath. Here, we
develop an approximate approach, based on the Hubbard-Stratonovich
transformation, which allows to evolve non-interacting Fermions in open quantum
systems. We discuss several applications for systems of trapped 1D Fermions
showing promising results.
| quant-ph cond-mat.mtrl-sci cond-mat.stat-mech | the lindblad equation is commonly used for studying quantum dynamics in open systems that cannot be completely isolated from an environment relevant to a broad variety of research fields such as atomic physics materials science quantum biology and quantum information and computing for electrons in condensed matter systems the lindblad dynamics is intractable even if their mutual coulomb repulsion could somehow be switched off this is because they would still be able to affect each other by interacting with the bath here we develop an approximate approach based on the hubbardstratonovich transformation which allows to evolve noninteracting fermions in open quantum systems we discuss several applications for systems of trapped 1d fermions showing promising results | [['the', 'lindblad', 'equation', 'is', 'commonly', 'used', 'for', 'studying', 'quantum', 'dynamics', 'in', 'open', 'systems', 'that', 'can', 'not', 'be', 'completely', 'isolated', 'from', 'an', 'environment', 'relevant', 'to', 'a', 'broad', 'variety', 'of', 'research', 'fields', 'such', 'as', 'atomic', 'physics', 'materials', 'science', 'quantum', 'biology', 'and', 'quantum', 'information', 'and', 'computing', 'for', 'electrons', 'in', 'condensed', 'matter', 'systems', 'the', 'lindblad', 'dynamics', 'is', 'intractable', 'even', 'if', 'their', 'mutual', 'coulomb', 'repulsion', 'could', 'somehow', 'be', 'switched', 'off', 'this', 'is', 'because', 'they', 'would', 'still', 'be', 'able', 'to', 'affect', 'each', 'other', 'by', 'interacting', 'with', 'the', 'bath', 'here', 'we', 'develop', 'an', 'approximate', 'approach', 'based', 'on', 'the', 'hubbardstratonovich', 'transformation', 'which', 'allows', 'to', 'evolve', 'noninteracting', 'fermions', 'in', 'open', 'quantum', 'systems', 'we', 'discuss', 'several', 'applications', 'for', 'systems', 'of', 'trapped', '1d', 'fermions', 'showing', 'promising', 'results']] | [-0.10590378437110962, 0.1969244205857053, -0.10313727296808542, 0.09238820794241198, -0.05652706586787927, -0.21653862871984342, -0.0058065383606750905, 0.352414897771488, -0.2996663132136495, -0.28841551751347966, 0.06481521271654919, -0.27653181672727, -0.15886551988359285, 0.24132601993062117, -0.019045775371868613, 0.06298027903740776, 0.049938900510636, 0.006772056663537334, -0.04622066493049778, -0.2570824265150867, 0.2855815337649707, 0.022320260679156614, 0.22165551743518305, 0.07684532320528323, 0.040029896812609815, 0.019062026166999393, 0.07871451085947197, -8.229468949139118e-05, -0.0918687817358722, 0.09415544910157693, 0.3165024703143743, 0.08029559854787358, 0.26996479425900455, -0.48464777087792754, -0.22921504129671716, 0.09770896478459754, 0.22097857462659734, 0.19106552237644792, -0.08487789407231973, -0.32204996309532175, -0.01108366765226398, -0.16930763625764642, -0.16153305705138965, -0.12887738098727602, 0.013879381208519998, 0.006585079040538905, -0.20426061561788786, 0.05784179501100378, 0.061701913754624346, 0.02833168187724619, -0.036160929165158326, -0.06278601842370399, 0.03807578828378484, 0.1277994015936515, -0.041538884768920856, -0.000400793817946045, 0.204062119989399, -0.16941942975671706, -0.13041866081365353, 0.42449547983063707, -0.0383255921268097, -0.22025233691815158, 0.28445602768173056, -0.09752084531596508, -0.1377999133687338, 0.080892872755769, 0.17083092327410324, 0.07764321504610366, -0.22749412995923696, 0.11889542503170027, -0.010900691838067925, 0.1548668343216534, -0.012649161636765147, 0.07779021290179085, 0.3064753997725724, 0.13909396205643385, 0.04800832842813869, 0.1270445740158501, -0.0045380183086120365, -0.1838292504845444, -0.21622733595973714, -0.1735841080682866, -0.21813669518952997, 0.09288902273855738, -0.0005304971386192784, -0.15801682148192978, 0.3378856860711902, 0.19891886906457487, 0.12991503310381788, -0.06809507182032544, 0.2688420147490527, 0.1483952375640691, 0.06564612920066856, 0.09124452899338613, 0.23669581346470733, 0.150343779926108, 0.06885652628261596, -0.22934166416686413, 0.0028934368205353104, -0.0036278135737339997] |
1,802.08729 | Review: Metaheuristic Search-Based Fuzzy Clustering Algorithms | Fuzzy clustering is a famous unsupervised learning method used to collecting
similar data elements within cluster according to some similarity measurement.
But, clustering algorithms suffer from some drawbacks. Among the main weakness
including, selecting the initial cluster centres and the appropriate clusters
number is normally unknown. These weaknesses are considered the most
challenging tasks in clustering algorithms. This paper introduces a
comprehensive review of metahueristic search to solve fuzzy clustering
algorithms problems.
| cs.NE cs.LG | fuzzy clustering is a famous unsupervised learning method used to collecting similar data elements within cluster according to some similarity measurement but clustering algorithms suffer from some drawbacks among the main weakness including selecting the initial cluster centres and the appropriate clusters number is normally unknown these weaknesses are considered the most challenging tasks in clustering algorithms this paper introduces a comprehensive review of metahueristic search to solve fuzzy clustering algorithms problems | [['fuzzy', 'clustering', 'is', 'a', 'famous', 'unsupervised', 'learning', 'method', 'used', 'to', 'collecting', 'similar', 'data', 'elements', 'within', 'cluster', 'according', 'to', 'some', 'similarity', 'measurement', 'but', 'clustering', 'algorithms', 'suffer', 'from', 'some', 'drawbacks', 'among', 'the', 'main', 'weakness', 'including', 'selecting', 'the', 'initial', 'cluster', 'centres', 'and', 'the', 'appropriate', 'clusters', 'number', 'is', 'normally', 'unknown', 'these', 'weaknesses', 'are', 'considered', 'the', 'most', 'challenging', 'tasks', 'in', 'clustering', 'algorithms', 'this', 'paper', 'introduces', 'a', 'comprehensive', 'review', 'of', 'metahueristic', 'search', 'to', 'solve', 'fuzzy', 'clustering', 'algorithms', 'problems']] | [-0.05496920853472826, -0.016813960831454942, -0.08054114374476419, 0.1343749629392643, -0.15703451428496817, -0.16509849780147345, 0.03973177150810059, 0.4264789233640046, -0.2903570184356231, -0.3767808242700994, 0.10659772984545783, -0.2927337642234396, -0.1344855319656117, 0.14639082146664215, -0.12351496322539596, 0.07262338154365532, 0.09844205281893972, 0.03701553659015138, -0.06177865509698036, -0.31420844533762726, 0.3327189487680583, 0.026300672140024916, 0.3227736886695657, -0.05329391667225831, 0.07696069866372929, -0.015381488667040224, -0.1326171122032257, 0.0629654365326696, -0.07159156488700652, 0.16176908264267847, 0.36254482343792915, 0.250341122701082, 0.3730325846552429, -0.3244751667682554, -0.16030488705301893, 0.16306314957787243, 0.2133036376580491, 0.11807715678325212, -0.08421172877170251, -0.28481569083433755, 0.09891946842028222, -0.10597463592257299, -0.05757818991501986, -0.08887385748798998, -0.008711979317833001, 0.06008310154290267, -0.19899793552943099, 0.06944052611385852, 0.01790469572026755, 0.014663947523164918, -0.0590074032440152, -0.18869368060373923, 0.13859828600896076, 0.11184100060343323, 0.053516860100322625, 0.018035173252172455, 0.17328049297588813, -0.12174336905722362, -0.16257935856849376, 0.41780754616877563, 0.0799674256245645, -0.1597251527103215, 0.24181008889851435, 0.029142287704096714, -0.2710915935999701, 0.08000886326157292, 0.1946392320883526, 0.11458695683182335, -0.20379251456806358, 0.024917659958870426, 0.000289429871129318, 0.16253476894237626, 0.044848483964197446, 0.010245242962797343, 0.16047824573339106, 0.2098817720379628, 0.07148914134890681, 0.11987940418127348, -0.08362290326138618, -0.09500230121439401, -0.2081293403367761, -0.04141241752765548, -0.19602417749759388, -0.0665503110946484, -0.12783967144110955, -0.19659601066681281, 0.3636308001275633, 0.24386957012326785, 0.22829441781300056, 0.012240467133971167, 0.36398854681198867, 0.034348073940146974, 0.09611659676482587, 0.07912343013769305, 0.19224793142655497, 0.11654359710888124, 0.07919761811343717, -0.17979546244794004, 0.07661601433753443, 0.07365063039428542] |
1,802.0873 | Elasticity Detection: A Building Block for Internet Congestion Control | This paper introduces Nimbus, a robust technique to detect whether the cross
traffic competing with a flow is "elastic", and shows that this elasticity
detector improves congestion control. If cross traffic is inelastic, then a
sender can control queueing delays while achieving high throughput, but in the
presence of elastic traffic, it may lose throughput if it attempts to control
packet delay. To estimate elasticity, Nimbus modulates the flow's sending rate
with sinusoidal pulses that create small traffic fluctuations at the bottleneck
link, and measures the frequency response of the rate of the cross traffic. Our
results on emulated and real-world paths show that congestion control using
elasticity detection achieves throughput comparable to Cubic, but with delays
that are 50-70 ms lower when cross traffic is inelastic. Nimbus detects the
nature of the cross traffic more accurately than Copa, and is usable as a
building block by other end-to-end algorithms.
| cs.NI | this paper introduces nimbus a robust technique to detect whether the cross traffic competing with a flow is elastic and shows that this elasticity detector improves congestion control if cross traffic is inelastic then a sender can control queueing delays while achieving high throughput but in the presence of elastic traffic it may lose throughput if it attempts to control packet delay to estimate elasticity nimbus modulates the flows sending rate with sinusoidal pulses that create small traffic fluctuations at the bottleneck link and measures the frequency response of the rate of the cross traffic our results on emulated and realworld paths show that congestion control using elasticity detection achieves throughput comparable to cubic but with delays that are 5070 ms lower when cross traffic is inelastic nimbus detects the nature of the cross traffic more accurately than copa and is usable as a building block by other endtoend algorithms | [['this', 'paper', 'introduces', 'nimbus', 'a', 'robust', 'technique', 'to', 'detect', 'whether', 'the', 'cross', 'traffic', 'competing', 'with', 'a', 'flow', 'is', 'elastic', 'and', 'shows', 'that', 'this', 'elasticity', 'detector', 'improves', 'congestion', 'control', 'if', 'cross', 'traffic', 'is', 'inelastic', 'then', 'a', 'sender', 'can', 'control', 'queueing', 'delays', 'while', 'achieving', 'high', 'throughput', 'but', 'in', 'the', 'presence', 'of', 'elastic', 'traffic', 'it', 'may', 'lose', 'throughput', 'if', 'it', 'attempts', 'to', 'control', 'packet', 'delay', 'to', 'estimate', 'elasticity', 'nimbus', 'modulates', 'the', 'flows', 'sending', 'rate', 'with', 'sinusoidal', 'pulses', 'that', 'create', 'small', 'traffic', 'fluctuations', 'at', 'the', 'bottleneck', 'link', 'and', 'measures', 'the', 'frequency', 'response', 'of', 'the', 'rate', 'of', 'the', 'cross', 'traffic', 'our', 'results', 'on', 'emulated', 'and', 'realworld', 'paths', 'show', 'that', 'congestion', 'control', 'using', 'elasticity', 'detection', 'achieves', 'throughput', 'comparable', 'to', 'cubic', 'but', 'with', 'delays', 'that', 'are', '5070', 'ms', 'lower', 'when', 'cross', 'traffic', 'is', 'inelastic', 'nimbus', 'detects', 'the', 'nature', 'of', 'the', 'cross', 'traffic', 'more', 'accurately', 'than', 'copa', 'and', 'is', 'usable', 'as', 'a', 'building', 'block', 'by', 'other', 'endtoend', 'algorithms']] | [-0.20447956842467344, 0.0967552012593175, -0.07175060304502646, 0.028671924547913175, -0.06212007471205046, -0.2012367892699937, 0.09081740190430233, 0.3936994035045306, -0.2731576413381845, -0.30339912086104354, 0.08141799996529396, -0.318982948816071, -0.14053177355982674, 0.20839409921783955, -0.12184577353298665, 0.08115598874321828, 0.0945034993129472, 0.034832690468368434, 0.004351678488310426, -0.26897542137342195, 0.22303322227598982, 0.07822602744524677, 0.36089083351194856, 0.116319483636568, 0.10500881736011555, 0.03098663015756756, -0.003325054614494244, 0.002354794112034142, -0.06257149476849008, 0.09639676201467713, 0.32304471099283544, 0.11969866638692717, 0.22368898306041957, -0.42722125051911763, -0.26678600809536873, 0.10534841760682563, 0.11524311985277261, 0.07723567270829032, 0.003966735514792769, -0.2675418918269376, 0.12237525725426773, -0.180855161609749, -0.06244271707410614, -0.04391347322613001, -0.000872171800583601, 0.06754444250022061, -0.27492362150301536, 0.07037605384442334, -0.01592717131289343, -0.0035055301524698733, -0.033321051749711235, -0.00773705622802178, -0.04037094400885204, 0.12387591541065679, 0.06760597272077576, 0.015168145811185241, 0.1804747612879146, -0.12522185194616517, -0.10071470633770029, 0.40377512817581496, -0.0582472111118841, -0.15895833995658903, 0.1538242801092565, -0.05195446422013144, -0.07101465010860314, 0.22151812085571387, 0.26100249589110414, 0.038421477203567825, -0.17335913640883518, -0.05121866232870768, 0.0007601278539126118, 0.24110449478030205, 0.1088446516636759, 0.028535199688437086, 0.10975196850641321, 0.2506215035325537, 0.1765348571849366, 0.09565768722328358, -0.13949415495153517, -0.09615135934203863, -0.22649642353877425, -0.08793981943279505, -0.11993782351569583, 0.029291256110494334, -0.090047353648503, -0.10040872859225299, 0.333376379609108, 0.15555300245139128, 0.17142906720594814, 0.15867127569702763, 0.4142927467652286, 0.10925635750715931, 0.06695696586742997, 0.16398477068170905, 0.22893880047059306, 0.06573520236493399, 0.1583098414404473, -0.2507072931683312, 0.14600431802061697, -0.019400027816494306] |
1,802.08731 | Automatic Speech Recognition and Topic Identification for
Almost-Zero-Resource Languages | Automatic speech recognition (ASR) systems often need to be developed for
extremely low-resource languages to serve end-uses such as audio content
categorization and search. While universal phone recognition is natural to
consider when no transcribed speech is available to train an ASR system in a
language, adapting universal phone models using very small amounts (minutes
rather than hours) of transcribed speech also needs to be studied, particularly
with state-of-the-art DNN-based acoustic models. The DARPA LORELEI program
provides a framework for such very-low-resource ASR studies, and provides an
extrinsic metric for evaluating ASR performance in a humanitarian assistance,
disaster relief setting. This paper presents our Kaldi-based systems for the
program, which employ a universal phone modeling approach to ASR, and describes
recipes for very rapid adaptation of this universal ASR system. The results we
obtain significantly outperform results obtained by many competing approaches
on the NIST LoReHLT 2017 Evaluation datasets.
| cs.CL | automatic speech recognition asr systems often need to be developed for extremely lowresource languages to serve enduses such as audio content categorization and search while universal phone recognition is natural to consider when no transcribed speech is available to train an asr system in a language adapting universal phone models using very small amounts minutes rather than hours of transcribed speech also needs to be studied particularly with stateoftheart dnnbased acoustic models the darpa lorelei program provides a framework for such verylowresource asr studies and provides an extrinsic metric for evaluating asr performance in a humanitarian assistance disaster relief setting this paper presents our kaldibased systems for the program which employ a universal phone modeling approach to asr and describes recipes for very rapid adaptation of this universal asr system the results we obtain significantly outperform results obtained by many competing approaches on the nist lorehlt 2017 evaluation datasets | [['automatic', 'speech', 'recognition', 'asr', 'systems', 'often', 'need', 'to', 'be', 'developed', 'for', 'extremely', 'lowresource', 'languages', 'to', 'serve', 'enduses', 'such', 'as', 'audio', 'content', 'categorization', 'and', 'search', 'while', 'universal', 'phone', 'recognition', 'is', 'natural', 'to', 'consider', 'when', 'no', 'transcribed', 'speech', 'is', 'available', 'to', 'train', 'an', 'asr', 'system', 'in', 'a', 'language', 'adapting', 'universal', 'phone', 'models', 'using', 'very', 'small', 'amounts', 'minutes', 'rather', 'than', 'hours', 'of', 'transcribed', 'speech', 'also', 'needs', 'to', 'be', 'studied', 'particularly', 'with', 'stateoftheart', 'dnnbased', 'acoustic', 'models', 'the', 'darpa', 'lorelei', 'program', 'provides', 'a', 'framework', 'for', 'such', 'verylowresource', 'asr', 'studies', 'and', 'provides', 'an', 'extrinsic', 'metric', 'for', 'evaluating', 'asr', 'performance', 'in', 'a', 'humanitarian', 'assistance', 'disaster', 'relief', 'setting', 'this', 'paper', 'presents', 'our', 'kaldibased', 'systems', 'for', 'the', 'program', 'which', 'employ', 'a', 'universal', 'phone', 'modeling', 'approach', 'to', 'asr', 'and', 'describes', 'recipes', 'for', 'very', 'rapid', 'adaptation', 'of', 'this', 'universal', 'asr', 'system', 'the', 'results', 'we', 'obtain', 'significantly', 'outperform', 'results', 'obtained', 'by', 'many', 'competing', 'approaches', 'on', 'the', 'nist', 'lorehlt', '2017', 'evaluation', 'datasets']] | [-0.07348511704993951, 0.011670875486136842, -0.037545869857745454, 0.0879685449924889, -0.11331038616157861, -0.23364731761264718, 0.03232933916297043, 0.4100344792370581, -0.19906458176491368, -0.32962100290226065, 0.07828583520636635, -0.28675962767576696, -0.18494773257730734, 0.31992316777500995, -0.17928470609735492, 0.08270396269411624, 0.17172385776615962, 0.06172574970858275, -0.04543760809853362, -0.2693918019730417, 0.23544342241722108, 0.07014053053798205, 0.3839288524274404, 0.019652781885169033, 0.06690419299734963, -0.028841334492123376, -0.026906780932525482, -0.08307762647988663, -0.024925554334105173, 0.16307908545827055, 0.4131512459593978, 0.23512518844088642, 0.2775769386110672, -0.3828282000548724, -0.2261614551858252, 0.0559232407508211, 0.1466291587712476, 0.14018606087494037, -0.0668640804530393, -0.38772678625375395, 0.0988330661631254, -0.24035468156863418, 0.04875353609936105, -0.14911965424350151, 0.02981220818118244, -0.0556848654689222, -0.28971432406736614, 0.010038963801788568, 0.12718218608157864, 0.17189137395730036, -0.0803219351251351, -0.08754283547265611, 0.0838174098033859, 0.19882376419850012, 0.07497290026205722, 0.07404590896072073, 0.14346472706852686, -0.15723245174780864, -0.11383817069387685, 0.43579142786458963, -0.08908225970147517, -0.2119933839009415, 0.26155099571123075, 0.028588047926960927, -0.16445725476175235, 0.05383773428548011, 0.2554105247901235, 0.08189130755878675, -0.24360859624205963, 0.01941073596511463, 0.009371975174872205, 0.2616513233062708, 0.06344323641517097, -0.02570209528089941, 0.174191488151943, 0.2800675813195994, -0.019045639127095153, 0.13721702849498899, -0.07132178925126532, -0.03831663023447618, -0.1661354580363776, -0.10370253751817574, -0.14218937169708726, -0.017911693154019304, -0.03504276515064299, -0.1662666578809472, 0.3642899463367131, 0.22942203265847638, 0.13309935155363442, 0.1189013587823461, 0.33688962737667477, 0.06521649666117607, 0.1269325962865777, 0.05744702065971473, 0.13073698785269194, -0.07001558767418221, 0.18257335696802734, -0.16612524643359292, 0.09472853235881, 0.04024015874731251] |
1,802.08732 | Comparison and vanishing theorems for K\"ahler manifolds | In this paper, we consider orthogonal Ricci curvature $Ric^{\perp}$ for
K\"ahler manifolds, which is a curvature condition closely related to Ricci
curvature and holomorphic sectional curvature. We prove comparison theorems and
a vanishing theorem related to these curvature conditions, and construct
various examples to illustrate their subtle relationship.
| math.DG | in this paper we consider orthogonal ricci curvature ricperp for kahler manifolds which is a curvature condition closely related to ricci curvature and holomorphic sectional curvature we prove comparison theorems and a vanishing theorem related to these curvature conditions and construct various examples to illustrate their subtle relationship | [['in', 'this', 'paper', 'we', 'consider', 'orthogonal', 'ricci', 'curvature', 'ricperp', 'for', 'kahler', 'manifolds', 'which', 'is', 'a', 'curvature', 'condition', 'closely', 'related', 'to', 'ricci', 'curvature', 'and', 'holomorphic', 'sectional', 'curvature', 'we', 'prove', 'comparison', 'theorems', 'and', 'a', 'vanishing', 'theorem', 'related', 'to', 'these', 'curvature', 'conditions', 'and', 'construct', 'various', 'examples', 'to', 'illustrate', 'their', 'subtle', 'relationship']] | [-0.2325558263927381, 0.06973691456554894, -0.0892355059929306, 0.180292630052947, -0.19879295375257572, -0.22412933004980393, -0.12207110501340333, 0.37732917062462645, -0.25879326858186225, -0.18597520281501273, 0.1662836261366078, -0.26811137946045144, -0.24427730197760653, 0.13686442650616804, -0.19804799544842952, 0.03547569126524824, 0.03601536867109702, 0.09307631046729202, -0.0734628041453184, -0.24739048164337873, 0.5298885444694377, -0.02015429705460655, 0.247836435689254, 0.26353109084030096, 0.11886700246720872, -0.13585229990186487, -0.039765283306862444, 0.03705266103188091, -0.3211860375756279, 0.13502163390450656, 0.23679362847766977, 0.023753880746068157, 0.20561604701636477, -0.3713835105696257, -0.21756376557924012, 0.23290484198468162, 0.05218743077637826, 0.016129176972057433, -0.029153951627023993, -0.30020333255859133, 0.10510819396152696, -0.0034332637219352926, -0.2210321612036886, -0.16389670084290048, -0.06620421181333826, -0.02744369850830829, -0.1832827962142356, 0.09249715720664987, 0.1446008098886368, 0.05030329156904779, -0.10534447280967489, -0.0958279037372546, -0.06142567091453028, 0.024660807360518486, 0.1433086630100622, 0.013645425012850381, 0.10122193656663628, -0.04528971590557473, -0.0633081062003336, 0.27763353280247527, -0.1374353466436584, -0.308730616927781, 0.08504094928503036, -0.06287487629959558, -0.15044040280453702, 0.0309117798634032, 0.1946638979096996, 0.2084527903414787, -0.09266224458932559, 0.10758141519011374, 0.014696488473960694, 0.03415467707004319, 0.19905304502537277, 0.005076778398707826, 0.11521829751894828, -0.03364510220931249, 0.18180557665355662, 0.1591062681115371, 0.033637386310766355, -0.1477709515218405, -0.38661716902192605, -0.2581906874485789, -0.14522459187688544, 0.20432695130163686, -0.19539798167936673, -0.18176463539613055, 0.426638629961204, 0.01909748537148884, 0.22309878476439637, 0.22528123992564592, 0.2651945664250153, 0.01075764408612505, 0.009451778501549617, 0.09475810965523124, 0.23819772379988052, 0.33861396620248224, 0.10336682557108555, -0.10016038652232036, -0.12046849224320118, 0.14724894119624762] |
1,802.08733 | Conflict-Aware Replicated Data Types | We introduce Conflict-Aware Replicated Data Types (CARDs). CARDs are
significantly more expressive than Conflict-free Replicated Data Types (CRDTs)
as they support operations that can conflict with each other. Introducing
conflicting operations typically brings the need to block an operation in at
least some executions, leading to difficulties in programming and reasoning
about correctness, as well as potential inefficiencies in implementation.
The salient aspect of CARDs is that they allow ease of programming and
reasoning about programs comparable to CRDTs, while enabling algorithmic
inference of conflicts so that an operation is blocked only when necessary. The
key idea is to have a language that allows associating with each operation a
two-state predicate called {\em consistency guard} that relates the state of
the replica on which the operation is executing to a global state (which is
never computed). The consistency guards bring three advantages. First, a
programmer developing an operation needs only to choose a consistency guard
that states what the operation will rely on. In particular, they do not need to
consider the operation conflicts with other operation. This allows purely {\em
modular reasoning}. Second, we show that consistency guard allow reducing the
complexity of reasoning needed to prove invariants that hold as CARD operations
are executing. The reason is that consistency guard allow reducing the
reasoning about concurrency among operations to purely {\em sequential
reasoning}. Third, conflicts among operations can be algorithmically inferred
by checking whether the effect of one operation preserves the consistency guard
of another operation.
| cs.DC | we introduce conflictaware replicated data types cards cards are significantly more expressive than conflictfree replicated data types crdts as they support operations that can conflict with each other introducing conflicting operations typically brings the need to block an operation in at least some executions leading to difficulties in programming and reasoning about correctness as well as potential inefficiencies in implementation the salient aspect of cards is that they allow ease of programming and reasoning about programs comparable to crdts while enabling algorithmic inference of conflicts so that an operation is blocked only when necessary the key idea is to have a language that allows associating with each operation a twostate predicate called em consistency guard that relates the state of the replica on which the operation is executing to a global state which is never computed the consistency guards bring three advantages first a programmer developing an operation needs only to choose a consistency guard that states what the operation will rely on in particular they do not need to consider the operation conflicts with other operation this allows purely em modular reasoning second we show that consistency guard allow reducing the complexity of reasoning needed to prove invariants that hold as card operations are executing the reason is that consistency guard allow reducing the reasoning about concurrency among operations to purely em sequential reasoning third conflicts among operations can be algorithmically inferred by checking whether the effect of one operation preserves the consistency guard of another operation | [['we', 'introduce', 'conflictaware', 'replicated', 'data', 'types', 'cards', 'cards', 'are', 'significantly', 'more', 'expressive', 'than', 'conflictfree', 'replicated', 'data', 'types', 'crdts', 'as', 'they', 'support', 'operations', 'that', 'can', 'conflict', 'with', 'each', 'other', 'introducing', 'conflicting', 'operations', 'typically', 'brings', 'the', 'need', 'to', 'block', 'an', 'operation', 'in', 'at', 'least', 'some', 'executions', 'leading', 'to', 'difficulties', 'in', 'programming', 'and', 'reasoning', 'about', 'correctness', 'as', 'well', 'as', 'potential', 'inefficiencies', 'in', 'implementation', 'the', 'salient', 'aspect', 'of', 'cards', 'is', 'that', 'they', 'allow', 'ease', 'of', 'programming', 'and', 'reasoning', 'about', 'programs', 'comparable', 'to', 'crdts', 'while', 'enabling', 'algorithmic', 'inference', 'of', 'conflicts', 'so', 'that', 'an', 'operation', 'is', 'blocked', 'only', 'when', 'necessary', 'the', 'key', 'idea', 'is', 'to', 'have', 'a', 'language', 'that', 'allows', 'associating', 'with', 'each', 'operation', 'a', 'twostate', 'predicate', 'called', 'em', 'consistency', 'guard', 'that', 'relates', 'the', 'state', 'of', 'the', 'replica', 'on', 'which', 'the', 'operation', 'is', 'executing', 'to', 'a', 'global', 'state', 'which', 'is', 'never', 'computed', 'the', 'consistency', 'guards', 'bring', 'three', 'advantages', 'first', 'a', 'programmer', 'developing', 'an', 'operation', 'needs', 'only', 'to', 'choose', 'a', 'consistency', 'guard', 'that', 'states', 'what', 'the', 'operation', 'will', 'rely', 'on', 'in', 'particular', 'they', 'do', 'not', 'need', 'to', 'consider', 'the', 'operation', 'conflicts', 'with', 'other', 'operation', 'this', 'allows', 'purely', 'em', 'modular', 'reasoning', 'second', 'we', 'show', 'that', 'consistency', 'guard', 'allow', 'reducing', 'the', 'complexity', 'of', 'reasoning', 'needed', 'to', 'prove', 'invariants', 'that', 'hold', 'as', 'card', 'operations', 'are', 'executing', 'the', 'reason', 'is', 'that', 'consistency', 'guard', 'allow', 'reducing', 'the', 'reasoning', 'about', 'concurrency', 'among', 'operations', 'to', 'purely', 'em', 'sequential', 'reasoning', 'third', 'conflicts', 'among', 'operations', 'can', 'be', 'algorithmically', 'inferred', 'by', 'checking', 'whether', 'the', 'effect', 'of', 'one', 'operation', 'preserves', 'the', 'consistency', 'guard', 'of', 'another', 'operation']] | [-0.1575623830201127, 0.07189039621029693, -0.0942949212326165, 0.08101593168600718, -0.1696930839952397, -0.22557650573904656, 0.1110393250682166, 0.368902106307477, -0.2922539131118796, -0.34623369698285034, 0.16298085290210082, -0.2290663687952826, -0.09150872388929729, 0.14150164320345804, -0.15514353084595753, 0.05724677575269579, 0.08387237181699264, 0.050774802322144576, -0.03255610079213511, -0.2724319324610875, 0.2666817960036438, 0.04697635137727634, 0.2567035700081878, 0.01858908322737402, 0.06708595771323739, 0.05089258481354092, 0.013497582940016723, 0.01600197569519702, -0.02710704683672262, 0.10305973074859902, 0.31863291129176957, 0.26255001258687116, 0.3248719337448898, -0.5036740606320241, -0.11435424869893224, 0.09217972470258011, 0.12032914093710602, 0.07736088702316216, 0.02345389366259511, -0.23595766992695, 0.11658724859479398, -0.19427779880202106, -0.06053746470359094, -0.12782623363854062, -0.001982551353472856, -0.015628753195942997, -0.2609550314237206, -0.07500545783606809, 0.1121985533658693, 0.050907013321017484, 0.027420474270324884, -0.05955375825156337, -0.023313390235641912, 0.15884846360049484, 0.004591652499173858, -0.018823151474803564, 0.14385665784544882, -0.09681088446579393, -0.2138266197533437, 0.37400837628745415, 0.04310402827967107, -0.19184163414402358, 0.2031822132827778, -0.05814631112697234, -0.1909816047935296, 0.08220801824650299, 0.08124462316834158, 0.053687048142526166, -0.1717374366204064, 0.046967835322814816, -0.005230471812894628, 0.2283435664754624, 0.11704658948621081, 0.05737991535082279, 0.2039506870111631, 0.15952580209423398, 0.11502606890937914, 0.13350117773065465, -0.02086497140666207, -0.1106765567035895, -0.31443532559299664, -0.15356113057444623, -0.11942311254566565, -0.031004007667199344, -0.06464456886345532, -0.14384616620185214, 0.360407759941506, 0.24368559372763435, 0.13655722094042558, 0.10948921504783474, 0.363234799110233, 0.0818645862194488, 0.1662687488931096, 0.12169349673222901, 0.15189547582978716, 0.06394535163135809, 0.09419616502864595, -0.16487515281480755, 0.1484398941587818, 0.01582863955240276] |
1,802.08734 | Quantum walks and the size of the graph | A continuous-time quantum walk is modelled using a graph. In this short
paper, we provide lower bounds on the size of a graph that would allow for some
quantum phenomena to occur. Among other things, we show that, in the adjacency
matrix quantum walk model, the number of edges is bounded below by a cubic
function on the eccentricity of a periodic vertex. This gives some idea on the
shape of a graph that would admit periodicity or perfect state transfer. We
also raise some extremal type of questions in the end that could lead to future
research.
| math.CO quant-ph | a continuoustime quantum walk is modelled using a graph in this short paper we provide lower bounds on the size of a graph that would allow for some quantum phenomena to occur among other things we show that in the adjacency matrix quantum walk model the number of edges is bounded below by a cubic function on the eccentricity of a periodic vertex this gives some idea on the shape of a graph that would admit periodicity or perfect state transfer we also raise some extremal type of questions in the end that could lead to future research | [['a', 'continuoustime', 'quantum', 'walk', 'is', 'modelled', 'using', 'a', 'graph', 'in', 'this', 'short', 'paper', 'we', 'provide', 'lower', 'bounds', 'on', 'the', 'size', 'of', 'a', 'graph', 'that', 'would', 'allow', 'for', 'some', 'quantum', 'phenomena', 'to', 'occur', 'among', 'other', 'things', 'we', 'show', 'that', 'in', 'the', 'adjacency', 'matrix', 'quantum', 'walk', 'model', 'the', 'number', 'of', 'edges', 'is', 'bounded', 'below', 'by', 'a', 'cubic', 'function', 'on', 'the', 'eccentricity', 'of', 'a', 'periodic', 'vertex', 'this', 'gives', 'some', 'idea', 'on', 'the', 'shape', 'of', 'a', 'graph', 'that', 'would', 'admit', 'periodicity', 'or', 'perfect', 'state', 'transfer', 'we', 'also', 'raise', 'some', 'extremal', 'type', 'of', 'questions', 'in', 'the', 'end', 'that', 'could', 'lead', 'to', 'future', 'research']] | [-0.1520383614519307, 0.15732729095699532, -0.09484796060667354, 0.06062705552547562, -0.1271290547233455, -0.14810939029581388, 0.06380150672547254, 0.3850767589079178, -0.26437076639231977, -0.2691761923963394, 0.10967098539148705, -0.28973192764370115, -0.20106169412017097, 0.2030854667489398, -0.10652680895101203, 0.03445074677809465, 0.09344366000732407, 0.1033882635544002, -0.035431948861069214, -0.2549962526878071, 0.3003079207989444, 0.007834500083177142, 0.18119806913202818, 0.10866080686849143, 0.058353948653960715, 0.016526302455791404, 0.02538066534372997, 0.041482483369431326, -0.1717146133626241, 0.11124352255018846, 0.22298788532795272, 0.13007312692340692, 0.27149887783072735, -0.4440935829426257, -0.2129628549577022, 0.17075127445883592, 0.12172437161777397, 0.13097942475115462, -0.05686011384312557, -0.23142948009463368, 0.11622963564610583, -0.14815971272408354, -0.1323707136087956, -0.001053419812316341, 0.017537493087655426, 0.011907363614561607, -0.22821653943166745, 0.029830334657905338, 0.12235367106397313, 0.006764486745684122, 0.009048659663305295, -0.09999041113888427, 0.028795752569804996, 0.10828903264945791, -0.04507288668062348, 0.00702139751852623, 0.08576387405984712, -0.12206550031349216, -0.17353970344577516, 0.3536985693499446, -0.05257533622991142, -0.19620920324279945, 0.1611796161254906, -0.146693852815625, -0.16814285764774803, 0.08096071701420814, 0.1781622375152549, 0.08228592599304962, -0.09679078370123645, 0.10102119006938776, -0.08486790267028371, 0.15213262951191592, 0.06202535216259409, 0.06585455244426064, 0.21586318910882182, 0.13663845613826903, 0.1429745935435806, 0.1603631535740997, -0.029291500824465588, -0.10048022448104255, -0.2989594286345706, -0.1328432619932811, -0.21427108648670268, 0.1209741356611556, -0.1268330743697909, -0.2197685411178545, 0.4357835259668681, 0.18213099478839004, 0.2550420747708757, 0.06859060454809544, 0.210736129200086, 0.10517578169570438, 0.028911162167787552, 0.08392085733215268, 0.18351993662494054, 0.11786011195199907, 0.063307093195047, -0.16887540249534103, 0.09228242844181629, 0.09751364497075271] |
1,802.08735 | A DIRT-T Approach to Unsupervised Domain Adaptation | Domain adaptation refers to the problem of leveraging labeled data in a
source domain to learn an accurate model in a target domain where labels are
scarce or unavailable. A recent approach for finding a common representation of
the two domains is via domain adversarial training (Ganin & Lempitsky, 2015),
which attempts to induce a feature extractor that matches the source and target
feature distributions in some feature space. However, domain adversarial
training faces two critical limitations: 1) if the feature extraction function
has high-capacity, then feature distribution matching is a weak constraint, 2)
in non-conservative domain adaptation (where no single classifier can perform
well in both the source and target domains), training the model to do well on
the source domain hurts performance on the target domain. In this paper, we
address these issues through the lens of the cluster assumption, i.e., decision
boundaries should not cross high-density data regions. We propose two novel and
related models: 1) the Virtual Adversarial Domain Adaptation (VADA) model,
which combines domain adversarial training with a penalty term that punishes
the violation the cluster assumption; 2) the Decision-boundary Iterative
Refinement Training with a Teacher (DIRT-T) model, which takes the VADA model
as initialization and employs natural gradient steps to further minimize the
cluster assumption violation. Extensive empirical results demonstrate that the
combination of these two models significantly improve the state-of-the-art
performance on the digit, traffic sign, and Wi-Fi recognition domain adaptation
benchmarks.
| stat.ML cs.CV cs.LG | domain adaptation refers to the problem of leveraging labeled data in a source domain to learn an accurate model in a target domain where labels are scarce or unavailable a recent approach for finding a common representation of the two domains is via domain adversarial training ganin lempitsky 2015 which attempts to induce a feature extractor that matches the source and target feature distributions in some feature space however domain adversarial training faces two critical limitations 1 if the feature extraction function has highcapacity then feature distribution matching is a weak constraint 2 in nonconservative domain adaptation where no single classifier can perform well in both the source and target domains training the model to do well on the source domain hurts performance on the target domain in this paper we address these issues through the lens of the cluster assumption ie decision boundaries should not cross highdensity data regions we propose two novel and related models 1 the virtual adversarial domain adaptation vada model which combines domain adversarial training with a penalty term that punishes the violation the cluster assumption 2 the decisionboundary iterative refinement training with a teacher dirtt model which takes the vada model as initialization and employs natural gradient steps to further minimize the cluster assumption violation extensive empirical results demonstrate that the combination of these two models significantly improve the stateoftheart performance on the digit traffic sign and wifi recognition domain adaptation benchmarks | [['domain', 'adaptation', 'refers', 'to', 'the', 'problem', 'of', 'leveraging', 'labeled', 'data', 'in', 'a', 'source', 'domain', 'to', 'learn', 'an', 'accurate', 'model', 'in', 'a', 'target', 'domain', 'where', 'labels', 'are', 'scarce', 'or', 'unavailable', 'a', 'recent', 'approach', 'for', 'finding', 'a', 'common', 'representation', 'of', 'the', 'two', 'domains', 'is', 'via', 'domain', 'adversarial', 'training', 'ganin', 'lempitsky', '2015', 'which', 'attempts', 'to', 'induce', 'a', 'feature', 'extractor', 'that', 'matches', 'the', 'source', 'and', 'target', 'feature', 'distributions', 'in', 'some', 'feature', 'space', 'however', 'domain', 'adversarial', 'training', 'faces', 'two', 'critical', 'limitations', '1', 'if', 'the', 'feature', 'extraction', 'function', 'has', 'highcapacity', 'then', 'feature', 'distribution', 'matching', 'is', 'a', 'weak', 'constraint', '2', 'in', 'nonconservative', 'domain', 'adaptation', 'where', 'no', 'single', 'classifier', 'can', 'perform', 'well', 'in', 'both', 'the', 'source', 'and', 'target', 'domains', 'training', 'the', 'model', 'to', 'do', 'well', 'on', 'the', 'source', 'domain', 'hurts', 'performance', 'on', 'the', 'target', 'domain', 'in', 'this', 'paper', 'we', 'address', 'these', 'issues', 'through', 'the', 'lens', 'of', 'the', 'cluster', 'assumption', 'ie', 'decision', 'boundaries', 'should', 'not', 'cross', 'highdensity', 'data', 'regions', 'we', 'propose', 'two', 'novel', 'and', 'related', 'models', '1', 'the', 'virtual', 'adversarial', 'domain', 'adaptation', 'vada', 'model', 'which', 'combines', 'domain', 'adversarial', 'training', 'with', 'a', 'penalty', 'term', 'that', 'punishes', 'the', 'violation', 'the', 'cluster', 'assumption', '2', 'the', 'decisionboundary', 'iterative', 'refinement', 'training', 'with', 'a', 'teacher', 'dirtt', 'model', 'which', 'takes', 'the', 'vada', 'model', 'as', 'initialization', 'and', 'employs', 'natural', 'gradient', 'steps', 'to', 'further', 'minimize', 'the', 'cluster', 'assumption', 'violation', 'extensive', 'empirical', 'results', 'demonstrate', 'that', 'the', 'combination', 'of', 'these', 'two', 'models', 'significantly', 'improve', 'the', 'stateoftheart', 'performance', 'on', 'the', 'digit', 'traffic', 'sign', 'and', 'wifi', 'recognition', 'domain', 'adaptation', 'benchmarks']] | [-0.059093232597769337, 0.003509233204927791, -0.057360140717727076, 0.06499176581459556, -0.14475651462859612, -0.16552366423816917, 0.07889099506651388, 0.44043658271114877, -0.2954808901757636, -0.320735418780687, 0.10128999637697447, -0.2652345526051965, -0.13961838420450767, 0.1308667469741851, -0.12650915507098381, 0.07311146836497194, 0.11465536024659238, 0.03398540321826697, -0.04518472268741498, -0.252862941527224, 0.35169426731349146, -0.005829095346060522, 0.36295418121475487, 0.03145015011764468, 0.13151556023475813, -0.04460159170619668, -0.021012506867818376, -0.04420883111430312, -0.040848932037237745, 0.13045152116398465, 0.27181536863558614, 0.19474128733012588, 0.31901644678548613, -0.4058655943245964, -0.2513030422767228, 0.11001545752378854, 0.15281553009049373, 0.11722362924817989, -0.0512974388104804, -0.32036020979681545, 0.08984809160787374, -0.15540454296910383, 0.0008076179861784615, -0.08059211822939998, -0.039262551348656416, -0.006832193855216053, -0.3392409726699933, 0.03431625720509823, 0.11812690206372398, 0.04710815924992587, -0.07661493560695584, -0.10502443512544987, 0.03664915895565076, 0.15644341137636691, 0.04762763651137419, 0.11181664475378521, 0.12013732104344253, -0.19139890915743926, -0.1284865403448806, 0.3419555586386234, -0.046854963587557384, -0.26063075174101963, 0.2096544938320492, -0.05189065915195549, -0.1265184549803033, 0.07776664185407076, 0.21028922085818696, 0.11839499294440797, -0.15514442480932128, 0.05178977514869791, -0.011083266935608488, 0.2082098731186558, 0.05638678802494356, -0.02470770234965343, 0.15042102610930166, 0.22479907823132073, 0.07700159324313256, 0.16520751386365676, -0.15127406069870167, -0.07803440227153453, -0.28907130248448315, -0.06770989600156602, -0.2391744804687481, -0.04997359839109506, -0.10777159301493505, -0.15217623454301885, 0.3612837231361327, 0.1750904935699432, 0.23165296118092188, 0.07170997222915212, 0.33258459114647926, 0.022086015826665816, 0.10307541408259026, 0.09237420151129049, 0.166620247712126, -0.007545288972199914, 0.11085279111928763, -0.17945340615994435, 0.10389110679549977, 0.035044165908735485] |
1,802.08736 | Estimating Graphlet Statistics via Lifting | Exploratory analysis over network data is often limited by the ability to
efficiently calculate graph statistics, which can provide a model-free
understanding of the macroscopic properties of a network. We introduce a
framework for estimating the graphlet count---the number of occurrences of a
small subgraph motif (e.g. a wedge or a triangle) in the network. For massive
graphs, where accessing the whole graph is not possible, the only viable
algorithms are those that make a limited number of vertex neighborhood queries.
We introduce a Monte Carlo sampling technique for graphlet counts, called {\em
Lifting}, which can simultaneously sample all graphlets of size up to $k$
vertices for arbitrary $k$. This is the first graphlet sampling method that can
provably sample every graphlet with positive probability and can sample
graphlets of arbitrary size $k$. We outline variants of lifted graphlet counts,
including the ordered, unordered, and shotgun estimators, random walk starts,
and parallel vertex starts. We prove that our graphlet count updates are
unbiased for the true graphlet count and have a controlled variance for all
graphlets. We compare the experimental performance of lifted graphlet counts to
the state-of-the art graphlet sampling procedures: Waddling and the pairwise
subgraph random walk.
| stat.ME stat.ML | exploratory analysis over network data is often limited by the ability to efficiently calculate graph statistics which can provide a modelfree understanding of the macroscopic properties of a network we introduce a framework for estimating the graphlet countthe number of occurrences of a small subgraph motif eg a wedge or a triangle in the network for massive graphs where accessing the whole graph is not possible the only viable algorithms are those that make a limited number of vertex neighborhood queries we introduce a monte carlo sampling technique for graphlet counts called em lifting which can simultaneously sample all graphlets of size up to k vertices for arbitrary k this is the first graphlet sampling method that can provably sample every graphlet with positive probability and can sample graphlets of arbitrary size k we outline variants of lifted graphlet counts including the ordered unordered and shotgun estimators random walk starts and parallel vertex starts we prove that our graphlet count updates are unbiased for the true graphlet count and have a controlled variance for all graphlets we compare the experimental performance of lifted graphlet counts to the stateofthe art graphlet sampling procedures waddling and the pairwise subgraph random walk | [['exploratory', 'analysis', 'over', 'network', 'data', 'is', 'often', 'limited', 'by', 'the', 'ability', 'to', 'efficiently', 'calculate', 'graph', 'statistics', 'which', 'can', 'provide', 'a', 'modelfree', 'understanding', 'of', 'the', 'macroscopic', 'properties', 'of', 'a', 'network', 'we', 'introduce', 'a', 'framework', 'for', 'estimating', 'the', 'graphlet', 'countthe', 'number', 'of', 'occurrences', 'of', 'a', 'small', 'subgraph', 'motif', 'eg', 'a', 'wedge', 'or', 'a', 'triangle', 'in', 'the', 'network', 'for', 'massive', 'graphs', 'where', 'accessing', 'the', 'whole', 'graph', 'is', 'not', 'possible', 'the', 'only', 'viable', 'algorithms', 'are', 'those', 'that', 'make', 'a', 'limited', 'number', 'of', 'vertex', 'neighborhood', 'queries', 'we', 'introduce', 'a', 'monte', 'carlo', 'sampling', 'technique', 'for', 'graphlet', 'counts', 'called', 'em', 'lifting', 'which', 'can', 'simultaneously', 'sample', 'all', 'graphlets', 'of', 'size', 'up', 'to', 'k', 'vertices', 'for', 'arbitrary', 'k', 'this', 'is', 'the', 'first', 'graphlet', 'sampling', 'method', 'that', 'can', 'provably', 'sample', 'every', 'graphlet', 'with', 'positive', 'probability', 'and', 'can', 'sample', 'graphlets', 'of', 'arbitrary', 'size', 'k', 'we', 'outline', 'variants', 'of', 'lifted', 'graphlet', 'counts', 'including', 'the', 'ordered', 'unordered', 'and', 'shotgun', 'estimators', 'random', 'walk', 'starts', 'and', 'parallel', 'vertex', 'starts', 'we', 'prove', 'that', 'our', 'graphlet', 'count', 'updates', 'are', 'unbiased', 'for', 'the', 'true', 'graphlet', 'count', 'and', 'have', 'a', 'controlled', 'variance', 'for', 'all', 'graphlets', 'we', 'compare', 'the', 'experimental', 'performance', 'of', 'lifted', 'graphlet', 'counts', 'to', 'the', 'stateofthe', 'art', 'graphlet', 'sampling', 'procedures', 'waddling', 'and', 'the', 'pairwise', 'subgraph', 'random', 'walk']] | [-0.1125571244717741, 0.1060487982470703, -0.054303553169309564, 0.088899065944872, -0.11657556781053618, -0.13538836577179167, 0.12411310081192893, 0.4214052909105865, -0.28574160444266566, -0.33951781697211986, 0.05640109381130258, -0.29731980627308113, -0.13346554087073104, 0.12416205112822354, -0.07361332547666534, 0.06856977509873621, 0.12046822204448396, 0.07711596258335066, -0.014242988414554219, -0.2870007644068842, 0.2479793197064079, 0.02426755607014683, 0.26057769127927605, -0.016802651743844228, 0.11332129459145011, 0.041662006057458484, -0.06178473306082303, 0.10204033746837926, -0.1346035064225777, 0.12577501480907277, 0.28547211537411826, 0.18654116816484242, 0.28448179211978075, -0.36355876779825064, -0.18181896717925816, 0.20741958354557227, 0.15786806392614305, 0.13914927902990754, 0.009134103421140747, -0.2455525469663671, 0.15324824309770754, -0.14412591306653422, -0.036697504550294226, -0.11844446530020772, 0.009912182218844288, 0.05692201983278173, -0.3018861857082146, 0.02587445760571261, 0.04568018179462494, 0.0116827581148727, 0.09144397195296239, -0.17268911766025433, 0.01464035427954218, 0.11151329845338966, -0.043357247492029016, 0.04074122796844464, 0.12201054457564446, -0.13249696404342232, -0.20150057060365106, 0.3055692554503528, -0.006636783435732731, -0.17550657224855598, 0.13697273118024322, -0.111988392675078, -0.20638233454375607, 0.13973914730471326, 0.1739489133014736, 0.1580786488815518, -0.14453283152282995, 0.09114038586695702, -0.06155489378391297, 0.13313156896776657, 0.042026272729667954, 0.014639785581830945, 0.1366067871411194, 0.17519901630463938, 0.1563578388301495, 0.17578826648559004, -0.137472486648198, -0.06174323397309184, -0.23204200320550936, -0.11916269787568315, -0.27120783213209265, 0.018397015927854077, -0.19490967503697718, -0.2411187297882049, 0.4381353995493296, 0.2037020316205654, 0.2266850265423734, 0.1656650832918033, 0.30260988778723075, 0.030681364588690023, 0.06902696154917104, 0.13413139314007788, 0.073436978718663, 0.12349409541138581, -0.0157453576758797, -0.16111111961456423, 0.11587737837267406, 0.08464984721838033] |
1,802.08737 | Contextual Bandits with Stochastic Experts | We consider the problem of contextual bandits with stochastic experts, which
is a variation of the traditional stochastic contextual bandit with experts
problem. In our problem setting, we assume access to a class of stochastic
experts, where each expert is a conditional distribution over the arms given a
context. We propose upper-confidence bound (UCB) algorithms for this problem,
which employ two different importance sampling based estimators for the mean
reward for each expert. Both these estimators leverage information leakage
among the experts, thus using samples collected under all the experts to
estimate the mean reward of any given expert. This leads to instance dependent
regret bounds of $\mathcal{O}\left(\lambda(\pmb{\mu})\mathcal{M}\log T/\Delta
\right)$, where $\lambda(\pmb{\mu})$ is a term that depends on the mean rewards
of the experts, $\Delta$ is the smallest gap between the mean reward of the
optimal expert and the rest, and $\mathcal{M}$ quantifies the information
leakage among the experts. We show that under some assumptions
$\lambda(\pmb{\mu})$ is typically $\mathcal{O}(\log N)$, where $N$ is the
number of experts. We implement our algorithm with stochastic experts generated
from cost-sensitive classification oracles and show superior empirical
performance on real-world datasets, when compared to other state of the art
contextual bandit algorithms.
| stat.ML cs.AI cs.IT cs.LG math.IT | we consider the problem of contextual bandits with stochastic experts which is a variation of the traditional stochastic contextual bandit with experts problem in our problem setting we assume access to a class of stochastic experts where each expert is a conditional distribution over the arms given a context we propose upperconfidence bound ucb algorithms for this problem which employ two different importance sampling based estimators for the mean reward for each expert both these estimators leverage information leakage among the experts thus using samples collected under all the experts to estimate the mean reward of any given expert this leads to instance dependent regret bounds of mathcaloleftlambdapmbmumathcalmlog tdelta right where lambdapmbmu is a term that depends on the mean rewards of the experts delta is the smallest gap between the mean reward of the optimal expert and the rest and mathcalm quantifies the information leakage among the experts we show that under some assumptions lambdapmbmu is typically mathcalolog n where n is the number of experts we implement our algorithm with stochastic experts generated from costsensitive classification oracles and show superior empirical performance on realworld datasets when compared to other state of the art contextual bandit algorithms | [['we', 'consider', 'the', 'problem', 'of', 'contextual', 'bandits', 'with', 'stochastic', 'experts', 'which', 'is', 'a', 'variation', 'of', 'the', 'traditional', 'stochastic', 'contextual', 'bandit', 'with', 'experts', 'problem', 'in', 'our', 'problem', 'setting', 'we', 'assume', 'access', 'to', 'a', 'class', 'of', 'stochastic', 'experts', 'where', 'each', 'expert', 'is', 'a', 'conditional', 'distribution', 'over', 'the', 'arms', 'given', 'a', 'context', 'we', 'propose', 'upperconfidence', 'bound', 'ucb', 'algorithms', 'for', 'this', 'problem', 'which', 'employ', 'two', 'different', 'importance', 'sampling', 'based', 'estimators', 'for', 'the', 'mean', 'reward', 'for', 'each', 'expert', 'both', 'these', 'estimators', 'leverage', 'information', 'leakage', 'among', 'the', 'experts', 'thus', 'using', 'samples', 'collected', 'under', 'all', 'the', 'experts', 'to', 'estimate', 'the', 'mean', 'reward', 'of', 'any', 'given', 'expert', 'this', 'leads', 'to', 'instance', 'dependent', 'regret', 'bounds', 'of', 'mathcaloleftlambdapmbmumathcalmlog', 'tdelta', 'right', 'where', 'lambdapmbmu', 'is', 'a', 'term', 'that', 'depends', 'on', 'the', 'mean', 'rewards', 'of', 'the', 'experts', 'delta', 'is', 'the', 'smallest', 'gap', 'between', 'the', 'mean', 'reward', 'of', 'the', 'optimal', 'expert', 'and', 'the', 'rest', 'and', 'mathcalm', 'quantifies', 'the', 'information', 'leakage', 'among', 'the', 'experts', 'we', 'show', 'that', 'under', 'some', 'assumptions', 'lambdapmbmu', 'is', 'typically', 'mathcalolog', 'n', 'where', 'n', 'is', 'the', 'number', 'of', 'experts', 'we', 'implement', 'our', 'algorithm', 'with', 'stochastic', 'experts', 'generated', 'from', 'costsensitive', 'classification', 'oracles', 'and', 'show', 'superior', 'empirical', 'performance', 'on', 'realworld', 'datasets', 'when', 'compared', 'to', 'other', 'state', 'of', 'the', 'art', 'contextual', 'bandit', 'algorithms']] | [-0.04476245098436872, 0.02888563462616637, -0.06560445597920662, 0.0874638596119789, -0.15853981101551118, -0.16658307038581907, 0.09920721834776207, 0.41594648206463225, -0.2675894166032473, -0.3366571497545243, 0.08800376035714856, -0.3009956455598466, -0.1426671710023537, 0.16363634278651518, -0.14794489519718365, 0.0591956795939507, 0.05226358386496894, 0.11023390111035834, -0.04472875653598935, -0.3318596650452281, 0.3177586777541691, 0.004078298916992469, 0.28654425806150985, -0.024715772563090117, 0.14025799307602052, -0.0002616644550401431, -0.009243669543558588, 0.0226587729050945, -0.12825017519428047, 0.13657844589115717, 0.3141219621989876, 0.21098940778189362, 0.4302432456316474, -0.36707976037302076, -0.1561195663075733, 0.16076135564213379, 0.0939543206584998, 0.06137650791407885, -0.004367810911618364, -0.3358943434002308, 0.05195601125582097, -0.1402257662224423, 0.034477661862873876, -0.02575600573267692, -0.04329901547768177, 0.032971882079847345, -0.4047958572633947, 0.057346066204496685, 0.058674584655091164, 0.03990875362203671, -0.05046111392334868, -0.16008737973677806, 0.07959125064408933, 0.15339258306895573, 0.0808842690058578, 0.016944217157717316, 0.14491542930690907, -0.1758155647259301, -0.19111888530926827, 0.29540470056474594, -0.04223330348777848, -0.24599491469084453, 0.1351184615614609, -0.08558442120273144, -0.12328674461788092, 0.08440341664334902, 0.20376922820145504, 0.1424886112005856, -0.13844010726203962, 0.07443518405929446, -0.09473115333284322, 0.19583806302398443, 0.028448729200336413, 0.015989684210851406, 0.10321792712411246, 0.20316826841459634, 0.13338330008376104, 0.13873884461324615, -0.056635847484143687, -0.13644178081662037, -0.2748554764936368, -0.09126751797590166, -0.20432030394828568, 0.0057447967394881954, -0.15048804362879123, -0.16094942963503014, 0.3391936816728841, 0.20915744120780475, 0.18119192636834505, 0.16500860348176688, 0.3347710230220587, 0.08498771915761515, 0.013660045732290316, 0.16109102596230326, 0.1572100494995725, 0.029937122298929936, 0.06009255449156253, -0.2112692679815854, 0.17469288267863867, 0.01449693812487217] |
1,802.08738 | Talking by the numbers: Networks identify productive forum discussions | Discussion forums provide a channel for students to engage with peers and
course material outside of class, accessible even to commuter and
non-traditional populations. As such, forums can build classroom community as
well as aid learning, but students do not always take up these tools. We use
network analysis to compare three semesters of forum logs from an introductory
calculus-based physics course. The networks show dense structures of
collaboration that differ significantly between semesters, even though
aggregate participation statistics remain steady. After characterizing network
structure for each semester, we correlate centrality with final course grade.
Finally, we use a backbone extraction procedure to clean up "noise" in the
network and clarify centrality/grade correlations. We find that network
centrality is positively linked with course success in the two semesters with
denser forum networks, and is a more reliable indicator than non-network
measures such as post count. Backbone extraction destroys these correlations,
suggesting that the "noise" is in fact signal and further analysis of the
discussion transcripts is required.
| physics.ed-ph | discussion forums provide a channel for students to engage with peers and course material outside of class accessible even to commuter and nontraditional populations as such forums can build classroom community as well as aid learning but students do not always take up these tools we use network analysis to compare three semesters of forum logs from an introductory calculusbased physics course the networks show dense structures of collaboration that differ significantly between semesters even though aggregate participation statistics remain steady after characterizing network structure for each semester we correlate centrality with final course grade finally we use a backbone extraction procedure to clean up noise in the network and clarify centralitygrade correlations we find that network centrality is positively linked with course success in the two semesters with denser forum networks and is a more reliable indicator than nonnetwork measures such as post count backbone extraction destroys these correlations suggesting that the noise is in fact signal and further analysis of the discussion transcripts is required | [['discussion', 'forums', 'provide', 'a', 'channel', 'for', 'students', 'to', 'engage', 'with', 'peers', 'and', 'course', 'material', 'outside', 'of', 'class', 'accessible', 'even', 'to', 'commuter', 'and', 'nontraditional', 'populations', 'as', 'such', 'forums', 'can', 'build', 'classroom', 'community', 'as', 'well', 'as', 'aid', 'learning', 'but', 'students', 'do', 'not', 'always', 'take', 'up', 'these', 'tools', 'we', 'use', 'network', 'analysis', 'to', 'compare', 'three', 'semesters', 'of', 'forum', 'logs', 'from', 'an', 'introductory', 'calculusbased', 'physics', 'course', 'the', 'networks', 'show', 'dense', 'structures', 'of', 'collaboration', 'that', 'differ', 'significantly', 'between', 'semesters', 'even', 'though', 'aggregate', 'participation', 'statistics', 'remain', 'steady', 'after', 'characterizing', 'network', 'structure', 'for', 'each', 'semester', 'we', 'correlate', 'centrality', 'with', 'final', 'course', 'grade', 'finally', 'we', 'use', 'a', 'backbone', 'extraction', 'procedure', 'to', 'clean', 'up', 'noise', 'in', 'the', 'network', 'and', 'clarify', 'centralitygrade', 'correlations', 'we', 'find', 'that', 'network', 'centrality', 'is', 'positively', 'linked', 'with', 'course', 'success', 'in', 'the', 'two', 'semesters', 'with', 'denser', 'forum', 'networks', 'and', 'is', 'a', 'more', 'reliable', 'indicator', 'than', 'nonnetwork', 'measures', 'such', 'as', 'post', 'count', 'backbone', 'extraction', 'destroys', 'these', 'correlations', 'suggesting', 'that', 'the', 'noise', 'is', 'in', 'fact', 'signal', 'and', 'further', 'analysis', 'of', 'the', 'discussion', 'transcripts', 'is', 'required']] | [-0.04210518973813594, 0.09414954199843145, -0.08271377425393965, 0.11726160039732525, -0.09745972358175632, -0.18840844521063368, 0.06418623925411196, 0.43617509949548416, -0.22943394610950027, -0.3542886566460492, 0.06642371776839157, -0.33037181692730905, -0.17129661377339836, 0.17954976103445291, -0.057806174081458474, -0.026675390646265573, 0.13785936934761253, 0.05159161875044776, -0.044314509555024195, -0.30430322637674906, 0.33601101418867346, 0.0971468508142574, 0.30276680109371623, 0.04663825761603966, 0.03319404985621033, 0.0022309833677508027, -0.09214869213549291, 0.011257289695632026, -0.07550949059879647, 0.11343034206474402, 0.3620482323444392, 0.18871037250648376, 0.3497657549514222, -0.40506102333437227, -0.16459212847704807, 0.09039232099613916, 0.14460032897249583, 0.10838009325327375, 0.004823539817284271, -0.30015512806060446, 0.05681863873748176, -0.2164030404795096, -0.06150024055492088, -0.10549970075532973, -0.0003880702870994728, 0.026942058300868755, -0.19504616739395275, 0.06182190225212779, 0.03984331722856578, 0.1337468175207691, -0.008950933773373535, -0.136910911782712, -0.0007108754088473787, 0.2296494782554457, 0.036007949308189284, 0.018490139796140503, 0.1977926898054801, -0.17486667566433414, -0.14163142126277986, 0.34861750739166536, -0.0067147410914606236, -0.11581886223943746, 0.22362463673470115, -0.11764748988628208, -0.1599570591288832, 0.08451664425903954, 0.24640997987891355, 0.04225768729415302, -0.1603982723574014, -0.04740399815435297, -0.009119704378353634, 0.2208534807099327, 0.051136040048819616, 0.010138345182402036, 0.19876157141750656, 0.1984948321772986, 0.048225081775404785, 0.09912511650248464, -0.015657524588091457, -0.0925004041153399, -0.2651140258383814, -0.15983036093425051, -0.14110381366875785, 0.03517113145483245, -0.04385116101613939, -0.131637756642605, 0.39009693685178476, 0.1531538847912417, 0.15825978581897399, 0.07201823856434729, 0.21944311199182398, 0.005761127301817198, 0.06421853307107217, 0.1095883838007653, 0.19122035291988448, 0.06090086144226861, 0.1716851631981736, -0.09705532333359167, 0.11578561732663313, -0.01728240633944431] |
1,802.08739 | Effective two-mode model in Bose-Einstein condensates versus
Gross-Pitaevskii simulations | We study the dynamics of three-dimensional Bose-Einstein condensates confined
by double-well potentials using a two-mode model with an effective on-site
interaction energy parameter. The effective on-site interaction energy
parameter is evaluated for different numbers of particles ranging from a low
experimental value to larger ones approaching the Thomas-Fermi limit, yielding
important corrections to the dynamics. We analyze the time periods as functions
of the initial imbalance and find a closed integral form that includes all
interaction-driven parameters. A simple analytical formula for the
self-trapping period is introduced and shown to accurately reproduce the exact
values provided by the two-mode model. Systematic numerical simulations of the
problem in 3D demonstrate the excellent agreement of the two-mode model for
experimental parameters.
| cond-mat.quant-gas | we study the dynamics of threedimensional boseeinstein condensates confined by doublewell potentials using a twomode model with an effective onsite interaction energy parameter the effective onsite interaction energy parameter is evaluated for different numbers of particles ranging from a low experimental value to larger ones approaching the thomasfermi limit yielding important corrections to the dynamics we analyze the time periods as functions of the initial imbalance and find a closed integral form that includes all interactiondriven parameters a simple analytical formula for the selftrapping period is introduced and shown to accurately reproduce the exact values provided by the twomode model systematic numerical simulations of the problem in 3d demonstrate the excellent agreement of the twomode model for experimental parameters | [['we', 'study', 'the', 'dynamics', 'of', 'threedimensional', 'boseeinstein', 'condensates', 'confined', 'by', 'doublewell', 'potentials', 'using', 'a', 'twomode', 'model', 'with', 'an', 'effective', 'onsite', 'interaction', 'energy', 'parameter', 'the', 'effective', 'onsite', 'interaction', 'energy', 'parameter', 'is', 'evaluated', 'for', 'different', 'numbers', 'of', 'particles', 'ranging', 'from', 'a', 'low', 'experimental', 'value', 'to', 'larger', 'ones', 'approaching', 'the', 'thomasfermi', 'limit', 'yielding', 'important', 'corrections', 'to', 'the', 'dynamics', 'we', 'analyze', 'the', 'time', 'periods', 'as', 'functions', 'of', 'the', 'initial', 'imbalance', 'and', 'find', 'a', 'closed', 'integral', 'form', 'that', 'includes', 'all', 'interactiondriven', 'parameters', 'a', 'simple', 'analytical', 'formula', 'for', 'the', 'selftrapping', 'period', 'is', 'introduced', 'and', 'shown', 'to', 'accurately', 'reproduce', 'the', 'exact', 'values', 'provided', 'by', 'the', 'twomode', 'model', 'systematic', 'numerical', 'simulations', 'of', 'the', 'problem', 'in', '3d', 'demonstrate', 'the', 'excellent', 'agreement', 'of', 'the', 'twomode', 'model', 'for', 'experimental', 'parameters']] | [-0.13456922239612223, 0.15379728567348736, -0.06394643280968196, 0.1198765812226485, 0.014258099381397125, -0.16018598252797828, 0.04272482170089453, 0.3334979551781689, -0.19821477050603437, -0.31075355490403517, 0.014348342375900252, -0.26558163151768144, -0.11295320329965854, 0.21365761480435042, 0.05096408470823359, 0.0865118347193719, 0.08100939699362557, 0.003112893582893019, -0.06806681460129614, -0.19407218377724164, 0.2948433980854432, 0.04743882515193785, 0.27147594467196773, 0.05779837146440536, 0.09979552312307999, 0.008967237862046151, 0.060152719844819416, 0.021225299448471423, -0.19721425937112283, 0.06283846080690592, 0.200300637676631, -0.014396015942065405, 0.2313425193908585, -0.4331408863996758, -0.24234695854682883, 0.10969884154003333, 0.14433617305260996, 0.17537550085044207, -0.05504237050425355, -0.2937618733047187, -0.01624599175465082, -0.21744370743624492, -0.19979393425859324, -0.11899738176725805, 0.07222645809999158, 0.06235171301767794, -0.340998841895714, 0.12221317378042985, -0.036590788190589606, 0.0405323866973905, -0.1276054945441761, -0.0943982875710275, -0.013611924818896946, 0.10794084397938979, 0.01738109047614633, 0.0158794111701339, 0.09704887907670326, -0.16580149058121482, -0.06699725888481661, 0.3895439667188946, -0.08080896729028181, -0.186091195799786, 0.14958663757483498, -0.11503270932888034, -0.017443880411412788, 0.13587531852956564, 0.12679587052587202, 0.0838494408687874, -0.13475585225656503, 0.09567599164585176, -0.028615245986886386, 0.17324598054127657, 0.005171310665289394, 0.011809140400207276, 0.19195107747057155, 0.1720918764618515, -0.014548759475084288, 0.1830144840989168, -0.07293835304239217, -0.18528309314582153, -0.30085968506765093, -0.0819179699511635, -0.20197315730972357, 0.023307425357370067, -0.12298696530770566, -0.15214011590402504, 0.42857640069721564, 0.17365247692850208, 0.20472770755594016, 0.05367861605961533, 0.2995816236068377, 0.15977538864132204, 0.029312326396378187, 0.015039327221789531, 0.2701404170062737, 0.11718126542537528, 0.05527542536577382, -0.27160257981902286, -0.006834038924582365, 0.05630977825895578] |
1,802.0874 | Crystal structure and local ordering in epitaxial
Fe$_{100-x}$Ga$_x$/MgO(001) films | In this work we present a study of the structural properties of Fe$_{100-x}$
Ga$_x$ grown by Molecular Beam Epitaxy on Mg0(100). We combine long range and
local/chemically selective X-ray probes (X-ray Diffraction and X-ray absorption
spectroscopy) together with real space imaging by means of Transmission
Electron Microscopy and surface sensitive $in situ$ Reflected High Energy
Electron Diffraction. For substrate temperature $T_s$ below 400 $^o$C we obtain
$bcc$ films while, for $x \approx$ 24 and $T_s \geq$ 400$^o$C the nucleation of
the $fcc$ phase is observed. For both systems a Ga anticlustering or local
range ordering phenomenon appears. The Ga/Fe composition in the first and
second coordination shells of the $bcc$ films is different from that expected
for a random Ga distribution and is close to a D0$_3$-like ordered phase,
leading to a minimization of the number of Ga-Ga pairs. On the other side, a
true long-range D0$_3$ phase is not observed indicating that atomic ordering
only occurs at a local scale. Overall, the epitaxial growth procedure presented
in this work, first, avoids the formation of a long range ordered D0$_3$ phase,
which is known to be detrimental magnetostrictive properties, and second,
demonstrates the possibility of growing $fcc$ films at temperatures much
smaller than those required to obtain bulk $fcc$ samples.
| cond-mat.mtrl-sci | in this work we present a study of the structural properties of fe_100x ga_x grown by molecular beam epitaxy on mg0100 we combine long range and localchemically selective xray probes xray diffraction and xray absorption spectroscopy together with real space imaging by means of transmission electron microscopy and surface sensitive in situ reflected high energy electron diffraction for substrate temperature t_s below 400 oc we obtain bcc films while for x approx 24 and t_s geq 400oc the nucleation of the fcc phase is observed for both systems a ga anticlustering or local range ordering phenomenon appears the gafe composition in the first and second coordination shells of the bcc films is different from that expected for a random ga distribution and is close to a d0_3like ordered phase leading to a minimization of the number of gaga pairs on the other side a true longrange d0_3 phase is not observed indicating that atomic ordering only occurs at a local scale overall the epitaxial growth procedure presented in this work first avoids the formation of a long range ordered d0_3 phase which is known to be detrimental magnetostrictive properties and second demonstrates the possibility of growing fcc films at temperatures much smaller than those required to obtain bulk fcc samples | [['in', 'this', 'work', 'we', 'present', 'a', 'study', 'of', 'the', 'structural', 'properties', 'of', 'fe_100x', 'ga_x', 'grown', 'by', 'molecular', 'beam', 'epitaxy', 'on', 'mg0100', 'we', 'combine', 'long', 'range', 'and', 'localchemically', 'selective', 'xray', 'probes', 'xray', 'diffraction', 'and', 'xray', 'absorption', 'spectroscopy', 'together', 'with', 'real', 'space', 'imaging', 'by', 'means', 'of', 'transmission', 'electron', 'microscopy', 'and', 'surface', 'sensitive', 'in', 'situ', 'reflected', 'high', 'energy', 'electron', 'diffraction', 'for', 'substrate', 'temperature', 't_s', 'below', '400', 'oc', 'we', 'obtain', 'bcc', 'films', 'while', 'for', 'x', 'approx', '24', 'and', 't_s', 'geq', '400oc', 'the', 'nucleation', 'of', 'the', 'fcc', 'phase', 'is', 'observed', 'for', 'both', 'systems', 'a', 'ga', 'anticlustering', 'or', 'local', 'range', 'ordering', 'phenomenon', 'appears', 'the', 'gafe', 'composition', 'in', 'the', 'first', 'and', 'second', 'coordination', 'shells', 'of', 'the', 'bcc', 'films', 'is', 'different', 'from', 'that', 'expected', 'for', 'a', 'random', 'ga', 'distribution', 'and', 'is', 'close', 'to', 'a', 'd0_3like', 'ordered', 'phase', 'leading', 'to', 'a', 'minimization', 'of', 'the', 'number', 'of', 'gaga', 'pairs', 'on', 'the', 'other', 'side', 'a', 'true', 'longrange', 'd0_3', 'phase', 'is', 'not', 'observed', 'indicating', 'that', 'atomic', 'ordering', 'only', 'occurs', 'at', 'a', 'local', 'scale', 'overall', 'the', 'epitaxial', 'growth', 'procedure', 'presented', 'in', 'this', 'work', 'first', 'avoids', 'the', 'formation', 'of', 'a', 'long', 'range', 'ordered', 'd0_3', 'phase', 'which', 'is', 'known', 'to', 'be', 'detrimental', 'magnetostrictive', 'properties', 'and', 'second', 'demonstrates', 'the', 'possibility', 'of', 'growing', 'fcc', 'films', 'at', 'temperatures', 'much', 'smaller', 'than', 'those', 'required', 'to', 'obtain', 'bulk', 'fcc', 'samples']] | [-0.11333891156762405, 0.2055320895491533, -0.044655983976554126, 0.0314146588760766, -0.02369227055311842, -0.09422112542190864, 0.09856754359441088, 0.42991041225325843, -0.28258960420612755, -0.3185715195083735, 0.06974437193175796, -0.3183689527487492, -0.08118481533921451, 0.1675913829034578, 0.04550307424078175, 0.023568257315120862, -0.032531557141006556, -0.05281138130807199, -0.12047544731895495, -0.22367126848913876, 0.24786045674608984, 0.07213816516556179, 0.30482309281497316, 0.059819017881904184, 0.06264356927781858, 0.019634874358398877, 0.07407409583752536, 0.01914135515492971, -0.18007034328847488, 0.0610484460793326, 0.22973644105199947, -0.016284762794955398, 0.1954644236772997, -0.41550710317952666, -0.23334556753580532, 0.049314075362453164, 0.13400401688619135, 0.09040872750897418, -0.08551929758943837, -0.2051815821146638, 0.10679113672128604, -0.09007520228167813, -0.11109592356848118, -0.046143553219806954, -0.011759060240971545, 0.008396228474927792, -0.26115854482586476, 0.10794889205021273, 0.05342809445973413, 0.1099728813289902, -0.09971306508169601, -0.10779328345704604, -0.06511862524077479, 0.028698762489583196, 0.01013412694081518, 0.06632462779046311, 0.1560351477648296, -0.0720085533901903, -0.06736815218612843, 0.3931300893115501, -0.01894315993722914, -0.0148460443302682, 0.20300138870473294, -0.2193756989436224, -0.09638968484268487, 0.21487347313257701, 0.1266151192359365, 0.1342356869041824, -0.1293443250789435, 0.03536963626638502, 0.018043299416175988, 0.24229256871759014, 0.10955506706851142, 0.05310464710426316, 0.2056173669818022, 0.205312777791679, 0.06967306541342873, 0.14120097323885764, -0.13202911242450344, -0.027543508294768922, -0.2114654689223743, -0.1684711906743948, -0.20679944620796425, 0.04313404062728902, -0.08805327632759216, -0.16245593792558008, 0.3244827984411078, 0.10458013818453193, 0.2058906118002008, -0.011240005927438866, 0.2599212193499803, 0.05388008733964799, 0.054450430656217186, -0.0014011202192883573, 0.22662761257093983, 0.14092539616303482, 0.12737231035420088, -0.22859463068073405, 0.12504192869356998, -0.003316834623761037] |
1,802.08741 | Compressional modes in two-superfluid neutron stars with leptonic
buoyancy | We investigate the compressional modes of cold neutron stars with cores
consisting of superfluid neutrons, superconducting protons and normal fluid
electrons and muons, and crusts that contain superfluid neutrons plus a normal
fluid of (spherical) nuclei and electrons. We develop a two-fluid formalism for
the core that accounts for leptonic buoyancy, and an analogous treatment for
the crust. We adopt the Cowling approximation, neglecting gravitational
perturbations, but include all effects of the background space-time. We
introduce a phenomenological, easily-modified nuclear equation of state which
contains all of the thermodynamic information required to compute the coupled
fluid oscillations, with parameters that are constrained by nuclear physics and
the requirement that the maximum mass of a neutron star is $\geq 2M_{\odot}$.
Using four parametrizations of this equation of state with nuclear
compressibilities $K=230$-$280$ MeV, we calculate the Brunt-V\"{a}is\"{a}l\"{a}
frequency due to leptonic buoyancy, and find the corresponding $g$-mode
frequencies and eigenfunctions. We find that the WKB approximation reproduces
$g$-mode frequencies closely. We examine the dependence of $g$-mode frequencies
on stellar mass, nuclear compressibility and strength of neutron-proton
entrainment, and compare to previous calculations of $g$-mode frequencies due
to leptonic buoyancy. We also compute the $p$-mode spectra, confirming previous
findings that the two fluids behave as if uncoupled except the case of large
entrainment, and show the existence of nearly resonant mode pairs which could
lead to nonlinear $p$-$g$ instabilities even at zero temperature.
| astro-ph.HE | we investigate the compressional modes of cold neutron stars with cores consisting of superfluid neutrons superconducting protons and normal fluid electrons and muons and crusts that contain superfluid neutrons plus a normal fluid of spherical nuclei and electrons we develop a twofluid formalism for the core that accounts for leptonic buoyancy and an analogous treatment for the crust we adopt the cowling approximation neglecting gravitational perturbations but include all effects of the background spacetime we introduce a phenomenological easilymodified nuclear equation of state which contains all of the thermodynamic information required to compute the coupled fluid oscillations with parameters that are constrained by nuclear physics and the requirement that the maximum mass of a neutron star is geq 2m_odot using four parametrizations of this equation of state with nuclear compressibilities k230280 mev we calculate the bruntvaisala frequency due to leptonic buoyancy and find the corresponding gmode frequencies and eigenfunctions we find that the wkb approximation reproduces gmode frequencies closely we examine the dependence of gmode frequencies on stellar mass nuclear compressibility and strength of neutronproton entrainment and compare to previous calculations of gmode frequencies due to leptonic buoyancy we also compute the pmode spectra confirming previous findings that the two fluids behave as if uncoupled except the case of large entrainment and show the existence of nearly resonant mode pairs which could lead to nonlinear pg instabilities even at zero temperature | [['we', 'investigate', 'the', 'compressional', 'modes', 'of', 'cold', 'neutron', 'stars', 'with', 'cores', 'consisting', 'of', 'superfluid', 'neutrons', 'superconducting', 'protons', 'and', 'normal', 'fluid', 'electrons', 'and', 'muons', 'and', 'crusts', 'that', 'contain', 'superfluid', 'neutrons', 'plus', 'a', 'normal', 'fluid', 'of', 'spherical', 'nuclei', 'and', 'electrons', 'we', 'develop', 'a', 'twofluid', 'formalism', 'for', 'the', 'core', 'that', 'accounts', 'for', 'leptonic', 'buoyancy', 'and', 'an', 'analogous', 'treatment', 'for', 'the', 'crust', 'we', 'adopt', 'the', 'cowling', 'approximation', 'neglecting', 'gravitational', 'perturbations', 'but', 'include', 'all', 'effects', 'of', 'the', 'background', 'spacetime', 'we', 'introduce', 'a', 'phenomenological', 'easilymodified', 'nuclear', 'equation', 'of', 'state', 'which', 'contains', 'all', 'of', 'the', 'thermodynamic', 'information', 'required', 'to', 'compute', 'the', 'coupled', 'fluid', 'oscillations', 'with', 'parameters', 'that', 'are', 'constrained', 'by', 'nuclear', 'physics', 'and', 'the', 'requirement', 'that', 'the', 'maximum', 'mass', 'of', 'a', 'neutron', 'star', 'is', 'geq', '2m_odot', 'using', 'four', 'parametrizations', 'of', 'this', 'equation', 'of', 'state', 'with', 'nuclear', 'compressibilities', 'k230280', 'mev', 'we', 'calculate', 'the', 'bruntvaisala', 'frequency', 'due', 'to', 'leptonic', 'buoyancy', 'and', 'find', 'the', 'corresponding', 'gmode', 'frequencies', 'and', 'eigenfunctions', 'we', 'find', 'that', 'the', 'wkb', 'approximation', 'reproduces', 'gmode', 'frequencies', 'closely', 'we', 'examine', 'the', 'dependence', 'of', 'gmode', 'frequencies', 'on', 'stellar', 'mass', 'nuclear', 'compressibility', 'and', 'strength', 'of', 'neutronproton', 'entrainment', 'and', 'compare', 'to', 'previous', 'calculations', 'of', 'gmode', 'frequencies', 'due', 'to', 'leptonic', 'buoyancy', 'we', 'also', 'compute', 'the', 'pmode', 'spectra', 'confirming', 'previous', 'findings', 'that', 'the', 'two', 'fluids', 'behave', 'as', 'if', 'uncoupled', 'except', 'the', 'case', 'of', 'large', 'entrainment', 'and', 'show', 'the', 'existence', 'of', 'nearly', 'resonant', 'mode', 'pairs', 'which', 'could', 'lead', 'to', 'nonlinear', 'pg', 'instabilities', 'even', 'at', 'zero', 'temperature']] | [-0.11247219458607066, 0.25468613424005604, -0.06841150902903831, 0.09687847666867563, -0.08208345024525086, -0.08126726416142091, 0.04343996160339726, 0.293233957728776, -0.18756688510108252, -0.28204566934348446, -0.011995242018272857, -0.29464874857348267, -0.03665633873669836, 0.1690593862288591, 0.04104156296310501, -0.0029231855787498796, 0.06163996315267666, 0.011930385546799264, -0.07910042747288294, -0.14195044396809586, 0.3348377032833093, 0.04904077911101606, 0.21977557656760124, 0.03236345117709235, 0.04589213813381755, -0.06544931744954184, -0.006666070810498912, -0.027623569789221106, -0.18525203404512824, 0.00679452450460066, 0.23482752101130167, 0.03608568053725479, 0.17241269530849937, -0.4658659496304134, -0.22409356596029323, 0.10033049478560038, 0.140682193911356, 0.13613203474644409, -0.016014169049183534, -0.2016889731106146, 0.03712166025475396, -0.21562667066717278, -0.16967156370140046, -0.11122811159179749, 0.028867318250400866, 0.04739865722241002, -0.2674114400662644, 0.1580852883760362, 0.061235690724266614, -0.0012010286514376513, -0.1508160314006407, -0.1545314566637187, -0.032119479853376424, 0.04192567195783815, 0.10512246148883486, -0.0024459716297038224, 0.16943572183498992, -0.11534427726102243, -0.03624464376758703, 0.40908528731417154, -0.08588451486708515, -0.14014716216403506, 0.18906554023978178, -0.20867957351577426, -0.08287737837425717, 0.12996727861261562, 0.16360422313699255, 0.10064033749108406, -0.10341975002134543, 0.02817123365188625, -0.022131314900521514, 0.1822079726130418, 0.11569454719201135, 0.022408579727229865, 0.24489356100751572, 0.1568829282551356, -0.011236236535984536, 0.09641276650414195, -0.16089105357456465, -0.043105969569423114, -0.2987971393006813, -0.08124622790658222, -0.1268353653964131, 0.035218161436648146, -0.06841724141400925, -0.185218561476137, 0.3836576420429122, 0.08995500704192597, 0.14123831926035169, 0.013582849191279028, 0.30104066844543687, 0.11372510691264483, 0.03178489072939239, 0.15937197225816224, 0.340122785884887, 0.260691512814399, 0.054292873689985796, -0.3493554660878347, -0.011111239732607551, 0.03840310702748273] |
1,802.08742 | Giant galaxy growing from recycled gas: ALMA maps the circumgalactic
molecular medium of the Spiderweb in [CI] | The circumgalactic medium (CGM) of the massive Spiderweb Galaxy, a
conglomerate of merging proto-cluster galaxies at z=2.2, forms an enriched
interface where feedback and recycling act on accreted gas. This is shown by
observations of [CI], CO(1-0) and CO(4-3) performed with the Atacama Large
Millimeter Array (ALMA) and Australia Telescope Compact Array (ATCA). [CI] and
CO(4-3) are detected across ~50 kpc, following the distribution of previously
detected low-surface-brightness CO(1-0) across the CGM. This confirms our
previous results on the presence of a cold molecular halo. The central radio
galaxy MRC1138-262 shows a very high global $L'_{\rm CO(4-3)}$/$L'_{\rm
CO(1-0)}$ ~ 1, suggesting that mechanisms other than FUV-heating by star
formation prevail at the heart of the Spiderweb Galaxy. Contrary, the CGM has
$L'_{\rm CO(4-3)}$/$L'_{\rm CO(1-0)}$ and $L'_{\rm [CI]}$/$L'_{\rm CO(1-0)}$
similar to the ISM of five galaxies in the wider proto-cluster, and its carbon
abundance, $X_{\rm [CI]}$/$X_{\rm H2}$, resembles that of the Milky Way and
starforming galaxies. The molecular CGM is thus metal-rich and not diffuse,
confirming a link between the cold gas and in-situ star formation. Thus, the
Spiderweb Galaxy grows not directly through accretion of gas from the cosmic
web, but from recycled gas in the GCM.
| astro-ph.GA | the circumgalactic medium cgm of the massive spiderweb galaxy a conglomerate of merging protocluster galaxies at z22 forms an enriched interface where feedback and recycling act on accreted gas this is shown by observations of ci co10 and co43 performed with the atacama large millimeter array alma and australia telescope compact array atca ci and co43 are detected across 50 kpc following the distribution of previously detected lowsurfacebrightness co10 across the cgm this confirms our previous results on the presence of a cold molecular halo the central radio galaxy mrc1138262 shows a very high global l_rm co43l_rm co10 1 suggesting that mechanisms other than fuvheating by star formation prevail at the heart of the spiderweb galaxy contrary the cgm has l_rm co43l_rm co10 and l_rm cil_rm co10 similar to the ism of five galaxies in the wider protocluster and its carbon abundance x_rm cix_rm h2 resembles that of the milky way and starforming galaxies the molecular cgm is thus metalrich and not diffuse confirming a link between the cold gas and insitu star formation thus the spiderweb galaxy grows not directly through accretion of gas from the cosmic web but from recycled gas in the gcm | [['the', 'circumgalactic', 'medium', 'cgm', 'of', 'the', 'massive', 'spiderweb', 'galaxy', 'a', 'conglomerate', 'of', 'merging', 'protocluster', 'galaxies', 'at', 'z22', 'forms', 'an', 'enriched', 'interface', 'where', 'feedback', 'and', 'recycling', 'act', 'on', 'accreted', 'gas', 'this', 'is', 'shown', 'by', 'observations', 'of', 'ci', 'co10', 'and', 'co43', 'performed', 'with', 'the', 'atacama', 'large', 'millimeter', 'array', 'alma', 'and', 'australia', 'telescope', 'compact', 'array', 'atca', 'ci', 'and', 'co43', 'are', 'detected', 'across', '50', 'kpc', 'following', 'the', 'distribution', 'of', 'previously', 'detected', 'lowsurfacebrightness', 'co10', 'across', 'the', 'cgm', 'this', 'confirms', 'our', 'previous', 'results', 'on', 'the', 'presence', 'of', 'a', 'cold', 'molecular', 'halo', 'the', 'central', 'radio', 'galaxy', 'mrc1138262', 'shows', 'a', 'very', 'high', 'global', 'l_rm', 'co43l_rm', 'co10', '1', 'suggesting', 'that', 'mechanisms', 'other', 'than', 'fuvheating', 'by', 'star', 'formation', 'prevail', 'at', 'the', 'heart', 'of', 'the', 'spiderweb', 'galaxy', 'contrary', 'the', 'cgm', 'has', 'l_rm', 'co43l_rm', 'co10', 'and', 'l_rm', 'cil_rm', 'co10', 'similar', 'to', 'the', 'ism', 'of', 'five', 'galaxies', 'in', 'the', 'wider', 'protocluster', 'and', 'its', 'carbon', 'abundance', 'x_rm', 'cix_rm', 'h2', 'resembles', 'that', 'of', 'the', 'milky', 'way', 'and', 'starforming', 'galaxies', 'the', 'molecular', 'cgm', 'is', 'thus', 'metalrich', 'and', 'not', 'diffuse', 'confirming', 'a', 'link', 'between', 'the', 'cold', 'gas', 'and', 'insitu', 'star', 'formation', 'thus', 'the', 'spiderweb', 'galaxy', 'grows', 'not', 'directly', 'through', 'accretion', 'of', 'gas', 'from', 'the', 'cosmic', 'web', 'but', 'from', 'recycled', 'gas', 'in', 'the', 'gcm']] | [-0.04518442059177125, 0.05054380681375785, -0.019262995851270035, 0.06075356209757909, -0.08093204664819781, -0.01815780772734921, 0.02045518075267136, 0.4597276588658076, -0.08270192587026212, -0.2840563155398631, 0.02891800269796586, -0.29408911811139105, -0.004228539140748728, 0.17460730321539555, 0.07462149118780309, -0.07190998884726131, 0.008991825316315857, -0.19698307008716565, -0.016700318602464743, -0.295845286111245, 0.3006300201992436, 0.14092199437086184, 0.17810291680385462, -0.02236422463759039, 0.08524779179401656, -0.20182446435676565, -0.11616872960984395, -0.05893464045323607, -0.12637340642259814, 0.03076386803648976, 0.2861427473811267, 0.12753724001094466, 0.2286080868027285, -0.38013821162029865, -0.22069375493432059, 0.031042442032921065, 0.23129310647753454, 0.018476922128408055, -0.06486352891368664, -0.3403205844641941, 0.05539109855792753, -0.22257240074174722, -0.17975063252150622, 0.1920238754965599, -0.010310969512948659, 0.025399103447862646, -0.16963337451897328, 0.19287686505359816, -0.02196384305183176, 0.08468451944462643, -0.08970789366745492, -0.06524597371609013, -0.10440592261467675, 0.028893847884585915, -0.06204387619640405, 0.145180685684592, 0.30891739975914595, -0.153316349723664, 0.05982477671627677, 0.4178205954400988, -0.0823316879352434, 0.08071544129615991, 0.3204738438563392, -0.27724462795450416, -0.26945280865644206, 0.15570192382285733, 0.09988853166547862, 0.06298740926388827, -0.1429578976227819, 0.0067264774984299785, -0.10375418967484491, 0.2676304561337115, 0.03969637623619952, 0.06300157839852917, 0.3881764387034114, 0.08925232646196925, 0.0948383951570634, 0.10149186667992309, -0.234737393105249, -0.028546079106114473, -0.15486428386370862, -0.13882708829140086, -0.1494755322389129, 0.11537956748799548, -0.16892888711901632, -0.0624861554984742, 0.2649709733510244, 0.08915655934422506, 0.2370568680971939, 0.0748939423249542, 0.349357156960674, 0.009830208931054862, 0.1370820627341788, 0.15871309740127537, 0.26897344655718125, 0.20583515727638965, 0.08402933584555437, -0.2837766031624935, 0.10404826350100534, -0.02293638413508681] |
1,802.08743 | Evolution of Structure and Superconductivity in
Ba(Ni$_{1-x}$Co$_x$)$_2$As$_2$ | The effects of Co-substitution on Ba(Ni$_{1-x}$Co$_x$)$_2$As$_2$ ($0\leq
x\leq 0.251$) single crystals grown out of Pb flux are investigated via
transport, magnetic, and thermodynamic measurements. BaNi$_2$As$_2$ exhibits a
first order tetragonal to triclinic structural phase transition at $T_s=137 K$
upon cooling, and enters a superconducting phase below $T_c=0.7 K$. The
structural phase transition is sensitive to cobalt content and is suppressed
completely by $x\geq0.133$. The superconducting critical temperature, $T_c$,
increases continuously with $x$, reaching a maximum of $T_c=2.3 K$ at the
structural critical point $x=0.083$ and then decreases monotonically until
superconductivity is no longer observable well into the tetragonal phase. In
contrast to similar BaNi$_2$As$_2$ substitutional studies, which show an abrupt
change in $T_c$ at the triclinic-tetragonal boundary that extends far into the
tetragonal phase, Ba(Ni$_{1-x}$Co$_x$)$_2$As$_2$ exhibits a dome-like phase
diagram centered around the first-order critical point. Together with an
anomalously large heat capacity jump $\Delta C_e/\gamma T\sim 2.2$ at optimal
doping, the smooth evolution of $T_c$ in the Ba(Ni$_{1-x}$Co$_x$)$_2$As$_2$
system suggests a mechanism for pairing enhancement other than phonon
softening.
| cond-mat.supr-con | the effects of cosubstitution on bani_1xco_x_2as_2 0leq xleq 0251 single crystals grown out of pb flux are investigated via transport magnetic and thermodynamic measurements bani_2as_2 exhibits a first order tetragonal to triclinic structural phase transition at t_s137 k upon cooling and enters a superconducting phase below t_c07 k the structural phase transition is sensitive to cobalt content and is suppressed completely by xgeq0133 the superconducting critical temperature t_c increases continuously with x reaching a maximum of t_c23 k at the structural critical point x0083 and then decreases monotonically until superconductivity is no longer observable well into the tetragonal phase in contrast to similar bani_2as_2 substitutional studies which show an abrupt change in t_c at the triclinictetragonal boundary that extends far into the tetragonal phase bani_1xco_x_2as_2 exhibits a domelike phase diagram centered around the firstorder critical point together with an anomalously large heat capacity jump delta c_egamma tsim 22 at optimal doping the smooth evolution of t_c in the bani_1xco_x_2as_2 system suggests a mechanism for pairing enhancement other than phonon softening | [['the', 'effects', 'of', 'cosubstitution', 'on', 'bani_1xco_x_2as_2', '0leq', 'xleq', '0251', 'single', 'crystals', 'grown', 'out', 'of', 'pb', 'flux', 'are', 'investigated', 'via', 'transport', 'magnetic', 'and', 'thermodynamic', 'measurements', 'bani_2as_2', 'exhibits', 'a', 'first', 'order', 'tetragonal', 'to', 'triclinic', 'structural', 'phase', 'transition', 'at', 't_s137', 'k', 'upon', 'cooling', 'and', 'enters', 'a', 'superconducting', 'phase', 'below', 't_c07', 'k', 'the', 'structural', 'phase', 'transition', 'is', 'sensitive', 'to', 'cobalt', 'content', 'and', 'is', 'suppressed', 'completely', 'by', 'xgeq0133', 'the', 'superconducting', 'critical', 'temperature', 't_c', 'increases', 'continuously', 'with', 'x', 'reaching', 'a', 'maximum', 'of', 't_c23', 'k', 'at', 'the', 'structural', 'critical', 'point', 'x0083', 'and', 'then', 'decreases', 'monotonically', 'until', 'superconductivity', 'is', 'no', 'longer', 'observable', 'well', 'into', 'the', 'tetragonal', 'phase', 'in', 'contrast', 'to', 'similar', 'bani_2as_2', 'substitutional', 'studies', 'which', 'show', 'an', 'abrupt', 'change', 'in', 't_c', 'at', 'the', 'triclinictetragonal', 'boundary', 'that', 'extends', 'far', 'into', 'the', 'tetragonal', 'phase', 'bani_1xco_x_2as_2', 'exhibits', 'a', 'domelike', 'phase', 'diagram', 'centered', 'around', 'the', 'firstorder', 'critical', 'point', 'together', 'with', 'an', 'anomalously', 'large', 'heat', 'capacity', 'jump', 'delta', 'c_egamma', 'tsim', '22', 'at', 'optimal', 'doping', 'the', 'smooth', 'evolution', 'of', 't_c', 'in', 'the', 'bani_1xco_x_2as_2', 'system', 'suggests', 'a', 'mechanism', 'for', 'pairing', 'enhancement', 'other', 'than', 'phonon', 'softening']] | [-0.1810900553970075, 0.2825171336243795, -0.0433603592441281, -0.04195280660514538, -0.036188058367725914, -0.1655876779355245, 0.19051163425106873, 0.3879230481504304, -0.2659087312899717, -0.24616785576885067, 0.022547976807378824, -0.3852799443141898, -0.06061916941600829, 0.12811455478687295, 0.058817820879062864, 0.006902034214851106, -0.09628603839820887, 0.04250661546446769, -0.2057907154951131, -0.18243376208787285, 0.2677677490140834, 0.032606648274118126, 0.32367929529466827, 0.08201301288003068, 0.024728920997515117, -0.04918789552246425, 0.16608454521870378, 0.03759604788998642, -0.19647175779946116, -0.09426362827212958, 0.2763636030495258, -0.07939585436010597, 0.1767304879272493, -0.34833520409230867, -0.25235113359862804, 0.04472517491766911, 0.148107370818119, 0.06912841722610542, -0.04508851034064187, -0.23551250743202684, 0.07069733835722707, -0.05723450528372579, -0.11339152337438087, -0.059434110376836234, -0.01447686704625262, -0.05670139207163962, -0.24355411193924162, 0.13450914357289126, 0.08299984977361974, 0.12361734975470094, -0.0877118092585744, -0.15522374619556614, -0.11276067147122287, 0.005274981990024992, 0.024599368807507634, 0.15838677988376287, 0.181974022901935, -0.06378118472071592, -0.004981218533385999, 0.3358972186631546, -0.045976513919080524, 0.059344029817843764, 0.13241133197329985, -0.21543877126035713, -0.12090895409932184, 0.28434848871718094, 0.07479362698022003, 0.08088800465267879, -0.1013502181200992, 0.06679414629385375, 0.06946307951910989, 0.2529406226257845, 0.05254108387204569, 0.03461501757236675, 0.23116812511154156, 0.23310035139481286, 0.07552958165136416, 0.16624122044027545, -0.09316152683317253, -0.08697458546219689, -0.2476968742884332, -0.15904380938907087, -0.1718155091668184, 0.05314419590924844, -0.14068544549525364, -0.17157989366422977, 0.3071436276296015, 0.1262260558830415, 0.2351195782156116, -0.05198841134764867, 0.18585382400026612, 0.11384158772515791, 0.07415688466905367, 0.07148200571934533, 0.2310103448959658, 0.15158842456464588, 0.183617253163148, -0.3151404865074721, 0.11416399667448388, 0.019165852098589446] |
1,802.08744 | Biophysical inference of epistasis and the effects of mutations on
protein stability and function | Understanding the relationship between protein sequence, function, and
stability is a fundamental problem in biology. While high-throughput methods
have produced large numbers of sequence-function pairs, functional assays do
not distinguish whether mutations directly affect function or are destabilizing
the protein. Here, we introduce a statistical method to infer the underlying
biophysics from a high-throughput binding assay by combining information from
many mutated variants. We fit a thermodynamic model describing the bound,
unbound, and unfolded states to high quality data of protein G domain B1
binding to IgG-Fc. We infer an energy landscape with distinct folding and
binding energies for each substitution providing a detailed view of how
mutations affect binding and stability across the protein. We accurately infer
folding energy of each variant in physical units, validated by independent
data, whereas previous high-throughput methods could only measure indirect
changes in stability. While we assume an additive sequence-energy relationship,
the binding fraction is epistatic due its non-linear relation to energy.
Despite having no epistasis in energy, our model explains much of the observed
epistasis in binding fraction, with the remaining epistasis identifying
conformationally dynamic regions.
| q-bio.BM q-bio.PE q-bio.QM | understanding the relationship between protein sequence function and stability is a fundamental problem in biology while highthroughput methods have produced large numbers of sequencefunction pairs functional assays do not distinguish whether mutations directly affect function or are destabilizing the protein here we introduce a statistical method to infer the underlying biophysics from a highthroughput binding assay by combining information from many mutated variants we fit a thermodynamic model describing the bound unbound and unfolded states to high quality data of protein g domain b1 binding to iggfc we infer an energy landscape with distinct folding and binding energies for each substitution providing a detailed view of how mutations affect binding and stability across the protein we accurately infer folding energy of each variant in physical units validated by independent data whereas previous highthroughput methods could only measure indirect changes in stability while we assume an additive sequenceenergy relationship the binding fraction is epistatic due its nonlinear relation to energy despite having no epistasis in energy our model explains much of the observed epistasis in binding fraction with the remaining epistasis identifying conformationally dynamic regions | [['understanding', 'the', 'relationship', 'between', 'protein', 'sequence', 'function', 'and', 'stability', 'is', 'a', 'fundamental', 'problem', 'in', 'biology', 'while', 'highthroughput', 'methods', 'have', 'produced', 'large', 'numbers', 'of', 'sequencefunction', 'pairs', 'functional', 'assays', 'do', 'not', 'distinguish', 'whether', 'mutations', 'directly', 'affect', 'function', 'or', 'are', 'destabilizing', 'the', 'protein', 'here', 'we', 'introduce', 'a', 'statistical', 'method', 'to', 'infer', 'the', 'underlying', 'biophysics', 'from', 'a', 'highthroughput', 'binding', 'assay', 'by', 'combining', 'information', 'from', 'many', 'mutated', 'variants', 'we', 'fit', 'a', 'thermodynamic', 'model', 'describing', 'the', 'bound', 'unbound', 'and', 'unfolded', 'states', 'to', 'high', 'quality', 'data', 'of', 'protein', 'g', 'domain', 'b1', 'binding', 'to', 'iggfc', 'we', 'infer', 'an', 'energy', 'landscape', 'with', 'distinct', 'folding', 'and', 'binding', 'energies', 'for', 'each', 'substitution', 'providing', 'a', 'detailed', 'view', 'of', 'how', 'mutations', 'affect', 'binding', 'and', 'stability', 'across', 'the', 'protein', 'we', 'accurately', 'infer', 'folding', 'energy', 'of', 'each', 'variant', 'in', 'physical', 'units', 'validated', 'by', 'independent', 'data', 'whereas', 'previous', 'highthroughput', 'methods', 'could', 'only', 'measure', 'indirect', 'changes', 'in', 'stability', 'while', 'we', 'assume', 'an', 'additive', 'sequenceenergy', 'relationship', 'the', 'binding', 'fraction', 'is', 'epistatic', 'due', 'its', 'nonlinear', 'relation', 'to', 'energy', 'despite', 'having', 'no', 'epistasis', 'in', 'energy', 'our', 'model', 'explains', 'much', 'of', 'the', 'observed', 'epistasis', 'in', 'binding', 'fraction', 'with', 'the', 'remaining', 'epistasis', 'identifying', 'conformationally', 'dynamic', 'regions']] | [-0.07563107656980199, 0.1228346800878401, -0.05825526003084903, 0.1468582346876776, -0.060338740419036106, -0.14465384805769466, 0.11832897975761955, 0.3729987920538246, -0.30703701226521735, -0.3432837091283975, -0.03439407890910733, -0.28103219094983006, -0.17498064372089825, 0.13102546524049222, -0.03667641168838919, -0.0027069360255084643, 0.11016361537622288, 0.031114666914608288, 0.018440292580155553, -0.16806758116229673, 0.2507162602403416, 0.08012351462397478, 0.277449126200556, 0.08200814443701816, 0.07430195609225308, -0.01580229278520814, -0.02159004810312251, 0.008336062161865962, -0.19721449812321545, 0.17343537174527449, 0.266540109449844, 0.14126882739495428, 0.29851571854285813, -0.41407804334392917, -0.25390148323456563, 0.1490470176258196, 0.16090669262141072, 0.153848426822051, -0.04920903098920442, -0.21537285106727383, 0.07781474089127156, -0.1218382659116197, -0.0653714893275749, -0.10823795265917267, 0.01360257827116504, 0.07230294394373361, -0.21305894360437497, 0.1537639068767101, -0.022794323242563693, 0.0976874435281798, -0.1360544387761575, -0.13263679695428238, -0.08306368466615063, 0.17486771899096382, 0.069794231267124, 0.031939991477334485, 0.2111200449788677, -0.12022749236324332, -0.09687827773274506, 0.3561373251505646, -0.015123603956333801, -0.22028278391603584, 0.22110876778990113, -0.11764522223825474, -0.2061259130867976, 0.1613956253622546, 0.12895547459797504, 0.07548093904771812, -0.1819537696070396, 0.05077010680343137, 0.04743259838733638, 0.23998560633633162, 0.0838249017904093, 0.01155023283905933, 0.21551510633307172, 0.20478328165808016, 0.01721680396368246, 0.10812394331199127, -0.07753631147776045, -0.10160344810951706, -0.2012144711845974, -0.12905553931749048, -0.16829372087754513, 0.04002798800262339, -0.0657198969271561, -0.18436450179753272, 0.3870436166525706, 0.09080294501241092, 0.21308033176247482, 0.0699852399608302, 0.24883191360053247, 0.02459794809404699, 0.09477837933905443, -0.014737819269002712, 0.18079261280401804, 0.09709125563149228, 0.04176109566757517, -0.2602753215315905, 0.1564087476120791, 0.015385042917901895] |
1,802.08745 | Interacting partially directed self-avoiding walk: a probabilistic
perspective | We review some recent results obtained in the framework of the 2-dimensional
Interacting Self-Avoiding Walk (ISAW). After a brief presentation of the
rigorous results that have been obtained so far for ISAW we focus on the
Interacting Partially Directed Self-Avoiding Walk (IPDSAW), a model introduced
in Zwanzig and Lauritzen (1968) to decrease the mathematical complexity of
ISAW. In the first part of the paper, we discuss how a new probabilistic
approach based on a random walk representation (see Nguyen and P\'etr\'elis
(2013)) allowed for a sharp determination of the asymptotics of the free energy
close to criticality (see Carmona, Nguyen and P\'etr\'elis (2016)). Some
scaling limits of IPDSAW were conjectured in the physics literature (see e.g.
Brak et al. (1993)). We discuss here the fact that all limits are now proven
rigorously, i.e., for the extended regime in Carmona and P\'etr\'elis (2016),
for the collapsed regime in Carmona, Nguyen and P\'etr\'elis (2016) and at
criticality in Carmona and P\'etr\'elis (2017a). The second part of the paper
starts with the description of four open questions related to physically
relevant extensions of IPDSAW. Among such extensions is the Interacting Prudent
Self-Avoiding Walk (IPSAW) whose configurations are those of the 2-dimensional
prudent walk. We discuss the main results obtained in P\'etr\'elis and Torri
(2016+) about IPSAW and in particular the fact that its collapse transition is
proven to exist rigorously.
| math.PR | we review some recent results obtained in the framework of the 2dimensional interacting selfavoiding walk isaw after a brief presentation of the rigorous results that have been obtained so far for isaw we focus on the interacting partially directed selfavoiding walk ipdsaw a model introduced in zwanzig and lauritzen 1968 to decrease the mathematical complexity of isaw in the first part of the paper we discuss how a new probabilistic approach based on a random walk representation see nguyen and petrelis 2013 allowed for a sharp determination of the asymptotics of the free energy close to criticality see carmona nguyen and petrelis 2016 some scaling limits of ipdsaw were conjectured in the physics literature see eg brak et al 1993 we discuss here the fact that all limits are now proven rigorously ie for the extended regime in carmona and petrelis 2016 for the collapsed regime in carmona nguyen and petrelis 2016 and at criticality in carmona and petrelis 2017a the second part of the paper starts with the description of four open questions related to physically relevant extensions of ipdsaw among such extensions is the interacting prudent selfavoiding walk ipsaw whose configurations are those of the 2dimensional prudent walk we discuss the main results obtained in petrelis and torri 2016 about ipsaw and in particular the fact that its collapse transition is proven to exist rigorously | [['we', 'review', 'some', 'recent', 'results', 'obtained', 'in', 'the', 'framework', 'of', 'the', '2dimensional', 'interacting', 'selfavoiding', 'walk', 'isaw', 'after', 'a', 'brief', 'presentation', 'of', 'the', 'rigorous', 'results', 'that', 'have', 'been', 'obtained', 'so', 'far', 'for', 'isaw', 'we', 'focus', 'on', 'the', 'interacting', 'partially', 'directed', 'selfavoiding', 'walk', 'ipdsaw', 'a', 'model', 'introduced', 'in', 'zwanzig', 'and', 'lauritzen', '1968', 'to', 'decrease', 'the', 'mathematical', 'complexity', 'of', 'isaw', 'in', 'the', 'first', 'part', 'of', 'the', 'paper', 'we', 'discuss', 'how', 'a', 'new', 'probabilistic', 'approach', 'based', 'on', 'a', 'random', 'walk', 'representation', 'see', 'nguyen', 'and', 'petrelis', '2013', 'allowed', 'for', 'a', 'sharp', 'determination', 'of', 'the', 'asymptotics', 'of', 'the', 'free', 'energy', 'close', 'to', 'criticality', 'see', 'carmona', 'nguyen', 'and', 'petrelis', '2016', 'some', 'scaling', 'limits', 'of', 'ipdsaw', 'were', 'conjectured', 'in', 'the', 'physics', 'literature', 'see', 'eg', 'brak', 'et', 'al', '1993', 'we', 'discuss', 'here', 'the', 'fact', 'that', 'all', 'limits', 'are', 'now', 'proven', 'rigorously', 'ie', 'for', 'the', 'extended', 'regime', 'in', 'carmona', 'and', 'petrelis', '2016', 'for', 'the', 'collapsed', 'regime', 'in', 'carmona', 'nguyen', 'and', 'petrelis', '2016', 'and', 'at', 'criticality', 'in', 'carmona', 'and', 'petrelis', '2017a', 'the', 'second', 'part', 'of', 'the', 'paper', 'starts', 'with', 'the', 'description', 'of', 'four', 'open', 'questions', 'related', 'to', 'physically', 'relevant', 'extensions', 'of', 'ipdsaw', 'among', 'such', 'extensions', 'is', 'the', 'interacting', 'prudent', 'selfavoiding', 'walk', 'ipsaw', 'whose', 'configurations', 'are', 'those', 'of', 'the', '2dimensional', 'prudent', 'walk', 'we', 'discuss', 'the', 'main', 'results', 'obtained', 'in', 'petrelis', 'and', 'torri', '2016', 'about', 'ipsaw', 'and', 'in', 'particular', 'the', 'fact', 'that', 'its', 'collapse', 'transition', 'is', 'proven', 'to', 'exist', 'rigorously']] | [-0.06337191738569822, 0.1446213197249751, -0.07120648374276375, 0.05850585148719012, -0.05164452322803864, -0.14179723168875086, 0.06349367050542229, 0.32261829513908746, -0.18515105226429976, -0.2666488217501716, 0.11156371352724354, -0.28795883508136555, -0.2051110696232168, 0.17085290836305705, -0.0900348808902566, 0.04775508944358521, 0.017319830573504454, 0.0006414584175474318, -0.004615994202104369, -0.29423716757036256, 0.23678255752077745, 0.07332151539681175, 0.24063520199036645, 0.07717219881286705, 0.07289669298185322, 0.0319479550265744, -0.046525064604520994, 0.012188216797506953, -0.23413131455323502, 0.08009858971711921, 0.1800973164363834, 0.06381010857722537, 0.24003517846257624, -0.3776428560574543, -0.19435898276735178, 0.08298265352734419, 0.12235594417668812, 0.11318890631018362, -0.009013215938402496, -0.3293925974403184, 0.024003542631470684, -0.1690517968953575, -0.13347135499296175, -0.014340915337680851, 0.07839236155640547, 0.023744978381439814, -0.20539731653212337, 0.07441743857551382, 0.11917283158841141, 0.04365936865299809, -0.008170190741131615, -0.12223199392373506, 0.025903509270965474, 0.0888148306844354, 0.002360519852042034, 0.03546465116723272, 0.05681156687590289, -0.10149205069053541, -0.1612452423386686, 0.3448960945699446, -0.031073454003329778, -0.11570378935317374, 0.21624026397327248, -0.15209324115637016, -0.2323781820526962, 0.06475820731256765, 0.12284504368671499, 0.09700820829190052, -0.15437333234114006, 0.16158339829416946, -0.09241005750003758, 0.05406498467285055, 0.08187748867575292, -0.03506546845610381, 0.13818931469841478, 0.13935354285994503, -0.006734912081658512, 0.1469566966335203, -0.02167564016020147, -0.1500746038619794, -0.2724979221390043, -0.1540101777617553, -0.20027317569872144, 0.050045989455843945, -0.037856181149536615, -0.16009981668911186, 0.36510369355999556, 0.18177750037515347, 0.21038150711042503, 0.09602569318827783, 0.16409031274812583, 0.08147787144161465, -0.046257682542095065, 0.12293384012372319, 0.24346078431596857, 0.15073669910541682, 0.12925716055893557, -0.12515836349975148, 0.024245527223683894, 0.14514875517222653] |
1,802.08746 | Dynamics in multiple-well Bose-Einstein condensates | We study the dynamics of three-dimensional weakly linked Bose-Einstein
condensates using a multimode model with an effective interaction parameter.
The system is confined by a ring-shaped four-well trapping potential. By
constructing a two-mode Hamiltonian in a reduced highly symmetric phase space,
we examine the periodic orbits and calculate their time periods both in the
self-trapping and Josephson regimes. The dynamics in the vicinity of the
reduced phase space is investigated by means of a Floquet multiplier analysis,
finding regions of different linear stability and analyzing their implications
on the exact dynamics. The numerical exploration in an extended region of the
phase space demonstrates that two-mode tools can also be useful for performing
a partition of the space in different regimes. Comparisons with
Gross-Pitaevskii simulations confirm these findings and emphasize the
importance of properly determining the effective on-site interaction parameter
governing the multimode dynamics.
| cond-mat.quant-gas | we study the dynamics of threedimensional weakly linked boseeinstein condensates using a multimode model with an effective interaction parameter the system is confined by a ringshaped fourwell trapping potential by constructing a twomode hamiltonian in a reduced highly symmetric phase space we examine the periodic orbits and calculate their time periods both in the selftrapping and josephson regimes the dynamics in the vicinity of the reduced phase space is investigated by means of a floquet multiplier analysis finding regions of different linear stability and analyzing their implications on the exact dynamics the numerical exploration in an extended region of the phase space demonstrates that twomode tools can also be useful for performing a partition of the space in different regimes comparisons with grosspitaevskii simulations confirm these findings and emphasize the importance of properly determining the effective onsite interaction parameter governing the multimode dynamics | [['we', 'study', 'the', 'dynamics', 'of', 'threedimensional', 'weakly', 'linked', 'boseeinstein', 'condensates', 'using', 'a', 'multimode', 'model', 'with', 'an', 'effective', 'interaction', 'parameter', 'the', 'system', 'is', 'confined', 'by', 'a', 'ringshaped', 'fourwell', 'trapping', 'potential', 'by', 'constructing', 'a', 'twomode', 'hamiltonian', 'in', 'a', 'reduced', 'highly', 'symmetric', 'phase', 'space', 'we', 'examine', 'the', 'periodic', 'orbits', 'and', 'calculate', 'their', 'time', 'periods', 'both', 'in', 'the', 'selftrapping', 'and', 'josephson', 'regimes', 'the', 'dynamics', 'in', 'the', 'vicinity', 'of', 'the', 'reduced', 'phase', 'space', 'is', 'investigated', 'by', 'means', 'of', 'a', 'floquet', 'multiplier', 'analysis', 'finding', 'regions', 'of', 'different', 'linear', 'stability', 'and', 'analyzing', 'their', 'implications', 'on', 'the', 'exact', 'dynamics', 'the', 'numerical', 'exploration', 'in', 'an', 'extended', 'region', 'of', 'the', 'phase', 'space', 'demonstrates', 'that', 'twomode', 'tools', 'can', 'also', 'be', 'useful', 'for', 'performing', 'a', 'partition', 'of', 'the', 'space', 'in', 'different', 'regimes', 'comparisons', 'with', 'grosspitaevskii', 'simulations', 'confirm', 'these', 'findings', 'and', 'emphasize', 'the', 'importance', 'of', 'properly', 'determining', 'the', 'effective', 'onsite', 'interaction', 'parameter', 'governing', 'the', 'multimode', 'dynamics']] | [-0.18069188731133945, 0.17039513645609808, -0.07963137747394247, 0.07305651067730065, 0.010621300660777133, -0.11007614704695615, 0.04555230890726345, 0.3492994650781571, -0.23635462745763622, -0.24543157815151698, 0.07698922392413984, -0.22496288397509795, -0.16606570851266175, 0.205189630026128, 0.04707600880178975, 0.04880327730068377, 0.06106448077070718, -0.04449750878766726, -0.07953056165707538, -0.19294245723126965, 0.33868518556383526, 0.036803189652053626, 0.27253181622786954, 0.0003568796193474656, 0.05258895774287256, 0.03308485503555959, 0.003513887124070963, 0.030977141305029234, -0.17700200334340505, 0.07587426345652112, 0.20974701268751486, 0.019982511244414674, 0.2742174379788079, -0.4352399255767777, -0.25656175441792484, 0.10362252627883653, 0.18441315836084266, 0.13601847459282074, -0.046173553032982914, -0.3509034940490981, -0.025064784054924454, -0.16346335353433983, -0.1942205233108643, -0.1316281401656464, 0.029382272506657, 0.04339119527770623, -0.26120896064318144, 0.04764213468134566, 0.020951315958844172, 0.04924951433822825, -0.08450785231730946, -0.008395904739439436, -0.03797268432278473, 0.10445988601011752, -0.03144638994269047, -0.022544537018007644, 0.11106733835491163, -0.1518437465692714, -0.08209046147685577, 0.37839641295034776, -0.07451752904099185, -0.21445572092946802, 0.18705108968567077, -0.1346940743391747, -0.04489416755911718, 0.13270040432842353, 0.14518048234244849, 0.11745676639574495, -0.13298709768723774, 0.10155635243574795, -0.013753532716952316, 0.1655764797713829, 0.01795440946764254, 0.03802942062591339, 0.24579994129733398, 0.21292589997573125, 0.015493071625022205, 0.18313694665114025, -0.08225309642819831, -0.18552378000743636, -0.2857877673105812, -0.12866921034654588, -0.1807674370686543, -0.024434487969562463, -0.12631059790207594, -0.1380139565538172, 0.434560839847134, 0.12716743942363173, 0.17834638499726468, -0.020723023100176475, 0.25263612688733983, 0.1502731218478167, -0.015341235438713453, 0.02998869351625859, 0.27149637534699916, 0.14570135541481677, 0.05968277347827708, -0.31820109395075824, -0.0015353313516955692, 0.06263892307643082] |
1,802.08747 | Data-driven brain network models predict individual variability in
behavior | The relationship between brain structure and function has been probed using a
variety of approaches, but how the underlying structural connectivity of the
human brain drives behavior is far from understood. To investigate the effect
of anatomical brain organization on human task performance, we use a
data-driven computational modeling approach and explore the functional effects
of naturally occurring structural differences in brain networks. We construct
personalized brain network models by combining anatomical connectivity
estimated from diffusion spectrum imaging of individual subjects with a
nonlinear model of brain dynamics. By performing computational experiments in
which we measure the excitability of the global brain network and spread of
synchronization following a targeted computational stimulation, we quantify how
individual variation in the underlying connectivity impacts both local and
global brain dynamics. We further relate the computational results to
individual variability in the subjects' performance of three language-demanding
tasks both before and after transcranial magnetic stimulation to the
left-inferior frontal gyrus. Our results show that task performance correlates
with either local or global measures of functional activity, depending on the
complexity of the task. By emphasizing differences in the underlying structural
connectivity, our model serves as a powerful tool to predict individual
differences in task performances, to dissociate the effect of targeted
stimulation in tasks that differ in cognitive complexity, and to pave the way
for the development of personalized therapeutics.
| q-bio.NC physics.data-an | the relationship between brain structure and function has been probed using a variety of approaches but how the underlying structural connectivity of the human brain drives behavior is far from understood to investigate the effect of anatomical brain organization on human task performance we use a datadriven computational modeling approach and explore the functional effects of naturally occurring structural differences in brain networks we construct personalized brain network models by combining anatomical connectivity estimated from diffusion spectrum imaging of individual subjects with a nonlinear model of brain dynamics by performing computational experiments in which we measure the excitability of the global brain network and spread of synchronization following a targeted computational stimulation we quantify how individual variation in the underlying connectivity impacts both local and global brain dynamics we further relate the computational results to individual variability in the subjects performance of three languagedemanding tasks both before and after transcranial magnetic stimulation to the leftinferior frontal gyrus our results show that task performance correlates with either local or global measures of functional activity depending on the complexity of the task by emphasizing differences in the underlying structural connectivity our model serves as a powerful tool to predict individual differences in task performances to dissociate the effect of targeted stimulation in tasks that differ in cognitive complexity and to pave the way for the development of personalized therapeutics | [['the', 'relationship', 'between', 'brain', 'structure', 'and', 'function', 'has', 'been', 'probed', 'using', 'a', 'variety', 'of', 'approaches', 'but', 'how', 'the', 'underlying', 'structural', 'connectivity', 'of', 'the', 'human', 'brain', 'drives', 'behavior', 'is', 'far', 'from', 'understood', 'to', 'investigate', 'the', 'effect', 'of', 'anatomical', 'brain', 'organization', 'on', 'human', 'task', 'performance', 'we', 'use', 'a', 'datadriven', 'computational', 'modeling', 'approach', 'and', 'explore', 'the', 'functional', 'effects', 'of', 'naturally', 'occurring', 'structural', 'differences', 'in', 'brain', 'networks', 'we', 'construct', 'personalized', 'brain', 'network', 'models', 'by', 'combining', 'anatomical', 'connectivity', 'estimated', 'from', 'diffusion', 'spectrum', 'imaging', 'of', 'individual', 'subjects', 'with', 'a', 'nonlinear', 'model', 'of', 'brain', 'dynamics', 'by', 'performing', 'computational', 'experiments', 'in', 'which', 'we', 'measure', 'the', 'excitability', 'of', 'the', 'global', 'brain', 'network', 'and', 'spread', 'of', 'synchronization', 'following', 'a', 'targeted', 'computational', 'stimulation', 'we', 'quantify', 'how', 'individual', 'variation', 'in', 'the', 'underlying', 'connectivity', 'impacts', 'both', 'local', 'and', 'global', 'brain', 'dynamics', 'we', 'further', 'relate', 'the', 'computational', 'results', 'to', 'individual', 'variability', 'in', 'the', 'subjects', 'performance', 'of', 'three', 'languagedemanding', 'tasks', 'both', 'before', 'and', 'after', 'transcranial', 'magnetic', 'stimulation', 'to', 'the', 'leftinferior', 'frontal', 'gyrus', 'our', 'results', 'show', 'that', 'task', 'performance', 'correlates', 'with', 'either', 'local', 'or', 'global', 'measures', 'of', 'functional', 'activity', 'depending', 'on', 'the', 'complexity', 'of', 'the', 'task', 'by', 'emphasizing', 'differences', 'in', 'the', 'underlying', 'structural', 'connectivity', 'our', 'model', 'serves', 'as', 'a', 'powerful', 'tool', 'to', 'predict', 'individual', 'differences', 'in', 'task', 'performances', 'to', 'dissociate', 'the', 'effect', 'of', 'targeted', 'stimulation', 'in', 'tasks', 'that', 'differ', 'in', 'cognitive', 'complexity', 'and', 'to', 'pave', 'the', 'way', 'for', 'the', 'development', 'of', 'personalized', 'therapeutics']] | [-0.06720077535447976, 0.05451039138043092, -0.07559086744983991, 0.09112781477936854, -0.08137194183551603, -0.1021408471196062, 0.05741146160134425, 0.4333209309530341, -0.2780443517201477, -0.3453819722019964, 0.048312861306799786, -0.25031034919329814, -0.2911178859975189, 0.16518543599044078, -0.08916471950295898, 0.038704961333423854, 0.06864285226497385, 0.06156530141002602, -0.023035230057107076, -0.196673207634853, 0.2703847686491079, 0.053641387806791396, 0.3317604515411788, 0.04230548046115372, 0.06554022272841797, -0.02947693668305874, -0.026029483353098234, 0.03904067923107909, -0.10294081765000657, 0.17509793023268383, 0.30072400868322197, 0.20577367840541733, 0.3408041483939936, -0.503459269652764, -0.2782443702940105, 0.08108228868908353, 0.12139799216555225, 0.05670200782465852, -0.015612025468920668, -0.3196025399987896, 0.0754268538662129, -0.10286471422502978, -0.033800498086752166, -0.09743578838805357, -0.022501721928517023, 0.011630289060994982, -0.23962206702653527, 0.1267116822498954, 0.016762586536092892, 0.14368506035457054, -0.0839155997755006, -0.053177816003250576, -0.03479107769620087, 0.2580903903777815, 0.04957392269331548, 0.032569494435770646, 0.23053583786719375, -0.21438186589524977, -0.15275932917578353, 0.3103895168606606, 0.002981320014740858, -0.19269556866130896, 0.22368172272005016, -0.13595778954900906, -0.1581059645778603, 0.09233840060006414, 0.2206789183958123, 0.033692433651950626, -0.15971730640183926, 0.002975322083156142, 0.04897740893686811, 0.18907339886658722, 0.026964730962903964, 0.027791828828242916, 0.1497853504649053, 0.28300524639586605, 0.015386314667347405, 0.1335700663158463, -0.10695263104590898, -0.06242706209214197, -0.19510511070903805, -0.10268643409013749, -0.1406326930380116, 0.017600770795510874, -0.09473786676056786, -0.13109107783271207, 0.4764007065859106, 0.1847146529238671, 0.19002916247480445, 0.07197761171859586, 0.2824761765745158, 0.010513931705823374, 0.07236976427077833, 0.01818910393449995, 0.19500304760618342, 0.09591368125433089, 0.11419777466605106, -0.2904938241839409, 0.1420919572096318, 0.0035144786536693575] |
1,802.08748 | Automatic Generation of Precise and Useful Commutativity Conditions
(Extended Version) | Reasoning about commutativity between data-structure operations is an
important problem with applications including parallelizing compilers,
optimistic parallelization and, more recently, Ethereum smart contracts. There
have been research results on automatic generation of commutativity conditions,
yet we are unaware of any fully automated technique to generate conditions that
are both sound and effective.
We have designed such a technique, driven by an algorithm that iteratively
refines a conservative approximation of the commutativity (and
non-commutativity) condition for a pair of methods into an increasingly precise
version. The algorithm terminates if/when the entire state space has been
considered, and can be aborted at any time to obtain a partial yet sound
commutativity condition. We have generalized our work to left-/right-movers and
proved relative completeness. We describe aspects of our technique that lead to
useful commutativity conditions, including how predicates are selected during
refinement and heuristics that impact the output shape of the condition.
We have implemented our technique in a prototype open-source tool Servois.
Our algorithm produces quantifier-free queries that are dispatched to a
back-end SMT solver. We evaluate Servois through two case studies: (i) We
synthesize commutativity conditions for a range of data structures including
Set, HashTable, Accumulator, Counter, and Stack. (ii) We consider an Ethereum
smart contract called BlockKing, and show that Servois can detect serious
concurrency-related vulnerabilities and guide developers to construct robust
and efficient implementations.
| cs.PL | reasoning about commutativity between datastructure operations is an important problem with applications including parallelizing compilers optimistic parallelization and more recently ethereum smart contracts there have been research results on automatic generation of commutativity conditions yet we are unaware of any fully automated technique to generate conditions that are both sound and effective we have designed such a technique driven by an algorithm that iteratively refines a conservative approximation of the commutativity and noncommutativity condition for a pair of methods into an increasingly precise version the algorithm terminates ifwhen the entire state space has been considered and can be aborted at any time to obtain a partial yet sound commutativity condition we have generalized our work to leftrightmovers and proved relative completeness we describe aspects of our technique that lead to useful commutativity conditions including how predicates are selected during refinement and heuristics that impact the output shape of the condition we have implemented our technique in a prototype opensource tool servois our algorithm produces quantifierfree queries that are dispatched to a backend smt solver we evaluate servois through two case studies i we synthesize commutativity conditions for a range of data structures including set hashtable accumulator counter and stack ii we consider an ethereum smart contract called blockking and show that servois can detect serious concurrencyrelated vulnerabilities and guide developers to construct robust and efficient implementations | [['reasoning', 'about', 'commutativity', 'between', 'datastructure', 'operations', 'is', 'an', 'important', 'problem', 'with', 'applications', 'including', 'parallelizing', 'compilers', 'optimistic', 'parallelization', 'and', 'more', 'recently', 'ethereum', 'smart', 'contracts', 'there', 'have', 'been', 'research', 'results', 'on', 'automatic', 'generation', 'of', 'commutativity', 'conditions', 'yet', 'we', 'are', 'unaware', 'of', 'any', 'fully', 'automated', 'technique', 'to', 'generate', 'conditions', 'that', 'are', 'both', 'sound', 'and', 'effective', 'we', 'have', 'designed', 'such', 'a', 'technique', 'driven', 'by', 'an', 'algorithm', 'that', 'iteratively', 'refines', 'a', 'conservative', 'approximation', 'of', 'the', 'commutativity', 'and', 'noncommutativity', 'condition', 'for', 'a', 'pair', 'of', 'methods', 'into', 'an', 'increasingly', 'precise', 'version', 'the', 'algorithm', 'terminates', 'ifwhen', 'the', 'entire', 'state', 'space', 'has', 'been', 'considered', 'and', 'can', 'be', 'aborted', 'at', 'any', 'time', 'to', 'obtain', 'a', 'partial', 'yet', 'sound', 'commutativity', 'condition', 'we', 'have', 'generalized', 'our', 'work', 'to', 'leftrightmovers', 'and', 'proved', 'relative', 'completeness', 'we', 'describe', 'aspects', 'of', 'our', 'technique', 'that', 'lead', 'to', 'useful', 'commutativity', 'conditions', 'including', 'how', 'predicates', 'are', 'selected', 'during', 'refinement', 'and', 'heuristics', 'that', 'impact', 'the', 'output', 'shape', 'of', 'the', 'condition', 'we', 'have', 'implemented', 'our', 'technique', 'in', 'a', 'prototype', 'opensource', 'tool', 'servois', 'our', 'algorithm', 'produces', 'quantifierfree', 'queries', 'that', 'are', 'dispatched', 'to', 'a', 'backend', 'smt', 'solver', 'we', 'evaluate', 'servois', 'through', 'two', 'case', 'studies', 'i', 'we', 'synthesize', 'commutativity', 'conditions', 'for', 'a', 'range', 'of', 'data', 'structures', 'including', 'set', 'hashtable', 'accumulator', 'counter', 'and', 'stack', 'ii', 'we', 'consider', 'an', 'ethereum', 'smart', 'contract', 'called', 'blockking', 'and', 'show', 'that', 'servois', 'can', 'detect', 'serious', 'concurrencyrelated', 'vulnerabilities', 'and', 'guide', 'developers', 'to', 'construct', 'robust', 'and', 'efficient', 'implementations']] | [-0.12042707294741765, 0.03942177836376816, -0.10431063260226178, 0.07529211465745382, -0.1374959238881794, -0.1797293225640065, 0.03649445379518771, 0.42679997853701934, -0.25115766663553324, -0.32418821340460063, 0.13677332299526565, -0.22964286631031428, -0.13524784814009244, 0.23179964767431166, -0.0881724555116047, 0.07248796890033711, 0.09293352907947597, -0.005621181316590602, -0.05163662221002596, -0.27085761556736543, 0.28986931853744735, 0.03780076495552619, 0.26699639289290644, 0.0626133051742467, 0.11354565576818589, -0.009321054605866916, -0.015599572411572029, 0.029579541549147898, -0.09998118268822509, 0.08540937995037114, 0.2760435722893817, 0.23473754090498136, 0.3105483745104201, -0.4420747389459783, -0.14512498653805647, 0.08617960064189642, 0.11187880263397736, 0.10985338636445315, -0.06566899613848623, -0.287417624236176, 0.152191711717543, -0.20962748199235648, -0.09578901714952995, -0.15639964577504933, 0.0016856239718825755, 0.009081567655032683, -0.2924427379995385, -0.05125642586127859, 0.09565359934474925, 0.07140860161910366, -0.021665373602965183, -0.07393341250488968, 0.004934514070815307, 0.11532547152195807, -0.007385489260091812, -0.005841333488206146, 0.11250662977987044, -0.07505641119129385, -0.14558302737194545, 0.3490766980144794, -0.01599075494680489, -0.1966722955133134, 0.17544699628966295, 0.003840118201748867, -0.19106759471677442, 0.09091897067368596, 0.1782418078759552, 0.1408479595369759, -0.16004153332739537, 0.06486001804660191, -0.03693483356203485, 0.19296908766409615, 0.07780615347318028, 0.021751798895430902, 0.16246214352577226, 0.16667003078198053, 0.08940577723764623, 0.1564062373285456, -0.029812823635828472, -0.06828697608476172, -0.2677851568215764, -0.15033807825446793, -0.09441464789519419, -0.020905739889713004, -0.04169086986907392, -0.16625594682201544, 0.35195584384616396, 0.23761696133026686, 0.10800494710045834, 0.06774987161874638, 0.3459869872520877, 0.08788614022686099, 0.10532119031060054, 0.10771989607227235, 0.16236409820599615, 0.07599323391020464, 0.10347318469887666, -0.16136817497057823, 0.11029247182263394, 0.08737258337870506] |
1,802.08749 | Quintessence Reissner Nordstr\"om Anti de Sitter Black Holes and Joule
Thomson effect | In this work we investigate corrections of the quintessence regime of the
dark energy on the Joule-Thomson (JT) effect of the Reissner Nordstr\"om anti
de Sitter (RNAdS) black hole. The quintessence dark energy has equation of
state as $p_q=\omega\rho_q$ in which $-1<\omega<-\frac{1}{3}.$ Our calculations
are restricted to ansatz: $\omega=-1$ (the cosmological constant regime) and
$\omega=-\frac{2}{3}$ (quintessence dark energy). To study the JT expansion of
the AdS gas under the constant black hole mass, we calculate inversion
temperature $T_i$ of the quintessence RNAdS black hole where its cooling phase
is changed to heating phase at a particular (inverse) pressure $P_i.$ Position
of the inverse point $\{T_i,P_i\}$ is determined by crossing the inverse curves
with the corresponding Gibbons-Hawking temperature on the T-P plan. We
determine position of the inverse point verse different numerical values of the
mass $M$ and the charge $Q$ of the quintessence AdS RN black hole. The
cooling-heating phase transition (JT effect) is happened for $M>Q$ in which the
causal singularity is still covered by the horizon. Our calculations show
sensitivity of the inverse point $\{T_i,P_i\}$ position on the T-P plan to
existence of the quintessence dark energy just for large numerical values of
the AdS RN black holes charge $Q$. In other words the quintessence dark energy
dose not affects on position of the inverse point when the AdS RN black hole
takes on small charges.
| gr-qc hep-th | in this work we investigate corrections of the quintessence regime of the dark energy on the joulethomson jt effect of the reissner nordstrom anti de sitter rnads black hole the quintessence dark energy has equation of state as p_qomegarho_q in which 1omegafrac13 our calculations are restricted to ansatz omega1 the cosmological constant regime and omegafrac23 quintessence dark energy to study the jt expansion of the ads gas under the constant black hole mass we calculate inversion temperature t_i of the quintessence rnads black hole where its cooling phase is changed to heating phase at a particular inverse pressure p_i position of the inverse point t_ip_i is determined by crossing the inverse curves with the corresponding gibbonshawking temperature on the tp plan we determine position of the inverse point verse different numerical values of the mass m and the charge q of the quintessence ads rn black hole the coolingheating phase transition jt effect is happened for mq in which the causal singularity is still covered by the horizon our calculations show sensitivity of the inverse point t_ip_i position on the tp plan to existence of the quintessence dark energy just for large numerical values of the ads rn black holes charge q in other words the quintessence dark energy dose not affects on position of the inverse point when the ads rn black hole takes on small charges | [['in', 'this', 'work', 'we', 'investigate', 'corrections', 'of', 'the', 'quintessence', 'regime', 'of', 'the', 'dark', 'energy', 'on', 'the', 'joulethomson', 'jt', 'effect', 'of', 'the', 'reissner', 'nordstrom', 'anti', 'de', 'sitter', 'rnads', 'black', 'hole', 'the', 'quintessence', 'dark', 'energy', 'has', 'equation', 'of', 'state', 'as', 'p_qomegarho_q', 'in', 'which', '1omegafrac13', 'our', 'calculations', 'are', 'restricted', 'to', 'ansatz', 'omega1', 'the', 'cosmological', 'constant', 'regime', 'and', 'omegafrac23', 'quintessence', 'dark', 'energy', 'to', 'study', 'the', 'jt', 'expansion', 'of', 'the', 'ads', 'gas', 'under', 'the', 'constant', 'black', 'hole', 'mass', 'we', 'calculate', 'inversion', 'temperature', 't_i', 'of', 'the', 'quintessence', 'rnads', 'black', 'hole', 'where', 'its', 'cooling', 'phase', 'is', 'changed', 'to', 'heating', 'phase', 'at', 'a', 'particular', 'inverse', 'pressure', 'p_i', 'position', 'of', 'the', 'inverse', 'point', 't_ip_i', 'is', 'determined', 'by', 'crossing', 'the', 'inverse', 'curves', 'with', 'the', 'corresponding', 'gibbonshawking', 'temperature', 'on', 'the', 'tp', 'plan', 'we', 'determine', 'position', 'of', 'the', 'inverse', 'point', 'verse', 'different', 'numerical', 'values', 'of', 'the', 'mass', 'm', 'and', 'the', 'charge', 'q', 'of', 'the', 'quintessence', 'ads', 'rn', 'black', 'hole', 'the', 'coolingheating', 'phase', 'transition', 'jt', 'effect', 'is', 'happened', 'for', 'mq', 'in', 'which', 'the', 'causal', 'singularity', 'is', 'still', 'covered', 'by', 'the', 'horizon', 'our', 'calculations', 'show', 'sensitivity', 'of', 'the', 'inverse', 'point', 't_ip_i', 'position', 'on', 'the', 'tp', 'plan', 'to', 'existence', 'of', 'the', 'quintessence', 'dark', 'energy', 'just', 'for', 'large', 'numerical', 'values', 'of', 'the', 'ads', 'rn', 'black', 'holes', 'charge', 'q', 'in', 'other', 'words', 'the', 'quintessence', 'dark', 'energy', 'dose', 'not', 'affects', 'on', 'position', 'of', 'the', 'inverse', 'point', 'when', 'the', 'ads', 'rn', 'black', 'hole', 'takes', 'on', 'small', 'charges']] | [-0.16195140965334656, 0.14023451293870393, -0.06375641980932818, 0.11376941960874117, -0.0776341679195563, -0.14022828619099326, 0.036918116205682354, 0.2870574272217022, -0.18650898242369293, -0.27011393850462306, 0.06266491782541077, -0.33102376266486117, -0.024796009225732028, 0.14820213943228333, -0.012052205680973, 0.02518398190732114, -0.06361981001372138, 0.08006125246692035, -0.12377357245319419, -0.2318953302792377, 0.38434786717096964, 0.11179559616992871, 0.24918791599675186, 0.014782002314459532, 0.08665208772549199, -0.00022896890321539508, 0.0518199270296221, 0.009430867791589763, -0.2515268385907014, -0.03234964771894738, 0.21991290455477105, 0.07878324559682773, 0.19700568012427538, -0.36609875490268073, -0.23777299960661266, 0.13532417074363265, 0.12739140370964175, 0.11198463884078794, -0.0845029752003029, -0.26047097865078184, 0.037527574247991045, -0.18670157286053937, -0.13355300883038176, -0.010386739597759313, 0.046805480680324967, -0.037633424835900466, -0.2217385295085195, 0.15408038989537293, 0.04966812743598388, -0.08766629860070276, -0.15675917356844163, -0.08138793658879068, -0.07771251930027372, 0.039459675454870904, 0.14013936844757863, 0.04260214988245732, 0.21800403616701564, -0.12963495846320358, -0.050151015950573814, 0.3429706755011446, -0.05849516922918459, -0.1509265468997829, 0.09698125301756792, -0.24415164553456836, -0.042117909629725746, 0.13084215452273687, 0.10376475566377243, 0.167816601757788, -0.0928343505798451, 0.21265387617077472, 0.038716045858131515, 0.16255629875645455, 0.12540946882425083, -0.007546492780869205, 0.34542504782607364, 0.09055215548258275, 0.023358480135599772, 0.1341448665666394, -0.0856118043170621, -0.11607281711159481, -0.3210355202108622, -0.15980232326934735, -0.19828500443862543, 0.09503201108225362, -0.19781324381953003, -0.18125413728670942, 0.3240852412208915, 0.0900181474764314, 0.18835640672490828, -0.015840669107726878, 0.2511730457209342, 0.10931980592560851, -0.019483801422433722, 0.08946669979641834, 0.31174866212945845, 0.06816478867290748, 0.17062173771982392, -0.3481454564382633, -0.0640923583564452, 0.10779965108881394] |
1,802.0875 | Spectral stability of traveling fronts for nonlinear hyperbolic
equations of bistable type | This paper addresses the existence and spectral stability of traveling fronts
for nonlinear hyperbolic equations with a positive "damping" term and a
reaction function of bistable type. Particular cases of the former include the
relaxed Allen-Cahn equation and the nonlinear version of the telegrapher's
equation with bistable reaction term. The existence theory of the fronts is
revisited, yielding useful properties such as exponential decay to the
asymptotic rest states and a variational formula for the unique wave speed. The
spectral problem associated to the linearized equation around the front is
established. It is shown that the spectrum of the perturbation problem is
stable, that is, it is located in the complex half plane with negative real
part, with the exception of the eigenvalue zero associated to translation
invariance, which is isolated and simple. In this fashion, it is shown that
there exists an spectral gap precluding the accumulation of essential spectrum
near the origin. To show that the point spectrum is stable we introduce a
transformation of the eigenfunctions that allows to employ energy estimates in
the frequency regime. This method produces a new proof of equivalent results
for the relaxed Allen-Cahn case and extends the former to a wider class of
equations. This result is a first step in a more general program pertaining to
the nonlinear stability of the fronts under small perturbations, a problem
which remains open.
| math.AP | this paper addresses the existence and spectral stability of traveling fronts for nonlinear hyperbolic equations with a positive damping term and a reaction function of bistable type particular cases of the former include the relaxed allencahn equation and the nonlinear version of the telegraphers equation with bistable reaction term the existence theory of the fronts is revisited yielding useful properties such as exponential decay to the asymptotic rest states and a variational formula for the unique wave speed the spectral problem associated to the linearized equation around the front is established it is shown that the spectrum of the perturbation problem is stable that is it is located in the complex half plane with negative real part with the exception of the eigenvalue zero associated to translation invariance which is isolated and simple in this fashion it is shown that there exists an spectral gap precluding the accumulation of essential spectrum near the origin to show that the point spectrum is stable we introduce a transformation of the eigenfunctions that allows to employ energy estimates in the frequency regime this method produces a new proof of equivalent results for the relaxed allencahn case and extends the former to a wider class of equations this result is a first step in a more general program pertaining to the nonlinear stability of the fronts under small perturbations a problem which remains open | [['this', 'paper', 'addresses', 'the', 'existence', 'and', 'spectral', 'stability', 'of', 'traveling', 'fronts', 'for', 'nonlinear', 'hyperbolic', 'equations', 'with', 'a', 'positive', 'damping', 'term', 'and', 'a', 'reaction', 'function', 'of', 'bistable', 'type', 'particular', 'cases', 'of', 'the', 'former', 'include', 'the', 'relaxed', 'allencahn', 'equation', 'and', 'the', 'nonlinear', 'version', 'of', 'the', 'telegraphers', 'equation', 'with', 'bistable', 'reaction', 'term', 'the', 'existence', 'theory', 'of', 'the', 'fronts', 'is', 'revisited', 'yielding', 'useful', 'properties', 'such', 'as', 'exponential', 'decay', 'to', 'the', 'asymptotic', 'rest', 'states', 'and', 'a', 'variational', 'formula', 'for', 'the', 'unique', 'wave', 'speed', 'the', 'spectral', 'problem', 'associated', 'to', 'the', 'linearized', 'equation', 'around', 'the', 'front', 'is', 'established', 'it', 'is', 'shown', 'that', 'the', 'spectrum', 'of', 'the', 'perturbation', 'problem', 'is', 'stable', 'that', 'is', 'it', 'is', 'located', 'in', 'the', 'complex', 'half', 'plane', 'with', 'negative', 'real', 'part', 'with', 'the', 'exception', 'of', 'the', 'eigenvalue', 'zero', 'associated', 'to', 'translation', 'invariance', 'which', 'is', 'isolated', 'and', 'simple', 'in', 'this', 'fashion', 'it', 'is', 'shown', 'that', 'there', 'exists', 'an', 'spectral', 'gap', 'precluding', 'the', 'accumulation', 'of', 'essential', 'spectrum', 'near', 'the', 'origin', 'to', 'show', 'that', 'the', 'point', 'spectrum', 'is', 'stable', 'we', 'introduce', 'a', 'transformation', 'of', 'the', 'eigenfunctions', 'that', 'allows', 'to', 'employ', 'energy', 'estimates', 'in', 'the', 'frequency', 'regime', 'this', 'method', 'produces', 'a', 'new', 'proof', 'of', 'equivalent', 'results', 'for', 'the', 'relaxed', 'allencahn', 'case', 'and', 'extends', 'the', 'former', 'to', 'a', 'wider', 'class', 'of', 'equations', 'this', 'result', 'is', 'a', 'first', 'step', 'in', 'a', 'more', 'general', 'program', 'pertaining', 'to', 'the', 'nonlinear', 'stability', 'of', 'the', 'fronts', 'under', 'small', 'perturbations', 'a', 'problem', 'which', 'remains', 'open']] | [-0.15053174526319313, 0.0729981197743378, -0.09873974877232483, 0.06719255877820694, -0.07857489336443985, -0.11667214083971213, 0.007467441847952811, 0.2999389568262774, -0.3040226221691979, -0.22824859980129353, 0.1152085739015804, -0.2650045337328186, -0.1672354419634718, 0.18885120705741903, -0.02168507255087404, 0.0603507127167414, 0.06527291216062503, 0.04413591834676007, -0.054510518913562206, -0.17304525204083843, 0.3571866785844221, 0.034961921343093984, 0.2482061792165041, 0.0465379757105636, 0.10230026287634088, -0.027323378338073582, 0.03206814613760166, 0.007842611535203974, -0.13833668918450712, 0.11296638799249195, 0.22332242663826984, 0.07699594887216454, 0.29025205887965455, -0.3593149543456409, -0.2279912128421964, 0.11302082640442836, 0.13558547526962408, 0.12522148109931985, -0.06453401560258656, -0.25537364810361, 0.10055987494187835, -0.10449310031355075, -0.23371852842544247, -0.022702089413676574, 0.024083373116572267, 0.01119059949060497, -0.25753096774139483, 0.12509036243027366, 0.11191561433268994, -0.017173707090399188, -0.10722699519272125, -0.055640739910608236, -0.024297769943191466, 0.080826285943065, 0.06540398310272671, 0.019027398407975536, 0.05171974109202299, -0.11492773228345196, -0.05656436071933611, 0.38733399746858554, -0.09353634488905536, -0.22046366593112116, 0.17598794843880056, -0.1241494477913796, -0.11030255226499361, 0.16358123192280208, 0.12988461523073846, 0.14175806312781314, -0.12788930251212466, 0.11693445889167893, -0.04939951755646768, 0.16499530863150974, 0.07858354103164343, 0.003361312645416626, 0.13678423178017787, 0.16383237581619103, 0.1400989282233438, 0.16457933606706437, -0.04313387334721325, -0.131732710863909, -0.3367920999293742, -0.14548845669740568, -0.14402860111870763, 0.06335801790679081, -0.054588527290742726, -0.2191050639839175, 0.4205707121964382, 0.09709933152240094, 0.17210107404870265, 0.06131033306516221, 0.2582152980678391, 0.2000149902368835, 0.02682167996207009, 0.08125913930691794, 0.24117118083750425, 0.16871376916988876, 0.12284686642334514, -0.2370217542781535, 0.041933351062724125, 0.08003212710407198] |
1,802.08751 | A Generalized Discrete-Time Altafini Model | A discrete-time modulus consensus model is considered in which the
interaction among a family of networked agents is described by a time-dependent
gain graph whose vertices correspond to agents and whose arcs are assigned
complex numbers from a cyclic group. Limiting behavior of the model is studied
using a graphical approach. It is shown that, under appropriate connectedness,
a certain type of clustering will be reached exponentially fast for almost all
initial conditions if and only if the sequence of gain graphs is "repeatedly
jointly structurally balanced" corresponding to that type of clustering, where
the number of clusters is at most the order of a cyclic group. It is also shown
that the model will reach a consensus asymptotically at zero if the sequence of
gain graphs is repeatedly jointly strongly connected and structurally
unbalanced. In the special case when the cyclic group is of order two, the
model simplifies to the so-called Altafini model whose gain graph is simply a
signed graph.
| cs.SY cs.DC | a discretetime modulus consensus model is considered in which the interaction among a family of networked agents is described by a timedependent gain graph whose vertices correspond to agents and whose arcs are assigned complex numbers from a cyclic group limiting behavior of the model is studied using a graphical approach it is shown that under appropriate connectedness a certain type of clustering will be reached exponentially fast for almost all initial conditions if and only if the sequence of gain graphs is repeatedly jointly structurally balanced corresponding to that type of clustering where the number of clusters is at most the order of a cyclic group it is also shown that the model will reach a consensus asymptotically at zero if the sequence of gain graphs is repeatedly jointly strongly connected and structurally unbalanced in the special case when the cyclic group is of order two the model simplifies to the socalled altafini model whose gain graph is simply a signed graph | [['a', 'discretetime', 'modulus', 'consensus', 'model', 'is', 'considered', 'in', 'which', 'the', 'interaction', 'among', 'a', 'family', 'of', 'networked', 'agents', 'is', 'described', 'by', 'a', 'timedependent', 'gain', 'graph', 'whose', 'vertices', 'correspond', 'to', 'agents', 'and', 'whose', 'arcs', 'are', 'assigned', 'complex', 'numbers', 'from', 'a', 'cyclic', 'group', 'limiting', 'behavior', 'of', 'the', 'model', 'is', 'studied', 'using', 'a', 'graphical', 'approach', 'it', 'is', 'shown', 'that', 'under', 'appropriate', 'connectedness', 'a', 'certain', 'type', 'of', 'clustering', 'will', 'be', 'reached', 'exponentially', 'fast', 'for', 'almost', 'all', 'initial', 'conditions', 'if', 'and', 'only', 'if', 'the', 'sequence', 'of', 'gain', 'graphs', 'is', 'repeatedly', 'jointly', 'structurally', 'balanced', 'corresponding', 'to', 'that', 'type', 'of', 'clustering', 'where', 'the', 'number', 'of', 'clusters', 'is', 'at', 'most', 'the', 'order', 'of', 'a', 'cyclic', 'group', 'it', 'is', 'also', 'shown', 'that', 'the', 'model', 'will', 'reach', 'a', 'consensus', 'asymptotically', 'at', 'zero', 'if', 'the', 'sequence', 'of', 'gain', 'graphs', 'is', 'repeatedly', 'jointly', 'strongly', 'connected', 'and', 'structurally', 'unbalanced', 'in', 'the', 'special', 'case', 'when', 'the', 'cyclic', 'group', 'is', 'of', 'order', 'two', 'the', 'model', 'simplifies', 'to', 'the', 'socalled', 'altafini', 'model', 'whose', 'gain', 'graph', 'is', 'simply', 'a', 'signed', 'graph']] | [-0.16040316611339847, 0.14056897373295796, -0.09358622350278625, 0.03344593108990112, -0.07926196597896494, -0.17136047744232177, 0.034773967818048514, 0.3997767700562311, -0.3045293254744936, -0.27641063944602307, 0.11878499775936405, -0.2504730929686271, -0.17929615268906568, 0.14686048679636574, -0.0627904525512338, -0.0023313822386146414, 0.07520015346903376, 0.1594939925907854, 0.00923642551060766, -0.29701891278635933, 0.32755031552097186, 0.014708232425976018, 0.26377830962347654, -0.023039726205127304, 0.1041364934683943, 0.0025780390936629904, 0.013506066042678488, 0.0956193324024189, -0.08207001013354008, 0.07111743976043515, 0.24993038329365805, 0.10398080297945742, 0.28756871050440824, -0.35281118194921157, -0.18937614500134087, 0.2061465834524551, 0.1282981519381647, 0.06483458008751433, 0.017045362006895746, -0.2416765000142637, 0.14806378586789123, -0.15708460655789022, -0.11013680428232243, -0.006967870692831058, 0.03961827693952739, 0.054985553144757275, -0.3018334848189189, 0.017658942451727708, 0.07623364119876198, 0.00033760699872041773, 0.0009525310736652349, -0.07224919295018437, -0.05699754021404757, 0.1176299633927132, -0.015737908007434222, 0.024970656323698034, 0.07028570077867687, -0.11491914558012975, -0.09267175839242577, 0.38475275955961424, 0.002244427268810433, -0.21174427956818356, 0.1533802436390446, -0.10910118209266681, -0.137175387880005, 0.15046428612853327, 0.1324321584478935, 0.1218557317306979, -0.1701374626051573, 0.07214432772849094, -0.08012157840300009, 0.1510558876614629, 0.051071735273223895, -0.01207977842162449, 0.1658413455395908, 0.1792787555905139, 0.14232942524531778, 0.135767554545038, 0.021566563149474194, -0.10108039154174046, -0.2695619893357432, -0.08623616954745965, -0.20947113294980027, 0.04818820967367547, -0.12701725132845162, -0.18437170673360295, 0.4152773701203016, 0.07543075364654415, 0.19342110601705184, 0.07636726557411413, 0.23563812183361912, 0.09618013229883887, 0.054462029887191905, 0.09902092168893968, 0.1827315254182629, 0.152417949208007, 0.01186170794663985, -0.18204068329093828, 0.09957524482946431, 0.08910180446320425] |
1,802.08752 | Probing the $J_{eff}=0$ ground state and the Van Vleck paramagnetism of
the Ir$^{5+}$ ions in the layered Sr$_2$Co$_{0.5}$Ir$_{0.5}$O$_4$ | We report a combined experimental and theoretical x-ray magnetic circular
dichroism (XMCD) spectroscopy study at the Ir-$L_{2,3}$ edges on the Ir$^{5+}$
ions of the layered hybrid solid state oxide Sr$_2$Co$_{0.5}$Ir$_{0.5}$O$_4$
with the K$_2$NiF$_4$ structure. From theoretical simulation of the
experimental Ir-$L_{2,3}$ XMCD spectrum, we found a deviation from a pure
$J_{eff}=0$ ground state with an anisotropic orbital-to-spin moment ratio
($L_x/2S_x$ = 0.43 and $L_z/2S_z$ = 0.78). This deviation is mainly due to
multiplet interactions being not small compared to the cubic crystal field and
due to the presence of a large tetragonal crystal field associated with the
crystal structure. Nevertheless, our calculations show that the energy gap
between the singlet ground state and the triplet excited state is still large
and that the magnetic properties of the Ir$^{5+}$ ions can be well described in
terms of singlet Van Vleck paramagnetism.
| cond-mat.str-el | we report a combined experimental and theoretical xray magnetic circular dichroism xmcd spectroscopy study at the irl_23 edges on the ir5 ions of the layered hybrid solid state oxide sr_2co_05ir_05o_4 with the k_2nif_4 structure from theoretical simulation of the experimental irl_23 xmcd spectrum we found a deviation from a pure j_eff0 ground state with an anisotropic orbitaltospin moment ratio l_x2s_x 043 and l_z2s_z 078 this deviation is mainly due to multiplet interactions being not small compared to the cubic crystal field and due to the presence of a large tetragonal crystal field associated with the crystal structure nevertheless our calculations show that the energy gap between the singlet ground state and the triplet excited state is still large and that the magnetic properties of the ir5 ions can be well described in terms of singlet van vleck paramagnetism | [['we', 'report', 'a', 'combined', 'experimental', 'and', 'theoretical', 'xray', 'magnetic', 'circular', 'dichroism', 'xmcd', 'spectroscopy', 'study', 'at', 'the', 'irl_23', 'edges', 'on', 'the', 'ir5', 'ions', 'of', 'the', 'layered', 'hybrid', 'solid', 'state', 'oxide', 'sr_2co_05ir_05o_4', 'with', 'the', 'k_2nif_4', 'structure', 'from', 'theoretical', 'simulation', 'of', 'the', 'experimental', 'irl_23', 'xmcd', 'spectrum', 'we', 'found', 'a', 'deviation', 'from', 'a', 'pure', 'j_eff0', 'ground', 'state', 'with', 'an', 'anisotropic', 'orbitaltospin', 'moment', 'ratio', 'l_x2s_x', '043', 'and', 'l_z2s_z', '078', 'this', 'deviation', 'is', 'mainly', 'due', 'to', 'multiplet', 'interactions', 'being', 'not', 'small', 'compared', 'to', 'the', 'cubic', 'crystal', 'field', 'and', 'due', 'to', 'the', 'presence', 'of', 'a', 'large', 'tetragonal', 'crystal', 'field', 'associated', 'with', 'the', 'crystal', 'structure', 'nevertheless', 'our', 'calculations', 'show', 'that', 'the', 'energy', 'gap', 'between', 'the', 'singlet', 'ground', 'state', 'and', 'the', 'triplet', 'excited', 'state', 'is', 'still', 'large', 'and', 'that', 'the', 'magnetic', 'properties', 'of', 'the', 'ir5', 'ions', 'can', 'be', 'well', 'described', 'in', 'terms', 'of', 'singlet', 'van', 'vleck', 'paramagnetism']] | [-0.11428285495525128, 0.18773481592063745, -0.009161187534104977, 0.012304410618717634, -0.041318189013133146, -0.0846456919929811, 0.062954247189087, 0.3949290220730735, -0.26027181595423843, -0.32988516503202736, 0.016385332997223095, -0.36248785806329625, -0.07244516679092794, 0.11647849699965489, 0.07455457986815643, 0.004468398331489442, 0.050651708276438195, -0.0030533844409020325, -0.09033653873922233, -0.15437783118113316, 0.26842581744732935, 0.07240812512310713, 0.3135466177744749, 0.09393359126201026, 0.032597418296802086, 0.008073751189696946, 0.1535597964381638, 0.039604364652746825, -0.10451149487838629, 0.10843881556660959, 0.22044730142347121, -0.06287206021396625, 0.15288471069565057, -0.42236778725470814, -0.15971784208922235, 0.03182735932024574, 0.08810590006081961, 0.14429508352169024, -0.10566526057139124, -0.3067978071889147, 0.057648785384301855, -0.1423746503581454, -0.1252620722188201, -0.11185362629760477, -0.06301297971985786, -0.010075182445641411, -0.25773814755152297, 0.11084971894839205, 0.03478269549384293, 0.08768526193832661, -0.1470618448955448, -0.17835745086746388, -0.10377424872389301, 0.018580598798685503, 0.06488871988595317, 0.08386304828380339, 0.10059967581830442, -0.1175892826544359, -0.11641624581446886, 0.37390033376956344, -0.08223384307851468, -0.06549709031351358, 0.15846368913360193, -0.20892640483334549, -0.0889547827541548, 0.18344442417172896, 0.09586196545296159, 0.11275448428144805, -0.09756598080056754, 0.10085695606260954, -0.03499705935443254, 0.25434497503399206, 0.012843497339075893, 0.062266506856881586, 0.23133947225497628, 0.1332087855115603, -0.0035647883437069736, 0.14550216834820612, -0.14952723619911498, -0.07635974027899171, -0.23095926563990743, -0.16013242698561653, -0.22396150315478025, 0.0654152563154475, -0.052130523683390356, -0.19103846860055188, 0.3797047220422585, 0.09419137567169684, 0.1739581514261943, -0.053656489525298424, 0.2507161457770805, 0.06807799782530453, 0.05819276007788634, 0.025363857810616605, 0.3077468076524766, 0.2216662606014345, 0.09525964690960552, -0.3206195223943463, 0.0917862562403167, -0.021956901188547675] |
1,802.08753 | Edge-Based Recognition of Novel Objects for Robotic Grasping | In this paper, we investigate the problem of grasping novel objects in
unstructured environments. To address this problem, consideration of the object
geometry, reachability and force closure analysis are required. We propose a
framework for grasping unknown objects by localizing contact regions on the
contours formed by a set of depth edges in a single view 2D depth image.
According to the edge geometric features obtained from analyzing the data of
the depth map, the contact regions are determined. Finally,We validate the
performance of the approach by applying it to the scenes with both single and
multiple objects, using Baxter manipulator.
| cs.RO cs.CV | in this paper we investigate the problem of grasping novel objects in unstructured environments to address this problem consideration of the object geometry reachability and force closure analysis are required we propose a framework for grasping unknown objects by localizing contact regions on the contours formed by a set of depth edges in a single view 2d depth image according to the edge geometric features obtained from analyzing the data of the depth map the contact regions are determined finallywe validate the performance of the approach by applying it to the scenes with both single and multiple objects using baxter manipulator | [['in', 'this', 'paper', 'we', 'investigate', 'the', 'problem', 'of', 'grasping', 'novel', 'objects', 'in', 'unstructured', 'environments', 'to', 'address', 'this', 'problem', 'consideration', 'of', 'the', 'object', 'geometry', 'reachability', 'and', 'force', 'closure', 'analysis', 'are', 'required', 'we', 'propose', 'a', 'framework', 'for', 'grasping', 'unknown', 'objects', 'by', 'localizing', 'contact', 'regions', 'on', 'the', 'contours', 'formed', 'by', 'a', 'set', 'of', 'depth', 'edges', 'in', 'a', 'single', 'view', '2d', 'depth', 'image', 'according', 'to', 'the', 'edge', 'geometric', 'features', 'obtained', 'from', 'analyzing', 'the', 'data', 'of', 'the', 'depth', 'map', 'the', 'contact', 'regions', 'are', 'determined', 'finallywe', 'validate', 'the', 'performance', 'of', 'the', 'approach', 'by', 'applying', 'it', 'to', 'the', 'scenes', 'with', 'both', 'single', 'and', 'multiple', 'objects', 'using', 'baxter', 'manipulator']] | [-0.11272000455952222, 0.013064729123569952, -0.05413777092102878, 0.010585862196898917, -0.06697983305790636, -0.1034948825513446, 0.06049862068427708, 0.40476045381314685, -0.2838155008797156, -0.37912695534010926, 0.07367344610254732, -0.24472716991705498, -0.1735243422283542, 0.16427803570220229, -0.14680985398452248, 0.08740532547719593, 0.09986252464944183, 0.014530866724983006, -0.04266805795371754, -0.1935372789860657, 0.37001494061902607, -0.005216722653275079, 0.2587786173761481, -0.006221241376473393, 0.1413192546218726, 0.03439356080062761, -0.0496531062169314, 0.07426201562922492, -0.10794041306702512, 0.18778573275580634, 0.2503688376613588, 0.12543846613792056, 0.2098714170728506, -0.4126327389685234, -0.21436484359057234, 0.04800218235848859, 0.11134840538817467, 0.08240630796252943, -0.015768924512494686, -0.3969682599648391, 0.09777134081053704, -0.09496765873293475, -0.0899029826229014, -0.056364941567477615, 0.007317601417255874, -0.019813835851405517, -0.23413571551681892, 0.00090704517586544, 0.05669156565229491, 0.08980699673543989, -0.09505106804495918, -0.0523449198462733, 0.027871889331940524, 0.19741518664090793, -0.026184988540071664, 0.02125488767990529, 0.16964772728151908, -0.22267363616956934, -0.1077210963150431, 0.39962211223595806, 0.02655215076364503, -0.24156832027031191, 0.18989657253225214, -0.09776445526611244, -0.09849504332085794, 0.14557409991906717, 0.1963001659006286, 0.17269244935308206, -0.19542428290489877, 0.050066619197432286, -0.07627265756064565, 0.11775262237959865, 0.0776585264495657, -0.04860654907614583, 0.23779354562336294, 0.20742706664939328, 0.04089155587561355, 0.196504086707857, -0.1685397980601001, -0.047827239549432944, -0.25600270609346004, -0.10079999641045043, -0.17047184670694393, -0.05384290422022453, -0.08892805573252711, -0.1417496133651031, 0.38568750981905375, 0.20432355570247268, 0.26873590631207617, 0.07066887920713144, 0.34318290130779294, 0.06186425101630376, 0.054852095534010686, 0.05742582931911739, 0.18175042988640247, 0.060726507551885106, 0.08327629391823223, -0.1888346801555743, 0.05967139671233916, 0.09365359026164112] |
1,802.08754 | Nanostructured submicron block copolymer dots by sacrificial stamping: a
potential preconcentration platform for locally resolved sensing, chemistry
and cellular interactions | Classical contact lithography involves patterning of surfaces by embossing or
by transfer of ink. We report direct lithographic transfer of parts of
sacrificial stamps onto counterpart surfaces. Using sacrificial stamps
consisting of the block copolymer polystyrene-block-poly(2-pyridine)
(PS-b-P2VP), we deposited arrays of nanostructured submicron PS-b-P2VP dots
with heights of about 100 nm onto silicon wafers and glass slides. The
sacrificial PS-b-P2VP stamps were topographically patterned with
truncated-pyramidal contact elements and penetrated by spongy-continuous
nanopore systems. The spongy nature of the sacrificial PS-b-P2VP stamps
supported formation of adhesive contact to the counterpart surfaces and the
rupture of the contact elements during stamp retraction. The submicron
PS-b-P2VP dots generated by sacrificial stamping can be further functionalized,
examples include loading submicron PS-b-P2VP dots with dyes and attachment of
gold nanoparticles to their outer surfaces. The arrays of submicron PS-b-P2VP
dots can be integrated into setups for advanced optical microscopy, total
internal reflection fluorescence microscopy or Raman microscopy. Arrays of
nanostructured submicron block copolymer dots may represent a preconcentration
platform for locally resolved sensing and locally resolved monitoring of
cellular interactions or might be used as microreactor arrays in lab-on-chip
configurations.
| physics.app-ph cond-mat.mtrl-sci | classical contact lithography involves patterning of surfaces by embossing or by transfer of ink we report direct lithographic transfer of parts of sacrificial stamps onto counterpart surfaces using sacrificial stamps consisting of the block copolymer polystyreneblockpoly2pyridine psbp2vp we deposited arrays of nanostructured submicron psbp2vp dots with heights of about 100 nm onto silicon wafers and glass slides the sacrificial psbp2vp stamps were topographically patterned with truncatedpyramidal contact elements and penetrated by spongycontinuous nanopore systems the spongy nature of the sacrificial psbp2vp stamps supported formation of adhesive contact to the counterpart surfaces and the rupture of the contact elements during stamp retraction the submicron psbp2vp dots generated by sacrificial stamping can be further functionalized examples include loading submicron psbp2vp dots with dyes and attachment of gold nanoparticles to their outer surfaces the arrays of submicron psbp2vp dots can be integrated into setups for advanced optical microscopy total internal reflection fluorescence microscopy or raman microscopy arrays of nanostructured submicron block copolymer dots may represent a preconcentration platform for locally resolved sensing and locally resolved monitoring of cellular interactions or might be used as microreactor arrays in labonchip configurations | [['classical', 'contact', 'lithography', 'involves', 'patterning', 'of', 'surfaces', 'by', 'embossing', 'or', 'by', 'transfer', 'of', 'ink', 'we', 'report', 'direct', 'lithographic', 'transfer', 'of', 'parts', 'of', 'sacrificial', 'stamps', 'onto', 'counterpart', 'surfaces', 'using', 'sacrificial', 'stamps', 'consisting', 'of', 'the', 'block', 'copolymer', 'polystyreneblockpoly2pyridine', 'psbp2vp', 'we', 'deposited', 'arrays', 'of', 'nanostructured', 'submicron', 'psbp2vp', 'dots', 'with', 'heights', 'of', 'about', '100', 'nm', 'onto', 'silicon', 'wafers', 'and', 'glass', 'slides', 'the', 'sacrificial', 'psbp2vp', 'stamps', 'were', 'topographically', 'patterned', 'with', 'truncatedpyramidal', 'contact', 'elements', 'and', 'penetrated', 'by', 'spongycontinuous', 'nanopore', 'systems', 'the', 'spongy', 'nature', 'of', 'the', 'sacrificial', 'psbp2vp', 'stamps', 'supported', 'formation', 'of', 'adhesive', 'contact', 'to', 'the', 'counterpart', 'surfaces', 'and', 'the', 'rupture', 'of', 'the', 'contact', 'elements', 'during', 'stamp', 'retraction', 'the', 'submicron', 'psbp2vp', 'dots', 'generated', 'by', 'sacrificial', 'stamping', 'can', 'be', 'further', 'functionalized', 'examples', 'include', 'loading', 'submicron', 'psbp2vp', 'dots', 'with', 'dyes', 'and', 'attachment', 'of', 'gold', 'nanoparticles', 'to', 'their', 'outer', 'surfaces', 'the', 'arrays', 'of', 'submicron', 'psbp2vp', 'dots', 'can', 'be', 'integrated', 'into', 'setups', 'for', 'advanced', 'optical', 'microscopy', 'total', 'internal', 'reflection', 'fluorescence', 'microscopy', 'or', 'raman', 'microscopy', 'arrays', 'of', 'nanostructured', 'submicron', 'block', 'copolymer', 'dots', 'may', 'represent', 'a', 'preconcentration', 'platform', 'for', 'locally', 'resolved', 'sensing', 'and', 'locally', 'resolved', 'monitoring', 'of', 'cellular', 'interactions', 'or', 'might', 'be', 'used', 'as', 'microreactor', 'arrays', 'in', 'labonchip', 'configurations']] | [-0.10249904429417897, 0.19097695999417474, -0.013313377391524063, -0.11550626961280251, 0.040855667011842865, -0.24084311223950217, 0.0023086820045216364, 0.5158798784587553, -0.286762719220721, -0.29664948741941016, 0.10142195765107177, -0.3229837447272542, -0.11925410373579161, 0.1988962001155787, -0.0352116875971357, 0.07292636397518625, 0.04973960036215948, -0.20065225498455633, -0.00882297778461393, -0.16169137900308425, 0.1926448211796541, 0.04848868227843704, 0.2749328490020962, 0.06995264985127873, 0.08164384041256348, 0.046650904274667754, 0.07589661267896493, -0.007935073300483611, -0.19232827886084064, 0.15943372424544328, 0.23374738241291396, -0.08337460951167133, 0.14558554812247962, -0.6143236529550266, -0.2369923189796426, -0.010875468599085844, 0.1669501056029497, 0.07711314628933826, -0.08704965112506936, -0.2773503285064235, 0.07746042861397089, -0.08491795298597607, -0.08234157402944593, 0.031113575344976507, -0.025335800195306214, 0.09352936917697105, -0.17797668400644248, -0.007300687666290282, 0.046099340502437344, 0.08381269147996205, -0.027440427845761263, -0.07311230175110608, -0.0728820531369477, 0.09702173603350002, -0.0881211678223949, -0.056735631934102485, 0.34466926050703217, -0.04619808623419637, -0.111025719347415, 0.32483920018198836, -0.024782889229983417, -0.12458395644961322, 0.2024484293311427, -0.1258245237436288, 0.03720056979034014, 0.22472670647860224, 0.13751888037990026, 0.15745777978760297, -0.18426357932475299, 0.022227262959451686, 0.04220912837591328, 0.24107037973208506, 0.2550396746116095, 0.0076617600842852325, 0.28547106917102727, 0.2706828140577332, -0.006931338922370001, 0.17321066253836384, -0.14614191907076318, 0.020798352368868112, -0.16548369176522956, -0.2689669564203486, -0.22492457688353507, 0.13160070648691694, -0.08648790143148101, -0.23724894035834046, 0.27368000381794133, 0.007956290810020345, 0.13916060823662196, -0.03965817521265173, 0.2619714238095642, -0.08984413021434953, 0.17880627476162395, -0.11986421287833342, 0.14371354054262647, 0.1831909090272899, 0.07763262690156902, -0.16804327608195588, 0.07342783614097396, 0.004186075847453433] |
1,802.08755 | No Blind Spots: Full-Surround Multi-Object Tracking for Autonomous
Vehicles using Cameras & LiDARs | Online multi-object tracking (MOT) is extremely important for high-level
spatial reasoning and path planning for autonomous and highly-automated
vehicles. In this paper, we present a modular framework for tracking multiple
objects (vehicles), capable of accepting object proposals from different sensor
modalities (vision and range) and a variable number of sensors, to produce
continuous object tracks. This work is a generalization of the MDP framework
for MOT, with some key extensions - First, we track objects across multiple
cameras and across different sensor modalities. This is done by fusing object
proposals across sensors accurately and efficiently. Second, the objects of
interest (targets) are tracked directly in the real world. This is a departure
from traditional techniques where objects are simply tracked in the image
plane. Doing so allows the tracks to be readily used by an autonomous agent for
navigation and related tasks.
To verify the effectiveness of our approach, we test it on real world highway
data collected from a heavily sensorized testbed capable of capturing
full-surround information. We demonstrate that our framework is well-suited to
track objects through entire maneuvers around the ego-vehicle, some of which
take more than a few minutes to complete. We also leverage the modularity of
our approach by comparing the effects of including/excluding different sensors,
changing the total number of sensors, and the quality of object proposals on
the final tracking result.
| cs.CV | online multiobject tracking mot is extremely important for highlevel spatial reasoning and path planning for autonomous and highlyautomated vehicles in this paper we present a modular framework for tracking multiple objects vehicles capable of accepting object proposals from different sensor modalities vision and range and a variable number of sensors to produce continuous object tracks this work is a generalization of the mdp framework for mot with some key extensions first we track objects across multiple cameras and across different sensor modalities this is done by fusing object proposals across sensors accurately and efficiently second the objects of interest targets are tracked directly in the real world this is a departure from traditional techniques where objects are simply tracked in the image plane doing so allows the tracks to be readily used by an autonomous agent for navigation and related tasks to verify the effectiveness of our approach we test it on real world highway data collected from a heavily sensorized testbed capable of capturing fullsurround information we demonstrate that our framework is wellsuited to track objects through entire maneuvers around the egovehicle some of which take more than a few minutes to complete we also leverage the modularity of our approach by comparing the effects of includingexcluding different sensors changing the total number of sensors and the quality of object proposals on the final tracking result | [['online', 'multiobject', 'tracking', 'mot', 'is', 'extremely', 'important', 'for', 'highlevel', 'spatial', 'reasoning', 'and', 'path', 'planning', 'for', 'autonomous', 'and', 'highlyautomated', 'vehicles', 'in', 'this', 'paper', 'we', 'present', 'a', 'modular', 'framework', 'for', 'tracking', 'multiple', 'objects', 'vehicles', 'capable', 'of', 'accepting', 'object', 'proposals', 'from', 'different', 'sensor', 'modalities', 'vision', 'and', 'range', 'and', 'a', 'variable', 'number', 'of', 'sensors', 'to', 'produce', 'continuous', 'object', 'tracks', 'this', 'work', 'is', 'a', 'generalization', 'of', 'the', 'mdp', 'framework', 'for', 'mot', 'with', 'some', 'key', 'extensions', 'first', 'we', 'track', 'objects', 'across', 'multiple', 'cameras', 'and', 'across', 'different', 'sensor', 'modalities', 'this', 'is', 'done', 'by', 'fusing', 'object', 'proposals', 'across', 'sensors', 'accurately', 'and', 'efficiently', 'second', 'the', 'objects', 'of', 'interest', 'targets', 'are', 'tracked', 'directly', 'in', 'the', 'real', 'world', 'this', 'is', 'a', 'departure', 'from', 'traditional', 'techniques', 'where', 'objects', 'are', 'simply', 'tracked', 'in', 'the', 'image', 'plane', 'doing', 'so', 'allows', 'the', 'tracks', 'to', 'be', 'readily', 'used', 'by', 'an', 'autonomous', 'agent', 'for', 'navigation', 'and', 'related', 'tasks', 'to', 'verify', 'the', 'effectiveness', 'of', 'our', 'approach', 'we', 'test', 'it', 'on', 'real', 'world', 'highway', 'data', 'collected', 'from', 'a', 'heavily', 'sensorized', 'testbed', 'capable', 'of', 'capturing', 'fullsurround', 'information', 'we', 'demonstrate', 'that', 'our', 'framework', 'is', 'wellsuited', 'to', 'track', 'objects', 'through', 'entire', 'maneuvers', 'around', 'the', 'egovehicle', 'some', 'of', 'which', 'take', 'more', 'than', 'a', 'few', 'minutes', 'to', 'complete', 'we', 'also', 'leverage', 'the', 'modularity', 'of', 'our', 'approach', 'by', 'comparing', 'the', 'effects', 'of', 'includingexcluding', 'different', 'sensors', 'changing', 'the', 'total', 'number', 'of', 'sensors', 'and', 'the', 'quality', 'of', 'object', 'proposals', 'on', 'the', 'final', 'tracking', 'result']] | [-0.06350286523656298, 0.0609356898975481, -0.07504010831005871, 0.019032422242582673, -0.09547353947121236, -0.13066656349019873, 0.01888207877934393, 0.43141764964908363, -0.23822776809541715, -0.3923171276185248, 0.0828062104832174, -0.25957363402270456, -0.14132326125270792, 0.24441772224174604, -0.16335142199260494, 0.09425675936172613, 0.12225460500352912, 0.04878252059117787, 0.006593524992672933, -0.23420113519661956, 0.302684654696948, 0.02120452008727524, 0.26962283903112017, -0.00870695712355276, 0.1754377665024044, 0.039664157080567544, -0.050167480629558364, 0.03125215772125456, -0.040800706213501854, 0.1792396283811993, 0.32861278486334616, 0.19498641612577355, 0.2754599966543416, -0.4360092790642132, -0.21332900279512007, 0.07202461047201521, 0.1291079307637281, 0.08711237939643778, -0.028154865817697203, -0.3822006032553812, 0.09909463829024591, -0.18006322402300107, -0.06414575948483414, -0.0806856474859847, 0.025404956431335047, 0.01724276138521317, -0.2526260096910927, -0.032857530664574974, 0.015151012686805593, 0.0664175832766341, -0.08813566203255, -0.04358957369708353, 0.04326067617473503, 0.2269739544360588, 0.015625744378194212, 0.006088609179585344, 0.19521022920600242, -0.1667372050591641, -0.13334972530189487, 0.3804573756953081, 0.008228302767383866, -0.1868466434547574, 0.2160089660736008, -0.08480433993998708, -0.13027346595086986, 0.1307303561311629, 0.2053122751828697, 0.20588557554201947, -0.18169298857243524, -0.003214951272950404, -0.025751950355867546, 0.16159347549352485, 0.041178067977436714, -0.0030694801391412813, 0.22885844367960495, 0.21647128815245298, 0.09320042361091409, 0.1216163592118149, -0.14340908742613262, -0.07817564677654042, -0.24940507052311053, -0.14511529925104696, -0.17804870040518128, -0.05546348017950853, -0.08373547176882211, -0.09176395886577665, 0.39624735912928977, 0.25769208862135806, 0.22134460497026642, 0.0581195892570799, 0.3816148841215505, 0.022160716025262244, 0.09902888437086302, 0.057192437375585235, 0.17217241671324396, 0.008685706194697156, 0.15074429020906488, -0.15975648651326385, 0.07266883723644747, 0.023770877773770027] |
1,802.08756 | Guarded Traced Categories | Notions of guardedness serve to delineate the admissibility of cycles, e.g.
in recursion, corecursion, iteration, or tracing. We introduce an abstract
notion of guardedness structure on a symmetric monoidal category, along with a
corresponding notion of guarded traces, which are defined only if the cycles
they induce are guarded. We relate structural guardedness, determined by
propagating guardedness along the operations of the category, to geometric
guardedness phrased in terms of a diagrammatic language. In our setup, the
Cartesian case (recursion) and the co-Cartesian case (iteration) become
completely dual, and we show that in these cases, guarded tracedness is
equivalent to presence of a guarded Conway operator, in analogy to an
observation on total traces by Hasegawa and Hyland. Moreover, we relate guarded
traces to unguarded categorical uniform fixpoint operators in the style of
Simpson and Plotkin. Finally, we show that partial traces based on
Hilbert-Schmidt operators in the category of Hilbert spaces are an instance of
guarded traces.
| cs.LO | notions of guardedness serve to delineate the admissibility of cycles eg in recursion corecursion iteration or tracing we introduce an abstract notion of guardedness structure on a symmetric monoidal category along with a corresponding notion of guarded traces which are defined only if the cycles they induce are guarded we relate structural guardedness determined by propagating guardedness along the operations of the category to geometric guardedness phrased in terms of a diagrammatic language in our setup the cartesian case recursion and the cocartesian case iteration become completely dual and we show that in these cases guarded tracedness is equivalent to presence of a guarded conway operator in analogy to an observation on total traces by hasegawa and hyland moreover we relate guarded traces to unguarded categorical uniform fixpoint operators in the style of simpson and plotkin finally we show that partial traces based on hilbertschmidt operators in the category of hilbert spaces are an instance of guarded traces | [['notions', 'of', 'guardedness', 'serve', 'to', 'delineate', 'the', 'admissibility', 'of', 'cycles', 'eg', 'in', 'recursion', 'corecursion', 'iteration', 'or', 'tracing', 'we', 'introduce', 'an', 'abstract', 'notion', 'of', 'guardedness', 'structure', 'on', 'a', 'symmetric', 'monoidal', 'category', 'along', 'with', 'a', 'corresponding', 'notion', 'of', 'guarded', 'traces', 'which', 'are', 'defined', 'only', 'if', 'the', 'cycles', 'they', 'induce', 'are', 'guarded', 'we', 'relate', 'structural', 'guardedness', 'determined', 'by', 'propagating', 'guardedness', 'along', 'the', 'operations', 'of', 'the', 'category', 'to', 'geometric', 'guardedness', 'phrased', 'in', 'terms', 'of', 'a', 'diagrammatic', 'language', 'in', 'our', 'setup', 'the', 'cartesian', 'case', 'recursion', 'and', 'the', 'cocartesian', 'case', 'iteration', 'become', 'completely', 'dual', 'and', 'we', 'show', 'that', 'in', 'these', 'cases', 'guarded', 'tracedness', 'is', 'equivalent', 'to', 'presence', 'of', 'a', 'guarded', 'conway', 'operator', 'in', 'analogy', 'to', 'an', 'observation', 'on', 'total', 'traces', 'by', 'hasegawa', 'and', 'hyland', 'moreover', 'we', 'relate', 'guarded', 'traces', 'to', 'unguarded', 'categorical', 'uniform', 'fixpoint', 'operators', 'in', 'the', 'style', 'of', 'simpson', 'and', 'plotkin', 'finally', 'we', 'show', 'that', 'partial', 'traces', 'based', 'on', 'hilbertschmidt', 'operators', 'in', 'the', 'category', 'of', 'hilbert', 'spaces', 'are', 'an', 'instance', 'of', 'guarded', 'traces']] | [-0.15104031557021486, 0.06540813832571596, -0.07061437929307175, 0.11741992828041718, -0.11654247243882744, -0.10393905186444331, 0.061840301498201244, 0.37017870397799335, -0.35489041666992627, -0.21623747715590058, 0.11357044648144773, -0.23294151312281203, -0.13344042461845954, 0.1529833952893331, -0.19332378846296602, -0.02299128413485114, 0.0358626148782101, 0.07846483985662081, -0.08399765565175753, -0.2313824730189695, 0.3990577736648488, -0.031388177202753484, 0.19743455201980603, 0.02838936678925826, 0.08314538367128202, 0.03043511279140878, -0.04562446197115217, 0.060570115445316215, -0.10513387533072693, 0.14988000339086563, 0.2987872869262745, 0.18392537430649517, 0.219689192568474, -0.4598601718676413, -0.09677997336479699, 0.08290063203935316, 0.0978743328232204, 0.03237357613508987, 0.03526011582799137, -0.3179854191810035, 0.08962667556064334, -0.18912224516948792, -0.06685651717915135, -0.10643021295745828, 0.027682089694674797, 0.030844815235561245, -0.2448751868032791, -0.044009994581982396, 0.1389117282622488, 0.11768299229828652, -0.06466499224874624, -0.04385474344246849, -0.07992106906411232, 0.05329867966538354, -0.05887865252751311, -0.012800387940280567, 0.11469981091535965, -0.07542168060139676, -0.16288385923898477, 0.32132314136667045, -0.07217139335034807, -0.20870450201387233, 0.16481442513555336, -0.09856857230685129, -0.18519336391525093, 0.07523656574190613, 0.051893170508126, 0.17626070044341552, -0.09263029180883851, 0.1459309208506398, -0.12640135410793457, 0.1106542531982254, 0.16500145396526167, 0.07413002403948314, 0.12241392372365875, 0.07839688626384944, 0.06739009213470705, 0.18010998139110435, 0.049714168297886184, -0.14087450132181772, -0.3591323304968845, -0.18619008846380777, -0.04729963140562177, 0.008642238508342694, -0.07115295544992628, -0.20771157928700945, 0.3567754868299339, 0.14918559446195317, 0.18079437075218388, 0.15459484172685392, 0.2231671869344001, 0.12237768504949535, 0.1022156554920848, 0.0524207043860428, 0.10717119607899434, 0.20081329749968307, 0.0671024265340203, -0.15648583954965375, 0.07419704517444513, 0.22691310888340185] |
1,802.08757 | Fully Decentralized Multi-Agent Reinforcement Learning with Networked
Agents | We consider the problem of \emph{fully decentralized} multi-agent
reinforcement learning (MARL), where the agents are located at the nodes of a
time-varying communication network. Specifically, we assume that the reward
functions of the agents might correspond to different tasks, and are only known
to the corresponding agent. Moreover, each agent makes individual decisions
based on both the information observed locally and the messages received from
its neighbors over the network. Within this setting, the collective goal of the
agents is to maximize the globally averaged return over the network through
exchanging information with their neighbors. To this end, we propose two
decentralized actor-critic algorithms with function approximation, which are
applicable to large-scale MARL problems where both the number of states and the
number of agents are massively large. Under the decentralized structure, the
actor step is performed individually by each agent with no need to infer the
policies of others. For the critic step, we propose a consensus update via
communication over the network. Our algorithms are fully incremental and can be
implemented in an online fashion. Convergence analyses of the algorithms are
provided when the value functions are approximated within the class of linear
functions. Extensive simulation results with both linear and nonlinear function
approximations are presented to validate the proposed algorithms. Our work
appears to be the first study of fully decentralized MARL algorithms for
networked agents with function approximation, with provable convergence
guarantees.
| cs.LG cs.AI cs.MA math.OC stat.ML | we consider the problem of emphfully decentralized multiagent reinforcement learning marl where the agents are located at the nodes of a timevarying communication network specifically we assume that the reward functions of the agents might correspond to different tasks and are only known to the corresponding agent moreover each agent makes individual decisions based on both the information observed locally and the messages received from its neighbors over the network within this setting the collective goal of the agents is to maximize the globally averaged return over the network through exchanging information with their neighbors to this end we propose two decentralized actorcritic algorithms with function approximation which are applicable to largescale marl problems where both the number of states and the number of agents are massively large under the decentralized structure the actor step is performed individually by each agent with no need to infer the policies of others for the critic step we propose a consensus update via communication over the network our algorithms are fully incremental and can be implemented in an online fashion convergence analyses of the algorithms are provided when the value functions are approximated within the class of linear functions extensive simulation results with both linear and nonlinear function approximations are presented to validate the proposed algorithms our work appears to be the first study of fully decentralized marl algorithms for networked agents with function approximation with provable convergence guarantees | [['we', 'consider', 'the', 'problem', 'of', 'emphfully', 'decentralized', 'multiagent', 'reinforcement', 'learning', 'marl', 'where', 'the', 'agents', 'are', 'located', 'at', 'the', 'nodes', 'of', 'a', 'timevarying', 'communication', 'network', 'specifically', 'we', 'assume', 'that', 'the', 'reward', 'functions', 'of', 'the', 'agents', 'might', 'correspond', 'to', 'different', 'tasks', 'and', 'are', 'only', 'known', 'to', 'the', 'corresponding', 'agent', 'moreover', 'each', 'agent', 'makes', 'individual', 'decisions', 'based', 'on', 'both', 'the', 'information', 'observed', 'locally', 'and', 'the', 'messages', 'received', 'from', 'its', 'neighbors', 'over', 'the', 'network', 'within', 'this', 'setting', 'the', 'collective', 'goal', 'of', 'the', 'agents', 'is', 'to', 'maximize', 'the', 'globally', 'averaged', 'return', 'over', 'the', 'network', 'through', 'exchanging', 'information', 'with', 'their', 'neighbors', 'to', 'this', 'end', 'we', 'propose', 'two', 'decentralized', 'actorcritic', 'algorithms', 'with', 'function', 'approximation', 'which', 'are', 'applicable', 'to', 'largescale', 'marl', 'problems', 'where', 'both', 'the', 'number', 'of', 'states', 'and', 'the', 'number', 'of', 'agents', 'are', 'massively', 'large', 'under', 'the', 'decentralized', 'structure', 'the', 'actor', 'step', 'is', 'performed', 'individually', 'by', 'each', 'agent', 'with', 'no', 'need', 'to', 'infer', 'the', 'policies', 'of', 'others', 'for', 'the', 'critic', 'step', 'we', 'propose', 'a', 'consensus', 'update', 'via', 'communication', 'over', 'the', 'network', 'our', 'algorithms', 'are', 'fully', 'incremental', 'and', 'can', 'be', 'implemented', 'in', 'an', 'online', 'fashion', 'convergence', 'analyses', 'of', 'the', 'algorithms', 'are', 'provided', 'when', 'the', 'value', 'functions', 'are', 'approximated', 'within', 'the', 'class', 'of', 'linear', 'functions', 'extensive', 'simulation', 'results', 'with', 'both', 'linear', 'and', 'nonlinear', 'function', 'approximations', 'are', 'presented', 'to', 'validate', 'the', 'proposed', 'algorithms', 'our', 'work', 'appears', 'to', 'be', 'the', 'first', 'study', 'of', 'fully', 'decentralized', 'marl', 'algorithms', 'for', 'networked', 'agents', 'with', 'function', 'approximation', 'with', 'provable', 'convergence', 'guarantees']] | [-0.12194803593605283, 0.021581803497888435, -0.05937399241335343, 0.012313366797555365, -0.09991624977605386, -0.1627141423030141, 0.06792630261141744, 0.4628353518102381, -0.3150401895656645, -0.296321905920503, 0.10021313606274031, -0.2605642644474895, -0.17526746933374127, 0.1175922567766728, -0.07403395055611697, 0.08191836939436992, 0.06820606664528525, 0.08504626816863754, -0.01117995906556104, -0.32096035425330244, 0.30308486212743446, 0.039166115915947354, 0.26772444247824567, -0.021770256061661372, 0.13819740463730926, 0.02035791301207964, -0.006796234316918683, 0.02855547770889381, -0.07594215509919396, 0.13527653931262232, 0.3324305366772085, 0.18184793139689492, 0.3870323140981165, -0.44693246250182894, -0.16156809898961524, 0.1411884873668896, 0.1464473659096688, 0.10810197852068518, 0.006698317057749067, -0.31551826085502643, 0.1159217144161368, -0.16493304477219264, -0.025684354540702524, -0.07993355841096934, -0.07204537725143166, 0.09389579893283198, -0.3341313519594516, -0.0030259451830993464, 0.005701204066330535, 0.02111778243334364, -0.07329815380340363, -0.09588295270657261, 0.015976735076993324, 0.18034416090233854, 0.039107180538910866, 0.014945306536994116, 0.15730861626107687, -0.1184295996751289, -0.17874798096639452, 0.3563145881368763, -0.011430395157145478, -0.21434908482047307, 0.1849124098129539, -0.0564041039630819, -0.1245453731231865, 0.09574457794285805, 0.2493382109786873, 0.14606703633257045, -0.17389003094242564, 0.04312437969251039, -0.05516689485215219, 0.1511242896983384, -0.032934123581133276, 0.017988096689312102, 0.13247498183045536, 0.18907190450186984, 0.1488277879425214, 0.11215138526051181, -0.019881109738627733, -0.1867855809258013, -0.2533537376143228, -0.09337315127012809, -0.19378874988306977, -0.03926913188553368, -0.10593130078601554, -0.12117575961007279, 0.37817702195173036, 0.15129480046867314, 0.19333534260572455, 0.16184863668962152, 0.342029347621157, 0.10572513672562664, 0.05412333025952201, 0.18278129186907435, 0.23243378549399865, 0.052765728043287725, 0.10395604917252736, -0.20364852357158533, 0.15902492846707592, 0.034281002112932626] |
1,802.08758 | Frequency control of single quantum emitters in integrated photonic
circuits | Generating entangled graph states of qubits requires high entanglement rates,
with efficient detection of multiple indistinguishable photons from separate
qubits. Integrating defect-based qubits into photonic devices results in an
enhanced photon collection efficiency, however, typically at the cost of a
reduced defect emission energy homogeneity. Here, we demonstrate that the
reduction in defect homogeneity in an integrated device can be partially offset
by electric field tuning. Using photonic device-coupled implanted nitrogen
vacancy (NV) centers in a GaP-on-diamond platform, we demonstrate large
field-dependent tuning ranges and partial stabilization of defect emission
energies. These results address some of the challenges of chip-scale
entanglement generation.
| physics.app-ph cond-mat.mes-hall quant-ph | generating entangled graph states of qubits requires high entanglement rates with efficient detection of multiple indistinguishable photons from separate qubits integrating defectbased qubits into photonic devices results in an enhanced photon collection efficiency however typically at the cost of a reduced defect emission energy homogeneity here we demonstrate that the reduction in defect homogeneity in an integrated device can be partially offset by electric field tuning using photonic devicecoupled implanted nitrogen vacancy nv centers in a gapondiamond platform we demonstrate large fielddependent tuning ranges and partial stabilization of defect emission energies these results address some of the challenges of chipscale entanglement generation | [['generating', 'entangled', 'graph', 'states', 'of', 'qubits', 'requires', 'high', 'entanglement', 'rates', 'with', 'efficient', 'detection', 'of', 'multiple', 'indistinguishable', 'photons', 'from', 'separate', 'qubits', 'integrating', 'defectbased', 'qubits', 'into', 'photonic', 'devices', 'results', 'in', 'an', 'enhanced', 'photon', 'collection', 'efficiency', 'however', 'typically', 'at', 'the', 'cost', 'of', 'a', 'reduced', 'defect', 'emission', 'energy', 'homogeneity', 'here', 'we', 'demonstrate', 'that', 'the', 'reduction', 'in', 'defect', 'homogeneity', 'in', 'an', 'integrated', 'device', 'can', 'be', 'partially', 'offset', 'by', 'electric', 'field', 'tuning', 'using', 'photonic', 'devicecoupled', 'implanted', 'nitrogen', 'vacancy', 'nv', 'centers', 'in', 'a', 'gapondiamond', 'platform', 'we', 'demonstrate', 'large', 'fielddependent', 'tuning', 'ranges', 'and', 'partial', 'stabilization', 'of', 'defect', 'emission', 'energies', 'these', 'results', 'address', 'some', 'of', 'the', 'challenges', 'of', 'chipscale', 'entanglement', 'generation']] | [-0.1226945825746412, 0.20937734316500817, 0.042508785280924624, -0.013739939096688044, 0.030271150162535728, -0.18965136630479063, 0.06867959087548575, 0.4838109148832241, -0.23159071757996427, -0.3408055648687157, 0.020339507581942744, -0.3029967683763935, -0.0035971951634060626, 0.21194735341843698, -0.037770527046136926, 0.06641448838959015, 0.08793715282924253, -0.094213991748667, -0.033529148492985175, -0.19244178924115957, 0.2666515377546098, 0.04565836632183965, 0.389074028677095, 0.10527552711566458, 0.12126350489509578, -0.007380880546839078, 0.052262195787106704, -0.006590568133178029, -0.03999784687284143, 0.17778681360570123, 0.315611608407119, 0.06843496193546839, 0.24410920743231135, -0.4580601105595579, -0.21169794274328074, 0.0781894104398492, 0.1781188020906826, 0.18531005773324483, -0.13263178787581476, -0.295482814918263, 0.044097055966901305, -0.15598106707243414, -0.11146055054283208, -0.06942459271695132, -0.031032492981827125, -0.028107808774918096, -0.22798949824922746, 0.058137782978465655, 0.0007918824022174767, 0.06815961600133762, -0.03529916984207195, -0.02603569634184979, -0.05426914760344984, 0.06718505758072922, -0.08686711548799926, -0.04584330834905354, 0.256459208204766, -0.1374483373325023, -0.2084948360126945, 0.3029701686971406, -0.04597243305185054, -0.12946375397651796, 0.14116817149149236, -0.10906937247197522, -0.11981246912261785, 0.1655124768725421, 0.14683487777146373, 0.10009083644219555, -0.14530712720191125, 0.03562311990368687, 0.07209513594896652, 0.25090550703208636, 0.09684550950285231, 0.16731309625642873, 0.2265709087363269, 0.16137985786247888, 0.09444738197887298, 0.1854532134873645, -0.09190382913566462, -0.027313907785193606, -0.26608094115255143, -0.21649485938066598, -0.236895990788494, 0.10906382931608448, -0.13912330615224136, -0.11038989878010631, 0.39053724412944646, 0.13453426269127405, 0.15323769118830488, -0.056100801809109965, 0.27483756008493426, 0.12869557810458584, 0.1242563981645842, 0.03272829193732526, 0.23726575255496565, 0.12545760277206872, 0.047157404520133936, -0.2800721674143235, -0.022058476986695486, -0.0634272569550736] |
1,802.08759 | On the possibility of classical client blind quantum computing | We define the functionality of delegated pseudo-secret random qubit generator
(PSRQG), where a classical client can instruct the preparation of a sequence of
random qubits at some distant party. Their classical description is
(computationally) unknown to any other party (including the distant party
preparing them) but known to the client. We emphasize the unique feature that
no quantum communication is required to implement PSRQG. This enables classical
clients to perform a class of quantum communication protocols with only a
public classical channel with a quantum server. A key such example is the
delegated universal blind quantum computing. Using our functionality one could
achieve a purely classical-client computational secure verifiable delegated
universal quantum computing (also referred to as verifiable blind quantum
computation). We give a concrete protocol (QFactory) implementing PSRQG, using
the Learning-With-Errors problem to construct a trapdoor one-way function with
certain desired properties (quantum-safe, two-regular, collision-resistant). We
then prove the security in the Quantum-Honest-But-Curious setting and briefly
discuss the extension to the malicious case.
| cs.CR quant-ph | we define the functionality of delegated pseudosecret random qubit generator psrqg where a classical client can instruct the preparation of a sequence of random qubits at some distant party their classical description is computationally unknown to any other party including the distant party preparing them but known to the client we emphasize the unique feature that no quantum communication is required to implement psrqg this enables classical clients to perform a class of quantum communication protocols with only a public classical channel with a quantum server a key such example is the delegated universal blind quantum computing using our functionality one could achieve a purely classicalclient computational secure verifiable delegated universal quantum computing also referred to as verifiable blind quantum computation we give a concrete protocol qfactory implementing psrqg using the learningwitherrors problem to construct a trapdoor oneway function with certain desired properties quantumsafe tworegular collisionresistant we then prove the security in the quantumhonestbutcurious setting and briefly discuss the extension to the malicious case | [['we', 'define', 'the', 'functionality', 'of', 'delegated', 'pseudosecret', 'random', 'qubit', 'generator', 'psrqg', 'where', 'a', 'classical', 'client', 'can', 'instruct', 'the', 'preparation', 'of', 'a', 'sequence', 'of', 'random', 'qubits', 'at', 'some', 'distant', 'party', 'their', 'classical', 'description', 'is', 'computationally', 'unknown', 'to', 'any', 'other', 'party', 'including', 'the', 'distant', 'party', 'preparing', 'them', 'but', 'known', 'to', 'the', 'client', 'we', 'emphasize', 'the', 'unique', 'feature', 'that', 'no', 'quantum', 'communication', 'is', 'required', 'to', 'implement', 'psrqg', 'this', 'enables', 'classical', 'clients', 'to', 'perform', 'a', 'class', 'of', 'quantum', 'communication', 'protocols', 'with', 'only', 'a', 'public', 'classical', 'channel', 'with', 'a', 'quantum', 'server', 'a', 'key', 'such', 'example', 'is', 'the', 'delegated', 'universal', 'blind', 'quantum', 'computing', 'using', 'our', 'functionality', 'one', 'could', 'achieve', 'a', 'purely', 'classicalclient', 'computational', 'secure', 'verifiable', 'delegated', 'universal', 'quantum', 'computing', 'also', 'referred', 'to', 'as', 'verifiable', 'blind', 'quantum', 'computation', 'we', 'give', 'a', 'concrete', 'protocol', 'qfactory', 'implementing', 'psrqg', 'using', 'the', 'learningwitherrors', 'problem', 'to', 'construct', 'a', 'trapdoor', 'oneway', 'function', 'with', 'certain', 'desired', 'properties', 'quantumsafe', 'tworegular', 'collisionresistant', 'we', 'then', 'prove', 'the', 'security', 'in', 'the', 'quantumhonestbutcurious', 'setting', 'and', 'briefly', 'discuss', 'the', 'extension', 'to', 'the', 'malicious', 'case']] | [-0.19104279437447963, 0.05865275188284756, -0.085420596931692, 0.06913647085644961, -0.09445191433055783, -0.3285191124334416, 0.11674018242559689, 0.3413699374493188, -0.3132823509831895, -0.2762521102309883, 0.10429786284763143, -0.22301434771796255, -0.11831258134272113, 0.22202801172849987, -0.1272004538275369, 0.14340995789912628, 0.029608283857463526, 0.050531642898073735, -0.02677913902198556, -0.2755009663773045, 0.26197061455755866, 0.03130147958016199, 0.26719241200963845, 0.02656534096846978, 0.07771812691851138, 0.04846929932851857, -0.003588949267184303, -0.0636499263170474, -0.09981181355854592, 0.1136925885235633, 0.3083476168293881, 0.1769473328659276, 0.30168140318783576, -0.3993764924084615, -0.14067265616712282, 0.1418061386552235, 0.09365606250288258, 0.19046833490331969, -0.06974827566582405, -0.3128849408639091, 0.09812032859538149, -0.23197496328839692, -0.113044283219537, -0.0894839090453285, -0.04753750053369118, -0.025713631602109602, -0.24755848693784396, -0.018705359040854685, 0.03015605743048982, 0.02939652670877722, 0.09521675245681156, 0.004375352773159367, 0.058670576191770865, 0.18221320405620028, -0.0982144263590563, 0.021864873895263474, 0.18195373818070376, -0.11061478022313179, -0.2059978987207437, 0.38018962255907507, 0.02221710829989715, -0.18224913189656236, 0.18020855458841348, -0.02584717839475979, -0.17311506494352558, -0.0007571130785973941, 0.1281129897882541, 0.08439552148148043, -0.15135158218865125, 0.0685427718493449, -0.046178609443207584, 0.21587249495780225, 0.029435472641983686, 0.1393071420120263, 0.15153789510306134, 0.09141234180790449, 0.09482919974486877, 0.20992594959731242, -0.020554520119473618, -0.17301947332379766, -0.3091486440210035, -0.2286869060590793, -0.2347803834134584, 0.09399493962655184, -0.05141225974681368, -0.1610528380747697, 0.3641496945652853, 0.17072377888318854, 0.11987636391214042, 0.08611446305664268, 0.3870853222247635, 0.06108693321053899, 0.07473823559798488, 0.14763920224980456, 0.16574582621640432, 0.08678524094668902, 0.09687392412151836, -0.15803986775641968, 0.12795112000298012, 0.030227664570176224] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.