id float64 706 1.8k | title stringlengths 1 343 | abstract stringlengths 6 6.09k | categories stringlengths 5 125 | processed_abstract stringlengths 2 5.96k | tokenized_abstract stringlengths 8 8.74k | centroid stringlengths 2.1k 2.17k |
|---|---|---|---|---|---|---|
1,802.0516 | Cognitive Deficit of Deep Learning in Numerosity | Subitizing, or the sense of small natural numbers, is an innate cognitive
function of humans and primates; it responds to visual stimuli prior to the
development of any symbolic skills, language or arithmetic. Given successes of
deep learning (DL) in tasks of visual intelligence and given the primitivity of
number sense, a tantalizing question is whether DL can comprehend numbers and
perform subitizing. But somewhat disappointingly, extensive experiments of the
type of cognitive psychology demonstrate that the examples-driven black box DL
cannot see through superficial variations in visual representations and distill
the abstract notion of natural number, a task that children perform with high
accuracy and confidence. The failure is apparently due to the learning method
not the CNN computational machinery itself. A recurrent neural network capable
of subitizing does exist, which we construct by encoding a mechanism of
mathematical morphology into the CNN convolutional kernels. Also, we
investigate, using subitizing as a test bed, the ways to aid the black box DL
by cognitive priors derived from human insight. Our findings are mixed and
interesting, pointing to both cognitive deficit of pure DL, and some measured
successes of boosting DL by predetermined cognitive implements. This case study
of DL in cognitive computing is meaningful for visual numerosity represents a
minimum level of human intelligence.
| cs.CV | subitizing or the sense of small natural numbers is an innate cognitive function of humans and primates it responds to visual stimuli prior to the development of any symbolic skills language or arithmetic given successes of deep learning dl in tasks of visual intelligence and given the primitivity of number sense a tantalizing question is whether dl can comprehend numbers and perform subitizing but somewhat disappointingly extensive experiments of the type of cognitive psychology demonstrate that the examplesdriven black box dl cannot see through superficial variations in visual representations and distill the abstract notion of natural number a task that children perform with high accuracy and confidence the failure is apparently due to the learning method not the cnn computational machinery itself a recurrent neural network capable of subitizing does exist which we construct by encoding a mechanism of mathematical morphology into the cnn convolutional kernels also we investigate using subitizing as a test bed the ways to aid the black box dl by cognitive priors derived from human insight our findings are mixed and interesting pointing to both cognitive deficit of pure dl and some measured successes of boosting dl by predetermined cognitive implements this case study of dl in cognitive computing is meaningful for visual numerosity represents a minimum level of human intelligence | [['subitizing', 'or', 'the', 'sense', 'of', 'small', 'natural', 'numbers', 'is', 'an', 'innate', 'cognitive', 'function', 'of', 'humans', 'and', 'primates', 'it', 'responds', 'to', 'visual', 'stimuli', 'prior', 'to', 'the', 'development', 'of', 'any', 'symbolic', 'skills', 'language', 'or', 'arithmetic', 'given', 'successes', 'of', 'deep', 'learning', 'dl', 'in', 'tasks', 'of', 'visual', 'intelligence', 'and', 'given', 'the', 'primitivity', 'of', 'number', 'sense', 'a', 'tantalizing', 'question', 'is', 'whether', 'dl', 'can', 'comprehend', 'numbers', 'and', 'perform', 'subitizing', 'but', 'somewhat', 'disappointingly', 'extensive', 'experiments', 'of', 'the', 'type', 'of', 'cognitive', 'psychology', 'demonstrate', 'that', 'the', 'examplesdriven', 'black', 'box', 'dl', 'can', 'not', 'see', 'through', 'superficial', 'variations', 'in', 'visual', 'representations', 'and', 'distill', 'the', 'abstract', 'notion', 'of', 'natural', 'number', 'a', 'task', 'that', 'children', 'perform', 'with', 'high', 'accuracy', 'and', 'confidence', 'the', 'failure', 'is', 'apparently', 'due', 'to', 'the', 'learning', 'method', 'not', 'the', 'cnn', 'computational', 'machinery', 'itself', 'a', 'recurrent', 'neural', 'network', 'capable', 'of', 'subitizing', 'does', 'exist', 'which', 'we', 'construct', 'by', 'encoding', 'a', 'mechanism', 'of', 'mathematical', 'morphology', 'into', 'the', 'cnn', 'convolutional', 'kernels', 'also', 'we', 'investigate', 'using', 'subitizing', 'as', 'a', 'test', 'bed', 'the', 'ways', 'to', 'aid', 'the', 'black', 'box', 'dl', 'by', 'cognitive', 'priors', 'derived', 'from', 'human', 'insight', 'our', 'findings', 'are', 'mixed', 'and', 'interesting', 'pointing', 'to', 'both', 'cognitive', 'deficit', 'of', 'pure', 'dl', 'and', 'some', 'measured', 'successes', 'of', 'boosting', 'dl', 'by', 'predetermined', 'cognitive', 'implements', 'this', 'case', 'study', 'of', 'dl', 'in', 'cognitive', 'computing', 'is', 'meaningful', 'for', 'visual', 'numerosity', 'represents', 'a', 'minimum', 'level', 'of', 'human', 'intelligence']] | [-0.06938916257539288, 0.05160144018936567, -0.0777491166971104, 0.10350777143991531, -0.161274776945627, -0.20215401617420276, 0.06056269107299835, 0.3810426454287196, -0.2758715726781723, -0.34121127158490033, 0.02109660540956484, -0.22656786030071766, -0.2499093987069331, 0.16127393408678473, -0.1752932530557087, 0.06001704071410174, 0.08627335837782296, 0.0835311831240434, -0.022911687730811536, -0.24079466465059235, 0.30410726553500567, 0.05446313036007395, 0.2960400598426891, 0.03240833791232733, 0.11301152659363525, -0.04544843979786302, -0.04153140138964667, -0.01656838936655414, -0.0514688348769194, 0.17070059621338407, 0.33715720715022884, 0.2784694162522291, 0.3593548162742843, -0.4342232249937085, -0.24040204757326392, 0.08390428683893798, 0.16026018734609837, 0.051656220586385665, -0.007044766018123821, -0.31524856999234924, 0.10850173092642149, -0.17769983624606284, -0.023035820181546516, -0.10341216070566672, 0.03112656695789896, -0.03064654743769964, -0.25280145671337756, 0.011414081017286408, 0.12407234757055724, 0.13093006409877955, -0.04864020346620575, -0.0745839994314105, 0.03522712646387612, 0.1793992655904054, 0.03663276715507341, 0.06305694392040306, 0.16996707020673987, -0.22285531501415684, -0.1585495333934506, 0.3593229906070371, 0.016349703905194305, -0.22075601473537296, 0.23741017221256572, -0.08673675490305001, -0.1387324893782132, 0.06940071055297414, 0.19094645072554434, 0.059121868055487095, -0.13339451664062432, 0.03753586133405956, -0.03694706602931716, 0.18787245594322421, 0.08295894718165835, 0.01166416921241339, 0.2259822443214267, 0.20690269729726254, -0.015504053856657688, 0.11090143681422612, -0.07204197839249012, -0.06729675648344118, -0.2149233766225015, -0.12895773407505, -0.16663248243330175, 0.033384816303204876, -0.08941129893964687, -0.14468039610466465, 0.37469592889294373, 0.16166462122874203, 0.19439100592808667, 0.13513947340638138, 0.3107357396809168, 0.04713718653006782, 0.0908250050142754, 0.06892206545805472, 0.17639275010591265, 0.0669249516955122, 0.13250366934401872, -0.18492729641405087, 0.09882546558023192, 0.02932517794827216] |
1,802.05161 | Thermalization of dipole oscillations in confined systems by rare
collisions | We study the relaxation of the center-of-mass, or dipole oscillations in the
system of interacting fermions confined spatially. With the confinement
frequency $\omega_{\perp}$ fixed the particles were considered to freely move
along one (quasi-1D) or two (quasi-2D) spatial dimensions. We have focused on
the regime of rare collisions, such that the inelastic collision rate,
$1/\tau_{in} \ll \omega_{\perp}$. The dipole oscillations relaxation rate,
$1/\tau_{\perp}$ is obtained at three different levels: by direct perturbation
theory, solving the integral Bethe-Salpeter equation and applying the memory
function formalism. As long as anharmonicity is weak, $1/\tau_{\perp} \ll 1/
\tau_{in}$ the three methods are shown to give identical results. In quasi-2D
case $1/\tau_{\perp} \neq 0$ at zero temperature. In quasi-1D system
$1/\tau_{\perp} \propto T^3$ if the Fermi energy, $E_F$ lies below the critical
value, $E_F < 3 \omega_{\perp}/4$. Otherwise, unless the system is close to
integrability, the rate $1/\tau_{\perp}$ has the temperature dependence similar
to that in quasi-2D. In all cases the relaxation results from the excitation of
particle-hole pairs propagating along unconfined directions resulting in the
relationship $1/\tau_{\perp} \propto 1/\tau_{in}$, with the inelastic rate
$1/\tau_{in} \neq 0$ as the phase-space opens up at finite energy of
excitation, $\hbar \omega_{\perp}$. While $1/\tau_{\perp} \propto \tau_{in}$ in
the hydrodynamic regime, $\omega_{\perp} \ll 1/\tau_{in}$, in the regime of
rare collisions, $\omega_{\perp} \gg 1/\tau_{in}$, we obtain the opposite trend
$1/\tau_{\perp} \propto 1/\tau_{in}$.
| cond-mat.mes-hall | we study the relaxation of the centerofmass or dipole oscillations in the system of interacting fermions confined spatially with the confinement frequency omega_perp fixed the particles were considered to freely move along one quasi1d or two quasi2d spatial dimensions we have focused on the regime of rare collisions such that the inelastic collision rate 1tau_in ll omega_perp the dipole oscillations relaxation rate 1tau_perp is obtained at three different levels by direct perturbation theory solving the integral bethesalpeter equation and applying the memory function formalism as long as anharmonicity is weak 1tau_perp ll 1 tau_in the three methods are shown to give identical results in quasi2d case 1tau_perp neq 0 at zero temperature in quasi1d system 1tau_perp propto t3 if the fermi energy e_f lies below the critical value e_f 3 omega_perp4 otherwise unless the system is close to integrability the rate 1tau_perp has the temperature dependence similar to that in quasi2d in all cases the relaxation results from the excitation of particlehole pairs propagating along unconfined directions resulting in the relationship 1tau_perp propto 1tau_in with the inelastic rate 1tau_in neq 0 as the phasespace opens up at finite energy of excitation hbar omega_perp while 1tau_perp propto tau_in in the hydrodynamic regime omega_perp ll 1tau_in in the regime of rare collisions omega_perp gg 1tau_in we obtain the opposite trend 1tau_perp propto 1tau_in | [['we', 'study', 'the', 'relaxation', 'of', 'the', 'centerofmass', 'or', 'dipole', 'oscillations', 'in', 'the', 'system', 'of', 'interacting', 'fermions', 'confined', 'spatially', 'with', 'the', 'confinement', 'frequency', 'omega_perp', 'fixed', 'the', 'particles', 'were', 'considered', 'to', 'freely', 'move', 'along', 'one', 'quasi1d', 'or', 'two', 'quasi2d', 'spatial', 'dimensions', 'we', 'have', 'focused', 'on', 'the', 'regime', 'of', 'rare', 'collisions', 'such', 'that', 'the', 'inelastic', 'collision', 'rate', '1tau_in', 'll', 'omega_perp', 'the', 'dipole', 'oscillations', 'relaxation', 'rate', '1tau_perp', 'is', 'obtained', 'at', 'three', 'different', 'levels', 'by', 'direct', 'perturbation', 'theory', 'solving', 'the', 'integral', 'bethesalpeter', 'equation', 'and', 'applying', 'the', 'memory', 'function', 'formalism', 'as', 'long', 'as', 'anharmonicity', 'is', 'weak', '1tau_perp', 'll', '1', 'tau_in', 'the', 'three', 'methods', 'are', 'shown', 'to', 'give', 'identical', 'results', 'in', 'quasi2d', 'case', '1tau_perp', 'neq', '0', 'at', 'zero', 'temperature', 'in', 'quasi1d', 'system', '1tau_perp', 'propto', 't3', 'if', 'the', 'fermi', 'energy', 'e_f', 'lies', 'below', 'the', 'critical', 'value', 'e_f', '3', 'omega_perp4', 'otherwise', 'unless', 'the', 'system', 'is', 'close', 'to', 'integrability', 'the', 'rate', '1tau_perp', 'has', 'the', 'temperature', 'dependence', 'similar', 'to', 'that', 'in', 'quasi2d', 'in', 'all', 'cases', 'the', 'relaxation', 'results', 'from', 'the', 'excitation', 'of', 'particlehole', 'pairs', 'propagating', 'along', 'unconfined', 'directions', 'resulting', 'in', 'the', 'relationship', '1tau_perp', 'propto', '1tau_in', 'with', 'the', 'inelastic', 'rate', '1tau_in', 'neq', '0', 'as', 'the', 'phasespace', 'opens', 'up', 'at', 'finite', 'energy', 'of', 'excitation', 'hbar', 'omega_perp', 'while', '1tau_perp', 'propto', 'tau_in', 'in', 'the', 'hydrodynamic', 'regime', 'omega_perp', 'll', '1tau_in', 'in', 'the', 'regime', 'of', 'rare', 'collisions', 'omega_perp', 'gg', '1tau_in', 'we', 'obtain', 'the', 'opposite', 'trend', '1tau_perp', 'propto', '1tau_in']] | [-0.1862737938872835, 0.2386681398154575, -0.039628439021974125, 0.06454209455617026, 0.02059408564607359, -0.19520421994172715, -0.0006558079087302428, 0.3225156111388721, -0.24723694816599495, -0.21505701616194778, -0.029559418726289137, -0.3597750769843432, -0.021152763276636094, 0.17500131502112543, 0.08005057399965484, 0.013072724203547378, -0.015477117199704729, 0.005884048394562507, -0.06320823671359738, -0.15643023841985268, 0.2657312413762239, 0.04429367980178953, 0.2739499832376499, 0.07635800241418607, 0.03970231728797609, 0.002131850622721355, 0.11956048353617503, -0.028867594625171477, -0.1979381895215986, -0.05820058344477068, 0.22716992034322836, -0.0754404087069402, 0.22187170238996093, -0.39743616090748796, -0.15347046894232996, 0.051290477176239205, 0.2370748027894561, 0.0897734727086076, 0.015662723218238996, -0.22745937141007744, 0.020910887483676727, -0.14174131442983212, -0.17099693422787823, -0.041447717948308725, 0.05353816187601875, 0.0317719586603661, -0.2578011323740198, 0.197148838740329, 0.07707444301129064, 0.04970507868843428, -0.08552813791267744, -0.14252084046311211, -0.019721718833104453, 0.02662649110848592, 0.10294609626183625, 0.09090333673785525, 0.12371190256566147, -0.11782609578248494, -0.034986620097929105, 0.3592979541006075, -0.10154440996067768, -0.14799437924626876, 0.19832787555642425, -0.24381271770054644, -0.08664041330762716, 0.17073911326429383, 0.11959004535085775, 0.09196914969943464, -0.09405556805590591, 0.12611492622236256, 0.0034396063494072718, 0.14062321314545856, 0.10243265954142605, 0.04234077418910932, 0.18945286358158972, 0.1656694736014205, 0.013530083909228613, 0.08177501698532565, -0.12960560742278837, -0.06918196559206329, -0.29643359007313846, -0.07608417575341843, -0.18407389227861792, 0.09689207890875298, -0.0655677505179483, -0.09492311089508637, 0.3185730482599783, 0.0984671216218637, 0.2351143390596421, 0.06363804452015426, 0.25131906983019275, 0.19029847475625997, 0.026810808904172683, 0.10540968680500307, 0.2668453283988955, 0.12686061559520154, 0.11632759517206895, -0.3140711671334099, -0.04119852647523988, 0.03272385299629108] |
1,802.05162 | BachProp: Learning to Compose Music in Multiple Styles | Hand in hand with deep learning advancements, algorithms of music composition
increase in performance. However, most of the successful models are designed
for specific musical structures. Here, we present BachProp, an algorithmic
composer that can generate music scores in any style given sufficient training
data. To adapt BachProp to a broad range of musical styles, we propose a novel
normalized representation of music and train a deep network to predict the note
transition probabilities of a given music corpus. In this paper, new music
scores sampled by BachProp are compared with the original corpora via
crowdsourcing. This evaluation indicates that the music scores generated by
BachProp are not less preferred than the original music corpus the algorithm
was provided with.
| cs.SD eess.AS | hand in hand with deep learning advancements algorithms of music composition increase in performance however most of the successful models are designed for specific musical structures here we present bachprop an algorithmic composer that can generate music scores in any style given sufficient training data to adapt bachprop to a broad range of musical styles we propose a novel normalized representation of music and train a deep network to predict the note transition probabilities of a given music corpus in this paper new music scores sampled by bachprop are compared with the original corpora via crowdsourcing this evaluation indicates that the music scores generated by bachprop are not less preferred than the original music corpus the algorithm was provided with | [['hand', 'in', 'hand', 'with', 'deep', 'learning', 'advancements', 'algorithms', 'of', 'music', 'composition', 'increase', 'in', 'performance', 'however', 'most', 'of', 'the', 'successful', 'models', 'are', 'designed', 'for', 'specific', 'musical', 'structures', 'here', 'we', 'present', 'bachprop', 'an', 'algorithmic', 'composer', 'that', 'can', 'generate', 'music', 'scores', 'in', 'any', 'style', 'given', 'sufficient', 'training', 'data', 'to', 'adapt', 'bachprop', 'to', 'a', 'broad', 'range', 'of', 'musical', 'styles', 'we', 'propose', 'a', 'novel', 'normalized', 'representation', 'of', 'music', 'and', 'train', 'a', 'deep', 'network', 'to', 'predict', 'the', 'note', 'transition', 'probabilities', 'of', 'a', 'given', 'music', 'corpus', 'in', 'this', 'paper', 'new', 'music', 'scores', 'sampled', 'by', 'bachprop', 'are', 'compared', 'with', 'the', 'original', 'corpora', 'via', 'crowdsourcing', 'this', 'evaluation', 'indicates', 'that', 'the', 'music', 'scores', 'generated', 'by', 'bachprop', 'are', 'not', 'less', 'preferred', 'than', 'the', 'original', 'music', 'corpus', 'the', 'algorithm', 'was', 'provided', 'with']] | [-0.01711073133822841, 0.06121047361145126, -0.09147406194824725, 0.08922913305577822, -0.17137479327308636, -0.1437606674968265, -0.006874171437812038, 0.46737312388916813, -0.23532928769030453, -0.3435367790206025, 0.050787141092587265, -0.27237583700722706, -0.19979348097501012, 0.19736037495701264, -0.15549727331769342, 0.030089893513165104, 0.1433226916240528, 0.06965289275782803, -0.06542725077985476, -0.2900263405094544, 0.3100348231421473, 0.0623855395897408, 0.3482851009699516, -0.019912631526434174, 0.12557944606232924, -0.06713722145650536, -0.060209434539622936, -0.027651918075086237, -0.08420342199084795, 0.19801926926787322, 0.35514979344773867, 0.2507692625125249, 0.3386889950372279, -0.3761662352830172, -0.15789801120602837, 0.08736168962398855, 0.1363714302928808, 0.1190357377694454, -0.06329389843643488, -0.3370636152879645, 0.1231744124709318, -0.15927922216554483, 0.06669104809407145, -0.10596695797673115, -0.02672296858703097, 0.026876254382174617, -0.2587358578069446, 0.027864023744283865, 0.06565605772193521, 0.11052551730535924, -0.02913984837359749, -0.1430210175041187, 0.04448255781705181, 0.17833925498028597, 0.0619960344163701, 0.06989284832961858, 0.10769397392092893, -0.17624207269157827, -0.17309730623771127, 0.37668158126374085, -0.1161609348362011, -0.19059747530457874, 0.15402835932715486, -0.04686170850570003, -0.13077400838568184, 0.10020553710249563, 0.21562228305653358, 0.09817384549727043, -0.16709072230538974, -0.0566850366347353, -0.06626645581175884, 0.2658332730565841, 0.08426756639576828, -0.04108380075388898, 0.18524485113448463, 0.21999317317095118, -0.035380458140571135, 0.1476124616766659, -0.05199005592148751, -0.023334624998581906, -0.17498679840161155, -0.11397015404266615, -0.20207883563125506, -0.04933307059097084, -0.09328820640985214, -0.18670456288576437, 0.4179944730674227, 0.2448161277242131, 0.17476070191090307, 0.12596854902803897, 0.2944271822964462, 0.015446585415338632, 0.0855917057361997, 0.08660088429460303, 0.14660272135127647, -0.01778951007484769, 0.17166880595420178, -0.11503808050959681, 0.12114930124371312, 0.03207045024416099] |
1,802.05163 | Observational aspects of Outbursting Black Hole Sources - Evolution of
Spectro-Temporal features and X-ray Variability | We report on our attempt to understand the outbursting profile of Galactic
Black Hole (GBH) sources, keeping in mind the evolution of temporal and
spectral features during the outburst. We present results of evolution of
Quasi-periodic Oscillations (QPOs), spectral states and possible connection
with Jet ejections during the outburst phase. Further, we attempt to connect
the observed X-ray variabilities (i.e., `class' / `structured' variabilities,
similar to GRS 1915+105) with spectral states of BH sources. Towards these
studies, we consider three Black Hole sources that have undergone single (XTE
J1859+226), a few (IGR J17091-3624) and many (GX 339-4) outbursts since the
start of RXTE era. Finally, we model the broadband energy spectra (3 - 150 keV)
of different spectral states using RXTE and NuSTAR observations. Results are
discussed in the context of two component advective flow model, while
constraining the mass of the three BH sources.
| astro-ph.HE | we report on our attempt to understand the outbursting profile of galactic black hole gbh sources keeping in mind the evolution of temporal and spectral features during the outburst we present results of evolution of quasiperiodic oscillations qpos spectral states and possible connection with jet ejections during the outburst phase further we attempt to connect the observed xray variabilities ie class structured variabilities similar to grs 1915105 with spectral states of bh sources towards these studies we consider three black hole sources that have undergone single xte j1859226 a few igr j170913624 and many gx 3394 outbursts since the start of rxte era finally we model the broadband energy spectra 3 150 kev of different spectral states using rxte and nustar observations results are discussed in the context of two component advective flow model while constraining the mass of the three bh sources | [['we', 'report', 'on', 'our', 'attempt', 'to', 'understand', 'the', 'outbursting', 'profile', 'of', 'galactic', 'black', 'hole', 'gbh', 'sources', 'keeping', 'in', 'mind', 'the', 'evolution', 'of', 'temporal', 'and', 'spectral', 'features', 'during', 'the', 'outburst', 'we', 'present', 'results', 'of', 'evolution', 'of', 'quasiperiodic', 'oscillations', 'qpos', 'spectral', 'states', 'and', 'possible', 'connection', 'with', 'jet', 'ejections', 'during', 'the', 'outburst', 'phase', 'further', 'we', 'attempt', 'to', 'connect', 'the', 'observed', 'xray', 'variabilities', 'ie', 'class', 'structured', 'variabilities', 'similar', 'to', 'grs', '1915105', 'with', 'spectral', 'states', 'of', 'bh', 'sources', 'towards', 'these', 'studies', 'we', 'consider', 'three', 'black', 'hole', 'sources', 'that', 'have', 'undergone', 'single', 'xte', 'j1859226', 'a', 'few', 'igr', 'j170913624', 'and', 'many', 'gx', '3394', 'outbursts', 'since', 'the', 'start', 'of', 'rxte', 'era', 'finally', 'we', 'model', 'the', 'broadband', 'energy', 'spectra', '3', '150', 'kev', 'of', 'different', 'spectral', 'states', 'using', 'rxte', 'and', 'nustar', 'observations', 'results', 'are', 'discussed', 'in', 'the', 'context', 'of', 'two', 'component', 'advective', 'flow', 'model', 'while', 'constraining', 'the', 'mass', 'of', 'the', 'three', 'bh', 'sources']] | [-0.09421453825230677, 0.1036874919631551, -0.06805397714390517, 0.14279963568478196, -0.12005334134519725, -0.12066976601336073, 0.0415797178597691, 0.4744753541646304, -0.1457993718241895, -0.34426500609285404, 0.14467190555134019, -0.3815404294136833, -0.0504761805328039, 0.22608966732371624, -0.04353958052470134, 0.05894577788462589, 0.1014805453914133, -0.09268956451018999, -0.08016704791510426, -0.22268833954479883, 0.3190355196683114, 0.06626857580109076, 0.15194182697735675, -0.05883968931499061, 0.09533603854438329, -0.06288537149434792, -0.04351756287986165, -0.08944575193539991, -0.11453900360651892, 0.03301728702796675, 0.2606792365627402, 0.14736037145302, 0.17659206691009183, -0.3789146577717958, -0.2862169228728626, 0.04778947614432944, 0.15748367730366924, -0.026843708381382423, -0.01783133482225109, -0.24059396485921802, 0.03420128097588366, -0.27125313051266375, -0.13700092489459922, 0.007473639808464926, 0.06234521083403509, 0.013380465735567382, -0.1315316817742753, 0.1298154758165714, 0.0665944253370879, -0.020881950580091638, -0.2303488002601568, -0.008812854338398242, -0.034214493390368104, 0.08831039081177824, 0.13853600031575775, 0.011968530673807213, 0.12008060349177543, -0.07837269529439769, -0.17266080488118676, 0.29863273830094433, -0.0379640624701319, 0.06038813281257253, 0.18761194044304036, -0.239940950301821, -0.2549430846132442, 0.12827321327897115, 0.14434129787752262, 0.13007915103677792, -0.1252731314788644, -0.02644440683314798, 0.008996642447871293, 0.2735709431092743, 0.04708528189131847, 0.10950652608433022, 0.37541822268516867, 0.09515794995485095, -0.05063927401112835, 0.19286067753548283, -0.25635908819064235, -0.03982067896888455, -0.2311841734828284, -0.021155235951870577, -0.11581387837788651, 0.11916181859983639, -0.11107500776008644, -0.12570694622166873, 0.48485164261273256, 0.0839421417323182, 0.22807959913946949, -0.021439879665385696, 0.2522140944073745, 0.08695268746012809, -0.020969669598356618, 0.16181070115286988, 0.34587001903438486, 0.13063940649585135, 0.19942708160578423, -0.25306273841175375, 0.020168257955383587, 0.026600065994421607] |
1,802.05164 | Quantum behavior of the "Little Sibling" of the Big Rip induced by a
three-form field | A canonical quantization \`a la Wheeler-DeWitt is performed for a model of
three-form fields in a homogeneous and isotropic universe. We start by carrying
out the Hamiltonian formalism of this cosmological model. We then apply this
formalism to a Little Sibling of the Big Rip (LSBR), an abrupt event milder
than a Big Rip and that is known to be generic to several minimally coupled
three-form fields for a variety of potentials. We obtain a set of analytical
solutions of the Wheeler-DeWitt equation using different analytical
approximations and explore the physical consequences of them. It turns out that
there are quantum states where the wave function of the universe vanishes, i.e.
the DeWitt condition is fulfilled for them. Given that this happens only for
some subset of solutions of the Wheeler-DeWitt equation, this points out that
the matter inducing the LSBR is equally important in the process as, it has
been previously shown, a minimally coupled phantom scalar field feeding
classically a LSBR is smoothed at the quantum level, i.e. all the quantum
states lead to a vanishing wave function.
| gr-qc | a canonical quantization a la wheelerdewitt is performed for a model of threeform fields in a homogeneous and isotropic universe we start by carrying out the hamiltonian formalism of this cosmological model we then apply this formalism to a little sibling of the big rip lsbr an abrupt event milder than a big rip and that is known to be generic to several minimally coupled threeform fields for a variety of potentials we obtain a set of analytical solutions of the wheelerdewitt equation using different analytical approximations and explore the physical consequences of them it turns out that there are quantum states where the wave function of the universe vanishes ie the dewitt condition is fulfilled for them given that this happens only for some subset of solutions of the wheelerdewitt equation this points out that the matter inducing the lsbr is equally important in the process as it has been previously shown a minimally coupled phantom scalar field feeding classically a lsbr is smoothed at the quantum level ie all the quantum states lead to a vanishing wave function | [['a', 'canonical', 'quantization', 'a', 'la', 'wheelerdewitt', 'is', 'performed', 'for', 'a', 'model', 'of', 'threeform', 'fields', 'in', 'a', 'homogeneous', 'and', 'isotropic', 'universe', 'we', 'start', 'by', 'carrying', 'out', 'the', 'hamiltonian', 'formalism', 'of', 'this', 'cosmological', 'model', 'we', 'then', 'apply', 'this', 'formalism', 'to', 'a', 'little', 'sibling', 'of', 'the', 'big', 'rip', 'lsbr', 'an', 'abrupt', 'event', 'milder', 'than', 'a', 'big', 'rip', 'and', 'that', 'is', 'known', 'to', 'be', 'generic', 'to', 'several', 'minimally', 'coupled', 'threeform', 'fields', 'for', 'a', 'variety', 'of', 'potentials', 'we', 'obtain', 'a', 'set', 'of', 'analytical', 'solutions', 'of', 'the', 'wheelerdewitt', 'equation', 'using', 'different', 'analytical', 'approximations', 'and', 'explore', 'the', 'physical', 'consequences', 'of', 'them', 'it', 'turns', 'out', 'that', 'there', 'are', 'quantum', 'states', 'where', 'the', 'wave', 'function', 'of', 'the', 'universe', 'vanishes', 'ie', 'the', 'dewitt', 'condition', 'is', 'fulfilled', 'for', 'them', 'given', 'that', 'this', 'happens', 'only', 'for', 'some', 'subset', 'of', 'solutions', 'of', 'the', 'wheelerdewitt', 'equation', 'this', 'points', 'out', 'that', 'the', 'matter', 'inducing', 'the', 'lsbr', 'is', 'equally', 'important', 'in', 'the', 'process', 'as', 'it', 'has', 'been', 'previously', 'shown', 'a', 'minimally', 'coupled', 'phantom', 'scalar', 'field', 'feeding', 'classically', 'a', 'lsbr', 'is', 'smoothed', 'at', 'the', 'quantum', 'level', 'ie', 'all', 'the', 'quantum', 'states', 'lead', 'to', 'a', 'vanishing', 'wave', 'function']] | [-0.1517237506502877, 0.10673226757409995, -0.1202421935262262, 0.10889565968186111, -0.07900992854912248, -0.16986880182650768, -0.004178405383653525, 0.2973788045708918, -0.22650931022233434, -0.23536748719246436, 0.08367988420779714, -0.2642489682727804, -0.1578324034958819, 0.156502723997821, -0.009336315999583652, 0.04293645331894772, 0.04343095746719175, 0.08739671980341275, -0.08721336029056045, -0.27471975260931586, 0.3614885627693083, 0.06142759943678458, 0.23449430730090373, -0.0005819292541774404, 0.12723295227495127, -0.046141000073920524, 0.03996489566957785, 0.03567379050784641, -0.1370857274297224, 0.023648455722852506, 0.21776367084821685, 0.1427644360694103, 0.2694037453012748, -0.4352588748869797, -0.24388727374348995, 0.15383783828357184, 0.1431611432461068, 0.16967666590660682, -0.05287930908250726, -0.2870765281530718, 0.09434932116540343, -0.1589085452281223, -0.14717260639493665, -0.06267077123953237, 0.010602976167703875, -0.06265316804250082, -0.2495788431312475, 0.07172462332140034, 0.028441735311773502, -0.012781637045554817, -0.06774012228836201, -0.04343434105006357, -0.009809467860031873, 0.0648113081490414, 0.04913446769464321, 0.051338858075420525, 0.09381916014632831, -0.16102834338736202, -0.04931628080408296, 0.39349526510470445, -0.054993006628824836, -0.23803222525036996, 0.13138087012210034, -0.1064401300287702, -0.11943961904228975, 0.10298743020587911, 0.06543311437773001, 0.13982979268249537, -0.15315756962065483, 0.16247907914124274, -0.01565937451588171, 0.13531296331849363, 0.0905639394496878, -0.00989718398777768, 0.24919093320560123, 0.1175913621723238, 0.049941149485918386, 0.11406525713844329, -0.022420676011501606, -0.14511228373222468, -0.36504317979431816, -0.1772871674708262, -0.16184037744856647, 0.12380565607632485, -0.10231819036651157, -0.20629355641026956, 0.38318407151641115, 0.12543461169633602, 0.18846034660883662, 0.021398506578730627, 0.2527770575601608, 0.13785562288256997, 0.04556600915449154, 0.042403864143933684, 0.2552022167282606, 0.1391015269205026, 0.09670325388821463, -0.18631858220808983, -0.018058551237401035, 0.04791399051124851] |
1,802.05165 | Large-scale dynamic assembly of metal nanostructures in plasmofluidic
field | We discuss two aspects of the plasmofluidic assembly of plasmonic
nanostructures at the metal fluid interface. First, we experimentally show how
three and four spot evanescent wave excitation can lead to unconventional
assembly of plasmonic nanoparticles at the metal fluid interface. We observed
that the pattern of assembly was mainly governed by the plasmon interference
pattern at the metal fluid interface, and further led to interesting dynamic
effects within the assembly. The interference patterns were corroborated by 3D
finite difference time domain simulations. Secondly, we show how anisotropic
geometry, such as Ag nanowires, can be assembled and aligned in unstructured
and structured plasmofluidic fields. We found that by structuring the
metal-film, Ag nanowires can be aligned at the metal fluid interface with a
single evanescent wave excitation, thus highlighting the prospect of assembling
plasmonic circuits in a fluid. An interesting aspect of our method is that we
obtain the assembly at locations away from the excitation points, thus leading
to remote assembly of nanostructures. The results discussed herein may have
implications in realizing a platform for reconfigurable plasmonic
metamaterials, and a test-bed to understand the effect of plasmon interference
on assembly of nanostructures in fluids.
| physics.optics cond-mat.mes-hall cond-mat.soft physics.app-ph | we discuss two aspects of the plasmofluidic assembly of plasmonic nanostructures at the metal fluid interface first we experimentally show how three and four spot evanescent wave excitation can lead to unconventional assembly of plasmonic nanoparticles at the metal fluid interface we observed that the pattern of assembly was mainly governed by the plasmon interference pattern at the metal fluid interface and further led to interesting dynamic effects within the assembly the interference patterns were corroborated by 3d finite difference time domain simulations secondly we show how anisotropic geometry such as ag nanowires can be assembled and aligned in unstructured and structured plasmofluidic fields we found that by structuring the metalfilm ag nanowires can be aligned at the metal fluid interface with a single evanescent wave excitation thus highlighting the prospect of assembling plasmonic circuits in a fluid an interesting aspect of our method is that we obtain the assembly at locations away from the excitation points thus leading to remote assembly of nanostructures the results discussed herein may have implications in realizing a platform for reconfigurable plasmonic metamaterials and a testbed to understand the effect of plasmon interference on assembly of nanostructures in fluids | [['we', 'discuss', 'two', 'aspects', 'of', 'the', 'plasmofluidic', 'assembly', 'of', 'plasmonic', 'nanostructures', 'at', 'the', 'metal', 'fluid', 'interface', 'first', 'we', 'experimentally', 'show', 'how', 'three', 'and', 'four', 'spot', 'evanescent', 'wave', 'excitation', 'can', 'lead', 'to', 'unconventional', 'assembly', 'of', 'plasmonic', 'nanoparticles', 'at', 'the', 'metal', 'fluid', 'interface', 'we', 'observed', 'that', 'the', 'pattern', 'of', 'assembly', 'was', 'mainly', 'governed', 'by', 'the', 'plasmon', 'interference', 'pattern', 'at', 'the', 'metal', 'fluid', 'interface', 'and', 'further', 'led', 'to', 'interesting', 'dynamic', 'effects', 'within', 'the', 'assembly', 'the', 'interference', 'patterns', 'were', 'corroborated', 'by', '3d', 'finite', 'difference', 'time', 'domain', 'simulations', 'secondly', 'we', 'show', 'how', 'anisotropic', 'geometry', 'such', 'as', 'ag', 'nanowires', 'can', 'be', 'assembled', 'and', 'aligned', 'in', 'unstructured', 'and', 'structured', 'plasmofluidic', 'fields', 'we', 'found', 'that', 'by', 'structuring', 'the', 'metalfilm', 'ag', 'nanowires', 'can', 'be', 'aligned', 'at', 'the', 'metal', 'fluid', 'interface', 'with', 'a', 'single', 'evanescent', 'wave', 'excitation', 'thus', 'highlighting', 'the', 'prospect', 'of', 'assembling', 'plasmonic', 'circuits', 'in', 'a', 'fluid', 'an', 'interesting', 'aspect', 'of', 'our', 'method', 'is', 'that', 'we', 'obtain', 'the', 'assembly', 'at', 'locations', 'away', 'from', 'the', 'excitation', 'points', 'thus', 'leading', 'to', 'remote', 'assembly', 'of', 'nanostructures', 'the', 'results', 'discussed', 'herein', 'may', 'have', 'implications', 'in', 'realizing', 'a', 'platform', 'for', 'reconfigurable', 'plasmonic', 'metamaterials', 'and', 'a', 'testbed', 'to', 'understand', 'the', 'effect', 'of', 'plasmon', 'interference', 'on', 'assembly', 'of', 'nanostructures', 'in', 'fluids']] | [-0.15413705968321897, 0.17619886612347985, -0.08478188505157447, 0.023631351090704973, -0.04844598471879577, -0.1312148434850268, -0.0009914623477902168, 0.4520672047462983, -0.25623703772345413, -0.3307228927190105, 0.02524167279688976, -0.2690807192180401, -0.21392649132280778, 0.19221334123792938, 0.034333632921035855, 0.021342641882932722, 0.0153242177879199, -0.10376117369398857, -0.018076528811406416, -0.14328809501842046, 0.2883236620025948, 0.054458632535086225, 0.3121695273770736, 0.08679844162498529, 0.06273408211672153, -0.026390467399062638, 0.03967007234071692, 0.03820001823732104, -0.14670734932248403, 0.0985962957669145, 0.2849831117460361, -0.012494033586998016, 0.21314103320623057, -0.49574945826943106, -0.20985501617049943, -0.03287301388545296, 0.2134492274770776, 0.15846762414066456, -0.14847668364035108, -0.2758278353426319, 0.07678001998231197, -0.07610861294878982, -0.11930489773408343, 0.0048354311583515925, -0.03396156320634943, 0.015873961634217545, -0.21096008634194732, 0.015790116218611216, 0.05808531231163309, 0.05889661542784709, -0.04837222445803957, -0.08785514536146552, -0.05094378954157806, 0.10138299371629285, -0.02238870048776078, -0.04215198903320692, 0.20980164824316325, -0.1233418700691217, -0.10752877916854162, 0.39188246176793023, -0.04342294921859717, -0.1621865099415374, 0.2189879225471463, -0.1776240247176387, -0.007376273030725618, 0.1641631435173062, 0.1997920169447286, 0.07235295596287752, -0.1416518645432706, 0.04148723978925353, -0.0006966486834407521, 0.1664758878139158, 0.11998403349365944, 0.048312286235010014, 0.3125957541597577, 0.2240831319624797, 0.009733390718555222, 0.1606744145616316, -0.08281583836994683, -0.031596729305023566, -0.21664284016811647, -0.1922052427374113, -0.18589274008304646, 0.00515676303095041, -0.0716240023796369, -0.18342494442570173, 0.39189009160663074, 0.13477368068057471, 0.1371743979362341, -0.02795847177815934, 0.27906577810645106, 0.03938577299555525, 0.08399539766355585, -0.003278207977135212, 0.2575662431331017, 0.14113941044272044, 0.12410210424986405, -0.28441323628290915, 0.048060643644287034, -0.003420326286831345] |
1,802.05166 | Hamiltonian dynamics and distributed chaos in DNA | It is shown that distributed chaos, generated by Hamiltonian DNA dynamics
with spontaneously broken time translational symmetry, imprints itself on the
DNA sequence of Arabidopsis thaliana (a model plant for genetic sequencing and
mapping) and of the NRXN1 and BRCA2 human genes (as an example). The
base-stacking interactions in the DNA duplex and degenerate codon groups have
been discussed in this context.
| q-bio.OT physics.bio-ph | it is shown that distributed chaos generated by hamiltonian dna dynamics with spontaneously broken time translational symmetry imprints itself on the dna sequence of arabidopsis thaliana a model plant for genetic sequencing and mapping and of the nrxn1 and brca2 human genes as an example the basestacking interactions in the dna duplex and degenerate codon groups have been discussed in this context | [['it', 'is', 'shown', 'that', 'distributed', 'chaos', 'generated', 'by', 'hamiltonian', 'dna', 'dynamics', 'with', 'spontaneously', 'broken', 'time', 'translational', 'symmetry', 'imprints', 'itself', 'on', 'the', 'dna', 'sequence', 'of', 'arabidopsis', 'thaliana', 'a', 'model', 'plant', 'for', 'genetic', 'sequencing', 'and', 'mapping', 'and', 'of', 'the', 'nrxn1', 'and', 'brca2', 'human', 'genes', 'as', 'an', 'example', 'the', 'basestacking', 'interactions', 'in', 'the', 'dna', 'duplex', 'and', 'degenerate', 'codon', 'groups', 'have', 'been', 'discussed', 'in', 'this', 'context']] | [-0.15078125004619058, 0.1803775662201881, -0.019012482969218022, 0.0713449484939056, -0.004142487414121147, -0.1701544442048837, 0.013899695610762723, 0.36933398168654213, -0.31248791179349344, -0.2072803196422155, 0.06368540065182794, -0.2421133828127847, -0.2620018892170441, 0.14014736241135264, -0.05000401539127192, 0.016026140320219942, 0.08210301164147113, 0.055149905894312165, 0.12184466010770731, -0.21482625907106745, 0.20490310912118143, 0.104009794627106, 0.3029445165114838, -0.03242090619319389, 0.14618059346685186, -0.04800785987097169, 0.014110397066800826, -0.06623550870966527, -0.12193042705750427, 0.11525962841246397, 0.26611518520381183, 0.15691911690913501, 0.2518923408952692, -0.4466753375806635, -0.23244789146607922, 0.12017363108198849, 0.2068837796668372, 0.1851016909725243, -0.11470697004716063, -0.32571375733541863, 0.06297194317824417, -0.16499387438882201, -0.052157501517344385, -0.07284656724321746, 0.030297239115762133, 0.035158469912505916, -0.19849034416819772, 0.12382035695707365, 0.04493343532686272, 0.18887927395952564, -0.05312254527703889, -0.06988931390186472, -0.11201600931705005, 0.18293325740453456, 0.09666175466038347, 0.02248686987666353, 0.18945256846153266, -0.05996646927650868, -0.13938834880959364, 0.396079485454867, -0.0016151208528167298, -0.20464039233423048, 0.16644960183334806, -0.09776109291030274, -0.22394447878844315, 0.12342289525775178, 0.10994593064195567, 0.06835943261056297, -0.20879097802624588, 0.09877927796239214, 0.00730759967043395, 0.2187954670178794, 0.1439334412946576, -0.04767967681700905, 0.19181564680090354, 0.19053655117750168, 0.013099816871897107, 0.11647215789003719, -0.052119699348094725, -0.1638733962242822, -0.17829505417255626, -0.14039444971469142, -0.16268118122412312, 0.014598133252753366, -0.04593862080571031, -0.18589547475294826, 0.4154594549007954, 0.03290366079478014, 0.12928706663660705, 0.07075711808377697, 0.21044355092359887, -0.010018266018314828, 0.1450739379131025, -0.07575230993097648, 0.07837031135756162, 0.0884835927262752, 0.04960151893957969, -0.3185979074032436, 0.11117597540179568, 0.032290685628991456] |
1,802.05167 | $W^{1,p}$ regularity of solutions to Kolmogorov equation with
Gilbarg-Serrin matrix | In $\mathbb R^d$, $d \geq 3$, consider the divergence and the non-divergence
form operators \begin{equation} \tag{$i$} -\Delta - \nabla \cdot (a-I) \cdot
\nabla + b \cdot \nabla, \end{equation} \begin{equation} \tag{$ii$} - \Delta -
(a-I) \cdot \nabla^2 + b \cdot \nabla, \end{equation} where the second order
perturbations are given by the matrix $$a-I=c|x|^{-2}x \otimes x, \quad c>-1.$$
The vector field $b:\mathbb R^d \rightarrow \mathbb R^d$ is form-bounded with
the form-bound $\delta>0$ (this includes a sub-critical class $[L^d +
L^\infty]^d$, as well as vector fields having critical-order singularities). We
characterize quantitative dependence on $c$ and $\delta$ of the $L^q
\rightarrow W^{1,qd/(d-2)}$ regularity of the resolvents of the operator
realizations of ($i$), ($ii$) in $L^q$, $q \geq 2 \vee ( d-2)$ as (minus)
generators of positivity preserving $L^\infty$ contraction $C_0$ semigroups.
| math.AP math.PR | in mathbb rd d geq 3 consider the divergence and the nondivergence form operators beginequation tagi delta nabla cdot ai cdot nabla b cdot nabla endequation beginequation tagii delta ai cdot nabla2 b cdot nabla endequation where the second order perturbations are given by the matrix aicx2x otimes x quad c1 the vector field bmathbb rd rightarrow mathbb rd is formbounded with the formbound delta0 this includes a subcritical class ld linftyd as well as vector fields having criticalorder singularities we characterize quantitative dependence on c and delta of the lq rightarrow w1qdd2 regularity of the resolvents of the operator realizations of i ii in lq q geq 2 vee d2 as minus generators of positivity preserving linfty contraction c_0 semigroups | [['in', 'mathbb', 'rd', 'd', 'geq', '3', 'consider', 'the', 'divergence', 'and', 'the', 'nondivergence', 'form', 'operators', 'beginequation', 'tagi', 'delta', 'nabla', 'cdot', 'ai', 'cdot', 'nabla', 'b', 'cdot', 'nabla', 'endequation', 'beginequation', 'tagii', 'delta', 'ai', 'cdot', 'nabla2', 'b', 'cdot', 'nabla', 'endequation', 'where', 'the', 'second', 'order', 'perturbations', 'are', 'given', 'by', 'the', 'matrix', 'aicx2x', 'otimes', 'x', 'quad', 'c1', 'the', 'vector', 'field', 'bmathbb', 'rd', 'rightarrow', 'mathbb', 'rd', 'is', 'formbounded', 'with', 'the', 'formbound', 'delta0', 'this', 'includes', 'a', 'subcritical', 'class', 'ld', 'linftyd', 'as', 'well', 'as', 'vector', 'fields', 'having', 'criticalorder', 'singularities', 'we', 'characterize', 'quantitative', 'dependence', 'on', 'c', 'and', 'delta', 'of', 'the', 'lq', 'rightarrow', 'w1qdd2', 'regularity', 'of', 'the', 'resolvents', 'of', 'the', 'operator', 'realizations', 'of', 'i', 'ii', 'in', 'lq', 'q', 'geq', '2', 'vee', 'd2', 'as', 'minus', 'generators', 'of', 'positivity', 'preserving', 'linfty', 'contraction', 'c_0', 'semigroups']] | [-0.21584476778378425, 0.11486560851631497, 0.12728120214937222, -0.0023835334834106012, -0.03956578180817413, -0.2159973149132615, -0.08877617907631448, 0.2979075937626599, -0.32606476696871095, -0.1123230716339865, 0.08243261909475393, -0.4256426939519785, -0.041715332180640455, 0.08434436229546949, -0.06222157265548989, 0.07666323605088234, -0.07211246923740827, 0.12413803204278445, -0.1395651720468176, -0.16778486846034588, 0.3018477142441197, -0.17569957940799275, 0.09749152519250825, 0.021260550273266638, 0.08988819865241521, -0.03830676162378641, 0.09571715776011411, -0.14115745958209164, -0.294730205665011, 0.014584087752894956, 0.19129855925810693, 0.10083095753423364, 0.29334365563877557, -0.36894818144392666, -0.09940626025219622, 0.2715132492357644, 0.18083289010456163, -0.18122759260931762, 0.054632155649892794, -0.34143237490206957, 0.1019536001386784, -0.0493832311703492, -0.12733416461634403, -0.07047683397757869, 0.17066679101228177, 0.05616756258295628, -0.4835011982437918, 0.12362836240948635, 0.13370922352463574, 0.06153994345627094, -0.018421928116151967, -0.2595771049796525, -0.061481576852926635, -0.016857702817799428, -0.014273490299474669, 0.2760254309978336, 0.030534516431991073, -0.09184218783294625, -0.010945052782594526, 0.349953459054863, -0.13458266855272763, -0.25041620938060016, -0.0234657134091229, -0.24685253918277478, -0.16503086428639432, 0.016230879789534008, 0.12860724760093173, 0.2037898699508317, -0.04292913116672534, 0.3600577724756184, -0.04166822519816332, 0.12630776121178483, 0.1169161415852259, 0.018974889395363882, -0.041488484762632685, 0.07506937361608448, 0.12710925171564144, 0.004923317760169423, 0.011101234560216762, 0.0012041728714701988, -0.47010586351566647, -0.169767260934242, -0.08677516044985692, 0.23511873953581108, -0.13361546186058412, -0.09489086762433714, 0.2463278650538996, 0.008575887378833998, 0.20285512842198486, 0.10178015371034774, 0.13723163308291617, 0.1447670789173078, -0.012463759415846128, 0.11565956136042063, 0.05406177920581363, 0.19815116014402612, 0.11671372158827766, -0.24475489568455594, -0.017558184933801322, 0.1614163363099856] |
1,802.05168 | The relativistic chiral Lagrangian for decuplet and octet baryons at
next-to-leading order | A complete and minimal relativistic Lagrangian is constructed at
next-to-leading order for SU(3) chiral perturbation theory in the presence of
baryon octet and baryon decuplet states. The Lagrangian has 13 terms for the
pure decuplet sector, 6 terms for the transition sector from baryon octet to
decuplet and (as already known from the literature) 16 terms for the pure octet
sector. The minimal field content of 25 of these terms is meson-baryon
four-point interactions. 3 terms give rise to the mass splitting for baryon
octet and decuplet states, respectively. 2 terms give rise to overall mass
shifts. 4 terms provide anomalous magnetic moments and a decuplet-to-octet
magnetic transition moment. 1 term leads to an axial vector transition moment.
It is shown that meson-baryon three-point coupling constants come in at leading
order whereas no additional one appears in the minimal Lagrangian at
next-to-leading order. Those low-energy constants that give rise to mass
splitting and magnetic moments, respectively, are determined. Predictions are
provided for radiative decays of decuplet to octet baryons.
| hep-ph nucl-th | a complete and minimal relativistic lagrangian is constructed at nexttoleading order for su3 chiral perturbation theory in the presence of baryon octet and baryon decuplet states the lagrangian has 13 terms for the pure decuplet sector 6 terms for the transition sector from baryon octet to decuplet and as already known from the literature 16 terms for the pure octet sector the minimal field content of 25 of these terms is mesonbaryon fourpoint interactions 3 terms give rise to the mass splitting for baryon octet and decuplet states respectively 2 terms give rise to overall mass shifts 4 terms provide anomalous magnetic moments and a decuplettooctet magnetic transition moment 1 term leads to an axial vector transition moment it is shown that mesonbaryon threepoint coupling constants come in at leading order whereas no additional one appears in the minimal lagrangian at nexttoleading order those lowenergy constants that give rise to mass splitting and magnetic moments respectively are determined predictions are provided for radiative decays of decuplet to octet baryons | [['a', 'complete', 'and', 'minimal', 'relativistic', 'lagrangian', 'is', 'constructed', 'at', 'nexttoleading', 'order', 'for', 'su3', 'chiral', 'perturbation', 'theory', 'in', 'the', 'presence', 'of', 'baryon', 'octet', 'and', 'baryon', 'decuplet', 'states', 'the', 'lagrangian', 'has', '13', 'terms', 'for', 'the', 'pure', 'decuplet', 'sector', '6', 'terms', 'for', 'the', 'transition', 'sector', 'from', 'baryon', 'octet', 'to', 'decuplet', 'and', 'as', 'already', 'known', 'from', 'the', 'literature', '16', 'terms', 'for', 'the', 'pure', 'octet', 'sector', 'the', 'minimal', 'field', 'content', 'of', '25', 'of', 'these', 'terms', 'is', 'mesonbaryon', 'fourpoint', 'interactions', '3', 'terms', 'give', 'rise', 'to', 'the', 'mass', 'splitting', 'for', 'baryon', 'octet', 'and', 'decuplet', 'states', 'respectively', '2', 'terms', 'give', 'rise', 'to', 'overall', 'mass', 'shifts', '4', 'terms', 'provide', 'anomalous', 'magnetic', 'moments', 'and', 'a', 'decuplettooctet', 'magnetic', 'transition', 'moment', '1', 'term', 'leads', 'to', 'an', 'axial', 'vector', 'transition', 'moment', 'it', 'is', 'shown', 'that', 'mesonbaryon', 'threepoint', 'coupling', 'constants', 'come', 'in', 'at', 'leading', 'order', 'whereas', 'no', 'additional', 'one', 'appears', 'in', 'the', 'minimal', 'lagrangian', 'at', 'nexttoleading', 'order', 'those', 'lowenergy', 'constants', 'that', 'give', 'rise', 'to', 'mass', 'splitting', 'and', 'magnetic', 'moments', 'respectively', 'are', 'determined', 'predictions', 'are', 'provided', 'for', 'radiative', 'decays', 'of', 'decuplet', 'to', 'octet', 'baryons']] | [-0.1224185697425301, 0.2583284353030259, 0.016500329139706168, 0.15887718279554974, -0.08175424444267437, -0.05382513509885896, 0.023924652039394936, 0.29310582166570903, -0.13585467761315936, -0.3302193171721661, -0.022660240397228682, -0.34266825634542675, -0.016396119109621004, 0.033373065682272204, 0.12077081996193599, -0.004407973527642233, -0.025476674757166102, 0.11192259814058725, -0.07195952275235738, -0.24385662821614892, 0.32549215044404955, -0.059680069207734915, 0.20942781302853422, 0.1501711585608843, 0.041322259831109216, -0.021596538180823528, 0.03008264356980189, -0.06357734684466518, -0.12180050568687355, 0.06672482865715643, 0.20942986883511322, -0.010918047224593119, 0.09215777174990979, -0.3834618024328457, -0.11547829393003624, 0.10906633174731507, 0.17558886423718095, 0.19236199609890936, -0.04162986149700979, -0.28367470865972183, 0.11591687616670415, -0.21151564183777996, -0.178419577814306, -0.21047311913406747, 0.004911333561592203, -0.09045074069927934, -0.3599164172552437, 0.14914297615316519, -0.03063905360786954, 0.07649925717712558, -0.0503325673940015, -0.2531470005134387, -0.08315411231680107, 0.08236255842382975, 0.12107821080939002, 0.1336225504194209, 0.09479776887954879, -0.17144955022862027, -0.1430171600160455, 0.44411684337648605, -0.08154714750500196, -0.15113485651419892, 0.07230311433418787, -0.14343252517781885, -0.1407985907557997, 0.16498872626661545, 0.1473929798119657, 0.029895823585753704, -0.18290250934660435, 0.1283416260717093, 0.01830730126849154, 0.15613639762644502, 0.09396553655997628, 0.11837357655098285, 0.1984565250043358, 0.06385131045715839, 0.014154516387775186, 0.05956765274528325, -0.01987225028209477, -0.105809146039454, -0.39843396751564886, -0.06624355852892179, -0.10756154313345351, 0.05330156319264677, -0.1202098986771792, -0.13048082710173775, 0.40420311300217043, 0.04242049870524733, 0.1886947299021163, 0.055320930354008896, 0.27459490849980195, 0.12463524627396726, 0.10580788934159846, 0.06877826685584816, 0.2965649185685574, 0.2924094354123857, 0.10337336804617994, -0.27889177630069234, -0.049985451474120576, 0.119056789650737] |
1,802.05169 | Internet Location Verification: Challenges and Solutions | This thesis addresses the problem of verifying the geographic locations of
Internet clients. First, we demonstrate how current state-of-the-art
delay-based geolocation techniques are susceptible to evasion through delay
manipulations, which involve both increasing and decreasing the Internet delays
that are observed between a client and a remote measuring party. We then
propose Client Presence Verification (CPV) as a delay-based technique to verify
an assertion about a client's physical presence in a prescribed geographic
region. Three verifiers geographically encapsulating a client's asserted
location are used to corroborate that assertion by measuring the delays between
themselves and the client. CPV infers geographic distances from these delays
and thus, using the smaller of the forward and reverse one-way delay between
each verifier and the client is expected to result in a more accurate distance
inference than using the conventional round-trip times. Accordingly, we devise
a novel protocol for accurate one-way delay measurements between the client and
the three verifiers to be used by CPV, taking into account that the client
could manipulate the measurements to defeat the verification process. We
evaluate CPV through extensive real-world experiments with legitimate clients
(those truly present at where they asserted to be) modeled to use both wired
and wireless access networks. Wired evaluation is done using the PlanetLab
testbed, during which we examine various factors affecting CPV's efficacy, such
as the client's geographical nearness to the verifiers. For wireless
evaluation, we leverage the Internet delay information collected for wired
clients from PlanetLab, and model additional delays representing the last-mile
wireless link. Finally, we reinforce CPV against a (hypothetical) middlebox
that an adversary specifically customizes to defeat CPV.
| cs.CR cs.ET cs.NI | this thesis addresses the problem of verifying the geographic locations of internet clients first we demonstrate how current stateoftheart delaybased geolocation techniques are susceptible to evasion through delay manipulations which involve both increasing and decreasing the internet delays that are observed between a client and a remote measuring party we then propose client presence verification cpv as a delaybased technique to verify an assertion about a clients physical presence in a prescribed geographic region three verifiers geographically encapsulating a clients asserted location are used to corroborate that assertion by measuring the delays between themselves and the client cpv infers geographic distances from these delays and thus using the smaller of the forward and reverse oneway delay between each verifier and the client is expected to result in a more accurate distance inference than using the conventional roundtrip times accordingly we devise a novel protocol for accurate oneway delay measurements between the client and the three verifiers to be used by cpv taking into account that the client could manipulate the measurements to defeat the verification process we evaluate cpv through extensive realworld experiments with legitimate clients those truly present at where they asserted to be modeled to use both wired and wireless access networks wired evaluation is done using the planetlab testbed during which we examine various factors affecting cpvs efficacy such as the clients geographical nearness to the verifiers for wireless evaluation we leverage the internet delay information collected for wired clients from planetlab and model additional delays representing the lastmile wireless link finally we reinforce cpv against a hypothetical middlebox that an adversary specifically customizes to defeat cpv | [['this', 'thesis', 'addresses', 'the', 'problem', 'of', 'verifying', 'the', 'geographic', 'locations', 'of', 'internet', 'clients', 'first', 'we', 'demonstrate', 'how', 'current', 'stateoftheart', 'delaybased', 'geolocation', 'techniques', 'are', 'susceptible', 'to', 'evasion', 'through', 'delay', 'manipulations', 'which', 'involve', 'both', 'increasing', 'and', 'decreasing', 'the', 'internet', 'delays', 'that', 'are', 'observed', 'between', 'a', 'client', 'and', 'a', 'remote', 'measuring', 'party', 'we', 'then', 'propose', 'client', 'presence', 'verification', 'cpv', 'as', 'a', 'delaybased', 'technique', 'to', 'verify', 'an', 'assertion', 'about', 'a', 'clients', 'physical', 'presence', 'in', 'a', 'prescribed', 'geographic', 'region', 'three', 'verifiers', 'geographically', 'encapsulating', 'a', 'clients', 'asserted', 'location', 'are', 'used', 'to', 'corroborate', 'that', 'assertion', 'by', 'measuring', 'the', 'delays', 'between', 'themselves', 'and', 'the', 'client', 'cpv', 'infers', 'geographic', 'distances', 'from', 'these', 'delays', 'and', 'thus', 'using', 'the', 'smaller', 'of', 'the', 'forward', 'and', 'reverse', 'oneway', 'delay', 'between', 'each', 'verifier', 'and', 'the', 'client', 'is', 'expected', 'to', 'result', 'in', 'a', 'more', 'accurate', 'distance', 'inference', 'than', 'using', 'the', 'conventional', 'roundtrip', 'times', 'accordingly', 'we', 'devise', 'a', 'novel', 'protocol', 'for', 'accurate', 'oneway', 'delay', 'measurements', 'between', 'the', 'client', 'and', 'the', 'three', 'verifiers', 'to', 'be', 'used', 'by', 'cpv', 'taking', 'into', 'account', 'that', 'the', 'client', 'could', 'manipulate', 'the', 'measurements', 'to', 'defeat', 'the', 'verification', 'process', 'we', 'evaluate', 'cpv', 'through', 'extensive', 'realworld', 'experiments', 'with', 'legitimate', 'clients', 'those', 'truly', 'present', 'at', 'where', 'they', 'asserted', 'to', 'be', 'modeled', 'to', 'use', 'both', 'wired', 'and', 'wireless', 'access', 'networks', 'wired', 'evaluation', 'is', 'done', 'using', 'the', 'planetlab', 'testbed', 'during', 'which', 'we', 'examine', 'various', 'factors', 'affecting', 'cpvs', 'efficacy', 'such', 'as', 'the', 'clients', 'geographical', 'nearness', 'to', 'the', 'verifiers', 'for', 'wireless', 'evaluation', 'we', 'leverage', 'the', 'internet', 'delay', 'information', 'collected', 'for', 'wired', 'clients', 'from', 'planetlab', 'and', 'model', 'additional', 'delays', 'representing', 'the', 'lastmile', 'wireless', 'link', 'finally', 'we', 'reinforce', 'cpv', 'against', 'a', 'hypothetical', 'middlebox', 'that', 'an', 'adversary', 'specifically', 'customizes', 'to', 'defeat', 'cpv']] | [-0.1912259939987884, 0.03891508849469692, -0.0345065976271482, 0.05815541214848784, -0.10079550422160266, -0.25524268441463105, 0.1666573368135812, 0.39040720856101097, -0.2764952702371604, -0.33302792937574444, 0.10088936060746667, -0.2947971042709557, -0.1315519412820224, 0.1916512731145929, -0.10587667015852445, 0.07813826392207392, 0.04810986827607146, -0.01085895518330878, -0.008394090750600474, -0.26145757337145814, 0.2780435424943742, 0.039110506233866554, 0.302147444683823, 0.09082878416760731, 0.05283526177293029, 0.02744650637482816, -0.06753527224797419, 0.0012703575739173088, -0.0751279354590765, 0.08996329085856371, 0.311135155719196, 0.21681131540233317, 0.2867204730769405, -0.46798946693899685, -0.18162849589751265, 0.1272701906632341, 0.1251029128426873, 0.08647832660035656, -0.03310619916864904, -0.39589157346012865, 0.12042760673121006, -0.22047872432909185, -0.04802557384356385, -0.03904443398138792, -0.026361076594036085, 0.013373999544817498, -0.27597620179201565, -0.018845973132164337, -0.05997189889977025, 0.039567491363346245, 0.015653931052375544, -0.009135032137578915, -0.0005284344702162762, 0.24453582785345032, 0.02918697933726563, -0.017790147243045985, 0.1588800901271832, -0.091878365695607, -0.16581832610640232, 0.35971188932297177, -0.002318903630338419, -0.14765991602736944, 0.17991193501472638, -0.03265010159104356, -0.11319089098054515, 0.057884917316653635, 0.21852692788930742, 0.06213021038107048, -0.180185804728654, -0.020682126077863155, -0.031053452735219745, 0.20754489648678656, 0.09412387834401406, 0.06952075898339176, 0.18426262217722694, 0.17495787895516557, 0.10231915993103584, 0.10719440170203692, -0.0842466650251126, -0.10037970062099452, -0.2432664941817169, -0.16511596557344518, -0.18575599074162902, 0.0086078631949566, -0.09678899997893546, -0.0779774016094806, 0.352927953735354, 0.23451772682908853, 0.15015064777986434, 0.08986206521924073, 0.41818235851270336, 0.029907137875663303, 0.08816469046650766, 0.13662621033028266, 0.1962015440736873, 0.02381335256567578, 0.16637277963733973, -0.18646676160981981, 0.17686493254221672, -0.011011961992954676] |
1,802.0517 | Molecular Computing for Markov Chains | In this paper, it is presented a methodology for implementing arbitrarily
constructed time-homogenous Markov chains with biochemical systems. Not only
discrete but also continuous-time Markov chains are allowed to be computed. By
employing chemical reaction networks (CRNs) as a programmable language,
molecular concentrations serve to denote both input and output values. One
reaction network is elaborately designed for each chain. The evolution of
species' concentrations over time well matches the transient solutions of the
target continuous-time Markov chain, while equilibrium concentrations can
indicate the steady state probabilities. Additionally, second-order Markov
chains are considered for implementation, with bimolecular reactions rather
that unary ones. An original scheme is put forward to compile unimolecular
systems to DNA strand displacement reactions for the sake of future physical
implementations. Deterministic, stochastic and DNA simulations are provided to
enhance correctness, validity and feasibility.
| q-bio.MN cs.CC cs.CE cs.ET | in this paper it is presented a methodology for implementing arbitrarily constructed timehomogenous markov chains with biochemical systems not only discrete but also continuoustime markov chains are allowed to be computed by employing chemical reaction networks crns as a programmable language molecular concentrations serve to denote both input and output values one reaction network is elaborately designed for each chain the evolution of species concentrations over time well matches the transient solutions of the target continuoustime markov chain while equilibrium concentrations can indicate the steady state probabilities additionally secondorder markov chains are considered for implementation with bimolecular reactions rather that unary ones an original scheme is put forward to compile unimolecular systems to dna strand displacement reactions for the sake of future physical implementations deterministic stochastic and dna simulations are provided to enhance correctness validity and feasibility | [['in', 'this', 'paper', 'it', 'is', 'presented', 'a', 'methodology', 'for', 'implementing', 'arbitrarily', 'constructed', 'timehomogenous', 'markov', 'chains', 'with', 'biochemical', 'systems', 'not', 'only', 'discrete', 'but', 'also', 'continuoustime', 'markov', 'chains', 'are', 'allowed', 'to', 'be', 'computed', 'by', 'employing', 'chemical', 'reaction', 'networks', 'crns', 'as', 'a', 'programmable', 'language', 'molecular', 'concentrations', 'serve', 'to', 'denote', 'both', 'input', 'and', 'output', 'values', 'one', 'reaction', 'network', 'is', 'elaborately', 'designed', 'for', 'each', 'chain', 'the', 'evolution', 'of', 'species', 'concentrations', 'over', 'time', 'well', 'matches', 'the', 'transient', 'solutions', 'of', 'the', 'target', 'continuoustime', 'markov', 'chain', 'while', 'equilibrium', 'concentrations', 'can', 'indicate', 'the', 'steady', 'state', 'probabilities', 'additionally', 'secondorder', 'markov', 'chains', 'are', 'considered', 'for', 'implementation', 'with', 'bimolecular', 'reactions', 'rather', 'that', 'unary', 'ones', 'an', 'original', 'scheme', 'is', 'put', 'forward', 'to', 'compile', 'unimolecular', 'systems', 'to', 'dna', 'strand', 'displacement', 'reactions', 'for', 'the', 'sake', 'of', 'future', 'physical', 'implementations', 'deterministic', 'stochastic', 'and', 'dna', 'simulations', 'are', 'provided', 'to', 'enhance', 'correctness', 'validity', 'and', 'feasibility']] | [-0.10126647862765503, 0.12682115708498615, -0.00014283037005182708, 0.07234431189114404, -0.03209259624790101, -0.22655030232888176, 0.07259110921575776, 0.43407429822033994, -0.30058815710273756, -0.23551426924948654, 0.07810934675758854, -0.2232533888415481, -0.07846339441237658, 0.1809186357902839, 0.02360321423013348, 0.10199352734083612, 0.09370668418025666, 0.007381229980909911, 0.012098890234695842, -0.22154676162019155, 0.21797398095406648, 0.10626153218607506, 0.262530534766125, 0.0014894072299510457, 0.12061838133695678, -0.011117000703829049, 0.03143193670480519, -0.02204315980342319, -0.11146664778438752, 0.07959806078018444, 0.3336353529870075, 0.12840574397875446, 0.229845731974627, -0.46501204799724755, -0.2560083750349871, 0.13545754021475512, 0.1575178117931049, 0.19954454591055912, -0.015945052438080788, -0.2881338895386914, 0.08035480591806712, -0.1782014057206765, -0.0788570702556915, -0.08991684572071, -0.0011672785362894953, 0.12373002687848111, -0.2693587674013251, 0.013419466890032695, 0.03552152507387809, 0.06552387269410936, -0.04770677385301105, -0.13775338661469463, -0.05802203926434536, 0.13615726337710354, -0.011945886150797842, -0.02709870120080487, 0.2082769623753635, -0.0332182910876267, -0.15573555610931214, 0.3357665946530382, -0.0396700751998319, -0.25598745031730974, 0.19176918157311768, -0.06591130002235218, -0.1889107596166568, 0.16922053211049115, 0.12906487802397051, 0.1126742050881042, -0.23918997786640034, 0.06680800906343413, 0.04516398290811229, 0.20375568783046663, 0.06127945390482345, 0.005289133954249377, 0.16717097312755827, 0.207426612715349, 0.037412216574596036, 0.15378685720030383, -0.020797348583591287, -0.21564895587201727, -0.24649143495671724, -0.14028731188362967, -0.16034839358724598, 0.042478588112416664, -0.047747613368985024, -0.15426489699506166, 0.3221772918198035, 0.12837268977875987, 0.1503420153907175, 0.14408202211535706, 0.2638367430857607, 0.10406731194255697, 0.0061824787012981185, 0.05109211626415053, 0.12091123708353861, 0.17146247713894577, 0.12545574053078482, -0.21410616752937994, 0.18595784002520743, 0.08144314415807272] |
1,802.05171 | Probing neutrino coupling to a light scalar with coherent neutrino
scattering | Large neutrino event numbers in future experiments measuring coherent elastic
neutrino nucleus scattering allow precision measurements of standard and new
physics. We analyze the current and prospective limits of a light scalar
particle coupling to neutrinos and quarks, using COHERENT and CONUS as
examples. Both lepton number conserving and violating interactions are
considered. It is shown that current (future) experiments can probe for scalar
masses of a few MeV couplings down to the level of $10^{-4}$ $(10^{-6})$.
Scalars with masses around the neutrino energy allow to determine their mass
via a characteristic spectrum shape distortion. Our present and future limits
are compared with constraints from supernova evolution, Big Bang
nucleosynthesis and neutrinoless double beta decay. We also outline UV-complete
underlying models that include a light scalar with coupling to quarks for both
lepton number violating and conserving coupling to neutrinos.
| hep-ph hep-ex | large neutrino event numbers in future experiments measuring coherent elastic neutrino nucleus scattering allow precision measurements of standard and new physics we analyze the current and prospective limits of a light scalar particle coupling to neutrinos and quarks using coherent and conus as examples both lepton number conserving and violating interactions are considered it is shown that current future experiments can probe for scalar masses of a few mev couplings down to the level of 104 106 scalars with masses around the neutrino energy allow to determine their mass via a characteristic spectrum shape distortion our present and future limits are compared with constraints from supernova evolution big bang nucleosynthesis and neutrinoless double beta decay we also outline uvcomplete underlying models that include a light scalar with coupling to quarks for both lepton number violating and conserving coupling to neutrinos | [['large', 'neutrino', 'event', 'numbers', 'in', 'future', 'experiments', 'measuring', 'coherent', 'elastic', 'neutrino', 'nucleus', 'scattering', 'allow', 'precision', 'measurements', 'of', 'standard', 'and', 'new', 'physics', 'we', 'analyze', 'the', 'current', 'and', 'prospective', 'limits', 'of', 'a', 'light', 'scalar', 'particle', 'coupling', 'to', 'neutrinos', 'and', 'quarks', 'using', 'coherent', 'and', 'conus', 'as', 'examples', 'both', 'lepton', 'number', 'conserving', 'and', 'violating', 'interactions', 'are', 'considered', 'it', 'is', 'shown', 'that', 'current', 'future', 'experiments', 'can', 'probe', 'for', 'scalar', 'masses', 'of', 'a', 'few', 'mev', 'couplings', 'down', 'to', 'the', 'level', 'of', '104', '106', 'scalars', 'with', 'masses', 'around', 'the', 'neutrino', 'energy', 'allow', 'to', 'determine', 'their', 'mass', 'via', 'a', 'characteristic', 'spectrum', 'shape', 'distortion', 'our', 'present', 'and', 'future', 'limits', 'are', 'compared', 'with', 'constraints', 'from', 'supernova', 'evolution', 'big', 'bang', 'nucleosynthesis', 'and', 'neutrinoless', 'double', 'beta', 'decay', 'we', 'also', 'outline', 'uvcomplete', 'underlying', 'models', 'that', 'include', 'a', 'light', 'scalar', 'with', 'coupling', 'to', 'quarks', 'for', 'both', 'lepton', 'number', 'violating', 'and', 'conserving', 'coupling', 'to', 'neutrinos']] | [-0.07832078376502198, 0.2900926103349775, 0.005070630222741914, 0.18238871896256958, -0.09674760051607986, -0.16707543657560434, 0.06119185567534129, 0.30465674463526476, -0.20599498458738838, -0.3485542065829837, 0.037592869748394674, -0.3236572698490428, -0.0012836322920130832, 0.2037392626691144, 0.09459413877838026, 0.06593764725673412, 0.0733385906454974, -0.013277496806611971, -0.0652757605072111, -0.21488944601400622, 0.28643169279343317, 0.08497263144236059, 0.19240208332692937, 0.11589265623151732, 0.06268314986955374, -0.026199273966319325, -0.041197128633835484, -0.08318595678678581, -0.1077845305901844, 0.04309098000106003, 0.17206461911308515, 0.12769331475886117, 0.09043324875778386, -0.43109673763226186, -0.1714456634679144, 0.17817068260462424, 0.1708836561139573, 0.1079640387530422, -0.12171881412422018, -0.3153183035885117, 0.05118556767078449, -0.2066292863172878, -0.12735832826167878, -0.11730965727141925, -0.03424138787335583, -0.0070355144329369065, -0.33703707234401786, 0.07539646572778501, -0.09646542364332293, -0.04207570055898811, -0.006111318619722235, -0.15832134702193018, -0.012166311754845083, 0.04376202655590272, 0.15993916195251845, -0.024984652308506026, 0.16820259279671257, -0.1643051397720618, -0.1325528556007027, 0.41931017500215345, -0.11454140683552916, -0.15604149716507112, 0.15109836177767388, -0.19284660055834268, -0.1224788456855874, 0.11626555902351227, 0.21278512792445586, 0.06040498361191047, -0.17621407288658833, 0.12524769036099315, 0.0012591931245489313, 0.1480048342075731, 0.06087598457400288, 0.08461792915960749, 0.31087645244385514, 0.22652430439234844, 0.030909652209707667, -0.03566184702129768, -0.14630823174458263, -0.04287802583005811, -0.38302687507654937, -0.1082677306441058, -0.07406510689428875, 0.10117093448227804, -0.0890665362846838, -0.07871361611739433, 0.4059561389498413, 0.14024488021553094, 0.20795984627080283, 0.03796989482029208, 0.2836633952633877, 0.05564137426720533, 0.06064667576158952, 0.026785884012601204, 0.34399483999170893, 0.20002546022380038, 0.11828583750840542, -0.24784768688509107, -0.040681774541735646, 0.017620257397980562] |
1,802.05172 | Population study of Galactic supernova remnants at very high
$\gamma$-ray energies with H.E.S.S. | Shell-type supernova remnants (SNRs) are considered prime candidates for the
acceleration of Galactic cosmic rays (CRs) up to the knee of the CR spectrum at
$\mathrm{E} \approx \mathrm{3}\times \mathrm{10}^\mathrm{15}$ eV. Our Milky Way
galaxy hosts more than 350 SNRs discovered at radio wavelengths and at high
energies, of which 220 fall into the H.E.S.S. Galactic Plane Survey (HGPS)
region. Of those, only 50 SNRs are coincident with a H.E.S.S source and in 8
cases the very high-energy (VHE) emission is firmly identified as an SNR. The
H.E.S.S. GPS provides us with a legacy for SNR population study in VHE
$\gamma$-rays and we use this rich data set to extract VHE flux upper limits
from all undetected SNRs. Overall, the derived flux upper limits are not in
contradiction with the canonical CR paradigm. Assuming this paradigm holds
true, we can constrain typical ambient density values around shell-type SNRs to
$n\leq 7~\textrm{cm}^\textrm{-3}$ and electron-to-proton energy fractions above
10~TeV to $\epsilon_\textrm{ep} \leq 5\times 10^{-3}$. Furthermore, comparisons
of VHE with radio luminosities in non-interacting SNRs reveal a behaviour that
is in agreement with the theory of magnetic field amplification at shell-type
SNRs.
| astro-ph.HE | shelltype supernova remnants snrs are considered prime candidates for the acceleration of galactic cosmic rays crs up to the knee of the cr spectrum at mathrme approx mathrm3times mathrm10mathrm15 ev our milky way galaxy hosts more than 350 snrs discovered at radio wavelengths and at high energies of which 220 fall into the hess galactic plane survey hgps region of those only 50 snrs are coincident with a hess source and in 8 cases the very highenergy vhe emission is firmly identified as an snr the hess gps provides us with a legacy for snr population study in vhe gammarays and we use this rich data set to extract vhe flux upper limits from all undetected snrs overall the derived flux upper limits are not in contradiction with the canonical cr paradigm assuming this paradigm holds true we can constrain typical ambient density values around shelltype snrs to nleq 7textrmcmtextrm3 and electrontoproton energy fractions above 10tev to epsilon_textrmep leq 5times 103 furthermore comparisons of vhe with radio luminosities in noninteracting snrs reveal a behaviour that is in agreement with the theory of magnetic field amplification at shelltype snrs | [['shelltype', 'supernova', 'remnants', 'snrs', 'are', 'considered', 'prime', 'candidates', 'for', 'the', 'acceleration', 'of', 'galactic', 'cosmic', 'rays', 'crs', 'up', 'to', 'the', 'knee', 'of', 'the', 'cr', 'spectrum', 'at', 'mathrme', 'approx', 'mathrm3times', 'mathrm10mathrm15', 'ev', 'our', 'milky', 'way', 'galaxy', 'hosts', 'more', 'than', '350', 'snrs', 'discovered', 'at', 'radio', 'wavelengths', 'and', 'at', 'high', 'energies', 'of', 'which', '220', 'fall', 'into', 'the', 'hess', 'galactic', 'plane', 'survey', 'hgps', 'region', 'of', 'those', 'only', '50', 'snrs', 'are', 'coincident', 'with', 'a', 'hess', 'source', 'and', 'in', '8', 'cases', 'the', 'very', 'highenergy', 'vhe', 'emission', 'is', 'firmly', 'identified', 'as', 'an', 'snr', 'the', 'hess', 'gps', 'provides', 'us', 'with', 'a', 'legacy', 'for', 'snr', 'population', 'study', 'in', 'vhe', 'gammarays', 'and', 'we', 'use', 'this', 'rich', 'data', 'set', 'to', 'extract', 'vhe', 'flux', 'upper', 'limits', 'from', 'all', 'undetected', 'snrs', 'overall', 'the', 'derived', 'flux', 'upper', 'limits', 'are', 'not', 'in', 'contradiction', 'with', 'the', 'canonical', 'cr', 'paradigm', 'assuming', 'this', 'paradigm', 'holds', 'true', 'we', 'can', 'constrain', 'typical', 'ambient', 'density', 'values', 'around', 'shelltype', 'snrs', 'to', 'nleq', '7textrmcmtextrm3', 'and', 'electrontoproton', 'energy', 'fractions', 'above', '10tev', 'to', 'epsilon_textrmep', 'leq', '5times', '103', 'furthermore', 'comparisons', 'of', 'vhe', 'with', 'radio', 'luminosities', 'in', 'noninteracting', 'snrs', 'reveal', 'a', 'behaviour', 'that', 'is', 'in', 'agreement', 'with', 'the', 'theory', 'of', 'magnetic', 'field', 'amplification', 'at', 'shelltype', 'snrs']] | [-0.08160145834035179, 0.12177221554291305, 0.008240604270806374, 0.17363861931042504, -0.10308021323947722, -0.10136956556791278, 0.0724353467629281, 0.43367311872767145, -0.16467474846412306, -0.3905996724092604, -0.0402996178346929, -0.3283694481436649, 0.077576856934921, 0.2502084272311312, 0.047722932960586266, -0.10809050693419324, 0.06164127143742719, -0.07817671127723651, -0.01997860386441259, -0.22975684027009582, 0.22169864466306297, 0.21079107360792873, 0.19211002168721397, 0.028730457263958196, 0.08886961028822596, -0.1599730806913652, 0.007831104401979563, -0.08479036370085455, -0.11439399712146595, 0.04885060950618936, 0.2835082088445431, 0.13792498143764376, 0.11898875975657575, -0.32899683223956305, -0.2517570738538938, 0.14146933291593325, 0.24398078463981737, -0.036121136146982244, -0.02667497128221958, -0.30177378875162936, 0.1129867632601457, -0.20197209027980495, -0.23416028884441956, 0.13904292746851948, -0.026602458300223352, 0.055126371949091146, -0.17344076204576792, 0.11842852220339094, -0.045591007288590925, 0.07592717853707576, -0.14709763849184485, -0.15331925210067193, 0.039300313900204616, 0.02164211175556335, 0.07191769651177785, 0.06786779920018846, 0.13792883372440448, -0.13311029082472922, -0.05988880339503774, 0.405685539261195, -0.010092282701051496, 0.01008684416655856, 0.24674699372996617, -0.2595061751123032, -0.2439546974435317, 0.2519121404080658, 0.12879332573072094, 0.029814419534016888, -0.19114594142782784, 0.08888779044703013, -0.022932938637930656, 0.16715629635955734, 0.06720130592293572, 0.09190282367102476, 0.2794178150614481, 0.10517207053540599, 0.0723956698284778, 0.10126270691904685, -0.28480351638838486, 0.027177044899081407, -0.2750833870687411, -0.05608480789131769, -0.16700439182813684, 0.17080764455915967, -0.14698245442116825, -0.07396987225080881, 0.31778354438163503, 0.09424258883202287, 0.18626028469525804, 0.05210463510909746, 0.2833171468177486, 0.051167837867425355, 0.012582658195321488, 0.2018465465554745, 0.36100874964714696, 0.17411324814209997, 0.1268265835242346, -0.12204352286884702, 0.02172193798975533, -0.023187401318548084] |
1,802.05173 | A Family of Software Product Lines in Educational Technologies | Rapid advances in education domain demand the design and customization of
educational technologies for a large scale and variety of evolving
requirements. Here, scale is the number of systems to be developed and variety
stems from a diversified range of instructional designs such as varied goals,
processes, content, teacher styles, learner styles and, also for eLearning
Systems for 22 Indian Languages and variants. In this paper, we present a
family of software product lines as an approach to address this challenge of
modeling a family of instructional designs as well as a family of eLearning
Systems and demonstrate it for the case of adult literacy in India (287 million
learners). We present a multi-level product line that connects product lines at
multiple levels of granularity in education domain. We then detail two concrete
product lines (http://rice.iiit.ac.in), one that generates instructional design
editors and two, which generates a family of eLearning Systems based on
flexible instructional designs. Finally, we demonstrate our approach by
generating eLearning Systems for Hindi and Telugu languages (both web and
android versions), which led to significant cost savings of 29 person months
for 9 eLearning Systems.
| cs.SE | rapid advances in education domain demand the design and customization of educational technologies for a large scale and variety of evolving requirements here scale is the number of systems to be developed and variety stems from a diversified range of instructional designs such as varied goals processes content teacher styles learner styles and also for elearning systems for 22 indian languages and variants in this paper we present a family of software product lines as an approach to address this challenge of modeling a family of instructional designs as well as a family of elearning systems and demonstrate it for the case of adult literacy in india 287 million learners we present a multilevel product line that connects product lines at multiple levels of granularity in education domain we then detail two concrete product lines httpriceiiitacin one that generates instructional design editors and two which generates a family of elearning systems based on flexible instructional designs finally we demonstrate our approach by generating elearning systems for hindi and telugu languages both web and android versions which led to significant cost savings of 29 person months for 9 elearning systems | [['rapid', 'advances', 'in', 'education', 'domain', 'demand', 'the', 'design', 'and', 'customization', 'of', 'educational', 'technologies', 'for', 'a', 'large', 'scale', 'and', 'variety', 'of', 'evolving', 'requirements', 'here', 'scale', 'is', 'the', 'number', 'of', 'systems', 'to', 'be', 'developed', 'and', 'variety', 'stems', 'from', 'a', 'diversified', 'range', 'of', 'instructional', 'designs', 'such', 'as', 'varied', 'goals', 'processes', 'content', 'teacher', 'styles', 'learner', 'styles', 'and', 'also', 'for', 'elearning', 'systems', 'for', '22', 'indian', 'languages', 'and', 'variants', 'in', 'this', 'paper', 'we', 'present', 'a', 'family', 'of', 'software', 'product', 'lines', 'as', 'an', 'approach', 'to', 'address', 'this', 'challenge', 'of', 'modeling', 'a', 'family', 'of', 'instructional', 'designs', 'as', 'well', 'as', 'a', 'family', 'of', 'elearning', 'systems', 'and', 'demonstrate', 'it', 'for', 'the', 'case', 'of', 'adult', 'literacy', 'in', 'india', '287', 'million', 'learners', 'we', 'present', 'a', 'multilevel', 'product', 'line', 'that', 'connects', 'product', 'lines', 'at', 'multiple', 'levels', 'of', 'granularity', 'in', 'education', 'domain', 'we', 'then', 'detail', 'two', 'concrete', 'product', 'lines', 'httpriceiiitacin', 'one', 'that', 'generates', 'instructional', 'design', 'editors', 'and', 'two', 'which', 'generates', 'a', 'family', 'of', 'elearning', 'systems', 'based', 'on', 'flexible', 'instructional', 'designs', 'finally', 'we', 'demonstrate', 'our', 'approach', 'by', 'generating', 'elearning', 'systems', 'for', 'hindi', 'and', 'telugu', 'languages', 'both', 'web', 'and', 'android', 'versions', 'which', 'led', 'to', 'significant', 'cost', 'savings', 'of', '29', 'person', 'months', 'for', '9', 'elearning', 'systems']] | [-0.05305947099933056, 0.06283618283906776, -0.003652945838415276, 0.03988865621710719, -0.11268566216701868, -0.13990741762056672, 0.04996877488010026, 0.42939667776227, -0.2256455105167651, -0.36522883869690337, 0.08778607789131385, -0.2714188971073815, -0.16544635576890812, 0.23255893957884932, -0.12740079165071683, 0.02174292719878611, 0.06851229940173979, -0.025399458998686106, -0.031197317885161037, -0.28260219379983564, 0.3416627365288881, 0.008313333847259402, 0.3609858958035826, 0.03206469243845537, 0.12102356685138253, -0.03199404607177096, -0.015419808109216983, -0.01937677364343058, -0.06411392740924071, 0.19214264894761737, 0.4036829649574227, 0.2522252552635061, 0.3692043964854545, -0.3581326386383759, -0.15668918451087344, 0.004116468668654167, 0.1254860909403765, 0.06907393591030052, -0.07323974899999383, -0.2936385627133801, 0.03928302058940211, -0.29346406645087336, -0.07951340058365117, -0.09010994490793482, 0.052555955011427166, -0.00690218442361112, -0.2551652161280068, -0.07436490048689487, 0.06089948380314228, 0.18448527747637064, -0.046329641899478344, -0.14938963000618277, 0.02255597430227137, 0.17305515362836776, 0.03929670767553111, -0.010230102339789035, 0.14862364801090389, -0.14932390924286906, -0.19216175583097592, 0.38055269652608015, -0.020235225382426055, -0.14802543496313905, 0.22908759545460936, -0.05561468832899456, -0.1726385458993415, 0.06648834416810324, 0.2798892951215662, 0.08678305004205969, -0.18741786579303346, 0.03872519785448386, 0.018036720845552665, 0.2080084114783892, 0.068864296950528, 0.01850259541620121, 0.21110012036595474, 0.22637351296309913, 0.030873379472978215, 0.13017928846600518, -0.010026674445413013, -0.09032888180408725, -0.22745005453464934, -0.22083647064766082, -0.1098386756963375, 0.01949112226067988, -0.05718752303801011, -0.16074381262635584, 0.40113591414349026, 0.16524323340377242, 0.09052886037530486, 0.050130989770873116, 0.2749159356786145, 6.27091525260497e-05, 0.08647185594057351, 0.07395980939535159, 0.10372045912201487, -0.013704405795713817, 0.19911744141034662, -0.11163599223573568, 0.05682487173557833, 0.008645089357357137] |
1,802.05174 | Disordered configurations of the Glauber model in two-dimensional
networks | We analyze the ordering efficiency and the structure of disordered
configurations for the zero-temperature Glauber model on Watts-Strogatz
networks obtained by rewiring 2D regular square lattices. In the small-world
regime, the dynamics fails to reach the ordered state in the thermodynamic
limit. Due to interplay of the perturbed regular topology and the energy
neutral stochastic state transitions, the stationary state consists of two
intertwined domains, manifested as multi-clustered states on the original
lattice. Moreover, for intermediate rewiring probabilities, one finds an
additional source of disorder due to the low connectivity degree, which gives
rise to small isolated droplets of spins. We also examine the ordering process
in paradigmatic two-layer networks with heterogeneous rewiring probabilities.
Comparing the cases of a multiplex network and the corresponding network with
random inter-layer connectivity, we demonstrate that the character of the final
state qualitatively depends on the type of inter-layer connections.
| cond-mat.stat-mech physics.comp-ph | we analyze the ordering efficiency and the structure of disordered configurations for the zerotemperature glauber model on wattsstrogatz networks obtained by rewiring 2d regular square lattices in the smallworld regime the dynamics fails to reach the ordered state in the thermodynamic limit due to interplay of the perturbed regular topology and the energy neutral stochastic state transitions the stationary state consists of two intertwined domains manifested as multiclustered states on the original lattice moreover for intermediate rewiring probabilities one finds an additional source of disorder due to the low connectivity degree which gives rise to small isolated droplets of spins we also examine the ordering process in paradigmatic twolayer networks with heterogeneous rewiring probabilities comparing the cases of a multiplex network and the corresponding network with random interlayer connectivity we demonstrate that the character of the final state qualitatively depends on the type of interlayer connections | [['we', 'analyze', 'the', 'ordering', 'efficiency', 'and', 'the', 'structure', 'of', 'disordered', 'configurations', 'for', 'the', 'zerotemperature', 'glauber', 'model', 'on', 'wattsstrogatz', 'networks', 'obtained', 'by', 'rewiring', '2d', 'regular', 'square', 'lattices', 'in', 'the', 'smallworld', 'regime', 'the', 'dynamics', 'fails', 'to', 'reach', 'the', 'ordered', 'state', 'in', 'the', 'thermodynamic', 'limit', 'due', 'to', 'interplay', 'of', 'the', 'perturbed', 'regular', 'topology', 'and', 'the', 'energy', 'neutral', 'stochastic', 'state', 'transitions', 'the', 'stationary', 'state', 'consists', 'of', 'two', 'intertwined', 'domains', 'manifested', 'as', 'multiclustered', 'states', 'on', 'the', 'original', 'lattice', 'moreover', 'for', 'intermediate', 'rewiring', 'probabilities', 'one', 'finds', 'an', 'additional', 'source', 'of', 'disorder', 'due', 'to', 'the', 'low', 'connectivity', 'degree', 'which', 'gives', 'rise', 'to', 'small', 'isolated', 'droplets', 'of', 'spins', 'we', 'also', 'examine', 'the', 'ordering', 'process', 'in', 'paradigmatic', 'twolayer', 'networks', 'with', 'heterogeneous', 'rewiring', 'probabilities', 'comparing', 'the', 'cases', 'of', 'a', 'multiplex', 'network', 'and', 'the', 'corresponding', 'network', 'with', 'random', 'interlayer', 'connectivity', 'we', 'demonstrate', 'that', 'the', 'character', 'of', 'the', 'final', 'state', 'qualitatively', 'depends', 'on', 'the', 'type', 'of', 'interlayer', 'connections']] | [-0.18528061513533842, 0.16572567716582554, -0.007020218267539287, 0.07371250815793072, 0.007832814940914819, -0.14393408187307827, 0.10125843277966527, 0.3628093728872195, -0.28016762137221657, -0.23611579330204285, 0.030279119171310626, -0.2866621112884724, -0.18411923652157597, 0.07967980385738846, 0.022205411247615638, 0.00838182282264102, 0.058690158028334175, 0.05308470995975132, -0.03865484635135134, -0.22583826823711828, 0.35997156292662164, 0.051786794199621025, 0.3417730900037983, 0.04380014711469276, 0.08244890258456133, 0.0292514127325139, 0.07315946628151411, 0.04963379574721878, -0.1393710400238701, 0.08035096360254101, 0.19231123744816303, 0.012420187485787049, 0.2100108082753874, -0.4563663359221122, -0.21195303026446435, 0.10049472248168943, 0.13449277770398535, 0.14633869346827652, 0.03341554010634579, -0.3297187219699207, 0.04618571606809146, -0.1593281800440259, -0.12489172455827603, -0.09461582610893944, -0.008661067261590227, 0.0595751164627759, -0.25997046575672633, 0.0941102419131075, 0.08398188686967917, 0.037833326546417884, -0.06048828364455154, -0.0873854787867159, -0.08076136162479038, 0.13990668657439928, -0.002222544648596851, -0.018654457537444588, 0.11529694384678382, -0.17521470204659112, -0.14950218170878082, 0.34115525573007255, -0.01578424711933372, -0.1630279925171037, 0.22896620409321183, -0.12355362782127237, -0.11370400378276428, 0.14017163923852247, 0.16279655356878694, 0.06479262843750391, -0.09521966992776956, 0.05181914928256796, -0.008194954450280494, 0.15987334402329098, 0.02595621872731574, 0.049663553976020076, 0.16812125814772427, 0.2191632338715813, 0.09246683619798429, 0.20567764261456795, -0.10332553883319184, -0.20557966843017772, -0.2162153223299817, -0.06946324007521855, -0.22844270947915565, 0.07971688070372768, -0.1507172344491876, -0.21335537074618552, 0.45409384556752563, 0.12435242403234827, 0.23624621787784647, 0.05026291952108046, 0.19450899830952365, 0.07502438285155222, -0.00013599013598725098, 0.05565100748965848, 0.20993049732530616, 0.1565759822292483, 0.10986539362674605, -0.24259169863645397, 0.11448580529774006, 0.06315109849594891] |
1,802.05175 | Bounds on the norm of Wigner-type random matrices | We consider a Wigner-type ensemble, i.e. large hermitian $N\times N$ random
matrices $H=H^*$ with centered independent entries and with a general matrix of
variances $S_{xy}=\mathbb E|H_{xy}|^2$. The norm of $H$ is asymptotically given
by the maximum of the support of the self-consistent density of states. We
establish a bound on this maximum in terms of norms of powers of $S$ that
substantially improves the earlier bound $2\| S\|^{1/2}_\infty$ given in
[arXiv:1506.05098]. The key element of the proof is an effective Markov chain
approximation for the contributions of the weighted Dyck paths appearing in the
iterative solution of the corresponding Dyson equation.
| math.PR | we consider a wignertype ensemble ie large hermitian ntimes n random matrices hh with centered independent entries and with a general matrix of variances s_xymathbb eh_xy2 the norm of h is asymptotically given by the maximum of the support of the selfconsistent density of states we establish a bound on this maximum in terms of norms of powers of s that substantially improves the earlier bound 2 s12_infty given in arxiv150605098 the key element of the proof is an effective markov chain approximation for the contributions of the weighted dyck paths appearing in the iterative solution of the corresponding dyson equation | [['we', 'consider', 'a', 'wignertype', 'ensemble', 'ie', 'large', 'hermitian', 'ntimes', 'n', 'random', 'matrices', 'hh', 'with', 'centered', 'independent', 'entries', 'and', 'with', 'a', 'general', 'matrix', 'of', 'variances', 's_xymathbb', 'eh_xy2', 'the', 'norm', 'of', 'h', 'is', 'asymptotically', 'given', 'by', 'the', 'maximum', 'of', 'the', 'support', 'of', 'the', 'selfconsistent', 'density', 'of', 'states', 'we', 'establish', 'a', 'bound', 'on', 'this', 'maximum', 'in', 'terms', 'of', 'norms', 'of', 'powers', 'of', 's', 'that', 'substantially', 'improves', 'the', 'earlier', 'bound', '2', 's12_infty', 'given', 'in', 'arxiv150605098', 'the', 'key', 'element', 'of', 'the', 'proof', 'is', 'an', 'effective', 'markov', 'chain', 'approximation', 'for', 'the', 'contributions', 'of', 'the', 'weighted', 'dyck', 'paths', 'appearing', 'in', 'the', 'iterative', 'solution', 'of', 'the', 'corresponding', 'dyson', 'equation']] | [-0.14056780631653965, 0.14912319287900666, -0.03845424122178252, 0.018612816973769923, 0.008095829353230645, -0.09610967155146811, 0.06912924267579706, 0.3019945151457677, -0.24495142630814593, -0.248875618517893, 0.08709100830221396, -0.2921874286198266, -0.12014709688884644, 0.10082782742719414, -0.03360188491903816, 0.07278564610347456, 0.061951595387060424, 0.09247491826132244, -0.11476749602030506, -0.2520342353203961, 0.33927214078550827, 0.04485150120145052, 0.23600522196870677, 0.0192254297055152, 0.11589668728221132, 0.05902154940627135, -0.0420826173587037, -0.025989949269628873, -0.12315166146027896, 0.17023813834459026, 0.21826580219797562, 0.12350251327311247, 0.2670376723625089, -0.3791290213715057, -0.14520251169107018, 0.1503559255791942, 0.16031153037982557, 0.06042550619197439, 0.014020210487188354, -0.24666069228468196, 0.08510392466417457, -0.140179882994948, -0.15939726752267047, 0.005242412933623608, 0.04882234656156934, 0.060333045688932954, -0.35040676170884044, 0.07653629752820386, 0.10854397382473155, 0.011706144881567784, -0.04041149375047915, -0.210302039247947, 0.052607777889589875, 0.06804844664352737, 0.010763725521261518, 0.0038250372673821996, 0.05395599347254147, -0.08260216913423596, -0.10628572215649243, 0.32749934568621064, -0.1084605589204905, -0.21524358620125877, 0.07525575010828217, -0.13711612008759105, -0.10030002258147816, 0.140675286391788, 0.13840378237394046, 0.16220343135070409, -0.10014257829028125, 0.16920667974580061, -0.11215376485333949, 0.12203450529474993, 0.05705882964313638, 0.015521604352160262, 0.102222250489404, 0.09335550225853008, 0.13214690461564732, 0.1542906893930417, -0.029620339896777, -0.11432397623584435, -0.3322288205809131, -0.17242444576861868, -0.26029650055879383, 0.08976808232160247, -0.1973918535868692, -0.22346497262942092, 0.388442785403102, 0.09675797306053195, 0.23239812959099607, 0.1143002412662062, 0.21044852000741973, 0.1704706770881098, 0.008237974209786982, 0.10755823114981913, 0.1592518923642608, 0.21404758493929188, 0.004771542027402593, -0.2098584934280311, 0.06543751962349884, 0.15834502489258517] |
1,802.05176 | Sampling Superquadric Point Clouds with Normals | Superquadrics provide a compact representation of common shapes and have been
used both for object/surface modelling in computer graphics and as object-part
representation in computer vision and robotics. Superquadrics refer to a family
of shapes: here we deal with the superellipsoids and superparaboloids. Due to
the strong non-linearities involved in the equations, uniform or
close-to-uniform sampling is not attainable through a naive approach of direct
sampling from the parametric formulation. This is specially true for more
`cubic' superquadrics (with shape parameters close to $0.1$). We extend a
previous solution of 2D close-to-uniform uniform sampling of superellipses to
the superellipsoid (3D) case and derive our own for the superparaboloid.
Additionally, we are able to provide normals for each sampled point. To the
best of our knowledge, this is the first complete approach for close-to-uniform
sampling of superellipsoids and superparaboloids in one single framework. We
present derivations, pseudocode and qualitative and quantitative results using
our code, which is available online.
| cs.CV | superquadrics provide a compact representation of common shapes and have been used both for objectsurface modelling in computer graphics and as objectpart representation in computer vision and robotics superquadrics refer to a family of shapes here we deal with the superellipsoids and superparaboloids due to the strong nonlinearities involved in the equations uniform or closetouniform sampling is not attainable through a naive approach of direct sampling from the parametric formulation this is specially true for more cubic superquadrics with shape parameters close to 01 we extend a previous solution of 2d closetouniform uniform sampling of superellipses to the superellipsoid 3d case and derive our own for the superparaboloid additionally we are able to provide normals for each sampled point to the best of our knowledge this is the first complete approach for closetouniform sampling of superellipsoids and superparaboloids in one single framework we present derivations pseudocode and qualitative and quantitative results using our code which is available online | [['superquadrics', 'provide', 'a', 'compact', 'representation', 'of', 'common', 'shapes', 'and', 'have', 'been', 'used', 'both', 'for', 'objectsurface', 'modelling', 'in', 'computer', 'graphics', 'and', 'as', 'objectpart', 'representation', 'in', 'computer', 'vision', 'and', 'robotics', 'superquadrics', 'refer', 'to', 'a', 'family', 'of', 'shapes', 'here', 'we', 'deal', 'with', 'the', 'superellipsoids', 'and', 'superparaboloids', 'due', 'to', 'the', 'strong', 'nonlinearities', 'involved', 'in', 'the', 'equations', 'uniform', 'or', 'closetouniform', 'sampling', 'is', 'not', 'attainable', 'through', 'a', 'naive', 'approach', 'of', 'direct', 'sampling', 'from', 'the', 'parametric', 'formulation', 'this', 'is', 'specially', 'true', 'for', 'more', 'cubic', 'superquadrics', 'with', 'shape', 'parameters', 'close', 'to', '01', 'we', 'extend', 'a', 'previous', 'solution', 'of', '2d', 'closetouniform', 'uniform', 'sampling', 'of', 'superellipses', 'to', 'the', 'superellipsoid', '3d', 'case', 'and', 'derive', 'our', 'own', 'for', 'the', 'superparaboloid', 'additionally', 'we', 'are', 'able', 'to', 'provide', 'normals', 'for', 'each', 'sampled', 'point', 'to', 'the', 'best', 'of', 'our', 'knowledge', 'this', 'is', 'the', 'first', 'complete', 'approach', 'for', 'closetouniform', 'sampling', 'of', 'superellipsoids', 'and', 'superparaboloids', 'in', 'one', 'single', 'framework', 'we', 'present', 'derivations', 'pseudocode', 'and', 'qualitative', 'and', 'quantitative', 'results', 'using', 'our', 'code', 'which', 'is', 'available', 'online']] | [-0.019548546196436326, 0.015686148391074798, -0.09255775469020495, 0.046231951158238103, -0.11231919600524837, -0.12393936153282137, 0.024875956604232877, 0.42602097478031725, -0.2421279250099354, -0.30466297747007287, 0.1053548081948428, -0.23264057871587332, -0.15117297638846816, 0.22249885719099077, -0.09709848818031377, 0.07495859312197936, 0.0737772150980187, 0.03167318478203835, -0.07238178258591325, -0.22506925181997026, 0.27764013615662075, 0.029691944744900552, 0.24657077471013455, 0.017799862188719262, 0.09756886169582216, 0.01974435855506682, -0.030653422275326806, 0.004886771887053851, -0.14336887600655163, 0.1736010701054695, 0.248810852961493, 0.14361458035563332, 0.2696425137475279, -0.410797096448007, -0.19870719313126947, 0.08037092438685933, 0.12382246967020073, 0.14244187019652765, -0.07819063843312, -0.26276976002069813, 0.10573819420586517, -0.14660221390620945, -0.094308068595364, -0.10852499850082144, -0.019388739623394154, 0.03627009725721638, -0.30435235520483916, 0.04072412411724917, 0.07804893147888185, 0.06519033201647545, -0.04949777636804855, -0.11148197370051753, 0.02286511371855691, 0.1477672695380094, -0.007752223036197179, 0.050094449944380254, 0.05935591190834256, -0.12486278984902634, -0.11525836514211656, 0.40535950648607505, -0.03400542690826495, -0.2439566925578915, 0.20632520332944645, -0.11816729425020467, -0.15079550827576418, 0.1128214364567029, 0.19588017896532228, 0.1471831692273126, -0.134844384679656, 0.06686941798307683, -0.04906785992747233, 0.14756744740065947, 0.03328118721415818, -0.015079122520617995, 0.16601570491721623, 0.17402266939261965, 0.04872001534833092, 0.14663105969792048, -0.08573238628618175, -0.10744663379976854, -0.2719221804534493, -0.14176881387738474, -0.18884384705764212, -0.007027176512291905, -0.07938271588657289, -0.18072059052065015, 0.37508406183983695, 0.19356028111103704, 0.18975465630905497, 0.08703591331179114, 0.31897224546744934, 0.08512894225647685, 0.05421973105057392, 0.06312549495886938, 0.2033561897948019, 0.09747080096603657, 0.07582397867310671, -0.12926251323911928, 0.03734176662245315, 0.04022193662335281] |
1,802.05177 | Solving the Boundary Layer Flow of an Eyring-Powell Non-Newtonian Fluid | In this paper, the Rational Jacobi (RJ) collocation method is proposed to
approximate the solution of the boundary layer flow of an Eyring-Powell fluid
over a stretching sheet. This equation is nonlinear and by applying
Quasilinearization method (QLM), the equation is converted into a sequence of
linear ordinary differential equations (ODE) converging to the solution of the
nonlinear equation. Unlike other methods, instead of truncation in domain, the
infinity condition is satisfied implicitly. As a result, using the proposed
method, the model is converted to a system of linear algebraic equations. The
effect of different parameters on the velocity profile is also presented.
| math.CA | in this paper the rational jacobi rj collocation method is proposed to approximate the solution of the boundary layer flow of an eyringpowell fluid over a stretching sheet this equation is nonlinear and by applying quasilinearization method qlm the equation is converted into a sequence of linear ordinary differential equations ode converging to the solution of the nonlinear equation unlike other methods instead of truncation in domain the infinity condition is satisfied implicitly as a result using the proposed method the model is converted to a system of linear algebraic equations the effect of different parameters on the velocity profile is also presented | [['in', 'this', 'paper', 'the', 'rational', 'jacobi', 'rj', 'collocation', 'method', 'is', 'proposed', 'to', 'approximate', 'the', 'solution', 'of', 'the', 'boundary', 'layer', 'flow', 'of', 'an', 'eyringpowell', 'fluid', 'over', 'a', 'stretching', 'sheet', 'this', 'equation', 'is', 'nonlinear', 'and', 'by', 'applying', 'quasilinearization', 'method', 'qlm', 'the', 'equation', 'is', 'converted', 'into', 'a', 'sequence', 'of', 'linear', 'ordinary', 'differential', 'equations', 'ode', 'converging', 'to', 'the', 'solution', 'of', 'the', 'nonlinear', 'equation', 'unlike', 'other', 'methods', 'instead', 'of', 'truncation', 'in', 'domain', 'the', 'infinity', 'condition', 'is', 'satisfied', 'implicitly', 'as', 'a', 'result', 'using', 'the', 'proposed', 'method', 'the', 'model', 'is', 'converted', 'to', 'a', 'system', 'of', 'linear', 'algebraic', 'equations', 'the', 'effect', 'of', 'different', 'parameters', 'on', 'the', 'velocity', 'profile', 'is', 'also', 'presented']] | [-0.12759922794522902, -0.003066938115807716, -0.1517059421052645, -0.005684985025950214, -0.11373778417998669, -0.13266872344355957, -0.027407542781849557, 0.2738066210466273, -0.34819213321030723, -0.2530222416070162, 0.10963441296617556, -0.2766682527521077, -0.1526971801604126, 0.1891963088487768, -0.04416955698409355, 0.10321204811357436, 0.05931516019079615, 0.0314496588213004, -0.07916128821100346, -0.2339268296765273, 0.3441099063402005, -0.007934994447757216, 0.2751850227040111, -0.02188105546120627, 0.19200973367311663, -0.06048325618372902, -0.003865729494696008, 0.027215912088970926, -0.11422591032369026, 0.09525519428665147, 0.2094393879946723, 0.08217998752461783, 0.29064547657674433, -0.4111065862371641, -0.21870011987858543, 0.040341660914504356, 0.1766992050734367, 0.10736983994423759, -0.010750002549577723, -0.26382589959265557, 0.0991509191648505, -0.14284041014787577, -0.1674643398180385, -0.025536292232573032, -0.01420123137387575, 0.043075900479201595, -0.29214372107868686, 0.11580961253967675, 0.10229953966450457, 0.01932300600638686, -0.11893214400875948, -0.07797347181978836, -0.04134771681628099, 0.02528587537908963, 0.045922914354413674, 0.030443334920039655, 0.07092600388854158, -0.11418330765731048, -0.02129040445502409, 0.37223037871915626, -0.11016866648409918, -0.3191786759770384, 0.10897763664195058, -0.05910583250863733, -0.050286768638875844, 0.15421176837373743, 0.16938410346925842, 0.19377890170789233, -0.16730935158500193, 0.11012568729689948, -0.061773217820754164, 0.16626298656303654, 0.07514205816494045, -0.10159621609594016, 0.10863196714689918, 0.15797907132746689, 0.096357427637878, 0.13526602955843212, -0.02426060257073236, -0.1329237875966903, -0.30960528925061226, -0.16160660289574927, -0.17857006036302112, 0.028957329151750196, -0.11403547592250535, -0.1923385730250647, 0.40249215880883676, 0.13286673399966722, 0.16032679024718555, 0.039899376586225686, 0.319094089572044, 0.26937267544802607, 0.029301545710540285, 0.04802091647049084, 0.19949651809007513, 0.18948150517227239, 0.11234954636836168, -0.24806534850458598, 0.03847941034473479, 0.1883528339767865] |
1,802.05178 | Similarity measures for vocal-based drum sample retrieval using deep
convolutional auto-encoders | The expressive nature of the voice provides a powerful medium for
communicating sonic ideas, motivating recent research on methods for query by
vocalisation. Meanwhile, deep learning methods have demonstrated
state-of-the-art results for matching vocal imitations to imitated sounds, yet
little is known about how well learned features represent the perceptual
similarity between vocalisations and queried sounds. In this paper, we address
this question using similarity ratings between vocal imitations and imitated
drum sounds. We use a linear mixed effect regression model to show how features
learned by convolutional auto-encoders (CAEs) perform as predictors for
perceptual similarity between sounds. Our experiments show that CAEs outperform
three baseline feature sets (spectrogram-based representations, MFCCs, and
temporal features) at predicting the subjective similarity ratings. We also
investigate how the size and shape of the encoded layer effects the predictive
power of the learned features. The results show that preservation of temporal
information is more important than spectral resolution for this application.
| cs.MM cs.SD eess.AS | the expressive nature of the voice provides a powerful medium for communicating sonic ideas motivating recent research on methods for query by vocalisation meanwhile deep learning methods have demonstrated stateoftheart results for matching vocal imitations to imitated sounds yet little is known about how well learned features represent the perceptual similarity between vocalisations and queried sounds in this paper we address this question using similarity ratings between vocal imitations and imitated drum sounds we use a linear mixed effect regression model to show how features learned by convolutional autoencoders caes perform as predictors for perceptual similarity between sounds our experiments show that caes outperform three baseline feature sets spectrogrambased representations mfccs and temporal features at predicting the subjective similarity ratings we also investigate how the size and shape of the encoded layer effects the predictive power of the learned features the results show that preservation of temporal information is more important than spectral resolution for this application | [['the', 'expressive', 'nature', 'of', 'the', 'voice', 'provides', 'a', 'powerful', 'medium', 'for', 'communicating', 'sonic', 'ideas', 'motivating', 'recent', 'research', 'on', 'methods', 'for', 'query', 'by', 'vocalisation', 'meanwhile', 'deep', 'learning', 'methods', 'have', 'demonstrated', 'stateoftheart', 'results', 'for', 'matching', 'vocal', 'imitations', 'to', 'imitated', 'sounds', 'yet', 'little', 'is', 'known', 'about', 'how', 'well', 'learned', 'features', 'represent', 'the', 'perceptual', 'similarity', 'between', 'vocalisations', 'and', 'queried', 'sounds', 'in', 'this', 'paper', 'we', 'address', 'this', 'question', 'using', 'similarity', 'ratings', 'between', 'vocal', 'imitations', 'and', 'imitated', 'drum', 'sounds', 'we', 'use', 'a', 'linear', 'mixed', 'effect', 'regression', 'model', 'to', 'show', 'how', 'features', 'learned', 'by', 'convolutional', 'autoencoders', 'caes', 'perform', 'as', 'predictors', 'for', 'perceptual', 'similarity', 'between', 'sounds', 'our', 'experiments', 'show', 'that', 'caes', 'outperform', 'three', 'baseline', 'feature', 'sets', 'spectrogrambased', 'representations', 'mfccs', 'and', 'temporal', 'features', 'at', 'predicting', 'the', 'subjective', 'similarity', 'ratings', 'we', 'also', 'investigate', 'how', 'the', 'size', 'and', 'shape', 'of', 'the', 'encoded', 'layer', 'effects', 'the', 'predictive', 'power', 'of', 'the', 'learned', 'features', 'the', 'results', 'show', 'that', 'preservation', 'of', 'temporal', 'information', 'is', 'more', 'important', 'than', 'spectral', 'resolution', 'for', 'this', 'application']] | [0.013257593894525651, 0.021778127958606574, -0.09660857577513826, 0.13352303466371077, -0.1337972489322067, -0.17546028578446313, 0.0029420594448983004, 0.47489700466394424, -0.28816930465637497, -0.3236511939525557, 0.03278336798815593, -0.3258244268252117, -0.2503393776180923, 0.18033003861493888, -0.12486038768106396, 0.0803101788197828, 0.11223803425302646, 0.06415239569381069, -0.07135299004905021, -0.23970251803280443, 0.30324145399366215, 0.07098829127187473, 0.34242603187538256, 0.013244159926013773, 0.15010651334776146, -0.04459931707057129, -0.07231203675089155, -0.018855038781169873, -0.06402173936398549, 0.18175931863937597, 0.34569747053579114, 0.2242574028516556, 0.3315585990700349, -0.3920709089061637, -0.25558129685210174, 0.05729337089478519, 0.1185550914200877, 0.06275446716529928, -0.01621332500624147, -0.35744928165967726, 0.07303977556597845, -0.1438454107353968, 0.02912347813012304, -0.15063314757956442, -0.012974602914753424, -0.01801217675422597, -0.24798660721202756, 0.06403121123202353, 0.10857387611740357, 0.10707826262850101, -0.026177594886060543, -0.10687528396986283, 0.021491497829200547, 0.19717383754860823, 0.05588012264157604, -0.001836565552297149, 0.145338330073816, -0.18520715633877347, -0.15212770716945648, 0.3568186837123932, -0.06763935242499637, -0.22137124823246174, 0.18592563363023482, -0.03965201582996898, -0.11851895835315868, 0.05158387573590134, 0.2288705429898658, 0.07398782504402149, -0.12336793847109197, -0.06320201077166304, -0.07209807207843491, 0.25123424759463875, 0.11314512681732085, 0.04289437119350739, 0.1853822742063837, 0.2298936503613071, -0.041520562323972963, 0.1320746871880048, -0.08619178854712066, -5.7903790229539964e-05, -0.17543858897747697, -0.060597168109646646, -0.16811969630853243, -0.06085170170434626, -0.10651990463089636, -0.12292090541190782, 0.42597421082211245, 0.23726268943138185, 0.2141248426388261, 0.12468428206244472, 0.3540035500873331, 0.002137530968779591, 0.07608515379511437, 0.07557109355701098, 0.18625390885700324, 0.027227510066382635, 0.1301200422221071, -0.1941635283213487, 0.12772589939524817, 0.06406313061838745] |
1,802.05179 | Non-modal stability analysis of stratified two-phase channel flows | The non-modal transient growth of perturbations in horizontal and inclined
channel flows of two immiscible fluids is studied. 3D perturbations are
examined in order to find the optimal perturbations that attain the maximum
amplification of perturbation energy at relatively short times. Definition of
the energy norm is extended to account for the gravitational potential energy
along with the kinetic energy and interfacial capillary energy. Contrarily to
the fastest exponential growth, which is reached by essentially 2D
perturbations, the maximal non-modal energy growth is attained mostly by
three-dimensional spanwise perturbations. Significant transient energy growth
is found to occur in linearly stable flow configurations, which, similarly to
single phase shear flows, may trigger non-linear destabilizing mechanisms
within one of the phases. It is shown that the transient energy growth in
linearly stable cases can be accompanied by noticeable interface deformations.
Therefore, flow pattern transition due to non-modal transient growth and
reduction of the range of operational conditions for which stratified-smooth
flow remains stable cannot be ruled out.
| physics.flu-dyn | the nonmodal transient growth of perturbations in horizontal and inclined channel flows of two immiscible fluids is studied 3d perturbations are examined in order to find the optimal perturbations that attain the maximum amplification of perturbation energy at relatively short times definition of the energy norm is extended to account for the gravitational potential energy along with the kinetic energy and interfacial capillary energy contrarily to the fastest exponential growth which is reached by essentially 2d perturbations the maximal nonmodal energy growth is attained mostly by threedimensional spanwise perturbations significant transient energy growth is found to occur in linearly stable flow configurations which similarly to single phase shear flows may trigger nonlinear destabilizing mechanisms within one of the phases it is shown that the transient energy growth in linearly stable cases can be accompanied by noticeable interface deformations therefore flow pattern transition due to nonmodal transient growth and reduction of the range of operational conditions for which stratifiedsmooth flow remains stable cannot be ruled out | [['the', 'nonmodal', 'transient', 'growth', 'of', 'perturbations', 'in', 'horizontal', 'and', 'inclined', 'channel', 'flows', 'of', 'two', 'immiscible', 'fluids', 'is', 'studied', '3d', 'perturbations', 'are', 'examined', 'in', 'order', 'to', 'find', 'the', 'optimal', 'perturbations', 'that', 'attain', 'the', 'maximum', 'amplification', 'of', 'perturbation', 'energy', 'at', 'relatively', 'short', 'times', 'definition', 'of', 'the', 'energy', 'norm', 'is', 'extended', 'to', 'account', 'for', 'the', 'gravitational', 'potential', 'energy', 'along', 'with', 'the', 'kinetic', 'energy', 'and', 'interfacial', 'capillary', 'energy', 'contrarily', 'to', 'the', 'fastest', 'exponential', 'growth', 'which', 'is', 'reached', 'by', 'essentially', '2d', 'perturbations', 'the', 'maximal', 'nonmodal', 'energy', 'growth', 'is', 'attained', 'mostly', 'by', 'threedimensional', 'spanwise', 'perturbations', 'significant', 'transient', 'energy', 'growth', 'is', 'found', 'to', 'occur', 'in', 'linearly', 'stable', 'flow', 'configurations', 'which', 'similarly', 'to', 'single', 'phase', 'shear', 'flows', 'may', 'trigger', 'nonlinear', 'destabilizing', 'mechanisms', 'within', 'one', 'of', 'the', 'phases', 'it', 'is', 'shown', 'that', 'the', 'transient', 'energy', 'growth', 'in', 'linearly', 'stable', 'cases', 'can', 'be', 'accompanied', 'by', 'noticeable', 'interface', 'deformations', 'therefore', 'flow', 'pattern', 'transition', 'due', 'to', 'nonmodal', 'transient', 'growth', 'and', 'reduction', 'of', 'the', 'range', 'of', 'operational', 'conditions', 'for', 'which', 'stratifiedsmooth', 'flow', 'remains', 'stable', 'can', 'not', 'be', 'ruled', 'out']] | [-0.19953323355300845, 0.22021449248149363, -0.0884761660226904, 0.06977040702982032, -0.021968157713705427, -0.11453616150082593, -0.04605801592031157, 0.318135152015476, -0.3140931725081236, -0.27283522925418185, 0.14611065046807767, -0.2196172784105033, -0.10395003516081137, 0.18902054562581233, -0.011027770668144775, 0.05995695890174303, 0.03892502609671217, -0.008370906782213104, -0.0149674073748111, -0.21586453371277325, 0.2830581312146352, 0.09925677684270384, 0.3230604527585478, 0.044796122254520454, 0.05472183477200837, -0.07159012272471495, 0.008783650771063944, 0.07029370255481425, -0.19279937989806759, 0.0252937600241009, 0.236699483465282, 0.0017270188924508642, 0.23389785505651708, -0.451574941176966, -0.256566217904125, 0.10208962030893932, 0.14315673604773088, 0.12888756914257846, -0.042568446205738165, -0.1926691634075559, 0.10592826685576465, -0.13233142047952187, -0.146895434168807, -0.05501143137941204, 0.05325791705399752, 0.03797883157694084, -0.2671255800081978, 0.16144630315724806, 0.07260973862490157, 0.0033448185443496667, -0.10405078391454754, 0.0012735807959618698, -0.12334445779526, 0.04608433998851891, 0.1182948520886768, 0.01757752091388207, 0.17188773477163885, -0.1342238214551415, -0.038917530342061295, 0.3728305332317769, -0.06356630912008528, -0.15786186592507523, 0.21283978608497195, -0.1671795285046865, -0.04614686892025666, 0.2545517440436475, 0.18910414480298465, 0.08057476465410766, -0.10852729963666075, 0.030614568183201376, 0.05803892928517861, 0.16959861924602504, 0.1366847150311076, -0.0099739881249212, 0.21668970180361205, 0.16121591357598417, 0.12626357543273795, 0.1308157362719908, -0.063401183154131, -0.13559754340101526, -0.27293809421966414, -0.08366946057705434, -0.14490398053950854, 0.05165817810326649, -0.08116952534907018, -0.18318609716086676, 0.40279298480487913, 0.05811321710801616, 0.14644999552380675, 0.00015288564665467445, 0.25894929129484456, 0.13451222322547404, 0.07257087890294392, 0.12146363443783899, 0.33736315683787127, 0.1332156543650788, 0.12399083661358713, -0.249813382839223, 0.08422326776535666, 0.03985053168452648] |
1,802.0518 | The twelfth moment of Dirichlet $L$-functions with smooth moduli | We prove an analogue of Heath-Brown's bound on the twelfth moment of the
Riemann zeta function for Dirichlet L-functions with smooth moduli.
| math.NT | we prove an analogue of heathbrowns bound on the twelfth moment of the riemann zeta function for dirichlet lfunctions with smooth moduli | [['we', 'prove', 'an', 'analogue', 'of', 'heathbrowns', 'bound', 'on', 'the', 'twelfth', 'moment', 'of', 'the', 'riemann', 'zeta', 'function', 'for', 'dirichlet', 'lfunctions', 'with', 'smooth', 'moduli']] | [-0.2589558511125771, -0.01347975159230621, -0.19508709843185815, 0.13020665655759248, -0.12961440524933013, -0.02459628846157681, -0.008525372215610167, 0.1798288148235191, -0.28339355337348854, -0.1995995515872809, 0.09274809195829387, -0.24390031939203088, -0.12226123904640024, 0.2630202736366879, -0.08249665856022727, 0.09985313481989909, -0.014669315751895985, 0.11647760657466609, -0.12983009396967563, -0.36164283456111496, 0.4829269525679675, -0.057759778828106144, 0.20750644269653343, 0.1557590069079941, 0.08800884361632845, 0.03911899740342051, 0.07893623961982402, -0.19611196931112895, -0.18601987477053294, 0.17766932685944167, 0.23187438313933936, -0.036990235077114034, 0.21597511659968982, -0.41335301981730893, -0.1278302943418649, 0.1989794086918912, 0.06168474561788819, -0.09307828258765354, 0.046658586969980126, -0.2763255373998122, 0.07619323657656257, -0.09898508018390699, -0.25441143390807236, -0.061011190235149115, 0.022621329281140457, 0.09870679414598271, -0.31505838222801685, 0.1120778679085726, 0.053271029737185345, 0.14980441496961497, -0.23529571908610789, -0.2897613893517039, 0.029053025624968788, -0.04493940943344073, 0.115717395208776, 0.11490950949320738, -0.019570719260214406, -0.15947032933102243, -0.03160117845982313, 0.22596828114580025, -0.1447976392016492, -0.23449861474165862, 0.024079976476390253, -0.18446214725686746, -0.20141901554201136, 0.05701090084304186, 0.12853787225586447, 0.24244996092536233, 0.03525957956232808, 0.20223414389924568, -0.13237804623151367, 0.12165666198019277, 0.17356527960774573, -0.1456388756632805, 0.21143862757493148, 0.03314940686422316, 0.1355580541051247, 0.24921636448495768, -0.09054292174352502, -0.05352656458589164, -0.4115386720408093, -0.28336702349902637, -0.24288473244417796, 0.20659153806892308, -0.1675647661640224, -0.3176473541693254, 0.3258077349852432, 0.031147543721917, 0.1879284524951469, 0.26139159267768264, 0.16966294327920134, 0.19350006120194765, 0.02081281839954582, 0.014922708018936894, 0.08822299489243464, 0.22360692779660563, -0.052484619240699845, -0.1469062066700479, 0.004238377536901019, 0.3216327946971763] |
1,802.05181 | Localized modes in the Gross-Pitaevskii equation with a parabolic
trapping potential and a nonlinear lattice pseudopotential | We study localized modes (LMs) of the one-dimensional
Gross-Pitaevskii/nonlinear Schr\"{o}dinger equation with a harmonic-oscillator
(parabolic) confining potential, and a periodically modulated coefficient in
front of the cubic term (nonlinear lattice pseudopotential). The equation
applies to a cigar-shaped Bose-Einstein condensate loaded in the combination of
a magnetic trap and an optical lattice which induces the periodic
pseudopotential via the Feshbach resonance. Families of stable LMs in the model
feature specific properties which result from the interplay between spatial
scales introduced by the parabolic trap and the period of the nonlinear
pseudopotential. Asymptotic results on the shapes and stability of LMs are
obtained for small-amplitude solutions and in the limit of a rapidly
oscillating nonlinear pseudopotential. We show that the presence of the lattice
pseudopotential may result in: (i) creation of new LM families which have no
counterparts in the case of the uniform nonlinearity; (ii) stabilization of
some previously unstable LM species; (iii) evolution of unstable LMs into a
pulsating mode trapped in one well of the lattice pseudopotential.
| nlin.PS cond-mat.quant-gas | we study localized modes lms of the onedimensional grosspitaevskiinonlinear schrodinger equation with a harmonicoscillator parabolic confining potential and a periodically modulated coefficient in front of the cubic term nonlinear lattice pseudopotential the equation applies to a cigarshaped boseeinstein condensate loaded in the combination of a magnetic trap and an optical lattice which induces the periodic pseudopotential via the feshbach resonance families of stable lms in the model feature specific properties which result from the interplay between spatial scales introduced by the parabolic trap and the period of the nonlinear pseudopotential asymptotic results on the shapes and stability of lms are obtained for smallamplitude solutions and in the limit of a rapidly oscillating nonlinear pseudopotential we show that the presence of the lattice pseudopotential may result in i creation of new lm families which have no counterparts in the case of the uniform nonlinearity ii stabilization of some previously unstable lm species iii evolution of unstable lms into a pulsating mode trapped in one well of the lattice pseudopotential | [['we', 'study', 'localized', 'modes', 'lms', 'of', 'the', 'onedimensional', 'grosspitaevskiinonlinear', 'schrodinger', 'equation', 'with', 'a', 'harmonicoscillator', 'parabolic', 'confining', 'potential', 'and', 'a', 'periodically', 'modulated', 'coefficient', 'in', 'front', 'of', 'the', 'cubic', 'term', 'nonlinear', 'lattice', 'pseudopotential', 'the', 'equation', 'applies', 'to', 'a', 'cigarshaped', 'boseeinstein', 'condensate', 'loaded', 'in', 'the', 'combination', 'of', 'a', 'magnetic', 'trap', 'and', 'an', 'optical', 'lattice', 'which', 'induces', 'the', 'periodic', 'pseudopotential', 'via', 'the', 'feshbach', 'resonance', 'families', 'of', 'stable', 'lms', 'in', 'the', 'model', 'feature', 'specific', 'properties', 'which', 'result', 'from', 'the', 'interplay', 'between', 'spatial', 'scales', 'introduced', 'by', 'the', 'parabolic', 'trap', 'and', 'the', 'period', 'of', 'the', 'nonlinear', 'pseudopotential', 'asymptotic', 'results', 'on', 'the', 'shapes', 'and', 'stability', 'of', 'lms', 'are', 'obtained', 'for', 'smallamplitude', 'solutions', 'and', 'in', 'the', 'limit', 'of', 'a', 'rapidly', 'oscillating', 'nonlinear', 'pseudopotential', 'we', 'show', 'that', 'the', 'presence', 'of', 'the', 'lattice', 'pseudopotential', 'may', 'result', 'in', 'i', 'creation', 'of', 'new', 'lm', 'families', 'which', 'have', 'no', 'counterparts', 'in', 'the', 'case', 'of', 'the', 'uniform', 'nonlinearity', 'ii', 'stabilization', 'of', 'some', 'previously', 'unstable', 'lm', 'species', 'iii', 'evolution', 'of', 'unstable', 'lms', 'into', 'a', 'pulsating', 'mode', 'trapped', 'in', 'one', 'well', 'of', 'the', 'lattice', 'pseudopotential']] | [-0.15089356777614393, 0.1421633009291067, -0.0610451864721697, 0.01382905262982517, -0.03121252416721767, -0.1611111624293872, 0.017176724517152513, 0.3578747019304761, -0.2655173183718164, -0.1936619121794744, 0.06472574722179811, -0.27977581710798577, -0.13526458759692364, 0.15982482804212764, 0.04267777925720327, 0.0828964557249925, 0.04781168734189123, -0.004512342039517881, -0.046866321455343585, -0.22826527500624902, 0.29796495231788694, 0.0024591437946323174, 0.24470764480619914, 0.019517329294190165, 0.056536588055591676, -0.0044491029666027145, 0.06283897193549949, -0.02307330058621509, -0.14985443478322158, 0.11056630871635639, 0.15938710416334548, -0.03900805775733066, 0.267017043073706, -0.4361287544791897, -0.2407690550086651, 0.054569603728374376, 0.19216495483332047, 0.1602794774426868, -0.044367755920185506, -0.2910660988903449, -0.007168829463244904, -0.13322590210009366, -0.21855317131017468, -0.0649870843127636, 0.037391580996059236, 0.10282596207772647, -0.2815878114696326, 0.12289697804676723, 0.12691256200265516, 0.0855389324715361, -0.13787395267337116, -0.09277985687644798, -0.04187368428462096, -0.0017992167822307064, 0.015835314057074442, 0.004582035786283779, 0.0573248384392909, -0.1354412769017342, -0.05091132045934154, 0.39041175154436913, -0.14769701478404126, -0.21542306675110012, 0.1764809685389212, -0.10908973164346424, -0.037446396378245914, 0.1368106520163738, 0.19294747627351344, 0.09189928581638794, -0.12148248260512316, 0.09359000938205836, -0.020005007784458854, 0.17559875970151292, 0.11097237343866644, 0.021659671982412136, 0.19803470261450412, 0.16912097542635388, 0.048361851124181635, 0.1581909667930588, -0.09392460181039669, -0.15169128529461368, -0.272491145815279, -0.10728402823276285, -0.17611372289632396, 0.0012025285312639816, -0.08238144159561973, -0.2474141630220748, 0.4432864880987576, 0.07732385238939189, 0.16934703588430283, -0.02307866564522209, 0.22410001575675173, 0.1636016162450514, 0.0725986028165131, 0.03496973794002164, 0.26667739024161985, 0.15731076928620627, 0.0908485120508842, -0.31207810525111634, -0.06486851071808598, 0.10503492122543753] |
1,802.05182 | Modelling of laser-plasma acceleration of relativistic electrons in the
frame of ESCULAP project | We present numerical simulations results on the injection and acceleration of
a 10 MeV, 10 pC electrons beam in a plasma wave generated in a gas cell by a
2J, 45 fs laser beam. This modeling is related to the ESCULAP project in which
the electrons accelerated by the PHIL photo-injector is injected in a gas cell
irradiated by the laser beam of the LASERIX system. Extensive modeling of the
experiment was performed in order to determine optimal parameters of the laser
plasma configurations. This was done with the newly developed numerical code
WakeTraj . We propose a configuration that benefits of a highly compressed
electron bunch and for which the injected electron beam can be efficiently
coupled to the plasma wave and accelerated up to 140 MeV, with an energy spread
lower than 5%.
| physics.acc-ph | we present numerical simulations results on the injection and acceleration of a 10 mev 10 pc electrons beam in a plasma wave generated in a gas cell by a 2j 45 fs laser beam this modeling is related to the esculap project in which the electrons accelerated by the phil photoinjector is injected in a gas cell irradiated by the laser beam of the laserix system extensive modeling of the experiment was performed in order to determine optimal parameters of the laser plasma configurations this was done with the newly developed numerical code waketraj we propose a configuration that benefits of a highly compressed electron bunch and for which the injected electron beam can be efficiently coupled to the plasma wave and accelerated up to 140 mev with an energy spread lower than 5 | [['we', 'present', 'numerical', 'simulations', 'results', 'on', 'the', 'injection', 'and', 'acceleration', 'of', 'a', '10', 'mev', '10', 'pc', 'electrons', 'beam', 'in', 'a', 'plasma', 'wave', 'generated', 'in', 'a', 'gas', 'cell', 'by', 'a', '2j', '45', 'fs', 'laser', 'beam', 'this', 'modeling', 'is', 'related', 'to', 'the', 'esculap', 'project', 'in', 'which', 'the', 'electrons', 'accelerated', 'by', 'the', 'phil', 'photoinjector', 'is', 'injected', 'in', 'a', 'gas', 'cell', 'irradiated', 'by', 'the', 'laser', 'beam', 'of', 'the', 'laserix', 'system', 'extensive', 'modeling', 'of', 'the', 'experiment', 'was', 'performed', 'in', 'order', 'to', 'determine', 'optimal', 'parameters', 'of', 'the', 'laser', 'plasma', 'configurations', 'this', 'was', 'done', 'with', 'the', 'newly', 'developed', 'numerical', 'code', 'waketraj', 'we', 'propose', 'a', 'configuration', 'that', 'benefits', 'of', 'a', 'highly', 'compressed', 'electron', 'bunch', 'and', 'for', 'which', 'the', 'injected', 'electron', 'beam', 'can', 'be', 'efficiently', 'coupled', 'to', 'the', 'plasma', 'wave', 'and', 'accelerated', 'up', 'to', '140', 'mev', 'with', 'an', 'energy', 'spread', 'lower', 'than', '5']] | [-0.09675255674725272, 0.20762715588905412, -0.04423704243937325, 0.03185832951063836, 0.03387039331885587, -0.11543136515437548, 0.03733505020084392, 0.41364264746609714, -0.22225781403835582, -0.3419403827196001, 0.038647881216243525, -0.2743664658663416, 0.023971717895264213, 0.22683514229939283, 0.036787382586109904, 0.061259869174485594, 0.07103349129088167, -0.057232595865502674, -0.04253530753531346, -0.18478063367660807, 0.24987273958609685, 0.19517976724843783, 0.24809963987173891, 0.053080960397461525, 0.136581413696443, -0.04359274446488099, 0.030533109882608392, -0.03406636186532284, -0.11925942936155698, 0.10041655705982637, 0.2061014723214776, 0.06594516444054985, 0.26768160827766013, -0.45187611158068913, -0.2470351770770547, -0.0124200607765522, 0.15391612700641827, 0.08228227223752808, -0.10584203672115657, -0.24911396260744423, 0.07497914773902219, -0.20247558484736242, -0.15390989056585314, 0.02527755114102834, -0.030985790964818204, 0.0673889339887502, -0.29742640539079457, 0.024358460966749748, -0.004180305719697722, 0.02559179399526657, -0.04631999499843757, -0.07136183584553603, 0.016684221509928095, 0.009257566755378437, 0.021387730448513775, 0.1328146311356441, 0.19167094688190328, -0.06858952550735689, -0.07260604790951077, 0.3927362577751615, -0.04489072499049677, -0.14547591998164816, 0.1547289402364172, -0.19323669827396148, -0.0018177241353052004, 0.23384118414855093, 0.17047459194506692, 0.09926875558142599, -0.16267630671452088, -0.0009579016539072128, -0.029322198865002133, 0.20180857645109632, 0.12265759653979003, -0.05556061617238797, 0.19069226250696675, 0.19658703046073592, 0.013496756280555312, 0.1561020243557562, -0.1660418902058592, -0.007947205993017755, -0.2492644647766549, -0.12497964521687954, -0.16302080923355275, 0.05732706743813316, -0.011226806288634959, -0.0758308855894624, 0.4646711468808633, 0.14931356566222875, 0.12238799515915544, -0.0810067978796122, 0.3205154383015868, 0.11008582188558758, 0.04033958678189805, 0.09658488680265452, 0.23366494252717585, 0.12473501511709414, 0.12705478510868393, -0.24700598002068305, -0.0285053098315191, 0.0011115577071905136] |
1,802.05183 | Magnetic Field Dependent Microwave Losses in Superconducting Niobium
Microstrip Resonators | We describe an experimental protocol to characterize magnetic field dependent
microwave losses in superconducting niobium microstrip resonators. Our approach
provides a unified view that covers two well-known magnetic field dependent
loss mechanisms: quasiparticle generation and vortex motion. We find that
quasiparticle generation is the dominant loss mechanism for parallel magnetic
fields. For perpendicular fields, the dominant loss mechanism is vortex motion
or switches from quasiparticle generation to vortex motion, depending on
cooling procedures. In particular, we introduce a plot of the quality factor
versus the resonance frequency as a general method for identifying the dominant
loss mechanism. We calculate the expected resonance frequency and the quality
factor as a function of the magnetic field by modeling the complex resistivity.
Key parameters characterizing microwave loss are estimated from comparisons of
the observed and expected resonator properties. Based on these key parameters,
we find a niobium resonator whose thickness is similar to its penetration depth
is the best choice for X-band electron spin resonance applications. Finally, we
detect partial release of the Meissner current at the vortex penetration field,
suggesting that the interaction between vortices and the Meissner current near
the edges is essential to understand the magnetic field dependence of the
resonator properties.
| cond-mat.supr-con quant-ph | we describe an experimental protocol to characterize magnetic field dependent microwave losses in superconducting niobium microstrip resonators our approach provides a unified view that covers two wellknown magnetic field dependent loss mechanisms quasiparticle generation and vortex motion we find that quasiparticle generation is the dominant loss mechanism for parallel magnetic fields for perpendicular fields the dominant loss mechanism is vortex motion or switches from quasiparticle generation to vortex motion depending on cooling procedures in particular we introduce a plot of the quality factor versus the resonance frequency as a general method for identifying the dominant loss mechanism we calculate the expected resonance frequency and the quality factor as a function of the magnetic field by modeling the complex resistivity key parameters characterizing microwave loss are estimated from comparisons of the observed and expected resonator properties based on these key parameters we find a niobium resonator whose thickness is similar to its penetration depth is the best choice for xband electron spin resonance applications finally we detect partial release of the meissner current at the vortex penetration field suggesting that the interaction between vortices and the meissner current near the edges is essential to understand the magnetic field dependence of the resonator properties | [['we', 'describe', 'an', 'experimental', 'protocol', 'to', 'characterize', 'magnetic', 'field', 'dependent', 'microwave', 'losses', 'in', 'superconducting', 'niobium', 'microstrip', 'resonators', 'our', 'approach', 'provides', 'a', 'unified', 'view', 'that', 'covers', 'two', 'wellknown', 'magnetic', 'field', 'dependent', 'loss', 'mechanisms', 'quasiparticle', 'generation', 'and', 'vortex', 'motion', 'we', 'find', 'that', 'quasiparticle', 'generation', 'is', 'the', 'dominant', 'loss', 'mechanism', 'for', 'parallel', 'magnetic', 'fields', 'for', 'perpendicular', 'fields', 'the', 'dominant', 'loss', 'mechanism', 'is', 'vortex', 'motion', 'or', 'switches', 'from', 'quasiparticle', 'generation', 'to', 'vortex', 'motion', 'depending', 'on', 'cooling', 'procedures', 'in', 'particular', 'we', 'introduce', 'a', 'plot', 'of', 'the', 'quality', 'factor', 'versus', 'the', 'resonance', 'frequency', 'as', 'a', 'general', 'method', 'for', 'identifying', 'the', 'dominant', 'loss', 'mechanism', 'we', 'calculate', 'the', 'expected', 'resonance', 'frequency', 'and', 'the', 'quality', 'factor', 'as', 'a', 'function', 'of', 'the', 'magnetic', 'field', 'by', 'modeling', 'the', 'complex', 'resistivity', 'key', 'parameters', 'characterizing', 'microwave', 'loss', 'are', 'estimated', 'from', 'comparisons', 'of', 'the', 'observed', 'and', 'expected', 'resonator', 'properties', 'based', 'on', 'these', 'key', 'parameters', 'we', 'find', 'a', 'niobium', 'resonator', 'whose', 'thickness', 'is', 'similar', 'to', 'its', 'penetration', 'depth', 'is', 'the', 'best', 'choice', 'for', 'xband', 'electron', 'spin', 'resonance', 'applications', 'finally', 'we', 'detect', 'partial', 'release', 'of', 'the', 'meissner', 'current', 'at', 'the', 'vortex', 'penetration', 'field', 'suggesting', 'that', 'the', 'interaction', 'between', 'vortices', 'and', 'the', 'meissner', 'current', 'near', 'the', 'edges', 'is', 'essential', 'to', 'understand', 'the', 'magnetic', 'field', 'dependence', 'of', 'the', 'resonator', 'properties']] | [-0.16753136818104142, 0.15376030783104713, -0.019834511130725468, 0.051790778781633164, -0.1060224206758534, -0.10005721566497837, 0.04847632886410811, 0.4069684499708733, -0.2560990480798306, -0.3026700383743806, 0.006760134051627673, -0.25296382455726957, -0.1043825736741932, 0.23773421799316818, 0.018309741642321506, 0.026003959102009765, -0.010943229211088602, 0.009178604050032279, -0.032572468567528934, -0.16786665711113907, 0.32697923459103423, 0.059486027336725505, 0.37963634649277805, 0.07401267248482471, 0.08881897723652643, -0.0023688881768669824, 0.04974301310606522, 0.0028011506829078835, -0.1565120481859099, 0.06875661258830108, 0.1856991189873736, 0.0129250066474744, 0.21816544502046845, -0.4264829077176971, -0.21219116534247054, 0.04203759180842945, 0.1522144810296595, 0.12899211208257677, -0.04968961808798226, -0.22120458222833453, 0.04101484528936372, -0.11318380225883189, -0.11857354699802299, -0.08582266419895436, -0.004027606392369172, 0.028209976934929295, -0.30392921609933127, 0.06743821327454678, 0.05933654647537203, 0.07108529247366593, -0.1068312333381532, -0.09109158244152267, -0.003851322551709738, 0.06947675676230286, 0.01974578216409145, 0.0750834944186557, 0.22495496189043082, -0.17422803701247355, -0.12592257004885907, 0.3294784928589026, -0.06728434543463051, -0.1158122865467028, 0.12934156187860718, -0.15944851487287146, -0.013680741612771802, 0.14338169749896792, 0.16533148271552664, 0.07182391381423141, -0.13916305561738992, 0.008109937718202646, 0.012622557546180387, 0.1717403578678017, 0.06612575421280384, 0.07666847853728866, 0.2596240818021026, 0.21010139876271203, 0.03211645708917318, 0.1603209435995115, -0.1696283548613918, -0.03348316097779587, -0.2884933298406431, -0.13310421359642308, -0.17200001844062038, 0.039286171473415184, -0.06461324468690159, -0.1974607407770092, 0.42554376439403485, 0.190740028052766, 0.18904717268519067, -0.05994997540659428, 0.3488047585516043, 0.13877183988651187, 0.11223560910773381, 0.05179189437179651, 0.2799116917378684, 0.18300907484181964, 0.1080650459873573, -0.3227422914028601, 0.0457947176286379, 0.00290230599849826] |
1,802.05184 | Enhancing Compressed Sensing 4D Photoacoustic Tomography by Simultaneous
Motion Estimation | A crucial limitation of current high-resolution 3D photoacoustic tomography
(PAT) devices that employ sequential scanning is their long acquisition time.
In previous work, we demonstrated how to use compressed sensing techniques to
improve upon this: images with good spatial resolution and contrast can be
obtained from suitably sub-sampled PAT data acquired by novel acoustic scanning
systems if sparsity-constrained image reconstruction techniques such as total
variation regularization are used. Now, we show how a further increase of image
quality can be achieved for imaging dynamic processes in living tissue (4D
PAT). The key idea is to exploit the additional temporal redundancy of the data
by coupling the previously used spatial image reconstruction models with
sparsity-constrained motion estimation models. While simulated data from a
two-dimensional numerical phantom will be used to illustrate the main
properties of this recently developed
joint-image-reconstruction-and-motion-estimation framework, measured data from
a dynamic experimental phantom will also be used to demonstrate their potential
for challenging, large-scale, real-world, three-dimensional scenarios. The
latter only becomes feasible if a carefully designed combination of tailored
optimization schemes is employed, which we describe and examine in more detail.
| math.NA | a crucial limitation of current highresolution 3d photoacoustic tomography pat devices that employ sequential scanning is their long acquisition time in previous work we demonstrated how to use compressed sensing techniques to improve upon this images with good spatial resolution and contrast can be obtained from suitably subsampled pat data acquired by novel acoustic scanning systems if sparsityconstrained image reconstruction techniques such as total variation regularization are used now we show how a further increase of image quality can be achieved for imaging dynamic processes in living tissue 4d pat the key idea is to exploit the additional temporal redundancy of the data by coupling the previously used spatial image reconstruction models with sparsityconstrained motion estimation models while simulated data from a twodimensional numerical phantom will be used to illustrate the main properties of this recently developed jointimagereconstructionandmotionestimation framework measured data from a dynamic experimental phantom will also be used to demonstrate their potential for challenging largescale realworld threedimensional scenarios the latter only becomes feasible if a carefully designed combination of tailored optimization schemes is employed which we describe and examine in more detail | [['a', 'crucial', 'limitation', 'of', 'current', 'highresolution', '3d', 'photoacoustic', 'tomography', 'pat', 'devices', 'that', 'employ', 'sequential', 'scanning', 'is', 'their', 'long', 'acquisition', 'time', 'in', 'previous', 'work', 'we', 'demonstrated', 'how', 'to', 'use', 'compressed', 'sensing', 'techniques', 'to', 'improve', 'upon', 'this', 'images', 'with', 'good', 'spatial', 'resolution', 'and', 'contrast', 'can', 'be', 'obtained', 'from', 'suitably', 'subsampled', 'pat', 'data', 'acquired', 'by', 'novel', 'acoustic', 'scanning', 'systems', 'if', 'sparsityconstrained', 'image', 'reconstruction', 'techniques', 'such', 'as', 'total', 'variation', 'regularization', 'are', 'used', 'now', 'we', 'show', 'how', 'a', 'further', 'increase', 'of', 'image', 'quality', 'can', 'be', 'achieved', 'for', 'imaging', 'dynamic', 'processes', 'in', 'living', 'tissue', '4d', 'pat', 'the', 'key', 'idea', 'is', 'to', 'exploit', 'the', 'additional', 'temporal', 'redundancy', 'of', 'the', 'data', 'by', 'coupling', 'the', 'previously', 'used', 'spatial', 'image', 'reconstruction', 'models', 'with', 'sparsityconstrained', 'motion', 'estimation', 'models', 'while', 'simulated', 'data', 'from', 'a', 'twodimensional', 'numerical', 'phantom', 'will', 'be', 'used', 'to', 'illustrate', 'the', 'main', 'properties', 'of', 'this', 'recently', 'developed', 'jointimagereconstructionandmotionestimation', 'framework', 'measured', 'data', 'from', 'a', 'dynamic', 'experimental', 'phantom', 'will', 'also', 'be', 'used', 'to', 'demonstrate', 'their', 'potential', 'for', 'challenging', 'largescale', 'realworld', 'threedimensional', 'scenarios', 'the', 'latter', 'only', 'becomes', 'feasible', 'if', 'a', 'carefully', 'designed', 'combination', 'of', 'tailored', 'optimization', 'schemes', 'is', 'employed', 'which', 'we', 'describe', 'and', 'examine', 'in', 'more', 'detail']] | [-0.020559408274782018, 0.0377627970322221, -0.08008594860709552, 0.07085257672954126, -0.07490421296351799, -0.15627949281539666, -0.01588736124377433, 0.44101767651126034, -0.309057029898029, -0.3351655837881272, 0.13925234847791146, -0.22236954516068336, -0.18890607858819713, 0.22361050569579574, -0.12183293757980557, 0.13555414300116767, 0.10814376990819767, -0.01820868015660818, -0.05558000577107893, -0.2335738765706863, 0.2712769611825139, 0.08402586809507077, 0.3526824990521526, 0.005133106955963243, 0.10656244798354764, 0.022030359749870547, -0.05358244497532565, 0.05352849452031135, -0.11315629202154462, 0.1416728769688577, 0.29298775531835836, 0.17542682311121027, 0.25114717836049005, -0.4851925157499118, -0.28097481286036147, 0.07556746755294054, 0.1986390477926801, 0.11939925208873538, -0.10128408576760382, -0.308531964620158, 0.08357037568739692, -0.11283994617469893, -0.056648604417791654, -0.1453675393554601, -0.06603151770458746, -0.00973606915270421, -0.2837397753050464, 0.07740978731012323, -0.027089612253132413, 0.04349448331351814, -0.05670394071689845, -0.04994352844472506, 0.01631106078482228, 0.14678921976223425, -0.00542602566315136, 0.03321896864946097, 0.12195708412839903, -0.13241517558042468, -0.13712284496293245, 0.36041048419524413, -0.04807622410876096, -0.21251803636041983, 0.1917187370591456, -0.10308422469864778, -0.09792751353488513, 0.13112818266779103, 0.19492227873189852, 0.1454165407087173, -0.18081036296830885, 0.04935762060416832, 0.007514868015576093, 0.21332911704285223, 0.059732326959091864, 0.008390385691900967, 0.15664030098142562, 0.21884801433627785, 0.01939599965686294, 0.13745690422206405, -0.17028128951177246, -0.003015226684510708, -0.20592313055508857, -0.12106238761051594, -0.20790168938298245, 0.0009986815892689216, -0.05978032020082865, -0.09664866313480777, 0.3572557929501222, 0.2290521943859013, 0.2013140561197798, -0.012431644094736401, 0.396961071151894, 0.07270018870323958, 0.10521828084217151, -0.013722242286194706, 0.21418101675019605, 0.07286736454631461, 0.15999359811907138, -0.20058222103334677, 0.029188458221236783, 0.009130955344228878] |
1,802.05185 | Performance of Tao-Mo semilocal density functional in
projector-augmented-wave method | We assess the performance of Tao-Mo semilocal exchange correlation (TM)
functional [J. Tao and Y. Mo, Phys. Rev. Lett. 117, 073001 (2016)] using
projector-augmented-wave method with the plane wave basis set in Vienna ab
initio simulation package (VASP). The meta-GGA level semilocal functional TM is
an all purpose exchange-correlation functional which performs accurately for
the wide range of molecular and solid state properties. The exchange functional
part of TM is designed from the density matrix expansion (DME) technique
together with the slowly varying fourth order gradient expansion. The
correlation functional of the corresponding exchange is based on
Tao-Perdew-Staroverov-Scuseria (TPSS) functional. We assess the performance of
TM for solid state lattice constants, bulk moduli, band gaps, cohesive energies
and magnetic moments of solids. It has been established that in plane wave
basis the TM functional performs accurately in predicting all the solid state
properties in semilocal level.
| cond-mat.mtrl-sci | we assess the performance of taomo semilocal exchange correlation tm functional j tao and y mo phys rev lett 117 073001 2016 using projectoraugmentedwave method with the plane wave basis set in vienna ab initio simulation package vasp the metagga level semilocal functional tm is an all purpose exchangecorrelation functional which performs accurately for the wide range of molecular and solid state properties the exchange functional part of tm is designed from the density matrix expansion dme technique together with the slowly varying fourth order gradient expansion the correlation functional of the corresponding exchange is based on taoperdewstaroverovscuseria tpss functional we assess the performance of tm for solid state lattice constants bulk moduli band gaps cohesive energies and magnetic moments of solids it has been established that in plane wave basis the tm functional performs accurately in predicting all the solid state properties in semilocal level | [['we', 'assess', 'the', 'performance', 'of', 'taomo', 'semilocal', 'exchange', 'correlation', 'tm', 'functional', 'j', 'tao', 'and', 'y', 'mo', 'phys', 'rev', 'lett', '117', '073001', '2016', 'using', 'projectoraugmentedwave', 'method', 'with', 'the', 'plane', 'wave', 'basis', 'set', 'in', 'vienna', 'ab', 'initio', 'simulation', 'package', 'vasp', 'the', 'metagga', 'level', 'semilocal', 'functional', 'tm', 'is', 'an', 'all', 'purpose', 'exchangecorrelation', 'functional', 'which', 'performs', 'accurately', 'for', 'the', 'wide', 'range', 'of', 'molecular', 'and', 'solid', 'state', 'properties', 'the', 'exchange', 'functional', 'part', 'of', 'tm', 'is', 'designed', 'from', 'the', 'density', 'matrix', 'expansion', 'dme', 'technique', 'together', 'with', 'the', 'slowly', 'varying', 'fourth', 'order', 'gradient', 'expansion', 'the', 'correlation', 'functional', 'of', 'the', 'corresponding', 'exchange', 'is', 'based', 'on', 'taoperdewstaroverovscuseria', 'tpss', 'functional', 'we', 'assess', 'the', 'performance', 'of', 'tm', 'for', 'solid', 'state', 'lattice', 'constants', 'bulk', 'moduli', 'band', 'gaps', 'cohesive', 'energies', 'and', 'magnetic', 'moments', 'of', 'solids', 'it', 'has', 'been', 'established', 'that', 'in', 'plane', 'wave', 'basis', 'the', 'tm', 'functional', 'performs', 'accurately', 'in', 'predicting', 'all', 'the', 'solid', 'state', 'properties', 'in', 'semilocal', 'level']] | [-0.12562394507503621, 0.057774685449321746, -0.08286226179756939, 0.046815094447133374, -0.025315293656304888, -0.04745982456569598, 0.06325838215368455, 0.3958342598355694, -0.2182992841372241, -0.29184595848854683, -0.04589969163907258, -0.3194439218966418, -0.1449482047066016, 0.12012386034332113, 0.08104303688423274, 0.09266492972558696, 0.03054117781352507, -0.015554124722257257, -0.133311237736401, -0.23546788987244338, 0.20493054662652518, 0.09926854835325623, 0.3187056569510525, 0.06217870131862184, 0.019431712538042194, 0.08065435346630594, 0.05344191107943603, 0.00769232449915949, -0.1654327957724378, 0.14301116897386487, 0.286708227338027, 0.016040663111297898, 0.2602775878949116, -0.4695855914806462, -0.2257042147302107, -0.021024699552520495, 0.007253063992558889, 0.07190413937636025, 0.010235666958391922, -0.2594138128676592, 0.07903855696977563, -0.21378643204432543, -0.10797103314201208, -0.19733760933302444, 0.03924119125490319, 0.0907371595808088, -0.25137070693994223, 0.15020639031538613, -0.04839573171761601, 0.0744347661440197, -0.09538650163369611, -0.20083319023251534, -0.0898732155201038, 0.036512976719627846, -0.019583029935633992, 0.12972674997840777, 0.13943956594289064, -0.02687740693552968, -0.03613260596885333, 0.3722269119286578, -0.11192714612634393, -0.1538212747402387, 0.17869005562603626, -0.11244603228270497, -0.11668256645358793, 0.12114016235206429, 0.11017146650765551, 0.11911050847744288, -0.17743760715430118, 0.19920835914991297, 0.03537751937720053, 0.2065500541692217, 0.07581746443621304, -0.006317975391850692, 0.13148587958389663, 0.1361987757407231, 0.01726791048972638, 0.03885503084724131, -0.11408820406418957, -0.11888276880174638, -0.2488163512850767, -0.2005503883406724, -0.24238348670291063, -0.0054520815668694595, -0.05197701873291644, -0.2116311630995606, 0.4010664568831251, 0.09615582359591117, 0.08517269173330844, -0.027544699527151016, 0.2126748902812498, 0.09501544858437838, 0.023651770414937646, 0.10476652070184633, 0.23130556453563184, 0.20857919866780508, 0.06372858961718794, -0.24110883944954928, 0.02834076666407134, 0.11318329223017017] |
1,802.05186 | Bayesian Meta-Analysis of Multiple Continuous Treatments: An Application
to Antipsychotic Drugs | Modeling dose-response relationships of drugs is essential to understanding
their effect on patient outcomes under realistic circumstances. While
intention-to-treat analyses of clinical trials provide the effect of assignment
to a particular drug and dose, they do not capture observed exposure after
factoring in non-adherence and dropout. We develop Bayesian methods to flexibly
model dose-response relationships of binary outcomes with continuous treatment,
allowing for treatment effect heterogeneity and a non-linear response surface.
We use a hierarchical framework for meta-analysis with the explicit goal of
combining information from multiple trials while accounting for heterogeneity.
In an application, we examine the risk of excessive weight gain for patients
with schizophrenia treated with the second generation antipsychotics
paliperidone, risperidone, or olanzapine in 14 clinical trials. Averaging over
the sample population, we found that olanzapine contributed to a 15.6% (95%
CrI: 6.7, 27.1) excess risk of weight gain at a 500mg cumulative dose.
Paliperidone conferred a 3.2% (95% CrI: 1.5, 5.2) and risperidone a 14.9% (95%
CrI: 0.0, 38.7) excess risk at 500mg olanzapine equivalent cumulative doses.
Blacks had an additional 6.8% (95% CrI: 1.0, 12.4) risk of weight gain over
non-blacks at 1000mg olanzapine equivalent cumulative doses of paliperidone.
| stat.AP | modeling doseresponse relationships of drugs is essential to understanding their effect on patient outcomes under realistic circumstances while intentiontotreat analyses of clinical trials provide the effect of assignment to a particular drug and dose they do not capture observed exposure after factoring in nonadherence and dropout we develop bayesian methods to flexibly model doseresponse relationships of binary outcomes with continuous treatment allowing for treatment effect heterogeneity and a nonlinear response surface we use a hierarchical framework for metaanalysis with the explicit goal of combining information from multiple trials while accounting for heterogeneity in an application we examine the risk of excessive weight gain for patients with schizophrenia treated with the second generation antipsychotics paliperidone risperidone or olanzapine in 14 clinical trials averaging over the sample population we found that olanzapine contributed to a 156 95 cri 67 271 excess risk of weight gain at a 500mg cumulative dose paliperidone conferred a 32 95 cri 15 52 and risperidone a 149 95 cri 00 387 excess risk at 500mg olanzapine equivalent cumulative doses blacks had an additional 68 95 cri 10 124 risk of weight gain over nonblacks at 1000mg olanzapine equivalent cumulative doses of paliperidone | [['modeling', 'doseresponse', 'relationships', 'of', 'drugs', 'is', 'essential', 'to', 'understanding', 'their', 'effect', 'on', 'patient', 'outcomes', 'under', 'realistic', 'circumstances', 'while', 'intentiontotreat', 'analyses', 'of', 'clinical', 'trials', 'provide', 'the', 'effect', 'of', 'assignment', 'to', 'a', 'particular', 'drug', 'and', 'dose', 'they', 'do', 'not', 'capture', 'observed', 'exposure', 'after', 'factoring', 'in', 'nonadherence', 'and', 'dropout', 'we', 'develop', 'bayesian', 'methods', 'to', 'flexibly', 'model', 'doseresponse', 'relationships', 'of', 'binary', 'outcomes', 'with', 'continuous', 'treatment', 'allowing', 'for', 'treatment', 'effect', 'heterogeneity', 'and', 'a', 'nonlinear', 'response', 'surface', 'we', 'use', 'a', 'hierarchical', 'framework', 'for', 'metaanalysis', 'with', 'the', 'explicit', 'goal', 'of', 'combining', 'information', 'from', 'multiple', 'trials', 'while', 'accounting', 'for', 'heterogeneity', 'in', 'an', 'application', 'we', 'examine', 'the', 'risk', 'of', 'excessive', 'weight', 'gain', 'for', 'patients', 'with', 'schizophrenia', 'treated', 'with', 'the', 'second', 'generation', 'antipsychotics', 'paliperidone', 'risperidone', 'or', 'olanzapine', 'in', '14', 'clinical', 'trials', 'averaging', 'over', 'the', 'sample', 'population', 'we', 'found', 'that', 'olanzapine', 'contributed', 'to', 'a', '156', '95', 'cri', '67', '271', 'excess', 'risk', 'of', 'weight', 'gain', 'at', 'a', '500mg', 'cumulative', 'dose', 'paliperidone', 'conferred', 'a', '32', '95', 'cri', '15', '52', 'and', 'risperidone', 'a', '149', '95', 'cri', '00', '387', 'excess', 'risk', 'at', '500mg', 'olanzapine', 'equivalent', 'cumulative', 'doses', 'blacks', 'had', 'an', 'additional', '68', '95', 'cri', '10', '124', 'risk', 'of', 'weight', 'gain', 'over', 'nonblacks', 'at', '1000mg', 'olanzapine', 'equivalent', 'cumulative', 'doses', 'of', 'paliperidone']] | [-0.009443612660992171, 0.07851225441391334, -0.04114184995975207, 0.12210280319648702, -0.02840395169529729, -0.13524540409041697, 0.17325560641277918, 0.42204236603778095, -0.1490016477428889, -0.3673142854607216, 0.06242555151895248, -0.30437579268106707, -0.08748546568307257, 0.16860860992603685, -0.10661218897316349, 0.025860280755700335, 0.03967303268626214, 0.013507081231591415, 5.7720929684817164e-05, -0.2786776203361572, 0.19591072018651867, 0.09765938876650085, 0.2965535998551382, 0.01743513373282329, 0.10723800385720712, 0.05654033091105275, -0.04617365778401671, -0.01259917311528057, -0.1057311884627173, 0.11709203758331203, 0.3099287260772177, 0.155371142201441, 0.378876528747025, -0.36664112987933484, -0.21273271941823796, 0.11738435521588794, 0.07409191899255371, 0.01431620333629547, -0.006827744278963163, -0.23459855689132517, 0.04162170237950271, -0.1986740683698189, -0.06608516323502131, 0.0011141371602813404, 0.012632759653830103, -0.03162710202448858, -0.3329300622920205, 0.15416691402002933, -0.014392958892381224, 0.1644508726993408, -0.12999508326143894, -0.216563282307809, -0.0010858831394995963, 0.0989183126074119, 0.04141770059146756, 0.01860740533894391, 0.1739872584939274, -0.12322359989155773, -0.11297295454436193, 0.31917196699718714, -0.04097292108939241, -0.13441423223250443, 0.1402129499736321, -0.13358343974502374, -0.11659932820367869, 0.21485419849318171, 0.21602894917066412, 0.06580997740347234, -0.2115882660444609, -0.04677889462456935, 0.04911115621931102, 0.20613443793540465, 0.09486047044721624, -0.016978649618399757, 0.17188325181005032, 0.15361409603677217, -0.0058125262333464526, 0.08452004069097774, -0.1794819828115463, -0.03405356214371899, -0.2448962110285056, -0.13311722278151483, -0.028156932317725723, 0.09734650611855575, -0.10744570945137027, -0.13451475791495154, 0.3571279703555678, 0.15162429468282473, 0.14155227390534328, 0.11555769608760125, 0.20236742055467355, 0.07215828849643312, 0.06280757859102869, 0.009414761059883016, 0.17351443057130805, 0.08906141016385936, 0.0233341044482711, -0.19222660554420798, 0.146280343107055, -0.08918575512272399] |
1,802.05187 | On the Blindspots of Convolutional Networks | Deep convolutional network has been the state-of-the-art approach for a wide
variety of tasks over the last few years. Its successes have, in many cases,
turned it into the default model in quite a few domains. In this work, we will
demonstrate that convolutional networks have limitations that may, in some
cases, hinder it from learning properties of the data, which are easily
recognizable by traditional, less demanding, models. To this end, we present a
series of competitive analysis studies on image recognition and text analysis
tasks, for which convolutional networks are known to provide state-of-the-art
results. In our studies, we inject a truth-revealing signal, indiscernible for
the network, thus hitting time and again the network's blind spots. The signal
does not impair the network's existing performances, but it does provide an
opportunity for a significant performance boost by models that can capture it.
The various forms of the carefully designed signals shed a light on the
strengths and weaknesses of convolutional network, which may provide insights
for both theoreticians that study the power of deep architectures, and for
practitioners that consider applying convolutional networks to the task at
hand.
| stat.ML cs.LG | deep convolutional network has been the stateoftheart approach for a wide variety of tasks over the last few years its successes have in many cases turned it into the default model in quite a few domains in this work we will demonstrate that convolutional networks have limitations that may in some cases hinder it from learning properties of the data which are easily recognizable by traditional less demanding models to this end we present a series of competitive analysis studies on image recognition and text analysis tasks for which convolutional networks are known to provide stateoftheart results in our studies we inject a truthrevealing signal indiscernible for the network thus hitting time and again the networks blind spots the signal does not impair the networks existing performances but it does provide an opportunity for a significant performance boost by models that can capture it the various forms of the carefully designed signals shed a light on the strengths and weaknesses of convolutional network which may provide insights for both theoreticians that study the power of deep architectures and for practitioners that consider applying convolutional networks to the task at hand | [['deep', 'convolutional', 'network', 'has', 'been', 'the', 'stateoftheart', 'approach', 'for', 'a', 'wide', 'variety', 'of', 'tasks', 'over', 'the', 'last', 'few', 'years', 'its', 'successes', 'have', 'in', 'many', 'cases', 'turned', 'it', 'into', 'the', 'default', 'model', 'in', 'quite', 'a', 'few', 'domains', 'in', 'this', 'work', 'we', 'will', 'demonstrate', 'that', 'convolutional', 'networks', 'have', 'limitations', 'that', 'may', 'in', 'some', 'cases', 'hinder', 'it', 'from', 'learning', 'properties', 'of', 'the', 'data', 'which', 'are', 'easily', 'recognizable', 'by', 'traditional', 'less', 'demanding', 'models', 'to', 'this', 'end', 'we', 'present', 'a', 'series', 'of', 'competitive', 'analysis', 'studies', 'on', 'image', 'recognition', 'and', 'text', 'analysis', 'tasks', 'for', 'which', 'convolutional', 'networks', 'are', 'known', 'to', 'provide', 'stateoftheart', 'results', 'in', 'our', 'studies', 'we', 'inject', 'a', 'truthrevealing', 'signal', 'indiscernible', 'for', 'the', 'network', 'thus', 'hitting', 'time', 'and', 'again', 'the', 'networks', 'blind', 'spots', 'the', 'signal', 'does', 'not', 'impair', 'the', 'networks', 'existing', 'performances', 'but', 'it', 'does', 'provide', 'an', 'opportunity', 'for', 'a', 'significant', 'performance', 'boost', 'by', 'models', 'that', 'can', 'capture', 'it', 'the', 'various', 'forms', 'of', 'the', 'carefully', 'designed', 'signals', 'shed', 'a', 'light', 'on', 'the', 'strengths', 'and', 'weaknesses', 'of', 'convolutional', 'network', 'which', 'may', 'provide', 'insights', 'for', 'both', 'theoreticians', 'that', 'study', 'the', 'power', 'of', 'deep', 'architectures', 'and', 'for', 'practitioners', 'that', 'consider', 'applying', 'convolutional', 'networks', 'to', 'the', 'task', 'at', 'hand']] | [-0.07106071352101272, -0.011323874421394924, -0.09797299274603131, 0.0622198219305131, -0.08727662450579739, -0.17729414855844525, 0.019649441122993945, 0.46037764750696997, -0.26197005444940513, -0.3069782199673158, 0.12614183671336385, -0.25717616526942166, -0.21088271661262428, 0.25260371528442693, -0.09867813029183597, 0.055321744977922804, 0.14910294709323102, 0.035982226626916726, -0.0747075348528077, -0.3069221263852404, 0.28385253591837467, 0.05690473361678727, 0.3228803599147353, 0.07533210946651048, 0.07486226267573083, -0.06778451542138422, -0.008998141899980881, -0.0043563698226145265, -0.058780464554113454, 0.13936807896951756, 0.30711392418989725, 0.1940090817598892, 0.3341420160719839, -0.47174373980631273, -0.3029885908253688, 0.12496224694661107, 0.16213603518908182, 0.11915599448894638, -0.0442556227451417, -0.3158360746339279, 0.1013448842260346, -0.17845039254808354, 0.0067549545106000055, -0.15088484506307553, 0.006487814164424818, 0.019861443070497697, -0.23221919887388745, -0.004385069734540093, 0.10296512547776931, 0.028842273025364473, -0.006271149999481779, -0.12410627910251379, 0.051769646089745776, 0.1814159465628484, 0.044520928629146764, 0.027120627118545588, 0.10441371039167126, -0.21200515559958244, -0.13009568760245446, 0.35237177879248976, -0.05246922821939859, -0.17872320539835426, 0.20898132041963952, -0.06567310567861472, -0.19518064258363907, 0.11035240223820976, 0.2454906453639663, 0.10552420259684955, -0.1638791192638338, 0.014324458100384584, -0.043774693046336764, 0.16476356777948914, 0.0242446252938222, 0.03240799606486997, 0.21784287347783526, 0.242474151129721, 0.014845016926142669, 0.10199637642369246, -0.12418793072362268, -0.06939864721981977, -0.19308450048950762, -0.07953707646657393, -0.14777074029752935, -0.0034151384335167696, -0.06609371567863193, -0.11831124972492929, 0.44124915210342913, 0.22785755690364612, 0.20721981953336763, 0.10524783089631311, 0.33174768648056124, 0.03627239605079272, 0.15705338659297144, 0.07637149400401752, 0.25338838990822693, 0.05781133895710347, 0.1436418942021817, -0.11646294369973322, 0.08640329498075756, -0.014864183868720102] |
1,802.05188 | Matrix Models of Fuzzy Field Theories | We briefly review the connection between the fuzzy field theories and matrix
models and describe the main features of the models that appear. We summarize
the different approaches to their analysis, some of the recent results and the
challenges to be addressed in the future.
| hep-th | we briefly review the connection between the fuzzy field theories and matrix models and describe the main features of the models that appear we summarize the different approaches to their analysis some of the recent results and the challenges to be addressed in the future | [['we', 'briefly', 'review', 'the', 'connection', 'between', 'the', 'fuzzy', 'field', 'theories', 'and', 'matrix', 'models', 'and', 'describe', 'the', 'main', 'features', 'of', 'the', 'models', 'that', 'appear', 'we', 'summarize', 'the', 'different', 'approaches', 'to', 'their', 'analysis', 'some', 'of', 'the', 'recent', 'results', 'and', 'the', 'challenges', 'to', 'be', 'addressed', 'in', 'the', 'future']] | [-0.08670878193030755, 0.073740213830024, -0.07169001801974244, 0.09360434524714947, -0.04837630059983995, -0.08905063362585174, -0.0006479505863454607, 0.37703893201218713, -0.27390986267063355, -0.2864205966082712, 0.16331863331660215, -0.2980203886412912, -0.23603791598644522, 0.16854756352388198, -0.0672354355868366, 0.02516592037346628, 0.033352726387480894, 0.017250578477978708, -0.12908079874080916, -0.26275581187672087, 0.3661185512940089, 0.044436585158109665, 0.2730223585334089, 0.10436322933269872, 0.046982745660675895, -0.05726666926509804, -0.12991764067361752, 0.03284770473837852, -0.18007834353500382, 0.19383529010228812, 0.2546762947893714, 0.21109801133473713, 0.242672999886175, -0.48363450252347523, -0.20661274718327655, 0.0815007764328685, 0.09332145410072472, 0.1265410958064927, -0.021356828241712516, -0.28414743267413645, 0.08631912312961908, -0.15847177888370223, -0.13437931812885734, -0.08435465193146632, -0.01651678396544109, 0.07312452925576104, -0.14392518744700486, -0.0028839777689427136, 0.08096488811489609, -0.001585937679434816, -0.09517051204780323, -0.1648390300364958, 0.06409325504468547, 0.15194942596265013, 0.13553959416846434, 0.011814809352573421, 0.0836634683319264, -0.2046777583244774, -0.17824666193789906, 0.35624837564925355, -0.043376572264565365, -0.17941185552626848, 0.237873349731995, -0.12396130073401664, -0.19194410832391845, -0.038656356454723415, 0.17944044646703536, 0.10867000881375538, -0.1236529998274313, 0.06317078557719166, 0.0026475545432832507, 0.0973234586417675, -0.048452738118875356, 0.044218323058966134, 0.25857343077659606, 0.16405764505681064, -0.06173688047048118, 0.08837489719864809, -0.07023204838236173, -0.11943991863065295, -0.34541782724360626, -0.13042772896587848, -0.0915662983380672, -0.051850025968936585, -0.05095805474977371, -0.09990181676629517, 0.45860466261704763, 0.28275914051466516, 0.260375515723394, 0.015213241200480196, 0.2907033755754431, 0.10977429296407434, 0.044973048231460984, 0.018328260961506103, 0.2562008903187234, 0.16500336440900962, 0.11943084359582927, -0.19113462492823602, -0.012950708389851368, 0.027280808178087076] |
1,802.05189 | Particle Tracking and Extended Object Imaging by Interferometric Super
Resolution Microscopy | An interferometric fluorescent microscope and a novel theoretic image
reconstruction approach were developed and used to obtain super-resolution
images of live biological samples and to enable dynamic real time tracking. The
tracking utilizes the information stored in the interference pattern of both
the illuminating incoherent light and the emitted light. By periodically
shifting the interferometer phase and a phase retrieval algorithm we obtain
information that allow localization with sub-2 nm axial resolution at 5 Hz.
| physics.optics physics.bio-ph | an interferometric fluorescent microscope and a novel theoretic image reconstruction approach were developed and used to obtain superresolution images of live biological samples and to enable dynamic real time tracking the tracking utilizes the information stored in the interference pattern of both the illuminating incoherent light and the emitted light by periodically shifting the interferometer phase and a phase retrieval algorithm we obtain information that allow localization with sub2 nm axial resolution at 5 hz | [['an', 'interferometric', 'fluorescent', 'microscope', 'and', 'a', 'novel', 'theoretic', 'image', 'reconstruction', 'approach', 'were', 'developed', 'and', 'used', 'to', 'obtain', 'superresolution', 'images', 'of', 'live', 'biological', 'samples', 'and', 'to', 'enable', 'dynamic', 'real', 'time', 'tracking', 'the', 'tracking', 'utilizes', 'the', 'information', 'stored', 'in', 'the', 'interference', 'pattern', 'of', 'both', 'the', 'illuminating', 'incoherent', 'light', 'and', 'the', 'emitted', 'light', 'by', 'periodically', 'shifting', 'the', 'interferometer', 'phase', 'and', 'a', 'phase', 'retrieval', 'algorithm', 'we', 'obtain', 'information', 'that', 'allow', 'localization', 'with', 'sub2', 'nm', 'axial', 'resolution', 'at', '5', 'hz']] | [-0.07494862126807372, 0.11685863366525155, -0.1225181686071058, 0.008858191232429818, -0.03186465815485766, -0.18196048573901255, 0.029062169839938482, 0.4582683774083853, -0.2661160363877813, -0.36366152808070185, 0.08719435944998016, -0.2884303578734398, -0.13998531516020496, 0.17232272328188022, -0.09224787427733341, 0.10401390340489645, 0.05903655547027786, 0.0110768537192295, -0.035974805153285466, -0.15101187052826087, 0.20591314130617927, 0.06143242172896862, 0.3432801251113415, 0.012456741233666737, 0.1415326547746857, 0.07543473234400153, -0.07240245116253693, -0.056992501206696036, -0.08430285634211032, 0.13742177806794642, 0.2738675709813833, 0.17075415149331094, 0.17407367205868166, -0.4491899385924141, -0.22933464646339416, 0.06010034926235676, 0.16732847675681115, 0.10886555501570304, -0.09966919993360837, -0.36907143048942087, 0.0211820878709356, -0.052399231027811764, -0.060622014570981264, -0.06849141128361225, -0.05581353116625299, -0.007185060763731599, -0.2844814620539546, 0.046275876282403865, -0.015394809677576025, 0.07554885843147834, -0.06604433426012596, -0.007417223602533341, 0.04836662475640575, 0.16177364797641833, -0.07728534636398156, 0.06453882682758073, 0.17528011657918494, -0.1054044913376371, -0.10997223461667696, 0.3434474342068036, -0.06254393502759437, -0.11908317495137453, 0.147149789010485, -0.14283448642119764, -0.020952783344934386, 0.23400870886941752, 0.17229648954079796, 0.14391588392046592, -0.13844718612730503, -0.029208662737316142, 0.03082689215739568, 0.2633887384211024, 0.1504883652428786, 0.09939238017424941, 0.2029690797254443, 0.19467910862217347, 0.027956867727140587, 0.15693130026105792, -0.2535277556007107, -0.016909932528312008, -0.20352084965755543, -0.12480400903771321, -0.1757124642903606, -0.006098938025534153, -0.10797007931299353, -0.12240301841249068, 0.3927457025895516, 0.19895541490366062, 0.17973639272153377, 0.015580573379993438, 0.4024349293112755, 0.04067126506939531, 0.06895691843703389, -0.01621310396740834, 0.21508256377341847, 0.1140825067088008, 0.19941148076827328, -0.22299057451387247, -0.009316480923444033, 0.0076466866706808405] |
1,802.0519 | Understanding the Role of Adaptivity in Machine Teaching: The Case of
Version Space Learners | In real-world applications of education, an effective teacher adaptively
chooses the next example to teach based on the learner's current state.
However, most existing work in algorithmic machine teaching focuses on the
batch setting, where adaptivity plays no role. In this paper, we study the case
of teaching consistent, version space learners in an interactive setting. At
any time step, the teacher provides an example, the learner performs an update,
and the teacher observes the learner's new state. We highlight that adaptivity
does not speed up the teaching process when considering existing models of
version space learners, such as "worst-case" (the learner picks the next
hypothesis randomly from the version space) and "preference-based" (the learner
picks hypothesis according to some global preference). Inspired by human
teaching, we propose a new model where the learner picks hypotheses according
to some local preference defined by the current hypothesis. We show that our
model exhibits several desirable properties, e.g., adaptivity plays a key role,
and the learner's transitions over hypotheses are smooth/interpretable. We
develop efficient teaching algorithms and demonstrate our results via
simulation and user studies.
| cs.LG | in realworld applications of education an effective teacher adaptively chooses the next example to teach based on the learners current state however most existing work in algorithmic machine teaching focuses on the batch setting where adaptivity plays no role in this paper we study the case of teaching consistent version space learners in an interactive setting at any time step the teacher provides an example the learner performs an update and the teacher observes the learners new state we highlight that adaptivity does not speed up the teaching process when considering existing models of version space learners such as worstcase the learner picks the next hypothesis randomly from the version space and preferencebased the learner picks hypothesis according to some global preference inspired by human teaching we propose a new model where the learner picks hypotheses according to some local preference defined by the current hypothesis we show that our model exhibits several desirable properties eg adaptivity plays a key role and the learners transitions over hypotheses are smoothinterpretable we develop efficient teaching algorithms and demonstrate our results via simulation and user studies | [['in', 'realworld', 'applications', 'of', 'education', 'an', 'effective', 'teacher', 'adaptively', 'chooses', 'the', 'next', 'example', 'to', 'teach', 'based', 'on', 'the', 'learners', 'current', 'state', 'however', 'most', 'existing', 'work', 'in', 'algorithmic', 'machine', 'teaching', 'focuses', 'on', 'the', 'batch', 'setting', 'where', 'adaptivity', 'plays', 'no', 'role', 'in', 'this', 'paper', 'we', 'study', 'the', 'case', 'of', 'teaching', 'consistent', 'version', 'space', 'learners', 'in', 'an', 'interactive', 'setting', 'at', 'any', 'time', 'step', 'the', 'teacher', 'provides', 'an', 'example', 'the', 'learner', 'performs', 'an', 'update', 'and', 'the', 'teacher', 'observes', 'the', 'learners', 'new', 'state', 'we', 'highlight', 'that', 'adaptivity', 'does', 'not', 'speed', 'up', 'the', 'teaching', 'process', 'when', 'considering', 'existing', 'models', 'of', 'version', 'space', 'learners', 'such', 'as', 'worstcase', 'the', 'learner', 'picks', 'the', 'next', 'hypothesis', 'randomly', 'from', 'the', 'version', 'space', 'and', 'preferencebased', 'the', 'learner', 'picks', 'hypothesis', 'according', 'to', 'some', 'global', 'preference', 'inspired', 'by', 'human', 'teaching', 'we', 'propose', 'a', 'new', 'model', 'where', 'the', 'learner', 'picks', 'hypotheses', 'according', 'to', 'some', 'local', 'preference', 'defined', 'by', 'the', 'current', 'hypothesis', 'we', 'show', 'that', 'our', 'model', 'exhibits', 'several', 'desirable', 'properties', 'eg', 'adaptivity', 'plays', 'a', 'key', 'role', 'and', 'the', 'learners', 'transitions', 'over', 'hypotheses', 'are', 'smoothinterpretable', 'we', 'develop', 'efficient', 'teaching', 'algorithms', 'and', 'demonstrate', 'our', 'results', 'via', 'simulation', 'and', 'user', 'studies']] | [-0.02404939998862344, 0.05357087213273549, -0.07915544223071046, 0.07285969468333721, -0.15236680257226248, -0.193285142752127, 0.10785065138019151, 0.4072778825494614, -0.2585217842152905, -0.32585550600069235, 0.05230416993451929, -0.2353794079857295, -0.1818536668325068, 0.16368653579963025, -0.13256351646435047, 0.006150841982242048, 0.06897996410863105, 0.07572956364038963, -0.009951318625698459, -0.33942567140048185, 0.3362078791392128, 0.11116353132900178, 0.3168489085152172, -0.021255759066891866, 0.12102326613103787, 0.04944624290750413, -0.02782429705993119, -0.022179550754727034, -0.08539170088608823, 0.10758246322275027, 0.3047362124597295, 0.2300858723746797, 0.4516449458385398, -0.40948073317777817, -0.14760758382892544, 0.07055132219997737, 0.11855936717844227, 0.08918101869134622, -0.08349125683154134, -0.3028112913694253, 0.05151555598022641, -0.14976285899615754, -0.05303825325956875, -0.11791146433768937, -0.07719012840323478, -0.032729481177399405, -0.3346087893466005, -0.041297688426041805, 0.11528982151383509, 0.09917412437805599, -0.06895687277198534, -0.11538969131780195, 0.06849828750857122, 0.1800407372470395, 0.09038376982069886, 0.060471180510441105, 0.16588615808523371, -0.16691531737176393, -0.19675151446890496, 0.37051883763118754, -0.05485189376286344, -0.19348228520810973, 0.20816665830136696, -0.05673977688650836, -0.15493222901464573, 0.015557631883504135, 0.21079059208200857, 0.1033767298910419, -0.11581781846677416, 0.07533936075204829, -0.05337232280686334, 0.18134734577724484, -0.003932885082366948, -0.021197254447762822, 0.15577142922576148, 0.23704110786375068, 0.08385481884969133, 0.12445309217430774, -0.04432583798220698, -0.12260508611747115, -0.3049469112666774, -0.17983254636279666, -0.1658171577274206, -0.004274495547508775, -0.11626609075764273, -0.10130799709880663, 0.3826996292842163, 0.22472688196493046, 0.15999811897463687, 0.095657986601569, 0.28606200437215, 0.05725030549661164, 0.03701880612349199, 0.14705751783081464, 0.191238855940845, 0.016633513365657285, 0.13786254846682813, -0.15827571319615735, 0.16440385215081643, 0.07065657413261431] |
1,802.05191 | The fine structure of the finite-size effects for the spectrum of the
$OSp(n|2m)$ spin chain | In this paper we investigate the finite-size properties of the spectrum of
quantum spin chains with local spins taken to be the fundamental vector
representation of the $OSp(n|2m)$ superalgebra.
| cond-mat.stat-mech hep-th | in this paper we investigate the finitesize properties of the spectrum of quantum spin chains with local spins taken to be the fundamental vector representation of the ospn2m superalgebra | [['in', 'this', 'paper', 'we', 'investigate', 'the', 'finitesize', 'properties', 'of', 'the', 'spectrum', 'of', 'quantum', 'spin', 'chains', 'with', 'local', 'spins', 'taken', 'to', 'be', 'the', 'fundamental', 'vector', 'representation', 'of', 'the', 'ospn2m', 'superalgebra']] | [-0.16682319708966784, 0.15972180494905583, -0.053660422031368525, 0.0020296716455569758, -0.046895272830235105, -0.07855078195487815, -0.015870827487170964, 0.3561230232673032, -0.33482044256691423, -0.2188453338375049, 0.07006623089962107, -0.26252623268270064, -0.10797091946005821, 0.12475075559424502, 0.00823340458529336, 0.022865253500640392, 0.009872449986037932, 0.09967831242829561, -0.11236067109608225, -0.22205319774470159, 0.3400083575725148, 0.037896991054627245, 0.2656488244288734, 0.021839099803141186, 0.07822196784296206, 0.08509125417497541, 0.05746009333857468, -0.021773090453020165, -0.15104397871930683, 0.17778277789641703, 0.23101267038977571, 0.023823696388197795, 0.16116446669080428, -0.4460277424326965, -0.181662366060274, 0.1346718558509435, 0.16226312617904373, 0.15233867691962846, 0.021909682836849242, -0.3258638373975243, 0.09794393176811614, -0.1951139305518674, -0.15059016538517817, -0.07364021045421916, -0.02395439294299909, -0.03119365285549845, -0.1836037433573178, 0.08377049281261861, 0.13325535326397844, 0.08867815363087825, -0.07394420363873776, -0.0685976509370708, -0.003591684391722083, 0.17478698548594757, 0.05317243757391615, -0.01470073199431811, 0.10782211704645306, -0.14378064277947747, -0.16054678675053374, 0.36638855900881545, -0.01637516829318234, -0.20038338884478435, 0.13575434935877898, -0.20637735345267824, -0.1897993295320443, 0.01600414000651134, 0.17976885900965758, 0.09551770319896084, -0.16736733890138566, 0.13875682675279677, -0.03793961129018238, 0.13467833240117347, -0.04899382913884308, 0.13036474602163903, 0.25029478474919287, 0.1374538649937936, 0.02475155707049583, 0.19572619890511436, -0.08273876850892391, -0.1077292136282527, -0.2778512681169169, -0.2234449088906071, -0.21909293020144105, 0.12293784193960684, -0.07317730006096619, -0.14959767726915224, 0.47444888297468424, 0.1578243713426803, 0.207818513237206, 0.028712469851598144, 0.2182839410379529, 0.18525510327890515, 0.0836753701525075, 0.039498040469230285, 0.21340181997844151, 0.26735485311863677, 0.02634692212034549, -0.29973313571619137, -0.09164754786096248, 0.08376666846951204] |
1,802.05192 | Data Driven Charge Transfer Atlas Provides Topological View of
Electronic Structure Properties for Arbitrary Proteins Complexes | Due to the highly complex chemical structure of biomolecules, the extensive
understanding of the electronic information for proteomics can be challenging.
Here, we constructed a charge transfer database at residue level derived from
millions of electronic structure calculations among 20x20 possible amino acid
side-chains combinations, which were extracted from available high-quality
structures of thousands of protein complexes. Then, the data driven network
(D2Net) analysis was proposed to quickly identify the critical residue or
residue groups for any possible protein complex. As an initial evaluation, we
applied this model to scrutinize the charge transfer networks for two randomly
selected proteins, which highlighted the most critical residues with large node
degrees as network hubs. This work may provide us a promising computional
protocol for topologically understanding the electronic structure information
in the growing number of high-quality experimental proteins structures, with
minor computational costs.
| physics.chem-ph cond-mat.soft | due to the highly complex chemical structure of biomolecules the extensive understanding of the electronic information for proteomics can be challenging here we constructed a charge transfer database at residue level derived from millions of electronic structure calculations among 20x20 possible amino acid sidechains combinations which were extracted from available highquality structures of thousands of protein complexes then the data driven network d2net analysis was proposed to quickly identify the critical residue or residue groups for any possible protein complex as an initial evaluation we applied this model to scrutinize the charge transfer networks for two randomly selected proteins which highlighted the most critical residues with large node degrees as network hubs this work may provide us a promising computional protocol for topologically understanding the electronic structure information in the growing number of highquality experimental proteins structures with minor computational costs | [['due', 'to', 'the', 'highly', 'complex', 'chemical', 'structure', 'of', 'biomolecules', 'the', 'extensive', 'understanding', 'of', 'the', 'electronic', 'information', 'for', 'proteomics', 'can', 'be', 'challenging', 'here', 'we', 'constructed', 'a', 'charge', 'transfer', 'database', 'at', 'residue', 'level', 'derived', 'from', 'millions', 'of', 'electronic', 'structure', 'calculations', 'among', '20x20', 'possible', 'amino', 'acid', 'sidechains', 'combinations', 'which', 'were', 'extracted', 'from', 'available', 'highquality', 'structures', 'of', 'thousands', 'of', 'protein', 'complexes', 'then', 'the', 'data', 'driven', 'network', 'd2net', 'analysis', 'was', 'proposed', 'to', 'quickly', 'identify', 'the', 'critical', 'residue', 'or', 'residue', 'groups', 'for', 'any', 'possible', 'protein', 'complex', 'as', 'an', 'initial', 'evaluation', 'we', 'applied', 'this', 'model', 'to', 'scrutinize', 'the', 'charge', 'transfer', 'networks', 'for', 'two', 'randomly', 'selected', 'proteins', 'which', 'highlighted', 'the', 'most', 'critical', 'residues', 'with', 'large', 'node', 'degrees', 'as', 'network', 'hubs', 'this', 'work', 'may', 'provide', 'us', 'a', 'promising', 'computional', 'protocol', 'for', 'topologically', 'understanding', 'the', 'electronic', 'structure', 'information', 'in', 'the', 'growing', 'number', 'of', 'highquality', 'experimental', 'proteins', 'structures', 'with', 'minor', 'computational', 'costs']] | [-0.1337926570525659, 0.0705184648454763, -0.027130901608948727, 0.06704116788917287, -0.04931105114519596, -0.13521909254736134, 0.07809536409664102, 0.3795919681980324, -0.3029261527258703, -0.33199315486874964, 0.025434135934171667, -0.2968606470884489, -0.18495228367225666, 0.1665224028551685, 0.01552513978843178, 0.03545630337903276, 0.11357660853869415, 0.03911911837162084, 0.004690941206146298, -0.2124070113774256, 0.2792654107391302, 0.0960173758279, 0.27932609485661875, 0.07566317928555821, 0.06237522964781549, -0.010978064107309496, -0.014172923697125432, -0.0038387728605552445, -0.13037022180589183, 0.2094198355118611, 0.3258587012067437, 0.10054940535420819, 0.2506375351139078, -0.4680328330557261, -0.23394419773082648, 0.09700249952896099, 0.13969190366167042, 0.17611360128336986, -0.07256413428611787, -0.2653058341587894, 0.13863277586476344, -0.145686432792406, -0.08701935866847635, -0.13637589108963896, -0.00046695856643574576, 0.04231972192023282, -0.20636017044432395, 0.04270500719347703, -0.03794215969142637, 0.10607474137583008, -0.09087184781175373, -0.15952081869555904, -0.09323547734945481, 0.21038841693578952, 0.01295471771404014, 0.021559650881057938, 0.22462111067559037, -0.13269786736595313, -0.10055414616903623, 0.3639501606114209, 0.01784844898751804, -0.17467277401925196, 0.200846498950185, -0.08912566064723901, -0.19176750684356583, 0.18620168334538384, 0.1628164724313787, 0.12277388551405498, -0.19941549663822766, 0.004508217597114188, -0.007920916358541166, 0.219205121732583, 0.07699391304756448, 0.04162831429857761, 0.2186313179887033, 0.19569610729148346, 0.008388120128906199, 0.1418317076076554, -0.0870991159696132, -0.09234459762810729, -0.18122091123035977, -0.15189553615637125, -0.19458911344408988, 0.0829823438668557, -0.10215650452966137, -0.19875468323173534, 0.4170202833600342, 0.12581017891893032, 0.190496929991059, -0.0001777121581004134, 0.24177478808643563, -0.045663597729123595, 0.13830646560527385, 0.013976424520037004, 0.1276557176440422, 0.10544320967081668, 0.09052115779237023, -0.20130242372771526, 0.10887292056909896, 0.001804615297753896] |
1,802.05193 | Security Analysis and Enhancement of Model Compressed Deep Learning
Systems under Adversarial Attacks | DNN is presenting human-level performance for many complex intelligent tasks
in real-world applications. However, it also introduces ever-increasing
security concerns. For example, the emerging adversarial attacks indicate that
even very small and often imperceptible adversarial input perturbations can
easily mislead the cognitive function of deep learning systems (DLS). Existing
DNN adversarial studies are narrowly performed on the ideal software-level DNN
models with a focus on single uncertainty factor, i.e. input perturbations,
however, the impact of DNN model reshaping on adversarial attacks, which is
introduced by various hardware-favorable techniques such as hash-based weight
compression during modern DNN hardware implementation, has never been
discussed. In this work, we for the first time investigate the multi-factor
adversarial attack problem in practical model optimized deep learning systems
by jointly considering the DNN model-reshaping (e.g. HashNet based deep
compression) and the input perturbations. We first augment adversarial example
generating method dedicated to the compressed DNN models by incorporating the
software-based approaches and mathematical modeled DNN reshaping. We then
conduct a comprehensive robustness and vulnerability analysis of deep
compressed DNN models under derived adversarial attacks. A defense technique
named "gradient inhibition" is further developed to ease the generating of
adversarial examples thus to effectively mitigate adversarial attacks towards
both software and hardware-oriented DNNs. Simulation results show that
"gradient inhibition" can decrease the average success rate of adversarial
attacks from 87.99% to 4.77% (from 86.74% to 4.64%) on MNIST (CIFAR-10)
benchmark with marginal accuracy degradation across various DNNs.
| cs.LG cs.CR stat.ML | dnn is presenting humanlevel performance for many complex intelligent tasks in realworld applications however it also introduces everincreasing security concerns for example the emerging adversarial attacks indicate that even very small and often imperceptible adversarial input perturbations can easily mislead the cognitive function of deep learning systems dls existing dnn adversarial studies are narrowly performed on the ideal softwarelevel dnn models with a focus on single uncertainty factor ie input perturbations however the impact of dnn model reshaping on adversarial attacks which is introduced by various hardwarefavorable techniques such as hashbased weight compression during modern dnn hardware implementation has never been discussed in this work we for the first time investigate the multifactor adversarial attack problem in practical model optimized deep learning systems by jointly considering the dnn modelreshaping eg hashnet based deep compression and the input perturbations we first augment adversarial example generating method dedicated to the compressed dnn models by incorporating the softwarebased approaches and mathematical modeled dnn reshaping we then conduct a comprehensive robustness and vulnerability analysis of deep compressed dnn models under derived adversarial attacks a defense technique named gradient inhibition is further developed to ease the generating of adversarial examples thus to effectively mitigate adversarial attacks towards both software and hardwareoriented dnns simulation results show that gradient inhibition can decrease the average success rate of adversarial attacks from 8799 to 477 from 8674 to 464 on mnist cifar10 benchmark with marginal accuracy degradation across various dnns | [['dnn', 'is', 'presenting', 'humanlevel', 'performance', 'for', 'many', 'complex', 'intelligent', 'tasks', 'in', 'realworld', 'applications', 'however', 'it', 'also', 'introduces', 'everincreasing', 'security', 'concerns', 'for', 'example', 'the', 'emerging', 'adversarial', 'attacks', 'indicate', 'that', 'even', 'very', 'small', 'and', 'often', 'imperceptible', 'adversarial', 'input', 'perturbations', 'can', 'easily', 'mislead', 'the', 'cognitive', 'function', 'of', 'deep', 'learning', 'systems', 'dls', 'existing', 'dnn', 'adversarial', 'studies', 'are', 'narrowly', 'performed', 'on', 'the', 'ideal', 'softwarelevel', 'dnn', 'models', 'with', 'a', 'focus', 'on', 'single', 'uncertainty', 'factor', 'ie', 'input', 'perturbations', 'however', 'the', 'impact', 'of', 'dnn', 'model', 'reshaping', 'on', 'adversarial', 'attacks', 'which', 'is', 'introduced', 'by', 'various', 'hardwarefavorable', 'techniques', 'such', 'as', 'hashbased', 'weight', 'compression', 'during', 'modern', 'dnn', 'hardware', 'implementation', 'has', 'never', 'been', 'discussed', 'in', 'this', 'work', 'we', 'for', 'the', 'first', 'time', 'investigate', 'the', 'multifactor', 'adversarial', 'attack', 'problem', 'in', 'practical', 'model', 'optimized', 'deep', 'learning', 'systems', 'by', 'jointly', 'considering', 'the', 'dnn', 'modelreshaping', 'eg', 'hashnet', 'based', 'deep', 'compression', 'and', 'the', 'input', 'perturbations', 'we', 'first', 'augment', 'adversarial', 'example', 'generating', 'method', 'dedicated', 'to', 'the', 'compressed', 'dnn', 'models', 'by', 'incorporating', 'the', 'softwarebased', 'approaches', 'and', 'mathematical', 'modeled', 'dnn', 'reshaping', 'we', 'then', 'conduct', 'a', 'comprehensive', 'robustness', 'and', 'vulnerability', 'analysis', 'of', 'deep', 'compressed', 'dnn', 'models', 'under', 'derived', 'adversarial', 'attacks', 'a', 'defense', 'technique', 'named', 'gradient', 'inhibition', 'is', 'further', 'developed', 'to', 'ease', 'the', 'generating', 'of', 'adversarial', 'examples', 'thus', 'to', 'effectively', 'mitigate', 'adversarial', 'attacks', 'towards', 'both', 'software', 'and', 'hardwareoriented', 'dnns', 'simulation', 'results', 'show', 'that', 'gradient', 'inhibition', 'can', 'decrease', 'the', 'average', 'success', 'rate', 'of', 'adversarial', 'attacks', 'from', '8799', 'to', '477', 'from', '8674', 'to', '464', 'on', 'mnist', 'cifar10', 'benchmark', 'with', 'marginal', 'accuracy', 'degradation', 'across', 'various', 'dnns']] | [-0.0790599441828848, -0.008268674086200214, -0.025651443426344667, 0.10013953555070114, -0.08384439552656743, -0.2390633068642258, 0.04169321599212952, 0.42621699316982775, -0.25617040640150174, -0.3383407915684105, 0.0927147270564749, -0.25106733911788137, -0.2737479888205025, 0.22077845656821707, -0.16631670879171395, 0.18286798864176512, 0.10337665979652626, -0.0107454564715853, -0.02076474146060489, -0.32137464380533504, 0.3150389038433297, 0.10393256416198007, 0.3567813626576622, 0.005397966010750373, 0.09569994925397561, -0.059589611605091505, 0.009096992740157146, -0.038089255890623126, -0.030566039790427255, 0.12414675036458955, 0.32484423533194695, 0.2377801336540778, 0.37743422088502837, -0.4576040674548815, -0.2790126366885144, 0.09494228504731186, 0.1298921343064236, 0.13623556837502146, -0.0747346696776471, -0.37090597846819195, 0.1348945945635841, -0.2322793872586741, 0.014631916937113059, -0.1574337667953849, -0.04057411720952755, 0.011882229439597264, -0.2767057793641447, -0.014861811933762143, 0.09965881062260665, 0.08181438116286294, -0.03593910056236787, -0.1179553395892423, 0.01173555716273508, 0.09870564621411451, 0.0574505121849219, 0.03111213953586436, 0.2070607545887347, -0.19041028877371968, -0.13524260834552065, 0.29799236980963406, -0.05745561298803708, -0.1833027840392398, 0.1741657171950151, 0.07304523793389599, -0.16098656535770806, 0.08419335958892245, 0.3030425439835252, 0.09043886262763041, -0.12936711757680588, 0.015452856165425414, 0.032024458035075365, 0.18739461998099133, 0.06338456157592963, -0.007239015103795198, 0.1262443549706045, 0.27312162728244516, 0.011927286941438773, 0.19388006697311028, -0.13018378731794655, -0.08462579621045123, -0.17950367308495677, -0.029400159027662222, -0.1817666537582311, 0.017258875364018995, -0.09758848382203845, -0.13240219431757114, 0.38332098199665043, 0.24129320471156232, 0.19296754711158887, 0.11319245030345813, 0.43144791383988873, 0.012377428788468712, 0.11438231338343795, 0.12524155221347297, 0.23066161485719533, 0.01748233580894689, 0.11102380289132667, -0.14181027441635774, 0.15384319664955926, -0.011523599326493172] |
1,802.05194 | Moderate Magnetic Field Induced Large Exchange Bias Effect in
Ferrimagnetic 314-Sr3YCo4O10.5 Material | Herein, we report the appearance of a large exchange bias (EB) effect in a
moderate cooling field (cooling field, H$_{FC}$ = 1 kOe) for the
314-Sr3YCo4O10.5 material. The exchange bias has started to appear near room
temperature and reaches a maximum value of 5.5 kOe at 4 K. The existence of
ferrimagnetic clusters in the compensated host in this layered structure
originates the large exchange anisotropy. Remarkably, the observed value of
moderate magnetic field induced exchange bias field is extremely large in
comparison with material systems which are recognized to exhibit giant exchange
bias effect. In combination with the feasibility of room temperature
application, the appearance of large exchange bias in a moderate cooling field
exemplifying the present material system as a promising class of compounds for
designing coherent magnetic materials with huge exchange bias in low/moderate
magnetic field.
| cond-mat.str-el | herein we report the appearance of a large exchange bias eb effect in a moderate cooling field cooling field h_fc 1 koe for the 314sr3yco4o105 material the exchange bias has started to appear near room temperature and reaches a maximum value of 55 koe at 4 k the existence of ferrimagnetic clusters in the compensated host in this layered structure originates the large exchange anisotropy remarkably the observed value of moderate magnetic field induced exchange bias field is extremely large in comparison with material systems which are recognized to exhibit giant exchange bias effect in combination with the feasibility of room temperature application the appearance of large exchange bias in a moderate cooling field exemplifying the present material system as a promising class of compounds for designing coherent magnetic materials with huge exchange bias in lowmoderate magnetic field | [['herein', 'we', 'report', 'the', 'appearance', 'of', 'a', 'large', 'exchange', 'bias', 'eb', 'effect', 'in', 'a', 'moderate', 'cooling', 'field', 'cooling', 'field', 'h_fc', '1', 'koe', 'for', 'the', '314sr3yco4o105', 'material', 'the', 'exchange', 'bias', 'has', 'started', 'to', 'appear', 'near', 'room', 'temperature', 'and', 'reaches', 'a', 'maximum', 'value', 'of', '55', 'koe', 'at', '4', 'k', 'the', 'existence', 'of', 'ferrimagnetic', 'clusters', 'in', 'the', 'compensated', 'host', 'in', 'this', 'layered', 'structure', 'originates', 'the', 'large', 'exchange', 'anisotropy', 'remarkably', 'the', 'observed', 'value', 'of', 'moderate', 'magnetic', 'field', 'induced', 'exchange', 'bias', 'field', 'is', 'extremely', 'large', 'in', 'comparison', 'with', 'material', 'systems', 'which', 'are', 'recognized', 'to', 'exhibit', 'giant', 'exchange', 'bias', 'effect', 'in', 'combination', 'with', 'the', 'feasibility', 'of', 'room', 'temperature', 'application', 'the', 'appearance', 'of', 'large', 'exchange', 'bias', 'in', 'a', 'moderate', 'cooling', 'field', 'exemplifying', 'the', 'present', 'material', 'system', 'as', 'a', 'promising', 'class', 'of', 'compounds', 'for', 'designing', 'coherent', 'magnetic', 'materials', 'with', 'huge', 'exchange', 'bias', 'in', 'lowmoderate', 'magnetic', 'field']] | [-0.2264485062508303, 0.18757350665434977, -0.0019153845047680186, 0.019555376584535492, -0.08031342579702408, -0.11296850426793646, 0.07063639686299104, 0.3790358748862191, -0.27215876053228655, -0.3997093755135532, 0.058939568353440226, -0.27637275090947855, -0.06029222908717416, 0.19756139715387047, 0.05511853238910108, -0.08583918017307844, -0.010138360287194647, -0.0025895123510374964, -0.05953096353914589, -0.20865670583204038, 0.26941213275388104, 0.06214296557899455, 0.3175411885527223, 0.08304648074280362, 0.06741296024376746, 0.004282967725457103, 0.1161725795656607, 0.0878937217160402, -0.10150655238505672, 0.011355221355830402, 0.23779077341725283, -0.08056075078146772, 0.26563792627969046, -0.3463229098740746, -0.17452594432431986, 0.06614035087370533, 0.0979657218346855, 0.16829617412141112, -0.16960128211169778, -0.20718582789071233, 0.0727242604659884, -0.16537686926312745, -0.1308203810990295, -0.07715446258867707, 0.007408283156109974, 0.004010142176412046, -0.292544531134755, 0.13081815612017902, 0.03925184450482073, 0.16881473095974583, -0.0888723233844811, -0.17568275698731134, -0.014530678477218744, 0.07362390714029864, 0.061073316348483786, 0.07989780732896179, 0.18503504304509774, -0.1734588313556742, -0.060461301171659106, 0.3190076490110882, -0.12961206065922262, -0.008937908329672235, 0.15551672673181577, -0.20168993888450237, -0.08700462538570933, 0.19825062939815005, 0.169761412369553, 0.07894540180260425, -0.1586952065875213, 0.08632218652457917, 0.06180713719496613, 0.15951159969657003, 0.003916534379480735, 0.04761188785949558, 0.2700585176473182, 0.1876241411835722, 0.04273975480464287, 0.1719134890000158, -0.14273071859497577, -0.04611012412180357, -0.2277033889104667, -0.12689722983358317, -0.17466306741356247, 0.09091985292102703, -0.11251486580369922, -0.20292381875846974, 0.3427165532750009, 0.20432140033089502, 0.18885487478281207, -0.07110514605258633, 0.2563372399959275, 0.10435858550258939, 0.1376869018189181, 0.051686672884149146, 0.29940848664709313, 0.20998761067440844, 0.1552323636612581, -0.2616395771825303, 0.08784504574749222, -0.07965935710543658] |
1,802.05195 | F-theory models on K3 surfaces with various Mordell-Weil ranks
-constructions that use quadratic base change of rational elliptic surfaces | We constructed several families of elliptic K3 surfaces with Mordell-Weil
groups of ranks from 1 to 4. We studied F-theory compactifications on these
elliptic K3 surfaces times a K3 surface. Gluing pairs of identical rational
elliptic surfaces with nonzero Mordell-Weil ranks yields elliptic K3 surfaces,
the Mordell-Weil groups of which have nonzero ranks. The sum of the ranks of
the singularity type and the Mordell-Weil group of any rational elliptic
surface with a global section is 8. By utilizing this property, families of
rational elliptic surfaces with various nonzero Mordell-Weil ranks can be
obtained by choosing appropriate singularity types. Gluing pairs of these
rational elliptic surfaces yields families of elliptic K3 surfaces with various
nonzero Mordell-Weil ranks. We also determined the global structures of the
gauge groups that arise in F-theory compactifications on the resulting K3
surfaces times a K3 surface. $U(1)$ gauge fields arise in these
compactifications.
| hep-th | we constructed several families of elliptic k3 surfaces with mordellweil groups of ranks from 1 to 4 we studied ftheory compactifications on these elliptic k3 surfaces times a k3 surface gluing pairs of identical rational elliptic surfaces with nonzero mordellweil ranks yields elliptic k3 surfaces the mordellweil groups of which have nonzero ranks the sum of the ranks of the singularity type and the mordellweil group of any rational elliptic surface with a global section is 8 by utilizing this property families of rational elliptic surfaces with various nonzero mordellweil ranks can be obtained by choosing appropriate singularity types gluing pairs of these rational elliptic surfaces yields families of elliptic k3 surfaces with various nonzero mordellweil ranks we also determined the global structures of the gauge groups that arise in ftheory compactifications on the resulting k3 surfaces times a k3 surface u1 gauge fields arise in these compactifications | [['we', 'constructed', 'several', 'families', 'of', 'elliptic', 'k3', 'surfaces', 'with', 'mordellweil', 'groups', 'of', 'ranks', 'from', '1', 'to', '4', 'we', 'studied', 'ftheory', 'compactifications', 'on', 'these', 'elliptic', 'k3', 'surfaces', 'times', 'a', 'k3', 'surface', 'gluing', 'pairs', 'of', 'identical', 'rational', 'elliptic', 'surfaces', 'with', 'nonzero', 'mordellweil', 'ranks', 'yields', 'elliptic', 'k3', 'surfaces', 'the', 'mordellweil', 'groups', 'of', 'which', 'have', 'nonzero', 'ranks', 'the', 'sum', 'of', 'the', 'ranks', 'of', 'the', 'singularity', 'type', 'and', 'the', 'mordellweil', 'group', 'of', 'any', 'rational', 'elliptic', 'surface', 'with', 'a', 'global', 'section', 'is', '8', 'by', 'utilizing', 'this', 'property', 'families', 'of', 'rational', 'elliptic', 'surfaces', 'with', 'various', 'nonzero', 'mordellweil', 'ranks', 'can', 'be', 'obtained', 'by', 'choosing', 'appropriate', 'singularity', 'types', 'gluing', 'pairs', 'of', 'these', 'rational', 'elliptic', 'surfaces', 'yields', 'families', 'of', 'elliptic', 'k3', 'surfaces', 'with', 'various', 'nonzero', 'mordellweil', 'ranks', 'we', 'also', 'determined', 'the', 'global', 'structures', 'of', 'the', 'gauge', 'groups', 'that', 'arise', 'in', 'ftheory', 'compactifications', 'on', 'the', 'resulting', 'k3', 'surfaces', 'times', 'a', 'k3', 'surface', 'u1', 'gauge', 'fields', 'arise', 'in', 'these', 'compactifications']] | [-0.2570481632987188, 0.1325436733864449, -0.1261214958063352, 0.11005123596437075, -0.08113792220231246, -0.20489819162537823, -0.055045956846427276, 0.30680192757800623, -0.26690086495206766, -0.30562859056265773, 0.09680208511732367, -0.3218371289958422, -0.10511199532806673, 0.2199531391568205, -0.17260742251056474, 0.051119500758579454, -0.026103806543491176, 0.03549384112734146, -0.1757371988182107, -0.4758625258691609, 0.4856772186687669, -0.11828735483986502, 0.23741080129213907, 0.06778108541904068, 0.06164291845257017, 0.016322125948185252, 0.0143569121011407, -0.08140843831682326, -0.158977907058412, 0.23530206003861903, 0.3546978107376679, -0.09701963414035335, 0.0273581255932112, -0.3957382812152138, -0.21712668782502814, 0.24085082846215447, 0.0880603755327143, 0.05264108889103817, -0.06199013606827656, -0.18306060068976335, 0.06671183905564249, -0.12786102705679178, -0.22547143362493985, -0.08542442288740563, 0.0013017317538174826, 0.046289258339203186, -0.16893523469303004, -0.024005393914735208, 0.01700209723423688, 0.22396108711207588, -0.037414008441595106, -0.17950041542408635, -0.18543115920682968, 0.029738741760091805, 0.11758078829026655, -0.03357682390314703, 0.0815711267216987, -0.12372323052133308, -0.10518912384931527, 0.3317051831934903, -0.05166105121197934, -0.22003639350716825, 0.08985623728949577, -0.10210097764148314, -0.14647890588683957, 0.22221146386771187, 0.1416356741274531, 0.21780239281754285, 0.044871264892454084, 0.15542156837300108, -0.15366239401801313, 0.0894289896886393, 0.16882954846211784, -0.09611780441529746, 0.18232213937979494, 0.036104572705635045, 0.08029104456009746, 0.04048302221171734, -0.003360170906415914, -0.01461632497218513, -0.4354830081889255, -0.1302084242295776, -0.04901405348366982, 0.21384252067907034, -0.1545837597882751, -0.1481083821854554, 0.4525773372324939, -0.059718893272991014, 0.19983008592326595, 0.07901353399801017, 0.11762104342011986, 0.02834072442272225, 0.07509451448237775, 0.050258819612429, 0.11927877990308695, 0.18038624189982846, -0.10429588324906355, -0.14607284144644714, -0.10549323579156457, 0.2829825751156219] |
1,802.05196 | Generative Models for Spear Phishing Posts on Social Media | Historically, machine learning in computer security has prioritized defense:
think intrusion detection systems, malware classification, and botnet traffic
identification. Offense can benefit from data just as well. Social networks,
with their access to extensive personal data, bot-friendly APIs, colloquial
syntax, and prevalence of shortened links, are the perfect venues for spreading
machine-generated malicious content. We aim to discover what capabilities an
adversary might utilize in such a domain. We present a long short-term memory
(LSTM) neural network that learns to socially engineer specific users into
clicking on deceptive URLs. The model is trained with word vector
representations of social media posts, and in order to make a click-through
more likely, it is dynamically seeded with topics extracted from the target's
timeline. We augment the model with clustering to triage high value targets
based on their level of social engagement, and measure success of the LSTM's
phishing expedition using click-rates of IP-tracked links. We achieve state of
the art success rates, tripling those of historic email attack campaigns, and
outperform humans manually performing the same task.
| cs.CR cs.CY cs.LG stat.ML | historically machine learning in computer security has prioritized defense think intrusion detection systems malware classification and botnet traffic identification offense can benefit from data just as well social networks with their access to extensive personal data botfriendly apis colloquial syntax and prevalence of shortened links are the perfect venues for spreading machinegenerated malicious content we aim to discover what capabilities an adversary might utilize in such a domain we present a long shortterm memory lstm neural network that learns to socially engineer specific users into clicking on deceptive urls the model is trained with word vector representations of social media posts and in order to make a clickthrough more likely it is dynamically seeded with topics extracted from the targets timeline we augment the model with clustering to triage high value targets based on their level of social engagement and measure success of the lstms phishing expedition using clickrates of iptracked links we achieve state of the art success rates tripling those of historic email attack campaigns and outperform humans manually performing the same task | [['historically', 'machine', 'learning', 'in', 'computer', 'security', 'has', 'prioritized', 'defense', 'think', 'intrusion', 'detection', 'systems', 'malware', 'classification', 'and', 'botnet', 'traffic', 'identification', 'offense', 'can', 'benefit', 'from', 'data', 'just', 'as', 'well', 'social', 'networks', 'with', 'their', 'access', 'to', 'extensive', 'personal', 'data', 'botfriendly', 'apis', 'colloquial', 'syntax', 'and', 'prevalence', 'of', 'shortened', 'links', 'are', 'the', 'perfect', 'venues', 'for', 'spreading', 'machinegenerated', 'malicious', 'content', 'we', 'aim', 'to', 'discover', 'what', 'capabilities', 'an', 'adversary', 'might', 'utilize', 'in', 'such', 'a', 'domain', 'we', 'present', 'a', 'long', 'shortterm', 'memory', 'lstm', 'neural', 'network', 'that', 'learns', 'to', 'socially', 'engineer', 'specific', 'users', 'into', 'clicking', 'on', 'deceptive', 'urls', 'the', 'model', 'is', 'trained', 'with', 'word', 'vector', 'representations', 'of', 'social', 'media', 'posts', 'and', 'in', 'order', 'to', 'make', 'a', 'clickthrough', 'more', 'likely', 'it', 'is', 'dynamically', 'seeded', 'with', 'topics', 'extracted', 'from', 'the', 'targets', 'timeline', 'we', 'augment', 'the', 'model', 'with', 'clustering', 'to', 'triage', 'high', 'value', 'targets', 'based', 'on', 'their', 'level', 'of', 'social', 'engagement', 'and', 'measure', 'success', 'of', 'the', 'lstms', 'phishing', 'expedition', 'using', 'clickrates', 'of', 'iptracked', 'links', 'we', 'achieve', 'state', 'of', 'the', 'art', 'success', 'rates', 'tripling', 'those', 'of', 'historic', 'email', 'attack', 'campaigns', 'and', 'outperform', 'humans', 'manually', 'performing', 'the', 'same', 'task']] | [-0.09772826492079793, 0.025772427901206672, -0.04710523967108646, 0.10177823796808763, -0.19818614801760157, -0.23168014169421566, 0.13624616138783263, 0.4584921565080105, -0.25799115981397674, -0.35282782890270786, 0.07424597395516304, -0.3701436782938017, -0.1847982892352373, 0.15602059000940605, -0.13428826910324482, 0.05152418019268987, 0.08932987749671326, 0.10480297743078852, 0.04451115384053569, -0.36545580061325844, 0.29471641849302743, 0.07444542557742923, 0.3449326430848085, 0.021548266143559716, 0.0624932977233859, -0.009284861272114307, -0.07898197671517643, -0.06676212685022959, -0.05571724856083673, 0.1484260008518779, 0.3954056359348321, 0.27205196770211293, 0.3504508002322752, -0.4185227621996472, -0.21378064718568524, 0.08210390535464814, 0.12553021709061077, 0.12341127036475079, -0.018086431792759212, -0.4177222427557396, 0.11157574475306996, -0.2533811273169704, -0.015938693312332466, -0.11271406390682556, -0.0027154513288202673, 0.028180941355246833, -0.20768778346246108, -0.013537810230763022, 0.011639518053714203, 0.1307720030105651, -0.01952472553712987, -0.06398054747063894, -0.009351044304419829, 0.22856087943668976, 0.06908501267601021, 0.006041008197508893, 0.19972584147119982, -0.23259505277890766, -0.20747590714491643, 0.35710407008124556, -0.03917039458458529, -0.14778294442438109, 0.20064859504697757, 0.008700323440026232, -0.12981868027655277, 0.08943790290098594, 0.28985239540465, 0.0724326478057476, -0.17386102448434157, -0.08396383026123404, -0.02637630284677238, 0.23659203562859804, 0.0743762157386342, 0.011551011949006013, 0.19403550567898661, 0.26501831188689656, 0.0367118107996946, 0.0867337548332343, -0.0762833068418035, -0.057685771555000875, -0.13253786387517616, -0.09630319174395355, -0.16193090678263067, 0.043635034059217676, -0.07450765857517348, -0.1267454030823374, 0.3798769589805932, 0.2205388621322379, 0.13509932522212567, 0.10226266585579101, 0.3038793765888333, -0.052449980670136814, 0.12221079641858523, 0.1257492335249946, 0.13725478126569976, -0.04901472929300643, 0.20307797149397694, -0.1092727889312258, 0.1810785935662733, 0.0032325168214684223] |
1,802.05197 | Gorenstein flat modules with respect to duality pairs | Let $\mathcal{X}$ be a class of left $R$-modules, $\mathcal{Y}$ be a class of
right $R$-modules. In this paper, we introduce and study Gorenstein
$(\mathcal{X}, \mathcal{Y})$-flat modules as a common generalization of some
known modules such as Gorenstein flat modules \cite{EJT93}, Gorenstein $n$-flat
modules \cite{SUU14}, Gorenstein $\mathcal{B}$-flat modules \cite{EIP17},
Gorenstein AC-flat modules \cite{BEI17}, $\Omega$-Gorenstein flat modules
\cite{EJ00} and so on. We show that the class of all Gorenstein $(\mathcal{X},
\mathcal{Y})$-flat modules have a strong stability. In particular, when
$(\mathcal{X}, \mathcal{Y})$ is a perfect (symmetric) duality pair, we give
some functorial descriptions of Gorenstein $(\mathcal{X}, \mathcal{Y})$-flat
dimension, and construct a hereditary abelian model structure on $R$-Mod whose
cofibrant objects are exactly the Gorenstein $(\mathcal{X}, \mathcal{Y})$-flat
modules. These results unify the corresponding results of the aforementioned
modules.
| math.RT | let mathcalx be a class of left rmodules mathcaly be a class of right rmodules in this paper we introduce and study gorenstein mathcalx mathcalyflat modules as a common generalization of some known modules such as gorenstein flat modules citeejt93 gorenstein nflat modules citesuu14 gorenstein mathcalbflat modules citeeip17 gorenstein acflat modules citebei17 omegagorenstein flat modules citeej00 and so on we show that the class of all gorenstein mathcalx mathcalyflat modules have a strong stability in particular when mathcalx mathcaly is a perfect symmetric duality pair we give some functorial descriptions of gorenstein mathcalx mathcalyflat dimension and construct a hereditary abelian model structure on rmod whose cofibrant objects are exactly the gorenstein mathcalx mathcalyflat modules these results unify the corresponding results of the aforementioned modules | [['let', 'mathcalx', 'be', 'a', 'class', 'of', 'left', 'rmodules', 'mathcaly', 'be', 'a', 'class', 'of', 'right', 'rmodules', 'in', 'this', 'paper', 'we', 'introduce', 'and', 'study', 'gorenstein', 'mathcalx', 'mathcalyflat', 'modules', 'as', 'a', 'common', 'generalization', 'of', 'some', 'known', 'modules', 'such', 'as', 'gorenstein', 'flat', 'modules', 'citeejt93', 'gorenstein', 'nflat', 'modules', 'citesuu14', 'gorenstein', 'mathcalbflat', 'modules', 'citeeip17', 'gorenstein', 'acflat', 'modules', 'citebei17', 'omegagorenstein', 'flat', 'modules', 'citeej00', 'and', 'so', 'on', 'we', 'show', 'that', 'the', 'class', 'of', 'all', 'gorenstein', 'mathcalx', 'mathcalyflat', 'modules', 'have', 'a', 'strong', 'stability', 'in', 'particular', 'when', 'mathcalx', 'mathcaly', 'is', 'a', 'perfect', 'symmetric', 'duality', 'pair', 'we', 'give', 'some', 'functorial', 'descriptions', 'of', 'gorenstein', 'mathcalx', 'mathcalyflat', 'dimension', 'and', 'construct', 'a', 'hereditary', 'abelian', 'model', 'structure', 'on', 'rmod', 'whose', 'cofibrant', 'objects', 'are', 'exactly', 'the', 'gorenstein', 'mathcalx', 'mathcalyflat', 'modules', 'these', 'results', 'unify', 'the', 'corresponding', 'results', 'of', 'the', 'aforementioned', 'modules']] | [-0.17886678235088826, -0.045503704617887795, -0.026503607618990316, 0.11826125362559277, -0.052976459442802215, -0.29564414534936934, -0.1398859490198279, 0.3894332576887447, -0.43033548961041357, -0.06833198366240606, 0.1027900783497715, -0.2075564903559304, -0.1283561278451547, 0.12558554001778616, -0.24914193063770898, -0.10790195296510678, 0.0719968088933838, 0.09243763089101731, -0.06664047978755806, -0.3919427500384226, 0.45746494373384894, -0.018491652833313502, 0.24859781729198305, -0.0011297721090969169, 0.1824220340002422, 0.0011701315500530875, 0.017605606533054794, 0.042000132747886686, -0.24780206109365074, 0.10754816190676153, 0.4043902839228761, 0.05558959977161296, 0.18440906493924558, -0.3289041195941322, -0.03242825595818523, 0.2917465886752661, 0.1360606171760342, -0.039021249535736165, -0.0092573338873027, -0.2306678817693551, 0.1743169831104201, -0.26905501337268023, -0.10567970168698548, -0.06184930807496069, 0.058643716414842534, 0.020404452925641872, -0.2502009947339128, -0.045393673292196846, 0.10814759710083614, 0.14251009982234325, -0.1006920708092947, -0.060767525580062084, -0.1368781080461663, 0.010961386220805551, -0.15385118298557343, -0.03601104896633001, 0.09177974462039581, -0.12419236603803432, -0.16095046431389676, 0.29284757822986784, -0.04128318775186957, -0.25173831931414414, 0.15575513277915032, -0.21614951648976372, -0.10213560605139918, 0.09366607443750405, -0.03457196870771777, 0.19985138271551797, -0.012957511016900432, 0.2659336692020649, -0.24380950257964745, 0.020981208236395, 0.09765212105962784, 0.11502178099804691, 0.15310147683284864, 0.14883709427540606, 0.02647273725548274, 0.14015605901524486, 0.03636045039028806, 0.09419786694905713, -0.39651498718171563, -0.22542513359901534, -0.0477864858430239, 0.1679007375257984, -0.09677489232548274, -0.1714312271880252, 0.4602767651736298, 0.08591812391014096, 0.19954518737083599, 0.21531140313976826, 0.19644495234394274, -0.10976849720390718, 0.07084707328032296, 0.04841230103370397, 0.07328064398724633, 0.2720021552273205, -0.07891786336984892, 0.012210137456334626, -0.004147888693426337, 0.24573401471271233] |
1,802.05198 | ICN enabling CoAP Extensions for IP based IoT devices | The Constrained Application Protocol (CoAP) and its extensions, such as
observe and group communication, offer the potential for developing novel IoT
applications. However, a full-fledged CoAP-based application requires
delay-tolerant communication and support for multicast: since these properties
cannot be easily provided by existing IP networks, developers cannot take full
advantage of CoAP, preferring to use HTTP instead. In this demo we show how
proxying CoAP traffic over an ICN network can unleash the full potential of
CoAP, simultaneously shifting overhead and complexity from the (constrained)
endpoints to the network.
| cs.NI | the constrained application protocol coap and its extensions such as observe and group communication offer the potential for developing novel iot applications however a fullfledged coapbased application requires delaytolerant communication and support for multicast since these properties cannot be easily provided by existing ip networks developers cannot take full advantage of coap preferring to use http instead in this demo we show how proxying coap traffic over an icn network can unleash the full potential of coap simultaneously shifting overhead and complexity from the constrained endpoints to the network | [['the', 'constrained', 'application', 'protocol', 'coap', 'and', 'its', 'extensions', 'such', 'as', 'observe', 'and', 'group', 'communication', 'offer', 'the', 'potential', 'for', 'developing', 'novel', 'iot', 'applications', 'however', 'a', 'fullfledged', 'coapbased', 'application', 'requires', 'delaytolerant', 'communication', 'and', 'support', 'for', 'multicast', 'since', 'these', 'properties', 'can', 'not', 'be', 'easily', 'provided', 'by', 'existing', 'ip', 'networks', 'developers', 'can', 'not', 'take', 'full', 'advantage', 'of', 'coap', 'preferring', 'to', 'use', 'http', 'instead', 'in', 'this', 'demo', 'we', 'show', 'how', 'proxying', 'coap', 'traffic', 'over', 'an', 'icn', 'network', 'can', 'unleash', 'the', 'full', 'potential', 'of', 'coap', 'simultaneously', 'shifting', 'overhead', 'and', 'complexity', 'from', 'the', 'constrained', 'endpoints', 'to', 'the', 'network']] | [-0.17756562835226455, -0.0068892656846502275, -0.04043934908307468, 0.025666247084478122, -0.14811460364402995, -0.2239839745271537, 0.11093853212530828, 0.4192079716258579, -0.32744743214506244, -0.30050634460316766, 0.1420105053926818, -0.20989717519065987, -0.16311777169919675, 0.20986214278058873, -0.13066525441180502, 0.06361573688207298, 0.045118464591602486, 0.011075256019830703, -0.014679357606089778, -0.27089306574521793, 0.2605356070937382, 0.048838446744614177, 0.31870154147812474, 0.1287850562327852, 0.025660180993792085, 0.0474374549722092, 0.0025585578185402685, -0.010366097157303657, -0.04962168025473754, 0.13194257485576802, 0.32442377801570627, 0.2486182407786449, 0.308098854828212, -0.4864795058137841, -0.26884940017221703, 0.09472114547259278, 0.22604300373544295, 0.08359968763672643, -0.05929687561260329, -0.31418935097754, 0.1359247627409382, -0.2967900762748387, -0.08241641844829752, -0.10715811613740192, -0.04792402193027859, 0.040449365478060724, -0.2630482825347119, -0.06308545628045169, -0.05507914496896168, 0.02984099503244377, 0.008557247700324903, -0.044576101010251376, -0.016504695902888975, 0.18846031853463502, -0.018015938664838256, -0.009024967169130428, 0.13794064082515736, -0.10714370805330367, -0.15239638522939963, 0.3943902514874935, 0.001566198562634074, -0.155850858003315, 0.17591108191344473, 0.03443388241964082, -0.1180241721837471, 0.07232741160421735, 0.20985993002023962, 0.033534072080834046, -0.16713307976929678, 0.09441767489899777, 0.025628734830146035, 0.16844699441765745, 0.022997505003069012, 0.0940832108569642, 0.17039290673306418, 0.21724695121455523, 0.1451135847122512, 0.09338341630193302, -0.025868227291438315, -0.10094106066583966, -0.23578441998817853, -0.18990214097106622, -0.17147300348927577, 0.018769906063163137, -0.08561664669606317, -0.09682247150275443, 0.38833131966077616, 0.2149766580770827, 0.12279746796314915, 0.13510748771950604, 0.40356366611603234, 0.019439105201874755, 0.1786239652428776, 0.17419429453503754, 0.15326407713194687, -0.014461037581269112, 0.20403066324458147, -0.13365028252980363, 0.0796357735292986, -0.0411489177805682] |
1,802.05199 | Exciting Implications of LHC Higgs Boson Data | Naively, the LHC Higgs boson looks like a Standard Model Higgs boson, with no
guidance to physics beyond the Standard Model, as has often been remarked. The
data show that what was discovered is the true Higgs boson. If one includes the
full information available, experimental and theoretical, there are actually
four significant clues implied by data. They point toward a supersymmetric
two-doublet decoupling theory, and a hierarchy problem solution via TeV scale
supersymmetry. That in turn suggests an underlying compactified string/M theory
with a de Sitter vacuum, so we can be confident that the low scale model has an
ultraviolet completion.
| hep-ph hep-ex hep-th | naively the lhc higgs boson looks like a standard model higgs boson with no guidance to physics beyond the standard model as has often been remarked the data show that what was discovered is the true higgs boson if one includes the full information available experimental and theoretical there are actually four significant clues implied by data they point toward a supersymmetric twodoublet decoupling theory and a hierarchy problem solution via tev scale supersymmetry that in turn suggests an underlying compactified stringm theory with a de sitter vacuum so we can be confident that the low scale model has an ultraviolet completion | [['naively', 'the', 'lhc', 'higgs', 'boson', 'looks', 'like', 'a', 'standard', 'model', 'higgs', 'boson', 'with', 'no', 'guidance', 'to', 'physics', 'beyond', 'the', 'standard', 'model', 'as', 'has', 'often', 'been', 'remarked', 'the', 'data', 'show', 'that', 'what', 'was', 'discovered', 'is', 'the', 'true', 'higgs', 'boson', 'if', 'one', 'includes', 'the', 'full', 'information', 'available', 'experimental', 'and', 'theoretical', 'there', 'are', 'actually', 'four', 'significant', 'clues', 'implied', 'by', 'data', 'they', 'point', 'toward', 'a', 'supersymmetric', 'twodoublet', 'decoupling', 'theory', 'and', 'a', 'hierarchy', 'problem', 'solution', 'via', 'tev', 'scale', 'supersymmetry', 'that', 'in', 'turn', 'suggests', 'an', 'underlying', 'compactified', 'stringm', 'theory', 'with', 'a', 'de', 'sitter', 'vacuum', 'so', 'we', 'can', 'be', 'confident', 'that', 'the', 'low', 'scale', 'model', 'has', 'an', 'ultraviolet', 'completion']] | [-0.0395707021576955, 0.18121289665492335, -0.13091465705713512, 0.21232835119978213, -0.13200577356916504, -0.21974749590598924, -0.009386274796983628, 0.3407316499312098, -0.21932358061438242, -0.2983461723105945, 0.11793568026954673, -0.2760167150397548, -0.10437827235927769, 0.15007345924637847, -0.03418563596685143, 0.06578134560007967, 0.08116764248823564, 0.050471732977266405, -0.03500924817875356, -0.2753477838146044, 0.2787440223025852, 0.09241060341260962, 0.24768513909029757, 0.04128655337491164, 0.09894468112821307, -0.003653635983081425, -0.0021867676291103455, -0.03882525721564889, -0.11097348160582637, 0.07884496570406162, 0.2097839155627013, 0.14423612458403132, 0.2033724232540265, -0.3756611146507602, -0.21773286490682878, 0.14521585615790067, 0.16635725665928833, 0.15288011926938505, -0.08357999115205351, -0.30517502461432244, 0.09426090405801968, -0.18783148265370697, -0.13469344687502027, -0.0555246450605017, -0.048073246493146926, -0.16905853545804525, -0.26827171933837235, 0.046306321366322595, -0.017356152390586396, 0.03809224622433677, -0.007781259726970365, -0.11197185081055425, -0.09099259348780227, 0.022039298232936978, 0.1525659807438405, 0.06769864542715653, 0.13399155954282513, -0.2009616982575287, -0.18033590962352486, 0.40781473095400955, -0.09267129276778695, -0.15547195094518876, 0.18548203033039018, -0.15137810455452577, -0.17452658240240543, 0.13375420532390184, 0.08413639532712598, 0.048985104316242915, -0.15913216736825073, 0.23921244079389783, -0.08639826165402636, 0.2222243779964914, 0.028938054200718363, 0.040779626059720256, 0.2923935918575701, 0.19067781960920377, 0.03838336794618882, 0.026367534822830017, -0.033317431102178115, -0.12008929755264784, -0.38790999703547535, -0.12486173885226176, -0.0860871677674974, 0.07055476230030477, -0.08522267332020919, -0.1220690851172834, 0.31603859611512986, 0.1565535845846741, 0.23341786173199686, 0.00032927753750746155, 0.24552900572398714, 0.09794764231728371, 0.11060681091804131, 0.04575828137332756, 0.34703075742422074, 0.04555215419032702, 0.12942802748533294, -0.13224940725565687, -0.020791463133897268, 0.09825999061485716] |
1,802.052 | Perfect shuffling by lazy swaps | We characterize the minimum-length sequences of independent lazy simple
transpositions whose composition is a uniformly random permutation. For every
reduced word of the reverse permutation there is exactly one valid way to
assign probabilities to the transpositions. It is an open problem to determine
the minimum length of such a sequence when the simplicity condition is dropped.
| math.PR math.CO | we characterize the minimumlength sequences of independent lazy simple transpositions whose composition is a uniformly random permutation for every reduced word of the reverse permutation there is exactly one valid way to assign probabilities to the transpositions it is an open problem to determine the minimum length of such a sequence when the simplicity condition is dropped | [['we', 'characterize', 'the', 'minimumlength', 'sequences', 'of', 'independent', 'lazy', 'simple', 'transpositions', 'whose', 'composition', 'is', 'a', 'uniformly', 'random', 'permutation', 'for', 'every', 'reduced', 'word', 'of', 'the', 'reverse', 'permutation', 'there', 'is', 'exactly', 'one', 'valid', 'way', 'to', 'assign', 'probabilities', 'to', 'the', 'transpositions', 'it', 'is', 'an', 'open', 'problem', 'to', 'determine', 'the', 'minimum', 'length', 'of', 'such', 'a', 'sequence', 'when', 'the', 'simplicity', 'condition', 'is', 'dropped']] | [-0.1289143876515721, 0.196363203548428, -0.04619361672615796, 0.07819526084584363, -0.07453043709852193, -0.16435241182089635, 0.10586809399210963, 0.39341582058471414, -0.4114007496095279, -0.21150266451009533, 0.09657702492876795, -0.2517335639384232, -0.10051825684250186, 0.13981430467806363, -0.12015467704878303, 0.048017293633484656, 0.08391613908634897, 0.14742484656080865, -0.04081865243221584, -0.29103013582266213, 0.2583419757061883, 0.013417162376929793, 0.228935823530743, -0.018667273640044425, 0.11267476941442542, 0.022980570082405682, -0.010678091388718601, -0.00024916597217190686, -0.11746432174307604, 0.06233041022144454, 0.23702286551461407, 0.2063563283206844, 0.2655655497260261, -0.34579307965580947, -0.11925795739680006, 0.1906237917004578, 0.11882950417828142, 0.11378082306647118, 0.011099079852564293, -0.19562334016684377, 0.1967528788617959, -0.1259457522639678, -0.11674929596483707, 0.036339971187867616, 0.11118728870101142, -0.009548361805316648, -0.3170626413632642, -0.02128501818923835, 0.11717842960436094, 0.02465883416956977, 0.034996341864921544, -0.0951883403682395, 0.00946009734220672, 0.20842044035701915, 0.02336028546683098, 0.07478037577024416, 0.08126068257281491, -0.0385513604422541, -0.13212793467468337, 0.3987031925077501, 0.020335576733933727, -0.2709755294694843, 0.12489033269842989, -0.10316798234717887, -0.1664459502259106, 0.12942749377045976, 0.04040835655637478, 0.1330271840275249, -0.16357941279854635, 0.07538802511663291, -0.14011255419698723, 0.1721807925843454, 0.1317105056031754, -0.02282799826117984, 0.1702780312482725, 0.12451712683807209, 0.15667453002217308, 0.20077123961068297, 0.019175320079452114, -0.040778872814323554, -0.30098432111308765, -0.1613626386643502, -0.23732922124888814, 0.06461633211655314, -0.13261093953297587, -0.26989384374597614, 0.401563442295842, 0.12247718264463178, 0.1827731255539938, 0.11749749089868967, 0.2269104627990409, 0.17135803272392144, 0.06840679490031969, 0.09994938190242178, 0.06164027048323892, 0.17362370382250988, -0.05904785241408829, -0.1933013208357519, 0.11699276727117729, 0.14291555808628337] |
1,802.05201 | Exact Correlators on the Wilson Loop in $\mathcal{N}=4$ SYM:
Localization, Defect CFT, and Integrability | We compute a set of correlation functions of operator insertions on the 1/8
BPS Wilson loop in $\mathcal{N}=4$ SYM by employing supersymmetric
localization, OPE and the Gram-Schmidt orthogonalization. These correlators
exhibit a simple determinant structure, are position-independent and form a
topological subsector, but depend nontrivially on the 't Hooft coupling and the
rank of the gauge group. When applied to the 1/2 BPS circular (or straight)
Wilson loop, our results provide an infinite family of exact defect CFT data,
including the structure constants of protected defect primaries of arbitrary
length inserted on the loop. At strong coupling, we show precise agreement with
a direct calculation using perturbation theory around the AdS$_2$ string
worldsheet. We also explain the connection of our results to the "generalized
Bremsstrahlung functions" previously computed from integrability techniques,
reproducing the known results in the planar limit as well as obtaining some of
their finite N generalizations. Furthermore, we show that the correlators at
large N can be recast as simple integrals of products of polynomials (known as
Q-functions) that appear in the Quantum Spectral Curve approach. This suggests
an interesting interplay between localization, defect CFT and integrability.
| hep-th | we compute a set of correlation functions of operator insertions on the 18 bps wilson loop in mathcaln4 sym by employing supersymmetric localization ope and the gramschmidt orthogonalization these correlators exhibit a simple determinant structure are positionindependent and form a topological subsector but depend nontrivially on the t hooft coupling and the rank of the gauge group when applied to the 12 bps circular or straight wilson loop our results provide an infinite family of exact defect cft data including the structure constants of protected defect primaries of arbitrary length inserted on the loop at strong coupling we show precise agreement with a direct calculation using perturbation theory around the ads_2 string worldsheet we also explain the connection of our results to the generalized bremsstrahlung functions previously computed from integrability techniques reproducing the known results in the planar limit as well as obtaining some of their finite n generalizations furthermore we show that the correlators at large n can be recast as simple integrals of products of polynomials known as qfunctions that appear in the quantum spectral curve approach this suggests an interesting interplay between localization defect cft and integrability | [['we', 'compute', 'a', 'set', 'of', 'correlation', 'functions', 'of', 'operator', 'insertions', 'on', 'the', '18', 'bps', 'wilson', 'loop', 'in', 'mathcaln4', 'sym', 'by', 'employing', 'supersymmetric', 'localization', 'ope', 'and', 'the', 'gramschmidt', 'orthogonalization', 'these', 'correlators', 'exhibit', 'a', 'simple', 'determinant', 'structure', 'are', 'positionindependent', 'and', 'form', 'a', 'topological', 'subsector', 'but', 'depend', 'nontrivially', 'on', 'the', 't', 'hooft', 'coupling', 'and', 'the', 'rank', 'of', 'the', 'gauge', 'group', 'when', 'applied', 'to', 'the', '12', 'bps', 'circular', 'or', 'straight', 'wilson', 'loop', 'our', 'results', 'provide', 'an', 'infinite', 'family', 'of', 'exact', 'defect', 'cft', 'data', 'including', 'the', 'structure', 'constants', 'of', 'protected', 'defect', 'primaries', 'of', 'arbitrary', 'length', 'inserted', 'on', 'the', 'loop', 'at', 'strong', 'coupling', 'we', 'show', 'precise', 'agreement', 'with', 'a', 'direct', 'calculation', 'using', 'perturbation', 'theory', 'around', 'the', 'ads_2', 'string', 'worldsheet', 'we', 'also', 'explain', 'the', 'connection', 'of', 'our', 'results', 'to', 'the', 'generalized', 'bremsstrahlung', 'functions', 'previously', 'computed', 'from', 'integrability', 'techniques', 'reproducing', 'the', 'known', 'results', 'in', 'the', 'planar', 'limit', 'as', 'well', 'as', 'obtaining', 'some', 'of', 'their', 'finite', 'n', 'generalizations', 'furthermore', 'we', 'show', 'that', 'the', 'correlators', 'at', 'large', 'n', 'can', 'be', 'recast', 'as', 'simple', 'integrals', 'of', 'products', 'of', 'polynomials', 'known', 'as', 'qfunctions', 'that', 'appear', 'in', 'the', 'quantum', 'spectral', 'curve', 'approach', 'this', 'suggests', 'an', 'interesting', 'interplay', 'between', 'localization', 'defect', 'cft', 'and', 'integrability']] | [-0.13610854051443502, 0.14873506775092163, -0.0634025391387312, 0.11470020770181069, -0.04628892431501299, -0.13918648328338015, 0.015531175545000128, 0.35312501766081705, -0.20465983212435324, -0.2470918858227761, 0.09589096016042228, -0.28637857819956386, -0.17935373585205525, 0.16372335148656642, -0.003640519455075264, 0.062169929863394875, 0.04134083239876322, 0.07609626550524569, -0.1328105650793173, -0.23696677923802972, 0.3237518029017864, 0.010013944232885383, 0.2573436384236342, 0.09999443219827586, 0.06555795143909851, 0.03922889482622084, -0.007674802087345406, 0.008989184148805706, -0.10278708106374038, 0.13396176443233057, 0.21853967945958414, 0.03483705583126529, 0.091585112039588, -0.4308689514763261, -0.16846172215515062, 0.043829473502639875, 0.20449859631787004, 0.10692989856409105, 0.012210667518727285, -0.2659249360354519, 0.048986628636913866, -0.163719637750795, -0.1780107328723381, -0.11655612283533341, -0.013424502876219584, -0.05732424158700987, -0.26552857350815384, 0.06048829505621382, 0.0162854046113544, 0.05811295949020668, -0.03357894606520667, -0.10764715738324938, -0.05459129546131743, 0.13177197563881668, 0.06272318917770846, 0.047094729873596836, 0.11262532734652173, -0.1454733246226648, -0.17236992265802417, 0.31567211233563475, -0.07222266836692334, -0.20222305754983896, 0.14164862257832858, -0.17412204676993975, -0.1768139349590791, 0.09313203955312738, 0.09081050338297102, 0.16270026416582128, -0.08843549439954682, 0.17904753562822742, -0.07406680658092037, 0.1169540212011749, 0.12681293525536985, 0.06089460235299683, 0.20872737771561858, 0.0384351124876718, 0.03645674077561125, 0.16956713592057657, -0.017695681448094545, -0.12130703080666104, -0.39502032824644917, -0.11743593705560718, -0.169356098045644, 0.11320495059664705, -0.17170012453831365, -0.240295767259637, 0.37404206658002775, 0.10522000971495321, 0.23177564705378914, 0.10133008157442275, 0.18934585928034625, 0.14112785083898893, 0.11309103653888758, 0.06290348293627367, 0.20121268410875928, 0.18432132267380918, 0.0527303333271687, -0.2748452125981107, -0.066520038276825, 0.19321646247908097] |
1,802.05202 | Integrability of Exceptional Hydrodynamic Type Systems | In this paper we consider non-diagonalisable hydrodynamic type systems
integrable by the Extended Hodograph Method. We restrict our consideration to
non-diagonalisable hydrodynamic reductions of the Mikhalev equation. We show
that families of these hydrodynamic type systems are reducible to the Heat
hierarchy. Then we construct new particular explicit solutions for the Mikhalev
equation.
| nlin.SI | in this paper we consider nondiagonalisable hydrodynamic type systems integrable by the extended hodograph method we restrict our consideration to nondiagonalisable hydrodynamic reductions of the mikhalev equation we show that families of these hydrodynamic type systems are reducible to the heat hierarchy then we construct new particular explicit solutions for the mikhalev equation | [['in', 'this', 'paper', 'we', 'consider', 'nondiagonalisable', 'hydrodynamic', 'type', 'systems', 'integrable', 'by', 'the', 'extended', 'hodograph', 'method', 'we', 'restrict', 'our', 'consideration', 'to', 'nondiagonalisable', 'hydrodynamic', 'reductions', 'of', 'the', 'mikhalev', 'equation', 'we', 'show', 'that', 'families', 'of', 'these', 'hydrodynamic', 'type', 'systems', 'are', 'reducible', 'to', 'the', 'heat', 'hierarchy', 'then', 'we', 'construct', 'new', 'particular', 'explicit', 'solutions', 'for', 'the', 'mikhalev', 'equation']] | [-0.15706440764215757, 0.03379799516977004, -0.0601569482142914, 0.10311402936404536, -0.10985127866338447, -0.1412047836402396, -0.029235343183039355, 0.29273931001190023, -0.3199240375521048, -0.2182397885107488, 0.09756035917825154, -0.26477793999892696, -0.19597769929271824, 0.19638026983670467, -0.05127058986504123, 0.03641664815785469, 0.09580631752691741, -0.02123414394928951, -0.12932651375314957, -0.2625744917104899, 0.408761603318436, -0.06885132119762448, 0.1950738556893929, -0.025098827474240987, 0.132716833200868, -0.042393098044964786, -0.019580931323668303, -0.0014906392063734667, -0.23371861109420555, 0.09488914718078274, 0.22563603126777793, 0.04293704090885959, 0.17082514641982205, -0.41699412605672515, -0.23849230704231644, 0.1524530693115491, 0.18265063381525423, 0.19357360971494103, -0.021612678144900303, -0.24913123290423514, 0.06587564125042057, -0.22812574398967456, -0.20004047392779645, -0.1100424958287545, 0.015901918224287482, 0.09583714163317433, -0.22120570584709914, 0.10563659032736465, 0.13868611467615613, -0.011269154624556596, -0.1281742335797973, -0.06856484308768555, 0.001016727767287279, 0.03092234290011649, -0.010849317436914821, -0.07112464934306324, 0.007241219387583013, -0.09424866876951507, -0.066498621779863, 0.3629678081861644, -0.06270227168317673, -0.2977176453777642, 0.19864852136036135, -0.09488079667899688, -0.19753800363297452, 0.0941846519357191, 0.21017144647655342, 0.1231447270596927, -0.184540686355728, 0.11055706960658701, -0.11006030965737014, 0.11756422245910145, 0.03826949656677415, -0.03564109304427819, 0.13004764770421218, 0.1254023617124712, 0.007846962361824963, 0.1694600539949705, 0.01746901570608453, -0.10394467887872795, -0.3544804004003417, -0.16597414124572543, -0.07795710232600851, 0.10380561621683948, -0.054881979298408864, -0.13664710382878217, 0.3666576397657957, 0.2033485785688994, 0.07515136117361626, 0.1198548118865012, 0.18303120509668622, 0.19011155805190288, 0.015431778523016651, 0.07605558094340113, 0.19326949105510172, 0.12125312547278502, 0.11086133027554683, -0.26341658926410777, -0.10398849229578737, 0.21051004412144703] |
1,802.05203 | Fully Convolutional Network Ensembles for White Matter Hyperintensities
Segmentation in MR Images | White matter hyperintensities (WMH) are commonly found in the brains of
healthy elderly individuals and have been associated with various neurological
and geriatric disorders. In this paper, we present a study using deep fully
convolutional network and ensemble models to automatically detect such WMH
using fluid attenuation inversion recovery (FLAIR) and T1 magnetic resonance
(MR) scans. The algorithm was evaluated and ranked 1 st in the WMH Segmentation
Challenge at MICCAI 2017. In the evaluation stage, the implementation of the
algorithm was submitted to the challenge organizers, who then independently
tested it on a hidden set of 110 cases from 5 scanners. Averaged dice score,
precision and robust Hausdorff distance obtained on held-out test datasets were
80%, 84% and 6.30mm respectively. These were the highest achieved in the
challenge, suggesting the proposed method is the state-of-the-art. In this
paper, we provide detailed descriptions and quantitative analysis on key
components of the system. Furthermore, a study of cross-scanner evaluation is
presented to discuss how the combination of modalities and data augmentation
affect the generalization capability of the system. The adaptability of the
system to different scanners and protocols is also investigated. A quantitative
study is further presented to test the effect of ensemble size. Additionally,
software and models of our method are made publicly available. The
effectiveness and generalization capability of the proposed system show its
potential for real-world clinical practice.
| cs.CV | white matter hyperintensities wmh are commonly found in the brains of healthy elderly individuals and have been associated with various neurological and geriatric disorders in this paper we present a study using deep fully convolutional network and ensemble models to automatically detect such wmh using fluid attenuation inversion recovery flair and t1 magnetic resonance mr scans the algorithm was evaluated and ranked 1 st in the wmh segmentation challenge at miccai 2017 in the evaluation stage the implementation of the algorithm was submitted to the challenge organizers who then independently tested it on a hidden set of 110 cases from 5 scanners averaged dice score precision and robust hausdorff distance obtained on heldout test datasets were 80 84 and 630mm respectively these were the highest achieved in the challenge suggesting the proposed method is the stateoftheart in this paper we provide detailed descriptions and quantitative analysis on key components of the system furthermore a study of crossscanner evaluation is presented to discuss how the combination of modalities and data augmentation affect the generalization capability of the system the adaptability of the system to different scanners and protocols is also investigated a quantitative study is further presented to test the effect of ensemble size additionally software and models of our method are made publicly available the effectiveness and generalization capability of the proposed system show its potential for realworld clinical practice | [['white', 'matter', 'hyperintensities', 'wmh', 'are', 'commonly', 'found', 'in', 'the', 'brains', 'of', 'healthy', 'elderly', 'individuals', 'and', 'have', 'been', 'associated', 'with', 'various', 'neurological', 'and', 'geriatric', 'disorders', 'in', 'this', 'paper', 'we', 'present', 'a', 'study', 'using', 'deep', 'fully', 'convolutional', 'network', 'and', 'ensemble', 'models', 'to', 'automatically', 'detect', 'such', 'wmh', 'using', 'fluid', 'attenuation', 'inversion', 'recovery', 'flair', 'and', 't1', 'magnetic', 'resonance', 'mr', 'scans', 'the', 'algorithm', 'was', 'evaluated', 'and', 'ranked', '1', 'st', 'in', 'the', 'wmh', 'segmentation', 'challenge', 'at', 'miccai', '2017', 'in', 'the', 'evaluation', 'stage', 'the', 'implementation', 'of', 'the', 'algorithm', 'was', 'submitted', 'to', 'the', 'challenge', 'organizers', 'who', 'then', 'independently', 'tested', 'it', 'on', 'a', 'hidden', 'set', 'of', '110', 'cases', 'from', '5', 'scanners', 'averaged', 'dice', 'score', 'precision', 'and', 'robust', 'hausdorff', 'distance', 'obtained', 'on', 'heldout', 'test', 'datasets', 'were', '80', '84', 'and', '630mm', 'respectively', 'these', 'were', 'the', 'highest', 'achieved', 'in', 'the', 'challenge', 'suggesting', 'the', 'proposed', 'method', 'is', 'the', 'stateoftheart', 'in', 'this', 'paper', 'we', 'provide', 'detailed', 'descriptions', 'and', 'quantitative', 'analysis', 'on', 'key', 'components', 'of', 'the', 'system', 'furthermore', 'a', 'study', 'of', 'crossscanner', 'evaluation', 'is', 'presented', 'to', 'discuss', 'how', 'the', 'combination', 'of', 'modalities', 'and', 'data', 'augmentation', 'affect', 'the', 'generalization', 'capability', 'of', 'the', 'system', 'the', 'adaptability', 'of', 'the', 'system', 'to', 'different', 'scanners', 'and', 'protocols', 'is', 'also', 'investigated', 'a', 'quantitative', 'study', 'is', 'further', 'presented', 'to', 'test', 'the', 'effect', 'of', 'ensemble', 'size', 'additionally', 'software', 'and', 'models', 'of', 'our', 'method', 'are', 'made', 'publicly', 'available', 'the', 'effectiveness', 'and', 'generalization', 'capability', 'of', 'the', 'proposed', 'system', 'show', 'its', 'potential', 'for', 'realworld', 'clinical', 'practice']] | [-0.043289327968952074, 0.013836819507734745, -0.053719310165183644, 0.05413850803257629, -0.020169058556395978, -0.14340126602686779, 0.03477570225889327, 0.4043161857336369, -0.19857475617249784, -0.36485257809453003, 0.11981325337813768, -0.2933142161562095, -0.17408371461132402, 0.21091259987902825, -0.10608277572562926, 0.08690156207361978, 0.12938923975981478, 0.038471138630857674, -0.018070271822286356, -0.30710285662075576, 0.26798459556661386, 0.06512222344685635, 0.35302649950100246, 0.05794389289905476, 0.10977786611491107, -0.031428729903815095, -0.06229532369225404, 0.008450905353244378, -0.09604524524361871, 0.12053018451493445, 0.2558726805569383, 0.1761878987938963, 0.2892427532404954, -0.3742598993180108, -0.18741496340229327, 0.067043460035233, 0.10329770157876217, 0.07951803796872035, -0.028856095778105138, -0.34163782298544576, 0.11839209529916922, -0.16369405530767278, -0.049810943144930765, -0.10299784894300601, -0.0033998443891485445, -0.007053348385244933, -0.2677133548110073, 0.09493449019910219, 0.020043576471751565, 0.11809313448115992, -0.09023296225086001, -0.1329550192529726, 0.02424150201396439, 0.1733927263138108, 0.032991940253231204, 0.062445501462397815, 0.13376754539811325, -0.13595497446321764, -0.12492975742072192, 0.3400486165326695, -0.03154663401188158, -0.15184051182891717, 0.21592205657123478, -0.09366002471001177, -0.12049549773252086, 0.08236894544466158, 0.21345555049257442, 0.1046433587900188, -0.18435636550741163, 0.0009897762744821707, -0.009042988874945448, 0.17697177973767034, 0.05697129936848145, -0.04777407295916506, 0.14861946640023757, 0.22885329654546024, -0.05022019806918998, 0.14152969119919862, -0.15728544931188754, -0.03320458507029071, -0.23041469957547336, -0.15253928744165007, -0.1744713081597497, -0.03174541273009943, -0.05632187151268743, -0.12200783447293345, 0.41834125280640533, 0.23022015712846183, 0.14398656986800212, 0.046697719353576514, 0.3106997903908184, 0.008086241103617747, 0.0631016144716063, 0.05194866995217368, 0.22358244746175135, 0.07548226748987642, 0.10646489860518434, -0.21480859185881124, 0.08087780753833823, 0.016789734117507803] |
1,802.05204 | Oscillating sequences of higher orders and topological systems of
quasi-discrete spectrum | Fully oscillating sequences are orthogonal to all topological dynamical
systems of quasi-discrete spectrum in the sense of Hahn-Parry. This
orthogonality concerns with not only simple but also multiple ergodic means. It
is stronger than that required by Sarnak's conjecture.
| math.DS | fully oscillating sequences are orthogonal to all topological dynamical systems of quasidiscrete spectrum in the sense of hahnparry this orthogonality concerns with not only simple but also multiple ergodic means it is stronger than that required by sarnaks conjecture | [['fully', 'oscillating', 'sequences', 'are', 'orthogonal', 'to', 'all', 'topological', 'dynamical', 'systems', 'of', 'quasidiscrete', 'spectrum', 'in', 'the', 'sense', 'of', 'hahnparry', 'this', 'orthogonality', 'concerns', 'with', 'not', 'only', 'simple', 'but', 'also', 'multiple', 'ergodic', 'means', 'it', 'is', 'stronger', 'than', 'that', 'required', 'by', 'sarnaks', 'conjecture']] | [-0.22346157178608103, 0.1750011611252259, -0.08089323119761851, 0.1094316755875181, -0.07462713837575836, -0.20027470421822122, 0.018320343140751507, 0.36554415101925725, -0.2892795563317262, -0.21846014036773106, 0.107557634005132, -0.2169361827381624, -0.20387062158447522, 0.2213057215588215, -0.11188238020986319, 0.07947635564666528, 0.061259954857329525, 0.02653497200793563, -0.041127549281391576, -0.2811472079692743, 0.341160350264265, 0.010337165222527126, 0.27107428673368233, 0.015349476299702357, 0.02472256260135999, 0.03577438314469197, 0.024145609579789333, 0.007016687868879392, -0.07214821171323703, 0.11903269459994939, 0.21830708451139239, 0.09413868102889794, 0.2568331244282233, -0.35928309295708555, -0.21632759667670307, 0.1500800679413936, 0.20141117906388947, 0.07570264595918931, -0.0051532588326014, -0.2586433978703542, 0.18463409247879797, -0.15335349960682484, -0.1279592933730246, -0.0974109178970162, -0.007779936521099164, 0.024589717889634464, -0.23030614753803, 0.09389269569790205, 0.18073424535358731, 0.088744378529298, -0.03237606503833563, -0.028056682123301122, -0.05139761499296396, 0.12229555249452972, 0.04798136168541626, -0.000531715185691913, 0.021009711214365102, -0.027815021019285686, -0.08607514010658726, 0.36462700023100925, -0.0190766747038698, -0.2344882077513597, 0.22881926986603782, -0.22529815699761876, -0.16952012594526586, 0.17730922860881457, 0.01717971585308894, 0.0932176713951123, -0.17492215448202422, 0.06727050624501246, -0.10335646123171617, 0.17106579716962117, 0.10618370252016646, 0.11959098213805984, 0.18506409691121334, 0.023482744462597065, 0.15384903097620758, 0.10074634002282834, 0.0980870951540195, -0.08653783992840311, -0.23821006007402992, -0.11900261087486377, -0.19836452949899608, 0.08900801324657201, -0.021463720232415467, -0.20082357874474463, 0.353435679888114, 0.12446935271892028, 0.13107215557530977, 0.10317025826169321, 0.3054232470309123, 0.16351520258169144, 0.0515409868885166, 0.08378824449550265, 0.18957430372635523, 0.1712415989739104, 0.055396948248530045, -0.15099982369261292, 0.042593953653405875, 0.10169643137412958] |
1,802.05205 | Self-Organised Fractional Quantisation in a Hole Quantum Wire | We have investigated hole transport in one-dimensional quantum wires in
strained germanium two-dimensional layers. The ballistic conductance
characteristics show the regular quantised plateaux in units of n2e2/h, where n
is an integer. Additionally, new quantised levels are formed which correspond
to values of n = 1/4 reducing to 1/8 in the presence of a strong parallel
magnetic field which lifts the spin degeneracy but does not quantise the
wavefunction. A further plateau is observed corresponding to n = 1/32 which
does not change in the presence of a parallel magnetic field. These values
indicate that the system is behaving as if charge was fractionalised with
values e/2 and e/4, possible mechanisms are discussed.
| cond-mat.mes-hall | we have investigated hole transport in onedimensional quantum wires in strained germanium twodimensional layers the ballistic conductance characteristics show the regular quantised plateaux in units of n2e2h where n is an integer additionally new quantised levels are formed which correspond to values of n 14 reducing to 18 in the presence of a strong parallel magnetic field which lifts the spin degeneracy but does not quantise the wavefunction a further plateau is observed corresponding to n 132 which does not change in the presence of a parallel magnetic field these values indicate that the system is behaving as if charge was fractionalised with values e2 and e4 possible mechanisms are discussed | [['we', 'have', 'investigated', 'hole', 'transport', 'in', 'onedimensional', 'quantum', 'wires', 'in', 'strained', 'germanium', 'twodimensional', 'layers', 'the', 'ballistic', 'conductance', 'characteristics', 'show', 'the', 'regular', 'quantised', 'plateaux', 'in', 'units', 'of', 'n2e2h', 'where', 'n', 'is', 'an', 'integer', 'additionally', 'new', 'quantised', 'levels', 'are', 'formed', 'which', 'correspond', 'to', 'values', 'of', 'n', '14', 'reducing', 'to', '18', 'in', 'the', 'presence', 'of', 'a', 'strong', 'parallel', 'magnetic', 'field', 'which', 'lifts', 'the', 'spin', 'degeneracy', 'but', 'does', 'not', 'quantise', 'the', 'wavefunction', 'a', 'further', 'plateau', 'is', 'observed', 'corresponding', 'to', 'n', '132', 'which', 'does', 'not', 'change', 'in', 'the', 'presence', 'of', 'a', 'parallel', 'magnetic', 'field', 'these', 'values', 'indicate', 'that', 'the', 'system', 'is', 'behaving', 'as', 'if', 'charge', 'was', 'fractionalised', 'with', 'values', 'e2', 'and', 'e4', 'possible', 'mechanisms', 'are', 'discussed']] | [-0.2089471988612786, 0.23547664626768727, -0.004369246519424699, 0.023560954934113067, -0.03915095575661822, -0.17217465248382227, 0.0013223068301819942, 0.35669556418010456, -0.24636514147912913, -0.3317273496734825, 0.012772883613466878, -0.27604077869856897, -0.12662961498876527, 0.1614334509284659, -0.00826999490487982, -0.032876363725385584, -0.006527503211559219, 0.050736622950485484, -0.08969235853556629, -0.23574340009680864, 0.2524661834097721, 0.022395958348219707, 0.2805064620788802, 0.046623524320735174, 0.048851641517301855, -0.03422247307502072, 0.0883047003806992, 0.06189271104310385, -0.10725002493954063, 0.013051605508239432, 0.23755592084066435, -0.060088424824855546, 0.18301352376372299, -0.46810856314206667, -0.17004907554232473, 0.08071960750967264, 0.18107273712838914, 0.11735756547211415, -0.017686803308738903, -0.2331015016798946, 0.10622812751680613, -0.11301384195685386, -0.1187048256227916, -0.051328494937413115, 0.05284036303320053, 0.01319695237008008, -0.24253601528365504, 0.09555336655625565, 0.0790087730539116, 0.040585496062836186, -0.08030789284331893, -0.13628907082073222, -0.06354966536587613, 0.09256796293299306, 0.03242217881435698, 0.03331539930183102, 0.139011335152794, -0.12590222096239978, -0.1325324947924607, 0.3260142935439944, -0.04441791084298695, -0.18004581426608968, 0.14041225614703515, -0.20994611089488238, -0.1039851449683986, 0.15557713438333434, 0.08832488986240192, 0.10896856453777715, -0.08497648310360753, 0.10821715598365038, -0.04191879189827225, 0.16942715130677574, 0.05669156386601654, 0.06976632196879522, 0.2721152158369395, 0.09210538423027505, 0.03431298160205849, 0.11814084944145924, -0.14621291907334868, -0.09790203411566009, -0.28885898629034107, -0.19047606543807144, -0.19153151909228075, 0.12280807957629969, -0.04662689391764368, -0.2144416725178334, 0.3674847075165334, 0.1328423874198713, 0.22235714427026157, -0.02697696993021633, 0.207303085307252, 0.15281813676066866, 0.09296904100867158, 0.09045961792157454, 0.23873331880577925, 0.14968719990416007, 0.08357075450476259, -0.2558417875108055, 0.013609011378139257, 0.012795031356455927] |
1,802.05206 | Enabling Interactive Mobile Simulations Through Distributed Reduced
Models | Currently, various hardware and software companies are developing augmented
reality devices, most prominently Microsoft with its Hololens. Besides gaming,
such devices can be used for serious pervasive applications, like interactive
mobile simulations to support engineers in the field. Interactive simulations
have high demands on resources, which the mobile device alone is unable to
satisfy. Therefore, we propose a framework to support mobile simulations by
distributing the computation between the mobile device and a remote server
based on the reduced basis method. Evaluations show that we can speed-up the
numerical computation by over 131 times while using 73 times less energy.
| cs.DC cs.ET | currently various hardware and software companies are developing augmented reality devices most prominently microsoft with its hololens besides gaming such devices can be used for serious pervasive applications like interactive mobile simulations to support engineers in the field interactive simulations have high demands on resources which the mobile device alone is unable to satisfy therefore we propose a framework to support mobile simulations by distributing the computation between the mobile device and a remote server based on the reduced basis method evaluations show that we can speedup the numerical computation by over 131 times while using 73 times less energy | [['currently', 'various', 'hardware', 'and', 'software', 'companies', 'are', 'developing', 'augmented', 'reality', 'devices', 'most', 'prominently', 'microsoft', 'with', 'its', 'hololens', 'besides', 'gaming', 'such', 'devices', 'can', 'be', 'used', 'for', 'serious', 'pervasive', 'applications', 'like', 'interactive', 'mobile', 'simulations', 'to', 'support', 'engineers', 'in', 'the', 'field', 'interactive', 'simulations', 'have', 'high', 'demands', 'on', 'resources', 'which', 'the', 'mobile', 'device', 'alone', 'is', 'unable', 'to', 'satisfy', 'therefore', 'we', 'propose', 'a', 'framework', 'to', 'support', 'mobile', 'simulations', 'by', 'distributing', 'the', 'computation', 'between', 'the', 'mobile', 'device', 'and', 'a', 'remote', 'server', 'based', 'on', 'the', 'reduced', 'basis', 'method', 'evaluations', 'show', 'that', 'we', 'can', 'speedup', 'the', 'numerical', 'computation', 'by', 'over', '131', 'times', 'while', 'using', '73', 'times', 'less', 'energy']] | [-0.15447791024576873, 0.044019060204736886, -0.044708989069331434, 0.016954947427148, -0.08170933298766613, -0.20733649155590683, 0.06148149896413088, 0.4191373811289668, -0.21472470576525665, -0.39891075767576695, 0.13682997851981782, -0.26472763002384453, -0.1518848635768518, 0.2956274543935433, -0.1019565168156987, 0.08181225680338684, 0.10831533391959965, 0.0055794048495590685, -0.023142187360208483, -0.2584664533194154, 0.21233267983041515, 0.06509063016623258, 0.33408723096596077, 0.08540264345821924, 0.02300417736172676, 0.0069199609127826986, -0.020997055685147644, 0.0007485532788268757, -0.046984030760722814, 0.17082258242531678, 0.29074125313898547, 0.18315473372116686, 0.3634477911889553, -0.5403144514001906, -0.18515573087148368, 0.07305130914319306, 0.16833594341529534, 0.036487926446134224, -0.07886727255070582, -0.31734310240950436, 0.159303608443588, -0.25688670080155135, -0.06910268647101475, -0.11162433652207256, 0.0134478439448867, 0.027161856796010398, -0.25977943912148477, -0.03144668145105243, -0.10032394648063928, 0.0763221370615065, -0.012722888654388953, -0.06464685783721506, 0.017918247807538135, 0.1590203461505007, -0.009564164561452345, 0.011059974688105285, 0.221732204570435, -0.14253546725958585, -0.16672228734008968, 0.4033373061567545, 0.023114079739898444, -0.15286294342949985, 0.24392773002153262, -0.014399182293564081, -0.09696514431852847, 0.09425211707595736, 0.21992186728864907, 0.044576195806730536, -0.1652892788872123, 0.056182346664136275, 0.02943590407259762, 0.18053378835320472, 0.004755711704492569, 0.0412864808132872, 0.21327750919386745, 0.18170750984922052, 0.05363482268759981, 0.06733535005594604, -0.046988189951516685, -0.12238683730131016, -0.1996369145542849, -0.20617684364318847, -0.2106281121703796, 0.02277767091523856, -0.08300992882315768, -0.12493928489275277, 0.31940986968467766, 0.24700891660526395, 0.0951375538483262, 0.04420775827486068, 0.40941685177385806, 0.08008123211562633, 0.16237665308639407, 0.163974962788634, 0.1434730252996087, 0.0037240362039301545, 0.21334316944354215, -0.13571077262517064, 0.06433560829143971, -0.018382220920175316] |
1,802.05207 | Quantifying the Effect of Non-Larmor Motion of Electrons on the Pressure
Tensor | In space plasma, various effects of magnetic reconnection and turbulence
cause the electron motion to significantly deviate from their Larmor orbits.
Collectively these orbits affect the electron velocity distribution function
and lead to the appearance of the "non-gyrotropic" elements in the pressure
tensor. Quantification of this effect has important applications in space and
laboratory plasma, one of which is tracing the electron diffusion region (EDR)
of magnetic reconnection in space observations. Three different measures of
agyrotropy of pressure tensor have previously been proposed, namely,
$A\varnothing_e$, $D_{ng}$ and $Q$. The multitude of contradictory measures has
caused confusion within the community. We revisit the problem by considering
the basic properties an agyrotropy measure should have. We show that
$A\varnothing_e$, $D_{ng}$ and $Q$ are all defined based on the sum of the
principle minors (i.e. the rotation invariant $I_2$) of the pressure tensor. We
discuss in detail the problems of $I_2$-based measures and explain why they may
produce ambiguous and biased results. We introduce a new measure $AG$
constructed based on the determinant of the pressure tensor (i.e. the rotation
invariant $I_3$) which does not suffer from the problems of $I_2$-based
measures. We compare $AG$ with other measures in 2 and 3-dimension
particle-in-cell magnetic reconnection simulations, and show that $AG$ can
effectively trace the EDR of reconnection in both Harris and force-free current
sheets. On the other hand, $A\varnothing_e$ does not show prominent peaks in
the EDR and part of the separatrix in the force-free reconnection simulations,
demonstrating that $A\varnothing_e$ does not measure all the non-gyrotropic
effects in this case, and is not suitable for studying magnetic reconnection in
more general situations other than Harris sheet reconnection.
| physics.plasm-ph nlin.CD nlin.SI physics.space-ph | in space plasma various effects of magnetic reconnection and turbulence cause the electron motion to significantly deviate from their larmor orbits collectively these orbits affect the electron velocity distribution function and lead to the appearance of the nongyrotropic elements in the pressure tensor quantification of this effect has important applications in space and laboratory plasma one of which is tracing the electron diffusion region edr of magnetic reconnection in space observations three different measures of agyrotropy of pressure tensor have previously been proposed namely avarnothing_e d_ng and q the multitude of contradictory measures has caused confusion within the community we revisit the problem by considering the basic properties an agyrotropy measure should have we show that avarnothing_e d_ng and q are all defined based on the sum of the principle minors ie the rotation invariant i_2 of the pressure tensor we discuss in detail the problems of i_2based measures and explain why they may produce ambiguous and biased results we introduce a new measure ag constructed based on the determinant of the pressure tensor ie the rotation invariant i_3 which does not suffer from the problems of i_2based measures we compare ag with other measures in 2 and 3dimension particleincell magnetic reconnection simulations and show that ag can effectively trace the edr of reconnection in both harris and forcefree current sheets on the other hand avarnothing_e does not show prominent peaks in the edr and part of the separatrix in the forcefree reconnection simulations demonstrating that avarnothing_e does not measure all the nongyrotropic effects in this case and is not suitable for studying magnetic reconnection in more general situations other than harris sheet reconnection | [['in', 'space', 'plasma', 'various', 'effects', 'of', 'magnetic', 'reconnection', 'and', 'turbulence', 'cause', 'the', 'electron', 'motion', 'to', 'significantly', 'deviate', 'from', 'their', 'larmor', 'orbits', 'collectively', 'these', 'orbits', 'affect', 'the', 'electron', 'velocity', 'distribution', 'function', 'and', 'lead', 'to', 'the', 'appearance', 'of', 'the', 'nongyrotropic', 'elements', 'in', 'the', 'pressure', 'tensor', 'quantification', 'of', 'this', 'effect', 'has', 'important', 'applications', 'in', 'space', 'and', 'laboratory', 'plasma', 'one', 'of', 'which', 'is', 'tracing', 'the', 'electron', 'diffusion', 'region', 'edr', 'of', 'magnetic', 'reconnection', 'in', 'space', 'observations', 'three', 'different', 'measures', 'of', 'agyrotropy', 'of', 'pressure', 'tensor', 'have', 'previously', 'been', 'proposed', 'namely', 'avarnothing_e', 'd_ng', 'and', 'q', 'the', 'multitude', 'of', 'contradictory', 'measures', 'has', 'caused', 'confusion', 'within', 'the', 'community', 'we', 'revisit', 'the', 'problem', 'by', 'considering', 'the', 'basic', 'properties', 'an', 'agyrotropy', 'measure', 'should', 'have', 'we', 'show', 'that', 'avarnothing_e', 'd_ng', 'and', 'q', 'are', 'all', 'defined', 'based', 'on', 'the', 'sum', 'of', 'the', 'principle', 'minors', 'ie', 'the', 'rotation', 'invariant', 'i_2', 'of', 'the', 'pressure', 'tensor', 'we', 'discuss', 'in', 'detail', 'the', 'problems', 'of', 'i_2based', 'measures', 'and', 'explain', 'why', 'they', 'may', 'produce', 'ambiguous', 'and', 'biased', 'results', 'we', 'introduce', 'a', 'new', 'measure', 'ag', 'constructed', 'based', 'on', 'the', 'determinant', 'of', 'the', 'pressure', 'tensor', 'ie', 'the', 'rotation', 'invariant', 'i_3', 'which', 'does', 'not', 'suffer', 'from', 'the', 'problems', 'of', 'i_2based', 'measures', 'we', 'compare', 'ag', 'with', 'other', 'measures', 'in', '2', 'and', '3dimension', 'particleincell', 'magnetic', 'reconnection', 'simulations', 'and', 'show', 'that', 'ag', 'can', 'effectively', 'trace', 'the', 'edr', 'of', 'reconnection', 'in', 'both', 'harris', 'and', 'forcefree', 'current', 'sheets', 'on', 'the', 'other', 'hand', 'avarnothing_e', 'does', 'not', 'show', 'prominent', 'peaks', 'in', 'the', 'edr', 'and', 'part', 'of', 'the', 'separatrix', 'in', 'the', 'forcefree', 'reconnection', 'simulations', 'demonstrating', 'that', 'avarnothing_e', 'does', 'not', 'measure', 'all', 'the', 'nongyrotropic', 'effects', 'in', 'this', 'case', 'and', 'is', 'not', 'suitable', 'for', 'studying', 'magnetic', 'reconnection', 'in', 'more', 'general', 'situations', 'other', 'than', 'harris', 'sheet', 'reconnection']] | [-0.1255682770326316, 0.16085930869993556, -0.05751344618191718, 0.08838834757197593, -0.05123820120934397, -0.08754484055509024, -0.03084705734063926, 0.3640320691115716, -0.2567195380380487, -0.2775781215065816, 0.0627423595463316, -0.2555939624674947, -0.1233416005544474, 0.2132828666431391, -0.04608543340541741, 0.009812320122899324, 0.04284030253320987, 0.017709793131764268, -0.07722493424101712, -0.19092526479867314, 0.3357506572946851, 0.07208777649622575, 0.28046068930758766, 0.07433581005213508, 0.07257243254228823, -0.04371364025727791, -0.02580003221245373, 0.07832834829530518, -0.13619270302968503, 0.059878908916075224, 0.1752831352624686, 0.1058174446110142, 0.23608995243728928, -0.44549221610171064, -0.23473493492244468, 0.06806896655710742, 0.1534606197147856, 0.0551316612146526, -0.02275411551374204, -0.25947166834949337, 0.05710915524190675, -0.15021969208336325, -0.08762775201552465, -0.061738703711478805, 0.018948616184335312, 0.04530059383935569, -0.26932853433176845, 0.09814042672651875, 0.08978885137377587, 0.07191942303068251, -0.09765838113740113, -0.10383418649529202, -0.030966599468871103, 0.09380654462438542, 0.09174409181458246, 0.03421920724341523, 0.17883947918273727, -0.11733226929455294, -0.11955112870782614, 0.3834876067361192, -0.03581688755393236, -0.18906692098415293, 0.19782448853434556, -0.24696558274445124, -0.12914210979943164, 0.1306649919236353, 0.13787151492707542, 0.10200111605295473, -0.09224530198330552, 0.05586144507619525, -0.05593187116541872, 0.08441352615858812, 0.06793064881126423, 0.0020294894118919994, 0.21786219186683678, 0.0871035421767053, 0.052753585891503675, 0.09415901087413658, -0.13774343769952846, -0.05434697641655529, -0.2665550718974212, -0.16151592591332325, -0.1573095518422847, 0.042344097166385514, -0.06922026020316373, -0.20119684216350672, 0.37417369987986815, 0.18983668301531426, 0.17689973832132047, -0.04340393392725245, 0.27112307066700475, 0.11570434214167215, 0.07139052402935168, 0.11776546303949811, 0.2652767764118514, 0.14923477456870707, 0.09521462297005415, -0.23143898267174817, 0.08615632501588312, 0.06839379238355082] |
1,802.05208 | 2D-3D crossover in a dense electron liquid in silicon | Doping of silicon via phosphene exposures alternating with molecular beam
epitaxy overgrowth is a path to Si:P substrates for conventional
microelectronics and quantum information technologies. The technique also
provides a new and well-controlled material for systematic studies of
two-dimensional lattices with a half-filled band. We show here that for a dense
($n_s=2.8\times 10^{14}$\,cm$^{-2}$) disordered two-dimensional array of P
atoms, the full field angle-dependent magnetostransport is remarkably well
described by classic weak localization theory with no corrections due to
interaction effects. The two- to three-dimensional cross-over seen upon warming
can also be interpreted using scaling concepts, developed for anistropic
three-dimensional materials, which work remarkably except when the applied
fields are nearly parallel to the conducting planes.
| cond-mat.mes-hall | doping of silicon via phosphene exposures alternating with molecular beam epitaxy overgrowth is a path to sip substrates for conventional microelectronics and quantum information technologies the technique also provides a new and wellcontrolled material for systematic studies of twodimensional lattices with a halffilled band we show here that for a dense n_s28times 1014cm2 disordered twodimensional array of p atoms the full field angledependent magnetostransport is remarkably well described by classic weak localization theory with no corrections due to interaction effects the two to threedimensional crossover seen upon warming can also be interpreted using scaling concepts developed for anistropic threedimensional materials which work remarkably except when the applied fields are nearly parallel to the conducting planes | [['doping', 'of', 'silicon', 'via', 'phosphene', 'exposures', 'alternating', 'with', 'molecular', 'beam', 'epitaxy', 'overgrowth', 'is', 'a', 'path', 'to', 'sip', 'substrates', 'for', 'conventional', 'microelectronics', 'and', 'quantum', 'information', 'technologies', 'the', 'technique', 'also', 'provides', 'a', 'new', 'and', 'wellcontrolled', 'material', 'for', 'systematic', 'studies', 'of', 'twodimensional', 'lattices', 'with', 'a', 'halffilled', 'band', 'we', 'show', 'here', 'that', 'for', 'a', 'dense', 'n_s28times', '1014cm2', 'disordered', 'twodimensional', 'array', 'of', 'p', 'atoms', 'the', 'full', 'field', 'angledependent', 'magnetostransport', 'is', 'remarkably', 'well', 'described', 'by', 'classic', 'weak', 'localization', 'theory', 'with', 'no', 'corrections', 'due', 'to', 'interaction', 'effects', 'the', 'two', 'to', 'threedimensional', 'crossover', 'seen', 'upon', 'warming', 'can', 'also', 'be', 'interpreted', 'using', 'scaling', 'concepts', 'developed', 'for', 'anistropic', 'threedimensional', 'materials', 'which', 'work', 'remarkably', 'except', 'when', 'the', 'applied', 'fields', 'are', 'nearly', 'parallel', 'to', 'the', 'conducting', 'planes']] | [-0.11251947097068207, 0.1805607520076817, -0.038882809691131115, 0.015261414635975936, -0.020714340805677713, -0.18748129854819415, 0.05331138317963619, 0.4250549366615251, -0.26427764089909933, -0.27165251770015575, 0.04855009854103612, -0.26590463585854895, -0.1462885218845532, 0.22928181084581709, 0.019175758548245755, 0.05473778865287756, 0.01728873718447522, -0.10343323167479407, -0.11834364293753045, -0.20069811125162296, 0.25945412857144806, 0.07328652472758616, 0.3357015331770269, 0.0746804874975531, 0.053093576350504844, 0.035827074747994146, 0.06770809585088453, 0.08955176130134974, -0.1529614556794167, 0.08920157506270746, 0.27477012642822024, -0.06407131352750338, 0.19511698115930226, -0.4730932499751844, -0.2567281622348963, -0.0031796562324681904, 0.14492762225331837, 0.1638856435274969, -0.11976293340918764, -0.2756407888754543, 0.040838170608101756, -0.1357301584964173, -0.13629325832069267, -0.07451460101493362, -0.03218665628269546, 0.006308334768312959, -0.27148983862448844, 0.04737692197992887, 0.04555310362504911, 0.09452938418361498, -0.03906692971013882, -0.09329194269777663, -0.017912584276606157, 0.0658545511091165, 0.0023011048983749565, 0.050835078107234324, 0.15494605782647838, -0.10616152947232853, -0.1315628862723428, 0.4075216276785441, -0.05017932349881899, -0.12824957080152447, 0.20760020279877744, -0.1307035954669118, -0.06803723140949366, 0.16179819363045744, 0.1183489673375358, 0.0826518244740545, -0.15976031485852782, 0.0851849135603427, -0.020136560119721477, 0.1807552294061824, 0.04532012910029925, 0.037279698667034046, 0.21005991621096712, 0.18707991017449022, 0.06022951516077598, 0.14751869225483058, -0.11027135799301013, -0.0806437843207237, -0.19904130107756143, -0.18250161415147306, -0.19025965610238832, 0.06846644229923202, -0.036109193874908345, -0.21751899610941125, 0.35863543592756036, 0.10734524355739751, 0.14087831472516454, -0.0208516991748763, 0.2717385124909667, 0.07765412942168459, 0.09746515066816216, 0.009768925218809956, 0.24067579514750864, 0.16659704434471123, 0.09248473470519601, -0.1890656744846992, 0.01027810083603305, 0.026617330672071043] |
1,802.05209 | Sum Secrecy Rate Maximization in a Multi-Carrier MIMO Wiretap Channel
with Full-Duplex Jamming | In this paper we address a sum secrecy rate maximization problem for a
multi-carrier and MIMO communication system. We consider the case that the
receiver is capable of full-duplex (FD) operation and simultaneously sends
jamming signal to a potential eavesdropper. In particular, we simultaneously
take advantage of the spatial and frequency diversity in the system in order to
obtain a higher level of security in the physical layer. Due to the non-convex
nature of the resulting mathematical problem, we propose an iterative solution
with a guaranteed convergence, based on block coordinate descent method, by
re-structuring our problem as a separately convex program. Moreover, for the
special case that the transmitter is equipped with a single antenna, an optimal
transmit power allocation strategy is obtained analytically, assuming a known
jamming strategy. We also study a FD bidirectional secure communication system,
where the jamming power can be reused to enhance the sum secrecy rate. The
performance of the proposed design is then numerically evaluated compared to
the other design strategies, and under different system assumptions.
| cs.IT math.IT | in this paper we address a sum secrecy rate maximization problem for a multicarrier and mimo communication system we consider the case that the receiver is capable of fullduplex fd operation and simultaneously sends jamming signal to a potential eavesdropper in particular we simultaneously take advantage of the spatial and frequency diversity in the system in order to obtain a higher level of security in the physical layer due to the nonconvex nature of the resulting mathematical problem we propose an iterative solution with a guaranteed convergence based on block coordinate descent method by restructuring our problem as a separately convex program moreover for the special case that the transmitter is equipped with a single antenna an optimal transmit power allocation strategy is obtained analytically assuming a known jamming strategy we also study a fd bidirectional secure communication system where the jamming power can be reused to enhance the sum secrecy rate the performance of the proposed design is then numerically evaluated compared to the other design strategies and under different system assumptions | [['in', 'this', 'paper', 'we', 'address', 'a', 'sum', 'secrecy', 'rate', 'maximization', 'problem', 'for', 'a', 'multicarrier', 'and', 'mimo', 'communication', 'system', 'we', 'consider', 'the', 'case', 'that', 'the', 'receiver', 'is', 'capable', 'of', 'fullduplex', 'fd', 'operation', 'and', 'simultaneously', 'sends', 'jamming', 'signal', 'to', 'a', 'potential', 'eavesdropper', 'in', 'particular', 'we', 'simultaneously', 'take', 'advantage', 'of', 'the', 'spatial', 'and', 'frequency', 'diversity', 'in', 'the', 'system', 'in', 'order', 'to', 'obtain', 'a', 'higher', 'level', 'of', 'security', 'in', 'the', 'physical', 'layer', 'due', 'to', 'the', 'nonconvex', 'nature', 'of', 'the', 'resulting', 'mathematical', 'problem', 'we', 'propose', 'an', 'iterative', 'solution', 'with', 'a', 'guaranteed', 'convergence', 'based', 'on', 'block', 'coordinate', 'descent', 'method', 'by', 'restructuring', 'our', 'problem', 'as', 'a', 'separately', 'convex', 'program', 'moreover', 'for', 'the', 'special', 'case', 'that', 'the', 'transmitter', 'is', 'equipped', 'with', 'a', 'single', 'antenna', 'an', 'optimal', 'transmit', 'power', 'allocation', 'strategy', 'is', 'obtained', 'analytically', 'assuming', 'a', 'known', 'jamming', 'strategy', 'we', 'also', 'study', 'a', 'fd', 'bidirectional', 'secure', 'communication', 'system', 'where', 'the', 'jamming', 'power', 'can', 'be', 'reused', 'to', 'enhance', 'the', 'sum', 'secrecy', 'rate', 'the', 'performance', 'of', 'the', 'proposed', 'design', 'is', 'then', 'numerically', 'evaluated', 'compared', 'to', 'the', 'other', 'design', 'strategies', 'and', 'under', 'different', 'system', 'assumptions']] | [-0.2182208940634407, -0.021849680341870358, -0.05810666248213091, 0.006406563021258769, -0.05927693376430671, -0.2473618152465219, 0.10987572971734116, 0.3753053482266606, -0.31411073433310654, -0.2232693710843521, 0.11073165004628824, -0.2232248593018137, -0.20801513588239004, 0.1381321551461268, -0.11605832916132654, 0.08320822475667816, 0.015534326136704383, 0.04486102923061806, -0.03308781337886618, -0.26668354402554645, 0.3039639684455092, 0.12208746514159304, 0.34102123425573627, 0.018322195343315237, 0.12062624875574529, 0.03220477013315769, 0.043349434330930255, -0.019657111570583603, -0.0914784211190478, 0.0660487236327228, 0.3202304915885705, 0.18864696174846543, 0.3016544578171664, -0.38859702483616293, -0.22582405776921335, 0.12030083940881224, 0.16275347712331295, 0.07476726594257217, -0.05511581072801821, -0.2387033640386838, 0.13528846458241214, -0.2320636245987319, -0.05067333672330257, -0.013261412702382387, -0.10137701171014264, 0.03789898750339931, -0.37124373844011843, -0.006329695071191984, 0.02155279647289759, 0.019035459539147814, -0.06768956247211105, -0.08876617016496859, 0.04330567466875678, 0.1448579826311483, 0.040089402269134454, -0.008550887747574867, 0.10165034505576326, -0.08557070135354264, -0.11264270457370444, 0.3880880409030707, -0.01761689254909086, -0.26850558691415827, 0.13368492707141777, -0.0736243058119852, -0.09615338272872688, 0.16485318196520232, 0.25693696835266716, 0.10145863353656982, -0.1845121283475794, 0.02778458395149193, -0.02370212858305932, 0.19251582128227274, 0.06115784475208406, 0.08602869646311495, 0.14060008258160442, 0.1899381308046552, 0.16999408567857235, 0.20257028497619597, -0.10277258593056114, -0.1148046310163356, -0.24247681043740643, -0.14056231779843095, -0.22116110868337482, 0.01743003634353723, -0.0864762958200417, -0.03714948295039593, 0.38053836888832854, 0.14120790334364583, 0.11711670459124308, 0.13590864528433522, 0.40732571098824283, 0.12771942248740206, 0.021975472849400747, 0.11276739913259627, 0.2358425615410552, 0.0858320826664567, 0.12730840270305213, -0.24498397807356487, 0.061859415098486435, 0.031133360681635452] |
1,802.0521 | Rho-pion transition form factors in the $k_T$ factorization formulism
revisited | We revisit the evaluations for the spacelike and timelike $\rho \pi$
transition form factors $F_{\rho\pi}(Q^2)$ and $G_{\rho\pi}(Q^2)$ with the
inclusion of the the next-to-leading order (NLO) QCD contributions in the
framework of the $k_T$ factorization theorem. The infrared divergence is
regularized by the transversal momentum carried by external valence quarks, and
ultimately absorbed into the meson wave functions. In the region of $ Q^2
\leqslant 2 \, \textrm{GeV}^2 $, where PQCD factorization apporach applicable,
the NLO contribution can bring no larger than $ 35\%$ enhancement to the
spacelike form factor $F_{\rho\pi}(Q^2)$. For the timelike form factor derived
under the kinematic exchanging symmetry, this contribution is also under
control when the momentum transfer squared is large enough. We also prolong our
prediction into the small $Q^2$ region by taking the Lattice QCD results into
account, and subsequently obtain the coupling $g_{\rho\pi\gamma} =
G_{\rho\pi}(0)=0.596$.
| hep-ph | we revisit the evaluations for the spacelike and timelike rho pi transition form factors f_rhopiq2 and g_rhopiq2 with the inclusion of the the nexttoleading order nlo qcd contributions in the framework of the k_t factorization theorem the infrared divergence is regularized by the transversal momentum carried by external valence quarks and ultimately absorbed into the meson wave functions in the region of q2 leqslant 2 textrmgev2 where pqcd factorization apporach applicable the nlo contribution can bring no larger than 35 enhancement to the spacelike form factor f_rhopiq2 for the timelike form factor derived under the kinematic exchanging symmetry this contribution is also under control when the momentum transfer squared is large enough we also prolong our prediction into the small q2 region by taking the lattice qcd results into account and subsequently obtain the coupling g_rhopigamma g_rhopi00596 | [['we', 'revisit', 'the', 'evaluations', 'for', 'the', 'spacelike', 'and', 'timelike', 'rho', 'pi', 'transition', 'form', 'factors', 'f_rhopiq2', 'and', 'g_rhopiq2', 'with', 'the', 'inclusion', 'of', 'the', 'the', 'nexttoleading', 'order', 'nlo', 'qcd', 'contributions', 'in', 'the', 'framework', 'of', 'the', 'k_t', 'factorization', 'theorem', 'the', 'infrared', 'divergence', 'is', 'regularized', 'by', 'the', 'transversal', 'momentum', 'carried', 'by', 'external', 'valence', 'quarks', 'and', 'ultimately', 'absorbed', 'into', 'the', 'meson', 'wave', 'functions', 'in', 'the', 'region', 'of', 'q2', 'leqslant', '2', 'textrmgev2', 'where', 'pqcd', 'factorization', 'apporach', 'applicable', 'the', 'nlo', 'contribution', 'can', 'bring', 'no', 'larger', 'than', '35', 'enhancement', 'to', 'the', 'spacelike', 'form', 'factor', 'f_rhopiq2', 'for', 'the', 'timelike', 'form', 'factor', 'derived', 'under', 'the', 'kinematic', 'exchanging', 'symmetry', 'this', 'contribution', 'is', 'also', 'under', 'control', 'when', 'the', 'momentum', 'transfer', 'squared', 'is', 'large', 'enough', 'we', 'also', 'prolong', 'our', 'prediction', 'into', 'the', 'small', 'q2', 'region', 'by', 'taking', 'the', 'lattice', 'qcd', 'results', 'into', 'account', 'and', 'subsequently', 'obtain', 'the', 'coupling', 'g_rhopigamma', 'g_rhopi00596']] | [-0.10273750018612027, 0.19875025521102535, -0.10503150254866123, 0.09958730655708316, -0.04785911826402845, -0.06350321323664236, 0.04854132042833625, 0.33431453683546614, -0.2009490720185458, -0.20811761102702162, 0.0081788053774604, -0.30859586358756613, -0.032974540943952094, 0.10003815505730647, 0.07089697537703887, 0.06299024960901448, 0.03518011381751612, 0.012382469665175094, -0.08313303542344418, -0.18930463740055947, 0.3603276643353549, 0.0080647774205256, 0.23881760822202927, 0.16752807961871385, 0.0705178460260307, 0.0641746328674481, -0.028655516722456628, -0.02014955169054298, -0.13228535517013834, 0.07381879993105181, 0.23308679461654247, 0.04650227776623534, 0.19567581235310344, -0.3722405803417857, -0.13946530051683462, 0.049182393397309614, 0.16167744277115154, 0.06152714849484706, 0.018422789388525308, -0.2663506904224816, 0.09671801471858657, -0.20331021807247535, -0.13306504845465147, -0.14560520581032774, -0.025406105274026442, -0.09575874386775426, -0.3295731901548299, 0.08460329484703943, 0.05304403198336748, 0.004452535068560252, -0.036850078374539554, -0.18946810403516642, -0.01273177763538197, 0.10447715367369977, 0.1307311450898003, 0.13335633156050866, 0.11311120877333014, -0.18362681172557063, -0.06544049987674487, 0.40403000414336476, -0.03743623685815172, -0.21373768312562452, 0.03933262320662519, -0.21990709895394125, -0.08954831724986434, 0.19703670789284589, 0.19274638979030506, 0.09975265288446274, -0.15482152467893343, 0.1299437460983242, 0.003120251016230042, 0.15847700647309534, 0.08394617896134916, 0.04087223258933851, 0.12849414916498994, 0.11105136886848263, -0.017285984282598907, 0.12226505375194147, -0.0722975407418956, -0.13614310006982178, -0.4064448957534549, -0.11475163391774654, -0.11051386614029009, 0.10087606715967554, -0.17575954734759153, -0.07849001268947259, 0.3305961537381452, 0.07564232285106923, 0.24019961816055657, 0.05192054320070753, 0.33759151033959106, 0.15145762683473585, 0.14763660131974665, 0.13740586766034812, 0.2891156160013568, 0.16048037663235196, 0.08557720846825637, -0.26600983249079574, 0.004678848776644659, 0.09629234758072666] |
1,802.05211 | Measurements of the self-assembly kinetics of individual viral capsids
around their RNA genome | The formation of a viral capsid -- the highly-ordered protein shell that
surrounds the genome of a virus -- is the canonical example of self-assembly.
The capsids of many positive-sense RNA viruses spontaneously assemble from in
vitro mixtures of the coat protein and RNA. The high yield of proper capsids
that assemble is remarkable, given their structural complexity: 180 identical
proteins must arrange into three distinct local configurations to form an
icosahedral capsid with a triangulation number of 3 (T = 3). Despite a wealth
of data from structural studies and simulations, even the most fundamental
questions about how these structures assemble remain unresolved. Experiments
have not determined whether the assembly pathway involves aggregation or
nucleation, or how the RNA controls the process. Here we use interferometric
scattering microscopy to directly observe the in vitro assembly kinetics of
individual, unlabeled capsids of bacteriophage MS2. By measuring how many coat
proteins bind to individual MS2 RNA strands over time scales from 1 ms to 900
s, we find that the start of assembly is broadly distributed in time and is
followed by a rapid increase in the number of bound proteins. These
measurements provide strong evidence for a nucleation-and-growth pathway. We
also find that malformed structures assemble when multiple nuclei appear on the
same RNA before the first nucleus has finished growing. Our measurements reveal
the complex assembly pathways for viral capsids around RNA in quantitative
detail, including the nucleation threshold, nucleation time, growth time, and
constraints on the critical nucleus size. These results may inform strategies
for engineering synthetic capsids or for derailing the assembly of pathogenic
viruses.
| cond-mat.soft physics.bio-ph | the formation of a viral capsid the highlyordered protein shell that surrounds the genome of a virus is the canonical example of selfassembly the capsids of many positivesense rna viruses spontaneously assemble from in vitro mixtures of the coat protein and rna the high yield of proper capsids that assemble is remarkable given their structural complexity 180 identical proteins must arrange into three distinct local configurations to form an icosahedral capsid with a triangulation number of 3 t 3 despite a wealth of data from structural studies and simulations even the most fundamental questions about how these structures assemble remain unresolved experiments have not determined whether the assembly pathway involves aggregation or nucleation or how the rna controls the process here we use interferometric scattering microscopy to directly observe the in vitro assembly kinetics of individual unlabeled capsids of bacteriophage ms2 by measuring how many coat proteins bind to individual ms2 rna strands over time scales from 1 ms to 900 s we find that the start of assembly is broadly distributed in time and is followed by a rapid increase in the number of bound proteins these measurements provide strong evidence for a nucleationandgrowth pathway we also find that malformed structures assemble when multiple nuclei appear on the same rna before the first nucleus has finished growing our measurements reveal the complex assembly pathways for viral capsids around rna in quantitative detail including the nucleation threshold nucleation time growth time and constraints on the critical nucleus size these results may inform strategies for engineering synthetic capsids or for derailing the assembly of pathogenic viruses | [['the', 'formation', 'of', 'a', 'viral', 'capsid', 'the', 'highlyordered', 'protein', 'shell', 'that', 'surrounds', 'the', 'genome', 'of', 'a', 'virus', 'is', 'the', 'canonical', 'example', 'of', 'selfassembly', 'the', 'capsids', 'of', 'many', 'positivesense', 'rna', 'viruses', 'spontaneously', 'assemble', 'from', 'in', 'vitro', 'mixtures', 'of', 'the', 'coat', 'protein', 'and', 'rna', 'the', 'high', 'yield', 'of', 'proper', 'capsids', 'that', 'assemble', 'is', 'remarkable', 'given', 'their', 'structural', 'complexity', '180', 'identical', 'proteins', 'must', 'arrange', 'into', 'three', 'distinct', 'local', 'configurations', 'to', 'form', 'an', 'icosahedral', 'capsid', 'with', 'a', 'triangulation', 'number', 'of', '3', 't', '3', 'despite', 'a', 'wealth', 'of', 'data', 'from', 'structural', 'studies', 'and', 'simulations', 'even', 'the', 'most', 'fundamental', 'questions', 'about', 'how', 'these', 'structures', 'assemble', 'remain', 'unresolved', 'experiments', 'have', 'not', 'determined', 'whether', 'the', 'assembly', 'pathway', 'involves', 'aggregation', 'or', 'nucleation', 'or', 'how', 'the', 'rna', 'controls', 'the', 'process', 'here', 'we', 'use', 'interferometric', 'scattering', 'microscopy', 'to', 'directly', 'observe', 'the', 'in', 'vitro', 'assembly', 'kinetics', 'of', 'individual', 'unlabeled', 'capsids', 'of', 'bacteriophage', 'ms2', 'by', 'measuring', 'how', 'many', 'coat', 'proteins', 'bind', 'to', 'individual', 'ms2', 'rna', 'strands', 'over', 'time', 'scales', 'from', '1', 'ms', 'to', '900', 's', 'we', 'find', 'that', 'the', 'start', 'of', 'assembly', 'is', 'broadly', 'distributed', 'in', 'time', 'and', 'is', 'followed', 'by', 'a', 'rapid', 'increase', 'in', 'the', 'number', 'of', 'bound', 'proteins', 'these', 'measurements', 'provide', 'strong', 'evidence', 'for', 'a', 'nucleationandgrowth', 'pathway', 'we', 'also', 'find', 'that', 'malformed', 'structures', 'assemble', 'when', 'multiple', 'nuclei', 'appear', 'on', 'the', 'same', 'rna', 'before', 'the', 'first', 'nucleus', 'has', 'finished', 'growing', 'our', 'measurements', 'reveal', 'the', 'complex', 'assembly', 'pathways', 'for', 'viral', 'capsids', 'around', 'rna', 'in', 'quantitative', 'detail', 'including', 'the', 'nucleation', 'threshold', 'nucleation', 'time', 'growth', 'time', 'and', 'constraints', 'on', 'the', 'critical', 'nucleus', 'size', 'these', 'results', 'may', 'inform', 'strategies', 'for', 'engineering', 'synthetic', 'capsids', 'or', 'for', 'derailing', 'the', 'assembly', 'of', 'pathogenic', 'viruses']] | [-0.09028536288039476, 0.19179055431843814, -0.05357113975774017, 0.06639360630589236, -0.027245601378099032, -0.12389052811495001, 0.050105630441976245, 0.4005449906539015, -0.2660912374853841, -0.3228032315876617, 0.0522670526966756, -0.25391874912505347, -0.21146440021887733, 0.1462927825217996, -0.002902108715550805, -0.02377375500608733, 0.09399010050974814, -0.011329769118398844, 0.0704403936159162, -0.24347126614099002, 0.2222037576557892, 0.06696346257354668, 0.24274338733459555, 0.03029515812792824, 0.08128848866203264, -0.02338178276841063, 0.0075011570077163706, -0.001378836101414918, -0.22830110004184517, 0.12644926032799325, 0.2548476966068406, 0.1670997765825384, 0.24622715699175993, -0.4944086963225731, -0.21032768891503414, 0.10205924360497827, 0.20909298298890158, 0.17186833112359498, -0.1023661594112072, -0.20612430996190984, 0.1114720946581215, -0.08481112935855477, -0.085413389404149, -0.052162663469613166, 0.03469087757129631, 0.061982769677618337, -0.18056001749231876, 0.10206729179844842, 0.03102202109011793, 0.07228506448904448, -0.10595148679832081, -0.10959588757814896, -0.06490039266998682, 0.19711020741372273, 0.05296147591247008, 0.00542010009380509, 0.2818289470495515, -0.10359037958948068, -0.11393726850898626, 0.37705971875093935, 0.048291883672584045, -0.12080431987113005, 0.21630481826970493, -0.13777047980604976, -0.18964243986622684, 0.2159623343975523, 0.12393146256958558, 0.0852458005220714, -0.1578859781527695, 0.024290258732931266, 0.008124910591339523, 0.24042936648369173, 0.14028373543987982, -0.04615141998334421, 0.24216787963682276, 0.24037719336179594, 0.01165358379402085, 0.11687895747794148, -0.07946332286739947, -0.1024828260344679, -0.18434629106746853, -0.18870424991473556, -0.1323094853485765, 0.06110973406507445, -0.09569016822845725, -0.1847223527385557, 0.34225210652661964, 0.05465718659494693, 0.2121696102924144, 0.08070476120690617, 0.21031801487234505, -0.11463760230275732, 0.11705994152439278, -0.05019657699405357, 0.1638388262521899, 0.08638772491019953, 0.07106864537518325, -0.25448803372714657, 0.1194147955964471, -0.014449381031392311] |
1,802.05212 | First Extraction of Transversity from a Global Analysis of
Electron-Proton and Proton-Proton Data | We present the first extraction of the transversity distribution in the
framework of collinear factorization based on the global analysis of pion-pair
production in deep-inelastic scattering off transversely polarized targets and
in proton-proton collisions with one transversely polarized proton. The
extraction relies on the knowledge of di-hadron fragmentation functions, which
are taken from the analysis of electron-positron annihilation data. For the
first time, the chiral-odd transversity is extracted from a global analysis
similar to what is usually done for the chiral-even spin-averaged and helicity
distributions. The knowledge of transversity is important for, among other
things, detecting possible signals of new physics in high-precision low-energy
experiments.
| hep-ph hep-ex nucl-ex nucl-th | we present the first extraction of the transversity distribution in the framework of collinear factorization based on the global analysis of pionpair production in deepinelastic scattering off transversely polarized targets and in protonproton collisions with one transversely polarized proton the extraction relies on the knowledge of dihadron fragmentation functions which are taken from the analysis of electronpositron annihilation data for the first time the chiralodd transversity is extracted from a global analysis similar to what is usually done for the chiraleven spinaveraged and helicity distributions the knowledge of transversity is important for among other things detecting possible signals of new physics in highprecision lowenergy experiments | [['we', 'present', 'the', 'first', 'extraction', 'of', 'the', 'transversity', 'distribution', 'in', 'the', 'framework', 'of', 'collinear', 'factorization', 'based', 'on', 'the', 'global', 'analysis', 'of', 'pionpair', 'production', 'in', 'deepinelastic', 'scattering', 'off', 'transversely', 'polarized', 'targets', 'and', 'in', 'protonproton', 'collisions', 'with', 'one', 'transversely', 'polarized', 'proton', 'the', 'extraction', 'relies', 'on', 'the', 'knowledge', 'of', 'dihadron', 'fragmentation', 'functions', 'which', 'are', 'taken', 'from', 'the', 'analysis', 'of', 'electronpositron', 'annihilation', 'data', 'for', 'the', 'first', 'time', 'the', 'chiralodd', 'transversity', 'is', 'extracted', 'from', 'a', 'global', 'analysis', 'similar', 'to', 'what', 'is', 'usually', 'done', 'for', 'the', 'chiraleven', 'spinaveraged', 'and', 'helicity', 'distributions', 'the', 'knowledge', 'of', 'transversity', 'is', 'important', 'for', 'among', 'other', 'things', 'detecting', 'possible', 'signals', 'of', 'new', 'physics', 'in', 'highprecision', 'lowenergy', 'experiments']] | [-0.06704451889686641, 0.153178714978553, -0.183005004105646, 0.13817684370026526, -0.06424678550767048, -0.030186528842785353, -0.0179292755844515, 0.35876355029287793, -0.21209091087359758, -0.20936247051826545, -0.02843628420184056, -0.3384311547236783, 0.0009338606991583393, 0.17582188508240507, 0.12476814503648452, 0.10969514860660724, 0.07618238444639636, -0.006563972056444202, -0.02144160629305545, -0.1715872323140502, 0.430724903617409, 0.06027126349952249, 0.32255754120470514, 0.14467368979406145, 0.044803480044495136, 0.15196307497986017, -0.15789514775332508, -0.1335163166347359, -0.07001051323909667, 0.16561185304058848, 0.27325388432169956, 0.13719722366492662, 0.07771231910612966, -0.4204387790745213, -0.11902854402682611, 0.0893388611397573, 0.13973021869592014, 0.09900087948467227, -0.030373674642205948, -0.29310391504494915, 0.03484094097345535, -0.172483859361992, -0.12102029973729736, -0.13253159955853508, 0.021068434315245774, 0.0246931555193095, -0.31279080511913415, 0.06900918711686418, 0.020741991878354123, 0.027158889930606597, -0.028964320093482022, -0.22626085840165616, -0.045719543910984484, 0.10136200237487043, 0.1228927731890941, 0.09829866546206176, 0.13587337663131102, -0.17859086166468582, -0.16457595513423995, 0.37759536003605243, -0.019528008749087652, -0.17240712664178795, 0.09666464280647537, -0.23713201954960822, -0.211197068679723, 0.14175011946464933, 0.2618383203588781, 0.12680059119704223, -0.23999850982356638, 0.03335175204112949, -0.05741242714935825, 0.16291362804671128, 0.1115406127491345, 0.03370343986011687, 0.190832078581055, 0.23931110169561137, -0.015084565785669145, 0.06500065302797815, -0.15548812422701822, -0.07732212221571466, -0.36907233364070724, -0.08004546196066907, -0.16109088619594417, 0.05991534996844296, -0.045119437118271544, -0.08044987762612955, 0.3795100663744268, 0.1043443737684616, 0.24023116883777437, -0.05847764001782274, 0.39999249446250146, 0.07916861338363516, 0.0829509956717846, 0.06845214890338303, 0.2510526957256453, 0.16121755755240363, 0.1717150232887694, -0.19452445044936167, 0.1023614990613645, 0.040662663931115756] |
1,802.05213 | Counting subgraphs in fftp graphs with symmetry | Following ideas that go back to Cannon, we show the rationality of various
generating functions of growth sequences counting embeddings of convex
subgraphs in locally-finite, vertex-transitive graphs with the (relative)
falsification by fellow traveler property (fftp). In particular, we recover
results of Cannon, of Epstein, Iano-Fletcher and Zwick, and of Calegari and
Fujiwara. One of our applications concerns Schreier coset graphs of hyperbolic
groups relative to quasi-convex subgroups, we show that these graphs have
rational growth, the falsification by fellow traveler property, and the
existence of a lower bound for the growth rate independent of the finite
generating set and the infinite index quasi-convex subgroup.
| math.GR math.CO | following ideas that go back to cannon we show the rationality of various generating functions of growth sequences counting embeddings of convex subgraphs in locallyfinite vertextransitive graphs with the relative falsification by fellow traveler property fftp in particular we recover results of cannon of epstein ianofletcher and zwick and of calegari and fujiwara one of our applications concerns schreier coset graphs of hyperbolic groups relative to quasiconvex subgroups we show that these graphs have rational growth the falsification by fellow traveler property and the existence of a lower bound for the growth rate independent of the finite generating set and the infinite index quasiconvex subgroup | [['following', 'ideas', 'that', 'go', 'back', 'to', 'cannon', 'we', 'show', 'the', 'rationality', 'of', 'various', 'generating', 'functions', 'of', 'growth', 'sequences', 'counting', 'embeddings', 'of', 'convex', 'subgraphs', 'in', 'locallyfinite', 'vertextransitive', 'graphs', 'with', 'the', 'relative', 'falsification', 'by', 'fellow', 'traveler', 'property', 'fftp', 'in', 'particular', 'we', 'recover', 'results', 'of', 'cannon', 'of', 'epstein', 'ianofletcher', 'and', 'zwick', 'and', 'of', 'calegari', 'and', 'fujiwara', 'one', 'of', 'our', 'applications', 'concerns', 'schreier', 'coset', 'graphs', 'of', 'hyperbolic', 'groups', 'relative', 'to', 'quasiconvex', 'subgroups', 'we', 'show', 'that', 'these', 'graphs', 'have', 'rational', 'growth', 'the', 'falsification', 'by', 'fellow', 'traveler', 'property', 'and', 'the', 'existence', 'of', 'a', 'lower', 'bound', 'for', 'the', 'growth', 'rate', 'independent', 'of', 'the', 'finite', 'generating', 'set', 'and', 'the', 'infinite', 'index', 'quasiconvex', 'subgroup']] | [-0.11383731916654281, 0.09314943701387025, -0.08547007289822571, 0.0707111343060835, -0.12254174462913607, -0.097136559860351, 0.08857325390608121, 0.32408492761896923, -0.3139631573218279, -0.27184772527275175, 0.13487868916910464, -0.3058631393359974, -0.14321692368629066, 0.20426717612337178, -0.18682328870412535, 0.04844709549349947, 0.06160699720847053, 0.01829027264522245, 0.004725424263877078, -0.3362812486369736, 0.34518185509100124, -0.035020077583165124, 0.23860397436118758, 0.10290313142244346, 0.06724526149292405, 0.03527160450063933, -0.016348035701622184, 0.015600330769442596, -0.1810639300614499, 0.1651305614057212, 0.24616061765342379, 0.18421717195668372, 0.2916237454695735, -0.35138013320437705, -0.17672380636549162, 0.16339391608758327, 0.10308020379698764, 0.012602866598172113, -0.07963997447110999, -0.2783500206692574, 0.11565380370918249, -0.1603711684762787, -0.14998291731059837, -0.03279162027264157, 0.05157082179077686, 0.07896789798206345, -0.21489228405810606, 0.011413021541487139, 0.1414540105757064, 0.07311310083605349, -0.025034615819234975, -0.10659550542298418, -0.05600957874804198, 0.14923231211007357, 0.04678155890164467, -0.004418666255123054, 0.08400159859761167, -0.08832529445554918, -0.17753170557149972, 0.35402882986594564, -0.04245291530297926, -0.16932731818479413, 0.1503522414400672, -0.18389048381672743, -0.20853147389761245, 0.08418682624715774, 0.1472795315404745, 0.13823583267199305, -0.0514144464664591, 0.15610757057919938, -0.11663727402293052, 0.07628265762244925, 0.16753377920339027, -0.022084981297106985, 0.06309198567984052, 0.06307200897404422, 0.11612069456560466, 0.15976460889886276, 0.09830904295309804, -0.02424507126516591, -0.27745306695130867, -0.16127965904496916, -0.1665943602923877, 0.08689927592058666, -0.15840141331850296, -0.21563475391191717, 0.4137486800766335, 0.0852315554735609, 0.12492223089345945, 0.16448053131954601, 0.1834674169832187, 0.03527314655436315, 0.020082512459619187, 0.10684940166986333, 0.14051254677738492, 0.19018970733024895, -0.049496797647757024, -0.16341166836299145, 0.05936341027532203, 0.1897326003258618] |
1,802.05214 | Learning Privacy Preserving Encodings through Adversarial Training | We present a framework to learn privacy-preserving encodings of images that
inhibit inference of chosen private attributes, while allowing recovery of
other desirable information. Rather than simply inhibiting a given fixed
pre-trained estimator, our goal is that an estimator be unable to learn to
accurately predict the private attributes even with knowledge of the encoding
function. We use a natural adversarial optimization-based formulation for
this---training the encoding function against a classifier for the private
attribute, with both modeled as deep neural networks. The key contribution of
our work is a stable and convergent optimization approach that is successful at
learning an encoder with our desired properties---maintaining utility while
inhibiting inference of private attributes, not just within the adversarial
optimization, but also by classifiers that are trained after the encoder is
fixed. We adopt a rigorous experimental protocol for verification wherein
classifiers are trained exhaustively till saturation on the fixed encoders. We
evaluate our approach on tasks of real-world complexity---learning
high-dimensional encodings that inhibit detection of different scene
categories---and find that it yields encoders that are resilient at maintaining
privacy.
| cs.LG cs.CR cs.CV stat.ML | we present a framework to learn privacypreserving encodings of images that inhibit inference of chosen private attributes while allowing recovery of other desirable information rather than simply inhibiting a given fixed pretrained estimator our goal is that an estimator be unable to learn to accurately predict the private attributes even with knowledge of the encoding function we use a natural adversarial optimizationbased formulation for thistraining the encoding function against a classifier for the private attribute with both modeled as deep neural networks the key contribution of our work is a stable and convergent optimization approach that is successful at learning an encoder with our desired propertiesmaintaining utility while inhibiting inference of private attributes not just within the adversarial optimization but also by classifiers that are trained after the encoder is fixed we adopt a rigorous experimental protocol for verification wherein classifiers are trained exhaustively till saturation on the fixed encoders we evaluate our approach on tasks of realworld complexitylearning highdimensional encodings that inhibit detection of different scene categoriesand find that it yields encoders that are resilient at maintaining privacy | [['we', 'present', 'a', 'framework', 'to', 'learn', 'privacypreserving', 'encodings', 'of', 'images', 'that', 'inhibit', 'inference', 'of', 'chosen', 'private', 'attributes', 'while', 'allowing', 'recovery', 'of', 'other', 'desirable', 'information', 'rather', 'than', 'simply', 'inhibiting', 'a', 'given', 'fixed', 'pretrained', 'estimator', 'our', 'goal', 'is', 'that', 'an', 'estimator', 'be', 'unable', 'to', 'learn', 'to', 'accurately', 'predict', 'the', 'private', 'attributes', 'even', 'with', 'knowledge', 'of', 'the', 'encoding', 'function', 'we', 'use', 'a', 'natural', 'adversarial', 'optimizationbased', 'formulation', 'for', 'thistraining', 'the', 'encoding', 'function', 'against', 'a', 'classifier', 'for', 'the', 'private', 'attribute', 'with', 'both', 'modeled', 'as', 'deep', 'neural', 'networks', 'the', 'key', 'contribution', 'of', 'our', 'work', 'is', 'a', 'stable', 'and', 'convergent', 'optimization', 'approach', 'that', 'is', 'successful', 'at', 'learning', 'an', 'encoder', 'with', 'our', 'desired', 'propertiesmaintaining', 'utility', 'while', 'inhibiting', 'inference', 'of', 'private', 'attributes', 'not', 'just', 'within', 'the', 'adversarial', 'optimization', 'but', 'also', 'by', 'classifiers', 'that', 'are', 'trained', 'after', 'the', 'encoder', 'is', 'fixed', 'we', 'adopt', 'a', 'rigorous', 'experimental', 'protocol', 'for', 'verification', 'wherein', 'classifiers', 'are', 'trained', 'exhaustively', 'till', 'saturation', 'on', 'the', 'fixed', 'encoders', 'we', 'evaluate', 'our', 'approach', 'on', 'tasks', 'of', 'realworld', 'complexitylearning', 'highdimensional', 'encodings', 'that', 'inhibit', 'detection', 'of', 'different', 'scene', 'categoriesand', 'find', 'that', 'it', 'yields', 'encoders', 'that', 'are', 'resilient', 'at', 'maintaining', 'privacy']] | [-0.05689897273933249, -0.0024188208611615534, -0.08566259512943881, 0.07996851811717663, -0.11367344461780574, -0.2647577817152653, 0.0860952358418477, 0.45716324537992475, -0.28546613272279503, -0.30799792907865986, 0.06856164490537985, -0.2578138439011361, -0.1841639002093247, 0.16547069355404737, -0.12720114699564875, 0.09282123982374157, 0.09364909479660648, 0.06885324722688113, -0.049940024835190604, -0.32258163033585463, 0.32321030723729305, 0.06399966677501133, 0.3159409144946507, -0.014163082839388932, 0.158395591886448, -0.0049226130988349074, -0.0008862279089433806, -0.024770280633653913, -0.04673582493206985, 0.15994962326384016, 0.34342343800834246, 0.2424854897494827, 0.353399315206334, -0.39942599477512497, -0.20444590627614942, 0.09174824690113642, 0.12848276953146393, 0.14900051824282856, -0.03632896599750633, -0.3126745533783521, 0.14122979340010455, -0.15745482318103313, 0.02833626118887748, -0.18119034722447394, -0.05363919182480978, -0.02351266228793455, -0.32957538575798806, 0.021884827717440204, 0.09095525736255305, 0.043117528448679616, -0.06070472759726856, -0.08764033027059798, -0.03583235118538141, 0.17421754592231342, 0.024006912407598325, 0.06668013283583735, 0.17429679727713976, -0.17451039930369006, -0.1436649818292686, 0.32291537791490554, -0.04949169891794944, -0.22140828597758497, 0.15489173592733485, -0.00397079797727721, -0.15463274628722243, 0.12465237067746264, 0.2382846529249634, 0.14598209550870317, -0.16143467453973634, -0.020451194814605906, -0.07353658547891037, 0.20451938566086547, 0.0349981053479548, 0.02125404370150396, 0.1768571260664612, 0.23648903907409735, 0.07795398417061992, 0.14785556062490546, -0.08716667263369475, -0.0993860714243991, -0.24986002011224628, -0.059292233014213186, -0.2219568092688652, -0.016317763445549645, -0.11194325864040626, -0.14318772690586878, 0.36552306541312385, 0.25272927715842214, 0.21079263193233472, 0.1736828439686048, 0.394761134237051, 0.023073229956374106, 0.11339133503048547, 0.1461326057610235, 0.19923080792118397, 0.03145343420627926, 0.06195083369367889, -0.15241275412629227, 0.19837796254981574, 0.006923101479187608] |
1,802.05215 | The Eigenvalues Slicing Library (EVSL): Algorithms, Implementation, and
Software | This paper describes a software package called EVSL (for EigenValues Slicing
Library) for solving large sparse real symmetric standard and generalized
eigenvalue problems. As its name indicates, the package exploits spectrum
slicing, a strategy that consists of dividing the spectrum into a number of
subintervals and extracting eigenpairs from each subinterval independently. In
order to enable such a strategy, the methods implemented in EVSL rely on a
quick calculation of the spectral density of a given matrix, or a matrix pair.
What distinguishes EVSL from other currently available packages is that EVSL
relies entirely on filtering techniques. Polynomial and rational filtering are
both implemented and are coupled with Krylov subspace methods and the subspace
iteration algorithm. On the implementation side, the package offers interfaces
for various scenarios including matrix-free modes, whereby the user can supply
his/her own functions to perform matrix-vector operations or to solve sparse
linear systems. The paper describes the algorithms in EVSL, provides details on
their implementations, and discusses performance issues for the various
methods.
| math.NA | this paper describes a software package called evsl for eigenvalues slicing library for solving large sparse real symmetric standard and generalized eigenvalue problems as its name indicates the package exploits spectrum slicing a strategy that consists of dividing the spectrum into a number of subintervals and extracting eigenpairs from each subinterval independently in order to enable such a strategy the methods implemented in evsl rely on a quick calculation of the spectral density of a given matrix or a matrix pair what distinguishes evsl from other currently available packages is that evsl relies entirely on filtering techniques polynomial and rational filtering are both implemented and are coupled with krylov subspace methods and the subspace iteration algorithm on the implementation side the package offers interfaces for various scenarios including matrixfree modes whereby the user can supply hisher own functions to perform matrixvector operations or to solve sparse linear systems the paper describes the algorithms in evsl provides details on their implementations and discusses performance issues for the various methods | [['this', 'paper', 'describes', 'a', 'software', 'package', 'called', 'evsl', 'for', 'eigenvalues', 'slicing', 'library', 'for', 'solving', 'large', 'sparse', 'real', 'symmetric', 'standard', 'and', 'generalized', 'eigenvalue', 'problems', 'as', 'its', 'name', 'indicates', 'the', 'package', 'exploits', 'spectrum', 'slicing', 'a', 'strategy', 'that', 'consists', 'of', 'dividing', 'the', 'spectrum', 'into', 'a', 'number', 'of', 'subintervals', 'and', 'extracting', 'eigenpairs', 'from', 'each', 'subinterval', 'independently', 'in', 'order', 'to', 'enable', 'such', 'a', 'strategy', 'the', 'methods', 'implemented', 'in', 'evsl', 'rely', 'on', 'a', 'quick', 'calculation', 'of', 'the', 'spectral', 'density', 'of', 'a', 'given', 'matrix', 'or', 'a', 'matrix', 'pair', 'what', 'distinguishes', 'evsl', 'from', 'other', 'currently', 'available', 'packages', 'is', 'that', 'evsl', 'relies', 'entirely', 'on', 'filtering', 'techniques', 'polynomial', 'and', 'rational', 'filtering', 'are', 'both', 'implemented', 'and', 'are', 'coupled', 'with', 'krylov', 'subspace', 'methods', 'and', 'the', 'subspace', 'iteration', 'algorithm', 'on', 'the', 'implementation', 'side', 'the', 'package', 'offers', 'interfaces', 'for', 'various', 'scenarios', 'including', 'matrixfree', 'modes', 'whereby', 'the', 'user', 'can', 'supply', 'hisher', 'own', 'functions', 'to', 'perform', 'matrixvector', 'operations', 'or', 'to', 'solve', 'sparse', 'linear', 'systems', 'the', 'paper', 'describes', 'the', 'algorithms', 'in', 'evsl', 'provides', 'details', 'on', 'their', 'implementations', 'and', 'discusses', 'performance', 'issues', 'for', 'the', 'various', 'methods']] | [-0.11217093031432125, -0.01436642618362038, -0.0896725706822638, 0.020862900475982486, -0.11727528822458615, -0.19883615801137194, 0.005974454984035609, 0.3801038242028361, -0.28180873104082865, -0.2719776083332753, 0.14367139700958173, -0.2612513769944642, -0.13755810797391904, 0.22138996146670598, -0.05319995804789609, 0.09017289530207304, 0.11976277258474424, 0.00913997622583771, -0.09134754472879217, -0.22092482795900045, 0.30248568078137134, 0.053819408348534215, 0.27766212858703165, 0.02203317840550361, 0.1164575601190639, 0.041460028530785904, -0.09796786331294459, -0.022888066366292713, -0.07493760952924536, 0.13603740304963485, 0.28528133887864116, 0.22739984923862808, 0.3089619319597703, -0.42201154435142163, -0.14056362594766098, 0.0697768378526061, 0.1760496889945075, 0.09871425090975772, -0.03035073036915578, -0.24377446364156813, 0.08556681400832963, -0.17570670471814948, -0.0852693645643913, -0.11223569845121044, -0.056634364159046005, 0.024217469169879484, -0.30419402855581473, 0.005573382102219122, 0.005175253593950488, 0.03822665786581291, 0.013211143593209618, -0.16799336085456334, 0.04723791239389573, 0.10648225702780542, -0.01398053415080843, -0.0218941333753589, 0.1510726614866317, -0.06358615902163797, -0.1341051716285403, 0.386643582106834, -0.019666088759549893, -0.23870468779378348, 0.1775135552632578, -0.026781988019744556, -0.14882311146634275, 0.10418702675295728, 0.19167215173521462, 0.11418024482693345, -0.13785864305238993, 0.153066946030733, 0.013247279834883687, 0.18050201350637335, 0.03152512259215915, 0.0051809487382083064, 0.15053131898804123, 0.14070930283854804, 0.08417027712234162, 0.11297718667559647, -0.02499674544170765, -0.0992169184859709, -0.2434682705788873, -0.14378877445900193, -0.21432202976124937, -0.052238610614689866, -0.07620823161813037, -0.21958168596895467, 0.4643133654192622, 0.13189105078067986, 0.15270873470719726, 0.06257446801118065, 0.37372753130260944, 0.07764417702232354, 0.08280528616749161, 0.13660624433569388, 0.11307199340843085, 0.08613284280207674, 0.09890161419752985, -0.17843188334552992, 0.05276199236478923, 0.12380091469579686] |
1,802.05216 | Mechanistic, empirical and numerical perspectives on wind-waves
interaction | A mechanistic theory of wind-wave interaction must rely on verifiable
assumptions and offer reproducible observable predictions. For decades, the
limited mechanistic grasp on the problem has motivated RANS and LES modeling
and has driven a vast empirical effort to describe the interaction in terms of
wave-induced modifications of standard statistical characteristics of the wind,
such as wind profile, kinetic energy balance or exchange coefficients. Because
the mechanistic, empirical and numerical approaches are all concerned with the
same phenomenon occurring in the same media, consistency here requires that the
assumptions on which the approaches rest and the predictions they generate are
compatible with each other and supported by measurements. Recent findings from
theoretical analysis and field experiments advanced the understanding of the
statistical and dynamic patterns of the wave-coherent flow, which is at the
core of the mechanistic description of the wind-wave exchange. The progress
prompts reexamining of earlier concepts, efforts and findings to evaluate their
suitability, validity and usefulness. For the purpose, this survey traces the
development of ideas, methods and results in the study of the wind wave
generation.
| physics.flu-dyn physics.geo-ph | a mechanistic theory of windwave interaction must rely on verifiable assumptions and offer reproducible observable predictions for decades the limited mechanistic grasp on the problem has motivated rans and les modeling and has driven a vast empirical effort to describe the interaction in terms of waveinduced modifications of standard statistical characteristics of the wind such as wind profile kinetic energy balance or exchange coefficients because the mechanistic empirical and numerical approaches are all concerned with the same phenomenon occurring in the same media consistency here requires that the assumptions on which the approaches rest and the predictions they generate are compatible with each other and supported by measurements recent findings from theoretical analysis and field experiments advanced the understanding of the statistical and dynamic patterns of the wavecoherent flow which is at the core of the mechanistic description of the windwave exchange the progress prompts reexamining of earlier concepts efforts and findings to evaluate their suitability validity and usefulness for the purpose this survey traces the development of ideas methods and results in the study of the wind wave generation | [['a', 'mechanistic', 'theory', 'of', 'windwave', 'interaction', 'must', 'rely', 'on', 'verifiable', 'assumptions', 'and', 'offer', 'reproducible', 'observable', 'predictions', 'for', 'decades', 'the', 'limited', 'mechanistic', 'grasp', 'on', 'the', 'problem', 'has', 'motivated', 'rans', 'and', 'les', 'modeling', 'and', 'has', 'driven', 'a', 'vast', 'empirical', 'effort', 'to', 'describe', 'the', 'interaction', 'in', 'terms', 'of', 'waveinduced', 'modifications', 'of', 'standard', 'statistical', 'characteristics', 'of', 'the', 'wind', 'such', 'as', 'wind', 'profile', 'kinetic', 'energy', 'balance', 'or', 'exchange', 'coefficients', 'because', 'the', 'mechanistic', 'empirical', 'and', 'numerical', 'approaches', 'are', 'all', 'concerned', 'with', 'the', 'same', 'phenomenon', 'occurring', 'in', 'the', 'same', 'media', 'consistency', 'here', 'requires', 'that', 'the', 'assumptions', 'on', 'which', 'the', 'approaches', 'rest', 'and', 'the', 'predictions', 'they', 'generate', 'are', 'compatible', 'with', 'each', 'other', 'and', 'supported', 'by', 'measurements', 'recent', 'findings', 'from', 'theoretical', 'analysis', 'and', 'field', 'experiments', 'advanced', 'the', 'understanding', 'of', 'the', 'statistical', 'and', 'dynamic', 'patterns', 'of', 'the', 'wavecoherent', 'flow', 'which', 'is', 'at', 'the', 'core', 'of', 'the', 'mechanistic', 'description', 'of', 'the', 'windwave', 'exchange', 'the', 'progress', 'prompts', 'reexamining', 'of', 'earlier', 'concepts', 'efforts', 'and', 'findings', 'to', 'evaluate', 'their', 'suitability', 'validity', 'and', 'usefulness', 'for', 'the', 'purpose', 'this', 'survey', 'traces', 'the', 'development', 'of', 'ideas', 'methods', 'and', 'results', 'in', 'the', 'study', 'of', 'the', 'wind', 'wave', 'generation']] | [-0.08909844022371687, 0.06961804896062396, -0.09053308513098755, 0.07414958153086501, -0.09084234984237805, -0.08021167917427471, 0.03356374304822266, 0.34174967401364414, -0.22718004991336824, -0.3322625527699483, 0.10798449079992573, -0.27985282502704245, -0.13438445779068303, 0.2267774137025751, -0.020209465940696236, 0.06490025798108574, 0.08753688177145892, -0.02059596532425068, -0.035657214749391146, -0.18772722024330088, 0.3057772660245547, 0.09892894264896578, 0.32230280723953464, 0.09807415473321712, 0.0892520695755664, -0.023445042337982933, -0.10785542657161808, 0.011339885479895472, -0.16651203001573112, 0.18093004682382266, 0.22671170595463616, 0.15168995623783776, 0.29213490760651045, -0.49738508133040793, -0.26269665569087813, 0.0346005424000609, 0.1058609530605459, 0.09291442493158887, -0.04566518999779254, -0.25422068615964294, 0.05879770322977929, -0.166329924368388, -0.12844095967824481, -0.08230654745071335, -0.005111345089321654, 0.06736677715863107, -0.24174084056262446, 0.06688620521967929, 0.05901697309240283, 0.11910756666202868, -0.07239708473500094, -0.09900458818353587, -0.00017501114394161954, 0.14338371790256144, 0.1033631448397236, -0.009095837066844938, 0.1370304582439566, -0.16599914732101528, -0.12659232406850968, 0.39658282539032025, -0.04324240420357059, -0.17494349904492038, 0.2452985684025783, -0.11763265774606119, -0.11922539566908885, 0.08922206946874985, 0.16068766955787045, 0.05756540971355482, -0.1408973955991548, 0.06062894406586667, -0.00487434933234888, 0.14177306642100299, 0.000725883878663432, 0.011491041151187565, 0.22075731104484358, 0.19415936691884222, -0.025056316579728486, 0.04199310911555291, -0.041751223773690324, -0.15143946207040015, -0.29474868626963324, -0.11660025109583771, -0.139602993567495, 0.016711354591508458, -0.058861930166938935, -0.13869543787737132, 0.4105442176994415, 0.21105099683783574, 0.17060889712763774, 0.034295422309071774, 0.3173131043216286, 0.07385696912335242, 0.0391164581731512, 0.03356353369900468, 0.2663857624228711, 0.12861341085706385, 0.13575299802774762, -0.20859270658494916, 0.14379921263700363, 0.011816038396313537] |
1,802.05217 | The space of relative orders and a generalization of Morris indicability
theorem | We introduce the space of relative orders on a group and show that it is
compact whenever the group is finitely generated. We use this to show that if
$G$ is a finitely generated group acting by order preserving homeomorphism of
on the line, then if some stabilizer of a point is proper and co-amenable
subgroup, then $G$ surjects onto $\mathbb{Z}$. This is a generalization of a
theorem of Morris.
| math.GR math.DS | we introduce the space of relative orders on a group and show that it is compact whenever the group is finitely generated we use this to show that if g is a finitely generated group acting by order preserving homeomorphism of on the line then if some stabilizer of a point is proper and coamenable subgroup then g surjects onto mathbbz this is a generalization of a theorem of morris | [['we', 'introduce', 'the', 'space', 'of', 'relative', 'orders', 'on', 'a', 'group', 'and', 'show', 'that', 'it', 'is', 'compact', 'whenever', 'the', 'group', 'is', 'finitely', 'generated', 'we', 'use', 'this', 'to', 'show', 'that', 'if', 'g', 'is', 'a', 'finitely', 'generated', 'group', 'acting', 'by', 'order', 'preserving', 'homeomorphism', 'of', 'on', 'the', 'line', 'then', 'if', 'some', 'stabilizer', 'of', 'a', 'point', 'is', 'proper', 'and', 'coamenable', 'subgroup', 'then', 'g', 'surjects', 'onto', 'mathbbz', 'this', 'is', 'a', 'generalization', 'of', 'a', 'theorem', 'of', 'morris']] | [-0.152789692713746, 0.13886703199573924, -0.12065732879564166, -0.023596197488119027, -0.10264557107750859, -0.07569044698694986, 0.0389045714932893, 0.4219822981261781, -0.34089079552463125, -0.16919401232153178, 0.13824704068579843, -0.28092021206393836, -0.14419202051524604, 0.23479981242812106, -0.14646652536466717, -0.08831903557958347, 0.07308953979185649, 0.14342672134350454, -0.07323627455293068, -0.2650712462241894, 0.40548244221135976, -0.07803411398615157, 0.2024528623957719, 0.03645511927482273, 0.16402666713111103, -0.014785275834479502, -0.020508711824991872, 0.03194664349139202, -0.10502566103927426, 0.09135679162240454, 0.20337657925805874, 0.08445152274465986, 0.2801446925050446, -0.3070538646142398, -0.17698240546243532, 0.22417519087237972, 0.07032421615773014, 0.0011182956896456226, -0.0825587677004348, -0.291640316216009, 0.2138869224615129, -0.19764505409236466, -0.10727863908811872, -0.0618875610509089, 0.12395286123667444, -0.02254684918693134, -0.26609804543799587, -0.04058634757197329, 0.1258578610179289, 0.06249684232524097, 0.025948186519755317, 0.0077785489415483815, -0.09548410306285535, 0.10601737855800561, -0.022879410930909217, 0.1001034116305943, 0.13069307217374443, -0.03109867769027395, -0.08158189185362841, 0.45885045869009833, -0.0912634722173347, -0.23504969955288937, 0.15369582761611258, -0.1826144607837445, -0.18277500697544644, 0.09420306318040406, 0.0705137335362711, 0.16471115721921836, -0.02175926503592304, 0.2149935944355093, -0.1780205523994352, 0.14602110603633003, 0.04769159367840205, -0.0426044947767098, 0.11093871342018247, 0.10999304808543196, 0.15640214031030025, 0.14960328403727285, 0.015144008910283446, 0.07173024777855191, -0.36941114451204027, -0.1926971648154514, -0.20458106438496282, 0.1448648614941963, -0.061669354339911865, -0.15570104670311724, 0.40052218908843185, 0.09713120828382671, 0.1506638549933476, 0.08206309162612473, 0.2460868805114712, 0.09096386567356864, 0.05175513462828738, 0.13135321110353937, 0.08254612637226404, 0.1835029046483604, -0.18093929898126848, -0.161938135267701, -0.014030850711943849, 0.2080762087367475] |
1,802.05218 | Statistical Inference for inter-arrival times of extreme events in
bursty time series | In many complex systems studied in statistical physics, inter-arrival times
between events such as solar flares, trades and neuron voltages follow a
heavy-tailed distribution. The set of event times is fractal-like, being dense
in some time windows and empty in others, a phenomenon which has been dubbed
"bursty". A new model for the inter-exceedance times of events above high
thresholds is proposed. For high thresholds and infinite-mean waiting times, it
is shown that the times between threshold crossings are Mittag-Leffler
distributed, and thus form a "fractional Poisson Process" which generalizes the
standard Poisson Process of threshold exceedances. Graphical means of
estimating model parameters and assessing model fit are provided. The inference
method is applied to an empirical bursty time series, and it is shown how the
memory of the Mittag-Leffler distribution affects prediction of the time until
the next extreme event."
| math.ST stat.TH | in many complex systems studied in statistical physics interarrival times between events such as solar flares trades and neuron voltages follow a heavytailed distribution the set of event times is fractallike being dense in some time windows and empty in others a phenomenon which has been dubbed bursty a new model for the interexceedance times of events above high thresholds is proposed for high thresholds and infinitemean waiting times it is shown that the times between threshold crossings are mittagleffler distributed and thus form a fractional poisson process which generalizes the standard poisson process of threshold exceedances graphical means of estimating model parameters and assessing model fit are provided the inference method is applied to an empirical bursty time series and it is shown how the memory of the mittagleffler distribution affects prediction of the time until the next extreme event | [['in', 'many', 'complex', 'systems', 'studied', 'in', 'statistical', 'physics', 'interarrival', 'times', 'between', 'events', 'such', 'as', 'solar', 'flares', 'trades', 'and', 'neuron', 'voltages', 'follow', 'a', 'heavytailed', 'distribution', 'the', 'set', 'of', 'event', 'times', 'is', 'fractallike', 'being', 'dense', 'in', 'some', 'time', 'windows', 'and', 'empty', 'in', 'others', 'a', 'phenomenon', 'which', 'has', 'been', 'dubbed', 'bursty', 'a', 'new', 'model', 'for', 'the', 'interexceedance', 'times', 'of', 'events', 'above', 'high', 'thresholds', 'is', 'proposed', 'for', 'high', 'thresholds', 'and', 'infinitemean', 'waiting', 'times', 'it', 'is', 'shown', 'that', 'the', 'times', 'between', 'threshold', 'crossings', 'are', 'mittagleffler', 'distributed', 'and', 'thus', 'form', 'a', 'fractional', 'poisson', 'process', 'which', 'generalizes', 'the', 'standard', 'poisson', 'process', 'of', 'threshold', 'exceedances', 'graphical', 'means', 'of', 'estimating', 'model', 'parameters', 'and', 'assessing', 'model', 'fit', 'are', 'provided', 'the', 'inference', 'method', 'is', 'applied', 'to', 'an', 'empirical', 'bursty', 'time', 'series', 'and', 'it', 'is', 'shown', 'how', 'the', 'memory', 'of', 'the', 'mittagleffler', 'distribution', 'affects', 'prediction', 'of', 'the', 'time', 'until', 'the', 'next', 'extreme', 'event']] | [-0.10521955300803404, 0.13034536029313099, -0.08885103075014655, 0.15352287294403102, -0.013118296020778178, -0.1340245430645861, 0.06736910562935493, 0.40520205299148887, -0.2513795278182508, -0.31413527138584807, 0.09704877241856331, -0.2666985314312599, -0.14853702518057157, 0.1899988079031514, -0.0690563049556004, 0.09266063905314362, 0.05084121706158513, 0.060197322435087436, -0.013284430241131847, -0.24498517062220213, 0.23098226282293338, 0.10426131634166458, 0.2903316586861293, -0.011111920391269726, 0.12860080629935583, -0.03838027408639666, -0.040096143577599615, -0.03666174593515587, -0.0871721476925434, 0.015490307440820465, 0.21828002379637668, 0.13386156278823189, 0.27550140249696997, -0.4220167951936425, -0.2460956121660876, 0.13652200042772636, 0.14387970543366005, 0.004388431394924979, -0.000555369683889766, -0.2705092539528398, 0.09632608609394633, -0.17469509593345117, -0.0946635665780724, -0.02420927347320554, 0.09701921315796727, 0.07174634638999541, -0.3191307596326303, 0.11949140930225027, 0.06770258035725184, 0.0036931056696787585, -0.0069472757042486144, -0.08189816913850566, 0.005925393618120671, 0.101624288767067, 0.08407528207531842, -0.006402529414287574, 0.13957682413404152, -0.12344824044342093, -0.12822796202100573, 0.34806956655660765, 0.002350375129968571, -0.14313921619505765, 0.17624119973386362, -0.16761271611338469, -0.14635021953756433, 0.15165020114065503, 0.18577010975815625, 0.08877397639502724, -0.20056110916980843, 0.056407715245016025, 0.001285604877973632, 0.1226493228308977, 0.07733348826040252, 0.00012813606165456686, 0.17486062001356548, 0.23421532428897113, 0.0568044082451739, 0.08562439312260571, -0.11357517368093187, -0.16390582209406085, -0.28052227873113944, -0.12902696142576153, -0.18671715205280687, 0.03752184214184342, -0.12434664543524633, -0.17179211563549654, 0.41383183480026, 0.134074933893925, 0.24206659918074772, 0.08899253915129364, 0.24073981046140622, 0.19715470538431487, 0.030652002454902842, 0.08108892903331141, 0.12018522622985865, 0.0907497249959077, 0.09955973581498047, -0.12174036283788887, 0.1487642443176064, 0.009690602665110458] |
1,802.05219 | Who Killed Albert Einstein? From Open Data to Murder Mystery Games | This paper presents a framework for generating adventure games from open
data. Focusing on the murder mystery type of adventure games, the generator is
able to transform open data from Wikipedia articles, OpenStreetMap and images
from Wikimedia Commons into WikiMysteries. Every WikiMystery game revolves
around the murder of a person with a Wikipedia article and populates the game
with suspects who must be arrested by the player if guilty of the murder or
absolved if innocent. Starting from only one person as the victim, an extensive
generative pipeline finds suspects, their alibis, and paths connecting them
from open data, transforms open data into cities, buildings, non-player
characters, locks and keys and dialog options. The paper describes in detail
each generative step, provides a specific playthrough of one WikiMystery where
Albert Einstein is murdered, and evaluates the outcomes of games generated for
the 100 most influential people of the 20th century.
| cs.AI | this paper presents a framework for generating adventure games from open data focusing on the murder mystery type of adventure games the generator is able to transform open data from wikipedia articles openstreetmap and images from wikimedia commons into wikimysteries every wikimystery game revolves around the murder of a person with a wikipedia article and populates the game with suspects who must be arrested by the player if guilty of the murder or absolved if innocent starting from only one person as the victim an extensive generative pipeline finds suspects their alibis and paths connecting them from open data transforms open data into cities buildings nonplayer characters locks and keys and dialog options the paper describes in detail each generative step provides a specific playthrough of one wikimystery where albert einstein is murdered and evaluates the outcomes of games generated for the 100 most influential people of the 20th century | [['this', 'paper', 'presents', 'a', 'framework', 'for', 'generating', 'adventure', 'games', 'from', 'open', 'data', 'focusing', 'on', 'the', 'murder', 'mystery', 'type', 'of', 'adventure', 'games', 'the', 'generator', 'is', 'able', 'to', 'transform', 'open', 'data', 'from', 'wikipedia', 'articles', 'openstreetmap', 'and', 'images', 'from', 'wikimedia', 'commons', 'into', 'wikimysteries', 'every', 'wikimystery', 'game', 'revolves', 'around', 'the', 'murder', 'of', 'a', 'person', 'with', 'a', 'wikipedia', 'article', 'and', 'populates', 'the', 'game', 'with', 'suspects', 'who', 'must', 'be', 'arrested', 'by', 'the', 'player', 'if', 'guilty', 'of', 'the', 'murder', 'or', 'absolved', 'if', 'innocent', 'starting', 'from', 'only', 'one', 'person', 'as', 'the', 'victim', 'an', 'extensive', 'generative', 'pipeline', 'finds', 'suspects', 'their', 'alibis', 'and', 'paths', 'connecting', 'them', 'from', 'open', 'data', 'transforms', 'open', 'data', 'into', 'cities', 'buildings', 'nonplayer', 'characters', 'locks', 'and', 'keys', 'and', 'dialog', 'options', 'the', 'paper', 'describes', 'in', 'detail', 'each', 'generative', 'step', 'provides', 'a', 'specific', 'playthrough', 'of', 'one', 'wikimystery', 'where', 'albert', 'einstein', 'is', 'murdered', 'and', 'evaluates', 'the', 'outcomes', 'of', 'games', 'generated', 'for', 'the', '100', 'most', 'influential', 'people', 'of', 'the', '20th', 'century']] | [-0.060822148428394875, 0.053140913573061596, -0.10941536159511527, 0.08679496529592394, -0.13856851352250268, -0.19832217736362384, 0.09613055941841468, 0.35095285472684895, -0.2561820954317227, -0.3079763140529394, 0.09283033756073564, -0.3750252842389304, -0.13379856302274457, 0.16050673202563334, -0.15273756263456467, -0.034448710283874695, 0.13379555206729807, 0.09038243874795093, 0.08395337246133593, -0.2917499450581341, 0.3566722086173631, 0.0015451422655665926, 0.23432801026080188, 0.006525434707773143, 0.14063659370555703, 0.01664390079466353, -0.04768470244096785, -0.025870341878255893, -0.09420904908489822, 0.12855587873591817, 0.34194536126893144, 0.2505782426019793, 0.37637898723177354, -0.4064133012938265, -0.1063852711371949, 0.0688259158202182, 0.10788100446686791, 0.10115050535070999, -0.04322797225804293, -0.3759434021174394, 0.05990439561548932, -0.1742592351735923, -0.05320424436880597, 0.0034707634870348304, 0.03563921387500033, -0.01920071254115038, -0.2245575145569405, -0.019114055715758225, 0.04717030724960154, 0.09159686000825003, -0.042561350491475955, -0.09702255760223187, 0.008536123452258522, 0.2492973933333595, 0.05533744042482355, 0.04568354381441042, 0.11456718918634579, -0.16088300226095678, -0.17711262608525055, 0.4190287879828749, -0.013653741092099969, -0.09039803683227891, 0.10953598158947866, -0.06911097776530117, -0.13461304765258883, 0.06145174858834723, 0.1572703845285136, 0.09769679133234353, -0.190137822136026, 0.04500607368857439, -0.09134981340792929, 0.16538206080360146, 0.11923363442564833, -0.057117066940228486, 0.2279059536241252, 0.1952203628542865, 0.03740660022494608, 0.11902562418053377, -0.03253515263525609, -0.11568429069914694, -0.22130412329148885, -0.15662134200784153, -0.14945308663882315, 0.05401173099746992, -0.024222228222663098, -0.14236519781647827, 0.4234620153775503, 0.1577418839688421, 0.11280481290586036, 0.03549938758128676, 0.28053484771015313, -0.02936561786296681, 0.08266349748913038, 0.13397497551772616, 0.09381437460281726, 0.0005858812481164932, 0.1874762195997454, -0.08882687370100155, 0.10119274311281484, 0.04785169286508884] |
1,802.0522 | ON states as resource units for universal quantum computation with
photonic architectures | Universal quantum computation using photonic systems requires gates whose
Hamiltonians are of order greater than quadratic in the quadrature operators.
We first review previous proposals to implement such gates, where specific
non-Gaussian states are used as resources in conjunction with entangling gates
such as the continuous-variable versions of C-PHASE and C-NOT gates. We then
propose ON states which are superpositions of the vacuum and the $N^{th}$ Fock
state, for use as non-Gaussian resource states. We show that ON states can be
used to implement the cubic and higher-order quadrature phase gates to first
order in gate strength. There are several advantages to this method such as
reduced number of superpositions in the resource state preparation and greater
control over the final gate. We also introduce useful figures of merit to
characterize gate performance. Utilising a supply of on-demand resource states
one can potentially scale up implementation to greater accuracy, by repeated
application of the basic circuit.
| quant-ph physics.optics | universal quantum computation using photonic systems requires gates whose hamiltonians are of order greater than quadratic in the quadrature operators we first review previous proposals to implement such gates where specific nongaussian states are used as resources in conjunction with entangling gates such as the continuousvariable versions of cphase and cnot gates we then propose on states which are superpositions of the vacuum and the nth fock state for use as nongaussian resource states we show that on states can be used to implement the cubic and higherorder quadrature phase gates to first order in gate strength there are several advantages to this method such as reduced number of superpositions in the resource state preparation and greater control over the final gate we also introduce useful figures of merit to characterize gate performance utilising a supply of ondemand resource states one can potentially scale up implementation to greater accuracy by repeated application of the basic circuit | [['universal', 'quantum', 'computation', 'using', 'photonic', 'systems', 'requires', 'gates', 'whose', 'hamiltonians', 'are', 'of', 'order', 'greater', 'than', 'quadratic', 'in', 'the', 'quadrature', 'operators', 'we', 'first', 'review', 'previous', 'proposals', 'to', 'implement', 'such', 'gates', 'where', 'specific', 'nongaussian', 'states', 'are', 'used', 'as', 'resources', 'in', 'conjunction', 'with', 'entangling', 'gates', 'such', 'as', 'the', 'continuousvariable', 'versions', 'of', 'cphase', 'and', 'cnot', 'gates', 'we', 'then', 'propose', 'on', 'states', 'which', 'are', 'superpositions', 'of', 'the', 'vacuum', 'and', 'the', 'nth', 'fock', 'state', 'for', 'use', 'as', 'nongaussian', 'resource', 'states', 'we', 'show', 'that', 'on', 'states', 'can', 'be', 'used', 'to', 'implement', 'the', 'cubic', 'and', 'higherorder', 'quadrature', 'phase', 'gates', 'to', 'first', 'order', 'in', 'gate', 'strength', 'there', 'are', 'several', 'advantages', 'to', 'this', 'method', 'such', 'as', 'reduced', 'number', 'of', 'superpositions', 'in', 'the', 'resource', 'state', 'preparation', 'and', 'greater', 'control', 'over', 'the', 'final', 'gate', 'we', 'also', 'introduce', 'useful', 'figures', 'of', 'merit', 'to', 'characterize', 'gate', 'performance', 'utilising', 'a', 'supply', 'of', 'ondemand', 'resource', 'states', 'one', 'can', 'potentially', 'scale', 'up', 'implementation', 'to', 'greater', 'accuracy', 'by', 'repeated', 'application', 'of', 'the', 'basic', 'circuit']] | [-0.13494541848717162, 0.16049670365949473, -0.031808127858079016, 0.022192665530243315, 0.008934555081232714, -0.19751691077209005, 0.09075269525652775, 0.40903898559582347, -0.2373610885742192, -0.32536234719177276, 0.08326812321618678, -0.22682285361971039, -0.10670411354826334, 0.27162357687782973, -0.08673268359565647, 0.1489443742783549, 0.029360026731573712, -0.0007481981540480867, -0.08218362048501149, -0.2877380043456259, 0.28268241342336226, 0.008921646670504019, 0.2693162799980014, 0.001825127714815048, 0.08701041200756429, -0.026097267770614378, 0.06457094335107683, -0.043540655593507185, -0.06809168129746887, 0.11973818028248691, 0.2861001588872825, 0.12080701048342654, 0.2686362912496313, -0.4763733096516285, -0.15315808216259122, 0.10281848387780766, 0.13257817565635122, 0.19080580322751745, 0.009511324095700938, -0.30009134141623806, 0.02870699086671289, -0.22615853074388817, -0.07349728121726702, -0.20881580967957583, 0.01068618189310655, 0.0029646439674811866, -0.2371210262316685, 0.036310216580414605, 0.020956705407558892, 0.013538868602317495, 0.03978849571938507, -0.10760234923173602, -0.002411289039091804, 0.11115875757800844, -0.1085083649123613, -0.008274483951166846, 0.15550754005865505, -0.11888046321482995, -0.2267089897247318, 0.3424569029772941, -0.037503764505415274, -0.22042828759190458, 0.14199411700396106, -0.08626127587138818, -0.0843778547221938, 0.032424659080182515, 0.1709715869704572, 0.0966424349611864, -0.09595904315714367, 0.03453231086053002, 0.06469775627080637, 0.2160698352381587, 0.08654914698742616, 0.16489442633852983, 0.15280579113198492, 0.10493178951004759, 0.11753431098977438, 0.22518503159293546, -0.051550675953666754, -0.12857266311169577, -0.3574613700053679, -0.19955763516899866, -0.23393987867837915, 0.06507912447947699, -0.03711309993172435, -0.1462104313630754, 0.44733414091528034, 0.17009182699266837, 0.13655633244735116, 0.025738947164380733, 0.31669961846170896, 0.13949150533284035, 0.11954145764227575, 0.06779044500002876, 0.17341607800111747, 0.13782217627755391, 0.01764283097238662, -0.2137282659741453, 0.05898449102189774, 0.017080447148122728] |
1,802.05221 | Stochastic Darboux transformations for quasi-birth-and-death processes
and urn models | We consider stochastic UL and LU block factorizations of the one-step
transition probability matrix for a discrete-time quasi-birth-and-death
process, namely a stochastic block tridiagonal matrix. The simpler case of
random walks with only nearest neighbors transitions gives a unique LU
factorization and a one-parameter family of factorizations in the UL case. The
block structure considered here yields many more possible factorizations
resulting in a much enlarged class of potential applications. By reversing the
order of the factors (also known as a Darboux transformation) we get new
families of quasi-birth-and-death processes where it is possible to identify
the matrix-valued spectral measures in terms of a Geronimus (UL) or a
Christoffel (LU) transformation of the original one. We apply our results to
one example going with matrix-valued Jacobi polynomials arising in group
representation theory. We also give urn models for some particular cases.
| math.PR math.CA | we consider stochastic ul and lu block factorizations of the onestep transition probability matrix for a discretetime quasibirthanddeath process namely a stochastic block tridiagonal matrix the simpler case of random walks with only nearest neighbors transitions gives a unique lu factorization and a oneparameter family of factorizations in the ul case the block structure considered here yields many more possible factorizations resulting in a much enlarged class of potential applications by reversing the order of the factors also known as a darboux transformation we get new families of quasibirthanddeath processes where it is possible to identify the matrixvalued spectral measures in terms of a geronimus ul or a christoffel lu transformation of the original one we apply our results to one example going with matrixvalued jacobi polynomials arising in group representation theory we also give urn models for some particular cases | [['we', 'consider', 'stochastic', 'ul', 'and', 'lu', 'block', 'factorizations', 'of', 'the', 'onestep', 'transition', 'probability', 'matrix', 'for', 'a', 'discretetime', 'quasibirthanddeath', 'process', 'namely', 'a', 'stochastic', 'block', 'tridiagonal', 'matrix', 'the', 'simpler', 'case', 'of', 'random', 'walks', 'with', 'only', 'nearest', 'neighbors', 'transitions', 'gives', 'a', 'unique', 'lu', 'factorization', 'and', 'a', 'oneparameter', 'family', 'of', 'factorizations', 'in', 'the', 'ul', 'case', 'the', 'block', 'structure', 'considered', 'here', 'yields', 'many', 'more', 'possible', 'factorizations', 'resulting', 'in', 'a', 'much', 'enlarged', 'class', 'of', 'potential', 'applications', 'by', 'reversing', 'the', 'order', 'of', 'the', 'factors', 'also', 'known', 'as', 'a', 'darboux', 'transformation', 'we', 'get', 'new', 'families', 'of', 'quasibirthanddeath', 'processes', 'where', 'it', 'is', 'possible', 'to', 'identify', 'the', 'matrixvalued', 'spectral', 'measures', 'in', 'terms', 'of', 'a', 'geronimus', 'ul', 'or', 'a', 'christoffel', 'lu', 'transformation', 'of', 'the', 'original', 'one', 'we', 'apply', 'our', 'results', 'to', 'one', 'example', 'going', 'with', 'matrixvalued', 'jacobi', 'polynomials', 'arising', 'in', 'group', 'representation', 'theory', 'we', 'also', 'give', 'urn', 'models', 'for', 'some', 'particular', 'cases']] | [-0.1126233343330562, 0.06015397843979926, -0.02950083847151052, 0.06714890657821478, -0.0815414967616452, -0.17788295759588268, 0.07218014906203467, 0.3732332198002131, -0.3317572922340152, -0.16042145942370836, 0.11898701273174031, -0.2660275987739153, -0.23380088529397622, 0.12366390295891448, -0.05049432756326406, 0.04410789258355367, 0.0169289337920276, 0.06217680363882835, -0.16118844087047385, -0.264624638681082, 0.32080834236735783, 0.02156584502151566, 0.2185172986351482, -0.06312355857197169, 0.09953209216514906, 0.0371752042647002, -0.03325891317568508, -0.052703724098169424, -0.09751509886948352, 0.09844095783030733, 0.2737187361835177, 0.12831214424024553, 0.22970592284250835, -0.38366566977549527, -0.18689652103336252, 0.15430303782485558, 0.1591393298462053, 0.11401514560050259, -0.07449107283467496, -0.2651139503552955, 0.049268311657447446, -0.1980847627360453, -0.129955366871432, -0.08711927790435837, 0.024736574860884153, 0.020265425269736362, -0.3413497441508543, 0.033530451378573294, 0.12974787919603764, -0.002651004087681889, 0.009670963600040116, -0.15900153440839432, 0.03972987801080953, 0.07554315603734489, 0.014052312372620581, -0.03594562107472555, 0.07893971407931324, -0.053554368360588946, -0.13451231507987366, 0.39940794918757155, -0.03992529868739426, -0.2460096198338883, 0.1461619798932885, -0.10435585283710627, -0.18514624537556623, 0.09885079161666915, 0.151872206215106, 0.1379918532300714, -0.14886069936217106, 0.1288062398899772, -0.08969898063504526, 0.0810169184725758, 0.10205301963757221, 0.03179195788266849, 0.08569369218081024, 0.10000946452793276, 0.09522172763938719, 0.1535358620850462, -0.0007509545799582563, -0.13713344930364016, -0.27279480024082386, -0.169312284595551, -0.15223057571375834, 0.10543997633165238, -0.16311321874353077, -0.20043574589971744, 0.43227802412188115, 0.0912062259678273, 0.21840336649341785, 0.10622911996716726, 0.19900867497839086, 0.14750832007167505, 0.027546340264033208, 0.03265460147621467, 0.11538878940677448, 0.23060903113487288, 0.07347757188299446, -0.13920102550331107, 0.033887521796017644, 0.17891165019997152] |
1,802.05222 | Groups of finite Morley rank with a generically sharply multiply
transitive action | We prove that if $G$ is a group of finite Morley rank which acts definably
and generically sharply $n$-transitively on a connected abelian group $V$ of
Morley rank $n$ with no involutions, then there is an algebraically closed
field $F$ of characteristic $\ne 2$ such that $V$ has a structure of a vector
space of dimension $n$ over $F$ and $G$ acts on $V$ as the group
$\operatorname{GL}_n(F)$ in its natural action on $F^n$.
This is the final pre-publication version of the paper: A. Berkman and A.
Borovik, Groups of finite Morley rank with a generically sharply multiply
transitive action, J. Algebra (2018),
https://doi.org/10.1016/j.jalgebra.2018.07.033. Accepted for publication 28
July 2018. The manuscript will undergo copyediting, typesetting, and review of
the resulting proof before it is published
| math.GR | we prove that if g is a group of finite morley rank which acts definably and generically sharply ntransitively on a connected abelian group v of morley rank n with no involutions then there is an algebraically closed field f of characteristic ne 2 such that v has a structure of a vector space of dimension n over f and g acts on v as the group operatornamegl_nf in its natural action on fn this is the final prepublication version of the paper a berkman and a borovik groups of finite morley rank with a generically sharply multiply transitive action j algebra 2018 httpsdoiorg101016jjalgebra201807033 accepted for publication 28 july 2018 the manuscript will undergo copyediting typesetting and review of the resulting proof before it is published | [['we', 'prove', 'that', 'if', 'g', 'is', 'a', 'group', 'of', 'finite', 'morley', 'rank', 'which', 'acts', 'definably', 'and', 'generically', 'sharply', 'ntransitively', 'on', 'a', 'connected', 'abelian', 'group', 'v', 'of', 'morley', 'rank', 'n', 'with', 'no', 'involutions', 'then', 'there', 'is', 'an', 'algebraically', 'closed', 'field', 'f', 'of', 'characteristic', 'ne', '2', 'such', 'that', 'v', 'has', 'a', 'structure', 'of', 'a', 'vector', 'space', 'of', 'dimension', 'n', 'over', 'f', 'and', 'g', 'acts', 'on', 'v', 'as', 'the', 'group', 'operatornamegl_nf', 'in', 'its', 'natural', 'action', 'on', 'fn', 'this', 'is', 'the', 'final', 'prepublication', 'version', 'of', 'the', 'paper', 'a', 'berkman', 'and', 'a', 'borovik', 'groups', 'of', 'finite', 'morley', 'rank', 'with', 'a', 'generically', 'sharply', 'multiply', 'transitive', 'action', 'j', 'algebra', '2018', 'httpsdoiorg101016jjalgebra201807033', 'accepted', 'for', 'publication', '28', 'july', '2018', 'the', 'manuscript', 'will', 'undergo', 'copyediting', 'typesetting', 'and', 'review', 'of', 'the', 'resulting', 'proof', 'before', 'it', 'is', 'published']] | [-0.18427652912214398, 0.15321143409039265, -0.08770472464747116, -0.02649219520485456, -0.09674348138639184, -0.14853205782223922, 0.029688047477021265, 0.3636011852287367, -0.243409067621363, -0.23419645052311605, 0.09853950847363954, -0.27868447514998984, -0.14258546189817248, 0.16853100222489628, -0.10931482561100579, -0.09515615808729799, 0.03665452711327101, 0.18400827188762364, -0.06525991083176226, -0.3489656691099746, 0.34068708551940735, -0.043262559636190655, 0.21985253049790685, 0.027104272953707906, 0.12891238740527025, 0.02226492159782344, -0.047291262697459, 0.051451401864932314, -0.101575127715597, 0.047290570056829295, 0.26783212799517836, 0.09993001433532135, 0.2706831851268004, -0.32407951729036255, -0.15279446059807403, 0.18482075218630376, 0.0985026823310945, 0.008631291908983018, -0.03557776176985201, -0.2558800341469831, 0.11595682205143766, -0.22309466167429431, -0.12597691032608024, -5.580370360222019e-05, 0.1856375655128819, -0.04225404784999422, -0.2428300121448911, 0.012558373271441851, 0.13291166160545756, 0.13518048807803054, -0.011083812553046241, -0.12256357881439026, -0.07329997092821315, 0.05924638655880222, -0.02463960782701119, 0.1313932474977413, 0.07492588619991648, -0.0475961242661216, -0.08501491713963572, 0.39789973041348037, -0.10372971421199255, -0.13646353745726167, 0.1558522794693403, -0.14359269622946158, -0.14919502093250572, 0.10470210400707715, 0.12565621566723986, 0.1562107167553565, -0.012547538547536175, 0.231391068423915, -0.1457506310125311, 0.15327456788938554, 0.07074843882201393, -0.05783242884866863, 0.09522843107458998, 0.10465024609584361, 0.1198804835849976, 0.05153147651638347, 0.021860994158129466, 0.06104696631339974, -0.3737225367336488, -0.1636806594391094, -0.13915704672614143, 0.13213969140168524, -0.03428901842610193, -0.1974601478823537, 0.39636406495968707, 0.048310855142085156, 0.15361181510703975, 0.06828299248171207, 0.20198544028566265, 0.04763070761500934, 0.04540106118656695, 0.11851185467094183, 0.09206556027839113, 0.20499873669344748, -0.02943412705084126, -0.13684153702438306, -0.014211531171239302, 0.18689650189146767] |
1,802.05223 | Ideal simplicial volume of manifolds with boundary | We define the ideal simplicial volume for compact manifolds with boundary.
Roughly speaking, the ideal simplicial volume of a manifold $M$ measures the
minimal size of possibly ideal triangulations of $M$ "with real coefficients",
thus providing a variation of the ordinary simplicial volume defined by Gromov
in 1982, the main difference being that ideal simplices are now allowed to
appear in representatives of the fundamental class.
We show that the ideal simplicial volume is bounded above by the ordinary
simplicial volume, and that it vanishes if and only if the ordinary simplicial
volume does. We show that, for manifolds with amenable boundary, the ideal
simplicial volume coincides with the classical one, whereas for hyperbolic
manifolds with geodesic boundary it can be strictly smaller. We compute the
ideal simplicial volume of an infinite family of hyperbolic $3$-manifolds with
geodesic boundary, for which the exact value of the classical simplicial volume
is not known, and we exhibit examples where the ideal simplicial volume
provides shaper bounds on mapping degrees than the classical simplicial volume.
| math.GT math.AT math.DG | we define the ideal simplicial volume for compact manifolds with boundary roughly speaking the ideal simplicial volume of a manifold m measures the minimal size of possibly ideal triangulations of m with real coefficients thus providing a variation of the ordinary simplicial volume defined by gromov in 1982 the main difference being that ideal simplices are now allowed to appear in representatives of the fundamental class we show that the ideal simplicial volume is bounded above by the ordinary simplicial volume and that it vanishes if and only if the ordinary simplicial volume does we show that for manifolds with amenable boundary the ideal simplicial volume coincides with the classical one whereas for hyperbolic manifolds with geodesic boundary it can be strictly smaller we compute the ideal simplicial volume of an infinite family of hyperbolic 3manifolds with geodesic boundary for which the exact value of the classical simplicial volume is not known and we exhibit examples where the ideal simplicial volume provides shaper bounds on mapping degrees than the classical simplicial volume | [['we', 'define', 'the', 'ideal', 'simplicial', 'volume', 'for', 'compact', 'manifolds', 'with', 'boundary', 'roughly', 'speaking', 'the', 'ideal', 'simplicial', 'volume', 'of', 'a', 'manifold', 'm', 'measures', 'the', 'minimal', 'size', 'of', 'possibly', 'ideal', 'triangulations', 'of', 'm', 'with', 'real', 'coefficients', 'thus', 'providing', 'a', 'variation', 'of', 'the', 'ordinary', 'simplicial', 'volume', 'defined', 'by', 'gromov', 'in', '1982', 'the', 'main', 'difference', 'being', 'that', 'ideal', 'simplices', 'are', 'now', 'allowed', 'to', 'appear', 'in', 'representatives', 'of', 'the', 'fundamental', 'class', 'we', 'show', 'that', 'the', 'ideal', 'simplicial', 'volume', 'is', 'bounded', 'above', 'by', 'the', 'ordinary', 'simplicial', 'volume', 'and', 'that', 'it', 'vanishes', 'if', 'and', 'only', 'if', 'the', 'ordinary', 'simplicial', 'volume', 'does', 'we', 'show', 'that', 'for', 'manifolds', 'with', 'amenable', 'boundary', 'the', 'ideal', 'simplicial', 'volume', 'coincides', 'with', 'the', 'classical', 'one', 'whereas', 'for', 'hyperbolic', 'manifolds', 'with', 'geodesic', 'boundary', 'it', 'can', 'be', 'strictly', 'smaller', 'we', 'compute', 'the', 'ideal', 'simplicial', 'volume', 'of', 'an', 'infinite', 'family', 'of', 'hyperbolic', '3manifolds', 'with', 'geodesic', 'boundary', 'for', 'which', 'the', 'exact', 'value', 'of', 'the', 'classical', 'simplicial', 'volume', 'is', 'not', 'known', 'and', 'we', 'exhibit', 'examples', 'where', 'the', 'ideal', 'simplicial', 'volume', 'provides', 'shaper', 'bounds', 'on', 'mapping', 'degrees', 'than', 'the', 'classical', 'simplicial', 'volume']] | [-0.13618271674441043, 0.14080967553046891, -0.04540864857411835, 0.06923894668241616, -0.10992732054694708, -0.11091102932601474, -0.02166492253173749, 0.2994643566442307, -0.3053158280862019, -0.22706922166439336, 0.1391085871558929, -0.2898927713083753, -0.12500716005600881, 0.17582730192225426, -0.17450514206186282, -0.002436444699374396, 0.06935012635103492, 0.09101108417488894, -0.059286996523232396, -0.28138486465959006, 0.43296614942698586, -0.038583474742725145, 0.2121964725665748, 0.07380771182401669, 0.15009718884302434, -0.057403832270633864, -0.01633956354838352, 0.15311587734830154, -0.21336857107184357, 0.14940110042279717, 0.2666716477075635, 0.046183572719306794, 0.16730763611849397, -0.36735722705786833, -0.16665173492456656, 0.2007352732058322, 0.07701248309824096, 0.003237858584535113, 0.008749862560910324, -0.24291320676444272, 0.11631315706167804, -0.08695183042978305, -0.21765063422580444, -0.051232167400506345, 0.06536819828879954, -0.01236162266455764, -0.23449018171197886, 0.030874149191604798, 0.07875452053917269, 0.07624433301714097, -0.015787533676619968, -0.09975100331939757, -0.0782238494491118, 0.0941688792271063, -0.08830913177658913, 0.028053062342562128, 0.11156295230449718, -0.053559715147563365, -0.07572027377860058, 0.4239728052292945, -0.059455093807628145, -0.29820690367392505, 0.18090277319221737, -0.20994222289232842, -0.08336864319781578, 0.2085408111411515, 0.04272746016423023, 0.12710883026552755, -0.0386138501371322, 0.17690959310349955, -0.11992659900055895, 0.09911422040868485, 0.09703315738967598, 0.00760641930148352, 0.1449844457133305, 0.13465507797149637, 0.1639954845263991, 0.15601370202446477, -0.00031319094773078727, -0.12009411710341526, -0.3325257567948727, -0.24133590185340645, -0.21649456598665998, 0.14358098706276884, -0.1807950111658503, -0.24533696068101563, 0.2710789200351682, 0.03398091235464753, 0.16962426645494455, 0.15475837750966812, 0.28380831801413753, 0.027687312631061042, 0.059613353802909164, 0.10664008861017782, 0.1342972385112283, 0.16122745517451792, -0.012857635735620767, -0.13794336356168482, -0.0050123037156502735, 0.21480696993028178] |
1,802.05224 | Some more algebra on ultrafilters in metric spaces | We continue algebraization of the set of ultrafilters on a metric spaces
initiated in [6]. In particular, we define and study metric counterparts of
prime, strongly prime and right cancellable ultrafilters from the
Stone-$\check{C}$ech compactification of a discrete group as a right
topological semigroup [3]. Our approach is based on the concept of parallelity
introduced in the context of balleans in [4].
| math.GN | we continue algebraization of the set of ultrafilters on a metric spaces initiated in 6 in particular we define and study metric counterparts of prime strongly prime and right cancellable ultrafilters from the stonecheckcech compactification of a discrete group as a right topological semigroup 3 our approach is based on the concept of parallelity introduced in the context of balleans in 4 | [['we', 'continue', 'algebraization', 'of', 'the', 'set', 'of', 'ultrafilters', 'on', 'a', 'metric', 'spaces', 'initiated', 'in', '6', 'in', 'particular', 'we', 'define', 'and', 'study', 'metric', 'counterparts', 'of', 'prime', 'strongly', 'prime', 'and', 'right', 'cancellable', 'ultrafilters', 'from', 'the', 'stonecheckcech', 'compactification', 'of', 'a', 'discrete', 'group', 'as', 'a', 'right', 'topological', 'semigroup', '3', 'our', 'approach', 'is', 'based', 'on', 'the', 'concept', 'of', 'parallelity', 'introduced', 'in', 'the', 'context', 'of', 'balleans', 'in', '4']] | [-0.12611308209903416, 0.11700783492081233, -0.09081489937837983, 0.08966307717825851, -0.0765884677711569, -0.05835798917887885, 0.05541254706741845, 0.3362751047081146, -0.2800053550754903, -0.19769365225582705, 0.14472796349618278, -0.28938542227031755, -0.15759695031237406, 0.20206954785561587, -0.14069969810117952, -0.006524180130819316, -0.029709800177055302, 0.0927774393167652, -0.05046022675748243, -0.24055499039956782, 0.4300656704476378, -0.017838505218874236, 0.2143567172852421, 0.03634286900890655, 0.08303422393033007, 0.01726322982948823, -0.08354058914405645, 0.02389115718055944, -0.15765916043129125, 0.16507327595924134, 0.22389191963144991, 0.14510792593059482, 0.28640018910413884, -0.37779520503932335, -0.13308727660323263, 0.14333807901464035, 0.0930987703423092, -0.03354226326050817, -0.0220618370470026, -0.294212460895756, 0.1352599981683688, -0.19699010543036657, -0.09126766182512777, -0.05136782483800818, 0.05514430042478393, 0.007867424424401805, -0.2318857877713735, -0.05774334265438259, 0.1361820187999821, 0.1218507034746075, -0.053529486922760966, -0.06968007263437402, -0.0044508312340276164, 0.06949602791153994, 0.013195902028991307, 0.04952696521125245, 0.05069410591004569, -0.08696765097652058, -0.16401724601317136, 0.3970036299624404, -0.06711301283880336, -0.19809208810329437, 0.14306291666446772, -0.20360809080608067, -0.17544003769175195, 0.0658004499483304, 0.1394570930631923, 0.19114221411864044, -0.030016506823604225, 0.19853695805879218, -0.08536927695157098, 0.11399515278515268, 0.08720558622210729, 0.05275410462598332, 0.11375614735068845, 0.19101182510694642, 0.09286863871346243, 0.14632227378668355, 0.015210377248996472, 0.009846277165677032, -0.34477086114834565, -0.1820698531924701, -0.1430987098300066, 0.1252001563595707, -0.06981871988515553, -0.18419160068676363, 0.4187986986925367, 0.11933307812289624, 0.15729384745669658, 0.07338554973973603, 0.15456057166619624, 0.011105980516314033, 0.013840627955791891, 0.019836710462514617, 0.1439058149508277, 0.18086753945919823, -0.019969586191363024, -0.12264837192173009, -0.05935489309218819, 0.20282317916328302] |
1,802.05225 | Snapshot 3D tracking of insulin granules in live cells | Rapid and accurate volumetric imaging remains a challenge, yet has the
potential to enhance understanding of cell function. We developed and used a
multifocal microscope (MFM) for 3D snapshot imaging to allow 3D tracking of
insulin granules labeled with mCherry in MIN6 cells. MFM employs a special
diffractive optical element (DOE) to simultaneously image multiple focal
planes. This simultaneous acquisition of information determines the 3D location
of single objects at a speed only limited by the frame rate of array detector .
We validated the accuracy of MFM imaging and tracking with fluorescence beads;
the 3D positions and trajectories of single fluorescence beads can be
determined accurately over a wide range of spatial and temporal scales. The 3D
positions and trajectories of single insulin granules in a 3.2 micro meter deep
volume were determined with imaging processing that combines 3D decovolution,
shift correction, and finally tracking using the Imaris software package. We
find that the motion of the granules is super-diffusive, but less so in 3D than
2D for cells grown on coverslip surfaces, suggesting an anisotropy in the
cytoskeleton (e.g. microtubules and action).
| physics.optics physics.bio-ph | rapid and accurate volumetric imaging remains a challenge yet has the potential to enhance understanding of cell function we developed and used a multifocal microscope mfm for 3d snapshot imaging to allow 3d tracking of insulin granules labeled with mcherry in min6 cells mfm employs a special diffractive optical element doe to simultaneously image multiple focal planes this simultaneous acquisition of information determines the 3d location of single objects at a speed only limited by the frame rate of array detector we validated the accuracy of mfm imaging and tracking with fluorescence beads the 3d positions and trajectories of single fluorescence beads can be determined accurately over a wide range of spatial and temporal scales the 3d positions and trajectories of single insulin granules in a 32 micro meter deep volume were determined with imaging processing that combines 3d decovolution shift correction and finally tracking using the imaris software package we find that the motion of the granules is superdiffusive but less so in 3d than 2d for cells grown on coverslip surfaces suggesting an anisotropy in the cytoskeleton eg microtubules and action | [['rapid', 'and', 'accurate', 'volumetric', 'imaging', 'remains', 'a', 'challenge', 'yet', 'has', 'the', 'potential', 'to', 'enhance', 'understanding', 'of', 'cell', 'function', 'we', 'developed', 'and', 'used', 'a', 'multifocal', 'microscope', 'mfm', 'for', '3d', 'snapshot', 'imaging', 'to', 'allow', '3d', 'tracking', 'of', 'insulin', 'granules', 'labeled', 'with', 'mcherry', 'in', 'min6', 'cells', 'mfm', 'employs', 'a', 'special', 'diffractive', 'optical', 'element', 'doe', 'to', 'simultaneously', 'image', 'multiple', 'focal', 'planes', 'this', 'simultaneous', 'acquisition', 'of', 'information', 'determines', 'the', '3d', 'location', 'of', 'single', 'objects', 'at', 'a', 'speed', 'only', 'limited', 'by', 'the', 'frame', 'rate', 'of', 'array', 'detector', 'we', 'validated', 'the', 'accuracy', 'of', 'mfm', 'imaging', 'and', 'tracking', 'with', 'fluorescence', 'beads', 'the', '3d', 'positions', 'and', 'trajectories', 'of', 'single', 'fluorescence', 'beads', 'can', 'be', 'determined', 'accurately', 'over', 'a', 'wide', 'range', 'of', 'spatial', 'and', 'temporal', 'scales', 'the', '3d', 'positions', 'and', 'trajectories', 'of', 'single', 'insulin', 'granules', 'in', 'a', '32', 'micro', 'meter', 'deep', 'volume', 'were', 'determined', 'with', 'imaging', 'processing', 'that', 'combines', '3d', 'decovolution', 'shift', 'correction', 'and', 'finally', 'tracking', 'using', 'the', 'imaris', 'software', 'package', 'we', 'find', 'that', 'the', 'motion', 'of', 'the', 'granules', 'is', 'superdiffusive', 'but', 'less', 'so', 'in', '3d', 'than', '2d', 'for', 'cells', 'grown', 'on', 'coverslip', 'surfaces', 'suggesting', 'an', 'anisotropy', 'in', 'the', 'cytoskeleton', 'eg', 'microtubules', 'and', 'action']] | [-0.0649966249338679, 0.09430877707956174, -0.03231386897770698, -0.010248612191699778, -0.038913987082684176, -0.15546721238486844, -0.008703458465001021, 0.44716712651389273, -0.25287265955943966, -0.3450725799187102, 0.07161194302776423, -0.2740151118370054, -0.13171544521214576, 0.21845100589184996, -0.0901552245720659, 0.08091925371434362, 0.10612624428916577, -0.005495892485145833, -0.014310805341645076, -0.13941193961241807, 0.20422671004276535, 0.07099056865759168, 0.3151918715854597, 0.008908659902624993, 0.20350904746355708, 0.03848367890696869, -0.03150938050665336, 0.05970035179897976, -0.12155258015889801, 0.1466821204954186, 0.22718961602441093, 0.0801767691437873, 0.21845038035135278, -0.4760629091744816, -0.2462460659710982, 0.05153993008054751, 0.19212391314526966, 0.1171792184611439, -0.05670294294708705, -0.2946875976559878, 0.07382397589341388, -0.07582457588761837, -0.09253665138629145, -0.063161597568958, -0.010272185580919408, 0.04752568323711485, -0.2624062549247401, 0.07218982420299806, -0.02406736770556985, 0.135651182763112, -0.09382425212332532, -0.04936105152201844, -0.018516969640723652, 0.21031663578534343, -0.045066475905946264, 0.06182975145108873, 0.21909627010889726, -0.17061350232265973, -0.06223172264163221, 0.36432167723275427, -0.013421908989447876, -0.1952452049782505, 0.20414046912360417, -0.18926725934738262, -0.057686231944543524, 0.21984695194239662, 0.18300988723806172, 0.13732173306446044, -0.16487059289038014, -0.01050629541694119, 0.0009852445186193846, 0.24935882568733986, 0.10808253619955155, -0.0009541317935013238, 0.22325447560990405, 0.25573598705856493, 0.02146240176409275, 0.10417954976229496, -0.2642548489501419, -0.03156756674194469, -0.19289149061091213, -0.18359171947151848, -0.17876902341780215, -0.019896208818523244, -0.08639271927193619, -0.18529949011281133, 0.3752901002403099, 0.1423471744624929, 0.17695054321097178, 0.01505680930704482, 0.3383139888625904, -0.009637977631356796, 0.14139737640949768, -0.016821494859294683, 0.21014987971162483, 0.07864791929706223, 0.15692681634171693, -0.2209554731055012, 0.023686739691538353, 0.0628118449529404] |
1,802.05226 | Geometric and monotonic properties of hyper-Bessel functions | Some geometric properties of a normalized hyper-Bessel functions are
investigated. Especially we focus on the radii of starlikeness, convexity, and
uniform convexity of hyper-Bessel functions and we show that the obtained radii
satisfy some transcendental equations. In addition, we give some bounds for the
first positive zero of normalized hyper-Bessel functions, Redheffer-type
inequalities, and bounds for this function. In this study we take advantage of
Euler-Rayleigh inequalities and Laguerre-P\'{o}lya class of real entire
functions, intensively.
| math.CV | some geometric properties of a normalized hyperbessel functions are investigated especially we focus on the radii of starlikeness convexity and uniform convexity of hyperbessel functions and we show that the obtained radii satisfy some transcendental equations in addition we give some bounds for the first positive zero of normalized hyperbessel functions redheffertype inequalities and bounds for this function in this study we take advantage of eulerrayleigh inequalities and laguerrepolya class of real entire functions intensively | [['some', 'geometric', 'properties', 'of', 'a', 'normalized', 'hyperbessel', 'functions', 'are', 'investigated', 'especially', 'we', 'focus', 'on', 'the', 'radii', 'of', 'starlikeness', 'convexity', 'and', 'uniform', 'convexity', 'of', 'hyperbessel', 'functions', 'and', 'we', 'show', 'that', 'the', 'obtained', 'radii', 'satisfy', 'some', 'transcendental', 'equations', 'in', 'addition', 'we', 'give', 'some', 'bounds', 'for', 'the', 'first', 'positive', 'zero', 'of', 'normalized', 'hyperbessel', 'functions', 'redheffertype', 'inequalities', 'and', 'bounds', 'for', 'this', 'function', 'in', 'this', 'study', 'we', 'take', 'advantage', 'of', 'eulerrayleigh', 'inequalities', 'and', 'laguerrepolya', 'class', 'of', 'real', 'entire', 'functions', 'intensively']] | [-0.14454549629241228, 0.043269958272576334, -0.09062816351341704, 0.1626261403504759, -0.06625387341094514, -0.08181358962630232, -0.0005795205819110076, 0.3481831809878349, -0.24122669393817583, -0.20041248890571295, 0.1303236963786185, -0.2941807249778261, -0.1690194152543942, 0.2449533478481074, -0.05082671655341983, 0.10027585023393233, -0.002088896743953228, 0.009716112079719702, -0.18448137186157207, -0.2810241588950157, 0.3753875787556171, -0.07828412805994352, 0.16323146779090167, 0.14481878716653834, 0.0780519420777758, 0.023515776116400957, -0.028386315995206437, 0.0071200850109259285, -0.28376308802874217, 0.14688367878397307, 0.19585632844517628, 0.15623797320450344, 0.30552491260071596, -0.3973136195043723, -0.148165698616455, 0.18394223478933175, 0.08348182434837023, -0.039793711453676224, -0.05076225609363367, -0.23956155440459648, 0.09758054334980747, -0.09846158993740876, -0.16381012832163833, -0.1107914774531188, 0.006523134332771102, 0.1771550842591872, -0.28025777148703734, 0.06658485566576322, 0.10332424142708381, 0.08876918236725033, -0.12470748415216804, -0.21315007536361616, 0.0353365861500303, 0.0887530958869805, 0.036366495809828245, -0.030585083773670096, 0.06908012554049492, -0.09009653297563394, -0.04586358762656649, 0.29004826946804924, -0.048507738237579666, -0.274613020469745, 0.08588128503412008, -0.23751702626546223, -0.20276690335944295, 0.0488050396181643, 0.19248210585365694, 0.1992541168630123, -0.13009576638539633, 0.1371303728998949, -0.0915568738989532, 0.079737244322896, 0.11564586701182028, 0.12063191258038083, 0.07709737402697404, 0.005667265970259905, 0.10673679324798285, 0.22215059022729597, 0.009670507985477646, -0.10298937533050775, -0.36423580437898634, -0.15517711048324903, -0.19356607254905006, 0.048954631872475146, -0.15103937392355873, -0.18524899212333062, 0.38344930166999497, 0.06710735857486724, 0.19089746416235964, 0.17602261230039098, 0.19715122919529676, 0.17543091889470816, 0.07262087065493689, 0.06084985284755627, 0.2223285868014985, 0.20668959124945105, 0.07215011419728398, -0.13494054410606623, 0.04601532926162084, 0.1429431849469741] |
1,802.05227 | Calibration of high voltages at the ppm level by the difference of
$^{83\mathrm{m}}$Kr conversion electron lines at the KATRIN experiment | The neutrino mass experiment KATRIN requires a stability of 3 ppm for the
retarding potential at -18.6 kV of the main spectrometer. To monitor the
stability, two custom-made ultra-precise high-voltage dividers were developed
and built in cooperation with the German national metrology institute
Physikalisch-Technische Bundesanstalt (PTB). Until now, regular absolute
calibration of the voltage dividers required bringing the equipment to the
specialised metrology laboratory. Here we present a new method based on
measuring the energy difference of two $^{83\mathrm{m}}$Kr conversion electron
lines with the KATRIN setup, which was demonstrated during KATRIN's
commissioning measurements in July 2017. The measured scale factor
$M=1972.449(10)$ of the high-voltage divider K35 is in agreement with the last
PTB calibration four years ago. This result demonstrates the utility of the
calibration method, as well as the long-term stability of the voltage divider.
| physics.ins-det | the neutrino mass experiment katrin requires a stability of 3 ppm for the retarding potential at 186 kv of the main spectrometer to monitor the stability two custommade ultraprecise highvoltage dividers were developed and built in cooperation with the german national metrology institute physikalischtechnische bundesanstalt ptb until now regular absolute calibration of the voltage dividers required bringing the equipment to the specialised metrology laboratory here we present a new method based on measuring the energy difference of two 83mathrmmkr conversion electron lines with the katrin setup which was demonstrated during katrins commissioning measurements in july 2017 the measured scale factor m197244910 of the highvoltage divider k35 is in agreement with the last ptb calibration four years ago this result demonstrates the utility of the calibration method as well as the longterm stability of the voltage divider | [['the', 'neutrino', 'mass', 'experiment', 'katrin', 'requires', 'a', 'stability', 'of', '3', 'ppm', 'for', 'the', 'retarding', 'potential', 'at', '186', 'kv', 'of', 'the', 'main', 'spectrometer', 'to', 'monitor', 'the', 'stability', 'two', 'custommade', 'ultraprecise', 'highvoltage', 'dividers', 'were', 'developed', 'and', 'built', 'in', 'cooperation', 'with', 'the', 'german', 'national', 'metrology', 'institute', 'physikalischtechnische', 'bundesanstalt', 'ptb', 'until', 'now', 'regular', 'absolute', 'calibration', 'of', 'the', 'voltage', 'dividers', 'required', 'bringing', 'the', 'equipment', 'to', 'the', 'specialised', 'metrology', 'laboratory', 'here', 'we', 'present', 'a', 'new', 'method', 'based', 'on', 'measuring', 'the', 'energy', 'difference', 'of', 'two', '83mathrmmkr', 'conversion', 'electron', 'lines', 'with', 'the', 'katrin', 'setup', 'which', 'was', 'demonstrated', 'during', 'katrins', 'commissioning', 'measurements', 'in', 'july', '2017', 'the', 'measured', 'scale', 'factor', 'm197244910', 'of', 'the', 'highvoltage', 'divider', 'k35', 'is', 'in', 'agreement', 'with', 'the', 'last', 'ptb', 'calibration', 'four', 'years', 'ago', 'this', 'result', 'demonstrates', 'the', 'utility', 'of', 'the', 'calibration', 'method', 'as', 'well', 'as', 'the', 'longterm', 'stability', 'of', 'the', 'voltage', 'divider']] | [-0.07932601215110885, 0.1433098997058416, -0.060711888617111576, -0.015636600885126327, -0.005470096609658665, -0.1501470390483047, 0.03920197259220812, 0.3586112122568819, -0.17651829973415092, -0.40872883239278085, 0.12355159376834139, -0.26260596090168864, 0.0019770923432790573, 0.31154602728094216, -0.049188464897236335, 0.11287225172337559, 0.08355818180048287, -0.027710267194305305, -0.05211307921067432, -0.21935547495053875, 0.20667563512300452, 0.19035897472252447, 0.367263422013019, 0.052798766439297685, 0.1671952553352134, -0.028307857552405308, -0.05965510349789703, -0.06247937722924959, -0.10173836730558564, 0.060846798535850316, 0.2718583923109152, 0.09047077703462154, 0.2625522062734321, -0.39610683461306273, -0.11443232857898154, 0.04702571417513321, 0.01936491837313278, 0.019663697242288402, -0.0890264717111778, -0.27511582338699586, 0.023753415712983245, -0.20658940478331514, -0.14488589679477393, 0.010843962609457473, -0.023135957259822777, 0.06009991881265132, -0.2399070417025575, 0.021719482187526645, -0.041778561660019614, 0.13753495226717657, -0.07503525559548978, -0.14424003283320755, 0.044515357244138916, 0.16099931095873385, -0.031356079402138234, 0.03650923006460761, 0.16594016973653603, -0.05355400376677237, -0.10911993904867107, 0.3324647844182672, -0.07868329009886818, -0.03667527188167528, 0.11510743487246887, -0.2123567123207505, -0.09839934376332504, 0.08429253328261742, 0.1391796908306855, 0.0478211546851391, -0.1909870933154943, 0.029417442084997202, 0.038609680071197174, 0.21649466423248803, 0.15745072492432816, -0.03923180869966961, 0.1925806984288135, 0.26255638439604945, 0.05438617979072862, 0.06937664218238314, -0.18539384231833672, -0.01633389406596069, -0.3174578957673576, -0.14272621834167729, -0.10396722713830295, 0.034691667748201226, 0.01764218509897883, -0.08644818425247515, 0.418550101571061, 0.1310381566001861, 0.06990053637850063, -0.019758972983496884, 0.37231008705717544, 0.07222769923801362, 0.08991505200974644, -0.010795911097968066, 0.3466987909654293, 0.1497905669130247, 0.22880390085348928, -0.24506548505828338, 0.013112291566061753, 0.03933411836279211] |
1,802.05228 | Sign Epistasis and the Geometry of Interactions | Approaches to gene interactions based on sign epistasis have been highly
influential in recent time. Sign epistasis is useful for relating local and
global properties of fitness landscapes, as well as for analyzing evolutionary
trajectories and constraints. The geometric theory of gene interactions, on the
other hand, provides complete information on interactions in terms of minimal
dependence relations. We propose a new framework that combines aspects of both
approaches. In particular, we provide efficient tools for identifying sign
epistasis and related order perturbations in large genetic systems, with
applications to the malaria-causing parasite Plasmodium vivax. We found that
order perturbations beyond sign epistasis are prevalent in the drug-free
environment, which agrees well with the observation that reversed evolution
back to the ancestral type is difficult. As a theoretical application, we
investigate how rank orders of genotypes with respect to fitness relates to
additivity.
| q-bio.PE | approaches to gene interactions based on sign epistasis have been highly influential in recent time sign epistasis is useful for relating local and global properties of fitness landscapes as well as for analyzing evolutionary trajectories and constraints the geometric theory of gene interactions on the other hand provides complete information on interactions in terms of minimal dependence relations we propose a new framework that combines aspects of both approaches in particular we provide efficient tools for identifying sign epistasis and related order perturbations in large genetic systems with applications to the malariacausing parasite plasmodium vivax we found that order perturbations beyond sign epistasis are prevalent in the drugfree environment which agrees well with the observation that reversed evolution back to the ancestral type is difficult as a theoretical application we investigate how rank orders of genotypes with respect to fitness relates to additivity | [['approaches', 'to', 'gene', 'interactions', 'based', 'on', 'sign', 'epistasis', 'have', 'been', 'highly', 'influential', 'in', 'recent', 'time', 'sign', 'epistasis', 'is', 'useful', 'for', 'relating', 'local', 'and', 'global', 'properties', 'of', 'fitness', 'landscapes', 'as', 'well', 'as', 'for', 'analyzing', 'evolutionary', 'trajectories', 'and', 'constraints', 'the', 'geometric', 'theory', 'of', 'gene', 'interactions', 'on', 'the', 'other', 'hand', 'provides', 'complete', 'information', 'on', 'interactions', 'in', 'terms', 'of', 'minimal', 'dependence', 'relations', 'we', 'propose', 'a', 'new', 'framework', 'that', 'combines', 'aspects', 'of', 'both', 'approaches', 'in', 'particular', 'we', 'provide', 'efficient', 'tools', 'for', 'identifying', 'sign', 'epistasis', 'and', 'related', 'order', 'perturbations', 'in', 'large', 'genetic', 'systems', 'with', 'applications', 'to', 'the', 'malariacausing', 'parasite', 'plasmodium', 'vivax', 'we', 'found', 'that', 'order', 'perturbations', 'beyond', 'sign', 'epistasis', 'are', 'prevalent', 'in', 'the', 'drugfree', 'environment', 'which', 'agrees', 'well', 'with', 'the', 'observation', 'that', 'reversed', 'evolution', 'back', 'to', 'the', 'ancestral', 'type', 'is', 'difficult', 'as', 'a', 'theoretical', 'application', 'we', 'investigate', 'how', 'rank', 'orders', 'of', 'genotypes', 'with', 'respect', 'to', 'fitness', 'relates', 'to', 'additivity']] | [-0.09864528539610352, 0.08273826409395493, -0.08395653408217238, 0.13829281058324278, -0.10159593167985585, -0.13006196386372368, 0.038745226400015965, 0.36133521592165246, -0.2554722745037565, -0.29778191151224565, 0.06573599802762772, -0.27340484117256836, -0.2463016214760694, 0.16849672712438496, -0.0737440434436426, 0.02751558304744515, 0.04475643580237813, 0.027767648100762148, 0.0025908809637399852, -0.24160274880416427, 0.32127021876880435, 0.056029501384295896, 0.2794105531978058, 0.05868834152021809, 0.08954924030942803, 0.015153001326776988, -0.03746787894266189, 0.0737764150274138, -0.1493009907293694, 0.13598153560673357, 0.2711405182818317, 0.1718929515472871, 0.2847247465797667, -0.4301681745110463, -0.2141911711420778, 0.12809828925772127, 0.1466023303297553, 0.17346298560774256, -0.047946290569611104, -0.24318253588433383, 0.05634184476278775, -0.1244308851025206, -0.10219055784004245, -0.12926092825116628, 0.04537740874629309, 0.04501294336737471, -0.2537720680652939, 0.13584917679211087, 0.0035446655869662285, 0.09007162448837824, -0.044467277296468724, -0.13636009885883288, -0.03699285354372774, 0.18685371896701183, 0.1176224075095127, 0.01085708230149318, 0.1421077035479776, -0.1405079416527763, -0.175547639433136, 0.35364514928152585, -0.07882986987894731, -0.20159488472697848, 0.25548885778708924, -0.11307661351582683, -0.16969126642265536, 0.06599716757959191, 0.17895515799003897, 0.11058857059787384, -0.16413342878750875, 0.062335624351704505, 0.029062789019382168, 0.14696641303334676, 0.05235459808431936, 0.044601156435748364, 0.18094193514812976, 0.18554407716662696, 0.09954161716935535, 0.1048693534202299, -0.029022652677719394, -0.13736414273619546, -0.22481746292600396, -0.11844544792556079, -0.12954069388343403, 0.03554204410827118, -0.09291974585208174, -0.17849216675583987, 0.4406053830047158, 0.18211564467559363, 0.20929609763548307, 0.08003499740090697, 0.24834401766663905, 0.060259588743916695, 0.0884595018124591, 0.0030881806891015235, 0.16773766454586642, 0.11613845200350521, 0.07601009280229291, -0.24335439460589847, 0.18131783561440884, 0.03908702361575784] |
1,802.05229 | A finite area scheme for shallow granular flows on three-dimensional
surfaces | Shallow flow or thin liquid film models are used for a wide range of physical
and engineering problems. Shallow flow models allow capturing the free surface
of the fluid with little effort and reducing the three-dimensional problem to a
quasi two-dimensional problem through depth-integrating the flow fields.
Despite remarkable progress of such models in the last decade, accurate
description of complex topography remains a challenge. Interaction with
topography is particularly critical for granular flows, because their rheology
requires modeling of the pressure field, which is strongly linked to surface
curvature and associated centrifugal forces. Shallow granular flow models are
usually set up in surface-aligned curvilinear coordinates, and velocity is
represented as a two-dimensional surface-aligned vector field. The
transformation from Cartesian to curvilinear coordinates introduces fictitious
forces, however, which result in complex governing equations. In this paper, we
set up the shallow flow model in three-dimensional Cartesian coordinates and
preserve three-dimensional velocity in the depth-integrated model. Topography
is taken into account with a constraint on velocity. This approach is commonly
applied by the thin liquid film community. The advantage is a curvature-free
mathematical description that is convenient for complex topographies. The
constraint on velocity yields a solution for the pressure field, which is
required for the pressure-dependent rheology of granular materials. The model
is therefore well-suited for granular flows on three-dimensional terrain, e.g.,
avalanches.
| physics.comp-ph | shallow flow or thin liquid film models are used for a wide range of physical and engineering problems shallow flow models allow capturing the free surface of the fluid with little effort and reducing the threedimensional problem to a quasi twodimensional problem through depthintegrating the flow fields despite remarkable progress of such models in the last decade accurate description of complex topography remains a challenge interaction with topography is particularly critical for granular flows because their rheology requires modeling of the pressure field which is strongly linked to surface curvature and associated centrifugal forces shallow granular flow models are usually set up in surfacealigned curvilinear coordinates and velocity is represented as a twodimensional surfacealigned vector field the transformation from cartesian to curvilinear coordinates introduces fictitious forces however which result in complex governing equations in this paper we set up the shallow flow model in threedimensional cartesian coordinates and preserve threedimensional velocity in the depthintegrated model topography is taken into account with a constraint on velocity this approach is commonly applied by the thin liquid film community the advantage is a curvaturefree mathematical description that is convenient for complex topographies the constraint on velocity yields a solution for the pressure field which is required for the pressuredependent rheology of granular materials the model is therefore wellsuited for granular flows on threedimensional terrain eg avalanches | [['shallow', 'flow', 'or', 'thin', 'liquid', 'film', 'models', 'are', 'used', 'for', 'a', 'wide', 'range', 'of', 'physical', 'and', 'engineering', 'problems', 'shallow', 'flow', 'models', 'allow', 'capturing', 'the', 'free', 'surface', 'of', 'the', 'fluid', 'with', 'little', 'effort', 'and', 'reducing', 'the', 'threedimensional', 'problem', 'to', 'a', 'quasi', 'twodimensional', 'problem', 'through', 'depthintegrating', 'the', 'flow', 'fields', 'despite', 'remarkable', 'progress', 'of', 'such', 'models', 'in', 'the', 'last', 'decade', 'accurate', 'description', 'of', 'complex', 'topography', 'remains', 'a', 'challenge', 'interaction', 'with', 'topography', 'is', 'particularly', 'critical', 'for', 'granular', 'flows', 'because', 'their', 'rheology', 'requires', 'modeling', 'of', 'the', 'pressure', 'field', 'which', 'is', 'strongly', 'linked', 'to', 'surface', 'curvature', 'and', 'associated', 'centrifugal', 'forces', 'shallow', 'granular', 'flow', 'models', 'are', 'usually', 'set', 'up', 'in', 'surfacealigned', 'curvilinear', 'coordinates', 'and', 'velocity', 'is', 'represented', 'as', 'a', 'twodimensional', 'surfacealigned', 'vector', 'field', 'the', 'transformation', 'from', 'cartesian', 'to', 'curvilinear', 'coordinates', 'introduces', 'fictitious', 'forces', 'however', 'which', 'result', 'in', 'complex', 'governing', 'equations', 'in', 'this', 'paper', 'we', 'set', 'up', 'the', 'shallow', 'flow', 'model', 'in', 'threedimensional', 'cartesian', 'coordinates', 'and', 'preserve', 'threedimensional', 'velocity', 'in', 'the', 'depthintegrated', 'model', 'topography', 'is', 'taken', 'into', 'account', 'with', 'a', 'constraint', 'on', 'velocity', 'this', 'approach', 'is', 'commonly', 'applied', 'by', 'the', 'thin', 'liquid', 'film', 'community', 'the', 'advantage', 'is', 'a', 'curvaturefree', 'mathematical', 'description', 'that', 'is', 'convenient', 'for', 'complex', 'topographies', 'the', 'constraint', 'on', 'velocity', 'yields', 'a', 'solution', 'for', 'the', 'pressure', 'field', 'which', 'is', 'required', 'for', 'the', 'pressuredependent', 'rheology', 'of', 'granular', 'materials', 'the', 'model', 'is', 'therefore', 'wellsuited', 'for', 'granular', 'flows', 'on', 'threedimensional', 'terrain', 'eg', 'avalanches']] | [-0.11975978764980523, 0.12868788620160723, -0.08357130215206945, 0.00946010764720003, -0.08741795164109631, -0.11162383629390123, -0.050478842815871096, 0.3642005866943774, -0.30601517523808236, -0.31033798972652715, 0.08924412445260466, -0.2367877181323076, -0.14392802131425758, 0.2152214575516568, -0.04021139555949379, 0.10625869431956247, 0.04204837486878122, -0.022035443415568973, -0.05803256100519899, -0.16848046671683817, 0.31075117747532205, 0.024252404827116564, 0.30715314822525464, 0.057003557893701574, 0.12372808628609742, -0.012975753021468832, -0.00299632188398391, 0.10463102970706215, -0.14499716770915255, 0.09607897470546463, 0.22614394814227126, 0.0074933775065636095, 0.2361441356955435, -0.4943123396232047, -0.31580484733832154, 0.0434217215960168, 0.10142875289331477, 0.11715995456271974, -0.03683487522066571, -0.23854676902886818, 0.00952205645206215, -0.1205249854659831, -0.13687645646701144, -0.08704450203275138, 0.03723867331705564, 0.023912008102739822, -0.2299901947236239, 0.11287160973090729, 0.07063696995663288, 0.11236436180770397, -0.1158079703232612, -0.04852126506368883, -0.05476623142074624, 0.10737637958637523, 0.044824991763082585, 0.059714239089093596, 0.1421510249471546, -0.1887046735458584, 0.014895242836792022, 0.480305259204893, -0.04433067876538685, -0.24887404246361589, 0.22286400264764036, -0.09927799307783558, -0.05550532939378172, 0.18203124399931933, 0.22822871081880294, 0.10374410684664988, -0.15028845019299875, 0.07208072926653337, -0.06969528613950718, 0.16159657973224636, 0.03505554114764726, -0.07921656531027772, 0.25351842036470773, 0.23234057193198665, 0.06798706101465293, 0.10183504087723452, -0.10023273778576615, -0.12572112483268774, -0.25870847507295286, -0.16954857790545, -0.14027811430648646, 0.00814784574904479, -0.08056395633367092, -0.21538301251024347, 0.3649533569982106, 0.10295568658038974, 0.15142322737361114, 0.0026557226744692093, 0.30075018587945535, 0.08232911020710493, 0.07713154009225863, 0.08514369727451016, 0.2331149002918127, 0.16616485527589578, 0.13324178578874457, -0.17309343343976336, 0.07876349891197275, 0.08379419640087607] |
1,802.0523 | Completeness and divergence-free behavior of the quasi-normal modes
using causality principle | A fundamental feature of the quasi-normal modes (QNMs), which describe light
interaction with open (leaky) systems like nanoparticles, lies in the question
of the completeness of the QNMs representation and in the divergence of their
field profile due to their leaky behavior and complex eigenfrequency. In this
article, the QNMs expansion is obtained by taking into consideration the
frequency dispersion and the causality principle. The derivation based on the
complex analysis ensures the completeness of the QNMs expansion and prevents
from any divergence of the field profile. The general derivation is tested in
the case of a one-dimensional open resonator made of a homogeneous absorptive
medium with frequency dispersion given by the Lorentz model. For a harmonic
excitation, the result of the QNMs expansion perfectly matches the exact
formula for the field distribution outside as well as inside the resonator.
| physics.optics | a fundamental feature of the quasinormal modes qnms which describe light interaction with open leaky systems like nanoparticles lies in the question of the completeness of the qnms representation and in the divergence of their field profile due to their leaky behavior and complex eigenfrequency in this article the qnms expansion is obtained by taking into consideration the frequency dispersion and the causality principle the derivation based on the complex analysis ensures the completeness of the qnms expansion and prevents from any divergence of the field profile the general derivation is tested in the case of a onedimensional open resonator made of a homogeneous absorptive medium with frequency dispersion given by the lorentz model for a harmonic excitation the result of the qnms expansion perfectly matches the exact formula for the field distribution outside as well as inside the resonator | [['a', 'fundamental', 'feature', 'of', 'the', 'quasinormal', 'modes', 'qnms', 'which', 'describe', 'light', 'interaction', 'with', 'open', 'leaky', 'systems', 'like', 'nanoparticles', 'lies', 'in', 'the', 'question', 'of', 'the', 'completeness', 'of', 'the', 'qnms', 'representation', 'and', 'in', 'the', 'divergence', 'of', 'their', 'field', 'profile', 'due', 'to', 'their', 'leaky', 'behavior', 'and', 'complex', 'eigenfrequency', 'in', 'this', 'article', 'the', 'qnms', 'expansion', 'is', 'obtained', 'by', 'taking', 'into', 'consideration', 'the', 'frequency', 'dispersion', 'and', 'the', 'causality', 'principle', 'the', 'derivation', 'based', 'on', 'the', 'complex', 'analysis', 'ensures', 'the', 'completeness', 'of', 'the', 'qnms', 'expansion', 'and', 'prevents', 'from', 'any', 'divergence', 'of', 'the', 'field', 'profile', 'the', 'general', 'derivation', 'is', 'tested', 'in', 'the', 'case', 'of', 'a', 'onedimensional', 'open', 'resonator', 'made', 'of', 'a', 'homogeneous', 'absorptive', 'medium', 'with', 'frequency', 'dispersion', 'given', 'by', 'the', 'lorentz', 'model', 'for', 'a', 'harmonic', 'excitation', 'the', 'result', 'of', 'the', 'qnms', 'expansion', 'perfectly', 'matches', 'the', 'exact', 'formula', 'for', 'the', 'field', 'distribution', 'outside', 'as', 'well', 'as', 'inside', 'the', 'resonator']] | [-0.1539184425192486, 0.10083298986511571, -0.0970046265599584, 0.03383508394971224, -0.09000033496745995, -0.08819997056187796, 0.03827973872123818, 0.304222282727382, -0.20966871100910275, -0.2448979541393263, 0.07812028369932834, -0.27211522795738086, -0.12216991706352148, 0.19073580226561587, 0.008072606871636318, 0.04684860905898469, 0.024813234386965633, 0.0776162990834564, -0.007989453279878943, -0.13228185880330523, 0.3455946462727817, 0.06260353053720402, 0.295954053130533, 0.025208747699590667, 0.07270644178081836, 0.04531116182583251, -0.006236217382164406, -0.01306108052709273, -0.09503346017362284, 0.11388772663527301, 0.20990042550131746, 0.09863026187023415, 0.2626672644966415, -0.3917042930477432, -0.20166085290589503, 0.02898328282670783, 0.18435070372652262, 0.12976248751178251, -0.022724932216806337, -0.29125448772101664, 0.013939267416883791, -0.12732570063588874, -0.2052404358018456, -0.029304341386471477, 0.020383294641007004, 0.013840726102768843, -0.23208830040613457, 0.10911358387342521, 0.10335214394227868, 0.044176767681035144, -0.10187747012491205, -0.03662794256566226, 0.009013675766930516, 0.09354447405452707, 0.07073615558827961, -0.010187992277289075, 0.13338147908715264, -0.14206139094229522, -0.05119842648439642, 0.4097971369046718, -0.10253967603535524, -0.20666465487863336, 0.1377547217150485, -0.20792285570475671, -0.009375477479937087, 0.11281928648906095, 0.1444367017530437, 0.11095980859660942, -0.13369094177781204, 0.11708123575330578, 0.0010003409747566495, 0.15702460332395277, 0.13948889687224955, 0.05056749554226241, 0.23515789079745966, 0.10869140775674688, -0.0322663031817813, 0.17730645705679698, -0.03019262518168294, -0.07012166622776671, -0.3242064055047065, -0.14738027672865428, -0.1934558887165622, 0.039954458766650144, -0.11660378432591512, -0.23366117908486297, 0.4352552328375168, 0.09342761329109116, 0.18356386221878762, 0.04475270334681097, 0.31383059431266574, 0.19018265282169783, 0.06597556017472275, 0.0727474271851991, 0.3040099662928177, 0.21597506233540895, 0.09036043182381295, -0.2848205195357358, -0.025165033644797014, 0.05566439373817827] |
1,802.05231 | Systematic Analysis of Dirac Neutrino Masses at Dimension Five | We perform a systematic study of the Dirac neutrino masses which arise from a
dimension five effective operator with a singlet scalar. We identify all
possible realizations of this operator at tree level and one-loop level. The
corresponding predictions for the particle content and neutrino mass matrix are
presented. We add a $Z_{2}$ symmetry to forbid the renormalizable Yukawa
coupling, and non-abelian discrete flavor symmetry can be used to forbid tree
level diagrams in non-genuine one-loop models. The electrically neutral
particle mediating the loop diagram could be dark matter candidate. We give the
possible dark matter particles and the restrictions on the parameter $\alpha$
for each model.
| hep-ph | we perform a systematic study of the dirac neutrino masses which arise from a dimension five effective operator with a singlet scalar we identify all possible realizations of this operator at tree level and oneloop level the corresponding predictions for the particle content and neutrino mass matrix are presented we add a z_2 symmetry to forbid the renormalizable yukawa coupling and nonabelian discrete flavor symmetry can be used to forbid tree level diagrams in nongenuine oneloop models the electrically neutral particle mediating the loop diagram could be dark matter candidate we give the possible dark matter particles and the restrictions on the parameter alpha for each model | [['we', 'perform', 'a', 'systematic', 'study', 'of', 'the', 'dirac', 'neutrino', 'masses', 'which', 'arise', 'from', 'a', 'dimension', 'five', 'effective', 'operator', 'with', 'a', 'singlet', 'scalar', 'we', 'identify', 'all', 'possible', 'realizations', 'of', 'this', 'operator', 'at', 'tree', 'level', 'and', 'oneloop', 'level', 'the', 'corresponding', 'predictions', 'for', 'the', 'particle', 'content', 'and', 'neutrino', 'mass', 'matrix', 'are', 'presented', 'we', 'add', 'a', 'z_2', 'symmetry', 'to', 'forbid', 'the', 'renormalizable', 'yukawa', 'coupling', 'and', 'nonabelian', 'discrete', 'flavor', 'symmetry', 'can', 'be', 'used', 'to', 'forbid', 'tree', 'level', 'diagrams', 'in', 'nongenuine', 'oneloop', 'models', 'the', 'electrically', 'neutral', 'particle', 'mediating', 'the', 'loop', 'diagram', 'could', 'be', 'dark', 'matter', 'candidate', 'we', 'give', 'the', 'possible', 'dark', 'matter', 'particles', 'and', 'the', 'restrictions', 'on', 'the', 'parameter', 'alpha', 'for', 'each', 'model']] | [-0.12316298322473591, 0.2797049880343289, -0.04152085330058759, 0.18805778040833526, -0.11463460413887053, -0.17028592680102198, 0.07528819897534134, 0.32392647115635537, -0.2017363967226, -0.3251233812874166, 0.03205819123220047, -0.2853032610266008, -0.08350556588810042, 0.062440402858028904, 0.07136950909952137, 0.027831171621855732, -0.011342219617783535, 0.06093510719033602, -0.0667016942796045, -0.22439411019027303, 0.32588782958320783, 0.01219129315838566, 0.18732922075090008, 0.07917263050711601, 0.09242017642011709, -0.0290662132020796, -0.03845227603413269, -0.07031249032556036, -0.13257899654976954, 0.041199084946877004, 0.18434177942413682, 0.048104784480800904, 0.07622265893635209, -0.3975981754189897, -0.16956911231478172, 0.19769822961050215, 0.14452873728734172, 0.1549414598772511, -0.08870502435667528, -0.3102450573590593, 0.0729783337963658, -0.22436776510048134, -0.16157638560545362, -0.09378889336242019, -0.07143177907200199, -0.12781774010900931, -0.308142017956092, 0.08834446144532891, -0.05604048774830092, -0.02282046015422234, -0.007841225978961893, -0.14637941046330694, -0.08246285743819916, 0.08404819099733031, 0.08895787164007496, -0.028574146350212482, 0.16725364341574642, -0.1873030819272988, -0.149883432632582, 0.4370670665325336, -0.10138981472526755, -0.23288861740484973, 0.1534924553533163, -0.12103528057651541, -0.17904279134714993, 0.1175148898961945, 0.153077287494997, 0.07293468253974254, -0.16720464925725606, 0.19971208278498848, -0.0513772854285541, 0.1582641289819676, 0.05356399274091715, 0.03039530753462671, 0.3044722344308535, 0.1486595425685154, 0.07158414361493609, 0.046913522660335695, -0.05577099753139001, -0.07495225770029057, -0.39740273953528604, -0.14304321195721348, -0.08602928174072093, 0.03468355833319947, -0.1162884630557698, -0.1576595938477282, 0.4486672123807056, 0.1513054818045522, 0.18258745832968215, 0.025558340238085207, 0.2430571208090008, 0.13215983312611826, 0.09979996394157131, 0.017555542220579128, 0.23992606057898602, 0.14212552290061645, 0.03542502400700316, -0.23104880009255607, -0.07113646424079541, 0.134027653523921] |
1,802.05232 | Simple heteroclinic networks in ${\mathbb R}^4$ | We classify simple heteroclinic networks for a $\Gamma$-equivariant system in
${\mathbb R}^4$ with finite $\Gamma \subset {\rm O}(4)$, proceeding as follows:
we define a graph associated with a given $\Gamma \subset {\rm O}(n)$ and
identify all so-called simple graphs associated with subgroups of ${\rm O}(4)$.
Then, knowing the graph associated with a given $\Gamma$, we determine the
types of heteroclinic networks that the group admits. Our study is restricted
to networks that are maximal in the sense that they have the highest possible
number of connections -- any non-maximal network can then be derived by
deleting one or more connections. Finally, for networks of type A, i.e.,
admitted by $\Gamma \subset {\rm SO}(4)$, we give necessary and sufficient
conditions for fragmentary and essential asymptotic stability. (For other
simple heteroclinic networks the conditions for stability are known.) The
results are illustrated by a numerical example of a simple heteroclinic network
that involves two subcycles that can be essentially asymptotically stable
simultaneously.
| math.DS nlin.CD | we classify simple heteroclinic networks for a gammaequivariant system in mathbb r4 with finite gamma subset rm o4 proceeding as follows we define a graph associated with a given gamma subset rm on and identify all socalled simple graphs associated with subgroups of rm o4 then knowing the graph associated with a given gamma we determine the types of heteroclinic networks that the group admits our study is restricted to networks that are maximal in the sense that they have the highest possible number of connections any nonmaximal network can then be derived by deleting one or more connections finally for networks of type a ie admitted by gamma subset rm so4 we give necessary and sufficient conditions for fragmentary and essential asymptotic stability for other simple heteroclinic networks the conditions for stability are known the results are illustrated by a numerical example of a simple heteroclinic network that involves two subcycles that can be essentially asymptotically stable simultaneously | [['we', 'classify', 'simple', 'heteroclinic', 'networks', 'for', 'a', 'gammaequivariant', 'system', 'in', 'mathbb', 'r4', 'with', 'finite', 'gamma', 'subset', 'rm', 'o4', 'proceeding', 'as', 'follows', 'we', 'define', 'a', 'graph', 'associated', 'with', 'a', 'given', 'gamma', 'subset', 'rm', 'on', 'and', 'identify', 'all', 'socalled', 'simple', 'graphs', 'associated', 'with', 'subgroups', 'of', 'rm', 'o4', 'then', 'knowing', 'the', 'graph', 'associated', 'with', 'a', 'given', 'gamma', 'we', 'determine', 'the', 'types', 'of', 'heteroclinic', 'networks', 'that', 'the', 'group', 'admits', 'our', 'study', 'is', 'restricted', 'to', 'networks', 'that', 'are', 'maximal', 'in', 'the', 'sense', 'that', 'they', 'have', 'the', 'highest', 'possible', 'number', 'of', 'connections', 'any', 'nonmaximal', 'network', 'can', 'then', 'be', 'derived', 'by', 'deleting', 'one', 'or', 'more', 'connections', 'finally', 'for', 'networks', 'of', 'type', 'a', 'ie', 'admitted', 'by', 'gamma', 'subset', 'rm', 'so4', 'we', 'give', 'necessary', 'and', 'sufficient', 'conditions', 'for', 'fragmentary', 'and', 'essential', 'asymptotic', 'stability', 'for', 'other', 'simple', 'heteroclinic', 'networks', 'the', 'conditions', 'for', 'stability', 'are', 'known', 'the', 'results', 'are', 'illustrated', 'by', 'a', 'numerical', 'example', 'of', 'a', 'simple', 'heteroclinic', 'network', 'that', 'involves', 'two', 'subcycles', 'that', 'can', 'be', 'essentially', 'asymptotically', 'stable', 'simultaneously']] | [-0.18850766045829198, 0.1039150501601398, -0.02867863932917328, 0.07165400575884506, -0.08309437701209162, -0.18275943445041776, 0.033243562248623314, 0.3925710677069688, -0.2604028585735919, -0.20954068976237714, 0.13813183147829236, -0.25934852594099705, -0.1982464392350272, 0.2061968446114692, -0.07157164376372553, 0.005736628755247631, 0.08538100547918687, 0.1316113258205331, -0.05503362539457157, -0.20955105884617148, 0.3680580312725883, -0.04392773137316577, 0.20725574257707446, -0.00885033758978415, 0.07994786694165577, -0.04318091394116153, -0.0021335305338549726, 0.0416446476105788, -0.167660082769172, 0.09570337354744428, 0.24547370714164754, 0.13653676156774633, 0.21558044286175343, -0.41219787502883926, -0.20637047617423857, 0.22055626726846955, 0.14949455180164403, 0.04614175920983858, -0.015385641265128236, -0.2735593453073089, 0.18111254227986126, -0.15491522794425394, -0.15761831637293264, -0.09904083666690397, 0.05576705746645541, 0.044895219770348015, -0.2793815325851898, 0.021378744371621957, 0.0572422168352319, 0.05635785031770854, -0.02449126982528412, -0.070894695054769, -0.0945937024171716, 0.13021774631163469, -0.009479216670430024, 0.022205746798547654, 0.05981343811811329, -0.09384360121059343, -0.12914676208169135, 0.3839257426044476, -0.024403002372658782, -0.22579934442951782, 0.19632205000563097, -0.08409226002865734, -0.1916751315957814, 0.13365378154371427, 0.11425878600738708, 0.1098465306813237, -0.13047754681967902, 0.0885145531475995, -0.09329768519558646, 0.0884698909449643, 0.07924961696712757, -0.007020578804607474, 0.14299071760468898, 0.1491746290780182, 0.12140231761852947, 0.12661948667014744, -0.02700422288309607, -0.028214798815937935, -0.36124817688463245, -0.09589097545622795, -0.13451446046973667, 0.09066989429810512, -0.13753425438843342, -0.14537170713287104, 0.3871630998152607, 0.05154028428285002, 0.2105696784316287, 0.1178104477647528, 0.19385271273412794, 0.07582698517688403, 0.02555339945972247, 0.11973565015297546, 0.166143273662354, 0.15015078688467964, -0.03000705603820582, -0.16401493656610097, 0.03586980434568048, 0.11421489489188641] |
1,802.05233 | Cyber Physical Systems: Prospects and Challenges | Cyber physical systems CPSs embodies the conception as well as the
implementation of the integration of the state-of-art technologies in sensing,
communication, computing, and control. Such systems incorporate new trends such
as cloud computing, mobile computing, mobile sensing, new modes of
communications, wearables, etc. In this article we give an exposition of the
architecture of a typical CPS system and the prospects of such systems in the
development of the modern world. We illustrate the three major challenges faced
by a CPS system: the need for rigorous numerical computation, the limitation of
the current wireless communication bandwidth, and the computation/storage
limitation by mobility and energy consumption. We address each one of these
exposing the current techniques devised to solve each one of them.
| cs.CY | cyber physical systems cpss embodies the conception as well as the implementation of the integration of the stateofart technologies in sensing communication computing and control such systems incorporate new trends such as cloud computing mobile computing mobile sensing new modes of communications wearables etc in this article we give an exposition of the architecture of a typical cps system and the prospects of such systems in the development of the modern world we illustrate the three major challenges faced by a cps system the need for rigorous numerical computation the limitation of the current wireless communication bandwidth and the computationstorage limitation by mobility and energy consumption we address each one of these exposing the current techniques devised to solve each one of them | [['cyber', 'physical', 'systems', 'cpss', 'embodies', 'the', 'conception', 'as', 'well', 'as', 'the', 'implementation', 'of', 'the', 'integration', 'of', 'the', 'stateofart', 'technologies', 'in', 'sensing', 'communication', 'computing', 'and', 'control', 'such', 'systems', 'incorporate', 'new', 'trends', 'such', 'as', 'cloud', 'computing', 'mobile', 'computing', 'mobile', 'sensing', 'new', 'modes', 'of', 'communications', 'wearables', 'etc', 'in', 'this', 'article', 'we', 'give', 'an', 'exposition', 'of', 'the', 'architecture', 'of', 'a', 'typical', 'cps', 'system', 'and', 'the', 'prospects', 'of', 'such', 'systems', 'in', 'the', 'development', 'of', 'the', 'modern', 'world', 'we', 'illustrate', 'the', 'three', 'major', 'challenges', 'faced', 'by', 'a', 'cps', 'system', 'the', 'need', 'for', 'rigorous', 'numerical', 'computation', 'the', 'limitation', 'of', 'the', 'current', 'wireless', 'communication', 'bandwidth', 'and', 'the', 'computationstorage', 'limitation', 'by', 'mobility', 'and', 'energy', 'consumption', 'we', 'address', 'each', 'one', 'of', 'these', 'exposing', 'the', 'current', 'techniques', 'devised', 'to', 'solve', 'each', 'one', 'of', 'them']] | [-0.21032487384868953, 0.02082985947753314, 0.00736457828721112, 0.009080891969719736, -0.0319774323029489, -0.16361519234724403, 0.051070101922605096, 0.31459357196889154, -0.2962408167862795, -0.35483670130190326, 0.1457675332137255, -0.26373181986145494, -0.18491564318916298, 0.21715705325245874, -0.12154466452855972, 0.12424147381954562, 0.039295885772482164, -0.016052175953045367, -0.03456984405080235, -0.21019140431824013, 0.30933066113374946, 0.03668913931956863, 0.3294995571145924, 0.08803587346299876, 0.06565960887341563, 0.021108555866829384, -0.04740457020877913, -0.042734718131946355, -0.075007890843279, 0.21734970066946271, 0.2909492902851444, 0.20308412887095437, 0.3566002811994252, -0.4864817958900599, -0.21809764333993076, 0.060671941142498964, 0.16868247466192135, 0.07533514085680065, -0.07881835879137118, -0.2827215527858191, 0.04622216109655858, -0.2660979685653758, -0.1343461237620653, -0.061768890487227016, 0.004935605245135058, 0.05202060073190104, -0.19142134983387843, -0.028750890298042356, -0.003612941485920512, 0.06974035319001452, -0.04604843284601603, -0.10678050413962484, 0.07235141911892205, 0.1980789043425726, 0.01002628118466071, -0.054983713175738004, 0.17342207769908738, -0.1671274750875839, -0.18904099464075777, 0.4230188042288873, 0.030160570740548332, -0.14514975693470578, 0.20705437272071567, -0.015317842901903925, -0.14917343347598383, 0.037235857156006906, 0.2091795804350054, 0.046767232545871076, -0.19197591035286102, 0.05869473054947339, 0.07471599861623614, 0.12645637259886758, 0.01015057778970255, 0.11233751684412117, 0.2179305649900097, 0.26455349288880825, 0.11559613640003694, 0.08490167959116218, -0.06477246849586604, -0.11116588835006322, -0.23811476368729662, -0.21416314359663463, -0.1993759246391615, 0.013853551698772887, -0.04883698477718328, -0.13347787711375614, 0.3929179071125052, 0.22896275278635142, 0.1324631365818706, 0.03565319738259948, 0.4334367321637588, 0.09815134303133208, 0.10477112749510074, 0.09274506009547268, 0.18734084990545652, 0.05013698339840867, 0.20821375007541448, -0.19543811845369788, 0.03177172873865783, -0.03127168960172713] |
1,802.05234 | Necessary and Sufficient Null Space Condition for Nuclear Norm
Minimization in Low-Rank Matrix Recovery | Low-rank matrix recovery has found many applications in science and
engineering such as machine learning, signal processing, collaborative
filtering, system identification, and Euclidean embedding. But the low-rank
matrix recovery problem is an NP hard problem and thus challenging. A commonly
used heuristic approach is the nuclear norm minimization. In [12,14,15], the
authors established the necessary and sufficient null space conditions for
nuclear norm minimization to recover every possible low-rank matrix with rank
at most r (the strong null space condition). In addition, in [12], Oymak et al.
established a null space condition for successful recovery of a given low-rank
matrix (the weak null space condition) using nuclear norm minimization, and
derived the phase transition for the nuclear norm minimization. In this paper,
we show that the weak null space condition in [12] is only a sufficient
condition for successful matrix recovery using nuclear norm minimization, and
is not a necessary condition as claimed in [12]. In this paper, we further give
a weak null space condition for low-rank matrix recovery, which is both
necessary and sufficient for the success of nuclear norm minimization. At the
core of our derivation are an inequality for characterizing the nuclear norms
of block matrices, and the conditions for equality to hold in that inequality.
| math.OC cs.IT cs.LG eess.SP math.IT stat.ML | lowrank matrix recovery has found many applications in science and engineering such as machine learning signal processing collaborative filtering system identification and euclidean embedding but the lowrank matrix recovery problem is an np hard problem and thus challenging a commonly used heuristic approach is the nuclear norm minimization in 121415 the authors established the necessary and sufficient null space conditions for nuclear norm minimization to recover every possible lowrank matrix with rank at most r the strong null space condition in addition in 12 oymak et al established a null space condition for successful recovery of a given lowrank matrix the weak null space condition using nuclear norm minimization and derived the phase transition for the nuclear norm minimization in this paper we show that the weak null space condition in 12 is only a sufficient condition for successful matrix recovery using nuclear norm minimization and is not a necessary condition as claimed in 12 in this paper we further give a weak null space condition for lowrank matrix recovery which is both necessary and sufficient for the success of nuclear norm minimization at the core of our derivation are an inequality for characterizing the nuclear norms of block matrices and the conditions for equality to hold in that inequality | [['lowrank', 'matrix', 'recovery', 'has', 'found', 'many', 'applications', 'in', 'science', 'and', 'engineering', 'such', 'as', 'machine', 'learning', 'signal', 'processing', 'collaborative', 'filtering', 'system', 'identification', 'and', 'euclidean', 'embedding', 'but', 'the', 'lowrank', 'matrix', 'recovery', 'problem', 'is', 'an', 'np', 'hard', 'problem', 'and', 'thus', 'challenging', 'a', 'commonly', 'used', 'heuristic', 'approach', 'is', 'the', 'nuclear', 'norm', 'minimization', 'in', '121415', 'the', 'authors', 'established', 'the', 'necessary', 'and', 'sufficient', 'null', 'space', 'conditions', 'for', 'nuclear', 'norm', 'minimization', 'to', 'recover', 'every', 'possible', 'lowrank', 'matrix', 'with', 'rank', 'at', 'most', 'r', 'the', 'strong', 'null', 'space', 'condition', 'in', 'addition', 'in', '12', 'oymak', 'et', 'al', 'established', 'a', 'null', 'space', 'condition', 'for', 'successful', 'recovery', 'of', 'a', 'given', 'lowrank', 'matrix', 'the', 'weak', 'null', 'space', 'condition', 'using', 'nuclear', 'norm', 'minimization', 'and', 'derived', 'the', 'phase', 'transition', 'for', 'the', 'nuclear', 'norm', 'minimization', 'in', 'this', 'paper', 'we', 'show', 'that', 'the', 'weak', 'null', 'space', 'condition', 'in', '12', 'is', 'only', 'a', 'sufficient', 'condition', 'for', 'successful', 'matrix', 'recovery', 'using', 'nuclear', 'norm', 'minimization', 'and', 'is', 'not', 'a', 'necessary', 'condition', 'as', 'claimed', 'in', '12', 'in', 'this', 'paper', 'we', 'further', 'give', 'a', 'weak', 'null', 'space', 'condition', 'for', 'lowrank', 'matrix', 'recovery', 'which', 'is', 'both', 'necessary', 'and', 'sufficient', 'for', 'the', 'success', 'of', 'nuclear', 'norm', 'minimization', 'at', 'the', 'core', 'of', 'our', 'derivation', 'are', 'an', 'inequality', 'for', 'characterizing', 'the', 'nuclear', 'norms', 'of', 'block', 'matrices', 'and', 'the', 'conditions', 'for', 'equality', 'to', 'hold', 'in', 'that', 'inequality']] | [-0.07872309042786975, 0.04264298351005313, -0.04878388990566767, 0.11496625024252727, -0.0480112976909272, -0.15638071790105845, -0.019251849825948512, 0.3687135777993208, -0.29860582820119774, -0.2638809399870915, 0.1832939848971094, -0.20239179566030227, -0.16082186541524515, 0.11841024111501837, -0.08181007238301008, 0.12418332959650058, 0.0749732965311597, 0.06556185397863139, -0.16976760361710136, -0.2532963690929489, 0.3102597166788564, 0.06783070394760399, 0.2803823017876185, 0.0705899888901352, 0.10829943775435526, 0.06216720712725429, 0.028336027985813014, -0.020889224895358566, -0.11177477443794905, 0.11038824670355428, 0.2893157700259399, 0.24317486951368278, 0.3111146976636571, -0.4371732345187054, -0.18789881501017075, 0.20827099684354042, 0.09165701582475284, 0.06068611345710634, -0.07844326248989579, -0.2652074347281356, 0.09412773973286223, -0.11844604550727139, -0.09059434250870532, -0.1262073834269624, 0.011680508197873439, -0.05156274202043574, -0.3931234775659178, 0.10489402057349005, 0.08327424769517053, 0.030091468939940896, -0.1285393788104957, -0.14276464117644133, 0.09560223344521837, 0.0615451719955002, 0.038120478747020424, 0.04925199805950505, 0.10528385569647837, -0.08759108159254399, -0.04156891729361845, 0.35478602847948887, -0.014872101941547004, -0.2087236420144483, 0.14596621280688676, -0.11447703878675992, -0.17401612185734952, 0.11198981733252986, 0.1399044418867909, 0.0917265816820333, -0.15489093207143712, 0.11945148446245128, -0.08671713018852273, 0.13096647888742852, 0.05786810214207931, 0.030869916527037414, 0.06198671507831823, 0.12462577247395042, 0.20007186685326736, 0.0875916119540137, -0.057625132832346423, -0.028124899866892712, -0.3416980207367448, -0.14236825593172364, -0.26584033982195493, 0.011669445155774973, -0.11669506281825968, -0.14410069576379927, 0.33497144600697326, 0.05698342640209123, 0.17366604686104226, 0.03993307725853915, 0.2829283029709956, 0.08315033815621786, 0.014901512199968242, 0.0926738188236631, 0.24217785927177402, 0.23167127286168662, 0.08583242919942995, -0.1896352729087241, 0.08085476511946776, 0.12113930837309175] |
1,802.05235 | Robust Target Localization Based on Squared Range Iterative Reweighted
Least Squares | In this paper, the problem of target localization in the presence of outlying
sensors is tackled. This problem is important in practice because in many
real-world applications the sensors might report irrelevant data
unintentionally or maliciously. The problem is formulated by applying robust
statistics techniques on squared range measurements and two different
approaches to solve the problem are proposed. The first approach is
computationally efficient; however, only the objective convergence is
guaranteed theoretically. On the other hand, the whole-sequence convergence of
the second approach is established. To enjoy the benefit of both approaches,
they are integrated to develop a hybrid algorithm that offers computational
efficiency and theoretical guarantees. The algorithms are evaluated for
different simulated and real-world scenarios. The numerical results show that
the proposed methods meet the Cr'amer-Rao lower bound (CRLB) for a sufficiently
large number of measurements. When the number of the measurements is small, the
proposed position estimator does not achieve CRLB though it still outperforms
several existing localization methods.
| math.OC eess.SP | in this paper the problem of target localization in the presence of outlying sensors is tackled this problem is important in practice because in many realworld applications the sensors might report irrelevant data unintentionally or maliciously the problem is formulated by applying robust statistics techniques on squared range measurements and two different approaches to solve the problem are proposed the first approach is computationally efficient however only the objective convergence is guaranteed theoretically on the other hand the wholesequence convergence of the second approach is established to enjoy the benefit of both approaches they are integrated to develop a hybrid algorithm that offers computational efficiency and theoretical guarantees the algorithms are evaluated for different simulated and realworld scenarios the numerical results show that the proposed methods meet the cramerrao lower bound crlb for a sufficiently large number of measurements when the number of the measurements is small the proposed position estimator does not achieve crlb though it still outperforms several existing localization methods | [['in', 'this', 'paper', 'the', 'problem', 'of', 'target', 'localization', 'in', 'the', 'presence', 'of', 'outlying', 'sensors', 'is', 'tackled', 'this', 'problem', 'is', 'important', 'in', 'practice', 'because', 'in', 'many', 'realworld', 'applications', 'the', 'sensors', 'might', 'report', 'irrelevant', 'data', 'unintentionally', 'or', 'maliciously', 'the', 'problem', 'is', 'formulated', 'by', 'applying', 'robust', 'statistics', 'techniques', 'on', 'squared', 'range', 'measurements', 'and', 'two', 'different', 'approaches', 'to', 'solve', 'the', 'problem', 'are', 'proposed', 'the', 'first', 'approach', 'is', 'computationally', 'efficient', 'however', 'only', 'the', 'objective', 'convergence', 'is', 'guaranteed', 'theoretically', 'on', 'the', 'other', 'hand', 'the', 'wholesequence', 'convergence', 'of', 'the', 'second', 'approach', 'is', 'established', 'to', 'enjoy', 'the', 'benefit', 'of', 'both', 'approaches', 'they', 'are', 'integrated', 'to', 'develop', 'a', 'hybrid', 'algorithm', 'that', 'offers', 'computational', 'efficiency', 'and', 'theoretical', 'guarantees', 'the', 'algorithms', 'are', 'evaluated', 'for', 'different', 'simulated', 'and', 'realworld', 'scenarios', 'the', 'numerical', 'results', 'show', 'that', 'the', 'proposed', 'methods', 'meet', 'the', 'cramerrao', 'lower', 'bound', 'crlb', 'for', 'a', 'sufficiently', 'large', 'number', 'of', 'measurements', 'when', 'the', 'number', 'of', 'the', 'measurements', 'is', 'small', 'the', 'proposed', 'position', 'estimator', 'does', 'not', 'achieve', 'crlb', 'though', 'it', 'still', 'outperforms', 'several', 'existing', 'localization', 'methods']] | [-0.10542954809684882, 0.020279004350649537, -0.07095893006771803, 0.08585540754763686, -0.058154213771132036, -0.17677892754314306, 0.032183700244741535, 0.39951826841857885, -0.24581444882615297, -0.3516003066834844, 0.14574624854139984, -0.2727643988658617, -0.17566570537495368, 0.25850661981845113, -0.12866067543142923, 0.12148246902075631, 0.11681843842997756, 0.039320294112886914, -0.06713093931780967, -0.3110363970648635, 0.253165167675894, 0.0513250096011217, 0.3718059848430624, 0.07748825260277056, 0.08877059096688933, -0.03216392684147268, -0.01124600271254571, 0.0447809960280637, -0.07844960159828016, 0.1470887554729685, 0.2930791181753631, 0.1769415669180568, 0.33743872831828525, -0.40841214178291, -0.200510328779296, 0.11585680958613707, 0.16718661851094416, 0.11193848896863652, -0.055617446026672825, -0.2717481354929875, 0.12905333497285568, -0.11605908761640298, -0.06251133702706868, -0.10049035664601827, -0.053692023951077354, -0.0005421371660540226, -0.3017803813807988, 0.06977656944999816, 0.035108626851766016, -0.0038832956810056427, -0.04364598275415232, -0.13903804202880252, 0.06441645167859984, 0.12576067235797248, 0.07449183582448987, -0.01217733127033384, 0.12828636759917977, -0.12460150417906267, -0.13422411790313085, 0.3680311758588586, -0.005118131968135267, -0.2391854005486325, 0.20936091748974572, -0.07838530233561027, -0.14086007447999524, 0.127894854699089, 0.1841026342302894, 0.1679963539958138, -0.15621539667425863, 0.07916087147177565, -0.031699343406261855, 0.14652370799183387, 0.0035323537196274156, 0.04327891641267702, 0.11830334309028623, 0.1880795732241147, 0.1287351253749314, 0.11318642392727248, -0.10842002259084473, -0.08261915936025527, -0.22794888006454264, -0.08748122454904031, -0.26345577128059056, -0.07312648544326227, -0.07891293389431307, -0.13617415305939906, 0.33614259006536024, 0.243539941833458, 0.1623900905136525, 0.08399076662083835, 0.4061945032466341, 0.11200560922058943, 0.0387248840563166, 0.08603791893103424, 0.2777819228150169, 0.07589114601810083, 0.08826460182252857, -0.20245801046994416, 0.12189906521607442, 0.029237871443461856] |
1,802.05236 | PDF dependence on parameter fits from hadronic data | We present a discussion on the methods for extracting a given parameter from
measurements of hadronic data, with particular focus on determinations of the
strong coupling constant. We show that when the PDF dependency on the
determination is adequately taken into account, the dispersion between the
results from different measurements is significantly reduced. We speculatively
propose the concept of preferred value of a parameter from a particular
dataset.
| hep-ph | we present a discussion on the methods for extracting a given parameter from measurements of hadronic data with particular focus on determinations of the strong coupling constant we show that when the pdf dependency on the determination is adequately taken into account the dispersion between the results from different measurements is significantly reduced we speculatively propose the concept of preferred value of a parameter from a particular dataset | [['we', 'present', 'a', 'discussion', 'on', 'the', 'methods', 'for', 'extracting', 'a', 'given', 'parameter', 'from', 'measurements', 'of', 'hadronic', 'data', 'with', 'particular', 'focus', 'on', 'determinations', 'of', 'the', 'strong', 'coupling', 'constant', 'we', 'show', 'that', 'when', 'the', 'pdf', 'dependency', 'on', 'the', 'determination', 'is', 'adequately', 'taken', 'into', 'account', 'the', 'dispersion', 'between', 'the', 'results', 'from', 'different', 'measurements', 'is', 'significantly', 'reduced', 'we', 'speculatively', 'propose', 'the', 'concept', 'of', 'preferred', 'value', 'of', 'a', 'parameter', 'from', 'a', 'particular', 'dataset']] | [-0.08801422088735682, 0.11010934550123398, -0.1016589719665182, 0.01841911137008163, -0.08273538087001618, -0.08917165605132193, 0.08307951211806058, 0.3404670948272242, -0.21676768070799024, -0.3208762455649455, 0.08438035539652713, -0.2861923435155083, -0.06545636500916718, 0.21612799293635523, 0.002377120462958427, 0.0032648082877344943, 0.1230446373057716, 0.027930824469555828, -0.11422219292794847, -0.16773026059587104, 0.3892235077356043, 0.025614657261244515, 0.2930942121619249, 0.10193250087254188, 0.10996319782433976, 0.026972933747696087, -0.09431301249081597, 0.06578575852600967, -0.20819154802612663, 0.12599629347609795, 0.176864481976201, 0.132202368505686, 0.25287374358295517, -0.3820847750038785, -0.19098803242805468, 0.08378570730907514, 0.09911820029511172, 0.1368063859477201, -0.054161849525853005, -0.2877317700151573, 0.0441218623001238, -0.13803499074556919, -0.05455323630560409, -0.05864713205579285, -0.0030406344517627183, -0.0030959029408062205, -0.28667194974225235, 0.07007940379245316, 0.021163157009355286, 0.035619224407984054, -0.08577544477713459, -0.14387977141065195, 0.005324366803774063, 0.13015904163073763, 0.07399591861587182, 0.028957416823900798, 0.0966233708005508, -0.1439625906127998, -0.043220344992518867, 0.4126275097403456, -0.1155597965219332, -0.20459518326884685, 0.1193610406754648, -0.15728839867583969, -0.16369008975486984, 0.06858992165721514, 0.21396402324385502, 0.09683822486412656, -0.11641082367350464, 0.06078273711917812, -0.04161782184725299, 0.21240054448956952, -0.03297626235357979, 0.011773434994906625, 0.18391089750837317, 0.19427282878485344, 0.01847147655002225, 0.11817558834616862, -0.12718750297790393, -0.06179724955890218, -0.3300295171108754, -0.09261123247115928, -0.1736890160588219, 0.012603630722664735, -0.13152354568763472, -0.13491305654101513, 0.41238445240100297, 0.20531090650269213, 0.27424353900749016, 0.053368364488158154, 0.32892273774589686, 0.12617135828237652, 0.08751392734634197, 0.04188762951012263, 0.2774499737219337, 0.0755577372140525, 0.05648151515325641, -0.21983516189228633, 0.11616415882428341, 0.016861893079134032] |
1,802.05237 | Unramified covers and branes on the Hitchin system | We study the locus of the moduli space of Higgs bundles on a curve given by
those Higgs bundles obtained by pushforward under an unramified cover. We equip
these loci with a hyperholomorphic bundle so that they can be viewed as
BBB-branes, and we introduce corresponding BAA-branes which can be described
via Hecke modifications. We then show how these branes are naturally dual via
explicit Fourier--Mukai transform, where we recall that the structure group
$\mathrm{GL}(n,\mathbb{C})$ is Langlands self dual. It is noteworthy that these
branes lie over the singular locus of the Hitchin fibration.
As a particular case, our construction describes the behaviour under mirror
symmetry of the fixed loci for the action of tensorization by a line bundle of
order $n$. These loci play a key role in the work of Hausel and Thaddeus on
topological mirror symmetry for Higgs moduli spaces.
| math.AG | we study the locus of the moduli space of higgs bundles on a curve given by those higgs bundles obtained by pushforward under an unramified cover we equip these loci with a hyperholomorphic bundle so that they can be viewed as bbbbranes and we introduce corresponding baabranes which can be described via hecke modifications we then show how these branes are naturally dual via explicit fouriermukai transform where we recall that the structure group mathrmglnmathbbc is langlands self dual it is noteworthy that these branes lie over the singular locus of the hitchin fibration as a particular case our construction describes the behaviour under mirror symmetry of the fixed loci for the action of tensorization by a line bundle of order n these loci play a key role in the work of hausel and thaddeus on topological mirror symmetry for higgs moduli spaces | [['we', 'study', 'the', 'locus', 'of', 'the', 'moduli', 'space', 'of', 'higgs', 'bundles', 'on', 'a', 'curve', 'given', 'by', 'those', 'higgs', 'bundles', 'obtained', 'by', 'pushforward', 'under', 'an', 'unramified', 'cover', 'we', 'equip', 'these', 'loci', 'with', 'a', 'hyperholomorphic', 'bundle', 'so', 'that', 'they', 'can', 'be', 'viewed', 'as', 'bbbbranes', 'and', 'we', 'introduce', 'corresponding', 'baabranes', 'which', 'can', 'be', 'described', 'via', 'hecke', 'modifications', 'we', 'then', 'show', 'how', 'these', 'branes', 'are', 'naturally', 'dual', 'via', 'explicit', 'fouriermukai', 'transform', 'where', 'we', 'recall', 'that', 'the', 'structure', 'group', 'mathrmglnmathbbc', 'is', 'langlands', 'self', 'dual', 'it', 'is', 'noteworthy', 'that', 'these', 'branes', 'lie', 'over', 'the', 'singular', 'locus', 'of', 'the', 'hitchin', 'fibration', 'as', 'a', 'particular', 'case', 'our', 'construction', 'describes', 'the', 'behaviour', 'under', 'mirror', 'symmetry', 'of', 'the', 'fixed', 'loci', 'for', 'the', 'action', 'of', 'tensorization', 'by', 'a', 'line', 'bundle', 'of', 'order', 'n', 'these', 'loci', 'play', 'a', 'key', 'role', 'in', 'the', 'work', 'of', 'hausel', 'and', 'thaddeus', 'on', 'topological', 'mirror', 'symmetry', 'for', 'higgs', 'moduli', 'spaces']] | [-0.17567217613990144, 0.0885025188721377, -0.13565721941298584, 0.09137381310410746, -0.12065046352275292, -0.15223549065363765, -0.002258757704829561, 0.3566986570138038, -0.28703847610142447, -0.19111841673713545, 0.10551376506919041, -0.19246225439759732, -0.21957375189374712, 0.18029670960361688, -0.16291243691181004, -0.016312559804236387, 0.018996698647396455, 0.05691078044867642, -0.06866875973212021, -0.3142375091827002, 0.46427101862918535, -0.004839844604901654, 0.2459204647080107, 0.01862513839060598, 0.10902514339352525, 0.04592617090568471, 0.0383269607456742, -0.044419585960190806, -0.11689313826995408, 0.1570112953277331, 0.30105358049352193, 0.06240139227085025, 0.13018425849010565, -0.3725265765064199, -0.14982588459802365, 0.2032623760612078, 0.16033339079692435, 0.02377916318380838, -0.003865371997678049, -0.2924879856610959, 0.09189443233317178, -0.12645949510214718, -0.15155014078768994, -0.12788126246452752, -0.02667247555153051, 0.012362186398527677, -0.1876823654399142, -0.055486503280174564, 0.042430108347514144, 0.12789642735069592, -0.05361861387320178, -0.08743067866217502, -0.14259287849245725, 0.04524309461293611, 0.07951606173579856, 0.051822032990970344, 0.1573060299581389, -0.11631316935125424, -0.11195120613195632, 0.36462611616687507, -0.0977854933499516, -0.22238661353574724, 0.1023686026783765, -0.11240690324084938, -0.1673051576871215, 0.11725190549459256, 0.0937201324915907, 0.168285732701893, 0.0051836121797030395, 0.17435729224977786, -0.12392635180772295, 0.06519262186697566, 0.08874053299807431, -0.015659694117165997, 0.21730350730547182, 0.10407294833239063, 0.06738784810541276, 0.11878801021285512, -0.03179619776029271, -0.08790772424766492, -0.44796500302536385, -0.23348338338468572, -0.06541033144909102, 0.11948624894725533, -0.10038231155473548, -0.10640045554167263, 0.3992421057986909, 0.04819639881049663, 0.28297913187629425, 0.08947587589500472, 0.19363611006558362, 0.06330894102575257, 0.0844389162039463, 0.0030535393309267895, 0.19632921979146103, 0.16857056993774702, -0.007830438641077039, -0.18516749702721938, -0.05634660729941663, 0.231551198785613] |
1,802.05238 | Voltage preservation in Intermediate Band Solar Cells | Intermediate Band Solar Cell is an advanced concept for solar energy
conversion in which two low-energy photons can promote an electron to the
conduction band through a so-called intermediate band. To limit recombination
and preserve the photo-generated voltage, generation to- and from the
intermediate band should be matched. However, all practical realizations
experienced a significant voltage degradation as compared to a single junction
without intermediate band. In this work, we develop a novel analytical
optimization method based on Lagrange multipliers. We demonstrate that an
Intermediate Band Solar Cell under solar spectrum cannot meet voltage
preservation and current matching at the same time. By contrast, we show that
the implementation of an energy shift (\emph{electronic ratchet}) in any of the
bands allows those two criteria to be filled simultaneously. Additional
insights are provided by the numerical study of the short circuit current and
fill factor of the systems at stake, which show that a system with ratchet
benefits from the same current increase as a standard Intermediate Band Solar
Cell (same short-circuit current), while maintaining I-V properties of a single
junction (same open-voltage circuit, same fill factor).
| physics.app-ph | intermediate band solar cell is an advanced concept for solar energy conversion in which two lowenergy photons can promote an electron to the conduction band through a socalled intermediate band to limit recombination and preserve the photogenerated voltage generation to and from the intermediate band should be matched however all practical realizations experienced a significant voltage degradation as compared to a single junction without intermediate band in this work we develop a novel analytical optimization method based on lagrange multipliers we demonstrate that an intermediate band solar cell under solar spectrum cannot meet voltage preservation and current matching at the same time by contrast we show that the implementation of an energy shift emphelectronic ratchet in any of the bands allows those two criteria to be filled simultaneously additional insights are provided by the numerical study of the short circuit current and fill factor of the systems at stake which show that a system with ratchet benefits from the same current increase as a standard intermediate band solar cell same shortcircuit current while maintaining iv properties of a single junction same openvoltage circuit same fill factor | [['intermediate', 'band', 'solar', 'cell', 'is', 'an', 'advanced', 'concept', 'for', 'solar', 'energy', 'conversion', 'in', 'which', 'two', 'lowenergy', 'photons', 'can', 'promote', 'an', 'electron', 'to', 'the', 'conduction', 'band', 'through', 'a', 'socalled', 'intermediate', 'band', 'to', 'limit', 'recombination', 'and', 'preserve', 'the', 'photogenerated', 'voltage', 'generation', 'to', 'and', 'from', 'the', 'intermediate', 'band', 'should', 'be', 'matched', 'however', 'all', 'practical', 'realizations', 'experienced', 'a', 'significant', 'voltage', 'degradation', 'as', 'compared', 'to', 'a', 'single', 'junction', 'without', 'intermediate', 'band', 'in', 'this', 'work', 'we', 'develop', 'a', 'novel', 'analytical', 'optimization', 'method', 'based', 'on', 'lagrange', 'multipliers', 'we', 'demonstrate', 'that', 'an', 'intermediate', 'band', 'solar', 'cell', 'under', 'solar', 'spectrum', 'can', 'not', 'meet', 'voltage', 'preservation', 'and', 'current', 'matching', 'at', 'the', 'same', 'time', 'by', 'contrast', 'we', 'show', 'that', 'the', 'implementation', 'of', 'an', 'energy', 'shift', 'emphelectronic', 'ratchet', 'in', 'any', 'of', 'the', 'bands', 'allows', 'those', 'two', 'criteria', 'to', 'be', 'filled', 'simultaneously', 'additional', 'insights', 'are', 'provided', 'by', 'the', 'numerical', 'study', 'of', 'the', 'short', 'circuit', 'current', 'and', 'fill', 'factor', 'of', 'the', 'systems', 'at', 'stake', 'which', 'show', 'that', 'a', 'system', 'with', 'ratchet', 'benefits', 'from', 'the', 'same', 'current', 'increase', 'as', 'a', 'standard', 'intermediate', 'band', 'solar', 'cell', 'same', 'shortcircuit', 'current', 'while', 'maintaining', 'iv', 'properties', 'of', 'a', 'single', 'junction', 'same', 'openvoltage', 'circuit', 'same', 'fill', 'factor']] | [-0.12174987150104465, 0.1111992029180574, -0.00111977337431666, 0.0389251325600403, -0.03396423567539534, -0.1434645030417832, 0.10749143758738364, 0.39951118202628316, -0.28179869596670204, -0.35029547588043924, 0.05708312321567555, -0.23473478893606256, -0.10559662861397137, 0.21150107377687016, -0.05984702147291721, -0.004990879559537044, 0.05887676598755894, -0.03461445940999044, -0.08698153120113185, -0.16587556055306482, 0.2451573061681277, 0.08823073559717552, 0.3169045294207093, 0.06392145867025278, 0.08171532288999171, -0.030011475588371223, 0.04749280271195882, 0.01662314866442938, -0.07478724767810294, 0.08001706193931199, 0.24607009705458138, 0.024614648289374402, 0.2626677545542653, -0.4738308038763903, -0.21299711094313376, 0.042041071131825446, 0.17300914456765798, 0.11688685362051066, -0.06513928809907993, -0.21440044523695032, 0.09223801405546633, -0.16774227263254893, -0.085270246057897, -0.007514415443497333, -0.048258114351916154, 0.02563562578855183, -0.2633997671331304, 0.02664775654698747, 0.0384433454783583, 0.030870338682890745, -0.08098475347883445, -0.10572196167541316, -0.059697926973269595, 0.13561171154362603, 0.006701032929374157, 0.008453027938014349, 0.17072646881900477, -0.10398038008401321, -0.12942049006956655, 0.36180258828240475, -0.07368275349003238, -0.1270616702080981, 0.17344635607599204, -0.1608490365255322, -0.07516353412506145, 0.16297088266174134, 0.12253791413496475, 0.04312286138710742, -0.17568556409945862, 0.057859120010775894, 0.003911933484109673, 0.17448845883277622, 0.08452550357308339, 0.07305325145103239, 0.249934256098208, 0.1948761991200012, 0.10244488545970337, 0.10367975195998018, -0.10308340188443056, -0.029250308142572238, -0.2829160004954886, -0.17247639304480036, -0.18535907932091505, 0.04114885789199065, -0.05683805877059648, -0.1617145573695165, 0.4605340221191983, 0.13924104471414073, 0.1831946109698431, 0.02699483141202379, 0.32145143866136267, 0.1679871476217601, 0.0908272342974866, 0.08092251186686995, 0.25593302580905525, 0.05846121532817346, 0.1298509847335014, -0.263571932629959, 0.028812348497150517, 0.007017933209804264] |
1,802.05239 | Efficient Exact Paths For Dyck and semi-Dyck Labeled Path Reachability | The exact path length problem is to determine if there is a path of a given
fixed cost between two vertices. This paper focuses on the exact path problem
for costs $-1,0$ or $+1$ between all pairs of vertices in an edge-weighted
digraph. The edge weights are from $\{ -1, +1 \}$. In this case, this paper
gives an $\widetilde{O}(n^{\omega})$ exact path solution. Here $\omega$ is the
best exponent for matrix multiplication and $\widetilde{O}$ is the asymptotic
upper-bound mod polylog factors.
Variations of this algorithm determine which pairs of digraph nodes have Dyck
or semi-Dyck labeled paths between them, assuming two parenthesis. Therefore,
determining digraph reachability for Dyck or semi-Dyck labeled paths costs
$\widetilde{O}(n^{\omega})$. A path label is made by concatenating all symbols
along the path's edges.
The exact path length problem has many applications. These applications
include the labeled path problems given here, which in turn, also have numerous
applications.
| cs.DS | the exact path length problem is to determine if there is a path of a given fixed cost between two vertices this paper focuses on the exact path problem for costs 10 or 1 between all pairs of vertices in an edgeweighted digraph the edge weights are from 1 1 in this case this paper gives an widetildeonomega exact path solution here omega is the best exponent for matrix multiplication and widetildeo is the asymptotic upperbound mod polylog factors variations of this algorithm determine which pairs of digraph nodes have dyck or semidyck labeled paths between them assuming two parenthesis therefore determining digraph reachability for dyck or semidyck labeled paths costs widetildeonomega a path label is made by concatenating all symbols along the paths edges the exact path length problem has many applications these applications include the labeled path problems given here which in turn also have numerous applications | [['the', 'exact', 'path', 'length', 'problem', 'is', 'to', 'determine', 'if', 'there', 'is', 'a', 'path', 'of', 'a', 'given', 'fixed', 'cost', 'between', 'two', 'vertices', 'this', 'paper', 'focuses', 'on', 'the', 'exact', 'path', 'problem', 'for', 'costs', '10', 'or', '1', 'between', 'all', 'pairs', 'of', 'vertices', 'in', 'an', 'edgeweighted', 'digraph', 'the', 'edge', 'weights', 'are', 'from', '1', '1', 'in', 'this', 'case', 'this', 'paper', 'gives', 'an', 'widetildeonomega', 'exact', 'path', 'solution', 'here', 'omega', 'is', 'the', 'best', 'exponent', 'for', 'matrix', 'multiplication', 'and', 'widetildeo', 'is', 'the', 'asymptotic', 'upperbound', 'mod', 'polylog', 'factors', 'variations', 'of', 'this', 'algorithm', 'determine', 'which', 'pairs', 'of', 'digraph', 'nodes', 'have', 'dyck', 'or', 'semidyck', 'labeled', 'paths', 'between', 'them', 'assuming', 'two', 'parenthesis', 'therefore', 'determining', 'digraph', 'reachability', 'for', 'dyck', 'or', 'semidyck', 'labeled', 'paths', 'costs', 'widetildeonomega', 'a', 'path', 'label', 'is', 'made', 'by', 'concatenating', 'all', 'symbols', 'along', 'the', 'paths', 'edges', 'the', 'exact', 'path', 'length', 'problem', 'has', 'many', 'applications', 'these', 'applications', 'include', 'the', 'labeled', 'path', 'problems', 'given', 'here', 'which', 'in', 'turn', 'also', 'have', 'numerous', 'applications']] | [-0.189790705006671, 0.14008856822002433, -0.0026679872503491487, 0.03404341656857227, -0.1147482243883677, -0.15649870305708577, 0.10821221717221498, 0.4336281215715013, -0.3265790676533365, -0.3024548499648567, 0.05542112422907459, -0.33131095604188215, -0.17057790624795063, 0.14813690913641558, -0.10345009127853527, 0.05116629640438727, 0.15579670291889652, 0.09606265366070692, -0.002853997471840533, -0.2575185163466095, 0.2978815040916904, -0.02927646530177571, 0.19470274174699978, 0.056453274071951505, 0.10857855401545934, 0.046575351979355424, -0.01307983055463707, 0.02503482463966016, -0.16968572698691922, 0.12138192683100371, 0.28318455779836293, 0.15381406811161005, 0.2748635625149928, -0.40393145596545166, -0.15900580903679942, 0.19588851266014737, 0.15768428518893007, 0.0770325323291199, 0.03405399561533388, -0.19644409811067187, 0.12835095092958335, -0.11625533762584332, -0.06038220850814159, 0.06636741469443148, 0.11853502538739419, 0.015425624343294168, -0.2801688100103618, -0.023778618543233, 0.04764405284457061, 0.05062629398414675, 0.00671144317974951, -0.15034446926774825, 0.049997973265316416, 0.1551160533440483, 0.015011883282172336, 0.07406044008565091, 0.019286896938420072, -0.1126991401040027, -0.20965597086719104, 0.3472828739100978, 0.08857523648663848, -0.22040311983140298, 0.11609082132400501, -0.04765456739090839, -0.13221422762160195, 0.1547272962955188, 0.09978755378500134, 0.15044933271144523, -0.15791092338800736, 0.11115897517155564, -0.08195962324155634, 0.13696045200435483, 0.1463930188222047, 0.04233242741146055, 0.12791868929685288, 0.11611830484958327, 0.15879139458391575, 0.15679642394958002, -0.00930858651499999, -0.05277384315192902, -0.2856842970133436, -0.15721085925782924, -0.22209770265542172, 0.03733526220779587, -0.15499084962040524, -0.1919086887596213, 0.3612749834297871, 0.1378583339023955, 0.23813710983313593, 0.14407224197346133, 0.2634117972473202, 0.11493699790808518, 0.016143806509952358, 0.14975140309341403, 0.09979422928822436, 0.09483632258595709, -0.008371084541253442, -0.18006445446723224, 0.08480976502011929, 0.14546804348019515] |
1,802.0524 | Adjoint Method to Calculate Shape Gradients of Failure Probabilaties for
Turbomachinery Components | In the optimization of turbomachinery components, shape sensitivities for
fluid dynamical objective functions have been used for a long time. As peak
stress is not a differential func- tional of the shape, such highly efficient
procedures so far have been missing for objective functionals that stem from
mechan- ical integrity. This changes, if deterministic lifing criteria are
replaced by probabilistic criteria, which have been introduced recently to the
field of low cycle fatigue (LCF). Here we present a finite element (FEA) based
first discretize, then adjoin approach to the calculation of shape gradients
(sen- sitivities) for the failure probability with regard to probabilistic LCF
and apply it to simple and complex geometries, as e.g. a blisk geometry. We
review the computation of failure probabilities with a FEA postprocessor and
sketch the computation of the relevant quantities for the adjoint method. We
demonstrate high accuracy and computational efficiency of the adjoint method
compared to finite difference schemes. We discuss implementation details for
rotating components with cyclic boundary conditions. Finally, we shortly
comment on future development steps and on poten- tial applications in multi
criteria optimization.
| math.NA | in the optimization of turbomachinery components shape sensitivities for fluid dynamical objective functions have been used for a long time as peak stress is not a differential func tional of the shape such highly efficient procedures so far have been missing for objective functionals that stem from mechan ical integrity this changes if deterministic lifing criteria are replaced by probabilistic criteria which have been introduced recently to the field of low cycle fatigue lcf here we present a finite element fea based first discretize then adjoin approach to the calculation of shape gradients sen sitivities for the failure probability with regard to probabilistic lcf and apply it to simple and complex geometries as eg a blisk geometry we review the computation of failure probabilities with a fea postprocessor and sketch the computation of the relevant quantities for the adjoint method we demonstrate high accuracy and computational efficiency of the adjoint method compared to finite difference schemes we discuss implementation details for rotating components with cyclic boundary conditions finally we shortly comment on future development steps and on poten tial applications in multi criteria optimization | [['in', 'the', 'optimization', 'of', 'turbomachinery', 'components', 'shape', 'sensitivities', 'for', 'fluid', 'dynamical', 'objective', 'functions', 'have', 'been', 'used', 'for', 'a', 'long', 'time', 'as', 'peak', 'stress', 'is', 'not', 'a', 'differential', 'func', 'tional', 'of', 'the', 'shape', 'such', 'highly', 'efficient', 'procedures', 'so', 'far', 'have', 'been', 'missing', 'for', 'objective', 'functionals', 'that', 'stem', 'from', 'mechan', 'ical', 'integrity', 'this', 'changes', 'if', 'deterministic', 'lifing', 'criteria', 'are', 'replaced', 'by', 'probabilistic', 'criteria', 'which', 'have', 'been', 'introduced', 'recently', 'to', 'the', 'field', 'of', 'low', 'cycle', 'fatigue', 'lcf', 'here', 'we', 'present', 'a', 'finite', 'element', 'fea', 'based', 'first', 'discretize', 'then', 'adjoin', 'approach', 'to', 'the', 'calculation', 'of', 'shape', 'gradients', 'sen', 'sitivities', 'for', 'the', 'failure', 'probability', 'with', 'regard', 'to', 'probabilistic', 'lcf', 'and', 'apply', 'it', 'to', 'simple', 'and', 'complex', 'geometries', 'as', 'eg', 'a', 'blisk', 'geometry', 'we', 'review', 'the', 'computation', 'of', 'failure', 'probabilities', 'with', 'a', 'fea', 'postprocessor', 'and', 'sketch', 'the', 'computation', 'of', 'the', 'relevant', 'quantities', 'for', 'the', 'adjoint', 'method', 'we', 'demonstrate', 'high', 'accuracy', 'and', 'computational', 'efficiency', 'of', 'the', 'adjoint', 'method', 'compared', 'to', 'finite', 'difference', 'schemes', 'we', 'discuss', 'implementation', 'details', 'for', 'rotating', 'components', 'with', 'cyclic', 'boundary', 'conditions', 'finally', 'we', 'shortly', 'comment', 'on', 'future', 'development', 'steps', 'and', 'on', 'poten', 'tial', 'applications', 'in', 'multi', 'criteria', 'optimization']] | [-0.05745646464046688, 0.04681579764702136, -0.10342995198675076, 0.0590303774861341, -0.08147750673358951, -0.1257926426916023, 0.01965271661608629, 0.41629969114592064, -0.2421011606653257, -0.27998234410847417, 0.15242566548684067, -0.20550284889212794, -0.16321917779252282, 0.1960011030140832, -0.09928870884520233, 0.12504838342979058, 0.049134350994097596, 0.0072595020653216874, -0.10042956031123125, -0.23002241287143768, 0.2679998085252652, 0.04637186056599844, 0.2924525287974811, 0.05778689394468308, 0.12376411768571777, -0.005933282662759334, -0.03568767138257705, 0.050226817492817565, -0.1361733148870517, 0.09974001757566622, 0.25369102503713326, 0.1406602201718343, 0.28830773572730756, -0.45365120976834006, -0.21541847629814784, 0.0804746747907709, 0.10688986957421492, 0.10649224092028726, -0.04517661892932464, -0.23348515200845443, 0.11553010315144208, -0.17935429773813125, -0.11823238898518891, -0.10855421927134964, 0.03338778753011122, 0.055356787391417896, -0.2580805603152357, 0.04071838675820634, 0.022150387068231494, 0.07821519029177519, -0.05353797160639577, -0.14350444998190795, 0.006237358778447571, 0.09636561223305762, 0.02581475363936255, -0.006521601404850654, 0.13862978228887554, -0.09532669630513954, -0.1277300305137133, 0.3517832080293344, -0.030828665424516496, -0.2468145661910183, 0.17510806554053698, -0.06774420543054109, -0.15650521489168975, 0.1182966400272321, 0.1889209021538887, 0.13159307553587243, -0.1357769927084549, 0.05847595033775475, 0.0524381392883672, 0.13673678873549344, 0.05775158756569501, 0.006434394411989668, 0.1615702385334967, 0.18017189626617985, 0.053851822840653804, 0.11704493681154116, -0.07021283519001503, -0.07785345809997281, -0.312491903372253, -0.17233882495748826, -0.1425721851352458, -0.0013296881037634328, -0.06307925083968745, -0.1977461298431774, 0.3897910787266015, 0.1579998377196038, 0.165823459455445, 0.052291476621179334, 0.314676079071945, 0.12086886762080519, 0.04878914919730488, 0.04240590566769242, 0.2147091458794707, 0.14234096110407365, 0.10538318704039332, -0.2147860119765038, 0.09301149795212633, 0.10678179902204657] |
1,802.05241 | Full Band All-sky Search for Periodic Gravitational Waves in the O1 LIGO
Data | We report on a new all-sky search for periodic gravitational waves in the
frequency band 475-2000 Hz and with a frequency time derivative in the range of
[-1.0e-8, +1e-9] Hz/s. Potential signals could be produced by a nearby spinning
and slightly non-axisymmetric isolated neutron star in our galaxy.
This search uses the data from Advanced LIGO's first observational run O1. No
gravitational wave signals were observed, and upper limits were placed on their
strengths. For completeness, results from the separately published low
frequency search 20-475 Hz are included as well.
Our lowest upper limit on worst-case (linearly polarized) strain amplitude
h_0 is 4e-25 near 170 Hz, while at the high end of our frequency range we
achieve a worst-case upper limit of 1.3e-24. For a circularly polarized source
(most favorable orientation), the smallest upper limit obtained is ~1.5e-25.
| gr-qc | we report on a new allsky search for periodic gravitational waves in the frequency band 4752000 hz and with a frequency time derivative in the range of 10e8 1e9 hzs potential signals could be produced by a nearby spinning and slightly nonaxisymmetric isolated neutron star in our galaxy this search uses the data from advanced ligos first observational run o1 no gravitational wave signals were observed and upper limits were placed on their strengths for completeness results from the separately published low frequency search 20475 hz are included as well our lowest upper limit on worstcase linearly polarized strain amplitude h_0 is 4e25 near 170 hz while at the high end of our frequency range we achieve a worstcase upper limit of 13e24 for a circularly polarized source most favorable orientation the smallest upper limit obtained is 15e25 | [['we', 'report', 'on', 'a', 'new', 'allsky', 'search', 'for', 'periodic', 'gravitational', 'waves', 'in', 'the', 'frequency', 'band', '4752000', 'hz', 'and', 'with', 'a', 'frequency', 'time', 'derivative', 'in', 'the', 'range', 'of', '10e8', '1e9', 'hzs', 'potential', 'signals', 'could', 'be', 'produced', 'by', 'a', 'nearby', 'spinning', 'and', 'slightly', 'nonaxisymmetric', 'isolated', 'neutron', 'star', 'in', 'our', 'galaxy', 'this', 'search', 'uses', 'the', 'data', 'from', 'advanced', 'ligos', 'first', 'observational', 'run', 'o1', 'no', 'gravitational', 'wave', 'signals', 'were', 'observed', 'and', 'upper', 'limits', 'were', 'placed', 'on', 'their', 'strengths', 'for', 'completeness', 'results', 'from', 'the', 'separately', 'published', 'low', 'frequency', 'search', '20475', 'hz', 'are', 'included', 'as', 'well', 'our', 'lowest', 'upper', 'limit', 'on', 'worstcase', 'linearly', 'polarized', 'strain', 'amplitude', 'h_0', 'is', '4e25', 'near', '170', 'hz', 'while', 'at', 'the', 'high', 'end', 'of', 'our', 'frequency', 'range', 'we', 'achieve', 'a', 'worstcase', 'upper', 'limit', 'of', '13e24', 'for', 'a', 'circularly', 'polarized', 'source', 'most', 'favorable', 'orientation', 'the', 'smallest', 'upper', 'limit', 'obtained', 'is', '15e25']] | [-0.15716244512134128, 0.1476015460608458, -0.007525273423676413, 0.061147432888995996, -0.11050324171471099, -0.05252815397042367, 0.11903175537957361, 0.37983871157522553, -0.1690608467190975, -0.348050688141612, 0.13354301856985937, -0.29359551755090557, -0.020837462293329063, 0.29339087327631813, 0.05429346345158087, 0.02771342648624408, 0.057618597607749206, 0.0342515402370029, -0.03921465168327645, -0.19696593383689306, 0.21271017455599375, 0.10136563090814485, 0.22464960602810607, -0.008685352611872884, 0.03777906502062386, -0.04210437128958465, -0.03518845214749928, -0.09368023108690977, -0.1518870890347494, 0.0327191427970926, 0.26415944426423976, 0.08494029246374137, 0.18400322355812898, -0.37831762722106993, -0.1828499641234952, 0.08968891397601476, 0.11595665907866701, 0.09909367112063423, -0.052634338261042204, -0.31484146209226715, 0.08090798920365395, -0.15444939605960692, -0.13011676115501258, 0.030751164809421257, 0.05843448140830906, 0.03414706363885974, -0.25397553537730816, 0.1198835584162562, 0.025485262833104504, 0.03677070289764001, -0.11936938028127231, -0.14655717008367733, -0.03541043453194477, 0.04320222480153596, 0.02801052455065979, 0.11014349429902655, 0.1483306367467675, -0.08229418394017826, -0.09159463867890062, 0.343580736964941, -0.17160768720010916, -0.09089348358619544, 0.1975592174325828, -0.23526435337822746, -0.12665559735356105, 0.18201076868921248, 0.2100326093569122, 0.13343099097686786, -0.12385528013110161, 0.07873532718319136, 0.045540316275394246, 0.23258328059757197, 0.16590104262103086, 0.06085197949551339, 0.29405630038645875, 0.17555100618413202, 0.08740647866356152, 0.10910939696262142, -0.21189976561366133, 0.023169371582291744, -0.28271273186482077, -0.02927054026761282, -0.1779076223089187, 0.04532432765128626, -0.11231846106723727, -0.08117293973487837, 0.3659068970561579, 0.13654459588643578, 0.1569379992645096, 0.09583434603797893, 0.30513811324619583, 0.14744298964117963, 0.03066910476492787, 0.08854532505351084, 0.3662356784377523, 0.10800169131856549, 0.08833256385082172, -0.17621413569000585, 0.02414174782526162, -0.029579821232430362] |
1,802.05242 | Interference Cancellation and Iterative Detection for Orthogonal Time
Frequency Space Modulation | The recently proposed orthogonal time frequency space (OTFS) modulation
technique was shown to provide significant error performance advantages over
orthogonal frequency division multiplexing (OFDM) in Doppler channels. In this
paper, we derive the explicit input-output relation describing OTFS modulation
and demodulation (mod/demod) for delay-Doppler channels. We analyze the
interferences and develop a novel low-complexity yet efficient message passing
(MP) algorithm for joint interference cancellation (IC) and symbol detection.
The proposed MP algorithm can effectively compensate for a wide range of
channel Doppler spreads.
| cs.IT math.IT | the recently proposed orthogonal time frequency space otfs modulation technique was shown to provide significant error performance advantages over orthogonal frequency division multiplexing ofdm in doppler channels in this paper we derive the explicit inputoutput relation describing otfs modulation and demodulation moddemod for delaydoppler channels we analyze the interferences and develop a novel lowcomplexity yet efficient message passing mp algorithm for joint interference cancellation ic and symbol detection the proposed mp algorithm can effectively compensate for a wide range of channel doppler spreads | [['the', 'recently', 'proposed', 'orthogonal', 'time', 'frequency', 'space', 'otfs', 'modulation', 'technique', 'was', 'shown', 'to', 'provide', 'significant', 'error', 'performance', 'advantages', 'over', 'orthogonal', 'frequency', 'division', 'multiplexing', 'ofdm', 'in', 'doppler', 'channels', 'in', 'this', 'paper', 'we', 'derive', 'the', 'explicit', 'inputoutput', 'relation', 'describing', 'otfs', 'modulation', 'and', 'demodulation', 'moddemod', 'for', 'delaydoppler', 'channels', 'we', 'analyze', 'the', 'interferences', 'and', 'develop', 'a', 'novel', 'lowcomplexity', 'yet', 'efficient', 'message', 'passing', 'mp', 'algorithm', 'for', 'joint', 'interference', 'cancellation', 'ic', 'and', 'symbol', 'detection', 'the', 'proposed', 'mp', 'algorithm', 'can', 'effectively', 'compensate', 'for', 'a', 'wide', 'range', 'of', 'channel', 'doppler', 'spreads']] | [-0.28152796461831825, 0.03565626945587943, -0.07813813819595408, 0.04134191728691093, -0.11732811924274557, -0.24647655070009755, 0.10705991907232645, 0.46472174485736506, -0.2758273706663536, -0.22993968081910435, 0.05192319879296985, -0.11255621815827198, -0.23743886511954593, 0.18007347926145373, -0.12767570125643254, 0.08915550610414003, 0.0614366640575321, -0.014875320146618434, -0.10403575874274461, -0.19261492936227403, 0.1929876233803154, 0.1185877449390274, 0.40436403169410257, -0.03702021776357802, 0.17233687002643397, 0.08453659227163327, -0.08288349866407083, -0.13859003810133932, -0.09163029633871303, 0.023971354123204947, 0.3542112082231608, 0.19061852822352837, 0.20955913833047196, -0.3043038194158637, -0.29180462568680327, 0.08818798332486483, 0.2762982588113717, 0.11306329491752677, -0.09640293985196366, -0.2984642060700713, 0.09944057994999173, -0.24276532508750878, 0.019369388657917336, -0.0116572986107047, -0.02075721151990498, -0.006286642729963471, -0.3661179821143245, 0.04590353702490286, 0.045931231517276565, 0.04528420678412303, -0.016031174840996178, -0.13786695094029533, 0.15114372045301447, 0.10483791564432222, -0.043396554151890664, -0.01713791790719303, 0.013906118675793817, 0.05216042416045306, -0.13510796353902396, 0.3199594958753484, -0.06587265777719639, -0.21937967724416677, 0.11302223543866492, -0.1037513489704352, -0.017807660226869148, 0.2231972313645046, 0.28211599797373865, 0.01435172956482303, -0.17634723385761877, 0.023283040299358574, 0.05057403305545449, 0.18482915402912511, 0.19011814340313032, 0.1594549218510709, 0.12907601992043144, 0.11531974618300432, 0.10545788664461636, 0.11613367732455272, -0.21054023735952088, -0.09165172440158885, -0.17800262327328686, -0.14869207327776565, -0.158516414213653, -0.0651188980384798, -0.0937705158375604, -0.08223990043845289, 0.42682704215346856, 0.158647359558949, 0.09467785235596593, 0.10572416428476572, 0.4629213140777698, 0.16401766221856745, 0.05907075371729528, 0.0958450891009373, 0.2039023467407721, 0.19501090114481928, 0.10625428039512792, -0.2627262806792448, 0.008651843868059719, 0.02866409766692214] |
1,802.05243 | Non-perturbative quark mass renormalisation and running in $N_f=3$ QCD | We determine from first principles the quark mass anomalous dimension in Nf=3
QCD between the electroweak and hadronic scales. This allows for a fully
non-perturbative connection of the perturbative and non-perturbative regimes of
the Standard Model in the hadronic sector. The computation is carried out to
high accuracy, employing massless O(a)-improved Wilson quarks and finite-size
scaling techniques. We also provide the matching factors required in the
renormalisation of light quark masses from lattice computations with
O(a)-improved Wilson fermions and a tree-level Symanzik improved gauge action.
The total uncertainty due to renormalisation and running in the determination
of light quark masses in the SM is thus reduced to about 1%.
| hep-lat hep-ph | we determine from first principles the quark mass anomalous dimension in nf3 qcd between the electroweak and hadronic scales this allows for a fully nonperturbative connection of the perturbative and nonperturbative regimes of the standard model in the hadronic sector the computation is carried out to high accuracy employing massless oaimproved wilson quarks and finitesize scaling techniques we also provide the matching factors required in the renormalisation of light quark masses from lattice computations with oaimproved wilson fermions and a treelevel symanzik improved gauge action the total uncertainty due to renormalisation and running in the determination of light quark masses in the sm is thus reduced to about 1 | [['we', 'determine', 'from', 'first', 'principles', 'the', 'quark', 'mass', 'anomalous', 'dimension', 'in', 'nf3', 'qcd', 'between', 'the', 'electroweak', 'and', 'hadronic', 'scales', 'this', 'allows', 'for', 'a', 'fully', 'nonperturbative', 'connection', 'of', 'the', 'perturbative', 'and', 'nonperturbative', 'regimes', 'of', 'the', 'standard', 'model', 'in', 'the', 'hadronic', 'sector', 'the', 'computation', 'is', 'carried', 'out', 'to', 'high', 'accuracy', 'employing', 'massless', 'oaimproved', 'wilson', 'quarks', 'and', 'finitesize', 'scaling', 'techniques', 'we', 'also', 'provide', 'the', 'matching', 'factors', 'required', 'in', 'the', 'renormalisation', 'of', 'light', 'quark', 'masses', 'from', 'lattice', 'computations', 'with', 'oaimproved', 'wilson', 'fermions', 'and', 'a', 'treelevel', 'symanzik', 'improved', 'gauge', 'action', 'the', 'total', 'uncertainty', 'due', 'to', 'renormalisation', 'and', 'running', 'in', 'the', 'determination', 'of', 'light', 'quark', 'masses', 'in', 'the', 'sm', 'is', 'thus', 'reduced', 'to', 'about', '1']] | [-0.08121488231379505, 0.2776949445870833, -0.13101260676774956, 0.10567065833431216, -0.04380137823658799, -0.09698761231693175, 0.13243981637060642, 0.3415368756774915, -0.1580419695226971, -0.28737020803564184, 0.024469372788615048, -0.27156418835578183, -0.021370392344003425, 0.09700403906567313, 0.030124218498170804, 0.14577562971160227, 0.05047597427032204, -0.01065010242265598, -0.15269557855502114, -0.24703938722900978, 0.31955055736107835, 0.021947725001004857, 0.21270893233905144, 0.1854079437865064, 0.07198970787090446, 0.006934052730543078, -0.10616684351287303, -0.0762874642472475, -0.07594807355754385, 0.08874909672886133, 0.14436946518734148, -0.021325067277365457, 0.09825640963817682, -0.36493615676230245, -0.15452499480687354, 0.054274952769655424, 0.16793657136747803, 0.1334892637779885, 0.025728629130887193, -0.27390488984336686, 0.07414530173644697, -0.20821020373467938, -0.17131528235788226, -0.13949227296328598, -0.07318769985331444, -0.14492201113885422, -0.3420932647011696, 0.06719539022054993, -0.121084702354984, 0.042119736005680274, 0.06118834681687193, -0.17697819569276288, -0.0325949212895074, 0.12961126546858204, 0.1521075421979906, 0.07174012379789162, 0.12191820809822701, -0.23974964860933534, -0.15306349479755677, 0.47985021769573244, -0.09095158313460854, -0.17830444950345528, 0.1457505702028273, -0.1781015011114538, -0.17470059015693618, 0.10249095872392207, 0.19203289898556716, 0.07988934675573346, -0.1949102328577583, 0.17437934369829253, -0.02290337227729209, 0.18401303953157927, 0.08198394763941338, 0.03281021717969978, 0.21999204631279642, 0.16926879664336186, -0.01784864261558433, 0.04097113624180949, -0.004634535187906628, -0.13348866568519435, -0.3799521959121894, -0.09002352887850015, -0.0914314677383443, 0.08015081181763373, -0.19910375385931287, -0.127349929354333, 0.40025914200675594, 0.19688485488039228, 0.16965669729755423, 0.05147240494181393, 0.3070261084363548, 0.1019719644543638, 0.11688887096360462, 0.10237527677122879, 0.28374097829603445, 0.20859278784637605, 0.11085658246189903, -0.35433318996866053, -0.12323037196600109, 0.194674613202042] |
1,802.05244 | Spin selective coupling to Majorana zero modes in mixed singlet and
triplet superconducting nanowire | We theoretically investigate the transport properties of a quasi one
dimensional ferromagnet-superconductor junction where the superconductor
consists of mixed singlet and triplet pairings. We show that
the relative orientation of the stoner field ($\bf{\tilde{h}}$) in the
ferromagnetic lead and the $\bf{d}$ vector of the superconductor acts like a
on-off switch for the zero bias conductance of the device.
In the regime, where triplet pairing amplitude dominates over the singlet
counterpart (topological phase), a pair of Majorana zero modes appear at each
end of the superconducting part of the nanowire. When $\bf{\tilde{h}}$ is
parallel or anti-parallel to the $\bf{d}$ vector, transport gets completely
blocked due to blockage in pairing while, when $\bf{\tilde{h}}$ and $\bf{d}$
are perpendicular to each other, the zero energy two terminal differential
conductance spectra exhibits sharp transition from $4e^2/h$ to $2e^2/h$ as the
magnetization strength in the lead becomes larger than the chemical potential
indicating the spin selective coupling of pair of Majorana zero modes to the
lead.
| cond-mat.mes-hall cond-mat.supr-con | we theoretically investigate the transport properties of a quasi one dimensional ferromagnetsuperconductor junction where the superconductor consists of mixed singlet and triplet pairings we show that the relative orientation of the stoner field bftildeh in the ferromagnetic lead and the bfd vector of the superconductor acts like a onoff switch for the zero bias conductance of the device in the regime where triplet pairing amplitude dominates over the singlet counterpart topological phase a pair of majorana zero modes appear at each end of the superconducting part of the nanowire when bftildeh is parallel or antiparallel to the bfd vector transport gets completely blocked due to blockage in pairing while when bftildeh and bfd are perpendicular to each other the zero energy two terminal differential conductance spectra exhibits sharp transition from 4e2h to 2e2h as the magnetization strength in the lead becomes larger than the chemical potential indicating the spin selective coupling of pair of majorana zero modes to the lead | [['we', 'theoretically', 'investigate', 'the', 'transport', 'properties', 'of', 'a', 'quasi', 'one', 'dimensional', 'ferromagnetsuperconductor', 'junction', 'where', 'the', 'superconductor', 'consists', 'of', 'mixed', 'singlet', 'and', 'triplet', 'pairings', 'we', 'show', 'that', 'the', 'relative', 'orientation', 'of', 'the', 'stoner', 'field', 'bftildeh', 'in', 'the', 'ferromagnetic', 'lead', 'and', 'the', 'bfd', 'vector', 'of', 'the', 'superconductor', 'acts', 'like', 'a', 'onoff', 'switch', 'for', 'the', 'zero', 'bias', 'conductance', 'of', 'the', 'device', 'in', 'the', 'regime', 'where', 'triplet', 'pairing', 'amplitude', 'dominates', 'over', 'the', 'singlet', 'counterpart', 'topological', 'phase', 'a', 'pair', 'of', 'majorana', 'zero', 'modes', 'appear', 'at', 'each', 'end', 'of', 'the', 'superconducting', 'part', 'of', 'the', 'nanowire', 'when', 'bftildeh', 'is', 'parallel', 'or', 'antiparallel', 'to', 'the', 'bfd', 'vector', 'transport', 'gets', 'completely', 'blocked', 'due', 'to', 'blockage', 'in', 'pairing', 'while', 'when', 'bftildeh', 'and', 'bfd', 'are', 'perpendicular', 'to', 'each', 'other', 'the', 'zero', 'energy', 'two', 'terminal', 'differential', 'conductance', 'spectra', 'exhibits', 'sharp', 'transition', 'from', '4e2h', 'to', '2e2h', 'as', 'the', 'magnetization', 'strength', 'in', 'the', 'lead', 'becomes', 'larger', 'than', 'the', 'chemical', 'potential', 'indicating', 'the', 'spin', 'selective', 'coupling', 'of', 'pair', 'of', 'majorana', 'zero', 'modes', 'to', 'the', 'lead']] | [-0.24478395722835558, 0.22052859932591673, -0.026706661406205968, 0.02524053216984612, -0.05278961178555619, -0.22401937855174764, 0.061636104018543844, 0.3356144859455526, -0.26893219890771436, -0.23217575239541474, -0.026112740395183208, -0.29648593401070683, -0.08031068554701051, 0.14939267177687726, 0.050166882760822776, -0.04714957237592898, -0.027136729456469767, 0.07110815566265956, -0.09129128958593355, -0.20910700103195268, 0.3316210664706887, -0.038762960972962904, 0.34784161757852416, 0.05228185786691029, 0.025998520085704514, 0.01891078041953733, 0.11690324064984452, 0.0008196679409593344, -0.10075887255247835, 0.009612370794638992, 0.2184520157854422, -0.10434103814768605, 0.19338403103320162, -0.42786730104708115, -0.14047618335462175, 0.08568473482591799, 0.15007203692221083, 0.13565983501976006, 0.001504049068898894, -0.2631833563587861, 0.09472829786861894, -0.14684492220112588, -0.10870985563815339, -0.008576832463222672, -0.034187196144921474, -0.019060213439297514, -0.2723542070831172, 0.10825990810408256, 0.061810606705194004, 0.047230293553002414, -0.030159711063606664, -0.14049966748389126, -0.11752698216296267, 0.059191352918060144, 0.06472822663145053, 0.044271058613230704, 0.13524082577205263, -0.16092200221087297, -0.10337181990034879, 0.30854002637715894, -0.10603076587913166, -0.1306268282380188, 0.16027530349092559, -0.15404897615517257, -0.006049303873442114, 0.1596815378725296, 0.09295983460033312, 0.0759571470800438, -0.08046076160189841, 0.07354664713966486, 0.021513279388091177, 0.1175827972649131, 0.04605780587444315, 0.09672203670925228, 0.2700442724628374, 0.16062293299182784, 0.12220885200367775, 0.1539154734058684, -0.175941488443641, -0.08784546652168501, -0.27082596071995796, -0.2034173990949057, -0.1812375088571571, 0.06590977650339483, -0.025761902372778422, -0.20527869482466485, 0.44020368901547047, 0.14980369656223047, 0.24084934012498707, -0.030988695175619797, 0.28063085077155847, 0.15554127984723892, 0.08812894263246562, 0.03724566456512548, 0.24057174375047907, 0.20177497945260256, 0.09188879482462653, -0.3237186733640556, 0.05871269570998265, -0.007486998490639963] |
1,802.05245 | Long-range potential scattering: Converting long-range potential to
short-range potential by tortoise coordinate | Inspired by general relativity, we suggest an approach for long-range
potential scattering. In scattering theory, there is a general theory for
short-range potential scattering, but there is no general theory for long-range
potential scattering. This is because the scattering boundary conditions for
all short-range potentials are the same, but for different long-range
potentials are different. In this paper, by introducing tortoise coordinates,
we convert long-range potential scattering to short-range potential scattering.
This allows us to deal with long-range potential scattering as short-range
potential scattering. An explicit expression of the scattering wave function
for long-range potential scattering is presented, in which the scattering wave
function is represented by the tortoise coordinate and the scattering phase
shift. We show that the long-range potential scattering wave function is just
the short-range potential scattering wave function with a replacement of a
common coordinate by a tortoise coordinate. The approach applies not only to
scattering but also applies to bound states. Furthermore, in terms of tortoise
coordinates, we suggest a classification scheme for potentials. We also discuss
the duality between tortoise coordinates.
| math-ph math.MP | inspired by general relativity we suggest an approach for longrange potential scattering in scattering theory there is a general theory for shortrange potential scattering but there is no general theory for longrange potential scattering this is because the scattering boundary conditions for all shortrange potentials are the same but for different longrange potentials are different in this paper by introducing tortoise coordinates we convert longrange potential scattering to shortrange potential scattering this allows us to deal with longrange potential scattering as shortrange potential scattering an explicit expression of the scattering wave function for longrange potential scattering is presented in which the scattering wave function is represented by the tortoise coordinate and the scattering phase shift we show that the longrange potential scattering wave function is just the shortrange potential scattering wave function with a replacement of a common coordinate by a tortoise coordinate the approach applies not only to scattering but also applies to bound states furthermore in terms of tortoise coordinates we suggest a classification scheme for potentials we also discuss the duality between tortoise coordinates | [['inspired', 'by', 'general', 'relativity', 'we', 'suggest', 'an', 'approach', 'for', 'longrange', 'potential', 'scattering', 'in', 'scattering', 'theory', 'there', 'is', 'a', 'general', 'theory', 'for', 'shortrange', 'potential', 'scattering', 'but', 'there', 'is', 'no', 'general', 'theory', 'for', 'longrange', 'potential', 'scattering', 'this', 'is', 'because', 'the', 'scattering', 'boundary', 'conditions', 'for', 'all', 'shortrange', 'potentials', 'are', 'the', 'same', 'but', 'for', 'different', 'longrange', 'potentials', 'are', 'different', 'in', 'this', 'paper', 'by', 'introducing', 'tortoise', 'coordinates', 'we', 'convert', 'longrange', 'potential', 'scattering', 'to', 'shortrange', 'potential', 'scattering', 'this', 'allows', 'us', 'to', 'deal', 'with', 'longrange', 'potential', 'scattering', 'as', 'shortrange', 'potential', 'scattering', 'an', 'explicit', 'expression', 'of', 'the', 'scattering', 'wave', 'function', 'for', 'longrange', 'potential', 'scattering', 'is', 'presented', 'in', 'which', 'the', 'scattering', 'wave', 'function', 'is', 'represented', 'by', 'the', 'tortoise', 'coordinate', 'and', 'the', 'scattering', 'phase', 'shift', 'we', 'show', 'that', 'the', 'longrange', 'potential', 'scattering', 'wave', 'function', 'is', 'just', 'the', 'shortrange', 'potential', 'scattering', 'wave', 'function', 'with', 'a', 'replacement', 'of', 'a', 'common', 'coordinate', 'by', 'a', 'tortoise', 'coordinate', 'the', 'approach', 'applies', 'not', 'only', 'to', 'scattering', 'but', 'also', 'applies', 'to', 'bound', 'states', 'furthermore', 'in', 'terms', 'of', 'tortoise', 'coordinates', 'we', 'suggest', 'a', 'classification', 'scheme', 'for', 'potentials', 'we', 'also', 'discuss', 'the', 'duality', 'between', 'tortoise', 'coordinates']] | [-0.16161323761656923, 0.14423257215254373, -0.10862755743881404, 0.11331148700404513, -0.05501994627559463, -0.14945827506345796, -0.015862981324468207, 0.38515173122655116, -0.2900335663287653, -0.20253175158727135, -0.01847163366685269, -0.32150759386817207, -0.23373712065740157, 0.12345623168147217, 0.04453911176372299, 0.045587922125465453, -0.014380376332171135, 0.028493248078824772, -0.09088058182430364, -0.20016140817259412, 0.3798535165487457, 0.03266749645341293, 0.22436592666863722, 0.16545892151672456, 0.05215335088008541, 0.1755666488118596, 0.03588136897085624, -0.007588635114584602, -0.05788132732644142, 0.08460330266977718, 0.22286939257913727, 0.04300569773435929, 0.16569078775743643, -0.44952463924800606, -0.27178692834739215, 0.08587487640206591, 0.17446899079878178, 0.19331692659761757, -0.10066267191353491, -0.29068645800721676, -0.039556914225541646, -0.1708243774555329, -0.2067413868061609, -0.12597303953295375, 0.08524289087913299, 0.04348364340057228, -0.31432849393715545, 0.10459510965692406, 0.03026391668666133, 0.014534465894944924, -0.13020630692438312, -0.06695689974184342, 0.058769874411535125, 0.05784219822788474, 0.044782985748965186, 0.08177186683672717, 0.06250627784026881, -0.11132522975357702, -0.07395950285717845, 0.3768709237492606, -0.03179802067872495, -0.2304389488404501, 0.18616460004326818, -0.1370713668138757, -0.06716666543740506, 0.15458310566879388, 0.1517715460290648, 0.09675365759028216, -0.2262317998924077, 0.10934230948812829, 0.027369292367099767, 0.14801304989447028, 0.11775537118273603, 0.018234646091524427, 0.16513598735554744, 0.13120330907509656, 0.06468256653548286, 0.09380374029791771, -0.09075124322502193, -0.11344791500629216, -0.34991749462350613, -0.115039260030953, -0.21278938745598355, 0.0038311900436979493, -0.08361095779877627, -0.17259968110323373, 0.3296306780086247, 0.15805051271608994, 0.17201616249631269, 0.04959555936906234, 0.2611628854699896, 0.17746585697701234, 0.10447476306761809, 0.020345983640054018, 0.27563462648567044, 0.13335077670313375, 0.07886894010691403, -0.2295061341108028, 0.011480237465183445, 0.04749100285945302] |
1,802.05246 | Hermite Methods for the Scalar Wave Equation | Arbitrary order dissipative and conservative Hermite methods for the scalar
wave equation achieving $\mathcal{O}(2m)$ orders of accuracy using
$\mathcal{O}(m^d)$ degrees of freedom per node in $d$ dimensions are presented.
Stability and error analyses as well as implementation strategies for
accelerators are also given.
| math.NA | arbitrary order dissipative and conservative hermite methods for the scalar wave equation achieving mathcalo2m orders of accuracy using mathcalomd degrees of freedom per node in d dimensions are presented stability and error analyses as well as implementation strategies for accelerators are also given | [['arbitrary', 'order', 'dissipative', 'and', 'conservative', 'hermite', 'methods', 'for', 'the', 'scalar', 'wave', 'equation', 'achieving', 'mathcalo2m', 'orders', 'of', 'accuracy', 'using', 'mathcalomd', 'degrees', 'of', 'freedom', 'per', 'node', 'in', 'd', 'dimensions', 'are', 'presented', 'stability', 'and', 'error', 'analyses', 'as', 'well', 'as', 'implementation', 'strategies', 'for', 'accelerators', 'are', 'also', 'given']] | [-0.17154335371423057, 0.0882017659250556, 0.03261641560622105, 0.052962852289854756, -0.021999805620530756, -0.16941961698324942, 0.011935530917537285, 0.35022438894503, -0.18848606753276614, -0.34195366029332325, 0.11915293468514503, -0.27995835444549233, -0.08358020434246921, 0.20262012803336468, 0.02367818260156527, 0.14539315115387846, 0.05827163484674401, 0.0515516049160463, -0.08291149602794065, -0.32722388107965633, 0.2457524371765009, 0.0878347482804845, 0.20329598557749173, 0.01998367914702834, 0.15424298036207512, 0.0014632703259405567, -0.007270970677093762, 0.002080239775795035, -0.12251865403391649, 0.09809784373132194, 0.26210783631540835, 0.08050623790519994, 0.2543199504839211, -0.36196834164836283, -0.24604456585536644, 0.039267511129742715, 0.17448271885968564, 0.1399855641988901, 0.014210680567818443, -0.26462087037450654, 0.061452401818980165, -0.17825771627447953, -0.2116442991466057, -0.1841470796342303, 0.013858517336590988, 0.11715033416431851, -0.31861647813603644, 0.17203204764731841, 0.04122122377441151, 0.09160802758684973, -0.009590315905104323, -0.2029426735485109, -0.023400246943687884, 0.06274085547547878, 0.007477759065606245, 0.009037365114725218, 0.08498235754867471, -0.12436078150370498, -0.19935602061280117, 0.40955013086701314, -0.0356010875647615, -0.3218530360154989, 0.17265187946670665, -0.0800128864215278, -0.08035536288715354, 0.11984280817119813, 0.2462535296771221, 0.1402036850681392, -0.10643060101059879, 0.07075585735814147, 0.09603586075181517, 0.16305901996064476, 0.1592885718521912, 0.15619138396549515, 0.11723736896202332, 0.17262570950679662, 0.08013770444227791, 0.10377326021652396, -0.025670731031313176, -0.12079000182268096, -0.3728407785841605, -0.14100659162192264, -0.14237547470483838, -0.009431503075863542, -0.1389138031652958, -0.08848972718526678, 0.3953251775990172, 0.13347437645865196, 0.06749822810383105, 0.05812410460557879, 0.3459860789248856, 0.1415855781368275, 0.029074397233382957, 0.12396458947531334, 0.19258563906499526, 0.13555334306253894, 0.06565147748489569, -0.16648424144198254, 0.010481622183650004, 0.10788805155855853] |
1,802.05247 | Fundamental Factorization of a GLSM, Part I: Construction | We define enumerative invariants associated to a hybrid Gauged Linear Sigma
Model. We prove that in the relevant special cases, these invariants recover
both the Gromov-Witten type invariants defined by Chang-Li and Fan-Jarvis-Ruan
using cosection localization as well as the FJRW type invariants constructed by
Polishchuk-Vaintrob. The invariants are defined by constructing a "fundamental
factorization" supported on the moduli space of Landau-Ginzburg maps to a
convex hybrid model. This gives the kernel of a Fourier-Mukai transform; the
associated map on Hochschild homology defines our theory.
| math.AG hep-th | we define enumerative invariants associated to a hybrid gauged linear sigma model we prove that in the relevant special cases these invariants recover both the gromovwitten type invariants defined by changli and fanjarvisruan using cosection localization as well as the fjrw type invariants constructed by polishchukvaintrob the invariants are defined by constructing a fundamental factorization supported on the moduli space of landauginzburg maps to a convex hybrid model this gives the kernel of a fouriermukai transform the associated map on hochschild homology defines our theory | [['we', 'define', 'enumerative', 'invariants', 'associated', 'to', 'a', 'hybrid', 'gauged', 'linear', 'sigma', 'model', 'we', 'prove', 'that', 'in', 'the', 'relevant', 'special', 'cases', 'these', 'invariants', 'recover', 'both', 'the', 'gromovwitten', 'type', 'invariants', 'defined', 'by', 'changli', 'and', 'fanjarvisruan', 'using', 'cosection', 'localization', 'as', 'well', 'as', 'the', 'fjrw', 'type', 'invariants', 'constructed', 'by', 'polishchukvaintrob', 'the', 'invariants', 'are', 'defined', 'by', 'constructing', 'a', 'fundamental', 'factorization', 'supported', 'on', 'the', 'moduli', 'space', 'of', 'landauginzburg', 'maps', 'to', 'a', 'convex', 'hybrid', 'model', 'this', 'gives', 'the', 'kernel', 'of', 'a', 'fouriermukai', 'transform', 'the', 'associated', 'map', 'on', 'hochschild', 'homology', 'defines', 'our', 'theory']] | [-0.1705367633882147, 0.021150790341478962, -0.09657959057668965, 0.15752826160007907, -0.06642634024372301, -0.16572805128273477, -0.016575965737217074, 0.267866875707026, -0.36428776020408576, -0.22922853378197514, 0.10229831313888307, -0.21630244440937707, -0.2628516148192337, 0.1852598859906107, -0.15633964419634228, 0.04681752279333501, -0.0005933843238885144, 0.03086065093661288, -0.16244394110841115, -0.22038367187116206, 0.4192125943141529, -0.054002327788396774, 0.21261102277000088, 0.035413964943264625, 0.11150928167065224, 0.0317061032836202, -0.051463988194444095, -0.005835438423695538, -0.17285693041934333, 0.1747208946406931, 0.30670086880977526, 0.0648614468406437, 0.09701713934507086, -0.3743364620639617, -0.19426174137561794, 0.1300436677074576, 0.1056807766646057, 0.023310288158525903, 0.005869354256036052, -0.31997846459678136, 0.10981488140322358, -0.14766838448262404, -0.14289419914045967, -0.14042553872835026, -0.011201824128897074, 0.03617546690560608, -0.19632255602403578, -0.003933939774217735, 0.020039919585674013, 0.07516383101703622, -0.0688529296116118, -0.07210310238851123, -0.11100422535989299, 0.06048022150707218, -0.012034713198060551, 0.10536652366933694, 0.11012873623003981, -0.12122153358096369, -0.1655636293678937, 0.3559830562851156, -0.08590893874909863, -0.2842864563228585, 0.11940348555939834, -0.05349318309075547, -0.20181866831998957, 0.08258276221521917, 0.06557165181645787, 0.18105078672608696, -0.02427048537969948, 0.2006267624933845, -0.08310302267557974, 0.05984674519803151, 0.0741230715683336, 0.007835426923246628, 0.1751138690006302, 0.0804536646591073, 0.028756661849736, 0.17434571476944957, -0.018403650807070893, -0.09418639076694128, -0.38267887347793006, -0.1896486539864935, -0.13489131535773716, 0.12519923519028955, -0.1090612552261628, -0.19393933751811104, 0.456979403895023, 0.05367987697764513, 0.19974899810952057, 0.18288608816598195, 0.24149664276818106, 0.12481557192836316, 0.0730899014476552, 0.0038267259530902625, 0.12304917078588652, 0.2176864853027804, -0.007189066811318857, -0.15260875892211087, -0.03543838409774275, 0.3031777909968093] |
1,802.05248 | Phenomenology of Colored Radiative Neutrino Mass Model and Its
Implications on the Cosmic-ray Observations | We extend the colored Zee-Babu model with a gauged $U(1)_{B-L}$ symmetry and
a scalar singlet dark matter (DM) candidate $S$. The spontaneous breaking of
$U(1)_{B-L}$ leaves a residual $Z_2$ symmetry that stabilizes the DM and
generates tiny neutrino mass at the two-loop level with the color seesaw
mechanism. After investigating dark matter and flavor phenomenology of this
model systematically, we further focus on its imprint on two of cosmic-ray
anomalies: the Fermi-LAT gamma-ray excess at the Galactic Center (GCE) and the
PeV ultra-high energy (UHE) neutrino events at the IceCube. We found that the
Fermi-LAT GCE spectrum can be well fitted by DM annihilation into a pair of
on-shell singlet Higgs mediators while being compatible with the constraints
from relic density, direct detections as well as dwarf spheroidal galaxies in
the Milky Way. Although the UHE neutrino events at the IceCube could be
accounted for by resonance production of a TeV-scale leptoquark, the relevant
Yukawa couplings have been severely limited by current low energy flavor
experiments. We then derive the IceCube limits on the Yukawa couplings by
employing its latest 6-year data.
| hep-ph | we extend the colored zeebabu model with a gauged u1_bl symmetry and a scalar singlet dark matter dm candidate s the spontaneous breaking of u1_bl leaves a residual z_2 symmetry that stabilizes the dm and generates tiny neutrino mass at the twoloop level with the color seesaw mechanism after investigating dark matter and flavor phenomenology of this model systematically we further focus on its imprint on two of cosmicray anomalies the fermilat gammaray excess at the galactic center gce and the pev ultrahigh energy uhe neutrino events at the icecube we found that the fermilat gce spectrum can be well fitted by dm annihilation into a pair of onshell singlet higgs mediators while being compatible with the constraints from relic density direct detections as well as dwarf spheroidal galaxies in the milky way although the uhe neutrino events at the icecube could be accounted for by resonance production of a tevscale leptoquark the relevant yukawa couplings have been severely limited by current low energy flavor experiments we then derive the icecube limits on the yukawa couplings by employing its latest 6year data | [['we', 'extend', 'the', 'colored', 'zeebabu', 'model', 'with', 'a', 'gauged', 'u1_bl', 'symmetry', 'and', 'a', 'scalar', 'singlet', 'dark', 'matter', 'dm', 'candidate', 's', 'the', 'spontaneous', 'breaking', 'of', 'u1_bl', 'leaves', 'a', 'residual', 'z_2', 'symmetry', 'that', 'stabilizes', 'the', 'dm', 'and', 'generates', 'tiny', 'neutrino', 'mass', 'at', 'the', 'twoloop', 'level', 'with', 'the', 'color', 'seesaw', 'mechanism', 'after', 'investigating', 'dark', 'matter', 'and', 'flavor', 'phenomenology', 'of', 'this', 'model', 'systematically', 'we', 'further', 'focus', 'on', 'its', 'imprint', 'on', 'two', 'of', 'cosmicray', 'anomalies', 'the', 'fermilat', 'gammaray', 'excess', 'at', 'the', 'galactic', 'center', 'gce', 'and', 'the', 'pev', 'ultrahigh', 'energy', 'uhe', 'neutrino', 'events', 'at', 'the', 'icecube', 'we', 'found', 'that', 'the', 'fermilat', 'gce', 'spectrum', 'can', 'be', 'well', 'fitted', 'by', 'dm', 'annihilation', 'into', 'a', 'pair', 'of', 'onshell', 'singlet', 'higgs', 'mediators', 'while', 'being', 'compatible', 'with', 'the', 'constraints', 'from', 'relic', 'density', 'direct', 'detections', 'as', 'well', 'as', 'dwarf', 'spheroidal', 'galaxies', 'in', 'the', 'milky', 'way', 'although', 'the', 'uhe', 'neutrino', 'events', 'at', 'the', 'icecube', 'could', 'be', 'accounted', 'for', 'by', 'resonance', 'production', 'of', 'a', 'tevscale', 'leptoquark', 'the', 'relevant', 'yukawa', 'couplings', 'have', 'been', 'severely', 'limited', 'by', 'current', 'low', 'energy', 'flavor', 'experiments', 'we', 'then', 'derive', 'the', 'icecube', 'limits', 'on', 'the', 'yukawa', 'couplings', 'by', 'employing', 'its', 'latest', '6year', 'data']] | [-0.0854072113582803, 0.2700427824395944, -0.02879079471976793, 0.23715452785068958, -0.1261088654455207, -0.11336909575838146, 0.04109566073332514, 0.33649677473151096, -0.18539839556343485, -0.3730191219250088, -0.020891526231035632, -0.3194067764126665, 0.008457439498730249, 0.12089396589614737, 0.09935314848329514, -0.004224768363081359, 0.03316850331931754, -0.012858163404206816, -0.02927651607615689, -0.2684875193517655, 0.26455214104466757, 0.12142582413750691, 0.1785919022922926, 0.07992492675535627, 0.1032986660368976, -0.05742415044057582, -0.03305447677145251, -0.14397635346964247, -0.07868646490261288, 0.03917020696194863, 0.16685640520753933, 0.08629189244571275, 0.022561461587978917, -0.4174318991519593, -0.22947201031774467, 0.22332660555788367, 0.17561088569953545, 0.06091523774295718, -0.13988159592762323, -0.40765656220757374, 0.09636392391921318, -0.2803802218359823, -0.12699046676369527, 0.0069765344538449585, -0.08519111255664828, -0.08165317503281276, -0.257596889562562, 0.11331326602817421, -0.05683360899834392, -0.023626947124324903, -0.05184142281311554, -0.14947126615679934, -0.09834686052924084, -0.05393381869410175, 0.1865733499871567, -0.021918334781190964, 0.22346524213655636, -0.20489835666088327, -0.1354740433948841, 0.42618742848715774, -0.12384479522326408, -0.0782711562255377, 0.12206385032642264, -0.14476648110712131, -0.22241289124524752, 0.13536323223948724, 0.14084400356124196, 0.012943006856213477, -0.20723244257189416, 0.2239621971341446, -0.05745008168038451, 0.13652953203507842, 0.030924254720058334, 0.021138850698032632, 0.3752903062236178, 0.21196173313572736, 0.11352834851701059, -0.006877794709558098, -0.16770334933899794, 0.0060306718383639395, -0.39173569107827333, -0.0716222246896455, -0.12541657361038194, 0.0760903099053194, -0.07967526524389741, -0.03969486923581296, 0.43828659482136534, 0.10536201665392862, 0.253332879078948, 0.017133014378966867, 0.325194179042048, 0.06711993291385594, 0.10157385691591017, 0.025751882203301966, 0.32753434908514906, 0.1236348544851273, 0.08593565167905251, -0.24505920404604134, -0.0024620956244909174, 0.05091189684801745] |
1,802.05249 | Distributionally Robust Submodular Maximization | Submodular functions have applications throughout machine learning, but in
many settings, we do not have direct access to the underlying function $f$. We
focus on stochastic functions that are given as an expectation of functions
over a distribution $P$. In practice, we often have only a limited set of
samples $f_i$ from $P$. The standard approach indirectly optimizes $f$ by
maximizing the sum of $f_i$. However, this ignores generalization to the true
(unknown) distribution. In this paper, we achieve better performance on the
actual underlying function $f$ by directly optimizing a combination of bias and
variance. Algorithmically, we accomplish this by showing how to carry out
distributionally robust optimization (DRO) for submodular functions, providing
efficient algorithms backed by theoretical guarantees which leverage several
novel contributions to the general theory of DRO. We also show compelling
empirical evidence that DRO improves generalization to the unknown stochastic
submodular function.
| cs.LG math.OC stat.ML | submodular functions have applications throughout machine learning but in many settings we do not have direct access to the underlying function f we focus on stochastic functions that are given as an expectation of functions over a distribution p in practice we often have only a limited set of samples f_i from p the standard approach indirectly optimizes f by maximizing the sum of f_i however this ignores generalization to the true unknown distribution in this paper we achieve better performance on the actual underlying function f by directly optimizing a combination of bias and variance algorithmically we accomplish this by showing how to carry out distributionally robust optimization dro for submodular functions providing efficient algorithms backed by theoretical guarantees which leverage several novel contributions to the general theory of dro we also show compelling empirical evidence that dro improves generalization to the unknown stochastic submodular function | [['submodular', 'functions', 'have', 'applications', 'throughout', 'machine', 'learning', 'but', 'in', 'many', 'settings', 'we', 'do', 'not', 'have', 'direct', 'access', 'to', 'the', 'underlying', 'function', 'f', 'we', 'focus', 'on', 'stochastic', 'functions', 'that', 'are', 'given', 'as', 'an', 'expectation', 'of', 'functions', 'over', 'a', 'distribution', 'p', 'in', 'practice', 'we', 'often', 'have', 'only', 'a', 'limited', 'set', 'of', 'samples', 'f_i', 'from', 'p', 'the', 'standard', 'approach', 'indirectly', 'optimizes', 'f', 'by', 'maximizing', 'the', 'sum', 'of', 'f_i', 'however', 'this', 'ignores', 'generalization', 'to', 'the', 'true', 'unknown', 'distribution', 'in', 'this', 'paper', 'we', 'achieve', 'better', 'performance', 'on', 'the', 'actual', 'underlying', 'function', 'f', 'by', 'directly', 'optimizing', 'a', 'combination', 'of', 'bias', 'and', 'variance', 'algorithmically', 'we', 'accomplish', 'this', 'by', 'showing', 'how', 'to', 'carry', 'out', 'distributionally', 'robust', 'optimization', 'dro', 'for', 'submodular', 'functions', 'providing', 'efficient', 'algorithms', 'backed', 'by', 'theoretical', 'guarantees', 'which', 'leverage', 'several', 'novel', 'contributions', 'to', 'the', 'general', 'theory', 'of', 'dro', 'we', 'also', 'show', 'compelling', 'empirical', 'evidence', 'that', 'dro', 'improves', 'generalization', 'to', 'the', 'unknown', 'stochastic', 'submodular', 'function']] | [-0.07738054057363053, -0.0027390061488626904, -0.0918553944670779, 0.10878427494966685, -0.11630664829506862, -0.12608673667129713, 0.10254986122247389, 0.4323975168497992, -0.3055431672386179, -0.3041816177353466, 0.03941856394125921, -0.2361085368320346, -0.21237721578075494, 0.2130026590391094, -0.12040778845358564, 0.10296797513530977, 0.04007783940150624, -0.015277508728611632, -0.08593248330424128, -0.2879990788721511, 0.2948863315966208, 0.04500737741627559, 0.28009334335192326, 0.040170317086498854, 0.10583586919875372, 0.04787359083685897, -0.020338090212673555, 0.01912130892821619, -0.1264149721631294, 0.13953027955009317, 0.2820161552022712, 0.22778756635859101, 0.3810013662516868, -0.3878493643283438, -0.20386499735419036, 0.17085577377124506, 0.13551791185524226, 0.04113341491830973, -0.03419753332102836, -0.21355508829840794, 0.09048697651921436, -0.1553773638779665, -0.04912392522341439, -0.14121520460336184, -0.02409292027024793, 0.04770224350488738, -0.33831801210042267, 0.04845210207055234, 0.06214701120748001, 0.036787320741929024, -0.027663486430003326, -0.17993867334824207, 0.04582180378191984, 0.0929830795483423, 0.06175168362908623, 0.08423075965268309, 0.12822840696036006, -0.12221296202410392, -0.13004223692870767, 0.3132844836051975, -0.062157092096448756, -0.2779007946476847, 0.15915453470894927, -0.1188786456576821, -0.16161690441318186, 0.12131963616401768, 0.21352534040097515, 0.13566019639177215, -0.17006819186491423, 0.09944443357752028, -0.10069334653339215, 0.15559234107103276, 0.020621394223001386, 0.02488852222648063, 0.16598427690863357, 0.11521348641665817, 0.123581051290729, 0.15078493033149312, 0.027789645505194763, -0.09506285727835026, -0.2871031776818187, -0.07165057998986876, -0.23366759197317621, 0.0378982906189603, -0.057538057517970684, -0.16853544028114756, 0.39034144460622755, 0.18991939623707108, 0.20670559900641747, 0.13685143586378037, 0.32807053644590234, 0.13203480427137965, 0.045836858280307174, 0.08470280293603333, 0.21703999627026774, 0.06551616751512855, 0.03348938865685316, -0.16107163037534575, 0.12859143158357564, 0.008232104129531757] |
1,802.0525 | Generating Plans that Predict Themselves | Collaboration requires coordination, and we coordinate by anticipating our
teammates' future actions and adapting to their plan. In some cases, our
teammates' actions early on can give us a clear idea of what the remainder of
their plan is, i.e. what action sequence we should expect. In others, they
might leave us less confident, or even lead us to the wrong conclusion. Our
goal is for robot actions to fall in the first category: we want to enable
robots to select their actions in such a way that human collaborators can
easily use them to correctly anticipate what will follow. While previous work
has focused on finding initial plans that convey a set goal, here we focus on
finding two portions of a plan such that the initial portion conveys the final
one. We introduce $t$-\ACty{}: a measure that quantifies the accuracy and
confidence with which human observers can predict the remaining robot plan from
the overall task goal and the observed initial $t$ actions in the plan. We
contribute a method for generating $t$-predictable plans: we search for a full
plan that accomplishes the task, but in which the first $t$ actions make it as
easy as possible to infer the remaining ones. The result is often different
from the most efficient plan, in which the initial actions might leave a lot of
ambiguity as to how the task will be completed. Through an online experiment
and an in-person user study with physical robots, we find that our approach
outperforms a traditional efficiency-based planner in objective and subjective
collaboration metrics.
| cs.RO cs.AI | collaboration requires coordination and we coordinate by anticipating our teammates future actions and adapting to their plan in some cases our teammates actions early on can give us a clear idea of what the remainder of their plan is ie what action sequence we should expect in others they might leave us less confident or even lead us to the wrong conclusion our goal is for robot actions to fall in the first category we want to enable robots to select their actions in such a way that human collaborators can easily use them to correctly anticipate what will follow while previous work has focused on finding initial plans that convey a set goal here we focus on finding two portions of a plan such that the initial portion conveys the final one we introduce tacty a measure that quantifies the accuracy and confidence with which human observers can predict the remaining robot plan from the overall task goal and the observed initial t actions in the plan we contribute a method for generating tpredictable plans we search for a full plan that accomplishes the task but in which the first t actions make it as easy as possible to infer the remaining ones the result is often different from the most efficient plan in which the initial actions might leave a lot of ambiguity as to how the task will be completed through an online experiment and an inperson user study with physical robots we find that our approach outperforms a traditional efficiencybased planner in objective and subjective collaboration metrics | [['collaboration', 'requires', 'coordination', 'and', 'we', 'coordinate', 'by', 'anticipating', 'our', 'teammates', 'future', 'actions', 'and', 'adapting', 'to', 'their', 'plan', 'in', 'some', 'cases', 'our', 'teammates', 'actions', 'early', 'on', 'can', 'give', 'us', 'a', 'clear', 'idea', 'of', 'what', 'the', 'remainder', 'of', 'their', 'plan', 'is', 'ie', 'what', 'action', 'sequence', 'we', 'should', 'expect', 'in', 'others', 'they', 'might', 'leave', 'us', 'less', 'confident', 'or', 'even', 'lead', 'us', 'to', 'the', 'wrong', 'conclusion', 'our', 'goal', 'is', 'for', 'robot', 'actions', 'to', 'fall', 'in', 'the', 'first', 'category', 'we', 'want', 'to', 'enable', 'robots', 'to', 'select', 'their', 'actions', 'in', 'such', 'a', 'way', 'that', 'human', 'collaborators', 'can', 'easily', 'use', 'them', 'to', 'correctly', 'anticipate', 'what', 'will', 'follow', 'while', 'previous', 'work', 'has', 'focused', 'on', 'finding', 'initial', 'plans', 'that', 'convey', 'a', 'set', 'goal', 'here', 'we', 'focus', 'on', 'finding', 'two', 'portions', 'of', 'a', 'plan', 'such', 'that', 'the', 'initial', 'portion', 'conveys', 'the', 'final', 'one', 'we', 'introduce', 'tacty', 'a', 'measure', 'that', 'quantifies', 'the', 'accuracy', 'and', 'confidence', 'with', 'which', 'human', 'observers', 'can', 'predict', 'the', 'remaining', 'robot', 'plan', 'from', 'the', 'overall', 'task', 'goal', 'and', 'the', 'observed', 'initial', 't', 'actions', 'in', 'the', 'plan', 'we', 'contribute', 'a', 'method', 'for', 'generating', 'tpredictable', 'plans', 'we', 'search', 'for', 'a', 'full', 'plan', 'that', 'accomplishes', 'the', 'task', 'but', 'in', 'which', 'the', 'first', 't', 'actions', 'make', 'it', 'as', 'easy', 'as', 'possible', 'to', 'infer', 'the', 'remaining', 'ones', 'the', 'result', 'is', 'often', 'different', 'from', 'the', 'most', 'efficient', 'plan', 'in', 'which', 'the', 'initial', 'actions', 'might', 'leave', 'a', 'lot', 'of', 'ambiguity', 'as', 'to', 'how', 'the', 'task', 'will', 'be', 'completed', 'through', 'an', 'online', 'experiment', 'and', 'an', 'inperson', 'user', 'study', 'with', 'physical', 'robots', 'we', 'find', 'that', 'our', 'approach', 'outperforms', 'a', 'traditional', 'efficiencybased', 'planner', 'in', 'objective', 'and', 'subjective', 'collaboration', 'metrics']] | [-0.06747349385373373, 0.08371271836120625, -0.14129501678475517, 0.07291409776698574, -0.1549404248624116, -0.11854213832375818, 0.10118695701221582, 0.44533711111591767, -0.22391302668064916, -0.35682056649486976, 0.09162327511571781, -0.2617907519957643, -0.15536415316760108, 0.17070626753022308, -0.14871697163871714, 0.02527291758090633, 0.10805990279186517, 0.09530400623506036, -0.013433743715638208, -0.28128647247181354, 0.2958835291048122, 0.07673383356331913, 0.23137687813209065, 0.017267195047637404, 0.07281441906198152, 0.014384557622983012, -0.057911072819324054, -0.004160571248174292, -0.08761290385047842, 0.1281332159893183, 0.3037472361520063, 0.2189318847652099, 0.31089682275358976, -0.4239293815957945, -0.13951957943648924, 0.11553600506564646, 0.12344119648941858, 0.12460551958200847, -0.004409152120550329, -0.30129941556848183, 0.08482371375137081, -0.17708421789440001, -0.11284370996444233, -0.10107617958650975, 0.002544481217023707, -0.030232174321332253, -0.26173138326077267, -0.03199389830318301, 0.06465833177862242, 0.0013800120186927014, -0.07951417511469837, -0.07023707277713662, 0.0005629865313670779, 0.25319417992646465, 0.0550222945599925, 0.0756751463320756, 0.15323188609819022, -0.138674562322039, -0.1409398216822784, 0.40587435111894393, -0.001599381511756616, -0.21393621855689746, 0.2136492309825632, -0.14171933476423282, -0.15091378109659567, 0.07573309324071706, 0.19426202163183268, 0.13246212717977734, -0.15855469392944677, -0.010878676693442516, -0.029192450981995077, 0.16320852817906167, 0.045776323032702584, -0.012708461625941907, 0.2228342583619578, 0.1617318282225133, 0.11524089237868194, 0.09814531477159177, -0.018448547499959157, -0.07424754922863912, -0.28627220179539087, -0.14935871140215576, -0.10932842121268226, 0.05055050001941737, -0.01783741571971616, -0.08391987719318592, 0.3800806188134679, 0.26432698397886356, 0.20260927645135815, 0.08616408124830495, 0.2837866765930671, 0.02303105808958969, 0.07516984991835748, 0.06423857447879873, 0.22485703785685812, -0.0358525363939576, 0.11138372946721899, -0.19280485747122142, 0.12182963430266033, 0.023049926829286093] |
1,802.05251 | Differentially Private Empirical Risk Minimization Revisited: Faster and
More General | In this paper we study the differentially private Empirical Risk Minimization
(ERM) problem in different settings. For smooth (strongly) convex loss function
with or without (non)-smooth regularization, we give algorithms that achieve
either optimal or near optimal utility bounds with less gradient complexity
compared with previous work. For ERM with smooth convex loss function in
high-dimensional ($p\gg n$) setting, we give an algorithm which achieves the
upper bound with less gradient complexity than previous ones. At last, we
generalize the expected excess empirical risk from convex loss functions to
non-convex ones satisfying the Polyak-Lojasiewicz condition and give a tighter
upper bound on the utility than the one in \cite{ijcai2017-548}.
| cs.LG cs.CR stat.ML | in this paper we study the differentially private empirical risk minimization erm problem in different settings for smooth strongly convex loss function with or without nonsmooth regularization we give algorithms that achieve either optimal or near optimal utility bounds with less gradient complexity compared with previous work for erm with smooth convex loss function in highdimensional pgg n setting we give an algorithm which achieves the upper bound with less gradient complexity than previous ones at last we generalize the expected excess empirical risk from convex loss functions to nonconvex ones satisfying the polyaklojasiewicz condition and give a tighter upper bound on the utility than the one in citeijcai2017548 | [['in', 'this', 'paper', 'we', 'study', 'the', 'differentially', 'private', 'empirical', 'risk', 'minimization', 'erm', 'problem', 'in', 'different', 'settings', 'for', 'smooth', 'strongly', 'convex', 'loss', 'function', 'with', 'or', 'without', 'nonsmooth', 'regularization', 'we', 'give', 'algorithms', 'that', 'achieve', 'either', 'optimal', 'or', 'near', 'optimal', 'utility', 'bounds', 'with', 'less', 'gradient', 'complexity', 'compared', 'with', 'previous', 'work', 'for', 'erm', 'with', 'smooth', 'convex', 'loss', 'function', 'in', 'highdimensional', 'pgg', 'n', 'setting', 'we', 'give', 'an', 'algorithm', 'which', 'achieves', 'the', 'upper', 'bound', 'with', 'less', 'gradient', 'complexity', 'than', 'previous', 'ones', 'at', 'last', 'we', 'generalize', 'the', 'expected', 'excess', 'empirical', 'risk', 'from', 'convex', 'loss', 'functions', 'to', 'nonconvex', 'ones', 'satisfying', 'the', 'polyaklojasiewicz', 'condition', 'and', 'give', 'a', 'tighter', 'upper', 'bound', 'on', 'the', 'utility', 'than', 'the', 'one', 'in', 'citeijcai2017548']] | [-0.056353648063830204, -0.007588609055852026, -0.06914716253609017, 0.12893614305196227, -0.07293803750157908, -0.1975345527365183, 0.09872016479817426, 0.4034955011232308, -0.25729689187870397, -0.3093086567715983, 0.10638216328893409, -0.2985448414951356, -0.1575271929506454, 0.2251817626680282, -0.17157388681166427, 0.10397764395370528, 0.052436078493310896, 0.018129943473333562, -0.12236962689267886, -0.3557641314778098, 0.3172193230992114, 0.02815465316072934, 0.2404369951777712, 0.05409074671937291, 0.03823961013134707, 0.016152205566565197, 0.06709847364281477, 0.0029799815577765307, -0.16209003515575238, 0.19260353494448484, 0.26723857239509624, 0.19890746564380135, 0.3765523047617602, -0.41405828715371035, -0.18919776989302287, 0.20609960451515186, 0.12169520070138215, 0.022526464531741414, -0.05899732957132747, -0.17872530761761246, 0.06097787088192827, -0.10758578347870046, -0.053931480635785393, -0.06086182765472956, -0.07124282083262827, -0.0023415578568043807, -0.3805337713651911, 0.12923656242761622, 0.06697810551634541, 0.05789900015709767, -0.11546214707670044, -0.20720995085624358, 0.051039669662714005, 0.0028600482080407717, 0.09029061261335974, 0.11789700964948645, 0.10407296829011843, -0.11352559618643243, -0.12505284093182395, 0.2734675117061232, -0.09598566133542961, -0.2613973303059875, 0.16842219815589488, -0.11864838715539211, -0.10308702628309321, 0.1382971907991709, 0.25078758268392887, 0.17599233445125045, -0.11917779647262285, 0.07510363946709765, -0.0672043790626857, 0.11693334876542429, 0.06428467176199236, 0.07584550603793037, 0.022453973932122742, 0.13909358538566502, 0.2582062024847363, 0.20825759325762866, 0.005142686239667927, -0.1198535200846554, -0.28836450609270725, -0.08282190477324615, -0.1798910171923193, 0.026589666544977162, -0.1431947282160561, -0.12929609477093132, 0.2782953352822612, 0.08907610005957799, 0.24006670957896858, 0.2500773406408606, 0.35668286574245606, 0.13021018320729058, 0.008356944502641758, 0.18628866866196472, 0.23819726909924713, 0.04711715776594011, 0.011954957559484884, -0.1867353298671164, 0.12352062289223627, 0.07451951518413369] |
1,802.05252 | Upgrading nodes in tree-shaped hub location | In this paper, we introduce the Tree of Hubs Location Problem with Upgrading,
a mixture of the Tree of Hubs Location Problem, presented by Contreras et. al
(2010), and the Minimum Cost Spanning Tree Problem with Upgraded nodes, studied
for the first time by Krumke (1999). In addition to locate the hubs, to
determine the tree that connects the hubs and to allocate non-hub nodes to
hubs, a decision has to be made about which of the hubs will be upgraded,
taking into account that the total number of upgraded nodes is given. We
present two different Mixed Integer Linear Programming formulations for the
problem, tighten the formulations and generate several families of valid
inequalities for them. A computational study is presented showing the
improvements attained with the strengthening of the formulations and comparing
them.
| math.OC cs.DM | in this paper we introduce the tree of hubs location problem with upgrading a mixture of the tree of hubs location problem presented by contreras et al 2010 and the minimum cost spanning tree problem with upgraded nodes studied for the first time by krumke 1999 in addition to locate the hubs to determine the tree that connects the hubs and to allocate nonhub nodes to hubs a decision has to be made about which of the hubs will be upgraded taking into account that the total number of upgraded nodes is given we present two different mixed integer linear programming formulations for the problem tighten the formulations and generate several families of valid inequalities for them a computational study is presented showing the improvements attained with the strengthening of the formulations and comparing them | [['in', 'this', 'paper', 'we', 'introduce', 'the', 'tree', 'of', 'hubs', 'location', 'problem', 'with', 'upgrading', 'a', 'mixture', 'of', 'the', 'tree', 'of', 'hubs', 'location', 'problem', 'presented', 'by', 'contreras', 'et', 'al', '2010', 'and', 'the', 'minimum', 'cost', 'spanning', 'tree', 'problem', 'with', 'upgraded', 'nodes', 'studied', 'for', 'the', 'first', 'time', 'by', 'krumke', '1999', 'in', 'addition', 'to', 'locate', 'the', 'hubs', 'to', 'determine', 'the', 'tree', 'that', 'connects', 'the', 'hubs', 'and', 'to', 'allocate', 'nonhub', 'nodes', 'to', 'hubs', 'a', 'decision', 'has', 'to', 'be', 'made', 'about', 'which', 'of', 'the', 'hubs', 'will', 'be', 'upgraded', 'taking', 'into', 'account', 'that', 'the', 'total', 'number', 'of', 'upgraded', 'nodes', 'is', 'given', 'we', 'present', 'two', 'different', 'mixed', 'integer', 'linear', 'programming', 'formulations', 'for', 'the', 'problem', 'tighten', 'the', 'formulations', 'and', 'generate', 'several', 'families', 'of', 'valid', 'inequalities', 'for', 'them', 'a', 'computational', 'study', 'is', 'presented', 'showing', 'the', 'improvements', 'attained', 'with', 'the', 'strengthening', 'of', 'the', 'formulations', 'and', 'comparing', 'them']] | [-0.13021141620276414, 0.08199267080505449, -0.03423937483787982, 0.061531213033117295, -0.08729278386584413, -0.1246248597814354, 0.11018728944142836, 0.34165481600820075, -0.27764707417991846, -0.3568280763279494, 0.10306275471759987, -0.27794861106841423, -0.13463476489023515, 0.12066704614101839, -0.07206195153629602, 0.02623827426013217, 0.0946313163765998, 0.00558000392238818, -0.009491851896051067, -0.2985029441231528, 0.28481440565552313, 0.0807519423247162, 0.21181089121417435, 0.055607330088795565, 0.12417108944613736, 0.027624811895483575, -0.05372169285442736, 0.061691620943150415, -0.12662701397396212, 0.1496727836644972, 0.3161756881797658, 0.17460440045723052, 0.28253186987573975, -0.4233595199549376, -0.19553099186229173, 0.14689253320841036, 0.08959758909307976, 0.06937810575586062, 0.012909196803707685, -0.2654638516007742, 0.11876107590384226, -0.1703958674681498, -0.11484526619558404, 0.0028843963779370064, 0.016762831293519086, -0.0024339292227089017, -0.2653489009644002, 0.008789116367280705, 0.021077901715718543, -0.017908774711601714, -0.026087404916813568, -0.16226340689932678, -0.030258569650963615, 0.14140708530634474, 0.007645492702583546, 0.01679987490521188, 0.05082703654744676, -0.08836422849002593, -0.1703401273602981, 0.33399518623725694, 0.022746805275387284, -0.16373668118326146, 0.18221162372779573, -0.06536394457416192, -0.19322247462479203, 0.08415821724946597, 0.21007849317766839, 0.08870109935888826, -0.17257398937536933, 0.0392006414720038, -0.059497131076432876, 0.11177945323983457, 0.1134352751507132, -0.00952140853823677, 0.15977978351206254, 0.17583114139513292, 0.1302477658357916, 0.20148199917435813, -0.058546889429554036, -0.08090438735680029, -0.25186189700877154, -0.14665742519436709, -0.18134535429651724, -0.07872345601208508, -0.09321735910819356, -0.12572956653033843, 0.4024821421194043, 0.14551354086360158, 0.20583612425947811, 0.12685020382206805, 0.24776122714184337, 0.11186642583099944, 0.06514573449950053, 0.15507004100050945, 0.20560854655315183, 0.1342206068385615, 0.0955138599826718, -0.1904363019371044, 0.08691622086569542, 0.09354756989015905] |
1,802.05253 | Kardar-Parisi-Zhang Universality in First-Passage Percolation: the Role
of Geodesic Degeneracy | We have characterized the scaling behavior of the first-passage percolation
(FPP) model on two types of discrete networks, the regular square lattice and
the disordered Delaunay lattice, thereby addressing the effect of the
underlying topology. Several distribution functions for the link-times were
considered. The asymptotic behavior of the fluctuations for both the minimal
arrival time and the lateral deviation of the geodesic path are in perfect
agreement with the Kardar-Parisi-Zhang (KPZ) universality class regardless of
the type of the link-time distribution and of the lattice topology.
Pre-asymptotic behavior, on the other hand, is found to depend on the
uniqueness of geodesics in absence of disorder in the local crossing times, a
topological property of lattice directions that we term geodesic degeneracy.
This property has important consequences on the model, as for example the
well-known anisotropic growth in regular lattices. In this work we provide a
framework to understand its effect as well as to characterize its extent.
| cond-mat.stat-mech math.PR | we have characterized the scaling behavior of the firstpassage percolation fpp model on two types of discrete networks the regular square lattice and the disordered delaunay lattice thereby addressing the effect of the underlying topology several distribution functions for the linktimes were considered the asymptotic behavior of the fluctuations for both the minimal arrival time and the lateral deviation of the geodesic path are in perfect agreement with the kardarparisizhang kpz universality class regardless of the type of the linktime distribution and of the lattice topology preasymptotic behavior on the other hand is found to depend on the uniqueness of geodesics in absence of disorder in the local crossing times a topological property of lattice directions that we term geodesic degeneracy this property has important consequences on the model as for example the wellknown anisotropic growth in regular lattices in this work we provide a framework to understand its effect as well as to characterize its extent | [['we', 'have', 'characterized', 'the', 'scaling', 'behavior', 'of', 'the', 'firstpassage', 'percolation', 'fpp', 'model', 'on', 'two', 'types', 'of', 'discrete', 'networks', 'the', 'regular', 'square', 'lattice', 'and', 'the', 'disordered', 'delaunay', 'lattice', 'thereby', 'addressing', 'the', 'effect', 'of', 'the', 'underlying', 'topology', 'several', 'distribution', 'functions', 'for', 'the', 'linktimes', 'were', 'considered', 'the', 'asymptotic', 'behavior', 'of', 'the', 'fluctuations', 'for', 'both', 'the', 'minimal', 'arrival', 'time', 'and', 'the', 'lateral', 'deviation', 'of', 'the', 'geodesic', 'path', 'are', 'in', 'perfect', 'agreement', 'with', 'the', 'kardarparisizhang', 'kpz', 'universality', 'class', 'regardless', 'of', 'the', 'type', 'of', 'the', 'linktime', 'distribution', 'and', 'of', 'the', 'lattice', 'topology', 'preasymptotic', 'behavior', 'on', 'the', 'other', 'hand', 'is', 'found', 'to', 'depend', 'on', 'the', 'uniqueness', 'of', 'geodesics', 'in', 'absence', 'of', 'disorder', 'in', 'the', 'local', 'crossing', 'times', 'a', 'topological', 'property', 'of', 'lattice', 'directions', 'that', 'we', 'term', 'geodesic', 'degeneracy', 'this', 'property', 'has', 'important', 'consequences', 'on', 'the', 'model', 'as', 'for', 'example', 'the', 'wellknown', 'anisotropic', 'growth', 'in', 'regular', 'lattices', 'in', 'this', 'work', 'we', 'provide', 'a', 'framework', 'to', 'understand', 'its', 'effect', 'as', 'well', 'as', 'to', 'characterize', 'its', 'extent']] | [-0.13880988257602814, 0.12097607682256076, -0.08497131995047824, 0.08484600922495772, -0.05841651243659166, -0.0985882362553802, 0.023109286890711445, 0.36865140316195977, -0.28414000226602626, -0.24003823182712763, 0.11596273538993838, -0.29309390472152674, -0.15419690783631104, 0.1553073082304297, -0.006921566157148053, 0.07947816501464097, -0.001391690337839417, 0.04347873726155973, -0.0589032566439038, -0.23273360608026195, 0.32589992491277653, 0.03585817596803491, 0.32739367772741484, 0.08648361547294861, 0.06668495738472885, 0.024835947366694037, 0.018649790537519716, 0.05864227929104788, -0.18889052311178836, 0.0797977396958651, 0.14289109368184702, 0.016893300263640974, 0.20835899691416834, -0.40372527056397534, -0.24423801810450804, 0.12207533169287042, 0.12883171309024477, 0.09703030013956894, -0.017985121817148935, -0.2663280801274456, 0.07608313575828782, -0.10041816706936328, -0.20435205711505544, -0.008146021903182069, 0.028803756296371993, 0.061352466371504426, -0.20605689427481058, 0.09684753488414945, 0.11556486737726328, 0.07488315956643185, -0.05344694936073397, -0.07835896594378237, -0.03159333818490641, 0.15999881376345187, 0.07844921437581667, -0.012343801190861715, 0.06568832544144243, -0.13433686043105972, -0.1375703143384248, 0.40966397838499874, -0.04101198430185039, -0.21806522485507557, 0.17430087174169528, -0.18407754512736574, -0.13613396800624636, 0.08816198638688104, 0.161876127953665, 0.08485826051746233, -0.12025322524520259, 0.12739890578496926, -0.039706614560996875, 0.08955637122898434, 0.041605144169014424, 0.06659188410165558, 0.17189581933244205, 0.17996602003964093, 0.0839874292746222, 0.16917742887334242, -0.08883708928344557, -0.15973100305284157, -0.30376292801781507, -0.13726034632418305, -0.2186328218652843, 0.08313397485285233, -0.15576082374275593, -0.23469691703287074, 0.42462645538557225, 0.14325181217505956, 0.21162421788083008, 0.0896464765149479, 0.18374046860023951, 0.08054041717360423, 0.029217760454720028, 0.040345191243641935, 0.21319767098294762, 0.11609731236239895, 0.07915675528466892, -0.25163938636885574, 0.10447240215188895, 0.10763087038858196] |
1,802.05254 | Dynamic Sensor Selection for Reliable Spectrum Sensing via E-Optimal
Criterion | Reliable and efficient spectrum sensing through dynamic selection of a subset
of spectrum sensors is studied. The problem of selecting K sensor measurements
from a set of M potential sensors is considered where K << M. In addition, K
may be less than the dimension of the unknown variables of estimation. Through
sensor selection, we reduce the problem to an under-determined system of
equations with potentially infinite number of solutions. However, the sparsity
of the underlying data facilitates limiting the set of solutions to a unique
solution. Sparsity enables employing the emerging compressive sensing
technique, where the compressed measurements are selected from a large number
of potential sensors. This paper suggests selecting sensors in a way that the
reduced system of equations constructs a well-conditioned measurement matrix.
Our criterion for sensor selection is based on E-optimalily, which is highly
related to the restricted isometry property that provides some guarantees for
sparse solution obtained by L1 minimization. Moreover, the proposed framework
exploits a feedback mechanism to evolve the selected sensors dynamically over
time. The evolution aims to maximize the reliability of the sensed spectrum.
| math.OC | reliable and efficient spectrum sensing through dynamic selection of a subset of spectrum sensors is studied the problem of selecting k sensor measurements from a set of m potential sensors is considered where k m in addition k may be less than the dimension of the unknown variables of estimation through sensor selection we reduce the problem to an underdetermined system of equations with potentially infinite number of solutions however the sparsity of the underlying data facilitates limiting the set of solutions to a unique solution sparsity enables employing the emerging compressive sensing technique where the compressed measurements are selected from a large number of potential sensors this paper suggests selecting sensors in a way that the reduced system of equations constructs a wellconditioned measurement matrix our criterion for sensor selection is based on eoptimalily which is highly related to the restricted isometry property that provides some guarantees for sparse solution obtained by l1 minimization moreover the proposed framework exploits a feedback mechanism to evolve the selected sensors dynamically over time the evolution aims to maximize the reliability of the sensed spectrum | [['reliable', 'and', 'efficient', 'spectrum', 'sensing', 'through', 'dynamic', 'selection', 'of', 'a', 'subset', 'of', 'spectrum', 'sensors', 'is', 'studied', 'the', 'problem', 'of', 'selecting', 'k', 'sensor', 'measurements', 'from', 'a', 'set', 'of', 'm', 'potential', 'sensors', 'is', 'considered', 'where', 'k', 'm', 'in', 'addition', 'k', 'may', 'be', 'less', 'than', 'the', 'dimension', 'of', 'the', 'unknown', 'variables', 'of', 'estimation', 'through', 'sensor', 'selection', 'we', 'reduce', 'the', 'problem', 'to', 'an', 'underdetermined', 'system', 'of', 'equations', 'with', 'potentially', 'infinite', 'number', 'of', 'solutions', 'however', 'the', 'sparsity', 'of', 'the', 'underlying', 'data', 'facilitates', 'limiting', 'the', 'set', 'of', 'solutions', 'to', 'a', 'unique', 'solution', 'sparsity', 'enables', 'employing', 'the', 'emerging', 'compressive', 'sensing', 'technique', 'where', 'the', 'compressed', 'measurements', 'are', 'selected', 'from', 'a', 'large', 'number', 'of', 'potential', 'sensors', 'this', 'paper', 'suggests', 'selecting', 'sensors', 'in', 'a', 'way', 'that', 'the', 'reduced', 'system', 'of', 'equations', 'constructs', 'a', 'wellconditioned', 'measurement', 'matrix', 'our', 'criterion', 'for', 'sensor', 'selection', 'is', 'based', 'on', 'eoptimalily', 'which', 'is', 'highly', 'related', 'to', 'the', 'restricted', 'isometry', 'property', 'that', 'provides', 'some', 'guarantees', 'for', 'sparse', 'solution', 'obtained', 'by', 'l1', 'minimization', 'moreover', 'the', 'proposed', 'framework', 'exploits', 'a', 'feedback', 'mechanism', 'to', 'evolve', 'the', 'selected', 'sensors', 'dynamically', 'over', 'time', 'the', 'evolution', 'aims', 'to', 'maximize', 'the', 'reliability', 'of', 'the', 'sensed', 'spectrum']] | [-0.15744845589715473, 0.06456608264985203, -0.06635160965443646, -0.03922427526304694, -0.10514178236133485, -0.15494024722955257, 0.07801651427308766, 0.3415509564184599, -0.3121484857855251, -0.3137441944968964, 0.13367269770724657, -0.2783031374761495, -0.1449328668496587, 0.1635033811612353, -0.08374878817150441, 0.10589919166732065, 0.06311254302754957, 0.06566810672613921, -0.04886666976059504, -0.2133568521326624, 0.28160774588420245, 0.07991645820387408, 0.29017916069885724, -0.040555445634302016, 0.13476844202113325, 0.04654159336363722, -0.04856255257152309, 0.03673998397602622, -0.07684291934233367, 0.1432856074405721, 0.2941840252496858, 0.1877716178146656, 0.32040460532767834, -0.39484562267914664, -0.2239514131932545, 0.11855668716070895, 0.15635307219383712, 0.07422663681710767, -0.07307048413442005, -0.2614462795816568, 0.14823405604258963, -0.12544948077237733, -0.09479881063340366, -0.05634894970809598, -0.009988962243007526, 0.0006321197912729382, -0.3604129549136478, 0.02902351297535908, 0.00298941682880096, 0.01088093801334665, -0.11884902526099667, -0.10562306066372983, 0.028751405293008736, 0.12007408032067717, 0.012318617214052552, -0.007300421712631925, 0.14873587662734875, -0.11626620300484626, -0.05573593226752825, 0.3820304659102627, -0.02258973191686821, -0.21764632349947047, 0.16303830307867193, -0.08240263841310465, -0.11045168732159169, 0.16545702092277492, 0.19325636982022482, 0.1419092385144647, -0.19155871826970117, 0.07831288827808307, -0.043242675651029495, 0.17956484832096, 0.01690477872838508, 0.07156974950403963, 0.13457834018421364, 0.19044502563735996, 0.16616382800269028, 0.13210407846146752, -0.09007323542429721, -0.020821913674175328, -0.2658867835123812, -0.09868573604758767, -0.2391116632694039, 0.028992519452807737, -0.12350367754432488, -0.14037837663366978, 0.3725645048749628, 0.17643228671912267, 0.21560547520980258, 0.027641185934064286, 0.3159694232417075, 0.10079262000511822, 0.07046428380935396, 0.0630682025475232, 0.20479909870185045, 0.15722312209503828, 0.07990919457406362, -0.2139656535730548, 0.07048345569959194, 0.04116226570006686] |
1,802.05255 | On macroscopic holes in some supercritical strongly dependent
percolation models | We consider $Z^d$, with d bigger or equal to three. We investigate the vacant
set of random interlacements in the strongly percolative regime, the vacant set
of the simple random walk, and the excursion set above a given level of the
Gaussian free field in the strongly percolative regime. We derive asymptotic
upper and lower exponential bounds for the large deviation probability that the
adequately thickened component of the boundary of a large box centered at the
origin in the respective vacant sets or excursion set leaves in the box a
macroscopic volume in its complement. We also derive geometric information on
the shape of the left-out volume. It is plausible, but open at the moment, that
certain critical levels coincide, both in the case of random interlacements and
of the Gaussian free field. If this holds true, the asymptotic upper and lower
bounds that we obtain are matching in principal order for all three models, and
the macroscopic holes are nearly spherical. We heavily rely on the recent work
arXiv:1706.07229 by Maximilian Nitzschner and the author for the coarse
graining procedure, which we employ in the derivation of the upper bounds.
| math.PR math-ph math.MP | we consider zd with d bigger or equal to three we investigate the vacant set of random interlacements in the strongly percolative regime the vacant set of the simple random walk and the excursion set above a given level of the gaussian free field in the strongly percolative regime we derive asymptotic upper and lower exponential bounds for the large deviation probability that the adequately thickened component of the boundary of a large box centered at the origin in the respective vacant sets or excursion set leaves in the box a macroscopic volume in its complement we also derive geometric information on the shape of the leftout volume it is plausible but open at the moment that certain critical levels coincide both in the case of random interlacements and of the gaussian free field if this holds true the asymptotic upper and lower bounds that we obtain are matching in principal order for all three models and the macroscopic holes are nearly spherical we heavily rely on the recent work arxiv170607229 by maximilian nitzschner and the author for the coarse graining procedure which we employ in the derivation of the upper bounds | [['we', 'consider', 'zd', 'with', 'd', 'bigger', 'or', 'equal', 'to', 'three', 'we', 'investigate', 'the', 'vacant', 'set', 'of', 'random', 'interlacements', 'in', 'the', 'strongly', 'percolative', 'regime', 'the', 'vacant', 'set', 'of', 'the', 'simple', 'random', 'walk', 'and', 'the', 'excursion', 'set', 'above', 'a', 'given', 'level', 'of', 'the', 'gaussian', 'free', 'field', 'in', 'the', 'strongly', 'percolative', 'regime', 'we', 'derive', 'asymptotic', 'upper', 'and', 'lower', 'exponential', 'bounds', 'for', 'the', 'large', 'deviation', 'probability', 'that', 'the', 'adequately', 'thickened', 'component', 'of', 'the', 'boundary', 'of', 'a', 'large', 'box', 'centered', 'at', 'the', 'origin', 'in', 'the', 'respective', 'vacant', 'sets', 'or', 'excursion', 'set', 'leaves', 'in', 'the', 'box', 'a', 'macroscopic', 'volume', 'in', 'its', 'complement', 'we', 'also', 'derive', 'geometric', 'information', 'on', 'the', 'shape', 'of', 'the', 'leftout', 'volume', 'it', 'is', 'plausible', 'but', 'open', 'at', 'the', 'moment', 'that', 'certain', 'critical', 'levels', 'coincide', 'both', 'in', 'the', 'case', 'of', 'random', 'interlacements', 'and', 'of', 'the', 'gaussian', 'free', 'field', 'if', 'this', 'holds', 'true', 'the', 'asymptotic', 'upper', 'and', 'lower', 'bounds', 'that', 'we', 'obtain', 'are', 'matching', 'in', 'principal', 'order', 'for', 'all', 'three', 'models', 'and', 'the', 'macroscopic', 'holes', 'are', 'nearly', 'spherical', 'we', 'heavily', 'rely', 'on', 'the', 'recent', 'work', 'arxiv170607229', 'by', 'maximilian', 'nitzschner', 'and', 'the', 'author', 'for', 'the', 'coarse', 'graining', 'procedure', 'which', 'we', 'employ', 'in', 'the', 'derivation', 'of', 'the', 'upper', 'bounds']] | [-0.11729067815835342, 0.1734469689514586, -0.06059864875860512, 0.07325290172900024, -0.016511672252397004, -0.10883980508967253, 0.11418107578769865, 0.3108642921871873, -0.22839387210674192, -0.2525543291489349, 0.13249915355914518, -0.2889534984078062, -0.10617234168427163, 0.14847457314302262, -0.04381091069019596, 0.03926810367541437, -0.007432158156543186, 0.08883029013063366, -0.01881464304966166, -0.26703108384114643, 0.33397487291428996, 0.0184290647261629, 0.2693275887727443, 0.061253223468328975, 0.08388347433340784, 0.009903571945860197, -0.010345337713921541, 0.035796544423915055, -0.20659804996037948, 0.14588158109476546, 0.15061969092005856, 0.08121661780107962, 0.2576717808940693, -0.4176631038714396, -0.1690342146431488, 0.1370839731694248, 0.1275135182922608, 0.08655967956200536, 0.006684690648934951, -0.2574780886980558, 0.10005113822285477, -0.10140934720831482, -0.15201738207650028, -0.011855409568861911, 0.025583729894194555, 0.03173188459814379, -0.2589764009327873, 0.06573991542789276, 0.12110706105779269, 0.040086317428320306, -0.05052393954676135, -0.13137455481398655, -0.009451912997878696, 0.1358339643375458, -0.0029678320910438505, 0.011128366532839688, 0.11328683107429625, -0.1156160346048541, -0.07110885093233694, 0.33088195294533906, -0.08526974753936213, -0.20508122480425395, 0.18674446458585167, -0.2623535590123777, -0.1547325591256499, 0.1162261978134905, 0.16665204235989797, 0.0959514039568603, -0.13159215626747986, 0.16011363833125583, -0.08583799845134643, 0.1043931091026599, 0.07430894422577694, 0.01966370307644339, 0.18300789499557332, 0.14300110624171794, 0.12728467653015335, 0.149261373928503, -0.09816164628872158, -0.0999986703948755, -0.34917145381240466, -0.1041729861613069, -0.2335251955542174, 0.05122936889529228, -0.1604654546454855, -0.2385737503664323, 0.36546610861918644, 0.1563523572428446, 0.23339581705482776, 0.11075547181106614, 0.24743762267854963, 0.14130086631691818, -0.01201423698251969, 0.11648504278866886, 0.19756013037342773, 0.12427833608572224, 0.010976922690966411, -0.15573391685213306, 0.058970214432031896, 0.10377537299094623] |
1,802.05256 | Fundamental ingredients for the emergence of discontinuous phase
transitions in the majority vote model | Discontinuous transitions have received considerable interest due to the
uncovering that many phenomena such as catastrophic changes, epidemic outbreaks
and synchronization present a behavior signed by abrupt (macroscopic) changes
(instead of smooth ones) as a tuning parameter is changed. However, in
different cases there are still scarce microscopic models reproducing such
above trademarks. With these ideas in mind, we investigate the fundamental
ingredients underpinning the discontinuous transition in one of the simplest
systems with up-down $Z_2$ symmetry recently ascertained in [Phys. Rev. E {\bf
95}, 042304 (2017)]. Such system, in the presence of an extra ingredient-the
inertia- has its continuous transition being switched to a discontinuous one in
complex networks. We scrutinize the role of three fundamental ingredients:
inertia, system degree, and the lattice topology. Our analysis has been carried
out for regular lattices and random regular networks with different node
degrees (interacting neighborhood) through mean-field treatment and numerical
simulations. Our findings reveal that not only the inertia but also the
connectivity constitute essential elements for shifting the phase transition.
Astoundingly, they also manifest in low-dimensional regular topologies,
exposing a scaling behavior entirely different than those from the complex
networks case. Therefore, our findings put on firmer bases the essential issues
for the manifestation of discontinuous transitions in such relevant class of
systems with $Z_2$ symmetry.
| cond-mat.stat-mech | discontinuous transitions have received considerable interest due to the uncovering that many phenomena such as catastrophic changes epidemic outbreaks and synchronization present a behavior signed by abrupt macroscopic changes instead of smooth ones as a tuning parameter is changed however in different cases there are still scarce microscopic models reproducing such above trademarks with these ideas in mind we investigate the fundamental ingredients underpinning the discontinuous transition in one of the simplest systems with updown z_2 symmetry recently ascertained in phys rev e bf 95 042304 2017 such system in the presence of an extra ingredientthe inertia has its continuous transition being switched to a discontinuous one in complex networks we scrutinize the role of three fundamental ingredients inertia system degree and the lattice topology our analysis has been carried out for regular lattices and random regular networks with different node degrees interacting neighborhood through meanfield treatment and numerical simulations our findings reveal that not only the inertia but also the connectivity constitute essential elements for shifting the phase transition astoundingly they also manifest in lowdimensional regular topologies exposing a scaling behavior entirely different than those from the complex networks case therefore our findings put on firmer bases the essential issues for the manifestation of discontinuous transitions in such relevant class of systems with z_2 symmetry | [['discontinuous', 'transitions', 'have', 'received', 'considerable', 'interest', 'due', 'to', 'the', 'uncovering', 'that', 'many', 'phenomena', 'such', 'as', 'catastrophic', 'changes', 'epidemic', 'outbreaks', 'and', 'synchronization', 'present', 'a', 'behavior', 'signed', 'by', 'abrupt', 'macroscopic', 'changes', 'instead', 'of', 'smooth', 'ones', 'as', 'a', 'tuning', 'parameter', 'is', 'changed', 'however', 'in', 'different', 'cases', 'there', 'are', 'still', 'scarce', 'microscopic', 'models', 'reproducing', 'such', 'above', 'trademarks', 'with', 'these', 'ideas', 'in', 'mind', 'we', 'investigate', 'the', 'fundamental', 'ingredients', 'underpinning', 'the', 'discontinuous', 'transition', 'in', 'one', 'of', 'the', 'simplest', 'systems', 'with', 'updown', 'z_2', 'symmetry', 'recently', 'ascertained', 'in', 'phys', 'rev', 'e', 'bf', '95', '042304', '2017', 'such', 'system', 'in', 'the', 'presence', 'of', 'an', 'extra', 'ingredientthe', 'inertia', 'has', 'its', 'continuous', 'transition', 'being', 'switched', 'to', 'a', 'discontinuous', 'one', 'in', 'complex', 'networks', 'we', 'scrutinize', 'the', 'role', 'of', 'three', 'fundamental', 'ingredients', 'inertia', 'system', 'degree', 'and', 'the', 'lattice', 'topology', 'our', 'analysis', 'has', 'been', 'carried', 'out', 'for', 'regular', 'lattices', 'and', 'random', 'regular', 'networks', 'with', 'different', 'node', 'degrees', 'interacting', 'neighborhood', 'through', 'meanfield', 'treatment', 'and', 'numerical', 'simulations', 'our', 'findings', 'reveal', 'that', 'not', 'only', 'the', 'inertia', 'but', 'also', 'the', 'connectivity', 'constitute', 'essential', 'elements', 'for', 'shifting', 'the', 'phase', 'transition', 'astoundingly', 'they', 'also', 'manifest', 'in', 'lowdimensional', 'regular', 'topologies', 'exposing', 'a', 'scaling', 'behavior', 'entirely', 'different', 'than', 'those', 'from', 'the', 'complex', 'networks', 'case', 'therefore', 'our', 'findings', 'put', 'on', 'firmer', 'bases', 'the', 'essential', 'issues', 'for', 'the', 'manifestation', 'of', 'discontinuous', 'transitions', 'in', 'such', 'relevant', 'class', 'of', 'systems', 'with', 'z_2', 'symmetry']] | [-0.14949030505255037, 0.14913985325127765, -0.045151056595357154, 0.04563307969256976, -0.06255594896975644, -0.15464827789015376, 0.060175677814499236, 0.35286979905307986, -0.22952216924181706, -0.2749482949827473, 0.0922014067155244, -0.26473576441667107, -0.21517899726235937, 0.15462925392446694, -0.04147990656106971, 0.031605406579217024, 0.017055795406706112, 0.007430727993203111, -0.06317096951060257, -0.2008422052754065, 0.29301379764625846, 0.023900176004268404, 0.29511759588819775, 0.038269160192210744, 0.053109484364083685, -0.026024373906642893, 0.011916375817287021, 0.022662599055090753, -0.11317747515811705, 0.06120878430063089, 0.2605019052276898, 0.04564441734665008, 0.2505173929815376, -0.44669502456780785, -0.28519959691587055, 0.13760711454223234, 0.13181480101721232, 0.1015051519855597, -0.047429996693160295, -0.3084454936246106, 0.04383492867982145, -0.16717317315247615, -0.15205610580525772, -0.12286430006104976, 0.054914755242616804, 0.01373789848456549, -0.21159799608813468, 0.07060503119705679, 0.08683758172921316, 0.11221646827951529, -0.017255971946961348, -0.1111785361749055, -0.044643388531538986, 0.1449865180473818, 0.05130694410113921, 0.0010651429855199747, 0.10864239082777288, -0.11446005091460985, -0.12427821940590822, 0.40065801569022413, 0.01784308352527956, -0.18502751772811765, 0.23887900239138235, -0.14827213550614582, -0.2000888348037247, 0.13121660025790333, 0.16654349448982367, 0.0858714499619118, -0.10111252530369648, 0.05956110856983118, -0.007098307680246572, 0.15252857648085283, 0.02953581696722743, 0.03870817976029113, 0.2159945693560118, 0.18612703376471304, 0.031210786145624468, 0.08219944497835714, -0.02178995770315618, -0.1680326986364847, -0.2875479012077978, -0.09422438646731682, -0.1829697453027028, 0.058641528744903006, -0.09146355231330448, -0.16757216652541226, 0.40578049189995885, 0.15000266903404927, 0.21280089632802923, -0.01227138128326556, 0.23169901004754181, 0.09162214381544483, 0.05235049096477586, 0.057449204921939, 0.24937425803448626, 0.12276571832467303, 0.10290624284900204, -0.20315113894987938, 0.10174696750635671, 0.049242711060702105] |
1,802.05257 | Dark Energy Survey Year 1 Results: Methodology and Projections for Joint
Analysis of Galaxy Clustering, Galaxy Lensing, and CMB Lensing Two-point
Functions | Optical imaging surveys measure both the galaxy density and the gravitational
lensing-induced shear fields across the sky. Recently, the Dark Energy Survey
(DES) collaboration used a joint fit to two-point correlations between these
observables to place tight constraints on cosmology (DES Collaboration et al.
2017). In this work, we develop the methodology to extend the DES year one
joint probes analysis to include cross-correlations of the optical survey
observables with gravitational lensing of the cosmic microwave background (CMB)
as measured by the South Pole Telescope (SPT) and Planck. Using simulated
analyses, we show how the resulting set of five two-point functions increases
the robustness of the cosmological constraints to systematic errors in galaxy
lensing shear calibration. Additionally, we show that contamination of the
SPT+Planck CMB lensing map by the thermal Sunyaev-Zel'dovich effect is a
potentially large source of systematic error for two-point function analyses,
but show that it can be reduced to acceptable levels in our analysis by masking
clusters of galaxies and imposing angular scale cuts on the two-point
functions. The methodology developed here will be applied to the analysis of
data from the DES, the SPT, and Planck in a companion work.
| astro-ph.CO | optical imaging surveys measure both the galaxy density and the gravitational lensinginduced shear fields across the sky recently the dark energy survey des collaboration used a joint fit to twopoint correlations between these observables to place tight constraints on cosmology des collaboration et al 2017 in this work we develop the methodology to extend the des year one joint probes analysis to include crosscorrelations of the optical survey observables with gravitational lensing of the cosmic microwave background cmb as measured by the south pole telescope spt and planck using simulated analyses we show how the resulting set of five twopoint functions increases the robustness of the cosmological constraints to systematic errors in galaxy lensing shear calibration additionally we show that contamination of the sptplanck cmb lensing map by the thermal sunyaevzeldovich effect is a potentially large source of systematic error for twopoint function analyses but show that it can be reduced to acceptable levels in our analysis by masking clusters of galaxies and imposing angular scale cuts on the twopoint functions the methodology developed here will be applied to the analysis of data from the des the spt and planck in a companion work | [['optical', 'imaging', 'surveys', 'measure', 'both', 'the', 'galaxy', 'density', 'and', 'the', 'gravitational', 'lensinginduced', 'shear', 'fields', 'across', 'the', 'sky', 'recently', 'the', 'dark', 'energy', 'survey', 'des', 'collaboration', 'used', 'a', 'joint', 'fit', 'to', 'twopoint', 'correlations', 'between', 'these', 'observables', 'to', 'place', 'tight', 'constraints', 'on', 'cosmology', 'des', 'collaboration', 'et', 'al', '2017', 'in', 'this', 'work', 'we', 'develop', 'the', 'methodology', 'to', 'extend', 'the', 'des', 'year', 'one', 'joint', 'probes', 'analysis', 'to', 'include', 'crosscorrelations', 'of', 'the', 'optical', 'survey', 'observables', 'with', 'gravitational', 'lensing', 'of', 'the', 'cosmic', 'microwave', 'background', 'cmb', 'as', 'measured', 'by', 'the', 'south', 'pole', 'telescope', 'spt', 'and', 'planck', 'using', 'simulated', 'analyses', 'we', 'show', 'how', 'the', 'resulting', 'set', 'of', 'five', 'twopoint', 'functions', 'increases', 'the', 'robustness', 'of', 'the', 'cosmological', 'constraints', 'to', 'systematic', 'errors', 'in', 'galaxy', 'lensing', 'shear', 'calibration', 'additionally', 'we', 'show', 'that', 'contamination', 'of', 'the', 'sptplanck', 'cmb', 'lensing', 'map', 'by', 'the', 'thermal', 'sunyaevzeldovich', 'effect', 'is', 'a', 'potentially', 'large', 'source', 'of', 'systematic', 'error', 'for', 'twopoint', 'function', 'analyses', 'but', 'show', 'that', 'it', 'can', 'be', 'reduced', 'to', 'acceptable', 'levels', 'in', 'our', 'analysis', 'by', 'masking', 'clusters', 'of', 'galaxies', 'and', 'imposing', 'angular', 'scale', 'cuts', 'on', 'the', 'twopoint', 'functions', 'the', 'methodology', 'developed', 'here', 'will', 'be', 'applied', 'to', 'the', 'analysis', 'of', 'data', 'from', 'the', 'des', 'the', 'spt', 'and', 'planck', 'in', 'a', 'companion', 'work']] | [-0.09471202616270999, 0.05715761411153359, -0.15006473471791787, 0.12560657192253233, -0.10021856629260734, -0.008045375403837141, 0.003966757453437605, 0.3167244677282291, -0.22112650090317035, -0.36770172656508926, 0.07034654475005411, -0.3183546489577528, -0.0984642698593592, 0.22218929449279692, 0.017687571874380574, 0.056946673546314545, 0.06471926194900367, -0.1351013161975485, -0.055254267014736805, -0.3180854503883271, 0.3040195020190754, 0.18470009212705446, 0.2852699192448331, -0.014271088234037933, 0.08824895859582571, -0.006784535074664444, -0.18259891854850044, 0.05793119261615519, -0.19881810505135247, 0.04712577819506942, 0.2449941117837639, 0.16017911335636761, 0.18085795424883422, -0.3402927697327355, -0.20743774792536554, 0.13374213705929913, 0.1289942227641767, 0.13750686102863124, -0.005291549533538019, -0.3496169963286987, 0.03858542442321777, -0.1773551489646339, -0.08745827366612427, -0.047119804951145164, -0.0407716405428367, 0.025596400810926765, -0.23376587123991294, 0.18022930751122784, -0.03284387895897745, 0.05297413132023163, -0.07660951107918947, -0.11106682467452912, -0.04493828934624579, 0.09797336668297263, 0.009240255708000357, 0.0868974223110458, 0.17284369410541622, -0.126625044460751, -0.04686938123922274, 0.3537598699307156, -0.10554025222672815, -0.10396284488430295, 0.12168123283353513, -0.2086746343121975, -0.23345209711543138, 0.03361658697556994, 0.1945227950534975, 0.004944730004768606, -0.18404165472005315, 0.0957741444903894, 0.043525311371451485, 0.21241061628188146, 0.07217506699081887, 0.0331628989222293, 0.30166394834845794, 0.07114515996506737, 0.12425477308742316, 0.10640098931994096, -0.20622077135615283, 0.0420578030825332, -0.2968521962675792, -0.03878541574499768, -0.18613803334572773, 0.038348784604486215, -0.10336121511639583, -0.14246885940297435, 0.36736115363035643, 0.16611952294952628, 0.1812111873534349, 0.07936606049242699, 0.36127502055249994, 0.03622463664742382, 0.09180508327002063, -0.0009629306590927697, 0.34187450908471884, 0.12563037414856526, 0.09961243214536883, -0.2316274719344153, -0.03522989133353601, -0.005541407260706002] |
1,802.05258 | A Multi-Wavelength Analysis of Annihilating Dark Matter as the Origin of
the Gamma-Ray Emission from M31 | [Abridged] Indirect detection of dark matter (DM) by multi-wavelength
astronomical observations provides a promising avenue for probing the particle
nature of DM. In the case of DM consisting of Weakly-Interacting Massive
Particles (WIMPs), self-annihilation ultimately produces observable products
including $e^{\pm}$ pairs and gamma rays. The gamma rays can be detected
directly, while the $e^{\pm}$ pairs can be detected by radio emission from
synchrotron radiation or X-rays and soft gamma rays from inverse Compton
scattering. An intriguing region to search for astrophysical signs of DM is the
Galactic center (GC) of the Milky Way, due in part to an observed excess of
gamma-rays that could be DM. A recent observation by the Fermi-LAT
collaboration of a similar excess in the central region of the Andromeda galaxy
(M31) leads us to explore the possibility of a DM-induced signal there as well.
We use the RX-DMFIT tool to perform a multi-frequency analysis of potential DM
annihilation emissions in M31. We consider WIMP models consistent with the GC
excess and calculate the expected emission across the electromagnetic spectrum
in comparison with available observational data from M31. We find that the
particle models that best fit the M31 excess favor lower masses than the GC
excess. The best fitting models are for a $b\bar{b}$ final state with
$M_{\chi}=11$ GeV and $\left<\sigma v\right>=2.6\times 10^{-26}$
cm$^3$s$^{-1}$, as well as an evenly mixed $b\bar{b}/\tau^+\tau^-$ final state
with $M_{\chi}=5.8$ GeV and $\left<\sigma v\right>=2.03\times 10^{-26}$
cm$^3$s$^{-1}$. For conservative estimates of the diffusion and magnetic field
models the expected radio emissions appear to be in tension with currently
available data in the central region of M31, although this constraint has a
fairly strong dependence on the values chosen for parameters describing the
magnetic field strength and geometry.
| astro-ph.HE astro-ph.CO hep-ph | abridged indirect detection of dark matter dm by multiwavelength astronomical observations provides a promising avenue for probing the particle nature of dm in the case of dm consisting of weaklyinteracting massive particles wimps selfannihilation ultimately produces observable products including epm pairs and gamma rays the gamma rays can be detected directly while the epm pairs can be detected by radio emission from synchrotron radiation or xrays and soft gamma rays from inverse compton scattering an intriguing region to search for astrophysical signs of dm is the galactic center gc of the milky way due in part to an observed excess of gammarays that could be dm a recent observation by the fermilat collaboration of a similar excess in the central region of the andromeda galaxy m31 leads us to explore the possibility of a dminduced signal there as well we use the rxdmfit tool to perform a multifrequency analysis of potential dm annihilation emissions in m31 we consider wimp models consistent with the gc excess and calculate the expected emission across the electromagnetic spectrum in comparison with available observational data from m31 we find that the particle models that best fit the m31 excess favor lower masses than the gc excess the best fitting models are for a bbarb final state with m_chi11 gev and leftsigma vright26times 1026 cm3s1 as well as an evenly mixed bbarbtautau final state with m_chi58 gev and leftsigma vright203times 1026 cm3s1 for conservative estimates of the diffusion and magnetic field models the expected radio emissions appear to be in tension with currently available data in the central region of m31 although this constraint has a fairly strong dependence on the values chosen for parameters describing the magnetic field strength and geometry | [['abridged', 'indirect', 'detection', 'of', 'dark', 'matter', 'dm', 'by', 'multiwavelength', 'astronomical', 'observations', 'provides', 'a', 'promising', 'avenue', 'for', 'probing', 'the', 'particle', 'nature', 'of', 'dm', 'in', 'the', 'case', 'of', 'dm', 'consisting', 'of', 'weaklyinteracting', 'massive', 'particles', 'wimps', 'selfannihilation', 'ultimately', 'produces', 'observable', 'products', 'including', 'epm', 'pairs', 'and', 'gamma', 'rays', 'the', 'gamma', 'rays', 'can', 'be', 'detected', 'directly', 'while', 'the', 'epm', 'pairs', 'can', 'be', 'detected', 'by', 'radio', 'emission', 'from', 'synchrotron', 'radiation', 'or', 'xrays', 'and', 'soft', 'gamma', 'rays', 'from', 'inverse', 'compton', 'scattering', 'an', 'intriguing', 'region', 'to', 'search', 'for', 'astrophysical', 'signs', 'of', 'dm', 'is', 'the', 'galactic', 'center', 'gc', 'of', 'the', 'milky', 'way', 'due', 'in', 'part', 'to', 'an', 'observed', 'excess', 'of', 'gammarays', 'that', 'could', 'be', 'dm', 'a', 'recent', 'observation', 'by', 'the', 'fermilat', 'collaboration', 'of', 'a', 'similar', 'excess', 'in', 'the', 'central', 'region', 'of', 'the', 'andromeda', 'galaxy', 'm31', 'leads', 'us', 'to', 'explore', 'the', 'possibility', 'of', 'a', 'dminduced', 'signal', 'there', 'as', 'well', 'we', 'use', 'the', 'rxdmfit', 'tool', 'to', 'perform', 'a', 'multifrequency', 'analysis', 'of', 'potential', 'dm', 'annihilation', 'emissions', 'in', 'm31', 'we', 'consider', 'wimp', 'models', 'consistent', 'with', 'the', 'gc', 'excess', 'and', 'calculate', 'the', 'expected', 'emission', 'across', 'the', 'electromagnetic', 'spectrum', 'in', 'comparison', 'with', 'available', 'observational', 'data', 'from', 'm31', 'we', 'find', 'that', 'the', 'particle', 'models', 'that', 'best', 'fit', 'the', 'm31', 'excess', 'favor', 'lower', 'masses', 'than', 'the', 'gc', 'excess', 'the', 'best', 'fitting', 'models', 'are', 'for', 'a', 'bbarb', 'final', 'state', 'with', 'm_chi11', 'gev', 'and', 'leftsigma', 'vright26times', '1026', 'cm3s1', 'as', 'well', 'as', 'an', 'evenly', 'mixed', 'bbarbtautau', 'final', 'state', 'with', 'm_chi58', 'gev', 'and', 'leftsigma', 'vright203times', '1026', 'cm3s1', 'for', 'conservative', 'estimates', 'of', 'the', 'diffusion', 'and', 'magnetic', 'field', 'models', 'the', 'expected', 'radio', 'emissions', 'appear', 'to', 'be', 'in', 'tension', 'with', 'currently', 'available', 'data', 'in', 'the', 'central', 'region', 'of', 'm31', 'although', 'this', 'constraint', 'has', 'a', 'fairly', 'strong', 'dependence', 'on', 'the', 'values', 'chosen', 'for', 'parameters', 'describing', 'the', 'magnetic', 'field', 'strength', 'and', 'geometry']] | [-0.055268057647610336, 0.14537825236559956, -0.07368134814710851, 0.15553207102323327, -0.11249606931872719, -0.06299301084258564, 0.03172479377826676, 0.37752989022365063, -0.2016216004597591, -0.3768173168406736, 0.0054245029517502276, -0.32089463332238616, 0.030406324433142992, 0.22175355148518208, 0.05380778999040184, -0.01573416608601853, 0.06471884016860739, -0.018462846480006127, 0.006266860519238609, -0.19154341687681153, 0.25705758286169433, 0.12312197891404152, 0.1841987410813309, 0.02471707048264484, 0.04893969860446395, -0.019744530905340302, -0.05454390488749911, -0.07648860306663981, -0.11033951055383082, 0.0900805903047964, 0.23222664306552276, 0.10441373825628072, 0.11324523222312358, -0.365145778161282, -0.23259321578437955, 0.1797186003334107, 0.19658556774114952, 0.017324477036612385, -0.09739586956145123, -0.33211380558943787, 0.05172628577565774, -0.21442013791207462, -0.1582263059223051, 0.04169982201948181, 0.019523301314569166, 0.0015936257387428867, -0.255247062237286, 0.13188023218849562, -0.01183899377756719, -0.007567938051127881, -0.12015061743280038, -0.11404019315951629, -0.0057204195689608125, 0.018969189422700476, 0.09228559734187491, 0.05768791493936607, 0.20526907940276284, -0.167126148322792, -0.11021163064411822, 0.4025165114191803, -0.11056037390125124, -0.045131770672659714, 0.20566765452072136, -0.184447731446237, -0.16628702478285165, 0.17261813668012355, 0.1632661929771846, 0.06188043645180181, -0.18454229644853093, 0.1045321078997036, -0.03396562894588297, 0.17417591719405975, 0.034078662283718586, 0.037282243020577005, 0.33092119508581436, 0.14006016102820926, 0.07361141366864297, 0.09014100871909185, -0.21597415895501798, -0.013797112315371368, -0.3050315822672812, -0.10541924867710488, -0.12417206483569446, 0.07894938890797462, -0.08904838477631251, -0.08889917149092896, 0.34687270443549656, 0.11417592783683105, 0.2521304250075581, 0.00681780742104446, 0.3226147695520483, 0.08265259237637981, 0.06716030279458468, 0.09121465231275437, 0.3451973285512827, 0.14887140998253534, 0.0763016877578677, -0.18239846026297024, 0.05439779155987566, -0.059008427419210946] |
1,802.05259 | Predicting Scattering Scanning Near-field Optical Microscopy of
Mass-produced Plasmonic Devices | Scattering scanning near-field optical microscopy enables optical imaging and
characterization of plasmonic devices with nanometer-scale resolution well
below the diffraction limit. This technique enables developers to probe and
understand the waveguide-coupled plasmonic antenna in as-fabricated
heat-assisted magnetic recording heads. In order validate and predict results
and to extract information from experimental measurements that is physically
comparable to simulations, a model was developed to translate the simulated
electric field into expected near-field measurements using physical parameters
specific to scattering scanning near-field optical microscopy physics. The
methods used in this paper prove that scattering scanning near-field optical
microscopy can be used to determine critical sub-diffraction-limited dimensions
of optical field confinement, which is a crucial metrology requirement for the
future of nano-optics, semiconductor photonic devices, and biological sensing
where the near-field character of light is fundamental to device operation.
| physics.optics physics.app-ph | scattering scanning nearfield optical microscopy enables optical imaging and characterization of plasmonic devices with nanometerscale resolution well below the diffraction limit this technique enables developers to probe and understand the waveguidecoupled plasmonic antenna in asfabricated heatassisted magnetic recording heads in order validate and predict results and to extract information from experimental measurements that is physically comparable to simulations a model was developed to translate the simulated electric field into expected nearfield measurements using physical parameters specific to scattering scanning nearfield optical microscopy physics the methods used in this paper prove that scattering scanning nearfield optical microscopy can be used to determine critical subdiffractionlimited dimensions of optical field confinement which is a crucial metrology requirement for the future of nanooptics semiconductor photonic devices and biological sensing where the nearfield character of light is fundamental to device operation | [['scattering', 'scanning', 'nearfield', 'optical', 'microscopy', 'enables', 'optical', 'imaging', 'and', 'characterization', 'of', 'plasmonic', 'devices', 'with', 'nanometerscale', 'resolution', 'well', 'below', 'the', 'diffraction', 'limit', 'this', 'technique', 'enables', 'developers', 'to', 'probe', 'and', 'understand', 'the', 'waveguidecoupled', 'plasmonic', 'antenna', 'in', 'asfabricated', 'heatassisted', 'magnetic', 'recording', 'heads', 'in', 'order', 'validate', 'and', 'predict', 'results', 'and', 'to', 'extract', 'information', 'from', 'experimental', 'measurements', 'that', 'is', 'physically', 'comparable', 'to', 'simulations', 'a', 'model', 'was', 'developed', 'to', 'translate', 'the', 'simulated', 'electric', 'field', 'into', 'expected', 'nearfield', 'measurements', 'using', 'physical', 'parameters', 'specific', 'to', 'scattering', 'scanning', 'nearfield', 'optical', 'microscopy', 'physics', 'the', 'methods', 'used', 'in', 'this', 'paper', 'prove', 'that', 'scattering', 'scanning', 'nearfield', 'optical', 'microscopy', 'can', 'be', 'used', 'to', 'determine', 'critical', 'subdiffractionlimited', 'dimensions', 'of', 'optical', 'field', 'confinement', 'which', 'is', 'a', 'crucial', 'metrology', 'requirement', 'for', 'the', 'future', 'of', 'nanooptics', 'semiconductor', 'photonic', 'devices', 'and', 'biological', 'sensing', 'where', 'the', 'nearfield', 'character', 'of', 'light', 'is', 'fundamental', 'to', 'device', 'operation']] | [-0.0937161908197381, 0.12061080961104702, -0.0768859011175878, -8.96638264427619e-05, -0.09273653525708463, -0.19512051209697828, 0.024552579360555254, 0.46011075696579234, -0.2815720065828988, -0.3340335740358569, 0.03170067555123858, -0.3032327863997232, -0.17931729577043476, 0.295461783403024, -0.02326357549891862, 0.12875820100581384, -0.004436034633887603, -0.07102368214777123, 0.008534299154930255, -0.11771993623936877, 0.21166594143131293, 0.09012253029076793, 0.36927922689081993, 0.12775034131482244, 0.07321217300384031, 0.0836514415774111, 0.008278827332747717, -0.009993456225321792, -0.15138414217985616, 0.14588955015984967, 0.30736760156030546, 0.004546952574267326, 0.1854453071445117, -0.5210075733142302, -0.2556421489057624, 0.021461105741175688, 0.20225189353668077, 0.12145510172515916, -0.08614551293602049, -0.2715806699193576, 0.05798533990395406, -0.0413376449210131, -0.11827439909286434, -0.13333236580878935, -0.053113679167033884, 0.02600681731265093, -0.2733495770889396, -0.008403774837086745, -0.059245800805750634, 0.09329253320089158, -0.08890108955507886, 0.013999505036147586, 0.04909342973020531, 0.13256757900457802, -0.06775853493822712, 0.024017563814756133, 0.2324566696119933, -0.14783358284244863, -0.12172565188067143, 0.3839049738735947, -0.018552347712102346, -0.092408870894681, 0.176770575948895, -0.21818308261358385, 0.011684845355750225, 0.13478030807763228, 0.16837254314861425, 0.10989780496781938, -0.1905354256878662, 0.029240833373264382, 0.01551016534144497, 0.23852834026740097, 0.12433285759984489, 0.1397565070519169, 0.23637660104877262, 0.23378764459972873, 0.009261904099463102, 0.11752899632162606, -0.19602187836083912, 0.031799199819729174, -0.19928804471034228, -0.16917508281082572, -0.22039384676677667, 0.08048967927628409, -0.06547190087386458, -0.1296659156899242, 0.33584395763190356, 0.2460401607900969, 0.10107538362567806, -0.07171299941204351, 0.42975808373268914, 0.07045004480716992, 0.139432777534239, -0.05926783537314109, 0.29208840707810046, 0.20142166082993807, 0.16827398216735354, -0.2662062257209875, -0.025256749918780234, -0.039430425250697336] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.