id float64 706 1.8k | title stringlengths 1 343 | abstract stringlengths 6 6.09k | categories stringlengths 5 125 | processed_abstract stringlengths 2 5.96k | tokenized_abstract stringlengths 8 8.74k | centroid stringlengths 2.1k 2.17k |
|---|---|---|---|---|---|---|
1,803.03267 | Resonating valence bonds and spinon pairing in the Dicke model | Resonating valence bond (RVB) states are a class of entangled quantum many
body wavefunctions with great significance in condensed matter physics. We
propose a scheme to synthesize a family of RVB states using a cavity QED setup
with two-level atoms (with states $\vert 0 \rangle$ and $\vert 1 \rangle$)
coupled to a common photon mode. In the lossy cavity limit, starting with an
initial state of $M$ atoms excited and $N$ atoms in the ground state, we show
that this setup can be configured as a Stern Gerlach experiment. A measurement
of photon emission collapses the wavefunction of atoms onto an RVB state
composed of resonating long-ranged singlets of the form
$\frac{1}{\sqrt{2}}[\vert 0 1 \rangle - \vert 1 0 \rangle]$. Each emitted
photon reduces the number of singlets by unity, replacing it with a pair of
lone spins or `spinons'. As spinons are formed coherently in pairs, they are
analogous to Cooper pairs in a superconductor. To simulate pair fluctuations,
we propose a protocol in which photons are allowed to escape the cavity
undetected. This leads to a mixed quantum state with a fluctuating number of
spinon pairs -- an inchoate superconductor. Remarkably, in the limit of large
system sizes, this protocol reveals an underlying quantum phase transition.
Upon tuning the initial spin polarization ($M-N$), the emission exhibits a
continuous transition from a dark state to a bright state. This is reflected in
the spinon pair number distribution which can be tuned from sub-poissonian to
super-poissonian regimes. This opens an exciting route to simulate RVB states
and superconductivity.
| quant-ph cond-mat.supr-con | resonating valence bond rvb states are a class of entangled quantum many body wavefunctions with great significance in condensed matter physics we propose a scheme to synthesize a family of rvb states using a cavity qed setup with twolevel atoms with states vert 0 rangle and vert 1 rangle coupled to a common photon mode in the lossy cavity limit starting with an initial state of m atoms excited and n atoms in the ground state we show that this setup can be configured as a stern gerlach experiment a measurement of photon emission collapses the wavefunction of atoms onto an rvb state composed of resonating longranged singlets of the form frac1sqrt2vert 0 1 rangle vert 1 0 rangle each emitted photon reduces the number of singlets by unity replacing it with a pair of lone spins or spinons as spinons are formed coherently in pairs they are analogous to cooper pairs in a superconductor to simulate pair fluctuations we propose a protocol in which photons are allowed to escape the cavity undetected this leads to a mixed quantum state with a fluctuating number of spinon pairs an inchoate superconductor remarkably in the limit of large system sizes this protocol reveals an underlying quantum phase transition upon tuning the initial spin polarization mn the emission exhibits a continuous transition from a dark state to a bright state this is reflected in the spinon pair number distribution which can be tuned from subpoissonian to superpoissonian regimes this opens an exciting route to simulate rvb states and superconductivity | [['resonating', 'valence', 'bond', 'rvb', 'states', 'are', 'a', 'class', 'of', 'entangled', 'quantum', 'many', 'body', 'wavefunctions', 'with', 'great', 'significance', 'in', 'condensed', 'matter', 'physics', 'we', 'propose', 'a', 'scheme', 'to', 'synthesize', 'a', 'family', 'of', 'rvb', 'states', 'using', 'a', 'cavity', 'qed', 'setup', 'with', 'twolevel', 'atoms', 'with', 'states', 'vert', '0', 'rangle', 'and', 'vert', '1', 'rangle', 'coupled', 'to', 'a', 'common', 'photon', 'mode', 'in', 'the', 'lossy', 'cavity', 'limit', 'starting', 'with', 'an', 'initial', 'state', 'of', 'm', 'atoms', 'excited', 'and', 'n', 'atoms', 'in', 'the', 'ground', 'state', 'we', 'show', 'that', 'this', 'setup', 'can', 'be', 'configured', 'as', 'a', 'stern', 'gerlach', 'experiment', 'a', 'measurement', 'of', 'photon', 'emission', 'collapses', 'the', 'wavefunction', 'of', 'atoms', 'onto', 'an', 'rvb', 'state', 'composed', 'of', 'resonating', 'longranged', 'singlets', 'of', 'the', 'form', 'frac1sqrt2vert', '0', '1', 'rangle', 'vert', '1', '0', 'rangle', 'each', 'emitted', 'photon', 'reduces', 'the', 'number', 'of', 'singlets', 'by', 'unity', 'replacing', 'it', 'with', 'a', 'pair', 'of', 'lone', 'spins', 'or', 'spinons', 'as', 'spinons', 'are', 'formed', 'coherently', 'in', 'pairs', 'they', 'are', 'analogous', 'to', 'cooper', 'pairs', 'in', 'a', 'superconductor', 'to', 'simulate', 'pair', 'fluctuations', 'we', 'propose', 'a', 'protocol', 'in', 'which', 'photons', 'are', 'allowed', 'to', 'escape', 'the', 'cavity', 'undetected', 'this', 'leads', 'to', 'a', 'mixed', 'quantum', 'state', 'with', 'a', 'fluctuating', 'number', 'of', 'spinon', 'pairs', 'an', 'inchoate', 'superconductor', 'remarkably', 'in', 'the', 'limit', 'of', 'large', 'system', 'sizes', 'this', 'protocol', 'reveals', 'an', 'underlying', 'quantum', 'phase', 'transition', 'upon', 'tuning', 'the', 'initial', 'spin', 'polarization', 'mn', 'the', 'emission', 'exhibits', 'a', 'continuous', 'transition', 'from', 'a', 'dark', 'state', 'to', 'a', 'bright', 'state', 'this', 'is', 'reflected', 'in', 'the', 'spinon', 'pair', 'number', 'distribution', 'which', 'can', 'be', 'tuned', 'from', 'subpoissonian', 'to', 'superpoissonian', 'regimes', 'this', 'opens', 'an', 'exciting', 'route', 'to', 'simulate', 'rvb', 'states', 'and', 'superconductivity']] | [-0.17216403625321156, 0.3179936950065894, -0.062289467033035326, 0.0330016756534129, 0.024248500140018614, -0.20365631853358127, 0.0802797008141437, 0.3649612901878415, -0.23611975772781116, -0.25937987331246193, -0.06473140224732239, -0.3559123283087769, -0.007848401333424536, 0.11403656892624556, 0.02673862035587138, 0.015847207585294894, 0.030571150241930987, 0.00509212500707922, -0.0551254424293909, -0.18896541866912123, 0.2851648227091965, -0.01579492997706813, 0.2859467966299431, 0.01226642138014237, 0.06926647338322273, -0.00015426253005131787, 0.15874248696125898, -0.05719307003287124, -0.08706722414482261, 0.07088352627321785, 0.25353204357328224, 0.03334133227848831, 0.22972322778831072, -0.4002194782938151, -0.1655584952799722, 0.09916806593354718, 0.17815757983948524, 0.17624243890830116, -0.037470403703171576, -0.35130470533325686, -0.011709902929963873, -0.2075498473830521, -0.16781449930961517, -0.055696754304546056, -0.00027297396468473414, -0.03350652807629576, -0.2808825223323177, 0.07957710303804454, 0.03463569151548048, -0.01129111815609184, -0.002344431650514404, -0.08254739306730163, -0.052776055717292956, 0.0377668855611381, -0.023392909178145085, 0.10094714567667859, 0.1332933749939662, -0.16278467323841053, -0.1416593417589206, 0.3501263093191893, -0.08272737947420454, -0.15959955060891076, 0.16104500227443436, -0.13178339064869957, -0.0736994450144908, 0.16843495252816115, 0.10618785843253135, 0.1066305283758351, -0.08184384344255223, 0.040162047673833974, -0.062127130973499776, 0.24633101804328023, 0.030751765007153153, 0.12501382431672775, 0.2728238402920611, 0.14364548566495525, 0.04457098337999709, 0.19698911488658805, -0.10370776150101686, -0.10441851690137649, -0.3047409695883592, -0.18108789451539006, -0.2546820726942992, 0.12775016853622362, -0.006117083791326092, -0.1548881180109639, 0.37886032993023855, 0.09525164501449349, 0.18915950406306223, -0.037943277560064895, 0.20703395449136403, 0.10404800117362802, 0.031956928093716794, 0.05540726346959013, 0.21519497952369207, 0.1694697179986785, 0.03106862121882538, -0.2599835377748069, -0.007498779898057418, 0.025727094286212733] |
1,803.03268 | $\boldsymbol{\Omega_b^- \to (\Xi_c^+ \, K^-) \, \pi^-}$ and the
$\boldsymbol{\Omega_c}$ states | We study the weak decay $\Omega_b^- \to (\Xi_c^+ \, K^-) \, \pi^-$, in view
of the narrow $\Omega_c$ states recently measured by the LHCb collaboration and
later confirmed by the Belle collaboration. The $\Omega_c(3050)$ and
$\Omega_c(3090)$ are described as meson-baryon molecular states, using an
extension of the local hidden gauge approach in coupled channels. We
investigate the $\Xi D$, $\Xi_c \bar K$ and $\Xi_c^\prime \bar K$ invariant
mass distributions making predictions that could be confronted with future
experiments, providing useful information that could help determine the quantum
numbers and nature of these states.
| hep-ph | we study the weak decay omega_b to xi_c k pi in view of the narrow omega_c states recently measured by the lhcb collaboration and later confirmed by the belle collaboration the omega_c3050 and omega_c3090 are described as mesonbaryon molecular states using an extension of the local hidden gauge approach in coupled channels we investigate the xi d xi_c bar k and xi_cprime bar k invariant mass distributions making predictions that could be confronted with future experiments providing useful information that could help determine the quantum numbers and nature of these states | [['we', 'study', 'the', 'weak', 'decay', 'omega_b', 'to', 'xi_c', 'k', 'pi', 'in', 'view', 'of', 'the', 'narrow', 'omega_c', 'states', 'recently', 'measured', 'by', 'the', 'lhcb', 'collaboration', 'and', 'later', 'confirmed', 'by', 'the', 'belle', 'collaboration', 'the', 'omega_c3050', 'and', 'omega_c3090', 'are', 'described', 'as', 'mesonbaryon', 'molecular', 'states', 'using', 'an', 'extension', 'of', 'the', 'local', 'hidden', 'gauge', 'approach', 'in', 'coupled', 'channels', 'we', 'investigate', 'the', 'xi', 'd', 'xi_c', 'bar', 'k', 'and', 'xi_cprime', 'bar', 'k', 'invariant', 'mass', 'distributions', 'making', 'predictions', 'that', 'could', 'be', 'confronted', 'with', 'future', 'experiments', 'providing', 'useful', 'information', 'that', 'could', 'help', 'determine', 'the', 'quantum', 'numbers', 'and', 'nature', 'of', 'these', 'states']] | [-0.14377271022729493, 0.24046212122254304, -0.10203752195933363, 0.08942166790570859, -0.0396977753511497, -0.17670021165203262, 0.06896760054495554, 0.30659474821052524, -0.20587171600865467, -0.2726867469488183, -0.014328852364957168, -0.32812423142348673, -0.03880889781822379, 0.10565729356744419, 0.10997935158589466, 0.10859665081703238, 0.06726053015042383, 0.011582132602867844, -0.0062279335970243255, -0.18570165704567354, 0.2942770294087765, 0.05475672477073353, 0.19610472464586023, 0.08374737024276548, -0.040586143967460145, -0.02497142612688489, -0.04964500162392282, -0.026877257653133393, -0.19256246677944616, 0.0812514787443893, 0.2572932406507719, 0.13441532841566337, 0.16439469189864103, -0.3660025222759162, -0.1413545663376431, 0.11009585176809476, 0.18813340651551977, 0.061583413156568186, -0.0015308937533748347, -0.4555367367280709, 0.15157547158862025, -0.1430090334941889, -0.16023703583306378, -0.11599610312227773, 0.04240839157744751, -0.06694639099833484, -0.28240936155338864, 0.08124305550674242, -0.057559897120821976, 0.06422196834215096, -0.026544570682345184, -0.23146519382039066, -0.04258196381852031, 0.05411195726348804, 0.021332283804940243, 0.0957774163011441, 0.15265849519746152, -0.13204703799441792, -0.1661123651090068, 0.325827439018822, -0.10538994531648663, -0.13520812470680818, 0.14973148758456642, -0.15155975946358272, -0.12048211852907316, 0.095394712849776, 0.13888845582247025, 0.038500197195949465, -0.14219424725704632, 0.09054640671348642, -0.0566970063782819, 0.15128502710261843, 0.08202206095997858, 0.10207341853938587, 0.20589938168068528, 0.11958339227911002, -0.0482164756241408, 0.07570249919656787, -0.07423812525531093, -0.08080513797352439, -0.3182190311560919, -0.1290255986502046, -0.12919378755639746, 0.0750756918677835, 0.004820633342535655, 0.013596674754888146, 0.34228920011402486, 0.06904787207431681, 0.3217535729745178, -0.021642174367066266, 0.20505307025306826, 0.0863170557243463, 0.05101018235251144, 0.07736193525840293, 0.2577845415734983, 0.24352244289776126, 0.07704049989499234, -0.2757710825682587, 0.051583568299455304, -0.03345257873329651] |
1,803.03269 | Exploring the Dust Content of Galactic Winds With Herschel. II. Nearby
Dwarf Galaxies | We present the results from an analysis of deep Herschel Space Observatory
observations of six nearby dwarf galaxies known to host galactic-scale winds.
The superior far-infrared sensitivity and angular resolution of Herschel have
allowed detection of cold circumgalactic dust features beyond the stellar
components of the host galaxies traced by Spitzer 4.5 $\mu$m images.
Comparisons of these cold dust features with ancillary data reveal an imperfect
spatial correlation with the ionized gas and warm dust wind components. We find
that typically $\sim$10-20\% of the total dust mass in these galaxies resides
outside of their stellar disks, but this fraction reaches $\sim$60\% in the
case of NGC 1569. This galaxy also has the largest metallicity (O/H) deficit in
our sample for its stellar mass. Overall, the small number of objects in our
sample precludes drawing strong conclusions on the origin of the circumgalactic
dust. We detect no statistically significant trends with star formation
properties of the host galaxies, as might be expected if the dust were lifted
above the disk by energy inputs from on-going star formation activity. Although
a case for dust entrained in a galactic wind is seen in NGC 1569, in all cases,
we cannot rule out the possibility that some of the circumgalactic dust might
be associated instead with gas accreted or removed from the disk by recent
galaxy interaction events, or that it is part of the outer gas-rich portion of
the disk that lies below the sensitivity limit of the Spitzer 4.5 $\mu$m data.
| astro-ph.GA | we present the results from an analysis of deep herschel space observatory observations of six nearby dwarf galaxies known to host galacticscale winds the superior farinfrared sensitivity and angular resolution of herschel have allowed detection of cold circumgalactic dust features beyond the stellar components of the host galaxies traced by spitzer 45 mum images comparisons of these cold dust features with ancillary data reveal an imperfect spatial correlation with the ionized gas and warm dust wind components we find that typically sim1020 of the total dust mass in these galaxies resides outside of their stellar disks but this fraction reaches sim60 in the case of ngc 1569 this galaxy also has the largest metallicity oh deficit in our sample for its stellar mass overall the small number of objects in our sample precludes drawing strong conclusions on the origin of the circumgalactic dust we detect no statistically significant trends with star formation properties of the host galaxies as might be expected if the dust were lifted above the disk by energy inputs from ongoing star formation activity although a case for dust entrained in a galactic wind is seen in ngc 1569 in all cases we cannot rule out the possibility that some of the circumgalactic dust might be associated instead with gas accreted or removed from the disk by recent galaxy interaction events or that it is part of the outer gasrich portion of the disk that lies below the sensitivity limit of the spitzer 45 mum data | [['we', 'present', 'the', 'results', 'from', 'an', 'analysis', 'of', 'deep', 'herschel', 'space', 'observatory', 'observations', 'of', 'six', 'nearby', 'dwarf', 'galaxies', 'known', 'to', 'host', 'galacticscale', 'winds', 'the', 'superior', 'farinfrared', 'sensitivity', 'and', 'angular', 'resolution', 'of', 'herschel', 'have', 'allowed', 'detection', 'of', 'cold', 'circumgalactic', 'dust', 'features', 'beyond', 'the', 'stellar', 'components', 'of', 'the', 'host', 'galaxies', 'traced', 'by', 'spitzer', '45', 'mum', 'images', 'comparisons', 'of', 'these', 'cold', 'dust', 'features', 'with', 'ancillary', 'data', 'reveal', 'an', 'imperfect', 'spatial', 'correlation', 'with', 'the', 'ionized', 'gas', 'and', 'warm', 'dust', 'wind', 'components', 'we', 'find', 'that', 'typically', 'sim1020', 'of', 'the', 'total', 'dust', 'mass', 'in', 'these', 'galaxies', 'resides', 'outside', 'of', 'their', 'stellar', 'disks', 'but', 'this', 'fraction', 'reaches', 'sim60', 'in', 'the', 'case', 'of', 'ngc', '1569', 'this', 'galaxy', 'also', 'has', 'the', 'largest', 'metallicity', 'oh', 'deficit', 'in', 'our', 'sample', 'for', 'its', 'stellar', 'mass', 'overall', 'the', 'small', 'number', 'of', 'objects', 'in', 'our', 'sample', 'precludes', 'drawing', 'strong', 'conclusions', 'on', 'the', 'origin', 'of', 'the', 'circumgalactic', 'dust', 'we', 'detect', 'no', 'statistically', 'significant', 'trends', 'with', 'star', 'formation', 'properties', 'of', 'the', 'host', 'galaxies', 'as', 'might', 'be', 'expected', 'if', 'the', 'dust', 'were', 'lifted', 'above', 'the', 'disk', 'by', 'energy', 'inputs', 'from', 'ongoing', 'star', 'formation', 'activity', 'although', 'a', 'case', 'for', 'dust', 'entrained', 'in', 'a', 'galactic', 'wind', 'is', 'seen', 'in', 'ngc', '1569', 'in', 'all', 'cases', 'we', 'can', 'not', 'rule', 'out', 'the', 'possibility', 'that', 'some', 'of', 'the', 'circumgalactic', 'dust', 'might', 'be', 'associated', 'instead', 'with', 'gas', 'accreted', 'or', 'removed', 'from', 'the', 'disk', 'by', 'recent', 'galaxy', 'interaction', 'events', 'or', 'that', 'it', 'is', 'part', 'of', 'the', 'outer', 'gasrich', 'portion', 'of', 'the', 'disk', 'that', 'lies', 'below', 'the', 'sensitivity', 'limit', 'of', 'the', 'spitzer', '45', 'mum', 'data']] | [-0.05117963032668922, 0.08278101390704978, -0.04348831478413195, 0.06833175497874618, -0.08604536276683211, 0.0032695470228791238, 0.037323481255210934, 0.43639129275083544, -0.1617493727169931, -0.34694991836627015, 0.04685216889111325, -0.31329848820902406, -0.01606368685187772, 0.17132882327120752, -0.03508578280359507, -0.05037277096247999, 0.05050986302550882, -0.1426539216088131, -0.015008103200932965, -0.2930871456205787, 0.31476562995649876, 0.10428504668909591, 0.10133236479468179, -0.008095580205321312, 0.05755785351246595, -0.14638512001093476, -0.10046640101075173, -0.04591052349151141, -0.14717137739306782, 0.03203522306680679, 0.24505334833287634, 0.13216169592132793, 0.22464476973935962, -0.38251070343673926, -0.23688758742809296, 0.09447575723240152, 0.19830451120156795, 0.021367525834590197, -0.07837464879872277, -0.26977571794530375, 0.03579416615050286, -0.17296865735203026, -0.19797760825324803, 0.08540936248749495, 0.036386266640154645, 0.007569158877420705, -0.18988790426868946, 0.14948276229563634, 0.05078230245038867, 0.11356359869765584, -0.12348910431703553, -0.09821488173864781, -0.1256116490047425, 0.07269309047982096, 0.011693166291108354, 0.07383185789920389, 0.25972037318348884, -0.16792623829655348, 0.028064702216768638, 0.4087896222397685, -0.08148583413241431, 0.004871879890561104, 0.26694606930110604, -0.24626291866600514, -0.17463083383068442, 0.17023212656826944, 0.14065319134294987, 0.07881929390132428, -0.1512426819865941, 0.018029217997100205, -0.09580138090625405, 0.23801510149077512, 0.042035873235203323, 0.1013791011866415, 0.37279506877809765, 0.0911053277766332, 0.04773627291893354, 0.11397043615207077, -0.25715456113242546, -0.04463479974772781, -0.22745803308824544, -0.10391034243255853, -0.15452257364289834, 0.09452149167616153, -0.16087650639924686, -0.07741615163488313, 0.2869320627376437, 0.1281073303576559, 0.24954208057466895, 0.03464766077883542, 0.34419635888561606, 0.029352956674993037, 0.14283657616283746, 0.14993160846084355, 0.3307363060178468, 0.1491918118740432, 0.07932531512854621, -0.2593810657944996, 0.10322650027321652, -0.04083833727287128] |
1,803.0327 | Delivery of organics to Mars through asteroid and comet impacts | Given rapid photodissociation and photodegradation, the recently discovered
organics in the Martian subsurface and atmosphere were probably delivered in
geologically recent times. Possible parent bodies are C-type asteroids, comets,
and interplanetary dust particles (IDPs). The dust infall rate was estimated,
using different methods, to be between $0.71$ and $2.96 \times 10^6$ kg/yr
(Nesvorny et al., 2011, Borin et al., 2017, Crismani et al., 2017); assuming a
carbon content of 10% (Flynn, 1996), this implies an IDP carbon flux of $0.07 -
0.3 \times 10^6$ kg/yr. We calculate for the first time the carbon flux from
impacts of asteroids and comets. To this end, we perform dynamical simulations
of impact rates on Mars. We use the N-body integrator RMVS/Swifter to propagate
the Sun and the eight planets from their current positions. We separately add
comets and asteroids to the simulations as massless test particles, based on
their current orbital elements, yielding Mars impact rates of
$4.34\times10^{-3}$ comets/Myr and 3.3 asteroids/Myr. We estimate the global
carbon flux on Mars from cometary impacts to be $\sim 0.013 \times
10^{6}$~kg/yr within an order of magnitude, while asteroids deliver $\sim 0.05
\times 10^6$~kg/yr. These values correspond to $\sim 4-19 \%$ and $\sim 17-71
\%$, respectively, of the IDP-borne carbon flux estimated by Nesvorny et al.
2011, Borin et al. 2017 and Crismani et al. 2017. Unlike the spatially
homogeneous IDP infall, impact ejecta are distributed locally, concentrated
around the impact site. We find organics from asteroids and comets to dominate
over IDP-borne organics at distances up to 150~km from the crater center. Our
results may be important for the interpretation of in situ detections of
organics on Mars.
| astro-ph.EP | given rapid photodissociation and photodegradation the recently discovered organics in the martian subsurface and atmosphere were probably delivered in geologically recent times possible parent bodies are ctype asteroids comets and interplanetary dust particles idps the dust infall rate was estimated using different methods to be between 071 and 296 times 106 kgyr nesvorny et al 2011 borin et al 2017 crismani et al 2017 assuming a carbon content of 10 flynn 1996 this implies an idp carbon flux of 007 03 times 106 kgyr we calculate for the first time the carbon flux from impacts of asteroids and comets to this end we perform dynamical simulations of impact rates on mars we use the nbody integrator rmvsswifter to propagate the sun and the eight planets from their current positions we separately add comets and asteroids to the simulations as massless test particles based on their current orbital elements yielding mars impact rates of 434times103 cometsmyr and 33 asteroidsmyr we estimate the global carbon flux on mars from cometary impacts to be sim 0013 times 106kgyr within an order of magnitude while asteroids deliver sim 005 times 106kgyr these values correspond to sim 419 and sim 1771 respectively of the idpborne carbon flux estimated by nesvorny et al 2011 borin et al 2017 and crismani et al 2017 unlike the spatially homogeneous idp infall impact ejecta are distributed locally concentrated around the impact site we find organics from asteroids and comets to dominate over idpborne organics at distances up to 150km from the crater center our results may be important for the interpretation of in situ detections of organics on mars | [['given', 'rapid', 'photodissociation', 'and', 'photodegradation', 'the', 'recently', 'discovered', 'organics', 'in', 'the', 'martian', 'subsurface', 'and', 'atmosphere', 'were', 'probably', 'delivered', 'in', 'geologically', 'recent', 'times', 'possible', 'parent', 'bodies', 'are', 'ctype', 'asteroids', 'comets', 'and', 'interplanetary', 'dust', 'particles', 'idps', 'the', 'dust', 'infall', 'rate', 'was', 'estimated', 'using', 'different', 'methods', 'to', 'be', 'between', '071', 'and', '296', 'times', '106', 'kgyr', 'nesvorny', 'et', 'al', '2011', 'borin', 'et', 'al', '2017', 'crismani', 'et', 'al', '2017', 'assuming', 'a', 'carbon', 'content', 'of', '10', 'flynn', '1996', 'this', 'implies', 'an', 'idp', 'carbon', 'flux', 'of', '007', '03', 'times', '106', 'kgyr', 'we', 'calculate', 'for', 'the', 'first', 'time', 'the', 'carbon', 'flux', 'from', 'impacts', 'of', 'asteroids', 'and', 'comets', 'to', 'this', 'end', 'we', 'perform', 'dynamical', 'simulations', 'of', 'impact', 'rates', 'on', 'mars', 'we', 'use', 'the', 'nbody', 'integrator', 'rmvsswifter', 'to', 'propagate', 'the', 'sun', 'and', 'the', 'eight', 'planets', 'from', 'their', 'current', 'positions', 'we', 'separately', 'add', 'comets', 'and', 'asteroids', 'to', 'the', 'simulations', 'as', 'massless', 'test', 'particles', 'based', 'on', 'their', 'current', 'orbital', 'elements', 'yielding', 'mars', 'impact', 'rates', 'of', '434times103', 'cometsmyr', 'and', '33', 'asteroidsmyr', 'we', 'estimate', 'the', 'global', 'carbon', 'flux', 'on', 'mars', 'from', 'cometary', 'impacts', 'to', 'be', 'sim', '0013', 'times', '106kgyr', 'within', 'an', 'order', 'of', 'magnitude', 'while', 'asteroids', 'deliver', 'sim', '005', 'times', '106kgyr', 'these', 'values', 'correspond', 'to', 'sim', '419', 'and', 'sim', '1771', 'respectively', 'of', 'the', 'idpborne', 'carbon', 'flux', 'estimated', 'by', 'nesvorny', 'et', 'al', '2011', 'borin', 'et', 'al', '2017', 'and', 'crismani', 'et', 'al', '2017', 'unlike', 'the', 'spatially', 'homogeneous', 'idp', 'infall', 'impact', 'ejecta', 'are', 'distributed', 'locally', 'concentrated', 'around', 'the', 'impact', 'site', 'we', 'find', 'organics', 'from', 'asteroids', 'and', 'comets', 'to', 'dominate', 'over', 'idpborne', 'organics', 'at', 'distances', 'up', 'to', '150km', 'from', 'the', 'crater', 'center', 'our', 'results', 'may', 'be', 'important', 'for', 'the', 'interpretation', 'of', 'in', 'situ', 'detections', 'of', 'organics', 'on', 'mars']] | [-0.04148612529050212, 0.17793460063333533, -0.03853594501893796, 0.00725054744064317, 0.0045714007542548025, 0.024861162127259136, 0.0753510185073368, 0.36521558655839226, -0.149298148070888, -0.41735206254534135, 0.06276793070832383, -0.32006423830148556, -0.08271226830633407, 0.18040183947111169, -0.11933489855064816, 0.00396291877314775, 0.07497627294555581, -0.12671928684941905, -0.018911712189510016, -0.3217665177337688, 0.1726278886781074, 0.14356000940929087, 0.13390197486854916, 0.00726583868070224, 0.06786736426062795, -0.09294765746192069, -0.05417746361778226, -0.0875628342014528, -0.21872445764633747, 0.07445927494559293, 0.1828108568235423, 0.08327486745737017, 0.1557034895423251, -0.45764611245948794, -0.209156996311526, 0.05795972536736738, 0.08490484847340646, 0.056361426251882674, -0.010237768191353296, -0.3105229538045968, 0.05859616176719785, -0.22776203785929106, -0.1402513586068634, 0.062007558430985425, 0.1497290179299465, 0.01786617249455267, -0.2738505131195032, 0.13995962342348442, 0.025760926471733444, 0.11038713195260123, -0.1371449401454148, -0.1960722643660035, -0.10143195817521376, 0.06253414180999722, 0.04448645897101351, 0.04732422023477365, 0.21712562025077065, -0.0012097941688871076, -0.047504597890385705, 0.3934123762847148, -0.07331826263143457, -0.0016586028604244573, 0.25728188012907094, -0.16065258504606264, -0.13462419878843046, 0.21083537014490067, 0.20655306044319832, 0.12926306513019895, -0.1389970136120511, 0.019044840947748342, -0.034593218328366274, 0.17808105502920152, 0.12126082715906868, 0.010861255268226991, 0.27882743051975906, 0.11090629735181845, -0.00026284959058948726, 0.01637154541027104, -0.22164536920369804, -0.05764204501187927, -0.15418084005124924, -0.16128277592823476, -0.12784003447506634, 0.07048014152430489, -0.08352877920640808, -0.05501897976923934, 0.30623798805032676, 0.16641355256140306, 0.22516086966687338, -0.008493913460320742, 0.22347823968301564, 0.024584568788788404, 0.042821876977231034, 0.17754787108463835, 0.31810394799708597, 0.09770714908896029, 0.11263950135741137, -0.17860593142298362, 0.1126876561203069, 0.05076035833827314] |
1,803.03271 | Remarks on the maximum luminosity | The quest for fundamental limitations on physical processes is old and
venerable. Here, we investigate the maximum possible power, or luminosity, that
any event can produce. We show, via full nonlinear simulations of Einstein's
equations, that there exist initial conditions which give rise to arbitrarily
large luminosities. However, the requirement that there is no past horizon in
the spacetime seems to limit the luminosity to below the Planck value, ${{\cal
L}_\textrm{P}\!=\!c^5/G}$. Numerical relativity simulations of critical
collapse yield the largest luminosities observed to date, ${\approx \! 0.2
{\cal L}_\textrm{P}}$. We also present an analytic solution to the Einstein
equations which seems to give an unboundedly large luminosity; this will guide
future numerical efforts to investigate super-Planckian luminosities.
| gr-qc | the quest for fundamental limitations on physical processes is old and venerable here we investigate the maximum possible power or luminosity that any event can produce we show via full nonlinear simulations of einsteins equations that there exist initial conditions which give rise to arbitrarily large luminosities however the requirement that there is no past horizon in the spacetime seems to limit the luminosity to below the planck value cal l_textrmpc5g numerical relativity simulations of critical collapse yield the largest luminosities observed to date approx 02 cal l_textrmp we also present an analytic solution to the einstein equations which seems to give an unboundedly large luminosity this will guide future numerical efforts to investigate superplanckian luminosities | [['the', 'quest', 'for', 'fundamental', 'limitations', 'on', 'physical', 'processes', 'is', 'old', 'and', 'venerable', 'here', 'we', 'investigate', 'the', 'maximum', 'possible', 'power', 'or', 'luminosity', 'that', 'any', 'event', 'can', 'produce', 'we', 'show', 'via', 'full', 'nonlinear', 'simulations', 'of', 'einsteins', 'equations', 'that', 'there', 'exist', 'initial', 'conditions', 'which', 'give', 'rise', 'to', 'arbitrarily', 'large', 'luminosities', 'however', 'the', 'requirement', 'that', 'there', 'is', 'no', 'past', 'horizon', 'in', 'the', 'spacetime', 'seems', 'to', 'limit', 'the', 'luminosity', 'to', 'below', 'the', 'planck', 'value', 'cal', 'l_textrmpc5g', 'numerical', 'relativity', 'simulations', 'of', 'critical', 'collapse', 'yield', 'the', 'largest', 'luminosities', 'observed', 'to', 'date', 'approx', '02', 'cal', 'l_textrmp', 'we', 'also', 'present', 'an', 'analytic', 'solution', 'to', 'the', 'einstein', 'equations', 'which', 'seems', 'to', 'give', 'an', 'unboundedly', 'large', 'luminosity', 'this', 'will', 'guide', 'future', 'numerical', 'efforts', 'to', 'investigate', 'superplanckian', 'luminosities']] | [-0.10661593652248644, 0.11221138985338416, -0.06692564217863899, 0.1209723204241559, -0.1309534204090341, -0.09456335894943199, -0.0031605656687660436, 0.3719250002688026, -0.18122143788557304, -0.3234241596267869, 0.13061514922536158, -0.2850619446488277, -0.05675809802446645, 0.20775306306824318, -0.0486020864842239, 0.0655631628598489, 0.0647761199353753, 0.0041730456511702456, -0.10528196069042264, -0.23131159319656722, 0.2915629244679095, 0.1042703619214559, 0.23391644394825817, 0.06606219233863317, 0.09268372107231826, -0.11026811256612602, 0.0023478718235549565, 0.013966216938570142, -0.23086262943922375, 0.03291596867258481, 0.2870722208580558, 0.16952204978371269, 0.25284603154776913, -0.4386948746028601, -0.1651213303404419, 0.1645873291744736, 0.15921419919693125, 0.12438337494728458, -0.048623277353359744, -0.20650844497140497, 0.07805901632405278, -0.15609783182745768, -0.20423728264173852, -0.04406899284048561, 0.10036343419434209, -0.04479751738478642, -0.25461666069500016, 0.06401642553254006, 0.024279406996803324, -0.010750566041423824, -0.061511421853905186, -0.07230212799939245, -0.0077141726904205584, 0.044800418555703866, 0.0793576782994103, 0.041791221126914024, 0.09977449111950894, -0.12242379316574029, -0.09916664118952069, 0.38321276051564174, -0.03947256887821775, -0.11576539418954206, 0.21021872491007998, -0.19989609723122334, -0.10394965243942447, 0.14132400807462991, 0.16482729069365745, 0.08948831921933513, -0.15405507075289884, 0.07464494020627044, -0.01086050007602592, 0.21082447869539783, 0.03868081772458952, 0.05154657378903051, 0.2745700242822957, 0.11884165638159111, 0.07229427735141494, 0.07435179078387782, -0.05807208071724234, -0.08192807305328499, -0.369004674660238, -0.08458672287432771, -0.12250820122528494, 0.175844149678341, -0.12654323364991446, -0.1604521208597968, 0.2756843647650002, 0.23609636509137458, 0.19101917970794857, 0.10290279383403494, 0.24161888635308856, 0.17432111860743085, 0.08899372243404127, 0.10413481156227358, 0.3386665765326797, 0.11374111809122392, 0.10847071654228657, -0.23805952114573875, 0.0070186527037437545, 0.0197980101669632] |
1,803.03272 | What does the first highly-redshifted 21-cm detection tell us about
early galaxies? | The Experiment to Detect the Global Epoch of Reionization Signature (EDGES)
recently reported a strong 21-cm absorption signal relative to the cosmic
microwave background at $z \sim 18$. While its anomalous amplitude may indicate
new physics, in this work we focus on the timing of the signal, as it alone
provides an important constraint on galaxy formation models. Whereas rest-frame
ultraviolet luminosity functions (UVLFs) over a broad range of redshifts are
well fit by simple models in which galaxy star formation histories track the
assembly of dark matter halos, we find that these same models, with reasonable
assumptions about X-ray production in star-forming galaxies, cannot generate a
narrow absorption trough at $z \sim 18$. If verified, the EDGES signal
therefore requires the fundamental inputs of galaxy formation models to evolve
rapidly at $z \gtrsim 10$. Unless extremely faint sources residing in halos
below the atomic cooling threshold are responsible for the EDGES signal, star
formation in $\sim 10^8$-$10^{10} \ M_{\odot}$ halos must be more efficient
than expected, implying that the faint-end of the UVLF at $M_{\mathrm{UV}}
\lesssim -12$ must steepen at the highest redshifts. This steepening provides a
concrete test for future galaxy surveys with the James Webb Space Telescope and
ongoing efforts in lensed fields, and is required regardless of whether the
amplitude of the EDGES signal is due to new cooling channels or a strong radio
background in the early Universe. However, the radio background solution
requires that galaxies at $z > 15$ emit 1-2 GHz photons with an efficiency
$\sim 10^3$ times greater than local star-forming galaxies, posing a challenge
for models of low-frequency photon production in the early Universe.
| astro-ph.GA astro-ph.CO | the experiment to detect the global epoch of reionization signature edges recently reported a strong 21cm absorption signal relative to the cosmic microwave background at z sim 18 while its anomalous amplitude may indicate new physics in this work we focus on the timing of the signal as it alone provides an important constraint on galaxy formation models whereas restframe ultraviolet luminosity functions uvlfs over a broad range of redshifts are well fit by simple models in which galaxy star formation histories track the assembly of dark matter halos we find that these same models with reasonable assumptions about xray production in starforming galaxies cannot generate a narrow absorption trough at z sim 18 if verified the edges signal therefore requires the fundamental inputs of galaxy formation models to evolve rapidly at z gtrsim 10 unless extremely faint sources residing in halos below the atomic cooling threshold are responsible for the edges signal star formation in sim 1081010 m_odot halos must be more efficient than expected implying that the faintend of the uvlf at m_mathrmuv lesssim 12 must steepen at the highest redshifts this steepening provides a concrete test for future galaxy surveys with the james webb space telescope and ongoing efforts in lensed fields and is required regardless of whether the amplitude of the edges signal is due to new cooling channels or a strong radio background in the early universe however the radio background solution requires that galaxies at z 15 emit 12 ghz photons with an efficiency sim 103 times greater than local starforming galaxies posing a challenge for models of lowfrequency photon production in the early universe | [['the', 'experiment', 'to', 'detect', 'the', 'global', 'epoch', 'of', 'reionization', 'signature', 'edges', 'recently', 'reported', 'a', 'strong', '21cm', 'absorption', 'signal', 'relative', 'to', 'the', 'cosmic', 'microwave', 'background', 'at', 'z', 'sim', '18', 'while', 'its', 'anomalous', 'amplitude', 'may', 'indicate', 'new', 'physics', 'in', 'this', 'work', 'we', 'focus', 'on', 'the', 'timing', 'of', 'the', 'signal', 'as', 'it', 'alone', 'provides', 'an', 'important', 'constraint', 'on', 'galaxy', 'formation', 'models', 'whereas', 'restframe', 'ultraviolet', 'luminosity', 'functions', 'uvlfs', 'over', 'a', 'broad', 'range', 'of', 'redshifts', 'are', 'well', 'fit', 'by', 'simple', 'models', 'in', 'which', 'galaxy', 'star', 'formation', 'histories', 'track', 'the', 'assembly', 'of', 'dark', 'matter', 'halos', 'we', 'find', 'that', 'these', 'same', 'models', 'with', 'reasonable', 'assumptions', 'about', 'xray', 'production', 'in', 'starforming', 'galaxies', 'can', 'not', 'generate', 'a', 'narrow', 'absorption', 'trough', 'at', 'z', 'sim', '18', 'if', 'verified', 'the', 'edges', 'signal', 'therefore', 'requires', 'the', 'fundamental', 'inputs', 'of', 'galaxy', 'formation', 'models', 'to', 'evolve', 'rapidly', 'at', 'z', 'gtrsim', '10', 'unless', 'extremely', 'faint', 'sources', 'residing', 'in', 'halos', 'below', 'the', 'atomic', 'cooling', 'threshold', 'are', 'responsible', 'for', 'the', 'edges', 'signal', 'star', 'formation', 'in', 'sim', '1081010', 'm_odot', 'halos', 'must', 'be', 'more', 'efficient', 'than', 'expected', 'implying', 'that', 'the', 'faintend', 'of', 'the', 'uvlf', 'at', 'm_mathrmuv', 'lesssim', '12', 'must', 'steepen', 'at', 'the', 'highest', 'redshifts', 'this', 'steepening', 'provides', 'a', 'concrete', 'test', 'for', 'future', 'galaxy', 'surveys', 'with', 'the', 'james', 'webb', 'space', 'telescope', 'and', 'ongoing', 'efforts', 'in', 'lensed', 'fields', 'and', 'is', 'required', 'regardless', 'of', 'whether', 'the', 'amplitude', 'of', 'the', 'edges', 'signal', 'is', 'due', 'to', 'new', 'cooling', 'channels', 'or', 'a', 'strong', 'radio', 'background', 'in', 'the', 'early', 'universe', 'however', 'the', 'radio', 'background', 'solution', 'requires', 'that', 'galaxies', 'at', 'z', '15', 'emit', '12', 'ghz', 'photons', 'with', 'an', 'efficiency', 'sim', '103', 'times', 'greater', 'than', 'local', 'starforming', 'galaxies', 'posing', 'a', 'challenge', 'for', 'models', 'of', 'lowfrequency', 'photon', 'production', 'in', 'the', 'early', 'universe']] | [-0.07311316037508041, 0.1527689711073271, -0.038651047386160306, 0.12046980236165528, -0.09837541469403739, -0.08965987386525612, 0.024357027759108817, 0.4186655385591557, -0.1285258485330784, -0.37118714157581273, 0.0431580368555718, -0.29473028060502454, -0.007866840913541258, 0.19297760780608605, 0.03266033533843736, -0.026477171566270333, 0.026439605700883093, -0.08846847204890143, -0.017503013858413564, -0.29115957730085457, 0.2564991225137949, 0.14485507281806417, 0.19752861401553753, 0.003473539039839705, 0.07744462423136533, -0.09390439131774861, -0.07822633785499788, -0.07852393468316538, -0.1454527602539124, -0.02205859055831544, 0.2691243088248447, 0.142581746937549, 0.23937860114682066, -0.3709503488333353, -0.2140301326624843, 0.14757513995385452, 0.2130619131520088, 0.05902521002812593, -0.07117834168760583, -0.2717751218006015, 0.0902081164692501, -0.14660980162980564, -0.1290620830497701, 0.08800266017343478, 0.040266406529916386, -0.012359239069085115, -0.2323706641840934, 0.16404967074285903, -0.0021170202222069797, 0.035155296813682874, -0.06099055427241713, -0.06000611649455015, -0.04598987151952839, 0.030038934665804255, -0.00834539079715625, 0.10831472810445443, 0.2089056358329017, -0.20910351182250975, -0.04086575496295721, 0.4111861345303207, -0.08951007246481843, 0.02422529277460464, 0.21860259091928327, -0.24148899323489117, -0.19218055596334577, 0.17411717227361564, 0.16619996458972458, 0.07183137920090578, -0.1274144542815913, 0.03441430135360297, 0.0453585681945388, 0.25575599816156985, 0.05821806333814765, 0.0882957122373271, 0.36094824410631315, 0.12399103583611644, 0.08518796075576644, 0.03603513786574393, -0.15266075946250587, 0.03877882956186949, -0.2686019900471412, -0.07702367224582776, -0.1288733854992968, 0.12703574510301743, -0.13861471595321231, -0.08716803671585094, 0.3528302805171764, 0.13451119898981673, 0.23899958269735902, 0.09189774812589231, 0.3124180109140453, 0.08951219754951673, 0.10772415989068271, 0.09808129583042101, 0.3168815228868125, 0.1407651027820908, 0.07608774161985234, -0.18037355171793185, 0.05749224028910933, -0.05046888945686091] |
1,803.03273 | Scale-free gravitational collapse as the origin of $\rho \sim r^{-2}$
density profile -- a possible role of turbulence in regulating gravitational
collapse | Astrophysical systems, such as clumps that form star clusters share a density
profile that is close to $\rho \sim r^{-2}$. We prove analytically this density
profile is the result of the scale-free nature of the gravitational collapse.
Therefore, it should emerge in many different situations as long as gravity is
dominating the evolution for a period that is comparable or longer than the
free-fall time, and this does not necessarily imply an isothermal model, as
many have previously believed.
To describe the collapse process, we construct a model called the
turbulence-regulated gravitational collapse model, where turbulence is
sustained by accretion and dissipates in roughly a crossing time. We
demonstrate that a $\rho \sim r^{-2}$ profile emerges due to the scale-free
nature the system. In this particular case, the rate of gravitational collapse
is regulated by the rate at which turbulence dissipates the kinetic energy such
that the infall speed can be $20 - 50 \%$ of the free-fall speed(which also
depends on the interpretation of the crossing time based on simulations of
driven turbulence). These predictions are consistent with existing
observations, which suggests that these clumps are in the stage of
turbulence-regulated gravitational collapse. Our analysis provides a unified
description of gravitational collapse in different environments.
| astro-ph.GA astro-ph.SR | astrophysical systems such as clumps that form star clusters share a density profile that is close to rho sim r2 we prove analytically this density profile is the result of the scalefree nature of the gravitational collapse therefore it should emerge in many different situations as long as gravity is dominating the evolution for a period that is comparable or longer than the freefall time and this does not necessarily imply an isothermal model as many have previously believed to describe the collapse process we construct a model called the turbulenceregulated gravitational collapse model where turbulence is sustained by accretion and dissipates in roughly a crossing time we demonstrate that a rho sim r2 profile emerges due to the scalefree nature the system in this particular case the rate of gravitational collapse is regulated by the rate at which turbulence dissipates the kinetic energy such that the infall speed can be 20 50 of the freefall speedwhich also depends on the interpretation of the crossing time based on simulations of driven turbulence these predictions are consistent with existing observations which suggests that these clumps are in the stage of turbulenceregulated gravitational collapse our analysis provides a unified description of gravitational collapse in different environments | [['astrophysical', 'systems', 'such', 'as', 'clumps', 'that', 'form', 'star', 'clusters', 'share', 'a', 'density', 'profile', 'that', 'is', 'close', 'to', 'rho', 'sim', 'r2', 'we', 'prove', 'analytically', 'this', 'density', 'profile', 'is', 'the', 'result', 'of', 'the', 'scalefree', 'nature', 'of', 'the', 'gravitational', 'collapse', 'therefore', 'it', 'should', 'emerge', 'in', 'many', 'different', 'situations', 'as', 'long', 'as', 'gravity', 'is', 'dominating', 'the', 'evolution', 'for', 'a', 'period', 'that', 'is', 'comparable', 'or', 'longer', 'than', 'the', 'freefall', 'time', 'and', 'this', 'does', 'not', 'necessarily', 'imply', 'an', 'isothermal', 'model', 'as', 'many', 'have', 'previously', 'believed', 'to', 'describe', 'the', 'collapse', 'process', 'we', 'construct', 'a', 'model', 'called', 'the', 'turbulenceregulated', 'gravitational', 'collapse', 'model', 'where', 'turbulence', 'is', 'sustained', 'by', 'accretion', 'and', 'dissipates', 'in', 'roughly', 'a', 'crossing', 'time', 'we', 'demonstrate', 'that', 'a', 'rho', 'sim', 'r2', 'profile', 'emerges', 'due', 'to', 'the', 'scalefree', 'nature', 'the', 'system', 'in', 'this', 'particular', 'case', 'the', 'rate', 'of', 'gravitational', 'collapse', 'is', 'regulated', 'by', 'the', 'rate', 'at', 'which', 'turbulence', 'dissipates', 'the', 'kinetic', 'energy', 'such', 'that', 'the', 'infall', 'speed', 'can', 'be', '20', '50', 'of', 'the', 'freefall', 'speedwhich', 'also', 'depends', 'on', 'the', 'interpretation', 'of', 'the', 'crossing', 'time', 'based', 'on', 'simulations', 'of', 'driven', 'turbulence', 'these', 'predictions', 'are', 'consistent', 'with', 'existing', 'observations', 'which', 'suggests', 'that', 'these', 'clumps', 'are', 'in', 'the', 'stage', 'of', 'turbulenceregulated', 'gravitational', 'collapse', 'our', 'analysis', 'provides', 'a', 'unified', 'description', 'of', 'gravitational', 'collapse', 'in', 'different', 'environments']] | [-0.16065859641154925, 0.15346871722402713, -0.11009646189201788, 0.10155054293846916, -0.04844399678447454, -0.06853741736339378, -0.017013618298186896, 0.3160767198122781, -0.22472425780300362, -0.30546647302916485, 0.08417727077423406, -0.22384317053809963, -0.11262790225285652, 0.18942382565603175, 0.014219890357788855, -0.022246865559084884, 0.04193627241519486, 0.02948216183955226, -0.04279560250949271, -0.21032028439973155, 0.3200640147827162, 0.0927673745820106, 0.22318378274370296, 0.028708813987268603, 0.04971959715562281, -0.1068122927351795, 0.0011810591331685393, 0.018720065399527256, -0.1563132908068376, -0.0022184394074608502, 0.17596290744565832, 0.15154348271486023, 0.27371667468177124, -0.4403245831321319, -0.2787533789469397, 0.09732582223523646, 0.18579654840940582, 0.10371511996714536, -0.03029547526163916, -0.24028845410220545, 0.07105819551558623, -0.20530608075033194, -0.1366835116417941, -0.013609998773443948, 0.07163326826928358, 0.0424586409838237, -0.25791790401517173, 0.16501410947375691, 0.06837632108865113, -0.019755146791929093, -0.09060572734414576, -0.019905216376563267, -0.03686646374488442, 0.053446855317466326, 0.06292016199136395, 0.09228581914751621, 0.18846966858421052, -0.13728221685607261, -0.04355848199066252, 0.4333396021625385, -0.08021872370709433, -0.1316280601215847, 0.2323934472810587, -0.18226813613964712, -0.12719579806707323, 0.16330864630511094, 0.1439516364821586, 0.10147405944287484, -0.10264200162546241, 0.01088297225734485, -0.03328536680367376, 0.18819075534257837, 0.07652917098634753, 0.017364192820553268, 0.3018892662682263, 0.17464183540521602, 0.03149552331959801, 0.08744945722285731, -0.09544231629301908, -0.13239029089557786, -0.31015947938259014, -0.12030348095015206, -0.17829163146682378, 0.08828388390383911, -0.097066247925074, -0.15105216612975145, 0.32566149409727324, 0.15095097344286115, 0.20716944608488694, 0.07957191456664409, 0.27976245355558366, 0.13527020196065656, 0.08251452484041087, 0.1341123387574223, 0.2849365235053994, 0.1011944424081135, 0.09080500984816753, -0.21712115072080948, 0.09227679250991257, 0.009586826062031787] |
1,803.03274 | Cosmological N-Body Simulations with a Large-Scale Tidal Field | In this paper we carry out anisotropic "separate universe" simulations by
including a large-scale tidal field in the N-body code \textsc{gadget}4 using
an anisotropic expansion factor $A_{ij}$. We use the code in a pure
\textit{particle-mesh} (PM) mode to simulate the evolution of 16 realizations
of an initial density field with and without a large-scale tidal field, which
are then used to measure the \textit{response function} describing how the
tidal field influences structure formation in the linear and non-linear
regimes. Together with the previously measured response to a large scale
overdensity, this completely describes the nonlinear matter bispectrum in the
squeezed limit. We find that, contrary to the density response, the tidal
response never significantly exceeds the large-scale perturbation-theory
prediction even on nonlinear scales for the redshift range we discuss. We
develop a simple halo model that takes into account the effect of the tidal
field and compare it with our direct measurement from the anisotropic N-body
simulations.
| astro-ph.CO | in this paper we carry out anisotropic separate universe simulations by including a largescale tidal field in the nbody code textscgadget4 using an anisotropic expansion factor a_ij we use the code in a pure textitparticlemesh pm mode to simulate the evolution of 16 realizations of an initial density field with and without a largescale tidal field which are then used to measure the textitresponse function describing how the tidal field influences structure formation in the linear and nonlinear regimes together with the previously measured response to a large scale overdensity this completely describes the nonlinear matter bispectrum in the squeezed limit we find that contrary to the density response the tidal response never significantly exceeds the largescale perturbationtheory prediction even on nonlinear scales for the redshift range we discuss we develop a simple halo model that takes into account the effect of the tidal field and compare it with our direct measurement from the anisotropic nbody simulations | [['in', 'this', 'paper', 'we', 'carry', 'out', 'anisotropic', 'separate', 'universe', 'simulations', 'by', 'including', 'a', 'largescale', 'tidal', 'field', 'in', 'the', 'nbody', 'code', 'textscgadget4', 'using', 'an', 'anisotropic', 'expansion', 'factor', 'a_ij', 'we', 'use', 'the', 'code', 'in', 'a', 'pure', 'textitparticlemesh', 'pm', 'mode', 'to', 'simulate', 'the', 'evolution', 'of', '16', 'realizations', 'of', 'an', 'initial', 'density', 'field', 'with', 'and', 'without', 'a', 'largescale', 'tidal', 'field', 'which', 'are', 'then', 'used', 'to', 'measure', 'the', 'textitresponse', 'function', 'describing', 'how', 'the', 'tidal', 'field', 'influences', 'structure', 'formation', 'in', 'the', 'linear', 'and', 'nonlinear', 'regimes', 'together', 'with', 'the', 'previously', 'measured', 'response', 'to', 'a', 'large', 'scale', 'overdensity', 'this', 'completely', 'describes', 'the', 'nonlinear', 'matter', 'bispectrum', 'in', 'the', 'squeezed', 'limit', 'we', 'find', 'that', 'contrary', 'to', 'the', 'density', 'response', 'the', 'tidal', 'response', 'never', 'significantly', 'exceeds', 'the', 'largescale', 'perturbationtheory', 'prediction', 'even', 'on', 'nonlinear', 'scales', 'for', 'the', 'redshift', 'range', 'we', 'discuss', 'we', 'develop', 'a', 'simple', 'halo', 'model', 'that', 'takes', 'into', 'account', 'the', 'effect', 'of', 'the', 'tidal', 'field', 'and', 'compare', 'it', 'with', 'our', 'direct', 'measurement', 'from', 'the', 'anisotropic', 'nbody', 'simulations']] | [-0.11558238225807617, 0.10334092633992996, -0.11160699323624033, 0.06351112283602986, -0.06892208268793372, -0.018777610194361347, -0.045577256322699274, 0.3462218212495957, -0.24999218691720979, -0.3120523452601553, 0.05228800562364593, -0.24133777274038073, -0.13196600778723838, 0.18083238763002946, 0.0542319414490084, 0.008383185292787657, 0.034255342170983166, -0.01139549278146164, -0.06793921150623551, -0.22772929306495815, 0.3375663146521751, 0.1074260625316967, 0.2329202810568469, -0.027333216043189168, 0.08800226793051455, 0.01142371764297706, -0.05454686515686381, 0.06103428316532404, -0.19187137193710607, 0.020681288072162053, 0.1856353016579282, 0.06998741816934924, 0.26340257211787893, -0.44790083702121464, -0.2187757174871475, 0.07709684196932169, 0.1401924346664364, 0.16938866715947795, -0.05709152085957565, -0.2593507335533376, 0.061723249949297156, -0.21869256684266322, -0.12564493476280145, -0.06266889601413693, 0.015501297613478859, 0.008773592524472382, -0.2906859289063292, 0.13998014946746362, 0.019318260987252964, 0.022834036582982616, -0.07792309781705792, -0.0660687661971655, 0.010887173220648296, 0.08414519085796768, 0.043924653885263176, 0.04641717234959027, 0.17272244046053656, -0.15993505085413284, -0.048348763066362106, 0.38878315787568885, -0.13903188305701336, -0.16177448130200628, 0.17392594559728955, -0.1830527880077867, -0.10210084518895472, 0.10361230694053863, 0.2029332896912253, 0.07879979841036165, -0.12600722983698723, 0.07625778785539343, -0.018090145332835518, 0.21784524043399067, 0.020429417546898997, -0.010327026263097084, 0.2643418490959259, 0.1341038993249841, 0.015429861356758258, 0.1309260808827878, -0.12178057742867522, -0.07895884665285612, -0.2785699968831009, -0.09524982525398593, -0.16089260443805434, 0.0658734555041732, -0.12017645841559271, -0.17715039827207757, 0.40768526195149335, 0.20318470140556236, 0.19443374081906353, 0.05692769660895642, 0.30310031786778724, 0.1288301727013336, 0.0949175598941949, 0.10231603689902982, 0.2918051307863713, 0.14902379678550187, 0.05657774815940625, -0.2765801680129166, 0.013663316317894435, -0.018498682500129298] |
1,803.03275 | The Fornax Cluster VLT Spectroscopic Survey. I - VIMOS spectroscopy of
compact stellar systems in the Fornax core region | We present the results of a wide spectroscopic survey aimed at detecting
extragalactic globular clusters (GCs) in the core of the Fornax cluster. About
4500 low resolution spectra (from 4800 to 10000 \AA ) were observed in 25
VLT/VIMOS masks covering the central 1 deg$^{2}$ around the dominant galaxy NGC
1399 corresponding to $\sim$175 kpc galactocentric radius. We describe the
methodology used for data reduction and data analysis. We found a total of 387
unique physical objects (372 GCs and 15 ultra compact dwarfs) in the field
covered by our observations. Most of these objects are associated with NGC
1399, with only 10% likely belonging to other giant galaxies. The new VIMOS
dataset is complementary to the many GC catalogues already present in the
literature and it brings the total number of tracer particles around NGC 1399
to more than 1130 objects. With this comprehensive radial velocity sample we
have found that the velocity dispersion of the GC population (equally for red
and blue GC populations) shows a relatively sharp increase from low velocity
dispersion ($\sim250$-$350$ kms$^{-1}$) to high velocity dispersion
($\sim300$-$400$ kms$^{-1}$) at projected radius of $\approx10$ arcmin
($\sim60$ kpc) from the galaxy centre. This suggests that at a projected radius
of $\approx60$ kpc both blue and red GC populations begin to be governed by the
dominating Fornax cluster potential, rather than by the central NGC 1399 galaxy
potential. This kinematic evidence corroborates similar results found using
surface brightness analysis and planetary nebulae kinematics.
| astro-ph.GA astro-ph.CO | we present the results of a wide spectroscopic survey aimed at detecting extragalactic globular clusters gcs in the core of the fornax cluster about 4500 low resolution spectra from 4800 to 10000 aa were observed in 25 vltvimos masks covering the central 1 deg2 around the dominant galaxy ngc 1399 corresponding to sim175 kpc galactocentric radius we describe the methodology used for data reduction and data analysis we found a total of 387 unique physical objects 372 gcs and 15 ultra compact dwarfs in the field covered by our observations most of these objects are associated with ngc 1399 with only 10 likely belonging to other giant galaxies the new vimos dataset is complementary to the many gc catalogues already present in the literature and it brings the total number of tracer particles around ngc 1399 to more than 1130 objects with this comprehensive radial velocity sample we have found that the velocity dispersion of the gc population equally for red and blue gc populations shows a relatively sharp increase from low velocity dispersion sim250350 kms1 to high velocity dispersion sim300400 kms1 at projected radius of approx10 arcmin sim60 kpc from the galaxy centre this suggests that at a projected radius of approx60 kpc both blue and red gc populations begin to be governed by the dominating fornax cluster potential rather than by the central ngc 1399 galaxy potential this kinematic evidence corroborates similar results found using surface brightness analysis and planetary nebulae kinematics | [['we', 'present', 'the', 'results', 'of', 'a', 'wide', 'spectroscopic', 'survey', 'aimed', 'at', 'detecting', 'extragalactic', 'globular', 'clusters', 'gcs', 'in', 'the', 'core', 'of', 'the', 'fornax', 'cluster', 'about', '4500', 'low', 'resolution', 'spectra', 'from', '4800', 'to', '10000', 'aa', 'were', 'observed', 'in', '25', 'vltvimos', 'masks', 'covering', 'the', 'central', '1', 'deg2', 'around', 'the', 'dominant', 'galaxy', 'ngc', '1399', 'corresponding', 'to', 'sim175', 'kpc', 'galactocentric', 'radius', 'we', 'describe', 'the', 'methodology', 'used', 'for', 'data', 'reduction', 'and', 'data', 'analysis', 'we', 'found', 'a', 'total', 'of', '387', 'unique', 'physical', 'objects', '372', 'gcs', 'and', '15', 'ultra', 'compact', 'dwarfs', 'in', 'the', 'field', 'covered', 'by', 'our', 'observations', 'most', 'of', 'these', 'objects', 'are', 'associated', 'with', 'ngc', '1399', 'with', 'only', '10', 'likely', 'belonging', 'to', 'other', 'giant', 'galaxies', 'the', 'new', 'vimos', 'dataset', 'is', 'complementary', 'to', 'the', 'many', 'gc', 'catalogues', 'already', 'present', 'in', 'the', 'literature', 'and', 'it', 'brings', 'the', 'total', 'number', 'of', 'tracer', 'particles', 'around', 'ngc', '1399', 'to', 'more', 'than', '1130', 'objects', 'with', 'this', 'comprehensive', 'radial', 'velocity', 'sample', 'we', 'have', 'found', 'that', 'the', 'velocity', 'dispersion', 'of', 'the', 'gc', 'population', 'equally', 'for', 'red', 'and', 'blue', 'gc', 'populations', 'shows', 'a', 'relatively', 'sharp', 'increase', 'from', 'low', 'velocity', 'dispersion', 'sim250350', 'kms1', 'to', 'high', 'velocity', 'dispersion', 'sim300400', 'kms1', 'at', 'projected', 'radius', 'of', 'approx10', 'arcmin', 'sim60', 'kpc', 'from', 'the', 'galaxy', 'centre', 'this', 'suggests', 'that', 'at', 'a', 'projected', 'radius', 'of', 'approx60', 'kpc', 'both', 'blue', 'and', 'red', 'gc', 'populations', 'begin', 'to', 'be', 'governed', 'by', 'the', 'dominating', 'fornax', 'cluster', 'potential', 'rather', 'than', 'by', 'the', 'central', 'ngc', '1399', 'galaxy', 'potential', 'this', 'kinematic', 'evidence', 'corroborates', 'similar', 'results', 'found', 'using', 'surface', 'brightness', 'analysis', 'and', 'planetary', 'nebulae', 'kinematics']] | [-0.03880468895225901, 0.05063214017249536, -0.110563263393292, 0.07788163729777853, -0.10720130537871334, -0.042362954317987034, 0.029521322122213145, 0.4391686932052955, -0.12267627458959772, -0.3945460088920495, -0.002104720582056036, -0.3220570514994589, 0.013491882737206433, 0.2179734938304625, -0.04357067018185457, -0.07271344824126452, 0.107455910809823, -0.07687244339353475, -0.0043413236983551465, -0.2762035784024884, 0.24866861919102776, 0.055642233533719325, 0.15481613127106786, -0.06991959634056115, 0.06438278448132967, -0.09581267390754228, -0.07975198326378384, -0.0037640325574989407, -0.17800332462322016, 0.06329469955266523, 0.2582707801402723, 0.11272134186785013, 0.25885698554483205, -0.28791594374832896, -0.15613393238608528, 0.03194475981064356, 0.26578393152314583, 0.025059070401586406, -0.07692674586525589, -0.31758602499607796, 0.10931056826606331, -0.18122905624399255, -0.25633414781244457, 0.12253355417662293, 0.08841930489654244, 0.03685516435441307, -0.12965564597359558, 0.22399140908652224, -0.028348144729744857, 0.1677817065049394, -0.1334816048831933, -0.18100190354792078, -0.06300623208757736, 0.04790290546495744, -0.028708704142092364, 0.10498009071000351, 0.19501060119653044, -0.10118051489703511, 0.055473226518947476, 0.4070366726695629, -0.05065480673414836, 0.06619364644250686, 0.24283293576156798, -0.23623833563929222, -0.1915472979091631, 0.12162073425542609, 0.15716546180913965, 0.09347070193145239, -0.20150915649911957, -0.010436668758490315, -0.04624377514768684, 0.24198397724265772, 0.07428993462981302, 0.052739353920898326, 0.30761544514940053, 0.08143370389969141, 0.08699855201205138, 0.07128892713808455, -0.31810847144551796, -0.029932169698771428, -0.20896627462405543, -0.05445298165937285, -0.10580820289309606, 0.06333411494866475, -0.1967766894531977, -0.08510244521504838, 0.32411603836057906, 0.10333589422652423, 0.24306793290590636, 0.04624058605914489, 0.2701791709237001, 0.029828388017336723, 0.16639855665285602, 0.16082534449721478, 0.2927354428289874, 0.2234788380134158, 0.06978393576977666, -0.21914473870934625, 0.0011526551703760816, -0.059197429005703156] |
1,803.03276 | The Fornax Cluster VLT Spectroscopic Survey II - Planetary Nebulae
kinematics within 200 kpc of the cluster core | We present the largest and most spatially extended planetary nebulae (PNe)
catalog ever obtained for the Fornax cluster. We measured velocities of 1452
PNe out to 200 kpc in the cluster core using a counter-dispersed slitless
spectroscopic technique with data from FORS2 on the VLT. With such extended
spatial coverage, we can study separately the stellar halos of some of the
cluster main galaxies and the intracluster light. In this second paper of the
Fornax Cluster VLT Spectroscopic Survey (FVSS), we identify and classify the
emission-line sources, describe the method to select PNe and calculate their
coordinates and velocities from the dispersed slitless images. From the PN 2D
velocity map we identify stellar streams that are possibly tracing the
gravitational interaction of NGC1399 with NGC1404 and NGC1387. We also present
the velocity dispersion profile out to $\sim 200$ kpc radii, which shows
signatures of a superposition of the bright central galaxy and the cluster
potential, with the latter clearly dominating the regions outside R $\sim
1000$" ($\sim 100$ kpc).
| astro-ph.GA astro-ph.CO | we present the largest and most spatially extended planetary nebulae pne catalog ever obtained for the fornax cluster we measured velocities of 1452 pne out to 200 kpc in the cluster core using a counterdispersed slitless spectroscopic technique with data from fors2 on the vlt with such extended spatial coverage we can study separately the stellar halos of some of the cluster main galaxies and the intracluster light in this second paper of the fornax cluster vlt spectroscopic survey fvss we identify and classify the emissionline sources describe the method to select pne and calculate their coordinates and velocities from the dispersed slitless images from the pn 2d velocity map we identify stellar streams that are possibly tracing the gravitational interaction of ngc1399 with ngc1404 and ngc1387 we also present the velocity dispersion profile out to sim 200 kpc radii which shows signatures of a superposition of the bright central galaxy and the cluster potential with the latter clearly dominating the regions outside r sim 1000 sim 100 kpc | [['we', 'present', 'the', 'largest', 'and', 'most', 'spatially', 'extended', 'planetary', 'nebulae', 'pne', 'catalog', 'ever', 'obtained', 'for', 'the', 'fornax', 'cluster', 'we', 'measured', 'velocities', 'of', '1452', 'pne', 'out', 'to', '200', 'kpc', 'in', 'the', 'cluster', 'core', 'using', 'a', 'counterdispersed', 'slitless', 'spectroscopic', 'technique', 'with', 'data', 'from', 'fors2', 'on', 'the', 'vlt', 'with', 'such', 'extended', 'spatial', 'coverage', 'we', 'can', 'study', 'separately', 'the', 'stellar', 'halos', 'of', 'some', 'of', 'the', 'cluster', 'main', 'galaxies', 'and', 'the', 'intracluster', 'light', 'in', 'this', 'second', 'paper', 'of', 'the', 'fornax', 'cluster', 'vlt', 'spectroscopic', 'survey', 'fvss', 'we', 'identify', 'and', 'classify', 'the', 'emissionline', 'sources', 'describe', 'the', 'method', 'to', 'select', 'pne', 'and', 'calculate', 'their', 'coordinates', 'and', 'velocities', 'from', 'the', 'dispersed', 'slitless', 'images', 'from', 'the', 'pn', '2d', 'velocity', 'map', 'we', 'identify', 'stellar', 'streams', 'that', 'are', 'possibly', 'tracing', 'the', 'gravitational', 'interaction', 'of', 'ngc1399', 'with', 'ngc1404', 'and', 'ngc1387', 'we', 'also', 'present', 'the', 'velocity', 'dispersion', 'profile', 'out', 'to', 'sim', '200', 'kpc', 'radii', 'which', 'shows', 'signatures', 'of', 'a', 'superposition', 'of', 'the', 'bright', 'central', 'galaxy', 'and', 'the', 'cluster', 'potential', 'with', 'the', 'latter', 'clearly', 'dominating', 'the', 'regions', 'outside', 'r', 'sim', '1000', 'sim', '100', 'kpc']] | [-0.057337615005231116, 0.041986892882943945, -0.10132973484099793, 0.05250605830120904, -0.11000973457393386, -0.04083039382880432, 0.027574436461481337, 0.4255672732434241, -0.18771079735149845, -0.34548133243558676, 0.030241401140032525, -0.31418182632538694, -0.002255490237086482, 0.19075374412157478, 0.012509591161058499, -0.0500343725829731, 0.09798074263070859, -0.07826000437989125, -0.01841833545294585, -0.2759632649307949, 0.3073530284875243, 0.049952484813336966, 0.1339241321000254, -0.063336746442027, 0.0660957905619554, -0.08021656384129495, -0.12651432949234043, -0.001465942909026287, -0.19037908727197925, 0.071197036692677, 0.23742017741680158, 0.13219603037767488, 0.2240193392998765, -0.30701250490903326, -0.16151483980084622, 0.04778377196514571, 0.24130854761977433, 0.052335971118413885, -0.04588749267632065, -0.3385447676254976, 0.10224973922044303, -0.1904147913866847, -0.228300509672645, 0.07244630520557158, 0.032457203811624216, 0.07920268688973635, -0.16839025070141317, 0.14959681050603266, -0.05163894787867493, 0.1256550905355335, -0.12835796721783857, -0.10696641968276638, -0.051818388893259355, 0.0873141536467086, -0.05066042773414557, 0.057005230936679176, 0.16553504065784058, -0.11432806459894768, 0.031464988076453204, 0.40887334195555314, -0.0428103840725287, 0.03988828389910904, 0.22761173174611826, -0.2347304298619591, -0.17040275597184368, 0.11349379152855864, 0.17696076155138704, 0.12988616593840627, -0.18821947835936878, 0.0020626129409623438, -0.03505630150834132, 0.2270981133643389, 0.06910085553694627, 0.06096181149614118, 0.28502217992677314, 0.04140116175369376, 0.05214886484838493, 0.11836143684871053, -0.3394924153810775, -0.008403777188935577, -0.24600397070839494, -0.1004262197543674, -0.11482043260399848, 0.03649363207448957, -0.17073099023310162, -0.11104746958338683, 0.35818093650583066, 0.13549988954493325, 0.2047117949400053, 0.04109253559382798, 0.30005113673589284, 0.035193257301786816, 0.14661406286022236, 0.131412887593081, 0.2926768535321383, 0.19814828438711898, 0.07634176087659403, -0.21281640558140547, -0.004405079519695784, -0.006965783505959535] |
1,803.03277 | A Measurement of Gas Temperatures in Galaxy Clusters using the
Relativistic Sunyaev-Zeldovich Effect | The hot gas in clusters of galaxies creates a distinctive spectral distortion
in the cosmic microwave background (CMB) via the Sunyaev-Zeldovich (SZ) effect.
To first order, the shape of the spectral distortion is fixed, but relativistic
corrections (rSZ) introduce a dependence on the gas temperature. In this paper,
we extract fluxes from a sample of 47 clusters in the Planck maps and make a
~5$\sigma$ detection of the rSZ effect by measuring the scaling relation
between the SZ amplitude (a proxy for cluster mass) and the cluster
temperature. Our measurement requires no prior knowledge of the clusters' gas
temperatures and hence is an example of how the rSZ can be used to probe
fundamental astrophysics. We find excellent agreement between our measurement
and temperatures obtained with X-ray measurements.
| astro-ph.CO | the hot gas in clusters of galaxies creates a distinctive spectral distortion in the cosmic microwave background cmb via the sunyaevzeldovich sz effect to first order the shape of the spectral distortion is fixed but relativistic corrections rsz introduce a dependence on the gas temperature in this paper we extract fluxes from a sample of 47 clusters in the planck maps and make a 5sigma detection of the rsz effect by measuring the scaling relation between the sz amplitude a proxy for cluster mass and the cluster temperature our measurement requires no prior knowledge of the clusters gas temperatures and hence is an example of how the rsz can be used to probe fundamental astrophysics we find excellent agreement between our measurement and temperatures obtained with xray measurements | [['the', 'hot', 'gas', 'in', 'clusters', 'of', 'galaxies', 'creates', 'a', 'distinctive', 'spectral', 'distortion', 'in', 'the', 'cosmic', 'microwave', 'background', 'cmb', 'via', 'the', 'sunyaevzeldovich', 'sz', 'effect', 'to', 'first', 'order', 'the', 'shape', 'of', 'the', 'spectral', 'distortion', 'is', 'fixed', 'but', 'relativistic', 'corrections', 'rsz', 'introduce', 'a', 'dependence', 'on', 'the', 'gas', 'temperature', 'in', 'this', 'paper', 'we', 'extract', 'fluxes', 'from', 'a', 'sample', 'of', '47', 'clusters', 'in', 'the', 'planck', 'maps', 'and', 'make', 'a', '5sigma', 'detection', 'of', 'the', 'rsz', 'effect', 'by', 'measuring', 'the', 'scaling', 'relation', 'between', 'the', 'sz', 'amplitude', 'a', 'proxy', 'for', 'cluster', 'mass', 'and', 'the', 'cluster', 'temperature', 'our', 'measurement', 'requires', 'no', 'prior', 'knowledge', 'of', 'the', 'clusters', 'gas', 'temperatures', 'and', 'hence', 'is', 'an', 'example', 'of', 'how', 'the', 'rsz', 'can', 'be', 'used', 'to', 'probe', 'fundamental', 'astrophysics', 'we', 'find', 'excellent', 'agreement', 'between', 'our', 'measurement', 'and', 'temperatures', 'obtained', 'with', 'xray', 'measurements']] | [-0.06827114239740695, 0.12805647976085766, -0.11440425187174696, 0.09411612799613067, -0.059543894156377064, -0.028478461459599202, 0.06495766138777981, 0.36683410160185304, -0.21134281845661462, -0.3558355060085887, 0.03953810224811605, -0.3231271019685664, -0.03090638972571469, 0.21482997364364564, 0.026921242675598478, -0.003722548903169809, 0.016260005093499785, -0.02074802550532695, -0.07100318260927452, -0.21307100752983388, 0.30745457816738053, 0.1563732366576005, 0.2562666216836078, 0.056695494618907105, 0.09523209277540445, -0.045449948971509, -0.105125011614291, 0.040595865473733284, -0.15792698184668552, 0.05148807729483451, 0.20946894991266163, 0.07583315157353354, 0.17783610253536608, -0.34293478775515496, -0.21478416179161286, 0.11731122741548461, 0.13887313496525167, 0.108514185396416, -0.08907947592979326, -0.25520631416293327, 0.014677881932584569, -0.15411875179415802, -0.10867347747716849, -0.0192321704216738, -0.0057480073264741804, -0.015363013681053417, -0.2433814070027438, 0.17201014799502445, 0.013535137404687703, 0.05033960795844905, -0.09359489914459118, -0.07788020974112442, -0.022182592143508373, 0.1192454515821737, -0.0154052465040877, 0.07524419875699095, 0.1856185067226761, -0.12367482798254059, -0.04647368077712599, 0.40603718496276997, -0.09623051568360097, -0.06481450031424174, 0.1793692918126908, -0.2139959436171921, -0.17479215215644217, 0.09153447029530071, 0.14933669989477494, 0.030177469355294306, -0.18374641278933268, 0.04779369081916229, 0.00802955328981625, 0.23838151291420218, 0.06695807984942803, 0.0432027782784985, 0.3216169517218077, 0.12194699206247606, 0.05918038592062658, 0.15828857650649297, -0.21052586896803405, 0.033654142436489565, -0.25677174577867845, -0.0899067514037597, -0.16904652599987458, 0.05469667085890251, -0.15312322529234734, -0.14090583938377677, 0.33228904966745176, 0.1698587039609265, 0.23831939159754256, 0.033581776755454484, 0.3562553918163758, 0.09893009926327068, 0.07509891405788949, 0.06161957959557185, 0.2811533163112472, 0.19985515326879977, 0.08396579490454315, -0.2861611858879769, 0.03951720903933165, -0.0047315483607235365] |
1,803.03278 | Direct Collapse to Supermassive Black Hole Seeds with Radiation
Transfer: Cosmological Halos | We have modeled direct collapse of a primordial gas within dark matter halos
in the presence of radiative transfer, in high-resolution zoom-in simulations
in a cosmological framework, down to the formation of the photosphere and the
central object. Radiative transfer has been implemented in the flux-limited
diffusion (FLD) approximation. Adiabatic models were run for comparison. We
find that (a) the FLD flow forms an irregular central structure and does not
exhibit fragmentation, contrary to adiabatic flow which forms a thick disk,
driving a pair of spiral shocks, subject to Kelvin-Helmholtz shear instability
forming fragments; (b) the growing central core in the FLD flow quickly reaches
~10 Mo and a highly variable luminosity of 10^{38}-10^{39} erg/s, comparable to
the Eddington luminosity. It experiences massive recurrent outflows driven by
radiation force and thermal pressure gradients, which mix with the accretion
flow and transfer the angular momentum outwards; and (c) the interplay between
these processes and a massive accretion, results in photosphere at ~10 AU. We
conclude that in the FLD model (1) the central object exhibits dynamically
insignificant rotation and slower than adiabatic temperature rise with density;
(2) does not experience fragmentation leading to star formation, thus promoting
the fast track formation of a supermassive black hole (SMBH) seed; (3)
inclusion of radiation force leads to outflows, resulting in the mass
accumulation within the central 10^{-3} pc, which is ~100 times larger than
characteristic scale of star formation. The inclusion of radiative transfer
reveals complex early stages of formation and growth of the central structure
in the direct collapse scenario of SMBH seed formation.
| astro-ph.GA | we have modeled direct collapse of a primordial gas within dark matter halos in the presence of radiative transfer in highresolution zoomin simulations in a cosmological framework down to the formation of the photosphere and the central object radiative transfer has been implemented in the fluxlimited diffusion fld approximation adiabatic models were run for comparison we find that a the fld flow forms an irregular central structure and does not exhibit fragmentation contrary to adiabatic flow which forms a thick disk driving a pair of spiral shocks subject to kelvinhelmholtz shear instability forming fragments b the growing central core in the fld flow quickly reaches 10 mo and a highly variable luminosity of 10381039 ergs comparable to the eddington luminosity it experiences massive recurrent outflows driven by radiation force and thermal pressure gradients which mix with the accretion flow and transfer the angular momentum outwards and c the interplay between these processes and a massive accretion results in photosphere at 10 au we conclude that in the fld model 1 the central object exhibits dynamically insignificant rotation and slower than adiabatic temperature rise with density 2 does not experience fragmentation leading to star formation thus promoting the fast track formation of a supermassive black hole smbh seed 3 inclusion of radiation force leads to outflows resulting in the mass accumulation within the central 103 pc which is 100 times larger than characteristic scale of star formation the inclusion of radiative transfer reveals complex early stages of formation and growth of the central structure in the direct collapse scenario of smbh seed formation | [['we', 'have', 'modeled', 'direct', 'collapse', 'of', 'a', 'primordial', 'gas', 'within', 'dark', 'matter', 'halos', 'in', 'the', 'presence', 'of', 'radiative', 'transfer', 'in', 'highresolution', 'zoomin', 'simulations', 'in', 'a', 'cosmological', 'framework', 'down', 'to', 'the', 'formation', 'of', 'the', 'photosphere', 'and', 'the', 'central', 'object', 'radiative', 'transfer', 'has', 'been', 'implemented', 'in', 'the', 'fluxlimited', 'diffusion', 'fld', 'approximation', 'adiabatic', 'models', 'were', 'run', 'for', 'comparison', 'we', 'find', 'that', 'a', 'the', 'fld', 'flow', 'forms', 'an', 'irregular', 'central', 'structure', 'and', 'does', 'not', 'exhibit', 'fragmentation', 'contrary', 'to', 'adiabatic', 'flow', 'which', 'forms', 'a', 'thick', 'disk', 'driving', 'a', 'pair', 'of', 'spiral', 'shocks', 'subject', 'to', 'kelvinhelmholtz', 'shear', 'instability', 'forming', 'fragments', 'b', 'the', 'growing', 'central', 'core', 'in', 'the', 'fld', 'flow', 'quickly', 'reaches', '10', 'mo', 'and', 'a', 'highly', 'variable', 'luminosity', 'of', '10381039', 'ergs', 'comparable', 'to', 'the', 'eddington', 'luminosity', 'it', 'experiences', 'massive', 'recurrent', 'outflows', 'driven', 'by', 'radiation', 'force', 'and', 'thermal', 'pressure', 'gradients', 'which', 'mix', 'with', 'the', 'accretion', 'flow', 'and', 'transfer', 'the', 'angular', 'momentum', 'outwards', 'and', 'c', 'the', 'interplay', 'between', 'these', 'processes', 'and', 'a', 'massive', 'accretion', 'results', 'in', 'photosphere', 'at', '10', 'au', 'we', 'conclude', 'that', 'in', 'the', 'fld', 'model', '1', 'the', 'central', 'object', 'exhibits', 'dynamically', 'insignificant', 'rotation', 'and', 'slower', 'than', 'adiabatic', 'temperature', 'rise', 'with', 'density', '2', 'does', 'not', 'experience', 'fragmentation', 'leading', 'to', 'star', 'formation', 'thus', 'promoting', 'the', 'fast', 'track', 'formation', 'of', 'a', 'supermassive', 'black', 'hole', 'smbh', 'seed', '3', 'inclusion', 'of', 'radiation', 'force', 'leads', 'to', 'outflows', 'resulting', 'in', 'the', 'mass', 'accumulation', 'within', 'the', 'central', '103', 'pc', 'which', 'is', '100', 'times', 'larger', 'than', 'characteristic', 'scale', 'of', 'star', 'formation', 'the', 'inclusion', 'of', 'radiative', 'transfer', 'reveals', 'complex', 'early', 'stages', 'of', 'formation', 'and', 'growth', 'of', 'the', 'central', 'structure', 'in', 'the', 'direct', 'collapse', 'scenario', 'of', 'smbh', 'seed', 'formation']] | [-0.10665554071038826, 0.13542444349077692, -0.061313631005899205, 0.10014837353724015, -0.0577488721382244, -0.053450585845179886, -0.012446146727346912, 0.3747653811856689, -0.2272366488252506, -0.33293814887917134, 0.05354313234043918, -0.24244672172056989, -0.005998555367448549, 0.1618315435636439, 0.0440364966322436, -0.021919609525622764, 0.0521274140498055, -0.06194423395833464, -0.05832239178286319, -0.19105978281740313, 0.3280554973088576, 0.11706901260587418, 0.1945150850503081, 0.011729628199147652, 0.053041893222558374, -0.08942171836952532, -0.03770275286423806, -0.033622433839569234, -0.15977445396201523, 0.030830415083502215, 0.17602647718558032, 0.08575285390872237, 0.27048631358474234, -0.45474864134718435, -0.24403862713682697, 0.03774064088037766, 0.20128789770870087, 0.09905016790117384, -0.10957037400939569, -0.17397787921323343, 0.0733770805663497, -0.2541376005334537, -0.11672712950271437, 0.028296476623428792, 0.07698704815430431, -0.0052702406274558, -0.27135601554420985, 0.18003471375026445, 0.09124248907669408, -0.005789052570145934, -0.10112626944450925, -0.017085317622199368, -0.10249341964914367, 0.05405130551573089, 0.044513072527702396, 0.09117436283571338, 0.28125271967244675, -0.1789175603445976, -0.0361075511575102, 0.39426410369846215, -0.07285687352730928, -0.06825556401769949, 0.26214531457258594, -0.232157111308855, -0.08273392314647977, 0.21331387904376306, 0.1980182024689527, 0.13463312222054086, -0.09059543909114283, -0.012746530395230658, 0.01875867865671015, 0.19350401458412522, 0.08338299102727074, -0.02302344635278843, 0.3376220385544002, 0.17075332200736293, 0.016674137061418987, 0.0961132389323793, -0.15443127213574062, -0.12827195284149512, -0.22969181074982087, -0.11052742190623363, -0.10355019418547694, 0.12595176569579108, -0.14589166901201694, -0.14342448744348382, 0.3067253505243738, 0.1094738289007339, 0.22937201731704476, 0.013437199240679303, 0.30537057445844873, 0.0892142817213903, 0.12332626199505874, 0.17596095174254842, 0.30546203790717824, 0.18882452709942885, 0.11802177063467774, -0.2843073964131447, 0.056290427706462164, 0.024817820584447876] |
1,803.03279 | Enforcing dust mass conservation in 3D simulations of tightly-coupled
grains with the Phantom SPH code | We describe a new implementation of the one-fluid method in the SPH code
Phantom to simulate the dynamics of dust grains in gas protoplanetary discs. We
revise and extend previously developed algorithms by computing the evolution of
a new fluid quantity that produces a more accurate and numerically controlled
evolution of the dust dynamics. Moreover, by limiting the stopping time of
uncoupled grains that violate the assumptions of the terminal velocity
approximation, we avoid fatal numerical errors in mass conservation. We test
and validate our new algorithm by running 3D SPH simulations of a large range
of disc models with tightly- and marginally-coupled grains.
| astro-ph.EP | we describe a new implementation of the onefluid method in the sph code phantom to simulate the dynamics of dust grains in gas protoplanetary discs we revise and extend previously developed algorithms by computing the evolution of a new fluid quantity that produces a more accurate and numerically controlled evolution of the dust dynamics moreover by limiting the stopping time of uncoupled grains that violate the assumptions of the terminal velocity approximation we avoid fatal numerical errors in mass conservation we test and validate our new algorithm by running 3d sph simulations of a large range of disc models with tightly and marginallycoupled grains | [['we', 'describe', 'a', 'new', 'implementation', 'of', 'the', 'onefluid', 'method', 'in', 'the', 'sph', 'code', 'phantom', 'to', 'simulate', 'the', 'dynamics', 'of', 'dust', 'grains', 'in', 'gas', 'protoplanetary', 'discs', 'we', 'revise', 'and', 'extend', 'previously', 'developed', 'algorithms', 'by', 'computing', 'the', 'evolution', 'of', 'a', 'new', 'fluid', 'quantity', 'that', 'produces', 'a', 'more', 'accurate', 'and', 'numerically', 'controlled', 'evolution', 'of', 'the', 'dust', 'dynamics', 'moreover', 'by', 'limiting', 'the', 'stopping', 'time', 'of', 'uncoupled', 'grains', 'that', 'violate', 'the', 'assumptions', 'of', 'the', 'terminal', 'velocity', 'approximation', 'we', 'avoid', 'fatal', 'numerical', 'errors', 'in', 'mass', 'conservation', 'we', 'test', 'and', 'validate', 'our', 'new', 'algorithm', 'by', 'running', '3d', 'sph', 'simulations', 'of', 'a', 'large', 'range', 'of', 'disc', 'models', 'with', 'tightly', 'and', 'marginallycoupled', 'grains']] | [-0.0722977769492167, 0.07988467581967995, -0.11678835808398944, 0.06335515038842715, -0.023601962556357232, -0.10912722227100319, -6.576438515799717e-05, 0.3462783033118665, -0.2177010474419131, -0.3407028648116201, 0.06042708310601527, -0.19565530198183165, -0.08055002518784869, 0.18447866956296477, -0.05124985092111583, 0.09704569201844121, 0.09533969140713311, -0.145404670651984, -0.05099015949221635, -0.2602076975366517, 0.3163052578592329, 0.10060850273392805, 0.16430730888059417, 0.004495549744144263, 0.10078881378511637, -0.08873530037393704, -0.06027938440912268, 0.024810064308236814, -0.22479760231864435, 0.06673756164037487, 0.13199529330432216, 0.11232819701138053, 0.2531332748951119, -0.48968508452611065, -0.24118245890345966, 0.05248617068909615, 0.16337262076841105, 0.14398539352040846, -0.07381596507403425, -0.21970516140346677, 0.06562376993898193, -0.2001022728322779, -0.17683790680653985, -0.05676286625992326, 0.033799640637668736, 0.04382659504370927, -0.27685134530573796, 0.10887079174942292, 0.04257115677396939, 0.029921527491945737, -0.07785634467947902, -0.05817067815280221, -0.02282427911402531, 0.06310709926313314, 0.019617745847197124, -0.017492814109326134, 0.1946893888209196, -0.1347202140333818, -0.0661156101116133, 0.4118916038604616, -0.10315445540427655, -0.191911377736087, 0.21381666772610064, -0.1512581249292108, -0.10917089749873589, 0.17948760893376706, 0.219923124544648, 0.15743488828353222, -0.1534960033570968, 0.03949978607887565, -0.0628855473190112, 0.1742002311370616, 0.04187158581764591, -0.05298888478970643, 0.21370725127533802, 0.16854550676800092, 0.007425106727310176, 0.13555634785805223, -0.10691444610598162, -0.14323034950360222, -0.27435191897946654, -0.17862148834400907, -0.18752124610592077, 0.010409606867062958, -0.14095931418310145, -0.15320022594527277, 0.3378750950966066, 0.23340494668075037, 0.16765022814020658, 0.0876029931750257, 0.33497361631756556, 0.056095592339649725, 0.06008338687706341, 0.16014009437442406, 0.23748118288643225, 0.11417401882591521, 0.10791569704967506, -0.2907830041299746, 0.058895153237633335, 0.05262273965511941] |
1,803.0328 | Millimeter-Wave Polarimeters Using Kinetic Inductance Detectors for
TolTEC and Beyond | Microwave Kinetic Inductance Detectors (MKIDs) provide a compelling path
forward to the large-format polarimeter, imaging, and spectrometer arrays
needed for next-generation experiments in millimeter-wave cosmology and
astronomy. We describe the development of feedhorn-coupled MKID detectors for
the TolTEC millimeter-wave imaging polarimeter being constructed for the
50-meter Large Millimeter Telescope (LMT). Observations with TolTEC are planned
to begin in early 2019. TolTEC will comprise $\sim$7,000 polarization sensitive
MKIDs and will represent the first MKID arrays fabricated and deployed on
monolithic 150 mm diameter silicon wafers -- a critical step towards future
large-scale experiments with over $10^5$ detectors. TolTEC will operate in
observational bands at 1.1, 1.4, and 2.0 mm and will use dichroic filters to
define a physically independent focal plane for each passband, thus allowing
the polarimeters to use simple, direct-absorption inductive structures that are
impedance matched to incident radiation. This work is part of a larger program
at NIST-Boulder to develop MKID-based detector technologies for use over a wide
range of photon energies spanning millimeter-waves to X-rays. We present the
detailed pixel layout and describe the methods, tools, and flexible design
parameters that allow this solution to be optimized for use anywhere in the
millimeter and sub-millimeter bands. We also present measurements of prototype
devices operating in the 1.1 mm band and compare the observed optical
performance to that predicted from models and simulations.
| astro-ph.IM | microwave kinetic inductance detectors mkids provide a compelling path forward to the largeformat polarimeter imaging and spectrometer arrays needed for nextgeneration experiments in millimeterwave cosmology and astronomy we describe the development of feedhorncoupled mkid detectors for the toltec millimeterwave imaging polarimeter being constructed for the 50meter large millimeter telescope lmt observations with toltec are planned to begin in early 2019 toltec will comprise sim7000 polarization sensitive mkids and will represent the first mkid arrays fabricated and deployed on monolithic 150 mm diameter silicon wafers a critical step towards future largescale experiments with over 105 detectors toltec will operate in observational bands at 11 14 and 20 mm and will use dichroic filters to define a physically independent focal plane for each passband thus allowing the polarimeters to use simple directabsorption inductive structures that are impedance matched to incident radiation this work is part of a larger program at nistboulder to develop mkidbased detector technologies for use over a wide range of photon energies spanning millimeterwaves to xrays we present the detailed pixel layout and describe the methods tools and flexible design parameters that allow this solution to be optimized for use anywhere in the millimeter and submillimeter bands we also present measurements of prototype devices operating in the 11 mm band and compare the observed optical performance to that predicted from models and simulations | [['microwave', 'kinetic', 'inductance', 'detectors', 'mkids', 'provide', 'a', 'compelling', 'path', 'forward', 'to', 'the', 'largeformat', 'polarimeter', 'imaging', 'and', 'spectrometer', 'arrays', 'needed', 'for', 'nextgeneration', 'experiments', 'in', 'millimeterwave', 'cosmology', 'and', 'astronomy', 'we', 'describe', 'the', 'development', 'of', 'feedhorncoupled', 'mkid', 'detectors', 'for', 'the', 'toltec', 'millimeterwave', 'imaging', 'polarimeter', 'being', 'constructed', 'for', 'the', '50meter', 'large', 'millimeter', 'telescope', 'lmt', 'observations', 'with', 'toltec', 'are', 'planned', 'to', 'begin', 'in', 'early', '2019', 'toltec', 'will', 'comprise', 'sim7000', 'polarization', 'sensitive', 'mkids', 'and', 'will', 'represent', 'the', 'first', 'mkid', 'arrays', 'fabricated', 'and', 'deployed', 'on', 'monolithic', '150', 'mm', 'diameter', 'silicon', 'wafers', 'a', 'critical', 'step', 'towards', 'future', 'largescale', 'experiments', 'with', 'over', '105', 'detectors', 'toltec', 'will', 'operate', 'in', 'observational', 'bands', 'at', '11', '14', 'and', '20', 'mm', 'and', 'will', 'use', 'dichroic', 'filters', 'to', 'define', 'a', 'physically', 'independent', 'focal', 'plane', 'for', 'each', 'passband', 'thus', 'allowing', 'the', 'polarimeters', 'to', 'use', 'simple', 'directabsorption', 'inductive', 'structures', 'that', 'are', 'impedance', 'matched', 'to', 'incident', 'radiation', 'this', 'work', 'is', 'part', 'of', 'a', 'larger', 'program', 'at', 'nistboulder', 'to', 'develop', 'mkidbased', 'detector', 'technologies', 'for', 'use', 'over', 'a', 'wide', 'range', 'of', 'photon', 'energies', 'spanning', 'millimeterwaves', 'to', 'xrays', 'we', 'present', 'the', 'detailed', 'pixel', 'layout', 'and', 'describe', 'the', 'methods', 'tools', 'and', 'flexible', 'design', 'parameters', 'that', 'allow', 'this', 'solution', 'to', 'be', 'optimized', 'for', 'use', 'anywhere', 'in', 'the', 'millimeter', 'and', 'submillimeter', 'bands', 'we', 'also', 'present', 'measurements', 'of', 'prototype', 'devices', 'operating', 'in', 'the', '11', 'mm', 'band', 'and', 'compare', 'the', 'observed', 'optical', 'performance', 'to', 'that', 'predicted', 'from', 'models', 'and', 'simulations']] | [-0.09002893721811812, 0.11930601730498232, -0.006724409421440214, -0.008378689019115303, -0.09876780945553698, -0.15992803762280594, -0.01435846888714216, 0.46964682174677197, -0.15712324077136475, -0.3537803604288704, 0.12665624771464287, -0.3112119060948978, -0.072721479088068, 0.2611955472575077, -0.00017565252992426394, 0.060124221083771606, 0.10513441619801928, -0.15347893197309034, -0.04632258969570764, -0.15525004475229334, 0.1955229075244543, 0.1847037654200738, 0.28460460791644765, 0.017071729375642133, 0.14820718180007217, -0.034280932803151455, -0.05813947934260465, -0.01204621633514762, -0.14916427588888673, 0.09358202324100685, 0.3722269317894064, 0.11497330576606725, 0.19757155174738728, -0.44794924931431357, -0.1832784001905979, 0.055275390386073424, 0.08946836387569254, 0.02351403289834376, -0.005437047341944311, -0.26094790798273276, 0.07166038539805661, -0.14639603973985438, -0.14535602284906252, 0.017781398736406117, -0.01594139654824341, 0.019038265888494523, -0.23855758255495774, -0.07076919344584563, -0.07298049107193946, 0.04097831028788774, -0.03757502562875743, -0.1367711317492649, 0.04596436729612337, 0.07412592936571773, -0.11256426875453061, 0.04467510881579735, 0.13962989202700554, -0.08743563650535759, -0.09436216989309866, 0.31494687814688815, -0.06893720605505885, -0.09349826772019944, 0.18324671204738313, -0.18888484977439723, -0.10878674717916345, 0.16259638247852723, 0.21318412225439468, 0.07875108752526681, -0.1852378571538297, 0.016201098360100082, 0.07618777224772864, 0.22318807643975808, 0.0977515346698717, 0.10395660205077464, 0.2940518342931186, 0.22717366243225776, 0.07463970009703189, 0.13655309451489964, -0.24216734904436055, 0.046909817506093535, -0.2851611582562327, -0.1445180609113198, -0.15112459532789546, 0.05437884049024433, -0.04889752484933441, -0.12700331313323907, 0.3606851922009479, 0.21776953629345042, 0.110836891584437, 0.0517643350192388, 0.335768421812364, 0.010517353794685649, 0.16775160367515954, 0.004050541970751841, 0.31395985483911565, 0.10955384107920425, 0.20739175344034183, -0.11663717554104303, -0.06453031139681116, -0.04914794116365639] |
1,803.03281 | Helical magnetic structure and the anomalous and topological Hall
effects in epitaxial B20 Fe$_{1-y}$Co$_y$Ge films | Epitaxial films of the B20-structure alloy Fe$_{1-y}$Co$_y$Ge were grown by
molecular beam epitaxy on Si (111) substrates. The magnetization varied
smoothly from the bulk-like values of one Bohr magneton per Fe atom for FeGe to
zero for non-magnetic CoGe. The chiral lattice structure leads to a
Dzyaloshinskii-Moriya interaction (DMI), and the films' helical magnetic ground
state was confirmed using polarized neutron reflectometry measurements. The
pitch of the spin helix, measured by this method, varies with Co content $y$
and diverges at $y \sim 0.45$. This indicates a zero-crossing of the DMI, which
we reproduced in calculations using first principle methods. We also measured
the longitudinal and Hall resistivity of our films as a function of magnetic
field, temperature, and Co content $y$. The Hall resistivity is expected to
contain contributions from the ordinary, anomalous, and topological Hall
effects. Both the anomalous and topological Hall resistivities show peaks
around $y \sim 0.5$. Our first principles calculations show a peak in the
topological Hall constant at this value of $y$, related to the strong
spin-polarisation predicted for intermediate values of $y$. Half-metallicity is
predicted for $y = 0.6$, consistent with the experimentally observed linear
magnetoresistance at this composition. Whilst it is possible to reconcile
theory with experiment for the various Hall effects for FeGe, the large
topological Hall resistivities for $y \sim 0.5$ are much larger then expected
when the very small emergent fields associated with the divergence in the DMI
are taken into account.
| cond-mat.mtrl-sci | epitaxial films of the b20structure alloy fe_1yco_yge were grown by molecular beam epitaxy on si 111 substrates the magnetization varied smoothly from the bulklike values of one bohr magneton per fe atom for fege to zero for nonmagnetic coge the chiral lattice structure leads to a dzyaloshinskiimoriya interaction dmi and the films helical magnetic ground state was confirmed using polarized neutron reflectometry measurements the pitch of the spin helix measured by this method varies with co content y and diverges at y sim 045 this indicates a zerocrossing of the dmi which we reproduced in calculations using first principle methods we also measured the longitudinal and hall resistivity of our films as a function of magnetic field temperature and co content y the hall resistivity is expected to contain contributions from the ordinary anomalous and topological hall effects both the anomalous and topological hall resistivities show peaks around y sim 05 our first principles calculations show a peak in the topological hall constant at this value of y related to the strong spinpolarisation predicted for intermediate values of y halfmetallicity is predicted for y 06 consistent with the experimentally observed linear magnetoresistance at this composition whilst it is possible to reconcile theory with experiment for the various hall effects for fege the large topological hall resistivities for y sim 05 are much larger then expected when the very small emergent fields associated with the divergence in the dmi are taken into account | [['epitaxial', 'films', 'of', 'the', 'b20structure', 'alloy', 'fe_1yco_yge', 'were', 'grown', 'by', 'molecular', 'beam', 'epitaxy', 'on', 'si', '111', 'substrates', 'the', 'magnetization', 'varied', 'smoothly', 'from', 'the', 'bulklike', 'values', 'of', 'one', 'bohr', 'magneton', 'per', 'fe', 'atom', 'for', 'fege', 'to', 'zero', 'for', 'nonmagnetic', 'coge', 'the', 'chiral', 'lattice', 'structure', 'leads', 'to', 'a', 'dzyaloshinskiimoriya', 'interaction', 'dmi', 'and', 'the', 'films', 'helical', 'magnetic', 'ground', 'state', 'was', 'confirmed', 'using', 'polarized', 'neutron', 'reflectometry', 'measurements', 'the', 'pitch', 'of', 'the', 'spin', 'helix', 'measured', 'by', 'this', 'method', 'varies', 'with', 'co', 'content', 'y', 'and', 'diverges', 'at', 'y', 'sim', '045', 'this', 'indicates', 'a', 'zerocrossing', 'of', 'the', 'dmi', 'which', 'we', 'reproduced', 'in', 'calculations', 'using', 'first', 'principle', 'methods', 'we', 'also', 'measured', 'the', 'longitudinal', 'and', 'hall', 'resistivity', 'of', 'our', 'films', 'as', 'a', 'function', 'of', 'magnetic', 'field', 'temperature', 'and', 'co', 'content', 'y', 'the', 'hall', 'resistivity', 'is', 'expected', 'to', 'contain', 'contributions', 'from', 'the', 'ordinary', 'anomalous', 'and', 'topological', 'hall', 'effects', 'both', 'the', 'anomalous', 'and', 'topological', 'hall', 'resistivities', 'show', 'peaks', 'around', 'y', 'sim', '05', 'our', 'first', 'principles', 'calculations', 'show', 'a', 'peak', 'in', 'the', 'topological', 'hall', 'constant', 'at', 'this', 'value', 'of', 'y', 'related', 'to', 'the', 'strong', 'spinpolarisation', 'predicted', 'for', 'intermediate', 'values', 'of', 'y', 'halfmetallicity', 'is', 'predicted', 'for', 'y', '06', 'consistent', 'with', 'the', 'experimentally', 'observed', 'linear', 'magnetoresistance', 'at', 'this', 'composition', 'whilst', 'it', 'is', 'possible', 'to', 'reconcile', 'theory', 'with', 'experiment', 'for', 'the', 'various', 'hall', 'effects', 'for', 'fege', 'the', 'large', 'topological', 'hall', 'resistivities', 'for', 'y', 'sim', '05', 'are', 'much', 'larger', 'then', 'expected', 'when', 'the', 'very', 'small', 'emergent', 'fields', 'associated', 'with', 'the', 'divergence', 'in', 'the', 'dmi', 'are', 'taken', 'into', 'account']] | [-0.13781039515743032, 0.22690228986684816, -0.03677043234735417, 0.0270580115771736, -0.027294172810312982, -0.14558841580874288, 0.05475495911668986, 0.3868805180614193, -0.28347995841274193, -0.32192475573392587, -0.01908324302882344, -0.3301935493402804, -0.06692674465108818, 0.19682650652636463, 0.05032007969760646, 0.025938192421381245, -0.0674016940058209, -0.0651962255690402, -0.1349197583857555, -0.23087993285783645, 0.2678992325769893, 0.0003765073624284317, 0.30143157950757693, 0.0806527437409386, 0.0758509915152293, -0.01894618264050223, 0.09373844692502947, 0.07030615787953139, -0.18332915151064905, 0.01648604414658621, 0.23880499013976078, -0.1450482931085086, 0.13108961273780248, -0.41423950479365884, -0.16912236585461263, -0.037930724007310346, 0.08945219193313582, 0.11327149406085178, -0.046207504570581176, -0.28149209417946014, 0.10014261576385858, -0.12950429645231148, -0.10550976445083507, -0.06000622855402374, 0.03963284519316706, -0.04542932479719942, -0.2687470279432697, 0.10678821800283914, 0.04758682287404857, 0.12620905318708536, -0.09520385220045378, -0.20706155218649655, -0.12309370558787122, 0.02952728947044913, 0.09612179267472433, 0.12359473265823909, 0.18064231293295355, -0.10100929631153122, -0.11058123762389489, 0.3365496172918938, -0.08207378022610404, -0.07955205746305485, 0.10776451973360963, -0.26320955352081604, -0.08691147892871716, 0.17913935447771412, 0.0936612785095349, 0.10410569017561405, -0.08085036234654884, 0.07754113625317889, -0.008851729330490343, 0.20414682264236034, 0.0457098560242836, 0.03871802077240621, 0.2592260276083834, 0.16402133439357083, 0.009668655833835752, 0.10521673587015054, -0.17925272388990077, 0.008383683950281313, -0.2310975432987713, -0.1802431313524721, -0.21257548320184771, 0.11656701891721848, -0.099785018845796, -0.15403340335081642, 0.33344279623706824, 0.15036195610922126, 0.19896374538402975, -0.03948775200745634, 0.25021702756833597, 0.10359961899666814, 0.08389780510236354, 0.020653469968722978, 0.25808838279917834, 0.22974048817510873, 0.17213479886413552, -0.2822392336393629, 0.12996693476064441, -0.015875409010914155] |
1,803.03282 | Covering relations of k-Grassmannian permutations of type B | The main result of this work is the characterization of the covering
relations of the Bruhat order of the maximal parabolic quotients of type B. Our
approach is mainly combinatorial and is based in the pattern of the
corresponding permutations also called signed $k$-Grassmannians permutations.
We obtain that a covering relation can be classified in four different pairs of
permutations. This answers a question raised by Ikeda and Matsumura providing a
nice combinatorial model for maximal parabolic quotients of type B.
| math.CO | the main result of this work is the characterization of the covering relations of the bruhat order of the maximal parabolic quotients of type b our approach is mainly combinatorial and is based in the pattern of the corresponding permutations also called signed kgrassmannians permutations we obtain that a covering relation can be classified in four different pairs of permutations this answers a question raised by ikeda and matsumura providing a nice combinatorial model for maximal parabolic quotients of type b | [['the', 'main', 'result', 'of', 'this', 'work', 'is', 'the', 'characterization', 'of', 'the', 'covering', 'relations', 'of', 'the', 'bruhat', 'order', 'of', 'the', 'maximal', 'parabolic', 'quotients', 'of', 'type', 'b', 'our', 'approach', 'is', 'mainly', 'combinatorial', 'and', 'is', 'based', 'in', 'the', 'pattern', 'of', 'the', 'corresponding', 'permutations', 'also', 'called', 'signed', 'kgrassmannians', 'permutations', 'we', 'obtain', 'that', 'a', 'covering', 'relation', 'can', 'be', 'classified', 'in', 'four', 'different', 'pairs', 'of', 'permutations', 'this', 'answers', 'a', 'question', 'raised', 'by', 'ikeda', 'and', 'matsumura', 'providing', 'a', 'nice', 'combinatorial', 'model', 'for', 'maximal', 'parabolic', 'quotients', 'of', 'type', 'b']] | [-0.15343255989719182, 0.07927049075224205, -0.07085392554290593, 0.05593377535842592, -0.10995811832253821, -0.10314263080363162, 0.07531357774860226, 0.2779074216843583, -0.3317289422324393, -0.2969954469939694, 0.10634077746944967, -0.24207195655908437, -0.14748486665776, 0.21206100752169732, -0.15772979779867455, 0.019684401247650384, 0.022102355427341534, 0.04160403939895332, -0.07747081302204606, -0.2924966740538366, 0.3621586384484544, -0.03808294690097682, 0.2372061088681221, 0.040682125650346276, 0.06213898170390166, -0.008618323196424171, -0.11570110626053065, 0.029377925173321273, -0.1615427529065528, 0.1505219450547884, 0.23707293905317783, 0.13954654983244835, 0.21505584643455222, -0.3035163173917681, -0.10065344931936124, 0.14446835445560283, 0.15081932119792327, 0.03709767529508099, -0.025917520048096776, -0.2566910111578181, 0.11304540221462958, -0.172908259218093, -0.13056195411481894, 0.006363859138218686, 0.06500915493816137, 0.06180826846975833, -0.2734842752106488, 0.02481795388412138, 0.17062943400815128, 0.10482400056207553, -0.022264979657484217, -0.09705033518839627, -0.0076543720293557275, 0.10246088540443452, -0.005035840392520185, 0.007203084992943332, 0.003971832268871367, -0.07068179896450602, -0.17501596605870873, 0.3952294185757637, 0.007780611030466389, -0.18642456774250604, 0.12379304492787924, -0.16235260072862728, -0.15965395478269784, 0.11016513871727511, 0.10763432431267575, 0.15602917711366898, -0.11218482521362602, 0.11220935433957493, -0.20929035594454035, 0.06818598454701714, 0.14422689528437332, 0.0099763541307766, 0.138158786483109, 0.1472127566288691, 0.06849510516040028, 0.16040621906140587, 0.0081088439153973, -0.020998456730740144, -0.3050595229608007, -0.15142371053807438, -0.11445701556513085, 0.09960256050108, -0.10023501795330958, -0.17680633942363783, 0.4532074022106826, 0.06896440122218336, 0.22808785636734683, 0.07966940280748531, 0.1845493785571307, 0.077519064671651, 0.048137473764654715, -0.007648185719881439, 0.14165347687667235, 0.2160568165156292, -0.012824195047141985, -0.18073235353804193, 0.025381325936177746, 0.2132725891598966] |
1,803.03283 | Cosmological analysis of a DGP stable model with $H(z)$ observations a
revision | In this paper, we will present a Dvali-Gabadadze-Porrati stable model in
order to perform an observational test using $H(z)$ data and radial BAO scale
in the galaxy distribution. In this vein, we study the tension between
constraints on the cosmological constant $\Lambda$ and the crossover scale
$r_c$, which is associated with the DGP model. Our results show that
observations do not favor the DGP stable model as a possible candidate to fit
the observations of the late cosmic acceleration.
| gr-qc | in this paper we will present a dvaligabadadzeporrati stable model in order to perform an observational test using hz data and radial bao scale in the galaxy distribution in this vein we study the tension between constraints on the cosmological constant lambda and the crossover scale r_c which is associated with the dgp model our results show that observations do not favor the dgp stable model as a possible candidate to fit the observations of the late cosmic acceleration | [['in', 'this', 'paper', 'we', 'will', 'present', 'a', 'dvaligabadadzeporrati', 'stable', 'model', 'in', 'order', 'to', 'perform', 'an', 'observational', 'test', 'using', 'hz', 'data', 'and', 'radial', 'bao', 'scale', 'in', 'the', 'galaxy', 'distribution', 'in', 'this', 'vein', 'we', 'study', 'the', 'tension', 'between', 'constraints', 'on', 'the', 'cosmological', 'constant', 'lambda', 'and', 'the', 'crossover', 'scale', 'r_c', 'which', 'is', 'associated', 'with', 'the', 'dgp', 'model', 'our', 'results', 'show', 'that', 'observations', 'do', 'not', 'favor', 'the', 'dgp', 'stable', 'model', 'as', 'a', 'possible', 'candidate', 'to', 'fit', 'the', 'observations', 'of', 'the', 'late', 'cosmic', 'acceleration']] | [-0.07767866679196116, 0.07624030193550471, -0.11613600933334872, 0.08985039638208013, -0.1291754807145158, -0.11734728825785502, 0.007506803967518425, 0.34558357331383077, -0.21477883283190335, -0.31291241019586974, 0.07116741349897053, -0.2537658234138655, -0.08048743943542336, 0.15089435185028735, -0.010391341934947274, -0.0009934991786751566, 0.06475625445335349, 0.00913463279463445, -0.030146395679286245, -0.2652731730920982, 0.319112936689819, 0.154074148510736, 0.25579922269702643, -0.010881054957833472, 0.050973250031105796, -0.1289597275862883, -0.038451801207435285, 0.022040351223247715, -0.2654019225705776, 0.056906479432194526, 0.18367958740225132, 0.12883393543689878, 0.21203702153001405, -0.3873112782529449, -0.2541128329555445, 0.12596254561190742, 0.16635413935313684, 0.12746422728847806, -0.03454091883989499, -0.2600823252732995, 0.05223712788399639, -0.17291471887898596, -0.1321115961911369, -0.015186039129672925, -0.01934276179327995, -0.04211880441142034, -0.2750380404317115, 0.1641864881532479, 0.020342813734012314, -0.014455866398690622, -0.12908525820349967, -0.035951593083246976, -0.00468936394841139, 0.03524884932285434, 0.10357332633236493, 0.048138328147108986, 0.07212300315098483, -0.12499778468421177, -0.08022246080674703, 0.4130243932521796, -0.16029283371783462, -0.1257747359149441, 0.1774820199566363, -0.16917988781734736, -0.17778499507569248, 0.006631235553753338, 0.160838314992246, 0.08460131285216989, -0.1124940401509027, 0.11519472801297478, -0.008544329844144043, 0.20186456955403467, 0.03983722604764036, -0.05249089963090919, 0.2752459206017135, 0.19466804543250724, 0.03735740840894795, 0.06580697256140411, -0.18405230224052962, -0.055954030267687964, -0.37055750004947186, -0.09898816966274872, -0.1515055585982679, 0.03371198794047814, -0.1470613954349309, -0.17215442051521584, 0.3718978916353817, 0.2017087041742251, 0.27073675439445466, 0.1090313638192071, 0.2889829539469903, 0.01576178418943965, 0.05810953210155138, 0.05595751117938493, 0.30355412108658614, 0.051386561327248434, 0.09990558744396401, -0.2327201125282747, 0.02513788821458628, -0.01515928508206919] |
1,803.03284 | The role of second viscosity in the velocity shear-induced heating
mechanism | In the present paper we study the influence of second viscosity on
non-modally induced heating mechanism. For this purpose we study the set of
equations governing the hydrodynamic system. In particular, we consider the
Navier Stokes equation, the continuity equation and the equation of state,
linearise them and analyse in the context of non-modal instabilities. Unlike
previous studies in the Navier Stokes equation we include the contribution of
compressibility, thus the second viscosity. By analysing several typical cases
we show that under certain conditions the second viscosity might significantly
change efficiency of the mechanism of heating.
| physics.plasm-ph physics.flu-dyn | in the present paper we study the influence of second viscosity on nonmodally induced heating mechanism for this purpose we study the set of equations governing the hydrodynamic system in particular we consider the navier stokes equation the continuity equation and the equation of state linearise them and analyse in the context of nonmodal instabilities unlike previous studies in the navier stokes equation we include the contribution of compressibility thus the second viscosity by analysing several typical cases we show that under certain conditions the second viscosity might significantly change efficiency of the mechanism of heating | [['in', 'the', 'present', 'paper', 'we', 'study', 'the', 'influence', 'of', 'second', 'viscosity', 'on', 'nonmodally', 'induced', 'heating', 'mechanism', 'for', 'this', 'purpose', 'we', 'study', 'the', 'set', 'of', 'equations', 'governing', 'the', 'hydrodynamic', 'system', 'in', 'particular', 'we', 'consider', 'the', 'navier', 'stokes', 'equation', 'the', 'continuity', 'equation', 'and', 'the', 'equation', 'of', 'state', 'linearise', 'them', 'and', 'analyse', 'in', 'the', 'context', 'of', 'nonmodal', 'instabilities', 'unlike', 'previous', 'studies', 'in', 'the', 'navier', 'stokes', 'equation', 'we', 'include', 'the', 'contribution', 'of', 'compressibility', 'thus', 'the', 'second', 'viscosity', 'by', 'analysing', 'several', 'typical', 'cases', 'we', 'show', 'that', 'under', 'certain', 'conditions', 'the', 'second', 'viscosity', 'might', 'significantly', 'change', 'efficiency', 'of', 'the', 'mechanism', 'of', 'heating']] | [-0.17624645084142684, 0.07342526247038653, -0.06122714709490538, 0.012564645549527517, -0.07355717272301646, -0.04181755495894896, -0.009217485992581044, 0.24878732444424378, -0.31055840258241485, -0.2635494786706802, 0.10556976178072786, -0.2566020450897907, -0.1421893335878849, 0.1820474905010901, -0.028983179566842553, 0.06188394987073384, 0.057416763773040946, -0.01841026423744073, -0.05464864976851171, -0.19941770773822148, 0.4157311872824242, 0.00911526637838075, 0.27118167772300933, 0.05473565975583992, 0.07931116300291921, -0.04305429076040654, -0.053069174230883, 0.04282347886762995, -0.22830361761436124, 0.03192786367512063, 0.1491554989724567, 0.04738151834983575, 0.2800597322614569, -0.4686260912371309, -0.27713520730796615, 0.07620937846797077, 0.11352404345219072, 0.1264024088943475, -0.021061834601048185, -0.21457361047107137, 0.05339882424052216, -0.15928376512847056, -0.15245953862016137, -0.052770465034011164, 0.006811641744877163, 0.04941556381649877, -0.2526569961913322, 0.1713391116085021, 0.11623151004069338, 0.014334805888172828, -0.1827428590040654, -0.07864798341608165, -0.016321025592716115, 0.06465594888615765, 0.08248936570323023, -0.06377527299092005, 0.1072961985721792, -0.21139424355749628, -0.03129641680341018, 0.4054472219787146, -0.10713822468870172, -0.235465796213401, 0.18443730512731954, -0.18476071376598588, -0.12698810367207777, 0.10260006310908418, 0.21402474004579217, 0.16752541741650356, -0.16507720645321042, 0.05199739062840021, -0.05031490667208441, 0.12548750736995748, 0.06849316900694057, -0.026284107291384747, 0.10773980578309611, 0.16705151211813485, 0.03903440783462046, 0.195065714614956, -0.07600004956843086, -0.10237285488187091, -0.3528166799953109, -0.1766095046248091, -0.11190080061358841, 0.0402683504612038, -0.06966205232893116, -0.1378054912251077, 0.3948722684645633, 0.24600790446244278, 0.13936889688239285, 0.021274045913627273, 0.2754154266495454, 0.1914861481914015, -0.0261621802702154, 0.06240631401980002, 0.2876411955754616, 0.15913639045320452, 0.16731532713594405, -0.3435775640454315, 0.06840091091825774, 0.13186826660836998] |
1,803.03285 | Massive UAV-to-Ground Communication and its Stable Movement Control: A
Mean-Field Approach | This paper proposes a real-time movement control algorithm for massive
unmanned aerial vehicles (UAVs) that provide emergency cellular connections in
an urban disaster site. While avoiding the inter-UAV collision under temporal
wind dynamics, the proposed algorithm minimizes each UAV's energy consumption
per unit downlink rate. By means of a mean-field game theoretic flocking
approach, the velocity control of each UAV only requires its own location and
channel states. Numerical results validate the performance of the algorithm in
terms of the number of collisions and energy consumption per data rate, under a
realistic 3GPP UAV channel model.
| cs.NI cs.IT math.IT | this paper proposes a realtime movement control algorithm for massive unmanned aerial vehicles uavs that provide emergency cellular connections in an urban disaster site while avoiding the interuav collision under temporal wind dynamics the proposed algorithm minimizes each uavs energy consumption per unit downlink rate by means of a meanfield game theoretic flocking approach the velocity control of each uav only requires its own location and channel states numerical results validate the performance of the algorithm in terms of the number of collisions and energy consumption per data rate under a realistic 3gpp uav channel model | [['this', 'paper', 'proposes', 'a', 'realtime', 'movement', 'control', 'algorithm', 'for', 'massive', 'unmanned', 'aerial', 'vehicles', 'uavs', 'that', 'provide', 'emergency', 'cellular', 'connections', 'in', 'an', 'urban', 'disaster', 'site', 'while', 'avoiding', 'the', 'interuav', 'collision', 'under', 'temporal', 'wind', 'dynamics', 'the', 'proposed', 'algorithm', 'minimizes', 'each', 'uavs', 'energy', 'consumption', 'per', 'unit', 'downlink', 'rate', 'by', 'means', 'of', 'a', 'meanfield', 'game', 'theoretic', 'flocking', 'approach', 'the', 'velocity', 'control', 'of', 'each', 'uav', 'only', 'requires', 'its', 'own', 'location', 'and', 'channel', 'states', 'numerical', 'results', 'validate', 'the', 'performance', 'of', 'the', 'algorithm', 'in', 'terms', 'of', 'the', 'number', 'of', 'collisions', 'and', 'energy', 'consumption', 'per', 'data', 'rate', 'under', 'a', 'realistic', '3gpp', 'uav', 'channel', 'model']] | [-0.2612964939463908, 0.046178906328982285, -0.014211975234119515, 0.021527395415806064, -0.031613280957466676, -0.1893178549644194, 0.13640731800666178, 0.3819867636812361, -0.23694542440536775, -0.3334276911263403, 0.05342101260872656, -0.22556293392063756, -0.1584228798354927, 0.15568237312285133, -0.1820433407629791, 0.10585264000784311, 0.12496890976632896, 0.09896046812186557, 0.07148910725342209, -0.2582032485803785, 0.1910847109448361, 0.13726200831465815, 0.35505812992831987, 0.03180496607237728, 0.14674985443217387, 0.03278134622071919, 0.019974663236031406, -0.06258530807926467, -0.12501886198090353, 0.11010992893134244, 0.29279320606667747, 0.2098907328112737, 0.3641077323571632, -0.49833620229834, -0.27361773143914575, 0.09664414520620515, 0.1652679484925772, 0.03069287453974156, -0.06427888758112922, -0.32164004015687264, 0.0800703177179553, -0.3001616996075762, -0.10692357045390007, 0.03077500502725965, -0.03755390980329953, 0.10577630534657817, -0.33653370998799803, 0.018599643852365646, -0.08120176670582671, 0.1122690732933973, -0.1457789384429098, -0.03597504728914876, -0.038319041109398794, 0.18319015793110194, 0.053427630147014404, -0.020286445523073016, 0.19437127030013424, -0.1409559117372785, -0.13117441767336507, 0.42477180399000647, 0.08162102970343671, -0.21266230291834004, 0.12803970032347073, -0.04166313838703852, -0.07790868955811388, 0.17973953452157346, 0.26373896521369095, 0.0786606762362154, -0.21966141540753215, 0.008452982919927883, -0.03152750321222763, 0.14943882743582915, 0.04879353615994516, 0.04682087149029892, 0.15251760280593055, 0.2821992801012177, 0.23285312362407384, 0.08561298792544557, -0.16242757347461426, -0.16876495960903795, -0.23104835819747102, -0.11942450551708278, -0.18645816403686216, -0.029719223557530264, -0.11746825893305389, -0.027955391276382694, 0.37749473489820956, 0.16424093766039924, 0.1083449163149405, 0.13287228341949614, 0.45045427566296176, 0.07857858619015468, 0.003350579601369406, 0.15067167144366786, 0.11804014650222502, 0.024928347827670606, 0.20436025738569075, -0.2836831614963318, 0.07535813805206042, 0.061811003642842956] |
1,803.03286 | Atomic motion in solids with dimpled potentials | Polymorphic solids of the same chemical composition can have different atomic
structures; in each polymorph atoms vibrate around a local potential energy
minimum (LPEM). If transformations to other structures have sufficiently high
enthalpy barriers, then each polymorph is either stable or metastable; it is
stationary and does not spontaneously change with time. But what happens, if
those barriers are low? As examples, we consider NiTi shape memory alloy
exhibiting a large elastocaloric effect, and selected elemental solids. We
suggest a model for dynamically polymorphic solids, where multiple LPEMs are
visited by ergodic motion of a single atom. We predict that upon cooling a
dynamically polymorphic phase should undergo a symmetry-breaking first-order
phase transition, accompanied by a finite change of the lattice entropy. We
discuss 3 methods used to calculate phonons in solids with non-harmonic dimpled
atomic potentials, and compare theoretical predictions to experiment.
| cond-mat.mtrl-sci cond-mat.other physics.app-ph physics.comp-ph physics.data-an | polymorphic solids of the same chemical composition can have different atomic structures in each polymorph atoms vibrate around a local potential energy minimum lpem if transformations to other structures have sufficiently high enthalpy barriers then each polymorph is either stable or metastable it is stationary and does not spontaneously change with time but what happens if those barriers are low as examples we consider niti shape memory alloy exhibiting a large elastocaloric effect and selected elemental solids we suggest a model for dynamically polymorphic solids where multiple lpems are visited by ergodic motion of a single atom we predict that upon cooling a dynamically polymorphic phase should undergo a symmetrybreaking firstorder phase transition accompanied by a finite change of the lattice entropy we discuss 3 methods used to calculate phonons in solids with nonharmonic dimpled atomic potentials and compare theoretical predictions to experiment | [['polymorphic', 'solids', 'of', 'the', 'same', 'chemical', 'composition', 'can', 'have', 'different', 'atomic', 'structures', 'in', 'each', 'polymorph', 'atoms', 'vibrate', 'around', 'a', 'local', 'potential', 'energy', 'minimum', 'lpem', 'if', 'transformations', 'to', 'other', 'structures', 'have', 'sufficiently', 'high', 'enthalpy', 'barriers', 'then', 'each', 'polymorph', 'is', 'either', 'stable', 'or', 'metastable', 'it', 'is', 'stationary', 'and', 'does', 'not', 'spontaneously', 'change', 'with', 'time', 'but', 'what', 'happens', 'if', 'those', 'barriers', 'are', 'low', 'as', 'examples', 'we', 'consider', 'niti', 'shape', 'memory', 'alloy', 'exhibiting', 'a', 'large', 'elastocaloric', 'effect', 'and', 'selected', 'elemental', 'solids', 'we', 'suggest', 'a', 'model', 'for', 'dynamically', 'polymorphic', 'solids', 'where', 'multiple', 'lpems', 'are', 'visited', 'by', 'ergodic', 'motion', 'of', 'a', 'single', 'atom', 'we', 'predict', 'that', 'upon', 'cooling', 'a', 'dynamically', 'polymorphic', 'phase', 'should', 'undergo', 'a', 'symmetrybreaking', 'firstorder', 'phase', 'transition', 'accompanied', 'by', 'a', 'finite', 'change', 'of', 'the', 'lattice', 'entropy', 'we', 'discuss', '3', 'methods', 'used', 'to', 'calculate', 'phonons', 'in', 'solids', 'with', 'nonharmonic', 'dimpled', 'atomic', 'potentials', 'and', 'compare', 'theoretical', 'predictions', 'to', 'experiment']] | [-0.1093594313562841, 0.2879193293736547, -0.081174027361306, 0.0553708224151125, -0.03073473717086017, -0.19125887371454361, 0.10645705040095123, 0.4395906319693127, -0.28695047246490385, -0.26734300322685367, 0.035005566545973484, -0.28887898160527786, -0.12362959491359797, 0.1032165460096976, -0.011494465304393294, 0.030645193566579756, 0.013732175075231081, 0.016843566380388347, -0.08712719999260354, -0.2107018487518059, 0.2595244031201335, 0.022469719478873707, 0.26577961446175763, 0.012234528294718224, 0.049119377543436406, -0.06089000672214261, 0.08616418436463552, 0.03856890407186134, -0.15410184087290582, 0.029048569838958958, 0.23663112112974866, 0.006670770238662231, 0.23103167042664602, -0.47930197777054834, -0.24393847006115507, 0.10550879805467706, 0.10939666008616382, 0.17821804955205384, -0.08152966681332822, -0.2172371533877672, 0.0724690851944512, -0.15401363796851736, -0.12731983334962146, -0.13931703302639384, 0.04132830920292342, 0.06782086497397287, -0.22403594777186184, 0.06382790767977424, 0.0503987802047256, 0.07579709843448396, -0.13570831674613482, -0.08929583918821754, -0.08775126265117515, 0.07024740516571394, -0.008693731246278324, 0.007901953476322617, 0.22610991665472588, -0.06188598964429388, -0.09250016779975688, 0.45206710685652196, -0.057897849622717566, -0.12425928066999829, 0.22724890312946117, -0.14165466916185956, -0.12940405485557116, 0.1921070901898284, 0.12598358083133263, 0.1125488750874362, -0.12248110866953507, 0.039730409856064984, 0.05370654730648067, 0.1912651255872127, 0.09864919329498043, 0.027415332828602153, 0.2300434042336353, 0.1562768181138639, 0.029030665398595182, 0.15470307094832644, -0.057791195974969276, -0.11605428212738418, -0.23105404464939133, -0.1393546211477105, -0.1867275637399458, 0.023205195284545163, -0.06712418596447257, -0.21151663166807688, 0.33299706562534503, 0.07963524185449665, 0.19918229395906764, -0.022963104181112193, 0.2120968127220288, 0.07865141088998355, 0.09093221523039413, 0.024518504136090056, 0.2188358229802961, 0.07111352255257468, 0.08021832992989861, -0.22980647291393674, 0.09974104611257567, 0.04773824321806219] |
1,803.03287 | The Noise-Sensitivity Phase Transition in Spectral Group Synchronization
Over Compact Groups | In Group Synchronization, one attempts to find a collection of unknown group
elements from noisy measurements of their pairwise differences. Several
important problems in vision and data analysis reduce to group synchronization
over various compact groups. Spectral Group Synchronization is a commonly used,
robust algorithm for solving group synchronization problems, which relies on
diagonalization of a block matrix whose blocks are matrix representations of
the measured pairwise differences. Assuming uniformly distributed measurement
errors, we present a rigorous analysis of the accuracy and noise sensitivity of
spectral group synchronization algorithms over any compact group, up to the
rounding error. We identify a Baik-Ben Arous-P\'ech\'e type phase transition in
the noise level, beyond which spectral group synchronization necessarily fails.
Below the phase transition, spectral group synchronization succeeds in
recovering the unknown group elements, but its performance deteriorates with
the noise level. We provide asymptotically exact formulas for the accuracy of
spectral group synchronization below the phase transition, up to the rounding
error. We also provide a consistent risk estimate, allowing practitioners to
estimate the method's accuracy from available measurements.
| cs.IT math.IT | in group synchronization one attempts to find a collection of unknown group elements from noisy measurements of their pairwise differences several important problems in vision and data analysis reduce to group synchronization over various compact groups spectral group synchronization is a commonly used robust algorithm for solving group synchronization problems which relies on diagonalization of a block matrix whose blocks are matrix representations of the measured pairwise differences assuming uniformly distributed measurement errors we present a rigorous analysis of the accuracy and noise sensitivity of spectral group synchronization algorithms over any compact group up to the rounding error we identify a baikben arouspeche type phase transition in the noise level beyond which spectral group synchronization necessarily fails below the phase transition spectral group synchronization succeeds in recovering the unknown group elements but its performance deteriorates with the noise level we provide asymptotically exact formulas for the accuracy of spectral group synchronization below the phase transition up to the rounding error we also provide a consistent risk estimate allowing practitioners to estimate the methods accuracy from available measurements | [['in', 'group', 'synchronization', 'one', 'attempts', 'to', 'find', 'a', 'collection', 'of', 'unknown', 'group', 'elements', 'from', 'noisy', 'measurements', 'of', 'their', 'pairwise', 'differences', 'several', 'important', 'problems', 'in', 'vision', 'and', 'data', 'analysis', 'reduce', 'to', 'group', 'synchronization', 'over', 'various', 'compact', 'groups', 'spectral', 'group', 'synchronization', 'is', 'a', 'commonly', 'used', 'robust', 'algorithm', 'for', 'solving', 'group', 'synchronization', 'problems', 'which', 'relies', 'on', 'diagonalization', 'of', 'a', 'block', 'matrix', 'whose', 'blocks', 'are', 'matrix', 'representations', 'of', 'the', 'measured', 'pairwise', 'differences', 'assuming', 'uniformly', 'distributed', 'measurement', 'errors', 'we', 'present', 'a', 'rigorous', 'analysis', 'of', 'the', 'accuracy', 'and', 'noise', 'sensitivity', 'of', 'spectral', 'group', 'synchronization', 'algorithms', 'over', 'any', 'compact', 'group', 'up', 'to', 'the', 'rounding', 'error', 'we', 'identify', 'a', 'baikben', 'arouspeche', 'type', 'phase', 'transition', 'in', 'the', 'noise', 'level', 'beyond', 'which', 'spectral', 'group', 'synchronization', 'necessarily', 'fails', 'below', 'the', 'phase', 'transition', 'spectral', 'group', 'synchronization', 'succeeds', 'in', 'recovering', 'the', 'unknown', 'group', 'elements', 'but', 'its', 'performance', 'deteriorates', 'with', 'the', 'noise', 'level', 'we', 'provide', 'asymptotically', 'exact', 'formulas', 'for', 'the', 'accuracy', 'of', 'spectral', 'group', 'synchronization', 'below', 'the', 'phase', 'transition', 'up', 'to', 'the', 'rounding', 'error', 'we', 'also', 'provide', 'a', 'consistent', 'risk', 'estimate', 'allowing', 'practitioners', 'to', 'estimate', 'the', 'methods', 'accuracy', 'from', 'available', 'measurements']] | [-0.15966920954396285, 0.05262321226382997, -0.09438192002517355, 0.055681062702452606, -0.06471100453902984, -0.15262445425719948, 0.12473714302917469, 0.4105238844351159, -0.2600740316813275, -0.3123983569616862, 0.15448950782502438, -0.265708608689618, -0.1396618230711658, 0.17319922015533945, -0.0991572322093554, 0.06186410048575335, 0.06842787144968739, 0.08515092555603201, -0.1623249117450757, -0.21084152584064142, 0.2685678655782841, 0.04907770803208742, 0.2716899298744455, -0.05394231726673279, 0.086160943890122, -0.023211197239625673, -0.04299907479961376, -0.008670831698987443, -0.08529213567574818, 0.10443151551088328, 0.31796758883438037, 0.09059391396993634, 0.2683202394108041, -0.35541122341475917, -0.20317419802264894, 0.17010656080608608, 0.14903580104421804, 0.11828101129207949, -0.05217696158846809, -0.32074668624643554, 0.07748887166880744, -0.14458042661669943, -0.07794102001409073, -0.08230266993139256, -0.022510183360795938, 0.011060501821076044, -0.27601977837624525, 0.09633658872506223, 0.0360163589360687, 0.07970366952414651, -0.01825997514168779, -0.11341633661623812, 0.0658622663540471, 0.19650465933774403, 0.008588699603882108, -0.011378719348731414, 0.14466108197062197, -0.060033834544615555, -0.0991001157050605, 0.3816668193808383, -0.05298087056620983, -0.17012692314683128, 0.1620758586000167, -0.1291013321257854, -0.16771428127336385, 0.1855104533734463, 0.19301814578689297, 0.06453552618977945, -0.11537591600527534, 0.05917807667066296, 0.02160369483280485, 0.22371279711816672, 0.01591776356648254, 0.03952643044337651, 0.09316790749655647, 0.15782089937757174, 0.11637420645036266, 0.06953751690367416, -0.04712847269161231, -0.05626049255794388, -0.28646672449974436, -0.08966269084886454, -0.17346316305157533, 0.00500331358000173, -0.15464378522408437, -0.18289917517100898, 0.41035265313450897, 0.16897391677586793, 0.16836095645255542, 0.11589210263800696, 0.2864357144624458, 0.07784863814348512, 0.04176958781498679, 0.10091340063287124, 0.18752411027086405, 0.197454699762376, 0.0017776419132379657, -0.2383256607260134, 0.05143484136479049, 0.08095265036227844] |
1,803.03288 | TicTac: Accelerating Distributed Deep Learning with Communication
Scheduling | State-of-the-art deep learning systems rely on iterative distributed training
to tackle the increasing complexity of models and input data. The iteration
time in these communication-heavy systems depends on the computation time,
communication time and the extent of overlap of computation and communication.
In this work, we identify a shortcoming in systems with graph representation
for computation, such as TensorFlow and PyTorch, that result in high variance
in iteration time --- random order of received parameters across workers. We
develop a system, TicTac, to improve the iteration time by fixing this issue in
distributed deep learning with Parameter Servers while guaranteeing
near-optimal overlap of communication and computation. TicTac identifies and
enforces an order of network transfers which improves the iteration time using
prioritization. Our system is implemented over TensorFlow and requires no
changes to the model or developer inputs. TicTac improves the throughput by up
to $37.7\%$ in inference and $19.2\%$ in training, while also reducing
straggler effect by up to $2.3\times$. Our code is publicly available.
| cs.DC cs.LG cs.PF | stateoftheart deep learning systems rely on iterative distributed training to tackle the increasing complexity of models and input data the iteration time in these communicationheavy systems depends on the computation time communication time and the extent of overlap of computation and communication in this work we identify a shortcoming in systems with graph representation for computation such as tensorflow and pytorch that result in high variance in iteration time random order of received parameters across workers we develop a system tictac to improve the iteration time by fixing this issue in distributed deep learning with parameter servers while guaranteeing nearoptimal overlap of communication and computation tictac identifies and enforces an order of network transfers which improves the iteration time using prioritization our system is implemented over tensorflow and requires no changes to the model or developer inputs tictac improves the throughput by up to 377 in inference and 192 in training while also reducing straggler effect by up to 23times our code is publicly available | [['stateoftheart', 'deep', 'learning', 'systems', 'rely', 'on', 'iterative', 'distributed', 'training', 'to', 'tackle', 'the', 'increasing', 'complexity', 'of', 'models', 'and', 'input', 'data', 'the', 'iteration', 'time', 'in', 'these', 'communicationheavy', 'systems', 'depends', 'on', 'the', 'computation', 'time', 'communication', 'time', 'and', 'the', 'extent', 'of', 'overlap', 'of', 'computation', 'and', 'communication', 'in', 'this', 'work', 'we', 'identify', 'a', 'shortcoming', 'in', 'systems', 'with', 'graph', 'representation', 'for', 'computation', 'such', 'as', 'tensorflow', 'and', 'pytorch', 'that', 'result', 'in', 'high', 'variance', 'in', 'iteration', 'time', 'random', 'order', 'of', 'received', 'parameters', 'across', 'workers', 'we', 'develop', 'a', 'system', 'tictac', 'to', 'improve', 'the', 'iteration', 'time', 'by', 'fixing', 'this', 'issue', 'in', 'distributed', 'deep', 'learning', 'with', 'parameter', 'servers', 'while', 'guaranteeing', 'nearoptimal', 'overlap', 'of', 'communication', 'and', 'computation', 'tictac', 'identifies', 'and', 'enforces', 'an', 'order', 'of', 'network', 'transfers', 'which', 'improves', 'the', 'iteration', 'time', 'using', 'prioritization', 'our', 'system', 'is', 'implemented', 'over', 'tensorflow', 'and', 'requires', 'no', 'changes', 'to', 'the', 'model', 'or', 'developer', 'inputs', 'tictac', 'improves', 'the', 'throughput', 'by', 'up', 'to', '377', 'in', 'inference', 'and', '192', 'in', 'training', 'while', 'also', 'reducing', 'straggler', 'effect', 'by', 'up', 'to', '23times', 'our', 'code', 'is', 'publicly', 'available']] | [-0.13300713537768885, 0.025204380187576383, -0.03283170402106462, -0.0024406669435627533, -0.06344429738819599, -0.17024165558995621, 0.1337151306519059, 0.3964478935481924, -0.2750849161494636, -0.39550331893066565, 0.09566296528121739, -0.24316790622630804, -0.09604144621442891, 0.1761541209776293, -0.11748055695965322, 0.11246090968224136, 0.11019001526362968, 0.022457128852097826, -0.059870229007598634, -0.32931667764787564, 0.26268936981249486, 0.09691999012597301, 0.28223897155751754, 0.014014384263392651, 0.11227126799481497, 0.0030565454793924636, -0.050055142940784045, -0.043578645076856694, -0.04358279805539606, 0.12740475368429377, 0.3018872379405807, 0.20654255836976296, 0.33790343613222695, -0.4180980437406988, -0.19595337361908716, 0.08805889511255152, 0.18651085608836376, 0.0910735836443068, 0.00026008729597158507, -0.25995341607115485, 0.09880059984032855, -0.18354873903885935, -0.004307472226068829, -0.09951285040852699, -0.014746679489811261, 0.013882447293056457, -0.29101236871810576, 0.0327111521607025, 0.03405794669224909, 0.05923874970299728, -0.02315758311217933, -0.10424837447053781, 0.01734025227752599, 0.157590701296982, 0.038750940856918915, 0.08562051889797052, 0.12945435342068473, -0.1250428468793292, -0.12887991998118883, 0.34880635123699905, -0.04978656713342802, -0.16784820847890594, 0.1697028443090279, -0.036605032217321976, -0.17416418499002853, 0.11976699957017307, 0.25441425493565584, 0.10155423408882185, -0.13179029019718821, 0.08610559403614113, 0.04325273253136512, 0.21924122540618884, 0.05681377474225662, 0.03379971800781222, 0.08718698140882859, 0.22706950157598565, 0.09073496407575228, 0.13408688178116626, -0.07408997171247998, -0.11926039704827196, -0.2141248880970207, -0.1447886090302332, -0.2031429828694937, -0.03725479093352051, -0.11971155962356451, -0.12396120683036067, 0.37595650654737695, 0.22428245593257473, 0.18221974210023428, 0.15676685956176228, 0.36000134479818924, 0.08513605479842447, 0.13298066175458106, 0.18559040175468633, 0.16086470937977235, 0.02719331180648596, 0.13921378957545102, -0.2205090910534967, 0.09494432563695944, 0.026292062619926802] |
1,803.03289 | Deep Neural Network Compression with Single and Multiple Level
Quantization | Network quantization is an effective solution to compress deep neural
networks for practical usage. Existing network quantization methods cannot
sufficiently exploit the depth information to generate low-bit compressed
network. In this paper, we propose two novel network quantization approaches,
single-level network quantization (SLQ) for high-bit quantization and
multi-level network quantization (MLQ) for extremely low-bit quantization
(ternary).We are the first to consider the network quantization from both width
and depth level. In the width level, parameters are divided into two parts: one
for quantization and the other for re-training to eliminate the quantization
loss. SLQ leverages the distribution of the parameters to improve the width
level. In the depth level, we introduce incremental layer compensation to
quantize layers iteratively which decreases the quantization loss in each
iteration. The proposed approaches are validated with extensive experiments
based on the state-of-the-art neural networks including AlexNet, VGG-16,
GoogleNet and ResNet-18. Both SLQ and MLQ achieve impressive results.
| cs.LG cs.AI stat.ML | network quantization is an effective solution to compress deep neural networks for practical usage existing network quantization methods cannot sufficiently exploit the depth information to generate lowbit compressed network in this paper we propose two novel network quantization approaches singlelevel network quantization slq for highbit quantization and multilevel network quantization mlq for extremely lowbit quantization ternarywe are the first to consider the network quantization from both width and depth level in the width level parameters are divided into two parts one for quantization and the other for retraining to eliminate the quantization loss slq leverages the distribution of the parameters to improve the width level in the depth level we introduce incremental layer compensation to quantize layers iteratively which decreases the quantization loss in each iteration the proposed approaches are validated with extensive experiments based on the stateoftheart neural networks including alexnet vgg16 googlenet and resnet18 both slq and mlq achieve impressive results | [['network', 'quantization', 'is', 'an', 'effective', 'solution', 'to', 'compress', 'deep', 'neural', 'networks', 'for', 'practical', 'usage', 'existing', 'network', 'quantization', 'methods', 'can', 'not', 'sufficiently', 'exploit', 'the', 'depth', 'information', 'to', 'generate', 'lowbit', 'compressed', 'network', 'in', 'this', 'paper', 'we', 'propose', 'two', 'novel', 'network', 'quantization', 'approaches', 'singlelevel', 'network', 'quantization', 'slq', 'for', 'highbit', 'quantization', 'and', 'multilevel', 'network', 'quantization', 'mlq', 'for', 'extremely', 'lowbit', 'quantization', 'ternarywe', 'are', 'the', 'first', 'to', 'consider', 'the', 'network', 'quantization', 'from', 'both', 'width', 'and', 'depth', 'level', 'in', 'the', 'width', 'level', 'parameters', 'are', 'divided', 'into', 'two', 'parts', 'one', 'for', 'quantization', 'and', 'the', 'other', 'for', 'retraining', 'to', 'eliminate', 'the', 'quantization', 'loss', 'slq', 'leverages', 'the', 'distribution', 'of', 'the', 'parameters', 'to', 'improve', 'the', 'width', 'level', 'in', 'the', 'depth', 'level', 'we', 'introduce', 'incremental', 'layer', 'compensation', 'to', 'quantize', 'layers', 'iteratively', 'which', 'decreases', 'the', 'quantization', 'loss', 'in', 'each', 'iteration', 'the', 'proposed', 'approaches', 'are', 'validated', 'with', 'extensive', 'experiments', 'based', 'on', 'the', 'stateoftheart', 'neural', 'networks', 'including', 'alexnet', 'vgg16', 'googlenet', 'and', 'resnet18', 'both', 'slq', 'and', 'mlq', 'achieve', 'impressive', 'results']] | [-0.08477208626706129, 0.01790360760735424, -0.013374391423912682, 0.04283255675892814, -0.08687391374686282, -0.21326009556651115, 0.03888509101827866, 0.44264868120328077, -0.3090801644625958, -0.3040300571280562, 0.05876549236092936, -0.252644057954765, -0.21331855718022077, 0.12730948644038897, -0.14534820005102875, 0.09904407276437173, 0.13914145975452819, 0.038562303653604725, -0.10807429030659346, -0.30935649608575366, 0.2908367575564744, 0.098126320410147, 0.38656006595180703, 0.02326814819346456, 0.15943526267226227, -0.0175540138224712, 0.011636511921833933, -0.01950284561334068, -0.056657066603732945, 0.15320194936494397, 0.25175603744543457, 0.12119589354295064, 0.2846862267264548, -0.4530027338206232, -0.26303280082233005, 0.03331571596589402, 0.16510110458334773, 0.13300994660452714, 0.006740868994753102, -0.29292605761316864, 0.1527669597371463, -0.1694828524540355, 0.060580903970106854, -0.1449364544275929, -0.0831054292187046, -0.02700262361858953, -0.2951373738857607, 0.0064358489648393335, 0.03416798596522996, -0.013500440800319018, -0.06617771926354252, -0.17741484161210702, 0.030752888917192526, 0.15037703871562638, -0.026348579613327542, 0.04138944525381222, 0.12380720280244752, -0.18380473795448873, -0.1285631414609383, 0.30438071342026873, -0.06768316885279918, -0.26683812315752303, 0.11012842227876783, 0.01590083894362442, -0.1296616640197588, 0.09147977747412678, 0.22172051549488161, 0.06821940319150005, -0.11511375253877049, 0.01098770975687669, 0.03186211674215479, 0.1832119613289346, 0.07366480386292476, 0.04854865657056079, 0.12308764908754942, 0.24238210851996164, 0.05601187869815119, 0.15618727994006845, -0.20949425366768018, -0.12415019112937396, -0.22364999503019004, -0.08729682278703728, -0.17532433415580467, -0.01623057602176951, -0.10631094069105612, -0.12610108342959114, 0.4115077520361523, 0.22620285187050507, 0.25476494692935564, 0.16032669872876404, 0.3885225832730142, 0.1234480896051608, 0.1444189407454889, 0.108637760311146, 0.210264195496326, 0.0935412110042533, 0.09999758486325543, -0.18584056613050717, 0.020331648348836728, 0.10288344768904685] |
1,803.0329 | Graph-based Preconditioning Conjugate Gradient Algorithm for N-1
Contingency Analysis | Contingency analysis (CA) plays a critical role to guarantee operation
security in the modern power systems. With the high penetration of renewable
energy, a real-time and comprehensive N-1 CA is needed as a power system
analysis tool to ensure system security. In this paper, a graph-based
preconditioning conjugate gradient (GPCG) approach is proposed for the nodal
parallel computing in N-1 CA. To pursue a higher performance in the practical
application, the coefficient matrix of the base case is used as the incomplete
LU (ILU) preconditioner for each N-1 scenario. Additionally, the re-dispatch
strategy is employed to handle the islanding issues in CA. Finally, computation
performance of the proposed GPCG approach is tested on a real provincial system
in China.
| cs.DC cs.DS cs.NA math.NA | contingency analysis ca plays a critical role to guarantee operation security in the modern power systems with the high penetration of renewable energy a realtime and comprehensive n1 ca is needed as a power system analysis tool to ensure system security in this paper a graphbased preconditioning conjugate gradient gpcg approach is proposed for the nodal parallel computing in n1 ca to pursue a higher performance in the practical application the coefficient matrix of the base case is used as the incomplete lu ilu preconditioner for each n1 scenario additionally the redispatch strategy is employed to handle the islanding issues in ca finally computation performance of the proposed gpcg approach is tested on a real provincial system in china | [['contingency', 'analysis', 'ca', 'plays', 'a', 'critical', 'role', 'to', 'guarantee', 'operation', 'security', 'in', 'the', 'modern', 'power', 'systems', 'with', 'the', 'high', 'penetration', 'of', 'renewable', 'energy', 'a', 'realtime', 'and', 'comprehensive', 'n1', 'ca', 'is', 'needed', 'as', 'a', 'power', 'system', 'analysis', 'tool', 'to', 'ensure', 'system', 'security', 'in', 'this', 'paper', 'a', 'graphbased', 'preconditioning', 'conjugate', 'gradient', 'gpcg', 'approach', 'is', 'proposed', 'for', 'the', 'nodal', 'parallel', 'computing', 'in', 'n1', 'ca', 'to', 'pursue', 'a', 'higher', 'performance', 'in', 'the', 'practical', 'application', 'the', 'coefficient', 'matrix', 'of', 'the', 'base', 'case', 'is', 'used', 'as', 'the', 'incomplete', 'lu', 'ilu', 'preconditioner', 'for', 'each', 'n1', 'scenario', 'additionally', 'the', 'redispatch', 'strategy', 'is', 'employed', 'to', 'handle', 'the', 'islanding', 'issues', 'in', 'ca', 'finally', 'computation', 'performance', 'of', 'the', 'proposed', 'gpcg', 'approach', 'is', 'tested', 'on', 'a', 'real', 'provincial', 'system', 'in', 'china']] | [-0.13615105674453393, -0.011563393123009625, -0.0369346428646886, 0.04838237214438273, -0.03567507203879664, -0.1841128776945612, 0.06208753933789631, 0.3370804273173166, -0.24136740798834994, -0.28791826815117433, 0.12660465725431486, -0.26227643961055563, -0.15536537786804827, 0.1940891453291939, -0.11275825587452483, 0.09733987640307731, 0.05025853016296355, 0.023990255651385094, -0.03226211797759062, -0.2655830449315117, 0.2565521495573285, 0.12403845501390576, 0.3747702809598516, 0.04771462385347035, 0.051663844236476006, -0.017036814751307004, 0.0005570541629019906, 0.021213717578162886, -0.02313807252951029, 0.13982474633508182, 0.3178755371760921, 0.17738447761350945, 0.336139060243839, -0.40111391905288235, -0.1935319384137372, 0.09105423067504649, 0.1499507845371586, 0.0472443613630696, -0.05067567810310567, -0.19582458893658922, 0.1252182071261546, -0.2187837619459679, -0.1220580422194252, -0.09534319225080437, -0.01562804721702798, -0.007115428469010762, -0.3338982353941733, -0.005851048162253965, 0.03870818458747964, 0.09984008227514118, -0.02755177501264271, -0.11647780608882767, 0.018229859693273277, 0.09138750902596204, 8.969914027247109e-06, -0.006332328946118345, 0.12735328594606152, -0.0744567082024829, -0.10047360866510567, 0.403315555210374, -0.034407482381240945, -0.21105575125993176, 0.12462331163070846, -0.03637370410837045, -0.16761138726871053, 0.10711494777664668, 0.2069620908151905, 0.10323356076323685, -0.10835721074337405, 0.0941994330653052, 0.007311990856341705, 0.1678993298687792, 0.007078777223888065, 0.005423831086123495, 0.13066998662372284, 0.23900450946872726, 0.1228653862798477, 0.11777872502209008, -0.09156128432319946, -0.10674210145243858, -0.25022735755289943, -0.19162245437956782, -0.1607127455024033, -0.001680049395429346, -0.09572909762014091, -0.1359122604388008, 0.381640285652663, 0.17909106886906534, 0.13445852942639538, 0.0027752166062186496, 0.3703621878374775, 0.11505511815135344, 0.03079315383347268, 0.09507209368973595, 0.17273938100972847, 0.11022803127499563, 0.21361172617561802, -0.2479083448523233, 0.05741856671368875, 0.08845391457102128] |
1,803.03291 | Rapidly converging formulae for $\zeta(4k\pm 1)$ | We provide rapidly converging formulae for the Riemann zeta function at odd
integers using the Lambert series $\mathscr{L}_q(s) = \sum_{n=1}^\infty n^{s}
q^{n}/(1-q^n)$, $s=-(4k\pm 1)$. Our main formula for $\zeta(4k-1)$ converges at
rate of about $e^{-\sqrt{15}\pi}$ per term, and the formula for $\zeta(4k+1)$,
at the rate of $e^{-4\pi}$ per term. For example, the first order approximation
yields $\zeta(3)\approx\frac{\pi ^3 \sqrt{15}}{100} +e^{-\sqrt{15} \pi
}\left[\frac{9}{4}+\frac{4}{\sqrt{15}}\sinh (\frac{\sqrt{15} \pi }{2})\right]$
which has an error only of order $10^{-10}$.
| math.NT | we provide rapidly converging formulae for the riemann zeta function at odd integers using the lambert series mathscrl_qs sum_n1infty ns qn1qn s4kpm 1 our main formula for zeta4k1 converges at rate of about esqrt15pi per term and the formula for zeta4k1 at the rate of e4pi per term for example the first order approximation yields zeta3approxfracpi 3 sqrt15100 esqrt15 pi leftfrac94frac4sqrt15sinh fracsqrt15 pi 2right which has an error only of order 1010 | [['we', 'provide', 'rapidly', 'converging', 'formulae', 'for', 'the', 'riemann', 'zeta', 'function', 'at', 'odd', 'integers', 'using', 'the', 'lambert', 'series', 'mathscrl_qs', 'sum_n1infty', 'ns', 'qn1qn', 's4kpm', '1', 'our', 'main', 'formula', 'for', 'zeta4k1', 'converges', 'at', 'rate', 'of', 'about', 'esqrt15pi', 'per', 'term', 'and', 'the', 'formula', 'for', 'zeta4k1', 'at', 'the', 'rate', 'of', 'e4pi', 'per', 'term', 'for', 'example', 'the', 'first', 'order', 'approximation', 'yields', 'zeta3approxfracpi', '3', 'sqrt15100', 'esqrt15', 'pi', 'leftfrac94frac4sqrt15sinh', 'fracsqrt15', 'pi', '2right', 'which', 'has', 'an', 'error', 'only', 'of', 'order', '1010']] | [-0.155687916993362, 0.06511456352650459, -0.05949360273442552, 0.08234326498674564, 0.02754232482831986, -0.13093589893618568, 0.07221737401712625, 0.26521669603029235, -0.24202540553495533, -0.28320921271978344, 0.08393020351554771, -0.32847845972683587, -0.07546740840570848, 0.23694062591759396, 0.016245297988357603, 0.029144191198417397, -0.005343192463099468, 0.12178003231920378, -0.09441544590365203, -0.29250112041586734, 0.26311681315791413, 0.016242357138849674, 0.13638787814339653, 0.06513484005556731, 0.14456399899647862, -0.0044348189973684605, 0.029573685016299856, -0.16689561408196316, -0.18357445604213682, 0.049916484103095335, 0.22580094215246377, 0.05378677630339001, 0.2872228635871997, -0.38244642511193383, -0.09527941468003832, 0.08384560012701349, 0.1840328407153243, 0.0005050981321875922, -0.0003139603669281866, -0.16736313171654207, 0.19913731567317344, -0.1870348526806128, -0.16003151244071664, -0.058515405129702366, 0.11436226130386845, 0.024392743762887893, -0.36106331725833846, 0.14862575693452945, 0.05438702611527482, 0.03990086997080533, -0.044553209332840855, -0.22265436191142338, 0.04820701305479666, 0.11149525428648854, 0.09567737562551362, 0.16721657385713742, 0.011439221147753175, -0.08618273144038241, -0.03973503624180668, 0.3011469379617054, -0.12350456551343325, -0.18762134104112133, 0.044184452968603766, -0.1808808065309632, -0.1375013048165157, 0.19875857750045473, 0.10149384059439429, 0.1921106775398137, -0.028935338160572727, 0.08897802503073404, -0.008918641654194379, 0.19965951121793907, 0.1662799027122435, -0.0121160945015364, 0.15315971663985095, 0.08823201510688809, 0.03756157066062337, 0.11924006026543554, -0.111863211782069, -0.03467919327868301, -0.3920159298376959, -0.20416558843075497, -0.17275476904555423, 0.13056966892947428, -0.16762239104265644, -0.09461240311626529, 0.3606720011620248, 0.05547009776422723, 0.16172227677965506, 0.20089207421873742, 0.26223978126940667, 0.2486902322013267, 0.0383949237341275, 0.07113299441054372, 0.08421440108022729, 0.13110136364769862, 0.057429199819558026, -0.17047426502266136, 0.05879545212555371, 0.18192024043471108] |
1,803.03292 | Analytic growth rate of gravitational instability in self-gravitating
planar polytropes | Gravitational instability is a key process that may lead to fragmentation of
gaseous structures (sheets, filaments, haloes) in astrophysics and cosmology.
We introduce here a method to derive analytic expressions for the growth rate
of gravitational instability in a plane stratified medium. We consider a
pressure-confined, static, self-gravitating fluid of arbitrary polytropic
exponent, with both free and rigid boundary conditions. The method we detail
here can naturally be generalised to analyse the stability of more complex
systems. Our analytical results are in excellent agreement with numerical
resolutions.
| astro-ph.GA astro-ph.CO physics.flu-dyn | gravitational instability is a key process that may lead to fragmentation of gaseous structures sheets filaments haloes in astrophysics and cosmology we introduce here a method to derive analytic expressions for the growth rate of gravitational instability in a plane stratified medium we consider a pressureconfined static selfgravitating fluid of arbitrary polytropic exponent with both free and rigid boundary conditions the method we detail here can naturally be generalised to analyse the stability of more complex systems our analytical results are in excellent agreement with numerical resolutions | [['gravitational', 'instability', 'is', 'a', 'key', 'process', 'that', 'may', 'lead', 'to', 'fragmentation', 'of', 'gaseous', 'structures', 'sheets', 'filaments', 'haloes', 'in', 'astrophysics', 'and', 'cosmology', 'we', 'introduce', 'here', 'a', 'method', 'to', 'derive', 'analytic', 'expressions', 'for', 'the', 'growth', 'rate', 'of', 'gravitational', 'instability', 'in', 'a', 'plane', 'stratified', 'medium', 'we', 'consider', 'a', 'pressureconfined', 'static', 'selfgravitating', 'fluid', 'of', 'arbitrary', 'polytropic', 'exponent', 'with', 'both', 'free', 'and', 'rigid', 'boundary', 'conditions', 'the', 'method', 'we', 'detail', 'here', 'can', 'naturally', 'be', 'generalised', 'to', 'analyse', 'the', 'stability', 'of', 'more', 'complex', 'systems', 'our', 'analytical', 'results', 'are', 'in', 'excellent', 'agreement', 'with', 'numerical', 'resolutions']] | [-0.1698366028628708, 0.1222197489823675, -0.12732268749447218, 0.09862109342929602, -0.07898917264404075, -0.0693438636759917, -0.050794886077229665, 0.3689616711183997, -0.2097692292413792, -0.26667316643328504, 0.08172619507792567, -0.1869799010027414, -0.14781458991654645, 0.21154568725715167, -0.01837608816326949, 0.06735034370206125, 0.05132915520098531, -0.059758357601989616, -0.05643973697843994, -0.20160840781426978, 0.36316073180615216, 0.08183427887230084, 0.22094873222254816, 0.005052413400690788, 0.04903285447293999, -0.08811284936215172, -0.018613535525469946, 0.05961128514816706, -0.2635085923713799, 0.07501097550032254, 0.22151299381906958, 0.061154592418293845, 0.21588799546354975, -0.4681120940280714, -0.25099697051805325, 0.05475744290341591, 0.20097153572815246, 0.1473189407354756, -0.08329469063831092, -0.2306067045114335, 0.09714753010802656, -0.2194262739463613, -0.20714138065272109, -0.07149946459986527, 0.005917279124688143, 0.06469062511640569, -0.27186983962404143, 0.14752647807372027, 0.028504542016220845, -0.003633108751409441, -0.1397038488675594, -0.011643364099550179, -0.015703090487968648, 0.05413278368911866, 0.01778310658403501, 0.002118538925959461, 0.17826882474145841, -0.1584253593016116, -0.06746746878000512, 0.42718305862669287, -0.06671151503834916, -0.24826479219328398, 0.23761185821702427, -0.20047201114524713, -0.10947553062511758, 0.1390102015374678, 0.19084989828667764, 0.12170050129422853, -0.11324025896088831, 0.05569269397729558, -0.04976857157996802, 0.14951259527762217, 0.1131672228943428, -0.03024845132706272, 0.2635013210833415, 0.16551279400785765, 0.022265843865086978, 0.1539930204135612, -0.04504879647277124, -0.12707273030503727, -0.3044775158873406, -0.1540992191468162, -0.0706709835828207, 0.04070580982196348, -0.12193214422829139, -0.19846568003981963, 0.31277870153473025, 0.13981910842208556, 0.15494069400318394, 0.047252290462004555, 0.3138596573951601, 0.08002067970690029, -0.012328811608062222, 0.08678682935798819, 0.24224748019257497, 0.18142032030777172, 0.0775625321147, -0.19482948972533146, 0.008166554239417973, 0.050717579329322124] |
1,803.03293 | Hilbert transform for the three-dimensional Vekua equation | The three-dimensional Hilbert transform takes scalar data on the boundary of
a domain in R3 and produces the boundary value of the vector part of a
quaternionic monogenic (hyperholomorphic) function of three real variables, for
which the scalar part coincides with the original data. This is analogous to
the question of the boundary correspondence of harmonic conjugates.
Generalizing a representation of the Hilbert transform H in R3 given by T. Qian
and Y. Yang (valid in Rn), we define the Hilbert transform Hf associated to the
main Vekua equation DW = (Df/f)W in bounded Lipschitz domains in R3. This leads
to an investigation of the three-dimensional analogue of the
Dirichlet-to-Neumann map for the conductivity equation.
| math.AP | the threedimensional hilbert transform takes scalar data on the boundary of a domain in r3 and produces the boundary value of the vector part of a quaternionic monogenic hyperholomorphic function of three real variables for which the scalar part coincides with the original data this is analogous to the question of the boundary correspondence of harmonic conjugates generalizing a representation of the hilbert transform h in r3 given by t qian and y yang valid in rn we define the hilbert transform hf associated to the main vekua equation dw dffw in bounded lipschitz domains in r3 this leads to an investigation of the threedimensional analogue of the dirichlettoneumann map for the conductivity equation | [['the', 'threedimensional', 'hilbert', 'transform', 'takes', 'scalar', 'data', 'on', 'the', 'boundary', 'of', 'a', 'domain', 'in', 'r3', 'and', 'produces', 'the', 'boundary', 'value', 'of', 'the', 'vector', 'part', 'of', 'a', 'quaternionic', 'monogenic', 'hyperholomorphic', 'function', 'of', 'three', 'real', 'variables', 'for', 'which', 'the', 'scalar', 'part', 'coincides', 'with', 'the', 'original', 'data', 'this', 'is', 'analogous', 'to', 'the', 'question', 'of', 'the', 'boundary', 'correspondence', 'of', 'harmonic', 'conjugates', 'generalizing', 'a', 'representation', 'of', 'the', 'hilbert', 'transform', 'h', 'in', 'r3', 'given', 'by', 't', 'qian', 'and', 'y', 'yang', 'valid', 'in', 'rn', 'we', 'define', 'the', 'hilbert', 'transform', 'hf', 'associated', 'to', 'the', 'main', 'vekua', 'equation', 'dw', 'dffw', 'in', 'bounded', 'lipschitz', 'domains', 'in', 'r3', 'this', 'leads', 'to', 'an', 'investigation', 'of', 'the', 'threedimensional', 'analogue', 'of', 'the', 'dirichlettoneumann', 'map', 'for', 'the', 'conductivity', 'equation']] | [-0.16340777492233083, 0.056392840139770806, -0.06776338138213728, 0.03555804696572796, -0.11146478325260424, -0.07638649661011532, -0.04038459466733203, 0.2932700159077623, -0.30166472342953216, -0.16571926708802975, 0.09964553515150715, -0.28713651096234016, -0.13508442688766306, 0.17079363176516726, -0.08615466133089719, 0.08185082757268596, 0.0072093750556222105, 0.08878135366109818, -0.10411523172499991, -0.22190274769209523, 0.39988020725086726, -0.08802965413202095, 0.22252068650471954, 0.020856093401006894, 0.10050152802007455, 0.026875644293819778, -0.03115767436678958, -0.059085879392460385, -0.1396368305174123, 0.14266015676188126, 0.2266888526284787, 0.06372084849373957, 0.23885227759591246, -0.4013753345285633, -0.2142737963096758, 0.1392960383523816, 0.12372174906025155, -0.013085541446215218, -0.006313752183130225, -0.3249929786981207, 0.013027576020861093, -0.04606797848003957, -0.17336652851951992, -0.04724916798862076, 0.06868125271645531, -0.022034387788282032, -0.29452850911519035, 0.10271294882100702, 0.1147892251569547, 0.04725325766093699, -0.16776469110849157, -0.0871563669648516, -0.06784337173026483, 0.06730367355378328, 0.0017205795532801247, 0.15359271517995976, 0.04391213944099382, -0.10826107273001916, -0.05768600519153133, 0.3698374554679721, -0.10025820802676746, -0.2919133071812381, 0.11899786739222772, -0.21437786000706585, -0.10152832398075709, 0.10968324457979307, 0.12216387367065568, 0.13518821465395456, -0.09757604025535088, 0.2338339965780208, -0.1122901554031924, 0.10167213462589852, 0.10646147918846227, -0.022957467488981618, 0.08195209072128071, 0.09341202714363014, 0.08272169022285174, 0.20663738837135973, -0.03324120447701008, -0.09547618411448414, -0.37398924380211174, -0.2566263790003362, -0.21288565468801335, 0.08900843036517633, -0.10942507041922143, -0.20501253788516058, 0.4138882957332957, 0.08402267964639232, 0.22436565497016484, 0.04597067203376838, 0.2336806657546884, 0.1516251039394565, 0.04409299671507762, 0.05018648079522284, 0.1331102366134755, 0.1940114704100827, 0.1337327145213113, -0.20209990127786862, -0.06514968731300494, 0.19499902228195842] |
1,803.03294 | Deviations in the Franks-Misiurewicz conjecture | We show that if there exists a counter example for the rational case of the
Franks-Misiurewicz conjecture, then it must exhibit unbounded deviations in the
complementary direction of its rotation set.
| math.DS | we show that if there exists a counter example for the rational case of the franksmisiurewicz conjecture then it must exhibit unbounded deviations in the complementary direction of its rotation set | [['we', 'show', 'that', 'if', 'there', 'exists', 'a', 'counter', 'example', 'for', 'the', 'rational', 'case', 'of', 'the', 'franksmisiurewicz', 'conjecture', 'then', 'it', 'must', 'exhibit', 'unbounded', 'deviations', 'in', 'the', 'complementary', 'direction', 'of', 'its', 'rotation', 'set']] | [-0.1695143664556165, 0.1116278673552217, -0.10482459935930467, 0.07075976433172342, -0.05312756497052408, -0.1789124845677326, 0.036791844233389825, 0.375517007804686, -0.32143779783960313, -0.19077104777698556, 0.11046620101983388, -0.29706357430756813, -0.17994876938962168, 0.23461778197557695, -0.0550146565862721, -0.0228252079086228, 0.04719802096576219, 0.10225113992008471, -0.027053387707940513, -0.2542791748719831, 0.3161974177966195, -0.0908860303161125, 0.1937484576051394, 0.0638215543491946, 0.1559656047292294, -0.021010252767272534, 0.03635610034689307, 0.07898171919007455, -0.14587014355633837, 0.05685188053476234, 0.23206556540343068, 0.17214168313770525, 0.24210761896064203, -0.3724436862093787, -0.13134765370388427, 0.21442706651625135, 0.11643967386935988, 0.07910993481956181, -0.11596021566900515, -0.1649736653818118, 0.13645846495825437, -0.15197782020174688, -0.2305787898029291, -0.0577796543798139, 0.10055689670656237, -0.01635887385195782, -0.25847183432309856, 0.006344883432311397, 0.1433095734926962, 0.06975431101877362, -0.03244838596607048, -0.046736940170728394, -0.07546291790992743, 0.09752003925161497, 0.10373537711078121, 0.037764536532303015, 0.02735037855323284, -0.07810149811989357, -0.10646676057348808, 0.3589956193201004, -0.07153344275655164, -0.26062609874192744, 0.14753792338794278, -0.20297712934834342, -0.17122827928453202, 0.08468002549582912, 0.0770826365971457, 0.09199681163074509, -0.008787490727920686, 0.12481334383764695, -0.18353388993249786, 0.1598522185963849, 0.12530532785721363, -0.019080528613900947, 0.18503054012093814, 0.08775743687405221, 0.14704415385401057, 0.14984665991317841, -0.07078609615564346, -0.042277339936023756, -0.37430398166179657, -0.14986020164383995, -0.1404902871337629, 0.09869346749638358, -0.07280776594134589, -0.1850914367805085, 0.31395150486740375, 0.13887305018462, 0.153068644655568, 0.0935502082950646, 0.2502503787850841, 0.11194810625437962, 0.03733946441582615, 0.1006594403316417, 0.2733805985941041, 0.09085034864443925, 0.02368465726894717, -0.1781611853399344, 0.09507342578182297, 0.03154691876543145] |
1,803.03295 | Random walk in cooling random environment: ergodic limits and
concentration inequalities | In previous work by Avena and den Hollander, a model of a one-dimensional
random walk in a dynamic random environment was proposed where the random
environment is resampled from a given law along a growing sequence of
deterministic times. In the regime where the increments of the resampling times
diverge, which is referred to as the cooling regime, a weak law of large
numbers and certain fluctuation properties were derived under the annealed
measure. In the present paper we show that a strong law of large numbers and a
quenched large deviation principle hold as well. In the cooling regime, the
random walk can be represented as a sum of independent variables, distributed
as the increments of a random walk in a static random environment over
increasing periods of time. Our proofs require suitable multi-layer
decompositions of sums of random variables controlled by moments bounds and
concentration estimates. Along the way we derive two results of independent
interest, namely, a concentration inequality for the cumulants of the
displacement in the static random environment and an ergodic theorem that deals
with limits of sums of triangular arrays representing the structure of the
cooling regime. We close by discussing our present understanding of
homogenisation effects as a function of the speed of divergence of the
increments of the resampling times.
| math.PR | in previous work by avena and den hollander a model of a onedimensional random walk in a dynamic random environment was proposed where the random environment is resampled from a given law along a growing sequence of deterministic times in the regime where the increments of the resampling times diverge which is referred to as the cooling regime a weak law of large numbers and certain fluctuation properties were derived under the annealed measure in the present paper we show that a strong law of large numbers and a quenched large deviation principle hold as well in the cooling regime the random walk can be represented as a sum of independent variables distributed as the increments of a random walk in a static random environment over increasing periods of time our proofs require suitable multilayer decompositions of sums of random variables controlled by moments bounds and concentration estimates along the way we derive two results of independent interest namely a concentration inequality for the cumulants of the displacement in the static random environment and an ergodic theorem that deals with limits of sums of triangular arrays representing the structure of the cooling regime we close by discussing our present understanding of homogenisation effects as a function of the speed of divergence of the increments of the resampling times | [['in', 'previous', 'work', 'by', 'avena', 'and', 'den', 'hollander', 'a', 'model', 'of', 'a', 'onedimensional', 'random', 'walk', 'in', 'a', 'dynamic', 'random', 'environment', 'was', 'proposed', 'where', 'the', 'random', 'environment', 'is', 'resampled', 'from', 'a', 'given', 'law', 'along', 'a', 'growing', 'sequence', 'of', 'deterministic', 'times', 'in', 'the', 'regime', 'where', 'the', 'increments', 'of', 'the', 'resampling', 'times', 'diverge', 'which', 'is', 'referred', 'to', 'as', 'the', 'cooling', 'regime', 'a', 'weak', 'law', 'of', 'large', 'numbers', 'and', 'certain', 'fluctuation', 'properties', 'were', 'derived', 'under', 'the', 'annealed', 'measure', 'in', 'the', 'present', 'paper', 'we', 'show', 'that', 'a', 'strong', 'law', 'of', 'large', 'numbers', 'and', 'a', 'quenched', 'large', 'deviation', 'principle', 'hold', 'as', 'well', 'in', 'the', 'cooling', 'regime', 'the', 'random', 'walk', 'can', 'be', 'represented', 'as', 'a', 'sum', 'of', 'independent', 'variables', 'distributed', 'as', 'the', 'increments', 'of', 'a', 'random', 'walk', 'in', 'a', 'static', 'random', 'environment', 'over', 'increasing', 'periods', 'of', 'time', 'our', 'proofs', 'require', 'suitable', 'multilayer', 'decompositions', 'of', 'sums', 'of', 'random', 'variables', 'controlled', 'by', 'moments', 'bounds', 'and', 'concentration', 'estimates', 'along', 'the', 'way', 'we', 'derive', 'two', 'results', 'of', 'independent', 'interest', 'namely', 'a', 'concentration', 'inequality', 'for', 'the', 'cumulants', 'of', 'the', 'displacement', 'in', 'the', 'static', 'random', 'environment', 'and', 'an', 'ergodic', 'theorem', 'that', 'deals', 'with', 'limits', 'of', 'sums', 'of', 'triangular', 'arrays', 'representing', 'the', 'structure', 'of', 'the', 'cooling', 'regime', 'we', 'close', 'by', 'discussing', 'our', 'present', 'understanding', 'of', 'homogenisation', 'effects', 'as', 'a', 'function', 'of', 'the', 'speed', 'of', 'divergence', 'of', 'the', 'increments', 'of', 'the', 'resampling', 'times']] | [-0.14051223998977974, 0.18245285846045456, -0.09504094804154384, 0.027794936653696548, 0.015062053059868583, -0.09325847208474276, 0.08658296069442166, 0.33791841439774084, -0.2696326357032677, -0.2493505147413923, 0.12351446223515726, -0.25119278723773986, -0.12045929874848882, 0.19190128647440344, -0.061071492071528365, 0.06226836328598705, 0.006499451146153477, 0.017073436142500797, -0.03591430585066694, -0.22679585059079418, 0.25989409771356986, 0.026885120556187823, 0.28657484677440803, -0.0033789743456258993, 0.11507438714701443, 0.049705958966840776, -0.03418946242570843, 0.06313420017997504, -0.10393312260533369, 0.0768407459302438, 0.17178086223883912, 0.05236759873948417, 0.303805917060353, -0.3987964101674018, -0.20325469398666002, 0.11199174040432917, 0.13922418485429788, 0.08032301285076104, -0.04060574250996386, -0.2844939505843736, 0.06964852283879636, -0.14647609264741507, -0.14789710017807628, -0.028625574165852655, 0.030880772611211745, 0.1331858072523882, -0.3234864017670363, 0.11560547144746049, 0.11356316652809005, 0.06126285957625358, -0.015467159439373863, -0.10393031534884091, 0.036521655871584124, 0.13627125472983842, 0.056102099549666114, 0.008087201188147547, 0.15285688507319387, -0.10708169137590155, -0.11839805725521894, 0.35806100914007, -0.10030745009682354, -0.18254307159778038, 0.14938334524102825, -0.16820621967888139, -0.1511479593138424, 0.09632237747080898, 0.19085737850961335, 0.13961797389369368, -0.15747467676469193, 0.09088371860994444, -0.06410393523855494, 0.13019077849898533, 0.05458402531349672, 0.02764362604741793, 0.16816255811883837, 0.14406722594787358, 0.08673498734037195, 0.18005599382754262, -0.06802786858709649, -0.13284175660580808, -0.30370519191043777, -0.14185482182394749, -0.25037789074789496, 0.09854599029795531, -0.17689741179399104, -0.21323622757336125, 0.35332966191104587, 0.14242027392568185, 0.23041485657877023, 0.13944223603722852, 0.24565533250399413, 0.15235761135288967, 0.021533137822305835, 0.05523651932823309, 0.1650992481544221, 0.18955732677922235, 0.10076559791843398, -0.14723624902192092, 0.09983875175271559, 0.06914544751688223] |
1,803.03296 | Efficient Phase Diagram Sampling by Active Learning | We address the problem of efficient phase diagram sampling by adopting active
learning techniques from machine learning, and achieve an 80% reduction in the
sample size (number of sampled statepoints) needed to establish the phase
boundary up to a given precision in example application. Traditionally, data is
collected on a uniform grid of predetermined statepoints. This approach, also
known as grid search in the machine learning community, suffers from low
efficiency by sampling statepoints that provide no information about the phase
boundaries. We propose an active learning approach to overcome this deficiency
by adaptively choosing the next most informative statepoint(s) every round.
This is done by interpolating the sampled statepoints' phases by Gaussian
Process regression. An acquisition function quantifies the informativeness of
possible next statepoints, maximizing the information content in each
subsequently sampled statepoint. We also generalize our approach with
state-of-the-art batch sampling techniques to better utilize parallel computing
resources. We demonstrate the usefulness of our approach in a few example
simulations relevant to soft matter physics, although our algorithms are
general. Our active learning enhanced phase diagram sampling method greatly
accelerates research and opens up opportunities for extra-large scale
exploration of a wide range of phase diagrams by simulations or experiments.
| physics.comp-ph cond-mat.soft | we address the problem of efficient phase diagram sampling by adopting active learning techniques from machine learning and achieve an 80 reduction in the sample size number of sampled statepoints needed to establish the phase boundary up to a given precision in example application traditionally data is collected on a uniform grid of predetermined statepoints this approach also known as grid search in the machine learning community suffers from low efficiency by sampling statepoints that provide no information about the phase boundaries we propose an active learning approach to overcome this deficiency by adaptively choosing the next most informative statepoints every round this is done by interpolating the sampled statepoints phases by gaussian process regression an acquisition function quantifies the informativeness of possible next statepoints maximizing the information content in each subsequently sampled statepoint we also generalize our approach with stateoftheart batch sampling techniques to better utilize parallel computing resources we demonstrate the usefulness of our approach in a few example simulations relevant to soft matter physics although our algorithms are general our active learning enhanced phase diagram sampling method greatly accelerates research and opens up opportunities for extralarge scale exploration of a wide range of phase diagrams by simulations or experiments | [['we', 'address', 'the', 'problem', 'of', 'efficient', 'phase', 'diagram', 'sampling', 'by', 'adopting', 'active', 'learning', 'techniques', 'from', 'machine', 'learning', 'and', 'achieve', 'an', '80', 'reduction', 'in', 'the', 'sample', 'size', 'number', 'of', 'sampled', 'statepoints', 'needed', 'to', 'establish', 'the', 'phase', 'boundary', 'up', 'to', 'a', 'given', 'precision', 'in', 'example', 'application', 'traditionally', 'data', 'is', 'collected', 'on', 'a', 'uniform', 'grid', 'of', 'predetermined', 'statepoints', 'this', 'approach', 'also', 'known', 'as', 'grid', 'search', 'in', 'the', 'machine', 'learning', 'community', 'suffers', 'from', 'low', 'efficiency', 'by', 'sampling', 'statepoints', 'that', 'provide', 'no', 'information', 'about', 'the', 'phase', 'boundaries', 'we', 'propose', 'an', 'active', 'learning', 'approach', 'to', 'overcome', 'this', 'deficiency', 'by', 'adaptively', 'choosing', 'the', 'next', 'most', 'informative', 'statepoints', 'every', 'round', 'this', 'is', 'done', 'by', 'interpolating', 'the', 'sampled', 'statepoints', 'phases', 'by', 'gaussian', 'process', 'regression', 'an', 'acquisition', 'function', 'quantifies', 'the', 'informativeness', 'of', 'possible', 'next', 'statepoints', 'maximizing', 'the', 'information', 'content', 'in', 'each', 'subsequently', 'sampled', 'statepoint', 'we', 'also', 'generalize', 'our', 'approach', 'with', 'stateoftheart', 'batch', 'sampling', 'techniques', 'to', 'better', 'utilize', 'parallel', 'computing', 'resources', 'we', 'demonstrate', 'the', 'usefulness', 'of', 'our', 'approach', 'in', 'a', 'few', 'example', 'simulations', 'relevant', 'to', 'soft', 'matter', 'physics', 'although', 'our', 'algorithms', 'are', 'general', 'our', 'active', 'learning', 'enhanced', 'phase', 'diagram', 'sampling', 'method', 'greatly', 'accelerates', 'research', 'and', 'opens', 'up', 'opportunities', 'for', 'extralarge', 'scale', 'exploration', 'of', 'a', 'wide', 'range', 'of', 'phase', 'diagrams', 'by', 'simulations', 'or', 'experiments']] | [-0.05448158438050068, 0.1148127418585291, -0.07792706988604352, 0.05399791857561837, -0.08849565177754785, -0.13685477499753274, 0.14302546376740505, 0.41596948671025585, -0.2933443401102207, -0.3732505255427193, 0.09772334541343983, -0.23280445793366963, -0.13921313934399296, 0.18706882101976968, -0.09871356305896793, 0.07613284197822674, 0.07849520395537561, -0.00026299847312396076, -0.08306486668476679, -0.2718433294131762, 0.2697640627030154, 0.07510440754312284, 0.3218576492151559, -0.019993558398097532, 0.09628695749743561, 0.019715742565377958, -0.07403001240408509, -0.010178082765513423, -0.14089623306628513, 0.14219950650078658, 0.30031178542643344, 0.18723904961111523, 0.3316939117128749, -0.36572903725009565, -0.2215818724074023, 0.1193005380267969, 0.16408640561546983, 0.10051396759319128, -0.09728975899893293, -0.2640440297453655, 0.06024533482545083, -0.1600010160421307, -0.08665043857446549, -0.12517193191924528, -0.05907240168578775, -0.00813047156500916, -0.28316538762024573, 0.02731585574750143, 0.03186273053351854, 0.05605479698319283, -0.01059490228463702, -0.11503711635982249, 0.04556996578530473, 0.13578863430129695, 0.004622007253214413, 0.07896236639693471, 0.14764128237389867, -0.1360321891238212, -0.15422237387715407, 0.34333251741190907, -0.0183335383869892, -0.16405046054180528, 0.1687830234278399, -0.07904159468213974, -0.130676045213909, 0.16442369413331592, 0.2023764927433527, 0.13083539020021143, -0.15658440519790487, 0.05280882087008829, 0.0030112584345711227, 0.16890636121042737, 0.03395471945381954, -0.013580095587992155, 0.173772792623489, 0.2496004367839674, 0.07938473070695037, 0.1676866913878239, -0.10561919453355603, -0.11084956072050718, -0.235863735556999, -0.10872999475438996, -0.22636665353588392, -0.026031665802797265, -0.1399313484093504, -0.11728282285955652, 0.3595345448057103, 0.22048576370787595, 0.19777415550615302, 0.05201981571217132, 0.34625545850180384, 0.04603113734456111, 0.06900734126586283, 0.09821905327573566, 0.19378833559636802, 0.06119994198474664, 0.11394187675772861, -0.17365371426544382, 0.06546170166163419, 0.03807342632000547] |
1,803.03297 | Observational constraints on tachyonic chameleon dark energy model | It has been recently shown that tachyonic chameleon model of dark energy in
which tachyon scalar field non-minimally coupled to the matter admits stable
scaling attractor solution that could give rise to the late-time accelerated
expansion of the universe and hence alleviate the coincidence problem. In the
present work, we use data from Type Ia supernova (SN Ia) and Baryon Acoustic
Oscillations to place constraints on the model parameters. In our analysis we
consider in general exponential and non-exponential forms for the non-minimal
coupling function and tachyonic potential and show that the scenario is
compatible with observations.
| gr-qc | it has been recently shown that tachyonic chameleon model of dark energy in which tachyon scalar field nonminimally coupled to the matter admits stable scaling attractor solution that could give rise to the latetime accelerated expansion of the universe and hence alleviate the coincidence problem in the present work we use data from type ia supernova sn ia and baryon acoustic oscillations to place constraints on the model parameters in our analysis we consider in general exponential and nonexponential forms for the nonminimal coupling function and tachyonic potential and show that the scenario is compatible with observations | [['it', 'has', 'been', 'recently', 'shown', 'that', 'tachyonic', 'chameleon', 'model', 'of', 'dark', 'energy', 'in', 'which', 'tachyon', 'scalar', 'field', 'nonminimally', 'coupled', 'to', 'the', 'matter', 'admits', 'stable', 'scaling', 'attractor', 'solution', 'that', 'could', 'give', 'rise', 'to', 'the', 'latetime', 'accelerated', 'expansion', 'of', 'the', 'universe', 'and', 'hence', 'alleviate', 'the', 'coincidence', 'problem', 'in', 'the', 'present', 'work', 'we', 'use', 'data', 'from', 'type', 'ia', 'supernova', 'sn', 'ia', 'and', 'baryon', 'acoustic', 'oscillations', 'to', 'place', 'constraints', 'on', 'the', 'model', 'parameters', 'in', 'our', 'analysis', 'we', 'consider', 'in', 'general', 'exponential', 'and', 'nonexponential', 'forms', 'for', 'the', 'nonminimal', 'coupling', 'function', 'and', 'tachyonic', 'potential', 'and', 'show', 'that', 'the', 'scenario', 'is', 'compatible', 'with', 'observations']] | [-0.1212133059227724, 0.1084719581491093, -0.10697837996707038, 0.12614604382002823, -0.1607827020367396, -0.1883363711081215, -0.007210684712188914, 0.301806375720375, -0.21029156142576916, -0.2843765784727083, 0.027461596673412116, -0.25361412767436087, -0.12547867941026836, 0.16525302300728933, 0.005112158825870641, -0.011411895485806097, 0.060347621135903314, 0.03401428149993887, -0.01602550405653712, -0.2792173287970465, 0.3520192033275194, 0.0742969275212165, 0.266365881250768, 0.01812012205842508, 0.11728730682552475, -0.10445362194345247, 0.00022477044042238254, -0.02460738380329165, -0.18466606326216709, 0.020967054662064256, 0.1679692179747418, 0.1682372086023739, 0.19325640404203273, -0.4456815235892829, -0.3001560408996476, 0.21447522887364798, 0.2113965019324468, 0.1396247579982581, -0.10431281061118142, -0.26307868448652555, 0.04109015679899027, -0.18666189902620486, -0.1421047598507601, -0.05087310798254978, -0.008117217938991781, -0.02569317008301462, -0.28739524991779597, 0.15888279539139308, -0.01523635795666385, -0.06970638489427487, -0.1346499686340619, -0.020660595905957455, 0.01318919931576808, -0.04846532775338778, 0.14165521112448276, 0.03547170604627157, 0.050800302339544925, -0.15167879694880745, -0.04107396167429337, 0.38117730859475035, -0.1536145722301504, -0.10942007619023476, 0.1560761331167725, -0.11863239660148614, -0.14517217264366672, 0.0869612944307593, 0.15396412220044234, 0.049244974864665995, -0.15868413875589973, 0.17331753769762256, 0.015561256740127028, 0.12609396332433237, 0.07811344770196173, 0.03914250533935703, 0.2658736125335635, 0.14772143144611768, 0.0347201136185682, 0.09444220490830461, -0.04809271209674033, -0.08883141566394377, -0.3382706332222088, -0.11260548147574528, -0.12613767778894566, 0.06657575374377948, -0.13858328549807636, -0.16414837657861633, 0.397670386431105, 0.11836603386615663, 0.19134779622989526, 0.02697539919646476, 0.26511969334762736, 0.0938266914532299, 0.0656396850857154, 0.0703385135307566, 0.3409623336815035, 0.14773506681571627, 0.143446484215788, -0.2836102847917217, -0.021817191503942013, 0.030663250028587802] |
1,803.03298 | Analysis and Rate Optimization of GFDM-based Cognitive Radios | Generalized frequency division multiplexing (GFDM) is suitable for cognitive
radio (CR) networks due to its low out-of-band (OOB) emission and high spectral
efficiency. In this paper, we thus consider the use of GFDM to allow an
unlicensed secondary user (SU) to access a spectrum hole. However, in an
extremely congested spectrum scenario, both active incumbent primary users
(PUs) on the left and right channels of the spectrum hole will experience OOB
interference. While constraining this interference, we thus investigate the
problem of power allocation to the SU transmit subcarriers in order to maximize
the overall data rate where the SU receiver is employing Matched filter (MF)
and zero-forcing (ZF) structures. The power allocation problem is thus solved
as a classic convex optimization problem. Finally, total transmission rate of
GFDM is compared with that of orthogonal frequency division multiplexing
(OFDM). For instance, when right and left interference temperature should be
below 10 dBm, the capacity gain of GFDM over OFDM is 400 %.
| eess.SP | generalized frequency division multiplexing gfdm is suitable for cognitive radio cr networks due to its low outofband oob emission and high spectral efficiency in this paper we thus consider the use of gfdm to allow an unlicensed secondary user su to access a spectrum hole however in an extremely congested spectrum scenario both active incumbent primary users pus on the left and right channels of the spectrum hole will experience oob interference while constraining this interference we thus investigate the problem of power allocation to the su transmit subcarriers in order to maximize the overall data rate where the su receiver is employing matched filter mf and zeroforcing zf structures the power allocation problem is thus solved as a classic convex optimization problem finally total transmission rate of gfdm is compared with that of orthogonal frequency division multiplexing ofdm for instance when right and left interference temperature should be below 10 dbm the capacity gain of gfdm over ofdm is 400 | [['generalized', 'frequency', 'division', 'multiplexing', 'gfdm', 'is', 'suitable', 'for', 'cognitive', 'radio', 'cr', 'networks', 'due', 'to', 'its', 'low', 'outofband', 'oob', 'emission', 'and', 'high', 'spectral', 'efficiency', 'in', 'this', 'paper', 'we', 'thus', 'consider', 'the', 'use', 'of', 'gfdm', 'to', 'allow', 'an', 'unlicensed', 'secondary', 'user', 'su', 'to', 'access', 'a', 'spectrum', 'hole', 'however', 'in', 'an', 'extremely', 'congested', 'spectrum', 'scenario', 'both', 'active', 'incumbent', 'primary', 'users', 'pus', 'on', 'the', 'left', 'and', 'right', 'channels', 'of', 'the', 'spectrum', 'hole', 'will', 'experience', 'oob', 'interference', 'while', 'constraining', 'this', 'interference', 'we', 'thus', 'investigate', 'the', 'problem', 'of', 'power', 'allocation', 'to', 'the', 'su', 'transmit', 'subcarriers', 'in', 'order', 'to', 'maximize', 'the', 'overall', 'data', 'rate', 'where', 'the', 'su', 'receiver', 'is', 'employing', 'matched', 'filter', 'mf', 'and', 'zeroforcing', 'zf', 'structures', 'the', 'power', 'allocation', 'problem', 'is', 'thus', 'solved', 'as', 'a', 'classic', 'convex', 'optimization', 'problem', 'finally', 'total', 'transmission', 'rate', 'of', 'gfdm', 'is', 'compared', 'with', 'that', 'of', 'orthogonal', 'frequency', 'division', 'multiplexing', 'ofdm', 'for', 'instance', 'when', 'right', 'and', 'left', 'interference', 'temperature', 'should', 'be', 'below', '10', 'dbm', 'the', 'capacity', 'gain', 'of', 'gfdm', 'over', 'ofdm', 'is', '400']] | [-0.24502803692565248, 0.025253257325377535, -0.012966612521674692, 0.028969714882991836, -0.12233060752099484, -0.27348756511740513, 0.12571510578641634, 0.421268688017352, -0.2997544042604125, -0.24140926934084536, 0.09789449405807261, -0.2528887675837932, -0.14255927069407673, 0.1166005669167462, -0.13558868343814606, 0.008167334831889533, -0.009280955155744501, 0.046762059976329436, -0.015879105876332948, -0.22683392980957393, 0.24904220447707806, 0.21842560699131477, 0.37428160242140524, -0.0033410757545798276, 0.04266974841091226, 0.03252155546052671, -0.03695418266290278, -0.12320578298444704, -0.058315809430948225, 0.024080127073446093, 0.3732714625480382, 0.20085143715559695, 0.2619947596967961, -0.35205546771147234, -0.2709455552933194, 0.10137889234302855, 0.22815308969262524, -0.029575182866848865, -0.02833055212561573, -0.20266372650306416, 0.17235619385773027, -0.2610306729958827, -0.017203808391917937, 0.08021080187342552, -0.08762189194918697, 0.024893841696454803, -0.37787328460919006, 0.056102474969204355, 0.02383059678781454, 0.010266306069650635, -0.07989206167461455, -0.1056431684055892, 0.02980224312115345, 0.13883838359420536, 0.027919950369334784, -0.04794367253404365, 0.08074610273105017, -0.07331884959249856, -0.10430440374044078, 0.39321022345366313, 0.0045565601560483854, -0.1936861621476247, 0.1350978913728541, -0.15323468060840084, -0.02551412670612798, 0.19803997335423315, 0.2244895620861594, 0.03954969621581598, -0.1717074466974985, 0.04595145664155419, 0.0391584160384832, 0.20815627990429353, 0.16295180652798183, 0.16182996734097507, 0.19234532298251222, 0.13974926148408226, 0.1665265500886794, 0.10430159407265785, -0.1342864628889893, -0.04659409725659683, -0.13560121578181752, -0.09070755611318423, -0.2073204779638822, 0.04764523114795762, -0.08113877813046891, -0.04103086125221311, 0.40127192849368554, 0.0846247746672782, 0.09009722216482859, 0.11518832750369719, 0.4431935007574025, 0.1755959171655744, 0.031426891722132144, 0.10338138124937342, 0.18314064840745667, 0.147854079627967, 0.15854667165961625, -0.28497669945604037, -0.04192121693089327, -0.06118409423828588] |
1,803.03299 | Proper Motion of the Faint Star near KIC 8462852 (Boyajian's Star) - Not
a Binary System | A faint star located 2 arcsec from KIC 8462852 was discovered in Keck 10 m
adaptive optics imaging in the $JHK$ near-infrared (NIR) in 2014 by Boyajian et
al. (2016). The closeness of the star to KIC 8462852 suggested the two could
constitute a binary, which might have implications for the cause of the
brightness dips seen by {\it Kepler} (Boyajian et al. (2016) and in
ground-based optical studies Boyajian et al. (2018). Here, NIR imaging in 2017
using the Mimir instrument resolved the pair and enabled measuring their
separation. The faint star had moved $67 \pm 7$ milliarcsec (mas) relative to
KIC 8462852 since 2014. The relative proper motion of the faint star is $23.9
\pm 2.6$ mas yr$^{-1}$, for a tangential velocity of $45 \pm 5$ km s$^{-1}$ if
it is at the same 390 pc distance as KIC 8462852. Circular velocity at the 750
AU current projected separation is $1.5$ km s$^{-1}$, hence the star pair
cannot be bound.
| astro-ph.SR | a faint star located 2 arcsec from kic 8462852 was discovered in keck 10 m adaptive optics imaging in the jhk nearinfrared nir in 2014 by boyajian et al 2016 the closeness of the star to kic 8462852 suggested the two could constitute a binary which might have implications for the cause of the brightness dips seen by it kepler boyajian et al 2016 and in groundbased optical studies boyajian et al 2018 here nir imaging in 2017 using the mimir instrument resolved the pair and enabled measuring their separation the faint star had moved 67 pm 7 milliarcsec mas relative to kic 8462852 since 2014 the relative proper motion of the faint star is 239 pm 26 mas yr1 for a tangential velocity of 45 pm 5 km s1 if it is at the same 390 pc distance as kic 8462852 circular velocity at the 750 au current projected separation is 15 km s1 hence the star pair cannot be bound | [['a', 'faint', 'star', 'located', '2', 'arcsec', 'from', 'kic', '8462852', 'was', 'discovered', 'in', 'keck', '10', 'm', 'adaptive', 'optics', 'imaging', 'in', 'the', 'jhk', 'nearinfrared', 'nir', 'in', '2014', 'by', 'boyajian', 'et', 'al', '2016', 'the', 'closeness', 'of', 'the', 'star', 'to', 'kic', '8462852', 'suggested', 'the', 'two', 'could', 'constitute', 'a', 'binary', 'which', 'might', 'have', 'implications', 'for', 'the', 'cause', 'of', 'the', 'brightness', 'dips', 'seen', 'by', 'it', 'kepler', 'boyajian', 'et', 'al', '2016', 'and', 'in', 'groundbased', 'optical', 'studies', 'boyajian', 'et', 'al', '2018', 'here', 'nir', 'imaging', 'in', '2017', 'using', 'the', 'mimir', 'instrument', 'resolved', 'the', 'pair', 'and', 'enabled', 'measuring', 'their', 'separation', 'the', 'faint', 'star', 'had', 'moved', '67', 'pm', '7', 'milliarcsec', 'mas', 'relative', 'to', 'kic', '8462852', 'since', '2014', 'the', 'relative', 'proper', 'motion', 'of', 'the', 'faint', 'star', 'is', '239', 'pm', '26', 'mas', 'yr1', 'for', 'a', 'tangential', 'velocity', 'of', '45', 'pm', '5', 'km', 's1', 'if', 'it', 'is', 'at', 'the', 'same', '390', 'pc', 'distance', 'as', 'kic', '8462852', 'circular', 'velocity', 'at', 'the', '750', 'au', 'current', 'projected', 'separation', 'is', '15', 'km', 's1', 'hence', 'the', 'star', 'pair', 'can', 'not', 'be', 'bound']] | [-0.07417384343953129, 0.13650919634140343, -0.09506231764091487, -0.007433374567340168, -0.12372067134307435, -0.10236437985833528, 0.027340184982888902, 0.40723630924212056, -0.15730564924745472, -0.4332533292786612, 0.07335285490387308, -0.3240370463145657, -0.05207980990672678, 0.218027034849057, -0.1692649586714713, -0.003249782400399995, 0.13593949291867952, -0.08144496973215437, -0.030481440935032498, -0.2968466117880964, 0.15166523751225666, 0.09641207018410045, 0.1179581814776946, -0.022432233172645963, 0.08266205629983779, -0.06078276855648249, -0.0682441617899283, -0.07629060273864335, -0.1876038789086364, -0.0029571449321243296, 0.22975303407649916, 0.12005681562254582, 0.2208548396642954, -0.21770198229540344, -0.16043935531030404, 0.020656656285325075, 0.1514832690026771, -0.035135564410721916, 0.01901800175157427, -0.3607616840698899, 0.07256510007577988, -0.19803698951995538, -0.17954229427775814, 0.12971931232562278, 0.17809467235911478, -0.0033629512002954455, -0.20726743738446957, 0.1549688950438121, 0.030977144632134957, 0.17717633319824386, -0.11469795714429597, -0.14252000801162396, -0.08372811015203961, 0.015093625400306806, -0.10737582557674703, 0.20544098313480752, 0.07850828491996951, -0.02865351851389635, -0.05111723902358165, 0.3491566088607683, -0.08544069135195913, 0.07788701753126331, 0.1974700224225872, -0.17105895996827952, -0.15162982176875045, 0.1568639302580543, 0.1277103385590931, 0.12879494077131792, -0.17894985947895087, -0.03756005983825407, -0.004813119860514541, 0.25006426086626443, 0.17233635043508252, 0.05039936879741177, 0.35034551831430816, 0.0940216870784211, 0.0178522214856273, -0.003041155345629375, -0.39715809899987936, 0.012290581608365398, -0.20700729529064812, -0.06635492593742781, -0.13685726412097735, 0.07950563301295513, -0.09512732949295721, -0.015063658756621044, 0.29673094001878625, 0.09406757473579945, 0.22306288993614584, -0.0301632470746976, 0.25386890908131843, 0.06614348956775148, 0.08736875705975193, 0.1546476584676356, 0.4216450085074989, 0.19643523099266588, 0.1532809703776533, -0.20946976326997363, 0.03543818779889654, 0.00354408505844078] |
1,803.033 | Exploration of Graph Computing in Power System State Estimation | With the increased complexity of power systems due to the integration of
smart grid technologies and renewable energy resources, more frequent changes
have been introduced to system status, and the traditional serial mode of state
estimation algorithm cannot well meet the restrict time-constrained requirement
for the future dynamic power grid, even with advanced computer hardware. To
guarantee the grid reliability and minimize the impacts caused by system status
fluctuations, a fast, even SCADA-rate, state estimator is urgently needed. In
this paper, a graph based power system modeling is firstly explored and a graph
computing based state estimation is proposed to speed up its performance. The
power system is represented by a graph, which is a collection of vertices and
edges, and the measurements are attributes of vertices and edges. Each vertex
can independently implement local computation, like formulations of the
node-based H matrix, gain matrix and righthand-side (RHS) vector, only with the
information on its connected edges and neighboring vertices. Then, by taking
advantages of graph database, these node-based data are conveniently collected
and stored in the compressed sparse row (CSR) format avoiding the complexity
and heaviness introduced by the sparse matrices. With communications and
synchronization, centralized computation of solving the weighted least square
(WLS) state estimation is completed with hierarchical parallel computing. The
proposed strategy is implemented on a graph database platform. The testing
results of IEEE 14-bus, IEEE 118-bus systems and a provincial system in China
verify the accuracy and high-performance of the proposed methodology.
| cs.SY cs.DM cs.DS cs.NA math.NA | with the increased complexity of power systems due to the integration of smart grid technologies and renewable energy resources more frequent changes have been introduced to system status and the traditional serial mode of state estimation algorithm cannot well meet the restrict timeconstrained requirement for the future dynamic power grid even with advanced computer hardware to guarantee the grid reliability and minimize the impacts caused by system status fluctuations a fast even scadarate state estimator is urgently needed in this paper a graph based power system modeling is firstly explored and a graph computing based state estimation is proposed to speed up its performance the power system is represented by a graph which is a collection of vertices and edges and the measurements are attributes of vertices and edges each vertex can independently implement local computation like formulations of the nodebased h matrix gain matrix and righthandside rhs vector only with the information on its connected edges and neighboring vertices then by taking advantages of graph database these nodebased data are conveniently collected and stored in the compressed sparse row csr format avoiding the complexity and heaviness introduced by the sparse matrices with communications and synchronization centralized computation of solving the weighted least square wls state estimation is completed with hierarchical parallel computing the proposed strategy is implemented on a graph database platform the testing results of ieee 14bus ieee 118bus systems and a provincial system in china verify the accuracy and highperformance of the proposed methodology | [['with', 'the', 'increased', 'complexity', 'of', 'power', 'systems', 'due', 'to', 'the', 'integration', 'of', 'smart', 'grid', 'technologies', 'and', 'renewable', 'energy', 'resources', 'more', 'frequent', 'changes', 'have', 'been', 'introduced', 'to', 'system', 'status', 'and', 'the', 'traditional', 'serial', 'mode', 'of', 'state', 'estimation', 'algorithm', 'can', 'not', 'well', 'meet', 'the', 'restrict', 'timeconstrained', 'requirement', 'for', 'the', 'future', 'dynamic', 'power', 'grid', 'even', 'with', 'advanced', 'computer', 'hardware', 'to', 'guarantee', 'the', 'grid', 'reliability', 'and', 'minimize', 'the', 'impacts', 'caused', 'by', 'system', 'status', 'fluctuations', 'a', 'fast', 'even', 'scadarate', 'state', 'estimator', 'is', 'urgently', 'needed', 'in', 'this', 'paper', 'a', 'graph', 'based', 'power', 'system', 'modeling', 'is', 'firstly', 'explored', 'and', 'a', 'graph', 'computing', 'based', 'state', 'estimation', 'is', 'proposed', 'to', 'speed', 'up', 'its', 'performance', 'the', 'power', 'system', 'is', 'represented', 'by', 'a', 'graph', 'which', 'is', 'a', 'collection', 'of', 'vertices', 'and', 'edges', 'and', 'the', 'measurements', 'are', 'attributes', 'of', 'vertices', 'and', 'edges', 'each', 'vertex', 'can', 'independently', 'implement', 'local', 'computation', 'like', 'formulations', 'of', 'the', 'nodebased', 'h', 'matrix', 'gain', 'matrix', 'and', 'righthandside', 'rhs', 'vector', 'only', 'with', 'the', 'information', 'on', 'its', 'connected', 'edges', 'and', 'neighboring', 'vertices', 'then', 'by', 'taking', 'advantages', 'of', 'graph', 'database', 'these', 'nodebased', 'data', 'are', 'conveniently', 'collected', 'and', 'stored', 'in', 'the', 'compressed', 'sparse', 'row', 'csr', 'format', 'avoiding', 'the', 'complexity', 'and', 'heaviness', 'introduced', 'by', 'the', 'sparse', 'matrices', 'with', 'communications', 'and', 'synchronization', 'centralized', 'computation', 'of', 'solving', 'the', 'weighted', 'least', 'square', 'wls', 'state', 'estimation', 'is', 'completed', 'with', 'hierarchical', 'parallel', 'computing', 'the', 'proposed', 'strategy', 'is', 'implemented', 'on', 'a', 'graph', 'database', 'platform', 'the', 'testing', 'results', 'of', 'ieee', '14bus', 'ieee', '118bus', 'systems', 'and', 'a', 'provincial', 'system', 'in', 'china', 'verify', 'the', 'accuracy', 'and', 'highperformance', 'of', 'the', 'proposed', 'methodology']] | [-0.15646824046643262, 0.04598030946613384, -0.024546628085489155, -0.012427087605983652, -0.08482187418154015, -0.1746554633146265, 0.06586344546104898, 0.36818638019195876, -0.2743614717247153, -0.3547771909558836, 0.16073444379193835, -0.2874668277903773, -0.13631990603981956, 0.14200252116547504, -0.10605683414475721, 0.1211197429920098, 0.125329267769969, 0.03418882082872515, -0.014240936760866999, -0.2845606005300253, 0.24264949728142818, 0.0959393916338652, 0.3252978307187467, 0.01838869099346883, 0.0979495112739903, 0.030756439850571367, -0.060302796939987434, 0.04217832178506163, -0.04575301481018254, 0.1395242759967159, 0.2645947613813707, 0.19710728922021775, 0.29920754120741716, -0.4603844321510087, -0.1786631689513449, 0.12912571352910296, 0.1063728242120913, 0.034163612553280466, -0.015522239836574313, -0.28332921435023367, 0.11611004449829633, -0.20972782926566083, -0.05848158202567685, -0.057673486993131545, -0.009147660097914186, 0.04096836346175205, -0.3041573026036534, 0.00016423697047961145, 0.011136951800228402, 0.04383522460401164, 0.021625825440556353, -0.1335452715710733, -0.02484461702175461, 0.11960202711068757, -0.03907019803432469, 0.00846631551747727, 0.1375615274305512, -0.11293054283935923, -0.1609550228710984, 0.3775602964748466, 0.01284644506336284, -0.18802876960060103, 0.13946890089234812, -0.06313945767837331, -0.1051238479492394, 0.10342960144691961, 0.21475714615165342, 0.04488305872219505, -0.16007313821210264, 0.08111102706026889, 0.019018136168759282, 0.18647860268108274, 0.039293789134176096, 0.04128088383192596, 0.14910582565138802, 0.21322155018386088, 0.09954511464445245, 0.12325865797687185, -0.06734386146792516, -0.09170531404208437, -0.2162004210889577, -0.12636288726016096, -0.25168834311304605, -0.04126128454890379, -0.123367564127378, -0.14143111394635338, 0.42395084152216855, 0.1474932111302006, 0.13375843888118502, 0.060573530878762334, 0.3726938395979645, 0.10334250055675806, 0.07234393907635499, 0.16425174060145672, 0.15436299151725885, 0.11204945296049118, 0.12809347193160278, -0.19864167285581621, 0.08278432159367874, 0.06161248972693643] |
1,803.03301 | Black hole-naked singularity dualism and the repulsion of two Kerr black
holes due to spin-spin interaction | We report about the possibility for interacting Kerr sources to exist in two
different states - black holes or naked singularities - both states
characterized by the same masses and angular momenta. Another surprising
discovery reported by us is that in spite of the absence of balance between two
Kerr black holes, the latter nevertheless can repel each other, which provides
a good opportunity for experimental detection of the spin-spin repulsive force
through the observation of astrophysical black-hole binaries.
| gr-qc astro-ph.HE hep-th | we report about the possibility for interacting kerr sources to exist in two different states black holes or naked singularities both states characterized by the same masses and angular momenta another surprising discovery reported by us is that in spite of the absence of balance between two kerr black holes the latter nevertheless can repel each other which provides a good opportunity for experimental detection of the spinspin repulsive force through the observation of astrophysical blackhole binaries | [['we', 'report', 'about', 'the', 'possibility', 'for', 'interacting', 'kerr', 'sources', 'to', 'exist', 'in', 'two', 'different', 'states', 'black', 'holes', 'or', 'naked', 'singularities', 'both', 'states', 'characterized', 'by', 'the', 'same', 'masses', 'and', 'angular', 'momenta', 'another', 'surprising', 'discovery', 'reported', 'by', 'us', 'is', 'that', 'in', 'spite', 'of', 'the', 'absence', 'of', 'balance', 'between', 'two', 'kerr', 'black', 'holes', 'the', 'latter', 'nevertheless', 'can', 'repel', 'each', 'other', 'which', 'provides', 'a', 'good', 'opportunity', 'for', 'experimental', 'detection', 'of', 'the', 'spinspin', 'repulsive', 'force', 'through', 'the', 'observation', 'of', 'astrophysical', 'blackhole', 'binaries']] | [-0.20436967363847153, 0.1441382777260302, -0.06017903575383417, 0.11767716139294933, -0.09563403796743263, -0.17786387842172732, 0.056174424377136996, 0.3352102603424679, -0.14615361316903652, -0.33758757186013383, 0.01703534115940429, -0.3621153159236366, -0.06315886472085756, 0.22629970217474385, 0.018203495789996603, 0.026536029340191322, 0.04132148653704237, 0.003947996365075762, -0.06340468349540002, -0.19341226835287623, 0.38216272540626345, 0.06165716772318467, 0.2126592525897862, 0.050856654725775316, 0.09151679611849514, 0.01649995638638154, 0.024251839091590087, 0.01136953541071626, -0.10808300818121983, 0.06064686981217283, 0.23157717320197202, 0.05686698093641453, 0.21827239625748585, -0.4008724626105327, -0.20256449345063854, 0.09304633129436474, 0.1796121996246859, 0.15700896211760723, -0.1406962047331035, -0.3026247362594132, 0.014291795962429667, -0.1924634865400466, -0.1663599073003929, -0.07943859117033032, 0.06026908771026057, 6.784549490971999e-05, -0.18925351800106757, 0.13914176119588217, 0.0971459440112888, -0.0555422499219512, -0.11731344479583687, -0.048758447424254635, -0.04231164614101509, 0.13183470050707558, 0.12367608439020038, -0.01927203250831211, 0.1214666035171453, -0.12863235203428314, -0.1653215800859518, 0.34800380809450304, -0.03414506119276796, -0.15015307182518692, 0.2644599736607694, -0.2647273608017713, -0.08921755667376731, 0.13234991267891963, 0.11540990911859583, 0.16431650189174848, -0.15448377715641415, 0.018130902950077427, 0.010431816018271175, 0.1747203068233204, 0.14199649430085698, 0.1134615028700368, 0.4090199202371689, 0.09441721066832542, 0.007462952769808955, 0.1403964430391607, -0.09194594374313564, -0.0980693407223693, -0.2713261921103899, -0.12149432264404468, -0.17959682394254517, 0.1035832419096456, -0.1211504727575925, -0.11977797404896202, 0.35133786356778113, 0.1218594851050913, 0.21500366824896788, -0.04617345635628013, 0.25293913130338874, 0.009502696946819688, 0.03865732373548793, 0.052337301671263076, 0.4106440662176578, 0.07700619948785994, 0.09064133084899226, -0.24607858583013612, 0.03131253860721534, 0.01213259460380325] |
1,803.03302 | Super Compaction and Pluripotent Shape Transformation via Algorithmic
Stacking for 3D Deployable Structures | Origami structures enabled by folding and unfolding can create complex 3D
shapes. However, even a small 3D shape can have large 2D unfoldings. The huge
initial dimension of the 2D flattened structure makes fabrication difficult,
and defeats the main purpose, namely compactness, of many origami-inspired
engineering. In this work, we propose a novel algorithmic kirigami method that
provides super compaction of an arbitrary 3D shape with non-negligible surface
thickness called "algorithmic stacking". Our approach computationally finds a
way of cutting the thick surface of the shape into a strip. This strip forms a
Hamiltonian cycle that covers the entire surface and can realize transformation
between two target shapes: from a super compact stacked shape to the input 3D
shape. Depending on the surface thickness, the stacked structure takes merely
0.001% to 6% of the original volume. This super compacted structure not only
can be manufactured in a workspace that is significantly smaller than the
provided 3D shape, but also makes packing and transportation easier for a
deployable application. We further demonstrate that, the proposed stackable
structure also provides high pluripotency and can transform into multiple 3D
target shapes if these 3D shapes can be dissected in specific ways and form a
common stacked structure. In contrast to many designs of origami structure that
usually target at a particular shape, our results provide a universal platform
for pluripotent 3D transformable structures.
| cs.CG | origami structures enabled by folding and unfolding can create complex 3d shapes however even a small 3d shape can have large 2d unfoldings the huge initial dimension of the 2d flattened structure makes fabrication difficult and defeats the main purpose namely compactness of many origamiinspired engineering in this work we propose a novel algorithmic kirigami method that provides super compaction of an arbitrary 3d shape with nonnegligible surface thickness called algorithmic stacking our approach computationally finds a way of cutting the thick surface of the shape into a strip this strip forms a hamiltonian cycle that covers the entire surface and can realize transformation between two target shapes from a super compact stacked shape to the input 3d shape depending on the surface thickness the stacked structure takes merely 0001 to 6 of the original volume this super compacted structure not only can be manufactured in a workspace that is significantly smaller than the provided 3d shape but also makes packing and transportation easier for a deployable application we further demonstrate that the proposed stackable structure also provides high pluripotency and can transform into multiple 3d target shapes if these 3d shapes can be dissected in specific ways and form a common stacked structure in contrast to many designs of origami structure that usually target at a particular shape our results provide a universal platform for pluripotent 3d transformable structures | [['origami', 'structures', 'enabled', 'by', 'folding', 'and', 'unfolding', 'can', 'create', 'complex', '3d', 'shapes', 'however', 'even', 'a', 'small', '3d', 'shape', 'can', 'have', 'large', '2d', 'unfoldings', 'the', 'huge', 'initial', 'dimension', 'of', 'the', '2d', 'flattened', 'structure', 'makes', 'fabrication', 'difficult', 'and', 'defeats', 'the', 'main', 'purpose', 'namely', 'compactness', 'of', 'many', 'origamiinspired', 'engineering', 'in', 'this', 'work', 'we', 'propose', 'a', 'novel', 'algorithmic', 'kirigami', 'method', 'that', 'provides', 'super', 'compaction', 'of', 'an', 'arbitrary', '3d', 'shape', 'with', 'nonnegligible', 'surface', 'thickness', 'called', 'algorithmic', 'stacking', 'our', 'approach', 'computationally', 'finds', 'a', 'way', 'of', 'cutting', 'the', 'thick', 'surface', 'of', 'the', 'shape', 'into', 'a', 'strip', 'this', 'strip', 'forms', 'a', 'hamiltonian', 'cycle', 'that', 'covers', 'the', 'entire', 'surface', 'and', 'can', 'realize', 'transformation', 'between', 'two', 'target', 'shapes', 'from', 'a', 'super', 'compact', 'stacked', 'shape', 'to', 'the', 'input', '3d', 'shape', 'depending', 'on', 'the', 'surface', 'thickness', 'the', 'stacked', 'structure', 'takes', 'merely', '0001', 'to', '6', 'of', 'the', 'original', 'volume', 'this', 'super', 'compacted', 'structure', 'not', 'only', 'can', 'be', 'manufactured', 'in', 'a', 'workspace', 'that', 'is', 'significantly', 'smaller', 'than', 'the', 'provided', '3d', 'shape', 'but', 'also', 'makes', 'packing', 'and', 'transportation', 'easier', 'for', 'a', 'deployable', 'application', 'we', 'further', 'demonstrate', 'that', 'the', 'proposed', 'stackable', 'structure', 'also', 'provides', 'high', 'pluripotency', 'and', 'can', 'transform', 'into', 'multiple', '3d', 'target', 'shapes', 'if', 'these', '3d', 'shapes', 'can', 'be', 'dissected', 'in', 'specific', 'ways', 'and', 'form', 'a', 'common', 'stacked', 'structure', 'in', 'contrast', 'to', 'many', 'designs', 'of', 'origami', 'structure', 'that', 'usually', 'target', 'at', 'a', 'particular', 'shape', 'our', 'results', 'provide', 'a', 'universal', 'platform', 'for', 'pluripotent', '3d', 'transformable', 'structures']] | [-0.07512663500079804, 0.08100238762771883, -0.09247031238679167, 0.04249923036980402, -0.10464381200423384, -0.12841433107488506, -0.02499514575035352, 0.4336072387902633, -0.2898593718226513, -0.3255022267527554, 0.07206781790389315, -0.2018113514125023, -0.21302419834031278, 0.20345960307015998, -0.0842509861914036, 0.053938900669226825, 0.057935837371295075, -0.040700113868376284, -0.10394620040188665, -0.18873210831383325, 0.29003390586003663, 0.020656004589577406, 0.3155852441068577, 0.015869636141249668, 0.0708241864502349, 0.01161239989830748, 0.033375016852970354, 0.07144634837851577, -0.12955376752225162, 0.19311216992285588, 0.2185108037275748, 0.09595388621800457, 0.20948766402130867, -0.4629411995653873, -0.19923087452113142, 0.04854738244017505, 0.180611045133201, 0.12339382716808873, -0.07804603960172718, -0.23504195799038785, 0.10138996788705497, -0.12709180890663485, -0.12984247035751847, -0.0895579063686613, 0.01908923158341128, -0.014076298487919343, -0.21185298766586524, 0.00032073589041512764, 0.0857812621448513, 0.0054077179211637245, -0.06739312000977604, -0.08769913211505374, -0.08072173361180593, 0.14528913041931052, -0.06765888072347835, 0.0317505911225453, 0.16209761690064942, -0.13841989177846067, -0.0616417989347373, 0.39285027881800805, 0.021493723947724388, -0.2405499366213284, 0.21280056021540708, -0.13200563634644547, -0.12497465186651148, 0.18719474721457, 0.1851999852107838, 0.10231418833946404, -0.10965804791472772, 0.05886837094667894, -0.04157367774649807, 0.21952325748077228, 0.10074326161538129, -0.038249279876523046, 0.23678304516285173, 0.22308622765855904, 0.07691296032660276, 0.18326372563833898, -0.13487261107657106, -0.03447577971155229, -0.24163050038724854, -0.16911812207418617, -0.16493522571096117, 0.052223002958255715, -0.10944320611395043, -0.22727419782591904, 0.40235116420182115, 0.0906988778810204, 0.24173901504229592, 0.021626805903329313, 0.30290011104054587, 0.008933324737312353, 0.12713221674506633, 0.03847934384425373, 0.18278111250585188, 0.05701128165035144, 0.04436182516788983, -0.14389075079386163, 0.06020340967275526, 0.05011591432089715] |
1,803.03303 | Kepler-78 and the Ultra-Short-Period Planets | Compared to the Earth, the exoplanet Kepler-78b has a similar size (1.2
$R_\oplus$) and an orbital period a thousand times shorter (8.5 hours). It is
currently the smallest planet for which the mass, radius, and dayside
brightness have all been measured. Kepler-78b is an exemplar of the
ultra-short-period (USP) planets, a category defined by the simple criterion
$P_{\rm orb} < 1$ day. We describe our Fourier-based search of the Kepler data
that led to the discovery of Kepler-78b, and review what has since been learned
about the population of USP planets. They are about as common as hot Jupiters,
and they are almost always smaller than 2 $R_\oplus$. They are often members of
compact multi-planet systems, although they tend to have relatively large
period ratios and mutual inclinations. They might be the exposed rocky cores of
"gas dwarfs," the planets between 2-4 $R_\oplus$ in size that are commonly
found in somewhat wider orbits.
| astro-ph.EP | compared to the earth the exoplanet kepler78b has a similar size 12 r_oplus and an orbital period a thousand times shorter 85 hours it is currently the smallest planet for which the mass radius and dayside brightness have all been measured kepler78b is an exemplar of the ultrashortperiod usp planets a category defined by the simple criterion p_rm orb 1 day we describe our fourierbased search of the kepler data that led to the discovery of kepler78b and review what has since been learned about the population of usp planets they are about as common as hot jupiters and they are almost always smaller than 2 r_oplus they are often members of compact multiplanet systems although they tend to have relatively large period ratios and mutual inclinations they might be the exposed rocky cores of gas dwarfs the planets between 24 r_oplus in size that are commonly found in somewhat wider orbits | [['compared', 'to', 'the', 'earth', 'the', 'exoplanet', 'kepler78b', 'has', 'a', 'similar', 'size', '12', 'r_oplus', 'and', 'an', 'orbital', 'period', 'a', 'thousand', 'times', 'shorter', '85', 'hours', 'it', 'is', 'currently', 'the', 'smallest', 'planet', 'for', 'which', 'the', 'mass', 'radius', 'and', 'dayside', 'brightness', 'have', 'all', 'been', 'measured', 'kepler78b', 'is', 'an', 'exemplar', 'of', 'the', 'ultrashortperiod', 'usp', 'planets', 'a', 'category', 'defined', 'by', 'the', 'simple', 'criterion', 'p_rm', 'orb', '1', 'day', 'we', 'describe', 'our', 'fourierbased', 'search', 'of', 'the', 'kepler', 'data', 'that', 'led', 'to', 'the', 'discovery', 'of', 'kepler78b', 'and', 'review', 'what', 'has', 'since', 'been', 'learned', 'about', 'the', 'population', 'of', 'usp', 'planets', 'they', 'are', 'about', 'as', 'common', 'as', 'hot', 'jupiters', 'and', 'they', 'are', 'almost', 'always', 'smaller', 'than', '2', 'r_oplus', 'they', 'are', 'often', 'members', 'of', 'compact', 'multiplanet', 'systems', 'although', 'they', 'tend', 'to', 'have', 'relatively', 'large', 'period', 'ratios', 'and', 'mutual', 'inclinations', 'they', 'might', 'be', 'the', 'exposed', 'rocky', 'cores', 'of', 'gas', 'dwarfs', 'the', 'planets', 'between', '24', 'r_oplus', 'in', 'size', 'that', 'are', 'commonly', 'found', 'in', 'somewhat', 'wider', 'orbits']] | [-0.11397671637984642, 0.19828766418523677, -0.0764362119612327, 0.1037897225551684, -0.10008173063703764, -0.0946830784577239, 0.047235214133060685, 0.37936141250017835, -0.13548732257301085, -0.3933526972173958, 0.14279870265837466, -0.30711655507452396, -0.0757546313474641, 0.2279302567461089, -0.1355993638874344, 0.023419019177948173, 0.12902721905036169, 0.03980812519301636, -0.04549793771691743, -0.3338725436187815, 0.21341347881580555, 0.06051379682398156, 0.05646136358968521, -0.033277539851903716, -0.0007878926508055883, -0.09263259747163638, -0.005279132228200692, -0.05216998028213551, -0.17463613364289862, 0.036045294702298156, 0.24920288201936178, 0.13955054079537818, 0.2311078456305519, -0.3417757528705375, -0.16657001185950848, 0.09831645666456193, 0.17418624785128295, 0.018761816173393623, -0.0038680288240644394, -0.26121780210125606, 0.13479776238474236, -0.2272115544887799, -0.1476865398397326, -0.006761347482863225, 0.1866936220260533, -0.014026749392015566, -0.22404269972895763, 0.06639740710747183, 0.09107440292198014, 0.174930162035468, -0.10742469686757479, -0.22600121322504588, -0.0766838927688935, 0.08211834376714633, 0.05443075683739919, 0.046851097528001685, 0.15754433705986134, -0.030768555585956692, -0.020268775206013265, 0.42004486116409107, -0.043894730611435465, -0.040142995890499536, 0.2874350823143399, -0.20504434976273364, -0.10123418937559779, 0.1745557398780396, 0.17231923145989544, 0.15069015927943646, -0.1797980588223589, -0.03263657818905286, -0.0719580253621404, 0.2255924410940344, 0.1100722486934453, 0.06684849657559473, 0.38788183567138684, 0.13040713602018322, 0.07715253180542372, -0.011307187076645756, -0.19120895997988746, -0.0787670113342373, -0.11321942475440569, -0.12181213382925642, -0.1679129313568793, 0.04691184432656308, -0.08494492991485458, -0.1138595521915704, 0.33387289694387856, 0.13506130127107577, 0.20348079958134085, 0.03964541845045077, 0.25127235717311697, 0.0812147510564261, 0.1889872767552381, 0.13131850442579507, 0.3084137574095573, 0.11946569454065818, 0.07523311033697896, -0.15126611792948097, 0.0990538353400648, -0.047019727191103526] |
1,803.03304 | A model of reward-modulated motor learning with parallelcortical and
basal ganglia pathways | Many recent studies of the motor system are divided into two distinct
approaches: Those that investigate how motor responses are encoded in cortical
neurons' firing rate dynamics and those that study the learning rules by which
mammals and songbirds develop reliable motor responses. Computationally, the
first approach is encapsulated by reservoir computing models, which can learn
intricate motor tasks and produce internal dynamics strikingly similar to those
of motor cortical neurons, but rely on biologically unrealistic learning rules.
The more realistic learning rules developed by the second approach are often
derived for simplified, discrete tasks in contrast to the intricate dynamics
that characterize real motor responses. We bridge these two approaches to
develop a biologically realistic learning rule for reservoir computing. Our
algorithm learns simulated motor tasks on which previous reservoir computing
algorithms fail, and reproduces experimental findings including those that
relate motor learning to Parkinson's disease and its treatment.
| q-bio.NC cs.NE | many recent studies of the motor system are divided into two distinct approaches those that investigate how motor responses are encoded in cortical neurons firing rate dynamics and those that study the learning rules by which mammals and songbirds develop reliable motor responses computationally the first approach is encapsulated by reservoir computing models which can learn intricate motor tasks and produce internal dynamics strikingly similar to those of motor cortical neurons but rely on biologically unrealistic learning rules the more realistic learning rules developed by the second approach are often derived for simplified discrete tasks in contrast to the intricate dynamics that characterize real motor responses we bridge these two approaches to develop a biologically realistic learning rule for reservoir computing our algorithm learns simulated motor tasks on which previous reservoir computing algorithms fail and reproduces experimental findings including those that relate motor learning to parkinsons disease and its treatment | [['many', 'recent', 'studies', 'of', 'the', 'motor', 'system', 'are', 'divided', 'into', 'two', 'distinct', 'approaches', 'those', 'that', 'investigate', 'how', 'motor', 'responses', 'are', 'encoded', 'in', 'cortical', 'neurons', 'firing', 'rate', 'dynamics', 'and', 'those', 'that', 'study', 'the', 'learning', 'rules', 'by', 'which', 'mammals', 'and', 'songbirds', 'develop', 'reliable', 'motor', 'responses', 'computationally', 'the', 'first', 'approach', 'is', 'encapsulated', 'by', 'reservoir', 'computing', 'models', 'which', 'can', 'learn', 'intricate', 'motor', 'tasks', 'and', 'produce', 'internal', 'dynamics', 'strikingly', 'similar', 'to', 'those', 'of', 'motor', 'cortical', 'neurons', 'but', 'rely', 'on', 'biologically', 'unrealistic', 'learning', 'rules', 'the', 'more', 'realistic', 'learning', 'rules', 'developed', 'by', 'the', 'second', 'approach', 'are', 'often', 'derived', 'for', 'simplified', 'discrete', 'tasks', 'in', 'contrast', 'to', 'the', 'intricate', 'dynamics', 'that', 'characterize', 'real', 'motor', 'responses', 'we', 'bridge', 'these', 'two', 'approaches', 'to', 'develop', 'a', 'biologically', 'realistic', 'learning', 'rule', 'for', 'reservoir', 'computing', 'our', 'algorithm', 'learns', 'simulated', 'motor', 'tasks', 'on', 'which', 'previous', 'reservoir', 'computing', 'algorithms', 'fail', 'and', 'reproduces', 'experimental', 'findings', 'including', 'those', 'that', 'relate', 'motor', 'learning', 'to', 'parkinsons', 'disease', 'and', 'its', 'treatment']] | [-0.053534012372450285, 0.10853274766821414, -0.07376442929729819, 0.08104085133799041, -0.10359523082772891, -0.22939477960268656, 0.03484183530012767, 0.4394130433102449, -0.23451076519365113, -0.32540068111071985, 0.034719882970675825, -0.22148502480859558, -0.31633284439953663, 0.23428329909220338, -0.11077248699342211, 0.05424603514955379, 0.09514546680574616, 0.028964939432529112, 0.04492250294114153, -0.2216877902431103, 0.23253385739711424, -0.020022172027577955, 0.32749379116576166, -0.04941234329715371, 0.13586840129457414, -0.06865333853832757, -0.0160349357376496, -0.02394897342349092, -0.1022396544982136, 0.20351970485101142, 0.3446673820240782, 0.16309485527841996, 0.31729543739308913, -0.5358807215218743, -0.25760279710715017, 0.08555131858835617, 0.13802372333593665, 0.1178421949230445, 0.022649199406441767, -0.2798625273288538, 0.04277641277139386, -0.1427659652257959, 0.017692582809055845, -0.1932796222898954, -0.005868809202996393, 0.05507765933754854, -0.24688808649157484, 0.08502807749900967, 0.05903498317270229, 0.08751224381383509, -0.08171122933349882, -0.11133278710224355, 0.024011559422748786, 0.2056841661222279, 0.025220172290379803, 0.01971599796321243, 0.31285197590788205, -0.18270541633013637, -0.1609558465719844, 0.32251720192531746, 0.04062458181908975, -0.20342918047060568, 0.2588524107557411, -0.06901637130106489, -0.16914798143009344, 0.10148972887545823, 0.19415373095311225, 0.07918247612503668, -0.21953042709889511, -0.06458913007945133, -0.0333510458531479, 0.14464691738287608, 0.01477444136204819, -0.0405049521351854, 0.17233822129356363, 0.19505006119608878, -0.009137457541267697, 0.11377298428677023, -0.027094962380360813, -0.18723057157049577, -0.19653575231631598, -0.043821869840224584, -0.16020931171874206, -0.012616290869191289, -0.06701914388637913, -0.10157109927977824, 0.38832741635541124, 0.1872105837178727, 0.20652304566911578, 0.14581671526267503, 0.32714374154883746, 0.05784708913803722, 0.09823890814868112, 0.05324023353246351, 0.16058983942959457, 0.07905376611840136, 0.10509017115458846, -0.27992438912566286, 0.1480010531571073, 0.02615935173506538] |
1,803.03305 | The Evolution of Environmental Quenching Timescales to $z\sim1.6$ | Using a sample of 4 galaxy clusters at $1.35 < z < 1.65$ and 10 galaxy
clusters at $0.85 < z < 1.35$, we measure the environmental quenching
timescale, $t_Q$, corresponding to the time required after a galaxy is accreted
by a cluster for it to fully cease star formation. Cluster members are selected
by a photometric-redshift criterion, and categorized as star-forming,
quiescent, or intermediate according to their dust-corrected rest-frame colors
and magnitudes. We employ a "delayed-then-rapid" quenching model that relates a
simulated cluster mass accretion rate to the observed numbers of each type of
galaxy in the cluster to constrain $t_Q$. For galaxies of mass $M_* \gtrsim
10^{10.5}~ \mathrm{M}_\odot$, we find a quenching timescale of $t_Q=$ 1.24 Gyr
in the $z\sim1.5$ cluster sample, and $t_Q=$ 1.50 Gyr at $z\sim1$. Using values
drawn from the literature, we compare the redshift evolution of $t_Q$ to
timescales predicted for different physical quenching mechanisms. We find $t_Q$
to depend on host halo mass such that quenching occurs over faster timescales
in clusters relative to groups, suggesting that properties of the host halo are
responsible for quenching high-mass galaxies. Between $z=0$ and $z=1.5$, we
find that $t_Q$ evolves faster than the molecular gas depletion timescale and
slower than an SFR-outflow timescale, but is consistent with the evolution of
the dynamical time. This suggests that environmental quenching in these
galaxies is driven by the motion of satellites relative to the cluster
environment, although due to uncertainties in the atomic gas budget at high
redshift, we cannot rule out quenching due to simple gas depletion.
| astro-ph.GA | using a sample of 4 galaxy clusters at 135 z 165 and 10 galaxy clusters at 085 z 135 we measure the environmental quenching timescale t_q corresponding to the time required after a galaxy is accreted by a cluster for it to fully cease star formation cluster members are selected by a photometricredshift criterion and categorized as starforming quiescent or intermediate according to their dustcorrected restframe colors and magnitudes we employ a delayedthenrapid quenching model that relates a simulated cluster mass accretion rate to the observed numbers of each type of galaxy in the cluster to constrain t_q for galaxies of mass m_ gtrsim 10105 mathrmm_odot we find a quenching timescale of t_q 124 gyr in the zsim15 cluster sample and t_q 150 gyr at zsim1 using values drawn from the literature we compare the redshift evolution of t_q to timescales predicted for different physical quenching mechanisms we find t_q to depend on host halo mass such that quenching occurs over faster timescales in clusters relative to groups suggesting that properties of the host halo are responsible for quenching highmass galaxies between z0 and z15 we find that t_q evolves faster than the molecular gas depletion timescale and slower than an sfroutflow timescale but is consistent with the evolution of the dynamical time this suggests that environmental quenching in these galaxies is driven by the motion of satellites relative to the cluster environment although due to uncertainties in the atomic gas budget at high redshift we cannot rule out quenching due to simple gas depletion | [['using', 'a', 'sample', 'of', '4', 'galaxy', 'clusters', 'at', '135', 'z', '165', 'and', '10', 'galaxy', 'clusters', 'at', '085', 'z', '135', 'we', 'measure', 'the', 'environmental', 'quenching', 'timescale', 't_q', 'corresponding', 'to', 'the', 'time', 'required', 'after', 'a', 'galaxy', 'is', 'accreted', 'by', 'a', 'cluster', 'for', 'it', 'to', 'fully', 'cease', 'star', 'formation', 'cluster', 'members', 'are', 'selected', 'by', 'a', 'photometricredshift', 'criterion', 'and', 'categorized', 'as', 'starforming', 'quiescent', 'or', 'intermediate', 'according', 'to', 'their', 'dustcorrected', 'restframe', 'colors', 'and', 'magnitudes', 'we', 'employ', 'a', 'delayedthenrapid', 'quenching', 'model', 'that', 'relates', 'a', 'simulated', 'cluster', 'mass', 'accretion', 'rate', 'to', 'the', 'observed', 'numbers', 'of', 'each', 'type', 'of', 'galaxy', 'in', 'the', 'cluster', 'to', 'constrain', 't_q', 'for', 'galaxies', 'of', 'mass', 'm_', 'gtrsim', '10105', 'mathrmm_odot', 'we', 'find', 'a', 'quenching', 'timescale', 'of', 't_q', '124', 'gyr', 'in', 'the', 'zsim15', 'cluster', 'sample', 'and', 't_q', '150', 'gyr', 'at', 'zsim1', 'using', 'values', 'drawn', 'from', 'the', 'literature', 'we', 'compare', 'the', 'redshift', 'evolution', 'of', 't_q', 'to', 'timescales', 'predicted', 'for', 'different', 'physical', 'quenching', 'mechanisms', 'we', 'find', 't_q', 'to', 'depend', 'on', 'host', 'halo', 'mass', 'such', 'that', 'quenching', 'occurs', 'over', 'faster', 'timescales', 'in', 'clusters', 'relative', 'to', 'groups', 'suggesting', 'that', 'properties', 'of', 'the', 'host', 'halo', 'are', 'responsible', 'for', 'quenching', 'highmass', 'galaxies', 'between', 'z0', 'and', 'z15', 'we', 'find', 'that', 't_q', 'evolves', 'faster', 'than', 'the', 'molecular', 'gas', 'depletion', 'timescale', 'and', 'slower', 'than', 'an', 'sfroutflow', 'timescale', 'but', 'is', 'consistent', 'with', 'the', 'evolution', 'of', 'the', 'dynamical', 'time', 'this', 'suggests', 'that', 'environmental', 'quenching', 'in', 'these', 'galaxies', 'is', 'driven', 'by', 'the', 'motion', 'of', 'satellites', 'relative', 'to', 'the', 'cluster', 'environment', 'although', 'due', 'to', 'uncertainties', 'in', 'the', 'atomic', 'gas', 'budget', 'at', 'high', 'redshift', 'we', 'can', 'not', 'rule', 'out', 'quenching', 'due', 'to', 'simple', 'gas', 'depletion']] | [-0.06331833971678005, 0.17535856033900213, -0.10387774170102441, 0.1111580898989832, -0.0385551960253175, -0.029580329764433498, 0.09219342639541947, 0.4613170388501649, -0.15756091698273725, -0.36101970462238087, 0.028051004248817322, -0.24918900745756487, 0.022513933044255658, 0.19217465770905653, 0.014383374689621668, -0.06111587514300767, 0.009590917056672933, -0.0713702697909492, -0.07769172565689694, -0.33594701953743605, 0.3054138188487759, 0.050765321427481434, 0.14635170785226292, -0.058285908842934116, 0.08069863145729851, -0.08052753645963237, -0.06981101962555127, -0.05991155427767023, -0.2179270296611232, -0.055428353340282815, 0.20632741089508522, 0.09239153418251697, 0.28028131458250916, -0.3447122588750847, -0.14311094626638235, 0.10144416297872678, 0.2355826923176281, 0.06924476172117626, -0.07424532116237256, -0.21632665907461926, 0.10525342047947239, -0.21019129983569476, -0.14767250571064378, 0.08970547771884822, 0.08756686719572435, 0.0022396236311133, -0.22391721450942842, 0.2501489192174346, 0.003361380582061304, 0.05409438431847329, -0.1016292107118038, -0.08132896770303157, -0.09961361948802483, 0.07775302699255739, -0.002372515391485364, 0.11050714745286706, 0.2912159984146117, -0.12652816444032772, -0.009712553694479022, 0.4207309072362442, -0.041005094463117515, 0.0415397447734779, 0.28044399520925556, -0.22010142486359852, -0.18693727210492772, 0.12581237865721479, 0.15319894808618462, 0.06979855556587698, -0.15146361716895126, -0.04805110582634441, 0.036773929376995154, 0.2507789064344822, 0.012265481728393876, 0.061550463441366735, 0.28532145795984165, 0.14233994027873612, 0.05860198001769901, 0.05703572094915252, -0.14391528887619429, -0.05032440920670827, -0.19736790944840393, -0.06921720634415454, -0.1145688334881675, 0.12384366274123107, -0.14938300644908117, -0.05646622110541691, 0.3232431091149064, 0.12481648546972257, 0.2909307724924064, 0.13199638024282953, 0.24248956171065278, 0.10294113594299073, 0.15440147714095884, 0.11364207147876275, 0.25044043405602373, 0.17418158025772987, 0.027091902753283433, -0.2769318771544004, 0.06843364452167104, 0.0025333979851840174] |
1,803.03306 | Join-the-Shortest Queue Diffusion Limit in Halfin-Whitt Regime: Tail
Asymptotics and Scaling of Extrema | Consider a system of $N$ parallel single-server queues with unit-exponential
service time distribution and a single dispatcher where tasks arrive as a
Poisson process of rate $\lambda(N)$. When a task arrives, the dispatcher
assigns it to one of the servers according to the Join-the-Shortest Queue (JSQ)
policy. Eschenfeldt and Gamarnik (2015) established that in the Halfin-Whitt
regime where $(N-\lambda(N))/\sqrt{N}\to\beta>0$ as $N\to\infty$, appropriately
scaled occupancy measure of the system under the JSQ policy converges weakly on
any finite time interval to a certain diffusion process as $N\to\infty$.
Recently, it was further established by Braverman (2018) that the stationary
occupancy measure of the system converges weakly to the steady state of the
diffusion process as $N\to\infty$.
In this paper we perform a detailed analysis of the steady state of the above
diffusion process. Specifically, we establish precise tail-asymptotics of the
stationary distribution and scaling of extrema of the process on large
time-interval. Our results imply that the asymptotic steady-state scaled number
of servers with queue length two or larger exhibits an Exponential tail,
whereas that for the number of idle servers turns out to be Gaussian. From the
methodological point of view, the diffusion process under consideration goes
beyond the state-of-the-art techniques in the study of the steady-state of
diffusion processes. Lack of any closed form expression for the steady state
and intricate interdependency of the process dynamics on its local times make
the analysis significantly challenging. We develop a technique involving the
theory of regenerative processes that provides a tractable form for the
stationary measure, and in conjunction with several sharp hitting time
estimates, acts as a key vehicle in establishing the results.
| math.PR | consider a system of n parallel singleserver queues with unitexponential service time distribution and a single dispatcher where tasks arrive as a poisson process of rate lambdan when a task arrives the dispatcher assigns it to one of the servers according to the jointheshortest queue jsq policy eschenfeldt and gamarnik 2015 established that in the halfinwhitt regime where nlambdansqrtntobeta0 as ntoinfty appropriately scaled occupancy measure of the system under the jsq policy converges weakly on any finite time interval to a certain diffusion process as ntoinfty recently it was further established by braverman 2018 that the stationary occupancy measure of the system converges weakly to the steady state of the diffusion process as ntoinfty in this paper we perform a detailed analysis of the steady state of the above diffusion process specifically we establish precise tailasymptotics of the stationary distribution and scaling of extrema of the process on large timeinterval our results imply that the asymptotic steadystate scaled number of servers with queue length two or larger exhibits an exponential tail whereas that for the number of idle servers turns out to be gaussian from the methodological point of view the diffusion process under consideration goes beyond the stateoftheart techniques in the study of the steadystate of diffusion processes lack of any closed form expression for the steady state and intricate interdependency of the process dynamics on its local times make the analysis significantly challenging we develop a technique involving the theory of regenerative processes that provides a tractable form for the stationary measure and in conjunction with several sharp hitting time estimates acts as a key vehicle in establishing the results | [['consider', 'a', 'system', 'of', 'n', 'parallel', 'singleserver', 'queues', 'with', 'unitexponential', 'service', 'time', 'distribution', 'and', 'a', 'single', 'dispatcher', 'where', 'tasks', 'arrive', 'as', 'a', 'poisson', 'process', 'of', 'rate', 'lambdan', 'when', 'a', 'task', 'arrives', 'the', 'dispatcher', 'assigns', 'it', 'to', 'one', 'of', 'the', 'servers', 'according', 'to', 'the', 'jointheshortest', 'queue', 'jsq', 'policy', 'eschenfeldt', 'and', 'gamarnik', '2015', 'established', 'that', 'in', 'the', 'halfinwhitt', 'regime', 'where', 'nlambdansqrtntobeta0', 'as', 'ntoinfty', 'appropriately', 'scaled', 'occupancy', 'measure', 'of', 'the', 'system', 'under', 'the', 'jsq', 'policy', 'converges', 'weakly', 'on', 'any', 'finite', 'time', 'interval', 'to', 'a', 'certain', 'diffusion', 'process', 'as', 'ntoinfty', 'recently', 'it', 'was', 'further', 'established', 'by', 'braverman', '2018', 'that', 'the', 'stationary', 'occupancy', 'measure', 'of', 'the', 'system', 'converges', 'weakly', 'to', 'the', 'steady', 'state', 'of', 'the', 'diffusion', 'process', 'as', 'ntoinfty', 'in', 'this', 'paper', 'we', 'perform', 'a', 'detailed', 'analysis', 'of', 'the', 'steady', 'state', 'of', 'the', 'above', 'diffusion', 'process', 'specifically', 'we', 'establish', 'precise', 'tailasymptotics', 'of', 'the', 'stationary', 'distribution', 'and', 'scaling', 'of', 'extrema', 'of', 'the', 'process', 'on', 'large', 'timeinterval', 'our', 'results', 'imply', 'that', 'the', 'asymptotic', 'steadystate', 'scaled', 'number', 'of', 'servers', 'with', 'queue', 'length', 'two', 'or', 'larger', 'exhibits', 'an', 'exponential', 'tail', 'whereas', 'that', 'for', 'the', 'number', 'of', 'idle', 'servers', 'turns', 'out', 'to', 'be', 'gaussian', 'from', 'the', 'methodological', 'point', 'of', 'view', 'the', 'diffusion', 'process', 'under', 'consideration', 'goes', 'beyond', 'the', 'stateoftheart', 'techniques', 'in', 'the', 'study', 'of', 'the', 'steadystate', 'of', 'diffusion', 'processes', 'lack', 'of', 'any', 'closed', 'form', 'expression', 'for', 'the', 'steady', 'state', 'and', 'intricate', 'interdependency', 'of', 'the', 'process', 'dynamics', 'on', 'its', 'local', 'times', 'make', 'the', 'analysis', 'significantly', 'challenging', 'we', 'develop', 'a', 'technique', 'involving', 'the', 'theory', 'of', 'regenerative', 'processes', 'that', 'provides', 'a', 'tractable', 'form', 'for', 'the', 'stationary', 'measure', 'and', 'in', 'conjunction', 'with', 'several', 'sharp', 'hitting', 'time', 'estimates', 'acts', 'as', 'a', 'key', 'vehicle', 'in', 'establishing', 'the', 'results']] | [-0.13220590037522234, 0.09972735227837157, -0.11355662065104592, 0.039216860515591256, 0.0013806838092141436, -0.1585262975652034, 0.13059869307685354, 0.33427751767120173, -0.288201853132644, -0.24880186924676248, 0.11481959212157654, -0.25999446506393453, -0.09041964837454249, 0.16707913108519712, -0.055052982130846126, 0.08469132159479122, 0.07809488059170405, 0.08635054932142085, 0.0015422544462890208, -0.22951804202043047, 0.2978700412304026, 0.07452988188512984, 0.3213407591991057, 0.0036063782449250827, 0.12220150632541418, 0.030665339937530543, 0.005510314959309109, -0.024296967756959782, -0.13042645107374937, 0.03791484084901258, 0.21518855840588755, 0.11639078477134436, 0.3033132806981197, -0.4294990650153127, -0.18925078870680143, 0.10145547675820532, 0.15793575901974366, 0.05390204317161474, 0.012623557201621286, -0.2669525579151223, 0.07119976532936345, -0.1659219707120002, -0.13886437242933752, -0.03821725044988068, 0.025350666755540333, 0.08081337593090772, -0.3081139829113636, 0.06925029943534027, 0.10617487110651087, -0.006687576972557488, -0.042089935004378784, -0.08532380334276457, 0.0018785481876087786, 0.1785492562593894, 0.07681708309579152, 0.017592768850874806, 0.14508016381155678, -0.10567112175529636, -0.10455337980092196, 0.3417549294634457, -0.09161127226679935, -0.17873370735975308, 0.17579397881926354, -0.13678011058770867, -0.14638282592515686, 0.13278711085869033, 0.17617604439146817, 0.13248900389108378, -0.16799855818670134, 0.08332486245257531, -0.05680225856193656, 0.13612194020064378, 0.05466688230380998, 0.013288577437767807, 0.12115269507970453, 0.2188790209762766, 0.13981490009066175, 0.16306834780571283, -0.08237966388415503, -0.1679601276044121, -0.29759209378722873, -0.1799910833866969, -0.19862442584985307, 0.09408176960691907, -0.11303288882335806, -0.18063287230270836, 0.3390020941509424, 0.1414813653853303, 0.21743685220537853, 0.12613276347559513, 0.26573355523150993, 0.17734426788320992, -0.013980321744309744, 0.1174823541074269, 0.12264857888498713, 0.09299523204817786, 0.12862790585192593, -0.20576803461621693, 0.11143179180457163, 0.05079974176891868] |
1,803.03307 | Criticality and covered area fraction in confetti and Voronoi
percolation | Using the randomized algorithm method developed by Duminil-Copin, Raoufi and
Tassion (2019b), we exhibit sharp phase transition for the confetti percolation
model. This provides an alternate proof, than that of Ahlberg, Tassion and
Texeira (2018), for the critical parameter for percolation in this model to be
$1/2$ when the radius of the underlying shapes for the distinct colours arise
from the same distribution. In addition, we study the covered area fraction for
this model, which is akin to the covered volume fraction in continuum
percolation. Modulo a certain `transitivity condition', this study allows us to
calculate exact critical parameter for percolation when the underlying shapes
for different colours may be of different sizes. Similar results are also
obtained for the Poisson Voronoi percolation model when different coloured
points have different growth speeds.
| math.PR | using the randomized algorithm method developed by duminilcopin raoufi and tassion 2019b we exhibit sharp phase transition for the confetti percolation model this provides an alternate proof than that of ahlberg tassion and texeira 2018 for the critical parameter for percolation in this model to be 12 when the radius of the underlying shapes for the distinct colours arise from the same distribution in addition we study the covered area fraction for this model which is akin to the covered volume fraction in continuum percolation modulo a certain transitivity condition this study allows us to calculate exact critical parameter for percolation when the underlying shapes for different colours may be of different sizes similar results are also obtained for the poisson voronoi percolation model when different coloured points have different growth speeds | [['using', 'the', 'randomized', 'algorithm', 'method', 'developed', 'by', 'duminilcopin', 'raoufi', 'and', 'tassion', '2019b', 'we', 'exhibit', 'sharp', 'phase', 'transition', 'for', 'the', 'confetti', 'percolation', 'model', 'this', 'provides', 'an', 'alternate', 'proof', 'than', 'that', 'of', 'ahlberg', 'tassion', 'and', 'texeira', '2018', 'for', 'the', 'critical', 'parameter', 'for', 'percolation', 'in', 'this', 'model', 'to', 'be', '12', 'when', 'the', 'radius', 'of', 'the', 'underlying', 'shapes', 'for', 'the', 'distinct', 'colours', 'arise', 'from', 'the', 'same', 'distribution', 'in', 'addition', 'we', 'study', 'the', 'covered', 'area', 'fraction', 'for', 'this', 'model', 'which', 'is', 'akin', 'to', 'the', 'covered', 'volume', 'fraction', 'in', 'continuum', 'percolation', 'modulo', 'a', 'certain', 'transitivity', 'condition', 'this', 'study', 'allows', 'us', 'to', 'calculate', 'exact', 'critical', 'parameter', 'for', 'percolation', 'when', 'the', 'underlying', 'shapes', 'for', 'different', 'colours', 'may', 'be', 'of', 'different', 'sizes', 'similar', 'results', 'are', 'also', 'obtained', 'for', 'the', 'poisson', 'voronoi', 'percolation', 'model', 'when', 'different', 'coloured', 'points', 'have', 'different', 'growth', 'speeds']] | [-0.051008652281374314, 0.1484453320011828, -0.09213071096545229, 0.07500887309792094, -0.024703726989145462, -0.13754911261897249, 0.06438409475466379, 0.36804429666640665, -0.2195963410803905, -0.3006525403031936, 0.07527681748973779, -0.2527912019842636, -0.1525932873509681, 0.15793289714492859, -0.06688565411963142, 0.03677554685049332, -0.018732250514082036, -0.0013986438369521727, -0.03136366696383518, -0.2373587385375196, 0.3013444705508076, -0.0028368092965907776, 0.28063088050828533, 0.05792196083527345, 0.014800058452125925, 0.020362899377225685, 0.011840998463762494, 0.08198005617238008, -0.2365715614289981, 0.05952239959442522, 0.19320096752355592, 0.07541727165673645, 0.20969490322929163, -0.3637349550970472, -0.1924221495746259, 0.14802825417763626, 0.1419305220246315, 0.10894055990054487, -0.013936036744360955, -0.2639527962757991, 0.11302791186966575, -0.13580742347269104, -0.1580868489932842, -0.004284601513511286, 0.04050440169297732, 0.03921570820160783, -0.2768999192648782, 0.08155633500718977, 0.06254802184860007, 0.05363198305981664, -0.04372078890670449, -0.12661581135605676, -0.00689379010313692, 0.14290342463265496, -0.015213621155215571, 0.026392826184522933, 0.07980352864027597, -0.10974078196674013, -0.10373892654449894, 0.3538929774855765, 0.013915033037930978, -0.14832991307171492, 0.1833292688243091, -0.1628760905855765, -0.20226955199614166, 0.16601810039988218, 0.1689728002816152, 0.09055578667276468, -0.12379798454740712, 0.05391272947890684, -0.052751308621373026, 0.13063848048645574, 0.07136708101472602, -0.03717621463494232, 0.1613407223055569, 0.15934514675038652, 0.07821123589080974, 0.1686049607721193, -0.08046090138646272, -0.1349642247664563, -0.27862007667382177, -0.12729449768174583, -0.18745579978164573, 0.037003861990972206, -0.19453846968401475, -0.19698964033562402, 0.36664317041062394, 0.17906518804643734, 0.2507286564303705, 0.1016580962513287, 0.2137958129742541, 0.12935483647474588, 0.04545224658213556, 0.05864037076512781, 0.2109944898205308, 0.09549755295917678, 0.05609096855892298, -0.14985443426188655, 0.07421524597403521, 0.13048921516165138] |
1,803.03308 | Impact of substrate temperature on magnetic properties of
plasma-assisted molecular beam epitaxy grown (Ga,Mn)N | A range of high quality Ga1-xMnxN layers have been grown by molecular beam
epitaxy with manganese concentration 0.2 < x < 10%, having the x value tuned by
changing the growth temperature (Tg) between 700 and 590 {\deg}C, respectively.
We present a systematic structural and microstructure characterization by
atomic force microscopy, secondary ion mass spectrometry, transmission electron
microscopy, powder-like and high resolution X-ray diffraction, which do not
reveal any crystallographic phase separation, clusters or nanocrystals, even at
the lowest Tg. Our synchrotron based X-ray absorption near-edge spectroscopy
supported by density functional theory modelling and superconducting quantum
interference device magnetometry results point to the predominantly +3
configuration of Mn in GaN and thus the ferromagnetic phase has been observed
in layers with x > 5% at 3 < T < 10 K. The main detrimental effect of Tg
reduced to 590 {\deg}C is formation of flat hillocks, which increase the
surface root-mean-square roughness, but only to mere 3.3 nm. Fine substrates
surface temperature mapping has shown that the magnitudes of both x and Curie
temperature (Tc) correlate with local Tg. It has been found that a typical 10
{\deg}C variation of Tg across 1 inch substrate can lead to 40% dispersion of
Tc. The established here strong sensitivity of Tc on Tg turns magnetic
measurements into a very efficient tool providing additional information on
local Tg, an indispensable piece of information for growth mastering of ternary
compounds in which metal species differ in almost every aspect of their growth
related parameters determining the kinetics of the growth. We also show that
the precise determination of Tc by two different methods, each sensitive to
different moments of Tc distribution, may serve as a tool for quantification of
spin homogeneity within the material.
| cond-mat.mtrl-sci | a range of high quality ga1xmnxn layers have been grown by molecular beam epitaxy with manganese concentration 02 x 10 having the x value tuned by changing the growth temperature tg between 700 and 590 degc respectively we present a systematic structural and microstructure characterization by atomic force microscopy secondary ion mass spectrometry transmission electron microscopy powderlike and high resolution xray diffraction which do not reveal any crystallographic phase separation clusters or nanocrystals even at the lowest tg our synchrotron based xray absorption nearedge spectroscopy supported by density functional theory modelling and superconducting quantum interference device magnetometry results point to the predominantly 3 configuration of mn in gan and thus the ferromagnetic phase has been observed in layers with x 5 at 3 t 10 k the main detrimental effect of tg reduced to 590 degc is formation of flat hillocks which increase the surface rootmeansquare roughness but only to mere 33 nm fine substrates surface temperature mapping has shown that the magnitudes of both x and curie temperature tc correlate with local tg it has been found that a typical 10 degc variation of tg across 1 inch substrate can lead to 40 dispersion of tc the established here strong sensitivity of tc on tg turns magnetic measurements into a very efficient tool providing additional information on local tg an indispensable piece of information for growth mastering of ternary compounds in which metal species differ in almost every aspect of their growth related parameters determining the kinetics of the growth we also show that the precise determination of tc by two different methods each sensitive to different moments of tc distribution may serve as a tool for quantification of spin homogeneity within the material | [['a', 'range', 'of', 'high', 'quality', 'ga1xmnxn', 'layers', 'have', 'been', 'grown', 'by', 'molecular', 'beam', 'epitaxy', 'with', 'manganese', 'concentration', '02', 'x', '10', 'having', 'the', 'x', 'value', 'tuned', 'by', 'changing', 'the', 'growth', 'temperature', 'tg', 'between', '700', 'and', '590', 'degc', 'respectively', 'we', 'present', 'a', 'systematic', 'structural', 'and', 'microstructure', 'characterization', 'by', 'atomic', 'force', 'microscopy', 'secondary', 'ion', 'mass', 'spectrometry', 'transmission', 'electron', 'microscopy', 'powderlike', 'and', 'high', 'resolution', 'xray', 'diffraction', 'which', 'do', 'not', 'reveal', 'any', 'crystallographic', 'phase', 'separation', 'clusters', 'or', 'nanocrystals', 'even', 'at', 'the', 'lowest', 'tg', 'our', 'synchrotron', 'based', 'xray', 'absorption', 'nearedge', 'spectroscopy', 'supported', 'by', 'density', 'functional', 'theory', 'modelling', 'and', 'superconducting', 'quantum', 'interference', 'device', 'magnetometry', 'results', 'point', 'to', 'the', 'predominantly', '3', 'configuration', 'of', 'mn', 'in', 'gan', 'and', 'thus', 'the', 'ferromagnetic', 'phase', 'has', 'been', 'observed', 'in', 'layers', 'with', 'x', '5', 'at', '3', 't', '10', 'k', 'the', 'main', 'detrimental', 'effect', 'of', 'tg', 'reduced', 'to', '590', 'degc', 'is', 'formation', 'of', 'flat', 'hillocks', 'which', 'increase', 'the', 'surface', 'rootmeansquare', 'roughness', 'but', 'only', 'to', 'mere', '33', 'nm', 'fine', 'substrates', 'surface', 'temperature', 'mapping', 'has', 'shown', 'that', 'the', 'magnitudes', 'of', 'both', 'x', 'and', 'curie', 'temperature', 'tc', 'correlate', 'with', 'local', 'tg', 'it', 'has', 'been', 'found', 'that', 'a', 'typical', '10', 'degc', 'variation', 'of', 'tg', 'across', '1', 'inch', 'substrate', 'can', 'lead', 'to', '40', 'dispersion', 'of', 'tc', 'the', 'established', 'here', 'strong', 'sensitivity', 'of', 'tc', 'on', 'tg', 'turns', 'magnetic', 'measurements', 'into', 'a', 'very', 'efficient', 'tool', 'providing', 'additional', 'information', 'on', 'local', 'tg', 'an', 'indispensable', 'piece', 'of', 'information', 'for', 'growth', 'mastering', 'of', 'ternary', 'compounds', 'in', 'which', 'metal', 'species', 'differ', 'in', 'almost', 'every', 'aspect', 'of', 'their', 'growth', 'related', 'parameters', 'determining', 'the', 'kinetics', 'of', 'the', 'growth', 'we', 'also', 'show', 'that', 'the', 'precise', 'determination', 'of', 'tc', 'by', 'two', 'different', 'methods', 'each', 'sensitive', 'to', 'different', 'moments', 'of', 'tc', 'distribution', 'may', 'serve', 'as', 'a', 'tool', 'for', 'quantification', 'of', 'spin', 'homogeneity', 'within', 'the', 'material']] | [-0.09894240939617485, 0.20617588168928527, -0.05925716115260156, -0.011225014560590302, -0.007598339252888789, -0.15884075340737824, 0.09476737996184556, 0.4430871750949554, -0.2556749027038754, -0.34846401256041826, 0.0371225036399498, -0.3075266833528614, -0.06832097633823779, 0.19018918631104817, 0.030042376179858044, 0.03926447342136796, -0.027536378876941176, -0.01860529231153507, -0.09888138175240233, -0.23317659599714216, 0.24512893023480936, 0.07826797404157615, 0.3180020972118962, 0.11183185539778952, 0.07388046252439585, -0.02537098283435523, 0.061939654289744794, 0.04046852904712965, -0.19141670898244856, 0.06460531176544208, 0.2624687663217782, -0.010041298478363003, 0.20795304047658672, -0.3983368824024375, -0.24693704740075448, 0.01965395710267074, 0.12406727599806454, 0.04413128878001425, -0.07832411257099216, -0.20635221685236976, 0.10279616237409793, -0.09159952374568707, -0.11637046253292258, -0.0619476358791564, 0.005174110373432918, -0.003938759973069365, -0.21776053568116277, 0.10300923702887073, 0.06205394524920233, 0.1545813281497341, -0.07685001058631878, -0.1581062220912558, -0.09189514202495355, 0.07098369964711618, 0.0027627079029449485, 0.05905838628483175, 0.232106709167235, -0.07818120950730485, -0.05167779156734879, 0.34458403092231865, -0.0676234605185963, -0.03924691589054419, 0.19316080488997486, -0.20320452554774485, -0.08937656987806074, 0.2268000034202205, 0.0961542373132059, 0.10422259211068002, -0.1471587212979269, 0.053237248468294765, 0.033396673608082676, 0.2674136829900689, 0.13527793356653592, 0.04032571330784597, 0.20381690102586733, 0.20293283632392406, 0.05026679706405586, 0.09422258211839428, -0.14771141085452336, 0.010775520249833944, -0.1755471402282407, -0.17326059260464627, -0.16601564497424579, 0.09871432734953615, -0.12083403894673249, -0.15525099743576967, 0.3410452493371337, 0.10450733134594359, 0.19697016302142029, -0.04100678392251852, 0.23354599660739606, 0.06224556719928547, 0.09789929888129208, 0.006484210922409007, 0.22842162321846354, 0.19978008591930685, 0.11903726879399086, -0.24930168468583846, 0.10897621939378516, -0.016912769430323542] |
1,803.03309 | Fields of Character Values for Finite Special Unitary Groups | Turull has described the fields of values for characters of $SL_n(q)$ in
terms of the parametrization of the characters of $GL_n(q)$. In this article,
we extend these results to the case of $SU_n(q)$.
| math.RT | turull has described the fields of values for characters of sl_nq in terms of the parametrization of the characters of gl_nq in this article we extend these results to the case of su_nq | [['turull', 'has', 'described', 'the', 'fields', 'of', 'values', 'for', 'characters', 'of', 'sl_nq', 'in', 'terms', 'of', 'the', 'parametrization', 'of', 'the', 'characters', 'of', 'gl_nq', 'in', 'this', 'article', 'we', 'extend', 'these', 'results', 'to', 'the', 'case', 'of', 'su_nq']] | [-0.1631901804922205, 0.06392794526023367, -0.07163961540032743, -0.01957094913814217, -0.018181304306243404, 0.014919436818948298, 0.005223103149822264, 0.293421979654919, -0.23829530676205954, -0.2464079519620899, 0.06230750294740905, -0.24046986691202177, -0.1461409478815216, 0.23515131476927886, -0.11238913751687064, -0.03128499841400436, 0.014463848293279156, 0.1004823889922012, -0.08923968074448181, -0.30332681361698743, 0.3808788140163277, -0.012283343793542095, 0.1976578930449305, 0.04330834252477595, 0.08213456934600165, 0.03521319938767137, -0.03478068044536154, -0.030512146877520012, -0.1453863988545808, 0.1840834645413314, 0.301012919369069, 0.06613078598060053, 0.1670369381141482, -0.3520852497807055, -0.14785794637194186, 0.14435639952055432, 0.12391202084042809, 0.0880659818649292, 0.030719144947149536, -0.25763593294488435, 0.11774933010791287, -0.2120723222297701, -0.1554530178281394, -0.06222116338992209, 0.03309073382424134, 0.04028836502270265, -0.24629547190146917, 0.06767343774889455, 0.12336368341295217, 0.09869993119641687, -0.0987642803934939, -0.17858599829064173, 0.05174948073302706, 0.14484800025820732, 0.09637349460161093, -0.012046455264543041, 0.0037395692938430743, -0.20651598338912608, -0.12504783205010675, 0.4073706619215734, -0.07168787720641404, -0.20963698632620048, 0.13160125445574522, -0.18235460874822104, -0.16714499636807226, 0.054453020350951134, 0.16505106964684796, 0.1441701196811416, -0.056139410162965454, 0.17013128485665552, -0.1288270836300922, 0.056068041982750096, 0.1010608629069545, -0.007383079352703961, 0.08616914024407213, 0.07936177707531235, -0.052367527545853096, 0.16804897505084448, -0.022889256928906296, -0.03116540229794654, -0.34497005740801495, -0.20984175535991337, -0.15140784447166053, 0.018380088534093265, -0.05394324883254188, -0.15832446165608638, 0.4989912816972444, 0.15224260622353264, 0.20320544199961604, 0.09730814682376204, 0.1518094843309937, 0.11374952627176588, 0.09354385050634544, 0.0102113605702691, 0.1924413890493187, 0.19112369203657814, 0.02268986488607797, -0.15243890621896947, 0.011242172172801062, 0.1049972279843959] |
1,803.0331 | Generalization in Metric Learning: Should the Embedding Layer be the
Embedding Layer? | This work studies deep metric learning under small to medium scale data as we
believe that better generalization could be a contributing factor to the
improvement of previous fine-grained image retrieval methods; it should be
considered when designing future techniques. In particular, we investigate
using other layers in a deep metric learning system (besides the embedding
layer) for feature extraction and analyze how well they perform on training
data and generalize to testing data. From this study, we suggest a new
regularization practice where one can add or choose a more optimal layer for
feature extraction. State-of-the-art performance is demonstrated on 3
fine-grained image retrieval benchmarks: Cars-196, CUB-200-2011, and Stanford
Online Product.
| cs.CV | this work studies deep metric learning under small to medium scale data as we believe that better generalization could be a contributing factor to the improvement of previous finegrained image retrieval methods it should be considered when designing future techniques in particular we investigate using other layers in a deep metric learning system besides the embedding layer for feature extraction and analyze how well they perform on training data and generalize to testing data from this study we suggest a new regularization practice where one can add or choose a more optimal layer for feature extraction stateoftheart performance is demonstrated on 3 finegrained image retrieval benchmarks cars196 cub2002011 and stanford online product | [['this', 'work', 'studies', 'deep', 'metric', 'learning', 'under', 'small', 'to', 'medium', 'scale', 'data', 'as', 'we', 'believe', 'that', 'better', 'generalization', 'could', 'be', 'a', 'contributing', 'factor', 'to', 'the', 'improvement', 'of', 'previous', 'finegrained', 'image', 'retrieval', 'methods', 'it', 'should', 'be', 'considered', 'when', 'designing', 'future', 'techniques', 'in', 'particular', 'we', 'investigate', 'using', 'other', 'layers', 'in', 'a', 'deep', 'metric', 'learning', 'system', 'besides', 'the', 'embedding', 'layer', 'for', 'feature', 'extraction', 'and', 'analyze', 'how', 'well', 'they', 'perform', 'on', 'training', 'data', 'and', 'generalize', 'to', 'testing', 'data', 'from', 'this', 'study', 'we', 'suggest', 'a', 'new', 'regularization', 'practice', 'where', 'one', 'can', 'add', 'or', 'choose', 'a', 'more', 'optimal', 'layer', 'for', 'feature', 'extraction', 'stateoftheart', 'performance', 'is', 'demonstrated', 'on', '3', 'finegrained', 'image', 'retrieval', 'benchmarks', 'cars196', 'cub2002011', 'and', 'stanford', 'online', 'product']] | [-0.012874923899029713, -0.017812934533659636, -0.07614444919246514, 0.08073657260787773, -0.11838149302431182, -0.19336990110085545, 0.040774263528874144, 0.45202993801129715, -0.2733458455311068, -0.3257028959300702, 0.1233556214823953, -0.29504972406097557, -0.16527147839951795, 0.22194155939879628, -0.13193592583827143, 0.06551412090711242, 0.1450148902024791, 0.03871001571574847, -0.08634074692443912, -0.2951649417061292, 0.33362422354444526, 0.08826951449269213, 0.3687130453929837, 0.05874170211557482, 0.0749780509660403, -0.018366750839049928, -0.04958489588794431, 0.006335150683298707, -0.07452932039300972, 0.15655044464074308, 0.33997104317573495, 0.1992806328219428, 0.2853714751628494, -0.39419166575784664, -0.2634280609199777, 0.07545980561657675, 0.16208781620194454, 0.10667676960916392, -0.05198612924829961, -0.29203285918837146, 0.0806880808106923, -0.1582119867297089, 0.01878615849584873, -0.19545819266100548, -0.03746727807863083, -0.07318572543590562, -0.30874894411369624, 0.007457629977060216, 0.08454422844910628, 0.044927664939547994, -0.046136847140067924, -0.13149197082280548, 0.07315824401406903, 0.16264875101504522, 0.02765315784199629, 0.08093265959853722, 0.1584722999375247, -0.17968694802922464, -0.13395068352942222, 0.3716085749079606, -0.10326344542513002, -0.20908020538315344, 0.19771870625221968, -0.03433950677780168, -0.16444418757704884, 0.022218023709553694, 0.27991488349757027, 0.1311705388486319, -0.1497212739015075, -0.003932278523799531, -0.05138722340052482, 0.2063870179741311, 0.07573794331567894, 0.01740566081675102, 0.13098778464440589, 0.29035350471219445, 0.05104329195039879, 0.15556768716955308, -0.1128201313424922, -0.04110964375597957, -0.1952539909065568, -0.13484081556504993, -0.14735670235157677, 0.0089386453120304, -0.1231543028964422, -0.105950778283711, 0.3560655405412295, 0.23702594133542984, 0.23120738068662053, 0.032061684843418856, 0.33383704140682574, 0.012907157983655842, 0.14367955475712993, 0.1071073286335117, 0.23097686540755344, -0.01805538745663528, 0.1265063587093859, -0.13626588788715058, 0.047489498074615506, 0.043589740345071605] |
1,803.03311 | A realization functor for abelian model categories | We study liftings of abelian model structures to categories of chain
complexes and construct a realization functor from the derived category of a
Grothendieck abelian category equipped with a cofibrantly generated, hereditary
abelian model structure to the homotopy category of that model structure.
| math.CT math.AC math.AT math.RT | we study liftings of abelian model structures to categories of chain complexes and construct a realization functor from the derived category of a grothendieck abelian category equipped with a cofibrantly generated hereditary abelian model structure to the homotopy category of that model structure | [['we', 'study', 'liftings', 'of', 'abelian', 'model', 'structures', 'to', 'categories', 'of', 'chain', 'complexes', 'and', 'construct', 'a', 'realization', 'functor', 'from', 'the', 'derived', 'category', 'of', 'a', 'grothendieck', 'abelian', 'category', 'equipped', 'with', 'a', 'cofibrantly', 'generated', 'hereditary', 'abelian', 'model', 'structure', 'to', 'the', 'homotopy', 'category', 'of', 'that', 'model', 'structure']] | [-0.15251500289454017, -0.0016655814292472462, -0.056901569164163154, 0.1430685141578663, -0.1393393701332253, -0.1677427909683523, -0.03187425612190435, 0.43923578636590827, -0.49635360000091927, -0.1673541570645432, 0.030814933558102955, -0.14926128285574228, -0.1130438425123345, 0.12007616872379426, -0.17830232857878126, -0.17056819536658221, 0.09203595948015708, 0.14560874558032252, -0.012159240562035593, -0.207877172666147, 0.5167012615995699, -0.0020590729491655217, 0.3114566340712393, -0.05244925626835158, 0.15202577750003615, -0.042772940966452275, 0.027467315063573593, 0.0278474910314693, -0.1560517171010995, 0.235003067267149, 0.33410644435951875, 0.004729741339593432, 0.0844788015901306, -0.34048567608345387, -0.11582745314943929, 0.20596499091317488, 0.024658734849613527, 0.06741151979279726, -0.05906751182276842, -0.37397278520430244, 0.14035068954839264, -0.36723391388997784, -0.07776403217034977, -0.07498825138954576, 0.0735767054869685, -0.015404592945002193, -0.27265631967646525, -0.14751610732204173, 0.04840089787924012, 0.14325597516239383, -0.16218245668380066, 0.020354022055344527, -0.17051333872341487, 0.06244574405989328, -0.09633171139014235, 0.017165569128295362, 0.1469816672615707, -0.16367221701630327, -0.18949234459635822, 0.4069377608424009, -0.10998950630079868, -0.17281935288202624, 0.14349580633583978, -0.1264323291996884, -0.15019918454074582, 0.18255377708132878, 0.004541442664556725, 0.14970341495909664, 0.007567536711237978, 0.25397525502363394, -0.2253990227486505, 0.09314385779895061, 0.0465949825769247, 0.011330454317896171, 0.1260420057251183, 0.18699081259411435, -0.04912383611812148, 0.1902503475092005, 0.04115252620215679, -0.08051783604504065, -0.3525650436275227, -0.13276651768057152, -0.012226559741552486, 0.17344105858788933, -0.024765234494373355, -0.2485582963238622, 0.44151862641406614, 0.15102986032131813, 0.16605973809004523, 0.19922994789775722, 0.2014923106099284, -0.09507894663270129, 0.10053248211828082, -0.04729928561421328, 0.038832246975670025, 0.36873797351104576, -0.13887666743032115, -0.013652043390022807, -0.034765035404044006, 0.3411718677989272] |
1,803.03312 | Molecular Heat Engines: Quantum Coherence Effects | Recent developments in nanoscale experimental techniques made it possible to
utilize single molecule junctions as devices for electronics and energy
transfer with quantum coherence playing an important role in their
thermoelectric characteristics. Theoretical studies on the efficiency of
nanoscale devices usually employ rate (Pauli) equations, which do not account
for quantum coherence. Therefore, the question whether quantum coherence could
improve the efficiency of a molecular device cannot be fully addressed within
such considerations. Here, we employ a nonequilibrium Green function approach
to study the effects of quantum coherence and dephasing on the thermoelectric
performance of molecular heat engines. Within a generic bichromophoric
donor-bridge-acceptor junction model, we show that quantum coherence may
increase efficiency compared to quasi-classical (rate equation) predictions and
that pure dephasing and dissipation destroy this effect.
| cond-mat.mes-hall | recent developments in nanoscale experimental techniques made it possible to utilize single molecule junctions as devices for electronics and energy transfer with quantum coherence playing an important role in their thermoelectric characteristics theoretical studies on the efficiency of nanoscale devices usually employ rate pauli equations which do not account for quantum coherence therefore the question whether quantum coherence could improve the efficiency of a molecular device cannot be fully addressed within such considerations here we employ a nonequilibrium green function approach to study the effects of quantum coherence and dephasing on the thermoelectric performance of molecular heat engines within a generic bichromophoric donorbridgeacceptor junction model we show that quantum coherence may increase efficiency compared to quasiclassical rate equation predictions and that pure dephasing and dissipation destroy this effect | [['recent', 'developments', 'in', 'nanoscale', 'experimental', 'techniques', 'made', 'it', 'possible', 'to', 'utilize', 'single', 'molecule', 'junctions', 'as', 'devices', 'for', 'electronics', 'and', 'energy', 'transfer', 'with', 'quantum', 'coherence', 'playing', 'an', 'important', 'role', 'in', 'their', 'thermoelectric', 'characteristics', 'theoretical', 'studies', 'on', 'the', 'efficiency', 'of', 'nanoscale', 'devices', 'usually', 'employ', 'rate', 'pauli', 'equations', 'which', 'do', 'not', 'account', 'for', 'quantum', 'coherence', 'therefore', 'the', 'question', 'whether', 'quantum', 'coherence', 'could', 'improve', 'the', 'efficiency', 'of', 'a', 'molecular', 'device', 'can', 'not', 'be', 'fully', 'addressed', 'within', 'such', 'considerations', 'here', 'we', 'employ', 'a', 'nonequilibrium', 'green', 'function', 'approach', 'to', 'study', 'the', 'effects', 'of', 'quantum', 'coherence', 'and', 'dephasing', 'on', 'the', 'thermoelectric', 'performance', 'of', 'molecular', 'heat', 'engines', 'within', 'a', 'generic', 'bichromophoric', 'donorbridgeacceptor', 'junction', 'model', 'we', 'show', 'that', 'quantum', 'coherence', 'may', 'increase', 'efficiency', 'compared', 'to', 'quasiclassical', 'rate', 'equation', 'predictions', 'and', 'that', 'pure', 'dephasing', 'and', 'dissipation', 'destroy', 'this', 'effect']] | [-0.1403444455485329, 0.1303519974545036, -0.07421819442998646, 0.06655050903583999, -0.03186476675526405, -0.161104103662218, 0.08213982093797693, 0.39351965424193197, -0.26473973537325973, -0.280127736014249, 0.023537619024977204, -0.2614192857240984, -0.1366840335612669, 0.25741563117864374, -0.032877371866660295, 0.10243764825078637, 0.06627311951177585, -0.029388577951652596, -0.05984526943792625, -0.21621153822399733, 0.2292220943657927, 0.10231867528794868, 0.3596975221443026, 0.14520631820439947, 0.06243314517503099, -0.02226483498523084, 0.06772820484398524, 0.002801896109021911, -0.14719258081007752, 0.07948678478737571, 0.29019752248775127, 0.03489429823505555, 0.25982021340421696, -0.5263417951127355, -0.2840348395352909, 0.05334089730440751, 0.1610678718696067, 0.15324984262643251, -0.06381776214244707, -0.2310503937968219, 0.056894781890996664, -0.19799638777797998, -0.0653713634235391, -0.11363189404310528, -0.008553648567866794, -0.0016807027489611113, -0.1934522624170884, 0.08871765572996448, 0.08696720775942383, 0.021320829514500705, -0.008396145816154187, -0.0703925186178878, 0.0394541984423995, 0.11998905359529131, -0.06407158744120754, -0.012456475183107826, 0.23755070328705244, -0.1617119641155149, -0.1744055570312595, 0.3523925423853157, -0.05431076088313793, -0.20606519099931384, 0.16813878367416735, -0.12401603540954317, -0.08830524914601977, 0.06400291356727365, 0.15422060061968113, 0.0981857245643587, -0.19105544612317008, 0.03571877037283293, 0.05744377046448085, 0.17909957537456422, 0.013012234818248092, 0.18359162117347352, 0.2381929739923469, 0.18208814280959526, 0.017009656358322547, 0.12715311899200052, -0.07420768553766516, -0.14192643428136514, -0.2453488909545564, -0.1964614950968747, -0.20906093187969496, 0.159965531052453, -0.018986602537171524, -0.10888885317529126, 0.35056730469529945, 0.23307550669008822, 0.12662687070321205, -0.030092977701195393, 0.31478378022190673, 0.12542934590217825, 0.08930003089837499, 0.02194785458115182, 0.23867792717466318, 0.16960798011363534, 0.11832289724040401, -0.3443012822540332, 0.08386262192647154, -0.009855169268657071] |
1,803.03313 | Testing the Equivalence Principle in space after the MICROSCOPE mission | Tests of the Weak Equivalence Principle can reveal a new, composition
dependent, force of nature or disprove many models of new physics. For the
first time such a test is successfully carried out in space by the MICROSCOPE
satellite. Early results show no violation sourced by the Earth for Pt and Ti
test masses with random errors (after 8.26d of integration time) of about 1
part in 1e14, and similar systematic errors.It improves by 10 times over the
best ground tests with rotating torsion balances despite 70 times less
sensitivity to differential accelerations, thanks to the much stronger driving
signal in orbit. The test is limited by thermal noise from internal damping in
the gold wires used for electrical grounding. This noise was shown to decrease
when the s/c was set to rotate faster than planned. The result will improve by
the end of the mission, as thermal noise decreases with more data. Not so
systematic errors. We investigate major non-gravitational effects and find that
the Pt-Pt sensor does not allow their separation from the signal. The early
test reports an upper limit of systematic errors in the Pt-Ti sensor which are
not detected in the Pt-Pt one, hence would not be distinguished from a
violation. Once all the integration time is used to reduce random noise there
will be no time left to check systematics. MICROSCOPE demonstrates the huge
potential of space for WEP tests of very high precision and indicates how to
reach it. To realize the potential, a new experiment needs the spacecraft to be
in rapid, stable rotation around the symmetry axis, needs high quality
state-of-the-art mechanical suspensions, and must allow systematic checks. The
design of the "Galileo Galilei" (GG) experiment, aiming to test the WEP to 1
part in 1e17 unites all the needed features, indicating that a quantum leap in
space is possible provided the new experiment heeds the lessons of MICROSCOPE.
| gr-qc physics.ins-det | tests of the weak equivalence principle can reveal a new composition dependent force of nature or disprove many models of new physics for the first time such a test is successfully carried out in space by the microscope satellite early results show no violation sourced by the earth for pt and ti test masses with random errors after 826d of integration time of about 1 part in 1e14 and similar systematic errorsit improves by 10 times over the best ground tests with rotating torsion balances despite 70 times less sensitivity to differential accelerations thanks to the much stronger driving signal in orbit the test is limited by thermal noise from internal damping in the gold wires used for electrical grounding this noise was shown to decrease when the sc was set to rotate faster than planned the result will improve by the end of the mission as thermal noise decreases with more data not so systematic errors we investigate major nongravitational effects and find that the ptpt sensor does not allow their separation from the signal the early test reports an upper limit of systematic errors in the ptti sensor which are not detected in the ptpt one hence would not be distinguished from a violation once all the integration time is used to reduce random noise there will be no time left to check systematics microscope demonstrates the huge potential of space for wep tests of very high precision and indicates how to reach it to realize the potential a new experiment needs the spacecraft to be in rapid stable rotation around the symmetry axis needs high quality stateoftheart mechanical suspensions and must allow systematic checks the design of the galileo galilei gg experiment aiming to test the wep to 1 part in 1e17 unites all the needed features indicating that a quantum leap in space is possible provided the new experiment heeds the lessons of microscope | [['tests', 'of', 'the', 'weak', 'equivalence', 'principle', 'can', 'reveal', 'a', 'new', 'composition', 'dependent', 'force', 'of', 'nature', 'or', 'disprove', 'many', 'models', 'of', 'new', 'physics', 'for', 'the', 'first', 'time', 'such', 'a', 'test', 'is', 'successfully', 'carried', 'out', 'in', 'space', 'by', 'the', 'microscope', 'satellite', 'early', 'results', 'show', 'no', 'violation', 'sourced', 'by', 'the', 'earth', 'for', 'pt', 'and', 'ti', 'test', 'masses', 'with', 'random', 'errors', 'after', '826d', 'of', 'integration', 'time', 'of', 'about', '1', 'part', 'in', '1e14', 'and', 'similar', 'systematic', 'errorsit', 'improves', 'by', '10', 'times', 'over', 'the', 'best', 'ground', 'tests', 'with', 'rotating', 'torsion', 'balances', 'despite', '70', 'times', 'less', 'sensitivity', 'to', 'differential', 'accelerations', 'thanks', 'to', 'the', 'much', 'stronger', 'driving', 'signal', 'in', 'orbit', 'the', 'test', 'is', 'limited', 'by', 'thermal', 'noise', 'from', 'internal', 'damping', 'in', 'the', 'gold', 'wires', 'used', 'for', 'electrical', 'grounding', 'this', 'noise', 'was', 'shown', 'to', 'decrease', 'when', 'the', 'sc', 'was', 'set', 'to', 'rotate', 'faster', 'than', 'planned', 'the', 'result', 'will', 'improve', 'by', 'the', 'end', 'of', 'the', 'mission', 'as', 'thermal', 'noise', 'decreases', 'with', 'more', 'data', 'not', 'so', 'systematic', 'errors', 'we', 'investigate', 'major', 'nongravitational', 'effects', 'and', 'find', 'that', 'the', 'ptpt', 'sensor', 'does', 'not', 'allow', 'their', 'separation', 'from', 'the', 'signal', 'the', 'early', 'test', 'reports', 'an', 'upper', 'limit', 'of', 'systematic', 'errors', 'in', 'the', 'ptti', 'sensor', 'which', 'are', 'not', 'detected', 'in', 'the', 'ptpt', 'one', 'hence', 'would', 'not', 'be', 'distinguished', 'from', 'a', 'violation', 'once', 'all', 'the', 'integration', 'time', 'is', 'used', 'to', 'reduce', 'random', 'noise', 'there', 'will', 'be', 'no', 'time', 'left', 'to', 'check', 'systematics', 'microscope', 'demonstrates', 'the', 'huge', 'potential', 'of', 'space', 'for', 'wep', 'tests', 'of', 'very', 'high', 'precision', 'and', 'indicates', 'how', 'to', 'reach', 'it', 'to', 'realize', 'the', 'potential', 'a', 'new', 'experiment', 'needs', 'the', 'spacecraft', 'to', 'be', 'in', 'rapid', 'stable', 'rotation', 'around', 'the', 'symmetry', 'axis', 'needs', 'high', 'quality', 'stateoftheart', 'mechanical', 'suspensions', 'and', 'must', 'allow', 'systematic', 'checks', 'the', 'design', 'of', 'the', 'galileo', 'galilei', 'gg', 'experiment', 'aiming', 'to', 'test', 'the', 'wep', 'to', '1', 'part', 'in', '1e17', 'unites', 'all', 'the', 'needed', 'features', 'indicating', 'that', 'a', 'quantum', 'leap', 'in', 'space', 'is', 'possible', 'provided', 'the', 'new', 'experiment', 'heeds', 'the', 'lessons', 'of', 'microscope']] | [-0.1001275778895924, 0.13923946151935812, -0.07804693322007855, 0.058596002449104116, -0.07667940450492242, -0.13049773517183014, 0.05654964711857102, 0.3447312259514417, -0.2367690073045355, -0.3565810611412402, 0.10024477644575878, -0.26585628482113993, -0.07533238846808672, 0.22836656683301998, -0.07917803431609793, 0.06427235971870167, 0.06465327324981372, 0.007889628419948239, -0.07570921407646633, -0.25467253708008525, 0.24154536625784304, 0.1371542482647956, 0.2644455278026206, 0.029963933827636378, 0.07522695501748887, -0.03129644283086121, -0.03728068290529625, 0.017752736616632087, -0.08133011723462943, 0.038656202840086605, 0.22313121916216452, 0.10716796604886887, 0.25501595174834607, -0.4501649271430714, -0.179800770517313, 0.11466738606566593, 0.10759050089728257, 0.11121718342866867, -0.032385047968146244, -0.3032178357199189, 0.09375591336394705, -0.14489733106974098, -0.1358097586869484, -0.07952882904496547, 0.03321803181417405, -0.006388549275311922, -0.25016247807126046, 0.056548301261361865, 0.05027362172684026, 0.06076330871548548, -0.03287637023373492, -0.09088677793874272, 0.003686845736459844, 0.1330898377145382, 0.06668732119095881, 0.0596687920480257, 0.14982743914837815, -0.09452853174658403, -0.09987835429150552, 0.41082873689158567, -0.08495290832938664, -0.14979645031474767, 0.18843669980646127, -0.19368017922979705, -0.12190866362717416, 0.14778893627337225, 0.14064510971814068, 0.07018827054670841, -0.16042858673576524, 0.03496753973239619, 0.05122842188141057, 0.2244821058423628, 0.06838431124693699, 0.019497893262092794, 0.21876143996441175, 0.1629469304375114, 0.09479669238937767, 0.095586477706231, -0.12170564609853225, -0.03140488615802799, -0.29791778721624895, -0.16137995264393146, -0.16191252678085769, 0.050265827826556884, -0.06850837829780565, -0.08754408360506954, 0.3410008913264536, 0.202988911155493, 0.1658854588473563, 0.013279448318413444, 0.30100261643861553, 0.05897215600240983, 0.10555960432448912, 0.036638125308996274, 0.3241281101406212, 0.10429925573768005, 0.09622990542335347, -0.20801254956362147, 0.06932239534429437, -0.017275493786418957] |
1,803.03314 | Theory for the conditioned spectral density of non-invariant random
matrices | We develop a theoretical approach to compute the conditioned spectral density
of $N \times N$ non-invariant random matrices in the limit $N \rightarrow
\infty$. This large deviation observable, defined as the eigenvalue
distribution conditioned to have a fixed fraction $k$ of eigenvalues smaller
than $x \in \mathbb{R}$, provides the spectrum of random matrix samples that
deviate atypically from the average behavior. We apply our theory to sparse
random matrices and unveil strikingly new and generic properties, namely: (i)
their conditioned spectral density has compact support; (ii) it does not
experience any abrupt transition for $k$ around its typical value; (iii) its
eigenvalues do not accumulate at $x$. Moreover, our work points towards other
types of transitions in the conditioned spectral density for values of $k$ away
from its typical value. These properties follow from the weak or absent
eigenvalue repulsion in sparse ensembles and they are in sharp contrast to
those displayed by classic or rotationally invariant random matrices. The
exactness of our theoretical findings are confirmed through numerical
diagonalization of finite random matrices.
| cond-mat.dis-nn cond-mat.stat-mech | we develop a theoretical approach to compute the conditioned spectral density of n times n noninvariant random matrices in the limit n rightarrow infty this large deviation observable defined as the eigenvalue distribution conditioned to have a fixed fraction k of eigenvalues smaller than x in mathbbr provides the spectrum of random matrix samples that deviate atypically from the average behavior we apply our theory to sparse random matrices and unveil strikingly new and generic properties namely i their conditioned spectral density has compact support ii it does not experience any abrupt transition for k around its typical value iii its eigenvalues do not accumulate at x moreover our work points towards other types of transitions in the conditioned spectral density for values of k away from its typical value these properties follow from the weak or absent eigenvalue repulsion in sparse ensembles and they are in sharp contrast to those displayed by classic or rotationally invariant random matrices the exactness of our theoretical findings are confirmed through numerical diagonalization of finite random matrices | [['we', 'develop', 'a', 'theoretical', 'approach', 'to', 'compute', 'the', 'conditioned', 'spectral', 'density', 'of', 'n', 'times', 'n', 'noninvariant', 'random', 'matrices', 'in', 'the', 'limit', 'n', 'rightarrow', 'infty', 'this', 'large', 'deviation', 'observable', 'defined', 'as', 'the', 'eigenvalue', 'distribution', 'conditioned', 'to', 'have', 'a', 'fixed', 'fraction', 'k', 'of', 'eigenvalues', 'smaller', 'than', 'x', 'in', 'mathbbr', 'provides', 'the', 'spectrum', 'of', 'random', 'matrix', 'samples', 'that', 'deviate', 'atypically', 'from', 'the', 'average', 'behavior', 'we', 'apply', 'our', 'theory', 'to', 'sparse', 'random', 'matrices', 'and', 'unveil', 'strikingly', 'new', 'and', 'generic', 'properties', 'namely', 'i', 'their', 'conditioned', 'spectral', 'density', 'has', 'compact', 'support', 'ii', 'it', 'does', 'not', 'experience', 'any', 'abrupt', 'transition', 'for', 'k', 'around', 'its', 'typical', 'value', 'iii', 'its', 'eigenvalues', 'do', 'not', 'accumulate', 'at', 'x', 'moreover', 'our', 'work', 'points', 'towards', 'other', 'types', 'of', 'transitions', 'in', 'the', 'conditioned', 'spectral', 'density', 'for', 'values', 'of', 'k', 'away', 'from', 'its', 'typical', 'value', 'these', 'properties', 'follow', 'from', 'the', 'weak', 'or', 'absent', 'eigenvalue', 'repulsion', 'in', 'sparse', 'ensembles', 'and', 'they', 'are', 'in', 'sharp', 'contrast', 'to', 'those', 'displayed', 'by', 'classic', 'or', 'rotationally', 'invariant', 'random', 'matrices', 'the', 'exactness', 'of', 'our', 'theoretical', 'findings', 'are', 'confirmed', 'through', 'numerical', 'diagonalization', 'of', 'finite', 'random', 'matrices']] | [-0.09372243607796771, 0.15714818187828722, -0.09051110203934555, 0.03504059702390805, -0.02670157429542735, -0.14431843685318085, 0.08401108494271985, 0.3879133273697533, -0.2387804423871011, -0.2512213703560718, 0.08050023362203769, -0.3268914281647524, -0.12634825134173508, 0.11704950418989656, -0.02288234575036935, 0.056558010616388585, 0.039742345844085016, 0.08238185541543724, -0.13802026694268524, -0.19678203970322322, 0.29799296306820866, 0.012192199785455033, 0.25166915259832495, -0.008434865715707406, 0.021701730747610844, -0.009393565229611236, -0.009405508738120847, 0.01733446528535636, -0.11482040004841695, 0.06787292611043921, 0.23930226174456165, 0.0890952353280415, 0.2506168010034438, -0.39613604804650804, -0.191859601733901, 0.1729464714359171, 0.1610287997320337, 0.0594555860326422, -0.01673755649445129, -0.2895511664054089, 0.13855345902065264, -0.1003262987520931, -0.1754303481563626, -0.06480681671809148, 0.03181548568355883, 0.037755531956369444, -0.29635716632982695, 0.11646948257279208, 0.08768827041835878, 0.03673306364437629, -0.004310531581012029, -0.20108486416926286, -0.019151599784702832, 0.1298454950654601, 0.036307040504286944, -0.021453308821361428, 0.14839650772982974, -0.07151001586776826, -0.06764439226465364, 0.33773835731306295, -0.08273302871192305, -0.1622556907595831, 0.18132200687267314, -0.2017115583688813, -0.15840652924373574, 0.18097147264185992, 0.15676784505746488, 0.1424037819412462, -0.06223340642146081, 0.11594662747791454, -0.05599503009646981, 0.13754993825802986, 0.03418733417183621, 0.041840035861743424, 0.17645282863007708, 0.0712663441864324, 0.08127686175003905, 0.08084590242534673, -0.06063391523831792, -0.10346846478514844, -0.28839025081766917, -0.0871999418160921, -0.27566252203775976, 0.14445340415966648, -0.14136594699285243, -0.20455331995738865, 0.3488566440154782, 0.16279818674806376, 0.2833837663230283, 0.1381491894416254, 0.21695618123490493, 0.13810416895979158, 0.01671215507299532, 0.09242437761972776, 0.1630844042125297, 0.1679595190665053, 0.07553696146585454, -0.18329275726479874, 0.07000883737439825, 0.05525860334907112] |
1,803.03315 | The class of $(P_7,C_4,C_5)$-free graphs: decomposition, algorithms, and
$\chi$-boundedness | As usual, $P_n$ ($n \geq 1$) denotes the path on $n$ vertices, and $C_n$ ($n
\geq 3$) denotes the cycle on $n$ vertices. For a family $\mathcal{H}$ of
graphs, we say that a graph $G$ is $\mathcal{H}$-free if no induced subgraph of
$G$ is isomorphic to any graph in $\mathcal{H}$. We present a decomposition
theorem for the class of $(P_7,C_4,C_5)$-free graphs; in fact, we give a
complete structural characterization of $(P_7,C_4,C_5)$-free graphs that do not
admit a clique-cutset. We use this decomposition theorem to show that the class
of $(P_7,C_4,C_5)$-free graphs is $\chi$-bounded by a linear function (more
precisely, every $(P_7,C_4,C_5)$-free graph $G$ satisfies $\chi(G) \leq
\frac{3}{2} \omega(G)$). We also use the decomposition theorem to construct an
$O(n^3)$ algorithm for the minimum coloring problem, an $O(n^2m)$ algorithm for
the maximum weight stable set problem, and an $O(n^3)$ algorithm for the
maximum weight clique problem for this class, where $n$ denotes the number of
vertices and $m$ the number of edges of the input graph.
| math.CO | as usual p_n n geq 1 denotes the path on n vertices and c_n n geq 3 denotes the cycle on n vertices for a family mathcalh of graphs we say that a graph g is mathcalhfree if no induced subgraph of g is isomorphic to any graph in mathcalh we present a decomposition theorem for the class of p_7c_4c_5free graphs in fact we give a complete structural characterization of p_7c_4c_5free graphs that do not admit a cliquecutset we use this decomposition theorem to show that the class of p_7c_4c_5free graphs is chibounded by a linear function more precisely every p_7c_4c_5free graph g satisfies chig leq frac32 omegag we also use the decomposition theorem to construct an on3 algorithm for the minimum coloring problem an on2m algorithm for the maximum weight stable set problem and an on3 algorithm for the maximum weight clique problem for this class where n denotes the number of vertices and m the number of edges of the input graph | [['as', 'usual', 'p_n', 'n', 'geq', '1', 'denotes', 'the', 'path', 'on', 'n', 'vertices', 'and', 'c_n', 'n', 'geq', '3', 'denotes', 'the', 'cycle', 'on', 'n', 'vertices', 'for', 'a', 'family', 'mathcalh', 'of', 'graphs', 'we', 'say', 'that', 'a', 'graph', 'g', 'is', 'mathcalhfree', 'if', 'no', 'induced', 'subgraph', 'of', 'g', 'is', 'isomorphic', 'to', 'any', 'graph', 'in', 'mathcalh', 'we', 'present', 'a', 'decomposition', 'theorem', 'for', 'the', 'class', 'of', 'p_7c_4c_5free', 'graphs', 'in', 'fact', 'we', 'give', 'a', 'complete', 'structural', 'characterization', 'of', 'p_7c_4c_5free', 'graphs', 'that', 'do', 'not', 'admit', 'a', 'cliquecutset', 'we', 'use', 'this', 'decomposition', 'theorem', 'to', 'show', 'that', 'the', 'class', 'of', 'p_7c_4c_5free', 'graphs', 'is', 'chibounded', 'by', 'a', 'linear', 'function', 'more', 'precisely', 'every', 'p_7c_4c_5free', 'graph', 'g', 'satisfies', 'chig', 'leq', 'frac32', 'omegag', 'we', 'also', 'use', 'the', 'decomposition', 'theorem', 'to', 'construct', 'an', 'on3', 'algorithm', 'for', 'the', 'minimum', 'coloring', 'problem', 'an', 'on2m', 'algorithm', 'for', 'the', 'maximum', 'weight', 'stable', 'set', 'problem', 'and', 'an', 'on3', 'algorithm', 'for', 'the', 'maximum', 'weight', 'clique', 'problem', 'for', 'this', 'class', 'where', 'n', 'denotes', 'the', 'number', 'of', 'vertices', 'and', 'm', 'the', 'number', 'of', 'edges', 'of', 'the', 'input', 'graph']] | [-0.20516205098829232, 0.11704731787078966, -0.026594569645367744, 0.01058321422063206, -0.11393599452382726, -0.13928182502050043, 0.05332294725330274, 0.3803636549103142, -0.28829561101227275, -0.3083688733847627, 0.05130185385620812, -0.32069118847934214, -0.16478939477507615, 0.11597312066530832, -0.10323062631097145, -0.0010910970158874989, 0.12810270711438868, 0.13983542760323006, 0.007085799036558899, -0.24452959215793782, 0.28180563132698855, -0.09777688524521115, 0.15187476219314083, 0.05148111917532799, 0.10495402592854722, 0.06434323659973083, 0.0534454992313574, 0.04509044914128736, -0.22527158953793022, 0.06229486927268005, 0.24450082100200943, 0.2120805319637151, 0.28076291949525134, -0.35365656040031773, -0.12191335675476982, 0.30817944476971537, 0.11941921430009576, -0.0050820632178972406, 0.04359178042006267, -0.15546769005098812, 0.1695819752370348, -0.10135749817496484, -0.10230418726256708, 0.010528089823598815, 0.14673895188238154, -0.06371845260671363, -0.32310158821822305, -0.02727949883233012, 0.14264972636010498, 0.027383681372512222, 0.07151972583676802, -0.19173966357825187, -0.03432087236362305, 0.054070568684681616, -0.12914435733989926, 0.09461160623695611, 0.009236022735954398, -0.09717994260817493, -0.15880387770466325, 0.36569108347878393, -0.037267668201111076, -0.1694283200308635, 0.02990957239654097, -0.11659576499652935, -0.23553095678884037, 0.10941902522520139, 0.1177321900556818, 0.2350526816870381, -0.03086010231238949, 0.18707930914973897, -0.1536515707195532, 0.12791647143923202, 0.11102214837787537, 0.015124304398252606, 0.041424593321630156, 0.11617487044749418, 0.22484359826194122, 0.18436647610023346, 0.027294472666321005, 0.06934996346216195, -0.33695062327130537, -0.13527475235268202, -0.2841718238111154, 0.1070343572306539, -0.21409659269494757, -0.2034411336034082, 0.37152486302458293, 0.08171658691234614, 0.18706378703028326, 0.1748416813164268, 0.20240999188305378, 0.07434948315006672, 0.017152837855974212, 0.20203905498393152, 0.05758776226103669, 0.2004131568090354, -0.05037781584542245, -0.18265461355515913, 0.026909103144667247, 0.20573675866443208] |
1,803.03316 | Embedding rainbow trees with applications to graph labelling and
decomposition | A subgraph of an edge-coloured graph is called rainbow if all its edges have
distinct colours. The study of rainbow subgraphs goes back more than two
hundred years to the work of Euler on Latin squares. Since then rainbow
structures have been the focus of extensive research and have found
applications in the areas of graph labelling and decomposition. An
edge-colouring is locally $k$-bounded if each vertex is contained in at most
$k$ edges of the same colour. In this paper we prove that any such
edge-colouring of the complete graph $K_n$ contains a rainbow copy of every
tree with at most $(1-o(1))n/k$ vertices. As a locally $k$-bounded
edge-colouring of $K_n$ may have only $(n-1)/k$ distinct colours, this is
essentially tight.
As a corollary of this result we obtain asymptotic versions of two
long-standing conjectures in graph theory. Firstly, we prove an asymptotic
version of Ringel's conjecture from 1963, showing that any $n$-edge tree packs
into the complete graph $K_{2n+o(n)}$ to cover all but $o(n^2)$ of its edges.
Secondly, we show that all trees have an almost-harmonious labelling. The
existence of such a labelling was conjectured by Graham and Sloane in 1980. We
also discuss some additional applications.
| math.CO | a subgraph of an edgecoloured graph is called rainbow if all its edges have distinct colours the study of rainbow subgraphs goes back more than two hundred years to the work of euler on latin squares since then rainbow structures have been the focus of extensive research and have found applications in the areas of graph labelling and decomposition an edgecolouring is locally kbounded if each vertex is contained in at most k edges of the same colour in this paper we prove that any such edgecolouring of the complete graph k_n contains a rainbow copy of every tree with at most 1o1nk vertices as a locally kbounded edgecolouring of k_n may have only n1k distinct colours this is essentially tight as a corollary of this result we obtain asymptotic versions of two longstanding conjectures in graph theory firstly we prove an asymptotic version of ringels conjecture from 1963 showing that any nedge tree packs into the complete graph k_2non to cover all but on2 of its edges secondly we show that all trees have an almostharmonious labelling the existence of such a labelling was conjectured by graham and sloane in 1980 we also discuss some additional applications | [['a', 'subgraph', 'of', 'an', 'edgecoloured', 'graph', 'is', 'called', 'rainbow', 'if', 'all', 'its', 'edges', 'have', 'distinct', 'colours', 'the', 'study', 'of', 'rainbow', 'subgraphs', 'goes', 'back', 'more', 'than', 'two', 'hundred', 'years', 'to', 'the', 'work', 'of', 'euler', 'on', 'latin', 'squares', 'since', 'then', 'rainbow', 'structures', 'have', 'been', 'the', 'focus', 'of', 'extensive', 'research', 'and', 'have', 'found', 'applications', 'in', 'the', 'areas', 'of', 'graph', 'labelling', 'and', 'decomposition', 'an', 'edgecolouring', 'is', 'locally', 'kbounded', 'if', 'each', 'vertex', 'is', 'contained', 'in', 'at', 'most', 'k', 'edges', 'of', 'the', 'same', 'colour', 'in', 'this', 'paper', 'we', 'prove', 'that', 'any', 'such', 'edgecolouring', 'of', 'the', 'complete', 'graph', 'k_n', 'contains', 'a', 'rainbow', 'copy', 'of', 'every', 'tree', 'with', 'at', 'most', '1o1nk', 'vertices', 'as', 'a', 'locally', 'kbounded', 'edgecolouring', 'of', 'k_n', 'may', 'have', 'only', 'n1k', 'distinct', 'colours', 'this', 'is', 'essentially', 'tight', 'as', 'a', 'corollary', 'of', 'this', 'result', 'we', 'obtain', 'asymptotic', 'versions', 'of', 'two', 'longstanding', 'conjectures', 'in', 'graph', 'theory', 'firstly', 'we', 'prove', 'an', 'asymptotic', 'version', 'of', 'ringels', 'conjecture', 'from', '1963', 'showing', 'that', 'any', 'nedge', 'tree', 'packs', 'into', 'the', 'complete', 'graph', 'k_2non', 'to', 'cover', 'all', 'but', 'on2', 'of', 'its', 'edges', 'secondly', 'we', 'show', 'that', 'all', 'trees', 'have', 'an', 'almostharmonious', 'labelling', 'the', 'existence', 'of', 'such', 'a', 'labelling', 'was', 'conjectured', 'by', 'graham', 'and', 'sloane', 'in', '1980', 'we', 'also', 'discuss', 'some', 'additional', 'applications']] | [-0.13839503686504964, 0.1100944386389202, -0.09468637100683573, 0.03570631704090211, -0.10362094384498703, -0.10370998432477697, 0.032869269505429725, 0.4050729445683268, -0.24063646278869455, -0.3062085164615359, 0.09535311470226122, -0.34781947842058847, -0.18339695144110382, 0.09406719689663404, -0.153816293951315, -0.020177207707475203, 0.1293443461999488, 0.10489477343582668, 0.046206679475159405, -0.32103438124385997, 0.2703552910222266, -0.06308247878765448, 0.1716298018820966, 0.09254489944507488, 0.08799390956425132, 0.04360971706193642, -0.02342986204685309, 0.10538785175587505, -0.19310552031215944, 0.04718519082197394, 0.2578877843653735, 0.19028494129649912, 0.2876083328651312, -0.40473925497499297, -0.17662511573841747, 0.20128312676858442, 0.15188820252936774, 0.07589838007847086, -0.010819322883094756, -0.17821018423986598, 0.1595184433154571, -0.10487556309463122, -0.0793579171363933, 0.01298233672695903, 0.11633749009133913, -0.02320527614404758, -0.2148365383490156, -0.056501222210966096, 0.12365917441172478, 0.06280906244825858, 0.05922685186020457, -0.16592366326934635, -0.06295271117526752, 0.12335605782528336, -0.02458966175476328, 0.0813646922341715, -0.009505933998689915, -0.11356744332080826, -0.18891157081876045, 0.3526272498166714, -0.01408111625627125, -0.10688023903669837, 0.1287823005221211, -0.13680990233969612, -0.23793851585867695, 0.08929817411147106, 0.08124963528452775, 0.1540465873881028, -0.1343145643360913, 0.13349998419871553, -0.17237701930869848, 0.10561963400970667, 0.19419863565992088, 0.04449253821363434, 0.1400960857908313, 0.13477305397033118, 0.16230341525963293, 0.19149091546901334, 0.009306379487642492, 0.038067769072949884, -0.28556885578406926, -0.14929430621723908, -0.23330501727580738, 0.0759498216295376, -0.1613807185407495, -0.22048094984478292, 0.41036276031667607, 0.11281481635315009, 0.20131251831562855, 0.08643082240715814, 0.24253504072817472, 0.06895384198317352, 0.05758995777712418, 0.17943086851961337, 0.15041993519079347, 0.16081541604123628, -0.04848273101692589, -0.12925587251949577, 0.03583335049617558, 0.15763633913981417] |
1,803.03317 | Analysis of Hand Segmentation in the Wild | A large number of works in egocentric vision have concentrated on action and
object recognition. Detection and segmentation of hands in first-person videos,
however, has less been explored. For many applications in this domain, it is
necessary to accurately segment not only hands of the camera wearer but also
the hands of others with whom he is interacting. Here, we take an in-depth look
at the hand segmentation problem. In the quest for robust hand segmentation
methods, we evaluated the performance of the state of the art semantic
segmentation methods, off the shelf and fine-tuned, on existing datasets. We
fine-tune RefineNet, a leading semantic segmentation method, for hand
segmentation and find that it does much better than the best contenders.
Existing hand segmentation datasets are collected in the laboratory settings.
To overcome this limitation, we contribute by collecting two new datasets: a)
EgoYouTubeHands including egocentric videos containing hands in the wild, and
b) HandOverFace to analyze the performance of our models in presence of similar
appearance occlusions. We further explore whether conditional random fields can
help refine generated hand segmentations. To demonstrate the benefit of
accurate hand maps, we train a CNN for hand-based activity recognition and
achieve higher accuracy when a CNN was trained using hand maps produced by the
fine-tuned RefineNet. Finally, we annotate a subset of the EgoHands dataset for
fine-grained action recognition and show that an accuracy of 58.6% can be
achieved by just looking at a single hand pose which is much better than the
chance level (12.5%).
| cs.CV | a large number of works in egocentric vision have concentrated on action and object recognition detection and segmentation of hands in firstperson videos however has less been explored for many applications in this domain it is necessary to accurately segment not only hands of the camera wearer but also the hands of others with whom he is interacting here we take an indepth look at the hand segmentation problem in the quest for robust hand segmentation methods we evaluated the performance of the state of the art semantic segmentation methods off the shelf and finetuned on existing datasets we finetune refinenet a leading semantic segmentation method for hand segmentation and find that it does much better than the best contenders existing hand segmentation datasets are collected in the laboratory settings to overcome this limitation we contribute by collecting two new datasets a egoyoutubehands including egocentric videos containing hands in the wild and b handoverface to analyze the performance of our models in presence of similar appearance occlusions we further explore whether conditional random fields can help refine generated hand segmentations to demonstrate the benefit of accurate hand maps we train a cnn for handbased activity recognition and achieve higher accuracy when a cnn was trained using hand maps produced by the finetuned refinenet finally we annotate a subset of the egohands dataset for finegrained action recognition and show that an accuracy of 586 can be achieved by just looking at a single hand pose which is much better than the chance level 125 | [['a', 'large', 'number', 'of', 'works', 'in', 'egocentric', 'vision', 'have', 'concentrated', 'on', 'action', 'and', 'object', 'recognition', 'detection', 'and', 'segmentation', 'of', 'hands', 'in', 'firstperson', 'videos', 'however', 'has', 'less', 'been', 'explored', 'for', 'many', 'applications', 'in', 'this', 'domain', 'it', 'is', 'necessary', 'to', 'accurately', 'segment', 'not', 'only', 'hands', 'of', 'the', 'camera', 'wearer', 'but', 'also', 'the', 'hands', 'of', 'others', 'with', 'whom', 'he', 'is', 'interacting', 'here', 'we', 'take', 'an', 'indepth', 'look', 'at', 'the', 'hand', 'segmentation', 'problem', 'in', 'the', 'quest', 'for', 'robust', 'hand', 'segmentation', 'methods', 'we', 'evaluated', 'the', 'performance', 'of', 'the', 'state', 'of', 'the', 'art', 'semantic', 'segmentation', 'methods', 'off', 'the', 'shelf', 'and', 'finetuned', 'on', 'existing', 'datasets', 'we', 'finetune', 'refinenet', 'a', 'leading', 'semantic', 'segmentation', 'method', 'for', 'hand', 'segmentation', 'and', 'find', 'that', 'it', 'does', 'much', 'better', 'than', 'the', 'best', 'contenders', 'existing', 'hand', 'segmentation', 'datasets', 'are', 'collected', 'in', 'the', 'laboratory', 'settings', 'to', 'overcome', 'this', 'limitation', 'we', 'contribute', 'by', 'collecting', 'two', 'new', 'datasets', 'a', 'egoyoutubehands', 'including', 'egocentric', 'videos', 'containing', 'hands', 'in', 'the', 'wild', 'and', 'b', 'handoverface', 'to', 'analyze', 'the', 'performance', 'of', 'our', 'models', 'in', 'presence', 'of', 'similar', 'appearance', 'occlusions', 'we', 'further', 'explore', 'whether', 'conditional', 'random', 'fields', 'can', 'help', 'refine', 'generated', 'hand', 'segmentations', 'to', 'demonstrate', 'the', 'benefit', 'of', 'accurate', 'hand', 'maps', 'we', 'train', 'a', 'cnn', 'for', 'handbased', 'activity', 'recognition', 'and', 'achieve', 'higher', 'accuracy', 'when', 'a', 'cnn', 'was', 'trained', 'using', 'hand', 'maps', 'produced', 'by', 'the', 'finetuned', 'refinenet', 'finally', 'we', 'annotate', 'a', 'subset', 'of', 'the', 'egohands', 'dataset', 'for', 'finegrained', 'action', 'recognition', 'and', 'show', 'that', 'an', 'accuracy', 'of', '586', 'can', 'be', 'achieved', 'by', 'just', 'looking', 'at', 'a', 'single', 'hand', 'pose', 'which', 'is', 'much', 'better', 'than', 'the', 'chance', 'level', '125']] | [-0.021368521272231, 0.021550193546928022, -0.07278027291349133, 0.07309100905809192, -0.13118400153831156, -0.20002689637453203, 0.007715232987293458, 0.4457594553741765, -0.19579957579131646, -0.3562226895052177, 0.10688338356689142, -0.29311440462699107, -0.14261308194972186, 0.22242737137039292, -0.16985725101090998, 0.02710607071149062, 0.18403150576978444, 0.11723014852219078, -0.04210248484601637, -0.30609037271321166, 0.268887104071961, 0.020719578132467217, 0.31174218416565574, 0.04775838128171382, 0.1375902997120377, -0.04928942904485031, -0.021258049245257992, 0.014273698486567262, -0.047697208076820666, 0.1721293345569674, 0.2730240450092026, 0.15077531050726348, 0.29500533088089814, -0.4243975378625304, -0.21445510567382844, 0.09923327588719356, 0.16335217314903216, 0.11075949233817077, -0.03563246406833585, -0.3893197002375581, 0.09665999234042479, -0.1419390379909396, 0.0017114501534381426, -0.11003433718686423, 0.01499840344328538, -0.05540929098069353, -0.26596443774926676, 0.04746291913869641, 0.04915474453659534, 0.09059692744678073, -0.07522315557215767, -0.10286828007803385, 0.024349689737044603, 0.22423143752340516, 0.03946088661110575, 0.06612202000627052, 0.15329225918644643, -0.27067975331299815, -0.11887223556231946, 0.3779490693326456, -0.04831952562293386, -0.2121529882001395, 0.2375160916502696, -0.10843791449292896, -0.1662301789524116, 0.1166125785963363, 0.1982871763273535, 0.15967089435937495, -0.1277779672385673, -0.008235103441131148, -0.04706421164313264, 0.209631692176782, 0.1007160683112017, -0.031041291985103494, 0.1829004737279232, 0.2527222296916861, 0.04959950900831107, 0.12794693121190995, -0.1766286866185835, -0.011675950257578888, -0.17703300125777244, -0.11055032248896533, -0.16491412577952397, -0.038859709723696886, -0.06218451167038131, -0.10963250855526262, 0.40564528793605215, 0.27906948937866166, 0.20171893353716108, 0.059913674491246315, 0.355686241805733, 0.003473851641352068, 0.11192900643718567, 0.067586498753912, 0.2159976037032154, -0.05490376369515247, 0.09887577968269229, -0.15977808801143104, 0.08255429007650641, 0.06631989326633338] |
1,803.03318 | Off-equilibrium corrections to energy and conserved charge densities in
the relativistic fluid in heavy-ion collisions | Dissipative processes in relativistic fluids are known to be important in the
analyses of the hot QCD matter created in high-energy heavy-ion collisions. In
this work, I consider dissipative corrections to energy and conserved charge
densities, which are conventionally assumed to be vanishing but could be
finite. Causal dissipative hydrodynamics is formulated in the presence of those
dissipative currents. The relation between hydrodynamic stability and transport
coefficients is discussed. I then study their phenomenological consequences on
the observables of heavy-ion collisions in numerical simulations. It is shown
that particle spectra and elliptic flow can be visibly modified.
| nucl-th hep-ph nucl-ex | dissipative processes in relativistic fluids are known to be important in the analyses of the hot qcd matter created in highenergy heavyion collisions in this work i consider dissipative corrections to energy and conserved charge densities which are conventionally assumed to be vanishing but could be finite causal dissipative hydrodynamics is formulated in the presence of those dissipative currents the relation between hydrodynamic stability and transport coefficients is discussed i then study their phenomenological consequences on the observables of heavyion collisions in numerical simulations it is shown that particle spectra and elliptic flow can be visibly modified | [['dissipative', 'processes', 'in', 'relativistic', 'fluids', 'are', 'known', 'to', 'be', 'important', 'in', 'the', 'analyses', 'of', 'the', 'hot', 'qcd', 'matter', 'created', 'in', 'highenergy', 'heavyion', 'collisions', 'in', 'this', 'work', 'i', 'consider', 'dissipative', 'corrections', 'to', 'energy', 'and', 'conserved', 'charge', 'densities', 'which', 'are', 'conventionally', 'assumed', 'to', 'be', 'vanishing', 'but', 'could', 'be', 'finite', 'causal', 'dissipative', 'hydrodynamics', 'is', 'formulated', 'in', 'the', 'presence', 'of', 'those', 'dissipative', 'currents', 'the', 'relation', 'between', 'hydrodynamic', 'stability', 'and', 'transport', 'coefficients', 'is', 'discussed', 'i', 'then', 'study', 'their', 'phenomenological', 'consequences', 'on', 'the', 'observables', 'of', 'heavyion', 'collisions', 'in', 'numerical', 'simulations', 'it', 'is', 'shown', 'that', 'particle', 'spectra', 'and', 'elliptic', 'flow', 'can', 'be', 'visibly', 'modified']] | [-0.12517311079931667, 0.23408364820937366, -0.1557976975220918, 0.12174454063762785, -0.030312766705053982, -0.10999707426856627, -0.1332900464683579, 0.3215517383356838, -0.26736527268976434, -0.2501887476753405, 0.02992002865462804, -0.30343467626029375, -0.03209897993881371, 0.15236591031779678, -0.002642622006308172, 0.07386583343781915, 0.05887197148530101, -0.0031518442532258856, -0.02215346727837069, -0.1995556668700055, 0.30361389432140845, 0.09864211547159657, 0.21042436774647266, 0.1374984422804231, 0.018756764547265683, -0.043031157102416624, -0.05890157022849493, 0.08417398611218044, -0.16604941869528123, -0.001164884421105506, 0.2870869545659684, -0.0014447609308300558, 0.1630360242171386, -0.45538479825193734, -0.27655339441694243, 0.11974144263370634, 0.14351555959503984, 0.14915561167038402, -0.04430043798290462, -0.23553715525291016, 0.06590029317165542, -0.21957146669209926, -0.1362528405104255, -0.09281492767826721, 0.020974470336067, 0.06530681262080817, -0.2637339032821588, 0.15878373250058017, 0.04534176306933472, 0.014188587929592612, -0.04786306166704552, -0.06907871867693269, -0.08292251545935869, 0.02052892120819078, 0.07263062445245222, -0.017815705386384093, 0.17346767330969462, -0.16850935427721628, -0.10929220226910158, 0.45339783142829676, -0.030641890361367427, -0.21610119560560614, 0.2234880407100793, -0.17154010116439505, -0.12248353067708691, 0.1100590280497197, 0.21829329819908155, 0.13769560804609784, -0.22345830257213914, 0.05579381543463672, -0.03266403481325845, 0.0860051252283924, 0.05155712110710513, 0.05818480145205388, 0.24004768743899832, 0.13663319780577704, -0.044414997484880626, 0.0883769489795968, -0.012212095517563434, -0.1618444477544003, -0.3727989638435472, -0.10866029537522916, -0.16485431297807043, 0.07052067668446023, -0.04900406521325571, -0.09751473629418712, 0.3398232790545474, 0.1666544800979498, 0.165103381240414, -0.06429942374564131, 0.2946519111811193, 0.1690302214671656, 0.0225762126261618, 0.1052989230164778, 0.3072815037154852, 0.18743266464815928, 0.13606743188094847, -0.28015439489798755, 0.025826794580201207, 0.09399212836095891] |
1,803.03319 | Efficient Loss-Based Decoding on Graphs For Extreme Classification | In extreme classification problems, learning algorithms are required to map
instances to labels from an extremely large label set. We build on a recent
extreme classification framework with logarithmic time and space, and on a
general approach for error correcting output coding (ECOC) with loss-based
decoding, and introduce a flexible and efficient approach accompanied by
theoretical bounds. Our framework employs output codes induced by graphs, for
which we show how to perform efficient loss-based decoding to potentially
improve accuracy. In addition, our framework offers a tradeoff between
accuracy, model size and prediction time. We show how to find the sweet spot of
this tradeoff using only the training data. Our experimental study demonstrates
the validity of our assumptions and claims, and shows that our method is
competitive with state-of-the-art algorithms.
| cs.LG stat.ML | in extreme classification problems learning algorithms are required to map instances to labels from an extremely large label set we build on a recent extreme classification framework with logarithmic time and space and on a general approach for error correcting output coding ecoc with lossbased decoding and introduce a flexible and efficient approach accompanied by theoretical bounds our framework employs output codes induced by graphs for which we show how to perform efficient lossbased decoding to potentially improve accuracy in addition our framework offers a tradeoff between accuracy model size and prediction time we show how to find the sweet spot of this tradeoff using only the training data our experimental study demonstrates the validity of our assumptions and claims and shows that our method is competitive with stateoftheart algorithms | [['in', 'extreme', 'classification', 'problems', 'learning', 'algorithms', 'are', 'required', 'to', 'map', 'instances', 'to', 'labels', 'from', 'an', 'extremely', 'large', 'label', 'set', 'we', 'build', 'on', 'a', 'recent', 'extreme', 'classification', 'framework', 'with', 'logarithmic', 'time', 'and', 'space', 'and', 'on', 'a', 'general', 'approach', 'for', 'error', 'correcting', 'output', 'coding', 'ecoc', 'with', 'lossbased', 'decoding', 'and', 'introduce', 'a', 'flexible', 'and', 'efficient', 'approach', 'accompanied', 'by', 'theoretical', 'bounds', 'our', 'framework', 'employs', 'output', 'codes', 'induced', 'by', 'graphs', 'for', 'which', 'we', 'show', 'how', 'to', 'perform', 'efficient', 'lossbased', 'decoding', 'to', 'potentially', 'improve', 'accuracy', 'in', 'addition', 'our', 'framework', 'offers', 'a', 'tradeoff', 'between', 'accuracy', 'model', 'size', 'and', 'prediction', 'time', 'we', 'show', 'how', 'to', 'find', 'the', 'sweet', 'spot', 'of', 'this', 'tradeoff', 'using', 'only', 'the', 'training', 'data', 'our', 'experimental', 'study', 'demonstrates', 'the', 'validity', 'of', 'our', 'assumptions', 'and', 'claims', 'and', 'shows', 'that', 'our', 'method', 'is', 'competitive', 'with', 'stateoftheart', 'algorithms']] | [-0.04255905839202639, -0.022978166274865194, -0.08706544763766802, 0.07932196972318567, -0.06743411323449645, -0.18239549934290922, 0.12820130305011004, 0.4437496568577794, -0.23898347796728978, -0.38754382914362046, 0.07692401064649368, -0.23467296903164914, -0.19864807675520962, 0.24318496336479886, -0.15482602969814951, 0.10725388431635041, 0.1434517015165721, 0.006757600247286833, -0.08543766298904441, -0.3102333595528482, 0.27196991820819677, 0.10864549273481736, 0.33316652539830943, 0.05662181290009847, 0.12401554949778634, -0.021784585653446042, -0.03909106658270153, 0.0118905981212335, -0.1075812767244665, 0.1899339749621084, 0.27929754921127686, 0.19780136034465753, 0.2963070316884953, -0.3660656303740465, -0.2277193890947204, 0.08443844190333039, 0.09853197656786786, 0.14143093102342952, -0.06495937815903184, -0.28088622960942583, 0.1085949899843679, -0.1573653189250483, -0.005021900380961597, -0.16068329193557684, -0.027625523016859707, -0.009182346216402949, -0.3603492041548284, 0.05316054480723464, 0.06513874029534726, 0.017871192291092415, -0.01567604080415689, -0.08792339740589691, 0.07531029583456425, 0.11596051015389654, 0.029350203487914627, 0.06848540392955049, 0.07795901673201185, -0.10005337244096714, -0.17453885028282037, 0.34565986482283245, -0.07866530997965199, -0.20405037860171152, 0.18409395438547319, -0.0636756945687991, -0.13573062520904036, 0.10768572880098452, 0.2520505055212058, 0.12528336085737324, -0.09303673269728628, 0.030445981921646027, -0.013512419816106559, 0.208075936890852, 0.014956787160526102, 0.02497053297388797, 0.1274559208478492, 0.2528894081210288, 0.06522889655226698, 0.17816160472217374, -0.10227798819676256, -0.06959270616957489, -0.25466625481494704, -0.08907273322200546, -0.16105513715435965, -0.04769168658038744, -0.13940886725378313, -0.13079203753284394, 0.38797572607246156, 0.25225055748238584, 0.2121251859424564, 0.1678174676704937, 0.3568520814180374, 0.033314631736161227, 0.05595175699832348, 0.16422810825662545, 0.20289728264324366, 0.053561628928694587, 0.02420823241655643, -0.20830014049827766, 0.07735632491172649, 0.04928631894111347] |
1,803.0332 | A New Efficient Stochastic Energy Management Technique for
Interconnected AC Microgrids | Cooperating interconnected microgrids with the Distribution System Operation
(DSO) can lead to an improvement in terms of operation and reliability. This
paper investigates the optimal operation and scheduling of interconnected
microgrids highly penetrated by renewable energy resources (DERs). Moreover, an
efficient stochastic framework based on the Unscented Transform (UT) method is
proposed to model uncertainties associated with the hourly market price, hourly
load demand and DERs output power. Prior to the energy management, a newly
developed linearization technique is employed to linearize nodal equations
extracted from the AC power flow. The proposed stochastic problem is formulated
as a single-objective optimization problem minimizing the interconnected AC MGs
cost function. In order to validate the proposed technique, a modified IEEE 69
bus network is studied as the test case.
| math.OC | cooperating interconnected microgrids with the distribution system operation dso can lead to an improvement in terms of operation and reliability this paper investigates the optimal operation and scheduling of interconnected microgrids highly penetrated by renewable energy resources ders moreover an efficient stochastic framework based on the unscented transform ut method is proposed to model uncertainties associated with the hourly market price hourly load demand and ders output power prior to the energy management a newly developed linearization technique is employed to linearize nodal equations extracted from the ac power flow the proposed stochastic problem is formulated as a singleobjective optimization problem minimizing the interconnected ac mgs cost function in order to validate the proposed technique a modified ieee 69 bus network is studied as the test case | [['cooperating', 'interconnected', 'microgrids', 'with', 'the', 'distribution', 'system', 'operation', 'dso', 'can', 'lead', 'to', 'an', 'improvement', 'in', 'terms', 'of', 'operation', 'and', 'reliability', 'this', 'paper', 'investigates', 'the', 'optimal', 'operation', 'and', 'scheduling', 'of', 'interconnected', 'microgrids', 'highly', 'penetrated', 'by', 'renewable', 'energy', 'resources', 'ders', 'moreover', 'an', 'efficient', 'stochastic', 'framework', 'based', 'on', 'the', 'unscented', 'transform', 'ut', 'method', 'is', 'proposed', 'to', 'model', 'uncertainties', 'associated', 'with', 'the', 'hourly', 'market', 'price', 'hourly', 'load', 'demand', 'and', 'ders', 'output', 'power', 'prior', 'to', 'the', 'energy', 'management', 'a', 'newly', 'developed', 'linearization', 'technique', 'is', 'employed', 'to', 'linearize', 'nodal', 'equations', 'extracted', 'from', 'the', 'ac', 'power', 'flow', 'the', 'proposed', 'stochastic', 'problem', 'is', 'formulated', 'as', 'a', 'singleobjective', 'optimization', 'problem', 'minimizing', 'the', 'interconnected', 'ac', 'mgs', 'cost', 'function', 'in', 'order', 'to', 'validate', 'the', 'proposed', 'technique', 'a', 'modified', 'ieee', '69', 'bus', 'network', 'is', 'studied', 'as', 'the', 'test', 'case']] | [-0.17168615407889753, -0.015563042414343484, -0.023775052682562605, 0.018092271445619718, -0.09410184054767463, -0.15309828064426428, 0.06929212626102783, 0.3661431300932336, -0.31350442959274366, -0.34525670173878625, 0.11633413417565483, -0.25219530697295983, -0.11717409445852862, 0.20273151357042216, -0.14967796277606815, 0.14583086162002568, 0.04053627629122719, -0.03003403153563813, 0.02365149478987226, -0.24486255607985724, 0.22236605946022253, 0.13939506501898052, 0.3987355940043926, -0.004017300416136117, 0.154522622524812, -0.01065414852286711, -0.009714194357131176, 0.02901812222342586, -0.05827520550851981, 0.1516426610485394, 0.30896930875051326, 0.12496454504091205, 0.3569211663282293, -0.4493263162027194, -0.20893328609018344, 0.10274319683557273, 0.0879932349675159, -0.024306287512359186, 0.01589428740608557, -0.2320541841230964, 0.07455810711363434, -0.27206032110128814, -0.08149977740795007, -0.06247380684041895, -0.07923491407684453, 0.08297305991946477, -0.34250246802359585, 0.036549108827075974, 0.0006636844958934024, 0.029943897183544524, -0.09978666289628843, -0.0855989082355243, -0.051778746858148886, 0.07970831088912417, 0.032220520787711045, -0.031259183221914635, 0.1861058026414702, -0.05029859013422796, -0.15118811380734123, 0.3786115733921293, -0.009852970967721928, -0.19164108778313388, 0.05540281404579777, 0.0015207746095486044, -0.0939055961817063, 0.11584375292708085, 0.26701537023965766, 0.08619939760253655, -0.25680262547749, 0.02597109998592843, 0.009885777521321155, 0.19174290777690065, 0.04281440614282674, -0.019681571099144504, 0.1317929012616583, 0.2325623992273188, 0.1921240319021222, 0.16965589639327422, -0.07735219842036563, -0.15296135902841113, -0.22197623256828605, -0.0814574683913741, -0.19027046286537658, 0.01721213857907303, -0.07160006268795555, -0.12213266890965344, 0.421147148638201, 0.16396540324533665, 0.09013891439356907, 0.046597433276474476, 0.39706605185908594, 0.2002018774863274, 0.04266043879663733, 0.15975996995286093, 0.1556662067213631, 0.07131763012698433, 0.22746631859867708, -0.27155486418128627, 0.0670999702594177, 0.06923957127989747] |
1,803.03321 | Quantum Coherence Measures for Quantum Switch | We suppose that a structure working as a quantum switch will be a significant
element of future networks realizing transmissions of quantum information. In
this chapter we analyze a process of switch's operating -- especially in
systems with a noise presence. The noise is caused by a phenomenon of quantum
decoherence, i.e. distorting of quantum states because of an environmental
influence, and also by some imperfections of quantum gates' implementation. In
the face of mentioned problems, the possibility of tracing the switch's
behavior during its operating seems very important. To realize that we propose
to utilize a Coherence measure which, as we present in this chapter, is
sufficient to describe operating of the quantum switch and to verify
correctness of this process. It should be also stressed that the value of
Coherence measure may be estimated by a quantum circuit, designed especially
for this purpose.
| quant-ph cs.NI | we suppose that a structure working as a quantum switch will be a significant element of future networks realizing transmissions of quantum information in this chapter we analyze a process of switchs operating especially in systems with a noise presence the noise is caused by a phenomenon of quantum decoherence ie distorting of quantum states because of an environmental influence and also by some imperfections of quantum gates implementation in the face of mentioned problems the possibility of tracing the switchs behavior during its operating seems very important to realize that we propose to utilize a coherence measure which as we present in this chapter is sufficient to describe operating of the quantum switch and to verify correctness of this process it should be also stressed that the value of coherence measure may be estimated by a quantum circuit designed especially for this purpose | [['we', 'suppose', 'that', 'a', 'structure', 'working', 'as', 'a', 'quantum', 'switch', 'will', 'be', 'a', 'significant', 'element', 'of', 'future', 'networks', 'realizing', 'transmissions', 'of', 'quantum', 'information', 'in', 'this', 'chapter', 'we', 'analyze', 'a', 'process', 'of', 'switchs', 'operating', 'especially', 'in', 'systems', 'with', 'a', 'noise', 'presence', 'the', 'noise', 'is', 'caused', 'by', 'a', 'phenomenon', 'of', 'quantum', 'decoherence', 'ie', 'distorting', 'of', 'quantum', 'states', 'because', 'of', 'an', 'environmental', 'influence', 'and', 'also', 'by', 'some', 'imperfections', 'of', 'quantum', 'gates', 'implementation', 'in', 'the', 'face', 'of', 'mentioned', 'problems', 'the', 'possibility', 'of', 'tracing', 'the', 'switchs', 'behavior', 'during', 'its', 'operating', 'seems', 'very', 'important', 'to', 'realize', 'that', 'we', 'propose', 'to', 'utilize', 'a', 'coherence', 'measure', 'which', 'as', 'we', 'present', 'in', 'this', 'chapter', 'is', 'sufficient', 'to', 'describe', 'operating', 'of', 'the', 'quantum', 'switch', 'and', 'to', 'verify', 'correctness', 'of', 'this', 'process', 'it', 'should', 'be', 'also', 'stressed', 'that', 'the', 'value', 'of', 'coherence', 'measure', 'may', 'be', 'estimated', 'by', 'a', 'quantum', 'circuit', 'designed', 'especially', 'for', 'this', 'purpose']] | [-0.15495770267443731, 0.14952133994756878, -0.09223589801695198, 0.0440371362323933, -0.013530676120555855, -0.16351567482666318, 0.06077640866796072, 0.3730359371078925, -0.2689396705957026, -0.2721243919254953, 0.13596717826213636, -0.21491718627092066, -0.18456908571857233, 0.20513042156946742, -0.09912555454179205, 0.050430359645057855, 0.0583701494615525, 0.02439289616530813, -0.048908451700602505, -0.22717157801606744, 0.30721760021535577, 0.1000961374377059, 0.2704302091620371, 0.07283811889808728, 0.09876144717175823, -0.02837394207583404, 0.024071503710325085, 0.018054278842302866, -0.07439668841243474, 0.11333646410356676, 0.2970629974540013, 0.12338017963985395, 0.2843241676018806, -0.4264243170101609, -0.2199432033036525, 0.1138156981105567, 0.11212979969180499, 0.14494842740896274, -0.06517991260302046, -0.28796170132571003, 0.10138581670657408, -0.16809041149584422, -0.1242007243987852, -0.07538290050322555, 0.008876897210332876, -0.024435872459434904, -0.23195549168425109, 0.0025774404020921793, 0.09724239965993951, 0.04656608810182661, 0.020293051570155915, -0.02749396978955095, 0.06841044536688262, 0.14046849953228957, -0.030252492679816594, -0.005432796002423856, 0.15495230539818294, -0.14165566660166304, -0.14730737898369423, 0.40016965129567933, -0.04061966038069739, -0.181550209139156, 0.15586827390102875, -0.11136686436980704, -0.11412327989657772, 0.06130526302553739, 0.18536955705510788, 0.06461694005217093, -0.17844985359544, 0.04557453142721594, 0.0374984524355063, 0.1795830676306246, 0.0410602297423692, 0.11083088617629579, 0.21304846077691764, 0.1752200505256446, 0.07172794902039135, 0.19589345585053605, -0.09176720659727128, -0.1145621183321863, -0.31512283875296515, -0.2074541920899517, -0.19482914357569017, 0.11836912536495624, -0.01443643428158086, -0.1484950458139388, 0.3965108138638445, 0.22397255660568285, 0.19320813807361345, -0.013821039398761868, 0.2986307114867183, 0.12466699311779747, 0.06956803625507746, 0.037607637686758406, 0.22641371809913835, 0.12679889245029902, 0.08471224158872953, -0.24058305468901786, 0.10094733619674419, -0.047342726983414546] |
1,803.03322 | A Characterization of the DNA Data Storage Channel | Owing to its longevity and enormous information density, DNA, the molecule
encoding biological information, has emerged as a promising archival storage
medium. However, due to technological constraints, data can only be written
onto many short DNA molecules that are stored in an unordered way, and can only
be read by sampling from this DNA pool. Moreover, imperfections in writing
(synthesis), reading (sequencing), storage, and handling of the DNA, in
particular amplification via PCR, lead to a loss of DNA molecules and induce
errors within the molecules. In order to design DNA storage systems, a
qualitative and quantitative understanding of the errors and the loss of
molecules is crucial. In this paper, we characterize those error probabilities
by analyzing data from our own experiments as well as from experiments of two
different groups. We find that errors within molecules are mainly due to
synthesis and sequencing, while imperfections in handling and storage lead to a
significant loss of sequences. The aim of our study is to help guide the design
of future DNA data storage systems by providing a quantitative and qualitative
understanding of the DNA data storage channel.
| cs.ET q-bio.BM q-bio.QM | owing to its longevity and enormous information density dna the molecule encoding biological information has emerged as a promising archival storage medium however due to technological constraints data can only be written onto many short dna molecules that are stored in an unordered way and can only be read by sampling from this dna pool moreover imperfections in writing synthesis reading sequencing storage and handling of the dna in particular amplification via pcr lead to a loss of dna molecules and induce errors within the molecules in order to design dna storage systems a qualitative and quantitative understanding of the errors and the loss of molecules is crucial in this paper we characterize those error probabilities by analyzing data from our own experiments as well as from experiments of two different groups we find that errors within molecules are mainly due to synthesis and sequencing while imperfections in handling and storage lead to a significant loss of sequences the aim of our study is to help guide the design of future dna data storage systems by providing a quantitative and qualitative understanding of the dna data storage channel | [['owing', 'to', 'its', 'longevity', 'and', 'enormous', 'information', 'density', 'dna', 'the', 'molecule', 'encoding', 'biological', 'information', 'has', 'emerged', 'as', 'a', 'promising', 'archival', 'storage', 'medium', 'however', 'due', 'to', 'technological', 'constraints', 'data', 'can', 'only', 'be', 'written', 'onto', 'many', 'short', 'dna', 'molecules', 'that', 'are', 'stored', 'in', 'an', 'unordered', 'way', 'and', 'can', 'only', 'be', 'read', 'by', 'sampling', 'from', 'this', 'dna', 'pool', 'moreover', 'imperfections', 'in', 'writing', 'synthesis', 'reading', 'sequencing', 'storage', 'and', 'handling', 'of', 'the', 'dna', 'in', 'particular', 'amplification', 'via', 'pcr', 'lead', 'to', 'a', 'loss', 'of', 'dna', 'molecules', 'and', 'induce', 'errors', 'within', 'the', 'molecules', 'in', 'order', 'to', 'design', 'dna', 'storage', 'systems', 'a', 'qualitative', 'and', 'quantitative', 'understanding', 'of', 'the', 'errors', 'and', 'the', 'loss', 'of', 'molecules', 'is', 'crucial', 'in', 'this', 'paper', 'we', 'characterize', 'those', 'error', 'probabilities', 'by', 'analyzing', 'data', 'from', 'our', 'own', 'experiments', 'as', 'well', 'as', 'from', 'experiments', 'of', 'two', 'different', 'groups', 'we', 'find', 'that', 'errors', 'within', 'molecules', 'are', 'mainly', 'due', 'to', 'synthesis', 'and', 'sequencing', 'while', 'imperfections', 'in', 'handling', 'and', 'storage', 'lead', 'to', 'a', 'significant', 'loss', 'of', 'sequences', 'the', 'aim', 'of', 'our', 'study', 'is', 'to', 'help', 'guide', 'the', 'design', 'of', 'future', 'dna', 'data', 'storage', 'systems', 'by', 'providing', 'a', 'quantitative', 'and', 'qualitative', 'understanding', 'of', 'the', 'dna', 'data', 'storage', 'channel']] | [-0.10770502351125345, 0.08704440723282615, -0.03678395600612969, 0.05047097584781326, -0.035464205345673926, -0.13601431132423036, 0.09876373049647032, 0.39342071674764156, -0.3133737061598754, -0.32534084253959317, 0.11001703991651278, -0.277276024663266, -0.12253925501012262, 0.20922190105998295, -0.1179655528344967, 0.07163996310957876, 0.12798865687379496, -0.004810469777383216, 0.004622953247893205, -0.21898050920324438, 0.22100021207006648, 0.12734043169172204, 0.30207403338677746, 0.06622074567960536, 0.05059539416477956, -0.01176436876065712, -0.037161405260199086, -0.0236225198567944, -0.0942436948871739, 0.21544434870048326, 0.3334859900493571, 0.15873068057129436, 0.26974968405371097, -0.5140485444869054, -0.22971326468928538, 0.09404995492808124, 0.15806697616341248, 0.20216424136913005, -0.10594071409449246, -0.24935656995512545, 0.07891807896227507, -0.14912558377205215, -0.03572574920427213, -0.12481048285832351, 0.01208004056528072, 0.0977348025564347, -0.2376538032564914, 0.034025371924260674, 0.03534519678895719, 0.07777241349976201, -0.044071494812824505, -0.10868040698412013, -0.005037701137591787, 0.18255720868399564, 0.05796349918137879, 0.03116658164753004, 0.1827442666139216, -0.1341023783675058, -0.10204911259240768, 0.41740493963849035, -0.031198924090936185, -0.17517522735114982, 0.17208134483433318, -0.0925666004632342, -0.1204145461385277, 0.15153119637769588, 0.1864873282016909, 0.06615716723497322, -0.20569636219458537, 0.023843984108138334, 0.0496003367867509, 0.22619770499481323, 0.11800916622482002, 0.11429934516212249, 0.23916252220961007, 0.20305713524105662, 0.010849757461518821, 0.17098820968060457, -0.0952433917641719, -0.0996532139313863, -0.2164216724650419, -0.17798218491705173, -0.17365585826089644, 0.0435542164325059, -0.04777759523804367, -0.13088975336150008, 0.3426266247307525, 0.14031526355315593, 0.20410184363309453, 0.0100554044462463, 0.31369507763574417, -0.01216111965588928, 0.1252355588348632, -0.02264297502907984, 0.1367720026805244, 0.08647772237950545, 0.09431106669139712, -0.23454559901159533, 0.13729484585371424, -0.06332375254591015] |
1,803.03323 | Magnetized Plasma Target for Plasma-Jet-Driven Magneto-Inertial Fusion | We identify the desired characteristics and parameters of a beta>1 magnetized
plasma, possibly with highly tangled, open field lines, that could be a
suitable target to be compressed to fusion conditions by a spherically
imploding plasma liner [S. C. Hsu et al., IEEE Trans. Plasma Sci. 40, 1287
(2012)] formed by merging hypersonic plasma jets. This concept is known as
plasma-jet-driven magneto-inertial fusion (PJMIF). We set requirements on the
target and liner such that (a) compressional heating dominates over thermal
transport in the target, and (b) magnetic amplification due to compression
dominates over dissipation over the entire implosion. We also evaluate the
requirements to avoid drift-instability-induced anomalous transport and
current-driven anomalous resistivity in the target. Next, we describe possible
approaches to create such a magnetized, beta>1 plasma target. Finally, assuming
such a target can be created, we evaluate the feasibility of a proof-of-concept
experiment using presently achievable plasma jets to demonstrate target
compressional heating at a plasma-liner kinetic energy of <~ 100 kJ (a few
hundred times below that needed in a PJMIF reactor).
| physics.plasm-ph | we identify the desired characteristics and parameters of a beta1 magnetized plasma possibly with highly tangled open field lines that could be a suitable target to be compressed to fusion conditions by a spherically imploding plasma liner s c hsu et al ieee trans plasma sci 40 1287 2012 formed by merging hypersonic plasma jets this concept is known as plasmajetdriven magnetoinertial fusion pjmif we set requirements on the target and liner such that a compressional heating dominates over thermal transport in the target and b magnetic amplification due to compression dominates over dissipation over the entire implosion we also evaluate the requirements to avoid driftinstabilityinduced anomalous transport and currentdriven anomalous resistivity in the target next we describe possible approaches to create such a magnetized beta1 plasma target finally assuming such a target can be created we evaluate the feasibility of a proofofconcept experiment using presently achievable plasma jets to demonstrate target compressional heating at a plasmaliner kinetic energy of 100 kj a few hundred times below that needed in a pjmif reactor | [['we', 'identify', 'the', 'desired', 'characteristics', 'and', 'parameters', 'of', 'a', 'beta1', 'magnetized', 'plasma', 'possibly', 'with', 'highly', 'tangled', 'open', 'field', 'lines', 'that', 'could', 'be', 'a', 'suitable', 'target', 'to', 'be', 'compressed', 'to', 'fusion', 'conditions', 'by', 'a', 'spherically', 'imploding', 'plasma', 'liner', 's', 'c', 'hsu', 'et', 'al', 'ieee', 'trans', 'plasma', 'sci', '40', '1287', '2012', 'formed', 'by', 'merging', 'hypersonic', 'plasma', 'jets', 'this', 'concept', 'is', 'known', 'as', 'plasmajetdriven', 'magnetoinertial', 'fusion', 'pjmif', 'we', 'set', 'requirements', 'on', 'the', 'target', 'and', 'liner', 'such', 'that', 'a', 'compressional', 'heating', 'dominates', 'over', 'thermal', 'transport', 'in', 'the', 'target', 'and', 'b', 'magnetic', 'amplification', 'due', 'to', 'compression', 'dominates', 'over', 'dissipation', 'over', 'the', 'entire', 'implosion', 'we', 'also', 'evaluate', 'the', 'requirements', 'to', 'avoid', 'driftinstabilityinduced', 'anomalous', 'transport', 'and', 'currentdriven', 'anomalous', 'resistivity', 'in', 'the', 'target', 'next', 'we', 'describe', 'possible', 'approaches', 'to', 'create', 'such', 'a', 'magnetized', 'beta1', 'plasma', 'target', 'finally', 'assuming', 'such', 'a', 'target', 'can', 'be', 'created', 'we', 'evaluate', 'the', 'feasibility', 'of', 'a', 'proofofconcept', 'experiment', 'using', 'presently', 'achievable', 'plasma', 'jets', 'to', 'demonstrate', 'target', 'compressional', 'heating', 'at', 'a', 'plasmaliner', 'kinetic', 'energy', 'of', '100', 'kj', 'a', 'few', 'hundred', 'times', 'below', 'that', 'needed', 'in', 'a', 'pjmif', 'reactor']] | [-0.09634818436240243, 0.18661017144610834, -0.012964908339965501, 0.046436637957928954, -0.06050263411550625, -0.1102030245534128, 0.034848455797161976, 0.3896637344351637, -0.24163048712356963, -0.30711909100053864, 0.05951143439303626, -0.21451110342158036, -0.035544196318028964, 0.21742973511232533, -0.03342908141012603, 0.04390681184806496, 0.03703505684123293, -0.01553800227174982, -0.026732048462621585, -0.19816415805413187, 0.25853106399660397, 0.11820748425769614, 0.27272408718668056, 0.07850798962049578, 0.0810026417510878, -0.07925242776562097, -0.016024931248179393, 0.030127098089443485, -0.12639750513650322, 0.01501976662146592, 0.23696111391396507, 0.09498166156066745, 0.24516419232574466, -0.43891133845658503, -0.2516129474122927, 0.03278569713008879, 0.12690241420532614, 0.06777470234961233, -0.05673255241266316, -0.23740893190628604, 0.10127260207677838, -0.23340129872446347, -0.12588673205065884, -0.010674514767594026, 0.058359543093730704, 0.045421018016018104, -0.34489322947174833, 0.06123886720875785, 0.05412071659529244, 0.008524646688448755, -0.06337543023608581, -0.06986580607045595, -0.018555644171159954, 0.02645286863223154, 0.010141279018750926, 0.08513767486955556, 0.2524059696711208, -0.13674223037463495, -0.08340787234013541, 0.36017239250634847, -0.06784688052687282, -0.13459184926482495, 0.2424598970717331, -0.14849054398000164, -0.0809027597523289, 0.1938870223810929, 0.19135335159123118, 0.11369880468023626, -0.14126570126632698, 0.02330459501085073, -0.05490295477865035, 0.12534721943002455, 0.1390379860831087, -0.025464031758189898, 0.2109219876556434, 0.1967418166694411, 0.014889315723806446, 0.1434674080545001, -0.15771532521485873, -0.0058954237240001735, -0.30485415933054616, -0.1200542584530007, -0.11007941005702473, 0.07532591244331098, -0.008945795948064357, -0.1332432951244433, 0.3680160056679831, 0.16378225774193803, 0.168920225981209, -0.08344378795444812, 0.2934876709375857, 0.04949691480616916, 0.025320947336030263, 0.1741216516105883, 0.25513792313548206, 0.16085755328065035, 0.13240142708864847, -0.22998320149824197, 0.017919550814573266, 0.015769916608363216] |
1,803.03324 | Learning Deep Generative Models of Graphs | Graphs are fundamental data structures which concisely capture the relational
structure in many important real-world domains, such as knowledge graphs,
physical and social interactions, language, and chemistry. Here we introduce a
powerful new approach for learning generative models over graphs, which can
capture both their structure and attributes. Our approach uses graph neural
networks to express probabilistic dependencies among a graph's nodes and edges,
and can, in principle, learn distributions over any arbitrary graph. In a
series of experiments our results show that once trained, our models can
generate good quality samples of both synthetic graphs as well as real
molecular graphs, both unconditionally and conditioned on data. Compared to
baselines that do not use graph-structured representations, our models often
perform far better. We also explore key challenges of learning generative
models of graphs, such as how to handle symmetries and ordering of elements
during the graph generation process, and offer possible solutions. Our work is
the first and most general approach for learning generative models over
arbitrary graphs, and opens new directions for moving away from restrictions of
vector- and sequence-like knowledge representations, toward more expressive and
flexible relational data structures.
| cs.LG stat.ML | graphs are fundamental data structures which concisely capture the relational structure in many important realworld domains such as knowledge graphs physical and social interactions language and chemistry here we introduce a powerful new approach for learning generative models over graphs which can capture both their structure and attributes our approach uses graph neural networks to express probabilistic dependencies among a graphs nodes and edges and can in principle learn distributions over any arbitrary graph in a series of experiments our results show that once trained our models can generate good quality samples of both synthetic graphs as well as real molecular graphs both unconditionally and conditioned on data compared to baselines that do not use graphstructured representations our models often perform far better we also explore key challenges of learning generative models of graphs such as how to handle symmetries and ordering of elements during the graph generation process and offer possible solutions our work is the first and most general approach for learning generative models over arbitrary graphs and opens new directions for moving away from restrictions of vector and sequencelike knowledge representations toward more expressive and flexible relational data structures | [['graphs', 'are', 'fundamental', 'data', 'structures', 'which', 'concisely', 'capture', 'the', 'relational', 'structure', 'in', 'many', 'important', 'realworld', 'domains', 'such', 'as', 'knowledge', 'graphs', 'physical', 'and', 'social', 'interactions', 'language', 'and', 'chemistry', 'here', 'we', 'introduce', 'a', 'powerful', 'new', 'approach', 'for', 'learning', 'generative', 'models', 'over', 'graphs', 'which', 'can', 'capture', 'both', 'their', 'structure', 'and', 'attributes', 'our', 'approach', 'uses', 'graph', 'neural', 'networks', 'to', 'express', 'probabilistic', 'dependencies', 'among', 'a', 'graphs', 'nodes', 'and', 'edges', 'and', 'can', 'in', 'principle', 'learn', 'distributions', 'over', 'any', 'arbitrary', 'graph', 'in', 'a', 'series', 'of', 'experiments', 'our', 'results', 'show', 'that', 'once', 'trained', 'our', 'models', 'can', 'generate', 'good', 'quality', 'samples', 'of', 'both', 'synthetic', 'graphs', 'as', 'well', 'as', 'real', 'molecular', 'graphs', 'both', 'unconditionally', 'and', 'conditioned', 'on', 'data', 'compared', 'to', 'baselines', 'that', 'do', 'not', 'use', 'graphstructured', 'representations', 'our', 'models', 'often', 'perform', 'far', 'better', 'we', 'also', 'explore', 'key', 'challenges', 'of', 'learning', 'generative', 'models', 'of', 'graphs', 'such', 'as', 'how', 'to', 'handle', 'symmetries', 'and', 'ordering', 'of', 'elements', 'during', 'the', 'graph', 'generation', 'process', 'and', 'offer', 'possible', 'solutions', 'our', 'work', 'is', 'the', 'first', 'and', 'most', 'general', 'approach', 'for', 'learning', 'generative', 'models', 'over', 'arbitrary', 'graphs', 'and', 'opens', 'new', 'directions', 'for', 'moving', 'away', 'from', 'restrictions', 'of', 'vector', 'and', 'sequencelike', 'knowledge', 'representations', 'toward', 'more', 'expressive', 'and', 'flexible', 'relational', 'data', 'structures']] | [-0.025438601730747332, 0.045025738942344226, -0.06291527781758642, 0.11164642950611231, -0.168885305046021, -0.14432178491468087, 0.02558523636108328, 0.4674880355011418, -0.3081392863264346, -0.36583058925647854, 0.05391835995415879, -0.27416475913341093, -0.20808546965349348, 0.19633238161463018, -0.0729895259146408, 0.07955390148666926, 0.13597699941662555, 0.04092203073340093, -0.020658778100145287, -0.24050673945908707, 0.3325675878556767, 0.014103102853706993, 0.29295596396014173, 0.041955486822541785, 0.11738648926241918, -0.017629071012022296, -0.009235525611941629, 0.024217184491611587, -0.07340354833811953, 0.18707392414475923, 0.3386503971683013, 0.21146677319126214, 0.24585323362167516, -0.4554619222479575, -0.27448733408108883, 0.13137474642695948, 0.138016394783221, 0.12270380139682462, -0.003835718982858481, -0.31333163825804805, 0.0781723581356879, -0.14772946050961097, 0.003178191628472889, -0.2076316878421437, -0.002514213352849346, 0.03923279228309384, -0.28580545339275015, -0.020005852674135294, 0.1148960601876085, 0.064852992574933, -0.02913696259742905, -0.11508141106259107, -0.010350881115148204, 0.1790963875700315, -0.013632582209386292, 0.006062525334275518, 0.08922665938704533, -0.16362512093226314, -0.22789740100678504, 0.3991440539711511, -0.03662353882161384, -0.20596764418077093, 0.21103225214558005, -0.05977150862207588, -0.20573922019958965, 0.04998353680507987, 0.25431453581675106, 0.14896951527797972, -0.13793069368572078, 0.05376911863650522, -0.052014318458170325, 0.1554925486717266, 0.04495162652508009, 0.01832356316691779, 0.1819309042724025, 0.20689090420321332, 0.0454638830287972, 0.11022104094833798, -0.0331786422349064, -0.09969746744222403, -0.22993638819932002, -0.09755917399858383, -0.18733602790868992, -0.011783434394963392, -0.16757791687725893, -0.1694349603070643, 0.4184322397667105, 0.22116497562130358, 0.22039510259473044, 0.13435254658387086, 0.30502271230932304, -0.014154340785986583, 0.11220390037926041, 0.13316422435625686, 0.1059935009926777, 0.1034302050320929, 0.10032489194464017, -0.08037495175839758, 0.129659627931173, -0.011123455735411085] |
1,803.03325 | Deformations of log canonical singularities | We prove that the cohomology sheaves of the relative dualizing complex of a
flat family of varieties with semi-log-canonical or Du Bois singularities are
flat and commute with base change. This is a local version of our earlier
similar result where the family was assumed to be projective. We also derive
several consequences for deformations of semi-log-canonical and of Du Bois
singularities.
| math.AG | we prove that the cohomology sheaves of the relative dualizing complex of a flat family of varieties with semilogcanonical or du bois singularities are flat and commute with base change this is a local version of our earlier similar result where the family was assumed to be projective we also derive several consequences for deformations of semilogcanonical and of du bois singularities | [['we', 'prove', 'that', 'the', 'cohomology', 'sheaves', 'of', 'the', 'relative', 'dualizing', 'complex', 'of', 'a', 'flat', 'family', 'of', 'varieties', 'with', 'semilogcanonical', 'or', 'du', 'bois', 'singularities', 'are', 'flat', 'and', 'commute', 'with', 'base', 'change', 'this', 'is', 'a', 'local', 'version', 'of', 'our', 'earlier', 'similar', 'result', 'where', 'the', 'family', 'was', 'assumed', 'to', 'be', 'projective', 'we', 'also', 'derive', 'several', 'consequences', 'for', 'deformations', 'of', 'semilogcanonical', 'and', 'of', 'du', 'bois', 'singularities']] | [-0.20508174541135948, -0.024222342672968102, -0.14236262763640092, 0.0921025246441845, -0.09889826021577802, -0.17653066426094982, -0.06268435757186624, 0.3172412107908918, -0.30139210441284964, -0.17994211534143337, 0.09347527378779505, -0.25139636145303806, -0.19599632207199089, 0.15879176899550423, -0.2324825607600712, -0.024871189898300554, 0.02628506904452919, 0.04796536212726947, -0.11088074478996737, -0.32579256182596567, 0.4864103601824853, 0.0020777048663266242, 0.23183923252227326, 0.053195629907291264, 0.0872322253342117, 0.01438528660594696, -0.0008241039129995531, 0.005330496873225897, -0.16710063153110358, 0.12334115507321493, 0.29253392167870074, 0.028625562603044653, 0.14635051050854306, -0.3884587563394058, -0.16263341413991106, 0.22480379274084925, 0.0883697105136009, 0.08225873886277119, 0.005145606599868306, -0.26522731576715747, 0.12894648529829517, -0.19118007506814697, -0.2267569343469316, -0.0473227106004713, 0.011480555268785646, 0.1049411914972288, -0.2161744459562244, 0.016384260679666522, 0.10272358551364666, 0.1425674751461033, -0.03992630617933408, -0.08097882040085332, -0.14069893777055004, 0.009168269672250796, -0.01068608587863104, 0.028515231968354312, 0.0779329989285719, -0.06688601765105681, -0.07400945420827597, 0.3275938558959282, -0.07675973938838128, -0.21123441635075235, 0.17581116321737006, -0.19815354303066288, -0.14803688088431954, 0.1272968377827877, 0.037503990825385816, 0.22467974657493253, 0.03219063141413273, 0.164559967979233, -0.07909714367481009, 0.027364681970568433, 0.176656897953381, 0.03845205205312419, 0.11223807938457016, 0.07052616862910649, 0.06437639659270644, 0.060129325489528596, -0.04416027286600682, -0.018845146469351266, -0.37836751245683237, -0.2699313648946343, -0.0647170974745325, 0.18988581780990166, -0.08374849851046043, -0.1867960969947519, 0.37063432581001715, 0.035883542615920305, 0.251179855617304, 0.11747520528132877, 0.19459083069476388, -0.005192810089342416, 0.01363774590314396, 0.03573852670829623, 0.1989671685282261, 0.1442668808383807, -0.0018448062361248077, -0.1159582607403037, 0.005097617605520833, 0.17346125518182112] |
1,803.03326 | Quantum-Classical Computation of Schwinger Model Dynamics using Quantum
Computers | We present a quantum-classical algorithm to study the dynamics of the
two-spatial-site Schwinger model on IBM's quantum computers. Using rotational
symmetries, total charge, and parity, the number of qubits needed to perform
computation is reduced by a factor of $\sim 5$, removing exponentially-large
unphysical sectors from the Hilbert space. Our work opens an avenue for
exploration of other lattice quantum field theories, such as quantum
chromodynamics, where classical computation is used to find symmetry sectors in
which the quantum computer evaluates the dynamics of quantum fluctuations.
| quant-ph hep-lat hep-ph hep-th nucl-th | we present a quantumclassical algorithm to study the dynamics of the twospatialsite schwinger model on ibms quantum computers using rotational symmetries total charge and parity the number of qubits needed to perform computation is reduced by a factor of sim 5 removing exponentiallylarge unphysical sectors from the hilbert space our work opens an avenue for exploration of other lattice quantum field theories such as quantum chromodynamics where classical computation is used to find symmetry sectors in which the quantum computer evaluates the dynamics of quantum fluctuations | [['we', 'present', 'a', 'quantumclassical', 'algorithm', 'to', 'study', 'the', 'dynamics', 'of', 'the', 'twospatialsite', 'schwinger', 'model', 'on', 'ibms', 'quantum', 'computers', 'using', 'rotational', 'symmetries', 'total', 'charge', 'and', 'parity', 'the', 'number', 'of', 'qubits', 'needed', 'to', 'perform', 'computation', 'is', 'reduced', 'by', 'a', 'factor', 'of', 'sim', '5', 'removing', 'exponentiallylarge', 'unphysical', 'sectors', 'from', 'the', 'hilbert', 'space', 'our', 'work', 'opens', 'an', 'avenue', 'for', 'exploration', 'of', 'other', 'lattice', 'quantum', 'field', 'theories', 'such', 'as', 'quantum', 'chromodynamics', 'where', 'classical', 'computation', 'is', 'used', 'to', 'find', 'symmetry', 'sectors', 'in', 'which', 'the', 'quantum', 'computer', 'evaluates', 'the', 'dynamics', 'of', 'quantum', 'fluctuations']] | [-0.14459437274319284, 0.1921376860168119, -0.09278765796574161, 0.03365726302487447, -0.02481171962640741, -0.1482385544161148, 0.05267989927464548, 0.2952909949947806, -0.2535257956944406, -0.333935186354553, 0.03274668265024529, -0.238083945313359, -0.13427205744939036, 0.1909627716303529, -0.0019989521235830206, 0.11461655256502769, 0.011656044785152463, 0.00958793139194741, -0.06960161811918678, -0.2614772405146676, 0.2760057930779808, 0.04743348742862615, 0.2547400903285426, 0.03429302036871805, 0.08630383936140468, 0.024401269787374665, 0.014983553247635855, -0.03987174527753857, -0.11884325650137137, 0.12285484775133869, 0.22432023935732157, 0.09597373234436793, 0.23583333694430836, -0.4617589361965656, -0.21131582086467568, 0.08104834913221352, 0.13439510311273967, 0.19385244883733857, -0.027693557022961186, -0.31388160888763034, 0.02991779720520272, -0.1857372102985049, -0.12392654769013033, -0.15159348479526885, -0.010656132564112982, -0.11205293030669804, -0.21431299340637291, 0.06760769779246081, -0.005077501611017129, 0.08283772888483808, 0.04804228045703734, -0.07454777390641325, 0.022396895412684362, 0.1268667855327401, -0.000807240283500184, 0.05960403722710907, 0.1626575319110142, -0.18255181463763995, -0.2286078851450892, 0.43001131853636576, -0.017437226620420593, -0.17307186722755433, 0.14936228741289062, -0.10192510830238462, -0.12919082733501186, 0.062451716512441635, 0.13194998338380282, 0.10105584150399355, -0.09180882284006871, 0.1516676142311874, 0.01398261911509668, 0.17642242234090671, -0.006392843309132492, 0.0916255740887102, 0.2176441928700489, 0.13057637073318748, 0.06741641958189361, 0.158092866970144, -0.0704162500826094, -0.2321262440370286, -0.32807260449318326, -0.21051988314070247, -0.20939878544167562, 0.1312466214712271, -0.06885560701912789, -0.1371691675747142, 0.3840471537619391, 0.17304477504084764, 0.1530619187609238, 0.024460435369709398, 0.2849851489067078, 0.10659946867757861, 0.09124599463470719, 0.09276514511336298, 0.187341728305225, 0.15823590467574403, 0.06584279503029607, -0.30488497268353754, -0.04561853077372208, 0.07927619340309107] |
1,803.03327 | From Close-Packed to Topologically Close-Packed: Formation of Laves
Phases in Moderately Polydisperse Hard-Sphere Mixtures | Particle size polydispersity can help to inhibit crystallization of the
hard-sphere fluid into close-packed structures at high packing fractions and
thus is often employed to create model glass-forming systems. Nonetheless, it
is known that hard-sphere mixtures with modest polydispersity still have
ordered ground states. Here, we demonstrate by computer simulation that
hard-sphere mixtures with increased polydispersity fractionate on the basis of
particle size, and a bimodal subpopulation favors formation of topologically
close-packed C14 and C15 Laves phases in coexistence with a disordered phase.
The generality of this result is supported by simulations of hard-sphere
mixtures with particle-size distributions of four different forms.
| cond-mat.soft cond-mat.stat-mech | particle size polydispersity can help to inhibit crystallization of the hardsphere fluid into closepacked structures at high packing fractions and thus is often employed to create model glassforming systems nonetheless it is known that hardsphere mixtures with modest polydispersity still have ordered ground states here we demonstrate by computer simulation that hardsphere mixtures with increased polydispersity fractionate on the basis of particle size and a bimodal subpopulation favors formation of topologically closepacked c14 and c15 laves phases in coexistence with a disordered phase the generality of this result is supported by simulations of hardsphere mixtures with particlesize distributions of four different forms | [['particle', 'size', 'polydispersity', 'can', 'help', 'to', 'inhibit', 'crystallization', 'of', 'the', 'hardsphere', 'fluid', 'into', 'closepacked', 'structures', 'at', 'high', 'packing', 'fractions', 'and', 'thus', 'is', 'often', 'employed', 'to', 'create', 'model', 'glassforming', 'systems', 'nonetheless', 'it', 'is', 'known', 'that', 'hardsphere', 'mixtures', 'with', 'modest', 'polydispersity', 'still', 'have', 'ordered', 'ground', 'states', 'here', 'we', 'demonstrate', 'by', 'computer', 'simulation', 'that', 'hardsphere', 'mixtures', 'with', 'increased', 'polydispersity', 'fractionate', 'on', 'the', 'basis', 'of', 'particle', 'size', 'and', 'a', 'bimodal', 'subpopulation', 'favors', 'formation', 'of', 'topologically', 'closepacked', 'c14', 'and', 'c15', 'laves', 'phases', 'in', 'coexistence', 'with', 'a', 'disordered', 'phase', 'the', 'generality', 'of', 'this', 'result', 'is', 'supported', 'by', 'simulations', 'of', 'hardsphere', 'mixtures', 'with', 'particlesize', 'distributions', 'of', 'four', 'different', 'forms']] | [-0.07946973989772446, 0.2847423022430317, -0.09936034402298723, -0.021566088770187515, 0.023172387910331143, -0.1563402653178748, 0.04337966767157994, 0.39026905391730515, -0.21727235009893775, -0.30556792866292537, 0.016583916926345622, -0.2855982766760623, -0.13830314090192392, 0.048813918103263076, 0.015978747143355364, 0.08099026237523146, 0.04272002349698953, -0.07877732363447328, -0.06268974516869467, -0.25616300573535994, 0.25230385902721214, 0.04179041341458466, 0.2608082712783168, 0.06442137282597375, 0.0568350766415653, -0.01103405219813188, 0.10399411818213469, 0.089391269229607, -0.22298763654558285, 0.03444960199789528, 0.24746588264665037, 0.008625651166463891, 0.17948479431352632, -0.40240423733770264, -0.24075249676574387, 0.09707293738542563, 0.16674450983055958, 0.09248247306323702, -0.05741140181221543, -0.25732896274284406, 0.06419204750472643, -0.1875125672211688, -0.15925902153785323, -0.11735735414549708, 0.02076368894446276, 0.07348862541474256, -0.2187513423462709, 0.15233711118572482, 0.06393338562738077, 0.09450260292528671, -0.10609217697991898, -0.1524012653267253, -0.0592431130809892, 0.022504401363560234, -0.00881748872822808, -0.007863830829806188, 0.19962363374675168, -0.13882938680905557, -0.07164163990790828, 0.44738881528724495, 0.024930091264347237, -0.19232116007775651, 0.3468551934861085, -0.17672000202483282, -0.13894208411996564, 0.24197837737772396, 0.15349440897504488, 0.028297709999606013, -0.0753465157513525, 0.02250663856530617, -0.04619055083615011, 0.25937820391674693, 0.07338674579217445, -0.024465584296587052, 0.2608850012606412, 0.25377356448649047, -0.006995545996937389, 0.20726535570643403, -0.057503679931602054, -0.17529016605112702, -0.13357090640826808, -0.18041260981494012, -0.24091009319047718, -0.02157894661193531, -0.13753966274445845, -0.23854320401818874, 0.26301185768462865, 0.0877390678312319, 0.17880172853120693, 0.06098569530363688, 0.1971233825897798, -0.0026284786689953475, 0.029879992179499538, -0.008327860614586183, 0.18560489457940646, 0.14769080767919326, 0.06351976209849704, -0.2121136524376697, 0.13064463356025882, 0.019759982481927556] |
1,803.03328 | A new bandwidth selection criterion for using SVDD to analyze
hyperspectral data | This paper presents a method for hyperspectral image classification that uses
support vector data description (SVDD) with the Gaussian kernel function. SVDD
has been a popular machine learning technique for single-class classification,
but selecting the proper Gaussian kernel bandwidth to achieve the best
classification performance is always a challenging problem. This paper proposes
a new automatic, unsupervised Gaussian kernel bandwidth selection approach
which is used with a multiclass SVDD classification scheme. The performance of
the multiclass SVDD classification scheme is evaluated on three frequently used
hyperspectral data sets, and preliminary results show that the proposed method
can achieve better performance than published results on these data sets.
| stat.AP | this paper presents a method for hyperspectral image classification that uses support vector data description svdd with the gaussian kernel function svdd has been a popular machine learning technique for singleclass classification but selecting the proper gaussian kernel bandwidth to achieve the best classification performance is always a challenging problem this paper proposes a new automatic unsupervised gaussian kernel bandwidth selection approach which is used with a multiclass svdd classification scheme the performance of the multiclass svdd classification scheme is evaluated on three frequently used hyperspectral data sets and preliminary results show that the proposed method can achieve better performance than published results on these data sets | [['this', 'paper', 'presents', 'a', 'method', 'for', 'hyperspectral', 'image', 'classification', 'that', 'uses', 'support', 'vector', 'data', 'description', 'svdd', 'with', 'the', 'gaussian', 'kernel', 'function', 'svdd', 'has', 'been', 'a', 'popular', 'machine', 'learning', 'technique', 'for', 'singleclass', 'classification', 'but', 'selecting', 'the', 'proper', 'gaussian', 'kernel', 'bandwidth', 'to', 'achieve', 'the', 'best', 'classification', 'performance', 'is', 'always', 'a', 'challenging', 'problem', 'this', 'paper', 'proposes', 'a', 'new', 'automatic', 'unsupervised', 'gaussian', 'kernel', 'bandwidth', 'selection', 'approach', 'which', 'is', 'used', 'with', 'a', 'multiclass', 'svdd', 'classification', 'scheme', 'the', 'performance', 'of', 'the', 'multiclass', 'svdd', 'classification', 'scheme', 'is', 'evaluated', 'on', 'three', 'frequently', 'used', 'hyperspectral', 'data', 'sets', 'and', 'preliminary', 'results', 'show', 'that', 'the', 'proposed', 'method', 'can', 'achieve', 'better', 'performance', 'than', 'published', 'results', 'on', 'these', 'data', 'sets']] | [-0.010903588041367235, -0.09840763167034243, -0.11934186249240258, 0.0781783915405536, -0.1497154881759921, -0.19805924002968958, 0.05704680841120186, 0.4719887041251793, -0.20915810971425097, -0.2743437630603107, 0.1064464897787738, -0.22786873622545015, -0.1777593626283875, 0.2636379840061347, -0.17068772500154572, 0.18326873894972362, 0.2050443367627841, 0.08458324459981974, -0.04928427237351469, -0.36085200604817297, 0.30482032210522586, 0.05046445462051953, 0.45290381464863494, 0.010507051458704137, 0.14154598308905575, 0.0201798028913196, -0.07013796175890993, -0.02797177428745221, -0.040518858472878665, 0.19868068744223913, 0.34609028192184793, 0.21427793520346075, 0.34606231338231364, -0.26154169531660937, -0.26702566732321736, 0.13984644992677409, 0.14766879764463858, 0.08013349133826549, -0.04862073345531962, -0.2969768574443933, 0.11976860424669059, -0.16636313493477797, -0.01110471357269404, -0.2027107137037772, -0.07038579552617168, -0.05340177330044838, -0.3638013296621356, 0.07302329848111372, 0.08072679430664143, 0.050465025216619545, -0.08424864215645765, -0.17094403067951866, 0.11753899583954225, 0.06828172860893413, -0.017903355966435275, 0.119180095345043, 0.0913996427302536, -0.10677957284551497, -0.17615951232995106, 0.350227865312144, -0.08325793443394011, -0.2567386050832623, 0.21695687689722698, 0.041508024471385456, -0.1524964562469275, 0.12633990817572746, 0.25412824334768214, 0.10748665672335252, -0.2014681824926879, 0.011344054482646599, -0.0777806325328197, 0.1708196366606193, 0.03975017017153936, -0.02271477775387118, 0.08201738707253396, 0.3180363809637656, 0.04864825683898319, 0.1546622194985154, -0.19120548089757283, -0.006725224309435515, -0.21966391084411085, -0.10477429991326878, -0.23376194871613912, -0.06101767556898505, -0.11046962225012738, -0.18247660373067745, 0.4110076857589171, 0.18233909354344985, 0.21426663136927881, 0.1178112040658995, 0.420154681411859, 0.07636748585049237, 0.08547209367747897, 0.1221545103841644, 0.12810941173686324, 0.04860872148849488, 0.10524676814153094, -0.1460169705161912, 0.037757022443410254, 0.09112683850967229] |
1,803.03329 | Active control of ion transport within a nanofluidic system | The ability to induce regions of high and low ionic concentration adjacent to
a permeselective membrane or nanochannel subject to an externally applied
electric field (a phenomenon termed concentration-polarization) has been used
for a broad spectrum of applications ranging from on-chip desalination,
bacteria filtration to biomolecule preconcentration. But these applications
have been limited by the ability to control the length of the diffusion layer
that is commonly indirectly prescribed by the fixed geometric and surface
properties of the nanofluidic system. Here, we demonstrate that the depletion
layer can be dynamically varied by inducing controlled electrothermal flow
driven by the interaction of temperature gradients with the applied electric
field. To this end, a series of microscale heaters, which can be individually
activated on demand are embedded at the bottom of the microchannel and the
relationship between their activation and ionic concentration is characterized.
Such spatio-temporal control of the diffusion layer can be used to enhance
on-chip electro-dialysis by producing shorter depletion layers, to dynamically
reduce the microchannel resistance relative to that of the nanochannel for
nanochannel based (bio)sensing, to generate current rectification reminiscent
of a diode like behavior and control the location of the preconcentrated plug
of analytes or the interface of brine and desalted streams.
| physics.flu-dyn | the ability to induce regions of high and low ionic concentration adjacent to a permeselective membrane or nanochannel subject to an externally applied electric field a phenomenon termed concentrationpolarization has been used for a broad spectrum of applications ranging from onchip desalination bacteria filtration to biomolecule preconcentration but these applications have been limited by the ability to control the length of the diffusion layer that is commonly indirectly prescribed by the fixed geometric and surface properties of the nanofluidic system here we demonstrate that the depletion layer can be dynamically varied by inducing controlled electrothermal flow driven by the interaction of temperature gradients with the applied electric field to this end a series of microscale heaters which can be individually activated on demand are embedded at the bottom of the microchannel and the relationship between their activation and ionic concentration is characterized such spatiotemporal control of the diffusion layer can be used to enhance onchip electrodialysis by producing shorter depletion layers to dynamically reduce the microchannel resistance relative to that of the nanochannel for nanochannel based biosensing to generate current rectification reminiscent of a diode like behavior and control the location of the preconcentrated plug of analytes or the interface of brine and desalted streams | [['the', 'ability', 'to', 'induce', 'regions', 'of', 'high', 'and', 'low', 'ionic', 'concentration', 'adjacent', 'to', 'a', 'permeselective', 'membrane', 'or', 'nanochannel', 'subject', 'to', 'an', 'externally', 'applied', 'electric', 'field', 'a', 'phenomenon', 'termed', 'concentrationpolarization', 'has', 'been', 'used', 'for', 'a', 'broad', 'spectrum', 'of', 'applications', 'ranging', 'from', 'onchip', 'desalination', 'bacteria', 'filtration', 'to', 'biomolecule', 'preconcentration', 'but', 'these', 'applications', 'have', 'been', 'limited', 'by', 'the', 'ability', 'to', 'control', 'the', 'length', 'of', 'the', 'diffusion', 'layer', 'that', 'is', 'commonly', 'indirectly', 'prescribed', 'by', 'the', 'fixed', 'geometric', 'and', 'surface', 'properties', 'of', 'the', 'nanofluidic', 'system', 'here', 'we', 'demonstrate', 'that', 'the', 'depletion', 'layer', 'can', 'be', 'dynamically', 'varied', 'by', 'inducing', 'controlled', 'electrothermal', 'flow', 'driven', 'by', 'the', 'interaction', 'of', 'temperature', 'gradients', 'with', 'the', 'applied', 'electric', 'field', 'to', 'this', 'end', 'a', 'series', 'of', 'microscale', 'heaters', 'which', 'can', 'be', 'individually', 'activated', 'on', 'demand', 'are', 'embedded', 'at', 'the', 'bottom', 'of', 'the', 'microchannel', 'and', 'the', 'relationship', 'between', 'their', 'activation', 'and', 'ionic', 'concentration', 'is', 'characterized', 'such', 'spatiotemporal', 'control', 'of', 'the', 'diffusion', 'layer', 'can', 'be', 'used', 'to', 'enhance', 'onchip', 'electrodialysis', 'by', 'producing', 'shorter', 'depletion', 'layers', 'to', 'dynamically', 'reduce', 'the', 'microchannel', 'resistance', 'relative', 'to', 'that', 'of', 'the', 'nanochannel', 'for', 'nanochannel', 'based', 'biosensing', 'to', 'generate', 'current', 'rectification', 'reminiscent', 'of', 'a', 'diode', 'like', 'behavior', 'and', 'control', 'the', 'location', 'of', 'the', 'preconcentrated', 'plug', 'of', 'analytes', 'or', 'the', 'interface', 'of', 'brine', 'and', 'desalted', 'streams']] | [-0.10024938812723734, 0.18140511970114398, -0.04562738250784281, -0.040639882754548315, -0.045830542422222474, -0.16782959108701953, 0.027331230335518496, 0.4091218842290305, -0.3356962710858719, -0.31961457011760164, 0.08449047889634229, -0.24112390234171976, -0.1314469538790423, 0.2099191222292611, -0.05962769808432106, 0.045171433444236325, -0.02748354239848046, -0.024110052108736985, 0.03393209749938791, -0.15961008395948956, 0.24551524657013798, 0.05673581609772726, 0.31558609912679114, 0.10464971438384532, 0.1229257213094705, -0.06037730226491458, 0.045817149703916496, 0.06882007345372793, -0.10765180606472088, 0.14595870367057695, 0.23021381747526218, -0.011582689827750667, 0.24663354704585294, -0.5164129202332495, -0.2646700556362324, 0.06257266379284239, 0.15734221749376542, 0.1049622720831286, -0.0840960912905532, -0.253711157985548, 0.11298580518416544, -0.15169775016930895, -0.10929639038334757, -0.038708315583033545, 0.012750371268231163, 0.09875521215346254, -0.2653815606701197, 0.04813199039401099, 0.02419482008226263, 0.06558763793794124, -0.051268756885247506, -0.06006012391932954, -0.0630722104129151, 0.15619126770940453, 0.012331493364849894, 0.012162297317040115, 0.2827998381984042, -0.16070652186915527, -0.05718985005825906, 0.32966619237132444, -0.08750583868506041, -0.18768985077326986, 0.22836158504031856, -0.10240722981069496, 0.003219446125855245, 0.16828519021769486, 0.1982236324194565, 0.09705305732394762, -0.17779049698706015, -0.0006898232707742251, 0.037909536986694775, 0.17610689888807418, 0.10588988216736787, 0.002032610659238578, 0.2508641645164773, 0.192966605711839, 0.07523614437074981, 0.16438004574196707, -0.12815121892669082, -0.06366011819866772, -0.21719335443178875, -0.17454337390799002, -0.16078905478271996, 0.036442319242359196, -0.050773716067905664, -0.18175276589008177, 0.3853769324221971, 0.14341043481962884, 0.19119983338889215, -0.04100834382199429, 0.27705519593385336, 0.11204480532773466, 0.1268904170304961, 0.005665432408193846, 0.2201613291756868, 0.15212239498344002, 0.1308819773805208, -0.2737197043215118, 0.11422251076477875, 0.009644191135827563] |
1,803.0333 | Motion deblurring of faces | Face analysis is a core part of computer vision, in which remarkable progress
has been observed in the past decades. Current methods achieve recognition and
tracking with invariance to fundamental modes of variation such as
illumination, 3D pose, expressions. Notwithstanding, a much less standing mode
of variation is motion deblurring, which however presents substantial
challenges in face analysis. Recent approaches either make oversimplifying
assumptions, e.g. in cases of joint optimization with other tasks, or fail to
preserve the highly structured shape/identity information. Therefore, we
propose a data-driven method that encourages identity preservation. The
proposed model includes two parallel streams (sub-networks): the first deblurs
the image, the second implicitly extracts and projects the identity of both the
sharp and the blurred image in similar subspaces. We devise a method for
creating realistic motion blur by averaging a variable number of frames to
train our model. The averaged images originate from a 2MF2 dataset with 10
million facial frames, which we introduce for the task. Considering deblurring
as an intermediate step, we utilize the deblurred outputs to conduct a thorough
experimentation on high-level face analysis tasks, i.e. landmark localization
and face verification. The experimental evaluation demonstrates the superiority
of our method.
| cs.CV | face analysis is a core part of computer vision in which remarkable progress has been observed in the past decades current methods achieve recognition and tracking with invariance to fundamental modes of variation such as illumination 3d pose expressions notwithstanding a much less standing mode of variation is motion deblurring which however presents substantial challenges in face analysis recent approaches either make oversimplifying assumptions eg in cases of joint optimization with other tasks or fail to preserve the highly structured shapeidentity information therefore we propose a datadriven method that encourages identity preservation the proposed model includes two parallel streams subnetworks the first deblurs the image the second implicitly extracts and projects the identity of both the sharp and the blurred image in similar subspaces we devise a method for creating realistic motion blur by averaging a variable number of frames to train our model the averaged images originate from a 2mf2 dataset with 10 million facial frames which we introduce for the task considering deblurring as an intermediate step we utilize the deblurred outputs to conduct a thorough experimentation on highlevel face analysis tasks ie landmark localization and face verification the experimental evaluation demonstrates the superiority of our method | [['face', 'analysis', 'is', 'a', 'core', 'part', 'of', 'computer', 'vision', 'in', 'which', 'remarkable', 'progress', 'has', 'been', 'observed', 'in', 'the', 'past', 'decades', 'current', 'methods', 'achieve', 'recognition', 'and', 'tracking', 'with', 'invariance', 'to', 'fundamental', 'modes', 'of', 'variation', 'such', 'as', 'illumination', '3d', 'pose', 'expressions', 'notwithstanding', 'a', 'much', 'less', 'standing', 'mode', 'of', 'variation', 'is', 'motion', 'deblurring', 'which', 'however', 'presents', 'substantial', 'challenges', 'in', 'face', 'analysis', 'recent', 'approaches', 'either', 'make', 'oversimplifying', 'assumptions', 'eg', 'in', 'cases', 'of', 'joint', 'optimization', 'with', 'other', 'tasks', 'or', 'fail', 'to', 'preserve', 'the', 'highly', 'structured', 'shapeidentity', 'information', 'therefore', 'we', 'propose', 'a', 'datadriven', 'method', 'that', 'encourages', 'identity', 'preservation', 'the', 'proposed', 'model', 'includes', 'two', 'parallel', 'streams', 'subnetworks', 'the', 'first', 'deblurs', 'the', 'image', 'the', 'second', 'implicitly', 'extracts', 'and', 'projects', 'the', 'identity', 'of', 'both', 'the', 'sharp', 'and', 'the', 'blurred', 'image', 'in', 'similar', 'subspaces', 'we', 'devise', 'a', 'method', 'for', 'creating', 'realistic', 'motion', 'blur', 'by', 'averaging', 'a', 'variable', 'number', 'of', 'frames', 'to', 'train', 'our', 'model', 'the', 'averaged', 'images', 'originate', 'from', 'a', '2mf2', 'dataset', 'with', '10', 'million', 'facial', 'frames', 'which', 'we', 'introduce', 'for', 'the', 'task', 'considering', 'deblurring', 'as', 'an', 'intermediate', 'step', 'we', 'utilize', 'the', 'deblurred', 'outputs', 'to', 'conduct', 'a', 'thorough', 'experimentation', 'on', 'highlevel', 'face', 'analysis', 'tasks', 'ie', 'landmark', 'localization', 'and', 'face', 'verification', 'the', 'experimental', 'evaluation', 'demonstrates', 'the', 'superiority', 'of', 'our', 'method']] | [-0.07340303700944713, -0.03792635194073153, -0.08300718588621489, 0.021897273213003894, -0.08267112300797765, -0.15193926829284018, -0.01854971750183221, 0.4411888076895278, -0.2675395471861168, -0.3452022128491377, 0.12203546116729647, -0.27064058962468135, -0.17216368302897722, 0.1785644885088431, -0.15335236584330547, 0.09765488661740128, 0.15628359128993685, 0.020662475714688093, -0.0833694954841975, -0.22844971185526336, 0.27379289400117585, 0.01587270199539786, 0.3260928754651995, 0.01991039423547609, 0.13606577007009704, 0.004609710446615912, -0.06937321710010648, -0.01785295770725163, -0.033938162419797996, 0.18153450289641374, 0.2746443343562625, 0.18993592267138504, 0.3198875509135957, -0.430209679782096, -0.22943154393638276, 0.056158872431129866, 0.13652884239520657, 0.12478619522940158, -0.07965794376784233, -0.3383574080701005, 0.06638572942489301, -0.13325443887626942, -0.01186089222295666, -0.1311763591039213, 0.014861007525742397, -0.03823285955372647, -0.28067919129876384, 0.09246190714311896, 0.09488489818687988, 0.09287675083567369, -0.060592186030200015, -0.09176321278625567, 0.05628631329900414, 0.18988871173481742, 0.07891224869598197, 0.05849790190850213, 0.1514027026477175, -0.1922767562269024, -0.13401050646480514, 0.41580771681928663, -0.04067723167263095, -0.2112475268914583, 0.20722913584073208, -0.08031825908241147, -0.15182226210148358, 0.13101174980782124, 0.19724283561856504, 0.12866651809570018, -0.1347311568275398, -0.0021021651206252984, -0.06704025496776235, 0.19136540477677266, 0.06064379513406252, 0.0035959995786507366, 0.19235380162836566, 0.21044003666017433, 0.05991456405001595, 0.14624548304204743, -0.17057977071060437, -0.061882733360256015, -0.2347375583099629, -0.10919534434488386, -0.16661012172743522, -0.04672721020428331, -0.0659962305202201, -0.15600328613072634, 0.43456170533555655, 0.227530693374004, 0.22462351245054862, 0.05793300170596328, 0.3734102475989078, 0.0360035625089207, 0.10834802278764166, 0.0571808578224962, 0.19289754601332065, 0.028078185061494135, 0.12324659822138065, -0.16882640393750803, 0.06241920868572434, 0.06264544084278524] |
1,803.03331 | Efficient reconfigurable regions management method for adaptive and
dynamic FPGA based systems | Adaptive systems based on field programmable gate array (FPGA) architectures
can greatly benefi t fro m th e high degree of flexibility offered by dynamic
partial reconfiguration (DPR). By using this technique, hardware tasks can be
loaded and reloaded on demand depending on the system requirements. In this
paper, we propose to use the DPR for dynamic and adaptive implementation of a
video cut detection application based on the MPEG-7 color structure descriptor
(CSD). In the proposed implementation, different scenarios have been tested.
Depending on the application and the system requirements, the CSD module can be
loaded at any time with variable module size (corresponding to different
version of the CSD) and allocated in different possible reconfigurable regions.
Such implementation entails many problems related to communication, relocation
and reconfigurable region management. We will demonstrate how we have made this
implementation successful through the use of an appropriate design method. This
method was proposed to support the management of variable-size hardware tasks
on DPR FPGAs based adaptive systems. It permits to efficiently handle the
reconfigurable area and to relocate the reconfigurable modules in different
possible regions. The implementation results for the considered application
show an important optimization in terms of configuration time (until 66 %) and
memory storage (until 87 %) and an efficient hardware resources utilization
rate (until 90%).
| cs.AR | adaptive systems based on field programmable gate array fpga architectures can greatly benefi t fro m th e high degree of flexibility offered by dynamic partial reconfiguration dpr by using this technique hardware tasks can be loaded and reloaded on demand depending on the system requirements in this paper we propose to use the dpr for dynamic and adaptive implementation of a video cut detection application based on the mpeg7 color structure descriptor csd in the proposed implementation different scenarios have been tested depending on the application and the system requirements the csd module can be loaded at any time with variable module size corresponding to different version of the csd and allocated in different possible reconfigurable regions such implementation entails many problems related to communication relocation and reconfigurable region management we will demonstrate how we have made this implementation successful through the use of an appropriate design method this method was proposed to support the management of variablesize hardware tasks on dpr fpgas based adaptive systems it permits to efficiently handle the reconfigurable area and to relocate the reconfigurable modules in different possible regions the implementation results for the considered application show an important optimization in terms of configuration time until 66 and memory storage until 87 and an efficient hardware resources utilization rate until 90 | [['adaptive', 'systems', 'based', 'on', 'field', 'programmable', 'gate', 'array', 'fpga', 'architectures', 'can', 'greatly', 'benefi', 't', 'fro', 'm', 'th', 'e', 'high', 'degree', 'of', 'flexibility', 'offered', 'by', 'dynamic', 'partial', 'reconfiguration', 'dpr', 'by', 'using', 'this', 'technique', 'hardware', 'tasks', 'can', 'be', 'loaded', 'and', 'reloaded', 'on', 'demand', 'depending', 'on', 'the', 'system', 'requirements', 'in', 'this', 'paper', 'we', 'propose', 'to', 'use', 'the', 'dpr', 'for', 'dynamic', 'and', 'adaptive', 'implementation', 'of', 'a', 'video', 'cut', 'detection', 'application', 'based', 'on', 'the', 'mpeg7', 'color', 'structure', 'descriptor', 'csd', 'in', 'the', 'proposed', 'implementation', 'different', 'scenarios', 'have', 'been', 'tested', 'depending', 'on', 'the', 'application', 'and', 'the', 'system', 'requirements', 'the', 'csd', 'module', 'can', 'be', 'loaded', 'at', 'any', 'time', 'with', 'variable', 'module', 'size', 'corresponding', 'to', 'different', 'version', 'of', 'the', 'csd', 'and', 'allocated', 'in', 'different', 'possible', 'reconfigurable', 'regions', 'such', 'implementation', 'entails', 'many', 'problems', 'related', 'to', 'communication', 'relocation', 'and', 'reconfigurable', 'region', 'management', 'we', 'will', 'demonstrate', 'how', 'we', 'have', 'made', 'this', 'implementation', 'successful', 'through', 'the', 'use', 'of', 'an', 'appropriate', 'design', 'method', 'this', 'method', 'was', 'proposed', 'to', 'support', 'the', 'management', 'of', 'variablesize', 'hardware', 'tasks', 'on', 'dpr', 'fpgas', 'based', 'adaptive', 'systems', 'it', 'permits', 'to', 'efficiently', 'handle', 'the', 'reconfigurable', 'area', 'and', 'to', 'relocate', 'the', 'reconfigurable', 'modules', 'in', 'different', 'possible', 'regions', 'the', 'implementation', 'results', 'for', 'the', 'considered', 'application', 'show', 'an', 'important', 'optimization', 'in', 'terms', 'of', 'configuration', 'time', 'until', '66', 'and', 'memory', 'storage', 'until', '87', 'and', 'an', 'efficient', 'hardware', 'resources', 'utilization', 'rate', 'until', '90']] | [-0.15634503001692118, 0.042718153810912755, -0.04407962308053997, -0.026156577817110466, -0.06392738627726902, -0.1847363017322668, 0.058537536470491126, 0.4433575425560034, -0.2576807376980368, -0.35867109688654264, 0.14662098363536374, -0.14862506883865637, -0.15357163029451235, 0.2225762929851448, -0.1028926801767806, 0.09424450391411988, 0.06790065152745228, -0.0072277549123908914, -0.03757892861257359, -0.2897311092411756, 0.2264906666230807, 0.10495616862964299, 0.3433806419165598, 0.05644827887752197, 0.13243718440558208, 0.009538779603274263, -0.013161798656693901, -0.014171310006295916, -0.07544613501091522, 0.13049728726899182, 0.2754923013023842, 0.19226828313333466, 0.27513111125423434, -0.46366670967998086, -0.156516437524395, 0.05639869778705933, 0.14991171100539052, 0.049185232410241884, -0.04121402331468373, -0.2655156452857665, 0.09927400649326888, -0.22294617010259202, -0.08632269988474608, -0.09220610257600331, 0.01859716841944545, 0.02490639459790179, -0.2645828625614673, -0.05977922368415252, 0.005080549697460675, 0.03810912934757114, -0.04499728478387826, -0.11555151236286663, 0.0391845625105176, 0.09501355627543051, -0.07144823571434245, 0.024552951911809267, 0.18849668948031548, -0.08975272044039297, -0.14814345680901575, 0.3442474555965789, -0.003456222253454918, -0.2035533384359614, 0.19881608837642017, -0.024777197044049563, -0.14813576242024148, 0.12209881921255684, 0.23832650279790094, 0.08810954251654309, -0.1623059925410349, 0.07329361511316772, 0.04196991416352426, 0.21291335764302252, 0.06117967075530301, 0.060714788701429996, 0.189781336215135, 0.2543923695390091, 0.07339748411403788, 0.1850979454315233, -0.10050707267536954, -0.07676237143567521, -0.22227689771453799, -0.1440534657535695, -0.1735589922507104, -0.03363304569373011, -0.07174971436823532, -0.11201907337548349, 0.39181364891636705, 0.19596456519233202, 0.1343264296333978, 0.04356427935999818, 0.3695198251322533, 0.08181224053259939, 0.14992743279974632, 0.10373759546739704, 0.15254911259291004, 0.033592817696949676, 0.16511721654010383, -0.21891365948896338, 0.07925719965391585, 0.009956382378866827] |
1,803.03332 | Deep RNN-Oriented Paradigm Shift through BOCANet: Broken Obfuscated
Circuit Attack | This is the first work augmenting hardware attacks mounted on obfuscated
circuits by incorporating deep recurrent neural network (D-RNN). Logic
encryption obfuscation has been used for thwarting counterfeiting,
overproduction, and reverse engineering but vulnerable to attacks. There have
been efficient schemes, e.g., satisfiability-checking (SAT) based attack, which
can potentially compromise hardware obfuscation circuits. Nevertheless, not
only there exist countermeasures against such attacks in the state-of-the-art
(including the recent delay+logic locking (DLL) scheme in DAC'17), but the
sheer amount of time/resources to mount the attack could hinder its efficacy.
In this paper, we propose a deep RNN-oriented approach, called BOCANet, to (i)
compromise the obfuscated hardware at least an order-of magnitude more
efficiently (>20X faster with relatively high success rate) compared to
existing attacks; (ii) attack such locked hardware even when the resources to
the attacker are only limited to insignificant number of I/O pairs (< 0.5\%) to
reconstruct the secret key; and (iii) break a number of experimented benchmarks
(ISCAS-85 c423, c1355, c1908, and c7552) successfully.
| cs.CR | this is the first work augmenting hardware attacks mounted on obfuscated circuits by incorporating deep recurrent neural network drnn logic encryption obfuscation has been used for thwarting counterfeiting overproduction and reverse engineering but vulnerable to attacks there have been efficient schemes eg satisfiabilitychecking sat based attack which can potentially compromise hardware obfuscation circuits nevertheless not only there exist countermeasures against such attacks in the stateoftheart including the recent delaylogic locking dll scheme in dac17 but the sheer amount of timeresources to mount the attack could hinder its efficacy in this paper we propose a deep rnnoriented approach called bocanet to i compromise the obfuscated hardware at least an orderof magnitude more efficiently 20x faster with relatively high success rate compared to existing attacks ii attack such locked hardware even when the resources to the attacker are only limited to insignificant number of io pairs 05 to reconstruct the secret key and iii break a number of experimented benchmarks iscas85 c423 c1355 c1908 and c7552 successfully | [['this', 'is', 'the', 'first', 'work', 'augmenting', 'hardware', 'attacks', 'mounted', 'on', 'obfuscated', 'circuits', 'by', 'incorporating', 'deep', 'recurrent', 'neural', 'network', 'drnn', 'logic', 'encryption', 'obfuscation', 'has', 'been', 'used', 'for', 'thwarting', 'counterfeiting', 'overproduction', 'and', 'reverse', 'engineering', 'but', 'vulnerable', 'to', 'attacks', 'there', 'have', 'been', 'efficient', 'schemes', 'eg', 'satisfiabilitychecking', 'sat', 'based', 'attack', 'which', 'can', 'potentially', 'compromise', 'hardware', 'obfuscation', 'circuits', 'nevertheless', 'not', 'only', 'there', 'exist', 'countermeasures', 'against', 'such', 'attacks', 'in', 'the', 'stateoftheart', 'including', 'the', 'recent', 'delaylogic', 'locking', 'dll', 'scheme', 'in', 'dac17', 'but', 'the', 'sheer', 'amount', 'of', 'timeresources', 'to', 'mount', 'the', 'attack', 'could', 'hinder', 'its', 'efficacy', 'in', 'this', 'paper', 'we', 'propose', 'a', 'deep', 'rnnoriented', 'approach', 'called', 'bocanet', 'to', 'i', 'compromise', 'the', 'obfuscated', 'hardware', 'at', 'least', 'an', 'orderof', 'magnitude', 'more', 'efficiently', '20x', 'faster', 'with', 'relatively', 'high', 'success', 'rate', 'compared', 'to', 'existing', 'attacks', 'ii', 'attack', 'such', 'locked', 'hardware', 'even', 'when', 'the', 'resources', 'to', 'the', 'attacker', 'are', 'only', 'limited', 'to', 'insignificant', 'number', 'of', 'io', 'pairs', '05', 'to', 'reconstruct', 'the', 'secret', 'key', 'and', 'iii', 'break', 'a', 'number', 'of', 'experimented', 'benchmarks', 'iscas85', 'c423', 'c1355', 'c1908', 'and', 'c7552', 'successfully']] | [-0.1600454486543194, 0.006235114397472928, -0.028649966235444614, 0.07702740270475364, -0.09857258847825656, -0.3105739676630848, 0.09876307313980025, 0.37848604931407104, -0.24519869890123322, -0.36320359476954694, 0.14426799168125104, -0.27231013208366694, -0.1336317451605514, 0.22666614494363593, -0.18076714101561886, 0.12178456091587461, 0.033248163502779045, -0.04450746411516978, -0.023428292124929608, -0.33167033020635345, 0.25298661652916843, 0.07426291199921553, 0.3261179454775919, 0.03967373438697059, 0.07502185756038092, -0.06726060858720047, -0.0013458989649583958, -0.027527215791967027, -0.012895944357736949, 0.09400529889271232, 0.31563901417417106, 0.22386757462362575, 0.3201935068484704, -0.4914694948264273, -0.1896462712086927, 0.13802310327033862, 0.1537537880490829, 0.16464042031743037, -0.07575598103411356, -0.29550746336555594, 0.15095192895146312, -0.2684811685430064, -0.029536234395827646, -0.11709119270964982, 0.009084993914054458, -0.0029496188339655687, -0.1976735638854966, -0.05240022687235503, 0.04911907946477365, 0.07075077309540123, 0.07579032492387898, -0.08300405676969012, 0.00446113954434634, 0.10188447779054148, 0.023116917210042692, 0.03194069649555548, 0.18171248356900682, -0.14521460576801543, -0.15525311945083367, 0.31186605806041295, -0.008061669766902924, -0.1481247617014844, 0.20287217319183715, 0.011595663958626568, -0.14723263425266098, 0.1493011832676211, 0.23111591930908987, 0.08927469157352806, -0.11197142818971213, -0.002269941175602685, 0.031986983605678296, 0.25693393943855053, 0.09435178817303222, 0.06643184624422507, 0.14180795389975, 0.19874716924383323, 0.06407799990402807, 0.1160454820088188, -0.11959492425644877, -0.05318575965353305, -0.1789459591156026, -0.09956272314213643, -0.17830573260831606, 0.02037079869422863, -0.03004509736874636, -0.13235055488552067, 0.35311643843869306, 0.2588491458119528, 0.1295600903700966, 0.07325208728174994, 0.43946754565213325, 0.01107709117346461, 0.18971451912312562, 0.16589201646590024, 0.23481630216868724, -0.0037475517242079137, 0.08997366673855858, -0.17966389317906337, 0.2069430005726268, -0.013329498701177205] |
1,803.03333 | Nonparametric estimation of the first order Sobol indices with bootstrap
bandwidth | Suppose that $Y = \psi(X_1, \ldots, X_p)$, where $(X_1,\ldots, X_p)^\top$ are
random inputs, $Y$ is the output, and $\psi(\cdot)$ is an unknown link
function. The Sobol indices gauge the sensitivity of each $X$ against $Y$ by
estimating the regression curve's variability between them. In this paper, we
estimate these curves with a kernel-based method. The method allows to estimate
the first order indices when the link between the independent and dependent
variables is unknown. The kernel-based methods need a bandwidth to average the
observations. For finite samples, the cross-validation method is famous to
decide this bandwidth. However, it produces a structural bias. To remedy this,
we propose a bootstrap procedure which reconstruct the model residuals and
re-estimate the non-parametric regression curve. With the new set of curves,
the procedure corrects the bias in the Sobol index. To test the developed
method, we implemented simulated numerical examples with complex functions.
| stat.ME stat.CO | suppose that y psix_1 ldots x_p where x_1ldots x_ptop are random inputs y is the output and psicdot is an unknown link function the sobol indices gauge the sensitivity of each x against y by estimating the regression curves variability between them in this paper we estimate these curves with a kernelbased method the method allows to estimate the first order indices when the link between the independent and dependent variables is unknown the kernelbased methods need a bandwidth to average the observations for finite samples the crossvalidation method is famous to decide this bandwidth however it produces a structural bias to remedy this we propose a bootstrap procedure which reconstruct the model residuals and reestimate the nonparametric regression curve with the new set of curves the procedure corrects the bias in the sobol index to test the developed method we implemented simulated numerical examples with complex functions | [['suppose', 'that', 'y', 'psix_1', 'ldots', 'x_p', 'where', 'x_1ldots', 'x_ptop', 'are', 'random', 'inputs', 'y', 'is', 'the', 'output', 'and', 'psicdot', 'is', 'an', 'unknown', 'link', 'function', 'the', 'sobol', 'indices', 'gauge', 'the', 'sensitivity', 'of', 'each', 'x', 'against', 'y', 'by', 'estimating', 'the', 'regression', 'curves', 'variability', 'between', 'them', 'in', 'this', 'paper', 'we', 'estimate', 'these', 'curves', 'with', 'a', 'kernelbased', 'method', 'the', 'method', 'allows', 'to', 'estimate', 'the', 'first', 'order', 'indices', 'when', 'the', 'link', 'between', 'the', 'independent', 'and', 'dependent', 'variables', 'is', 'unknown', 'the', 'kernelbased', 'methods', 'need', 'a', 'bandwidth', 'to', 'average', 'the', 'observations', 'for', 'finite', 'samples', 'the', 'crossvalidation', 'method', 'is', 'famous', 'to', 'decide', 'this', 'bandwidth', 'however', 'it', 'produces', 'a', 'structural', 'bias', 'to', 'remedy', 'this', 'we', 'propose', 'a', 'bootstrap', 'procedure', 'which', 'reconstruct', 'the', 'model', 'residuals', 'and', 'reestimate', 'the', 'nonparametric', 'regression', 'curve', 'with', 'the', 'new', 'set', 'of', 'curves', 'the', 'procedure', 'corrects', 'the', 'bias', 'in', 'the', 'sobol', 'index', 'to', 'test', 'the', 'developed', 'method', 'we', 'implemented', 'simulated', 'numerical', 'examples', 'with', 'complex', 'functions']] | [-0.0657441149488066, 0.04035413598616636, -0.1179029925739112, 0.09668572864906658, -0.0865086750223059, -0.17447493502500225, 0.0966603801153562, 0.42701193481071353, -0.2825963464501786, -0.3045785696985685, 0.08717166401018478, -0.272368799207819, -0.1552329457545181, 0.17554214154449865, -0.12610799500284947, 0.08653051411886126, 0.02960402644813469, -0.002653001306884705, -0.08760625735676388, -0.30091266759052515, 0.28816703057206833, 0.02239973061679773, 0.27882996317272696, -0.053817688359891716, 0.13449614726753317, 0.030485006109875156, -0.0812976225247377, -0.004481687012753666, -0.1339365741884761, 0.1350373975322215, 0.24894563863946967, 0.12983708448060396, 0.2985657158830803, -0.30276186254404946, -0.20342932776739336, 0.18186011213222392, 0.08800172461005412, 0.04902722412474734, 0.020588381105893585, -0.23595276148351904, 0.08410334537341578, -0.13288208128476184, -0.1042873591498778, -0.0850022197605353, 0.0054668007475923595, 0.03853405077785432, -0.3585876559404886, 0.06866453438662375, 0.016012477409413518, 0.0587579167626594, -0.0010321421125323244, -0.12556798960885976, -0.007245384174245984, 0.0981319544712091, 0.0805762979347093, 0.07450698695005212, 0.08042660424460286, -0.057259851750879456, -0.08781089334850749, 0.29863236359103695, -0.06426264769286044, -0.24844113972726956, 0.11826035409626767, -0.11788705229593364, -0.13276474543030642, 0.10191885013235351, 0.17815450828981727, 0.12559938811926707, -0.14956059617403822, 0.06145599523235482, -0.015969355393692288, 0.1943518923617874, 0.007286446229618502, -0.06614184125377605, 0.14120882958467182, 0.11787731499468576, 0.05557513732402522, 0.13293557078497842, -0.15782732346847858, 0.0017076577099792863, -0.3304702495798877, -0.11573733976876287, -0.19179370083004135, 0.001592476664059987, -0.16804084100105485, -0.1960095094312748, 0.4135540258139372, 0.19484195213012193, 0.21815816558616824, 0.09258513175643189, 0.3388183899534777, 0.14383986818036845, 0.019853892665968775, 0.07300196199563064, 0.14180981360171754, 0.15768947203847747, 0.022149074746914566, -0.18556841227946777, 0.10222526596323268, 0.08388054429885153] |
1,803.03334 | Connecting dissipation and noncommutativity: A Bateman system case study | Quantum effects on a pair of Bateman oscillators embedded in an ambient
noncommutative space (Moyal plane) is analyzed using both path integral and
canonical quantization schemes within the framework of Hilbert-Schmidt operator
formulation. We adopt a method which is distinct from the one which employs 't
Hooft's scheme of quantization, carried out earlier in the literature where the
ambient space was taken to be commutative. Our quantization shows that we end
up finally again with a Bateman system except that the damping factor undergoes
renormalization. The corresponding expression shows that the renormalized
damping factor can be non-zero even if "bare" one is zero to begin with.
Conversely, the noncommuatative parameter $\theta$, taken to be a free one now,
can be fine-tuned to get a vanishing renormalized damping factor. This
indicates a duality between dissipative commutative theory and non-dissipative
noncommutative theory.
| quant-ph hep-th | quantum effects on a pair of bateman oscillators embedded in an ambient noncommutative space moyal plane is analyzed using both path integral and canonical quantization schemes within the framework of hilbertschmidt operator formulation we adopt a method which is distinct from the one which employs t hoofts scheme of quantization carried out earlier in the literature where the ambient space was taken to be commutative our quantization shows that we end up finally again with a bateman system except that the damping factor undergoes renormalization the corresponding expression shows that the renormalized damping factor can be nonzero even if bare one is zero to begin with conversely the noncommuatative parameter theta taken to be a free one now can be finetuned to get a vanishing renormalized damping factor this indicates a duality between dissipative commutative theory and nondissipative noncommutative theory | [['quantum', 'effects', 'on', 'a', 'pair', 'of', 'bateman', 'oscillators', 'embedded', 'in', 'an', 'ambient', 'noncommutative', 'space', 'moyal', 'plane', 'is', 'analyzed', 'using', 'both', 'path', 'integral', 'and', 'canonical', 'quantization', 'schemes', 'within', 'the', 'framework', 'of', 'hilbertschmidt', 'operator', 'formulation', 'we', 'adopt', 'a', 'method', 'which', 'is', 'distinct', 'from', 'the', 'one', 'which', 'employs', 't', 'hoofts', 'scheme', 'of', 'quantization', 'carried', 'out', 'earlier', 'in', 'the', 'literature', 'where', 'the', 'ambient', 'space', 'was', 'taken', 'to', 'be', 'commutative', 'our', 'quantization', 'shows', 'that', 'we', 'end', 'up', 'finally', 'again', 'with', 'a', 'bateman', 'system', 'except', 'that', 'the', 'damping', 'factor', 'undergoes', 'renormalization', 'the', 'corresponding', 'expression', 'shows', 'that', 'the', 'renormalized', 'damping', 'factor', 'can', 'be', 'nonzero', 'even', 'if', 'bare', 'one', 'is', 'zero', 'to', 'begin', 'with', 'conversely', 'the', 'noncommuatative', 'parameter', 'theta', 'taken', 'to', 'be', 'a', 'free', 'one', 'now', 'can', 'be', 'finetuned', 'to', 'get', 'a', 'vanishing', 'renormalized', 'damping', 'factor', 'this', 'indicates', 'a', 'duality', 'between', 'dissipative', 'commutative', 'theory', 'and', 'nondissipative', 'noncommutative', 'theory']] | [-0.16114126975319798, 0.1637718806164917, -0.14630869295943877, 0.048775159088867925, -0.07813410256761495, -0.17889059261961593, 0.021263343779530992, 0.337887709652134, -0.28281059217967575, -0.22213009930477082, 0.04869648783338732, -0.2416487410396552, -0.15520147370884743, 0.16989082791139004, -0.05750725769752757, -0.0156668172278207, 0.037171627900717284, 0.07742262369510886, -0.125130878443153, -0.25562625455087146, 0.34373211496167905, 0.054564071245484805, 0.2448096008864131, 0.02174453413207754, 0.1139513170815629, 0.004065466055337912, -0.006833008105243496, 0.06331183276894643, -0.12778601802381137, 0.04707582665292426, 0.22945605321425488, 0.01677963240474141, 0.25175001479437403, -0.3752008552843933, -0.20804007923299206, 0.0743144817194707, 0.12833375639111314, 0.10604381048381864, 0.014790021103455873, -0.26673908801682344, 0.06039457860569848, -0.2150252990009223, -0.13884845410185537, -0.07839767819123088, -0.009561998113025006, -0.09348472520012222, -0.2830269340184524, 0.0647803902853843, 0.04774703167332001, 0.020231878827158496, -0.05861619092346498, -0.0776554186729607, -0.014439020173543756, 0.10009784736878259, 0.019592285695194313, 0.0919961182554688, 0.12706103543047426, -0.04666684224377487, -0.07059742105293938, 0.3628685114128019, -0.09066831256914548, -0.2377709846126197, 0.11536386665526321, -0.15496542979125605, -0.10266343835848483, 0.12498870301026878, 0.06188132162306377, 0.10985089879375783, -0.12079447791610154, 0.14848432657325628, -0.03038576292209059, 0.1446956050910538, 0.07792211021129176, 0.017412079246915717, 0.14947548099080973, 0.09995747089600392, 0.055326089376865104, 0.1509353916086223, -0.030770014185063112, -0.15568591367282483, -0.3569003948941827, -0.13904148260660792, -0.16509536488346835, 0.12765762935352357, -0.10026333631303584, -0.15368187576264358, 0.32857484373074214, 0.11954380359949557, 0.2001490029204878, 0.00691952910307768, 0.27758862102310433, 0.1879532979939488, 0.10076901106760174, 0.06924233715579235, 0.2415895717463074, 0.17319247148354813, 0.06194338037652506, -0.21900592163278848, -0.05110023730361613, 0.13578760883395674] |
1,803.03335 | On Curvature Driven Rotational Diffusion of Protein on Membrane Surface | Morphological dynamics of bilayer membrane is intrinsically coupled to the
translational and orientational localization of membrane proteins. In this
paper we are concerned with the orientational localization of membrane proteins
in the absence of protein interaction and correlation. Entropic energy
depending on the angular distribution function and the curvature energy
depending on the principal curvature vectors are introduced to assemble an
energy functional for the coupled system. Application of the Onsager's
variational principle gives rise to a generalized Smoluchowskii equation
governing the temporal and angular variations of the protein orientation. We
prove the existence of the stationary solution of the equation as fixed points
of a continuous nonlinear nonlocal map, and for biologically relevant
conditions we obtain the uniqueness of the solution. To approximate the
stationary solution in the Fourier space we construct an efficient numerical
method that reduces the expansion and relates the coefficients to the modified
Bessel functions of the first kind. Existence and uniqueness of the numerical
solution are justified for biologically relevant conditions.
| q-bio.QM math.CA math.NA | morphological dynamics of bilayer membrane is intrinsically coupled to the translational and orientational localization of membrane proteins in this paper we are concerned with the orientational localization of membrane proteins in the absence of protein interaction and correlation entropic energy depending on the angular distribution function and the curvature energy depending on the principal curvature vectors are introduced to assemble an energy functional for the coupled system application of the onsagers variational principle gives rise to a generalized smoluchowskii equation governing the temporal and angular variations of the protein orientation we prove the existence of the stationary solution of the equation as fixed points of a continuous nonlinear nonlocal map and for biologically relevant conditions we obtain the uniqueness of the solution to approximate the stationary solution in the fourier space we construct an efficient numerical method that reduces the expansion and relates the coefficients to the modified bessel functions of the first kind existence and uniqueness of the numerical solution are justified for biologically relevant conditions | [['morphological', 'dynamics', 'of', 'bilayer', 'membrane', 'is', 'intrinsically', 'coupled', 'to', 'the', 'translational', 'and', 'orientational', 'localization', 'of', 'membrane', 'proteins', 'in', 'this', 'paper', 'we', 'are', 'concerned', 'with', 'the', 'orientational', 'localization', 'of', 'membrane', 'proteins', 'in', 'the', 'absence', 'of', 'protein', 'interaction', 'and', 'correlation', 'entropic', 'energy', 'depending', 'on', 'the', 'angular', 'distribution', 'function', 'and', 'the', 'curvature', 'energy', 'depending', 'on', 'the', 'principal', 'curvature', 'vectors', 'are', 'introduced', 'to', 'assemble', 'an', 'energy', 'functional', 'for', 'the', 'coupled', 'system', 'application', 'of', 'the', 'onsagers', 'variational', 'principle', 'gives', 'rise', 'to', 'a', 'generalized', 'smoluchowskii', 'equation', 'governing', 'the', 'temporal', 'and', 'angular', 'variations', 'of', 'the', 'protein', 'orientation', 'we', 'prove', 'the', 'existence', 'of', 'the', 'stationary', 'solution', 'of', 'the', 'equation', 'as', 'fixed', 'points', 'of', 'a', 'continuous', 'nonlinear', 'nonlocal', 'map', 'and', 'for', 'biologically', 'relevant', 'conditions', 'we', 'obtain', 'the', 'uniqueness', 'of', 'the', 'solution', 'to', 'approximate', 'the', 'stationary', 'solution', 'in', 'the', 'fourier', 'space', 'we', 'construct', 'an', 'efficient', 'numerical', 'method', 'that', 'reduces', 'the', 'expansion', 'and', 'relates', 'the', 'coefficients', 'to', 'the', 'modified', 'bessel', 'functions', 'of', 'the', 'first', 'kind', 'existence', 'and', 'uniqueness', 'of', 'the', 'numerical', 'solution', 'are', 'justified', 'for', 'biologically', 'relevant', 'conditions']] | [-0.1514955881018057, 0.08008602642645661, -0.08027490534741118, 0.06367432640259524, -0.06253061586491629, -0.08829371486432817, -0.022632259801899767, 0.3328284866524389, -0.30066901832504805, -0.2373367149876543, 0.06711257715128834, -0.2524006698864052, -0.18830233355086431, 0.14576822061074832, -0.01560578508728958, 0.08703136135521064, 0.028766256510223968, 0.0340177434488166, -0.06112863379390349, -0.1661961278261011, 0.32418940117560235, 0.030723303429507482, 0.27468718867748976, 0.0721142498737044, 0.16985253811847553, -0.003038761857476265, -0.007569416679991746, -0.00021224356475931379, -0.2099626288451314, 0.15226822744785662, 0.1915444077489791, 0.056424455954244425, 0.2585064888628851, -0.4362103156184396, -0.20124632129950606, 0.0957422804140699, 0.12774750570407564, 0.13041514841031776, -0.011769214518093336, -0.2729069701990629, 0.06873816379881745, -0.09250287828316171, -0.17802470981940088, -0.11478928228593376, 0.011537207918892423, 0.09590351362207747, -0.27377622918869615, 0.17763974564149976, 0.06560183873018587, 0.023388017861015468, -0.18132844142873872, -0.05376705753053146, -0.04834949462295858, 0.11262222190376327, 0.07828711814118033, -0.008200514114865786, 0.13185124922296906, -0.1323663774942306, -0.05975277947103436, 0.34910325775012735, -0.05080589239277978, -0.2929174169583852, 0.16986481388133154, -0.09281539704358902, -0.12026192882681737, 0.15164100715479567, 0.14776213117033601, 0.14033704821626286, -0.15977924639157143, 0.09150984084425796, -0.017600290687664985, 0.17834545737020222, 0.10512607368775251, 0.027938076844775533, 0.16338996869422137, 0.14629769489079356, 0.11074567538495343, 0.17214288652021753, -0.07134810922925461, -0.13997315687228398, -0.33330170106961876, -0.1835034021922578, -0.19647313463108906, 0.06208020059044013, -0.1363503460496901, -0.21265266044626394, 0.424664870081245, 0.11557231801113181, 0.1684457725531096, 0.06802650720599186, 0.21434128832167396, 0.13606399449124282, 0.00396077308792576, 0.006712024495656411, 0.2239222025263112, 0.16016910145625876, 0.10560579715767898, -0.2813516230398161, 0.04379323731016659, 0.11572393484929779] |
1,803.03336 | The extended minimal geometric deformation of SU($N$) dark glueball
condensates | The extended minimal geometric deformation (EMGD) procedure, in the
holographic membrane paradigm, is employed to model stellar distributions that
arise upon self-interacting scalar glueball dark matter condensation. Such
scalar glueballs are SU($N$) Yang-Mills hidden sectors beyond the Standard
Model. Then, corrections to the gravitational wave radiation, emitted by
SU($N$) EMGD dark glueball stars mergers, are derived, and their respective
spectra are studied in the EMGD framework, due to a phenomenological brane
tension with finite value. The bulk Weyl fluid that drives the EMGD is then
proposed to be experimentally detected by enhanced windows at the eLISA and
LIGO.
| hep-th gr-qc | the extended minimal geometric deformation emgd procedure in the holographic membrane paradigm is employed to model stellar distributions that arise upon selfinteracting scalar glueball dark matter condensation such scalar glueballs are sun yangmills hidden sectors beyond the standard model then corrections to the gravitational wave radiation emitted by sun emgd dark glueball stars mergers are derived and their respective spectra are studied in the emgd framework due to a phenomenological brane tension with finite value the bulk weyl fluid that drives the emgd is then proposed to be experimentally detected by enhanced windows at the elisa and ligo | [['the', 'extended', 'minimal', 'geometric', 'deformation', 'emgd', 'procedure', 'in', 'the', 'holographic', 'membrane', 'paradigm', 'is', 'employed', 'to', 'model', 'stellar', 'distributions', 'that', 'arise', 'upon', 'selfinteracting', 'scalar', 'glueball', 'dark', 'matter', 'condensation', 'such', 'scalar', 'glueballs', 'are', 'sun', 'yangmills', 'hidden', 'sectors', 'beyond', 'the', 'standard', 'model', 'then', 'corrections', 'to', 'the', 'gravitational', 'wave', 'radiation', 'emitted', 'by', 'sun', 'emgd', 'dark', 'glueball', 'stars', 'mergers', 'are', 'derived', 'and', 'their', 'respective', 'spectra', 'are', 'studied', 'in', 'the', 'emgd', 'framework', 'due', 'to', 'a', 'phenomenological', 'brane', 'tension', 'with', 'finite', 'value', 'the', 'bulk', 'weyl', 'fluid', 'that', 'drives', 'the', 'emgd', 'is', 'then', 'proposed', 'to', 'be', 'experimentally', 'detected', 'by', 'enhanced', 'windows', 'at', 'the', 'elisa', 'and', 'ligo']] | [-0.0756816209426948, 0.26286331388852274, -0.10826135796823834, 0.15522699294301767, -0.1139671205310151, -0.13237371903426032, -0.039164081529467085, 0.32454548712952863, -0.19326645066030324, -0.3030938443689778, 0.006257408050278544, -0.29303438615586075, -0.10310513669938533, 0.10026858702815157, 0.01920105195224133, 0.06975725778658894, -0.008166622990571266, -0.0017053746375996544, -0.0254109059650527, -0.23633276151816304, 0.3067748925496577, 0.04866745929252737, 0.21837458602266804, 0.03351549962559259, 0.04515169253952953, -0.055271301684635024, -0.02165328070274269, -0.028038933953954553, -0.15385371294393493, 0.03314705533260594, 0.21744766946863003, 0.08958563857179667, 0.12106592185339149, -0.42006990705065583, -0.29455976602645134, 0.11227026389322567, 0.16920366241330548, 0.11423286780410884, -0.047864086526845186, -0.3424967205227942, 0.08328932974183438, -0.22254584265198102, -0.15330578981689652, -0.028787926668586324, -0.016163701096511617, -0.0876472717844786, -0.21570650936218397, 0.10843429255313525, -0.052884226997515986, -0.051936396288362385, -0.09214278474469118, -0.09947355758108921, -0.09758812940337372, 0.0020723781234831835, 0.1367214315693246, 0.05496221715917012, 0.24353560516420675, -0.17739860060605772, -0.08776302571284908, 0.392536250608308, -0.14343733494455108, -0.1674722181443049, 0.15363824164152753, -0.11901459682314676, -0.10094167271685996, 0.1273580525754666, 0.11366407793164919, 0.11063105611270768, -0.13705404682503064, 0.13733574884767852, 0.009375224707378503, 0.13880459070965953, 0.10895265265824083, 0.052505413146347414, 0.3694529085971263, 0.09181804087473916, -0.025978248642415415, 0.10247551352712231, -0.08278726649527647, -0.12200193394840296, -0.34187999571084365, -0.08946175927804707, -0.15726440202216713, 0.005302796658688006, -0.11894616539731422, -0.12312214619156961, 0.3326512929337213, 0.10339673688606721, 0.1263359420723757, 0.026717134131289715, 0.266659782776533, 0.08319749822008557, 0.07118991434298531, 0.036073252416158816, 0.36015211886308174, 0.20014382611332956, 0.1147125807961411, -0.2566334536983346, -0.07930992219397533, 0.08921861713657117] |
1,803.03337 | [Regularity of interfaces for a Pucci type segregation problem | We show the existence of a Lipschitz viscosity solution $u$ in $\Omega$ to a
system of fully nonlinear equations involving Pucci-type operators. We study
the regularity of the interface $\partial \{ u> 0 \}\cap\Om$ and we show that
the viscosity inequalities of the system imply, in the weak sense, the free
boundary condition $u^{+}_{\nu_{+}} = u^{-}_{\nu_{-}}$, and hence $u$ is a
solution to a two-phase free boundary problem. We show that we can apply the
classical method of sup-convolutions developed by the first author in
\cite{caffarelli_harnack_1987,caffarelli_harnack_1989}, and generalized by Wang
\cite{wang_regularity_2000,wang_regularity_2002} and Feldman \cite{Fel} to
fully nonlinear operators, to conclude that the regular points in $\partial \{
u> 0 \}\cap\Om$ form an open set of class $C^{1,\alpha}$. A novelty in our
problem is that we have different operators, $\puccip$ and $\puccin$, on each
side of the free boundary. In the particular case when these operators are the
Pucci's extremal operators $\ppuccip$ and $\ppuccin$, our results provide an
alternative approach to obtain the stationary limit %proof of existence to the
one obtained from of a segregation model of populations with nonlinear
diffusion in \cite{quitalo_free_2013}.
| math.AP | we show the existence of a lipschitz viscosity solution u in omega to a system of fully nonlinear equations involving puccitype operators we study the regularity of the interface partial u 0 capom and we show that the viscosity inequalities of the system imply in the weak sense the free boundary condition u_nu_ u_nu_ and hence u is a solution to a twophase free boundary problem we show that we can apply the classical method of supconvolutions developed by the first author in citecaffarelli_harnack_1987caffarelli_harnack_1989 and generalized by wang citewang_regularity_2000wang_regularity_2002 and feldman citefel to fully nonlinear operators to conclude that the regular points in partial u 0 capom form an open set of class c1alpha a novelty in our problem is that we have different operators puccip and puccin on each side of the free boundary in the particular case when these operators are the puccis extremal operators ppuccip and ppuccin our results provide an alternative approach to obtain the stationary limit proof of existence to the one obtained from of a segregation model of populations with nonlinear diffusion in citequitalo_free_2013 | [['we', 'show', 'the', 'existence', 'of', 'a', 'lipschitz', 'viscosity', 'solution', 'u', 'in', 'omega', 'to', 'a', 'system', 'of', 'fully', 'nonlinear', 'equations', 'involving', 'puccitype', 'operators', 'we', 'study', 'the', 'regularity', 'of', 'the', 'interface', 'partial', 'u', '0', 'capom', 'and', 'we', 'show', 'that', 'the', 'viscosity', 'inequalities', 'of', 'the', 'system', 'imply', 'in', 'the', 'weak', 'sense', 'the', 'free', 'boundary', 'condition', 'u_nu_', 'u_nu_', 'and', 'hence', 'u', 'is', 'a', 'solution', 'to', 'a', 'twophase', 'free', 'boundary', 'problem', 'we', 'show', 'that', 'we', 'can', 'apply', 'the', 'classical', 'method', 'of', 'supconvolutions', 'developed', 'by', 'the', 'first', 'author', 'in', 'citecaffarelli_harnack_1987caffarelli_harnack_1989', 'and', 'generalized', 'by', 'wang', 'citewang_regularity_2000wang_regularity_2002', 'and', 'feldman', 'citefel', 'to', 'fully', 'nonlinear', 'operators', 'to', 'conclude', 'that', 'the', 'regular', 'points', 'in', 'partial', 'u', '0', 'capom', 'form', 'an', 'open', 'set', 'of', 'class', 'c1alpha', 'a', 'novelty', 'in', 'our', 'problem', 'is', 'that', 'we', 'have', 'different', 'operators', 'puccip', 'and', 'puccin', 'on', 'each', 'side', 'of', 'the', 'free', 'boundary', 'in', 'the', 'particular', 'case', 'when', 'these', 'operators', 'are', 'the', 'puccis', 'extremal', 'operators', 'ppuccip', 'and', 'ppuccin', 'our', 'results', 'provide', 'an', 'alternative', 'approach', 'to', 'obtain', 'the', 'stationary', 'limit', 'proof', 'of', 'existence', 'to', 'the', 'one', 'obtained', 'from', 'of', 'a', 'segregation', 'model', 'of', 'populations', 'with', 'nonlinear', 'diffusion', 'in', 'citequitalo_free_2013']] | [-0.1303302348838244, 0.05064122543087459, -0.07234589721592345, 0.02751278966603554, -0.058913656573529434, -0.11402163232665465, 0.027075430557849896, 0.3113868726888694, -0.3190671149192445, -0.22370061022229493, 0.1307611627713216, -0.30231012423040277, -0.14949385457144804, 0.17543973151316686, -0.0638978560314884, 0.06678323831734617, 0.06655190202143851, 0.03551628706147137, -0.06162981849713588, -0.2226075001498572, 0.4063685045490625, -0.07400989780800013, 0.21180906421392706, 0.09125908787912095, 0.09819059269166136, -0.02628755517281502, 0.00793496621506154, 0.03959254643049495, -0.16828149467715797, 0.12324480862070593, 0.20915328715759587, 0.07680044163029685, 0.2946450858747205, -0.41111048764874597, -0.213679267149643, 0.09341346999877188, 0.1130263154697885, 0.09101309880883579, -0.042773314856177934, -0.28936874830438924, 0.11548532231736097, -0.12264666574760284, -0.18055740964503578, -0.04679826310420611, 0.01425486900114331, 0.03801807773955929, -0.32521358695644215, 0.10542846751309572, 0.10753207376748548, -0.009880743014025894, -0.14354553021187613, -0.0864434008590361, -0.03455127697544599, 0.10379611019340361, 0.02751646555626361, 0.026232024078279823, 0.021127340961696512, -0.11731604448833828, -0.07703468578107409, 0.32636509925486096, -0.10441093908129148, -0.2766130937106279, 0.19980533237580256, -0.18529807561896292, -0.11469143975234355, 0.06629688245123701, 0.14578531261432512, 0.1813383831401322, -0.15485251737179598, 0.14789207127150036, -0.08923310164084479, 0.13829672725026843, 0.05132255488333393, -0.006714813697365034, 0.08647772767973771, 0.11577738420925586, 0.1509626665593024, 0.15647394962591984, -0.011388736448800528, -0.06895443859386695, -0.3553034068612629, -0.16536599475082503, -0.12481865750244224, 0.06866572580737881, -0.08082731289586406, -0.19913928942328477, 0.36484844463523924, 0.16198302938775383, 0.1975044504660799, 0.0537836804568027, 0.213693249412442, 0.16526899943824266, 0.0072936559662626806, 0.0928486141892352, 0.2065274637018566, 0.13134471554567206, 0.10194037270911756, -0.21921364053191775, 0.015058662759207458, 0.16005778724484773] |
1,803.03338 | Probing the density dependence of the symmetry energy by nucleon flow | In the framework of the isospin-dependent Boltzmann-Uehling-Uhlenbeck
transport model, sensitive regions of some nucleon observables to the nuclear
symmetry energy are studied. It is found that the symmetry energy sensitive
observable n/p ratio in the $^{132}$Sn+$^{124}$Sn reaction at 0.3 GeV/nucleon
in fact just probes the density-dependent symmetry energy below the density of
$1.5\rho_0$ and effectively probes the density-dependent symmetry energy around
or somewhat below the saturation density. Nucleon elliptic flow can probe the
symmetry energy from the low-density region to the high-density region when
changing the incident beam energies from 0.3 to 0.6 GeV/nucleon in the
semi-central $^{132}$Sn+$^{124}$Sn reaction. And nucleon transverse and
elliptic flows in the semi-central $^{197}$Au+$^{197}$Au reaction at 0.6
GeV/nucleon are more sensitive to the high-density behavior of the nuclear
symmetry energy. One thus concludes that nucleon observables in the heavy
reaction system and with higher incident beam energy are more suitable to be
used to probe the high-density behavior of the symmetry energy. The present
study may help one to get more specific information about the density-dependent
symmetry energy from nucleon flow observable in heavy-ion collisions at
intermediate energies.
| nucl-th nucl-ex | in the framework of the isospindependent boltzmannuehlinguhlenbeck transport model sensitive regions of some nucleon observables to the nuclear symmetry energy are studied it is found that the symmetry energy sensitive observable np ratio in the 132sn124sn reaction at 03 gevnucleon in fact just probes the densitydependent symmetry energy below the density of 15rho_0 and effectively probes the densitydependent symmetry energy around or somewhat below the saturation density nucleon elliptic flow can probe the symmetry energy from the lowdensity region to the highdensity region when changing the incident beam energies from 03 to 06 gevnucleon in the semicentral 132sn124sn reaction and nucleon transverse and elliptic flows in the semicentral 197au197au reaction at 06 gevnucleon are more sensitive to the highdensity behavior of the nuclear symmetry energy one thus concludes that nucleon observables in the heavy reaction system and with higher incident beam energy are more suitable to be used to probe the highdensity behavior of the symmetry energy the present study may help one to get more specific information about the densitydependent symmetry energy from nucleon flow observable in heavyion collisions at intermediate energies | [['in', 'the', 'framework', 'of', 'the', 'isospindependent', 'boltzmannuehlinguhlenbeck', 'transport', 'model', 'sensitive', 'regions', 'of', 'some', 'nucleon', 'observables', 'to', 'the', 'nuclear', 'symmetry', 'energy', 'are', 'studied', 'it', 'is', 'found', 'that', 'the', 'symmetry', 'energy', 'sensitive', 'observable', 'np', 'ratio', 'in', 'the', '132sn124sn', 'reaction', 'at', '03', 'gevnucleon', 'in', 'fact', 'just', 'probes', 'the', 'densitydependent', 'symmetry', 'energy', 'below', 'the', 'density', 'of', '15rho_0', 'and', 'effectively', 'probes', 'the', 'densitydependent', 'symmetry', 'energy', 'around', 'or', 'somewhat', 'below', 'the', 'saturation', 'density', 'nucleon', 'elliptic', 'flow', 'can', 'probe', 'the', 'symmetry', 'energy', 'from', 'the', 'lowdensity', 'region', 'to', 'the', 'highdensity', 'region', 'when', 'changing', 'the', 'incident', 'beam', 'energies', 'from', '03', 'to', '06', 'gevnucleon', 'in', 'the', 'semicentral', '132sn124sn', 'reaction', 'and', 'nucleon', 'transverse', 'and', 'elliptic', 'flows', 'in', 'the', 'semicentral', '197au197au', 'reaction', 'at', '06', 'gevnucleon', 'are', 'more', 'sensitive', 'to', 'the', 'highdensity', 'behavior', 'of', 'the', 'nuclear', 'symmetry', 'energy', 'one', 'thus', 'concludes', 'that', 'nucleon', 'observables', 'in', 'the', 'heavy', 'reaction', 'system', 'and', 'with', 'higher', 'incident', 'beam', 'energy', 'are', 'more', 'suitable', 'to', 'be', 'used', 'to', 'probe', 'the', 'highdensity', 'behavior', 'of', 'the', 'symmetry', 'energy', 'the', 'present', 'study', 'may', 'help', 'one', 'to', 'get', 'more', 'specific', 'information', 'about', 'the', 'densitydependent', 'symmetry', 'energy', 'from', 'nucleon', 'flow', 'observable', 'in', 'heavyion', 'collisions', 'at', 'intermediate', 'energies']] | [-0.08736901064109119, 0.25206750609200695, -0.11500241231380522, 0.13583630522531406, 0.002380273949641448, -0.10680598739002432, -0.026616362995560187, 0.3407818179905087, -0.24596808384592225, -0.3463374491023657, -0.03144264516643259, -0.34606791395120895, 0.08086759784990656, 0.10684951156080998, 0.08600109649769665, 0.05356583484847631, 0.01668387529143429, 0.055917745060799134, -0.07694285914332576, -0.10222116552016974, 0.32532468119605473, 0.13861818596270387, 0.2521456663322809, 0.18071251072931094, 0.04228769241740088, 0.013237344492533868, 0.05671279088102772, -0.05483811620717541, -0.1670597465917536, 0.059507424153987534, 0.29295479788465406, -0.020479921740223908, 0.13392946586028193, -0.4346697077891984, -0.19299558678560041, 0.08761789604949836, 0.1305400106446961, 0.12734442889936023, -0.05285338556403896, -0.2463741149129039, 0.0594074692945559, -0.20523004656386368, -0.19206296958561456, -0.04956275738320303, -0.029442672358037762, 0.03918389800889929, -0.2538513436012871, 0.16014414245856332, -0.03520775738602074, 0.03863250966705791, -0.05942619909982678, -0.17977679717791994, -0.10960823228291063, 0.007400688565122527, 0.09054936370383794, 0.08066324031000936, 0.2416423622846276, -0.17069532214420857, 0.002149708088037077, 0.4183789214712905, 0.02361280512023758, -0.13331415986253337, 0.12919529347557698, -0.20692260442096944, -0.13577635673765134, 0.2177423046963228, 0.21981228125498473, 0.10321589276913533, -0.17839320292250205, 0.027722386803201677, 0.02128752493197201, 0.17910088812625344, 0.10405351752530435, 0.060117175904931604, 0.1588433096262084, 0.16776364780629852, 0.056221314951531834, 0.04751780325646645, -0.11822216535130373, -0.12276832566847308, -0.3203450871559863, -0.051138881437869356, -0.1233733796922664, 0.08286882182685557, -0.07919159916659388, 0.0073799410231083955, 0.38013127519605827, 0.08784485660478342, 0.22682870881232833, -0.08017898254751504, 0.274794453352045, 0.1028393492624573, 0.09278698564354512, 0.09893652560332647, 0.295327384007748, 0.1707877510452418, 0.18479664018889377, -0.28124416521673634, 0.027600665502557225, -0.0001973837260975615] |
1,803.03339 | On $k$-error linear complexity of pseudorandom binary sequences derived
from Euler quotients | We investigate the $k$-error linear complexity of pseudorandom binary
sequences of period $p^{\mathfrak{r}}$ derived from the Euler quotients modulo
$p^{\mathfrak{r}-1}$, a power of an odd prime $p$ for $\mathfrak{r}\geq 2$.
When $\mathfrak{r}=2$, this is just the case of polynomial quotients (including
Fermat quotients) modulo $p$, which has been studied in an earlier work of
Chen, Niu and Wu. In this work, we establish a recursive relation on the
$k$-error linear complexity of the sequences for the case of $\mathfrak{r}\geq
3$. We also state the exact values of the $k$-error linear complexity for the
case of $\mathfrak{r}=3$. From the results, we can find that the $k$-error
linear complexity of the sequences (of period $p^{\mathfrak{r}}$) does not
decrease dramatically for $k<p^{\mathfrak{r}-2}(p-1)^2/2$.
| cs.CR math.NT | we investigate the kerror linear complexity of pseudorandom binary sequences of period pmathfrakr derived from the euler quotients modulo pmathfrakr1 a power of an odd prime p for mathfrakrgeq 2 when mathfrakr2 this is just the case of polynomial quotients including fermat quotients modulo p which has been studied in an earlier work of chen niu and wu in this work we establish a recursive relation on the kerror linear complexity of the sequences for the case of mathfrakrgeq 3 we also state the exact values of the kerror linear complexity for the case of mathfrakr3 from the results we can find that the kerror linear complexity of the sequences of period pmathfrakr does not decrease dramatically for kpmathfrakr2p122 | [['we', 'investigate', 'the', 'kerror', 'linear', 'complexity', 'of', 'pseudorandom', 'binary', 'sequences', 'of', 'period', 'pmathfrakr', 'derived', 'from', 'the', 'euler', 'quotients', 'modulo', 'pmathfrakr1', 'a', 'power', 'of', 'an', 'odd', 'prime', 'p', 'for', 'mathfrakrgeq', '2', 'when', 'mathfrakr2', 'this', 'is', 'just', 'the', 'case', 'of', 'polynomial', 'quotients', 'including', 'fermat', 'quotients', 'modulo', 'p', 'which', 'has', 'been', 'studied', 'in', 'an', 'earlier', 'work', 'of', 'chen', 'niu', 'and', 'wu', 'in', 'this', 'work', 'we', 'establish', 'a', 'recursive', 'relation', 'on', 'the', 'kerror', 'linear', 'complexity', 'of', 'the', 'sequences', 'for', 'the', 'case', 'of', 'mathfrakrgeq', '3', 'we', 'also', 'state', 'the', 'exact', 'values', 'of', 'the', 'kerror', 'linear', 'complexity', 'for', 'the', 'case', 'of', 'mathfrakr3', 'from', 'the', 'results', 'we', 'can', 'find', 'that', 'the', 'kerror', 'linear', 'complexity', 'of', 'the', 'sequences', 'of', 'period', 'pmathfrakr', 'does', 'not', 'decrease', 'dramatically', 'for', 'kpmathfrakr2p122']] | [-0.17321966120318785, 0.06667573591258989, -0.08657319260643678, 0.04767121037631925, -0.022648388259784057, -0.08348051968307511, 0.04507762730658591, 0.27111950974810767, -0.32375233292344724, -0.27261470861917547, 0.09822425563182044, -0.25312314391123586, -0.15939545093171364, 0.2514710968679136, -0.12268471237070658, 0.10862845976678089, 0.012398055586796086, 0.09794258240711044, -0.11826512876788976, -0.360196084464766, 0.33004517051147986, 0.03879293697038749, 0.20848858335500095, -0.013954706892773911, 0.08462679872775937, 0.041030561660525496, -0.027392727289839672, 0.008470668667205819, -0.16347898747846704, 0.07669990646090728, 0.28763158879502937, 0.12522694271955606, 0.243383375273363, -0.378475604645975, -0.14180514363253172, 0.1812479269422322, 0.14133670050986447, 0.08877005275687086, -0.018816384542439772, -0.1733433732098002, 0.13063796020641522, -0.15947013901261328, -0.09861724155845943, -0.021940472728765762, 0.10800995467952243, 0.08368714822053507, -0.27904076347765217, 0.024939114416410373, 0.17280396294511585, 0.13055912183748708, -0.0571596127565581, -0.16930284942626148, 0.010691583114634227, 0.07085921160110088, 0.03735239438603523, 0.012695805563985764, -0.03141124943808258, -0.1067942936804045, -0.15036387590959938, 0.3459203297205202, -0.0399357507064066, -0.18078317462995247, 0.13214835765150687, -0.1721098970470799, -0.18687610379797784, 0.13732952684130487, 0.16128892537944758, 0.15336602150991158, -0.004965070876956766, 0.18036409148575133, -0.09765274614632667, 0.20438291789410082, 0.1406131800146656, 0.011947672218419947, 0.09980665006347604, 0.11149084141587016, 0.031610381485357344, 0.20794258088813172, -0.051660146964881734, -0.049401374101672356, -0.27167604697725595, -0.17787835894987356, -0.1772619969219909, 0.09476977019785245, -0.10424947954684408, -0.14184999629553105, 0.4160865683544863, 0.04919140596259469, 0.1599479826452496, 0.20013219583884453, 0.22755713128224686, 0.14881793317292724, 0.0065691790122408755, 0.05810174875450111, 0.1775129717682396, 0.16264273805191387, 0.03591569388906161, -0.24784113797317217, 0.05678310525930814, 0.15124359471001872] |
1,803.0334 | Gravitationally unstable condensations revealed by ALMA in the TUKH122
prestellar core in the Orion A cloud | We have investigated the TUKH122 prestellar core in the Orion A cloud using
ALMA 3 mm dust continuum, N$_2$H$^+$ ($J=1-0$), and CH$_3$OH ($J_K=2_K-1_K$)
molecular line observations. Previous studies showed that TUKH122 is likely on
the verge of star formation because the turbulence is almost dissipated and
chemically evolved among other starless cores in the Orion A cloud. By
combining ALMA 12-m and ACA data, we recover extended emission with a
resolution of $\sim5"$ corresponding to 0.01 pc and identify 6 condensations
with a mass range of $0.1-0.4$ $M_\odot$ and a radius of $\lesssim0.01$ pc.
These condensations are gravitationally bound following a virial analysis and
are embedded in the filament including the elongated core with a mass of
$\sim29$ $M_\odot$ and a radial density profile of $r^{-1.6}$ derived by {\it
Herschel}. The separation of these condensations is $\sim0.035$ pc, consistent
with the thermal jeans length at a density of $4.4\times10^5$ cm$^{-3}$. This
density is similar to the central part of the core. We also find a tendency
that the N$_2$H$^+$ molecule seems to deplete at the dust peak condensation.
This condensation may be beginning to collapse because the linewidth becomes
broader. Therefore, the fragmentation still occurs in the prestellar core by
thermal Jeans instability and multiple stars are formed within the TUKH122
prestellar core. The CH$_3$OH emission shows a large shell-like distribution
and surrounds these condensations, suggesting that the CH$_3$OH molecule formed
on dust grains is released into gas phase by non-thermal desorption such as
photoevaporation caused by cosmic-ray induced UV radiation.
| astro-ph.GA | we have investigated the tukh122 prestellar core in the orion a cloud using alma 3 mm dust continuum n_2h j10 and ch_3oh j_k2_k1_k molecular line observations previous studies showed that tukh122 is likely on the verge of star formation because the turbulence is almost dissipated and chemically evolved among other starless cores in the orion a cloud by combining alma 12m and aca data we recover extended emission with a resolution of sim5 corresponding to 001 pc and identify 6 condensations with a mass range of 0104 m_odot and a radius of lesssim001 pc these condensations are gravitationally bound following a virial analysis and are embedded in the filament including the elongated core with a mass of sim29 m_odot and a radial density profile of r16 derived by it herschel the separation of these condensations is sim0035 pc consistent with the thermal jeans length at a density of 44times105 cm3 this density is similar to the central part of the core we also find a tendency that the n_2h molecule seems to deplete at the dust peak condensation this condensation may be beginning to collapse because the linewidth becomes broader therefore the fragmentation still occurs in the prestellar core by thermal jeans instability and multiple stars are formed within the tukh122 prestellar core the ch_3oh emission shows a large shelllike distribution and surrounds these condensations suggesting that the ch_3oh molecule formed on dust grains is released into gas phase by nonthermal desorption such as photoevaporation caused by cosmicray induced uv radiation | [['we', 'have', 'investigated', 'the', 'tukh122', 'prestellar', 'core', 'in', 'the', 'orion', 'a', 'cloud', 'using', 'alma', '3', 'mm', 'dust', 'continuum', 'n_2h', 'j10', 'and', 'ch_3oh', 'j_k2_k1_k', 'molecular', 'line', 'observations', 'previous', 'studies', 'showed', 'that', 'tukh122', 'is', 'likely', 'on', 'the', 'verge', 'of', 'star', 'formation', 'because', 'the', 'turbulence', 'is', 'almost', 'dissipated', 'and', 'chemically', 'evolved', 'among', 'other', 'starless', 'cores', 'in', 'the', 'orion', 'a', 'cloud', 'by', 'combining', 'alma', '12m', 'and', 'aca', 'data', 'we', 'recover', 'extended', 'emission', 'with', 'a', 'resolution', 'of', 'sim5', 'corresponding', 'to', '001', 'pc', 'and', 'identify', '6', 'condensations', 'with', 'a', 'mass', 'range', 'of', '0104', 'm_odot', 'and', 'a', 'radius', 'of', 'lesssim001', 'pc', 'these', 'condensations', 'are', 'gravitationally', 'bound', 'following', 'a', 'virial', 'analysis', 'and', 'are', 'embedded', 'in', 'the', 'filament', 'including', 'the', 'elongated', 'core', 'with', 'a', 'mass', 'of', 'sim29', 'm_odot', 'and', 'a', 'radial', 'density', 'profile', 'of', 'r16', 'derived', 'by', 'it', 'herschel', 'the', 'separation', 'of', 'these', 'condensations', 'is', 'sim0035', 'pc', 'consistent', 'with', 'the', 'thermal', 'jeans', 'length', 'at', 'a', 'density', 'of', '44times105', 'cm3', 'this', 'density', 'is', 'similar', 'to', 'the', 'central', 'part', 'of', 'the', 'core', 'we', 'also', 'find', 'a', 'tendency', 'that', 'the', 'n_2h', 'molecule', 'seems', 'to', 'deplete', 'at', 'the', 'dust', 'peak', 'condensation', 'this', 'condensation', 'may', 'be', 'beginning', 'to', 'collapse', 'because', 'the', 'linewidth', 'becomes', 'broader', 'therefore', 'the', 'fragmentation', 'still', 'occurs', 'in', 'the', 'prestellar', 'core', 'by', 'thermal', 'jeans', 'instability', 'and', 'multiple', 'stars', 'are', 'formed', 'within', 'the', 'tukh122', 'prestellar', 'core', 'the', 'ch_3oh', 'emission', 'shows', 'a', 'large', 'shelllike', 'distribution', 'and', 'surrounds', 'these', 'condensations', 'suggesting', 'that', 'the', 'ch_3oh', 'molecule', 'formed', 'on', 'dust', 'grains', 'is', 'released', 'into', 'gas', 'phase', 'by', 'nonthermal', 'desorption', 'such', 'as', 'photoevaporation', 'caused', 'by', 'cosmicray', 'induced', 'uv', 'radiation']] | [-0.09631748756439792, 0.1582612971009615, -0.04426422661274574, 0.05739061484693535, -0.016907974314357664, -0.027220205070578582, 0.011062400672780049, 0.42323130271829396, -0.15456057541849721, -0.306477460957643, 0.06222763985316569, -0.2381695989376655, 0.012185995810620126, 0.08913950489377678, 0.04317269000814356, -0.045638194768534666, 0.06095734221303099, -0.1152535667924601, -0.014913842605423153, -0.1787398162785159, 0.3360669603834169, 0.09937721172783283, 0.14512013945345498, 0.07290199501773215, 0.009284503483344921, -0.22334429184200183, -0.023236205223985316, -0.024013975069993327, -0.17503784364321145, 0.06296519203568741, 0.20976845336225514, 0.10354042678861128, 0.21228839415820286, -0.3994020339140984, -0.26150017731960096, 0.029298860902687716, 0.2146585095474767, 0.03714327232521628, -0.017986527718148276, -0.2873380605259069, 0.07680988834650751, -0.18323386594983598, -0.18132532408532326, 0.09915481786705524, 0.08487207353520658, 0.019732939650214488, -0.2161735789249501, 0.16617798186768684, 0.0022734750011530252, 0.059356092073534046, -0.11062552271253098, -0.15082998611708923, -0.08829504290512094, 0.005305953430868085, -0.02883864035304155, 0.10968586150744569, 0.2872254186246033, -0.10978590621004602, 0.023121124048972683, 0.4286851433308555, -0.08235118943951919, 0.009419899753054543, 0.25037400550377975, -0.19670606579072022, -0.21398640712047176, 0.2420785546175114, 0.06699827537569593, 0.09451160763743363, -0.10440904037597883, -0.054609834985674226, -0.05259653065642793, 0.2532386936166609, 0.11862734253349293, 0.02201810896193849, 0.3783029256174491, 0.13588804589967513, 0.03068955802272314, 0.15747336503996084, -0.240155823318468, -0.11617655541575063, -0.19798401899043389, -0.12932684635269387, -0.16461118730442267, 0.08664100945621143, -0.10302857701396034, -0.11461247777204393, 0.24562641702622415, 0.09666253320333894, 0.23137325856782076, 0.03268477795861526, 0.31359426354456155, 0.07012006772199511, 0.14537879254860472, 0.16036466481126543, 0.25841450300668517, 0.20297336240717764, 0.12395126872833052, -0.24234534926889015, 0.05998710233477816, -0.012084732768163386] |
1,803.03341 | Adversarial Training for Adverse Conditions: Robust Metric Localisation
using Appearance Transfer | We present a method of improving visual place recognition and metric
localisation under very strong appear- ance change. We learn an invertable
generator that can trans- form the conditions of images, e.g. from day to
night, summer to winter etc. This image transforming filter is explicitly
designed to aid and abet feature-matching using a new loss based on SURF
detector and dense descriptor maps. A network is trained to output synthetic
images optimised for feature matching given only an input RGB image, and these
generated images are used to localize the robot against a previously built map
using traditional sparse matching approaches. We benchmark our results using
multiple traversals of the Oxford RobotCar Dataset over a year-long period,
using one traversal as a map and the other to localise. We show that this
method significantly improves place recognition and localisation under changing
and adverse conditions, while reducing the number of mapping runs needed to
successfully achieve reliable localisation.
| cs.CV | we present a method of improving visual place recognition and metric localisation under very strong appear ance change we learn an invertable generator that can trans form the conditions of images eg from day to night summer to winter etc this image transforming filter is explicitly designed to aid and abet featurematching using a new loss based on surf detector and dense descriptor maps a network is trained to output synthetic images optimised for feature matching given only an input rgb image and these generated images are used to localize the robot against a previously built map using traditional sparse matching approaches we benchmark our results using multiple traversals of the oxford robotcar dataset over a yearlong period using one traversal as a map and the other to localise we show that this method significantly improves place recognition and localisation under changing and adverse conditions while reducing the number of mapping runs needed to successfully achieve reliable localisation | [['we', 'present', 'a', 'method', 'of', 'improving', 'visual', 'place', 'recognition', 'and', 'metric', 'localisation', 'under', 'very', 'strong', 'appear', 'ance', 'change', 'we', 'learn', 'an', 'invertable', 'generator', 'that', 'can', 'trans', 'form', 'the', 'conditions', 'of', 'images', 'eg', 'from', 'day', 'to', 'night', 'summer', 'to', 'winter', 'etc', 'this', 'image', 'transforming', 'filter', 'is', 'explicitly', 'designed', 'to', 'aid', 'and', 'abet', 'featurematching', 'using', 'a', 'new', 'loss', 'based', 'on', 'surf', 'detector', 'and', 'dense', 'descriptor', 'maps', 'a', 'network', 'is', 'trained', 'to', 'output', 'synthetic', 'images', 'optimised', 'for', 'feature', 'matching', 'given', 'only', 'an', 'input', 'rgb', 'image', 'and', 'these', 'generated', 'images', 'are', 'used', 'to', 'localize', 'the', 'robot', 'against', 'a', 'previously', 'built', 'map', 'using', 'traditional', 'sparse', 'matching', 'approaches', 'we', 'benchmark', 'our', 'results', 'using', 'multiple', 'traversals', 'of', 'the', 'oxford', 'robotcar', 'dataset', 'over', 'a', 'yearlong', 'period', 'using', 'one', 'traversal', 'as', 'a', 'map', 'and', 'the', 'other', 'to', 'localise', 'we', 'show', 'that', 'this', 'method', 'significantly', 'improves', 'place', 'recognition', 'and', 'localisation', 'under', 'changing', 'and', 'adverse', 'conditions', 'while', 'reducing', 'the', 'number', 'of', 'mapping', 'runs', 'needed', 'to', 'successfully', 'achieve', 'reliable', 'localisation']] | [-0.040889499765007366, 0.011797546270735197, -0.10540158841965272, 0.046155814440991684, -0.09077379046467758, -0.15354491978341453, 0.0211739685501361, 0.45028530673972694, -0.24377020909392003, -0.3551956409281945, 0.1391841088203548, -0.24252436764809432, -0.17941633423884648, 0.2244154920733734, -0.14940070936196967, 0.07814379792684052, 0.14469543216260786, 0.04284872010547691, -0.05980048374909483, -0.27983738480893233, 0.24457262375073718, 0.07286473049758639, 0.3154044607005825, 0.010428817866847533, 0.14791928472504304, 0.015337842499654551, -0.056720634951304846, -0.006404810535715586, -0.04255314109615961, 0.14260498132877925, 0.2542694693466625, 0.18023532962786104, 0.21715116184322705, -0.4145148298172634, -0.1989119097493188, 0.09117034795882675, 0.10047759751587018, 0.10168884597759976, -0.03729134809249376, -0.3747852945028321, 0.11010817696246071, -0.1334814221503897, 0.005954241607031679, -0.08499999173115232, -0.018681755895826588, -0.029442704047291553, -0.32140633277595043, 0.0021230452679262698, 0.052403962928536524, 0.0916096739871781, -0.0634330889752394, -0.0669782588116919, -0.020195189487672398, 0.23438159879621212, -0.027442580492005837, 0.10117642009996256, 0.16452319765039072, -0.16378169917336466, -0.09098948959829993, 0.3756247019230188, -0.10304746291706268, -0.16248847839505046, 0.23100413708753081, -0.05759451474074887, -0.1352206746269536, 0.13579843635376118, 0.2268136266406767, 0.12424363535121555, -0.1278522947008863, -0.02133398743374332, -0.043470555368245026, 0.19828365632049927, 0.12697669038773055, -0.019179911706360835, 0.16636922609877383, 0.1984913984985574, 0.07480967554626279, 0.1510165927963349, -0.19989478641725292, -0.0201968210734592, -0.22250399050410377, -0.07864061011004415, -0.18400245710700466, -0.0317988875970433, -0.059527085519036946, -0.13721287170916138, 0.4251907954384467, 0.231296350578247, 0.22172874943839527, 0.07578716104956273, 0.3121367460352522, 0.053336593410135774, 0.11498432090961672, 0.07003428494628472, 0.15994420311785054, 0.00014747653887430323, 0.09985053977601914, -0.15208839991607384, 0.050529671872338235, 0.09613499085454247] |
1,803.03342 | Chern characters in equivariant basic cohomology | From 1980s, it is an open problem of proposing cohomologic formula for the
basic index of a transversally elliptic basic differential operator on a vector
bundle over a foliated manifold. In 1990s, El Kacimi-Alaoui has proprosed to
use the Molino theory for study this index. Molino has proved that to every
transversally oriented Riemannien foliation, we can associate a manifold,
called basique manifold, which is \'equiped with an action of orthogonal group,
El Kacimi-Alaoui has shown how to associate a transversally elliptic basic
differential operator an operator on a vector bundle, called useful bundle,
over the basique manifold.
The idea is to obtain the desired cohomologic formula from r\'esultats about
the operator on the useful bundle. This thesis is a first step in this
direction. While the Riemannien foliation is Killing, Goertsches et T\"oben
have remarked that there exists a naturel cohomologic isomorphism between the
equivariant basique cohomology of the Killing foliation and the equivariant
cohomology of the basique manifold.
The principal result of this thesis is the geometric realisation of the
cohomologic isomorphism by Chern characters under some hypoth\`eses.
| math.DG | from 1980s it is an open problem of proposing cohomologic formula for the basic index of a transversally elliptic basic differential operator on a vector bundle over a foliated manifold in 1990s el kacimialaoui has proprosed to use the molino theory for study this index molino has proved that to every transversally oriented riemannien foliation we can associate a manifold called basique manifold which is equiped with an action of orthogonal group el kacimialaoui has shown how to associate a transversally elliptic basic differential operator an operator on a vector bundle called useful bundle over the basique manifold the idea is to obtain the desired cohomologic formula from resultats about the operator on the useful bundle this thesis is a first step in this direction while the riemannien foliation is killing goertsches et toben have remarked that there exists a naturel cohomologic isomorphism between the equivariant basique cohomology of the killing foliation and the equivariant cohomology of the basique manifold the principal result of this thesis is the geometric realisation of the cohomologic isomorphism by chern characters under some hypotheses | [['from', '1980s', 'it', 'is', 'an', 'open', 'problem', 'of', 'proposing', 'cohomologic', 'formula', 'for', 'the', 'basic', 'index', 'of', 'a', 'transversally', 'elliptic', 'basic', 'differential', 'operator', 'on', 'a', 'vector', 'bundle', 'over', 'a', 'foliated', 'manifold', 'in', '1990s', 'el', 'kacimialaoui', 'has', 'proprosed', 'to', 'use', 'the', 'molino', 'theory', 'for', 'study', 'this', 'index', 'molino', 'has', 'proved', 'that', 'to', 'every', 'transversally', 'oriented', 'riemannien', 'foliation', 'we', 'can', 'associate', 'a', 'manifold', 'called', 'basique', 'manifold', 'which', 'is', 'equiped', 'with', 'an', 'action', 'of', 'orthogonal', 'group', 'el', 'kacimialaoui', 'has', 'shown', 'how', 'to', 'associate', 'a', 'transversally', 'elliptic', 'basic', 'differential', 'operator', 'an', 'operator', 'on', 'a', 'vector', 'bundle', 'called', 'useful', 'bundle', 'over', 'the', 'basique', 'manifold', 'the', 'idea', 'is', 'to', 'obtain', 'the', 'desired', 'cohomologic', 'formula', 'from', 'resultats', 'about', 'the', 'operator', 'on', 'the', 'useful', 'bundle', 'this', 'thesis', 'is', 'a', 'first', 'step', 'in', 'this', 'direction', 'while', 'the', 'riemannien', 'foliation', 'is', 'killing', 'goertsches', 'et', 'toben', 'have', 'remarked', 'that', 'there', 'exists', 'a', 'naturel', 'cohomologic', 'isomorphism', 'between', 'the', 'equivariant', 'basique', 'cohomology', 'of', 'the', 'killing', 'foliation', 'and', 'the', 'equivariant', 'cohomology', 'of', 'the', 'basique', 'manifold', 'the', 'principal', 'result', 'of', 'this', 'thesis', 'is', 'the', 'geometric', 'realisation', 'of', 'the', 'cohomologic', 'isomorphism', 'by', 'chern', 'characters', 'under', 'some', 'hypotheses']] | [-0.1993084810693922, 0.0417413107830818, -0.15071298240941797, 0.04006858335381721, -0.1473702036875621, -0.15385765395006218, -0.07424815399848493, 0.3351309298732355, -0.29836430037025846, -0.18333482066311446, 0.09666298897404192, -0.25252745423655387, -0.188511300046723, 0.16533241991353573, -0.19254607593082945, 0.0010081910670308744, 0.05334748017554313, 0.1210225573477814, -0.054213986724173116, -0.21813143222128425, 0.44904613290981804, 0.025902712025737528, 0.2561689264925018, 0.05743854955834531, 0.1929961602403493, 0.018134357990012347, 0.02076659707278855, -0.039685630874897716, -0.13124711211880283, 0.14006176325663566, 0.29170506364418625, 0.09744493903508042, 0.21712339816793882, -0.3405898797559607, -0.14736916284645135, 0.15908997941046615, 0.1133399421380738, -0.00484618332844075, -0.006602362749998137, -0.28367826427822396, 0.10254893769999429, -0.12384835292853541, -0.16595237050468556, -0.07591125835982904, 0.07391010922390315, -0.07281038316267958, -0.19323050281253912, -0.04435669984089705, 0.10986123458642807, 0.10682439961928432, -0.06284317396065525, -0.05242261533312352, -0.07271332866222845, 0.0391429302145827, 0.03411606472185524, 0.12521506435143115, 0.08500437379787061, -0.017632317897669003, -0.14675690618338388, 0.3236246587613882, -0.09458397292679355, -0.25175893767657925, 0.05349902023882263, -0.10610793273906502, -0.1945062267204673, 0.1098430093629733, 0.08865643308117642, 0.1843828259741014, -0.05591432751540495, 0.19166194529655406, -0.11859772455389217, 0.08220100815284281, 0.08211139518515033, -0.08680897470205853, 0.13051420487568707, 0.10522623937629626, 0.13002714144308014, 0.08853643869002492, 0.013534809153600686, -0.065387253573238, -0.3269283606455067, -0.27270252798620803, -0.10710455716513939, 0.1725046777371633, -0.07244575196490058, -0.16157556719348587, 0.41604931590457755, 0.04340942823170227, 0.21525924918268108, 0.06883642605129671, 0.23048981415347253, 0.09357590266696761, 0.04708616807267575, 0.07994921146865702, 0.17439886585149603, 0.24360525774990477, 0.06273545742845216, -0.12271034061161559, -0.010351611851151549, 0.20541486426093483] |
1,803.03343 | Thermal History Of Cbb Chondrules And Cooling Rate Distributions Of
Ejecta Plumes | It has been proposed that some meteorites, CB and CH chondrites, contain
material formed as a result of a protoplanetary collision during accretion.
Their melt droplets (chondrules) and FeNi metal are proposed to have formed by
evaporation and condensation in the resulting impact plume. We observe that the
SO (skeletal olivine) chondrules in CBb chondrites have a blebby texture and an
enrichment in refractory elements not found in normal chondrules. Since the
texture requires complete melting, their maximum liquidus temperature 1928 K
represents a minimum temperature for the putative plume. Dynamic
crystallization experiments show that the SO texture can be created only by
brief reheating episodes during crystallization giving partial dissolution of
olivine. The ejecta plume formed in a smoothed particle hydrodynamics (SPH)
simulation (Asphaug et al., 2011) served as the basis for 3D modeling with the
adaptive mesh refinement (AMR) code FLASH4.3. Tracer particles that move with
the fluid cells are used to measure the in situ cooling rates. Their cooling
rates are ~10,000K/hr briefly at peak temperature and, in the densest regions
of the plume, ~100 K/hr for 1400-1600 K. A small fraction of cells is seen to
be heating at any one time, with heating spikes explained by compression of
parcels of gas in a heterogeneous patchy plume. These temperature fluctuations
are comparable to those required in crystallization experiments. For the first
time, we find agreement between experiment and models that supports the plume
model specifically for the formation of CBb chondrules.
| astro-ph.EP | it has been proposed that some meteorites cb and ch chondrites contain material formed as a result of a protoplanetary collision during accretion their melt droplets chondrules and feni metal are proposed to have formed by evaporation and condensation in the resulting impact plume we observe that the so skeletal olivine chondrules in cbb chondrites have a blebby texture and an enrichment in refractory elements not found in normal chondrules since the texture requires complete melting their maximum liquidus temperature 1928 k represents a minimum temperature for the putative plume dynamic crystallization experiments show that the so texture can be created only by brief reheating episodes during crystallization giving partial dissolution of olivine the ejecta plume formed in a smoothed particle hydrodynamics sph simulation asphaug et al 2011 served as the basis for 3d modeling with the adaptive mesh refinement amr code flash43 tracer particles that move with the fluid cells are used to measure the in situ cooling rates their cooling rates are 10000khr briefly at peak temperature and in the densest regions of the plume 100 khr for 14001600 k a small fraction of cells is seen to be heating at any one time with heating spikes explained by compression of parcels of gas in a heterogeneous patchy plume these temperature fluctuations are comparable to those required in crystallization experiments for the first time we find agreement between experiment and models that supports the plume model specifically for the formation of cbb chondrules | [['it', 'has', 'been', 'proposed', 'that', 'some', 'meteorites', 'cb', 'and', 'ch', 'chondrites', 'contain', 'material', 'formed', 'as', 'a', 'result', 'of', 'a', 'protoplanetary', 'collision', 'during', 'accretion', 'their', 'melt', 'droplets', 'chondrules', 'and', 'feni', 'metal', 'are', 'proposed', 'to', 'have', 'formed', 'by', 'evaporation', 'and', 'condensation', 'in', 'the', 'resulting', 'impact', 'plume', 'we', 'observe', 'that', 'the', 'so', 'skeletal', 'olivine', 'chondrules', 'in', 'cbb', 'chondrites', 'have', 'a', 'blebby', 'texture', 'and', 'an', 'enrichment', 'in', 'refractory', 'elements', 'not', 'found', 'in', 'normal', 'chondrules', 'since', 'the', 'texture', 'requires', 'complete', 'melting', 'their', 'maximum', 'liquidus', 'temperature', '1928', 'k', 'represents', 'a', 'minimum', 'temperature', 'for', 'the', 'putative', 'plume', 'dynamic', 'crystallization', 'experiments', 'show', 'that', 'the', 'so', 'texture', 'can', 'be', 'created', 'only', 'by', 'brief', 'reheating', 'episodes', 'during', 'crystallization', 'giving', 'partial', 'dissolution', 'of', 'olivine', 'the', 'ejecta', 'plume', 'formed', 'in', 'a', 'smoothed', 'particle', 'hydrodynamics', 'sph', 'simulation', 'asphaug', 'et', 'al', '2011', 'served', 'as', 'the', 'basis', 'for', '3d', 'modeling', 'with', 'the', 'adaptive', 'mesh', 'refinement', 'amr', 'code', 'flash43', 'tracer', 'particles', 'that', 'move', 'with', 'the', 'fluid', 'cells', 'are', 'used', 'to', 'measure', 'the', 'in', 'situ', 'cooling', 'rates', 'their', 'cooling', 'rates', 'are', '10000khr', 'briefly', 'at', 'peak', 'temperature', 'and', 'in', 'the', 'densest', 'regions', 'of', 'the', 'plume', '100', 'khr', 'for', '14001600', 'k', 'a', 'small', 'fraction', 'of', 'cells', 'is', 'seen', 'to', 'be', 'heating', 'at', 'any', 'one', 'time', 'with', 'heating', 'spikes', 'explained', 'by', 'compression', 'of', 'parcels', 'of', 'gas', 'in', 'a', 'heterogeneous', 'patchy', 'plume', 'these', 'temperature', 'fluctuations', 'are', 'comparable', 'to', 'those', 'required', 'in', 'crystallization', 'experiments', 'for', 'the', 'first', 'time', 'we', 'find', 'agreement', 'between', 'experiment', 'and', 'models', 'that', 'supports', 'the', 'plume', 'model', 'specifically', 'for', 'the', 'formation', 'of', 'cbb', 'chondrules']] | [-0.047538969515917115, 0.2089937044231703, -0.07555138303471098, 0.014348490479737058, 0.0018320649853630438, -0.07451340879606129, 0.014923678918872491, 0.38606913983802627, -0.23808274930727877, -0.32728218657834346, 0.07113528382591133, -0.2839611193977204, -0.0691686589059166, 0.12454705911773653, -0.0496170267747515, 0.0007329764266013483, 0.06740507524660673, -0.061168058182705536, -0.03306777559342017, -0.27325536938834444, 0.2310178738360655, 0.11612006501787273, 0.20656865475360642, 0.03724903586389851, 0.0581027237368432, -0.13568699982571453, -0.001099914127637532, 0.018822130242993763, -0.18757878470382858, 0.007926344871520996, 0.23583035991202247, 0.09051320220686279, 0.1916788580347803, -0.4893219037258551, -0.2820591454702999, 0.050287952172292844, 0.1541033588481628, 0.08124137166810554, -0.11406177362188512, -0.19706277244277914, 0.05157440067519057, -0.17217009173574366, -0.1013747918927534, 0.021281199783764103, 0.05076029387972325, 0.002617761511009279, -0.27706105979775225, 0.13406583707210076, 0.08005212212062233, 0.08554292911007493, -0.09645005261856478, -0.12397275980038103, -0.10243255280781814, 0.055362773291412586, 0.020635861136146228, -0.009835547376000746, 0.22911898539368397, -0.09213953724079034, -0.029541483376471497, 0.41416656753156056, -0.05889943014630232, -0.05254534438775837, 0.24255000851896383, -0.18190990220408979, -0.0952400564523231, 0.23754501623709587, 0.15002060546188553, 0.10751056886366607, -0.13157021599313753, -0.034127316350590686, -0.07616634686931598, 0.1534812226525916, 0.12049418407461553, -0.025774388020158957, 0.2894494838239086, 0.1996713419077333, -0.03895184752331231, 0.11333184927261304, -0.12651616200870675, -0.05853945148597887, -0.20661801185886075, -0.19404286262489065, -0.15728789608740856, -0.015666013607533537, -0.1066454530836464, -0.15898586953951677, 0.29227685134507686, 0.13774635188650985, 0.22242868365491414, -0.0087098397135596, 0.2508023068701371, 0.027242359163120296, 0.09446047230485119, 0.1109664526735317, 0.23813044866568636, 0.12447588928986711, 0.1596491650797519, -0.2568045333720559, 0.16478299899296142, 0.07789948303348669] |
1,803.03344 | Dimension-Robust MCMC in Bayesian Inverse Problems | The methodology developed in this article is motivated by a wide range of
prediction and uncertainty quantification problems that arise in Statistics,
Machine Learning and Applied Mathematics, such as non-parametric regression,
multi-class classification and inversion of partial differential equations. One
popular formulation of such problems is as Bayesian inverse problems, where a
prior distribution is used to regularize inference on a high-dimensional latent
state, typically a function or a field. It is common that such priors are
non-Gaussian, for example piecewise-constant or heavy-tailed, and/or
hierarchical, in the sense of involving a further set of low-dimensional
parameters, which, for example, control the scale or smoothness of the latent
state. In this formulation prediction and uncertainty quantification relies on
efficient exploration of the posterior distribution of latent states and
parameters. This article introduces a framework for efficient MCMC sampling in
Bayesian inverse problems that capitalizes upon two fundamental ideas in MCMC,
non-centred parameterisations of hierarchical models and dimension-robust
samplers for latent Gaussian processes. Using a range of diverse applications
we showcase that the proposed framework is dimension-robust, that is, the
efficiency of the MCMC sampling does not deteriorate as the dimension of the
latent state gets higher. We showcase the full potential of the machinery we
develop in the article in semi-supervised multi-class classification, where our
sampling algorithm is used within an active learning framework to guide the
selection of input data to manually label in order to achieve high predictive
accuracy with a minimal number of labelled data.
| stat.ME stat.ML | the methodology developed in this article is motivated by a wide range of prediction and uncertainty quantification problems that arise in statistics machine learning and applied mathematics such as nonparametric regression multiclass classification and inversion of partial differential equations one popular formulation of such problems is as bayesian inverse problems where a prior distribution is used to regularize inference on a highdimensional latent state typically a function or a field it is common that such priors are nongaussian for example piecewiseconstant or heavytailed andor hierarchical in the sense of involving a further set of lowdimensional parameters which for example control the scale or smoothness of the latent state in this formulation prediction and uncertainty quantification relies on efficient exploration of the posterior distribution of latent states and parameters this article introduces a framework for efficient mcmc sampling in bayesian inverse problems that capitalizes upon two fundamental ideas in mcmc noncentred parameterisations of hierarchical models and dimensionrobust samplers for latent gaussian processes using a range of diverse applications we showcase that the proposed framework is dimensionrobust that is the efficiency of the mcmc sampling does not deteriorate as the dimension of the latent state gets higher we showcase the full potential of the machinery we develop in the article in semisupervised multiclass classification where our sampling algorithm is used within an active learning framework to guide the selection of input data to manually label in order to achieve high predictive accuracy with a minimal number of labelled data | [['the', 'methodology', 'developed', 'in', 'this', 'article', 'is', 'motivated', 'by', 'a', 'wide', 'range', 'of', 'prediction', 'and', 'uncertainty', 'quantification', 'problems', 'that', 'arise', 'in', 'statistics', 'machine', 'learning', 'and', 'applied', 'mathematics', 'such', 'as', 'nonparametric', 'regression', 'multiclass', 'classification', 'and', 'inversion', 'of', 'partial', 'differential', 'equations', 'one', 'popular', 'formulation', 'of', 'such', 'problems', 'is', 'as', 'bayesian', 'inverse', 'problems', 'where', 'a', 'prior', 'distribution', 'is', 'used', 'to', 'regularize', 'inference', 'on', 'a', 'highdimensional', 'latent', 'state', 'typically', 'a', 'function', 'or', 'a', 'field', 'it', 'is', 'common', 'that', 'such', 'priors', 'are', 'nongaussian', 'for', 'example', 'piecewiseconstant', 'or', 'heavytailed', 'andor', 'hierarchical', 'in', 'the', 'sense', 'of', 'involving', 'a', 'further', 'set', 'of', 'lowdimensional', 'parameters', 'which', 'for', 'example', 'control', 'the', 'scale', 'or', 'smoothness', 'of', 'the', 'latent', 'state', 'in', 'this', 'formulation', 'prediction', 'and', 'uncertainty', 'quantification', 'relies', 'on', 'efficient', 'exploration', 'of', 'the', 'posterior', 'distribution', 'of', 'latent', 'states', 'and', 'parameters', 'this', 'article', 'introduces', 'a', 'framework', 'for', 'efficient', 'mcmc', 'sampling', 'in', 'bayesian', 'inverse', 'problems', 'that', 'capitalizes', 'upon', 'two', 'fundamental', 'ideas', 'in', 'mcmc', 'noncentred', 'parameterisations', 'of', 'hierarchical', 'models', 'and', 'dimensionrobust', 'samplers', 'for', 'latent', 'gaussian', 'processes', 'using', 'a', 'range', 'of', 'diverse', 'applications', 'we', 'showcase', 'that', 'the', 'proposed', 'framework', 'is', 'dimensionrobust', 'that', 'is', 'the', 'efficiency', 'of', 'the', 'mcmc', 'sampling', 'does', 'not', 'deteriorate', 'as', 'the', 'dimension', 'of', 'the', 'latent', 'state', 'gets', 'higher', 'we', 'showcase', 'the', 'full', 'potential', 'of', 'the', 'machinery', 'we', 'develop', 'in', 'the', 'article', 'in', 'semisupervised', 'multiclass', 'classification', 'where', 'our', 'sampling', 'algorithm', 'is', 'used', 'within', 'an', 'active', 'learning', 'framework', 'to', 'guide', 'the', 'selection', 'of', 'input', 'data', 'to', 'manually', 'label', 'in', 'order', 'to', 'achieve', 'high', 'predictive', 'accuracy', 'with', 'a', 'minimal', 'number', 'of', 'labelled', 'data']] | [-0.01601765633783179, 0.05316680225102761, -0.0811037850247598, 0.09636407145694924, -0.1286009676011679, -0.13207724735589493, 0.058773966287432415, 0.3925716090543942, -0.30820654852971857, -0.34279992762832384, 0.1203656574230578, -0.21147903113018887, -0.15013937914069092, 0.19216247641873596, -0.11185290856637543, 0.12548551470491853, 0.08318733022291862, 0.023730168107761303, -0.06636559344198449, -0.2319578752977404, 0.31162645928146926, 0.04825820265194544, 0.3212421479095754, -0.032561683486242166, 0.15510974136871183, 0.03529570881948478, -0.042118810653603574, -0.005155764079486823, -0.09987622854441357, 0.1773160930262475, 0.3213914139268889, 0.193194718261321, 0.36368061896217496, -0.35305489688218095, -0.28097725127209056, 0.12534744110757765, 0.14444581568731288, 0.10839855243491484, -0.02277223631948881, -0.2726262083940721, 0.03570542327265445, -0.17456901445431042, -0.03917496376538928, -0.14573178042823576, -0.04653084008466181, 0.0014358360248689468, -0.3481133231866788, 0.10595275451493287, 0.08461503647663725, 0.046884475729988155, -0.030958389652221793, -0.13680600626808911, 0.026409194537019922, 0.07504872366765265, 0.04316096897576351, 0.02351256597717387, 0.1101801106743967, -0.16798227023699053, -0.14636420379609608, 0.35035864816486517, -0.03754115425218048, -0.25111636041675606, 0.1779802543014997, -0.04557583939570647, -0.1927215534956138, 0.10134176691798003, 0.25799603755340766, 0.14315349459252227, -0.15833934409890763, 0.07857492430039459, -0.025677180230176372, 0.14872895954327606, -0.011826695837570648, -0.04066384518858392, 0.13268668460753946, 0.24313295688027675, 0.07499398652328412, 0.13596836472310028, -0.12625754454176918, -0.13291511980643278, -0.27957100797725487, -0.13780301329321587, -0.20944811899954008, -0.021842203856111686, -0.1360561390900381, -0.21595134106672065, 0.38630489994270295, 0.2124778024931457, 0.20979716396996156, 0.06432571179216524, 0.29616207834559416, 0.10398853713179221, 0.03334002517284411, 0.0667311255857801, 0.1404600923735769, 0.11556579474442702, 0.05356438838177349, -0.14905892922316757, 0.10456614298104999, 0.020049711438612297] |
1,803.03345 | Deep Semantic Face Deblurring | In this paper, we present an effective and efficient face deblurring
algorithm by exploiting semantic cues via deep convolutional neural networks
(CNNs). As face images are highly structured and share several key semantic
components (e.g., eyes and mouths), the semantic information of a face provides
a strong prior for restoration. As such, we propose to incorporate global
semantic priors as input and impose local structure losses to regularize the
output within a multi-scale deep CNN. We train the network with perceptual and
adversarial losses to generate photo-realistic results and develop an
incremental training strategy to handle random blur kernels in the wild.
Quantitative and qualitative evaluations demonstrate that the proposed face
deblurring algorithm restores sharp images with more facial details and
performs favorably against state-of-the-art methods in terms of restoration
quality, face recognition and execution speed.
| cs.CV | in this paper we present an effective and efficient face deblurring algorithm by exploiting semantic cues via deep convolutional neural networks cnns as face images are highly structured and share several key semantic components eg eyes and mouths the semantic information of a face provides a strong prior for restoration as such we propose to incorporate global semantic priors as input and impose local structure losses to regularize the output within a multiscale deep cnn we train the network with perceptual and adversarial losses to generate photorealistic results and develop an incremental training strategy to handle random blur kernels in the wild quantitative and qualitative evaluations demonstrate that the proposed face deblurring algorithm restores sharp images with more facial details and performs favorably against stateoftheart methods in terms of restoration quality face recognition and execution speed | [['in', 'this', 'paper', 'we', 'present', 'an', 'effective', 'and', 'efficient', 'face', 'deblurring', 'algorithm', 'by', 'exploiting', 'semantic', 'cues', 'via', 'deep', 'convolutional', 'neural', 'networks', 'cnns', 'as', 'face', 'images', 'are', 'highly', 'structured', 'and', 'share', 'several', 'key', 'semantic', 'components', 'eg', 'eyes', 'and', 'mouths', 'the', 'semantic', 'information', 'of', 'a', 'face', 'provides', 'a', 'strong', 'prior', 'for', 'restoration', 'as', 'such', 'we', 'propose', 'to', 'incorporate', 'global', 'semantic', 'priors', 'as', 'input', 'and', 'impose', 'local', 'structure', 'losses', 'to', 'regularize', 'the', 'output', 'within', 'a', 'multiscale', 'deep', 'cnn', 'we', 'train', 'the', 'network', 'with', 'perceptual', 'and', 'adversarial', 'losses', 'to', 'generate', 'photorealistic', 'results', 'and', 'develop', 'an', 'incremental', 'training', 'strategy', 'to', 'handle', 'random', 'blur', 'kernels', 'in', 'the', 'wild', 'quantitative', 'and', 'qualitative', 'evaluations', 'demonstrate', 'that', 'the', 'proposed', 'face', 'deblurring', 'algorithm', 'restores', 'sharp', 'images', 'with', 'more', 'facial', 'details', 'and', 'performs', 'favorably', 'against', 'stateoftheart', 'methods', 'in', 'terms', 'of', 'restoration', 'quality', 'face', 'recognition', 'and', 'execution', 'speed']] | [-0.00734712000378161, -0.06592573781017563, -0.05586538645301891, 0.08377723169413752, -0.12265013940358425, -0.1923920776372303, -0.03641426862604396, 0.5465439338620532, -0.2779356568832608, -0.32351052485105086, 0.07022483433298904, -0.2470168839345741, -0.2568265370997217, 0.12263277784222737, -0.23474881535580874, 0.13703311191570453, 0.16166304184726493, 0.020013803714177544, -0.07713514626490958, -0.2656477266915745, 0.29200727998526793, 0.04056223578749375, 0.3462427278008202, 0.05063364790026646, 0.1725115218124462, -0.025806723480106004, -0.035526897172744876, -0.022064928368255257, -0.0205953463774302, 0.19795240711776868, 0.3235517543028383, 0.21556349497062482, 0.31456303208302844, -0.4822173759560375, -0.23017999359324356, 0.040401187834932524, 0.12479975741381863, 0.13177345915670124, -0.050954237070661344, -0.4071821086382603, 0.09975900812423788, -0.1348917896325207, 0.06489402294391766, -0.2380431377712418, -0.07268709437031408, -0.04495130500803204, -0.3304633813459077, 0.05709520006027614, 0.11312432655027163, 0.0840008495553561, -0.05005739313920083, -0.0874515071439365, 0.026054539334248093, 0.1901132588596631, 0.02728101215325296, 0.0726471875951735, 0.1628874782626928, -0.27723631047025693, -0.13374076070784427, 0.37301360891091034, -0.06262645391603548, -0.22878228968372294, 0.20706698351868374, 0.02711201649200281, -0.11350911169874427, 0.12322124117396444, 0.25752945644233155, 0.09156384881455726, -0.1516913069786182, -0.02792190299549154, -0.03900884385289186, 0.17714475282906172, 0.09103232968824587, 0.035588115341477745, 0.148875795520486, 0.23777572603841476, 0.06594775908626402, 0.18369742341319045, -0.20743036209729754, -0.012909546685370836, -0.18636312920202994, -0.06125823078978369, -0.17442229298039286, -0.09050084235701326, -0.16604574965148297, -0.19014528512257933, 0.42005905579871444, 0.27282767305972383, 0.2621073884280015, 0.1390591106884291, 0.41541507323477966, -0.009813149902209476, 0.12705891094896393, 0.11156651358846027, 0.14169849508342688, -0.006236966286772205, 0.14549700824393177, -0.1603030601708109, 0.10096890176678511, 0.10420449448300882] |
1,803.03346 | Positivity Bias in Customer Satisfaction Ratings | Customer ratings are valuable sources to understand their satisfaction and
are critical for designing better customer experiences and recommendations. The
majority of customers, however, do not respond to rating surveys, which makes
the result less representative. To understand overall satisfaction, this paper
aims to investigate how likely customers without responses had satisfactory
experiences compared to those respondents. To infer customer satisfaction of
such unlabeled sessions, we propose models using recurrent neural networks
(RNNs) that learn continuous representations of unstructured text conversation.
By analyzing online chat logs of over 170,000 sessions from Samsung's customer
service department, we make a novel finding that while labeled sessions
contributed by a small fraction of customers received overwhelmingly positive
reviews, the majority of unlabeled sessions would have received lower ratings
by customers. The data analytics presented in this paper not only have
practical implications for helping detect dissatisfied customers on live chat
services but also make theoretical contributions on discovering the level of
biases in online rating platforms.
| cs.SI | customer ratings are valuable sources to understand their satisfaction and are critical for designing better customer experiences and recommendations the majority of customers however do not respond to rating surveys which makes the result less representative to understand overall satisfaction this paper aims to investigate how likely customers without responses had satisfactory experiences compared to those respondents to infer customer satisfaction of such unlabeled sessions we propose models using recurrent neural networks rnns that learn continuous representations of unstructured text conversation by analyzing online chat logs of over 170000 sessions from samsungs customer service department we make a novel finding that while labeled sessions contributed by a small fraction of customers received overwhelmingly positive reviews the majority of unlabeled sessions would have received lower ratings by customers the data analytics presented in this paper not only have practical implications for helping detect dissatisfied customers on live chat services but also make theoretical contributions on discovering the level of biases in online rating platforms | [['customer', 'ratings', 'are', 'valuable', 'sources', 'to', 'understand', 'their', 'satisfaction', 'and', 'are', 'critical', 'for', 'designing', 'better', 'customer', 'experiences', 'and', 'recommendations', 'the', 'majority', 'of', 'customers', 'however', 'do', 'not', 'respond', 'to', 'rating', 'surveys', 'which', 'makes', 'the', 'result', 'less', 'representative', 'to', 'understand', 'overall', 'satisfaction', 'this', 'paper', 'aims', 'to', 'investigate', 'how', 'likely', 'customers', 'without', 'responses', 'had', 'satisfactory', 'experiences', 'compared', 'to', 'those', 'respondents', 'to', 'infer', 'customer', 'satisfaction', 'of', 'such', 'unlabeled', 'sessions', 'we', 'propose', 'models', 'using', 'recurrent', 'neural', 'networks', 'rnns', 'that', 'learn', 'continuous', 'representations', 'of', 'unstructured', 'text', 'conversation', 'by', 'analyzing', 'online', 'chat', 'logs', 'of', 'over', '170000', 'sessions', 'from', 'samsungs', 'customer', 'service', 'department', 'we', 'make', 'a', 'novel', 'finding', 'that', 'while', 'labeled', 'sessions', 'contributed', 'by', 'a', 'small', 'fraction', 'of', 'customers', 'received', 'overwhelmingly', 'positive', 'reviews', 'the', 'majority', 'of', 'unlabeled', 'sessions', 'would', 'have', 'received', 'lower', 'ratings', 'by', 'customers', 'the', 'data', 'analytics', 'presented', 'in', 'this', 'paper', 'not', 'only', 'have', 'practical', 'implications', 'for', 'helping', 'detect', 'dissatisfied', 'customers', 'on', 'live', 'chat', 'services', 'but', 'also', 'make', 'theoretical', 'contributions', 'on', 'discovering', 'the', 'level', 'of', 'biases', 'in', 'online', 'rating', 'platforms']] | [-0.08496035894888247, 0.051575099016636886, -0.032431807617536904, 0.11168628884622245, -0.22288503940074356, -0.20144147890979894, 0.18044660625082262, 0.45380577698715624, -0.19768713468805732, -0.37288802192529286, 0.055162812317464435, -0.3963948712495664, -0.1200807041894256, 0.14702505886946102, -0.16792289230206903, 0.00991673398394412, 0.1142487000114073, 0.0844713656168911, 0.006559290937462285, -0.3835627364660356, 0.28624387491266584, 0.06934191312275233, 0.3339520177112584, 0.03816619439427655, 0.04198486136756066, -0.020241319403292303, -0.11885167842022389, -0.03634243829181544, -0.04867851369390393, 0.13903638502251517, 0.44107673774813777, 0.2445794274224157, 0.3983175917114331, -0.4470000120988287, -0.1648077465968058, 0.0943804879864232, 0.13341749968161476, 0.04009456545517329, -0.044719013129789494, -0.3545466239215589, 0.11819151622111812, -0.24029700883715613, -0.009347972662925171, -0.11720385950664344, 0.01427847714351913, 0.04843831561224398, -0.24557397965387515, -0.021038768503227858, 0.003975039816524354, 0.08309907366184552, -0.043492231377331894, -0.11106823871563548, 0.020081816241145134, 0.25093807998553286, 0.13652143774245598, -0.026303062215268874, 0.15431014681234956, -0.20326240057057124, -0.1415634324225637, 0.41471992550772024, 0.01990675957919173, -0.11293134301118096, 0.1714692543120769, -0.056179281297053046, -0.18658677247164349, 0.10209592864305878, 0.3223259696234132, 0.043389439314462395, -0.2420268343523019, -0.07312222868789764, -0.04812595315643249, 0.22030378010429646, 0.0533361861930783, -0.015272885415291676, 0.22214722494806158, 0.18957586614186503, 0.05408449566271727, 0.06442205343349762, 0.02838888216443771, -0.05109317269050545, -0.1455017839461291, -0.08783120534845565, -0.1283300841081476, 0.07415411508505725, -0.07311844435485475, -0.11660201647084997, 0.3728426637447959, 0.24536734402316845, 0.15233153163061186, 0.13148486061790168, 0.30695286673705086, 0.02082600412201822, 0.09391268634271631, 0.11320680791534986, 0.11934865677680682, -0.04809430197732626, 0.24012826811065155, -0.10456174665896302, 0.21523110439109563, -0.025487099780609684] |
1,803.03347 | Tracking by Prediction: A Deep Generative Model for Mutli-Person
localisation and Tracking | Current multi-person localisation and tracking systems have an over reliance
on the use of appearance models for target re-identification and almost no
approaches employ a complete deep learning solution for both objectives. We
present a novel, complete deep learning framework for multi-person localisation
and tracking. In this context we first introduce a light weight sequential
Generative Adversarial Network architecture for person localisation, which
overcomes issues related to occlusions and noisy detections, typically found in
a multi person environment. In the proposed tracking framework we build upon
recent advances in pedestrian trajectory prediction approaches and propose a
novel data association scheme based on predicted trajectories. This removes the
need for computationally expensive person re-identification systems based on
appearance features and generates human like trajectories with minimal
fragmentation. The proposed method is evaluated on multiple public benchmarks
including both static and dynamic cameras and is capable of generating
outstanding performance, especially among other recently proposed deep neural
network based approaches.
| cs.CV | current multiperson localisation and tracking systems have an over reliance on the use of appearance models for target reidentification and almost no approaches employ a complete deep learning solution for both objectives we present a novel complete deep learning framework for multiperson localisation and tracking in this context we first introduce a light weight sequential generative adversarial network architecture for person localisation which overcomes issues related to occlusions and noisy detections typically found in a multi person environment in the proposed tracking framework we build upon recent advances in pedestrian trajectory prediction approaches and propose a novel data association scheme based on predicted trajectories this removes the need for computationally expensive person reidentification systems based on appearance features and generates human like trajectories with minimal fragmentation the proposed method is evaluated on multiple public benchmarks including both static and dynamic cameras and is capable of generating outstanding performance especially among other recently proposed deep neural network based approaches | [['current', 'multiperson', 'localisation', 'and', 'tracking', 'systems', 'have', 'an', 'over', 'reliance', 'on', 'the', 'use', 'of', 'appearance', 'models', 'for', 'target', 'reidentification', 'and', 'almost', 'no', 'approaches', 'employ', 'a', 'complete', 'deep', 'learning', 'solution', 'for', 'both', 'objectives', 'we', 'present', 'a', 'novel', 'complete', 'deep', 'learning', 'framework', 'for', 'multiperson', 'localisation', 'and', 'tracking', 'in', 'this', 'context', 'we', 'first', 'introduce', 'a', 'light', 'weight', 'sequential', 'generative', 'adversarial', 'network', 'architecture', 'for', 'person', 'localisation', 'which', 'overcomes', 'issues', 'related', 'to', 'occlusions', 'and', 'noisy', 'detections', 'typically', 'found', 'in', 'a', 'multi', 'person', 'environment', 'in', 'the', 'proposed', 'tracking', 'framework', 'we', 'build', 'upon', 'recent', 'advances', 'in', 'pedestrian', 'trajectory', 'prediction', 'approaches', 'and', 'propose', 'a', 'novel', 'data', 'association', 'scheme', 'based', 'on', 'predicted', 'trajectories', 'this', 'removes', 'the', 'need', 'for', 'computationally', 'expensive', 'person', 'reidentification', 'systems', 'based', 'on', 'appearance', 'features', 'and', 'generates', 'human', 'like', 'trajectories', 'with', 'minimal', 'fragmentation', 'the', 'proposed', 'method', 'is', 'evaluated', 'on', 'multiple', 'public', 'benchmarks', 'including', 'both', 'static', 'and', 'dynamic', 'cameras', 'and', 'is', 'capable', 'of', 'generating', 'outstanding', 'performance', 'especially', 'among', 'other', 'recently', 'proposed', 'deep', 'neural', 'network', 'based', 'approaches']] | [-0.07278707918498807, -0.047507486290565865, -0.06356472164195767, 0.04848697466826983, -0.08873139400936993, -0.21332173004357405, 0.011406792240818562, 0.4543591753220115, -0.1977266797536536, -0.32610989547087044, 0.06592954811345361, -0.2550942548845388, -0.23629008623170136, 0.19238269406877742, -0.17862978750173758, 0.13827766128447308, 0.16893373785652457, 0.030022537357857617, -0.045872459282414825, -0.2366647366839579, 0.3162995785197738, 0.01976977747255683, 0.377650608173041, 0.043487194013381025, 0.18328239060009982, 0.052336762159697334, -0.06607382567864666, 0.004074832741347955, -0.046320144128337314, 0.18739259575310907, 0.28464996618841043, 0.20357607394516544, 0.3389108804691158, -0.4271007825744256, -0.260832881756846, 0.08230912042899599, 0.13631478430337826, 0.11808794877223694, -0.09909306282672702, -0.38743339612773514, 0.0597041734034502, -0.17625593585021135, -0.004294649251520079, -0.15698353110450097, -0.01835262486887978, -0.03781289743742894, -0.28788139626694714, 0.02411527098804901, 0.02654814924396386, 0.061082934724945054, -0.0646731062745086, -0.08821049770134018, 0.0994202237269735, 0.16998150687711902, 0.02678912333094904, 0.03920565937244911, 0.13146827644683257, -0.2400736748741916, -0.18560999468900263, 0.3595537106636204, -0.0587802344072563, -0.20815037717877688, 0.24022844300054225, 0.011044630206107527, -0.17891354670989787, 0.1148449191219421, 0.25308948153736, 0.18007881541536014, -0.1906243802101316, -0.000985198740440692, -0.03217427701913292, 0.1551955826639469, 0.02014783374623313, 0.007653629110353893, 0.2160583048111382, 0.2931492355699309, 0.06313766515076961, 0.09059599097972866, -0.19381781725825953, -0.11755698857404574, -0.19872815258059756, -0.05774551479859113, -0.15211396423003437, -0.05352151171375019, -0.038316835383324636, -0.1614945269060097, 0.4080572306183622, 0.25382750695335526, 0.2110875603577853, 0.1112068138782324, 0.3897129020585879, -0.0010117102433526534, 0.10554409103432694, 0.10008259917479716, 0.18645547564683743, -0.03246402441187986, 0.14107092996525777, -0.1893969268738469, 0.1100276295359827, 0.08787898921048198] |
1,803.03348 | Joint Estimation and Inference for Data Integration Problems based on
Multiple Multi-layered Gaussian Graphical Models | The rapid development of high-throughput technologies has enabled the
generation of data from biological or disease processes that span multiple
layers, like genomic, proteomic or metabolomic data, and further pertain to
multiple sources, like disease subtypes or experimental conditions. In this
work, we propose a general statistical framework based on Gaussian graphical
models for horizontal (i.e. across conditions or subtypes) and vertical (i.e.
across different layers containing data on molecular compartments) integration
of information in such datasets. We start with decomposing the multi-layer
problem into a series of two-layer problems. For each two-layer problem, we
model the outcomes at a node in the lower layer as dependent on those of other
nodes in that layer, as well as all nodes in the upper layer. We use a
combination of neighborhood selection and group-penalized regression to obtain
sparse estimates of all model parameters. Following this, we develop a
debiasing technique and asymptotic distributions of inter-layer directed edge
weights that utilize already computed neighborhood selection coefficients for
nodes in the upper layer. Subsequently, we establish global and simultaneous
testing procedures for these edge weights. Performance of the proposed
methodology is evaluated on synthetic and real data.
| stat.ML math.ST stat.ME stat.TH | the rapid development of highthroughput technologies has enabled the generation of data from biological or disease processes that span multiple layers like genomic proteomic or metabolomic data and further pertain to multiple sources like disease subtypes or experimental conditions in this work we propose a general statistical framework based on gaussian graphical models for horizontal ie across conditions or subtypes and vertical ie across different layers containing data on molecular compartments integration of information in such datasets we start with decomposing the multilayer problem into a series of twolayer problems for each twolayer problem we model the outcomes at a node in the lower layer as dependent on those of other nodes in that layer as well as all nodes in the upper layer we use a combination of neighborhood selection and grouppenalized regression to obtain sparse estimates of all model parameters following this we develop a debiasing technique and asymptotic distributions of interlayer directed edge weights that utilize already computed neighborhood selection coefficients for nodes in the upper layer subsequently we establish global and simultaneous testing procedures for these edge weights performance of the proposed methodology is evaluated on synthetic and real data | [['the', 'rapid', 'development', 'of', 'highthroughput', 'technologies', 'has', 'enabled', 'the', 'generation', 'of', 'data', 'from', 'biological', 'or', 'disease', 'processes', 'that', 'span', 'multiple', 'layers', 'like', 'genomic', 'proteomic', 'or', 'metabolomic', 'data', 'and', 'further', 'pertain', 'to', 'multiple', 'sources', 'like', 'disease', 'subtypes', 'or', 'experimental', 'conditions', 'in', 'this', 'work', 'we', 'propose', 'a', 'general', 'statistical', 'framework', 'based', 'on', 'gaussian', 'graphical', 'models', 'for', 'horizontal', 'ie', 'across', 'conditions', 'or', 'subtypes', 'and', 'vertical', 'ie', 'across', 'different', 'layers', 'containing', 'data', 'on', 'molecular', 'compartments', 'integration', 'of', 'information', 'in', 'such', 'datasets', 'we', 'start', 'with', 'decomposing', 'the', 'multilayer', 'problem', 'into', 'a', 'series', 'of', 'twolayer', 'problems', 'for', 'each', 'twolayer', 'problem', 'we', 'model', 'the', 'outcomes', 'at', 'a', 'node', 'in', 'the', 'lower', 'layer', 'as', 'dependent', 'on', 'those', 'of', 'other', 'nodes', 'in', 'that', 'layer', 'as', 'well', 'as', 'all', 'nodes', 'in', 'the', 'upper', 'layer', 'we', 'use', 'a', 'combination', 'of', 'neighborhood', 'selection', 'and', 'grouppenalized', 'regression', 'to', 'obtain', 'sparse', 'estimates', 'of', 'all', 'model', 'parameters', 'following', 'this', 'we', 'develop', 'a', 'debiasing', 'technique', 'and', 'asymptotic', 'distributions', 'of', 'interlayer', 'directed', 'edge', 'weights', 'that', 'utilize', 'already', 'computed', 'neighborhood', 'selection', 'coefficients', 'for', 'nodes', 'in', 'the', 'upper', 'layer', 'subsequently', 'we', 'establish', 'global', 'and', 'simultaneous', 'testing', 'procedures', 'for', 'these', 'edge', 'weights', 'performance', 'of', 'the', 'proposed', 'methodology', 'is', 'evaluated', 'on', 'synthetic', 'and', 'real', 'data']] | [-0.07873339245855548, 0.04020527900993517, -0.02594001359095048, 0.02901663370706506, -0.06906718271424438, -0.15407511895071216, 0.1180951949232978, 0.40980371207805333, -0.28924630242207844, -0.2955883004673824, 0.11312990514177483, -0.26933754894377776, -0.17017270853747757, 0.1846840416114854, -0.041783189726273345, 0.08120816103278745, 0.11307469788535508, 0.006309199790211068, -0.010258677702387507, -0.22980192298376836, 0.33552126700092183, 0.02552965964123453, 0.33186709041678414, -0.0019503045831950976, 0.10337712621459133, 0.021150743408781505, -0.05537772377636092, 0.00928537254749807, -0.11992326842259571, 0.1423547778641037, 0.2702798037726191, 0.15752585223537946, 0.2893276215199688, -0.4831935017988969, -0.27148048325259355, 0.08212206820890154, 0.14368055276956754, 0.09007538676799873, -0.008639776779185097, -0.2403038351786966, 0.09794034577483676, -0.13403421807848157, -0.0526639135487224, -0.05569917692853253, -0.02863875041072516, 0.029693493473141926, -0.33465434313444514, 0.08343029597572521, 0.02183014933381724, 0.1007737609934057, -0.0920748873493759, -0.16486988134967817, -0.02737938641863347, 0.16451188775719164, 0.009561956922533279, -0.02422893516669535, 0.12086020894894693, -0.13501263705901945, -0.12754121244184136, 0.3059529852129269, -0.05831959435581854, -0.2090637311723429, 0.2157449913751238, -0.07397147707794745, -0.17490432331561753, 0.05519159678273748, 0.2445053621471293, 0.10858610928893934, -0.17031367699682867, 0.012407430441037166, -0.023609834077789632, 0.13200432902139603, 0.06352216836314686, 0.012643280680610597, 0.17184993030008927, 0.20354250401316076, 0.06572728315080256, 0.13290048050292114, -0.14700361548655322, -0.06511949554815427, -0.23456227305866106, -0.1435496206251309, -0.1642239304384236, -0.028670049169264043, -0.13336693007722808, -0.2075842498851455, 0.4189132349637635, 0.15406047996882463, 0.2374408728342273, 0.05624081914465558, 0.30357301966815264, 0.052373923553926775, 0.09972856498140957, 0.06610412361249135, 0.14954817031279743, 0.08239211251907598, 0.08262861502889697, -0.12782372251997903, 0.11923761137511543, 0.033506157711993174] |
1,803.03349 | Semi-cubically hyponormal weighted shifts with Stampfi's subnormal
completion | Let $\alpha :1,(1,\sqrt{x},\sqrt{y})^{\wedge }$ be a weight sequence with
Stampfli's subnormal completion and let $W_{\alpha }$ be its associated
weighted shift. In this paper we discuss some properties of the region
$\mathcal{U}:\mathcal{=}\{(x,y):W_{\alpha }$ is semi-cubically hyponormal$\}$
and describe the shape of the boundary of $\mathcal{U}$. In particular, we
improve the results of \cite[Theorem 4.2]{LLB} with properties of
$\mathcal{U}$.
| math.FA | let alpha 11sqrtxsqrtywedge be a weight sequence with stampflis subnormal completion and let w_alpha be its associated weighted shift in this paper we discuss some properties of the region mathcalumathcalxyw_alpha is semicubically hyponormal and describe the shape of the boundary of mathcalu in particular we improve the results of citetheorem 42llb with properties of mathcalu | [['let', 'alpha', '11sqrtxsqrtywedge', 'be', 'a', 'weight', 'sequence', 'with', 'stampflis', 'subnormal', 'completion', 'and', 'let', 'w_alpha', 'be', 'its', 'associated', 'weighted', 'shift', 'in', 'this', 'paper', 'we', 'discuss', 'some', 'properties', 'of', 'the', 'region', 'mathcalumathcalxyw_alpha', 'is', 'semicubically', 'hyponormal', 'and', 'describe', 'the', 'shape', 'of', 'the', 'boundary', 'of', 'mathcalu', 'in', 'particular', 'we', 'improve', 'the', 'results', 'of', 'citetheorem', '42llb', 'with', 'properties', 'of', 'mathcalu']] | [-0.11851143604144454, 0.12932056927122176, -0.06016485936939717, -0.028946919769514353, -0.08153464294970035, -0.07344957100227475, -0.007344805668108165, 0.4044551281630993, -0.3393819338083267, -0.18054632801562548, 0.12433848134707659, -0.2848290642350912, -0.13793099477887152, 0.16463419869542123, -0.163913750355714, -0.039043076419038696, 0.05278558863326907, 0.12377970956265927, -0.10723677374422551, -0.20661015052348375, 0.40239679634571074, -0.013610294526442886, 0.14972685719374568, 0.0931282303854823, 0.03331430373713374, -0.022443891605362296, -0.012528714970685542, 0.0018101054336875676, -0.22350915981456637, 0.1514221238810569, 0.24524773340672254, 0.15820182191208004, 0.25980174519121646, -0.3370105068385601, -0.16206043992191554, 0.24619142606854438, 0.1289483230561018, -0.06811906799674033, -0.028817495219409465, -0.2658230811171234, 0.16154044525697828, -0.14308263811049982, -0.16815514467656612, -0.03395267602521926, 0.007533160969614983, 0.06703338380903005, -0.30488242659717796, 0.01920411692932248, 0.10858969177585096, 0.02854905419051647, -0.11678604726446792, -0.12796828410588204, -0.0249373004026711, 0.12401578482240438, -0.014786066976375878, 0.06405619394034147, 0.04840549441054463, -0.10483195937704295, -0.0811940824240446, 0.3722279619053006, -0.08976279014721512, -0.19607310224324465, 0.08843908604234457, -0.22127693189308048, -0.15327417712658645, 0.04834366632625461, 0.12666212853975595, 0.15735413177870214, -0.05779290094971657, 0.20692383881425486, -0.08768279783194885, 0.12943402297794818, 0.05816109204199165, 0.08194867355749011, 0.1133202040567994, 0.1308651529578492, 0.0816788147483021, 0.19362848674878477, -0.031115358207607642, 0.05165935771539807, -0.363327628672123, -0.17102922812104226, -0.11584155115764588, 0.07838584387674928, -0.08943034864903893, -0.18407919213175775, 0.4172451377660036, 0.1041101685538888, 0.2754900366906077, 0.09574760355055333, 0.17878130219876767, 0.1376753021404147, 0.016762634785845876, 0.049925843020901084, 0.0984068550664233, 0.2048243222385645, 0.005153760015964508, -0.2216064974758774, 0.04517750992265064, 0.1468214797973633] |
1,803.0335 | Extremal rays in the Hermitian eigenvalue problem for arbitrary types | The Hermitian eigenvalue problem asks for the possible eigenvalues of a sum
of Hermitian matrices given the eigenvalues of the summands. This is a problem
about the Lie algebra of the maximal compact subgroup of
$G=\operatorname{SL}(n)$ . There is a polyhedral cone (the "eigencone")
determining the possible answers to the problem. These eigencones can be
defined for arbitrary semisimple groups $G$, and also control the (suitably
stabilized) problem of existence of non-zero invariants in tensor products of
irreducible representations of $G$.
We give a description of the extremal rays of the eigencones for arbitrary
semisimple groups $G$ by first observing that extremal rays lie on regular
facets, and then classifying extremal rays on an arbitrary regular face.
Explicit formulas are given for some extremal rays, which have an explicit
geometric meaning as cycle classes of interesting loci, on an arbitrary regular
face, and the remaining extremal rays on that face are understood by a
geometric process we introduce, and explicate numerically, called induction
from Levi subgroups. Several numerical examples are given. The main results,
and methods, of this paper generalize work of [Bel17] which handled the case of
$G=\operatorname{SL}(n)$.
| math.AG math.RT | the hermitian eigenvalue problem asks for the possible eigenvalues of a sum of hermitian matrices given the eigenvalues of the summands this is a problem about the lie algebra of the maximal compact subgroup of goperatornamesln there is a polyhedral cone the eigencone determining the possible answers to the problem these eigencones can be defined for arbitrary semisimple groups g and also control the suitably stabilized problem of existence of nonzero invariants in tensor products of irreducible representations of g we give a description of the extremal rays of the eigencones for arbitrary semisimple groups g by first observing that extremal rays lie on regular facets and then classifying extremal rays on an arbitrary regular face explicit formulas are given for some extremal rays which have an explicit geometric meaning as cycle classes of interesting loci on an arbitrary regular face and the remaining extremal rays on that face are understood by a geometric process we introduce and explicate numerically called induction from levi subgroups several numerical examples are given the main results and methods of this paper generalize work of bel17 which handled the case of goperatornamesln | [['the', 'hermitian', 'eigenvalue', 'problem', 'asks', 'for', 'the', 'possible', 'eigenvalues', 'of', 'a', 'sum', 'of', 'hermitian', 'matrices', 'given', 'the', 'eigenvalues', 'of', 'the', 'summands', 'this', 'is', 'a', 'problem', 'about', 'the', 'lie', 'algebra', 'of', 'the', 'maximal', 'compact', 'subgroup', 'of', 'goperatornamesln', 'there', 'is', 'a', 'polyhedral', 'cone', 'the', 'eigencone', 'determining', 'the', 'possible', 'answers', 'to', 'the', 'problem', 'these', 'eigencones', 'can', 'be', 'defined', 'for', 'arbitrary', 'semisimple', 'groups', 'g', 'and', 'also', 'control', 'the', 'suitably', 'stabilized', 'problem', 'of', 'existence', 'of', 'nonzero', 'invariants', 'in', 'tensor', 'products', 'of', 'irreducible', 'representations', 'of', 'g', 'we', 'give', 'a', 'description', 'of', 'the', 'extremal', 'rays', 'of', 'the', 'eigencones', 'for', 'arbitrary', 'semisimple', 'groups', 'g', 'by', 'first', 'observing', 'that', 'extremal', 'rays', 'lie', 'on', 'regular', 'facets', 'and', 'then', 'classifying', 'extremal', 'rays', 'on', 'an', 'arbitrary', 'regular', 'face', 'explicit', 'formulas', 'are', 'given', 'for', 'some', 'extremal', 'rays', 'which', 'have', 'an', 'explicit', 'geometric', 'meaning', 'as', 'cycle', 'classes', 'of', 'interesting', 'loci', 'on', 'an', 'arbitrary', 'regular', 'face', 'and', 'the', 'remaining', 'extremal', 'rays', 'on', 'that', 'face', 'are', 'understood', 'by', 'a', 'geometric', 'process', 'we', 'introduce', 'and', 'explicate', 'numerically', 'called', 'induction', 'from', 'levi', 'subgroups', 'several', 'numerical', 'examples', 'are', 'given', 'the', 'main', 'results', 'and', 'methods', 'of', 'this', 'paper', 'generalize', 'work', 'of', 'bel17', 'which', 'handled', 'the', 'case', 'of', 'goperatornamesln']] | [-0.16278874079722006, 0.09490423006645869, -0.053147779510834735, 0.06873320587947092, -0.11761104600705408, -0.10570668126330585, 0.003382712817197112, 0.3651512816649031, -0.2965219053867701, -0.2466454255898055, 0.1284288468563023, -0.25608958756752515, -0.15278406825822752, 0.20036368968839932, -0.11786889157193474, 0.016232993692864437, 0.08698270352180919, 0.1097312062789963, -0.08380966550557295, -0.27032486442350656, 0.4119819558829673, -0.0019328735970162057, 0.18184703810241173, 0.07072486520770031, 0.13721732376395046, 0.00767634322652845, -0.024711840113977323, 0.004784335669860042, -0.13952622878077325, 0.17368551722910205, 0.31664872239973096, 0.1194546034232386, 0.19226936883972706, -0.3695233497919666, -0.13613556515381395, 0.2229428913570135, 0.1410266794390171, 0.03632534753178825, -0.02980035556782339, -0.2808601994885484, 0.12007099171294956, -0.13532527543705059, -0.15551323504690584, -0.05634092904023222, 0.06499446686860677, -0.018948043726787375, -0.21644895369992465, 0.010472673216576663, 0.11466344346267146, 0.07717833581909135, -0.08358336575958576, -0.13236937909512905, -0.014073912806909632, 0.12686040471433788, 0.02104980417706601, -0.024671683186111418, 0.08010777491774108, -0.07860294973880455, -0.14808288435074124, 0.3897429354891584, 0.021479587803116523, -0.237990808673203, 0.11672060993575567, -0.1373569553063528, -0.1466731203940219, 0.125401022771021, 0.1462596030452767, 0.1935232194241237, -0.0797166787389968, 0.16854226634353148, -0.1335144213677661, 0.02869085468087547, 0.1325582899883188, -0.031054180448975514, 0.18515881156498515, 0.060391148551040004, 0.10477332412265242, 0.15291301066471213, 0.03851483855396509, 0.009438346567362345, -0.35843789532176545, -0.14735146084347286, -0.18465663842051416, 0.1278959471593938, -0.16313780853988893, -0.21671921270270203, 0.4431323115990774, 0.065830597360115, 0.19044031520229387, 0.09326265775598586, 0.22001223342644202, 0.08349309726051886, 0.003409934137645807, 0.08306226172056552, 0.1468234003390928, 0.20617763570232972, -0.060070576644628434, -0.17220628497794874, 0.01448102678247803, 0.16148323041160365] |
1,803.03351 | Expansion for the product of matrices in groups | In this paper, we give strong lower bounds on the size of the sets of
products of matrices in some certain groups. More precisely, we prove an
analogue of a result due to Chapman and Iosevich for matrices in
$SL_2(\mathbb{F}_p)$ with restricted entries on a small set. We also provide
extensions of some recent results on expansion for cubes in Heisenberg group
due to Hegyv\'{a}ri and Hennecart.
| math.NT math.CO | in this paper we give strong lower bounds on the size of the sets of products of matrices in some certain groups more precisely we prove an analogue of a result due to chapman and iosevich for matrices in sl_2mathbbf_p with restricted entries on a small set we also provide extensions of some recent results on expansion for cubes in heisenberg group due to hegyvari and hennecart | [['in', 'this', 'paper', 'we', 'give', 'strong', 'lower', 'bounds', 'on', 'the', 'size', 'of', 'the', 'sets', 'of', 'products', 'of', 'matrices', 'in', 'some', 'certain', 'groups', 'more', 'precisely', 'we', 'prove', 'an', 'analogue', 'of', 'a', 'result', 'due', 'to', 'chapman', 'and', 'iosevich', 'for', 'matrices', 'in', 'sl_2mathbbf_p', 'with', 'restricted', 'entries', 'on', 'a', 'small', 'set', 'we', 'also', 'provide', 'extensions', 'of', 'some', 'recent', 'results', 'on', 'expansion', 'for', 'cubes', 'in', 'heisenberg', 'group', 'due', 'to', 'hegyvari', 'and', 'hennecart']] | [-0.11799447834456453, 0.08402829195542974, -0.040833917369595976, 0.05885638544074909, -0.04043017847068382, -0.03767091697646362, 0.06998798043191941, 0.3364896606089491, -0.24427524115890265, -0.24178004231670816, 0.16552587501549473, -0.2807960029917233, -0.1494658483954316, 0.26125926678210043, -0.14846715489120194, 0.0021981713326760764, 0.06108503640544685, 0.05867129310332309, -0.08733528865162622, -0.29883697010562615, 0.3512732485471519, 0.022167180513144667, 0.19076197571826703, 0.10684808290027308, 0.05023778962310065, 0.025118176931176673, -0.036693624749949035, 0.0220217312770811, -0.16981330948571363, 0.16994607925527927, 0.1931021178254124, 0.08510881884263433, 0.22966236882193974, -0.4209174902150125, -0.10995589526172614, 0.15672221654235866, 0.10334004645560388, 0.1051948364739391, -0.06842279638041157, -0.27757323159709235, 0.1281617282127792, -0.19412410695275123, -0.10873489827623195, -0.0878858826419508, 0.05102382066384466, 0.01852569717095431, -0.27717391692214843, 0.045110883074371624, 0.10875835705717857, 0.0830768439495428, -0.06516235131262378, -0.164906098973006, 0.09580587018916215, 0.07664691601795229, 0.03333183964996627, -0.029758687759044045, -0.00011091561508223866, -0.08477692613307612, -0.10733821430723324, 0.3792790108162797, -0.07393585491191709, -0.22112027291829386, 0.19339255218140103, -0.19596598135081655, -0.20644194035875527, 0.06346610856907677, 0.18794696167054953, 0.09730013632427224, -0.06619153235982539, 0.13585757717991134, -0.14689832272459613, 0.10764388871294531, 0.09910538592234705, 0.04879020668114677, 0.08034991027494526, 0.07740819243234441, 0.1396601936554141, 0.1738289509596529, 0.02157075863656108, -0.022339207607067445, -0.27965871243257867, -0.16564400132858392, -0.1638066055549478, 0.08631154525121956, -0.12205468722095247, -0.18854709078423734, 0.36748077169371146, 0.14542603724861913, 0.2561728890251481, 0.10233214630914683, 0.2102853754591761, 0.06796414134022956, 0.058949460670577755, 0.06893061006893263, 0.1430941150059825, 0.22735019578513774, 0.03149222008968619, -0.11528962130912325, 0.030113396208352326, 0.12762658309304353] |
1,803.03352 | Indoor Scene Understanding in 2.5/3D for Autonomous Agents: A Survey | With the availability of low-cost and compact 2.5/3D visual sensing devices,
computer vision community is experiencing a growing interest in visual scene
understanding of indoor environments. This survey paper provides a
comprehensive background to this research topic. We begin with a historical
perspective, followed by popular 3D data representations and a comparative
analysis of available datasets. Before delving into the application specific
details, this survey provides a succinct introduction to the core technologies
that are the underlying methods extensively used in the literature. Afterwards,
we review the developed techniques according to a taxonomy based on the scene
understanding tasks. This covers holistic indoor scene understanding as well as
subtasks such as scene classification, object detection, pose estimation,
semantic segmentation, 3D reconstruction, saliency detection, physics-based
reasoning and affordance prediction. Later on, we summarize the performance
metrics used for evaluation in different tasks and a quantitative comparison
among the recent state-of-the-art techniques. We conclude this review with the
current challenges and an outlook towards the open research problems requiring
further investigation.
| cs.CV | with the availability of lowcost and compact 253d visual sensing devices computer vision community is experiencing a growing interest in visual scene understanding of indoor environments this survey paper provides a comprehensive background to this research topic we begin with a historical perspective followed by popular 3d data representations and a comparative analysis of available datasets before delving into the application specific details this survey provides a succinct introduction to the core technologies that are the underlying methods extensively used in the literature afterwards we review the developed techniques according to a taxonomy based on the scene understanding tasks this covers holistic indoor scene understanding as well as subtasks such as scene classification object detection pose estimation semantic segmentation 3d reconstruction saliency detection physicsbased reasoning and affordance prediction later on we summarize the performance metrics used for evaluation in different tasks and a quantitative comparison among the recent stateoftheart techniques we conclude this review with the current challenges and an outlook towards the open research problems requiring further investigation | [['with', 'the', 'availability', 'of', 'lowcost', 'and', 'compact', '253d', 'visual', 'sensing', 'devices', 'computer', 'vision', 'community', 'is', 'experiencing', 'a', 'growing', 'interest', 'in', 'visual', 'scene', 'understanding', 'of', 'indoor', 'environments', 'this', 'survey', 'paper', 'provides', 'a', 'comprehensive', 'background', 'to', 'this', 'research', 'topic', 'we', 'begin', 'with', 'a', 'historical', 'perspective', 'followed', 'by', 'popular', '3d', 'data', 'representations', 'and', 'a', 'comparative', 'analysis', 'of', 'available', 'datasets', 'before', 'delving', 'into', 'the', 'application', 'specific', 'details', 'this', 'survey', 'provides', 'a', 'succinct', 'introduction', 'to', 'the', 'core', 'technologies', 'that', 'are', 'the', 'underlying', 'methods', 'extensively', 'used', 'in', 'the', 'literature', 'afterwards', 'we', 'review', 'the', 'developed', 'techniques', 'according', 'to', 'a', 'taxonomy', 'based', 'on', 'the', 'scene', 'understanding', 'tasks', 'this', 'covers', 'holistic', 'indoor', 'scene', 'understanding', 'as', 'well', 'as', 'subtasks', 'such', 'as', 'scene', 'classification', 'object', 'detection', 'pose', 'estimation', 'semantic', 'segmentation', '3d', 'reconstruction', 'saliency', 'detection', 'physicsbased', 'reasoning', 'and', 'affordance', 'prediction', 'later', 'on', 'we', 'summarize', 'the', 'performance', 'metrics', 'used', 'for', 'evaluation', 'in', 'different', 'tasks', 'and', 'a', 'quantitative', 'comparison', 'among', 'the', 'recent', 'stateoftheart', 'techniques', 'we', 'conclude', 'this', 'review', 'with', 'the', 'current', 'challenges', 'and', 'an', 'outlook', 'towards', 'the', 'open', 'research', 'problems', 'requiring', 'further', 'investigation']] | [-0.04826769639510617, -0.03375472028805927, -0.06739188182317386, 0.035510843455821964, -0.1493254318234644, -0.1198081579319218, 0.019341619702615952, 0.4400935779681493, -0.20656554889033682, -0.3652844638009334, 0.12424111177997907, -0.26097895680937827, -0.18699849456260426, 0.2222751351960358, -0.17247397251599933, 0.08076742400659159, 0.17009259173313954, 0.031200772289940643, -0.09912648576954823, -0.23921176923128465, 0.2745559753841787, 0.05861600734282374, 0.36898805459384765, 0.07339499323418186, 0.08277990470551663, -0.009629895401650131, -0.13887138997199058, -0.004480740015640636, -0.14260698288390336, 0.2225764660633147, 0.38761058022889, 0.24834990999772258, 0.3181586204736959, -0.43026239913888276, -0.2601890173308285, 0.020588060347585098, 0.16300907263558612, 0.10296594174767615, -0.10883271443197459, -0.39638417803992826, 0.03780437364877712, -0.176196430714169, -0.018592875341277078, -0.0962520211926728, 0.02967594826727041, -0.04921146602960865, -0.1877179920584673, -0.002897290098189842, 0.06733128693927679, 0.13910269213929063, -0.08005351470040166, -0.12115911354721036, 0.09493641923819225, 0.21972372468804852, 0.03485729170469789, 0.06690479665052235, 0.17959814376774288, -0.22561106186635915, -0.16020055766178606, 0.4003491242017065, -0.01488718600012362, -0.17307265470680294, 0.23814100866383386, -0.01791020862791421, -0.20711828128939183, 0.05586149225460498, 0.23194237326138786, 0.11644849272921592, -0.18105936076469897, 0.006760292402066712, -0.01846938132907131, 0.1476262694521297, -0.002758053034388771, 0.013294140586540812, 0.26964791738317306, 0.33683792815455016, 0.04118580282547988, 0.1256916111112029, -0.11390516446581819, -0.058733868797952754, -0.22607807270902586, -0.11470490220623712, -0.1205925425021546, -0.008936517876766933, -0.05340694894948683, -0.14247670730643827, 0.4299035573134288, 0.25922368813371577, 0.17813028575342504, 0.035546325224762164, 0.4174685020975414, -0.02530876051570799, 0.04130900662407623, 0.03838011156490427, 0.1534765071493374, 0.03350339440346163, 0.19404187088366598, -0.11559761537522545, 0.057035403138364756, 0.05821825415304851] |
1,803.03353 | A-Optimal Sampling and Robust Reconstruction for Graph Signals via
Truncated Neumann Series | Graph signal processing (GSP) studies signals that live on irregular data
kernels described by graphs. One fundamental problem in GSP is sampling---from
which subset of graph nodes to collect samples in order to reconstruct a
bandlimited graph signal in high fidelity. In this paper, we seek a sampling
strategy that minimizes the mean square error (MSE) of the reconstructed
bandlimited graph signals assuming an independent and identically distributed
(iid) noise model---leading naturally to the A-optimal design criterion. To
avoid matrix inversion, we first prove that the inverse of the information
matrix in the A-optimal criterion is equivalent to a Neumann matrix series. We
then transform the truncated Neumann series based sampling problem into an
equivalent expression that replaces eigenvectors of the Laplacian operator with
a sub-matrix of an ideal low-pass graph filter. Finally, we approximate the
ideal filter using a Chebyshev matrix polynomial. We design a greedy algorithm
to iteratively minimize the simplified objective. For signal reconstruction, we
propose an accompanied signal reconstruction strategy that reuses the
approximated filter sub-matrix and is provably more robust than conventional
least square recovery. Simulation results show that our sampling strategy
outperforms two previous strategies in MSE performance at comparable
complexity.
| eess.SP | graph signal processing gsp studies signals that live on irregular data kernels described by graphs one fundamental problem in gsp is samplingfrom which subset of graph nodes to collect samples in order to reconstruct a bandlimited graph signal in high fidelity in this paper we seek a sampling strategy that minimizes the mean square error mse of the reconstructed bandlimited graph signals assuming an independent and identically distributed iid noise modelleading naturally to the aoptimal design criterion to avoid matrix inversion we first prove that the inverse of the information matrix in the aoptimal criterion is equivalent to a neumann matrix series we then transform the truncated neumann series based sampling problem into an equivalent expression that replaces eigenvectors of the laplacian operator with a submatrix of an ideal lowpass graph filter finally we approximate the ideal filter using a chebyshev matrix polynomial we design a greedy algorithm to iteratively minimize the simplified objective for signal reconstruction we propose an accompanied signal reconstruction strategy that reuses the approximated filter submatrix and is provably more robust than conventional least square recovery simulation results show that our sampling strategy outperforms two previous strategies in mse performance at comparable complexity | [['graph', 'signal', 'processing', 'gsp', 'studies', 'signals', 'that', 'live', 'on', 'irregular', 'data', 'kernels', 'described', 'by', 'graphs', 'one', 'fundamental', 'problem', 'in', 'gsp', 'is', 'samplingfrom', 'which', 'subset', 'of', 'graph', 'nodes', 'to', 'collect', 'samples', 'in', 'order', 'to', 'reconstruct', 'a', 'bandlimited', 'graph', 'signal', 'in', 'high', 'fidelity', 'in', 'this', 'paper', 'we', 'seek', 'a', 'sampling', 'strategy', 'that', 'minimizes', 'the', 'mean', 'square', 'error', 'mse', 'of', 'the', 'reconstructed', 'bandlimited', 'graph', 'signals', 'assuming', 'an', 'independent', 'and', 'identically', 'distributed', 'iid', 'noise', 'modelleading', 'naturally', 'to', 'the', 'aoptimal', 'design', 'criterion', 'to', 'avoid', 'matrix', 'inversion', 'we', 'first', 'prove', 'that', 'the', 'inverse', 'of', 'the', 'information', 'matrix', 'in', 'the', 'aoptimal', 'criterion', 'is', 'equivalent', 'to', 'a', 'neumann', 'matrix', 'series', 'we', 'then', 'transform', 'the', 'truncated', 'neumann', 'series', 'based', 'sampling', 'problem', 'into', 'an', 'equivalent', 'expression', 'that', 'replaces', 'eigenvectors', 'of', 'the', 'laplacian', 'operator', 'with', 'a', 'submatrix', 'of', 'an', 'ideal', 'lowpass', 'graph', 'filter', 'finally', 'we', 'approximate', 'the', 'ideal', 'filter', 'using', 'a', 'chebyshev', 'matrix', 'polynomial', 'we', 'design', 'a', 'greedy', 'algorithm', 'to', 'iteratively', 'minimize', 'the', 'simplified', 'objective', 'for', 'signal', 'reconstruction', 'we', 'propose', 'an', 'accompanied', 'signal', 'reconstruction', 'strategy', 'that', 'reuses', 'the', 'approximated', 'filter', 'submatrix', 'and', 'is', 'provably', 'more', 'robust', 'than', 'conventional', 'least', 'square', 'recovery', 'simulation', 'results', 'show', 'that', 'our', 'sampling', 'strategy', 'outperforms', 'two', 'previous', 'strategies', 'in', 'mse', 'performance', 'at', 'comparable', 'complexity']] | [-0.0975556603889578, 0.0005953225178811221, -0.09699146749260716, 0.06270803386608187, -0.10860135469918486, -0.16163366111234212, 0.03617546213611674, 0.43717786997723845, -0.33851513776641623, -0.2483745420518785, 0.14661589964913826, -0.27586044130894616, -0.21798356746096545, 0.13050837934208223, -0.1410056334287406, 0.10932377702078949, 0.11444216800065568, 0.05877447319336426, -0.08522969865693877, -0.257481886705724, 0.23543259986282256, 0.08025976049785431, 0.298949589048966, -0.08297374897385733, 0.1287577577937508, 0.04769818676898304, -0.04836724338850054, -0.010295424385903737, -0.09918329327416499, 0.08145837382270167, 0.2936132535851823, 0.18887149948079754, 0.31011571807739063, -0.41326004091459206, -0.1393648778565992, 0.1918158806955967, 0.14348621796338987, 0.06739648390644923, -0.03504583871041317, -0.26254613258135623, 0.1319493355253377, -0.11676806654207982, -0.024124125571539385, -0.03481721601878794, -0.060186729193306886, -0.036476022923269714, -0.40078909539450436, 0.07639554657567388, 0.057913060089907584, 0.011777754062309097, -0.00672114584594965, -0.1707092743450537, 0.07196941398776685, 0.057626337602209206, -0.0455332698360181, 0.02250699178996281, 0.11961769377812743, -0.06321998815147732, -0.1403231347612559, 0.31261333213068354, -0.06309131179310871, -0.24185784243238279, 0.07672885452062847, -0.08186237205846761, -0.11639093280268403, 0.1793258252290961, 0.18353606153351182, 0.06308714505285025, -0.16233639298723293, 0.04391864162264541, -0.050073417911353786, 0.1916522165808158, 0.05634017890462509, 0.024791371970413586, 0.09176435829617847, 0.14085859838777628, 0.18112463166889473, 0.1766687809385192, -0.07227296952205972, -0.051111286700082324, -0.26746180726346586, -0.11651861150749028, -0.33086088137605635, -0.007525663476628371, -0.16223337161966647, -0.1995776252868848, 0.420402498727139, 0.17691145757786356, 0.16859040890868085, 0.12356417901778163, 0.33921932904766156, 0.13085690030219177, 0.021006366803955574, 0.11374256208491249, 0.14249716400622559, 0.1492051310085047, 0.039736398300514196, -0.18784795051727157, 0.026623313878782286, 0.11533249309883477] |
1,803.03354 | Task Specific Visual Saliency Prediction with Memory Augmented
Conditional Generative Adversarial Networks | Visual saliency patterns are the result of a variety of factors aside from
the image being parsed, however existing approaches have ignored these. To
address this limitation, we propose a novel saliency estimation model which
leverages the semantic modelling power of conditional generative adversarial
networks together with memory architectures which capture the subject's
behavioural patterns and task dependent factors. We make contributions aiming
to bridge the gap between bottom-up feature learning capabilities in modern
deep learning architectures and traditional top-down hand-crafted features
based methods for task specific saliency modelling. The conditional nature of
the proposed framework enables us to learn contextual semantics and
relationships among different tasks together, instead of learning them
separately for each task. Our studies not only shed light on a novel
application area for generative adversarial networks, but also emphasise the
importance of task specific saliency modelling and demonstrate the plausibility
of fully capturing this context via an augmented memory architecture.
| cs.CV | visual saliency patterns are the result of a variety of factors aside from the image being parsed however existing approaches have ignored these to address this limitation we propose a novel saliency estimation model which leverages the semantic modelling power of conditional generative adversarial networks together with memory architectures which capture the subjects behavioural patterns and task dependent factors we make contributions aiming to bridge the gap between bottomup feature learning capabilities in modern deep learning architectures and traditional topdown handcrafted features based methods for task specific saliency modelling the conditional nature of the proposed framework enables us to learn contextual semantics and relationships among different tasks together instead of learning them separately for each task our studies not only shed light on a novel application area for generative adversarial networks but also emphasise the importance of task specific saliency modelling and demonstrate the plausibility of fully capturing this context via an augmented memory architecture | [['visual', 'saliency', 'patterns', 'are', 'the', 'result', 'of', 'a', 'variety', 'of', 'factors', 'aside', 'from', 'the', 'image', 'being', 'parsed', 'however', 'existing', 'approaches', 'have', 'ignored', 'these', 'to', 'address', 'this', 'limitation', 'we', 'propose', 'a', 'novel', 'saliency', 'estimation', 'model', 'which', 'leverages', 'the', 'semantic', 'modelling', 'power', 'of', 'conditional', 'generative', 'adversarial', 'networks', 'together', 'with', 'memory', 'architectures', 'which', 'capture', 'the', 'subjects', 'behavioural', 'patterns', 'and', 'task', 'dependent', 'factors', 'we', 'make', 'contributions', 'aiming', 'to', 'bridge', 'the', 'gap', 'between', 'bottomup', 'feature', 'learning', 'capabilities', 'in', 'modern', 'deep', 'learning', 'architectures', 'and', 'traditional', 'topdown', 'handcrafted', 'features', 'based', 'methods', 'for', 'task', 'specific', 'saliency', 'modelling', 'the', 'conditional', 'nature', 'of', 'the', 'proposed', 'framework', 'enables', 'us', 'to', 'learn', 'contextual', 'semantics', 'and', 'relationships', 'among', 'different', 'tasks', 'together', 'instead', 'of', 'learning', 'them', 'separately', 'for', 'each', 'task', 'our', 'studies', 'not', 'only', 'shed', 'light', 'on', 'a', 'novel', 'application', 'area', 'for', 'generative', 'adversarial', 'networks', 'but', 'also', 'emphasise', 'the', 'importance', 'of', 'task', 'specific', 'saliency', 'modelling', 'and', 'demonstrate', 'the', 'plausibility', 'of', 'fully', 'capturing', 'this', 'context', 'via', 'an', 'augmented', 'memory', 'architecture']] | [-0.016560323733175474, -0.02240733102164907, -0.08966111030820156, 0.0962514077591139, -0.17923439177534273, -0.1998006221177357, 0.05262067445118221, 0.4772625794814479, -0.29323330630338, -0.3419435684283775, 0.0028522425834389942, -0.23696128707078676, -0.23449058552543, 0.14397813194251108, -0.17087239373265015, 0.10812622866923771, 0.10607300775666391, 0.00783054179722263, -0.05018059694238247, -0.23154741929423425, 0.3519468581664466, 0.02784333042030583, 0.3783537183077105, 0.02636641708743428, 0.14393788013933978, -0.03811992250923668, -0.08381832199989848, -0.02225139789703873, -0.06574667864629338, 0.25121104596783556, 0.35647232759022907, 0.23382395415476734, 0.3548078737522085, -0.4612045554384108, -0.28429936901215586, 0.06878044141546613, 0.10647098741479098, 0.10040130109165706, -0.0092492209694859, -0.3689571498742988, 0.053970953610335146, -0.17349738582007346, 0.07380580844417695, -0.17329936856704373, -0.0353707822250022, -0.02791895664282023, -0.254636009277836, 0.007547822971490302, 0.11344848897217984, 0.06897103023384848, -0.03165388880447755, -0.10249432011417324, 0.035248083568688846, 0.19860359203453445, 0.039180889949502966, 0.0233333810472921, 0.16200292776188543, -0.23401418956589976, -0.18435716325132695, 0.32331520425936866, -0.012852219221061997, -0.210184717226413, 0.20336711180035866, 0.016534939047790343, -0.2052794183814718, 0.06156972761476232, 0.23808039772895076, 0.10470215589908373, -0.19480556470582322, 0.0013931727998199002, 0.0003272410241826888, 0.19772303902709315, 0.020700735403525253, 0.03775014377409412, 0.24537892115843152, 0.28116816873211536, -0.015510612319133454, 0.11791663183079612, -0.1326084231847011, -0.09961851626604555, -0.2071630248439408, -0.07736295381741178, -0.15097598785594588, -0.0676429509920361, -0.1140336545480926, -0.12808312430138505, 0.4127681839670385, 0.2719170016659078, 0.2441245070238027, 0.1404998454745979, 0.3772227554071334, 0.020313386622846367, 0.1342937581932112, 0.07273905857826674, 0.16606624703553896, 0.027254784461711683, 0.15242698213598135, -0.16882295800793556, 0.14058906913194205, 0.05537250551635459] |
1,803.03355 | Nonuniform Sampling for Random Signals Bandlimited in the Linear
Canonical Transform Domain | In this paper, we mainly investigate the nonuniform sampling for random
signals which are bandlimited in the linear canonical transform (LCT) domain.
We show that the nonuniform sampling for a random signal bandlimited in the LCT
domain is equal to the uniform sampling in the sense of second order statistic
characters after a pre-filter in the LCT domain. Moreover, we propose an
approximate recovery approach for nonuniform sampling of random signals
bandlimited in the LCT domain. Furthermore, we study the mean square error of
the nonuniform sampling. Finally, we do some simulations to verify the
correctness of our theoretical results.
| eess.SP | in this paper we mainly investigate the nonuniform sampling for random signals which are bandlimited in the linear canonical transform lct domain we show that the nonuniform sampling for a random signal bandlimited in the lct domain is equal to the uniform sampling in the sense of second order statistic characters after a prefilter in the lct domain moreover we propose an approximate recovery approach for nonuniform sampling of random signals bandlimited in the lct domain furthermore we study the mean square error of the nonuniform sampling finally we do some simulations to verify the correctness of our theoretical results | [['in', 'this', 'paper', 'we', 'mainly', 'investigate', 'the', 'nonuniform', 'sampling', 'for', 'random', 'signals', 'which', 'are', 'bandlimited', 'in', 'the', 'linear', 'canonical', 'transform', 'lct', 'domain', 'we', 'show', 'that', 'the', 'nonuniform', 'sampling', 'for', 'a', 'random', 'signal', 'bandlimited', 'in', 'the', 'lct', 'domain', 'is', 'equal', 'to', 'the', 'uniform', 'sampling', 'in', 'the', 'sense', 'of', 'second', 'order', 'statistic', 'characters', 'after', 'a', 'prefilter', 'in', 'the', 'lct', 'domain', 'moreover', 'we', 'propose', 'an', 'approximate', 'recovery', 'approach', 'for', 'nonuniform', 'sampling', 'of', 'random', 'signals', 'bandlimited', 'in', 'the', 'lct', 'domain', 'furthermore', 'we', 'study', 'the', 'mean', 'square', 'error', 'of', 'the', 'nonuniform', 'sampling', 'finally', 'we', 'do', 'some', 'simulations', 'to', 'verify', 'the', 'correctness', 'of', 'our', 'theoretical', 'results']] | [-0.09590098802000284, 0.09691333901544567, -0.10212284261360764, 0.10023938081692904, -0.08054417567327618, -0.02069813197478652, 0.06486361060873605, 0.47613572164438667, -0.30319800924509765, -0.21645798335084693, 0.14461651123827324, -0.19393448859453202, -0.18679882895201444, 0.1697179891646374, -0.14252966748783366, 0.09865422899834812, 0.04630430300720036, 0.03743054131045938, -0.1220033264043741, -0.23669878067448735, 0.2341560648009181, 0.04374953119084239, 0.31462142150849104, -0.06726407494279556, 0.08030882253311575, 0.053574409340508285, -0.08902229472063482, -0.01508441829122603, -0.1411320025407622, 0.09630081533454359, 0.2123027534596622, 0.10413066796958446, 0.3031501168757677, -0.4065250460989773, -0.2134486200660467, 0.1512862104550004, 0.1369046564772725, 0.12397542450926266, -0.08352417266461998, -0.2872838090918958, 0.15465460882740445, -0.08694419162347913, -0.044394218426314185, -0.07202829530462623, -0.05061019665095955, 0.09529411136871203, -0.3442903246043716, 0.09595089845359325, 0.15243558646179736, 0.054018239704892036, -0.04006780434865505, -0.08209957740502433, 0.09463176210643724, 0.09260607264586725, 0.009452381345909089, 0.036630751949269326, 0.0698876610537991, -0.1006493926118128, -0.10954207907547243, 0.32275605922564865, -0.047009625450591556, -0.2866049381531775, 0.13487717264331878, -0.190675463732332, -0.13648639560909942, 0.14304209823254496, 0.2119943578261882, 0.10306588725186884, -0.1404003632441163, 0.08016781851649285, -0.0651130424439907, 0.17534187508746982, 0.07326837894506752, 0.008348903036676347, 0.09430995220318436, 0.10620782865211367, 0.13034321082988753, 0.20641159189632163, -0.19134065619669854, -0.09827878002543003, -0.3025351990049239, -0.1349949397193268, -0.2897250010073185, -0.03491154664894566, -0.1328393609309569, -0.22251666037365794, 0.45073942789807914, 0.2181925796950236, 0.1384366655163467, 0.1416481391119305, 0.31397801283746957, 0.13660941390902737, -0.019772354606539012, 0.0626446525217034, 0.16236617454938823, 0.16120899169705807, 0.07196387767791748, -0.17845789857936326, -0.004034281405620277, 0.06017581907566637] |
1,803.03356 | Towards replicability with confidence intervals for the exceedance
probability | Several scientific fields including psychology are undergoing a replication
crisis. There are many reasons for this problem, one of which is a misuse of
p-values. There are several alternatives to p-values, and in this paper we
describe a complement that is geared towards replication. In particular, we
focus on confidence intervals for the probability that a parameter estimate
will exceed a specified value in an exact replication study. These intervals
convey uncertainty in a way that p-values and standard confidence intervals do
not, and can help researchers to draw sounder scientific conclusions. After
briefly reviewing background on p-values and a few alternatives, we describe
our approach and provide examples with simulated and real data. For linear
models, we also describe how confidence intervals for the exceedance
probability are related to p-values and confidence intervals for parameters.
| stat.ME | several scientific fields including psychology are undergoing a replication crisis there are many reasons for this problem one of which is a misuse of pvalues there are several alternatives to pvalues and in this paper we describe a complement that is geared towards replication in particular we focus on confidence intervals for the probability that a parameter estimate will exceed a specified value in an exact replication study these intervals convey uncertainty in a way that pvalues and standard confidence intervals do not and can help researchers to draw sounder scientific conclusions after briefly reviewing background on pvalues and a few alternatives we describe our approach and provide examples with simulated and real data for linear models we also describe how confidence intervals for the exceedance probability are related to pvalues and confidence intervals for parameters | [['several', 'scientific', 'fields', 'including', 'psychology', 'are', 'undergoing', 'a', 'replication', 'crisis', 'there', 'are', 'many', 'reasons', 'for', 'this', 'problem', 'one', 'of', 'which', 'is', 'a', 'misuse', 'of', 'pvalues', 'there', 'are', 'several', 'alternatives', 'to', 'pvalues', 'and', 'in', 'this', 'paper', 'we', 'describe', 'a', 'complement', 'that', 'is', 'geared', 'towards', 'replication', 'in', 'particular', 'we', 'focus', 'on', 'confidence', 'intervals', 'for', 'the', 'probability', 'that', 'a', 'parameter', 'estimate', 'will', 'exceed', 'a', 'specified', 'value', 'in', 'an', 'exact', 'replication', 'study', 'these', 'intervals', 'convey', 'uncertainty', 'in', 'a', 'way', 'that', 'pvalues', 'and', 'standard', 'confidence', 'intervals', 'do', 'not', 'and', 'can', 'help', 'researchers', 'to', 'draw', 'sounder', 'scientific', 'conclusions', 'after', 'briefly', 'reviewing', 'background', 'on', 'pvalues', 'and', 'a', 'few', 'alternatives', 'we', 'describe', 'our', 'approach', 'and', 'provide', 'examples', 'with', 'simulated', 'and', 'real', 'data', 'for', 'linear', 'models', 'we', 'also', 'describe', 'how', 'confidence', 'intervals', 'for', 'the', 'exceedance', 'probability', 'are', 'related', 'to', 'pvalues', 'and', 'confidence', 'intervals', 'for', 'parameters']] | [-0.07192395607639543, 0.0727284216119348, -0.08068104551913326, 0.15747619954088485, -0.08486251148347304, -0.14285331913475496, 0.12687099635042934, 0.43733234081746025, -0.17871564582524382, -0.2849027399754371, 0.15153646811171817, -0.284592785023372, -0.11315304615324268, 0.25917127205064067, -0.12189271222575157, 0.053631876458359116, 0.08466357562471838, 0.042036144472256315, -0.01757538865957245, -0.2759302057307008, 0.2770759447149056, 0.05840431616011569, 0.264127670931082, 0.029045699140303496, 0.058443878687445674, -0.03970518418560352, -0.05138617666328654, 0.026565466610276523, -0.17456594036684692, 0.14220266860331107, 0.331864311443202, 0.2390536044327104, 0.3398655336966519, -0.38319169349030263, -0.17669644198202364, 0.11520921643686426, 0.13238886464387178, 0.12772807902365457, -0.03965827267829274, -0.2650096534463741, 0.08089534856502295, -0.18455699926005978, -0.0751320298980264, -0.11260250356452375, 0.024784259417655823, 0.012614982420927845, -0.2891075704049881, 0.07131863464682657, 0.01780520138580708, 0.0881227266303647, -0.013358505998279297, -0.13706595989916584, 0.0675824298437767, 0.12243509060799089, 0.1205309204695582, -0.01319318136837169, 0.12968871808912166, -0.08392646756564158, -0.17158686154032374, 0.3252536365693873, 0.014833218308494371, -0.25430581049123946, 0.18150992570307983, -0.1419581302017083, -0.21077438286224873, 0.06585171483011971, 0.18586064841142882, 0.07104552061130509, -0.17304839808082975, 0.05296371623519329, 0.014981106183875133, 0.1573953831273898, 0.08470321456757922, -0.02589095095754601, 0.24390768499442322, 0.13204947632894962, 0.04770780127171961, 0.06655981606523068, -0.08546924542101539, -0.09397133318570387, -0.34007997852270766, -0.14149674226321032, -0.12689743540592163, -0.009821850230283043, -0.08392937702175164, -0.1761765567421475, 0.40311679476872087, 0.2579336863606894, 0.2154095095979488, 0.13213513889743755, 0.256828549585086, 0.0842618611684028, -0.007764206048758591, 0.0543941336509306, 0.19675181493135718, 0.05068528909674462, 0.013436205411220299, -0.07326126023305252, 0.10548864692271523, -0.022140077157767817] |
1,803.03357 | Inequalities for the Wasserstein mean of positive definite matrices | We prove majorization inequalities for different means of positive definite
matrices. These include the Cartan mean (the Karcher mean), the log Euclidean
mean, the Wasserstein mean and the power mean.
| math.FA | we prove majorization inequalities for different means of positive definite matrices these include the cartan mean the karcher mean the log euclidean mean the wasserstein mean and the power mean | [['we', 'prove', 'majorization', 'inequalities', 'for', 'different', 'means', 'of', 'positive', 'definite', 'matrices', 'these', 'include', 'the', 'cartan', 'mean', 'the', 'karcher', 'mean', 'the', 'log', 'euclidean', 'mean', 'the', 'wasserstein', 'mean', 'and', 'the', 'power', 'mean']] | [-0.0828526254093352, 0.08652367402488986, -0.08415582080682119, 0.20017336482803028, -0.004554045014083385, -0.12919604557876785, -0.034247969401379426, 0.345237589130799, -0.3450042590809365, -0.2697459997764478, 0.04578851422605415, -0.3409331184501449, -0.13775441162288188, 0.12285967003554106, -0.1577034680172801, 0.14358358805378277, -0.011168808986743292, 0.13994732491361597, -0.2225278090685606, -0.29859984014183283, 0.3271971866488457, -0.03594476338475942, 0.20824132200796158, 0.07681353518661732, 0.2080400021436314, 0.01000811269817253, -0.08860812913626433, 0.05025800069173177, -0.20078560585776964, 0.18171652570987742, 0.1682011530579378, 0.122690898203291, 0.35364737088481585, -0.3549148187041283, -0.17083156229928137, 0.26712041220938165, 0.09843168025836349, -0.03635419526447852, -0.004492294516724845, -0.29019616867105164, 0.05232514194988956, -0.05772968300928672, -0.13229455776357402, -0.055085375097890694, -0.006043777956316869, 0.09673393974080682, -0.2948320223018527, 0.19909075025158623, 0.05072316415607929, 0.15583663893630728, -0.09563689983139435, -0.2846132267266512, 0.03459222639600436, 0.11325203872596225, 0.03282568383341034, -0.007048758061137051, 0.09945229451792935, 0.030586894353230795, -0.09623561326103906, 0.2453875410060088, -0.09870302441219489, -0.29645002412920196, -0.008100060311456521, -0.184449365362525, -0.03149273209273815, 0.029842114076018333, 0.1990966079135736, 0.16354211370150248, -0.08639170741662383, 0.09584713044071881, -0.08053793457026283, 0.047625543798009554, 0.0614166003651917, -0.012542533874511718, 0.08753559036801259, -0.04419059744104743, 0.17789867529645562, 0.06118079405277967, -0.06462005712091923, -0.18100433587096632, -0.3650007250097891, -0.26515756944815316, -0.21144676767289639, 0.16147548792262872, -0.32766361557442, -0.19056093747106692, 0.35125500410795213, 0.02419227473437786, 0.13857799991965294, 0.2843814563161383, 0.21085911526655157, 0.17104305612544218, 0.0238997974122564, 0.17427862693245214, 0.23454027893021703, 0.30153052012125653, 0.02779580846351261, -0.2217366576815645, 0.019159064767882227, 0.18154520330329735] |
1,803.03358 | A Polynomial Kernel for Diamond-Free Editing | An $H$-free editing problem asks whether we can edit at most $k$ edges to
make a graph contain no induced copy of the fixed graph $H$. We obtain a
polynomial kernel for this problem when $H$ is a diamond. The incompressibility
dichotomy for $H$ being a 3-connected graph and the classical complexity
dichotomy suggest that except for $H$ being a complete/empty graph, $H$-free
editing problems admit polynomial kernels only for a few small graphs $H$.
Therefore, we believe that our result is an essential step toward a complete
dichotomy on the compressibility of $H$-free editing. Additionally, we give a
cubic-vertex kernel for the diamond-free edge deletion problem, which is far
simpler than the previous kernel of the same size for the problem.
| cs.DS | an hfree editing problem asks whether we can edit at most k edges to make a graph contain no induced copy of the fixed graph h we obtain a polynomial kernel for this problem when h is a diamond the incompressibility dichotomy for h being a 3connected graph and the classical complexity dichotomy suggest that except for h being a completeempty graph hfree editing problems admit polynomial kernels only for a few small graphs h therefore we believe that our result is an essential step toward a complete dichotomy on the compressibility of hfree editing additionally we give a cubicvertex kernel for the diamondfree edge deletion problem which is far simpler than the previous kernel of the same size for the problem | [['an', 'hfree', 'editing', 'problem', 'asks', 'whether', 'we', 'can', 'edit', 'at', 'most', 'k', 'edges', 'to', 'make', 'a', 'graph', 'contain', 'no', 'induced', 'copy', 'of', 'the', 'fixed', 'graph', 'h', 'we', 'obtain', 'a', 'polynomial', 'kernel', 'for', 'this', 'problem', 'when', 'h', 'is', 'a', 'diamond', 'the', 'incompressibility', 'dichotomy', 'for', 'h', 'being', 'a', '3connected', 'graph', 'and', 'the', 'classical', 'complexity', 'dichotomy', 'suggest', 'that', 'except', 'for', 'h', 'being', 'a', 'completeempty', 'graph', 'hfree', 'editing', 'problems', 'admit', 'polynomial', 'kernels', 'only', 'for', 'a', 'few', 'small', 'graphs', 'h', 'therefore', 'we', 'believe', 'that', 'our', 'result', 'is', 'an', 'essential', 'step', 'toward', 'a', 'complete', 'dichotomy', 'on', 'the', 'compressibility', 'of', 'hfree', 'editing', 'additionally', 'we', 'give', 'a', 'cubicvertex', 'kernel', 'for', 'the', 'diamondfree', 'edge', 'deletion', 'problem', 'which', 'is', 'far', 'simpler', 'than', 'the', 'previous', 'kernel', 'of', 'the', 'same', 'size', 'for', 'the', 'problem']] | [-0.1146869786355334, 0.07937126540952401, -0.05434342525356139, 0.08194368417413594, -0.16408112019804927, -0.1842630312933276, 0.07645203558689294, 0.42776617808267475, -0.3076599359328005, -0.3048276272447159, 0.09964017371433632, -0.3007922011427581, -0.11659955908350336, 0.14041090252964447, -0.09783400166973782, 0.03753067080882223, 0.17698855263103422, 0.10119091226564099, 0.025397313366799304, -0.26171013617907496, 0.2934684721461963, -0.024173266772413625, 0.1422583747616348, 0.10314235917758197, 0.03274744417382559, 0.03589342761745987, 0.0046414918799807005, 0.07190926270947481, -0.1725637579381631, 0.04636274036117053, 0.2867522051014627, 0.16911709966758887, 0.28832690491108226, -0.39200465457203487, -0.17738318641495426, 0.2087054712503838, 0.13694479938324852, 0.10969112985670411, -0.03962334939763726, -0.18299097261284866, 0.10860453161731129, -0.062322432939739277, -0.05620426914732282, 0.02522976614224414, 0.12350794881349429, -0.10565943574377647, -0.2917277195102846, 0.0118810815406808, 0.18578543580758075, 0.03640136200313767, 0.03060122745228, -0.1505944556168591, 0.01081583821796812, 0.0921445958794114, -0.11598457897974489, 0.10324798812362132, 0.05812622645171359, -0.1674235876397385, -0.13315407373399163, 0.3831968208076432, -0.009792228185324348, -0.1520280663932984, 0.14173284772550687, -0.09160134124977048, -0.23049994241446256, 0.134829729188156, 0.08300234585379561, 0.16781722662659984, -0.09811101467215243, 0.14322164763337544, -0.13786976160481573, 0.14830503193079494, 0.10991653942037374, 0.00023776229451565693, 0.08783910074077236, 0.14144115387656106, 0.2100822414504364, 0.2127632671346267, 0.01865189772991774, 0.0278176874271594, -0.2778639388891558, -0.14370727587956936, -0.23302541612259423, 0.05141663943553188, -0.1965227748615386, -0.2575180045949916, 0.39287252192540717, 0.08733226382319118, 0.21460236440664934, 0.10363012788681468, 0.23447091210012636, 0.09449993933376391, 0.07183466001879424, 0.17804882288522397, 0.12869852134026588, 0.14044643027397494, -0.0028969392219247918, -0.18829332737562557, 0.11939856401101376, 0.13661367035044047] |
1,803.03359 | A Quest for the Structure of Intra- and Postoperative Surgical Team
Networks: Does the Small World Property Evolve over Time? | We examined the structure of intra- and postoperative case-collaboration
networks among the surgical service providers in a quaternary-care academic
medical center, using retrospective electronic medical record (EMR) data. We
also analyzed the evolution of the network properties over time, as changes in
nodes and edges can affect the network structure. We used de-identified intra-
and postoperative data for adult patients, ages >= 21, who received
nonambulatory/nonobstetric surgery at Shands at the University of Florida
between June 1, 2011 and November 1, 2014. The intraoperative segment contained
30,245 surgical cases, and the postoperative segment considered 30,202
hospitalizations. Our results confirmed the existence of strict small world
structure in both intra- and postoperative surgical team networks. A sudden
declining trend is expected in the future in both intra- and postoperative
networks, since the small world property is currently at its peak. In addition,
high network density was observed in the intraoperative segment and partially
in postoperative one, representing the existence of cohesive clusters of
providers. We also observed that the small world property is exhibited more in
the intraoperative compared to the postoperative network. Analyzing the
temporal aspects of the networks revealed the postoperative segment tends to
lose its cohesiveness as the time passes. Our results highlight the importance
of stability of personnel in key positions. This highlights the important role
of the central players in the network that offers change-leaders the
opportunity to quantify and target those nodes as mediators of process change.
| cs.SI | we examined the structure of intra and postoperative casecollaboration networks among the surgical service providers in a quaternarycare academic medical center using retrospective electronic medical record emr data we also analyzed the evolution of the network properties over time as changes in nodes and edges can affect the network structure we used deidentified intra and postoperative data for adult patients ages 21 who received nonambulatorynonobstetric surgery at shands at the university of florida between june 1 2011 and november 1 2014 the intraoperative segment contained 30245 surgical cases and the postoperative segment considered 30202 hospitalizations our results confirmed the existence of strict small world structure in both intra and postoperative surgical team networks a sudden declining trend is expected in the future in both intra and postoperative networks since the small world property is currently at its peak in addition high network density was observed in the intraoperative segment and partially in postoperative one representing the existence of cohesive clusters of providers we also observed that the small world property is exhibited more in the intraoperative compared to the postoperative network analyzing the temporal aspects of the networks revealed the postoperative segment tends to lose its cohesiveness as the time passes our results highlight the importance of stability of personnel in key positions this highlights the important role of the central players in the network that offers changeleaders the opportunity to quantify and target those nodes as mediators of process change | [['we', 'examined', 'the', 'structure', 'of', 'intra', 'and', 'postoperative', 'casecollaboration', 'networks', 'among', 'the', 'surgical', 'service', 'providers', 'in', 'a', 'quaternarycare', 'academic', 'medical', 'center', 'using', 'retrospective', 'electronic', 'medical', 'record', 'emr', 'data', 'we', 'also', 'analyzed', 'the', 'evolution', 'of', 'the', 'network', 'properties', 'over', 'time', 'as', 'changes', 'in', 'nodes', 'and', 'edges', 'can', 'affect', 'the', 'network', 'structure', 'we', 'used', 'deidentified', 'intra', 'and', 'postoperative', 'data', 'for', 'adult', 'patients', 'ages', '21', 'who', 'received', 'nonambulatorynonobstetric', 'surgery', 'at', 'shands', 'at', 'the', 'university', 'of', 'florida', 'between', 'june', '1', '2011', 'and', 'november', '1', '2014', 'the', 'intraoperative', 'segment', 'contained', '30245', 'surgical', 'cases', 'and', 'the', 'postoperative', 'segment', 'considered', '30202', 'hospitalizations', 'our', 'results', 'confirmed', 'the', 'existence', 'of', 'strict', 'small', 'world', 'structure', 'in', 'both', 'intra', 'and', 'postoperative', 'surgical', 'team', 'networks', 'a', 'sudden', 'declining', 'trend', 'is', 'expected', 'in', 'the', 'future', 'in', 'both', 'intra', 'and', 'postoperative', 'networks', 'since', 'the', 'small', 'world', 'property', 'is', 'currently', 'at', 'its', 'peak', 'in', 'addition', 'high', 'network', 'density', 'was', 'observed', 'in', 'the', 'intraoperative', 'segment', 'and', 'partially', 'in', 'postoperative', 'one', 'representing', 'the', 'existence', 'of', 'cohesive', 'clusters', 'of', 'providers', 'we', 'also', 'observed', 'that', 'the', 'small', 'world', 'property', 'is', 'exhibited', 'more', 'in', 'the', 'intraoperative', 'compared', 'to', 'the', 'postoperative', 'network', 'analyzing', 'the', 'temporal', 'aspects', 'of', 'the', 'networks', 'revealed', 'the', 'postoperative', 'segment', 'tends', 'to', 'lose', 'its', 'cohesiveness', 'as', 'the', 'time', 'passes', 'our', 'results', 'highlight', 'the', 'importance', 'of', 'stability', 'of', 'personnel', 'in', 'key', 'positions', 'this', 'highlights', 'the', 'important', 'role', 'of', 'the', 'central', 'players', 'in', 'the', 'network', 'that', 'offers', 'changeleaders', 'the', 'opportunity', 'to', 'quantify', 'and', 'target', 'those', 'nodes', 'as', 'mediators', 'of', 'process', 'change']] | [-0.08561218436160642, 0.052985135234770976, -0.04243004440457329, 0.0861243213963602, -0.01878678509627238, -0.09884115994677074, 0.07155382031431565, 0.40989121641072196, -0.22546075966057932, -0.33329677593913704, 0.10951671145336989, -0.3134663140711685, -0.16818542431037015, 0.1405594333425228, -0.11303373767683904, 0.011043100827274064, 0.11648456134851305, 0.06002979380333334, 0.013525906087816732, -0.2800026771813456, 0.2597116117224368, 0.07798918378419983, 0.3376651165358181, 0.08217475013822341, 0.06518677410442764, 0.032795521763002135, -0.04805650801943122, -0.001951369511617587, -0.06978144186257104, 0.1029119552909429, 0.3149917722813005, 0.16753391800129896, 0.3235436708688274, -0.4543045731619574, -0.1942789256856299, 0.10623179490351652, 0.10246187553275377, 0.04351116458708261, 0.006727981045491432, -0.34877131203921813, 0.0716560524079897, -0.1538096670435471, -0.10603525566283423, -0.025335010984896593, 0.03583099324336777, 0.019983411294957384, -0.23379089814211784, 0.0961736602403729, -0.023575196335187707, 0.10364969222185512, -0.1131468632320165, -0.09552309894735296, -0.07762398096259174, 0.2853762166769618, 0.04705408906141738, 0.03789701338451451, 0.14593760114815882, -0.17426867492827308, -0.11320919516938141, 0.36859699861647993, 0.0287698665394997, -0.07782811909102094, 0.18746512177456012, -0.14431534067162463, -0.15209449249960016, 0.10600482952546202, 0.20533359638200357, 0.05560353618218667, -0.13582610368851022, -0.01828203734003493, 0.023690700194418973, 0.147114195385311, 0.08780948805789916, -0.009991473538212033, 0.17552652990875336, 0.21791330937387693, 0.00821154629642494, 0.10527348505038545, -0.15352844863803658, -0.07930720242687589, -0.21575854483964002, -0.1410538869220032, -0.13886934753833738, -0.012032061546611099, -0.10850178734263809, -0.13250374399189258, 0.41668457459881264, 0.14923224104548463, 0.17030272990739784, 0.0065205391341199475, 0.2869531573751607, 0.0017940852185114264, 0.09032743991726738, 0.0757248737435374, 0.21491088218784007, 0.06190281195574018, 0.1900677909496495, -0.20857854135648912, 0.14201879747307453, -0.024489635618057292] |
1,803.0336 | Dynamical evolutions in non-Hermitian triple-well system with complex
potential | We investigate the dynamical properties for non-Hermitian triple-well system
with a loss in the middle well. When chemical potentials in two end wells are
uniform and nonlinear interactions are neglected, there always exists a dark
state, whose eigenenergy becomes zero, and the projections onto which do not
change over time and the loss factor. The increasing of loss factor only makes
the damping form from the oscillating decay to over-damping decay. However,
when the nonlinear interaction is introduced, even interactions in the two end
wells are also uniform, the projection of the dark state will be obviously
diminished. Simultaneously the increasing of loss factor will also aggravate
the loss. In this process the interaction in the middle well plays no role.
When two chemical potentials or interactions in two end wells are not uniform
all disappear with time. In addition, when we extend the triple-well system to
a general (2n + 1)-well, the loss is reduced greatly by the factor 1=2n in the
absence of the nonlinear interaction.
| cond-mat.quant-gas | we investigate the dynamical properties for nonhermitian triplewell system with a loss in the middle well when chemical potentials in two end wells are uniform and nonlinear interactions are neglected there always exists a dark state whose eigenenergy becomes zero and the projections onto which do not change over time and the loss factor the increasing of loss factor only makes the damping form from the oscillating decay to overdamping decay however when the nonlinear interaction is introduced even interactions in the two end wells are also uniform the projection of the dark state will be obviously diminished simultaneously the increasing of loss factor will also aggravate the loss in this process the interaction in the middle well plays no role when two chemical potentials or interactions in two end wells are not uniform all disappear with time in addition when we extend the triplewell system to a general 2n 1well the loss is reduced greatly by the factor 12n in the absence of the nonlinear interaction | [['we', 'investigate', 'the', 'dynamical', 'properties', 'for', 'nonhermitian', 'triplewell', 'system', 'with', 'a', 'loss', 'in', 'the', 'middle', 'well', 'when', 'chemical', 'potentials', 'in', 'two', 'end', 'wells', 'are', 'uniform', 'and', 'nonlinear', 'interactions', 'are', 'neglected', 'there', 'always', 'exists', 'a', 'dark', 'state', 'whose', 'eigenenergy', 'becomes', 'zero', 'and', 'the', 'projections', 'onto', 'which', 'do', 'not', 'change', 'over', 'time', 'and', 'the', 'loss', 'factor', 'the', 'increasing', 'of', 'loss', 'factor', 'only', 'makes', 'the', 'damping', 'form', 'from', 'the', 'oscillating', 'decay', 'to', 'overdamping', 'decay', 'however', 'when', 'the', 'nonlinear', 'interaction', 'is', 'introduced', 'even', 'interactions', 'in', 'the', 'two', 'end', 'wells', 'are', 'also', 'uniform', 'the', 'projection', 'of', 'the', 'dark', 'state', 'will', 'be', 'obviously', 'diminished', 'simultaneously', 'the', 'increasing', 'of', 'loss', 'factor', 'will', 'also', 'aggravate', 'the', 'loss', 'in', 'this', 'process', 'the', 'interaction', 'in', 'the', 'middle', 'well', 'plays', 'no', 'role', 'when', 'two', 'chemical', 'potentials', 'or', 'interactions', 'in', 'two', 'end', 'wells', 'are', 'not', 'uniform', 'all', 'disappear', 'with', 'time', 'in', 'addition', 'when', 'we', 'extend', 'the', 'triplewell', 'system', 'to', 'a', 'general', '2n', '1well', 'the', 'loss', 'is', 'reduced', 'greatly', 'by', 'the', 'factor', '12n', 'in', 'the', 'absence', 'of', 'the', 'nonlinear', 'interaction']] | [-0.15263715617538218, 0.20026792938742471, -0.03902308172960092, 0.07561921265861168, -0.005309333719021405, -0.1434040085155887, 0.012734825069264296, 0.38473044865742234, -0.2934354444045618, -0.27790766840391085, 0.07124579862056087, -0.2928141327574849, -0.13030801609534412, 0.1466770205381663, -0.0011095672800957438, 0.015791222812181496, 0.06140044778557382, 0.04231982760366995, -0.08408241007751953, -0.2531082532536912, 0.35488171924707895, 0.02932586565933538, 0.23186146083613296, 0.0803279515260449, 0.02894442758231188, 0.030838127570585853, 0.03979093419859208, -1.9631967094379017e-05, -0.07529565142692034, 0.04751733790926007, 0.1795761989193256, 0.032496927653899395, 0.30067570012971667, -0.4268117674727397, -0.21757000967431028, 0.14782990529258028, 0.17812714398647828, 0.12363388420416446, -0.057004137379145364, -0.22649720285357122, 0.017281879380493317, -0.1696200845370361, -0.12630066730878708, -0.02137941483389628, 0.015663854547787504, 0.028501244011497777, -0.27359967165716353, 0.09865782526847681, 0.089008785568771, 0.006649829952203366, -0.07357272607588534, -0.09100922523978087, -0.03234264319369861, 0.13259021269861632, 0.027259715554880888, 0.02313676555023854, 0.11460774415172637, -0.1756885432040723, -0.04535236241329596, 0.37329003398295446, -0.09121542777908202, -0.21708743332419544, 0.1982744814693389, -0.16900368915949332, -0.05403070628968438, 0.1431292194272784, 0.15132631700631816, 0.056603125097364725, -0.13004176588259156, 0.0948698229695732, 0.04135499596427453, 0.16341701582220036, 0.08606212999649256, 0.053592864012679486, 0.19098332331302653, 0.14405847911537817, 0.08298873318308762, 0.13252144836061858, -0.0457968489184179, -0.12980876935797417, -0.28316385704597613, -0.13561015611750085, -0.1667270136594559, 0.042779002606718665, -0.054734113467425946, -0.15940119530893412, 0.38358606623502517, 0.09793895475863737, 0.23676308106451507, 0.009720338949602636, 0.28342795800992726, 0.16242269099218748, 0.0808063765527703, 0.05507642197063619, 0.3188261019671897, 0.10639531679131674, 0.07209405895948118, -0.24418971955310553, 0.06586026758269732, 0.0008748975773173643] |
1,803.03361 | Prediction of Turbulent Shear Stresses through Dysfunctional Bileaflet
Mechanical Heart Valves using Computational Fluid Dynamics | There are more than 300,000 heart valves implanted annually worldwide with
about 50% of them being mechanical valves. The heart valve replacement is often
a common treatment for severe valvular disease. However, valves may dysfunction
leading to adverse hemodynamic conditions. The current computational study
investigated the flow around a bileaflet mechanical heart valve at different
leaflet dysfunction levels of 0%, 50%, and 100%, and documented the relevant
flow characteristics such as vortical structures and turbulent shear stresses.
Studying the flow characteristics through these valves during their normal
operation and dysfunction can lead to better understanding of their
performance, possibly improved designs, and help identify conditions that may
increase the potential risk of blood cell damage. Results suggested that
maximum flow velocities increased with dysfunction from 2.05 to 4.49 ms-1 which
were accompanied by growing eddies and velocity fluctuations. These
fluctuations led to higher turbulent shear stresses from 90 to 800 N.m-2 as
dysfunctionality increased. These stress values exceeded the thresholds
corresponding to elevated risk of hemolysis and platelet activation. The
regions of elevated stresses were concentrated around and downstream of the
functional leaflet where high jet velocity and stronger helical structures
existed.
| physics.flu-dyn | there are more than 300000 heart valves implanted annually worldwide with about 50 of them being mechanical valves the heart valve replacement is often a common treatment for severe valvular disease however valves may dysfunction leading to adverse hemodynamic conditions the current computational study investigated the flow around a bileaflet mechanical heart valve at different leaflet dysfunction levels of 0 50 and 100 and documented the relevant flow characteristics such as vortical structures and turbulent shear stresses studying the flow characteristics through these valves during their normal operation and dysfunction can lead to better understanding of their performance possibly improved designs and help identify conditions that may increase the potential risk of blood cell damage results suggested that maximum flow velocities increased with dysfunction from 205 to 449 ms1 which were accompanied by growing eddies and velocity fluctuations these fluctuations led to higher turbulent shear stresses from 90 to 800 nm2 as dysfunctionality increased these stress values exceeded the thresholds corresponding to elevated risk of hemolysis and platelet activation the regions of elevated stresses were concentrated around and downstream of the functional leaflet where high jet velocity and stronger helical structures existed | [['there', 'are', 'more', 'than', '300000', 'heart', 'valves', 'implanted', 'annually', 'worldwide', 'with', 'about', '50', 'of', 'them', 'being', 'mechanical', 'valves', 'the', 'heart', 'valve', 'replacement', 'is', 'often', 'a', 'common', 'treatment', 'for', 'severe', 'valvular', 'disease', 'however', 'valves', 'may', 'dysfunction', 'leading', 'to', 'adverse', 'hemodynamic', 'conditions', 'the', 'current', 'computational', 'study', 'investigated', 'the', 'flow', 'around', 'a', 'bileaflet', 'mechanical', 'heart', 'valve', 'at', 'different', 'leaflet', 'dysfunction', 'levels', 'of', '0', '50', 'and', '100', 'and', 'documented', 'the', 'relevant', 'flow', 'characteristics', 'such', 'as', 'vortical', 'structures', 'and', 'turbulent', 'shear', 'stresses', 'studying', 'the', 'flow', 'characteristics', 'through', 'these', 'valves', 'during', 'their', 'normal', 'operation', 'and', 'dysfunction', 'can', 'lead', 'to', 'better', 'understanding', 'of', 'their', 'performance', 'possibly', 'improved', 'designs', 'and', 'help', 'identify', 'conditions', 'that', 'may', 'increase', 'the', 'potential', 'risk', 'of', 'blood', 'cell', 'damage', 'results', 'suggested', 'that', 'maximum', 'flow', 'velocities', 'increased', 'with', 'dysfunction', 'from', '205', 'to', '449', 'ms1', 'which', 'were', 'accompanied', 'by', 'growing', 'eddies', 'and', 'velocity', 'fluctuations', 'these', 'fluctuations', 'led', 'to', 'higher', 'turbulent', 'shear', 'stresses', 'from', '90', 'to', '800', 'nm2', 'as', 'dysfunctionality', 'increased', 'these', 'stress', 'values', 'exceeded', 'the', 'thresholds', 'corresponding', 'to', 'elevated', 'risk', 'of', 'hemolysis', 'and', 'platelet', 'activation', 'the', 'regions', 'of', 'elevated', 'stresses', 'were', 'concentrated', 'around', 'and', 'downstream', 'of', 'the', 'functional', 'leaflet', 'where', 'high', 'jet', 'velocity', 'and', 'stronger', 'helical', 'structures', 'existed']] | [-0.1269699728333459, 0.19081302636853556, -0.03620662509880882, 0.03728696419602784, -0.040491719705945194, -0.11989922237656477, 0.02596730178629514, 0.364929719819429, -0.24513422199258153, -0.3136867528737639, 0.13538324373863966, -0.28964404225795687, -0.12075548779284873, 0.22916684120051892, -0.09290026478265645, 0.038809812479257744, 0.04999633064411076, 0.005316516293836078, 0.003337565878609894, -0.18335524423067304, 0.20673266959784087, 0.0829991977395063, 0.3476714147933914, 0.09165867443031554, 0.08253381664205033, -0.09837878279358847, 0.021895293608091986, 0.04757492692442611, -0.1444867306543074, 0.07058307907088117, 0.2753994162097418, 0.022072519288485637, 0.3033814392489755, -0.513460560568395, -0.24058899952312154, 0.05784657151707506, 0.12166896645733989, 0.050634827483615176, 0.017978962404337533, -0.25287813815036014, 0.1211477942658045, -0.1838943079613576, -0.11506722193977718, -0.019658686549367605, 0.010748555831014528, 0.00810606311946079, -0.22326364108084817, 0.18945154735411052, 0.01426179098780267, 0.1566502204465602, -0.09244981661087574, -0.16352189501776593, -0.13774848101214351, 0.14883408654640107, 0.11085589722642908, 0.04550747783529611, 0.31194756421170194, -0.18025019181853472, -0.05589698313512296, 0.3189611194926935, 0.013892410483928566, -0.10368140161881456, 0.24835667133781195, -0.1933281086360997, -0.030104988865484, 0.21390709337235117, 0.208105292833352, 0.03288462092768896, -0.15321886099142526, -0.15649485390440532, 0.09507337410953672, 0.10768639231234071, 0.1440897008869797, -0.026981944366222404, 0.21079882128954827, 0.17323007600740917, 0.03322125993630228, 0.0977177078875684, -0.15033456411417015, -0.034999435317634685, -0.20390279630373698, -0.12466557460478118, -0.049405659066299755, 0.07405356098994768, -0.10600927120526649, -0.13671758909003984, 0.37245754319398355, 0.13456032492384415, 0.1615859256682294, -0.0067304051311415, 0.24914308587661557, 0.025234329049756827, 0.12615850015572505, 0.07228431269625919, 0.22432389899525637, 0.14723418133826272, 0.11597566306591034, -0.25123476538768347, 0.1610310406977078, -0.059620915046252776] |
1,803.03362 | The Influence of the Aortic Root Geometry on Flow Characteristics of a
Bileaflet Mechanical Heart Valve | Bileaflet mechanical heart valves have one of the most successful valve
designs for more than 30 years. These valves are often used for aortic valve
replacement, where the geometry of the aortic root sinuses may vary due to
valvular disease and affect valve performance. Common geometrical sinus changes
may be due to valve stenosis and insufficiency. In the current study, the
effect of these geometrical changes on the mean flow and velocity fluctuations
downstream of the valve and aortic sinuses were investigated. The study focused
on the fully-open leaflet position where blood velocities are close to their
maximum. Simulation results were validated using previous experimental laser
Doppler anemometry (LDA) measurements. Results showed that as the stenosis and
insufficiency increased there were more flow separation and increased local
mean velocity downstream of the leaflets. In addition, the detected elevated
velocity fluctuations were associated with higher Reynolds shear stresses
levels, which may increase the chances of blood damage and platelet activation
and may lead to increased risk of blood clot formation.
| physics.flu-dyn | bileaflet mechanical heart valves have one of the most successful valve designs for more than 30 years these valves are often used for aortic valve replacement where the geometry of the aortic root sinuses may vary due to valvular disease and affect valve performance common geometrical sinus changes may be due to valve stenosis and insufficiency in the current study the effect of these geometrical changes on the mean flow and velocity fluctuations downstream of the valve and aortic sinuses were investigated the study focused on the fullyopen leaflet position where blood velocities are close to their maximum simulation results were validated using previous experimental laser doppler anemometry lda measurements results showed that as the stenosis and insufficiency increased there were more flow separation and increased local mean velocity downstream of the leaflets in addition the detected elevated velocity fluctuations were associated with higher reynolds shear stresses levels which may increase the chances of blood damage and platelet activation and may lead to increased risk of blood clot formation | [['bileaflet', 'mechanical', 'heart', 'valves', 'have', 'one', 'of', 'the', 'most', 'successful', 'valve', 'designs', 'for', 'more', 'than', '30', 'years', 'these', 'valves', 'are', 'often', 'used', 'for', 'aortic', 'valve', 'replacement', 'where', 'the', 'geometry', 'of', 'the', 'aortic', 'root', 'sinuses', 'may', 'vary', 'due', 'to', 'valvular', 'disease', 'and', 'affect', 'valve', 'performance', 'common', 'geometrical', 'sinus', 'changes', 'may', 'be', 'due', 'to', 'valve', 'stenosis', 'and', 'insufficiency', 'in', 'the', 'current', 'study', 'the', 'effect', 'of', 'these', 'geometrical', 'changes', 'on', 'the', 'mean', 'flow', 'and', 'velocity', 'fluctuations', 'downstream', 'of', 'the', 'valve', 'and', 'aortic', 'sinuses', 'were', 'investigated', 'the', 'study', 'focused', 'on', 'the', 'fullyopen', 'leaflet', 'position', 'where', 'blood', 'velocities', 'are', 'close', 'to', 'their', 'maximum', 'simulation', 'results', 'were', 'validated', 'using', 'previous', 'experimental', 'laser', 'doppler', 'anemometry', 'lda', 'measurements', 'results', 'showed', 'that', 'as', 'the', 'stenosis', 'and', 'insufficiency', 'increased', 'there', 'were', 'more', 'flow', 'separation', 'and', 'increased', 'local', 'mean', 'velocity', 'downstream', 'of', 'the', 'leaflets', 'in', 'addition', 'the', 'detected', 'elevated', 'velocity', 'fluctuations', 'were', 'associated', 'with', 'higher', 'reynolds', 'shear', 'stresses', 'levels', 'which', 'may', 'increase', 'the', 'chances', 'of', 'blood', 'damage', 'and', 'platelet', 'activation', 'and', 'may', 'lead', 'to', 'increased', 'risk', 'of', 'blood', 'clot', 'formation']] | [-0.11536797245319647, 0.14128724031202694, -0.043204482486016896, 0.0027772598877857774, -0.06674476667340382, -0.13611004358300796, -0.026684304148223273, 0.3736382991119602, -0.21905674009526027, -0.29279102913803867, 0.13223872721310947, -0.29872599167793373, -0.124215405665823, 0.24361961794061002, -0.12886092615638964, 0.05124303029599385, 0.07797039424540397, 0.02321018881650818, -0.017982007723477994, -0.19255246214304098, 0.2154725856318541, 0.07330511238966027, 0.3462923156681674, 0.08684290782824027, 0.08810059214010835, -0.042519315308477926, -0.008708528913943284, 0.07563910421642568, -0.15844745754241735, 0.06560888007559094, 0.24425596885862566, 0.007457914283449525, 0.2834236483620383, -0.49828164925324847, -0.25225423377271766, 0.059632499029959096, 0.12893858152102766, 0.08713475144922887, 0.011457768388570579, -0.2507834110695582, 0.09307595435254408, -0.17062749489370357, -0.07440206796735437, -0.0031745009578574316, -0.010189806733875584, 0.05044015031790129, -0.21945373278067132, 0.20218760006063613, 0.0014725744299943278, 0.17692954481728154, -0.08548850283169976, -0.1710993997207099, -0.11473544706320445, 0.14991258500287166, 0.09531192600550736, 0.04887616209762954, 0.2996115002356822, -0.1588998997154144, -0.07162266923665736, 0.3203685488386532, 0.024339719764601038, -0.16685459478868492, 0.20244601644271126, -0.16121756308849836, -0.022102818466838692, 0.16019014640540413, 0.20928108243040255, 0.054712519899682975, -0.11686438106595588, -0.1350963059840338, 0.045246570126550305, 0.1417351884921715, 0.14805248794669407, -0.05698360607424784, 0.1809109550072073, 0.16557779877044304, 0.014857730895732722, 0.12338802110839128, -0.1939956250386285, -0.045413221993081315, -0.18877441181522964, -0.13844739411786727, -0.07621974412065285, 0.022352445506926118, -0.08591222788342247, -0.1437827018771552, 0.38780656694462134, 0.16078106791694433, 0.13311013508951097, -0.008723754388935996, 0.2733875735271612, 0.03602898772117081, 0.11817741770842856, 0.02306133320110095, 0.24945371375369602, 0.13248680237099975, 0.1024233816872136, -0.3091248293109679, 0.19871172117008745, -0.02646252357527702] |
1,803.03363 | Learning a Discriminative Prior for Blind Image Deblurring | We present an effective blind image deblurring method based on a data-driven
discriminative prior.Our work is motivated by the fact that a good image prior
should favor clear images over blurred images.In this work, we formulate the
image prior as a binary classifier which can be achieved by a deep
convolutional neural network (CNN).The learned prior is able to distinguish
whether an input image is clear or not.Embedded into the maximum a posterior
(MAP) framework, it helps blind deblurring in various scenarios, including
natural, face, text, and low-illumination images.However, it is difficult to
optimize the deblurring method with the learned image prior as it involves a
non-linear CNN.Therefore, we develop an efficient numerical approach based on
the half-quadratic splitting method and gradient decent algorithm to solve the
proposed model.Furthermore, the proposed model can be easily extended to
non-uniform deblurring.Both qualitative and quantitative experimental results
show that our method performs favorably against state-of-the-art algorithms as
well as domain-specific image deblurring approaches.
| cs.CV | we present an effective blind image deblurring method based on a datadriven discriminative priorour work is motivated by the fact that a good image prior should favor clear images over blurred imagesin this work we formulate the image prior as a binary classifier which can be achieved by a deep convolutional neural network cnnthe learned prior is able to distinguish whether an input image is clear or notembedded into the maximum a posterior map framework it helps blind deblurring in various scenarios including natural face text and lowillumination imageshowever it is difficult to optimize the deblurring method with the learned image prior as it involves a nonlinear cnntherefore we develop an efficient numerical approach based on the halfquadratic splitting method and gradient decent algorithm to solve the proposed modelfurthermore the proposed model can be easily extended to nonuniform deblurringboth qualitative and quantitative experimental results show that our method performs favorably against stateoftheart algorithms as well as domainspecific image deblurring approaches | [['we', 'present', 'an', 'effective', 'blind', 'image', 'deblurring', 'method', 'based', 'on', 'a', 'datadriven', 'discriminative', 'priorour', 'work', 'is', 'motivated', 'by', 'the', 'fact', 'that', 'a', 'good', 'image', 'prior', 'should', 'favor', 'clear', 'images', 'over', 'blurred', 'imagesin', 'this', 'work', 'we', 'formulate', 'the', 'image', 'prior', 'as', 'a', 'binary', 'classifier', 'which', 'can', 'be', 'achieved', 'by', 'a', 'deep', 'convolutional', 'neural', 'network', 'cnnthe', 'learned', 'prior', 'is', 'able', 'to', 'distinguish', 'whether', 'an', 'input', 'image', 'is', 'clear', 'or', 'notembedded', 'into', 'the', 'maximum', 'a', 'posterior', 'map', 'framework', 'it', 'helps', 'blind', 'deblurring', 'in', 'various', 'scenarios', 'including', 'natural', 'face', 'text', 'and', 'lowillumination', 'imageshowever', 'it', 'is', 'difficult', 'to', 'optimize', 'the', 'deblurring', 'method', 'with', 'the', 'learned', 'image', 'prior', 'as', 'it', 'involves', 'a', 'nonlinear', 'cnntherefore', 'we', 'develop', 'an', 'efficient', 'numerical', 'approach', 'based', 'on', 'the', 'halfquadratic', 'splitting', 'method', 'and', 'gradient', 'decent', 'algorithm', 'to', 'solve', 'the', 'proposed', 'modelfurthermore', 'the', 'proposed', 'model', 'can', 'be', 'easily', 'extended', 'to', 'nonuniform', 'deblurringboth', 'qualitative', 'and', 'quantitative', 'experimental', 'results', 'show', 'that', 'our', 'method', 'performs', 'favorably', 'against', 'stateoftheart', 'algorithms', 'as', 'well', 'as', 'domainspecific', 'image', 'deblurring', 'approaches']] | [0.017739913723505054, -0.07559669752787924, -0.1402858754920185, 0.10728285757068079, -0.14319990150091289, -0.1999124213501713, 0.007664472285939969, 0.5061050742913625, -0.28374566858608313, -0.33977241109517453, 0.09179961043762312, -0.2104415450104218, -0.24203914951526953, 0.1916441352723747, -0.16873442620578172, 0.1332588118629677, 0.12806556100794728, 0.022507703245776754, -0.07968234460445513, -0.27160243744698453, 0.274736324268528, 0.07368794945509044, 0.3483046330266485, 0.025661185438940793, 0.14260444478867085, -0.026770535681096493, -0.04334314493156087, 0.011117105070489311, -0.04531623278853658, 0.13844643654853203, 0.3074914289417824, 0.22124949226302928, 0.28385389588871285, -0.41099677182807537, -0.25678081595412405, 0.07402096302738707, 0.16633878202111718, 0.13464865042547708, -0.07745408553991613, -0.3581698304815769, 0.10174710214701727, -0.14698764323992164, 0.0346750590466208, -0.1775572105543688, -0.07883903891457808, -0.05616845361165408, -0.3414703943448043, 0.0710089609360454, 0.10782334176704018, 0.0075446616637667545, -0.04829293938267878, -0.10953302279353681, 0.06692189733899125, 0.12129151791266754, 0.02684847983504082, 0.1358651894751299, 0.1327066219742655, -0.15507656227227448, -0.1240744964329918, 0.36831794864203976, -0.08339777137275393, -0.232470312111553, 0.1898349594465751, 0.03266074566329878, -0.1089658982053056, 0.128306873305088, 0.19782552095497713, 0.16942856874696813, -0.14307835302928365, -4.743748018211734e-05, -0.10374214594929454, 0.20520170549188102, 0.019324789886779496, -0.06499194243224338, 0.17737610944497742, 0.2302674523548615, 0.0837140102552152, 0.16886427140745677, -0.16523041752301842, -0.04795966113268055, -0.20681023579948632, -0.08034199386403136, -0.2167639831589584, -0.060354433560094456, -0.09173297714168209, -0.13809365307066687, 0.39872717600174884, 0.253543924877273, 0.2338784701546262, 0.06318169554134856, 0.4176630794199331, 0.05014682984007155, 0.09309986612865223, 0.04825472844822798, 0.1803052450153413, 0.046226588656856235, 0.09711046316155453, -0.1725422302973273, 0.07436079605280324, 0.07004436578809921] |
1,803.03364 | Efficient Pricing of Barrier Options on High Volatility Assets using
Subset Simulation | Barrier options are one of the most widely traded exotic options on stock
exchanges. In this paper, we develop a new stochastic simulation method for
pricing barrier options and estimating the corresponding execution
probabilities. We show that the proposed method always outperforms the standard
Monte Carlo approach and becomes substantially more efficient when the
underlying asset has high volatility, while it performs better than multilevel
Monte Carlo for special cases of barrier options and underlying assets. These
theoretical findings are confirmed by numerous simulation results.
| q-fin.PR q-fin.CP stat.AP stat.CO | barrier options are one of the most widely traded exotic options on stock exchanges in this paper we develop a new stochastic simulation method for pricing barrier options and estimating the corresponding execution probabilities we show that the proposed method always outperforms the standard monte carlo approach and becomes substantially more efficient when the underlying asset has high volatility while it performs better than multilevel monte carlo for special cases of barrier options and underlying assets these theoretical findings are confirmed by numerous simulation results | [['barrier', 'options', 'are', 'one', 'of', 'the', 'most', 'widely', 'traded', 'exotic', 'options', 'on', 'stock', 'exchanges', 'in', 'this', 'paper', 'we', 'develop', 'a', 'new', 'stochastic', 'simulation', 'method', 'for', 'pricing', 'barrier', 'options', 'and', 'estimating', 'the', 'corresponding', 'execution', 'probabilities', 'we', 'show', 'that', 'the', 'proposed', 'method', 'always', 'outperforms', 'the', 'standard', 'monte', 'carlo', 'approach', 'and', 'becomes', 'substantially', 'more', 'efficient', 'when', 'the', 'underlying', 'asset', 'has', 'high', 'volatility', 'while', 'it', 'performs', 'better', 'than', 'multilevel', 'monte', 'carlo', 'for', 'special', 'cases', 'of', 'barrier', 'options', 'and', 'underlying', 'assets', 'these', 'theoretical', 'findings', 'are', 'confirmed', 'by', 'numerous', 'simulation', 'results']] | [-0.026313454535899356, 0.038814327568637536, -0.1036240541978794, 0.21590817808310556, -0.07992190724677023, -0.2100198748302372, 0.10116963235469645, 0.4787889399949242, -0.24140272109961028, -0.2951110243359033, 0.14169143801691997, -0.2890122917508159, -0.13125582593767082, 0.3024735117002445, -0.04778575080939952, 0.04647108572398258, 0.10339773992514785, -0.0797641849364428, -0.01639231217422468, -0.29830074946889107, 0.23043895190691246, 0.11176682374001864, 0.3077940519679995, 0.02647374485455015, 0.1228261291871176, 0.03959442877813297, -0.022287742841495747, -0.01522680483332592, -0.15970056646765443, 0.15042937414391952, 0.27233303509214346, 0.06737392309039612, 0.32193337994463306, -0.44758726530160536, -0.20165769169654915, 0.09902524715220994, 0.11216039277359788, 0.10196072709856226, -0.06539771504621432, -0.25154577561599367, 0.03546480309656438, -0.25305917826207247, -0.1024013437823776, -0.12719227186787654, -0.0352396480684333, 0.030323806387262748, -0.30628202921327424, 0.05389372412224903, -0.019326413090012092, -0.0028772966713671955, 0.02666708392858067, -0.2168486460879007, -0.016076719766373142, 0.05086799358079374, 0.12143389707814684, -0.06677928047035547, 0.12894805427640676, -0.09539464698378544, -0.23557686575633638, 0.3383143736706937, -0.016536835606572875, -0.20089648071238222, 0.14859210623099522, -0.11262380764545764, -0.12082044878864989, 0.15027060540091686, 0.13172858908553334, 0.12310131044839234, -0.18963044390770578, 0.07726810850709787, -0.005566268742961042, 0.1297923288472435, -0.009355765301734209, -0.03604042195879361, 0.12560710584306542, 0.24935567254912766, 0.09082719937158638, 0.10691246792728848, -0.1054406597142053, -0.27692897712592696, -0.2564641251721803, -0.16165656136239276, -0.1648697025635663, -0.03188765430275132, -0.16340457208074546, -0.1503099166404675, 0.3678764737046817, 0.2582168043591082, 0.04332825114731403, 0.09785377279143123, 0.35036634193623767, 0.14619081102530745, 0.001441533343099496, 0.12360997632803286, 0.13788741791949552, -0.013482060916173984, 0.08615182067048462, -0.15956110257436248, 0.206461704160799, 0.01754791946424281] |
1,803.03365 | Data-assisted reduced-order modeling of extreme events in complex
dynamical systems | Dynamical systems with high intrinsic dimensionality are often characterized
by extreme events having the form of rare transitions several standard
deviations away from the mean. For such systems, order-reduction methods
through projection of the governing equations have limited applicability due to
the large intrinsic dimensionality of the underlying attractor but also the
complexity of the transient events. An alternative approach is data-driven
techniques that aim to quantify the dynamics of specific modes utilizing
data-streams. Several of these approaches have improved performance by
expanding the state representation using delayed coordinates. However, such
strategies are limited in regions of the phase space where there is a small
amount of data available, as is the case for extreme events. In this work, we
develop a blended framework that integrates an imperfect model, obtained from
projecting equations into a subspace that still contains crucial dynamical
information, with data-streams through a recurrent neural network (RNN)
architecture. In particular, we employ the long-short-term memory (LSTM), to
model portions of the dynamics which cannot be accounted by the equations. The
RNN is trained by analyzing the mismatch between the imperfect model and the
data-streams, projected in the reduced-order space. In this way, the
data-driven model improves the imperfect model in regions where data is
available, while for locations where data is sparse the imperfect model still
provides a baseline for the prediction of the system dynamics. We assess the
developed framework on two challenging prototype systems exhibiting extreme
events and show that the blended approach has improved performance compared
with methods that use either data streams or the imperfect model alone. The
improvement is more significant in regions associated with extreme events,
where data is sparse.
| nlin.CD physics.comp-ph | dynamical systems with high intrinsic dimensionality are often characterized by extreme events having the form of rare transitions several standard deviations away from the mean for such systems orderreduction methods through projection of the governing equations have limited applicability due to the large intrinsic dimensionality of the underlying attractor but also the complexity of the transient events an alternative approach is datadriven techniques that aim to quantify the dynamics of specific modes utilizing datastreams several of these approaches have improved performance by expanding the state representation using delayed coordinates however such strategies are limited in regions of the phase space where there is a small amount of data available as is the case for extreme events in this work we develop a blended framework that integrates an imperfect model obtained from projecting equations into a subspace that still contains crucial dynamical information with datastreams through a recurrent neural network rnn architecture in particular we employ the longshortterm memory lstm to model portions of the dynamics which cannot be accounted by the equations the rnn is trained by analyzing the mismatch between the imperfect model and the datastreams projected in the reducedorder space in this way the datadriven model improves the imperfect model in regions where data is available while for locations where data is sparse the imperfect model still provides a baseline for the prediction of the system dynamics we assess the developed framework on two challenging prototype systems exhibiting extreme events and show that the blended approach has improved performance compared with methods that use either data streams or the imperfect model alone the improvement is more significant in regions associated with extreme events where data is sparse | [['dynamical', 'systems', 'with', 'high', 'intrinsic', 'dimensionality', 'are', 'often', 'characterized', 'by', 'extreme', 'events', 'having', 'the', 'form', 'of', 'rare', 'transitions', 'several', 'standard', 'deviations', 'away', 'from', 'the', 'mean', 'for', 'such', 'systems', 'orderreduction', 'methods', 'through', 'projection', 'of', 'the', 'governing', 'equations', 'have', 'limited', 'applicability', 'due', 'to', 'the', 'large', 'intrinsic', 'dimensionality', 'of', 'the', 'underlying', 'attractor', 'but', 'also', 'the', 'complexity', 'of', 'the', 'transient', 'events', 'an', 'alternative', 'approach', 'is', 'datadriven', 'techniques', 'that', 'aim', 'to', 'quantify', 'the', 'dynamics', 'of', 'specific', 'modes', 'utilizing', 'datastreams', 'several', 'of', 'these', 'approaches', 'have', 'improved', 'performance', 'by', 'expanding', 'the', 'state', 'representation', 'using', 'delayed', 'coordinates', 'however', 'such', 'strategies', 'are', 'limited', 'in', 'regions', 'of', 'the', 'phase', 'space', 'where', 'there', 'is', 'a', 'small', 'amount', 'of', 'data', 'available', 'as', 'is', 'the', 'case', 'for', 'extreme', 'events', 'in', 'this', 'work', 'we', 'develop', 'a', 'blended', 'framework', 'that', 'integrates', 'an', 'imperfect', 'model', 'obtained', 'from', 'projecting', 'equations', 'into', 'a', 'subspace', 'that', 'still', 'contains', 'crucial', 'dynamical', 'information', 'with', 'datastreams', 'through', 'a', 'recurrent', 'neural', 'network', 'rnn', 'architecture', 'in', 'particular', 'we', 'employ', 'the', 'longshortterm', 'memory', 'lstm', 'to', 'model', 'portions', 'of', 'the', 'dynamics', 'which', 'can', 'not', 'be', 'accounted', 'by', 'the', 'equations', 'the', 'rnn', 'is', 'trained', 'by', 'analyzing', 'the', 'mismatch', 'between', 'the', 'imperfect', 'model', 'and', 'the', 'datastreams', 'projected', 'in', 'the', 'reducedorder', 'space', 'in', 'this', 'way', 'the', 'datadriven', 'model', 'improves', 'the', 'imperfect', 'model', 'in', 'regions', 'where', 'data', 'is', 'available', 'while', 'for', 'locations', 'where', 'data', 'is', 'sparse', 'the', 'imperfect', 'model', 'still', 'provides', 'a', 'baseline', 'for', 'the', 'prediction', 'of', 'the', 'system', 'dynamics', 'we', 'assess', 'the', 'developed', 'framework', 'on', 'two', 'challenging', 'prototype', 'systems', 'exhibiting', 'extreme', 'events', 'and', 'show', 'that', 'the', 'blended', 'approach', 'has', 'improved', 'performance', 'compared', 'with', 'methods', 'that', 'use', 'either', 'data', 'streams', 'or', 'the', 'imperfect', 'model', 'alone', 'the', 'improvement', 'is', 'more', 'significant', 'in', 'regions', 'associated', 'with', 'extreme', 'events', 'where', 'data', 'is', 'sparse']] | [-0.0843528204876098, 0.06610076970443646, -0.06652553469840704, 0.07975492406819415, -0.05329622756024557, -0.13750280167026047, 0.0356637564612486, 0.37772506953084045, -0.2701362428538102, -0.31220185036654585, 0.12542707049828355, -0.27701932755797837, -0.16165367324096483, 0.18089463069502795, -0.08474670158965247, 0.053877793565126404, 0.10902911129108231, 0.027669495424821174, -0.06749407411984326, -0.21886251444073943, 0.319233313039045, 0.06774436488880643, 0.30260065030639194, -0.04441143039356185, 0.13218561057874467, -0.025104075177971807, -0.032562374445842576, 0.031229617566610354, -0.06157689966642335, 0.12539489344635513, 0.25348702470115053, 0.15650750928491886, 0.2893164440507202, -0.4356863031762519, -0.2668273081445867, 0.10738390256384654, 0.14323646178069924, 0.1077464491106574, -0.02885093603758183, -0.30282049582788856, 0.0702763115525678, -0.175107269549127, -0.06840317981217854, -0.09711123415867665, -0.01215478743958686, 0.00039368781664442004, -0.28217774441353477, 0.0979051597556723, 0.06545442265154894, 0.04337206774258188, -0.05758769728210089, -0.0889023704250576, -0.0034663995212343124, 0.1412096873266689, 0.03416810080276004, 0.022737448248413523, 0.08880829971645393, -0.15715739875855173, -0.11181268685696913, 0.3736570066240217, -0.06774038573203142, -0.23458770822201455, 0.20506904280544924, -0.09960462637287232, -0.12900874144522406, 0.1610022519748392, 0.21725166877191182, 0.09402443984664777, -0.17972124429735623, 0.06676970599593395, -0.007249398354906589, 0.17891804738236325, -0.018336448467536164, 0.04471827729305785, 0.18781035147299657, 0.25137342522502876, 0.018045041450698462, 0.12556108829656815, -0.12132287208327658, -0.11185462442559323, -0.23902829561182962, -0.07429915148615172, -0.17148047772602046, -0.011183150251443813, -0.10208286706048446, -0.13208285733409347, 0.3667258595324321, 0.20225729508846207, 0.21344340387731792, 0.018426135978578322, 0.33964354225900023, 0.08746933065745648, 0.08564743129869125, 0.08802886593621224, 0.22971671318809966, 0.05711176082425352, 0.08390661829201106, -0.18918315285409334, 0.11425316814815492, 0.01991758956033404] |
1,803.03366 | Morphological modification of the technical flax fibre bundles to
improve the longitudinal tensile properties of flax fibre reinforced epoxy
composites | As far as the tensile properties of natural fibres as reinforcements for
composites are concerned, flax fibres will stay at the top-end. However, an
efficient conversion of fibre properties into their corresponding composite
properties has been a challenge, due to the fibre damages done through the
conventional textile methods utilised to process flax. These techniques impart
disadvantageous features onto fibres at both micro, and mesolevel, which
degrade the mechanical performances of flax fibre reinforced composites, FFRC.
Undulation of fibre is one of those detrimental features that occur during
traditional fibre extraction and fabric manufacturing routes. The undulation or
waviness causes micro compressive defects or kink bands in elementary flax
fibres, which significantly undermines the performance of FFRC. Manufacturing
flax fabric with minimal undulation could diminish the micro compressive
defects up to a substantial extent. In this research, nonwoven flax tapes of
highly aligned flax fibres, blended with a small proportion of PLA, Polylactic
Acid have been manufactured deploying a novel technique. Composites reinforced
from those nonwoven tapes have been compared with composites reinforced with
woven Hopsack fabrics and warp knitted unidirectional,UD fabrics from flax that
are comprised of undulating fibres. The composites reinforced with the highly
aligned tape have shown 49 percent higher fibre bundle strength, and 100
percent higher fibre bundle stiffness in comparison with that of the Hopsack
fabric reinforced composites. The results have been discussed in the light of
fibre undulation, elementary fibre individualisation, homogeneity of fibre
distribution, extent of resin rich areas, and impregnation of the fibre lumens.
| physics.app-ph | as far as the tensile properties of natural fibres as reinforcements for composites are concerned flax fibres will stay at the topend however an efficient conversion of fibre properties into their corresponding composite properties has been a challenge due to the fibre damages done through the conventional textile methods utilised to process flax these techniques impart disadvantageous features onto fibres at both micro and mesolevel which degrade the mechanical performances of flax fibre reinforced composites ffrc undulation of fibre is one of those detrimental features that occur during traditional fibre extraction and fabric manufacturing routes the undulation or waviness causes micro compressive defects or kink bands in elementary flax fibres which significantly undermines the performance of ffrc manufacturing flax fabric with minimal undulation could diminish the micro compressive defects up to a substantial extent in this research nonwoven flax tapes of highly aligned flax fibres blended with a small proportion of pla polylactic acid have been manufactured deploying a novel technique composites reinforced from those nonwoven tapes have been compared with composites reinforced with woven hopsack fabrics and warp knitted unidirectionalud fabrics from flax that are comprised of undulating fibres the composites reinforced with the highly aligned tape have shown 49 percent higher fibre bundle strength and 100 percent higher fibre bundle stiffness in comparison with that of the hopsack fabric reinforced composites the results have been discussed in the light of fibre undulation elementary fibre individualisation homogeneity of fibre distribution extent of resin rich areas and impregnation of the fibre lumens | [['as', 'far', 'as', 'the', 'tensile', 'properties', 'of', 'natural', 'fibres', 'as', 'reinforcements', 'for', 'composites', 'are', 'concerned', 'flax', 'fibres', 'will', 'stay', 'at', 'the', 'topend', 'however', 'an', 'efficient', 'conversion', 'of', 'fibre', 'properties', 'into', 'their', 'corresponding', 'composite', 'properties', 'has', 'been', 'a', 'challenge', 'due', 'to', 'the', 'fibre', 'damages', 'done', 'through', 'the', 'conventional', 'textile', 'methods', 'utilised', 'to', 'process', 'flax', 'these', 'techniques', 'impart', 'disadvantageous', 'features', 'onto', 'fibres', 'at', 'both', 'micro', 'and', 'mesolevel', 'which', 'degrade', 'the', 'mechanical', 'performances', 'of', 'flax', 'fibre', 'reinforced', 'composites', 'ffrc', 'undulation', 'of', 'fibre', 'is', 'one', 'of', 'those', 'detrimental', 'features', 'that', 'occur', 'during', 'traditional', 'fibre', 'extraction', 'and', 'fabric', 'manufacturing', 'routes', 'the', 'undulation', 'or', 'waviness', 'causes', 'micro', 'compressive', 'defects', 'or', 'kink', 'bands', 'in', 'elementary', 'flax', 'fibres', 'which', 'significantly', 'undermines', 'the', 'performance', 'of', 'ffrc', 'manufacturing', 'flax', 'fabric', 'with', 'minimal', 'undulation', 'could', 'diminish', 'the', 'micro', 'compressive', 'defects', 'up', 'to', 'a', 'substantial', 'extent', 'in', 'this', 'research', 'nonwoven', 'flax', 'tapes', 'of', 'highly', 'aligned', 'flax', 'fibres', 'blended', 'with', 'a', 'small', 'proportion', 'of', 'pla', 'polylactic', 'acid', 'have', 'been', 'manufactured', 'deploying', 'a', 'novel', 'technique', 'composites', 'reinforced', 'from', 'those', 'nonwoven', 'tapes', 'have', 'been', 'compared', 'with', 'composites', 'reinforced', 'with', 'woven', 'hopsack', 'fabrics', 'and', 'warp', 'knitted', 'unidirectionalud', 'fabrics', 'from', 'flax', 'that', 'are', 'comprised', 'of', 'undulating', 'fibres', 'the', 'composites', 'reinforced', 'with', 'the', 'highly', 'aligned', 'tape', 'have', 'shown', '49', 'percent', 'higher', 'fibre', 'bundle', 'strength', 'and', '100', 'percent', 'higher', 'fibre', 'bundle', 'stiffness', 'in', 'comparison', 'with', 'that', 'of', 'the', 'hopsack', 'fabric', 'reinforced', 'composites', 'the', 'results', 'have', 'been', 'discussed', 'in', 'the', 'light', 'of', 'fibre', 'undulation', 'elementary', 'fibre', 'individualisation', 'homogeneity', 'of', 'fibre', 'distribution', 'extent', 'of', 'resin', 'rich', 'areas', 'and', 'impregnation', 'of', 'the', 'fibre', 'lumens']] | [-0.11303790032661894, 0.16203686754509802, -0.03510037005543407, -0.10309966970471798, -0.05850055618946882, -0.17851289768650494, -0.033878969963685224, 0.48091873084100695, -0.24560092523614385, -0.23501404286230262, 0.13428446499118016, -0.2840785218990947, -0.1476354097465792, 0.19721434157207865, -0.13116897913525521, 0.06159572433001599, 0.05292147441836322, -0.06333324939072855, -0.008943061164282413, -0.23657856978521294, 0.21512521126379186, 0.06493204006329481, 0.42002384476589893, 0.010008282945380614, 0.10348200642500027, -0.010762848778908717, 0.021455495613570578, 0.038626664253102565, -0.10340805264773212, 0.15172716057416324, 0.24241719342888848, -0.022848231012456102, 0.23639198856782695, -0.47162290536591156, -0.21965018730810448, 0.07350715212637053, 0.1263381245118087, 0.034940724120652564, -0.010502766109418561, -0.21901808068653952, 0.1328371461006711, -0.14550649590398135, -0.14526382929773676, -0.01850468877312701, -0.04522676571359036, 0.06554046866431198, -0.12493062031036808, -0.0055019160615268955, 0.04956729872140898, 0.10717102201270913, -0.025973893428666267, -0.1440403266067085, -0.10428579815433395, 0.07297954232684574, 0.06919915379043423, -0.026392124634733807, 0.2721009097789765, -0.16939768083073078, -0.06062284834034409, 0.40512272817373035, -0.05532667254143006, -0.15693317677991592, 0.168228849393345, -0.039656240519452914, -0.08683274404488896, 0.2307155280447516, 0.18473670882764856, 0.0687541631839864, -0.11244906527782048, -0.04079620377749755, 0.05707076778220624, 0.17789797934794022, 0.15260745406995418, 0.0555227823397107, 0.23184113315332996, 0.2562302231358794, -0.024414228946573822, 0.16389420295326484, -0.05174317732142277, 0.005509967296403128, -0.19116789764566308, -0.21517351723694608, -0.1176808501371307, 0.06550298002454252, -0.10830415978334676, -0.1808268115383258, 0.3258521197559802, 0.04606370240080393, 0.15530896621194445, 0.014323585014177584, 0.25418894321691654, -0.06087329611135081, 0.18977584302338663, -0.0557088774830661, 0.3344221886719656, 0.15120243955981402, 0.11898009206436062, -0.10490517314054026, 0.07684027614554594, -0.004813191930571126] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.