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,803.05767
|
Multiplicity Dependence of Charged Particle, $\phi$ Meson and
Multi-strange Particle Productions in p+p Collisions at $\sqrt{\rm s}$ = 200
GeV with PYTHIA Simulation
|
We report the multiplicity dependence of charged particle productions for
$\pi^{\pm}$, $K^{\pm}$, $p$, $\overline{p}$ and $\phi$ meson at $|y| < 1.0$ in
p+p collisions at $\sqrt{\rm s}$ = 200 GeV with $\rm PYTHIA$ simulation. The
impact of parton multiple interactions and gluon contributions is studied and
found to be possible sources of the particle yields splitting as a function of
$p_T$ with respect to multiplicity. No obvious particle species dependence for
the splitting is observed. The multiplicity dependence on ratios of
$K^-/\pi^-$, $K^+/\pi^+$, $\overline{p}/\pi^-$, $p/\pi^+$ and
$\Lambda/K^{0}_{s}$ in mid-rapidity in p+p collisions is found following the
similar tendency as that in Au+Au collisions at $\sqrt{s_{NN}}$ = 200 GeV from
RHIC, which heralds the similar underlying initial production mechanisms
despite the differences in the initial colliding systems.
|
hep-ph nucl-th
|
we report the multiplicity dependence of charged particle productions for pipm kpm p overlinep and phi meson at y 10 in pp collisions at sqrtrm s 200 gev with rm pythia simulation the impact of parton multiple interactions and gluon contributions is studied and found to be possible sources of the particle yields splitting as a function of p_t with respect to multiplicity no obvious particle species dependence for the splitting is observed the multiplicity dependence on ratios of kpi kpi overlineppi ppi and lambdak0_s in midrapidity in pp collisions is found following the similar tendency as that in auau collisions at sqrts_nn 200 gev from rhic which heralds the similar underlying initial production mechanisms despite the differences in the initial colliding systems
|
[['we', 'report', 'the', 'multiplicity', 'dependence', 'of', 'charged', 'particle', 'productions', 'for', 'pipm', 'kpm', 'p', 'overlinep', 'and', 'phi', 'meson', 'at', 'y', '10', 'in', 'pp', 'collisions', 'at', 'sqrtrm', 's', '200', 'gev', 'with', 'rm', 'pythia', 'simulation', 'the', 'impact', 'of', 'parton', 'multiple', 'interactions', 'and', 'gluon', 'contributions', 'is', 'studied', 'and', 'found', 'to', 'be', 'possible', 'sources', 'of', 'the', 'particle', 'yields', 'splitting', 'as', 'a', 'function', 'of', 'p_t', 'with', 'respect', 'to', 'multiplicity', 'no', 'obvious', 'particle', 'species', 'dependence', 'for', 'the', 'splitting', 'is', 'observed', 'the', 'multiplicity', 'dependence', 'on', 'ratios', 'of', 'kpi', 'kpi', 'overlineppi', 'ppi', 'and', 'lambdak0_s', 'in', 'midrapidity', 'in', 'pp', 'collisions', 'is', 'found', 'following', 'the', 'similar', 'tendency', 'as', 'that', 'in', 'auau', 'collisions', 'at', 'sqrts_nn', '200', 'gev', 'from', 'rhic', 'which', 'heralds', 'the', 'similar', 'underlying', 'initial', 'production', 'mechanisms', 'despite', 'the', 'differences', 'in', 'the', 'initial', 'colliding', 'systems']]
|
[-0.08510213101858168, 0.25665731628887295, -0.18579804737402913, 0.1625478619291273, 0.055006142236231785, -0.10031553592184574, -0.08859329340540296, 0.3171905263221058, -0.20129699941451956, -0.29790865086119367, -0.13812808971568125, -0.4006091887964223, 0.11435639258564972, 0.1274420988312506, 0.10644141650508816, 0.09677904669755721, 0.15070615803569223, 0.031074859039115953, -0.021553854274892863, -0.16513871708392672, 0.2891415346099624, 0.09222168089042047, 0.19556243432973458, 0.1929333576917406, 0.049237693465935685, 0.0750266799241365, 0.0005439871475403387, -0.03220166746201372, -0.1614616724033201, 0.004199812490430593, 0.27859773031034607, 0.03467882703800451, 0.1150298980708287, -0.28292348633172004, -0.054855471105897814, 0.16689919430489947, 0.1723832166564416, 0.045179920236019765, -0.08918516827099843, -0.24024890275384353, 0.1825008892143766, -0.2291220028826028, -0.11227439996328326, 0.02296833924540296, 0.0751959156638723, 0.0589136741752547, -0.3287219283799451, 0.1556486005826694, -0.023359667244783746, 0.11435669992399228, -0.010861432817726722, -0.2595880516403453, -0.13710632283104265, -0.03674283098596019, 0.12457298518658229, 0.1394150405327176, 0.19650236935150334, -0.11303682758082916, -0.1904454253523088, 0.41751838331602936, 0.01100466105655381, -0.14215248674002848, 0.2245497154299079, -0.2335815071961199, -0.17255322660160502, 0.19963741891854633, 0.2566270295557059, 0.07145261125874751, -0.17931337108669, 0.059739201501905315, -0.004824798724545938, 0.20238466159728302, 0.15481356478000924, 0.07027998096517825, 0.12746279120702692, 0.1687445107211427, -0.01751117755392021, 0.06606102754301353, -0.11771937240884314, -0.07849798590840196, -0.375926068268917, -0.08783003409171658, -0.06126684117002216, 0.07805395729714869, -0.07110837308455228, 0.006097828057439377, 0.3340538841922109, 0.07217025578947647, 0.33356384105215653, -0.028236823689336395, 0.2495396905162228, 0.08229467037467028, 0.009236327296774077, 0.10039568326731281, 0.2588651806903564, 0.16485287152170167, 0.2517533759525939, -0.27146015501187404, 0.06843226615574241, 0.009611490928393796]
|
1,803.05768
|
PAC-Reasoning in Relational Domains
|
We consider the problem of predicting plausible missing facts in relational
data, given a set of imperfect logical rules. In particular, our aim is to
provide bounds on the (expected) number of incorrect inferences that are made
in this way. Since for classical inference it is in general impossible to bound
this number in a non-trivial way, we consider two inference relations that
weaken, but remain close in spirit to classical inference.
|
cs.AI cs.LG
|
we consider the problem of predicting plausible missing facts in relational data given a set of imperfect logical rules in particular our aim is to provide bounds on the expected number of incorrect inferences that are made in this way since for classical inference it is in general impossible to bound this number in a nontrivial way we consider two inference relations that weaken but remain close in spirit to classical inference
|
[['we', 'consider', 'the', 'problem', 'of', 'predicting', 'plausible', 'missing', 'facts', 'in', 'relational', 'data', 'given', 'a', 'set', 'of', 'imperfect', 'logical', 'rules', 'in', 'particular', 'our', 'aim', 'is', 'to', 'provide', 'bounds', 'on', 'the', 'expected', 'number', 'of', 'incorrect', 'inferences', 'that', 'are', 'made', 'in', 'this', 'way', 'since', 'for', 'classical', 'inference', 'it', 'is', 'in', 'general', 'impossible', 'to', 'bound', 'this', 'number', 'in', 'a', 'nontrivial', 'way', 'we', 'consider', 'two', 'inference', 'relations', 'that', 'weaken', 'but', 'remain', 'close', 'in', 'spirit', 'to', 'classical', 'inference']]
|
[-0.12405786955302271, 0.06111477519799438, -0.06364910299048966, 0.1637018288537446, -0.13884952762681577, -0.13410843214175353, 0.11168970749066728, 0.3461524140503671, -0.27359567504997057, -0.36778427919165957, 0.07668956656319399, -0.22099535828844333, -0.14705859156513018, 0.20099304652669364, -0.13872767021853682, 0.04996800907732298, 0.07066362821367672, 0.07224978938312335, -0.04545894364451265, -0.2895460327531004, 0.3214776004315354, 0.018778562649256654, 0.26200199018542963, -0.002667105103480733, 0.03593564982454862, 0.02584800834948611, -0.02928429629537277, 0.028191597614851262, -0.13567865694029832, 0.17064027537223106, 0.31374593756885993, 0.1970705884676944, 0.292249819302621, -0.4607994998287823, -0.17069702961533847, 0.13784798234701157, 0.1172535427677859, 0.16281751406818834, -0.014283291175767468, -0.21170052446218002, 0.09490450225227202, -0.1513052316602423, -0.08841843404419099, -0.09445930576960866, 0.02689745154283527, -0.05889584016727491, -0.23856950054889442, 0.0759933704781967, 0.12477640466143687, 0.0167933623953205, -0.028677531032978248, -0.09320035791501545, 0.06545888172695413, 0.11028340248675603, 0.055945261772851355, 0.006992314803129476, 0.0421616384442637, -0.1359042641060013, -0.11672834001688494, 0.37636783006342334, -0.015805281026081905, -0.24687411695615286, 0.18451680954442257, -0.12885683812459725, -0.22311036214361796, 0.0589710879786354, 0.1587804783678924, 0.1064035337832239, -0.1666148591838363, 0.07323674914530581, -0.1023542926996015, 0.1323451846320596, 0.04211406106737235, 0.03392023934429744, 0.21651778447752199, 0.15842117114031376, 0.07244155612877673, 0.14050526765640825, -0.03221223660835272, -0.11825560602462953, -0.31738348876953953, -0.12676775742390115, -0.17195723145010156, 0.055180976413086884, -0.05836098282209908, -0.18456646608117605, 0.2979024040978402, 0.27683587492437156, 0.23073256495707836, 0.09822806030408376, 0.29062026945434305, 0.08780853458726294, 0.004824914064051377, 0.08312932864969803, 0.24432194752929112, 0.11293711070902646, 0.03691907704988909, -0.11328904046806404, 0.1424350039710084, 0.005888075231470996]
|
1,803.05769
|
Measurement of Singly Cabibbo-Suppressed Decays
$D^{0}\to\pi^{0}\pi^{0}\pi^{0}$, $\pi^{0}\pi^{0}\eta$, $\pi^{0}\eta\eta$ and
$\eta\eta\eta$
|
Using a data sample of $e^+e^-$ collision data corresponding to an integrated
luminosity of 2.93 $fb^{-1}$ collected with the BESIII detector at a
center-of-mass energy of $\sqrt{s}= 3.773~GeV$,we search for the singly
Cabibbo-suppressed decays $D^{0}\to\pi^{0}\pi^{0}\pi^{0}$,
$\pi^{0}\pi^{0}\eta$, $\pi^{0}\eta\eta$ and $\eta\eta\eta$ using the double tag
method. The absolute branching fractions are measured to be
$\mathcal{B}(D^{0}\to\pi^{0}\pi^{0}\pi^{0}) = (2.0 \pm 0.4 \pm 0.3)\times
10^{-4}$, $\mathcal{B}(D^{0}\to\pi^{0}\pi^{0}\eta) = (3.8 \pm 1.1 \pm
0.7)\times 10^{-4}$ and $\mathcal{B}(D^{0}\to\pi^{0}\eta\eta) = (7.3 \pm 1.6
\pm 1.5)\times 10^{-4}$ with the statistical significances of $4.8\sigma$,
$3.8\sigma$ and $5.5\sigma$, respectively, where the first uncertainties are
statistical and the second ones systematic. No significant signal of
$D^{0}\to\eta\eta\eta$ is found, and the upper limit on its decay branching
fraction is set to be $\mathcal{B}(D^{0}\to\eta\eta\eta) < 1.3 \times 10^{-4}$
at the $90\%$ confidence level.
|
hep-ex
|
using a data sample of ee collision data corresponding to an integrated luminosity of 293 fb1 collected with the besiii detector at a centerofmass energy of sqrts 3773gevwe search for the singly cabibbosuppressed decays d0topi0pi0pi0 pi0pi0eta pi0etaeta and etaetaeta using the double tag method the absolute branching fractions are measured to be mathcalbd0topi0pi0pi0 20 pm 04 pm 03times 104 mathcalbd0topi0pi0eta 38 pm 11 pm 07times 104 and mathcalbd0topi0etaeta 73 pm 16 pm 15times 104 with the statistical significances of 48sigma 38sigma and 55sigma respectively where the first uncertainties are statistical and the second ones systematic no significant signal of d0toetaetaeta is found and the upper limit on its decay branching fraction is set to be mathcalbd0toetaetaeta 13 times 104 at the 90 confidence level
|
[['using', 'a', 'data', 'sample', 'of', 'ee', 'collision', 'data', 'corresponding', 'to', 'an', 'integrated', 'luminosity', 'of', '293', 'fb1', 'collected', 'with', 'the', 'besiii', 'detector', 'at', 'a', 'centerofmass', 'energy', 'of', 'sqrts', '3773gevwe', 'search', 'for', 'the', 'singly', 'cabibbosuppressed', 'decays', 'd0topi0pi0pi0', 'pi0pi0eta', 'pi0etaeta', 'and', 'etaetaeta', 'using', 'the', 'double', 'tag', 'method', 'the', 'absolute', 'branching', 'fractions', 'are', 'measured', 'to', 'be', 'mathcalbd0topi0pi0pi0', '20', 'pm', '04', 'pm', '03times', '104', 'mathcalbd0topi0pi0eta', '38', 'pm', '11', 'pm', '07times', '104', 'and', 'mathcalbd0topi0etaeta', '73', 'pm', '16', 'pm', '15times', '104', 'with', 'the', 'statistical', 'significances', 'of', '48sigma', '38sigma', 'and', '55sigma', 'respectively', 'where', 'the', 'first', 'uncertainties', 'are', 'statistical', 'and', 'the', 'second', 'ones', 'systematic', 'no', 'significant', 'signal', 'of', 'd0toetaetaeta', 'is', 'found', 'and', 'the', 'upper', 'limit', 'on', 'its', 'decay', 'branching', 'fraction', 'is', 'set', 'to', 'be', 'mathcalbd0toetaetaeta', '13', 'times', '104', 'at', 'the', '90', 'confidence', 'level']]
|
[-0.07367823864074631, 0.15694322404424305, -0.019879953509881202, 0.062224317302242815, 0.043350756677806884, -0.07948385430181511, 0.1282462630645794, 0.3003118578822185, -0.11769982616807151, -0.4342415554381302, 0.07496717950910266, -0.4431246157385345, 0.14412052805225053, 0.20005131038463014, 0.05223713243284669, 0.08568298003912911, 0.08164454125361438, 0.009348479153301854, -0.07031395346419807, -0.2055434484500438, 0.09507775072677013, 0.08594293944322719, 0.24309493855445877, 0.03577294168022708, 0.07588407646518391, -0.07183534177726644, -0.04627560442870753, -0.114994412749751, -0.16975900720263648, 0.0459234622022551, 0.22078983715345335, 0.10076352528248651, 0.16279951198042458, -0.24911210132715775, 0.056538913615891695, 0.17695736676120224, 0.15204867823686227, -0.01888080758667495, 0.025164264193576816, -0.3721219476981041, 0.19294175020872784, -0.2095096956214143, -0.048850425324028626, 0.06963939844176938, 0.10021948153710264, -0.10354964252020049, -0.30837110589202654, 0.21451671356255683, -0.10613494957837029, 0.1184990537911554, -0.034966550048034735, -0.27871756347962934, -0.04574543464248283, -0.05628224910419975, -0.0016817608480063132, 0.1418900206830834, 0.193309208823957, -0.026930669219129615, -0.13827729822259843, 0.3676361343067171, -0.09083899294631158, -0.09632438724526228, 0.12215236238100463, -0.2302054182276066, -0.12668021779475558, 0.27847214078164506, 0.24368321229345524, 0.022642068763892364, -0.22981751485703847, 0.03609295137789753, 0.05031837401593216, 0.28211022982708156, 0.07135848845474613, 0.049535772523645744, 0.17358496197714254, 0.18210089802801704, -0.030209627281078417, 0.005889166589293024, -0.22519336658147857, -0.001667763894567123, -0.35559753913125897, -0.09801608408825138, -0.05464873988276873, 0.13530178275755328, -0.13518910043468424, 8.865080984770997e-05, 0.2982038567121276, 0.08867657419098103, 0.32181037841444343, 0.09067393824832243, 0.2323137294087145, 0.16394297109380002, 0.0019289214068498367, 0.09613759318987529, 0.3223916529200207, 0.17839314367494777, 0.08185164674093676, -0.19130932870664252, -0.011084609744576817, -0.06122912280385892]
|
1,803.0577
|
Time reversal invariance violation for high energy charged baryons in
bent crystals
|
Spin precession of channelled particles in bent crystals at the LHC gives
unique possibility for measurements as electric and magnetic moments of charm,
beauty and strange charged baryons so and constants determining CP ($T_{odd},
P_{odd}$) violation interactions and $P_{odd}, T_{even}$ interactions of
baryons with electrons and nucleus (nucleons). For a particle moving in a bent
crystal a new effect caused by nonelastic processes arises: in addition to the
spin precession around the direction of the effective magnetic field (bend
axis), the direction of electric field and the direction of the particle
momentum, the spin rotation to the mentioned directions also appears.
|
hep-ph
|
spin precession of channelled particles in bent crystals at the lhc gives unique possibility for measurements as electric and magnetic moments of charm beauty and strange charged baryons so and constants determining cp t_odd p_odd violation interactions and p_odd t_even interactions of baryons with electrons and nucleus nucleons for a particle moving in a bent crystal a new effect caused by nonelastic processes arises in addition to the spin precession around the direction of the effective magnetic field bend axis the direction of electric field and the direction of the particle momentum the spin rotation to the mentioned directions also appears
|
[['spin', 'precession', 'of', 'channelled', 'particles', 'in', 'bent', 'crystals', 'at', 'the', 'lhc', 'gives', 'unique', 'possibility', 'for', 'measurements', 'as', 'electric', 'and', 'magnetic', 'moments', 'of', 'charm', 'beauty', 'and', 'strange', 'charged', 'baryons', 'so', 'and', 'constants', 'determining', 'cp', 't_odd', 'p_odd', 'violation', 'interactions', 'and', 'p_odd', 't_even', 'interactions', 'of', 'baryons', 'with', 'electrons', 'and', 'nucleus', 'nucleons', 'for', 'a', 'particle', 'moving', 'in', 'a', 'bent', 'crystal', 'a', 'new', 'effect', 'caused', 'by', 'nonelastic', 'processes', 'arises', 'in', 'addition', 'to', 'the', 'spin', 'precession', 'around', 'the', 'direction', 'of', 'the', 'effective', 'magnetic', 'field', 'bend', 'axis', 'the', 'direction', 'of', 'electric', 'field', 'and', 'the', 'direction', 'of', 'the', 'particle', 'momentum', 'the', 'spin', 'rotation', 'to', 'the', 'mentioned', 'directions', 'also', 'appears']]
|
[-0.16710322953462986, 0.3025281944014516, -0.0497299838323895, 0.07062709203815644, -0.09908194431900672, -0.10072890554612368, 0.035854858385588606, 0.351041707219844, -0.28314922414912086, -0.29197482630303223, -0.057117870420135906, -0.31052929261392076, 0.036530529292895624, 0.13413604430748707, 0.103783273579764, 0.00451480126795695, -0.015752047560510487, 0.014205178207497006, -0.05258963331964213, -0.13108340906190505, 0.27823460043033527, 0.05446186536423785, 0.2291793882770022, 0.132675880821948, 0.11564131512201016, 0.07304403608780086, 0.047011295439118576, 0.03185730331971012, -0.09031603410936047, 0.04735260198886516, 0.145198054642887, -0.05867747350634297, 0.12335821077918883, -0.41991695031984566, -0.10525244044274398, 0.06513086560940773, 0.2016618982840752, 0.17660174054122463, -0.14002174152704627, -0.2903542429191953, -0.007492833809216612, -0.13288960983669482, -0.24206953780418358, -0.06893363727941346, 0.058225653585545795, 0.024352739454659912, -0.27222002766181513, 0.1282382977018661, 0.07017481282891072, 0.052471946488067356, -0.07408413536289764, -0.15524833261265814, -0.043654970651895726, 0.02888194596894162, 0.21008801626367973, 0.1311987790413508, 0.24605061579495668, -0.17758891636268093, -0.18311103183737734, 0.41107942248435364, -0.019104468282168136, -0.19473196260304643, 0.09443663707070206, -0.2512242325207161, -0.09369257656550131, 0.16272479076461732, 0.22901052227855861, 0.0939116592053324, -0.14353100455260462, 0.05241230707831642, -0.02337463871460677, 0.1209834516432482, 0.10057743632273038, 0.035427651483296733, 0.3302757713953321, 0.11842037746490738, 0.027428612938707637, 0.09007925230568063, -0.15471316563426374, -0.06527718904994659, -0.2777067853387484, -0.17867953029758843, -0.13236285687049792, 0.035447509923335355, -0.07302457006730993, -0.10187262879953403, 0.430660107715497, 0.06259583219520978, 0.15588297276546428, -0.08092176135552605, 0.28005977235158386, 0.030475212325889272, 0.07168391939809489, 0.07611166390340737, 0.3441460378007176, 0.26202457035968524, 0.16728033857256866, -0.31016492448055866, 0.03090687928548486, 0.007307499611135764]
|
1,803.05771
|
Restarting the accelerated coordinate descent method with a rough strong
convexity estimate
|
We propose new restarting strategies for the accelerated coordinate descent
method. Our main contribution is to show that for a well chosen sequence of
restarting times, the restarted method has a nearly geometric rate of
convergence. A major feature of the method is that it can take profit of the
local quadratic error bound of the objective function without knowing the
actual value of the error bound. We also show that under the more restrictive
assumption that the objective function is strongly convex, any fixed restart
period leads to a geometric rate of convergence. Finally, we illustrate the
properties of the algorithm on a regularized logistic regression problem and on
a Lasso problem.
|
math.OC
|
we propose new restarting strategies for the accelerated coordinate descent method our main contribution is to show that for a well chosen sequence of restarting times the restarted method has a nearly geometric rate of convergence a major feature of the method is that it can take profit of the local quadratic error bound of the objective function without knowing the actual value of the error bound we also show that under the more restrictive assumption that the objective function is strongly convex any fixed restart period leads to a geometric rate of convergence finally we illustrate the properties of the algorithm on a regularized logistic regression problem and on a lasso problem
|
[['we', 'propose', 'new', 'restarting', 'strategies', 'for', 'the', 'accelerated', 'coordinate', 'descent', 'method', 'our', 'main', 'contribution', 'is', 'to', 'show', 'that', 'for', 'a', 'well', 'chosen', 'sequence', 'of', 'restarting', 'times', 'the', 'restarted', 'method', 'has', 'a', 'nearly', 'geometric', 'rate', 'of', 'convergence', 'a', 'major', 'feature', 'of', 'the', 'method', 'is', 'that', 'it', 'can', 'take', 'profit', 'of', 'the', 'local', 'quadratic', 'error', 'bound', 'of', 'the', 'objective', 'function', 'without', 'knowing', 'the', 'actual', 'value', 'of', 'the', 'error', 'bound', 'we', 'also', 'show', 'that', 'under', 'the', 'more', 'restrictive', 'assumption', 'that', 'the', 'objective', 'function', 'is', 'strongly', 'convex', 'any', 'fixed', 'restart', 'period', 'leads', 'to', 'a', 'geometric', 'rate', 'of', 'convergence', 'finally', 'we', 'illustrate', 'the', 'properties', 'of', 'the', 'algorithm', 'on', 'a', 'regularized', 'logistic', 'regression', 'problem', 'and', 'on', 'a', 'lasso', 'problem']]
|
[-0.09768409874863032, -0.002149875498319094, -0.15946166366503567, 0.0774935833621457, -0.07602127173511658, -0.1310607269983244, 0.09339144257457713, 0.40370931041187946, -0.3203150437468976, -0.25880810438729496, 0.13579250122544118, -0.20753540826211395, -0.18439901542676762, 0.21073925988006909, -0.11518597017058822, 0.07514635525928168, 0.08981310417958066, 0.06017805175212896, -0.09987659660885029, -0.33149124888200476, 0.30121400860031095, 0.07022714789594169, 0.25826552230040584, 0.02224877464690089, 0.14251924510344666, 0.0064029489907609155, 0.013978277418331811, -0.0034940004414689223, -0.09632384587842682, 0.11474451131550019, 0.17421606179755345, 0.19541815210100824, 0.38879015685710233, -0.36093594855834954, -0.15791931696466904, 0.14614899906090797, 0.12327001616358757, 0.10771054734550087, -0.06287061085832302, -0.20824033262587227, 0.11929066946618753, -0.12772928009868756, -0.11862519888240283, -0.06406961794349209, -0.05231966749163328, 0.040941904884128445, -0.3452862144439621, 0.08955608410693795, 0.10468542031980886, -0.008294035202568084, -0.07268424063047345, -0.13865694725696426, 0.021751200370243296, 0.06814954789619135, 0.09639298012768603, 0.07093774155194385, 0.14409954548994722, -0.08835758421306325, -0.10647979963867538, 0.34477586894238416, -0.08077669818112956, -0.2228639781561606, 0.15471246758199284, -0.08186945555715171, -0.12374726584824049, 0.13775023192463987, 0.21367348747047704, 0.16503367827694237, -0.12882328758725023, 0.05748565045991022, -0.07836945917852949, 0.1591058473836268, 0.020618820927658044, -0.015045956341731073, 0.11309250055985377, 0.16022785085838584, 0.20455001100930756, 0.15471964205442146, -0.07227952643586076, -0.09460060046243984, -0.31382440727830463, -0.1488707910499956, -0.2223452845407007, 0.019628982087473625, -0.1558885944931741, -0.15951937649695747, 0.4026160163936757, 0.15401947536645869, 0.19556171486599255, 0.14741211038791632, 0.3207770341397387, 0.15713498588554578, 0.05063472300795199, 0.10672660859351137, 0.23053210501484903, 0.06631406190170519, 0.02485658368919935, -0.26030681557145663, 0.12605313003986282, 0.1247534260969708]
|
1,803.05772
|
Steel-Based Electrocatalysts for Efficient and Durable Oxygen Evolution
in Acidic Media
|
High overpotentials, particularly an issue of common anode materials, hamper
the process of water electrolysis for clean energy generation. Thanks to
immense research efforts up to date oxygen evolution electrocatalysts based on
earth-abundant elements work efficiently and stably in neutral and alkaline
regimes. However, non-noble metal-based anode materials that can withstand low
pH regimes are considered to be an indispensable prerequisite for the water
splitting to succeed in the future. All oxygen evolving electrodes working
durably and actively in acids contain Ir at least as an additive. Due to its
scarcity and high acquisition costs noble elements like Pt, Ru and Ir need to
be replaced by earth abundant elements. We have evaluated a Ni containing
stainless steel for use as an oxygen-forming electrode in diluted H2SO4.
Unmodified Ni42 steel showed a significant weight loss after long term OER
polarization experiments. Moreover, a substantial loss of the OER performance
of the untreated steel specimen seen in linear sweep voltammetry measurements
turned out to be a serious issue. However, upon anodization in LiOH, Ni42 alloy
was rendered in OER electrocatalysts that exhibit under optimized synthesis
conditions stable overpotentials down to 445 mV for 10 mA cm-2 current density
at pH 0. Even more important: The resulting material has proven to be robust
upon long-term usage (weight loss: 20 mug/mm2 after 50 ks of
chronopotentiometry at pH 1) towards OER in H2SO4. Our results suggest that
electrochemical oxidation of Ni42 steel in LiOH (sample Ni42Li205) results in
the formation of a metal oxide containing outer zone that supports solution
route-based oxygen evolution in acidic regime accompanied by a good stability
of the catalyst.
|
physics.chem-ph
|
high overpotentials particularly an issue of common anode materials hamper the process of water electrolysis for clean energy generation thanks to immense research efforts up to date oxygen evolution electrocatalysts based on earthabundant elements work efficiently and stably in neutral and alkaline regimes however nonnoble metalbased anode materials that can withstand low ph regimes are considered to be an indispensable prerequisite for the water splitting to succeed in the future all oxygen evolving electrodes working durably and actively in acids contain ir at least as an additive due to its scarcity and high acquisition costs noble elements like pt ru and ir need to be replaced by earth abundant elements we have evaluated a ni containing stainless steel for use as an oxygenforming electrode in diluted h2so4 unmodified ni42 steel showed a significant weight loss after long term oer polarization experiments moreover a substantial loss of the oer performance of the untreated steel specimen seen in linear sweep voltammetry measurements turned out to be a serious issue however upon anodization in lioh ni42 alloy was rendered in oer electrocatalysts that exhibit under optimized synthesis conditions stable overpotentials down to 445 mv for 10 ma cm2 current density at ph 0 even more important the resulting material has proven to be robust upon longterm usage weight loss 20 mugmm2 after 50 ks of chronopotentiometry at ph 1 towards oer in h2so4 our results suggest that electrochemical oxidation of ni42 steel in lioh sample ni42li205 results in the formation of a metal oxide containing outer zone that supports solution routebased oxygen evolution in acidic regime accompanied by a good stability of the catalyst
|
[['high', 'overpotentials', 'particularly', 'an', 'issue', 'of', 'common', 'anode', 'materials', 'hamper', 'the', 'process', 'of', 'water', 'electrolysis', 'for', 'clean', 'energy', 'generation', 'thanks', 'to', 'immense', 'research', 'efforts', 'up', 'to', 'date', 'oxygen', 'evolution', 'electrocatalysts', 'based', 'on', 'earthabundant', 'elements', 'work', 'efficiently', 'and', 'stably', 'in', 'neutral', 'and', 'alkaline', 'regimes', 'however', 'nonnoble', 'metalbased', 'anode', 'materials', 'that', 'can', 'withstand', 'low', 'ph', 'regimes', 'are', 'considered', 'to', 'be', 'an', 'indispensable', 'prerequisite', 'for', 'the', 'water', 'splitting', 'to', 'succeed', 'in', 'the', 'future', 'all', 'oxygen', 'evolving', 'electrodes', 'working', 'durably', 'and', 'actively', 'in', 'acids', 'contain', 'ir', 'at', 'least', 'as', 'an', 'additive', 'due', 'to', 'its', 'scarcity', 'and', 'high', 'acquisition', 'costs', 'noble', 'elements', 'like', 'pt', 'ru', 'and', 'ir', 'need', 'to', 'be', 'replaced', 'by', 'earth', 'abundant', 'elements', 'we', 'have', 'evaluated', 'a', 'ni', 'containing', 'stainless', 'steel', 'for', 'use', 'as', 'an', 'oxygenforming', 'electrode', 'in', 'diluted', 'h2so4', 'unmodified', 'ni42', 'steel', 'showed', 'a', 'significant', 'weight', 'loss', 'after', 'long', 'term', 'oer', 'polarization', 'experiments', 'moreover', 'a', 'substantial', 'loss', 'of', 'the', 'oer', 'performance', 'of', 'the', 'untreated', 'steel', 'specimen', 'seen', 'in', 'linear', 'sweep', 'voltammetry', 'measurements', 'turned', 'out', 'to', 'be', 'a', 'serious', 'issue', 'however', 'upon', 'anodization', 'in', 'lioh', 'ni42', 'alloy', 'was', 'rendered', 'in', 'oer', 'electrocatalysts', 'that', 'exhibit', 'under', 'optimized', 'synthesis', 'conditions', 'stable', 'overpotentials', 'down', 'to', '445', 'mv', 'for', '10', 'ma', 'cm2', 'current', 'density', 'at', 'ph', '0', 'even', 'more', 'important', 'the', 'resulting', 'material', 'has', 'proven', 'to', 'be', 'robust', 'upon', 'longterm', 'usage', 'weight', 'loss', '20', 'mugmm2', 'after', '50', 'ks', 'of', 'chronopotentiometry', 'at', 'ph', '1', 'towards', 'oer', 'in', 'h2so4', 'our', 'results', 'suggest', 'that', 'electrochemical', 'oxidation', 'of', 'ni42', 'steel', 'in', 'lioh', 'sample', 'ni42li205', 'results', 'in', 'the', 'formation', 'of', 'a', 'metal', 'oxide', 'containing', 'outer', 'zone', 'that', 'supports', 'solution', 'routebased', 'oxygen', 'evolution', 'in', 'acidic', 'regime', 'accompanied', 'by', 'a', 'good', 'stability', 'of', 'the', 'catalyst']]
|
[-0.042603960541104866, 0.13721605193603276, 0.019292749316812657, -0.015481516723681015, 0.039829251262244215, -0.17357259189835592, 0.09861436273208522, 0.44685728726594637, -0.20828581608531907, -0.3225290670682247, 0.09905323557196401, -0.2876800606070847, -0.08179340847072014, 0.18562854669049855, -0.07494969061318282, 0.03976257532736468, 0.057521247957250596, -0.07420244578826712, -0.07105875082840718, -0.2482553831321686, 0.17865789676440902, 0.13020466203837958, 0.3031053029860576, 0.09973508372535747, 0.06003943012812792, -0.06667248140898453, 0.05212919599686624, -0.011621248094741715, -0.07007488992966865, 0.07129443451423854, 0.3227097705767005, 0.0021579781275116996, 0.2614592341566633, -0.4924383362167816, -0.22899440845299324, 0.026172718749998995, 0.09899610410453595, 0.07617062151655275, -0.14561493409788176, -0.19705377047975664, 0.12180955688057517, -0.1665992095546748, -0.14125962164828532, -0.03501340019114861, 0.0429604574854831, -0.008222386219158545, -0.2554880279122437, 0.0427365714308286, 0.058201594807235704, 0.08630427228433363, -0.10441290010124347, -0.17891347318824924, -0.09459381027248329, 0.07519155257810535, 0.04203052881026853, 0.030556932070348344, 0.2250184692154213, -0.10779186042133816, -0.009701390835428864, 0.37311032443038755, -0.0865603506565966, -0.08825429961824796, 0.2141313584454267, -0.10077407019917438, -0.09058884808301843, 0.22610989032785866, 0.14009639795185921, 0.1193737938558885, -0.1792652877509831, 0.03711327087842207, 0.05587247903554697, 0.185792752974126, 0.13589077769806573, 0.0148647995229657, 0.21538192311158816, 0.24077230753387543, 0.04371270111250545, 0.114715179526125, -0.0701411777386993, 0.010603162639666252, -0.16106463698164494, -0.23633320481810294, -0.10950712261988331, 0.08575572813023928, -0.05080398843048815, -0.15522491837954602, 0.3172914165277941, 0.10052486257243916, 0.15654996769221094, -0.07170633634337406, 0.22387261163663078, 0.03532510733472581, 0.10672134819810282, 0.013356055549872613, 0.2387750968267297, 0.11586328292324832, 0.13968084006978387, -0.2400853032872346, 0.15456128102218844, -0.013831950275032093]
|
1,803.05773
|
Duals of a frame in quaternionic Hilbert spaces
|
Frames in a separable quaternionic Hilbert space were introduced and studied
in [17] to have more applications. In this paper, we extend the study of frames
in quaternionic Hilbert spaces and introduce different types of duals of a
frame in separable quaternionic Hilbert spaces. As an application, we give the
orthogonal projection of $\ell^2(\HH)$ onto the range of analysis operator of
the given frame, in terms of elements of canonical dual frame and elements of
the frame in quaternionic Hilbert space. Finally, we give an expression for the
orthogonal projection in terms of operators related to the frame and its
canonical dual frame in quaternionic Hilbert space.
|
math.FA
|
frames in a separable quaternionic hilbert space were introduced and studied in 17 to have more applications in this paper we extend the study of frames in quaternionic hilbert spaces and introduce different types of duals of a frame in separable quaternionic hilbert spaces as an application we give the orthogonal projection of ell2hh onto the range of analysis operator of the given frame in terms of elements of canonical dual frame and elements of the frame in quaternionic hilbert space finally we give an expression for the orthogonal projection in terms of operators related to the frame and its canonical dual frame in quaternionic hilbert space
|
[['frames', 'in', 'a', 'separable', 'quaternionic', 'hilbert', 'space', 'were', 'introduced', 'and', 'studied', 'in', '17', 'to', 'have', 'more', 'applications', 'in', 'this', 'paper', 'we', 'extend', 'the', 'study', 'of', 'frames', 'in', 'quaternionic', 'hilbert', 'spaces', 'and', 'introduce', 'different', 'types', 'of', 'duals', 'of', 'a', 'frame', 'in', 'separable', 'quaternionic', 'hilbert', 'spaces', 'as', 'an', 'application', 'we', 'give', 'the', 'orthogonal', 'projection', 'of', 'ell2hh', 'onto', 'the', 'range', 'of', 'analysis', 'operator', 'of', 'the', 'given', 'frame', 'in', 'terms', 'of', 'elements', 'of', 'canonical', 'dual', 'frame', 'and', 'elements', 'of', 'the', 'frame', 'in', 'quaternionic', 'hilbert', 'space', 'finally', 'we', 'give', 'an', 'expression', 'for', 'the', 'orthogonal', 'projection', 'in', 'terms', 'of', 'operators', 'related', 'to', 'the', 'frame', 'and', 'its', 'canonical', 'dual', 'frame', 'in', 'quaternionic', 'hilbert', 'space']]
|
[-0.10383967966838512, 0.07825276412246616, -0.06684217936873331, 0.05362151501116009, -0.030080015316412273, -0.053627497380388515, -0.032930817005865906, 0.4015834194449884, -0.2763822686700326, -0.14300689046745593, 0.07684966499965533, -0.2089603734466265, -0.16245923092026474, 0.17157883737411983, -0.16056471066944794, 0.024296689075132268, 0.04717504176891075, 0.10148268813741798, -0.23967411604551775, -0.26572342228170764, 0.4305003877237158, 0.039024318348756935, 0.21954276347049634, -0.05704122765060022, 0.1444361899926696, 0.07931422191355729, -0.08822507436721111, -0.03257236237069899, -0.09678060752076079, 0.1782392950350735, 0.3277914163498384, 0.1533607184834216, 0.2566976280232786, -0.4210637646182528, -0.1666634722858808, 0.18451480069285575, 0.13405235269862525, -0.014570587756164934, -0.00884282745638937, -0.30689881548707215, -0.005801753690389407, -0.1367712993666811, -0.09854626826247868, -0.12826530630963873, 0.05882258706216542, -0.021070358117181314, -0.23143201012972672, 0.01567401765529418, 0.07832084389684617, 0.09251762113867784, -0.15798941497220922, -0.05722971341159757, 0.037027480774822666, 0.07893630209431615, -0.03643567600937666, 0.07610491148573961, 0.0702278423166992, -0.024263473067274492, -0.11805290025043881, 0.42187428695835033, -0.08195489159135043, -0.30954478276928643, 0.1319959971719896, -0.1805516135492274, -0.1158348893667659, 0.04952632168413333, 0.19685595576598677, 0.14309603179681976, -0.09009902188466545, 0.1849793927317907, -0.12876827990249642, 0.04076280581923026, 0.1301759986452899, 0.14959048928763224, 0.08178095630466727, 0.06410471687339386, 0.07370423335573231, 0.1659349009464934, -0.019204435518608905, -0.1145477289463534, -0.3854007551727711, -0.2792798266658243, -0.1596272097338202, 0.02140921691788431, -0.11009183375303247, -0.1547700385475215, 0.45659886900212543, 0.048823008559784796, 0.23637321349760554, 0.03092162271539839, 0.20270735123150824, 0.07623095927158159, 0.04581422172047479, 0.035206484573207936, 0.20874287992856413, 0.1920884794507281, 0.07945246384742688, -0.13792171615685495, -0.1116044018154015, 0.2099031868109585]
|
1,803.05774
|
Some ring-theoretic properties of the ring of $\mathcal{R}L_\tau$
|
The aim of this article is to survey ring-theoretic properties of Kasch, the
regularity and the injectivity of the ring of real-continuous functions on a
topoframe $L_{ \tau}$, i.e., $\mathcal{R}L_\tau$. In order to study these
properties, the concept of $P$-spaces and extremally disconnected spaces are
extend to topoframes. For a $P$- topoframe $L_{ \tau}$, the ring
$\mathcal{R}L_\tau$ is $\aleph_0$-Kasch ring. $P$- topoframes are characterized
in terms of ring-theoretic properties of the regularity and injectivity of the
ring of real-continuous functions on a topoframe. It follows from these
characterizations that the ring $\mathcal{R}L_\tau$ is regular if and only if
it is $\aleph_0$-selfinjective. For a completely regular topoframe $L_\tau$, we
show that $\mathcal{R}L_\tau$ is a Bear ring if and only if it is a $CS$-ring
if and only if $L_\tau$ is extremally disconnected and also prove that it is
selfinjective ring if and only if $L_{ \tau}$ is an extremally disconnected
$P$-topoframe.
|
math.GN
|
the aim of this article is to survey ringtheoretic properties of kasch the regularity and the injectivity of the ring of realcontinuous functions on a topoframe l_ tau ie mathcalrl_tau in order to study these properties the concept of pspaces and extremally disconnected spaces are extend to topoframes for a p topoframe l_ tau the ring mathcalrl_tau is aleph_0kasch ring p topoframes are characterized in terms of ringtheoretic properties of the regularity and injectivity of the ring of realcontinuous functions on a topoframe it follows from these characterizations that the ring mathcalrl_tau is regular if and only if it is aleph_0selfinjective for a completely regular topoframe l_tau we show that mathcalrl_tau is a bear ring if and only if it is a csring if and only if l_tau is extremally disconnected and also prove that it is selfinjective ring if and only if l_ tau is an extremally disconnected ptopoframe
|
[['the', 'aim', 'of', 'this', 'article', 'is', 'to', 'survey', 'ringtheoretic', 'properties', 'of', 'kasch', 'the', 'regularity', 'and', 'the', 'injectivity', 'of', 'the', 'ring', 'of', 'realcontinuous', 'functions', 'on', 'a', 'topoframe', 'l_', 'tau', 'ie', 'mathcalrl_tau', 'in', 'order', 'to', 'study', 'these', 'properties', 'the', 'concept', 'of', 'pspaces', 'and', 'extremally', 'disconnected', 'spaces', 'are', 'extend', 'to', 'topoframes', 'for', 'a', 'p', 'topoframe', 'l_', 'tau', 'the', 'ring', 'mathcalrl_tau', 'is', 'aleph_0kasch', 'ring', 'p', 'topoframes', 'are', 'characterized', 'in', 'terms', 'of', 'ringtheoretic', 'properties', 'of', 'the', 'regularity', 'and', 'injectivity', 'of', 'the', 'ring', 'of', 'realcontinuous', 'functions', 'on', 'a', 'topoframe', 'it', 'follows', 'from', 'these', 'characterizations', 'that', 'the', 'ring', 'mathcalrl_tau', 'is', 'regular', 'if', 'and', 'only', 'if', 'it', 'is', 'aleph_0selfinjective', 'for', 'a', 'completely', 'regular', 'topoframe', 'l_tau', 'we', 'show', 'that', 'mathcalrl_tau', 'is', 'a', 'bear', 'ring', 'if', 'and', 'only', 'if', 'it', 'is', 'a', 'csring', 'if', 'and', 'only', 'if', 'l_tau', 'is', 'extremally', 'disconnected', 'and', 'also', 'prove', 'that', 'it', 'is', 'selfinjective', 'ring', 'if', 'and', 'only', 'if', 'l_', 'tau', 'is', 'an', 'extremally', 'disconnected', 'ptopoframe']]
|
[-0.17631253960926632, 0.10914877871585883, -0.0985827460230517, 0.0703505940891646, -0.06685209689153866, -0.14106863188081897, -0.04551053967593902, 0.37508734883545164, -0.3079124078467176, -0.13933814448219808, 0.15151072223345144, -0.28071809724181684, -0.12491003576978728, 0.18006064598220628, -0.07607149102129172, -0.07585523560174279, 0.04258892693641511, 0.10071606707427051, -0.0658272705643301, -0.2610874166712165, 0.38064364609601614, -0.03327490587334533, 0.14924044426452446, 0.0804675446653908, 0.07453777032441922, -0.023673213956473798, 0.0010217022007474531, 0.04377783971701885, -0.170668497726342, 0.07879979007753667, 0.19729907266222513, 0.12595165472549313, 0.20277455553308232, -0.3303588720598629, -0.08757127692493108, 0.20480743283731537, 0.11721187863186315, -0.031110297484727174, 0.0022401035587479184, -0.22889491360165648, 0.20599027841280287, -0.16095457114670034, -0.13206894699015193, -0.05780861171538831, 0.1491682622516593, 0.02817037255972155, -0.28551686001563825, 0.03805175070448166, 0.14131893252732453, 0.04498828380283984, -0.026925950850053997, -0.02782499295874284, -0.07460179556343523, 0.05577107819148919, 0.007833546768365935, 0.04498848926855603, 0.08876006417562599, -0.09720328532100714, -0.027889947512779723, 0.36307062196929557, -0.019789321257706757, -0.1856372690722151, 0.17449147856006256, -0.24143473680906155, -0.12788330791257582, 0.10307161484346758, 0.05787617180470403, 0.1577628803784614, -0.08684642887771964, 0.20666374232606977, -0.1605456059577165, 0.16233616562599276, 0.054043186633111716, 0.06813903609811739, 0.17218594091547118, 0.11354684148478758, 0.12223411874883887, 0.12221284622613054, -0.00019988420881799883, 0.023898384285117077, -0.3411482564479738, -0.1615716754426281, -0.15342898419374354, 0.12146730760724603, -0.029633884226180403, -0.15884446641886152, 0.3932476597219393, 0.06989344648391634, 0.2020535442108692, 0.07960887313852985, 0.24840412002343398, 0.04845953580330719, 0.08129752704782503, 0.10865613437173041, 0.1859915739941326, 0.1826691055097259, -0.01111583024185229, -0.1772502289524862, 0.026862568459701495, 0.13148982160548855]
|
1,803.05775
|
$\mathfrak{q}$-crystal structure on primed tableaux and on signed
unimodal factorizations of reduced words of type $B$
|
Crystal basis theory for the queer Lie superalgebra was developed by
Grantcharov et al. and it was shown that semistandard decomposition tableaux
admit the structure of crystals for the queer Lie superalgebra or simply
$\mathfrak{q}$-crystal structure. In this paper, we explore the
$\mathfrak{q}$-crystal structure of primed tableaux (semistandard marked
shifted tableaux) and that of signed unimodal factorizations of reduced words
of type $B$. We give the explicit odd Kashiwara operators on primed tableaux
and the forms of the highest and lowest weight vectors. We also give the
explicit algorithms for odd Kashiwara operators on signed unimodal
factorizations of reduced words of type $B$.
|
math.CO
|
crystal basis theory for the queer lie superalgebra was developed by grantcharov et al and it was shown that semistandard decomposition tableaux admit the structure of crystals for the queer lie superalgebra or simply mathfrakqcrystal structure in this paper we explore the mathfrakqcrystal structure of primed tableaux semistandard marked shifted tableaux and that of signed unimodal factorizations of reduced words of type b we give the explicit odd kashiwara operators on primed tableaux and the forms of the highest and lowest weight vectors we also give the explicit algorithms for odd kashiwara operators on signed unimodal factorizations of reduced words of type b
|
[['crystal', 'basis', 'theory', 'for', 'the', 'queer', 'lie', 'superalgebra', 'was', 'developed', 'by', 'grantcharov', 'et', 'al', 'and', 'it', 'was', 'shown', 'that', 'semistandard', 'decomposition', 'tableaux', 'admit', 'the', 'structure', 'of', 'crystals', 'for', 'the', 'queer', 'lie', 'superalgebra', 'or', 'simply', 'mathfrakqcrystal', 'structure', 'in', 'this', 'paper', 'we', 'explore', 'the', 'mathfrakqcrystal', 'structure', 'of', 'primed', 'tableaux', 'semistandard', 'marked', 'shifted', 'tableaux', 'and', 'that', 'of', 'signed', 'unimodal', 'factorizations', 'of', 'reduced', 'words', 'of', 'type', 'b', 'we', 'give', 'the', 'explicit', 'odd', 'kashiwara', 'operators', 'on', 'primed', 'tableaux', 'and', 'the', 'forms', 'of', 'the', 'highest', 'and', 'lowest', 'weight', 'vectors', 'we', 'also', 'give', 'the', 'explicit', 'algorithms', 'for', 'odd', 'kashiwara', 'operators', 'on', 'signed', 'unimodal', 'factorizations', 'of', 'reduced', 'words', 'of', 'type', 'b']]
|
[-0.10686671207220948, 0.12237753956993618, -0.04862814748862592, 0.06787950560418281, -0.16218607068190924, -0.14316385746115154, 0.06587784774463144, 0.3944825529130084, -0.314889969304204, -0.25242488105587735, 0.03503915959724806, -0.22526607030799778, -0.20555870908330942, 0.1005143408864128, -0.13927272816031877, -0.02825744171156594, 0.039610891584491374, 0.07196274014779984, -0.13553560013873595, -0.28743046053021337, 0.38080372848077726, 0.022966855620541196, 0.2491913298882618, -0.04630878692986167, 0.12584104064372506, 0.022764810077421885, -0.03525414434953196, -0.05105231167508824, -0.1591099032281845, 0.16122158616320184, 0.25363793956244934, 0.10610697448880661, 0.12365663017256942, -0.3906684590337595, -0.009283860204833568, 0.15922912616872847, 0.21194047682761852, 0.02455687177100099, -0.04169741388880602, -0.2821137480170346, 0.05228599254502961, -0.2161522756450542, -0.14572693124911426, -0.05950594768112544, 0.10679415127465336, 0.022504071114898317, -0.23778474275518374, 0.019518986730179336, 0.1436997661712847, 0.12421951674404416, -0.07070143043183454, -0.2553646472066014, -0.030250348565675836, 0.02760019569685406, -0.12522343398615865, 0.005101962134905971, 0.0576485539417677, -0.10941226306223854, -0.2232519235867675, 0.3001899507892604, 0.038864948353407404, -0.25689075101111636, 0.0863110371173756, -0.18783647451310023, -0.17799055583701276, 0.10989601293689397, 0.03171440185736957, 0.11773180967141496, -0.02317543637807398, 0.1807179969221372, -0.1674620552947468, 0.04613005233430626, 0.20454893336806557, -0.024307205920230994, 0.12680530852389219, 0.06259368907770899, 0.002217484352243419, 0.15885566338657006, 0.04635440233845891, -0.002889195810381028, -0.2640416440046807, -0.19860662337355683, -0.10823987874820239, 0.05435819049264387, -0.10745869682915048, -0.23968861226337076, 0.41849832467292203, 0.044234409766954065, 0.17123359418935188, 0.10550596577917586, 0.10589024273328262, 0.1083064214741387, 0.16475082881919265, -0.03157382695313248, 0.07185596413218813, 0.27298563555814326, 0.012735646688333243, -0.16754556594803782, 0.015890318927145333, 0.25145815371876895]
|
1,803.05776
|
Gaussian Processes Over Graphs
|
We propose Gaussian processes for signals over graphs (GPG) using the apriori
knowledge that the target vectors lie over a graph. We incorporate this
information using a graph- Laplacian based regularization which enforces the
target vectors to have a specific profile in terms of graph Fourier transform
coeffcients, for example lowpass or bandpass graph signals. We discuss how the
regularization affects the mean and the variance in the prediction output. In
particular, we prove that the predictive variance of the GPG is strictly
smaller than the conventional Gaussian process (GP) for any non-trivial graph.
We validate our concepts by application to various real-world graph signals.
Our experiments show that the performance of the GPG is superior to GP for
small training data sizes and under noisy training.
|
stat.ML cs.LG eess.SP
|
we propose gaussian processes for signals over graphs gpg using the apriori knowledge that the target vectors lie over a graph we incorporate this information using a graph laplacian based regularization which enforces the target vectors to have a specific profile in terms of graph fourier transform coeffcients for example lowpass or bandpass graph signals we discuss how the regularization affects the mean and the variance in the prediction output in particular we prove that the predictive variance of the gpg is strictly smaller than the conventional gaussian process gp for any nontrivial graph we validate our concepts by application to various realworld graph signals our experiments show that the performance of the gpg is superior to gp for small training data sizes and under noisy training
|
[['we', 'propose', 'gaussian', 'processes', 'for', 'signals', 'over', 'graphs', 'gpg', 'using', 'the', 'apriori', 'knowledge', 'that', 'the', 'target', 'vectors', 'lie', 'over', 'a', 'graph', 'we', 'incorporate', 'this', 'information', 'using', 'a', 'graph', 'laplacian', 'based', 'regularization', 'which', 'enforces', 'the', 'target', 'vectors', 'to', 'have', 'a', 'specific', 'profile', 'in', 'terms', 'of', 'graph', 'fourier', 'transform', 'coeffcients', 'for', 'example', 'lowpass', 'or', 'bandpass', 'graph', 'signals', 'we', 'discuss', 'how', 'the', 'regularization', 'affects', 'the', 'mean', 'and', 'the', 'variance', 'in', 'the', 'prediction', 'output', 'in', 'particular', 'we', 'prove', 'that', 'the', 'predictive', 'variance', 'of', 'the', 'gpg', 'is', 'strictly', 'smaller', 'than', 'the', 'conventional', 'gaussian', 'process', 'gp', 'for', 'any', 'nontrivial', 'graph', 'we', 'validate', 'our', 'concepts', 'by', 'application', 'to', 'various', 'realworld', 'graph', 'signals', 'our', 'experiments', 'show', 'that', 'the', 'performance', 'of', 'the', 'gpg', 'is', 'superior', 'to', 'gp', 'for', 'small', 'training', 'data', 'sizes', 'and', 'under', 'noisy', 'training']]
|
[-0.06794374137676841, 0.023914776243797436, -0.08752349728359071, 0.0798845994135707, -0.14140798155893022, -0.09815754254227578, 0.03166623023617279, 0.436353926260875, -0.2897694274768468, -0.28131448976030043, 0.12346718112507736, -0.2707079855989166, -0.19471963605931483, 0.17731840321684153, -0.11303117143826222, 0.07493750058759854, 0.11452486957460055, 0.0965195137816738, -0.06432673393833033, -0.24516403347328966, 0.3232719184332124, 0.018955439351147085, 0.2930065432607424, 0.0005085840385854538, 0.13749765272629924, 0.03830685278063449, -0.022822670347064616, -0.005028597203882661, -0.10563643248727697, 0.11469222603395111, 0.26599905858051004, 0.17158968141485798, 0.2828732101525378, -0.40662978786065823, -0.2593611693587227, 0.17469320013224493, 0.1177823316547873, 0.06872409199984143, -0.016193785702839025, -0.2946571237957618, 0.12467010865559963, -0.09648345429156943, -0.005336703455779614, -0.09481433278140355, -0.022640577891445534, 0.026364222535584854, -0.3469026791038153, 0.04588355116480155, 0.09999259203804407, 0.04154501759307826, -0.009361078893017816, -0.16073648556406925, 0.017506396708694676, 0.10843693720374814, -0.010527619575269476, 0.011077481992066082, 0.13648858513888412, -0.11227740277536213, -0.1436735508435472, 0.3341744297778043, -0.09677213888056668, -0.2641413263595245, 0.1231630494621927, -0.11390025968348065, -0.1261434604076478, 0.10949060113689914, 0.20543362877852334, 0.0863124074077043, -0.12472429670994793, 0.07271617658960626, -0.04193959532646594, 0.17284742741310222, 0.06036634755496845, 0.015130784718217109, 0.09592930532581224, 0.18066493735472694, 0.09892129458351369, 0.17735459924653524, -0.12045979508777208, -0.04753553352454369, -0.2824806330004142, -0.1068540306057869, -0.25631274986924146, -0.011047094750518757, -0.20086627155996117, -0.16543728802499807, 0.44676465636823237, 0.20039615236549532, 0.20709849823647597, 0.13171880988598486, 0.319199051854648, 0.10896143926798886, 0.07756196024028335, 0.11824313368222962, 0.14801030617764616, 0.10468891173725815, 0.04396291822011722, -0.17050609584369764, 0.06381050944988301, 0.02324251163252226]
|
1,803.05777
|
Practical considerations for measuring global spin alignment of vector
mesons in relativistic heavy ion collisions
|
Global spin alignment of vector mesons is a sensitive probe of system
vorticity and particle production mechanism in relativistic heavy ion
collisions. The measurement of global spin alignment is gaining increasing
interest and deserves careful considerations. In this paper, we lay out a few
practical issues that need to be taken care of when measuring global spin
alignment of vector mesons. They are, the correction for event plane
resolution, reconciling measurements made with different event planes, the
correction for the effect of finite acceptance in pseudorapidity, and the
consideration for measuring the azimuthal angle dependence. Insights and
methodologies offered in this paper will help experiments to measure the global
spin alignment properly and accurately.
|
nucl-ex nucl-th
|
global spin alignment of vector mesons is a sensitive probe of system vorticity and particle production mechanism in relativistic heavy ion collisions the measurement of global spin alignment is gaining increasing interest and deserves careful considerations in this paper we lay out a few practical issues that need to be taken care of when measuring global spin alignment of vector mesons they are the correction for event plane resolution reconciling measurements made with different event planes the correction for the effect of finite acceptance in pseudorapidity and the consideration for measuring the azimuthal angle dependence insights and methodologies offered in this paper will help experiments to measure the global spin alignment properly and accurately
|
[['global', 'spin', 'alignment', 'of', 'vector', 'mesons', 'is', 'a', 'sensitive', 'probe', 'of', 'system', 'vorticity', 'and', 'particle', 'production', 'mechanism', 'in', 'relativistic', 'heavy', 'ion', 'collisions', 'the', 'measurement', 'of', 'global', 'spin', 'alignment', 'is', 'gaining', 'increasing', 'interest', 'and', 'deserves', 'careful', 'considerations', 'in', 'this', 'paper', 'we', 'lay', 'out', 'a', 'few', 'practical', 'issues', 'that', 'need', 'to', 'be', 'taken', 'care', 'of', 'when', 'measuring', 'global', 'spin', 'alignment', 'of', 'vector', 'mesons', 'they', 'are', 'the', 'correction', 'for', 'event', 'plane', 'resolution', 'reconciling', 'measurements', 'made', 'with', 'different', 'event', 'planes', 'the', 'correction', 'for', 'the', 'effect', 'of', 'finite', 'acceptance', 'in', 'pseudorapidity', 'and', 'the', 'consideration', 'for', 'measuring', 'the', 'azimuthal', 'angle', 'dependence', 'insights', 'and', 'methodologies', 'offered', 'in', 'this', 'paper', 'will', 'help', 'experiments', 'to', 'measure', 'the', 'global', 'spin', 'alignment', 'properly', 'and', 'accurately']]
|
[-0.1350740034504908, 0.17289085604307616, -0.09750791797577812, 0.11314877056059215, -0.0821773578053373, -0.13117684400231952, 0.004354401654972319, 0.36221691241422505, -0.2507000421909125, -0.3069094745769051, 0.053563634946680906, -0.30244020267829846, -0.010593099550246015, 0.14795594024083888, 0.005435854457972343, 0.07927845104336086, 0.10048507197286215, -0.03639931138400642, -0.10228057044227362, -0.1885487102135493, 0.29600884004193767, 0.11327602734723896, 0.2921829033365244, 0.14308656598727235, 0.09317457482316777, 0.08510171178638477, -0.06869126021557716, 0.04945568841669643, -0.12104265242152523, 0.08151932544582483, 0.252984220194712, 0.10506395229113925, 0.2320932571923262, -0.4163397405492632, -0.17382487046058503, 0.10577273939066288, 0.17880821479239353, 0.13542674863945872, -0.10486040148769685, -0.26853660584770533, 0.07316244004310615, -0.17154736547085472, -0.14950418270401364, -0.09090589441914569, 0.02083785376478836, -0.011318356934281295, -0.2883382156376907, 0.05506276344806936, 0.051894895540419636, 0.11541471887878224, -0.04670051974448653, -0.11464001312177922, -0.022866439264218667, 0.12045798221681667, 0.11878843188465557, 0.08967779943997269, 0.1633764037069979, -0.11665972231033568, -0.10104611443290323, 0.3881533632643129, 0.005872185401242683, -0.26801661322742965, 0.11219190973318754, -0.19844946265220642, -0.1378658775754861, 0.10351119909370154, 0.22235220360259214, 0.0819156865973287, -0.17050989862419605, -0.007538315670037838, 0.026683058503917174, 0.14685011176120416, 0.03928630998595046, 0.09306558438682962, 0.27402766478623736, 0.19356015707537727, 0.03333368358251296, 0.062038463047269544, -0.1526584646178475, -0.10102560039887433, -0.30078185692413206, -0.15481975280451016, -0.12282382795411538, 0.03012734276994148, -0.07496970512824064, -0.06011657748502074, 0.4048498355571115, 0.16746081236194363, 0.18488472638030848, -0.042250846600437764, 0.32880861254964483, 0.072622465034089, 0.05964402728734473, -0.011520106623177989, 0.3017322016847238, 0.14666199294968688, 0.14782797858903282, -0.24504579890421346, 0.07793204639854498, 0.005756352345965672]
|
1,803.05778
|
Using accumulation to optimize deep residual neural nets
|
Residual Neural Networks [1] won first place in all five main tracks of the
ImageNet and COCO 2015 competitions. This kind of network involves the creation
of pluggable modules such that the output contains a residual from the input.
The residual in that paper is the identity function. We propose to include
residuals from all lower layers, suitably normalized, to create the residual.
This way, all previous layers contribute equally to the output of a layer. We
show that our approach is an improvement on [1] for the CIFAR-10 dataset.
|
cs.CV
|
residual neural networks 1 won first place in all five main tracks of the imagenet and coco 2015 competitions this kind of network involves the creation of pluggable modules such that the output contains a residual from the input the residual in that paper is the identity function we propose to include residuals from all lower layers suitably normalized to create the residual this way all previous layers contribute equally to the output of a layer we show that our approach is an improvement on 1 for the cifar10 dataset
|
[['residual', 'neural', 'networks', '1', 'won', 'first', 'place', 'in', 'all', 'five', 'main', 'tracks', 'of', 'the', 'imagenet', 'and', 'coco', '2015', 'competitions', 'this', 'kind', 'of', 'network', 'involves', 'the', 'creation', 'of', 'pluggable', 'modules', 'such', 'that', 'the', 'output', 'contains', 'a', 'residual', 'from', 'the', 'input', 'the', 'residual', 'in', 'that', 'paper', 'is', 'the', 'identity', 'function', 'we', 'propose', 'to', 'include', 'residuals', 'from', 'all', 'lower', 'layers', 'suitably', 'normalized', 'to', 'create', 'the', 'residual', 'this', 'way', 'all', 'previous', 'layers', 'contribute', 'equally', 'to', 'the', 'output', 'of', 'a', 'layer', 'we', 'show', 'that', 'our', 'approach', 'is', 'an', 'improvement', 'on', '1', 'for', 'the', 'cifar10', 'dataset']]
|
[-0.07680096013678445, 0.04229841183486213, -0.04430902226724558, 0.0229378207328005, -0.028389068910231192, -0.08544594425087174, 0.02012103212505786, 0.3905945546925068, -0.28770961082320556, -0.33354804675198263, 0.053210877479674915, -0.3079291062429547, -0.19135457050029395, 0.1873029453265998, -0.11148639236473375, 0.011789954489924842, 0.12397927770184146, 0.030293132395793995, -0.04151961554307491, -0.3339135519746277, 0.33897061959529917, 0.019071076572355298, 0.3138795481787788, 0.020237737231784396, 0.14215148027417146, -0.05453579696412716, -0.007843914229629769, -0.05166873305958385, -0.02796791879736702, 0.15920596833392564, 0.20990968089964654, 0.15243496971929238, 0.2837469668644998, -0.41464904978250466, -0.165782963955361, 0.086119827384957, 0.09491625152942207, 0.10900062279154857, -0.003948580821613885, -0.2576428155828681, 0.13469737670513698, -0.1882583163678646, 0.024030680794061884, -0.06488920982099242, -0.0071214240613496965, 0.00855648533648087, -0.2868081021743516, 0.06226914111110899, 0.12936547852845656, 0.0110383792521639, -0.05310850674803886, -0.1682700027142548, -0.02114478269747148, 0.22025003066907325, 0.0011875949127392637, 0.07899903706921678, 0.10405784539050526, -0.15636457797728426, -0.10891618537716567, 0.3152818703299595, -0.10576278608706262, -0.15077993779753646, 0.15663683477582202, -0.06026388509199023, -0.15313459102892213, 0.06713651328528714, 0.1986314802741011, 0.08845918509695265, -0.135098104727351, 0.002643428711194752, -0.07842391870088047, 0.22269395732631286, 0.04803251022886899, -0.02324990874880718, 0.15417371997609736, 0.21549834048168526, 0.07755707809960263, 0.18721816811917558, -0.15638508940723517, -0.03534522893993805, -0.3236895827886959, -0.13439155405180322, -0.17631414032981008, -0.0025856550472478073, -0.0754163074409007, -0.150110529963341, 0.44853089968156484, 0.22251234749952953, 0.25737279643201166, 0.10588858283849226, 0.3132756545001434, 0.04088077354374238, 0.14881990695786146, 0.08848768729302618, 0.23089506557832162, 0.03451235602971994, 0.0869554096677651, -0.1381389624555595, 0.05457580420706007, 0.07840759174691306]
|
1,803.05779
|
A predictor-corrector method for the training of deep neural networks
|
The training of deep neural nets is expensive. We present a predictor-
corrector method for the training of deep neural nets. It alternates a
predictor pass with a corrector pass using stochastic gradient descent with
backpropagation such that there is no loss in validation accuracy. No special
modifications to SGD with backpropagation is required by this methodology. Our
experiments showed a time improvement of 9% on the CIFAR-10 dataset.
|
cs.CV
|
the training of deep neural nets is expensive we present a predictor corrector method for the training of deep neural nets it alternates a predictor pass with a corrector pass using stochastic gradient descent with backpropagation such that there is no loss in validation accuracy no special modifications to sgd with backpropagation is required by this methodology our experiments showed a time improvement of 9 on the cifar10 dataset
|
[['the', 'training', 'of', 'deep', 'neural', 'nets', 'is', 'expensive', 'we', 'present', 'a', 'predictor', 'corrector', 'method', 'for', 'the', 'training', 'of', 'deep', 'neural', 'nets', 'it', 'alternates', 'a', 'predictor', 'pass', 'with', 'a', 'corrector', 'pass', 'using', 'stochastic', 'gradient', 'descent', 'with', 'backpropagation', 'such', 'that', 'there', 'is', 'no', 'loss', 'in', 'validation', 'accuracy', 'no', 'special', 'modifications', 'to', 'sgd', 'with', 'backpropagation', 'is', 'required', 'by', 'this', 'methodology', 'our', 'experiments', 'showed', 'a', 'time', 'improvement', 'of', '9', 'on', 'the', 'cifar10', 'dataset']]
|
[-0.05380991237588983, -0.048957987823456096, -0.07979702329991953, 0.08991578008399169, -0.09915051952112412, -0.1851574761280115, 0.06306068652876369, 0.5007728800393533, -0.2668814152830105, -0.33323739631020505, 0.08328252153781553, -0.27148548883817875, -0.21900914559491735, 0.2084162799452526, -0.12848268555261302, 0.10814731973020927, 0.24008818480955518, 0.01567446915567785, -0.0895848006779409, -0.38261805148120376, 0.21299088931224053, 0.05144625799511087, 0.283103500843804, -0.0756195311147114, 0.22534150726742286, -0.04879897108733438, 0.014293295378540304, -0.027848536553590195, 0.005421470354148356, 0.14211256849238704, 0.24376065381701387, 0.1814150507291914, 0.41991084706092224, -0.42341513518729934, -0.21446607072932133, 0.11681176205098197, 0.10144786685123108, 0.12220179818678593, -0.08847327196491424, -0.266782156066915, 0.07021544648433928, -0.09300155702816404, 0.018490278769446457, -0.154634071500513, -0.07604830614898515, 0.03762367259765017, -0.3405218200515146, 0.045217601484551596, 0.11717245923490197, 0.12934620659528434, 0.010580756870246883, -0.12005024323656656, -0.0010494664007716854, 0.06193156545792801, 0.018705239529599963, 0.1385207050749897, 0.08796270437997536, -0.15799251184933752, -0.12079799140169137, 0.2706284496690268, -0.12928051901036414, -0.2153519230314355, 0.13707673911383186, 0.03138042596992159, -0.13549414493373016, 0.1265327751390177, 0.22668683269749518, 0.12698194838088492, -0.14991224227824074, 0.018542759154207895, -0.039197737013624195, 0.19934251893689667, 0.04939158028329088, -0.12712281573550316, 0.07529799143473308, 0.35304559097773786, 0.09214392316568157, 0.13870797373786353, -0.18333920518921662, -0.07666626661691976, -0.32258383559899917, -0.1209754295701134, -0.19398278280066839, 0.02310153738042151, -0.14249532391060737, -0.18832063696522644, 0.354315805748321, 0.19695080342986013, 0.2078924089791658, 0.1950203280126595, 0.3481756163275112, 0.06054403064131359, 0.21724302731878276, 0.1435155160927578, 0.2888730326532454, 0.06213493106306355, 0.16452764250689011, -0.16810677872052876, 0.10152062961993658, 0.09290176613823227]
|
1,803.0578
|
Fixed Divisor of a Multivariate Polynomial and Generalized Factorials in
Several Variables
|
We define new generalized factorials in several variables over an arbitrary
subset $\underline{S} \subseteq R^n,$ where $R$ is a Dedekind domain and $n$ is
a positive integer. We then study the properties of the fixed divisor
$d(\underline{S},f)$ of a multivariate polynomial $f \in R[x_1,x_2, \ldots,
x_n]$. We generalize the results of Polya, Bhargava, Gunji & McQuillan and
strengthen that of Evrard, all of which relate the fixed divisor to generalized
factorials of $\underline{S}$. We also express $d(\underline{S},f)$ in terms of
the images $f(\underline{a})$ of finitely many elements $\underline{a} \in
R^n$, generalizing a result of Hensel, and in terms of the coefficients of $f$
under explicit bases.
|
math.RA
|
we define new generalized factorials in several variables over an arbitrary subset underlines subseteq rn where r is a dedekind domain and n is a positive integer we then study the properties of the fixed divisor dunderlinesf of a multivariate polynomial f in rx_1x_2 ldots x_n we generalize the results of polya bhargava gunji mcquillan and strengthen that of evrard all of which relate the fixed divisor to generalized factorials of underlines we also express dunderlinesf in terms of the images funderlinea of finitely many elements underlinea in rn generalizing a result of hensel and in terms of the coefficients of f under explicit bases
|
[['we', 'define', 'new', 'generalized', 'factorials', 'in', 'several', 'variables', 'over', 'an', 'arbitrary', 'subset', 'underlines', 'subseteq', 'rn', 'where', 'r', 'is', 'a', 'dedekind', 'domain', 'and', 'n', 'is', 'a', 'positive', 'integer', 'we', 'then', 'study', 'the', 'properties', 'of', 'the', 'fixed', 'divisor', 'dunderlinesf', 'of', 'a', 'multivariate', 'polynomial', 'f', 'in', 'rx_1x_2', 'ldots', 'x_n', 'we', 'generalize', 'the', 'results', 'of', 'polya', 'bhargava', 'gunji', 'mcquillan', 'and', 'strengthen', 'that', 'of', 'evrard', 'all', 'of', 'which', 'relate', 'the', 'fixed', 'divisor', 'to', 'generalized', 'factorials', 'of', 'underlines', 'we', 'also', 'express', 'dunderlinesf', 'in', 'terms', 'of', 'the', 'images', 'funderlinea', 'of', 'finitely', 'many', 'elements', 'underlinea', 'in', 'rn', 'generalizing', 'a', 'result', 'of', 'hensel', 'and', 'in', 'terms', 'of', 'the', 'coefficients', 'of', 'f', 'under', 'explicit', 'bases']]
|
[-0.19078279426321387, 0.06014992607264966, -0.08018526058032305, 0.006663475781405235, -0.06486609252626259, -0.10505860463223037, 0.016261240430906706, 0.27661431663870517, -0.3110716307681857, -0.16376893308972962, 0.05396582451922929, -0.287940418060102, -0.1574422514554588, 0.2076313819955377, -0.14203004515273313, 0.015444009825039436, -0.022999040042871937, 0.05644487493726261, -0.08594898581185251, -0.3054351649594073, 0.34325102828077825, -0.07591020415637496, 0.15115188946034394, 0.0524309166911396, 0.1034464680500712, 0.0227395318603764, -0.04611278101505127, -0.013647874972472588, -0.16951434394864276, 0.10463357466619973, 0.28986321707420487, 0.1471096822973706, 0.29058763488908024, -0.3688836775117499, -0.12081153525550868, 0.22010356853898688, 0.1657400411078889, -0.035672643255013244, 0.026428835291881114, -0.21550133644475364, 0.1321624693022493, -0.17436456659297442, -0.16866250800918423, -0.07091464284423958, 0.09798524932885616, 0.11019741792880072, -0.36026051529117076, 0.016657631508446773, 0.13647077677716665, 0.12115334358303716, -0.04295137136553725, -0.1735860652189848, 0.008019546197508188, 0.05148114408275076, 0.006861203281647142, 0.06587891917168985, 0.001902095364023219, -0.08886422546507389, -0.12163624513949103, 0.3334894340522998, -0.07873374536889148, -0.2554103558992638, 0.07512392092487026, -0.19191113758978307, -0.16934720915285686, 0.060208002114485876, 0.12181704499594428, 0.19012330586145468, -0.055920897069953235, 0.20265945096274235, -0.1699180861971542, 0.09227038970144064, 0.17400995584423928, 0.03126798455738097, 0.11324027608212668, 0.029914773174324165, 0.02858210083350594, 0.19405570102389902, 0.014513651027764175, -0.02262219922233592, -0.3576501939518779, -0.2028645623621403, -0.19265270790692382, 0.1128029952957934, -0.1686101248940081, -0.16914383851576084, 0.38987405211025594, 0.11158838979306393, 0.21673002038333639, 0.12851880832378954, 0.17612131429133096, 0.07451214282042987, 0.014923266769733792, 0.04172170540208325, 0.035389815596407095, 0.1803356280513838, -0.022244321516778905, -0.15021050814995726, 0.02021085196768171, 0.15375504617615804]
|
1,803.05781
|
Rational homology balls in $2$-handlebodies
|
We prove that there are rational homology balls $B_p$ smoothly embedded in
the $2$-handlebodies associated to certain knots. Furthermore we show that, if
we rationally blow up the $2$-handlebody along the embedded rational homology
ball $B_p$, then the resulting $4$-manifold cannot be obtained just by a
sequence of ordinary blow ups from the $2$-handlebody under a certain mild
condition.
|
math.GT
|
we prove that there are rational homology balls b_p smoothly embedded in the 2handlebodies associated to certain knots furthermore we show that if we rationally blow up the 2handlebody along the embedded rational homology ball b_p then the resulting 4manifold cannot be obtained just by a sequence of ordinary blow ups from the 2handlebody under a certain mild condition
|
[['we', 'prove', 'that', 'there', 'are', 'rational', 'homology', 'balls', 'b_p', 'smoothly', 'embedded', 'in', 'the', '2handlebodies', 'associated', 'to', 'certain', 'knots', 'furthermore', 'we', 'show', 'that', 'if', 'we', 'rationally', 'blow', 'up', 'the', '2handlebody', 'along', 'the', 'embedded', 'rational', 'homology', 'ball', 'b_p', 'then', 'the', 'resulting', '4manifold', 'can', 'not', 'be', 'obtained', 'just', 'by', 'a', 'sequence', 'of', 'ordinary', 'blow', 'ups', 'from', 'the', '2handlebody', 'under', 'a', 'certain', 'mild', 'condition']]
|
[-0.21245787513131897, 0.13663391104588907, -0.12453702126319209, 0.0611712079650412, -0.06814352869987488, -0.1715885108181586, 0.018422671828496582, 0.4024274890621503, -0.37910533665368956, -0.18915634060588976, 0.15204448975273407, -0.22655288049330313, -0.13396684034572293, 0.1895459608718132, -0.18386503648168098, -0.02714563106613544, 0.08979410116250316, 0.09791741139876346, -0.10425933140795678, -0.32322626368453106, 0.4030697210381428, -0.13135155175502103, 0.13311973086868722, 0.07462733666858791, 0.115944986200581, -0.10266333500233789, 0.08762504889940222, 0.06419422319935014, -0.22049209209435502, 0.07347291742141047, 0.23098859667467575, 0.056853717002862444, 0.19545830033409098, -0.41010121727983156, -0.14861978244346877, 0.21517746107031901, 0.17846187330627192, -0.04498383643416067, -0.059894341715456295, -0.24708591755479575, 0.17728957063518463, -0.1064380643326634, -0.2089459807612002, -0.08774473215453327, -0.030039058346301318, 0.09393210620619356, -0.2028650696661013, -0.027791946226110063, 0.10176734604562322, 0.03574992799355338, -0.055814188757600885, -0.029020571685396134, -0.0931674346793443, 0.09624274788269152, 0.03907701579543452, 0.11494440165503571, 0.13034057603993762, -0.061853953862252335, -0.03909566883618633, 0.3448515519189338, -0.09875417035073042, -0.2425506105646491, 0.1127334215057393, -0.21196390006225557, -0.1773074242208774, 0.22831377814679096, 0.04256967210094444, 0.1384190428070724, -0.029386603374344608, 0.14704792263607183, -0.11071990561516334, 0.14738970648419733, 0.162531903735362, -0.09124909442228575, 0.15257165093595784, 0.005992951069492847, 0.1238761136153092, 0.12391259001063494, -0.002202162520067456, -0.04412835774322351, -0.3579832160224517, -0.1916745358845219, -0.08624042384326458, 0.19803219292104282, -0.11660586260259151, -0.18413142858383555, 0.305684501118958, 0.028315533980882417, 0.22971795039872328, 0.13425040390963355, 0.21119444835931062, 0.07015002101349334, 0.10481339801723759, 0.1095530467107892, 0.15014551969167467, 0.09413071566959844, -0.012338706587130824, -0.10332932329814261, -0.0337776548617209, 0.16061935640561084]
|
1,803.05782
|
Cogrowth for group actions with strongly contracting elements
|
Let $G$ be a group acting properly by isometries and with a strongly
contracting element on a geodesic metric space. Let $N$ be an infinite normal
subgroup of $G$, and let $\delta_N$ and $\delta_G$ be the growth rates of $N$
and $G$ with respect to the pseudo-metric induced by the action. We prove that
if $G$ has purely exponential growth with respect to the pseudo-metric then
$\delta_N/\delta_G>1/2$. Our result applies to suitable actions of hyperbolic
groups, right-angled Artin groups and other CAT(0) groups, mapping class
groups, snowflake groups, small cancellation groups, etc. This extends
Grigorchuk's original result on free groups with respect to a word metrics and
a recent result of Jaerisch, Matsuzaki, and Yabuki on groups acting on
hyperbolic spaces to a much wider class of groups acting on spaces that are not
necessarily hyperbolic.
|
math.GR math.DS
|
let g be a group acting properly by isometries and with a strongly contracting element on a geodesic metric space let n be an infinite normal subgroup of g and let delta_n and delta_g be the growth rates of n and g with respect to the pseudometric induced by the action we prove that if g has purely exponential growth with respect to the pseudometric then delta_ndelta_g12 our result applies to suitable actions of hyperbolic groups rightangled artin groups and other cat0 groups mapping class groups snowflake groups small cancellation groups etc this extends grigorchuks original result on free groups with respect to a word metrics and a recent result of jaerisch matsuzaki and yabuki on groups acting on hyperbolic spaces to a much wider class of groups acting on spaces that are not necessarily hyperbolic
|
[['let', 'g', 'be', 'a', 'group', 'acting', 'properly', 'by', 'isometries', 'and', 'with', 'a', 'strongly', 'contracting', 'element', 'on', 'a', 'geodesic', 'metric', 'space', 'let', 'n', 'be', 'an', 'infinite', 'normal', 'subgroup', 'of', 'g', 'and', 'let', 'delta_n', 'and', 'delta_g', 'be', 'the', 'growth', 'rates', 'of', 'n', 'and', 'g', 'with', 'respect', 'to', 'the', 'pseudometric', 'induced', 'by', 'the', 'action', 'we', 'prove', 'that', 'if', 'g', 'has', 'purely', 'exponential', 'growth', 'with', 'respect', 'to', 'the', 'pseudometric', 'then', 'delta_ndelta_g12', 'our', 'result', 'applies', 'to', 'suitable', 'actions', 'of', 'hyperbolic', 'groups', 'rightangled', 'artin', 'groups', 'and', 'other', 'cat0', 'groups', 'mapping', 'class', 'groups', 'snowflake', 'groups', 'small', 'cancellation', 'groups', 'etc', 'this', 'extends', 'grigorchuks', 'original', 'result', 'on', 'free', 'groups', 'with', 'respect', 'to', 'a', 'word', 'metrics', 'and', 'a', 'recent', 'result', 'of', 'jaerisch', 'matsuzaki', 'and', 'yabuki', 'on', 'groups', 'acting', 'on', 'hyperbolic', 'spaces', 'to', 'a', 'much', 'wider', 'class', 'of', 'groups', 'acting', 'on', 'spaces', 'that', 'are', 'not', 'necessarily', 'hyperbolic']]
|
[-0.15623898828696264, 0.1801635182903129, -0.1075343830314906, 0.009671034385044044, -0.14641818275353066, -0.1207271340912334, 0.018174085717060064, 0.418801938057562, -0.30867262008158786, -0.23595860349390782, 0.12067318924079488, -0.29575874045827333, -0.12301260610531203, 0.23909084828696528, -0.17769666049013236, -0.07742190208720197, 0.05186703130147679, 0.1317708138516523, -0.07275665862331714, -0.2739724427027474, 0.4278098439825769, -0.04681446211201601, 0.2385015235881188, 0.005815704780301654, 0.07100536959609927, 0.0017766141318681097, -0.032050241471121184, 0.05708267216030613, -0.1468335440058718, 0.12716712250157183, 0.2518141884951943, 0.007769046220018116, 0.24633672318239241, -0.33211038799438264, -0.2179544512392547, 0.24630477722328073, 0.10596881820680223, -0.052782637011119744, -0.07113451940616719, -0.3500084765763127, 0.10977498619446069, -0.15348484368532672, -0.13519660518609716, -0.02113785679431114, 0.09091685119932308, 0.002453043572849741, -0.23332316712546336, -0.016042900758382297, 0.10515938725854669, 0.06652963385896239, -0.04945281746379744, -0.05612406536194503, -0.07051085193879567, 0.14079386082694942, -0.005071978798990411, 0.08352657732259679, 0.11014766564056158, 0.01361800594425137, -0.11001417250722591, 0.4452268281055236, -0.0989734084884587, -0.2651756583481915, 0.18335152496548748, -0.21791339981460706, -0.15524945860112407, 0.09546674311833274, 0.171296081917546, 0.16944703445734835, 0.0002798600458448991, 0.1906520274622695, -0.09974569211805001, 0.09858981171566852, 0.06492215939412328, -0.03227453767076919, 0.06513694824328772, 0.08219585086777456, 0.19171535499618017, 0.10614321872205089, 0.11460026417494773, 0.05564483790921005, -0.32618862618797256, -0.16189740060415483, -0.10936296476695434, 0.1380588457276528, -0.14496229456212895, -0.2102979976715366, 0.333515766199286, -0.012809252432946647, 0.16452660253691606, 0.1779722297052972, 0.1709119723584587, 0.010224012150761805, 0.10381953789164572, 0.09140584067303882, 0.044686972247646714, 0.2344469350195469, -0.14286947780838227, -0.1590638315984349, -0.0008682459969199577, 0.2272780172253742]
|
1,803.05783
|
From receptive profiles to a metric model of V1
|
In this work we show how to construct connectivity kernels induced by the
receptive profiles of simple cells of the primary visual cortex (V1). These
kernels are directly defined by the shape of such profiles: this provides a
metric model for the functional architecture of V1, whose global geometry is
determined by the reciprocal interactions between local elements. Our
construction adapts to any bank of filters chosen to represent a set of
receptive profiles, since it does not require any structure on the
parameterization of the family. The connectivity kernel that we define carries
a geometrical structure consistent with the well-known properties of long-range
horizontal connections in V1, and it is compatible with the perceptual rules
synthesized by the concept of association field. These characteristics are
still present when the kernel is constructed from a bank of filters arising
from an unsupervised learning algorithm.
|
math.MG q-bio.NC
|
in this work we show how to construct connectivity kernels induced by the receptive profiles of simple cells of the primary visual cortex v1 these kernels are directly defined by the shape of such profiles this provides a metric model for the functional architecture of v1 whose global geometry is determined by the reciprocal interactions between local elements our construction adapts to any bank of filters chosen to represent a set of receptive profiles since it does not require any structure on the parameterization of the family the connectivity kernel that we define carries a geometrical structure consistent with the wellknown properties of longrange horizontal connections in v1 and it is compatible with the perceptual rules synthesized by the concept of association field these characteristics are still present when the kernel is constructed from a bank of filters arising from an unsupervised learning algorithm
|
[['in', 'this', 'work', 'we', 'show', 'how', 'to', 'construct', 'connectivity', 'kernels', 'induced', 'by', 'the', 'receptive', 'profiles', 'of', 'simple', 'cells', 'of', 'the', 'primary', 'visual', 'cortex', 'v1', 'these', 'kernels', 'are', 'directly', 'defined', 'by', 'the', 'shape', 'of', 'such', 'profiles', 'this', 'provides', 'a', 'metric', 'model', 'for', 'the', 'functional', 'architecture', 'of', 'v1', 'whose', 'global', 'geometry', 'is', 'determined', 'by', 'the', 'reciprocal', 'interactions', 'between', 'local', 'elements', 'our', 'construction', 'adapts', 'to', 'any', 'bank', 'of', 'filters', 'chosen', 'to', 'represent', 'a', 'set', 'of', 'receptive', 'profiles', 'since', 'it', 'does', 'not', 'require', 'any', 'structure', 'on', 'the', 'parameterization', 'of', 'the', 'family', 'the', 'connectivity', 'kernel', 'that', 'we', 'define', 'carries', 'a', 'geometrical', 'structure', 'consistent', 'with', 'the', 'wellknown', 'properties', 'of', 'longrange', 'horizontal', 'connections', 'in', 'v1', 'and', 'it', 'is', 'compatible', 'with', 'the', 'perceptual', 'rules', 'synthesized', 'by', 'the', 'concept', 'of', 'association', 'field', 'these', 'characteristics', 'are', 'still', 'present', 'when', 'the', 'kernel', 'is', 'constructed', 'from', 'a', 'bank', 'of', 'filters', 'arising', 'from', 'an', 'unsupervised', 'learning', 'algorithm']]
|
[-0.08878354427482311, 0.0651198642276035, -0.08293965955130665, 0.03871444560112044, -0.09422088493981089, -0.11244566661642036, 0.0006128808096642994, 0.4371746701395346, -0.2977050022422595, -0.29495210630638113, 0.04731203135290545, -0.23139981883448651, -0.23985165073018935, 0.148025803667325, -0.08492379067400987, -0.003576120956697398, 0.04228272320728542, 0.061730525488706514, -0.0493731301329616, -0.18385486078396854, 0.3407607138506137, 0.05667433394248494, 0.27866338855043676, -0.007246901305481717, 0.13425341032820548, -0.019384346378501505, -0.05348884273229891, 0.024262617491129075, -0.09560981917078, 0.20135096443320638, 0.2307688288047858, 0.16890633421523185, 0.24894030658818642, -0.4179490853437326, -0.2334754203570305, 0.08653569760240822, 0.08491223973881763, 0.06120702028662587, -0.0072643094067138415, -0.2844861735227621, 0.11437548152429776, -0.12629937120396384, -0.09668471572311116, -0.08867832118752024, -0.005037758618224568, 0.05857946606233276, -0.2740225142471091, 0.03490669109224756, 0.08421944941316421, 0.08174648658314254, -0.05589339141442906, -0.08304133644883728, -0.048363260856907196, 0.14937251731822065, -0.015078849048424874, 0.035162275387038894, 0.13844553684207817, -0.15097213423642744, -0.08264032152106261, 0.3361020380604411, -0.03942722788067638, -0.23588621338159202, 0.18019989163601874, -0.10762563506270656, -0.11056947030010633, 0.11754351451397976, 0.13954993720269865, 0.07103561128800114, -0.1689136729236351, 0.08301507201516263, -0.05122224760513442, 0.17619912125196102, 0.047577548610408686, 0.01773511804478605, 0.18025296688695866, 0.12946269130689972, 0.05118210103117033, 0.13727889608384836, -0.08534716531125418, -0.06934574402920488, -0.28854179934892776, -0.08966115069718701, -0.1915113180261364, 0.018113037366068358, -0.1258519629367988, -0.1935511869782608, 0.43817800914661753, 0.13218791587213571, 0.261910745382718, 0.07103389498661272, 0.24791888651088811, 0.07982566230940494, 0.16297139088985407, 0.07753660870043354, 0.19236987180192955, 0.12530301693024942, 0.08219490200604519, -0.18395714126826432, 0.09764957141467473, 0.09057668288328892]
|
1,803.05784
|
Minimax optimal rates for Mondrian trees and forests
|
Introduced by Breiman, Random Forests are widely used classification and
regression algorithms. While being initially designed as batch algorithms,
several variants have been proposed to handle online learning. One particular
instance of such forests is the \emph{Mondrian Forest}, whose trees are built
using the so-called Mondrian process, therefore allowing to easily update their
construction in a streaming fashion. In this paper, we provide a thorough
theoretical study of Mondrian Forests in a batch learning setting, based on new
results about Mondrian partitions. Our results include consistency and
convergence rates for Mondrian Trees and Forests, that turn out to be minimax
optimal on the set of $s$-H\"older function with $s \in (0,1]$ (for trees and
forests) and $s \in (1,2]$ (for forests only), assuming a proper tuning of
their complexity parameter in both cases. Furthermore, we prove that an
adaptive procedure (to the unknown $s \in (0, 2]$) can be constructed by
combining Mondrian Forests with a standard model aggregation algorithm. These
results are the first demonstrating that some particular random forests achieve
minimax rates \textit{in arbitrary dimension}. Owing to their remarkably simple
distributional properties, which lead to minimax rates, Mondrian trees are a
promising basis for more sophisticated yet theoretically sound random forests
variants.
|
stat.ML math.ST stat.TH
|
introduced by breiman random forests are widely used classification and regression algorithms while being initially designed as batch algorithms several variants have been proposed to handle online learning one particular instance of such forests is the emphmondrian forest whose trees are built using the socalled mondrian process therefore allowing to easily update their construction in a streaming fashion in this paper we provide a thorough theoretical study of mondrian forests in a batch learning setting based on new results about mondrian partitions our results include consistency and convergence rates for mondrian trees and forests that turn out to be minimax optimal on the set of sholder function with s in 01 for trees and forests and s in 12 for forests only assuming a proper tuning of their complexity parameter in both cases furthermore we prove that an adaptive procedure to the unknown s in 0 2 can be constructed by combining mondrian forests with a standard model aggregation algorithm these results are the first demonstrating that some particular random forests achieve minimax rates textitin arbitrary dimension owing to their remarkably simple distributional properties which lead to minimax rates mondrian trees are a promising basis for more sophisticated yet theoretically sound random forests variants
|
[['introduced', 'by', 'breiman', 'random', 'forests', 'are', 'widely', 'used', 'classification', 'and', 'regression', 'algorithms', 'while', 'being', 'initially', 'designed', 'as', 'batch', 'algorithms', 'several', 'variants', 'have', 'been', 'proposed', 'to', 'handle', 'online', 'learning', 'one', 'particular', 'instance', 'of', 'such', 'forests', 'is', 'the', 'emphmondrian', 'forest', 'whose', 'trees', 'are', 'built', 'using', 'the', 'socalled', 'mondrian', 'process', 'therefore', 'allowing', 'to', 'easily', 'update', 'their', 'construction', 'in', 'a', 'streaming', 'fashion', 'in', 'this', 'paper', 'we', 'provide', 'a', 'thorough', 'theoretical', 'study', 'of', 'mondrian', 'forests', 'in', 'a', 'batch', 'learning', 'setting', 'based', 'on', 'new', 'results', 'about', 'mondrian', 'partitions', 'our', 'results', 'include', 'consistency', 'and', 'convergence', 'rates', 'for', 'mondrian', 'trees', 'and', 'forests', 'that', 'turn', 'out', 'to', 'be', 'minimax', 'optimal', 'on', 'the', 'set', 'of', 'sholder', 'function', 'with', 's', 'in', '01', 'for', 'trees', 'and', 'forests', 'and', 's', 'in', '12', 'for', 'forests', 'only', 'assuming', 'a', 'proper', 'tuning', 'of', 'their', 'complexity', 'parameter', 'in', 'both', 'cases', 'furthermore', 'we', 'prove', 'that', 'an', 'adaptive', 'procedure', 'to', 'the', 'unknown', 's', 'in', '0', '2', 'can', 'be', 'constructed', 'by', 'combining', 'mondrian', 'forests', 'with', 'a', 'standard', 'model', 'aggregation', 'algorithm', 'these', 'results', 'are', 'the', 'first', 'demonstrating', 'that', 'some', 'particular', 'random', 'forests', 'achieve', 'minimax', 'rates', 'textitin', 'arbitrary', 'dimension', 'owing', 'to', 'their', 'remarkably', 'simple', 'distributional', 'properties', 'which', 'lead', 'to', 'minimax', 'rates', 'mondrian', 'trees', 'are', 'a', 'promising', 'basis', 'for', 'more', 'sophisticated', 'yet', 'theoretically', 'sound', 'random', 'forests', 'variants']]
|
[-0.012141520117886658, 0.10427114625039609, -0.07200787955518867, 0.07439873327409255, -0.0806142184952173, -0.1680448594379234, 0.11668897728123725, 0.4645496618938563, -0.28045306789712854, -0.2750078689426257, 0.14180933160012305, -0.22526781363160409, -0.16720410421022713, 0.21520072832047535, -0.10663558122715706, 0.11397691657124408, 0.08932075130620173, 0.012376664551760626, -0.007205043723256204, -0.35427027441827313, 0.2571149632997646, 0.07707180505792789, 0.2942305114120245, -0.03551817460334286, 0.0992690513387616, 0.03199779759321747, -0.04574824605863129, 0.0803023566133534, -0.12916402579935382, 0.12260121361724115, 0.28519135001436646, 0.1720104765048333, 0.3037153167347309, -0.36982372178342837, -0.19376657050194132, 0.14727296938275541, 0.15263717915183805, 0.11143442040385008, -0.033189938955706905, -0.23758997805898302, 0.12302449807350345, -0.14766271938134004, -0.03973746374524726, -0.1457148358143242, -0.01853661496751928, 0.038609607517088446, -0.33647905172679227, 0.01442061686484611, 0.11114865081760977, 0.04320399519301959, 0.017884808071783463, -0.17067188857894006, 0.011268374069681016, 0.08565734887525457, -0.00842618057748023, 0.02953162213117618, 0.09183411425199782, -0.0990618458465017, -0.2055292219208012, 0.3143870689587328, -0.058316948177611794, -0.21301017350487392, 0.22364753369113494, -0.07282560729660241, -0.18899634169882595, 0.0772976048010874, 0.22137163164999607, 0.1376016140970507, -0.17565291707995784, 0.05711603127483031, -0.0485512226214403, 0.08024157251385064, 0.09286682828893802, -0.024223377266993376, 0.13355000891718152, 0.173245566160753, 0.07648933117175842, 0.14410103362436713, -0.039086383644702474, -0.05404125123738949, -0.20064984793485752, -0.10011888756155807, -0.1370706059671755, -0.017850234762770055, -0.18460695364527127, -0.2124359408242105, 0.34918208585437294, 0.19230713265181837, 0.24669192871767018, 0.15908323327054183, 0.2599240128659721, 0.07854114265676893, 0.05297777330872185, 0.10647067409111967, 0.18631811562098052, 0.147544142604333, 0.03383202901399084, -0.09812669371618325, 0.12546356434571404, 0.10502626794376617]
|
1,803.05785
|
Aggregated Sparse Attention for Steering Angle Prediction
|
In this paper, we apply the attention mechanism to autonomous driving for
steering angle prediction. We propose the first model, applying the recently
introduced sparse attention mechanism to visual domain, as well as the
aggregated extension for this model. We show the improvement of the proposed
method, comparing to no attention as well as to different types of attention.
|
cs.CV
|
in this paper we apply the attention mechanism to autonomous driving for steering angle prediction we propose the first model applying the recently introduced sparse attention mechanism to visual domain as well as the aggregated extension for this model we show the improvement of the proposed method comparing to no attention as well as to different types of attention
|
[['in', 'this', 'paper', 'we', 'apply', 'the', 'attention', 'mechanism', 'to', 'autonomous', 'driving', 'for', 'steering', 'angle', 'prediction', 'we', 'propose', 'the', 'first', 'model', 'applying', 'the', 'recently', 'introduced', 'sparse', 'attention', 'mechanism', 'to', 'visual', 'domain', 'as', 'well', 'as', 'the', 'aggregated', 'extension', 'for', 'this', 'model', 'we', 'show', 'the', 'improvement', 'of', 'the', 'proposed', 'method', 'comparing', 'to', 'no', 'attention', 'as', 'well', 'as', 'to', 'different', 'types', 'of', 'attention']]
|
[-0.028920352490524114, -0.008464563306484181, -0.036156895669114036, 0.08064561358937142, -0.14404334713925876, -0.1349601800853418, 0.07014225863543797, 0.4545494067971989, -0.27754757894297777, -0.33358944135607554, 0.08289419002317966, -0.2039448613995465, -0.2532283737584633, 0.19640362596581296, -0.12554014461130789, 0.09811228392172162, 0.007565361747549752, 0.044060420418568585, -0.026809157156464408, -0.2032378101247852, 0.30294055743458664, 0.07928771996412869, 0.33643078576710267, 0.04387154957374274, 0.13294374740729897, 0.030636552295063513, -0.03599963592112822, 0.021104864239440125, -0.08274599362827711, 0.15340959573543425, 0.21881470993413762, 0.11065801405111107, 0.3202455167548131, -0.3704103579176432, -0.2841500032503726, 0.12402067308992905, 0.13951594862392394, 0.1589135995916075, -0.09858517458275655, -0.3083212133181297, 0.08272816709408505, -0.262325998936322, -0.06474473775695946, -0.12064569159331968, 0.016719114145863863, -0.019896329933051335, -0.29871142916065657, 0.017210657850412998, 0.10797859918152503, 0.028189171500251454, -0.07469514833163407, -0.08267664858850382, 0.01765829125040416, 0.17264527713848374, 0.11761208531699317, 0.05941999133802572, 0.06995425846080407, -0.11918812219085077, -0.15220735801415422, 0.40487950105788345, -0.07050619779501931, -0.21479283179397204, 0.17405864346961855, -0.05308282324034026, -0.15205709484674163, 0.023751438800561225, 0.2609454817691092, 0.1224473024781604, -0.13224253778235387, -0.013558208417557812, -0.05538012611411386, 0.11879635551723383, 0.05252486958278943, 0.020684395701687595, 0.13841687460130048, 0.2597635246308173, 0.03839179576706078, 0.22182941973461942, -0.11013383254156274, -0.12017423699815143, -0.24982739017360797, -0.1147511917308478, -0.1636582619621087, -0.04022260262804516, -0.0023653482765717024, -0.09910478701388811, 0.44287883717629867, 0.2490571938707667, 0.2644771094418178, 0.0706833929802149, 0.34337407598761305, 0.08049902449346195, 0.09574059551676452, 0.021185125934623055, 0.23735360753864554, 0.07315111943220688, 0.15517481811092063, -0.18141154244036997, 0.0748091278660853, 0.08742471607559818]
|
1,803.05786
|
Logarithmic Riemann-Hilbert correspondences for rigid varieties
|
On any smooth algebraic variety over a $p$-adic local field, we construct a
tensor functor from the category of de Rham $p$-adic \'etale local systems to
the category of filtered algebraic vector bundles with integrable connections
satisfying the Griffiths transversality, which we view as a $p$-adic analogue
of Deligne's classical Riemann--Hilbert correspondence. A crucial step is to
construct canonical extensions of the desired connections to suitable
compactifications of the algebraic variety with logarithmic poles along the
boundary, in a precise sense characterized by the eigenvalues of residues;
hence the title of the paper. As an application, we show that this $p$-adic
Riemann--Hilbert functor is compatible with the classical one over all Shimura
varieties, for local systems attached to representations of the associated
reductive algebraic groups.
|
math.AG math.NT
|
on any smooth algebraic variety over a padic local field we construct a tensor functor from the category of de rham padic etale local systems to the category of filtered algebraic vector bundles with integrable connections satisfying the griffiths transversality which we view as a padic analogue of delignes classical riemannhilbert correspondence a crucial step is to construct canonical extensions of the desired connections to suitable compactifications of the algebraic variety with logarithmic poles along the boundary in a precise sense characterized by the eigenvalues of residues hence the title of the paper as an application we show that this padic riemannhilbert functor is compatible with the classical one over all shimura varieties for local systems attached to representations of the associated reductive algebraic groups
|
[['on', 'any', 'smooth', 'algebraic', 'variety', 'over', 'a', 'padic', 'local', 'field', 'we', 'construct', 'a', 'tensor', 'functor', 'from', 'the', 'category', 'of', 'de', 'rham', 'padic', 'etale', 'local', 'systems', 'to', 'the', 'category', 'of', 'filtered', 'algebraic', 'vector', 'bundles', 'with', 'integrable', 'connections', 'satisfying', 'the', 'griffiths', 'transversality', 'which', 'we', 'view', 'as', 'a', 'padic', 'analogue', 'of', 'delignes', 'classical', 'riemannhilbert', 'correspondence', 'a', 'crucial', 'step', 'is', 'to', 'construct', 'canonical', 'extensions', 'of', 'the', 'desired', 'connections', 'to', 'suitable', 'compactifications', 'of', 'the', 'algebraic', 'variety', 'with', 'logarithmic', 'poles', 'along', 'the', 'boundary', 'in', 'a', 'precise', 'sense', 'characterized', 'by', 'the', 'eigenvalues', 'of', 'residues', 'hence', 'the', 'title', 'of', 'the', 'paper', 'as', 'an', 'application', 'we', 'show', 'that', 'this', 'padic', 'riemannhilbert', 'functor', 'is', 'compatible', 'with', 'the', 'classical', 'one', 'over', 'all', 'shimura', 'varieties', 'for', 'local', 'systems', 'attached', 'to', 'representations', 'of', 'the', 'associated', 'reductive', 'algebraic', 'groups']]
|
[-0.2220077850520611, -0.005265536942868494, -0.1702499783784151, 0.102344587569125, -0.15804120528325438, -0.12097799311205745, -0.027741043772315607, 0.27027814255654814, -0.38585861603543165, -0.17567367216944693, 0.0783353570761974, -0.17458329204563053, -0.18508017380349337, 0.2195339353941381, -0.17866707518696784, 0.007949347868561744, 0.02664986225962639, 0.12958239639364183, -0.11946592881157994, -0.29471761418879033, 0.4863235946893692, -0.03607783067598939, 0.25219095671735703, -0.010985229611513206, 0.13347036968916653, 0.03872871942946222, 0.008668936267495155, -0.07006358505785465, -0.09390839109598892, 0.185892829220742, 0.4055712563523557, 0.0125748942643404, 0.19435613665729762, -0.3963509177342057, -0.14017037853226066, 0.22844915138930083, 0.12564527650922536, 0.03744197512883693, 0.01639648137707263, -0.3181949513033032, 0.12892078219528777, -0.14950366085954012, -0.17990701759327202, -0.08999304487556219, 0.030092862643301486, 0.03613029618561268, -0.2250765928295441, -0.017679121628403665, 0.035721182070672514, 0.19384206355176867, -0.11590018990635872, -0.051596878349781036, -0.05227304012328386, 0.043388762898743154, -0.0034347804747521878, 0.07522175625152885, 0.14453054873645305, -0.11012996187619865, -0.11114097856078296, 0.3379241183549166, -0.08828628576546907, -0.2059191249664873, 0.15988753182440996, -0.09883801883831621, -0.17976232964172958, 0.13749928533285857, 0.03407416963391006, 0.1418441875241697, -0.002817374620586634, 0.19429536693543195, -0.11764498897548765, 0.049396812367253004, 0.12412685234099627, -0.018408753056079148, 0.16701501241512598, 0.04773738625179976, 0.06305578590929509, 0.11085714542120695, 0.03200255734054372, -0.12178414973244071, -0.3935194106698036, -0.2217302766367793, -0.08995869017671794, 0.16533458772301673, -0.13203033132478595, -0.2191782133243978, 0.4221436793208122, 0.08472485810052603, 0.21885341755719856, 0.1695363595308736, 0.21402563440799713, 0.07045036428980529, 0.056555117152631285, -0.01696132381167263, 0.09877142643928528, 0.30257606608606874, 0.016146508367732168, -0.11545618476346135, -0.06022557332366705, 0.22372101020626725]
|
1,803.05787
|
Feature Distillation: DNN-Oriented JPEG Compression Against Adversarial
Examples
|
Image compression-based approaches for defending against the
adversarial-example attacks, which threaten the safety use of deep neural
networks (DNN), have been investigated recently. However, prior works mainly
rely on directly tuning parameters like compression rate, to blindly reduce
image features, thereby lacking guarantee on both defense efficiency (i.e.
accuracy of polluted images) and classification accuracy of benign images,
after applying defense methods. To overcome these limitations, we propose a
JPEG-based defensive compression framework, namely "feature distillation", to
effectively rectify adversarial examples without impacting classification
accuracy on benign data. Our framework significantly escalates the defense
efficiency with marginal accuracy reduction using a two-step method: First, we
maximize malicious features filtering of adversarial input perturbations by
developing defensive quantization in frequency domain of JPEG compression or
decompression, guided by a semi-analytical method; Second, we suppress the
distortions of benign features to restore classification accuracy through a
DNN-oriented quantization refine process. Our experimental results show that
proposed "feature distillation" can significantly surpass the latest
input-transformation based mitigations such as Quilting and TV Minimization in
three aspects, including defense efficiency (improve classification accuracy
from $\sim20\%$ to $\sim90\%$ on adversarial examples), accuracy of benign
images after defense ($\le1\%$ accuracy degradation), and processing time per
image ($\sim259\times$ Speedup). Moreover, our solution can also provide the
best defense efficiency ($\sim60\%$ accuracy) against the recent adaptive
attack with least accuracy reduction ($\sim1\%$) on benign images when compared
with other input-transformation based defense methods.
|
cs.CV cs.CR
|
image compressionbased approaches for defending against the adversarialexample attacks which threaten the safety use of deep neural networks dnn have been investigated recently however prior works mainly rely on directly tuning parameters like compression rate to blindly reduce image features thereby lacking guarantee on both defense efficiency ie accuracy of polluted images and classification accuracy of benign images after applying defense methods to overcome these limitations we propose a jpegbased defensive compression framework namely feature distillation to effectively rectify adversarial examples without impacting classification accuracy on benign data our framework significantly escalates the defense efficiency with marginal accuracy reduction using a twostep method first we maximize malicious features filtering of adversarial input perturbations by developing defensive quantization in frequency domain of jpeg compression or decompression guided by a semianalytical method second we suppress the distortions of benign features to restore classification accuracy through a dnnoriented quantization refine process our experimental results show that proposed feature distillation can significantly surpass the latest inputtransformation based mitigations such as quilting and tv minimization in three aspects including defense efficiency improve classification accuracy from sim20 to sim90 on adversarial examples accuracy of benign images after defense le1 accuracy degradation and processing time per image sim259times speedup moreover our solution can also provide the best defense efficiency sim60 accuracy against the recent adaptive attack with least accuracy reduction sim1 on benign images when compared with other inputtransformation based defense methods
|
[['image', 'compressionbased', 'approaches', 'for', 'defending', 'against', 'the', 'adversarialexample', 'attacks', 'which', 'threaten', 'the', 'safety', 'use', 'of', 'deep', 'neural', 'networks', 'dnn', 'have', 'been', 'investigated', 'recently', 'however', 'prior', 'works', 'mainly', 'rely', 'on', 'directly', 'tuning', 'parameters', 'like', 'compression', 'rate', 'to', 'blindly', 'reduce', 'image', 'features', 'thereby', 'lacking', 'guarantee', 'on', 'both', 'defense', 'efficiency', 'ie', 'accuracy', 'of', 'polluted', 'images', 'and', 'classification', 'accuracy', 'of', 'benign', 'images', 'after', 'applying', 'defense', 'methods', 'to', 'overcome', 'these', 'limitations', 'we', 'propose', 'a', 'jpegbased', 'defensive', 'compression', 'framework', 'namely', 'feature', 'distillation', 'to', 'effectively', 'rectify', 'adversarial', 'examples', 'without', 'impacting', 'classification', 'accuracy', 'on', 'benign', 'data', 'our', 'framework', 'significantly', 'escalates', 'the', 'defense', 'efficiency', 'with', 'marginal', 'accuracy', 'reduction', 'using', 'a', 'twostep', 'method', 'first', 'we', 'maximize', 'malicious', 'features', 'filtering', 'of', 'adversarial', 'input', 'perturbations', 'by', 'developing', 'defensive', 'quantization', 'in', 'frequency', 'domain', 'of', 'jpeg', 'compression', 'or', 'decompression', 'guided', 'by', 'a', 'semianalytical', 'method', 'second', 'we', 'suppress', 'the', 'distortions', 'of', 'benign', 'features', 'to', 'restore', 'classification', 'accuracy', 'through', 'a', 'dnnoriented', 'quantization', 'refine', 'process', 'our', 'experimental', 'results', 'show', 'that', 'proposed', 'feature', 'distillation', 'can', 'significantly', 'surpass', 'the', 'latest', 'inputtransformation', 'based', 'mitigations', 'such', 'as', 'quilting', 'and', 'tv', 'minimization', 'in', 'three', 'aspects', 'including', 'defense', 'efficiency', 'improve', 'classification', 'accuracy', 'from', 'sim20', 'to', 'sim90', 'on', 'adversarial', 'examples', 'accuracy', 'of', 'benign', 'images', 'after', 'defense', 'le1', 'accuracy', 'degradation', 'and', 'processing', 'time', 'per', 'image', 'sim259times', 'speedup', 'moreover', 'our', 'solution', 'can', 'also', 'provide', 'the', 'best', 'defense', 'efficiency', 'sim60', 'accuracy', 'against', 'the', 'recent', 'adaptive', 'attack', 'with', 'least', 'accuracy', 'reduction', 'sim1', 'on', 'benign', 'images', 'when', 'compared', 'with', 'other', 'inputtransformation', 'based', 'defense', 'methods']]
|
[-0.018835946134008144, -0.07010930360942755, -0.04549383149158372, 0.05883020064316635, -0.074518879401781, -0.21482531272441796, 0.11488532022390839, 0.41456122936721407, -0.2171508185322518, -0.38244046816683336, 0.11356550930169128, -0.2934341024445451, -0.16787942234406492, 0.19189295225837472, -0.21127491838263307, 0.1304957397059416, 0.1101472752502836, -0.004528840987452144, -0.071015612585372, -0.37151322187602764, 0.27344646635667785, 0.11220472927860733, 0.3871186913638983, 0.0393696269425361, 0.1011388346092249, -0.0433987972792238, -0.03119926215959308, -0.03218246663581458, -0.03707795041001467, 0.0885761444950375, 0.2852295388155693, 0.2069408584780752, 0.3296493021346143, -0.4183280581122507, -0.3004769361127451, 0.07707723015109481, 0.14001732919284182, 0.13027104684101093, -0.08132281448266915, -0.35210711011946527, 0.13917677702341716, -0.21074430208207798, 0.001586907109974519, -0.19151818834285697, -0.0806597993142255, 0.00011129263312677326, -0.2546607981810508, 0.06130336409968668, 0.09819151326892493, 0.08312571971150844, -0.05514830670562451, -0.1172194256497871, 0.008713498923158192, 0.12193915303353646, 0.036244690307269234, 0.029816400046642547, 0.2089767596633781, -0.18809397263735858, -0.1643283938786582, 0.32767978374765294, -0.07936397063971051, -0.18611284713766982, 0.1918692770667131, 0.03983489230133431, -0.11409520441565014, 0.17296041337945295, 0.23476899563051437, 0.11442577911682589, -0.09492376601081796, -0.046506077816213846, 0.07899136350935568, 0.20753303138923873, 0.12456324515894622, 0.013388384202414233, 0.0924613208550474, 0.2513029420454784, 0.05362001037093527, 0.13979385230998995, -0.17691708062876663, -0.0333053654808875, -0.1870736659180535, -0.07270159484039102, -0.17420044658786576, -0.01612999028445262, -0.0923824007256569, -0.08607866669215423, 0.3928291785909728, 0.26761475963437037, 0.18397982376627625, 0.09425393352512797, 0.44749073120967847, -0.02098606228524738, 0.11593502006372032, 0.10104297832990794, 0.243579820515183, -0.014586635743035004, 0.04480034799679466, -0.19902379894439312, 0.12809615806504354, 0.056600973956570357]
|
1,803.05788
|
DeepN-JPEG: A Deep Neural Network Favorable JPEG-based Image Compression
Framework
|
As one of most fascinating machine learning techniques, deep neural network
(DNN) has demonstrated excellent performance in various intelligent tasks such
as image classification. DNN achieves such performance, to a large extent, by
performing expensive training over huge volumes of training data. To reduce the
data storage and transfer overhead in smart resource-limited Internet-of-Thing
(IoT) systems, effective data compression is a "must-have" feature before
transferring real-time produced dataset for training or classification. While
there have been many well-known image compression approaches (such as JPEG), we
for the first time find that a human-visual based image compression approach
such as JPEG compression is not an optimized solution for DNN systems,
especially with high compression ratios. To this end, we develop an image
compression framework tailored for DNN applications, named "DeepN-JPEG", to
embrace the nature of deep cascaded information process mechanism of DNN
architecture. Extensive experiments, based on "ImageNet" dataset with various
state-of-the-art DNNs, show that "DeepN-JPEG" can achieve ~3.5x higher
compression rate over the popular JPEG solution while maintaining the same
accuracy level for image recognition, demonstrating its great potential of
storage and power efficiency in DNN-based smart IoT system design.
|
cs.CV cs.GR cs.PF
|
as one of most fascinating machine learning techniques deep neural network dnn has demonstrated excellent performance in various intelligent tasks such as image classification dnn achieves such performance to a large extent by performing expensive training over huge volumes of training data to reduce the data storage and transfer overhead in smart resourcelimited internetofthing iot systems effective data compression is a musthave feature before transferring realtime produced dataset for training or classification while there have been many wellknown image compression approaches such as jpeg we for the first time find that a humanvisual based image compression approach such as jpeg compression is not an optimized solution for dnn systems especially with high compression ratios to this end we develop an image compression framework tailored for dnn applications named deepnjpeg to embrace the nature of deep cascaded information process mechanism of dnn architecture extensive experiments based on imagenet dataset with various stateoftheart dnns show that deepnjpeg can achieve 35x higher compression rate over the popular jpeg solution while maintaining the same accuracy level for image recognition demonstrating its great potential of storage and power efficiency in dnnbased smart iot system design
|
[['as', 'one', 'of', 'most', 'fascinating', 'machine', 'learning', 'techniques', 'deep', 'neural', 'network', 'dnn', 'has', 'demonstrated', 'excellent', 'performance', 'in', 'various', 'intelligent', 'tasks', 'such', 'as', 'image', 'classification', 'dnn', 'achieves', 'such', 'performance', 'to', 'a', 'large', 'extent', 'by', 'performing', 'expensive', 'training', 'over', 'huge', 'volumes', 'of', 'training', 'data', 'to', 'reduce', 'the', 'data', 'storage', 'and', 'transfer', 'overhead', 'in', 'smart', 'resourcelimited', 'internetofthing', 'iot', 'systems', 'effective', 'data', 'compression', 'is', 'a', 'musthave', 'feature', 'before', 'transferring', 'realtime', 'produced', 'dataset', 'for', 'training', 'or', 'classification', 'while', 'there', 'have', 'been', 'many', 'wellknown', 'image', 'compression', 'approaches', 'such', 'as', 'jpeg', 'we', 'for', 'the', 'first', 'time', 'find', 'that', 'a', 'humanvisual', 'based', 'image', 'compression', 'approach', 'such', 'as', 'jpeg', 'compression', 'is', 'not', 'an', 'optimized', 'solution', 'for', 'dnn', 'systems', 'especially', 'with', 'high', 'compression', 'ratios', 'to', 'this', 'end', 'we', 'develop', 'an', 'image', 'compression', 'framework', 'tailored', 'for', 'dnn', 'applications', 'named', 'deepnjpeg', 'to', 'embrace', 'the', 'nature', 'of', 'deep', 'cascaded', 'information', 'process', 'mechanism', 'of', 'dnn', 'architecture', 'extensive', 'experiments', 'based', 'on', 'imagenet', 'dataset', 'with', 'various', 'stateoftheart', 'dnns', 'show', 'that', 'deepnjpeg', 'can', 'achieve', '35x', 'higher', 'compression', 'rate', 'over', 'the', 'popular', 'jpeg', 'solution', 'while', 'maintaining', 'the', 'same', 'accuracy', 'level', 'for', 'image', 'recognition', 'demonstrating', 'its', 'great', 'potential', 'of', 'storage', 'and', 'power', 'efficiency', 'in', 'dnnbased', 'smart', 'iot', 'system', 'design']]
|
[-0.08582491909469207, -0.051405309185621036, -0.026715790096830616, 0.035903742539141935, -0.06780440708927771, -0.20386614012832363, 0.010911467074546762, 0.4632656094768355, -0.2794977884059922, -0.3501866915193136, 0.11993218070617126, -0.2518049573565843, -0.17817465978879882, 0.258563640325891, -0.15159189717103078, 0.1769470601991665, 0.16591136031583834, 0.0322994375369832, -0.07436996990544421, -0.3400701710563754, 0.23498993710820032, 0.11702597922594186, 0.4386740926545494, 0.026623398722437342, 0.14382252843064125, -0.05410340819908406, 0.014137204002929471, -0.05753420457877319, 0.005729651796711003, 0.15294236847529968, 0.3578613140690391, 0.24106779935274034, 0.33584521111771864, -0.43556211556317986, -0.27054196928523894, 0.08680061543089969, 0.18050808717949837, 0.10000809346906521, -0.11411175772269827, -0.2937911377458643, 0.14494674812917227, -0.222917275592154, 0.04760463929328922, -0.18691545842535873, -3.765220753848553e-05, -0.00011489838324186783, -0.28754081144197896, 0.016329183408919153, 0.07208602718654669, 0.0846087985011118, -0.035363789123322775, -0.11603918115255393, 0.04268649111061247, 0.14197508705734846, 0.020203577804407957, 0.06609703988473367, 0.1743018114939332, -0.2421909525354583, -0.12551352457563963, 0.3977387970193259, -0.04974681341154401, -0.15145225081873195, 0.19421208648872312, 0.042281755739422416, -0.13873329537830525, 0.12447676714384548, 0.2764402402775182, 0.05515402588512628, -0.1466297563565995, -0.009912138008036881, 0.031098303525278006, 0.20754667157645248, 0.09995927892234777, 0.03867103642113106, 0.14406754540640018, 0.3434151522064161, 0.046064330585381036, 0.16363108126066064, -0.1484636201295421, -0.0479413589152197, -0.1356867928457226, -0.11843246046043131, -0.22642454219311076, -0.01205261311578622, -0.1364840905415833, -0.12628846107080818, 0.3488784046757275, 0.22922838032646206, 0.20522048143339494, 0.07849881652572382, 0.4160748304578886, 0.018264868083880635, 0.17767009985638202, 0.11357418895869326, 0.17874144019198515, -0.027263891664133358, 0.16947028170726564, -0.14161008486201265, 0.047094481187291766, 0.022160295627370315]
|
1,803.05789
|
Scalings in Coalescence of Liquid Droplets
|
This letter presents a scaling theory of the coalescence of two viscous
spherical droplets. An initial value problem was formulated and analytically
solved for the evolution of the radius of a liquid neck formed upon droplet
coalescence. Two asymptotic solutions of the initial value problem reproduce
the well-known scaling relations in the viscous and inertial regimes. The
viscous-to-inertial crossover experimentally observed by Paulsen et al. [Phys.
Rev. Lett. 106, 114501 (2011)] manifests in the theory, and their fitting
relation, which shows collapse of data of different viscosities onto a single
curve, is an approximation to the general solution of the initial value
problem.
|
physics.flu-dyn
|
this letter presents a scaling theory of the coalescence of two viscous spherical droplets an initial value problem was formulated and analytically solved for the evolution of the radius of a liquid neck formed upon droplet coalescence two asymptotic solutions of the initial value problem reproduce the wellknown scaling relations in the viscous and inertial regimes the viscoustoinertial crossover experimentally observed by paulsen et al phys rev lett 106 114501 2011 manifests in the theory and their fitting relation which shows collapse of data of different viscosities onto a single curve is an approximation to the general solution of the initial value problem
|
[['this', 'letter', 'presents', 'a', 'scaling', 'theory', 'of', 'the', 'coalescence', 'of', 'two', 'viscous', 'spherical', 'droplets', 'an', 'initial', 'value', 'problem', 'was', 'formulated', 'and', 'analytically', 'solved', 'for', 'the', 'evolution', 'of', 'the', 'radius', 'of', 'a', 'liquid', 'neck', 'formed', 'upon', 'droplet', 'coalescence', 'two', 'asymptotic', 'solutions', 'of', 'the', 'initial', 'value', 'problem', 'reproduce', 'the', 'wellknown', 'scaling', 'relations', 'in', 'the', 'viscous', 'and', 'inertial', 'regimes', 'the', 'viscoustoinertial', 'crossover', 'experimentally', 'observed', 'by', 'paulsen', 'et', 'al', 'phys', 'rev', 'lett', '106', '114501', '2011', 'manifests', 'in', 'the', 'theory', 'and', 'their', 'fitting', 'relation', 'which', 'shows', 'collapse', 'of', 'data', 'of', 'different', 'viscosities', 'onto', 'a', 'single', 'curve', 'is', 'an', 'approximation', 'to', 'the', 'general', 'solution', 'of', 'the', 'initial', 'value', 'problem']]
|
[-0.13609227911550917, 0.11979591513683736, -0.1374411315145884, -0.006904957602576663, -0.02197834418392649, -0.08276865121853702, 0.029025481801534837, 0.26048762341230813, -0.22542603703800076, -0.3261987892271695, 0.03118713149645676, -0.2607065992391047, -0.12517451230122983, 0.16662046930515298, -0.06593858124288804, 0.09839512686605803, 0.03724576063983727, -0.055348469357590614, -0.08291725725775548, -0.22045304882568398, 0.273069702061441, 0.0457462154639264, 0.3171154567423989, 0.05374268424131122, 0.0927602223488137, -0.004807997577111511, 0.03286400672011808, 0.034045267042101306, -0.25756747419169795, 0.0018821065782058035, 0.18275435755540634, 0.08678377200575436, 0.23620534033569343, -0.4142366268434653, -0.21307840054471264, 0.04637081614540269, 0.12152033939349291, 0.12551364374310509, -0.009932827332294454, -0.2606307035585975, 0.011822754734049678, -0.20532803941865033, -0.1891567106358707, 0.008398921575908568, 0.12407640985888886, -0.015471824763545894, -0.29015568163538097, 0.19973608752822175, 0.05883330664615713, -0.008322040997810807, -0.0945702501682236, -0.05361134308737283, -0.0009982583259104513, 0.02534928441266803, 0.044837419495011355, 0.04578808829069649, 0.1309390678218858, -0.10399456779408615, -0.05647187792312573, 0.3625806966504338, -0.015969917452072397, -0.15953747395399784, 0.19178547974283278, -0.1209005202285434, -0.060019625204743125, 0.12842416518605224, 0.1547829947735676, 0.16486862249553716, -0.14740449737063518, 0.06879629969297835, -0.08513189665402524, 0.14774258347118602, 0.14465914085945664, -0.08564478902353942, 0.2048702147679732, 0.17739299069245473, -0.05430708864849864, 0.13664810611482928, -0.07254316022091171, -0.1577060649647405, -0.29644463245880187, -0.11957181489346755, -0.2112770523150068, 0.05454274061519433, -0.09320902220368975, -0.15027587344943016, 0.3611450960001379, 0.08847710758210252, 0.2524831242603706, 0.0327009965457917, 0.21614946020474912, 0.13518908411246158, -0.03867603271204394, 0.11148808455076434, 0.30357564394088354, 0.16739362015334122, 0.13253672134277283, -0.295693184095024, 0.042510496087226214, 0.1251903545549687]
|
1,803.0579
|
Temporal Human Action Segmentation via Dynamic Clustering
|
We present an effective dynamic clustering algorithm for the task of temporal
human action segmentation, which has comprehensive applications such as
robotics, motion analysis, and patient monitoring. Our proposed algorithm is
unsupervised, fast, generic to process various types of features, and
applicable in both the online and offline settings. We perform extensive
experiments of processing data streams, and show that our algorithm achieves
the state-of-the-art results for both online and offline settings.
|
cs.CV
|
we present an effective dynamic clustering algorithm for the task of temporal human action segmentation which has comprehensive applications such as robotics motion analysis and patient monitoring our proposed algorithm is unsupervised fast generic to process various types of features and applicable in both the online and offline settings we perform extensive experiments of processing data streams and show that our algorithm achieves the stateoftheart results for both online and offline settings
|
[['we', 'present', 'an', 'effective', 'dynamic', 'clustering', 'algorithm', 'for', 'the', 'task', 'of', 'temporal', 'human', 'action', 'segmentation', 'which', 'has', 'comprehensive', 'applications', 'such', 'as', 'robotics', 'motion', 'analysis', 'and', 'patient', 'monitoring', 'our', 'proposed', 'algorithm', 'is', 'unsupervised', 'fast', 'generic', 'to', 'process', 'various', 'types', 'of', 'features', 'and', 'applicable', 'in', 'both', 'the', 'online', 'and', 'offline', 'settings', 'we', 'perform', 'extensive', 'experiments', 'of', 'processing', 'data', 'streams', 'and', 'show', 'that', 'our', 'algorithm', 'achieves', 'the', 'stateoftheart', 'results', 'for', 'both', 'online', 'and', 'offline', 'settings']]
|
[-0.055950894059302904, -0.05033469097765596, -0.09938220008431624, 0.04334238086138006, -0.10140916984528303, -0.139258903477134, 0.007211039499250344, 0.5086035762215033, -0.2261343266452766, -0.36712066759355366, 0.14049986577689802, -0.25081916091342765, -0.2353142268386566, 0.2676468138039733, -0.09720633768786986, 0.12476589222852555, 0.18731247964832518, 0.06000414390614929, -0.00836874699517567, -0.2828596649018841, 0.2135686618372953, 0.0468930868858782, 0.3657512133811704, 0.03270322753168228, 0.1494452443714383, 0.04990632940057872, -0.07221112635064249, 0.01831853912315435, -0.060877621027227886, 0.14202237925362876, 0.3579657044158214, 0.262892321528246, 0.3016786280269217, -0.3875705971537779, -0.2167414327333164, 0.07244714222744936, 0.1601297364322818, 0.10925449007158426, -0.10967518490118285, -0.3532552835531533, 0.08651776699116454, -0.14987218029434896, 0.030192586075928476, -0.21262908381565163, 0.006355706780191718, -0.018183267959910963, -0.3624147617051171, 0.07171028903677426, 0.06644498249645242, 0.08111795379469793, -0.10666747297768274, -0.08450837592115729, 0.10651003261349008, 0.20908686111215502, 0.04427339726074327, 0.014573079837848328, 0.1830930037669734, -0.16256548176493701, -0.2312230191633312, 0.378276524311837, -0.03146790028808431, -0.16345646731658942, 0.2578366792295128, 0.019855166277718835, -0.19300813890165752, 0.08853425037038203, 0.2797941713749121, 0.1754662719193018, -0.14229265299056554, 0.029988178927548386, -0.03436706473843919, 0.16275555478771114, -0.01442677249886199, -0.020411424552245688, 0.07545737279724563, 0.2835717629123893, 0.06366972697287565, 0.14390176354694026, -0.12193562312879497, -0.06811750162160024, -0.21999158079011571, -0.11086383327427837, -0.1541878367554293, -0.09366827731234177, -0.16068130673920678, -0.1386262636515312, 0.3943947990838852, 0.24223019218900138, 0.1716147598150807, 0.0753689410517432, 0.41426642342574066, 0.004320181726749676, 0.027100127248559147, 0.11875532452945158, 0.14701782683712533, -0.06622139862479849, 0.1648657761405856, -0.2345845156653215, 0.058777342802689723, 0.01987368396172921]
|
1,803.05791
|
Advancing numerics for the Casimir effect to experimentally relevant
aspect ratios
|
Within the scattering theoretical approach, the Casimir force is obtained
numerically by an evaluation of the round trip of an electromagnetic wave
between the objects involved. Recently [Hartmann M et al. 2017, Phys. Rev.
Lett. 119 043901] it was shown that a symmetrization of the scattering operator
provides significant advantages for the numerical evaluation of the Casimir
force in the experimentally relevant sphere-plane geometry. Here, we discuss in
more detail how the symmetrization modifies the scattering matrix in the
multipole basis and how computational time is reduced. As an application, we
discuss how the Casimir force in the sphere-plane geometry deviates from the
proximity force approximation as a function of the geometric parameters.
|
quant-ph
|
within the scattering theoretical approach the casimir force is obtained numerically by an evaluation of the round trip of an electromagnetic wave between the objects involved recently hartmann m et al 2017 phys rev lett 119 043901 it was shown that a symmetrization of the scattering operator provides significant advantages for the numerical evaluation of the casimir force in the experimentally relevant sphereplane geometry here we discuss in more detail how the symmetrization modifies the scattering matrix in the multipole basis and how computational time is reduced as an application we discuss how the casimir force in the sphereplane geometry deviates from the proximity force approximation as a function of the geometric parameters
|
[['within', 'the', 'scattering', 'theoretical', 'approach', 'the', 'casimir', 'force', 'is', 'obtained', 'numerically', 'by', 'an', 'evaluation', 'of', 'the', 'round', 'trip', 'of', 'an', 'electromagnetic', 'wave', 'between', 'the', 'objects', 'involved', 'recently', 'hartmann', 'm', 'et', 'al', '2017', 'phys', 'rev', 'lett', '119', '043901', 'it', 'was', 'shown', 'that', 'a', 'symmetrization', 'of', 'the', 'scattering', 'operator', 'provides', 'significant', 'advantages', 'for', 'the', 'numerical', 'evaluation', 'of', 'the', 'casimir', 'force', 'in', 'the', 'experimentally', 'relevant', 'sphereplane', 'geometry', 'here', 'we', 'discuss', 'in', 'more', 'detail', 'how', 'the', 'symmetrization', 'modifies', 'the', 'scattering', 'matrix', 'in', 'the', 'multipole', 'basis', 'and', 'how', 'computational', 'time', 'is', 'reduced', 'as', 'an', 'application', 'we', 'discuss', 'how', 'the', 'casimir', 'force', 'in', 'the', 'sphereplane', 'geometry', 'deviates', 'from', 'the', 'proximity', 'force', 'approximation', 'as', 'a', 'function', 'of', 'the', 'geometric', 'parameters']]
|
[-0.11034363496998724, 0.1029331373360297, -0.10722755349706858, 0.004306163129513152, -0.07299684702385482, -0.03317884992741581, 0.022903298160859516, 0.3438573249732144, -0.22150455371177355, -0.2981238063823964, -0.030329718757587085, -0.2751196660434029, -0.25115631888080053, 0.23622630888920476, -0.06700686021732898, 0.06306002499435895, 0.013818827447331776, -0.0014208080538082868, -0.08800147362801779, -0.23414438979541177, 0.28556045289483983, 0.13407300037215464, 0.2839538472845951, 0.10995310204141008, 0.05708276716177352, 0.0720346489937843, 0.004487079566128419, 0.02475344861990639, -0.17886088031634376, 0.07577406570323676, 0.1793173628227253, 0.05900972802815626, 0.22729502926813439, -0.4623660650769515, -0.17948187589146464, 0.04383065523870755, 0.09539993704363171, 0.12164766008832625, -0.043809705686856305, -0.3094029547106142, -0.02624776498539307, -0.18332935494670113, -0.14552646589332394, -0.10763568928190839, 0.1223159141315721, 0.005762099009838754, -0.23820545013794409, 0.10302757661390517, 0.019401878356542772, 0.03819886420387775, -0.05082145052230252, -0.09233814897015691, 0.014153833168425731, 0.07290106437202278, 0.03508040834068587, 0.041013424263967736, 0.15350437903543934, -0.0834317577620303, -0.12120152734236658, 0.3738259687421045, -0.03157127799100375, -0.20979847785617625, 0.1596162485158337, -0.1113358392030932, -0.04954020102325428, 0.1008609920640343, 0.14453691611665168, 0.11046624789014459, -0.16547088544549687, 0.14673024039231158, -0.06516808611494136, 0.13188730422448966, 0.1382408731005853, -0.04165626238682307, 0.12557588768998226, 0.1579426044315499, 0.02189816818073658, 0.14578117184074862, -0.11366171577537898, -0.09719295772759194, -0.349224510602653, -0.17122645852422075, -0.24329810970396334, 0.041173144196233934, -0.07738217181265229, -0.13820002549696905, 0.3514379970812505, 0.18454776840683604, 0.19721344539928914, -0.015741306558733674, 0.3141605713670807, 0.13581835917804191, 0.037732660421170294, 0.07651250690936909, 0.34555036101457, 0.1704325235457093, 0.10822508986374098, -0.2901377774854024, -0.006140713476010465, 0.07703320139886013]
|
1,803.05792
|
Improper Ferroelectric Polarisation in a Perovskite driven by Inter-site
Charge Transfer and Ordering
|
It is of great interest to design and make materials in which ferroelectric
polarisation is coupled to other order parameters such as lattice, magnetic and
electronic instabilities. Such materials will be invaluable in next-generation
data storage devices. Recently, remarkable progress has been made in
understanding improper ferroelectric coupling mechanisms that arise from
lattice and magnetic instabilities. However, although theoretically predicted,
a compact lattice coupling between electronic and ferroelectric (polar)
instabilities has yet to be realised. Here we report detailed crystallographic
studies of a novel perovskite
Hg$^{\textbf{A}}$Mn$^{\textbf{A'}}_{3}$Mn$^{\textbf{B}}_{4}$O$_{12}$ that is
found to exhibit a polar ground state on account of such couplings that arise
from charge and orbital ordering on both the A' and B-sites, which are
themselves driven by a highly unusual Mn$^{A'}$-Mn$^B$ inter-site charge
transfer. The inherent coupling of polar, charge, orbital and hence magnetic
degrees of freedom, make this a system of great fundamental interest, and
demonstrating ferroelectric switching in this and a host of recently reported
hybrid improper ferroelectrics remains a substantial challenge.
|
cond-mat.str-el cond-mat.mtrl-sci
|
it is of great interest to design and make materials in which ferroelectric polarisation is coupled to other order parameters such as lattice magnetic and electronic instabilities such materials will be invaluable in nextgeneration data storage devices recently remarkable progress has been made in understanding improper ferroelectric coupling mechanisms that arise from lattice and magnetic instabilities however although theoretically predicted a compact lattice coupling between electronic and ferroelectric polar instabilities has yet to be realised here we report detailed crystallographic studies of a novel perovskite hgtextbfamntextbfa_3mntextbfb_4o_12 that is found to exhibit a polar ground state on account of such couplings that arise from charge and orbital ordering on both the a and bsites which are themselves driven by a highly unusual mnamnb intersite charge transfer the inherent coupling of polar charge orbital and hence magnetic degrees of freedom make this a system of great fundamental interest and demonstrating ferroelectric switching in this and a host of recently reported hybrid improper ferroelectrics remains a substantial challenge
|
[['it', 'is', 'of', 'great', 'interest', 'to', 'design', 'and', 'make', 'materials', 'in', 'which', 'ferroelectric', 'polarisation', 'is', 'coupled', 'to', 'other', 'order', 'parameters', 'such', 'as', 'lattice', 'magnetic', 'and', 'electronic', 'instabilities', 'such', 'materials', 'will', 'be', 'invaluable', 'in', 'nextgeneration', 'data', 'storage', 'devices', 'recently', 'remarkable', 'progress', 'has', 'been', 'made', 'in', 'understanding', 'improper', 'ferroelectric', 'coupling', 'mechanisms', 'that', 'arise', 'from', 'lattice', 'and', 'magnetic', 'instabilities', 'however', 'although', 'theoretically', 'predicted', 'a', 'compact', 'lattice', 'coupling', 'between', 'electronic', 'and', 'ferroelectric', 'polar', 'instabilities', 'has', 'yet', 'to', 'be', 'realised', 'here', 'we', 'report', 'detailed', 'crystallographic', 'studies', 'of', 'a', 'novel', 'perovskite', 'hgtextbfamntextbfa_3mntextbfb_4o_12', 'that', 'is', 'found', 'to', 'exhibit', 'a', 'polar', 'ground', 'state', 'on', 'account', 'of', 'such', 'couplings', 'that', 'arise', 'from', 'charge', 'and', 'orbital', 'ordering', 'on', 'both', 'the', 'a', 'and', 'bsites', 'which', 'are', 'themselves', 'driven', 'by', 'a', 'highly', 'unusual', 'mnamnb', 'intersite', 'charge', 'transfer', 'the', 'inherent', 'coupling', 'of', 'polar', 'charge', 'orbital', 'and', 'hence', 'magnetic', 'degrees', 'of', 'freedom', 'make', 'this', 'a', 'system', 'of', 'great', 'fundamental', 'interest', 'and', 'demonstrating', 'ferroelectric', 'switching', 'in', 'this', 'and', 'a', 'host', 'of', 'recently', 'reported', 'hybrid', 'improper', 'ferroelectrics', 'remains', 'a', 'substantial', 'challenge']]
|
[-0.19750687799507902, 0.18263488603995803, -0.030631639566158223, -0.002218848325567823, -0.11939758935406164, -0.13137517385527583, 0.073162547554078, 0.43854682429185127, -0.2813599210895278, -0.29118508807857707, 0.07247535298018505, -0.2552013582195744, -0.18963821006058915, 0.18513053365657392, -0.001411683691745521, 0.027531009853069038, 0.004425395290121619, -0.0605172443737853, -0.07423625957467908, -0.16746741012767233, 0.22162907174931257, 0.027614490686133048, 0.30711263950994133, 0.10866041047115771, 0.08321419331899335, -0.049406030445296796, 0.08382490202156039, 0.04201867082727605, -0.11199594487251673, 0.11823126286885306, 0.26673416243694675, -0.026328611406183408, 0.21896015326749602, -0.4661387623876242, -0.25395591711294063, 0.05253600030908921, 0.12580562508350776, 0.15915159382457428, -0.13636923809478665, -0.24046800133595073, 0.04668099374511776, -0.17356196543533195, -0.11389381821155534, -0.16364637096526752, 0.02838459928045792, 0.032385913905847614, -0.2485275996471841, 0.045691941537682905, 0.07791949516202272, 0.09007248120736673, -0.07666676863001308, -0.14493766756359763, -0.07530416875214893, 0.08175394486098841, 0.08645013814786323, 0.09390077929646691, 0.09512176343376971, -0.11766816808505018, -0.14976921969556187, 0.41045199405470506, 0.02484328123566586, -0.138073431712181, 0.19490423763279396, -0.17085643043095944, -0.12281748614748197, 0.15107664772155094, 0.17525261698256425, 0.08309363699489576, -0.1621378682885159, 0.07884081455620372, 0.04087089277529643, 0.18146857813834869, 0.01427351575533351, 0.16095451672098662, 0.3147897026930119, 0.21231601194284308, 0.007629954088993507, 0.12795810317056414, -0.07104861950844618, -0.09262001933244292, -0.18686464211783527, -0.153880386196214, -0.20345246998673203, 0.0855868628442836, -0.03467388994671459, -0.1876036415585071, 0.3822569002231663, 0.1552422070222981, 0.14040031651480614, -0.14725217311443087, 0.246507395941627, 0.039264354966952256, 0.11657794529537847, 0.008644146335516925, 0.31312681573008877, 0.1476618972952632, 0.0973690831001728, -0.26247208375209496, 0.10805950184678373, -0.04126510157198445]
|
1,803.05793
|
Hierarchical Species Sampling Models
|
This paper introduces a general class of hierarchical nonparametric prior
distributions. The random probability measures are constructed by a hierarchy
of generalized species sampling processes with possibly non-diffuse base
measures. The proposed framework provides a general probabilistic foundation
for hierarchical random measures with either atomic or mixed base measures and
allows for studying their properties, such as the distribution of the marginal
and total number of clusters. We show that hierarchical species sampling models
have a Chinese Restaurants Franchise representation and can be used as prior
distributions to undertake Bayesian nonparametric inference. We provide a
method to sample from the posterior distribution together with some numerical
illustrations. Our class of priors includes some new hierarchical mixture
priors such as the hierarchical Gnedin measures, and other well-known prior
distributions such as the hierarchical Pitman-Yor and the hierarchical
normalized random measures.
|
stat.ME math.ST stat.TH
|
this paper introduces a general class of hierarchical nonparametric prior distributions the random probability measures are constructed by a hierarchy of generalized species sampling processes with possibly nondiffuse base measures the proposed framework provides a general probabilistic foundation for hierarchical random measures with either atomic or mixed base measures and allows for studying their properties such as the distribution of the marginal and total number of clusters we show that hierarchical species sampling models have a chinese restaurants franchise representation and can be used as prior distributions to undertake bayesian nonparametric inference we provide a method to sample from the posterior distribution together with some numerical illustrations our class of priors includes some new hierarchical mixture priors such as the hierarchical gnedin measures and other wellknown prior distributions such as the hierarchical pitmanyor and the hierarchical normalized random measures
|
[['this', 'paper', 'introduces', 'a', 'general', 'class', 'of', 'hierarchical', 'nonparametric', 'prior', 'distributions', 'the', 'random', 'probability', 'measures', 'are', 'constructed', 'by', 'a', 'hierarchy', 'of', 'generalized', 'species', 'sampling', 'processes', 'with', 'possibly', 'nondiffuse', 'base', 'measures', 'the', 'proposed', 'framework', 'provides', 'a', 'general', 'probabilistic', 'foundation', 'for', 'hierarchical', 'random', 'measures', 'with', 'either', 'atomic', 'or', 'mixed', 'base', 'measures', 'and', 'allows', 'for', 'studying', 'their', 'properties', 'such', 'as', 'the', 'distribution', 'of', 'the', 'marginal', 'and', 'total', 'number', 'of', 'clusters', 'we', 'show', 'that', 'hierarchical', 'species', 'sampling', 'models', 'have', 'a', 'chinese', 'restaurants', 'franchise', 'representation', 'and', 'can', 'be', 'used', 'as', 'prior', 'distributions', 'to', 'undertake', 'bayesian', 'nonparametric', 'inference', 'we', 'provide', 'a', 'method', 'to', 'sample', 'from', 'the', 'posterior', 'distribution', 'together', 'with', 'some', 'numerical', 'illustrations', 'our', 'class', 'of', 'priors', 'includes', 'some', 'new', 'hierarchical', 'mixture', 'priors', 'such', 'as', 'the', 'hierarchical', 'gnedin', 'measures', 'and', 'other', 'wellknown', 'prior', 'distributions', 'such', 'as', 'the', 'hierarchical', 'pitmanyor', 'and', 'the', 'hierarchical', 'normalized', 'random', 'measures']]
|
[-0.00857011587761021, 0.07526635434545523, -0.13776896235352154, 0.13446511144887174, -0.09623573165514218, -0.10111281067709164, 0.08088294318927412, 0.40020785671022296, -0.2877098805180637, -0.32264512101282106, 0.07949862418622583, -0.23134314061970393, -0.14393905484747382, 0.12313095043855551, -0.08293699593745547, 0.10149199389618077, 0.061628472334671794, -0.010146496835685663, -0.06046382212348068, -0.20406986711372574, 0.36048164458529985, 0.07587781751766239, 0.32715176352092046, -0.0740499353310991, 0.12496589972108281, 0.03113712151970366, -0.10918852978674091, -0.008338354735655322, -0.13961917649907027, 0.15877726921525268, 0.2358849475058116, 0.22062283413980505, 0.31651013222918345, -0.345916455494072, -0.28505868736734924, 0.15287399768373736, 0.1184857925818898, 0.06814724982803246, -0.03211116323267652, -0.30898460875794614, 0.038091375395360824, -0.23341043235687203, -0.08430340769313353, -0.14002033751106172, -0.053381594561254804, 0.10149454873510831, -0.34181098244487973, 0.0976464381565427, 0.10112740817687495, 0.034143742071732666, -0.025083308537380115, -0.21532290478290575, 0.007283841556259733, 0.10239934106022387, 0.014529537329142042, -0.030678789096167513, 0.11021822159305858, -0.08221583179761019, -0.15407729736803996, 0.33521637908122737, -0.07114508889092923, -0.2705926832696088, 0.21840043717713878, -0.09679160765606723, -0.21827649054445808, 0.04927141701454203, 0.20301889024822295, 0.11553505195720161, -0.1906601236329126, 0.032380167349231624, -0.07131120065485107, 0.10681154857650935, 0.030854235060693923, 0.0036357544143114694, 0.200118683056199, 0.1880270285639081, 0.07349783839597601, 0.14805011559075093, -0.13375129691063822, -0.13814246627709847, -0.2417866453107969, -0.13494724149835838, -0.17996002123322632, -0.011981894274488453, -0.16827839324298974, -0.24386228235746674, 0.36093100353660024, 0.12312943282915721, 0.22832361174238136, 0.13684091547071908, 0.23231692814683583, 0.093174001913042, 0.025712793718072044, 0.04788246453679401, 0.0668507626007157, 0.13540353828190202, 0.017231981203851134, -0.059864944569421465, 0.1490864684393214, 0.026762895296133463]
|
1,803.05794
|
Aspects of the pseudo Chiral Magnetic Effect in 2D Weyl-Dirac Matter
|
A connection is established between the continuum limit of the low-energy
tight-binding description of graphene immersed in an in-plane magnetic field
and the Chiral Magnetic Effect in Quantum Chromodynamics. A combination of mass
gaps that explicitly breaks the equivalence of the Dirac cones, favoring an
imbalance of pseudo-chiralities, is the essential ingredient to generate a
non-dissipative electric current along the external field. Currents, number
densities and condensates generated from this setup are investigated for
different hierarchies of the energy scales involved.
|
hep-ph cond-mat.mes-hall
|
a connection is established between the continuum limit of the lowenergy tightbinding description of graphene immersed in an inplane magnetic field and the chiral magnetic effect in quantum chromodynamics a combination of mass gaps that explicitly breaks the equivalence of the dirac cones favoring an imbalance of pseudochiralities is the essential ingredient to generate a nondissipative electric current along the external field currents number densities and condensates generated from this setup are investigated for different hierarchies of the energy scales involved
|
[['a', 'connection', 'is', 'established', 'between', 'the', 'continuum', 'limit', 'of', 'the', 'lowenergy', 'tightbinding', 'description', 'of', 'graphene', 'immersed', 'in', 'an', 'inplane', 'magnetic', 'field', 'and', 'the', 'chiral', 'magnetic', 'effect', 'in', 'quantum', 'chromodynamics', 'a', 'combination', 'of', 'mass', 'gaps', 'that', 'explicitly', 'breaks', 'the', 'equivalence', 'of', 'the', 'dirac', 'cones', 'favoring', 'an', 'imbalance', 'of', 'pseudochiralities', 'is', 'the', 'essential', 'ingredient', 'to', 'generate', 'a', 'nondissipative', 'electric', 'current', 'along', 'the', 'external', 'field', 'currents', 'number', 'densities', 'and', 'condensates', 'generated', 'from', 'this', 'setup', 'are', 'investigated', 'for', 'different', 'hierarchies', 'of', 'the', 'energy', 'scales', 'involved']]
|
[-0.2261311554997519, 0.22924744944066333, -0.033408882044022904, 0.0882131329344702, -0.022611657343804836, -0.06663004837464541, 0.0007648409518878907, 0.3534099093172699, -0.2489196060516406, -0.3187800620915368, -0.02413234467676375, -0.23950403574854134, -0.07102986456593499, 0.1515551447868347, 0.05296882026013918, -0.0017055328557034955, -0.028916042845230548, -0.014922921801917255, -0.0746089566469891, -0.15519142395351082, 0.352072690485511, 0.01665674128307728, 0.33437774013727906, 0.10493941234890372, 0.09016414015786722, 0.0036109248394495808, 0.056373976194299756, 0.0513560687599238, -0.08719064629740388, 0.10200739984138636, 0.19164245517458767, -0.07056130096316338, 0.18607429580879398, -0.4773902542423457, -0.18717103473754831, 0.05184000210138038, 0.1222250411985442, 0.1487247304583434, -0.0789140212466009, -0.2671489871223457, 0.026089669641805813, -0.14778150429483503, -0.19082259448477998, -0.08776911283493974, 0.017370225722697797, -0.009247245878941612, -0.27993015350657513, 0.0925473620853154, 0.06684743536752649, 0.08537422752706333, -0.07783358252490871, -0.09470935383578763, -0.06995051868725569, 0.11384310587891378, 0.092740033283917, 0.0543551036156714, 0.14331820260267705, -0.1943421163414314, -0.11447035905512166, 0.3727743990486488, -0.050471917592221874, -0.17876609897939488, 0.15997708159848117, -0.12331297964701662, -0.0731730796280317, 0.13176399166695774, 0.11667374318931252, 0.08119264139677398, -0.160916679300135, 0.12849337834486504, -0.050152408261783424, 0.12000412673369283, 0.04819000684074126, 0.054229233972728254, 0.3060437025793362, 0.16227012002927949, 0.05826226399512961, 0.11336163027444854, -0.09157530359807424, -0.10147949013917242, -0.33644764629425483, -0.14644272682489828, -0.20555915272561834, 0.0982964865048416, -0.06843557700012752, -0.19524701915797776, 0.42132892670924776, 0.16732137548096943, 0.18359783725609305, -0.030723272764589638, 0.2914847057312727, 0.13457876756729092, 0.06514962646760977, 0.04065282163210213, 0.2585796074432437, 0.2313896101040882, 0.0817578898742795, -0.2821769905713154, -0.045308144949376586, 0.06849009964207653]
|
1,803.05795
|
RUSSE'2018: A Shared Task on Word Sense Induction for the Russian
Language
|
The paper describes the results of the first shared task on word sense
induction (WSI) for the Russian language. While similar shared tasks were
conducted in the past for some Romance and Germanic languages, we explore the
performance of sense induction and disambiguation methods for a Slavic language
that shares many features with other Slavic languages, such as rich morphology
and virtually free word order. The participants were asked to group contexts of
a given word in accordance with its senses that were not provided beforehand.
For instance, given a word "bank" and a set of contexts for this word, e.g.
"bank is a financial institution that accepts deposits" and "river bank is a
slope beside a body of water", a participant was asked to cluster such contexts
in the unknown in advance number of clusters corresponding to, in this case,
the "company" and the "area" senses of the word "bank". For the purpose of this
evaluation campaign, we developed three new evaluation datasets based on sense
inventories that have different sense granularity. The contexts in these
datasets were sampled from texts of Wikipedia, the academic corpus of Russian,
and an explanatory dictionary of Russian. Overall, 18 teams participated in the
competition submitting 383 models. Multiple teams managed to substantially
outperform competitive state-of-the-art baselines from the previous years based
on sense embeddings.
|
cs.CL
|
the paper describes the results of the first shared task on word sense induction wsi for the russian language while similar shared tasks were conducted in the past for some romance and germanic languages we explore the performance of sense induction and disambiguation methods for a slavic language that shares many features with other slavic languages such as rich morphology and virtually free word order the participants were asked to group contexts of a given word in accordance with its senses that were not provided beforehand for instance given a word bank and a set of contexts for this word eg bank is a financial institution that accepts deposits and river bank is a slope beside a body of water a participant was asked to cluster such contexts in the unknown in advance number of clusters corresponding to in this case the company and the area senses of the word bank for the purpose of this evaluation campaign we developed three new evaluation datasets based on sense inventories that have different sense granularity the contexts in these datasets were sampled from texts of wikipedia the academic corpus of russian and an explanatory dictionary of russian overall 18 teams participated in the competition submitting 383 models multiple teams managed to substantially outperform competitive stateoftheart baselines from the previous years based on sense embeddings
|
[['the', 'paper', 'describes', 'the', 'results', 'of', 'the', 'first', 'shared', 'task', 'on', 'word', 'sense', 'induction', 'wsi', 'for', 'the', 'russian', 'language', 'while', 'similar', 'shared', 'tasks', 'were', 'conducted', 'in', 'the', 'past', 'for', 'some', 'romance', 'and', 'germanic', 'languages', 'we', 'explore', 'the', 'performance', 'of', 'sense', 'induction', 'and', 'disambiguation', 'methods', 'for', 'a', 'slavic', 'language', 'that', 'shares', 'many', 'features', 'with', 'other', 'slavic', 'languages', 'such', 'as', 'rich', 'morphology', 'and', 'virtually', 'free', 'word', 'order', 'the', 'participants', 'were', 'asked', 'to', 'group', 'contexts', 'of', 'a', 'given', 'word', 'in', 'accordance', 'with', 'its', 'senses', 'that', 'were', 'not', 'provided', 'beforehand', 'for', 'instance', 'given', 'a', 'word', 'bank', 'and', 'a', 'set', 'of', 'contexts', 'for', 'this', 'word', 'eg', 'bank', 'is', 'a', 'financial', 'institution', 'that', 'accepts', 'deposits', 'and', 'river', 'bank', 'is', 'a', 'slope', 'beside', 'a', 'body', 'of', 'water', 'a', 'participant', 'was', 'asked', 'to', 'cluster', 'such', 'contexts', 'in', 'the', 'unknown', 'in', 'advance', 'number', 'of', 'clusters', 'corresponding', 'to', 'in', 'this', 'case', 'the', 'company', 'and', 'the', 'area', 'senses', 'of', 'the', 'word', 'bank', 'for', 'the', 'purpose', 'of', 'this', 'evaluation', 'campaign', 'we', 'developed', 'three', 'new', 'evaluation', 'datasets', 'based', 'on', 'sense', 'inventories', 'that', 'have', 'different', 'sense', 'granularity', 'the', 'contexts', 'in', 'these', 'datasets', 'were', 'sampled', 'from', 'texts', 'of', 'wikipedia', 'the', 'academic', 'corpus', 'of', 'russian', 'and', 'an', 'explanatory', 'dictionary', 'of', 'russian', 'overall', '18', 'teams', 'participated', 'in', 'the', 'competition', 'submitting', '383', 'models', 'multiple', 'teams', 'managed', 'to', 'substantially', 'outperform', 'competitive', 'stateoftheart', 'baselines', 'from', 'the', 'previous', 'years', 'based', 'on', 'sense', 'embeddings']]
|
[-0.0526556422816472, 0.01817629599388162, -0.05717856442080685, 0.09057491082385569, -0.1400782491871248, -0.10276658326462917, 0.08611049673673152, 0.41666282897999696, -0.25160795252199647, -0.34094063430051275, 0.07241048045961924, -0.33652232502176016, -0.10779631945833161, 0.2332608592360876, -0.13895429270436382, 0.023509260098951205, 0.13871949349177648, 0.0906120630055624, 0.004856713212132957, -0.31691173912521015, 0.312154098874302, 0.03496990751407973, 0.3258148288188569, -0.03057939776949383, 0.13185397815483682, -0.046153133019263784, -0.08135331930542314, -0.003424659658743589, -0.07033379548840195, 0.15380458943183986, 0.37403415986788074, 0.18197449110658118, 0.33505637049129616, -0.3672929703853689, -0.15692870059210035, 0.05776514920619996, 0.0756545213602671, 0.06383093877767343, -0.005625728206805515, -0.35355409191027787, 0.07851113059960708, -0.21063117061737455, 0.01963933560837832, -0.037237807154458284, 0.06654836452431842, 0.038974164281122235, -0.21131146894159583, 0.019671679132508935, 0.08197976382730345, 0.12485888033165587, -0.06739565035745686, -0.1611295445499153, 0.03165693927099005, 0.2349974230164662, 0.08710241182665299, 0.03658646233442768, 0.13263241031316217, -0.14344969330914528, -0.17559305541762696, 0.3945417551508358, -0.06759214901647463, -0.17988702313301178, 0.21897331976147183, -0.10633656225976879, -0.17865936604101915, 0.04646519404680779, 0.18866924910915192, 0.05470969456013057, -0.1759632406108656, 0.040478987709738665, -0.10298692112209627, 0.2415285289312738, 0.16349358264742805, -0.02900398393771989, 0.16416313478393849, 0.19201167448851708, -0.00234117357690634, 0.11188523590209189, -0.06465420069169439, -0.059991857777391605, -0.21421941061245134, -0.14628202091013123, -0.1555377031416372, -0.046749460470990115, -0.06154791341087967, -0.13975118602802222, 0.4024527847414484, 0.163391077228159, 0.11258845272482382, 0.07524124862257021, 0.22221547183538745, -0.016553951155639207, 0.0831573893681068, 0.10020790633620685, 0.1365617816804474, -0.027363569108635053, 0.16295668036366043, -0.12149000616937138, 0.13345461096698502, 0.05868904198717057]
|
1,803.05796
|
Deep Architectures for Learning Context-dependent Ranking Functions
|
Object ranking is an important problem in the realm of preference learning.
On the basis of training data in the form of a set of rankings of objects,
which are typically represented as feature vectors, the goal is to learn a
ranking function that predicts a linear order of any new set of objects.
Current approaches commonly focus on ranking by scoring, i.e., on learning an
underlying latent utility function that seeks to capture the inherent utility
of each object. These approaches, however, are not able to take possible
effects of context-dependence into account, where context-dependence means that
the utility or usefulness of an object may also depend on what other objects
are available as alternatives. In this paper, we formalize the problem of
context-dependent ranking and present two general approaches based on two
natural representations of context-dependent ranking functions. Both approaches
are instantiated by means of appropriate neural network architectures, which
are evaluated on suitable benchmark task.
|
stat.ML cs.IR cs.LG cs.NE
|
object ranking is an important problem in the realm of preference learning on the basis of training data in the form of a set of rankings of objects which are typically represented as feature vectors the goal is to learn a ranking function that predicts a linear order of any new set of objects current approaches commonly focus on ranking by scoring ie on learning an underlying latent utility function that seeks to capture the inherent utility of each object these approaches however are not able to take possible effects of contextdependence into account where contextdependence means that the utility or usefulness of an object may also depend on what other objects are available as alternatives in this paper we formalize the problem of contextdependent ranking and present two general approaches based on two natural representations of contextdependent ranking functions both approaches are instantiated by means of appropriate neural network architectures which are evaluated on suitable benchmark task
|
[['object', 'ranking', 'is', 'an', 'important', 'problem', 'in', 'the', 'realm', 'of', 'preference', 'learning', 'on', 'the', 'basis', 'of', 'training', 'data', 'in', 'the', 'form', 'of', 'a', 'set', 'of', 'rankings', 'of', 'objects', 'which', 'are', 'typically', 'represented', 'as', 'feature', 'vectors', 'the', 'goal', 'is', 'to', 'learn', 'a', 'ranking', 'function', 'that', 'predicts', 'a', 'linear', 'order', 'of', 'any', 'new', 'set', 'of', 'objects', 'current', 'approaches', 'commonly', 'focus', 'on', 'ranking', 'by', 'scoring', 'ie', 'on', 'learning', 'an', 'underlying', 'latent', 'utility', 'function', 'that', 'seeks', 'to', 'capture', 'the', 'inherent', 'utility', 'of', 'each', 'object', 'these', 'approaches', 'however', 'are', 'not', 'able', 'to', 'take', 'possible', 'effects', 'of', 'contextdependence', 'into', 'account', 'where', 'contextdependence', 'means', 'that', 'the', 'utility', 'or', 'usefulness', 'of', 'an', 'object', 'may', 'also', 'depend', 'on', 'what', 'other', 'objects', 'are', 'available', 'as', 'alternatives', 'in', 'this', 'paper', 'we', 'formalize', 'the', 'problem', 'of', 'contextdependent', 'ranking', 'and', 'present', 'two', 'general', 'approaches', 'based', 'on', 'two', 'natural', 'representations', 'of', 'contextdependent', 'ranking', 'functions', 'both', 'approaches', 'are', 'instantiated', 'by', 'means', 'of', 'appropriate', 'neural', 'network', 'architectures', 'which', 'are', 'evaluated', 'on', 'suitable', 'benchmark', 'task']]
|
[-0.04575523317944777, 0.007163977138001819, -0.06047846862745672, 0.09861799459049737, -0.1539702279510896, -0.13938454657098973, 0.03707297134163047, 0.4339093111479018, -0.2704285075180704, -0.3126839560315107, 0.059550910985504, -0.26149730334099663, -0.17899863282365935, 0.1880410843502282, -0.11010916231279674, 0.06852982304636625, 0.07142005259203547, 0.09034640568933344, -0.052996192939794635, -0.28955204746850965, 0.41151048029666837, 0.012790454551577568, 0.2956094676098209, 0.00020343270683307436, 0.12577338270397997, -0.006888217938167951, -0.038715071223169285, 0.06150421260154653, -0.0500909448983984, 0.1912230685975143, 0.31567005731188985, 0.2456664136475353, 0.36065106211330367, -0.40684328431004213, -0.18852497502289053, 0.10162348874779772, 0.11313435051787668, 0.06009002059810099, 0.00043658924412831097, -0.30401647355867245, 0.06691797886447556, -0.16662680284603487, 0.02680961210929046, -0.1344724007369361, 0.012204314287327513, 0.03078554589463445, -0.2867274909910946, 0.008988835897312877, 0.07983001683952133, 0.033819288458922715, -0.08264417579409349, -0.14001545211509506, 0.012308011603647773, 0.16996858418842517, 0.047361936982385104, 0.025354563372056414, 0.1467379907815116, -0.1805473721418176, -0.18650812746756534, 0.42855805554132487, -0.010802895420885208, -0.254763579467618, 0.19541705706115528, -0.03092307600051259, -0.14470532349726373, 0.07157846242543074, 0.23140867054462433, 0.14273752549315413, -0.17461211520506517, 0.014968141874731696, -0.07100858640727363, 0.16902273832864564, 0.029836187656391178, 0.03200724585566823, 0.2281659484687674, 0.21500374158679308, 0.03742044572821594, 0.12023632334806084, -0.059299575038183526, -0.08534465120151886, -0.27452341973475075, -0.11016857436021106, -0.22288392857896, -0.018470025780412538, -0.0946596055158047, -0.1744334254237194, 0.4024006819832905, 0.21685354757974443, 0.22183368747900653, 0.07498383330611536, 0.29738099344923524, 0.0819648100872586, 0.0883612090874982, 0.0362413526108176, 0.18125522364803318, 0.0007360995529054464, 0.030047938652053664, -0.13904179403959196, 0.16042481714128692, 0.05702289522778761]
|
1,803.05797
|
Rigid models of Presburger arithmetic
|
We present a description of rigid models of Presburger arithmetic (i.e.,
Z-groups). In particular, we show that Presburger arithmetic has rigid models
of all infinite cardinalities up to the continuum, but no larger.
|
math.LO cs.LO
|
we present a description of rigid models of presburger arithmetic ie zgroups in particular we show that presburger arithmetic has rigid models of all infinite cardinalities up to the continuum but no larger
|
[['we', 'present', 'a', 'description', 'of', 'rigid', 'models', 'of', 'presburger', 'arithmetic', 'ie', 'zgroups', 'in', 'particular', 'we', 'show', 'that', 'presburger', 'arithmetic', 'has', 'rigid', 'models', 'of', 'all', 'infinite', 'cardinalities', 'up', 'to', 'the', 'continuum', 'but', 'no', 'larger']]
|
[-0.14889125455374597, 0.1362981601851061, -0.07161792693659663, 0.1188046000606846, -0.038690362867782824, -0.11918535745644476, 0.049115807421912905, 0.40072329924441874, -0.2546883599861758, -0.2565448342356831, 0.06811771967841196, -0.2309435699135065, -0.11407655227230862, 0.19821961340494454, -0.13542275086729205, 0.08274724247166887, 0.038294485362712294, 0.08833928214153275, -0.07770891108521027, -0.2558804847067222, 0.27612555243831594, -0.0965505559797748, 0.152725904394174, 0.03716785038704984, 0.12984189915005118, -0.0040211962623288855, 0.010784353245981038, 0.06355349134537391, -0.1673341071084451, 0.17213568932493217, 0.25356970529833234, 0.09566525334957987, 0.23243468790315092, -0.4838794672396034, -0.18064991431310773, 0.21092230745125562, 0.1196676124818623, 0.1461557880975306, 0.044589185738004744, -0.15377136663300917, 0.13585270680778194, -0.19956716446904466, -0.11670003444305621, -0.0966071557631949, 0.1029266226105392, 0.02861142944311723, -0.16082537097099703, 0.006209946004673839, 0.20036492495273706, 0.16560392844257876, -0.06759598878124962, -0.13288281342829578, 0.015291387622710317, 0.07078040242777206, -0.0025386956695001572, -0.0017221727612195536, 0.038549496384803206, -0.12570986803621054, -0.12465073907515034, 0.4219831459922716, -0.07048383812070824, -0.20042063971050084, 0.20104227657429874, -0.16897678376699332, -0.20761933023459278, 0.13227778871078044, 0.1600512811273802, 0.11072658974444494, -0.03538414783542976, 0.17951061540225055, -0.17351434647571295, 0.2658544977894053, 0.13750083549530245, 0.01771463840486831, 0.17075244523584843, 0.11230171721399529, 0.0011422255192883313, 0.17692353518214077, 0.016555277397856116, -0.10499529143271502, -0.35431107587646693, -0.09854488362907432, -0.06145066863609827, 0.0721111885686696, -0.10055301882675849, -0.2826183492434211, 0.3260873007820919, 0.15549386228667572, 0.1627859171712771, 0.2172921127639711, 0.28925030364189297, 0.1089338830934139, 0.09782619992620312, 0.07070116094837431, 0.1555955515941605, 0.10398124915082008, -0.11148517584661022, -0.10324929116904968, 0.02182071162678767, 0.11584785903687589]
|
1,803.05798
|
Counterterms in Truncated Conformal Perturbation Theory
|
We investigate the perturbative renormalisation of deformed conformal field
theories from the Hamiltonian perspective. We discuss the relation with
conformal perturbation theory, to which we provide an explicit match up to
third order in the coupling, and show how second-order anomalous dimensions in
the Wilson-Fisher fixed points are straightforwardly computed in the
Hamiltonian framework. The second part of the paper focuses on the cutoff
employed in the truncated conformal space approach of Yurov and Zamolodchikov.
We discuss the appearance of non-covariant and non-local counterterms to second
order in the cutoff, which we concretise in the $\phi^4$ theories, and find a
smooth cutoff to deal with subleading oscillations.
|
hep-th
|
we investigate the perturbative renormalisation of deformed conformal field theories from the hamiltonian perspective we discuss the relation with conformal perturbation theory to which we provide an explicit match up to third order in the coupling and show how secondorder anomalous dimensions in the wilsonfisher fixed points are straightforwardly computed in the hamiltonian framework the second part of the paper focuses on the cutoff employed in the truncated conformal space approach of yurov and zamolodchikov we discuss the appearance of noncovariant and nonlocal counterterms to second order in the cutoff which we concretise in the phi4 theories and find a smooth cutoff to deal with subleading oscillations
|
[['we', 'investigate', 'the', 'perturbative', 'renormalisation', 'of', 'deformed', 'conformal', 'field', 'theories', 'from', 'the', 'hamiltonian', 'perspective', 'we', 'discuss', 'the', 'relation', 'with', 'conformal', 'perturbation', 'theory', 'to', 'which', 'we', 'provide', 'an', 'explicit', 'match', 'up', 'to', 'third', 'order', 'in', 'the', 'coupling', 'and', 'show', 'how', 'secondorder', 'anomalous', 'dimensions', 'in', 'the', 'wilsonfisher', 'fixed', 'points', 'are', 'straightforwardly', 'computed', 'in', 'the', 'hamiltonian', 'framework', 'the', 'second', 'part', 'of', 'the', 'paper', 'focuses', 'on', 'the', 'cutoff', 'employed', 'in', 'the', 'truncated', 'conformal', 'space', 'approach', 'of', 'yurov', 'and', 'zamolodchikov', 'we', 'discuss', 'the', 'appearance', 'of', 'noncovariant', 'and', 'nonlocal', 'counterterms', 'to', 'second', 'order', 'in', 'the', 'cutoff', 'which', 'we', 'concretise', 'in', 'the', 'phi4', 'theories', 'and', 'find', 'a', 'smooth', 'cutoff', 'to', 'deal', 'with', 'subleading', 'oscillations']]
|
[-0.1281554569195921, 0.10709199935479534, -0.1092539962745583, 0.08806160511009677, -0.08126517002172065, -0.10542167335274225, -0.014695859650360807, 0.3206395792054399, -0.21718392010672755, -0.2693620794606483, 0.05101589858971255, -0.2820169867130594, -0.1856705026332078, 0.08767504431746619, -0.04843424449516636, 0.061370123770825985, -0.05405821804097801, 0.0726802351245907, -0.13671764403687053, -0.22936089483599337, 0.38001469654944847, 0.026468989129599958, 0.2178850718027086, 0.07175570537604145, 0.07787446701846454, -0.0013835727333811657, -0.029964700494980755, 0.005014600702023292, -0.15883429760878295, 0.12638631108972542, 0.2150389257871177, -0.004751841367287166, 0.19595105842388463, -0.4369814105964494, -0.20487886813100217, 0.04578775101130442, 0.14063477899685925, 0.15166510564477165, 0.012071910042992249, -0.2785030094959404, 0.028497611067064527, -0.1761032306009306, -0.1995746124676376, -0.14095576269261623, -0.04389668935097157, -0.06762179620739706, -0.2613510802818708, 0.08679730500498752, 0.03565848652132839, 0.039622653038504554, -0.04745079244471612, -0.029981393923045066, -9.661595741251729e-05, 0.09628582436960402, 0.11414483406598556, 0.045266284348161996, 0.07350840224919594, -0.14395317195405094, -0.1197251218748894, 0.3888394726761002, -0.11877307874649733, -0.20140794086718122, 0.12286393234576538, -0.18837529794260297, -0.17787544545717537, 0.05738753143627689, 0.145418899775184, 0.1440900408153264, -0.131526918352564, 0.18783335942766224, 0.02831434474309098, 0.13947833366560275, 0.08244062418487134, 0.005004030871995777, 0.17450366350207128, 0.07525296915401616, 0.03299137285717253, 0.16481950369505388, -0.030359604362978267, -0.1506464844437773, -0.43473174760364136, -0.10357718871256232, -0.14450657611958823, 0.03991541790529945, -0.14651807049621018, -0.17811582939488427, 0.4142115560825914, 0.20959038148595147, 0.1948264099169909, 0.08189185589490423, 0.22062952993964813, 0.18968335587425894, 0.10305050832113989, 0.07050763246743887, 0.26888513200661557, 0.1323300678577309, 0.07762271941327578, -0.27471366948678755, -0.12269679993448146, 0.1800513371939437]
|
1,803.05799
|
Hypergraph Saturation Irregularities
|
Let $\mathcal{F}$ be a family of $r$-graphs. An $r$-graph $G$ is called
$\mathcal{F}$-saturated if it does not contain any members of $\mathcal{F}$ but
adding any edge creates a copy of some $r$-graph in $\mathcal{F}$. The
saturation number $\operatorname{sat}(\mathcal{F},n)$ is the minimum number of
edges in an $\mathcal{F}$-saturated graph on $n$ vertices. We prove that there
exists a finite family $\mathcal{F}$ such that
$\operatorname{sat}(\mathcal{F},n) / n^{r-1}$ does not tend to a limit. This
settles a question of Pikhurko.
|
math.CO
|
let mathcalf be a family of rgraphs an rgraph g is called mathcalfsaturated if it does not contain any members of mathcalf but adding any edge creates a copy of some rgraph in mathcalf the saturation number operatornamesatmathcalfn is the minimum number of edges in an mathcalfsaturated graph on n vertices we prove that there exists a finite family mathcalf such that operatornamesatmathcalfn nr1 does not tend to a limit this settles a question of pikhurko
|
[['let', 'mathcalf', 'be', 'a', 'family', 'of', 'rgraphs', 'an', 'rgraph', 'g', 'is', 'called', 'mathcalfsaturated', 'if', 'it', 'does', 'not', 'contain', 'any', 'members', 'of', 'mathcalf', 'but', 'adding', 'any', 'edge', 'creates', 'a', 'copy', 'of', 'some', 'rgraph', 'in', 'mathcalf', 'the', 'saturation', 'number', 'operatornamesatmathcalfn', 'is', 'the', 'minimum', 'number', 'of', 'edges', 'in', 'an', 'mathcalfsaturated', 'graph', 'on', 'n', 'vertices', 'we', 'prove', 'that', 'there', 'exists', 'a', 'finite', 'family', 'mathcalf', 'such', 'that', 'operatornamesatmathcalfn', 'nr1', 'does', 'not', 'tend', 'to', 'a', 'limit', 'this', 'settles', 'a', 'question', 'of', 'pikhurko']]
|
[-0.24477200008412772, 0.19329173430348937, -0.066701683889118, -0.02500669445962066, -0.12415363720139942, -0.1696549199357931, 0.05478979921522173, 0.33192133687977754, -0.22748385637847557, -0.2679792960753312, 0.04709592426661402, -0.3709232974797487, -0.10425562950518183, 0.09072159638477338, -0.19518454487095713, -0.048957118311443844, 0.12629842415854736, 0.17271465402901978, 0.05577286549944531, -0.2572913268864992, 0.30208607433313456, -0.11890009238787398, 0.15948138644012647, 0.08199152817974824, 0.08759589058605048, 0.019989863157624733, 0.09473497744624478, 0.0960208541128432, -0.20069556748215267, 0.03640055937088422, 0.26706626720575466, 0.2186751855518417, 0.3437966946260752, -0.34218153390227946, -0.1739489110815968, 0.3386121953560694, 0.1648623854601504, 0.028323724387666664, -0.014852856384980417, -0.1344444828990507, 0.17408855232989062, -0.15491749712492567, -0.14702941031774153, -0.004327796487691435, 0.10310284230807745, -0.02356870727286347, -0.30323493086758097, -0.08337014573122803, 0.1873546433005784, 0.03488442041231571, 0.08297337130706355, -0.14467919218303585, -0.12058100826736237, 0.047341590700041805, -0.09130161812503797, 0.13410765180565618, 0.030256268467653443, -0.10184143203927355, -0.08436940187537992, 0.3364716286793024, -0.04905065437275413, -0.20465111437354339, 0.08480469051849197, -0.1662195000822681, -0.200991496544432, 0.12463059039736116, 0.06242583674454206, 0.16967454829530135, -0.05029019974864315, 0.19229869912000927, -0.21278722733385055, 0.20474843872157303, 0.11532659171702894, 0.04386908321867924, 0.139008065232554, 0.08334208182625573, 0.19563299904552264, 0.13671591861418927, 0.024224723956698703, 0.0867986298241728, -0.34771662683704413, -0.10874976562587796, -0.24164696196424523, 0.17317811241790312, -0.10667205218703964, -0.282436474050219, 0.35623050148825386, 0.0894736480880277, 0.23560640202029734, 0.0784506920121006, 0.15683408648348288, 0.07148638283959716, 0.09923264736032768, 0.23026204218685226, 0.07334199187391426, 0.1211865854046836, -0.11714770694458354, -0.14682552754576947, 0.09003652975504361, 0.13274875019261664]
|
1,803.058
|
A geometric approach to large class groups: a survey
|
The purpose of this note is twofold. First, we survey results on the
construction of large class groups of number fields by specialization of finite
covers of curves. Then we give examples of applications of these techniques.
|
math.NT
|
the purpose of this note is twofold first we survey results on the construction of large class groups of number fields by specialization of finite covers of curves then we give examples of applications of these techniques
|
[['the', 'purpose', 'of', 'this', 'note', 'is', 'twofold', 'first', 'we', 'survey', 'results', 'on', 'the', 'construction', 'of', 'large', 'class', 'groups', 'of', 'number', 'fields', 'by', 'specialization', 'of', 'finite', 'covers', 'of', 'curves', 'then', 'we', 'give', 'examples', 'of', 'applications', 'of', 'these', 'techniques']]
|
[-0.16121733963892265, 0.07834594461412446, -0.07149514767366487, 0.02221413779802419, -0.07881843673719748, -0.00701948388706188, 0.03269510959098871, 0.3449938735748465, -0.25396218452904673, -0.30391318152180397, 0.11757675713758815, -0.23298787834072435, -0.20150591435565338, 0.3083328496715104, -0.13859424110804056, -0.025290523064196914, 0.051490466110408306, 0.007900915196719201, -0.06442535014168636, -0.3797296418531521, 0.44615042431128993, -0.033269797275597986, 0.2409010060081208, 0.06987685230686455, 0.09342710334002166, 0.010134464192732767, -0.09998176906358551, 0.028454778413917567, -0.20914370194077492, 0.19660613708500121, 0.28161016519407966, 0.15072661428083037, 0.25427085377678676, -0.34862289028997356, -0.12476543511336392, 0.14823893004575292, 0.09373380899479664, 0.17260606576864784, -0.07026827674220644, -0.20128300574582977, 0.1334900112973677, -0.16247553954756744, -0.1813027948971737, -0.0874528895459465, -0.0009348539358659371, 0.10839199939289608, -0.169073388634904, -0.015611183754092938, 0.11904010626273481, 0.15462257244901076, -0.055904019422627786, -0.1388469730327661, 0.07094539272775119, 0.11593520635034184, 0.06643638306146336, -0.05301512439256987, 0.02781960874091129, -0.13165567900255523, -0.11917793701679723, 0.36207752770467383, -0.054675109457929395, -0.11627293599618448, 0.17560446393248197, -0.13522099548120153, -0.22235058640708794, 0.12467439002294496, 0.21543273368749666, 0.1928252493207519, -0.09110980964190252, 0.11912495859370038, -0.08418499786608122, 0.1062416301889194, 0.012033315526472556, 0.0014497497798623266, 0.13232945311009078, 0.1415255065327762, 0.0921456859874967, 0.22557813429739326, -0.07164682600823408, -0.03455244586173747, -0.4287530113313649, -0.18503758649269395, -0.1820365654657016, 0.05703631561954279, -0.04107324241635364, -0.14800112264709095, 0.47202109454854113, 0.1408313757588936, 0.1597078361334531, 0.11700694713540175, 0.2432759161535147, 0.042391294512797044, 0.054226963654965966, -0.02835300679293436, 0.1267729998547332, 0.17772457452264387, 0.0360471273873102, -0.11330668174825306, -0.06175421683017064, 0.10681133445452999]
|
1,803.05801
|
Incorporating Kinetic Effects on Nernst Advection in Inertial Fusion
Simulations
|
We present a simple method to incorporate nonlocal effects on the Nernst
advection of magnetic fields down steep temperature gradients, and demonstrate
its effectiveness in a number of inertial fusion scenarios. This is based on
assuming that the relationship between the Nernst velocity and the heat flow
velocity is unaffected by nonlocality. The validity of this assumption is
confirmed over a wide range of plasma conditions by comparing
Vlasov-Fokker-Planck and flux-limited classical transport simulations.
Additionally, we observe that the Righi-Leduc heat flow is more severely
affected by nonlocality due to its dependence on high velocity moments of the
electron distribution function, but are unable to suggest a reliable method of
accounting for this in fluid simulations.
|
physics.plasm-ph
|
we present a simple method to incorporate nonlocal effects on the nernst advection of magnetic fields down steep temperature gradients and demonstrate its effectiveness in a number of inertial fusion scenarios this is based on assuming that the relationship between the nernst velocity and the heat flow velocity is unaffected by nonlocality the validity of this assumption is confirmed over a wide range of plasma conditions by comparing vlasovfokkerplanck and fluxlimited classical transport simulations additionally we observe that the righileduc heat flow is more severely affected by nonlocality due to its dependence on high velocity moments of the electron distribution function but are unable to suggest a reliable method of accounting for this in fluid simulations
|
[['we', 'present', 'a', 'simple', 'method', 'to', 'incorporate', 'nonlocal', 'effects', 'on', 'the', 'nernst', 'advection', 'of', 'magnetic', 'fields', 'down', 'steep', 'temperature', 'gradients', 'and', 'demonstrate', 'its', 'effectiveness', 'in', 'a', 'number', 'of', 'inertial', 'fusion', 'scenarios', 'this', 'is', 'based', 'on', 'assuming', 'that', 'the', 'relationship', 'between', 'the', 'nernst', 'velocity', 'and', 'the', 'heat', 'flow', 'velocity', 'is', 'unaffected', 'by', 'nonlocality', 'the', 'validity', 'of', 'this', 'assumption', 'is', 'confirmed', 'over', 'a', 'wide', 'range', 'of', 'plasma', 'conditions', 'by', 'comparing', 'vlasovfokkerplanck', 'and', 'fluxlimited', 'classical', 'transport', 'simulations', 'additionally', 'we', 'observe', 'that', 'the', 'righileduc', 'heat', 'flow', 'is', 'more', 'severely', 'affected', 'by', 'nonlocality', 'due', 'to', 'its', 'dependence', 'on', 'high', 'velocity', 'moments', 'of', 'the', 'electron', 'distribution', 'function', 'but', 'are', 'unable', 'to', 'suggest', 'a', 'reliable', 'method', 'of', 'accounting', 'for', 'this', 'in', 'fluid', 'simulations']]
|
[-0.11388725973665714, 0.11935891086388187, -0.08672589967669599, 0.048624347334382416, -0.06945861962519521, -0.07785539214242378, 0.0328308615235387, 0.36517585675103653, -0.26437691931516444, -0.30291206628116296, 0.05386126523231285, -0.24568872139307446, -0.09534007432501249, 0.2512762481467156, -0.029550632654592908, 0.03519727263483219, 0.02573591944408314, -0.031147392273976886, -0.055530647763275896, -0.20299539496070415, 0.31998034194111824, 0.06434955978605511, 0.3095368027028724, 0.12518988539272086, 0.12166130541952262, -0.021114535264446045, -0.045191589269209013, 0.09140830638754213, -0.12117508514121914, 0.04334729710385075, 0.15199002016592641, 0.013328074146431453, 0.2653356759070322, -0.4071307149876294, -0.2904780859785989, 0.06240241524586775, 0.11717503539944903, 0.11333236532237638, -0.07388759493300438, -0.24940737922563508, 0.08371510154091961, -0.16209432926301942, -0.11901978525666296, -0.09815604973520184, 0.02665661561607929, 0.034668670764498026, -0.2815994505031869, 0.22045022414611845, 0.04762835910339069, 0.07250385906483078, -0.06535575653281833, -0.06253537610534514, -0.02447019140476939, 0.06484771209793037, 0.06104168756102244, -0.015966668039568345, 0.17661035567891367, -0.15695157321721942, -0.03619187726671326, 0.3774407365487824, -0.08080031849736959, -0.20662304303048837, 0.208073543282306, -0.18780040335921763, -0.050257063398523066, 0.1328806069053324, 0.1746724259533823, 0.12273948043103106, -0.1533681447296564, 0.041051096997950384, -0.035008795063637584, 0.15993781531117215, 0.024267748797087575, -0.010359133087933577, 0.22055894059353862, 0.1576645713076718, 0.04907991134979088, 0.12605685455692484, -0.15005560424218983, -0.07112545988137095, -0.2899458577438932, -0.12371378837570805, -0.19655249914724443, 0.05218707447357733, -0.0964396458219763, -0.14082408193017132, 0.37018853885123904, 0.2313082957743659, 0.17326297119745568, 0.02792073701957947, 0.3202533890364756, 0.12948129724125088, 0.04848000363864262, 0.12824014353300928, 0.26000902102457296, 0.20254386961460114, 0.1404436614719653, -0.31571299921528534, 0.10129825363903114, 0.016968758889184945]
|
1,803.05802
|
A geometric model for the module category of a gentle algebra
|
In this article, gentle algebras are realised as tiling algebras, which are
associated to partial triangulations of unpunctured surfaces with marked points
on the boundary. This notion of tiling algebras generalise the notion of
Jacobian algebras of triangulations of surfaces and the notion of surface
algebras. We use this description to give a geometric model of the module
category of any gentle algebra.
|
math.RT math.CO
|
in this article gentle algebras are realised as tiling algebras which are associated to partial triangulations of unpunctured surfaces with marked points on the boundary this notion of tiling algebras generalise the notion of jacobian algebras of triangulations of surfaces and the notion of surface algebras we use this description to give a geometric model of the module category of any gentle algebra
|
[['in', 'this', 'article', 'gentle', 'algebras', 'are', 'realised', 'as', 'tiling', 'algebras', 'which', 'are', 'associated', 'to', 'partial', 'triangulations', 'of', 'unpunctured', 'surfaces', 'with', 'marked', 'points', 'on', 'the', 'boundary', 'this', 'notion', 'of', 'tiling', 'algebras', 'generalise', 'the', 'notion', 'of', 'jacobian', 'algebras', 'of', 'triangulations', 'of', 'surfaces', 'and', 'the', 'notion', 'of', 'surface', 'algebras', 'we', 'use', 'this', 'description', 'to', 'give', 'a', 'geometric', 'model', 'of', 'the', 'module', 'category', 'of', 'any', 'gentle', 'algebra']]
|
[-0.16833789690974213, 0.06744710508260936, -0.10063575378560002, 0.0705183132732701, -0.11702199389655439, -0.1257012836442935, -0.04634991596408543, 0.3392535500701458, -0.4214562405388625, -0.2141498862839644, 0.1166564680262661, -0.23313848429640371, -0.19535225585457824, 0.13474431261050676, -0.29117161341543707, -0.07374064281346306, 0.10079238718996446, 0.06559080917329069, -0.144529472548692, -0.30280966302823453, 0.48777902675496915, 0.016591895841032503, 0.1819140999651854, 0.0515963155351254, 0.11464874376912439, 0.015547162527957606, -0.018116926212632466, 0.043198949686946375, -0.25039803800505717, 0.15848638982667276, 0.28410161869038664, 0.0290025604134869, 0.15372372976142085, -0.391726038167401, -0.10532693913029063, 0.17022047097247744, 0.10226037603847328, 0.07743584214421433, -0.013598975601665203, -0.22873385665967824, 0.051385268110722776, -0.187702778460724, -0.15531472957855652, -0.0313431556587891, 0.02642495521447725, -0.0235983133611698, -0.1827035093724373, -0.017759974920264786, 0.14517842732842953, 0.22366828025348248, -0.11089720047773823, -0.04355152626152313, -0.15248667032990074, 0.03776699011140163, -0.10980054220399035, 0.03069190453324053, 0.11371296771343738, -0.0817819606579308, -0.23249373944210155, 0.3293980979730213, 0.08184254422251667, -0.23757660619559742, 0.18093438014861138, -0.18186498641790377, -0.16046435864908354, 0.13257608746015836, 0.08819183724976722, 0.14611313663541325, -0.0634052644350699, 0.16278450394932564, -0.13279031787533313, -0.04748401128583484, 0.11701746246387576, 0.002795666382308044, 0.17939859383281262, 0.13019287828651685, 0.08094381032482026, 0.18580603375587434, 0.07680193257115278, -0.055815292418830924, -0.3961774655987346, -0.20926004303767096, -0.06787949353678241, 0.11017925658869365, -0.11833928536373331, -0.3101269633838138, 0.39561312033846563, 0.12989790011788643, 0.22157545658271938, 0.14034215876618253, 0.17308991288559306, 0.028994100565637743, 0.15508481303584717, -0.01648135342827392, 0.07487783817544816, 0.2876286439538475, -0.017538953624251816, -0.08135710727600824, -0.036777872252204115, 0.30421878760384896]
|
1,803.05803
|
Contributions of dark matter annihilation to the global 21cm spectrum
observed by the EDGES experiment
|
The EDGES experiment has observed an absorption feature in the global 21 cm
spectrum with a surprisingly large amplitude. These results can be explained by
decreasing the kinetic temperature of baryons, which could be achieved through
the scattering between the baryons and cold dark matter particles. It seems
that the most researched dark matter annihilation model is not able to explain
such a large amplitude, since the interactions between the particles produced
by the dark matter annihilation and the particles that have been present in the
Universe could increase the baryonic temperature. Recently, C. Feng and G.
Holder have suggested that the large amplitude in the global 21 cm spectrum
could be produced by considering the possible excess of the early radio
radiation. In this paper, we propose that the dark matter annihilation still
works to explain the large amplitude observed by the EDGES experiment. Even
including the dark matter annihilation, the large absorption amplitude in the
global 21 cm spectrum can be produced by considering the possible excess of the
early radio radiation.
|
astro-ph.CO
|
the edges experiment has observed an absorption feature in the global 21 cm spectrum with a surprisingly large amplitude these results can be explained by decreasing the kinetic temperature of baryons which could be achieved through the scattering between the baryons and cold dark matter particles it seems that the most researched dark matter annihilation model is not able to explain such a large amplitude since the interactions between the particles produced by the dark matter annihilation and the particles that have been present in the universe could increase the baryonic temperature recently c feng and g holder have suggested that the large amplitude in the global 21 cm spectrum could be produced by considering the possible excess of the early radio radiation in this paper we propose that the dark matter annihilation still works to explain the large amplitude observed by the edges experiment even including the dark matter annihilation the large absorption amplitude in the global 21 cm spectrum can be produced by considering the possible excess of the early radio radiation
|
[['the', 'edges', 'experiment', 'has', 'observed', 'an', 'absorption', 'feature', 'in', 'the', 'global', '21', 'cm', 'spectrum', 'with', 'a', 'surprisingly', 'large', 'amplitude', 'these', 'results', 'can', 'be', 'explained', 'by', 'decreasing', 'the', 'kinetic', 'temperature', 'of', 'baryons', 'which', 'could', 'be', 'achieved', 'through', 'the', 'scattering', 'between', 'the', 'baryons', 'and', 'cold', 'dark', 'matter', 'particles', 'it', 'seems', 'that', 'the', 'most', 'researched', 'dark', 'matter', 'annihilation', 'model', 'is', 'not', 'able', 'to', 'explain', 'such', 'a', 'large', 'amplitude', 'since', 'the', 'interactions', 'between', 'the', 'particles', 'produced', 'by', 'the', 'dark', 'matter', 'annihilation', 'and', 'the', 'particles', 'that', 'have', 'been', 'present', 'in', 'the', 'universe', 'could', 'increase', 'the', 'baryonic', 'temperature', 'recently', 'c', 'feng', 'and', 'g', 'holder', 'have', 'suggested', 'that', 'the', 'large', 'amplitude', 'in', 'the', 'global', '21', 'cm', 'spectrum', 'could', 'be', 'produced', 'by', 'considering', 'the', 'possible', 'excess', 'of', 'the', 'early', 'radio', 'radiation', 'in', 'this', 'paper', 'we', 'propose', 'that', 'the', 'dark', 'matter', 'annihilation', 'still', 'works', 'to', 'explain', 'the', 'large', 'amplitude', 'observed', 'by', 'the', 'edges', 'experiment', 'even', 'including', 'the', 'dark', 'matter', 'annihilation', 'the', 'large', 'absorption', 'amplitude', 'in', 'the', 'global', '21', 'cm', 'spectrum', 'can', 'be', 'produced', 'by', 'considering', 'the', 'possible', 'excess', 'of', 'the', 'early', 'radio', 'radiation']]
|
[-0.1068738328731865, 0.20787188274882554, -0.10487669495090939, 0.1076296030961234, -0.06301010855548513, -0.06413027484387417, -0.028585775226124443, 0.32983432189914685, -0.2236637362879808, -0.38585453271737385, 0.043450022934555965, -0.27094255682166624, -0.05711914764064225, 0.13661715137670566, 0.03496234630898241, -0.002047262814875435, 0.008502752156178841, -0.0009082196087672792, 0.01522132428429871, -0.2438162339686673, 0.28483215216600777, 0.10431215764109003, 0.2236119456289486, 0.09287799968940859, 0.03817584373634951, -0.04983608544296595, -0.0795891032789716, 0.009966414089946226, -0.08961981561402228, 0.05020268569364555, 0.2178285002558567, 0.09294168823853606, 0.13655446929155968, -0.4270184350296341, -0.26904648504401935, 0.23438723505228415, 0.1849758100117846, 0.10577051592228034, -0.08978017251309671, -0.30615963589871065, 0.06477002112259125, -0.19396177857000937, -0.12985294604481296, -0.012770251437871792, 0.04810475123425325, -0.01156431729851783, -0.22045581067387743, 0.11625643627150734, 0.005583979785857165, -0.04819504770011395, -0.039505657202018235, -0.10213671468101956, -0.04674858402128963, 0.010608948729718211, 0.07697588464729595, 0.03040443479227994, 0.18700600269079293, -0.17733807361754322, -0.09005624881742158, 0.39935023800052444, -0.15578484327007813, -0.06264642601961205, 0.18253869448263926, -0.1912706221999793, -0.11425467093218246, 0.20346807361575078, 0.13145269352097022, 0.029233107790243865, -0.15134434844099584, 0.10072140099819289, -0.04939381597461928, 0.18774757095500186, 0.09825168173203523, 0.03116618250443161, 0.3272171597767236, 0.1498699914998557, -0.0040834367237771035, 0.0657603744679698, -0.13176348720959538, 0.004276836097599061, -0.29520168671941105, -0.10200506511636763, -0.18355634007817026, 0.024308250756113356, -0.0693728581105858, -0.06376280635595322, 0.3579981757178046, 0.10809092137202535, 0.2360965965433453, -0.021126966283190995, 0.2987232840855488, 0.125804855204562, 0.09339585781415882, 0.09412628768450827, 0.36847327200524593, 0.12837976083592995, 0.1453432333575369, -0.24792378694193715, 0.026579168146133595, -0.03999954674944239]
|
1,803.05804
|
Stability analysis by dynamic dissipation inequalities: On merging
frequency-domain techniques with time-domain conditions
|
In this paper we provide a complete link between dissipation theory and a
celebrated result on stability analysis with integral quadratic constraints.
This is achieved with a new stability characterization for feedback
interconnections based on the notion of finite-horizon integral quadratic
constraints with a terminal cost. As the main benefit, this opens up
opportunities for guaranteeing constraints on the transient responses of
trajectories in feedback loops within absolute stability theory. For parametric
robustness, we show how to generate tight robustly invariant ellipsoids on the
basis of a classical frequency-domain stability test, with illustrations by a
numerical example.
|
math.OC
|
in this paper we provide a complete link between dissipation theory and a celebrated result on stability analysis with integral quadratic constraints this is achieved with a new stability characterization for feedback interconnections based on the notion of finitehorizon integral quadratic constraints with a terminal cost as the main benefit this opens up opportunities for guaranteeing constraints on the transient responses of trajectories in feedback loops within absolute stability theory for parametric robustness we show how to generate tight robustly invariant ellipsoids on the basis of a classical frequencydomain stability test with illustrations by a numerical example
|
[['in', 'this', 'paper', 'we', 'provide', 'a', 'complete', 'link', 'between', 'dissipation', 'theory', 'and', 'a', 'celebrated', 'result', 'on', 'stability', 'analysis', 'with', 'integral', 'quadratic', 'constraints', 'this', 'is', 'achieved', 'with', 'a', 'new', 'stability', 'characterization', 'for', 'feedback', 'interconnections', 'based', 'on', 'the', 'notion', 'of', 'finitehorizon', 'integral', 'quadratic', 'constraints', 'with', 'a', 'terminal', 'cost', 'as', 'the', 'main', 'benefit', 'this', 'opens', 'up', 'opportunities', 'for', 'guaranteeing', 'constraints', 'on', 'the', 'transient', 'responses', 'of', 'trajectories', 'in', 'feedback', 'loops', 'within', 'absolute', 'stability', 'theory', 'for', 'parametric', 'robustness', 'we', 'show', 'how', 'to', 'generate', 'tight', 'robustly', 'invariant', 'ellipsoids', 'on', 'the', 'basis', 'of', 'a', 'classical', 'frequencydomain', 'stability', 'test', 'with', 'illustrations', 'by', 'a', 'numerical', 'example']]
|
[-0.16035442640908906, 0.025142207943363904, -0.10450362622469049, 0.047455710433327504, -0.09549612462155752, -0.11282223166379425, 0.10909961968943592, 0.3204464796815336, -0.2752005091853939, -0.3155305706295809, 0.1266180997097519, -0.21833939631421542, -0.20003798470193923, 0.2575205309249307, -0.09049591187090066, 0.082633454160592, 0.08206007376639653, 0.020520407968433574, -0.0991531144377545, -0.24279895541498187, 0.30264402407139884, 0.06419508598898489, 0.23913008158968896, 0.052421259981839316, 0.13103861662261573, 0.02372540698684368, -0.01548273965101881, 0.03955904242928265, -0.18707997006479382, 0.16586210389535144, 0.21711056469219556, 0.11506568280423117, 0.32283654345257073, -0.39981446820359257, -0.20617044451118438, 0.062161784283048714, 0.07072815588992282, 0.06635878835660741, -0.10752956202906586, -0.2511282904006387, 0.08474315409836619, -0.1384672810342739, -0.15368933165829973, -0.10766934855245822, -0.023225860574196296, 0.06908079499209129, -0.3135346188690014, 0.07049395939450442, 0.07514444369937956, 0.07964021987257737, -0.09021155427680495, -0.03176127913283165, 0.00449953768546357, 0.09633433403562486, 0.004330832932442043, -0.023347931136329148, 0.07466230071965874, -0.10956789400445335, -0.16214375899739794, 0.35258293874770613, -0.09213327977040629, -0.2433989990464191, 0.1775422628186451, -0.09601196433062252, -0.14892721130061395, 0.12048161453231401, 0.20585735209439834, 0.09875133529919938, -0.16577924580850936, 0.07637762775123791, -0.035289155895408895, 0.14659235922178043, 0.0465790517196136, 0.07176082788668957, 0.19111136997060985, 0.19989855723340333, 0.14341161114922196, 0.2009693529533664, 0.006546471978432124, -0.12872636648010194, -0.35697752110583264, -0.1288409949443543, -0.11074427538791422, 0.06268538300250417, -0.09077976515367218, -0.1421273656899935, 0.4017736153465878, 0.1050597806815202, 0.18402865772212365, 0.14430722071952426, 0.33833983112318616, 0.12637716642048055, 0.018004235053031715, 0.043805472490368126, 0.26326278320600077, 0.1432013295845311, 0.05238848353001606, -0.230787028640163, 0.030679606798959456, 0.08054567488467264]
|
1,803.05805
|
Sonifying stochastic walks on biomolecular energy landscapes
|
Translating the complex, multi-dimensional data from simulations of
biomolecules to intuitive knowledge is a major challenge in computational
chemistry and biology. The so-called "free energy landscape" is amongst the
most fundamental concepts used by scientists to understand both static and
dynamic properties of biomolecular systems. In this paper we use Markov models
to design a strategy for mapping features of this landscape to sonic
parameters, for use in conjunction with visual display techniques such as
structural animations and free energy diagrams.
|
cs.HC physics.bio-ph physics.comp-ph q-bio.OT
|
translating the complex multidimensional data from simulations of biomolecules to intuitive knowledge is a major challenge in computational chemistry and biology the socalled free energy landscape is amongst the most fundamental concepts used by scientists to understand both static and dynamic properties of biomolecular systems in this paper we use markov models to design a strategy for mapping features of this landscape to sonic parameters for use in conjunction with visual display techniques such as structural animations and free energy diagrams
|
[['translating', 'the', 'complex', 'multidimensional', 'data', 'from', 'simulations', 'of', 'biomolecules', 'to', 'intuitive', 'knowledge', 'is', 'a', 'major', 'challenge', 'in', 'computational', 'chemistry', 'and', 'biology', 'the', 'socalled', 'free', 'energy', 'landscape', 'is', 'amongst', 'the', 'most', 'fundamental', 'concepts', 'used', 'by', 'scientists', 'to', 'understand', 'both', 'static', 'and', 'dynamic', 'properties', 'of', 'biomolecular', 'systems', 'in', 'this', 'paper', 'we', 'use', 'markov', 'models', 'to', 'design', 'a', 'strategy', 'for', 'mapping', 'features', 'of', 'this', 'landscape', 'to', 'sonic', 'parameters', 'for', 'use', 'in', 'conjunction', 'with', 'visual', 'display', 'techniques', 'such', 'as', 'structural', 'animations', 'and', 'free', 'energy', 'diagrams']]
|
[-0.027874897728547638, 0.07941612358676431, -0.0910806348087427, 0.11329295612687681, -0.12135507047958212, -0.0996767978678331, 0.033605318276476066, 0.3948499752599516, -0.32050066847960684, -0.363749993344148, 0.07044821252822187, -0.2508144517325693, -0.20711315608939823, 0.2220586789628192, -0.08994669008609855, 0.07826360572204223, 0.05799100687152442, -0.010160737274283613, -0.018204012345292685, -0.13943261604894092, 0.3011505959302555, 0.07029253899775169, 0.29029143571761656, 0.02721629886497042, 0.08601260750502762, 0.009046662081446912, -0.03302395096577612, 0.010381207536951995, -0.1890840287676748, 0.20224403245029626, 0.3420295287173814, 0.17225433281266395, 0.30309236646963306, -0.4456250219617361, -0.27322341780678405, 0.09911939149641973, 0.1270799463281385, 0.13224832236444878, -0.06438060008265355, -0.21701311531338702, 0.04780452931874696, -0.11522829235045608, -0.11233500688463266, -0.12441387936978797, -0.012029590625545861, 0.05704125902259055, -0.18897703430546378, 0.027244526421490275, 0.013437624388362891, 0.11961489961839017, -0.06752570526225975, -0.07556058318687627, -0.013200515771951572, 0.19766815131053006, 0.017165408981389102, 0.0015446485342158946, 0.13774742313407728, -0.19099067086583854, -0.1617374885597347, 0.4427512201630039, -0.0032078193667356247, -0.2053663792623276, 0.2800659601128212, -0.051339742399890115, -0.17775467970052067, 0.11950309964092333, 0.19380681324796176, 0.08473213314205225, -0.190628272400778, 0.07341236612302493, 0.053473070861748705, 0.18750099511242208, 0.029172065423479603, 0.011626953983472453, 0.22898740732444473, 0.2120827025860364, 0.007481096254914631, 0.13791296836333694, -0.03567607744516414, -0.1601956390120365, -0.20701796797184666, -0.15908249975814495, -0.17311714536705872, -0.0015418499041302705, -0.07377520546171222, -0.19189351994866205, 0.3829986483870465, 0.18001713441615855, 0.1391366659961842, 0.002738932225232323, 0.3191985764100941, 0.030377575344360076, 0.053897749046208684, 0.028947281628203245, 0.14702876718904548, 0.09579071039506407, 0.14948202331584912, -0.18421334417588595, 0.050377213651958255, 0.033509979518935265]
|
1,803.05806
|
Enhanced cooling for stronger qubit-phonon couplings
|
Here we present details on how the cooling effects of an opto-mechanical
system are affected beyond the secular approximation. To this end, a laser
driven two-level quantum dot (QD) embed- ded in a phononic nano-cavity is
investigated for moderately strong QD-phonon couplings regimes. For these
regimes, the use of a secular approximation within the QD-phonon interaction
terms is no longer justified as the rapidly oscillating terms cannot be
neglected from the system dynamics. Therefore, one shows that although being
small, their contribution plays an important role when quantum cooling is
achieved. The main contribution of the fast oscillating terms is analytically
estimated and one compares how the quantum cooling dynamics change within or
beyond the sec- ular approximation. The behavior of the quantum cooling effect
is investigated in the steady-state regime via the phonon field statistics.
|
quant-ph
|
here we present details on how the cooling effects of an optomechanical system are affected beyond the secular approximation to this end a laser driven twolevel quantum dot qd embed ded in a phononic nanocavity is investigated for moderately strong qdphonon couplings regimes for these regimes the use of a secular approximation within the qdphonon interaction terms is no longer justified as the rapidly oscillating terms cannot be neglected from the system dynamics therefore one shows that although being small their contribution plays an important role when quantum cooling is achieved the main contribution of the fast oscillating terms is analytically estimated and one compares how the quantum cooling dynamics change within or beyond the sec ular approximation the behavior of the quantum cooling effect is investigated in the steadystate regime via the phonon field statistics
|
[['here', 'we', 'present', 'details', 'on', 'how', 'the', 'cooling', 'effects', 'of', 'an', 'optomechanical', 'system', 'are', 'affected', 'beyond', 'the', 'secular', 'approximation', 'to', 'this', 'end', 'a', 'laser', 'driven', 'twolevel', 'quantum', 'dot', 'qd', 'embed', 'ded', 'in', 'a', 'phononic', 'nanocavity', 'is', 'investigated', 'for', 'moderately', 'strong', 'qdphonon', 'couplings', 'regimes', 'for', 'these', 'regimes', 'the', 'use', 'of', 'a', 'secular', 'approximation', 'within', 'the', 'qdphonon', 'interaction', 'terms', 'is', 'no', 'longer', 'justified', 'as', 'the', 'rapidly', 'oscillating', 'terms', 'can', 'not', 'be', 'neglected', 'from', 'the', 'system', 'dynamics', 'therefore', 'one', 'shows', 'that', 'although', 'being', 'small', 'their', 'contribution', 'plays', 'an', 'important', 'role', 'when', 'quantum', 'cooling', 'is', 'achieved', 'the', 'main', 'contribution', 'of', 'the', 'fast', 'oscillating', 'terms', 'is', 'analytically', 'estimated', 'and', 'one', 'compares', 'how', 'the', 'quantum', 'cooling', 'dynamics', 'change', 'within', 'or', 'beyond', 'the', 'sec', 'ular', 'approximation', 'the', 'behavior', 'of', 'the', 'quantum', 'cooling', 'effect', 'is', 'investigated', 'in', 'the', 'steadystate', 'regime', 'via', 'the', 'phonon', 'field', 'statistics']]
|
[-0.1423893723038644, 0.19120705102074953, -0.0761705395106199, 0.08415917479807009, 0.0036039070640928555, -0.1316268597572301, 0.026917652249077918, 0.3466353948860273, -0.2766416619946487, -0.24061496232901394, 0.059196730798627015, -0.24994245436922885, -0.1380402464360121, 0.2375312311792352, -0.006819706750068351, -0.013643988173618152, 0.03840008932403731, 0.006332000367425002, -0.022744225343199868, -0.19407670724929657, 0.2777773414867638, 0.07875864808855537, 0.2457475493743635, 0.0686812870116075, 0.06181690504053866, -0.009204620971296826, 0.07568986753611927, -0.0007954613759393131, -0.11975057117402406, 0.03047409054762038, 0.21303358525216212, 0.002244026369557981, 0.31277845228213247, -0.4527964898024815, -0.2075185636806227, 0.046953362456937556, 0.2198383116832914, 0.14545802834076657, -0.04031718940470694, -0.23152651455946757, 0.005857650561081449, -0.17209736364859626, -0.13247547685134695, -0.06975741171019736, -0.0017176525570438616, -0.004749684783461027, -0.24188460947700988, 0.09508504424189781, 0.08714748160016254, 0.03912247308822226, -0.018308870735441535, -0.026276074630296686, 0.047315994546116485, 0.1274863949300888, 0.006396096740269576, 0.01488800186419139, 0.21075158387109855, -0.12772401008095566, -0.0701669247916145, 0.40367812810152987, -0.1064817090688722, -0.17293459909838915, 0.16362155735982162, -0.15019002985413166, -0.06134111551146438, 0.13821486576526582, 0.12791229189071043, 0.10446371839646876, -0.1492046017330828, 0.09121626956740149, 0.04614657685024678, 0.1956956241505873, 0.027692139218391403, 0.09354139702567953, 0.2222329105087386, 0.1980947761483708, 0.008464946493125744, 0.15416682800397033, -0.07501890594105705, -0.1752299905965363, -0.2911380623079782, -0.08532759718160166, -0.17122218088777125, 0.06440942875718457, -0.05971356944245181, -0.1585800073956765, 0.38177455480067723, 0.1561159243990742, 0.12291880588924145, -0.01647097928055229, 0.31785912999380245, 0.19071374186246662, 0.03877717616668746, 0.062072733029668786, 0.3430412283004092, 0.15158277866940428, 0.070122164470164, -0.3416135059006811, 0.08495431300252676, 0.014062562128053095]
|
1,803.05807
|
Production of $\Lambda_c$ baryons at the LHC within the
$k_T$-factorization approach and independent parton fragmentation picture
|
We calculate cross section for production of $D$ mesons and $\Lambda_c$
baryons in proton-proton collisions at the LHC. The cross section for
production of $c \bar c$ pairs is calculated within $k_T$-factorization
approach with the Kimber-Martin-Ryskin unintegrated gluon distributions
obtained on the basis of modern collinear gluon distribution functions. We show
that our approach well describes the $D^0$, $D^+$ and $D_s$ experimental data.
We try to understand recent ALICE and LHCb data for $\Lambda_c$ production with
the $c \to \Lambda_c$ independent parton fragmentation approach. The Peterson
fragmentation functions are used. The $f_{c \to \Lambda_c}$ fragmentation
fraction and $\varepsilon_{c}^{\Lambda}$ parameter for $c \to \Lambda_c$ are
varied. As a control plot we show transverse momentum distribution of different
species of $D$ mesons assuming standard values of the $f_{c \to D}$
fragmentation fractions known from the literature. The fraction $f_{c \to
\Lambda_c}$ neccessary to describe the ALICE data is much larger than the
average value obtained from $e^+ e^-$ or $e p$ experiments. No drastic
modification of the shape of fragmentation function is allowed by the new ALICE
and LHCb data for $\Lambda_c$ production. We also discuss a possible dependence
of the $\Lambda_c/ D^0$ baryon-to-meson ratio on rapidity and transverse
momentum as seems observed recently by the ALICE and LHCb collaborations. Three
different effects are considered: the value of $\varepsilon_c^{\Lambda}$
parameter in Peterson fragmentation function for $c \to \Lambda_c$, a
kinematical effect related to the hadronization prescription and a possible
feed-down from higher charmed-baryon excitations. It seems very difficult, if
not impossible, to understand the ALICE data within the considered independent
parton fragmentation scheme.
|
hep-ph
|
we calculate cross section for production of d mesons and lambda_c baryons in protonproton collisions at the lhc the cross section for production of c bar c pairs is calculated within k_tfactorization approach with the kimbermartinryskin unintegrated gluon distributions obtained on the basis of modern collinear gluon distribution functions we show that our approach well describes the d0 d and d_s experimental data we try to understand recent alice and lhcb data for lambda_c production with the c to lambda_c independent parton fragmentation approach the peterson fragmentation functions are used the f_c to lambda_c fragmentation fraction and varepsilon_clambda parameter for c to lambda_c are varied as a control plot we show transverse momentum distribution of different species of d mesons assuming standard values of the f_c to d fragmentation fractions known from the literature the fraction f_c to lambda_c neccessary to describe the alice data is much larger than the average value obtained from e e or e p experiments no drastic modification of the shape of fragmentation function is allowed by the new alice and lhcb data for lambda_c production we also discuss a possible dependence of the lambda_c d0 baryontomeson ratio on rapidity and transverse momentum as seems observed recently by the alice and lhcb collaborations three different effects are considered the value of varepsilon_clambda parameter in peterson fragmentation function for c to lambda_c a kinematical effect related to the hadronization prescription and a possible feeddown from higher charmedbaryon excitations it seems very difficult if not impossible to understand the alice data within the considered independent parton fragmentation scheme
|
[['we', 'calculate', 'cross', 'section', 'for', 'production', 'of', 'd', 'mesons', 'and', 'lambda_c', 'baryons', 'in', 'protonproton', 'collisions', 'at', 'the', 'lhc', 'the', 'cross', 'section', 'for', 'production', 'of', 'c', 'bar', 'c', 'pairs', 'is', 'calculated', 'within', 'k_tfactorization', 'approach', 'with', 'the', 'kimbermartinryskin', 'unintegrated', 'gluon', 'distributions', 'obtained', 'on', 'the', 'basis', 'of', 'modern', 'collinear', 'gluon', 'distribution', 'functions', 'we', 'show', 'that', 'our', 'approach', 'well', 'describes', 'the', 'd0', 'd', 'and', 'd_s', 'experimental', 'data', 'we', 'try', 'to', 'understand', 'recent', 'alice', 'and', 'lhcb', 'data', 'for', 'lambda_c', 'production', 'with', 'the', 'c', 'to', 'lambda_c', 'independent', 'parton', 'fragmentation', 'approach', 'the', 'peterson', 'fragmentation', 'functions', 'are', 'used', 'the', 'f_c', 'to', 'lambda_c', 'fragmentation', 'fraction', 'and', 'varepsilon_clambda', 'parameter', 'for', 'c', 'to', 'lambda_c', 'are', 'varied', 'as', 'a', 'control', 'plot', 'we', 'show', 'transverse', 'momentum', 'distribution', 'of', 'different', 'species', 'of', 'd', 'mesons', 'assuming', 'standard', 'values', 'of', 'the', 'f_c', 'to', 'd', 'fragmentation', 'fractions', 'known', 'from', 'the', 'literature', 'the', 'fraction', 'f_c', 'to', 'lambda_c', 'neccessary', 'to', 'describe', 'the', 'alice', 'data', 'is', 'much', 'larger', 'than', 'the', 'average', 'value', 'obtained', 'from', 'e', 'e', 'or', 'e', 'p', 'experiments', 'no', 'drastic', 'modification', 'of', 'the', 'shape', 'of', 'fragmentation', 'function', 'is', 'allowed', 'by', 'the', 'new', 'alice', 'and', 'lhcb', 'data', 'for', 'lambda_c', 'production', 'we', 'also', 'discuss', 'a', 'possible', 'dependence', 'of', 'the', 'lambda_c', 'd0', 'baryontomeson', 'ratio', 'on', 'rapidity', 'and', 'transverse', 'momentum', 'as', 'seems', 'observed', 'recently', 'by', 'the', 'alice', 'and', 'lhcb', 'collaborations', 'three', 'different', 'effects', 'are', 'considered', 'the', 'value', 'of', 'varepsilon_clambda', 'parameter', 'in', 'peterson', 'fragmentation', 'function', 'for', 'c', 'to', 'lambda_c', 'a', 'kinematical', 'effect', 'related', 'to', 'the', 'hadronization', 'prescription', 'and', 'a', 'possible', 'feeddown', 'from', 'higher', 'charmedbaryon', 'excitations', 'it', 'seems', 'very', 'difficult', 'if', 'not', 'impossible', 'to', 'understand', 'the', 'alice', 'data', 'within', 'the', 'considered', 'independent', 'parton', 'fragmentation', 'scheme']]
|
[-0.05544938282976144, 0.20161942302343228, -0.14911860213326217, 0.1406691569285359, -0.03201185685199823, -0.11035169550224908, 0.02896504312241089, 0.32462040272851783, -0.2042238246288526, -0.23430728209168875, -0.08492248974218893, -0.34176608238751865, 0.04758896960068292, 0.12954770453732692, 0.06965544158340135, 0.14301799694866948, 0.08473566855311163, -0.018577973210332235, -0.012842522078110699, -0.22784203642531653, 0.3265511552593851, 0.03854907062464184, 0.23664064937300056, 0.16729844866551516, 0.017647925735331256, 0.05400262685319365, -0.07246355627482494, -0.033855607549934254, -0.21406518000592825, 0.030581626606236083, 0.24032701683941823, 0.1378932157986551, 0.13079947936384714, -0.3134348471107524, -0.07108016116833386, 0.13044272300781856, 0.16437797614575414, 0.08177324751565276, 0.02257328788125382, -0.26870684754717084, 0.11653479699464153, -0.23644500058469212, -0.1429573284067726, -0.06138596411563398, 0.11989439331002302, -0.032904730789370604, -0.343134011042687, 0.07567425111167461, -0.06630338599874688, 0.017270726523571468, -0.0007166381078851662, -0.2575565044598495, -0.08799056889752807, 0.018688145016912055, 0.0872200689117908, 0.14239891304958488, 0.20298679448869947, -0.14361997058704432, -0.14545630578081623, 0.3629474838141554, -0.008724785896567284, -0.1901382502735152, 0.14141711019261113, -0.2363329344494954, -0.11458903481252491, 0.1439718506010177, 0.21429858471437488, 0.07915568644859532, -0.1590578945682117, 0.06602137826668286, -0.01364816922043331, 0.17566784961481197, 0.10414525671039036, 0.034799522362458125, 0.12418315824368958, 0.15910483175137824, -0.05014905908872381, 0.06961788835550853, -0.0725327904197178, -0.09209261101340269, -0.4011781659963642, -0.09928868661901748, -0.12158547811320254, 0.07899041331104452, -0.05734138733792198, -0.05764997830838254, 0.3051983009227397, 0.0702735465662933, 0.35286257199964727, 0.01446974861197347, 0.3162717527958976, 0.08126309189391359, 0.07945768020067061, 0.08873986899663239, 0.25099518953988603, 0.17324413282006199, 0.15557084365950016, -0.26159124400343947, 0.09270880864833864, 0.02528076981331489]
|
1,803.05808
|
Sharing and Preserving Computational Analyses for Posterity with
encapsulator
|
Open data and open-source software may be part of the solution to science's
"reproducibility crisis", but they are insufficient to guarantee
reproducibility. Requiring minimal end-user expertise, encapsulator creates a
"time capsule" with reproducible code in a self-contained computational
environment. encapsulator provides end-users with a fully-featured desktop
environment for reproducible research.
|
cs.DL
|
open data and opensource software may be part of the solution to sciences reproducibility crisis but they are insufficient to guarantee reproducibility requiring minimal enduser expertise encapsulator creates a time capsule with reproducible code in a selfcontained computational environment encapsulator provides endusers with a fullyfeatured desktop environment for reproducible research
|
[['open', 'data', 'and', 'opensource', 'software', 'may', 'be', 'part', 'of', 'the', 'solution', 'to', 'sciences', 'reproducibility', 'crisis', 'but', 'they', 'are', 'insufficient', 'to', 'guarantee', 'reproducibility', 'requiring', 'minimal', 'enduser', 'expertise', 'encapsulator', 'creates', 'a', 'time', 'capsule', 'with', 'reproducible', 'code', 'in', 'a', 'selfcontained', 'computational', 'environment', 'encapsulator', 'provides', 'endusers', 'with', 'a', 'fullyfeatured', 'desktop', 'environment', 'for', 'reproducible', 'research']]
|
[-0.13010135018945826, 0.014250045487036308, -0.09653399353070806, 0.035929504990538895, -0.18536681887538484, -0.2419201797359468, 0.032350560456203915, 0.4736127586123378, -0.23838411457836628, -0.41394944217366475, 0.14191296674107434, -0.23670049427892081, -0.03732687162118964, 0.22974062249219665, -0.1867412966870082, 0.07945610567306478, 0.20285007976538813, -0.046296731646483145, 0.024087114795596182, -0.24151950154919177, 0.1582342303590849, 0.13701606588438153, 0.30058972554009716, 0.12782915477873757, 0.019494179328224465, -0.11294561120060582, -0.060384540217152484, -0.028692788174036348, -0.07144776378603031, 0.1514513607059295, 0.44350164430215955, 0.25474863693428534, 0.39129646060367423, -0.4881455539725721, -0.14353381603723392, 0.007295821148242491, 0.1064997600527325, 0.10601505914625402, -0.09805136060458608, -0.2747473077227672, 0.05000164028024301, -0.2067728819529293, -0.1440393923354956, -0.1403004468496268, 0.006984826390786718, -0.027924853338239092, -0.2558326179084058, 0.009675822996844849, -0.00843886261767087, 0.19353419813948372, -0.04272140378695136, -0.03348944799411887, 0.0021278627682477236, 0.1908809341645489, 0.013545441647390058, 0.08231638487632154, 0.21688294237537775, -0.1327399864870434, -0.09669143299106508, 0.39924544379270327, 0.009663681766445128, -0.18399327690713108, 0.24667090762037938, -0.06517252671377112, -0.1054006498598028, 0.09074127646939208, 0.19223459875987223, -0.014762483168548593, -0.2261941142884704, 0.09284652513330609, 0.0735331668353562, 0.2364044312344049, 0.009384028377250312, -0.009223742003086954, 0.1946565816566969, 0.2427162784539784, 0.061641991410094, 0.11454683990208044, 0.1027900730938806, -0.07003216012769069, -0.2652027623068231, -0.17929798264716132, -0.12970078122452833, 0.038857617973311186, -0.006889559619291201, -0.24596829715543814, 0.3932328308583237, 0.20417529171148394, 0.026827196318966646, 0.034492339744853474, 0.36789458252800006, -0.07801009019021876, 0.1288342949701473, 0.18298304461253187, 0.121094190137228, -0.04562476064408353, 0.2432698258611102, -0.09220263383273657, 0.1442933148064185, -0.06894568555677931]
|
1,803.05809
|
Hyperbolic Geometry and Amplituhedra in 1+2 dimensions
|
Recently, the existence of an Amplituhedron for tree level amplitudes in the
bi-adjoint scalar field theory has been proved by Arkhani-Hamed et al. We argue
that hyperbolic geometry constitutes a natural framework to address the study
of positive geometries in moduli spaces of Riemann surfaces, and thus to try to
extend this achievement beyond tree level. In this paper we begin an
exploration of these ideas starting from the simplest example of hyperbolic
geometry, the hyperbolic plane. The hyperboloid model naturally guides us to
re-discover the moduli space Associahedron, and a new version of its
kinematical avatar. As a by-product we obtain a solution to the scattering
equations which can be interpreted as a special case of the two well known
solutions in terms of spinor-helicity formalism. The construction is done in
$1+2$ dimensions and this makes harder to understand how to extract the
amplitude from the dlog of the space time Associahedron. Nevertheless, we
continue the investigation accommodating a loop momentum in the picture. By
doing this we are led to another polytope called Halohedron, which was already
known to mathematicians. We argue that the Halohedron fulfils many criteria
that make it plausible to be understood as a 1-loop Amplituhedron for the cubic
theory. Furthermore, the hyperboloid model again allows to understand that a
kinematical version of the Halohedron exists and is related to the one living
in moduli space by a simple generalisation of the tree level map.
|
hep-th math.CO
|
recently the existence of an amplituhedron for tree level amplitudes in the biadjoint scalar field theory has been proved by arkhanihamed et al we argue that hyperbolic geometry constitutes a natural framework to address the study of positive geometries in moduli spaces of riemann surfaces and thus to try to extend this achievement beyond tree level in this paper we begin an exploration of these ideas starting from the simplest example of hyperbolic geometry the hyperbolic plane the hyperboloid model naturally guides us to rediscover the moduli space associahedron and a new version of its kinematical avatar as a byproduct we obtain a solution to the scattering equations which can be interpreted as a special case of the two well known solutions in terms of spinorhelicity formalism the construction is done in 12 dimensions and this makes harder to understand how to extract the amplitude from the dlog of the space time associahedron nevertheless we continue the investigation accommodating a loop momentum in the picture by doing this we are led to another polytope called halohedron which was already known to mathematicians we argue that the halohedron fulfils many criteria that make it plausible to be understood as a 1loop amplituhedron for the cubic theory furthermore the hyperboloid model again allows to understand that a kinematical version of the halohedron exists and is related to the one living in moduli space by a simple generalisation of the tree level map
|
[['recently', 'the', 'existence', 'of', 'an', 'amplituhedron', 'for', 'tree', 'level', 'amplitudes', 'in', 'the', 'biadjoint', 'scalar', 'field', 'theory', 'has', 'been', 'proved', 'by', 'arkhanihamed', 'et', 'al', 'we', 'argue', 'that', 'hyperbolic', 'geometry', 'constitutes', 'a', 'natural', 'framework', 'to', 'address', 'the', 'study', 'of', 'positive', 'geometries', 'in', 'moduli', 'spaces', 'of', 'riemann', 'surfaces', 'and', 'thus', 'to', 'try', 'to', 'extend', 'this', 'achievement', 'beyond', 'tree', 'level', 'in', 'this', 'paper', 'we', 'begin', 'an', 'exploration', 'of', 'these', 'ideas', 'starting', 'from', 'the', 'simplest', 'example', 'of', 'hyperbolic', 'geometry', 'the', 'hyperbolic', 'plane', 'the', 'hyperboloid', 'model', 'naturally', 'guides', 'us', 'to', 'rediscover', 'the', 'moduli', 'space', 'associahedron', 'and', 'a', 'new', 'version', 'of', 'its', 'kinematical', 'avatar', 'as', 'a', 'byproduct', 'we', 'obtain', 'a', 'solution', 'to', 'the', 'scattering', 'equations', 'which', 'can', 'be', 'interpreted', 'as', 'a', 'special', 'case', 'of', 'the', 'two', 'well', 'known', 'solutions', 'in', 'terms', 'of', 'spinorhelicity', 'formalism', 'the', 'construction', 'is', 'done', 'in', '12', 'dimensions', 'and', 'this', 'makes', 'harder', 'to', 'understand', 'how', 'to', 'extract', 'the', 'amplitude', 'from', 'the', 'dlog', 'of', 'the', 'space', 'time', 'associahedron', 'nevertheless', 'we', 'continue', 'the', 'investigation', 'accommodating', 'a', 'loop', 'momentum', 'in', 'the', 'picture', 'by', 'doing', 'this', 'we', 'are', 'led', 'to', 'another', 'polytope', 'called', 'halohedron', 'which', 'was', 'already', 'known', 'to', 'mathematicians', 'we', 'argue', 'that', 'the', 'halohedron', 'fulfils', 'many', 'criteria', 'that', 'make', 'it', 'plausible', 'to', 'be', 'understood', 'as', 'a', '1loop', 'amplituhedron', 'for', 'the', 'cubic', 'theory', 'furthermore', 'the', 'hyperboloid', 'model', 'again', 'allows', 'to', 'understand', 'that', 'a', 'kinematical', 'version', 'of', 'the', 'halohedron', 'exists', 'and', 'is', 'related', 'to', 'the', 'one', 'living', 'in', 'moduli', 'space', 'by', 'a', 'simple', 'generalisation', 'of', 'the', 'tree', 'level', 'map']]
|
[-0.09363210985045413, 0.0987457430486277, -0.12716064270133753, 0.12590100058299883, -0.12931330192631507, -0.08785908802502075, 0.03812842360146297, 0.311949905776711, -0.26955641822491977, -0.2769935265549743, 0.08180709475910516, -0.22884995836154975, -0.21299139126184471, 0.1780100955321477, -0.11095115576313505, 0.0102041045193576, 0.009539184808364786, 0.03747477614667625, -0.07164420347239932, -0.2512837467270915, 0.34688838088892743, 0.05243378034578519, 0.22378883753692785, 0.04959892828132427, 0.1030433119311695, 0.019224538882828032, -0.011479178851248236, 0.02478233609647124, -0.15069610659662871, 0.12785751802386974, 0.2607398745038831, 0.12124419930934975, 0.2042206358076872, -0.4050997761019728, -0.20456389500065433, 0.10733146691681095, 0.15747939651076015, 0.12236865025518313, 0.001340338687517653, -0.2453819249978749, 0.04956672980769627, -0.14641338150663824, -0.22334698544791803, -0.09525079016620489, 0.01895752995202871, -0.08504288772873143, -0.20763177219700366, -0.005676096117233071, 0.06284976883540047, 0.003437152799709883, -0.043718201816267094, -0.07548619210661611, -0.038222897660462614, 0.10117636102146496, 0.04307907816411335, 0.07702749107380312, 0.05155278850983922, -0.11811288198160015, -0.13197154667136887, 0.390395974505607, -0.03744482932705822, -0.2222843469036782, 0.1577671257677687, -0.14561830409783014, -0.16812097254914532, 0.10679349279134422, 0.15032400012943722, 0.12851729435177917, -0.14836534482395766, 0.15469578582945448, -0.08354497439847582, 0.11867687343054735, 0.10337482796296103, -0.0062987175205075595, 0.18821509733063532, 0.15526131506245505, 0.053220956375633434, 0.16528227181898655, -0.02131835059418682, -0.12278599540165247, -0.3300590636832133, -0.18802179614664116, -0.11891230250558735, 0.07152050884175562, -0.06681884735580106, -0.17765652995252645, 0.3697386133274118, 0.14145465408525892, 0.21920844311066065, 0.061485742706860025, 0.23867764422683646, 0.09158710304259958, 0.07729624086640184, 0.03645746606873605, 0.2296274073400523, 0.15530507017714146, 0.08431349417572709, -0.14662199783446775, -0.010602333547866993, 0.1397966032080103]
|
1,803.0581
|
Low temperature optical properties of interstellar and circumstellar icy
silicate grain analogues in the mid-infrared spectral region
|
Two different silicate/water ice mixtures representing laboratory analogues
of interstellar and circumstellar icy grains were produced in the laboratory.
For the first time, optical constants, the real and imaginary parts of the
complex refractive index, of such silicate/water ice mixtures were
experimentally determined in the mid-infrared spectral region at low
temperatures. In addition, optical constants of pure water ice and pure
silicates were derived in the laboratory. Two sets of constants were compared,
namely, measured constants calculated from the transmission spectra of
silicate/water ice samples and effective constants calculated from the optical
constants of pure silicates and pure water ice samples using different mixing
rules (effective medium approaches). Differences between measured and effective
constants show that a mixing (averaging) of optical constants of water ice and
silicates for the determination of the optical properties of silicate/ice
mixtures can lead to incorrect results. Also, it is shown that a part of water
ice molecules is trapped in/on silicate grains and does not desorb up to 200 K.
Our unique data are just in time with respect to the new challenging space
mission, James Webb Space Telescope, which will be able to bring novel detailed
information on interstellar and circumstellar grains, and suitable laboratory
data are extremely important for the decoding of astronomical spectra.
|
astro-ph.GA astro-ph.IM
|
two different silicatewater ice mixtures representing laboratory analogues of interstellar and circumstellar icy grains were produced in the laboratory for the first time optical constants the real and imaginary parts of the complex refractive index of such silicatewater ice mixtures were experimentally determined in the midinfrared spectral region at low temperatures in addition optical constants of pure water ice and pure silicates were derived in the laboratory two sets of constants were compared namely measured constants calculated from the transmission spectra of silicatewater ice samples and effective constants calculated from the optical constants of pure silicates and pure water ice samples using different mixing rules effective medium approaches differences between measured and effective constants show that a mixing averaging of optical constants of water ice and silicates for the determination of the optical properties of silicateice mixtures can lead to incorrect results also it is shown that a part of water ice molecules is trapped inon silicate grains and does not desorb up to 200 k our unique data are just in time with respect to the new challenging space mission james webb space telescope which will be able to bring novel detailed information on interstellar and circumstellar grains and suitable laboratory data are extremely important for the decoding of astronomical spectra
|
[['two', 'different', 'silicatewater', 'ice', 'mixtures', 'representing', 'laboratory', 'analogues', 'of', 'interstellar', 'and', 'circumstellar', 'icy', 'grains', 'were', 'produced', 'in', 'the', 'laboratory', 'for', 'the', 'first', 'time', 'optical', 'constants', 'the', 'real', 'and', 'imaginary', 'parts', 'of', 'the', 'complex', 'refractive', 'index', 'of', 'such', 'silicatewater', 'ice', 'mixtures', 'were', 'experimentally', 'determined', 'in', 'the', 'midinfrared', 'spectral', 'region', 'at', 'low', 'temperatures', 'in', 'addition', 'optical', 'constants', 'of', 'pure', 'water', 'ice', 'and', 'pure', 'silicates', 'were', 'derived', 'in', 'the', 'laboratory', 'two', 'sets', 'of', 'constants', 'were', 'compared', 'namely', 'measured', 'constants', 'calculated', 'from', 'the', 'transmission', 'spectra', 'of', 'silicatewater', 'ice', 'samples', 'and', 'effective', 'constants', 'calculated', 'from', 'the', 'optical', 'constants', 'of', 'pure', 'silicates', 'and', 'pure', 'water', 'ice', 'samples', 'using', 'different', 'mixing', 'rules', 'effective', 'medium', 'approaches', 'differences', 'between', 'measured', 'and', 'effective', 'constants', 'show', 'that', 'a', 'mixing', 'averaging', 'of', 'optical', 'constants', 'of', 'water', 'ice', 'and', 'silicates', 'for', 'the', 'determination', 'of', 'the', 'optical', 'properties', 'of', 'silicateice', 'mixtures', 'can', 'lead', 'to', 'incorrect', 'results', 'also', 'it', 'is', 'shown', 'that', 'a', 'part', 'of', 'water', 'ice', 'molecules', 'is', 'trapped', 'inon', 'silicate', 'grains', 'and', 'does', 'not', 'desorb', 'up', 'to', '200', 'k', 'our', 'unique', 'data', 'are', 'just', 'in', 'time', 'with', 'respect', 'to', 'the', 'new', 'challenging', 'space', 'mission', 'james', 'webb', 'space', 'telescope', 'which', 'will', 'be', 'able', 'to', 'bring', 'novel', 'detailed', 'information', 'on', 'interstellar', 'and', 'circumstellar', 'grains', 'and', 'suitable', 'laboratory', 'data', 'are', 'extremely', 'important', 'for', 'the', 'decoding', 'of', 'astronomical', 'spectra']]
|
[-0.02986407128462824, 0.21605117815012614, -0.06189487941819133, 0.029490952645936073, -0.023120882171669632, -0.09140537138277956, 0.04183270030112063, 0.42820726587962343, -0.24772361524720893, -0.31209075068354264, 0.09523961674524097, -0.28363032977127633, -0.0731192887606214, 0.16091293287000033, 0.010156453693461034, 0.05053222530314001, 0.04553411825796174, -0.08885262655982554, -0.039552439107908316, -0.24373729482416717, 0.25878500294213963, 0.08881231886886448, 0.22805890737330956, 0.06805815792480324, 0.08297208727335213, -0.08733042961833955, -0.059714482646982814, -0.04175379716320034, -0.16089907528368272, 0.11775805742007579, 0.28218799821096713, 0.036203173167950596, 0.10532589910896185, -0.4433996298646122, -0.23703035908548153, 0.0938019151523515, 0.08498106311600638, 0.0745111848619409, 0.0021224799268035953, -0.24121774937427864, -0.0014688398455097494, -0.0886134966944181, -0.14805864523963835, -0.06281327474332675, 0.048902962169217135, 0.00913455656186735, -0.2631554878887862, 0.055840878321466995, -0.005924676223580783, 0.12240399045856466, -0.18339052096878783, -0.2222045811987813, -0.05025383326836301, 0.10551586700824059, -0.0018672019936214973, -0.04137813583649783, 0.1958887899466636, -0.0941563033459099, -0.005482160409038524, 0.45923122269282407, -0.15496876846335267, -0.07019145851466535, 0.23814090346957234, -0.18074321273440644, -0.09072008776871301, 0.22204381242721072, 0.15757134351084864, 0.12438359122140713, -0.14852646685765958, 0.019891413624571655, -0.04679184510279888, 0.189054308569509, 0.1335986738989209, 0.07730975421366251, 0.25262307394649036, 0.12133989441076126, -0.03642444473678043, 0.11707452650130086, -0.13133092184542233, -0.055588808502136815, -0.21867080489659055, -0.20372183263187088, -0.1864000720378029, 0.026029023964808242, -0.1287990815144957, -0.11813122693764297, 0.2794002266335897, 0.08737874415513322, 0.15994468767218561, -0.00774019970106164, 0.26997638618357267, -0.0062438520107427125, 0.08967348734265573, 0.03264191804091795, 0.31309487609969566, 0.12672103731561965, 0.13868602984739353, -0.2161634711226475, 0.11606283015593603, -0.002363067463490565]
|
1,803.05811
|
A Universal Dynamic Program and Refined Existence Results for
Decentralized Stochastic Control
|
For sequential stochastic control problems with standard Borel measurement
and control action spaces, we introduce a general (universally applicable)
dynamic programming formulation, establish its well-posedness, and provide new
existence results for optimal policies. Our dynamic program builds in part on
Witsenhausen's standard form, but with a different formulation for the state,
action, and transition dynamics. Using recent results on measurability
properties of strategic measures in decentralized control, we obtain a standard
Borel controlled Markov model. This allows for a well-defined dynamic
programming recursion through universal measurability properties of the value
functions for each time stage. In addition, new existence results are obtained
for optimal policies in decentralized stochastic control. These state that for
a static team with independent measurements, it suffices for the cost function
to be continuous (only) in the actions for the existence of an optimal policy
under mild compactness (or tightness) conditions. These also apply to dynamic
teams which admit static reductions with independent measurements through a
change of measure transformation. We show through a counterexample that weaker
conditions may not lead to existence of an optimal team policy. The paper's
existence results generalize those previously reported in the literature. A
summary of and comparison with previously reported results and some
applications are presented.
|
math.OC
|
for sequential stochastic control problems with standard borel measurement and control action spaces we introduce a general universally applicable dynamic programming formulation establish its wellposedness and provide new existence results for optimal policies our dynamic program builds in part on witsenhausens standard form but with a different formulation for the state action and transition dynamics using recent results on measurability properties of strategic measures in decentralized control we obtain a standard borel controlled markov model this allows for a welldefined dynamic programming recursion through universal measurability properties of the value functions for each time stage in addition new existence results are obtained for optimal policies in decentralized stochastic control these state that for a static team with independent measurements it suffices for the cost function to be continuous only in the actions for the existence of an optimal policy under mild compactness or tightness conditions these also apply to dynamic teams which admit static reductions with independent measurements through a change of measure transformation we show through a counterexample that weaker conditions may not lead to existence of an optimal team policy the papers existence results generalize those previously reported in the literature a summary of and comparison with previously reported results and some applications are presented
|
[['for', 'sequential', 'stochastic', 'control', 'problems', 'with', 'standard', 'borel', 'measurement', 'and', 'control', 'action', 'spaces', 'we', 'introduce', 'a', 'general', 'universally', 'applicable', 'dynamic', 'programming', 'formulation', 'establish', 'its', 'wellposedness', 'and', 'provide', 'new', 'existence', 'results', 'for', 'optimal', 'policies', 'our', 'dynamic', 'program', 'builds', 'in', 'part', 'on', 'witsenhausens', 'standard', 'form', 'but', 'with', 'a', 'different', 'formulation', 'for', 'the', 'state', 'action', 'and', 'transition', 'dynamics', 'using', 'recent', 'results', 'on', 'measurability', 'properties', 'of', 'strategic', 'measures', 'in', 'decentralized', 'control', 'we', 'obtain', 'a', 'standard', 'borel', 'controlled', 'markov', 'model', 'this', 'allows', 'for', 'a', 'welldefined', 'dynamic', 'programming', 'recursion', 'through', 'universal', 'measurability', 'properties', 'of', 'the', 'value', 'functions', 'for', 'each', 'time', 'stage', 'in', 'addition', 'new', 'existence', 'results', 'are', 'obtained', 'for', 'optimal', 'policies', 'in', 'decentralized', 'stochastic', 'control', 'these', 'state', 'that', 'for', 'a', 'static', 'team', 'with', 'independent', 'measurements', 'it', 'suffices', 'for', 'the', 'cost', 'function', 'to', 'be', 'continuous', 'only', 'in', 'the', 'actions', 'for', 'the', 'existence', 'of', 'an', 'optimal', 'policy', 'under', 'mild', 'compactness', 'or', 'tightness', 'conditions', 'these', 'also', 'apply', 'to', 'dynamic', 'teams', 'which', 'admit', 'static', 'reductions', 'with', 'independent', 'measurements', 'through', 'a', 'change', 'of', 'measure', 'transformation', 'we', 'show', 'through', 'a', 'counterexample', 'that', 'weaker', 'conditions', 'may', 'not', 'lead', 'to', 'existence', 'of', 'an', 'optimal', 'team', 'policy', 'the', 'papers', 'existence', 'results', 'generalize', 'those', 'previously', 'reported', 'in', 'the', 'literature', 'a', 'summary', 'of', 'and', 'comparison', 'with', 'previously', 'reported', 'results', 'and', 'some', 'applications', 'are', 'presented']]
|
[-0.1117745322222565, 0.053944081541714324, -0.10186702841757864, 0.05754620358876542, -0.11580306560853901, -0.14510178231467732, 0.08999514204094519, 0.38006954087655326, -0.2711472032942634, -0.274541357876328, 0.1474453582853565, -0.20984371259460138, -0.14633125785832712, 0.21587234030923116, -0.09977606322688325, 0.09535748282968233, 0.06592381752663008, 0.00804270236263083, -0.07674121862229023, -0.23150704243976244, 0.32520219881440726, 0.016378422672657864, 0.284318982001511, 0.024609946238342673, 0.11505746861620568, 0.037430740934785385, -0.003616484955115163, 0.06313161521133233, -0.17797720281145443, 0.097172815264945, 0.2799163391118518, 0.16612053389489764, 0.3005201420949205, -0.39318208407232724, -0.18615878397173694, 0.09866372642449243, 0.04488068001973555, 0.0928578497622621, -0.07525069977759703, -0.29795936127035805, 0.09552853273347038, -0.13927442442450294, -0.11427344125920484, -0.1375735457277978, -0.013282565437122315, 0.03708641500108772, -0.33992187754399533, 0.05787964073784977, 0.06442587285478046, 0.04510355745959613, -0.13303794531496962, -0.08914130229158732, 0.029969202560386148, 0.1336889933751995, 0.026489739303177915, 0.014919957518774413, 0.11745093460532202, -0.08830808579318837, -0.21850648132526285, 0.32263799951578254, -0.0735920292959697, -0.23845731087280933, 0.21016810085525475, -0.10444250853579258, -0.19339919575953468, 0.10458913045723874, 0.17673860020724075, 0.15132645621967777, -0.1820065323330894, 0.06800116829271541, -0.08752102578499756, 0.15620962421382792, 0.03769516302182695, 0.06055692699316052, 0.12237309318053838, 0.15732953140899036, 0.16234169648915242, 0.1431597434046143, 0.03795772512636827, -0.1515361137543625, -0.3299166708937194, -0.1175464418883197, -0.09870681680001067, 0.023451682491802187, -0.0977330189155373, -0.15163387203193157, 0.35738646169643, 0.16872734863790212, 0.14709631810729631, 0.14007439278094277, 0.2602653696408702, 0.13102367987624564, 0.033386832641343164, 0.08676469863666861, 0.23688403250503912, 0.09624556721871998, 0.10530960805273214, -0.19239190462774233, 0.122232722960399, 0.07505828469253825]
|
1,803.05812
|
Spin-Boson type models analysed using symmetries
|
In this paper we analyse a family of models for a qubit interacting with a
bosonic field. These models have a parity symmetry, which enables them to have
a ground state even in some infrared irregular cases. In this paper we
investigate this symmetry and consider higher order perturbations of field
operators to any even order. We find the domain of selfadjointness and
decompose the Hamiltonian into two fiber operators each defined on Fock space.
We then prove an HVZ theorem for each operator under minimal conditions, and
show that the ground state is always associated with the same fiber operator,
while eigenvalues of the other fiber operator corresponds to exited states.
Thus the problem of analysing the ground state and exited states is reduced to
a simpler problem on Fock space.
|
math-ph math.MP
|
in this paper we analyse a family of models for a qubit interacting with a bosonic field these models have a parity symmetry which enables them to have a ground state even in some infrared irregular cases in this paper we investigate this symmetry and consider higher order perturbations of field operators to any even order we find the domain of selfadjointness and decompose the hamiltonian into two fiber operators each defined on fock space we then prove an hvz theorem for each operator under minimal conditions and show that the ground state is always associated with the same fiber operator while eigenvalues of the other fiber operator corresponds to exited states thus the problem of analysing the ground state and exited states is reduced to a simpler problem on fock space
|
[['in', 'this', 'paper', 'we', 'analyse', 'a', 'family', 'of', 'models', 'for', 'a', 'qubit', 'interacting', 'with', 'a', 'bosonic', 'field', 'these', 'models', 'have', 'a', 'parity', 'symmetry', 'which', 'enables', 'them', 'to', 'have', 'a', 'ground', 'state', 'even', 'in', 'some', 'infrared', 'irregular', 'cases', 'in', 'this', 'paper', 'we', 'investigate', 'this', 'symmetry', 'and', 'consider', 'higher', 'order', 'perturbations', 'of', 'field', 'operators', 'to', 'any', 'even', 'order', 'we', 'find', 'the', 'domain', 'of', 'selfadjointness', 'and', 'decompose', 'the', 'hamiltonian', 'into', 'two', 'fiber', 'operators', 'each', 'defined', 'on', 'fock', 'space', 'we', 'then', 'prove', 'an', 'hvz', 'theorem', 'for', 'each', 'operator', 'under', 'minimal', 'conditions', 'and', 'show', 'that', 'the', 'ground', 'state', 'is', 'always', 'associated', 'with', 'the', 'same', 'fiber', 'operator', 'while', 'eigenvalues', 'of', 'the', 'other', 'fiber', 'operator', 'corresponds', 'to', 'exited', 'states', 'thus', 'the', 'problem', 'of', 'analysing', 'the', 'ground', 'state', 'and', 'exited', 'states', 'is', 'reduced', 'to', 'a', 'simpler', 'problem', 'on', 'fock', 'space']]
|
[-0.15582024691993315, 0.15371679007809938, -0.07355653899757078, 0.05681254159373401, -0.03379260259151289, -0.12216600094865443, 0.014223684262216204, 0.3703800047162186, -0.2428690393518826, -0.2222309168851511, 0.12759144580305667, -0.2637666659852998, -0.11876667094078254, 0.12803111372649614, -0.044551650753639864, 0.03411387310321019, 0.08236972233774423, 0.09630649880096881, -0.09411959118865938, -0.2107475266216859, 0.41090491322348965, -0.03988649355685056, 0.24719006627106643, 0.0060299593107739574, 0.11946071049015065, 0.0027552051399128905, 0.057418580442159015, -0.027747257684426808, -0.10758072170138996, 0.1274663036465151, 0.23312469930880814, 0.07419330237793144, 0.26442389149187046, -0.44439429036256944, -0.1924880764898703, 0.17566379980946129, 0.12163172605108809, 0.1528360151595817, 0.016893066606964127, -0.31394909508526325, 0.06566004152938892, -0.1774004892936456, -0.16863409080542624, -0.0985122017393058, -0.007687649899515126, -0.056306172600174745, -0.2671863350745601, 0.012381260999421956, 0.07124161452697025, 0.026477953235646993, -0.11650721835515772, -0.0738110712157901, -0.04929843976578647, 0.09445108609471584, 0.0028725763858705195, 0.008277615274754211, 0.049710992601996455, -0.1411212039917397, -0.09828693416167164, 0.362812892020112, -0.07006722760287988, -0.2329916117490608, 0.1503059562140455, -0.14037451914963173, -0.12939178801819004, 0.06905691241351605, 0.14114697598217224, 0.13055310879523555, -0.10546444833391544, 0.13035502266244625, -0.041863434221313306, 0.16019025304580503, 0.05551947215854219, 0.10114784162336339, 0.13607372048268604, 0.08790545625908469, 0.14764416454779689, 0.1905311332935305, -0.03164347434644834, -0.1067827373679558, -0.3078301273512118, -0.19456425201938007, -0.1660969853683403, 0.06338839726099237, -0.031816457833470355, -0.15708823964197302, 0.45729454871351743, 0.1133362988034743, 0.21213691588491201, 0.04834553829983413, 0.2521061742057403, 0.1691735899005311, 0.06003300969446586, 0.06752676192528187, 0.20356157920292445, 0.13938985669378642, 0.04554103362545103, -0.21307008660038596, -0.027486883495426315, 0.0892290084721577]
|
1,803.05813
|
The Toda$_2$ chain
|
We show that a natural discretisation of Virasoro algebra yields a quantum
integrable model which is the Toda chain in the second Hamiltonian structure.
|
math-ph math.MP nlin.SI
|
we show that a natural discretisation of virasoro algebra yields a quantum integrable model which is the toda chain in the second hamiltonian structure
|
[['we', 'show', 'that', 'a', 'natural', 'discretisation', 'of', 'virasoro', 'algebra', 'yields', 'a', 'quantum', 'integrable', 'model', 'which', 'is', 'the', 'toda', 'chain', 'in', 'the', 'second', 'hamiltonian', 'structure']]
|
[-0.19131399015896022, 0.10269603307824582, -0.08935681846924126, 0.0768595574045321, -0.097447301261127, -0.16507006774190813, -0.09923984328634106, 0.3045517598511651, -0.3644570969045162, -0.13984849591118595, 0.07486337756563444, -0.2276172012401124, -0.18278644668559232, 0.14888886939540194, -0.040292356008042894, 0.032951519436513386, 0.1830963990651071, 0.11489278479712084, -0.1478731587897831, -0.22585136721803187, 0.2881809427635744, 0.015417840967226462, 0.2439441792666912, 0.002262211482351025, 0.19869547306249538, -0.013315582453894118, 0.10507892739648621, -0.08122722307840984, -0.13482450035280635, 0.11602452800919612, 0.2355746297398582, 0.0168620062371095, 0.18444769981821688, -0.36786703928373754, -0.1959985496553903, 0.05775350235247364, 0.16384000067288676, 0.19628235326672439, -0.013506672655542692, -0.2616489542803417, 0.03810724266804755, -0.24842067361654094, -0.13938865022889027, -0.06131555110914633, -0.00632143672555685, -0.0642675650306046, -0.25484040844942984, 0.10599530854960904, 0.16434714198112488, 0.07231385714840144, -0.07270660354212548, -0.026447338983416557, -0.1311532414595907, 0.02512619085609913, -0.07043917078893476, 0.03204525945087274, 0.04337191872764379, -0.07858587374600272, -0.1593709756465008, 0.4111829399286459, -0.04328517566318624, -0.31611738082331914, 0.08097597149511178, -0.12826381619864455, -0.25481976091396064, 0.052167902079721294, 0.06859762764846285, 0.07505894332037617, -0.1373338814228191, 0.24628112775584063, -0.13156656765689453, 0.13072604507518312, -0.004892155101212363, -0.028157312015537173, 0.1905097064251701, 0.15837141700709859, 0.10500997312677403, 0.1863648136301587, 0.019364641377857577, -0.27397642474776757, -0.3787055063682298, -0.20518437893285105, -0.18314037673796216, 0.15660208140616305, -0.10997938050422817, -0.22875847694619247, 0.4727968988008797, 0.18559988413839315, 0.1755654749382908, 0.1066437511908589, 0.16435372860481343, 0.20441774705735347, 0.15311050686674813, 0.02517196611734107, 0.09344422549474984, 0.21861487813293934, 0.012952535141569873, -0.25720213286816335, -0.1075020635034889, 0.2718080072275673]
|
1,803.05814
|
Theory and Algorithms for Forecasting Time Series
|
We present data-dependent learning bounds for the general scenario of
non-stationary non-mixing stochastic processes. Our learning guarantees are
expressed in terms of a data-dependent measure of sequential complexity and a
discrepancy measure that can be estimated from data under some mild
assumptions. We also also provide novel analysis of stable time series
forecasting algorithm using this new notion of discrepancy that we introduce.
We use our learning bounds to devise new algorithms for non-stationary time
series forecasting for which we report some preliminary experimental results.
|
cs.LG
|
we present datadependent learning bounds for the general scenario of nonstationary nonmixing stochastic processes our learning guarantees are expressed in terms of a datadependent measure of sequential complexity and a discrepancy measure that can be estimated from data under some mild assumptions we also also provide novel analysis of stable time series forecasting algorithm using this new notion of discrepancy that we introduce we use our learning bounds to devise new algorithms for nonstationary time series forecasting for which we report some preliminary experimental results
|
[['we', 'present', 'datadependent', 'learning', 'bounds', 'for', 'the', 'general', 'scenario', 'of', 'nonstationary', 'nonmixing', 'stochastic', 'processes', 'our', 'learning', 'guarantees', 'are', 'expressed', 'in', 'terms', 'of', 'a', 'datadependent', 'measure', 'of', 'sequential', 'complexity', 'and', 'a', 'discrepancy', 'measure', 'that', 'can', 'be', 'estimated', 'from', 'data', 'under', 'some', 'mild', 'assumptions', 'we', 'also', 'also', 'provide', 'novel', 'analysis', 'of', 'stable', 'time', 'series', 'forecasting', 'algorithm', 'using', 'this', 'new', 'notion', 'of', 'discrepancy', 'that', 'we', 'introduce', 'we', 'use', 'our', 'learning', 'bounds', 'to', 'devise', 'new', 'algorithms', 'for', 'nonstationary', 'time', 'series', 'forecasting', 'for', 'which', 'we', 'report', 'some', 'preliminary', 'experimental', 'results']]
|
[-0.07622959586956045, 0.04291590640102239, -0.14147285174797564, 0.13273090993410305, -0.094388831604053, -0.1370327480027781, 0.1096580376930754, 0.40976979798253843, -0.2802368846448029, -0.2933682023164104, 0.12185248795978944, -0.1752035060130498, -0.20847570703447085, 0.2551426138071453, -0.1405041330767905, 0.10737806789248305, 0.10452919170698699, -0.016413623836535194, -0.09236788933767992, -0.26892351462944025, 0.3158188043490929, 0.05339002431753804, 0.2639852111939998, 0.03631902504369945, 0.1078688238048926, -0.035966040500823186, -0.05105573169010527, 0.014508105551495272, -0.17781803462301682, 0.16085880364784422, 0.26691115979269586, 0.23335306690457988, 0.3169271544279421, -0.4173788178492995, -0.1965762565843761, 0.13661131228813353, 0.11038488969720407, 0.08578136435244232, -0.11907133055741297, -0.28390865207594984, 0.08316137047265382, -0.1408854630392264, -0.05287485883352073, -0.2156705211628886, -0.04775890643324922, 0.01270545687088195, -0.3664963923285113, 0.09519137182916679, 0.07773335361853242, 0.05340500530951163, -0.07573665289536995, -0.1126905299599885, 0.13912887250292388, 0.08682127612478593, 0.08426158868652933, -0.01801466149661471, 0.07349587688770365, -0.03694671979447936, -0.19500165280392942, 0.30806644737501354, -0.14323213506380425, -0.20367603237905046, 0.16883617510252139, -0.10451831767225966, -0.25601150293779723, 0.0749061415081515, 0.2742852685206077, 0.1489272540763897, -0.18953594690298334, 0.04054475267184898, -0.10297610696186038, 0.12324562987641377, 0.01844222165972871, 0.05085898384465562, 0.08858302237246843, 0.21575182826422593, 0.08443902345264659, 0.1631442175424822, -0.0901811771806987, -0.09048892546664267, -0.34859746521448387, -0.14288736369241686, -0.14690485579126022, -0.01399454212446204, -0.163936294324744, -0.1643591352217995, 0.3756321209044579, 0.23641260161667185, 0.21210864156703738, 0.16683835662380955, 0.30226778786848574, 0.14662191676359404, -0.016545704365981854, 0.1113135348950677, 0.18334353298346018, 0.053864224309868675, 0.07793778179980376, -0.16405726368539036, 0.13554298198946257, 0.048302570051130124]
|
1,803.05815
|
OFDM-Autoencoder for End-to-End Learning of Communications Systems
|
We extend the idea of end-to-end learning of communications systems through
deep neural network (NN)-based autoencoders to orthogonal frequency division
multiplexing (OFDM) with cyclic prefix (CP). Our implementation has the same
benefits as a conventional OFDM system, namely singletap equalization and
robustness against sampling synchronization errors, which turned out to be one
of the major challenges in previous single-carrier implementations. This
enables reliable communication over multipath channels and makes the
communication scheme suitable for commodity hardware with imprecise
oscillators. We show that the proposed scheme can be realized with
state-of-the-art deep learning software libraries as transmitter and receiver
solely consist of differentiable layers required for gradient-based training.
We compare the performance of the autoencoder-based system against that of a
state-of-the-art OFDM baseline over frequency-selective fading channels.
Finally, the impact of a non-linear amplifier is investigated and we show that
the autoencoder inherently learns how to deal with such hardware impairments.
|
cs.IT eess.SP math.IT
|
we extend the idea of endtoend learning of communications systems through deep neural network nnbased autoencoders to orthogonal frequency division multiplexing ofdm with cyclic prefix cp our implementation has the same benefits as a conventional ofdm system namely singletap equalization and robustness against sampling synchronization errors which turned out to be one of the major challenges in previous singlecarrier implementations this enables reliable communication over multipath channels and makes the communication scheme suitable for commodity hardware with imprecise oscillators we show that the proposed scheme can be realized with stateoftheart deep learning software libraries as transmitter and receiver solely consist of differentiable layers required for gradientbased training we compare the performance of the autoencoderbased system against that of a stateoftheart ofdm baseline over frequencyselective fading channels finally the impact of a nonlinear amplifier is investigated and we show that the autoencoder inherently learns how to deal with such hardware impairments
|
[['we', 'extend', 'the', 'idea', 'of', 'endtoend', 'learning', 'of', 'communications', 'systems', 'through', 'deep', 'neural', 'network', 'nnbased', 'autoencoders', 'to', 'orthogonal', 'frequency', 'division', 'multiplexing', 'ofdm', 'with', 'cyclic', 'prefix', 'cp', 'our', 'implementation', 'has', 'the', 'same', 'benefits', 'as', 'a', 'conventional', 'ofdm', 'system', 'namely', 'singletap', 'equalization', 'and', 'robustness', 'against', 'sampling', 'synchronization', 'errors', 'which', 'turned', 'out', 'to', 'be', 'one', 'of', 'the', 'major', 'challenges', 'in', 'previous', 'singlecarrier', 'implementations', 'this', 'enables', 'reliable', 'communication', 'over', 'multipath', 'channels', 'and', 'makes', 'the', 'communication', 'scheme', 'suitable', 'for', 'commodity', 'hardware', 'with', 'imprecise', 'oscillators', 'we', 'show', 'that', 'the', 'proposed', 'scheme', 'can', 'be', 'realized', 'with', 'stateoftheart', 'deep', 'learning', 'software', 'libraries', 'as', 'transmitter', 'and', 'receiver', 'solely', 'consist', 'of', 'differentiable', 'layers', 'required', 'for', 'gradientbased', 'training', 'we', 'compare', 'the', 'performance', 'of', 'the', 'autoencoderbased', 'system', 'against', 'that', 'of', 'a', 'stateoftheart', 'ofdm', 'baseline', 'over', 'frequencyselective', 'fading', 'channels', 'finally', 'the', 'impact', 'of', 'a', 'nonlinear', 'amplifier', 'is', 'investigated', 'and', 'we', 'show', 'that', 'the', 'autoencoder', 'inherently', 'learns', 'how', 'to', 'deal', 'with', 'such', 'hardware', 'impairments']]
|
[-0.2248782377575602, -0.004415841540321708, -0.04620215696437905, -0.012762401425279677, -0.09408798011640708, -0.28763717125790816, 0.05034302432322875, 0.487868690614899, -0.28574655822167794, -0.2280367611674592, 0.0975649819864581, -0.20209583365125583, -0.23107774746914705, 0.20802240072283895, -0.16465785237494857, 0.10953453872352839, 0.11024885090378424, -0.015339714735746383, -0.08692589863824347, -0.29430708804167804, 0.2473377851303667, 0.07785065302896935, 0.3679606450349093, -0.03907565552741289, 0.1423733597404013, -0.009305720767006278, -0.013264053243522842, -0.09116109461290761, -0.010717958167612476, 0.07296463135940333, 0.35931555228928724, 0.20230284604709595, 0.2919839230924845, -0.40856554987529914, -0.2773382283995549, 0.0981417177307109, 0.18500509752503908, 0.08952134508096303, -0.022561409526194134, -0.31514242886876065, 0.10610333622743685, -0.27385741015721576, 0.02419027090538293, -0.07044999917969108, -0.09460556423912446, 0.05807883739471435, -0.31968107003097734, -0.012596670556813478, 0.04480880567881589, 0.04926920325960964, 0.01977703906906148, -0.12757178008245926, 0.05112334562620769, 0.11933017669556041, -0.007025637628200154, 0.005293133452845117, 0.1139549595847105, -0.073848034623079, -0.16155792244399586, 0.35073293986264614, -0.0660760626270591, -0.21851737055772294, 0.18209343549795448, 0.006978676662159463, -0.09420521840453148, 0.1168427021165068, 0.23697220384143292, 0.006508934618905187, -0.16369135305828725, 0.012381167798303068, 0.03957771516560266, 0.21734033258166163, 0.07425606239587068, 0.12574703018181027, 0.1351770736540978, 0.2604913220057885, 0.09537471267084281, 0.14315879424257824, -0.13743067005028328, -0.12111222431684533, -0.17737624963745474, -0.09280701434239745, -0.18371174747978028, -0.017773796875650685, -0.08123262566165067, -0.11524851602502167, 0.3874807106068571, 0.23232510613587995, 0.0989371068069401, 0.14373088701240097, 0.46113552001615365, 0.04988940380125617, 0.14086009841722746, 0.12795203093594562, 0.19375546991980325, 0.09485350981354713, 0.12417370197363198, -0.22601991647854447, 0.04938915491104126, -0.03330028890632093]
|
1,803.05816
|
Reduction type of smooth quartics
|
Let $C/K$ be a smooth plane quartic over a discrete valuation field. We
characterize the type of reduction (i.e. smooth plane quartic, hyperelliptic
genus 3 curve or bad) over $K$ in terms of the existence of a special plane
quartic model and, over $\bar{K}$, in terms of the valuations of certain
algebraic invariants of $C$ when the characteristic of the residue field is not
$2,\,3,\,5$ or $7$. On the way, we gather several results of general interest
on geometric invariant theory over an arbitrary ring $R$ in the spirit of
(Seshadri 1977). For instance when $R$ is a discrete valuation ring, we show
the existence of a homogeneous system of parameters over $R$. We exhibit
explicit ones for ternary quartic forms under the action of $\textrm{SL}_{3,R}$
depending only on the characteristic $p$ of the residue field. We illustrate
our results with the case of Picard curves for which we give simple criteria
for the type of reduction.
|
math.NT math.AG
|
let ck be a smooth plane quartic over a discrete valuation field we characterize the type of reduction ie smooth plane quartic hyperelliptic genus 3 curve or bad over k in terms of the existence of a special plane quartic model and over bark in terms of the valuations of certain algebraic invariants of c when the characteristic of the residue field is not 235 or 7 on the way we gather several results of general interest on geometric invariant theory over an arbitrary ring r in the spirit of seshadri 1977 for instance when r is a discrete valuation ring we show the existence of a homogeneous system of parameters over r we exhibit explicit ones for ternary quartic forms under the action of textrmsl_3r depending only on the characteristic p of the residue field we illustrate our results with the case of picard curves for which we give simple criteria for the type of reduction
|
[['let', 'ck', 'be', 'a', 'smooth', 'plane', 'quartic', 'over', 'a', 'discrete', 'valuation', 'field', 'we', 'characterize', 'the', 'type', 'of', 'reduction', 'ie', 'smooth', 'plane', 'quartic', 'hyperelliptic', 'genus', '3', 'curve', 'or', 'bad', 'over', 'k', 'in', 'terms', 'of', 'the', 'existence', 'of', 'a', 'special', 'plane', 'quartic', 'model', 'and', 'over', 'bark', 'in', 'terms', 'of', 'the', 'valuations', 'of', 'certain', 'algebraic', 'invariants', 'of', 'c', 'when', 'the', 'characteristic', 'of', 'the', 'residue', 'field', 'is', 'not', '235', 'or', '7', 'on', 'the', 'way', 'we', 'gather', 'several', 'results', 'of', 'general', 'interest', 'on', 'geometric', 'invariant', 'theory', 'over', 'an', 'arbitrary', 'ring', 'r', 'in', 'the', 'spirit', 'of', 'seshadri', '1977', 'for', 'instance', 'when', 'r', 'is', 'a', 'discrete', 'valuation', 'ring', 'we', 'show', 'the', 'existence', 'of', 'a', 'homogeneous', 'system', 'of', 'parameters', 'over', 'r', 'we', 'exhibit', 'explicit', 'ones', 'for', 'ternary', 'quartic', 'forms', 'under', 'the', 'action', 'of', 'textrmsl_3r', 'depending', 'only', 'on', 'the', 'characteristic', 'p', 'of', 'the', 'residue', 'field', 'we', 'illustrate', 'our', 'results', 'with', 'the', 'case', 'of', 'picard', 'curves', 'for', 'which', 'we', 'give', 'simple', 'criteria', 'for', 'the', 'type', 'of', 'reduction']]
|
[-0.215084903251129, 0.030714008647546275, -0.10553815951332068, 0.02284205997010502, -0.0707949186878231, -0.14725121147393322, 0.010780782333593098, 0.30933177407281714, -0.2820699496481281, -0.22921856935733023, 0.06819385088433941, -0.22402710555485475, -0.1416680513857267, 0.27904405035988955, -0.0741280485474421, -0.041470731429469124, -0.017034757818178967, 0.13021187682916674, -0.0978102262194555, -0.3654964840612732, 0.36710535848023707, -0.0464857483539396, 0.17659208162102658, 0.057139156038875885, 0.08892906378680028, 0.06496224458215949, 0.014393988731078422, 0.018607532522694852, -0.16995857804655456, 0.1320571458976095, 0.25619316993591684, 0.06628614601989587, 0.1970191991601426, -0.3524162402818314, -0.18568255187859997, 0.19643236301187875, 0.08974385034376517, 0.054139998367575645, 0.010163576071275972, -0.21518615914586312, 0.13942102446722296, -0.14374181557482538, -0.16979700901235142, -0.059654165002612926, 0.07518502913985568, 0.05878631974785374, -0.2812900716253819, 0.004898205142802535, 0.08696378107803564, 0.20848615741572127, -0.0823628252464681, -0.12145436494626129, -0.017738744946351897, 0.021583042918325353, 0.01673792785806701, 0.038845331620019026, 0.072048900819097, -0.1343809358495025, -0.08552369955801763, 0.37591697696226245, -0.11104622686681791, -0.20377198543745834, 0.13955862563437757, -0.15182334390015173, -0.0818764424094787, 0.1720128247345714, 0.15789143136965159, 0.1748775301907116, -0.029017644424852617, 0.21131641075622518, -0.10691158916466893, 0.12315952759952499, 0.09460054473199236, -0.014290670477352344, 0.15562896174975696, 0.051362263734261386, 0.07742018123397616, 0.13711746440280992, -0.04902179609351338, -0.08764490984284724, -0.39160246479038435, -0.17149019541923338, -0.11755212347056024, 0.13350726279158828, -0.14602594687414985, -0.1684447125336215, 0.4499693379546396, 0.03531412176119211, 0.19896777443220623, 0.0969726504834118, 0.20530551876156375, 0.09027219340817119, 0.036137825051017175, 0.049491905530419156, 0.143045642072908, 0.14583757711359516, -0.011653036276887482, -0.16669628630057934, 0.011740906516281076, 0.10177727307204922]
|
1,803.05817
|
2D Reconstruction of Small Intestine's Interior Wall
|
Examining and interpreting of a large number of wireless endoscopic images
from the gastrointestinal tract is a tiresome task for physicians. A practical
solution is to automatically construct a two dimensional representation of the
gastrointestinal tract for easy inspection. However, little has been done on
wireless endoscopic image stitching, let alone systematic investigation. The
proposed new wireless endoscopic image stitching method consists of two main
steps to improve the accuracy and efficiency of image registration. First, the
keypoints are extracted by Principle Component Analysis and Scale Invariant
Feature Transform (PCA-SIFT) algorithm and refined with Maximum Likelihood
Estimation SAmple Consensus (MLESAC) outlier removal to find the most reliable
keypoints. Second, the optimal transformation parameters obtained from first
step are fed to the Normalised Mutual Information (NMI) algorithm as an initial
solution. With modified Marquardt-Levenberg search strategy in a multiscale
framework, the NMI can find the optimal transformation parameters in the
shortest time. The proposed methodology has been tested on two different
datasets - one with real wireless endoscopic images and another with images
obtained from Micro-Ball (a new wireless cubic endoscopy system with six image
sensors). The results have demonstrated the accuracy and robustness of the
proposed methodology both visually and quantitatively.
|
eess.SP cs.CV eess.IV
|
examining and interpreting of a large number of wireless endoscopic images from the gastrointestinal tract is a tiresome task for physicians a practical solution is to automatically construct a two dimensional representation of the gastrointestinal tract for easy inspection however little has been done on wireless endoscopic image stitching let alone systematic investigation the proposed new wireless endoscopic image stitching method consists of two main steps to improve the accuracy and efficiency of image registration first the keypoints are extracted by principle component analysis and scale invariant feature transform pcasift algorithm and refined with maximum likelihood estimation sample consensus mlesac outlier removal to find the most reliable keypoints second the optimal transformation parameters obtained from first step are fed to the normalised mutual information nmi algorithm as an initial solution with modified marquardtlevenberg search strategy in a multiscale framework the nmi can find the optimal transformation parameters in the shortest time the proposed methodology has been tested on two different datasets one with real wireless endoscopic images and another with images obtained from microball a new wireless cubic endoscopy system with six image sensors the results have demonstrated the accuracy and robustness of the proposed methodology both visually and quantitatively
|
[['examining', 'and', 'interpreting', 'of', 'a', 'large', 'number', 'of', 'wireless', 'endoscopic', 'images', 'from', 'the', 'gastrointestinal', 'tract', 'is', 'a', 'tiresome', 'task', 'for', 'physicians', 'a', 'practical', 'solution', 'is', 'to', 'automatically', 'construct', 'a', 'two', 'dimensional', 'representation', 'of', 'the', 'gastrointestinal', 'tract', 'for', 'easy', 'inspection', 'however', 'little', 'has', 'been', 'done', 'on', 'wireless', 'endoscopic', 'image', 'stitching', 'let', 'alone', 'systematic', 'investigation', 'the', 'proposed', 'new', 'wireless', 'endoscopic', 'image', 'stitching', 'method', 'consists', 'of', 'two', 'main', 'steps', 'to', 'improve', 'the', 'accuracy', 'and', 'efficiency', 'of', 'image', 'registration', 'first', 'the', 'keypoints', 'are', 'extracted', 'by', 'principle', 'component', 'analysis', 'and', 'scale', 'invariant', 'feature', 'transform', 'pcasift', 'algorithm', 'and', 'refined', 'with', 'maximum', 'likelihood', 'estimation', 'sample', 'consensus', 'mlesac', 'outlier', 'removal', 'to', 'find', 'the', 'most', 'reliable', 'keypoints', 'second', 'the', 'optimal', 'transformation', 'parameters', 'obtained', 'from', 'first', 'step', 'are', 'fed', 'to', 'the', 'normalised', 'mutual', 'information', 'nmi', 'algorithm', 'as', 'an', 'initial', 'solution', 'with', 'modified', 'marquardtlevenberg', 'search', 'strategy', 'in', 'a', 'multiscale', 'framework', 'the', 'nmi', 'can', 'find', 'the', 'optimal', 'transformation', 'parameters', 'in', 'the', 'shortest', 'time', 'the', 'proposed', 'methodology', 'has', 'been', 'tested', 'on', 'two', 'different', 'datasets', 'one', 'with', 'real', 'wireless', 'endoscopic', 'images', 'and', 'another', 'with', 'images', 'obtained', 'from', 'microball', 'a', 'new', 'wireless', 'cubic', 'endoscopy', 'system', 'with', 'six', 'image', 'sensors', 'the', 'results', 'have', 'demonstrated', 'the', 'accuracy', 'and', 'robustness', 'of', 'the', 'proposed', 'methodology', 'both', 'visually', 'and', 'quantitatively']]
|
[-0.08503317298618178, -0.039378677765991854, -0.11310477679929824, 0.019792447949825848, -0.08026257725101589, -0.1628960517346197, -0.0023379337165485782, 0.4082256972666849, -0.2451786401990073, -0.34694886789538987, 0.12161241541143866, -0.27356154408286976, -0.18583254802228674, 0.21816044980494617, -0.1271389178614969, 0.12757603348667737, 0.1401804589529328, 0.03496954136712448, -0.03631992258490796, -0.24857182287419602, 0.2779854038484432, 0.029766580855785894, 0.3570467879626957, 0.0053820278797520864, 0.1324679421587152, 0.02137747626198541, -0.0841236994542692, -0.027186823456883807, -0.08609789427899316, 0.15478560579751577, 0.2912029921961239, 0.17126588622311387, 0.2855643798469514, -0.37569423859948875, -0.20603395418410525, 0.08687840944609893, 0.13902765017494484, 0.08791857130353062, -0.07605230035425783, -0.3550495956740744, 0.11167301952857808, -0.13223406930600629, -0.029366670833808384, -0.09525943764953444, -0.02135981695057569, -0.018352073095478875, -0.3098261000796547, 0.05660745939770968, -0.004636327022223303, 0.08701663946397224, -0.07907335998887564, -0.08569153396798024, -0.01518068216114097, 0.20733038734805387, 0.027786779757541825, 0.05837998494238777, 0.14674919813890294, -0.13761432106810684, -0.09637755210225371, 0.3663704810654603, -0.009217841022406813, -0.1900831623055185, 0.14834787627578083, -0.059183425064373595, -0.11063121241484272, 0.1583208594055194, 0.17501903526120946, 0.12520748703518345, -0.18753976012913387, -0.025913494417791345, -0.009939779217832434, 0.17263571454240434, 0.07351076537341371, -0.032088244875164956, 0.16476149588048003, 0.19178006881469775, 0.04646800731564045, 0.15334904454719409, -0.18337221314591653, -0.027516938673289786, -0.21351166170203897, -0.1496732731581415, -0.22729143605515512, -0.027972730769548888, -0.13891050573812175, -0.11068314368905131, 0.41661175481767065, 0.1910475622256863, 0.2015751146464396, 0.07042875318896726, 0.3739286177593099, 0.052270492286478086, 0.10128792747855186, 0.038112178312196175, 0.20204070440569163, 0.0631301056648023, 0.08114405190524868, -0.1880764756917535, 0.04821740627775754, 0.11219370998513085]
|
1,803.05818
|
Extracting the quantum metric tensor through periodic driving
|
We propose a generic protocol to experimentally measure the quantum metric
tensor, a fundamental geometric property of quantum states. Our method is based
on the observation that the excitation rate of a quantum state directly relates
to components of the quantum metric upon applying a proper time-periodic
modulation. We discuss the applicability of this scheme to generic two-level
systems, where the Hamiltonian's parameters can be externally tuned, and also
to the context of Bloch bands associated with lattice systems. As an
illustration, we extract the quantum metric of the multi-band Hofstadter model.
Moreover, we demonstrate how this method can be used to directly probe the
spread functional, a quantity which sets the lower bound on the spread of
Wannier functions and signals phase transitions. Our proposal offers a
universal probe for quantum geometry, which could be readily applied in a wide
range of physical settings, ranging from circuit-QED systems to ultracold
atomic gases.
|
cond-mat.mes-hall cond-mat.quant-gas quant-ph
|
we propose a generic protocol to experimentally measure the quantum metric tensor a fundamental geometric property of quantum states our method is based on the observation that the excitation rate of a quantum state directly relates to components of the quantum metric upon applying a proper timeperiodic modulation we discuss the applicability of this scheme to generic twolevel systems where the hamiltonians parameters can be externally tuned and also to the context of bloch bands associated with lattice systems as an illustration we extract the quantum metric of the multiband hofstadter model moreover we demonstrate how this method can be used to directly probe the spread functional a quantity which sets the lower bound on the spread of wannier functions and signals phase transitions our proposal offers a universal probe for quantum geometry which could be readily applied in a wide range of physical settings ranging from circuitqed systems to ultracold atomic gases
|
[['we', 'propose', 'a', 'generic', 'protocol', 'to', 'experimentally', 'measure', 'the', 'quantum', 'metric', 'tensor', 'a', 'fundamental', 'geometric', 'property', 'of', 'quantum', 'states', 'our', 'method', 'is', 'based', 'on', 'the', 'observation', 'that', 'the', 'excitation', 'rate', 'of', 'a', 'quantum', 'state', 'directly', 'relates', 'to', 'components', 'of', 'the', 'quantum', 'metric', 'upon', 'applying', 'a', 'proper', 'timeperiodic', 'modulation', 'we', 'discuss', 'the', 'applicability', 'of', 'this', 'scheme', 'to', 'generic', 'twolevel', 'systems', 'where', 'the', 'hamiltonians', 'parameters', 'can', 'be', 'externally', 'tuned', 'and', 'also', 'to', 'the', 'context', 'of', 'bloch', 'bands', 'associated', 'with', 'lattice', 'systems', 'as', 'an', 'illustration', 'we', 'extract', 'the', 'quantum', 'metric', 'of', 'the', 'multiband', 'hofstadter', 'model', 'moreover', 'we', 'demonstrate', 'how', 'this', 'method', 'can', 'be', 'used', 'to', 'directly', 'probe', 'the', 'spread', 'functional', 'a', 'quantity', 'which', 'sets', 'the', 'lower', 'bound', 'on', 'the', 'spread', 'of', 'wannier', 'functions', 'and', 'signals', 'phase', 'transitions', 'our', 'proposal', 'offers', 'a', 'universal', 'probe', 'for', 'quantum', 'geometry', 'which', 'could', 'be', 'readily', 'applied', 'in', 'a', 'wide', 'range', 'of', 'physical', 'settings', 'ranging', 'from', 'circuitqed', 'systems', 'to', 'ultracold', 'atomic', 'gases']]
|
[-0.12362586910185082, 0.1549099994842549, -0.12334409061198433, 0.05169937210203167, -0.045931439107174385, -0.1479207741833152, 0.08109252172175284, 0.35558704214073183, -0.29834657570870676, -0.2602836764904555, 0.053862624746150785, -0.22269677345220948, -0.18027863062589483, 0.25408515579286306, -0.03212098121411758, 0.0882924345521305, 0.028064445711921876, -1.5036111661032134e-05, -0.07190364941778088, -0.2109044755282477, 0.3407523723043733, 0.04042490761425784, 0.3100206741783159, 0.07526153248196066, 0.09710198988395384, 0.00017073918499198613, 0.07740308953680439, 0.008869664719194368, -0.1301241845117058, 0.151835459086274, 0.2548488365650615, 0.09137979232222207, 0.20583229156491023, -0.3849611159876671, -0.25467163422966704, 0.08840181628619534, 0.12735784613204743, 0.19048243995871567, -0.014031528405467767, -0.32954177558056863, 0.037430094536759106, -0.19015958434080377, -0.1384619975955609, -0.14011107453409874, -0.020521083579237383, -0.004787609737451657, -0.2669815282075623, 0.027389852173156197, 0.01596916835371624, 0.031113688930643882, -0.06645553434888522, -0.028253271302293523, 0.03271598780065093, 0.10616205729927648, -0.05666929843388133, 0.04487274632807456, 0.16214097481147915, -0.08432205790102945, -0.15001812578541124, 0.3994236441109987, -0.09037529663152359, -0.21412773180168634, 0.19997067343644506, -0.09446533100703865, -0.08269791351098664, 0.05240657865343725, 0.19494866347701284, 0.12328855815157903, -0.1494260416457466, 0.08102888813519278, -0.03347333456432215, 0.20611196707894575, 0.0004285936201222582, 0.10946578766657587, 0.22024359853993006, 0.11397872374581745, 0.07064041026423379, 0.17414630202993484, -0.09429938761628495, -0.13681449898780365, -0.2786089556570944, -0.16087531553295265, -0.24184806251995802, 0.07102761157252674, -0.08066808042444404, -0.1702905224143144, 0.44415749571661545, 0.1752796950019604, 0.2021698673180414, -0.021927077425156836, 0.2678622410577886, 0.15642952042543543, 0.05272843995591126, 0.0074268633049297955, 0.23443392255446976, 0.1475625019870528, 0.05033910848516849, -0.23608135619334683, 0.012836071948697365, 0.04610631999626658]
|
1,803.05819
|
Outperformance and Tracking: Dynamic Asset Allocation for Active and
Passive Portfolio Management
|
Portfolio management problems are often divided into two types: active and
passive, where the objective is to outperform and track a preselected
benchmark, respectively. Here, we formulate and solve a dynamic asset
allocation problem that combines these two objectives in a unified framework.
We look to maximize the expected growth rate differential between the wealth of
the investor's portfolio and that of a performance benchmark while penalizing
risk-weighted deviations from a given tracking portfolio. Using stochastic
control techniques, we provide explicit closed-form expressions for the optimal
allocation and we show how the optimal strategy can be related to the growth
optimal portfolio. The admissible benchmarks encompass the class of
functionally generated portfolios (FGPs), which include the market portfolio,
as the only requirement is that they depend only on the prevailing asset
values. Finally, some numerical experiments are presented to illustrate the
risk-reward profile of the optimal allocation.
|
q-fin.PM
|
portfolio management problems are often divided into two types active and passive where the objective is to outperform and track a preselected benchmark respectively here we formulate and solve a dynamic asset allocation problem that combines these two objectives in a unified framework we look to maximize the expected growth rate differential between the wealth of the investors portfolio and that of a performance benchmark while penalizing riskweighted deviations from a given tracking portfolio using stochastic control techniques we provide explicit closedform expressions for the optimal allocation and we show how the optimal strategy can be related to the growth optimal portfolio the admissible benchmarks encompass the class of functionally generated portfolios fgps which include the market portfolio as the only requirement is that they depend only on the prevailing asset values finally some numerical experiments are presented to illustrate the riskreward profile of the optimal allocation
|
[['portfolio', 'management', 'problems', 'are', 'often', 'divided', 'into', 'two', 'types', 'active', 'and', 'passive', 'where', 'the', 'objective', 'is', 'to', 'outperform', 'and', 'track', 'a', 'preselected', 'benchmark', 'respectively', 'here', 'we', 'formulate', 'and', 'solve', 'a', 'dynamic', 'asset', 'allocation', 'problem', 'that', 'combines', 'these', 'two', 'objectives', 'in', 'a', 'unified', 'framework', 'we', 'look', 'to', 'maximize', 'the', 'expected', 'growth', 'rate', 'differential', 'between', 'the', 'wealth', 'of', 'the', 'investors', 'portfolio', 'and', 'that', 'of', 'a', 'performance', 'benchmark', 'while', 'penalizing', 'riskweighted', 'deviations', 'from', 'a', 'given', 'tracking', 'portfolio', 'using', 'stochastic', 'control', 'techniques', 'we', 'provide', 'explicit', 'closedform', 'expressions', 'for', 'the', 'optimal', 'allocation', 'and', 'we', 'show', 'how', 'the', 'optimal', 'strategy', 'can', 'be', 'related', 'to', 'the', 'growth', 'optimal', 'portfolio', 'the', 'admissible', 'benchmarks', 'encompass', 'the', 'class', 'of', 'functionally', 'generated', 'portfolios', 'fgps', 'which', 'include', 'the', 'market', 'portfolio', 'as', 'the', 'only', 'requirement', 'is', 'that', 'they', 'depend', 'only', 'on', 'the', 'prevailing', 'asset', 'values', 'finally', 'some', 'numerical', 'experiments', 'are', 'presented', 'to', 'illustrate', 'the', 'riskreward', 'profile', 'of', 'the', 'optimal', 'allocation']]
|
[-0.07514657205200359, 0.004017339776946257, -0.09458386315964162, 0.1080730313144956, -0.11428246158813063, -0.16630131560250197, 0.08299229561338482, 0.41433228822807744, -0.30400976553967557, -0.28592231177265615, 0.17768832581988472, -0.2639268872468439, -0.1557046152230301, 0.22484427357526265, -0.11900344361991251, 0.07634116451773068, 0.038463178285308285, -0.02137853743086652, 0.013314382646755916, -0.30079479526396685, 0.28946519582787505, 0.0366039589407841, 0.32456713004280136, 0.011048304140312623, 0.15269882867530576, -0.020816489341684733, -0.04159877194834822, 0.04983673324132313, -0.1519404870285218, 0.15681454943005022, 0.3242301358059942, 0.17428656268469378, 0.36526655661554575, -0.4121551651201428, -0.13692849563683498, 0.12309063506657131, 0.07372992779491054, 0.052197917087851986, -0.022344782780249896, -0.21164644447040476, 0.07153321288793973, -0.18537642857480846, -0.038988022529201145, -0.08222929272188308, -0.03657167720008794, 0.07182719648460066, -0.365370124246772, 0.04874240072310124, -0.009121554957906881, -0.028173839528279454, -0.11872272216714919, -0.1641205972529412, -0.006167446910595037, 0.16504764248144954, 0.1005851003031999, -0.07633351082658421, 0.17074530787625644, -0.12043003520126173, -0.18843618906039286, 0.3761246227404128, -0.04004765273118073, -0.23276279403585687, 0.11314248857215965, -0.07411289583231412, -0.12225001440893808, 0.1159647430695134, 0.23426800668686118, 0.10401413347316932, -0.18792178693278502, 0.03115561272596545, -0.07155143222069904, 0.16692488941312958, 0.05197582890722926, 0.03380832913306172, 0.16416970956496485, 0.18286297569523424, 0.1622316574642741, 0.148522776860125, -0.03345954516258295, -0.18735328198040593, -0.29147433453201227, -0.11162457890985597, -0.13941295039584886, 0.003996288910992954, -0.12372078896172851, -0.1330365345411462, 0.39767552881616436, 0.16530623641949505, 0.1168854967627215, 0.12339545507063732, 0.2694594414700588, 0.13679355071548194, 0.0002131640663121712, 0.12449336060552463, 0.20860036445501715, -0.008331437463224674, 0.08233595331524793, -0.2425266605178341, 0.11169320522896843, 0.013981575806535883]
|
1,803.0582
|
RUSSE: The First Workshop on Russian Semantic Similarity
|
The paper gives an overview of the Russian Semantic Similarity Evaluation
(RUSSE) shared task held in conjunction with the Dialogue 2015 conference.
There exist a lot of comparative studies on semantic similarity, yet no
analysis of such measures was ever performed for the Russian language.
Exploring this problem for the Russian language is even more interesting,
because this language has features, such as rich morphology and free word
order, which make it significantly different from English, German, and other
well-studied languages. We attempt to bridge this gap by proposing a shared
task on the semantic similarity of Russian nouns. Our key contribution is an
evaluation methodology based on four novel benchmark datasets for the Russian
language. Our analysis of the 105 submissions from 19 teams reveals that
successful approaches for English, such as distributional and skip-gram models,
are directly applicable to Russian as well. On the one hand, the best results
in the contest were obtained by sophisticated supervised models that combine
evidence from different sources. On the other hand, completely unsupervised
approaches, such as a skip-gram model estimated on a large-scale corpus, were
able score among the top 5 systems.
|
cs.CL
|
the paper gives an overview of the russian semantic similarity evaluation russe shared task held in conjunction with the dialogue 2015 conference there exist a lot of comparative studies on semantic similarity yet no analysis of such measures was ever performed for the russian language exploring this problem for the russian language is even more interesting because this language has features such as rich morphology and free word order which make it significantly different from english german and other wellstudied languages we attempt to bridge this gap by proposing a shared task on the semantic similarity of russian nouns our key contribution is an evaluation methodology based on four novel benchmark datasets for the russian language our analysis of the 105 submissions from 19 teams reveals that successful approaches for english such as distributional and skipgram models are directly applicable to russian as well on the one hand the best results in the contest were obtained by sophisticated supervised models that combine evidence from different sources on the other hand completely unsupervised approaches such as a skipgram model estimated on a largescale corpus were able score among the top 5 systems
|
[['the', 'paper', 'gives', 'an', 'overview', 'of', 'the', 'russian', 'semantic', 'similarity', 'evaluation', 'russe', 'shared', 'task', 'held', 'in', 'conjunction', 'with', 'the', 'dialogue', '2015', 'conference', 'there', 'exist', 'a', 'lot', 'of', 'comparative', 'studies', 'on', 'semantic', 'similarity', 'yet', 'no', 'analysis', 'of', 'such', 'measures', 'was', 'ever', 'performed', 'for', 'the', 'russian', 'language', 'exploring', 'this', 'problem', 'for', 'the', 'russian', 'language', 'is', 'even', 'more', 'interesting', 'because', 'this', 'language', 'has', 'features', 'such', 'as', 'rich', 'morphology', 'and', 'free', 'word', 'order', 'which', 'make', 'it', 'significantly', 'different', 'from', 'english', 'german', 'and', 'other', 'wellstudied', 'languages', 'we', 'attempt', 'to', 'bridge', 'this', 'gap', 'by', 'proposing', 'a', 'shared', 'task', 'on', 'the', 'semantic', 'similarity', 'of', 'russian', 'nouns', 'our', 'key', 'contribution', 'is', 'an', 'evaluation', 'methodology', 'based', 'on', 'four', 'novel', 'benchmark', 'datasets', 'for', 'the', 'russian', 'language', 'our', 'analysis', 'of', 'the', '105', 'submissions', 'from', '19', 'teams', 'reveals', 'that', 'successful', 'approaches', 'for', 'english', 'such', 'as', 'distributional', 'and', 'skipgram', 'models', 'are', 'directly', 'applicable', 'to', 'russian', 'as', 'well', 'on', 'the', 'one', 'hand', 'the', 'best', 'results', 'in', 'the', 'contest', 'were', 'obtained', 'by', 'sophisticated', 'supervised', 'models', 'that', 'combine', 'evidence', 'from', 'different', 'sources', 'on', 'the', 'other', 'hand', 'completely', 'unsupervised', 'approaches', 'such', 'as', 'a', 'skipgram', 'model', 'estimated', 'on', 'a', 'largescale', 'corpus', 'were', 'able', 'score', 'among', 'the', 'top', '5', 'systems']]
|
[-0.023763666095481695, -0.007386278918497019, -0.0758156134759223, 0.11763806184416783, -0.1536260973858206, -0.1403437253136776, 0.06142584221302777, 0.39901232289052324, -0.22530210824027708, -0.38742407904447695, 0.06726380994077771, -0.33658927592393745, -0.14382577767767207, 0.2449707298404782, -0.0791487202661014, 0.027071528793557693, 0.1385554719195505, 0.07220683565461322, -0.03187727725966588, -0.25873978807541886, 0.33656401131179575, 0.05095199069964062, 0.35805106832596817, 0.01764889871579056, 0.10318983493274764, -0.053441296727396545, -0.10849577536267277, -0.019469599271389214, -0.07659054026781202, 0.17252384284449937, 0.35090244325344283, 0.19332905110756032, 0.3118890442517831, -0.3603715022143565, -0.18810760863615494, 0.03911494799080844, 0.07965636996699399, 0.08102947656612071, -0.028983116466444796, -0.3728536364671431, 0.024055594302664855, -0.18280097615267885, 0.049911578994636475, -0.08953560718188161, 0.031285162263942, -0.02168079098796864, -0.17506116737280727, 0.035738371966994906, 0.09770544940716047, 0.13717603760428335, -0.04192907832268822, -0.1851867770849678, 0.028434045978601236, 0.19388974685172894, 0.07482233479018569, 0.08234475144234142, 0.0786583061060427, -0.11795595840085298, -0.1793365835310205, 0.42426806888297985, -0.08608062042009183, -0.18085324551885654, 0.26186690219849545, -0.03238825498663477, -0.21034764979328763, 0.024793520966838848, 0.19748204605175967, 0.09297938689001296, -0.19194169205760486, 0.038672633281921186, -0.09913282341624022, 0.25470313206315043, 0.09609368589804752, -0.03408614570875407, 0.2067128252694506, 0.24254398585640286, -0.020704235616875323, 0.12467791732388402, -0.06697889639395534, -0.08693432420933325, -0.21050479746374645, -0.1351976935604685, -0.155901565718293, -0.033699187423151575, -0.07070869007860127, -0.13132348410926123, 0.39386156276848755, 0.20424246891940895, 0.1445290468780226, 0.03518308609858842, 0.29390364345163106, 0.007507062579909535, 0.093779465640699, 0.07424116749193911, 0.17570719947842392, -0.020886351484315176, 0.1573644212349073, -0.1224760193190856, 0.1091131178466113, 0.062484083756020194]
|
1,803.05821
|
Thermodynamics in the NC disc
|
We study the thermodynamics of a scalar field on a noncommutative disc
implementing the boundary as the limit case of an interaction with an
appropriately chosen confining background. We explicitly obtain expressions for
thermodynamic potentials of gases of particles obeying different statistics. In
order to do that, we derive an asymptotic expansion for the density of the
zeros of Laguerre polynomials. As a result we prove that the Bose-Einstein
condensation in the noncommutative disc does not take place.
|
hep-th math-ph math.MP
|
we study the thermodynamics of a scalar field on a noncommutative disc implementing the boundary as the limit case of an interaction with an appropriately chosen confining background we explicitly obtain expressions for thermodynamic potentials of gases of particles obeying different statistics in order to do that we derive an asymptotic expansion for the density of the zeros of laguerre polynomials as a result we prove that the boseeinstein condensation in the noncommutative disc does not take place
|
[['we', 'study', 'the', 'thermodynamics', 'of', 'a', 'scalar', 'field', 'on', 'a', 'noncommutative', 'disc', 'implementing', 'the', 'boundary', 'as', 'the', 'limit', 'case', 'of', 'an', 'interaction', 'with', 'an', 'appropriately', 'chosen', 'confining', 'background', 'we', 'explicitly', 'obtain', 'expressions', 'for', 'thermodynamic', 'potentials', 'of', 'gases', 'of', 'particles', 'obeying', 'different', 'statistics', 'in', 'order', 'to', 'do', 'that', 'we', 'derive', 'an', 'asymptotic', 'expansion', 'for', 'the', 'density', 'of', 'the', 'zeros', 'of', 'laguerre', 'polynomials', 'as', 'a', 'result', 'we', 'prove', 'that', 'the', 'boseeinstein', 'condensation', 'in', 'the', 'noncommutative', 'disc', 'does', 'not', 'take', 'place']]
|
[-0.14983572001354054, 0.13563679477393192, -0.1254997783794235, 0.07607523920850302, -0.0244188087586409, -0.08497812168505521, 0.0049441771295208195, 0.3113452462383952, -0.1900819735452294, -0.2246962844226987, 0.047453886575590916, -0.25244263444657034, -0.10588560520838468, 0.13799902616600052, -0.032080566218027316, 0.020956472111627076, -0.030666020701830395, 0.06726151839710581, -0.09909093733996344, -0.24300909985621005, 0.36560281147010243, 0.039490092235306896, 0.21292022815069708, 0.06991931692195627, 0.09258308720130187, 0.019039042104477398, 0.040605690192956574, -0.021160068997862533, -0.2021327064298347, 0.05607893310624581, 0.18930243136053784, 0.054771866532973945, 0.22091212899734577, -0.4515952618362812, -0.21070128195704177, 0.15078093075097945, 0.21101915568280488, 0.11672216478902368, -0.03620895819637017, -0.24138077682493111, -0.01392183370458392, -0.1834746423201301, -0.21504010175330898, -0.10402074947845764, -0.0032326854057968236, 0.05057565196572492, -0.3108291115301351, 0.05765190238180833, 0.1213145260937894, 0.06092956672924069, -0.10034046804484649, -0.0634959867128577, 0.017787384352861688, 0.10433052513055885, 0.03616240772251517, -0.02337197959721566, 0.13395630489461696, -0.16186972431993732, -0.05997002566791474, 0.38252090715253967, -0.11566530325217173, -0.23272656011753357, 0.1431466596117482, -0.1959892723064583, -0.14874461613213405, 0.07291190564417495, 0.16666619530923737, 0.12917344373626968, -0.1407584925301564, 0.13759386842736068, -0.0696448437236727, 0.13949994074228483, 0.11563676704640667, 0.016302272987862427, 0.2431360985725545, 0.04514478015092512, 0.038148922454685166, 0.18941894807637885, -0.044067015775885336, -0.1528219968223801, -0.37843993866744524, -0.18578476210435232, -0.21474815649577442, 0.08720041454179385, -0.15464460638423377, -0.24589940769454607, 0.33530315643367475, 0.1523042814925504, 0.21205112683133054, 0.0772418488497631, 0.2312331955688886, 0.18791361035814938, 0.028852519997132894, 0.0429741182209303, 0.23240291500368562, 0.1717899041250348, 0.09444225104883887, -0.2045825024624952, -0.03972248453646898, 0.13462223971370035]
|
1,803.05822
|
Comments on the entropic gravity proposal
|
Explicit tests are presented of the conjectured entropic origin of the
gravitational force. The gravitational force on a test particle in the vicinity
of the horizon of a large Schwarzschild black hole in arbitrary spacetime
dimensions is obtained as entropic force. The same conclusion can be reached
for the cases of a large electrically charged black hole and a large slowly
rotating Kerr black hole. The generalization along the same lines to a test
mass in the field of an arbitrary spherical star is also studied and found not
to be possible. Our results thus reinforce the argument that the entropic
gravity proposal cannot account for the gravitational force in generic
situations.
|
gr-qc hep-th
|
explicit tests are presented of the conjectured entropic origin of the gravitational force the gravitational force on a test particle in the vicinity of the horizon of a large schwarzschild black hole in arbitrary spacetime dimensions is obtained as entropic force the same conclusion can be reached for the cases of a large electrically charged black hole and a large slowly rotating kerr black hole the generalization along the same lines to a test mass in the field of an arbitrary spherical star is also studied and found not to be possible our results thus reinforce the argument that the entropic gravity proposal cannot account for the gravitational force in generic situations
|
[['explicit', 'tests', 'are', 'presented', 'of', 'the', 'conjectured', 'entropic', 'origin', 'of', 'the', 'gravitational', 'force', 'the', 'gravitational', 'force', 'on', 'a', 'test', 'particle', 'in', 'the', 'vicinity', 'of', 'the', 'horizon', 'of', 'a', 'large', 'schwarzschild', 'black', 'hole', 'in', 'arbitrary', 'spacetime', 'dimensions', 'is', 'obtained', 'as', 'entropic', 'force', 'the', 'same', 'conclusion', 'can', 'be', 'reached', 'for', 'the', 'cases', 'of', 'a', 'large', 'electrically', 'charged', 'black', 'hole', 'and', 'a', 'large', 'slowly', 'rotating', 'kerr', 'black', 'hole', 'the', 'generalization', 'along', 'the', 'same', 'lines', 'to', 'a', 'test', 'mass', 'in', 'the', 'field', 'of', 'an', 'arbitrary', 'spherical', 'star', 'is', 'also', 'studied', 'and', 'found', 'not', 'to', 'be', 'possible', 'our', 'results', 'thus', 'reinforce', 'the', 'argument', 'that', 'the', 'entropic', 'gravity', 'proposal', 'can', 'not', 'account', 'for', 'the', 'gravitational', 'force', 'in', 'generic', 'situations']]
|
[-0.13509592101074738, 0.1332739324823271, -0.09174259441319556, 0.12567411146571744, -0.07339053500682709, -0.14019784136403318, -0.009487385251682945, 0.2763105095570198, -0.15668278520069687, -0.29561711608770147, 0.05534479217356549, -0.2505252228316282, -0.08679982087682042, 0.23715241270374704, -0.060056773076695186, 0.034283601419291404, 0.002992707345865469, 0.07076886273813393, -0.06675366320816256, -0.2175460572774827, 0.3322315083124337, 0.10617493943566769, 0.22970533781412955, 0.06668174380551925, 0.10306521887536597, -0.009395269597715706, 0.021521787311618044, 0.12039288423402146, -0.1482267646241724, 0.04159778669740247, 0.1761005432674645, 0.08809785850230703, 0.23274555339156527, -0.4176596402215351, -0.2255828857784514, 0.07256883527028614, 0.14578011486497996, 0.2043782528489828, -0.1025378076839714, -0.3127274570772342, 0.04977214102328351, -0.20014869616020767, -0.20911355972685644, -0.03898866464738297, 0.08513952894404168, 0.003488075729888097, -0.25727774592660435, 0.0946536703244886, 0.10293801142051157, -0.05091693032204804, -0.11153858506421567, -0.016055117806304343, -0.02500740541516086, 0.08941056203937768, 0.14921011397021666, 0.07124813773619852, 0.21073739313256754, -0.09247540184749967, -0.11063771533359469, 0.3763822577893734, -0.058243396834664014, -0.2305081504174566, 0.18428267855856534, -0.23505598428634417, -0.09286290096877291, 0.1104548202819331, 0.1526955441052539, 0.18307209004590339, -0.1529453097990986, 0.09027744764441509, -0.025374112973212206, 0.14813548230887513, 0.13406070101536416, 0.0128252008678474, 0.3637317264765765, 0.07647555698929108, 0.016056625027234244, 0.1654962188449886, -0.09179517488506318, -0.07541299970105571, -0.33794797626447626, -0.17092968807638154, -0.22195024981237618, 0.07237979648372084, -0.1994564679770141, -0.15241555430703854, 0.2905185898349711, 0.10130251444200367, 0.15691755264502974, 0.010286695801908463, 0.26933256579579506, 0.07906683644411706, 0.06740514690517983, 0.07012651726372737, 0.3906472455380501, 0.10839193095906383, 0.09578446039839326, -0.2400694625314111, -0.025577378698286756, 0.07385867817607601]
|
1,803.05823
|
Quantum Field Theory With No Zero-Point Energy
|
Traditional quantum field theory can lead to enormous zero-point energy,
which markedly disagrees with experiment. Unfortunately, this situation is
built into conventional canonical quantization procedures. For identical
classical theories, an alternative quantization procedure, called affine field
quantization, leads to the desirable feature of having a vanishing zero-point
energy. This procedure has been applied to renormalizable and nonrenormalizable
covariant scalar fields, fermion fields, as well as general relativity. Simpler
models are offered as an introduction to affine field quantization.
|
hep-th
|
traditional quantum field theory can lead to enormous zeropoint energy which markedly disagrees with experiment unfortunately this situation is built into conventional canonical quantization procedures for identical classical theories an alternative quantization procedure called affine field quantization leads to the desirable feature of having a vanishing zeropoint energy this procedure has been applied to renormalizable and nonrenormalizable covariant scalar fields fermion fields as well as general relativity simpler models are offered as an introduction to affine field quantization
|
[['traditional', 'quantum', 'field', 'theory', 'can', 'lead', 'to', 'enormous', 'zeropoint', 'energy', 'which', 'markedly', 'disagrees', 'with', 'experiment', 'unfortunately', 'this', 'situation', 'is', 'built', 'into', 'conventional', 'canonical', 'quantization', 'procedures', 'for', 'identical', 'classical', 'theories', 'an', 'alternative', 'quantization', 'procedure', 'called', 'affine', 'field', 'quantization', 'leads', 'to', 'the', 'desirable', 'feature', 'of', 'having', 'a', 'vanishing', 'zeropoint', 'energy', 'this', 'procedure', 'has', 'been', 'applied', 'to', 'renormalizable', 'and', 'nonrenormalizable', 'covariant', 'scalar', 'fields', 'fermion', 'fields', 'as', 'well', 'as', 'general', 'relativity', 'simpler', 'models', 'are', 'offered', 'as', 'an', 'introduction', 'to', 'affine', 'field', 'quantization']]
|
[-0.10197519462030286, 0.1730851326290763, -0.14027828767370337, 0.124354593466239, -0.15814470748106638, -0.24056574226452562, -0.029490183546351127, 0.3328427332274329, -0.23379613974919686, -0.29951680473123604, -0.004881260956888302, -0.19104625296611816, -0.15531391934312594, 0.15781927280701125, -0.1429121239373508, 0.05124582467266382, 0.00393688047113709, 0.07793321511044035, -0.10969912762849186, -0.27614276884840083, 0.29363102570343286, 0.1454218978775689, 0.3540219372042861, -0.030278702517254993, 0.1360296654717949, 0.019823117169718713, 0.006868195906579972, 0.06471996383072856, -0.0661610524313381, 0.07783062135776839, 0.27175681278892555, 0.0620455729136339, 0.2412216256444271, -0.43054392324903834, -0.2637737209144502, 0.11470038282613342, 0.16082242691817766, 0.19140358389659712, -0.05258135912187684, -0.24929911082085127, 0.01987505664445239, -0.20880887739790174, -0.14276009219256827, -0.15941054988891268, -0.05803582910000561, -0.1023872144615803, -0.262132093978998, 0.0780855376386824, 0.040435457140959516, 0.06892981469774476, -0.06141384193585672, -0.16157350768872464, 0.03718799498612778, 0.025088325680161897, 0.10634016826784667, 0.11467288918673801, 0.15243111103056714, -0.118143906028798, -0.1605865468393462, 0.39942868736883, -0.06958698581617612, -0.23973577617643735, 0.16100517472920892, -0.01816800563261868, -0.09436589135871962, 0.11623797541818558, 0.06833029492125393, 0.08994055924286397, -0.16311389037097493, 0.1876531297166366, 0.04943987376128252, 0.07595196412876248, 0.06836799850376944, 0.08821026544841842, 0.2497744177444241, 0.053408819453743026, 0.057718553162442565, 0.08881918958221109, 0.010388665408707963, -0.21558058362167615, -0.34744976699286595, -0.1405654403154189, -0.14200453085299486, 0.14745244222323003, -0.05161311492926101, -0.2188214587393957, 0.34741354709825456, 0.14264650324893852, 0.11734635090359892, 0.026697365222319674, 0.3047812239368422, 0.1813480401581798, 0.14614262352682625, -0.02306315261655702, 0.2646958321118011, 0.20822280468657994, 0.0745814468111628, -0.15142168110021606, -0.09937282791958214, 0.09912808723031329]
|
1,803.05824
|
Testing constitutive relations by running and walking on cornstarch and
water suspensions
|
The ability of a person to run on the surface of a suspension of cornstarch
and water has fascinated scientists and the public alike. However, the
constitutive relation obtained from traditional steady-state rheology of
cornstarch and water suspensions has failed to explain this behavior. In a
previous paper, we presented an averaged constitutive relation for impact
rheology consisting of an effective compressive modulus of a system-spanning
dynamically jammed structure (arXiv:1407:0719). Here, we show that this
constitutive model can be used to quantitatively predict, for example, the
trajectory and penetration depth of the foot of a person walking or running on
cornstarch and water. The ability of the constitutive relation to predict the
material behavior in a case with different forcing conditions and flow geometry
than it was obtained from suggests that the constitutive relation could be
applied more generally. We also present a detailed calculation of the added
mass effect to show that while it may be able to explain some cases of people
running or walking on the surface of cornstarch and water for pool depths $H
>1.2$ m and foot impact velocities $V_I> 1.7$ m/s, it cannot explain
observations of people walking or running on the surface of cornstarch and
water for smaller $H$ or $V_I$.
|
cond-mat.soft
|
the ability of a person to run on the surface of a suspension of cornstarch and water has fascinated scientists and the public alike however the constitutive relation obtained from traditional steadystate rheology of cornstarch and water suspensions has failed to explain this behavior in a previous paper we presented an averaged constitutive relation for impact rheology consisting of an effective compressive modulus of a systemspanning dynamically jammed structure arxiv14070719 here we show that this constitutive model can be used to quantitatively predict for example the trajectory and penetration depth of the foot of a person walking or running on cornstarch and water the ability of the constitutive relation to predict the material behavior in a case with different forcing conditions and flow geometry than it was obtained from suggests that the constitutive relation could be applied more generally we also present a detailed calculation of the added mass effect to show that while it may be able to explain some cases of people running or walking on the surface of cornstarch and water for pool depths h 12 m and foot impact velocities v_i 17 ms it cannot explain observations of people walking or running on the surface of cornstarch and water for smaller h or v_i
|
[['the', 'ability', 'of', 'a', 'person', 'to', 'run', 'on', 'the', 'surface', 'of', 'a', 'suspension', 'of', 'cornstarch', 'and', 'water', 'has', 'fascinated', 'scientists', 'and', 'the', 'public', 'alike', 'however', 'the', 'constitutive', 'relation', 'obtained', 'from', 'traditional', 'steadystate', 'rheology', 'of', 'cornstarch', 'and', 'water', 'suspensions', 'has', 'failed', 'to', 'explain', 'this', 'behavior', 'in', 'a', 'previous', 'paper', 'we', 'presented', 'an', 'averaged', 'constitutive', 'relation', 'for', 'impact', 'rheology', 'consisting', 'of', 'an', 'effective', 'compressive', 'modulus', 'of', 'a', 'systemspanning', 'dynamically', 'jammed', 'structure', 'arxiv14070719', 'here', 'we', 'show', 'that', 'this', 'constitutive', 'model', 'can', 'be', 'used', 'to', 'quantitatively', 'predict', 'for', 'example', 'the', 'trajectory', 'and', 'penetration', 'depth', 'of', 'the', 'foot', 'of', 'a', 'person', 'walking', 'or', 'running', 'on', 'cornstarch', 'and', 'water', 'the', 'ability', 'of', 'the', 'constitutive', 'relation', 'to', 'predict', 'the', 'material', 'behavior', 'in', 'a', 'case', 'with', 'different', 'forcing', 'conditions', 'and', 'flow', 'geometry', 'than', 'it', 'was', 'obtained', 'from', 'suggests', 'that', 'the', 'constitutive', 'relation', 'could', 'be', 'applied', 'more', 'generally', 'we', 'also', 'present', 'a', 'detailed', 'calculation', 'of', 'the', 'added', 'mass', 'effect', 'to', 'show', 'that', 'while', 'it', 'may', 'be', 'able', 'to', 'explain', 'some', 'cases', 'of', 'people', 'running', 'or', 'walking', 'on', 'the', 'surface', 'of', 'cornstarch', 'and', 'water', 'for', 'pool', 'depths', 'h', '12', 'm', 'and', 'foot', 'impact', 'velocities', 'v_i', '17', 'ms', 'it', 'can', 'not', 'explain', 'observations', 'of', 'people', 'walking', 'or', 'running', 'on', 'the', 'surface', 'of', 'cornstarch', 'and', 'water', 'for', 'smaller', 'h', 'or', 'v_i']]
|
[-0.08338256894841414, 0.15867194678881227, -0.12654979063574082, 0.004215790165919595, -0.0949177340584216, -0.13726047200571673, 0.034137722234076, 0.3836459165904671, -0.25398780292464207, -0.33258806604247254, 0.09766405716184706, -0.2790925461315335, -0.1766956293498739, 0.19026505217502396, -0.07041093400486996, 0.062063646068474136, 0.04772888203800763, 0.03777159313680246, -5.1479286272436955e-05, -0.21598074576580145, 0.24373479809862778, 0.01926520835303773, 0.2699115410684429, 0.07733327014676224, 0.10007109684766664, -0.044959808023682296, -0.00131256477190898, 0.08058206022380651, -0.16378000563246622, 0.09088774706693724, 0.20301913936810495, 0.06716389696880644, 0.22425777096046098, -0.4605199163600516, -0.24983268147368037, 0.08582847406908584, 0.11121636379259424, 0.06574557727995292, -0.003960603044736042, -0.2517530513007212, 0.06392458197884619, -0.17059755979929692, -0.14329068329355393, -0.028857980890629385, 0.0711968417980153, -0.002828905250051041, -0.23362504049845695, 0.07688819232946396, 0.03152328285012537, 0.08353191510104807, -0.08783747032822038, -0.09758608144049784, -0.054758460695246376, 0.15102839071858817, 0.08740410998675194, -0.0016610678979374755, 0.18651557568059965, -0.19056506891558037, -0.021466306574159086, 0.4396955258069703, -0.07196984229568233, -0.16920204903894606, 0.23810899819139963, -0.1400654406506174, -0.0803961097912039, 0.13556386589950237, 0.20537212178169284, 0.07742211817262265, -0.13132829001299867, -0.034499044754249135, -0.06799271077034064, 0.1979249503929168, 0.09099197989137163, -0.07187741600836699, 0.21082443377235904, 0.18598843908358292, 0.030568344410522304, 0.10379152523315636, -0.10791125474889458, -0.03457564000452224, -0.23861509416467294, -0.18848355130690975, -0.1435485681017431, 0.042673207728862156, -0.08189437512128979, -0.13280655698103006, 0.35724434605799615, 0.15158927980911147, 0.18164196466722599, 0.09217039518856697, 0.2439534765681646, 0.029329652826373395, 0.08298819171446106, 0.08061692621021603, 0.26941924761432834, 0.08371088339593441, 0.13432788528399003, -0.22874858984757268, 0.10793468805240991, 0.04140693797112013]
|
1,803.05825
|
A Generalized Matching Reconfiguration Problem
|
The goal in {\em reconfiguration problems} is to compute a {\em gradual
transformation} between two feasible solutions of a problem such that all
intermediate solutions are also feasible. In the {\em Matching Reconfiguration
Problem} (MRP), proposed in a pioneering work by Ito et al.\ from 2008, we are
given a graph $G$ and two matchings $M$ and $M'$, and we are asked whether
there is a sequence of matchings in $G$ starting with $M$ and ending at $M'$,
each resulting from the previous one by either adding or deleting a single edge
in $G$, without ever going through a matching of size $< \min\{|M|,|M'|\}-1$.
Ito et al.\ gave a polynomial time algorithm for the problem.
In this paper we introduce a natural generalization of the MRP that depends
on an integer parameter $\Delta \ge 1$: here we are allowed to make $\Delta$
changes to the current solution rather than 1 at each step of the
{transformation procedure}. There is always a valid sequence of matchings
transforming $M$ to $M'$ if $\Delta$ is sufficiently large, and naturally we
would like to minimize $\Delta$. We first devise an optimal transformation
procedure for unweighted matching with $\Delta = 3$, and then extend it to
weighted matchings to achieve asymptotically optimal guarantees. The running
time of these procedures is linear.
We further demonstrate the applicability of this generalized problem to
dynamic graph matchings. In this area, the number of changes to the maintained
matching per update step (the \emph{recourse bound}) is an important quality
measure. Nevertheless, the \emph{worst-case} recourse bounds of almost all
known dynamic matching algorithms are prohibitively large, much larger than the
corresponding update times. We fill in this gap via a surprisingly simple
black-box reduction: Any dynamic algorithm for maintaining [...]
|
cs.DS
|
the goal in em reconfiguration problems is to compute a em gradual transformation between two feasible solutions of a problem such that all intermediate solutions are also feasible in the em matching reconfiguration problem mrp proposed in a pioneering work by ito et al from 2008 we are given a graph g and two matchings m and m and we are asked whether there is a sequence of matchings in g starting with m and ending at m each resulting from the previous one by either adding or deleting a single edge in g without ever going through a matching of size minmm1 ito et al gave a polynomial time algorithm for the problem in this paper we introduce a natural generalization of the mrp that depends on an integer parameter delta ge 1 here we are allowed to make delta changes to the current solution rather than 1 at each step of the transformation procedure there is always a valid sequence of matchings transforming m to m if delta is sufficiently large and naturally we would like to minimize delta we first devise an optimal transformation procedure for unweighted matching with delta 3 and then extend it to weighted matchings to achieve asymptotically optimal guarantees the running time of these procedures is linear we further demonstrate the applicability of this generalized problem to dynamic graph matchings in this area the number of changes to the maintained matching per update step the emphrecourse bound is an important quality measure nevertheless the emphworstcase recourse bounds of almost all known dynamic matching algorithms are prohibitively large much larger than the corresponding update times we fill in this gap via a surprisingly simple blackbox reduction any dynamic algorithm for maintaining
|
[['the', 'goal', 'in', 'em', 'reconfiguration', 'problems', 'is', 'to', 'compute', 'a', 'em', 'gradual', 'transformation', 'between', 'two', 'feasible', 'solutions', 'of', 'a', 'problem', 'such', 'that', 'all', 'intermediate', 'solutions', 'are', 'also', 'feasible', 'in', 'the', 'em', 'matching', 'reconfiguration', 'problem', 'mrp', 'proposed', 'in', 'a', 'pioneering', 'work', 'by', 'ito', 'et', 'al', 'from', '2008', 'we', 'are', 'given', 'a', 'graph', 'g', 'and', 'two', 'matchings', 'm', 'and', 'm', 'and', 'we', 'are', 'asked', 'whether', 'there', 'is', 'a', 'sequence', 'of', 'matchings', 'in', 'g', 'starting', 'with', 'm', 'and', 'ending', 'at', 'm', 'each', 'resulting', 'from', 'the', 'previous', 'one', 'by', 'either', 'adding', 'or', 'deleting', 'a', 'single', 'edge', 'in', 'g', 'without', 'ever', 'going', 'through', 'a', 'matching', 'of', 'size', 'minmm1', 'ito', 'et', 'al', 'gave', 'a', 'polynomial', 'time', 'algorithm', 'for', 'the', 'problem', 'in', 'this', 'paper', 'we', 'introduce', 'a', 'natural', 'generalization', 'of', 'the', 'mrp', 'that', 'depends', 'on', 'an', 'integer', 'parameter', 'delta', 'ge', '1', 'here', 'we', 'are', 'allowed', 'to', 'make', 'delta', 'changes', 'to', 'the', 'current', 'solution', 'rather', 'than', '1', 'at', 'each', 'step', 'of', 'the', 'transformation', 'procedure', 'there', 'is', 'always', 'a', 'valid', 'sequence', 'of', 'matchings', 'transforming', 'm', 'to', 'm', 'if', 'delta', 'is', 'sufficiently', 'large', 'and', 'naturally', 'we', 'would', 'like', 'to', 'minimize', 'delta', 'we', 'first', 'devise', 'an', 'optimal', 'transformation', 'procedure', 'for', 'unweighted', 'matching', 'with', 'delta', '3', 'and', 'then', 'extend', 'it', 'to', 'weighted', 'matchings', 'to', 'achieve', 'asymptotically', 'optimal', 'guarantees', 'the', 'running', 'time', 'of', 'these', 'procedures', 'is', 'linear', 'we', 'further', 'demonstrate', 'the', 'applicability', 'of', 'this', 'generalized', 'problem', 'to', 'dynamic', 'graph', 'matchings', 'in', 'this', 'area', 'the', 'number', 'of', 'changes', 'to', 'the', 'maintained', 'matching', 'per', 'update', 'step', 'the', 'emphrecourse', 'bound', 'is', 'an', 'important', 'quality', 'measure', 'nevertheless', 'the', 'emphworstcase', 'recourse', 'bounds', 'of', 'almost', 'all', 'known', 'dynamic', 'matching', 'algorithms', 'are', 'prohibitively', 'large', 'much', 'larger', 'than', 'the', 'corresponding', 'update', 'times', 'we', 'fill', 'in', 'this', 'gap', 'via', 'a', 'surprisingly', 'simple', 'blackbox', 'reduction', 'any', 'dynamic', 'algorithm', 'for', 'maintaining']]
|
[-0.12722529492161253, 0.09534273798339551, -0.051685345992282555, 0.03456569021616719, -0.10492031451216653, -0.13631050631183347, 0.10955683677498121, 0.3894690146416491, -0.28624024552440175, -0.37783115578553916, 0.10592756074804224, -0.26455284552812053, -0.15319651787520566, 0.14748147862407854, -0.10336589164982893, 0.06611779315086702, 0.06215672053788838, 0.03470779921238621, -0.05370757976514206, -0.2782751018779859, 0.2704611275720884, 0.02628178205136863, 0.21513918372720742, 0.007895471954620198, 0.09334428601555134, 0.031753629770154425, -0.02517565647630315, 0.05350134579072657, -0.1560779238163122, 0.08704997905608666, 0.2550968233161001, 0.14725991146344888, 0.29759464636771826, -0.40634722576819754, -0.12759566043029752, 0.16841144420394444, 0.12949773355003186, 0.10404196882930895, -0.016260675971575995, -0.1896738399514569, 0.13365686699061802, -0.11467754140153136, -0.0795491166208593, -0.02592465026251024, 0.07520963636210613, -0.02410761355994302, -0.3291840275733225, 0.012081971944306196, 0.0846246197574625, -0.01448652845406047, -0.005329490888847463, -0.12620642325399736, 0.028472568470118732, 0.09986351994356435, -0.01862644026252, 0.08164367488209616, 0.0399299313947395, -0.09795174023520463, -0.12935830041635454, 0.3609592883471857, -0.05499463100200764, -0.18715374328261405, 0.14497547582478115, -0.09634107206376237, -0.1507129070602292, 0.13098524114149704, 0.1185308428857018, 0.1763733572808601, -0.11157158455462195, 0.10560927045523401, -0.07284536321500415, 0.14619903050019945, 0.12360147442178507, -0.01321674750039452, 0.13717060206670378, 0.17942308065595858, 0.16800278267463703, 0.13235505252030857, -0.019131969572698467, -0.03715093614157747, -0.27991085787744896, -0.12986355010203593, -0.21446678625795532, 0.042589280250269854, -0.11070573162093449, -0.1601975524728595, 0.36580931562603564, 0.1470961366069356, 0.22530596364747013, 0.1031129915267229, 0.2665619788168554, 0.12154048254566366, 0.013593246552913467, 0.15736252645422755, 0.18083110723007273, 0.07861370897786528, 0.06257835869399601, -0.1871105715415947, 0.06842651377807846, 0.08998964262652423]
|
1,803.05826
|
Actions of skew braces and set-theoretic solutions of the reflection
equation
|
A skew brace, as introduced by L. Guarnieri and L. Vendramin, is a set with
two group structures interacting in a particular way. When one of the group
structures is abelian, one gets back the notion of brace as introduced by W.
Rump. Skew braces can be used to construct solutions of the quantum Yang-Baxter
equation. In this article, we introduce a notion of action of a skew brace, and
show how it leads to solutions of the closely associated reflection equation.
|
math.GR math.QA
|
a skew brace as introduced by l guarnieri and l vendramin is a set with two group structures interacting in a particular way when one of the group structures is abelian one gets back the notion of brace as introduced by w rump skew braces can be used to construct solutions of the quantum yangbaxter equation in this article we introduce a notion of action of a skew brace and show how it leads to solutions of the closely associated reflection equation
|
[['a', 'skew', 'brace', 'as', 'introduced', 'by', 'l', 'guarnieri', 'and', 'l', 'vendramin', 'is', 'a', 'set', 'with', 'two', 'group', 'structures', 'interacting', 'in', 'a', 'particular', 'way', 'when', 'one', 'of', 'the', 'group', 'structures', 'is', 'abelian', 'one', 'gets', 'back', 'the', 'notion', 'of', 'brace', 'as', 'introduced', 'by', 'w', 'rump', 'skew', 'braces', 'can', 'be', 'used', 'to', 'construct', 'solutions', 'of', 'the', 'quantum', 'yangbaxter', 'equation', 'in', 'this', 'article', 'we', 'introduce', 'a', 'notion', 'of', 'action', 'of', 'a', 'skew', 'brace', 'and', 'show', 'how', 'it', 'leads', 'to', 'solutions', 'of', 'the', 'closely', 'associated', 'reflection', 'equation']]
|
[-0.1555206460264943, 0.13646771204544278, -0.11361839345542049, 0.05020506772718097, -0.1325140197920363, -0.16909146973885958, -0.0034227444120915607, 0.3040021015331149, -0.3787100440254662, -0.24304108319395198, 0.10689386659267745, -0.2600339792850541, -0.1979226232165607, 0.1523014585169532, -0.10996436565069527, -0.028866496334624726, 0.012867089440455524, 0.08594957752743872, -0.06176369091802526, -0.2331608530764309, 0.38230955405387934, 0.008069059372845492, 0.1991853176093683, -0.021376358106641506, 0.1278476662615814, -0.01661734100681071, -0.030138204912030387, 0.03120091638709532, -0.15620702456274047, 0.12162405754462248, 0.24107345659285784, 0.06260672363270892, 0.23118880427465205, -0.35261194771382864, -0.1229142006997746, 0.12078626892226323, 0.1315216008430381, 0.0726212563827952, -0.021987031531951775, -0.29013240488427805, 0.10737950208368136, -0.2644944114428831, -0.16352567953205235, -0.04242065104814928, 0.07265730583813132, 0.005092287526988402, -0.21862811157934187, 0.013059797140247211, 0.09783361108246737, 0.010547494504419042, 0.00792306470798283, -0.04269140358537254, -0.025227625539140184, 0.05342452973020888, -0.010688042819000236, 0.02569842688375857, 0.06754722785795243, -0.10015169384877948, -0.1562285317198896, 0.43249722933623846, -0.06382053824164337, -0.2528537821390939, 0.13268824397563572, -0.11105900224888833, -0.09244576685993773, 0.07510865345688128, 0.06766298902788903, 0.0981795823928423, -0.11915020123156066, 0.17436375808419388, -0.13418492141020735, 0.08084753857039642, 0.09700032498505784, 0.004256603739610533, 0.13793152620130014, 0.08341926853342845, 0.07469649734429834, 0.21531746680592756, 0.033196285440126524, -0.048728701136097674, -0.2925576951536464, -0.2042334363795817, -0.07854552287608385, 0.14252308531232724, -0.04023484888212562, -0.1912452922125983, 0.3880410811795694, 0.11135739634358664, 0.2080329608955852, 0.04555440787509901, 0.18177876066666368, 0.11576511544653174, 0.0740929958524137, 0.04780902383599158, 0.0687282063384972, 0.25260820946792456, 0.008118148688681243, -0.1843363697436161, 0.0029678401400948444, 0.19199725842421375]
|
1,803.05827
|
Local Spectral Graph Convolution for Point Set Feature Learning
|
Feature learning on point clouds has shown great promise, with the
introduction of effective and generalizable deep learning frameworks such as
pointnet++. Thus far, however, point features have been abstracted in an
independent and isolated manner, ignoring the relative layout of neighboring
points as well as their features. In the present article, we propose to
overcome this limitation by using spectral graph convolution on a local graph,
combined with a novel graph pooling strategy. In our approach, graph
convolution is carried out on a nearest neighbor graph constructed from a
point's neighborhood, such that features are jointly learned. We replace the
standard max pooling step with a recursive clustering and pooling strategy,
devised to aggregate information from within clusters of nodes that are close
to one another in their spectral coordinates, leading to richer overall feature
descriptors. Through extensive experiments on diverse datasets, we show a
consistent demonstrable advantage for the tasks of both point set
classification and segmentation.
|
cs.CV cs.LG
|
feature learning on point clouds has shown great promise with the introduction of effective and generalizable deep learning frameworks such as pointnet thus far however point features have been abstracted in an independent and isolated manner ignoring the relative layout of neighboring points as well as their features in the present article we propose to overcome this limitation by using spectral graph convolution on a local graph combined with a novel graph pooling strategy in our approach graph convolution is carried out on a nearest neighbor graph constructed from a points neighborhood such that features are jointly learned we replace the standard max pooling step with a recursive clustering and pooling strategy devised to aggregate information from within clusters of nodes that are close to one another in their spectral coordinates leading to richer overall feature descriptors through extensive experiments on diverse datasets we show a consistent demonstrable advantage for the tasks of both point set classification and segmentation
|
[['feature', 'learning', 'on', 'point', 'clouds', 'has', 'shown', 'great', 'promise', 'with', 'the', 'introduction', 'of', 'effective', 'and', 'generalizable', 'deep', 'learning', 'frameworks', 'such', 'as', 'pointnet', 'thus', 'far', 'however', 'point', 'features', 'have', 'been', 'abstracted', 'in', 'an', 'independent', 'and', 'isolated', 'manner', 'ignoring', 'the', 'relative', 'layout', 'of', 'neighboring', 'points', 'as', 'well', 'as', 'their', 'features', 'in', 'the', 'present', 'article', 'we', 'propose', 'to', 'overcome', 'this', 'limitation', 'by', 'using', 'spectral', 'graph', 'convolution', 'on', 'a', 'local', 'graph', 'combined', 'with', 'a', 'novel', 'graph', 'pooling', 'strategy', 'in', 'our', 'approach', 'graph', 'convolution', 'is', 'carried', 'out', 'on', 'a', 'nearest', 'neighbor', 'graph', 'constructed', 'from', 'a', 'points', 'neighborhood', 'such', 'that', 'features', 'are', 'jointly', 'learned', 'we', 'replace', 'the', 'standard', 'max', 'pooling', 'step', 'with', 'a', 'recursive', 'clustering', 'and', 'pooling', 'strategy', 'devised', 'to', 'aggregate', 'information', 'from', 'within', 'clusters', 'of', 'nodes', 'that', 'are', 'close', 'to', 'one', 'another', 'in', 'their', 'spectral', 'coordinates', 'leading', 'to', 'richer', 'overall', 'feature', 'descriptors', 'through', 'extensive', 'experiments', 'on', 'diverse', 'datasets', 'we', 'show', 'a', 'consistent', 'demonstrable', 'advantage', 'for', 'the', 'tasks', 'of', 'both', 'point', 'set', 'classification', 'and', 'segmentation']]
|
[-0.0314441912495619, -0.027211351752769546, -0.10664188579667898, 0.045991331057728464, -0.09416412540020293, -0.14533721005438632, 0.08374847135940017, 0.46774913580303296, -0.3003505272497921, -0.30606311215263493, 0.07264308567794403, -0.30086782606283446, -0.19376479551260528, 0.1343708983578561, -0.09214638634116254, 0.07336028821696088, 0.11293377243304543, 0.05557910946663469, -0.0609658211996814, -0.23787994604464766, 0.3256741841880124, 0.05355310873637333, 0.30815843672567755, -0.004146153423583733, 0.13072100335896109, -0.0069856665495478506, -0.06810349038214153, 0.05991886294909618, -0.056648177247506905, 0.15721712979296246, 0.29479359643044734, 0.1484427770585354, 0.31999287278678434, -0.4207275659431639, -0.2411553786405649, 0.09621289450347235, 0.1737265622055849, 0.08225463999154518, -0.039628156490566106, -0.3144038945389619, 0.10965313448837179, -0.1487134614558129, -0.01130394568467665, -0.14138352640636512, -0.009999175154773882, 0.014305713969435098, -0.2622799528762698, 0.0005015507873086224, 0.0774854924715122, 0.05946077938402458, -0.004002644983010437, -0.14412222501130645, 0.0003642233091541244, 0.1526857567072477, -0.023432370472945413, 0.06594506984081634, 0.13685917698869002, -0.1401552732333939, -0.1401218974658247, 0.3760644789527422, -0.04101304375894555, -0.1829169559589574, 0.19785566415942316, -0.029528067128018202, -0.17334818723904402, 0.0838718605549924, 0.18861334677492766, 0.10258027928721734, -0.16359555402641776, 0.02690611834895545, -0.03835378680963936, 0.14343991274883203, 0.05807670380381293, 0.033941202281546665, 0.22509981638681636, 0.2289033898872868, 0.10641300424445807, 0.14400250349946483, -0.11764340134888138, -0.08927734594633978, -0.23563259520784677, -0.08311744661615142, -0.24942430708287927, -0.025255017867018968, -0.1399902302047689, -0.14841661104143877, 0.41731119083252344, 0.18209756812982777, 0.2637035868938942, 0.06338096186284374, 0.3008092731916867, 0.04190119504776663, 0.14822086143423072, 0.10476463959616779, 0.1778266261062298, 0.03284925064394169, 0.07635468912558739, -0.13820140550107807, 0.0481261346480405, 0.08953551217363034]
|
1,803.05828
|
Non-adiabatic dynamics of electrons and atoms under non-equilibrium
conditions
|
An approach to non-adiabatic dynamics of atoms in molecular and condensed
matter systems under general non-equilibrium conditions is proposed. In this
method interaction between nuclei and electrons is considered explicitly up to
the second order in atomic displacements defined with respect to the mean
atomic trajectory. This method enables one to consider movement of atoms beyond
their simple vibrations. Both electrons and nuclei are treated fully
quantum-mechanically using a combination of path integrals applied to nuclei
and non-equilibrium Green's functions (NEGF) to elections. Our method is
partition-less: initially, the entire system is coupled and assumed to be at
thermal equilibrium. Then, the exact application of the Hubbard-Stratanovich
transformation in mixed real and imaginary times enables us to obtain, without
doing any additional approximations, an exact expression for the reduced
density matrix for nuclei and hence an effective quantum Liouville equation for
them, both containing Gaussian noises. It is shown that the time evolution of
the expectation values for atomic positions is described by an infinite
hierarchy of stochastic differential equations for atomic positions and momenta
and their various fluctuations. The actual dynamics is obtained by sampling all
stochastic trajectories. It is expected that applications of the method may
include photo-induced chemical reactions (e.g. dissociation), electromigration,
atomic manipulation in scanning tunneling microscopy, to name just a few.
|
cond-mat.mtrl-sci physics.chem-ph
|
an approach to nonadiabatic dynamics of atoms in molecular and condensed matter systems under general nonequilibrium conditions is proposed in this method interaction between nuclei and electrons is considered explicitly up to the second order in atomic displacements defined with respect to the mean atomic trajectory this method enables one to consider movement of atoms beyond their simple vibrations both electrons and nuclei are treated fully quantummechanically using a combination of path integrals applied to nuclei and nonequilibrium greens functions negf to elections our method is partitionless initially the entire system is coupled and assumed to be at thermal equilibrium then the exact application of the hubbardstratanovich transformation in mixed real and imaginary times enables us to obtain without doing any additional approximations an exact expression for the reduced density matrix for nuclei and hence an effective quantum liouville equation for them both containing gaussian noises it is shown that the time evolution of the expectation values for atomic positions is described by an infinite hierarchy of stochastic differential equations for atomic positions and momenta and their various fluctuations the actual dynamics is obtained by sampling all stochastic trajectories it is expected that applications of the method may include photoinduced chemical reactions eg dissociation electromigration atomic manipulation in scanning tunneling microscopy to name just a few
|
[['an', 'approach', 'to', 'nonadiabatic', 'dynamics', 'of', 'atoms', 'in', 'molecular', 'and', 'condensed', 'matter', 'systems', 'under', 'general', 'nonequilibrium', 'conditions', 'is', 'proposed', 'in', 'this', 'method', 'interaction', 'between', 'nuclei', 'and', 'electrons', 'is', 'considered', 'explicitly', 'up', 'to', 'the', 'second', 'order', 'in', 'atomic', 'displacements', 'defined', 'with', 'respect', 'to', 'the', 'mean', 'atomic', 'trajectory', 'this', 'method', 'enables', 'one', 'to', 'consider', 'movement', 'of', 'atoms', 'beyond', 'their', 'simple', 'vibrations', 'both', 'electrons', 'and', 'nuclei', 'are', 'treated', 'fully', 'quantummechanically', 'using', 'a', 'combination', 'of', 'path', 'integrals', 'applied', 'to', 'nuclei', 'and', 'nonequilibrium', 'greens', 'functions', 'negf', 'to', 'elections', 'our', 'method', 'is', 'partitionless', 'initially', 'the', 'entire', 'system', 'is', 'coupled', 'and', 'assumed', 'to', 'be', 'at', 'thermal', 'equilibrium', 'then', 'the', 'exact', 'application', 'of', 'the', 'hubbardstratanovich', 'transformation', 'in', 'mixed', 'real', 'and', 'imaginary', 'times', 'enables', 'us', 'to', 'obtain', 'without', 'doing', 'any', 'additional', 'approximations', 'an', 'exact', 'expression', 'for', 'the', 'reduced', 'density', 'matrix', 'for', 'nuclei', 'and', 'hence', 'an', 'effective', 'quantum', 'liouville', 'equation', 'for', 'them', 'both', 'containing', 'gaussian', 'noises', 'it', 'is', 'shown', 'that', 'the', 'time', 'evolution', 'of', 'the', 'expectation', 'values', 'for', 'atomic', 'positions', 'is', 'described', 'by', 'an', 'infinite', 'hierarchy', 'of', 'stochastic', 'differential', 'equations', 'for', 'atomic', 'positions', 'and', 'momenta', 'and', 'their', 'various', 'fluctuations', 'the', 'actual', 'dynamics', 'is', 'obtained', 'by', 'sampling', 'all', 'stochastic', 'trajectories', 'it', 'is', 'expected', 'that', 'applications', 'of', 'the', 'method', 'may', 'include', 'photoinduced', 'chemical', 'reactions', 'eg', 'dissociation', 'electromigration', 'atomic', 'manipulation', 'in', 'scanning', 'tunneling', 'microscopy', 'to', 'name', 'just', 'a', 'few']]
|
[-0.08600220422630189, 0.1529924717057535, -0.09628676926971551, 0.0832140766810712, -0.003205066868017807, -0.12121928794982119, 0.04512376118644305, 0.3800587544597133, -0.2855007031601552, -0.28188456578909943, 0.018414930079921357, -0.2766746282361931, -0.11032768154486634, 0.1793184381683575, 0.007530672020813519, 0.06258031468213529, 0.0192491601790405, 0.01096305958560185, -0.06204876075099929, -0.225544668205893, 0.27264172987930513, 0.04471480829104419, 0.2467364379144446, 0.04151537254505523, 0.12534896571068438, 0.04029837997869537, 0.02314666639991898, 0.005351366852496371, -0.10226381595034413, 0.10315592338048629, 0.242999762338985, 0.046770714535981556, 0.2521904116955638, -0.47582412271380975, -0.2039799499756622, 0.07809659296294234, 0.14893973493700388, 0.1780040448281431, -0.02394340832607769, -0.2796697152230923, 0.017825041210960114, -0.1549547987039356, -0.17064651393297095, -0.13157278907170553, 0.03367355734937721, 0.04852892627456674, -0.273897233973171, 0.08111928068944542, 0.006482928850110275, 0.03237925187460388, -0.09569346740264101, -0.0768056010239417, -0.004226815931529186, 0.11640891893734483, 0.0019239319029751372, 0.013559174364706484, 0.1959537401691907, -0.09857066879393878, -0.09512607859910026, 0.40805408715473107, -0.04932093289702338, -0.22159375868634218, 0.18863624774719398, -0.12402774901258656, -0.08534152966846402, 0.17473329797050813, 0.11883552380216618, 0.1419550469048166, -0.21395975822600088, 0.08743185014871549, 0.01041524551099563, 0.14699789374976213, 0.07340383868776607, 0.011186565392428613, 0.1644524796315131, 0.11956230415402118, 0.07120279258729338, 0.10422045508716514, -0.06968861523947217, -0.16271221987510756, -0.2732211140532012, -0.14524220886394484, -0.19604526859270496, 0.058094422619669114, -0.05060479273372578, -0.16793003317690347, 0.3540681988363051, 0.12984657047706638, 0.15812154851327823, 0.006796350399747974, 0.31231272010632827, 0.15320514808074762, 0.031902493314528664, 0.032726949478577204, 0.1944542071777741, 0.1772575100206908, 0.07657150847889069, -0.2656115529654791, 0.053471778933372766, 0.060865453546823656]
|
1,803.05829
|
Enriching Frame Representations with Distributionally Induced Senses
|
We introduce a new lexical resource that enriches the Framester knowledge
graph, which links Framnet, WordNet, VerbNet and other resources, with semantic
features from text corpora. These features are extracted from distributionally
induced sense inventories and subsequently linked to the manually-constructed
frame representations to boost the performance of frame disambiguation in
context. Since Framester is a frame-based knowledge graph, which enables
full-fledged OWL querying and reasoning, our resource paves the way for the
development of novel, deeper semantic-aware applications that could benefit
from the combination of knowledge from text and complex symbolic
representations of events and participants. Together with the resource we also
provide the software we developed for the evaluation in the task of Word Frame
Disambiguation (WFD).
|
cs.CL
|
we introduce a new lexical resource that enriches the framester knowledge graph which links framnet wordnet verbnet and other resources with semantic features from text corpora these features are extracted from distributionally induced sense inventories and subsequently linked to the manuallyconstructed frame representations to boost the performance of frame disambiguation in context since framester is a framebased knowledge graph which enables fullfledged owl querying and reasoning our resource paves the way for the development of novel deeper semanticaware applications that could benefit from the combination of knowledge from text and complex symbolic representations of events and participants together with the resource we also provide the software we developed for the evaluation in the task of word frame disambiguation wfd
|
[['we', 'introduce', 'a', 'new', 'lexical', 'resource', 'that', 'enriches', 'the', 'framester', 'knowledge', 'graph', 'which', 'links', 'framnet', 'wordnet', 'verbnet', 'and', 'other', 'resources', 'with', 'semantic', 'features', 'from', 'text', 'corpora', 'these', 'features', 'are', 'extracted', 'from', 'distributionally', 'induced', 'sense', 'inventories', 'and', 'subsequently', 'linked', 'to', 'the', 'manuallyconstructed', 'frame', 'representations', 'to', 'boost', 'the', 'performance', 'of', 'frame', 'disambiguation', 'in', 'context', 'since', 'framester', 'is', 'a', 'framebased', 'knowledge', 'graph', 'which', 'enables', 'fullfledged', 'owl', 'querying', 'and', 'reasoning', 'our', 'resource', 'paves', 'the', 'way', 'for', 'the', 'development', 'of', 'novel', 'deeper', 'semanticaware', 'applications', 'that', 'could', 'benefit', 'from', 'the', 'combination', 'of', 'knowledge', 'from', 'text', 'and', 'complex', 'symbolic', 'representations', 'of', 'events', 'and', 'participants', 'together', 'with', 'the', 'resource', 'we', 'also', 'provide', 'the', 'software', 'we', 'developed', 'for', 'the', 'evaluation', 'in', 'the', 'task', 'of', 'word', 'frame', 'disambiguation', 'wfd']]
|
[-0.04768040098506623, 0.0005960060347221856, -0.08037839364708187, 0.054696499868534885, -0.21613343703982413, -0.09350819689914203, 0.08118423170004135, 0.42348674894907534, -0.31604977048392224, -0.3377251553102436, 0.025868925116717432, -0.2771460244901733, -0.13825237840557328, 0.18142136780178955, -0.12458522377424261, 0.045185791787245654, 0.14681117886848524, 0.08852387743660758, -0.04459867818663136, -0.19603730464387986, 0.34548780613212693, 0.047460636967777185, 0.3323639196813361, 0.018764876923722845, 0.09951589869098483, -0.016081132790726475, -0.1229429608847723, -0.037821023835916005, -0.06996951620435267, 0.24976191461149955, 0.39037808516405076, 0.29453073313029915, 0.28615709701075387, -0.4004127435370261, -0.1849896479318412, 0.02797790627496747, 0.13523570727158943, 0.10846024448784371, -0.023133504648223266, -0.39104052677623224, 0.07955609146967275, -0.205948460711819, 0.0609574348717514, -0.15147100059458843, 0.0009896224523838768, 0.005679776947786156, -0.2557449865624563, 0.010645055384962207, 0.12575439175662512, 0.09041460717303886, -0.04685605304220166, -0.09896007335434358, 0.028833755079067797, 0.198345290723806, 0.01571400191547333, 0.06469544838580629, 0.13237861692447725, -0.17811464191748735, -0.1806883312867254, 0.40572929667094004, -0.053808321396255084, -0.21441307679638585, 0.18978498556101933, -0.019595710290038686, -0.1796883652265319, 0.07093535855205522, 0.17822456765426403, 0.05670750028111486, -0.20722342858043236, 0.02615214749508036, -0.03158210372227905, 0.21491518380064675, 0.09409488573606707, 0.07030531623934069, 0.19543772229216355, 0.2161916517533171, 0.02258450595033156, 0.12310981973418647, -0.0460437475823057, -0.06563501014935379, -0.2422000256080467, -0.15701787505680934, -0.15538666230172682, -0.047156450247121416, -0.09996955907387703, -0.11471981738303971, 0.4017417318163774, 0.21476591878936777, 0.13938329032120797, 0.10367796052860208, 0.2993474386345882, 0.0012418164037820748, 0.13118092448283464, 0.1269141098551062, 0.11585522224553503, -0.007162089897399275, 0.16495241186955673, -0.13060209594276917, 0.07934211656196505, 0.08277066571351427]
|
1,803.0583
|
A policy iteration algorithm for nonzero-sum stochastic impulse games
|
This work presents a novel policy iteration algorithm to tackle nonzero-sum
stochastic impulse games arising naturally in many applications. Despite the
obvious impact of solving such problems, there are no suitable numerical
methods available, to the best of our knowledge. Our method relies on the
recently introduced characterization of the value functions and Nash
equilibrium via a system of quasi-variational inequalities. While our algorithm
is heuristic and we do not provide a convergence analysis, numerical tests show
that it performs convincingly in a wide range of situations, including the only
analytically solvable example available in the literature at the time of
writing.
|
math.OC math.NA
|
this work presents a novel policy iteration algorithm to tackle nonzerosum stochastic impulse games arising naturally in many applications despite the obvious impact of solving such problems there are no suitable numerical methods available to the best of our knowledge our method relies on the recently introduced characterization of the value functions and nash equilibrium via a system of quasivariational inequalities while our algorithm is heuristic and we do not provide a convergence analysis numerical tests show that it performs convincingly in a wide range of situations including the only analytically solvable example available in the literature at the time of writing
|
[['this', 'work', 'presents', 'a', 'novel', 'policy', 'iteration', 'algorithm', 'to', 'tackle', 'nonzerosum', 'stochastic', 'impulse', 'games', 'arising', 'naturally', 'in', 'many', 'applications', 'despite', 'the', 'obvious', 'impact', 'of', 'solving', 'such', 'problems', 'there', 'are', 'no', 'suitable', 'numerical', 'methods', 'available', 'to', 'the', 'best', 'of', 'our', 'knowledge', 'our', 'method', 'relies', 'on', 'the', 'recently', 'introduced', 'characterization', 'of', 'the', 'value', 'functions', 'and', 'nash', 'equilibrium', 'via', 'a', 'system', 'of', 'quasivariational', 'inequalities', 'while', 'our', 'algorithm', 'is', 'heuristic', 'and', 'we', 'do', 'not', 'provide', 'a', 'convergence', 'analysis', 'numerical', 'tests', 'show', 'that', 'it', 'performs', 'convincingly', 'in', 'a', 'wide', 'range', 'of', 'situations', 'including', 'the', 'only', 'analytically', 'solvable', 'example', 'available', 'in', 'the', 'literature', 'at', 'the', 'time', 'of', 'writing']]
|
[-0.09142923704805035, -0.04444659815407267, -0.11528200160839833, 0.06394281199968913, -0.0921899760370234, -0.15780426327175662, 0.08245881299451724, 0.3971383524351005, -0.2655093154148655, -0.3160541008190051, 0.14148677230981527, -0.23012432154592163, -0.2054037502875515, 0.25609200783461955, -0.07425210241904008, 0.10300789166734937, 0.10932321998053322, 0.0023235311396716746, -0.06327159180335573, -0.2688630122301059, 0.2926356686123957, 0.0244628267440324, 0.2569676337024087, 0.06937910045277984, 0.13848964563643962, -0.01252313765158475, -0.0317678284265247, 0.05762047227472067, -0.13015256368581665, 0.09600964133792064, 0.31288636954245613, 0.19861928895389772, 0.3735507829825984, -0.3877037468311541, -0.21224345644598133, 0.13106478190999113, 0.1276091686675357, 0.13860978560257411, -0.08954528313445147, -0.25488024558324146, 0.07430840502767001, -0.15406055601688065, -0.10497451142645349, -0.12761005026507466, -0.03922893077262914, 0.04100276967773086, -0.30529676960306423, 0.0678308776844585, 0.06515938378802008, 0.056900131579609214, -0.05896134353608039, -0.14148804757575156, 0.0691633987966377, 0.10561150209247774, 0.055059513619377026, -0.012553933002374262, 0.10616034430944744, -0.09712614100106864, -0.17094543735113213, 0.3821954029593982, -0.031896836184280214, -0.20037438198307747, 0.20880547239828637, -0.08428946861029402, -0.17195626911501782, 0.13211175929937585, 0.1600798996003897, 0.2025103611807686, -0.15111026265567132, 0.10179182168840449, -0.0925722773387736, 0.15413654112147496, 0.0281226263682851, -0.0039051579158552283, 0.09231990730097774, 0.17776744372631406, 0.12110460316933527, 0.13350491627009914, 0.012328141955567487, -0.1706336556349461, -0.3001869306123505, -0.10291821470280982, -0.19080530463115258, -0.010537931820983752, -0.07705914277061775, -0.16898744827245965, 0.37166280474732905, 0.1982862860073938, 0.12770816948557018, 0.08035088842734694, 0.3316563789792103, 0.12647821398579753, 0.026411795395189057, 0.10986654628433433, 0.22678745574975276, 0.076750055037658, 0.14036027208545848, -0.21239205197814634, 0.10603828595348579, 0.058232374662789056]
|
1,803.05831
|
Technical Uncertainty in Real Options with Learning
|
We introduce a new approach to incorporate uncertainty into the decision to
invest in a commodity reserve. The investment is an irreversible one-off
capital expenditure, after which the investor receives a stream of cashflow
from extracting the commodity and selling it on the spot market. The investor
is exposed to price uncertainty and uncertainty in the amount of available
resources in the reserves (i.e. technical uncertainty). She does, however,
learn about the reserve levels through time, which is a key determinant in the
decision to invest. To model the reserve level uncertainty and how she learns
about the estimates of the commodity in the reserve, we adopt a continuous-time
Markov chain model to value the option to invest in the reserve and investigate
the value that learning has prior to investment.
|
q-fin.MF
|
we introduce a new approach to incorporate uncertainty into the decision to invest in a commodity reserve the investment is an irreversible oneoff capital expenditure after which the investor receives a stream of cashflow from extracting the commodity and selling it on the spot market the investor is exposed to price uncertainty and uncertainty in the amount of available resources in the reserves ie technical uncertainty she does however learn about the reserve levels through time which is a key determinant in the decision to invest to model the reserve level uncertainty and how she learns about the estimates of the commodity in the reserve we adopt a continuoustime markov chain model to value the option to invest in the reserve and investigate the value that learning has prior to investment
|
[['we', 'introduce', 'a', 'new', 'approach', 'to', 'incorporate', 'uncertainty', 'into', 'the', 'decision', 'to', 'invest', 'in', 'a', 'commodity', 'reserve', 'the', 'investment', 'is', 'an', 'irreversible', 'oneoff', 'capital', 'expenditure', 'after', 'which', 'the', 'investor', 'receives', 'a', 'stream', 'of', 'cashflow', 'from', 'extracting', 'the', 'commodity', 'and', 'selling', 'it', 'on', 'the', 'spot', 'market', 'the', 'investor', 'is', 'exposed', 'to', 'price', 'uncertainty', 'and', 'uncertainty', 'in', 'the', 'amount', 'of', 'available', 'resources', 'in', 'the', 'reserves', 'ie', 'technical', 'uncertainty', 'she', 'does', 'however', 'learn', 'about', 'the', 'reserve', 'levels', 'through', 'time', 'which', 'is', 'a', 'key', 'determinant', 'in', 'the', 'decision', 'to', 'invest', 'to', 'model', 'the', 'reserve', 'level', 'uncertainty', 'and', 'how', 'she', 'learns', 'about', 'the', 'estimates', 'of', 'the', 'commodity', 'in', 'the', 'reserve', 'we', 'adopt', 'a', 'continuoustime', 'markov', 'chain', 'model', 'to', 'value', 'the', 'option', 'to', 'invest', 'in', 'the', 'reserve', 'and', 'investigate', 'the', 'value', 'that', 'learning', 'has', 'prior', 'to', 'investment']]
|
[-0.04754345191159207, 0.047968826908196094, -0.0880629811222658, 0.10765185199574859, -0.15348590987570981, -0.15157253346992444, 0.1975067801602924, 0.40965564873154836, -0.3247942393432364, -0.28611974305835847, 0.1894397805000563, -0.3198724245325527, -0.04366074178282541, 0.13942970090567042, -0.1940361133888577, 0.012617051373911267, 0.04952789459178466, 0.06424364510155817, 0.08011500084708723, -0.27856257142506197, 0.2800468963407378, 0.12720170470651324, 0.28702097369059354, 0.022413009022298546, 0.17756109323551636, 0.009533295494980599, 0.007577342013224163, -0.0782991302846611, -0.11904999507327417, 0.18666749260608703, 0.30985144945216997, 0.16487627429176718, 0.45057197773601604, -0.44834937102637673, -0.15864634863456412, 0.15817441529672566, -0.01093486056641768, 0.07791845874064637, 0.04135091907892621, -0.2433028595152361, -0.025958872588621524, -0.26646466328200835, -0.05191118468686881, -0.04619258803578506, 0.010581314677500543, -0.05791451505879438, -0.3254322196003263, 0.01658181041720828, 0.018028101293754033, -0.01528185793689189, -0.05943920256442014, -0.10024664267712763, -0.061707076566819924, 0.20154272950119304, 0.12848813171171447, -0.04094981724811355, 0.18410310516745307, -0.16879577734258794, -0.13555956493977828, 0.3748092868912766, -0.0470637887261296, -0.18428701503586223, 0.05093737452056344, -0.14423663845243118, -0.13222762154955559, 0.10361128689842085, 0.2602098657898889, -0.007707751436933932, -0.20764195605870764, 0.0414162814841101, -0.013638291280460721, 0.23237803992495396, 0.05090986560134374, -0.0402131087950054, 0.195379993622369, 0.2133309957749061, 0.13881805795422605, 0.13251760405779794, -0.061495586197098134, -0.21213709301215716, -0.2374730226961462, -0.15995298938129013, -0.1642025581379741, 0.08128849813671968, -0.09040438441003366, -0.13636403450100745, 0.3437625457753093, 0.24299927784609662, 0.11187192796238961, 0.11371675545513232, 0.3113362066134924, 0.13848170172423124, 0.06759054207541618, 0.13807242887115945, 0.14551921474271035, -0.05905394239052562, 0.16278227277185398, -0.1887507030130755, 0.21505131428520985, -0.025461442539297784]
|
1,803.05832
|
On scalar and vector fields coupled to the energy-momentum tensor
|
We consider theories for scalar and vector fields coupled to the
energy-momentum tensor. Since these fields also carry a non-trivial
energy-momentum tensor, the coupling prescription generates self-interactions.
In analogy with gravity theories, we built the action by means of an iterative
process that leads to an infinite series, which can be resumed as the solution
of a set of differential equations. We show that, in some particular cases, the
equations become algebraic and that is also possible to find solutions in the
form of polynomials. We briefly review the case of the scalar field that has
already been studied in the literature and extend the analysis to the case of
derivative (disformal) couplings. We then explore theories with vector fields,
distinguishing between gauge- and non-gauge-invariant couplings. Interactions
with matter are also considered, taking a scalar field as a proxy for the
matter sector. We also discuss the ambiguity introduced by superpotential
(boundary) terms in the definition of the energy-momentum tensor and use them
to show that it is also possible to generate Galileon-like interactions with
this procedure. We finally use collider and astrophysical observations to set
constraints on the dimensionful coupling which characterises the phenomenology
of these models.
|
hep-th
|
we consider theories for scalar and vector fields coupled to the energymomentum tensor since these fields also carry a nontrivial energymomentum tensor the coupling prescription generates selfinteractions in analogy with gravity theories we built the action by means of an iterative process that leads to an infinite series which can be resumed as the solution of a set of differential equations we show that in some particular cases the equations become algebraic and that is also possible to find solutions in the form of polynomials we briefly review the case of the scalar field that has already been studied in the literature and extend the analysis to the case of derivative disformal couplings we then explore theories with vector fields distinguishing between gauge and nongaugeinvariant couplings interactions with matter are also considered taking a scalar field as a proxy for the matter sector we also discuss the ambiguity introduced by superpotential boundary terms in the definition of the energymomentum tensor and use them to show that it is also possible to generate galileonlike interactions with this procedure we finally use collider and astrophysical observations to set constraints on the dimensionful coupling which characterises the phenomenology of these models
|
[['we', 'consider', 'theories', 'for', 'scalar', 'and', 'vector', 'fields', 'coupled', 'to', 'the', 'energymomentum', 'tensor', 'since', 'these', 'fields', 'also', 'carry', 'a', 'nontrivial', 'energymomentum', 'tensor', 'the', 'coupling', 'prescription', 'generates', 'selfinteractions', 'in', 'analogy', 'with', 'gravity', 'theories', 'we', 'built', 'the', 'action', 'by', 'means', 'of', 'an', 'iterative', 'process', 'that', 'leads', 'to', 'an', 'infinite', 'series', 'which', 'can', 'be', 'resumed', 'as', 'the', 'solution', 'of', 'a', 'set', 'of', 'differential', 'equations', 'we', 'show', 'that', 'in', 'some', 'particular', 'cases', 'the', 'equations', 'become', 'algebraic', 'and', 'that', 'is', 'also', 'possible', 'to', 'find', 'solutions', 'in', 'the', 'form', 'of', 'polynomials', 'we', 'briefly', 'review', 'the', 'case', 'of', 'the', 'scalar', 'field', 'that', 'has', 'already', 'been', 'studied', 'in', 'the', 'literature', 'and', 'extend', 'the', 'analysis', 'to', 'the', 'case', 'of', 'derivative', 'disformal', 'couplings', 'we', 'then', 'explore', 'theories', 'with', 'vector', 'fields', 'distinguishing', 'between', 'gauge', 'and', 'nongaugeinvariant', 'couplings', 'interactions', 'with', 'matter', 'are', 'also', 'considered', 'taking', 'a', 'scalar', 'field', 'as', 'a', 'proxy', 'for', 'the', 'matter', 'sector', 'we', 'also', 'discuss', 'the', 'ambiguity', 'introduced', 'by', 'superpotential', 'boundary', 'terms', 'in', 'the', 'definition', 'of', 'the', 'energymomentum', 'tensor', 'and', 'use', 'them', 'to', 'show', 'that', 'it', 'is', 'also', 'possible', 'to', 'generate', 'galileonlike', 'interactions', 'with', 'this', 'procedure', 'we', 'finally', 'use', 'collider', 'and', 'astrophysical', 'observations', 'to', 'set', 'constraints', 'on', 'the', 'dimensionful', 'coupling', 'which', 'characterises', 'the', 'phenomenology', 'of', 'these', 'models']]
|
[-0.1503218103859002, 0.14317936777278917, -0.08350714506120469, 0.08743492716362336, -0.13189388274901895, -0.11763648852597772, -0.03433957464247472, 0.3315930234249493, -0.24359873056439965, -0.288035008073267, 0.079257041210605, -0.2597515726076307, -0.18910321782841677, 0.14203162918177745, 0.01977789674349355, 0.005415417799594427, 0.010947862431886748, 0.06427947059744085, -0.06965246565364809, -0.26473222108618966, 0.38806986500687823, 0.024726264914874025, 0.21673557514117825, 0.0662404030791926, 0.13558192012803347, -0.023531627199245675, -0.027046939065313025, 0.046556890026772865, -0.12050655171616301, 0.08127041102029534, 0.21320004045288682, 0.11072601235013502, 0.1964060696396939, -0.4164279182676715, -0.21614490045855442, 0.12995013631080662, 0.12633766461107315, 0.13568151848169627, -0.04978976785757983, -0.27512525591876996, 0.05835316349597027, -0.21173767028188314, -0.1219194177920328, -0.14456633262740767, 0.010039354170051714, -0.038493049585300435, -0.2888150944061709, 0.04927721357068889, 0.013949086983109626, -0.0025029358891488023, -0.0792600600527496, -0.07915589429092396, -0.027021638950276556, 0.054899803042938615, 0.14474838012708893, 0.01719129284622731, 0.0844712477774745, -0.19421207371392438, -0.11040469434175809, 0.3927090512494547, -0.12499532142255428, -0.2565063690258698, 0.17093108367936855, -0.12209836245429787, -0.16046663798683444, 0.03367752465466324, 0.160190413190955, 0.12724732690975257, -0.1614986267411197, 0.15941015097037467, -0.030299866758110566, 0.11052292939616518, 0.0624331075608768, 0.03500274485365177, 0.22495781744105947, 0.06954452895319485, 0.03603598983391574, 0.13980386450809115, -0.01241141305945348, -0.11726229609007303, -0.3820158584382046, -0.16140767416653384, -0.1107233134004278, 0.04885898306413149, -0.08675227751805462, -0.15579933690076525, 0.3851769955680621, 0.1974351066517446, 0.17113485187850658, 0.04824315260441955, 0.245140332075993, 0.1405283354266577, 0.09153630447322902, 0.04798206942051007, 0.29043038807779364, 0.19362716120550164, 0.07885343155405024, -0.1950147548923269, -0.044692677271674676, 0.08718848621679677]
|
1,803.05833
|
Rio: A new computational framework for accurate initial data of binary
black holes
|
We present a computational framework (Rio) in the ADM 3+1 approach for
numerical relativity. This work enables us to carry out high resolution
calculations for initial data of two arbitrary black holes. We use the
transverse conformal treatment, the Bowen-York and the puncture methods. For
the numerical solution of the Hamiltonian constraint we use the domain
decomposition and the spectral decomposition of Galerkin-Collocation. The
nonlinear numerical code solves the set of equations for the spectral modes
using the standard Newton-Raphson method, LU decomposition and Gaussian
quadratures. We show the convergence of the Rio code. This code allows for easy
deployment of large calculations. We show how the spin of one of the black
holes is manifest in the conformal factor.
|
gr-qc
|
we present a computational framework rio in the adm 31 approach for numerical relativity this work enables us to carry out high resolution calculations for initial data of two arbitrary black holes we use the transverse conformal treatment the bowenyork and the puncture methods for the numerical solution of the hamiltonian constraint we use the domain decomposition and the spectral decomposition of galerkincollocation the nonlinear numerical code solves the set of equations for the spectral modes using the standard newtonraphson method lu decomposition and gaussian quadratures we show the convergence of the rio code this code allows for easy deployment of large calculations we show how the spin of one of the black holes is manifest in the conformal factor
|
[['we', 'present', 'a', 'computational', 'framework', 'rio', 'in', 'the', 'adm', '31', 'approach', 'for', 'numerical', 'relativity', 'this', 'work', 'enables', 'us', 'to', 'carry', 'out', 'high', 'resolution', 'calculations', 'for', 'initial', 'data', 'of', 'two', 'arbitrary', 'black', 'holes', 'we', 'use', 'the', 'transverse', 'conformal', 'treatment', 'the', 'bowenyork', 'and', 'the', 'puncture', 'methods', 'for', 'the', 'numerical', 'solution', 'of', 'the', 'hamiltonian', 'constraint', 'we', 'use', 'the', 'domain', 'decomposition', 'and', 'the', 'spectral', 'decomposition', 'of', 'galerkincollocation', 'the', 'nonlinear', 'numerical', 'code', 'solves', 'the', 'set', 'of', 'equations', 'for', 'the', 'spectral', 'modes', 'using', 'the', 'standard', 'newtonraphson', 'method', 'lu', 'decomposition', 'and', 'gaussian', 'quadratures', 'we', 'show', 'the', 'convergence', 'of', 'the', 'rio', 'code', 'this', 'code', 'allows', 'for', 'easy', 'deployment', 'of', 'large', 'calculations', 'we', 'show', 'how', 'the', 'spin', 'of', 'one', 'of', 'the', 'black', 'holes', 'is', 'manifest', 'in', 'the', 'conformal', 'factor']]
|
[-0.11455346802249551, 0.003267794585553929, -0.11605296359242251, 0.07463458156077346, -0.0770068575089681, -0.10017120426831146, 0.009745101836354781, 0.3321606870721249, -0.21998134372212613, -0.2949630716893201, 0.11028934785281308, -0.2588263093824935, -0.11233022305726384, 0.19178281447772558, -0.028072322761484733, 0.10989012143885096, 0.10759152676522112, -0.0437383880916362, -0.13935835180648912, -0.22735732333579411, 0.33355417869752274, 0.08955296492980172, 0.27279872722768533, 0.023182417483379444, 0.13019455250760076, 0.03043683820675748, -0.057774210663046686, 0.0008355263465394577, -0.15538700701436028, 0.12659563198297594, 0.21770063972993134, 0.17823420701315626, 0.24819887843138227, -0.4202163519182553, -0.17778469909292957, 0.02367893887955385, 0.13593054306693375, 0.1915843645343557, -0.044279821862195, -0.21617173980145404, 0.09455691036030961, -0.20010892005326847, -0.15485540832936143, -0.13053180812858045, -0.06591620127049586, -0.03732305373220394, -0.2804937221691944, 0.07384022699358563, 0.05455083756241948, 0.004230278143343942, -0.07854151099891168, -0.0868302940808159, -0.002407530371177321, 0.09452196637090916, 0.05754789786490922, -0.00932578631133462, 0.09511525357374921, -0.05450441571495806, -0.10478885339883466, 0.3635918723108868, -0.055213850575576845, -0.25752100833536434, 0.15728768591264572, -0.16513555921264925, -0.14403019067831338, 0.11193039515831818, 0.1722477336821612, 0.19491050373762847, -0.10803558010763178, 0.15343927529029316, -0.009051749160668502, 0.15215150565297034, 0.07749536070041359, -0.025146081407244007, 0.189044927386567, 0.12366246971456955, 0.04766154679624985, 0.14089699261045704, -0.1095170845122387, -0.09272619970142841, -0.3164509471108128, -0.18028502657543868, -0.1795992381249865, 0.05963469586567953, -0.1679116684396528, -0.17171252314195348, 0.42940473520817857, 0.1755308918642792, 0.11275088625649611, 0.06641510321448246, 0.2943846821661888, 0.09591027825675459, 0.04472356543647038, 0.12796303123468533, 0.2222377899258087, 0.14938955540031504, 0.12508810754516161, -0.2810927592780596, -0.08363569169693316, 0.10261318955260018]
|
1,803.05834
|
On-orbit Operations and Offline Data Processing of CALET onboard the ISS
|
The CALorimetric Electron Telescope (CALET), launched for installation on the
International Space Station (ISS) in August, 2015, has been accumulating
scientific data since October, 2015. CALET is intended to perform long-duration
observations of high-energy cosmic rays onboard the ISS. CALET directly
measures the cosmic-ray electron spectrum in the energy range of 1 GeV to 20
TeV with a 2% energy resolution above 30 GeV. In addition, the instrument can
measure the spectrum of gamma rays well into the TeV range, and the spectra of
protons and nuclei up to a PeV.
In order to operate the CALET onboard ISS, JAXA Ground Support Equipment
(JAXA-GSE) and the Waseda CALET Operations Center (WCOC) have been established.
Scientific operations using CALET are planned at WCOC, taking into account
orbital variations of geomagnetic rigidity cutoff. Scheduled command sequences
are used to control the CALET observation modes on orbit. Calibration data
acquisition by, for example, recording pedestal and penetrating particle
events, a low-energy electron trigger mode operating at high geomagnetic
latitude, a low-energy gamma-ray trigger mode operating at low geomagnetic
latitude, and an ultra heavy trigger mode, are scheduled around the ISS orbit
while maintaining maximum exposure to high-energy electrons and other
high-energy shower events by always having the high-energy trigger mode active.
The WCOC also prepares and distributes CALET flight data to collaborators in
Italy and the United States.
As of August 31, 2017, the total observation time is 689 days with a live
time fraction of the total time of approximately 84%. Nearly 450 million events
are collected with a high-energy (E>10 GeV) trigger. By combining all operation
modes with the excellent-quality on-orbit data collected thus far, it is
expected that a five-year observation period will provide a wealth of new and
interesting results.
|
astro-ph.IM physics.ins-det
|
the calorimetric electron telescope calet launched for installation on the international space station iss in august 2015 has been accumulating scientific data since october 2015 calet is intended to perform longduration observations of highenergy cosmic rays onboard the iss calet directly measures the cosmicray electron spectrum in the energy range of 1 gev to 20 tev with a 2 energy resolution above 30 gev in addition the instrument can measure the spectrum of gamma rays well into the tev range and the spectra of protons and nuclei up to a pev in order to operate the calet onboard iss jaxa ground support equipment jaxagse and the waseda calet operations center wcoc have been established scientific operations using calet are planned at wcoc taking into account orbital variations of geomagnetic rigidity cutoff scheduled command sequences are used to control the calet observation modes on orbit calibration data acquisition by for example recording pedestal and penetrating particle events a lowenergy electron trigger mode operating at high geomagnetic latitude a lowenergy gammaray trigger mode operating at low geomagnetic latitude and an ultra heavy trigger mode are scheduled around the iss orbit while maintaining maximum exposure to highenergy electrons and other highenergy shower events by always having the highenergy trigger mode active the wcoc also prepares and distributes calet flight data to collaborators in italy and the united states as of august 31 2017 the total observation time is 689 days with a live time fraction of the total time of approximately 84 nearly 450 million events are collected with a highenergy e10 gev trigger by combining all operation modes with the excellentquality onorbit data collected thus far it is expected that a fiveyear observation period will provide a wealth of new and interesting results
|
[['the', 'calorimetric', 'electron', 'telescope', 'calet', 'launched', 'for', 'installation', 'on', 'the', 'international', 'space', 'station', 'iss', 'in', 'august', '2015', 'has', 'been', 'accumulating', 'scientific', 'data', 'since', 'october', '2015', 'calet', 'is', 'intended', 'to', 'perform', 'longduration', 'observations', 'of', 'highenergy', 'cosmic', 'rays', 'onboard', 'the', 'iss', 'calet', 'directly', 'measures', 'the', 'cosmicray', 'electron', 'spectrum', 'in', 'the', 'energy', 'range', 'of', '1', 'gev', 'to', '20', 'tev', 'with', 'a', '2', 'energy', 'resolution', 'above', '30', 'gev', 'in', 'addition', 'the', 'instrument', 'can', 'measure', 'the', 'spectrum', 'of', 'gamma', 'rays', 'well', 'into', 'the', 'tev', 'range', 'and', 'the', 'spectra', 'of', 'protons', 'and', 'nuclei', 'up', 'to', 'a', 'pev', 'in', 'order', 'to', 'operate', 'the', 'calet', 'onboard', 'iss', 'jaxa', 'ground', 'support', 'equipment', 'jaxagse', 'and', 'the', 'waseda', 'calet', 'operations', 'center', 'wcoc', 'have', 'been', 'established', 'scientific', 'operations', 'using', 'calet', 'are', 'planned', 'at', 'wcoc', 'taking', 'into', 'account', 'orbital', 'variations', 'of', 'geomagnetic', 'rigidity', 'cutoff', 'scheduled', 'command', 'sequences', 'are', 'used', 'to', 'control', 'the', 'calet', 'observation', 'modes', 'on', 'orbit', 'calibration', 'data', 'acquisition', 'by', 'for', 'example', 'recording', 'pedestal', 'and', 'penetrating', 'particle', 'events', 'a', 'lowenergy', 'electron', 'trigger', 'mode', 'operating', 'at', 'high', 'geomagnetic', 'latitude', 'a', 'lowenergy', 'gammaray', 'trigger', 'mode', 'operating', 'at', 'low', 'geomagnetic', 'latitude', 'and', 'an', 'ultra', 'heavy', 'trigger', 'mode', 'are', 'scheduled', 'around', 'the', 'iss', 'orbit', 'while', 'maintaining', 'maximum', 'exposure', 'to', 'highenergy', 'electrons', 'and', 'other', 'highenergy', 'shower', 'events', 'by', 'always', 'having', 'the', 'highenergy', 'trigger', 'mode', 'active', 'the', 'wcoc', 'also', 'prepares', 'and', 'distributes', 'calet', 'flight', 'data', 'to', 'collaborators', 'in', 'italy', 'and', 'the', 'united', 'states', 'as', 'of', 'august', '31', '2017', 'the', 'total', 'observation', 'time', 'is', '689', 'days', 'with', 'a', 'live', 'time', 'fraction', 'of', 'the', 'total', 'time', 'of', 'approximately', '84', 'nearly', '450', 'million', 'events', 'are', 'collected', 'with', 'a', 'highenergy', 'e10', 'gev', 'trigger', 'by', 'combining', 'all', 'operation', 'modes', 'with', 'the', 'excellentquality', 'onorbit', 'data', 'collected', 'thus', 'far', 'it', 'is', 'expected', 'that', 'a', 'fiveyear', 'observation', 'period', 'will', 'provide', 'a', 'wealth', 'of', 'new', 'and', 'interesting', 'results']]
|
[-0.10910716036697624, 0.2562956367057975, -0.07524327008286491, 0.11656876349580772, -0.06737722092819037, -0.09661561155937509, 0.03463100477286692, 0.37968742486231755, -0.18798964883252564, -0.4403793602670905, 0.10287406781531495, -0.34203574287918553, 0.044022624562785495, 0.23823123534910134, -0.018195207955108747, 0.03774628951386047, 0.13826986004642094, -0.020726191870987048, 0.01047900249654453, -0.2213107892813342, 0.15876391246315003, 0.2595594824556934, 0.2555680201128578, 0.015152928526933666, 0.13363720804692195, 0.0299977144063127, -0.055453020579382915, -0.09852216246923086, -0.0669236127215653, 0.031016866388098505, 0.302393941835261, 0.1352523903515248, 0.195180783452492, -0.42060929160571603, -0.17638436254734793, 0.0943587123660513, 0.062156537277284464, -0.07633083386543957, -0.015226255033161983, -0.3416959644673625, 0.03309684480094196, -0.20882009232122478, -0.15708877119888914, 0.025260963769445272, 0.012804238098194927, 0.012172879496978971, -0.2437619588535098, 0.012958192115244552, -0.05235384289173655, 0.09086070360273071, -0.11849701368838497, -0.06604683260957245, -0.02947160997710954, 0.09306655304842731, 0.09898658534722118, 0.07159665760749097, 0.1701738812820016, -0.025790338459450543, -0.13626426072450057, 0.3438575744043596, -0.017831416170439398, 0.01668827533851274, 0.180436082596619, -0.23609054319644607, -0.14400102088176128, 0.24411223773495294, 0.21981079828239874, 0.017251321171594707, -0.17925296502330135, 0.07752475135435412, 0.02332129887347239, 0.19119125643434623, 0.09297145021587817, 0.06000250110931423, 0.2382383552046829, 0.19027877134794835, 0.10474423752263344, 0.03294462708860616, -0.25463841466343085, 0.007879956551833957, -0.311669682951712, -0.0855311562156405, -0.14656706692120577, 0.05169187848756943, 0.010933505792157424, -0.03101653657763058, 0.421669822207251, 0.07363668783444963, 0.15907215219663662, -0.0321939370939314, 0.2996458063264274, 0.043545765822475206, 0.058885931270045454, 0.1039841021148378, 0.3304164449396517, 0.05712414668960264, 0.21474445827779062, -0.1573694455839561, -0.011844442748648968, 0.01258102351372751]
|
1,803.05835
|
Statistical harmonization and uncertainty assessment in the comparison
of satellite and radiosonde climate variables
|
Satellite product validation is key to ensure the delivery of quality
products for climate and weather applications. To do this, a fundamental step
is the comparison with other instruments, such us radiosonde. This is specially
true for Essential Climate Variables such as temperature and humidity. Thanks
to a functional data representation, this paper uses a likelihood based
approach which exploits the measurement uncertainties in a natural way. In
particular the comparison of temperature and humdity radiosonde measurements
collected within RAOB network and the corresponding atmospheric profiles
derived from IASI interferometers aboard of Metop-A and Metop-B satellites is
developed with the aim of understanding the vertical smoothing mismatch
uncertainty. Moreover, conventional RAOB functional data representation is
assessed by means of a comparison with radiosonde reference measurements given
by GRUAN network, which provides high resolution fully traceable radiosouding
profiles. In this way the uncertainty related to coarse vertical resolution, or
sparseness, of conventional RAOB is assessed. It has been found that the
uncertainty of vertical smoothing mismatch averaged along the profile is 0.50 K
for temperature and 0.16 g/kg for water vapour mixing ratio. Moreover the
uncertainty related to RAOB sparseness, averaged along the profile is 0.29 K
for temperature and 0.13 g/kg for water vapour mixing ratio.
|
stat.AP
|
satellite product validation is key to ensure the delivery of quality products for climate and weather applications to do this a fundamental step is the comparison with other instruments such us radiosonde this is specially true for essential climate variables such as temperature and humidity thanks to a functional data representation this paper uses a likelihood based approach which exploits the measurement uncertainties in a natural way in particular the comparison of temperature and humdity radiosonde measurements collected within raob network and the corresponding atmospheric profiles derived from iasi interferometers aboard of metopa and metopb satellites is developed with the aim of understanding the vertical smoothing mismatch uncertainty moreover conventional raob functional data representation is assessed by means of a comparison with radiosonde reference measurements given by gruan network which provides high resolution fully traceable radiosouding profiles in this way the uncertainty related to coarse vertical resolution or sparseness of conventional raob is assessed it has been found that the uncertainty of vertical smoothing mismatch averaged along the profile is 050 k for temperature and 016 gkg for water vapour mixing ratio moreover the uncertainty related to raob sparseness averaged along the profile is 029 k for temperature and 013 gkg for water vapour mixing ratio
|
[['satellite', 'product', 'validation', 'is', 'key', 'to', 'ensure', 'the', 'delivery', 'of', 'quality', 'products', 'for', 'climate', 'and', 'weather', 'applications', 'to', 'do', 'this', 'a', 'fundamental', 'step', 'is', 'the', 'comparison', 'with', 'other', 'instruments', 'such', 'us', 'radiosonde', 'this', 'is', 'specially', 'true', 'for', 'essential', 'climate', 'variables', 'such', 'as', 'temperature', 'and', 'humidity', 'thanks', 'to', 'a', 'functional', 'data', 'representation', 'this', 'paper', 'uses', 'a', 'likelihood', 'based', 'approach', 'which', 'exploits', 'the', 'measurement', 'uncertainties', 'in', 'a', 'natural', 'way', 'in', 'particular', 'the', 'comparison', 'of', 'temperature', 'and', 'humdity', 'radiosonde', 'measurements', 'collected', 'within', 'raob', 'network', 'and', 'the', 'corresponding', 'atmospheric', 'profiles', 'derived', 'from', 'iasi', 'interferometers', 'aboard', 'of', 'metopa', 'and', 'metopb', 'satellites', 'is', 'developed', 'with', 'the', 'aim', 'of', 'understanding', 'the', 'vertical', 'smoothing', 'mismatch', 'uncertainty', 'moreover', 'conventional', 'raob', 'functional', 'data', 'representation', 'is', 'assessed', 'by', 'means', 'of', 'a', 'comparison', 'with', 'radiosonde', 'reference', 'measurements', 'given', 'by', 'gruan', 'network', 'which', 'provides', 'high', 'resolution', 'fully', 'traceable', 'radiosouding', 'profiles', 'in', 'this', 'way', 'the', 'uncertainty', 'related', 'to', 'coarse', 'vertical', 'resolution', 'or', 'sparseness', 'of', 'conventional', 'raob', 'is', 'assessed', 'it', 'has', 'been', 'found', 'that', 'the', 'uncertainty', 'of', 'vertical', 'smoothing', 'mismatch', 'averaged', 'along', 'the', 'profile', 'is', '050', 'k', 'for', 'temperature', 'and', '016', 'gkg', 'for', 'water', 'vapour', 'mixing', 'ratio', 'moreover', 'the', 'uncertainty', 'related', 'to', 'raob', 'sparseness', 'averaged', 'along', 'the', 'profile', 'is', '029', 'k', 'for', 'temperature', 'and', '013', 'gkg', 'for', 'water', 'vapour', 'mixing', 'ratio']]
|
[-0.08794758392602729, 0.09936077073297524, -0.07436899503748585, 0.04325975044468297, -0.04791359500658342, -0.0886329932078089, 0.04943123565863966, 0.39640344301266456, -0.2618817015741002, -0.35573991756904777, 0.1237871274311531, -0.2750898614984506, -0.07638495688822436, 0.18588642870708466, -0.09690771002753346, 0.09586767754540663, 0.07244027037502485, -0.006297965066053381, -0.0651609837946329, -0.1711019970744788, 0.2725729393188967, 0.11923006028823081, 0.32542536039813535, 0.03146229757561316, 0.11937813339083089, -0.017222610823821684, -0.0752445469837432, 0.02974307055779691, -0.15385034263027, 0.12261660950836396, 0.2696344331578718, 0.11098226591532317, 0.22353258754001626, -0.3600900266041507, -0.24011844537969196, 0.07172418319022478, 0.08923171457848442, 0.030811894808974654, -0.01628203884888422, -0.2550247475708747, 0.04684697293771421, -0.15098544343638776, -0.10728710808499313, -0.05095109747565208, 0.014061913033252332, 0.01230507413740849, -0.31261280976671413, 0.09605044151618104, -0.026640528612607968, 0.1287130352239407, -0.056374923777836025, -0.14452544414202, -0.05880724861134835, 0.13200665648623522, 0.017112683477019195, 0.05723831683295357, 0.14651274122239846, -0.05329920270651653, -0.007701600260050291, 0.39702683703427144, -0.12090861193594796, -0.16025083585971253, 0.15677700885594706, -0.13085983293096243, -0.1129735314561777, 0.1325006491425841, 0.1363465192173758, 0.03294666221745275, -0.17834038154884654, 0.02923505060375895, -0.004662287782933285, 0.21140684352826272, 0.09235448657537333, 0.0033529096755630047, 0.19848201160008708, 0.19766971778323808, 0.11547300891037937, 0.0645789965475789, -0.15970000456346764, -0.043940392139238026, -0.23000278034530097, -0.16070725368590683, -0.151017929905729, 0.017062061722274518, -0.10168527380283285, -0.1277845020171959, 0.3538511459025281, 0.1769986407164095, 0.17922805794873808, 0.032624022536638854, 0.3500011027952777, 0.10602025766521044, 0.06314422742032738, 0.031857043833689605, 0.21555502936348264, 0.16791951161257884, 0.11173858565848264, -0.19593164899191862, 0.1331863457462125, 0.0071223200535151495]
|
1,803.05836
|
Asymptotic theory for longitudinal data with missing responses adjusted
by inverse probability weights
|
In this article, we propose a new method for analyzing longitudinal data
which contain responses that are missing at random. This method consists in
solving the generalized estimating equation (GEE) of Liang and Zeger (1986) in
which the incomplete responses are replaced by values adjusted using the
inverse probability weights proposed in Yi, Ma and Carroll (2012). We show that
the root estimator is consistent and asymptotically normal, essentially under
the some conditions on the marginal distribution and the surrogate correlation
matrix as those presented in Xie and Yang (2003) in the case of complete data,
and under minimal assumptions on the missingness probabilities. This method is
applied to a real-life dataset taken from Sommer, Katz and Tarwotjo (1984),
which examines the incidence of respiratory disease in a sample of 250
pre-school age Indonesian children which were examined every 3 months for 18
months, using as covariates the age, gender, and vitamin A deficiency.
|
math.ST stat.TH
|
in this article we propose a new method for analyzing longitudinal data which contain responses that are missing at random this method consists in solving the generalized estimating equation gee of liang and zeger 1986 in which the incomplete responses are replaced by values adjusted using the inverse probability weights proposed in yi ma and carroll 2012 we show that the root estimator is consistent and asymptotically normal essentially under the some conditions on the marginal distribution and the surrogate correlation matrix as those presented in xie and yang 2003 in the case of complete data and under minimal assumptions on the missingness probabilities this method is applied to a reallife dataset taken from sommer katz and tarwotjo 1984 which examines the incidence of respiratory disease in a sample of 250 preschool age indonesian children which were examined every 3 months for 18 months using as covariates the age gender and vitamin a deficiency
|
[['in', 'this', 'article', 'we', 'propose', 'a', 'new', 'method', 'for', 'analyzing', 'longitudinal', 'data', 'which', 'contain', 'responses', 'that', 'are', 'missing', 'at', 'random', 'this', 'method', 'consists', 'in', 'solving', 'the', 'generalized', 'estimating', 'equation', 'gee', 'of', 'liang', 'and', 'zeger', '1986', 'in', 'which', 'the', 'incomplete', 'responses', 'are', 'replaced', 'by', 'values', 'adjusted', 'using', 'the', 'inverse', 'probability', 'weights', 'proposed', 'in', 'yi', 'ma', 'and', 'carroll', '2012', 'we', 'show', 'that', 'the', 'root', 'estimator', 'is', 'consistent', 'and', 'asymptotically', 'normal', 'essentially', 'under', 'the', 'some', 'conditions', 'on', 'the', 'marginal', 'distribution', 'and', 'the', 'surrogate', 'correlation', 'matrix', 'as', 'those', 'presented', 'in', 'xie', 'and', 'yang', '2003', 'in', 'the', 'case', 'of', 'complete', 'data', 'and', 'under', 'minimal', 'assumptions', 'on', 'the', 'missingness', 'probabilities', 'this', 'method', 'is', 'applied', 'to', 'a', 'reallife', 'dataset', 'taken', 'from', 'sommer', 'katz', 'and', 'tarwotjo', '1984', 'which', 'examines', 'the', 'incidence', 'of', 'respiratory', 'disease', 'in', 'a', 'sample', 'of', '250', 'preschool', 'age', 'indonesian', 'children', 'which', 'were', 'examined', 'every', '3', 'months', 'for', '18', 'months', 'using', 'as', 'covariates', 'the', 'age', 'gender', 'and', 'vitamin', 'a', 'deficiency']]
|
[-0.03767432243216271, 0.08710625797534495, -0.0749045060917102, 0.08754102481160848, -0.043017690050190474, -0.12974466957164063, 0.06847313559443684, 0.35422067024160686, -0.19334932535071098, -0.32300336853132333, 0.12700279864400407, -0.2889605022151194, -0.16340389965235994, 0.17424419908206057, -0.13891846163417487, 0.05126435810243909, 0.06960142967352047, 0.018641158774056855, -0.031779957496944594, -0.3212675130842375, 0.2899444062305383, 0.03936207833855102, 0.29627547785031055, -0.007784386257887544, 0.1164827167619175, 0.06660162347058456, -0.07781790900561544, 0.016924182546562423, -0.11352529271790725, 0.09013570135374085, 0.25495423080728336, 0.15571849896067302, 0.2999424912230252, -0.3436403780436319, -0.17818280305938636, 0.08536439161333773, 0.0625642774456555, 0.05606244564105093, -0.019582071531795305, -0.30206758411619444, 0.077494064680745, -0.1765942491615325, -0.09789791413403293, -0.013360552841286157, 0.047882110796552274, -0.002223503363114824, -0.3371268371424449, 0.15438603952198343, 0.032667210952567506, 0.1338032236341022, -0.07097962772963702, -0.19580735924221526, -0.0017914988885761476, 0.08660709751721203, 0.05841202796375976, 0.001222014281095243, 0.05798039678503224, -0.08956031492923454, -0.0980587494198166, 0.3047742930505717, -0.044848447455568055, -0.17389523349793665, 0.14403148543308764, -0.11250082981389235, -0.13632052624293792, 0.0738651120694342, 0.18278606407636522, 0.09605819066290994, -0.20007343517214643, 0.05308036824796361, -0.07747187959091141, 0.11985661310989873, 0.1080169700203293, -0.08803299587719093, 0.10250706886233506, 0.12155795534403106, 0.004218802241048489, 0.09201832152781339, -0.12486836159893987, -0.057046714120124485, -0.27249445304201514, -0.12719199248913712, -0.17848793270516825, 0.04926560781713502, -0.08120752653347486, -0.12976662786312254, 0.420132279225619, 0.16412755215200603, 0.1886760693216952, 0.06036735490707108, 0.20246321606461956, 0.08168814983066731, 0.033510882516994196, 0.10814042569265939, 0.16789313190364816, 0.1160737719180236, 0.09435140957151923, -0.18450991260161734, 0.13302847316026006, 0.053049135976014475]
|
1,803.05837
|
Automated image acquisition for low-dose STEM at atomic resolution
|
Beam damage is a major limitation in electron microscopy that becomes
increasingly severe at higher resolution. One possible route to circumvent
radiation damage, which forms the basis for single-particle electron microscopy
and related techniques, is to distribute the dose over many identical copies of
an object. For the acquisition of low-dose data, ideally no dose should be
applied to the region of interest prior to the acquisition of data. We present
an automated approach that can collect large amounts of data efficiently by
acquiring images in an user-defined area-of-interest with atomic resolution. We
demonstrate that the stage mechanics of the Nion UltraSTEM, combined with an
intelligent algorithm to move the sample, allows the automated acquisition of
atomically resolved images from micron-sized areas of a graphene substrate.
Moving the sample stage automatically in a regular pattern over the
area-of-interest enables the collection of data from pristine sample regions
without exposing them to the electron beam before recording an image.
Therefore, it is possible to obtain data with minimal dose (no prior exposure
from focusing), which is only limited by the minimum signal needed for data
processing. This enables us to prevent beam induced damage in the sample and to
acquire large datasets within a reasonable amount of time.
|
cond-mat.mtrl-sci
|
beam damage is a major limitation in electron microscopy that becomes increasingly severe at higher resolution one possible route to circumvent radiation damage which forms the basis for singleparticle electron microscopy and related techniques is to distribute the dose over many identical copies of an object for the acquisition of lowdose data ideally no dose should be applied to the region of interest prior to the acquisition of data we present an automated approach that can collect large amounts of data efficiently by acquiring images in an userdefined areaofinterest with atomic resolution we demonstrate that the stage mechanics of the nion ultrastem combined with an intelligent algorithm to move the sample allows the automated acquisition of atomically resolved images from micronsized areas of a graphene substrate moving the sample stage automatically in a regular pattern over the areaofinterest enables the collection of data from pristine sample regions without exposing them to the electron beam before recording an image therefore it is possible to obtain data with minimal dose no prior exposure from focusing which is only limited by the minimum signal needed for data processing this enables us to prevent beam induced damage in the sample and to acquire large datasets within a reasonable amount of time
|
[['beam', 'damage', 'is', 'a', 'major', 'limitation', 'in', 'electron', 'microscopy', 'that', 'becomes', 'increasingly', 'severe', 'at', 'higher', 'resolution', 'one', 'possible', 'route', 'to', 'circumvent', 'radiation', 'damage', 'which', 'forms', 'the', 'basis', 'for', 'singleparticle', 'electron', 'microscopy', 'and', 'related', 'techniques', 'is', 'to', 'distribute', 'the', 'dose', 'over', 'many', 'identical', 'copies', 'of', 'an', 'object', 'for', 'the', 'acquisition', 'of', 'lowdose', 'data', 'ideally', 'no', 'dose', 'should', 'be', 'applied', 'to', 'the', 'region', 'of', 'interest', 'prior', 'to', 'the', 'acquisition', 'of', 'data', 'we', 'present', 'an', 'automated', 'approach', 'that', 'can', 'collect', 'large', 'amounts', 'of', 'data', 'efficiently', 'by', 'acquiring', 'images', 'in', 'an', 'userdefined', 'areaofinterest', 'with', 'atomic', 'resolution', 'we', 'demonstrate', 'that', 'the', 'stage', 'mechanics', 'of', 'the', 'nion', 'ultrastem', 'combined', 'with', 'an', 'intelligent', 'algorithm', 'to', 'move', 'the', 'sample', 'allows', 'the', 'automated', 'acquisition', 'of', 'atomically', 'resolved', 'images', 'from', 'micronsized', 'areas', 'of', 'a', 'graphene', 'substrate', 'moving', 'the', 'sample', 'stage', 'automatically', 'in', 'a', 'regular', 'pattern', 'over', 'the', 'areaofinterest', 'enables', 'the', 'collection', 'of', 'data', 'from', 'pristine', 'sample', 'regions', 'without', 'exposing', 'them', 'to', 'the', 'electron', 'beam', 'before', 'recording', 'an', 'image', 'therefore', 'it', 'is', 'possible', 'to', 'obtain', 'data', 'with', 'minimal', 'dose', 'no', 'prior', 'exposure', 'from', 'focusing', 'which', 'is', 'only', 'limited', 'by', 'the', 'minimum', 'signal', 'needed', 'for', 'data', 'processing', 'this', 'enables', 'us', 'to', 'prevent', 'beam', 'induced', 'damage', 'in', 'the', 'sample', 'and', 'to', 'acquire', 'large', 'datasets', 'within', 'a', 'reasonable', 'amount', 'of', 'time']]
|
[-0.040032516522965966, 0.0909935708542143, -0.07644847489228217, 0.019837442912089016, -0.06737259536918289, -0.1116865573686014, 0.06525933736970861, 0.4221373310061714, -0.2650707563457703, -0.3753480504818478, 0.09161955165988721, -0.2979943812384696, -0.03907307160982085, 0.21532786462667344, -0.11088727368734148, 0.07789789594244212, 0.09020978690676608, -0.0019130404672395547, -0.02191634007076308, -0.2298582392717594, 0.27868486083343225, 0.11954942504531767, 0.32833977000227255, 0.022737017762621197, 0.11204600785870232, 0.04469869579911883, -0.036512791855007554, -0.016654815420833895, -0.07241925557911282, 0.1344650945868072, 0.3007381202526463, 0.1564847179236415, 0.2684225341490497, -0.5001898987067002, -0.20805604013985077, 0.0935897135324957, 0.13606270384812022, 0.1388158085626732, -0.07333931131785718, -0.2534960942700035, 0.06340789193631087, -0.11564430942107896, -0.10845019988878404, -0.0673751353729263, -0.004656279994201964, -0.03892227211171417, -0.28917940621020144, 0.04625293780434696, 0.0019369849130438947, 0.060679016736544016, -0.0627816388848604, -0.03562296629042446, -0.00738325124624574, 0.14842163296122537, 0.0302905729718651, 0.06598372619262291, 0.16938276677810615, -0.14686037023502033, -0.06588479607632763, 0.36835416592205467, 0.01771572887449914, -0.14915458713793783, 0.17739500506420494, -0.1467832690070935, -0.0723144071226379, 0.24592793894054604, 0.16340523039740149, 0.11382264982529201, -0.1971557690130176, 0.010094116506894634, 0.014349618528797788, 0.234669417023062, 0.09619464137867202, 0.007460815385854306, 0.20294487431026018, 0.19469623027473362, 0.08173555048895792, 0.14350418610615856, -0.17943540111636783, -0.0025300673888408514, -0.23092713696176856, -0.1583018058061021, -0.19321269097679195, 0.043037838223435494, -0.06981235800762503, -0.15003048805791197, 0.35696041080377344, 0.19645769963068074, 0.19815241453210705, -0.006374964536872954, 0.3443518796736754, 0.03354406921115017, 0.14898535931591414, -0.0032650019919264663, 0.17406687276602895, 0.04982759894066246, 0.10848923013931269, -0.19982392664092313, 0.07368533992552136, -0.050398673875781806]
|
1,803.05838
|
Tracing sharing in an imperative pure calculus (Extended Version)
|
We introduce a type and effect system, for an imperative object calculus,
which infers "sharing" possibly introduced by the evaluation of an expression,
represented as an equivalence relation among its free variables. This direct
representation of sharing effects at the syntactic level allows us to express
in a natural way, and to generalize, widely-used notions in literature, notably
"uniqueness" and "borrowing". Moreover, the calculus is "pure" in the sense
that reduction is defined on language terms only, since they directly encode
store. The advantage of this non-standard execution model with respect to a
behaviourally equivalent standard model using a global auxiliary structure is
that reachability relations among references are partly encoded by scoping.
|
cs.PL
|
we introduce a type and effect system for an imperative object calculus which infers sharing possibly introduced by the evaluation of an expression represented as an equivalence relation among its free variables this direct representation of sharing effects at the syntactic level allows us to express in a natural way and to generalize widelyused notions in literature notably uniqueness and borrowing moreover the calculus is pure in the sense that reduction is defined on language terms only since they directly encode store the advantage of this nonstandard execution model with respect to a behaviourally equivalent standard model using a global auxiliary structure is that reachability relations among references are partly encoded by scoping
|
[['we', 'introduce', 'a', 'type', 'and', 'effect', 'system', 'for', 'an', 'imperative', 'object', 'calculus', 'which', 'infers', 'sharing', 'possibly', 'introduced', 'by', 'the', 'evaluation', 'of', 'an', 'expression', 'represented', 'as', 'an', 'equivalence', 'relation', 'among', 'its', 'free', 'variables', 'this', 'direct', 'representation', 'of', 'sharing', 'effects', 'at', 'the', 'syntactic', 'level', 'allows', 'us', 'to', 'express', 'in', 'a', 'natural', 'way', 'and', 'to', 'generalize', 'widelyused', 'notions', 'in', 'literature', 'notably', 'uniqueness', 'and', 'borrowing', 'moreover', 'the', 'calculus', 'is', 'pure', 'in', 'the', 'sense', 'that', 'reduction', 'is', 'defined', 'on', 'language', 'terms', 'only', 'since', 'they', 'directly', 'encode', 'store', 'the', 'advantage', 'of', 'this', 'nonstandard', 'execution', 'model', 'with', 'respect', 'to', 'a', 'behaviourally', 'equivalent', 'standard', 'model', 'using', 'a', 'global', 'auxiliary', 'structure', 'is', 'that', 'reachability', 'relations', 'among', 'references', 'are', 'partly', 'encoded', 'by', 'scoping']]
|
[-0.07449390549011865, 0.04583217337893928, -0.08634706122174332, 0.10505827035614809, -0.13084931008979284, -0.13100266893831106, 0.051822143606841564, 0.33583995511969633, -0.3459402041229527, -0.32352254864712354, 0.061287463825006466, -0.24364207559937417, -0.14836393955237834, 0.16968613035927435, -0.12345451412854337, -0.013894366785014394, 0.050884812443921, 0.0709432929206178, -0.0712997069205281, -0.21393332936166398, 0.33787203072446637, 0.028977636303505406, 0.27423842601577003, 0.003285108418492353, 0.1464485356674851, 0.04498397323830399, -0.06864657192037696, 0.03173682608526299, -0.0827389129369769, 0.1923338495157824, 0.2709477445650516, 0.18189382846096316, 0.26147125253198356, -0.39772340585271604, -0.17834301867143176, 0.08855695815641532, 0.10866721910300904, 0.08514471901930967, 0.02941341537557773, -0.29570131786826964, 0.07993247554085292, -0.20455816349393763, -0.07143225664050376, -0.1295370159184445, 0.029772554112153245, -0.025415217080483197, -0.25231313238701314, 0.017316273059201453, 0.10196025451476298, 0.08093424685983465, -0.055763577689536215, -0.05264185131960178, -0.021328144463652794, 0.15249884672528874, 0.011541593465459557, 0.016392937378465422, 0.09816687271015438, -0.10355071135615287, -0.16185528770670196, 0.37291249870199017, -0.05881686604054299, -0.2559111649809257, 0.2023929685469618, -0.046557822635611604, -0.1606438273885411, 0.06688748136063856, 0.10835575199463462, 0.08751419036591475, -0.1897995496808502, 0.11204988215854227, -0.05765579980427185, 0.19765787797493745, 0.1036269889641718, 0.07550779266892808, 0.1681165683178017, 0.13657709740234159, 0.059587450755710626, 0.1489970737746793, 0.011431802255286942, -0.13555193802473686, -0.31540852109283474, -0.15522506667622488, -0.1052314685637016, -0.0014007517787735018, -0.06075994879153116, -0.17640606110165538, 0.35758161468975314, 0.17004392289482387, 0.16750323438431772, 0.0933683753524602, 0.2848125510082572, 0.13274718631178437, 0.10396962347481631, 0.05211348002014138, 0.14011706736977253, 0.14292203330031011, 0.09606010676567665, -0.1724034607641201, 0.14565380943518758, 0.09585199219924687]
|
1,803.05839
|
Metallic state in bosonic systems with continuously degenerate minima
|
In systems above one dimension a continuously degenerate minimum of the
single particle dispersion is realized due to one or a combination of
system-parameters such as lattice structure, isotropic spin-orbit coupling, and
interactions. A unit codimension of the dispersion-minima leads to a divergent
density of states which enhances the effects of interactions, and may lead to
novel states of matter as exemplified by Luttinger liquids in one dimensional
bosonic systems. Here we show that in dilute, homogeneous bosonic systems above
one dimension, weak, spin-independent, inter-particle interactions stabilize a
metallic state at zero temperature in the presence of a curved manifold of
dispersion minima. In this metallic phase the system possesses a quasi
long-range order with non-universal scaling exponents. At a fixed positive
curvature of the manifold, increasing either the dilution or the interaction
strength destabilizes the metallic state towards charge density wave states
that break one or more symmetries. The magnitude of the wave vector of the
dominant charge density wave state is controlled by the product of the mean
density of bosons and the curvature of the manifold. We obtain the zero
temperature phase diagram, and identify the phase boundary.
|
cond-mat.quant-gas cond-mat.str-el
|
in systems above one dimension a continuously degenerate minimum of the single particle dispersion is realized due to one or a combination of systemparameters such as lattice structure isotropic spinorbit coupling and interactions a unit codimension of the dispersionminima leads to a divergent density of states which enhances the effects of interactions and may lead to novel states of matter as exemplified by luttinger liquids in one dimensional bosonic systems here we show that in dilute homogeneous bosonic systems above one dimension weak spinindependent interparticle interactions stabilize a metallic state at zero temperature in the presence of a curved manifold of dispersion minima in this metallic phase the system possesses a quasi longrange order with nonuniversal scaling exponents at a fixed positive curvature of the manifold increasing either the dilution or the interaction strength destabilizes the metallic state towards charge density wave states that break one or more symmetries the magnitude of the wave vector of the dominant charge density wave state is controlled by the product of the mean density of bosons and the curvature of the manifold we obtain the zero temperature phase diagram and identify the phase boundary
|
[['in', 'systems', 'above', 'one', 'dimension', 'a', 'continuously', 'degenerate', 'minimum', 'of', 'the', 'single', 'particle', 'dispersion', 'is', 'realized', 'due', 'to', 'one', 'or', 'a', 'combination', 'of', 'systemparameters', 'such', 'as', 'lattice', 'structure', 'isotropic', 'spinorbit', 'coupling', 'and', 'interactions', 'a', 'unit', 'codimension', 'of', 'the', 'dispersionminima', 'leads', 'to', 'a', 'divergent', 'density', 'of', 'states', 'which', 'enhances', 'the', 'effects', 'of', 'interactions', 'and', 'may', 'lead', 'to', 'novel', 'states', 'of', 'matter', 'as', 'exemplified', 'by', 'luttinger', 'liquids', 'in', 'one', 'dimensional', 'bosonic', 'systems', 'here', 'we', 'show', 'that', 'in', 'dilute', 'homogeneous', 'bosonic', 'systems', 'above', 'one', 'dimension', 'weak', 'spinindependent', 'interparticle', 'interactions', 'stabilize', 'a', 'metallic', 'state', 'at', 'zero', 'temperature', 'in', 'the', 'presence', 'of', 'a', 'curved', 'manifold', 'of', 'dispersion', 'minima', 'in', 'this', 'metallic', 'phase', 'the', 'system', 'possesses', 'a', 'quasi', 'longrange', 'order', 'with', 'nonuniversal', 'scaling', 'exponents', 'at', 'a', 'fixed', 'positive', 'curvature', 'of', 'the', 'manifold', 'increasing', 'either', 'the', 'dilution', 'or', 'the', 'interaction', 'strength', 'destabilizes', 'the', 'metallic', 'state', 'towards', 'charge', 'density', 'wave', 'states', 'that', 'break', 'one', 'or', 'more', 'symmetries', 'the', 'magnitude', 'of', 'the', 'wave', 'vector', 'of', 'the', 'dominant', 'charge', 'density', 'wave', 'state', 'is', 'controlled', 'by', 'the', 'product', 'of', 'the', 'mean', 'density', 'of', 'bosons', 'and', 'the', 'curvature', 'of', 'the', 'manifold', 'we', 'obtain', 'the', 'zero', 'temperature', 'phase', 'diagram', 'and', 'identify', 'the', 'phase', 'boundary']]
|
[-0.2210286887527059, 0.24844340147283026, -0.05741055834288192, 0.03595179548331847, -0.0052352712598072474, -0.16310551535909767, 0.03795787757792308, 0.2965751401999985, -0.2601558369431625, -0.23848433129516525, 0.04864784302350094, -0.31422088233872303, -0.10612382303810033, 0.09345586485754226, 0.059313548559157186, 0.017096462197225756, -0.02770771549413444, 0.05782084949634891, -0.12285344152607852, -0.19657386546318847, 0.37940395903335045, 0.0014675204918064453, 0.27639196377011044, 0.07532801905772575, 0.07697724060170234, 0.01470581863553475, 0.10859628987286693, 0.03458389701696221, -0.11234442608361071, 0.05204879257257624, 0.2009416839952344, -0.06143695271017138, 0.21548067165967372, -0.41711411207283616, -0.25132395262046464, 0.1009876245346965, 0.1387699351956447, 0.12279547994806081, -0.02996744616266658, -0.3008083971266551, -0.003755170691797815, -0.1607290698688418, -0.21798117855494772, -0.0799086578091774, 0.0007204654178133717, -0.01241294594072594, -0.2454965474079708, 0.1471427324494081, 0.0683324235607254, 0.03492464504584118, -0.07328433516464891, -0.09229311691141298, -0.10001733008693292, 0.06966536304243304, 0.03440701040296407, 0.051207313569701186, 0.14609691943904315, -0.18129738188083389, -0.08084431963002003, 0.35394356966945073, -0.09590779190634195, -0.1871589714336017, 0.21485580820787362, -0.1625901386141777, -0.062268617518600966, 0.18927946566510453, 0.15954181308261853, 0.07397829316477611, -0.0735658609715448, 0.09288277371944219, 0.019622189687209565, 0.19085411694413298, 0.039995675970598187, 0.0524469224179272, 0.25881339322834734, 0.15788311126922805, 0.12002793890202329, 0.13406832384625597, -0.08628171079346439, -0.10594218175257088, -0.28885763702253814, -0.17671688870162205, -0.2203612199457234, 0.07124756326821245, -0.08997176034916833, -0.20785781070245085, 0.3953671347468145, 0.09935419988928107, 0.21338611995683066, -0.00472314769917084, 0.25485556245973656, 0.1269568316823256, 0.06625945138789359, 0.035713890314264786, 0.26737301034123573, 0.16493333427964774, 0.05671061986870078, -0.25358440652588216, 0.00937848610103761, 0.06276353030026983]
|
1,803.0584
|
Effective Connectivity from Single Trial fMRI Data by Sampling
Biologically Plausible Models
|
The estimation of causal network architectures in the brain is fundamental
for understanding cognitive information processes. However, access to the
dynamic processes underlying cognition is limited to indirect measurements of
the hidden neuronal activity, for instance through fMRI data. Thus, estimating
the network structure of the underlying process is challenging. In this
article, we embed an adaptive importance sampler called Adaptive Path Integral
Smoother (APIS) into the Expectation-Maximization algorithm to obtain point
estimates of causal connectivity. We demonstrate on synthetic data that this
procedure finds not only the correct network structure but also the direction
of effective connections from random initializations of the connectivity
matrix. In addition--motivated by contradictory claims in the literature--we
examine the effect of the neuronal timescale on the sensitivity of the BOLD
signal to changes in the connectivity and on the maximum likelihood solutions
of the connectivity. We conclude with two warnings: First, the connectivity
estimates under the assumption of slow dynamics can be extremely biased if the
data was generated by fast neuronal processes. Second, the faster the time
scale, the less sensitive the BOLD signal is to changes in the incoming
connections to a node. Hence, connectivity estimation using realistic neural
dynamics timescale requires extremely high-quality data and seems infeasible in
many practical data sets.
|
q-bio.NC physics.data-an
|
the estimation of causal network architectures in the brain is fundamental for understanding cognitive information processes however access to the dynamic processes underlying cognition is limited to indirect measurements of the hidden neuronal activity for instance through fmri data thus estimating the network structure of the underlying process is challenging in this article we embed an adaptive importance sampler called adaptive path integral smoother apis into the expectationmaximization algorithm to obtain point estimates of causal connectivity we demonstrate on synthetic data that this procedure finds not only the correct network structure but also the direction of effective connections from random initializations of the connectivity matrix in additionmotivated by contradictory claims in the literaturewe examine the effect of the neuronal timescale on the sensitivity of the bold signal to changes in the connectivity and on the maximum likelihood solutions of the connectivity we conclude with two warnings first the connectivity estimates under the assumption of slow dynamics can be extremely biased if the data was generated by fast neuronal processes second the faster the time scale the less sensitive the bold signal is to changes in the incoming connections to a node hence connectivity estimation using realistic neural dynamics timescale requires extremely highquality data and seems infeasible in many practical data sets
|
[['the', 'estimation', 'of', 'causal', 'network', 'architectures', 'in', 'the', 'brain', 'is', 'fundamental', 'for', 'understanding', 'cognitive', 'information', 'processes', 'however', 'access', 'to', 'the', 'dynamic', 'processes', 'underlying', 'cognition', 'is', 'limited', 'to', 'indirect', 'measurements', 'of', 'the', 'hidden', 'neuronal', 'activity', 'for', 'instance', 'through', 'fmri', 'data', 'thus', 'estimating', 'the', 'network', 'structure', 'of', 'the', 'underlying', 'process', 'is', 'challenging', 'in', 'this', 'article', 'we', 'embed', 'an', 'adaptive', 'importance', 'sampler', 'called', 'adaptive', 'path', 'integral', 'smoother', 'apis', 'into', 'the', 'expectationmaximization', 'algorithm', 'to', 'obtain', 'point', 'estimates', 'of', 'causal', 'connectivity', 'we', 'demonstrate', 'on', 'synthetic', 'data', 'that', 'this', 'procedure', 'finds', 'not', 'only', 'the', 'correct', 'network', 'structure', 'but', 'also', 'the', 'direction', 'of', 'effective', 'connections', 'from', 'random', 'initializations', 'of', 'the', 'connectivity', 'matrix', 'in', 'additionmotivated', 'by', 'contradictory', 'claims', 'in', 'the', 'literaturewe', 'examine', 'the', 'effect', 'of', 'the', 'neuronal', 'timescale', 'on', 'the', 'sensitivity', 'of', 'the', 'bold', 'signal', 'to', 'changes', 'in', 'the', 'connectivity', 'and', 'on', 'the', 'maximum', 'likelihood', 'solutions', 'of', 'the', 'connectivity', 'we', 'conclude', 'with', 'two', 'warnings', 'first', 'the', 'connectivity', 'estimates', 'under', 'the', 'assumption', 'of', 'slow', 'dynamics', 'can', 'be', 'extremely', 'biased', 'if', 'the', 'data', 'was', 'generated', 'by', 'fast', 'neuronal', 'processes', 'second', 'the', 'faster', 'the', 'time', 'scale', 'the', 'less', 'sensitive', 'the', 'bold', 'signal', 'is', 'to', 'changes', 'in', 'the', 'incoming', 'connections', 'to', 'a', 'node', 'hence', 'connectivity', 'estimation', 'using', 'realistic', 'neural', 'dynamics', 'timescale', 'requires', 'extremely', 'highquality', 'data', 'and', 'seems', 'infeasible', 'in', 'many', 'practical', 'data', 'sets']]
|
[-0.12581160278059542, 0.08628295993805209, -0.0720869380659202, 0.1182610058661296, -0.11553501276565449, -0.1188821342230464, 0.07700077808528606, 0.411573160701387, -0.30078568705135866, -0.2945704562700398, 0.1248594152635806, -0.2367116732727958, -0.2192885382877042, 0.1673247270263909, -0.082169033567022, 0.04992884777575022, 0.09627168841793068, 0.06583636044746353, -0.019875188024404147, -0.21151086661210727, 0.2827750589643117, 0.10163915713894225, 0.319714812701568, 0.008963787656241385, 0.09717703004134819, 0.01787380916288211, -0.060744916169261115, -0.014102790865581482, -0.09110728130094468, 0.13442014146969, 0.2678972947311455, 0.1903888629904638, 0.30969982469410057, -0.48792134248762437, -0.2341847822480347, 0.10704879347634103, 0.12846503597407025, 0.09598554373896193, -0.00486946795745531, -0.2967085220008379, 0.08152546842937314, -0.07833849014936103, -0.05110328771850271, -0.0743586135418376, -0.0016449542438966179, -0.008901144697752205, -0.2988145601098603, 0.0807658626517791, 0.03265618491651756, 0.046830464558055, -0.030216331860061646, -0.04956459891705197, -0.004621383721851522, 0.14758054055273534, 0.04315786604489577, 0.02144886338584391, 0.1568151241877959, -0.1558657756141786, -0.11550180565211035, 0.3087180832312221, -0.0036674166769011035, -0.19697855618737992, 0.1868551219192644, -0.1161177233704144, -0.1719140030354971, 0.15060751619970514, 0.20184988123780515, 0.0642165469582237, -0.1948276169697887, 0.04861161207636109, 0.011568106879435835, 0.17632190302815398, -0.004595314977424486, 0.023706134881025978, 0.13772595163446524, 0.22069599761272826, 0.08296866851077149, 0.09875058516848921, -0.13089021649641272, -0.09527364215436614, -0.22400858656813702, -0.09404794288011978, -0.22104853302284722, 0.030548111203721157, -0.15868495367010058, -0.15979583757219926, 0.42378551303187295, 0.2179895045479671, 0.21096417152411526, 0.06860011117089362, 0.3228945423981973, 0.06665179622525881, 0.07597545565970774, 0.08618062650840286, 0.1861555514413686, 0.12648591413273522, 0.10744954684882292, -0.20905084701135776, 0.1816562429658093, 0.0019220358448191767]
|
1,803.05841
|
Impurity effect as a probe for the pairing symmetry of graphene-based
superconductors
|
The single impurity effect on the graphene-based superconductor is studied
theoretically. Four different pairing symmetries are discussed. Sharp resonance
peaks are found near the impurity site for the $d+id$-wave pairing symmetry and
the $p+ip$-wave pairing symmetry when the chemical potential is large. As the
chemical potential decreases, the in-gap states are robust for the $d+id$
pairing symmetry while they disappear for the $p+ip$ pairing symmetry. Such
in-gap peaks are absent for the fully gapped extended $s$-wave pairing symmetry
and the nodal $f$-wave pairing symmetry. The existence of the in-gap resonance
peaks can be explained well based on the sign-reversal of the superconducting
gap along different Fermi pockets and by analyzing the denominator of the
$T$-matrix. All of the features can be accessed by the experiments, which
provide a useful probe for the pairing symmetry of graphene-based
superconductors.
|
cond-mat.supr-con
|
the single impurity effect on the graphenebased superconductor is studied theoretically four different pairing symmetries are discussed sharp resonance peaks are found near the impurity site for the didwave pairing symmetry and the pipwave pairing symmetry when the chemical potential is large as the chemical potential decreases the ingap states are robust for the did pairing symmetry while they disappear for the pip pairing symmetry such ingap peaks are absent for the fully gapped extended swave pairing symmetry and the nodal fwave pairing symmetry the existence of the ingap resonance peaks can be explained well based on the signreversal of the superconducting gap along different fermi pockets and by analyzing the denominator of the tmatrix all of the features can be accessed by the experiments which provide a useful probe for the pairing symmetry of graphenebased superconductors
|
[['the', 'single', 'impurity', 'effect', 'on', 'the', 'graphenebased', 'superconductor', 'is', 'studied', 'theoretically', 'four', 'different', 'pairing', 'symmetries', 'are', 'discussed', 'sharp', 'resonance', 'peaks', 'are', 'found', 'near', 'the', 'impurity', 'site', 'for', 'the', 'didwave', 'pairing', 'symmetry', 'and', 'the', 'pipwave', 'pairing', 'symmetry', 'when', 'the', 'chemical', 'potential', 'is', 'large', 'as', 'the', 'chemical', 'potential', 'decreases', 'the', 'ingap', 'states', 'are', 'robust', 'for', 'the', 'did', 'pairing', 'symmetry', 'while', 'they', 'disappear', 'for', 'the', 'pip', 'pairing', 'symmetry', 'such', 'ingap', 'peaks', 'are', 'absent', 'for', 'the', 'fully', 'gapped', 'extended', 'swave', 'pairing', 'symmetry', 'and', 'the', 'nodal', 'fwave', 'pairing', 'symmetry', 'the', 'existence', 'of', 'the', 'ingap', 'resonance', 'peaks', 'can', 'be', 'explained', 'well', 'based', 'on', 'the', 'signreversal', 'of', 'the', 'superconducting', 'gap', 'along', 'different', 'fermi', 'pockets', 'and', 'by', 'analyzing', 'the', 'denominator', 'of', 'the', 'tmatrix', 'all', 'of', 'the', 'features', 'can', 'be', 'accessed', 'by', 'the', 'experiments', 'which', 'provide', 'a', 'useful', 'probe', 'for', 'the', 'pairing', 'symmetry', 'of', 'graphenebased', 'superconductors']]
|
[-0.24224326909302196, 0.22004873787280663, -0.06587657575108057, 0.16305609204616045, -0.07238218111128811, -0.22213624818182556, 0.07143635528814728, 0.35441084247317, -0.24386390310841322, -0.2437461049799012, -0.021474995670744974, -0.34881563038041774, -0.0843607781686052, 0.11962802707809057, 0.08712513282228887, 0.018580078956310767, -0.06651475366857583, -0.006051551592901661, -0.14560818250450802, -0.2234571065012719, 0.38434540462020755, -0.023079551368897413, 0.36185105948498214, 0.1425856573432412, -0.07771494312307042, 0.023448292262865787, 0.15828763403977356, -0.03572347905252292, -0.08987342399701367, 0.031023260768091674, 0.29665819013042605, -0.11729645024284883, 0.13197821932742848, -0.45179110208023204, -0.2154123711698845, 0.024407029366052716, 0.20942973465162473, 0.1843174367430994, -0.0738118232727513, -0.37211116533862415, 0.05909065530383891, -0.16780477796552062, -0.1660313411058355, -0.13017027993027094, -0.05170580331426467, -0.03572931449331792, -0.19980793356909043, 0.12320986382466109, 0.06680746815026309, 0.10416347885259637, -0.09745905416113508, -0.15924121788023107, -0.1325975484252165, 0.037021822408461996, 0.07852786811694068, 0.002407986753157945, 0.1277288502977862, -0.11091308488109469, -0.09402986196801066, 0.3544935528188944, -0.008089125390932725, -0.09265302775604446, 0.13773523087708456, -0.09726769829094138, -0.07157151925846608, 0.1450686512963615, 0.037720542210732066, 0.04473290680805697, -0.10634529452490957, 0.09680469700408909, -0.03982775641714026, 0.11631646166711937, 0.033592505684720664, 0.11753812648464729, 0.27425843360323976, 0.15223480832429914, 0.08424388058143702, 0.08382151098106139, -0.1541151250738066, -0.05332755319175929, -0.31671294910207826, -0.12742581395313388, -0.25638515329290945, -0.019286553662637398, -0.006366249669813143, -0.14316633570069162, 0.43908097783407796, 0.07500779298711976, 0.22755951081558953, -0.11016530443550543, 0.18600142290679753, 0.15061904445722238, 0.14373862473498078, 0.02409711156557076, 0.25201607641702806, 0.11716272529336984, 0.037664272185129515, -0.3742024951723207, 0.07700598027355744, 0.011711675539463215]
|
1,803.05842
|
Data as a Research Infrastructure - CDS, the Virtual Observatory,
Astronomy, and beyond
|
The situation of data sharing in astronomy is positioned in the current
general context of a political push towards, and rapid development of,
scientific data sharing. Data is already one of the major infrastructures of
astronomy, thanks to the data and service providers and to the International
Virtual Observatory Alliance (IVOA). Other disciplines are moving on in the
same direction. International organisations, in particular the Research Data
Alliance (RDA), are developing building blocks and bridges to enable scientific
data sharing across borders. The liaisons between RDA and astronomy, and RDA
activities relevant to the librarian community, are discussed.
|
astro-ph.IM
|
the situation of data sharing in astronomy is positioned in the current general context of a political push towards and rapid development of scientific data sharing data is already one of the major infrastructures of astronomy thanks to the data and service providers and to the international virtual observatory alliance ivoa other disciplines are moving on in the same direction international organisations in particular the research data alliance rda are developing building blocks and bridges to enable scientific data sharing across borders the liaisons between rda and astronomy and rda activities relevant to the librarian community are discussed
|
[['the', 'situation', 'of', 'data', 'sharing', 'in', 'astronomy', 'is', 'positioned', 'in', 'the', 'current', 'general', 'context', 'of', 'a', 'political', 'push', 'towards', 'and', 'rapid', 'development', 'of', 'scientific', 'data', 'sharing', 'data', 'is', 'already', 'one', 'of', 'the', 'major', 'infrastructures', 'of', 'astronomy', 'thanks', 'to', 'the', 'data', 'and', 'service', 'providers', 'and', 'to', 'the', 'international', 'virtual', 'observatory', 'alliance', 'ivoa', 'other', 'disciplines', 'are', 'moving', 'on', 'in', 'the', 'same', 'direction', 'international', 'organisations', 'in', 'particular', 'the', 'research', 'data', 'alliance', 'rda', 'are', 'developing', 'building', 'blocks', 'and', 'bridges', 'to', 'enable', 'scientific', 'data', 'sharing', 'across', 'borders', 'the', 'liaisons', 'between', 'rda', 'and', 'astronomy', 'and', 'rda', 'activities', 'relevant', 'to', 'the', 'librarian', 'community', 'are', 'discussed']]
|
[-0.13132524182924962, 0.06732723595840591, -0.02379160679933824, 0.06173004750970143, -0.1350653221906752, -0.10647148686955321, 0.053257224243550026, 0.36730661452272717, -0.264059781400981, -0.3359162618159031, 0.14725349420605569, -0.35963093465650264, -0.0777516370183047, 0.20669681117964947, -0.06783360611031213, 0.01471819794541985, 0.08418928199668643, -0.01059053047579162, 0.048631525536695, -0.2539417680438456, 0.29128685622114914, 0.13521097206548616, 0.40443878639869546, 0.07337378468649576, 0.0036311188584421668, 0.02061794670938683, -0.15100377289090086, -0.08043286678552324, -0.05659840139916775, 0.21778555984171677, 0.4409758280475662, 0.25942302886620866, 0.3629391989765727, -0.44125553591138855, -0.12875430135778626, 0.03629390340374441, 0.11362100606879258, 0.03948145410122008, -0.04011826737598535, -0.3353947015023049, -0.019823123485310838, -0.19771015486318846, -0.15807037478388877, -0.0028731478188110857, 0.031196432651438732, 0.07863467456107694, -0.1778930816134172, -0.044658015558154, -0.05921195038803378, 0.09625209106740598, -0.03326000637678923, -0.10282376306060208, -0.014091414589510888, 0.2619667201426488, 0.0863359882929885, 0.05984751604098294, 0.12246128387644659, -0.1694465376120726, -0.13751860843895344, 0.4261871928311124, 0.024314448069923614, -0.060084068230638395, 0.20563692941653486, -0.1608658793135261, -0.2012004086994851, 0.0036226948224274175, 0.24820960917491086, 0.002086859091888277, -0.1963346949635948, 0.08269977699893964, 0.03267165597490206, 0.0963004206459285, 0.07033966714991446, -0.0006338873829417007, 0.22862093691352983, 0.2297326962971984, 0.09127131431382529, 0.0507824580471402, -0.05799027488386373, -0.15783246743435764, -0.21379471296558575, -0.15737982400769027, -0.1235731750992792, -0.08669881840065426, -0.025611608734945956, -0.12355409270836687, 0.39260867475627026, 0.14854389360668707, 0.07063516060945255, -0.03048970620415164, 0.32235882517748643, -0.038429252313906134, 0.15466362648472495, 0.11428641353030594, 0.2055732583370516, -0.003867254326386111, 0.23431735115638952, -0.09766772797103135, 0.07217225434771758, -0.025073757074412187]
|
1,803.05843
|
Challenges in Annotation of useR Data for UbiquitOUs Systems: Results
from the 1st ARDUOUS Workshop
|
Labelling user data is a central part of the design and evaluation of
pervasive systems that aim to support the user through situation-aware
reasoning. It is essential both in designing and training the system to
recognise and reason about the situation, either through the definition of a
suitable situation model in knowledge-driven applications, or through the
preparation of training data for learning tasks in data-driven models. Hence,
the quality of annotations can have a significant impact on the performance of
the derived systems. Labelling is also vital for validating and quantifying the
performance of applications. In particular, comparative evaluations require the
production of benchmark datasets based on high-quality and consistent
annotations. With pervasive systems relying increasingly on large datasets for
designing and testing models of users' activities, the process of data
labelling is becoming a major concern for the community. In this work we
present a qualitative and quantitative analysis of the challenges associated
with annotation of user data and possible strategies towards addressing these
challenges. The analysis was based on the data gathered during the 1st
International Workshop on Annotation of useR Data for UbiquitOUs Systems
(ARDUOUS) and consisted of brainstorming as well as annotation and
questionnaire data gathered during the talks, poster session, live annotation
session, and discussion session.
|
cs.CY cs.HC
|
labelling user data is a central part of the design and evaluation of pervasive systems that aim to support the user through situationaware reasoning it is essential both in designing and training the system to recognise and reason about the situation either through the definition of a suitable situation model in knowledgedriven applications or through the preparation of training data for learning tasks in datadriven models hence the quality of annotations can have a significant impact on the performance of the derived systems labelling is also vital for validating and quantifying the performance of applications in particular comparative evaluations require the production of benchmark datasets based on highquality and consistent annotations with pervasive systems relying increasingly on large datasets for designing and testing models of users activities the process of data labelling is becoming a major concern for the community in this work we present a qualitative and quantitative analysis of the challenges associated with annotation of user data and possible strategies towards addressing these challenges the analysis was based on the data gathered during the 1st international workshop on annotation of user data for ubiquitous systems arduous and consisted of brainstorming as well as annotation and questionnaire data gathered during the talks poster session live annotation session and discussion session
|
[['labelling', 'user', 'data', 'is', 'a', 'central', 'part', 'of', 'the', 'design', 'and', 'evaluation', 'of', 'pervasive', 'systems', 'that', 'aim', 'to', 'support', 'the', 'user', 'through', 'situationaware', 'reasoning', 'it', 'is', 'essential', 'both', 'in', 'designing', 'and', 'training', 'the', 'system', 'to', 'recognise', 'and', 'reason', 'about', 'the', 'situation', 'either', 'through', 'the', 'definition', 'of', 'a', 'suitable', 'situation', 'model', 'in', 'knowledgedriven', 'applications', 'or', 'through', 'the', 'preparation', 'of', 'training', 'data', 'for', 'learning', 'tasks', 'in', 'datadriven', 'models', 'hence', 'the', 'quality', 'of', 'annotations', 'can', 'have', 'a', 'significant', 'impact', 'on', 'the', 'performance', 'of', 'the', 'derived', 'systems', 'labelling', 'is', 'also', 'vital', 'for', 'validating', 'and', 'quantifying', 'the', 'performance', 'of', 'applications', 'in', 'particular', 'comparative', 'evaluations', 'require', 'the', 'production', 'of', 'benchmark', 'datasets', 'based', 'on', 'highquality', 'and', 'consistent', 'annotations', 'with', 'pervasive', 'systems', 'relying', 'increasingly', 'on', 'large', 'datasets', 'for', 'designing', 'and', 'testing', 'models', 'of', 'users', 'activities', 'the', 'process', 'of', 'data', 'labelling', 'is', 'becoming', 'a', 'major', 'concern', 'for', 'the', 'community', 'in', 'this', 'work', 'we', 'present', 'a', 'qualitative', 'and', 'quantitative', 'analysis', 'of', 'the', 'challenges', 'associated', 'with', 'annotation', 'of', 'user', 'data', 'and', 'possible', 'strategies', 'towards', 'addressing', 'these', 'challenges', 'the', 'analysis', 'was', 'based', 'on', 'the', 'data', 'gathered', 'during', 'the', '1st', 'international', 'workshop', 'on', 'annotation', 'of', 'user', 'data', 'for', 'ubiquitous', 'systems', 'arduous', 'and', 'consisted', 'of', 'brainstorming', 'as', 'well', 'as', 'annotation', 'and', 'questionnaire', 'data', 'gathered', 'during', 'the', 'talks', 'poster', 'session', 'live', 'annotation', 'session', 'and', 'discussion', 'session']]
|
[-0.09445801451007761, -0.007414957140991685, -0.044790316762632176, 0.04624334788583204, -0.10832789214769316, -0.1455648507000393, 0.0868415092934647, 0.3863312846570501, -0.1841539322548674, -0.3843661159700692, 0.15304545214415144, -0.3033447689796087, -0.12652832314358822, 0.23761571208633023, -0.11295571876880312, 0.07593983349995026, 0.17118054812264263, 0.0497135669445416, -0.019744570112414216, -0.26322238345661364, 0.3501464070632727, 0.09258370740798201, 0.3466106093559255, 0.07302805665280158, 0.0788877762107055, 0.011447382736642144, -0.11980644076090456, -0.035376364487497536, -0.05785535679710394, 0.17945860586762516, 0.3516600007930689, 0.2400077130685238, 0.3426678102304585, -0.42730466241979204, -0.17999652973254834, 0.04674374802706772, 0.1335027023443127, 0.07107022714178228, -0.08683220158779102, -0.34035159462965775, 0.061556816383560684, -0.1487893883527314, -0.01799444887804759, -0.1007136604814874, 0.016906134762152393, -0.0032201798106389237, -0.2613135750242178, 0.026319465663817036, 0.057138082013527255, 0.16806492802766437, -0.05260313020123089, -0.08080942918363324, -0.005548074645634687, 0.21467005205318268, 0.07213073543267946, 0.004696798207397215, 0.1242813295739928, -0.18931611737741766, -0.16171222140431024, 0.4111727821636256, -0.000952225406896941, -0.14543363517724084, 0.21936741129106785, -0.05276861284711615, -0.18875407046854709, 0.06736769146281538, 0.25714062077712746, 0.08459707195164362, -0.18999719355361297, 0.01297652648052342, 0.021355765233902146, 0.2019704088692275, 0.012763546977271613, -0.0074996638191219475, 0.2037790733217416, 0.2928695886454355, 0.002673111815155612, 0.10017590383200142, -0.05917122231501759, -0.07781200471992927, -0.2731378377234272, -0.16746429693377554, -0.1605829636420684, -0.04738347388923133, -0.048057096016439343, -0.13930675858340416, 0.3700260327272647, 0.21871790553385753, 0.15849247307823397, 0.03528782648974544, 0.3377617627417589, 0.01069948977558494, 0.093298280382114, 0.04354279430834709, 0.1482954602865105, 0.005958457817257298, 0.19305560952361445, -0.1548032842717747, 0.12028320405799983, -0.015964746757706195]
|
1,803.05844
|
Iterative Turbo Receiver for LDPC-Coded MIMO Systems Based on
Semi-definite Relaxation
|
In this work, we develop a new iterative turbo receiver for LDPC-coded
multi-antenna systems based on semidefinite relaxation (SDR). For a classical
turbo receiver, forward error correction (FEC) code is only used at decoder.
Nonetheless, by taking advantage of FEC code in the detection stage, our
proposed SDR detector can output extrinsic information with much improved
reliability to the decoder. We also propose a simplified SDR turbo receiver
that solves only one SDR problem per codeword instead of solving multiple SDR
problems in the iterative turbo processing. This scheme significantly reduces
the time complexity of SDR turbo receiver, while the error performance remains
similar as before. In fact, our simplified scheme is generic in the sense that
it is applicable to any list-based iterative receivers.
|
cs.IT math.IT
|
in this work we develop a new iterative turbo receiver for ldpccoded multiantenna systems based on semidefinite relaxation sdr for a classical turbo receiver forward error correction fec code is only used at decoder nonetheless by taking advantage of fec code in the detection stage our proposed sdr detector can output extrinsic information with much improved reliability to the decoder we also propose a simplified sdr turbo receiver that solves only one sdr problem per codeword instead of solving multiple sdr problems in the iterative turbo processing this scheme significantly reduces the time complexity of sdr turbo receiver while the error performance remains similar as before in fact our simplified scheme is generic in the sense that it is applicable to any listbased iterative receivers
|
[['in', 'this', 'work', 'we', 'develop', 'a', 'new', 'iterative', 'turbo', 'receiver', 'for', 'ldpccoded', 'multiantenna', 'systems', 'based', 'on', 'semidefinite', 'relaxation', 'sdr', 'for', 'a', 'classical', 'turbo', 'receiver', 'forward', 'error', 'correction', 'fec', 'code', 'is', 'only', 'used', 'at', 'decoder', 'nonetheless', 'by', 'taking', 'advantage', 'of', 'fec', 'code', 'in', 'the', 'detection', 'stage', 'our', 'proposed', 'sdr', 'detector', 'can', 'output', 'extrinsic', 'information', 'with', 'much', 'improved', 'reliability', 'to', 'the', 'decoder', 'we', 'also', 'propose', 'a', 'simplified', 'sdr', 'turbo', 'receiver', 'that', 'solves', 'only', 'one', 'sdr', 'problem', 'per', 'codeword', 'instead', 'of', 'solving', 'multiple', 'sdr', 'problems', 'in', 'the', 'iterative', 'turbo', 'processing', 'this', 'scheme', 'significantly', 'reduces', 'the', 'time', 'complexity', 'of', 'sdr', 'turbo', 'receiver', 'while', 'the', 'error', 'performance', 'remains', 'similar', 'as', 'before', 'in', 'fact', 'our', 'simplified', 'scheme', 'is', 'generic', 'in', 'the', 'sense', 'that', 'it', 'is', 'applicable', 'to', 'any', 'listbased', 'iterative', 'receivers']]
|
[-0.1749807606190443, -0.0754673642963171, -0.06571604811772704, 0.08284578720200807, -0.043979232877492905, -0.34421904777362944, 0.07910779692605138, 0.40241157557070256, -0.3008496033474803, -0.2528893434107304, 0.14948209353163838, -0.1776135304123163, -0.19008008166216314, 0.1917627382520586, -0.1514293003194034, 0.11249774813652039, 0.09283884588629007, -0.0022137649171054363, -0.15504791374877094, -0.3165302094593644, 0.2043906831741333, 0.19704832983016968, 0.309472365565598, -0.007320202205330134, 0.15332324599381536, 0.014737662833184003, 0.04164123783633113, -0.08311045347806066, -0.024938741244957784, 0.050691511454992, 0.3513932838700712, 0.2577185375764966, 0.2677235375493765, -0.37210693702846764, -0.2463084695711732, 0.017107090048491955, 0.1854682576060295, 0.18234235712885857, -0.06264932236541063, -0.23080885261297227, 0.1269341084882617, -0.18325597585365178, 0.08208450873568654, 0.05483685893565416, -0.11851264381594956, -0.054114526726771146, -0.29104888448677957, 0.027557677576085553, 0.07839890299737454, 0.011529170464724302, -0.003936579711735249, -0.17357260401546956, 0.10396312141790987, 0.06954165609925986, -0.029946723498404024, 0.07997689806576819, 0.08858279129117727, 0.024253121856600047, -0.1420751071916893, 0.3316642331406474, -0.061935195405967536, -0.2589833299219608, 0.1369879233557731, -0.04237641862593591, -0.12303477274626494, 0.23563976538181305, 0.2618898374307901, 0.07662185958772898, -0.1788398083373904, 0.053136904038488864, 0.02506911415606737, 0.2518269237019122, 0.055785938769578935, 0.07603828670829535, 0.09822319114394486, 0.1914793204367161, 0.11510831237398088, 0.18316642260923982, -0.14142739568999968, -0.08279875346180052, -0.22266742532281206, -0.16489940105378628, -0.24658867294341325, -0.01857190179079771, -0.10164254708960653, -0.07203365923464299, 0.3771610854400205, 0.1730453580892645, 0.04715522658638656, 0.17214600222930312, 0.45569054007530213, 0.09198433851543814, 0.10758590675744927, 0.18788459872081875, 0.2229604219868779, 0.1002652446795255, 0.11024367895536125, -0.26200450796447694, 0.08059055962786078, 0.09837723570689559]
|
1,803.05845
|
A Structural Correlation Filter Combined with A Multi-task Gaussian
Particle Filter for Visual Tracking
|
In this paper, we propose a novel structural correlation filter combined with
a multi-task Gaussian particle filter (KCF-GPF) model for robust visual
tracking. We first present an assemble structure where several KCF trackers as
weak experts provide a preliminary decision for a Gaussian particle filter to
make a final decision. The proposed method is designed to exploit and
complement the strength of a KCF and a Gaussian particle filter. Compared with
the existing tracking methods based on correlation filters or particle filters,
the proposed tracker has several advantages. First, it can detect the tracked
target in a large-scale search scope via weak KCF trackers and evaluate the
reliability of weak trackers\rq decisions for a Gaussian particle filter to
make a strong decision, and hence it can tackle fast motions, appearance
variations, occlusions and re-detections. Second, it can effectively handle
large-scale variations via a Gaussian particle filter. Third, it can be
amenable to fully parallel implementation using importance sampling without
resampling, thereby it is convenient for VLSI implementation and can lower the
computational costs. Extensive experiments on the OTB-2013 dataset containing
50 challenging sequences demonstrate that the proposed algorithm performs
favourably against 16 state-of-the-art trackers.
|
cs.CV
|
in this paper we propose a novel structural correlation filter combined with a multitask gaussian particle filter kcfgpf model for robust visual tracking we first present an assemble structure where several kcf trackers as weak experts provide a preliminary decision for a gaussian particle filter to make a final decision the proposed method is designed to exploit and complement the strength of a kcf and a gaussian particle filter compared with the existing tracking methods based on correlation filters or particle filters the proposed tracker has several advantages first it can detect the tracked target in a largescale search scope via weak kcf trackers and evaluate the reliability of weak trackersrq decisions for a gaussian particle filter to make a strong decision and hence it can tackle fast motions appearance variations occlusions and redetections second it can effectively handle largescale variations via a gaussian particle filter third it can be amenable to fully parallel implementation using importance sampling without resampling thereby it is convenient for vlsi implementation and can lower the computational costs extensive experiments on the otb2013 dataset containing 50 challenging sequences demonstrate that the proposed algorithm performs favourably against 16 stateoftheart trackers
|
[['in', 'this', 'paper', 'we', 'propose', 'a', 'novel', 'structural', 'correlation', 'filter', 'combined', 'with', 'a', 'multitask', 'gaussian', 'particle', 'filter', 'kcfgpf', 'model', 'for', 'robust', 'visual', 'tracking', 'we', 'first', 'present', 'an', 'assemble', 'structure', 'where', 'several', 'kcf', 'trackers', 'as', 'weak', 'experts', 'provide', 'a', 'preliminary', 'decision', 'for', 'a', 'gaussian', 'particle', 'filter', 'to', 'make', 'a', 'final', 'decision', 'the', 'proposed', 'method', 'is', 'designed', 'to', 'exploit', 'and', 'complement', 'the', 'strength', 'of', 'a', 'kcf', 'and', 'a', 'gaussian', 'particle', 'filter', 'compared', 'with', 'the', 'existing', 'tracking', 'methods', 'based', 'on', 'correlation', 'filters', 'or', 'particle', 'filters', 'the', 'proposed', 'tracker', 'has', 'several', 'advantages', 'first', 'it', 'can', 'detect', 'the', 'tracked', 'target', 'in', 'a', 'largescale', 'search', 'scope', 'via', 'weak', 'kcf', 'trackers', 'and', 'evaluate', 'the', 'reliability', 'of', 'weak', 'trackersrq', 'decisions', 'for', 'a', 'gaussian', 'particle', 'filter', 'to', 'make', 'a', 'strong', 'decision', 'and', 'hence', 'it', 'can', 'tackle', 'fast', 'motions', 'appearance', 'variations', 'occlusions', 'and', 'redetections', 'second', 'it', 'can', 'effectively', 'handle', 'largescale', 'variations', 'via', 'a', 'gaussian', 'particle', 'filter', 'third', 'it', 'can', 'be', 'amenable', 'to', 'fully', 'parallel', 'implementation', 'using', 'importance', 'sampling', 'without', 'resampling', 'thereby', 'it', 'is', 'convenient', 'for', 'vlsi', 'implementation', 'and', 'can', 'lower', 'the', 'computational', 'costs', 'extensive', 'experiments', 'on', 'the', 'otb2013', 'dataset', 'containing', '50', 'challenging', 'sequences', 'demonstrate', 'that', 'the', 'proposed', 'algorithm', 'performs', 'favourably', 'against', '16', 'stateoftheart', 'trackers']]
|
[-0.03224559150855081, 0.019320957525830334, -0.10758786185687323, 0.07799022246338912, -0.10825761304658954, -0.20224505264680678, 0.009640172562285443, 0.4822805827667859, -0.24104438470385503, -0.3313016320025781, 0.1221474790108914, -0.2428509942759168, -0.1691416516174892, 0.17465021419896706, -0.094079582542084, 0.10239439729290704, 0.15144758260188004, 0.017238874334755867, -0.05787947534675671, -0.2567890497096717, 0.2103788393033028, 0.11408916771567117, 0.30876970446358126, -0.01048764868270761, 0.15825640044931788, 0.04158503500851415, -0.08573873732530046, 0.026754835289466428, -0.044726596474788494, 0.10553170185933898, 0.24724424693340552, 0.1546898638523544, 0.34275176926288015, -0.36684820848555927, -0.17970459385954504, 0.07627229503971951, 0.1488642737046272, 0.08674822355775784, -0.07466062853321394, -0.3687715890070346, 0.0800455660209991, -0.17698461446343572, -0.03841066394428102, -0.1527827360914671, -0.052182849448096626, 0.012943083569552982, -0.32681518693577044, 0.030812914028501837, 0.0424879277634318, 0.0016127580408162128, 0.01045854767532243, -0.12213701435636419, 0.05927684517034019, 0.10294500948536249, -0.01022614359014066, 0.022026570989207055, 0.1822659615578838, -0.13280021748956491, -0.16606267904171546, 0.3415134643728379, -0.09341917830170132, -0.2654702309446293, 0.2427009652395403, -0.03058659318291272, -0.12022352421263349, 0.16965226864946695, 0.21829041153735793, 0.11337649410173374, -0.1820453355906769, 0.015450337967801412, -0.024025815235897124, 0.2177830915340261, 0.031093504484791385, 0.0010845909248473617, 0.1715944051338738, 0.23228136214311235, 0.10777085177232948, 0.1707428123078595, -0.1935149265724855, -0.07457867606475095, -0.2296938943739709, -0.13019619824827564, -0.17466116952952385, -0.0797026145325314, -0.09231322226893705, -0.17355146931125395, 0.3808203173709141, 0.24395889153189879, 0.16675275742970067, 0.08895779317147874, 0.3842099571866129, 0.053870904234524154, 0.10154735832884398, 0.07264365799589238, 0.2031405921879923, 0.06587126420830221, 0.10897168293740833, -0.18495074835315486, 0.06405561339124688, 0.02887789174807646]
|
1,803.05846
|
Accurate Facial Parts Localization and Deep Learning for 3D Facial
Expression Recognition
|
Meaningful facial parts can convey key cues for both facial action unit
detection and expression prediction. Textured 3D face scan can provide both
detailed 3D geometric shape and 2D texture appearance cues of the face which
are beneficial for Facial Expression Recognition (FER). However, accurate
facial parts extraction as well as their fusion are challenging tasks. In this
paper, a novel system for 3D FER is designed based on accurate facial parts
extraction and deep feature fusion of facial parts. In particular, each
textured 3D face scan is firstly represented as a 2D texture map and a depth
map with one-to-one dense correspondence. Then, the facial parts of both
texture map and depth map are extracted using a novel 4-stage process consists
of facial landmark localization, facial rotation correction, facial resizing,
facial parts bounding box extraction and post-processing procedures. Finally,
deep fusion Convolutional Neural Networks (CNNs) features of all facial parts
are learned from both texture maps and depth maps, respectively and nonlinear
SVMs are used for expression prediction. Experiments are conducted on the
BU-3DFE database, demonstrating the effectiveness of combing different facial
parts, texture and depth cues and reporting the state-of-the-art results in
comparison with all existing methods under the same setting.
|
cs.CV
|
meaningful facial parts can convey key cues for both facial action unit detection and expression prediction textured 3d face scan can provide both detailed 3d geometric shape and 2d texture appearance cues of the face which are beneficial for facial expression recognition fer however accurate facial parts extraction as well as their fusion are challenging tasks in this paper a novel system for 3d fer is designed based on accurate facial parts extraction and deep feature fusion of facial parts in particular each textured 3d face scan is firstly represented as a 2d texture map and a depth map with onetoone dense correspondence then the facial parts of both texture map and depth map are extracted using a novel 4stage process consists of facial landmark localization facial rotation correction facial resizing facial parts bounding box extraction and postprocessing procedures finally deep fusion convolutional neural networks cnns features of all facial parts are learned from both texture maps and depth maps respectively and nonlinear svms are used for expression prediction experiments are conducted on the bu3dfe database demonstrating the effectiveness of combing different facial parts texture and depth cues and reporting the stateoftheart results in comparison with all existing methods under the same setting
|
[['meaningful', 'facial', 'parts', 'can', 'convey', 'key', 'cues', 'for', 'both', 'facial', 'action', 'unit', 'detection', 'and', 'expression', 'prediction', 'textured', '3d', 'face', 'scan', 'can', 'provide', 'both', 'detailed', '3d', 'geometric', 'shape', 'and', '2d', 'texture', 'appearance', 'cues', 'of', 'the', 'face', 'which', 'are', 'beneficial', 'for', 'facial', 'expression', 'recognition', 'fer', 'however', 'accurate', 'facial', 'parts', 'extraction', 'as', 'well', 'as', 'their', 'fusion', 'are', 'challenging', 'tasks', 'in', 'this', 'paper', 'a', 'novel', 'system', 'for', '3d', 'fer', 'is', 'designed', 'based', 'on', 'accurate', 'facial', 'parts', 'extraction', 'and', 'deep', 'feature', 'fusion', 'of', 'facial', 'parts', 'in', 'particular', 'each', 'textured', '3d', 'face', 'scan', 'is', 'firstly', 'represented', 'as', 'a', '2d', 'texture', 'map', 'and', 'a', 'depth', 'map', 'with', 'onetoone', 'dense', 'correspondence', 'then', 'the', 'facial', 'parts', 'of', 'both', 'texture', 'map', 'and', 'depth', 'map', 'are', 'extracted', 'using', 'a', 'novel', '4stage', 'process', 'consists', 'of', 'facial', 'landmark', 'localization', 'facial', 'rotation', 'correction', 'facial', 'resizing', 'facial', 'parts', 'bounding', 'box', 'extraction', 'and', 'postprocessing', 'procedures', 'finally', 'deep', 'fusion', 'convolutional', 'neural', 'networks', 'cnns', 'features', 'of', 'all', 'facial', 'parts', 'are', 'learned', 'from', 'both', 'texture', 'maps', 'and', 'depth', 'maps', 'respectively', 'and', 'nonlinear', 'svms', 'are', 'used', 'for', 'expression', 'prediction', 'experiments', 'are', 'conducted', 'on', 'the', 'bu3dfe', 'database', 'demonstrating', 'the', 'effectiveness', 'of', 'combing', 'different', 'facial', 'parts', 'texture', 'and', 'depth', 'cues', 'and', 'reporting', 'the', 'stateoftheart', 'results', 'in', 'comparison', 'with', 'all', 'existing', 'methods', 'under', 'the', 'same', 'setting']]
|
[-0.023170683687791373, -0.06836942846891401, -0.011610030839348811, 0.01941193766028196, -0.054880671868366857, -0.2108822235828403, -0.08392549822912115, 0.47368784763120814, -0.24543570700500691, -0.28805164274819234, 0.10110307327561135, -0.313089763667673, -0.2547829715613037, 0.16895669827173496, -0.17608064251236177, 0.14507152250763763, 0.13868668253861569, 0.057373666568238314, -0.10094313207813631, -0.20038594694503037, 0.2868152722071746, -0.015349610355680377, 0.3564933730573783, 0.056040411245300355, 0.16467301737691456, -0.0078970281217417, -0.09616431184663561, -0.018622169555554836, -0.04148018139981082, 0.2255597190468072, 0.3364653240584222, 0.17068146963741715, 0.15300842501186385, -0.4400495521338849, -0.21451511953526126, 0.006772870051082719, 0.16640851876969115, 0.12252065383088247, -0.05234103797237604, -0.40294345635393164, 0.0810557958432542, -0.08734066905033731, 0.09997991840882695, -0.20552712209118998, 0.04479751134924407, -0.08490822665115791, -0.320452176429001, 0.06436818041706806, 0.11663255656856053, 0.17940927917146918, -0.1128738538357498, -0.13935714630293086, -0.022675130659659287, 0.29852123586277435, -0.013427504060905785, 0.07057444128698756, 0.2142410814840108, -0.2758087768767653, -0.0802226328234225, 0.3634654946689462, -0.008173658086154426, -0.2613519459797684, 0.19051415569222363, -0.042263906875744536, -0.12089231861021205, 0.14221610092779327, 0.228846574110424, 0.1410367897226535, -0.16762168048261641, -0.02578514303583101, -0.07386443794480171, 0.1690606273655674, 0.11082421187592413, -0.02036250656438542, 0.2627139915046947, 0.19538614514348066, -0.016151347623970542, 0.1549792313510139, -0.27541431666952854, -0.006643576850298003, -0.211061058998374, -0.070215146739599, -0.18043081651515158, -0.12171789494473854, -0.14484462105675389, -0.16643679420936283, 0.4797557077549508, 0.18970438593131458, 0.26440221604689257, 0.10495446672665386, 0.39594391019546926, 0.01975882575294379, 0.13126213300922712, 0.0091092606818331, 0.14359744626448348, -0.021693878366699067, 0.07876870227665664, -0.15281329352495815, 0.09010170297490736, 0.16108039374293512]
|
1,803.05847
|
I Know What You See: Power Side-Channel Attack on Convolutional Neural
Network Accelerators
|
Deep learning has become the de-facto computational paradigm for various
kinds of perception problems, including many privacy-sensitive applications
such as online medical image analysis. No doubt to say, the data privacy of
these deep learning systems is a serious concern. Different from previous
research focusing on exploiting privacy leakage from deep learning models, in
this paper, we present the first attack on the implementation of deep learning
models. To be specific, we perform the attack on an FPGA-based convolutional
neural network accelerator and we manage to recover the input image from the
collected power traces without knowing the detailed parameters in the neural
network. For the MNIST dataset, our power side-channel attack is able to
achieve up to 89% recognition accuracy.
|
cs.CV cs.LG
|
deep learning has become the defacto computational paradigm for various kinds of perception problems including many privacysensitive applications such as online medical image analysis no doubt to say the data privacy of these deep learning systems is a serious concern different from previous research focusing on exploiting privacy leakage from deep learning models in this paper we present the first attack on the implementation of deep learning models to be specific we perform the attack on an fpgabased convolutional neural network accelerator and we manage to recover the input image from the collected power traces without knowing the detailed parameters in the neural network for the mnist dataset our power sidechannel attack is able to achieve up to 89 recognition accuracy
|
[['deep', 'learning', 'has', 'become', 'the', 'defacto', 'computational', 'paradigm', 'for', 'various', 'kinds', 'of', 'perception', 'problems', 'including', 'many', 'privacysensitive', 'applications', 'such', 'as', 'online', 'medical', 'image', 'analysis', 'no', 'doubt', 'to', 'say', 'the', 'data', 'privacy', 'of', 'these', 'deep', 'learning', 'systems', 'is', 'a', 'serious', 'concern', 'different', 'from', 'previous', 'research', 'focusing', 'on', 'exploiting', 'privacy', 'leakage', 'from', 'deep', 'learning', 'models', 'in', 'this', 'paper', 'we', 'present', 'the', 'first', 'attack', 'on', 'the', 'implementation', 'of', 'deep', 'learning', 'models', 'to', 'be', 'specific', 'we', 'perform', 'the', 'attack', 'on', 'an', 'fpgabased', 'convolutional', 'neural', 'network', 'accelerator', 'and', 'we', 'manage', 'to', 'recover', 'the', 'input', 'image', 'from', 'the', 'collected', 'power', 'traces', 'without', 'knowing', 'the', 'detailed', 'parameters', 'in', 'the', 'neural', 'network', 'for', 'the', 'mnist', 'dataset', 'our', 'power', 'sidechannel', 'attack', 'is', 'able', 'to', 'achieve', 'up', 'to', '89', 'recognition', 'accuracy']]
|
[-0.05293007657963259, -0.08726530262999803, -0.053461723275913677, 0.06718054688477904, -0.12422911591889445, -0.19765862607404835, 0.02795597197283983, 0.4205541217253228, -0.28278030425094625, -0.36710907524323655, 0.11742371527193314, -0.31245489453142583, -0.1868156626058573, 0.2465080687783905, -0.1698203855732933, 0.1500361580132268, 0.10219041890587874, 0.05949547160262904, -0.03571411686341378, -0.2985073576194488, 0.32377207316920037, 0.06006449617326167, 0.3649082956604721, 0.03751972301917012, 0.10910546715459825, -0.026394508224873502, -0.02438077147788376, -0.06441074624572965, -0.04366437292634702, 0.1675519343977409, 0.34797211197929595, 0.2676818409534402, 0.35687919557556386, -0.4614509408600813, -0.2311899434728933, 0.11659006323580715, 0.12662918728483794, 0.14562485848884443, -0.0664054957662963, -0.35096976605882824, 0.10201142039842719, -0.20269232007005245, 0.018800524586796267, -0.1359819712517552, -0.0484450147756614, -0.028900981761422778, -0.23266623382387328, -0.027337084905329077, 0.06222807309659552, 0.1187400939558779, -0.029122342243944565, -0.10518351086022809, 0.04870833347509192, 0.1830963897441845, 0.0417862632446576, 0.03609889458618627, 0.17528219923015284, -0.227576709573719, -0.136919855825172, 0.32854098968269413, -0.009761034918964401, -0.1504901090736909, 0.17896532799956227, 0.01725707678817028, -0.20343475611033765, 0.07121584033747473, 0.3266309952471128, 0.07403041526996569, -0.158470806896625, 0.025740797340404242, -0.0354138173563175, 0.21187685705598228, 0.06032722217053914, -0.007854202983531454, 0.15910990412052614, 0.29162851096061637, 0.024573849796506092, 0.12918446396866212, -0.14589608206860105, -0.06630663121935011, -0.20044953602727902, -0.06907684205500178, -0.15779861517362143, 0.03327310431752477, -0.07417631290132884, -0.11918499532794534, 0.40532970001289914, 0.2691911412384948, 0.1871960468297778, 0.09487733765012654, 0.4128052771605228, 0.01719568195668134, 0.14931555744645394, 0.12545025135459734, 0.21955076080827765, 0.008519904249278475, 0.17070593675290627, -0.15213276978682203, 0.09796075743800106, -0.023508147718500315]
|
1,803.05848
|
Towards Clinical Diagnosis: Automated Stroke Lesion Segmentation on
Multimodal MR Image Using Convolutional Neural Network
|
The patient with ischemic stroke can benefit most from the earliest possible
definitive diagnosis. While the high quality medical resources are quite scarce
across the globe, an automated diagnostic tool is expected in analyzing the
magnetic resonance (MR) images to provide reference in clinical diagnosis. In
this paper, we propose a deep learning method to automatically segment ischemic
stroke lesions from multi-modal MR images. By using atrous convolution and
global convolution network, our proposed residual-structured fully
convolutional network (Res-FCN) is able to capture features from large
receptive fields. The network architecture is validated on a large dataset of
212 clinically acquired multi-modal MR images, which is shown to achieve a mean
dice coefficient of 0.645 with a mean number of false negative lesions of
1.515. The false negatives can reach a value that close to a common medical
image doctor, making it exceptive for a real clinical application.
|
cs.CV cs.LG
|
the patient with ischemic stroke can benefit most from the earliest possible definitive diagnosis while the high quality medical resources are quite scarce across the globe an automated diagnostic tool is expected in analyzing the magnetic resonance mr images to provide reference in clinical diagnosis in this paper we propose a deep learning method to automatically segment ischemic stroke lesions from multimodal mr images by using atrous convolution and global convolution network our proposed residualstructured fully convolutional network resfcn is able to capture features from large receptive fields the network architecture is validated on a large dataset of 212 clinically acquired multimodal mr images which is shown to achieve a mean dice coefficient of 0645 with a mean number of false negative lesions of 1515 the false negatives can reach a value that close to a common medical image doctor making it exceptive for a real clinical application
|
[['the', 'patient', 'with', 'ischemic', 'stroke', 'can', 'benefit', 'most', 'from', 'the', 'earliest', 'possible', 'definitive', 'diagnosis', 'while', 'the', 'high', 'quality', 'medical', 'resources', 'are', 'quite', 'scarce', 'across', 'the', 'globe', 'an', 'automated', 'diagnostic', 'tool', 'is', 'expected', 'in', 'analyzing', 'the', 'magnetic', 'resonance', 'mr', 'images', 'to', 'provide', 'reference', 'in', 'clinical', 'diagnosis', 'in', 'this', 'paper', 'we', 'propose', 'a', 'deep', 'learning', 'method', 'to', 'automatically', 'segment', 'ischemic', 'stroke', 'lesions', 'from', 'multimodal', 'mr', 'images', 'by', 'using', 'atrous', 'convolution', 'and', 'global', 'convolution', 'network', 'our', 'proposed', 'residualstructured', 'fully', 'convolutional', 'network', 'resfcn', 'is', 'able', 'to', 'capture', 'features', 'from', 'large', 'receptive', 'fields', 'the', 'network', 'architecture', 'is', 'validated', 'on', 'a', 'large', 'dataset', 'of', '212', 'clinically', 'acquired', 'multimodal', 'mr', 'images', 'which', 'is', 'shown', 'to', 'achieve', 'a', 'mean', 'dice', 'coefficient', 'of', '0645', 'with', 'a', 'mean', 'number', 'of', 'false', 'negative', 'lesions', 'of', '1515', 'the', 'false', 'negatives', 'can', 'reach', 'a', 'value', 'that', 'close', 'to', 'a', 'common', 'medical', 'image', 'doctor', 'making', 'it', 'exceptive', 'for', 'a', 'real', 'clinical', 'application']]
|
[-0.008496094888060128, -0.0004523757932474837, -0.05790908339007854, 0.08580279163293669, -0.10033774122531558, -0.16832894624154693, 0.02307764631294613, 0.4213878716374266, -0.23108504856856346, -0.3415615521242906, 0.09216871427709301, -0.27402506140542443, -0.18304910694473775, 0.20866269916296004, -0.19498504431083286, 0.06723920849484596, 0.15055758567318192, 0.0828309091083015, 0.014018626351728392, -0.28263836071409026, 0.2384277585315807, 0.03988007170706184, 0.3628697287676663, 0.027924931103941696, 0.1160876234062016, -0.04563726912541636, -0.008442021424657312, 0.0012606260503224772, -0.03443669852331995, 0.16403094387677467, 0.384078666996532, 0.21030915065764866, 0.3661086006250618, -0.388881044615871, -0.214249068607801, 0.09564826241533818, 0.1395796356465796, 0.0917382143445891, -0.036188691672226735, -0.36730330632678393, 0.12437207266740533, -0.12373309105731033, -0.003711298220100459, -0.127793723858636, -0.0032353524801096525, -0.0623895187095482, -0.35440064442729385, 0.12482267207433952, -0.05029945719649951, 0.15525620002138973, -0.09207914186288313, -0.09888184957591624, 0.009789790206685148, 0.2064621743810331, 0.03131844778063482, 0.11271047248537171, 0.18045017024349613, -0.2288522297950012, -0.07631425382890578, 0.3110440779991191, 0.010247751588708368, -0.1569059911408815, 0.1723157677831578, -0.12194206620855579, -0.08960273730215328, 0.1747953163684699, 0.20400595264188173, 0.11654481759359096, -0.1976854620051795, -0.08245766507983529, 0.0016058018824470967, 0.19545981932816833, 0.06268358074514002, -0.07939334936632679, 0.21371884643870953, 0.22955205873425666, -0.014188338925355468, 0.14225909647628152, -0.2294402798818392, 0.02647109875608043, -0.2011260346220485, -0.1518548479432176, -0.18985045564617833, 0.02117358363426194, -0.09447364745458893, -0.19579349755257336, 0.40353496947550566, 0.20615882418150533, 0.18563087350399843, 0.0835255590225329, 0.33481915688382036, -0.0021499153443387355, 0.16571772280068875, 0.02004318047025851, 0.17142318422938216, 0.0379931528458436, 0.15152175266392015, -0.16543168235923453, 0.10244677147811986, 0.004707113524963116]
|
1,803.05849
|
XNORBIN: A 95 TOp/s/W Hardware Accelerator for Binary Convolutional
Neural Networks
|
Deploying state-of-the-art CNNs requires power-hungry processors and off-chip
memory. This precludes the implementation of CNNs in low-power embedded
systems. Recent research shows CNNs sustain extreme quantization, binarizing
their weights and intermediate feature maps, thereby saving 8-32\x memory and
collapsing energy-intensive sum-of-products into XNOR-and-popcount operations.
We present XNORBIN, an accelerator for binary CNNs with computation tightly
coupled to memory for aggressive data reuse. Implemented in UMC 65nm technology
XNORBIN achieves an energy efficiency of 95 TOp/s/W and an area efficiency of
2.0 TOp/s/MGE at 0.8 V.
|
cs.CV cs.AI cs.AR cs.NE eess.IV
|
deploying stateoftheart cnns requires powerhungry processors and offchip memory this precludes the implementation of cnns in lowpower embedded systems recent research shows cnns sustain extreme quantization binarizing their weights and intermediate feature maps thereby saving 832x memory and collapsing energyintensive sumofproducts into xnorandpopcount operations we present xnorbin an accelerator for binary cnns with computation tightly coupled to memory for aggressive data reuse implemented in umc 65nm technology xnorbin achieves an energy efficiency of 95 topsw and an area efficiency of 20 topsmge at 08 v
|
[['deploying', 'stateoftheart', 'cnns', 'requires', 'powerhungry', 'processors', 'and', 'offchip', 'memory', 'this', 'precludes', 'the', 'implementation', 'of', 'cnns', 'in', 'lowpower', 'embedded', 'systems', 'recent', 'research', 'shows', 'cnns', 'sustain', 'extreme', 'quantization', 'binarizing', 'their', 'weights', 'and', 'intermediate', 'feature', 'maps', 'thereby', 'saving', '832x', 'memory', 'and', 'collapsing', 'energyintensive', 'sumofproducts', 'into', 'xnorandpopcount', 'operations', 'we', 'present', 'xnorbin', 'an', 'accelerator', 'for', 'binary', 'cnns', 'with', 'computation', 'tightly', 'coupled', 'to', 'memory', 'for', 'aggressive', 'data', 'reuse', 'implemented', 'in', 'umc', '65nm', 'technology', 'xnorbin', 'achieves', 'an', 'energy', 'efficiency', 'of', '95', 'topsw', 'and', 'an', 'area', 'efficiency', 'of', '20', 'topsmge', 'at', '08', 'v']]
|
[-0.17443398701725527, 0.03628355495948199, 0.04421218550996855, -0.0228675606122124, -0.04420958327245898, -0.21927449556533246, 0.08262443282583262, 0.44970939654158426, -0.2129398294546263, -0.3744747792137787, 0.08055512159189675, -0.24183595246868209, -0.0694250321481377, 0.2459172842267435, -0.14089662926235177, 0.08875077142147347, 0.1384662283329817, -0.028652871857048012, -0.05384880056117254, -0.30307647262961834, 0.1894677893811604, 0.17885624132759403, 0.3834143076266628, 0.018537266133353113, 0.1310558210196177, -0.05778744729177561, -0.016417440370423718, -0.12597432910406497, -0.008170442245318554, 0.18232696442864835, 0.30193035493139175, 0.17609056250657887, 0.3199501237977529, -0.49592746225389417, -0.1830916359787807, 0.06178317874437198, 0.18197882184758782, 0.020419841492548586, -0.05791192858596332, -0.2551178816429456, 0.11505943550728262, -0.22720908778719603, -0.03091902820742689, -0.11893531529349274, 0.02181472487282008, -0.006678328791167587, -0.24767819511471317, 0.010501620424474823, 0.07543125366646564, 0.05049282680556644, -0.0246135354595026, -0.13664866383187474, 0.026006714743562042, 0.09893277119845152, -0.10445658444805303, 0.064343085285509, 0.1863286979321856, -0.18880058444046882, -0.13007291952817468, 0.2897006770130247, -0.002059660432860255, -0.14849315074970945, 0.1847507541620871, -0.017862164659891277, -0.14941335926414467, 0.13247859397670253, 0.2273541488801129, 0.04375942198093981, -0.11835411286592716, 0.07855341040703934, 0.1377776830107905, 0.2314508703071624, 0.09519309847382829, 0.10947188081336208, 0.20969310912769287, 0.3242413312662393, 0.045594471716322006, 0.15212282126231003, -0.14970910575648305, -0.0807510313588864, -0.15475354667869395, -0.14201574111939408, -0.1679396601888584, 0.03727111324551515, -0.1263188723118219, -0.09071707301191054, 0.34098569869529455, 0.15637686367845163, 0.14583852983778342, 0.1430076078948332, 0.3695430979831144, 0.052530473284423354, 0.2517091480327508, 0.1855246750754304, 0.1770819636527449, 0.048595541797112674, 0.19432609383584348, -0.1721121411115746, -0.03947121316887205, -0.03520926251076162]
|
1,803.0585
|
Vision-Aided Absolute Trajectory Estimation Using an Unsupervised Deep
Network with Online Error Correction
|
We present an unsupervised deep neural network approach to the fusion of
RGB-D imagery with inertial measurements for absolute trajectory estimation.
Our network, dubbed the Visual-Inertial-Odometry Learner (VIOLearner), learns
to perform visual-inertial odometry (VIO) without inertial measurement unit
(IMU) intrinsic parameters (corresponding to gyroscope and accelerometer bias
or white noise) or the extrinsic calibration between an IMU and camera. The
network learns to integrate IMU measurements and generate hypothesis
trajectories which are then corrected online according to the Jacobians of
scaled image projection errors with respect to a spatial grid of pixel
coordinates. We evaluate our network against state-of-the-art (SOA)
visual-inertial odometry, visual odometry, and visual simultaneous localization
and mapping (VSLAM) approaches on the KITTI Odometry dataset and demonstrate
competitive odometry performance.
|
cs.CV cs.RO
|
we present an unsupervised deep neural network approach to the fusion of rgbd imagery with inertial measurements for absolute trajectory estimation our network dubbed the visualinertialodometry learner violearner learns to perform visualinertial odometry vio without inertial measurement unit imu intrinsic parameters corresponding to gyroscope and accelerometer bias or white noise or the extrinsic calibration between an imu and camera the network learns to integrate imu measurements and generate hypothesis trajectories which are then corrected online according to the jacobians of scaled image projection errors with respect to a spatial grid of pixel coordinates we evaluate our network against stateoftheart soa visualinertial odometry visual odometry and visual simultaneous localization and mapping vslam approaches on the kitti odometry dataset and demonstrate competitive odometry performance
|
[['we', 'present', 'an', 'unsupervised', 'deep', 'neural', 'network', 'approach', 'to', 'the', 'fusion', 'of', 'rgbd', 'imagery', 'with', 'inertial', 'measurements', 'for', 'absolute', 'trajectory', 'estimation', 'our', 'network', 'dubbed', 'the', 'visualinertialodometry', 'learner', 'violearner', 'learns', 'to', 'perform', 'visualinertial', 'odometry', 'vio', 'without', 'inertial', 'measurement', 'unit', 'imu', 'intrinsic', 'parameters', 'corresponding', 'to', 'gyroscope', 'and', 'accelerometer', 'bias', 'or', 'white', 'noise', 'or', 'the', 'extrinsic', 'calibration', 'between', 'an', 'imu', 'and', 'camera', 'the', 'network', 'learns', 'to', 'integrate', 'imu', 'measurements', 'and', 'generate', 'hypothesis', 'trajectories', 'which', 'are', 'then', 'corrected', 'online', 'according', 'to', 'the', 'jacobians', 'of', 'scaled', 'image', 'projection', 'errors', 'with', 'respect', 'to', 'a', 'spatial', 'grid', 'of', 'pixel', 'coordinates', 'we', 'evaluate', 'our', 'network', 'against', 'stateoftheart', 'soa', 'visualinertial', 'odometry', 'visual', 'odometry', 'and', 'visual', 'simultaneous', 'localization', 'and', 'mapping', 'vslam', 'approaches', 'on', 'the', 'kitti', 'odometry', 'dataset', 'and', 'demonstrate', 'competitive', 'odometry', 'performance']]
|
[-0.06242120449896902, -0.027623061760823475, -0.06136473200749606, -0.02474461707849211, -0.08809646962132926, -0.2419949658253851, -0.023638963348154598, 0.5219725641266754, -0.2806950008807083, -0.33861511327025556, 0.0450446988727587, -0.3134852670443555, -0.1415327088170064, 0.17979694832902168, -0.27990739601664244, 0.14910858181780592, 0.2069548252678942, 0.04383371783139107, -0.07329777020495384, -0.2013081413441493, 0.24915753020710932, 0.0601843326020268, 0.3057110380847007, -0.05133698480203748, 0.2816767017201831, 0.017399471808069698, -0.08440255500221004, -0.03219249731682794, -0.03567248566541821, 0.16565658323427973, 0.271016802394297, 0.15727755864403056, 0.23085470614799608, -0.3601158226374537, -0.1742518679840335, 0.059282449885116266, 0.13200454252849644, 0.0549655115455001, -0.028079263636027463, -0.49962849624765415, 0.0551815375549874, -0.16215467173121093, 0.06047042433638126, -0.13961288028707106, -0.008092429131890337, -0.011836226286929256, -0.36390439317716905, 0.035530224190248795, 0.02477735534751749, 0.11177017143927515, -0.1373108109498086, -0.06920846555925285, 0.03362961850361899, 0.2452108163231363, -0.010399411847659697, 0.10638389209052548, 0.26540066658441597, -0.14781772533406184, -0.11449535498007511, 0.34608326179877624, -0.08980459873564542, -0.26318939309276174, 0.17422946874673167, -0.01283183484338224, -0.08947888640298819, 0.06488684259432678, 0.24930540722562, 0.07922143660640965, -0.18619248179602438, -0.01879685158007002, 0.004874562177186211, 0.21056045374522606, 0.01646951345416407, 0.0027673147172511867, 0.1581331180917914, 0.2303943848935887, 0.10929938594539029, 0.04450738339995344, -0.297593170425777, -0.020842674231001487, -0.19812756748870014, -0.08115032563218846, -0.17394455303438008, -0.061738215231647096, -0.1481393264007541, -0.15608848846362283, 0.3722101718109722, 0.33977495646104217, 0.21977799076315327, 0.14605299683850415, 0.5182555744890124, -0.023397079513718683, 0.08221373347720752, 0.07871921967404584, 0.22949955011717976, 0.00567170949652791, 0.10700852964558484, -0.2006931230966681, 0.028245662729023024, 0.12029584393603727]
|
1,803.05851
|
Image Registration Based Flicker Solving in Video Face Replacement and
Analysis Based Sub-pixel Image Registration
|
In this paper, a framework of video face replacement is proposed and it deals
with the flicker of swapped face in video sequence. This framework contains two
main innovations: 1) the technique of image registration is exploited to align
the source and target video faces for eliminating the flicker or jitter of the
segmented video face sequence; 2) a fast subpixel image registration method is
proposed for farther accuracy and efficiency. Unlike the priori works, it
minimizes the overlapping region and takes spatiotemporal coherence into
account. Flicker in resulted videos is usually caused by the frequently changed
bound of the blending target face and unregistered faces between and along
video sequences. The subpixel image registration method is proposed to solve
the flicker problem. During the alignment process, integer pixel registration
is formulated by maximizing the similarity of images with down sampling
strategy speeding up the process and sub-pixel image registration is a
single-step image match via analytic method. Experimental results show the
proposed algorithm reduces the computation time and gets a high accuracy when
conducting experiments on different data sets.
|
cs.CV
|
in this paper a framework of video face replacement is proposed and it deals with the flicker of swapped face in video sequence this framework contains two main innovations 1 the technique of image registration is exploited to align the source and target video faces for eliminating the flicker or jitter of the segmented video face sequence 2 a fast subpixel image registration method is proposed for farther accuracy and efficiency unlike the priori works it minimizes the overlapping region and takes spatiotemporal coherence into account flicker in resulted videos is usually caused by the frequently changed bound of the blending target face and unregistered faces between and along video sequences the subpixel image registration method is proposed to solve the flicker problem during the alignment process integer pixel registration is formulated by maximizing the similarity of images with down sampling strategy speeding up the process and subpixel image registration is a singlestep image match via analytic method experimental results show the proposed algorithm reduces the computation time and gets a high accuracy when conducting experiments on different data sets
|
[['in', 'this', 'paper', 'a', 'framework', 'of', 'video', 'face', 'replacement', 'is', 'proposed', 'and', 'it', 'deals', 'with', 'the', 'flicker', 'of', 'swapped', 'face', 'in', 'video', 'sequence', 'this', 'framework', 'contains', 'two', 'main', 'innovations', '1', 'the', 'technique', 'of', 'image', 'registration', 'is', 'exploited', 'to', 'align', 'the', 'source', 'and', 'target', 'video', 'faces', 'for', 'eliminating', 'the', 'flicker', 'or', 'jitter', 'of', 'the', 'segmented', 'video', 'face', 'sequence', '2', 'a', 'fast', 'subpixel', 'image', 'registration', 'method', 'is', 'proposed', 'for', 'farther', 'accuracy', 'and', 'efficiency', 'unlike', 'the', 'priori', 'works', 'it', 'minimizes', 'the', 'overlapping', 'region', 'and', 'takes', 'spatiotemporal', 'coherence', 'into', 'account', 'flicker', 'in', 'resulted', 'videos', 'is', 'usually', 'caused', 'by', 'the', 'frequently', 'changed', 'bound', 'of', 'the', 'blending', 'target', 'face', 'and', 'unregistered', 'faces', 'between', 'and', 'along', 'video', 'sequences', 'the', 'subpixel', 'image', 'registration', 'method', 'is', 'proposed', 'to', 'solve', 'the', 'flicker', 'problem', 'during', 'the', 'alignment', 'process', 'integer', 'pixel', 'registration', 'is', 'formulated', 'by', 'maximizing', 'the', 'similarity', 'of', 'images', 'with', 'down', 'sampling', 'strategy', 'speeding', 'up', 'the', 'process', 'and', 'subpixel', 'image', 'registration', 'is', 'a', 'singlestep', 'image', 'match', 'via', 'analytic', 'method', 'experimental', 'results', 'show', 'the', 'proposed', 'algorithm', 'reduces', 'the', 'computation', 'time', 'and', 'gets', 'a', 'high', 'accuracy', 'when', 'conducting', 'experiments', 'on', 'different', 'data', 'sets']]
|
[-0.0653505979752582, 0.004595437602903176, -0.07448404819394151, 0.04760553415538501, -0.03140391239301405, -0.1608399488678616, 0.022951912299807493, 0.47438539788126943, -0.27912786176635157, -0.364823088546594, 0.09939013322259092, -0.2763307144218642, -0.1431872688790059, 0.15584223811230105, -0.20925309165613726, 0.1002661960419371, 0.14676619823181278, 0.025687358378329212, -0.036156530388527446, -0.2667028363406037, 0.2557186359539628, 0.040527772812897135, 0.3521028267323143, 0.018230135042944715, 0.17347826257205776, 0.01901547104999837, -0.09414582212541266, -0.03457393641292583, -0.013253564823470596, 0.14383713018550123, 0.27302060005668966, 0.18313858482417547, 0.2835498675885093, -0.3999386011571106, -0.19194534017911388, 0.06103811898113539, 0.13725516717984446, 0.09270114949403149, -0.07517460681459245, -0.3375211101827315, 0.13035743185866724, -0.08157965496001351, -0.001044086778225998, -0.05365633373148739, -0.02814194002486248, -0.037446176965345836, -0.3051061289798882, 0.07086415893863887, 0.08001738630700857, 0.03349152631126344, -0.05617418464066254, -0.08149769008563858, 0.03729672250337899, 0.19131717502427315, 0.054524702789300744, 0.1202770497087234, 0.14537029666244053, -0.1527931560825285, -0.07597750717153152, 0.3973849151180022, -0.02522570865241707, -0.22001647672408986, 0.13597188997082413, -0.06456613869199322, -0.07873350891750305, 0.21880109998294048, 0.1808834319585003, 0.13293378730644084, -0.14594256512266132, 0.005457755433033324, 0.005675549629247851, 0.1975229642502705, 0.11875271368642441, -0.03264560556142694, 0.18532456225819058, 0.2303429608168598, 0.07485439571319148, 0.1640987979746165, -0.22345759575643268, -0.051213524115478824, -0.2135754832583997, -0.13273311138263025, -0.24029270194263921, -0.07500858566361583, -0.12580813403538843, -0.10337325234173073, 0.40995801999751064, 0.19019079643508627, 0.20309141723749538, 0.06100041938738691, 0.4078079530607081, 0.06666145542791733, 0.08152885485615116, 0.017280200235028235, 0.14504141379147767, 0.0068273435954728885, 0.11220236457948987, -0.18864614931711307, 0.07336474526414855, 0.10415140387938461]
|
1,803.05852
|
Paradigm and Paradox in Topology Control of Power Grids
|
Corrective Transmission Switching can be used by the grid operator to relieve
line overloading and voltage violations, improve system reliability, and reduce
system losses. Power grid optimization by means of line switching is typically
formulated as a mixed integer programming problem (MIP). Such problems are
known to be computationally intractable, and accordingly, a number of heuristic
approaches to grid topology reconfiguration have been proposed in the power
systems literature. By means of some low order examples (3-bus systems), it is
shown that within a reasonably large class of greedy heuristics, none can be
found that perform better than the others across all grid topologies. Despite
this cautionary tale, statistical evidence based on a large number of
simulations using using IEEE 118- bus systems indicates that among three
heuristics, a globally greedy heuristic is the most computationally intensive,
but has the best chance of reducing generation costs while enforcing N-1
connectivity. It is argued that, among all iterative methods, the locally
optimal switches at each stage have a better chance in not only approximating a
global optimal solution but also greatly limiting the number of lines that are
switched.
|
cs.SY
|
corrective transmission switching can be used by the grid operator to relieve line overloading and voltage violations improve system reliability and reduce system losses power grid optimization by means of line switching is typically formulated as a mixed integer programming problem mip such problems are known to be computationally intractable and accordingly a number of heuristic approaches to grid topology reconfiguration have been proposed in the power systems literature by means of some low order examples 3bus systems it is shown that within a reasonably large class of greedy heuristics none can be found that perform better than the others across all grid topologies despite this cautionary tale statistical evidence based on a large number of simulations using using ieee 118 bus systems indicates that among three heuristics a globally greedy heuristic is the most computationally intensive but has the best chance of reducing generation costs while enforcing n1 connectivity it is argued that among all iterative methods the locally optimal switches at each stage have a better chance in not only approximating a global optimal solution but also greatly limiting the number of lines that are switched
|
[['corrective', 'transmission', 'switching', 'can', 'be', 'used', 'by', 'the', 'grid', 'operator', 'to', 'relieve', 'line', 'overloading', 'and', 'voltage', 'violations', 'improve', 'system', 'reliability', 'and', 'reduce', 'system', 'losses', 'power', 'grid', 'optimization', 'by', 'means', 'of', 'line', 'switching', 'is', 'typically', 'formulated', 'as', 'a', 'mixed', 'integer', 'programming', 'problem', 'mip', 'such', 'problems', 'are', 'known', 'to', 'be', 'computationally', 'intractable', 'and', 'accordingly', 'a', 'number', 'of', 'heuristic', 'approaches', 'to', 'grid', 'topology', 'reconfiguration', 'have', 'been', 'proposed', 'in', 'the', 'power', 'systems', 'literature', 'by', 'means', 'of', 'some', 'low', 'order', 'examples', '3bus', 'systems', 'it', 'is', 'shown', 'that', 'within', 'a', 'reasonably', 'large', 'class', 'of', 'greedy', 'heuristics', 'none', 'can', 'be', 'found', 'that', 'perform', 'better', 'than', 'the', 'others', 'across', 'all', 'grid', 'topologies', 'despite', 'this', 'cautionary', 'tale', 'statistical', 'evidence', 'based', 'on', 'a', 'large', 'number', 'of', 'simulations', 'using', 'using', 'ieee', '118', 'bus', 'systems', 'indicates', 'that', 'among', 'three', 'heuristics', 'a', 'globally', 'greedy', 'heuristic', 'is', 'the', 'most', 'computationally', 'intensive', 'but', 'has', 'the', 'best', 'chance', 'of', 'reducing', 'generation', 'costs', 'while', 'enforcing', 'n1', 'connectivity', 'it', 'is', 'argued', 'that', 'among', 'all', 'iterative', 'methods', 'the', 'locally', 'optimal', 'switches', 'at', 'each', 'stage', 'have', 'a', 'better', 'chance', 'in', 'not', 'only', 'approximating', 'a', 'global', 'optimal', 'solution', 'but', 'also', 'greatly', 'limiting', 'the', 'number', 'of', 'lines', 'that', 'are', 'switched']]
|
[-0.1412910474312586, 0.03210246271176383, -0.0405333166288093, 0.07094571752253266, -0.09841972136339966, -0.19806374044856057, 0.10440001100737681, 0.39848744609898473, -0.25855610074606683, -0.3649114126220663, 0.1526162771339667, -0.24065599599952234, -0.17046050887624237, 0.22094285216162654, -0.08278444005570255, 0.10409530211658653, 0.07604995268852786, -0.023677841378772196, -0.02781418096794291, -0.28341697865819676, 0.2319615751918544, 0.07873108841359933, 0.2974111702184173, 0.01425196704742043, 0.06233553855030976, -0.037107157285642275, 0.012273009955645241, 0.11206266028370629, -0.032400127428193995, 0.08123626629760033, 0.29052727844100446, 0.17420327687943157, 0.32508787342862405, -0.4338790733922035, -0.22550032145165383, 0.14363831659082937, 0.165343014394587, 0.08645470727586801, -0.008835522205930481, -0.19869242397513479, 0.1395731092470282, -0.18338920972607237, -0.05934355695028492, -0.09879608280917114, 0.004929805941696457, 0.05626476870476952, -0.28721684040353096, 0.011522624808694286, 0.012364144952214778, 0.04260063106491369, -0.009759708920721599, -0.14400754326414514, -0.026333615190022565, 0.10121078961705318, 0.033809240033077274, 0.014259126047266925, 0.11456286860660878, -0.08691354171358089, -0.16450242135931362, 0.3798462788653659, 0.02440707905221411, -0.2253534158659564, 0.18453029657966716, -0.0645303348416185, -0.14618494438423596, 0.17620216876124725, 0.15511312381057266, 0.13482036175094222, -0.16866540781995085, 0.03736696695085947, -0.020919899669218252, 0.19719784422480363, 0.06062407170774098, 0.015769753546610057, 0.18581972856376755, 0.18402202947788496, 0.16144704207173607, 0.10595927432401135, -0.015276577798315285, -0.10596352417339036, -0.22339207364835756, -0.09063397081874737, -0.21342060953983047, 0.009364262118671174, -0.09226997075405806, -0.12276835496425306, 0.36471177415397177, 0.1649956384505284, 0.14613670771328505, 0.08462711238686832, 0.3268753162466307, 0.14438797910499604, 0.08497471780456761, 0.14187112948089403, 0.2217089467943724, 0.051493936430098135, 0.1023338485943857, -0.2179732539782677, 0.11349557130969071, 0.05624443906275159]
|
1,803.05853
|
Calculating the Midsagittal Plane for Symmetrical Bilateral Shapes:
Applications to Clinical Facial Surgical Planning
|
It is difficult to estimate the midsagittal plane of human subjects with
craniomaxillofacial (CMF) deformities. We have developed a LAndmark GEometric
Routine (LAGER), which automatically estimates a midsagittal plane for such
subjects. The LAGER algorithm was based on the assumption that the optimal
midsagittal plane of a patient with a deformity is the premorbid midsagittal
plane of the patient (i.e. hypothetically normal without deformity). The LAGER
algorithm consists of three steps. The first step quantifies the asymmetry of
the landmarks using a Euclidean distance matrix analysis and ranks the
landmarks according to their degree of asymmetry. The second step uses a
recursive algorithm to drop outlier landmarks. The third step inputs the
remaining landmarks into an optimization algorithm to determine an optimal
midsaggital plane. We validate LAGER on 20 synthetic models mimicking the
skulls of real patients with CMF deformities. The results indicated that all
the LAGER algorithm-generated midsagittal planes met clinical criteria. Thus it
can be used clinically to determine the midsagittal plane for patients with CMF
deformities.
|
cs.CV math.OC
|
it is difficult to estimate the midsagittal plane of human subjects with craniomaxillofacial cmf deformities we have developed a landmark geometric routine lager which automatically estimates a midsagittal plane for such subjects the lager algorithm was based on the assumption that the optimal midsagittal plane of a patient with a deformity is the premorbid midsagittal plane of the patient ie hypothetically normal without deformity the lager algorithm consists of three steps the first step quantifies the asymmetry of the landmarks using a euclidean distance matrix analysis and ranks the landmarks according to their degree of asymmetry the second step uses a recursive algorithm to drop outlier landmarks the third step inputs the remaining landmarks into an optimization algorithm to determine an optimal midsaggital plane we validate lager on 20 synthetic models mimicking the skulls of real patients with cmf deformities the results indicated that all the lager algorithmgenerated midsagittal planes met clinical criteria thus it can be used clinically to determine the midsagittal plane for patients with cmf deformities
|
[['it', 'is', 'difficult', 'to', 'estimate', 'the', 'midsagittal', 'plane', 'of', 'human', 'subjects', 'with', 'craniomaxillofacial', 'cmf', 'deformities', 'we', 'have', 'developed', 'a', 'landmark', 'geometric', 'routine', 'lager', 'which', 'automatically', 'estimates', 'a', 'midsagittal', 'plane', 'for', 'such', 'subjects', 'the', 'lager', 'algorithm', 'was', 'based', 'on', 'the', 'assumption', 'that', 'the', 'optimal', 'midsagittal', 'plane', 'of', 'a', 'patient', 'with', 'a', 'deformity', 'is', 'the', 'premorbid', 'midsagittal', 'plane', 'of', 'the', 'patient', 'ie', 'hypothetically', 'normal', 'without', 'deformity', 'the', 'lager', 'algorithm', 'consists', 'of', 'three', 'steps', 'the', 'first', 'step', 'quantifies', 'the', 'asymmetry', 'of', 'the', 'landmarks', 'using', 'a', 'euclidean', 'distance', 'matrix', 'analysis', 'and', 'ranks', 'the', 'landmarks', 'according', 'to', 'their', 'degree', 'of', 'asymmetry', 'the', 'second', 'step', 'uses', 'a', 'recursive', 'algorithm', 'to', 'drop', 'outlier', 'landmarks', 'the', 'third', 'step', 'inputs', 'the', 'remaining', 'landmarks', 'into', 'an', 'optimization', 'algorithm', 'to', 'determine', 'an', 'optimal', 'midsaggital', 'plane', 'we', 'validate', 'lager', 'on', '20', 'synthetic', 'models', 'mimicking', 'the', 'skulls', 'of', 'real', 'patients', 'with', 'cmf', 'deformities', 'the', 'results', 'indicated', 'that', 'all', 'the', 'lager', 'algorithmgenerated', 'midsagittal', 'planes', 'met', 'clinical', 'criteria', 'thus', 'it', 'can', 'be', 'used', 'clinically', 'to', 'determine', 'the', 'midsagittal', 'plane', 'for', 'patients', 'with', 'cmf', 'deformities']]
|
[-0.0617981779219752, 0.02117225022467954, -0.10560048129233164, 0.06029887199825184, -0.10332296223972331, -0.12666476551640893, 0.07234178116601525, 0.3797408492445494, -0.19003589550654093, -0.3206184453584931, 0.10095809366497578, -0.26993234878349487, -0.15362462390630477, 0.19125833490045008, -0.10068921683934715, 0.07503594123955928, 0.0744880515912717, 0.05296531042761423, -0.045429934264922686, -0.28158137919310705, 0.2680306026458063, 0.01648256979939161, 0.29691616673512866, -0.036482509253828815, 0.11997521027259415, 0.01851203237998892, -0.01758550852537155, 0.006444895525320052, -0.11579115671770661, 0.11649576857488489, 0.2701893372174792, 0.1808911202701204, 0.26815778019301817, -0.36360655168466494, -0.14398426926610144, 0.11323975112684297, 0.12243680369362912, 0.10231394252358851, 0.018573199775577948, -0.3100311324931681, 0.12040437067379102, -0.060206559871298714, -0.11037090511879687, -0.002811124992810867, -0.004502296035714222, -0.024001363721309288, -0.30613040589360574, 0.0922457446569972, 0.007924959395137248, 0.10069546990632786, -0.06215822486432664, -0.136377612109804, -0.03323152218804215, 0.1883780868808654, 0.036601887668736954, 0.10726090160508951, 0.1716053524708982, -0.08302502244936698, -0.09796637561609686, 0.3641147718172182, 0.04647278981565526, -0.20209248335749813, 0.11793998651573379, -0.10851636264247425, -0.10579327119119239, 0.14705776013433933, 0.17611225021607949, 0.12198112671630401, -0.15301802163858982, -0.04346197488555459, -0.04624387685096625, 0.18536857934104223, 0.06421392359065287, -0.11618291666787682, 0.14592819549002206, 0.16439934136966863, 0.07336938681193825, 0.11060487638777969, -0.16202031628821384, -0.020897585694029025, -0.2697329566842227, -0.1499606573559118, -0.172520399742026, -0.03545591960534115, -0.14742784280264679, -0.1502438013074976, 0.4022082041906701, 0.14551309471964047, 0.2245853898933891, 0.08011711264015034, 0.3128720616075126, 0.06076684626609539, 0.10276484229567966, 0.03949899512032668, 0.19605555708491892, 0.07869645592255631, 0.057132228150625124, -0.2031247851257142, 0.12077422370626167, 0.07307592419427679]
|
1,803.05854
|
Development and Validation of Deep Learning Algorithms for Detection of
Critical Findings in Head CT Scans
|
Importance: Non-contrast head CT scan is the current standard for initial
imaging of patients with head trauma or stroke symptoms.
Objective: To develop and validate a set of deep learning algorithms for
automated detection of following key findings from non-contrast head CT scans:
intracranial hemorrhage (ICH) and its types, intraparenchymal (IPH),
intraventricular (IVH), subdural (SDH), extradural (EDH) and subarachnoid (SAH)
hemorrhages, calvarial fractures, midline shift and mass effect.
Design and Settings: We retrospectively collected a dataset containing
313,318 head CT scans along with their clinical reports from various centers. A
part of this dataset (Qure25k dataset) was used to validate and the rest to
develop algorithms. Additionally, a dataset (CQ500 dataset) was collected from
different centers in two batches B1 & B2 to clinically validate the algorithms.
Main Outcomes and Measures: Original clinical radiology report and consensus
of three independent radiologists were considered as gold standard for Qure25k
and CQ500 datasets respectively. Area under receiver operating characteristics
curve (AUC) for each finding was primarily used to evaluate the algorithms.
Results: Qure25k dataset contained 21,095 scans (mean age 43.31; 42.87%
female) while batches B1 and B2 of CQ500 dataset consisted of 214 (mean age
43.40; 43.92% female) and 277 (mean age 51.70; 30.31% female) scans
respectively. On Qure25k dataset, the algorithms achieved AUCs of 0.9194,
0.8977, 0.9559, 0.9161, 0.9288 and 0.9044 for detecting ICH, IPH, IVH, SDH, EDH
and SAH respectively. AUCs for the same on CQ500 dataset were 0.9419, 0.9544,
0.9310, 0.9521, 0.9731 and 0.9574 respectively. For detecting calvarial
fractures, midline shift and mass effect, AUCs on Qure25k dataset were 0.9244,
0.9276 and 0.8583 respectively, while AUCs on CQ500 dataset were 0.9624, 0.9697
and 0.9216 respectively.
|
cs.CV
|
importance noncontrast head ct scan is the current standard for initial imaging of patients with head trauma or stroke symptoms objective to develop and validate a set of deep learning algorithms for automated detection of following key findings from noncontrast head ct scans intracranial hemorrhage ich and its types intraparenchymal iph intraventricular ivh subdural sdh extradural edh and subarachnoid sah hemorrhages calvarial fractures midline shift and mass effect design and settings we retrospectively collected a dataset containing 313318 head ct scans along with their clinical reports from various centers a part of this dataset qure25k dataset was used to validate and the rest to develop algorithms additionally a dataset cq500 dataset was collected from different centers in two batches b1 b2 to clinically validate the algorithms main outcomes and measures original clinical radiology report and consensus of three independent radiologists were considered as gold standard for qure25k and cq500 datasets respectively area under receiver operating characteristics curve auc for each finding was primarily used to evaluate the algorithms results qure25k dataset contained 21095 scans mean age 4331 4287 female while batches b1 and b2 of cq500 dataset consisted of 214 mean age 4340 4392 female and 277 mean age 5170 3031 female scans respectively on qure25k dataset the algorithms achieved aucs of 09194 08977 09559 09161 09288 and 09044 for detecting ich iph ivh sdh edh and sah respectively aucs for the same on cq500 dataset were 09419 09544 09310 09521 09731 and 09574 respectively for detecting calvarial fractures midline shift and mass effect aucs on qure25k dataset were 09244 09276 and 08583 respectively while aucs on cq500 dataset were 09624 09697 and 09216 respectively
|
[['importance', 'noncontrast', 'head', 'ct', 'scan', 'is', 'the', 'current', 'standard', 'for', 'initial', 'imaging', 'of', 'patients', 'with', 'head', 'trauma', 'or', 'stroke', 'symptoms', 'objective', 'to', 'develop', 'and', 'validate', 'a', 'set', 'of', 'deep', 'learning', 'algorithms', 'for', 'automated', 'detection', 'of', 'following', 'key', 'findings', 'from', 'noncontrast', 'head', 'ct', 'scans', 'intracranial', 'hemorrhage', 'ich', 'and', 'its', 'types', 'intraparenchymal', 'iph', 'intraventricular', 'ivh', 'subdural', 'sdh', 'extradural', 'edh', 'and', 'subarachnoid', 'sah', 'hemorrhages', 'calvarial', 'fractures', 'midline', 'shift', 'and', 'mass', 'effect', 'design', 'and', 'settings', 'we', 'retrospectively', 'collected', 'a', 'dataset', 'containing', '313318', 'head', 'ct', 'scans', 'along', 'with', 'their', 'clinical', 'reports', 'from', 'various', 'centers', 'a', 'part', 'of', 'this', 'dataset', 'qure25k', 'dataset', 'was', 'used', 'to', 'validate', 'and', 'the', 'rest', 'to', 'develop', 'algorithms', 'additionally', 'a', 'dataset', 'cq500', 'dataset', 'was', 'collected', 'from', 'different', 'centers', 'in', 'two', 'batches', 'b1', 'b2', 'to', 'clinically', 'validate', 'the', 'algorithms', 'main', 'outcomes', 'and', 'measures', 'original', 'clinical', 'radiology', 'report', 'and', 'consensus', 'of', 'three', 'independent', 'radiologists', 'were', 'considered', 'as', 'gold', 'standard', 'for', 'qure25k', 'and', 'cq500', 'datasets', 'respectively', 'area', 'under', 'receiver', 'operating', 'characteristics', 'curve', 'auc', 'for', 'each', 'finding', 'was', 'primarily', 'used', 'to', 'evaluate', 'the', 'algorithms', 'results', 'qure25k', 'dataset', 'contained', '21095', 'scans', 'mean', 'age', '4331', '4287', 'female', 'while', 'batches', 'b1', 'and', 'b2', 'of', 'cq500', 'dataset', 'consisted', 'of', '214', 'mean', 'age', '4340', '4392', 'female', 'and', '277', 'mean', 'age', '5170', '3031', 'female', 'scans', 'respectively', 'on', 'qure25k', 'dataset', 'the', 'algorithms', 'achieved', 'aucs', 'of', '09194', '08977', '09559', '09161', '09288', 'and', '09044', 'for', 'detecting', 'ich', 'iph', 'ivh', 'sdh', 'edh', 'and', 'sah', 'respectively', 'aucs', 'for', 'the', 'same', 'on', 'cq500', 'dataset', 'were', '09419', '09544', '09310', '09521', '09731', 'and', '09574', 'respectively', 'for', 'detecting', 'calvarial', 'fractures', 'midline', 'shift', 'and', 'mass', 'effect', 'aucs', 'on', 'qure25k', 'dataset', 'were', '09244', '09276', 'and', '08583', 'respectively', 'while', 'aucs', 'on', 'cq500', 'dataset', 'were', '09624', '09697', 'and', '09216', 'respectively']]
|
[-0.026154142225206626, 0.030167530638135483, -0.031122410191011016, 0.037340248047139465, -0.051371126465037525, -0.17269441336431215, 0.05784576003912011, 0.42112027201044366, -0.12842011439606427, -0.3709514345898013, 0.13175197127152127, -0.35385435824926065, -0.07188762956189097, 0.24419190147531983, -0.15118451420089032, 0.027964495839617343, 0.12904806677119549, 0.03921282792660764, 0.005188940293572056, -0.2586178191681014, 0.20552654766640435, 0.0049793426782920635, 0.34178094260254493, 0.022643106187195932, 0.11140579163481111, -0.030863791702284923, -0.035933981148897086, 0.007072529320158367, -0.0887868245117124, 0.08676337745188303, 0.27453386294276916, 0.1820515728835951, 0.27851245117684204, -0.34094627331412297, -0.13041756507880017, 0.07274745866974316, 0.11605001239738298, 0.03950048348450195, -0.023946718199224008, -0.3772382218810934, 0.0942311111432538, -0.09466221410214094, 0.005433759900998718, -0.01698566734699941, 0.03066804206256217, -0.02274298339200062, -0.28045147912963897, 0.17687156118217826, -0.07411759509326421, 0.19647826461454596, -0.13851462761403963, -0.22839634350076984, -0.008716259997364558, 0.17632029017781822, 0.040859371574209415, 0.06921290987875403, 0.19681795419012083, -0.1270358153076488, -0.13876285746847886, 0.304213514225936, -0.006363777118182279, -0.08210552875077962, 0.15599539242609123, -0.10183631513093606, -0.09950284534787032, 0.11441995762383217, 0.22305354692905052, 0.10496429925475921, -0.18203582262101667, -0.064432507848634, 0.004705809070246022, 0.172291360513451, 0.10892298516942324, -0.11283138722874134, 0.10552533532538247, 0.1794784917064083, -0.07405512696662085, 0.11851156946760034, -0.24500963863220096, 0.015105236228934027, -0.18369379830054514, -0.13495991456632814, -0.097643418054899, -0.01669738951188368, -0.08244417273391907, -0.13249687652924189, 0.4050310257352828, 0.15410471940413117, 0.14853910301581055, 0.07826985081665339, 0.2743641275276498, -0.0819011681610354, 0.10367875314687712, 0.04978232573891982, 0.15460968416194124, 0.029628594298051987, 0.11300614485857872, -0.21513427938599655, 0.094555295182286, 0.006330594619190911]
|
1,803.05855
|
A game-theoretic mechanism for aggregation and dispersal of interacting
populations
|
We adapt a fitness function from evolutionary game theory as a mechanism for
aggregation and dispersal in a partial differential equation (PDE) model of two
interacting populations, described by density functions $u$ and $v$. We
consider a spatial model where individuals migrate up local fitness gradients,
seeking out locations where their given traits are more advantageous. The
resulting system of fitness gradient equations is a degenerate system having
spatially structured, smooth, steady state solutions characterized by constant
fitness throughout the domain. When populations are viewed as predator and
prey, our model captures prey aggregation behavior consistent with Hamilton's
selfish herd hypothesis. We also present weak steady state solutions in 1d that
are continuous but in general not smooth everywhere, with an associated fitness
that is discontinuous, piecewise constant. We give numerical examples of
solutions that evolve toward such weak steady states. We also give an example
of a spatial Lotka--Volterra model, where a fitness gradient flux creates
instabilities that lead to spatially structured steady states. Our results also
suggest that when fitness has some dependence on local interactions, a
fitness-based dispersal mechanism may act to create spatial variation across a
habitat.
|
q-bio.PE
|
we adapt a fitness function from evolutionary game theory as a mechanism for aggregation and dispersal in a partial differential equation pde model of two interacting populations described by density functions u and v we consider a spatial model where individuals migrate up local fitness gradients seeking out locations where their given traits are more advantageous the resulting system of fitness gradient equations is a degenerate system having spatially structured smooth steady state solutions characterized by constant fitness throughout the domain when populations are viewed as predator and prey our model captures prey aggregation behavior consistent with hamiltons selfish herd hypothesis we also present weak steady state solutions in 1d that are continuous but in general not smooth everywhere with an associated fitness that is discontinuous piecewise constant we give numerical examples of solutions that evolve toward such weak steady states we also give an example of a spatial lotkavolterra model where a fitness gradient flux creates instabilities that lead to spatially structured steady states our results also suggest that when fitness has some dependence on local interactions a fitnessbased dispersal mechanism may act to create spatial variation across a habitat
|
[['we', 'adapt', 'a', 'fitness', 'function', 'from', 'evolutionary', 'game', 'theory', 'as', 'a', 'mechanism', 'for', 'aggregation', 'and', 'dispersal', 'in', 'a', 'partial', 'differential', 'equation', 'pde', 'model', 'of', 'two', 'interacting', 'populations', 'described', 'by', 'density', 'functions', 'u', 'and', 'v', 'we', 'consider', 'a', 'spatial', 'model', 'where', 'individuals', 'migrate', 'up', 'local', 'fitness', 'gradients', 'seeking', 'out', 'locations', 'where', 'their', 'given', 'traits', 'are', 'more', 'advantageous', 'the', 'resulting', 'system', 'of', 'fitness', 'gradient', 'equations', 'is', 'a', 'degenerate', 'system', 'having', 'spatially', 'structured', 'smooth', 'steady', 'state', 'solutions', 'characterized', 'by', 'constant', 'fitness', 'throughout', 'the', 'domain', 'when', 'populations', 'are', 'viewed', 'as', 'predator', 'and', 'prey', 'our', 'model', 'captures', 'prey', 'aggregation', 'behavior', 'consistent', 'with', 'hamiltons', 'selfish', 'herd', 'hypothesis', 'we', 'also', 'present', 'weak', 'steady', 'state', 'solutions', 'in', '1d', 'that', 'are', 'continuous', 'but', 'in', 'general', 'not', 'smooth', 'everywhere', 'with', 'an', 'associated', 'fitness', 'that', 'is', 'discontinuous', 'piecewise', 'constant', 'we', 'give', 'numerical', 'examples', 'of', 'solutions', 'that', 'evolve', 'toward', 'such', 'weak', 'steady', 'states', 'we', 'also', 'give', 'an', 'example', 'of', 'a', 'spatial', 'lotkavolterra', 'model', 'where', 'a', 'fitness', 'gradient', 'flux', 'creates', 'instabilities', 'that', 'lead', 'to', 'spatially', 'structured', 'steady', 'states', 'our', 'results', 'also', 'suggest', 'that', 'when', 'fitness', 'has', 'some', 'dependence', 'on', 'local', 'interactions', 'a', 'fitnessbased', 'dispersal', 'mechanism', 'may', 'act', 'to', 'create', 'spatial', 'variation', 'across', 'a', 'habitat']]
|
[-0.11870639903424551, 0.1249646752164882, -0.10291026676889187, 0.08740632561357273, -0.04369113919281289, -0.22229001988749464, 0.03694692447827885, 0.38544319489122375, -0.3065896283649883, -0.2258818172581533, 0.06063140503372217, -0.24405099328909635, -0.1928663535448308, 0.09793203308963806, -0.06539997380197594, -0.028669697659502186, 0.05582812643751346, -0.016738957693771074, 0.03879503354636516, -0.24388759112819366, 0.35130268587189584, -0.017149466170358875, 0.23927660456356345, -0.014237974409540598, 0.13815264891789183, -0.07596401502841509, 0.01719335426517923, 0.06765155836084068, -0.1342543676975613, 0.0459207348368272, 0.24149050343664685, 0.1356162201931349, 0.35983847063132296, -0.4442866739295228, -0.2589319288580988, 0.14463166337635816, 0.17970816487341593, 0.1553015284123221, -0.06622006965739255, -0.2814392302190173, 0.019163706205500026, -0.16578516183928124, -0.17571021350166463, -0.08153455044235547, 0.02160471513945395, 0.10063750672285782, -0.30193200024059386, 0.15336593737443593, 0.022986181570992303, 0.06470263636724644, -0.13960790532855658, -0.08590974201904171, -0.12251702054155045, 0.11546023383752457, 0.035005284785975685, 0.0069730516464610376, 0.14141345929344676, -0.14404374577290335, -0.0941722508390673, 0.31259506910305507, -0.10008022837896699, -0.27005234074227863, 0.24491123422000224, -0.11577158799170667, -0.08307854093474712, 0.11932358611253192, 0.18113499323115806, 0.12459924832688576, -0.1532750922574903, 0.030724031947340136, -0.049641829712379786, 0.170580840476969, 0.027074426454028692, 0.0018599007211025824, 0.18696970740791546, 0.16860908290239646, 0.15924587465715423, 0.09559121467928886, -0.014952712991282207, -0.1985254866724434, -0.2651289724379154, -0.09624132704530984, -0.1199534879070926, 0.08354531133345375, -0.10705909064624407, -0.20865885897403028, 0.39748463259201683, 0.10566628007254812, 0.21286003847474827, 0.11651239389811487, 0.22905609191697657, 0.11936823769316507, 0.008484566570820374, 0.07486054943252785, 0.1585939575264935, 0.07044502133040333, 0.11802989631435341, -0.22136743820311394, 0.1360324673927255, 0.04475681014305361]
|
1,803.05856
|
Off-axis afterglow light curves and images from 2D hydrodynamic
simulations of double-sided GRB jets in a stratified external medium
|
Gamma-ray burst (GRB) jets are narrow, and thus typically point away from us.
They are initially ultra-relativistic, causing their prompt $\gamma$-ray and
early afterglow emission to be beamed away from us. However, as the jet
gradually decelerates its beaming cone widens and eventually reaches our line
of sight and the afterglow emission may be detected. Such orphan afterglows
were not clearly detected so far. Nevertheless, they should be detected in
upcoming optical or radio surveys, and it would be challenging to clearly
distinguish between them and other types of transients. Therefore, we perform
detailed, realistic calculations of the expected afterglow emission from GRB
jets viewed at different angles from the jet's symmetry axis. The dynamics are
calculated using 2D relativistic hydrodynamics simulations of jets propagating
into different power-law external density profiles, $\rho_{\rm
ext}\propto{}R^{-k}$ for $k=0,\,1,\,1.5,\,2$, ranging from a uniform ISM-like
medium ($k=0$) to a stratified steady stellar-wind like profile ($k=2$). We
calculate radio, optical and X-ray lightcurves, and the evolution of the radio
afterglow image size, shape and flux centroid. This may help identify
misaligned relativistic jets, whether initially ultra-relativistic and
producing a GRB for observers within their beam, or (possibly intrinsically
more common) moderately relativistic, in either (i) nearby supernovae Ib/c
(some of which are associated with long duration GRBs), or (ii) in binary
neutron star mergers, which may produce short duration GRBs, and may also be
detected in gravitational waves (e.g. GW$\,$170827/GRB$\,$170817A with a weak
prompt $\gamma$-ray emission may harbor an off-axis jet).
|
astro-ph.HE
|
gammaray burst grb jets are narrow and thus typically point away from us they are initially ultrarelativistic causing their prompt gammaray and early afterglow emission to be beamed away from us however as the jet gradually decelerates its beaming cone widens and eventually reaches our line of sight and the afterglow emission may be detected such orphan afterglows were not clearly detected so far nevertheless they should be detected in upcoming optical or radio surveys and it would be challenging to clearly distinguish between them and other types of transients therefore we perform detailed realistic calculations of the expected afterglow emission from grb jets viewed at different angles from the jets symmetry axis the dynamics are calculated using 2d relativistic hydrodynamics simulations of jets propagating into different powerlaw external density profiles rho_rm extproptork for k01152 ranging from a uniform ismlike medium k0 to a stratified steady stellarwind like profile k2 we calculate radio optical and xray lightcurves and the evolution of the radio afterglow image size shape and flux centroid this may help identify misaligned relativistic jets whether initially ultrarelativistic and producing a grb for observers within their beam or possibly intrinsically more common moderately relativistic in either i nearby supernovae ibc some of which are associated with long duration grbs or ii in binary neutron star mergers which may produce short duration grbs and may also be detected in gravitational waves eg gw170827grb170817a with a weak prompt gammaray emission may harbor an offaxis jet
|
[['gammaray', 'burst', 'grb', 'jets', 'are', 'narrow', 'and', 'thus', 'typically', 'point', 'away', 'from', 'us', 'they', 'are', 'initially', 'ultrarelativistic', 'causing', 'their', 'prompt', 'gammaray', 'and', 'early', 'afterglow', 'emission', 'to', 'be', 'beamed', 'away', 'from', 'us', 'however', 'as', 'the', 'jet', 'gradually', 'decelerates', 'its', 'beaming', 'cone', 'widens', 'and', 'eventually', 'reaches', 'our', 'line', 'of', 'sight', 'and', 'the', 'afterglow', 'emission', 'may', 'be', 'detected', 'such', 'orphan', 'afterglows', 'were', 'not', 'clearly', 'detected', 'so', 'far', 'nevertheless', 'they', 'should', 'be', 'detected', 'in', 'upcoming', 'optical', 'or', 'radio', 'surveys', 'and', 'it', 'would', 'be', 'challenging', 'to', 'clearly', 'distinguish', 'between', 'them', 'and', 'other', 'types', 'of', 'transients', 'therefore', 'we', 'perform', 'detailed', 'realistic', 'calculations', 'of', 'the', 'expected', 'afterglow', 'emission', 'from', 'grb', 'jets', 'viewed', 'at', 'different', 'angles', 'from', 'the', 'jets', 'symmetry', 'axis', 'the', 'dynamics', 'are', 'calculated', 'using', '2d', 'relativistic', 'hydrodynamics', 'simulations', 'of', 'jets', 'propagating', 'into', 'different', 'powerlaw', 'external', 'density', 'profiles', 'rho_rm', 'extproptork', 'for', 'k01152', 'ranging', 'from', 'a', 'uniform', 'ismlike', 'medium', 'k0', 'to', 'a', 'stratified', 'steady', 'stellarwind', 'like', 'profile', 'k2', 'we', 'calculate', 'radio', 'optical', 'and', 'xray', 'lightcurves', 'and', 'the', 'evolution', 'of', 'the', 'radio', 'afterglow', 'image', 'size', 'shape', 'and', 'flux', 'centroid', 'this', 'may', 'help', 'identify', 'misaligned', 'relativistic', 'jets', 'whether', 'initially', 'ultrarelativistic', 'and', 'producing', 'a', 'grb', 'for', 'observers', 'within', 'their', 'beam', 'or', 'possibly', 'intrinsically', 'more', 'common', 'moderately', 'relativistic', 'in', 'either', 'i', 'nearby', 'supernovae', 'ibc', 'some', 'of', 'which', 'are', 'associated', 'with', 'long', 'duration', 'grbs', 'or', 'ii', 'in', 'binary', 'neutron', 'star', 'mergers', 'which', 'may', 'produce', 'short', 'duration', 'grbs', 'and', 'may', 'also', 'be', 'detected', 'in', 'gravitational', 'waves', 'eg', 'gw170827grb170817a', 'with', 'a', 'weak', 'prompt', 'gammaray', 'emission', 'may', 'harbor', 'an', 'offaxis', 'jet']]
|
[-0.06163603062731837, 0.1991148973351045, -0.09138765907846391, 0.18451193444770453, -0.16014079622535304, -0.17030768510635388, 0.0028956868702137827, 0.509344814899416, -0.21837584824447542, -0.30743441139761557, 0.04126572118079182, -0.31243758535874655, 0.04181821168350317, 0.22992740974737252, 0.024545506628061604, -0.044200515894321266, 0.096028204966425, -0.11246199240092157, -0.0743423668414639, -0.15223773544527253, 0.25355032957947915, 0.12188706395297104, 0.1639883128440533, -0.019787963665324294, 0.017416871909517795, -0.05828844234039468, -0.05765502667054534, 0.003964631875961526, -0.06730800474443557, -0.03382306389437511, 0.2352760994031425, 0.1367548576379118, 0.15616622556491383, -0.4469053978793138, -0.2616374864260289, 0.10518054051848114, 0.20631841599886172, 0.0525028560116256, -0.018179573981037984, -0.3219954442432004, 0.03946140575923087, -0.21546843459142742, -0.1941892978742965, 0.06598203040251494, 0.029347483057159285, 0.08231071773233385, -0.17235097815816613, 0.10887714657042688, 0.0112301662750927, 0.023479352361436747, -0.06674166726889397, 0.007938545478184608, -0.04820255514557573, 0.04731677330535844, 0.10348242870531976, 0.09728473719317189, 0.18087165891664286, -0.163985461155609, -0.07352284477034599, 0.44654138485346884, 0.005043621702227464, 0.003657554988249028, 0.24146728962178782, -0.22251117904189482, -0.16181181568252154, 0.24797760587847553, 0.1946407111697399, 0.09700920872009275, -0.11528130869423463, -0.10925913558217451, 0.013020143857175747, 0.16677321910904816, 0.06048419172125137, 0.08891187146814032, 0.3703048934713622, 0.05908166961638595, -0.021923617921165414, 0.09620985079894404, -0.24611157280802323, 0.02307021054766364, -0.29745018972307136, -0.05743054474977207, -0.12992505477702876, 0.17341877066455483, -0.08581608046772976, -0.13185010293927016, 0.3726773066426943, 0.07514091348323648, 0.17073789716136356, 0.012276461340721759, 0.29498771479553426, 0.06797985803126165, 0.04941363177408487, 0.17752382265931102, 0.36780891598123877, 0.10218262980010914, 0.11455486008073858, -0.17597389113146442, 0.11419042564008755, -0.017471792880630443]
|
1,803.05857
|
On some random variables involving Bernoulli random variable
|
Motivated by the recent investigations given in [25] and the fact that
Bernoulli probability-type models were often used in the study on some problems
in theory of compressive sensing, here we define and study the complex-valued
discrete random variables $\widetilde{X}_l(m,N)$ ($0\le l\le N-1$, $1\le m\le
N$). Each of these random variables is defined as a linear combination of $N$
independent identically distributed $0-1$ Bernoulli random variables. We prove
that for $l\not=0$, $\widetilde{X}_l(m,N)$ is the zero-mean random variable,
and we also determine the variance of $\widetilde{X}_l(m,N)$ and its real and
imaginary parts. Notice that $\widetilde{X}_l(m,N)$ belongs to the class of
sub-Gaussian random variables that are significant in some areas of theory of
compressive sensing. In particular, we prove some probability estimates for the
mentioned random variables. These estimates are used to establish the upper
bounds of the sub-Gaussian norm of their real and imaginary parts. We believe
that our results should be implemented in certain applications of sub-Gaussian
random variables for solving some problems in compressive sensing of sparse
signals.
|
math.PR math.NT
|
motivated by the recent investigations given in 25 and the fact that bernoulli probabilitytype models were often used in the study on some problems in theory of compressive sensing here we define and study the complexvalued discrete random variables widetildex_lmn 0le lle n1 1le mle n each of these random variables is defined as a linear combination of n independent identically distributed 01 bernoulli random variables we prove that for lnot0 widetildex_lmn is the zeromean random variable and we also determine the variance of widetildex_lmn and its real and imaginary parts notice that widetildex_lmn belongs to the class of subgaussian random variables that are significant in some areas of theory of compressive sensing in particular we prove some probability estimates for the mentioned random variables these estimates are used to establish the upper bounds of the subgaussian norm of their real and imaginary parts we believe that our results should be implemented in certain applications of subgaussian random variables for solving some problems in compressive sensing of sparse signals
|
[['motivated', 'by', 'the', 'recent', 'investigations', 'given', 'in', '25', 'and', 'the', 'fact', 'that', 'bernoulli', 'probabilitytype', 'models', 'were', 'often', 'used', 'in', 'the', 'study', 'on', 'some', 'problems', 'in', 'theory', 'of', 'compressive', 'sensing', 'here', 'we', 'define', 'and', 'study', 'the', 'complexvalued', 'discrete', 'random', 'variables', 'widetildex_lmn', '0le', 'lle', 'n1', '1le', 'mle', 'n', 'each', 'of', 'these', 'random', 'variables', 'is', 'defined', 'as', 'a', 'linear', 'combination', 'of', 'n', 'independent', 'identically', 'distributed', '01', 'bernoulli', 'random', 'variables', 'we', 'prove', 'that', 'for', 'lnot0', 'widetildex_lmn', 'is', 'the', 'zeromean', 'random', 'variable', 'and', 'we', 'also', 'determine', 'the', 'variance', 'of', 'widetildex_lmn', 'and', 'its', 'real', 'and', 'imaginary', 'parts', 'notice', 'that', 'widetildex_lmn', 'belongs', 'to', 'the', 'class', 'of', 'subgaussian', 'random', 'variables', 'that', 'are', 'significant', 'in', 'some', 'areas', 'of', 'theory', 'of', 'compressive', 'sensing', 'in', 'particular', 'we', 'prove', 'some', 'probability', 'estimates', 'for', 'the', 'mentioned', 'random', 'variables', 'these', 'estimates', 'are', 'used', 'to', 'establish', 'the', 'upper', 'bounds', 'of', 'the', 'subgaussian', 'norm', 'of', 'their', 'real', 'and', 'imaginary', 'parts', 'we', 'believe', 'that', 'our', 'results', 'should', 'be', 'implemented', 'in', 'certain', 'applications', 'of', 'subgaussian', 'random', 'variables', 'for', 'solving', 'some', 'problems', 'in', 'compressive', 'sensing', 'of', 'sparse', 'signals']]
|
[-0.11903971216226983, 0.17984397673613525, -0.05203647526979607, 0.02201575390201816, -0.048261990870482156, -0.14998769681967264, 0.035752129605888125, 0.3731124518173082, -0.297706538234793, -0.21123402219243526, 0.15266545060287517, -0.26252587187281323, -0.2051104401235491, 0.19334603078840745, -0.11536215273718838, 0.11655760556979138, 0.010088909691798367, 0.06248944885529844, -0.06031817429608227, -0.3044065441340319, 0.2664760043130844, -0.05378591354348741, 0.21334253893361338, -0.044453274408754496, 0.08215412870326656, 0.048346813762604836, -0.08012424514163285, 0.009993322259452682, -0.11584577818476169, 0.11135716098269335, 0.26586649353003805, 0.1376504685029193, 0.31657947224587024, -0.4038740960129958, -0.2219815384707458, 0.1751730993717155, 0.13006128048125123, 0.03056966721972761, -0.035252253583859694, -0.25938388281723573, 0.12670814881788656, -0.08734328558958146, -0.10770027604719092, -0.07580043582267881, 0.02176263985789514, 0.10763507058090042, -0.3634643190252107, 0.08557219152914643, 0.09068964219962557, 0.03824721138846057, -0.08965765391933798, -0.21277866153035402, 0.06905600149600234, 0.09150239806677703, 0.060570322786502186, 0.0022372330980336605, 0.10716964619348887, -0.07692996679716521, -0.11388265926368712, 0.31839386089926675, -0.036123759229667485, -0.23461881261097178, 0.13855149008200637, -0.15765519198300484, -0.22412040779904818, 0.0588929379099725, 0.20956086376013228, 0.12012913726114978, -0.12195431194656219, 0.13836818442117269, -0.08856791546124787, 0.13486903419141613, 0.05050372309605813, 0.05376801136437626, 0.0917934878768089, 0.04087708274684181, 0.08884380155497984, 0.14069619829769225, -0.06854330935346384, -0.0786861774422938, -0.3168056920469445, -0.13928161675271222, -0.26931498230191037, 0.05029563558526293, -0.21387073134264073, -0.1873628875383431, 0.33895832523038344, 0.1846510166402108, 0.2050010845026312, 0.10544237959575617, 0.2322255295432461, 0.13620851451664098, -0.02023888533620352, 0.06921948613654379, 0.14877548389804793, 0.21442100701997766, 0.07177527170417652, -0.11512934662737064, 0.06646328407597528, 0.04026035996364607]
|
1,803.05858
|
Pseudo Mask Augmented Object Detection
|
In this work, we present a novel and effective framework to facilitate object
detection with the instance-level segmentation information that is only
supervised by bounding box annotation. Starting from the joint object detection
and instance segmentation network, we propose to recursively estimate the
pseudo ground-truth object masks from the instance-level object segmentation
network training, and then enhance the detection network with top-down
segmentation feedbacks. The pseudo ground truth mask and network parameters are
optimized alternatively to mutually benefit each other. To obtain the promising
pseudo masks in each iteration, we embed a graphical inference that
incorporates the low-level image appearance consistency and the bounding box
annotations to refine the segmentation masks predicted by the segmentation
network. Our approach progressively improves the object detection performance
by incorporating the detailed pixel-wise information learned from the
weakly-supervised segmentation network. Extensive evaluation on the detection
task in PASCAL VOC 2007 and 2012 [12] verifies that the proposed approach is
effective.
|
cs.CV
|
in this work we present a novel and effective framework to facilitate object detection with the instancelevel segmentation information that is only supervised by bounding box annotation starting from the joint object detection and instance segmentation network we propose to recursively estimate the pseudo groundtruth object masks from the instancelevel object segmentation network training and then enhance the detection network with topdown segmentation feedbacks the pseudo ground truth mask and network parameters are optimized alternatively to mutually benefit each other to obtain the promising pseudo masks in each iteration we embed a graphical inference that incorporates the lowlevel image appearance consistency and the bounding box annotations to refine the segmentation masks predicted by the segmentation network our approach progressively improves the object detection performance by incorporating the detailed pixelwise information learned from the weaklysupervised segmentation network extensive evaluation on the detection task in pascal voc 2007 and 2012 12 verifies that the proposed approach is effective
|
[['in', 'this', 'work', 'we', 'present', 'a', 'novel', 'and', 'effective', 'framework', 'to', 'facilitate', 'object', 'detection', 'with', 'the', 'instancelevel', 'segmentation', 'information', 'that', 'is', 'only', 'supervised', 'by', 'bounding', 'box', 'annotation', 'starting', 'from', 'the', 'joint', 'object', 'detection', 'and', 'instance', 'segmentation', 'network', 'we', 'propose', 'to', 'recursively', 'estimate', 'the', 'pseudo', 'groundtruth', 'object', 'masks', 'from', 'the', 'instancelevel', 'object', 'segmentation', 'network', 'training', 'and', 'then', 'enhance', 'the', 'detection', 'network', 'with', 'topdown', 'segmentation', 'feedbacks', 'the', 'pseudo', 'ground', 'truth', 'mask', 'and', 'network', 'parameters', 'are', 'optimized', 'alternatively', 'to', 'mutually', 'benefit', 'each', 'other', 'to', 'obtain', 'the', 'promising', 'pseudo', 'masks', 'in', 'each', 'iteration', 'we', 'embed', 'a', 'graphical', 'inference', 'that', 'incorporates', 'the', 'lowlevel', 'image', 'appearance', 'consistency', 'and', 'the', 'bounding', 'box', 'annotations', 'to', 'refine', 'the', 'segmentation', 'masks', 'predicted', 'by', 'the', 'segmentation', 'network', 'our', 'approach', 'progressively', 'improves', 'the', 'object', 'detection', 'performance', 'by', 'incorporating', 'the', 'detailed', 'pixelwise', 'information', 'learned', 'from', 'the', 'weaklysupervised', 'segmentation', 'network', 'extensive', 'evaluation', 'on', 'the', 'detection', 'task', 'in', 'pascal', 'voc', '2007', 'and', '2012', '12', 'verifies', 'that', 'the', 'proposed', 'approach', 'is', 'effective']]
|
[0.005977783914810668, -0.04315963280178272, -0.032156584798407, 0.05090692156637744, -0.1419472887288206, -0.1811150092846499, 0.05031023756153165, 0.4588252208195627, -0.22469588164359522, -0.39825028045556676, 0.08435494651889595, -0.2784956129154382, -0.17430961017201368, 0.1100452503022284, -0.17628817161163077, 0.09192971746998434, 0.21512171076252484, 0.07023584208890007, -0.0651529216288159, -0.24024478288797232, 0.29557976826655274, 0.052301826265951, 0.34692611895764297, 0.018560193073100004, 0.15816732489754662, 0.00812678971590522, -0.07785418771434194, -0.02113465690621151, -0.0778103131786991, 0.20247613648415352, 0.28049604198298395, 0.2119928154944575, 0.2647277074657046, -0.3747646641225005, -0.24032165736216718, 0.04664650059436472, 0.14528172466760644, 0.11530119316721073, -0.03132111365826299, -0.47035834063083315, 0.10308492556512834, -0.1706206003526369, 0.11342234554318473, -0.13533592398445576, -0.034751563418793895, -0.07915394260094334, -0.3216573240068287, 0.05008819428659104, 0.11952374567044899, 0.0190092114931665, -0.09784689535519693, -0.07829005140023909, -0.008462571250931479, 0.22156234823453885, -0.041656668294961445, 0.10797063400222658, 0.1931427746502987, -0.24142970665184876, -0.14080585381881788, 0.29571058124136657, -0.03319551656321169, -0.234665251959366, 0.17899917506684476, -0.021647325176626254, -0.16092076720908666, 0.14158325315339682, 0.1954620562970283, 0.1353834946311485, -0.14600181662722322, -0.0441225269885483, -0.06013941749906502, 0.1902742596158089, 0.06913190482196231, -0.07392357422288161, 0.21117600539209655, 0.2673767086667701, 0.04487014249249254, 0.20796716290575346, -0.25946320532612166, -0.015467187831139503, -0.2355160456843292, -0.10061417853770156, -0.21678767174792787, -0.09493242495824607, -0.12892784280885303, -0.1540907060411066, 0.3966366373814451, 0.2815369053427369, 0.22869759030753556, 0.1266389470607138, 0.3963842163465392, -0.0025994065837062993, 0.1264515478419176, 0.059285339490041875, 0.20832674350971594, -0.018673576929499038, 0.09805269493387105, -0.151451220897098, 0.07780782231846108, 0.1603077351151464]
|
1,803.05859
|
Neural Network Quine
|
Self-replication is a key aspect of biological life that has been largely
overlooked in Artificial Intelligence systems. Here we describe how to build
and train self-replicating neural networks. The network replicates itself by
learning to output its own weights. The network is designed using a loss
function that can be optimized with either gradient-based or non-gradient-based
methods. We also describe a method we call regeneration to train the network
without explicit optimization, by injecting the network with predictions of its
own parameters. The best solution for a self-replicating network was found by
alternating between regeneration and optimization steps. Finally, we describe a
design for a self-replicating neural network that can solve an auxiliary task
such as MNIST image classification. We observe that there is a trade-off
between the network's ability to classify images and its ability to replicate,
but training is biased towards increasing its specialization at image
classification at the expense of replication. This is analogous to the
trade-off between reproduction and other tasks observed in nature. We suggest
that a self-replication mechanism for artificial intelligence is useful because
it introduces the possibility of continual improvement through natural
selection.
|
cs.AI cs.NE
|
selfreplication is a key aspect of biological life that has been largely overlooked in artificial intelligence systems here we describe how to build and train selfreplicating neural networks the network replicates itself by learning to output its own weights the network is designed using a loss function that can be optimized with either gradientbased or nongradientbased methods we also describe a method we call regeneration to train the network without explicit optimization by injecting the network with predictions of its own parameters the best solution for a selfreplicating network was found by alternating between regeneration and optimization steps finally we describe a design for a selfreplicating neural network that can solve an auxiliary task such as mnist image classification we observe that there is a tradeoff between the networks ability to classify images and its ability to replicate but training is biased towards increasing its specialization at image classification at the expense of replication this is analogous to the tradeoff between reproduction and other tasks observed in nature we suggest that a selfreplication mechanism for artificial intelligence is useful because it introduces the possibility of continual improvement through natural selection
|
[['selfreplication', 'is', 'a', 'key', 'aspect', 'of', 'biological', 'life', 'that', 'has', 'been', 'largely', 'overlooked', 'in', 'artificial', 'intelligence', 'systems', 'here', 'we', 'describe', 'how', 'to', 'build', 'and', 'train', 'selfreplicating', 'neural', 'networks', 'the', 'network', 'replicates', 'itself', 'by', 'learning', 'to', 'output', 'its', 'own', 'weights', 'the', 'network', 'is', 'designed', 'using', 'a', 'loss', 'function', 'that', 'can', 'be', 'optimized', 'with', 'either', 'gradientbased', 'or', 'nongradientbased', 'methods', 'we', 'also', 'describe', 'a', 'method', 'we', 'call', 'regeneration', 'to', 'train', 'the', 'network', 'without', 'explicit', 'optimization', 'by', 'injecting', 'the', 'network', 'with', 'predictions', 'of', 'its', 'own', 'parameters', 'the', 'best', 'solution', 'for', 'a', 'selfreplicating', 'network', 'was', 'found', 'by', 'alternating', 'between', 'regeneration', 'and', 'optimization', 'steps', 'finally', 'we', 'describe', 'a', 'design', 'for', 'a', 'selfreplicating', 'neural', 'network', 'that', 'can', 'solve', 'an', 'auxiliary', 'task', 'such', 'as', 'mnist', 'image', 'classification', 'we', 'observe', 'that', 'there', 'is', 'a', 'tradeoff', 'between', 'the', 'networks', 'ability', 'to', 'classify', 'images', 'and', 'its', 'ability', 'to', 'replicate', 'but', 'training', 'is', 'biased', 'towards', 'increasing', 'its', 'specialization', 'at', 'image', 'classification', 'at', 'the', 'expense', 'of', 'replication', 'this', 'is', 'analogous', 'to', 'the', 'tradeoff', 'between', 'reproduction', 'and', 'other', 'tasks', 'observed', 'in', 'nature', 'we', 'suggest', 'that', 'a', 'selfreplication', 'mechanism', 'for', 'artificial', 'intelligence', 'is', 'useful', 'because', 'it', 'introduces', 'the', 'possibility', 'of', 'continual', 'improvement', 'through', 'natural', 'selection']]
|
[-0.07723840090789293, 0.04706004035826099, -0.08806806903111895, 0.0757750412063232, -0.1199957507356119, -0.18598805211582467, 0.06550330876642348, 0.45443474953307916, -0.30285899798924987, -0.32779978293141254, 0.07969212581182977, -0.2257831541894886, -0.2580894589846905, 0.17584879483022775, -0.1193915369022522, 0.05396110257991639, 0.10305064775503094, 0.04376270230369348, -0.008274052763284233, -0.2697945177175203, 0.2854626705110269, 0.07749008578983577, 0.3262193005115382, 0.015581784506426439, 0.14381535188892342, -0.04022168526425958, 0.02130773483628505, -0.022302069611798384, -0.054365038648469824, 0.15096245413940204, 0.2787117937592005, 0.22030075549172531, 0.3456021017492994, -0.42911604570322914, -0.23026746876145665, 0.14413820122074533, 0.16854531346685497, 0.13476083695790486, -0.047684449160863694, -0.2521101848516417, 0.10106554040470847, -0.14333717146854677, -0.05370528988883291, -0.13902009281785133, 0.019671826697518362, 0.010692774218899246, -0.279081642304204, -0.006018696707753023, 0.06009284036546504, 0.04848190205367772, -0.029857507590694648, -0.07993888569824202, -0.011682519284812244, 0.16435880650594634, 0.021801218576116586, 0.05511544649734309, 0.15747695636298312, -0.17271926306175853, -0.1570247150026262, 0.3523662179120277, -0.03962511771364677, -0.21773811454124944, 0.20821437885690677, 0.0015316437954377188, -0.12924686015926692, 0.09198620822280645, 0.2166916806967684, 0.05220777110539769, -0.16748465264191556, -0.007926768538738159, -0.024593922296097796, 0.18805137697827856, 0.04774450125957006, -0.03183945281504604, 0.19304540032569908, 0.2773498531210383, 0.052130667902345426, 0.1781713625609164, -0.08520781784670697, -0.08599604865915975, -0.20360025191728615, -0.13560087290151338, -0.20536862534323805, 0.035299388809423696, -0.05406493805471416, -0.12407453277785527, 0.3905062945853723, 0.1973627810023333, 0.21691180056720777, 0.09420194682959271, 0.32912486925917234, 0.04716930053576729, 0.12194372508092784, 0.055083336004386904, 0.2022491570856226, 0.04965806660781565, 0.1263701726829535, -0.21658742423659486, 0.12817312709031334, 0.03344208171689197]
|
1,803.0586
|
Power Grid Decomposition Based on Vertex Cut Sets and Its Applications
to Topology Control and Power Trading
|
It is well known that the reserves/redundancies built into the transmission
grid in order to address a variety of contingencies over a long planning
horizon may, in the short run, cause economic dispatch inefficiency.
Accordingly, power grid optimization by means of short term line switching has
been proposed and is typically formulated as a mixed integer programming
problem by treating the state of the transmission lines as a binary decision
variable, i.e. in-service or out-of-service, in the optimal power flow problem.
To handle the combinatorial explosion, a number of heuristic approaches to grid
topology reconfiguration have been proposed in the literature. This paper
extends our recent results on the iterative heuristics and proposes a fast grid
decomposition algorithm based on vertex cut sets with the purpose of further
reducing the computational cost. The paper concludes with a discussion of the
possible relationship between vertex cut sets in transmission networks and
power trading.
|
cs.SY
|
it is well known that the reservesredundancies built into the transmission grid in order to address a variety of contingencies over a long planning horizon may in the short run cause economic dispatch inefficiency accordingly power grid optimization by means of short term line switching has been proposed and is typically formulated as a mixed integer programming problem by treating the state of the transmission lines as a binary decision variable ie inservice or outofservice in the optimal power flow problem to handle the combinatorial explosion a number of heuristic approaches to grid topology reconfiguration have been proposed in the literature this paper extends our recent results on the iterative heuristics and proposes a fast grid decomposition algorithm based on vertex cut sets with the purpose of further reducing the computational cost the paper concludes with a discussion of the possible relationship between vertex cut sets in transmission networks and power trading
|
[['it', 'is', 'well', 'known', 'that', 'the', 'reservesredundancies', 'built', 'into', 'the', 'transmission', 'grid', 'in', 'order', 'to', 'address', 'a', 'variety', 'of', 'contingencies', 'over', 'a', 'long', 'planning', 'horizon', 'may', 'in', 'the', 'short', 'run', 'cause', 'economic', 'dispatch', 'inefficiency', 'accordingly', 'power', 'grid', 'optimization', 'by', 'means', 'of', 'short', 'term', 'line', 'switching', 'has', 'been', 'proposed', 'and', 'is', 'typically', 'formulated', 'as', 'a', 'mixed', 'integer', 'programming', 'problem', 'by', 'treating', 'the', 'state', 'of', 'the', 'transmission', 'lines', 'as', 'a', 'binary', 'decision', 'variable', 'ie', 'inservice', 'or', 'outofservice', 'in', 'the', 'optimal', 'power', 'flow', 'problem', 'to', 'handle', 'the', 'combinatorial', 'explosion', 'a', 'number', 'of', 'heuristic', 'approaches', 'to', 'grid', 'topology', 'reconfiguration', 'have', 'been', 'proposed', 'in', 'the', 'literature', 'this', 'paper', 'extends', 'our', 'recent', 'results', 'on', 'the', 'iterative', 'heuristics', 'and', 'proposes', 'a', 'fast', 'grid', 'decomposition', 'algorithm', 'based', 'on', 'vertex', 'cut', 'sets', 'with', 'the', 'purpose', 'of', 'further', 'reducing', 'the', 'computational', 'cost', 'the', 'paper', 'concludes', 'with', 'a', 'discussion', 'of', 'the', 'possible', 'relationship', 'between', 'vertex', 'cut', 'sets', 'in', 'transmission', 'networks', 'and', 'power', 'trading']]
|
[-0.14036288717315376, 0.010442625779348114, -0.06377133498589198, 0.03426339925344413, -0.11378797865162293, -0.14263857183046638, 0.09607807016776254, 0.3862750332554181, -0.30496010082463426, -0.33530886478722094, 0.15924967140192167, -0.24232967249117793, -0.14538204421134046, 0.16793526844742399, -0.12917098134368038, 0.09550411788125833, 0.06967299683019519, -0.0010927793011069299, -0.01867231475029257, -0.2684923449174191, 0.29204418463399634, 0.08850578523318593, 0.27854104691495496, 0.0572195135227715, 0.10786895554357519, 0.029883021262163918, -0.04794493077322841, 0.0891723365499638, -0.07386212246051096, 0.11793235913384706, 0.29200098014747106, 0.1855329453246668, 0.3322008394325773, -0.447687646804067, -0.23170235951741536, 0.11657048805694406, 0.14140200279653073, 0.07217542787392935, -0.014828640487976372, -0.18109875980919848, 0.08272074835374951, -0.2027209739635388, -0.05418067624171575, -0.027280713734216987, 0.013925699427103004, 0.03630616622045636, -0.2735267119606336, -0.016221133831422777, 0.04000949620191629, 0.04290355446437995, -0.030531376249467335, -0.1252058585298558, 0.021768455104902388, 0.0946345531612557, 0.05005650052141088, 0.020179079190517465, 0.06969884555243576, -0.09281042968078206, -0.18761477592711648, 0.3725067328289151, 0.021530218635840963, -0.1854215129216512, 0.14402372639471045, -0.048158322305728994, -0.11718941979110241, 0.14034240807096163, 0.21013850291570027, 0.12442539429912965, -0.1549978891791155, 0.0710611876352535, -0.023135020861712596, 0.1425583770746986, 0.07238053686295946, -0.012130517819993353, 0.18578264308394865, 0.23068983008464178, 0.14606189771400144, 0.16375360967009328, -0.06711028690139452, -0.1291089833966301, -0.2457027851479749, -0.08329314361636837, -0.19401847065115968, 0.03675239637649308, -0.09137703503064888, -0.16102117151021958, 0.41829719600578147, 0.12100949415704236, 0.17797738859429957, 0.0869729128666222, 0.3468205097876489, 0.13375656717379267, 0.05352718816449245, 0.11047155279666185, 0.15994137923543653, 0.0740448480999718, 0.1436490381625481, -0.24343355278329304, 0.08695043583943819, 0.08661575509856144]
|
1,803.05861
|
Practical volume computation of structured convex bodies, and an
application to modeling portfolio dependencies and financial crises
|
We examine volume computation of general-dimensional polytopes and more
general convex bodies, defined as the intersection of a simplex by a family of
parallel hyperplanes, and another family of parallel hyperplanes or a family of
concentric ellipsoids. Such convex bodies appear in modeling and predicting
financial crises. The impact of crises on the economy (labor, income, etc.)
makes its detection of prime interest. Certain features of dependencies in the
markets clearly identify times of turmoil. We describe the relationship between
asset characteristics by means of a copula; each characteristic is either a
linear or quadratic form of the portfolio components, hence the copula can be
constructed by computing volumes of convex bodies. We design and implement
practical algorithms in the exact and approximate setting, we experimentally
juxtapose them and study the tradeoff of exactness and accuracy for speed. We
analyze the following methods in order of increasing generality: rejection
sampling relying on uniformly sampling the simplex, which is the fastest
approach, but inaccurate for small volumes; exact formulae based on the
computation of integrals of probability distribution functions; an optimized
Lawrence sign decomposition method, since the polytopes at hand are shown to be
simple; Markov chain Monte Carlo algorithms using random walks based on the
hit-and-run paradigm generalized to nonlinear convex bodies and relying on new
methods for computing a ball enclosed; the latter is experimentally extended to
non-convex bodies with very encouraging results. Our C++ software, based on
CGAL and Eigen and available on github, is shown to be very effective in up to
100 dimensions. Our results offer novel, effective means of computing portfolio
dependencies and an indicator of financial crises, which is shown to correctly
identify past crises.
|
cs.CG econ.EM q-fin.GN
|
we examine volume computation of generaldimensional polytopes and more general convex bodies defined as the intersection of a simplex by a family of parallel hyperplanes and another family of parallel hyperplanes or a family of concentric ellipsoids such convex bodies appear in modeling and predicting financial crises the impact of crises on the economy labor income etc makes its detection of prime interest certain features of dependencies in the markets clearly identify times of turmoil we describe the relationship between asset characteristics by means of a copula each characteristic is either a linear or quadratic form of the portfolio components hence the copula can be constructed by computing volumes of convex bodies we design and implement practical algorithms in the exact and approximate setting we experimentally juxtapose them and study the tradeoff of exactness and accuracy for speed we analyze the following methods in order of increasing generality rejection sampling relying on uniformly sampling the simplex which is the fastest approach but inaccurate for small volumes exact formulae based on the computation of integrals of probability distribution functions an optimized lawrence sign decomposition method since the polytopes at hand are shown to be simple markov chain monte carlo algorithms using random walks based on the hitandrun paradigm generalized to nonlinear convex bodies and relying on new methods for computing a ball enclosed the latter is experimentally extended to nonconvex bodies with very encouraging results our c software based on cgal and eigen and available on github is shown to be very effective in up to 100 dimensions our results offer novel effective means of computing portfolio dependencies and an indicator of financial crises which is shown to correctly identify past crises
|
[['we', 'examine', 'volume', 'computation', 'of', 'generaldimensional', 'polytopes', 'and', 'more', 'general', 'convex', 'bodies', 'defined', 'as', 'the', 'intersection', 'of', 'a', 'simplex', 'by', 'a', 'family', 'of', 'parallel', 'hyperplanes', 'and', 'another', 'family', 'of', 'parallel', 'hyperplanes', 'or', 'a', 'family', 'of', 'concentric', 'ellipsoids', 'such', 'convex', 'bodies', 'appear', 'in', 'modeling', 'and', 'predicting', 'financial', 'crises', 'the', 'impact', 'of', 'crises', 'on', 'the', 'economy', 'labor', 'income', 'etc', 'makes', 'its', 'detection', 'of', 'prime', 'interest', 'certain', 'features', 'of', 'dependencies', 'in', 'the', 'markets', 'clearly', 'identify', 'times', 'of', 'turmoil', 'we', 'describe', 'the', 'relationship', 'between', 'asset', 'characteristics', 'by', 'means', 'of', 'a', 'copula', 'each', 'characteristic', 'is', 'either', 'a', 'linear', 'or', 'quadratic', 'form', 'of', 'the', 'portfolio', 'components', 'hence', 'the', 'copula', 'can', 'be', 'constructed', 'by', 'computing', 'volumes', 'of', 'convex', 'bodies', 'we', 'design', 'and', 'implement', 'practical', 'algorithms', 'in', 'the', 'exact', 'and', 'approximate', 'setting', 'we', 'experimentally', 'juxtapose', 'them', 'and', 'study', 'the', 'tradeoff', 'of', 'exactness', 'and', 'accuracy', 'for', 'speed', 'we', 'analyze', 'the', 'following', 'methods', 'in', 'order', 'of', 'increasing', 'generality', 'rejection', 'sampling', 'relying', 'on', 'uniformly', 'sampling', 'the', 'simplex', 'which', 'is', 'the', 'fastest', 'approach', 'but', 'inaccurate', 'for', 'small', 'volumes', 'exact', 'formulae', 'based', 'on', 'the', 'computation', 'of', 'integrals', 'of', 'probability', 'distribution', 'functions', 'an', 'optimized', 'lawrence', 'sign', 'decomposition', 'method', 'since', 'the', 'polytopes', 'at', 'hand', 'are', 'shown', 'to', 'be', 'simple', 'markov', 'chain', 'monte', 'carlo', 'algorithms', 'using', 'random', 'walks', 'based', 'on', 'the', 'hitandrun', 'paradigm', 'generalized', 'to', 'nonlinear', 'convex', 'bodies', 'and', 'relying', 'on', 'new', 'methods', 'for', 'computing', 'a', 'ball', 'enclosed', 'the', 'latter', 'is', 'experimentally', 'extended', 'to', 'nonconvex', 'bodies', 'with', 'very', 'encouraging', 'results', 'our', 'c', 'software', 'based', 'on', 'cgal', 'and', 'eigen', 'and', 'available', 'on', 'github', 'is', 'shown', 'to', 'be', 'very', 'effective', 'in', 'up', 'to', '100', 'dimensions', 'our', 'results', 'offer', 'novel', 'effective', 'means', 'of', 'computing', 'portfolio', 'dependencies', 'and', 'an', 'indicator', 'of', 'financial', 'crises', 'which', 'is', 'shown', 'to', 'correctly', 'identify', 'past', 'crises']]
|
[-0.09585966394702804, 0.05194261016006619, -0.1015191268541717, 0.10308670507802162, -0.0839100345004616, -0.1288007864113232, 0.060578207226769466, 0.3950767861413104, -0.26525102488729835, -0.2628200046152675, 0.14980996956375228, -0.2668657815665938, -0.1580443729214104, 0.22207792894415823, -0.1077543026299931, 0.08628889176325175, 0.05993554269412665, -0.015888943890708367, -0.05856535057869873, -0.2904464332445059, 0.28601872673856893, 0.03348005641808933, 0.27262349467408575, 0.05163103082782722, 0.13321979219825672, 0.004070241265331528, -0.030748866574971803, 0.038833738494265295, -0.13183990821541686, 0.19866703049878456, 0.2744454630841834, 0.15980923124838486, 0.30125925138459675, -0.41817424058515046, -0.14657616483579788, 0.12190810197332341, 0.10864082885590116, 0.05480318101638529, -0.007417206345469042, -0.2554849259422294, 0.0537132636082658, -0.17795862691377157, -0.1305696210464313, -0.10826750741606313, 0.030882601122305328, 0.042114886204944926, -0.28305065787364064, 0.035390611577271816, 0.03610737869437019, 0.08736044920265808, -0.021989089660928586, -0.1344214413876346, 0.009204303297363887, 0.07036998815102768, 0.06971000344118303, -0.0024521269203562823, 0.14097658111381212, -0.08383372363168747, -0.159450503019616, 0.38223180616062435, -0.016887217225407116, -0.23146757645382812, 0.18456344428788204, -0.12593976472271606, -0.11264040681749715, 0.11571201596608652, 0.21833679927596158, 0.13217163988312158, -0.1507791704103251, 0.07733385802649927, -0.02582060462030183, 0.10913606220939463, 0.08725324570301123, -0.02134324711660156, 0.18123507070039133, 0.1514201290672645, 0.10623287731408969, 0.15847347603433135, -0.049591164959565504, -0.15945213466184213, -0.24755777761789172, -0.1512154847250453, -0.2273869955903917, 0.004371794466611131, -0.14561167012377285, -0.20161390908599838, 0.3767928970902826, 0.11211131607446662, 0.1706639337856489, 0.09380024579835923, 0.27664343979974676, 0.08234689120145049, 0.05335999850690964, 0.11194212249164204, 0.16835733324405738, 0.07202712690673901, 0.052377939901686786, -0.17611277511231102, 0.11531389269823973, 0.08006816170974551]
|
1,803.05862
|
Mahler's Work and Algebraic Dynamical Systems
|
After Furstenberg had provided a first glimpse of remarkable rigidity
phenomena associated with the joint action of several commuting automorphisms
(or endomorphisms) of a compact abelian group, further key examples motivated
the development of an extensive theory of such actions.
Two of Mahler's achievements, the recognition of the significance of Mahler
measure of multivariate polynomials in relating the lengths and heights of
products of polynomials in terms of the corresponding quantities for the
constituent factors, and his work on additive relations in fields, have
unexpectedly played important roles in the study of entropy and higher order
mixing for these actions.
This article briefly surveys these connections between Mahler's work and
dynamics. It also sketches some of the dynamical outgrowths of his work that
are very active today, including the investigation of the Fuglede-Kadison
determinant of a convolution operator in a group von Neumann algebra as a
noncommutative generalization of Mahler measure, as well as diophantine
questions related to the growth rates of periodic points and their relation to
entropy.
|
math.DS math.NT
|
after furstenberg had provided a first glimpse of remarkable rigidity phenomena associated with the joint action of several commuting automorphisms or endomorphisms of a compact abelian group further key examples motivated the development of an extensive theory of such actions two of mahlers achievements the recognition of the significance of mahler measure of multivariate polynomials in relating the lengths and heights of products of polynomials in terms of the corresponding quantities for the constituent factors and his work on additive relations in fields have unexpectedly played important roles in the study of entropy and higher order mixing for these actions this article briefly surveys these connections between mahlers work and dynamics it also sketches some of the dynamical outgrowths of his work that are very active today including the investigation of the fugledekadison determinant of a convolution operator in a group von neumann algebra as a noncommutative generalization of mahler measure as well as diophantine questions related to the growth rates of periodic points and their relation to entropy
|
[['after', 'furstenberg', 'had', 'provided', 'a', 'first', 'glimpse', 'of', 'remarkable', 'rigidity', 'phenomena', 'associated', 'with', 'the', 'joint', 'action', 'of', 'several', 'commuting', 'automorphisms', 'or', 'endomorphisms', 'of', 'a', 'compact', 'abelian', 'group', 'further', 'key', 'examples', 'motivated', 'the', 'development', 'of', 'an', 'extensive', 'theory', 'of', 'such', 'actions', 'two', 'of', 'mahlers', 'achievements', 'the', 'recognition', 'of', 'the', 'significance', 'of', 'mahler', 'measure', 'of', 'multivariate', 'polynomials', 'in', 'relating', 'the', 'lengths', 'and', 'heights', 'of', 'products', 'of', 'polynomials', 'in', 'terms', 'of', 'the', 'corresponding', 'quantities', 'for', 'the', 'constituent', 'factors', 'and', 'his', 'work', 'on', 'additive', 'relations', 'in', 'fields', 'have', 'unexpectedly', 'played', 'important', 'roles', 'in', 'the', 'study', 'of', 'entropy', 'and', 'higher', 'order', 'mixing', 'for', 'these', 'actions', 'this', 'article', 'briefly', 'surveys', 'these', 'connections', 'between', 'mahlers', 'work', 'and', 'dynamics', 'it', 'also', 'sketches', 'some', 'of', 'the', 'dynamical', 'outgrowths', 'of', 'his', 'work', 'that', 'are', 'very', 'active', 'today', 'including', 'the', 'investigation', 'of', 'the', 'fugledekadison', 'determinant', 'of', 'a', 'convolution', 'operator', 'in', 'a', 'group', 'von', 'neumann', 'algebra', 'as', 'a', 'noncommutative', 'generalization', 'of', 'mahler', 'measure', 'as', 'well', 'as', 'diophantine', 'questions', 'related', 'to', 'the', 'growth', 'rates', 'of', 'periodic', 'points', 'and', 'their', 'relation', 'to', 'entropy']]
|
[-0.14002256575123181, 0.10721366374745493, -0.09991893676087568, 0.07451302803206925, -0.054708167805526536, -0.06812829077560675, 0.034395616860115164, 0.3037525641100933, -0.28825099465090054, -0.2601995705323812, 0.12995809281297227, -0.2881312272373653, -0.19794204169347024, 0.22167566444961762, -0.11951180743384203, 0.06522137682179552, 0.02790975449441453, 0.08991537088412549, -0.09726587783258694, -0.28414758998341305, 0.39290539835188426, 0.06187499143987806, 0.22035158956533618, 0.06633442406160805, 0.10218102461796187, -0.020853267988112902, -0.10013924681680751, 0.004387289134113217, -0.13837636734887485, 0.16637710368911013, 0.26183864593329514, 0.1171648941008297, 0.2852627966062513, -0.37859293620085577, -0.17070212313828206, 0.1223547384776616, 0.11448319239222263, 0.014611876536623613, -0.041505308673695035, -0.2876321903812925, 0.019173237434505712, -0.19133003566899068, -0.14744075517460825, -0.07621255386951407, 0.08048748305431132, 0.05582248811374457, -0.2014416436280383, 0.061957832880128044, 0.11123450444622059, 0.14768162978712826, -0.06663516557915963, -0.1150713979773576, 0.006913098600312803, 0.16581106530750425, 0.08954201500653428, 0.01484746664980173, 0.09734480279723745, -0.14126189371168657, -0.16277539852135897, 0.36966571358952827, -0.02905410060868461, -0.18124448092511067, 0.17770125632885203, -0.16668448997275717, -0.19910858509119755, 0.06302409499784457, 0.16177632428220742, 0.11853626883208487, -0.09880156072198286, 0.09225836259653218, -0.0913630549426703, 0.07707384200876899, 0.11985134169426279, 0.07329918696826114, 0.17267161296107447, 0.09204161898976952, 0.03226961567033545, 0.1302258640709581, 0.02602216545265091, -0.10167401801717617, -0.317640144835342, -0.2054697737847207, -0.13913626395325732, 0.09254906506046168, -0.10978002488272494, -0.16908292211977952, 0.41905256330459956, 0.12555783258519582, 0.1852274961664876, 0.06748179374979092, 0.21422678496710648, 0.07922368806982467, 0.05671945886793905, 0.009205698133473831, 0.1582864775508711, 0.24635485619080622, 0.03858681726848057, -0.19096093039102743, 0.02268717093282991, 0.15135101040414695]
|
1,803.05863
|
Learned Neural Iterative Decoding for Lossy Image Compression Systems
|
For lossy image compression systems, we develop an algorithm, iterative
refinement, to improve the decoder's reconstruction compared to standard
decoding techniques. Specifically, we propose a recurrent neural network
approach for nonlinear, iterative decoding. Our decoder, which works with any
encoder, employs self-connected memory units that make use of causal and
non-causal spatial context information to progressively reduce reconstruction
error over a fixed number of steps. We experiment with variants of our
estimator and find that iterative refinement consistently creates lower
distortion images of higher perceptual quality compared to other approaches.
Specifically, on the Kodak Lossless True Color Image Suite, we observe as much
as a 0.871 decibel (dB) gain over JPEG, a 1.095 dB gain over JPEG 2000, and a
0.971 dB gain over a competitive neural model.
|
cs.CV
|
for lossy image compression systems we develop an algorithm iterative refinement to improve the decoders reconstruction compared to standard decoding techniques specifically we propose a recurrent neural network approach for nonlinear iterative decoding our decoder which works with any encoder employs selfconnected memory units that make use of causal and noncausal spatial context information to progressively reduce reconstruction error over a fixed number of steps we experiment with variants of our estimator and find that iterative refinement consistently creates lower distortion images of higher perceptual quality compared to other approaches specifically on the kodak lossless true color image suite we observe as much as a 0871 decibel db gain over jpeg a 1095 db gain over jpeg 2000 and a 0971 db gain over a competitive neural model
|
[['for', 'lossy', 'image', 'compression', 'systems', 'we', 'develop', 'an', 'algorithm', 'iterative', 'refinement', 'to', 'improve', 'the', 'decoders', 'reconstruction', 'compared', 'to', 'standard', 'decoding', 'techniques', 'specifically', 'we', 'propose', 'a', 'recurrent', 'neural', 'network', 'approach', 'for', 'nonlinear', 'iterative', 'decoding', 'our', 'decoder', 'which', 'works', 'with', 'any', 'encoder', 'employs', 'selfconnected', 'memory', 'units', 'that', 'make', 'use', 'of', 'causal', 'and', 'noncausal', 'spatial', 'context', 'information', 'to', 'progressively', 'reduce', 'reconstruction', 'error', 'over', 'a', 'fixed', 'number', 'of', 'steps', 'we', 'experiment', 'with', 'variants', 'of', 'our', 'estimator', 'and', 'find', 'that', 'iterative', 'refinement', 'consistently', 'creates', 'lower', 'distortion', 'images', 'of', 'higher', 'perceptual', 'quality', 'compared', 'to', 'other', 'approaches', 'specifically', 'on', 'the', 'kodak', 'lossless', 'true', 'color', 'image', 'suite', 'we', 'observe', 'as', 'much', 'as', 'a', '0871', 'decibel', 'db', 'gain', 'over', 'jpeg', 'a', '1095', 'db', 'gain', 'over', 'jpeg', '2000', 'and', 'a', '0971', 'db', 'gain', 'over', 'a', 'competitive', 'neural', 'model']]
|
[-0.056036121561191976, -0.03486963868624571, -0.07798428591195261, 0.07919550284532306, -0.06488281121892214, -0.24336204864448518, 0.09061256690256414, 0.4740568200359121, -0.2756373313750373, -0.29992545242930646, 0.08233374328847276, -0.23532201710622758, -0.19795486359817005, 0.1779219301952253, -0.16417273323531845, 0.0890096243770131, 0.11184475829145413, 0.031529434214462526, -0.14197318824153626, -0.3404625626280904, 0.21248831178672845, 0.14149109805293847, 0.3448232539012679, -0.07204507603455568, 0.17893747820380668, 0.01322307044029003, -0.027968704984232318, -0.03068413456003327, -0.08186613567943368, 0.10746464524709154, 0.2706963315686153, 0.1885747155165518, 0.3032125738754985, -0.36971257210097974, -0.2857905624287014, 0.047176335861877305, 0.16338720101339277, 0.14004800265229278, -0.027371986207981536, -0.26355232904461445, 0.16560088775440818, -0.19854358016891638, 0.09621332200913457, -0.07885404606679458, -0.09822793255989382, -0.03438760033168364, -0.34961406713409815, 0.04789231066388311, 0.10243916434410494, 0.04945119507101481, -0.020746607400724315, -0.14125435200185166, 0.05338514698269137, 0.08515694826564868, -0.035506349370734824, 0.10940362792371161, 0.11390697034948971, -0.1307278861922896, -0.15397489503266115, 0.3314852665644139, -0.07705677489684604, -0.19252499959839042, 0.1642109938475187, -0.006504528202640358, -0.053226023998831806, 0.1803488710866077, 0.2549538612274773, 0.05488797999714734, -0.08991092505857523, -0.019353449673417344, -0.0077337275452009635, 0.2691012086288538, 0.14638641533474583, 0.090731812742888, 0.09545366542079137, 0.22174027933215257, 0.08478424545683083, 0.1861258128906229, -0.15409621131584572, -0.045629615495272446, -0.19974133416690165, -0.11471250183058146, -0.13194365905746963, -0.007982147728398559, -0.16950085793689595, -0.1516102719506307, 0.36136122986499686, 0.21962733119289624, 0.17337130837080394, 0.17011127904606838, 0.4178385666455142, 0.04669713773546391, 0.12184294701000908, 0.13607411248085555, 0.15671266588196886, 0.09538633034389932, 0.09343698900283925, -0.1445379861170295, 0.027501537435455248, 0.07937432765902486]
|
1,803.05864
|
The limited role of recombination energy in common envelope removal
|
We calculate the outward energy transport time by convection and photon
diffusion in an inflated common envelope and find this time to be shorter than
the envelope expansion time. We conclude therefore that most of the hydrogen
recombination energy ends in radiation rather than in kinetic energy of the
outflowing envelope. We use the stellar evolution code MESA and inject energy
inside the envelope of an asymptotic giant branch star to mimic energy
deposition by a spiraling-in stellar companion. During 1.7 years the envelope
expands by a factor of more than 2. Along the entire evolution the convection
can carry the energy very efficiently outwards, to the radius where radiative
transfer becomes more efficient. The total energy transport time stays within
several months, shorter than the dynamical time of the envelope. Had we
included rapid mass loss, as is expected in the common envelope evolution, the
energy transport time would have been even shorter. It seems that calculations
that assume that most of the recombination energy ends in the outflowing gas
might be inaccurate.
|
astro-ph.SR
|
we calculate the outward energy transport time by convection and photon diffusion in an inflated common envelope and find this time to be shorter than the envelope expansion time we conclude therefore that most of the hydrogen recombination energy ends in radiation rather than in kinetic energy of the outflowing envelope we use the stellar evolution code mesa and inject energy inside the envelope of an asymptotic giant branch star to mimic energy deposition by a spiralingin stellar companion during 17 years the envelope expands by a factor of more than 2 along the entire evolution the convection can carry the energy very efficiently outwards to the radius where radiative transfer becomes more efficient the total energy transport time stays within several months shorter than the dynamical time of the envelope had we included rapid mass loss as is expected in the common envelope evolution the energy transport time would have been even shorter it seems that calculations that assume that most of the recombination energy ends in the outflowing gas might be inaccurate
|
[['we', 'calculate', 'the', 'outward', 'energy', 'transport', 'time', 'by', 'convection', 'and', 'photon', 'diffusion', 'in', 'an', 'inflated', 'common', 'envelope', 'and', 'find', 'this', 'time', 'to', 'be', 'shorter', 'than', 'the', 'envelope', 'expansion', 'time', 'we', 'conclude', 'therefore', 'that', 'most', 'of', 'the', 'hydrogen', 'recombination', 'energy', 'ends', 'in', 'radiation', 'rather', 'than', 'in', 'kinetic', 'energy', 'of', 'the', 'outflowing', 'envelope', 'we', 'use', 'the', 'stellar', 'evolution', 'code', 'mesa', 'and', 'inject', 'energy', 'inside', 'the', 'envelope', 'of', 'an', 'asymptotic', 'giant', 'branch', 'star', 'to', 'mimic', 'energy', 'deposition', 'by', 'a', 'spiralingin', 'stellar', 'companion', 'during', '17', 'years', 'the', 'envelope', 'expands', 'by', 'a', 'factor', 'of', 'more', 'than', '2', 'along', 'the', 'entire', 'evolution', 'the', 'convection', 'can', 'carry', 'the', 'energy', 'very', 'efficiently', 'outwards', 'to', 'the', 'radius', 'where', 'radiative', 'transfer', 'becomes', 'more', 'efficient', 'the', 'total', 'energy', 'transport', 'time', 'stays', 'within', 'several', 'months', 'shorter', 'than', 'the', 'dynamical', 'time', 'of', 'the', 'envelope', 'had', 'we', 'included', 'rapid', 'mass', 'loss', 'as', 'is', 'expected', 'in', 'the', 'common', 'envelope', 'evolution', 'the', 'energy', 'transport', 'time', 'would', 'have', 'been', 'even', 'shorter', 'it', 'seems', 'that', 'calculations', 'that', 'assume', 'that', 'most', 'of', 'the', 'recombination', 'energy', 'ends', 'in', 'the', 'outflowing', 'gas', 'might', 'be', 'inaccurate']]
|
[-0.10809030179931226, 0.18913413578495195, -0.08539079238751625, 0.11320279305666985, -0.06471498972928987, -0.045728560034640604, 0.0267015283247563, 0.4071346462929043, -0.2396185784998762, -0.31931674557780826, 0.08628383117671735, -0.2292186796782945, -0.008614487574039691, 0.1817985915956248, 0.0036928989354456806, -0.03975421695397289, 0.11051905742544017, -0.009142371392327136, -0.08104032116484475, -0.20947121932497784, 0.29731817735123567, 0.16064891147416557, 0.14775409386760888, 0.03474414277147373, 0.021241928480201584, -0.08604613349681998, -0.025101555602346688, -0.07003321129314859, -0.15433967931831025, 0.05286673394342264, 0.1944683619464437, 0.09942754720814055, 0.29520566023929024, -0.48469834568128844, -0.29857194447761465, 0.05828629585298115, 0.2071521670889409, 0.11216902184492812, -0.0462596052944802, -0.13140863319323665, 0.03251328696122115, -0.22766426087881642, -0.14830149597877734, 0.04177652994885334, 0.0723102012456491, 0.006084349726316059, -0.20498975878313783, 0.12771965073550057, 0.03711264257117886, -0.004958418127386523, -0.08064055253334086, -0.1088064899025806, -0.12253947077913145, 0.06675835079567015, 0.06537367620815833, 0.044502911987532486, 0.18173741956038036, -0.11385886568372705, 0.019917238757934892, 0.37406640868077334, -0.1158413943849991, -0.07804029395311386, 0.20451457958786223, -0.18495351762039822, -0.042269087985329246, 0.2440796471468505, 0.15171260095299113, 0.14800715197584238, -0.15196356811860426, -0.012690055870180735, 0.024303800994450033, 0.19799677153043022, 0.11293009823942878, 0.032750535084619774, 0.26337186491983977, 0.16429024856087976, 0.05591113355422885, 0.09853270173945261, -0.14813791729788156, -0.12200742534458123, -0.2319421153274718, -0.1646148025997561, -0.15930869393505628, 0.1116983512116746, -0.0790953562651318, -0.12294372630401931, 0.37095396277419795, 0.13606135914070083, 0.20585423552206364, 0.022227516515587253, 0.32213882189618703, 0.1533613776481689, 0.11168898762626595, 0.20264891237448687, 0.28524058650317335, 0.12130964404084431, 0.1354017667365314, -0.27917853265668896, 0.09009808321997266, 0.013626727612084314]
|
1,803.05865
|
Kinetics of electron cooling in metal films at low temperatures and
revision of the two-temperature model
|
The two-temperature model (2TM) introduced by Kaganov, Lifshitz, and
Tanatarov is widely used to describe the energy relaxation in the
electron-phonon system of a metallic film. At the same time, the accuracy of
the description of the electron-phonon system in terms of 2TM, i.e. on the
basis of the electron and phonon temperatures, has not been considered in
detail until now. In this paper we present a microscopic theory of cooling of
instantly heated electrons in metallic films. In framework of this theory the
main features of electron cooling in thick and thin films were found, and an
analysis of the accuracy of the 2TM in the low-temperature region was carried
out. We consider a more accurate three-temperature model, which (in contrast to
2TM) explicitly takes into account phonons with angles of incidence exceeding
the angle of total internal reflection. The contribution of these phonons to
the kinetics of electron relaxation can be significant if the sound velocities
in the film and the substrate are quite different.
|
cond-mat.mes-hall
|
the twotemperature model 2tm introduced by kaganov lifshitz and tanatarov is widely used to describe the energy relaxation in the electronphonon system of a metallic film at the same time the accuracy of the description of the electronphonon system in terms of 2tm ie on the basis of the electron and phonon temperatures has not been considered in detail until now in this paper we present a microscopic theory of cooling of instantly heated electrons in metallic films in framework of this theory the main features of electron cooling in thick and thin films were found and an analysis of the accuracy of the 2tm in the lowtemperature region was carried out we consider a more accurate threetemperature model which in contrast to 2tm explicitly takes into account phonons with angles of incidence exceeding the angle of total internal reflection the contribution of these phonons to the kinetics of electron relaxation can be significant if the sound velocities in the film and the substrate are quite different
|
[['the', 'twotemperature', 'model', '2tm', 'introduced', 'by', 'kaganov', 'lifshitz', 'and', 'tanatarov', 'is', 'widely', 'used', 'to', 'describe', 'the', 'energy', 'relaxation', 'in', 'the', 'electronphonon', 'system', 'of', 'a', 'metallic', 'film', 'at', 'the', 'same', 'time', 'the', 'accuracy', 'of', 'the', 'description', 'of', 'the', 'electronphonon', 'system', 'in', 'terms', 'of', '2tm', 'ie', 'on', 'the', 'basis', 'of', 'the', 'electron', 'and', 'phonon', 'temperatures', 'has', 'not', 'been', 'considered', 'in', 'detail', 'until', 'now', 'in', 'this', 'paper', 'we', 'present', 'a', 'microscopic', 'theory', 'of', 'cooling', 'of', 'instantly', 'heated', 'electrons', 'in', 'metallic', 'films', 'in', 'framework', 'of', 'this', 'theory', 'the', 'main', 'features', 'of', 'electron', 'cooling', 'in', 'thick', 'and', 'thin', 'films', 'were', 'found', 'and', 'an', 'analysis', 'of', 'the', 'accuracy', 'of', 'the', '2tm', 'in', 'the', 'lowtemperature', 'region', 'was', 'carried', 'out', 'we', 'consider', 'a', 'more', 'accurate', 'threetemperature', 'model', 'which', 'in', 'contrast', 'to', '2tm', 'explicitly', 'takes', 'into', 'account', 'phonons', 'with', 'angles', 'of', 'incidence', 'exceeding', 'the', 'angle', 'of', 'total', 'internal', 'reflection', 'the', 'contribution', 'of', 'these', 'phonons', 'to', 'the', 'kinetics', 'of', 'electron', 'relaxation', 'can', 'be', 'significant', 'if', 'the', 'sound', 'velocities', 'in', 'the', 'film', 'and', 'the', 'substrate', 'are', 'quite', 'different']]
|
[-0.08372661812688191, 0.1614119934223358, -0.07881099020456334, 0.01761452496509034, 0.012751328795362848, -0.09457283301267728, 0.05033158470107893, 0.38498112460575906, -0.242954062844952, -0.280251346214349, 0.018963630702514875, -0.2797608515135495, -0.06855669114963119, 0.1993567891705063, -0.0020080801481395087, 0.031211206661863392, -0.027560972981715958, -0.019427949300734326, -0.0669098677483937, -0.21766476192461126, 0.2728858723428594, 0.07665659546577204, 0.28250645197568885, 0.10895265527146711, 0.08325437188193381, -0.007387130878899381, 0.04159156403066703, 0.027171403949474354, -0.1419449151151376, 0.06516053984488686, 0.255623269635421, -0.02606488128209554, 0.21800612882116294, -0.4771701759512884, -0.2356161028567522, -0.001384385185405971, 0.14746442414414845, 0.12838059726819195, -0.008904019733684009, -0.22114878705792487, 0.03764672209480665, -0.16293480542505226, -0.11214435655702219, -0.04102333676608571, 0.004258219471077873, -0.016398424697837914, -0.21170031645367518, 0.09882142725512834, 0.08177415712972183, 0.05262534747023629, -0.10052592037750566, -0.09209059065499578, -0.05943703251408346, 0.08341061294987707, 0.07692383898419317, 0.012224727669304394, 0.1418632179013375, -0.10266850527841598, -0.049851161604873406, 0.3975181752669973, -0.059230001657326, -0.11236104570015008, 0.1755359505362113, -0.18690347402771734, -0.059288797511562075, 0.19607033892899348, 0.1579872866733426, 0.12515268987325212, -0.18236479283231927, 0.07772714221192221, -0.028141928479041768, 0.17531443681814765, 0.06174672449551837, 0.028341356143130953, 0.2029683443027582, 0.20952640075225337, -0.029864286454057837, 0.13720838448344114, -0.1102271308092939, -0.045749684043946755, -0.2550783948860614, -0.16826927031911784, -0.17018058585670653, 0.0478550296071503, -0.06265302768483104, -0.15735371324446906, 0.40963798310854527, 0.14750705211611284, 0.16442458278286348, -0.023831472476153265, 0.27819509162281425, 0.12261313320304469, 0.05358261752351894, 0.05947343518547938, 0.2947271724837462, 0.143056966391033, 0.09401261840860362, -0.2711977758178353, 0.07488922487961196, 0.033305086202481876]
|
1,803.05866
|
The complexity of comparing multiply-labelled trees by extending
phylogenetic-tree metrics
|
A multilabeled tree (or MUL-tree) is a rooted tree in which every leaf is
labelled by an element from some set, but in which more than one leaf may be
labelled by the same element of that set. In phylogenetics, such trees are used
in biogeographical studies, to study the evolution of gene families, and also
within approaches to construct phylogenetic networks. A multilabelled tree in
which no leaf-labels are repeated is called a phylogenetic tree, and one in
which every label is the same is also known as a tree-shape. In this paper, we
consider the complexity of computing metrics on MUL-trees that are obtained by
extending metrics on phylogenetic trees. In particular, by restricting our
attention to tree shapes, we show that computing the metric extension on
MUL-trees is NP complete for two well-known metrics on phylogenetic trees,
namely, the path-difference and Robinson Foulds distances. We also show that
the extension of the Robinson Foulds distance is fixed parameter tractable with
respect to the distance parameter. The path distance complexity result allows
us to also answer an open problem concerning the complexity of solving the
quadratic assignment problem for two matrices that are a Robinson similarity
and a Robinson dissimilarity, which we show to be NP-complete. We conclude by
considering the maximum agreement subtree (MAST) distance on phylogenetic trees
to MUL-trees. Although its extension to MUL-trees can be computed in polynomial
time, we show that computing its natural generalization to more than two
MUL-trees is NP-complete, although fixed-parameter tractable in the maximum
degree when the number of given trees is bounded.
|
q-bio.PE cs.DS math.CO
|
a multilabeled tree or multree is a rooted tree in which every leaf is labelled by an element from some set but in which more than one leaf may be labelled by the same element of that set in phylogenetics such trees are used in biogeographical studies to study the evolution of gene families and also within approaches to construct phylogenetic networks a multilabelled tree in which no leaflabels are repeated is called a phylogenetic tree and one in which every label is the same is also known as a treeshape in this paper we consider the complexity of computing metrics on multrees that are obtained by extending metrics on phylogenetic trees in particular by restricting our attention to tree shapes we show that computing the metric extension on multrees is np complete for two wellknown metrics on phylogenetic trees namely the pathdifference and robinson foulds distances we also show that the extension of the robinson foulds distance is fixed parameter tractable with respect to the distance parameter the path distance complexity result allows us to also answer an open problem concerning the complexity of solving the quadratic assignment problem for two matrices that are a robinson similarity and a robinson dissimilarity which we show to be npcomplete we conclude by considering the maximum agreement subtree mast distance on phylogenetic trees to multrees although its extension to multrees can be computed in polynomial time we show that computing its natural generalization to more than two multrees is npcomplete although fixedparameter tractable in the maximum degree when the number of given trees is bounded
|
[['a', 'multilabeled', 'tree', 'or', 'multree', 'is', 'a', 'rooted', 'tree', 'in', 'which', 'every', 'leaf', 'is', 'labelled', 'by', 'an', 'element', 'from', 'some', 'set', 'but', 'in', 'which', 'more', 'than', 'one', 'leaf', 'may', 'be', 'labelled', 'by', 'the', 'same', 'element', 'of', 'that', 'set', 'in', 'phylogenetics', 'such', 'trees', 'are', 'used', 'in', 'biogeographical', 'studies', 'to', 'study', 'the', 'evolution', 'of', 'gene', 'families', 'and', 'also', 'within', 'approaches', 'to', 'construct', 'phylogenetic', 'networks', 'a', 'multilabelled', 'tree', 'in', 'which', 'no', 'leaflabels', 'are', 'repeated', 'is', 'called', 'a', 'phylogenetic', 'tree', 'and', 'one', 'in', 'which', 'every', 'label', 'is', 'the', 'same', 'is', 'also', 'known', 'as', 'a', 'treeshape', 'in', 'this', 'paper', 'we', 'consider', 'the', 'complexity', 'of', 'computing', 'metrics', 'on', 'multrees', 'that', 'are', 'obtained', 'by', 'extending', 'metrics', 'on', 'phylogenetic', 'trees', 'in', 'particular', 'by', 'restricting', 'our', 'attention', 'to', 'tree', 'shapes', 'we', 'show', 'that', 'computing', 'the', 'metric', 'extension', 'on', 'multrees', 'is', 'np', 'complete', 'for', 'two', 'wellknown', 'metrics', 'on', 'phylogenetic', 'trees', 'namely', 'the', 'pathdifference', 'and', 'robinson', 'foulds', 'distances', 'we', 'also', 'show', 'that', 'the', 'extension', 'of', 'the', 'robinson', 'foulds', 'distance', 'is', 'fixed', 'parameter', 'tractable', 'with', 'respect', 'to', 'the', 'distance', 'parameter', 'the', 'path', 'distance', 'complexity', 'result', 'allows', 'us', 'to', 'also', 'answer', 'an', 'open', 'problem', 'concerning', 'the', 'complexity', 'of', 'solving', 'the', 'quadratic', 'assignment', 'problem', 'for', 'two', 'matrices', 'that', 'are', 'a', 'robinson', 'similarity', 'and', 'a', 'robinson', 'dissimilarity', 'which', 'we', 'show', 'to', 'be', 'npcomplete', 'we', 'conclude', 'by', 'considering', 'the', 'maximum', 'agreement', 'subtree', 'mast', 'distance', 'on', 'phylogenetic', 'trees', 'to', 'multrees', 'although', 'its', 'extension', 'to', 'multrees', 'can', 'be', 'computed', 'in', 'polynomial', 'time', 'we', 'show', 'that', 'computing', 'its', 'natural', 'generalization', 'to', 'more', 'than', 'two', 'multrees', 'is', 'npcomplete', 'although', 'fixedparameter', 'tractable', 'in', 'the', 'maximum', 'degree', 'when', 'the', 'number', 'of', 'given', 'trees', 'is', 'bounded']]
|
[-0.10668082954184302, 0.09847995831165907, -0.044409399851267975, 0.11132815703909617, -0.10963072679058883, -0.12740467510271447, 0.06799560569747501, 0.3840039481892329, -0.2974184135984601, -0.2864930165093125, 0.09773704063819139, -0.28456194795236456, -0.18161968545693163, 0.19150299451025984, -0.11132265449295403, 0.026760694605941736, 0.11555041063520062, 0.0911089472671729, -0.02595328740093089, -0.2704109469195828, 0.33802283679860295, 0.044608439301506736, 0.2199735363593453, 0.04159137504957332, 0.10037990596691032, -0.0030980542380334313, -0.024067781078016017, 0.11944644577367558, -0.12390499737953282, 0.1216177238908575, 0.2905847821313575, 0.23986347859106844, 0.22917791050752157, -0.3371058726984961, -0.1813157795681147, 0.18145407015281792, 0.12352749954407878, 0.11784102269297267, 0.009231392872579331, -0.22700902134293818, 0.1370888094640806, -0.12142081431497309, -0.051463604863832585, -0.010234826162656528, 0.06532540642443106, -0.0338127045596253, -0.23215361347222943, 0.0009791626064426743, 0.06642828238879167, 0.033782404257646205, -0.002099764627761755, -0.14835913981424773, -0.023281046396427085, 0.09489087701318803, -0.001625835956276608, 0.09066633290685855, 0.023661385712441314, -0.06608533816619151, -0.1720758394377292, 0.35392974846719105, -0.021110990824633746, -0.24518850532125766, 0.18463814834786849, -0.09262881601604327, -0.19232033874007753, 0.06923425406882297, 0.14159643551057474, 0.13550231615543537, -0.16675311160205644, 0.11606513689634682, -0.07669401847853376, 0.13797697150512805, 0.14753825962632355, -0.0492965862506706, 0.1451191116143109, 0.17386168657396814, 0.13899122061072813, 0.17266825800770466, -0.020562720838720905, -0.08153384233574305, -0.21146504159035687, -0.14180933347128274, -0.19168449215989075, 0.008188599625759881, -0.17004315726408373, -0.21846508367328357, 0.37774661655416925, 0.14928760842592562, 0.21615516502438611, 0.16512222447875133, 0.2516556611632971, 0.0758499856461737, 0.06950516214252997, 0.11711220787518181, 0.15030254819663685, 0.13317770647499994, -0.017592341150334888, -0.16558490283182958, 0.11221406296342576, 0.11672190940273057]
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.