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.07167
|
Soft Pomerons and the Forward LHC Data
|
Recent data from LHC13 by the TOTEM Collaboration on $\sigma_{tot}$ and
$\rho$ have indicated disagreement with all the Pomeron model predictions by
the COMPETE Collaboration (2002). On the other hand, as recently demonstrated
by Martynov and Nicolescu (MN), the new $\sigma_{tot}$ datum and the unexpected
decrease in the $\rho$ value are well described by the maximal Odderon
dominance at the highest energies. Here, we discuss the applicability of
Pomeron dominance through fits to the \textit{most complete set} of forward
data from $pp$ and $\bar{p}p$ scattering. We consider an analytic
parametrization for $\sigma_{tot}(s)$ consisting of non-degenerated Regge
trajectories for even and odd amplitudes (as in the MN analysis) and two
Pomeron components associated with double and triple poles in the complex
angular momentum plane. The $\rho$ parameter is analytically determined by
means of dispersion relations. We carry out fits to $pp$ and $\bar{p}p$ data on
$\sigma_{tot}$ and $\rho$ in the interval 5 GeV - 13 TeV (as in the MN
analysis). Two novel aspects of our analysis are: (1) the dataset comprises all
the accelerator data below 7 TeV and we consider \textit{three independent
ensembles} by adding: either only the TOTEM data (as in the MN analysis), or
only the ATLAS data, or both sets; (2) in the data reductions to each ensemble,
uncertainty regions are evaluated through error propagation from the fit
parameters, with 90 \% CL. We argument that, within the uncertainties, this
analytic model corresponding to soft Pomeron dominance, does not seem to be
excluded by the \textit{complete} set of experimental data presently available.
|
hep-ph hep-ex
|
recent data from lhc13 by the totem collaboration on sigma_tot and rho have indicated disagreement with all the pomeron model predictions by the compete collaboration 2002 on the other hand as recently demonstrated by martynov and nicolescu mn the new sigma_tot datum and the unexpected decrease in the rho value are well described by the maximal odderon dominance at the highest energies here we discuss the applicability of pomeron dominance through fits to the textitmost complete set of forward data from pp and barpp scattering we consider an analytic parametrization for sigma_tots consisting of nondegenerated regge trajectories for even and odd amplitudes as in the mn analysis and two pomeron components associated with double and triple poles in the complex angular momentum plane the rho parameter is analytically determined by means of dispersion relations we carry out fits to pp and barpp data on sigma_tot and rho in the interval 5 gev 13 tev as in the mn analysis two novel aspects of our analysis are 1 the dataset comprises all the accelerator data below 7 tev and we consider textitthree independent ensembles by adding either only the totem data as in the mn analysis or only the atlas data or both sets 2 in the data reductions to each ensemble uncertainty regions are evaluated through error propagation from the fit parameters with 90 cl we argument that within the uncertainties this analytic model corresponding to soft pomeron dominance does not seem to be excluded by the textitcomplete set of experimental data presently available
|
[['recent', 'data', 'from', 'lhc13', 'by', 'the', 'totem', 'collaboration', 'on', 'sigma_tot', 'and', 'rho', 'have', 'indicated', 'disagreement', 'with', 'all', 'the', 'pomeron', 'model', 'predictions', 'by', 'the', 'compete', 'collaboration', '2002', 'on', 'the', 'other', 'hand', 'as', 'recently', 'demonstrated', 'by', 'martynov', 'and', 'nicolescu', 'mn', 'the', 'new', 'sigma_tot', 'datum', 'and', 'the', 'unexpected', 'decrease', 'in', 'the', 'rho', 'value', 'are', 'well', 'described', 'by', 'the', 'maximal', 'odderon', 'dominance', 'at', 'the', 'highest', 'energies', 'here', 'we', 'discuss', 'the', 'applicability', 'of', 'pomeron', 'dominance', 'through', 'fits', 'to', 'the', 'textitmost', 'complete', 'set', 'of', 'forward', 'data', 'from', 'pp', 'and', 'barpp', 'scattering', 'we', 'consider', 'an', 'analytic', 'parametrization', 'for', 'sigma_tots', 'consisting', 'of', 'nondegenerated', 'regge', 'trajectories', 'for', 'even', 'and', 'odd', 'amplitudes', 'as', 'in', 'the', 'mn', 'analysis', 'and', 'two', 'pomeron', 'components', 'associated', 'with', 'double', 'and', 'triple', 'poles', 'in', 'the', 'complex', 'angular', 'momentum', 'plane', 'the', 'rho', 'parameter', 'is', 'analytically', 'determined', 'by', 'means', 'of', 'dispersion', 'relations', 'we', 'carry', 'out', 'fits', 'to', 'pp', 'and', 'barpp', 'data', 'on', 'sigma_tot', 'and', 'rho', 'in', 'the', 'interval', '5', 'gev', '13', 'tev', 'as', 'in', 'the', 'mn', 'analysis', 'two', 'novel', 'aspects', 'of', 'our', 'analysis', 'are', '1', 'the', 'dataset', 'comprises', 'all', 'the', 'accelerator', 'data', 'below', '7', 'tev', 'and', 'we', 'consider', 'textitthree', 'independent', 'ensembles', 'by', 'adding', 'either', 'only', 'the', 'totem', 'data', 'as', 'in', 'the', 'mn', 'analysis', 'or', 'only', 'the', 'atlas', 'data', 'or', 'both', 'sets', '2', 'in', 'the', 'data', 'reductions', 'to', 'each', 'ensemble', 'uncertainty', 'regions', 'are', 'evaluated', 'through', 'error', 'propagation', 'from', 'the', 'fit', 'parameters', 'with', '90', 'cl', 'we', 'argument', 'that', 'within', 'the', 'uncertainties', 'this', 'analytic', 'model', 'corresponding', 'to', 'soft', 'pomeron', 'dominance', 'does', 'not', 'seem', 'to', 'be', 'excluded', 'by', 'the', 'textitcomplete', 'set', 'of', 'experimental', 'data', 'presently', 'available']]
|
[-0.09039849605516663, 0.1280211994476573, -0.07430503350818758, 0.11083840244272981, -0.049774140033046366, -0.11767971021557602, 0.06084600084722631, 0.3434142356594885, -0.20809467694088965, -0.3351344528585937, 0.06564753789121902, -0.35535933673814335, -0.03666307176868229, 0.18109307170149838, 0.039429623535153245, 0.049173134838308215, 0.097237467612179, 0.029477632304528368, -0.028817320898223094, -0.2056660192628417, 0.334884613544382, 0.06375601990958271, 0.23681350250952976, 0.07991539002828697, 0.060706465206893066, 0.06891231155464712, -0.05952376050031615, -0.015491095810977691, -0.13856515158331892, 0.09878095066802495, 0.24613866978509005, 0.09932094227023705, 0.1362768358941164, -0.3614672302441458, -0.14738884914975628, 0.09236893832882344, 0.1365843823036039, 0.037646588475513366, 0.02210043505130505, -0.27502647555238113, 0.08732667604641688, -0.1795824455555617, -0.13355671735149127, -0.07698848954744254, 0.008931934457132409, 0.008756378329664527, -0.26938364674565435, 0.09742820631848877, 0.005105452256354507, 0.06385963780091332, -0.07161461674376379, -0.20104993905838978, -0.06045890454821318, 0.060121939326139545, 0.0740123925767656, 0.06660504631602422, 0.10238636627318448, -0.11106029988023573, -0.15069300698285754, 0.320772471799968, -0.042329276949415726, -0.16450746766815658, 0.15105209822799612, -0.1992274699349595, -0.14654311001035772, 0.14775110245866355, 0.15645705781354322, 0.03878740089109882, -0.1733872037539222, 0.1224624260725638, -0.025560774650837004, 0.1720809845213333, 0.07231739661729943, -0.025451906916239986, 0.15201650534318428, 0.16215766092445774, -0.019252001869533877, 0.0648743569868867, -0.11399845955842781, -0.0709818034642652, -0.3655413987497862, -0.053708892967183834, -0.1373534796261615, 0.02222599221211481, -0.09897760155952624, -0.061435806555783914, 0.32899701357138134, 0.08743140136219354, 0.30204085002399306, 0.029611695384820225, 0.2915122177886221, 0.0879657080305212, 0.07302329658572985, 0.08403912529541666, 0.2678607314265528, 0.11108437493506068, 0.11653872300721631, -0.19584857150850166, 0.024647015016691635, 0.017044473091589487]
|
1,803.07168
|
Anisotropic Massive Gauge-flation
|
We study anisotropic inflationary solutions in massive Gauge-flation. We work
with the theory in both the Stueckelberg and dynamical symmetry-breaking limits
and demonstrate that extended periods of accelerated anisotropic expansion are
possible. In the case of dynamical symmetry breaking, we show that spacetime
can transition from isotropic quasi-de Sitter space to an accelerating Bianchi
spacetime due to a rolling Higgs field - the spacetime can develop hair.
Similarly, symmetry restoring transitions are possible from accelerating
Bianchi spacetime to quasi-de Sitter space - the spacetime can lose its hair.
These transitions can be arranged to occur quickly, within an $e$-folding or
so, or over tens of $e$-folds.
|
astro-ph.CO gr-qc hep-th
|
we study anisotropic inflationary solutions in massive gaugeflation we work with the theory in both the stueckelberg and dynamical symmetrybreaking limits and demonstrate that extended periods of accelerated anisotropic expansion are possible in the case of dynamical symmetry breaking we show that spacetime can transition from isotropic quaside sitter space to an accelerating bianchi spacetime due to a rolling higgs field the spacetime can develop hair similarly symmetry restoring transitions are possible from accelerating bianchi spacetime to quaside sitter space the spacetime can lose its hair these transitions can be arranged to occur quickly within an efolding or so or over tens of efolds
|
[['we', 'study', 'anisotropic', 'inflationary', 'solutions', 'in', 'massive', 'gaugeflation', 'we', 'work', 'with', 'the', 'theory', 'in', 'both', 'the', 'stueckelberg', 'and', 'dynamical', 'symmetrybreaking', 'limits', 'and', 'demonstrate', 'that', 'extended', 'periods', 'of', 'accelerated', 'anisotropic', 'expansion', 'are', 'possible', 'in', 'the', 'case', 'of', 'dynamical', 'symmetry', 'breaking', 'we', 'show', 'that', 'spacetime', 'can', 'transition', 'from', 'isotropic', 'quaside', 'sitter', 'space', 'to', 'an', 'accelerating', 'bianchi', 'spacetime', 'due', 'to', 'a', 'rolling', 'higgs', 'field', 'the', 'spacetime', 'can', 'develop', 'hair', 'similarly', 'symmetry', 'restoring', 'transitions', 'are', 'possible', 'from', 'accelerating', 'bianchi', 'spacetime', 'to', 'quaside', 'sitter', 'space', 'the', 'spacetime', 'can', 'lose', 'its', 'hair', 'these', 'transitions', 'can', 'be', 'arranged', 'to', 'occur', 'quickly', 'within', 'an', 'efolding', 'or', 'so', 'or', 'over', 'tens', 'of', 'efolds']]
|
[-0.17206367826572835, 0.2696828720579036, -0.09483675754969366, 0.09951513436121437, -0.1453684995918033, -0.13745558621191706, -0.06839989877614873, 0.37125670823913354, -0.22361460626304436, -0.26866057217837525, 0.09524900749630223, -0.2233582031210692, -0.14445802945052633, 0.08338500685819711, -0.04664422253084082, -0.020707874093764424, -0.04460203499855617, 0.03032615320542111, -0.10213419535452536, -0.2649396521424373, 0.32594246137439487, 0.07414725188685295, 0.25288472943625845, -0.0694549398120636, 0.07912708257880205, -0.07352846712008333, 0.03967184557964524, 0.026836396507860627, -0.14885812504913842, 0.02121670588027113, 0.19033778957628572, 0.09454807469872041, 0.1579781977343373, -0.4549590115650342, -0.26046614182324934, 0.15861302162654914, 0.25465549600238985, 0.21017052678283876, -0.03630064736800985, -0.3562686223818813, 0.06420039998080868, -0.18893497969167164, -0.1814587522799579, -0.14331130998862834, -0.0026263870654824693, -0.09612823959413128, -0.2431021231549004, 0.14716344605235812, 0.029810497543411866, -0.010997622784298774, -0.11020005267570153, 0.03535620728507638, -0.05505920021991747, 0.034067241482821725, 0.17039862799888048, 0.01722443286696664, 0.14688884155027784, -0.10901172629270989, -0.11756508295030262, 0.3968146515544504, -0.09311610082155451, -0.13902245033666707, 0.13942122268445717, -0.17649403516238985, -0.10417100051059745, 0.13301179612440486, 0.17169509528433152, 0.13079081180666646, -0.07663718555480815, 0.17891938628096027, 0.08449535326172526, 0.1436166525594532, 0.1562894992373633, 0.019829270841840368, 0.3208497288242842, 0.06869509960345638, 0.03484894515265925, 0.1335601047288107, 0.0016631316751814806, -0.17021443480916787, -0.3951037506787823, -0.15113650138664525, -0.11024250105569641, 0.12425828354361539, -0.19359100763568465, -0.18319237953087744, 0.35299323002198857, 0.13074832981846368, 0.1460014585351858, -0.011232347796277072, 0.2026970600306343, 0.06547265073571068, 0.0421944833942689, 0.1044251009857712, 0.31780561425078374, 0.07727298235337142, 0.13354863158691352, -0.19870449828718287, -0.10282027082016262, 0.05675967591098295]
|
1,803.07169
|
On the meromorphic continuation of Beatty Zeta-Functions and Sturmian
Dirichlet series
|
For a positive irrational number $\alpha,$ we study the ordinary Dirichlet
series $\zeta_\alpha(s) = \sum\limits_{n\geq1} \lfloor\alpha n\rfloor^{-s}$ and
$S_\alpha(s) = \sum\limits_{n\geq1} (\left\lceil\alpha n\right\rceil -
\left\lceil \alpha (n-1)\right\rceil){n^{-s}}.$ We prove relations between them
and $J_{\boldsymbol{\alpha}}(s)=\sum\limits_{n\geq1}\left(\lbrace\alpha
n\rbrace-\frac{1}{2}\right)n^{-s}.$ Motivated by the previous work of Hardy and
Littlewood, Hecke and others regarding $J_{\boldsymbol{\alpha}},$ we show that
$\zeta_\alpha$ and $S_\alpha$ can be continued analytically beyond the
imaginary axis except for a simple pole at $s=1.$ Based on the latter results,
we also prove that the series
$\zeta_{\alpha}(s;\beta)=\sum\limits_{n\geq0}\left(\lfloor\alpha
n\rfloor+\beta\right)^{-s}$ can be continued analytically beyond the imaginary
axis except for a simple pole at $s=1.$
|
math.NT
|
for a positive irrational number alpha we study the ordinary dirichlet series zeta_alphas sumlimits_ngeq1 lflooralpha nrfloors and s_alphas sumlimits_ngeq1 leftlceilalpha nrightrceil leftlceil alpha n1rightrceilns we prove relations between them and j_boldsymbolalphassumlimits_ngeq1leftlbracealpha nrbracefrac12rightns motivated by the previous work of hardy and littlewood hecke and others regarding j_boldsymbolalpha we show that zeta_alpha and s_alpha can be continued analytically beyond the imaginary axis except for a simple pole at s1 based on the latter results we also prove that the series zeta_alphasbetasumlimits_ngeq0leftlflooralpha nrfloorbetarights can be continued analytically beyond the imaginary axis except for a simple pole at s1
|
[['for', 'a', 'positive', 'irrational', 'number', 'alpha', 'we', 'study', 'the', 'ordinary', 'dirichlet', 'series', 'zeta_alphas', 'sumlimits_ngeq1', 'lflooralpha', 'nrfloors', 'and', 's_alphas', 'sumlimits_ngeq1', 'leftlceilalpha', 'nrightrceil', 'leftlceil', 'alpha', 'n1rightrceilns', 'we', 'prove', 'relations', 'between', 'them', 'and', 'j_boldsymbolalphassumlimits_ngeq1leftlbracealpha', 'nrbracefrac12rightns', 'motivated', 'by', 'the', 'previous', 'work', 'of', 'hardy', 'and', 'littlewood', 'hecke', 'and', 'others', 'regarding', 'j_boldsymbolalpha', 'we', 'show', 'that', 'zeta_alpha', 'and', 's_alpha', 'can', 'be', 'continued', 'analytically', 'beyond', 'the', 'imaginary', 'axis', 'except', 'for', 'a', 'simple', 'pole', 'at', 's1', 'based', 'on', 'the', 'latter', 'results', 'we', 'also', 'prove', 'that', 'the', 'series', 'zeta_alphasbetasumlimits_ngeq0leftlflooralpha', 'nrfloorbetarights', 'can', 'be', 'continued', 'analytically', 'beyond', 'the', 'imaginary', 'axis', 'except', 'for', 'a', 'simple', 'pole', 'at', 's1']]
|
[-0.15559732809340882, 0.10001896789159488, -0.08074119330073397, 0.07780484098619149, -0.10366399259662923, -0.13016751602889948, 0.0769537448377153, 0.3679239939622305, -0.25840068929886195, -0.20227794169540297, 0.1239400090891178, -0.28463235728293196, -0.16871966311225184, 0.25778071454691664, -0.006904060319985872, 0.015241377193618703, 0.0087850697706511, 0.06851726266796943, -0.06671427600775603, -0.2558054814897018, 0.3027793827616138, -0.01934231752184806, 0.13602399028101822, 0.0948760860864027, 0.0529938015891354, 0.018590509315990746, 0.0008309670367542608, -0.03568782042252061, -0.18009652318177818, 0.09366558814122353, 0.21101840049672274, 0.04668719106480295, 0.24404868956103368, -0.3707437926420459, -0.1134004983706055, 0.15303459577837292, 0.2058984230697891, 0.026283950142470407, 0.022256070740785405, -0.25379441471563446, 0.09126393808868288, -0.1645518952842664, -0.2140068220101113, -0.08512579731896151, 0.06963842730095357, 0.025405197960531548, -0.2955609984052034, 0.10855693084634783, 0.06771685567075088, 0.08948362011600423, -0.06950283780935462, -0.18907388525060664, 0.020322266652789196, 0.10156274541499621, 0.07265325835904173, 0.02350590515013692, 0.07035095292936873, -0.06519768346262014, -0.08626960636472997, 0.32257002260949874, -0.08982383664467453, -0.18512412907992615, 0.1164828434523287, -0.2507159490839659, -0.1854488740640658, 0.08777686727037769, 0.09374301087249208, 0.11182375693762744, -0.043761935786424594, 0.15095844344784978, -0.09722229147352922, 0.12633129711159402, 0.15447911572999057, -0.07175642172633498, 0.1915605678855453, -0.005843500250283583, 0.056273356172037714, 0.13454662401367118, -0.01789988234174225, -0.056891743605381545, -0.31935424550815866, -0.1930800590802122, -0.1713350458116627, 0.06754076385433659, -0.10894389956363873, -0.11640204795072844, 0.3307563269418883, 0.08976456781642304, 0.23097167195275103, 0.1475571585944164, 0.2256522115871862, 0.1568147746046982, 0.02934321359857733, 0.08310900031830426, 0.19561533625295133, 0.1291141681815785, 0.05955121528794184, -0.20977052485133396, 0.004058846761185078, 0.11960513225791079]
|
1,803.0717
|
Blaming humans in autonomous vehicle accidents: Shared responsibility
across levels of automation
|
When a semi-autonomous car crashes and harms someone, how are blame and
causal responsibility distributed across the human and machine drivers? In this
article, we consider cases in which a pedestrian was hit and killed by a car
being operated under shared control of a primary and a secondary driver. We
find that when only one driver makes an error, that driver receives the blame
and is considered causally responsible for the harm, regardless of whether that
driver is a machine or a human. However, when both drivers make errors in cases
of shared control between a human and a machine, the blame and responsibility
attributed to the machine is reduced. This finding portends a public
under-reaction to the malfunctioning AI components of semi-autonomous cars and
therefore has a direct policy implication: a bottom-up regulatory scheme (which
operates through tort law that is adjudicated through the jury system) could
fail to properly regulate the safety of shared-control vehicles; instead, a
top-down scheme (enacted through federal laws) may be called for.
|
cs.AI cs.CY
|
when a semiautonomous car crashes and harms someone how are blame and causal responsibility distributed across the human and machine drivers in this article we consider cases in which a pedestrian was hit and killed by a car being operated under shared control of a primary and a secondary driver we find that when only one driver makes an error that driver receives the blame and is considered causally responsible for the harm regardless of whether that driver is a machine or a human however when both drivers make errors in cases of shared control between a human and a machine the blame and responsibility attributed to the machine is reduced this finding portends a public underreaction to the malfunctioning ai components of semiautonomous cars and therefore has a direct policy implication a bottomup regulatory scheme which operates through tort law that is adjudicated through the jury system could fail to properly regulate the safety of sharedcontrol vehicles instead a topdown scheme enacted through federal laws may be called for
|
[['when', 'a', 'semiautonomous', 'car', 'crashes', 'and', 'harms', 'someone', 'how', 'are', 'blame', 'and', 'causal', 'responsibility', 'distributed', 'across', 'the', 'human', 'and', 'machine', 'drivers', 'in', 'this', 'article', 'we', 'consider', 'cases', 'in', 'which', 'a', 'pedestrian', 'was', 'hit', 'and', 'killed', 'by', 'a', 'car', 'being', 'operated', 'under', 'shared', 'control', 'of', 'a', 'primary', 'and', 'a', 'secondary', 'driver', 'we', 'find', 'that', 'when', 'only', 'one', 'driver', 'makes', 'an', 'error', 'that', 'driver', 'receives', 'the', 'blame', 'and', 'is', 'considered', 'causally', 'responsible', 'for', 'the', 'harm', 'regardless', 'of', 'whether', 'that', 'driver', 'is', 'a', 'machine', 'or', 'a', 'human', 'however', 'when', 'both', 'drivers', 'make', 'errors', 'in', 'cases', 'of', 'shared', 'control', 'between', 'a', 'human', 'and', 'a', 'machine', 'the', 'blame', 'and', 'responsibility', 'attributed', 'to', 'the', 'machine', 'is', 'reduced', 'this', 'finding', 'portends', 'a', 'public', 'underreaction', 'to', 'the', 'malfunctioning', 'ai', 'components', 'of', 'semiautonomous', 'cars', 'and', 'therefore', 'has', 'a', 'direct', 'policy', 'implication', 'a', 'bottomup', 'regulatory', 'scheme', 'which', 'operates', 'through', 'tort', 'law', 'that', 'is', 'adjudicated', 'through', 'the', 'jury', 'system', 'could', 'fail', 'to', 'properly', 'regulate', 'the', 'safety', 'of', 'sharedcontrol', 'vehicles', 'instead', 'a', 'topdown', 'scheme', 'enacted', 'through', 'federal', 'laws', 'may', 'be', 'called', 'for']]
|
[-0.11795725396244659, 0.11176300435073842, -0.09764084280964494, 0.06699084620824643, -0.1182269494561754, -0.2188707748483095, 0.11877851545419434, 0.3600933795144572, -0.2633809998174082, -0.27617471300192264, 0.12012961537738402, -0.2592483336304331, -0.16455266898643975, 0.20307676605577168, -0.17919144962401784, 0.029067357993800436, 0.08053483153326911, 0.060793178468755274, 0.06919443835063491, -0.2230992152248151, 0.2817020949104404, 0.0479606715521428, 0.2861283950661943, 0.04590574156506898, 0.14393466710493233, 0.016789492888557973, -0.006039001764874277, -0.00633825733002703, -0.003005462139466028, 0.10541798955534953, 0.30904043372169404, 0.1997295775252378, 0.4051994737568339, -0.42092706202997787, -0.19954883697244322, 0.12663743170474231, 0.11450270677230613, 0.061224875901412415, -0.01489103053966482, -0.2745014211705737, 0.11993147234256571, -0.21599929760480244, -0.09264831397318717, -0.014577449441297784, 0.03736548555309515, 0.010355120072190888, -0.29807922296734396, -0.0002863694026449023, 0.06530235865368293, 0.0783550539233077, -0.028407358096019755, -0.020355578009783118, -0.03798328969109605, 0.22819409898007648, 0.07197251567856777, 0.04205560411971349, 0.19166752477879112, -0.17965864964634093, -0.15198343262329875, 0.4084401102240622, 0.026618173595975268, -0.20201205568437702, 0.18531570589643787, -0.057992406046161286, -0.12936202744738415, 0.0640346081459002, 0.19355912324173388, 0.06355136562333911, -0.19219844013212467, -0.018571620580076224, 0.007146550853910289, 0.17688390675631832, 0.04111619694599298, -0.03301311902338143, 0.20571729993260296, 0.18065746957932174, 0.07751906337453288, 0.0876511618179495, -0.058581032578078424, -0.0895420145339845, -0.2557136614327512, -0.1616127226906746, -0.10916639041409072, 0.02086290399565984, -0.011044992347948457, -0.11311490579436605, 0.34785163149211973, 0.17450758380355236, 0.1401396093631064, 0.02495767187982241, 0.34346979924273735, 0.07165057559844834, 0.09586559340306805, 0.13090537448231815, 0.20848316078476564, -0.012163387720346362, 0.12752171510488852, -0.21407920795977778, 0.18133958454447738, -0.0036006086525237242]
|
1,803.07171
|
Effective gravitational coupling in modified teleparallel theories
|
In the present study, we consider an extended form of teleparallel Lagrangian
$f(T,\phi,X)$, as function of a scalar field $\phi$, its kinetic term $X$ and
the torsion scalar $T$. We use linear perturbations to obtain the equation of
matter density perturbations on sub-Hubble scales. The gravitational coupling
is modified in scalar modes with respect to the one of General Relativity,
albeit vector modes decay and do not show any significant effects. We thus
extend these results by involving multiple scalar field models. Further, we
study conformal transformations in teleparallel gravity and we obtain the
coupling as the scalar field is non-minimally coupled to both torsion and
boundary terms. Finally, we propose the specific model $f(T,\phi,X)=T +
\partial_\mu \phi\ \partial^\mu \phi +\xi T \phi^2$. To check its goodness, we
employ the observational Hubble data, constraining the coupling constant,
$\xi$, through a Monte Carlo technique based on the Metropolis-Hastings
algorithm. Hence, fixing $\xi$ to its best-fit value got from our numerical
analysis, we calculate the growth rate of matter perturbations and we compare
our outcomes with the latest measurements and the predictions of the
$\Lambda$CDM model.
|
gr-qc astro-ph.CO hep-th
|
in the present study we consider an extended form of teleparallel lagrangian ftphix as function of a scalar field phi its kinetic term x and the torsion scalar t we use linear perturbations to obtain the equation of matter density perturbations on subhubble scales the gravitational coupling is modified in scalar modes with respect to the one of general relativity albeit vector modes decay and do not show any significant effects we thus extend these results by involving multiple scalar field models further we study conformal transformations in teleparallel gravity and we obtain the coupling as the scalar field is nonminimally coupled to both torsion and boundary terms finally we propose the specific model ftphixt partial_mu phi partialmu phi xi t phi2 to check its goodness we employ the observational hubble data constraining the coupling constant xi through a monte carlo technique based on the metropolishastings algorithm hence fixing xi to its bestfit value got from our numerical analysis we calculate the growth rate of matter perturbations and we compare our outcomes with the latest measurements and the predictions of the lambdacdm model
|
[['in', 'the', 'present', 'study', 'we', 'consider', 'an', 'extended', 'form', 'of', 'teleparallel', 'lagrangian', 'ftphix', 'as', 'function', 'of', 'a', 'scalar', 'field', 'phi', 'its', 'kinetic', 'term', 'x', 'and', 'the', 'torsion', 'scalar', 't', 'we', 'use', 'linear', 'perturbations', 'to', 'obtain', 'the', 'equation', 'of', 'matter', 'density', 'perturbations', 'on', 'subhubble', 'scales', 'the', 'gravitational', 'coupling', 'is', 'modified', 'in', 'scalar', 'modes', 'with', 'respect', 'to', 'the', 'one', 'of', 'general', 'relativity', 'albeit', 'vector', 'modes', 'decay', 'and', 'do', 'not', 'show', 'any', 'significant', 'effects', 'we', 'thus', 'extend', 'these', 'results', 'by', 'involving', 'multiple', 'scalar', 'field', 'models', 'further', 'we', 'study', 'conformal', 'transformations', 'in', 'teleparallel', 'gravity', 'and', 'we', 'obtain', 'the', 'coupling', 'as', 'the', 'scalar', 'field', 'is', 'nonminimally', 'coupled', 'to', 'both', 'torsion', 'and', 'boundary', 'terms', 'finally', 'we', 'propose', 'the', 'specific', 'model', 'ftphixt', 'partial_mu', 'phi', 'partialmu', 'phi', 'xi', 't', 'phi2', 'to', 'check', 'its', 'goodness', 'we', 'employ', 'the', 'observational', 'hubble', 'data', 'constraining', 'the', 'coupling', 'constant', 'xi', 'through', 'a', 'monte', 'carlo', 'technique', 'based', 'on', 'the', 'metropolishastings', 'algorithm', 'hence', 'fixing', 'xi', 'to', 'its', 'bestfit', 'value', 'got', 'from', 'our', 'numerical', 'analysis', 'we', 'calculate', 'the', 'growth', 'rate', 'of', 'matter', 'perturbations', 'and', 'we', 'compare', 'our', 'outcomes', 'with', 'the', 'latest', 'measurements', 'and', 'the', 'predictions', 'of', 'the', 'lambdacdm', 'model']]
|
[-0.17287064519407258, 0.13215267575979142, -0.10209052115987513, 0.08442066340624915, -0.12667315035482138, -0.16461537848869906, -0.034514614932743305, 0.31058489647565296, -0.23282511034229184, -0.2853498429266443, 0.030981725532669594, -0.271492552166568, -0.11869862461874252, 0.12726414702557418, 0.0286249781058952, 0.038403221016597947, 0.01981552519696605, 0.07869689818728942, -0.09146064482320573, -0.244713966319214, 0.3419772609502324, 0.07666386942281414, 0.1933546622778361, 0.019576274054073497, 0.08893717885935853, -0.021578998265026437, -0.04175396337950839, 0.004020696613958198, -0.231355093049081, 0.03632601053397382, 0.13094864483540108, 0.11253156977607895, 0.22776985900136976, -0.40439583939495005, -0.22015620549839732, 0.13298122002614549, 0.1044908746593318, 0.11405462351787156, -0.03673682196672944, -0.2883587311747489, 0.05688671202807898, -0.165413624306019, -0.11384288327850772, -0.11460891203152129, -0.028196551696170965, -0.03547245282673364, -0.310943723432411, 0.11157907329201287, -0.02386247831556267, -0.004327007245210653, -0.07974317957176338, -0.09554087806709152, -0.026063360640610624, 0.014440122775692307, 0.1418935486928493, 0.07834910332271572, 0.14243153231064096, -0.1491720575623173, -0.07087396287670596, 0.3747585750190099, -0.20676069980575987, -0.2551166185432561, 0.13183391865121602, -0.15204170939270717, -0.13939951638014503, 0.038907668615037895, 0.16736441545538316, 0.1462276188552332, -0.12180749347011523, 0.18714244978165367, 0.013589673517374785, 0.1671122075560199, 0.0335078542712479, 0.0029316559419143968, 0.20441739762315106, 0.09397483086573649, 0.009498930790587662, 0.13517918476374377, -0.05831041790478096, -0.10263717148416979, -0.3923768166286063, -0.15612018542577774, -0.11207182693953796, 0.05574112545220678, -0.16700236433399815, -0.1600310842079517, 0.38965185400669705, 0.17320473082794535, 0.1791925174981685, 0.12342193952982844, 0.27604732914822616, 0.12128276636474122, 0.05070222202477493, 0.06946331067576758, 0.2857400007617984, 0.2053677271922937, 0.09018569906404272, -0.268215032106906, -0.04398754202292522, 0.03828868353919471]
|
1,803.07172
|
Beyond Homophily: Incorporating Actor Variables in Actor-oriented
Network Models
|
We consider the specification of effects of numerical actor attributes in
statistical models for directed social networks. A fundamental mechanism is
homophily or assortativity, where actors have a higher likelihood to be tied
with others having similar values of the variable under study. But there are
other mechanisms that may also play a role in how the attribute values of two
actors influence the likelihood of a tie. We discuss three additional
mechanisms: aspiration to send ties to others having high values; conformity in
the sense of sending more ties to others whose values are close to what may be
considered the `social norm'; and sociability, where those having higher values
will tend to send more ties generally. These mechanisms may operate jointly,
and then their effects will be confounded. We present a specification
representing these effects simultaneously by a four-parameter quadratic
function of the values of sender and receiver. Greater flexibility can be
obtained by a five-parameter extension. We argue that empirical researchers
often overlook the possibility that homophily may be confounded with these
other mechanisms, and that for actor attributes that have important effects on
directed networks, these specifications may provide an improvement. An
illustration is given of the dependence of advice ties on academic grades in a
network of MBA students, analyzed by the Stochastic Actor-oriented Model.
|
stat.AP stat.ME stat.OT
|
we consider the specification of effects of numerical actor attributes in statistical models for directed social networks a fundamental mechanism is homophily or assortativity where actors have a higher likelihood to be tied with others having similar values of the variable under study but there are other mechanisms that may also play a role in how the attribute values of two actors influence the likelihood of a tie we discuss three additional mechanisms aspiration to send ties to others having high values conformity in the sense of sending more ties to others whose values are close to what may be considered the social norm and sociability where those having higher values will tend to send more ties generally these mechanisms may operate jointly and then their effects will be confounded we present a specification representing these effects simultaneously by a fourparameter quadratic function of the values of sender and receiver greater flexibility can be obtained by a fiveparameter extension we argue that empirical researchers often overlook the possibility that homophily may be confounded with these other mechanisms and that for actor attributes that have important effects on directed networks these specifications may provide an improvement an illustration is given of the dependence of advice ties on academic grades in a network of mba students analyzed by the stochastic actororiented model
|
[['we', 'consider', 'the', 'specification', 'of', 'effects', 'of', 'numerical', 'actor', 'attributes', 'in', 'statistical', 'models', 'for', 'directed', 'social', 'networks', 'a', 'fundamental', 'mechanism', 'is', 'homophily', 'or', 'assortativity', 'where', 'actors', 'have', 'a', 'higher', 'likelihood', 'to', 'be', 'tied', 'with', 'others', 'having', 'similar', 'values', 'of', 'the', 'variable', 'under', 'study', 'but', 'there', 'are', 'other', 'mechanisms', 'that', 'may', 'also', 'play', 'a', 'role', 'in', 'how', 'the', 'attribute', 'values', 'of', 'two', 'actors', 'influence', 'the', 'likelihood', 'of', 'a', 'tie', 'we', 'discuss', 'three', 'additional', 'mechanisms', 'aspiration', 'to', 'send', 'ties', 'to', 'others', 'having', 'high', 'values', 'conformity', 'in', 'the', 'sense', 'of', 'sending', 'more', 'ties', 'to', 'others', 'whose', 'values', 'are', 'close', 'to', 'what', 'may', 'be', 'considered', 'the', 'social', 'norm', 'and', 'sociability', 'where', 'those', 'having', 'higher', 'values', 'will', 'tend', 'to', 'send', 'more', 'ties', 'generally', 'these', 'mechanisms', 'may', 'operate', 'jointly', 'and', 'then', 'their', 'effects', 'will', 'be', 'confounded', 'we', 'present', 'a', 'specification', 'representing', 'these', 'effects', 'simultaneously', 'by', 'a', 'fourparameter', 'quadratic', 'function', 'of', 'the', 'values', 'of', 'sender', 'and', 'receiver', 'greater', 'flexibility', 'can', 'be', 'obtained', 'by', 'a', 'fiveparameter', 'extension', 'we', 'argue', 'that', 'empirical', 'researchers', 'often', 'overlook', 'the', 'possibility', 'that', 'homophily', 'may', 'be', 'confounded', 'with', 'these', 'other', 'mechanisms', 'and', 'that', 'for', 'actor', 'attributes', 'that', 'have', 'important', 'effects', 'on', 'directed', 'networks', 'these', 'specifications', 'may', 'provide', 'an', 'improvement', 'an', 'illustration', 'is', 'given', 'of', 'the', 'dependence', 'of', 'advice', 'ties', 'on', 'academic', 'grades', 'in', 'a', 'network', 'of', 'mba', 'students', 'analyzed', 'by', 'the', 'stochastic', 'actororiented', 'model']]
|
[-0.1181237330914221, 0.10615113053632244, -0.09014385584860891, 0.11014191503319043, -0.1421299100620672, -0.20404996339824388, 0.07189826409025542, 0.42688100436194376, -0.26525853454897347, -0.32449424504302443, 0.06774817194831981, -0.2867495862640102, -0.18187149583510206, 0.13650183954318476, -0.09019867047053677, -0.027327812812952535, 0.042789167957380414, 0.0655934461086872, -0.007963049374732443, -0.2797717977537435, 0.3250352268064903, 0.07365928200623867, 0.2555145574945279, 0.03197350996117827, 0.05143287473104217, -0.03001918240915984, -0.034123832102737985, 0.06282621166742915, -0.09549396924482029, 0.1293576292185621, 0.30275420082638116, 0.1557077643546191, 0.3467359800230373, -0.4321774220739661, -0.21816401017660444, 0.14914382652548905, 0.11391298226914262, 0.0666612322061238, -0.0018886795707988892, -0.2848873962986876, 0.09081237589760514, -0.1930542915297503, -0.07788530133654024, -0.07032457056603479, 0.013097963695922359, 0.0581952036051503, -0.28488049411468885, 0.030210002102566334, 0.05756662099368193, 0.08248913384847004, -0.029450016213707964, -0.13133232896163297, -0.035787107412364676, 0.18538118092322045, 0.09072482882554389, -0.025894831734794108, 0.14022833125835116, -0.1694605348102579, -0.16419606263463554, 0.3757080998525701, -0.004097412005913528, -0.2376520507058806, 0.19604440160593103, -0.10976129179947416, -0.16271100430749358, 0.05737966164015233, 0.2082041331503371, 0.0463620899350975, -0.16261222735470668, -0.023778748159847138, -0.03978606815349353, 0.15423704240344127, 0.04383666022172706, 0.05116053533803841, 0.2160062867174433, 0.109155745069835, 0.06713064581325108, 0.09471264515245408, -0.016672073664482343, -0.09713061694902453, -0.24527179497209461, -0.10567638750124553, -0.10969207295301285, 0.04068896183069393, -0.12838357922763946, -0.11565333669581875, 0.36859749540347947, 0.18688009506440723, 0.19301216481253505, 0.05919478078272236, 0.24005014621229334, 0.09307003983677449, 0.10056499104460025, 0.05295027925273065, 0.23648784493561834, 0.058904025576670065, 0.08599556775509634, -0.14168134100036694, 0.20308692855337127, -0.011101948546076363]
|
1,803.07173
|
Function spaces of coercivity for the fractional Laplacian in spaces of
homogeneous type
|
We combine dyadic analysis through Haar type wavelets defined on Christ's
families of generalized cubes, and Lax-Milgram theorem, in order to prove
existence of Green's functions for fractional Laplacians on some function
spaces of vanishing small resolution in spaces of homogeneous type.
|
math.FA
|
we combine dyadic analysis through haar type wavelets defined on christs families of generalized cubes and laxmilgram theorem in order to prove existence of greens functions for fractional laplacians on some function spaces of vanishing small resolution in spaces of homogeneous type
|
[['we', 'combine', 'dyadic', 'analysis', 'through', 'haar', 'type', 'wavelets', 'defined', 'on', 'christs', 'families', 'of', 'generalized', 'cubes', 'and', 'laxmilgram', 'theorem', 'in', 'order', 'to', 'prove', 'existence', 'of', 'greens', 'functions', 'for', 'fractional', 'laplacians', 'on', 'some', 'function', 'spaces', 'of', 'vanishing', 'small', 'resolution', 'in', 'spaces', 'of', 'homogeneous', 'type']]
|
[-0.12319723022214714, 0.04052073092732046, -0.08483686524310283, 0.1506036488738443, -0.09774803835898638, -0.032372447728578536, -0.01930857893256914, 0.35385966261050533, -0.2903670200279781, -0.1580019404756881, 0.14739751173294194, -0.2757611598242961, -0.14011245875597178, 0.2180314902659683, -0.11840722931637651, 0.0622301720792339, 0.02488772031834482, -0.005118546203621442, -0.1393622070373524, -0.21938218557763667, 0.4432882961063158, -0.11786411732845452, 0.25566185425434795, 0.020250141531938597, 0.07765103439756092, 0.09108582957248602, -0.1075473302598333, -0.007627929294747966, -0.21188292421755336, 0.14432098875044003, 0.23325703993794464, 0.047241812788083086, 0.28496233968152884, -0.3769765501132324, -0.19474362335833056, 0.17155174479731136, 0.1032822712468693, -0.06566338114706534, 0.014061139739212757, -0.318541806191206, 0.11608534009151515, -0.09997465044614814, -0.22549380636995747, -0.1537092295475304, -0.005637159238436392, 0.13521155892383485, -0.2794425688196151, 0.09928059098975998, 0.09467815177603847, 0.06351139726826832, -0.14383832763581136, -0.1443211432723772, 0.0018423384920294797, 0.03339241894095072, -0.05460954084992409, -0.016514846123754978, 0.010283333216128605, -0.009844742316220487, -0.14720747384819247, 0.27005209434511407, -0.11871398809377015, -0.3287708567721503, 0.138984117900864, -0.1792727681320338, -0.20166258673582757, 0.055106537305705604, 0.17630355215320984, 0.15692301138880707, -0.06051894443641816, 0.13738019571367963, -0.08006685160632644, 0.11021116287780128, 0.20142482744441145, 0.11099235979574067, 0.05459996468077103, 0.07005428864310186, 0.14545348997316546, 0.1634699323303288, 0.0024838069387312445, -0.08099278225286287, -0.338789740311248, -0.15736343507610617, -0.2418484695344454, 0.12450169796578675, -0.1719898307426428, -0.29881550424865316, 0.35787739755497094, 0.05237505328287149, 0.13208671821103918, 0.13592603892487073, 0.1767037104194363, 0.1200662644225217, 0.06365485283147011, -0.005890083432729755, 0.06958301045302678, 0.24689333946333222, 0.06746401088977498, -0.07894490730194818, -0.05501208948442668, 0.3075977127023396]
|
1,803.07174
|
Density Functional Theory Evaluation of Cation-doped Bismuth Molybdenum
Oxide Photocatalysts for Nitrogen Fixation
|
This study investigates the photocatalytic nitrogen fixation on a
cation-doped surface (Bi$_{x}$M$_{y}$)$_2$MoO$_6$ where (M = Fe, La, Yb) in
both the orthorhombic and monoclinic configurations using a density functional
theory (DFT) approach with experimentally validated model inputs. The
proceeding discussion focuses on the Heyrovsky-type reactions for both the
associative and dissociative reaction pathway related to nitrogen reduction.
Key fundamental insight in the reduction mechanism is discussed that relates
the material properties of the substitutional ions to the nitrogen and hydrogen
affinities. Physical insight is gathered through interpretation of bound
electronic states at the surface. Compositional phases of higher Fe and Yb
concentrations resulted in decreased Mo-O binding and increased affinity
between Mo and the N and H species on the surface. The modulation of the Mo-O
binding is induced by strain as Yb and Fe are implemented, this, in turn,
shifts energy levels and modulates the band gap energy by approximately 0.2 eV.
This modification of Mo-O bond as substitution occurs is a result of the
orbital hybridization of M-O (M = Fe, Yb) that causes a strong orbital
interaction that shifts states. The optimal composition was predicted to be an
orthorhombic configuration of (Bi$_{0.75}$Fe$_{0.25}$)$_2$MoO$_6$ with a
predicted maximum thermodynamic energy barrier of 1.4 eV. This composition
demonstrates effective nitrogen and hydrogen affinity that follows the
associative or biological nitrogen fixation pathway.
|
cond-mat.mtrl-sci
|
this study investigates the photocatalytic nitrogen fixation on a cationdoped surface bi_xm_y_2moo_6 where m fe la yb in both the orthorhombic and monoclinic configurations using a density functional theory dft approach with experimentally validated model inputs the proceeding discussion focuses on the heyrovskytype reactions for both the associative and dissociative reaction pathway related to nitrogen reduction key fundamental insight in the reduction mechanism is discussed that relates the material properties of the substitutional ions to the nitrogen and hydrogen affinities physical insight is gathered through interpretation of bound electronic states at the surface compositional phases of higher fe and yb concentrations resulted in decreased moo binding and increased affinity between mo and the n and h species on the surface the modulation of the moo binding is induced by strain as yb and fe are implemented this in turn shifts energy levels and modulates the band gap energy by approximately 02 ev this modification of moo bond as substitution occurs is a result of the orbital hybridization of mo m fe yb that causes a strong orbital interaction that shifts states the optimal composition was predicted to be an orthorhombic configuration of bi_075fe_025_2moo_6 with a predicted maximum thermodynamic energy barrier of 14 ev this composition demonstrates effective nitrogen and hydrogen affinity that follows the associative or biological nitrogen fixation pathway
|
[['this', 'study', 'investigates', 'the', 'photocatalytic', 'nitrogen', 'fixation', 'on', 'a', 'cationdoped', 'surface', 'bi_xm_y_2moo_6', 'where', 'm', 'fe', 'la', 'yb', 'in', 'both', 'the', 'orthorhombic', 'and', 'monoclinic', 'configurations', 'using', 'a', 'density', 'functional', 'theory', 'dft', 'approach', 'with', 'experimentally', 'validated', 'model', 'inputs', 'the', 'proceeding', 'discussion', 'focuses', 'on', 'the', 'heyrovskytype', 'reactions', 'for', 'both', 'the', 'associative', 'and', 'dissociative', 'reaction', 'pathway', 'related', 'to', 'nitrogen', 'reduction', 'key', 'fundamental', 'insight', 'in', 'the', 'reduction', 'mechanism', 'is', 'discussed', 'that', 'relates', 'the', 'material', 'properties', 'of', 'the', 'substitutional', 'ions', 'to', 'the', 'nitrogen', 'and', 'hydrogen', 'affinities', 'physical', 'insight', 'is', 'gathered', 'through', 'interpretation', 'of', 'bound', 'electronic', 'states', 'at', 'the', 'surface', 'compositional', 'phases', 'of', 'higher', 'fe', 'and', 'yb', 'concentrations', 'resulted', 'in', 'decreased', 'moo', 'binding', 'and', 'increased', 'affinity', 'between', 'mo', 'and', 'the', 'n', 'and', 'h', 'species', 'on', 'the', 'surface', 'the', 'modulation', 'of', 'the', 'moo', 'binding', 'is', 'induced', 'by', 'strain', 'as', 'yb', 'and', 'fe', 'are', 'implemented', 'this', 'in', 'turn', 'shifts', 'energy', 'levels', 'and', 'modulates', 'the', 'band', 'gap', 'energy', 'by', 'approximately', '02', 'ev', 'this', 'modification', 'of', 'moo', 'bond', 'as', 'substitution', 'occurs', 'is', 'a', 'result', 'of', 'the', 'orbital', 'hybridization', 'of', 'mo', 'm', 'fe', 'yb', 'that', 'causes', 'a', 'strong', 'orbital', 'interaction', 'that', 'shifts', 'states', 'the', 'optimal', 'composition', 'was', 'predicted', 'to', 'be', 'an', 'orthorhombic', 'configuration', 'of', 'bi_075fe_025_2moo_6', 'with', 'a', 'predicted', 'maximum', 'thermodynamic', 'energy', 'barrier', 'of', '14', 'ev', 'this', 'composition', 'demonstrates', 'effective', 'nitrogen', 'and', 'hydrogen', 'affinity', 'that', 'follows', 'the', 'associative', 'or', 'biological', 'nitrogen', 'fixation', 'pathway']]
|
[-0.08804895462283942, 0.18730340261316558, 0.015472428113382732, 0.042580864473064944, 0.03493341083284812, -0.14016831994349896, 0.15185618514240357, 0.4037370913817237, -0.28003457485034167, -0.3224517366228004, -0.04278485692554602, -0.3047635426337365, -0.12007482473509973, 0.10276475252963051, 0.006746631439050866, -0.04825518187135458, 0.0345789358942528, -0.01410129736824375, -0.09106681543724132, -0.19157127545946018, 0.2555880843766418, 0.12978764496855782, 0.2934633559128054, 0.1233019079620674, 0.04038878142428412, -0.026688715111015848, 0.07800127058376179, -0.012629658971154303, -0.14180527592826467, 0.16788126553863683, 0.24993607538878373, 0.03319768401410396, 0.20550268706520675, -0.42787590171038, -0.2145981035676043, 0.0047533948694493755, 0.1076938085688097, 0.12903362985148473, -0.08938408289665219, -0.23110894746517902, 0.035074922355340314, -0.14926746038098052, -0.09773762658652332, -0.04383445629867277, 0.04438188787403137, 0.024072860081947443, -0.24820991369455847, 0.08751348691981144, 0.0626778097745652, 0.11781425857690112, -0.17107001275225128, -0.1817291089036088, -0.14306467714831578, 0.05333258598262479, 0.03584576229224223, 0.047985733928254816, 0.22122593282256275, -0.02471096836126418, -0.06555980930958565, 0.4040289297527461, -0.06331325425869888, -0.07769198206477557, 0.18100103781843144, -0.1292920478348673, -0.1203378058293041, 0.19896617290322427, 0.0903088417145665, 0.10122668852650181, -0.13753055446539764, 0.09651693997686918, 0.048415210367508094, 0.21915266458139135, 0.09805711693803056, 0.028344874212052673, 0.1876195659063308, 0.19851467387181604, 0.06473775508520366, 0.09416131854770894, -0.115565105339758, -0.06411434378996664, -0.18847875884320173, -0.21949257561424962, -0.15300218799987947, 0.059297550046014495, -0.09023175455122665, -0.13176302021774636, 0.3591454279656453, 0.0643797806608038, 0.1929100410823055, -0.08254786349695038, 0.2033477936466052, 0.10114106750525362, 0.028290489380230644, -0.01884776742749468, 0.21381709124263445, 0.19032560334825474, 0.08800364780688176, -0.3091466443891275, 0.12173258561718588, 0.07344339664646045]
|
1,803.07175
|
A Search for Gravitationally Lensed Quasars and Quasar Pairs in
Pan-STARRS1: Spectroscopy and Sources of Shear in the Diamond 2M1134$-$2103
|
We present results of a systematic search for gravitationally lensed quasars
in Pan-STARRS1. Our final sample of candidates comprises of 91 systems, not
including 25 rediscovered lensed quasars and quasar pairs. In the absence of
spectroscopy to verify the lensing nature of the candidates, the main sources
of contaminants are likely to be quasar pairs, which we consider to be a
byproduct of our work, and a smaller number of quasar$+$star associations.
Amongst the independently discovered quads is 2M1134$-$2103, for which we
obtained spectroscopy for the first time, finding a redshift of 2.77 for the
quasar. There is evidence for microlensing in at least one image. We perform
detailed mass modeling of this system using archival imaging data, and find
that the unusually large shear responsible for the diamond-like configuration
can be attributed mainly to a faint companion $\sim 4''$ away, and to a galaxy
group/cluster $\sim 30''$ away. We also set limits of $z\sim0.5-1.5$ on the
redshift of the lensing galaxy, based on its brightness, the image separation
of the lensed images, and an analysis of the observed photometric flux ratios.
|
astro-ph.GA
|
we present results of a systematic search for gravitationally lensed quasars in panstarrs1 our final sample of candidates comprises of 91 systems not including 25 rediscovered lensed quasars and quasar pairs in the absence of spectroscopy to verify the lensing nature of the candidates the main sources of contaminants are likely to be quasar pairs which we consider to be a byproduct of our work and a smaller number of quasarstar associations amongst the independently discovered quads is 2m11342103 for which we obtained spectroscopy for the first time finding a redshift of 277 for the quasar there is evidence for microlensing in at least one image we perform detailed mass modeling of this system using archival imaging data and find that the unusually large shear responsible for the diamondlike configuration can be attributed mainly to a faint companion sim 4 away and to a galaxy groupcluster sim 30 away we also set limits of zsim0515 on the redshift of the lensing galaxy based on its brightness the image separation of the lensed images and an analysis of the observed photometric flux ratios
|
[['we', 'present', 'results', 'of', 'a', 'systematic', 'search', 'for', 'gravitationally', 'lensed', 'quasars', 'in', 'panstarrs1', 'our', 'final', 'sample', 'of', 'candidates', 'comprises', 'of', '91', 'systems', 'not', 'including', '25', 'rediscovered', 'lensed', 'quasars', 'and', 'quasar', 'pairs', 'in', 'the', 'absence', 'of', 'spectroscopy', 'to', 'verify', 'the', 'lensing', 'nature', 'of', 'the', 'candidates', 'the', 'main', 'sources', 'of', 'contaminants', 'are', 'likely', 'to', 'be', 'quasar', 'pairs', 'which', 'we', 'consider', 'to', 'be', 'a', 'byproduct', 'of', 'our', 'work', 'and', 'a', 'smaller', 'number', 'of', 'quasarstar', 'associations', 'amongst', 'the', 'independently', 'discovered', 'quads', 'is', '2m11342103', 'for', 'which', 'we', 'obtained', 'spectroscopy', 'for', 'the', 'first', 'time', 'finding', 'a', 'redshift', 'of', '277', 'for', 'the', 'quasar', 'there', 'is', 'evidence', 'for', 'microlensing', 'in', 'at', 'least', 'one', 'image', 'we', 'perform', 'detailed', 'mass', 'modeling', 'of', 'this', 'system', 'using', 'archival', 'imaging', 'data', 'and', 'find', 'that', 'the', 'unusually', 'large', 'shear', 'responsible', 'for', 'the', 'diamondlike', 'configuration', 'can', 'be', 'attributed', 'mainly', 'to', 'a', 'faint', 'companion', 'sim', '4', 'away', 'and', 'to', 'a', 'galaxy', 'groupcluster', 'sim', '30', 'away', 'we', 'also', 'set', 'limits', 'of', 'zsim0515', 'on', 'the', 'redshift', 'of', 'the', 'lensing', 'galaxy', 'based', 'on', 'its', 'brightness', 'the', 'image', 'separation', 'of', 'the', 'lensed', 'images', 'and', 'an', 'analysis', 'of', 'the', 'observed', 'photometric', 'flux', 'ratios']]
|
[-0.08045716991311767, 0.03349218039794424, -0.06970181385210404, 0.06355054225164672, -0.08958308281144127, -0.06762757070828229, 0.0676363626598484, 0.38150382129371996, -0.14820781976191533, -0.3661162928419395, 0.06903630180750042, -0.34163507780888014, -0.05046436913932363, 0.23863519385146598, -0.01276512381931146, -0.0064654330622741125, 0.07302083234988256, -0.088329002153801, -0.01736934303108784, -0.3065456474820773, 0.30080829974677825, 0.05914539445915984, 0.1707896165659703, -0.021257094928943034, 0.1099063865627007, -0.04458816069462854, -0.1182577503275954, 0.014553386583510372, -0.12395510245005426, 0.05129563779725383, 0.24961078331883377, 0.14148119385354221, 0.22853197648396922, -0.27139741958926605, -0.16220635332218888, 0.1042713212651304, 0.19994356304264835, 0.10199023898458108, -0.0760917437172288, -0.3320404091436002, 0.11377476909741138, -0.12099841800518334, -0.13515730377338414, 0.03457134039555159, 0.03704207173949625, 0.028103059558068504, -0.2171467619585908, 0.14671765142492305, 0.020665080894509122, 0.09053053346255588, -0.10181469783355068, -0.06941167786911441, -0.05110038644504837, 0.07121351874536938, 0.010271493817627843, 0.07352681265781737, 0.12339283984814149, -0.152975013874109, -0.05252782620179156, 0.4150271158044537, -0.04746279940785219, -0.025341003799500564, 0.2057342486262011, -0.17486878592624433, -0.21952541671020703, 0.1477109518341927, 0.20460674120630656, 0.14561290713544522, -0.17462233086116613, -0.031017427437796466, -0.029072815048332108, 0.24599052120207085, 0.027142241998161707, 0.07170891538666588, 0.29831161464874945, 0.1276532124936542, 0.04267266277844707, 0.13196851714035598, -0.26762627692789664, 0.04739078177760045, -0.25933504538002633, -0.11453809603376107, -0.18970493416353645, 0.09870578446368906, -0.11485190821201993, -0.13514793305342512, 0.38605915489606557, 0.14907666104198952, 0.23610547466216505, 0.06461813221556238, 0.2831798291001986, 0.06750606586712012, 0.12534432400069717, 0.05064449053671625, 0.34477580569477545, 0.12869106580813724, 0.04575542860418662, -0.1828564070372118, 0.026124598220404652, -0.003655762035244455]
|
1,803.07176
|
Geometric phase magnetometry using a solid-state spin
|
Magnetometry is a powerful technique for the non-invasive study of biological
and physical systems. A key challenge lies in the simultaneous optimization of
magnetic field sensitivity and maximum field range. In interferometry-based
magnetometry, a quantum two-level system acquires a dynamic phase in response
to an applied magnetic field. However, due to the 2{\pi} periodicity of the
phase, increasing the coherent interrogation time to improve sensitivity
results in reduced field range. Here we introduce a route towards both large
magnetic field range and high sensitivity via measurements of the geometric
phase acquired by a quantum two-level system. We experimentally demonstrate
geometric-phase magnetometry using the optically addressable electronic spin
associated with the nitrogen vacancy (NV) color center in diamond. Our approach
enables unwrapping of the 2{\pi} phase ambiguity, decoupling of magnetic field
range from sensitivity, and enhancement of the field range by about 400 times.
We also find additional improvement in sensitivity in the nonadiabatic regime,
and study how geometric-phase decoherence depends on adiabaticity. Our results
show that the geometric phase can be a versatile tool for quantum sensing
applications.
|
quant-ph
|
magnetometry is a powerful technique for the noninvasive study of biological and physical systems a key challenge lies in the simultaneous optimization of magnetic field sensitivity and maximum field range in interferometrybased magnetometry a quantum twolevel system acquires a dynamic phase in response to an applied magnetic field however due to the 2pi periodicity of the phase increasing the coherent interrogation time to improve sensitivity results in reduced field range here we introduce a route towards both large magnetic field range and high sensitivity via measurements of the geometric phase acquired by a quantum twolevel system we experimentally demonstrate geometricphase magnetometry using the optically addressable electronic spin associated with the nitrogen vacancy nv color center in diamond our approach enables unwrapping of the 2pi phase ambiguity decoupling of magnetic field range from sensitivity and enhancement of the field range by about 400 times we also find additional improvement in sensitivity in the nonadiabatic regime and study how geometricphase decoherence depends on adiabaticity our results show that the geometric phase can be a versatile tool for quantum sensing applications
|
[['magnetometry', 'is', 'a', 'powerful', 'technique', 'for', 'the', 'noninvasive', 'study', 'of', 'biological', 'and', 'physical', 'systems', 'a', 'key', 'challenge', 'lies', 'in', 'the', 'simultaneous', 'optimization', 'of', 'magnetic', 'field', 'sensitivity', 'and', 'maximum', 'field', 'range', 'in', 'interferometrybased', 'magnetometry', 'a', 'quantum', 'twolevel', 'system', 'acquires', 'a', 'dynamic', 'phase', 'in', 'response', 'to', 'an', 'applied', 'magnetic', 'field', 'however', 'due', 'to', 'the', '2pi', 'periodicity', 'of', 'the', 'phase', 'increasing', 'the', 'coherent', 'interrogation', 'time', 'to', 'improve', 'sensitivity', 'results', 'in', 'reduced', 'field', 'range', 'here', 'we', 'introduce', 'a', 'route', 'towards', 'both', 'large', 'magnetic', 'field', 'range', 'and', 'high', 'sensitivity', 'via', 'measurements', 'of', 'the', 'geometric', 'phase', 'acquired', 'by', 'a', 'quantum', 'twolevel', 'system', 'we', 'experimentally', 'demonstrate', 'geometricphase', 'magnetometry', 'using', 'the', 'optically', 'addressable', 'electronic', 'spin', 'associated', 'with', 'the', 'nitrogen', 'vacancy', 'nv', 'color', 'center', 'in', 'diamond', 'our', 'approach', 'enables', 'unwrapping', 'of', 'the', '2pi', 'phase', 'ambiguity', 'decoupling', 'of', 'magnetic', 'field', 'range', 'from', 'sensitivity', 'and', 'enhancement', 'of', 'the', 'field', 'range', 'by', 'about', '400', 'times', 'we', 'also', 'find', 'additional', 'improvement', 'in', 'sensitivity', 'in', 'the', 'nonadiabatic', 'regime', 'and', 'study', 'how', 'geometricphase', 'decoherence', 'depends', 'on', 'adiabaticity', 'our', 'results', 'show', 'that', 'the', 'geometric', 'phase', 'can', 'be', 'a', 'versatile', 'tool', 'for', 'quantum', 'sensing', 'applications']]
|
[-0.1389925703510977, 0.18667582012891176, -0.04744006373155653, -0.013068657189874459, -0.023491585182465528, -0.10763526841699868, 0.080496010281606, 0.40350192866884593, -0.26538994072235367, -0.3349013587177386, 0.07216489520198613, -0.2215076295549071, -0.1374232186098698, 0.24380498116815022, -0.042058280014776406, 0.05416761742632711, 0.025996935344562773, 0.005441778807722953, -0.07597278549696915, -0.14022650902049638, 0.25184530376069497, 0.037960498807611716, 0.31594120330972536, 0.07669973320960789, 0.11628658594328156, 0.05598326131251505, 0.07327628425019009, 0.023844545142034466, -0.10462444905915821, 0.07997548670685861, 0.2517237967610087, 0.05077687131104928, 0.23039337235052934, -0.41824923617126986, -0.22614368306096183, 0.07452832249430102, 0.14616580461259812, 0.16532945185193396, -0.10285310860098015, -0.2945211324729601, 0.053516875936131754, -0.12897059320357074, -0.12878077306779456, -0.1421891914398064, -0.015173651919611258, -0.02360691916880334, -0.2658155594607083, 0.07199561905774439, 0.02599887372490955, 0.12259550152292208, -0.04943040126066111, -0.04303921930089049, 0.06474824165735718, 0.088898648855504, -0.02819004278823608, 0.09083029700134451, 0.21875168441329151, -0.13761029999540972, -0.13907445765236456, 0.3459042798455679, -0.09491526494796775, -0.1002475058482018, 0.15715655629271955, -0.16095691546797752, -0.0906695786044734, 0.15478845554655105, 0.14537439678711922, 0.13019916076956087, -0.14867501785936818, 0.07727075784219942, 0.05349053507847345, 0.22297136274721013, 0.02479565217881725, 0.12108457664399293, 0.21983564428833385, 0.19685615447684704, 0.08789208366239988, 0.15950466791335283, -0.16270441615991973, -0.0936310640549329, -0.2246147244645471, -0.1693331280265728, -0.18724689932325542, 0.06752583696349954, -0.11783760542459093, -0.11176593193595999, 0.4162631323168661, 0.23168035583005528, 0.15243942315658826, -0.052727123140357435, 0.3107079205553183, 0.10047307260808001, 0.05632535313789764, -0.019173659371170267, 0.2760788577326228, 0.20749924937001524, 0.13293769741901773, -0.3148255590715686, 0.00020470490072215541, -0.04640173009371783]
|
1,803.07177
|
Flat manifolds with homogeneous holonomy representation
|
We show that a rational holonomy representation of any flat manifold except
torus must have at least two non-equivalent irreducible subrepresentations. As
an application we show that if a K\"ahler flat manifold is not a torus then its
holonomy representation is reducible.
|
math.GR math.RT
|
we show that a rational holonomy representation of any flat manifold except torus must have at least two nonequivalent irreducible subrepresentations as an application we show that if a kahler flat manifold is not a torus then its holonomy representation is reducible
|
[['we', 'show', 'that', 'a', 'rational', 'holonomy', 'representation', 'of', 'any', 'flat', 'manifold', 'except', 'torus', 'must', 'have', 'at', 'least', 'two', 'nonequivalent', 'irreducible', 'subrepresentations', 'as', 'an', 'application', 'we', 'show', 'that', 'if', 'a', 'kahler', 'flat', 'manifold', 'is', 'not', 'a', 'torus', 'then', 'its', 'holonomy', 'representation', 'is', 'reducible']]
|
[-0.2236597700310605, 0.09740111705538029, -0.13837599675614565, 0.06886266323272139, -0.1707233217367459, -0.21383449878721011, -0.10196955748168486, 0.47459736962004434, -0.2429430933137025, -0.11359966705398013, 0.12651670872721643, -0.25864250574349645, -0.2199681697058536, 0.1415874691059192, -0.1334205826167904, -0.09415614847897641, 0.10224106096263443, 0.14728615935226635, -0.1652380106416309, -0.2904604550096251, 0.45266682512703393, -0.07870504903119235, 0.18395502617516155, 0.06596637333166741, 0.23263623847049616, -0.06662326541152738, 0.09690078629535578, 0.014800995832220429, -0.058162805548428356, 0.027916842483959738, 0.3023041926679157, 0.053872220196007264, 0.1726264842852418, -0.3550427897522847, -0.20843752775163876, 0.26893588102289606, 0.17590843047946692, 0.0518338278911653, 0.010234908444718235, -0.21809241149042333, 0.12056400139339357, -0.15123454871631803, -0.2062328357160801, -0.10769444437963623, 0.06808887803483576, -0.11771545157812181, -0.1519314186048827, -0.07126691210128012, 0.11915857506738532, 0.0688906472531103, -0.07066118808385606, -0.09755868917065007, -0.1666835621553695, 0.10709106650513907, -0.013850950613795291, 0.10202459361226786, 0.08924225612454825, -0.07338882738813049, -0.10676491217288588, 0.3762418283593087, -0.09593123916004385, -0.3476599524063723, 0.11093803467173573, -0.1499392582946235, -0.21465842620957465, 0.1667249626036556, 0.0575515048223592, 0.1279053712441098, -0.02055623404504288, 0.22832506430789917, -0.1589269558677361, 0.10749306005891412, 0.07933823096876343, -0.059022009350536836, 0.18094686802942306, 0.06888538142222733, 0.15001601105489368, 0.08384364488578978, 0.005756534015138944, -0.018118453056861956, -0.4077776152463186, -0.2094659014560637, -0.15816492551849, 0.2382956528208091, -0.14069903411325954, -0.20420743944123387, 0.38734407776168417, -0.033847076153116565, 0.2369181982108525, 0.12786643352176594, 0.2365596088625136, 0.04118992370231787, 0.025660042063377443, 0.1742304863097767, 0.1524157246486062, 0.13683965518361046, -0.1333941381335968, -0.0912718652592351, -0.09771207926262702, 0.16334851250229848]
|
1,803.07178
|
Solving Quadratic Programs to High Precision using Scaled Iterative
Refinement
|
Quadratic optimization problems (QPs) are ubiquitous, and solution algorithms
have matured to a reliable technology. However, the precision of solutions is
usually limited due to the underlying floating-point operations. This may cause
inconveniences when solutions are used for rigorous reasoning. We contribute on
three levels to overcome this issue. First, we present a novel refinement
algorithm to solve QPs to arbitrary precision. It iteratively solves refined
QPs, assuming a floating-point QP solver oracle. We prove linear convergence of
residuals and primal errors. Second, we provide an efficient implementation,
based on SoPlex and qpOASES that is publicly available in source code. Third,
we give precise reference solutions for the Maros and M\'esz\'aros benchmark
library.
|
math.OC
|
quadratic optimization problems qps are ubiquitous and solution algorithms have matured to a reliable technology however the precision of solutions is usually limited due to the underlying floatingpoint operations this may cause inconveniences when solutions are used for rigorous reasoning we contribute on three levels to overcome this issue first we present a novel refinement algorithm to solve qps to arbitrary precision it iteratively solves refined qps assuming a floatingpoint qp solver oracle we prove linear convergence of residuals and primal errors second we provide an efficient implementation based on soplex and qpoases that is publicly available in source code third we give precise reference solutions for the maros and meszaros benchmark library
|
[['quadratic', 'optimization', 'problems', 'qps', 'are', 'ubiquitous', 'and', 'solution', 'algorithms', 'have', 'matured', 'to', 'a', 'reliable', 'technology', 'however', 'the', 'precision', 'of', 'solutions', 'is', 'usually', 'limited', 'due', 'to', 'the', 'underlying', 'floatingpoint', 'operations', 'this', 'may', 'cause', 'inconveniences', 'when', 'solutions', 'are', 'used', 'for', 'rigorous', 'reasoning', 'we', 'contribute', 'on', 'three', 'levels', 'to', 'overcome', 'this', 'issue', 'first', 'we', 'present', 'a', 'novel', 'refinement', 'algorithm', 'to', 'solve', 'qps', 'to', 'arbitrary', 'precision', 'it', 'iteratively', 'solves', 'refined', 'qps', 'assuming', 'a', 'floatingpoint', 'qp', 'solver', 'oracle', 'we', 'prove', 'linear', 'convergence', 'of', 'residuals', 'and', 'primal', 'errors', 'second', 'we', 'provide', 'an', 'efficient', 'implementation', 'based', 'on', 'soplex', 'and', 'qpoases', 'that', 'is', 'publicly', 'available', 'in', 'source', 'code', 'third', 'we', 'give', 'precise', 'reference', 'solutions', 'for', 'the', 'maros', 'and', 'meszaros', 'benchmark', 'library']]
|
[-0.11770051964724969, -0.015312289770138574, -0.08113064749340992, 0.11514438852568024, -0.12208348097919952, -0.20082832693671143, 0.06586333479208406, 0.38519553295502973, -0.3077342880216228, -0.3455741696525365, 0.15854467187870927, -0.23503158789493941, -0.11322275114694744, 0.2464780612624184, -0.13861177290423907, 0.14145886807403127, 0.13680836754896777, -0.03944988400923778, -0.09131655371259383, -0.3061855178051961, 0.23178817601417126, 0.057921077245347466, 0.23811993749612675, 0.03552691026041949, 0.12017099203408829, -0.02937830450952918, -0.032830813303007744, 0.010822805883695505, -0.10197525012888166, 0.14375997222461073, 0.2996700022961574, 0.17298176857002545, 0.31584618883789517, -0.4543220744235441, -0.11789736912968303, 0.06690538146566334, 0.16263662376357907, 0.16104918307558233, -0.0619278677685153, -0.2144566345596104, 0.14310404114907474, -0.1375409163135503, -0.07956633249913077, -0.14630395873349958, -0.02488587346826015, 0.009273582284679702, -0.3054307716416328, 0.04476327133930421, 0.02009567423374392, 0.05674072598256836, -0.054844287700169456, -0.12106284728672888, 0.09700403935546222, 0.08028933581148781, 0.0020745823078738923, 0.04678479660859531, 0.05976810937344063, -0.08527440479208183, -0.14083645932467853, 0.3654369355645031, -0.013301395958738535, -0.21787938597013376, 0.15684888057668495, -0.022664899912862375, -0.17211195998658826, 0.13440487691799977, 0.21176656058430257, 0.1495799332291686, -0.14505750913628748, 0.09775924089938469, 0.012398209065265422, 0.21648726703798665, 0.03268723194404239, 0.01293646334670484, 0.1613820313047784, 0.15999316612474754, 0.10252069094193368, 0.13588352678094193, -0.029750123179318116, -0.08811715648750708, -0.27326569597166134, -0.1212285417381541, -0.15206760877793254, -0.013952249934456111, -0.05258539880690348, -0.1931602215793516, 0.34110978920112495, 0.22524855231936922, 0.1161074662408542, 0.0827322271247145, 0.3533646483057445, 0.15373468904207194, 0.06831844312020101, 0.1348142596876382, 0.19525650578725617, 0.09765009369584732, 0.09403906867269793, -0.19311333858708427, 0.06530166484299116, 0.11691792278517303]
|
1,803.07179
|
Attention-based Temporal Weighted Convolutional Neural Network for
Action Recognition
|
Research in human action recognition has accelerated significantly since the
introduction of powerful machine learning tools such as Convolutional Neural
Networks (CNNs). However, effective and efficient methods for incorporation of
temporal information into CNNs are still being actively explored in the recent
literature. Motivated by the popular recurrent attention models in the research
area of natural language processing, we propose the Attention-based Temporal
Weighted CNN (ATW), which embeds a visual attention model into a temporal
weighted multi-stream CNN. This attention model is simply implemented as
temporal weighting yet it effectively boosts the recognition performance of
video representations. Besides, each stream in the proposed ATW framework is
capable of end-to-end training, with both network parameters and temporal
weights optimized by stochastic gradient descent (SGD) with backpropagation.
Our experiments show that the proposed attention mechanism contributes
substantially to the performance gains with the more discriminative snippets by
focusing on more relevant video segments.
|
cs.CV
|
research in human action recognition has accelerated significantly since the introduction of powerful machine learning tools such as convolutional neural networks cnns however effective and efficient methods for incorporation of temporal information into cnns are still being actively explored in the recent literature motivated by the popular recurrent attention models in the research area of natural language processing we propose the attentionbased temporal weighted cnn atw which embeds a visual attention model into a temporal weighted multistream cnn this attention model is simply implemented as temporal weighting yet it effectively boosts the recognition performance of video representations besides each stream in the proposed atw framework is capable of endtoend training with both network parameters and temporal weights optimized by stochastic gradient descent sgd with backpropagation our experiments show that the proposed attention mechanism contributes substantially to the performance gains with the more discriminative snippets by focusing on more relevant video segments
|
[['research', 'in', 'human', 'action', 'recognition', 'has', 'accelerated', 'significantly', 'since', 'the', 'introduction', 'of', 'powerful', 'machine', 'learning', 'tools', 'such', 'as', 'convolutional', 'neural', 'networks', 'cnns', 'however', 'effective', 'and', 'efficient', 'methods', 'for', 'incorporation', 'of', 'temporal', 'information', 'into', 'cnns', 'are', 'still', 'being', 'actively', 'explored', 'in', 'the', 'recent', 'literature', 'motivated', 'by', 'the', 'popular', 'recurrent', 'attention', 'models', 'in', 'the', 'research', 'area', 'of', 'natural', 'language', 'processing', 'we', 'propose', 'the', 'attentionbased', 'temporal', 'weighted', 'cnn', 'atw', 'which', 'embeds', 'a', 'visual', 'attention', 'model', 'into', 'a', 'temporal', 'weighted', 'multistream', 'cnn', 'this', 'attention', 'model', 'is', 'simply', 'implemented', 'as', 'temporal', 'weighting', 'yet', 'it', 'effectively', 'boosts', 'the', 'recognition', 'performance', 'of', 'video', 'representations', 'besides', 'each', 'stream', 'in', 'the', 'proposed', 'atw', 'framework', 'is', 'capable', 'of', 'endtoend', 'training', 'with', 'both', 'network', 'parameters', 'and', 'temporal', 'weights', 'optimized', 'by', 'stochastic', 'gradient', 'descent', 'sgd', 'with', 'backpropagation', 'our', 'experiments', 'show', 'that', 'the', 'proposed', 'attention', 'mechanism', 'contributes', 'substantially', 'to', 'the', 'performance', 'gains', 'with', 'the', 'more', 'discriminative', 'snippets', 'by', 'focusing', 'on', 'more', 'relevant', 'video', 'segments']]
|
[-0.033057813473093625, 0.017777799844544456, -0.04329953409904084, 0.0896099856723137, -0.13439061550041106, -0.22458686481001755, -0.02697462959767054, 0.5116067905447735, -0.2887360728068265, -0.2950099544809354, 0.03918773655946187, -0.22818313955039476, -0.24296247445984392, 0.18356132875227474, -0.16055682680526415, 0.10086024442181879, 0.162452969188179, 0.08511502004617097, -0.0499786769623162, -0.3216593620607888, 0.24284897444597045, 0.10243399255286088, 0.3882573418294554, -0.006889278651986098, 0.15057227197731538, -0.031217820726532414, -0.06655469426109659, -0.02139105951021863, -0.02156933298010097, 0.24070385699769456, 0.30549945761342184, 0.21538030259027485, 0.386146729977012, -0.43885820980078927, -0.3253048637123248, 0.07296581679819436, 0.18921287686217866, 0.08191039141449485, -0.06843643505546412, -0.36367203883012594, 0.08628968023139959, -0.1804701578895876, 0.08732174736577154, -0.1447060492756277, 0.00394346167191567, -0.022309680960437173, -0.25441118633368404, -0.0006291344725227736, 0.1323767656981575, 0.05007732381106706, -0.019145731579254855, -0.0881443526676782, 0.008308904916233081, 0.13381704293647842, 0.060141537776401896, 0.08919786097904334, 0.14550967293402908, -0.20854486430538757, -0.1227884664453122, 0.34388703802933557, -0.053577530233263476, -0.23371039497487198, 0.14202377829848734, 0.02481251984174727, -0.15927111590126936, 0.10617108783370119, 0.25030361089411357, 0.10968771516129572, -0.18520478171524624, 0.01750546959244233, -0.018808762842036832, 0.16667338236179574, 0.043943031896090765, 0.01787967003252826, 0.2018361112861493, 0.31760527501314484, 0.010749643535926839, 0.14596574022342138, -0.11137399592880924, -0.11681103630188779, -0.15078789484841343, -0.04478493568468962, -0.15633470685042392, -0.05832145415440769, -0.12310343932970241, -0.09609247491516124, 0.4518703633043545, 0.21105184328945858, 0.21095277552203034, 0.14270861030614854, 0.38300848544408744, 0.01708249986712938, 0.20298854990466036, 0.11317398253248523, 0.17377167961572526, 0.02338616757049219, 0.1837723589546991, -0.17177107370773095, 0.0994316862891459, 0.11892187382119233]
|
1,803.0718
|
Probabilistic Occupancy Function and Sets Using Forward Stochastic
Reachability for Rigid-Body Dynamic Obstacles
|
We present theory and algorithms for the computation of probability-weighted
"keep-out" sets to assure probabilistically safe navigation in the presence of
multiple rigid body obstacles with stochastic dynamics. Our forward stochastic
reachability-based approach characterizes the stochasticity of the future
obstacle states in a grid-free and recursion-free manner, using Fourier
transforms and computational geometry. We consider discrete-time Markovian
switched systems with affine parameter-varying stochastic subsystems (DMSP) as
the obstacle dynamics, which includes Markov jump affine systems and
discrete-time affine parameter-varying stochastic systems (DPV). We define a
probabilistic occupancy function, to describe the probability that a given
state is occupied by a rigid body obstacle with stochastic dynamics at a given
time; keep-out sets are the super-level sets of this occupancy function. We
provide sufficient conditions that ensure convexity and compactness of these
keep-out sets for DPV obstacle dynamics. We also propose two computationally
efficient algorithms to overapproximate the keep-out sets --- a tight polytopic
approximation using projections, and an overapproximation using Minkowski sum.
For DMSP obstacle dynamics, we compute a union of convex and compact sets that
covers the potentially non-convex keep-out set. Numerical simulations show the
efficacy of the proposed algorithms for a modified version of the classical
unicycle dynamics, modeled as a DMSP.
|
cs.SY math.OC
|
we present theory and algorithms for the computation of probabilityweighted keepout sets to assure probabilistically safe navigation in the presence of multiple rigid body obstacles with stochastic dynamics our forward stochastic reachabilitybased approach characterizes the stochasticity of the future obstacle states in a gridfree and recursionfree manner using fourier transforms and computational geometry we consider discretetime markovian switched systems with affine parametervarying stochastic subsystems dmsp as the obstacle dynamics which includes markov jump affine systems and discretetime affine parametervarying stochastic systems dpv we define a probabilistic occupancy function to describe the probability that a given state is occupied by a rigid body obstacle with stochastic dynamics at a given time keepout sets are the superlevel sets of this occupancy function we provide sufficient conditions that ensure convexity and compactness of these keepout sets for dpv obstacle dynamics we also propose two computationally efficient algorithms to overapproximate the keepout sets a tight polytopic approximation using projections and an overapproximation using minkowski sum for dmsp obstacle dynamics we compute a union of convex and compact sets that covers the potentially nonconvex keepout set numerical simulations show the efficacy of the proposed algorithms for a modified version of the classical unicycle dynamics modeled as a dmsp
|
[['we', 'present', 'theory', 'and', 'algorithms', 'for', 'the', 'computation', 'of', 'probabilityweighted', 'keepout', 'sets', 'to', 'assure', 'probabilistically', 'safe', 'navigation', 'in', 'the', 'presence', 'of', 'multiple', 'rigid', 'body', 'obstacles', 'with', 'stochastic', 'dynamics', 'our', 'forward', 'stochastic', 'reachabilitybased', 'approach', 'characterizes', 'the', 'stochasticity', 'of', 'the', 'future', 'obstacle', 'states', 'in', 'a', 'gridfree', 'and', 'recursionfree', 'manner', 'using', 'fourier', 'transforms', 'and', 'computational', 'geometry', 'we', 'consider', 'discretetime', 'markovian', 'switched', 'systems', 'with', 'affine', 'parametervarying', 'stochastic', 'subsystems', 'dmsp', 'as', 'the', 'obstacle', 'dynamics', 'which', 'includes', 'markov', 'jump', 'affine', 'systems', 'and', 'discretetime', 'affine', 'parametervarying', 'stochastic', 'systems', 'dpv', 'we', 'define', 'a', 'probabilistic', 'occupancy', 'function', 'to', 'describe', 'the', 'probability', 'that', 'a', 'given', 'state', 'is', 'occupied', 'by', 'a', 'rigid', 'body', 'obstacle', 'with', 'stochastic', 'dynamics', 'at', 'a', 'given', 'time', 'keepout', 'sets', 'are', 'the', 'superlevel', 'sets', 'of', 'this', 'occupancy', 'function', 'we', 'provide', 'sufficient', 'conditions', 'that', 'ensure', 'convexity', 'and', 'compactness', 'of', 'these', 'keepout', 'sets', 'for', 'dpv', 'obstacle', 'dynamics', 'we', 'also', 'propose', 'two', 'computationally', 'efficient', 'algorithms', 'to', 'overapproximate', 'the', 'keepout', 'sets', 'a', 'tight', 'polytopic', 'approximation', 'using', 'projections', 'and', 'an', 'overapproximation', 'using', 'minkowski', 'sum', 'for', 'dmsp', 'obstacle', 'dynamics', 'we', 'compute', 'a', 'union', 'of', 'convex', 'and', 'compact', 'sets', 'that', 'covers', 'the', 'potentially', 'nonconvex', 'keepout', 'set', 'numerical', 'simulations', 'show', 'the', 'efficacy', 'of', 'the', 'proposed', 'algorithms', 'for', 'a', 'modified', 'version', 'of', 'the', 'classical', 'unicycle', 'dynamics', 'modeled', 'as', 'a', 'dmsp']]
|
[-0.14590836272074892, 0.04596023008594659, -0.08532578032005009, 0.08278885717973833, -0.040004143955901704, -0.12465847624245609, 0.053422691349256694, 0.35289977708363474, -0.32372493898780474, -0.2191061054246289, 0.14005125652060482, -0.2310453659230889, -0.16281528457118372, 0.188835768428232, -0.11190678899992473, 0.12616176452726272, 0.08353907377527926, -0.022036662670351297, -0.043484895572690245, -0.22114366382501532, 0.2975766281528499, -0.02238288819170534, 0.2188650932887872, -0.02015648436333452, 0.18646925789868377, 0.06411818192418427, 0.014425640033868835, 0.05857022326173527, -0.1309754982573973, 0.1311577826740078, 0.26293723691103454, 0.17282466153875728, 0.30021998929226856, -0.4388736734955842, -0.17856355968936177, 0.12882945374493932, 0.1078169172544553, 0.08154699480186303, -0.03013001694550435, -0.30042762735060285, 0.042612613880435656, -0.14255825219345578, -0.1477651979700832, -0.0962955422304901, 0.01564868104189928, 0.07051396739481045, -0.29805411043659474, 0.04500625157838325, 0.05423149538801047, 0.03638132879042567, -0.08362909445075749, -0.07258678102186822, 0.0044756762343894675, 0.08097751955490266, -0.05071990386860473, 0.0155550532497172, 0.13349812845596265, -0.04189912514563815, -0.17459502094310567, 0.3485405265716056, -0.03587744485878207, -0.28618410348048057, 0.1933925948587471, -0.10508194507350296, -0.14733594154315116, 0.12682443610068497, 0.20380548375837615, 0.13105754558859495, -0.1648985043792008, 0.1152062886999576, -0.04552469721174079, 0.11386336352254076, 0.02913625810978925, 0.01392651067844826, 0.15640282164699984, 0.19411167239522553, 0.15387505912933078, 0.1783780835607901, -0.046566570362906554, -0.16052885037466078, -0.3143093889293013, -0.0940835806311755, -0.15813048767141558, 0.02616125459925001, -0.10332582821890889, -0.19903424044089219, 0.32231958819268813, 0.11240058477705327, 0.16445851271623388, 0.15676436771517116, 0.3048266653083907, 0.12807705583088982, -0.024736298885301967, 0.11690684646056057, 0.14671213191668986, 0.13311666138171965, 0.04579935387164593, -0.21595363891935848, 0.06357546112548303, 0.11511493320209823]
|
1,803.07181
|
Partially ordering the class of invertible trees
|
A tree T is invertible if and only if T has a perfect matching. Godsil
considers an invertible tree T and finds that the inverse of the adjacency
matrix of T has entries in {0, 1, -1} and is the signed adjacency matrix of a
graph which contains T. In this paper, we give a new proof of this theorem,
which gives rise to a partial ordering relation on the class of all invertible
trees on 2n vertices. In particular, we show that given an invertible tree T
whose inverse graph has strictly more edges, we can remove an edge from T and
add another edge to obtain an invertible tree T' whose median eigenvalue is
strictly greater. This extends naturally to a partial ordering. We characterize
the maximal and minimal elements of this poset and explore the implications
about the median eigenvalues of invertible trees.
|
math.CO
|
a tree t is invertible if and only if t has a perfect matching godsil considers an invertible tree t and finds that the inverse of the adjacency matrix of t has entries in 0 1 1 and is the signed adjacency matrix of a graph which contains t in this paper we give a new proof of this theorem which gives rise to a partial ordering relation on the class of all invertible trees on 2n vertices in particular we show that given an invertible tree t whose inverse graph has strictly more edges we can remove an edge from t and add another edge to obtain an invertible tree t whose median eigenvalue is strictly greater this extends naturally to a partial ordering we characterize the maximal and minimal elements of this poset and explore the implications about the median eigenvalues of invertible trees
|
[['a', 'tree', 't', 'is', 'invertible', 'if', 'and', 'only', 'if', 't', 'has', 'a', 'perfect', 'matching', 'godsil', 'considers', 'an', 'invertible', 'tree', 't', 'and', 'finds', 'that', 'the', 'inverse', 'of', 'the', 'adjacency', 'matrix', 'of', 't', 'has', 'entries', 'in', '0', '1', '1', 'and', 'is', 'the', 'signed', 'adjacency', 'matrix', 'of', 'a', 'graph', 'which', 'contains', 't', 'in', 'this', 'paper', 'we', 'give', 'a', 'new', 'proof', 'of', 'this', 'theorem', 'which', 'gives', 'rise', 'to', 'a', 'partial', 'ordering', 'relation', 'on', 'the', 'class', 'of', 'all', 'invertible', 'trees', 'on', '2n', 'vertices', 'in', 'particular', 'we', 'show', 'that', 'given', 'an', 'invertible', 'tree', 't', 'whose', 'inverse', 'graph', 'has', 'strictly', 'more', 'edges', 'we', 'can', 'remove', 'an', 'edge', 'from', 't', 'and', 'add', 'another', 'edge', 'to', 'obtain', 'an', 'invertible', 'tree', 't', 'whose', 'median', 'eigenvalue', 'is', 'strictly', 'greater', 'this', 'extends', 'naturally', 'to', 'a', 'partial', 'ordering', 'we', 'characterize', 'the', 'maximal', 'and', 'minimal', 'elements', 'of', 'this', 'poset', 'and', 'explore', 'the', 'implications', 'about', 'the', 'median', 'eigenvalues', 'of', 'invertible', 'trees']]
|
[-0.14740429650465894, 0.1597378454729277, -0.03879646091300943, 0.031729864466087, -0.11325215720826734, -0.1405533050068922, 0.06741609427462371, 0.36354336898920625, -0.33474472711143427, -0.23202223698162053, 0.09179371112099632, -0.32885553948070906, -0.16403998298832048, 0.060056124558697827, -0.0959902497563409, -0.001413235211209075, 0.05942746050247591, 0.1689978340155866, -0.08172492370366642, -0.2331122964949902, 0.3287713213581337, -0.009246807928158813, 0.15500781286271825, 0.07629934797854457, 0.14725223121118464, 0.03703949507804307, -0.055490306626418476, 0.02736244521626871, -0.14188442822940064, 0.07950805017584298, 0.24860636877814588, 0.1569070579254464, 0.21844835269379698, -0.3407899132253577, -0.12729368648533262, 0.22720276032357592, 0.14309412553230275, 0.030367549003280495, 0.0025963034852183016, -0.19447568985187028, 0.19507947712903442, -0.13274320063168463, -0.08427219728824414, -0.0001297480337423821, 0.11961697251217006, -0.06469686392516102, -0.33459492821297415, 0.008845056040365605, 0.18812836204617195, 0.0483323887902733, 0.04124541498707888, -0.17576125653282013, -0.03215200277938418, 0.08137040772181872, -0.05879057047104029, 0.05696618291055018, 0.030244338600449776, -0.06820797862477875, -0.1379534706269225, 0.3241145340279255, -0.04960217782972406, -0.17271474179212157, 0.12800141052687414, -0.1526907033108379, -0.15145835956265155, 0.10776783879017075, 0.10585257552615175, 0.15003601331518937, -0.112040662563929, 0.17978987142791308, -0.14314697769610848, 0.15627294500702865, 0.10936588357036857, -0.017615897974082306, 0.13186979976367869, 0.12467948758930018, 0.19810468848628845, 0.16066664967634905, 0.010382165328586756, 0.0045912210695598634, -0.2999850561625439, -0.15985993828866885, -0.1902252869490751, 0.1070373635579615, -0.1543861456669481, -0.23659421729357683, 0.4189232305355676, 0.13674468189886171, 0.26751722799843713, 0.12866711326434646, 0.19908150056479115, 0.12394841048190344, 0.046985301906753284, 0.12021335478782756, 0.08194507010702094, 0.20774432024216816, 0.024356763886466418, -0.16089084811910528, 0.06669252862107672, 0.1534184108054495]
|
1,803.07182
|
High Helicity Vortex Conversion in a Rubidium Vapor
|
The orbital angular momentum (OAM) of light is a quantity explored for
communication and quantum technology, its key strength being a wide set of
values offering a large basis for q-working. In this context we have studied
the vortex conversion from a red optical vortex to a blue one, for OAMs ranging
-30 to +30. The conversion is realized in a rubidium vapor, via the
$5S_{1/2}-5D_{5/2}$ $^{85} Rb$ two-photon transition done with a Gaussian beam
at 780 nm plus a Laguerre-Gaussian beam at 776 nm with the OAM $\ell$,
producing a radiation at 420 nm. With co-propagating input beams, we
demonstrate a conversion from red to blue for high-$\ell$ input vortices. We
show that the output blue vortex respects the azimuthal phase matching, has a
size determined by the product of the input beams and a power decreasing with
$\ell$ in agreement with their overlap. Its propagation indicates that the
generated blue wave is a nearly pure Laguerre-Gaussian mode. The vortex
converter thus permits a correct OAM transmission.
|
quant-ph
|
the orbital angular momentum oam of light is a quantity explored for communication and quantum technology its key strength being a wide set of values offering a large basis for qworking in this context we have studied the vortex conversion from a red optical vortex to a blue one for oams ranging 30 to 30 the conversion is realized in a rubidium vapor via the 5s_125d_52 85 rb twophoton transition done with a gaussian beam at 780 nm plus a laguerregaussian beam at 776 nm with the oam ell producing a radiation at 420 nm with copropagating input beams we demonstrate a conversion from red to blue for highell input vortices we show that the output blue vortex respects the azimuthal phase matching has a size determined by the product of the input beams and a power decreasing with ell in agreement with their overlap its propagation indicates that the generated blue wave is a nearly pure laguerregaussian mode the vortex converter thus permits a correct oam transmission
|
[['the', 'orbital', 'angular', 'momentum', 'oam', 'of', 'light', 'is', 'a', 'quantity', 'explored', 'for', 'communication', 'and', 'quantum', 'technology', 'its', 'key', 'strength', 'being', 'a', 'wide', 'set', 'of', 'values', 'offering', 'a', 'large', 'basis', 'for', 'qworking', 'in', 'this', 'context', 'we', 'have', 'studied', 'the', 'vortex', 'conversion', 'from', 'a', 'red', 'optical', 'vortex', 'to', 'a', 'blue', 'one', 'for', 'oams', 'ranging', '30', 'to', '30', 'the', 'conversion', 'is', 'realized', 'in', 'a', 'rubidium', 'vapor', 'via', 'the', '5s_125d_52', '85', 'rb', 'twophoton', 'transition', 'done', 'with', 'a', 'gaussian', 'beam', 'at', '780', 'nm', 'plus', 'a', 'laguerregaussian', 'beam', 'at', '776', 'nm', 'with', 'the', 'oam', 'ell', 'producing', 'a', 'radiation', 'at', '420', 'nm', 'with', 'copropagating', 'input', 'beams', 'we', 'demonstrate', 'a', 'conversion', 'from', 'red', 'to', 'blue', 'for', 'highell', 'input', 'vortices', 'we', 'show', 'that', 'the', 'output', 'blue', 'vortex', 'respects', 'the', 'azimuthal', 'phase', 'matching', 'has', 'a', 'size', 'determined', 'by', 'the', 'product', 'of', 'the', 'input', 'beams', 'and', 'a', 'power', 'decreasing', 'with', 'ell', 'in', 'agreement', 'with', 'their', 'overlap', 'its', 'propagation', 'indicates', 'that', 'the', 'generated', 'blue', 'wave', 'is', 'a', 'nearly', 'pure', 'laguerregaussian', 'mode', 'the', 'vortex', 'converter', 'thus', 'permits', 'a', 'correct', 'oam', 'transmission']]
|
[-0.13500595494195908, 0.23067123982887042, -0.07839393503234598, -0.025663159698765467, -0.019128567973959697, -0.13228905308817748, 0.06771476237742927, 0.4357356654665242, -0.22420040587614098, -0.29313980927690864, 0.0001823195397954838, -0.2753165720215808, -0.002632166888755578, 0.20326126139913966, 0.004163627097585115, 0.06161263138934176, 0.04447266864955021, -0.024993515197546726, -0.018881596448124354, -0.13281956063827194, 0.241968103380122, 0.04136143609844933, 0.3195136738071465, -0.01612971110145999, 0.13158148992245636, -0.01668724734959854, 0.0016166385223230638, -0.07741361539754792, -0.11132420004664216, 0.06902665463809193, 0.1977309456925435, 0.06269388502261725, 0.2556594244978694, -0.3554015723000987, -0.17966984366683894, 0.0753857021967611, 0.17022967537169356, 0.13713483036080576, -0.07890253426950335, -0.2396277038966788, 0.0491858841767198, -0.14776278542374338, -0.1542934330056859, -0.003644733325050897, 0.044936413136142564, 0.002252165250569941, -0.3173428799645661, 0.0018189520947144266, 0.011395767185253551, 0.08473003333916955, 0.012515831266036144, -0.11486733615600381, -0.08652126069141394, 0.016073890720460428, -0.046468407643611084, 0.0853606544439232, 0.13371502238477254, -0.1303714258794067, -0.09106661157166383, 0.40760865313820094, -0.08233436615576586, -0.1231548331349356, 0.11058020533948958, -0.18234512004885592, 0.004855099611029208, 0.2153630663012435, 0.1319800202365886, 0.08523233354523643, -0.04269441046207829, -0.022166193867556704, -0.03567639634520564, 0.22893695612662437, 0.20796330369088845, 0.1293516784330184, 0.2798382173550416, 0.1543709428094507, 0.0149512807291607, 0.17097675430038609, -0.18119041200608704, -0.05130487504058955, -0.24898656256951346, -0.1193640261442479, -0.18809937850024455, 0.06011077155615414, -0.07701285297302837, -0.09756681542136673, 0.42089325860591537, 0.06784431462832559, 0.2011700130792907, -0.011020185060501772, 0.3609861376700945, 0.124656318877743, 0.09742616944671441, 0.0393292537121753, 0.2821386479912887, 0.18859037681320032, 0.1636519194440355, -0.24271603854350657, -0.028306450080463147, -0.043294323857941006]
|
1,803.07183
|
Equation of State Model for the $\gamma-\alpha$ Transition in Ce
|
The element Ce exhibits an isostructural $\gamma-\alpha$ phase transition
with a 15\% volume change at room temperature. The phase boundary ends in a
critical point at 1.5 GPa and 480 K. We describe a model for the equation of
state of Ce in the $\gamma-\alpha$ transition region. The model is based on the
idea, supported by modern many-body calculations, of a continuously varying
degree of localization of the $4f$ electrons as a function of compression. The
functional forms used are motivated by many-body calculations, with parameters
determined by experiments, resulting in a physics-based empirical EOS. In the
large-volume $\gamma$ phase, degeneracy of the $j = 5/2$ state of the localized
$4f$ electron makes a large contribution to the entropy. Rapid variation of the
thermal electronic free energy with volume leads to unusually large electronic
contributions to the pressure and thermodynamic Gr\"{u}neisen parameter. The
static lattice energy has two local minima, with the $\alpha$-like minimum
lower than the $\gamma$-like one by 6.3 meV/atom.
|
cond-mat.mtrl-sci
|
the element ce exhibits an isostructural gammaalpha phase transition with a 15 volume change at room temperature the phase boundary ends in a critical point at 15 gpa and 480 k we describe a model for the equation of state of ce in the gammaalpha transition region the model is based on the idea supported by modern manybody calculations of a continuously varying degree of localization of the 4f electrons as a function of compression the functional forms used are motivated by manybody calculations with parameters determined by experiments resulting in a physicsbased empirical eos in the largevolume gamma phase degeneracy of the j 52 state of the localized 4f electron makes a large contribution to the entropy rapid variation of the thermal electronic free energy with volume leads to unusually large electronic contributions to the pressure and thermodynamic gruneisen parameter the static lattice energy has two local minima with the alphalike minimum lower than the gammalike one by 63 mevatom
|
[['the', 'element', 'ce', 'exhibits', 'an', 'isostructural', 'gammaalpha', 'phase', 'transition', 'with', 'a', '15', 'volume', 'change', 'at', 'room', 'temperature', 'the', 'phase', 'boundary', 'ends', 'in', 'a', 'critical', 'point', 'at', '15', 'gpa', 'and', '480', 'k', 'we', 'describe', 'a', 'model', 'for', 'the', 'equation', 'of', 'state', 'of', 'ce', 'in', 'the', 'gammaalpha', 'transition', 'region', 'the', 'model', 'is', 'based', 'on', 'the', 'idea', 'supported', 'by', 'modern', 'manybody', 'calculations', 'of', 'a', 'continuously', 'varying', 'degree', 'of', 'localization', 'of', 'the', '4f', 'electrons', 'as', 'a', 'function', 'of', 'compression', 'the', 'functional', 'forms', 'used', 'are', 'motivated', 'by', 'manybody', 'calculations', 'with', 'parameters', 'determined', 'by', 'experiments', 'resulting', 'in', 'a', 'physicsbased', 'empirical', 'eos', 'in', 'the', 'largevolume', 'gamma', 'phase', 'degeneracy', 'of', 'the', 'j', '52', 'state', 'of', 'the', 'localized', '4f', 'electron', 'makes', 'a', 'large', 'contribution', 'to', 'the', 'entropy', 'rapid', 'variation', 'of', 'the', 'thermal', 'electronic', 'free', 'energy', 'with', 'volume', 'leads', 'to', 'unusually', 'large', 'electronic', 'contributions', 'to', 'the', 'pressure', 'and', 'thermodynamic', 'gruneisen', 'parameter', 'the', 'static', 'lattice', 'energy', 'has', 'two', 'local', 'minima', 'with', 'the', 'alphalike', 'minimum', 'lower', 'than', 'the', 'gammalike', 'one', 'by', '63', 'mevatom']]
|
[-0.13519347214551428, 0.22278727231605444, -0.06906423327854332, 0.016221434685621434, 0.011706285574907287, -0.09911090057771306, 0.12682215458719256, 0.31028137918162557, -0.24396782125142455, -0.3134419981719961, 0.029235707964713437, -0.34105558583501333, -0.07196944324669909, 0.13292806782406866, 0.048948583156788746, 0.043040737422958296, 0.0029158634968338426, 0.03812043478434778, -0.1367171267799524, -0.17560473378886532, 0.3065732347183161, 0.0821588117056613, 0.2684442872257096, 0.08460096459292014, 0.056993224291291424, -0.024106696340608302, 0.06748165302441357, 0.014982990021036464, -0.1713095073478285, 0.06870077185691421, 0.24420022127444144, -0.0007224276181750046, 0.2464478084187006, -0.39666862150665766, -0.21191593393775987, 0.04888440502193968, 0.06002515472865068, 0.08775547621135386, -0.04360730497105776, -0.23961959215262846, 0.055601480237630584, -0.1622663832564082, -0.14140220644727627, -0.07599244989246501, -0.006618250786147503, -0.005458770672680798, -0.25317554357490557, 0.13007100582302125, 0.005805396093113452, 0.08309757919692484, -0.1129515167551335, -0.14464727507742203, -0.0633392954105656, 0.04058108207703169, 0.023921641596355795, 0.09060092507832632, 0.1516008434487472, -0.09674457608727935, -0.06629359620328275, 0.38892139774972795, -0.07258424341509781, -0.08413233289618757, 0.17895923101817554, -0.16363125373913057, -0.07653904728799688, 0.22452012964478052, 0.09408491291394978, 0.07534251601586367, -0.1029161080377833, 0.11221325437911434, 0.049279006956555876, 0.2087740876723836, 0.017964204259922508, 0.012856268931342207, 0.1988350637813868, 0.16325495136422336, 0.041025118526325836, 0.1379508804725136, -0.1289144908005707, -0.10609610269991507, -0.2499275058276535, -0.1491917748154598, -0.22487210754814171, 0.04817269406402889, -0.13274184711294115, -0.19611844230697761, 0.4117310146905297, 0.09549939039926861, 0.2153649300319484, -0.048763870850193854, 0.23484778103580617, 0.12279328363347417, 0.03801829777571217, 0.07519498619002214, 0.24747188859590277, 0.150388618692559, 0.1071751354557248, -0.28218477191866276, 0.048998860552652464, 0.07625176155974406]
|
1,803.07184
|
Adaptive Smoothing for Trajectory Reconstruction
|
Trajectory reconstruction is the process of inferring the path of a moving
object between successive observations. In this paper, we propose a smoothing
spline -- which we name the V-spline -- that incorporates position and velocity
information and a penalty term that controls acceleration. We introduce a
particular adaptive V-spline designed to control the impact of irregularly
sampled observations and noisy velocity measurements. A cross-validation scheme
for estimating the V-spline parameters is given and we detail the performance
of the V-spline on four particularly challenging test datasets. Finally, an
application of the V-spline to vehicle trajectory reconstruction in two
dimensions is given, in which the penalty term is allowed to further depend on
known operational characteristics of the vehicle.
|
stat.ME
|
trajectory reconstruction is the process of inferring the path of a moving object between successive observations in this paper we propose a smoothing spline which we name the vspline that incorporates position and velocity information and a penalty term that controls acceleration we introduce a particular adaptive vspline designed to control the impact of irregularly sampled observations and noisy velocity measurements a crossvalidation scheme for estimating the vspline parameters is given and we detail the performance of the vspline on four particularly challenging test datasets finally an application of the vspline to vehicle trajectory reconstruction in two dimensions is given in which the penalty term is allowed to further depend on known operational characteristics of the vehicle
|
[['trajectory', 'reconstruction', 'is', 'the', 'process', 'of', 'inferring', 'the', 'path', 'of', 'a', 'moving', 'object', 'between', 'successive', 'observations', 'in', 'this', 'paper', 'we', 'propose', 'a', 'smoothing', 'spline', 'which', 'we', 'name', 'the', 'vspline', 'that', 'incorporates', 'position', 'and', 'velocity', 'information', 'and', 'a', 'penalty', 'term', 'that', 'controls', 'acceleration', 'we', 'introduce', 'a', 'particular', 'adaptive', 'vspline', 'designed', 'to', 'control', 'the', 'impact', 'of', 'irregularly', 'sampled', 'observations', 'and', 'noisy', 'velocity', 'measurements', 'a', 'crossvalidation', 'scheme', 'for', 'estimating', 'the', 'vspline', 'parameters', 'is', 'given', 'and', 'we', 'detail', 'the', 'performance', 'of', 'the', 'vspline', 'on', 'four', 'particularly', 'challenging', 'test', 'datasets', 'finally', 'an', 'application', 'of', 'the', 'vspline', 'to', 'vehicle', 'trajectory', 'reconstruction', 'in', 'two', 'dimensions', 'is', 'given', 'in', 'which', 'the', 'penalty', 'term', 'is', 'allowed', 'to', 'further', 'depend', 'on', 'known', 'operational', 'characteristics', 'of', 'the', 'vehicle']]
|
[-0.13276201228881812, 0.04768580911816874, -0.09958058925998262, 0.03781133757476134, -0.11296152233536172, -0.14874040669339716, 0.05012012227477195, 0.42223398976473725, -0.2706080711582023, -0.30834304358268905, 0.14005336018864256, -0.22481803762384206, -0.1600804699616682, 0.18343939087711847, -0.14413872245165846, 0.06922407447296776, 0.09712244753136785, 0.039539555020025395, -0.0799996864854589, -0.24575508853348976, 0.29896436114676106, 0.07837207010413846, 0.2538208435747263, 0.010775866380964335, 0.19202535815186736, 0.02092869044878544, -0.0539418096618297, 0.0217887236076033, -0.13970506496980695, 0.13167146716314632, 0.20403073192176083, 0.1446605463130161, 0.30191266322588056, -0.36306520192247105, -0.20754881606150705, 0.08660955619739576, 0.11788448706492145, 0.08270099395838801, -0.044517771223496296, -0.27855621996279967, 0.030973978356545806, -0.13747869950965938, -0.08139203025901721, -0.04630311294538407, -0.005072774473004616, 0.020714935878466848, -0.3409764119782127, 0.0600497346275892, 0.014357443683995651, 0.04605062320255316, -0.08695867509605029, -0.06838388148591751, 0.020685168142374765, 0.1589008690839092, 0.05133063816559963, 0.026939359484598614, 0.12360084687287991, -0.12964735529385507, -0.0829579730430602, 0.3644821616824971, -0.04259213296802014, -0.2525831178829679, 0.15475218999796572, -0.09652029319753887, -0.11796604896075705, 0.08824332345786512, 0.22117199428761616, 0.13805964118681657, -0.16422299552772546, 0.02700685444447156, -0.020619154788362674, 0.16504345905099416, 0.049270532643183686, -0.00827187230476202, 0.12092215959640652, 0.2030740424684193, 0.10391367804487912, 0.13509877447763252, -0.2376951237814103, -0.09147047760506344, -0.31696990085367716, -0.1310233138800145, -0.19098765396664286, -0.046602844624804, -0.10452127636312786, -0.17087319158972838, 0.4196615733245015, 0.2041075924067145, 0.20457546872636065, 0.05423341304835919, 0.3398919161249939, 0.09173389407109596, 0.02910700785075752, 0.0792031866701272, 0.18917899205285704, 0.055529400738131285, 0.07180048467623246, -0.23066625481423658, 0.10045836328799462, 0.05803450740650933]
|
1,803.07185
|
Tree Drawings Revisited
|
We make progress on a number of open problems concerning the area requirement
for drawing trees on a grid. We prove that
1. every tree of size $n$ (with arbitrarily large degree) has a straight-line
drawing with area $n2^{O(\sqrt{\log\log n\log\log\log n})}$, improving the
longstanding $O(n\log n)$ bound;
2. every tree of size $n$ (with arbitrarily large degree) has a straight-line
upward drawing with area $n\sqrt{\log n}(\log\log n)^{O(1)}$, improving the
longstanding $O(n\log n)$ bound;
3. every binary tree of size $n$ has a straight-line orthogonal drawing with
area $n2^{O(\log^*n)}$, improving the previous $O(n\log\log n)$ bound by Shin,
Kim, and Chwa (1996) and Chan, Goodrich, Kosaraju, and Tamassia (1996);
4. every binary tree of size $n$ has a straight-line order-preserving drawing
with area $n2^{O(\log^*n)}$, improving the previous $O(n\log\log n)$ bound by
Garg and Rusu (2003);
5. every binary tree of size $n$ has a straight-line orthogonal
order-preserving drawing with area $n2^{O(\sqrt{\log n})}$, improving the
$O(n^{3/2})$ previous bound by Frati (2007).
|
cs.CG
|
we make progress on a number of open problems concerning the area requirement for drawing trees on a grid we prove that 1 every tree of size n with arbitrarily large degree has a straightline drawing with area n2osqrtloglog nlogloglog n improving the longstanding onlog n bound 2 every tree of size n with arbitrarily large degree has a straightline upward drawing with area nsqrtlog nloglog no1 improving the longstanding onlog n bound 3 every binary tree of size n has a straightline orthogonal drawing with area n2ologn improving the previous onloglog n bound by shin kim and chwa 1996 and chan goodrich kosaraju and tamassia 1996 4 every binary tree of size n has a straightline orderpreserving drawing with area n2ologn improving the previous onloglog n bound by garg and rusu 2003 5 every binary tree of size n has a straightline orthogonal orderpreserving drawing with area n2osqrtlog n improving the on32 previous bound by frati 2007
|
[['we', 'make', 'progress', 'on', 'a', 'number', 'of', 'open', 'problems', 'concerning', 'the', 'area', 'requirement', 'for', 'drawing', 'trees', 'on', 'a', 'grid', 'we', 'prove', 'that', '1', 'every', 'tree', 'of', 'size', 'n', 'with', 'arbitrarily', 'large', 'degree', 'has', 'a', 'straightline', 'drawing', 'with', 'area', 'n2osqrtloglog', 'nlogloglog', 'n', 'improving', 'the', 'longstanding', 'onlog', 'n', 'bound', '2', 'every', 'tree', 'of', 'size', 'n', 'with', 'arbitrarily', 'large', 'degree', 'has', 'a', 'straightline', 'upward', 'drawing', 'with', 'area', 'nsqrtlog', 'nloglog', 'no1', 'improving', 'the', 'longstanding', 'onlog', 'n', 'bound', '3', 'every', 'binary', 'tree', 'of', 'size', 'n', 'has', 'a', 'straightline', 'orthogonal', 'drawing', 'with', 'area', 'n2ologn', 'improving', 'the', 'previous', 'onloglog', 'n', 'bound', 'by', 'shin', 'kim', 'and', 'chwa', '1996', 'and', 'chan', 'goodrich', 'kosaraju', 'and', 'tamassia', '1996', '4', 'every', 'binary', 'tree', 'of', 'size', 'n', 'has', 'a', 'straightline', 'orderpreserving', 'drawing', 'with', 'area', 'n2ologn', 'improving', 'the', 'previous', 'onloglog', 'n', 'bound', 'by', 'garg', 'and', 'rusu', '2003', '5', 'every', 'binary', 'tree', 'of', 'size', 'n', 'has', 'a', 'straightline', 'orthogonal', 'orderpreserving', 'drawing', 'with', 'area', 'n2osqrtlog', 'n', 'improving', 'the', 'on32', 'previous', 'bound', 'by', 'frati', '2007']]
|
[-0.17285654606188045, 0.18352690031691118, -0.013266604819815923, -0.05840170348757038, -0.05805414137765278, -0.2094078294573705, 0.14266628053136707, 0.3160600824512882, -0.17076190373517142, -0.43077890130575575, 0.07519670549987091, -0.342358383444424, -0.09531863409496259, 0.13881817324052023, -0.1198266738564616, 0.13154230171851083, 0.10703873442291142, 0.029136996107553347, 0.023148949729777824, -0.37318521863446125, 0.17667534237780214, 0.042634130839039296, 0.1965403745211113, 0.04281333985805414, 0.06889002920688415, 0.11133671366871947, -0.030756320704681664, 0.06270299003888652, -0.170290986327327, 0.11402926892589997, 0.26979737457046227, 0.23071829573208696, 0.2519159262902499, -0.37462149279057416, -0.1572498504644613, 0.1730609654359142, 0.16199866607724353, 0.06192340988063199, -0.01286677779094164, -0.18692373026396739, 0.08835981612769413, -0.07020728201685272, -0.13679502060442092, 0.09556629937720405, 0.19779585934627583, -0.03153068644110284, -0.2297906469054569, -0.1015021268010529, 0.16433526367387352, 0.048255680859381075, 0.1261702842243454, -0.23739891218666742, 0.02092054993328121, 0.11702591367056396, -0.07455195585156188, 0.23683710796819404, -0.024253558518526334, -0.06117809934425929, -0.18630897068704655, 0.25368702007165433, -0.026786235158082122, -0.15473550673896824, 0.0757453433006661, -0.1441243636167724, -0.22918388316273883, 0.15007686135328674, 0.1448271441565571, 0.11645035006203293, 0.00487894423038157, 0.26231551241720086, -0.1901482135678331, 0.2110756514677656, 0.24468841603454933, -0.052478275620956825, 0.09093380939166724, 0.18630540647294397, 0.14095416665914182, 0.16213133468542223, -0.03116013167815563, 0.015039679249657281, -0.19568942615068427, -0.11948737331698009, -0.21747321897533303, 0.08369687011501953, -0.23021484979046386, -0.1703384208608589, 0.27316872557028643, 0.009546406888308838, 0.2443985964171208, 0.20963383718010256, 0.24394457067782974, 0.04530131925670491, -0.011764592717833866, 0.270551372246415, 0.08978811142588752, 0.11270406896863254, -0.0026845923484930027, -0.16892614235091052, 0.08816944294627391, 0.178426966807665]
|
1,803.07186
|
Fabric idempotents and homological dimensions
|
Over a finite-dimensonal algbera $A$, simple $A$-modules that have projective
dimension one have special properties. For example, Geigle-Lenzing studied them
in connection to homological epimorphisms of rings, and they have also appeared
in work concerning the finitistic dimension conjecture. If we however work in a
$d$-cluster-tilting subcategory, then not all simples are contained in this
subcategory. In this context, a replacement might be to work with idempotent
ideals instead, and utilise the theory of Auslander-Platzeck-Todorov. We
introduce the notion of a fabric idempotent as an analogue of the localising
modules studied by Chen-Krause, and to illustrate the theory we show that they
provide rich combinatorial properties. An application is to extend the
classification of singularity categories of Nakayama algebras by Chen-Ye to
higher Nakayama algebras.
|
math.RT
|
over a finitedimensonal algbera a simple amodules that have projective dimension one have special properties for example geiglelenzing studied them in connection to homological epimorphisms of rings and they have also appeared in work concerning the finitistic dimension conjecture if we however work in a dclustertilting subcategory then not all simples are contained in this subcategory in this context a replacement might be to work with idempotent ideals instead and utilise the theory of auslanderplatzecktodorov we introduce the notion of a fabric idempotent as an analogue of the localising modules studied by chenkrause and to illustrate the theory we show that they provide rich combinatorial properties an application is to extend the classification of singularity categories of nakayama algebras by chenye to higher nakayama algebras
|
[['over', 'a', 'finitedimensonal', 'algbera', 'a', 'simple', 'amodules', 'that', 'have', 'projective', 'dimension', 'one', 'have', 'special', 'properties', 'for', 'example', 'geiglelenzing', 'studied', 'them', 'in', 'connection', 'to', 'homological', 'epimorphisms', 'of', 'rings', 'and', 'they', 'have', 'also', 'appeared', 'in', 'work', 'concerning', 'the', 'finitistic', 'dimension', 'conjecture', 'if', 'we', 'however', 'work', 'in', 'a', 'dclustertilting', 'subcategory', 'then', 'not', 'all', 'simples', 'are', 'contained', 'in', 'this', 'subcategory', 'in', 'this', 'context', 'a', 'replacement', 'might', 'be', 'to', 'work', 'with', 'idempotent', 'ideals', 'instead', 'and', 'utilise', 'the', 'theory', 'of', 'auslanderplatzecktodorov', 'we', 'introduce', 'the', 'notion', 'of', 'a', 'fabric', 'idempotent', 'as', 'an', 'analogue', 'of', 'the', 'localising', 'modules', 'studied', 'by', 'chenkrause', 'and', 'to', 'illustrate', 'the', 'theory', 'we', 'show', 'that', 'they', 'provide', 'rich', 'combinatorial', 'properties', 'an', 'application', 'is', 'to', 'extend', 'the', 'classification', 'of', 'singularity', 'categories', 'of', 'nakayama', 'algebras', 'by', 'chenye', 'to', 'higher', 'nakayama', 'algebras']]
|
[-0.11623390075127202, 0.017938962198788114, -0.09311582063409415, 0.09204401434803273, -0.08159385284809165, -0.13483987020113128, -0.05732334075949717, 0.3868799887843861, -0.34334500477272123, -0.19265148918767852, 0.12294811337189518, -0.22656184318667846, -0.16903845788834015, 0.17107683970123405, -0.1989968678498379, -0.06572811227399579, 0.04682221857172799, 0.08405305320913672, -0.06881873412263409, -0.3138977368458459, 0.41302318797900905, 0.03698168395179485, 0.23179416135261374, 0.06266040086345978, 0.08416539725023976, 0.011504957813688762, -0.001637871190520727, 0.054975547013835106, -0.175772142316208, 0.13716454613830678, 0.33825834862857074, 0.1043947014595913, 0.23106777105357282, -0.379433004339495, -0.13133442414393418, 0.16663724611213138, 0.15691785864562782, 0.07234889413191636, -0.048612993982166425, -0.2462347860809816, 0.16470000403740806, -0.26484237341133277, -0.1331682282265214, -0.1187024991920849, 0.08726687452270965, -0.018944170030626692, -0.19741181589370546, -0.02849587954581746, 0.13447521524195952, 0.1453589378694488, -0.08365228571659647, -0.06050910889209548, -0.058840693623089226, 0.07136897742170994, -0.04119451057111983, -0.02609670273036011, 0.0938465158254955, -0.12033761614136983, -0.17833057428399401, 0.3461511842829506, -0.007073847468257381, -0.2201262325017659, 0.17045409018500932, -0.15152660683798028, -0.17754456325057, 0.07167895926135662, 0.05897658573817616, 0.13954613288510437, -0.07395097112267716, 0.17177896627103756, -0.16195948375773825, 0.0566150774401882, 0.12427902652320168, 0.056591507613135514, 0.16017594100514904, 0.11164687777107413, 0.03499584335810697, 0.1553031112979482, 0.023263200888292833, -0.003327988126615355, -0.30748915889354284, -0.22279133828556982, -0.09096260937334862, 0.11257383410738539, -0.0328898247258501, -0.16220949670253706, 0.38585108911141386, 0.16062285417829417, 0.20041574144828295, 0.0937263097937319, 0.21941422891980114, -9.28925544654658e-05, 0.09680213727786259, 0.022049368801719146, 0.17300984459690566, 0.24871308998828215, 0.009135782575304043, -0.06977303353068996, -0.01749201922500429, 0.19630090421265808]
|
1,803.07187
|
Unveiling the invisible - mathematical methods for restoring and
interpreting illuminated manuscripts
|
The last fifty years have seen an impressive development of mathematical
methods for the analysis and processing of digital images, mostly in the
context of photography, biomedical imaging and various forms of engineering.
The arts have been mostly overlooked in this process, apart from a few
exceptional works in the last ten years. With the rapid emergence of
digitisation in the arts, however, the arts domain is becoming increasingly
receptive to digital image processing methods and the importance of paying
attention to this therefore increases. In this paper we discuss a range of
mathematical methods for digital image restoration and digital visualisation
for illuminated manuscripts. The latter provide an interesting opportunity for
digital manipulation because they traditionally remain physically untouched. At
the same time they also serve as an example for the possibilities mathematics
and digital restoration offer as a generic and objective toolkit for the arts.
|
cs.CV eess.IV math.NA
|
the last fifty years have seen an impressive development of mathematical methods for the analysis and processing of digital images mostly in the context of photography biomedical imaging and various forms of engineering the arts have been mostly overlooked in this process apart from a few exceptional works in the last ten years with the rapid emergence of digitisation in the arts however the arts domain is becoming increasingly receptive to digital image processing methods and the importance of paying attention to this therefore increases in this paper we discuss a range of mathematical methods for digital image restoration and digital visualisation for illuminated manuscripts the latter provide an interesting opportunity for digital manipulation because they traditionally remain physically untouched at the same time they also serve as an example for the possibilities mathematics and digital restoration offer as a generic and objective toolkit for the arts
|
[['the', 'last', 'fifty', 'years', 'have', 'seen', 'an', 'impressive', 'development', 'of', 'mathematical', 'methods', 'for', 'the', 'analysis', 'and', 'processing', 'of', 'digital', 'images', 'mostly', 'in', 'the', 'context', 'of', 'photography', 'biomedical', 'imaging', 'and', 'various', 'forms', 'of', 'engineering', 'the', 'arts', 'have', 'been', 'mostly', 'overlooked', 'in', 'this', 'process', 'apart', 'from', 'a', 'few', 'exceptional', 'works', 'in', 'the', 'last', 'ten', 'years', 'with', 'the', 'rapid', 'emergence', 'of', 'digitisation', 'in', 'the', 'arts', 'however', 'the', 'arts', 'domain', 'is', 'becoming', 'increasingly', 'receptive', 'to', 'digital', 'image', 'processing', 'methods', 'and', 'the', 'importance', 'of', 'paying', 'attention', 'to', 'this', 'therefore', 'increases', 'in', 'this', 'paper', 'we', 'discuss', 'a', 'range', 'of', 'mathematical', 'methods', 'for', 'digital', 'image', 'restoration', 'and', 'digital', 'visualisation', 'for', 'illuminated', 'manuscripts', 'the', 'latter', 'provide', 'an', 'interesting', 'opportunity', 'for', 'digital', 'manipulation', 'because', 'they', 'traditionally', 'remain', 'physically', 'untouched', 'at', 'the', 'same', 'time', 'they', 'also', 'serve', 'as', 'an', 'example', 'for', 'the', 'possibilities', 'mathematics', 'and', 'digital', 'restoration', 'offer', 'as', 'a', 'generic', 'and', 'objective', 'toolkit', 'for', 'the', 'arts']]
|
[-0.023772070981042625, 0.016903620428183167, -0.06749560978092557, 0.0638891775545738, -0.1021664800743262, -0.09139051220892948, -0.0023021476088269125, 0.4068750342937047, -0.25051985035149926, -0.3401925580918181, 0.19401727468139637, -0.2576217757740698, -0.16379857358529049, 0.27496162599244084, -0.10861206376532308, 0.02794710053511116, 0.043819534830704686, 0.02831704956245748, -0.0688627480686053, -0.267403275826249, 0.223607616476892, 0.04520544170902497, 0.36065658062797823, 0.03406006834932229, 0.0886209530092726, -0.001171459390015221, -0.1008570591988815, -0.04491106350431029, -0.06949101384494732, 0.15959071590989626, 0.3450293121289234, 0.2002847465499602, 0.3685455533713863, -0.44756023901305636, -0.21018479651689123, 0.09761295949115234, 0.200240646617259, 0.1474108007280346, -0.14230774724491727, -0.29159573119032345, 0.03979878556331759, -0.16447794856503606, -0.07278464130144946, -0.07180083598656466, 0.07602738547629873, -0.01947424308393708, -0.15700538609759743, 0.020202726402698514, 0.055039627909926434, 0.17720920693914907, -0.02417879106895048, -0.13101741552454274, 0.03455059200471432, 0.197983293505829, 0.058412348422131555, 0.04001663557766956, 0.10342162965201349, -0.24222422264940835, -0.12817102995682128, 0.40721538736402585, 0.01753906824873114, -0.13209920710104764, 0.2272028332183353, -0.09791472283363038, -0.16351509557147573, 0.1168045264931687, 0.19083803391708123, 0.07252958819878344, -0.15745229681092157, 0.06933202945269315, 0.014614698983931623, 0.138878977147951, 0.09875261593534022, 0.08405212853515685, 0.23826216210668183, 0.23726124742201396, 0.007447543680718561, 0.1310742075307941, -0.08174238827231588, -0.09908472467847422, -0.218262744869492, -0.16553551219657164, -0.15805751323497214, -0.00036103407564085153, -0.02496659712565803, -0.17053896660099224, 0.4090684173235885, 0.1790730462783352, 0.13738586943039074, -0.021333449203394302, 0.34930972928231974, 0.04200961586795937, 0.11557067878113515, 0.012287250583750658, 0.2434632259763169, 0.07670562149050841, 0.24647651585515867, -0.08123184368885471, 0.041697080237600874, -0.021454425066151993]
|
1,803.07188
|
Magnetic susceptibility, nanorheology, and magnetoviscosity of magnetic
nanoparticles in viscoelastic environments
|
While magnetic nanoparticles suspended in Newtonian solvents (ferrofluids)
have been intensively studied in recent years, the effects of viscoelasticity
of the surrounding medium on the nanoparticle dynamics are much less
understood. Here we investigate a mesoscopic model for the orientational
dynamics of isolated magnetic nanoparticles subject to external fields, viscous
and viscoelastic friction as well as the corresponding random torques. We solve
the model analytically in the overdamped limit for weak viscoelasticity. By
comparison to Brownian Dynamics simulations we establish the limits of validity
of the analytical solution. We find that viscoelasticity does not only slow
down the magnetization relaxation, shift the peak of the imaginary magnetic
susceptibility $\chi''$ to lower frequencies and increase the magnetoviscosity,
it also leads to non-exponential relaxation and a broadening of $\chi''$. The
model we study also allows to test a recent proposal for using magnetic
susceptibility measurements as a nanorheological tool using a variant of the
Germant-DiMarzio-Bishop relation. We find for the present model and certain
parameter ranges that the relation of the magnetic susceptibility to the shear
modulus is satisfied to a good approximation.
|
cond-mat.soft
|
while magnetic nanoparticles suspended in newtonian solvents ferrofluids have been intensively studied in recent years the effects of viscoelasticity of the surrounding medium on the nanoparticle dynamics are much less understood here we investigate a mesoscopic model for the orientational dynamics of isolated magnetic nanoparticles subject to external fields viscous and viscoelastic friction as well as the corresponding random torques we solve the model analytically in the overdamped limit for weak viscoelasticity by comparison to brownian dynamics simulations we establish the limits of validity of the analytical solution we find that viscoelasticity does not only slow down the magnetization relaxation shift the peak of the imaginary magnetic susceptibility chi to lower frequencies and increase the magnetoviscosity it also leads to nonexponential relaxation and a broadening of chi the model we study also allows to test a recent proposal for using magnetic susceptibility measurements as a nanorheological tool using a variant of the germantdimarziobishop relation we find for the present model and certain parameter ranges that the relation of the magnetic susceptibility to the shear modulus is satisfied to a good approximation
|
[['while', 'magnetic', 'nanoparticles', 'suspended', 'in', 'newtonian', 'solvents', 'ferrofluids', 'have', 'been', 'intensively', 'studied', 'in', 'recent', 'years', 'the', 'effects', 'of', 'viscoelasticity', 'of', 'the', 'surrounding', 'medium', 'on', 'the', 'nanoparticle', 'dynamics', 'are', 'much', 'less', 'understood', 'here', 'we', 'investigate', 'a', 'mesoscopic', 'model', 'for', 'the', 'orientational', 'dynamics', 'of', 'isolated', 'magnetic', 'nanoparticles', 'subject', 'to', 'external', 'fields', 'viscous', 'and', 'viscoelastic', 'friction', 'as', 'well', 'as', 'the', 'corresponding', 'random', 'torques', 'we', 'solve', 'the', 'model', 'analytically', 'in', 'the', 'overdamped', 'limit', 'for', 'weak', 'viscoelasticity', 'by', 'comparison', 'to', 'brownian', 'dynamics', 'simulations', 'we', 'establish', 'the', 'limits', 'of', 'validity', 'of', 'the', 'analytical', 'solution', 'we', 'find', 'that', 'viscoelasticity', 'does', 'not', 'only', 'slow', 'down', 'the', 'magnetization', 'relaxation', 'shift', 'the', 'peak', 'of', 'the', 'imaginary', 'magnetic', 'susceptibility', 'chi', 'to', 'lower', 'frequencies', 'and', 'increase', 'the', 'magnetoviscosity', 'it', 'also', 'leads', 'to', 'nonexponential', 'relaxation', 'and', 'a', 'broadening', 'of', 'chi', 'the', 'model', 'we', 'study', 'also', 'allows', 'to', 'test', 'a', 'recent', 'proposal', 'for', 'using', 'magnetic', 'susceptibility', 'measurements', 'as', 'a', 'nanorheological', 'tool', 'using', 'a', 'variant', 'of', 'the', 'germantdimarziobishop', 'relation', 'we', 'find', 'for', 'the', 'present', 'model', 'and', 'certain', 'parameter', 'ranges', 'that', 'the', 'relation', 'of', 'the', 'magnetic', 'susceptibility', 'to', 'the', 'shear', 'modulus', 'is', 'satisfied', 'to', 'a', 'good', 'approximation']]
|
[-0.1339202643399434, 0.1498663275669766, -0.08972510135103037, 0.0527993945675439, -0.08331380176030141, -0.09959737915941123, 0.03597725007628408, 0.3663139498985097, -0.2676206072792411, -0.3105397978433351, 0.05347609913104094, -0.2622892725023385, -0.14304468377139523, 0.19104867732099012, 0.0247754745455927, 0.06654094221778006, -0.003039685631425812, 0.014000661981385722, -0.04784727925122533, -0.18142408372407687, 0.22872522534697196, 0.044252312708354696, 0.2716851631756976, 0.08333011184231763, 0.08178067406348093, -0.0058433001027858745, 0.06601316518769418, 0.08540129412080073, -0.19672197345997058, 0.034617588449498464, 0.16919851407679265, -0.039966664119628806, 0.23815346057344666, -0.46507894134346667, -0.24443657838742056, 0.07630866505569836, 0.1415540539898894, 0.13168662465105938, -0.019744269197348858, -0.22632390748730252, 0.04892074999948391, -0.1443614326625563, -0.15363207614756913, -0.12090975493153651, 0.050340382005062016, 0.04082586250219796, -0.2690835571639739, 0.16512310644221498, 0.0867538409991783, 0.0751962123371078, -0.11040618307608852, -0.06806369538694704, 0.009797570947297541, 0.08239699047196698, 0.1051712764795782, 0.02013812549334207, 0.18746637147669187, -0.16846203486117736, -0.06017591222059294, 0.3792026709692355, -0.09181994937591817, -0.186852099223052, 0.1982775706558504, -0.19683134617991538, -0.08958853442253098, 0.11636950169278923, 0.18544702356233778, 0.1342127575960489, -0.16729158110261047, 0.056793984841274396, -0.034386572139936, 0.1698770976349628, 0.04797945515247447, 0.0029577214515367368, 0.1882215439180672, 0.19887457692256852, -0.004397059317974779, 0.1966075943704882, -0.09876277582993401, -0.09884023438754112, -0.25285044925381017, -0.1353159335828204, -0.1786500939399566, 0.06763755103617754, -0.09562328365968291, -0.16446884602110562, 0.35101838954386183, 0.1641878694316695, 0.17415766989252615, 0.06036265187912397, 0.274757216637694, 0.12324465420773492, 0.04845554897771087, 0.03346102721416834, 0.2939805860251355, 0.22892356238766268, 0.1418705143219162, -0.29555245237581057, 0.06035564353301934, 0.027955765664244497]
|
1,803.07189
|
Antimicrobial resistance and use, and rates of hospitalization
associated with bacterial infections, including sepsis
|
While the mechanisms and quantitative details are complex, few analysts would
doubt that antibiotic use increases the prevalence of drug-resistant bacterial
pathogens among all bacteria causing disease in a population. The causal
connection between antibiotic use and the total incidence of severe bacterial
infections, possibly mediated by antibiotic resistance, is less clearly
established. The increasing burden of severe bacterial infections and their
sequelae, particularly sepsis, in the United States and other countries, calls
out for an explanation. In this Perspective we consider the evidence bearing on
the hypothesis that prevalence of antibiotic resistance and levels of
antibiotic use are important contributors to the rates of sepsis
hospitalizations and other outcomes with bacterial etiology. In the process, we
discuss the consequences of resistance to/use of commonly prescribed
antibiotics, including fluoroquinolones, and provide a comparison of the
epidemiology of antibiotic use/resistance and severe outcomes associated with
infections with bacterial pathogens, particularly Escherichia coli,
methicillin-resistant Staphylococcus aureus (MRSA), and Clostridium Difficile
in the UK vs. US.
|
q-bio.PE
|
while the mechanisms and quantitative details are complex few analysts would doubt that antibiotic use increases the prevalence of drugresistant bacterial pathogens among all bacteria causing disease in a population the causal connection between antibiotic use and the total incidence of severe bacterial infections possibly mediated by antibiotic resistance is less clearly established the increasing burden of severe bacterial infections and their sequelae particularly sepsis in the united states and other countries calls out for an explanation in this perspective we consider the evidence bearing on the hypothesis that prevalence of antibiotic resistance and levels of antibiotic use are important contributors to the rates of sepsis hospitalizations and other outcomes with bacterial etiology in the process we discuss the consequences of resistance touse of commonly prescribed antibiotics including fluoroquinolones and provide a comparison of the epidemiology of antibiotic useresistance and severe outcomes associated with infections with bacterial pathogens particularly escherichia coli methicillinresistant staphylococcus aureus mrsa and clostridium difficile in the uk vs us
|
[['while', 'the', 'mechanisms', 'and', 'quantitative', 'details', 'are', 'complex', 'few', 'analysts', 'would', 'doubt', 'that', 'antibiotic', 'use', 'increases', 'the', 'prevalence', 'of', 'drugresistant', 'bacterial', 'pathogens', 'among', 'all', 'bacteria', 'causing', 'disease', 'in', 'a', 'population', 'the', 'causal', 'connection', 'between', 'antibiotic', 'use', 'and', 'the', 'total', 'incidence', 'of', 'severe', 'bacterial', 'infections', 'possibly', 'mediated', 'by', 'antibiotic', 'resistance', 'is', 'less', 'clearly', 'established', 'the', 'increasing', 'burden', 'of', 'severe', 'bacterial', 'infections', 'and', 'their', 'sequelae', 'particularly', 'sepsis', 'in', 'the', 'united', 'states', 'and', 'other', 'countries', 'calls', 'out', 'for', 'an', 'explanation', 'in', 'this', 'perspective', 'we', 'consider', 'the', 'evidence', 'bearing', 'on', 'the', 'hypothesis', 'that', 'prevalence', 'of', 'antibiotic', 'resistance', 'and', 'levels', 'of', 'antibiotic', 'use', 'are', 'important', 'contributors', 'to', 'the', 'rates', 'of', 'sepsis', 'hospitalizations', 'and', 'other', 'outcomes', 'with', 'bacterial', 'etiology', 'in', 'the', 'process', 'we', 'discuss', 'the', 'consequences', 'of', 'resistance', 'touse', 'of', 'commonly', 'prescribed', 'antibiotics', 'including', 'fluoroquinolones', 'and', 'provide', 'a', 'comparison', 'of', 'the', 'epidemiology', 'of', 'antibiotic', 'useresistance', 'and', 'severe', 'outcomes', 'associated', 'with', 'infections', 'with', 'bacterial', 'pathogens', 'particularly', 'escherichia', 'coli', 'methicillinresistant', 'staphylococcus', 'aureus', 'mrsa', 'and', 'clostridium', 'difficile', 'in', 'the', 'uk', 'vs', 'us']]
|
[-0.09162136989034479, 0.14560045624903067, -0.006622986064758152, 0.10259461901338227, -0.05727302511513699, -0.16895820591707889, 0.13814315736526622, 0.29002253025537356, -0.18813146711327136, -0.2674989638180705, 0.10446805680185207, -0.34574125573853964, -0.2793756127503002, 0.2004224176314892, -0.18310582021949812, -0.019471735029947014, 0.08510581784503302, -0.03113236996705382, 0.15630803174281027, -0.2522557669573871, 0.2557907506605261, 0.06521744459641923, 0.315079651447013, 0.09977667932398618, 0.09011106147145256, 0.010349478539501434, -0.04881341618311126, -0.025378458347404376, -0.15206988633772198, 0.10286434658664803, 0.3290746311220573, 0.18944676439568867, 0.36315773672540674, -0.4856696814182214, -0.2462400023941882, 0.16882092882005964, 0.1060867947886436, 0.13905594114621636, -0.029280667054263177, -0.24582602075097384, 0.01190000799469999, -0.18138679190305992, -0.1318919797140552, -0.018772667525627184, 0.059332543601340146, 0.017338729726333213, -0.21295424318523146, 0.18989198669332835, -0.04664778414589819, 0.1940674189827405, -0.10598317141266307, -0.16918709646779462, -0.10672121445531957, 0.20763655379996634, 0.18438105402656219, -0.03534517234947998, 0.21634799185267184, -0.16864937237551203, -0.11753592452296288, 0.304151727585122, 0.04579045850550756, -0.11319079927052371, 0.2571198317687958, -0.1297151168815617, -0.11899322442131961, 0.10097667197405827, 0.19229401959455572, 0.06262843213044107, -0.1856206383992685, -0.05995047614596842, 0.056562745029805225, 0.11799072292051278, 0.10786365104140713, -0.04939413039755891, 0.13620937374071218, 0.2214129255968146, 0.010969262608705321, 0.058158026359888024, -0.0913671874517604, -0.07582139763544546, -0.13643552931025624, -0.1890354560688138, 0.014463994697871385, 0.08453024561604253, -0.08624111779381564, -0.17943294209871966, 0.3795838555437513, 0.11835533945995849, 0.13980090985423885, 0.05769624850581749, 0.22060358671515132, -0.04622604041651357, 0.0701357962723705, -0.01433416270010639, 0.1426566448295489, 0.09622583811342338, 0.06513398744973528, -0.3258574795763707, 0.27247651987709104, -0.11314551600371488]
|
1,803.0719
|
Wave propagation and pattern formation in two-dimensional
hexagonally-packed granular crystals under various configurations
|
We study wave propagation in two-dimensional granular crystals under the
Hertzian contact law consisting of hexagonal packings of spheres under various
basin geometries including hexagonal, triangular, and circular basins which can
be tiled with hexagons. We find that the basin geometry will influence wave
reflection at the boundaries, as expected, and also may result in bottlenecks
forming. While exterior strikers the size of a single sphere have been
considered in the literature, it is also possible to consider strikers which
impact multiple spheres along a boundary, or to have multiple sides being
struck simultaneously. It is also possible to consider obstructions or even
strikers in the interior of the hexagonally packed granular crystal, as
previously considered in the case of square packings, resulting in the basin
geometry no longer forming a convex set. We consider various configurations of
either boundary or interior strikers. We shall also consider the case where a
granular crystal is composed of two separate crystals of differing material,
with a single interface between the two distinct materials. Depending on the
relative material properties of each type of sphere, this can result in a
trapping of most of the wave energy within one of the two regions. While
repeated reflections from the boundaries will cause the systems we study to
fall into disorder for large time, there are a number of interesting wave
structures and patters that emerge as transients at intermediate timescales.
|
nlin.PS cond-mat.soft
|
we study wave propagation in twodimensional granular crystals under the hertzian contact law consisting of hexagonal packings of spheres under various basin geometries including hexagonal triangular and circular basins which can be tiled with hexagons we find that the basin geometry will influence wave reflection at the boundaries as expected and also may result in bottlenecks forming while exterior strikers the size of a single sphere have been considered in the literature it is also possible to consider strikers which impact multiple spheres along a boundary or to have multiple sides being struck simultaneously it is also possible to consider obstructions or even strikers in the interior of the hexagonally packed granular crystal as previously considered in the case of square packings resulting in the basin geometry no longer forming a convex set we consider various configurations of either boundary or interior strikers we shall also consider the case where a granular crystal is composed of two separate crystals of differing material with a single interface between the two distinct materials depending on the relative material properties of each type of sphere this can result in a trapping of most of the wave energy within one of the two regions while repeated reflections from the boundaries will cause the systems we study to fall into disorder for large time there are a number of interesting wave structures and patters that emerge as transients at intermediate timescales
|
[['we', 'study', 'wave', 'propagation', 'in', 'twodimensional', 'granular', 'crystals', 'under', 'the', 'hertzian', 'contact', 'law', 'consisting', 'of', 'hexagonal', 'packings', 'of', 'spheres', 'under', 'various', 'basin', 'geometries', 'including', 'hexagonal', 'triangular', 'and', 'circular', 'basins', 'which', 'can', 'be', 'tiled', 'with', 'hexagons', 'we', 'find', 'that', 'the', 'basin', 'geometry', 'will', 'influence', 'wave', 'reflection', 'at', 'the', 'boundaries', 'as', 'expected', 'and', 'also', 'may', 'result', 'in', 'bottlenecks', 'forming', 'while', 'exterior', 'strikers', 'the', 'size', 'of', 'a', 'single', 'sphere', 'have', 'been', 'considered', 'in', 'the', 'literature', 'it', 'is', 'also', 'possible', 'to', 'consider', 'strikers', 'which', 'impact', 'multiple', 'spheres', 'along', 'a', 'boundary', 'or', 'to', 'have', 'multiple', 'sides', 'being', 'struck', 'simultaneously', 'it', 'is', 'also', 'possible', 'to', 'consider', 'obstructions', 'or', 'even', 'strikers', 'in', 'the', 'interior', 'of', 'the', 'hexagonally', 'packed', 'granular', 'crystal', 'as', 'previously', 'considered', 'in', 'the', 'case', 'of', 'square', 'packings', 'resulting', 'in', 'the', 'basin', 'geometry', 'no', 'longer', 'forming', 'a', 'convex', 'set', 'we', 'consider', 'various', 'configurations', 'of', 'either', 'boundary', 'or', 'interior', 'strikers', 'we', 'shall', 'also', 'consider', 'the', 'case', 'where', 'a', 'granular', 'crystal', 'is', 'composed', 'of', 'two', 'separate', 'crystals', 'of', 'differing', 'material', 'with', 'a', 'single', 'interface', 'between', 'the', 'two', 'distinct', 'materials', 'depending', 'on', 'the', 'relative', 'material', 'properties', 'of', 'each', 'type', 'of', 'sphere', 'this', 'can', 'result', 'in', 'a', 'trapping', 'of', 'most', 'of', 'the', 'wave', 'energy', 'within', 'one', 'of', 'the', 'two', 'regions', 'while', 'repeated', 'reflections', 'from', 'the', 'boundaries', 'will', 'cause', 'the', 'systems', 'we', 'study', 'to', 'fall', 'into', 'disorder', 'for', 'large', 'time', 'there', 'are', 'a', 'number', 'of', 'interesting', 'wave', 'structures', 'and', 'patters', 'that', 'emerge', 'as', 'transients', 'at', 'intermediate', 'timescales']]
|
[-0.16987665139643823, 0.17317339180084734, -0.05912455477282184, 0.012441053835357445, -0.04411720787372314, -0.11165106917881423, 0.02107732006451273, 0.3933535073962757, -0.26653837559249455, -0.25833209747669555, 0.12663362849497836, -0.293640100262996, -0.14398537402858136, 0.17398150401067589, -0.011664252610821909, 0.024186418575759566, 0.029181398321594252, 0.02392096294216433, -0.07687711818597548, -0.21256621144721838, 0.32008308755190473, -0.011259391836790462, 0.24121108177212713, 0.03535861292335015, 0.06373382243426454, 0.00978339246328194, 0.05892617899260555, 0.08436313953440068, -0.1518383364342237, 0.06474058230119457, 0.228187913572321, 0.009430117251043665, 0.2227979304714886, -0.4836939961049643, -0.22935947417123717, 0.09959056725828135, 0.13775523499387388, 0.08490741195776737, -0.03233529160379322, -0.23830675689840958, 0.06248896852899264, -0.12176198296256806, -0.15993223327283068, 0.013080056115464008, 0.014596430861028069, 0.04872972682124335, -0.20207278589423058, 0.0492227682523169, 0.07702649575456512, 0.03210397354614234, -0.08455159095701982, -0.09856726056836956, -0.05881532313306106, 0.11509183408214979, 0.05275320683771713, -0.02051012638770833, 0.13489999606913367, -0.10662323946598917, -0.08114739670812832, 0.4264598618443045, 0.0013141236859926227, -0.21182638783475494, 0.24075253419499149, -0.1863229344755567, -0.09761128163407162, 0.17000627128695436, 0.19805202520328133, 0.09391589360810462, -0.11967080668102302, 0.0416754927297253, -0.08319292758010383, 0.14266030488277281, 0.1521139953697842, 0.02789122019292613, 0.2623874825322843, 0.16883611595514625, 0.08850677661455662, 0.2100925509175641, -0.1277510938678584, -0.10500815119623932, -0.269319519499747, -0.15597860434218863, -0.1627847422249773, 0.015778768737356463, -0.08688684735207679, -0.22669240172905059, 0.3469046348009369, 0.053308361799404874, 0.19382047875768552, -0.013004459083569632, 0.22486330825298773, 0.030969319293944864, 0.08007639419421617, 0.05695238250743803, 0.2408719998794229, 0.08183215422776796, 0.060129695327289526, -0.17102177707000904, 0.02722412773597417, 0.04071012811766843]
|
1,803.07191
|
A Minimalist Approach to Type-Agnostic Detection of Quadrics in Point
Clouds
|
This paper proposes a segmentation-free, automatic and efficient procedure to
detect general geometric quadric forms in point clouds, where clutter and
occlusions are inevitable. Our everyday world is dominated by man-made objects
which are designed using 3D primitives (such as planes, cones, spheres,
cylinders, etc.). These objects are also omnipresent in industrial
environments. This gives rise to the possibility of abstracting 3D scenes
through primitives, thereby positions these geometric forms as an integral part
of perception and high level 3D scene understanding.
As opposed to state-of-the-art, where a tailored algorithm treats each
primitive type separately, we propose to encapsulate all types in a single
robust detection procedure. At the center of our approach lies a closed form 3D
quadric fit, operating in both primal & dual spaces and requiring as low as 4
oriented-points. Around this fit, we design a novel, local null-space voting
strategy to reduce the 4-point case to 3. Voting is coupled with the famous
RANSAC and makes our algorithm orders of magnitude faster than its conventional
counterparts. This is the first method capable of performing a generic
cross-type multi-object primitive detection in difficult scenes. Results on
synthetic and real datasets support the validity of our method.
|
cs.CV cs.CG cs.RO
|
this paper proposes a segmentationfree automatic and efficient procedure to detect general geometric quadric forms in point clouds where clutter and occlusions are inevitable our everyday world is dominated by manmade objects which are designed using 3d primitives such as planes cones spheres cylinders etc these objects are also omnipresent in industrial environments this gives rise to the possibility of abstracting 3d scenes through primitives thereby positions these geometric forms as an integral part of perception and high level 3d scene understanding as opposed to stateoftheart where a tailored algorithm treats each primitive type separately we propose to encapsulate all types in a single robust detection procedure at the center of our approach lies a closed form 3d quadric fit operating in both primal dual spaces and requiring as low as 4 orientedpoints around this fit we design a novel local nullspace voting strategy to reduce the 4point case to 3 voting is coupled with the famous ransac and makes our algorithm orders of magnitude faster than its conventional counterparts this is the first method capable of performing a generic crosstype multiobject primitive detection in difficult scenes results on synthetic and real datasets support the validity of our method
|
[['this', 'paper', 'proposes', 'a', 'segmentationfree', 'automatic', 'and', 'efficient', 'procedure', 'to', 'detect', 'general', 'geometric', 'quadric', 'forms', 'in', 'point', 'clouds', 'where', 'clutter', 'and', 'occlusions', 'are', 'inevitable', 'our', 'everyday', 'world', 'is', 'dominated', 'by', 'manmade', 'objects', 'which', 'are', 'designed', 'using', '3d', 'primitives', 'such', 'as', 'planes', 'cones', 'spheres', 'cylinders', 'etc', 'these', 'objects', 'are', 'also', 'omnipresent', 'in', 'industrial', 'environments', 'this', 'gives', 'rise', 'to', 'the', 'possibility', 'of', 'abstracting', '3d', 'scenes', 'through', 'primitives', 'thereby', 'positions', 'these', 'geometric', 'forms', 'as', 'an', 'integral', 'part', 'of', 'perception', 'and', 'high', 'level', '3d', 'scene', 'understanding', 'as', 'opposed', 'to', 'stateoftheart', 'where', 'a', 'tailored', 'algorithm', 'treats', 'each', 'primitive', 'type', 'separately', 'we', 'propose', 'to', 'encapsulate', 'all', 'types', 'in', 'a', 'single', 'robust', 'detection', 'procedure', 'at', 'the', 'center', 'of', 'our', 'approach', 'lies', 'a', 'closed', 'form', '3d', 'quadric', 'fit', 'operating', 'in', 'both', 'primal', 'dual', 'spaces', 'and', 'requiring', 'as', 'low', 'as', '4', 'orientedpoints', 'around', 'this', 'fit', 'we', 'design', 'a', 'novel', 'local', 'nullspace', 'voting', 'strategy', 'to', 'reduce', 'the', '4point', 'case', 'to', '3', 'voting', 'is', 'coupled', 'with', 'the', 'famous', 'ransac', 'and', 'makes', 'our', 'algorithm', 'orders', 'of', 'magnitude', 'faster', 'than', 'its', 'conventional', 'counterparts', 'this', 'is', 'the', 'first', 'method', 'capable', 'of', 'performing', 'a', 'generic', 'crosstype', 'multiobject', 'primitive', 'detection', 'in', 'difficult', 'scenes', 'results', 'on', 'synthetic', 'and', 'real', 'datasets', 'support', 'the', 'validity', 'of', 'our', 'method']]
|
[-0.08535142566357866, 0.013007673150268878, -0.04953710318336056, 0.05171963620890929, -0.10900561442490517, -0.1492698999578039, 0.02413058384483906, 0.40212560865106156, -0.2427234832959419, -0.34196720881895587, 0.0909476779781122, -0.24831233246280163, -0.20054579715272694, 0.20451047664832775, -0.13539182930958993, 0.05076329619476731, 0.05299481421572655, 0.006916068263841097, -0.07232850754276068, -0.24262205207946175, 0.3017694267466067, 0.009113993030041456, 0.29142549698948955, -0.011098192664888698, 0.12291589565810306, 0.026417631852308835, -0.03194956879679471, 0.009245088055842754, -0.03709986691617153, 0.15639931287480086, 0.3051127493910661, 0.12529050265180153, 0.24181591047825424, -0.41790996851738205, -0.17295838551046583, 0.09011416864285077, 0.1493748036540123, 0.08223788878144614, -0.03888187587033073, -0.30472840975106913, 0.10004161699584478, -0.13611125731911283, -0.12483522388378554, -0.13062930770566442, -0.003717149668984642, -0.03235968430479518, -0.26669636237049343, 0.04978525213590903, 0.06884491110380475, 0.07697955986812377, -0.06316233516466155, -0.08770677561206142, 0.03221130575408519, 0.14514746672163406, -0.030630700348998712, 0.02354556152957487, 0.1573955421218404, -0.14703934727180185, -0.1394546618261798, 0.4362090000073717, -0.005635706057923145, -0.21674883854810637, 0.23209721810711229, -0.06191025216913208, -0.1301598577557903, 0.15497810607470308, 0.20194223516319662, 0.187175566680974, -0.12640888963101637, 0.03936599815841129, -0.04589004719023113, 0.12958248875487827, 0.061057721025950154, 0.0005803319071113799, 0.2214925854338681, 0.20526554670556438, 0.06771205473665355, 0.15110404260640004, -0.12364022971972861, -0.08625150045216544, -0.2733620441803295, -0.14999788833636263, -0.14722044384836058, 0.0028585155795544685, -0.10779491210820252, -0.17444564210900076, 0.3637384341634584, 0.1890699987704254, 0.20276910431607806, 0.0733870942306686, 0.3875344418967613, 0.036776171403941744, 0.0937159587676176, 0.06927854595752904, 0.18237031995544606, 0.03901193315055071, 0.0786553635755836, -0.13598462970012498, 0.042221369574580225, 0.08297584710567436]
|
1,803.07192
|
Diagnostic Classification Of Lung Nodules Using 3D Neural Networks
|
Lung cancer is the leading cause of cancer-related death worldwide. Early
diagnosis of pulmonary nodules in Computed Tomography (CT) chest scans provides
an opportunity for designing effective treatment and making financial and care
plans. In this paper, we consider the problem of diagnostic classification
between benign and malignant lung nodules in CT images, which aims to learn a
direct mapping from 3D images to class labels. To achieve this goal, four
two-pathway Convolutional Neural Networks (CNN) are proposed, including a basic
3D CNN, a novel multi-output network, a 3D DenseNet, and an augmented 3D
DenseNet with multi-outputs. These four networks are evaluated on the public
LIDC-IDRI dataset and outperform most existing methods. In particular, the 3D
multi-output DenseNet (MoDenseNet) achieves the state-of-the-art classification
accuracy on the task of end-to-end lung nodule diagnosis. In addition, the
networks pretrained on the LIDC-IDRI dataset can be further extended to handle
smaller datasets using transfer learning. This is demonstrated on our dataset
with encouraging prediction accuracy in lung nodule classification.
|
cs.CV cs.LG stat.ML
|
lung cancer is the leading cause of cancerrelated death worldwide early diagnosis of pulmonary nodules in computed tomography ct chest scans provides an opportunity for designing effective treatment and making financial and care plans in this paper we consider the problem of diagnostic classification between benign and malignant lung nodules in ct images which aims to learn a direct mapping from 3d images to class labels to achieve this goal four twopathway convolutional neural networks cnn are proposed including a basic 3d cnn a novel multioutput network a 3d densenet and an augmented 3d densenet with multioutputs these four networks are evaluated on the public lidcidri dataset and outperform most existing methods in particular the 3d multioutput densenet modensenet achieves the stateoftheart classification accuracy on the task of endtoend lung nodule diagnosis in addition the networks pretrained on the lidcidri dataset can be further extended to handle smaller datasets using transfer learning this is demonstrated on our dataset with encouraging prediction accuracy in lung nodule classification
|
[['lung', 'cancer', 'is', 'the', 'leading', 'cause', 'of', 'cancerrelated', 'death', 'worldwide', 'early', 'diagnosis', 'of', 'pulmonary', 'nodules', 'in', 'computed', 'tomography', 'ct', 'chest', 'scans', 'provides', 'an', 'opportunity', 'for', 'designing', 'effective', 'treatment', 'and', 'making', 'financial', 'and', 'care', 'plans', 'in', 'this', 'paper', 'we', 'consider', 'the', 'problem', 'of', 'diagnostic', 'classification', 'between', 'benign', 'and', 'malignant', 'lung', 'nodules', 'in', 'ct', 'images', 'which', 'aims', 'to', 'learn', 'a', 'direct', 'mapping', 'from', '3d', 'images', 'to', 'class', 'labels', 'to', 'achieve', 'this', 'goal', 'four', 'twopathway', 'convolutional', 'neural', 'networks', 'cnn', 'are', 'proposed', 'including', 'a', 'basic', '3d', 'cnn', 'a', 'novel', 'multioutput', 'network', 'a', '3d', 'densenet', 'and', 'an', 'augmented', '3d', 'densenet', 'with', 'multioutputs', 'these', 'four', 'networks', 'are', 'evaluated', 'on', 'the', 'public', 'lidcidri', 'dataset', 'and', 'outperform', 'most', 'existing', 'methods', 'in', 'particular', 'the', '3d', 'multioutput', 'densenet', 'modensenet', 'achieves', 'the', 'stateoftheart', 'classification', 'accuracy', 'on', 'the', 'task', 'of', 'endtoend', 'lung', 'nodule', 'diagnosis', 'in', 'addition', 'the', 'networks', 'pretrained', 'on', 'the', 'lidcidri', 'dataset', 'can', 'be', 'further', 'extended', 'to', 'handle', 'smaller', 'datasets', 'using', 'transfer', 'learning', 'this', 'is', 'demonstrated', 'on', 'our', 'dataset', 'with', 'encouraging', 'prediction', 'accuracy', 'in', 'lung', 'nodule', 'classification']]
|
[0.022341492587248934, -0.071147294603394, 0.022216208736327563, 0.06958931863350286, -0.06158644446651593, -0.20224833373883458, -0.015991220802463818, 0.4487024666035943, -0.17374058033720674, -0.3086041423407468, 0.10614534485520738, -0.3149390451497201, -0.21999276540256246, 0.23244723385538568, -0.19160343444708622, 0.10598217363850299, 0.19854839750368036, 0.039153660376640885, -0.029716556670257088, -0.3220572583511415, 0.26330038575935316, 0.03564173324090062, 0.388173744872664, 0.027185751136505242, 0.12475447471281796, -0.05969859024961338, -0.03864093403839929, -0.00561325404524916, -0.026324696862844357, 0.1880444119860785, 0.3923306518079092, 0.2192789670757272, 0.3114882044748149, -0.41052924286182546, -0.2674893672937866, 0.11831639432771639, 0.14578879134602507, 0.10485080652226426, 0.000424734844515721, -0.3917651470390741, 0.08669231706298888, -0.17779068093408237, 0.040410052476958794, -0.14369154676625676, -0.07415316091483515, -0.09883496964237455, -0.3340858313078625, 0.11479978821236837, -0.013259852490613632, 0.10315336507434646, -0.12824441331692718, -0.1059561292894862, -0.010593804803140688, 0.22713310545253934, -0.011849324484920185, 0.11862155750224536, 0.14153587514548704, -0.2812891284190824, -0.15126057294846484, 0.3415121973922589, 0.012211711699086608, -0.20046048526454605, 0.20377421496210224, -0.021318344447310223, -0.13146738206233943, 0.1375291564755819, 0.2953059867024422, 0.14707465384289567, -0.20471780124882405, -0.07950006343713595, -0.02670108394302202, 0.16494537317476263, 0.03908985453008702, -0.08964736982906646, 0.13494106932529107, 0.35319292215827963, -0.06946918926286426, 0.1499726890917924, -0.2635315028442578, 0.015640317880068765, -0.15988503666876844, -0.15412724039616119, -0.14354193550393438, -0.011623849605464122, -0.11647450690110087, -0.17984575719376814, 0.43813725722332797, 0.2462443087616879, 0.15109653423723737, 0.12002032688028659, 0.3370009801350534, -0.07852927446577021, 0.15339450901444776, 0.043732495241530354, 0.17847045378364396, -0.03026994497261264, 0.107572271136186, -0.20158526963328546, 0.08660313431173564, 0.08391115068260467]
|
1,803.07193
|
Idiosyncratic choice bias in decision tasks naturally emerges from
neuronal network dynamics
|
Idiosyncratic tendency to choose one alternative over others in the absence
of an identified reason, is a common observation in two-alternative
forced-choice experiments. It is tempting to account for it as resulting from
the (unknown) participant-specific history and thus treat it as a measurement
noise. Indeed, idiosyncratic choice biases are typically considered as
nuisance. Care is taken to account for them by adding an ad-hoc bias parameter
or by counterbalancing the choices to average them out. Here we quantify
idiosyncratic choice biases in a perceptual discrimination task and a motor
task. We report substantial and significant biases in both cases. Then, we
present theoretical evidence that even in idealized experiments, in which the
settings are symmetric, idiosyncratic choice bias is expected to emerge from
the dynamics of competing neuronal networks. We thus argue that idiosyncratic
choice bias reflects the microscopic dynamics of choice and therefore is
virtually inevitable in any comparison or decision task.
|
q-bio.NC
|
idiosyncratic tendency to choose one alternative over others in the absence of an identified reason is a common observation in twoalternative forcedchoice experiments it is tempting to account for it as resulting from the unknown participantspecific history and thus treat it as a measurement noise indeed idiosyncratic choice biases are typically considered as nuisance care is taken to account for them by adding an adhoc bias parameter or by counterbalancing the choices to average them out here we quantify idiosyncratic choice biases in a perceptual discrimination task and a motor task we report substantial and significant biases in both cases then we present theoretical evidence that even in idealized experiments in which the settings are symmetric idiosyncratic choice bias is expected to emerge from the dynamics of competing neuronal networks we thus argue that idiosyncratic choice bias reflects the microscopic dynamics of choice and therefore is virtually inevitable in any comparison or decision task
|
[['idiosyncratic', 'tendency', 'to', 'choose', 'one', 'alternative', 'over', 'others', 'in', 'the', 'absence', 'of', 'an', 'identified', 'reason', 'is', 'a', 'common', 'observation', 'in', 'twoalternative', 'forcedchoice', 'experiments', 'it', 'is', 'tempting', 'to', 'account', 'for', 'it', 'as', 'resulting', 'from', 'the', 'unknown', 'participantspecific', 'history', 'and', 'thus', 'treat', 'it', 'as', 'a', 'measurement', 'noise', 'indeed', 'idiosyncratic', 'choice', 'biases', 'are', 'typically', 'considered', 'as', 'nuisance', 'care', 'is', 'taken', 'to', 'account', 'for', 'them', 'by', 'adding', 'an', 'adhoc', 'bias', 'parameter', 'or', 'by', 'counterbalancing', 'the', 'choices', 'to', 'average', 'them', 'out', 'here', 'we', 'quantify', 'idiosyncratic', 'choice', 'biases', 'in', 'a', 'perceptual', 'discrimination', 'task', 'and', 'a', 'motor', 'task', 'we', 'report', 'substantial', 'and', 'significant', 'biases', 'in', 'both', 'cases', 'then', 'we', 'present', 'theoretical', 'evidence', 'that', 'even', 'in', 'idealized', 'experiments', 'in', 'which', 'the', 'settings', 'are', 'symmetric', 'idiosyncratic', 'choice', 'bias', 'is', 'expected', 'to', 'emerge', 'from', 'the', 'dynamics', 'of', 'competing', 'neuronal', 'networks', 'we', 'thus', 'argue', 'that', 'idiosyncratic', 'choice', 'bias', 'reflects', 'the', 'microscopic', 'dynamics', 'of', 'choice', 'and', 'therefore', 'is', 'virtually', 'inevitable', 'in', 'any', 'comparison', 'or', 'decision', 'task']]
|
[-0.08900197653414367, 0.09857730511685549, -0.08422291020911138, 0.11993112905909513, -0.13277651121924547, -0.1654007796609363, 0.09156920641582073, 0.4478257449174469, -0.23986233495381454, -0.33795421671533543, 0.08530246924008726, -0.2484844438913097, -0.18118252413794883, 0.1423165460764249, -0.10777325578360492, -0.018747584715896805, 0.07360739931433957, 0.008201503124565804, 0.005247665951693696, -0.22153828850820323, 0.29392526769638666, 0.07560435698561177, 0.2743230193011257, 0.018045085963079487, 0.09580206210394662, 0.0059907907342641046, -0.07239836528322768, 0.05038829259023283, -0.07296750595683138, 0.025958924504396106, 0.29486883109943435, 0.11033486093881285, 0.35682766484822354, -0.397555018212743, -0.21372504610350573, 0.13223574537324248, 0.12846510323949836, 0.12819725324553982, -0.021893677718985777, -0.26112920380886884, 0.024279687956562143, -0.17855191361703365, -0.08384092683698256, -0.10984414645361823, 0.032482544797799225, -0.025559789353343597, -0.2831710324601524, 0.09989942130201811, 0.08608277379414188, 0.04349623277614063, -0.04329847033262591, -0.11781990615191398, 0.010853648149444685, 0.17391372858486198, 0.11451689916959201, 0.008215860088730787, 0.1647419621200337, -0.1597784362346321, -0.10000957712280116, 0.39295454528303697, -0.022536934885595526, -0.24410205473669794, 0.17546362070481644, -0.09575764503626322, -0.1512116099308644, 0.08991872388022867, 0.14323211817128292, 0.03374211102506364, -0.16293033624261424, -0.0004776268456639214, 0.013871338549931837, 0.19097129018696074, 0.035914599030677764, -0.0011605146951828298, 0.18873542905543242, 0.1596138525237148, 0.052280656517144634, 0.09746401874626709, -0.06833772172330418, -0.11488399217086663, -0.29458446020726115, -0.0941913465855117, -0.1385299709909777, 0.07173103280365467, -0.08703301529522514, -0.14339167208640607, 0.34253015565117456, 0.22443964422904197, 0.1910731639295768, 0.011059886188164668, 0.3119509797482812, 0.07183553082883576, 0.06972567396927867, 0.004082169647966572, 0.2262502744818082, 0.036531567791259136, 0.0271160221082618, -0.20056784388990226, 0.18334042587523142, -0.08241073065739754]
|
1,803.07194
|
On the standing waves of the NLS-log equation with point interaction on
a star graph
|
We study a nonlinear Schr\"odinger equation with logarithmic nonlinearity on
a star graph $\mathcal{G}$. At the vertex an interaction occurs described by a
boundary condition of delta type with strength $\alpha\in \mathbb{R}$. We
investigate orbital stability and spectral instability of the standing wave
solutions $e^{i\omega t}\mathbf{\Phi}(x)$ to the equation when the profile
$\mathbf\Phi(x)$ has mixed structure (i.e. has bumps and tails). In our
approach we essentially use the extension theory of symmetric operators by
Krein - von Neumann, and the analytic perturbations theory.
|
math.SP
|
we study a nonlinear schrodinger equation with logarithmic nonlinearity on a star graph mathcalg at the vertex an interaction occurs described by a boundary condition of delta type with strength alphain mathbbr we investigate orbital stability and spectral instability of the standing wave solutions eiomega tmathbfphix to the equation when the profile mathbfphix has mixed structure ie has bumps and tails in our approach we essentially use the extension theory of symmetric operators by krein von neumann and the analytic perturbations theory
|
[['we', 'study', 'a', 'nonlinear', 'schrodinger', 'equation', 'with', 'logarithmic', 'nonlinearity', 'on', 'a', 'star', 'graph', 'mathcalg', 'at', 'the', 'vertex', 'an', 'interaction', 'occurs', 'described', 'by', 'a', 'boundary', 'condition', 'of', 'delta', 'type', 'with', 'strength', 'alphain', 'mathbbr', 'we', 'investigate', 'orbital', 'stability', 'and', 'spectral', 'instability', 'of', 'the', 'standing', 'wave', 'solutions', 'eiomega', 'tmathbfphix', 'to', 'the', 'equation', 'when', 'the', 'profile', 'mathbfphix', 'has', 'mixed', 'structure', 'ie', 'has', 'bumps', 'and', 'tails', 'in', 'our', 'approach', 'we', 'essentially', 'use', 'the', 'extension', 'theory', 'of', 'symmetric', 'operators', 'by', 'krein', 'von', 'neumann', 'and', 'the', 'analytic', 'perturbations', 'theory']]
|
[-0.17509577036835253, 0.08617856866494548, -0.10346746009890921, 0.05776272080547642, -0.10053581418760586, -0.1441766838368494, -0.038122848492275804, 0.32096268159511965, -0.2757380498573184, -0.19992189537733793, 0.10127396195748588, -0.310392054496333, -0.15024101929739117, 0.11134345593018224, -0.015338376043655445, 0.06902602332411334, 0.060415031597949566, 0.0648915368699818, -0.07923075234721182, -0.1529233101686259, 0.40952592752873895, -0.030841542629059405, 0.19632706267293543, 0.050161942117847504, 0.06865063885343262, 0.005776429234538227, 0.0349029569675622, 0.007894382812082767, -0.22721108854166233, 0.04196499766258057, 0.1717919448228713, 0.060365271545015274, 0.31629642942280045, -0.42528331371722744, -0.2539154865429737, 0.10615391454193741, 0.12187074712710455, 0.06677321214810945, -0.028924400378309657, -0.3198894591245335, 0.05806022983742878, -0.16816476695094024, -0.22089475783286616, -0.005428115342510864, 0.07530840781982988, 0.025370185633073562, -0.3063008851699124, 0.1390310868911911, 0.09542006994597614, 0.030323334701824932, -0.1236677262291778, -0.028240618697600438, -0.062171551483334045, -0.008240322612618912, 0.00892475277360063, 0.03990173804049846, 0.033598137536318975, -0.12862723404541612, -0.07971137871500104, 0.34050895371765366, -0.12857114844373427, -0.22241547133307904, 0.12337629202520475, -0.16996875126205852, -0.0587407554150559, 0.07158671343058813, 0.12069172412593616, 0.13810184869216754, -0.0782774024630271, 0.1887474256663154, -0.01914654900738242, 0.1540020908418228, 0.13425334697822108, 0.01022183353852597, 0.12057036826154217, 0.1162402843212476, 0.0974875173997134, 0.14218288323609157, -0.017241200065473094, -0.0902725273539545, -0.3320053024683148, -0.07868215930648148, -0.1554179004393518, 0.09731029279409995, -0.12001269723932637, -0.2128318368049804, 0.425719685072545, 0.05775655735051259, 0.15083763905568048, 0.03513288752874359, 0.2000823135196697, 0.23083445995143848, 0.022134685487253593, 0.08108702983590774, 0.1833659931551665, 0.2267837863706518, 0.0971207295282511, -0.28180080016318243, 0.007198205051827245, 0.1483719962183386]
|
1,803.07195
|
Adaptive Polar Active Contour for Segmentation and Tracking in
Ultrasound Videos
|
Detection of relative changes in circulating blood volume is important to
guide resuscitation and manage a variety of medical conditions including
sepsis, trauma, dialysis and congestive heart failure. Recent studies have
shown that estimates of circulating blood volume can be obtained from the
cross-sectional area (CSA) of the internal jugular vein (IJV) from ultrasound
images. However, accurate segmentation and tracking of the IJV in ultrasound
imaging is a challenging task and is significantly influenced by a number of
parameters such as the image quality, shape, and temporal variation. In this
paper, we propose a novel adaptive polar active contour (Ad-PAC) algorithm for
the segmentation and tracking of the IJV in ultrasound videos. In the proposed
algorithm, the parameters of the Ad-PAC algorithm are adapted based on the
results of segmentation in previous frames. The Ad-PAC algorithm is applied to
65 ultrasound videos captured from 13 healthy subjects, with each video
containing 450 frames. The results show that spatial and temporal adaptation of
the energy function significantly improves segmentation performance when
compared to current state-of-the-art active contour algorithms.
|
eess.IV cs.CV
|
detection of relative changes in circulating blood volume is important to guide resuscitation and manage a variety of medical conditions including sepsis trauma dialysis and congestive heart failure recent studies have shown that estimates of circulating blood volume can be obtained from the crosssectional area csa of the internal jugular vein ijv from ultrasound images however accurate segmentation and tracking of the ijv in ultrasound imaging is a challenging task and is significantly influenced by a number of parameters such as the image quality shape and temporal variation in this paper we propose a novel adaptive polar active contour adpac algorithm for the segmentation and tracking of the ijv in ultrasound videos in the proposed algorithm the parameters of the adpac algorithm are adapted based on the results of segmentation in previous frames the adpac algorithm is applied to 65 ultrasound videos captured from 13 healthy subjects with each video containing 450 frames the results show that spatial and temporal adaptation of the energy function significantly improves segmentation performance when compared to current stateoftheart active contour algorithms
|
[['detection', 'of', 'relative', 'changes', 'in', 'circulating', 'blood', 'volume', 'is', 'important', 'to', 'guide', 'resuscitation', 'and', 'manage', 'a', 'variety', 'of', 'medical', 'conditions', 'including', 'sepsis', 'trauma', 'dialysis', 'and', 'congestive', 'heart', 'failure', 'recent', 'studies', 'have', 'shown', 'that', 'estimates', 'of', 'circulating', 'blood', 'volume', 'can', 'be', 'obtained', 'from', 'the', 'crosssectional', 'area', 'csa', 'of', 'the', 'internal', 'jugular', 'vein', 'ijv', 'from', 'ultrasound', 'images', 'however', 'accurate', 'segmentation', 'and', 'tracking', 'of', 'the', 'ijv', 'in', 'ultrasound', 'imaging', 'is', 'a', 'challenging', 'task', 'and', 'is', 'significantly', 'influenced', 'by', 'a', 'number', 'of', 'parameters', 'such', 'as', 'the', 'image', 'quality', 'shape', 'and', 'temporal', 'variation', 'in', 'this', 'paper', 'we', 'propose', 'a', 'novel', 'adaptive', 'polar', 'active', 'contour', 'adpac', 'algorithm', 'for', 'the', 'segmentation', 'and', 'tracking', 'of', 'the', 'ijv', 'in', 'ultrasound', 'videos', 'in', 'the', 'proposed', 'algorithm', 'the', 'parameters', 'of', 'the', 'adpac', 'algorithm', 'are', 'adapted', 'based', 'on', 'the', 'results', 'of', 'segmentation', 'in', 'previous', 'frames', 'the', 'adpac', 'algorithm', 'is', 'applied', 'to', '65', 'ultrasound', 'videos', 'captured', 'from', '13', 'healthy', 'subjects', 'with', 'each', 'video', 'containing', '450', 'frames', 'the', 'results', 'show', 'that', 'spatial', 'and', 'temporal', 'adaptation', 'of', 'the', 'energy', 'function', 'significantly', 'improves', 'segmentation', 'performance', 'when', 'compared', 'to', 'current', 'stateoftheart', 'active', 'contour', 'algorithms']]
|
[-0.03560990831449017, 0.05056491161244106, -0.05766330715163616, 0.00907798333417119, -0.055502693195127496, -0.10540714404298424, -0.004250920102089686, 0.4127929367040847, -0.20361175016884162, -0.3366514479525724, 0.11988664346768148, -0.25412692204854415, -0.18539742522972957, 0.23939221754333392, -0.20979166929057594, 0.0837061526783279, 0.13271822152385687, 0.08157157042789888, -0.0004736925712076284, -0.22946603824634443, 0.20692086046019642, 0.048759743351605066, 0.3704566912315154, 0.035933897230711026, 0.13884780346415937, 0.02002746853411808, -0.08170869136965797, 0.04314219488073035, -0.09444987919948808, 0.1488657871937122, 0.30172914755925284, 0.16233028028631258, 0.29887238222484785, -0.40419154737071045, -0.24556300758731442, 0.05063756950473213, 0.15832879203029693, 0.0927246793220609, -0.05451764829264754, -0.34724960737140836, 0.09227727148892348, -0.1175416528607724, -0.018866932411588686, -0.052304124891084464, -0.008258324594626276, 0.026538719582939678, -0.28971414229080167, 0.13231911825405507, 0.0035115930419576374, 0.10618740993178329, -0.12061924467489418, -0.08422165089497333, 0.013417086079927152, 0.18945258103773435, 0.05323497627353385, 0.09720260652550365, 0.21277767862061744, -0.20366112720142354, -0.10523618840859772, 0.3581706759556707, -0.01894097395325448, -0.19079489541953, 0.19472951247056913, -0.10576109598669628, -0.09112868167717789, 0.19886782451264434, 0.20656362687905797, 0.14048271471013626, -0.13332272903366596, -0.03323090349233283, -0.00424160654945983, 0.18091922162868881, 0.11671046801384981, -0.02332061822236763, 0.12813201156907877, 0.2358039638295896, 0.016949309330791404, 0.13818405780416393, -0.20429518425147875, -0.006615417951581168, -0.19048521131024523, -0.12562804274308023, -0.1397146093132932, -0.05979631685896508, -0.09459235793774445, -0.13943010964019797, 0.4195888894425947, 0.20109410850478515, 0.17515260537712712, 0.02872853061726243, 0.35903564503805785, -0.0073834286198956565, 0.10259793031076758, 0.03094351193492727, 0.18374755146839566, 0.030493128654911408, 0.13693812836256236, -0.23980850907500392, 0.08137758731471091, 0.07373828117309486]
|
1,803.07196
|
Implantation of Martian materials in the inner solar system by a mega
impact on Mars
|
Observations and meteorites indicate that the Martian materials are
enigmatically distributed within the inner solar system. A mega impact on Mars
creating a Martian hemispheric dichotomy and the Martian moons can potentially
eject Martian materials. A recent work has shown that the mega-impact-induced
debris is potentially captured as the Martian Trojans and implanted in the
asteroid belt. However, the amount, distribution, and composition of the debris
has not been studied. Here, using hydrodynamic simulations, we report that a
large amount of debris ($\sim 1\%$ of Mars' mass), including Martian
crust/mantle and the impactor's materials ($\sim 20:80$), are ejected by a
dichotomy-forming impact, and distributed between $\sim 0.5-3.0$ astronomical
units. Our result indicates that unmelted Martian mantle debris ($\sim 0.02\%$
of Mars' mass) can be the source of Martian Trojans, olivine-rich asteroids in
the Hungarian region and the main asteroid belt, and some of which even hit
early Earth. A mega impact can naturally implant Martian mantle materials
within the inner solar system.
|
astro-ph.EP astro-ph.IM
|
observations and meteorites indicate that the martian materials are enigmatically distributed within the inner solar system a mega impact on mars creating a martian hemispheric dichotomy and the martian moons can potentially eject martian materials a recent work has shown that the megaimpactinduced debris is potentially captured as the martian trojans and implanted in the asteroid belt however the amount distribution and composition of the debris has not been studied here using hydrodynamic simulations we report that a large amount of debris sim 1 of mars mass including martian crustmantle and the impactors materials sim 2080 are ejected by a dichotomyforming impact and distributed between sim 0530 astronomical units our result indicates that unmelted martian mantle debris sim 002 of mars mass can be the source of martian trojans olivinerich asteroids in the hungarian region and the main asteroid belt and some of which even hit early earth a mega impact can naturally implant martian mantle materials within the inner solar system
|
[['observations', 'and', 'meteorites', 'indicate', 'that', 'the', 'martian', 'materials', 'are', 'enigmatically', 'distributed', 'within', 'the', 'inner', 'solar', 'system', 'a', 'mega', 'impact', 'on', 'mars', 'creating', 'a', 'martian', 'hemispheric', 'dichotomy', 'and', 'the', 'martian', 'moons', 'can', 'potentially', 'eject', 'martian', 'materials', 'a', 'recent', 'work', 'has', 'shown', 'that', 'the', 'megaimpactinduced', 'debris', 'is', 'potentially', 'captured', 'as', 'the', 'martian', 'trojans', 'and', 'implanted', 'in', 'the', 'asteroid', 'belt', 'however', 'the', 'amount', 'distribution', 'and', 'composition', 'of', 'the', 'debris', 'has', 'not', 'been', 'studied', 'here', 'using', 'hydrodynamic', 'simulations', 'we', 'report', 'that', 'a', 'large', 'amount', 'of', 'debris', 'sim', '1', 'of', 'mars', 'mass', 'including', 'martian', 'crustmantle', 'and', 'the', 'impactors', 'materials', 'sim', '2080', 'are', 'ejected', 'by', 'a', 'dichotomyforming', 'impact', 'and', 'distributed', 'between', 'sim', '0530', 'astronomical', 'units', 'our', 'result', 'indicates', 'that', 'unmelted', 'martian', 'mantle', 'debris', 'sim', '002', 'of', 'mars', 'mass', 'can', 'be', 'the', 'source', 'of', 'martian', 'trojans', 'olivinerich', 'asteroids', 'in', 'the', 'hungarian', 'region', 'and', 'the', 'main', 'asteroid', 'belt', 'and', 'some', 'of', 'which', 'even', 'hit', 'early', 'earth', 'a', 'mega', 'impact', 'can', 'naturally', 'implant', 'martian', 'mantle', 'materials', 'within', 'the', 'inner', 'solar', 'system']]
|
[-0.06786127317670285, 0.24578408556666131, -0.08935897781136387, 0.04143836770480781, -0.029744506642646804, 0.04459994408019076, -0.001636204421756011, 0.3021140135426805, -0.2040217101479633, -0.40004170280468615, 0.11627720178051887, -0.31464070667618815, -0.11905701689516442, 0.21040803036664293, -0.13714512527932832, 0.03447643675711713, 0.17865352823599417, -0.10258583282709971, 0.009084460250384917, -0.22762539232211612, 0.18951741455246612, 0.13407779596687022, 0.045249629580073905, 0.054708493416657365, 0.09631823893648254, -0.16952372573336727, 0.056414449923447796, -0.08724923437767768, -0.15645614465130522, 0.08949963750223382, 0.24680374849063072, 0.13404791975169902, 0.2000978295669207, -0.5052333517424479, -0.27939389488082145, 0.0412704081354144, 0.11186785028681537, -0.01503491710025605, -0.08783040686489872, -0.2727330062108091, 0.08048755040722369, -0.27518558542279503, -0.13641081369316937, 0.08777405742166823, 0.07488183673659835, -0.015883023237597337, -0.2543469304012583, 0.052934238109501854, 0.06764166322654655, 0.15580919955244077, -0.19964501988791117, -0.19481478606887115, -0.11795402602793625, 0.08526990729416543, 0.10064489472656706, -0.03075682258976128, 0.2847780236043036, -0.01975137898934227, 0.047622925637266306, 0.44646059088644724, -0.0680124727696699, 0.005408848718374591, 0.24765109902843124, -0.2206829458186285, -0.09040453995259691, 0.17428032758563192, 0.20385880102816073, 0.10133515736839699, -0.1642459022187734, 0.026316001109448792, -0.09183696686301994, 0.19925255141268142, 0.10882211794569806, 0.025368549141891395, 0.3776842570934397, 0.175671712342131, 0.042281983785708493, 0.054419451059414, -0.2520469890250176, -0.051780743085664306, -0.15423231829500086, -0.17980006697611248, -0.19038629582847316, 0.009551444882324372, -0.1140032154618456, -0.12496128243072212, 0.3570399601719802, 0.17952097484936255, 0.1573217312151071, -0.01939629422297371, 0.2846010349620181, -0.06428398548174484, 0.13303436978448985, 0.1406654528757746, 0.3361498474512217, 0.051737046066695186, 0.11762955729979314, -0.19610288743625243, 0.20573576381267933, -0.015504004660687304]
|
1,803.07197
|
Family of Sachdev-Ye-Kitaev models motivated by experimental
considerations
|
Several condensed-matter platforms have been proposed recently to realize the
Sachdev-Ye-Kitaev (SYK) model in their low-energy limit. In these proposed
realizations, the characteristic SYK behavior is expected to occur under
certain assumptions about the underlying physical system that (i) render all
bilinear terms small compared to four-fermion interactions and (ii) ensure that
the coupling constants are approximately all-to-all and independent random
variables. In this work we explore, both analytically and numerically, the
family of models that arises when we relax these assumptions in ways motivated
by real physical systems. By relaxing (i) and allowing large bilinear terms, we
obtain a novel, exactly-solvable cousin of the SYK model. It exhibits two
distinct phases separated by a quantum phase transition characterized by a
power-law, $\sim |\omega|^{-1/3}$ scaling of the low-energy spectral density,
despite being a non-interacting model. By relaxing (ii), we obtain close
relatives of the SYK model which exhibit interesting behaviors, including a
chaotic non-Fermi liquid phase with continuously varying fermion scaling
dimension, and a phase transition to a disordered Fermi liquid as a function of
interaction range and disorder length scale.
|
cond-mat.str-el cond-mat.supr-con
|
several condensedmatter platforms have been proposed recently to realize the sachdevyekitaev syk model in their lowenergy limit in these proposed realizations the characteristic syk behavior is expected to occur under certain assumptions about the underlying physical system that i render all bilinear terms small compared to fourfermion interactions and ii ensure that the coupling constants are approximately alltoall and independent random variables in this work we explore both analytically and numerically the family of models that arises when we relax these assumptions in ways motivated by real physical systems by relaxing i and allowing large bilinear terms we obtain a novel exactlysolvable cousin of the syk model it exhibits two distinct phases separated by a quantum phase transition characterized by a powerlaw sim omega13 scaling of the lowenergy spectral density despite being a noninteracting model by relaxing ii we obtain close relatives of the syk model which exhibit interesting behaviors including a chaotic nonfermi liquid phase with continuously varying fermion scaling dimension and a phase transition to a disordered fermi liquid as a function of interaction range and disorder length scale
|
[['several', 'condensedmatter', 'platforms', 'have', 'been', 'proposed', 'recently', 'to', 'realize', 'the', 'sachdevyekitaev', 'syk', 'model', 'in', 'their', 'lowenergy', 'limit', 'in', 'these', 'proposed', 'realizations', 'the', 'characteristic', 'syk', 'behavior', 'is', 'expected', 'to', 'occur', 'under', 'certain', 'assumptions', 'about', 'the', 'underlying', 'physical', 'system', 'that', 'i', 'render', 'all', 'bilinear', 'terms', 'small', 'compared', 'to', 'fourfermion', 'interactions', 'and', 'ii', 'ensure', 'that', 'the', 'coupling', 'constants', 'are', 'approximately', 'alltoall', 'and', 'independent', 'random', 'variables', 'in', 'this', 'work', 'we', 'explore', 'both', 'analytically', 'and', 'numerically', 'the', 'family', 'of', 'models', 'that', 'arises', 'when', 'we', 'relax', 'these', 'assumptions', 'in', 'ways', 'motivated', 'by', 'real', 'physical', 'systems', 'by', 'relaxing', 'i', 'and', 'allowing', 'large', 'bilinear', 'terms', 'we', 'obtain', 'a', 'novel', 'exactlysolvable', 'cousin', 'of', 'the', 'syk', 'model', 'it', 'exhibits', 'two', 'distinct', 'phases', 'separated', 'by', 'a', 'quantum', 'phase', 'transition', 'characterized', 'by', 'a', 'powerlaw', 'sim', 'omega13', 'scaling', 'of', 'the', 'lowenergy', 'spectral', 'density', 'despite', 'being', 'a', 'noninteracting', 'model', 'by', 'relaxing', 'ii', 'we', 'obtain', 'close', 'relatives', 'of', 'the', 'syk', 'model', 'which', 'exhibit', 'interesting', 'behaviors', 'including', 'a', 'chaotic', 'nonfermi', 'liquid', 'phase', 'with', 'continuously', 'varying', 'fermion', 'scaling', 'dimension', 'and', 'a', 'phase', 'transition', 'to', 'a', 'disordered', 'fermi', 'liquid', 'as', 'a', 'function', 'of', 'interaction', 'range', 'and', 'disorder', 'length', 'scale']]
|
[-0.14454663499517018, 0.22540874622546095, -0.059153345268469264, 0.0747886669014205, -0.026514769617248794, -0.22595840605176493, 0.045362514556894974, 0.3277078900815538, -0.23979397144590542, -0.29199440596697246, 0.0624027574609821, -0.28348171161114655, -0.20118250589933856, 0.13725916718683354, 0.011247087519574725, 0.05429229313682621, -0.03630624873723155, -0.01915555346618247, -0.11399527539715212, -0.21869454460375484, 0.3213375608957095, 0.0038181677716655543, 0.26273064404849517, 0.029802488202669078, 0.07604784660751401, -0.02529491349226327, 0.07007156112919516, 0.01586743590591774, -0.13507070069683513, 0.048242524142752694, 0.21332249268163037, 0.004025488746124487, 0.1894685862693956, -0.4071168783095084, -0.24474052095898938, 0.12612105011219643, 0.14986018145853108, 0.08878615163253795, -0.02221322863090022, -0.29112220024021124, 0.030575016711565834, -0.2077425344916606, -0.17281226907697253, -0.13029458499333477, 0.00658431726260862, -0.005210102996621693, -0.267538542555676, 0.08782514444814779, 0.0496165702931161, 0.04618871106138422, -0.029684640105700544, -0.0789376541358568, 0.009187074645695107, 0.08066389061017246, 0.08032969827319542, -0.023200145050451076, 0.1149235643955843, -0.1506693805426421, -0.09074816590198187, 0.3785478196692787, -0.0676369891098047, -0.1624603097260163, 0.24290170092958938, -0.12989328374183487, -0.13396333744852335, 0.12143991140967739, 0.1242061916697585, 0.047540161660898125, -0.1584728901414876, 0.13525166490966795, -0.05218676124501315, 0.15884304745058472, 0.018303550441507558, 0.09838822976240981, 0.23203311372903376, 0.17264364948316133, 0.0020123837497702784, 0.1464049688815599, -0.023060519798808004, -0.1761003828180429, -0.26720772370521123, -0.10070665743046321, -0.22209481748389542, 0.07241132669086511, -0.1324149566165169, -0.17083498667050873, 0.43110766805173284, 0.17616506622144593, 0.2487045503195725, 0.05396817402736649, 0.19749855890597387, 0.12670410970336557, 0.048066796370890015, 0.060313324894220956, 0.22304376135631696, 0.1099424737625246, 0.0748845331592084, -0.22654961584166763, 0.028989073979920444, 0.06478424480529657]
|
1,803.07198
|
Transmission matrix approaches for non-linear fluorescence excitation
through multiple scattering media
|
Several matrix approaches were developed to control light propagation through
multiple scattering media under illumination of ultrashort pulses of light.
These matrices can be recorded either with spectral or temporal resolution.
Thanks to wavefront shaping, temporal and spatial refocusing have been
demonstrated. In this work, we study how these different methods can be
exploited to enhance a two-photon excitation fluorescence process. We first
compare the different techniques on micrometer-size isolated fluorescent beads.
We then demonstrate point-scanning imaging of such fluorescent microbeads
located after a thick scattering medium, at a depth where conventional imaging
would be impossible because of scattering effects.
|
physics.optics
|
several matrix approaches were developed to control light propagation through multiple scattering media under illumination of ultrashort pulses of light these matrices can be recorded either with spectral or temporal resolution thanks to wavefront shaping temporal and spatial refocusing have been demonstrated in this work we study how these different methods can be exploited to enhance a twophoton excitation fluorescence process we first compare the different techniques on micrometersize isolated fluorescent beads we then demonstrate pointscanning imaging of such fluorescent microbeads located after a thick scattering medium at a depth where conventional imaging would be impossible because of scattering effects
|
[['several', 'matrix', 'approaches', 'were', 'developed', 'to', 'control', 'light', 'propagation', 'through', 'multiple', 'scattering', 'media', 'under', 'illumination', 'of', 'ultrashort', 'pulses', 'of', 'light', 'these', 'matrices', 'can', 'be', 'recorded', 'either', 'with', 'spectral', 'or', 'temporal', 'resolution', 'thanks', 'to', 'wavefront', 'shaping', 'temporal', 'and', 'spatial', 'refocusing', 'have', 'been', 'demonstrated', 'in', 'this', 'work', 'we', 'study', 'how', 'these', 'different', 'methods', 'can', 'be', 'exploited', 'to', 'enhance', 'a', 'twophoton', 'excitation', 'fluorescence', 'process', 'we', 'first', 'compare', 'the', 'different', 'techniques', 'on', 'micrometersize', 'isolated', 'fluorescent', 'beads', 'we', 'then', 'demonstrate', 'pointscanning', 'imaging', 'of', 'such', 'fluorescent', 'microbeads', 'located', 'after', 'a', 'thick', 'scattering', 'medium', 'at', 'a', 'depth', 'where', 'conventional', 'imaging', 'would', 'be', 'impossible', 'because', 'of', 'scattering', 'effects']]
|
[-0.03081613278016448, 0.16328397720120846, -0.11683871687855571, 0.03987807125968175, -0.03846153925638646, -0.15017503172624858, -0.03790832788683474, 0.5458046170696617, -0.2917848166776821, -0.30399777098093184, 0.10157745474367402, -0.2714422716060653, -0.1485324583039619, 0.1938686338509433, -0.046797075513750314, 0.09810527867928613, 0.05250183901109267, -0.06292753552086651, -0.02554276507929899, -0.1715542259439826, 0.26660377441439775, 0.03619507141178474, 0.29895061659626665, 0.08116879890847485, 0.10780947278253734, 0.06397607034537942, -0.03218953612726182, -0.010795626351609825, -0.04849211920052767, 0.0948836422408931, 0.25936954602599144, 0.08927075405721553, 0.21389074614271522, -0.523221784979105, -0.2912094691162929, 0.09932306532748043, 0.24268024503719063, 0.1293532738718204, -0.061603930917335674, -0.3060445644147694, 0.04236214735079557, -0.08151346565224231, -0.12030278824502602, -0.05808303564088419, -0.05682162234093994, 0.04918400481110439, -0.26450677240383813, 0.005160802900791168, -0.02286278898594901, 0.06749169959686696, -0.01995166202541441, -0.035963450381532314, 0.0352819641167298, 0.10703634451841935, 0.001279830028943252, -0.039230863305274394, 0.1791088569466956, -0.10575400010449812, -0.10429103187751025, 0.3231422866135836, -0.06776761061046273, -0.1273359500337392, 0.2234150121314451, -0.15735186545265606, -0.04784535883576609, 0.2169537802413106, 0.20617472667363473, 0.1710927142482251, -0.1835020765628724, -0.02617348665429745, 0.004463048225734383, 0.24746067913947628, 0.17665468890219926, 0.10172591621987521, 0.19135279939509928, 0.19825840942561626, -0.030572290213312953, 0.12305088726920076, -0.19912978534353898, 0.013443857692182063, -0.1708459313638741, -0.10872376047074794, -0.14834582565817983, 0.07142266606213525, -0.04733105099978275, -0.10692257188260555, 0.3603537243232131, 0.18749796533957125, 0.1650338457711041, -0.037471375279128555, 0.35158365447074175, 0.09355445087188854, 0.08249176928773522, -0.028746860448736696, 0.26579901891411284, 0.13583934638823847, 0.10829340572468936, -0.22704682100797072, 0.029287125351838767, -0.027866668328642846]
|
1,803.07199
|
Twelve Simple Algorithms to Compute Fibonacci Numbers
|
The Fibonacci numbers are a sequence of integers in which every number after
the first two, 0 and 1, is the sum of the two preceding numbers. These numbers
are well known and algorithms to compute them are so easy that they are often
used in introductory algorithms courses. In this paper, we present twelve of
these well-known algorithms and some of their properties. These algorithms,
though very simple, illustrate multiple concepts from the algorithms field, so
we highlight them. We also present the results of a small-scale experimental
comparison of their runtimes on a personal laptop. Finally, we provide a list
of homework questions for the students. We hope that this paper can serve as a
useful resource for the students learning the basics of algorithms.
|
cs.DS
|
the fibonacci numbers are a sequence of integers in which every number after the first two 0 and 1 is the sum of the two preceding numbers these numbers are well known and algorithms to compute them are so easy that they are often used in introductory algorithms courses in this paper we present twelve of these wellknown algorithms and some of their properties these algorithms though very simple illustrate multiple concepts from the algorithms field so we highlight them we also present the results of a smallscale experimental comparison of their runtimes on a personal laptop finally we provide a list of homework questions for the students we hope that this paper can serve as a useful resource for the students learning the basics of algorithms
|
[['the', 'fibonacci', 'numbers', 'are', 'a', 'sequence', 'of', 'integers', 'in', 'which', 'every', 'number', 'after', 'the', 'first', 'two', '0', 'and', '1', 'is', 'the', 'sum', 'of', 'the', 'two', 'preceding', 'numbers', 'these', 'numbers', 'are', 'well', 'known', 'and', 'algorithms', 'to', 'compute', 'them', 'are', 'so', 'easy', 'that', 'they', 'are', 'often', 'used', 'in', 'introductory', 'algorithms', 'courses', 'in', 'this', 'paper', 'we', 'present', 'twelve', 'of', 'these', 'wellknown', 'algorithms', 'and', 'some', 'of', 'their', 'properties', 'these', 'algorithms', 'though', 'very', 'simple', 'illustrate', 'multiple', 'concepts', 'from', 'the', 'algorithms', 'field', 'so', 'we', 'highlight', 'them', 'we', 'also', 'present', 'the', 'results', 'of', 'a', 'smallscale', 'experimental', 'comparison', 'of', 'their', 'runtimes', 'on', 'a', 'personal', 'laptop', 'finally', 'we', 'provide', 'a', 'list', 'of', 'homework', 'questions', 'for', 'the', 'students', 'we', 'hope', 'that', 'this', 'paper', 'can', 'serve', 'as', 'a', 'useful', 'resource', 'for', 'the', 'students', 'learning', 'the', 'basics', 'of', 'algorithms']]
|
[-0.10060180462970156, 0.09426222812553031, -0.09694143321262452, 0.12128364377541423, -0.09652110310931375, -0.13992390845073607, 0.05625169468937281, 0.4417603096272063, -0.2728356823515822, -0.3604556787612401, 0.1119768506871155, -0.2530920848866382, -0.2089963134260863, 0.2500915457971218, -0.08425123354706063, 0.047811272529349844, 0.08255628628406937, 0.07436450259731606, -0.060721403010754196, -0.34431660932114744, 0.3060307965621235, 0.00273752228657561, 0.1896162623334236, 0.040103102014876726, 0.041596236356394735, -0.0633161848344048, -0.04856368244119634, 0.04124714341747949, -0.12336927732165379, 0.14480232308787389, 0.31093872625263425, 0.20451337025330335, 0.3484773317619601, -0.43672225619441696, -0.09334244360362627, 0.08413806807077454, 0.14842787915180752, 0.13771141286275723, -0.04979609133855359, -0.24281095816409143, 0.10417191378174599, -0.15343109127152418, -0.0562139786706548, -0.10774278238151722, -0.020925251311461227, 0.10266980049970346, -0.2139453636106529, -0.011974821295946705, 0.06343212853942991, 0.08307853606932862, -0.011419108467484554, -0.19763836218227493, 0.07618898213621024, 0.19100021983782842, 0.06230972217960562, -0.04433324054895541, 0.07214153108808513, -0.1375409177592479, -0.1854217870923595, 0.39716533564148454, 0.02522950460831818, -0.17259305300865704, 0.21154169745167614, -0.08910465106280066, -0.19092286357245458, 0.06509908280284034, 0.174945655352194, 0.1499765240403963, -0.12118694325542356, 0.02997631519734053, -0.06033022718240074, 0.12301665429377884, 0.03147345284132037, 0.03792121836651615, 0.21047650597344233, 0.12227846564373046, 0.004888065883479132, 0.12722340994147863, -0.034973103306017904, -0.04241643943200548, -0.3209387459970945, -0.19352232965120064, -0.16727577316699418, 0.022652278518612224, -0.05415187612522896, -0.140362115111202, 0.41175524344829123, 0.1975925251452883, 0.18216329964435124, 0.1088405032908016, 0.3090163347289318, 0.053422972038351585, 0.025750387190496476, 0.09542244334529176, 0.17510065970521632, 0.09874599869913003, 0.134627855184862, -0.11581208949769282, 0.013629858646043174, 0.03684211424808568]
|
1,803.072
|
Training Recurrent Neural Networks as a Constraint Satisfaction Problem
|
This paper presents a new approach for training artificial neural networks
using techniques for solving the constraint satisfaction problem (CSP). The
quotient gradient system (QGS) is a trajectory-based method for solving the
CSP. This study converts the training set of a neural network into a CSP and
uses the QGS to find its solutions. The QGS finds the global minimum of the
optimization problem by tracking trajectories of a nonlinear dynamical system
and does not stop at a local minimum of the optimization problem. Lyapunov
theory is used to prove the asymptotic stability of the solutions with and
without the presence of measurement errors. Numerical examples illustrate the
effectiveness of the proposed methodology and compare it to a genetic algorithm
and error backpropagation.
|
cs.LG eess.SP stat.ML
|
this paper presents a new approach for training artificial neural networks using techniques for solving the constraint satisfaction problem csp the quotient gradient system qgs is a trajectorybased method for solving the csp this study converts the training set of a neural network into a csp and uses the qgs to find its solutions the qgs finds the global minimum of the optimization problem by tracking trajectories of a nonlinear dynamical system and does not stop at a local minimum of the optimization problem lyapunov theory is used to prove the asymptotic stability of the solutions with and without the presence of measurement errors numerical examples illustrate the effectiveness of the proposed methodology and compare it to a genetic algorithm and error backpropagation
|
[['this', 'paper', 'presents', 'a', 'new', 'approach', 'for', 'training', 'artificial', 'neural', 'networks', 'using', 'techniques', 'for', 'solving', 'the', 'constraint', 'satisfaction', 'problem', 'csp', 'the', 'quotient', 'gradient', 'system', 'qgs', 'is', 'a', 'trajectorybased', 'method', 'for', 'solving', 'the', 'csp', 'this', 'study', 'converts', 'the', 'training', 'set', 'of', 'a', 'neural', 'network', 'into', 'a', 'csp', 'and', 'uses', 'the', 'qgs', 'to', 'find', 'its', 'solutions', 'the', 'qgs', 'finds', 'the', 'global', 'minimum', 'of', 'the', 'optimization', 'problem', 'by', 'tracking', 'trajectories', 'of', 'a', 'nonlinear', 'dynamical', 'system', 'and', 'does', 'not', 'stop', 'at', 'a', 'local', 'minimum', 'of', 'the', 'optimization', 'problem', 'lyapunov', 'theory', 'is', 'used', 'to', 'prove', 'the', 'asymptotic', 'stability', 'of', 'the', 'solutions', 'with', 'and', 'without', 'the', 'presence', 'of', 'measurement', 'errors', 'numerical', 'examples', 'illustrate', 'the', 'effectiveness', 'of', 'the', 'proposed', 'methodology', 'and', 'compare', 'it', 'to', 'a', 'genetic', 'algorithm', 'and', 'error', 'backpropagation']]
|
[-0.11289291034975066, -0.05818276846311926, -0.10017216782941203, 0.0850600797391489, -0.08511596049628849, -0.1394279095490001, 0.08747165035683571, 0.32350367127077245, -0.319270459965356, -0.33051331685023094, 0.11718105350817909, -0.24729708947877332, -0.20358145709444836, 0.19020162157835516, -0.07602055544200224, 0.12703425620779077, 0.11981068080200291, 0.01292553941938814, -0.09063939564687208, -0.273373776813969, 0.30976973347199277, 0.025401227789499412, 0.28515126742611874, -0.008979646027148739, 0.17535537593369563, -0.012426109810367347, 0.0012283351904583898, 0.0384526766062434, -0.07067845491654565, 0.132936992043652, 0.22706992980054905, 0.2324764615859897, 0.3739377742565078, -0.39260618911859224, -0.2166836620497752, 0.1482076117261578, 0.1543306736881292, 0.1401318080072117, -0.05796073056469724, -0.27802907069766425, 0.13398403335529252, -0.12171267098709335, -0.08645327187453707, -0.06352752432742012, -0.03946941739659968, 0.02658369708702165, -0.33473669148118396, 0.04009410701843539, 0.05601418282286779, 0.02697162781804194, -0.08904595180259396, -0.08052795519105847, 0.0034707692712999698, 0.08059298962627243, 0.020856390669336165, 0.0340099320614453, 0.10023740126289488, -0.13150468913126526, -0.13267479188800826, 0.3793885012467702, -0.020248830476510753, -0.2201389575924164, 0.14660409561593116, -0.0016373399289218876, -0.12557616756426368, 0.11992843901905102, 0.23189992590133496, 0.14634058792598365, -0.17722034498261727, 0.07594498815308363, -0.03982700025700638, 0.17818628041058537, -0.00263657708220729, -0.04388636405148157, 0.14626746162454166, 0.2460686970592999, 0.15223003359420634, 0.17935507478783044, -0.07163703184701668, -0.09671673352822541, -0.26285974736651024, -0.1169362498250434, -0.1659274237813443, -0.0003701135140183056, -0.11148851124768058, -0.1661021764185734, 0.4373056606533445, 0.16924738360765745, 0.14841048370259322, 0.17600162697168506, 0.3227639136215051, 0.13991614032408498, 0.05759981220088354, 0.1028192837010857, 0.21342999911848154, 0.1181821282366215, 0.1343396618598845, -0.2825549014993542, 0.06744892339835443, 0.12673614338055494]
|
1,803.07201
|
DYAN: A Dynamical Atoms-Based Network for Video Prediction
|
The ability to anticipate the future is essential when making real time
critical decisions, provides valuable information to understand dynamic natural
scenes, and can help unsupervised video representation learning. State-of-art
video prediction is based on LSTM recursive networks and/or generative
adversarial network learning. These are complex architectures that need to
learn large numbers of parameters, are potentially hard to train, slow to run,
and may produce blurry predictions. In this paper, we introduce DYAN, a novel
network with very few parameters and easy to train, which produces accurate,
high quality frame predictions, significantly faster than previous approaches.
DYAN owes its good qualities to its encoder and decoder, which are designed
following concepts from systems identification theory and exploit the
dynamics-based invariants of the data. Extensive experiments using several
standard video datasets show that DYAN is superior generating frames and that
it generalizes well across domains.
|
cs.CV
|
the ability to anticipate the future is essential when making real time critical decisions provides valuable information to understand dynamic natural scenes and can help unsupervised video representation learning stateofart video prediction is based on lstm recursive networks andor generative adversarial network learning these are complex architectures that need to learn large numbers of parameters are potentially hard to train slow to run and may produce blurry predictions in this paper we introduce dyan a novel network with very few parameters and easy to train which produces accurate high quality frame predictions significantly faster than previous approaches dyan owes its good qualities to its encoder and decoder which are designed following concepts from systems identification theory and exploit the dynamicsbased invariants of the data extensive experiments using several standard video datasets show that dyan is superior generating frames and that it generalizes well across domains
|
[['the', 'ability', 'to', 'anticipate', 'the', 'future', 'is', 'essential', 'when', 'making', 'real', 'time', 'critical', 'decisions', 'provides', 'valuable', 'information', 'to', 'understand', 'dynamic', 'natural', 'scenes', 'and', 'can', 'help', 'unsupervised', 'video', 'representation', 'learning', 'stateofart', 'video', 'prediction', 'is', 'based', 'on', 'lstm', 'recursive', 'networks', 'andor', 'generative', 'adversarial', 'network', 'learning', 'these', 'are', 'complex', 'architectures', 'that', 'need', 'to', 'learn', 'large', 'numbers', 'of', 'parameters', 'are', 'potentially', 'hard', 'to', 'train', 'slow', 'to', 'run', 'and', 'may', 'produce', 'blurry', 'predictions', 'in', 'this', 'paper', 'we', 'introduce', 'dyan', 'a', 'novel', 'network', 'with', 'very', 'few', 'parameters', 'and', 'easy', 'to', 'train', 'which', 'produces', 'accurate', 'high', 'quality', 'frame', 'predictions', 'significantly', 'faster', 'than', 'previous', 'approaches', 'dyan', 'owes', 'its', 'good', 'qualities', 'to', 'its', 'encoder', 'and', 'decoder', 'which', 'are', 'designed', 'following', 'concepts', 'from', 'systems', 'identification', 'theory', 'and', 'exploit', 'the', 'dynamicsbased', 'invariants', 'of', 'the', 'data', 'extensive', 'experiments', 'using', 'several', 'standard', 'video', 'datasets', 'show', 'that', 'dyan', 'is', 'superior', 'generating', 'frames', 'and', 'that', 'it', 'generalizes', 'well', 'across', 'domains']]
|
[-0.04601258362386504, 0.02792954094675851, -0.08745414823060856, 0.1092110098773164, -0.18227370132467358, -0.21646338491540018, -0.0036016156286771957, 0.4861386702556548, -0.2724324379148411, -0.344906917421934, 0.0789298728357294, -0.2539503792878883, -0.2032738238733647, 0.2073201994957595, -0.1632345029345617, 0.09990369437326645, 0.1739247931199598, 0.052324961308100874, -0.06088261325554601, -0.27948852539993824, 0.26032354760722354, 0.08825865457926331, 0.3493862892757973, 0.011251961658227033, 0.12308099201784052, -0.04076358384356416, -0.03368074212319635, -0.024770838720723987, -0.05692985728759407, 0.18828528921665816, 0.34508279879770143, 0.19382769690569618, 0.2898685047081832, -0.45996833671012827, -0.22750666980422904, 0.08077721536673349, 0.13212759789111542, 0.1104720967541778, -0.007892577190369624, -0.3149956310424825, 0.12485810978265864, -0.1428174387792061, 0.005036483671323493, -0.22607192548056101, -0.025001151805165513, 0.007726830282601817, -0.31702798215736605, 0.014909538644333852, 0.038420344934927235, 0.010845805087993885, -0.0281220439500336, -0.09037410710649244, 0.0251429317759928, 0.19240598630999087, 0.05968409036125603, 0.08905918699576809, 0.13932715550000813, -0.16752827351848626, -0.14252608267526173, 0.3806311717963424, -0.0530235723436786, -0.19088495057076216, 0.2595011809945171, -0.043260806163869285, -0.12292255264032503, 0.13014069815519555, 0.22456413560611163, 0.0996097421434162, -0.13963136845318488, -0.03359364431977657, -0.016067686831129007, 0.1958687091952768, 0.036919187030209036, 0.039947654213756324, 0.18681156769402904, 0.24335804445958087, 0.006721626924238457, 0.11321079057986559, -0.09812341945663351, -0.09913594287434785, -0.17839095701688323, -0.07216886833685467, -0.16889750423102542, -0.009679465366784355, -0.11311581264478797, -0.12443468263824391, 0.39396293637310636, 0.27291149133896647, 0.21444504816358073, 0.1421941109272603, 0.3679618961338339, -0.010936070490500023, 0.10653998342117872, 0.08769796872511507, 0.16142772895380342, 0.02344956012956541, 0.14263475100863082, -0.12257501818721407, 0.0978321717795113, 0.01984303887162743]
|
1,803.07202
|
TGMFE Algorithm Combined with Some Time Second-Order Schemes for
Nonlinear Fourth-Order Reaction Diffusion System
|
In this article, a two-grid mixed finite element (TGMFE) method with some
second-order time discrete schemes is developed for numerically solving
nonlinear fourth-order reaction diffusion equation. The two-grid MFE method is
used to approximate spatial direction, and some second-order $\theta$ schemes
formulated at time $t_{k-\theta}$ are considered to discretize the time
direction. TGMFE method covers two main steps: a nonlinear MFE system based on
the space coarse grid is solved by the iterative algorithm and a coarse
solution is arrived at, then a linearized MFE system with fine grid is
considered and a TGMFE solution is obtained. Here, the stability and a priori
error estimates in $L^2$-norm for both nonlinear Galerkin MFE system and TGMFE
scheme are derived. Finally, some convergence results are computed for both
nonlinear Galerkin MFE system and TGMFE scheme to verify our theoretical
analysis, which show that the convergence rate of the time second-order
$\theta$ scheme including Crank-Nicolson scheme and second-order backward
difference scheme is close to $2$, and that with the comparison to the
computing time of nonlinear Galerkin MFE method, the CPU-time by using TGMFE
method can be saved.
|
math.NA
|
in this article a twogrid mixed finite element tgmfe method with some secondorder time discrete schemes is developed for numerically solving nonlinear fourthorder reaction diffusion equation the twogrid mfe method is used to approximate spatial direction and some secondorder theta schemes formulated at time t_ktheta are considered to discretize the time direction tgmfe method covers two main steps a nonlinear mfe system based on the space coarse grid is solved by the iterative algorithm and a coarse solution is arrived at then a linearized mfe system with fine grid is considered and a tgmfe solution is obtained here the stability and a priori error estimates in l2norm for both nonlinear galerkin mfe system and tgmfe scheme are derived finally some convergence results are computed for both nonlinear galerkin mfe system and tgmfe scheme to verify our theoretical analysis which show that the convergence rate of the time secondorder theta scheme including cranknicolson scheme and secondorder backward difference scheme is close to 2 and that with the comparison to the computing time of nonlinear galerkin mfe method the cputime by using tgmfe method can be saved
|
[['in', 'this', 'article', 'a', 'twogrid', 'mixed', 'finite', 'element', 'tgmfe', 'method', 'with', 'some', 'secondorder', 'time', 'discrete', 'schemes', 'is', 'developed', 'for', 'numerically', 'solving', 'nonlinear', 'fourthorder', 'reaction', 'diffusion', 'equation', 'the', 'twogrid', 'mfe', 'method', 'is', 'used', 'to', 'approximate', 'spatial', 'direction', 'and', 'some', 'secondorder', 'theta', 'schemes', 'formulated', 'at', 'time', 't_ktheta', 'are', 'considered', 'to', 'discretize', 'the', 'time', 'direction', 'tgmfe', 'method', 'covers', 'two', 'main', 'steps', 'a', 'nonlinear', 'mfe', 'system', 'based', 'on', 'the', 'space', 'coarse', 'grid', 'is', 'solved', 'by', 'the', 'iterative', 'algorithm', 'and', 'a', 'coarse', 'solution', 'is', 'arrived', 'at', 'then', 'a', 'linearized', 'mfe', 'system', 'with', 'fine', 'grid', 'is', 'considered', 'and', 'a', 'tgmfe', 'solution', 'is', 'obtained', 'here', 'the', 'stability', 'and', 'a', 'priori', 'error', 'estimates', 'in', 'l2norm', 'for', 'both', 'nonlinear', 'galerkin', 'mfe', 'system', 'and', 'tgmfe', 'scheme', 'are', 'derived', 'finally', 'some', 'convergence', 'results', 'are', 'computed', 'for', 'both', 'nonlinear', 'galerkin', 'mfe', 'system', 'and', 'tgmfe', 'scheme', 'to', 'verify', 'our', 'theoretical', 'analysis', 'which', 'show', 'that', 'the', 'convergence', 'rate', 'of', 'the', 'time', 'secondorder', 'theta', 'scheme', 'including', 'cranknicolson', 'scheme', 'and', 'secondorder', 'backward', 'difference', 'scheme', 'is', 'close', 'to', '2', 'and', 'that', 'with', 'the', 'comparison', 'to', 'the', 'computing', 'time', 'of', 'nonlinear', 'galerkin', 'mfe', 'method', 'the', 'cputime', 'by', 'using', 'tgmfe', 'method', 'can', 'be', 'saved']]
|
[-0.10996632168383297, 0.00034256226069334406, -0.1272139642338595, 0.027393987413708364, -0.04254250710769354, -0.18113211124285084, 0.007586026754048045, 0.4098263225111979, -0.32671674072701967, -0.2588635215019483, 0.15038392965494574, -0.21013501925525538, -0.11688310593308415, 0.2067566546516584, -0.03849874700181712, 0.12354525345606658, 0.08578458443061328, -0.02830777690320721, -0.10189863609949774, -0.25986688960983884, 0.2856143646083934, 0.024925564319583707, 0.2734977604957986, 0.011674817469294952, 0.18503877606607325, -0.080773309142387, -0.03675135395884433, 0.06166425852580173, -0.10062906210370547, 0.08490489362410027, 0.23699347435815624, 0.04609302714727718, 0.3129741899193386, -0.37997376638889796, -0.2128613185587987, 0.05441979177861788, 0.14336346463128197, 0.14580482719453436, -0.06399598735215081, -0.2699975747787191, 0.14021326090606517, -0.11228432804953468, -0.14121624298454466, -0.09193340742089988, -0.05983529826018797, 0.0624785579579032, -0.322864584933521, 0.08860557029845001, 0.02392333211584786, 0.025276086930914418, -0.06987324340835861, -0.11375766014553727, 0.010385104878957423, 0.05122006869667372, 0.003385007910369693, 0.010142899754377457, 0.014810338472750078, -0.0024827657047274483, -0.06530694385646316, 0.4061408309448186, -0.08764360166874806, -0.2933859733520481, 0.1186738402997751, -0.0787757611580436, -0.06409979119400858, 0.17966067335446892, 0.18317645631791296, 0.20969966545690905, -0.13405865930278948, 0.08192714374340342, 0.006755003938451409, 0.20661210403499275, 0.03911845475870549, -0.02535004840667724, 0.02239115960875769, 0.1814326857338133, 0.11756931473602257, 0.05168411489664678, -0.06944887754798401, -0.159601092213289, -0.3301640479299037, -0.16193201432875154, -0.20602709138968392, -0.06154046019440537, -0.11566509964873346, -0.14695645805509033, 0.36754579887610817, 0.14206921137899728, 0.08285573690765254, 0.09724090193745012, 0.3357702591684242, 0.21059008248013686, -0.03946747527073097, 0.107339511698861, 0.1911090873357392, 0.14857593370075134, 0.13864176057066527, -0.30360586341197154, 0.04973184074902826, 0.239987959690473]
|
1,803.07203
|
Glassy Dynamics in a heavy ion irradiated NbSe2 crystal
|
Fascination with glassy states has persisted since Fisher introduced the
vortex-glass as a new thermodynamic phase that is a true superconductor that
lacks conventional long-range order. Though Fisher's original model considered
point disorder, it was later predicted that columnar defects (CDs) could also
induce glassiness -- specifically, a Bose-glass phase. In
YBa$_2$Cu$_3$O$_{7-x}$ (YBCO), glassy states can cause distinct behavior in the
temperature ($T$) dependent rate of thermally activated vortex motion ($S$).
The vortex-glass state produces a plateau in $S(T)$ whereas a Bose-glass can
transition into a state hosting vortex excitations called double-kinks that can
expand, creating a large peak in $S(T)$. Although glass phases have been
well-studied in YBCO, few studies exist of other materials containing CDs that
could contribute to distinguishing universal behavior. Here, we report on the
effectiveness of CDs tilted ~30$\deg$ from the c-axis in reducing $S$ in a
NbSe$_2$ crystal. The magnetization is 5 times higher and $S$ is minimized when
the field is parallel to the defects versus aligned with the c-axis. We see
signatures of glassiness in both field orientations, but do not observe a peak
in $S(T)$ nor a plateau at values observed in YBCO. We discuss the possibility
that competing disorder induces a field-orientation-driven transition from a
Bose-glass to an anisotropic glass involving both point and columnar disorder.
|
cond-mat.supr-con
|
fascination with glassy states has persisted since fisher introduced the vortexglass as a new thermodynamic phase that is a true superconductor that lacks conventional longrange order though fishers original model considered point disorder it was later predicted that columnar defects cds could also induce glassiness specifically a boseglass phase in yba_2cu_3o_7x ybco glassy states can cause distinct behavior in the temperature t dependent rate of thermally activated vortex motion s the vortexglass state produces a plateau in st whereas a boseglass can transition into a state hosting vortex excitations called doublekinks that can expand creating a large peak in st although glass phases have been wellstudied in ybco few studies exist of other materials containing cds that could contribute to distinguishing universal behavior here we report on the effectiveness of cds tilted 30deg from the caxis in reducing s in a nbse_2 crystal the magnetization is 5 times higher and s is minimized when the field is parallel to the defects versus aligned with the caxis we see signatures of glassiness in both field orientations but do not observe a peak in st nor a plateau at values observed in ybco we discuss the possibility that competing disorder induces a fieldorientationdriven transition from a boseglass to an anisotropic glass involving both point and columnar disorder
|
[['fascination', 'with', 'glassy', 'states', 'has', 'persisted', 'since', 'fisher', 'introduced', 'the', 'vortexglass', 'as', 'a', 'new', 'thermodynamic', 'phase', 'that', 'is', 'a', 'true', 'superconductor', 'that', 'lacks', 'conventional', 'longrange', 'order', 'though', 'fishers', 'original', 'model', 'considered', 'point', 'disorder', 'it', 'was', 'later', 'predicted', 'that', 'columnar', 'defects', 'cds', 'could', 'also', 'induce', 'glassiness', 'specifically', 'a', 'boseglass', 'phase', 'in', 'yba_2cu_3o_7x', 'ybco', 'glassy', 'states', 'can', 'cause', 'distinct', 'behavior', 'in', 'the', 'temperature', 't', 'dependent', 'rate', 'of', 'thermally', 'activated', 'vortex', 'motion', 's', 'the', 'vortexglass', 'state', 'produces', 'a', 'plateau', 'in', 'st', 'whereas', 'a', 'boseglass', 'can', 'transition', 'into', 'a', 'state', 'hosting', 'vortex', 'excitations', 'called', 'doublekinks', 'that', 'can', 'expand', 'creating', 'a', 'large', 'peak', 'in', 'st', 'although', 'glass', 'phases', 'have', 'been', 'wellstudied', 'in', 'ybco', 'few', 'studies', 'exist', 'of', 'other', 'materials', 'containing', 'cds', 'that', 'could', 'contribute', 'to', 'distinguishing', 'universal', 'behavior', 'here', 'we', 'report', 'on', 'the', 'effectiveness', 'of', 'cds', 'tilted', '30deg', 'from', 'the', 'caxis', 'in', 'reducing', 's', 'in', 'a', 'nbse_2', 'crystal', 'the', 'magnetization', 'is', '5', 'times', 'higher', 'and', 's', 'is', 'minimized', 'when', 'the', 'field', 'is', 'parallel', 'to', 'the', 'defects', 'versus', 'aligned', 'with', 'the', 'caxis', 'we', 'see', 'signatures', 'of', 'glassiness', 'in', 'both', 'field', 'orientations', 'but', 'do', 'not', 'observe', 'a', 'peak', 'in', 'st', 'nor', 'a', 'plateau', 'at', 'values', 'observed', 'in', 'ybco', 'we', 'discuss', 'the', 'possibility', 'that', 'competing', 'disorder', 'induces', 'a', 'fieldorientationdriven', 'transition', 'from', 'a', 'boseglass', 'to', 'an', 'anisotropic', 'glass', 'involving', 'both', 'point', 'and', 'columnar', 'disorder']]
|
[-0.1650467413256793, 0.26793392789403925, -0.08363792834313752, 0.02129241677633478, -0.04844948282875798, -0.17756783222438585, 0.08440888287530154, 0.39392570518787967, -0.2258374688648422, -0.25293504783857457, 0.045204378586883344, -0.32753640184607447, -0.12034828520594208, 0.12862206374332222, -0.0056786905961032485, -0.03129477926004982, -0.03126185620531545, 0.00336048142118773, -0.10537130357216641, -0.2016957850641453, 0.24765197791054216, -0.0031783933327161652, 0.3499932160334303, 0.05168896924022218, 0.022599407242165064, -0.028420679848378812, 0.11586693731167227, 0.08557406694851291, -0.1540542286481165, -0.027881994854960537, 0.27366927606485425, -0.03192699247175399, 0.19249333537887658, -0.43474517923565537, -0.2283703101626182, 0.08856843008130719, 0.15471320967255553, 0.15082041220192932, -0.05538697512612674, -0.2527763370775395, 0.06668845612824645, -0.1173450332036583, -0.12209388251774922, -0.07060174053609196, 0.033649053408200263, -0.023246250508851568, -0.22549711528276267, 0.12319549500924194, 0.09452342079567587, 0.07746261430405815, -0.06956403813939192, -0.10151314954579471, -0.08092898830220523, 0.03694027478130591, 0.039632676038650595, 0.10014268429621949, 0.14969306727521506, -0.13881136745623282, -0.13734637485749301, 0.342114073281207, -0.05821917551960971, -0.058696506114265586, 0.1610618593010553, -0.18217600428122435, -0.09328221675705935, 0.1969699222953037, 0.0847461754193818, 0.07489096603308205, -0.09406125393266813, 0.043762113498370794, -0.006391996907468168, 0.20302235953725148, 0.044796424288796745, 0.03292706863082368, 0.26759823111756026, 0.19301912057439757, 0.018680347249397194, 0.185876850618384, -0.15028466069104834, -0.10633913251820584, -0.22468835807967266, -0.17107652423754685, -0.20189656653472096, 0.0520047906932679, -0.06445475203789085, -0.21516875448711043, 0.3614069598356913, 0.14375683169608647, 0.21052164017707065, -0.045736398218864216, 0.18379324093622815, 0.056819262120221245, 0.08243548975980888, 0.0561402788677607, 0.2368755023707876, 0.10872404671606428, 0.14043823786587084, -0.22630923951865597, 0.13325226211050273, 0.0073276505993565486]
|
1,803.07204
|
Why not be Versatile? Applications of the SGNMT Decoder for Machine
Translation
|
SGNMT is a decoding platform for machine translation which allows paring
various modern neural models of translation with different kinds of constraints
and symbolic models. In this paper, we describe three use cases in which SGNMT
is currently playing an active role: (1) teaching as SGNMT is being used for
course work and student theses in the MPhil in Machine Learning, Speech and
Language Technology at the University of Cambridge, (2) research as most of the
research work of the Cambridge MT group is based on SGNMT, and (3) technology
transfer as we show how SGNMT is helping to transfer research findings from the
laboratory to the industry, eg. into a product of SDL plc.
|
cs.CL
|
sgnmt is a decoding platform for machine translation which allows paring various modern neural models of translation with different kinds of constraints and symbolic models in this paper we describe three use cases in which sgnmt is currently playing an active role 1 teaching as sgnmt is being used for course work and student theses in the mphil in machine learning speech and language technology at the university of cambridge 2 research as most of the research work of the cambridge mt group is based on sgnmt and 3 technology transfer as we show how sgnmt is helping to transfer research findings from the laboratory to the industry eg into a product of sdl plc
|
[['sgnmt', 'is', 'a', 'decoding', 'platform', 'for', 'machine', 'translation', 'which', 'allows', 'paring', 'various', 'modern', 'neural', 'models', 'of', 'translation', 'with', 'different', 'kinds', 'of', 'constraints', 'and', 'symbolic', 'models', 'in', 'this', 'paper', 'we', 'describe', 'three', 'use', 'cases', 'in', 'which', 'sgnmt', 'is', 'currently', 'playing', 'an', 'active', 'role', '1', 'teaching', 'as', 'sgnmt', 'is', 'being', 'used', 'for', 'course', 'work', 'and', 'student', 'theses', 'in', 'the', 'mphil', 'in', 'machine', 'learning', 'speech', 'and', 'language', 'technology', 'at', 'the', 'university', 'of', 'cambridge', '2', 'research', 'as', 'most', 'of', 'the', 'research', 'work', 'of', 'the', 'cambridge', 'mt', 'group', 'is', 'based', 'on', 'sgnmt', 'and', '3', 'technology', 'transfer', 'as', 'we', 'show', 'how', 'sgnmt', 'is', 'helping', 'to', 'transfer', 'research', 'findings', 'from', 'the', 'laboratory', 'to', 'the', 'industry', 'eg', 'into', 'a', 'product', 'of', 'sdl', 'plc']]
|
[-0.026101822288625915, 0.09369803409651428, -0.07528659274153736, 0.032797100925413165, -0.108743128909365, -0.17746054389230584, -0.006397612991175898, 0.3888192080285238, -0.25342950093377703, -0.34084713164079206, 0.11354081138725514, -0.27152418551128865, -0.17980673228916916, 0.26979569425077543, -0.08589627477137939, 0.044375287090509155, 0.03383414101807158, 0.050195239751559234, -0.04266494623101924, -0.2544842870136642, 0.31805221590658894, 0.07431558450360014, 0.3543327764162551, 0.04788460575206124, 0.07624355100231933, -0.007043959653895834, -0.041482363678211266, -0.0876467524874739, -0.06589198104794258, 0.19864275817070967, 0.37210043111857805, 0.22022056666648257, 0.36137631451407365, -0.38269892914787584, -0.1703450313647804, 0.04589820575454961, 0.12640600572580613, 0.09521630291179146, -0.0525171349523589, -0.25459231087614015, 0.057456594507169466, -0.2201091026077452, -0.021681335685855667, -0.04866977407718482, 0.02235365287684228, -0.005934060441390813, -0.21361797951546538, -0.06155400548697166, 0.11366692306473851, 0.17404174951269574, -0.04385577602180369, -0.14353128545310187, 0.051517238556002466, 0.20315690484788754, 0.054947279966638785, 0.09013534681061687, 0.12310219054798717, -0.17322094915029795, -0.1629018367369376, 0.40952968208686163, -0.044672151201445125, -0.15327809585825256, 0.22348221254777972, -0.05080038661380177, -0.18873375606034762, -0.018036658794659634, 0.27682347569776616, 0.06965483229647836, -0.16348993559570416, 0.07099563891837454, 0.005953757351507312, 0.1612224720104638, 0.029211797579394086, -0.0362899883609751, 0.18995407432641673, 0.24012510513319918, -0.02289070472141485, 0.11611559898794993, -0.06713936806696913, -0.10644642879538561, -0.24006682966390383, -0.20277708791115362, -0.13999187473977065, 0.01668337073743991, 0.01665979861939812, -0.0878537391686974, 0.38304733697163024, 0.16679065221839626, 0.09859776398490952, 0.025510111424829, 0.2853659216881446, 0.0286883506792314, 0.10621324887742167, 0.09472938753340555, 0.181160990756167, 0.06312653429644263, 0.1619134669030166, -0.14910572488468302, 0.05563650995330966, 0.03243215029006419]
|
1,803.07205
|
First determination of $\beta$-delayed multiple neutron emission beyond
A = 100 through direct neutron measurement: The P$_{2n}$ value of $^{136}$Sb
|
Background: $\beta$-delayed multiple neutron emission has been observed for
some nuclei with A$\leq$100, with $^{100}$Rb being the heaviest $\beta$2n
emitter measured to date. So far, only 25 P$_{2n}$ values have been determined
for the $\sim$300 nuclei that may decay in this way. Accordingly, it is of
interest to measure P$_{2n}$ values for the other possible multiple neutron
emitters throughout the chart of the nuclides. It is of particular interest to
make such measurement for nuclei with A$>$100 to test the predictions of
theoretical models and simulation tools for the decays of heavy nuclei in the
region of very neutron-rich nuclei. In addition, the decay properties of these
nuclei are fundamental for the understanding of astrophysical nucleosynthesis
processes such as the $r$-process, and safety inputs for nuclear reactors.
Purpose: To determine for the first time the two neutron branching ratio,
P$_{2n}$ value, for $^{136}$Sb through a direct neutron measurement, and to
provide precise P$_{1n}$ values for $^{136}$Sb and $^{136}$Te. Method: Pure
beams were provided by the JYFLTRAP at the IGISOL facility of the University of
Jyv\"askyl\"a, Finland. The purified ions were implanted into a moving tape at
the end of the beam line. The detection setup consisted of a plastic
scintillator placed right behind the implantation point, and the BELEN
detector, based on neutron counters embedded in a polyethylene matrix. The
analysis was based on the study of the $\beta$- and neutron- growth-and-decay
curves and the $\beta$-one-neutron and $\beta$-two-neutron time correlations.
Results: The P$_{2n}$ value of $^{136}$Sb was found to be 0.14(3)\% and the
measured P$_{1n}$ values for $^{136}$Sb and $^{136}$Te were found to be
32.2(15)\% and 1.47(6)\%, respectively. The measured P$_{2n}$ value is a factor
44 smaller than predicted by the FRDM+QRPA model used for $r$-process
calculations.
|
nucl-ex
|
background betadelayed multiple neutron emission has been observed for some nuclei with aleq100 with 100rb being the heaviest beta2n emitter measured to date so far only 25 p_2n values have been determined for the sim300 nuclei that may decay in this way accordingly it is of interest to measure p_2n values for the other possible multiple neutron emitters throughout the chart of the nuclides it is of particular interest to make such measurement for nuclei with a100 to test the predictions of theoretical models and simulation tools for the decays of heavy nuclei in the region of very neutronrich nuclei in addition the decay properties of these nuclei are fundamental for the understanding of astrophysical nucleosynthesis processes such as the rprocess and safety inputs for nuclear reactors purpose to determine for the first time the two neutron branching ratio p_2n value for 136sb through a direct neutron measurement and to provide precise p_1n values for 136sb and 136te method pure beams were provided by the jyfltrap at the igisol facility of the university of jyvaskyla finland the purified ions were implanted into a moving tape at the end of the beam line the detection setup consisted of a plastic scintillator placed right behind the implantation point and the belen detector based on neutron counters embedded in a polyethylene matrix the analysis was based on the study of the beta and neutron growthanddecay curves and the betaoneneutron and betatwoneutron time correlations results the p_2n value of 136sb was found to be 0143 and the measured p_1n values for 136sb and 136te were found to be 32215 and 1476 respectively the measured p_2n value is a factor 44 smaller than predicted by the frdmqrpa model used for rprocess calculations
|
[['background', 'betadelayed', 'multiple', 'neutron', 'emission', 'has', 'been', 'observed', 'for', 'some', 'nuclei', 'with', 'aleq100', 'with', '100rb', 'being', 'the', 'heaviest', 'beta2n', 'emitter', 'measured', 'to', 'date', 'so', 'far', 'only', '25', 'p_2n', 'values', 'have', 'been', 'determined', 'for', 'the', 'sim300', 'nuclei', 'that', 'may', 'decay', 'in', 'this', 'way', 'accordingly', 'it', 'is', 'of', 'interest', 'to', 'measure', 'p_2n', 'values', 'for', 'the', 'other', 'possible', 'multiple', 'neutron', 'emitters', 'throughout', 'the', 'chart', 'of', 'the', 'nuclides', 'it', 'is', 'of', 'particular', 'interest', 'to', 'make', 'such', 'measurement', 'for', 'nuclei', 'with', 'a100', 'to', 'test', 'the', 'predictions', 'of', 'theoretical', 'models', 'and', 'simulation', 'tools', 'for', 'the', 'decays', 'of', 'heavy', 'nuclei', 'in', 'the', 'region', 'of', 'very', 'neutronrich', 'nuclei', 'in', 'addition', 'the', 'decay', 'properties', 'of', 'these', 'nuclei', 'are', 'fundamental', 'for', 'the', 'understanding', 'of', 'astrophysical', 'nucleosynthesis', 'processes', 'such', 'as', 'the', 'rprocess', 'and', 'safety', 'inputs', 'for', 'nuclear', 'reactors', 'purpose', 'to', 'determine', 'for', 'the', 'first', 'time', 'the', 'two', 'neutron', 'branching', 'ratio', 'p_2n', 'value', 'for', '136sb', 'through', 'a', 'direct', 'neutron', 'measurement', 'and', 'to', 'provide', 'precise', 'p_1n', 'values', 'for', '136sb', 'and', '136te', 'method', 'pure', 'beams', 'were', 'provided', 'by', 'the', 'jyfltrap', 'at', 'the', 'igisol', 'facility', 'of', 'the', 'university', 'of', 'jyvaskyla', 'finland', 'the', 'purified', 'ions', 'were', 'implanted', 'into', 'a', 'moving', 'tape', 'at', 'the', 'end', 'of', 'the', 'beam', 'line', 'the', 'detection', 'setup', 'consisted', 'of', 'a', 'plastic', 'scintillator', 'placed', 'right', 'behind', 'the', 'implantation', 'point', 'and', 'the', 'belen', 'detector', 'based', 'on', 'neutron', 'counters', 'embedded', 'in', 'a', 'polyethylene', 'matrix', 'the', 'analysis', 'was', 'based', 'on', 'the', 'study', 'of', 'the', 'beta', 'and', 'neutron', 'growthanddecay', 'curves', 'and', 'the', 'betaoneneutron', 'and', 'betatwoneutron', 'time', 'correlations', 'results', 'the', 'p_2n', 'value', 'of', '136sb', 'was', 'found', 'to', 'be', '0143', 'and', 'the', 'measured', 'p_1n', 'values', 'for', '136sb', 'and', '136te', 'were', 'found', 'to', 'be', '32215', 'and', '1476', 'respectively', 'the', 'measured', 'p_2n', 'value', 'is', 'a', 'factor', '44', 'smaller', 'than', 'predicted', 'by', 'the', 'frdmqrpa', 'model', 'used', 'for', 'rprocess', 'calculations']]
|
[-0.010611662500014062, 0.17209089273154468, -0.06448599413436439, 0.07726270263499048, 0.006270569201192951, -0.12139607405489576, 0.05632355814938949, 0.3650067216982799, -0.18393418154363253, -0.31779526959040333, 0.07413340369322603, -0.34700463926253305, 0.02677132622411591, 0.23673526362399572, 0.03446619256272762, 0.0704101634563163, 0.04264266840099091, 0.05759300553566261, -0.055085928847256584, -0.18374903332691506, 0.2691733271232806, 0.116373835547295, 0.24893332844855778, 0.05363372530887968, 0.06697928443817155, -0.03240864882391179, -0.009946295544380389, -0.043056057711198394, -0.12552782565817325, 0.07510547715023026, 0.2663513470437595, 0.10808973571984097, 0.17471516754303593, -0.3979152025488604, -0.15497447712238813, 0.12003269533992612, 0.12550702553375492, 0.0635770019651058, -0.09003280986050544, -0.2781349369948397, 0.10427215940154123, -0.17277658682100341, -0.12711647562599473, -0.01623758663024221, 0.05768673022144607, 0.06016996776036519, -0.2611212709985141, 0.003658633486234716, -0.016138725199354147, 0.04066367947689287, -0.07042298386643649, -0.2134445303818211, 0.023453316855843048, 0.10858740455171625, 0.07919780250314423, 0.023979416749872532, 0.18088190925108003, -0.09497365237579548, -0.06756112724542618, 0.372731668734923, -0.005586227609403847, -0.08811552456268795, 0.12064555424648071, -0.20225198746525816, -0.14247366861340457, 0.16699993473843538, 0.14805274042134572, 0.1457179942334603, -0.15577057124714233, 0.018914713837148156, -0.012650468694378756, 0.1866623276213691, 0.08453044490389792, 0.014951941479063991, 0.2057151186421314, 0.20472805153736512, -0.03354522575141995, 0.06804920473306474, -0.1717360460091316, -0.0386221717612768, -0.2762204361385167, -0.16596640883612312, -0.11110638061114254, 0.05476521611942319, -0.04675650727393596, -0.10154633825929653, 0.34424208145355806, 0.050841517512370565, 0.171097148260651, -0.009950214956188575, 0.24626558480252111, 0.07156691496867487, 0.07316558774535743, 0.02515917838817196, 0.32736960066176835, 0.19668481356680526, 0.08479784729092249, -0.238804033305496, 0.11089316438966697, 0.04101208036382949]
|
1,803.07206
|
Optimal Analysis of an Online Algorithm for the Bipartite Matching
Problem on a Line
|
In the online metric bipartite matching problem, we are given a set $S$ of
server locations in a metric space. Requests arrive one at a time, and on its
arrival, we need to immediately and irrevocably match it to a server at a cost
which is equal to the distance between these locations. A $\alpha$-competitive
algorithm will assign requests to servers so that the total cost is at most
$\alpha$ times the cost of $M_{OPT}$ where $M_{OPT}$ is the minimum cost
matching between $S$ and $R$.
We consider this problem in the adversarial model for the case where $S$ and
$R$ are points on a line and $|S|=|R|=n$. We improve the analysis of the
deterministic Robust Matching Algorithm (RM-Algorithm, Nayyar and Raghvendra
FOCS'17) from $O(\log^2 n)$ to an optimal $\Theta(\log n)$. Previously, only a
randomized algorithm under a weaker oblivious adversary achieved a competitive
ratio of $O(\log n)$ (Gupta and Lewi, ICALP'12). The well-known Work Function
Algorithm (WFA) has a competitive ratio of $O(n)$ and $\Omega(\log n)$ for this
problem. Therefore, WFA cannot achieve an asymptotically better competitive
ratio than the RM-Algorithm.
|
cs.CG
|
in the online metric bipartite matching problem we are given a set s of server locations in a metric space requests arrive one at a time and on its arrival we need to immediately and irrevocably match it to a server at a cost which is equal to the distance between these locations a alphacompetitive algorithm will assign requests to servers so that the total cost is at most alpha times the cost of m_opt where m_opt is the minimum cost matching between s and r we consider this problem in the adversarial model for the case where s and r are points on a line and srn we improve the analysis of the deterministic robust matching algorithm rmalgorithm nayyar and raghvendra focs17 from olog2 n to an optimal thetalog n previously only a randomized algorithm under a weaker oblivious adversary achieved a competitive ratio of olog n gupta and lewi icalp12 the wellknown work function algorithm wfa has a competitive ratio of on and omegalog n for this problem therefore wfa cannot achieve an asymptotically better competitive ratio than the rmalgorithm
|
[['in', 'the', 'online', 'metric', 'bipartite', 'matching', 'problem', 'we', 'are', 'given', 'a', 'set', 's', 'of', 'server', 'locations', 'in', 'a', 'metric', 'space', 'requests', 'arrive', 'one', 'at', 'a', 'time', 'and', 'on', 'its', 'arrival', 'we', 'need', 'to', 'immediately', 'and', 'irrevocably', 'match', 'it', 'to', 'a', 'server', 'at', 'a', 'cost', 'which', 'is', 'equal', 'to', 'the', 'distance', 'between', 'these', 'locations', 'a', 'alphacompetitive', 'algorithm', 'will', 'assign', 'requests', 'to', 'servers', 'so', 'that', 'the', 'total', 'cost', 'is', 'at', 'most', 'alpha', 'times', 'the', 'cost', 'of', 'm_opt', 'where', 'm_opt', 'is', 'the', 'minimum', 'cost', 'matching', 'between', 's', 'and', 'r', 'we', 'consider', 'this', 'problem', 'in', 'the', 'adversarial', 'model', 'for', 'the', 'case', 'where', 's', 'and', 'r', 'are', 'points', 'on', 'a', 'line', 'and', 'srn', 'we', 'improve', 'the', 'analysis', 'of', 'the', 'deterministic', 'robust', 'matching', 'algorithm', 'rmalgorithm', 'nayyar', 'and', 'raghvendra', 'focs17', 'from', 'olog2', 'n', 'to', 'an', 'optimal', 'thetalog', 'n', 'previously', 'only', 'a', 'randomized', 'algorithm', 'under', 'a', 'weaker', 'oblivious', 'adversary', 'achieved', 'a', 'competitive', 'ratio', 'of', 'olog', 'n', 'gupta', 'and', 'lewi', 'icalp12', 'the', 'wellknown', 'work', 'function', 'algorithm', 'wfa', 'has', 'a', 'competitive', 'ratio', 'of', 'on', 'and', 'omegalog', 'n', 'for', 'this', 'problem', 'therefore', 'wfa', 'can', 'not', 'achieve', 'an', 'asymptotically', 'better', 'competitive', 'ratio', 'than', 'the', 'rmalgorithm']]
|
[-0.1499790541161705, 0.05340146848703631, -0.05469889183627577, 0.04569333306235371, -0.04624095751628197, -0.22309371399401828, 0.15668303316573523, 0.4003258931317871, -0.2442697059433366, -0.34499863543490455, 0.08607305435778563, -0.3050066010984878, -0.10262234584693719, 0.13774227539425996, -0.09683383575656228, 0.06642665406565479, 0.04475667097413257, 0.0909112638484312, -0.014510050316324312, -0.33099261292532167, 0.24026552620786112, 0.08763041247369191, 0.24238035737474412, 0.03431758369213782, 0.09501569528736216, 0.0004799747566416776, 0.0169209523188918, 0.027650827631535133, -0.11413986616470889, 0.07049010852911099, 0.24102463740231106, 0.1825951559900946, 0.2796610439581245, -0.3794465906418569, -0.11309113588532714, 0.17347817251188213, 0.12803466779091421, 0.060979910274868696, 0.028289385043037796, -0.22204388453697985, 0.12955953319837968, -0.12244704635111438, -0.028066123642584092, 0.02603938240120864, 0.06475192361235535, -0.029361444898079767, -0.3613727572426075, -0.01628654552675659, 0.03790395006579061, -0.02503716365782825, -0.005810986389080843, -0.12323809250055646, 0.03004061003663062, 0.1141125696890743, 0.003920269300172616, 0.13054955042846625, 0.07558703821480232, -0.08951470709286172, -0.12134863947408908, 0.3624812500998794, -0.05804041261544422, -0.18398111331401465, 0.1411690003077328, -0.059871695302270725, -0.14527029093282098, 0.12284256805088267, 0.20043615687166355, 0.16053259487955845, -0.10193954604318854, 0.09685991939115624, -0.09078996948502417, 0.20250677719241394, 0.10361868584289231, 0.018740881362529316, 0.09629219591971383, 0.1587313148386545, 0.18620004944825888, 0.11931482790943297, -0.01807082749450548, -0.04788663105092235, -0.25746151486440305, -0.14781972399767093, -0.23674756616377401, 0.04097326037640795, -0.1659540320537183, -0.12348221942220487, 0.3298084000775892, 0.13843816619199914, 0.23783644529673473, 0.16209943297998095, 0.33107812142821663, 0.08721678510417852, 0.014000044695970566, 0.20464743734935725, 0.16045363555537465, 0.024181868223468225, 0.07917415693678045, -0.2002043236429444, 0.12174861424201944, 0.09582127567234985]
|
1,803.07207
|
The Lyman Alpha Reference Sample IX: Revelations from deep surface
photometry
|
The Lyman Alpha Reference Sample (LARS) of 14 star-forming galaxies offers a
wealth of insight into the workings of these local analogs to high-redshift
star-forming galaxies. The sample has been well-studied in terms of LyA and
other emission line properties, such as HI mass, gas kinematics, and
morphology. We analyze deep surface photometry of the LARS sample in UBIK
broadband imaging obtained at the Nordic Optical Telescope and the
Canada-France-Hawaii Telescope, and juxtaposition their derived properties with
a sample of local high-redshift galaxy analogs, namely, with blue compact
galaxies (BCGs). We construct radial surface brightness and color profiles with
both elliptical and isophotal integration, as well as RGB images, deep
contours, color maps, a burst fraction estimate, and a radial mass-to-light
ratio profile for each LARS galaxy. Standard morphological parameters like
asymmetry, clumpiness, the Gini and M20 coefficients are [...] analyzed, as
well as isophotal asymmetry profiles for each galaxy. [...] We compare the LARS
to the properties of the BCG sample and highlight the differences. Several
diagnostics indicate that the LARS galaxies have highly disturbed morphologies
even at the level of the faintest isophotes [...]. The ground-based photometry
[...] reveals previously unexplored isophotes [...]. The burst fraction
estimate suggests a spatially more extended burst region in LARS than in the
BCGs. [...] The galaxies in the LARS sample appear to be in earlier stages of a
merger event compared to the BCGs. Standard morphological diagnostics like
asymmetry, clumpiness, Gini and M20 coefficients cannot separate the two
samples, although an isophotal asymmetry profile successfully captures the
average difference in morphology. These morphological diagnostics do not show
any correlation with the equivalent width or the escape fraction of Lyman
Alpha. [abridged]
|
astro-ph.GA
|
the lyman alpha reference sample lars of 14 starforming galaxies offers a wealth of insight into the workings of these local analogs to highredshift starforming galaxies the sample has been wellstudied in terms of lya and other emission line properties such as hi mass gas kinematics and morphology we analyze deep surface photometry of the lars sample in ubik broadband imaging obtained at the nordic optical telescope and the canadafrancehawaii telescope and juxtaposition their derived properties with a sample of local highredshift galaxy analogs namely with blue compact galaxies bcgs we construct radial surface brightness and color profiles with both elliptical and isophotal integration as well as rgb images deep contours color maps a burst fraction estimate and a radial masstolight ratio profile for each lars galaxy standard morphological parameters like asymmetry clumpiness the gini and m20 coefficients are analyzed as well as isophotal asymmetry profiles for each galaxy we compare the lars to the properties of the bcg sample and highlight the differences several diagnostics indicate that the lars galaxies have highly disturbed morphologies even at the level of the faintest isophotes the groundbased photometry reveals previously unexplored isophotes the burst fraction estimate suggests a spatially more extended burst region in lars than in the bcgs the galaxies in the lars sample appear to be in earlier stages of a merger event compared to the bcgs standard morphological diagnostics like asymmetry clumpiness gini and m20 coefficients cannot separate the two samples although an isophotal asymmetry profile successfully captures the average difference in morphology these morphological diagnostics do not show any correlation with the equivalent width or the escape fraction of lyman alpha abridged
|
[['the', 'lyman', 'alpha', 'reference', 'sample', 'lars', 'of', '14', 'starforming', 'galaxies', 'offers', 'a', 'wealth', 'of', 'insight', 'into', 'the', 'workings', 'of', 'these', 'local', 'analogs', 'to', 'highredshift', 'starforming', 'galaxies', 'the', 'sample', 'has', 'been', 'wellstudied', 'in', 'terms', 'of', 'lya', 'and', 'other', 'emission', 'line', 'properties', 'such', 'as', 'hi', 'mass', 'gas', 'kinematics', 'and', 'morphology', 'we', 'analyze', 'deep', 'surface', 'photometry', 'of', 'the', 'lars', 'sample', 'in', 'ubik', 'broadband', 'imaging', 'obtained', 'at', 'the', 'nordic', 'optical', 'telescope', 'and', 'the', 'canadafrancehawaii', 'telescope', 'and', 'juxtaposition', 'their', 'derived', 'properties', 'with', 'a', 'sample', 'of', 'local', 'highredshift', 'galaxy', 'analogs', 'namely', 'with', 'blue', 'compact', 'galaxies', 'bcgs', 'we', 'construct', 'radial', 'surface', 'brightness', 'and', 'color', 'profiles', 'with', 'both', 'elliptical', 'and', 'isophotal', 'integration', 'as', 'well', 'as', 'rgb', 'images', 'deep', 'contours', 'color', 'maps', 'a', 'burst', 'fraction', 'estimate', 'and', 'a', 'radial', 'masstolight', 'ratio', 'profile', 'for', 'each', 'lars', 'galaxy', 'standard', 'morphological', 'parameters', 'like', 'asymmetry', 'clumpiness', 'the', 'gini', 'and', 'm20', 'coefficients', 'are', 'analyzed', 'as', 'well', 'as', 'isophotal', 'asymmetry', 'profiles', 'for', 'each', 'galaxy', 'we', 'compare', 'the', 'lars', 'to', 'the', 'properties', 'of', 'the', 'bcg', 'sample', 'and', 'highlight', 'the', 'differences', 'several', 'diagnostics', 'indicate', 'that', 'the', 'lars', 'galaxies', 'have', 'highly', 'disturbed', 'morphologies', 'even', 'at', 'the', 'level', 'of', 'the', 'faintest', 'isophotes', 'the', 'groundbased', 'photometry', 'reveals', 'previously', 'unexplored', 'isophotes', 'the', 'burst', 'fraction', 'estimate', 'suggests', 'a', 'spatially', 'more', 'extended', 'burst', 'region', 'in', 'lars', 'than', 'in', 'the', 'bcgs', 'the', 'galaxies', 'in', 'the', 'lars', 'sample', 'appear', 'to', 'be', 'in', 'earlier', 'stages', 'of', 'a', 'merger', 'event', 'compared', 'to', 'the', 'bcgs', 'standard', 'morphological', 'diagnostics', 'like', 'asymmetry', 'clumpiness', 'gini', 'and', 'm20', 'coefficients', 'can', 'not', 'separate', 'the', 'two', 'samples', 'although', 'an', 'isophotal', 'asymmetry', 'profile', 'successfully', 'captures', 'the', 'average', 'difference', 'in', 'morphology', 'these', 'morphological', 'diagnostics', 'do', 'not', 'show', 'any', 'correlation', 'with', 'the', 'equivalent', 'width', 'or', 'the', 'escape', 'fraction', 'of', 'lyman', 'alpha', 'abridged']]
|
[0.007794066152346735, 0.022781703446791625, -0.10612664308167831, 0.1291117187840932, -0.11510896122586119, -0.0630264246197295, -0.005779646688827524, 0.49930355676796534, -0.1328085487484116, -0.3503976776553522, 0.038611724924714215, -0.3144521913049321, -0.04509853897743729, 0.1936948808164159, -0.013733364195655521, 0.0007743751528217409, 0.026192160742187425, -0.15253867083365083, -0.055491272285308715, -0.28286210812473617, 0.2663040452332569, 0.05070924106794138, 0.2310631429015176, -0.09460972629854605, 0.062491526655142404, -0.07229924456039648, -0.1378790625952266, 0.015394458999299872, -0.15940361568652944, 0.01131703772692156, 0.23235182939981022, 0.13591190168114012, 0.22151376270981382, -0.3082715850315472, -0.19256926837367053, 0.0887971593691189, 0.23417440971978226, 0.0131353083975659, -0.0713605282781582, -0.28651357368722447, 0.02077739373491873, -0.13213747472164092, -0.18252968585907217, 0.08566874984556633, 0.033423452844153274, 0.05942396482581912, -0.1937656343241569, 0.1862206844065719, -0.009573825052089608, 0.13267035126332602, -0.09327262497836737, -0.09895815436021309, -0.1108030695663629, 0.07721949231991014, -0.02506611836448747, 0.032558680769165696, 0.24149260271075487, -0.19574570380334816, 0.01722987475622289, 0.3928520259698921, -0.06309795428440697, -0.008186453164820253, 0.22839613385663374, -0.2346249933390246, -0.19713153332441258, 0.09869027380624626, 0.16060268980226594, 0.06909846644984545, -0.14402480057379516, -0.008607195443422772, -0.04797549828985556, 0.2379688896480132, 0.0459155353146476, 0.08515670591298054, 0.2651635621382046, 0.031242350788521885, 0.03960910675381005, 0.11984542406051094, -0.2651624567313868, 0.02339646572682218, -0.22242103976088773, -0.13190977947542573, -0.10182060832183223, 0.048240147481853464, -0.18959677307201586, -0.12782199205796704, 0.3787710786589768, 0.06401648754457923, 0.2727979210493865, 0.1078799471010991, 0.3024150905323412, 0.07035146224869918, 0.15943009488498724, 0.06394183273337115, 0.3148800991908953, 0.17143510006381757, 0.07110365100900037, -0.2512340737646106, 0.10421032233679511, 0.017497360329041735]
|
1,803.07208
|
Orbital integrals and $K$-theory classes
|
Let $G$ be a semisimple Lie group with discrete series. We use maps
$K_0(C^*_rG)\to \mathbb{C}$ defined by orbital integrals to recover group
theoretic information about $G$, including information contained in $K$-theory
classes not associated to the discrete series. An important tool is a fixed
point formula for equivariant indices obtained by the authors in an earlier
paper. Applications include a tool to distinguish classes in $K_0(C^*_rG)$, the
(known) injectivity of Dirac induction, versions of Selberg's principle in
$K$-theory and for matrix coefficients of the discrete series, a Tannaka-type
duality, and a way to extract characters of representations from $K$-theory.
Finally, we obtain a continuity property near the identity element of $G$ of
families of maps $K_0(C^*_rG)\to \mathbb{C}$, parametrised by semisimple
elements of $G$, defined by stable orbital integrals. This implies a continuity
property for $L$-packets of discrete series characters, which in turn can be
used to deduce a (well-known) expression for formal degrees of discrete series
representations from Harish-Chandra's character formula.
|
math.KT math.DG math.OA math.RT
|
let g be a semisimple lie group with discrete series we use maps k_0c_rgto mathbbc defined by orbital integrals to recover group theoretic information about g including information contained in ktheory classes not associated to the discrete series an important tool is a fixed point formula for equivariant indices obtained by the authors in an earlier paper applications include a tool to distinguish classes in k_0c_rg the known injectivity of dirac induction versions of selbergs principle in ktheory and for matrix coefficients of the discrete series a tannakatype duality and a way to extract characters of representations from ktheory finally we obtain a continuity property near the identity element of g of families of maps k_0c_rgto mathbbc parametrised by semisimple elements of g defined by stable orbital integrals this implies a continuity property for lpackets of discrete series characters which in turn can be used to deduce a wellknown expression for formal degrees of discrete series representations from harishchandras character formula
|
[['let', 'g', 'be', 'a', 'semisimple', 'lie', 'group', 'with', 'discrete', 'series', 'we', 'use', 'maps', 'k_0c_rgto', 'mathbbc', 'defined', 'by', 'orbital', 'integrals', 'to', 'recover', 'group', 'theoretic', 'information', 'about', 'g', 'including', 'information', 'contained', 'in', 'ktheory', 'classes', 'not', 'associated', 'to', 'the', 'discrete', 'series', 'an', 'important', 'tool', 'is', 'a', 'fixed', 'point', 'formula', 'for', 'equivariant', 'indices', 'obtained', 'by', 'the', 'authors', 'in', 'an', 'earlier', 'paper', 'applications', 'include', 'a', 'tool', 'to', 'distinguish', 'classes', 'in', 'k_0c_rg', 'the', 'known', 'injectivity', 'of', 'dirac', 'induction', 'versions', 'of', 'selbergs', 'principle', 'in', 'ktheory', 'and', 'for', 'matrix', 'coefficients', 'of', 'the', 'discrete', 'series', 'a', 'tannakatype', 'duality', 'and', 'a', 'way', 'to', 'extract', 'characters', 'of', 'representations', 'from', 'ktheory', 'finally', 'we', 'obtain', 'a', 'continuity', 'property', 'near', 'the', 'identity', 'element', 'of', 'g', 'of', 'families', 'of', 'maps', 'k_0c_rgto', 'mathbbc', 'parametrised', 'by', 'semisimple', 'elements', 'of', 'g', 'defined', 'by', 'stable', 'orbital', 'integrals', 'this', 'implies', 'a', 'continuity', 'property', 'for', 'lpackets', 'of', 'discrete', 'series', 'characters', 'which', 'in', 'turn', 'can', 'be', 'used', 'to', 'deduce', 'a', 'wellknown', 'expression', 'for', 'formal', 'degrees', 'of', 'discrete', 'series', 'representations', 'from', 'harishchandras', 'character', 'formula']]
|
[-0.15390467152730386, 0.029022339587777713, -0.1649550281087809, 0.07471041788370643, -0.1333555781261854, -0.10192601590216914, 0.02527073552151199, 0.32209700031819033, -0.3669883561308814, -0.24259352211875818, 0.09625229412244775, -0.23244765942844067, -0.14688372215008527, 0.2346023973486463, -0.13629767920120467, -0.0024814392687587798, 0.043379807776971896, 0.08927524276077747, -0.11469479772274065, -0.21703422211439943, 0.35609725936716774, -0.05049578917707918, 0.20832431548027486, 0.0008166361234704905, 0.10454625658738086, 0.037947058418317685, -0.06231414881841386, -0.05100453754185546, -0.12386481789577328, 0.1666746580622548, 0.3346207814196808, 0.04371312085562681, 0.2135066203802494, -0.36749236519696027, -0.18489727290064284, 0.16173543664405735, 0.13474042952698773, -0.0008594049708151459, -0.005446519886321812, -0.2999657181952196, 0.09895918227708604, -0.19566946702897312, -0.17188894122697507, -0.12136099702837772, 0.08173117551162745, -0.0008111018039097514, -0.2881125570186473, 0.032268852936000784, 0.07703819114396561, 0.1478514792220785, -0.06976596820109253, -0.08938442571000255, -0.033304960317349745, 0.15037954176328133, -0.0005356412678603319, 0.020721315761403288, 0.07803886918103488, -0.06917103464771181, -0.1360435297173342, 0.3945416095136087, -0.08956034261367837, -0.21186628738488955, 0.10000906407220077, -0.1482146859192584, -0.1981957363630822, 0.11896224007529171, 0.09143819004780601, 0.15857353474417277, -0.07755441727894771, 0.1541123562838729, -0.09752931772389367, 0.08541229144538182, 0.09397619393288711, 0.0038848795833749863, 0.16582383058045672, -0.0033179869303550523, 0.05048853499649823, 0.1479172148797779, 0.04856129020306612, -0.004623502973302067, -0.33535754170395504, -0.1837357803589747, -0.16669183157242928, 0.12104996053151612, -0.10739445207987565, -0.18107550979674428, 0.41455593669663265, 0.08068089947823577, 0.18116877050009333, 0.11012330944310944, 0.19009076787418203, 0.12404664939776346, 0.07239723555401817, 0.03837376069336469, 0.061946003084790105, 0.26566952119192366, -0.008444134809100364, -0.11356961366991643, -0.010782913168187878, 0.2632502331987872]
|
1,803.07209
|
Implementation of a single-shot receiver for quaternary phase-shift
keyed coherent states
|
We experimentally investigate a strategy to discriminate between quaternary
phase-shift keyed coherent states based on single-shot measurements that is
compatible with high-bandwidth communications. We extend previous theoretical
work in single-shot measurements to include critical experimental parameters
affecting the performance of practical implementations. Specifically, we
investigate how the visibility of the optical displacement operations required
in the strategy impacts the achievable discrimination error probability, and
identify the experimental requirements to outperform an ideal heterodyne
measurement. Our experimental implementation is optimized based on the
experimental parameters and allows for the investigation of realistic
single-shot measurements for multistate discrimination.
|
quant-ph
|
we experimentally investigate a strategy to discriminate between quaternary phaseshift keyed coherent states based on singleshot measurements that is compatible with highbandwidth communications we extend previous theoretical work in singleshot measurements to include critical experimental parameters affecting the performance of practical implementations specifically we investigate how the visibility of the optical displacement operations required in the strategy impacts the achievable discrimination error probability and identify the experimental requirements to outperform an ideal heterodyne measurement our experimental implementation is optimized based on the experimental parameters and allows for the investigation of realistic singleshot measurements for multistate discrimination
|
[['we', 'experimentally', 'investigate', 'a', 'strategy', 'to', 'discriminate', 'between', 'quaternary', 'phaseshift', 'keyed', 'coherent', 'states', 'based', 'on', 'singleshot', 'measurements', 'that', 'is', 'compatible', 'with', 'highbandwidth', 'communications', 'we', 'extend', 'previous', 'theoretical', 'work', 'in', 'singleshot', 'measurements', 'to', 'include', 'critical', 'experimental', 'parameters', 'affecting', 'the', 'performance', 'of', 'practical', 'implementations', 'specifically', 'we', 'investigate', 'how', 'the', 'visibility', 'of', 'the', 'optical', 'displacement', 'operations', 'required', 'in', 'the', 'strategy', 'impacts', 'the', 'achievable', 'discrimination', 'error', 'probability', 'and', 'identify', 'the', 'experimental', 'requirements', 'to', 'outperform', 'an', 'ideal', 'heterodyne', 'measurement', 'our', 'experimental', 'implementation', 'is', 'optimized', 'based', 'on', 'the', 'experimental', 'parameters', 'and', 'allows', 'for', 'the', 'investigation', 'of', 'realistic', 'singleshot', 'measurements', 'for', 'multistate', 'discrimination']]
|
[-0.12376405516988598, 0.08189545715034303, -0.07893676554279712, 0.019521447871132597, -0.02829074879991822, -0.1960932138172211, 0.125095084697629, 0.41690157043437165, -0.2019216200108834, -0.3052164714911972, 0.06869535496055808, -0.24899061861666874, -0.13651021661644336, 0.2766863756163123, -0.09047319950089634, 0.16460711889279386, 0.10214965881338382, -0.020265192035973694, -0.12465819106970837, -0.20090183382853866, 0.26146063292010996, 0.12427303349249996, 0.3814745053338508, 0.03915966798861822, 0.09349859929352533, 0.0500461848375077, -0.054031800866747894, -0.04617034669596857, -0.18032005922373173, 0.1342390470448057, 0.25427495893867064, 0.14275417605919452, 0.18363636921276338, -0.42672643743571825, -0.20169412714312784, 0.10294556823403885, 0.08301361225827956, 0.14621412383955126, -0.06539455503661884, -0.27863525628345087, 0.05317439638020005, -0.15416244557127357, -0.047606112532472857, -0.14677921904755445, -0.043938992554709934, 0.02041959945927374, -0.3480935776606202, 0.04675982331051879, -0.020845025863915605, 0.04647312562641067, -0.04859578684833347, -0.09503437928894225, 0.08917451018836194, 0.1507909071854859, -0.11326658875623252, -0.023895290942164138, 0.167000374373553, -0.09098420929694839, -0.2082123458882658, 0.31882793867650133, -0.05166760016193924, -0.1830386842872637, 0.1384327813721029, -0.10500055134374027, -0.11081762334894545, 0.08747982043617715, 0.17043380475176187, 0.06947711050937262, -0.10959107480812236, -0.013433757890500905, -0.0038842100081334743, 0.23929149865580257, 0.035902784336940385, 0.13984442357711183, 0.12703441621367043, 0.243004989286419, 0.037468760737586614, 0.1475383227225393, -0.1622853532268588, -0.08956912968521162, -0.28504643228370696, -0.13795388467163625, -0.18452956526501416, 0.004199633656147246, -0.01262764453925532, -0.0733695308639047, 0.4107650842051953, 0.2590070720276951, 0.15168691895572314, 0.04314522819671159, 0.4157384570668607, 0.03974510119345117, 0.02206257573561743, 0.0060621074759789435, 0.31952177294685197, 0.13655491013196297, 0.047662068905386455, -0.27994149253936484, 0.09524726908421144, -0.05049621004339618]
|
1,803.0721
|
Probing the Production of Extreme-ultraviolet Late-Phase Solar Flares by
Using the Model Enthalpy-Based Thermal Evolution of Loops
|
Recent observations in extreme-ultraviolet (EUV) wavelengths reveal an EUV
late phase in some solar flares that is characterized by a second peak in warm
coronal emissions ($\sim3$~MK) several tens of minutes to a few hours after the
soft X-ray (SXR) peak. Using the model enthalpy-based thermal evolution of
loops (EBTEL), in this paper we numerically probe the production of EUV
late-phase solar flares. Starting from two main mechanisms of producing the EUV
late phase, i.e., long-lasting cooling and secondary heating, we carry out two
groups of numerical experiments to study the effects of these two processes on
the emission characteristics in late-phase loops. In either of the two
processes an EUV late-phase solar flare that conforms to the observational
criteria can be numerically synthesized. However, the underlying hydrodynamic
and thermodynamic evolutions in late-phase loops are different between the two
synthetic flare cases. The late-phase peak due to a long-lasting cooling
process always occurs during the radiative cooling phase, while that powered by
a secondary heating is more likely to take place in the conductive cooling
phase. We then propose a new method for diagnosing the two mechanisms based on
the shape of EUV late-phase light curves. Moreover, from the partition of
energy input, we discuss why most solar flares are not EUV late flares.
Finally, by addressing some other factors that may potentially affect the loop
emissions, we also discuss why the EUV late phase is mainly observed in warm
coronal emissions.
|
astro-ph.SR
|
recent observations in extremeultraviolet euv wavelengths reveal an euv late phase in some solar flares that is characterized by a second peak in warm coronal emissions sim3mk several tens of minutes to a few hours after the soft xray sxr peak using the model enthalpybased thermal evolution of loops ebtel in this paper we numerically probe the production of euv latephase solar flares starting from two main mechanisms of producing the euv late phase ie longlasting cooling and secondary heating we carry out two groups of numerical experiments to study the effects of these two processes on the emission characteristics in latephase loops in either of the two processes an euv latephase solar flare that conforms to the observational criteria can be numerically synthesized however the underlying hydrodynamic and thermodynamic evolutions in latephase loops are different between the two synthetic flare cases the latephase peak due to a longlasting cooling process always occurs during the radiative cooling phase while that powered by a secondary heating is more likely to take place in the conductive cooling phase we then propose a new method for diagnosing the two mechanisms based on the shape of euv latephase light curves moreover from the partition of energy input we discuss why most solar flares are not euv late flares finally by addressing some other factors that may potentially affect the loop emissions we also discuss why the euv late phase is mainly observed in warm coronal emissions
|
[['recent', 'observations', 'in', 'extremeultraviolet', 'euv', 'wavelengths', 'reveal', 'an', 'euv', 'late', 'phase', 'in', 'some', 'solar', 'flares', 'that', 'is', 'characterized', 'by', 'a', 'second', 'peak', 'in', 'warm', 'coronal', 'emissions', 'sim3mk', 'several', 'tens', 'of', 'minutes', 'to', 'a', 'few', 'hours', 'after', 'the', 'soft', 'xray', 'sxr', 'peak', 'using', 'the', 'model', 'enthalpybased', 'thermal', 'evolution', 'of', 'loops', 'ebtel', 'in', 'this', 'paper', 'we', 'numerically', 'probe', 'the', 'production', 'of', 'euv', 'latephase', 'solar', 'flares', 'starting', 'from', 'two', 'main', 'mechanisms', 'of', 'producing', 'the', 'euv', 'late', 'phase', 'ie', 'longlasting', 'cooling', 'and', 'secondary', 'heating', 'we', 'carry', 'out', 'two', 'groups', 'of', 'numerical', 'experiments', 'to', 'study', 'the', 'effects', 'of', 'these', 'two', 'processes', 'on', 'the', 'emission', 'characteristics', 'in', 'latephase', 'loops', 'in', 'either', 'of', 'the', 'two', 'processes', 'an', 'euv', 'latephase', 'solar', 'flare', 'that', 'conforms', 'to', 'the', 'observational', 'criteria', 'can', 'be', 'numerically', 'synthesized', 'however', 'the', 'underlying', 'hydrodynamic', 'and', 'thermodynamic', 'evolutions', 'in', 'latephase', 'loops', 'are', 'different', 'between', 'the', 'two', 'synthetic', 'flare', 'cases', 'the', 'latephase', 'peak', 'due', 'to', 'a', 'longlasting', 'cooling', 'process', 'always', 'occurs', 'during', 'the', 'radiative', 'cooling', 'phase', 'while', 'that', 'powered', 'by', 'a', 'secondary', 'heating', 'is', 'more', 'likely', 'to', 'take', 'place', 'in', 'the', 'conductive', 'cooling', 'phase', 'we', 'then', 'propose', 'a', 'new', 'method', 'for', 'diagnosing', 'the', 'two', 'mechanisms', 'based', 'on', 'the', 'shape', 'of', 'euv', 'latephase', 'light', 'curves', 'moreover', 'from', 'the', 'partition', 'of', 'energy', 'input', 'we', 'discuss', 'why', 'most', 'solar', 'flares', 'are', 'not', 'euv', 'late', 'flares', 'finally', 'by', 'addressing', 'some', 'other', 'factors', 'that', 'may', 'potentially', 'affect', 'the', 'loop', 'emissions', 'we', 'also', 'discuss', 'why', 'the', 'euv', 'late', 'phase', 'is', 'mainly', 'observed', 'in', 'warm', 'coronal', 'emissions']]
|
[-0.08095599006507855, 0.25396457183813864, -0.034388110097652275, 0.15443764369444893, -0.04903045355601244, -0.07791485178914245, 0.019754042943139635, 0.4716118774975793, -0.2098275671768122, -0.32235835434258353, 0.09262444075009557, -0.2714814674331424, -0.12927976380106201, 0.25636767989886283, -0.03268109638431337, -0.011855404518247114, 0.09068786095297911, -0.08000494404386775, -0.046506910047714144, -0.18963367508634846, 0.2754950370906207, 0.09305358988221317, 0.18721844344250124, 0.041318428969296675, 0.02997183308770486, -0.13848006047204106, -0.04229079711002673, -0.054661543644173756, -0.06991487855144343, -0.008544302633886237, 0.178074229816825, 0.14706707413741135, 0.2288916841327093, -0.5046648448449077, -0.30123799413402036, 0.057993223612424746, 0.16784885805969696, -0.016682262949527654, -0.033573285332425394, -0.1896824950731023, 0.01875676272661112, -0.11099917017270258, -0.08034044967315071, 0.05352593535997932, 0.00015281229782308534, -0.015935566195883863, -0.24976325025724022, 0.06754567169599308, 0.020488500594609722, 0.05914133274831125, -0.11969179325182516, -0.001846658339322046, -0.06193225636220386, 0.10074044024683844, 0.09802588998353112, -0.015448857339377287, 0.17707415535481824, -0.11230086014776093, -0.1267959597613276, 0.3596571875171914, -0.051173023679786406, 0.04849209932077104, 0.20094168962354297, -0.2167139316481998, -0.17998937798153872, 0.2339940437162102, 0.1252294285034498, 0.10265373701569759, -0.1647984379230075, -0.06024710903634004, 0.03220440470130488, 0.1444320905455137, 0.07991736132605194, 0.0482852363715497, 0.2859633393929614, 0.13153844762688185, -0.05217019630126516, 0.1731164480051841, -0.20096869315542434, -0.08145673192904188, -0.30020342153751606, -0.09862924612579381, -0.07006251396557231, 0.06944350833446415, -0.07069264569296115, -0.19076776800240502, 0.42874729930018285, 0.16878061343411455, 0.22584402555777572, -0.036236651544169336, 0.33880967314498056, 0.10628293380269267, 0.019992961536056657, 0.11942088764829414, 0.321726683151659, 0.12389343304470707, 0.18628844417944643, -0.28090396785494653, 0.07384813546842636, 0.0797645404753256]
|
1,803.07211
|
DoubleEcho: Mitigating Context-Manipulation Attacks in Copresence
Verification
|
Copresence verification based on context can improve usability and strengthen
security of many authentication and access control systems. By sensing and
comparing their surroundings, two or more devices can tell whether they are
copresent and use this information to make access control decisions. To the
best of our knowledge, all context-based copresence verification mechanisms to
date are susceptible to context-manipulation attacks. In such attacks, a
distributed adversary replicates the same context at the (different) locations
of the victim devices, and induces them to believe that they are copresent. In
this paper we propose DoubleEcho, a context-based copresence verification
technique that leverages acoustic Room Impulse Response (RIR) to mitigate
context-manipulation attacks. In DoubleEcho, one device emits a wide-band
audible chirp and all participating devices record reflections of the chirp
from the surrounding environment. Since RIR is, by its very nature, dependent
on the physical surroundings, it constitutes a unique location signature that
is hard for an adversary to replicate. We evaluate DoubleEcho by collecting RIR
data with various mobile devices and in a range of different locations. We show
that DoubleEcho mitigates context-manipulation attacks whereas all other
approaches to date are entirely vulnerable to such attacks. DoubleEcho detects
copresence (or lack thereof) in roughly 2 seconds and works on commodity
devices.
|
cs.CR
|
copresence verification based on context can improve usability and strengthen security of many authentication and access control systems by sensing and comparing their surroundings two or more devices can tell whether they are copresent and use this information to make access control decisions to the best of our knowledge all contextbased copresence verification mechanisms to date are susceptible to contextmanipulation attacks in such attacks a distributed adversary replicates the same context at the different locations of the victim devices and induces them to believe that they are copresent in this paper we propose doubleecho a contextbased copresence verification technique that leverages acoustic room impulse response rir to mitigate contextmanipulation attacks in doubleecho one device emits a wideband audible chirp and all participating devices record reflections of the chirp from the surrounding environment since rir is by its very nature dependent on the physical surroundings it constitutes a unique location signature that is hard for an adversary to replicate we evaluate doubleecho by collecting rir data with various mobile devices and in a range of different locations we show that doubleecho mitigates contextmanipulation attacks whereas all other approaches to date are entirely vulnerable to such attacks doubleecho detects copresence or lack thereof in roughly 2 seconds and works on commodity devices
|
[['copresence', 'verification', 'based', 'on', 'context', 'can', 'improve', 'usability', 'and', 'strengthen', 'security', 'of', 'many', 'authentication', 'and', 'access', 'control', 'systems', 'by', 'sensing', 'and', 'comparing', 'their', 'surroundings', 'two', 'or', 'more', 'devices', 'can', 'tell', 'whether', 'they', 'are', 'copresent', 'and', 'use', 'this', 'information', 'to', 'make', 'access', 'control', 'decisions', 'to', 'the', 'best', 'of', 'our', 'knowledge', 'all', 'contextbased', 'copresence', 'verification', 'mechanisms', 'to', 'date', 'are', 'susceptible', 'to', 'contextmanipulation', 'attacks', 'in', 'such', 'attacks', 'a', 'distributed', 'adversary', 'replicates', 'the', 'same', 'context', 'at', 'the', 'different', 'locations', 'of', 'the', 'victim', 'devices', 'and', 'induces', 'them', 'to', 'believe', 'that', 'they', 'are', 'copresent', 'in', 'this', 'paper', 'we', 'propose', 'doubleecho', 'a', 'contextbased', 'copresence', 'verification', 'technique', 'that', 'leverages', 'acoustic', 'room', 'impulse', 'response', 'rir', 'to', 'mitigate', 'contextmanipulation', 'attacks', 'in', 'doubleecho', 'one', 'device', 'emits', 'a', 'wideband', 'audible', 'chirp', 'and', 'all', 'participating', 'devices', 'record', 'reflections', 'of', 'the', 'chirp', 'from', 'the', 'surrounding', 'environment', 'since', 'rir', 'is', 'by', 'its', 'very', 'nature', 'dependent', 'on', 'the', 'physical', 'surroundings', 'it', 'constitutes', 'a', 'unique', 'location', 'signature', 'that', 'is', 'hard', 'for', 'an', 'adversary', 'to', 'replicate', 'we', 'evaluate', 'doubleecho', 'by', 'collecting', 'rir', 'data', 'with', 'various', 'mobile', 'devices', 'and', 'in', 'a', 'range', 'of', 'different', 'locations', 'we', 'show', 'that', 'doubleecho', 'mitigates', 'contextmanipulation', 'attacks', 'whereas', 'all', 'other', 'approaches', 'to', 'date', 'are', 'entirely', 'vulnerable', 'to', 'such', 'attacks', 'doubleecho', 'detects', 'copresence', 'or', 'lack', 'thereof', 'in', 'roughly', '2', 'seconds', 'and', 'works', 'on', 'commodity', 'devices']]
|
[-0.15906411610443943, 0.0451913441559771, -0.051525188634349475, 0.0465049751657283, -0.1251474445796616, -0.21948584150966435, 0.0873413540510228, 0.41516539533179075, -0.24507630097546748, -0.3307088779684688, 0.12965316903428176, -0.3172626322623165, -0.15647343567217745, 0.21007745750470175, -0.14650883121593367, 0.04193180312507874, 0.014435540421289347, -0.006335412919343937, 0.008367158784780518, -0.24342272237741522, 0.29368398066975976, 0.0427479488387083, 0.31959397059399636, 0.047787303015190574, 0.06909494348857108, 0.02334222027122797, -0.0181311193232735, -0.045125849834100035, -0.01411152422134321, 0.09345769634736435, 0.3095023804865334, 0.16977470626921526, 0.30495978450136524, -0.4475223753224349, -0.21010900403018154, 0.06576944117689328, 0.11969792683930358, 0.11973846145861206, -0.03968918871202429, -0.3263567555052716, 0.14524593308811917, -0.20934693343006075, -0.05171551320645016, -0.07033368048169428, -0.006551895328309565, 0.030567240440064952, -0.215026382529842, -0.016239402239166555, 0.03676411981827447, 0.035421960977172214, -0.029749477688580685, -0.041386681863860714, 0.017828411901081424, 0.19601229908959275, 0.01954845422601682, -0.04756622108855351, 0.21457498282681972, -0.12044929503432027, -0.1545704302644091, 0.364327330026953, 0.009704871352628939, -0.14512324515824385, 0.2371778652737183, -0.06249316364881538, -0.11246060512923924, 0.11347436378377357, 0.2207056982531434, 0.08960161738186365, -0.18253217584653092, -0.0061985491630843, 0.01922871876463649, 0.2246950480998272, 0.07941000466013239, 0.09000734993300977, 0.19784059755371086, 0.16055710336769977, 0.07154331974687964, 0.10216009474963704, -0.08759962678457323, -0.025715960340485688, -0.19751307623837852, -0.09443013158826423, -0.17555042822634623, 0.021906757654090014, -0.019506198589667855, -0.1183969008071082, 0.36031701496935314, 0.26293925819253283, 0.17115071573782534, 0.031241296598732118, 0.3891961475235543, 0.00010183356269927961, 0.10176616898250013, 0.11089099888201981, 0.21185108504169398, 0.011154287024622872, 0.1214470750674428, -0.15016323623491362, 0.17327049293311403, -0.05402957488827052]
|
1,803.07212
|
Real-time Burst Photo Selection Using a Light-Head Adversarial Network
|
We present an automatic moment capture system that runs in real-time on
mobile cameras. The system is designed to run in the viewfinder mode and
capture a burst sequence of frames before and after the shutter is pressed. For
each frame, the system predicts in real-time a "goodness" score, based on which
the best moment in the burst can be selected immediately after the shutter is
released, without any user interference. To solve the problem, we develop a
highly efficient deep neural network ranking model, which implicitly learns a
"latent relative attribute" space to capture subtle visual differences within a
sequence of burst images. Then the overall goodness is computed as a linear
aggregation of the goodnesses of all the latent attributes. The latent relative
attributes and the aggregation function can be seamlessly integrated in one
fully convolutional network and trained in an end-to-end fashion. To obtain a
compact model which can run on mobile devices in real-time, we have explored
and evaluated a wide range of network design choices, taking into account the
constraints of model size, computational cost, and accuracy. Extensive studies
show that the best frame predicted by our model hit users' top-1 (out of 11 on
average) choice for $64.1\%$ cases and top-3 choices for $86.2\%$ cases.
Moreover, the model(only 0.47M Bytes) can run in real time on mobile devices,
e.g. only 13ms on iPhone 7 for one frame prediction.
|
cs.CV
|
we present an automatic moment capture system that runs in realtime on mobile cameras the system is designed to run in the viewfinder mode and capture a burst sequence of frames before and after the shutter is pressed for each frame the system predicts in realtime a goodness score based on which the best moment in the burst can be selected immediately after the shutter is released without any user interference to solve the problem we develop a highly efficient deep neural network ranking model which implicitly learns a latent relative attribute space to capture subtle visual differences within a sequence of burst images then the overall goodness is computed as a linear aggregation of the goodnesses of all the latent attributes the latent relative attributes and the aggregation function can be seamlessly integrated in one fully convolutional network and trained in an endtoend fashion to obtain a compact model which can run on mobile devices in realtime we have explored and evaluated a wide range of network design choices taking into account the constraints of model size computational cost and accuracy extensive studies show that the best frame predicted by our model hit users top1 out of 11 on average choice for 641 cases and top3 choices for 862 cases moreover the modelonly 047m bytes can run in real time on mobile devices eg only 13ms on iphone 7 for one frame prediction
|
[['we', 'present', 'an', 'automatic', 'moment', 'capture', 'system', 'that', 'runs', 'in', 'realtime', 'on', 'mobile', 'cameras', 'the', 'system', 'is', 'designed', 'to', 'run', 'in', 'the', 'viewfinder', 'mode', 'and', 'capture', 'a', 'burst', 'sequence', 'of', 'frames', 'before', 'and', 'after', 'the', 'shutter', 'is', 'pressed', 'for', 'each', 'frame', 'the', 'system', 'predicts', 'in', 'realtime', 'a', 'goodness', 'score', 'based', 'on', 'which', 'the', 'best', 'moment', 'in', 'the', 'burst', 'can', 'be', 'selected', 'immediately', 'after', 'the', 'shutter', 'is', 'released', 'without', 'any', 'user', 'interference', 'to', 'solve', 'the', 'problem', 'we', 'develop', 'a', 'highly', 'efficient', 'deep', 'neural', 'network', 'ranking', 'model', 'which', 'implicitly', 'learns', 'a', 'latent', 'relative', 'attribute', 'space', 'to', 'capture', 'subtle', 'visual', 'differences', 'within', 'a', 'sequence', 'of', 'burst', 'images', 'then', 'the', 'overall', 'goodness', 'is', 'computed', 'as', 'a', 'linear', 'aggregation', 'of', 'the', 'goodnesses', 'of', 'all', 'the', 'latent', 'attributes', 'the', 'latent', 'relative', 'attributes', 'and', 'the', 'aggregation', 'function', 'can', 'be', 'seamlessly', 'integrated', 'in', 'one', 'fully', 'convolutional', 'network', 'and', 'trained', 'in', 'an', 'endtoend', 'fashion', 'to', 'obtain', 'a', 'compact', 'model', 'which', 'can', 'run', 'on', 'mobile', 'devices', 'in', 'realtime', 'we', 'have', 'explored', 'and', 'evaluated', 'a', 'wide', 'range', 'of', 'network', 'design', 'choices', 'taking', 'into', 'account', 'the', 'constraints', 'of', 'model', 'size', 'computational', 'cost', 'and', 'accuracy', 'extensive', 'studies', 'show', 'that', 'the', 'best', 'frame', 'predicted', 'by', 'our', 'model', 'hit', 'users', 'top1', 'out', 'of', '11', 'on', 'average', 'choice', 'for', '641', 'cases', 'and', 'top3', 'choices', 'for', '862', 'cases', 'moreover', 'the', 'modelonly', '047m', 'bytes', 'can', 'run', 'in', 'real', 'time', 'on', 'mobile', 'devices', 'eg', 'only', '13ms', 'on', 'iphone', '7', 'for', 'one', 'frame', 'prediction']]
|
[-0.08302192836291278, 0.01987389200480918, -0.05593898266113525, 0.060925235204479615, -0.07235648185596802, -0.17721075341915307, 0.07486431183921093, 0.4575877187692601, -0.24704691909010643, -0.35588505726874525, 0.08410346701984173, -0.26401134974363705, -0.11326707926092912, 0.18746601018406775, -0.10172093013483707, 0.0591629767253914, 0.12328783923699319, 0.08233540898907686, -0.056520650190878256, -0.290470325785851, 0.24627275072878388, 0.07264034571417141, 0.3032654802598383, 0.00031364897225538024, 0.138533662530877, 0.01879357298324897, -0.025082740738340045, -0.005675630618165799, -0.05477978921547259, 0.1106724825551045, 0.2525744912498023, 0.1794958599731731, 0.2870208067110861, -0.43427177096676567, -0.22513271009792452, 0.06381959884488227, 0.12868688730643202, 0.05663711187611942, -0.004731864371822904, -0.3241680405031809, 0.10448678885282868, -0.19568298791849015, 0.002396998408822464, -0.07591396524955558, 0.017231557558229922, 0.01039759872643196, -0.3067110933616514, 0.014844138188409092, 0.02367299357663243, 0.028005713468377033, -0.08236822270340306, -0.06929332754098931, 0.010750632762969675, 0.1800799665223483, 0.0054294371142295066, 0.040667081632874094, 0.157890871589315, -0.13946376135167868, -0.10925505020675938, 0.3937208084592029, -0.05305148967486077, -0.19029221675034774, 0.14651862224563955, -0.06796053376899142, -0.11921520329424706, 0.12329171521832114, 0.2455817619541093, 0.09744013911315605, -0.18636204346042612, -0.00039122094243319465, -0.03209821886317197, 0.23910694442304742, 0.048317366255366284, -0.013583446531961469, 0.1930688984069528, 0.2290765150875339, 0.04238178673347094, 0.11174921612356506, -0.1346392911332457, -0.058815905850623615, -0.2546902563058488, -0.13753158349503317, -0.1779466313177102, -0.017215134670107584, -0.10994681424781447, -0.11291669560090194, 0.4232212991433461, 0.17612651841633994, 0.21782372264677416, 0.09602102149915678, 0.304886169085765, 0.06558746121844033, 0.10984188229093611, 0.09117650259488627, 0.19233798595226329, -0.019158965290483575, 0.12117245259856724, -0.1744402384916928, 0.1096995062822395, 0.054751068444760596]
|
1,803.07213
|
Search for exoplanets around northern circumpolar stars III. long-period
radial velocity variations in hd 18438 and hd 158996
|
Detecting exoplanets around giant stars sheds light on the later-stage
evolution of planetary systems. We observed the M giant HD 18438 and the K
giant HD 158996 as part of a Search for Exoplanets around Northern circumpolar
Stars (SENS) and obtained 38 and 24 spectra from 2010 to 2017 using the
high-resolution Bohyunsan Observatory Echelle Spectrograph (BOES) at the 1.8m
telescope of Bohyunsan Optical Astronomy Observatory in Korea. We obtained
precise RV measurements from the spectra and found long-period radial velocity
(RV) variations with period 719.0 days for HD 18438 and 820.2 days for HD
158996. We checked the chromospheric activities using Ca ii H and H_alpha
lines, HIPPARCOS photometry and line bisectors to identify the origin of the
observed RV variations. In the case of HD 18438, we conclude that the observed
RV variations with period 719.0 days are likely to be caused by the pulsations
because the periods of HIPPARCOS photometric and H alpha EW variations for HD
18438 are similar to that of RV variations in Lomb-Scargle periodogram, and
there are no correlations between bisectors and RV measurements. In the case of
HD 158996, on the other hand, we did not find any similarity in the respective
periodograms nor any correlation between RV variations and line bisector
variations. In addition, the probability that the real rotational period can be
as longer than the RV period for HD 158996 is only about 4.3%. Thus we conclude
that observed RV variations with a period of 820.2 days of HD 158996 are caused
by a planetary companion, which has the minimum mass of 14.0 MJup, the
semi-major axis of 2.1 AU, and eccentricity of 0.13 assuming the stellar mass
of 1.8 M_sun. HD 158996 is so far one of the brightest and largest stars to
harbor an exoplanet candidate.
|
astro-ph.EP
|
detecting exoplanets around giant stars sheds light on the laterstage evolution of planetary systems we observed the m giant hd 18438 and the k giant hd 158996 as part of a search for exoplanets around northern circumpolar stars sens and obtained 38 and 24 spectra from 2010 to 2017 using the highresolution bohyunsan observatory echelle spectrograph boes at the 18m telescope of bohyunsan optical astronomy observatory in korea we obtained precise rv measurements from the spectra and found longperiod radial velocity rv variations with period 7190 days for hd 18438 and 8202 days for hd 158996 we checked the chromospheric activities using ca ii h and h_alpha lines hipparcos photometry and line bisectors to identify the origin of the observed rv variations in the case of hd 18438 we conclude that the observed rv variations with period 7190 days are likely to be caused by the pulsations because the periods of hipparcos photometric and h alpha ew variations for hd 18438 are similar to that of rv variations in lombscargle periodogram and there are no correlations between bisectors and rv measurements in the case of hd 158996 on the other hand we did not find any similarity in the respective periodograms nor any correlation between rv variations and line bisector variations in addition the probability that the real rotational period can be as longer than the rv period for hd 158996 is only about 43 thus we conclude that observed rv variations with a period of 8202 days of hd 158996 are caused by a planetary companion which has the minimum mass of 140 mjup the semimajor axis of 21 au and eccentricity of 013 assuming the stellar mass of 18 m_sun hd 158996 is so far one of the brightest and largest stars to harbor an exoplanet candidate
|
[['detecting', 'exoplanets', 'around', 'giant', 'stars', 'sheds', 'light', 'on', 'the', 'laterstage', 'evolution', 'of', 'planetary', 'systems', 'we', 'observed', 'the', 'm', 'giant', 'hd', '18438', 'and', 'the', 'k', 'giant', 'hd', '158996', 'as', 'part', 'of', 'a', 'search', 'for', 'exoplanets', 'around', 'northern', 'circumpolar', 'stars', 'sens', 'and', 'obtained', '38', 'and', '24', 'spectra', 'from', '2010', 'to', '2017', 'using', 'the', 'highresolution', 'bohyunsan', 'observatory', 'echelle', 'spectrograph', 'boes', 'at', 'the', '18m', 'telescope', 'of', 'bohyunsan', 'optical', 'astronomy', 'observatory', 'in', 'korea', 'we', 'obtained', 'precise', 'rv', 'measurements', 'from', 'the', 'spectra', 'and', 'found', 'longperiod', 'radial', 'velocity', 'rv', 'variations', 'with', 'period', '7190', 'days', 'for', 'hd', '18438', 'and', '8202', 'days', 'for', 'hd', '158996', 'we', 'checked', 'the', 'chromospheric', 'activities', 'using', 'ca', 'ii', 'h', 'and', 'h_alpha', 'lines', 'hipparcos', 'photometry', 'and', 'line', 'bisectors', 'to', 'identify', 'the', 'origin', 'of', 'the', 'observed', 'rv', 'variations', 'in', 'the', 'case', 'of', 'hd', '18438', 'we', 'conclude', 'that', 'the', 'observed', 'rv', 'variations', 'with', 'period', '7190', 'days', 'are', 'likely', 'to', 'be', 'caused', 'by', 'the', 'pulsations', 'because', 'the', 'periods', 'of', 'hipparcos', 'photometric', 'and', 'h', 'alpha', 'ew', 'variations', 'for', 'hd', '18438', 'are', 'similar', 'to', 'that', 'of', 'rv', 'variations', 'in', 'lombscargle', 'periodogram', 'and', 'there', 'are', 'no', 'correlations', 'between', 'bisectors', 'and', 'rv', 'measurements', 'in', 'the', 'case', 'of', 'hd', '158996', 'on', 'the', 'other', 'hand', 'we', 'did', 'not', 'find', 'any', 'similarity', 'in', 'the', 'respective', 'periodograms', 'nor', 'any', 'correlation', 'between', 'rv', 'variations', 'and', 'line', 'bisector', 'variations', 'in', 'addition', 'the', 'probability', 'that', 'the', 'real', 'rotational', 'period', 'can', 'be', 'as', 'longer', 'than', 'the', 'rv', 'period', 'for', 'hd', '158996', 'is', 'only', 'about', '43', 'thus', 'we', 'conclude', 'that', 'observed', 'rv', 'variations', 'with', 'a', 'period', 'of', '8202', 'days', 'of', 'hd', '158996', 'are', 'caused', 'by', 'a', 'planetary', 'companion', 'which', 'has', 'the', 'minimum', 'mass', 'of', '140', 'mjup', 'the', 'semimajor', 'axis', 'of', '21', 'au', 'and', 'eccentricity', 'of', '013', 'assuming', 'the', 'stellar', 'mass', 'of', '18', 'm_sun', 'hd', '158996', 'is', 'so', 'far', 'one', 'of', 'the', 'brightest', 'and', 'largest', 'stars', 'to', 'harbor', 'an', 'exoplanet', 'candidate']]
|
[-0.1257451200047134, 0.12952511511276044, -0.0736554542363288, 0.03437886560370018, -0.12512609798673005, -0.10929910320536323, 0.07547730286247455, 0.4065124039440089, -0.13627347757457367, -0.35012901067596713, 0.09974613775231293, -0.3202002883261345, -0.08751377960772917, 0.23168955357390203, -0.10575642110059585, 0.0027020788488440048, 0.17841505745338607, -0.039673276837404355, -0.01825745011419743, -0.24635881735603746, 0.2337663625585021, 0.047488783103846834, 0.047858224061931354, -0.05052341057071743, 0.013780897415580265, -0.06926718177071409, -0.08632485676538526, -0.063684753785891, -0.1526499070110536, 0.029941814468806005, 0.20196671745524566, 0.13142466911326559, 0.15097226942718078, -0.2537246430417317, -0.1784266204632395, 0.07089806654035771, 0.15958552165766773, -0.045610748705248595, 0.028567025990826528, -0.3020197382947449, 0.10102253116785632, -0.13210674379266998, -0.17010000972295286, 0.062393314323472136, 0.16188401653490536, 0.019089258891876078, -0.24942458990998692, 0.09679633163477927, -0.006505286221175975, 0.2686234385734517, -0.17233546508980735, -0.16035208438856396, -0.09921138468845041, 0.08319712281663183, 0.024670992098962046, 0.055663460044869315, 0.05972094934458617, -0.027191031805199127, -0.048265124628138124, 0.4212249855831714, -0.18318438210492888, 0.04306248052864893, 0.1920855335235583, -0.2528197431398001, -0.16359002362542713, 0.14199817330143524, 0.13875014414023032, 0.15440017782559737, -0.15941329038839003, -0.023154555670613343, -0.0071849823387395775, 0.2576404645662119, 0.12574979076457884, 0.056079504142801925, 0.33707870285721325, 0.04531876471541498, 0.033390144724866073, -0.00021302971457844494, -0.36779327294789255, -0.03305008554485405, -0.16754433962152057, -0.11610889967521622, -0.10851221376746568, 0.038514773437940596, -0.09671473463335936, -0.09890837147582733, 0.3443000318333008, 0.11514240538586168, 0.1928300730328085, 0.02117054879371027, 0.28613260630082127, 0.10403708200964043, 0.11725403175438734, 0.13531566894516647, 0.33247154208529356, 0.18311224773956034, 0.16390366339900322, -0.27405621895541665, 0.09205602908298298, -0.009716495822096573]
|
1,803.07214
|
Infinite-Dimensional Triangularizable Algebras
|
Let End(V) denote the ring of all linear transformations of an arbitrary
k-vector space V over a field k. We define a subset X of End(V) to be
"triangularizable" if V has a well-ordered basis such that X sends each vector
in that basis to the subspace spanned by basis vectors no greater than it. We
then show that an arbitrary subset of End(V) is "strictly" triangularizable
(defined in the obvious way) if and only if it is topologically nilpotent. This
generalizes the theorem of Levitzki that every nilpotent semigroup of matrices
is triangularizable. We also give a description of the triangularizable
subalgebras of End(V), which generalizes of a theorem of McCoy classifying
triangularizable algebras of matrices over algebraically closed fields.
|
math.RA
|
let endv denote the ring of all linear transformations of an arbitrary kvector space v over a field k we define a subset x of endv to be triangularizable if v has a wellordered basis such that x sends each vector in that basis to the subspace spanned by basis vectors no greater than it we then show that an arbitrary subset of endv is strictly triangularizable defined in the obvious way if and only if it is topologically nilpotent this generalizes the theorem of levitzki that every nilpotent semigroup of matrices is triangularizable we also give a description of the triangularizable subalgebras of endv which generalizes of a theorem of mccoy classifying triangularizable algebras of matrices over algebraically closed fields
|
[['let', 'endv', 'denote', 'the', 'ring', 'of', 'all', 'linear', 'transformations', 'of', 'an', 'arbitrary', 'kvector', 'space', 'v', 'over', 'a', 'field', 'k', 'we', 'define', 'a', 'subset', 'x', 'of', 'endv', 'to', 'be', 'triangularizable', 'if', 'v', 'has', 'a', 'wellordered', 'basis', 'such', 'that', 'x', 'sends', 'each', 'vector', 'in', 'that', 'basis', 'to', 'the', 'subspace', 'spanned', 'by', 'basis', 'vectors', 'no', 'greater', 'than', 'it', 'we', 'then', 'show', 'that', 'an', 'arbitrary', 'subset', 'of', 'endv', 'is', 'strictly', 'triangularizable', 'defined', 'in', 'the', 'obvious', 'way', 'if', 'and', 'only', 'if', 'it', 'is', 'topologically', 'nilpotent', 'this', 'generalizes', 'the', 'theorem', 'of', 'levitzki', 'that', 'every', 'nilpotent', 'semigroup', 'of', 'matrices', 'is', 'triangularizable', 'we', 'also', 'give', 'a', 'description', 'of', 'the', 'triangularizable', 'subalgebras', 'of', 'endv', 'which', 'generalizes', 'of', 'a', 'theorem', 'of', 'mccoy', 'classifying', 'triangularizable', 'algebras', 'of', 'matrices', 'over', 'algebraically', 'closed', 'fields']]
|
[-0.21402722592504064, 0.14445465954991388, -0.04857118689447395, -0.025581637516710137, -0.08539115118386209, -0.17341304926850162, -0.006979000127358624, 0.38129027794338455, -0.3486762410684004, -0.09952146849356407, 0.0660996303782021, -0.25328456377610564, -0.1247418514175787, 0.1945924603818985, -0.0840418312875631, -0.09990587445314635, 0.04320145665460135, 0.15095084878300463, -0.12662019283503048, -0.30787919954712356, 0.3517508183852269, -0.0808275832971635, 0.17248069939072713, -0.0392826291696892, 0.1762918845850451, 0.06601738339782623, 0.009278541604010773, 0.03488966566678868, -0.10460013761651733, 0.08975789428126714, 0.32305290171691825, 0.18652401194515184, 0.23870802272018815, -0.317002791036565, -0.12574410229759705, 0.27323933141998763, 0.1755816737567036, -0.03337998336184893, 0.026790745679504614, -0.2674077381225965, 0.18561482114701972, -0.19573294065800334, -0.12467831879284633, -0.09010895450930458, 0.16236785592315026, -0.03879799305130381, -0.3249552102012883, -0.03022790813942686, 0.15063329278549165, 0.11219567006207572, -0.07224637007894964, -0.09548077340096366, -0.12317653562996753, 0.03362323361841484, -0.0697438288345348, 0.12267623140961548, 0.07606282809023815, 0.009505504153453368, -0.11521265128904506, 0.37466595517394463, -0.05721837409816717, -0.25655477332366894, 0.07991077831738498, -0.21449464292088447, -0.10468142147730143, 0.1264671725952182, 0.04943068879310134, 0.15700821113611055, -0.0650590464072533, 0.25301469761583845, -0.2308676082463858, 0.09663725699190327, 0.071249380499925, 0.04499403965055235, 0.11476106950936239, 0.05506573642088362, 0.13922534828013663, 0.09703285380916993, 0.06077753071296067, 0.0654465984591583, -0.3819237661601837, -0.19272392003773903, -0.17092237440765304, 0.15225347604464032, -0.08767895582928188, -0.18263830675566492, 0.4159473112691964, 0.10475524339232255, 0.22018396788688516, 0.06391925472970128, 0.20439710671828737, 0.07707997790560865, 0.08890664919225638, 0.1330807488142274, 0.051096506366767915, 0.25386654479190524, -0.09288429821772147, -0.10402805893489521, -0.022481593114808816, 0.1750325675561162]
|
1,803.07215
|
Supersimple structures with a dense independent subset
|
Based on the work done in \cite{BV-Tind,DMS} in the o-minimal and geometric
settings, we study expansions of models of a supersimple theory with a new
predicate distiguishing a set of forking-independent elements that is dense
inside a partial type $\mathcal{G}(x)$, which we call $H$-structures. We show
that any two such expansions have the same theory and that under some technical
conditions, the saturated models of this common theory are again
$H$-structures. We prove that under these assumptions the expansion is
supersimple and characterize forking and canonical bases of types in the
expansion. We also analyze the effect these expansions have on one-basedness
and CM-triviality. In the one-based case, when $T$ has $SU$-rank
$\omega^\alpha$ and the $SU$-rank is continuous, we take $\mathcal{G}(x)$ to be
the type of elements of $SU$-rank $\omega^\alpha$ and we describe a natural
"geometry of generics modulo $H$" associated with such expansions and show it
is modular.
|
math.LO
|
based on the work done in citebvtinddms in the ominimal and geometric settings we study expansions of models of a supersimple theory with a new predicate distiguishing a set of forkingindependent elements that is dense inside a partial type mathcalgx which we call hstructures we show that any two such expansions have the same theory and that under some technical conditions the saturated models of this common theory are again hstructures we prove that under these assumptions the expansion is supersimple and characterize forking and canonical bases of types in the expansion we also analyze the effect these expansions have on onebasedness and cmtriviality in the onebased case when t has surank omegaalpha and the surank is continuous we take mathcalgx to be the type of elements of surank omegaalpha and we describe a natural geometry of generics modulo h associated with such expansions and show it is modular
|
[['based', 'on', 'the', 'work', 'done', 'in', 'citebvtinddms', 'in', 'the', 'ominimal', 'and', 'geometric', 'settings', 'we', 'study', 'expansions', 'of', 'models', 'of', 'a', 'supersimple', 'theory', 'with', 'a', 'new', 'predicate', 'distiguishing', 'a', 'set', 'of', 'forkingindependent', 'elements', 'that', 'is', 'dense', 'inside', 'a', 'partial', 'type', 'mathcalgx', 'which', 'we', 'call', 'hstructures', 'we', 'show', 'that', 'any', 'two', 'such', 'expansions', 'have', 'the', 'same', 'theory', 'and', 'that', 'under', 'some', 'technical', 'conditions', 'the', 'saturated', 'models', 'of', 'this', 'common', 'theory', 'are', 'again', 'hstructures', 'we', 'prove', 'that', 'under', 'these', 'assumptions', 'the', 'expansion', 'is', 'supersimple', 'and', 'characterize', 'forking', 'and', 'canonical', 'bases', 'of', 'types', 'in', 'the', 'expansion', 'we', 'also', 'analyze', 'the', 'effect', 'these', 'expansions', 'have', 'on', 'onebasedness', 'and', 'cmtriviality', 'in', 'the', 'onebased', 'case', 'when', 't', 'has', 'surank', 'omegaalpha', 'and', 'the', 'surank', 'is', 'continuous', 'we', 'take', 'mathcalgx', 'to', 'be', 'the', 'type', 'of', 'elements', 'of', 'surank', 'omegaalpha', 'and', 'we', 'describe', 'a', 'natural', 'geometry', 'of', 'generics', 'modulo', 'h', 'associated', 'with', 'such', 'expansions', 'and', 'show', 'it', 'is', 'modular']]
|
[-0.13245205847233846, 0.1055725246807886, -0.11939717930989092, 0.05925874160586407, -0.05566183261417009, -0.07804107020928205, 0.033641905140398734, 0.3672080489748216, -0.27511335503948214, -0.1926892140906278, 0.1273440864764258, -0.25324337872012254, -0.1833702296757797, 0.17979065360097618, -0.0866560615481926, -0.013998270327863577, 0.017876687287059906, 0.10769522382545617, -0.07932100498110994, -0.24840115204818183, 0.3761277073583976, -0.05531543237645622, 0.22066196822072867, 0.038018055893545906, 0.09301064477686385, -0.031034589951883976, 0.0024925536651919772, 0.06660157269505146, -0.16630569345360927, 0.11439476300591042, 0.22929466324533748, 0.14487210558108674, 0.2518299276829808, -0.4189987229513024, -0.1717770570055484, 0.1274752271153241, 0.0809001858554572, 0.06941399643428858, -0.01656167372699723, -0.21640240483578632, 0.14526622651388682, -0.18145718992121154, -0.11873715092799256, -0.12205259138522866, 0.031171409204810648, 0.04796911997337619, -0.2978161390141382, 0.014201736493464364, 0.12616773062040443, 0.09078065123102934, -0.04447485585664432, -0.08925059849682909, 0.024891838393910053, 0.07076915656318204, 0.015562422580079182, -0.024328613010645435, 0.050066832394397756, -0.10015569870210403, -0.10141591052361927, 0.37059556479220623, -0.07336058445808875, -0.19039540110689984, 0.1925160639522063, -0.17185395262757694, -0.21227464669585958, 0.05828357720259134, 0.11206001748650016, 0.1430098715700678, -0.08520044021235561, 0.17924868492279333, -0.09482640291440424, 0.13358107914210304, 0.10741102826696905, 0.037941047583114014, 0.12194892784281001, 0.10656309044932934, 0.026674417666504746, 0.13540474212015294, -0.003911613825777011, -0.04841468451948432, -0.344430908736597, -0.17467310633901115, -0.10742241141086743, 0.06360641890205443, -0.10023747982275738, -0.20832089294998588, 0.3596699488368797, 0.14801825706886088, 0.18082104051173045, 0.06668709767445062, 0.22621490919011664, 0.12210119858156593, 0.06301518563519824, 0.07050320471578336, 0.16581608883005086, 0.13829982811519942, 0.005227615639984191, -0.15532627765584242, 0.03816092726807077, 0.11010575591801451]
|
1,803.07216
|
Mixing LSMC and PDE Methods to Price Bermudan Options
|
We develop a mixed least squares Monte Carlo-partial differential equation
(LSMC-PDE) method for pricing Bermudan style options on assets whose volatility
is stochastic. The algorithm is formulated for an arbitrary number of assets
and volatility processes and we prove the algorithm converges almost surely for
a class of models. We also discuss two methods to improve the algorithm's
computational complexity. Our numerical examples focus on the single ($2d$) and
multi-dimensional ($4d$) Heston models and we compare our hybrid algorithm with
classical LSMC approaches. In each case, we find that the hybrid algorithm
outperforms standard LSMC in terms of estimating prices and optimal exercise
boundaries.
|
q-fin.CP
|
we develop a mixed least squares monte carlopartial differential equation lsmcpde method for pricing bermudan style options on assets whose volatility is stochastic the algorithm is formulated for an arbitrary number of assets and volatility processes and we prove the algorithm converges almost surely for a class of models we also discuss two methods to improve the algorithms computational complexity our numerical examples focus on the single 2d and multidimensional 4d heston models and we compare our hybrid algorithm with classical lsmc approaches in each case we find that the hybrid algorithm outperforms standard lsmc in terms of estimating prices and optimal exercise boundaries
|
[['we', 'develop', 'a', 'mixed', 'least', 'squares', 'monte', 'carlopartial', 'differential', 'equation', 'lsmcpde', 'method', 'for', 'pricing', 'bermudan', 'style', 'options', 'on', 'assets', 'whose', 'volatility', 'is', 'stochastic', 'the', 'algorithm', 'is', 'formulated', 'for', 'an', 'arbitrary', 'number', 'of', 'assets', 'and', 'volatility', 'processes', 'and', 'we', 'prove', 'the', 'algorithm', 'converges', 'almost', 'surely', 'for', 'a', 'class', 'of', 'models', 'we', 'also', 'discuss', 'two', 'methods', 'to', 'improve', 'the', 'algorithms', 'computational', 'complexity', 'our', 'numerical', 'examples', 'focus', 'on', 'the', 'single', '2d', 'and', 'multidimensional', '4d', 'heston', 'models', 'and', 'we', 'compare', 'our', 'hybrid', 'algorithm', 'with', 'classical', 'lsmc', 'approaches', 'in', 'each', 'case', 'we', 'find', 'that', 'the', 'hybrid', 'algorithm', 'outperforms', 'standard', 'lsmc', 'in', 'terms', 'of', 'estimating', 'prices', 'and', 'optimal', 'exercise', 'boundaries']]
|
[-0.041996742320228736, -0.015433647079643217, -0.07210794556885958, 0.13826811096377617, -0.05811452378025826, -0.1792325480183696, 0.05702164189949376, 0.43771827713969874, -0.2677007879623595, -0.26238559618336604, 0.15053389569876863, -0.27615943312982794, -0.19850176894653807, 0.25141054766216114, -0.12766780740325795, 0.08202216823530548, 0.07869228766318045, -0.03679709960067389, -0.059242769183280565, -0.3292239773105465, 0.2587694821550566, -0.0008239694049253183, 0.26846567996065407, -0.032406062691235075, 0.18359445323071935, 0.0022172579980071854, -0.03803875890683711, 0.014047129892324116, -0.16857968691735603, 0.1358691423574426, 0.24607182668806477, 0.12277393157944293, 0.3272004523040617, -0.4062808547922246, -0.1686420278788051, 0.13304668771289632, 0.09843677184607276, 0.10275201898812335, -0.014134175429467623, -0.2259795537524327, 0.03547865317166582, -0.18974047894224377, -0.10422599204249826, -0.10575519261114738, -0.05695709960498646, 0.056681835535438915, -0.3538074171097547, 0.049020871513479794, 0.016452751944170278, -0.0013780159705692866, -0.05081962649801783, -0.18630420254981694, 0.027713072143823785, 0.05269818322039118, 0.06536614125955156, -0.06032807327003455, 0.08125674908674851, -0.09561203440249551, -0.25499569141196415, 0.33861529375152555, -0.10024929766579732, -0.2549392550307162, 0.15180180986941444, -0.07432416318367947, -0.1516101772842162, 0.10681409291996091, 0.2094977821643446, 0.16273378771181932, -0.1407483844177834, 0.12052440386454977, -0.05389395264415618, 0.14417372802706144, 0.002718669736721352, -0.04176293954928862, 0.09693586637320764, 0.22255147089862137, 0.1244658334363325, 0.1412839972797562, -0.07266306167687564, -0.19373236621693507, -0.2676796522356716, -0.1795953289336324, -0.15476662031027907, -0.029173001916348643, -0.17133327325113806, -0.21612625225794083, 0.37037094185293157, 0.19503726800686827, 0.09235952129843188, 0.1690445579497107, 0.3292966167643374, 0.15823988609390297, -0.061133652825054584, 0.1614121832090485, 0.111638563139565, 0.043966094935860706, 0.08769567997432222, -0.20566146990613027, 0.11027221476850922, 0.13397792289398758]
|
1,803.07217
|
Constrained field theories on Kerr backgrounds
|
We analyze the constraints of gauge theories on Kerr and Kerr-de Sitter
spacetimes, which contain one or more horizons. We find that the constraints
are modified on such backgrounds through the presence of additional surface
terms at the horizons. As a concrete example, we consider the Maxwell field and
find that the Gauss law constraint involves surface corrections at the
horizons. These surface contributions correspond to induced surface charges and
currents on the horizons, which agree with those found within the membrane
paradigm. The modification of the Gauss law constraint also influences the
gauge fixing and Dirac brackets of the theory.
|
gr-qc hep-th
|
we analyze the constraints of gauge theories on kerr and kerrde sitter spacetimes which contain one or more horizons we find that the constraints are modified on such backgrounds through the presence of additional surface terms at the horizons as a concrete example we consider the maxwell field and find that the gauss law constraint involves surface corrections at the horizons these surface contributions correspond to induced surface charges and currents on the horizons which agree with those found within the membrane paradigm the modification of the gauss law constraint also influences the gauge fixing and dirac brackets of the theory
|
[['we', 'analyze', 'the', 'constraints', 'of', 'gauge', 'theories', 'on', 'kerr', 'and', 'kerrde', 'sitter', 'spacetimes', 'which', 'contain', 'one', 'or', 'more', 'horizons', 'we', 'find', 'that', 'the', 'constraints', 'are', 'modified', 'on', 'such', 'backgrounds', 'through', 'the', 'presence', 'of', 'additional', 'surface', 'terms', 'at', 'the', 'horizons', 'as', 'a', 'concrete', 'example', 'we', 'consider', 'the', 'maxwell', 'field', 'and', 'find', 'that', 'the', 'gauss', 'law', 'constraint', 'involves', 'surface', 'corrections', 'at', 'the', 'horizons', 'these', 'surface', 'contributions', 'correspond', 'to', 'induced', 'surface', 'charges', 'and', 'currents', 'on', 'the', 'horizons', 'which', 'agree', 'with', 'those', 'found', 'within', 'the', 'membrane', 'paradigm', 'the', 'modification', 'of', 'the', 'gauss', 'law', 'constraint', 'also', 'influences', 'the', 'gauge', 'fixing', 'and', 'dirac', 'brackets', 'of', 'the', 'theory']]
|
[-0.15959747741344651, 0.13240082998123795, -0.08643991362285053, 0.10668631910466321, -0.09873766358941793, -0.13210154435883212, -0.011959476879392151, 0.2797667252471541, -0.1858132617400572, -0.34173037727723027, 0.09100829416627784, -0.3188446635325061, -0.15593693231343117, 0.1857968332628618, -0.04270015056429449, -0.004296079218055647, -0.024834621351876175, 0.06770441039363936, -0.12975265755603957, -0.2310629932251344, 0.3948462028655749, 0.04623528031429442, 0.2435248785440137, 0.05520608504348905, 0.13342410315054073, -0.016356295265146707, -0.011566882261471583, 0.0661654511817021, -0.16106162662459375, 0.08297818939266081, 0.1245340027818733, 0.05168782981426114, 0.12836595012409852, -0.47248843637765336, -0.2419734686096706, 0.04989062678437717, 0.08016272890842566, 0.12623495559466283, -0.04501934073554781, -0.2888502726829288, 0.032152046350356525, -0.14139888302819564, -0.14497617168564092, -0.05916460446718306, -0.013810659826751615, -0.03480451732947685, -0.21249958318612067, 0.10301289393878911, 0.056233859872261045, 0.005608902409635853, -0.11597227845986438, -0.07177675257224848, -0.08056585147220752, 0.083375367379775, 0.149747792284447, -0.006733857533239787, 0.18907918185825542, -0.13422183025314813, -0.11442189934746463, 0.39361176342417553, -0.06986941505998077, -0.2453650736646487, 0.15217543404438708, -0.17955595842276764, -0.13199477953983857, 0.09824056527807866, 0.14731048108401276, 0.15923599842840708, -0.12764188547683233, 0.16734815134187367, 0.021724163868123352, 0.09844286694873751, 0.13840236102396825, 0.048986246302207506, 0.3198691753596805, 0.03604593817697893, 0.08265835726357038, 0.11129185585950566, -0.057377786207298685, -0.09644863278648844, -0.42848312262777644, -0.1552471321186807, -0.1059851201140497, 0.05806718831466935, -0.1361353533004761, -0.18275321926921606, 0.3290675833341804, 0.08928581966216316, 0.13789316392353837, 0.05697469859808167, 0.21281223111592307, 0.12166300925799636, 0.11056122837569748, 0.0825059153001276, 0.2852066026742358, 0.10682776719700582, 0.08728279274344297, -0.25776071530780614, -0.06774289989936175, 0.0870177604945026]
|
1,803.07218
|
A Temporally-Aware Interpolation Network for Video Frame Inpainting
|
We propose the first deep learning solution to video frame inpainting, a
challenging instance of the general video inpainting problem with applications
in video editing, manipulation, and forensics. Our task is less ambiguous than
frame interpolation and video prediction because we have access to both the
temporal context and a partial glimpse of the future, allowing us to better
evaluate the quality of a model's predictions objectively. We devise a pipeline
composed of two modules: a bidirectional video prediction module, and a
temporally-aware frame interpolation module. The prediction module makes two
intermediate predictions of the missing frames, one conditioned on the
preceding frames and the other conditioned on the following frames, using a
shared convolutional LSTM-based encoder-decoder. The interpolation module
blends the intermediate predictions to form the final result. Specifically, it
utilizes time information and hidden activations from the video prediction
module to resolve disagreements between the predictions. Our experiments
demonstrate that our approach produces more accurate and qualitatively
satisfying results than a state-of-the-art video prediction method and many
strong frame inpainting baselines.
|
cs.CV
|
we propose the first deep learning solution to video frame inpainting a challenging instance of the general video inpainting problem with applications in video editing manipulation and forensics our task is less ambiguous than frame interpolation and video prediction because we have access to both the temporal context and a partial glimpse of the future allowing us to better evaluate the quality of a models predictions objectively we devise a pipeline composed of two modules a bidirectional video prediction module and a temporallyaware frame interpolation module the prediction module makes two intermediate predictions of the missing frames one conditioned on the preceding frames and the other conditioned on the following frames using a shared convolutional lstmbased encoderdecoder the interpolation module blends the intermediate predictions to form the final result specifically it utilizes time information and hidden activations from the video prediction module to resolve disagreements between the predictions our experiments demonstrate that our approach produces more accurate and qualitatively satisfying results than a stateoftheart video prediction method and many strong frame inpainting baselines
|
[['we', 'propose', 'the', 'first', 'deep', 'learning', 'solution', 'to', 'video', 'frame', 'inpainting', 'a', 'challenging', 'instance', 'of', 'the', 'general', 'video', 'inpainting', 'problem', 'with', 'applications', 'in', 'video', 'editing', 'manipulation', 'and', 'forensics', 'our', 'task', 'is', 'less', 'ambiguous', 'than', 'frame', 'interpolation', 'and', 'video', 'prediction', 'because', 'we', 'have', 'access', 'to', 'both', 'the', 'temporal', 'context', 'and', 'a', 'partial', 'glimpse', 'of', 'the', 'future', 'allowing', 'us', 'to', 'better', 'evaluate', 'the', 'quality', 'of', 'a', 'models', 'predictions', 'objectively', 'we', 'devise', 'a', 'pipeline', 'composed', 'of', 'two', 'modules', 'a', 'bidirectional', 'video', 'prediction', 'module', 'and', 'a', 'temporallyaware', 'frame', 'interpolation', 'module', 'the', 'prediction', 'module', 'makes', 'two', 'intermediate', 'predictions', 'of', 'the', 'missing', 'frames', 'one', 'conditioned', 'on', 'the', 'preceding', 'frames', 'and', 'the', 'other', 'conditioned', 'on', 'the', 'following', 'frames', 'using', 'a', 'shared', 'convolutional', 'lstmbased', 'encoderdecoder', 'the', 'interpolation', 'module', 'blends', 'the', 'intermediate', 'predictions', 'to', 'form', 'the', 'final', 'result', 'specifically', 'it', 'utilizes', 'time', 'information', 'and', 'hidden', 'activations', 'from', 'the', 'video', 'prediction', 'module', 'to', 'resolve', 'disagreements', 'between', 'the', 'predictions', 'our', 'experiments', 'demonstrate', 'that', 'our', 'approach', 'produces', 'more', 'accurate', 'and', 'qualitatively', 'satisfying', 'results', 'than', 'a', 'stateoftheart', 'video', 'prediction', 'method', 'and', 'many', 'strong', 'frame', 'inpainting', 'baselines']]
|
[-0.058603903688192585, -0.03147218866425371, -0.10094288808055395, 0.09933082310030734, -0.10668985089178869, -0.1925045034704665, 0.014180533956806718, 0.46314148615699174, -0.2779994830435012, -0.31818742115797777, 0.07477662948347347, -0.2686511584974522, -0.1615069867301256, 0.16052077812965698, -0.13623396208141605, 0.0869594537449979, 0.20889325635805508, 0.06799498195543366, -0.07949102510695433, -0.2617158380372255, 0.2756311182449788, 0.07376121128432123, 0.3280968015450378, 0.004409017395986201, 0.16219086050283338, 0.012190323409646056, -0.11251417563166903, -0.035806636252917, -0.06608866080700124, 0.19578708609603995, 0.3106454531820587, 0.16498568573923306, 0.3091842520787099, -0.41758454133496553, -0.21057375232542885, 0.05543719968747694, 0.11453014092389928, 0.12823130677421685, -0.05904785016875479, -0.33274388767583946, 0.08990098857408833, -0.16019574947774323, 0.06775305156466054, -0.10724374754110698, -0.007291071788342886, -0.04552840156721623, -0.33636856670383103, 0.040886076274165496, 0.06478297621998895, 0.01509088349425732, -0.1142554813989189, -0.052132458952634575, 0.05061477563360186, 0.19549040540884963, 0.02921737312896957, 0.11050964722634553, 0.12632399666404656, -0.19341636871404475, -0.13687727519183765, 0.407706432889194, -0.08717857839672984, -0.21899910554219426, 0.20832592125462238, -0.06690346380305845, -0.12170552617469586, 0.10257235008053654, 0.1737473665345406, 0.13897962371832595, -0.12087268814130492, -0.05149579758425568, -0.07245692486541758, 0.20622153328406775, 0.09330086509540114, 0.025179939382766418, 0.20425995945020817, 0.25299116185877124, 0.0005362884525269226, 0.1024643434174386, -0.14825447007396453, -0.0751314218572969, -0.24990529191766886, -0.12749445783899932, -0.14652733912090446, -0.06181804430779329, -0.11587454320008049, -0.11220507018625477, 0.4446503670553157, 0.2512253986314199, 0.22755383540941185, 0.12625063675304138, 0.3810615610049734, -0.011347066552167065, 0.09392748122796589, 0.06936431769315467, 0.15629217061105855, 0.03432747586170038, 0.1515078566627317, -0.12037767649176097, 0.05733408342348412, 0.11197053083640979]
|
1,803.07219
|
Brightening X-ray/Optical/Radio Emission of GW170817/SGRB 170817A:
Results of an Electron-Positron Wind from the Central Engine?
|
Recent follow-up observations of the binary neutron star (NS) merging event
GW170817/SGRB 170817A reveal that its X-ray/optical/radio emissions are
brightening continuously up to $\sim 100$ days post-merger. This late-time
brightening is unexpected from the kilonova model or the off-axis top-hat jet
model for gamma-ray burst afterglows. In this paper, by assuming that the
merger remnant is a long-lived NS, we propose that the interaction between an
electron-positron-pair ($e^+e^-$) wind from the central NS and the jet could
produce a long-lived reverse shock, from which a new emission component would
rise and can interpret current observations well. The magnetic-field-induced
ellipticity of the NS is taken to be $4 \times 10^{-5}$ in our modeling, so
that the braking of the NS is mainly through the gravitational wave (GW)
radiation rather than the magnetic dipole radiation, and the emission
luminosity at early times would not exceed the observational limits. In our
scenario, since the peak time of the brightening is roughly equal to the
spin-down time scale of the NS, the accurate peak time may help constrain the
ellipticity of the remnant NS. We suggest that radio polarization observations
of the brightening would help to distinguish our scenario from other scenarios.
Future observations on a large sample of short gamma-ray burst afterglows or
detections of GW signals from merger remnants would test our scenario.
|
astro-ph.HE
|
recent followup observations of the binary neutron star ns merging event gw170817sgrb 170817a reveal that its xrayopticalradio emissions are brightening continuously up to sim 100 days postmerger this latetime brightening is unexpected from the kilonova model or the offaxis tophat jet model for gammaray burst afterglows in this paper by assuming that the merger remnant is a longlived ns we propose that the interaction between an electronpositronpair ee wind from the central ns and the jet could produce a longlived reverse shock from which a new emission component would rise and can interpret current observations well the magneticfieldinduced ellipticity of the ns is taken to be 4 times 105 in our modeling so that the braking of the ns is mainly through the gravitational wave gw radiation rather than the magnetic dipole radiation and the emission luminosity at early times would not exceed the observational limits in our scenario since the peak time of the brightening is roughly equal to the spindown time scale of the ns the accurate peak time may help constrain the ellipticity of the remnant ns we suggest that radio polarization observations of the brightening would help to distinguish our scenario from other scenarios future observations on a large sample of short gammaray burst afterglows or detections of gw signals from merger remnants would test our scenario
|
[['recent', 'followup', 'observations', 'of', 'the', 'binary', 'neutron', 'star', 'ns', 'merging', 'event', 'gw170817sgrb', '170817a', 'reveal', 'that', 'its', 'xrayopticalradio', 'emissions', 'are', 'brightening', 'continuously', 'up', 'to', 'sim', '100', 'days', 'postmerger', 'this', 'latetime', 'brightening', 'is', 'unexpected', 'from', 'the', 'kilonova', 'model', 'or', 'the', 'offaxis', 'tophat', 'jet', 'model', 'for', 'gammaray', 'burst', 'afterglows', 'in', 'this', 'paper', 'by', 'assuming', 'that', 'the', 'merger', 'remnant', 'is', 'a', 'longlived', 'ns', 'we', 'propose', 'that', 'the', 'interaction', 'between', 'an', 'electronpositronpair', 'ee', 'wind', 'from', 'the', 'central', 'ns', 'and', 'the', 'jet', 'could', 'produce', 'a', 'longlived', 'reverse', 'shock', 'from', 'which', 'a', 'new', 'emission', 'component', 'would', 'rise', 'and', 'can', 'interpret', 'current', 'observations', 'well', 'the', 'magneticfieldinduced', 'ellipticity', 'of', 'the', 'ns', 'is', 'taken', 'to', 'be', '4', 'times', '105', 'in', 'our', 'modeling', 'so', 'that', 'the', 'braking', 'of', 'the', 'ns', 'is', 'mainly', 'through', 'the', 'gravitational', 'wave', 'gw', 'radiation', 'rather', 'than', 'the', 'magnetic', 'dipole', 'radiation', 'and', 'the', 'emission', 'luminosity', 'at', 'early', 'times', 'would', 'not', 'exceed', 'the', 'observational', 'limits', 'in', 'our', 'scenario', 'since', 'the', 'peak', 'time', 'of', 'the', 'brightening', 'is', 'roughly', 'equal', 'to', 'the', 'spindown', 'time', 'scale', 'of', 'the', 'ns', 'the', 'accurate', 'peak', 'time', 'may', 'help', 'constrain', 'the', 'ellipticity', 'of', 'the', 'remnant', 'ns', 'we', 'suggest', 'that', 'radio', 'polarization', 'observations', 'of', 'the', 'brightening', 'would', 'help', 'to', 'distinguish', 'our', 'scenario', 'from', 'other', 'scenarios', 'future', 'observations', 'on', 'a', 'large', 'sample', 'of', 'short', 'gammaray', 'burst', 'afterglows', 'or', 'detections', 'of', 'gw', 'signals', 'from', 'merger', 'remnants', 'would', 'test', 'our', 'scenario']]
|
[-0.09528875924495146, 0.15457554722561162, -0.08476868146668058, 0.145062281071141, -0.13871461959614742, -0.06648496724559812, 0.03151937840955239, 0.4113313947800058, -0.19260333912611446, -0.33513134381864473, 0.07895716984189491, -0.29160993585860295, -0.00282616739696507, 0.24033477890086086, 0.009286830568374283, -0.060809728311537026, 0.12804974009318706, -0.04249219027162441, -0.08305589953222527, -0.1926108762945248, 0.2507350949414614, 0.13823384589861185, 0.1590322838552039, 0.00772438931428486, 0.04834064915439122, -0.08157652904747298, -0.024574227270784017, -0.09293831715979761, -0.07221189076234338, -0.01949845072844938, 0.2063602061725719, 0.1687236861410083, 0.1497028274461627, -0.45608578691015, -0.2469302683034111, 0.10278996312464019, 0.15777688609790141, 0.05788896330545353, -0.028426061138380067, -0.3119193171746228, 0.05998690784642814, -0.24267840456234385, -0.1350695848047767, 0.09861999121810651, 0.058177994126169544, 0.0328606426983448, -0.23723123012515146, 0.14182479463495146, 0.04625286313331669, -0.047800667168850675, -0.09431029423255878, -0.00419946600539753, 0.001221240004018893, 0.007004190125709138, 0.12492963926744441, 0.12589032831180386, 0.14949418827301372, -0.1259352372236533, -0.1138339928684259, 0.37810991123756943, -0.0662506347761423, 0.03670019783159693, 0.19801736783501755, -0.24390755772034373, -0.1379702286246945, 0.2172263157954313, 0.16341997786715828, 0.09643708532928949, -0.11655196311938412, -0.06477456936076477, 0.030449604644080332, 0.2228614992211358, 0.053338774486246826, 0.046708008565210915, 0.3666154576457059, 0.15511909273834434, -0.002857448105443252, 0.0930115148144336, -0.2540111088268227, 0.022155299053181855, -0.30770261282584843, -0.0721963752883279, -0.14943679886905906, 0.1591322537023275, -0.12920865862361922, -0.08733565939750472, 0.39767373249575294, 0.14083989852843426, 0.17920714955170094, 0.04541511982768917, 0.2871143477231399, 0.11365727296075889, 0.07373699162269172, 0.11430544220227158, 0.3636878992249658, 0.11653413560043396, 0.12383798636260075, -0.23115478729411992, 0.11199437483262305, -0.044015234871451404]
|
1,803.0722
|
Collaborative Sparse Priors for Infrared Image Multi-view ATR
|
Feature extraction from infrared (IR) images remains a challenging task.
Learning based methods that can work on raw imagery/patches have therefore
assumed significance. We propose a novel multi-task extension of the widely
used sparse-representation-classification (SRC) method in both single and
multi-view set-ups. That is, the test sample could be a single IR image or
images from different views. When expanded in terms of a training dictionary,
the coefficient matrix in a multi-view scenario admits a sparse structure that
is not easily captured by traditional sparsity-inducing measures such as the
$l_0$-row pseudo norm. To that end, we employ collaborative spike and slab
priors on the coefficient matrix, which can capture fairly general sparse
structures. Our work involves joint parameter and sparse coefficient estimation
(JPCEM) which alleviates the need to handpick prior parameters before
classification. The experimental merits of JPCEM are substantiated through
comparisons with other state-of-art methods on a challenging mid-wave IR image
(MWIR) ATR database made available by the US Army Night Vision and Electronic
Sensors Directorate.
|
eess.IV
|
feature extraction from infrared ir images remains a challenging task learning based methods that can work on raw imagerypatches have therefore assumed significance we propose a novel multitask extension of the widely used sparserepresentationclassification src method in both single and multiview setups that is the test sample could be a single ir image or images from different views when expanded in terms of a training dictionary the coefficient matrix in a multiview scenario admits a sparse structure that is not easily captured by traditional sparsityinducing measures such as the l_0row pseudo norm to that end we employ collaborative spike and slab priors on the coefficient matrix which can capture fairly general sparse structures our work involves joint parameter and sparse coefficient estimation jpcem which alleviates the need to handpick prior parameters before classification the experimental merits of jpcem are substantiated through comparisons with other stateofart methods on a challenging midwave ir image mwir atr database made available by the us army night vision and electronic sensors directorate
|
[['feature', 'extraction', 'from', 'infrared', 'ir', 'images', 'remains', 'a', 'challenging', 'task', 'learning', 'based', 'methods', 'that', 'can', 'work', 'on', 'raw', 'imagerypatches', 'have', 'therefore', 'assumed', 'significance', 'we', 'propose', 'a', 'novel', 'multitask', 'extension', 'of', 'the', 'widely', 'used', 'sparserepresentationclassification', 'src', 'method', 'in', 'both', 'single', 'and', 'multiview', 'setups', 'that', 'is', 'the', 'test', 'sample', 'could', 'be', 'a', 'single', 'ir', 'image', 'or', 'images', 'from', 'different', 'views', 'when', 'expanded', 'in', 'terms', 'of', 'a', 'training', 'dictionary', 'the', 'coefficient', 'matrix', 'in', 'a', 'multiview', 'scenario', 'admits', 'a', 'sparse', 'structure', 'that', 'is', 'not', 'easily', 'captured', 'by', 'traditional', 'sparsityinducing', 'measures', 'such', 'as', 'the', 'l_0row', 'pseudo', 'norm', 'to', 'that', 'end', 'we', 'employ', 'collaborative', 'spike', 'and', 'slab', 'priors', 'on', 'the', 'coefficient', 'matrix', 'which', 'can', 'capture', 'fairly', 'general', 'sparse', 'structures', 'our', 'work', 'involves', 'joint', 'parameter', 'and', 'sparse', 'coefficient', 'estimation', 'jpcem', 'which', 'alleviates', 'the', 'need', 'to', 'handpick', 'prior', 'parameters', 'before', 'classification', 'the', 'experimental', 'merits', 'of', 'jpcem', 'are', 'substantiated', 'through', 'comparisons', 'with', 'other', 'stateofart', 'methods', 'on', 'a', 'challenging', 'midwave', 'ir', 'image', 'mwir', 'atr', 'database', 'made', 'available', 'by', 'the', 'us', 'army', 'night', 'vision', 'and', 'electronic', 'sensors', 'directorate']]
|
[-0.008440929462121409, 0.0064150367785866065, -0.0999301056275906, 0.040707328969240474, -0.12197787686320091, -0.1800167966931541, 0.017443104891428425, 0.4703734455239258, -0.2556355685932723, -0.3119680677011701, 0.10979994984536236, -0.2597100578800396, -0.1799178854001824, 0.1754621676899447, -0.14492571668521168, 0.09137601269995449, 0.12417898568925505, 0.031031692759881234, -0.10009039124117497, -0.24120451761323405, 0.300700797084259, 0.06411706847656104, 0.35349621439214657, -0.00028773577722870274, 0.10623453774225013, 0.020615207327437806, -0.05560078854488646, 0.007870493312998687, -0.03888751279054652, 0.15903001246660556, 0.32947916522576115, 0.17562679290185096, 0.287509490587076, -0.4024788062833303, -0.25825927844391433, 0.09169039480175455, 0.13480208121113663, 0.07007943693243748, -0.04873458025646454, -0.308178034208623, 0.043502223721050004, -0.1416902557232081, 0.009825462515661378, -0.11682214286037503, -0.04221182474313177, -0.05521663702035576, -0.3311936607843777, 0.08328144089893702, 0.025270871424265665, 0.05231765693306555, -0.055403561763936814, -0.13379227024730134, 0.04475357541297045, 0.11590596489744105, 0.02795711046362865, 0.04179604923536564, 0.15954073493219453, -0.14562658125960073, -0.10230588406090119, 0.36841035131824973, -0.062279636284658386, -0.20175351793762802, 0.1977529974178595, -0.0434220161901235, -0.1315726935432327, 0.11673041005781636, 0.19497004301965604, 0.124198388348529, -0.1771817617112071, 0.06398881527589473, -0.06873718384411875, 0.22773390073461436, 0.05379803118153682, 0.004600764323028817, 0.18868152056763202, 0.1792094477187888, 0.018761354337595862, 0.12146963506763123, -0.16917458182792927, -0.024442311422324475, -0.20620213522587294, -0.06334952368648195, -0.2377507348464411, -0.013242762327322846, -0.11219941455271544, -0.13804495574929465, 0.38374820446457575, 0.19195963277332026, 0.2269878114493173, 0.02542404285028439, 0.35765037027957997, 0.02947240020148456, 0.12661917353290375, 0.042045001584079325, 0.1995916209459581, 0.030788384168121366, 0.1044855043673135, -0.149082930282155, 0.08278460865322915, 0.06097626600868678]
|
1,803.07221
|
Study on the preparation of nanosulfur/bentonite complex
|
Inorganic compounds with sulfur have a good antifungal efficacy. However
there is a limit, sulfur is required in bulk quantities for application.
Nanosulfur might have a high anti-bacterial effect in a thin concentration.
Nanosulfur-bentonite composite was prepared from nanosulfur made by the
reaction between sodium thiosulfate and sulfuric acid and bentonite was used as
a carrier. The most appropriate reaction temperature, concentrations of Na2S2O3
5H2O and H2SO4, dropping rate and stirring one were determined. From SEM
images, it was illuminated that small particle size of nanosulfur deposited on
bentonite is in the range of 20-30nm and big one is in the range of 60-100nm.
|
physics.chem-ph
|
inorganic compounds with sulfur have a good antifungal efficacy however there is a limit sulfur is required in bulk quantities for application nanosulfur might have a high antibacterial effect in a thin concentration nanosulfurbentonite composite was prepared from nanosulfur made by the reaction between sodium thiosulfate and sulfuric acid and bentonite was used as a carrier the most appropriate reaction temperature concentrations of na2s2o3 5h2o and h2so4 dropping rate and stirring one were determined from sem images it was illuminated that small particle size of nanosulfur deposited on bentonite is in the range of 2030nm and big one is in the range of 60100nm
|
[['inorganic', 'compounds', 'with', 'sulfur', 'have', 'a', 'good', 'antifungal', 'efficacy', 'however', 'there', 'is', 'a', 'limit', 'sulfur', 'is', 'required', 'in', 'bulk', 'quantities', 'for', 'application', 'nanosulfur', 'might', 'have', 'a', 'high', 'antibacterial', 'effect', 'in', 'a', 'thin', 'concentration', 'nanosulfurbentonite', 'composite', 'was', 'prepared', 'from', 'nanosulfur', 'made', 'by', 'the', 'reaction', 'between', 'sodium', 'thiosulfate', 'and', 'sulfuric', 'acid', 'and', 'bentonite', 'was', 'used', 'as', 'a', 'carrier', 'the', 'most', 'appropriate', 'reaction', 'temperature', 'concentrations', 'of', 'na2s2o3', '5h2o', 'and', 'h2so4', 'dropping', 'rate', 'and', 'stirring', 'one', 'were', 'determined', 'from', 'sem', 'images', 'it', 'was', 'illuminated', 'that', 'small', 'particle', 'size', 'of', 'nanosulfur', 'deposited', 'on', 'bentonite', 'is', 'in', 'the', 'range', 'of', '2030nm', 'and', 'big', 'one', 'is', 'in', 'the', 'range', 'of', '60100nm']]
|
[-0.05189008779358119, 0.18338846389204264, -0.04027276735345367, -0.019528138125315307, 0.046495644561946395, -0.11767220760229975, 0.05447312276810408, 0.39631187754683195, -0.18857640498899855, -0.323487017378211, 0.08455533944885246, -0.3388746682647616, -0.07527784350422735, 0.1988157999573741, -0.05129175563808531, 0.03894736477755942, -0.007002111693145708, -0.02198163197375834, -0.01127226626034826, -0.23246157282032073, 0.2168016112758778, 0.09627272591926157, 0.27464560825377704, 0.10073190885363147, 0.0922570990724489, -0.0536974869761616, 0.06862964221276342, 0.020737756127491593, -0.12396032040276622, 0.062321044928394256, 0.2568133862037212, 0.027309071333147587, 0.2163722131308168, -0.42306109976023437, -0.24204778612591327, 0.049043058026582, 0.0916029056883417, 0.09589718925300986, -0.14477700424147769, -0.20059958792524413, 0.11117286289925687, -0.1341382816247642, -0.08873964735168556, 0.002912905649282038, 0.031676518126623705, 0.05061388859874569, -0.2580510980804684, 0.09463072902588465, -0.030595256322994827, 0.10765057211741805, -0.10202099631831515, -0.1731182454712689, -0.09191489738412201, 0.11278699744492769, 0.059501605294644835, 0.007604959268937819, 0.250809285454452, -0.08017987186089158, 0.022277831751853227, 0.3761285521602258, -0.09718839038163424, -0.11295749960030661, 0.222285015755333, -0.10787211858201771, -0.08664610818494112, 0.21730087483301758, 0.08134579552570358, 0.1381678487220779, -0.1768438792042434, 0.06095985238614958, -0.029874852625653148, 0.22199562364257872, 0.16325310284271835, -0.004549752725288272, 0.17742086293990725, 0.23627336813602595, -0.03178107696585357, 0.13152613199315966, -0.12208432601531967, -0.0020179305039346217, -0.1475256478600204, -0.2302731519844383, -0.18038761945441364, 0.07867203779751435, -0.06372886156590539, -0.1291754606179893, 0.2950414428091608, 0.08994554290547967, 0.18503053863532842, -0.08173040894092992, 0.20802235355600715, 0.04196024070377462, 0.09595348232891411, -0.019085362497717143, 0.24625239484477787, 0.1443263892317191, 0.11659871896976255, -0.20432478566188364, 0.18463455307995902, 0.004006142027210444]
|
1,803.07222
|
Realization of Arbitrary Configuration of Limit Cycles of Piecewise
Linear System
|
In this paper, we consider the realization of configuration of limit cycles
of piecewise linear systems on the plane. We show that any configuration of
Jordan curves can be realized by a discontinuous piecewise linear system with
two zones separated by a continuous curve.
|
math.CA
|
in this paper we consider the realization of configuration of limit cycles of piecewise linear systems on the plane we show that any configuration of jordan curves can be realized by a discontinuous piecewise linear system with two zones separated by a continuous curve
|
[['in', 'this', 'paper', 'we', 'consider', 'the', 'realization', 'of', 'configuration', 'of', 'limit', 'cycles', 'of', 'piecewise', 'linear', 'systems', 'on', 'the', 'plane', 'we', 'show', 'that', 'any', 'configuration', 'of', 'jordan', 'curves', 'can', 'be', 'realized', 'by', 'a', 'discontinuous', 'piecewise', 'linear', 'system', 'with', 'two', 'zones', 'separated', 'by', 'a', 'continuous', 'curve']]
|
[-0.23801175339824773, 0.11208141034215012, -0.057707520508715374, -0.05886988580195149, 0.0015315484594215047, -0.1350641329561106, 0.05384784754609096, 0.39061056585474446, -0.30872110834091226, -0.18131266703659837, 0.13631090897251852, -0.18565923441201448, -0.1973605974662033, 0.26455325447022915, -0.08823335074438629, 0.042007623579014435, 0.06034983711486513, -0.022390892067712477, -0.10853518451966176, -0.23552305074620314, 0.3711155812171372, -0.08356413579630581, 0.1851035564375872, -0.06494697420434518, 0.13748240159739825, 0.03214944531315599, 0.050581663084978405, 0.09049485676223412, -0.11349960844728973, 0.11342619090679694, 0.25801194543865597, 0.07320361854296854, 0.2108481556007808, -0.4153053304180503, -0.2745229408822276, 0.1736375310204246, 0.10231897872025994, 0.0798121196725829, 0.010845807537076656, -0.2236689962870018, 0.06491894798289816, -0.1489706373858181, -0.17986429867927323, -0.023662110049785537, 0.005139335947619243, 0.06957844323055311, -0.22923210419883783, 0.006251864664425904, 0.13069350332476792, 0.11179607310755686, -0.06649656117555093, -0.010415617215171964, -0.057056585580787876, 0.04973605095239526, -0.0754920447758526, 0.03135817758315666, 0.06094886371019212, -0.04323778013084931, -0.14147818004924126, 0.38970873708074744, -0.1375891166601584, -0.2279766268435527, 0.1649549146479165, -0.15204579469917173, -0.08408966650974682, 0.09886192312379452, 0.2063027675771578, 0.14939471198753876, -0.1358333139426329, 0.14858951250260527, -0.05782502157274972, 0.17391567018983717, 0.09924408689733934, -0.06965179147664458, 0.23494717842814597, 0.1224557723511349, 0.11136424162594433, 0.16969944449903612, -0.02259738970315084, -0.09970019080422142, -0.35219975831833755, -0.1433773523154245, -0.17093621889944188, 0.024494859643957832, -0.09660849798555401, -0.20494681016796015, 0.41157570642165164, 0.029726516381329435, 0.25594924737445335, 0.055985549491279846, 0.2634435143660415, 0.17938645084557886, 0.0004712697012688626, 0.06511536420492287, 0.2477077352391048, 0.07964087278709155, 0.03796812300358645, -0.1773650978734209, 0.024375483888434246, 0.11495255951938982]
|
1,803.07223
|
Color Dispersion as an Indicator of Stellar Population Complexity:
Insights from the Pixel Color-Magnitude Diagrams of 32 Bright Galaxies in
Abell 1139 and Abell 2589
|
We investigate the properties of bright galaxies with various morphological
types in Abell 1139 and Abell 2589, using the pixel color-magnitude diagram
(pCMD) analysis technique. The sample is 32 galaxies brighter than Mr = -21.3
mag with spectroscopic redshifts, which are deeply imaged in the g and r bands
using the MegaCam mounted on the Canada-France-Hawaii Telescope. After masking
contaminants with two-step procedures, we examine how the detailed properties
in pCMDs depend on galaxy morphology and infrared color. The mean g - r color
as a function of surface brightness (mu_r) in the pCMD of a galaxy shows fine
performance in distinguishing between early- and late-type galaxies, but it is
not perfect because of the similarity between elliptical galaxies and
bulge-dominated spiral galaxies. On the other hand, the g - r color dispersion
as a function of mu_r works better. We find that the best set of parameters for
galaxy classification is the combination of the minimum color dispersion at
mu_r <= 21.2 mag/arcsec^2 and the maximum color dispersion at 20.0 <= mu_r <=
21.0 mag/arcsec^2: the latter reflects the complexity of stellar populations at
the disk component in a typical spiral galaxy. Finally, the color dispersion
measurements of an elliptical galaxy appear to be correlated with the WISE
infrared color ([4.6] - [12]). This indicates that the complexity of stellar
populations in an elliptical galaxy is related with its recent star formation
activities. From this observational evidence, we infer that gas-rich minor
mergers or gas interactions may have usually happened during the recent growth
of massive elliptical galaxies.
|
astro-ph.GA
|
we investigate the properties of bright galaxies with various morphological types in abell 1139 and abell 2589 using the pixel colormagnitude diagram pcmd analysis technique the sample is 32 galaxies brighter than mr 213 mag with spectroscopic redshifts which are deeply imaged in the g and r bands using the megacam mounted on the canadafrancehawaii telescope after masking contaminants with twostep procedures we examine how the detailed properties in pcmds depend on galaxy morphology and infrared color the mean g r color as a function of surface brightness mu_r in the pcmd of a galaxy shows fine performance in distinguishing between early and latetype galaxies but it is not perfect because of the similarity between elliptical galaxies and bulgedominated spiral galaxies on the other hand the g r color dispersion as a function of mu_r works better we find that the best set of parameters for galaxy classification is the combination of the minimum color dispersion at mu_r 212 magarcsec2 and the maximum color dispersion at 200 mu_r 210 magarcsec2 the latter reflects the complexity of stellar populations at the disk component in a typical spiral galaxy finally the color dispersion measurements of an elliptical galaxy appear to be correlated with the wise infrared color 46 12 this indicates that the complexity of stellar populations in an elliptical galaxy is related with its recent star formation activities from this observational evidence we infer that gasrich minor mergers or gas interactions may have usually happened during the recent growth of massive elliptical galaxies
|
[['we', 'investigate', 'the', 'properties', 'of', 'bright', 'galaxies', 'with', 'various', 'morphological', 'types', 'in', 'abell', '1139', 'and', 'abell', '2589', 'using', 'the', 'pixel', 'colormagnitude', 'diagram', 'pcmd', 'analysis', 'technique', 'the', 'sample', 'is', '32', 'galaxies', 'brighter', 'than', 'mr', '213', 'mag', 'with', 'spectroscopic', 'redshifts', 'which', 'are', 'deeply', 'imaged', 'in', 'the', 'g', 'and', 'r', 'bands', 'using', 'the', 'megacam', 'mounted', 'on', 'the', 'canadafrancehawaii', 'telescope', 'after', 'masking', 'contaminants', 'with', 'twostep', 'procedures', 'we', 'examine', 'how', 'the', 'detailed', 'properties', 'in', 'pcmds', 'depend', 'on', 'galaxy', 'morphology', 'and', 'infrared', 'color', 'the', 'mean', 'g', 'r', 'color', 'as', 'a', 'function', 'of', 'surface', 'brightness', 'mu_r', 'in', 'the', 'pcmd', 'of', 'a', 'galaxy', 'shows', 'fine', 'performance', 'in', 'distinguishing', 'between', 'early', 'and', 'latetype', 'galaxies', 'but', 'it', 'is', 'not', 'perfect', 'because', 'of', 'the', 'similarity', 'between', 'elliptical', 'galaxies', 'and', 'bulgedominated', 'spiral', 'galaxies', 'on', 'the', 'other', 'hand', 'the', 'g', 'r', 'color', 'dispersion', 'as', 'a', 'function', 'of', 'mu_r', 'works', 'better', 'we', 'find', 'that', 'the', 'best', 'set', 'of', 'parameters', 'for', 'galaxy', 'classification', 'is', 'the', 'combination', 'of', 'the', 'minimum', 'color', 'dispersion', 'at', 'mu_r', '212', 'magarcsec2', 'and', 'the', 'maximum', 'color', 'dispersion', 'at', '200', 'mu_r', '210', 'magarcsec2', 'the', 'latter', 'reflects', 'the', 'complexity', 'of', 'stellar', 'populations', 'at', 'the', 'disk', 'component', 'in', 'a', 'typical', 'spiral', 'galaxy', 'finally', 'the', 'color', 'dispersion', 'measurements', 'of', 'an', 'elliptical', 'galaxy', 'appear', 'to', 'be', 'correlated', 'with', 'the', 'wise', 'infrared', 'color', '46', '12', 'this', 'indicates', 'that', 'the', 'complexity', 'of', 'stellar', 'populations', 'in', 'an', 'elliptical', 'galaxy', 'is', 'related', 'with', 'its', 'recent', 'star', 'formation', 'activities', 'from', 'this', 'observational', 'evidence', 'we', 'infer', 'that', 'gasrich', 'minor', 'mergers', 'or', 'gas', 'interactions', 'may', 'have', 'usually', 'happened', 'during', 'the', 'recent', 'growth', 'of', 'massive', 'elliptical', 'galaxies']]
|
[-0.0355445630751395, 0.05170299138539815, -0.1356206293643308, 0.08642868619201527, -0.1110797973408822, -0.045508815744330015, 0.004336471232356474, 0.48478485178294783, -0.1113981076235336, -0.3624832771999377, 0.03227270532275609, -0.30871437591988415, -0.07952315651530785, 0.16143688265260103, -0.06423589720904442, -0.04605070691179698, 0.03639396002639957, -0.08214385942269545, -0.06307781855427912, -0.331255992071607, 0.2879171514096448, 0.012805459102512233, 0.20684946395224885, -0.06610001381976338, 0.05806744924288184, -0.030861698652780246, -0.09494522991192912, -0.020723037831928758, -0.16697648019547318, -0.009435892167929855, 0.22878276073514292, 0.08481601183487487, 0.23408971600408207, -0.3077588140342183, -0.15296632708937286, 0.06666465416192151, 0.18982562002964273, 0.015733613722702666, -0.06819932307033534, -0.2814160505280135, 0.08086063513820547, -0.12738670773955713, -0.15545253219297303, 0.12008709729869022, 0.06439428654266521, 0.02223170870274771, -0.20151189587537258, 0.18818212336341347, 0.016280516721529976, 0.15569072687030133, -0.06942592971701367, -0.12779063520498485, -0.11198250795825429, 0.0782396385523801, -0.038470510660397216, 0.1135767541561527, 0.19459784902181357, -0.190681110215669, 0.014457744553626056, 0.4020146483718048, -0.048419288105097144, 0.027556937085353724, 0.2405587999697124, -0.20654637829607558, -0.16757926833538694, 0.07244420867036319, 0.1491084880572522, 0.08472274312017751, -0.14929444435429537, 0.03053785498588464, -0.025451975022738296, 0.22965058387582382, 0.04565696783977309, 0.08075835736177858, 0.30746949393032413, 0.10966256356868331, 0.04595086866729183, 0.10419909334473593, -0.25066902717327816, 0.04607096417356164, -0.22567489782407407, -0.08254840836693007, -0.15431652022876763, 0.05590425772248954, -0.18759977597420358, -0.12825030588456207, 0.3815511212580734, 0.07364931422339324, 0.23680081974626296, 0.057118255532779064, 0.2960959190244004, 0.04819249336674508, 0.16338378424748837, 0.11139081055316927, 0.2900022735397908, 0.17194632835601206, 0.012160004687584228, -0.26910390153006164, 0.031831273788979854, -0.002972094190125871]
|
1,803.07224
|
A development of an accelerator board dedicated for multi-precision
arithmetic operations and its application to Feynman loop integrals II
|
Evaluation of a wide variety of Feynman diagrams with multi-loop integrals
and physical parameters and its comparison with high energy experiments are
expected to investigate new physics beyond the Standard Model. We have been
developing a direct computation method of multi-loop integrals of Feynman
diagrams. One of features of our method is that we adopt the double exponential
rule for numerical integrations which enables us to evaluate loop integrals
with boundary singularities. Another feature is that in order to accelerate the
numerical integrations with multi-precision calculations, we develop an
accelerator system with Field Programmable Gate Array boards on which
processing elements with dedicated logic for quadruple/hexuple/octuple
precision arithmetic operations are implemented. In addition, we also develop a
programming interface designed for easy use of the system. The development is
continued for practical use of the system. We present the current development
of our system, and the numerical results of higher-loop diagrams performed
using our system.
|
hep-ph physics.comp-ph
|
evaluation of a wide variety of feynman diagrams with multiloop integrals and physical parameters and its comparison with high energy experiments are expected to investigate new physics beyond the standard model we have been developing a direct computation method of multiloop integrals of feynman diagrams one of features of our method is that we adopt the double exponential rule for numerical integrations which enables us to evaluate loop integrals with boundary singularities another feature is that in order to accelerate the numerical integrations with multiprecision calculations we develop an accelerator system with field programmable gate array boards on which processing elements with dedicated logic for quadruplehexupleoctuple precision arithmetic operations are implemented in addition we also develop a programming interface designed for easy use of the system the development is continued for practical use of the system we present the current development of our system and the numerical results of higherloop diagrams performed using our system
|
[['evaluation', 'of', 'a', 'wide', 'variety', 'of', 'feynman', 'diagrams', 'with', 'multiloop', 'integrals', 'and', 'physical', 'parameters', 'and', 'its', 'comparison', 'with', 'high', 'energy', 'experiments', 'are', 'expected', 'to', 'investigate', 'new', 'physics', 'beyond', 'the', 'standard', 'model', 'we', 'have', 'been', 'developing', 'a', 'direct', 'computation', 'method', 'of', 'multiloop', 'integrals', 'of', 'feynman', 'diagrams', 'one', 'of', 'features', 'of', 'our', 'method', 'is', 'that', 'we', 'adopt', 'the', 'double', 'exponential', 'rule', 'for', 'numerical', 'integrations', 'which', 'enables', 'us', 'to', 'evaluate', 'loop', 'integrals', 'with', 'boundary', 'singularities', 'another', 'feature', 'is', 'that', 'in', 'order', 'to', 'accelerate', 'the', 'numerical', 'integrations', 'with', 'multiprecision', 'calculations', 'we', 'develop', 'an', 'accelerator', 'system', 'with', 'field', 'programmable', 'gate', 'array', 'boards', 'on', 'which', 'processing', 'elements', 'with', 'dedicated', 'logic', 'for', 'quadruplehexupleoctuple', 'precision', 'arithmetic', 'operations', 'are', 'implemented', 'in', 'addition', 'we', 'also', 'develop', 'a', 'programming', 'interface', 'designed', 'for', 'easy', 'use', 'of', 'the', 'system', 'the', 'development', 'is', 'continued', 'for', 'practical', 'use', 'of', 'the', 'system', 'we', 'present', 'the', 'current', 'development', 'of', 'our', 'system', 'and', 'the', 'numerical', 'results', 'of', 'higherloop', 'diagrams', 'performed', 'using', 'our', 'system']]
|
[-0.14534451356671702, 0.04157796916606694, -0.11246569417779903, 0.03545538943892877, -0.09560877543741039, -0.11505434845344394, 0.0669029919209878, 0.39226947724819183, -0.2239521027953884, -0.31439483345353175, 0.1222029172848644, -0.23402969854242808, -0.1692373854253296, 0.27100685428126486, -0.006948268666747026, 0.09889537559832785, 0.13500986597500741, -0.015908491714591428, -0.1044154033095458, -0.2561912831741494, 0.29238345959471757, 0.05565697990974726, 0.21528860007551825, 0.04488258244917281, 0.10402258145985763, 0.018114687256929284, -0.04001757715127201, -0.010602591541148239, -0.10698987585207063, 0.15975550171396055, 0.25377941670277243, 0.11871899002648939, 0.23204085401368219, -0.4493766638583371, -0.1564896336980406, 0.024131261525893365, 0.15472241042955936, 0.10454590045756286, -0.046294088486650835, -0.24039487776576313, 0.07790926414883587, -0.22060811141046224, -0.14048762395131317, -0.18098187572080884, -0.02334728919940263, 0.02176810068670999, -0.27292206141396197, -0.023456907203510197, -0.026045059352847084, 0.07708782834478453, 0.012423703866533017, -0.11657205578347958, 0.058752590667928095, 0.131540728391257, -0.02310986824933887, 0.02460917889052857, 0.11375553103151743, -0.12807118469147524, -0.1954769543916374, 0.35505253410378057, -0.03837960481480393, -0.1961134886852913, 0.19386573994000042, -0.14006654472035876, -0.1344166992265465, 0.1297975651792843, 0.16389083536644164, 0.12408944233864933, -0.15210165263738712, 0.10593937255038469, 0.03020670573459938, 0.15671142672079724, 0.021174918643997183, -0.01599627955175646, 0.17934518170168068, 0.19497233819724483, 0.008172826147895282, 0.16692712798551354, -0.07967804272979644, -0.13400294034524107, -0.34411119450754546, -0.19678479864249948, -0.10559162502056109, -0.022339744429866023, -0.08008757351726435, -0.21937138576653192, 0.395737722528155, 0.21052976187270184, 0.11735824650541317, 0.06677821648228527, 0.325057541685445, 0.16020239136626266, 0.1451681101295565, 0.026896303301280615, 0.1956483548349858, 0.13157446262691821, 0.10742921844221555, -0.21747049719077088, -0.006901550002384012, 0.08074611718101161]
|
1,803.07225
|
Monte Carlo Information Geometry: The dually flat case
|
Exponential families and mixture families are parametric probability models
that can be geometrically studied as smooth statistical manifolds with respect
to any statistical divergence like the Kullback-Leibler (KL) divergence or the
Hellinger divergence. When equipping a statistical manifold with the KL
divergence, the induced manifold structure is dually flat, and the KL
divergence between distributions amounts to an equivalent Bregman divergence on
their corresponding parameters. In practice, the corresponding Bregman
generators of mixture/exponential families require to perform definite integral
calculus that can either be too time-consuming (for exponentially large
discrete support case) or even do not admit closed-form formula (for continuous
support case). In these cases, the dually flat construction remains theoretical
and cannot be used by information-geometric algorithms. To bypass this problem,
we consider performing stochastic Monte Carlo (MC) estimation of those
integral-based mixture/exponential family Bregman generators. We show that,
under natural assumptions, these MC generators are almost surely Bregman
generators. We define a series of dually flat information geometries, termed
Monte Carlo Information Geometries, that increasingly-finely approximate the
untractable geometry. The advantage of this MCIG is that it allows a practical
use of the Bregman algorithmic toolbox on a wide range of probability
distribution families. We demonstrate our approach with a clustering task on a
mixture family manifold.
|
cs.LG stat.ML
|
exponential families and mixture families are parametric probability models that can be geometrically studied as smooth statistical manifolds with respect to any statistical divergence like the kullbackleibler kl divergence or the hellinger divergence when equipping a statistical manifold with the kl divergence the induced manifold structure is dually flat and the kl divergence between distributions amounts to an equivalent bregman divergence on their corresponding parameters in practice the corresponding bregman generators of mixtureexponential families require to perform definite integral calculus that can either be too timeconsuming for exponentially large discrete support case or even do not admit closedform formula for continuous support case in these cases the dually flat construction remains theoretical and cannot be used by informationgeometric algorithms to bypass this problem we consider performing stochastic monte carlo mc estimation of those integralbased mixtureexponential family bregman generators we show that under natural assumptions these mc generators are almost surely bregman generators we define a series of dually flat information geometries termed monte carlo information geometries that increasinglyfinely approximate the untractable geometry the advantage of this mcig is that it allows a practical use of the bregman algorithmic toolbox on a wide range of probability distribution families we demonstrate our approach with a clustering task on a mixture family manifold
|
[['exponential', 'families', 'and', 'mixture', 'families', 'are', 'parametric', 'probability', 'models', 'that', 'can', 'be', 'geometrically', 'studied', 'as', 'smooth', 'statistical', 'manifolds', 'with', 'respect', 'to', 'any', 'statistical', 'divergence', 'like', 'the', 'kullbackleibler', 'kl', 'divergence', 'or', 'the', 'hellinger', 'divergence', 'when', 'equipping', 'a', 'statistical', 'manifold', 'with', 'the', 'kl', 'divergence', 'the', 'induced', 'manifold', 'structure', 'is', 'dually', 'flat', 'and', 'the', 'kl', 'divergence', 'between', 'distributions', 'amounts', 'to', 'an', 'equivalent', 'bregman', 'divergence', 'on', 'their', 'corresponding', 'parameters', 'in', 'practice', 'the', 'corresponding', 'bregman', 'generators', 'of', 'mixtureexponential', 'families', 'require', 'to', 'perform', 'definite', 'integral', 'calculus', 'that', 'can', 'either', 'be', 'too', 'timeconsuming', 'for', 'exponentially', 'large', 'discrete', 'support', 'case', 'or', 'even', 'do', 'not', 'admit', 'closedform', 'formula', 'for', 'continuous', 'support', 'case', 'in', 'these', 'cases', 'the', 'dually', 'flat', 'construction', 'remains', 'theoretical', 'and', 'can', 'not', 'be', 'used', 'by', 'informationgeometric', 'algorithms', 'to', 'bypass', 'this', 'problem', 'we', 'consider', 'performing', 'stochastic', 'monte', 'carlo', 'mc', 'estimation', 'of', 'those', 'integralbased', 'mixtureexponential', 'family', 'bregman', 'generators', 'we', 'show', 'that', 'under', 'natural', 'assumptions', 'these', 'mc', 'generators', 'are', 'almost', 'surely', 'bregman', 'generators', 'we', 'define', 'a', 'series', 'of', 'dually', 'flat', 'information', 'geometries', 'termed', 'monte', 'carlo', 'information', 'geometries', 'that', 'increasinglyfinely', 'approximate', 'the', 'untractable', 'geometry', 'the', 'advantage', 'of', 'this', 'mcig', 'is', 'that', 'it', 'allows', 'a', 'practical', 'use', 'of', 'the', 'bregman', 'algorithmic', 'toolbox', 'on', 'a', 'wide', 'range', 'of', 'probability', 'distribution', 'families', 'we', 'demonstrate', 'our', 'approach', 'with', 'a', 'clustering', 'task', 'on', 'a', 'mixture', 'family', 'manifold']]
|
[-0.07689614063308794, 0.05538824270992564, -0.11885876141281591, 0.15553226105920556, -0.10256711026352205, -0.1532645999332485, -0.008927698265131257, 0.4494954016023644, -0.31395685941133883, -0.2663597013182142, 0.1100917329352601, -0.26987900757372824, -0.1377276564511844, 0.1993133605931377, -0.13988504270406593, 0.09695306401542311, 0.09793314012779814, 0.014307176377084375, -0.14077560618465793, -0.2172797089285141, 0.3387906056837795, 0.054493355209340795, 0.29517505494742724, -0.04178308636081689, 0.1150717858567042, 0.004437422289868484, 0.005180839836093539, 0.036823082550553304, -0.15971165758775965, 0.14389345712075685, 0.26955644258012634, 0.14960602013583202, 0.26853366438996784, -0.3645143167493676, -0.198421811881663, 0.20176833222849647, 0.1386505700421468, 0.07252874818365067, -0.014842552589005138, -0.23736669663294863, 0.04949270910695915, -0.17101535643788351, -0.10363715488220686, -0.15625196518511444, -0.06922583705138254, 0.024145831356211993, -0.29290777620896563, 0.0662065909900995, 0.08504282832505622, 0.0689355245237981, 0.02080984464098569, -0.12452926415194204, 0.002537168159738975, 0.049516437583797555, 0.05945851694137884, 0.030613912112565467, 0.11362164997572197, -0.053592697809481823, -0.14015218406321778, 0.2910934316395368, -0.03629885618304969, -0.3065434377865443, 0.17224356049113876, -0.0927902309793151, -0.14548951188093368, 0.14044690057455342, 0.1582005195306155, 0.16753896662699969, -0.16696627335719919, 0.13230236283315633, -0.028624875181925972, 0.10337141999729643, 0.0661999521156152, 0.009302083658198443, 0.15652303866466175, 0.06175230708364667, 0.10465582334582699, 0.16368419023181183, -0.06286039198400084, -0.1741107954747147, -0.31826872953353225, -0.14616126714598787, -0.20001504652580057, 0.07810813484722996, -0.13092391882610568, -0.22937444135645665, 0.29878370921410946, 0.1048357173550766, 0.1793651852108862, 0.12918917899922516, 0.25949255054353193, 0.0786918325300198, 0.05972128303986997, 0.13501352061677677, 0.16758003527105106, 0.12576900560809254, -0.008843782519840675, -0.16238258276832096, 0.06721159355413475, 0.09458806812493266]
|
1,803.07226
|
Learning the Hierarchical Parts of Objects by Deep Non-Smooth
Nonnegative Matrix Factorization
|
Nonsmooth Nonnegative Matrix Factorization (nsNMF) is capable of producing
more localized, less overlapped feature representations than other variants of
NMF while keeping satisfactory fit to data. However, nsNMF as well as other
existing NMF methods is incompetent to learn hierarchical features of complex
data due to its shallow structure. To fill this gap, we propose a deep nsNMF
method coined by the fact that it possesses a deeper architecture compared with
standard nsNMF. The deep nsNMF not only gives parts-based features due to the
nonnegativity constraints, but also creates higher-level, more abstract
features by combing lower-level ones. The in-depth description of how deep
architecture can help to efficiently discover abstract features in dnsNMF is
presented. And we also show that the deep nsNMF has close relationship with the
deep autoencoder, suggesting that the proposed model inherits the major
advantages from both deep learning and NMF. Extensive experiments demonstrate
the standout performance of the proposed method in clustering analysis.
|
cs.CV cs.DS cs.NA
|
nonsmooth nonnegative matrix factorization nsnmf is capable of producing more localized less overlapped feature representations than other variants of nmf while keeping satisfactory fit to data however nsnmf as well as other existing nmf methods is incompetent to learn hierarchical features of complex data due to its shallow structure to fill this gap we propose a deep nsnmf method coined by the fact that it possesses a deeper architecture compared with standard nsnmf the deep nsnmf not only gives partsbased features due to the nonnegativity constraints but also creates higherlevel more abstract features by combing lowerlevel ones the indepth description of how deep architecture can help to efficiently discover abstract features in dnsnmf is presented and we also show that the deep nsnmf has close relationship with the deep autoencoder suggesting that the proposed model inherits the major advantages from both deep learning and nmf extensive experiments demonstrate the standout performance of the proposed method in clustering analysis
|
[['nonsmooth', 'nonnegative', 'matrix', 'factorization', 'nsnmf', 'is', 'capable', 'of', 'producing', 'more', 'localized', 'less', 'overlapped', 'feature', 'representations', 'than', 'other', 'variants', 'of', 'nmf', 'while', 'keeping', 'satisfactory', 'fit', 'to', 'data', 'however', 'nsnmf', 'as', 'well', 'as', 'other', 'existing', 'nmf', 'methods', 'is', 'incompetent', 'to', 'learn', 'hierarchical', 'features', 'of', 'complex', 'data', 'due', 'to', 'its', 'shallow', 'structure', 'to', 'fill', 'this', 'gap', 'we', 'propose', 'a', 'deep', 'nsnmf', 'method', 'coined', 'by', 'the', 'fact', 'that', 'it', 'possesses', 'a', 'deeper', 'architecture', 'compared', 'with', 'standard', 'nsnmf', 'the', 'deep', 'nsnmf', 'not', 'only', 'gives', 'partsbased', 'features', 'due', 'to', 'the', 'nonnegativity', 'constraints', 'but', 'also', 'creates', 'higherlevel', 'more', 'abstract', 'features', 'by', 'combing', 'lowerlevel', 'ones', 'the', 'indepth', 'description', 'of', 'how', 'deep', 'architecture', 'can', 'help', 'to', 'efficiently', 'discover', 'abstract', 'features', 'in', 'dnsnmf', 'is', 'presented', 'and', 'we', 'also', 'show', 'that', 'the', 'deep', 'nsnmf', 'has', 'close', 'relationship', 'with', 'the', 'deep', 'autoencoder', 'suggesting', 'that', 'the', 'proposed', 'model', 'inherits', 'the', 'major', 'advantages', 'from', 'both', 'deep', 'learning', 'and', 'nmf', 'extensive', 'experiments', 'demonstrate', 'the', 'standout', 'performance', 'of', 'the', 'proposed', 'method', 'in', 'clustering', 'analysis']]
|
[0.0017170319778571843, -0.03051571194512568, -0.13095231017892717, 0.1105252013609976, -0.14943004936976417, -0.2018629048927242, -0.013084444312295716, 0.43861150065330184, -0.3200609260416667, -0.33059599089204883, 0.0673158241741383, -0.28134787674091616, -0.22695329638826808, 0.13675422561176975, -0.08234392305254747, 0.05400816150043741, 0.12622569086679677, 0.013284736633994824, -0.10439567102540498, -0.24551998867481284, 0.3017880335141709, 0.07621906379980753, 0.3152145196989202, 0.02716150496505011, 0.11643447390472765, -0.03474469459763947, -0.033062132890336215, -0.0182962562024273, -0.008548708702984435, 0.1915682554304315, 0.30345605357229755, 0.20287352483304347, 0.29943234446921213, -0.4151320596103954, -0.25299221397063154, 0.07948207257279924, 0.16819118306776332, 0.06377325457176727, -0.03343984303691211, -0.30766334167568926, 0.1224338938333806, -0.14644116904826798, -0.038792890226646407, -0.1947245719563809, -0.05168678304239823, -0.032839655316698774, -0.23792909778199295, 0.05745270216331823, 0.11156514389692528, -0.011798875447908405, -0.06216980345253566, -0.1754066322331026, 0.01037988089363144, 0.07356465259377079, 0.03636034972636492, 0.053298592066190614, 0.08923576820707008, -0.18028135091855316, -0.09420410358602074, 0.34466151489170305, -0.07313656281862649, -0.18405534738117152, 0.2298656918915214, -0.030074722412380444, -0.1353883206767214, 0.13689174243266794, 0.16681419735979053, 0.07933824892588862, -0.1452763034609164, 0.03338746013116851, -0.06560705975587865, 0.17818652683791888, 0.0011083771916592766, 0.03330247689062243, 0.15456845728787266, 0.26172975561682393, 0.04049640281754694, 0.13550007147091636, -0.0982307979761427, -0.09565657207291502, -0.17335823503364423, -0.0790352854420947, -0.17840012392343563, -0.03251771152879269, -0.07562235437587918, -0.14554568729558026, 0.4188685994773249, 0.1971501948899192, 0.2550325060328528, 0.10003641580534019, 0.3541373098921624, 0.044913572234036345, 0.17934354067228403, 0.10153593941277285, 0.2199158279379462, 0.07413116274520186, 0.11233038458881224, -0.1596301804477598, 0.0943432169118125, 0.04276918605634361]
|
1,803.07227
|
On the Interfacial Phase Growth and Vacancy Evolution during Accelerated
Electromigration in Cu/Sn/Cu Microjoints
|
In this work, we integrate different computational tools based on
multi-phase-field simulations to account for the evolution of morphologies and
crystallographic defects of Cu/Sn/Cu sandwich interconnect structures that are
widely used in three dimensional integrated circuits (3DICs). Specifically,
this work accounts for diffusion-driven formation and disappearance of multiple
intermetallic phases during accelerated electromigration and takes into account
the non-equilibrium formation of vacancies due to electromigration. The work
compares nucleation, growth, and coalescence of intermetallic layers during
transient liquid phase bonding and virtual joint structure evolution subjected
to accelerated electromigration conditions at different temperatures. The
changes in the rate of dissolution of Cu from intermetallics and the
differences in the evolution of intermetallic layers depending on whether they
act as cathodes or anodes are accounted for and are compared favorably with
experiments. The model considers non-equilibrium evolution of vacancies that
form due to differences in couplings between diffusing atoms and electron
flows. This work is significant as the point defect evolution in 3DIC solder
joints during electromigration has deep implications to the formation and
coalescence of voids that ultimately compromise the structural and functional
integrity of the joints.
|
cond-mat.mtrl-sci
|
in this work we integrate different computational tools based on multiphasefield simulations to account for the evolution of morphologies and crystallographic defects of cusncu sandwich interconnect structures that are widely used in three dimensional integrated circuits 3dics specifically this work accounts for diffusiondriven formation and disappearance of multiple intermetallic phases during accelerated electromigration and takes into account the nonequilibrium formation of vacancies due to electromigration the work compares nucleation growth and coalescence of intermetallic layers during transient liquid phase bonding and virtual joint structure evolution subjected to accelerated electromigration conditions at different temperatures the changes in the rate of dissolution of cu from intermetallics and the differences in the evolution of intermetallic layers depending on whether they act as cathodes or anodes are accounted for and are compared favorably with experiments the model considers nonequilibrium evolution of vacancies that form due to differences in couplings between diffusing atoms and electron flows this work is significant as the point defect evolution in 3dic solder joints during electromigration has deep implications to the formation and coalescence of voids that ultimately compromise the structural and functional integrity of the joints
|
[['in', 'this', 'work', 'we', 'integrate', 'different', 'computational', 'tools', 'based', 'on', 'multiphasefield', 'simulations', 'to', 'account', 'for', 'the', 'evolution', 'of', 'morphologies', 'and', 'crystallographic', 'defects', 'of', 'cusncu', 'sandwich', 'interconnect', 'structures', 'that', 'are', 'widely', 'used', 'in', 'three', 'dimensional', 'integrated', 'circuits', '3dics', 'specifically', 'this', 'work', 'accounts', 'for', 'diffusiondriven', 'formation', 'and', 'disappearance', 'of', 'multiple', 'intermetallic', 'phases', 'during', 'accelerated', 'electromigration', 'and', 'takes', 'into', 'account', 'the', 'nonequilibrium', 'formation', 'of', 'vacancies', 'due', 'to', 'electromigration', 'the', 'work', 'compares', 'nucleation', 'growth', 'and', 'coalescence', 'of', 'intermetallic', 'layers', 'during', 'transient', 'liquid', 'phase', 'bonding', 'and', 'virtual', 'joint', 'structure', 'evolution', 'subjected', 'to', 'accelerated', 'electromigration', 'conditions', 'at', 'different', 'temperatures', 'the', 'changes', 'in', 'the', 'rate', 'of', 'dissolution', 'of', 'cu', 'from', 'intermetallics', 'and', 'the', 'differences', 'in', 'the', 'evolution', 'of', 'intermetallic', 'layers', 'depending', 'on', 'whether', 'they', 'act', 'as', 'cathodes', 'or', 'anodes', 'are', 'accounted', 'for', 'and', 'are', 'compared', 'favorably', 'with', 'experiments', 'the', 'model', 'considers', 'nonequilibrium', 'evolution', 'of', 'vacancies', 'that', 'form', 'due', 'to', 'differences', 'in', 'couplings', 'between', 'diffusing', 'atoms', 'and', 'electron', 'flows', 'this', 'work', 'is', 'significant', 'as', 'the', 'point', 'defect', 'evolution', 'in', '3dic', 'solder', 'joints', 'during', 'electromigration', 'has', 'deep', 'implications', 'to', 'the', 'formation', 'and', 'coalescence', 'of', 'voids', 'that', 'ultimately', 'compromise', 'the', 'structural', 'and', 'functional', 'integrity', 'of', 'the', 'joints']]
|
[-0.0805794578471211, 0.15540291285843297, -0.0537424197155101, 0.030216469595919775, 0.004391259885573339, -0.10261468032718592, 0.034383594945964394, 0.40515285164308085, -0.2562837210403735, -0.29341680691852884, 0.03177779578943036, -0.28057968672565237, -0.1471807401594756, 0.13296932146023277, -0.0008378947949818065, 0.020210521808269644, 0.0339689840802357, -0.09886531761042544, -0.07236075922984489, -0.2514685134112995, 0.28987188784465673, 0.0877889739836113, 0.3319208996160136, 0.07724413033374534, 0.05755527403521081, -0.017190043456471897, 0.037855995859029476, 0.015700463356336913, -0.15837792472306592, 0.08041881706778577, 0.24302581564513265, 0.012785621307088033, 0.21649754980844396, -0.565805427079159, -0.23593737262861944, 0.021507635671314935, 0.13725799728455323, 0.1145914289374305, -0.07924222317148721, -0.2288933089991871, 0.060850122217489505, -0.1299489061585978, -0.06825841453929149, -0.03479303194958496, 0.010885331123786908, 0.04847923828265755, -0.2381318796702075, 0.10869441911833541, 0.06046416548641539, 0.05035720954734271, -0.13776202982739716, -0.07688004034821705, -0.08083708912775081, 0.12847286233020025, 0.04096853620527933, -0.016635760167358262, 0.22400733756942934, -0.09346365118675436, -0.10219188397612564, 0.3918413005528911, -0.008778833498757693, -0.10445931554341348, 0.2494255418886721, -0.11866211127973304, -0.12647234064324067, 0.153981842462384, 0.206802658679124, 0.07504726653250175, -0.1678065549114704, 0.029555815758348834, 0.08381192422702267, 0.13771633134722355, 0.11035395581500544, -0.0013450238758557908, 0.24009896151130639, 0.2435827919980511, -0.008108739365613269, 0.13550224000718245, -0.10697075017097016, -0.09435529150919969, -0.22230092826410777, -0.20364151436895614, -0.143653760957081, 0.01751996328934066, -0.07213661020608514, -0.18409014660965212, 0.3838961317732189, 0.13309475729994286, 0.1742806170025893, -0.041439169437013645, 0.2352347974333742, 0.011320255540301322, 0.07961468559799977, 0.027711971552782162, 0.21345292294387935, 0.14327470453015417, 0.09216913898595638, -0.28417480553335117, 0.1685495852237387, 0.032706052755876895]
|
1,803.07228
|
Novel $|V_{us}|$ Determination Using Inclusive Strange $\tau$ Decay and
Lattice HVPs
|
We propose and apply a new approach to determining $|V_{us}|$ using
dispersion relations with weight functions having poles at Euclidean
(space-like) momentum which relate strange hadronic $\tau$ decay distributions
to hadronic vacuum polarization functions (HVPs) obtained from lattice QCD. We
show examples where spectral integral contributions from the region where
experimental data have large errors or do not exist are strongly suppressed but
accurate determinations of the relevant lattice HVP combinations remain
possible. The resulting $|V_{us}|$ agrees well with determinations from $K$
physics and 3-family CKM unitarity. Advantages of this new approach over the
conventional hadronic $\tau$ decay determination employing flavor-breaking sum
rules are also discussed.
|
hep-lat hep-ph
|
we propose and apply a new approach to determining v_us using dispersion relations with weight functions having poles at euclidean spacelike momentum which relate strange hadronic tau decay distributions to hadronic vacuum polarization functions hvps obtained from lattice qcd we show examples where spectral integral contributions from the region where experimental data have large errors or do not exist are strongly suppressed but accurate determinations of the relevant lattice hvp combinations remain possible the resulting v_us agrees well with determinations from k physics and 3family ckm unitarity advantages of this new approach over the conventional hadronic tau decay determination employing flavorbreaking sum rules are also discussed
|
[['we', 'propose', 'and', 'apply', 'a', 'new', 'approach', 'to', 'determining', 'v_us', 'using', 'dispersion', 'relations', 'with', 'weight', 'functions', 'having', 'poles', 'at', 'euclidean', 'spacelike', 'momentum', 'which', 'relate', 'strange', 'hadronic', 'tau', 'decay', 'distributions', 'to', 'hadronic', 'vacuum', 'polarization', 'functions', 'hvps', 'obtained', 'from', 'lattice', 'qcd', 'we', 'show', 'examples', 'where', 'spectral', 'integral', 'contributions', 'from', 'the', 'region', 'where', 'experimental', 'data', 'have', 'large', 'errors', 'or', 'do', 'not', 'exist', 'are', 'strongly', 'suppressed', 'but', 'accurate', 'determinations', 'of', 'the', 'relevant', 'lattice', 'hvp', 'combinations', 'remain', 'possible', 'the', 'resulting', 'v_us', 'agrees', 'well', 'with', 'determinations', 'from', 'k', 'physics', 'and', '3family', 'ckm', 'unitarity', 'advantages', 'of', 'this', 'new', 'approach', 'over', 'the', 'conventional', 'hadronic', 'tau', 'decay', 'determination', 'employing', 'flavorbreaking', 'sum', 'rules', 'are', 'also', 'discussed']]
|
[-0.05128643271247191, 0.21587017554612387, -0.07950690243659275, 0.08991966726857105, -0.10793557952025107, -0.14560427309590437, 0.07591143816798215, 0.359652564160171, -0.24567342936283065, -0.22337815575745135, 0.0316048758433594, -0.32441214800235774, -0.04144578442376639, 0.1647353176060798, 0.05336217559801991, 0.1121098739982006, 0.11339025146108248, -0.019118782070775827, -0.17326794919347213, -0.18840270918749627, 0.31612821607018954, -0.01824494031745763, 0.22274854859958093, 0.12254715752566145, 0.016413697929653737, 0.003694492693813074, -0.1151749548347046, -0.038085754428591044, -0.1761749276968961, 0.09236608001603079, 0.21166164570576734, 0.09274301455367268, 0.0828566985781349, -0.33720479750384885, -0.14313860047342522, 0.09406301639087143, 0.1674464930913278, 0.09229235709755726, 0.012365297569582859, -0.2619897590151855, 0.040979187611845276, -0.16592020043837172, -0.1435375869761975, -0.18743948479227368, -0.0450964675085353, -0.03357081610177245, -0.32866138149762436, 0.1196319825434503, -0.0723867067612619, 0.037090962965573585, -0.02534962607370246, -0.30915815633322513, 0.042106484402237195, 0.09217401530283192, 0.10915788640933377, 0.07792609399628071, 0.11268631248690543, -0.12152707070289623, -0.12737992114077012, 0.42623331880285625, -0.038129223519492716, -0.19042432702235168, 0.13380718164678132, -0.22351763449121445, -0.14753305456556734, 0.14818987782955878, 0.1421268897796316, 0.08959769915728387, -0.1492501209356955, 0.11648468943423636, -0.023948416184811364, 0.13760532366023176, 0.0795055145442131, 0.107838327169884, 0.22974744627163524, 0.11541787537391342, -0.040440287933285746, 0.039292072566847004, -0.05190877037876773, -0.08840575843572705, -0.41270686508644194, -0.0467367789895174, -0.14245655823144174, 0.07084068109383918, -0.1028890199424322, -0.16354117801058152, 0.32662517023272813, 0.1019895792051795, 0.23986016668495722, 0.06763274109190597, 0.31347374502303343, 0.0852250723877833, 0.10817391881275745, 0.07821286161918016, 0.27832765978583623, 0.17670808589706818, 0.07823041966961077, -0.2681250748285536, 0.030908954018516288, 0.09716240114177621]
|
1,803.07229
|
Facile synthetic route to transition metal oxyfluorides via reactions
between metal oxides and PTFE
|
Inorganic oxyfluorides have significant importance in the development of new
functionalities for energy production and storage, photonics, catalysis, etc.
In order to explore a simple preparation route that avoids the use of toxic HF
or F2 gas as a reaction reagent, we have employed polytetrafluoroethylene
(PTFE). Five oxyfluorides including Nb5O12F, Nb3O7F, Ta3O7F, TaO2F, and
Mo4O11.2F0.8 were synthesized by reactions between PTFE and transition metal
oxides in sealed quartz ampules. The reaction mechanism was studied by means of
gas analysis, which detected SiF4 as a main product gas during the reaction. A
possible reaction mechanism between the PTFE and transition metal oxides is
discussed.
|
cond-mat.mtrl-sci
|
inorganic oxyfluorides have significant importance in the development of new functionalities for energy production and storage photonics catalysis etc in order to explore a simple preparation route that avoids the use of toxic hf or f2 gas as a reaction reagent we have employed polytetrafluoroethylene ptfe five oxyfluorides including nb5o12f nb3o7f ta3o7f tao2f and mo4o112f08 were synthesized by reactions between ptfe and transition metal oxides in sealed quartz ampules the reaction mechanism was studied by means of gas analysis which detected sif4 as a main product gas during the reaction a possible reaction mechanism between the ptfe and transition metal oxides is discussed
|
[['inorganic', 'oxyfluorides', 'have', 'significant', 'importance', 'in', 'the', 'development', 'of', 'new', 'functionalities', 'for', 'energy', 'production', 'and', 'storage', 'photonics', 'catalysis', 'etc', 'in', 'order', 'to', 'explore', 'a', 'simple', 'preparation', 'route', 'that', 'avoids', 'the', 'use', 'of', 'toxic', 'hf', 'or', 'f2', 'gas', 'as', 'a', 'reaction', 'reagent', 'we', 'have', 'employed', 'polytetrafluoroethylene', 'ptfe', 'five', 'oxyfluorides', 'including', 'nb5o12f', 'nb3o7f', 'ta3o7f', 'tao2f', 'and', 'mo4o112f08', 'were', 'synthesized', 'by', 'reactions', 'between', 'ptfe', 'and', 'transition', 'metal', 'oxides', 'in', 'sealed', 'quartz', 'ampules', 'the', 'reaction', 'mechanism', 'was', 'studied', 'by', 'means', 'of', 'gas', 'analysis', 'which', 'detected', 'sif4', 'as', 'a', 'main', 'product', 'gas', 'during', 'the', 'reaction', 'a', 'possible', 'reaction', 'mechanism', 'between', 'the', 'ptfe', 'and', 'transition', 'metal', 'oxides', 'is', 'discussed']]
|
[-0.041598711367441865, 0.1957516387628857, 0.007446014757685286, -0.011922346344363177, 0.02806081623081506, -0.16985150763260512, 0.10809194579390653, 0.4046454170020297, -0.19843656241331095, -0.2966688123415224, 0.02569370098960159, -0.3279612970945891, -0.12989893589838175, 0.1633919022642658, 0.03117013714897136, 0.050501156433407836, -0.03590542032300922, -0.0849346044487902, -0.06479560421636658, -0.1510913468870664, 0.2520593924370284, 0.08556097042552817, 0.27799771292484365, 0.12689237277663779, 0.06639042607275769, -0.06735905030169913, 0.03583622499536432, -0.0794697436504066, -0.14380588543804151, 0.07735449850345806, 0.2901761246175738, 0.015413038665428758, 0.18999771312519442, -0.48123250507827225, -0.26681387842836557, 0.05890498956432566, 0.08980247767855569, 0.09680261763060116, -0.19537060586056518, -0.21679062917246483, 0.007623140413973791, -0.2075523529201746, -0.0825367511992378, -0.09824120157281868, 0.020358199762995355, 0.0320117660012329, -0.23004306491930038, 0.03183971535084614, 0.00937457381708858, 0.0838946671889668, -0.08241219376941444, -0.17635653392547587, -0.07754186373980095, 0.07256726150565858, 0.009496920099384928, 0.01657913051288536, 0.24798995635501342, -0.05571269641707962, -0.07209410480087779, 0.4238698097566764, -0.04045724029735235, -0.07892684648686554, 0.21311731255264021, -0.09883143613236219, -0.1021651997580193, 0.19628272359841503, 0.17585396529951444, 0.11024715687653952, -0.21527358640256958, 0.016915342409144312, 0.0692251539924958, 0.14741443343761299, 0.15368989385509244, 0.009022073903906858, 0.1795168575287486, 0.26435701125107397, -0.07562155504031882, 0.15860300613106423, -0.08905835006347236, -0.0463949148888787, -0.18202281659857059, -0.26709535566624254, -0.1303558365519469, 0.06797474991253694, -0.015025262922790716, -0.1596150576757888, 0.3081345278963757, 0.04763134129461832, 0.15225718899940452, -0.13790167515859744, 0.28100178003660403, 0.0036966987172490917, 0.11522121314192191, -0.030247913746279664, 0.24843083133843416, 0.16400810396832335, 0.147270874644164, -0.2210046911253206, 0.20723557891324162, 0.032411096338667754]
|
1,803.0723
|
Tunable Semiconductors: Control over Carrier States and Excitations in
Layered Hybrid Organic-Inorganic Perovskites
|
For a class of 2D hybrid organic-inorganic perovskite semiconductors based on
$\pi$-conjugated organic cations, we predict quantitatively how varying the
organic and inorganic component allows control over the nature, energy and
localization of carrier states in a quantum-well-like fashion. Our
first-principles predictions, based on large-scale hybrid density-functional
theory with spin-orbit coupling, show that the interface between the organic
and inorganic parts within a single hybrid can be modulated systematically,
enabling us to select between different type-I and type-II energy level
alignments. Energy levels, recombination properties and transport behavior of
electrons and holes thus become tunable by choosing specific organic
functionalizations and juxtaposing them with suitable inorganic components.
|
cond-mat.mtrl-sci
|
for a class of 2d hybrid organicinorganic perovskite semiconductors based on piconjugated organic cations we predict quantitatively how varying the organic and inorganic component allows control over the nature energy and localization of carrier states in a quantumwelllike fashion our firstprinciples predictions based on largescale hybrid densityfunctional theory with spinorbit coupling show that the interface between the organic and inorganic parts within a single hybrid can be modulated systematically enabling us to select between different typei and typeii energy level alignments energy levels recombination properties and transport behavior of electrons and holes thus become tunable by choosing specific organic functionalizations and juxtaposing them with suitable inorganic components
|
[['for', 'a', 'class', 'of', '2d', 'hybrid', 'organicinorganic', 'perovskite', 'semiconductors', 'based', 'on', 'piconjugated', 'organic', 'cations', 'we', 'predict', 'quantitatively', 'how', 'varying', 'the', 'organic', 'and', 'inorganic', 'component', 'allows', 'control', 'over', 'the', 'nature', 'energy', 'and', 'localization', 'of', 'carrier', 'states', 'in', 'a', 'quantumwelllike', 'fashion', 'our', 'firstprinciples', 'predictions', 'based', 'on', 'largescale', 'hybrid', 'densityfunctional', 'theory', 'with', 'spinorbit', 'coupling', 'show', 'that', 'the', 'interface', 'between', 'the', 'organic', 'and', 'inorganic', 'parts', 'within', 'a', 'single', 'hybrid', 'can', 'be', 'modulated', 'systematically', 'enabling', 'us', 'to', 'select', 'between', 'different', 'typei', 'and', 'typeii', 'energy', 'level', 'alignments', 'energy', 'levels', 'recombination', 'properties', 'and', 'transport', 'behavior', 'of', 'electrons', 'and', 'holes', 'thus', 'become', 'tunable', 'by', 'choosing', 'specific', 'organic', 'functionalizations', 'and', 'juxtaposing', 'them', 'with', 'suitable', 'inorganic', 'components']]
|
[-0.1185246950807485, 0.15718579445269273, -0.01715637280858148, 0.027933933369317047, -0.027328357822914547, -0.18940077368257063, 0.10375495200484956, 0.43818337130839025, -0.2585052630959827, -0.34616190374384975, -0.049674990046203626, -0.28461312974335856, -0.1664488136411479, 0.17103792223034897, 0.04799157476583583, -0.005063270533712533, -0.01048703163902484, -0.12799505060799768, -0.08137061526546273, -0.13024169897712837, 0.25425663249454, 0.04763251287148935, 0.34705920254150147, 0.07173207815014104, 0.05527546396043813, -0.008366039338321469, 0.1053630343560025, -0.003188843891094221, -0.12158758374548215, 0.22006134362836915, 0.2882942935434457, -0.09399790849501842, 0.22828052249502076, -0.4988693810964578, -0.2659542383517304, -0.0006126148721951747, 0.10974385466309107, 0.10799064937648233, -0.1250360419769188, -0.2601123056983767, 0.07094550015302549, -0.16453058221029274, -0.059252960542605856, -0.10909914236655023, -0.04390200525391673, 0.07760800111812548, -0.25446947404644754, 0.060139586176901676, -0.0441633009517165, 0.016308309188304105, -0.1304461477421198, -0.13366406988330778, -0.08051625550637527, 0.08912234831270631, 0.0018921171262790666, -0.04851636918621773, 0.21175950933160764, -0.09034225037626087, -0.11958121445256277, 0.38264839395567357, -0.07444995760462882, -0.1661743232741012, 0.22789834242610035, -0.08349483358786902, -0.08202620296277732, 0.14150861937935663, 0.14446684442216826, 0.15435452799739263, -0.17088145099441024, 0.0609483978298719, 0.03236209096851602, 0.2224229307166327, 0.006371669590943188, 0.13031663696681994, 0.303310188699827, 0.22871983928222941, -0.03352357350812331, 0.08983973628149376, -0.11996940754394256, -0.09543512492423233, -0.15123597965967434, -0.2050758770418954, -0.17467511948372158, 0.04727326763497892, -0.06053121793603364, -0.20925164906847699, 0.46300754903284747, 0.12700243896783533, 0.13217767390692345, -0.034921426656786526, 0.2396538291040062, 0.040513771713415386, 0.08610623442593997, 0.0036975744541595194, 0.22536589044241984, 0.10183865949729126, 0.058863942728434454, -0.2681099841823784, 0.09763587429840988, 0.020772846853012377]
|
1,803.07231
|
Hierarchical Metric Learning and Matching for 2D and 3D Geometric
Correspondences
|
Interest point descriptors have fueled progress on almost every problem in
computer vision. Recent advances in deep neural networks have enabled
task-specific learned descriptors that outperform hand-crafted descriptors on
many problems. We demonstrate that commonly used metric learning approaches do
not optimally leverage the feature hierarchies learned in a Convolutional
Neural Network (CNN), especially when applied to the task of geometric feature
matching. While a metric loss applied to the deepest layer of a CNN, is often
expected to yield ideal features irrespective of the task, in fact the growing
receptive field as well as striding effects cause shallower features to be
better at high precision matching tasks. We leverage this insight together with
explicit supervision at multiple levels of the feature hierarchy for better
regularization, to learn more effective descriptors in the context of geometric
matching tasks. Further, we propose to use activation maps at different layers
of a CNN, as an effective and principled replacement for the multi-resolution
image pyramids often used for matching tasks. We propose concrete CNN
architectures employing these ideas, and evaluate them on multiple datasets for
2D and 3D geometric matching as well as optical flow, demonstrating
state-of-the-art results and generalization across datasets.
|
cs.CV
|
interest point descriptors have fueled progress on almost every problem in computer vision recent advances in deep neural networks have enabled taskspecific learned descriptors that outperform handcrafted descriptors on many problems we demonstrate that commonly used metric learning approaches do not optimally leverage the feature hierarchies learned in a convolutional neural network cnn especially when applied to the task of geometric feature matching while a metric loss applied to the deepest layer of a cnn is often expected to yield ideal features irrespective of the task in fact the growing receptive field as well as striding effects cause shallower features to be better at high precision matching tasks we leverage this insight together with explicit supervision at multiple levels of the feature hierarchy for better regularization to learn more effective descriptors in the context of geometric matching tasks further we propose to use activation maps at different layers of a cnn as an effective and principled replacement for the multiresolution image pyramids often used for matching tasks we propose concrete cnn architectures employing these ideas and evaluate them on multiple datasets for 2d and 3d geometric matching as well as optical flow demonstrating stateoftheart results and generalization across datasets
|
[['interest', 'point', 'descriptors', 'have', 'fueled', 'progress', 'on', 'almost', 'every', 'problem', 'in', 'computer', 'vision', 'recent', 'advances', 'in', 'deep', 'neural', 'networks', 'have', 'enabled', 'taskspecific', 'learned', 'descriptors', 'that', 'outperform', 'handcrafted', 'descriptors', 'on', 'many', 'problems', 'we', 'demonstrate', 'that', 'commonly', 'used', 'metric', 'learning', 'approaches', 'do', 'not', 'optimally', 'leverage', 'the', 'feature', 'hierarchies', 'learned', 'in', 'a', 'convolutional', 'neural', 'network', 'cnn', 'especially', 'when', 'applied', 'to', 'the', 'task', 'of', 'geometric', 'feature', 'matching', 'while', 'a', 'metric', 'loss', 'applied', 'to', 'the', 'deepest', 'layer', 'of', 'a', 'cnn', 'is', 'often', 'expected', 'to', 'yield', 'ideal', 'features', 'irrespective', 'of', 'the', 'task', 'in', 'fact', 'the', 'growing', 'receptive', 'field', 'as', 'well', 'as', 'striding', 'effects', 'cause', 'shallower', 'features', 'to', 'be', 'better', 'at', 'high', 'precision', 'matching', 'tasks', 'we', 'leverage', 'this', 'insight', 'together', 'with', 'explicit', 'supervision', 'at', 'multiple', 'levels', 'of', 'the', 'feature', 'hierarchy', 'for', 'better', 'regularization', 'to', 'learn', 'more', 'effective', 'descriptors', 'in', 'the', 'context', 'of', 'geometric', 'matching', 'tasks', 'further', 'we', 'propose', 'to', 'use', 'activation', 'maps', 'at', 'different', 'layers', 'of', 'a', 'cnn', 'as', 'an', 'effective', 'and', 'principled', 'replacement', 'for', 'the', 'multiresolution', 'image', 'pyramids', 'often', 'used', 'for', 'matching', 'tasks', 'we', 'propose', 'concrete', 'cnn', 'architectures', 'employing', 'these', 'ideas', 'and', 'evaluate', 'them', 'on', 'multiple', 'datasets', 'for', '2d', 'and', '3d', 'geometric', 'matching', 'as', 'well', 'as', 'optical', 'flow', 'demonstrating', 'stateoftheart', 'results', 'and', 'generalization', 'across', 'datasets']]
|
[0.0002072371253462967, -0.028116407932233342, -0.0776457528433945, 0.09277054230257256, -0.11451415037010895, -0.18038222266609158, -0.01282716559798424, 0.48978963398462955, -0.307765150985601, -0.34859953275015904, 0.06503506733195846, -0.2590982099590196, -0.23308192130327973, 0.18423444600471636, -0.14314077181470156, 0.13548405719897594, 0.12666165848360889, 0.03340548185640993, -0.10552480889147325, -0.2878884921492728, 0.314128094440532, 0.054102150455261136, 0.3758250767430618, 0.02100356666303366, 0.15035041393454762, -0.04659886949756487, -0.025787798918306303, 0.007393412902160318, -0.05360728788551414, 0.2011222858233471, 0.34941982633513796, 0.15213248511570407, 0.3078469932711117, -0.45341095603442627, -0.2713801969526027, 0.0804145292322802, 0.18261329196019088, 0.10891385994732468, -0.008747327557765533, -0.31062532022382466, 0.08230228896659972, -0.13111112588763835, 0.03717023328203479, -0.18182002848491596, -0.033438935421346384, -0.04088401824063926, -0.30049022609056747, 0.01558256054843481, 0.07809300862496073, 0.08433916355079875, -0.03808063003538766, -0.14530548315738614, 0.01874393678443441, 0.18510265292874162, 0.0054257724845978485, 0.08919883272072403, 0.15501284696238968, -0.24337249893420018, -0.15118905023704446, 0.34720637820586187, -0.0713997146865849, -0.21028239347026614, 0.22083905499765472, -0.0017102921110152, -0.1863444277492525, 0.07700256105914861, 0.24770115711375248, 0.09859830736833151, -0.12490539001594894, -0.02109330721391393, -0.03950787390390383, 0.15837192798490243, 0.08687653115028562, 0.04861666293037896, 0.22973229073867876, 0.24907755428087433, 0.05912830466117906, 0.12950322025890776, -0.11823849942568507, -0.05104940413291468, -0.16639617953189748, -0.06568018390315038, -0.20693477596877022, -0.04912097755947967, -0.14105230489665005, -0.14775647694836125, 0.3987528598170035, 0.225498914376987, 0.24329256243657452, 0.10311197577732914, 0.32536695135205085, 0.012681454988126293, 0.18658639900573534, 0.08986822376905206, 0.1947213266683677, 0.023467599521929294, 0.14181684024383936, -0.12659391271121256, 0.06342987412874629, 0.09140532367146718]
|
1,803.07232
|
Enhancement, slow relaxation, ergodicity and rejuvenation of diffusion
in biased continuous-time random walks
|
Bias plays an important role in the enhancement of diffusion in periodic
potentials. Using the continuous-time random walk in the presence of a bias, we
provide a novel mechanism for the enhancement of diffusion in a random energy
landscape. When the variance of the waiting time diverges, in contrast to the
bias-free case the dynamics with bias becomes superdiffusive. In the
superdiffusive regime, we find a distinct initial ensemble dependence of the
diffusivity. We show that the time-averaged variance converges to the
corresponding ensemble-averaged variance, i.e., ergodicity is preserved.
However, trajectory-to-trajectory fluctuations of the time-averaged variance
decay slowly. Our finding suggests that in the superdiffusive regime the
diffusivity for a non-equilibrium initial ensemble gradually increases to that
for an equilibrium ensemble when the start of the measurement is delayed,
corresponding to a rejuvenation of diffusivity.
|
cond-mat.stat-mech
|
bias plays an important role in the enhancement of diffusion in periodic potentials using the continuoustime random walk in the presence of a bias we provide a novel mechanism for the enhancement of diffusion in a random energy landscape when the variance of the waiting time diverges in contrast to the biasfree case the dynamics with bias becomes superdiffusive in the superdiffusive regime we find a distinct initial ensemble dependence of the diffusivity we show that the timeaveraged variance converges to the corresponding ensembleaveraged variance ie ergodicity is preserved however trajectorytotrajectory fluctuations of the timeaveraged variance decay slowly our finding suggests that in the superdiffusive regime the diffusivity for a nonequilibrium initial ensemble gradually increases to that for an equilibrium ensemble when the start of the measurement is delayed corresponding to a rejuvenation of diffusivity
|
[['bias', 'plays', 'an', 'important', 'role', 'in', 'the', 'enhancement', 'of', 'diffusion', 'in', 'periodic', 'potentials', 'using', 'the', 'continuoustime', 'random', 'walk', 'in', 'the', 'presence', 'of', 'a', 'bias', 'we', 'provide', 'a', 'novel', 'mechanism', 'for', 'the', 'enhancement', 'of', 'diffusion', 'in', 'a', 'random', 'energy', 'landscape', 'when', 'the', 'variance', 'of', 'the', 'waiting', 'time', 'diverges', 'in', 'contrast', 'to', 'the', 'biasfree', 'case', 'the', 'dynamics', 'with', 'bias', 'becomes', 'superdiffusive', 'in', 'the', 'superdiffusive', 'regime', 'we', 'find', 'a', 'distinct', 'initial', 'ensemble', 'dependence', 'of', 'the', 'diffusivity', 'we', 'show', 'that', 'the', 'timeaveraged', 'variance', 'converges', 'to', 'the', 'corresponding', 'ensembleaveraged', 'variance', 'ie', 'ergodicity', 'is', 'preserved', 'however', 'trajectorytotrajectory', 'fluctuations', 'of', 'the', 'timeaveraged', 'variance', 'decay', 'slowly', 'our', 'finding', 'suggests', 'that', 'in', 'the', 'superdiffusive', 'regime', 'the', 'diffusivity', 'for', 'a', 'nonequilibrium', 'initial', 'ensemble', 'gradually', 'increases', 'to', 'that', 'for', 'an', 'equilibrium', 'ensemble', 'when', 'the', 'start', 'of', 'the', 'measurement', 'is', 'delayed', 'corresponding', 'to', 'a', 'rejuvenation', 'of', 'diffusivity']]
|
[-0.13413572848808986, 0.205014694118398, -0.12194466995144332, 0.07716017552927412, 0.028350797575869904, -0.09679402561030453, 0.026022464787173603, 0.3565705356222612, -0.2951382015935249, -0.23747902143470667, 0.04650125345128968, -0.28621025005424466, -0.13075350427103263, 0.15469637301371053, -0.030920401725193693, 0.026517251296037877, 0.03463942755048198, 0.05144860224164505, -0.015502323005865846, -0.19394099642177698, 0.26217673954864346, 0.10908345210848859, 0.31890023761877306, 0.006461328516403834, 0.09879608014598489, 0.019591435760742536, 0.027056871602932613, 0.04823932425826098, -0.12900825480459457, 0.015278896510049149, 0.15863859045526219, -0.002192568841079871, 0.32473543925055615, -0.3758496678882727, -0.2214782140303955, 0.1561588984431216, 0.2094611058787753, 0.1489875087859454, -0.06402033153507444, -0.20973850816867692, 0.023073468985105, -0.10751660261303186, -0.15461410055264693, -0.032237091070661944, 0.05961945622952448, 0.04504971472391238, -0.3287406385721018, 0.22899105975542355, 0.09027130055344768, 0.03961685389211332, -0.048331934267965455, -0.07972100851712403, 0.0015258127357810735, 0.15389797989563603, 0.07970119676449233, 0.0008504661921135805, 0.2072408070339373, -0.16066143508241684, -0.06620042078817884, 0.31831269224208814, -0.13613485370038284, -0.16878440851621607, 0.13476984670937614, -0.17471290864740258, -0.12556417612811654, 0.16719917261766062, 0.1468598838481638, 0.08080575895254259, -0.13999058579857876, 0.04945013523274274, 0.013684981750945251, 0.15412586793234503, -0.004965124662137694, 0.022680107521376124, 0.15154338845017332, 0.2056319736858347, 0.13011039067059754, 0.1673560899992784, -0.1280165468066655, -0.1663105776257537, -0.2873764599500983, -0.15475376209511457, -0.21451210782483773, 0.11204523442451049, -0.14799425083522996, -0.20538534509638945, 0.3875351029758652, 0.22332438339168828, 0.2483595285978582, 0.11307318702823034, 0.2447066628443146, 0.18112534629612195, -0.01674539364391455, 0.09446447025984525, 0.22887096980552155, 0.11691251937817368, 0.1327499251605736, -0.31101756407016956, 0.11240641887265224, 0.011371584364247542]
|
1,803.07233
|
Closing the AI Knowledge Gap
|
AI researchers employ not only the scientific method, but also methodology
from mathematics and engineering. However, the use of the scientific method -
specifically hypothesis testing - in AI is typically conducted in service of
engineering objectives. Growing interest in topics such as fairness and
algorithmic bias show that engineering-focused questions only comprise a subset
of the important questions about AI systems. This results in the AI Knowledge
Gap: the number of unique AI systems grows faster than the number of studies
that characterize these systems' behavior. To close this gap, we argue that the
study of AI could benefit from the greater inclusion of researchers who are
well positioned to formulate and test hypotheses about the behavior of AI
systems. We examine the barriers preventing social and behavioral scientists
from conducting such studies. Our diagnosis suggests that accelerating the
scientific study of AI systems requires new incentives for academia and
industry, mediated by new tools and institutions. To address these needs, we
propose a two-sided marketplace called TuringBox. On one side, AI contributors
upload existing and novel algorithms to be studied scientifically by others. On
the other side, AI examiners develop and post machine intelligence tasks
designed to evaluate and characterize algorithmic behavior. We discuss this
market's potential to democratize the scientific study of AI behavior, and thus
narrow the AI Knowledge Gap.
|
cs.CY cs.AI
|
ai researchers employ not only the scientific method but also methodology from mathematics and engineering however the use of the scientific method specifically hypothesis testing in ai is typically conducted in service of engineering objectives growing interest in topics such as fairness and algorithmic bias show that engineeringfocused questions only comprise a subset of the important questions about ai systems this results in the ai knowledge gap the number of unique ai systems grows faster than the number of studies that characterize these systems behavior to close this gap we argue that the study of ai could benefit from the greater inclusion of researchers who are well positioned to formulate and test hypotheses about the behavior of ai systems we examine the barriers preventing social and behavioral scientists from conducting such studies our diagnosis suggests that accelerating the scientific study of ai systems requires new incentives for academia and industry mediated by new tools and institutions to address these needs we propose a twosided marketplace called turingbox on one side ai contributors upload existing and novel algorithms to be studied scientifically by others on the other side ai examiners develop and post machine intelligence tasks designed to evaluate and characterize algorithmic behavior we discuss this markets potential to democratize the scientific study of ai behavior and thus narrow the ai knowledge gap
|
[['ai', 'researchers', 'employ', 'not', 'only', 'the', 'scientific', 'method', 'but', 'also', 'methodology', 'from', 'mathematics', 'and', 'engineering', 'however', 'the', 'use', 'of', 'the', 'scientific', 'method', 'specifically', 'hypothesis', 'testing', 'in', 'ai', 'is', 'typically', 'conducted', 'in', 'service', 'of', 'engineering', 'objectives', 'growing', 'interest', 'in', 'topics', 'such', 'as', 'fairness', 'and', 'algorithmic', 'bias', 'show', 'that', 'engineeringfocused', 'questions', 'only', 'comprise', 'a', 'subset', 'of', 'the', 'important', 'questions', 'about', 'ai', 'systems', 'this', 'results', 'in', 'the', 'ai', 'knowledge', 'gap', 'the', 'number', 'of', 'unique', 'ai', 'systems', 'grows', 'faster', 'than', 'the', 'number', 'of', 'studies', 'that', 'characterize', 'these', 'systems', 'behavior', 'to', 'close', 'this', 'gap', 'we', 'argue', 'that', 'the', 'study', 'of', 'ai', 'could', 'benefit', 'from', 'the', 'greater', 'inclusion', 'of', 'researchers', 'who', 'are', 'well', 'positioned', 'to', 'formulate', 'and', 'test', 'hypotheses', 'about', 'the', 'behavior', 'of', 'ai', 'systems', 'we', 'examine', 'the', 'barriers', 'preventing', 'social', 'and', 'behavioral', 'scientists', 'from', 'conducting', 'such', 'studies', 'our', 'diagnosis', 'suggests', 'that', 'accelerating', 'the', 'scientific', 'study', 'of', 'ai', 'systems', 'requires', 'new', 'incentives', 'for', 'academia', 'and', 'industry', 'mediated', 'by', 'new', 'tools', 'and', 'institutions', 'to', 'address', 'these', 'needs', 'we', 'propose', 'a', 'twosided', 'marketplace', 'called', 'turingbox', 'on', 'one', 'side', 'ai', 'contributors', 'upload', 'existing', 'and', 'novel', 'algorithms', 'to', 'be', 'studied', 'scientifically', 'by', 'others', 'on', 'the', 'other', 'side', 'ai', 'examiners', 'develop', 'and', 'post', 'machine', 'intelligence', 'tasks', 'designed', 'to', 'evaluate', 'and', 'characterize', 'algorithmic', 'behavior', 'we', 'discuss', 'this', 'markets', 'potential', 'to', 'democratize', 'the', 'scientific', 'study', 'of', 'ai', 'behavior', 'and', 'thus', 'narrow', 'the', 'ai', 'knowledge', 'gap']]
|
[-0.07292814598662187, 0.03932719756796194, -0.062069783995816995, 0.09163755762750622, -0.1297509183683856, -0.17569002006626264, 0.07596784609962594, 0.3801487758214617, -0.2760680956300348, -0.3619804934175177, 0.09282526722553568, -0.29956820154647257, -0.2014662680639462, 0.21146000266413797, -0.11414270747071979, 0.04201378202150491, 0.07499638185677626, 0.0279075555334037, 0.013674425581385466, -0.2722730976677584, 0.31241874494589866, 0.01984373759689995, 0.3085791499438611, 0.06155113063498654, 0.00769973085896874, -0.018014433046548883, -0.03536860538350249, -0.0010815468955446374, -0.14075901155553186, 0.1982885084326633, 0.35667501540791074, 0.25036560434170746, 0.43687520924616946, -0.42712268633767964, -0.18309169373453849, 0.07886017503809523, 0.1477328943702477, 0.06538177413484929, -0.045699656252029604, -0.30050152976129374, 0.07968386161797257, -0.18977955899370666, -0.10306692846458067, -0.11455144753510302, 0.01735474908809093, 0.014836073593257672, -0.21713260132819415, -0.04437526555967369, 0.06346190322497436, 0.12831707711395046, -0.019823074473639613, -0.1459697699534114, 0.06126475531332703, 0.19724139977373523, 0.11428766256431118, -0.01202912238447673, 0.1598733668363738, -0.1957640715514489, -0.1879032744406934, 0.36703323920003394, 0.02404691453418557, -0.12311029443305663, 0.2315344282679937, -0.09099962619207376, -0.16680204121565276, 0.018402542232863858, 0.23703828403641555, 0.08372360187244009, -0.16472577297509733, 0.05204819741140289, 0.020973182382824068, 0.1812643365696369, 0.04068621307907795, -0.00039928579618307675, 0.23719240579627116, 0.19331829379714857, 0.07805676160364369, 0.0924573216828073, 0.009919864719797096, -0.10832541321129115, -0.19103680113330485, -0.16775885505855762, -0.14573742299002002, 0.04424826115778573, -0.00941159856989874, -0.14495643260465427, 0.36637511418878355, 0.24176683185452766, 0.09968946137867699, 0.014369325735341673, 0.30335457483729855, 0.031629176941615614, 0.07975054349834947, 0.08943208540493452, 0.22739140857116913, 0.026811010894280944, 0.16847131710330193, -0.16816731096054852, 0.10245921503413807, -0.048891112000935454]
|
1,803.07234
|
Remarks on recognizable subsets and local rank
|
Given a monoid $(M,\varepsilon,\cdot )$ it is shown that a subset $A\subseteq
M$ is recognizable in the sense of automata theory if and only if the $\varphi
$-rank of $x=x$ is zero in the first-order theory
$\operatorname{Th}(M,\varepsilon ,\cdot ,A)$, where $\varphi (x;u)$ is the
formula $xu\in A$. In the case where $M$ is a finitely generated free monoid on
a finite alphabet $\Sigma $, this gives a model-theoretic characterization of
the regular languages over $\Sigma $. If $A$ is a regular language over $\Sigma
$ then the $\varphi $-multiplicity of $x=x$ is the state complexity of $A$.
Similar results holds for $\varphi' (x;u,v)$ given by $uxv\in A$, with the
$\varphi' $-multiplicity now equal to the size of the syntactic monoid of $A$.
|
math.LO
|
given a monoid mvarepsiloncdot it is shown that a subset asubseteq m is recognizable in the sense of automata theory if and only if the varphi rank of xx is zero in the firstorder theory operatornamethmvarepsilon cdot a where varphi xu is the formula xuin a in the case where m is a finitely generated free monoid on a finite alphabet sigma this gives a modeltheoretic characterization of the regular languages over sigma if a is a regular language over sigma then the varphi multiplicity of xx is the state complexity of a similar results holds for varphi xuv given by uxvin a with the varphi multiplicity now equal to the size of the syntactic monoid of a
|
[['given', 'a', 'monoid', 'mvarepsiloncdot', 'it', 'is', 'shown', 'that', 'a', 'subset', 'asubseteq', 'm', 'is', 'recognizable', 'in', 'the', 'sense', 'of', 'automata', 'theory', 'if', 'and', 'only', 'if', 'the', 'varphi', 'rank', 'of', 'xx', 'is', 'zero', 'in', 'the', 'firstorder', 'theory', 'operatornamethmvarepsilon', 'cdot', 'a', 'where', 'varphi', 'xu', 'is', 'the', 'formula', 'xuin', 'a', 'in', 'the', 'case', 'where', 'm', 'is', 'a', 'finitely', 'generated', 'free', 'monoid', 'on', 'a', 'finite', 'alphabet', 'sigma', 'this', 'gives', 'a', 'modeltheoretic', 'characterization', 'of', 'the', 'regular', 'languages', 'over', 'sigma', 'if', 'a', 'is', 'a', 'regular', 'language', 'over', 'sigma', 'then', 'the', 'varphi', 'multiplicity', 'of', 'xx', 'is', 'the', 'state', 'complexity', 'of', 'a', 'similar', 'results', 'holds', 'for', 'varphi', 'xuv', 'given', 'by', 'uxvin', 'a', 'with', 'the', 'varphi', 'multiplicity', 'now', 'equal', 'to', 'the', 'size', 'of', 'the', 'syntactic', 'monoid', 'of', 'a']]
|
[-0.164634700299837, 0.15104826255864873, -0.0796787700199179, 0.06772178923506943, -0.06206408228414754, -0.14894173523051696, 0.030197225396701118, 0.3182143045164514, -0.32968978904056967, -0.16988103618649275, 0.04096938334579024, -0.29628632132682886, -0.08568811205036023, 0.2092234593889627, -0.10505495934436719, -0.02197691572732047, 0.05187760063716652, 0.20736339533080658, -0.10012618990476128, -0.25369619800333393, 0.3207345545402189, -0.06068951411483189, 0.17695020667783784, 0.025281959470655573, 0.12682449406731808, -0.010842771194834393, 0.029849296787002107, 0.044136196313621964, -0.1528831673564574, 0.06909106387766976, 0.27994409953489113, 0.14675073666710473, 0.26858877371016304, -0.2992392240435277, -0.14318290967984418, 0.19370638280943558, 0.07866666584455392, -7.717942067405634e-05, -0.007842930553587186, -0.25049880834851873, 0.17717655440547356, -0.17977999696475372, -0.07458732981773976, 0.03639641096161907, 0.16762423035055563, 0.0006171662376768756, -0.3186981761817853, -0.022700275368008175, 0.1607443258235754, 0.089961688414118, -0.007928038558211961, -0.07552351577926361, -0.07503856669523214, 0.06811172390160591, -0.018060564453582884, 0.14169788552578866, 0.05157427460347351, -0.10218862037525692, -0.07714922774456474, 0.38265252396823807, -0.08538329310453775, -0.2701278365004742, 0.13271251286527044, -0.20598819773039667, -0.1193159628054944, 0.13775492453000002, 0.02821684440418163, 0.1503558822607789, -0.05991498884957349, 0.2749988214810289, -0.19095871674730197, 0.23462665746021166, 0.09371713332407046, -0.01978892450253561, 0.1480512889122525, 0.17887940582933656, 0.08302963285690598, 0.14264027835809412, 0.031685269006789384, 0.015655279094189928, -0.36118367860061035, -0.1668193340750836, -0.16775597480795623, 0.12596063047091952, -0.05111382064282416, -0.22470207857208024, 0.36793000324580233, 0.06796802726590581, 0.1627251553234824, 0.13500389116080969, 0.2486766390175673, 0.12053932269969792, 0.01188873201445268, 0.07110744477719427, 0.06613171803193134, 0.1937226807318726, 0.005245768834771425, -0.16259239858277796, 0.07279916685646433, 0.14379911880384674]
|
1,803.07235
|
Superconductivity in Layered Pnictides BaRh2P2 and BaIr2P2
|
Bulk superconductivity was discovered in BaRh2P2 (Tc = 1.0 K) and BaIr2P2 (Tc
= 2.1 K), which are isostructural to (Ba,K)Fe2As2, indicative of the appearance
of superconductivity over a wide variety of layered transition metal pnictides.
The electronic specific heat coefficient gamma in the normal state, 9.75 and
6.86 mJ/mol K2 for BaRh2P2 and BaIr2P2 respectively, indicate that the
electronic density of states of these two compounds are moderately large but
smaller than those of Fe pnictide superconductors. The Wilson ratio close to 1
indeed implies the absence of strong electron correlations and magnetic
fluctuations unlike Fe pnictides.
|
cond-mat.supr-con cond-mat.mtrl-sci cond-mat.str-el
|
bulk superconductivity was discovered in barh2p2 tc 10 k and bair2p2 tc 21 k which are isostructural to bakfe2as2 indicative of the appearance of superconductivity over a wide variety of layered transition metal pnictides the electronic specific heat coefficient gamma in the normal state 975 and 686 mjmol k2 for barh2p2 and bair2p2 respectively indicate that the electronic density of states of these two compounds are moderately large but smaller than those of fe pnictide superconductors the wilson ratio close to 1 indeed implies the absence of strong electron correlations and magnetic fluctuations unlike fe pnictides
|
[['bulk', 'superconductivity', 'was', 'discovered', 'in', 'barh2p2', 'tc', '10', 'k', 'and', 'bair2p2', 'tc', '21', 'k', 'which', 'are', 'isostructural', 'to', 'bakfe2as2', 'indicative', 'of', 'the', 'appearance', 'of', 'superconductivity', 'over', 'a', 'wide', 'variety', 'of', 'layered', 'transition', 'metal', 'pnictides', 'the', 'electronic', 'specific', 'heat', 'coefficient', 'gamma', 'in', 'the', 'normal', 'state', '975', 'and', '686', 'mjmol', 'k2', 'for', 'barh2p2', 'and', 'bair2p2', 'respectively', 'indicate', 'that', 'the', 'electronic', 'density', 'of', 'states', 'of', 'these', 'two', 'compounds', 'are', 'moderately', 'large', 'but', 'smaller', 'than', 'those', 'of', 'fe', 'pnictide', 'superconductors', 'the', 'wilson', 'ratio', 'close', 'to', '1', 'indeed', 'implies', 'the', 'absence', 'of', 'strong', 'electron', 'correlations', 'and', 'magnetic', 'fluctuations', 'unlike', 'fe', 'pnictides']]
|
[-0.1877739609025934, 0.23750869915919734, 0.053342261863395406, 0.035263343030547206, -0.036596099395265286, -0.18996522285816994, 0.13996458458813263, 0.35129694844734793, -0.19597867784149786, -0.30954405076881036, -0.02654541543674992, -0.4180737497641685, -0.07146285066846758, 0.1809719387105012, 0.07888667299313114, -0.002402037570371907, -0.06713793570908935, -0.006179169850780609, -0.1902181412739818, -0.2450054146106692, 0.27648153265026654, -0.007231260204013992, 0.32530038930634236, 0.08780238970103575, -0.04006546817501967, -0.06701678522129326, 0.13823474407631983, 0.04374936226002397, -0.1329794424376853, 0.05646566257680806, 0.315787716451636, -0.09903656402612081, 0.14150515476122816, -0.3352205045149721, -0.2398851458850178, 0.005911790679129673, 0.10911358109219595, 0.05797791776638676, -0.019363316360544017, -0.2532395560918574, 0.10808117053857906, -0.11791060401245634, -0.0865367601001437, -0.0876391509280322, 0.006651409327032718, -0.031258454516609295, -0.23880473902805688, 0.14703310161650657, 0.07300334003446822, 0.1691933062591372, -0.10838812173274841, -0.252049904212633, -0.07512288565866332, -0.041858336447361616, 0.07017939873634184, 0.07556620662898182, 0.11907921028119126, -0.11419528452283208, -0.05304155081877128, 0.362935348909269, -0.07403548648212467, 0.0780286804594575, 0.19633957971521515, -0.23161026862192344, -0.10363962507727457, 0.24626234289594032, 0.07133295014252926, 0.10069781016221548, -0.10950242269269013, 0.04207848379279467, -0.04599510594593123, 0.19728959651485561, 0.03402592914496014, 0.10808885016756013, 0.2321486144148289, 0.14261997151287628, -0.009501561467991547, 0.07298895248528967, -0.15785992217864445, -0.0016882785922907135, -0.17405650280837087, -0.21636001611663463, -0.17771102908003006, 0.07448978088251217, -0.1360848733834536, -0.19800894780138983, 0.3349902790505439, 0.14204612351285834, 0.20662443158514004, -0.11497039542696934, 0.10525073351318691, 0.055215566072295955, 0.07776414707025632, 0.10819025791468138, 0.24777348850794295, 0.1983999747515438, 0.13642666957891011, -0.3106963124641396, 0.12425435950454483, 0.0010525259174446158]
|
1,803.07236
|
Convergence of the dispersion Camassa-Holm N-Soliton
|
In this paper, we show that the peakon (peaked soliton) solutions can be
recovered from the smooth soliton solutions, in the sense that there exists a
sequence of smooth N-soliton solutions of the dispersion Camassa-Holm equation
converging to the N-peakon of the dispersionless Camassa-Holm equation
uniformly with respect to the spatial variable x when the dispersion parameter
tends to zero. The main tools are asymptotic analysis and determinant
identities.
|
math-ph math.MP
|
in this paper we show that the peakon peaked soliton solutions can be recovered from the smooth soliton solutions in the sense that there exists a sequence of smooth nsoliton solutions of the dispersion camassaholm equation converging to the npeakon of the dispersionless camassaholm equation uniformly with respect to the spatial variable x when the dispersion parameter tends to zero the main tools are asymptotic analysis and determinant identities
|
[['in', 'this', 'paper', 'we', 'show', 'that', 'the', 'peakon', 'peaked', 'soliton', 'solutions', 'can', 'be', 'recovered', 'from', 'the', 'smooth', 'soliton', 'solutions', 'in', 'the', 'sense', 'that', 'there', 'exists', 'a', 'sequence', 'of', 'smooth', 'nsoliton', 'solutions', 'of', 'the', 'dispersion', 'camassaholm', 'equation', 'converging', 'to', 'the', 'npeakon', 'of', 'the', 'dispersionless', 'camassaholm', 'equation', 'uniformly', 'with', 'respect', 'to', 'the', 'spatial', 'variable', 'x', 'when', 'the', 'dispersion', 'parameter', 'tends', 'to', 'zero', 'the', 'main', 'tools', 'are', 'asymptotic', 'analysis', 'and', 'determinant', 'identities']]
|
[-0.17005492750879214, 0.025372896181500477, -0.1341663406001053, 0.07220992472097007, -0.11031296487519707, -0.16964930593562516, -0.04181428575901774, 0.3200066731432858, -0.315530100432427, -0.16787919428864279, 0.11078322184123639, -0.32621746297007886, -0.15830767085856717, 0.14537486860501594, -0.04578365907207995, 0.07798450992128853, 0.08813281935653176, 0.04165051701357183, -0.0849981929565294, -0.21965558948400227, 0.3898385830115581, -0.08857833989558445, 0.2588805837583715, -0.014434881859283516, 0.1394161647050709, -0.10100247820272394, 0.05764827730161124, -0.03407992944931206, -0.19062100300346874, 0.054958946355011154, 0.28484573382614314, 0.044535352239398744, 0.2347928845539581, -0.3391585700193663, -0.18680214178680943, 0.13963924193808783, 0.27084203409300983, 0.12332814217855533, -0.01693954581286812, -0.307245509793469, 0.09856735415540743, -0.09794062971765094, -0.30840216752519645, -0.04998341453788073, 0.032228710668067026, 0.17399629910031092, -0.21929515112677347, 0.13946251043428978, 0.09979443392459897, -0.06951922001452118, -0.1453620668541154, -0.06062232608488505, -0.13484504716335863, 0.018293078778314986, 0.14110260100468344, 0.029848303936043943, -0.04258908179548124, -0.13577115222258304, -0.012613739654678258, 0.37188653055362514, -0.1546930414489538, -0.29081961758218816, 0.14551936358591352, -0.14222821663471236, -0.0904964866872499, 0.18242219912455135, 0.10957798165390673, 0.15429573940059196, -0.10753784304171754, 0.11909074121596885, -0.07213158284624417, 0.21522534688921185, 0.15152037561452691, 0.017210105677013813, 0.1449709063719796, 0.09745333589060043, 0.11412007263119238, 0.111604293496213, -0.007208496953050296, -0.12040314796394196, -0.34051424264907837, -0.15364405612690726, -0.14725755318405404, 0.10271044382049392, -0.15030417069636684, -0.18600948891885902, 0.39084336474753806, 0.10174074991390217, 0.14649238303114753, 0.10502065793759581, 0.2113907889959038, 0.23732797350680482, -0.0041862772372753725, 0.12156662205909041, 0.18914974302363893, 0.16096250961224237, 0.16082358159178842, -0.2137012851282792, -0.040265997608556696, 0.13647074292859304]
|
1,803.07237
|
Detection of Another Molecular Bubble in the Galactic Center
|
The $l=-1.2^{\circ}$ region in the Galactic center has a high CO
$J$=3-2/$J$=1-0 intensity ratio and extremely broad velocity width. This paper
reports the detection of five expanding shells in the $l=-1.2^{\circ}$ region
based on the CO $J$=1-0, $^{13}$CO $J$=1-0, CO $J$=3-2, and SiO $J$=8-7 line
data sets obtained with the Nobeyama Radio Observatory 45 m telescope and James
Clerk Maxwell Telescope. The kinetic energy and expansion time of the expanding
shells are estimated to be $10^{48.3-50.8}$ erg and $10^{4.7-5.0}$ yr,
respectively. The origin of these expanding shells is discussed. The total
kinetic energy of $10^{51}$ erg and the typical expansion time of ${\sim}10^5$
yr correspond to multiple supernova explosions at a rate of $10^{-5}$-$10^{-4}$
yr$^{-1}$. This indicates that the $l=-1.2^{\circ}$ region may be a molecular
bubble associated with an embedded massive star cluster, although the absence
of an infrared counterpart makes this interpretation somewhat controversial.
The expansion time of the shells increases as the Galactic longitude decreases,
suggesting that the massive star cluster is moving from Galactic west to east
with respect to the interacting molecular gas. We propose a model wherein the
cluster is moving along the innermost x1 orbit and the interacting gas collides
with it from the Galactic eastern side.
|
astro-ph.GA
|
the l12circ region in the galactic center has a high co j32j10 intensity ratio and extremely broad velocity width this paper reports the detection of five expanding shells in the l12circ region based on the co j10 13co j10 co j32 and sio j87 line data sets obtained with the nobeyama radio observatory 45 m telescope and james clerk maxwell telescope the kinetic energy and expansion time of the expanding shells are estimated to be 10483508 erg and 104750 yr respectively the origin of these expanding shells is discussed the total kinetic energy of 1051 erg and the typical expansion time of sim105 yr correspond to multiple supernova explosions at a rate of 105104 yr1 this indicates that the l12circ region may be a molecular bubble associated with an embedded massive star cluster although the absence of an infrared counterpart makes this interpretation somewhat controversial the expansion time of the shells increases as the galactic longitude decreases suggesting that the massive star cluster is moving from galactic west to east with respect to the interacting molecular gas we propose a model wherein the cluster is moving along the innermost x1 orbit and the interacting gas collides with it from the galactic eastern side
|
[['the', 'l12circ', 'region', 'in', 'the', 'galactic', 'center', 'has', 'a', 'high', 'co', 'j32j10', 'intensity', 'ratio', 'and', 'extremely', 'broad', 'velocity', 'width', 'this', 'paper', 'reports', 'the', 'detection', 'of', 'five', 'expanding', 'shells', 'in', 'the', 'l12circ', 'region', 'based', 'on', 'the', 'co', 'j10', '13co', 'j10', 'co', 'j32', 'and', 'sio', 'j87', 'line', 'data', 'sets', 'obtained', 'with', 'the', 'nobeyama', 'radio', 'observatory', '45', 'm', 'telescope', 'and', 'james', 'clerk', 'maxwell', 'telescope', 'the', 'kinetic', 'energy', 'and', 'expansion', 'time', 'of', 'the', 'expanding', 'shells', 'are', 'estimated', 'to', 'be', '10483508', 'erg', 'and', '104750', 'yr', 'respectively', 'the', 'origin', 'of', 'these', 'expanding', 'shells', 'is', 'discussed', 'the', 'total', 'kinetic', 'energy', 'of', '1051', 'erg', 'and', 'the', 'typical', 'expansion', 'time', 'of', 'sim105', 'yr', 'correspond', 'to', 'multiple', 'supernova', 'explosions', 'at', 'a', 'rate', 'of', '105104', 'yr1', 'this', 'indicates', 'that', 'the', 'l12circ', 'region', 'may', 'be', 'a', 'molecular', 'bubble', 'associated', 'with', 'an', 'embedded', 'massive', 'star', 'cluster', 'although', 'the', 'absence', 'of', 'an', 'infrared', 'counterpart', 'makes', 'this', 'interpretation', 'somewhat', 'controversial', 'the', 'expansion', 'time', 'of', 'the', 'shells', 'increases', 'as', 'the', 'galactic', 'longitude', 'decreases', 'suggesting', 'that', 'the', 'massive', 'star', 'cluster', 'is', 'moving', 'from', 'galactic', 'west', 'to', 'east', 'with', 'respect', 'to', 'the', 'interacting', 'molecular', 'gas', 'we', 'propose', 'a', 'model', 'wherein', 'the', 'cluster', 'is', 'moving', 'along', 'the', 'innermost', 'x1', 'orbit', 'and', 'the', 'interacting', 'gas', 'collides', 'with', 'it', 'from', 'the', 'galactic', 'eastern', 'side']]
|
[-0.11559311168752517, 0.09862753035473425, 0.005582503504142981, 0.039247227658341585, -0.07875698483294219, -0.0407142984884703, 0.03513352808441772, 0.42078086592961306, -0.17294169425787995, -0.29064640273694503, 0.0868614890058965, -0.2972767754082582, 0.0029271742820146667, 0.1414199568909264, 0.03789565218592281, -0.10547785195684181, 0.05931533693651025, -0.053613704976750845, -0.05212713702262115, -0.19076142201098192, 0.2655077550550969, 0.1752166699720037, 0.187010888348505, 0.0039089886710251594, 0.09822522381040272, -0.16085415982886853, -0.043682158523846173, -0.04474425388138686, -0.1216820483933584, 0.0609874501013526, 0.20369574086966782, 0.11622730030710647, 0.20823366696823536, -0.3878171020951956, -0.20106148272660093, 0.053199720373191865, 0.20185787647045147, 0.009198891929051357, 0.013360585951922804, -0.3111332942041295, 0.014402876751710526, -0.21899643702321311, -0.2529425751927554, 0.12861979028339782, 0.05307889069472231, 0.05413821126410821, -0.19122837165130802, 0.1388439230287253, -0.0278807565366006, 0.06866006655572214, -0.14459141520655885, -0.11743874996622551, -0.07915130253088896, 0.028156219627152184, 0.03255386504029568, 0.14528573224719485, 0.19778322702069856, -0.09438000806950181, -0.003263592269429149, 0.39344795801171767, -0.07547998378071841, 0.010502169111428495, 0.2433515618386127, -0.2197253833263093, -0.1848689759208355, 0.2385945522888976, 0.11616059147755138, 0.10094932614783965, -0.13255978934235166, 0.04483240390971387, -0.04378887821702444, 0.2079693822060429, 0.09106729244836491, 0.044819189672161704, 0.31257745201018317, 0.10229793062957179, 0.049173929985723834, 0.14592192305451193, -0.29458222297206754, -0.11460678845226842, -0.24765284942603202, -0.12780738750325554, -0.12376151967443878, 0.09399569816702041, -0.14382757596500434, -0.09106318258323629, 0.2617440974729052, 0.07291870398518736, 0.23764073653308795, -0.0045300165575868755, 0.3001797701352605, 0.07753004454335763, 0.07459981262044453, 0.16837144960111833, 0.2838052220188489, 0.16371704626884034, 0.1600582618961361, -0.2500807574964059, 0.033440376298307484, 0.02705395229123718]
|
1,803.07238
|
Strong Electron-Phonon Coupling Superconductivity Induced by a Low-lying
Phonon in IrGe
|
The physical properties of the previously reported superconductor IrGe and
the Rh1-xIrxGe solid solution are investigated. IrGe has an exceptionally high
superconducting transition temperature (Tc = 4.7 K) among the isostructural 1:1
late-metal germanides MGe (M = Rh, Pd, Ir and Pt). Specific-heat measurements
reveal that IrGe has an anomalously low Debye temperature, originating from a
low-lying phonon, compared to the other MGe phases. A large jump at Tc in the
specific-heat data clearly indicates that IrGe is a strong coupling
superconductor. In the Rh1-xIrxGe solid solution, a relationship between an
anomalous change in lattice constants and the Debye temperature is observed. We
conclude that the unusually high Tc for IrGe is likely due to strong
electron-phonon coupling derived from the presence of a low-lying phonon.
|
cond-mat.supr-con cond-mat.mtrl-sci cond-mat.str-el
|
the physical properties of the previously reported superconductor irge and the rh1xirxge solid solution are investigated irge has an exceptionally high superconducting transition temperature tc 47 k among the isostructural 11 latemetal germanides mge m rh pd ir and pt specificheat measurements reveal that irge has an anomalously low debye temperature originating from a lowlying phonon compared to the other mge phases a large jump at tc in the specificheat data clearly indicates that irge is a strong coupling superconductor in the rh1xirxge solid solution a relationship between an anomalous change in lattice constants and the debye temperature is observed we conclude that the unusually high tc for irge is likely due to strong electronphonon coupling derived from the presence of a lowlying phonon
|
[['the', 'physical', 'properties', 'of', 'the', 'previously', 'reported', 'superconductor', 'irge', 'and', 'the', 'rh1xirxge', 'solid', 'solution', 'are', 'investigated', 'irge', 'has', 'an', 'exceptionally', 'high', 'superconducting', 'transition', 'temperature', 'tc', '47', 'k', 'among', 'the', 'isostructural', '11', 'latemetal', 'germanides', 'mge', 'm', 'rh', 'pd', 'ir', 'and', 'pt', 'specificheat', 'measurements', 'reveal', 'that', 'irge', 'has', 'an', 'anomalously', 'low', 'debye', 'temperature', 'originating', 'from', 'a', 'lowlying', 'phonon', 'compared', 'to', 'the', 'other', 'mge', 'phases', 'a', 'large', 'jump', 'at', 'tc', 'in', 'the', 'specificheat', 'data', 'clearly', 'indicates', 'that', 'irge', 'is', 'a', 'strong', 'coupling', 'superconductor', 'in', 'the', 'rh1xirxge', 'solid', 'solution', 'a', 'relationship', 'between', 'an', 'anomalous', 'change', 'in', 'lattice', 'constants', 'and', 'the', 'debye', 'temperature', 'is', 'observed', 'we', 'conclude', 'that', 'the', 'unusually', 'high', 'tc', 'for', 'irge', 'is', 'likely', 'due', 'to', 'strong', 'electronphonon', 'coupling', 'derived', 'from', 'the', 'presence', 'of', 'a', 'lowlying', 'phonon']]
|
[-0.16603121062171114, 0.2126649815413845, -0.040568317584202755, 0.01860369735662941, -0.040750087494769494, -0.17526382895201936, 0.12816106347551892, 0.37014962018521363, -0.19954485737156769, -0.27631911942504406, 0.0055640004036470875, -0.4040402275594798, -0.07875973100904837, 0.15307866685161722, 0.07466255142238022, -0.010197264373240885, -0.05380629196816917, 0.008017027429747588, -0.12980428236644437, -0.17679886808271342, 0.2530278325204022, 0.05035061788675953, 0.3182995054285881, 0.12655092783518568, 0.04088743618393147, -0.09692279089286476, 0.13110276490203604, 0.036441128533564446, -0.14578732757242002, 0.00812432222253035, 0.2740815209748208, -0.10839452267978494, 0.16863866760741827, -0.33894993442549437, -0.21525425397288747, 0.01313116571342588, 0.11889568408797226, 0.08676257814292235, -0.07118816180385587, -0.21630966689145145, 0.06735033680461655, -0.10092878691113193, -0.13103014034457688, -0.07708349746886703, 0.045059261770441755, -0.05389064379144183, -0.27618581610000575, 0.1323994849135037, 0.02292656788048296, 0.15227430278035112, -0.10315841425995319, -0.18504896328191867, -0.08052834553243823, -0.0030410995760794023, 0.09505648700297187, 0.07324702899194946, 0.10601119231047833, -0.08019123991474139, -0.03785952142909292, 0.3396666883067651, -0.10482327580790628, 0.013235671899843314, 0.21920496530730801, -0.1811998169466301, -0.10850671631830537, 0.24413944886273836, 0.056346198906621715, 0.07589375893469931, -0.14610819959597401, 0.0936656219060706, -0.030272222776350773, 0.2206895815608792, 0.034233367159069814, 0.08339743860727869, 0.21424812282828137, 0.16752481576240977, -0.030821757288389907, 0.11354753539045072, -0.12927631947619855, 0.006424222480167042, -0.21338490695184606, -0.1577334276685291, -0.22387464927925058, 0.07730011435895234, -0.14323992345230518, -0.16171361100744486, 0.27537532696069394, 0.12999475068385782, 0.2191003194532919, -0.05049074990174556, 0.17595042908479544, 0.12467253943982202, 0.10461227070878852, 0.0782185360473727, 0.3008644356323052, 0.21128798800728416, 0.16624623545915013, -0.36443950104226996, 0.09422466841580207, -0.0027609111525672527]
|
1,803.07239
|
A Class of Quasitriangular Group-cograded Multiplier Hopf Algebras
|
For a multiplier Hopf algebra pairing $\langle A, B\rangle$, we construct a
class of group-cograded multiplier Hopf algebras $D(A, B)$, generalizing the
classical construction of finite dimensional Hopf algebras introduced by
Panaite and Staic Mihai. Furthermore, if the multiplier Hopf algebra pairing
admits a canonical multiplier in $M(B\otimes A)$ we show the existence of
quasitriangular structure on $D(A, B)$. As an application, some special cases
and examples are provided.
|
math.RA
|
for a multiplier hopf algebra pairing langle a brangle we construct a class of groupcograded multiplier hopf algebras da b generalizing the classical construction of finite dimensional hopf algebras introduced by panaite and staic mihai furthermore if the multiplier hopf algebra pairing admits a canonical multiplier in mbotimes a we show the existence of quasitriangular structure on da b as an application some special cases and examples are provided
|
[['for', 'a', 'multiplier', 'hopf', 'algebra', 'pairing', 'langle', 'a', 'brangle', 'we', 'construct', 'a', 'class', 'of', 'groupcograded', 'multiplier', 'hopf', 'algebras', 'da', 'b', 'generalizing', 'the', 'classical', 'construction', 'of', 'finite', 'dimensional', 'hopf', 'algebras', 'introduced', 'by', 'panaite', 'and', 'staic', 'mihai', 'furthermore', 'if', 'the', 'multiplier', 'hopf', 'algebra', 'pairing', 'admits', 'a', 'canonical', 'multiplier', 'in', 'mbotimes', 'a', 'we', 'show', 'the', 'existence', 'of', 'quasitriangular', 'structure', 'on', 'da', 'b', 'as', 'an', 'application', 'some', 'special', 'cases', 'and', 'examples', 'are', 'provided']]
|
[-0.1905773361011044, 0.06125533529004737, -0.039795674319527505, 0.08359372678408535, -0.15208588348890562, -0.19597747648620736, -0.044104246915304575, 0.29886391588851163, -0.3500924607185458, -0.09361039471907029, 0.11266473679047456, -0.19029744199234183, -0.18099639934582124, 0.22031160755811827, -0.13341847496728101, -0.09290743687703018, 0.07266014957449575, 0.11765224470392517, -0.17315533869238436, -0.2436977175934969, 0.41314179369288945, 0.0006876187871439733, 0.19950027306280707, -0.01869318423964812, 0.12326867596340785, 0.03909056399530475, 0.004052577256832434, 0.003188320636542377, -0.2345666119666851, -0.005376864913041177, 0.28005723819892475, 0.038928589108737484, 0.24306382301290505, -0.27695237648119964, -0.0697673652418113, 0.11411757103126982, 0.14409223462765416, -0.0023427606438813004, -0.08736711162297676, -0.274027236615834, 0.11754449566575678, -0.34254041862795537, -0.09040964238575079, -0.13718133100537935, 0.07121301898597807, 0.007682844766996045, -0.33344858645653835, 0.0017475172121455703, 0.170636634990249, 0.15070579068708248, -0.08986665481917452, -0.11029278156280085, -0.11003406637388727, 0.0034736701678754625, -0.10928588444232076, 0.017236326382481966, 0.1012242528360229, -0.05984029823889284, -0.17758300849169062, 0.27327708350629476, -0.025637001595527367, -0.23290496206153993, 0.14685934647728782, -0.10716569790636878, -0.1583011731221948, 0.04135382151318903, -0.027255744119917137, 0.13247040140887964, -0.0169176963112398, 0.24977887813103103, -0.15085496617130179, -0.014060899230611065, 0.12458196957933082, -0.029636232152857912, 0.08536653844234736, 0.0761391343616381, 0.08406784588410317, 0.1194503375639518, 0.005540981649191699, -0.04376049760891044, -0.3922296249294195, -0.19869062376412752, -0.05898753484117164, 0.17177794387807016, -0.04137003485854054, -0.21362102023609306, 0.40151213784364687, 0.07267602589959954, 0.1644263823678636, 0.03797307430995979, 0.14777392469198053, 0.07168240115762287, 0.11842330845673502, 0.0638624434561833, 0.10951857473844649, 0.3532420323952439, 0.032544167300659246, -0.12042040379205043, -0.13921312084489001, 0.3168080145007242]
|
1,803.0724
|
SlideNet: Fast and Accurate Slide Quality Assessment Based on Deep
Neural Networks
|
This work tackles the automatic fine-grained slide quality assessment problem
for digitized direct smears test using the Gram staining protocol. Automatic
quality assessment can provide useful information for the pathologists and the
whole digital pathology workflow. For instance, if the system found a slide to
have a low staining quality, it could send a request to the automatic slide
preparation system to remake the slide. If the system detects severe damage in
the slides, it could notify the experts that manual microscope reading may be
required. In order to address the quality assessment problem, we propose a deep
neural network based framework to automatically assess the slide quality in a
semantic way. Specifically, the first step of our framework is to perform dense
fine-grained region classification on the whole slide and calculate the region
distribution histogram. Next, our framework will generate assessments of the
slide quality from various perspectives: staining quality, information density,
damage level and which regions are more valuable for subsequent
high-magnification analysis. To make the information more accessible, we
present our results in the form of a heat map and text summaries. Additionally,
in order to stimulate research in this direction, we propose a novel dataset
for slide quality assessment. Experiments show that the proposed framework
outperforms recent related works.
|
cs.CV
|
this work tackles the automatic finegrained slide quality assessment problem for digitized direct smears test using the gram staining protocol automatic quality assessment can provide useful information for the pathologists and the whole digital pathology workflow for instance if the system found a slide to have a low staining quality it could send a request to the automatic slide preparation system to remake the slide if the system detects severe damage in the slides it could notify the experts that manual microscope reading may be required in order to address the quality assessment problem we propose a deep neural network based framework to automatically assess the slide quality in a semantic way specifically the first step of our framework is to perform dense finegrained region classification on the whole slide and calculate the region distribution histogram next our framework will generate assessments of the slide quality from various perspectives staining quality information density damage level and which regions are more valuable for subsequent highmagnification analysis to make the information more accessible we present our results in the form of a heat map and text summaries additionally in order to stimulate research in this direction we propose a novel dataset for slide quality assessment experiments show that the proposed framework outperforms recent related works
|
[['this', 'work', 'tackles', 'the', 'automatic', 'finegrained', 'slide', 'quality', 'assessment', 'problem', 'for', 'digitized', 'direct', 'smears', 'test', 'using', 'the', 'gram', 'staining', 'protocol', 'automatic', 'quality', 'assessment', 'can', 'provide', 'useful', 'information', 'for', 'the', 'pathologists', 'and', 'the', 'whole', 'digital', 'pathology', 'workflow', 'for', 'instance', 'if', 'the', 'system', 'found', 'a', 'slide', 'to', 'have', 'a', 'low', 'staining', 'quality', 'it', 'could', 'send', 'a', 'request', 'to', 'the', 'automatic', 'slide', 'preparation', 'system', 'to', 'remake', 'the', 'slide', 'if', 'the', 'system', 'detects', 'severe', 'damage', 'in', 'the', 'slides', 'it', 'could', 'notify', 'the', 'experts', 'that', 'manual', 'microscope', 'reading', 'may', 'be', 'required', 'in', 'order', 'to', 'address', 'the', 'quality', 'assessment', 'problem', 'we', 'propose', 'a', 'deep', 'neural', 'network', 'based', 'framework', 'to', 'automatically', 'assess', 'the', 'slide', 'quality', 'in', 'a', 'semantic', 'way', 'specifically', 'the', 'first', 'step', 'of', 'our', 'framework', 'is', 'to', 'perform', 'dense', 'finegrained', 'region', 'classification', 'on', 'the', 'whole', 'slide', 'and', 'calculate', 'the', 'region', 'distribution', 'histogram', 'next', 'our', 'framework', 'will', 'generate', 'assessments', 'of', 'the', 'slide', 'quality', 'from', 'various', 'perspectives', 'staining', 'quality', 'information', 'density', 'damage', 'level', 'and', 'which', 'regions', 'are', 'more', 'valuable', 'for', 'subsequent', 'highmagnification', 'analysis', 'to', 'make', 'the', 'information', 'more', 'accessible', 'we', 'present', 'our', 'results', 'in', 'the', 'form', 'of', 'a', 'heat', 'map', 'and', 'text', 'summaries', 'additionally', 'in', 'order', 'to', 'stimulate', 'research', 'in', 'this', 'direction', 'we', 'propose', 'a', 'novel', 'dataset', 'for', 'slide', 'quality', 'assessment', 'experiments', 'show', 'that', 'the', 'proposed', 'framework', 'outperforms', 'recent', 'related', 'works']]
|
[-0.04392143868526418, 0.022207265835640155, -0.10351029703035042, 0.05276700153350043, -0.11135544989940147, -0.12028163686578333, 0.06703062561130754, 0.4254335476863832, -0.2245504402931552, -0.31648937426507473, 0.11083259261727, -0.2616598000028499, -0.15403790494641334, 0.2074017596027722, -0.14550749179710384, 0.08177089708323805, 0.1309801337108051, 0.039045838934414205, -0.018313926051069105, -0.2860633128545654, 0.2670553517478689, 0.05627553459973415, 0.409201201012122, 0.07080304564223865, 0.07374149607057233, -0.0006903674739889556, -0.059642104864308494, 0.0015160773433701184, -0.11852509435956277, 0.17197077963588664, 0.31949691109232464, 0.21161538888722167, 0.340327345140873, -0.4256106286917424, -0.21320809466773075, 0.07158584687683923, 0.14296800686164537, 0.10859170528248985, -0.05151371187937638, -0.3327395376867392, 0.10590398218919973, -0.14624619701693595, -0.048411539832278735, -0.1422201739842763, -0.06601424735100823, -0.05496213952775721, -0.2712412501331156, 0.04599882987275405, 0.0341060784633901, 0.05204908817267579, -0.0380378876328512, -0.048440442961080986, 0.027742694515708675, 0.2351059501022188, -0.007236894918605685, 0.08562570584770139, 0.2024936239921571, -0.16655680198444298, -0.07977084582944799, 0.36428394190477376, -0.023325608505981105, -0.20110409074143765, 0.16407856515618566, -0.07408781744050028, -0.13697959642699906, 0.1527040629787589, 0.20446714317697173, 0.09565433953831873, -0.1957696887310332, -0.06614009438051423, -0.006733649430529788, 0.2337204283081485, 0.09281701327983657, -0.03012977754303687, 0.2116916796581671, 0.2507714138720447, 0.03548611765902297, 0.176469605512799, -0.1361273376308294, 0.017174329628627923, -0.23223785131277752, -0.20420827169163686, -0.12528685190315367, -0.031077766411133252, -0.045762117758766034, -0.16467221737117835, 0.40720153194108866, 0.24622043710422786, 0.1705720168669564, 0.0451114546368773, 0.36838308280167725, 0.001586105812782588, 0.09159431723274396, 0.00265087366394891, 0.1738171779584498, -0.02657463672645215, 0.14524023070223105, -0.1529998009698684, 0.10392583127323748, 0.07035826702554111]
|
1,803.07241
|
Imaging Extended Emission-Line Regions of Obscured AGN with the Subaru
Hyper Suprime-Cam Survey
|
Narrow-line regions excited by active galactic nuclei (AGN) are important for
studying AGN photoionization and feedback. Their strong [O III] lines can be
detected with broadband images, allowing morphological studies of these systems
with large-area imaging surveys. We develop a new technique to reconstruct the
[O III] images using the Subaru Hyper Suprime-Cam (HSC) Survey aided with
spectra from the Sloan Digital Sky Survey (SDSS). The technique involves a
careful subtraction of the galactic continuum to isolate emission from the [O
III]$\lambda$5007 and [O III]$\lambda$4959 lines. Compared to traditional
targeted observations, this technique is more efficient at covering larger
samples with less dedicated observational resources. We apply this technique to
an SDSS spectroscopically selected sample of 300 obscured AGN at redshifts 0.1
- 0.7, uncovering extended emission-line region candidates with sizes up to
tens of kpc. With the largest sample of uniformly derived narrow-line region
sizes, we revisit the narrow-line region size-luminosity relation. The area and
radii of the [O III] emission-line regions are strongly correlated with the AGN
luminosity inferred from the mid-infrared (15 $\mu$m rest-frame) with a
power-law slope of $0.62^{+0.05}_{-0.06} \pm 0.10$ (statistical and systemic
errors), consistent with previous spectroscopic findings. We discuss the
implications for the physics of AGN emission-line region and future
applications of this technique, which should be useful for current and
next-generation imaging surveys to study AGN photoionization and feedback with
large statistical samples.
|
astro-ph.GA
|
narrowline regions excited by active galactic nuclei agn are important for studying agn photoionization and feedback their strong o iii lines can be detected with broadband images allowing morphological studies of these systems with largearea imaging surveys we develop a new technique to reconstruct the o iii images using the subaru hyper suprimecam hsc survey aided with spectra from the sloan digital sky survey sdss the technique involves a careful subtraction of the galactic continuum to isolate emission from the o iiilambda5007 and o iiilambda4959 lines compared to traditional targeted observations this technique is more efficient at covering larger samples with less dedicated observational resources we apply this technique to an sdss spectroscopically selected sample of 300 obscured agn at redshifts 01 07 uncovering extended emissionline region candidates with sizes up to tens of kpc with the largest sample of uniformly derived narrowline region sizes we revisit the narrowline region sizeluminosity relation the area and radii of the o iii emissionline regions are strongly correlated with the agn luminosity inferred from the midinfrared 15 mum restframe with a powerlaw slope of 062005_006 pm 010 statistical and systemic errors consistent with previous spectroscopic findings we discuss the implications for the physics of agn emissionline region and future applications of this technique which should be useful for current and nextgeneration imaging surveys to study agn photoionization and feedback with large statistical samples
|
[['narrowline', 'regions', 'excited', 'by', 'active', 'galactic', 'nuclei', 'agn', 'are', 'important', 'for', 'studying', 'agn', 'photoionization', 'and', 'feedback', 'their', 'strong', 'o', 'iii', 'lines', 'can', 'be', 'detected', 'with', 'broadband', 'images', 'allowing', 'morphological', 'studies', 'of', 'these', 'systems', 'with', 'largearea', 'imaging', 'surveys', 'we', 'develop', 'a', 'new', 'technique', 'to', 'reconstruct', 'the', 'o', 'iii', 'images', 'using', 'the', 'subaru', 'hyper', 'suprimecam', 'hsc', 'survey', 'aided', 'with', 'spectra', 'from', 'the', 'sloan', 'digital', 'sky', 'survey', 'sdss', 'the', 'technique', 'involves', 'a', 'careful', 'subtraction', 'of', 'the', 'galactic', 'continuum', 'to', 'isolate', 'emission', 'from', 'the', 'o', 'iiilambda5007', 'and', 'o', 'iiilambda4959', 'lines', 'compared', 'to', 'traditional', 'targeted', 'observations', 'this', 'technique', 'is', 'more', 'efficient', 'at', 'covering', 'larger', 'samples', 'with', 'less', 'dedicated', 'observational', 'resources', 'we', 'apply', 'this', 'technique', 'to', 'an', 'sdss', 'spectroscopically', 'selected', 'sample', 'of', '300', 'obscured', 'agn', 'at', 'redshifts', '01', '07', 'uncovering', 'extended', 'emissionline', 'region', 'candidates', 'with', 'sizes', 'up', 'to', 'tens', 'of', 'kpc', 'with', 'the', 'largest', 'sample', 'of', 'uniformly', 'derived', 'narrowline', 'region', 'sizes', 'we', 'revisit', 'the', 'narrowline', 'region', 'sizeluminosity', 'relation', 'the', 'area', 'and', 'radii', 'of', 'the', 'o', 'iii', 'emissionline', 'regions', 'are', 'strongly', 'correlated', 'with', 'the', 'agn', 'luminosity', 'inferred', 'from', 'the', 'midinfrared', '15', 'mum', 'restframe', 'with', 'a', 'powerlaw', 'slope', 'of', '062005_006', 'pm', '010', 'statistical', 'and', 'systemic', 'errors', 'consistent', 'with', 'previous', 'spectroscopic', 'findings', 'we', 'discuss', 'the', 'implications', 'for', 'the', 'physics', 'of', 'agn', 'emissionline', 'region', 'and', 'future', 'applications', 'of', 'this', 'technique', 'which', 'should', 'be', 'useful', 'for', 'current', 'and', 'nextgeneration', 'imaging', 'surveys', 'to', 'study', 'agn', 'photoionization', 'and', 'feedback', 'with', 'large', 'statistical', 'samples']]
|
[0.022450395590695144, 0.05069687956972956, -0.013012753190930215, 0.08974755607165494, -0.12090101361932364, -0.12766456279879143, 0.0842136892463538, 0.4794159141418181, -0.14775137245254755, -0.3572623461051926, 0.052797123812253405, -0.33868184354842495, 0.019099324988609737, 0.21760698079883137, -0.017724289587931708, -0.04360600450838734, 0.0033508744487143736, -0.2055974853523239, -0.010367922444027244, -0.25607540603959933, 0.2884350252917788, 0.11092294975012344, 0.20765427041113613, -0.09141757313913682, 0.03934162932069229, -0.08153639331545778, -0.16175018358473225, 0.023607955697164135, -0.17773637571461445, 0.11345416418146015, 0.3134523813077657, 0.1591024555678463, 0.2577383715777838, -0.28029015979272864, -0.1928296154487486, 0.08280818948881924, 0.22231609315872847, 0.057607911099790056, -0.06950552736771785, -0.3146041528007277, 0.06767718379029375, -0.1598867183926989, -0.17274664168393142, 0.053838820737917306, 0.01608138321081928, 0.0700163978198473, -0.2290598068477202, 0.11008460596796092, -0.03417738125401165, 0.1585685767587213, -0.11004823168970465, -0.11502445156261194, -0.04775656488307409, 0.06626552430475784, -0.04072404676219122, 0.06027180158375893, 0.20316072039739147, -0.15868187925406618, -0.040986836898618526, 0.3635200952432984, -0.002135733408003784, 0.06514525460896262, 0.20884876664811663, -0.21325075162550142, -0.1817007371012056, 0.20012473394755242, 0.17759616171832404, 0.14877405369617536, -0.1456278277552899, 0.013084059853051593, -0.005852790044931074, 0.2789190747048052, -0.0438232936941316, 0.10935309964125943, 0.2886317635461557, 0.09528996976982933, 0.03456031669568466, 0.1257582942933751, -0.3068962011878428, 0.01789403885700985, -0.2620602076150183, -0.04178436782789057, -0.08874334438638598, 0.09556198494892829, -0.13293076692264694, -0.08465024047090035, 0.32102574610147266, 0.10747204028813397, 0.22289148846175522, 0.05246879223947568, 0.3199992762171876, 0.04555314369785616, 0.13602916663614706, 0.05500187238539455, 0.3267160918606494, 0.16728191750655497, 0.10163450749793188, -0.21680574931598498, 0.016935789484832958, 0.023697789412261427]
|
1,803.07242
|
BCS thermal vacuum of fermionic superfluids and its perturbation theory
|
The thermal field theory is applied to fermionic superfluids by doubling the
degrees of freedom of the BCS theory. We construct the two-mode states and the
corresponding Bogoliubov transformation to obtain the BCS thermal vacuum. The
expectation values with respect to the BCS thermal vacuum produce the
statistical average of the thermodynamic quantities. The BCS thermal vacuum
allows a quantum-mechanical perturbation theory with the BCS theory serving as
the unperturbed state. We evaluate the leading-order corrections to the order
parameter and other physical quantities from the perturbation theory. A direct
evaluation of the pairing correlation as a function of temperature shows the
pseudogap phenomenon results from the perturbation theory. The BCS thermal
vacuum is shown to be a generalized coherent and squeezed state. The
correspondence between the thermal vacuum and purification of the density
matrix allows a unitary transformation, and we found the geometric phase in the
parameter space associated with the transformation.
|
cond-mat.supr-con
|
the thermal field theory is applied to fermionic superfluids by doubling the degrees of freedom of the bcs theory we construct the twomode states and the corresponding bogoliubov transformation to obtain the bcs thermal vacuum the expectation values with respect to the bcs thermal vacuum produce the statistical average of the thermodynamic quantities the bcs thermal vacuum allows a quantummechanical perturbation theory with the bcs theory serving as the unperturbed state we evaluate the leadingorder corrections to the order parameter and other physical quantities from the perturbation theory a direct evaluation of the pairing correlation as a function of temperature shows the pseudogap phenomenon results from the perturbation theory the bcs thermal vacuum is shown to be a generalized coherent and squeezed state the correspondence between the thermal vacuum and purification of the density matrix allows a unitary transformation and we found the geometric phase in the parameter space associated with the transformation
|
[['the', 'thermal', 'field', 'theory', 'is', 'applied', 'to', 'fermionic', 'superfluids', 'by', 'doubling', 'the', 'degrees', 'of', 'freedom', 'of', 'the', 'bcs', 'theory', 'we', 'construct', 'the', 'twomode', 'states', 'and', 'the', 'corresponding', 'bogoliubov', 'transformation', 'to', 'obtain', 'the', 'bcs', 'thermal', 'vacuum', 'the', 'expectation', 'values', 'with', 'respect', 'to', 'the', 'bcs', 'thermal', 'vacuum', 'produce', 'the', 'statistical', 'average', 'of', 'the', 'thermodynamic', 'quantities', 'the', 'bcs', 'thermal', 'vacuum', 'allows', 'a', 'quantummechanical', 'perturbation', 'theory', 'with', 'the', 'bcs', 'theory', 'serving', 'as', 'the', 'unperturbed', 'state', 'we', 'evaluate', 'the', 'leadingorder', 'corrections', 'to', 'the', 'order', 'parameter', 'and', 'other', 'physical', 'quantities', 'from', 'the', 'perturbation', 'theory', 'a', 'direct', 'evaluation', 'of', 'the', 'pairing', 'correlation', 'as', 'a', 'function', 'of', 'temperature', 'shows', 'the', 'pseudogap', 'phenomenon', 'results', 'from', 'the', 'perturbation', 'theory', 'the', 'bcs', 'thermal', 'vacuum', 'is', 'shown', 'to', 'be', 'a', 'generalized', 'coherent', 'and', 'squeezed', 'state', 'the', 'correspondence', 'between', 'the', 'thermal', 'vacuum', 'and', 'purification', 'of', 'the', 'density', 'matrix', 'allows', 'a', 'unitary', 'transformation', 'and', 'we', 'found', 'the', 'geometric', 'phase', 'in', 'the', 'parameter', 'space', 'associated', 'with', 'the', 'transformation']]
|
[-0.12733598365037538, 0.20537850757363843, -0.16908122049157623, 0.07190568457978468, -0.0237535959675762, -0.08938840196279237, 0.06363101940285536, 0.2672781305375442, -0.25312045698124136, -0.24273674004578816, 0.02428986022197124, -0.2926130235665767, -0.0917804244163087, 0.11741108102176119, 0.004031101399971769, 0.08614113222241929, -0.03003098727721307, 0.08219395767824322, -0.15945017595282374, -0.19373008423162247, 0.353814225328867, 0.046645281567227616, 0.333875526047123, 0.044828411005285194, 0.06794812549149094, 0.009407012233376697, 0.04564361359157106, 0.013020597288523514, -0.13623112073258323, 0.06336590171954443, 0.23785079414560611, 0.023215517243431284, 0.21081747353385855, -0.41354972532542505, -0.22174606715128117, 0.07992312582392319, 0.04969759052942714, 0.1941673909009623, 0.0298219889438912, -0.31840079626543266, -0.02941822392099044, -0.19440380721870396, -0.18515429730539276, -0.1228825846714351, -0.058710032163242644, -0.05965010966082998, -0.2822591447046185, 0.11862273635577164, -0.019822671665548304, -0.002031876650803229, -0.08266330707485002, -0.09767679105287576, -0.045555789070812605, 0.0724211590169789, 0.05632482933830105, 0.04052799384321202, 0.1620097200118395, -0.16296593703475462, -0.057367466529755204, 0.37345452775898713, -0.12852983796144257, -0.15280832565156363, 0.14078703106934923, -0.12424775753992007, -0.02673918813820076, 0.12578349249753978, 0.0374237236359881, 0.07863606006406199, -0.13239703930418306, 0.11302672182719582, -0.0206055810372193, 0.164982135800243, 0.028364268268513328, 0.10439672444040089, 0.21495932741303703, 0.08443623424349414, 0.027691405570877143, 0.1863131847767482, -0.07684378164669718, -0.16525846702393657, -0.3615447565353189, -0.13983027551177085, -0.19786664539966367, 0.05690732320734099, -0.11634988961756546, -0.20555547299833657, 0.4004705246945758, 0.1632414091967375, 0.16209104572562805, 0.03070259876884033, 0.2715146694989765, 0.1814649398514721, 0.038624707420715707, 0.026939306348817898, 0.30211653591444093, 0.23580553299546533, 0.09420125826499333, -0.326346914061753, -0.028855350819641565, 0.08571748324864684]
|
1,803.07243
|
Energy-Efficient Joint Offloading and Wireless Resource Allocation
Strategy in Multi-MEC Server Systems
|
Mobile edge computing (MEC) is an emerging paradigm that mobile devices can
offload the computation-intensive or latency-critical tasks to the nearby MEC
servers, so as to save energy and extend battery life. Unlike the cloud server,
MEC server is a small-scale data center deployed at a wireless access point,
thus it is highly sensitive to both radio and computing resource. In this
paper, we consider an Orthogonal Frequency-Division Multiplexing Access (OFDMA)
based multi-user and multi-MEC-server system, where the task offloading
strategies and wireless resources allocation are jointly investigated. Aiming
at minimizing the total energy consumption, we propose the joint offloading and
resource allocation strategy for latency-critical applications. Through the
bi-level optimization approach, the original NP-hard problem is decoupled into
the lower-level problem seeking for the allocation of power and subcarrier and
the upper-level task offloading problem. Simulation results show that the
proposed algorithm achieves excellent performance in energy saving and
successful offloading probability (SOP) in comparison with conventional
schemes.
|
cs.IT math.IT
|
mobile edge computing mec is an emerging paradigm that mobile devices can offload the computationintensive or latencycritical tasks to the nearby mec servers so as to save energy and extend battery life unlike the cloud server mec server is a smallscale data center deployed at a wireless access point thus it is highly sensitive to both radio and computing resource in this paper we consider an orthogonal frequencydivision multiplexing access ofdma based multiuser and multimecserver system where the task offloading strategies and wireless resources allocation are jointly investigated aiming at minimizing the total energy consumption we propose the joint offloading and resource allocation strategy for latencycritical applications through the bilevel optimization approach the original nphard problem is decoupled into the lowerlevel problem seeking for the allocation of power and subcarrier and the upperlevel task offloading problem simulation results show that the proposed algorithm achieves excellent performance in energy saving and successful offloading probability sop in comparison with conventional schemes
|
[['mobile', 'edge', 'computing', 'mec', 'is', 'an', 'emerging', 'paradigm', 'that', 'mobile', 'devices', 'can', 'offload', 'the', 'computationintensive', 'or', 'latencycritical', 'tasks', 'to', 'the', 'nearby', 'mec', 'servers', 'so', 'as', 'to', 'save', 'energy', 'and', 'extend', 'battery', 'life', 'unlike', 'the', 'cloud', 'server', 'mec', 'server', 'is', 'a', 'smallscale', 'data', 'center', 'deployed', 'at', 'a', 'wireless', 'access', 'point', 'thus', 'it', 'is', 'highly', 'sensitive', 'to', 'both', 'radio', 'and', 'computing', 'resource', 'in', 'this', 'paper', 'we', 'consider', 'an', 'orthogonal', 'frequencydivision', 'multiplexing', 'access', 'ofdma', 'based', 'multiuser', 'and', 'multimecserver', 'system', 'where', 'the', 'task', 'offloading', 'strategies', 'and', 'wireless', 'resources', 'allocation', 'are', 'jointly', 'investigated', 'aiming', 'at', 'minimizing', 'the', 'total', 'energy', 'consumption', 'we', 'propose', 'the', 'joint', 'offloading', 'and', 'resource', 'allocation', 'strategy', 'for', 'latencycritical', 'applications', 'through', 'the', 'bilevel', 'optimization', 'approach', 'the', 'original', 'nphard', 'problem', 'is', 'decoupled', 'into', 'the', 'lowerlevel', 'problem', 'seeking', 'for', 'the', 'allocation', 'of', 'power', 'and', 'subcarrier', 'and', 'the', 'upperlevel', 'task', 'offloading', 'problem', 'simulation', 'results', 'show', 'that', 'the', 'proposed', 'algorithm', 'achieves', 'excellent', 'performance', 'in', 'energy', 'saving', 'and', 'successful', 'offloading', 'probability', 'sop', 'in', 'comparison', 'with', 'conventional', 'schemes']]
|
[-0.23659754470226507, -0.036593568150824984, -0.02140060329479696, -0.003351513892441658, -0.09404268802756656, -0.26314587011060947, 0.15290235390789406, 0.412635246692579, -0.29987534233427876, -0.322360757555624, 0.08411044754232339, -0.24553639332091884, -0.1329182873294347, 0.1426486275497753, -0.13354277678712306, 0.10313133787528812, 0.08845864481011205, 0.011850066743850049, 0.03388163530639125, -0.2565924002909797, 0.2384885991275122, 0.14683260481592408, 0.44147764851303795, 0.0612715436366705, 0.0412304297073367, 0.01116866905343884, -0.014939624842704285, -0.08180625368605214, -0.03736719453924327, 0.12554716426787804, 0.4123730669947506, 0.2227142315853057, 0.35272125658782527, -0.46571523540570764, -0.2023154699915572, 0.11313897511874667, 0.19193453849529069, -0.01562940683274801, -0.06333442506545424, -0.24708008915303817, 0.13904876304463235, -0.26929717247309515, 0.00894697899408889, -0.013928968645042823, -0.04335060574798078, 0.00974849156469484, -0.35681050065374353, -0.011000145293397923, -0.09566205751763869, -0.0166696169991282, -0.11285456778495234, -0.11817331629867159, 0.049506250343026144, 0.18143449335718598, 0.0028479124724797174, 0.009423506207457638, 0.16195953624099022, -0.14798969131912093, -0.17881457866876846, 0.4362146800407503, 0.07938559972415855, -0.19174868295770847, 0.13031551560027455, 0.04238362037989346, -0.15122305016516696, 0.1063587127276991, 0.24809929243689757, 0.07333010233772176, -0.19434382782694942, 0.0664694200747328, 0.006739253297601414, 0.12160732195350854, 0.048450272889878555, 0.10289360865761962, 0.1868050858596505, 0.25106024429831314, 0.19451629949285637, 0.14435359911515697, -0.1002861130673179, -0.1571327060522936, -0.12998949866329285, -0.1404606918214903, -0.2641753172796644, 0.012119409479377674, -0.06420810400918008, -0.030540256870061726, 0.3607378605093005, 0.13535070884383366, 0.06974549517418624, 0.12435424579248493, 0.48685837129154536, 0.13880822436716053, 0.07170477326586548, 0.23774916676825053, 0.10681168587666147, -0.005825811236672387, 0.2323650734331842, -0.26520440171920706, 0.000516585576866718, -0.02612799658923398]
|
1,803.07244
|
The Three Pillars of Machine Programming
|
In this position paper, we describe our vision of the future of machine
programming through a categorical examination of three pillars of research.
Those pillars are: (i) intention, (ii) invention, and(iii) adaptation.
Intention emphasizes advancements in the human-to-computer and
computer-to-machine-learning interfaces. Invention emphasizes the creation or
refinement of algorithms or core hardware and software building blocks through
machine learning (ML). Adaptation emphasizes advances in the use of ML-based
constructs to autonomously evolve software.
|
cs.AI cs.PL cs.SE
|
in this position paper we describe our vision of the future of machine programming through a categorical examination of three pillars of research those pillars are i intention ii invention andiii adaptation intention emphasizes advancements in the humantocomputer and computertomachinelearning interfaces invention emphasizes the creation or refinement of algorithms or core hardware and software building blocks through machine learning ml adaptation emphasizes advances in the use of mlbased constructs to autonomously evolve software
|
[['in', 'this', 'position', 'paper', 'we', 'describe', 'our', 'vision', 'of', 'the', 'future', 'of', 'machine', 'programming', 'through', 'a', 'categorical', 'examination', 'of', 'three', 'pillars', 'of', 'research', 'those', 'pillars', 'are', 'i', 'intention', 'ii', 'invention', 'andiii', 'adaptation', 'intention', 'emphasizes', 'advancements', 'in', 'the', 'humantocomputer', 'and', 'computertomachinelearning', 'interfaces', 'invention', 'emphasizes', 'the', 'creation', 'or', 'refinement', 'of', 'algorithms', 'or', 'core', 'hardware', 'and', 'software', 'building', 'blocks', 'through', 'machine', 'learning', 'ml', 'adaptation', 'emphasizes', 'advances', 'in', 'the', 'use', 'of', 'mlbased', 'constructs', 'to', 'autonomously', 'evolve', 'software']]
|
[-0.0905971001754974, 0.02199350117745114, -0.08169674437532437, -0.012517994802615697, -0.18096416031705662, -0.16900161529799373, 0.02042312030910029, 0.4174631888597784, -0.2721135593216184, -0.3443196189038875, 0.08477737474694691, -0.2176182366812087, -0.19624243147382645, 0.17162837711831844, -0.15013061929494143, 0.04557021160308324, 0.09424739525797711, -0.04179959057528578, -0.06272553628258093, -0.2552687345518613, 0.3076335325259978, 0.05669149129428494, 0.36232000891066773, 0.0012774179217366266, 0.06158956519531374, 0.052434240179267566, -0.11950572742752626, -0.06362891853065558, -0.08671489530890643, 0.24582088279577208, 0.3593508017734742, 0.29893915801846854, 0.4036195118137648, -0.459800810225203, -0.16157600905378938, 0.003292875246367824, 0.16804439778452818, 0.09353314761833197, -0.04471015116170337, -0.27423440852582875, 0.01592884992551006, -0.18178604561573183, -0.0734336823618538, -0.04178756363296383, -0.023098405673575233, 0.036340924373395006, -0.1673467422255092, -0.08989216488274471, 0.10541532081092747, 0.1528561974770691, -0.03502307985712525, -0.11310489576729671, 0.05166493875833727, 0.15464931874680268, 0.009306215694252874, 0.02382439930437946, 0.23816069625449224, -0.17871392986238738, -0.2127858139836872, 0.3486568901530454, 0.013160778056259568, -0.12056713003638975, 0.2490500103105122, -0.0073078182578401665, -0.2085203164794915, 0.042293890169493746, 0.22169536574986357, 0.04740329443568915, -0.1490473747909279, 0.08650576727117189, 0.1289744063897032, 0.13996341962918218, 0.05104789400512589, -0.035013137608241866, 0.27948723364831274, 0.2923305897750485, -0.02149828806073523, 0.10973427308277345, -0.041483662484712164, -0.12047449320974485, -0.26393957253755396, -0.22879908949753244, -0.15269808047188735, -0.0517466171762683, -0.03279016511867308, -0.16246834169076363, 0.36143052152974503, 0.22333384376071708, 0.12284591803196031, 0.05135224027637864, 0.31622461863124457, -0.03325512826042643, 0.11914386049004823, 0.09715066961681759, 0.2001592701228834, 0.051214618123018404, 0.18214202882118627, -0.15750886953737533, 0.10270623916523977, 0.038281179820252975]
|
1,803.07245
|
Comparison between the diffuse interface and volume of fluid methods for
simulating two-phase flows
|
A wide variety of interface capturing methods have been introduced for
simulating two-phase flows throughout the years. However, there is a noticeable
dearth of literature focusing on objective comparisons between these methods,
especially when they are coupled to the momentum equation and applied in
physically relevant regimes. In this article, we compare two techniques for
simulating two-phase flows that possess attractive qualities, but belong to the
two distinct classes of diffuse interface (DI) and volume of fluid (VOF)
methods. Both of these methods allow for mass-conserving schemes that can
naturally capture large interfacial topology changes omnipresent in realistic
two phase flows. The DI solver used in this work is based on a conservative and
bounded phase field method, developed recently. Similar to level set methods,
this diffuse interface method takes advantage of the smoothness of the phase
field in computing curvature and surface tension forces. Geometric VOF methods
track the fractional tagged volume in a cell. The specific geometric VOF scheme
used here is a discretely conservative and bounded implementation that uses
geometric algorithms for unsplit advection and interface reconstruction, while
employing height functions for normal and curvature calculation. We present a
quantitative comparison of these methods on Cartesian meshes in terms of their
accuracy, convergence rate, and computational cost using canonical
two-dimensional (2D) two-phase test cases: a very dense drop moving through a
quiescent gas, the Rayleigh-Taylor instability, an equilibrium static drop, an
oscillating drop and the damped surface wave. We further compare these methods
in their ability to resolve thin films by simulating the impact of a water drop
on a deep water pool. Using results of these studies, we suggest qualitative
guidelines for selection of schemes for two-phase flow calculations.
|
physics.flu-dyn physics.comp-ph
|
a wide variety of interface capturing methods have been introduced for simulating twophase flows throughout the years however there is a noticeable dearth of literature focusing on objective comparisons between these methods especially when they are coupled to the momentum equation and applied in physically relevant regimes in this article we compare two techniques for simulating twophase flows that possess attractive qualities but belong to the two distinct classes of diffuse interface di and volume of fluid vof methods both of these methods allow for massconserving schemes that can naturally capture large interfacial topology changes omnipresent in realistic two phase flows the di solver used in this work is based on a conservative and bounded phase field method developed recently similar to level set methods this diffuse interface method takes advantage of the smoothness of the phase field in computing curvature and surface tension forces geometric vof methods track the fractional tagged volume in a cell the specific geometric vof scheme used here is a discretely conservative and bounded implementation that uses geometric algorithms for unsplit advection and interface reconstruction while employing height functions for normal and curvature calculation we present a quantitative comparison of these methods on cartesian meshes in terms of their accuracy convergence rate and computational cost using canonical twodimensional 2d twophase test cases a very dense drop moving through a quiescent gas the rayleightaylor instability an equilibrium static drop an oscillating drop and the damped surface wave we further compare these methods in their ability to resolve thin films by simulating the impact of a water drop on a deep water pool using results of these studies we suggest qualitative guidelines for selection of schemes for twophase flow calculations
|
[['a', 'wide', 'variety', 'of', 'interface', 'capturing', 'methods', 'have', 'been', 'introduced', 'for', 'simulating', 'twophase', 'flows', 'throughout', 'the', 'years', 'however', 'there', 'is', 'a', 'noticeable', 'dearth', 'of', 'literature', 'focusing', 'on', 'objective', 'comparisons', 'between', 'these', 'methods', 'especially', 'when', 'they', 'are', 'coupled', 'to', 'the', 'momentum', 'equation', 'and', 'applied', 'in', 'physically', 'relevant', 'regimes', 'in', 'this', 'article', 'we', 'compare', 'two', 'techniques', 'for', 'simulating', 'twophase', 'flows', 'that', 'possess', 'attractive', 'qualities', 'but', 'belong', 'to', 'the', 'two', 'distinct', 'classes', 'of', 'diffuse', 'interface', 'di', 'and', 'volume', 'of', 'fluid', 'vof', 'methods', 'both', 'of', 'these', 'methods', 'allow', 'for', 'massconserving', 'schemes', 'that', 'can', 'naturally', 'capture', 'large', 'interfacial', 'topology', 'changes', 'omnipresent', 'in', 'realistic', 'two', 'phase', 'flows', 'the', 'di', 'solver', 'used', 'in', 'this', 'work', 'is', 'based', 'on', 'a', 'conservative', 'and', 'bounded', 'phase', 'field', 'method', 'developed', 'recently', 'similar', 'to', 'level', 'set', 'methods', 'this', 'diffuse', 'interface', 'method', 'takes', 'advantage', 'of', 'the', 'smoothness', 'of', 'the', 'phase', 'field', 'in', 'computing', 'curvature', 'and', 'surface', 'tension', 'forces', 'geometric', 'vof', 'methods', 'track', 'the', 'fractional', 'tagged', 'volume', 'in', 'a', 'cell', 'the', 'specific', 'geometric', 'vof', 'scheme', 'used', 'here', 'is', 'a', 'discretely', 'conservative', 'and', 'bounded', 'implementation', 'that', 'uses', 'geometric', 'algorithms', 'for', 'unsplit', 'advection', 'and', 'interface', 'reconstruction', 'while', 'employing', 'height', 'functions', 'for', 'normal', 'and', 'curvature', 'calculation', 'we', 'present', 'a', 'quantitative', 'comparison', 'of', 'these', 'methods', 'on', 'cartesian', 'meshes', 'in', 'terms', 'of', 'their', 'accuracy', 'convergence', 'rate', 'and', 'computational', 'cost', 'using', 'canonical', 'twodimensional', '2d', 'twophase', 'test', 'cases', 'a', 'very', 'dense', 'drop', 'moving', 'through', 'a', 'quiescent', 'gas', 'the', 'rayleightaylor', 'instability', 'an', 'equilibrium', 'static', 'drop', 'an', 'oscillating', 'drop', 'and', 'the', 'damped', 'surface', 'wave', 'we', 'further', 'compare', 'these', 'methods', 'in', 'their', 'ability', 'to', 'resolve', 'thin', 'films', 'by', 'simulating', 'the', 'impact', 'of', 'a', 'water', 'drop', 'on', 'a', 'deep', 'water', 'pool', 'using', 'results', 'of', 'these', 'studies', 'we', 'suggest', 'qualitative', 'guidelines', 'for', 'selection', 'of', 'schemes', 'for', 'twophase', 'flow', 'calculations']]
|
[-0.10231498099154754, 0.0635690234772007, -0.10351138587221635, 0.054791726088052606, -0.054539020934270516, -0.14138015650555016, 0.014336917977496264, 0.3925102518241221, -0.246218124546058, -0.29254992812371716, 0.09033987365659761, -0.23695634117238093, -0.1315021101013484, 0.23158648358608594, -0.061289387645673786, 0.0850271243707346, 0.05501895707821335, -0.06547568916909186, -0.09265829488209715, -0.22154599048901522, 0.31530239884930833, 0.016234226846411764, 0.31164032751661414, 0.06347085487931743, 0.1147318545226238, -0.05810286843546176, -0.04683524581962413, 0.10065381788801665, -0.1835668716149957, 0.10290795317055537, 0.2451622912054717, 0.04023073173157687, 0.26763380980184925, -0.474828038542357, -0.2644670839798258, 0.0679986647317061, 0.13220957892781532, 0.12020408682600849, -0.09133375600447662, -0.23909230558399125, 0.05762971706486631, -0.1558831044483655, -0.09454923281423475, -0.09213092421097582, -0.010015397965899822, 0.04930109055256208, -0.23508852628053925, 0.09631593199220549, 0.04027556529344313, 0.07282399750199368, -0.07110904243959001, -0.09809527318931248, -0.009402941844126624, 0.11262113860754425, 0.022040236768042898, 0.017453447436891634, 0.1393231617190337, -0.14770322679969822, -0.06542746212198514, 0.3836633277754217, -0.06441475097797547, -0.23884566829214038, 0.2640673758029319, -0.0932407714377154, -0.10223564503602552, 0.1943772269424496, 0.21652392789231145, 0.1396681279760157, -0.12841447331810366, 0.0497442787024028, -0.020466725889035146, 0.14753322854190537, 0.06249089048214441, -0.03581947688994001, 0.17557722268553694, 0.19165754478750585, 0.052935749707437474, 0.11128178902641729, -0.10892828111783617, -0.12654292201557502, -0.26851475406964653, -0.17057850645433834, -0.14578573225072647, -0.035952750168744455, -0.09892423153568393, -0.19413436556814154, 0.36873821933575, 0.13439076046082776, 0.14625505581761417, 0.021921347235181358, 0.3290545269707053, 0.07432330014845792, 0.030198364011785377, 0.09841467242839322, 0.2173796438430222, 0.12408019654870744, 0.12470648036995127, -0.218165617267101, 0.06913608401789997, 0.09120650209563409]
|
1,803.07246
|
Variance Reduction for Policy Gradient with Action-Dependent Factorized
Baselines
|
Policy gradient methods have enjoyed great success in deep reinforcement
learning but suffer from high variance of gradient estimates. The high variance
problem is particularly exasperated in problems with long horizons or
high-dimensional action spaces. To mitigate this issue, we derive a bias-free
action-dependent baseline for variance reduction which fully exploits the
structural form of the stochastic policy itself and does not make any
additional assumptions about the MDP. We demonstrate and quantify the benefit
of the action-dependent baseline through both theoretical analysis as well as
numerical results, including an analysis of the suboptimality of the optimal
state-dependent baseline. The result is a computationally efficient policy
gradient algorithm, which scales to high-dimensional control problems, as
demonstrated by a synthetic 2000-dimensional target matching task. Our
experimental results indicate that action-dependent baselines allow for faster
learning on standard reinforcement learning benchmarks and high-dimensional
hand manipulation and synthetic tasks. Finally, we show that the general idea
of including additional information in baselines for improved variance
reduction can be extended to partially observed and multi-agent tasks.
|
cs.LG cs.AI stat.ML
|
policy gradient methods have enjoyed great success in deep reinforcement learning but suffer from high variance of gradient estimates the high variance problem is particularly exasperated in problems with long horizons or highdimensional action spaces to mitigate this issue we derive a biasfree actiondependent baseline for variance reduction which fully exploits the structural form of the stochastic policy itself and does not make any additional assumptions about the mdp we demonstrate and quantify the benefit of the actiondependent baseline through both theoretical analysis as well as numerical results including an analysis of the suboptimality of the optimal statedependent baseline the result is a computationally efficient policy gradient algorithm which scales to highdimensional control problems as demonstrated by a synthetic 2000dimensional target matching task our experimental results indicate that actiondependent baselines allow for faster learning on standard reinforcement learning benchmarks and highdimensional hand manipulation and synthetic tasks finally we show that the general idea of including additional information in baselines for improved variance reduction can be extended to partially observed and multiagent tasks
|
[['policy', 'gradient', 'methods', 'have', 'enjoyed', 'great', 'success', 'in', 'deep', 'reinforcement', 'learning', 'but', 'suffer', 'from', 'high', 'variance', 'of', 'gradient', 'estimates', 'the', 'high', 'variance', 'problem', 'is', 'particularly', 'exasperated', 'in', 'problems', 'with', 'long', 'horizons', 'or', 'highdimensional', 'action', 'spaces', 'to', 'mitigate', 'this', 'issue', 'we', 'derive', 'a', 'biasfree', 'actiondependent', 'baseline', 'for', 'variance', 'reduction', 'which', 'fully', 'exploits', 'the', 'structural', 'form', 'of', 'the', 'stochastic', 'policy', 'itself', 'and', 'does', 'not', 'make', 'any', 'additional', 'assumptions', 'about', 'the', 'mdp', 'we', 'demonstrate', 'and', 'quantify', 'the', 'benefit', 'of', 'the', 'actiondependent', 'baseline', 'through', 'both', 'theoretical', 'analysis', 'as', 'well', 'as', 'numerical', 'results', 'including', 'an', 'analysis', 'of', 'the', 'suboptimality', 'of', 'the', 'optimal', 'statedependent', 'baseline', 'the', 'result', 'is', 'a', 'computationally', 'efficient', 'policy', 'gradient', 'algorithm', 'which', 'scales', 'to', 'highdimensional', 'control', 'problems', 'as', 'demonstrated', 'by', 'a', 'synthetic', '2000dimensional', 'target', 'matching', 'task', 'our', 'experimental', 'results', 'indicate', 'that', 'actiondependent', 'baselines', 'allow', 'for', 'faster', 'learning', 'on', 'standard', 'reinforcement', 'learning', 'benchmarks', 'and', 'highdimensional', 'hand', 'manipulation', 'and', 'synthetic', 'tasks', 'finally', 'we', 'show', 'that', 'the', 'general', 'idea', 'of', 'including', 'additional', 'information', 'in', 'baselines', 'for', 'improved', 'variance', 'reduction', 'can', 'be', 'extended', 'to', 'partially', 'observed', 'and', 'multiagent', 'tasks']]
|
[-0.039883712182714665, 0.0031137966901664377, -0.10245567204550518, 0.11126511623301374, -0.1330851657174484, -0.17532595445685176, 0.059946702725161415, 0.45423355960009393, -0.29572901563659004, -0.3351105522032152, 0.15701238297154768, -0.21944558743267642, -0.1679177722792898, 0.24212621607169596, -0.14055341937611893, 0.10814071092509518, 0.1356924851656461, -0.0014929930333658094, -0.08563668474320824, -0.27257983701995286, 0.24936312538631566, 0.0659627606014909, 0.3358061443796458, 0.054052425420445485, 0.17666467895720436, -0.0006799700844226874, -0.03533954191299384, 0.029152085446025523, -0.04724908225438816, 0.14138645381729353, 0.3063557229048371, 0.19004945379371443, 0.3547904764939296, -0.3992501789954496, -0.2777096081405268, 0.1185523097032997, 0.14323509576010834, 0.1436046213442623, -0.051721043457898, -0.31178650403754754, 0.05083526966396218, -0.15260176134039785, -0.042105855820537136, -0.1612845896661543, -0.05925717241912318, 0.013975517573760964, -0.34910891265254357, 0.06717153139104685, 0.07842411441328168, 0.049977981479980095, -0.045385804223386866, -0.15826328767651462, 0.06084831513203027, 0.12715563177381647, 0.08621723802177486, 0.035851122622857445, 0.12625465895272572, -0.1518441134647123, -0.1942930479904321, 0.3252054610349543, -0.09898194294505921, -0.20191671058524682, 0.18900095559765548, -0.04531524821772779, -0.15881144602739453, 0.10411672025635751, 0.2411720425446044, 0.13704290466481134, -0.13226522218534037, 0.04771123083181712, -0.03776115637642947, 0.17843529202550518, 0.005033909190685777, 0.035882459867988, 0.11013847559265662, 0.22921635282133318, 0.13110559457254034, 0.1329369956337471, -0.09050997054580141, -0.14338512346522927, -0.23390166056805362, -0.09056176558172341, -0.1686468961381773, -0.005615452601222392, -0.15729733443897617, -0.12349302033561538, 0.31545364301058065, 0.21177486158711345, 0.19127964690989374, 0.13218223949763597, 0.35581084371514465, 0.072276171371722, 0.06213572209602908, 0.1091815902880796, 0.2269619833460154, 0.052226389046181106, 0.08980621601732676, -0.23806795645477957, 0.11390191125166085, 0.0055715575275060375]
|
1,803.07247
|
Sparse Reduced Rank Regression With Nonconvex Regularization
|
In this paper, the estimation problem for sparse reduced rank regression
(SRRR) model is considered. The SRRR model is widely used for dimension
reduction and variable selection with applications in signal processing,
econometrics, etc. The problem is formulated to minimize the least squares loss
with a sparsity-inducing penalty considering an orthogonality constraint.
Convex sparsity-inducing functions have been used for SRRR in literature. In
this work, a nonconvex function is proposed for better sparsity inducing. An
efficient algorithm is developed based on the alternating minimization (or
projection) method to solve the nonconvex optimization problem. Numerical
simulations show that the proposed algorithm is much more efficient compared to
the benchmark methods and the nonconvex function can result in a better
estimation accuracy.
|
stat.ML cs.LG q-fin.CP stat.ME
|
in this paper the estimation problem for sparse reduced rank regression srrr model is considered the srrr model is widely used for dimension reduction and variable selection with applications in signal processing econometrics etc the problem is formulated to minimize the least squares loss with a sparsityinducing penalty considering an orthogonality constraint convex sparsityinducing functions have been used for srrr in literature in this work a nonconvex function is proposed for better sparsity inducing an efficient algorithm is developed based on the alternating minimization or projection method to solve the nonconvex optimization problem numerical simulations show that the proposed algorithm is much more efficient compared to the benchmark methods and the nonconvex function can result in a better estimation accuracy
|
[['in', 'this', 'paper', 'the', 'estimation', 'problem', 'for', 'sparse', 'reduced', 'rank', 'regression', 'srrr', 'model', 'is', 'considered', 'the', 'srrr', 'model', 'is', 'widely', 'used', 'for', 'dimension', 'reduction', 'and', 'variable', 'selection', 'with', 'applications', 'in', 'signal', 'processing', 'econometrics', 'etc', 'the', 'problem', 'is', 'formulated', 'to', 'minimize', 'the', 'least', 'squares', 'loss', 'with', 'a', 'sparsityinducing', 'penalty', 'considering', 'an', 'orthogonality', 'constraint', 'convex', 'sparsityinducing', 'functions', 'have', 'been', 'used', 'for', 'srrr', 'in', 'literature', 'in', 'this', 'work', 'a', 'nonconvex', 'function', 'is', 'proposed', 'for', 'better', 'sparsity', 'inducing', 'an', 'efficient', 'algorithm', 'is', 'developed', 'based', 'on', 'the', 'alternating', 'minimization', 'or', 'projection', 'method', 'to', 'solve', 'the', 'nonconvex', 'optimization', 'problem', 'numerical', 'simulations', 'show', 'that', 'the', 'proposed', 'algorithm', 'is', 'much', 'more', 'efficient', 'compared', 'to', 'the', 'benchmark', 'methods', 'and', 'the', 'nonconvex', 'function', 'can', 'result', 'in', 'a', 'better', 'estimation', 'accuracy']]
|
[-0.027129931875000086, -0.07202681332297894, -0.08526113538537175, 0.11577664573560469, -0.10995226111263037, -0.18019981360606227, -0.02135607677725299, 0.42556450590491296, -0.30887551862979307, -0.30478878899787865, 0.1428258979295303, -0.22949336174254617, -0.21772084126326566, 0.17377870212852334, -0.1470464026167368, 0.1729980517877266, 0.061927835462847726, -0.019669115217402576, -0.13726084556935045, -0.31601322908730556, 0.21758751451658706, 0.06347918088625495, 0.303676727359804, 0.034360476944129914, 0.12765522932362122, 0.04610018091043457, 0.002445429165769989, 0.024711354276708637, -0.06690955102512816, 0.14994430750084575, 0.31365523654579497, 0.18455608459189535, 0.3869052425958216, -0.3779637207374132, -0.2683357004697124, 0.16529623460567866, 0.15642472209098437, 0.05771870189346373, -0.03860814341423975, -0.20203972777817397, 0.0867380822969911, -0.15200406180641343, -0.032536063673129924, -0.07826298459937485, -0.057750295695344296, -0.03317259714046183, -0.40438761984308563, 0.09263101700053085, 0.020813176390947773, 0.027493825818722447, -0.08606451112233723, -0.19839789677644148, 0.07908091515613098, 0.013397671373483414, 0.07833590909625249, 0.09322499956081932, 0.06558068518158204, -0.08437311292703574, -0.1384582274981464, 0.37487303452022996, -0.023551692200514177, -0.32017674792247514, 0.15970919043951046, -0.0030664173827972263, -0.14046007626069087, 0.13234008421810964, 0.2596118919396152, 0.16163344682063324, -0.16730593717851056, 0.06542109648677676, -0.06342756343074143, 0.15140739864436908, 0.024697685206774622, -0.03949640376570945, 0.058388072814947616, 0.22682477920122135, 0.18994765572133473, 0.16971252211757626, -0.06505183472569721, -0.06968941462109797, -0.20051176246876518, -0.09330927774620552, -0.25263033773129184, -0.07511753389068569, -0.1068220491441025, -0.14914976505097002, 0.3669623134036859, 0.14962688880235267, 0.16857750414249797, 0.07347143745282665, 0.37489359657435367, 0.17855571729596703, 0.06775599180885668, 0.08772161984040092, 0.20241358814140162, 0.1257392340223305, 0.043981598903580256, -0.21998711624764838, 0.09966989976819604, 0.11313170437933877]
|
1,803.07248
|
Split graphs: combinatorial species and asymptotics
|
A split graph is a graph whose vertices can be partitioned into a clique and
a stable set. We investigate the combinatorial species of split graphs,
providing species-theoretic generalizations of enumerative results due to
B\'ina and P\v{r}ibil (2015), Cheng, Collins, and Trenk (2016), and Collins and
Trenk (2018). In both the labeled and unlabeled cases, we give asymptotic
results on the number of split graphs, of unbalanced split graphs, and of
bicolored graphs, including proving the conjecture of Cheng, Collins, and Trenk
(2016) that almost all split graphs are balanced.
|
math.CO
|
a split graph is a graph whose vertices can be partitioned into a clique and a stable set we investigate the combinatorial species of split graphs providing speciestheoretic generalizations of enumerative results due to bina and pvribil 2015 cheng collins and trenk 2016 and collins and trenk 2018 in both the labeled and unlabeled cases we give asymptotic results on the number of split graphs of unbalanced split graphs and of bicolored graphs including proving the conjecture of cheng collins and trenk 2016 that almost all split graphs are balanced
|
[['a', 'split', 'graph', 'is', 'a', 'graph', 'whose', 'vertices', 'can', 'be', 'partitioned', 'into', 'a', 'clique', 'and', 'a', 'stable', 'set', 'we', 'investigate', 'the', 'combinatorial', 'species', 'of', 'split', 'graphs', 'providing', 'speciestheoretic', 'generalizations', 'of', 'enumerative', 'results', 'due', 'to', 'bina', 'and', 'pvribil', '2015', 'cheng', 'collins', 'and', 'trenk', '2016', 'and', 'collins', 'and', 'trenk', '2018', 'in', 'both', 'the', 'labeled', 'and', 'unlabeled', 'cases', 'we', 'give', 'asymptotic', 'results', 'on', 'the', 'number', 'of', 'split', 'graphs', 'of', 'unbalanced', 'split', 'graphs', 'and', 'of', 'bicolored', 'graphs', 'including', 'proving', 'the', 'conjecture', 'of', 'cheng', 'collins', 'and', 'trenk', '2016', 'that', 'almost', 'all', 'split', 'graphs', 'are', 'balanced']]
|
[-0.11573783509182127, 0.10932066229831301, -0.07010537807913392, 0.07064507975049443, -0.12595857670949248, -0.11398954616252625, 0.05340267297827503, 0.3548829085245896, -0.19996778153699268, -0.3535952059489288, 0.08284479699207449, -0.27800631688206634, -0.13138280821482787, 0.14899829542264342, -0.12899494560414485, -0.004857610764630725, 0.14895235453575348, -0.02405980047298951, 0.06853301173837638, -0.37283720801194625, 0.2982644107025326, -0.03211456077340781, 0.20405855473507656, 0.14391724087214203, 0.09562198926558656, 0.07222728562159358, -0.09032396315544676, 0.10181329686999019, -0.1444931948964459, 0.11131599672096834, 0.27311273321007074, 0.1674301032698975, 0.14533074384325007, -0.3578911506717376, -0.08992182057131123, 0.1903862500500478, 0.0669989577714312, 0.0933540654277136, 0.028464741577143165, -0.29773699611509113, 0.08533530716334334, -0.12795879420813885, -0.023385161957755852, -0.07034898132839229, 0.08132574612044552, 0.04039524347008614, -0.307343250323673, 0.011225202424305209, 0.1760307312576791, 0.02563601551221663, 0.04687470568113782, -0.21074908552168126, -0.07410763265052286, 0.09671032704606526, -0.08010946863247187, 0.03576641326791115, -0.015458820362214333, -0.0856341592643117, -0.24293498103140612, 0.32948519791779896, 0.05687185990090451, -0.10996841549810567, 0.14232794533410434, -0.0875343635280648, -0.21146038110273774, 0.053293363473723446, 0.19390170940124754, 0.1499330697717208, -0.07133000331480852, 0.12161638393600503, -0.1373509458276663, 0.05181450557533986, 0.21619106058470822, -0.05599575815722346, 0.10510963258291647, 0.09378020996960361, 0.094672420667746, 0.21934621267706114, 0.004042207204548412, -0.04581965252840787, -0.24957585146420458, -0.11128074108633433, -0.1913002788342975, 0.04309727093518785, -0.14207867135194371, -0.19225080735102462, 0.468672173913945, 0.033301668643187524, 0.23897467497108357, 0.10110480814460623, 0.2008313490601068, 0.03307786966779327, 0.009396586656110005, 0.16141415472152862, 0.11328315872992023, 0.2387633616983723, 0.03287681219890044, -0.1420244832439453, 0.007878315781525681, 0.15238852422224003]
|
1,803.07249
|
Status of quarkonia - like negative and positive parity states in a
relativistic confinement scheme
|
Properties of quarkonia - like states in the charm and bottom sector have
been studied in the frame work of relativistic Dirac formalism with a linear
confinement potential. We have computed the mass spectroscopy and decay
properties (vector decay constant and leptonic decay width) of several
quarkonia - like states. Present study is also intended to identify some of the
unexplained states as mixed P-wave and mixed S-D wave states of Charmonia and
Bottomonia. The results indicate that the X(4140) state can be an admixture of
two P states of charmonium. And the charmonium like states X(4630) and X(4660)
are the admixed state of S - D waves. Similarly, the $X(10610)$ state recently
reported by Belle II can be a mixed P - states of bottomonium. In the
relativistic framework we have computed vector decay constant and the leptonic
decay width for S wave charmonium and bottomonium. The leptonic decay width for
the $J^{PC} = 1^{--}$ mixed states are also predicted. Further, both the masses
and the leptonic decay width are considered for the identification of the
quarkonia-like states.
|
hep-ph
|
properties of quarkonia like states in the charm and bottom sector have been studied in the frame work of relativistic dirac formalism with a linear confinement potential we have computed the mass spectroscopy and decay properties vector decay constant and leptonic decay width of several quarkonia like states present study is also intended to identify some of the unexplained states as mixed pwave and mixed sd wave states of charmonia and bottomonia the results indicate that the x4140 state can be an admixture of two p states of charmonium and the charmonium like states x4630 and x4660 are the admixed state of s d waves similarly the x10610 state recently reported by belle ii can be a mixed p states of bottomonium in the relativistic framework we have computed vector decay constant and the leptonic decay width for s wave charmonium and bottomonium the leptonic decay width for the jpc 1 mixed states are also predicted further both the masses and the leptonic decay width are considered for the identification of the quarkonialike states
|
[['properties', 'of', 'quarkonia', 'like', 'states', 'in', 'the', 'charm', 'and', 'bottom', 'sector', 'have', 'been', 'studied', 'in', 'the', 'frame', 'work', 'of', 'relativistic', 'dirac', 'formalism', 'with', 'a', 'linear', 'confinement', 'potential', 'we', 'have', 'computed', 'the', 'mass', 'spectroscopy', 'and', 'decay', 'properties', 'vector', 'decay', 'constant', 'and', 'leptonic', 'decay', 'width', 'of', 'several', 'quarkonia', 'like', 'states', 'present', 'study', 'is', 'also', 'intended', 'to', 'identify', 'some', 'of', 'the', 'unexplained', 'states', 'as', 'mixed', 'pwave', 'and', 'mixed', 'sd', 'wave', 'states', 'of', 'charmonia', 'and', 'bottomonia', 'the', 'results', 'indicate', 'that', 'the', 'x4140', 'state', 'can', 'be', 'an', 'admixture', 'of', 'two', 'p', 'states', 'of', 'charmonium', 'and', 'the', 'charmonium', 'like', 'states', 'x4630', 'and', 'x4660', 'are', 'the', 'admixed', 'state', 'of', 's', 'd', 'waves', 'similarly', 'the', 'x10610', 'state', 'recently', 'reported', 'by', 'belle', 'ii', 'can', 'be', 'a', 'mixed', 'p', 'states', 'of', 'bottomonium', 'in', 'the', 'relativistic', 'framework', 'we', 'have', 'computed', 'vector', 'decay', 'constant', 'and', 'the', 'leptonic', 'decay', 'width', 'for', 's', 'wave', 'charmonium', 'and', 'bottomonium', 'the', 'leptonic', 'decay', 'width', 'for', 'the', 'jpc', '1', 'mixed', 'states', 'are', 'also', 'predicted', 'further', 'both', 'the', 'masses', 'and', 'the', 'leptonic', 'decay', 'width', 'are', 'considered', 'for', 'the', 'identification', 'of', 'the', 'quarkonialike', 'states']]
|
[-0.072549361312988, 0.28719064509410297, -0.07832196830856651, 0.14669332051221712, -0.0047109912208825174, -0.17111334991183758, 0.04285034608510404, 0.3362981229051517, -0.20243322722764545, -0.21798636519883066, 0.007574296981026284, -0.3126197345662496, 0.017690241993593342, 0.09261356480957973, 0.13120510111525224, 0.15747963007797913, 0.10146902703879955, 0.035428121933616656, -0.06868580510608335, -0.1673036228833085, 0.3426021223132784, -0.030814613756653716, 0.20363490979558643, 0.14297376299879885, -0.0802766616843813, -0.027409520094428277, 0.02138342221961976, -0.05388607277475685, -0.12447461077959089, 0.05288395124677343, 0.19443959023028268, 0.11676810822325807, 0.16672246479240888, -0.364211852818383, -0.17351902613276346, 0.09795176849910461, 0.1686094732379078, 0.12468380089768483, -0.03931688957691537, -0.38438415718184127, 0.1085783345705555, -0.19130933651366847, -0.13760778406699528, -0.10157269783078483, 0.03970132119727531, -0.05604775829342964, -0.27949969074285097, 0.0997672463397797, -0.02584311390710144, -0.01370377868220124, -0.09777167968242026, -0.27154480220717675, -0.06732030959013914, 0.03294737995844442, 0.07980703051481934, 0.040088010316807504, 0.10471405034798677, -0.15671557918557025, -0.20732145922021628, 0.36807885589454903, -0.10996344819869523, -0.16635263562633124, 0.14037699905907833, -0.15518033545130508, -0.09517440285312949, 0.12911631665367504, 0.1907863874046261, 0.083039568305134, -0.10026310463947367, 0.09702849156166712, -0.05934748215573259, 0.1298071527853608, 0.07929875976486789, 0.1727528692535367, 0.17585492296671937, 0.12066946227663342, -0.0515730486700925, 0.08484228811565937, -0.123683522781088, -0.07135283586439929, -0.3592038177912032, -0.18731373049185637, -0.1251247780655936, 0.06018324816553057, 0.04673851356586587, -0.11867240920522912, 0.448024751478537, -0.014228106662092697, 0.24014164324085405, -0.011795825139226425, 0.23079499167610887, 0.10830640797086082, 0.009071708239636498, 0.10306971883831945, 0.31902957717148517, 0.2436698976314675, 0.1028992580519074, -0.3196278064971994, 0.05588971303151436, 0.004470908994156587]
|
1,803.0725
|
Cooperative and Distributed Reinforcement Learning of Drones for Field
Coverage
|
This paper proposes a distributed Multi-Agent Reinforcement Learning (MARL)
algorithm for a team of Unmanned Aerial Vehicles (UAVs). The proposed MARL
algorithm allows UAVs to learn cooperatively to provide a full coverage of an
unknown field of interest while minimizing the overlapping sections among their
field of views. Two challenges in MARL for such a system are discussed in the
paper: firstly, the complex dynamic of the joint-actions of the UAV team, that
will be solved using game-theoretic correlated equilibrium, and secondly, the
challenge in huge dimensional state space representation will be tackled with
efficient function approximation techniques. We also provide our experimental
results in detail with both simulation and physical implementation to show that
the UAV team can successfully learn to accomplish the task.
|
cs.RO
|
this paper proposes a distributed multiagent reinforcement learning marl algorithm for a team of unmanned aerial vehicles uavs the proposed marl algorithm allows uavs to learn cooperatively to provide a full coverage of an unknown field of interest while minimizing the overlapping sections among their field of views two challenges in marl for such a system are discussed in the paper firstly the complex dynamic of the jointactions of the uav team that will be solved using gametheoretic correlated equilibrium and secondly the challenge in huge dimensional state space representation will be tackled with efficient function approximation techniques we also provide our experimental results in detail with both simulation and physical implementation to show that the uav team can successfully learn to accomplish the task
|
[['this', 'paper', 'proposes', 'a', 'distributed', 'multiagent', 'reinforcement', 'learning', 'marl', 'algorithm', 'for', 'a', 'team', 'of', 'unmanned', 'aerial', 'vehicles', 'uavs', 'the', 'proposed', 'marl', 'algorithm', 'allows', 'uavs', 'to', 'learn', 'cooperatively', 'to', 'provide', 'a', 'full', 'coverage', 'of', 'an', 'unknown', 'field', 'of', 'interest', 'while', 'minimizing', 'the', 'overlapping', 'sections', 'among', 'their', 'field', 'of', 'views', 'two', 'challenges', 'in', 'marl', 'for', 'such', 'a', 'system', 'are', 'discussed', 'in', 'the', 'paper', 'firstly', 'the', 'complex', 'dynamic', 'of', 'the', 'jointactions', 'of', 'the', 'uav', 'team', 'that', 'will', 'be', 'solved', 'using', 'gametheoretic', 'correlated', 'equilibrium', 'and', 'secondly', 'the', 'challenge', 'in', 'huge', 'dimensional', 'state', 'space', 'representation', 'will', 'be', 'tackled', 'with', 'efficient', 'function', 'approximation', 'techniques', 'we', 'also', 'provide', 'our', 'experimental', 'results', 'in', 'detail', 'with', 'both', 'simulation', 'and', 'physical', 'implementation', 'to', 'show', 'that', 'the', 'uav', 'team', 'can', 'successfully', 'learn', 'to', 'accomplish', 'the', 'task']]
|
[-0.1465189419480251, 0.030627913995680676, -0.0802397244955383, 0.024988589998927987, -0.10953897072918593, -0.14625090603987057, 0.04222781685060791, 0.4465679676842786, -0.28383033010627956, -0.3688798346106083, 0.06332150751709818, -0.20996614861231197, -0.21360196194220935, 0.1547714095795527, -0.15427868127176958, 0.09797615522608882, 0.0912060976599253, 0.03140080970901651, -0.0011227137123745296, -0.27095141055272715, 0.2910164188595504, 0.050880101009932975, 0.2733329808369519, 0.012095243636248332, 0.1424669892707419, 0.014604756212417757, 0.007502357757109548, 0.04616378308926341, -0.10628862958835653, 0.17641092471462944, 0.40131614701784846, 0.205817062464062, 0.3429498178208427, -0.4421810259621951, -0.20588562163268967, 0.11455927370491648, 0.17546928242494864, 0.0821771664646334, -0.04443816160933385, -0.3472900277439265, 0.08164445986039937, -0.21817045920949069, -0.09535661012294792, -0.0976263354682634, -0.04128350330058545, 0.05641615665057719, -0.3129619802949169, -0.07164073855481899, -0.003217361429931536, 0.04243459846569045, -0.11171604785364077, -0.08285242432799761, 0.0598633392590038, 0.18971956143720872, 0.04724409231435387, 0.0443688131391912, 0.11968321232275377, -0.13527365830885818, -0.1567340080547447, 0.39469302933843387, 0.014558380403961506, -0.20876027408972261, 0.1613005541280032, -0.04148281024461011, -0.15463872547561844, 0.12041703934617896, 0.2602076399996276, 0.1338654834882266, -0.20176940285150083, 0.043775356259204506, -0.04761040673380898, 0.13135839022335508, -0.006571863045645577, -0.013846382596379807, 0.1693320435306598, 0.24359892498731853, 0.16403129526166124, 0.11179735691046282, -0.08168714202662569, -0.1559308805548015, -0.19903095163810516, -0.13609966815208957, -0.19869801445653842, -0.04448011156261688, -0.04235992751496416, -0.087487748946343, 0.3738553726833479, 0.21284653586025665, 0.1524233459832988, 0.09668881293093305, 0.3785045784447462, 0.0592787786989638, 0.016939466813534136, 0.088374811201638, 0.22246607881501287, 0.027083484484108106, 0.14946671892445715, -0.2118007167075355, 0.05875830188198315, 0.00991049510118882]
|
1,803.07251
|
Gradient estimates and Liouville type theorems for Poisson equations
|
In this paper, we will address to the following parabolic equation $$
u_t=\Delta_fu + F(u) $$ on a smooth metric measure space with Bakry-\'{E}mery
curvature bounded from below. Here $F$ is a differentiable function defined in
$\mathbb{R}$. Our motivation is originally inspired by gradient estimates of
Allen-Cahn and Fisher equations (\cite{Bai17, CLPW17}). In this paper, we show
new gradient estimates for these equations. As their applications, we obtain
Liouville type theorems for positive or bounded solutions to the above equation
when either $F=cu(1-u)$ (the Fisher equation) or; $F=-u^3+u$ (the Allen-Cahn
equation); or $F=au\log u$ (the equation involving gradient Ricci solitons).
|
math.DG
|
in this paper we will address to the following parabolic equation u_tdelta_fu fu on a smooth metric measure space with bakryemery curvature bounded from below here f is a differentiable function defined in mathbbr our motivation is originally inspired by gradient estimates of allencahn and fisher equations citebai17 clpw17 in this paper we show new gradient estimates for these equations as their applications we obtain liouville type theorems for positive or bounded solutions to the above equation when either fcu1u the fisher equation or fu3u the allencahn equation or faulog u the equation involving gradient ricci solitons
|
[['in', 'this', 'paper', 'we', 'will', 'address', 'to', 'the', 'following', 'parabolic', 'equation', 'u_tdelta_fu', 'fu', 'on', 'a', 'smooth', 'metric', 'measure', 'space', 'with', 'bakryemery', 'curvature', 'bounded', 'from', 'below', 'here', 'f', 'is', 'a', 'differentiable', 'function', 'defined', 'in', 'mathbbr', 'our', 'motivation', 'is', 'originally', 'inspired', 'by', 'gradient', 'estimates', 'of', 'allencahn', 'and', 'fisher', 'equations', 'citebai17', 'clpw17', 'in', 'this', 'paper', 'we', 'show', 'new', 'gradient', 'estimates', 'for', 'these', 'equations', 'as', 'their', 'applications', 'we', 'obtain', 'liouville', 'type', 'theorems', 'for', 'positive', 'or', 'bounded', 'solutions', 'to', 'the', 'above', 'equation', 'when', 'either', 'fcu1u', 'the', 'fisher', 'equation', 'or', 'fu3u', 'the', 'allencahn', 'equation', 'or', 'faulog', 'u', 'the', 'equation', 'involving', 'gradient', 'ricci', 'solitons']]
|
[-0.11648038920056034, 0.058162691683129784, -0.06881700245315557, 0.07285183793506943, -0.135987236287322, -0.1537272725049611, -0.024435184832027817, 0.29512451536400797, -0.3448539741009801, -0.21945699468091295, 0.14620813591902113, -0.3359194436317801, -0.1824168986973486, 0.18309048200435526, -0.12553210806736087, 0.08713625172910454, 0.017906807444907805, 0.04808647372340272, -0.12556163302448753, -0.23140448886532705, 0.4401223594425144, -0.09935606014147237, 0.17295714424268066, 0.08042805330254711, 0.15399763183565912, -0.07592535499421942, 0.009291096469566513, 0.0006007315986917692, -0.25661744735111575, 0.09960142145148264, 0.1984167766109989, 0.07124576954795354, 0.3340005938086536, -0.38532162093362965, -0.28753561005610356, 0.18126801292892997, 0.15965506548553213, 0.06085566033169136, -0.05523439898740265, -0.3422247583026087, 0.08221255463885736, -0.07158701157627198, -0.1973435005760281, -0.056660399659649356, 0.0030053544093619337, 0.104779850921829, -0.263993463202656, 0.15423247693515904, 0.11155523480156662, -0.009379961753038915, -0.17180398196636976, -0.10620002859978231, -0.026733471502826272, -0.008163828759359523, 0.03086295725706105, 0.10693145486408497, 0.057003350964245886, -0.12267856276338245, -0.05442654628020067, 0.29579794276915083, -0.1980936213109929, -0.32397484521453196, 0.0961882489295881, -0.10285422397818375, -0.09376307967845555, 0.027805743923226555, 0.17628580128907093, 0.20111578872304534, -0.15470468025775447, 0.16803234444539686, -0.004588824845236409, 0.11786162400884288, 0.10043172400117248, -0.05118237591891007, 0.05667440416444871, 0.1093440978547333, 0.17755719707193937, 0.10439898385308109, 0.02185741852672136, -0.10436131363314996, -0.3703471804549406, -0.1681853451735371, -0.193988866305777, 0.15588230799351419, -0.09941577629405611, -0.20352676095297703, 0.3326686671423306, 0.09210720822051331, 0.16022153628560212, 0.12255828372448437, 0.25875702107345666, 0.2028706097248737, -0.03106987409953765, 0.11511497561670174, 0.18172302236780524, 0.19861055405523914, 0.1629294051128634, -0.15815963299822186, -0.0015214974173232093, 0.1908386534877546]
|
1,803.07252
|
3D Point Cloud Denoising using Graph Laplacian Regularization of a Low
Dimensional Manifold Model
|
3D point cloud - a new signal representation of volumetric objects - is a
discrete collection of triples marking exterior object surface locations in 3D
space. Conventional imperfect acquisition processes of 3D point cloud - e.g.,
stereo-matching from multiple viewpoint images or depth data acquired directly
from active light sensors - imply non-negligible noise in the data. In this
paper, we adopt a previously proposed low-dimensional manifold model for the
surface patches in the point cloud and seek self-similar patches to denoise
them simultaneously using the patch manifold prior. Due to discrete
observations of the patches on the manifold, we approximate the manifold
dimension computation defined in the continuous domain with a patch-based graph
Laplacian regularizer and propose a new discrete patch distance measure to
quantify the similarity between two same-sized surface patches for graph
construction that is robust to noise. We show that our graph Laplacian
regularizer has a natural graph spectral interpretation, and has desirable
numerical stability properties via eigenanalysis. Extensive simulation results
show that our proposed denoising scheme can outperform state-of-the-art methods
in objective metrics and can better preserve visually salient structural
features like edges.
|
cs.CV
|
3d point cloud a new signal representation of volumetric objects is a discrete collection of triples marking exterior object surface locations in 3d space conventional imperfect acquisition processes of 3d point cloud eg stereomatching from multiple viewpoint images or depth data acquired directly from active light sensors imply nonnegligible noise in the data in this paper we adopt a previously proposed lowdimensional manifold model for the surface patches in the point cloud and seek selfsimilar patches to denoise them simultaneously using the patch manifold prior due to discrete observations of the patches on the manifold we approximate the manifold dimension computation defined in the continuous domain with a patchbased graph laplacian regularizer and propose a new discrete patch distance measure to quantify the similarity between two samesized surface patches for graph construction that is robust to noise we show that our graph laplacian regularizer has a natural graph spectral interpretation and has desirable numerical stability properties via eigenanalysis extensive simulation results show that our proposed denoising scheme can outperform stateoftheart methods in objective metrics and can better preserve visually salient structural features like edges
|
[['3d', 'point', 'cloud', 'a', 'new', 'signal', 'representation', 'of', 'volumetric', 'objects', 'is', 'a', 'discrete', 'collection', 'of', 'triples', 'marking', 'exterior', 'object', 'surface', 'locations', 'in', '3d', 'space', 'conventional', 'imperfect', 'acquisition', 'processes', 'of', '3d', 'point', 'cloud', 'eg', 'stereomatching', 'from', 'multiple', 'viewpoint', 'images', 'or', 'depth', 'data', 'acquired', 'directly', 'from', 'active', 'light', 'sensors', 'imply', 'nonnegligible', 'noise', 'in', 'the', 'data', 'in', 'this', 'paper', 'we', 'adopt', 'a', 'previously', 'proposed', 'lowdimensional', 'manifold', 'model', 'for', 'the', 'surface', 'patches', 'in', 'the', 'point', 'cloud', 'and', 'seek', 'selfsimilar', 'patches', 'to', 'denoise', 'them', 'simultaneously', 'using', 'the', 'patch', 'manifold', 'prior', 'due', 'to', 'discrete', 'observations', 'of', 'the', 'patches', 'on', 'the', 'manifold', 'we', 'approximate', 'the', 'manifold', 'dimension', 'computation', 'defined', 'in', 'the', 'continuous', 'domain', 'with', 'a', 'patchbased', 'graph', 'laplacian', 'regularizer', 'and', 'propose', 'a', 'new', 'discrete', 'patch', 'distance', 'measure', 'to', 'quantify', 'the', 'similarity', 'between', 'two', 'samesized', 'surface', 'patches', 'for', 'graph', 'construction', 'that', 'is', 'robust', 'to', 'noise', 'we', 'show', 'that', 'our', 'graph', 'laplacian', 'regularizer', 'has', 'a', 'natural', 'graph', 'spectral', 'interpretation', 'and', 'has', 'desirable', 'numerical', 'stability', 'properties', 'via', 'eigenanalysis', 'extensive', 'simulation', 'results', 'show', 'that', 'our', 'proposed', 'denoising', 'scheme', 'can', 'outperform', 'stateoftheart', 'methods', 'in', 'objective', 'metrics', 'and', 'can', 'better', 'preserve', 'visually', 'salient', 'structural', 'features', 'like', 'edges']]
|
[-0.06468064016077281, -0.026648230466462388, -0.11868932707454052, 0.05915263975598936, -0.11940507082614661, -0.12096549090140504, 0.02861915885081484, 0.44905261039896743, -0.29986349763501374, -0.32283601432254977, 0.08977354902779185, -0.27897691985979023, -0.21171578117760784, 0.12088037852981622, -0.15064321238725048, 0.08506517757564946, 0.12470148920585386, 0.020364094147066806, -0.07630183368046893, -0.19970647895090343, 0.35443509978628995, 0.03145479126400798, 0.3245757578979017, -0.01899515646713394, 0.12408047183251385, -0.0502372983616619, -0.05657429505862255, 0.03452379212703917, -0.08138757016533786, 0.14464645568011686, 0.2557255128548669, 0.15308458677014652, 0.23003639057889336, -0.44617097106217685, -0.29177547843546014, 0.12544147412374088, 0.1289163995651074, 0.07543833192967163, -0.05108544133185941, -0.34783075228740606, 0.10919128060646233, -0.08505479854282216, -0.04752529673201994, -0.10414695583507826, -0.0042351834505256975, -0.02398757534508741, -0.2986742874067989, 0.06059000627366734, 0.06044503899744096, 0.04546287799727355, -0.06894005169644138, -0.09626862119191168, -0.028772112697138974, 0.13557741276555965, -0.025010457834931183, 0.06275023756894828, 0.15358942059820385, -0.12238416770890437, -0.1141310213744396, 0.34418914187954014, -0.05389217814288097, -0.24604392946377152, 0.2114610799379606, -0.09235486258177565, -0.10822031898118678, 0.1598707456472508, 0.20731869089809027, 0.1139813412230238, -0.12650331261420183, 0.06336543788812811, -0.051125783264596276, 0.16656096445703802, 0.04675916498247025, 0.025039964866992392, 0.18273227727498675, 0.16289192503776218, 0.1152923046992939, 0.14749104549212616, -0.17801498140089464, -0.06382299663214003, -0.23775526819670512, -0.12921147856271642, -0.250128165337822, -0.009837644303197174, -0.161282313571253, -0.1783776415214248, 0.39767815242845506, 0.16596486075918693, 0.24441030272346276, 0.04835637053983703, 0.33788145513622386, 0.02551765142573563, 0.06739963252094823, 0.09070043889754782, 0.14736251258079786, 0.06808764239406732, 0.07111536450378719, -0.14865753488281813, 0.014597866964104072, 0.10826393385427938]
|
1,803.07253
|
Transferring Rich Deep Features for Facial Beauty Prediction
|
Feature extraction plays a significant part in computer vision tasks. In this
paper, we propose a method which transfers rich deep features from a pretrained
model on face verification task and feeds the features into Bayesian ridge
regression algorithm for facial beauty prediction. We leverage the deep neural
networks that extracts more abstract features from stacked layers. Through
simple but effective feature fusion strategy, our method achieves improved or
comparable performance on SCUT-FBP dataset and ECCV HotOrNot dataset. Our
experiments demonstrate the effectiveness of the proposed method and clarify
the inner interpretability of facial beauty perception.
|
cs.CV
|
feature extraction plays a significant part in computer vision tasks in this paper we propose a method which transfers rich deep features from a pretrained model on face verification task and feeds the features into bayesian ridge regression algorithm for facial beauty prediction we leverage the deep neural networks that extracts more abstract features from stacked layers through simple but effective feature fusion strategy our method achieves improved or comparable performance on scutfbp dataset and eccv hotornot dataset our experiments demonstrate the effectiveness of the proposed method and clarify the inner interpretability of facial beauty perception
|
[['feature', 'extraction', 'plays', 'a', 'significant', 'part', 'in', 'computer', 'vision', 'tasks', 'in', 'this', 'paper', 'we', 'propose', 'a', 'method', 'which', 'transfers', 'rich', 'deep', 'features', 'from', 'a', 'pretrained', 'model', 'on', 'face', 'verification', 'task', 'and', 'feeds', 'the', 'features', 'into', 'bayesian', 'ridge', 'regression', 'algorithm', 'for', 'facial', 'beauty', 'prediction', 'we', 'leverage', 'the', 'deep', 'neural', 'networks', 'that', 'extracts', 'more', 'abstract', 'features', 'from', 'stacked', 'layers', 'through', 'simple', 'but', 'effective', 'feature', 'fusion', 'strategy', 'our', 'method', 'achieves', 'improved', 'or', 'comparable', 'performance', 'on', 'scutfbp', 'dataset', 'and', 'eccv', 'hotornot', 'dataset', 'our', 'experiments', 'demonstrate', 'the', 'effectiveness', 'of', 'the', 'proposed', 'method', 'and', 'clarify', 'the', 'inner', 'interpretability', 'of', 'facial', 'beauty', 'perception']]
|
[0.022263910267256985, -0.10161744188517333, -0.11960011935106625, 0.05040826981115204, -0.11864938956538314, -0.18181332099790637, 0.013461427412633049, 0.46675668692118244, -0.28455399701273754, -0.31736415146212826, 0.02842910390984463, -0.29680293466111546, -0.26131661439461534, 0.19189436150910824, -0.1360716707171186, 0.07629810672645507, 0.21810728945328217, 0.04016737927388596, -0.02663920916996798, -0.2530217077485041, 0.283403644811264, 0.05360357015773556, 0.38982216774142886, 0.0714706422172879, 0.18143821944923777, -0.02685000042455565, -0.05587473941084586, -0.054117134267366244, -0.009086110004557812, 0.23914850125285356, 0.3278564787910957, 0.19167562349650422, 0.330056207725092, -0.3795976400277332, -0.21397262381291704, 0.02403859047059852, 0.1592483523742933, 0.09888520178899757, -0.07043224193085304, -0.37520953592305123, 0.07354200224048997, -0.1835633968052111, 0.06823159724866089, -0.19718406216952167, -0.039833487883994455, -0.1068454340982594, -0.28949178555294086, 0.06933933983305714, 0.1184810295993597, 0.1082289316225797, -0.047571371559445796, -0.16794971588410829, 0.01263371141333329, 0.15698698541688683, 0.0018784769259295182, 0.04841525700237406, 0.19418004021342647, -0.2537819625001009, -0.14215837669999976, 0.33411112933076526, -0.07550067335955407, -0.187068820499668, 0.18830732269898842, 0.003062428602654683, -0.16618194938882402, 0.09112873305811693, 0.2995070949564443, 0.1159199286644396, -0.12521356754495125, -0.020885944941791853, -0.0992353548050711, 0.21942506224946365, 0.02140509644768348, -0.0297313033112962, 0.20415268991583665, 0.32267189484677816, -0.02341754613444209, 0.1637244048871492, -0.19105133371133554, -0.05327525695687846, -0.1969907128497174, -0.07906423669896628, -0.16684656466577985, -0.09606932225195985, -0.12991523876446176, -0.10867730380575123, 0.4450117376976107, 0.2630633901216482, 0.24090417195111513, 0.11819340679917092, 0.37955608603201413, -0.03361629635634783, 0.1578194446371574, 0.10518747323474503, 0.19668289565138128, -0.011230440516220895, 0.1483363193318885, -0.191583868689639, 0.08960365759833765, 0.11016185424339614]
|
1,803.07254
|
Delooping of the $K$-theory of strictly derivable Waldhausen categories
|
In this short note, for a morphism of Waldhausen categories $f\colon
\mathbb{A} = (\mathcal{A} ,w_{\mathbb{A}}) \to \mathbb{B} =
(\mathcal{B},w_{\mathbb{B}})$, we will define $\operatorname{Cone} f$ to be a
Waldhausen category. There exists the canonical morphism of Waldhausen
categories $\kappa_f\colon \mathbb{B}\to \operatorname{Cone} f$. We will show
that the sequence
$\mathbb{A}\overset{f}{\to}\mathbb{B}\overset{\kappa_f}{\to}\operatorname{Cone}f$
induces fibration sequence of spaces
$K(\mathbb{A})\overset{K(f)}{\to}K(\mathbb{B})\overset{K(\kappa_f)}{\to}
K(\operatorname{Cone} f)$ on connective $K$-theory. Moreover we will define a
notion of strictly derivable Waldhausen categories and define non-connective
$K$-theory for strictly derivable Waldhausen categories.
|
math.KT math.CT
|
in this short note for a morphism of waldhausen categories fcolon mathbba mathcala w_mathbba to mathbbb mathcalbw_mathbbb we will define operatornamecone f to be a waldhausen category there exists the canonical morphism of waldhausen categories kappa_fcolon mathbbbto operatornamecone f we will show that the sequence mathbbaoversetftomathbbboversetkappa_ftooperatornameconef induces fibration sequence of spaces kmathbbaoversetkftokmathbbboversetkkappa_fto koperatornamecone f on connective ktheory moreover we will define a notion of strictly derivable waldhausen categories and define nonconnective ktheory for strictly derivable waldhausen categories
|
[['in', 'this', 'short', 'note', 'for', 'a', 'morphism', 'of', 'waldhausen', 'categories', 'fcolon', 'mathbba', 'mathcala', 'w_mathbba', 'to', 'mathbbb', 'mathcalbw_mathbbb', 'we', 'will', 'define', 'operatornamecone', 'f', 'to', 'be', 'a', 'waldhausen', 'category', 'there', 'exists', 'the', 'canonical', 'morphism', 'of', 'waldhausen', 'categories', 'kappa_fcolon', 'mathbbbto', 'operatornamecone', 'f', 'we', 'will', 'show', 'that', 'the', 'sequence', 'mathbbaoversetftomathbbboversetkappa_ftooperatornameconef', 'induces', 'fibration', 'sequence', 'of', 'spaces', 'kmathbbaoversetkftokmathbbboversetkkappa_fto', 'koperatornamecone', 'f', 'on', 'connective', 'ktheory', 'moreover', 'we', 'will', 'define', 'a', 'notion', 'of', 'strictly', 'derivable', 'waldhausen', 'categories', 'and', 'define', 'nonconnective', 'ktheory', 'for', 'strictly', 'derivable', 'waldhausen', 'categories']]
|
[-0.2651299128637594, 0.02188410163473557, -0.10847974215250682, 0.16510596547296325, -0.09162286614232204, -0.2031288496013183, -0.032672503973384774, 0.435694135068094, -0.5025393656071495, -0.09797387490706409, -0.0012547062822918901, -0.20984245856080258, -0.12913981562151627, 0.157019600381746, -0.33336729853523567, -0.15848620453342685, 0.11060488377423848, 0.13980825900045388, -0.09236243543530102, -0.20689775855691336, 0.5304666850715876, -0.10626071692540255, 0.20521840720903128, 0.05422289324376513, 0.11373733675709981, -0.01452550756306771, 0.02250052959938972, -0.005187039277242387, -0.22611357230123438, 0.13179416387506268, 0.4198264989125378, 0.13800054649575888, 0.22368432366569965, -0.28485795713084583, -0.03494366259752389, 0.3029335532611346, 0.06543250273748794, -0.06131201852386927, 0.00267876942662577, -0.3303539271137732, 0.14535419599419316, -0.2520938689704053, -0.021514536196585086, -0.12207841322592952, 0.16447188488810377, -0.005705195869428708, -0.2802252566222759, -0.13178598942399464, 0.1767276759697672, 0.15547352518393276, -0.110622529323925, -0.007830183117595665, -0.11428544120109804, 0.07774991418152828, -0.10419419566717218, 0.15913975746918688, 0.1790804797441096, -0.02605052652892054, -0.09684400435756235, 0.3152594397063641, -0.10874383790445898, -0.2233047894859577, 0.10207587721593239, -0.14496082544107647, -0.2289383513305117, 0.10770250640480834, -0.09435959937571384, 0.15135049518636046, 0.03823864376446342, 0.2499500203951303, -0.17782359207322931, 0.135736406500013, 0.13973401114344597, 0.034159726333147025, 0.14444890177658046, 0.06719403882401392, 0.07268065541489598, 0.1555168687362525, 0.08419676536269595, 0.04083733143959441, -0.3641306039165048, -0.19586872391621857, -0.01048338133841753, 0.26746225734035867, -0.027742109418742236, -0.22251480956123593, 0.35590195135377783, 0.09661920818239998, 0.11497269133927629, 0.2749106300796163, 0.2097080237838193, -0.00682056144646862, 0.016261263113633236, -0.06462765170042128, 0.05911444654167794, 0.2409574750071282, -0.005621901898206595, 0.028523342683911324, -0.04756042195538826, 0.3553171717452214]
|
1,803.07255
|
Bosonic Haldane insulator in the presence of local disorder: A quantum
Monte Carlo study
|
The Haldane phase (HP) is a paradigmatic example of symmetry protected
topological phase. We explore how the bosonic HP behaves in the presence of
local disorder, employing quantum Monte Carlo simulations of an extended
Bose-Hubbard model subject to uncorrelated, quenched disorders. We find that
the HP is robust against a weak disorder and the non-local string order of HP
exhibits a reentrant behavior. Besides, a direct transition between the HP and
superfluid phase is uncovered. A significant part of the ground-state phase
diagram is established for the model, unveiling the location of HP surrounded
by Bose glass, charge density wave and superfluid phases. We also mention a
possible experimental scheme with optical lattice emulator to realize the
present findings.
|
cond-mat.str-el
|
the haldane phase hp is a paradigmatic example of symmetry protected topological phase we explore how the bosonic hp behaves in the presence of local disorder employing quantum monte carlo simulations of an extended bosehubbard model subject to uncorrelated quenched disorders we find that the hp is robust against a weak disorder and the nonlocal string order of hp exhibits a reentrant behavior besides a direct transition between the hp and superfluid phase is uncovered a significant part of the groundstate phase diagram is established for the model unveiling the location of hp surrounded by bose glass charge density wave and superfluid phases we also mention a possible experimental scheme with optical lattice emulator to realize the present findings
|
[['the', 'haldane', 'phase', 'hp', 'is', 'a', 'paradigmatic', 'example', 'of', 'symmetry', 'protected', 'topological', 'phase', 'we', 'explore', 'how', 'the', 'bosonic', 'hp', 'behaves', 'in', 'the', 'presence', 'of', 'local', 'disorder', 'employing', 'quantum', 'monte', 'carlo', 'simulations', 'of', 'an', 'extended', 'bosehubbard', 'model', 'subject', 'to', 'uncorrelated', 'quenched', 'disorders', 'we', 'find', 'that', 'the', 'hp', 'is', 'robust', 'against', 'a', 'weak', 'disorder', 'and', 'the', 'nonlocal', 'string', 'order', 'of', 'hp', 'exhibits', 'a', 'reentrant', 'behavior', 'besides', 'a', 'direct', 'transition', 'between', 'the', 'hp', 'and', 'superfluid', 'phase', 'is', 'uncovered', 'a', 'significant', 'part', 'of', 'the', 'groundstate', 'phase', 'diagram', 'is', 'established', 'for', 'the', 'model', 'unveiling', 'the', 'location', 'of', 'hp', 'surrounded', 'by', 'bose', 'glass', 'charge', 'density', 'wave', 'and', 'superfluid', 'phases', 'we', 'also', 'mention', 'a', 'possible', 'experimental', 'scheme', 'with', 'optical', 'lattice', 'emulator', 'to', 'realize', 'the', 'present', 'findings']]
|
[-0.19335348786347928, 0.2381398052402954, -0.09710994790143826, 0.07572670768116828, -0.011544592600284504, -0.17775851639159837, 0.10527055782946844, 0.35785856210634487, -0.21001672105347158, -0.2153854095181372, 0.037866268192511834, -0.29484127267819493, -0.17336117038738078, 0.10863788153177925, 0.049137968961305976, 0.04385331604520187, -0.04097441489174336, -0.019972202696782702, -0.1243329183692543, -0.1877579727296193, 0.27731078924237507, 0.005417268178347467, 0.2889515061925377, 0.06569536126163952, 0.033367416359672025, -0.020676002573581927, 0.06585942900997876, 0.012379825647388185, -0.19213205036452136, 0.011082600971425594, 0.19483882200145045, -0.035236037023240276, 0.17836283299555422, -0.4181271333075246, -0.26766271625465454, 0.1164136886021451, 0.12508263566507763, 0.13844010006135501, -0.09792942532823429, -0.3500525797991192, 0.012292617035857519, -0.20267152515466974, -0.18496996525502882, -0.1050174051285291, -0.010556151204108567, -0.016588384423995812, -0.24924793403728732, 0.12845678361961343, 0.05106159334830126, 0.08016005732283435, -0.05611385649242321, -0.03763653152473584, -0.05191385981572025, 0.08120543490253984, -0.0017641327743019377, 0.0871261156109326, 0.09754993877385375, -0.1400418344047703, -0.1178341306875139, 0.4076005725327981, -0.07344790938322064, -0.10397304398665096, 0.20311499661726862, -0.11853414221616372, -0.09185452941617295, 0.1438225322058659, 0.06336325776818044, 0.0425278712690127, -0.07824496950703759, 0.0893220095567507, -0.02789051594110421, 0.212317405401596, -0.0639629012830712, 0.049791465502647105, 0.21751814139146014, 0.2290430699686418, 0.023262836737558246, 0.25420102655511945, -0.11910267763364152, -0.18816101600018822, -0.2984532755603935, -0.1753698259175309, -0.2403236160313069, -0.0029179132305048486, -0.07134563210770045, -0.2044040924877304, 0.38924673334176296, 0.18330540343582974, 0.1480694250164538, -0.04065738915770996, 0.24103424094711282, 0.09413770135460782, 0.020424843304047063, 0.016801724046030465, 0.237946244948661, 0.16133449416991105, 0.08207898897690181, -0.2808282451328485, 0.02762367113359114, 0.11052701210000497]
|
1,803.07256
|
Burst Synchronization in A Scale-Free Neuronal Network with Inhibitory
Spike-Timing-Dependent Plasticity
|
We are concerned about burst synchronization (BS), related to neural
information processes in health and disease, in the Barab\'{a}si-Albert
scale-free network (SFN) composed of inhibitory bursting Hindmarsh-Rose
neurons. This inhibitory neuronal population has adaptive dynamic synaptic
strengths governed by the inhibitory spike-timing-dependent plasticity (iSTDP).
In previous works without considering iSTDP, BS was found to appear in a range
of noise intensities for fixed synaptic inhibition strengths. In contrast, in
our present work, we take into consideration iSTDP and investigate its effect
on BS by varying the noise intensity. Our new main result is to find occurrence
of a Matthew effect in inhibitory synaptic plasticity: good BS gets better via
LTD, while bad BS get worse via LTP. This kind of Matthew effect in inhibitory
synaptic plasticity is in contrast to that in excitatory synaptic plasticity
where good (bad) synchronization gets better (worse) via LTP (LTD). We note
that, due to inhibition, the roles of LTD and LTP in inhibitory synaptic
plasticity are reversed in comparison with those in excitatory synaptic
plasticity. Moreover, emergences of LTD and LTP of synaptic inhibition
strengths are intensively investigated via a microscopic method based on the
distributions of time delays between the pre- and the post-synaptic burst onset
times. Finally, in the presence of iSTDP we investigate the effects of network
architecture on BS by varying the symmetric attachment degree $l^*$ and the
asymmetry parameter $\Delta l$ in the SFN.
|
q-bio.NC physics.bio-ph
|
we are concerned about burst synchronization bs related to neural information processes in health and disease in the barabasialbert scalefree network sfn composed of inhibitory bursting hindmarshrose neurons this inhibitory neuronal population has adaptive dynamic synaptic strengths governed by the inhibitory spiketimingdependent plasticity istdp in previous works without considering istdp bs was found to appear in a range of noise intensities for fixed synaptic inhibition strengths in contrast in our present work we take into consideration istdp and investigate its effect on bs by varying the noise intensity our new main result is to find occurrence of a matthew effect in inhibitory synaptic plasticity good bs gets better via ltd while bad bs get worse via ltp this kind of matthew effect in inhibitory synaptic plasticity is in contrast to that in excitatory synaptic plasticity where good bad synchronization gets better worse via ltp ltd we note that due to inhibition the roles of ltd and ltp in inhibitory synaptic plasticity are reversed in comparison with those in excitatory synaptic plasticity moreover emergences of ltd and ltp of synaptic inhibition strengths are intensively investigated via a microscopic method based on the distributions of time delays between the pre and the postsynaptic burst onset times finally in the presence of istdp we investigate the effects of network architecture on bs by varying the symmetric attachment degree l and the asymmetry parameter delta l in the sfn
|
[['we', 'are', 'concerned', 'about', 'burst', 'synchronization', 'bs', 'related', 'to', 'neural', 'information', 'processes', 'in', 'health', 'and', 'disease', 'in', 'the', 'barabasialbert', 'scalefree', 'network', 'sfn', 'composed', 'of', 'inhibitory', 'bursting', 'hindmarshrose', 'neurons', 'this', 'inhibitory', 'neuronal', 'population', 'has', 'adaptive', 'dynamic', 'synaptic', 'strengths', 'governed', 'by', 'the', 'inhibitory', 'spiketimingdependent', 'plasticity', 'istdp', 'in', 'previous', 'works', 'without', 'considering', 'istdp', 'bs', 'was', 'found', 'to', 'appear', 'in', 'a', 'range', 'of', 'noise', 'intensities', 'for', 'fixed', 'synaptic', 'inhibition', 'strengths', 'in', 'contrast', 'in', 'our', 'present', 'work', 'we', 'take', 'into', 'consideration', 'istdp', 'and', 'investigate', 'its', 'effect', 'on', 'bs', 'by', 'varying', 'the', 'noise', 'intensity', 'our', 'new', 'main', 'result', 'is', 'to', 'find', 'occurrence', 'of', 'a', 'matthew', 'effect', 'in', 'inhibitory', 'synaptic', 'plasticity', 'good', 'bs', 'gets', 'better', 'via', 'ltd', 'while', 'bad', 'bs', 'get', 'worse', 'via', 'ltp', 'this', 'kind', 'of', 'matthew', 'effect', 'in', 'inhibitory', 'synaptic', 'plasticity', 'is', 'in', 'contrast', 'to', 'that', 'in', 'excitatory', 'synaptic', 'plasticity', 'where', 'good', 'bad', 'synchronization', 'gets', 'better', 'worse', 'via', 'ltp', 'ltd', 'we', 'note', 'that', 'due', 'to', 'inhibition', 'the', 'roles', 'of', 'ltd', 'and', 'ltp', 'in', 'inhibitory', 'synaptic', 'plasticity', 'are', 'reversed', 'in', 'comparison', 'with', 'those', 'in', 'excitatory', 'synaptic', 'plasticity', 'moreover', 'emergences', 'of', 'ltd', 'and', 'ltp', 'of', 'synaptic', 'inhibition', 'strengths', 'are', 'intensively', 'investigated', 'via', 'a', 'microscopic', 'method', 'based', 'on', 'the', 'distributions', 'of', 'time', 'delays', 'between', 'the', 'pre', 'and', 'the', 'postsynaptic', 'burst', 'onset', 'times', 'finally', 'in', 'the', 'presence', 'of', 'istdp', 'we', 'investigate', 'the', 'effects', 'of', 'network', 'architecture', 'on', 'bs', 'by', 'varying', 'the', 'symmetric', 'attachment', 'degree', 'l', 'and', 'the', 'asymmetry', 'parameter', 'delta', 'l', 'in', 'the', 'sfn']]
|
[-0.15846230482008863, 0.1377282913932775, 0.03415114257999874, 0.07111594743154784, -0.056676122182088486, -0.2266900248508504, 0.12680750233715676, 0.4287860062488533, -0.2109351873239304, -0.24845857263562526, 0.004649750567833953, -0.19982400915196583, -0.34149766898060097, 0.09773738425859112, -0.10107582531314581, -0.04757838398342001, 0.040545118211748755, 0.041963085551013024, 0.05035480207545643, -0.22709034286498864, 0.25947801884501537, 0.11454828412945758, 0.2934972246167587, -0.006999638161443649, 0.07899881529007503, -0.028377809566495188, -0.03059447001903615, -0.049103901762158626, -0.05500607177821989, 0.04456231835090179, 0.2425077010282969, 0.07381576022301661, 0.31453548461555486, -0.5279591785466418, -0.2546527593594758, 0.13350936741112396, 0.12024199793392673, 0.06517202021019097, 0.034479631885683086, -0.2963456662173601, 0.10190926207327952, -0.15869693820658287, -0.0043411291897931, -0.04488737963318349, 0.04338627769512699, 0.14273123244452784, -0.31867946932052676, 0.12068505957933202, 0.06693970566179525, 0.09433270881269523, -0.05526340494596181, -0.09458337418952996, -0.04141295379265509, 0.12645510930587794, 0.04904345520672963, 0.015793340127578284, 0.1971114327140311, -0.15199997715572727, -0.11588906774178465, 0.2373491501197853, -0.05879304114000951, -0.16870867096561384, 0.1533119663189938, -0.13958860984309873, -0.12905690137178022, 0.09881489154724206, 0.14776659570238057, -0.018387237198135637, -0.14870092196865603, -0.01407769678328979, 0.07336186091712815, 0.1809134881066634, 0.09388275209992648, 0.03666361452754032, 0.12280105503692114, 0.28614613708366265, -0.010888861079125645, 0.11200106264924274, -0.08146168953303168, -0.14329016406604267, -0.22062733687579314, -0.012170650088723669, -0.12702914466784196, 0.06658965741145484, -0.12549487090572972, -0.1094362784077988, 0.43613191758024883, 0.11708370161520198, 0.21391157163703378, 0.11350518320786192, 0.22228133829429428, 0.06786499428959128, 0.10934126320631897, 0.029372438899380095, 0.22329981965966464, 0.183545423363598, 0.18837827633808743, -0.3348096003319989, 0.17952497947460755, 0.0050724601313630316]
|
1,803.07257
|
Performance analysis of a physically constructed orthogonal
representation of imaginary-time Green's function
|
The imaginary-time Green's function is a building block of various numerical
methods for correlated electron systems. Recently, it was shown that a
model-independent compact orthogonal representation of the Green's function can
be constructed by decomposing its spectral representation. We investigate the
performance of this so-called \textit{intermedaite representation} (IR) from
several points of view. First, for two simple models, we study the number of
coefficients necessary to achieve a given tolerance in expanding the Green's
function. We show that the number of coefficients grows only as $O(\log \beta)$
for fermions, and converges to a constant for bosons as temperature $T=1/\beta$
decreases. Second, we show that this remarkable feature is ascribed to the
properties of the physically constructed basis functions. The fermionic basis
functions have features in the spectrum whose width is scaled as $O(T)$, which
are consistent with the low-$T$ properties of quasiparticles in a Fermi liquid
state. On the other hand, the properties of the bosonic basis functions are
consistent with those of spin/orbital susceptibilities at low $T$. These
results demonstrate the potential wide application of the IR to calculations of
correlated systems.
|
cond-mat.str-el
|
the imaginarytime greens function is a building block of various numerical methods for correlated electron systems recently it was shown that a modelindependent compact orthogonal representation of the greens function can be constructed by decomposing its spectral representation we investigate the performance of this socalled textitintermedaite representation ir from several points of view first for two simple models we study the number of coefficients necessary to achieve a given tolerance in expanding the greens function we show that the number of coefficients grows only as olog beta for fermions and converges to a constant for bosons as temperature t1beta decreases second we show that this remarkable feature is ascribed to the properties of the physically constructed basis functions the fermionic basis functions have features in the spectrum whose width is scaled as ot which are consistent with the lowt properties of quasiparticles in a fermi liquid state on the other hand the properties of the bosonic basis functions are consistent with those of spinorbital susceptibilities at low t these results demonstrate the potential wide application of the ir to calculations of correlated systems
|
[['the', 'imaginarytime', 'greens', 'function', 'is', 'a', 'building', 'block', 'of', 'various', 'numerical', 'methods', 'for', 'correlated', 'electron', 'systems', 'recently', 'it', 'was', 'shown', 'that', 'a', 'modelindependent', 'compact', 'orthogonal', 'representation', 'of', 'the', 'greens', 'function', 'can', 'be', 'constructed', 'by', 'decomposing', 'its', 'spectral', 'representation', 'we', 'investigate', 'the', 'performance', 'of', 'this', 'socalled', 'textitintermedaite', 'representation', 'ir', 'from', 'several', 'points', 'of', 'view', 'first', 'for', 'two', 'simple', 'models', 'we', 'study', 'the', 'number', 'of', 'coefficients', 'necessary', 'to', 'achieve', 'a', 'given', 'tolerance', 'in', 'expanding', 'the', 'greens', 'function', 'we', 'show', 'that', 'the', 'number', 'of', 'coefficients', 'grows', 'only', 'as', 'olog', 'beta', 'for', 'fermions', 'and', 'converges', 'to', 'a', 'constant', 'for', 'bosons', 'as', 'temperature', 't1beta', 'decreases', 'second', 'we', 'show', 'that', 'this', 'remarkable', 'feature', 'is', 'ascribed', 'to', 'the', 'properties', 'of', 'the', 'physically', 'constructed', 'basis', 'functions', 'the', 'fermionic', 'basis', 'functions', 'have', 'features', 'in', 'the', 'spectrum', 'whose', 'width', 'is', 'scaled', 'as', 'ot', 'which', 'are', 'consistent', 'with', 'the', 'lowt', 'properties', 'of', 'quasiparticles', 'in', 'a', 'fermi', 'liquid', 'state', 'on', 'the', 'other', 'hand', 'the', 'properties', 'of', 'the', 'bosonic', 'basis', 'functions', 'are', 'consistent', 'with', 'those', 'of', 'spinorbital', 'susceptibilities', 'at', 'low', 't', 'these', 'results', 'demonstrate', 'the', 'potential', 'wide', 'application', 'of', 'the', 'ir', 'to', 'calculations', 'of', 'correlated', 'systems']]
|
[-0.12231453860390952, 0.13135997999899582, -0.09728372475429141, 0.049628152377048894, -0.03096577043230594, -0.10369376598212582, 0.023958489684526206, 0.3775171479875488, -0.2552868872266877, -0.24682389675629335, 0.0634225836071022, -0.2974350487833822, -0.15365567007281172, 0.20615407287598597, 0.010077316012069747, 0.07051796787437614, 0.015913611472389854, 0.03272964687797927, -0.1398988121693217, -0.22993289667519404, 0.3087013509165455, 0.03942890279250895, 0.2743002896690946, 0.05609384048627792, 0.08022131584840571, 0.0013704921456647442, 0.0014990689821418497, 0.01962123935080164, -0.09433554474562297, 0.09598527810341873, 0.2383596914762845, 0.06435952243998974, 0.2319972329020787, -0.3744242908688938, -0.22188200423453044, 0.07170455189483178, 0.14018161446502136, 0.08639125281391259, -0.02497674131338679, -0.23502050077921333, 0.06987727704908249, -0.16173433553642377, -0.1728450789443821, -0.10712338499417835, 0.001437328187851133, 0.052384668509418315, -0.27470965017078464, 0.0677287383721425, 0.019996662645928233, 0.030874985436149964, -0.06999514726979485, -0.14970935287547635, -0.03940263776054893, 0.09887313567726248, 0.0259391407106215, 0.055005937577404365, 0.10538386042961585, -0.15871598975026754, -0.09774174381579671, 0.358584934267328, -0.10228185975990657, -0.2005601241662689, 0.2019967594040701, -0.15150174650537607, -0.13007740906163395, 0.12323281384881708, 0.13680457104007704, 0.12476635942296994, -0.15656284738209222, 0.10794297582325961, -0.07245513449351375, 0.1649816892682933, 0.03100555220741656, 0.09459147394051427, 0.20056779050411513, 0.12869147582467041, 0.03774920760034737, 0.15902247173285655, -0.04864720584041756, -0.07921501567106244, -0.2924856661139619, -0.15927547727875246, -0.2499106622526197, 0.025245032018654377, -0.08722588577770543, -0.19679951674230065, 0.42110154120210597, 0.12799757870763623, 0.2380343288039932, 0.06420146966938974, 0.24705847048784021, 0.18255337023439785, 0.07989609209631293, 0.06221921530623849, 0.2025217152492317, 0.12755579904110714, 0.031852676945093736, -0.23662412503384345, 0.026903669471381703, 0.10090528902403273]
|
1,803.07258
|
The new cylindrical GEM inner tracker of BESIII
|
The Cylindrical GEM-Inner Tracker (CGEM-IT) is the upgrade of the internal
tracking system of the BESIII experiment. It consists of three layers of
cylindrically-shaped triple GEMs, with important innovations with respect to
the existing GEM detectors, in order to achieve the best performance with the
lowest material budget. It will be the first cylindrical GEM running with
analog readout inside a 1T magnetic field. The simultaneous measurement of both
the deposited charge and the signal time will permit to use a combination of
two algorithms to evaluate the spatial position of the charged tracks inside
the CGEM-IT: the charge centroid and the micro time projection chamber modes.
They are complementary and can cope with the asymmetry of the electron
avalanche when running in magnetic field and with non-orthogonal incident
tracks. To evaluate the behavior under different working settings, both planar
chambers and the first cylindrical prototype have been tested during various
test beams at CERN with 150 GeV/c muons and pions. This paper reports the
results obtained with the two reconstruction methods and a comparison between
the planar and cylindrical chambers.
|
physics.ins-det hep-ex
|
the cylindrical geminner tracker cgemit is the upgrade of the internal tracking system of the besiii experiment it consists of three layers of cylindricallyshaped triple gems with important innovations with respect to the existing gem detectors in order to achieve the best performance with the lowest material budget it will be the first cylindrical gem running with analog readout inside a 1t magnetic field the simultaneous measurement of both the deposited charge and the signal time will permit to use a combination of two algorithms to evaluate the spatial position of the charged tracks inside the cgemit the charge centroid and the micro time projection chamber modes they are complementary and can cope with the asymmetry of the electron avalanche when running in magnetic field and with nonorthogonal incident tracks to evaluate the behavior under different working settings both planar chambers and the first cylindrical prototype have been tested during various test beams at cern with 150 gevc muons and pions this paper reports the results obtained with the two reconstruction methods and a comparison between the planar and cylindrical chambers
|
[['the', 'cylindrical', 'geminner', 'tracker', 'cgemit', 'is', 'the', 'upgrade', 'of', 'the', 'internal', 'tracking', 'system', 'of', 'the', 'besiii', 'experiment', 'it', 'consists', 'of', 'three', 'layers', 'of', 'cylindricallyshaped', 'triple', 'gems', 'with', 'important', 'innovations', 'with', 'respect', 'to', 'the', 'existing', 'gem', 'detectors', 'in', 'order', 'to', 'achieve', 'the', 'best', 'performance', 'with', 'the', 'lowest', 'material', 'budget', 'it', 'will', 'be', 'the', 'first', 'cylindrical', 'gem', 'running', 'with', 'analog', 'readout', 'inside', 'a', '1t', 'magnetic', 'field', 'the', 'simultaneous', 'measurement', 'of', 'both', 'the', 'deposited', 'charge', 'and', 'the', 'signal', 'time', 'will', 'permit', 'to', 'use', 'a', 'combination', 'of', 'two', 'algorithms', 'to', 'evaluate', 'the', 'spatial', 'position', 'of', 'the', 'charged', 'tracks', 'inside', 'the', 'cgemit', 'the', 'charge', 'centroid', 'and', 'the', 'micro', 'time', 'projection', 'chamber', 'modes', 'they', 'are', 'complementary', 'and', 'can', 'cope', 'with', 'the', 'asymmetry', 'of', 'the', 'electron', 'avalanche', 'when', 'running', 'in', 'magnetic', 'field', 'and', 'with', 'nonorthogonal', 'incident', 'tracks', 'to', 'evaluate', 'the', 'behavior', 'under', 'different', 'working', 'settings', 'both', 'planar', 'chambers', 'and', 'the', 'first', 'cylindrical', 'prototype', 'have', 'been', 'tested', 'during', 'various', 'test', 'beams', 'at', 'cern', 'with', '150', 'gevc', 'muons', 'and', 'pions', 'this', 'paper', 'reports', 'the', 'results', 'obtained', 'with', 'the', 'two', 'reconstruction', 'methods', 'and', 'a', 'comparison', 'between', 'the', 'planar', 'and', 'cylindrical', 'chambers']]
|
[-0.08385612815262801, 0.14591876428522582, -0.05905139150304927, -0.025628761947155, -0.011018136705064938, -0.14104351831030928, -0.053119176741974014, 0.40574564161684573, -0.1920672744577233, -0.3670335998128091, 0.07533405122424787, -0.3097244674119995, -0.009099295523224606, 0.1735806514069231, -0.018810468296416933, 0.10138255045652235, 0.08917170766120155, 0.005784221664847185, -0.11192621086633557, -0.21485555922780702, 0.26083774619166633, 0.11905380309067873, 0.3178913359743698, 0.02754979868413001, 0.1516421385665631, -0.014411291852916798, -0.02568259553776847, 0.021031863885259048, -0.08152671228680346, 0.05699626796025162, 0.23136361874639988, 0.06826614960834074, 0.1845997046549908, -0.47081144055765534, -0.1037173413257632, 0.0687588848380579, 0.10808842720644962, 0.030528968999472758, -0.07044193504843861, -0.28855595781416116, 0.08400509776870926, -0.1594947906392109, -0.13105708381885456, 0.0019907419171229573, -0.038988747120472705, 0.06683488596722277, -0.26122093704115185, -0.011608297609038547, 0.014468509484666154, 0.012426031582031606, -0.05586495344759897, -0.12361820852836697, 0.029067317525105964, 0.12375819576959152, 0.05815385100884467, 0.05946849372574232, 0.1640862166053719, -0.10688328981947658, -0.15040697406770454, 0.31970025347545744, -0.04553134579974641, -0.1998547296026825, 0.21124135354119872, -0.218568758899346, -0.042929171290921254, 0.1631714480631571, 0.19099028986141395, 0.08763661050599897, -0.1747517584199765, 0.0415159786818549, 0.012831189439425038, 0.1704654977010149, 0.10762842672411352, 0.02772576232932301, 0.2020179385590988, 0.23308355501309658, 0.056348273674181354, 0.13819524907416458, -0.19074444232941865, -0.04197781645343639, -0.3129222776682582, -0.18460314067132358, -0.12595198007766156, -0.025471282698627976, -0.055097383363560466, -0.1296566444604347, 0.42590167958082426, 0.11036527024892469, 0.1774750306064056, -0.030012688114948106, 0.3449981917834116, 0.04332954093762156, 0.09846407264057133, 0.034318502513795264, 0.27047568646440695, 0.1349034014934053, 0.1765414933570557, -0.24433663482519075, 0.019581683947601253, 0.025952622511734566]
|
1,803.07259
|
Quantum Annealing Mechanism as A Measurement Process
|
An idea for an application of the quantum annealing mechanism to construct a
projection measurement in a collective space is proposed. We use the annealing
mechanism to drive the pointer degree of freedom associated with the
measurement process. The parameters in its problem Hamiltonian is given not as
classical variables but as quantum variables (states). By additionally
introducing successive short interactions so that the back reaction to the
quantum state (to be measured) can be controlled, we invent a quantum
mechanically parametrized quantum annealing process. Applying to a particular
problem of discrimination of two collective states , we find that the process
by the quantum mechanically parametrized annealing arrives at projection
measurement in the collective space when the parametrizing quantum variables
themselves are orthogonal (or distinguishable).
|
quant-ph
|
an idea for an application of the quantum annealing mechanism to construct a projection measurement in a collective space is proposed we use the annealing mechanism to drive the pointer degree of freedom associated with the measurement process the parameters in its problem hamiltonian is given not as classical variables but as quantum variables states by additionally introducing successive short interactions so that the back reaction to the quantum state to be measured can be controlled we invent a quantum mechanically parametrized quantum annealing process applying to a particular problem of discrimination of two collective states we find that the process by the quantum mechanically parametrized annealing arrives at projection measurement in the collective space when the parametrizing quantum variables themselves are orthogonal or distinguishable
|
[['an', 'idea', 'for', 'an', 'application', 'of', 'the', 'quantum', 'annealing', 'mechanism', 'to', 'construct', 'a', 'projection', 'measurement', 'in', 'a', 'collective', 'space', 'is', 'proposed', 'we', 'use', 'the', 'annealing', 'mechanism', 'to', 'drive', 'the', 'pointer', 'degree', 'of', 'freedom', 'associated', 'with', 'the', 'measurement', 'process', 'the', 'parameters', 'in', 'its', 'problem', 'hamiltonian', 'is', 'given', 'not', 'as', 'classical', 'variables', 'but', 'as', 'quantum', 'variables', 'states', 'by', 'additionally', 'introducing', 'successive', 'short', 'interactions', 'so', 'that', 'the', 'back', 'reaction', 'to', 'the', 'quantum', 'state', 'to', 'be', 'measured', 'can', 'be', 'controlled', 'we', 'invent', 'a', 'quantum', 'mechanically', 'parametrized', 'quantum', 'annealing', 'process', 'applying', 'to', 'a', 'particular', 'problem', 'of', 'discrimination', 'of', 'two', 'collective', 'states', 'we', 'find', 'that', 'the', 'process', 'by', 'the', 'quantum', 'mechanically', 'parametrized', 'annealing', 'arrives', 'at', 'projection', 'measurement', 'in', 'the', 'collective', 'space', 'when', 'the', 'parametrizing', 'quantum', 'variables', 'themselves', 'are', 'orthogonal', 'or', 'distinguishable']]
|
[-0.11596101593784988, 0.24377822497696616, -0.1398377591453027, 0.018283761689192032, -0.030047757923603056, -0.16514435760304333, 0.07465979690104722, 0.34958946964144705, -0.36203213579952714, -0.2857194060012698, 0.05159611294604838, -0.24547356209158896, -0.12749994024820627, 0.1737628423999995, -0.03984416358917951, 0.06448790329648182, 0.05616870059818029, 0.014728927381336689, -0.0666838296726346, -0.25222643139958384, 0.3007765590399504, 0.08375127003062516, 0.24651456061936916, -0.027619781609624625, 0.1399347467496991, 0.05300545264407992, 0.05795348285138607, 0.004675027865450829, -0.07248900424002204, 0.05568069274816662, 0.25424758285842836, 0.12239726807549596, 0.2466994720622897, -0.434175214022398, -0.19367285742610693, 0.12499679930880665, 0.13083152168616652, 0.17519906055927276, -0.025982728514820336, -0.29754014368727805, 0.019928123019635677, -0.13090391719259786, -0.11251947794109583, -0.10627255281060934, -0.026619224786758423, -0.05016572090983391, -0.2522987695895135, 0.0349049975596281, 0.06970507455430924, 0.03225815215520561, -0.02866073247883469, -0.04430696067586541, 0.010988230224698782, 0.10191282257554121, -0.028330322568072008, 0.03552182263624854, 0.1907133638858795, -0.10707336523011327, -0.19163987212255598, 0.35999773572385313, -0.032343052396550775, -0.2391629786491394, 0.15839320910535754, -0.06674409418553114, -0.09524110474810005, 0.08060633964836597, 0.1373762800619006, 0.12848906616307795, -0.1580257553936681, 0.05808698676526546, 0.03083792669326067, 0.15579397624731064, 0.05200114902853966, 0.051419468753039835, 0.1723576747197658, 0.10809942543786019, 0.0637744231922552, 0.17583494279254228, -0.058196048181969676, -0.19314829152077437, -0.31165322767943143, -0.20724296631664038, -0.22821434815600514, 0.10503802819934208, -0.04914169592037797, -0.15059358793869615, 0.3923913080021739, 0.13509007623465732, 0.22155310689657925, -0.020010726030915974, 0.2612845529168844, 0.16653802815452218, 0.03992875124886632, 0.04682881012931466, 0.22646077452600002, 0.14287582278996705, 0.028047452598810196, -0.2600798599869013, 0.0830381825119257, 0.03037231470644474]
|
1,803.0726
|
Conception of Brownian coil
|
This article proposes a conception of Brownian coil. Brownian coil is a tiny
coil with the same size of pollen. Once immersed into designed magnetic field
and liquid, the coil will be moved and deformed macroscopically, due to the
microscopic thermodynamic molecular collisions. Such deformation and movement
will change the magnetic flux through the coil, by which an ElectroMotive Force
(EMF) is produced. In this work, Brownian heat exchanger and Brownian generator
are further designed to transform the internal energy of liquid into other
form: 1) the internal energy of the resistance; 2) the constant electric
energy. The two forms accord with the Clausius' statement and Kelvin's
statement respectively. If the ideas can be realized, the second law of
thermodynamics and the second kind of perpetual-motion machine should be
understood again.
|
physics.gen-ph
|
this article proposes a conception of brownian coil brownian coil is a tiny coil with the same size of pollen once immersed into designed magnetic field and liquid the coil will be moved and deformed macroscopically due to the microscopic thermodynamic molecular collisions such deformation and movement will change the magnetic flux through the coil by which an electromotive force emf is produced in this work brownian heat exchanger and brownian generator are further designed to transform the internal energy of liquid into other form 1 the internal energy of the resistance 2 the constant electric energy the two forms accord with the clausius statement and kelvins statement respectively if the ideas can be realized the second law of thermodynamics and the second kind of perpetualmotion machine should be understood again
|
[['this', 'article', 'proposes', 'a', 'conception', 'of', 'brownian', 'coil', 'brownian', 'coil', 'is', 'a', 'tiny', 'coil', 'with', 'the', 'same', 'size', 'of', 'pollen', 'once', 'immersed', 'into', 'designed', 'magnetic', 'field', 'and', 'liquid', 'the', 'coil', 'will', 'be', 'moved', 'and', 'deformed', 'macroscopically', 'due', 'to', 'the', 'microscopic', 'thermodynamic', 'molecular', 'collisions', 'such', 'deformation', 'and', 'movement', 'will', 'change', 'the', 'magnetic', 'flux', 'through', 'the', 'coil', 'by', 'which', 'an', 'electromotive', 'force', 'emf', 'is', 'produced', 'in', 'this', 'work', 'brownian', 'heat', 'exchanger', 'and', 'brownian', 'generator', 'are', 'further', 'designed', 'to', 'transform', 'the', 'internal', 'energy', 'of', 'liquid', 'into', 'other', 'form', '1', 'the', 'internal', 'energy', 'of', 'the', 'resistance', '2', 'the', 'constant', 'electric', 'energy', 'the', 'two', 'forms', 'accord', 'with', 'the', 'clausius', 'statement', 'and', 'kelvins', 'statement', 'respectively', 'if', 'the', 'ideas', 'can', 'be', 'realized', 'the', 'second', 'law', 'of', 'thermodynamics', 'and', 'the', 'second', 'kind', 'of', 'perpetualmotion', 'machine', 'should', 'be', 'understood', 'again']]
|
[-0.11131105914201515, 0.24358462553500432, -0.08233947067414052, 0.01025155781266781, -0.07730573470202776, -0.1352537358358789, 0.0018524798654163113, 0.32165640955074476, -0.3098834275590399, -0.32170154362594566, 0.04740914061504344, -0.25248847876030667, -0.07841647727450786, 0.1859056751418393, -0.0718350868493032, 0.01925107228139845, 0.018435327244850877, 0.05977053775523718, 0.016157932103110048, -0.16895633972106644, 0.25111050199753104, 0.08161206932810064, 0.2814044050514125, 0.058908803531756766, 0.12070988938212394, -0.05202233619773044, 0.037190318481925014, 0.08701876982007749, -0.1486355988953549, 0.09391238585387607, 0.18639512806772612, 0.001589176359658058, 0.23906834489809206, -0.5050874195706386, -0.16934292282049473, 0.09023734240864333, 0.10432552910553149, 0.08426459702716854, -0.01857700558522573, -0.2872380641127865, 0.021156549336424527, -0.15318793089917074, -0.15983924916228995, -0.0637156279811349, 0.002417130477260798, 0.04538594475687625, -0.21640369571172274, 0.08406508156241706, 0.12403530702576973, 0.05093935967351382, -0.09215788005206448, -0.07290136380336032, -0.02193400820072454, 0.08414945497822303, 0.07770743384025991, 0.0756965680513531, 0.26970487208678745, -0.09290158602212054, -0.0636062733685741, 0.36183042043390184, -0.01866558494153791, -0.2145635053801995, 0.11023107976652682, -0.15825966233029387, -0.07908413391560316, 0.14536593092712932, 0.1166342997063811, 0.03554937326681773, -0.2142396620976237, 0.04510981040411235, 0.020811458596458228, 0.16636700337179577, 0.08880120686685236, -0.08266909828122992, 0.25949721991156155, 0.1799591721393741, 0.02299985809591957, 0.19157499545388137, -0.12107239912192409, -0.10147313380327362, -0.32406870857812464, -0.2362409903166386, -0.21138486805586862, 0.1054159119931193, -0.062465391264413486, -0.15925390938870035, 0.33264442238634306, 0.09448678729016907, 0.12527601005545316, 0.01288650639516373, 0.3184708308141965, 0.10856555243954062, 0.07854641928122594, 0.061395838734908746, 0.2505712496564509, 0.16303727279524677, 0.16549379621775678, -0.2185833971486248, 0.030660343148673955, 0.07800160551157136]
|
1,803.07261
|
Frustration induced non-Curie-Weiss paramagnetism in La3Ir3O11: a
fractional-valence-state iridate
|
Experimental and theoretical studies are performed on La3Ir3O11, an iridate
hosting a +4.33 fractional valence state for Ir ions and a three-dimensional
frustrated structure composed of edge-shared Ir2O10 dimers. These features are
expected to enhance inter-site hoppings and reduce magnetic moments of Ir ions.
However, a spin-orbit driven Mott insulating transport is observed, which is
supported by our first principles calculations. Most importantly, geometrical
frustration and competing interactions result in a non-Curie-Weiss paramagnetic
ground state, revealing no magnetic order down to 2 K. This unusual state is
further demonstrated by a theoretical modeling process, suggesting a possible
candidate for the spin liquid state.
|
cond-mat.str-el
|
experimental and theoretical studies are performed on la3ir3o11 an iridate hosting a 433 fractional valence state for ir ions and a threedimensional frustrated structure composed of edgeshared ir2o10 dimers these features are expected to enhance intersite hoppings and reduce magnetic moments of ir ions however a spinorbit driven mott insulating transport is observed which is supported by our first principles calculations most importantly geometrical frustration and competing interactions result in a noncurieweiss paramagnetic ground state revealing no magnetic order down to 2 k this unusual state is further demonstrated by a theoretical modeling process suggesting a possible candidate for the spin liquid state
|
[['experimental', 'and', 'theoretical', 'studies', 'are', 'performed', 'on', 'la3ir3o11', 'an', 'iridate', 'hosting', 'a', '433', 'fractional', 'valence', 'state', 'for', 'ir', 'ions', 'and', 'a', 'threedimensional', 'frustrated', 'structure', 'composed', 'of', 'edgeshared', 'ir2o10', 'dimers', 'these', 'features', 'are', 'expected', 'to', 'enhance', 'intersite', 'hoppings', 'and', 'reduce', 'magnetic', 'moments', 'of', 'ir', 'ions', 'however', 'a', 'spinorbit', 'driven', 'mott', 'insulating', 'transport', 'is', 'observed', 'which', 'is', 'supported', 'by', 'our', 'first', 'principles', 'calculations', 'most', 'importantly', 'geometrical', 'frustration', 'and', 'competing', 'interactions', 'result', 'in', 'a', 'noncurieweiss', 'paramagnetic', 'ground', 'state', 'revealing', 'no', 'magnetic', 'order', 'down', 'to', '2', 'k', 'this', 'unusual', 'state', 'is', 'further', 'demonstrated', 'by', 'a', 'theoretical', 'modeling', 'process', 'suggesting', 'a', 'possible', 'candidate', 'for', 'the', 'spin', 'liquid', 'state']]
|
[-0.16178090402856468, 0.21553360012025224, -0.004098764996160753, 0.07142812345855418, -0.05282956978306174, -0.16065621009096503, 0.10293528402224184, 0.4093762814626098, -0.22691440270398744, -0.30330603633075953, 0.010653361355653033, -0.3656269208341837, -0.09478110399097205, 0.12201754216337576, 0.10493637662380934, 0.004702133234823123, -0.0010339554934762419, -0.05487861769739538, -0.08029088348208462, -0.19412044273427453, 0.25154964834684507, 0.026898893781472, 0.2705050942255184, 0.08952965877950192, 0.02757680561160669, -0.03179603073280304, 0.12622354594059287, 0.021698151594027878, -0.1360083776526153, 0.07792569300159811, 0.26220125450752674, -0.10231845341157168, 0.19293320700759067, -0.44955269450321794, -0.22923794358363012, -0.014014421836473048, 0.13510958158876746, 0.13370065793744287, -0.09816948928521015, -0.3249297957867384, 0.005672425812808797, -0.15825542280916124, -0.12900267439312302, -0.1653395422245376, -0.009995707971975208, -0.028313995596545283, -0.30829497421829727, 0.08934294893406332, 0.10409179280512035, 0.10425546840931929, -0.12275080319028348, -0.1655129512446001, -0.09785642737755552, 0.047271859446773305, 0.03869879317673622, 0.09545769672375172, 0.11528452965430916, -0.12168955308443401, -0.16644051004201174, 0.365992099866271, 0.014213624487165361, -0.08202655832050368, 0.20436449779197574, -0.14890227832365782, -0.11794915431179107, 0.19545838708058, 0.09512863750569522, 0.10011041845194996, -0.1277387203933904, 0.03374923667637631, -0.01431146245682612, 0.2378989882906899, -0.06683628800441511, 0.08782557672238908, 0.2822099781315774, 0.23085251822136343, 0.008913274379447103, 0.1543510771356523, -0.1228397932718508, -0.1333009559341008, -0.17996381249278784, -0.1617517782561481, -0.25511828150600196, 0.06920790567353834, -0.04490881250181701, -0.13868508724495768, 0.36772885502316055, 0.1469683225546032, 0.1512445500586182, -0.1015037118003238, 0.23052089074626564, 0.05872866063495166, 0.016596513155382128, 0.031224934189813213, 0.26981373826507477, 0.15878096867352723, 0.0705565075587947, -0.2851289473613724, 0.10507050514221192, 0.02186485055834055]
|
1,803.07262
|
Blocks with defect group $\mathbb Z_{2^n}\times \mathbb Z_{2^n}\times
\mathbb Z_{2^m}$
|
In this paper, we prove that a block with defect group $\mathbb Z_{2^n}\times
\mathbb Z_{2^n}\times \mathbb Z_{2^m}$, where $n\geq 2$ and $m$ is arbitrary,
is Morita equivalent to its Brauer correspondent.
|
math.GR
|
in this paper we prove that a block with defect group mathbb z_2ntimes mathbb z_2ntimes mathbb z_2m where ngeq 2 and m is arbitrary is morita equivalent to its brauer correspondent
|
[['in', 'this', 'paper', 'we', 'prove', 'that', 'a', 'block', 'with', 'defect', 'group', 'mathbb', 'z_2ntimes', 'mathbb', 'z_2ntimes', 'mathbb', 'z_2m', 'where', 'ngeq', '2', 'and', 'm', 'is', 'arbitrary', 'is', 'morita', 'equivalent', 'to', 'its', 'brauer', 'correspondent']]
|
[-0.21253527815063153, 0.06953950936815911, 0.005381108644688802, -0.05730554282349805, -0.043981260693286575, -0.24742065337035926, -0.10972280021862037, 0.3880324960205584, -0.3161311647103679, -0.1148453957040704, 0.13044893975564908, -0.2549538267475943, -0.13240311502088462, 0.06765271121666076, -0.19617093651885947, -0.049793022326118645, -0.040027075837696754, 0.16189938705534704, -0.1269536927425032, -0.31239607389415464, 0.3486634128456635, -0.13704945522570802, 0.19628896760273604, 0.045123196477370876, 0.10002517360713213, 0.019272294646549608, 0.04645704763430741, -0.028322998013707898, -0.21888409769129677, 0.10096762132560534, 0.33473963434657744, 0.027879807579841827, 0.19645425570648042, -0.3447792898983725, -0.08800776972765884, 0.2855716527349526, 0.24097720140050496, -0.036636193222816915, -0.009070497862393818, -0.30099814120800267, 0.2138174020895554, -0.17997162007997114, -0.15173967864604726, 0.06454104906128298, 0.19816984807050997, -0.015690460673443252, -0.3483529211052002, -0.03878253115521323, 0.12380030360673705, 0.11463126801555196, -0.0464910794868164, -0.056925732732540174, -0.11243476784758029, 0.06652717197674417, -0.06133540090353739, 0.18907768663860136, 0.10530464142380704, 0.0467551612640701, -0.07562965734471236, 0.39390897384333995, -0.07147915036447587, -0.24807410954587883, 0.0374475852586329, -0.17130754623682268, -0.21077739300146217, 0.09017647948536661, 0.02213818095262996, 0.17292708957627898, 0.02649596225350134, 0.32128420769379684, -0.17998203665258422, 0.10477905528199288, 0.05522384891106236, -0.03522735628329458, 0.05724248566454457, 0.05641734399532358, 0.11056023866178528, 0.1256624007928035, 0.03826502986973332, 0.05147749804441006, -0.3615683817094372, -0.23963486580478568, -0.09513332208077754, 0.23216987022709462, -0.11572466383551082, -0.11943769444441123, 0.3154578420423692, 0.10092412376956593, 0.11487747350287053, 0.205504450616577, 0.13572941414050518, 0.03171365834291904, 0.03139495757979251, 0.10389265703457978, -0.003801796945833391, 0.24688060930179012, -0.10471172865119673, -0.13795722807727515, -0.07660235125090807, 0.23539637134320313]
|
1,803.07263
|
Test beam results with prototypes for the new Cylindrical GEM Inner
Tracker of the BESIII experiment
|
A cylindrical GEM tracker is under construction in order to replace and
improve the inner tracking system of the BESIII experiment. Tests with planar
chamber prototypes were carried out on the H4 beam line of SPS (CERN) with
muons of 150 GeV/c momentum, to evaluate the efficiency and resolution under
different working conditions. The obtained efficiency was in the 96 - 98%
range. Two complementary algorithms for the position determination were
developed: the charge centroid and the micro-TPC methods. With the former,
resolutions <100 micron and <200 micron were achieved without and with magnetic
field, respectively. The micro-TPC improved these results. By the end of 2016,
the first cylindrical prototype was tested on the same beam line. It showed
optimal stability under different settings. The comparison of its performance
with respect to the planar chambers is ongoing. Here, the results of the planar
prototype tests will be addressed.
|
physics.ins-det
|
a cylindrical gem tracker is under construction in order to replace and improve the inner tracking system of the besiii experiment tests with planar chamber prototypes were carried out on the h4 beam line of sps cern with muons of 150 gevc momentum to evaluate the efficiency and resolution under different working conditions the obtained efficiency was in the 96 98 range two complementary algorithms for the position determination were developed the charge centroid and the microtpc methods with the former resolutions 100 micron and 200 micron were achieved without and with magnetic field respectively the microtpc improved these results by the end of 2016 the first cylindrical prototype was tested on the same beam line it showed optimal stability under different settings the comparison of its performance with respect to the planar chambers is ongoing here the results of the planar prototype tests will be addressed
|
[['a', 'cylindrical', 'gem', 'tracker', 'is', 'under', 'construction', 'in', 'order', 'to', 'replace', 'and', 'improve', 'the', 'inner', 'tracking', 'system', 'of', 'the', 'besiii', 'experiment', 'tests', 'with', 'planar', 'chamber', 'prototypes', 'were', 'carried', 'out', 'on', 'the', 'h4', 'beam', 'line', 'of', 'sps', 'cern', 'with', 'muons', 'of', '150', 'gevc', 'momentum', 'to', 'evaluate', 'the', 'efficiency', 'and', 'resolution', 'under', 'different', 'working', 'conditions', 'the', 'obtained', 'efficiency', 'was', 'in', 'the', '96', '98', 'range', 'two', 'complementary', 'algorithms', 'for', 'the', 'position', 'determination', 'were', 'developed', 'the', 'charge', 'centroid', 'and', 'the', 'microtpc', 'methods', 'with', 'the', 'former', 'resolutions', '100', 'micron', 'and', '200', 'micron', 'were', 'achieved', 'without', 'and', 'with', 'magnetic', 'field', 'respectively', 'the', 'microtpc', 'improved', 'these', 'results', 'by', 'the', 'end', 'of', '2016', 'the', 'first', 'cylindrical', 'prototype', 'was', 'tested', 'on', 'the', 'same', 'beam', 'line', 'it', 'showed', 'optimal', 'stability', 'under', 'different', 'settings', 'the', 'comparison', 'of', 'its', 'performance', 'with', 'respect', 'to', 'the', 'planar', 'chambers', 'is', 'ongoing', 'here', 'the', 'results', 'of', 'the', 'planar', 'prototype', 'tests', 'will', 'be', 'addressed']]
|
[-0.054433619860103546, 0.10191949994816464, -0.05464234053264974, -0.01798698244470672, -0.0017698977038036196, -0.12689191079540116, -0.021034357131642548, 0.42985030759100606, -0.14158824139407702, -0.37172448888403636, 0.11224546653953489, -0.2694169755527737, 0.015916299277625116, 0.22097344652489842, -0.03685812829189053, 0.12583540539299992, 0.10973292860031432, -0.016623132825721386, -0.1049154149748537, -0.2684048695480261, 0.24315610116182948, 0.1679900303597049, 0.3294223035308754, 0.06257015920036668, 0.12785434987487868, -0.04410009016084871, -0.055992656064276794, 0.034413909349514514, -0.1372267404431794, 0.05477012408466465, 0.21451351113006042, 0.07742332234395807, 0.18359045623833326, -0.41163168600475303, -0.11972629819457344, 0.03702706323784529, 0.06816564230438397, 0.005062235396539121, -0.04456152959067856, -0.30785786306016705, 0.13956802375186994, -0.14994052162736046, -0.16632737973578224, 0.012366613552435998, -0.04785739743787491, 0.05408188951246086, -0.24463826646635525, -0.0076790814882708195, 0.014828542557310987, 0.08808896385868188, -0.06008993661059637, -0.17704388244809316, 0.024409727126892124, 0.09775624058975958, 0.00034021721522444165, 0.05661024709491908, 0.1707164419966997, -0.07962430941948127, -0.13992990692760668, 0.3336796017021549, -0.03536553075220309, -0.17523285182712434, 0.2126071916728401, -0.19905302310235748, -0.06283101270000646, 0.18431335738796714, 0.15701576606703124, 0.1112307233761261, -0.17250443080148728, 0.05590737612441271, -0.01238682191679571, 0.18784316705197704, 0.14214634218690347, -0.03092887185113152, 0.1670298820161926, 0.21918638487707595, 0.04603627454932956, 0.1600343549618542, -0.19012993394213468, -0.0538083377245142, -0.2971296236734698, -0.15266491230565352, -0.11904012712770376, -0.018489755959357736, -0.04179310184682887, -0.0483803514416526, 0.398128454231334, 0.10647805017058035, 0.17603999828653677, -0.0008618318019228905, 0.2945926911799478, 0.03468914616371498, 0.08363929928793591, 0.016337418675321302, 0.30381453123108365, 0.13628421493229412, 0.1613891396582836, -0.24262945065718322, 0.009664392212823945, 0.02901084852233833]
|
1,803.07264
|
Estimating Participation Factors and Mode Shapes for Electromechanical
Oscillations in Ambient Conditions
|
In this paper, a new technique is applied to conduct mode identification
using ambient measurement data. The proposed hybrid measurement- and
model-based method can accurately estimate the system state matrix in ambient
conditions, the eigenvalues and eigenvectors of which readily provide all the
modal knowledge including frequencies, damping ratios, mode shapes, and more
importantly, participation factors. Numerical simulations show that the
proposed technique is able to provide accurate estimation of modal knowledge
for all modes. In addition, the discrepancy between the participation factor
and the mode shape is shown through a numerical example, demonstrating that
using the mode shape may not effectively pinpoint the best location for damping
control. Therefore, the proposed technique capable of estimating participation
factors may greatly facilitate designing damping controls.
|
eess.SP
|
in this paper a new technique is applied to conduct mode identification using ambient measurement data the proposed hybrid measurement and modelbased method can accurately estimate the system state matrix in ambient conditions the eigenvalues and eigenvectors of which readily provide all the modal knowledge including frequencies damping ratios mode shapes and more importantly participation factors numerical simulations show that the proposed technique is able to provide accurate estimation of modal knowledge for all modes in addition the discrepancy between the participation factor and the mode shape is shown through a numerical example demonstrating that using the mode shape may not effectively pinpoint the best location for damping control therefore the proposed technique capable of estimating participation factors may greatly facilitate designing damping controls
|
[['in', 'this', 'paper', 'a', 'new', 'technique', 'is', 'applied', 'to', 'conduct', 'mode', 'identification', 'using', 'ambient', 'measurement', 'data', 'the', 'proposed', 'hybrid', 'measurement', 'and', 'modelbased', 'method', 'can', 'accurately', 'estimate', 'the', 'system', 'state', 'matrix', 'in', 'ambient', 'conditions', 'the', 'eigenvalues', 'and', 'eigenvectors', 'of', 'which', 'readily', 'provide', 'all', 'the', 'modal', 'knowledge', 'including', 'frequencies', 'damping', 'ratios', 'mode', 'shapes', 'and', 'more', 'importantly', 'participation', 'factors', 'numerical', 'simulations', 'show', 'that', 'the', 'proposed', 'technique', 'is', 'able', 'to', 'provide', 'accurate', 'estimation', 'of', 'modal', 'knowledge', 'for', 'all', 'modes', 'in', 'addition', 'the', 'discrepancy', 'between', 'the', 'participation', 'factor', 'and', 'the', 'mode', 'shape', 'is', 'shown', 'through', 'a', 'numerical', 'example', 'demonstrating', 'that', 'using', 'the', 'mode', 'shape', 'may', 'not', 'effectively', 'pinpoint', 'the', 'best', 'location', 'for', 'damping', 'control', 'therefore', 'the', 'proposed', 'technique', 'capable', 'of', 'estimating', 'participation', 'factors', 'may', 'greatly', 'facilitate', 'designing', 'damping', 'controls']]
|
[-0.07401962807935272, 0.07137966951948681, -0.0849852308390602, 0.03681321909314119, -0.09759558944384597, -0.12649595130971003, 0.05107825606284032, 0.3692658155773496, -0.24176803601515148, -0.32890681981018954, 0.10626963688663373, -0.2112201460329215, -0.18594291803498392, 0.2379014549453953, -0.017268881393266062, 0.07821243229104326, 0.09902133536055654, 0.0024396463606183626, -0.03384052359333803, -0.16502546214201907, 0.28520098631457996, 0.10704819666458323, 0.3659318867721595, 0.052678100428649136, 0.06432415180813311, 0.012529335395928713, -0.03812588125677599, 0.0009692000195143685, -0.11513565453353822, 0.10719111598765237, 0.2937852353976679, 0.1584142244481031, 0.28253823945358875, -0.390880152032966, -0.19923747932766528, 0.07267044881929553, 0.19266038872076258, 0.11568846025470374, -0.03182985824629037, -0.2633256024921373, 0.06266517418947432, -0.15895016613085905, -0.13588554838732367, -0.15711278528643532, -0.03422248208399622, -0.03576521845083804, -0.3508193191148401, 0.07667695505980161, 0.04430877662173683, 0.01681045705223486, -0.07080333543971422, -0.11163077897283309, 0.02450713339907628, 0.15448736101332602, 0.027155001033773465, -0.05749190354254097, 0.16316074714620388, -0.08150308285351662, -0.10613292067371789, 0.3587470150913202, -0.046086350566662486, -0.245239608513657, 0.16682199991097854, -0.13794318649301968, -0.07478141436548603, 0.1524372412072074, 0.18608754280308681, 0.08352615809323446, -0.15041680806767074, -0.01779362109241887, 0.03136801297378336, 0.2276361170694262, 0.03536296004219161, 0.023811145955997128, 0.14935580885878974, 0.1599455346961716, 0.05789782417066876, 0.11791294379931529, -0.0958197018715568, -0.02728357447561012, -0.24425844432065083, -0.13272618162227445, -0.1756724914687971, -0.0538471039484824, -0.09681598880589233, -0.11473326241637903, 0.41159505844717065, 0.18478742385031505, 0.16690136729589394, 0.05419274708800649, 0.34125932065709946, 0.11927971339619328, 0.06964890914218079, 0.06896602640664505, 0.2862679095818631, 0.11946594449616368, 0.07658328284179011, -0.29400464330589576, 0.11372649355325848, 0.023898991543964875]
|
1,803.07265
|
An Analysis of Frequent Patterns in the World Trade Web
|
This paper employs a weighted network approach to study the empirical
properties of the web of trade relationships among world countries, and its
evolution over time. We show that most countries are characterized by weak
trade links; yet, there exists a group of countries featuring a large number of
strong relationships, thus hinting to a core-periphery structure. The World
Trade Web (WTW) is characterized by the following representation: a directed
graph connecting world Countries with trade relationships, with the aim of
finding its topological characterization in terms of motifs and isolating the
key factors underlying its evolution. Frequent patterns can identify channels
or infrastructures to be strengthened and can help in choosing the most
suitable message routing schema or network protocol. In general, frequent
patterns have been called {\it motifs} and overrepresented motifs have been
recognized to be the low-level building blocks of networks and to be useful to
explain many of their properties, playing a relevant role in determining their
dynamic and evolution. In this paper triadic motifs are found first
partitioning a network by strength of connections and then analyzing the
partitions separately. The WTW has been split based on the weights of the graph
to highlight structural differences between the big players in terms of volumes
of trade and the rest of the world. As test case, the period 2003-2010 has been
analyzed, to show the structural effect of the economical crisis in the year
2007.
|
cs.SI physics.soc-ph
|
this paper employs a weighted network approach to study the empirical properties of the web of trade relationships among world countries and its evolution over time we show that most countries are characterized by weak trade links yet there exists a group of countries featuring a large number of strong relationships thus hinting to a coreperiphery structure the world trade web wtw is characterized by the following representation a directed graph connecting world countries with trade relationships with the aim of finding its topological characterization in terms of motifs and isolating the key factors underlying its evolution frequent patterns can identify channels or infrastructures to be strengthened and can help in choosing the most suitable message routing schema or network protocol in general frequent patterns have been called it motifs and overrepresented motifs have been recognized to be the lowlevel building blocks of networks and to be useful to explain many of their properties playing a relevant role in determining their dynamic and evolution in this paper triadic motifs are found first partitioning a network by strength of connections and then analyzing the partitions separately the wtw has been split based on the weights of the graph to highlight structural differences between the big players in terms of volumes of trade and the rest of the world as test case the period 20032010 has been analyzed to show the structural effect of the economical crisis in the year 2007
|
[['this', 'paper', 'employs', 'a', 'weighted', 'network', 'approach', 'to', 'study', 'the', 'empirical', 'properties', 'of', 'the', 'web', 'of', 'trade', 'relationships', 'among', 'world', 'countries', 'and', 'its', 'evolution', 'over', 'time', 'we', 'show', 'that', 'most', 'countries', 'are', 'characterized', 'by', 'weak', 'trade', 'links', 'yet', 'there', 'exists', 'a', 'group', 'of', 'countries', 'featuring', 'a', 'large', 'number', 'of', 'strong', 'relationships', 'thus', 'hinting', 'to', 'a', 'coreperiphery', 'structure', 'the', 'world', 'trade', 'web', 'wtw', 'is', 'characterized', 'by', 'the', 'following', 'representation', 'a', 'directed', 'graph', 'connecting', 'world', 'countries', 'with', 'trade', 'relationships', 'with', 'the', 'aim', 'of', 'finding', 'its', 'topological', 'characterization', 'in', 'terms', 'of', 'motifs', 'and', 'isolating', 'the', 'key', 'factors', 'underlying', 'its', 'evolution', 'frequent', 'patterns', 'can', 'identify', 'channels', 'or', 'infrastructures', 'to', 'be', 'strengthened', 'and', 'can', 'help', 'in', 'choosing', 'the', 'most', 'suitable', 'message', 'routing', 'schema', 'or', 'network', 'protocol', 'in', 'general', 'frequent', 'patterns', 'have', 'been', 'called', 'it', 'motifs', 'and', 'overrepresented', 'motifs', 'have', 'been', 'recognized', 'to', 'be', 'the', 'lowlevel', 'building', 'blocks', 'of', 'networks', 'and', 'to', 'be', 'useful', 'to', 'explain', 'many', 'of', 'their', 'properties', 'playing', 'a', 'relevant', 'role', 'in', 'determining', 'their', 'dynamic', 'and', 'evolution', 'in', 'this', 'paper', 'triadic', 'motifs', 'are', 'found', 'first', 'partitioning', 'a', 'network', 'by', 'strength', 'of', 'connections', 'and', 'then', 'analyzing', 'the', 'partitions', 'separately', 'the', 'wtw', 'has', 'been', 'split', 'based', 'on', 'the', 'weights', 'of', 'the', 'graph', 'to', 'highlight', 'structural', 'differences', 'between', 'the', 'big', 'players', 'in', 'terms', 'of', 'volumes', 'of', 'trade', 'and', 'the', 'rest', 'of', 'the', 'world', 'as', 'test', 'case', 'the', 'period', '20032010', 'has', 'been', 'analyzed', 'to', 'show', 'the', 'structural', 'effect', 'of', 'the', 'economical', 'crisis', 'in', 'the', 'year', '2007']]
|
[-0.1553709647388326, 0.07856539494619086, -0.09072312415639819, 0.10147140432435582, -0.08112373486210915, -0.10094206867092698, 0.08194849333944088, 0.3898658308679838, -0.2898801750333972, -0.3243837239275293, 0.09820982430054256, -0.28374626941854236, -0.21068863840929572, 0.14513608427702696, -0.06136243527357673, -0.0012420323191728894, 0.05512435183818411, 0.03899013067334579, 0.012440573201012101, -0.26665413067077004, 0.3251371519001022, 0.06088023222437339, 0.2998254397001398, 0.0478277222280355, 0.06507627302369154, -0.022142181356114073, -0.08741176155335893, 0.058520459459420436, -0.08622755908381577, 0.16954410797818933, 0.32031349177671026, 0.18366540204655676, 0.29662292168249677, -0.4462015669262933, -0.20171600953475124, 0.15353618610930866, 0.11902426203779065, 0.055206394738276106, 0.010200182969144168, -0.27875396791187007, 0.10647017133561505, -0.17966263764391743, -0.08074567321552525, -0.07242492396310439, 0.06190900291826685, 0.043169379429151326, -0.20004571177319636, 0.026357730562218063, 0.02975454734746468, 0.08287767418771037, 0.00731117317256241, -0.0746267644145865, -0.05255403309460402, 0.22616819830545104, 0.06696479136385336, -0.02296307707978919, 0.10975452797354888, -0.14221101911411188, -0.15961033664643764, 0.3758091441117944, 0.01724763700512538, -0.13592246855379211, 0.1801781054424457, -0.0958860331744922, -0.16776126614191167, 0.05808358967389958, 0.19476718688042732, 0.05285633633472902, -0.18096398581701006, 0.04811556573380486, -0.047610505731488, 0.15826791903212525, 0.1063464599969372, 0.030861969305851174, 0.2067585664939634, 0.21075540937670353, 0.07299744045809028, 0.12398847836122369, -0.04330122944797588, -0.1241199653663879, -0.18537485063715087, -0.1283386136407849, -0.14572474901334512, -0.009147727830826489, -0.13259920266809558, -0.15750665801955255, 0.4392550380717355, 0.09584162522898403, 0.2023198285050472, 0.025679165692259576, 0.2279296330976101, 0.03556377840643382, 0.10773137043636714, 0.09924658613715898, 0.19528888318898102, 0.1030448692096748, 0.12464848184319034, -0.17507001762249152, 0.1768806336679453, 0.03476933917375554]
|
1,803.07266
|
Performance of the micro-TPC Reconstruction for GEM Detectors at High
Rate
|
Gas detectors are one of the pillars of the research in fundamental physics.
Since many years, a new concept of detectors, the Micro Pattern Gas Detectors,
allows to overcome many of the problems of other types of commonly used
detectors, as drift chambers and microstrips, reducing the discharge rate and
increasing the radiation tolerance. Among these, one of the most commonly used
is the Gas Electron Multiplier. Commonly deployed as fast timing detectors and
triggers, due to their fast response, high rate capability and high radiation
hardness, they can also be used as trackers. The center of gravity readout
technique allows to overcome the limit of the digital pads, whose spatial
resolution is constrained by the pitch size. The presence of a high external
magnetic field can distort the electronic cloud and affect the spatial
resolution. The micro-TPC reconstruction method allows to reconstruct the three
dimensional particle position as in a traditional Time Projection Chamber, but
within a drift gap of a few millimeters. This method brings these detectors
into a new perspective for what concerns the spatial resolution in strong
magnetic field. In this report, the basis of this new technique will be shown
and it will be compared to the traditional center of gravity. The results of a
series of test beam performed with 10 x 10 cm2 planar prototypes in magnetic
field will also be presented. This is one of the first implementations of this
technique for GEM detectors in magnetic field and allows to reach unprecedented
performance for gas detectors, up to a limit of 120 micron at 1T, one of the
world's best results for MPGDs in strong magnetic field. The micro-TPC
reconstruction has been recently tested at very high rates in a test beam at
the MAMI facility; preliminary results of the test will be presented.
|
physics.ins-det
|
gas detectors are one of the pillars of the research in fundamental physics since many years a new concept of detectors the micro pattern gas detectors allows to overcome many of the problems of other types of commonly used detectors as drift chambers and microstrips reducing the discharge rate and increasing the radiation tolerance among these one of the most commonly used is the gas electron multiplier commonly deployed as fast timing detectors and triggers due to their fast response high rate capability and high radiation hardness they can also be used as trackers the center of gravity readout technique allows to overcome the limit of the digital pads whose spatial resolution is constrained by the pitch size the presence of a high external magnetic field can distort the electronic cloud and affect the spatial resolution the microtpc reconstruction method allows to reconstruct the three dimensional particle position as in a traditional time projection chamber but within a drift gap of a few millimeters this method brings these detectors into a new perspective for what concerns the spatial resolution in strong magnetic field in this report the basis of this new technique will be shown and it will be compared to the traditional center of gravity the results of a series of test beam performed with 10 x 10 cm2 planar prototypes in magnetic field will also be presented this is one of the first implementations of this technique for gem detectors in magnetic field and allows to reach unprecedented performance for gas detectors up to a limit of 120 micron at 1t one of the worlds best results for mpgds in strong magnetic field the microtpc reconstruction has been recently tested at very high rates in a test beam at the mami facility preliminary results of the test will be presented
|
[['gas', 'detectors', 'are', 'one', 'of', 'the', 'pillars', 'of', 'the', 'research', 'in', 'fundamental', 'physics', 'since', 'many', 'years', 'a', 'new', 'concept', 'of', 'detectors', 'the', 'micro', 'pattern', 'gas', 'detectors', 'allows', 'to', 'overcome', 'many', 'of', 'the', 'problems', 'of', 'other', 'types', 'of', 'commonly', 'used', 'detectors', 'as', 'drift', 'chambers', 'and', 'microstrips', 'reducing', 'the', 'discharge', 'rate', 'and', 'increasing', 'the', 'radiation', 'tolerance', 'among', 'these', 'one', 'of', 'the', 'most', 'commonly', 'used', 'is', 'the', 'gas', 'electron', 'multiplier', 'commonly', 'deployed', 'as', 'fast', 'timing', 'detectors', 'and', 'triggers', 'due', 'to', 'their', 'fast', 'response', 'high', 'rate', 'capability', 'and', 'high', 'radiation', 'hardness', 'they', 'can', 'also', 'be', 'used', 'as', 'trackers', 'the', 'center', 'of', 'gravity', 'readout', 'technique', 'allows', 'to', 'overcome', 'the', 'limit', 'of', 'the', 'digital', 'pads', 'whose', 'spatial', 'resolution', 'is', 'constrained', 'by', 'the', 'pitch', 'size', 'the', 'presence', 'of', 'a', 'high', 'external', 'magnetic', 'field', 'can', 'distort', 'the', 'electronic', 'cloud', 'and', 'affect', 'the', 'spatial', 'resolution', 'the', 'microtpc', 'reconstruction', 'method', 'allows', 'to', 'reconstruct', 'the', 'three', 'dimensional', 'particle', 'position', 'as', 'in', 'a', 'traditional', 'time', 'projection', 'chamber', 'but', 'within', 'a', 'drift', 'gap', 'of', 'a', 'few', 'millimeters', 'this', 'method', 'brings', 'these', 'detectors', 'into', 'a', 'new', 'perspective', 'for', 'what', 'concerns', 'the', 'spatial', 'resolution', 'in', 'strong', 'magnetic', 'field', 'in', 'this', 'report', 'the', 'basis', 'of', 'this', 'new', 'technique', 'will', 'be', 'shown', 'and', 'it', 'will', 'be', 'compared', 'to', 'the', 'traditional', 'center', 'of', 'gravity', 'the', 'results', 'of', 'a', 'series', 'of', 'test', 'beam', 'performed', 'with', '10', 'x', '10', 'cm2', 'planar', 'prototypes', 'in', 'magnetic', 'field', 'will', 'also', 'be', 'presented', 'this', 'is', 'one', 'of', 'the', 'first', 'implementations', 'of', 'this', 'technique', 'for', 'gem', 'detectors', 'in', 'magnetic', 'field', 'and', 'allows', 'to', 'reach', 'unprecedented', 'performance', 'for', 'gas', 'detectors', 'up', 'to', 'a', 'limit', 'of', '120', 'micron', 'at', '1t', 'one', 'of', 'the', 'worlds', 'best', 'results', 'for', 'mpgds', 'in', 'strong', 'magnetic', 'field', 'the', 'microtpc', 'reconstruction', 'has', 'been', 'recently', 'tested', 'at', 'very', 'high', 'rates', 'in', 'a', 'test', 'beam', 'at', 'the', 'mami', 'facility', 'preliminary', 'results', 'of', 'the', 'test', 'will', 'be', 'presented']]
|
[-0.0739835119233405, 0.11513469830989553, -0.06276236216241605, 0.02754958194066826, -0.02602788925769165, -0.1294359487854561, -0.009034862858628768, 0.37456637512374397, -0.24198477426027287, -0.36142079884938844, 0.11535990922264631, -0.26534338722900574, -0.04282827304085618, 0.23513569532537412, -0.05289546750711018, 0.08585729110937423, 0.039777702846200455, 0.010156814977279957, -0.07662958514588324, -0.22295581504073464, 0.24156667339917742, 0.14697483577148754, 0.30704107089276544, 0.06122258180191136, 0.14424703028731492, -0.0502873072167473, -0.02818401219841364, 0.0353655171020123, -0.07975781420307444, 0.08925200654471306, 0.2539329858256245, 0.10976662118695614, 0.2645653927955462, -0.45869064353258404, -0.1873924078987233, 0.0496506325319249, 0.1348904872618443, 0.081673091033856, -0.06867609600481016, -0.25600475091980585, 0.08287801930799599, -0.1724310431472143, -0.16723681521441613, -0.029608349574094528, -0.016659197020529468, 0.05389088063519325, -0.23497061079078113, 0.025301109447987406, 0.02199964149159669, 0.016716896389789928, -0.02693438419643543, -0.10882214958230589, 0.0626678903084495, 0.1111173509151385, 0.0289971241365119, 0.06745879812318745, 0.1733013807814445, -0.14781943595743546, -0.10403788276363646, 0.35778428076007807, -0.06543716096430277, -0.16600428574598264, 0.2290468416878312, -0.20930737563075855, -0.10612092105847543, 0.19005105207483006, 0.1885497904774295, 0.10726072961335002, -0.16662690750344822, 0.0409386079168234, 0.020281110760687993, 0.18561237838908734, 0.09835357485656682, 0.0558405559153808, 0.24121160108660847, 0.22698699523207566, 0.0779784995594543, 0.11995701821168595, -0.20091942893472248, -0.0022918184820581106, -0.2633980134381012, -0.18066707388374534, -0.16016825169420473, 0.0012303153739082597, -0.06101398064801354, -0.12561534015515385, 0.3945189048243156, 0.17972508576195162, 0.15199984911372824, -0.04530115669827588, 0.32631299414846193, 0.06689573865729255, 0.13447106108747867, -3.387719903153596e-05, 0.2819502236327736, 0.13790593796952424, 0.1437361826831074, -0.18901633497000678, 0.027747340927853414, 0.017626552441656985]
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.