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.09367
|
Opposition diagrams for automorphisms of small spherical buildings
|
An automorphism $\theta$ of a spherical building $\Delta$ is called
\textit{capped} if it satisfies the following property: if there exist both
type $J_1$ and $J_2$ simplices of $\Delta$ mapped onto opposite simplices by
$\theta$ then there exists a type $J_1\cup J_2$ simplex of $\Delta$ mapped onto
an opposite simplex by $\theta$. In previous work we showed that if $\Delta$ is
a thick irreducible spherical building of rank at least $3$ with no Fano plane
residues then every automorphism of $\Delta$ is capped. In the present work we
consider the spherical buildings with Fano plane residues (the \textit{small
buildings}). We show that uncapped automorphisms exist in these buildings and
develop an enhanced notion of "opposition diagrams" to capture the structure of
these automorphisms. Moreover we provide applications to the theory of
"domesticity" in spherical buildings, including the complete classification of
domestic automorphisms of small buildings of types $\mathsf{F}_4$ and
$\mathsf{E}_6$.
|
math.CO
|
an automorphism theta of a spherical building delta is called textitcapped if it satisfies the following property if there exist both type j_1 and j_2 simplices of delta mapped onto opposite simplices by theta then there exists a type j_1cup j_2 simplex of delta mapped onto an opposite simplex by theta in previous work we showed that if delta is a thick irreducible spherical building of rank at least 3 with no fano plane residues then every automorphism of delta is capped in the present work we consider the spherical buildings with fano plane residues the textitsmall buildings we show that uncapped automorphisms exist in these buildings and develop an enhanced notion of opposition diagrams to capture the structure of these automorphisms moreover we provide applications to the theory of domesticity in spherical buildings including the complete classification of domestic automorphisms of small buildings of types mathsff_4 and mathsfe_6
|
[['an', 'automorphism', 'theta', 'of', 'a', 'spherical', 'building', 'delta', 'is', 'called', 'textitcapped', 'if', 'it', 'satisfies', 'the', 'following', 'property', 'if', 'there', 'exist', 'both', 'type', 'j_1', 'and', 'j_2', 'simplices', 'of', 'delta', 'mapped', 'onto', 'opposite', 'simplices', 'by', 'theta', 'then', 'there', 'exists', 'a', 'type', 'j_1cup', 'j_2', 'simplex', 'of', 'delta', 'mapped', 'onto', 'an', 'opposite', 'simplex', 'by', 'theta', 'in', 'previous', 'work', 'we', 'showed', 'that', 'if', 'delta', 'is', 'a', 'thick', 'irreducible', 'spherical', 'building', 'of', 'rank', 'at', 'least', '3', 'with', 'no', 'fano', 'plane', 'residues', 'then', 'every', 'automorphism', 'of', 'delta', 'is', 'capped', 'in', 'the', 'present', 'work', 'we', 'consider', 'the', 'spherical', 'buildings', 'with', 'fano', 'plane', 'residues', 'the', 'textitsmall', 'buildings', 'we', 'show', 'that', 'uncapped', 'automorphisms', 'exist', 'in', 'these', 'buildings', 'and', 'develop', 'an', 'enhanced', 'notion', 'of', 'opposition', 'diagrams', 'to', 'capture', 'the', 'structure', 'of', 'these', 'automorphisms', 'moreover', 'we', 'provide', 'applications', 'to', 'the', 'theory', 'of', 'domesticity', 'in', 'spherical', 'buildings', 'including', 'the', 'complete', 'classification', 'of', 'domestic', 'automorphisms', 'of', 'small', 'buildings', 'of', 'types', 'mathsff_4', 'and', 'mathsfe_6']]
|
[-0.17085841884194264, 0.1182438481337158, -0.040730379955393484, 0.016952537166372197, -0.04959135783579329, -0.13093630154135413, 0.01990435434714088, 0.38117038749383186, -0.2866469197424835, -0.19598376898673073, 0.0912882983138592, -0.3144227662477, -0.1771417593575436, 0.170391634296112, -0.10987278570035665, -0.08290445341503826, 0.020317801923073572, 0.059953626211740656, -0.1020557934386206, -0.250524912117017, 0.3613877039402723, -0.058357120115823786, 0.1825393629806309, 0.04976561637595296, 0.09751049374583466, 0.03719659850477032, 0.0396561404047855, 0.029954028694794094, -0.1932230251958666, 0.11500831139113368, 0.26528404723724414, 0.07230290424857481, 0.18772256080350228, -0.38565287975622503, -0.14609412913178577, 0.1867592104630352, 0.11782396355611754, 0.0010212337277058898, -0.026489333172553572, -0.21799942580019604, 0.11992915002468588, -0.17591902657636793, -0.19899615946643312, -0.03416967123489956, 0.049297892482919166, -0.0028474984754776134, -0.2219305993142088, 0.019006491929356908, 0.15187758679084223, 0.12036649456311917, 0.006046912388811851, -0.1382991090802283, -0.10471169895107119, 0.12728556700628893, 0.002461627386670945, 0.04099473100444623, 0.08320872546454634, -0.07874294136939891, -0.09290583835481184, 0.3985885517093642, 0.004038199621798663, -0.21965333098738357, 0.11974348293392566, -0.18826466254119215, -0.14219200697181553, 0.12375413598171596, 0.12794938940265826, 0.12976764409726582, -0.05120380357718737, 0.14524124600595378, -0.1054974479536558, 0.1631888190541288, 0.15967500507831572, -0.07151115734595806, 0.17034547801996613, 0.11891928038013906, 0.13504357906379577, 0.14403563787004559, -0.051864860283917395, -0.02876166118035928, -0.31154399410789385, -0.14100010264022597, -0.13679934149961276, 0.09068850478767577, -0.12823041244540445, -0.18755951744729074, 0.32443715513780197, 0.05377831692036627, 0.20265087411510116, 0.043043926159112615, 0.224384050677402, 0.01816215283229369, 0.06362665334138377, 0.0930389464190551, 0.1579521898549564, 0.1527893830122876, -0.043267710836491835, -0.16117960690793678, -0.014457158461726944, 0.13999992529701055]
|
1,803.09368
|
Variations on the $S_n$-module $Lie_n$
|
We define, for each subset $S$ of primes, an $S_n$-module $Lie_n^S$ with
interesting properties. When $S=\emptyset,$ this is the well-known
representation $Lie_n$ of $S_n$ afforded by the free Lie algebra.
The most intriguing case is $S=\{2\},$ giving a decomposition of the regular
representation as a sum of {exterior} powers of modules $Lie_n^{(2)}.$ This is
in contrast to the theorems of Poincar\'e-Birkhoff-Witt and Thrall which
decompose the regular representation into a sum of symmetrised $Lie$ modules.
We show that nearly every known property of $Lie_n$ has a counterpart for the
module $Lie_n^{(2)},$ suggesting connections to the cohomology of configuration
spaces via the character formulas of Sundaram and Welker, to the Eulerian
idempotents of Gerstenhaber and Schack, and to the Hodge decomposition of the
complex of injective words arising from Hochschild homology, due to Hanlon and
Hersh.
For arbitrary $S,$ the symmetric and exterior powers of the module $Lie_n^S$
allow us to deduce Schur positivity for a new class of multiplicity-free sums
of power sums.
|
math.RT math.CO
|
we define for each subset s of primes an s_nmodule lie_ns with interesting properties when semptyset this is the wellknown representation lie_n of s_n afforded by the free lie algebra the most intriguing case is s2 giving a decomposition of the regular representation as a sum of exterior powers of modules lie_n2 this is in contrast to the theorems of poincarebirkhoffwitt and thrall which decompose the regular representation into a sum of symmetrised lie modules we show that nearly every known property of lie_n has a counterpart for the module lie_n2 suggesting connections to the cohomology of configuration spaces via the character formulas of sundaram and welker to the eulerian idempotents of gerstenhaber and schack and to the hodge decomposition of the complex of injective words arising from hochschild homology due to hanlon and hersh for arbitrary s the symmetric and exterior powers of the module lie_ns allow us to deduce schur positivity for a new class of multiplicityfree sums of power sums
|
[['we', 'define', 'for', 'each', 'subset', 's', 'of', 'primes', 'an', 's_nmodule', 'lie_ns', 'with', 'interesting', 'properties', 'when', 'semptyset', 'this', 'is', 'the', 'wellknown', 'representation', 'lie_n', 'of', 's_n', 'afforded', 'by', 'the', 'free', 'lie', 'algebra', 'the', 'most', 'intriguing', 'case', 'is', 's2', 'giving', 'a', 'decomposition', 'of', 'the', 'regular', 'representation', 'as', 'a', 'sum', 'of', 'exterior', 'powers', 'of', 'modules', 'lie_n2', 'this', 'is', 'in', 'contrast', 'to', 'the', 'theorems', 'of', 'poincarebirkhoffwitt', 'and', 'thrall', 'which', 'decompose', 'the', 'regular', 'representation', 'into', 'a', 'sum', 'of', 'symmetrised', 'lie', 'modules', 'we', 'show', 'that', 'nearly', 'every', 'known', 'property', 'of', 'lie_n', 'has', 'a', 'counterpart', 'for', 'the', 'module', 'lie_n2', 'suggesting', 'connections', 'to', 'the', 'cohomology', 'of', 'configuration', 'spaces', 'via', 'the', 'character', 'formulas', 'of', 'sundaram', 'and', 'welker', 'to', 'the', 'eulerian', 'idempotents', 'of', 'gerstenhaber', 'and', 'schack', 'and', 'to', 'the', 'hodge', 'decomposition', 'of', 'the', 'complex', 'of', 'injective', 'words', 'arising', 'from', 'hochschild', 'homology', 'due', 'to', 'hanlon', 'and', 'hersh', 'for', 'arbitrary', 's', 'the', 'symmetric', 'and', 'exterior', 'powers', 'of', 'the', 'module', 'lie_ns', 'allow', 'us', 'to', 'deduce', 'schur', 'positivity', 'for', 'a', 'new', 'class', 'of', 'multiplicityfree', 'sums', 'of', 'power', 'sums']]
|
[-0.15856547682148636, 0.02585996475575305, -0.1012788556907682, 0.04136457084900563, -0.1256952228700849, -0.09617930906676468, -0.005521974975694042, 0.30407992176189547, -0.37465267508086053, -0.20017771555443004, 0.12323343582750909, -0.21956766625402116, -0.1525411415744312, 0.17542500381104376, -0.11749528202769172, -0.04373029156240996, 0.03883240821420595, 0.1098352358809963, -0.09616843752924852, -0.2314366610479025, 0.3845368128056359, 0.008873501110371131, 0.20001444338589527, 0.03803600906093188, 0.13703109625323562, 0.04569499939976699, -0.04350556509871819, -0.03377166010771587, -0.12818659181955194, 0.17715537829834754, 0.29848026652200516, 0.09609794562124903, 0.19705544198162678, -0.3548317854876621, -0.08910832316822308, 0.18515431850623623, 0.12198921764613527, -0.009923238241244227, 0.016642867634035826, -0.260818160973952, 0.11641760112808211, -0.22403706993520628, -0.12333085462651186, -0.0735403399938231, 0.09786076608535116, 0.0303934765742368, -0.28833615271653384, 0.0118183085107642, 0.12800873575767704, 0.06602540343501576, -0.08449884476347762, -0.1353393909491741, -0.0486899026592446, 0.10737233654792687, -0.020988829880300316, 0.007248935248157022, 0.05836723922791885, -0.11232971507984742, -0.15589007367839694, 0.3871330100402331, -0.016816636686848036, -0.20337060590090741, 0.13330759418606283, -0.19216328873269403, -0.15077901521258674, 0.12685233538719726, 0.032216263709554244, 0.14095847775483397, -0.024990867275116627, 0.16969886490857158, -0.1287982190727808, 0.06525218396990376, 0.13700374291177578, 0.04275781223708934, 0.16034110266549192, 0.06008277806322903, 0.07438031826939458, 0.18898408493667745, -0.005803293542592389, -0.025152115107908442, -0.3035295613156038, -0.22595261825711294, -0.13408025859107683, 0.12868449678585217, -0.12156588807616792, -0.20002634842601266, 0.4241039677238341, 0.06285684212306693, 0.16770158176756, 0.1289082048586896, 0.21992075992273583, 0.08712012357461106, 0.10951415055496677, 0.03112972157067103, 0.1008522020783394, 0.2931199886993309, -0.007711624898680836, -0.13068215983955392, -0.020909227242479754, 0.2185947123920889]
|
1,803.09369
|
Towards a Cybernetic Foundation for Natural Resource Governance
|
This study explores the potential of the cybernetic method of inquiry for the
problem of natural resource governance. The systems way of thinking has already
enabled scientists to gain considerable headway in framing global environmental
challenges. On the other hand, technical solutions to environmental problems
have begun to show significant promise, driven by the advent of technology and
its increased proliferation in coupled human and natural systems. Such settings
lie on the interface of engineering, social and environmental sciences, and as
such, require a common language in order for natural resources to be studied,
managed and ultimately sustained. In this dissertation, we argue that the
systems theoretic tradition of cybernetics may provide the necessary common
ground for examining such systems.
After discussing the relevance of the cybernetic approach to natural resource
governance, we present a mathematical model of resource consumption, grounded
in social psychological research on consumer behavior. We also provide
interpretations of the model at various levels of abstraction in the social
network of the consuming population. We demonstrate the potential of the model
by examining it in various theoretic frameworks which include dynamical
systems, optimal control theory, game theory and the theory of learning in
games. Each framework yields different policy guidelines to avoid Tragedy of
the Commons like scenarios in the natural resource system.
|
cs.SY
|
this study explores the potential of the cybernetic method of inquiry for the problem of natural resource governance the systems way of thinking has already enabled scientists to gain considerable headway in framing global environmental challenges on the other hand technical solutions to environmental problems have begun to show significant promise driven by the advent of technology and its increased proliferation in coupled human and natural systems such settings lie on the interface of engineering social and environmental sciences and as such require a common language in order for natural resources to be studied managed and ultimately sustained in this dissertation we argue that the systems theoretic tradition of cybernetics may provide the necessary common ground for examining such systems after discussing the relevance of the cybernetic approach to natural resource governance we present a mathematical model of resource consumption grounded in social psychological research on consumer behavior we also provide interpretations of the model at various levels of abstraction in the social network of the consuming population we demonstrate the potential of the model by examining it in various theoretic frameworks which include dynamical systems optimal control theory game theory and the theory of learning in games each framework yields different policy guidelines to avoid tragedy of the commons like scenarios in the natural resource system
|
[['this', 'study', 'explores', 'the', 'potential', 'of', 'the', 'cybernetic', 'method', 'of', 'inquiry', 'for', 'the', 'problem', 'of', 'natural', 'resource', 'governance', 'the', 'systems', 'way', 'of', 'thinking', 'has', 'already', 'enabled', 'scientists', 'to', 'gain', 'considerable', 'headway', 'in', 'framing', 'global', 'environmental', 'challenges', 'on', 'the', 'other', 'hand', 'technical', 'solutions', 'to', 'environmental', 'problems', 'have', 'begun', 'to', 'show', 'significant', 'promise', 'driven', 'by', 'the', 'advent', 'of', 'technology', 'and', 'its', 'increased', 'proliferation', 'in', 'coupled', 'human', 'and', 'natural', 'systems', 'such', 'settings', 'lie', 'on', 'the', 'interface', 'of', 'engineering', 'social', 'and', 'environmental', 'sciences', 'and', 'as', 'such', 'require', 'a', 'common', 'language', 'in', 'order', 'for', 'natural', 'resources', 'to', 'be', 'studied', 'managed', 'and', 'ultimately', 'sustained', 'in', 'this', 'dissertation', 'we', 'argue', 'that', 'the', 'systems', 'theoretic', 'tradition', 'of', 'cybernetics', 'may', 'provide', 'the', 'necessary', 'common', 'ground', 'for', 'examining', 'such', 'systems', 'after', 'discussing', 'the', 'relevance', 'of', 'the', 'cybernetic', 'approach', 'to', 'natural', 'resource', 'governance', 'we', 'present', 'a', 'mathematical', 'model', 'of', 'resource', 'consumption', 'grounded', 'in', 'social', 'psychological', 'research', 'on', 'consumer', 'behavior', 'we', 'also', 'provide', 'interpretations', 'of', 'the', 'model', 'at', 'various', 'levels', 'of', 'abstraction', 'in', 'the', 'social', 'network', 'of', 'the', 'consuming', 'population', 'we', 'demonstrate', 'the', 'potential', 'of', 'the', 'model', 'by', 'examining', 'it', 'in', 'various', 'theoretic', 'frameworks', 'which', 'include', 'dynamical', 'systems', 'optimal', 'control', 'theory', 'game', 'theory', 'and', 'the', 'theory', 'of', 'learning', 'in', 'games', 'each', 'framework', 'yields', 'different', 'policy', 'guidelines', 'to', 'avoid', 'tragedy', 'of', 'the', 'commons', 'like', 'scenarios', 'in', 'the', 'natural', 'resource', 'system']]
|
[-0.10307841519929774, 0.0334207547897224, -0.0808421606090658, 0.08004155226399444, -0.0800514464923245, -0.13450832848884015, 0.07909587261960134, 0.35675890380645403, -0.28838315624572025, -0.34445603382408896, 0.09026919944106691, -0.23175776949847623, -0.214450941680746, 0.1994148158583112, -0.13762234620672698, 0.06628158368349445, 0.04212958142504714, 0.034210189616078, 0.021159979101691033, -0.23494461730277072, 0.31923848768741253, 0.0417902189122367, 0.3420451909855163, 0.09078055004318876, 0.08741062613684804, -0.012521004050000128, -0.03829102037465929, 0.0029012750880363556, -0.11138197370662814, 0.18197627676906244, 0.3174382906432869, 0.24752456131685618, 0.40444742110536397, -0.47646608143564195, -0.2530987735586627, 0.08387355085279662, 0.11990256220035787, 0.10018584713466414, -0.05044761503465079, -0.3046055723599712, 0.043933499357684556, -0.22073039398120914, -0.10454354769537388, -0.08611989644579246, 0.009952744640718957, -0.002872067598050915, -0.20856730471051851, 0.015179861576617201, 0.028784530850375193, 0.13225536407207564, -0.07246407219648687, -0.1141085874698069, 0.0072261181344548545, 0.18800180233276798, 0.06328197231479761, -0.021307846749617724, 0.15210072661230709, -0.19482749293897353, -0.16833078982587474, 0.42476206700304686, 0.0019409098999879498, -0.14667126519738563, 0.24633509164444312, -0.07700632864497774, -0.1844105804178779, 0.025985152718143254, 0.22010105795791365, 0.0541593125808881, -0.18464485297091135, 0.08046095871338664, 0.006886761060439496, 0.13664447025434556, 0.03181731993598597, 0.07017539118626906, 0.2178929946449701, 0.23597638130033483, 0.08858869270682292, 0.11103923752027337, 0.04732348999380851, -0.1565402917497392, -0.23240430030997516, -0.15650325552624766, -0.11043996310659818, 0.019609989193890433, -0.057467889690515264, -0.12258177226911458, 0.3830671226133674, 0.20750032589622786, 0.08970409683284483, 0.010989304364917473, 0.2846294505229812, 0.0803986550668203, 0.06529621260609769, 0.021769834741894242, 0.17806843906310538, 0.042551525443586334, 0.18530513815289956, -0.2042382886410103, 0.06770989740662242, -0.01744077425591716]
|
1,803.0937
|
Popular Matching in Roommates Setting is NP-hard
|
An input to the Popular Matching problem, in the roommates setting, consists
of a graph $G$ and each vertex ranks its neighbors in strict order, known as
its preference. In the Popular Matching problem the objective is to test
whether there exists a matching $M^\star$ such that there is no matching $M$
where more people are happier with $M$ than with $M^\star$. In this paper we
settle the computational complexity of the Popular Matching problem in the
roommates setting by showing that the problem is NP-complete. Thus, we resolve
an open question that has been repeatedly, explicitly asked over the last
decade.
|
cs.DS cs.CC cs.GT
|
an input to the popular matching problem in the roommates setting consists of a graph g and each vertex ranks its neighbors in strict order known as its preference in the popular matching problem the objective is to test whether there exists a matching mstar such that there is no matching m where more people are happier with m than with mstar in this paper we settle the computational complexity of the popular matching problem in the roommates setting by showing that the problem is npcomplete thus we resolve an open question that has been repeatedly explicitly asked over the last decade
|
[['an', 'input', 'to', 'the', 'popular', 'matching', 'problem', 'in', 'the', 'roommates', 'setting', 'consists', 'of', 'a', 'graph', 'g', 'and', 'each', 'vertex', 'ranks', 'its', 'neighbors', 'in', 'strict', 'order', 'known', 'as', 'its', 'preference', 'in', 'the', 'popular', 'matching', 'problem', 'the', 'objective', 'is', 'to', 'test', 'whether', 'there', 'exists', 'a', 'matching', 'mstar', 'such', 'that', 'there', 'is', 'no', 'matching', 'm', 'where', 'more', 'people', 'are', 'happier', 'with', 'm', 'than', 'with', 'mstar', 'in', 'this', 'paper', 'we', 'settle', 'the', 'computational', 'complexity', 'of', 'the', 'popular', 'matching', 'problem', 'in', 'the', 'roommates', 'setting', 'by', 'showing', 'that', 'the', 'problem', 'is', 'npcomplete', 'thus', 'we', 'resolve', 'an', 'open', 'question', 'that', 'has', 'been', 'repeatedly', 'explicitly', 'asked', 'over', 'the', 'last', 'decade']]
|
[-0.11022332337497752, 0.03342685853296608, -0.034108424495321275, 0.07818332442091595, -0.11150787552983008, -0.1391906792950798, 0.05755065840454407, 0.42392859611587197, -0.2669484228644447, -0.3605261102830078, 0.11515216709128306, -0.30170777168435353, -0.15527395030663932, 0.13378594371983232, -0.1364306551723869, 0.05004515405630181, 0.06418026461466855, 0.11322452673944187, -0.0051292626246554306, -0.3572282275420673, 0.3329182902634071, -0.004544635008856216, 0.20636702249027497, 0.038939045148664246, 0.10126907657261244, 0.014353368055833248, 0.006100123679703649, 0.06066489828677446, -0.12930382642769153, 0.08811752228226111, 0.3115093489634056, 0.20051302454735645, 0.3708816495924896, -0.36504147609001864, -0.1426081221788099, 0.20169898396353328, 0.13864844262727774, 0.05532248434610665, -0.06027160181653088, -0.18939469158923364, 0.13920946195881412, -0.11585492173018043, -0.04187825814747781, 0.034296567967234584, 0.10693796021480333, -0.09996023220831857, -0.2686265238889438, 0.00420071441205401, 0.06540484467119563, 0.01385772073933599, 0.0020561391674895203, -0.11397628257434596, 0.0202033955366442, 0.16231801387324346, 0.04994989906245952, 0.11199537814850462, 0.002680663832043316, -0.16911904943659536, -0.15125757658582492, 0.4312783670702986, -0.019446586874597844, -0.16521015317138174, 0.1864966758682082, -0.07431790186548788, -0.1609533683935582, 0.07542162200472519, 0.11314972687293501, 0.15183219094486797, -0.12992397795103755, 0.1242649387014692, -0.18884196146117413, 0.18996205385751547, 0.13920872433421513, -0.041292070056193085, 0.1719587340074427, 0.21167303564017823, 0.17861989563257963, 0.1295674137734607, 0.018033793250865796, -0.04118317637053848, -0.18492669844086848, -0.09409001165562693, -0.18765157980698288, -0.002102685809208482, -0.08525862987138966, -0.16453704515052045, 0.3722766248290153, 0.16485206437452385, 0.1947063009857255, 0.0793534515964269, 0.3009000283554105, 0.10686831693416096, 0.04397622824591749, 0.16736506461622377, 0.17094028337548176, 0.09007251450070637, 0.03265266836616302, -0.1716033189931848, 0.09505324353527862, 0.06320671334534007]
|
1,803.09371
|
StaQC: A Systematically Mined Question-Code Dataset from Stack Overflow
|
Stack Overflow (SO) has been a great source of natural language questions and
their code solutions (i.e., question-code pairs), which are critical for many
tasks including code retrieval and annotation. In most existing research,
question-code pairs were collected heuristically and tend to have low quality.
In this paper, we investigate a new problem of systematically mining
question-code pairs from Stack Overflow (in contrast to heuristically
collecting them). It is formulated as predicting whether or not a code snippet
is a standalone solution to a question. We propose a novel Bi-View Hierarchical
Neural Network which can capture both the programming content and the textual
context of a code snippet (i.e., two views) to make a prediction. On two
manually annotated datasets in Python and SQL domain, our framework
substantially outperforms heuristic methods with at least 15% higher F1 and
accuracy. Furthermore, we present StaQC (Stack Overflow Question-Code pairs),
the largest dataset to date of ~148K Python and ~120K SQL question-code pairs,
automatically mined from SO using our framework. Under various case studies, we
demonstrate that StaQC can greatly help develop data-hungry models for
associating natural language with programming language.
|
cs.CL
|
stack overflow so has been a great source of natural language questions and their code solutions ie questioncode pairs which are critical for many tasks including code retrieval and annotation in most existing research questioncode pairs were collected heuristically and tend to have low quality in this paper we investigate a new problem of systematically mining questioncode pairs from stack overflow in contrast to heuristically collecting them it is formulated as predicting whether or not a code snippet is a standalone solution to a question we propose a novel biview hierarchical neural network which can capture both the programming content and the textual context of a code snippet ie two views to make a prediction on two manually annotated datasets in python and sql domain our framework substantially outperforms heuristic methods with at least 15 higher f1 and accuracy furthermore we present staqc stack overflow questioncode pairs the largest dataset to date of 148k python and 120k sql questioncode pairs automatically mined from so using our framework under various case studies we demonstrate that staqc can greatly help develop datahungry models for associating natural language with programming language
|
[['stack', 'overflow', 'so', 'has', 'been', 'a', 'great', 'source', 'of', 'natural', 'language', 'questions', 'and', 'their', 'code', 'solutions', 'ie', 'questioncode', 'pairs', 'which', 'are', 'critical', 'for', 'many', 'tasks', 'including', 'code', 'retrieval', 'and', 'annotation', 'in', 'most', 'existing', 'research', 'questioncode', 'pairs', 'were', 'collected', 'heuristically', 'and', 'tend', 'to', 'have', 'low', 'quality', 'in', 'this', 'paper', 'we', 'investigate', 'a', 'new', 'problem', 'of', 'systematically', 'mining', 'questioncode', 'pairs', 'from', 'stack', 'overflow', 'in', 'contrast', 'to', 'heuristically', 'collecting', 'them', 'it', 'is', 'formulated', 'as', 'predicting', 'whether', 'or', 'not', 'a', 'code', 'snippet', 'is', 'a', 'standalone', 'solution', 'to', 'a', 'question', 'we', 'propose', 'a', 'novel', 'biview', 'hierarchical', 'neural', 'network', 'which', 'can', 'capture', 'both', 'the', 'programming', 'content', 'and', 'the', 'textual', 'context', 'of', 'a', 'code', 'snippet', 'ie', 'two', 'views', 'to', 'make', 'a', 'prediction', 'on', 'two', 'manually', 'annotated', 'datasets', 'in', 'python', 'and', 'sql', 'domain', 'our', 'framework', 'substantially', 'outperforms', 'heuristic', 'methods', 'with', 'at', 'least', '15', 'higher', 'f1', 'and', 'accuracy', 'furthermore', 'we', 'present', 'staqc', 'stack', 'overflow', 'questioncode', 'pairs', 'the', 'largest', 'dataset', 'to', 'date', 'of', '148k', 'python', 'and', '120k', 'sql', 'questioncode', 'pairs', 'automatically', 'mined', 'from', 'so', 'using', 'our', 'framework', 'under', 'various', 'case', 'studies', 'we', 'demonstrate', 'that', 'staqc', 'can', 'greatly', 'help', 'develop', 'datahungry', 'models', 'for', 'associating', 'natural', 'language', 'with', 'programming', 'language']]
|
[-0.06328818687166937, -0.02462908110844538, -0.03186161182795489, 0.11554572803256831, -0.13674921809338822, -0.18350453470813352, 0.07993978384879681, 0.42741783933319233, -0.2888161224223238, -0.3860220315147434, 0.09326403823386341, -0.32424748587199365, -0.10744604503649854, 0.218212557638965, -0.09974507399222246, 0.06503567866433435, 0.13113988054860587, 0.04348551418186854, -0.04339318910902164, -0.29471050644275715, 0.32164463157760503, 0.030069040825448767, 0.3183909078159005, 0.05144577879685169, 0.07445593041642418, -0.04891737500894005, -0.032847048991243355, -0.0009630100286575844, -0.06456718176152366, 0.16537006934864304, 0.3326294980230831, 0.2543713869792713, 0.29842249551059113, -0.3860554514407261, -0.1892616971011233, 0.038640830006561766, 0.17275930738010767, 0.14009107309894994, -0.0341037741125784, -0.28927327780326345, 0.14640519262368046, -0.21602591502470087, 0.04167239117542403, -0.10452046395664144, -0.0030426866822223096, -0.02044761725752007, -0.2384461586714125, -0.03539311770557264, 0.05290260548834973, 0.10026982072715486, -0.02209821882348953, -0.09636234739066465, -0.0012111674124911508, 0.1454766171050521, 0.02967491546271207, 0.07744675963286958, 0.10088774990657365, -0.13607491604583946, -0.15290889522040504, 0.3943701293623156, -0.057067760187909815, -0.2050288850137883, 0.24386118440230822, -0.023610644554972405, -0.1449782313708135, 0.08781928200345568, 0.22518576377921778, 0.14990649217456256, -0.19786070099191577, 0.02722081446272964, -0.04183281575451079, 0.23132895726872527, 0.09354644458811812, -0.026165023920602045, 0.24108159300901563, 0.21580335158733246, -0.04745034088852623, 0.15343181353629284, -0.07227628860441061, -0.030298718258880242, -0.19953419775170597, -0.13451012776172516, -0.11987875186858456, -0.021928392465744528, -0.02997892336996143, -0.16416910005753618, 0.36954260957629786, 0.2207663539675591, 0.17708051929999466, 0.07676229013557768, 0.3017747379414251, 0.02076470266847932, 0.12133464412434715, 0.11696752608733495, 0.1013942220673451, -0.03293736098693562, 0.12153961599814585, -0.13072575216432122, 0.08584105187480379, 0.05142160308668795]
|
1,803.09372
|
Time-Dispersive Behaviour as a Feature of Critical Contrast Media
|
Motivated by the urgent need to attribute a rigorous mathematical meaning to
the term "metamaterial", we propose a novel approach to the homogenisation of
critical-contrast composites. This is based on the asymptotic analysis of the
Dirichlet-to-Neumann map on the interface between different components ("stiff"
and "soft") of the medium, which leads to an asymptotic approximation of
eigenmodes. This allows us to see that the presence of the soft component makes
the stiff one behave as a class of time-dispersive media. By an inversion of
this argument, we also offer a recipe for the construction of such media with
prescribed dispersive properties from periodic composites.
|
math-ph cond-mat.mtrl-sci math.MP
|
motivated by the urgent need to attribute a rigorous mathematical meaning to the term metamaterial we propose a novel approach to the homogenisation of criticalcontrast composites this is based on the asymptotic analysis of the dirichlettoneumann map on the interface between different components stiff and soft of the medium which leads to an asymptotic approximation of eigenmodes this allows us to see that the presence of the soft component makes the stiff one behave as a class of timedispersive media by an inversion of this argument we also offer a recipe for the construction of such media with prescribed dispersive properties from periodic composites
|
[['motivated', 'by', 'the', 'urgent', 'need', 'to', 'attribute', 'a', 'rigorous', 'mathematical', 'meaning', 'to', 'the', 'term', 'metamaterial', 'we', 'propose', 'a', 'novel', 'approach', 'to', 'the', 'homogenisation', 'of', 'criticalcontrast', 'composites', 'this', 'is', 'based', 'on', 'the', 'asymptotic', 'analysis', 'of', 'the', 'dirichlettoneumann', 'map', 'on', 'the', 'interface', 'between', 'different', 'components', 'stiff', 'and', 'soft', 'of', 'the', 'medium', 'which', 'leads', 'to', 'an', 'asymptotic', 'approximation', 'of', 'eigenmodes', 'this', 'allows', 'us', 'to', 'see', 'that', 'the', 'presence', 'of', 'the', 'soft', 'component', 'makes', 'the', 'stiff', 'one', 'behave', 'as', 'a', 'class', 'of', 'timedispersive', 'media', 'by', 'an', 'inversion', 'of', 'this', 'argument', 'we', 'also', 'offer', 'a', 'recipe', 'for', 'the', 'construction', 'of', 'such', 'media', 'with', 'prescribed', 'dispersive', 'properties', 'from', 'periodic', 'composites']]
|
[-0.11685257391610111, 0.07259872537850662, -0.13240008620330349, 0.0037036737216672357, -0.14325205146227604, -0.09257587207517085, 0.05161776137202441, 0.36237333526010984, -0.2771719579322962, -0.2936424675863236, 0.0930515554030605, -0.2610038723238316, -0.19737812977893135, 0.15661979634135675, -0.042967571621724904, 0.05401483523578813, -0.007467379686064445, -0.008527460346858088, -0.0490957232832443, -0.12879510519381326, 0.3519407607762752, 0.03308621698614353, 0.28312856935036296, 0.06184057588689029, 0.10864515212149574, 0.012452966860459687, -0.032997632723821044, -0.006490148835627434, -0.1088296555438389, 0.1828873386257328, 0.215599188379621, 0.037372417927074894, 0.26894650842027307, -0.43639724026434124, -0.22040130824601734, 0.07009176369040059, 0.13251915112134435, 0.11777569149741723, -0.02237109130006642, -0.24937988965449712, 0.07373043665966879, -0.1642109002882185, -0.1911932885324439, -0.0926635747578425, -0.010880056714925628, 0.008697283579609714, -0.26418802959960885, 0.07026553467613457, 0.09892345912969457, 0.0162525841822991, -0.06123576698379251, -0.05847983716431862, 0.03650874429597305, 0.11472961474030924, 0.07906557130851209, -0.04495564201184047, 0.07884163306936479, -0.13700464422492167, -0.04499714715012278, 0.3813285105682623, -0.06539696490821931, -0.20467503948916252, 0.21541080349505556, -0.047616294459798016, -0.09717647957418543, 0.14171657697834933, 0.18304702992407748, 0.1199782025651075, -0.17091339696736002, 0.04675581200941591, -0.04625316576745648, 0.1990596681045225, 0.048558864048503056, 0.01516247863540999, 0.18649840880579388, 0.1812122872663447, 0.06495967681250757, 0.18975832054498964, -0.03308447788003832, -0.03710733709774034, -0.3101951233827724, -0.18168372835750163, -0.14749255597752592, 0.07718283629443388, -0.11709994107723805, -0.2594539927623163, 0.3884622328914702, 0.15534883274589306, 0.19204092218513744, 0.0372306813425474, 0.28156431237361035, 0.12537118566083685, 0.04406679609494928, 0.035024161831153415, 0.24786896565078329, 0.13594488420998319, 0.12203322132700123, -0.19575788046887072, 0.0345132904789912, 0.09020243348249306]
|
1,803.09373
|
The continuous dependence for the Hal-MHD equations with fractional
magnetic diffusion
|
In this paper we show that the solutions to the incompressible Hall-MHD
system with fractional magnetic diffusion depend continuously on the initial
data in $H^s(\mathbb{R}^d)$, $s>1+\frac{d}{2}$.
|
math.AP
|
in this paper we show that the solutions to the incompressible hallmhd system with fractional magnetic diffusion depend continuously on the initial data in hsmathbbrd s1fracd2
|
[['in', 'this', 'paper', 'we', 'show', 'that', 'the', 'solutions', 'to', 'the', 'incompressible', 'hallmhd', 'system', 'with', 'fractional', 'magnetic', 'diffusion', 'depend', 'continuously', 'on', 'the', 'initial', 'data', 'in', 'hsmathbbrd', 's1fracd2']]
|
[-0.14952392244711518, 0.10621377225965262, -0.06330075925216079, -0.012382940459065139, -0.02803500762209296, -0.05564918637275696, -0.06634282189887017, 0.33310791105031967, -0.3061619970202446, -0.2801953101158142, 0.16059623249806465, -0.26335847809910773, -0.11969153314828873, 0.19781490735709667, -0.06765326172113419, 0.09419076703488827, 0.07462743576616049, -0.0015327405650168656, -0.053604635065421465, -0.23385708406567574, 0.4181076407432556, -0.05999072767794132, 0.25866429433226584, -0.015421074032783508, 0.09639083322603255, -0.08177590058185161, 0.03198310069739819, 0.03633071504533291, -0.24300518275384092, 0.05174807727336884, 0.16744744658470154, -0.007357304338365793, 0.24212952107191085, -0.4862730544805527, -0.19640287734568118, 0.06787736654281616, 0.16563265264034271, 0.11420370861887932, -0.03811190376523882, -0.28824090756475923, 0.06602273501455784, -0.13054289907217026, -0.12110562972724438, -0.06662687163800002, 0.03719681017100811, 0.1415107038617134, -0.311470450386405, 0.13440696097910404, 0.07910682335495949, 0.0010318228229880334, -0.22752307441085576, -0.061392954080365596, -0.018747962638735773, 0.04916118748486042, 0.09777123402804136, 0.04849077196791768, 0.0626290417648852, -0.1461051772069186, -0.05069103635847569, 0.31706089168787005, -0.1335494611505419, -0.3182642395049334, 0.17483716070652008, -0.2650947872549295, -0.13957903731614352, 0.12271118633449078, 0.21903126331046224, 0.10449688479304314, -0.11789337746798992, 0.10018194541335106, -0.07011269718408585, 0.1948365045338869, -0.019290959648787975, -0.026125904936343432, 0.09183597267605365, 0.1909612313657999, 0.11836558111477644, 0.11829977318644523, -0.07970833363942802, -0.10094695761799813, -0.30152380183339117, -0.19721675593405963, -0.19716739892959595, 0.07895611554384231, -0.0648733814433217, -0.22219764024019242, 0.34950311839580533, 0.2705087862163782, 0.1626926538348198, 0.0064799003675580025, 0.25052211293950677, 0.16776826914399862, -0.0347591520100832, 0.16913212716579437, 0.2366435246169567, 0.06150855466723442, 0.2620076406188309, -0.28974677514284847, 0.023449926078319548, 0.08652347572147846]
|
1,803.09374
|
Generalized Hadamard-Product Fusion Operators for Visual Question
Answering
|
We propose a generalized class of multimodal fusion operators for the task of
visual question answering (VQA). We identify generalizations of existing
multimodal fusion operators based on the Hadamard product, and show that
specific non-trivial instantiations of this generalized fusion operator exhibit
superior performance in terms of OpenEnded accuracy on the VQA task. In
particular, we introduce Nonlinearity Ensembling, Feature Gating, and
post-fusion neural network layers as fusion operator components, culminating in
an absolute percentage point improvement of $1.1\%$ on the VQA 2.0 test-dev set
over baseline fusion operators, which use the same features as input. We use
our findings as evidence that our generalized class of fusion operators could
lead to the discovery of even superior task-specific operators when used as a
search space in an architecture search over fusion operators.
|
cs.LG cs.CV stat.ML
|
we propose a generalized class of multimodal fusion operators for the task of visual question answering vqa we identify generalizations of existing multimodal fusion operators based on the hadamard product and show that specific nontrivial instantiations of this generalized fusion operator exhibit superior performance in terms of openended accuracy on the vqa task in particular we introduce nonlinearity ensembling feature gating and postfusion neural network layers as fusion operator components culminating in an absolute percentage point improvement of 11 on the vqa 20 testdev set over baseline fusion operators which use the same features as input we use our findings as evidence that our generalized class of fusion operators could lead to the discovery of even superior taskspecific operators when used as a search space in an architecture search over fusion operators
|
[['we', 'propose', 'a', 'generalized', 'class', 'of', 'multimodal', 'fusion', 'operators', 'for', 'the', 'task', 'of', 'visual', 'question', 'answering', 'vqa', 'we', 'identify', 'generalizations', 'of', 'existing', 'multimodal', 'fusion', 'operators', 'based', 'on', 'the', 'hadamard', 'product', 'and', 'show', 'that', 'specific', 'nontrivial', 'instantiations', 'of', 'this', 'generalized', 'fusion', 'operator', 'exhibit', 'superior', 'performance', 'in', 'terms', 'of', 'openended', 'accuracy', 'on', 'the', 'vqa', 'task', 'in', 'particular', 'we', 'introduce', 'nonlinearity', 'ensembling', 'feature', 'gating', 'and', 'postfusion', 'neural', 'network', 'layers', 'as', 'fusion', 'operator', 'components', 'culminating', 'in', 'an', 'absolute', 'percentage', 'point', 'improvement', 'of', '11', 'on', 'the', 'vqa', '20', 'testdev', 'set', 'over', 'baseline', 'fusion', 'operators', 'which', 'use', 'the', 'same', 'features', 'as', 'input', 'we', 'use', 'our', 'findings', 'as', 'evidence', 'that', 'our', 'generalized', 'class', 'of', 'fusion', 'operators', 'could', 'lead', 'to', 'the', 'discovery', 'of', 'even', 'superior', 'taskspecific', 'operators', 'when', 'used', 'as', 'a', 'search', 'space', 'in', 'an', 'architecture', 'search', 'over', 'fusion', 'operators']]
|
[-0.03827275200000473, 0.013145592858355478, -0.012167332036321173, 0.053660937777999435, -0.08570296684535973, -0.14354536363869222, 0.04526887604796136, 0.4282215355241401, -0.25956732293462936, -0.2662828731402143, 0.05871728118437961, -0.25796938017152876, -0.1935958172201769, 0.19695347934278823, -0.13503675370384718, 0.07341518503691973, 0.15545700046408012, 0.08938805201403682, -0.08587619946813672, -0.29020478902206903, 0.3734209509708613, 0.03423542741469271, 0.32246467751230445, 0.07012151736225791, 0.12941911909018308, 0.002162919501073744, -0.03555333226357537, -0.05425294157840091, -0.023483892323876703, 0.1838878328265011, 0.3076060124822245, 0.15047423839249172, 0.2962448157313216, -0.35431528494529824, -0.20948953398339848, 0.12409715148360817, 0.15607664515157693, 0.029885031219806436, -0.04256997289374215, -0.3411760966627652, 0.07516684550489833, -0.22582453418210263, 0.0021051115779391, -0.16847592753354632, -9.513465787163217e-05, -0.021149422087838148, -0.32667488345826573, 0.023777135228382724, 0.12647320343650706, 0.06630105060838049, -0.1002951378521744, -0.14587984452351133, 0.03868741758757818, 0.11282878495572413, -0.038929654530583675, 0.044156765878086784, 0.13667142257904846, -0.17879555933355204, -0.20509754472060257, 0.3282328435923648, -0.10493902017127808, -0.23026855225952073, 0.19287125086091914, -0.04657941478667141, -0.1448287535753035, 0.03434135138682794, 0.22040935750794774, 0.14133916577708175, -0.12803252678213886, 0.029754668133838088, -0.08308475933087464, 0.14187617057633145, 0.09322600612658581, 0.07129710744924218, 0.1409946941710184, 0.23167720840504494, 0.08219547877180389, 0.14641449666574938, -0.08816756338115696, -0.0854523410302594, -0.27707917698239554, -0.1352794321986157, -0.10446380816741299, 0.017494360966081837, -0.08939983048773982, -0.1687044721907218, 0.4489548653328635, 0.23094025458120795, 0.2453832076613628, 0.07546450672688972, 0.2507762123354291, 0.07781400159456792, 0.15288696107490143, 0.05505916599507749, 0.16577284640227338, 0.044442933777930176, 0.09756417602179786, -0.16078079349667063, 0.035075983462698815, 0.13494810086625222]
|
1,803.09375
|
Correcting differences in multi-site neuroimaging data using Generative
Adversarial Networks
|
Magnetic Resonance Imaging (MRI) of the brain has been used to investigate a
wide range of neurological disorders, but data acquisition can be expensive,
time-consuming, and inconvenient. Multi-site studies present a valuable
opportunity to advance research by pooling data in order to increase
sensitivity and statistical power. However images derived from MRI are
susceptible to both obvious and non-obvious differences between sites which can
introduce bias and subject variance, and so reduce statistical power. To
rectify these differences, we propose a data driven approach using a deep
learning architecture known as generative adversarial networks (GANs). GANs
learn to estimate two distributions, and can then be used to transform examples
from one distribution into the other distribution. Here we transform
T1-weighted brain images collected from two different sites into MR images from
the same site. We evaluate whether our model can reduce site-specific
differences without loss of information related to gender (male, female) or
clinical diagnosis (schizophrenia, bipolar disorder, healthy). When trained
appropriately, our model is able to normalise imaging sets to a common scanner
set with less information loss compared to current approaches. An important
advantage is our method can be treated as a black box that does not require any
knowledge of the sources of bias but only needs at least two distinct imaging
sets.
|
cs.CV
|
magnetic resonance imaging mri of the brain has been used to investigate a wide range of neurological disorders but data acquisition can be expensive timeconsuming and inconvenient multisite studies present a valuable opportunity to advance research by pooling data in order to increase sensitivity and statistical power however images derived from mri are susceptible to both obvious and nonobvious differences between sites which can introduce bias and subject variance and so reduce statistical power to rectify these differences we propose a data driven approach using a deep learning architecture known as generative adversarial networks gans gans learn to estimate two distributions and can then be used to transform examples from one distribution into the other distribution here we transform t1weighted brain images collected from two different sites into mr images from the same site we evaluate whether our model can reduce sitespecific differences without loss of information related to gender male female or clinical diagnosis schizophrenia bipolar disorder healthy when trained appropriately our model is able to normalise imaging sets to a common scanner set with less information loss compared to current approaches an important advantage is our method can be treated as a black box that does not require any knowledge of the sources of bias but only needs at least two distinct imaging sets
|
[['magnetic', 'resonance', 'imaging', 'mri', 'of', 'the', 'brain', 'has', 'been', 'used', 'to', 'investigate', 'a', 'wide', 'range', 'of', 'neurological', 'disorders', 'but', 'data', 'acquisition', 'can', 'be', 'expensive', 'timeconsuming', 'and', 'inconvenient', 'multisite', 'studies', 'present', 'a', 'valuable', 'opportunity', 'to', 'advance', 'research', 'by', 'pooling', 'data', 'in', 'order', 'to', 'increase', 'sensitivity', 'and', 'statistical', 'power', 'however', 'images', 'derived', 'from', 'mri', 'are', 'susceptible', 'to', 'both', 'obvious', 'and', 'nonobvious', 'differences', 'between', 'sites', 'which', 'can', 'introduce', 'bias', 'and', 'subject', 'variance', 'and', 'so', 'reduce', 'statistical', 'power', 'to', 'rectify', 'these', 'differences', 'we', 'propose', 'a', 'data', 'driven', 'approach', 'using', 'a', 'deep', 'learning', 'architecture', 'known', 'as', 'generative', 'adversarial', 'networks', 'gans', 'gans', 'learn', 'to', 'estimate', 'two', 'distributions', 'and', 'can', 'then', 'be', 'used', 'to', 'transform', 'examples', 'from', 'one', 'distribution', 'into', 'the', 'other', 'distribution', 'here', 'we', 'transform', 't1weighted', 'brain', 'images', 'collected', 'from', 'two', 'different', 'sites', 'into', 'mr', 'images', 'from', 'the', 'same', 'site', 'we', 'evaluate', 'whether', 'our', 'model', 'can', 'reduce', 'sitespecific', 'differences', 'without', 'loss', 'of', 'information', 'related', 'to', 'gender', 'male', 'female', 'or', 'clinical', 'diagnosis', 'schizophrenia', 'bipolar', 'disorder', 'healthy', 'when', 'trained', 'appropriately', 'our', 'model', 'is', 'able', 'to', 'normalise', 'imaging', 'sets', 'to', 'a', 'common', 'scanner', 'set', 'with', 'less', 'information', 'loss', 'compared', 'to', 'current', 'approaches', 'an', 'important', 'advantage', 'is', 'our', 'method', 'can', 'be', 'treated', 'as', 'a', 'black', 'box', 'that', 'does', 'not', 'require', 'any', 'knowledge', 'of', 'the', 'sources', 'of', 'bias', 'but', 'only', 'needs', 'at', 'least', 'two', 'distinct', 'imaging', 'sets']]
|
[0.0034362487753646243, 0.045042300209388486, -0.07445305019064108, 0.13963581603861208, -0.1252873022178257, -0.18588423352102162, 0.02492210824210714, 0.4435977107517559, -0.2701154684505632, -0.3588883533763389, 0.096144339929365, -0.30341759452992983, -0.1684501991282256, 0.19594434900230867, -0.13098545395122427, 0.04065293353697699, 0.10886296577572702, 0.026416250021645316, -0.02700499562801, -0.2506902088902684, 0.28430541643993584, 0.028127565019396436, 0.3265461123018112, 0.004317126099421229, 0.09092599898900112, -0.04418205486985648, -0.013341709126338915, 0.032748175483127986, -0.07445915362111716, 0.12255776450089158, 0.320311484236434, 0.19484190250794334, 0.3488738437687668, -0.46984102896897606, -0.2428618528879101, 0.14004064662246188, 0.18149281698235967, 0.10813043492089491, -0.038271222686658064, -0.3068019274473449, 0.08293385744629497, -0.13413943136725315, -0.014226760129935833, -0.13055237775552087, -0.045506679660455254, -0.020258274884933297, -0.32080414193182216, 0.09456485707670692, 0.013586538432045254, 0.1014793809649914, -0.0639973559020156, -0.11978718135462797, -0.023948395218381106, 0.21139012250676859, 0.05922374507537353, 0.07437108620730147, 0.1621236541799994, -0.150342649748651, -0.11604968603825438, 0.32013532948891493, 0.005229385555139743, -0.20358034692644314, 0.21506794434713405, -0.1288482272465006, -0.09791080687514127, 0.11741696989365327, 0.22117177095410792, 0.07973515142576718, -0.2115740979005312, -0.04655722398752847, 0.041139141974444675, 0.21304019115416817, 0.04290675179800019, 0.004306324363117003, 0.18623286557515342, 0.17052176507530492, 0.005879056307970098, 0.14652102237811993, -0.1760153319703898, -0.01842360772597776, -0.2048574149073964, -0.09086852236995818, -0.19923678402685457, 0.05305060225327907, -0.05968437364275882, -0.13530527089925373, 0.3892275601047678, 0.2352102158097464, 0.18438492380772475, 0.024347147816486, 0.3271939344844281, 0.029301028271893976, 0.15635338058712445, 0.022168627026042453, 0.16927610982437963, 0.05897808913033697, 0.09607678323690952, -0.16770038763233633, 0.10680391515186918, -0.032140250710115115]
|
1,803.09376
|
Distinct stages of radio frequency emission at the onset of pedestal
collapse in KSTAR H-mode plasmas
|
Using a high-speed and broadband radio frequency (RF) (0.1-1 GHz) spectrum
analyzer developed on the KSTAR tokamak, it is found that several distinct
stages of RF emission appear at the pedestal collapse in high confinement
discharges. Comparison with 2-D electron cyclotron emission (ECE) images has
revealed that each stage is related to the instantaneous condition at the
outboard mid-plane edge. First, high-harmonic ion cyclotron emissions (ICE) are
intensified with the appearance of a non-modal filamentary perturbation in the
edge within several tens of microseconds before the collapse. Then, the RF
emission becomes broad toward high-frequency range (< 500 MHz) at the burst
onset of the non-modal filament. During the pedestal collapse initiated by the
filament burst, rapid chirping (1-3 {\mu}s) appear with additional filament
bursts. The strong correlation between the RF spectra and the perturbation
structure provides important clues on the stability of edge-localized modes and
on the ion dynamics in the plasma boundary.
|
physics.plasm-ph
|
using a highspeed and broadband radio frequency rf 011 ghz spectrum analyzer developed on the kstar tokamak it is found that several distinct stages of rf emission appear at the pedestal collapse in high confinement discharges comparison with 2d electron cyclotron emission ece images has revealed that each stage is related to the instantaneous condition at the outboard midplane edge first highharmonic ion cyclotron emissions ice are intensified with the appearance of a nonmodal filamentary perturbation in the edge within several tens of microseconds before the collapse then the rf emission becomes broad toward highfrequency range 500 mhz at the burst onset of the nonmodal filament during the pedestal collapse initiated by the filament burst rapid chirping 13 mus appear with additional filament bursts the strong correlation between the rf spectra and the perturbation structure provides important clues on the stability of edgelocalized modes and on the ion dynamics in the plasma boundary
|
[['using', 'a', 'highspeed', 'and', 'broadband', 'radio', 'frequency', 'rf', '011', 'ghz', 'spectrum', 'analyzer', 'developed', 'on', 'the', 'kstar', 'tokamak', 'it', 'is', 'found', 'that', 'several', 'distinct', 'stages', 'of', 'rf', 'emission', 'appear', 'at', 'the', 'pedestal', 'collapse', 'in', 'high', 'confinement', 'discharges', 'comparison', 'with', '2d', 'electron', 'cyclotron', 'emission', 'ece', 'images', 'has', 'revealed', 'that', 'each', 'stage', 'is', 'related', 'to', 'the', 'instantaneous', 'condition', 'at', 'the', 'outboard', 'midplane', 'edge', 'first', 'highharmonic', 'ion', 'cyclotron', 'emissions', 'ice', 'are', 'intensified', 'with', 'the', 'appearance', 'of', 'a', 'nonmodal', 'filamentary', 'perturbation', 'in', 'the', 'edge', 'within', 'several', 'tens', 'of', 'microseconds', 'before', 'the', 'collapse', 'then', 'the', 'rf', 'emission', 'becomes', 'broad', 'toward', 'highfrequency', 'range', '500', 'mhz', 'at', 'the', 'burst', 'onset', 'of', 'the', 'nonmodal', 'filament', 'during', 'the', 'pedestal', 'collapse', 'initiated', 'by', 'the', 'filament', 'burst', 'rapid', 'chirping', '13', 'mus', 'appear', 'with', 'additional', 'filament', 'bursts', 'the', 'strong', 'correlation', 'between', 'the', 'rf', 'spectra', 'and', 'the', 'perturbation', 'structure', 'provides', 'important', 'clues', 'on', 'the', 'stability', 'of', 'edgelocalized', 'modes', 'and', 'on', 'the', 'ion', 'dynamics', 'in', 'the', 'plasma', 'boundary']]
|
[-0.13822274565471496, 0.19713970080468488, -0.027836229870376733, 0.03109151151280826, -0.028895442587098266, -0.119262530002743, -0.01728442271112227, 0.4194395384976482, -0.19942837910349268, -0.28489634061073943, 0.0948096016106908, -0.2549220100851742, -0.02849683707299965, 0.1943652570320695, 0.06293660554550953, 0.031958299288769663, 0.07448086113322015, -0.05475771675811581, 0.0032145186354789663, -0.09147037630231163, 0.24587386812302559, 0.160546128017207, 0.32235164637525193, 0.07726778649098051, 0.05068941724987311, -0.08771977092487908, -0.005950379459296956, -0.06051660351016942, -0.11133041583668149, 0.005764015691561831, 0.22434161366511354, 0.05428052609537202, 0.2722496340139556, -0.4734211443494275, -0.2500864231557238, -0.018702212028324092, 0.15438470604914709, 0.06031484039822971, -0.035740524521470377, -0.26145627422964357, 0.06714394516113756, -0.16481940250149837, -0.12969451478919855, 0.09171121106087382, 0.038536762534789104, 0.04784822961912046, -0.24485177341567085, 0.11835515573719711, 0.033622129776916816, 0.08714231490796688, -0.09591542413607361, -0.03474933053579887, -0.043272139708468924, 0.04005367870692139, 0.033447560012717946, 0.06055205737033652, 0.24745398068350125, -0.07975564082000965, -0.07184577070662046, 0.33944547199796327, -0.06936540201099382, 0.01868209608045279, 0.2121794832759275, -0.25391272512976737, -0.1117664815011903, 0.2798545010406159, 0.12066363634578153, 0.03600247799771917, -0.07992494923444586, -0.05634644655077079, 0.04510056367220077, 0.16771427406785816, 0.1631175854039421, 0.043312715390831036, 0.29761941368795103, 0.16049133178175373, 0.02850311551413505, 0.1713654557579681, -0.22409642620158254, -0.00899957330498747, -0.2849155214730821, -0.039068045925495086, -0.13433549909858533, 0.03205344179535613, -0.05051505584789066, -0.1541590884760071, 0.48125054990702304, 0.08539114293286248, 0.15822002067827176, -0.04303325666342953, 0.3223288202767863, 0.12432385467638085, 0.0875963665167588, 0.10895076005725689, 0.2932478417125013, 0.19320501468990461, 0.20795165057434073, -0.2912955201912696, 0.02605922049249285, -0.00045535107161484513]
|
1,803.09377
|
Antineutrino Charged-Current reactions on Hydrocarbon with Low Momentum
Transfer
|
We report on multinucleon effects in low momentum transfer ($< 0.8$ GeV/c)
anti-neutrino interactions on plastic (CH) scintillator. These data are from
the 2010-2011 antineutrino phase of the MINERvA experiment at Fermilab. The
hadronic energy spectrum of this inclusive sample is well described when a
screening effect at low energy transfer and a two-nucleon knockout process are
added to a relativistic Fermi gas model of quasielastic, $\Delta$ resonance,
and higher resonance processes. In this analysis, model elements introduced to
describe previously published neutrino results have quantitatively similar
benefits for this antineutrino sample. We present the results as a
double-differential cross section to accelerate investigation of alternate
models for antineutrino scattering off nuclei.
|
hep-ex
|
we report on multinucleon effects in low momentum transfer 08 gevc antineutrino interactions on plastic ch scintillator these data are from the 20102011 antineutrino phase of the minerva experiment at fermilab the hadronic energy spectrum of this inclusive sample is well described when a screening effect at low energy transfer and a twonucleon knockout process are added to a relativistic fermi gas model of quasielastic delta resonance and higher resonance processes in this analysis model elements introduced to describe previously published neutrino results have quantitatively similar benefits for this antineutrino sample we present the results as a doubledifferential cross section to accelerate investigation of alternate models for antineutrino scattering off nuclei
|
[['we', 'report', 'on', 'multinucleon', 'effects', 'in', 'low', 'momentum', 'transfer', '08', 'gevc', 'antineutrino', 'interactions', 'on', 'plastic', 'ch', 'scintillator', 'these', 'data', 'are', 'from', 'the', '20102011', 'antineutrino', 'phase', 'of', 'the', 'minerva', 'experiment', 'at', 'fermilab', 'the', 'hadronic', 'energy', 'spectrum', 'of', 'this', 'inclusive', 'sample', 'is', 'well', 'described', 'when', 'a', 'screening', 'effect', 'at', 'low', 'energy', 'transfer', 'and', 'a', 'twonucleon', 'knockout', 'process', 'are', 'added', 'to', 'a', 'relativistic', 'fermi', 'gas', 'model', 'of', 'quasielastic', 'delta', 'resonance', 'and', 'higher', 'resonance', 'processes', 'in', 'this', 'analysis', 'model', 'elements', 'introduced', 'to', 'describe', 'previously', 'published', 'neutrino', 'results', 'have', 'quantitatively', 'similar', 'benefits', 'for', 'this', 'antineutrino', 'sample', 'we', 'present', 'the', 'results', 'as', 'a', 'doubledifferential', 'cross', 'section', 'to', 'accelerate', 'investigation', 'of', 'alternate', 'models', 'for', 'antineutrino', 'scattering', 'off', 'nuclei']]
|
[-0.009281078672879754, 0.20795770058290916, -0.07435209740232257, 0.14824177022781948, 0.000832443987648632, -0.1152477808598731, 0.05890297765323372, 0.37424081909629675, -0.18578964193259273, -0.3087010585224709, -0.06393432529299176, -0.41308676025217717, -0.011423350198546777, 0.16278251870912877, 0.05570116834631106, 0.07440741015346469, 0.13411025997452639, -0.049925228144537225, -0.06392683534094275, -0.18203455547651126, 0.2915756855965466, 0.16903952009522835, 0.26567356752416305, 0.14214930131293094, 0.07809783610712469, 0.029255665977158257, -0.06471231563419506, -0.0872503577622476, -0.09992981685308723, 0.036095535911216926, 0.3163687870055419, 0.02403304494523049, 0.09657410136214248, -0.4073539114139527, -0.17016853293118714, 0.08395042340061418, 0.128687542200357, 0.10974144865968474, -0.07011054895256084, -0.27014450467955153, 0.029930025532103336, -0.28558006199697655, -0.122179697720787, -0.051761692385650704, -0.00945545998947309, 0.013448255963052984, -0.265519747527333, 0.0910563140159456, 0.004742181688958259, 0.06382389060381027, -0.11239898583625217, -0.2400929261762481, 0.03631711503918711, 0.031112989514850097, 0.09279685987234074, 0.024757111927511188, 0.17927514104936104, -0.10142534420204659, -0.10341385980598158, 0.33901057427598014, -0.013187715659958419, -0.12381695958508833, 0.13688368753840527, -0.22163298881302276, -0.09841588719932547, 0.2177455921128795, 0.24760927444508485, 0.06639009929547372, -0.23533389106382896, 0.030181867716089834, -0.02140127045211491, 0.1677580221245686, 0.061241107395019485, -0.0070510601020745325, 0.16375704413397354, 0.26209932389702684, -0.00696806775548638, 0.01626032290074068, -0.1987304653225651, -0.025902398014525034, -0.3595015965569932, -0.08852671399746123, -0.07686114949929351, 0.09915894890720076, 0.022395326059808752, -0.09155180972270868, 0.36671905707450464, 0.07901564842459184, 0.23942314857734484, -0.03812028918213941, 0.34696220630268054, 0.07058692463308673, 0.06628643387827922, -0.0027299311834278407, 0.32032096583966735, 0.14324858471717652, 0.17019114206201053, -0.2817966751859163, 0.03801249400167181, 0.04482806205481022]
|
1,803.09378
|
Algebraic theories and commutativity in a sheaf topos
|
For any site of definition $\mathcal C$ of a Grothendieck topos $\mathcal E$,
we define a notion of a $\mathcal C$-ary Lawvere theory $\tau: \mathscr C \to
\mathscr T$ whose category of models is a stack over $\mathcal E$. Our
definitions coincide with Lawvere's finitary theories when $\mathcal
C=\aleph_0$ and $\mathcal E = \operatorname{\mathbf {Set}}$. We construct a
fibered category $\operatorname{\mathbf {Mod}}^{\mathscr T}$ of models as a
stack over $\mathcal E$ and prove that it is $\mathcal E$-complete and
$\mathcal E$-cocomplete. We show that there is a free-forget adjunction $F
\dashv U: \operatorname{\mathbf {Mod}}^{\mathscr T} \rightleftarrows \mathscr
E$. If $\tau$ is a commutative theory in a certain sense, then we obtain a
``locally monoidal closed'' structure on the category of models, which enhances
the free-forget adjunction to an adjunction of symmetric monoidal $\mathcal
E$-categories. Our results give a general recipe for constructing a monoidal
$\mathcal E$-cosmos in which one can do enriched $\mathcal E$-category theory.
As an application, we describe a convenient category of linear spaces generated
by the theory of Lebesgue integration.
|
math.CT math.AP math.FA
|
for any site of definition mathcal c of a grothendieck topos mathcal e we define a notion of a mathcal cary lawvere theory tau mathscr c to mathscr t whose category of models is a stack over mathcal e our definitions coincide with lawveres finitary theories when mathcal caleph_0 and mathcal e operatornamemathbf set we construct a fibered category operatornamemathbf modmathscr t of models as a stack over mathcal e and prove that it is mathcal ecomplete and mathcal ecocomplete we show that there is a freeforget adjunction f dashv u operatornamemathbf modmathscr t rightleftarrows mathscr e if tau is a commutative theory in a certain sense then we obtain a locally monoidal closed structure on the category of models which enhances the freeforget adjunction to an adjunction of symmetric monoidal mathcal ecategories our results give a general recipe for constructing a monoidal mathcal ecosmos in which one can do enriched mathcal ecategory theory as an application we describe a convenient category of linear spaces generated by the theory of lebesgue integration
|
[['for', 'any', 'site', 'of', 'definition', 'mathcal', 'c', 'of', 'a', 'grothendieck', 'topos', 'mathcal', 'e', 'we', 'define', 'a', 'notion', 'of', 'a', 'mathcal', 'cary', 'lawvere', 'theory', 'tau', 'mathscr', 'c', 'to', 'mathscr', 't', 'whose', 'category', 'of', 'models', 'is', 'a', 'stack', 'over', 'mathcal', 'e', 'our', 'definitions', 'coincide', 'with', 'lawveres', 'finitary', 'theories', 'when', 'mathcal', 'caleph_0', 'and', 'mathcal', 'e', 'operatornamemathbf', 'set', 'we', 'construct', 'a', 'fibered', 'category', 'operatornamemathbf', 'modmathscr', 't', 'of', 'models', 'as', 'a', 'stack', 'over', 'mathcal', 'e', 'and', 'prove', 'that', 'it', 'is', 'mathcal', 'ecomplete', 'and', 'mathcal', 'ecocomplete', 'we', 'show', 'that', 'there', 'is', 'a', 'freeforget', 'adjunction', 'f', 'dashv', 'u', 'operatornamemathbf', 'modmathscr', 't', 'rightleftarrows', 'mathscr', 'e', 'if', 'tau', 'is', 'a', 'commutative', 'theory', 'in', 'a', 'certain', 'sense', 'then', 'we', 'obtain', 'a', 'locally', 'monoidal', 'closed', 'structure', 'on', 'the', 'category', 'of', 'models', 'which', 'enhances', 'the', 'freeforget', 'adjunction', 'to', 'an', 'adjunction', 'of', 'symmetric', 'monoidal', 'mathcal', 'ecategories', 'our', 'results', 'give', 'a', 'general', 'recipe', 'for', 'constructing', 'a', 'monoidal', 'mathcal', 'ecosmos', 'in', 'which', 'one', 'can', 'do', 'enriched', 'mathcal', 'ecategory', 'theory', 'as', 'an', 'application', 'we', 'describe', 'a', 'convenient', 'category', 'of', 'linear', 'spaces', 'generated', 'by', 'the', 'theory', 'of', 'lebesgue', 'integration']]
|
[-0.16341771508789868, 0.0720483168227201, -0.03934422023937197, 0.0721010466654745, -0.06340978541440027, -0.18224410294195167, 0.00705619525818577, 0.3532577952130075, -0.3976934178406658, -0.13138683827628203, 0.007475178540210051, -0.22942845340521056, -0.09232397338923959, 0.1612133962685025, -0.17998676797363655, -0.09906240116999102, 0.048588776488879847, 0.1334299469349529, -0.09790388628714747, -0.21848785853730457, 0.3884416565961816, -0.05186641111718548, 0.21407581199577616, 0.027807092759758234, 0.10359696722360888, -0.02475786898170878, 0.03248106879667819, 0.013290837195707611, -0.20008667402494015, 0.1373934808495723, 0.31337143209967044, 0.14652923014774874, 0.22140064697706946, -0.34527194061733646, -0.07460682062672143, 0.21764505092351716, 0.08598498228160333, -0.05571606334304563, 0.02229974829760363, -0.29675675317805056, 0.13022609285587455, -0.2532529575076023, -0.07634829273847349, -0.10258979729713838, 0.18715171401668912, -0.03564329126826916, -0.3649860808323709, -0.09997603158820763, 0.12163532236548129, 0.08801874829216237, -0.0659518966799819, -0.04483835367368751, -0.1537568423142828, -0.003589617746040808, -0.09010844165459275, 0.1456571304799269, 0.1160600035459566, -0.046080135634637504, -0.11481827776093448, 0.354862463334861, -0.12917293821592912, -0.19777227552147708, 0.10913431574161982, -0.14740379537388604, -0.15437120962402343, 0.06556550376802865, 0.011448206065759702, 0.2435663272769539, -0.009259593992389058, 0.324983567438314, -0.18583141620313046, 0.05494200112798074, 0.054383978451904985, 0.047695830384729306, 0.12904615597970828, 0.12789137826866806, 0.04235732571244743, 0.09413789644797384, 0.04300186816642941, -0.005072806880415126, -0.4311106490668344, -0.1731514001687977, -0.02556803079459108, 0.20732869846214957, -0.06121371950383907, -0.2026168787394839, 0.317499066365917, 0.09325505922937, 0.20395955955323997, 0.1774641950371921, 0.18150788202647555, 0.05889112200469073, 0.05763013495355159, 0.05797907328404532, 0.06123782124975982, 0.22615765310121141, -0.02878210972851725, -0.07683209788934128, -0.01249110882679012, 0.23744454384535735]
|
1,803.09379
|
Multiview Hierarchical Agglomerative Clustering for Identification of
Development Gap and Regional Potential Sector
|
The identification of regional development gaps is an effort to see how far
the development conducted in every District in a Province. By seeing the gaps
occurred, it is expected that the Policymakers are able to determine which
region that will be prioritized for future development. Along with the regional
gaps, the identification in Gross Regional Domestic Product (GRDP) sector is
also an effort to identify the achievement in the development in certain fields
seen from the potential GRDP owned by a District. There are two approaches that
are often used to identify the regional development gaps and potential sector,
Klassen Typology and Location Quotient (LQ), respectively. In fact, the results
of the identification using these methods have not been able to show the
proximity of the development gaps between a District to another yet in a same
cluster. These methods only cluster the regions and GRDP sectors in a firm
cluster based on their own parameter values. This research develops a new
approach that combines the Klassen, LQ and hierarchical agglomerative
clustering (HAC) into a new method named multi view hierarchical agglomerative
clustering (MVHAC). The data of GRDP sectors of 23 Districts in West Java
province were tested by using Klassen, LQ, HAC and MVHAC and were then
compared. The results show that MVHAC is able to accommodate the ability of the
three previous methods into a unity, even to clearly visualize the proximity of
the development gaps between the regions and GRDP sectors owned. MVHAC clusters
23 districts into 3 main clusters, they are, Cluster 1 (Quadrant 1) consists of
5 Districts as the members, Cluster 2 (Quadrant 2) consists of 12 Districts and
Cluster 3 (Quadrant 4) consists of 6 Districts.
|
cs.CY
|
the identification of regional development gaps is an effort to see how far the development conducted in every district in a province by seeing the gaps occurred it is expected that the policymakers are able to determine which region that will be prioritized for future development along with the regional gaps the identification in gross regional domestic product grdp sector is also an effort to identify the achievement in the development in certain fields seen from the potential grdp owned by a district there are two approaches that are often used to identify the regional development gaps and potential sector klassen typology and location quotient lq respectively in fact the results of the identification using these methods have not been able to show the proximity of the development gaps between a district to another yet in a same cluster these methods only cluster the regions and grdp sectors in a firm cluster based on their own parameter values this research develops a new approach that combines the klassen lq and hierarchical agglomerative clustering hac into a new method named multi view hierarchical agglomerative clustering mvhac the data of grdp sectors of 23 districts in west java province were tested by using klassen lq hac and mvhac and were then compared the results show that mvhac is able to accommodate the ability of the three previous methods into a unity even to clearly visualize the proximity of the development gaps between the regions and grdp sectors owned mvhac clusters 23 districts into 3 main clusters they are cluster 1 quadrant 1 consists of 5 districts as the members cluster 2 quadrant 2 consists of 12 districts and cluster 3 quadrant 4 consists of 6 districts
|
[['the', 'identification', 'of', 'regional', 'development', 'gaps', 'is', 'an', 'effort', 'to', 'see', 'how', 'far', 'the', 'development', 'conducted', 'in', 'every', 'district', 'in', 'a', 'province', 'by', 'seeing', 'the', 'gaps', 'occurred', 'it', 'is', 'expected', 'that', 'the', 'policymakers', 'are', 'able', 'to', 'determine', 'which', 'region', 'that', 'will', 'be', 'prioritized', 'for', 'future', 'development', 'along', 'with', 'the', 'regional', 'gaps', 'the', 'identification', 'in', 'gross', 'regional', 'domestic', 'product', 'grdp', 'sector', 'is', 'also', 'an', 'effort', 'to', 'identify', 'the', 'achievement', 'in', 'the', 'development', 'in', 'certain', 'fields', 'seen', 'from', 'the', 'potential', 'grdp', 'owned', 'by', 'a', 'district', 'there', 'are', 'two', 'approaches', 'that', 'are', 'often', 'used', 'to', 'identify', 'the', 'regional', 'development', 'gaps', 'and', 'potential', 'sector', 'klassen', 'typology', 'and', 'location', 'quotient', 'lq', 'respectively', 'in', 'fact', 'the', 'results', 'of', 'the', 'identification', 'using', 'these', 'methods', 'have', 'not', 'been', 'able', 'to', 'show', 'the', 'proximity', 'of', 'the', 'development', 'gaps', 'between', 'a', 'district', 'to', 'another', 'yet', 'in', 'a', 'same', 'cluster', 'these', 'methods', 'only', 'cluster', 'the', 'regions', 'and', 'grdp', 'sectors', 'in', 'a', 'firm', 'cluster', 'based', 'on', 'their', 'own', 'parameter', 'values', 'this', 'research', 'develops', 'a', 'new', 'approach', 'that', 'combines', 'the', 'klassen', 'lq', 'and', 'hierarchical', 'agglomerative', 'clustering', 'hac', 'into', 'a', 'new', 'method', 'named', 'multi', 'view', 'hierarchical', 'agglomerative', 'clustering', 'mvhac', 'the', 'data', 'of', 'grdp', 'sectors', 'of', '23', 'districts', 'in', 'west', 'java', 'province', 'were', 'tested', 'by', 'using', 'klassen', 'lq', 'hac', 'and', 'mvhac', 'and', 'were', 'then', 'compared', 'the', 'results', 'show', 'that', 'mvhac', 'is', 'able', 'to', 'accommodate', 'the', 'ability', 'of', 'the', 'three', 'previous', 'methods', 'into', 'a', 'unity', 'even', 'to', 'clearly', 'visualize', 'the', 'proximity', 'of', 'the', 'development', 'gaps', 'between', 'the', 'regions', 'and', 'grdp', 'sectors', 'owned', 'mvhac', 'clusters', '23', 'districts', 'into', '3', 'main', 'clusters', 'they', 'are', 'cluster', '1', 'quadrant', '1', 'consists', 'of', '5', 'districts', 'as', 'the', 'members', 'cluster', '2', 'quadrant', '2', 'consists', 'of', '12', 'districts', 'and', 'cluster', '3', 'quadrant', '4', 'consists', 'of', '6', 'districts']]
|
[-0.06791232265761568, 0.06611210055447193, -0.08545455527098351, 0.08561674983717803, -0.050272677328214575, -0.08735684777321426, 0.05856961911071984, 0.3604632338220385, -0.22475605030891707, -0.33744599940283976, 0.13314599515238948, -0.29417717530929915, -0.1058658886877951, 0.14866508187276875, -0.06390367320693233, -0.0369407020407892, 0.04083069895179352, 0.010034549151691543, 0.01563889612128112, -0.27971761986657545, 0.29733040016865964, 0.02152085391653728, 0.2857676691873307, 0.02094218157158843, 0.037901639914169616, -0.037348097601813644, -0.06954015594657878, 0.014351867377498962, -0.10141987716718139, 0.16021015881896872, 0.29305343255630206, 0.1541681446825338, 0.3373940767520304, -0.3772316339017264, -0.14316758705617885, 0.07418419253820464, 0.15096888589528454, 0.011052719870349392, -0.021006951127020956, -0.3155057250577825, 0.09262511434019575, -0.19879506249144727, -0.1315910815881093, -0.023853603340554197, 0.006794522155705892, 0.008579199425351451, -0.2301593840787922, 0.06487462462922541, 0.009123537903831956, 0.04709835545878044, -0.0662229165408603, -0.17946960195623549, -0.035371740773307084, 0.1863798751597437, 0.009197662815059746, 0.023650122863817697, 0.13577176857076448, -0.12582902308359978, -0.16249923189137866, 0.3402705460321158, 0.008278839145852646, -0.1312894025607638, 0.203173648158554, -0.15383013470908363, -0.16792062552921264, 0.09256775648264266, 0.1555891215287208, 0.033636278936042596, -0.162703279860016, 0.04600038831974839, -0.028707586940456654, 0.18172802627545742, 0.06302058673791693, -0.05386005214933621, 0.21836513980016323, 0.16027779908339218, 0.09949370177420067, 0.1012586649498266, -0.1398944080918765, -0.10839389386614719, -0.2437750535978588, -0.13546821809518086, -0.1163461257828216, -0.04161831755005602, -0.0654216962768106, -0.13174733528162313, 0.4028909902521212, 0.12599036486083182, 0.17547769035199579, 0.009501707465896172, 0.23535997532045758, 0.008002872632088428, 0.1354099217528464, 0.09546769597292157, 0.2195815001155289, 0.04640440802617838, 0.12018945743657754, -0.1474751687147917, 0.06378490742030357, 0.02861216611107549]
|
1,803.0938
|
A distribution function correction-based immersed boundary- lattice
Boltzmann method with truly second-order accuracy for fluid-solid flows
|
The immersed boundary lattice Boltzmann method (IB-LBM) has been widely used
in the simulation of fluid-solid interaction and particulate flow problems,
since proposed in 2004. However, it is usually a non-trivial task to retain the
flexibility and the accuracy simultaneously in the implementation of this
approach. Based on the intrinsic nature of the LBM, we propose a simple and
second-order accurate IB-LBM in this paper, where the no-slip boundary
condition on the fluid-solid interface is directly imposed by iteratively
correcting the distribution function near the boundary, markedly similar to the
treatment of boundary condition in the original LBM. Therefore, there are no
additional efforts needed to construct an interfacial force model (such as the
spring, feedback and direct force models) and absorb this force into the
framework of LBM. It is worth mentioning that we retain the discrete delta
function for the connection between the Lagrangian and Eulerian meshes, thus
preserving the flexibility of the conventional IB-LBM. Second-order accuracy of
the present IB-LBM is reasonably confirmed in the simulation of cylindrical
Couette flow, while the conventional approach is generally a first-order
scheme. The present method is first validated in the flow past a fixed
cylinder. No streamline penetration is found, indicating the exactly
enforcement of the no-slip boundary condition. Furthermore, in the simulations
of one and two particles settling under gravity, good agreements can be
observed comparing with the data available in the literature.
|
physics.comp-ph
|
the immersed boundary lattice boltzmann method iblbm has been widely used in the simulation of fluidsolid interaction and particulate flow problems since proposed in 2004 however it is usually a nontrivial task to retain the flexibility and the accuracy simultaneously in the implementation of this approach based on the intrinsic nature of the lbm we propose a simple and secondorder accurate iblbm in this paper where the noslip boundary condition on the fluidsolid interface is directly imposed by iteratively correcting the distribution function near the boundary markedly similar to the treatment of boundary condition in the original lbm therefore there are no additional efforts needed to construct an interfacial force model such as the spring feedback and direct force models and absorb this force into the framework of lbm it is worth mentioning that we retain the discrete delta function for the connection between the lagrangian and eulerian meshes thus preserving the flexibility of the conventional iblbm secondorder accuracy of the present iblbm is reasonably confirmed in the simulation of cylindrical couette flow while the conventional approach is generally a firstorder scheme the present method is first validated in the flow past a fixed cylinder no streamline penetration is found indicating the exactly enforcement of the noslip boundary condition furthermore in the simulations of one and two particles settling under gravity good agreements can be observed comparing with the data available in the literature
|
[['the', 'immersed', 'boundary', 'lattice', 'boltzmann', 'method', 'iblbm', 'has', 'been', 'widely', 'used', 'in', 'the', 'simulation', 'of', 'fluidsolid', 'interaction', 'and', 'particulate', 'flow', 'problems', 'since', 'proposed', 'in', '2004', 'however', 'it', 'is', 'usually', 'a', 'nontrivial', 'task', 'to', 'retain', 'the', 'flexibility', 'and', 'the', 'accuracy', 'simultaneously', 'in', 'the', 'implementation', 'of', 'this', 'approach', 'based', 'on', 'the', 'intrinsic', 'nature', 'of', 'the', 'lbm', 'we', 'propose', 'a', 'simple', 'and', 'secondorder', 'accurate', 'iblbm', 'in', 'this', 'paper', 'where', 'the', 'noslip', 'boundary', 'condition', 'on', 'the', 'fluidsolid', 'interface', 'is', 'directly', 'imposed', 'by', 'iteratively', 'correcting', 'the', 'distribution', 'function', 'near', 'the', 'boundary', 'markedly', 'similar', 'to', 'the', 'treatment', 'of', 'boundary', 'condition', 'in', 'the', 'original', 'lbm', 'therefore', 'there', 'are', 'no', 'additional', 'efforts', 'needed', 'to', 'construct', 'an', 'interfacial', 'force', 'model', 'such', 'as', 'the', 'spring', 'feedback', 'and', 'direct', 'force', 'models', 'and', 'absorb', 'this', 'force', 'into', 'the', 'framework', 'of', 'lbm', 'it', 'is', 'worth', 'mentioning', 'that', 'we', 'retain', 'the', 'discrete', 'delta', 'function', 'for', 'the', 'connection', 'between', 'the', 'lagrangian', 'and', 'eulerian', 'meshes', 'thus', 'preserving', 'the', 'flexibility', 'of', 'the', 'conventional', 'iblbm', 'secondorder', 'accuracy', 'of', 'the', 'present', 'iblbm', 'is', 'reasonably', 'confirmed', 'in', 'the', 'simulation', 'of', 'cylindrical', 'couette', 'flow', 'while', 'the', 'conventional', 'approach', 'is', 'generally', 'a', 'firstorder', 'scheme', 'the', 'present', 'method', 'is', 'first', 'validated', 'in', 'the', 'flow', 'past', 'a', 'fixed', 'cylinder', 'no', 'streamline', 'penetration', 'is', 'found', 'indicating', 'the', 'exactly', 'enforcement', 'of', 'the', 'noslip', 'boundary', 'condition', 'furthermore', 'in', 'the', 'simulations', 'of', 'one', 'and', 'two', 'particles', 'settling', 'under', 'gravity', 'good', 'agreements', 'can', 'be', 'observed', 'comparing', 'with', 'the', 'data', 'available', 'in', 'the', 'literature']]
|
[-0.10954272503861123, 0.07054251679036473, -0.120378247718675, 0.028868809883665834, -0.07427429091722633, -0.14398029489187986, 0.00214182794577657, 0.3745598663798828, -0.2579430433619035, -0.29965053025720656, 0.10260914884254925, -0.23637387321457967, -0.11983894709593211, 0.1664904767764796, -0.05312877193861442, 0.11532852391943209, 0.07586047572081782, 0.011157461003257105, -0.052492782207898415, -0.21751419486852092, 0.2884123234364849, 0.04942375998028642, 0.310558932274182, 0.10723336245819855, 0.11411910816707696, -0.030677076779369615, -0.01000586950367428, 0.06070567084362921, -0.14886296820657305, 0.09125899122212018, 0.19148703025645314, 0.040098301959860846, 0.26256482467517, -0.4637371763571078, -0.24724946808245066, 0.0630285343569186, 0.11372865910659759, 0.11047797984519225, -0.03761909207285374, -0.24069917866657686, 0.07405510789945595, -0.14474479135814416, -0.12174182191852313, -0.054558200002737485, -0.017782771880300637, -0.0011185474854950076, -0.2734455426937988, 0.10974201627083632, 0.05685381377792448, 0.0730816341481872, -0.07589794889104386, -0.07463212393654081, -0.045357506272470594, 0.11920861347319951, 0.05766020436834894, 0.05348652904518904, 0.07817028688553435, -0.12694040491568068, -0.03691511352359453, 0.43392067764782244, -0.022202748908764787, -0.2590212703517809, 0.21184290029231906, -0.1107648326517839, -0.07425035237589389, 0.140562566293505, 0.13934607153487766, 0.11099886095985118, -0.16629920202619833, 0.06290155267228499, -0.04088225872076761, 0.15713977539895946, 0.058002743885939956, -0.06789582791543192, 0.17145451665736544, 0.1863498437767112, 0.06719682228146519, 0.14062863014067292, -0.07375592954056816, -0.12630829672054508, -0.3056634630148227, -0.14628158708178374, -0.18156834153366935, -0.04560792684041632, -0.0951654703801465, -0.17089459617944577, 0.34597662858755224, 0.1785617293849683, 0.14902615150174078, 0.044186294280812465, 0.34792575537641013, 0.11200547057978061, 0.07538287119087206, 0.10327596284034184, 0.2700061061318554, 0.10834454293223496, 0.1172234508742252, -0.256472151609074, 0.07839380722278012, 0.0859900563955307]
|
1,803.09381
|
Boundary of the horseshoe locus for the H\'enon family
|
The purpose of this article is to investigate geometric properties of the
parameter locus of the H\'enon family where the uniform hyperbolicity of a
horseshoe breaks down. As an application, we obtain a variational
characterization of equilibrium measures "at temperature zero" for the
corresponding non-uniformly hyperbolic H\'enon maps. The method of the proof
also yields that the boundary of the hyperbolic horseshoe locus in the
parameter space consists of two monotone pieces, which confirms a conjecture in
[AI]. The proofs of these results are based on the machinery developed in [AI]
which employs the complexification of both the dynamical and the parameter
spaces of the H\'enon family together with computer assistance.
|
math.DS
|
the purpose of this article is to investigate geometric properties of the parameter locus of the henon family where the uniform hyperbolicity of a horseshoe breaks down as an application we obtain a variational characterization of equilibrium measures at temperature zero for the corresponding nonuniformly hyperbolic henon maps the method of the proof also yields that the boundary of the hyperbolic horseshoe locus in the parameter space consists of two monotone pieces which confirms a conjecture in ai the proofs of these results are based on the machinery developed in ai which employs the complexification of both the dynamical and the parameter spaces of the henon family together with computer assistance
|
[['the', 'purpose', 'of', 'this', 'article', 'is', 'to', 'investigate', 'geometric', 'properties', 'of', 'the', 'parameter', 'locus', 'of', 'the', 'henon', 'family', 'where', 'the', 'uniform', 'hyperbolicity', 'of', 'a', 'horseshoe', 'breaks', 'down', 'as', 'an', 'application', 'we', 'obtain', 'a', 'variational', 'characterization', 'of', 'equilibrium', 'measures', 'at', 'temperature', 'zero', 'for', 'the', 'corresponding', 'nonuniformly', 'hyperbolic', 'henon', 'maps', 'the', 'method', 'of', 'the', 'proof', 'also', 'yields', 'that', 'the', 'boundary', 'of', 'the', 'hyperbolic', 'horseshoe', 'locus', 'in', 'the', 'parameter', 'space', 'consists', 'of', 'two', 'monotone', 'pieces', 'which', 'confirms', 'a', 'conjecture', 'in', 'ai', 'the', 'proofs', 'of', 'these', 'results', 'are', 'based', 'on', 'the', 'machinery', 'developed', 'in', 'ai', 'which', 'employs', 'the', 'complexification', 'of', 'both', 'the', 'dynamical', 'and', 'the', 'parameter', 'spaces', 'of', 'the', 'henon', 'family', 'together', 'with', 'computer', 'assistance']]
|
[-0.14049590419849953, 0.07785749805030341, -0.13118730175627713, 0.02936051697847811, -0.07129288621263595, -0.0828487003098351, 0.01784746098617377, 0.25500392602538474, -0.2718011738547871, -0.2273864413187881, 0.12400683224188618, -0.26028805664690163, -0.1642924063914531, 0.25515077081047466, -0.09092183761835636, 0.06667146119414954, 0.029725169431552425, 0.031373157165944576, -0.0809363093340417, -0.2282352209959582, 0.4111897185075659, -0.03489302766618428, 0.23761847012818935, 0.02753344501330945, 0.12853603385523096, -0.016212212307764602, -0.014111136514190081, -0.004610390771811761, -0.20901638813987258, 0.1372293058724084, 0.20861843755250578, 0.09771327292211018, 0.28788080043893577, -0.3238906517859783, -0.18586232549372456, 0.13404948537883996, 0.1272243390673654, 0.07575821081755331, -0.012921343892099554, -0.27386121999321356, 0.054672910559184114, -0.1166378736646997, -0.21592647622565966, -0.08608743081053903, -0.009573195599489383, 0.06397906212589226, -0.2556218641751387, 0.021986284500631916, 0.14902488971291622, 0.11820861934642266, -0.05957500474225428, -0.07216825625683004, -0.07623732463888791, 0.09819847520499549, 0.040270340918911504, 0.03542654642516428, 0.10034729921686891, -0.09557058539887604, -0.07176179020992808, 0.33499585693966394, -0.06294910751518097, -0.22024732500918814, 0.18770003230059268, -0.13340224736571513, -0.18627840416036076, 0.12292897042205876, 0.14458859071706062, 0.13234671151164817, -0.11923070798988815, 0.14310227283895402, -0.0711714104814287, 0.12057887674686876, 0.06095109002555611, -0.017913163719312834, 0.1522294042468373, 0.15063335326173016, 0.13901096860131434, 0.19401315831199606, -0.05870359007537634, -0.1563780594859398, -0.3001946265901531, -0.19298733174297455, -0.1619303420706241, 0.04602015210600855, -0.11001228589996137, -0.22717051362400656, 0.425701458170708, 0.11445402891662491, 0.2081014258820597, 0.09615090701661937, 0.25802120703968917, 0.06878949416096548, 0.02284150581118894, 0.04156710288009128, 0.21368981455767377, 0.1598511939052375, 0.04166306882912108, -0.18973261958642587, 0.021479928085731494, 0.16030771354934922]
|
1,803.09382
|
Ion backflow studies with a triple-GEM stack with increasing hole pitch
|
Gas Electron Multipliers have undergone a very consistent development since
their invention in 1997. Their production procedures have been tuned in such a
way that nowadays it is possible to produce foils with areas of the order of
the square meter that can operate at a reasonable gain, uniform over large
areas and with a good stability in what concerns electrical discharges. For the
third run of LHC, they will be included in the CMS and ALICE experiments after
significant upgrades of the detectors, confirming that these structures are
suitable for very large experiments. In the special case of Time Projection
Chambers, the ion backflow and the energy resolution are sensitive issues that
must be addressed and the GEM has shown to be able to deal with both of them.
In this work, a stack of three GEMs with different pitches has been studied
as a possible future approach for ion-backflow suppression to be used in TPCs
and other detection concepts. With this approach, an ion backflow of 1 % with
an energy resolution of 12 % at 5.9 keV has been achieved with the detector
operating in an Ar/CO2 (90/10) mixture at a gain of ~ 2000.
|
physics.ins-det
|
gas electron multipliers have undergone a very consistent development since their invention in 1997 their production procedures have been tuned in such a way that nowadays it is possible to produce foils with areas of the order of the square meter that can operate at a reasonable gain uniform over large areas and with a good stability in what concerns electrical discharges for the third run of lhc they will be included in the cms and alice experiments after significant upgrades of the detectors confirming that these structures are suitable for very large experiments in the special case of time projection chambers the ion backflow and the energy resolution are sensitive issues that must be addressed and the gem has shown to be able to deal with both of them in this work a stack of three gems with different pitches has been studied as a possible future approach for ionbackflow suppression to be used in tpcs and other detection concepts with this approach an ion backflow of 1 with an energy resolution of 12 at 59 kev has been achieved with the detector operating in an arco2 9010 mixture at a gain of 2000
|
[['gas', 'electron', 'multipliers', 'have', 'undergone', 'a', 'very', 'consistent', 'development', 'since', 'their', 'invention', 'in', '1997', 'their', 'production', 'procedures', 'have', 'been', 'tuned', 'in', 'such', 'a', 'way', 'that', 'nowadays', 'it', 'is', 'possible', 'to', 'produce', 'foils', 'with', 'areas', 'of', 'the', 'order', 'of', 'the', 'square', 'meter', 'that', 'can', 'operate', 'at', 'a', 'reasonable', 'gain', 'uniform', 'over', 'large', 'areas', 'and', 'with', 'a', 'good', 'stability', 'in', 'what', 'concerns', 'electrical', 'discharges', 'for', 'the', 'third', 'run', 'of', 'lhc', 'they', 'will', 'be', 'included', 'in', 'the', 'cms', 'and', 'alice', 'experiments', 'after', 'significant', 'upgrades', 'of', 'the', 'detectors', 'confirming', 'that', 'these', 'structures', 'are', 'suitable', 'for', 'very', 'large', 'experiments', 'in', 'the', 'special', 'case', 'of', 'time', 'projection', 'chambers', 'the', 'ion', 'backflow', 'and', 'the', 'energy', 'resolution', 'are', 'sensitive', 'issues', 'that', 'must', 'be', 'addressed', 'and', 'the', 'gem', 'has', 'shown', 'to', 'be', 'able', 'to', 'deal', 'with', 'both', 'of', 'them', 'in', 'this', 'work', 'a', 'stack', 'of', 'three', 'gems', 'with', 'different', 'pitches', 'has', 'been', 'studied', 'as', 'a', 'possible', 'future', 'approach', 'for', 'ionbackflow', 'suppression', 'to', 'be', 'used', 'in', 'tpcs', 'and', 'other', 'detection', 'concepts', 'with', 'this', 'approach', 'an', 'ion', 'backflow', 'of', '1', 'with', 'an', 'energy', 'resolution', 'of', '12', 'at', '59', 'kev', 'has', 'been', 'achieved', 'with', 'the', 'detector', 'operating', 'in', 'an', 'arco2', '9010', 'mixture', 'at', 'a', 'gain', 'of', '2000']]
|
[-0.054191572717378955, 0.1336265810468737, -0.08372215373374368, 0.02419492300808641, -0.0012902416164036264, -0.15659475180118815, -0.03423297943273732, 0.41801446011366766, -0.2139902537779825, -0.3437051375182922, 0.1299691773763829, -0.2923613549870218, -0.020372918610744292, 0.2351954641197472, -0.06300478515493654, 0.08888298759870615, 0.07643385937607837, 0.005708942024190862, -0.0790390113798287, -0.285813938442272, 0.23729205328356667, 0.15056048098833963, 0.2575910802229701, 0.08035825610943331, 0.13428294363302015, -0.06594825482845652, -0.024829266108896526, 0.050827228691016045, -0.08290216061418645, 0.08022680446342326, 0.3084053671726784, 0.08532405165762198, 0.27039123510884255, -0.4482599187392703, -0.20266606024533665, 0.08179447154236055, 0.12239808074592315, 0.04917291438773505, -0.08704914490586703, -0.24860246524517185, 0.11144865195047274, -0.22291645355589843, -0.13256148259712325, -0.04677646735817501, 0.01411699725149353, 0.04361990674821295, -0.24511582710475363, 0.006654091035351925, 0.03509464696260918, 0.05052395359032125, -0.011094285918102052, -0.11728478452795636, 0.027378776299133514, 0.1112492176987346, 0.03939120156916108, 0.045263158570322176, 0.11400585236344679, -0.13716023038777514, -0.11569887335344996, 0.3452146756942816, -0.03438604557610683, -0.16248291691755587, 0.23852811996181755, -0.1686358736976789, -0.1145253840656279, 0.16826648257262333, 0.16048531205940647, 0.07083628448590483, -0.16358020651207028, 0.04410332232892523, -0.010428724445633053, 0.17340675263849992, 0.1080341205005678, 0.05458586084051538, 0.22344262131667436, 0.21452805322604543, 0.06781990037446112, 0.095483088423618, -0.1456409429583144, -0.039054233891068546, -0.27722375470300004, -0.15976835479335763, -0.1356162024846723, 0.013053091799782724, -0.0021446604546748785, -0.09341119484752104, 0.38336270642418835, 0.13884482714923618, 0.2007041146592285, -0.04764081689303491, 0.2764289311238939, 0.08598421974354856, 0.141166320994746, 0.02818823433793198, 0.2864383639462926, 0.0925941455187564, 0.16275172359394102, -0.16486274396290176, 0.05563543154618021, -0.023545621458642644]
|
1,803.09383
|
Online Second Order Methods for Non-Convex Stochastic Optimizations
|
This paper proposes a family of online second order methods for possibly
non-convex stochastic optimizations based on the theory of preconditioned
stochastic gradient descent (PSGD), which can be regarded as an enhance
stochastic Newton method with the ability to handle gradient noise and
non-convexity simultaneously. We have improved the implementations of the
original PSGD in several ways, e.g., new forms of preconditioners, more
accurate Hessian vector product calculations, and better numerical stability
with vanishing or ill-conditioned Hessian, etc.. We also have unrevealed the
relationship between feature normalization and PSGD with Kronecker product
preconditioners, which explains the excellent performance of Kronecker product
preconditioners in deep neural network learning. A software package
(https://github.com/lixilinx/psgd_tf) implemented in Tensorflow is provided to
compare variations of stochastic gradient descent (SGD) and PSGD with five
different preconditioners on a wide range of benchmark problems with commonly
used neural network architectures, e.g., convolutional and recurrent neural
networks. Experimental results clearly demonstrate the advantages of PSGD in
terms of generalization performance and convergence speed.
|
stat.ML cs.LG
|
this paper proposes a family of online second order methods for possibly nonconvex stochastic optimizations based on the theory of preconditioned stochastic gradient descent psgd which can be regarded as an enhance stochastic newton method with the ability to handle gradient noise and nonconvexity simultaneously we have improved the implementations of the original psgd in several ways eg new forms of preconditioners more accurate hessian vector product calculations and better numerical stability with vanishing or illconditioned hessian etc we also have unrevealed the relationship between feature normalization and psgd with kronecker product preconditioners which explains the excellent performance of kronecker product preconditioners in deep neural network learning a software package httpsgithubcomlixilinxpsgd_tf implemented in tensorflow is provided to compare variations of stochastic gradient descent sgd and psgd with five different preconditioners on a wide range of benchmark problems with commonly used neural network architectures eg convolutional and recurrent neural networks experimental results clearly demonstrate the advantages of psgd in terms of generalization performance and convergence speed
|
[['this', 'paper', 'proposes', 'a', 'family', 'of', 'online', 'second', 'order', 'methods', 'for', 'possibly', 'nonconvex', 'stochastic', 'optimizations', 'based', 'on', 'the', 'theory', 'of', 'preconditioned', 'stochastic', 'gradient', 'descent', 'psgd', 'which', 'can', 'be', 'regarded', 'as', 'an', 'enhance', 'stochastic', 'newton', 'method', 'with', 'the', 'ability', 'to', 'handle', 'gradient', 'noise', 'and', 'nonconvexity', 'simultaneously', 'we', 'have', 'improved', 'the', 'implementations', 'of', 'the', 'original', 'psgd', 'in', 'several', 'ways', 'eg', 'new', 'forms', 'of', 'preconditioners', 'more', 'accurate', 'hessian', 'vector', 'product', 'calculations', 'and', 'better', 'numerical', 'stability', 'with', 'vanishing', 'or', 'illconditioned', 'hessian', 'etc', 'we', 'also', 'have', 'unrevealed', 'the', 'relationship', 'between', 'feature', 'normalization', 'and', 'psgd', 'with', 'kronecker', 'product', 'preconditioners', 'which', 'explains', 'the', 'excellent', 'performance', 'of', 'kronecker', 'product', 'preconditioners', 'in', 'deep', 'neural', 'network', 'learning', 'a', 'software', 'package', 'httpsgithubcomlixilinxpsgd_tf', 'implemented', 'in', 'tensorflow', 'is', 'provided', 'to', 'compare', 'variations', 'of', 'stochastic', 'gradient', 'descent', 'sgd', 'and', 'psgd', 'with', 'five', 'different', 'preconditioners', 'on', 'a', 'wide', 'range', 'of', 'benchmark', 'problems', 'with', 'commonly', 'used', 'neural', 'network', 'architectures', 'eg', 'convolutional', 'and', 'recurrent', 'neural', 'networks', 'experimental', 'results', 'clearly', 'demonstrate', 'the', 'advantages', 'of', 'psgd', 'in', 'terms', 'of', 'generalization', 'performance', 'and', 'convergence', 'speed']]
|
[-0.05733593464360527, -0.05301319429764124, -0.06548071683174363, 0.0452602121314579, -0.08727739787115375, -0.20059858689300444, -0.02481531790207799, 0.4420533058767366, -0.33843745959059496, -0.30120986592160853, 0.11152061293108911, -0.21633987709107558, -0.24188105922288874, 0.21548228372717504, -0.12785964971976127, 0.1301387848457458, 0.15012555839153144, -0.025374814964512864, -0.16359829804636453, -0.3175613087383326, 0.27060942071001615, 0.08188688648114316, 0.2920834709050435, 0.003233791317609025, 0.1326723974141315, -0.07940878989686054, -0.005195976775877814, 0.0157271673059568, -0.027291994564598653, 0.1896986426990025, 0.28643266423094293, 0.16889040114744225, 0.35234045219130633, -0.43633473813306634, -0.18551384631339204, 0.11933821453656093, 0.16745215157744697, 0.065559777299158, -0.03327935340392997, -0.27321271069075276, 0.08438070084922379, -0.20001720149842342, -0.05116595354544499, -0.2057170696647429, -0.09259886454177521, 0.0874918902913256, -0.3039813693052033, 0.04279324638770138, 0.04724403790257894, 0.04413004597318366, -0.035710501231866455, -0.20284196710577462, 0.03416710498844978, 0.04398810051568988, 0.05343299910281331, 0.012560389622926667, 0.12672172901050255, -0.10580226578664534, -0.1538018424577852, 0.32112376310787355, -0.11483328641610924, -0.2554554450723184, 0.18634718538562925, 0.028077637844878, -0.17289519998835537, 0.08774425502491706, 0.2681943355184957, 0.143114128550401, -0.13201292214074695, 0.04739492409223713, 0.009018818403469263, 0.12363000012502619, 0.04088199573424191, -0.004841528803187496, 0.0884952100800214, 0.21047786459796664, 0.10711630886113953, 0.14260016688324578, -0.07357275454191173, -0.1476652867206168, -0.21130370412578398, -0.11842350047370973, -0.15817775580146146, -0.00887445258487743, -0.19054553495729257, -0.20758464235440466, 0.4223248846033906, 0.1713572978964205, 0.1759493062045516, 0.10493934284341976, 0.3493704732348461, 0.07604424800743667, 0.10770255080303574, 0.1375254634370255, 0.19165141934744742, 0.16035018089261452, 0.15642901605829915, -0.20794557068420988, 0.0826728818994924, 0.12325768086387742]
|
1,803.09384
|
Tame topology of arithmetic quotients and algebraicity of Hodge loci
|
We prove that the uniformizing map of any arithmetic quotient, as well as the
period map associated to any pure polarized $\mathbb{Z}$-variation of Hodge
structure $\mathbb{V}$ on a smooth complex quasi-projective variety $S$, are
topologically tame. As an easy corollary of these results and of
Peterzil-Starchenko's o-minimal GAGA theorem we obtain that the Hodge locus of
$(S, \mathbb{V})$ is a countable union of algebraic subvarieties of $S$ (a
result originally due to Cattani-Deligne-Kaplan).
|
math.AG math.DG math.LO
|
we prove that the uniformizing map of any arithmetic quotient as well as the period map associated to any pure polarized mathbbzvariation of hodge structure mathbbv on a smooth complex quasiprojective variety s are topologically tame as an easy corollary of these results and of peterzilstarchenkos ominimal gaga theorem we obtain that the hodge locus of s mathbbv is a countable union of algebraic subvarieties of s a result originally due to cattanidelignekaplan
|
[['we', 'prove', 'that', 'the', 'uniformizing', 'map', 'of', 'any', 'arithmetic', 'quotient', 'as', 'well', 'as', 'the', 'period', 'map', 'associated', 'to', 'any', 'pure', 'polarized', 'mathbbzvariation', 'of', 'hodge', 'structure', 'mathbbv', 'on', 'a', 'smooth', 'complex', 'quasiprojective', 'variety', 's', 'are', 'topologically', 'tame', 'as', 'an', 'easy', 'corollary', 'of', 'these', 'results', 'and', 'of', 'peterzilstarchenkos', 'ominimal', 'gaga', 'theorem', 'we', 'obtain', 'that', 'the', 'hodge', 'locus', 'of', 's', 'mathbbv', 'is', 'a', 'countable', 'union', 'of', 'algebraic', 'subvarieties', 'of', 's', 'a', 'result', 'originally', 'due', 'to', 'cattanidelignekaplan']]
|
[-0.20601856415825232, 0.0427861273473744, -0.13726985001204803, 0.09771841336873227, -0.1150821415840515, -0.12203058610404176, 0.03520566626851048, 0.31636857925248996, -0.37353416995278427, -0.18300827326519148, 0.10949229329292264, -0.19245131297835283, -0.14459989661949554, 0.24131508613354527, -0.18386993883177638, -0.04202763997018337, 0.03206878365017474, 0.08827847223063665, -0.06526515511296956, -0.2902074159688449, 0.4356646281267915, -0.11121375848140036, 0.2014783579457019, 0.06865743014163204, 0.11502079233261091, 0.003703317219125373, -0.002362163027698573, -0.02004421116518123, -0.1292328872129604, 0.10463666283924665, 0.37054299084203585, 0.10424716311307358, 0.14703730489459954, -0.36062668836010353, -0.14037762634190065, 0.22685212361892418, 0.09203398052070821, 0.018823500363422292, 0.05104365628836344, -0.27279498539865016, 0.12452977501255061, -0.15016167990065046, -0.23212686348706485, -0.13899857415152447, 0.09293276303713875, 0.037085290319685424, -0.22336673853403358, -0.0243204042182437, 0.15683136342392703, 0.16625528690804328, -0.04782365079570029, -0.08761601650122819, -0.1609810724954254, 0.02634652773849666, -0.019637548873600152, 0.16451749158357934, 0.07868264608883432, -0.04604086527334792, -0.13716651922357934, 0.3615237079560757, -0.12365819234400988, -0.18795716439240745, 0.15351697211819035, -0.14800076746780957, -0.15968298001347908, 0.15712602034743342, 0.06377239610467639, 0.1848758372145572, 0.04656962205439673, 0.21918311297278187, -0.1871351647722934, 0.08163580575159618, 0.13173718314750918, 0.01681756394349837, 0.1147434601560235, 0.08391802261716554, 0.10308416765515825, 0.13407192463387868, -0.0022767731096662047, -0.0012414404390645878, -0.3799974346533418, -0.2003239921759814, -0.1445990370686299, 0.2127530428713986, -0.1365542126019136, -0.23744724709540604, 0.3673951987709318, -0.017043773158054266, 0.19360134835754123, 0.11112048085778951, 0.23231228736362286, 0.03174683554929548, 0.023340728286296197, 0.03578614740898567, 0.05195302963256836, 0.2719379444473556, -0.07116239078209868, -0.1023676015802526, -0.0007627317748431649, 0.1786354415916971]
|
1,803.09385
|
Quantifying the quantumness of ensembles via unitary similarity
invariant norms
|
The quantification of the quantumness of a quantum ensemble has theoretical
and practical significance in quantum information theory. We propose herein a
class of measures of the quantumness of quantum ensembles using the unitary
similarity invariant norms of the commutators of the constituent density
operators of an ensemble. Rigorous proof shows that they share desirable
properties for a measure of quantumness, such as positivity, unitary
invariance, concavity under probabilistic union, convexity under state
decomposition, decreasing under coarse graining, and increasing under fine
graining. Several specific examples illustrate the applications of these
measures of quantumness in studying quantum information.
|
quant-ph
|
the quantification of the quantumness of a quantum ensemble has theoretical and practical significance in quantum information theory we propose herein a class of measures of the quantumness of quantum ensembles using the unitary similarity invariant norms of the commutators of the constituent density operators of an ensemble rigorous proof shows that they share desirable properties for a measure of quantumness such as positivity unitary invariance concavity under probabilistic union convexity under state decomposition decreasing under coarse graining and increasing under fine graining several specific examples illustrate the applications of these measures of quantumness in studying quantum information
|
[['the', 'quantification', 'of', 'the', 'quantumness', 'of', 'a', 'quantum', 'ensemble', 'has', 'theoretical', 'and', 'practical', 'significance', 'in', 'quantum', 'information', 'theory', 'we', 'propose', 'herein', 'a', 'class', 'of', 'measures', 'of', 'the', 'quantumness', 'of', 'quantum', 'ensembles', 'using', 'the', 'unitary', 'similarity', 'invariant', 'norms', 'of', 'the', 'commutators', 'of', 'the', 'constituent', 'density', 'operators', 'of', 'an', 'ensemble', 'rigorous', 'proof', 'shows', 'that', 'they', 'share', 'desirable', 'properties', 'for', 'a', 'measure', 'of', 'quantumness', 'such', 'as', 'positivity', 'unitary', 'invariance', 'concavity', 'under', 'probabilistic', 'union', 'convexity', 'under', 'state', 'decomposition', 'decreasing', 'under', 'coarse', 'graining', 'and', 'increasing', 'under', 'fine', 'graining', 'several', 'specific', 'examples', 'illustrate', 'the', 'applications', 'of', 'these', 'measures', 'of', 'quantumness', 'in', 'studying', 'quantum', 'information']]
|
[-0.120361712832498, 0.1649107847480657, -0.13687096889681963, 0.09701216151481684, 0.02563799704586593, -0.1340396362689457, 0.04280596486250015, 0.3389340983323601, -0.29768320652941355, -0.2247497267707498, 0.05605126766259877, -0.2651071718190702, -0.14152999941677769, 0.1503471444950116, -0.11769605162363424, 0.17658470187108127, 0.0632599274941473, 0.07204782128172489, -0.15719429633879503, -0.2191626208796337, 0.3647206158481766, 0.07030662077441051, 0.32787071158919406, 0.09126751843545282, 0.13344846313287104, 0.011461261455428475, 0.0009721919647132864, 0.023653737898935014, -0.12503702414249682, 0.1444812340813936, 0.2536543950341091, 0.20150456461599286, 0.320515762786476, -0.3649760420833315, -0.23442103406556938, 0.1247240700996576, 0.06635565035121173, 0.0830199123569289, -0.02749449758771427, -0.34329135320624526, 0.04285700573129769, -0.15715723632530745, -0.12161257022953763, -0.1942752368025938, 0.0012522647537443104, -0.0005561730596331917, -0.22873954860997214, 0.0988282999641509, 0.1017028066182357, 0.15782926992836352, -0.01656948714231958, -0.06851018875438188, 0.03577149791966135, 0.11535190010196245, -0.016285216739895393, -0.08245267310151261, 0.1857052190319578, -0.10113601409354989, -0.13431079183914224, 0.36993936847239656, -0.043370385782565087, -0.24161613619487202, 0.16644608302574074, -0.07677296552407954, -0.19763057413796076, 0.02057130439967221, 0.12755095488296783, 0.07474290372385663, -0.1321897479498816, 0.09386193145860025, -0.08035990415848981, 0.1530084219019936, 0.07594585446260717, 0.19653637745959343, 0.1666279326820252, 0.09961632550313916, 0.13352890687576513, 0.1562835668422738, -0.002066873736223396, -0.20468131794442176, -0.34835296124219894, -0.21431238007997827, -0.2288854419876232, 0.13732103823817202, -0.16639404783318798, -0.18910163819637835, 0.42138512692965413, 0.15202340077652182, 0.15261667594313622, 0.06604600311922175, 0.21921322152626757, 0.08994572334899092, 0.0422870895067439, 0.01253950434299756, 0.18568492735728945, 0.23666346125418738, 0.02463916002069505, -0.22774101542879124, 0.07711429284334335, 0.10129283651072836]
|
1,803.09386
|
A Systematic Comparison of Deep Learning Architectures in an Autonomous
Vehicle
|
Self-driving technology is advancing rapidly --- albeit with significant
challenges and limitations. This progress is largely due to recent developments
in deep learning algorithms. To date, however, there has been no systematic
comparison of how different deep learning architectures perform at such tasks,
or an attempt to determine a correlation between classification performance and
performance in an actual vehicle, a potentially critical factor in developing
self-driving systems. Here, we introduce the first controlled comparison of
multiple deep-learning architectures in an end-to-end autonomous driving task
across multiple testing conditions. We compared performance, under identical
driving conditions, across seven architectures including a fully-connected
network, a simple 2 layer CNN, AlexNet, VGG-16, Inception-V3, ResNet, and an
LSTM by assessing the number of laps each model was able to successfully
complete without crashing while traversing an indoor racetrack. We compared
performance across models when the conditions exactly matched those in training
as well as when the local environment and track were configured differently and
objects that were not included in the training dataset were placed on the track
in various positions. In addition, we considered performance using several
different data types for training and testing including single grayscale and
color frames, and multiple grayscale frames stacked together in sequence. With
the exception of a fully-connected network, all models performed reasonably
well (around or above 80\%) and most very well (~95\%) on at least one input
type but with considerable variation across models and inputs. Overall,
AlexNet, operating on single color frames as input, achieved the best level of
performance (100\% success rate in phase one and 55\% in phase two) while
VGG-16 performed well most consistently across image types.
|
cs.LG cs.CV cs.RO stat.ML
|
selfdriving technology is advancing rapidly albeit with significant challenges and limitations this progress is largely due to recent developments in deep learning algorithms to date however there has been no systematic comparison of how different deep learning architectures perform at such tasks or an attempt to determine a correlation between classification performance and performance in an actual vehicle a potentially critical factor in developing selfdriving systems here we introduce the first controlled comparison of multiple deeplearning architectures in an endtoend autonomous driving task across multiple testing conditions we compared performance under identical driving conditions across seven architectures including a fullyconnected network a simple 2 layer cnn alexnet vgg16 inceptionv3 resnet and an lstm by assessing the number of laps each model was able to successfully complete without crashing while traversing an indoor racetrack we compared performance across models when the conditions exactly matched those in training as well as when the local environment and track were configured differently and objects that were not included in the training dataset were placed on the track in various positions in addition we considered performance using several different data types for training and testing including single grayscale and color frames and multiple grayscale frames stacked together in sequence with the exception of a fullyconnected network all models performed reasonably well around or above 80 and most very well 95 on at least one input type but with considerable variation across models and inputs overall alexnet operating on single color frames as input achieved the best level of performance 100 success rate in phase one and 55 in phase two while vgg16 performed well most consistently across image types
|
[['selfdriving', 'technology', 'is', 'advancing', 'rapidly', 'albeit', 'with', 'significant', 'challenges', 'and', 'limitations', 'this', 'progress', 'is', 'largely', 'due', 'to', 'recent', 'developments', 'in', 'deep', 'learning', 'algorithms', 'to', 'date', 'however', 'there', 'has', 'been', 'no', 'systematic', 'comparison', 'of', 'how', 'different', 'deep', 'learning', 'architectures', 'perform', 'at', 'such', 'tasks', 'or', 'an', 'attempt', 'to', 'determine', 'a', 'correlation', 'between', 'classification', 'performance', 'and', 'performance', 'in', 'an', 'actual', 'vehicle', 'a', 'potentially', 'critical', 'factor', 'in', 'developing', 'selfdriving', 'systems', 'here', 'we', 'introduce', 'the', 'first', 'controlled', 'comparison', 'of', 'multiple', 'deeplearning', 'architectures', 'in', 'an', 'endtoend', 'autonomous', 'driving', 'task', 'across', 'multiple', 'testing', 'conditions', 'we', 'compared', 'performance', 'under', 'identical', 'driving', 'conditions', 'across', 'seven', 'architectures', 'including', 'a', 'fullyconnected', 'network', 'a', 'simple', '2', 'layer', 'cnn', 'alexnet', 'vgg16', 'inceptionv3', 'resnet', 'and', 'an', 'lstm', 'by', 'assessing', 'the', 'number', 'of', 'laps', 'each', 'model', 'was', 'able', 'to', 'successfully', 'complete', 'without', 'crashing', 'while', 'traversing', 'an', 'indoor', 'racetrack', 'we', 'compared', 'performance', 'across', 'models', 'when', 'the', 'conditions', 'exactly', 'matched', 'those', 'in', 'training', 'as', 'well', 'as', 'when', 'the', 'local', 'environment', 'and', 'track', 'were', 'configured', 'differently', 'and', 'objects', 'that', 'were', 'not', 'included', 'in', 'the', 'training', 'dataset', 'were', 'placed', 'on', 'the', 'track', 'in', 'various', 'positions', 'in', 'addition', 'we', 'considered', 'performance', 'using', 'several', 'different', 'data', 'types', 'for', 'training', 'and', 'testing', 'including', 'single', 'grayscale', 'and', 'color', 'frames', 'and', 'multiple', 'grayscale', 'frames', 'stacked', 'together', 'in', 'sequence', 'with', 'the', 'exception', 'of', 'a', 'fullyconnected', 'network', 'all', 'models', 'performed', 'reasonably', 'well', 'around', 'or', 'above', '80', 'and', 'most', 'very', 'well', '95', 'on', 'at', 'least', 'one', 'input', 'type', 'but', 'with', 'considerable', 'variation', 'across', 'models', 'and', 'inputs', 'overall', 'alexnet', 'operating', 'on', 'single', 'color', 'frames', 'as', 'input', 'achieved', 'the', 'best', 'level', 'of', 'performance', '100', 'success', 'rate', 'in', 'phase', 'one', 'and', '55', 'in', 'phase', 'two', 'while', 'vgg16', 'performed', 'well', 'most', 'consistently', 'across', 'image', 'types']]
|
[-0.06820020496923422, 0.033189941357226825, 0.0005558438184433174, 0.03973018871722267, -0.030809285040149452, -0.19880457240200167, 0.03804982136544112, 0.4840706502644848, -0.21980223474755584, -0.3944456009874052, 0.08934946299613841, -0.2565903130164166, -0.137226675057539, 0.22399688018468908, -0.11871256670799024, 0.10613004081112666, 0.11746634190764454, 0.0492831073475349, -0.06784599192056424, -0.308850973962643, 0.2544826525892301, 0.044744612810322604, 0.3518681674276905, 0.0012314103169444894, 0.10797413792860538, -0.04225372810581237, -0.0025814401230564083, -0.006416366172590749, -0.02452138884781276, 0.06531982070487673, 0.27658411033246716, 0.12365583460659034, 0.2943845039801196, -0.4545348508654835, -0.21864903973751992, 0.08231365035566753, 0.14406624684504565, 0.08791789513023529, -0.02507119302265686, -0.29449500550301816, 0.09036683269528278, -0.17378450002322435, -0.0012749111361420938, -0.0797215343731707, -0.009660113602876663, 0.004155679021700265, -0.2506834012507223, 0.012302694412672307, 0.036298881191845274, 0.09604890698934124, -0.07258611793177759, -0.14345065819398656, 0.008945722006733808, 0.20884316914861878, -0.0028994348576550717, 0.0712987041517448, 0.1377896212626004, -0.20709232123565255, -0.13502647620511077, 0.36891340490185864, -0.07587094447935802, -0.18011533305980265, 0.24350103202622628, -0.04865800615410273, -0.14965215163053877, 0.09254458975973097, 0.2115776690545689, 0.09484682065591107, -0.18531811925513333, -0.027015130539266664, 0.011764808737224198, 0.1912176909373842, 0.09326465902034276, 0.01650194155798382, 0.19791868644644145, 0.2684157967744191, 0.010293191810390049, 0.1313427341120474, -0.1471114797682508, -0.08167988484059155, -0.21640492171575113, -0.07387405322749085, -0.1430718049837827, -0.0268470427330161, -0.09662373051886237, -0.10907909430114783, 0.40477429480584215, 0.1918602356700784, 0.24313053998239612, 0.07549589425850112, 0.3506634998675708, 0.0011024845990923362, 0.15492746394882181, 0.10907665555799605, 0.2206347640200151, 0.01795328051586003, 0.12373479557509133, -0.13260915152555208, 0.06898408145414339, -0.002923136905118667]
|
1,803.09387
|
3D Asymmetrical motions of the Galactic outer disk with LAMOST K giant
stars
|
We present a three dimensional velocity analysis of Milky Way disk kinematics
using LAMOST K giant stars and the GPS1 proper motion catalogue. We find that
Galactic disk stars near the anticenter direction (in the range of
Galactocentric distance between $R=8$ and $13$ kpc and vertical position
between $Z=-2$ and $2$ kpc) exhibit asymmetrical motions in the Galactocentric
radial, azimuthal, and vertical components. Radial motions are not zero, thus
departing from circularity in the orbits; they increase outwards within
$R\lesssim 12$ kpc, show some oscillation in the northern ($0 < Z < 2$ kpc)
stars, and have north-south asymmetry in the region corresponding to a
well-known nearby northern structure in the velocity field. There is a clear
vertical gradient in azimuthal velocity, and also an asymmetry that shifts from
a larger azimuthal velocity above the plane near the solar radius to faster
rotation below the plane at radii of 11-12 kpc. Stars both above and below the
plane at $R\gtrsim 9$ kpc exhibit net upward vertical motions. We discuss some
possible mechanisms that might create the asymmetrical motions, such as
external perturbations due to dwarf galaxy minor mergers or dark matter
sub-halos, warp dynamics, internal processes due to spiral arms or the Galactic
bar, and (most likely) a combination of some or all of these components.
|
astro-ph.GA
|
we present a three dimensional velocity analysis of milky way disk kinematics using lamost k giant stars and the gps1 proper motion catalogue we find that galactic disk stars near the anticenter direction in the range of galactocentric distance between r8 and 13 kpc and vertical position between z2 and 2 kpc exhibit asymmetrical motions in the galactocentric radial azimuthal and vertical components radial motions are not zero thus departing from circularity in the orbits they increase outwards within rlesssim 12 kpc show some oscillation in the northern 0 z 2 kpc stars and have northsouth asymmetry in the region corresponding to a wellknown nearby northern structure in the velocity field there is a clear vertical gradient in azimuthal velocity and also an asymmetry that shifts from a larger azimuthal velocity above the plane near the solar radius to faster rotation below the plane at radii of 1112 kpc stars both above and below the plane at rgtrsim 9 kpc exhibit net upward vertical motions we discuss some possible mechanisms that might create the asymmetrical motions such as external perturbations due to dwarf galaxy minor mergers or dark matter subhalos warp dynamics internal processes due to spiral arms or the galactic bar and most likely a combination of some or all of these components
|
[['we', 'present', 'a', 'three', 'dimensional', 'velocity', 'analysis', 'of', 'milky', 'way', 'disk', 'kinematics', 'using', 'lamost', 'k', 'giant', 'stars', 'and', 'the', 'gps1', 'proper', 'motion', 'catalogue', 'we', 'find', 'that', 'galactic', 'disk', 'stars', 'near', 'the', 'anticenter', 'direction', 'in', 'the', 'range', 'of', 'galactocentric', 'distance', 'between', 'r8', 'and', '13', 'kpc', 'and', 'vertical', 'position', 'between', 'z2', 'and', '2', 'kpc', 'exhibit', 'asymmetrical', 'motions', 'in', 'the', 'galactocentric', 'radial', 'azimuthal', 'and', 'vertical', 'components', 'radial', 'motions', 'are', 'not', 'zero', 'thus', 'departing', 'from', 'circularity', 'in', 'the', 'orbits', 'they', 'increase', 'outwards', 'within', 'rlesssim', '12', 'kpc', 'show', 'some', 'oscillation', 'in', 'the', 'northern', '0', 'z', '2', 'kpc', 'stars', 'and', 'have', 'northsouth', 'asymmetry', 'in', 'the', 'region', 'corresponding', 'to', 'a', 'wellknown', 'nearby', 'northern', 'structure', 'in', 'the', 'velocity', 'field', 'there', 'is', 'a', 'clear', 'vertical', 'gradient', 'in', 'azimuthal', 'velocity', 'and', 'also', 'an', 'asymmetry', 'that', 'shifts', 'from', 'a', 'larger', 'azimuthal', 'velocity', 'above', 'the', 'plane', 'near', 'the', 'solar', 'radius', 'to', 'faster', 'rotation', 'below', 'the', 'plane', 'at', 'radii', 'of', '1112', 'kpc', 'stars', 'both', 'above', 'and', 'below', 'the', 'plane', 'at', 'rgtrsim', '9', 'kpc', 'exhibit', 'net', 'upward', 'vertical', 'motions', 'we', 'discuss', 'some', 'possible', 'mechanisms', 'that', 'might', 'create', 'the', 'asymmetrical', 'motions', 'such', 'as', 'external', 'perturbations', 'due', 'to', 'dwarf', 'galaxy', 'minor', 'mergers', 'or', 'dark', 'matter', 'subhalos', 'warp', 'dynamics', 'internal', 'processes', 'due', 'to', 'spiral', 'arms', 'or', 'the', 'galactic', 'bar', 'and', 'most', 'likely', 'a', 'combination', 'of', 'some', 'or', 'all', 'of', 'these', 'components']]
|
[-0.1434148196122831, 0.1538124758289571, -0.0718351850312238, 0.06439341851520987, -0.12247922808523769, -0.02129430933020439, 0.011529047239058277, 0.43672172250726615, -0.2399398886208873, -0.32975622170352353, 0.003290342675656881, -0.29097430877143815, -0.012250823507337857, 0.19292208344662545, 0.0063235897234386424, -0.06917348058152265, 0.03534398461794307, -0.06531584484553808, -0.05597004983721031, -0.18803598993962684, 0.2553174258715682, 0.022048283629739554, 0.1195111256897902, -0.05005735546059033, 0.06302454961990397, -0.11542130467888821, -0.037913022652076925, 0.014102555900620662, -0.19277856337005425, 0.005771190054262075, 0.18227615881574974, 0.0636623701750884, 0.21428379804607497, -0.34197344949085995, -0.16026452614133743, 0.06653193961915986, 0.2534863882476168, 0.06247308362867231, -0.05725805034352196, -0.27225076016822014, 0.08968616134234678, -0.1447819229498007, -0.27320360178432523, 0.07496770888688827, 0.1146033329613916, 0.047465733905261924, -0.1633166877879809, 0.1962250627556361, 0.0837362915817126, 0.16167644955757482, -0.07483905026249622, -0.15123333593843521, -0.11849923217973768, 0.05722254248781763, 0.06737987363491225, 0.14093927851939034, 0.24271572371683667, -0.10082682744300273, -0.019820379672442, 0.3992089753879112, -0.06777545601177404, -0.06932365445193843, 0.2043976561007499, -0.26564563571031546, -0.1093073421741061, 0.12052495788922098, 0.20427345383094153, 0.07267527320752983, -0.11668531257233791, 0.01755136515804845, -0.025824220182491624, 0.18177534796071249, 0.15668820561384172, 0.01275996621552622, 0.34744361435266097, 0.020797728376993996, 0.1605457689761479, 0.026165359540381163, -0.27741033527521397, -0.07953837655281222, -0.2792518227464502, -0.06039656604701114, -0.044317599714550876, 0.03224222207933971, -0.17255253317730804, -0.11347856988399246, 0.3181882986589988, 0.0936052803432669, 0.26806632468093916, 0.011652151463231264, 0.32154395922182877, 0.011677006685510104, 0.1493672170481064, 0.21197252487763762, 0.319226438714769, 0.2135483180912577, 0.0957161522574862, -0.2243101033727556, 0.04051518174993727, -0.023677777094226853]
|
1,803.09388
|
Interference-assisted resonant detection of axions
|
Detection schemes for the quantum chromodynamics axions and other axion-like
particles in light-shining-through-a-wall (LSW) experiments are based on the
conversion of these particles into photons in a magnetic field. An alternative
scheme may involve the detection via a resonant atomic or molecular transition
induced by resonant axion absorption. The signal obtained in this process is
second order in the axion-electron interaction constant but may become first
order if we allow interference between the axion-induced transition amplitude
and the transition amplitude induced by the electromagnetic radiation that
produces the axions.
|
hep-ph astro-ph.CO physics.atom-ph
|
detection schemes for the quantum chromodynamics axions and other axionlike particles in lightshiningthroughawall lsw experiments are based on the conversion of these particles into photons in a magnetic field an alternative scheme may involve the detection via a resonant atomic or molecular transition induced by resonant axion absorption the signal obtained in this process is second order in the axionelectron interaction constant but may become first order if we allow interference between the axioninduced transition amplitude and the transition amplitude induced by the electromagnetic radiation that produces the axions
|
[['detection', 'schemes', 'for', 'the', 'quantum', 'chromodynamics', 'axions', 'and', 'other', 'axionlike', 'particles', 'in', 'lightshiningthroughawall', 'lsw', 'experiments', 'are', 'based', 'on', 'the', 'conversion', 'of', 'these', 'particles', 'into', 'photons', 'in', 'a', 'magnetic', 'field', 'an', 'alternative', 'scheme', 'may', 'involve', 'the', 'detection', 'via', 'a', 'resonant', 'atomic', 'or', 'molecular', 'transition', 'induced', 'by', 'resonant', 'axion', 'absorption', 'the', 'signal', 'obtained', 'in', 'this', 'process', 'is', 'second', 'order', 'in', 'the', 'axionelectron', 'interaction', 'constant', 'but', 'may', 'become', 'first', 'order', 'if', 'we', 'allow', 'interference', 'between', 'the', 'axioninduced', 'transition', 'amplitude', 'and', 'the', 'transition', 'amplitude', 'induced', 'by', 'the', 'electromagnetic', 'radiation', 'that', 'produces', 'the', 'axions']]
|
[-0.16743855724854165, 0.2895548916331903, -0.05672451960487982, 0.07061473889550827, -0.06825254719411389, -0.09204769150741147, 0.053449299759388474, 0.37135858623457424, -0.21248215508092655, -0.3318697338233168, 0.022795388684346433, -0.27376157476493485, -0.10354246857597, 0.18852255568483822, 0.10290409345179796, 0.025483970457081045, 0.00044656145408307463, 0.035246447840538084, 0.013137783052064898, -0.1567707668226003, 0.30427635212303294, 0.05507521624703044, 0.24574459029173248, 0.08367931887277225, 0.08114392815283343, 0.0010512019612229943, 0.011744308015959484, -0.051626606572293836, -0.0943859046214068, 0.06143188695004733, 0.1900198866954607, 0.05237858059418419, 0.16756366221024915, -0.4636669082127595, -0.20788578500740984, 0.1475427752972863, 0.16800251290767212, 0.13883933033584878, -0.11620441563767538, -0.3453059456405345, -0.01276046514845966, -0.12615650463221448, -0.04651141496312417, -0.05012083166341685, -0.032535118190833275, -0.004857519714768683, -0.33001829503794733, 0.06700542241104701, 0.03631695994605007, -0.03537461369068184, -0.025371299148798827, -0.05410968827272064, 0.052839469802932124, 0.029634901183772454, 0.052717716796415216, 0.021916856018700793, 0.1908064617545166, -0.16931729575388887, -0.15940924339373125, 0.4233241823078081, -0.15654656062101463, -0.12125806610905722, 0.161017396605019, -0.14313603984715229, -0.1025694574574741, 0.23182762100288037, 0.15021211762776535, 0.10642179349971036, -0.10887559989906764, 0.08239160019648, 0.050192584696989714, 0.20028602844627386, 0.11042094603965708, 0.061646568622921456, 0.2911728739089678, 0.14261837232481228, 0.019115020892467728, 0.09888651890724667, -0.09834503295329096, -0.06487098879316884, -0.29767356603667977, -0.1272519403294231, -0.16321165926147546, 0.048071526558651184, -0.06240357424664243, -0.1297569744801672, 0.30145460412080705, 0.14007466980465427, 0.15822124029666687, -0.07113415420871605, 0.3501891989124876, 0.1625240483227071, 0.048888677859344004, -0.002239961799736438, 0.385431811129779, 0.1413671288984629, 0.09428373194728674, -0.25649812196811733, 0.010431694557492653, 0.06430496636443259]
|
1,803.09389
|
On graded $\mathbb{E}_{\infty}$-rings and projective schemes in spectral
algebraic geometry
|
We introduce graded $\mathbb{E}_{\infty}$-rings and graded modules over them,
and study their properties. We construct projective schemes associated to
connective $\mathbb{N}$-graded $\mathbb{E}_{\infty}$-rings in spectral
algebraic geometry. Under some finiteness conditions, we show that the
$\infty$-category of almost perfect quasi-coherent sheaves over a spectral
projective scheme $\mathrm{Proj}\,(A)$ associated to a connective
$\mathbb{N}$-graded $\mathbb{E}_{\infty}$-ring $A$ can be described in terms of
$\mathbb{Z}$-graded $A$-modules.
|
math.KT
|
we introduce graded mathbbe_inftyrings and graded modules over them and study their properties we construct projective schemes associated to connective mathbbngraded mathbbe_inftyrings in spectral algebraic geometry under some finiteness conditions we show that the inftycategory of almost perfect quasicoherent sheaves over a spectral projective scheme mathrmproja associated to a connective mathbbngraded mathbbe_inftyring a can be described in terms of mathbbzgraded amodules
|
[['we', 'introduce', 'graded', 'mathbbe_inftyrings', 'and', 'graded', 'modules', 'over', 'them', 'and', 'study', 'their', 'properties', 'we', 'construct', 'projective', 'schemes', 'associated', 'to', 'connective', 'mathbbngraded', 'mathbbe_inftyrings', 'in', 'spectral', 'algebraic', 'geometry', 'under', 'some', 'finiteness', 'conditions', 'we', 'show', 'that', 'the', 'inftycategory', 'of', 'almost', 'perfect', 'quasicoherent', 'sheaves', 'over', 'a', 'spectral', 'projective', 'scheme', 'mathrmproja', 'associated', 'to', 'a', 'connective', 'mathbbngraded', 'mathbbe_inftyring', 'a', 'can', 'be', 'described', 'in', 'terms', 'of', 'mathbbzgraded', 'amodules']]
|
[-0.21933327028527855, 0.009004915738478303, -0.10650563972691694, 0.07835340206511318, -0.07002238559459026, -0.1730305119495218, -0.08008256123090783, 0.4672394398599863, -0.4461284400274356, -0.11861486497024695, 0.08591363478529578, -0.13803767614687482, -0.14203303984443968, 0.21167465389395754, -0.24994744759363433, -0.07387054239710172, 0.04776523970067501, 0.0974925050046295, -0.0889571431519774, -0.28137136390432715, 0.44250223487615586, -0.003877801246320208, 0.24135122319372992, 0.035635592364512074, 0.16595275142947988, 0.020941681849459808, -0.03234874722547829, 0.05762879522517324, -0.20982913882920304, 0.16420611058711074, 0.38123166585961976, 0.04524453119374812, 0.14099548753195754, -0.3530547863415753, -0.11120675819305083, 0.24644187375282248, 0.11307369307614863, -0.0020545516201915842, 0.053420584990332524, -0.25864669783040883, 0.18039463520981372, -0.27667686458056173, -0.11191436558729037, -0.10992216022374729, -0.020002343947999178, 0.049890563400792114, -0.21174519861427446, -0.034939425609384976, 0.051837621908634904, 0.16390616954304277, -0.14627983733080327, -0.00250906081055291, -0.09110083285098275, 0.019124593337376913, -0.13326310788591703, -0.09334569243947044, 0.11568510882401219, -0.08324108091183006, -0.17052078316143404, 0.3387058603266875, -0.09235089719295501, -0.2058050587462882, 0.10161067213242253, -0.15487907718246183, -0.09486009958200156, 0.13497675341398765, 0.0023470606499662, 0.17633587835395398, 0.0217174652342995, 0.2208796940260072, -0.14589968489017338, 0.08388579168046514, 0.11443526344373822, 0.1011905440983052, 0.10428701258109262, 0.059632015622385855, 0.021807645928735533, 0.12716434833710083, 0.050126320148410744, -0.027080065663903953, -0.3545556528493762, -0.20913865144830196, -0.01145299319177866, 0.2078112796569864, -0.10215518792732231, -0.1786629109332959, 0.46401288051292794, 0.09398650644191851, 0.20673227802229424, 0.1506492584788551, 0.23561749241004387, -0.01521512825662891, 0.04921683822370445, 0.011295869026798754, 0.0708963933813114, 0.3052757571140925, -0.03886753502689923, -0.0760841931992521, -0.03252661349251866, 0.2472754133399576]
|
1,803.0939
|
21cm Limits on Decaying Dark Matter and Primordial Black Holes
|
Recently the Experiment to Detect the Global Epoch of Reionization Signature
(EDGES) reported the detection of a 21cm absorption signal stronger than
astrophysical expectations. In this paper we study the impact of radiation from
dark matter (DM) decay and primordial black holes (PBH) on the 21cm radiation
temperature in the reionization epoch, and impose a constraint on the decaying
dark matter and PBH energy injection in the intergalactic medium, which can
heat up neutral hydrogen gas and weaken the 21cm absorption signal. We consider
decay channels DM$\rightarrow e^+e^-, \gamma\gamma$, $\mu^+\mu^-$, $b\bar{b}$
and the $10^{15-17}$g mass range for primordial black holes, and require the
heating of the neutral hydrogen does not negate the 21cm absorption signal. For
$e^+e^-$, $\gamma\gamma$ final states and PBH cases we find strong 21cm bounds
that can be more stringent than the current extragalactic diffuse photon
bounds. For the DM$\rightarrow e^+e^-$ channel, the lifetime bound is
$\tau_{\rm DM}> 10^{27}$s for sub-GeV dark matter. The bound is $\tau_{\rm
DM}\ge 10^{26}$s for sub-GeV DM$\rightarrow \gamma\gamma$ channel and reaches
$10^{27}$s at MeV DM mass. For $b\bar{b}$ and $\mu^+\mu^-$ cases, the 21 cm
constraint is better than all the existing constraints for $m_{\rm DM}<20$ GeV
where the bound on $\tau_{\rm DM}\ge10^{26}$s. For both DM decay and primordial
black hole cases, the 21cm bounds significantly improve over the CMB damping
limits from Planck data.
|
astro-ph.HE hep-ph
|
recently the experiment to detect the global epoch of reionization signature edges reported the detection of a 21cm absorption signal stronger than astrophysical expectations in this paper we study the impact of radiation from dark matter dm decay and primordial black holes pbh on the 21cm radiation temperature in the reionization epoch and impose a constraint on the decaying dark matter and pbh energy injection in the intergalactic medium which can heat up neutral hydrogen gas and weaken the 21cm absorption signal we consider decay channels dmrightarrow ee gammagamma mumu bbarb and the 101517g mass range for primordial black holes and require the heating of the neutral hydrogen does not negate the 21cm absorption signal for ee gammagamma final states and pbh cases we find strong 21cm bounds that can be more stringent than the current extragalactic diffuse photon bounds for the dmrightarrow ee channel the lifetime bound is tau_rm dm 1027s for subgev dark matter the bound is tau_rm dmge 1026s for subgev dmrightarrow gammagamma channel and reaches 1027s at mev dm mass for bbarb and mumu cases the 21 cm constraint is better than all the existing constraints for m_rm dm20 gev where the bound on tau_rm dmge1026s for both dm decay and primordial black hole cases the 21cm bounds significantly improve over the cmb damping limits from planck data
|
[['recently', 'the', 'experiment', 'to', 'detect', 'the', 'global', 'epoch', 'of', 'reionization', 'signature', 'edges', 'reported', 'the', 'detection', 'of', 'a', '21cm', 'absorption', 'signal', 'stronger', 'than', 'astrophysical', 'expectations', 'in', 'this', 'paper', 'we', 'study', 'the', 'impact', 'of', 'radiation', 'from', 'dark', 'matter', 'dm', 'decay', 'and', 'primordial', 'black', 'holes', 'pbh', 'on', 'the', '21cm', 'radiation', 'temperature', 'in', 'the', 'reionization', 'epoch', 'and', 'impose', 'a', 'constraint', 'on', 'the', 'decaying', 'dark', 'matter', 'and', 'pbh', 'energy', 'injection', 'in', 'the', 'intergalactic', 'medium', 'which', 'can', 'heat', 'up', 'neutral', 'hydrogen', 'gas', 'and', 'weaken', 'the', '21cm', 'absorption', 'signal', 'we', 'consider', 'decay', 'channels', 'dmrightarrow', 'ee', 'gammagamma', 'mumu', 'bbarb', 'and', 'the', '101517g', 'mass', 'range', 'for', 'primordial', 'black', 'holes', 'and', 'require', 'the', 'heating', 'of', 'the', 'neutral', 'hydrogen', 'does', 'not', 'negate', 'the', '21cm', 'absorption', 'signal', 'for', 'ee', 'gammagamma', 'final', 'states', 'and', 'pbh', 'cases', 'we', 'find', 'strong', '21cm', 'bounds', 'that', 'can', 'be', 'more', 'stringent', 'than', 'the', 'current', 'extragalactic', 'diffuse', 'photon', 'bounds', 'for', 'the', 'dmrightarrow', 'ee', 'channel', 'the', 'lifetime', 'bound', 'is', 'tau_rm', 'dm', '1027s', 'for', 'subgev', 'dark', 'matter', 'the', 'bound', 'is', 'tau_rm', 'dmge', '1026s', 'for', 'subgev', 'dmrightarrow', 'gammagamma', 'channel', 'and', 'reaches', '1027s', 'at', 'mev', 'dm', 'mass', 'for', 'bbarb', 'and', 'mumu', 'cases', 'the', '21', 'cm', 'constraint', 'is', 'better', 'than', 'all', 'the', 'existing', 'constraints', 'for', 'm_rm', 'dm20', 'gev', 'where', 'the', 'bound', 'on', 'tau_rm', 'dmge1026s', 'for', 'both', 'dm', 'decay', 'and', 'primordial', 'black', 'hole', 'cases', 'the', '21cm', 'bounds', 'significantly', 'improve', 'over', 'the', 'cmb', 'damping', 'limits', 'from', 'planck', 'data']]
|
[-0.07920794589194378, 0.18098324100073013, -0.01719282558230959, 0.17307118805560837, -0.0785201347743741, -0.1275054475150278, 0.023035527265703962, 0.29398467504264164, -0.149513811069213, -0.32083595794177167, 0.0012762141184928758, -0.35045991625197026, 0.06745669990346802, 0.21104218722838494, 0.13379196830188717, 0.045715821074770284, 0.035862724513410486, -0.03934498182584152, -0.02143626544878956, -0.27388771303230897, 0.27239826395331573, 0.15799852290527067, 0.19520814837758532, 0.11918776532359145, 0.006233158981086928, -0.04836784157992548, -0.0688998124721736, -0.1272273784371144, -0.21701997132984413, -0.005814231761582455, 0.19307474859265816, 0.1651984945077587, 0.09114478211267851, -0.3835443618709515, -0.22294641657801414, 0.23626159672858194, 0.19660376291075307, 0.10583715035668488, -0.0637528177152557, -0.36415065781868716, 0.05992828430047397, -0.21884743801180134, 0.012099396607717845, 0.057134003516424586, 0.023120392842597707, -0.0672747475796819, -0.3049854506777289, 0.1607117101138337, 0.005606522537871367, -0.08282280207236505, -0.06812780317570152, -0.12009817080710221, -0.02778941619908437, -0.05198836073934756, 0.06651115107201298, 0.010017947148298845, 0.3036841293710663, -0.19978093795793098, -0.04421204955886222, 0.39934102239742597, -0.18554859898796605, -0.04317174499414654, 0.13726696583998327, -0.22333470128769814, -0.17478515448359153, 0.20283301200510728, 0.2047192120711164, 0.03768342903478899, -0.11969195510351306, 0.14367967824337366, -0.0022256234744283438, 0.23346182882475355, 0.11206475858085065, 0.1272625422926568, 0.34811801873837356, 0.11792100905182047, 0.12630459655419043, 0.028405806897757832, -0.17528684169492745, 0.03851439482618675, -0.27908357856493377, -0.13002548446092987, -0.12438680897563852, 0.10710151482884679, -0.1100721803898826, -0.05156486772304763, 0.32883794088761703, 0.12510386815820648, 0.22941661968003177, 0.07083984627873481, 0.3824634717415797, 0.12509620690468215, -0.01670533215790918, 0.09711733743056862, 0.3799251704002489, 0.1706005260175853, 0.11767617854692852, -0.22938786596879018, 0.040296173824807976, -0.04196604691215153]
|
1,803.09391
|
Have we seen all glitches?
|
Neutron star glitches are observed via artificially scheduled pulsar pulse
arrival-time observations. Detection probability density of glitch events for a
given data set is essentially required knowledge for realizing glitch
detectability with specified observing system and schedule. In Yu & Liu, the
detection probability density was derived for the Yu et al. data set. In this
proceeding, further discussions are presented.
|
astro-ph.HE
|
neutron star glitches are observed via artificially scheduled pulsar pulse arrivaltime observations detection probability density of glitch events for a given data set is essentially required knowledge for realizing glitch detectability with specified observing system and schedule in yu liu the detection probability density was derived for the yu et al data set in this proceeding further discussions are presented
|
[['neutron', 'star', 'glitches', 'are', 'observed', 'via', 'artificially', 'scheduled', 'pulsar', 'pulse', 'arrivaltime', 'observations', 'detection', 'probability', 'density', 'of', 'glitch', 'events', 'for', 'a', 'given', 'data', 'set', 'is', 'essentially', 'required', 'knowledge', 'for', 'realizing', 'glitch', 'detectability', 'with', 'specified', 'observing', 'system', 'and', 'schedule', 'in', 'yu', 'liu', 'the', 'detection', 'probability', 'density', 'was', 'derived', 'for', 'the', 'yu', 'et', 'al', 'data', 'set', 'in', 'this', 'proceeding', 'further', 'discussions', 'are', 'presented']]
|
[-0.12264352538622916, 0.16216851459854903, -0.014650547464649813, 0.06145549012968938, -0.14460139620738724, -0.07440844591862211, 0.1095258180052042, 0.35368519158413014, -0.17027679276652635, -0.4168204065101842, 0.08894676302443258, -0.2902724104661805, -0.07070380033304294, 0.20279413253301753, -0.12318667735283574, 0.1075037756934762, 0.13271190212496245, 0.0018276690777080755, -0.007906344257450352, -0.3014681654824623, 0.2272082816498975, 0.15125983667870363, 0.2445740745558093, -0.04003545692345748, 0.06540461031642432, -0.04059124718963479, -0.12591521322416763, -0.07245545727200806, -0.16279776903490226, -0.008569523117815454, 0.3191961289693912, 0.2564996152805785, 0.1310288813741257, -0.41796341572577755, -0.2579901437585553, 0.09788940181024372, 0.059234788703421755, 0.07714778363394241, -0.07226712707294307, -0.3771507435788711, 0.05306081613525748, -0.23165868688374758, -0.09472530568794658, -0.014986127289012075, 0.1354519844055176, 0.07014296150300652, -0.3012096284267803, 0.08698500391328708, 0.06232472875465949, 0.016562857552586744, -0.06951764590727787, -0.09921046002418735, 0.028073199659896395, 0.007235618207293252, 0.003125176838754366, 0.09477127593321105, 0.09222674213039378, -0.06973250411683693, -0.15373752899467946, 0.2816376731420557, -0.012379850070768346, -0.05796732573459546, 0.12246155008130397, -0.17874426886749764, -0.19070651178093007, 0.15340417676294843, 0.1397005661119086, 0.05973940294546386, -0.18671659907946983, 0.004939871823686796, 0.0016172356399086615, 0.14358969375025482, 0.11934011496293048, -0.022920606099069117, 0.26309819367403786, 0.20624510093378678, 0.015936373554480573, 0.06857720150922736, -0.22123601468047127, 0.00670432628733882, -0.27533410645555706, -0.037747157846267025, -0.2694653631653637, 0.03384193844394758, 0.00011148555228525462, -0.03440621343130867, 0.38199076913297175, 0.14522744417190553, 0.15880683473466586, 0.06996101549593732, 0.23895101233695945, 0.16013861065002857, -0.053379762925518055, 0.13254710602729272, 0.2219344638288021, 0.1400127298819522, 0.07802125099503125, -0.21803820256609469, 0.14195751696048925, 0.03554144707935241]
|
1,803.09392
|
On the square root of the inverse different
|
Let N/F be a finite, normal extension of number fields with Galois group G.
Suppose that N/F is weakly ramified, and that the square root A(N/F) of the
inverse different of N.F is defined. (This latter condition holds if, for
example, G is of odd order.) B. Erez has conjectured that the class (A(N/F)) of
A(N/F) in the locally free class group Cl(ZG) of ZG is equal to the
Cassou-Nogues-Frohlich root number class W(N/F) attached to N/F. We establish a
precise formula for (A(N/F)) - W(N/F) in terms of the signs of certain
symplectic Galois-Gauss sums whenever N/F is tame and (A(N/F)) is defined. We
thereby show that, in general, (A(N/F)) is not equal to W(N/F).
|
math.NT
|
let nf be a finite normal extension of number fields with galois group g suppose that nf is weakly ramified and that the square root anf of the inverse different of nf is defined this latter condition holds if for example g is of odd order b erez has conjectured that the class anf of anf in the locally free class group clzg of zg is equal to the cassounoguesfrohlich root number class wnf attached to nf we establish a precise formula for anf wnf in terms of the signs of certain symplectic galoisgauss sums whenever nf is tame and anf is defined we thereby show that in general anf is not equal to wnf
|
[['let', 'nf', 'be', 'a', 'finite', 'normal', 'extension', 'of', 'number', 'fields', 'with', 'galois', 'group', 'g', 'suppose', 'that', 'nf', 'is', 'weakly', 'ramified', 'and', 'that', 'the', 'square', 'root', 'anf', 'of', 'the', 'inverse', 'different', 'of', 'nf', 'is', 'defined', 'this', 'latter', 'condition', 'holds', 'if', 'for', 'example', 'g', 'is', 'of', 'odd', 'order', 'b', 'erez', 'has', 'conjectured', 'that', 'the', 'class', 'anf', 'of', 'anf', 'in', 'the', 'locally', 'free', 'class', 'group', 'clzg', 'of', 'zg', 'is', 'equal', 'to', 'the', 'cassounoguesfrohlich', 'root', 'number', 'class', 'wnf', 'attached', 'to', 'nf', 'we', 'establish', 'a', 'precise', 'formula', 'for', 'anf', 'wnf', 'in', 'terms', 'of', 'the', 'signs', 'of', 'certain', 'symplectic', 'galoisgauss', 'sums', 'whenever', 'nf', 'is', 'tame', 'and', 'anf', 'is', 'defined', 'we', 'thereby', 'show', 'that', 'in', 'general', 'anf', 'is', 'not', 'equal', 'to', 'wnf']]
|
[-0.19806680637702812, 0.16932323420769535, -0.07075279237220197, 0.029083827608181827, -0.09968496107363276, -0.18365412153070793, -0.0027888564841954838, 0.31187977977762266, -0.2634870761997133, -0.22417933854740113, 0.0585541923594844, -0.24358255081876581, -0.15084411603623135, 0.16309496297201673, -0.08871406510297675, -0.041096830320644324, 0.005454034633917867, 0.17662489449139684, -0.054229971794744154, -0.29466971846496953, 0.3349486295399921, -0.07062019267635021, 0.253871753171552, 0.06173303384275641, 0.10362908806876346, 0.03719886053087456, 0.013264917352768992, 0.029918508701874607, -0.09985062841821803, 0.08044614378533359, 0.29780781260524236, 0.05981511352417458, 0.261157806097929, -0.3127967186238883, -0.1297123394407598, 0.24615887856842683, 0.14119925723311358, -0.02909875538898632, 0.01770087471959414, -0.18074648975328142, 0.20986895161747401, -0.17358536708966962, -0.1914650368604011, -0.024877725153471277, 0.08902706539707392, 0.033988616084181036, -0.3232549554876251, 0.023267622820899954, 0.055493266284689265, 0.10797844752336719, 0.025379225754087593, -0.14120489798265876, -0.02526527109356331, 0.08684621838619933, 0.008169413862300903, 0.08088655743215765, 0.03770139130392636, -0.11552862329543652, -0.07365880857521136, 0.3679029576679958, -0.07313380103732925, -0.24136254282867803, 0.13074320688610896, -0.19467987934643002, -0.14248832592108687, 0.10458942043312293, 0.07691995648825209, 0.12644242415470736, -0.03471496468409896, 0.1898437175540104, -0.15271318921752805, 0.09464726721801396, 0.06126371534940388, -0.04027669124947612, 0.10567868852272763, 0.10260221897832318, 0.11097565536121172, 0.11416908474451962, -0.009416813795853938, 0.009592350909120537, -0.33636532177583184, -0.17397515181385512, -0.17530373246700037, 0.12769595100598963, -0.08483375282516395, -0.17937437555519864, 0.3490302544669248, 0.0561849934996904, 0.10742579807993025, 0.14875586403234461, 0.16556691390828096, 0.12973472906742245, 0.10110987562204952, 0.07405878939451734, 0.0888545309426263, 0.23685438406703593, -0.07211523328442127, -0.18724895126485666, -0.02132794265967927, 0.19578576171936998]
|
1,803.09393
|
A note on $L^2$ boundary integrals of the Bergman kernel
|
For any bounded convex domain $\Omega$ with $C^{2}$ boundary in
$\mathbb{C}^{n}$, we show that there exist positive constants $C_{1}$ and
$C_{2}$ such that \[
C_{1}\sqrt{\dfrac{K\left(w,w\right)}{\delta\left(w\right)}}\leq\left\Vert
K\left(\cdot,w\right)\right\Vert _{L^{2}\left(\partial\Omega\right)}\leq
C_{2}\sqrt{\dfrac{K\left(w,w\right)}{\delta\left(w\right)}}, \] for any
$w\in\Omega$. Here $K$ is the Bergman kernel of $\Omega$, and $\delta$ is the
distance-to-boundary function.
|
math.CV
|
for any bounded convex domain omega with c2 boundary in mathbbcn we show that there exist positive constants c_1 and c_2 such that c_1sqrtdfrackleftwwrightdeltaleftwrightleqleftvert kleftcdotwrightrightvert _l2leftpartialomegarightleq c_2sqrtdfrackleftwwrightdeltaleftwright for any winomega here k is the bergman kernel of omega and delta is the distancetoboundary function
|
[['for', 'any', 'bounded', 'convex', 'domain', 'omega', 'with', 'c2', 'boundary', 'in', 'mathbbcn', 'we', 'show', 'that', 'there', 'exist', 'positive', 'constants', 'c_1', 'and', 'c_2', 'such', 'that', 'c_1sqrtdfrackleftwwrightdeltaleftwrightleqleftvert', 'kleftcdotwrightrightvert', '_l2leftpartialomegarightleq', 'c_2sqrtdfrackleftwwrightdeltaleftwright', 'for', 'any', 'winomega', 'here', 'k', 'is', 'the', 'bergman', 'kernel', 'of', 'omega', 'and', 'delta', 'is', 'the', 'distancetoboundary', 'function']]
|
[-0.21428934955283216, 0.1497601627764341, 0.0077957892545351855, -0.017026487511190538, -0.09041448398248146, -0.17570489258995572, 0.009025706609367933, 0.4430265501141548, -0.28948215855971765, -0.10448603680063236, 0.12026344589876796, -0.2992428666666934, -0.14355340482372986, 0.18038338359819087, -0.039769821873817, 0.05735103065442098, 0.03398025878950169, 0.12261522921586507, -0.08541722115325301, -0.17611706884283768, 0.4184479588936818, -0.24069848994871504, 0.09731173783687777, 0.20101560250316797, 0.08349950376309846, -0.08239601853940832, 0.09851479708021016, -0.019337685680703112, -0.2710542683876395, 0.06589418447478429, 0.2689083616592382, 0.1656949501607175, 0.2653415873646736, -0.34637756959388133, -0.21874955850408265, 0.26095772610585155, 0.12774172518402338, -0.08112637826094501, -0.0184099089973116, -0.1998728399140466, 0.13478906658527098, 0.003728490567913181, -0.1310863566070207, -0.09142614393740107, 0.1279850241630093, 0.04707395925652236, -0.37200132610374376, 0.09451797931749177, 0.15181506086925142, 0.05177945974528005, -0.13057470054512746, -0.21685836008308748, -0.03029214424130164, 0.10145562851654463, -0.003351323931526981, 0.24208865759244777, 0.028972507172607277, -0.0532167429888719, -0.0334572353351273, 0.3416082401220736, -0.15125998609552258, -0.3187131321449813, 0.12006273392685934, -0.2567784840204312, -0.11435918492804233, 0.062357482010204544, 0.041201426010382805, 0.19691639736686883, -0.00689090940317041, 0.2765896306587628, -0.09170240614452939, 0.17708822084884895, 0.1610554670179753, -0.007253429729883608, 0.02848044503480196, 0.030174082341162783, 0.17631042694770976, 0.0828037105843817, 4.479279864187303e-05, 0.03408707534943364, -0.4376318341023044, -0.15990950174531654, -0.2640774768630141, 0.09621444645974982, -0.16431313262881686, -0.1858466200432495, 0.25752015286860497, 0.006613293062209299, 0.2342628100886941, 0.09482072654033177, 0.21800537907371395, 0.12841918089083934, 0.04874619513161873, 0.15517764982130183, 0.12495225001322596, 0.08721986967506573, 0.02329258180811609, -0.23968015917374655, 0.02546464760885819, 0.07253753245727]
|
1,803.09394
|
A vertex reconstruction algorithm in the central detector of JUNO
|
The Jiangmen Underground Neutrino Observatory (JUNO) is designed to study
neutrino mass hierarchy and measure three of the neutrino oscillation
parameters with high precision using reactor antineutrinos. It is also able to
study many other physical phenomena, including supernova neutrinos, solar
neutrinos, geo-neutrinos, atmosphere neutrinos, and so forth. The central
detector of JUNO contains 20,000~tons of liquid scintillator (LS) and about
18,000 20-inch photomultiplier tubes (PMTs), which is the largest liquid
scintillator one under construction in the world up today. The energy
resolution is expected to be 3\%/$\sqrt{E(MeV)}$. To meet the requirements of
the experiment, an algorithm of vertex reconstruction, which takes into account
time and charge information of PMTs, has been developed by deploying the
maximum likelihood method and well understanding the complicated optical
processes in the liquid scintillator.
|
physics.ins-det physics.data-an
|
the jiangmen underground neutrino observatory juno is designed to study neutrino mass hierarchy and measure three of the neutrino oscillation parameters with high precision using reactor antineutrinos it is also able to study many other physical phenomena including supernova neutrinos solar neutrinos geoneutrinos atmosphere neutrinos and so forth the central detector of juno contains 20000tons of liquid scintillator ls and about 18000 20inch photomultiplier tubes pmts which is the largest liquid scintillator one under construction in the world up today the energy resolution is expected to be 3sqrtemev to meet the requirements of the experiment an algorithm of vertex reconstruction which takes into account time and charge information of pmts has been developed by deploying the maximum likelihood method and well understanding the complicated optical processes in the liquid scintillator
|
[['the', 'jiangmen', 'underground', 'neutrino', 'observatory', 'juno', 'is', 'designed', 'to', 'study', 'neutrino', 'mass', 'hierarchy', 'and', 'measure', 'three', 'of', 'the', 'neutrino', 'oscillation', 'parameters', 'with', 'high', 'precision', 'using', 'reactor', 'antineutrinos', 'it', 'is', 'also', 'able', 'to', 'study', 'many', 'other', 'physical', 'phenomena', 'including', 'supernova', 'neutrinos', 'solar', 'neutrinos', 'geoneutrinos', 'atmosphere', 'neutrinos', 'and', 'so', 'forth', 'the', 'central', 'detector', 'of', 'juno', 'contains', '20000tons', 'of', 'liquid', 'scintillator', 'ls', 'and', 'about', '18000', '20inch', 'photomultiplier', 'tubes', 'pmts', 'which', 'is', 'the', 'largest', 'liquid', 'scintillator', 'one', 'under', 'construction', 'in', 'the', 'world', 'up', 'today', 'the', 'energy', 'resolution', 'is', 'expected', 'to', 'be', '3sqrtemev', 'to', 'meet', 'the', 'requirements', 'of', 'the', 'experiment', 'an', 'algorithm', 'of', 'vertex', 'reconstruction', 'which', 'takes', 'into', 'account', 'time', 'and', 'charge', 'information', 'of', 'pmts', 'has', 'been', 'developed', 'by', 'deploying', 'the', 'maximum', 'likelihood', 'method', 'and', 'well', 'understanding', 'the', 'complicated', 'optical', 'processes', 'in', 'the', 'liquid', 'scintillator']]
|
[-0.04640712819509786, 0.23309435615509608, -0.03911854289544299, 0.12251581814746525, -0.061022633563929285, -0.15693507646751959, 0.012163029073975807, 0.3175685815657525, -0.19995625069804396, -0.39237731371739115, 0.10840976120752477, -0.37353302266578686, -0.021958049545569937, 0.20877712471374535, -0.02509607333516659, 0.07712060065144517, 0.10808304420675967, 0.0011443577187005864, -0.07958393718671891, -0.23196142844859396, 0.1853476858755588, 0.20304915222317674, 0.28514101555527643, 0.06479234851367931, 0.1944807383498942, -0.0891385483501349, -0.05715749492460876, -0.07618765073806741, -0.08066989970573968, 0.006568842989847411, 0.2974302798953826, 0.16935264671224987, 0.12299174752245232, -0.47006829195590905, -0.17936016127711718, 0.1533695834421719, 0.08972421529172205, -0.018082810351047522, -0.038870188032183076, -0.32096030393456537, 0.05833751176909883, -0.2099562420387023, -0.14611012016986172, 0.02622446702980949, -0.0641639946793863, 0.007330351577062781, -0.2118529385648841, -0.02956377375214866, -0.032202133346645005, -0.005511992477429236, -0.012428772908296118, -0.17974233448996332, 0.059744583515002746, 0.09050851677681586, 0.09628263743984145, -0.03388058743259126, 0.15498090119194963, -0.13520212257583264, -0.021165972958181716, 0.4083496111899961, -0.01063912965189449, -0.0981928937714917, 0.1253482415142303, -0.2017987254544977, -0.0700248317511449, 0.22581329795553587, 0.17692372147643634, 0.02442111032690073, -0.2507645927239643, 0.03262986858012588, -0.05985443201062699, 0.18733641775252746, 0.07654962947144527, 0.008309390658321845, 0.29855129212617526, 0.3344687237404287, 0.14372642079815845, -0.007619039330165833, -0.22577955477957634, 0.003424400853556256, -0.2750842613853918, -0.17114506641880234, -0.11868078598045101, 0.05904871755272381, -0.032998269629035716, -0.12197837357900228, 0.4294406707225324, 0.12205992057890624, 0.07481120699067247, -0.056539790923237916, 0.322858591477365, 0.0019756356802906176, 0.10900484510361715, 0.012913894673535067, 0.3046680278408291, 0.1612832988657476, 0.15180665546262911, -0.24313808849005591, 0.020719916733025118, 0.10062013225731]
|
1,803.09395
|
From large-scale to protostellar disk fragmentation into close binary
stars
|
Recent observations of young stellar systems with the Atacama Large
Millimeter/submillimeter Array (ALMA) and the Karl G. Jansky Very Large Array
(VLA) are helping to cement the idea that close companion stars form via
fragmentation of a gravitationally unstable disk around a protostar early in
the star formation process. As the disk grows in mass, it eventually becomes
gravitationally unstable and fragments, forming one or more new protostars in
orbit with the first at mean separations of 100 astronomical units (AU) or even
less. Here we report direct numerical calculations down to scales as small as
$\sim 0.1$ AU, using a consistent Smoothed Particle Hydrodynamics (SPH) code,
that show the large-scale fragmentation of a cloud core into two protostars
accompanied by small-scale fragmentation of their circumstellar disks. Our
results demonstrate the two dominant mechanisms of star formation, where the
disk forming around a protostar, which in turn results from the large-scale
fragmentation of the cloud core, undergoes eccentric ($m=1$) fragmentation to
produce a close binary. We generate two-dimensional emission maps and simulated
ALMA 1.3 mm continuum images of the structure and fragmentation of the disks
that can help explain the dynamical processes occurring within collapsing cloud
cores.
|
astro-ph.SR astro-ph.GA
|
recent observations of young stellar systems with the atacama large millimetersubmillimeter array alma and the karl g jansky very large array vla are helping to cement the idea that close companion stars form via fragmentation of a gravitationally unstable disk around a protostar early in the star formation process as the disk grows in mass it eventually becomes gravitationally unstable and fragments forming one or more new protostars in orbit with the first at mean separations of 100 astronomical units au or even less here we report direct numerical calculations down to scales as small as sim 01 au using a consistent smoothed particle hydrodynamics sph code that show the largescale fragmentation of a cloud core into two protostars accompanied by smallscale fragmentation of their circumstellar disks our results demonstrate the two dominant mechanisms of star formation where the disk forming around a protostar which in turn results from the largescale fragmentation of the cloud core undergoes eccentric m1 fragmentation to produce a close binary we generate twodimensional emission maps and simulated alma 13 mm continuum images of the structure and fragmentation of the disks that can help explain the dynamical processes occurring within collapsing cloud cores
|
[['recent', 'observations', 'of', 'young', 'stellar', 'systems', 'with', 'the', 'atacama', 'large', 'millimetersubmillimeter', 'array', 'alma', 'and', 'the', 'karl', 'g', 'jansky', 'very', 'large', 'array', 'vla', 'are', 'helping', 'to', 'cement', 'the', 'idea', 'that', 'close', 'companion', 'stars', 'form', 'via', 'fragmentation', 'of', 'a', 'gravitationally', 'unstable', 'disk', 'around', 'a', 'protostar', 'early', 'in', 'the', 'star', 'formation', 'process', 'as', 'the', 'disk', 'grows', 'in', 'mass', 'it', 'eventually', 'becomes', 'gravitationally', 'unstable', 'and', 'fragments', 'forming', 'one', 'or', 'more', 'new', 'protostars', 'in', 'orbit', 'with', 'the', 'first', 'at', 'mean', 'separations', 'of', '100', 'astronomical', 'units', 'au', 'or', 'even', 'less', 'here', 'we', 'report', 'direct', 'numerical', 'calculations', 'down', 'to', 'scales', 'as', 'small', 'as', 'sim', '01', 'au', 'using', 'a', 'consistent', 'smoothed', 'particle', 'hydrodynamics', 'sph', 'code', 'that', 'show', 'the', 'largescale', 'fragmentation', 'of', 'a', 'cloud', 'core', 'into', 'two', 'protostars', 'accompanied', 'by', 'smallscale', 'fragmentation', 'of', 'their', 'circumstellar', 'disks', 'our', 'results', 'demonstrate', 'the', 'two', 'dominant', 'mechanisms', 'of', 'star', 'formation', 'where', 'the', 'disk', 'forming', 'around', 'a', 'protostar', 'which', 'in', 'turn', 'results', 'from', 'the', 'largescale', 'fragmentation', 'of', 'the', 'cloud', 'core', 'undergoes', 'eccentric', 'm1', 'fragmentation', 'to', 'produce', 'a', 'close', 'binary', 'we', 'generate', 'twodimensional', 'emission', 'maps', 'and', 'simulated', 'alma', '13', 'mm', 'continuum', 'images', 'of', 'the', 'structure', 'and', 'fragmentation', 'of', 'the', 'disks', 'that', 'can', 'help', 'explain', 'the', 'dynamical', 'processes', 'occurring', 'within', 'collapsing', 'cloud', 'cores']]
|
[-0.1063790669171896, 0.1549156523938409, -0.06109703881760615, 0.06731327438434986, -0.060477851466913965, -0.04198348718201316, -0.013649778497324983, 0.37678961987195886, -0.2182571273619134, -0.3166585609105269, 0.09542975104343014, -0.2390712763680391, -0.04953384013175208, 0.13743297401567459, 0.045569277454763274, -0.0026728693102746445, 0.16340916468241834, -0.13631314305626424, -0.02051625145967993, -0.19697897058620878, 0.34023175569166086, 0.13507520921793081, 0.06598395818069124, 0.00045356203549007325, 0.031249277371686274, -0.16781140519454538, -0.04414451426027466, -0.023445026192643922, -0.15859655428704833, 0.033194993880251183, 0.23099006326552385, 0.10262856879484306, 0.25075362153412767, -0.4389232410080164, -0.1868660028711869, -0.00206786993569529, 0.18700808046863127, 0.06427120960253731, -0.05088572231894607, -0.27164785118435564, 0.131164607034079, -0.22446055443683252, -0.17125855941505072, 0.0569782539313366, 0.0735676218099599, 0.015965443994166793, -0.26074248335240313, 0.09710834329051964, 0.042006925983339084, 0.04189685674417181, -0.08769143341158796, -0.10090832242051961, -0.07613198260710513, 0.07011628347486824, -0.010331808164069279, 0.11924047548758802, 0.2278013224098926, -0.1604251833925104, -0.03962319696719196, 0.4101818559459661, -0.07423388543314191, -0.03621461188543569, 0.2890509263290858, -0.24318417885960056, -0.21190093788625625, 0.21828025909433812, 0.19611914449080065, 0.1704071830357732, -0.08001525081997869, -0.02137377542008641, -0.02878967414699911, 0.23860371054202167, 0.10865808287540896, 0.014677587707484435, 0.4043100873778957, 0.16928309720921977, 0.009652306445103688, 0.17401088743711712, -0.22179172707835051, -0.13847578587814183, -0.21170397885356496, -0.11733095478361028, -0.17058238393844574, 0.10492011784755526, -0.12790306362688073, -0.14421087586874057, 0.26228114417139536, 0.09276996282056957, 0.25828641896528487, 0.0621460045381747, 0.3064755753349267, 0.010130160607558293, 0.1474777340361858, 0.12515000479300578, 0.2561286375645151, 0.16699539812229725, 0.11650085990756825, -0.21926562749984, 0.03168384403730199, -0.01663422099253172]
|
1,803.09396
|
Asymptotic Bessel-function expansions for Legendre and Jacobi functions
|
We present new asymptotic series for the Legendre and Jacobi functions of the
first and second kinds in terms of Bessel functions with appropriate arguments.
The results are useful in the context of scattering problems, improve on known
limiting results, and allow the calculation of corrections to the leading
Bessel-function approximations for these functions. Our derivations of these
series are based on Barnes-type representations of the Legendre, Jacobi, and
Bessel functions; our method appears to be new. We use the results, finally, to
obtain asymptotic Bessel function expansions for the rotation functions needed
to describe the scattering of particles with spin.
|
math-ph hep-ph math.MP
|
we present new asymptotic series for the legendre and jacobi functions of the first and second kinds in terms of bessel functions with appropriate arguments the results are useful in the context of scattering problems improve on known limiting results and allow the calculation of corrections to the leading besselfunction approximations for these functions our derivations of these series are based on barnestype representations of the legendre jacobi and bessel functions our method appears to be new we use the results finally to obtain asymptotic bessel function expansions for the rotation functions needed to describe the scattering of particles with spin
|
[['we', 'present', 'new', 'asymptotic', 'series', 'for', 'the', 'legendre', 'and', 'jacobi', 'functions', 'of', 'the', 'first', 'and', 'second', 'kinds', 'in', 'terms', 'of', 'bessel', 'functions', 'with', 'appropriate', 'arguments', 'the', 'results', 'are', 'useful', 'in', 'the', 'context', 'of', 'scattering', 'problems', 'improve', 'on', 'known', 'limiting', 'results', 'and', 'allow', 'the', 'calculation', 'of', 'corrections', 'to', 'the', 'leading', 'besselfunction', 'approximations', 'for', 'these', 'functions', 'our', 'derivations', 'of', 'these', 'series', 'are', 'based', 'on', 'barnestype', 'representations', 'of', 'the', 'legendre', 'jacobi', 'and', 'bessel', 'functions', 'our', 'method', 'appears', 'to', 'be', 'new', 'we', 'use', 'the', 'results', 'finally', 'to', 'obtain', 'asymptotic', 'bessel', 'function', 'expansions', 'for', 'the', 'rotation', 'functions', 'needed', 'to', 'describe', 'the', 'scattering', 'of', 'particles', 'with', 'spin']]
|
[-0.06287323195487261, 0.052236937298439444, -0.13316012093797325, 0.09415104039479047, -0.07445591764524578, -0.016387198846787215, -0.0010399261792190372, 0.34863033042289315, -0.24661264069378375, -0.2375317084789276, 0.09831897287396714, -0.27361256565898656, -0.19140426136553287, 0.2587648391351104, -0.002252238627988845, 0.1162347517348826, 0.026469827838009222, 0.021595319013576954, -0.1549392996262759, -0.2732602107711136, 0.3690044166101143, 0.020531446281820534, 0.19036871747113765, 0.05916402619332075, 0.06901917750015855, 0.028928695088252424, -0.0782634802395478, -0.09512079374864697, -0.16811693789437412, 0.1669262725394219, 0.2278657350409776, 0.08145987674128265, 0.21669547829544172, -0.43606809835880994, -0.13039201728068292, 0.0700524076790316, 0.15979333387687802, 0.07976550755556673, -0.004470225183758884, -0.27242640901473353, 0.05554726272821427, -0.1398386447597295, -0.1817865908704698, -0.1802462549736083, -0.042430784655734896, 0.15990091394167394, -0.32388637188822034, 0.07855126118054613, 0.044700615982874295, 0.00941714166663587, -0.0662098485667957, -0.1672678968938999, 0.06340292427456007, 0.11286255547311157, 0.08582407604902982, -0.024868740430101753, 0.05471751631237567, -0.10598570910282433, -0.12810029085725547, 0.36097288808785377, -0.061371535310172476, -0.2755987641401589, 0.15228552450658753, -0.2124576107505709, -0.15748723661527037, 0.09318087649182416, 0.17232760047307238, 0.16462862305052112, -0.12096819827915169, 0.04182705603307113, 0.0018563636171165855, 0.07304798187105917, 0.11221394297434018, 0.05614677425473928, 0.1411713445186615, 0.07821247825864702, 0.010494595933705568, 0.1786775818571914, -0.045565031375736, -0.07984080502763391, -0.3754376956820488, -0.16702893014531583, -0.17027442288119346, 5.175344529561699e-05, -0.14904202643490863, -0.19476459271740168, 0.41719368803314866, 0.12445308290421962, 0.15832530576735734, 0.12692609068006278, 0.25202963906340303, 0.21957491878652946, 0.07374309721402823, 0.03585619819816202, 0.20388214715756475, 0.17636226333910598, 0.07684322713408619, -0.18832912627403858, 0.014541439479216933, 0.13309298158623278]
|
1,803.09397
|
Optical radiation force (per-length) on an electrically conducting
elliptical cylinder having a smooth or ribbed surface
|
The aim of this work is to develop a formal semi-analytical model using the
modal expansion method in cylindrical coordinates to calculate the
optical/electromagnetic (EM) radiation force-per-length experienced by an
infinitely long electrically-conducting elliptical cylinder having a smooth or
wavy/corrugated surface in EM plane progressive waves with different
polarizations. One of the semi-axes of the elliptical cylinder coincides with
the direction of the incident field. The modal matching method is used to
determine the scattering coefficients by matrix inversion. Standard cylindrical
(Bessel and Hankel) wave functions are used. Simplified expressions leading to
exact series expansions for the optical/EM radiation forces assuming either
electric (TM) of magnetic (TE) plane wave incidences are provided without any
approximations, in addition to integral equations demonstrating the direct
relationship of the radiation force with the square of the scattered field
magnitude. Numerical computations for the non-dimensional radiation force
function are performed for electrically conducting elliptic and circular
cylinders having a smooth or ribbed/corrugated surface. Adequate convergence
plots confirm the validity and correctness of the method to evaluate the
radiation force with no limitation to a particular frequency range (i.e.
Rayleigh, Mie or geometrical optics regimes). Emphases are given on the aspect
ratio, the non-dimensional size of the cylinder, the corrugation characteristic
of its surface, and the polarization of the incident field. The results are
particularly relevant in optical tweezers and other related applications in
fluid dynamics, where the shape and stability of a cylindrical drop stressed by
a uniform external electric/magnetic field are altered. Furthermore, a direct
analogy with the acoustical counterpart is discussed.
|
physics.class-ph
|
the aim of this work is to develop a formal semianalytical model using the modal expansion method in cylindrical coordinates to calculate the opticalelectromagnetic em radiation forceperlength experienced by an infinitely long electricallyconducting elliptical cylinder having a smooth or wavycorrugated surface in em plane progressive waves with different polarizations one of the semiaxes of the elliptical cylinder coincides with the direction of the incident field the modal matching method is used to determine the scattering coefficients by matrix inversion standard cylindrical bessel and hankel wave functions are used simplified expressions leading to exact series expansions for the opticalem radiation forces assuming either electric tm of magnetic te plane wave incidences are provided without any approximations in addition to integral equations demonstrating the direct relationship of the radiation force with the square of the scattered field magnitude numerical computations for the nondimensional radiation force function are performed for electrically conducting elliptic and circular cylinders having a smooth or ribbedcorrugated surface adequate convergence plots confirm the validity and correctness of the method to evaluate the radiation force with no limitation to a particular frequency range ie rayleigh mie or geometrical optics regimes emphases are given on the aspect ratio the nondimensional size of the cylinder the corrugation characteristic of its surface and the polarization of the incident field the results are particularly relevant in optical tweezers and other related applications in fluid dynamics where the shape and stability of a cylindrical drop stressed by a uniform external electricmagnetic field are altered furthermore a direct analogy with the acoustical counterpart is discussed
|
[['the', 'aim', 'of', 'this', 'work', 'is', 'to', 'develop', 'a', 'formal', 'semianalytical', 'model', 'using', 'the', 'modal', 'expansion', 'method', 'in', 'cylindrical', 'coordinates', 'to', 'calculate', 'the', 'opticalelectromagnetic', 'em', 'radiation', 'forceperlength', 'experienced', 'by', 'an', 'infinitely', 'long', 'electricallyconducting', 'elliptical', 'cylinder', 'having', 'a', 'smooth', 'or', 'wavycorrugated', 'surface', 'in', 'em', 'plane', 'progressive', 'waves', 'with', 'different', 'polarizations', 'one', 'of', 'the', 'semiaxes', 'of', 'the', 'elliptical', 'cylinder', 'coincides', 'with', 'the', 'direction', 'of', 'the', 'incident', 'field', 'the', 'modal', 'matching', 'method', 'is', 'used', 'to', 'determine', 'the', 'scattering', 'coefficients', 'by', 'matrix', 'inversion', 'standard', 'cylindrical', 'bessel', 'and', 'hankel', 'wave', 'functions', 'are', 'used', 'simplified', 'expressions', 'leading', 'to', 'exact', 'series', 'expansions', 'for', 'the', 'opticalem', 'radiation', 'forces', 'assuming', 'either', 'electric', 'tm', 'of', 'magnetic', 'te', 'plane', 'wave', 'incidences', 'are', 'provided', 'without', 'any', 'approximations', 'in', 'addition', 'to', 'integral', 'equations', 'demonstrating', 'the', 'direct', 'relationship', 'of', 'the', 'radiation', 'force', 'with', 'the', 'square', 'of', 'the', 'scattered', 'field', 'magnitude', 'numerical', 'computations', 'for', 'the', 'nondimensional', 'radiation', 'force', 'function', 'are', 'performed', 'for', 'electrically', 'conducting', 'elliptic', 'and', 'circular', 'cylinders', 'having', 'a', 'smooth', 'or', 'ribbedcorrugated', 'surface', 'adequate', 'convergence', 'plots', 'confirm', 'the', 'validity', 'and', 'correctness', 'of', 'the', 'method', 'to', 'evaluate', 'the', 'radiation', 'force', 'with', 'no', 'limitation', 'to', 'a', 'particular', 'frequency', 'range', 'ie', 'rayleigh', 'mie', 'or', 'geometrical', 'optics', 'regimes', 'emphases', 'are', 'given', 'on', 'the', 'aspect', 'ratio', 'the', 'nondimensional', 'size', 'of', 'the', 'cylinder', 'the', 'corrugation', 'characteristic', 'of', 'its', 'surface', 'and', 'the', 'polarization', 'of', 'the', 'incident', 'field', 'the', 'results', 'are', 'particularly', 'relevant', 'in', 'optical', 'tweezers', 'and', 'other', 'related', 'applications', 'in', 'fluid', 'dynamics', 'where', 'the', 'shape', 'and', 'stability', 'of', 'a', 'cylindrical', 'drop', 'stressed', 'by', 'a', 'uniform', 'external', 'electricmagnetic', 'field', 'are', 'altered', 'furthermore', 'a', 'direct', 'analogy', 'with', 'the', 'acoustical', 'counterpart', 'is', 'discussed']]
|
[-0.15761031657979846, 0.1144442622789652, -0.07736415084356105, 0.03681711250949123, -0.10067586789886636, -0.08170225277202071, -0.025391764099174364, 0.3880717597982487, -0.24231118820131, -0.2738837202043615, 0.07267560034680481, -0.2664775915964558, -0.1202381510302648, 0.21640501431772471, 0.005462494043094348, 0.07672975612433047, 0.0028042147718883286, 0.013921584795581133, -0.06544906423632496, -0.168578306381686, 0.301780220718805, 0.03848477356469508, 0.28042443899353453, 0.0289873504629872, 0.08027142331560554, 0.046070646771457134, -0.022720839923585024, 0.04062026209659933, -0.14925260937820356, 0.09266239722483006, 0.19534957785742343, 0.0289358731421576, 0.20459202403481316, -0.4778350598772797, -0.19755013368339, 0.04799355684223174, 0.1299064481277092, 0.08909735405463799, -0.044777302412906526, -0.24114849742622974, 0.02786130400000536, -0.13303892763503863, -0.20423913631940216, -0.023959612250181398, 0.04239582748969973, 0.08881965788964945, -0.27855046785722565, 0.06514550501748362, 0.057751365462464725, 0.08885364214739373, -0.06689167089440505, -0.09037162872089997, -0.023163397973824995, 0.07206244980155556, 0.08536879805428976, 0.033105285794246854, 0.15936171210656955, -0.13234261961309052, -0.06065596660001453, 0.3806889090452373, -0.0725094711011107, -0.2497015389518475, 0.1656110804568331, -0.18191354986148203, 0.01578468051152377, 0.19048864955419864, 0.1503446740859122, 0.12605319158921172, -0.09717959617988726, 0.07674814396268344, -0.015450137328080591, 0.14271307980282394, 0.1588418243350241, -0.026620265987874047, 0.22182950222182754, 0.10541439720330481, 0.02176144705373999, 0.15566782613846797, -0.1020036634455589, -0.05646084620769495, -0.30284085489926843, -0.13565487170080456, -0.17757645748348497, 0.008056242587608578, -0.11562707847569552, -0.21063596920630945, 0.3659609881079367, 0.08984015006425343, 0.14227455861474145, 0.024249100612153806, 0.3360619647501726, 0.15040738397739886, 0.036180289523624704, 0.04343453542270705, 0.2942791915018346, 0.19392175877496132, 0.07907906488780579, -0.23996319410420486, 0.018016737673108973, 0.062471646884287614]
|
1,803.09398
|
The impact of EDGES 21-cm data on dark matter interactions
|
The recently announced results on the 21-cm absorption spectrum by the EDGES
experiment can place very stringent limits on dark matter annihilation
cross-sections. We properly take into account the heating energy released from
dark matter annihilation from the radiation epoch to the 21-cm observation
redshifts in the radiative transfer to compute the evolution of the gas
temperature. Our results show that the global 21-cm absorption profile is a
powerful cosmological probe of the dark matter interactions. For dark matter
annihilating into electron-positron pairs, the EDGES results give a more
stringent upper limit than the PLANCK result on the annihilation cross section
at the lower dark matter mass region.
|
astro-ph.CO astro-ph.HE hep-ph
|
the recently announced results on the 21cm absorption spectrum by the edges experiment can place very stringent limits on dark matter annihilation crosssections we properly take into account the heating energy released from dark matter annihilation from the radiation epoch to the 21cm observation redshifts in the radiative transfer to compute the evolution of the gas temperature our results show that the global 21cm absorption profile is a powerful cosmological probe of the dark matter interactions for dark matter annihilating into electronpositron pairs the edges results give a more stringent upper limit than the planck result on the annihilation cross section at the lower dark matter mass region
|
[['the', 'recently', 'announced', 'results', 'on', 'the', '21cm', 'absorption', 'spectrum', 'by', 'the', 'edges', 'experiment', 'can', 'place', 'very', 'stringent', 'limits', 'on', 'dark', 'matter', 'annihilation', 'crosssections', 'we', 'properly', 'take', 'into', 'account', 'the', 'heating', 'energy', 'released', 'from', 'dark', 'matter', 'annihilation', 'from', 'the', 'radiation', 'epoch', 'to', 'the', '21cm', 'observation', 'redshifts', 'in', 'the', 'radiative', 'transfer', 'to', 'compute', 'the', 'evolution', 'of', 'the', 'gas', 'temperature', 'our', 'results', 'show', 'that', 'the', 'global', '21cm', 'absorption', 'profile', 'is', 'a', 'powerful', 'cosmological', 'probe', 'of', 'the', 'dark', 'matter', 'interactions', 'for', 'dark', 'matter', 'annihilating', 'into', 'electronpositron', 'pairs', 'the', 'edges', 'results', 'give', 'a', 'more', 'stringent', 'upper', 'limit', 'than', 'the', 'planck', 'result', 'on', 'the', 'annihilation', 'cross', 'section', 'at', 'the', 'lower', 'dark', 'matter', 'mass', 'region']]
|
[-0.07849047199286158, 0.12476742415499219, -0.1283570822329407, 0.17012468212029758, -0.10035274244189539, -0.03923980312214957, -0.006603733800282633, 0.3000790366851207, -0.17135845650746315, -0.3643214074998266, -0.02188338076855332, -0.3318993310957147, 0.06912016958274224, 0.2063657689701628, 0.14667880531865027, 0.0011510348930541012, 0.04163396672811359, -0.020465075167723827, 0.02914754769450088, -0.2879596379482084, 0.3116381896338512, 0.1152057249650911, 0.2266101411509293, 0.11314774866871259, 0.04142714804469573, -0.040844753244460595, -0.0931945502611429, -0.09003702042348406, -0.22123371367268663, 0.04614125582803455, 0.17661717315031975, 0.0940917862452032, 0.10296059320723915, -0.4453611030109675, -0.2546777894970513, 0.1817440504975686, 0.1625069981587499, 0.11967408024119558, -0.10371899150521602, -0.3848453217737929, -0.0025081129667038717, -0.1965323077618248, -0.04420433042105287, 0.01602611501908137, 0.012579013101963533, -0.06238640903891927, -0.2424965877154911, 0.09525155091520261, 0.003646906374746727, -0.1251144173527589, -0.0866967063371299, -0.11127158742898179, -0.06724351793053318, -0.019210716422767966, 0.024972053108892094, -0.03965870325056905, 0.2854709535453434, -0.22006100254064356, -0.03924214595031959, 0.4237540024936337, -0.17740349025593283, -0.027457932510447723, 0.1462297990952653, -0.19352938757381505, -0.1739859368966858, 0.2288818086359512, 0.1878093321186801, 0.019066491282838223, -0.12980837731070263, 0.11558168787612683, -0.04424368197322582, 0.18821851650459898, 0.08483502557889248, 0.05864548782335111, 0.38529425025087594, 0.1408714290527213, 0.1094702396593574, 0.03307603332170941, -0.1424453493959003, 0.0006635205225191183, -0.3372281155747327, -0.11046256188193285, -0.15384404980189478, 0.06421671498618606, -0.07380378544244363, -0.04796572949702817, 0.3338255694618932, 0.13176501257327833, 0.2726707483374479, 0.05744035851805367, 0.4122845419096174, 0.13294614968429044, 0.03292763948061124, 0.05367163416964037, 0.3701083757655902, 0.1715938174704745, 0.10629588598816621, -0.21057976934955352, 0.0026380838696948355, 0.02654654168765302]
|
1,803.09399
|
New Green's functions for some nonlinear oscillating systems and related
PDEs
|
During the past three decades, the advantageous concept of the Green's
function has been extended from linear systems to nonlinear ones. At that,
there exist a rigorous and an approximate extensions. The rigorous extension
introduces the so-called backward and forward propagators, which play the same
role for nonlinear systems as the Green's function plays for linear systems.
The approximate extension involves the Green's formula for linear systems with
a Green's function satisfying the corresponding nonlinear equation. For the
numerical evaluation of nonlinear ordinary differential equations the second
approach seems to be more convenient. In this article we study a hierarchy of
nonlinear partial differential equations that can be approximated by the second
approach. Green's functions for particular non-linearities are derived
explicitly. Numerical error analysis in the case of exponential non-linearity
for different source functions supports the advantage of the approach.
|
math-ph math.MP
|
during the past three decades the advantageous concept of the greens function has been extended from linear systems to nonlinear ones at that there exist a rigorous and an approximate extensions the rigorous extension introduces the socalled backward and forward propagators which play the same role for nonlinear systems as the greens function plays for linear systems the approximate extension involves the greens formula for linear systems with a greens function satisfying the corresponding nonlinear equation for the numerical evaluation of nonlinear ordinary differential equations the second approach seems to be more convenient in this article we study a hierarchy of nonlinear partial differential equations that can be approximated by the second approach greens functions for particular nonlinearities are derived explicitly numerical error analysis in the case of exponential nonlinearity for different source functions supports the advantage of the approach
|
[['during', 'the', 'past', 'three', 'decades', 'the', 'advantageous', 'concept', 'of', 'the', 'greens', 'function', 'has', 'been', 'extended', 'from', 'linear', 'systems', 'to', 'nonlinear', 'ones', 'at', 'that', 'there', 'exist', 'a', 'rigorous', 'and', 'an', 'approximate', 'extensions', 'the', 'rigorous', 'extension', 'introduces', 'the', 'socalled', 'backward', 'and', 'forward', 'propagators', 'which', 'play', 'the', 'same', 'role', 'for', 'nonlinear', 'systems', 'as', 'the', 'greens', 'function', 'plays', 'for', 'linear', 'systems', 'the', 'approximate', 'extension', 'involves', 'the', 'greens', 'formula', 'for', 'linear', 'systems', 'with', 'a', 'greens', 'function', 'satisfying', 'the', 'corresponding', 'nonlinear', 'equation', 'for', 'the', 'numerical', 'evaluation', 'of', 'nonlinear', 'ordinary', 'differential', 'equations', 'the', 'second', 'approach', 'seems', 'to', 'be', 'more', 'convenient', 'in', 'this', 'article', 'we', 'study', 'a', 'hierarchy', 'of', 'nonlinear', 'partial', 'differential', 'equations', 'that', 'can', 'be', 'approximated', 'by', 'the', 'second', 'approach', 'greens', 'functions', 'for', 'particular', 'nonlinearities', 'are', 'derived', 'explicitly', 'numerical', 'error', 'analysis', 'in', 'the', 'case', 'of', 'exponential', 'nonlinearity', 'for', 'different', 'source', 'functions', 'supports', 'the', 'advantage', 'of', 'the', 'approach']]
|
[-0.11738120446430653, 0.004586287568028118, -0.11789040360100833, 0.11058494803977997, -0.09549792927490282, -0.11228791213195238, -0.03232783282707844, 0.30789726878117235, -0.2729227351823023, -0.23555566406409656, 0.09604788242806016, -0.2769503993048732, -0.20267035938865904, 0.2509354974010161, 0.041678415289581085, 0.12586799191111434, 0.033141258430467654, -0.011284972341465098, -0.11532192956988833, -0.1990248366857746, 0.3485543225825365, -0.0002866621661399092, 0.24471902469439166, 0.02018569087875741, 0.14399622682082866, 0.05934508384088986, -0.03057449048251978, 0.005085873410903982, -0.09233195438168228, 0.10747255079830731, 0.2761944557806211, 0.07703473046588312, 0.332249012815633, -0.43928457227801637, -0.23065527910366654, 0.07302411092179162, 0.14771295543427446, 0.1199445014910972, -0.038389047636571506, -0.2374587065191008, 0.06564405437093228, -0.16207976528842535, -0.18151860607987536, -0.0794421150423919, 0.022386474848359025, 0.03138847834530419, -0.2981220190662758, 0.11850055790606089, 0.08417530681139657, 0.027546012852274412, -0.04210189404963915, -0.10510393727371203, 0.0054649421878691234, 0.08692143748381308, -0.0011218487650954297, -0.0009833346370474569, 0.04549023643734732, -0.11821536579269118, -0.09487165285848148, 0.34172034433244597, -0.09214435940375551, -0.2819989190969084, 0.1446122627954797, -0.0984592653594778, -0.12086467983567023, 0.12690460271301812, 0.18692291380970605, 0.1525092695640134, -0.20718013767951302, 0.13004546704885017, -0.043729570624418554, 0.14759843839398984, 0.05966736547582384, 0.028150581172667444, 0.13812886531730847, 0.1314447620667384, 0.07133263334232781, 0.15068717563824197, 0.029192235823055464, -0.16896825305718396, -0.3471154309543116, -0.15879504592739976, -0.13208372685393052, 0.011650838965059458, -0.07071003289810115, -0.1802061894900232, 0.3963686575614182, 0.11418127968042557, 0.13107635056866065, 0.08631832790145251, 0.2940977716851713, 0.2861600222207406, 0.06068920723960868, 0.020201855002492917, 0.22768939796702137, 0.15512213125059912, 0.10942666258197278, -0.23700229878055065, 0.0636574631457084, 0.13012266491672822]
|
1,803.094
|
Bounds on the cardinality of restricted sumsets in $\mathbb{Z}_{p}$
|
In this paper we present a procedure which allows to transform a subset $A$
of $\mathbb{Z}_{p}$ into a set $ A'$ such that $ |2\hspace{0.15cm}\widehat{}
A'|\leq|2\hspace{0.15cm}\widehat{} A | $, where $2\hspace{0.15cm}\widehat{} A$
is defined to be the set $\left\{a+b:a\neq b,\;a,b\in A\right\}$. From this
result, we get some lower bounds for $ |2\hspace{0.15cm}\widehat{} A| $.
Finally, we give some remarks related to the problem for which sets $A\subset
\mathbb{Z}_{p}$ we have the equality $|2\hspace{0.15cm}\widehat{} A|=2|A|-1$.
|
math.CO
|
in this paper we present a procedure which allows to transform a subset a of mathbbz_p into a set a such that 2hspace015cmwidehat aleq2hspace015cmwidehat a where 2hspace015cmwidehat a is defined to be the set leftabaneq babin aright from this result we get some lower bounds for 2hspace015cmwidehat a finally we give some remarks related to the problem for which sets asubset mathbbz_p we have the equality 2hspace015cmwidehat a2a1
|
[['in', 'this', 'paper', 'we', 'present', 'a', 'procedure', 'which', 'allows', 'to', 'transform', 'a', 'subset', 'a', 'of', 'mathbbz_p', 'into', 'a', 'set', 'a', 'such', 'that', '2hspace015cmwidehat', 'aleq2hspace015cmwidehat', 'a', 'where', '2hspace015cmwidehat', 'a', 'is', 'defined', 'to', 'be', 'the', 'set', 'leftabaneq', 'babin', 'aright', 'from', 'this', 'result', 'we', 'get', 'some', 'lower', 'bounds', 'for', '2hspace015cmwidehat', 'a', 'finally', 'we', 'give', 'some', 'remarks', 'related', 'to', 'the', 'problem', 'for', 'which', 'sets', 'asubset', 'mathbbz_p', 'we', 'have', 'the', 'equality', '2hspace015cmwidehat', 'a2a1']]
|
[-0.13206627606555368, 0.07439774108316863, -0.14202334525797403, 0.06454121106071398, -0.09497376655186103, -0.10519179825981458, 0.1076226022189737, 0.3206805484651616, -0.26436227926927985, -0.22192267887294292, 0.1473760370951795, -0.2700550821506168, -0.1370252842422236, 0.23920410244979642, -0.0979157312117009, 0.0049465663279547835, 0.02073610799782204, 0.0783625182653354, -0.06275301894779797, -0.26979717956573673, 0.3111583593894135, -0.06559384760983063, 0.13964621137093866, 0.07752802711205953, 0.09646566982987817, -0.04493548973661029, 0.0518122904397773, 0.04591163584369828, -0.2144819152772746, 0.13259188487780083, 0.24916147423738783, 0.17163232870569284, 0.2953651145552144, -0.36245226439540135, -0.12474973575268505, 0.19906371794499908, 0.11776000911115923, 0.08938362766551136, -0.04842510875878912, -0.2649166687024814, 0.13162004309494726, -0.1894618460174763, -0.07753611586028428, -0.058080258863893425, 0.03219677905806086, -0.015125774016434496, -0.3432881014816689, -0.014330114992899877, 0.0922940554040851, 0.022757345888142783, -0.05102622449824897, -0.11136937919284472, 0.06305548645358419, 0.059685455592857165, -0.0003662333633242683, 0.09526434302979121, 0.03189693507032864, -0.04512531382991283, -0.06055419265546582, 0.3728115425134699, -0.038390626514394004, -0.23489141661786672, 0.12369893274665104, -0.12479548232460563, -0.20071581818135173, 0.05400125817819075, 0.14877684453897405, 0.14294783940369432, -0.1281928472136232, 0.11578570664013652, -0.16933723294994596, 0.11361278119412335, 0.06752222278296496, 0.04061570058746094, 0.1331785467989517, 0.12166396083987573, 0.1065014270592876, 0.1896800976087847, -0.024687004670726532, 0.04390645167564578, -0.36640380198756856, -0.1840349722576017, -0.12892788247148873, 0.1031505775807256, -0.038177469422049456, -0.18821340296805525, 0.3801248454009042, 0.1611859013016025, 0.2704355919338537, 0.11973835443583966, 0.22596242125181368, 0.11853307414717026, 0.02886302431932453, 0.0885602492824987, 0.09868506250892427, 0.0997428937504689, 0.0026325703824334073, -0.110597632377352, -0.005537764298920097, 0.12188784145947659]
|
1,803.09401
|
HomeGuard: A Smart System to Deal with the Emergency Response of
Domestic Violence Victims
|
Domestic violence is a silent crisis in the developing and underdeveloped
countries, though developed countries also remain drowned in the curse of it.
In developed countries, victims can easily report and ask help on the contrary
in developing and underdeveloped countries victims hardly report the crimes and
when it's noticed by the authority it's become too late to save or support the
victim. If this kind of problems can be identified at the very beginning of the
event and proper actions can be taken, it'll not only help the victim but also
reduce the domestic violence crimes. This paper proposed a smart system which
can extract victim's situation and provide help according to it. Among of the
developing and underdeveloped countries Bangladesh has been chosen though the
rate of reporting of domestic violence is low, the extreme report collected by
authorities is too high. Case studies collected by different NGO's relating to
domestic violence have been studied and applied to extract possible condition
for the victims.
|
cs.IR cs.CL
|
domestic violence is a silent crisis in the developing and underdeveloped countries though developed countries also remain drowned in the curse of it in developed countries victims can easily report and ask help on the contrary in developing and underdeveloped countries victims hardly report the crimes and when its noticed by the authority its become too late to save or support the victim if this kind of problems can be identified at the very beginning of the event and proper actions can be taken itll not only help the victim but also reduce the domestic violence crimes this paper proposed a smart system which can extract victims situation and provide help according to it among of the developing and underdeveloped countries bangladesh has been chosen though the rate of reporting of domestic violence is low the extreme report collected by authorities is too high case studies collected by different ngos relating to domestic violence have been studied and applied to extract possible condition for the victims
|
[['domestic', 'violence', 'is', 'a', 'silent', 'crisis', 'in', 'the', 'developing', 'and', 'underdeveloped', 'countries', 'though', 'developed', 'countries', 'also', 'remain', 'drowned', 'in', 'the', 'curse', 'of', 'it', 'in', 'developed', 'countries', 'victims', 'can', 'easily', 'report', 'and', 'ask', 'help', 'on', 'the', 'contrary', 'in', 'developing', 'and', 'underdeveloped', 'countries', 'victims', 'hardly', 'report', 'the', 'crimes', 'and', 'when', 'its', 'noticed', 'by', 'the', 'authority', 'its', 'become', 'too', 'late', 'to', 'save', 'or', 'support', 'the', 'victim', 'if', 'this', 'kind', 'of', 'problems', 'can', 'be', 'identified', 'at', 'the', 'very', 'beginning', 'of', 'the', 'event', 'and', 'proper', 'actions', 'can', 'be', 'taken', 'itll', 'not', 'only', 'help', 'the', 'victim', 'but', 'also', 'reduce', 'the', 'domestic', 'violence', 'crimes', 'this', 'paper', 'proposed', 'a', 'smart', 'system', 'which', 'can', 'extract', 'victims', 'situation', 'and', 'provide', 'help', 'according', 'to', 'it', 'among', 'of', 'the', 'developing', 'and', 'underdeveloped', 'countries', 'bangladesh', 'has', 'been', 'chosen', 'though', 'the', 'rate', 'of', 'reporting', 'of', 'domestic', 'violence', 'is', 'low', 'the', 'extreme', 'report', 'collected', 'by', 'authorities', 'is', 'too', 'high', 'case', 'studies', 'collected', 'by', 'different', 'ngos', 'relating', 'to', 'domestic', 'violence', 'have', 'been', 'studied', 'and', 'applied', 'to', 'extract', 'possible', 'condition', 'for', 'the', 'victims']]
|
[-0.06390469357881874, 0.10821143532710442, -0.08874846444218364, 0.12381777670360675, -0.14262672145682645, -0.18080198847273565, 0.11146350689996763, 0.33182278134108306, -0.20616661972108197, -0.31396369006574515, 0.20110770852125462, -0.3108740028061242, -0.1272539362712505, 0.1916597902210968, -0.1782319723875318, -0.024184918574601727, 0.06741626403036427, 0.046454671793652376, 0.05277295738805074, -0.32802332481032753, 0.28541555666401197, 0.07955985822355802, 0.3263975597878761, 0.10416556892535055, 0.05818451767652688, -0.035882315139779936, -0.07878810549940331, 0.004976862049491512, -0.05106585522193507, 0.10515716948947261, 0.37834814557783214, 0.17968277661522558, 0.3785055436373475, -0.47816546700042056, -0.18596310996035315, 0.15135615640488195, 0.13550327180748728, 0.06285876616767569, -0.033400377660501655, -0.34071117514850996, 0.09559138551430148, -0.2867516158316958, -0.14102764980564544, -0.0764229236877557, 0.04569926003487893, -0.012853083475661206, -0.18477212540603366, 0.05639957792808706, -0.026818222655207818, 0.1089724846217916, -0.008800570662301707, -0.06718271272046582, -0.028097505445580883, 0.2334746218699168, 0.13609280040367025, -0.030827234285962152, 0.15198152785256774, -0.13646992342827102, -0.1125172844432934, 0.3719574362039566, 0.03678782562955271, -0.12828722480594754, 0.2032799645529005, -0.1500123174081231, -0.13373211096040905, 0.06062182924620448, 0.22271928778030428, 0.07105640738119696, -0.18020261311807168, 0.0009392022973288367, 0.0075036174455006795, 0.14504355164693603, 0.10884341231479971, -0.0572014989679208, 0.1852283234573362, 0.1367355701387355, 0.07611403405436326, 0.08925651331258241, -0.05754812741624079, -0.04712636671793445, -0.1615171813327505, -0.1252563662366964, -0.1273087709272527, 0.0347455256768111, 0.010322674792624605, -0.11806755991517959, 0.3537123792254961, 0.15502453358080912, 0.13369111196104302, -0.024485284592311113, 0.2591464957867536, 0.03985284052295498, 0.10033457878561892, 0.09879520253968392, 0.2346335228880396, 0.002576190946028983, 0.20715957531054696, -0.13883499676889055, 0.21790206280020796, -0.03358511814668057]
|
1,803.09402
|
Aggression-annotated Corpus of Hindi-English Code-mixed Data
|
As the interaction over the web has increased, incidents of aggression and
related events like trolling, cyberbullying, flaming, hate speech, etc. too
have increased manifold across the globe. While most of these behaviour like
bullying or hate speech have predated the Internet, the reach and extent of the
Internet has given these an unprecedented power and influence to affect the
lives of billions of people. So it is of utmost significance and importance
that some preventive measures be taken to provide safeguard to the people using
the web such that the web remains a viable medium of communication and
connection, in general. In this paper, we discuss the development of an
aggression tagset and an annotated corpus of Hindi-English code-mixed data from
two of the most popular social networking and social media platforms in India,
Twitter and Facebook. The corpus is annotated using a hierarchical tagset of 3
top-level tags and 10 level 2 tags. The final dataset contains approximately
18k tweets and 21k facebook comments and is being released for further research
in the field.
|
cs.CL
|
as the interaction over the web has increased incidents of aggression and related events like trolling cyberbullying flaming hate speech etc too have increased manifold across the globe while most of these behaviour like bullying or hate speech have predated the internet the reach and extent of the internet has given these an unprecedented power and influence to affect the lives of billions of people so it is of utmost significance and importance that some preventive measures be taken to provide safeguard to the people using the web such that the web remains a viable medium of communication and connection in general in this paper we discuss the development of an aggression tagset and an annotated corpus of hindienglish codemixed data from two of the most popular social networking and social media platforms in india twitter and facebook the corpus is annotated using a hierarchical tagset of 3 toplevel tags and 10 level 2 tags the final dataset contains approximately 18k tweets and 21k facebook comments and is being released for further research in the field
|
[['as', 'the', 'interaction', 'over', 'the', 'web', 'has', 'increased', 'incidents', 'of', 'aggression', 'and', 'related', 'events', 'like', 'trolling', 'cyberbullying', 'flaming', 'hate', 'speech', 'etc', 'too', 'have', 'increased', 'manifold', 'across', 'the', 'globe', 'while', 'most', 'of', 'these', 'behaviour', 'like', 'bullying', 'or', 'hate', 'speech', 'have', 'predated', 'the', 'internet', 'the', 'reach', 'and', 'extent', 'of', 'the', 'internet', 'has', 'given', 'these', 'an', 'unprecedented', 'power', 'and', 'influence', 'to', 'affect', 'the', 'lives', 'of', 'billions', 'of', 'people', 'so', 'it', 'is', 'of', 'utmost', 'significance', 'and', 'importance', 'that', 'some', 'preventive', 'measures', 'be', 'taken', 'to', 'provide', 'safeguard', 'to', 'the', 'people', 'using', 'the', 'web', 'such', 'that', 'the', 'web', 'remains', 'a', 'viable', 'medium', 'of', 'communication', 'and', 'connection', 'in', 'general', 'in', 'this', 'paper', 'we', 'discuss', 'the', 'development', 'of', 'an', 'aggression', 'tagset', 'and', 'an', 'annotated', 'corpus', 'of', 'hindienglish', 'codemixed', 'data', 'from', 'two', 'of', 'the', 'most', 'popular', 'social', 'networking', 'and', 'social', 'media', 'platforms', 'in', 'india', 'twitter', 'and', 'facebook', 'the', 'corpus', 'is', 'annotated', 'using', 'a', 'hierarchical', 'tagset', 'of', '3', 'toplevel', 'tags', 'and', '10', 'level', '2', 'tags', 'the', 'final', 'dataset', 'contains', 'approximately', '18k', 'tweets', 'and', '21k', 'facebook', 'comments', 'and', 'is', 'being', 'released', 'for', 'further', 'research', 'in', 'the', 'field']]
|
[-0.10381011899450888, 0.07858389909093107, -0.016326197793453255, 0.09039379505636382, -0.14135127623607827, -0.11027040424960433, 0.058396107069380705, 0.39421245716088876, -0.2194073252784702, -0.35595381693102274, 0.11459442902493967, -0.4197352372363887, -0.1502740682639838, 0.20305265667081007, -0.08599028003200973, -0.014184681416901929, 0.07131299713033844, 0.1138885856980778, 0.05012935846356082, -0.3121189916326495, 0.3171280016309042, 0.061504824811973696, 0.3349652069366791, 0.12017564618409696, 0.06924050185625674, -0.049600030591219285, -0.0888968665309552, -0.031221053904366934, -0.05138135942756476, 0.14845603229134047, 0.34348403598712385, 0.265370732517278, 0.3472114764736034, -0.4027352527482435, -0.17394885107933078, 0.09373320555922957, 0.16054938479316083, 0.05563574769373438, -0.04666791892271827, -0.384636243702103, 0.08934389337082393, -0.2408071261333217, -0.030844834344779058, -0.05308913328917697, 0.06971308149579934, 0.004138252718720733, -0.1585908199459399, 0.045362005576449024, 0.016372712411049924, 0.15724280186060985, -0.0023133069143196653, -0.0839672481015441, -0.02153393788136203, 0.2412710441355805, 0.11441766035568435, 0.018338037582163288, 0.1673881918911568, -0.2236636803610798, -0.10971632422561842, 0.40449792794904416, -0.03092162352087061, -0.10338841877158055, 0.19891781388882504, -0.049508292014996354, -0.1518511807741809, 0.0651441109419631, 0.257353572963356, 0.05931921567191074, -0.19425295969069173, -0.006472384495943764, -0.028614254693490115, 0.20823390138750916, 0.0988287787291814, 0.016170103582143467, 0.17571624762653795, 0.24101303954640488, 0.02457838434202131, 0.0805485448846329, -0.06390749232907017, -0.027234159764537417, -0.17379349013472992, -0.1674607733902204, -0.12944600029169867, 0.034763931324546735, -0.11632995538597739, -0.15832923709901728, 0.38941505625420675, 0.21373631912601096, 0.12985753390768712, 0.014327326985122372, 0.2544574858270194, -0.03428590195504843, 0.1093578350641606, 0.09018176235242042, 0.15419085597733845, -0.0276971768127458, 0.22028946433585422, -0.11365291671113069, 0.1216888747353964, -0.0557173823075242]
|
1,803.09403
|
Distinguishing Computer-generated Graphics from Natural Images Based on
Sensor Pattern Noise and Deep Learning
|
Computer-generated graphics (CGs) are images generated by computer software.
The~rapid development of computer graphics technologies has made it easier to
generate photorealistic computer graphics, and these graphics are quite
difficult to distinguish from natural images (NIs) with the naked eye. In this
paper, we propose a method based on sensor pattern noise (SPN) and deep
learning to distinguish CGs from NIs. Before being fed into our convolutional
neural network (CNN)-based model, these images---CGs and NIs---are clipped into
image patches. Furthermore, three high-pass filters (HPFs) are used to remove
low-frequency signals, which represent the image content. These filters are
also used to reveal the residual signal as well as SPN introduced by the
digital camera device. Different from the traditional methods of distinguishing
CGs from NIs, the proposed method utilizes a five-layer CNN to classify the
input image patches. Based on the classification results of the image patches,
we deploy a majority vote scheme to obtain the classification results for the
full-size images. The~experiments have demonstrated that (1) the proposed
method with three HPFs can achieve better results than that with only one HPF
or no HPF and that (2) the proposed method with three HPFs achieves 100\%
accuracy, although the NIs undergo a JPEG compression with a quality factor of
75.
|
cs.MM
|
computergenerated graphics cgs are images generated by computer software therapid development of computer graphics technologies has made it easier to generate photorealistic computer graphics and these graphics are quite difficult to distinguish from natural images nis with the naked eye in this paper we propose a method based on sensor pattern noise spn and deep learning to distinguish cgs from nis before being fed into our convolutional neural network cnnbased model these imagescgs and nisare clipped into image patches furthermore three highpass filters hpfs are used to remove lowfrequency signals which represent the image content these filters are also used to reveal the residual signal as well as spn introduced by the digital camera device different from the traditional methods of distinguishing cgs from nis the proposed method utilizes a fivelayer cnn to classify the input image patches based on the classification results of the image patches we deploy a majority vote scheme to obtain the classification results for the fullsize images theexperiments have demonstrated that 1 the proposed method with three hpfs can achieve better results than that with only one hpf or no hpf and that 2 the proposed method with three hpfs achieves 100 accuracy although the nis undergo a jpeg compression with a quality factor of 75
|
[['computergenerated', 'graphics', 'cgs', 'are', 'images', 'generated', 'by', 'computer', 'software', 'therapid', 'development', 'of', 'computer', 'graphics', 'technologies', 'has', 'made', 'it', 'easier', 'to', 'generate', 'photorealistic', 'computer', 'graphics', 'and', 'these', 'graphics', 'are', 'quite', 'difficult', 'to', 'distinguish', 'from', 'natural', 'images', 'nis', 'with', 'the', 'naked', 'eye', 'in', 'this', 'paper', 'we', 'propose', 'a', 'method', 'based', 'on', 'sensor', 'pattern', 'noise', 'spn', 'and', 'deep', 'learning', 'to', 'distinguish', 'cgs', 'from', 'nis', 'before', 'being', 'fed', 'into', 'our', 'convolutional', 'neural', 'network', 'cnnbased', 'model', 'these', 'imagescgs', 'and', 'nisare', 'clipped', 'into', 'image', 'patches', 'furthermore', 'three', 'highpass', 'filters', 'hpfs', 'are', 'used', 'to', 'remove', 'lowfrequency', 'signals', 'which', 'represent', 'the', 'image', 'content', 'these', 'filters', 'are', 'also', 'used', 'to', 'reveal', 'the', 'residual', 'signal', 'as', 'well', 'as', 'spn', 'introduced', 'by', 'the', 'digital', 'camera', 'device', 'different', 'from', 'the', 'traditional', 'methods', 'of', 'distinguishing', 'cgs', 'from', 'nis', 'the', 'proposed', 'method', 'utilizes', 'a', 'fivelayer', 'cnn', 'to', 'classify', 'the', 'input', 'image', 'patches', 'based', 'on', 'the', 'classification', 'results', 'of', 'the', 'image', 'patches', 'we', 'deploy', 'a', 'majority', 'vote', 'scheme', 'to', 'obtain', 'the', 'classification', 'results', 'for', 'the', 'fullsize', 'images', 'theexperiments', 'have', 'demonstrated', 'that', '1', 'the', 'proposed', 'method', 'with', 'three', 'hpfs', 'can', 'achieve', 'better', 'results', 'than', 'that', 'with', 'only', 'one', 'hpf', 'or', 'no', 'hpf', 'and', 'that', '2', 'the', 'proposed', 'method', 'with', 'three', 'hpfs', 'achieves', '100', 'accuracy', 'although', 'the', 'nis', 'undergo', 'a', 'jpeg', 'compression', 'with', 'a', 'quality', 'factor', 'of', '75']]
|
[-0.004463736510021243, -0.02132984025151905, -0.09284758607852431, 0.039541928864147174, -0.08717574762148954, -0.2019980548777514, -0.026739787368288328, 0.4756679280980486, -0.23858954679166924, -0.3756974639667981, 0.09187607090764989, -0.276420251581062, -0.20298564137895433, 0.24045262526234853, -0.12755618856180514, 0.05772414264395149, 0.10508756438249965, 0.02365988868981564, -0.045287137519307255, -0.3006165664253803, 0.24798649327451552, 0.023673459392458265, 0.338580340542943, -0.05432493600472448, 0.14791809755730653, -0.052118470847318715, -0.06022564373749583, 0.006022834170110308, -0.029453068795569796, 0.14775416449922618, 0.29708507798774086, 0.1593182833397374, 0.2519693912888747, -0.4508267873403243, -0.20442065212353705, 0.057330610320547926, 0.12202525941951983, 0.07861913913795679, -0.0778990114391174, -0.33745127412657017, 0.15311191857967904, -0.14517940623811693, 0.028928095357861495, -0.097685600756915, -0.0586114994386337, -0.013386881967347367, -0.2575603908913183, 0.02827135110057436, 0.05546292518254298, 0.04111021741828769, -0.022493667990545144, -0.12433846982348944, -0.007330969374194957, 0.16041492296333296, -0.021692439725348088, 0.06793505028070171, 0.1636578422152226, -0.15319623580570266, -0.11038769695205965, 0.3799300187262864, -0.03709148445453749, -0.1872103941415387, 0.20139650653840768, -0.051915825657312564, -0.0947557082939623, 0.1450805130239198, 0.19049521569828481, 0.09365817303836778, -0.15614634584005616, -0.030115827735837385, -0.02153790416420946, 0.2042541584783967, 0.08438639033018895, -0.006156540345872982, 0.17682091639363678, 0.19268149158080528, 0.011510702748760437, 0.14597287096290124, -0.20363953730973286, -0.016310423398885318, -0.1742606869578735, -0.11174764665482556, -0.19527203446830024, -0.020929764286988384, -0.0745771883597152, -0.15216758016244944, 0.4151900801813793, 0.24219345056411365, 0.20358397546651716, 0.06909440558432975, 0.37640268940960536, 0.015379424849727555, 0.18314198307369067, 0.07328285585418523, 0.19678375394879907, 0.06313622142705652, 0.11192020929796995, -0.11831828470652302, -0.009108988966360905, 0.05510612896414123]
|
1,803.09404
|
A Hierarchy of Empirical Models of Plasma Profiles and Transport
|
Two families of statistical models are presented which generalize global
confinement expressions to plasma profiles and local transport coefficients.
The temperature or diffusivity is parameterized as a function of the normalized
flux radius, $\bar{\psi}$, and the engineering variables, ${\bf u} =
(I_p,B_t,\bar{n},q_{95})^\dagger$. The log-additive temperature model assumes
that $\ln [T(\bar{\psi}, {\bf u})] =$ $f_0 (\bar{\psi}) + f_I
(\bar{\psi})\ln[I_p]$ $+ f_B (\bar{\psi}) \ln [B_t]$ $+ f_n (\bar{\psi}) \ln [
\bar{n}] + f_{q}\ln[q_{95}]$. The unknown $f_i (\bar{\psi})$ are estimated
using smoothing splines. A 43 profile Ohmic data set from the Joint European
Torus is analyzed and its shape dependencies are described. The best fit has an
average error of 152 eV which is 10.5 \% percent of the typical line average
temperature. The average error is less than the estimated measurement error
bars. The second class of models is log-additive diffusivity models where $\ln
[ \chi (\bar{\psi}, {\bf u})] $ $=\ g_0 (\bar{\psi}) + g_I (\bar{\psi})
\ln[I_p]$ $+ g_B (\bar{\psi}) \ln [B_t ]$ $+ g_n (\bar{\psi}) \ln [ \bar{n} ]$.
These log-additive diffusivity models are useful when the diffusivity is varied
smoothly with the plasma parameters. A penalized nonlinear regression technique
is recommended to estimate the $g_i (\bar{\psi})$. The physics implications of
the two classes of models, additive log-temperature models and additive
log-diffusivity models, are different. The additive log-diffusivity models
adjust the temperature profile shape as the radial distribution of sinks and
sources. In contrast, the additive log-temperature model predicts that the
temperature profile depends only on the global parameters and not on the radial
heat deposition.
|
stat.ME eess.SP
|
two families of statistical models are presented which generalize global confinement expressions to plasma profiles and local transport coefficients the temperature or diffusivity is parameterized as a function of the normalized flux radius barpsi and the engineering variables bf u i_pb_tbarnq_95dagger the logadditive temperature model assumes that ln tbarpsi bf u f_0 barpsi f_i barpsilni_p f_b barpsi ln b_t f_n barpsi ln barn f_qlnq_95 the unknown f_i barpsi are estimated using smoothing splines a 43 profile ohmic data set from the joint european torus is analyzed and its shape dependencies are described the best fit has an average error of 152 ev which is 105 percent of the typical line average temperature the average error is less than the estimated measurement error bars the second class of models is logadditive diffusivity models where ln chi barpsi bf u g_0 barpsi g_i barpsi lni_p g_b barpsi ln b_t g_n barpsi ln barn these logadditive diffusivity models are useful when the diffusivity is varied smoothly with the plasma parameters a penalized nonlinear regression technique is recommended to estimate the g_i barpsi the physics implications of the two classes of models additive logtemperature models and additive logdiffusivity models are different the additive logdiffusivity models adjust the temperature profile shape as the radial distribution of sinks and sources in contrast the additive logtemperature model predicts that the temperature profile depends only on the global parameters and not on the radial heat deposition
|
[['two', 'families', 'of', 'statistical', 'models', 'are', 'presented', 'which', 'generalize', 'global', 'confinement', 'expressions', 'to', 'plasma', 'profiles', 'and', 'local', 'transport', 'coefficients', 'the', 'temperature', 'or', 'diffusivity', 'is', 'parameterized', 'as', 'a', 'function', 'of', 'the', 'normalized', 'flux', 'radius', 'barpsi', 'and', 'the', 'engineering', 'variables', 'bf', 'u', 'i_pb_tbarnq_95dagger', 'the', 'logadditive', 'temperature', 'model', 'assumes', 'that', 'ln', 'tbarpsi', 'bf', 'u', 'f_0', 'barpsi', 'f_i', 'barpsilni_p', 'f_b', 'barpsi', 'ln', 'b_t', 'f_n', 'barpsi', 'ln', 'barn', 'f_qlnq_95', 'the', 'unknown', 'f_i', 'barpsi', 'are', 'estimated', 'using', 'smoothing', 'splines', 'a', '43', 'profile', 'ohmic', 'data', 'set', 'from', 'the', 'joint', 'european', 'torus', 'is', 'analyzed', 'and', 'its', 'shape', 'dependencies', 'are', 'described', 'the', 'best', 'fit', 'has', 'an', 'average', 'error', 'of', '152', 'ev', 'which', 'is', '105', 'percent', 'of', 'the', 'typical', 'line', 'average', 'temperature', 'the', 'average', 'error', 'is', 'less', 'than', 'the', 'estimated', 'measurement', 'error', 'bars', 'the', 'second', 'class', 'of', 'models', 'is', 'logadditive', 'diffusivity', 'models', 'where', 'ln', 'chi', 'barpsi', 'bf', 'u', 'g_0', 'barpsi', 'g_i', 'barpsi', 'lni_p', 'g_b', 'barpsi', 'ln', 'b_t', 'g_n', 'barpsi', 'ln', 'barn', 'these', 'logadditive', 'diffusivity', 'models', 'are', 'useful', 'when', 'the', 'diffusivity', 'is', 'varied', 'smoothly', 'with', 'the', 'plasma', 'parameters', 'a', 'penalized', 'nonlinear', 'regression', 'technique', 'is', 'recommended', 'to', 'estimate', 'the', 'g_i', 'barpsi', 'the', 'physics', 'implications', 'of', 'the', 'two', 'classes', 'of', 'models', 'additive', 'logtemperature', 'models', 'and', 'additive', 'logdiffusivity', 'models', 'are', 'different', 'the', 'additive', 'logdiffusivity', 'models', 'adjust', 'the', 'temperature', 'profile', 'shape', 'as', 'the', 'radial', 'distribution', 'of', 'sinks', 'and', 'sources', 'in', 'contrast', 'the', 'additive', 'logtemperature', 'model', 'predicts', 'that', 'the', 'temperature', 'profile', 'depends', 'only', 'on', 'the', 'global', 'parameters', 'and', 'not', 'on', 'the', 'radial', 'heat', 'deposition']]
|
[-0.10947073401592962, 0.1915570430713227, -0.02434942589163603, 0.025490923646083546, -0.03364259089056999, -0.16560682569110355, 0.005007189175404318, 0.371386584567785, -0.24976275106932308, -0.26398826834798117, 0.0313140590825356, -0.34076661889711435, -0.06643463093288508, 0.15470930257943424, -0.02315418172256771, 0.05866521620116039, -0.027926679504067672, 0.05501612906396647, -0.06055863893105048, -0.21843427227451204, 0.2314011172835717, 0.020444292498518635, 0.25071714816965746, -0.010639635083019669, 0.06688168729218005, -0.05433924682539166, -0.020034157017899023, -0.03217210096520779, -0.22405921755270636, 0.02081311640059535, 0.16226596420076958, 0.03527672955508292, 0.25284603156665447, -0.3167425586975047, -0.2016071074992999, 0.14134706221762802, 0.13191303594473314, -0.016847232809225784, 0.06479315711306287, -0.2138287995849208, 0.008924213177584982, -0.14225508919433244, -0.11930985520372078, -0.045049943890648356, 0.08533982557165981, 0.06532380424714063, -0.37784435356124524, 0.17951580973491235, 0.02730532283960233, 0.035956469719253835, -0.03922144354480315, -0.2707768312949703, -0.08184143812879437, 0.06932008069361867, 0.05696746063503352, 0.12665342107552277, 0.20914213137310078, -0.14386682145829713, 0.012649655547718724, 0.35986539480393326, -0.12917558885275465, -0.20667236544659515, 0.07984220263149057, -0.15294160209374413, -0.08056619052182544, 0.10151544588243032, 0.14176790027584865, 0.10400700277257792, -0.1286980111096624, 0.15251700623413608, -0.02010751395734245, 0.20175992206819518, 0.057722141837209334, -0.02386215166692739, 0.14047693732714692, 0.09604387569999186, 0.009476550802330433, 0.04477396832569402, -0.09359810977228776, -0.04490627629438756, -0.3379658327722172, -0.06577627126780616, -0.1772794590399145, 0.05635767445091443, -0.1742918086052999, -0.17115926644432225, 0.36548323114906556, 0.1132123590803814, 0.21454025031716534, 0.0744869331359305, 0.2345811076718282, 0.17136044449328386, 0.029418839888094857, 0.12898736598284602, 0.1838591356048143, 0.17994800423779947, 0.039912181136347515, -0.23952687997585143, 0.05359191240371004, 0.055496606537346525]
|
1,803.09405
|
Automatic Identification of Closely-related Indian Languages: Resources
and Experiments
|
In this paper, we discuss an attempt to develop an automatic language
identification system for 5 closely-related Indo-Aryan languages of India,
Awadhi, Bhojpuri, Braj, Hindi and Magahi. We have compiled a comparable corpora
of varying length for these languages from various resources. We discuss the
method of creation of these corpora in detail. Using these corpora, a language
identification system was developed, which currently gives state of the art
accuracy of 96.48\%. We also used these corpora to study the similarity between
the 5 languages at the lexical level, which is the first data-based study of
the extent of closeness of these languages.
|
cs.CL
|
in this paper we discuss an attempt to develop an automatic language identification system for 5 closelyrelated indoaryan languages of india awadhi bhojpuri braj hindi and magahi we have compiled a comparable corpora of varying length for these languages from various resources we discuss the method of creation of these corpora in detail using these corpora a language identification system was developed which currently gives state of the art accuracy of 9648 we also used these corpora to study the similarity between the 5 languages at the lexical level which is the first databased study of the extent of closeness of these languages
|
[['in', 'this', 'paper', 'we', 'discuss', 'an', 'attempt', 'to', 'develop', 'an', 'automatic', 'language', 'identification', 'system', 'for', '5', 'closelyrelated', 'indoaryan', 'languages', 'of', 'india', 'awadhi', 'bhojpuri', 'braj', 'hindi', 'and', 'magahi', 'we', 'have', 'compiled', 'a', 'comparable', 'corpora', 'of', 'varying', 'length', 'for', 'these', 'languages', 'from', 'various', 'resources', 'we', 'discuss', 'the', 'method', 'of', 'creation', 'of', 'these', 'corpora', 'in', 'detail', 'using', 'these', 'corpora', 'a', 'language', 'identification', 'system', 'was', 'developed', 'which', 'currently', 'gives', 'state', 'of', 'the', 'art', 'accuracy', 'of', '9648', 'we', 'also', 'used', 'these', 'corpora', 'to', 'study', 'the', 'similarity', 'between', 'the', '5', 'languages', 'at', 'the', 'lexical', 'level', 'which', 'is', 'the', 'first', 'databased', 'study', 'of', 'the', 'extent', 'of', 'closeness', 'of', 'these', 'languages']]
|
[-0.08646902271706347, 0.017846054654166273, -0.03593861421269148, 0.1078898303323623, -0.08045891789964052, -0.07240897824404517, 0.0488879584126419, 0.40993153089375206, -0.2606513800118307, -0.35639687676471893, 0.06043804001128959, -0.27438428888868804, -0.07985075071661009, 0.21522731930276173, -0.06793380030101598, 0.04132825256598116, 0.08714326089624354, 0.062054987408860465, -0.06348691709490135, -0.2713440773030273, 0.3635149053439046, 0.017926434464188234, 0.3284062066237734, 0.024903922496984403, 0.08401795240669427, -0.08580622497494474, -0.057725610446674055, -0.023679518347813025, -0.13425815405060698, 0.22156884107324812, 0.3489701899281242, 0.23748831873326892, 0.2754858953953542, -0.3627556228370528, -0.11913326156626672, 0.03705732435496016, 0.11502737639650627, 0.14223130896565211, 0.0014777843642866974, -0.3315555266283377, 0.08280216196006296, -0.23888809930043992, 0.0017091340874556941, -0.09964633131907745, 0.03721509865400466, 0.003055810867197285, -0.17122588630982044, 0.026815596240927757, 0.10259407036232226, 0.16379090159604645, -0.03829618774806008, -0.1480316756166179, 0.05322939385848139, 0.18761795369738882, 0.0613069248578577, 0.020743520480328983, 0.05368900235220225, -0.12562173505953392, -0.19089988899896992, 0.3659920807965476, -0.06456404429098422, -0.20696705464988646, 0.2690503214194317, -0.07629741234892998, -0.18572479832654049, 0.03699942549803492, 0.24085711285170883, 0.09374261205319805, -0.2112624016261161, 0.043492527847352316, -0.04061573250877737, 0.2592066868838638, 0.11673320733443504, -0.0018209347012217599, 0.1885253789392535, 0.25173334630130967, -0.04375396564254782, 0.18008815338646975, -0.08521521819586103, -0.012786944147500427, -0.24734769903142192, -0.18759112319711482, -0.10499245085697057, -0.041174316157897316, -0.047421987826854806, -0.16605866670307487, 0.4199805138538582, 0.2420133374386815, 0.0884509485290207, 0.09930661991661922, 0.24395512276790057, 0.033146077155540084, 0.07642069350777551, 0.08264545351266861, 0.14736317063804077, 0.0014021204880937332, 0.14570282617903718, -0.19659562031926606, 0.08914144563422811, 0.03697351765297965]
|
1,803.09406
|
Study of Twist-2 GTMDs in scalar-diquark model
|
We investigate the Generalized Transverse Momentum-dependent Distributions
(GTMDs) describing the parton structure of proton using the light-front
scalar-diquark model. In particular, we study the Wigner distributions for
unpolarized quark in unpolarized, longitudinally-polarized and
transversely-polarized proton. We also investigate the twist-2 GTMDs for
unpolarized quark $(\Gamma=\gamma^+)$ in scalar-diquark model.
|
hep-ph
|
we investigate the generalized transverse momentumdependent distributions gtmds describing the parton structure of proton using the lightfront scalardiquark model in particular we study the wigner distributions for unpolarized quark in unpolarized longitudinallypolarized and transverselypolarized proton we also investigate the twist2 gtmds for unpolarized quark gammagamma in scalardiquark model
|
[['we', 'investigate', 'the', 'generalized', 'transverse', 'momentumdependent', 'distributions', 'gtmds', 'describing', 'the', 'parton', 'structure', 'of', 'proton', 'using', 'the', 'lightfront', 'scalardiquark', 'model', 'in', 'particular', 'we', 'study', 'the', 'wigner', 'distributions', 'for', 'unpolarized', 'quark', 'in', 'unpolarized', 'longitudinallypolarized', 'and', 'transverselypolarized', 'proton', 'we', 'also', 'investigate', 'the', 'twist2', 'gtmds', 'for', 'unpolarized', 'quark', 'gammagamma', 'in', 'scalardiquark', 'model']]
|
[-0.0062495004588171196, 0.31949260893642256, -0.16474520892876646, 0.27192657027879485, -0.012490499913996167, -0.005842426070518306, -0.02384186918725786, 0.45230270618491847, -0.12906959418045438, -0.1316265817731619, -0.20482000964440647, -0.2942088322066095, 0.026276592570154564, 0.06093673680342086, 0.14256437734255326, 0.15097301505991947, 0.009973880308477776, -0.08719007634436307, -0.17557650073633893, -0.13416655703306035, 0.43222798500210047, 0.009341092484132589, 0.2805195786868748, 0.19892963827790125, 0.0825104890593692, 0.22133231694486155, -0.12269908311250417, -0.1425841826459636, -0.1327543176214575, 0.047855533629088946, 0.18100954060007454, 0.0013335179537534714, -0.01019781315193066, -0.37438030356703245, -0.12044976826797685, 0.0746378920081517, 0.1541235392467807, 0.13064486785467877, 0.021760005787338898, -0.2445586756195711, -0.01665199985322745, -0.3315479794274206, -0.2538191115726595, -0.1913731075499369, -0.023866526640789663, 0.026435551107051255, -0.32499036384852725, 0.10216256432961571, -0.012766655068844557, -0.042027093311290904, -0.04070480078782724, -0.28793974338180345, -0.07628128839575726, -0.020482703274034935, 0.09520295962347122, 0.11508828000185768, 0.09375623655859786, -0.25733421476173174, -0.1497274548544184, 0.37971993106538837, -0.049947768449783325, -0.27203924589506956, -0.03835749861014926, -0.3472770902773608, -0.16038533441884362, 0.05065294920021425, 0.3208383905053463, 0.10612808514143461, -0.2532188614600075, 0.13693323811268152, -0.11961279557410466, 0.1094404213818843, 0.14930046274853143, 0.07227407995125522, 0.16916591690286345, 0.199381341869214, -0.14362908114233744, 0.1334579387355758, -0.12730025324929992, -0.14101485023275018, -0.3669747248615908, -0.10892852081831181, -0.08520635685114109, 0.09525965747382978, -0.07346736243894354, -0.10902234903820184, 0.43344678940332454, 0.08680853941072912, 0.22924455085202403, -0.03973460831153004, 0.31188500891237153, 0.14059521043268236, 0.02191236812580863, 0.09135204304576568, 0.1942782660379358, 0.2572929503639107, 0.1434168114691325, -0.2992450638026323, 0.041053088311024985, 0.06341074125679291]
|
1,803.09407
|
Spectral dimension of spheres
|
In this paper, we associate a growth graph and a length operator to a
quotient space of a semisimple compact Lie group. Under certain assumptions, we
show that the spectral dimension of a homogeneous space is greater than or
equal to summability of the length operator. Using this, we compute spectral
dimensions of spheres.
|
math.OA
|
in this paper we associate a growth graph and a length operator to a quotient space of a semisimple compact lie group under certain assumptions we show that the spectral dimension of a homogeneous space is greater than or equal to summability of the length operator using this we compute spectral dimensions of spheres
|
[['in', 'this', 'paper', 'we', 'associate', 'a', 'growth', 'graph', 'and', 'a', 'length', 'operator', 'to', 'a', 'quotient', 'space', 'of', 'a', 'semisimple', 'compact', 'lie', 'group', 'under', 'certain', 'assumptions', 'we', 'show', 'that', 'the', 'spectral', 'dimension', 'of', 'a', 'homogeneous', 'space', 'is', 'greater', 'than', 'or', 'equal', 'to', 'summability', 'of', 'the', 'length', 'operator', 'using', 'this', 'we', 'compute', 'spectral', 'dimensions', 'of', 'spheres']]
|
[-0.16070752549502584, 0.10378626749540369, -0.11717894097307215, 0.06648740423110279, -0.12073269069919156, -0.07852050830196175, 0.0017068175948224962, 0.3965768834006869, -0.2673451720598947, -0.16775235591706372, 0.13075465600963476, -0.23383499530178528, -0.15135155534113032, 0.1638053610049947, -0.10834359256895604, -0.04008778308828672, 0.047802577545452446, 0.12788169703411836, -0.15736042347270995, -0.24150633183577425, 0.4665073865541705, -0.0023253188744463303, 0.2066934552492091, 0.014022039649447563, 0.12226027634891647, 0.005253345636581933, 0.004175003066107079, 0.06142421961757699, -0.19597588437762978, 0.1754240073022191, 0.21309703834682564, 0.059861277734550335, 0.2522959632333368, -0.3433324594257606, -0.20837502704105443, 0.2269844003021717, 0.14714983278126628, -0.017184192159523565, 0.032299512488491555, -0.21963567888640143, 0.15177435392548363, -0.16362985846138112, -0.17007472064277088, -0.028390668315330037, 0.06349322544755759, -0.04522939491478071, -0.29011034470534436, 0.02568694843945128, 0.0823668940682654, 0.11792399373802322, -0.0673014401561684, -0.0419058827597096, 0.005250942117224137, 0.06331494670680345, -0.017041463038401195, 0.01798167227146526, 0.1037918034578777, -0.062434524634025164, -0.10105115584856658, 0.3828928765789088, -0.08808005162804707, -0.25256713848837, 0.17016769604136547, -0.2202809395234066, -0.14348302764335163, 0.11431287932727072, 0.15271512089573122, 0.1599558837780798, -0.043210821277979344, 0.1548743131732206, -0.09986317621681977, 0.1769512324352507, 0.11966485123115557, 0.04019474032059036, 0.07077113104363282, 0.16620525441787862, 0.15289076096895668, 0.1556442570484554, 0.00046561351390900436, 0.002908949188336178, -0.33335393970763244, -0.23335758970050072, -0.1959404995733941, 0.14830575346153368, -0.1564477284143019, -0.19761898265116745, 0.4234471614127634, 0.1095959563843078, 0.21862276743545575, 0.12086297066330358, 0.23224314571254784, 0.13216274296778632, 0.09684761661898207, 0.10306248261110375, 0.09194927441853064, 0.15926636940437472, -0.01909608390458204, -0.1624100957221041, -0.07238818438189035, 0.15980457067834558]
|
1,803.09408
|
Efficient File Delivery for Coded Prefetching in Shared Cache Networks
with Multiple Requests Per User
|
We consider a centralized caching network, where a server serves several
groups of users, each having a common shared homogeneous fixed-size cache and
requesting arbitrary multiple files. An existing coded prefetching scheme is
employed where each file is broken into multiple fragments and each cache
stores multiple coded packets each formed by XORing fragments from different
files. For such a system, we propose an efficient file delivery scheme with
explicit constructions by the server to meet the arbitrary multi-requests of
all user-groups. Specifically, the stored coded packets of each cache are
classified into four types based on the composition of the file fragments
encoded. A delivery strategy is developed, which separately delivers part of
each packet type first and then combinatorially delivers the remaining
different packet types in the last stage. The rate as well as the worst rate of
the proposed delivery scheme are analyzed. We show that our caching model and
delivery scheme can incorporate some existing coded caching schemes as special
cases. Moreover, for the special case of uniform requests and uncoded
prefetching, we make a comparison with existing results, and show that our
approach can achieve a lower delivery rate. We also provide numerical results
on the delivery rate for the proposed scheme.
|
cs.IT math.IT
|
we consider a centralized caching network where a server serves several groups of users each having a common shared homogeneous fixedsize cache and requesting arbitrary multiple files an existing coded prefetching scheme is employed where each file is broken into multiple fragments and each cache stores multiple coded packets each formed by xoring fragments from different files for such a system we propose an efficient file delivery scheme with explicit constructions by the server to meet the arbitrary multirequests of all usergroups specifically the stored coded packets of each cache are classified into four types based on the composition of the file fragments encoded a delivery strategy is developed which separately delivers part of each packet type first and then combinatorially delivers the remaining different packet types in the last stage the rate as well as the worst rate of the proposed delivery scheme are analyzed we show that our caching model and delivery scheme can incorporate some existing coded caching schemes as special cases moreover for the special case of uniform requests and uncoded prefetching we make a comparison with existing results and show that our approach can achieve a lower delivery rate we also provide numerical results on the delivery rate for the proposed scheme
|
[['we', 'consider', 'a', 'centralized', 'caching', 'network', 'where', 'a', 'server', 'serves', 'several', 'groups', 'of', 'users', 'each', 'having', 'a', 'common', 'shared', 'homogeneous', 'fixedsize', 'cache', 'and', 'requesting', 'arbitrary', 'multiple', 'files', 'an', 'existing', 'coded', 'prefetching', 'scheme', 'is', 'employed', 'where', 'each', 'file', 'is', 'broken', 'into', 'multiple', 'fragments', 'and', 'each', 'cache', 'stores', 'multiple', 'coded', 'packets', 'each', 'formed', 'by', 'xoring', 'fragments', 'from', 'different', 'files', 'for', 'such', 'a', 'system', 'we', 'propose', 'an', 'efficient', 'file', 'delivery', 'scheme', 'with', 'explicit', 'constructions', 'by', 'the', 'server', 'to', 'meet', 'the', 'arbitrary', 'multirequests', 'of', 'all', 'usergroups', 'specifically', 'the', 'stored', 'coded', 'packets', 'of', 'each', 'cache', 'are', 'classified', 'into', 'four', 'types', 'based', 'on', 'the', 'composition', 'of', 'the', 'file', 'fragments', 'encoded', 'a', 'delivery', 'strategy', 'is', 'developed', 'which', 'separately', 'delivers', 'part', 'of', 'each', 'packet', 'type', 'first', 'and', 'then', 'combinatorially', 'delivers', 'the', 'remaining', 'different', 'packet', 'types', 'in', 'the', 'last', 'stage', 'the', 'rate', 'as', 'well', 'as', 'the', 'worst', 'rate', 'of', 'the', 'proposed', 'delivery', 'scheme', 'are', 'analyzed', 'we', 'show', 'that', 'our', 'caching', 'model', 'and', 'delivery', 'scheme', 'can', 'incorporate', 'some', 'existing', 'coded', 'caching', 'schemes', 'as', 'special', 'cases', 'moreover', 'for', 'the', 'special', 'case', 'of', 'uniform', 'requests', 'and', 'uncoded', 'prefetching', 'we', 'make', 'a', 'comparison', 'with', 'existing', 'results', 'and', 'show', 'that', 'our', 'approach', 'can', 'achieve', 'a', 'lower', 'delivery', 'rate', 'we', 'also', 'provide', 'numerical', 'results', 'on', 'the', 'delivery', 'rate', 'for', 'the', 'proposed', 'scheme']]
|
[-0.21342148464986854, 0.022841190228841124, -0.04530696288763898, 0.0218211599841524, -0.027657312807825945, -0.2519111430738121, 0.13069373135143006, 0.399336438065449, -0.27634431429668466, -0.2679936257383144, 0.10305280176961107, -0.2529054999360543, -0.09706955268816317, 0.1439203842830148, -0.1032570457397915, 0.055444944982227046, 0.05188613487692599, 0.05930403975933198, -0.03335150693389542, -0.3663852922268013, 0.29308308297044877, 0.05787268522855581, 0.34812818279770175, 0.010114478096546769, 0.08900294821083238, 0.04957345301919454, -0.057720815018045456, -0.035684371458585, -0.0940830706174681, 0.08789294729126816, 0.30751533385872554, 0.23546020863848982, 0.2484004478517341, -0.45088175475344205, -0.21031877590971773, 0.03757060064879942, 0.17643498745068764, 0.12622830461771725, -0.07923724162008035, -0.2534328641955406, 0.1440046268088056, -0.2646160455718998, -0.0013597894943708066, -0.021115317052338742, -0.04977694457030665, 0.10512274657873419, -0.3246940318585455, -0.05412477987365757, -0.020638761170083, -0.04899712845918189, -0.08179257748517416, -0.11562999808037364, -0.007653825928782592, 0.18413736853178916, 0.01773936745246705, -0.0007055069125501566, 0.1084261612867195, -0.0298719331715369, -0.11727977790519396, 0.4203683089971253, 0.003083512875323808, -0.21462639546681883, 0.12642487608183411, -0.0066957931843522975, -0.12997566655874976, 0.1588259810294721, 0.20944543813979163, 0.11931987603656152, -0.15216587709932072, -0.0219626422916105, -0.06670309349134998, 0.21153097328937892, 0.13815304921777213, 0.11763428733458073, 0.13306683904120645, 0.19606747648235665, 0.07985236198422092, 0.18583210684964885, -0.0826656672565574, -0.11765883969893516, -0.2507034304121722, -0.16178514617122258, -0.16361610914492364, -0.04295213163708273, -0.13524388077680713, -0.0823574249680127, 0.363830553961943, 0.10527682389885422, 0.1731200167023152, 0.10865030956773304, 0.42101887456204706, 0.07002113684921445, 0.09734415079837719, 0.17179434532435267, 0.061294360432883464, -0.022474427349770495, 0.13932227251092785, -0.15430020228439706, 0.1060928521876775, 0.0662180418103427]
|
1,803.09409
|
Impact of packing fraction on diffusion-driven pattern formation in a
two-dimensional system of rod-like particles
|
Pattern formation in a two-dimensional system of rod-like particles has been
simulated using a lattice approach. Rod-like particles were modelled as linear
$k$-mers of two mutually perpendicular orientations ($k_x$- and $k_y$-mers) on
a square lattice with periodic boundary conditions (torus). Two kinds of random
sequential adsorption model were used to produce the initial homogeneous and
isotropic distribution of $k$-mers with different values of packing fraction.
By means of the Monte Carlo technique, translational diffusion of the $k$-mers
was simulated as a random walk, while rotational diffusion was ignored, so,
$k_x$- and $k_y$-mers were considered as individual species. The system tends
toward a well-organized nonequilibrium steady state in the form of diagonal
stripes for the relatively long $k$-mer ($k \geq 6$) and moderate packing
densities (in the interval $p_{down} < p < p_{up}$, where both the critical
packing fractions $p_{down}$ and $p_{up}$ are depended on $k$).
|
cond-mat.stat-mech cond-mat.soft
|
pattern formation in a twodimensional system of rodlike particles has been simulated using a lattice approach rodlike particles were modelled as linear kmers of two mutually perpendicular orientations k_x and k_ymers on a square lattice with periodic boundary conditions torus two kinds of random sequential adsorption model were used to produce the initial homogeneous and isotropic distribution of kmers with different values of packing fraction by means of the monte carlo technique translational diffusion of the kmers was simulated as a random walk while rotational diffusion was ignored so k_x and k_ymers were considered as individual species the system tends toward a wellorganized nonequilibrium steady state in the form of diagonal stripes for the relatively long kmer k geq 6 and moderate packing densities in the interval p_down p p_up where both the critical packing fractions p_down and p_up are depended on k
|
[['pattern', 'formation', 'in', 'a', 'twodimensional', 'system', 'of', 'rodlike', 'particles', 'has', 'been', 'simulated', 'using', 'a', 'lattice', 'approach', 'rodlike', 'particles', 'were', 'modelled', 'as', 'linear', 'kmers', 'of', 'two', 'mutually', 'perpendicular', 'orientations', 'k_x', 'and', 'k_ymers', 'on', 'a', 'square', 'lattice', 'with', 'periodic', 'boundary', 'conditions', 'torus', 'two', 'kinds', 'of', 'random', 'sequential', 'adsorption', 'model', 'were', 'used', 'to', 'produce', 'the', 'initial', 'homogeneous', 'and', 'isotropic', 'distribution', 'of', 'kmers', 'with', 'different', 'values', 'of', 'packing', 'fraction', 'by', 'means', 'of', 'the', 'monte', 'carlo', 'technique', 'translational', 'diffusion', 'of', 'the', 'kmers', 'was', 'simulated', 'as', 'a', 'random', 'walk', 'while', 'rotational', 'diffusion', 'was', 'ignored', 'so', 'k_x', 'and', 'k_ymers', 'were', 'considered', 'as', 'individual', 'species', 'the', 'system', 'tends', 'toward', 'a', 'wellorganized', 'nonequilibrium', 'steady', 'state', 'in', 'the', 'form', 'of', 'diagonal', 'stripes', 'for', 'the', 'relatively', 'long', 'kmer', 'k', 'geq', '6', 'and', 'moderate', 'packing', 'densities', 'in', 'the', 'interval', 'p_down', 'p', 'p_up', 'where', 'both', 'the', 'critical', 'packing', 'fractions', 'p_down', 'and', 'p_up', 'are', 'depended', 'on', 'k']]
|
[-0.14177432022464515, 0.24624199802650415, -0.047644766417483914, 0.01894120243873368, 0.012822243198422147, -0.1683534055333981, 0.02446583652016806, 0.43346198516111845, -0.23171843690071123, -0.28125694836654985, 0.08432385500715318, -0.2791054392273122, -0.06179503123077782, 0.11011263549597008, 0.058336638564785534, 0.10028794979445838, 0.020494324089926238, -0.006103953197994765, -0.021438694160666107, -0.2600190505857665, 0.2206884814386672, -0.003853730754992852, 0.28609553885031885, -0.002681284943093539, 0.10576673485140534, 0.028658263309336934, 0.02073743756768023, 0.0733140739810435, -0.18683884685680746, 0.026015038080249273, 0.17937419247311534, -0.01023559624837804, 0.21287742420925315, -0.4194426622426679, -0.19398817063659324, 0.10328224627135969, 0.18184564860227206, 0.10862501070781855, 0.006947353001723581, -0.2301059640309912, 0.06826674237687154, -0.10817275011370368, -0.13163774398796207, -0.012948586397427828, 0.062274707850326405, 0.11018399241444793, -0.23881917282693743, 0.11866207975904121, 0.05961788776297624, 0.10543160373675274, -0.06927046203054488, -0.19096168259601273, -0.06743109777094201, 0.08474331677574268, 0.026012409873082176, 0.04106589225418073, 0.16334723777109625, -0.0741732856423878, -0.10241784814229989, 0.41606075173336354, -0.04559594427453394, -0.22841287072721525, 0.19442738300347898, -0.16974134228013932, -0.11669082694409534, 0.21912437948358662, 0.16632187285242564, 0.1248570859881369, -0.12202967759816254, 0.054413255680177415, -0.06899526776623721, 0.15310257887599846, 0.10350548509336638, -0.07031706581057333, 0.21160258670793253, 0.13653704318620846, 0.05703589110139837, 0.17076957618309094, -0.12632689092816876, -0.13682293287207578, -0.20108718254870953, -0.14697513311559743, -0.22383024857927722, 0.07865264953332061, -0.12350064536739482, -0.21062888669061428, 0.2958307237222342, 0.045616604787783024, 0.23399750935904523, 0.05418850294399366, 0.21980545494428022, 0.034296936230033846, 0.009375167904910466, 0.028277619393436728, 0.13561162727072518, 0.1709846710003516, 0.06217881576207645, -0.19335550441842606, 0.10277660309455972, 0.07516925806817037]
|
1,803.0941
|
Projection effects of large-scale structures on weak-lensing peak
abundances
|
High peaks in weak lensing (WL) maps originate dominantly from the lensing
effects of single massive halos. Their abundance is therefore closely related
to the halo mass function and thus a powerful cosmological probe. On the other
hand, however, besides individual massive halos, large-scale structures (LSS)
along lines of sight also contribute to the peak signals. In this paper, with
ray tracing simulations, we investigate the LSS projection effects. We show
that for current surveys with a large shape noise, the stochastic LSS effects
are subdominant. For future WL surveys with source galaxies having a median
redshift $z_{\mathrm{med}}\sim1$ or higher, however, they are significant. For
the cosmological constraints derived from observed WL high peak counts, severe
biases can occur if the LSS effects are not taken into account properly. We
extend the model of \citet{Fan2010} by incorporating the LSS projection effects
into the theoretical considerations. By comparing with simulation results, we
demonstrate the good performance of the improved model and its applicability in
cosmological studies.
|
astro-ph.CO
|
high peaks in weak lensing wl maps originate dominantly from the lensing effects of single massive halos their abundance is therefore closely related to the halo mass function and thus a powerful cosmological probe on the other hand however besides individual massive halos largescale structures lss along lines of sight also contribute to the peak signals in this paper with ray tracing simulations we investigate the lss projection effects we show that for current surveys with a large shape noise the stochastic lss effects are subdominant for future wl surveys with source galaxies having a median redshift z_mathrmmedsim1 or higher however they are significant for the cosmological constraints derived from observed wl high peak counts severe biases can occur if the lss effects are not taken into account properly we extend the model of citetfan2010 by incorporating the lss projection effects into the theoretical considerations by comparing with simulation results we demonstrate the good performance of the improved model and its applicability in cosmological studies
|
[['high', 'peaks', 'in', 'weak', 'lensing', 'wl', 'maps', 'originate', 'dominantly', 'from', 'the', 'lensing', 'effects', 'of', 'single', 'massive', 'halos', 'their', 'abundance', 'is', 'therefore', 'closely', 'related', 'to', 'the', 'halo', 'mass', 'function', 'and', 'thus', 'a', 'powerful', 'cosmological', 'probe', 'on', 'the', 'other', 'hand', 'however', 'besides', 'individual', 'massive', 'halos', 'largescale', 'structures', 'lss', 'along', 'lines', 'of', 'sight', 'also', 'contribute', 'to', 'the', 'peak', 'signals', 'in', 'this', 'paper', 'with', 'ray', 'tracing', 'simulations', 'we', 'investigate', 'the', 'lss', 'projection', 'effects', 'we', 'show', 'that', 'for', 'current', 'surveys', 'with', 'a', 'large', 'shape', 'noise', 'the', 'stochastic', 'lss', 'effects', 'are', 'subdominant', 'for', 'future', 'wl', 'surveys', 'with', 'source', 'galaxies', 'having', 'a', 'median', 'redshift', 'z_mathrmmedsim1', 'or', 'higher', 'however', 'they', 'are', 'significant', 'for', 'the', 'cosmological', 'constraints', 'derived', 'from', 'observed', 'wl', 'high', 'peak', 'counts', 'severe', 'biases', 'can', 'occur', 'if', 'the', 'lss', 'effects', 'are', 'not', 'taken', 'into', 'account', 'properly', 'we', 'extend', 'the', 'model', 'of', 'citetfan2010', 'by', 'incorporating', 'the', 'lss', 'projection', 'effects', 'into', 'the', 'theoretical', 'considerations', 'by', 'comparing', 'with', 'simulation', 'results', 'we', 'demonstrate', 'the', 'good', 'performance', 'of', 'the', 'improved', 'model', 'and', 'its', 'applicability', 'in', 'cosmological', 'studies']]
|
[-0.08104528675278637, 0.07464329577751024, -0.06616931833800692, 0.15865356753083185, -0.09809823263153732, -0.0747970619975972, -0.012625183116650335, 0.3909560670973333, -0.2355397467678584, -0.3209268016814957, 0.06882688149229903, -0.3072584801324232, -0.0867146552194687, 0.20450609894555086, 0.01709466302436005, -0.0072735654032343505, 0.08593911897716758, -0.09556221341759973, -0.07076781414628837, -0.2655388352788265, 0.3170163196488712, 0.1524648164153282, 0.25896678186890215, 0.01522658654757164, 0.07177041881547047, -0.05212981559256195, -0.13722240604014577, 0.09822093973941873, -0.13153923828333533, 0.03242279909639705, 0.19496117959633194, 0.121331779033437, 0.22588887070791305, -0.4113342791475767, -0.24579607532645342, 0.11585121846934952, 0.1733037936727965, 0.13137672851547783, -0.08844047900149313, -0.3206311918715118, 0.10560239064314351, -0.12413732326543815, -0.09290072703848314, -0.005982058288449524, -0.07104978877536815, 0.05148785917139812, -0.227874515135344, 0.1820865992677721, 0.005437622665273357, -0.003729513966324139, -0.03497776901635107, -0.11935243359909742, -0.03228905361054316, 0.10125044489956456, 0.05054130968409219, 0.022386870312681592, 0.181431034181347, -0.163776718758538, -0.05441404703113199, 0.4330869610907018, -0.09142722760789965, -0.12128870537757382, 0.16056907897889386, -0.21508995493291164, -0.20765500486845528, 0.11775761372209784, 0.18454831484933756, 0.040974304151429906, -0.12425459745665726, 0.0749958340011457, 0.028612406507985768, 0.16937725933874312, -0.0007628047027470876, 0.07289800643092421, 0.315324817072783, 0.09451337524923993, 0.061501156330177206, 0.062167388674848785, -0.17233097584106805, -0.020733924818288056, -0.24506919113797723, -0.04103580777864743, -0.11310690769531473, 0.04775145767048427, -0.13545154215910107, -0.14189627405507432, 0.3675205570537071, 0.18421628383885316, 0.22952540891039316, 0.08170023491246158, 0.3640036333375182, 0.10918977865777864, 0.119767601946026, 0.033817854098564276, 0.2919803601603932, 0.14945626127436482, 0.04439178436845998, -0.2198501636896945, 0.05967319809454579, -0.04324324387897012]
|
1,803.09411
|
Optimal Design and Control of 4-IWD Electric Vehicles based on a 14-DOF
Vehicle Model
|
A 4-independent wheel driving (4-IWD) electric vehicle has distinctive
advantages with both enhanced dynamic and energy efficiency performances since
this configuration provides more flexibilities from both the design and control
aspects. However, it is difficult to achieve the optimal performances of a
4-IWD electric vehicle with conventional design and control approaches. This
work is dedicated to investigating the vehicular optimal design and control
approaches, with a 4-IWD electric race car aiming at minimizing the lap time on
a given circuit as a case study. A 14-DOF vehicle model that can fully evaluate
the influences of the unsprung mass is developed based on Lagrangian dynamics.
The 14-DOF vehicle model implemented with the reprogrammed Magic Formula tire
model and a time-efficient suspension model supports metric operations and
parallel computing, which can dramatically improve the computational
efficiency. The optimal design and control problems with design parameters of
the motor, transmission, mass center, anti-roll bar and the suspension of the
race car are successively formulated. The formulated problems are subsequently
solved by directly transcribing the original problems into large scale
nonlinear optimization problems based on trapezoidal approach. The influences
of the mounting positions of the propulsion system, the mass and inertia of the
unsprung masses, the anti-roll bars and suspensions on the lap time are
analyzed and compared quantitatively. Some interesting findings that are
different from the `already known facts' are presented.
|
math.OC
|
a 4independent wheel driving 4iwd electric vehicle has distinctive advantages with both enhanced dynamic and energy efficiency performances since this configuration provides more flexibilities from both the design and control aspects however it is difficult to achieve the optimal performances of a 4iwd electric vehicle with conventional design and control approaches this work is dedicated to investigating the vehicular optimal design and control approaches with a 4iwd electric race car aiming at minimizing the lap time on a given circuit as a case study a 14dof vehicle model that can fully evaluate the influences of the unsprung mass is developed based on lagrangian dynamics the 14dof vehicle model implemented with the reprogrammed magic formula tire model and a timeefficient suspension model supports metric operations and parallel computing which can dramatically improve the computational efficiency the optimal design and control problems with design parameters of the motor transmission mass center antiroll bar and the suspension of the race car are successively formulated the formulated problems are subsequently solved by directly transcribing the original problems into large scale nonlinear optimization problems based on trapezoidal approach the influences of the mounting positions of the propulsion system the mass and inertia of the unsprung masses the antiroll bars and suspensions on the lap time are analyzed and compared quantitatively some interesting findings that are different from the already known facts are presented
|
[['a', '4independent', 'wheel', 'driving', '4iwd', 'electric', 'vehicle', 'has', 'distinctive', 'advantages', 'with', 'both', 'enhanced', 'dynamic', 'and', 'energy', 'efficiency', 'performances', 'since', 'this', 'configuration', 'provides', 'more', 'flexibilities', 'from', 'both', 'the', 'design', 'and', 'control', 'aspects', 'however', 'it', 'is', 'difficult', 'to', 'achieve', 'the', 'optimal', 'performances', 'of', 'a', '4iwd', 'electric', 'vehicle', 'with', 'conventional', 'design', 'and', 'control', 'approaches', 'this', 'work', 'is', 'dedicated', 'to', 'investigating', 'the', 'vehicular', 'optimal', 'design', 'and', 'control', 'approaches', 'with', 'a', '4iwd', 'electric', 'race', 'car', 'aiming', 'at', 'minimizing', 'the', 'lap', 'time', 'on', 'a', 'given', 'circuit', 'as', 'a', 'case', 'study', 'a', '14dof', 'vehicle', 'model', 'that', 'can', 'fully', 'evaluate', 'the', 'influences', 'of', 'the', 'unsprung', 'mass', 'is', 'developed', 'based', 'on', 'lagrangian', 'dynamics', 'the', '14dof', 'vehicle', 'model', 'implemented', 'with', 'the', 'reprogrammed', 'magic', 'formula', 'tire', 'model', 'and', 'a', 'timeefficient', 'suspension', 'model', 'supports', 'metric', 'operations', 'and', 'parallel', 'computing', 'which', 'can', 'dramatically', 'improve', 'the', 'computational', 'efficiency', 'the', 'optimal', 'design', 'and', 'control', 'problems', 'with', 'design', 'parameters', 'of', 'the', 'motor', 'transmission', 'mass', 'center', 'antiroll', 'bar', 'and', 'the', 'suspension', 'of', 'the', 'race', 'car', 'are', 'successively', 'formulated', 'the', 'formulated', 'problems', 'are', 'subsequently', 'solved', 'by', 'directly', 'transcribing', 'the', 'original', 'problems', 'into', 'large', 'scale', 'nonlinear', 'optimization', 'problems', 'based', 'on', 'trapezoidal', 'approach', 'the', 'influences', 'of', 'the', 'mounting', 'positions', 'of', 'the', 'propulsion', 'system', 'the', 'mass', 'and', 'inertia', 'of', 'the', 'unsprung', 'masses', 'the', 'antiroll', 'bars', 'and', 'suspensions', 'on', 'the', 'lap', 'time', 'are', 'analyzed', 'and', 'compared', 'quantitatively', 'some', 'interesting', 'findings', 'that', 'are', 'different', 'from', 'the', 'already', 'known', 'facts', 'are', 'presented']]
|
[-0.1172476867894667, 0.07998069129514208, -0.06992899262461703, 0.023740652844155972, -0.07786928414550078, -0.1857590086406812, 0.04244824725589881, 0.3628669418644027, -0.25568486128135454, -0.3539353520110516, 0.12819544890174125, -0.2276378314995132, -0.1493785860324611, 0.22713557995406777, -0.1079415014308844, 0.11055742847072127, 0.07491541698878532, 0.013815799016031503, -0.02708483337132098, -0.21562301631794462, 0.2423323962055812, 0.06820254465856124, 0.318263741438776, 0.053836067729987135, 0.1389997131232771, -0.006545067951914721, 0.00965559969647854, 0.047923385947277505, -0.10047079061229981, 0.1258064304392974, 0.2250986248483449, 0.11859073075314493, 0.26915331018764327, -0.4376608807111292, -0.1837590722924298, 0.05685108884011113, 0.11236835016461555, 0.053007255108241225, -0.044594527554116734, -0.2825507026313322, 0.07444062810915446, -0.164633529657814, -0.10010484034241277, -0.0510911538232384, -0.010471708650584333, 0.0636341561842398, -0.27170488589659464, -0.004708179104324829, 0.011600451310057127, 0.03056188379663841, -0.09038652616852362, -0.11715481744977296, -0.0005565557491666238, 0.1608452987961105, 0.04812081054530738, 0.01237261485117155, 0.19243142474754546, -0.1351481880459622, -0.15070454958913615, 0.4114005975549974, 0.004702565321557424, -0.22345187649729528, 0.18079658455306863, -0.062403953486604484, -0.06983077209484431, 0.10979932638084781, 0.2143417825947316, 0.1132468808271889, -0.15354933029656032, 0.040741093599405885, -0.016281496713937877, 0.15966382440170232, 0.03883458377614651, -0.021777212756985267, 0.1738534684291153, 0.23294540272737713, 0.09335671805560455, 0.12322324053716979, -0.08379009534837678, -0.12508393543456414, -0.22817897882695043, -0.11739233432204596, -0.13072489495139702, -0.016048037822266843, -0.07248850960637096, -0.09649822153940997, 0.39593379600410117, 0.15040296772557277, 0.16172332882030918, 0.06575771662392071, 0.369855370114757, 0.11527400655125218, 0.05894614428767194, 0.08883540079321912, 0.23735590745660115, 0.07942410393983275, 0.13629879054912766, -0.2832950606056589, 0.08909624210459047, 0.04238898738653266]
|
1,803.09412
|
Consensus Control of Multi-agent Systems with Optimal Performance
|
The consensus control with optimal cost remains major challenging although
consensus control problems have been well studied in recent years. In this
paper, we study the consensus control of multi-agent system associated with a
given cost function. The main contribution is to present the distributed
control protocol while minimizing the given cost function with positive
semi-definite weighting matrix of control. The derived controller is composed
of two parts: One part is the feedback of the individual state which minimizes
the cost function and the other part is the feedback of the relative states
between the neighbours which guarantees the consensus. The presented results
are new to the best of our knowledge.
|
math.OC
|
the consensus control with optimal cost remains major challenging although consensus control problems have been well studied in recent years in this paper we study the consensus control of multiagent system associated with a given cost function the main contribution is to present the distributed control protocol while minimizing the given cost function with positive semidefinite weighting matrix of control the derived controller is composed of two parts one part is the feedback of the individual state which minimizes the cost function and the other part is the feedback of the relative states between the neighbours which guarantees the consensus the presented results are new to the best of our knowledge
|
[['the', 'consensus', 'control', 'with', 'optimal', 'cost', 'remains', 'major', 'challenging', 'although', 'consensus', 'control', 'problems', 'have', 'been', 'well', 'studied', 'in', 'recent', 'years', 'in', 'this', 'paper', 'we', 'study', 'the', 'consensus', 'control', 'of', 'multiagent', 'system', 'associated', 'with', 'a', 'given', 'cost', 'function', 'the', 'main', 'contribution', 'is', 'to', 'present', 'the', 'distributed', 'control', 'protocol', 'while', 'minimizing', 'the', 'given', 'cost', 'function', 'with', 'positive', 'semidefinite', 'weighting', 'matrix', 'of', 'control', 'the', 'derived', 'controller', 'is', 'composed', 'of', 'two', 'parts', 'one', 'part', 'is', 'the', 'feedback', 'of', 'the', 'individual', 'state', 'which', 'minimizes', 'the', 'cost', 'function', 'and', 'the', 'other', 'part', 'is', 'the', 'feedback', 'of', 'the', 'relative', 'states', 'between', 'the', 'neighbours', 'which', 'guarantees', 'the', 'consensus', 'the', 'presented', 'results', 'are', 'new', 'to', 'the', 'best', 'of', 'our', 'knowledge']]
|
[-0.16811921941703772, 0.016066886153206363, -0.03601524032451011, -0.01486240037998, -0.05430286588264747, -0.12872550051306952, 0.04563371524915334, 0.3697861194241423, -0.31296308526584693, -0.3377715138349313, 0.1313844570860703, -0.26169864865657577, -0.1492204383982614, 0.13557519274554006, -0.10277819325560117, 0.11370194076585609, 0.04879610546075882, 0.053192356511161804, -0.03140343464113906, -0.29493920055327116, 0.33364983729132963, 0.05132984842366732, 0.269445729790138, 0.03669497453783815, 0.15131211038762787, 0.0026713166666963886, -0.022366319338346388, -0.0031865317403833877, -0.06856993591488414, 0.13741002006924014, 0.2671352164601689, 0.17394121976879737, 0.3825274928733035, -0.3854246729531804, -0.15808832278970192, 0.12655589170753956, 0.10395774009914414, 0.10177855016789525, -0.07756797010330735, -0.23979333033030098, 0.08983453661559972, -0.1580608378307105, -0.07660597557755741, 0.007938615678859924, -0.0031674744829803974, 0.048766050589390715, -0.2692436672545768, 0.05560845547137564, 0.02352083280509776, 0.015705579770141625, -0.10016500155718343, -0.1506087339917399, 0.011070177261088346, 0.2030956656630109, 0.036762468575558684, 0.06035240824745448, 0.14496056619519787, -0.12499126970457534, -0.15787204500992555, 0.34709398945172626, 0.009705793299200433, -0.2076512431119661, 0.1614128855866724, -0.09656772577950547, -0.11411565407137345, 0.10904513904405339, 0.18972461359357243, 0.12530530619158134, -0.18377440042693066, 0.04367559454309427, -0.04292545309038581, 0.1962279163905092, -0.04874746112555668, 0.03992268464922368, 0.12930800725479383, 0.22088548003460978, 0.18337436459186646, 0.15440136335028737, 0.0012610093139841952, -0.18003628655076698, -0.29176103734822423, -0.12122619525856666, -0.20652700948050698, -0.011163607656091519, -0.05341459575372954, -0.1328808980750608, 0.4262900446449314, 0.1174333508940296, 0.18754239483979773, 0.10604627594259475, 0.3555988168327121, 0.16088087740616436, 0.05838578675143622, 0.11080078379595065, 0.2839134111958514, 0.1102675943287207, 0.075944451248139, -0.27531422145228396, 0.15096540638635791, 0.026267818364037854]
|
1,803.09413
|
Precision Sugarcane Monitoring Using SVM Classifier
|
India is agriculture based economy and sugarcane is one of the major crops
produced in northern India. Productivity of sugarcane decreases due to
inappropriate soil conditions and infections caused by various types of
diseases , timely and accurate disease diagnosis, plays an important role
towards optimizing crop yield. This paper presents a system model for
monitoring of sugarcane crop, the proposed model continuously monitor
parameters (temperature, humidity and moisture) responsible for healthy growth
of the crop in addition KNN clustering along with SVM classifier is utilized
for infection identification if any through images obtained at regular
intervals. The data has been transmitted wirelessly from the site to the
control unit. Model achieves an accuracy of 96% on a sample of 200 images, the
model was tested at Lolai, near Malhaur, Gomti Nagar Extension.
|
cs.CV
|
india is agriculture based economy and sugarcane is one of the major crops produced in northern india productivity of sugarcane decreases due to inappropriate soil conditions and infections caused by various types of diseases timely and accurate disease diagnosis plays an important role towards optimizing crop yield this paper presents a system model for monitoring of sugarcane crop the proposed model continuously monitor parameters temperature humidity and moisture responsible for healthy growth of the crop in addition knn clustering along with svm classifier is utilized for infection identification if any through images obtained at regular intervals the data has been transmitted wirelessly from the site to the control unit model achieves an accuracy of 96 on a sample of 200 images the model was tested at lolai near malhaur gomti nagar extension
|
[['india', 'is', 'agriculture', 'based', 'economy', 'and', 'sugarcane', 'is', 'one', 'of', 'the', 'major', 'crops', 'produced', 'in', 'northern', 'india', 'productivity', 'of', 'sugarcane', 'decreases', 'due', 'to', 'inappropriate', 'soil', 'conditions', 'and', 'infections', 'caused', 'by', 'various', 'types', 'of', 'diseases', 'timely', 'and', 'accurate', 'disease', 'diagnosis', 'plays', 'an', 'important', 'role', 'towards', 'optimizing', 'crop', 'yield', 'this', 'paper', 'presents', 'a', 'system', 'model', 'for', 'monitoring', 'of', 'sugarcane', 'crop', 'the', 'proposed', 'model', 'continuously', 'monitor', 'parameters', 'temperature', 'humidity', 'and', 'moisture', 'responsible', 'for', 'healthy', 'growth', 'of', 'the', 'crop', 'in', 'addition', 'knn', 'clustering', 'along', 'with', 'svm', 'classifier', 'is', 'utilized', 'for', 'infection', 'identification', 'if', 'any', 'through', 'images', 'obtained', 'at', 'regular', 'intervals', 'the', 'data', 'has', 'been', 'transmitted', 'wirelessly', 'from', 'the', 'site', 'to', 'the', 'control', 'unit', 'model', 'achieves', 'an', 'accuracy', 'of', '96', 'on', 'a', 'sample', 'of', '200', 'images', 'the', 'model', 'was', 'tested', 'at', 'lolai', 'near', 'malhaur', 'gomti', 'nagar', 'extension']]
|
[-0.06926761844372305, 0.0775699293939848, -0.014099695077238157, 0.031086944345052738, -0.01862771400293812, -0.170117096809396, 0.04922463054057615, 0.3462058711280801, -0.1957523960876459, -0.30693397234201203, 0.15034185220530732, -0.32295593021928454, -0.13437226514490827, 0.2389593515268756, -0.13617981137665697, 0.03248012981687983, 0.08953409930041363, 0.05833720387493859, 0.06911227222560912, -0.27881669519873437, 0.22546718066356095, 0.13447560619043056, 0.3537206904071044, 0.06788593905349803, 0.14240670659445775, 0.01927615834879256, -0.05092489681127228, -0.04035368677257568, -0.062026937704717434, 0.10448890144019857, 0.33006615263532646, 0.17157770593852786, 0.33973691248616505, -0.3900782414817485, -0.24392447539229783, 0.13165731429187363, 0.11180617422896055, 0.044491890242121135, -0.024576495304999713, -0.2763125272684319, 0.06306495977377938, -0.16237909142505522, -0.14140703398084573, -0.01402730543830598, 0.0048877154097914, -0.024689223190910336, -0.29856440700345144, 0.09488104951257507, -0.03065936806090104, 0.16816708230406277, -0.11977935277734154, -0.1138644855489319, -0.09572973548950874, 0.1961060497411635, 0.07171242901254012, 0.07278656914772451, 0.21027585444069474, -0.13319428276826534, -0.08193304877035147, 0.342818328747959, -0.03705002682630059, -0.11404801047381823, 0.1729192860224176, -0.06455365302358833, -0.11435579355127475, 0.15806276645410314, 0.2509933164002114, 0.05961624359668687, -0.21635808934666967, -0.016227681921206615, 0.03501809272525269, 0.17140100326555124, 0.08879516221936648, -0.06538231658222254, 0.2069677161359654, 0.2701612627350314, 0.049928561961206125, 0.13944080881025397, -0.17414670455442785, -0.024265854797224956, -0.17678513438097931, -0.15119079566213695, -0.1031972240483345, -0.021092091101788474, -0.10939714384342854, -0.13704748882717172, 0.42029628903395677, 0.18583091674372554, 0.11881667924250743, 0.013037716154037982, 0.2765302732514665, 0.009957272090133308, 0.100663587802032, 0.05773047171533108, 0.18584446429975274, 0.046659996062778875, 0.1491089796890187, -0.19770234718723873, 0.21002271362443187, 0.030411188277711932]
|
1,803.09414
|
Development of high-speed X-ray imaging system for SOI pixel detector
|
We are now developing new X-ray imaging system by using Silicon-On-Insulator
(SOI) Pixel Detectors. The SOI detector is a monolithic radiation imaging
detector based on a 0.2um FD-SOI CMOS process. Special additional process steps
are also developed to create fully depleted sensing region of 50~500um thick.
SOI detector has up to mega pixels, so development of high speed Data
Acquisition (DAQ) system is very important in conducting experiments. We have
developed readout board named SEABAS2 (Soi EvAluation BoArd with Sitcp 2) for
SOI detector. The SEABAS2 board has 16 channels of 65 MSPS ADCs, 4ch DAC, FPGAs
and Gigabit Ethernet I/F. To achieve high throughput of the DAQ, we
aggressively adopt parallel processing (data taking and storing) and implement
FIFO buffers in software. DAQ throughput in previous DAQ system was 6 Hz (41
Mbps) for INTPIX4 detector which has 423 kpixels of 17 um square. With newly
developed system, we could improve this rate to 90 Hz (613 Mbps). To take X-ray
images for practical purpose such as 3D CT, user have to control the peripheral
devices (moving stage, beam shutter, monitoring devices etc.) while taking
images. To ease such data taking, we also implemented automatic control
function of peripheral devices. Introduction of SOI detectors, the detail of
the DAQ system and experimental results are presented.
|
physics.ins-det
|
we are now developing new xray imaging system by using silicononinsulator soi pixel detectors the soi detector is a monolithic radiation imaging detector based on a 02um fdsoi cmos process special additional process steps are also developed to create fully depleted sensing region of 50500um thick soi detector has up to mega pixels so development of high speed data acquisition daq system is very important in conducting experiments we have developed readout board named seabas2 soi evaluation board with sitcp 2 for soi detector the seabas2 board has 16 channels of 65 msps adcs 4ch dac fpgas and gigabit ethernet if to achieve high throughput of the daq we aggressively adopt parallel processing data taking and storing and implement fifo buffers in software daq throughput in previous daq system was 6 hz 41 mbps for intpix4 detector which has 423 kpixels of 17 um square with newly developed system we could improve this rate to 90 hz 613 mbps to take xray images for practical purpose such as 3d ct user have to control the peripheral devices moving stage beam shutter monitoring devices etc while taking images to ease such data taking we also implemented automatic control function of peripheral devices introduction of soi detectors the detail of the daq system and experimental results are presented
|
[['we', 'are', 'now', 'developing', 'new', 'xray', 'imaging', 'system', 'by', 'using', 'silicononinsulator', 'soi', 'pixel', 'detectors', 'the', 'soi', 'detector', 'is', 'a', 'monolithic', 'radiation', 'imaging', 'detector', 'based', 'on', 'a', '02um', 'fdsoi', 'cmos', 'process', 'special', 'additional', 'process', 'steps', 'are', 'also', 'developed', 'to', 'create', 'fully', 'depleted', 'sensing', 'region', 'of', '50500um', 'thick', 'soi', 'detector', 'has', 'up', 'to', 'mega', 'pixels', 'so', 'development', 'of', 'high', 'speed', 'data', 'acquisition', 'daq', 'system', 'is', 'very', 'important', 'in', 'conducting', 'experiments', 'we', 'have', 'developed', 'readout', 'board', 'named', 'seabas2', 'soi', 'evaluation', 'board', 'with', 'sitcp', '2', 'for', 'soi', 'detector', 'the', 'seabas2', 'board', 'has', '16', 'channels', 'of', '65', 'msps', 'adcs', '4ch', 'dac', 'fpgas', 'and', 'gigabit', 'ethernet', 'if', 'to', 'achieve', 'high', 'throughput', 'of', 'the', 'daq', 'we', 'aggressively', 'adopt', 'parallel', 'processing', 'data', 'taking', 'and', 'storing', 'and', 'implement', 'fifo', 'buffers', 'in', 'software', 'daq', 'throughput', 'in', 'previous', 'daq', 'system', 'was', '6', 'hz', '41', 'mbps', 'for', 'intpix4', 'detector', 'which', 'has', '423', 'kpixels', 'of', '17', 'um', 'square', 'with', 'newly', 'developed', 'system', 'we', 'could', 'improve', 'this', 'rate', 'to', '90', 'hz', '613', 'mbps', 'to', 'take', 'xray', 'images', 'for', 'practical', 'purpose', 'such', 'as', '3d', 'ct', 'user', 'have', 'to', 'control', 'the', 'peripheral', 'devices', 'moving', 'stage', 'beam', 'shutter', 'monitoring', 'devices', 'etc', 'while', 'taking', 'images', 'to', 'ease', 'such', 'data', 'taking', 'we', 'also', 'implemented', 'automatic', 'control', 'function', 'of', 'peripheral', 'devices', 'introduction', 'of', 'soi', 'detectors', 'the', 'detail', 'of', 'the', 'daq', 'system', 'and', 'experimental', 'results', 'are', 'presented']]
|
[-0.13425023104729397, 0.07236228035208547, -0.0049186713816154574, -0.03737478066071898, -0.05675772740062149, -0.2522950806433246, 0.015399892992267962, 0.47279664391563053, -0.19636391901350136, -0.38994997644885665, 0.14643227775481396, -0.3141940023195708, -0.05978117731033957, 0.2591410541784994, -0.10313128100699812, 0.11818792516631739, 0.13113486565638421, -0.04934634491246903, -0.027409223406270722, -0.25316121949636866, 0.1689473133024183, 0.1597159909450316, 0.32401625733556494, 0.007470265158086217, 0.1646618280520973, -0.011770566784599352, -0.003650549231540589, -0.0857112883922777, -0.06498003523530704, 0.06953939068244792, 0.32486273880183164, 0.11555409483788978, 0.2194623694489045, -0.4831376111090538, -0.14792049137343252, -0.0146407889002668, 0.14714184717602274, -0.004611957742322591, -0.09227358161498116, -0.31911802225790564, 0.14722202570133266, -0.24353143204824024, -0.04267662909371124, -0.0020958693077166874, -0.009587656673310059, 0.00979580399996069, -0.23064700068928123, -0.05735592849391867, 0.0004207203452963205, 0.09219927633946229, -0.052695430249011785, -0.102553139251679, 0.031673230500780934, 0.12485489369636135, -0.07729336692746507, 0.04638422882361781, 0.22630324508285238, -0.07031672985315146, -0.10355034517456911, 0.281711629784799, 0.001619418474313404, -0.12366611074124063, 0.16395813929682065, -0.15436045314362717, -0.08155656327088807, 0.18220342025216224, 0.22462129160495742, 0.018327347465258624, -0.23883660370650303, 0.05384404174429143, 0.08733876368607439, 0.24756237198321504, 0.07596056951387298, 0.07806001705272744, 0.15169832930190577, 0.3250924935453527, 0.05549531599196295, 0.14412160988542297, -0.2529665508717742, -0.006164660476635964, -0.2330607674040255, -0.17779435231572105, -0.15470137935841366, 0.00352308391039038, -0.030415569923518758, -0.10375423673540354, 0.35697055420439155, 0.17654201701017364, 0.0779117465529236, 0.008994211332451197, 0.3882356506727991, 0.0727481912705116, 0.20589586591231637, 0.04893363000425909, 0.24559761545665207, 0.0856912341656252, 0.21296225395829727, -0.13370088706502603, 0.0010178793831506655, -0.029515821667016662]
|
1,803.09415
|
First-principles study of magnetic interactions in FeGe
|
We theoretically study the magnetic properties of iron germanium, known as
one of canonical helimagnets. For this purpose we use the real-space spin
Hamiltonian and micromagnetic model, derived in terms of Andersen's "local
force theorem", to describe the low-lying magnetic excitations via
spin-polarized Green's function, obtained from the first-principles
calculations. The model was designed to numerically evaluate the spin stiffness
constant in reciprocal space, in order for assessment of the contributing
itinerant mechanisms. The calculated pairwise exchange interactions reveal the
essentiality of Ruderman-Kittel-Kasuya-Yoshida coupling in FeGe. Thus provided
mean-field estimation of magnetic transition temperature agrees good with the
experimental measurement, underlining the necessity of the comprehensive
real/reciprocal space-based approach for a proper description of magnetic
excitations in FeGe.
|
cond-mat.str-el cond-mat.mtrl-sci physics.comp-ph
|
we theoretically study the magnetic properties of iron germanium known as one of canonical helimagnets for this purpose we use the realspace spin hamiltonian and micromagnetic model derived in terms of andersens local force theorem to describe the lowlying magnetic excitations via spinpolarized greens function obtained from the firstprinciples calculations the model was designed to numerically evaluate the spin stiffness constant in reciprocal space in order for assessment of the contributing itinerant mechanisms the calculated pairwise exchange interactions reveal the essentiality of rudermankittelkasuyayoshida coupling in fege thus provided meanfield estimation of magnetic transition temperature agrees good with the experimental measurement underlining the necessity of the comprehensive realreciprocal spacebased approach for a proper description of magnetic excitations in fege
|
[['we', 'theoretically', 'study', 'the', 'magnetic', 'properties', 'of', 'iron', 'germanium', 'known', 'as', 'one', 'of', 'canonical', 'helimagnets', 'for', 'this', 'purpose', 'we', 'use', 'the', 'realspace', 'spin', 'hamiltonian', 'and', 'micromagnetic', 'model', 'derived', 'in', 'terms', 'of', 'andersens', 'local', 'force', 'theorem', 'to', 'describe', 'the', 'lowlying', 'magnetic', 'excitations', 'via', 'spinpolarized', 'greens', 'function', 'obtained', 'from', 'the', 'firstprinciples', 'calculations', 'the', 'model', 'was', 'designed', 'to', 'numerically', 'evaluate', 'the', 'spin', 'stiffness', 'constant', 'in', 'reciprocal', 'space', 'in', 'order', 'for', 'assessment', 'of', 'the', 'contributing', 'itinerant', 'mechanisms', 'the', 'calculated', 'pairwise', 'exchange', 'interactions', 'reveal', 'the', 'essentiality', 'of', 'rudermankittelkasuyayoshida', 'coupling', 'in', 'fege', 'thus', 'provided', 'meanfield', 'estimation', 'of', 'magnetic', 'transition', 'temperature', 'agrees', 'good', 'with', 'the', 'experimental', 'measurement', 'underlining', 'the', 'necessity', 'of', 'the', 'comprehensive', 'realreciprocal', 'spacebased', 'approach', 'for', 'a', 'proper', 'description', 'of', 'magnetic', 'excitations', 'in', 'fege']]
|
[-0.14407305730755665, 0.14560522687428729, -0.035012001142102483, 0.08439672367992522, -0.04463653887043996, -0.06418880821077218, 0.055127825178527115, 0.37112904556802123, -0.22958545740452949, -0.30670761870991053, -0.05834326741851641, -0.2932903572098063, -0.13490775057339463, 0.1782606667618203, 0.10077265243784621, 0.04173125944437523, -0.00633409202243362, 0.0038644610041078053, -0.11746261402129612, -0.16028830699003171, 0.2661143075915632, 0.04531261412796147, 0.30219521295632523, 0.10151635426706795, 0.06367125307964482, 0.06539619164260362, 0.051653337456157494, 0.021759283536210143, -0.2074061364401132, 0.0850791288399266, 0.24028963294956063, -0.04758390515304074, 0.18326984385253284, -0.46908022338074856, -0.20437193299836381, 0.013916854223774361, 0.12955505431404915, 0.14217747158595714, -0.04655912275534477, -0.2922024964114073, 0.041570797524337684, -0.17132997023672314, -0.1775250305453765, -0.18753286689551996, -0.05376695740189211, 0.017750354838991088, -0.261938793941979, 0.11179624568743246, 0.026910076704647005, 0.11738858715743218, -0.1603494083432577, -0.10792496483893423, -0.06148928222407041, 0.0987652579667689, 0.05750569688951083, 0.04845806178917851, 0.14122233367203896, -0.10719143342298751, -0.13463801046399848, 0.36114983039041015, -0.06672505717142485, -0.1320784494616011, 0.11820704180241466, -0.1596580833830903, -0.10654010789886374, 0.1238328200676639, 0.09992601414279338, 0.10598910758111241, -0.17350152642305555, 0.094895871981862, -0.00761834507961637, 0.14245096949563393, -0.012432920238693598, 0.05333909532055259, 0.2121220887197053, 0.2036549718408235, -0.014252221869637965, 0.1438917789792899, -0.11150252840738616, -0.09799650156517224, -0.2610478562720377, -0.13395704348884716, -0.2540427613421343, 0.05007646137904697, -0.08925070622843059, -0.19503926291885176, 0.4127221661740272, 0.18452384234968058, 0.12237766247788637, -0.021515522657989943, 0.3078845785007459, 0.08383706502981708, 0.05481875296240544, -0.009197010863411787, 0.29292413139523105, 0.23744744146122307, 0.06532966178352141, -0.33465267885436206, 0.06279518515883206, 0.08052290339175419]
|
1,803.09416
|
Induced nets and Hamiltonicity of claw-free graphs
|
The connected graph of degree sequence 3,3,3,1,1,1 is called a net, and the
vertices of degree 1 in a net is called its endvertices. Broersma conjectured
in 1993 that a 2-connected graph G with no induced K_{1,3} is hamiltonian if
every endvertex of each induced net of G has degree at least (|V(G)|-2)/3. In
this paper we prove this conjecture in the affirmative.
|
math.CO
|
the connected graph of degree sequence 333111 is called a net and the vertices of degree 1 in a net is called its endvertices broersma conjectured in 1993 that a 2connected graph g with no induced k_13 is hamiltonian if every endvertex of each induced net of g has degree at least vg23 in this paper we prove this conjecture in the affirmative
|
[['the', 'connected', 'graph', 'of', 'degree', 'sequence', '333111', 'is', 'called', 'a', 'net', 'and', 'the', 'vertices', 'of', 'degree', '1', 'in', 'a', 'net', 'is', 'called', 'its', 'endvertices', 'broersma', 'conjectured', 'in', '1993', 'that', 'a', '2connected', 'graph', 'g', 'with', 'no', 'induced', 'k_13', 'is', 'hamiltonian', 'if', 'every', 'endvertex', 'of', 'each', 'induced', 'net', 'of', 'g', 'has', 'degree', 'at', 'least', 'vg23', 'in', 'this', 'paper', 'we', 'prove', 'this', 'conjecture', 'in', 'the', 'affirmative']]
|
[-0.23321594261243694, 0.1463533967702848, -0.06009235655217141, -0.035953953944253506, -0.07962331726963891, -0.13084335057217567, -0.005538357066784481, 0.388156561333625, -0.27350371721826616, -0.2753487766766157, 0.016906081485088733, -0.3323547064792365, -0.20655486542544496, 0.04177728386931732, -0.15050288686742547, -0.09239464968378029, 0.12125490289792175, 0.1621895256207981, 0.061500280061126, -0.2784958074344551, 0.2767010804983314, -0.06009338319408478, 0.1346068968881899, 0.14572524432031836, 0.1902604275764745, 0.042282394041902704, 0.03784624995572156, 0.09782917550230613, -0.16432128807390967, 0.08545945988601593, 0.2094039063686963, 0.137700798154091, 0.29842346783757945, -0.334777019159834, -0.14180249635695066, 0.28181287812996564, 0.06796596411493469, 0.03038214090600854, 0.008525393013918742, -0.16301710174617465, 0.1948144952842935, -0.1450316810941793, -0.13686214039315941, 0.06311946660642832, 0.1466045275055727, -0.039287915636525776, -0.280524439331083, -0.005006686524778116, 0.19890838751538856, 0.10093441683432607, 0.10609170722538513, -0.1283240111117236, -0.153530467599325, 0.06539553473321874, -0.06688075173325593, 0.18647432050163873, -0.04156463150580063, -0.1315715359905582, -0.19259816637171095, 0.33106448428827473, -0.06080839006214968, -0.12260174768839459, 0.08753571757039086, -0.13450778241376163, -0.21799131136265446, 0.11091766714072618, 0.09748628210719125, 0.17054133443925223, -0.08667665878768827, 0.17032697313507164, -0.15233174848874084, 0.11803658966158258, 0.153384720402785, -0.055180945557725354, 0.1268815965597808, 0.13535604861442793, 0.186366494638143, 0.17332169056305144, 0.01615317788768987, 0.08877343078311838, -0.29152050076174685, -0.13845551656711785, -0.27716753543278233, 0.1154037473845433, -0.11411314186631495, -0.1551139953805775, 0.46084619563866835, 0.08700788560033333, 0.1831854646109411, 0.0701425638599474, 0.22720409006063566, 0.09778640403213804, 0.06052255870957599, 0.22148966044950924, 0.14164102454593436, 0.20236315022482246, -0.06574197707422932, -0.1586389365056377, 0.09401577852330491, 0.167643237042195]
|
1,803.09417
|
Periodic Anderson model meets Sachdev-Ye-Kitaev interaction: A solvable
playground for heavy fermion physics
|
The periodic Anderson model is a classic theoretical model for understanding
novel physics in heavy fermion systems. Here, we modify it with the
Sachdev-Ye-Kitaev interaction, (random all-to-all interaction) thus the
resultant model admits an exact solution at large-$N$ (e.g. spin flavor) limit.
By analytical field theory arguments and numerical calculations, we establish
that the system supports a low-temperature (heavy) Fermi liquid and more
interesting a non-Fermi liquid solution at elevated temperature/energy. For
physical observable, the latter one contributes a sharp peak at Fermi energy
for spectral function, a non-Fermi liquid-like $T^{-1}$ resistivity and shows a
robust Fano lineshape in tunneling spectrum. This system may be simulated by
ultracold atom gases and can serve as a good playground for studying many
ubiquitous symmetry-breaking instabilities like unconventional
superconductivity or topological orders in generic heavy fermion systems.
|
cond-mat.str-el cond-mat.quant-gas
|
the periodic anderson model is a classic theoretical model for understanding novel physics in heavy fermion systems here we modify it with the sachdevyekitaev interaction random alltoall interaction thus the resultant model admits an exact solution at largen eg spin flavor limit by analytical field theory arguments and numerical calculations we establish that the system supports a lowtemperature heavy fermi liquid and more interesting a nonfermi liquid solution at elevated temperatureenergy for physical observable the latter one contributes a sharp peak at fermi energy for spectral function a nonfermi liquidlike t1 resistivity and shows a robust fano lineshape in tunneling spectrum this system may be simulated by ultracold atom gases and can serve as a good playground for studying many ubiquitous symmetrybreaking instabilities like unconventional superconductivity or topological orders in generic heavy fermion systems
|
[['the', 'periodic', 'anderson', 'model', 'is', 'a', 'classic', 'theoretical', 'model', 'for', 'understanding', 'novel', 'physics', 'in', 'heavy', 'fermion', 'systems', 'here', 'we', 'modify', 'it', 'with', 'the', 'sachdevyekitaev', 'interaction', 'random', 'alltoall', 'interaction', 'thus', 'the', 'resultant', 'model', 'admits', 'an', 'exact', 'solution', 'at', 'largen', 'eg', 'spin', 'flavor', 'limit', 'by', 'analytical', 'field', 'theory', 'arguments', 'and', 'numerical', 'calculations', 'we', 'establish', 'that', 'the', 'system', 'supports', 'a', 'lowtemperature', 'heavy', 'fermi', 'liquid', 'and', 'more', 'interesting', 'a', 'nonfermi', 'liquid', 'solution', 'at', 'elevated', 'temperatureenergy', 'for', 'physical', 'observable', 'the', 'latter', 'one', 'contributes', 'a', 'sharp', 'peak', 'at', 'fermi', 'energy', 'for', 'spectral', 'function', 'a', 'nonfermi', 'liquidlike', 't1', 'resistivity', 'and', 'shows', 'a', 'robust', 'fano', 'lineshape', 'in', 'tunneling', 'spectrum', 'this', 'system', 'may', 'be', 'simulated', 'by', 'ultracold', 'atom', 'gases', 'and', 'can', 'serve', 'as', 'a', 'good', 'playground', 'for', 'studying', 'many', 'ubiquitous', 'symmetrybreaking', 'instabilities', 'like', 'unconventional', 'superconductivity', 'or', 'topological', 'orders', 'in', 'generic', 'heavy', 'fermion', 'systems']]
|
[-0.1622556766865205, 0.21895966979506887, -0.11389576736837626, 0.14498957776144814, -0.0197315755884038, -0.2718411963050768, 0.08076519647060629, 0.31453468905650633, -0.21925722111238918, -0.2617051745834413, -0.002316002942510505, -0.3238889529793732, -0.1488939122967561, 0.1850467504665895, 0.03663915443692857, 0.06511697423324656, -0.008628240671815045, -0.018940619439748462, -0.10323807487173924, -0.16488648360984318, 0.2848266686848017, 0.03677809537291082, 0.2831165691344206, 0.11131956246890017, 0.020107558243838485, 0.017254017505433355, 0.11492076441784625, -0.0010603919152670832, -0.12007199287260996, 0.021688904096337676, 0.27331653408403855, -0.07071238301638792, 0.17890259694419244, -0.4296048954824236, -0.25689924082722265, 0.04489521756629223, 0.1722626410959655, 0.1533635185002836, -0.10253744187937275, -0.2861862340212257, -0.0025208377046510577, -0.2042119888251703, -0.21566451541078624, -0.16259826179211542, -0.027943383439256352, -0.057583865101897475, -0.26539330298616204, 0.10729489403206911, 0.0465325107415721, 0.07873912392406326, -0.060941314499793967, -0.0897677781880458, 0.003180589065574276, 0.009762985372929764, 0.034561778122468835, 0.040060770361677316, 0.14641174462748996, -0.1632952603091027, -0.1113327488654168, 0.380710809088465, -0.09522283787547207, -0.10028902029118208, 0.24838641339412598, -0.13882380261072028, -0.13176756278514418, 0.17538053583468435, 0.12379195685706922, 0.04764609603183483, -0.14095156400033565, 0.10630438958968856, -0.0760744435420788, 0.15097898511136118, -0.009108775934732673, 0.08450067083267912, 0.3126374129032188, 0.23828228429627063, 0.04242727466912787, 0.10284733184901719, -0.03527152825515272, -0.0955286166411755, -0.2713477808718027, -0.15332540233685538, -0.19774512745919567, 0.07956195518603798, -0.0967809696566251, -0.18263709385281623, 0.40422058404325995, 0.1453255396901018, 0.1725851756298164, -0.04138886543866525, 0.2515531529137281, 0.13200005110433158, 0.008144618342144054, 0.05471313914584705, 0.19615187024551708, 0.12177063648870437, 0.1147587487974496, -0.2882574093771348, 0.02923511220628757, 0.08917002895596757]
|
1,803.09418
|
$(\sigma,\tau)$-Derivations of Group Rings
|
We study $(\sigma,\tau)$-derivations of a group ring $RG$ of a finite group
$G$ over an integral domain $R$ with $1$. As an application we extend a well
known result on derivation of an integral group ring $\Bbb{Z}G$ to
$(\sigma,\tau)$-derivation on it for a finite group $G$ with some conditions on
$\sigma$ and $\tau$. In the process of the extension, a generalization of an
application of Skolem-Noether Theorem to derivation on a finite dimensional
central simple algebra has also been given for the $(\sigma,\tau)$-derivation
case.
|
math.RA
|
we study sigmatauderivations of a group ring rg of a finite group g over an integral domain r with 1 as an application we extend a well known result on derivation of an integral group ring bbbzg to sigmatauderivation on it for a finite group g with some conditions on sigma and tau in the process of the extension a generalization of an application of skolemnoether theorem to derivation on a finite dimensional central simple algebra has also been given for the sigmatauderivation case
|
[['we', 'study', 'sigmatauderivations', 'of', 'a', 'group', 'ring', 'rg', 'of', 'a', 'finite', 'group', 'g', 'over', 'an', 'integral', 'domain', 'r', 'with', '1', 'as', 'an', 'application', 'we', 'extend', 'a', 'well', 'known', 'result', 'on', 'derivation', 'of', 'an', 'integral', 'group', 'ring', 'bbbzg', 'to', 'sigmatauderivation', 'on', 'it', 'for', 'a', 'finite', 'group', 'g', 'with', 'some', 'conditions', 'on', 'sigma', 'and', 'tau', 'in', 'the', 'process', 'of', 'the', 'extension', 'a', 'generalization', 'of', 'an', 'application', 'of', 'skolemnoether', 'theorem', 'to', 'derivation', 'on', 'a', 'finite', 'dimensional', 'central', 'simple', 'algebra', 'has', 'also', 'been', 'given', 'for', 'the', 'sigmatauderivation', 'case']]
|
[-0.14872996898640584, 0.007588277361497692, -0.13484281956831493, -0.00974853860030058, -0.10219237553353262, -0.07404293484486095, 0.018675365016750264, 0.3689745890385494, -0.28052192635652495, -0.2040569523076822, 0.1617282183043, -0.23186749281225408, -0.10990862816958348, 0.252346818539791, -0.10030790851962548, -0.05838912520444066, 0.01496260370150572, 0.16317492294147973, -0.08121062193929059, -0.22324681989621462, 0.32871599635109305, 0.00754976038616605, 0.18304702234113726, 0.048804849959773626, 0.12861716767159723, 0.06819983959061707, -0.026891217124080512, 0.03690553731398612, -0.16508950954643872, 0.06936726228493016, 0.21303115693125418, 0.039339906635421626, 0.25520617746543595, -0.3516492403634801, -0.19304168790510698, 0.1289224751228353, 0.13575886082040464, 0.038786837649418086, -0.06844338450563799, -0.25840824258956696, 0.13135779480926874, -0.26223713604778776, -0.15841886931576016, -0.018730793273212705, 0.11636574372717338, -0.03331355035316381, -0.2816804581571643, -0.014150483059915488, 0.09810842411371129, 0.1373936830937831, -0.041796620026594254, -0.1008984846596765, 0.03174386260656231, 0.08176838483366115, -0.01919347251142182, 0.05690288108989324, 0.06960523420399646, -0.09674048421610922, -0.10386211191099591, 0.378556649904789, -0.12048416012307493, -0.20734362658567546, 0.18822838203618075, -0.14289118256419897, -0.16576805685805837, 0.0734117522767586, 0.1285075051028554, 0.17453009603408778, -0.07939162338152528, 0.18392577005774577, -0.16176268503796765, 0.10424951852367419, 0.015993731471187458, -0.02226267234853855, 0.11372507495873767, 0.16734054196830384, 0.13375074166780418, 0.13285698690565256, 0.010200337188818106, -0.00792279075717599, -0.40180704869875095, -0.2032585663312092, -0.18597264758243068, 0.12011665365624628, -0.10422292586239254, -0.1783267131824864, 0.39064157665593596, 0.061630705771144344, 0.18447742612305573, 0.07621056052697141, 0.19727559664809122, 0.13820353036649843, 0.08575975183942695, 0.05001069802972602, 0.07093126346852642, 0.24136989213889692, -0.027084906797049703, -0.1871715267430196, -0.06680200020669073, 0.15663539963524517]
|
1,803.09419
|
Structural characterization of linear quantum systems with application
to back-action evading measurement
|
The purpose of this paper is to study the structure of quantum linear systems
in terms of their Kalman canonical form, which was proposed in a recent paper
\cite{ZGPG18}. The spectral structure of quantum linear systems is explored,
which indicates that a quantum linear system is both controllable and
observable provided that it is Hurwitz stable. A new parameterization method
for quantum linear systems is proposed. This parameterization is designed for
the Kalman canonical form directly. Consequently, the parameters involved are
in a blockwise form in correspondence with the blockwise structure of the
Kalman canonical form. This parameter structure can be used to simplify various
quantum control design problems. For example, necessary and sufficient
conditions for the realization of quantum back-action evading (BAE)
measurements are given in terms of these new parameters. Due to their blockwise
nature, a small number of parameters are required for realizing quantum BAE
measurements.
|
quant-ph
|
the purpose of this paper is to study the structure of quantum linear systems in terms of their kalman canonical form which was proposed in a recent paper citezgpg18 the spectral structure of quantum linear systems is explored which indicates that a quantum linear system is both controllable and observable provided that it is hurwitz stable a new parameterization method for quantum linear systems is proposed this parameterization is designed for the kalman canonical form directly consequently the parameters involved are in a blockwise form in correspondence with the blockwise structure of the kalman canonical form this parameter structure can be used to simplify various quantum control design problems for example necessary and sufficient conditions for the realization of quantum backaction evading bae measurements are given in terms of these new parameters due to their blockwise nature a small number of parameters are required for realizing quantum bae measurements
|
[['the', 'purpose', 'of', 'this', 'paper', 'is', 'to', 'study', 'the', 'structure', 'of', 'quantum', 'linear', 'systems', 'in', 'terms', 'of', 'their', 'kalman', 'canonical', 'form', 'which', 'was', 'proposed', 'in', 'a', 'recent', 'paper', 'citezgpg18', 'the', 'spectral', 'structure', 'of', 'quantum', 'linear', 'systems', 'is', 'explored', 'which', 'indicates', 'that', 'a', 'quantum', 'linear', 'system', 'is', 'both', 'controllable', 'and', 'observable', 'provided', 'that', 'it', 'is', 'hurwitz', 'stable', 'a', 'new', 'parameterization', 'method', 'for', 'quantum', 'linear', 'systems', 'is', 'proposed', 'this', 'parameterization', 'is', 'designed', 'for', 'the', 'kalman', 'canonical', 'form', 'directly', 'consequently', 'the', 'parameters', 'involved', 'are', 'in', 'a', 'blockwise', 'form', 'in', 'correspondence', 'with', 'the', 'blockwise', 'structure', 'of', 'the', 'kalman', 'canonical', 'form', 'this', 'parameter', 'structure', 'can', 'be', 'used', 'to', 'simplify', 'various', 'quantum', 'control', 'design', 'problems', 'for', 'example', 'necessary', 'and', 'sufficient', 'conditions', 'for', 'the', 'realization', 'of', 'quantum', 'backaction', 'evading', 'bae', 'measurements', 'are', 'given', 'in', 'terms', 'of', 'these', 'new', 'parameters', 'due', 'to', 'their', 'blockwise', 'nature', 'a', 'small', 'number', 'of', 'parameters', 'are', 'required', 'for', 'realizing', 'quantum', 'bae', 'measurements']]
|
[-0.13604740603556353, 0.1132404318872235, -0.08287924940924386, 0.028424502557263132, -0.08731008387592344, -0.1525317313136986, -0.019723242581381487, 0.32971705498828274, -0.28677854943089187, -0.2783801153339949, 0.10215040692914831, -0.18055896511981012, -0.21619065376502034, 0.2426809716617336, -0.06981636251549463, 0.14955948016958664, 0.055859151154731376, 0.019442888261511217, -0.09578739870748659, -0.24667218616043493, 0.3007926834602463, 0.09139893844965971, 0.26710292766723354, -0.006335579299342794, 0.11493716449577068, -0.005938740151405737, 0.008287137677905627, 0.017445882697388327, -0.11529319676481316, 0.14605822025662968, 0.2785822160390986, 0.11772172491544404, 0.259662603940563, -0.38870719815226823, -0.19620083911168212, 0.11712386243271868, 0.10953147889734749, 0.13790923771542823, -0.044494463750664646, -0.26594815252827025, 0.11284115480550493, -0.16146907362319227, -0.10170158322246091, -0.12928528486549654, -0.02731352580225133, -0.003996870687350983, -0.30254064890637844, 0.05408849652441269, 0.08527508796494757, 0.038001508061849584, -0.030759749443245096, -0.06919472288840602, 0.038407260733750975, 0.09747370438197174, -0.059100045131148166, -0.028467472065303073, 0.10458721786208854, -0.12818363634712138, -0.11483540958599062, 0.3823852117450253, -0.015264575972184035, -0.2326191389788496, 0.152219903120469, -0.06311996679633504, -0.13359573598309243, 0.08354732259239599, 0.1652670073121585, 0.10584121177640013, -0.18048937385429856, 0.11918297268031794, -0.042646028151786, 0.1602023700834252, 0.019392721904001223, 0.07903866207453648, 0.18112863066002122, 0.13179285974065597, 0.08423267349929586, 0.1416905158525018, -0.04746728331932949, -0.14992985119288033, -0.31738871052810874, -0.18489322224254343, -0.18541242693223664, 0.02606954470723616, -0.06204424838585043, -0.1634701364752333, 0.3933256751970967, 0.14060546977860802, 0.20809941228504317, 0.012574448281697728, 0.2897400126691807, 0.16658706811132426, 0.05979392220064796, 0.036325492984237706, 0.23576847144176025, 0.1954754815134849, 0.05594233830217146, -0.2455668723198107, 0.07460179129565084, 0.07092206184815213]
|
1,803.0942
|
Multi-scale Processing of Noisy Images using Edge Preservation Losses
|
Noisy images processing is a fundamental task of computer vision. The first
example is the detection of faint edges in noisy images, a challenging problem
studied in the last decades. A recent study introduced a fast method to detect
faint edges in the highest accuracy among all the existing approaches. Their
complexity is nearly linear in the image's pixels and their runtime is seconds
for a noisy image. Their approach utilizes a multi-scale binary partitioning of
the image. By utilizing the multi-scale U-net architecture, we show in this
paper that their method can be dramatically improved in both aspects of run
time and accuracy. By training the network on a dataset of binary images, we
developed an approach for faint edge detection that works in a linear
complexity. Our runtime of a noisy image is milliseconds on a GPU. Even though
our method is orders of magnitude faster, we still achieve higher accuracy of
detection under many challenging scenarios. In addition, we show that our
approach to performing multi-scale preprocessing of noisy images using U-net
improves the ability to perform other vision tasks under the presence of noise.
We prove it on the problems of noisy objects classification and classical image
denoising. We show that multi-scale denoising can be carried out by a novel
edge preservation loss. As our experiments show, we achieve high-quality
results in the three aspects of faint edge detection, noisy image
classification and natural image denoising.
|
cs.CV
|
noisy images processing is a fundamental task of computer vision the first example is the detection of faint edges in noisy images a challenging problem studied in the last decades a recent study introduced a fast method to detect faint edges in the highest accuracy among all the existing approaches their complexity is nearly linear in the images pixels and their runtime is seconds for a noisy image their approach utilizes a multiscale binary partitioning of the image by utilizing the multiscale unet architecture we show in this paper that their method can be dramatically improved in both aspects of run time and accuracy by training the network on a dataset of binary images we developed an approach for faint edge detection that works in a linear complexity our runtime of a noisy image is milliseconds on a gpu even though our method is orders of magnitude faster we still achieve higher accuracy of detection under many challenging scenarios in addition we show that our approach to performing multiscale preprocessing of noisy images using unet improves the ability to perform other vision tasks under the presence of noise we prove it on the problems of noisy objects classification and classical image denoising we show that multiscale denoising can be carried out by a novel edge preservation loss as our experiments show we achieve highquality results in the three aspects of faint edge detection noisy image classification and natural image denoising
|
[['noisy', 'images', 'processing', 'is', 'a', 'fundamental', 'task', 'of', 'computer', 'vision', 'the', 'first', 'example', 'is', 'the', 'detection', 'of', 'faint', 'edges', 'in', 'noisy', 'images', 'a', 'challenging', 'problem', 'studied', 'in', 'the', 'last', 'decades', 'a', 'recent', 'study', 'introduced', 'a', 'fast', 'method', 'to', 'detect', 'faint', 'edges', 'in', 'the', 'highest', 'accuracy', 'among', 'all', 'the', 'existing', 'approaches', 'their', 'complexity', 'is', 'nearly', 'linear', 'in', 'the', 'images', 'pixels', 'and', 'their', 'runtime', 'is', 'seconds', 'for', 'a', 'noisy', 'image', 'their', 'approach', 'utilizes', 'a', 'multiscale', 'binary', 'partitioning', 'of', 'the', 'image', 'by', 'utilizing', 'the', 'multiscale', 'unet', 'architecture', 'we', 'show', 'in', 'this', 'paper', 'that', 'their', 'method', 'can', 'be', 'dramatically', 'improved', 'in', 'both', 'aspects', 'of', 'run', 'time', 'and', 'accuracy', 'by', 'training', 'the', 'network', 'on', 'a', 'dataset', 'of', 'binary', 'images', 'we', 'developed', 'an', 'approach', 'for', 'faint', 'edge', 'detection', 'that', 'works', 'in', 'a', 'linear', 'complexity', 'our', 'runtime', 'of', 'a', 'noisy', 'image', 'is', 'milliseconds', 'on', 'a', 'gpu', 'even', 'though', 'our', 'method', 'is', 'orders', 'of', 'magnitude', 'faster', 'we', 'still', 'achieve', 'higher', 'accuracy', 'of', 'detection', 'under', 'many', 'challenging', 'scenarios', 'in', 'addition', 'we', 'show', 'that', 'our', 'approach', 'to', 'performing', 'multiscale', 'preprocessing', 'of', 'noisy', 'images', 'using', 'unet', 'improves', 'the', 'ability', 'to', 'perform', 'other', 'vision', 'tasks', 'under', 'the', 'presence', 'of', 'noise', 'we', 'prove', 'it', 'on', 'the', 'problems', 'of', 'noisy', 'objects', 'classification', 'and', 'classical', 'image', 'denoising', 'we', 'show', 'that', 'multiscale', 'denoising', 'can', 'be', 'carried', 'out', 'by', 'a', 'novel', 'edge', 'preservation', 'loss', 'as', 'our', 'experiments', 'show', 'we', 'achieve', 'highquality', 'results', 'in', 'the', 'three', 'aspects', 'of', 'faint', 'edge', 'detection', 'noisy', 'image', 'classification', 'and', 'natural', 'image', 'denoising']]
|
[-0.07809816852592727, -0.026143725596133056, -0.06859723601179818, 0.03315803378985341, -0.055374637209267046, -0.13765667938666107, 0.01780950083678666, 0.46010369549815855, -0.26125584334755936, -0.35498609783438345, 0.10861379462488306, -0.24734105549626595, -0.2041472758438128, 0.2230071690379797, -0.1567617248132592, 0.10372342118062079, 0.18412354802324746, 0.03559213773502658, -0.0830699895246653, -0.34225003989413383, 0.24357184797214965, 0.04358490474211673, 0.2984119455407684, 0.003579272721738865, 0.11077989198480888, -0.03759210371839193, -0.06386143751054381, 0.014855256959466108, -0.02641814975225619, 0.1370996633580944, 0.29742769693548327, 0.17505579851955796, 0.30601648255639397, -0.419505996350199, -0.2373582447587978, 0.08406366947456263, 0.12978196801171482, 0.10629359207038457, -0.0557463321024746, -0.3446080302286039, 0.12366699434787734, -0.11422369362941633, 0.008755727079308903, -0.10949131318484433, -0.012445690299985775, -0.04848674601526, -0.26698093315741667, 0.11024580683345751, 0.08674131275232261, 0.04199619175924454, -0.03321917559272455, -0.07172813424355505, 0.057308637133489056, 0.14579170049595025, -0.00508067001355812, 0.04548463149597713, 0.13684738481533715, -0.2228419130309097, -0.15553825469687582, 0.38233658029542616, -0.05841570722792919, -0.17275563889803985, 0.22856027628586162, -0.06522340416462005, -0.16930675650364718, 0.13848168603532637, 0.21428348136056835, 0.16267104544288788, -0.1309776789547565, 0.02396165786194615, -0.06038746047221745, 0.20134881607373245, 0.0649285130231874, 0.014312562074822684, 0.14978099226136693, 0.2610561698170689, 0.06552776860553422, 0.17833805020224341, -0.19194819013840364, 0.006401240766475288, -0.19469321258366107, -0.12411856365700563, -0.22883328587098126, -0.021995431055741695, -0.10095251456538487, -0.13173846015706658, 0.43402604627190156, 0.24572440608632556, 0.22128299908169236, 0.0842814400830927, 0.39478156428182654, 0.04760628084331984, 0.09285960143315605, 0.06349087575969557, 0.18913783738971687, 0.041010489364271055, 0.08813229160926615, -0.18327853524824606, 0.03831782527413452, 0.049479664907751915]
|
1,803.09421
|
Adaptive weak-value amplification with adjustable postselection
|
Weak-value amplification (WVA) has recently become an important technique for
parameter estimation, owing to its ability to enhance the signal-to-noise ratio
by amplifying extremely small signals with proper postselection strategies. In
this paper, we propose an adaptive WVA scheme to achieve the highest Fisher
information when using an unbalanced pointer. Different from previous schemes,
the adaptive WVA scheme is associated with a real-time update on the
postselection states with the help of feedback information from the outcomes,
and the "extremely small" condition set on the parameter of interest is
relaxed. By applying this scheme to a time-delay measurement scenario, we show
by numerical simulation that the precision achieved in our scheme is several
times higher than the standard WVA scheme. Our result might open a path for
improving the WVA technique in a more flexible and robust way.
|
quant-ph
|
weakvalue amplification wva has recently become an important technique for parameter estimation owing to its ability to enhance the signaltonoise ratio by amplifying extremely small signals with proper postselection strategies in this paper we propose an adaptive wva scheme to achieve the highest fisher information when using an unbalanced pointer different from previous schemes the adaptive wva scheme is associated with a realtime update on the postselection states with the help of feedback information from the outcomes and the extremely small condition set on the parameter of interest is relaxed by applying this scheme to a timedelay measurement scenario we show by numerical simulation that the precision achieved in our scheme is several times higher than the standard wva scheme our result might open a path for improving the wva technique in a more flexible and robust way
|
[['weakvalue', 'amplification', 'wva', 'has', 'recently', 'become', 'an', 'important', 'technique', 'for', 'parameter', 'estimation', 'owing', 'to', 'its', 'ability', 'to', 'enhance', 'the', 'signaltonoise', 'ratio', 'by', 'amplifying', 'extremely', 'small', 'signals', 'with', 'proper', 'postselection', 'strategies', 'in', 'this', 'paper', 'we', 'propose', 'an', 'adaptive', 'wva', 'scheme', 'to', 'achieve', 'the', 'highest', 'fisher', 'information', 'when', 'using', 'an', 'unbalanced', 'pointer', 'different', 'from', 'previous', 'schemes', 'the', 'adaptive', 'wva', 'scheme', 'is', 'associated', 'with', 'a', 'realtime', 'update', 'on', 'the', 'postselection', 'states', 'with', 'the', 'help', 'of', 'feedback', 'information', 'from', 'the', 'outcomes', 'and', 'the', 'extremely', 'small', 'condition', 'set', 'on', 'the', 'parameter', 'of', 'interest', 'is', 'relaxed', 'by', 'applying', 'this', 'scheme', 'to', 'a', 'timedelay', 'measurement', 'scenario', 'we', 'show', 'by', 'numerical', 'simulation', 'that', 'the', 'precision', 'achieved', 'in', 'our', 'scheme', 'is', 'several', 'times', 'higher', 'than', 'the', 'standard', 'wva', 'scheme', 'our', 'result', 'might', 'open', 'a', 'path', 'for', 'improving', 'the', 'wva', 'technique', 'in', 'a', 'more', 'flexible', 'and', 'robust', 'way']]
|
[-0.10263052387281145, 0.07600632401643426, -0.10993535337510749, 0.02301438579308814, -0.05959435751445699, -0.19425199890468756, 0.10193475090267569, 0.3920408222112346, -0.24051458119968142, -0.31408822915071377, 0.10934312783174918, -0.1909735127068732, -0.14454621319200142, 0.2678899659954038, -0.12043190397916065, 0.09886871789121474, 0.10396836562659187, 0.004498947619298554, -0.035166795607622495, -0.26717229211783927, 0.30133397307624854, 0.1552938445120294, 0.329517198397535, -0.007381870612954262, 0.14357255651291623, 0.014070777885575333, -0.051887906642387745, 0.02697191651036585, -0.09045212586568306, 0.12396954788203837, 0.23958343014996702, 0.1315191626832213, 0.3365256138334888, -0.35890140342593624, -0.21598659703116593, 0.1152130288436361, 0.13096277865891656, 0.18571603431136927, -0.0682074185972232, -0.30599090083083813, 0.0939379657983132, -0.20368596206864584, -0.09282936185490394, -0.10091003791118662, -0.05010967217115821, -0.036182266818879885, -0.3506962205823241, 0.06156277084939074, 0.031333570743141616, 0.003993430698492507, 0.01623814263418182, -0.07380514495763117, 0.07239719897177935, 0.07859270289085596, -0.01780156564284656, 0.04557976097482648, 0.09877355971738049, -0.13196787651648503, -0.1355293370611237, 0.33150513760367595, -0.058409674810705386, -0.2116959927050208, 0.1568566741121501, -0.09008461864921602, -0.09731080157402228, 0.16002684923064342, 0.15186161039721058, 0.11932856895272499, -0.10346982316875347, 0.005880097108656892, 0.012785410187949521, 0.20008740326021865, 0.021072704975992656, 0.09824820960520943, 0.12579771156568945, 0.18555530884971275, 0.13254925024871161, 0.11230558257523006, -0.10290523196791596, -0.0631725632187411, -0.23200634655844676, -0.12691284634132424, -0.16063809248347147, 0.013170226973117045, -0.12936646042478547, -0.07809470038425745, 0.3445756478952756, 0.22691442280926782, 0.201772206928581, 0.03556232396310762, 0.3952525605623057, 0.13133073203778992, 0.06122517857094889, 0.03811079679745371, 0.27574294777182135, 0.12760663964360466, 0.09166567466910118, -0.23880297662960231, 0.10612647614165115, 0.028379476752361632]
|
1,803.09422
|
The cooling-off effect of price limits in the Chinese stock markets
|
In this paper, we investigate the cooling-off effect (opposite to the magnet
effect) from two aspects. Firstly, from the viewpoint of dynamics, we study the
existence of the cooling-off effect by following the dynamical evolution of
some financial variables over a period of time before the stock price hits its
limit. Secondly, from the probability perspective, we investigate, with the
logit model, the existence of the cooling-off effect through analyzing the
high-frequency data of all A-share common stocks traded on the Shanghai Stock
Exchange and the Shenzhen Stock Exchange from 2000 to 2011 and inspecting the
trading period from the opening phase prior to the moment that the stock price
hits its limits. A comparison is made of the properties between up-limit hits
and down-limit hits, and the possible difference will also be compared between
bullish and bearish market state by dividing the whole period into three
alternating bullish periods and three bearish periods. We find that the
cooling-off effect emerges for both up-limit hits and down-limit hits, and the
cooling-off effect of the down-limit hits is stronger than that of the up-limit
hits. The difference of the cooling-off effect between bullish period and
bearish period is quite modest. Moreover, we examine the sub-optimal orders
effect, and infer that the professional individual investors and institutional
investors play a positive role in the cooling-off effects. All these findings
indicate that the price limit trading rule exerts a positive effect on
maintaining the stability of the Chinese stock markets.
|
q-fin.ST q-fin.TR
|
in this paper we investigate the coolingoff effect opposite to the magnet effect from two aspects firstly from the viewpoint of dynamics we study the existence of the coolingoff effect by following the dynamical evolution of some financial variables over a period of time before the stock price hits its limit secondly from the probability perspective we investigate with the logit model the existence of the coolingoff effect through analyzing the highfrequency data of all ashare common stocks traded on the shanghai stock exchange and the shenzhen stock exchange from 2000 to 2011 and inspecting the trading period from the opening phase prior to the moment that the stock price hits its limits a comparison is made of the properties between uplimit hits and downlimit hits and the possible difference will also be compared between bullish and bearish market state by dividing the whole period into three alternating bullish periods and three bearish periods we find that the coolingoff effect emerges for both uplimit hits and downlimit hits and the coolingoff effect of the downlimit hits is stronger than that of the uplimit hits the difference of the coolingoff effect between bullish period and bearish period is quite modest moreover we examine the suboptimal orders effect and infer that the professional individual investors and institutional investors play a positive role in the coolingoff effects all these findings indicate that the price limit trading rule exerts a positive effect on maintaining the stability of the chinese stock markets
|
[['in', 'this', 'paper', 'we', 'investigate', 'the', 'coolingoff', 'effect', 'opposite', 'to', 'the', 'magnet', 'effect', 'from', 'two', 'aspects', 'firstly', 'from', 'the', 'viewpoint', 'of', 'dynamics', 'we', 'study', 'the', 'existence', 'of', 'the', 'coolingoff', 'effect', 'by', 'following', 'the', 'dynamical', 'evolution', 'of', 'some', 'financial', 'variables', 'over', 'a', 'period', 'of', 'time', 'before', 'the', 'stock', 'price', 'hits', 'its', 'limit', 'secondly', 'from', 'the', 'probability', 'perspective', 'we', 'investigate', 'with', 'the', 'logit', 'model', 'the', 'existence', 'of', 'the', 'coolingoff', 'effect', 'through', 'analyzing', 'the', 'highfrequency', 'data', 'of', 'all', 'ashare', 'common', 'stocks', 'traded', 'on', 'the', 'shanghai', 'stock', 'exchange', 'and', 'the', 'shenzhen', 'stock', 'exchange', 'from', '2000', 'to', '2011', 'and', 'inspecting', 'the', 'trading', 'period', 'from', 'the', 'opening', 'phase', 'prior', 'to', 'the', 'moment', 'that', 'the', 'stock', 'price', 'hits', 'its', 'limits', 'a', 'comparison', 'is', 'made', 'of', 'the', 'properties', 'between', 'uplimit', 'hits', 'and', 'downlimit', 'hits', 'and', 'the', 'possible', 'difference', 'will', 'also', 'be', 'compared', 'between', 'bullish', 'and', 'bearish', 'market', 'state', 'by', 'dividing', 'the', 'whole', 'period', 'into', 'three', 'alternating', 'bullish', 'periods', 'and', 'three', 'bearish', 'periods', 'we', 'find', 'that', 'the', 'coolingoff', 'effect', 'emerges', 'for', 'both', 'uplimit', 'hits', 'and', 'downlimit', 'hits', 'and', 'the', 'coolingoff', 'effect', 'of', 'the', 'downlimit', 'hits', 'is', 'stronger', 'than', 'that', 'of', 'the', 'uplimit', 'hits', 'the', 'difference', 'of', 'the', 'coolingoff', 'effect', 'between', 'bullish', 'period', 'and', 'bearish', 'period', 'is', 'quite', 'modest', 'moreover', 'we', 'examine', 'the', 'suboptimal', 'orders', 'effect', 'and', 'infer', 'that', 'the', 'professional', 'individual', 'investors', 'and', 'institutional', 'investors', 'play', 'a', 'positive', 'role', 'in', 'the', 'coolingoff', 'effects', 'all', 'these', 'findings', 'indicate', 'that', 'the', 'price', 'limit', 'trading', 'rule', 'exerts', 'a', 'positive', 'effect', 'on', 'maintaining', 'the', 'stability', 'of', 'the', 'chinese', 'stock', 'markets']]
|
[-0.1261736917288725, 0.13496734618269632, -0.12657130300067365, 0.1219853981735509, -0.07391624091483412, -0.080188662093227, 0.16098885418378714, 0.3554440909913677, -0.26879538412334075, -0.27496644521512936, 0.13993921985676294, -0.34666379604432995, -0.12616565971360033, 0.17956082192193037, -0.03864111535690408, -0.07205113627795161, 0.04019924087745896, 0.010575006001436639, 0.01651970360325348, -0.2814647681588827, 0.2765672619827846, 0.06103066776253223, 0.29644241418712114, 0.048210808223015385, 0.1177210389053909, 0.03423848099981129, -0.042843283287099625, 0.0030560348077341612, -0.1254900427257865, 0.06481995159073879, 0.17935552808874652, 0.053451770143621125, 0.318897387446451, -0.42603403795133477, -0.1123145501928683, 0.13082323350325256, 0.03008041018054553, 0.030793758808646488, 0.008318403278579295, -0.262779364460393, 0.028197294231673876, -0.21136188612843634, -0.09419294529564316, -0.014992285928470253, 0.07901179451619837, 0.015017222680258922, -0.24812992885407165, 0.08961439198073894, 0.06145241377846458, 0.06483830503840377, -0.0692777370738039, -0.13299846016473857, -0.07367654316888948, 0.18214316456672935, 0.1794840356675335, -0.052360848455806734, 0.12150634145213343, -0.10773922491777191, -0.16364130609468952, 0.3434427388706188, -0.07417750248369932, -0.10172705646691022, 0.11317654216081387, -0.18388201306887, -0.07918798212557729, 0.10308418917278325, 0.17453633230236107, 0.022941277018344777, -0.12024664148397984, 0.022617727270404533, -0.031214232458487937, 0.18646214293317892, 0.10552210477275042, -0.010997707365450226, 0.22614681570713413, 0.16808032049507143, 0.05871372657586719, 0.1536165326697043, -0.14231044038383645, -0.17365095717667486, -0.23018336149407664, -0.11641261167547369, -0.11662182817141326, 0.0581046706981069, -0.12951583077742007, -0.13049150749038047, 0.4222614046427523, 0.15912349147133922, 0.14419968908467434, 0.04516463077661057, 0.2504901107021717, 0.10264267728697916, -0.001479331670677278, 0.08639896079343612, 0.2175284811897205, 0.01922836118502173, 0.15594208592441505, -0.2357138626598885, 0.17169814219185517, 0.022527517057551818]
|
1,803.09423
|
Locally PI but not PI Division Rings of Arbitrary GK-Dimension
|
We give examples of locally PI but not PI division rings of GK-dimension n
for every positive integer n.
|
math.RA
|
we give examples of locally pi but not pi division rings of gkdimension n for every positive integer n
|
[['we', 'give', 'examples', 'of', 'locally', 'pi', 'but', 'not', 'pi', 'division', 'rings', 'of', 'gkdimension', 'n', 'for', 'every', 'positive', 'integer', 'n']]
|
[-0.3028556364710982, 0.19989578950365908, -0.0776789660908674, 0.0028220137189093387, -0.04670933045839008, -0.3297316682966132, 0.013796418366071424, 0.33390665760165766, -0.2989105648900333, -0.12067420957119841, 0.045550971120399866, -0.2823540313463462, -0.17972913926075162, 0.19641096203735, -0.009406388002006631, -0.06804905145576126, 0.013269766675014245, 0.14794772378119983, -0.017590933577402643, -0.40283980073505327, 0.2751629030282952, -0.10385574096519697, 0.07463992043937508, 0.012226782665636978, 0.05929550742975583, 0.06487415250586837, -0.03721850561468225, -0.00018640666415816858, -0.20144468398862764, 0.016597687707919823, 0.42116960353757205, 0.11889908149054176, 0.220930263007942, -0.39594847220455687, -0.023666511461334794, 0.28538097651969446, 0.1946642448096291, 0.01798523305670211, -0.051754066230435124, -0.16285856734765203, 0.25982559354681717, -0.14395527620064585, -0.1202395516202638, -0.08301582167807378, 0.29508765066336645, -0.04388298481506737, -0.3377837386031292, -0.04811458969121113, 0.15773839111390867, 0.1547642570283068, -0.014089195780750168, -0.26481628148375375, 0.04155699644041689, 0.10322262109012197, -0.11410624053525298, -0.023375755941838418, 0.04972523563284133, 0.05370254579343294, -0.1721298437761633, 0.3127006613894513, 0.009265745940961335, -0.2972332631286822, 0.09880223380107629, -0.25350291105477435, -0.09838781721497837, 0.207450285946068, 0.0768216660148219, 0.1603212172263547, 0.07133860359164446, 0.20812524286539932, -0.1938398723539553, 0.1727613763589608, 0.16561630221181795, 0.03665126960090435, 0.1364375950866624, -0.01535472215006226, 0.16003658955818728, 0.09267051282681917, 0.08062407472415974, 0.05393143397706904, -0.4244447001501134, -0.19310971442610025, -0.14842923949962775, 0.20770159865021828, -0.055299817952082345, -0.16547001810058168, 0.3030535461086976, -0.08108159154653549, 0.2202466668463067, 0.16560281171022276, 0.19870450798618167, 0.043722758706855144, 0.02779586407306947, 0.13374029095039555, -0.045924603939056396, 0.16732738069013545, -0.009547259952676924, -0.17468498059009252, -0.025364957994928484, 0.1159133780747652]
|
1,803.09424
|
Radio-over-fiber using an optical antenna based on Rydberg states of
atoms
|
We provide an experimental demonstration of a direct fiber-optic link for RF
transmission ("radio-over-fiber") using a sensitive optical antenna based on a
rubidium vapor cell. The scheme relies on measuring the transmission of laser
light at an electromagnetically-induced transparency resonance that involves
highly-excited Rydberg states. By dressing pairs of Rydberg states using
microwave fields that act as local oscillators, we encoded RF signals in the
optical frequency domain. The light carrying the information is linked via a
virtually lossless optical fiber to a photodetector where the signal is
retrieved. We demonstrate a signal bandwidth in excess of 1 MHz limited by the
available coupling laser power and optical density. Our sensitive, non-metallic
and readily scalable optical antenna for microwaves allows extremely low-levels
of optical power ($\sim 1\, \mu$W) throughput in the fiber-optic link. It
offers a promising future platform for emerging wireless network
infrastructures.
|
physics.atom-ph
|
we provide an experimental demonstration of a direct fiberoptic link for rf transmission radiooverfiber using a sensitive optical antenna based on a rubidium vapor cell the scheme relies on measuring the transmission of laser light at an electromagneticallyinduced transparency resonance that involves highlyexcited rydberg states by dressing pairs of rydberg states using microwave fields that act as local oscillators we encoded rf signals in the optical frequency domain the light carrying the information is linked via a virtually lossless optical fiber to a photodetector where the signal is retrieved we demonstrate a signal bandwidth in excess of 1 mhz limited by the available coupling laser power and optical density our sensitive nonmetallic and readily scalable optical antenna for microwaves allows extremely lowlevels of optical power sim 1 muw throughput in the fiberoptic link it offers a promising future platform for emerging wireless network infrastructures
|
[['we', 'provide', 'an', 'experimental', 'demonstration', 'of', 'a', 'direct', 'fiberoptic', 'link', 'for', 'rf', 'transmission', 'radiooverfiber', 'using', 'a', 'sensitive', 'optical', 'antenna', 'based', 'on', 'a', 'rubidium', 'vapor', 'cell', 'the', 'scheme', 'relies', 'on', 'measuring', 'the', 'transmission', 'of', 'laser', 'light', 'at', 'an', 'electromagneticallyinduced', 'transparency', 'resonance', 'that', 'involves', 'highlyexcited', 'rydberg', 'states', 'by', 'dressing', 'pairs', 'of', 'rydberg', 'states', 'using', 'microwave', 'fields', 'that', 'act', 'as', 'local', 'oscillators', 'we', 'encoded', 'rf', 'signals', 'in', 'the', 'optical', 'frequency', 'domain', 'the', 'light', 'carrying', 'the', 'information', 'is', 'linked', 'via', 'a', 'virtually', 'lossless', 'optical', 'fiber', 'to', 'a', 'photodetector', 'where', 'the', 'signal', 'is', 'retrieved', 'we', 'demonstrate', 'a', 'signal', 'bandwidth', 'in', 'excess', 'of', '1', 'mhz', 'limited', 'by', 'the', 'available', 'coupling', 'laser', 'power', 'and', 'optical', 'density', 'our', 'sensitive', 'nonmetallic', 'and', 'readily', 'scalable', 'optical', 'antenna', 'for', 'microwaves', 'allows', 'extremely', 'lowlevels', 'of', 'optical', 'power', 'sim', '1', 'muw', 'throughput', 'in', 'the', 'fiberoptic', 'link', 'it', 'offers', 'a', 'promising', 'future', 'platform', 'for', 'emerging', 'wireless', 'network', 'infrastructures']]
|
[-0.20884449513290415, 0.1531006986020097, -0.009224692551692674, -0.05390953599235981, -0.04569941412305811, -0.22146841877472254, 0.11385981845050737, 0.46860536998072705, -0.22643788928048803, -0.23978644684022227, 0.05052747001457907, -0.26085541983653215, -0.12361768208129878, 0.28075718622771906, 0.00110736566471991, 0.06159686186787236, 0.02988359111302591, -0.03155174734981867, 0.06746558242777063, -0.1311113139064136, 0.23230663734696597, 0.10436896452927714, 0.38933564231477, 0.07729513113145957, 0.1473805149203049, 0.03228173148655496, -0.00027434968786848175, -0.09482111445045216, -0.057373371958985786, 0.15506865819867283, 0.29948227602167876, 0.08263010031485057, 0.21865753142058952, -0.4359863691188239, -0.24868919205741136, 0.06547444465674356, 0.13808571891631227, 0.13529508427059003, -0.09531132099169821, -0.29589203269045045, 0.01806504443740485, -0.16845539576940602, -0.09074068660164004, -0.05402921023615799, -0.04562679604933291, 0.06557457827982473, -0.3083936398575356, 0.007245257806189202, -0.05425902342316336, 0.09172773781196716, -0.01992538341172886, -0.023819332092453342, 0.029383673568718606, 0.07871080067829339, -0.13583837980665006, 0.010254198129262801, 0.19752926209133925, -0.10580283695167594, -0.09357057488116377, 0.3748879096881076, -0.11717133182817353, -0.09090927964356448, 0.13080577828296155, -0.11238566507305299, -0.01959937288575656, 0.17173189234796105, 0.15492317491085628, 0.05470305876936633, -0.1362043080576272, 0.014553026458202906, 0.015408395394728474, 0.2610427078992858, 0.13841387754553683, 0.19256840878446307, 0.24207485906154544, 0.21157350987716989, 0.08000019349652779, 0.16753627503798765, -0.1611179728609965, 0.009476217503131894, -0.22568001929577766, -0.11837937000656983, -0.25671391909407987, 0.07807950573725873, -0.07921368315029512, -0.08599790403215618, 0.4158297196541002, 0.11614611975431859, 0.13369487007542383, -0.028169238939881325, 0.43037810828048295, 0.10289973396664628, 0.0973554235863519, 0.022795917453257354, 0.27925971157236634, 0.15808296644200498, 0.14379550640347538, -0.23756749382310943, -0.03499949443759722, -0.07509389539718159]
|
1,803.09425
|
Scalable photonic reinforcement learning by time-division multiplexing
of laser chaos
|
Reinforcement learning involves decision making in dynamic and uncertain
environments and constitutes a crucial element of artificial intelligence. In
our previous work, we experimentally demonstrated that the ultrafast chaotic
oscillatory dynamics of lasers can be used to solve the two-armed bandit
problem efficiently, which requires decision making concerning a class of
difficult trade-offs called the exploration-exploitation dilemma. However, only
two selections were employed in that research; thus, the scalability of the
laser-chaos-based reinforcement learning should be clarified. In this study, we
demonstrated a scalable, pipelined principle of resolving the multi-armed
bandit problem by introducing time-division multiplexing of chaotically
oscillated ultrafast time-series. The experimental demonstrations in which
bandit problems with up to 64 arms were successfully solved are presented in
this report. Detailed analyses are also provided that include performance
comparisons among laser chaos signals generated in different physical
conditions, which coincide with the diffusivity inherent in the time series.
This study paves the way for ultrafast reinforcement learning by taking
advantage of the ultrahigh bandwidths of light wave and practical enabling
technologies.
|
cs.ET cs.AI physics.data-an physics.optics
|
reinforcement learning involves decision making in dynamic and uncertain environments and constitutes a crucial element of artificial intelligence in our previous work we experimentally demonstrated that the ultrafast chaotic oscillatory dynamics of lasers can be used to solve the twoarmed bandit problem efficiently which requires decision making concerning a class of difficult tradeoffs called the explorationexploitation dilemma however only two selections were employed in that research thus the scalability of the laserchaosbased reinforcement learning should be clarified in this study we demonstrated a scalable pipelined principle of resolving the multiarmed bandit problem by introducing timedivision multiplexing of chaotically oscillated ultrafast timeseries the experimental demonstrations in which bandit problems with up to 64 arms were successfully solved are presented in this report detailed analyses are also provided that include performance comparisons among laser chaos signals generated in different physical conditions which coincide with the diffusivity inherent in the time series this study paves the way for ultrafast reinforcement learning by taking advantage of the ultrahigh bandwidths of light wave and practical enabling technologies
|
[['reinforcement', 'learning', 'involves', 'decision', 'making', 'in', 'dynamic', 'and', 'uncertain', 'environments', 'and', 'constitutes', 'a', 'crucial', 'element', 'of', 'artificial', 'intelligence', 'in', 'our', 'previous', 'work', 'we', 'experimentally', 'demonstrated', 'that', 'the', 'ultrafast', 'chaotic', 'oscillatory', 'dynamics', 'of', 'lasers', 'can', 'be', 'used', 'to', 'solve', 'the', 'twoarmed', 'bandit', 'problem', 'efficiently', 'which', 'requires', 'decision', 'making', 'concerning', 'a', 'class', 'of', 'difficult', 'tradeoffs', 'called', 'the', 'explorationexploitation', 'dilemma', 'however', 'only', 'two', 'selections', 'were', 'employed', 'in', 'that', 'research', 'thus', 'the', 'scalability', 'of', 'the', 'laserchaosbased', 'reinforcement', 'learning', 'should', 'be', 'clarified', 'in', 'this', 'study', 'we', 'demonstrated', 'a', 'scalable', 'pipelined', 'principle', 'of', 'resolving', 'the', 'multiarmed', 'bandit', 'problem', 'by', 'introducing', 'timedivision', 'multiplexing', 'of', 'chaotically', 'oscillated', 'ultrafast', 'timeseries', 'the', 'experimental', 'demonstrations', 'in', 'which', 'bandit', 'problems', 'with', 'up', 'to', '64', 'arms', 'were', 'successfully', 'solved', 'are', 'presented', 'in', 'this', 'report', 'detailed', 'analyses', 'are', 'also', 'provided', 'that', 'include', 'performance', 'comparisons', 'among', 'laser', 'chaos', 'signals', 'generated', 'in', 'different', 'physical', 'conditions', 'which', 'coincide', 'with', 'the', 'diffusivity', 'inherent', 'in', 'the', 'time', 'series', 'this', 'study', 'paves', 'the', 'way', 'for', 'ultrafast', 'reinforcement', 'learning', 'by', 'taking', 'advantage', 'of', 'the', 'ultrahigh', 'bandwidths', 'of', 'light', 'wave', 'and', 'practical', 'enabling', 'technologies']]
|
[-0.12041478495968626, 0.09568399272597673, -0.07660294948172978, 0.05164857316906537, -0.12032301126222252, -0.17245081139793783, 0.055990775177739996, 0.4675096879707791, -0.29271144091767093, -0.3229759548360493, 0.09364509783761456, -0.20451334964658258, -0.1824675913684326, 0.2321569058194495, -0.08558413661384617, 0.12625817751664428, 0.06509325999701232, -0.05918467076827516, 0.004091327156250675, -0.22819512201764497, 0.2689111869760424, 0.05173131137182909, 0.29601153617653975, -0.017150965666300373, 0.140586870349399, -0.0038297501915510288, -0.03275694284038019, -0.0033077764425601002, -0.08205633976408083, 0.1312755353589493, 0.37340857180608816, 0.14459662726530206, 0.3854721745030889, -0.4430144078354215, -0.23858720133603925, 0.09183760608780628, 0.17690560258707108, 0.08563367269554703, -0.09034683395242482, -0.3087119625347574, 0.03609195218574016, -0.12849605667785605, -0.0692860725668003, -0.09100894402570979, -0.03479745967568263, 0.0012478863623684915, -0.2846947830386204, 0.013044048385110503, 0.029506505494229278, 0.04701803994980472, -0.028699749541517935, -0.07956555291563708, 0.09521996372444719, 0.10587627461659369, 0.025096223166767965, -0.006280350591442738, 0.13194832503959014, -0.1314156201643575, -0.213432890172416, 0.37415560456101743, -0.005797803841014896, -0.16360538564785793, 0.18277110773743244, -0.09632412979259478, -0.13757169803560912, 0.11603365329406375, 0.19727941352481904, 0.1383967056696178, -0.1861421978284948, 0.04355438241404236, -0.024210822871904576, 0.15906991767942122, 0.08546681529011751, 0.048512065960148794, 0.15942391773756615, 0.263106265630878, 0.05014431181946519, 0.15297261960886158, -0.049293732651841574, -0.15678973326170872, -0.19788422440525896, -0.11053321460362017, -0.14766778305924513, 0.021439951550666848, -0.08039814314360073, -0.09336494461616926, 0.35310211559425364, 0.23299116570208417, 0.1566762661299946, 0.044946238499989855, 0.3315013337292169, 0.07572395303109607, 0.05145119834856038, 0.062062559884221276, 0.2696076251283201, 0.0845496478485085, 0.14242254445405558, -0.25814260048478604, 0.10402756598260668, -0.017313474606809733]
|
1,803.09426
|
Proximity-induced artefacts in magnetic imaging with nitrogen-vacancy
ensembles in diamond
|
Magnetic imaging with ensembles of nitrogen-vacancy (NV) centres in diamond
is a recently developed technique that allows for quantitative vector field
mapping. Here we uncover a source of artefacts in the measured magnetic field
in situations where the magnetic sample is placed in close proximity (a few
tens of nm) to the NV sensing layer. Using magnetic nanoparticles as a test
sample, we find that the measured field deviates significantly from the
calculated field, in shape, amplitude and even in sign. By modelling the full
measurement process, we show that these discrepancies are caused by the limited
measurement range of NV sensors combined with the finite spatial resolution of
the optical readout. We numerically investigate the role of the stand-off
distance to identify an artefact-free regime, and discuss an application to
ultrathin materials. This work provides a guide to predict and mitigate
proximity-induced artefacts that can arise in NV-based wide-field magnetic
imaging, and also demonstrates that the sensitivity of these artefacts to the
sample can make them a useful tool for magnetic characterisation.
|
cond-mat.mes-hall physics.app-ph physics.ins-det
|
magnetic imaging with ensembles of nitrogenvacancy nv centres in diamond is a recently developed technique that allows for quantitative vector field mapping here we uncover a source of artefacts in the measured magnetic field in situations where the magnetic sample is placed in close proximity a few tens of nm to the nv sensing layer using magnetic nanoparticles as a test sample we find that the measured field deviates significantly from the calculated field in shape amplitude and even in sign by modelling the full measurement process we show that these discrepancies are caused by the limited measurement range of nv sensors combined with the finite spatial resolution of the optical readout we numerically investigate the role of the standoff distance to identify an artefactfree regime and discuss an application to ultrathin materials this work provides a guide to predict and mitigate proximityinduced artefacts that can arise in nvbased widefield magnetic imaging and also demonstrates that the sensitivity of these artefacts to the sample can make them a useful tool for magnetic characterisation
|
[['magnetic', 'imaging', 'with', 'ensembles', 'of', 'nitrogenvacancy', 'nv', 'centres', 'in', 'diamond', 'is', 'a', 'recently', 'developed', 'technique', 'that', 'allows', 'for', 'quantitative', 'vector', 'field', 'mapping', 'here', 'we', 'uncover', 'a', 'source', 'of', 'artefacts', 'in', 'the', 'measured', 'magnetic', 'field', 'in', 'situations', 'where', 'the', 'magnetic', 'sample', 'is', 'placed', 'in', 'close', 'proximity', 'a', 'few', 'tens', 'of', 'nm', 'to', 'the', 'nv', 'sensing', 'layer', 'using', 'magnetic', 'nanoparticles', 'as', 'a', 'test', 'sample', 'we', 'find', 'that', 'the', 'measured', 'field', 'deviates', 'significantly', 'from', 'the', 'calculated', 'field', 'in', 'shape', 'amplitude', 'and', 'even', 'in', 'sign', 'by', 'modelling', 'the', 'full', 'measurement', 'process', 'we', 'show', 'that', 'these', 'discrepancies', 'are', 'caused', 'by', 'the', 'limited', 'measurement', 'range', 'of', 'nv', 'sensors', 'combined', 'with', 'the', 'finite', 'spatial', 'resolution', 'of', 'the', 'optical', 'readout', 'we', 'numerically', 'investigate', 'the', 'role', 'of', 'the', 'standoff', 'distance', 'to', 'identify', 'an', 'artefactfree', 'regime', 'and', 'discuss', 'an', 'application', 'to', 'ultrathin', 'materials', 'this', 'work', 'provides', 'a', 'guide', 'to', 'predict', 'and', 'mitigate', 'proximityinduced', 'artefacts', 'that', 'can', 'arise', 'in', 'nvbased', 'widefield', 'magnetic', 'imaging', 'and', 'also', 'demonstrates', 'that', 'the', 'sensitivity', 'of', 'these', 'artefacts', 'to', 'the', 'sample', 'can', 'make', 'them', 'a', 'useful', 'tool', 'for', 'magnetic', 'characterisation']]
|
[-0.08952290355227888, 0.11777635710736938, -0.02504522789832811, 0.03145380525450301, -0.03390351102719907, -0.10075733768428828, 0.04300430105582183, 0.4534709706339379, -0.26723781434093535, -0.3603484603755046, 0.06689589626093526, -0.27689571784639005, -0.10288172467546754, 0.22345183151340936, -0.040988358070662374, 0.01964704660992517, 0.051032426262133605, -0.0023201515459520526, -0.049776401115259224, -0.14310820934059487, 0.2743364425909402, 0.056785247261570984, 0.3076152064225658, 0.0634099152940867, 0.08649170430252588, 0.02150065076894798, 0.0016997133646983393, 0.07509823303451751, -0.11209065262685959, 0.0959231183853347, 0.2520805468585147, 0.048117259115949926, 0.24279361308165176, -0.43894539946128597, -0.21526771009260745, 0.08301244995036963, 0.16909321483466935, 0.16216984030866433, -0.10137008992565233, -0.29147788867635954, 0.09994032098586823, -0.09994799200023069, -0.1539105853542339, -0.0847625935350025, -0.022969581557676023, 0.00978245957061475, -0.2786053775668924, 0.03911088817319048, 0.022417698154661825, 0.1051476285034834, -0.06941896170305988, -0.07540532406270613, 0.02720304602908707, 0.11714887884337195, 0.0020837807703998784, 0.07040052631393422, 0.20217049398884546, -0.14287579765944028, -0.10693102070471532, 0.33871328752747804, -0.05999547858765825, -0.10713629998526601, 0.16933899901152133, -0.19814107486664123, -0.09227811411932804, 0.1087188419647688, 0.17954147774908896, 0.11405571290903703, -0.17012259224971193, 0.0433557415259244, 0.012010186582026721, 0.20722646567683536, 0.043051333392721186, 0.07605362281495662, 0.22388397152183664, 0.17950381477617897, 0.04747734310072955, 0.16596996365521147, -0.21800403111105984, -0.005474024671563055, -0.2245839999198134, -0.15138946321987828, -0.1908179351310029, 0.05108854759262528, -0.08708647428605662, -0.15264285934092695, 0.364426807386714, 0.2440215602549616, 0.181954077057822, -0.049695010742356695, 0.28398220856988066, 0.07487122643045908, 0.12112225753764166, -0.014467409457253335, 0.293199116889344, 0.19651170825277087, 0.10448877355841876, -0.257121924041543, 0.008279280682895766, -0.027945291451286783]
|
1,803.09427
|
Design Assurance Evaluation of Microcontrollers for safety critical
Avionics
|
Dealing with Commercial off-the-shelf (COTS) com- ponents is a daily business
for avionic system manufacturers. They are necessary ingredients for hardware
designs, but are not built in accordance with the avionics consensus standard
DO- 254 for Airborne Electronic Hardware (AEH) design. Especially for complex
COTS hardware components used in safety critical AEH, like Microcontroller
Units (MCUs), additional assurance activities have to be performed. All of them
together shall form a convincing confident, that the hardware is safe in its
intended operation environment. The focus of DO-254 is one approach called
Design Assurance (DA). Its aim is to reduce design errors by adherence of
prescribed process objectives for the entire design life cycle. The effort for
certain COTS assurance activities could be reduced if it is possible to
demonstrate, that the COTS design process is based on similar effective design
process guide- lines to minimize desgin errors. In the last years,
semiconductor manufacturers released safety MCUs in compliance to the ISO 26262
standard, dedicated for the development of functional safe automotive systems.
These products are COTS components in the sense of avionics, but they are also
developed according to a process that focuses on reduction of design errors. In
this paper an evaluation is performed to figure out if the ISO 26262 prescribes
a similar DA approach as the DO-254, in order to reduce the COTS assurance
effort for coming avionic systems.
|
cs.SE
|
dealing with commercial offtheshelf cots com ponents is a daily business for avionic system manufacturers they are necessary ingredients for hardware designs but are not built in accordance with the avionics consensus standard do 254 for airborne electronic hardware aeh design especially for complex cots hardware components used in safety critical aeh like microcontroller units mcus additional assurance activities have to be performed all of them together shall form a convincing confident that the hardware is safe in its intended operation environment the focus of do254 is one approach called design assurance da its aim is to reduce design errors by adherence of prescribed process objectives for the entire design life cycle the effort for certain cots assurance activities could be reduced if it is possible to demonstrate that the cots design process is based on similar effective design process guide lines to minimize desgin errors in the last years semiconductor manufacturers released safety mcus in compliance to the iso 26262 standard dedicated for the development of functional safe automotive systems these products are cots components in the sense of avionics but they are also developed according to a process that focuses on reduction of design errors in this paper an evaluation is performed to figure out if the iso 26262 prescribes a similar da approach as the do254 in order to reduce the cots assurance effort for coming avionic systems
|
[['dealing', 'with', 'commercial', 'offtheshelf', 'cots', 'com', 'ponents', 'is', 'a', 'daily', 'business', 'for', 'avionic', 'system', 'manufacturers', 'they', 'are', 'necessary', 'ingredients', 'for', 'hardware', 'designs', 'but', 'are', 'not', 'built', 'in', 'accordance', 'with', 'the', 'avionics', 'consensus', 'standard', 'do', '254', 'for', 'airborne', 'electronic', 'hardware', 'aeh', 'design', 'especially', 'for', 'complex', 'cots', 'hardware', 'components', 'used', 'in', 'safety', 'critical', 'aeh', 'like', 'microcontroller', 'units', 'mcus', 'additional', 'assurance', 'activities', 'have', 'to', 'be', 'performed', 'all', 'of', 'them', 'together', 'shall', 'form', 'a', 'convincing', 'confident', 'that', 'the', 'hardware', 'is', 'safe', 'in', 'its', 'intended', 'operation', 'environment', 'the', 'focus', 'of', 'do254', 'is', 'one', 'approach', 'called', 'design', 'assurance', 'da', 'its', 'aim', 'is', 'to', 'reduce', 'design', 'errors', 'by', 'adherence', 'of', 'prescribed', 'process', 'objectives', 'for', 'the', 'entire', 'design', 'life', 'cycle', 'the', 'effort', 'for', 'certain', 'cots', 'assurance', 'activities', 'could', 'be', 'reduced', 'if', 'it', 'is', 'possible', 'to', 'demonstrate', 'that', 'the', 'cots', 'design', 'process', 'is', 'based', 'on', 'similar', 'effective', 'design', 'process', 'guide', 'lines', 'to', 'minimize', 'desgin', 'errors', 'in', 'the', 'last', 'years', 'semiconductor', 'manufacturers', 'released', 'safety', 'mcus', 'in', 'compliance', 'to', 'the', 'iso', '26262', 'standard', 'dedicated', 'for', 'the', 'development', 'of', 'functional', 'safe', 'automotive', 'systems', 'these', 'products', 'are', 'cots', 'components', 'in', 'the', 'sense', 'of', 'avionics', 'but', 'they', 'are', 'also', 'developed', 'according', 'to', 'a', 'process', 'that', 'focuses', 'on', 'reduction', 'of', 'design', 'errors', 'in', 'this', 'paper', 'an', 'evaluation', 'is', 'performed', 'to', 'figure', 'out', 'if', 'the', 'iso', '26262', 'prescribes', 'a', 'similar', 'da', 'approach', 'as', 'the', 'do254', 'in', 'order', 'to', 'reduce', 'the', 'cots', 'assurance', 'effort', 'for', 'coming', 'avionic', 'systems']]
|
[-0.1338612031716219, 0.04834516250126025, -0.04668302306555634, 0.030303013831938518, -0.11139265557966606, -0.17360584825017047, 0.03547620542467405, 0.41627206635462144, -0.19457047742966352, -0.3077209613786189, 0.18159908951792914, -0.2644790280610323, -0.11881697198831553, 0.2514652041072742, -0.16440747187200397, 0.1065590876265425, 0.07614702861054544, 0.010990951450208128, -0.0172529814215316, -0.25841453077279714, 0.25247864608193327, 0.08626026444911843, 0.3265385687713182, 0.017494900276890536, 0.041760632146036, -0.009093742141516384, -0.009898924744610703, -0.0592813299957464, -0.04626133248123404, 0.14350722968836588, 0.3376489257395235, 0.19219522452282853, 0.3142219007535793, -0.46391368094083396, -0.1543577922595559, 0.07896238271051441, 0.09828486491206172, -0.02386169685416867, -0.005676482296772464, -0.24065090232736158, 0.11552193062532465, -0.24140658869314532, -0.12044418919600208, -0.08663827737660644, -0.02145095004630987, 0.018299726650370975, -0.24196791670826065, -0.0862335255468675, 0.04255975901828388, 0.08729131005330247, -0.038543399053780306, -0.13348170853571714, -0.014753411241347483, 0.18295776535956165, 0.013075277063381496, 0.012050522436432573, 0.2075271423902021, -0.09769615621151459, -0.11747887987271358, 0.402433283456223, 0.008708462227383978, -0.18022597534950582, 0.17302879886640699, -0.0218744771036535, -0.15573694788358747, 0.12411512276279744, 0.21386621447125506, 0.031298232695909305, -0.22310948506908646, 0.05087574712492884, 0.08153542417292707, 0.20962259487155419, 0.01745364487305381, 0.006506878533908959, 0.1773450252107918, 0.2219949961725346, 0.06602231185728487, 0.10693648368893924, -0.018858140951767768, -0.06324972703317831, -0.2705695554085369, -0.20247553109179156, -0.11646164378393278, -0.001007677358816638, -0.0025840017590753116, -0.1566310276444615, 0.32441044762205967, 0.19078968151616885, 0.061367365856976226, 0.03328523944502119, 0.3826247456292398, 0.07195554881316114, 0.14364972290141695, 0.0597103310191768, 0.2387733611046422, 0.00888666701888819, 0.16316728928943844, -0.15486407940637922, 0.12111907957811072, -0.006550647939583815]
|
1,803.09428
|
An odd order group without the dimension property
|
We construct a finitely presented group $G$ such that the $7$th dimension
quotient $G\cap(1+\varpi(\mathbb Z G)^7)/\gamma_7(G)$ has an element of order
$3$; this immediately leads to a finite $3$-group without the dimension
property. This contradicts a series of results by N. Gupta.
|
math.GR
|
we construct a finitely presented group g such that the 7th dimension quotient gcap1varpimathbb z g7gamma_7g has an element of order 3 this immediately leads to a finite 3group without the dimension property this contradicts a series of results by n gupta
|
[['we', 'construct', 'a', 'finitely', 'presented', 'group', 'g', 'such', 'that', 'the', '7th', 'dimension', 'quotient', 'gcap1varpimathbb', 'z', 'g7gamma_7g', 'has', 'an', 'element', 'of', 'order', '3', 'this', 'immediately', 'leads', 'to', 'a', 'finite', '3group', 'without', 'the', 'dimension', 'property', 'this', 'contradicts', 'a', 'series', 'of', 'results', 'by', 'n', 'gupta']]
|
[-0.14122027764096856, 0.12369264127082716, -0.12083524982153904, -0.03046900129993446, -0.08252503655385227, -0.08865805777022615, 0.0163876637496287, 0.3141112243756652, -0.28685425347648563, -0.2187999710906297, 0.08842604163801297, -0.28300724702421576, -0.1027459864562843, 0.1721440927591175, -0.10031490753171965, -0.024332332238554955, 0.025519403617363424, 0.10149930589832365, -0.06263147225254215, -0.34355871282168665, 0.3274310820735991, -0.020181913999840616, 0.22138012629002332, 0.028294996172189713, 0.1316403991775587, 0.009317164891399443, -0.04033635862870142, 0.026891272910870612, -0.14377124915572495, 0.08155839657410979, 0.2734373848652467, 0.0748881108709611, 0.3090342975803651, -0.32665604567155243, -0.18850270360708238, 0.16549462687689812, 0.14099094592966138, 0.05625214520841837, -0.07832814021967352, -0.23385637956671418, 0.1621320041245781, -0.23900200051721185, -0.21551459295442327, -0.017523743223864584, 0.09126447266899049, -0.06292324175592512, -0.2825372008606791, -0.0013862732565030455, 0.16754164821468293, 0.09987565788906068, 0.044211175525560975, -0.10029860318172723, -0.0031717045232653616, 0.0841460116149392, -0.01080710340756923, 0.06219014937523752, 0.0007390694809146225, -0.032546470745000985, -0.15018251528090332, 0.3947828331729397, -0.07912515617499594, -0.16535005439072847, 0.17608122496167197, -0.14825048857601358, -0.1503708957694471, 0.1654079315252602, 0.07206730712205171, 0.12040324625559151, -0.05169395594857633, 0.23652694853954018, -0.14543876701500266, 0.19668545078020544, 0.06313700152095407, -0.0647568158165086, 0.043990638898685576, 0.12120722620165907, 0.0881108682602644, 0.11390648931846954, 0.024026905943173915, 0.058685744740068914, -0.3873213221086189, -0.19980463148094713, -0.17941396874375642, 0.14294030060991644, -0.13299198414897545, -0.1534416054142639, 0.36613625700119884, 0.08458896758966147, 0.2097808131016791, 0.07773866930510849, 0.19794393721967934, 0.09983135359361768, 0.06113610292086378, 0.09054712001234293, 0.10278767999261618, 0.16754479671944864, -0.016240143124014138, -0.15708415904082357, 0.0020208102185279133, 0.22097313972190022]
|
1,803.09429
|
Large Deviation Principle for arithmetic functions in continued fraction
expansion
|
Khinchin proved that the arithmetic mean of continued fraction digits of
Lebesgue almost every irrational number in $(0,1)$ diverges to infinity. Hence,
none of the classical limit theorems such as the weak and strong laws of large
numbers or central limit theorems hold. Nevertheless, we prove the existence of
a large deviations rate function which estimates exponential probabilities with
which the arithmetic mean of digits stays away from infinity.
|
math.DS math.NT math.PR
|
khinchin proved that the arithmetic mean of continued fraction digits of lebesgue almost every irrational number in 01 diverges to infinity hence none of the classical limit theorems such as the weak and strong laws of large numbers or central limit theorems hold nevertheless we prove the existence of a large deviations rate function which estimates exponential probabilities with which the arithmetic mean of digits stays away from infinity
|
[['khinchin', 'proved', 'that', 'the', 'arithmetic', 'mean', 'of', 'continued', 'fraction', 'digits', 'of', 'lebesgue', 'almost', 'every', 'irrational', 'number', 'in', '01', 'diverges', 'to', 'infinity', 'hence', 'none', 'of', 'the', 'classical', 'limit', 'theorems', 'such', 'as', 'the', 'weak', 'and', 'strong', 'laws', 'of', 'large', 'numbers', 'or', 'central', 'limit', 'theorems', 'hold', 'nevertheless', 'we', 'prove', 'the', 'existence', 'of', 'a', 'large', 'deviations', 'rate', 'function', 'which', 'estimates', 'exponential', 'probabilities', 'with', 'which', 'the', 'arithmetic', 'mean', 'of', 'digits', 'stays', 'away', 'from', 'infinity']]
|
[-0.16522912127708178, 0.13165327861392195, -0.09884894902453474, 0.13544083540530308, 0.014435438736193422, -0.12907226577374167, 0.1582464137101087, 0.2163812613411658, -0.29174982293414464, -0.21408621972575242, 0.13514485932292714, -0.3216434421719632, -0.06595757856384675, 0.21661191355045614, -0.1034739285680479, 0.08997040046412713, 0.04947898334796554, 0.1073245225555223, -0.05406706885137744, -0.26792513318292366, 0.2510199600803679, -0.03118105988571609, 0.214282118688351, 0.039659852030403585, 0.12220291755047451, -0.0009124711412342563, 0.007166890663675208, 0.010150609348995098, -0.1384857519892714, 0.06467307535796493, 0.2272228320007739, 0.07718397783236983, 0.3438752699994307, -0.37146223363242165, -0.12412268888421249, 0.2421199593126126, 0.14949577442957493, 0.05539517224415381, 0.020788049679654447, -0.22005297607350824, 0.15679617440058052, -0.12208679526963312, -0.26777768179612316, -0.048102879140903984, 0.08335785185783237, 0.13560029443191446, -0.24412652013310487, 0.12438477802535762, 0.17679299001136553, 0.09739741785586745, -0.03712264610373456, -0.15785069897284973, 0.0030649641926899767, 0.161037588362334, 0.1687973286835072, 0.033460153219546526, 0.11960389672869655, -0.10845296642999502, -0.08755202181772262, 0.32394041874162527, -0.09880802855300515, -0.17404840875794922, 0.1498545774948729, -0.2818164601382138, -0.1590776251345549, 0.16197690680839014, 0.11680006217742946, 0.10923886447605016, -0.021162416934427143, 0.15319178058964916, -0.09955944617589314, 0.19480603973826635, 0.1837458530359942, 0.08282520915584071, 0.17080584576056487, 0.010737160625665085, 0.11189736475817104, 0.11197741642810297, -0.04699280577293341, -0.12056568491718044, -0.36367741097574646, -0.13630295496272005, -0.2092620676950268, 0.19004158114177594, -0.1912107031749801, -0.25429578808415093, 0.22400082234104257, 0.09388159786644594, 0.19029949162749277, 0.24403540494824774, 0.22833875790778277, 0.17875636234015657, 0.051320545368598425, 0.08424613366873203, 0.21069692326304706, 0.19057100335392507, 0.06681162118068154, -0.09829995979258008, 0.04019010089931713, 0.14385008732315854]
|
1,803.0943
|
2HDM without FCNC: off the beaten tracks
|
We propose an alternative method of constructing two Higgs-doublet models
free from scalar mediated FCNC couplings at the tree-level. In a toy scenario,
we have presented semi realistic textures for the Yukawa matrices, which can
reproduce the approximate flavor structure in the quark sector. Presence of
flavor diagonal but nonuniversal Yukawa couplings emerges as a distinguishing
feature of such models.
|
hep-ph
|
we propose an alternative method of constructing two higgsdoublet models free from scalar mediated fcnc couplings at the treelevel in a toy scenario we have presented semi realistic textures for the yukawa matrices which can reproduce the approximate flavor structure in the quark sector presence of flavor diagonal but nonuniversal yukawa couplings emerges as a distinguishing feature of such models
|
[['we', 'propose', 'an', 'alternative', 'method', 'of', 'constructing', 'two', 'higgsdoublet', 'models', 'free', 'from', 'scalar', 'mediated', 'fcnc', 'couplings', 'at', 'the', 'treelevel', 'in', 'a', 'toy', 'scenario', 'we', 'have', 'presented', 'semi', 'realistic', 'textures', 'for', 'the', 'yukawa', 'matrices', 'which', 'can', 'reproduce', 'the', 'approximate', 'flavor', 'structure', 'in', 'the', 'quark', 'sector', 'presence', 'of', 'flavor', 'diagonal', 'but', 'nonuniversal', 'yukawa', 'couplings', 'emerges', 'as', 'a', 'distinguishing', 'feature', 'of', 'such', 'models']]
|
[-0.1395369609235786, 0.22770481577827012, -0.00872847018763423, 0.17262872432669005, -0.06789036908497413, -0.22758866138756276, 0.02541921994027992, 0.3324064482934773, -0.20519133166720468, -0.2949399903804685, 0.0010502707640019555, -0.24853543527424335, -0.14531214499499281, 0.07397339008748531, 0.08374841560143978, 0.016397443227469922, 0.009074517510210474, -0.02667295206338167, -0.09794961634712915, -0.18860289736573274, 0.3253753165287587, -0.03654464110732079, 0.21436528246849776, 0.09470414960912119, 0.07069152214874824, -0.05186651543093224, -0.015509943873621524, -0.08525164754440387, -0.05656307603543003, 0.06321267959040901, 0.1767331173649533, 0.04807619793961446, 0.04673002458875999, -0.39450765382498504, -0.20026946517561253, 0.17800253096114224, 0.16408693255701412, 0.1880724543375739, -0.10321622759414216, -0.3099224252315859, 0.051926122365208965, -0.2655716652593886, -0.14307197514766207, -0.1469698957167566, -0.08697089493119468, -0.1597721307228009, -0.413998081702933, 0.10070683990294735, -0.03158786525018513, -0.0015193275175988674, 0.03742272691257919, -0.17571139354258775, -0.04800341768811146, 0.05349932267175366, 0.14177038217118632, -0.035215542480970426, 0.12343555896077305, -0.21887666143787404, -0.1628940068204732, 0.4166214481617014, -0.12079757444250087, -0.2550177509508406, 0.1878142660483718, -0.0865070897503756, -0.17754555707021305, 0.02353130419117709, 0.2041905617962281, 0.08787129399521897, -0.2108592576822654, 0.2252220143796876, -0.08534928129908319, 0.10155615583062172, 0.03862387342378497, 0.011278176369766394, 0.29319331361912193, 0.20324982123759885, 0.01676643545506522, 0.05901689728101094, -0.020072792121209205, -0.1308731546935936, -0.40024000114450853, -0.05202381300429503, -0.10365264526723574, 0.06052192763114969, -0.14831755864433943, -0.18518033033857742, 0.4771330378949642, 0.16727322776957104, 0.24609055093800028, 0.020700371515704318, 0.24914875713487467, 0.06882273165004639, 0.12272386678184072, 0.03159623507720729, 0.25428049731999636, 0.14202219310682268, 0.06582686101707319, -0.21360775913344696, 0.02436312095572551, 0.13156464691273867]
|
1,803.09431
|
Discrete Analogoues in Harmonic Analysis: Maximally Monomially Modulated
Singular Integrals Related to Carleson's Theorem
|
Motivated by Bourgain's work on pointwise ergodic theorems, and the work of
Stein and Stein-Wainger on maximally modulated singular integrals without
linear terms, we prove that the maximally monomially modulated discrete Hilbert
transform, \[ \mathcal{C}_df(x) := \sup_\lambda \left| \sum_{m \neq 0} f(x-m)
\frac{e^{2\pi i \lambda m^d}}{m} \right| \] is bounded on all $\ell^p, \ 2 -
\frac{1}{d^2 + 1} < p < \infty$, for any $d \geq 2$. We also establish almost
everywhere pointwise convergence of the modulated ergodic Hilbert transforms
(as $\lambda \to 0$) \[ \sum_{m \neq 0} T^m f(x) \cdot \frac{e^{2\pi i \lambda
m^d}}{m} \] for any measure-preserving system $(X,\mu,T)$, and any $f \in
L^p(X), \ 2 - \frac{1}{d^2 +1} < p < \infty$.
|
math.CA math.DS
|
motivated by bourgains work on pointwise ergodic theorems and the work of stein and steinwainger on maximally modulated singular integrals without linear terms we prove that the maximally monomially modulated discrete hilbert transform mathcalc_dfx sup_lambda left sum_m neq 0 fxm frace2pi i lambda mdm right is bounded on all ellp 2 frac1d2 1 p infty for any d geq 2 we also establish almost everywhere pointwise convergence of the modulated ergodic hilbert transforms as lambda to 0 sum_m neq 0 tm fx cdot frace2pi i lambda mdm for any measurepreserving system xmut and any f in lpx 2 frac1d2 1 p infty
|
[['motivated', 'by', 'bourgains', 'work', 'on', 'pointwise', 'ergodic', 'theorems', 'and', 'the', 'work', 'of', 'stein', 'and', 'steinwainger', 'on', 'maximally', 'modulated', 'singular', 'integrals', 'without', 'linear', 'terms', 'we', 'prove', 'that', 'the', 'maximally', 'monomially', 'modulated', 'discrete', 'hilbert', 'transform', 'mathcalc_dfx', 'sup_lambda', 'left', 'sum_m', 'neq', '0', 'fxm', 'frace2pi', 'i', 'lambda', 'mdm', 'right', 'is', 'bounded', 'on', 'all', 'ellp', '2', 'frac1d2', '1', 'p', 'infty', 'for', 'any', 'd', 'geq', '2', 'we', 'also', 'establish', 'almost', 'everywhere', 'pointwise', 'convergence', 'of', 'the', 'modulated', 'ergodic', 'hilbert', 'transforms', 'as', 'lambda', 'to', '0', 'sum_m', 'neq', '0', 'tm', 'fx', 'cdot', 'frace2pi', 'i', 'lambda', 'mdm', 'for', 'any', 'measurepreserving', 'system', 'xmut', 'and', 'any', 'f', 'in', 'lpx', '2', 'frac1d2', '1', 'p', 'infty']]
|
[-0.18757338172756136, 0.17053987758234143, -0.022041296717361547, 0.07675853504159022, -0.03390531172743067, -0.2688762722350657, -0.001743399715051055, 0.34487308248877524, -0.3257663692813367, -0.06467648116871715, 0.08514843658427708, -0.3343874172400683, -0.09416730695404113, 0.15890412242617458, -0.06491878533735872, 0.039370882206130775, -0.045111853294074536, 0.06744527249364182, -0.09546949042240158, -0.2418634980195202, 0.31458592412993314, -0.12693263981491326, 0.11982925803633407, 0.012517026606947184, 0.10469999279826879, 0.04502177661983296, 0.03715829799883068, -0.139551359154284, -0.2613909594462166, 0.02012804754253011, 0.23396305609494447, 0.10882487573893741, 0.2596114674047567, -0.32257355449255554, -0.09544151813723147, 0.24088153474032878, 0.19447078130207957, -0.15108270754106343, 0.04807580299559049, -0.31962679346092043, 0.1659394237026572, -0.08946904841344804, -0.16579849548172207, -0.1025773198355455, 0.11480060161906294, 0.027856428516097365, -0.37654849806800483, 0.06456410926504759, 0.22843765238299965, 0.08492632046574727, -0.07941030000103638, -0.20605800982913933, -0.017717138449661433, 0.003946891217492521, -0.004085575446952134, 0.16816534888464957, 0.03449260865338147, -0.0009870470268651844, -0.0441959312511608, 0.262464752078522, -0.14189630950102583, -0.2733852525986731, 0.06154881319031119, -0.2272531951777637, -0.1596206458308734, 0.07504331006668508, 0.031821762304753066, 0.1808017620909959, 0.010006241323426366, 0.3313280153536471, -0.07353346645715647, 0.15587584116496145, 0.14711433239281177, 0.015877991905435918, 0.013156797548290342, 0.0018900738004595042, 0.14964415059890598, 0.025887686340138317, 0.003761116644600406, 0.008786350412410684, -0.37699066859669983, -0.1624170363880694, -0.19009878452750853, 0.20891738218502723, -0.1366504029040516, -0.11834005046635866, 0.2679009878914803, 0.03933152304962277, 0.14350912879221142, 0.16030953189125285, 0.18565406374633311, 0.12335390235413797, -0.09706763369962573, 0.10827358403243124, 0.08186065269634128, 0.14591231998289003, 0.04733568120282143, -0.14904684262815862, -0.03910912692197598, 0.14232778089630302]
|
1,803.09432
|
Time-dependent lead-lag relationship between the onshore and offshore
Renminbi exchange rates
|
We employ the thermal optimal path method to explore both the long-term and
short-term interaction patterns between the onshore CNY and offshore CNH
exchange rates (2012-2015). For the daily data, the CNY and CNH exchange rates
show a weak alternate lead-lag structure in most of the time periods. When CNY
and CNH display a large disparity, the lead-lag relationship is uncertain and
depends on the prevailing market factors. The minute-scale interaction pattern
between the CNY and CNH exchange rates change over time according to different
market situations. We find that US dollar appreciation is associated with a
lead-lag relationship running from offshore to onshore, while a (contrarian)
Renminbi appreciation is associated with a lead-lag relationship running from
onshore to offshore. These results are robust with respect to different
sub-sample analyses and variations of the key smoothing parameter of the TOP
method.
|
q-fin.ST
|
we employ the thermal optimal path method to explore both the longterm and shortterm interaction patterns between the onshore cny and offshore cnh exchange rates 20122015 for the daily data the cny and cnh exchange rates show a weak alternate leadlag structure in most of the time periods when cny and cnh display a large disparity the leadlag relationship is uncertain and depends on the prevailing market factors the minutescale interaction pattern between the cny and cnh exchange rates change over time according to different market situations we find that us dollar appreciation is associated with a leadlag relationship running from offshore to onshore while a contrarian renminbi appreciation is associated with a leadlag relationship running from onshore to offshore these results are robust with respect to different subsample analyses and variations of the key smoothing parameter of the top method
|
[['we', 'employ', 'the', 'thermal', 'optimal', 'path', 'method', 'to', 'explore', 'both', 'the', 'longterm', 'and', 'shortterm', 'interaction', 'patterns', 'between', 'the', 'onshore', 'cny', 'and', 'offshore', 'cnh', 'exchange', 'rates', '20122015', 'for', 'the', 'daily', 'data', 'the', 'cny', 'and', 'cnh', 'exchange', 'rates', 'show', 'a', 'weak', 'alternate', 'leadlag', 'structure', 'in', 'most', 'of', 'the', 'time', 'periods', 'when', 'cny', 'and', 'cnh', 'display', 'a', 'large', 'disparity', 'the', 'leadlag', 'relationship', 'is', 'uncertain', 'and', 'depends', 'on', 'the', 'prevailing', 'market', 'factors', 'the', 'minutescale', 'interaction', 'pattern', 'between', 'the', 'cny', 'and', 'cnh', 'exchange', 'rates', 'change', 'over', 'time', 'according', 'to', 'different', 'market', 'situations', 'we', 'find', 'that', 'us', 'dollar', 'appreciation', 'is', 'associated', 'with', 'a', 'leadlag', 'relationship', 'running', 'from', 'offshore', 'to', 'onshore', 'while', 'a', 'contrarian', 'renminbi', 'appreciation', 'is', 'associated', 'with', 'a', 'leadlag', 'relationship', 'running', 'from', 'onshore', 'to', 'offshore', 'these', 'results', 'are', 'robust', 'with', 'respect', 'to', 'different', 'subsample', 'analyses', 'and', 'variations', 'of', 'the', 'key', 'smoothing', 'parameter', 'of', 'the', 'top', 'method']]
|
[-0.12464814733859178, 0.14223090386024762, -0.059251294720666946, 0.1267794056569312, -0.06190313117129477, -0.12057488768011437, 0.09291873758011465, 0.41714113274529735, -0.26232076510712704, -0.3261543805137151, 0.10611069849973002, -0.31141672284174743, -0.12542435938347105, 0.18721836227890606, -0.049297016362617525, -0.03451716398460302, 0.04783079013433175, -0.026904967682872045, -0.0017165940486931685, -0.19567633111109126, 0.26188949178507986, 0.08488689485197583, 0.30691814236342907, 0.04806519714547387, 0.09882239224091965, -0.0025041923917671466, -0.07317372008576883, -0.03820202781217947, -0.10790472757840135, 0.15308857257399502, 0.2305082930194161, 0.06192474245879773, 0.2958101424741962, -0.4306479693383824, -0.1297969652755939, 0.1071740283353373, 0.05304124318261413, 0.023226403589987902, 0.01256962434193846, -0.2418557397727293, 0.024356524027382018, -0.19811767680530853, -0.07252894170212408, -0.028218450665421096, 0.06625719210265059, 0.056854318893029096, -0.30540578016484526, 0.1003806402457627, -0.027563171474434805, 0.09489229908014865, -0.07413105319042736, -0.08869236543550031, -0.05158991094493697, 0.2013086367801826, 0.1508046786865576, -0.009119509897650556, 0.1042605759047553, -0.12055058020880406, -0.10424463914258154, 0.35319343553393656, -0.07721432787531339, -0.10405974113712656, 0.20418859821420612, -0.14252102773980047, -0.09029499053334196, 0.10235987189523083, 0.21821883550666749, 0.03121598388385424, -0.13006407383704272, 0.009736285826062506, 0.0019416444611253469, 0.20405774382405406, 0.06564660259714046, 0.004682374336254776, 0.17342947322879596, 0.1528508508667112, 0.08938483865469271, 0.0875038192029514, -0.11560116672858675, -0.1683045273732579, -0.2106608281701354, -0.11355282062440054, -0.05835769706280202, 0.01822560413819837, -0.16622186515817555, -0.1118481849726448, 0.3803771320492663, 0.15488341840723832, 0.19103669291956626, 0.05111785526288316, 0.2516044195847097, 0.07821904769223448, 0.05560849820996853, 0.09142995631678942, 0.1921465583013516, 0.05700805082468065, 0.14657858912486266, -0.257443907102636, 0.17447431804282024, -0.01243992137775512]
|
1,803.09433
|
Non-trivial surface states of samarium hexaboride at the (111) surface
|
The peculiar metallic electronic states observed in the Kondo insulator,
samarium hexaboride (SmB$_6$), has stimulated considerable attention among
those studying non-trivial electronic phenomena. However, experimental studies
of these states have led to controversial conclusions mainly to the difficulty
and inhomogeneity of the SmB$_6$ crystal surface. Here, we show the detailed
electronic structure of SmB$_6$ with angle-resolved photoelectron spectroscopy
measurements of the three-fold (111) surface where only two inequivalent
time-reversal-invariant momenta (TRIM) exist. We observe the metallic
two-dimensional state was dispersed across the bulk Kondo gap. Its helical
in-plane spin polarisation around the surface TRIM suggests that SmB$_6$ is
topologically non-trivial, according to the topological classification theory
for weakly correlated systems. Based on these results, we propose a simple
picture of the controversial topological classification of SmB$_6$.
|
cond-mat.str-el
|
the peculiar metallic electronic states observed in the kondo insulator samarium hexaboride smb_6 has stimulated considerable attention among those studying nontrivial electronic phenomena however experimental studies of these states have led to controversial conclusions mainly to the difficulty and inhomogeneity of the smb_6 crystal surface here we show the detailed electronic structure of smb_6 with angleresolved photoelectron spectroscopy measurements of the threefold 111 surface where only two inequivalent timereversalinvariant momenta trim exist we observe the metallic twodimensional state was dispersed across the bulk kondo gap its helical inplane spin polarisation around the surface trim suggests that smb_6 is topologically nontrivial according to the topological classification theory for weakly correlated systems based on these results we propose a simple picture of the controversial topological classification of smb_6
|
[['the', 'peculiar', 'metallic', 'electronic', 'states', 'observed', 'in', 'the', 'kondo', 'insulator', 'samarium', 'hexaboride', 'smb_6', 'has', 'stimulated', 'considerable', 'attention', 'among', 'those', 'studying', 'nontrivial', 'electronic', 'phenomena', 'however', 'experimental', 'studies', 'of', 'these', 'states', 'have', 'led', 'to', 'controversial', 'conclusions', 'mainly', 'to', 'the', 'difficulty', 'and', 'inhomogeneity', 'of', 'the', 'smb_6', 'crystal', 'surface', 'here', 'we', 'show', 'the', 'detailed', 'electronic', 'structure', 'of', 'smb_6', 'with', 'angleresolved', 'photoelectron', 'spectroscopy', 'measurements', 'of', 'the', 'threefold', '111', 'surface', 'where', 'only', 'two', 'inequivalent', 'timereversalinvariant', 'momenta', 'trim', 'exist', 'we', 'observe', 'the', 'metallic', 'twodimensional', 'state', 'was', 'dispersed', 'across', 'the', 'bulk', 'kondo', 'gap', 'its', 'helical', 'inplane', 'spin', 'polarisation', 'around', 'the', 'surface', 'trim', 'suggests', 'that', 'smb_6', 'is', 'topologically', 'nontrivial', 'according', 'to', 'the', 'topological', 'classification', 'theory', 'for', 'weakly', 'correlated', 'systems', 'based', 'on', 'these', 'results', 'we', 'propose', 'a', 'simple', 'picture', 'of', 'the', 'controversial', 'topological', 'classification', 'of', 'smb_6']]
|
[-0.18390343837173923, 0.20370801476048425, -0.10470806983196074, 0.04189153923930246, -0.07663514635836084, -0.19367504371182312, 0.1156447899873398, 0.42326287442212185, -0.24971532972071261, -0.30065882786931025, -0.043482345005031675, -0.3561266221786066, -0.16737454047330494, 0.16245609995657725, -0.010075339892258247, 0.06513929972713832, -2.6551814424613165e-05, -0.08642513537409878, -0.15309370416475254, -0.22035682001631587, 0.32017459669741727, -0.034311963200923945, 0.36685136935326257, 0.12057372467825189, 0.010087201501139335, -0.03713701475071647, 0.08289214565477793, 0.019754251307613376, -0.18078734829038104, 0.08051532437925094, 0.28433116644413936, -0.13986138134662593, 0.17381753180811685, -0.46429493220611695, -0.23779821924362626, -0.016206204262931668, 0.08767617552999467, 0.1669041807098048, -0.1088522614759674, -0.31915170861969866, 0.04989828073303215, -0.1368485117212884, -0.10226461808714601, -0.1287537666651169, -0.01435618500949608, -0.1081448071858003, -0.07998104899103517, 0.087093596324502, 0.03834415317535223, 0.12734757040420341, -0.11395700109128412, -0.12375880457231746, -0.145213508697611, 0.04157912897478257, 0.08270871032968104, 0.03420387786288288, 0.12162694897842667, -0.10032265914681678, -0.1491761211756735, 0.3512685975237262, 0.006070761699303393, -0.07938711526101484, 0.20585052531752143, -0.22570101285375477, -0.15404823440910567, 0.17419455442134113, 0.08143680659630927, 0.10839649068842096, -0.08054886653415105, 0.07508578676765504, -0.10752947967211228, 0.1782827296198183, -0.00968688272590202, 0.14031387420578134, 0.3025373043566351, 0.19724603241128433, -0.0002977568083368833, 0.12637217264688974, -0.14386557414850576, -0.03833245839332304, -0.18051940532371638, -0.17507451754719358, -0.2616590086429838, 0.09824145229954627, 0.02945970170699256, -0.22946241562483863, 0.45832797303234063, 0.11659099492392251, 0.17063648399106035, -0.12405737411320424, 0.202386748903091, 0.042553826352573994, 0.03354228598006543, -0.0035186244529627616, 0.2643157805922249, 0.18400549423688697, 0.06805321626320836, -0.3149074442155238, 0.1010659247570272, -0.012354077889569222]
|
1,803.09434
|
Goos-H\"anchen-like shifts at metal/superconductor interface
|
At a normal-metal/superconductor interface, an incident electron from the
normal-metal (N) side can be normally reflected as an electron or Andreev
reflected as a hole. We show that pronounced lateral shifts along the interface
between the incident and the reflected quasiparticles can happen in both
reflection processes, which are analogous to the Goos-H\"anchen effect in
optics. Two concrete model systems are considered. For the simplest model in
which the N side is of the two-dimensional electron gas, we find that while the
shift in Andreev reflection stays positive, the shift in normal reflection can
be made either positive or negative, depending on the excitation energy. For
the second model with the N side taken by graphene, the shift in Andreev
reflection can also be made negative, and the shifts have rich behavior due to
the additional sublattice pseudospin degree of freedom. We show that the shift
strongly modifies the dispersion for the confined waveguide modes in an SNS
structure. We also suggest a possible experimental setup for detecting the
shift.
|
cond-mat.mes-hall
|
at a normalmetalsuperconductor interface an incident electron from the normalmetal n side can be normally reflected as an electron or andreev reflected as a hole we show that pronounced lateral shifts along the interface between the incident and the reflected quasiparticles can happen in both reflection processes which are analogous to the gooshanchen effect in optics two concrete model systems are considered for the simplest model in which the n side is of the twodimensional electron gas we find that while the shift in andreev reflection stays positive the shift in normal reflection can be made either positive or negative depending on the excitation energy for the second model with the n side taken by graphene the shift in andreev reflection can also be made negative and the shifts have rich behavior due to the additional sublattice pseudospin degree of freedom we show that the shift strongly modifies the dispersion for the confined waveguide modes in an sns structure we also suggest a possible experimental setup for detecting the shift
|
[['at', 'a', 'normalmetalsuperconductor', 'interface', 'an', 'incident', 'electron', 'from', 'the', 'normalmetal', 'n', 'side', 'can', 'be', 'normally', 'reflected', 'as', 'an', 'electron', 'or', 'andreev', 'reflected', 'as', 'a', 'hole', 'we', 'show', 'that', 'pronounced', 'lateral', 'shifts', 'along', 'the', 'interface', 'between', 'the', 'incident', 'and', 'the', 'reflected', 'quasiparticles', 'can', 'happen', 'in', 'both', 'reflection', 'processes', 'which', 'are', 'analogous', 'to', 'the', 'gooshanchen', 'effect', 'in', 'optics', 'two', 'concrete', 'model', 'systems', 'are', 'considered', 'for', 'the', 'simplest', 'model', 'in', 'which', 'the', 'n', 'side', 'is', 'of', 'the', 'twodimensional', 'electron', 'gas', 'we', 'find', 'that', 'while', 'the', 'shift', 'in', 'andreev', 'reflection', 'stays', 'positive', 'the', 'shift', 'in', 'normal', 'reflection', 'can', 'be', 'made', 'either', 'positive', 'or', 'negative', 'depending', 'on', 'the', 'excitation', 'energy', 'for', 'the', 'second', 'model', 'with', 'the', 'n', 'side', 'taken', 'by', 'graphene', 'the', 'shift', 'in', 'andreev', 'reflection', 'can', 'also', 'be', 'made', 'negative', 'and', 'the', 'shifts', 'have', 'rich', 'behavior', 'due', 'to', 'the', 'additional', 'sublattice', 'pseudospin', 'degree', 'of', 'freedom', 'we', 'show', 'that', 'the', 'shift', 'strongly', 'modifies', 'the', 'dispersion', 'for', 'the', 'confined', 'waveguide', 'modes', 'in', 'an', 'sns', 'structure', 'we', 'also', 'suggest', 'a', 'possible', 'experimental', 'setup', 'for', 'detecting', 'the', 'shift']]
|
[-0.16211970896658706, 0.20843523834679645, -0.07257419455632129, 0.0418541425756891, -0.0731000181287527, -0.18282610370010577, 0.03839717850445167, 0.41471751748091157, -0.2892550719354083, -0.27650455415029734, 0.018307955552796448, -0.32920610310838505, -0.13381518301800552, 0.19194657342809746, -0.0007487809532048071, -0.031122088339179753, -0.010837313443805804, 0.039400173216948615, -0.05507920114494696, -0.148596381742562, 0.3287105402717476, 0.03674663296654163, 0.28276631561491417, 0.10801850830834797, 0.034313364636481686, 0.04257460123010199, 0.07286478684502928, 0.028632463388802373, -0.06868895297037157, 0.058434444326249994, 0.21734796611811308, -0.04793305719161735, 0.17049406921518417, -0.4549335803288747, -0.21517086056376095, 0.04359237413086435, 0.16400513688294108, 0.15464549682322232, -0.08049443183151786, -0.287191532250932, -0.011346310195307631, -0.13388334445540642, -0.14517596046275952, 0.01763954996405279, -0.013688280789510293, -0.021436254835263003, -0.24777000492664655, 0.06538155539036619, 0.07002680179909529, 0.023059215856825604, -0.04230125077780993, -0.10220621571163921, -0.09420305606977576, 0.10438764573567931, 0.02217733035179074, -0.033332961629254414, 0.11540910165041329, -0.10249493534793146, -0.10825651678366258, 0.36813546370078043, -0.08160074594540193, -0.1781160253305536, 0.15513127584777334, -0.2236536371987313, -0.0387345451512374, 0.16629964737358557, 0.15745250415330864, 0.0793086893746958, -0.08932027096127379, 0.061977789976277994, -0.053032274189514714, 0.17889687969787593, 0.12581735777339953, 0.0515047126203118, 0.25577685427851976, 0.09894133114755865, 0.09331078885657275, 0.1441247544477365, -0.11244005453088046, -0.027816095942569733, -0.2905706293113968, -0.16503874462317017, -0.16328451697550275, 0.04471508419579443, -0.03166522245070048, -0.1614796236581991, 0.3605248900760403, 0.11538870785426458, 0.22682661397711318, -0.042780861461206396, 0.29421555803102606, 0.2038882231572643, 0.055522645831875064, 0.044518444511820285, 0.23248192339601434, 0.12135141500792301, 0.07684937628287383, -0.2934176667334909, 0.07860236220773967, -0.03548415422521751]
|
1,803.09435
|
Unpopularity Factor in the Marriage and Roommates Problems
|
Given a set $A$ of $n$ people, with each person having a preference list that
ranks a subset of $A$ as his/her acceptable partners in order of preference, we
consider the Roommates Problem (RP) and the Marriage Problem (MP) of matching
people with their partners. In RP there is no further restriction, while in MP
only people of opposite genders can be acceptable partners. For a pair of
matchings $X$ and $Y$, let $\phi(X,Y)$ denote the number of people who prefer a
person they get matched by $X$ to a person they get matched by $Y$, and define
an unpopularity factor $u(M)$ of a matching $M$ to be the maximum ratio
$\phi(M',M) / \phi(M,M')$ among all other possible matchings $M'$. In this
paper, we develop an algorithm to compute the unpopularity factor of a given
matching in $O(m\sqrt{n}\log^2 n)$ time for RP and in $O(m\sqrt{n}\log n)$ time
for MP, where $m$ is the total length of people's preference lists. We also
generalize the notion of unpopularity factor to a weighted setting where people
are given different voting weights and show that our algorithm can be slightly
modified to support that setting with the same running time.
|
cs.DS
|
given a set a of n people with each person having a preference list that ranks a subset of a as hisher acceptable partners in order of preference we consider the roommates problem rp and the marriage problem mp of matching people with their partners in rp there is no further restriction while in mp only people of opposite genders can be acceptable partners for a pair of matchings x and y let phixy denote the number of people who prefer a person they get matched by x to a person they get matched by y and define an unpopularity factor um of a matching m to be the maximum ratio phimm phimm among all other possible matchings m in this paper we develop an algorithm to compute the unpopularity factor of a given matching in omsqrtnlog2 n time for rp and in omsqrtnlog n time for mp where m is the total length of peoples preference lists we also generalize the notion of unpopularity factor to a weighted setting where people are given different voting weights and show that our algorithm can be slightly modified to support that setting with the same running time
|
[['given', 'a', 'set', 'a', 'of', 'n', 'people', 'with', 'each', 'person', 'having', 'a', 'preference', 'list', 'that', 'ranks', 'a', 'subset', 'of', 'a', 'as', 'hisher', 'acceptable', 'partners', 'in', 'order', 'of', 'preference', 'we', 'consider', 'the', 'roommates', 'problem', 'rp', 'and', 'the', 'marriage', 'problem', 'mp', 'of', 'matching', 'people', 'with', 'their', 'partners', 'in', 'rp', 'there', 'is', 'no', 'further', 'restriction', 'while', 'in', 'mp', 'only', 'people', 'of', 'opposite', 'genders', 'can', 'be', 'acceptable', 'partners', 'for', 'a', 'pair', 'of', 'matchings', 'x', 'and', 'y', 'let', 'phixy', 'denote', 'the', 'number', 'of', 'people', 'who', 'prefer', 'a', 'person', 'they', 'get', 'matched', 'by', 'x', 'to', 'a', 'person', 'they', 'get', 'matched', 'by', 'y', 'and', 'define', 'an', 'unpopularity', 'factor', 'um', 'of', 'a', 'matching', 'm', 'to', 'be', 'the', 'maximum', 'ratio', 'phimm', 'phimm', 'among', 'all', 'other', 'possible', 'matchings', 'm', 'in', 'this', 'paper', 'we', 'develop', 'an', 'algorithm', 'to', 'compute', 'the', 'unpopularity', 'factor', 'of', 'a', 'given', 'matching', 'in', 'omsqrtnlog2', 'n', 'time', 'for', 'rp', 'and', 'in', 'omsqrtnlog', 'n', 'time', 'for', 'mp', 'where', 'm', 'is', 'the', 'total', 'length', 'of', 'peoples', 'preference', 'lists', 'we', 'also', 'generalize', 'the', 'notion', 'of', 'unpopularity', 'factor', 'to', 'a', 'weighted', 'setting', 'where', 'people', 'are', 'given', 'different', 'voting', 'weights', 'and', 'show', 'that', 'our', 'algorithm', 'can', 'be', 'slightly', 'modified', 'to', 'support', 'that', 'setting', 'with', 'the', 'same', 'running', 'time']]
|
[-0.13546706077249837, 0.10101697819618494, -0.0788557386258617, 0.04438011794081831, -0.09332638002888416, -0.19092095772612083, 0.125247591735994, 0.3938000046787238, -0.23778921094102165, -0.35609595251541276, 0.04404912458388329, -0.3082420929761914, -0.09461131664405305, 0.09294175732914785, -0.12418105953353613, -0.022391661414682556, 0.051901906488637906, 0.12903342480179467, -0.01086051106085506, -0.3239864336125417, 0.2826042907909141, -0.003473785619765598, 0.19791857407957045, 0.00589900978350973, 0.0837820203303939, 0.04003002033520412, -0.009162039343209472, 0.051424109596761504, -0.10437410474450341, 0.1185913332895628, 0.29348614504245535, 0.16333093317613626, 0.29524314747929264, -0.35103473098327714, -0.11314201264637329, 0.18701651808563233, 0.13517519689958135, 0.034274906997021994, -0.0037334235372933713, -0.2576742781736054, 0.16193588755534924, -0.1669802443405691, -0.086685974735398, 0.006966563930594323, 0.0833061388451218, -0.0006274538915628606, -0.32901859413444373, -0.0029571573554676434, 0.0335965565633766, 0.02130471203660515, -0.0037390143309797472, -0.14760296226571276, -0.024222962033187894, 0.15290922524097064, 0.04267503393627218, 0.05828748640002838, 0.062216063056136285, -0.12742113100648567, -0.13787786306541724, 0.40407607935291406, -0.04294661767986933, -0.199621628530925, 0.12826802071018997, -0.12215944505442167, -0.108732065615186, 0.0774502945120427, 0.15937288541075154, 0.16485241537642045, -0.10057509382507608, 0.05400875765523475, -0.14032159710041014, 0.17526001170820868, 0.14937120368267642, -0.018681969785272184, 0.18195811766933426, 0.1210723925299438, 0.13350278692450956, 0.07195997817901419, -0.013759060905916462, -0.028384969810152445, -0.2479018615752769, -0.16630459083292712, -0.14890736164913201, 0.04192738267496073, -0.12955352044529414, -0.14140591979473052, 0.36952202786536265, 0.12123334162606625, 0.24192631194697847, 0.11637696074224853, 0.2219240353309336, 0.07625694093144375, 0.03267653464960555, 0.11144334614558223, 0.11951073144882685, 0.050320624066444, 0.05719663726813451, -0.1518435928131415, 0.08448105407539212, 0.056485069862295255]
|
1,803.09436
|
Numerical Complete Solution for Random Genetic Drift by Energetic
Variational Approach
|
In this paper, we focus on numerical solutions for random genetic drift
problem, which is governed by a degenerated convection-dominated parabolic
equation. Due to the fixation phenomenon of genes, Dirac delta singularities
will develop at boundary points as time evolves. Based on an energetic
variational approach (EnVarA), a balance between the maximal dissipation
principle (MDP) and least action principle (LAP), we obtain the trajectory
equation. In turn, a numerical scheme is proposed using a convex splitting
technique, with the unique solvability (on a convex set) and the energy decay
property (in time) justified at a theoretical level. Numerical examples are
presented for cases of pure drift and drift with semi-selection. The remarkable
advantage of this method is its ability to catch the Dirac delta singularity
close to machine precision over any equidistant grid.
|
math.NA
|
in this paper we focus on numerical solutions for random genetic drift problem which is governed by a degenerated convectiondominated parabolic equation due to the fixation phenomenon of genes dirac delta singularities will develop at boundary points as time evolves based on an energetic variational approach envara a balance between the maximal dissipation principle mdp and least action principle lap we obtain the trajectory equation in turn a numerical scheme is proposed using a convex splitting technique with the unique solvability on a convex set and the energy decay property in time justified at a theoretical level numerical examples are presented for cases of pure drift and drift with semiselection the remarkable advantage of this method is its ability to catch the dirac delta singularity close to machine precision over any equidistant grid
|
[['in', 'this', 'paper', 'we', 'focus', 'on', 'numerical', 'solutions', 'for', 'random', 'genetic', 'drift', 'problem', 'which', 'is', 'governed', 'by', 'a', 'degenerated', 'convectiondominated', 'parabolic', 'equation', 'due', 'to', 'the', 'fixation', 'phenomenon', 'of', 'genes', 'dirac', 'delta', 'singularities', 'will', 'develop', 'at', 'boundary', 'points', 'as', 'time', 'evolves', 'based', 'on', 'an', 'energetic', 'variational', 'approach', 'envara', 'a', 'balance', 'between', 'the', 'maximal', 'dissipation', 'principle', 'mdp', 'and', 'least', 'action', 'principle', 'lap', 'we', 'obtain', 'the', 'trajectory', 'equation', 'in', 'turn', 'a', 'numerical', 'scheme', 'is', 'proposed', 'using', 'a', 'convex', 'splitting', 'technique', 'with', 'the', 'unique', 'solvability', 'on', 'a', 'convex', 'set', 'and', 'the', 'energy', 'decay', 'property', 'in', 'time', 'justified', 'at', 'a', 'theoretical', 'level', 'numerical', 'examples', 'are', 'presented', 'for', 'cases', 'of', 'pure', 'drift', 'and', 'drift', 'with', 'semiselection', 'the', 'remarkable', 'advantage', 'of', 'this', 'method', 'is', 'its', 'ability', 'to', 'catch', 'the', 'dirac', 'delta', 'singularity', 'close', 'to', 'machine', 'precision', 'over', 'any', 'equidistant', 'grid']]
|
[-0.11960440734045878, 0.06645490481255607, -0.09591821156076034, 0.0534413960266446, -0.0940877520159342, -0.16945128655061126, 0.0665778469530695, 0.3471159157876409, -0.3166426415270806, -0.25307544631499596, 0.09222222603582031, -0.2752548451019977, -0.13660778036298415, 0.2000596432041071, -0.07238099135046128, 0.08570884496377042, 0.12403597246912372, 0.029442894812815517, -0.05946211628829136, -0.22563468021934296, 0.3106723368160768, 0.03768006623620416, 0.2531096865973997, 0.05198334531062318, 0.16715976750151118, -0.046903027742319095, 0.03409679307964922, 0.035705265646252426, -0.1358925087438747, 0.09317895521157428, 0.22723138287933614, 0.07598869973359956, 0.3438836437657134, -0.38625550143534443, -0.19945775270497582, 0.09667563159018755, 0.12808481892855225, 0.1039606143635136, -0.057877486179767616, -0.2741926462737886, 0.08730537396898308, -0.11171315037396573, -0.1839841721892243, -0.055693339826610254, -0.014254769235707194, 0.016353708379084373, -0.2921198949374202, 0.09453555881863332, 0.04855202331797767, 0.04160431073623077, -0.05896438283309028, -0.08801054415996862, -0.005559602529272608, 0.05351995372121002, 0.05959704349293793, 0.02107634556498414, 0.06317718138292659, -0.06325495467194221, -0.11895290926500501, 0.371062439930348, -0.05944375862644715, -0.2724948072851989, 0.1798647855468919, -0.1317148883258284, -0.09644845778030123, 0.17105315475793953, 0.18116556234544015, 0.14299156460093462, -0.15095045887474112, 0.10152166432972984, -0.014731727034841728, 0.11870470472775002, 0.07673999355423428, -0.020359207410365343, 0.14752119878406517, 0.2017507588789436, 0.1557255072389438, 0.0838516605307014, -0.06899565088256966, -0.135623081747215, -0.3342213180762154, -0.1378950179405226, -0.1904336269784946, 0.06780131727471266, -0.08495795958151575, -0.17296898183021836, 0.3939809030880705, 0.11328932653245238, 0.15826897880147772, 0.07341165240153756, 0.26834074800962027, 0.1775118250717304, 0.0022271149685137146, 0.07761786103258371, 0.1960649759053672, 0.12437223269646802, 0.09725863399527938, -0.2821989807687728, 0.053237112839741786, 0.13241320433635406]
|
1,803.09437
|
Cascaded multi-scale and multi-dimension convolutional neural network
for stereo matching
|
Convolutional neural networks(CNN) have been shown to perform better than the
conventional stereo algorithms for stereo estimation. Numerous efforts focus on
the pixel-wise matching cost computation, which is the important building block
for many start-of-the-art algorithms. However, those architectures are limited
to small and single scale receptive fields and use traditional methods for cost
aggregation or even ignore cost aggregation. Differently we take them both into
consideration. Firstly, we propose a new multi-scale matching cost computation
sub-network, in which two different sizes of receptive fields are implemented
parallelly. In this way, the network can make the best use of both variants and
balance the trade-off between the increase of receptive field and the loss of
detail. Furthermore, we show that our multi-dimension aggregation sub-network
which containing 2D convolution and 3D convolution operations can provide rich
context and semantic information for estimating an accurate initial disparity.
Finally, experiments on challenging stereo benchmark KITTI demonstrate that the
proposed method can achieve competitive results even without any additional
post-processing.
|
cs.CV
|
convolutional neural networkscnn have been shown to perform better than the conventional stereo algorithms for stereo estimation numerous efforts focus on the pixelwise matching cost computation which is the important building block for many startoftheart algorithms however those architectures are limited to small and single scale receptive fields and use traditional methods for cost aggregation or even ignore cost aggregation differently we take them both into consideration firstly we propose a new multiscale matching cost computation subnetwork in which two different sizes of receptive fields are implemented parallelly in this way the network can make the best use of both variants and balance the tradeoff between the increase of receptive field and the loss of detail furthermore we show that our multidimension aggregation subnetwork which containing 2d convolution and 3d convolution operations can provide rich context and semantic information for estimating an accurate initial disparity finally experiments on challenging stereo benchmark kitti demonstrate that the proposed method can achieve competitive results even without any additional postprocessing
|
[['convolutional', 'neural', 'networkscnn', 'have', 'been', 'shown', 'to', 'perform', 'better', 'than', 'the', 'conventional', 'stereo', 'algorithms', 'for', 'stereo', 'estimation', 'numerous', 'efforts', 'focus', 'on', 'the', 'pixelwise', 'matching', 'cost', 'computation', 'which', 'is', 'the', 'important', 'building', 'block', 'for', 'many', 'startoftheart', 'algorithms', 'however', 'those', 'architectures', 'are', 'limited', 'to', 'small', 'and', 'single', 'scale', 'receptive', 'fields', 'and', 'use', 'traditional', 'methods', 'for', 'cost', 'aggregation', 'or', 'even', 'ignore', 'cost', 'aggregation', 'differently', 'we', 'take', 'them', 'both', 'into', 'consideration', 'firstly', 'we', 'propose', 'a', 'new', 'multiscale', 'matching', 'cost', 'computation', 'subnetwork', 'in', 'which', 'two', 'different', 'sizes', 'of', 'receptive', 'fields', 'are', 'implemented', 'parallelly', 'in', 'this', 'way', 'the', 'network', 'can', 'make', 'the', 'best', 'use', 'of', 'both', 'variants', 'and', 'balance', 'the', 'tradeoff', 'between', 'the', 'increase', 'of', 'receptive', 'field', 'and', 'the', 'loss', 'of', 'detail', 'furthermore', 'we', 'show', 'that', 'our', 'multidimension', 'aggregation', 'subnetwork', 'which', 'containing', '2d', 'convolution', 'and', '3d', 'convolution', 'operations', 'can', 'provide', 'rich', 'context', 'and', 'semantic', 'information', 'for', 'estimating', 'an', 'accurate', 'initial', 'disparity', 'finally', 'experiments', 'on', 'challenging', 'stereo', 'benchmark', 'kitti', 'demonstrate', 'that', 'the', 'proposed', 'method', 'can', 'achieve', 'competitive', 'results', 'even', 'without', 'any', 'additional', 'postprocessing']]
|
[-0.05618022872536185, 0.017159750871027186, -0.040742839466365255, 0.08892998634767438, -0.08758717235065548, -0.1760346221594499, 0.0018645586103694625, 0.479047576773418, -0.2657781525750656, -0.35845066011176413, 0.08835255725068007, -0.21991081109129493, -0.19438251919892943, 0.193721111654865, -0.11321746459874571, 0.1118724025920572, 0.15738049082749758, 0.014845091629533534, -0.08780172055377485, -0.3023981590241934, 0.27424121291393483, 0.048352694523195364, 0.3500476843980421, 0.016861287613275898, 0.12158160840149924, -0.01967208859852953, -0.04000813467848866, 0.03681008043174396, -0.055136330902358345, 0.18591074647903666, 0.24975621337856513, 0.16765850988716022, 0.31493185584837324, -0.4956113743379779, -0.2534469631205997, 0.09407107808335449, 0.1772056907844584, 0.1199956628029706, -0.03739878349356825, -0.2724338197976867, 0.07408450982471682, -0.1557832513192489, 0.05278115772434611, -0.16239531275098135, -0.039887718384361726, 0.006910319497573178, -0.33086659197123297, 0.02869004901661257, 0.045104426528882594, 0.05234980997797775, -0.01987086834262563, -0.13790751271179866, 0.010056997835916659, 0.20263923463798744, -0.007894731232621539, 0.036178582321981484, 0.13251443148916026, -0.1926130401026682, -0.12237926267917795, 0.35654601632022714, -0.02282807762190736, -0.2171676303582625, 0.2323701009322631, -0.05351440381000649, -0.14512646016215972, 0.09722547874405857, 0.21881160740032288, 0.10106081872651107, -0.14808462086661034, 0.026298471429828465, -0.03349770666296448, 0.1830708533525467, 0.08090764235323632, 0.04625103654093053, 0.15433145096211368, 0.2281029192528811, 0.0878416242562543, 0.143733013293661, -0.14043793075382063, -0.08959890942717622, -0.19877709381574069, -0.12200544306828504, -0.16953425567193203, -0.06329394897224426, -0.1409648743464053, -0.13840440446030522, 0.3800711834758341, 0.24736028807293847, 0.20845474861316798, 0.12052452457151432, 0.3835215014770223, 0.03409125441222463, 0.12501664422256087, 0.10614359876455133, 0.2085880602861429, 0.016168529446186297, 0.08207189762426248, -0.16442139752220408, 0.06836317013247858, 0.0827025501702699]
|
1,803.09438
|
Properties of the Black Hole Candidate XTE J1118+480 with the TCAF
solution during its Jet Activity Induced 2000 Outburst
|
Galactic black hole candidate (BHC) XTE~J1118+480 during its 2000 outburst
has been studied in a broad energy range using the archival data of PCA and
HEXTE payloads of {\it Rossi X-ray Timing Explorer}. Detailed spectral and
temporal properties of the source are studied. Low and very low frequency
quasi-periodic oscillations (QPOs), with a general trend of increasing
frequency are observed during the outburst. Spectral analysis is done using the
combined data of PCA and HEXTE instruments with two types of models: the well
known phenomenological power-law model and the current version of the {\it
fits} file of two-component advective flow (TCAF) solution as an additive table
model in XSPEC. During the entire period of the outburst, a non-thermal
power-law component and the TCAF model fitted sub-Keplerian halo rate were
found to be highly dominant. We suggest that this so-called outburst is due to
enhanced jet activity. Indeed, the `outburst' subsides when this activity
disappears. We estimated X-ray fluxes coming from the base of the jet and found
that the radio flux is correlated with this X-ray flux. Though the object was
in the hard state in the entire episode, the spectrum becomes slightly softer
with the rise in Keplerian disk rate in the late declining phase. We also
estimated the probable mass of the source from our spectral analysis with the
TCAF solution. Our estimated mass of XTE~J1118+480 is
$6.99^{+0.50}_{-0.74}~M_\odot$ i.e., in the range of $6.25-7.49~M_\odot$.
|
astro-ph.HE
|
galactic black hole candidate bhc xtej1118480 during its 2000 outburst has been studied in a broad energy range using the archival data of pca and hexte payloads of it rossi xray timing explorer detailed spectral and temporal properties of the source are studied low and very low frequency quasiperiodic oscillations qpos with a general trend of increasing frequency are observed during the outburst spectral analysis is done using the combined data of pca and hexte instruments with two types of models the well known phenomenological powerlaw model and the current version of the it fits file of twocomponent advective flow tcaf solution as an additive table model in xspec during the entire period of the outburst a nonthermal powerlaw component and the tcaf model fitted subkeplerian halo rate were found to be highly dominant we suggest that this socalled outburst is due to enhanced jet activity indeed the outburst subsides when this activity disappears we estimated xray fluxes coming from the base of the jet and found that the radio flux is correlated with this xray flux though the object was in the hard state in the entire episode the spectrum becomes slightly softer with the rise in keplerian disk rate in the late declining phase we also estimated the probable mass of the source from our spectral analysis with the tcaf solution our estimated mass of xtej1118480 is 699050_074m_odot ie in the range of 625749m_odot
|
[['galactic', 'black', 'hole', 'candidate', 'bhc', 'xtej1118480', 'during', 'its', '2000', 'outburst', 'has', 'been', 'studied', 'in', 'a', 'broad', 'energy', 'range', 'using', 'the', 'archival', 'data', 'of', 'pca', 'and', 'hexte', 'payloads', 'of', 'it', 'rossi', 'xray', 'timing', 'explorer', 'detailed', 'spectral', 'and', 'temporal', 'properties', 'of', 'the', 'source', 'are', 'studied', 'low', 'and', 'very', 'low', 'frequency', 'quasiperiodic', 'oscillations', 'qpos', 'with', 'a', 'general', 'trend', 'of', 'increasing', 'frequency', 'are', 'observed', 'during', 'the', 'outburst', 'spectral', 'analysis', 'is', 'done', 'using', 'the', 'combined', 'data', 'of', 'pca', 'and', 'hexte', 'instruments', 'with', 'two', 'types', 'of', 'models', 'the', 'well', 'known', 'phenomenological', 'powerlaw', 'model', 'and', 'the', 'current', 'version', 'of', 'the', 'it', 'fits', 'file', 'of', 'twocomponent', 'advective', 'flow', 'tcaf', 'solution', 'as', 'an', 'additive', 'table', 'model', 'in', 'xspec', 'during', 'the', 'entire', 'period', 'of', 'the', 'outburst', 'a', 'nonthermal', 'powerlaw', 'component', 'and', 'the', 'tcaf', 'model', 'fitted', 'subkeplerian', 'halo', 'rate', 'were', 'found', 'to', 'be', 'highly', 'dominant', 'we', 'suggest', 'that', 'this', 'socalled', 'outburst', 'is', 'due', 'to', 'enhanced', 'jet', 'activity', 'indeed', 'the', 'outburst', 'subsides', 'when', 'this', 'activity', 'disappears', 'we', 'estimated', 'xray', 'fluxes', 'coming', 'from', 'the', 'base', 'of', 'the', 'jet', 'and', 'found', 'that', 'the', 'radio', 'flux', 'is', 'correlated', 'with', 'this', 'xray', 'flux', 'though', 'the', 'object', 'was', 'in', 'the', 'hard', 'state', 'in', 'the', 'entire', 'episode', 'the', 'spectrum', 'becomes', 'slightly', 'softer', 'with', 'the', 'rise', 'in', 'keplerian', 'disk', 'rate', 'in', 'the', 'late', 'declining', 'phase', 'we', 'also', 'estimated', 'the', 'probable', 'mass', 'of', 'the', 'source', 'from', 'our', 'spectral', 'analysis', 'with', 'the', 'tcaf', 'solution', 'our', 'estimated', 'mass', 'of', 'xtej1118480', 'is', '699050_074m_odot', 'ie', 'in', 'the', 'range', 'of', '625749m_odot']]
|
[-0.07259590694338529, 0.10022801663245236, -0.09238811007414299, 0.10923228608185633, -0.07884645441340075, -0.11774393829564826, 0.030234479368266322, 0.4192513331818657, -0.22916853314854652, -0.3438452218905983, 0.14473482944184723, -0.3103371443407029, -0.03772223752756149, 0.22105600092755073, -0.04691869070560425, 0.0335977791406067, 0.07840619882385637, -0.026812286438563697, -0.04672227112345525, -0.18332134040359122, 0.26647180971802953, 0.12390357245587641, 0.20495954289152804, -0.021853208117998946, 0.060995849332987115, -0.028372988060045127, -0.08222239159515753, -0.03483811579246679, -0.09136116093322615, 0.03412187032194601, 0.21483163722725418, 0.11838444616868456, 0.16379785272252992, -0.36410088763914555, -0.26490065554538983, 0.06084151488468131, 0.15058609851811114, -0.0036620597800828963, -0.005751539582911975, -0.21553765441704956, 0.04304851972250244, -0.2690016330761087, -0.15379486994969094, 0.020762702874027383, 0.056049011405915596, 0.02874242812076695, -0.21455011536311516, 0.15431791970207312, 0.051567373381510705, 0.024071055366936274, -0.17979694224852258, -0.054311104086486414, -0.07491871492009865, 0.06743961111525508, 0.14565001168095756, 0.05341556270031704, 0.1369832595039167, -0.11061960142245118, -0.06648944499285525, 0.34283038733813626, -0.09035988140087096, 0.009057627748061195, 0.16644669675793594, -0.18450873891393152, -0.1567496501056589, 0.2009730602785722, 0.1149715032780734, 0.0895021963570044, -0.15110501954084488, 0.020600813584756423, -0.02833814646065649, 0.27211201440097177, 0.032725502868206836, 0.008421129499548154, 0.28147138467055555, 0.15449468449253637, -0.02525636227701942, 0.1766362420644444, -0.22085599442864332, -0.05525082015655298, -0.2279340826177922, -0.028853069515262023, -0.158397729953345, 0.05656177025018698, -0.11453184010626392, -0.15466918199597737, 0.44684795124464244, 0.06757706887701638, 0.22935658910721698, 0.00438076854408838, 0.3100858572950093, 0.14599677732932723, 0.04967257345641782, 0.1438574692210517, 0.31384132645275986, 0.1181720609519965, 0.18823111608712018, -0.2360575180918647, 0.07375544579261835, 0.011376804938842343]
|
1,803.09439
|
The spectrum of the singularity category of a category algebra
|
Let $\C$ be a finite projective EI category and $k$ be a field. The
singularity category of the category algebra $k\C$ is a tensor triangulated
category. We compute its spectrum in the sense of Balmer.
|
math.RT
|
let c be a finite projective ei category and k be a field the singularity category of the category algebra kc is a tensor triangulated category we compute its spectrum in the sense of balmer
|
[['let', 'c', 'be', 'a', 'finite', 'projective', 'ei', 'category', 'and', 'k', 'be', 'a', 'field', 'the', 'singularity', 'category', 'of', 'the', 'category', 'algebra', 'kc', 'is', 'a', 'tensor', 'triangulated', 'category', 'we', 'compute', 'its', 'spectrum', 'in', 'the', 'sense', 'of', 'balmer']]
|
[-0.1661892704665661, 0.0027010158502629826, -0.11037800961307116, 0.03237907313409128, -0.1268970942923001, -0.190110690678869, -0.07280958326799529, 0.36948410368391443, -0.44954521805047987, -0.11787283487085785, 0.07127776970488152, -0.2062053163402847, -0.0329771234520844, 0.10204584029104029, -0.19319886863231658, -0.19724658376570525, 0.10260610272442656, 0.1850016719794699, -0.044263542310467786, -0.2236323102244309, 0.4679136078272547, -0.020628812376941953, 0.234743316215463, 0.06271272780639785, 0.041931429292474474, -0.06073393173781889, 0.058771399541624955, 0.09598814644850791, -0.12466708792905723, 0.11019084073070969, 0.3748222285083362, 0.10563050444637026, 0.1945268713070878, -0.2760477422337447, -0.08442120549402067, 0.2184198993125132, 0.12599776946008207, 0.010278088466397354, 0.040919316107673305, -0.3106209533022983, 0.13237040641584566, -0.2869831978476473, -0.05342179143003055, -0.04016353176640613, 0.1450008455564135, -0.06077933316784245, -0.2790117600134441, -0.09298629816621543, 0.035479139909148215, 0.18108048899365323, -0.1347211055889992, -0.046624074876308444, -0.12761736512184144, 0.03982604322955012, -0.13418076834641396, 0.1156923605528261, 0.16805543363360423, -0.12331698877470834, -0.05509601783872183, 0.38001854323915074, -0.13219089939125947, -0.17632623384041446, 0.07000766939350538, -0.17458968165197541, -0.06664808206260205, 0.15795466314469064, -0.014098582842520305, 0.211204257234931, 0.03442989527913076, 0.34071355728000136, -0.13650541539703095, 0.05054728591016361, 0.03979775410677706, 0.0020330716855823995, 0.17257920205593108, 0.08165359672691141, -0.030485060012766293, 0.13276829814671406, -0.06258154496151422, 0.023817878322941917, -0.3935859075614384, -0.24900270700454713, -0.1124803792153086, 0.1734663241542876, -0.12011132822995672, -0.2400188180484942, 0.4148644438811711, 0.08934315546814885, 0.22225053390388244, 0.1500754044790353, 0.2164014567221914, 0.09194065928459168, 0.07570633712956416, 0.06813406996162874, 0.11959763446024486, 0.3351203607661383, -0.008063612958150251, -0.08094876134502037, -0.005694494077137538, 0.23162066981728588]
|
1,803.0944
|
The principle of maximum in the imitative control tasks
|
The article is devoted to the problem of applying the maximum principle for
finding optimal control parameters in simulation tasks of interest for a
variety of engineering and industrial systems and processes. Especially
important is the problem for such systems where it is practically impossible to
organize a control system because of an unknown model or because it is
impossible to strictly follow the specified trajectories of control parameters
in each particular case. A so-called delta-procedure is constructed that
converges and allows one to obtain an approximation and optimal control of the
system in a finite number of steps with a given accuracy delta. The theorem on
the delta-procedure is proved and illustrative examples are given. Some
features of the application of the proposed algorithm to real problems of
simulation control are discussed, e.g. the optimal number of points dividing
the time interval under consideration, and tasks for further individual
research.
|
math.OC
|
the article is devoted to the problem of applying the maximum principle for finding optimal control parameters in simulation tasks of interest for a variety of engineering and industrial systems and processes especially important is the problem for such systems where it is practically impossible to organize a control system because of an unknown model or because it is impossible to strictly follow the specified trajectories of control parameters in each particular case a socalled deltaprocedure is constructed that converges and allows one to obtain an approximation and optimal control of the system in a finite number of steps with a given accuracy delta the theorem on the deltaprocedure is proved and illustrative examples are given some features of the application of the proposed algorithm to real problems of simulation control are discussed eg the optimal number of points dividing the time interval under consideration and tasks for further individual research
|
[['the', 'article', 'is', 'devoted', 'to', 'the', 'problem', 'of', 'applying', 'the', 'maximum', 'principle', 'for', 'finding', 'optimal', 'control', 'parameters', 'in', 'simulation', 'tasks', 'of', 'interest', 'for', 'a', 'variety', 'of', 'engineering', 'and', 'industrial', 'systems', 'and', 'processes', 'especially', 'important', 'is', 'the', 'problem', 'for', 'such', 'systems', 'where', 'it', 'is', 'practically', 'impossible', 'to', 'organize', 'a', 'control', 'system', 'because', 'of', 'an', 'unknown', 'model', 'or', 'because', 'it', 'is', 'impossible', 'to', 'strictly', 'follow', 'the', 'specified', 'trajectories', 'of', 'control', 'parameters', 'in', 'each', 'particular', 'case', 'a', 'socalled', 'deltaprocedure', 'is', 'constructed', 'that', 'converges', 'and', 'allows', 'one', 'to', 'obtain', 'an', 'approximation', 'and', 'optimal', 'control', 'of', 'the', 'system', 'in', 'a', 'finite', 'number', 'of', 'steps', 'with', 'a', 'given', 'accuracy', 'delta', 'the', 'theorem', 'on', 'the', 'deltaprocedure', 'is', 'proved', 'and', 'illustrative', 'examples', 'are', 'given', 'some', 'features', 'of', 'the', 'application', 'of', 'the', 'proposed', 'algorithm', 'to', 'real', 'problems', 'of', 'simulation', 'control', 'are', 'discussed', 'eg', 'the', 'optimal', 'number', 'of', 'points', 'dividing', 'the', 'time', 'interval', 'under', 'consideration', 'and', 'tasks', 'for', 'further', 'individual', 'research']]
|
[-0.1269907630892508, 0.05226162681219343, -0.06303463947659221, 0.03559423911997786, -0.057930837102521886, -0.1485183894815511, 0.0546361150957594, 0.3477024546505621, -0.28456433598677183, -0.323961365942987, 0.15580831017835853, -0.24597233159132786, -0.15049707487103647, 0.27478241538253906, -0.08192349912836247, 0.11858209620711187, 0.0586145483019868, 0.06500630726375235, -0.03129526300218281, -0.2696971051744967, 0.2997212433756248, 0.03002273924523752, 0.28169667287635924, 0.03586942423564763, 0.1471002708632974, 0.0221733159648142, -0.006383392912954492, 0.027078055864162492, -0.09839856464458956, 0.11582674994758461, 0.29244147253772806, 0.1470360248568374, 0.328994839733479, -0.36892103113784086, -0.19909589933919025, 0.1405628913976002, 0.13803449426041275, 0.10021714153293296, -0.030041528210175167, -0.2230376266708735, 0.10888326318228254, -0.11585765271041318, -0.13609251906902328, -0.05899358090738322, 0.04059791637134532, 0.03172828388344121, -0.3263571088408564, 0.007607511072825865, 0.0599837209482446, 0.0405162985689763, -0.06860708587860763, -0.07971727154717699, 0.01944390656864083, 0.17915168844769716, 0.05656529228193623, 0.0048842811597598675, 0.11540781784390143, -0.11774254293062243, -0.1120063023276052, 0.4280298067594335, 0.04030104861407222, -0.23812900206711668, 0.17985125760791587, -0.07169961418031447, -0.12995039104115244, 0.10911211804580569, 0.18298383022896045, 0.1496510778681919, -0.13951324258818473, 0.09046010059638937, -0.0363762015633085, 0.15295595208014168, 0.02335254112946107, -0.0015928591398409748, 0.1424714333655925, 0.2033089511143356, 0.13203660276837198, 0.15328223522652515, -0.026034672146088025, -0.1303282679064862, -0.30237389519504404, -0.14556850063155136, -0.18707743995266674, 0.0029025300055892274, -0.05958112794222254, -0.16207245682309937, 0.38884761859194045, 0.17510248779087959, 0.17984574966932704, 0.041923323349289644, 0.2907594355110754, 0.14740252343862748, 0.008963622003574949, 0.05920727107198846, 0.18510468180182751, 0.113260051314469, 0.0661292237842193, -0.20082700150064037, 0.08462395432761452, 0.025268566993146436]
|
1,803.09441
|
Rigorous Results for the Ground States of the Spin-2 Bose-Hubbard Model
|
We present rigorous and universal results for the ground states of the $f=2$
spinor Bose-Hubbard model. The model includes three two-body on site
interaction terms, two of which are spin dependent while the other one is spin
independent. We prove that, depending only on the coefficients of the two spin
dependent terms, the ground state exhibits maximum or minimum total spin or
SU(5) ferromagnetism. Exact ground-state degeneracies and the forms of
ground-state wave function are also determined in each case. All these results
are valid regardless of dimension, lattice structure, or particle number. Our
approach takes advantage of the symmetry of the Hamiltonian and employs
mathematical tools including the Perron-Frobenius theorem and the Lie algebra
$\mathfrak{so}(5)$.
|
cond-mat.quant-gas cond-mat.stat-mech math-ph math.MP
|
we present rigorous and universal results for the ground states of the f2 spinor bosehubbard model the model includes three twobody on site interaction terms two of which are spin dependent while the other one is spin independent we prove that depending only on the coefficients of the two spin dependent terms the ground state exhibits maximum or minimum total spin or su5 ferromagnetism exact groundstate degeneracies and the forms of groundstate wave function are also determined in each case all these results are valid regardless of dimension lattice structure or particle number our approach takes advantage of the symmetry of the hamiltonian and employs mathematical tools including the perronfrobenius theorem and the lie algebra mathfrakso5
|
[['we', 'present', 'rigorous', 'and', 'universal', 'results', 'for', 'the', 'ground', 'states', 'of', 'the', 'f2', 'spinor', 'bosehubbard', 'model', 'the', 'model', 'includes', 'three', 'twobody', 'on', 'site', 'interaction', 'terms', 'two', 'of', 'which', 'are', 'spin', 'dependent', 'while', 'the', 'other', 'one', 'is', 'spin', 'independent', 'we', 'prove', 'that', 'depending', 'only', 'on', 'the', 'coefficients', 'of', 'the', 'two', 'spin', 'dependent', 'terms', 'the', 'ground', 'state', 'exhibits', 'maximum', 'or', 'minimum', 'total', 'spin', 'or', 'su5', 'ferromagnetism', 'exact', 'groundstate', 'degeneracies', 'and', 'the', 'forms', 'of', 'groundstate', 'wave', 'function', 'are', 'also', 'determined', 'in', 'each', 'case', 'all', 'these', 'results', 'are', 'valid', 'regardless', 'of', 'dimension', 'lattice', 'structure', 'or', 'particle', 'number', 'our', 'approach', 'takes', 'advantage', 'of', 'the', 'symmetry', 'of', 'the', 'hamiltonian', 'and', 'employs', 'mathematical', 'tools', 'including', 'the', 'perronfrobenius', 'theorem', 'and', 'the', 'lie', 'algebra', 'mathfrakso5']]
|
[-0.16536140673119445, 0.16571695652212307, -0.02743456951053492, 0.06784377763838635, -0.06561266020711126, -0.14409756166699889, 0.010624568873277769, 0.331544139131438, -0.22062106806271034, -0.2710521466676788, 0.07047111691469488, -0.28399746472834897, -0.11335352187823697, 0.1717398898256541, 0.07184782928530255, 0.034856328250968766, 0.03586421142219855, 0.0789472090224896, -0.1150142049521272, -0.24511343149111028, 0.3496514626975364, -0.05293774453457445, 0.2634097189835176, 0.08697376557593715, 0.12825570634871336, 0.06582010037201488, 0.04147326594603987, -0.043754486021874796, -0.12842431541057836, 0.09817702216166473, 0.17988238101554152, 0.051952886891364146, 0.17385726899976425, -0.4271346358662664, -0.1577732234476696, 0.07720953533987931, 0.13174002101656918, 0.15795979694692128, 0.032252031559092474, -0.27001004321460514, 0.01714555160865059, -0.18478345522528578, -0.13495427222344383, -0.10727414582727542, -0.020648299258780378, 0.013563937586350848, -0.25980714614481004, 0.11468074894444977, 0.08817862825877644, 0.06580067409106113, -0.10780257427791969, -0.18212027834519615, -0.08724665672494226, 0.11048027971189404, 0.029397029897342598, 0.008574472682084888, 0.12013854224190662, -0.10852165684778371, -0.12735808156591294, 0.3756232926148343, -0.03931422451920486, -0.2165435771144232, 0.1774115252051631, -0.14927997512357502, -0.14983787012270428, 0.09587671502758267, 0.08878493355386409, 0.09653571661128181, -0.10216731623925092, 0.13432985111661577, -0.049353362526619156, 0.15377306822558928, 0.011947623548370883, 0.08197609197091439, 0.1886005354402908, 0.11718714313886675, 0.08036325997191257, 0.12974900616270665, -0.07238699766357654, -0.1608104816645962, -0.3152899958257531, -0.13415951940435755, -0.22686856950267925, 0.04777930670150391, -0.11206987429488499, -0.16186068834865402, 0.4636616700104085, 0.110573848958352, 0.15776560551502966, 0.04713027263642289, 0.2323091720262992, 0.14302833520120878, 0.02657572137480923, 0.05075069494617718, 0.22401973614790316, 0.1559231852458244, -0.001990390963579432, -0.26175643031983153, 0.03081681064313984, 0.11803900843721028]
|
1,803.09442
|
Character values and Hochschild homology
|
We present a conjecture (and a proof for G=SL(2)) generalizing a result of J.
Arthur which expresses a character value of a cuspidal representation of a
$p$-adic group as a weighted orbital integral of its matrix coefficient. It
also generalizes a conjecture by the second author proved by Schneider-Stuhler
and (independently) the first author. The latter statement expresses an
elliptic character value as an orbital integral of a pseudo-matrix coefficient
defined via the Chern character map taking value in zeroth Hochschild homology
of the Hecke algebra. The present conjecture generalizes the construction of
pseudo-matrix coefficient using compactly supported Hochschild homology, as
well as a modification of the category of smooth representations, the so called
compactified category of smooth $G$-modules. This newly defined "compactified
pseudo-matrix coefficient" lies in a certain space on which the weighted
orbital integral is a conjugation invariant linear functional, our conjecture
states that evaluating a weighted orbital integral on the compactified
pseudo-matrix coefficient one recovers the corresponding character value of the
representation. We also discuss general properties of that space, building on
works of Waldspurger and Beuzart-Plessis.
|
math.RT
|
we present a conjecture and a proof for gsl2 generalizing a result of j arthur which expresses a character value of a cuspidal representation of a padic group as a weighted orbital integral of its matrix coefficient it also generalizes a conjecture by the second author proved by schneiderstuhler and independently the first author the latter statement expresses an elliptic character value as an orbital integral of a pseudomatrix coefficient defined via the chern character map taking value in zeroth hochschild homology of the hecke algebra the present conjecture generalizes the construction of pseudomatrix coefficient using compactly supported hochschild homology as well as a modification of the category of smooth representations the so called compactified category of smooth gmodules this newly defined compactified pseudomatrix coefficient lies in a certain space on which the weighted orbital integral is a conjugation invariant linear functional our conjecture states that evaluating a weighted orbital integral on the compactified pseudomatrix coefficient one recovers the corresponding character value of the representation we also discuss general properties of that space building on works of waldspurger and beuzartplessis
|
[['we', 'present', 'a', 'conjecture', 'and', 'a', 'proof', 'for', 'gsl2', 'generalizing', 'a', 'result', 'of', 'j', 'arthur', 'which', 'expresses', 'a', 'character', 'value', 'of', 'a', 'cuspidal', 'representation', 'of', 'a', 'padic', 'group', 'as', 'a', 'weighted', 'orbital', 'integral', 'of', 'its', 'matrix', 'coefficient', 'it', 'also', 'generalizes', 'a', 'conjecture', 'by', 'the', 'second', 'author', 'proved', 'by', 'schneiderstuhler', 'and', 'independently', 'the', 'first', 'author', 'the', 'latter', 'statement', 'expresses', 'an', 'elliptic', 'character', 'value', 'as', 'an', 'orbital', 'integral', 'of', 'a', 'pseudomatrix', 'coefficient', 'defined', 'via', 'the', 'chern', 'character', 'map', 'taking', 'value', 'in', 'zeroth', 'hochschild', 'homology', 'of', 'the', 'hecke', 'algebra', 'the', 'present', 'conjecture', 'generalizes', 'the', 'construction', 'of', 'pseudomatrix', 'coefficient', 'using', 'compactly', 'supported', 'hochschild', 'homology', 'as', 'well', 'as', 'a', 'modification', 'of', 'the', 'category', 'of', 'smooth', 'representations', 'the', 'so', 'called', 'compactified', 'category', 'of', 'smooth', 'gmodules', 'this', 'newly', 'defined', 'compactified', 'pseudomatrix', 'coefficient', 'lies', 'in', 'a', 'certain', 'space', 'on', 'which', 'the', 'weighted', 'orbital', 'integral', 'is', 'a', 'conjugation', 'invariant', 'linear', 'functional', 'our', 'conjecture', 'states', 'that', 'evaluating', 'a', 'weighted', 'orbital', 'integral', 'on', 'the', 'compactified', 'pseudomatrix', 'coefficient', 'one', 'recovers', 'the', 'corresponding', 'character', 'value', 'of', 'the', 'representation', 'we', 'also', 'discuss', 'general', 'properties', 'of', 'that', 'space', 'building', 'on', 'works', 'of', 'waldspurger', 'and', 'beuzartplessis']]
|
[-0.20705242954815428, 0.03666402567517556, -0.15007743074998467, 0.051569202557827036, -0.12915922922289205, -0.10613725734874606, -0.0011908261234768562, 0.2559424101594939, -0.318471729884752, -0.2117650916179021, 0.09170606895996672, -0.20778734041377903, -0.18626161308752165, 0.20204737173496848, -0.126682718600043, -0.0012800468911235738, 0.05155104813165963, 0.09445007350813184, -0.11181963566276762, -0.2796858799385114, 0.4099839922040701, -0.0031864918535575272, 0.20887675062937586, 0.08391390424739155, 0.13539870164693438, 0.08277859545519782, -0.02071520272228453, -0.055313311478756885, -0.1345501962309451, 0.18688433980019503, 0.2728843861143105, 0.01075223172083497, 0.20747566318863797, -0.30071679905263915, -0.1548072619452594, 0.09959760831099831, 0.09404075210914016, 0.022493694436788145, 0.020115353154768752, -0.3024064892922373, 0.06760313462776442, -0.22451865473865634, -0.1642589263514512, -0.07277442258653334, 0.07242751727155539, -0.01242129969307118, -0.26550771850678656, 0.061454062140223364, 0.09413390165104324, 0.12997140641560287, -0.127003763326987, -0.11608622009387343, -0.06291557889586935, 0.07767604681883111, 0.018119183784195532, 0.08189302454702556, 0.08972424472643373, -0.11066311345202848, -0.12405927423387766, 0.35159188917993256, -0.10842644851654767, -0.21647619572985505, 0.04589436074796443, -0.12930709526149764, -0.17734249053497075, 0.10356177518713391, 0.03745872836766972, 0.17864986899722782, -0.003811457852134481, 0.1642389249667758, -0.1568687449105912, 0.0972559023118164, 0.1160691788730522, -0.018388377776783375, 0.14151483201066084, 0.07227041358904292, 0.061154181603342295, 0.13156063666360246, -0.01860563329860775, -0.06650154411844496, -0.3279201933493217, -0.2415787192645237, -0.24051460650516673, 0.1171193251787271, -0.10110905206893221, -0.1856758640477589, 0.4188982115385847, 0.05790196004737583, 0.23408728760874106, 0.15166217152210365, 0.20203693786429033, 0.13190465332590975, 0.06878371714200411, 0.03161125008611836, 0.11890231588363855, 0.22277660344261677, 0.03139783316033168, -0.15364842573843715, 0.03860865026169146, 0.2791571327071223]
|
1,803.09443
|
Duality, Fundamentality, and Emergence
|
Dualities offer new possibilities for relating fundamentality and emergence.
In particular, as is the aim of this chapter to show, it may happen that the
relations of fundamentality and emergence between dual theories are inverted.
In other words, the direction of emergence typically found in these cases is
opposite to the direction of emergence followed in the standard accounts: that
is, while the standard emergence direction is that of decreasing
fundamentality---in that there is emergence of less fundamental, high-level
entities, out of more fundamental, low-level entities---in these cases of
duality, on the contrary, a more fundamental entity can emerge out of a less
fundamental one. In fact, this possibility can be traced back to the existence
of different classical limits in quantum field theories and string theories.
|
physics.hist-ph hep-th
|
dualities offer new possibilities for relating fundamentality and emergence in particular as is the aim of this chapter to show it may happen that the relations of fundamentality and emergence between dual theories are inverted in other words the direction of emergence typically found in these cases is opposite to the direction of emergence followed in the standard accounts that is while the standard emergence direction is that of decreasing fundamentalityin that there is emergence of less fundamental highlevel entities out of more fundamental lowlevel entitiesin these cases of duality on the contrary a more fundamental entity can emerge out of a less fundamental one in fact this possibility can be traced back to the existence of different classical limits in quantum field theories and string theories
|
[['dualities', 'offer', 'new', 'possibilities', 'for', 'relating', 'fundamentality', 'and', 'emergence', 'in', 'particular', 'as', 'is', 'the', 'aim', 'of', 'this', 'chapter', 'to', 'show', 'it', 'may', 'happen', 'that', 'the', 'relations', 'of', 'fundamentality', 'and', 'emergence', 'between', 'dual', 'theories', 'are', 'inverted', 'in', 'other', 'words', 'the', 'direction', 'of', 'emergence', 'typically', 'found', 'in', 'these', 'cases', 'is', 'opposite', 'to', 'the', 'direction', 'of', 'emergence', 'followed', 'in', 'the', 'standard', 'accounts', 'that', 'is', 'while', 'the', 'standard', 'emergence', 'direction', 'is', 'that', 'of', 'decreasing', 'fundamentalityin', 'that', 'there', 'is', 'emergence', 'of', 'less', 'fundamental', 'highlevel', 'entities', 'out', 'of', 'more', 'fundamental', 'lowlevel', 'entitiesin', 'these', 'cases', 'of', 'duality', 'on', 'the', 'contrary', 'a', 'more', 'fundamental', 'entity', 'can', 'emerge', 'out', 'of', 'a', 'less', 'fundamental', 'one', 'in', 'fact', 'this', 'possibility', 'can', 'be', 'traced', 'back', 'to', 'the', 'existence', 'of', 'different', 'classical', 'limits', 'in', 'quantum', 'field', 'theories', 'and', 'string', 'theories']]
|
[-0.13806211989931763, 0.17686285903677346, -0.08004207492247224, 0.10357717902865261, -0.08940020033717155, -0.1427395797893405, 0.03386689661582932, 0.33427495013177394, -0.2801187598332763, -0.2848376804701984, 0.0709744896972552, -0.24166011188179254, -0.18910505869984626, 0.21176426298962905, -0.05985754934325814, -0.04983681609481573, -0.00849860145803541, 0.045702317309565844, -0.0877172603905201, -0.2199300392717123, 0.32603896226920187, 0.02210167514067143, 0.3079603784382343, 0.05429477267339826, 0.041751664575189355, -0.04917664169528871, -0.013035996269434691, 0.03135054040068644, -0.052249185239197686, 0.159690903339535, 0.26018723663687704, 0.1309362726137042, 0.2523081291615963, -0.44449944274127484, -0.20954871652275323, 0.0954150137193501, 0.1856999496696517, 0.10573300356883555, -0.03431941001326777, -0.25011987003684044, 0.10472039224579931, -0.11707623736932873, -0.1301009400971234, -0.05510008881986141, 0.02804117806535214, -0.026055517204571516, -0.15869895490072666, 0.0937114358637482, 0.08784591391310095, 0.04080905164778233, -0.02058874411135912, -0.06164754179492593, -0.013898654326796532, 0.16134226813167335, 0.12418324054591358, 0.041671492978930476, 0.08054242413491011, -0.1875435260720551, -0.16311532899923623, 0.41650267320871354, -0.015041107968427241, -0.1644439635127783, 0.25213689969852565, -0.1435208702161908, -0.15443744350224733, 0.06346120977401734, 0.1126681677699089, 0.10277339029312134, -0.10742525590013247, 0.05689378377795219, -0.05392816083878279, 0.15029715076088906, 0.09520527390763163, 0.052094491524621846, 0.28760905730724334, 0.14486655780486762, 0.07660384259186685, 0.1193086579660885, -0.038005020609125494, -0.17368507289607077, -0.3369865531474352, -0.18121468001790345, -0.09685420426726342, 0.06489589757658541, -0.06837772399152163, -0.12234076149016619, 0.3761355631873012, 0.19115697539458051, 0.17175923365354537, -0.0059474966078996655, 0.21878387743234634, 0.1129210651582107, 0.09276736984401941, 0.03070861568208784, 0.2644379771351814, 0.1266691922917962, 0.09515859978087246, -0.17036528364382683, 0.052756926380097866, 0.06190887650474906]
|
1,803.09444
|
Cliquet option pricing with Meixner processes
|
We investigate the pricing of cliquet options in a geometric Meixner model.
The considered option is of monthly sum cap style while the underlying stock
price model is driven by a pure-jump Meixner--L\'{e}vy process yielding Meixner
distributed log-returns. In this setting, we infer semi-analytic expressions
for the cliquet option price by using the probability distribution function of
the driving Meixner--L\'{e}vy process and by an application of Fourier
transform techniques. In an introductory section, we compile various facts on
the Meixner distribution and the related class of Meixner--L\'{e}vy processes.
We also propose a customized measure change preserving the Meixner distribution
of any Meixner process.
|
q-fin.PR math.PR
|
we investigate the pricing of cliquet options in a geometric meixner model the considered option is of monthly sum cap style while the underlying stock price model is driven by a purejump meixnerlevy process yielding meixner distributed logreturns in this setting we infer semianalytic expressions for the cliquet option price by using the probability distribution function of the driving meixnerlevy process and by an application of fourier transform techniques in an introductory section we compile various facts on the meixner distribution and the related class of meixnerlevy processes we also propose a customized measure change preserving the meixner distribution of any meixner process
|
[['we', 'investigate', 'the', 'pricing', 'of', 'cliquet', 'options', 'in', 'a', 'geometric', 'meixner', 'model', 'the', 'considered', 'option', 'is', 'of', 'monthly', 'sum', 'cap', 'style', 'while', 'the', 'underlying', 'stock', 'price', 'model', 'is', 'driven', 'by', 'a', 'purejump', 'meixnerlevy', 'process', 'yielding', 'meixner', 'distributed', 'logreturns', 'in', 'this', 'setting', 'we', 'infer', 'semianalytic', 'expressions', 'for', 'the', 'cliquet', 'option', 'price', 'by', 'using', 'the', 'probability', 'distribution', 'function', 'of', 'the', 'driving', 'meixnerlevy', 'process', 'and', 'by', 'an', 'application', 'of', 'fourier', 'transform', 'techniques', 'in', 'an', 'introductory', 'section', 'we', 'compile', 'various', 'facts', 'on', 'the', 'meixner', 'distribution', 'and', 'the', 'related', 'class', 'of', 'meixnerlevy', 'processes', 'we', 'also', 'propose', 'a', 'customized', 'measure', 'change', 'preserving', 'the', 'meixner', 'distribution', 'of', 'any', 'meixner', 'process']]
|
[-0.053035543806561565, 0.0442563251717111, -0.12505658331679778, 0.1386460630566008, -0.076172848629937, -0.10507030741230232, 0.08316973088652764, 0.41444496181115364, -0.30440517191241667, -0.23232226951716883, 0.12115293331512078, -0.2490704118373614, -0.13954286913848618, 0.18014472649315172, -0.11647579556746969, 0.047469993546894455, -0.03574204943097622, -0.049369503133613796, 0.011747237769615592, -0.22260519621658673, 0.31752301928998666, 0.06746531570854697, 0.27891380611572014, -0.041558767355824776, 0.14671297071194186, 0.039496957229504595, -0.09471512565986046, -0.1243005587958993, -0.1658151847360095, 0.12843183270266767, 0.20651048279674813, 0.1395514272297484, 0.2665054382828688, -0.3783966069498542, -0.14636060365846434, 0.1217951863839967, 0.08579613750538273, 0.004310397872050266, -0.03210125490994808, -0.25708729085214077, -0.03216850870171363, -0.24636478733850045, -0.13776105876957762, -0.058771541466466286, 0.03351805751094396, 0.0964463830115138, -0.32679266912989247, 0.06771619520935646, 0.07069564322280941, 0.05120811631758381, -0.044185093762262644, -0.140491719999649, 0.015997328021274248, 0.09376343888076909, 0.050751377843394965, -0.04732468000893454, 0.11749646695131816, -0.12468304342897699, -0.18983317088805934, 0.3721994974478645, -0.09578601561613309, -0.2280438460807488, 0.06979401692526542, -0.14689060573656004, -0.13565695914213807, 0.08712800418578305, 0.18267749172174236, 0.10854737184607216, -0.21223422587460394, 0.13207570509419966, -0.04719186630280851, 0.11402315983223249, 0.0663897366335308, -0.031191976406403536, 0.1753349061625856, 0.12276465755444273, 0.0320757357403636, 0.17376549309571682, -0.06116111823402851, -0.16859177644228907, -0.29831880150200096, -0.17546540309756414, -0.19225353517940322, 0.05064211515664548, -0.13014432753055374, -0.15789743504505063, 0.3996857278980315, 0.1375623086865232, 0.16129423354218886, 0.09438093992863393, 0.23405292839969247, 0.21720058560479902, -0.010469932826823618, 0.07364194873648072, 0.07078852278668686, 0.0539083483005033, 0.130177026413363, -0.1282800010764899, 0.148915879618268, 0.08697172225389666]
|
1,803.09445
|
Evaluations of Series Related to Jacobi Elliptic Functions
|
In this article we give evaluations of certain series of hyperbolic functions
using Jacobi elliptic functions theory. We also define some new functions that
enable us to give characterization of not solvable class of series.
|
math.NT
|
in this article we give evaluations of certain series of hyperbolic functions using jacobi elliptic functions theory we also define some new functions that enable us to give characterization of not solvable class of series
|
[['in', 'this', 'article', 'we', 'give', 'evaluations', 'of', 'certain', 'series', 'of', 'hyperbolic', 'functions', 'using', 'jacobi', 'elliptic', 'functions', 'theory', 'we', 'also', 'define', 'some', 'new', 'functions', 'that', 'enable', 'us', 'to', 'give', 'characterization', 'of', 'not', 'solvable', 'class', 'of', 'series']]
|
[-0.12965778499575598, 0.021802336456520216, -0.14167140369037431, 0.06350905739236623, -0.15562038363090583, -0.10320380021418844, -2.4397129059902258e-05, 0.3578314292111567, -0.2885351826037679, -0.22484110923750059, 0.06188258395995945, -0.22594807360853467, -0.25970933554427966, 0.3006067329751594, -0.07670751264584916, 0.07786377700311797, 0.03324685102062566, -0.0037961862981319427, -0.16500118092101598, -0.31779462801558633, 0.3866054632459314, -0.0463637147630964, 0.14447956617389407, 0.10034429752933127, 0.07536723387560675, 0.048987473361194134, -0.05466293637374682, -0.029368575494819586, -0.2535673985201616, 0.190020779493664, 0.3110087006951549, 0.1568926954375846, 0.25249582887627187, -0.433378976477044, -0.12345779370516538, 0.17567024725888455, 0.13041164656834944, 0.027088349764900547, -0.026418951526284217, -0.1856255971693567, 0.06229145145043731, -0.21943797692656516, -0.20626207885465453, -0.2087377481362117, -0.048760389470096144, 0.11496141427861793, -0.25459868007206493, 0.04418530129478313, 0.043259758023279055, 0.11583021236115851, -0.05617869634713445, -0.0727176285881017, 0.1226299835502037, 0.11271573601822768, 0.012036303390881844, -0.024046794205371824, 0.025516530711736, -0.03780199437668281, -0.11654277741909028, 0.3191086513921618, -0.06986550960157599, -0.2929921659507922, 0.12875415211809532, -0.22501937065805708, -0.2669998807034322, 0.11848179530352354, 0.22051331475377084, 0.18531003551823752, -0.1287149630486965, 0.081932929557349, -0.13434487794126784, 0.07411468313740832, 0.09558826200664043, 0.0683190178791327, 0.07316267293478762, 0.023399969549583538, 0.09910797290503978, 0.22536018583923578, 0.08400646253888096, -0.0714839923328587, -0.4065662832132408, -0.19423497787543706, -0.11064668848578418, 0.1013256644368604, -0.05758207578744207, -0.31561603410435574, 0.48884656626198975, 0.1333943011505263, 0.18089183100632258, 0.15556744741541997, 0.1154344214592129, 0.1853540763874272, 0.02764253563114575, 0.01710495954113347, 0.11065229606299129, 0.15067406158362115, 0.043029104146574224, -0.10460686212671655, -0.02845399257327829, 0.17962732148755875]
|
1,803.09446
|
Convergent kernel-based methods for parabolic equations
|
We prove that the functions constructed by the kernel-based regressions with
Wendland kernels under $\ell_1$-norm constraints converge to unique viscosity
solutions of the corresponding fully nonlinear parabolic equations. A key
ingredient in our proof is the max-min representations of the nonlinearities of
the equations.
|
math.NA cs.NA math.OC
|
we prove that the functions constructed by the kernelbased regressions with wendland kernels under ell_1norm constraints converge to unique viscosity solutions of the corresponding fully nonlinear parabolic equations a key ingredient in our proof is the maxmin representations of the nonlinearities of the equations
|
[['we', 'prove', 'that', 'the', 'functions', 'constructed', 'by', 'the', 'kernelbased', 'regressions', 'with', 'wendland', 'kernels', 'under', 'ell_1norm', 'constraints', 'converge', 'to', 'unique', 'viscosity', 'solutions', 'of', 'the', 'corresponding', 'fully', 'nonlinear', 'parabolic', 'equations', 'a', 'key', 'ingredient', 'in', 'our', 'proof', 'is', 'the', 'maxmin', 'representations', 'of', 'the', 'nonlinearities', 'of', 'the', 'equations']]
|
[-0.0945738152262162, -0.03661527354746464, -0.12252122538418254, 0.04915578591118736, -0.1066814013227651, -0.1297420835246819, -0.0517993387342854, 0.262782324698161, -0.34431844373995607, -0.1831034219146452, 0.12052715449747418, -0.27960296449336136, -0.1683946001100015, 0.1733960065017031, -0.0625754291461569, 0.171754158355973, 0.07202217493216846, -0.04594167438335717, -0.12621429745129056, -0.2946687718133696, 0.3987559701993384, -0.030142097860913385, 0.2588793217543174, -0.00601250312783205, 0.19983486521100116, -0.028227487938817252, -0.024084456444887273, -0.024306612607853658, -0.15228567230703696, 0.142760915893384, 0.2868634770804254, 0.08228238879978149, 0.3503792557643134, -0.40733465404165065, -0.19345416899093174, 0.11920380588112907, 0.0895289694996212, 0.03779580300165848, -0.00521461299980398, -0.2805205100554634, 0.08778548251244832, -0.08653279645791785, -0.16139259884684262, -0.13112380298447202, -0.051099641280333424, 0.140004115475511, -0.36713320114226505, 0.09596003505231981, 0.1341616583310745, -0.031702863459941, -0.1356619732898914, -0.1230963736306876, -0.016963112363803455, 0.017755623896267603, 0.07238209512169388, -0.027033436260270802, 0.02118123856119134, -0.16904018789699132, -0.09516741170293906, 0.33681364075958053, -0.11047468230720948, -0.3252118293365294, 0.15811806773258882, -0.10345672990661114, -0.1103779526469721, 0.11546534598297016, 0.1916967804691839, 0.14940738256766714, -0.16763399278914387, 0.11261921033093875, -0.09890514327509498, 0.11964945127626626, 0.05325144357894632, 0.006679559496908702, 0.06692855644293806, 0.1378535591489212, 0.16141456542324953, 0.11574305234138262, 0.012843253334391524, -0.10847265501929955, -0.35745471631261433, -0.10775718147951094, -0.17289079183352773, 0.04975862782025202, -0.16047005278100682, -0.20258479641581123, 0.40637268722904, 0.11238644051958215, 0.17063563130795956, 0.14704153223217212, 0.2555654300376773, 0.22703553915330718, 0.09745490994431417, 0.11767767899635312, 0.2313449646092274, 0.21577529644657095, 0.07700865391366692, -0.22824440937917892, 0.06314345543399792, 0.19509184803940693]
|
1,803.09447
|
Entropic bounds on currents in Langevin systems
|
We derive a bound on generalized currents for Langevin systems in terms of
the total entropy production in the system and its environment. For overdamped
dynamics, any generalized current is bounded by the total rate of entropy
production. We show that this entropic bound on the magnitude of generalized
currents imposes power-efficiency tradeoff relations for ratchets in contact
with a heat bath: Maximum efficiency---Carnot efficiency for a
Smoluchowski-Feynman ratchet and unity for a flashing or rocking ratchet---can
only be reached at vanishing power output. For underdamped dynamics, while
there may be reversible currents that are not bounded by the entropy production
rate, we show that the output power and heat absorption rate are irreversible
currents and thus obey the same bound. As a consequence, a power-efficiency
tradeoff relation holds not only for underdamped ratchets but also for
periodically driven heat engines. For weak driving, the bound results in
additional constraints on the Onsager matrix beyond those imposed by the Second
Law. Finally, we discuss the connection between heat and entropy in a
non-thermal situation where the friction and noise intensity are
state-dependent.
|
cond-mat.stat-mech
|
we derive a bound on generalized currents for langevin systems in terms of the total entropy production in the system and its environment for overdamped dynamics any generalized current is bounded by the total rate of entropy production we show that this entropic bound on the magnitude of generalized currents imposes powerefficiency tradeoff relations for ratchets in contact with a heat bath maximum efficiencycarnot efficiency for a smoluchowskifeynman ratchet and unity for a flashing or rocking ratchetcan only be reached at vanishing power output for underdamped dynamics while there may be reversible currents that are not bounded by the entropy production rate we show that the output power and heat absorption rate are irreversible currents and thus obey the same bound as a consequence a powerefficiency tradeoff relation holds not only for underdamped ratchets but also for periodically driven heat engines for weak driving the bound results in additional constraints on the onsager matrix beyond those imposed by the second law finally we discuss the connection between heat and entropy in a nonthermal situation where the friction and noise intensity are statedependent
|
[['we', 'derive', 'a', 'bound', 'on', 'generalized', 'currents', 'for', 'langevin', 'systems', 'in', 'terms', 'of', 'the', 'total', 'entropy', 'production', 'in', 'the', 'system', 'and', 'its', 'environment', 'for', 'overdamped', 'dynamics', 'any', 'generalized', 'current', 'is', 'bounded', 'by', 'the', 'total', 'rate', 'of', 'entropy', 'production', 'we', 'show', 'that', 'this', 'entropic', 'bound', 'on', 'the', 'magnitude', 'of', 'generalized', 'currents', 'imposes', 'powerefficiency', 'tradeoff', 'relations', 'for', 'ratchets', 'in', 'contact', 'with', 'a', 'heat', 'bath', 'maximum', 'efficiencycarnot', 'efficiency', 'for', 'a', 'smoluchowskifeynman', 'ratchet', 'and', 'unity', 'for', 'a', 'flashing', 'or', 'rocking', 'ratchetcan', 'only', 'be', 'reached', 'at', 'vanishing', 'power', 'output', 'for', 'underdamped', 'dynamics', 'while', 'there', 'may', 'be', 'reversible', 'currents', 'that', 'are', 'not', 'bounded', 'by', 'the', 'entropy', 'production', 'rate', 'we', 'show', 'that', 'the', 'output', 'power', 'and', 'heat', 'absorption', 'rate', 'are', 'irreversible', 'currents', 'and', 'thus', 'obey', 'the', 'same', 'bound', 'as', 'a', 'consequence', 'a', 'powerefficiency', 'tradeoff', 'relation', 'holds', 'not', 'only', 'for', 'underdamped', 'ratchets', 'but', 'also', 'for', 'periodically', 'driven', 'heat', 'engines', 'for', 'weak', 'driving', 'the', 'bound', 'results', 'in', 'additional', 'constraints', 'on', 'the', 'onsager', 'matrix', 'beyond', 'those', 'imposed', 'by', 'the', 'second', 'law', 'finally', 'we', 'discuss', 'the', 'connection', 'between', 'heat', 'and', 'entropy', 'in', 'a', 'nonthermal', 'situation', 'where', 'the', 'friction', 'and', 'noise', 'intensity', 'are', 'statedependent']]
|
[-0.16355889069447138, 0.1892221130186161, -0.038486691324466936, 0.06616209512355337, -0.03163138587371181, -0.1815271760394287, 0.11366165054223225, 0.3218186842277646, -0.2821038952344435, -0.26745435735470924, 0.07726908666562997, -0.29283503666207944, -0.11162649594148485, 0.27717502739842376, -0.05197824954117685, 0.05256248400748224, 0.027277339366915006, 0.07611104800345053, -0.01304241809499705, -0.18908599476647361, 0.27842726194242523, 0.052014379245072975, 0.28969986108912144, 0.11449357911725867, 0.1285145879780364, -0.039938012171177685, 0.04557313484382977, 0.04157682407813865, -0.14586631585800774, 0.06676936968309055, 0.1800576282181262, 0.044205250052017205, 0.21059042351403634, -0.4225071186106132, -0.2429986680550865, 0.15107024854111523, 0.10234368539105726, 0.08297328850613418, -0.05645610389687308, -0.2068912883252738, 0.03305348986272008, -0.1757992296284533, -0.08746768560458246, -0.07777199347363005, 0.05228365019650599, 0.07980157987457862, -0.2791885944582813, 0.17504239062939292, 0.14306885281359183, 0.023507140536516823, -0.05464618999118183, -0.05905595321244659, -0.04726934216281805, 0.07860324930467294, 0.0029352360113014016, -0.02648929545692267, 0.19627722937030997, -0.16932798796281343, -0.11303572316638417, 0.31440847775347364, -0.11620000457454878, -0.257999472049528, 0.15338784642257422, -0.16049970474026515, -0.09872319597449133, 0.09128149774565501, 0.16532461817230634, 0.07444331828101086, -0.20210515296700612, 0.05227693269489718, 0.01455750753686831, 0.13814512868776044, 0.08936217953268875, 0.05312807253671175, 0.20983395490544332, 0.12689572509492658, 0.103896838740326, 0.18862313162223254, -0.046960680790742414, -0.14978512205630956, -0.3351390373700574, -0.1757601095641854, -0.18306768929336073, 0.0907371549962372, -0.09314737642946778, -0.08449574931805652, 0.30931712057982574, 0.128020392858954, 0.1787523171609507, 0.11078687545885046, 0.3051874975689463, 0.21995610898222734, 0.02622856699481773, 0.12821221051415085, 0.26956868162456715, 0.14685154440760737, 0.13110364762696766, -0.28637399530579993, 0.09010817205751907, 0.06092936922285534]
|
1,803.09448
|
REST: Real-to-Synthetic Transform for Illumination Invariant Camera
Localization
|
Accurate camera localization is an essential part of tracking systems.
However, localization results are greatly affected by illumination. Including
data collected under various lighting conditions can improve the robustness of
the localization algorithm to lighting variation. However, this is very tedious
and time consuming. By using synthesized images it is possible to easily
accumulate a large variety of views under varying illumination and weather
conditions. Despite continuously improving processing power and rendering
algorithms, synthesized images do not perfectly match real images of the same
scene, i.e. there exists a gap between real and synthesized images that also
affects the accuracy of camera localization. To reduce the impact of this gap,
we introduce "REal-to-Synthetic Transform (REST)." REST is an autoencoder-like
network that converts real features to their synthetic counterpart. The
converted features can then be matched against the accumulated database for
robust camera localization. In our experiments REST improved feature matching
accuracy under variable lighting conditions by approximately 30%. Moreover, our
system outperforms state of the art CNN-based camera localization methods
trained with synthetic images. We believe our method could be used to
initialize local tracking and to simplify data accumulation for lighting robust
localization.
|
cs.CV
|
accurate camera localization is an essential part of tracking systems however localization results are greatly affected by illumination including data collected under various lighting conditions can improve the robustness of the localization algorithm to lighting variation however this is very tedious and time consuming by using synthesized images it is possible to easily accumulate a large variety of views under varying illumination and weather conditions despite continuously improving processing power and rendering algorithms synthesized images do not perfectly match real images of the same scene ie there exists a gap between real and synthesized images that also affects the accuracy of camera localization to reduce the impact of this gap we introduce realtosynthetic transform rest rest is an autoencoderlike network that converts real features to their synthetic counterpart the converted features can then be matched against the accumulated database for robust camera localization in our experiments rest improved feature matching accuracy under variable lighting conditions by approximately 30 moreover our system outperforms state of the art cnnbased camera localization methods trained with synthetic images we believe our method could be used to initialize local tracking and to simplify data accumulation for lighting robust localization
|
[['accurate', 'camera', 'localization', 'is', 'an', 'essential', 'part', 'of', 'tracking', 'systems', 'however', 'localization', 'results', 'are', 'greatly', 'affected', 'by', 'illumination', 'including', 'data', 'collected', 'under', 'various', 'lighting', 'conditions', 'can', 'improve', 'the', 'robustness', 'of', 'the', 'localization', 'algorithm', 'to', 'lighting', 'variation', 'however', 'this', 'is', 'very', 'tedious', 'and', 'time', 'consuming', 'by', 'using', 'synthesized', 'images', 'it', 'is', 'possible', 'to', 'easily', 'accumulate', 'a', 'large', 'variety', 'of', 'views', 'under', 'varying', 'illumination', 'and', 'weather', 'conditions', 'despite', 'continuously', 'improving', 'processing', 'power', 'and', 'rendering', 'algorithms', 'synthesized', 'images', 'do', 'not', 'perfectly', 'match', 'real', 'images', 'of', 'the', 'same', 'scene', 'ie', 'there', 'exists', 'a', 'gap', 'between', 'real', 'and', 'synthesized', 'images', 'that', 'also', 'affects', 'the', 'accuracy', 'of', 'camera', 'localization', 'to', 'reduce', 'the', 'impact', 'of', 'this', 'gap', 'we', 'introduce', 'realtosynthetic', 'transform', 'rest', 'rest', 'is', 'an', 'autoencoderlike', 'network', 'that', 'converts', 'real', 'features', 'to', 'their', 'synthetic', 'counterpart', 'the', 'converted', 'features', 'can', 'then', 'be', 'matched', 'against', 'the', 'accumulated', 'database', 'for', 'robust', 'camera', 'localization', 'in', 'our', 'experiments', 'rest', 'improved', 'feature', 'matching', 'accuracy', 'under', 'variable', 'lighting', 'conditions', 'by', 'approximately', '30', 'moreover', 'our', 'system', 'outperforms', 'state', 'of', 'the', 'art', 'cnnbased', 'camera', 'localization', 'methods', 'trained', 'with', 'synthetic', 'images', 'we', 'believe', 'our', 'method', 'could', 'be', 'used', 'to', 'initialize', 'local', 'tracking', 'and', 'to', 'simplify', 'data', 'accumulation', 'for', 'lighting', 'robust', 'localization']]
|
[-0.06751739138375923, 0.044284301034814545, -0.09315927681565937, 0.0371445504007573, -0.06548728853387316, -0.17010917210172544, -0.008802760710469303, 0.47166234044809396, -0.25957325723060626, -0.38338888253651787, 0.1260485862370955, -0.24250502702924087, -0.14518440298294438, 0.2389668947927049, -0.19644431146185787, 0.09108394568008323, 0.15314406691270294, -0.00264551843511728, -0.09522547246678252, -0.2761793955506459, 0.25393562382399154, 0.06338957371910285, 0.36014898156161546, 0.023775134396741705, 0.11374797028148566, 0.0005937970697054083, -0.025127075105478278, 0.01256066596209907, -0.0021834976101184947, 0.11595239270161645, 0.26575194794046164, 0.16518638313258277, 0.20213298155858958, -0.4312365076651067, -0.23144400949870744, 0.09167683274674496, 0.13907055920061953, 0.08161678914936048, -0.07616580572080098, -0.39553540653174685, 0.1194014777597424, -0.09649933912532077, -0.046398988042804463, -0.11361536798163403, -0.0027717995600170004, -0.024905068412202306, -0.2999877400897904, 0.04191708480612226, -0.003366874832151093, 0.07193499512624801, -0.1150884598363959, -0.061212477102166415, -0.007006465070328877, 0.22538948787097848, 0.014767761902701225, 0.03653563331535384, 0.17267352435497818, -0.1951023098345385, -0.06621081197001856, 0.3821650113881633, -0.06342451008680017, -0.2119444950625358, 0.22885442104613044, -0.0659814341258997, -0.07489493589358616, 0.19822945870031825, 0.17573907718388843, 0.12863126925202376, -0.15298438603634534, 0.009562345052116368, -0.009699913797919284, 0.22776529806445248, 0.07212939588071, 0.03231242683130441, 0.16172453534810985, 0.1839994762534487, 0.06763013725567456, 0.1505248210664128, -0.1791704295781566, -0.015804535064536638, -0.2093477091162715, -0.09220380400877251, -0.21962007531925037, -0.009434179907479232, -0.07928429677872138, -0.1366330323315984, 0.40055668118443416, 0.29444276086371585, 0.20527336210103647, 0.05773891000072328, 0.34801578144578876, 0.04880393773002896, 0.10256750226505677, 0.04733512369608603, 0.2016918976639983, -0.011894795128513972, 0.12705641345495416, -0.1882923909195353, 0.10061581311603413, 0.0014372598753399552]
|
1,803.09449
|
Distinct pressure evolution of coupled nematic and magnetic order in
FeSe
|
FeSe, despite being the structurally simplest compound in the family of
iron-based superconductors, shows an astoundingly rich interplay of physical
phenomena including nematicity and pressure-induced magnetism. Here, we present
a microscopic study of these two phenomena by high-energy x-ray diffraction and
time-domain M\"ossbauer spectroscopy on FeSe single crystals over a wide
temperature and pressure range. The topology of the pressure-temperature phase
diagram is a surprisingly close parallel to the well-known doping-temperature
phase diagram of BaFe2As2 generated through partial Fe/Co and Ba/Na
substitution. In FeSe with pressure p as a control parameter, the
magneto-structural ground state can be tuned from "pure" nematic - paramagnetic
with an orthorhombic lattice distortion - through a strongly coupled
magnetically ordered and orthorhombic state to a magnetically ordered state
without an orthorhombic lattice distortion. The magnetic hyperfine field
increases monotonically over a wide pressure range. However, the orthorhombic
distortion initially decreases under increasing pressure, but is stabilized by
cooperative coupling to the pressure-induced magnetic order. Close to the
reported maximum of the superconducting critical temperature Tc (occuring at p
= 6.8 GPa), the orthorhombic distortion suddenly disappears and FeSe remains
tetragonal down to the lowest temperature measured. Analysis of the structural
and magnetic order parameters suggests an independent origin of the structural
and magnetic ordering phenomena, and their cooperative coupling leads to the
similarity with the canonical phase diagram of iron pnictides.
|
cond-mat.supr-con cond-mat.str-el
|
fese despite being the structurally simplest compound in the family of ironbased superconductors shows an astoundingly rich interplay of physical phenomena including nematicity and pressureinduced magnetism here we present a microscopic study of these two phenomena by highenergy xray diffraction and timedomain mossbauer spectroscopy on fese single crystals over a wide temperature and pressure range the topology of the pressuretemperature phase diagram is a surprisingly close parallel to the wellknown dopingtemperature phase diagram of bafe2as2 generated through partial feco and bana substitution in fese with pressure p as a control parameter the magnetostructural ground state can be tuned from pure nematic paramagnetic with an orthorhombic lattice distortion through a strongly coupled magnetically ordered and orthorhombic state to a magnetically ordered state without an orthorhombic lattice distortion the magnetic hyperfine field increases monotonically over a wide pressure range however the orthorhombic distortion initially decreases under increasing pressure but is stabilized by cooperative coupling to the pressureinduced magnetic order close to the reported maximum of the superconducting critical temperature tc occuring at p 68 gpa the orthorhombic distortion suddenly disappears and fese remains tetragonal down to the lowest temperature measured analysis of the structural and magnetic order parameters suggests an independent origin of the structural and magnetic ordering phenomena and their cooperative coupling leads to the similarity with the canonical phase diagram of iron pnictides
|
[['fese', 'despite', 'being', 'the', 'structurally', 'simplest', 'compound', 'in', 'the', 'family', 'of', 'ironbased', 'superconductors', 'shows', 'an', 'astoundingly', 'rich', 'interplay', 'of', 'physical', 'phenomena', 'including', 'nematicity', 'and', 'pressureinduced', 'magnetism', 'here', 'we', 'present', 'a', 'microscopic', 'study', 'of', 'these', 'two', 'phenomena', 'by', 'highenergy', 'xray', 'diffraction', 'and', 'timedomain', 'mossbauer', 'spectroscopy', 'on', 'fese', 'single', 'crystals', 'over', 'a', 'wide', 'temperature', 'and', 'pressure', 'range', 'the', 'topology', 'of', 'the', 'pressuretemperature', 'phase', 'diagram', 'is', 'a', 'surprisingly', 'close', 'parallel', 'to', 'the', 'wellknown', 'dopingtemperature', 'phase', 'diagram', 'of', 'bafe2as2', 'generated', 'through', 'partial', 'feco', 'and', 'bana', 'substitution', 'in', 'fese', 'with', 'pressure', 'p', 'as', 'a', 'control', 'parameter', 'the', 'magnetostructural', 'ground', 'state', 'can', 'be', 'tuned', 'from', 'pure', 'nematic', 'paramagnetic', 'with', 'an', 'orthorhombic', 'lattice', 'distortion', 'through', 'a', 'strongly', 'coupled', 'magnetically', 'ordered', 'and', 'orthorhombic', 'state', 'to', 'a', 'magnetically', 'ordered', 'state', 'without', 'an', 'orthorhombic', 'lattice', 'distortion', 'the', 'magnetic', 'hyperfine', 'field', 'increases', 'monotonically', 'over', 'a', 'wide', 'pressure', 'range', 'however', 'the', 'orthorhombic', 'distortion', 'initially', 'decreases', 'under', 'increasing', 'pressure', 'but', 'is', 'stabilized', 'by', 'cooperative', 'coupling', 'to', 'the', 'pressureinduced', 'magnetic', 'order', 'close', 'to', 'the', 'reported', 'maximum', 'of', 'the', 'superconducting', 'critical', 'temperature', 'tc', 'occuring', 'at', 'p', '68', 'gpa', 'the', 'orthorhombic', 'distortion', 'suddenly', 'disappears', 'and', 'fese', 'remains', 'tetragonal', 'down', 'to', 'the', 'lowest', 'temperature', 'measured', 'analysis', 'of', 'the', 'structural', 'and', 'magnetic', 'order', 'parameters', 'suggests', 'an', 'independent', 'origin', 'of', 'the', 'structural', 'and', 'magnetic', 'ordering', 'phenomena', 'and', 'their', 'cooperative', 'coupling', 'leads', 'to', 'the', 'similarity', 'with', 'the', 'canonical', 'phase', 'diagram', 'of', 'iron', 'pnictides']]
|
[-0.19978164323408426, 0.29685037014591675, -0.010838340498037167, -0.02886541356880067, -0.09185153069939497, -0.1081197633982745, 0.17216518110341836, 0.4128885494690884, -0.31260793529115805, -0.2741270667395076, -0.015377906020017559, -0.3277218291464656, -0.100657708909329, 0.13320984128392763, 0.07073330256651651, 0.009638715239644453, -0.09002979492730889, 0.01713899781860344, -0.18472232493185983, -0.2195188665761495, 0.2879410415011047, 0.03541699944164704, 0.340653414764601, 0.04599887439598296, 0.03712086239252827, -0.02519679996017199, 0.1902042787104136, 0.06215285121144408, -0.19478194955274933, -0.017730317971048255, 0.3023251444772557, -0.08691146760119826, 0.17222504744826406, -0.3583337934436025, -0.25200618355039944, 0.013780465980924599, 0.09486611189712929, 0.1221811352276688, -0.07589268112850904, -0.2768465175150751, 0.03368049344515401, -0.11701875045341817, -0.10696522468440905, -0.14015647057687175, -0.07495406861280653, -0.03199506928328307, -0.23040058312367076, 0.1183080589776305, 0.06891327945049852, 0.1809379442464896, -0.17323482840695326, -0.12599037666930943, -0.0929571234574961, 0.008862084946133665, 0.07574411439457657, 0.14270479271507208, 0.1412919335264444, -0.07032644549365835, -0.07997403808802299, 0.40270964898612677, 0.014149426841827293, 0.03608473434258747, 0.15920067669798596, -0.19875814941048892, -0.09608011915590216, 0.2426711838159643, 0.08641997413858687, 0.0660141656366135, -0.11519537242926522, 0.07762922217564967, 0.020852156100912136, 0.26700083417702586, 0.03500327199324126, 0.056941885215876335, 0.24725737517619892, 0.20715688600473375, 0.02959076620885884, 0.19232487263732698, -0.10806485258886037, -0.08037726996258858, -0.17739262032953956, -0.1402264928604111, -0.16011222097645136, 0.04182299441576155, -0.13241292309937086, -0.23195190762110926, 0.3476763717507155, 0.11875683603376183, 0.18817669812271054, -0.13286827836470963, 0.21521741754966914, 0.05406073754105868, 0.037384537200711936, 0.010586472634049887, 0.24922212333573648, 0.23036877467792044, 0.13499552925297706, -0.33074986569054826, 0.1211434598856916, 0.010148344397846912]
|
1,803.0945
|
The chemistry of disks around T Tauri and Herbig Ae/Be stars
|
Infrared and (sub-)mm observations of disks around T Tauri and Herbig Ae/Be
stars point to a chemical differentiation between both types of disks, with a
lower detection rate of molecules in disks around hotter stars. To investigate
the potential underlying causes we perform a comparative study of the chemistry
of T Tauri and Herbig Ae/Be disks, using a model that pays special attention to
photochemistry. The warmer disk temperatures and higher ultraviolet flux of
Herbig stars compared to T Tauri stars induce some differences in the disk
chemistry. In the hot inner regions, H2O, and simple organic molecules like
C2H2, HCN, and CH4 are predicted to be very abundant in T Tauri disks and even
more in Herbig Ae/Be disks, in contrast with infrared observations that find a
much lower detection rate of water and simple organics toward disks around
hotter stars. In the outer regions, the model indicates that the molecules
typically observed in disks, like HCN, CN, C2H, H2CO, CS, SO, and HCO+, do not
have drastic abundance differences between T Tauri and Herbig Ae disks. Some
species produced under the action of photochemistry, like C2H and CN, are
predicted to have slightly lower abundances around Herbig Ae stars due to a
narrowing of the photochemically active layer. Observations indeed suggest that
these radicals are somewhat less abundant in Herbig Ae disks, although in any
case the inferred abundance differences are small, of a factor of a few at
most. A clear chemical differentiation between both types of disks concerns
ices, which are expected to be more abundant in Herbig Ae disks. The global
chemical behavior of T Tauri and Herbig Ae/Be disks is quite similar. The main
differences are driven by the warmer temperatures of the latter, which result
in a larger reservoir or water and simple organics in the inner regions and a
lower mass of ices in the outer disk.
|
astro-ph.GA astro-ph.SR
|
infrared and submm observations of disks around t tauri and herbig aebe stars point to a chemical differentiation between both types of disks with a lower detection rate of molecules in disks around hotter stars to investigate the potential underlying causes we perform a comparative study of the chemistry of t tauri and herbig aebe disks using a model that pays special attention to photochemistry the warmer disk temperatures and higher ultraviolet flux of herbig stars compared to t tauri stars induce some differences in the disk chemistry in the hot inner regions h2o and simple organic molecules like c2h2 hcn and ch4 are predicted to be very abundant in t tauri disks and even more in herbig aebe disks in contrast with infrared observations that find a much lower detection rate of water and simple organics toward disks around hotter stars in the outer regions the model indicates that the molecules typically observed in disks like hcn cn c2h h2co cs so and hco do not have drastic abundance differences between t tauri and herbig ae disks some species produced under the action of photochemistry like c2h and cn are predicted to have slightly lower abundances around herbig ae stars due to a narrowing of the photochemically active layer observations indeed suggest that these radicals are somewhat less abundant in herbig ae disks although in any case the inferred abundance differences are small of a factor of a few at most a clear chemical differentiation between both types of disks concerns ices which are expected to be more abundant in herbig ae disks the global chemical behavior of t tauri and herbig aebe disks is quite similar the main differences are driven by the warmer temperatures of the latter which result in a larger reservoir or water and simple organics in the inner regions and a lower mass of ices in the outer disk
|
[['infrared', 'and', 'submm', 'observations', 'of', 'disks', 'around', 't', 'tauri', 'and', 'herbig', 'aebe', 'stars', 'point', 'to', 'a', 'chemical', 'differentiation', 'between', 'both', 'types', 'of', 'disks', 'with', 'a', 'lower', 'detection', 'rate', 'of', 'molecules', 'in', 'disks', 'around', 'hotter', 'stars', 'to', 'investigate', 'the', 'potential', 'underlying', 'causes', 'we', 'perform', 'a', 'comparative', 'study', 'of', 'the', 'chemistry', 'of', 't', 'tauri', 'and', 'herbig', 'aebe', 'disks', 'using', 'a', 'model', 'that', 'pays', 'special', 'attention', 'to', 'photochemistry', 'the', 'warmer', 'disk', 'temperatures', 'and', 'higher', 'ultraviolet', 'flux', 'of', 'herbig', 'stars', 'compared', 'to', 't', 'tauri', 'stars', 'induce', 'some', 'differences', 'in', 'the', 'disk', 'chemistry', 'in', 'the', 'hot', 'inner', 'regions', 'h2o', 'and', 'simple', 'organic', 'molecules', 'like', 'c2h2', 'hcn', 'and', 'ch4', 'are', 'predicted', 'to', 'be', 'very', 'abundant', 'in', 't', 'tauri', 'disks', 'and', 'even', 'more', 'in', 'herbig', 'aebe', 'disks', 'in', 'contrast', 'with', 'infrared', 'observations', 'that', 'find', 'a', 'much', 'lower', 'detection', 'rate', 'of', 'water', 'and', 'simple', 'organics', 'toward', 'disks', 'around', 'hotter', 'stars', 'in', 'the', 'outer', 'regions', 'the', 'model', 'indicates', 'that', 'the', 'molecules', 'typically', 'observed', 'in', 'disks', 'like', 'hcn', 'cn', 'c2h', 'h2co', 'cs', 'so', 'and', 'hco', 'do', 'not', 'have', 'drastic', 'abundance', 'differences', 'between', 't', 'tauri', 'and', 'herbig', 'ae', 'disks', 'some', 'species', 'produced', 'under', 'the', 'action', 'of', 'photochemistry', 'like', 'c2h', 'and', 'cn', 'are', 'predicted', 'to', 'have', 'slightly', 'lower', 'abundances', 'around', 'herbig', 'ae', 'stars', 'due', 'to', 'a', 'narrowing', 'of', 'the', 'photochemically', 'active', 'layer', 'observations', 'indeed', 'suggest', 'that', 'these', 'radicals', 'are', 'somewhat', 'less', 'abundant', 'in', 'herbig', 'ae', 'disks', 'although', 'in', 'any', 'case', 'the', 'inferred', 'abundance', 'differences', 'are', 'small', 'of', 'a', 'factor', 'of', 'a', 'few', 'at', 'most', 'a', 'clear', 'chemical', 'differentiation', 'between', 'both', 'types', 'of', 'disks', 'concerns', 'ices', 'which', 'are', 'expected', 'to', 'be', 'more', 'abundant', 'in', 'herbig', 'ae', 'disks', 'the', 'global', 'chemical', 'behavior', 'of', 't', 'tauri', 'and', 'herbig', 'aebe', 'disks', 'is', 'quite', 'similar', 'the', 'main', 'differences', 'are', 'driven', 'by', 'the', 'warmer', 'temperatures', 'of', 'the', 'latter', 'which', 'result', 'in', 'a', 'larger', 'reservoir', 'or', 'water', 'and', 'simple', 'organics', 'in', 'the', 'inner', 'regions', 'and', 'a', 'lower', 'mass', 'of', 'ices', 'in', 'the', 'outer', 'disk']]
|
[-0.029569470883154918, 0.1427839901505245, -0.005720711382667697, 0.06892516333997871, -0.04481071007349307, -0.0861774005893884, 0.07627958607312943, 0.4410376877775268, -0.1787909754769071, -0.30671240016818047, 0.03338915914895811, -0.28355530574991705, -0.030323742963151917, 0.13486004319182404, -0.08471153512345775, -0.054078500663551195, 0.06055884465486521, -0.08607952597898445, -0.013565209011975972, -0.20939512874576308, 0.27373833668137354, 0.05097196297572246, 0.03469308082472592, -0.027962170514122895, -0.07575627563905621, -0.25144086014922884, -0.035061947226668486, -0.06176994183647727, -0.16031922196631232, 0.05266383948730349, 0.3017656808926, 0.057946751602289695, 0.18452911479176864, -0.42661027847715316, -0.2706041707731192, 0.08957388775967365, 0.16624623964621965, -0.015159308746279705, -0.06722258429407024, -0.20542480319457512, 0.09423025709499294, -0.10861162308239496, -0.10907096018837321, 0.008075914923508194, 0.1025844343124874, -0.002379990536128245, -0.2504922964477113, 0.09596367463070367, 0.11350276458302572, 0.19071293192368652, -0.1457046720066241, -0.2090935951483155, -0.12520057185449535, 0.057522072713260375, 0.03639330073658909, 0.07484136947341972, 0.2646717571993432, -0.1777754298396527, -0.03975210193810719, 0.4198441644864423, -0.18930968624199668, -0.0491103675127739, 0.35594435448699174, -0.2914330447343962, -0.20613072991799858, 0.19138144546092326, 0.09858231855231145, 0.2779718649344489, -0.14910473499506238, -0.010189047808729349, -0.053575131274198017, 0.1828871547086497, 0.11728715386005148, 0.10558657754981328, 0.355675819604325, 0.09287087251284411, 0.017729444466974765, 0.14672985708910144, -0.20901761431827226, -0.14156348041243969, -0.14937427538550563, -0.19229654354294615, -0.10087751921133271, 0.06783401357593931, -0.13108560866870297, -0.09411518374561435, 0.25970333769902704, 0.0853326944946607, 0.2381543288591303, -0.022580714664229798, 0.2892135925975347, 0.05501843156507386, 0.15611984135050858, 0.1796539381641658, 0.2595428225223995, 0.18526976912371104, 0.16475450455669371, -0.25942860436330123, 0.13174146356888944, -0.019938797899152316]
|
1,803.09451
|
Derived categories for Grothendieck categories of enriched functors
|
The derived category $D[C,V]$ of the Grothendieck category of enriched
functors $[C,V]$, where $V$ is a closed symmetric monoidal Grothendieck
category and $C$ is a small $V$-category, is studied. We prove that if the
derived category $D(V)$ of $V$ is a compactly generated triangulated category
with certain reasonable assumptions on compact generators or $K$-injective
resolutions, then the derived category $D[C,V]$ is also compactly generated
triangulated. Moreover, an explicit description of these generators is given.
|
math.CT math.KT
|
the derived category dcv of the grothendieck category of enriched functors cv where v is a closed symmetric monoidal grothendieck category and c is a small vcategory is studied we prove that if the derived category dv of v is a compactly generated triangulated category with certain reasonable assumptions on compact generators or kinjective resolutions then the derived category dcv is also compactly generated triangulated moreover an explicit description of these generators is given
|
[['the', 'derived', 'category', 'dcv', 'of', 'the', 'grothendieck', 'category', 'of', 'enriched', 'functors', 'cv', 'where', 'v', 'is', 'a', 'closed', 'symmetric', 'monoidal', 'grothendieck', 'category', 'and', 'c', 'is', 'a', 'small', 'vcategory', 'is', 'studied', 'we', 'prove', 'that', 'if', 'the', 'derived', 'category', 'dv', 'of', 'v', 'is', 'a', 'compactly', 'generated', 'triangulated', 'category', 'with', 'certain', 'reasonable', 'assumptions', 'on', 'compact', 'generators', 'or', 'kinjective', 'resolutions', 'then', 'the', 'derived', 'category', 'dcv', 'is', 'also', 'compactly', 'generated', 'triangulated', 'moreover', 'an', 'explicit', 'description', 'of', 'these', 'generators', 'is', 'given']]
|
[-0.15394859126693494, 0.025450630297741184, -0.039385186048929356, 0.11222969156979407, -0.10416522915978488, -0.1665878323020061, -0.08390423371708272, 0.43569361876595664, -0.42714656577948984, -0.1413174400836028, 0.05915610967329829, -0.15349809599511727, -0.06291325995383935, 0.15740564115332892, -0.2427643861848156, -0.1362829387024347, 0.13736714992508595, 0.17783047087691925, -0.06245364298779719, -0.2475804394815822, 0.47398152056376675, -0.04539896020464398, 0.25661459047901064, 0.015321396769502678, 0.14560716766612353, -0.05217624348714142, -0.0020294563586798473, 0.04895400789541167, -0.1593312116885893, 0.17268505322470054, 0.29347166328414065, 0.09268333506455796, 0.14694382417380708, -0.33782542275415883, -0.05950750278409671, 0.1650549027363996, 0.049319969908636366, 0.033278142202746226, -0.07998467908977103, -0.3748613438644522, 0.20093372276656934, -0.2814852533408919, -0.06151509297558585, -0.016031422174057446, 0.18762725974256927, 0.04502928370886759, -0.33197261986473725, -0.09891686923337811, 0.05652300580530553, 0.11754726698445911, -0.11177984511832127, -0.048112312967360425, -0.1839577765015231, 0.06630461539985058, -0.1043782621005399, 0.06239071803016437, 0.15518355879278198, -0.09506082214569245, -0.04815129678998444, 0.39137011638062225, -0.07479509653372539, -0.22899065171745983, 0.1264720210786657, -0.12249794729743027, -0.11058916269197457, 0.14597353782832018, -0.04430297904371007, 0.18611837836687226, -0.03931240288767259, 0.2501938629988266, -0.2176343394393051, 0.07618075675044737, 0.10700275363853655, 0.031527445708225306, 0.10458461304094542, 0.11787835994382968, -0.030992358471455705, 0.11331998677043295, -0.013577779065943449, -0.02944897419798213, -0.398525231593364, -0.139476326369756, -0.12554664542344776, 0.14409227216477832, -0.06541084617079783, -0.16966992840674278, 0.34502508798362436, 0.07435032155213726, 0.1602598087031495, 0.15998711353923017, 0.23477661647405978, 0.07602489614745954, 0.042206604815579044, 0.06475128845085164, 0.08171673519285144, 0.23792695306946296, -0.08498417420589642, -0.013587117931377646, 0.03367607893321563, 0.2170835799738966]
|
1,803.09452
|
Panel Data Analysis with Heterogeneous Dynamics
|
This paper proposes a model-free approach to analyze panel data with
heterogeneous dynamic structures across observational units. We first compute
the sample mean, autocovariances, and autocorrelations for each unit, and then
estimate the parameters of interest based on their empirical distributions. We
then investigate the asymptotic properties of our estimators using double
asymptotics and propose split-panel jackknife bias correction and inference
based on the cross-sectional bootstrap. We illustrate the usefulness of our
procedures by studying the deviation dynamics of the law of one price. Monte
Carlo simulations confirm that the proposed bias correction is effective and
yields valid inference in small samples.
|
econ.EM
|
this paper proposes a modelfree approach to analyze panel data with heterogeneous dynamic structures across observational units we first compute the sample mean autocovariances and autocorrelations for each unit and then estimate the parameters of interest based on their empirical distributions we then investigate the asymptotic properties of our estimators using double asymptotics and propose splitpanel jackknife bias correction and inference based on the crosssectional bootstrap we illustrate the usefulness of our procedures by studying the deviation dynamics of the law of one price monte carlo simulations confirm that the proposed bias correction is effective and yields valid inference in small samples
|
[['this', 'paper', 'proposes', 'a', 'modelfree', 'approach', 'to', 'analyze', 'panel', 'data', 'with', 'heterogeneous', 'dynamic', 'structures', 'across', 'observational', 'units', 'we', 'first', 'compute', 'the', 'sample', 'mean', 'autocovariances', 'and', 'autocorrelations', 'for', 'each', 'unit', 'and', 'then', 'estimate', 'the', 'parameters', 'of', 'interest', 'based', 'on', 'their', 'empirical', 'distributions', 'we', 'then', 'investigate', 'the', 'asymptotic', 'properties', 'of', 'our', 'estimators', 'using', 'double', 'asymptotics', 'and', 'propose', 'splitpanel', 'jackknife', 'bias', 'correction', 'and', 'inference', 'based', 'on', 'the', 'crosssectional', 'bootstrap', 'we', 'illustrate', 'the', 'usefulness', 'of', 'our', 'procedures', 'by', 'studying', 'the', 'deviation', 'dynamics', 'of', 'the', 'law', 'of', 'one', 'price', 'monte', 'carlo', 'simulations', 'confirm', 'that', 'the', 'proposed', 'bias', 'correction', 'is', 'effective', 'and', 'yields', 'valid', 'inference', 'in', 'small', 'samples']]
|
[-0.023225326967589995, 0.005245761982366151, -0.13243372472660506, 0.11708312927672238, -0.052635584469409843, -0.08789288730579703, 0.10312351068440716, 0.39113852684842604, -0.23865066166948892, -0.3200930843458456, 0.11998308674939086, -0.27093931462834864, -0.15553151332035972, 0.20455925915317208, -0.07173057556079299, 0.07746398720123313, 0.062423809102791196, -0.04512693253619706, -0.08426500045393101, -0.2604652236526211, 0.2794017348913293, 0.0879621512676571, 0.35151155397590417, -0.024850360006002672, 0.1463303344299122, 0.04124025291051058, -0.10008281945050054, 0.05209071973484813, -0.2010983978104966, 0.1564648312553033, 0.18881884038530508, 0.09593651613549274, 0.3227845150749108, -0.3762644546413332, -0.17150319187774085, 0.076932298430406, 0.14448110806052664, 0.09788288658156115, -0.05128414836009124, -0.24701360110010878, 0.07555963009522826, -0.18153487287425235, -0.09482230601704442, -0.12552445286008365, -0.022976458326036876, 0.0685221676545802, -0.3258393773530592, 0.12397201211213399, 0.00438489419563363, 0.07612345445280273, -0.026737347610440908, -0.13971235084018724, 0.041037410908543015, 0.13033706098269926, 0.08628941321512684, -0.0845008218414424, 0.1500454633542355, -0.06863875603805497, -0.13318547154502833, 0.2941204816395161, -0.06496103579068885, -0.20088590997472114, 0.1136466740749265, -0.16209423892181732, -0.1508639086330054, 0.04644336390272513, 0.21235664260080633, 0.13622019663785515, -0.1891166499185869, 0.08007173371836818, 0.019557986947178255, 0.1544950188539338, -0.03308506289898765, -0.039714629618067515, 0.15298883494117535, 0.18697748571524725, 0.023113353730307196, 0.1765551966359364, -0.1914005231011805, -0.11956083514800697, -0.32306216544398636, -0.11320767506920532, -0.19905224254847886, 0.012001609662547708, -0.18350467897478523, -0.21874579641621048, 0.3890531089832531, 0.256465674416783, 0.18691149067736285, 0.16819990765247447, 0.3144872658612097, 0.11442798326093265, 0.030698466788082586, 0.08087764032112033, 0.18697374781557158, 0.1320999330206427, 0.027619137682075447, -0.23183751711507747, 0.12897743269636788, 0.04175873524418064]
|
1,803.09453
|
CNN in MRF: Video Object Segmentation via Inference in A CNN-Based
Higher-Order Spatio-Temporal MRF
|
This paper addresses the problem of video object segmentation, where the
initial object mask is given in the first frame of an input video. We propose a
novel spatio-temporal Markov Random Field (MRF) model defined over pixels to
handle this problem. Unlike conventional MRF models, the spatial dependencies
among pixels in our model are encoded by a Convolutional Neural Network (CNN).
Specifically, for a given object, the probability of a labeling to a set of
spatially neighboring pixels can be predicted by a CNN trained for this
specific object. As a result, higher-order, richer dependencies among pixels in
the set can be implicitly modeled by the CNN. With temporal dependencies
established by optical flow, the resulting MRF model combines both spatial and
temporal cues for tackling video object segmentation. However, performing
inference in the MRF model is very difficult due to the very high-order
dependencies. To this end, we propose a novel CNN-embedded algorithm to perform
approximate inference in the MRF. This algorithm proceeds by alternating
between a temporal fusion step and a feed-forward CNN step. When initialized
with an appearance-based one-shot segmentation CNN, our model outperforms the
winning entries of the DAVIS 2017 Challenge, without resorting to model
ensembling or any dedicated detectors.
|
cs.CV
|
this paper addresses the problem of video object segmentation where the initial object mask is given in the first frame of an input video we propose a novel spatiotemporal markov random field mrf model defined over pixels to handle this problem unlike conventional mrf models the spatial dependencies among pixels in our model are encoded by a convolutional neural network cnn specifically for a given object the probability of a labeling to a set of spatially neighboring pixels can be predicted by a cnn trained for this specific object as a result higherorder richer dependencies among pixels in the set can be implicitly modeled by the cnn with temporal dependencies established by optical flow the resulting mrf model combines both spatial and temporal cues for tackling video object segmentation however performing inference in the mrf model is very difficult due to the very highorder dependencies to this end we propose a novel cnnembedded algorithm to perform approximate inference in the mrf this algorithm proceeds by alternating between a temporal fusion step and a feedforward cnn step when initialized with an appearancebased oneshot segmentation cnn our model outperforms the winning entries of the davis 2017 challenge without resorting to model ensembling or any dedicated detectors
|
[['this', 'paper', 'addresses', 'the', 'problem', 'of', 'video', 'object', 'segmentation', 'where', 'the', 'initial', 'object', 'mask', 'is', 'given', 'in', 'the', 'first', 'frame', 'of', 'an', 'input', 'video', 'we', 'propose', 'a', 'novel', 'spatiotemporal', 'markov', 'random', 'field', 'mrf', 'model', 'defined', 'over', 'pixels', 'to', 'handle', 'this', 'problem', 'unlike', 'conventional', 'mrf', 'models', 'the', 'spatial', 'dependencies', 'among', 'pixels', 'in', 'our', 'model', 'are', 'encoded', 'by', 'a', 'convolutional', 'neural', 'network', 'cnn', 'specifically', 'for', 'a', 'given', 'object', 'the', 'probability', 'of', 'a', 'labeling', 'to', 'a', 'set', 'of', 'spatially', 'neighboring', 'pixels', 'can', 'be', 'predicted', 'by', 'a', 'cnn', 'trained', 'for', 'this', 'specific', 'object', 'as', 'a', 'result', 'higherorder', 'richer', 'dependencies', 'among', 'pixels', 'in', 'the', 'set', 'can', 'be', 'implicitly', 'modeled', 'by', 'the', 'cnn', 'with', 'temporal', 'dependencies', 'established', 'by', 'optical', 'flow', 'the', 'resulting', 'mrf', 'model', 'combines', 'both', 'spatial', 'and', 'temporal', 'cues', 'for', 'tackling', 'video', 'object', 'segmentation', 'however', 'performing', 'inference', 'in', 'the', 'mrf', 'model', 'is', 'very', 'difficult', 'due', 'to', 'the', 'very', 'highorder', 'dependencies', 'to', 'this', 'end', 'we', 'propose', 'a', 'novel', 'cnnembedded', 'algorithm', 'to', 'perform', 'approximate', 'inference', 'in', 'the', 'mrf', 'this', 'algorithm', 'proceeds', 'by', 'alternating', 'between', 'a', 'temporal', 'fusion', 'step', 'and', 'a', 'feedforward', 'cnn', 'step', 'when', 'initialized', 'with', 'an', 'appearancebased', 'oneshot', 'segmentation', 'cnn', 'our', 'model', 'outperforms', 'the', 'winning', 'entries', 'of', 'the', 'davis', '2017', 'challenge', 'without', 'resorting', 'to', 'model', 'ensembling', 'or', 'any', 'dedicated', 'detectors']]
|
[-0.0455957766957214, 0.0234930107768297, -0.04796633806642778, 0.057397897841564835, -0.09712457051959458, -0.19835745010598393, 0.008870467931844222, 0.4773424107196002, -0.29745960591608667, -0.3588916529841684, 0.024788700632253212, -0.20092909984758556, -0.1772721607336692, 0.10110203134185024, -0.14633411543875052, 0.09920376504191056, 0.1369006016562358, 0.06200911641221842, -0.05107190644181003, -0.2514349477046761, 0.28877613778808725, 0.04481410634419491, 0.2904492577381909, -0.04962078018201139, 0.19733060323610316, 0.012044266446635787, -0.04998150599026236, 0.014165195970786873, -0.015809801567731232, 0.1692190090632479, 0.30869352040672804, 0.16039094692577832, 0.33139041290054183, -0.4346636143774528, -0.2800847875330542, 0.09567032510694574, 0.15165381826542942, 0.13711725982832793, 0.006794155848308884, -0.3763905335584738, 0.1110411591029593, -0.15774194729225388, 0.06998097283072917, -0.08224960927424403, -0.03311976012968793, -0.016309319640362974, -0.34258245010607935, 0.04627993021314055, 0.1052378898307571, 0.039571919257114896, -0.05437462223439106, -0.045229028266960104, 0.0453483979378281, 0.15350633072669692, -0.018536012311204535, 0.10180097811837024, 0.10755044540729869, -0.21667042128590344, -0.13532435861496447, 0.3422019323334098, -0.05599233363823864, -0.25460796645874606, 0.14237123123585738, -0.018698804126364255, -0.15083162787283216, 0.11694669327354563, 0.19677596977565512, 0.1692906963487564, -0.1788204676851434, 0.01775365438154013, -0.06892775637304108, 0.20676632891202648, 0.06038968680940311, -0.037404932465998963, 0.21622132422606657, 0.2715027442114804, 0.04256679369807656, 0.1774743032977765, -0.19151949330136694, -0.06005556008140809, -0.23445223225395337, -0.05184644061998634, -0.22832268374637135, -0.06074164299468689, -0.1329591465961094, -0.16659066486493523, 0.4254157010183711, 0.23820125827059124, 0.2594485766291068, 0.12192912597961614, 0.3604994311841581, 0.051583784072243566, 0.09837558921518291, 0.08109162431990205, 0.13443169744657765, 0.05291964315758127, 0.1298260250274468, -0.14119916092007986, 0.1095773478937817, 0.12859723545734775]
|
1,803.09454
|
Fast and Accurate Single Image Super-Resolution via Information
Distillation Network
|
Recently, deep convolutional neural networks (CNNs) have been demonstrated
remarkable progress on single image super-resolution. However, as the depth and
width of the networks increase, CNN-based super-resolution methods have been
faced with the challenges of computational complexity and memory consumption in
practice. In order to solve the above questions, we propose a deep but compact
convolutional network to directly reconstruct the high resolution image from
the original low resolution image. In general, the proposed model consists of
three parts, which are feature extraction block, stacked information
distillation blocks and reconstruction block respectively. By combining an
enhancement unit with a compression unit into a distillation block, the local
long and short-path features can be effectively extracted. Specifically, the
proposed enhancement unit mixes together two different types of features and
the compression unit distills more useful information for the sequential
blocks. In addition, the proposed network has the advantage of fast execution
due to the comparatively few numbers of filters per layer and the use of group
convolution. Experimental results demonstrate that the proposed method is
superior to the state-of-the-art methods, especially in terms of time
performance.
|
cs.CV
|
recently deep convolutional neural networks cnns have been demonstrated remarkable progress on single image superresolution however as the depth and width of the networks increase cnnbased superresolution methods have been faced with the challenges of computational complexity and memory consumption in practice in order to solve the above questions we propose a deep but compact convolutional network to directly reconstruct the high resolution image from the original low resolution image in general the proposed model consists of three parts which are feature extraction block stacked information distillation blocks and reconstruction block respectively by combining an enhancement unit with a compression unit into a distillation block the local long and shortpath features can be effectively extracted specifically the proposed enhancement unit mixes together two different types of features and the compression unit distills more useful information for the sequential blocks in addition the proposed network has the advantage of fast execution due to the comparatively few numbers of filters per layer and the use of group convolution experimental results demonstrate that the proposed method is superior to the stateoftheart methods especially in terms of time performance
|
[['recently', 'deep', 'convolutional', 'neural', 'networks', 'cnns', 'have', 'been', 'demonstrated', 'remarkable', 'progress', 'on', 'single', 'image', 'superresolution', 'however', 'as', 'the', 'depth', 'and', 'width', 'of', 'the', 'networks', 'increase', 'cnnbased', 'superresolution', 'methods', 'have', 'been', 'faced', 'with', 'the', 'challenges', 'of', 'computational', 'complexity', 'and', 'memory', 'consumption', 'in', 'practice', 'in', 'order', 'to', 'solve', 'the', 'above', 'questions', 'we', 'propose', 'a', 'deep', 'but', 'compact', 'convolutional', 'network', 'to', 'directly', 'reconstruct', 'the', 'high', 'resolution', 'image', 'from', 'the', 'original', 'low', 'resolution', 'image', 'in', 'general', 'the', 'proposed', 'model', 'consists', 'of', 'three', 'parts', 'which', 'are', 'feature', 'extraction', 'block', 'stacked', 'information', 'distillation', 'blocks', 'and', 'reconstruction', 'block', 'respectively', 'by', 'combining', 'an', 'enhancement', 'unit', 'with', 'a', 'compression', 'unit', 'into', 'a', 'distillation', 'block', 'the', 'local', 'long', 'and', 'shortpath', 'features', 'can', 'be', 'effectively', 'extracted', 'specifically', 'the', 'proposed', 'enhancement', 'unit', 'mixes', 'together', 'two', 'different', 'types', 'of', 'features', 'and', 'the', 'compression', 'unit', 'distills', 'more', 'useful', 'information', 'for', 'the', 'sequential', 'blocks', 'in', 'addition', 'the', 'proposed', 'network', 'has', 'the', 'advantage', 'of', 'fast', 'execution', 'due', 'to', 'the', 'comparatively', 'few', 'numbers', 'of', 'filters', 'per', 'layer', 'and', 'the', 'use', 'of', 'group', 'convolution', 'experimental', 'results', 'demonstrate', 'that', 'the', 'proposed', 'method', 'is', 'superior', 'to', 'the', 'stateoftheart', 'methods', 'especially', 'in', 'terms', 'of', 'time', 'performance']]
|
[-0.05632750567023617, -0.014564779943808587, -0.0351436471541387, 0.023397088013715237, -0.04444462969219564, -0.16319399822654354, -0.009022648637560573, 0.4505614048927217, -0.30814513735775206, -0.3234839080949314, 0.1182195573308933, -0.2658394135585105, -0.16653592996299266, 0.1723746627430759, -0.11242749463213055, 0.11810791152969909, 0.1138040020256429, 0.03026200479047524, -0.09882783082917937, -0.29524670396365127, 0.26051382971046544, 0.07928411076820732, 0.3830517789953061, 0.027157659648691077, 0.15214819617544276, -0.03839255790352016, -0.038664986678978074, -0.006368092148615097, -0.019409023508676515, 0.19610427329820154, 0.26851318431011323, 0.14379992216473092, 0.30684956591828044, -0.4738125713340737, -0.2816118120618567, 0.05211430347927318, 0.17727999541958844, 0.0993116184962108, -0.04657354111243606, -0.2811275601361853, 0.10973130447437635, -0.15403556149906, 0.017957341499670685, -0.11753058458703596, -0.01985789069251434, -0.013334092579630984, -0.2544038858777148, 0.028866270781696044, 0.07221872559276636, 0.010392597151567807, -0.010413803160819855, -0.13290312182900774, 0.038837984442157115, 0.16867537853635242, -0.005673116852680372, 0.05491272240650614, 0.12220074465447986, -0.1913935474422131, -0.12588455522546194, 0.3270925888464459, -0.06726918309687863, -0.1841074187686113, 0.180652309913893, -0.06263231817582572, -0.14853068225689836, 0.15492596756163482, 0.1981705289736793, 0.08874480939042327, -0.13115888299873552, 0.012505680727426315, -0.022235994111444498, 0.2050894180665145, 0.08497881061976423, 0.07014568935406419, 0.16972772362138572, 0.25228881219848737, 0.02138708214451735, 0.16995431689570684, -0.18702075510487162, -0.065669400781091, -0.17981906333887898, -0.13687446767690817, -0.2068988025679278, -0.04169522188603878, -0.102339436244251, -0.09884662670586762, 0.4346493691558371, 0.18017753298973313, 0.24056797606769847, 0.08697626058175857, 0.3603576646765342, 0.059835989806624884, 0.20225739642046392, 0.07311302727037991, 0.19388842422364128, 0.10164576889821203, 0.10987218049090557, -0.1735481096161026, 0.0539370483819496, 0.06437677220768623]
|
1,803.09455
|
Crime Pays; Homogenized Wave Equations for Long Times
|
This article examines the accuracy for large times of asymptotic expansions
from periodic homogenization of wave equations. As usual, $\epsilon$ denotes
the small period of the coefficients in the wave equation. We first prove that
the standard two scale asymptotic expansion provides an accurate approximation
of the exact solution for times $t$ of order $\epsilon^{-2+\delta}$ for any
$\delta>0$. Second, for longer times, we show that a different algorithm, that
is called criminal because it mixes different powers of $\epsilon$, yields an
approximation of the exact solution with error $O(\epsilon^N)$ for times
$\epsilon^{-N}$ with $N$ as large as one likes. The criminal algorithm involves
high order homogenized equations that, in the context of the wave equation,
were first proposed by Santosa and Symes and analyzed by Lamacz. The high order
homogenized equations yield dispersive corrections for moderate wave numbers.
We give a systematic analysis for all time scales and all high order corrective
terms.
|
math.AP
|
this article examines the accuracy for large times of asymptotic expansions from periodic homogenization of wave equations as usual epsilon denotes the small period of the coefficients in the wave equation we first prove that the standard two scale asymptotic expansion provides an accurate approximation of the exact solution for times t of order epsilon2delta for any delta0 second for longer times we show that a different algorithm that is called criminal because it mixes different powers of epsilon yields an approximation of the exact solution with error oepsilonn for times epsilonn with n as large as one likes the criminal algorithm involves high order homogenized equations that in the context of the wave equation were first proposed by santosa and symes and analyzed by lamacz the high order homogenized equations yield dispersive corrections for moderate wave numbers we give a systematic analysis for all time scales and all high order corrective terms
|
[['this', 'article', 'examines', 'the', 'accuracy', 'for', 'large', 'times', 'of', 'asymptotic', 'expansions', 'from', 'periodic', 'homogenization', 'of', 'wave', 'equations', 'as', 'usual', 'epsilon', 'denotes', 'the', 'small', 'period', 'of', 'the', 'coefficients', 'in', 'the', 'wave', 'equation', 'we', 'first', 'prove', 'that', 'the', 'standard', 'two', 'scale', 'asymptotic', 'expansion', 'provides', 'an', 'accurate', 'approximation', 'of', 'the', 'exact', 'solution', 'for', 'times', 't', 'of', 'order', 'epsilon2delta', 'for', 'any', 'delta0', 'second', 'for', 'longer', 'times', 'we', 'show', 'that', 'a', 'different', 'algorithm', 'that', 'is', 'called', 'criminal', 'because', 'it', 'mixes', 'different', 'powers', 'of', 'epsilon', 'yields', 'an', 'approximation', 'of', 'the', 'exact', 'solution', 'with', 'error', 'oepsilonn', 'for', 'times', 'epsilonn', 'with', 'n', 'as', 'large', 'as', 'one', 'likes', 'the', 'criminal', 'algorithm', 'involves', 'high', 'order', 'homogenized', 'equations', 'that', 'in', 'the', 'context', 'of', 'the', 'wave', 'equation', 'were', 'first', 'proposed', 'by', 'santosa', 'and', 'symes', 'and', 'analyzed', 'by', 'lamacz', 'the', 'high', 'order', 'homogenized', 'equations', 'yield', 'dispersive', 'corrections', 'for', 'moderate', 'wave', 'numbers', 'we', 'give', 'a', 'systematic', 'analysis', 'for', 'all', 'time', 'scales', 'and', 'all', 'high', 'order', 'corrective', 'terms']]
|
[-0.169636627471687, 0.09261649052457002, -0.0434932623936751, 0.06956319587817728, -0.04018258236836167, -0.08529517346924334, 0.01353625196107232, 0.29712480150988235, -0.23161828387278638, -0.2861494939999292, 0.12681902184826166, -0.29367861934256234, -0.13366895953924615, 0.18658572257865194, 0.01177815479170156, 0.08159496371115514, 0.05204278102219605, 0.06228634281296458, -0.0852215886920778, -0.2274043758043507, 0.2871731833348538, 0.01300951034680709, 0.23165102435538432, 0.011903126752191542, 0.15899199813341836, -0.007136531321069338, -0.004065503345391457, 0.00588676609698958, -0.15465329583806936, 0.06300071889422083, 0.24092632068958658, 0.06955402574639442, 0.30008329088555885, -0.4377704347677579, -0.17029934996839038, 0.06659385674451822, 0.15855532357525456, 0.11806416160102008, -0.0009183792175487584, -0.23952969538060412, 0.13351956302700127, -0.1651289713062696, -0.17752238194576947, -0.10472302335070684, 0.07391362494770312, 0.06338436351526504, -0.32351059660990567, 0.14125857320957935, 0.040060970229065455, 0.005437536765164977, -0.06242253604476284, -0.13128647836387758, 0.03971640948806233, 0.11354042504657835, 0.09614171534651678, 0.019266609383759483, 0.0041002256158214285, -0.12371529101537879, -0.06133407637501923, 0.3979186021579092, -0.12889204263818393, -0.18302827420638212, 0.12353062854717242, -0.15711699753699687, -0.10386700370042716, 0.17337671421693276, 0.16377937886004504, 0.15954307488622083, -0.12003769999957525, 0.10664458307726683, -0.0029093387389036783, 0.1851144541029962, 0.11716848023035782, 0.031949548107015606, 0.07593736767568844, 0.14088801882110985, 0.09754736640415586, 0.09824690251336152, -0.06040792982562777, -0.07584654988608504, -0.3442483125317017, -0.16260475735248445, -0.17291009566284116, 0.07211688321104098, -0.18450464385738613, -0.1814943084041291, 0.367502040836035, 0.16286602796949196, 0.16443437664150792, 0.11413816445750878, 0.2806113476539968, 0.19792766650066704, 0.01432332887453724, 0.09069214122769917, 0.19416796787791954, 0.08269796102939037, 0.08799049721705733, -0.20439728190157494, 0.06673586281053973, 0.12777287651778468]
|
1,803.09456
|
Entropy of Higher Dimensional Charged Gauss-Bonnet Black hole in de
Sitter Space
|
The fundamental equation of the thermodynamic system gives the relation
between internal energy, entropy and volume of two adjacent equilibrium states.
Taking higher dimensional charged Gauss-Bonnet black hole in de Sitter space as
a thermodynamic system, the state parameters have to meet the fundamental
equation of thermodynamics. We introduce the effective thermodynamic quantities
to describe the black hole in de Sitter space. Considering that in the lukewarm
case the temperature of the black hole horizon is equal to that of the
cosmological horizon, the effective temperature of spacetime is the same, we
conjecture that the effective temperature has the same value. In this way, we
can obtain the entropy formula of spacetime by solving the differential
equation. We find that the total entropy contain an extra terms besides the sum
of the entropies of the two horizons. The corrected terms of the entropy is a
function of horizon radius ratio, and is independent of the charge of the
spacetime.
|
gr-qc
|
the fundamental equation of the thermodynamic system gives the relation between internal energy entropy and volume of two adjacent equilibrium states taking higher dimensional charged gaussbonnet black hole in de sitter space as a thermodynamic system the state parameters have to meet the fundamental equation of thermodynamics we introduce the effective thermodynamic quantities to describe the black hole in de sitter space considering that in the lukewarm case the temperature of the black hole horizon is equal to that of the cosmological horizon the effective temperature of spacetime is the same we conjecture that the effective temperature has the same value in this way we can obtain the entropy formula of spacetime by solving the differential equation we find that the total entropy contain an extra terms besides the sum of the entropies of the two horizons the corrected terms of the entropy is a function of horizon radius ratio and is independent of the charge of the spacetime
|
[['the', 'fundamental', 'equation', 'of', 'the', 'thermodynamic', 'system', 'gives', 'the', 'relation', 'between', 'internal', 'energy', 'entropy', 'and', 'volume', 'of', 'two', 'adjacent', 'equilibrium', 'states', 'taking', 'higher', 'dimensional', 'charged', 'gaussbonnet', 'black', 'hole', 'in', 'de', 'sitter', 'space', 'as', 'a', 'thermodynamic', 'system', 'the', 'state', 'parameters', 'have', 'to', 'meet', 'the', 'fundamental', 'equation', 'of', 'thermodynamics', 'we', 'introduce', 'the', 'effective', 'thermodynamic', 'quantities', 'to', 'describe', 'the', 'black', 'hole', 'in', 'de', 'sitter', 'space', 'considering', 'that', 'in', 'the', 'lukewarm', 'case', 'the', 'temperature', 'of', 'the', 'black', 'hole', 'horizon', 'is', 'equal', 'to', 'that', 'of', 'the', 'cosmological', 'horizon', 'the', 'effective', 'temperature', 'of', 'spacetime', 'is', 'the', 'same', 'we', 'conjecture', 'that', 'the', 'effective', 'temperature', 'has', 'the', 'same', 'value', 'in', 'this', 'way', 'we', 'can', 'obtain', 'the', 'entropy', 'formula', 'of', 'spacetime', 'by', 'solving', 'the', 'differential', 'equation', 'we', 'find', 'that', 'the', 'total', 'entropy', 'contain', 'an', 'extra', 'terms', 'besides', 'the', 'sum', 'of', 'the', 'entropies', 'of', 'the', 'two', 'horizons', 'the', 'corrected', 'terms', 'of', 'the', 'entropy', 'is', 'a', 'function', 'of', 'horizon', 'radius', 'ratio', 'and', 'is', 'independent', 'of', 'the', 'charge', 'of', 'the', 'spacetime']]
|
[-0.17606266854336755, 0.13457100651947762, -0.11677818151729756, 0.08879967456106565, -0.02380401331861064, -0.09463865541319989, 0.010650073383120622, 0.2358798857532301, -0.20001086655933903, -0.29053029901225047, 0.07374511711568858, -0.32678093683741893, -0.05910461456163452, 0.14593811300378176, -0.055463385428507, 0.04034419688059357, -0.04593901068071759, 0.09787920388867552, -0.11585142851496737, -0.24773924365791977, 0.3993690568110291, 0.09332878495794984, 0.26951494151667793, 0.05549017080609575, 0.1581563620524973, -0.0011779711070710665, 0.03856344485315699, 0.08891499833878914, -0.20546777562019355, 0.07693888109987133, 0.2048863244693984, 0.12614867488194495, 0.2020221295555667, -0.3721593051809091, -0.23392061067528366, 0.10972588499656545, 0.12349392881956678, 0.14837655192973245, -0.021535515117476572, -0.21621813364297668, 0.04042278002338402, -0.206510202503769, -0.15853988302361993, -0.04732452680315799, 0.051590952828948225, -0.04672062112920502, -0.17116098047333694, 0.16046568608726375, 0.04960321737072612, -0.05558238101759984, -0.15059549383578952, -0.07091236967628575, -0.08857612721856285, 0.12448835971548497, 0.10474290028097308, 0.0031906371268461335, 0.15098773933794796, -0.0885685626042618, -0.084203077816996, 0.3393165210859393, -0.08963041473472924, -0.21557361493765745, 0.135085277426285, -0.2087053256519373, -0.07592817416426333, 0.0940106159878555, 0.11784102467222596, 0.16833150146072204, -0.1581070579928141, 0.1743642426932043, 0.0010123921348859774, 0.159334170157617, 0.10111096423886623, 0.07604051538912943, 0.30018106515595466, 0.10149334497609229, 0.0690906462069226, 0.18320399626713163, -0.03783472846174296, -0.1404397700907393, -0.3568183379892096, -0.23753953439406114, -0.1785381957398048, 0.08266052377041218, -0.21819065336951454, -0.19401589568716082, 0.3227146071493157, 0.11898238660069183, 0.17575900164233674, 0.01154526098156875, 0.25743763692934746, 0.1865021697700949, 0.01763217280612989, 0.095788686325387, 0.29439535259368754, 0.12387318993807307, 0.13679513332372495, -0.2909040674040059, -0.017533682892977628, 0.14928218549697325]
|
1,803.09457
|
A holistic perspective on the dynamics of G035.39-00.33: the interplay
between gas and magnetic fields
|
Magnetic field is one of the key agents that play a crucial role in shaping
molecular clouds and regulating star formation, yet the complete information on
the magnetic field is not well constrained due to the limitations in
observations. We study the magnetic field in the massive infrared dark cloud
G035.39-00.33 from dust continuum polarization observations at 850 $\micron$
with SCUBA-2/POL-2 at JCMT. The magnetic field tends to be perpendicular to the
densest part of the main filament (F$_{M}$), whereas it has a less defined
relative orientation in the rest of the structure, where it tends to be
parallel to some diffuse regions. A mean plane-of-the-sky magnetic field
strength of $\sim$50 $\mu$G for F$_{M}$ is obtained using
Davis-Chandrasekhar-Fermi method. Based on $^{13}$CO (1-0) line observations,
we suggest a formation scenario of F$_{M}$ due to large-scale ($\sim$10 pc)
cloud-cloud collision. Using additional NH$_3$ line data, we estimate that
F$_{M}$ will be gravitationally unstable if it is only supported by thermal
pressure and turbulence. The northern part of F$_{M}$, however, can be
stabilized by a modest additional support from the local magnetic field. The
middle and southern parts of F$_{M}$ are likely unstable even if the magnetic
field support is taken into account. We claim that the clumps in F$_{M}$ may be
supported by turbulence and magnetic fields against gravitational collapse.
Finally, we identified for the first time a massive ($\sim$200 M$_{\sun}$),
collapsing starless clump candidate, "c8", in G035.39-00.33. The magnetic field
surrounding "c8" is likely pinched, hinting at an accretion flow along the
filament.
|
astro-ph.GA astro-ph.SR
|
magnetic field is one of the key agents that play a crucial role in shaping molecular clouds and regulating star formation yet the complete information on the magnetic field is not well constrained due to the limitations in observations we study the magnetic field in the massive infrared dark cloud g035390033 from dust continuum polarization observations at 850 micron with scuba2pol2 at jcmt the magnetic field tends to be perpendicular to the densest part of the main filament f_m whereas it has a less defined relative orientation in the rest of the structure where it tends to be parallel to some diffuse regions a mean planeofthesky magnetic field strength of sim50 mug for f_m is obtained using davischandrasekharfermi method based on 13co 10 line observations we suggest a formation scenario of f_m due to largescale sim10 pc cloudcloud collision using additional nh_3 line data we estimate that f_m will be gravitationally unstable if it is only supported by thermal pressure and turbulence the northern part of f_m however can be stabilized by a modest additional support from the local magnetic field the middle and southern parts of f_m are likely unstable even if the magnetic field support is taken into account we claim that the clumps in f_m may be supported by turbulence and magnetic fields against gravitational collapse finally we identified for the first time a massive sim200 m_sun collapsing starless clump candidate c8 in g035390033 the magnetic field surrounding c8 is likely pinched hinting at an accretion flow along the filament
|
[['magnetic', 'field', 'is', 'one', 'of', 'the', 'key', 'agents', 'that', 'play', 'a', 'crucial', 'role', 'in', 'shaping', 'molecular', 'clouds', 'and', 'regulating', 'star', 'formation', 'yet', 'the', 'complete', 'information', 'on', 'the', 'magnetic', 'field', 'is', 'not', 'well', 'constrained', 'due', 'to', 'the', 'limitations', 'in', 'observations', 'we', 'study', 'the', 'magnetic', 'field', 'in', 'the', 'massive', 'infrared', 'dark', 'cloud', 'g035390033', 'from', 'dust', 'continuum', 'polarization', 'observations', 'at', '850', 'micron', 'with', 'scuba2pol2', 'at', 'jcmt', 'the', 'magnetic', 'field', 'tends', 'to', 'be', 'perpendicular', 'to', 'the', 'densest', 'part', 'of', 'the', 'main', 'filament', 'f_m', 'whereas', 'it', 'has', 'a', 'less', 'defined', 'relative', 'orientation', 'in', 'the', 'rest', 'of', 'the', 'structure', 'where', 'it', 'tends', 'to', 'be', 'parallel', 'to', 'some', 'diffuse', 'regions', 'a', 'mean', 'planeofthesky', 'magnetic', 'field', 'strength', 'of', 'sim50', 'mug', 'for', 'f_m', 'is', 'obtained', 'using', 'davischandrasekharfermi', 'method', 'based', 'on', '13co', '10', 'line', 'observations', 'we', 'suggest', 'a', 'formation', 'scenario', 'of', 'f_m', 'due', 'to', 'largescale', 'sim10', 'pc', 'cloudcloud', 'collision', 'using', 'additional', 'nh_3', 'line', 'data', 'we', 'estimate', 'that', 'f_m', 'will', 'be', 'gravitationally', 'unstable', 'if', 'it', 'is', 'only', 'supported', 'by', 'thermal', 'pressure', 'and', 'turbulence', 'the', 'northern', 'part', 'of', 'f_m', 'however', 'can', 'be', 'stabilized', 'by', 'a', 'modest', 'additional', 'support', 'from', 'the', 'local', 'magnetic', 'field', 'the', 'middle', 'and', 'southern', 'parts', 'of', 'f_m', 'are', 'likely', 'unstable', 'even', 'if', 'the', 'magnetic', 'field', 'support', 'is', 'taken', 'into', 'account', 'we', 'claim', 'that', 'the', 'clumps', 'in', 'f_m', 'may', 'be', 'supported', 'by', 'turbulence', 'and', 'magnetic', 'fields', 'against', 'gravitational', 'collapse', 'finally', 'we', 'identified', 'for', 'the', 'first', 'time', 'a', 'massive', 'sim200', 'm_sun', 'collapsing', 'starless', 'clump', 'candidate', 'c8', 'in', 'g035390033', 'the', 'magnetic', 'field', 'surrounding', 'c8', 'is', 'likely', 'pinched', 'hinting', 'at', 'an', 'accretion', 'flow', 'along', 'the', 'filament']]
|
[-0.1543320407661321, 0.1533461481001665, -0.040838571664478095, 0.053465761627728446, -0.08463315986325994, -0.03147122046230213, -0.0015946815119749526, 0.4224065241980411, -0.21195775293375527, -0.3032124790119096, 0.08617732183830369, -0.20385639837066208, -0.0595793325543156, 0.1658563547724274, 0.025478905350494657, -0.08143924718670961, 0.025341141069056616, -0.00842118930692474, 0.04218333963136603, -0.2352007219784095, 0.3091771651284828, 0.08240271289139942, 0.18998914321381893, 0.0460266497425942, 0.0435634881913078, -0.12331554350916236, -0.02591955716516601, 0.03727719901750485, -0.13798125509062614, 0.029295007877480534, 0.19587336109936357, 0.07335637253339565, 0.26169499158, -0.4243617701891159, -0.18669224409238686, 0.08506451702551059, 0.20785393544827543, 0.06545339402047888, -0.02509064097738167, -0.27730416082629256, 0.10925265382083746, -0.1183062613271186, -0.18243573098776064, 0.01986374082283989, 0.04689464482223792, 0.026750861350650204, -0.26980100418875247, 0.11754656373892748, 0.0144795396178187, 0.08951710536336852, -0.13642770955006459, -0.10164615583129316, -0.07584510090306312, 0.07379905832284647, 0.047496127043222446, 0.17198692932068962, 0.24218325338248783, -0.14338219659827975, -0.017222881051508473, 0.38845617853341596, -0.07799539884061753, -0.07408640061279699, 0.18881022427388142, -0.2041883248177963, -0.1732761219110606, 0.2215658809166468, 0.1388622916761845, 0.08098863094808563, -0.09146104058296288, 0.02469462695040016, -0.03547659151289346, 0.19878637354676834, 0.062156397947258066, 0.0055202286633189825, 0.34039215992263977, 0.11347946785907778, 0.04800501275837185, 0.1431707102229767, -0.18548156026499493, -0.06883034587926454, -0.26335412601336805, -0.13268967496512074, -0.17020026364711127, 0.07434587985306511, -0.09784953939587078, -0.1087651279134055, 0.294588981159327, 0.1392740279935958, 0.20347384616569986, -0.02849481612562187, 0.34082014160969903, 0.08478206606435826, 0.13481771808472418, 0.15018446966894858, 0.2848921223153916, 0.22417205063227033, 0.10702128904328372, -0.21633135655983574, 0.02951487667289459, -0.01733185809626732]
|
1,803.09458
|
A new series solution method for the transmission problem
|
We derive analytic series representation for the Neumann-Poincare operator
using the exterior conformal mapping for general shape domains. We derive the
formula by using the Faber polynomial basis for arbitrary Lipschitz domains.
With the proposed method we can approximate the spectrum of the smooth domains
by finding the eigenvalues of matrices. We also find the connection of the
boundary integral equations with the exterior conformal mapping, explicitly.
|
math.AP
|
we derive analytic series representation for the neumannpoincare operator using the exterior conformal mapping for general shape domains we derive the formula by using the faber polynomial basis for arbitrary lipschitz domains with the proposed method we can approximate the spectrum of the smooth domains by finding the eigenvalues of matrices we also find the connection of the boundary integral equations with the exterior conformal mapping explicitly
|
[['we', 'derive', 'analytic', 'series', 'representation', 'for', 'the', 'neumannpoincare', 'operator', 'using', 'the', 'exterior', 'conformal', 'mapping', 'for', 'general', 'shape', 'domains', 'we', 'derive', 'the', 'formula', 'by', 'using', 'the', 'faber', 'polynomial', 'basis', 'for', 'arbitrary', 'lipschitz', 'domains', 'with', 'the', 'proposed', 'method', 'we', 'can', 'approximate', 'the', 'spectrum', 'of', 'the', 'smooth', 'domains', 'by', 'finding', 'the', 'eigenvalues', 'of', 'matrices', 'we', 'also', 'find', 'the', 'connection', 'of', 'the', 'boundary', 'integral', 'equations', 'with', 'the', 'exterior', 'conformal', 'mapping', 'explicitly']]
|
[-0.1236769941760533, -0.016070578594817156, -0.09865612439366418, 0.040945379828005585, -0.1285119132319493, -0.06724070251655223, -0.03877021069290923, 0.3506557481613622, -0.2884872530642619, -0.23022172448517225, 0.15057929304998313, -0.232639728489318, -0.2152637940442273, 0.1762895651175571, -0.009916044076654449, 0.12210976875929246, 0.03272291374003598, 0.032788153348573996, -0.16772624371406525, -0.1798834986706723, 0.4314795690797158, -0.05522537898661485, 0.21967597898971566, 0.06026921604773892, 0.13765765248394723, 0.03131931993950492, -0.03818954136778614, -0.026285680671180808, -0.18597397400038457, 0.21063216666364348, 0.26650268669976895, 0.10557020212342935, 0.18245436096869744, -0.43655554110656924, -0.18276396368755332, 0.11634177530406793, 0.1499753931551171, 0.061520724557340145, -0.032202521220906014, -0.3152929353666728, 0.07129324336689133, -0.12127074877272791, -0.20591710553740833, -0.09763182913745518, 0.019680397835240435, 0.047531516305101454, -0.31097149604292057, 0.0917119208767614, 0.053609399111079634, 0.06292622341816105, -0.1519605677241265, -0.07561367663116987, 0.011539767802095235, 0.13202989779746355, -0.006831957489502297, -0.0001476643843326106, 0.056451904045334504, -0.07028162473145483, -0.07073566234243144, 0.29730691282606836, -0.0990484830325664, -0.3203981617298811, 0.09840750374567153, -0.19719673433243784, -0.09998135567024183, 0.07036249388231715, 0.1055119043327312, 0.1778060419123564, -0.12484617629991983, 0.22221116744565653, -0.0824512627111303, 0.07335045026031448, 0.11306404152801677, -0.057119817906511085, 0.13325923586736865, 0.02779900375753641, 0.10746512124175901, 0.21548049709300943, -0.03166588362125652, -0.08878860947912309, -0.36374444019661023, -0.1611446580474279, -0.21643897714510338, 0.04391818344871055, -0.2103260295437788, -0.1996629940373684, 0.4186691563409656, 0.06577662650778987, 0.1866242714893462, 0.14105654932530737, 0.23495241639607434, 0.23397217624223055, 0.0629469027270132, 0.09636534680959893, 0.14757773952920045, 0.17048568591308683, 0.07319845778714698, -0.23178508946213372, -0.010551398143922882, 0.2126254581693393]
|
1,803.09459
|
Nonkinematic solar dynamo models with double-cell meridional circulation
|
Employing the standard solar interior model as input we construct a
dynamically-consistent nonlinear dynamo model that takes into account the
detailed description of the \Lambda- effect, turbulent pumping, magnetic
helicity balance, and magnetic feedback on the differential rotation and
meridional circulation. The background mean-field hydrodynamic model of the
solar convection zone accounts the solar-like angular velocity profile and the
double-cell meridional circulation. We investigate an impact of the nonlinear
magnetic field generation effects on the long-term variability and properties
of the magnetic cycle. The nonlinear dynamo solutions are studied in the wide
interval of the \alpha effect parameter from a slightly subcritical to
supercritical values. It is found that the magnetic cycle period decreases with
the increasing cycle's magnitude. The periodic long-term variations of the
magnetic cycle are excited in case of the overcritical \alpha effect. These
variations result from the hemispheric magnetic helicity exchange. It depends
on the magnetic diffusivity parameter and the magnetic helicity production
rate. The large-scale magnetic activity modifies the distribution of the
differential rotation and meridional circulation inside convection zone. It is
found that the magnetic feedback on the global flow affects the properties of
the long-term magnetic cycles. We confront our findings with solar and stellar
magnetic activity observations.
|
astro-ph.SR
|
employing the standard solar interior model as input we construct a dynamicallyconsistent nonlinear dynamo model that takes into account the detailed description of the lambda effect turbulent pumping magnetic helicity balance and magnetic feedback on the differential rotation and meridional circulation the background meanfield hydrodynamic model of the solar convection zone accounts the solarlike angular velocity profile and the doublecell meridional circulation we investigate an impact of the nonlinear magnetic field generation effects on the longterm variability and properties of the magnetic cycle the nonlinear dynamo solutions are studied in the wide interval of the alpha effect parameter from a slightly subcritical to supercritical values it is found that the magnetic cycle period decreases with the increasing cycles magnitude the periodic longterm variations of the magnetic cycle are excited in case of the overcritical alpha effect these variations result from the hemispheric magnetic helicity exchange it depends on the magnetic diffusivity parameter and the magnetic helicity production rate the largescale magnetic activity modifies the distribution of the differential rotation and meridional circulation inside convection zone it is found that the magnetic feedback on the global flow affects the properties of the longterm magnetic cycles we confront our findings with solar and stellar magnetic activity observations
|
[['employing', 'the', 'standard', 'solar', 'interior', 'model', 'as', 'input', 'we', 'construct', 'a', 'dynamicallyconsistent', 'nonlinear', 'dynamo', 'model', 'that', 'takes', 'into', 'account', 'the', 'detailed', 'description', 'of', 'the', 'lambda', 'effect', 'turbulent', 'pumping', 'magnetic', 'helicity', 'balance', 'and', 'magnetic', 'feedback', 'on', 'the', 'differential', 'rotation', 'and', 'meridional', 'circulation', 'the', 'background', 'meanfield', 'hydrodynamic', 'model', 'of', 'the', 'solar', 'convection', 'zone', 'accounts', 'the', 'solarlike', 'angular', 'velocity', 'profile', 'and', 'the', 'doublecell', 'meridional', 'circulation', 'we', 'investigate', 'an', 'impact', 'of', 'the', 'nonlinear', 'magnetic', 'field', 'generation', 'effects', 'on', 'the', 'longterm', 'variability', 'and', 'properties', 'of', 'the', 'magnetic', 'cycle', 'the', 'nonlinear', 'dynamo', 'solutions', 'are', 'studied', 'in', 'the', 'wide', 'interval', 'of', 'the', 'alpha', 'effect', 'parameter', 'from', 'a', 'slightly', 'subcritical', 'to', 'supercritical', 'values', 'it', 'is', 'found', 'that', 'the', 'magnetic', 'cycle', 'period', 'decreases', 'with', 'the', 'increasing', 'cycles', 'magnitude', 'the', 'periodic', 'longterm', 'variations', 'of', 'the', 'magnetic', 'cycle', 'are', 'excited', 'in', 'case', 'of', 'the', 'overcritical', 'alpha', 'effect', 'these', 'variations', 'result', 'from', 'the', 'hemispheric', 'magnetic', 'helicity', 'exchange', 'it', 'depends', 'on', 'the', 'magnetic', 'diffusivity', 'parameter', 'and', 'the', 'magnetic', 'helicity', 'production', 'rate', 'the', 'largescale', 'magnetic', 'activity', 'modifies', 'the', 'distribution', 'of', 'the', 'differential', 'rotation', 'and', 'meridional', 'circulation', 'inside', 'convection', 'zone', 'it', 'is', 'found', 'that', 'the', 'magnetic', 'feedback', 'on', 'the', 'global', 'flow', 'affects', 'the', 'properties', 'of', 'the', 'longterm', 'magnetic', 'cycles', 'we', 'confront', 'our', 'findings', 'with', 'solar', 'and', 'stellar', 'magnetic', 'activity', 'observations']]
|
[-0.2016753096008537, 0.21689657823632688, -0.006904823544276197, 0.09601976172317092, -0.07539388059933738, -0.006145683739606927, 0.01477564312404067, 0.32203434039270734, -0.27817141273081664, -0.3498136888462596, 0.043873081975275785, -0.22465105426651086, -0.12226823866594493, 0.22114757937606333, 0.0008334947795402713, -0.011448782495799384, 0.05539954449390856, 0.018088417572946082, 0.025638341183047288, -0.16138104864441585, 0.29135084267160516, 0.058292302895882504, 0.24731510133005496, 0.007936613997671663, 0.06005703567459089, -0.07598973746161636, -0.017671403307439305, 0.04094631880090186, -0.17318720516359018, 0.005701083037150433, 0.0983876708645101, 0.02479824374725179, 0.20178106638727847, -0.47167921575104316, -0.2637644857804223, 0.046737111090659735, 0.13101934927810982, 0.08129191278670234, -0.033866730178479194, -0.19795236437490618, 0.029481985520503323, -0.11813070048555369, -0.1294578335634092, -0.03736271675017367, 0.059266255621616616, 0.041290678390498395, -0.32543079181597, 0.11437615515300777, 0.0912054288064743, 0.16347998767387031, -0.17106373732932276, -0.07930945852407958, -0.16078250961489662, 0.142160509208717, 0.12530542388728752, 0.04542257047269675, 0.21671188668682945, -0.1527055959421687, -0.044756726956949, 0.34414807188483637, -0.0997059906128703, -0.13765294029400116, 0.11560540356923167, -0.2593757201622172, -0.10386152106632547, 0.1539457820923772, 0.18387529458396318, 0.10843983986755697, -0.07343435693395937, 0.027889748165531584, -0.041164625995429006, 0.16532039565897388, 0.0255355816334486, -0.027611916805276783, 0.2661583721651923, 0.19783206785199936, 0.07386664454825223, 0.08254327405380403, -0.20859469996975372, -0.11921379354032802, -0.25420346649409065, -0.06866818178081657, -0.06297862562350928, 0.06627792890024621, -0.12571456074074377, -0.1848631678819202, 0.4336975278838242, 0.16218027885003788, 0.13498652000434516, -0.014925645675691889, 0.3382001768275187, 0.16779603424550193, 0.062498515341558675, 0.11692004968389505, 0.3237664308819193, 0.25292152491080144, 0.2177347432185964, -0.36625058947062894, 0.08938017956140201, 0.06476087480806178]
|
1,803.0946
|
Scalable inference for crossed random effects models
|
We analyze the complexity of Gibbs samplers for inference in crossed random
effect models used in modern analysis of variance. We demonstrate that for
certain designs the plain vanilla Gibbs sampler is not scalable, in the sense
that its complexity is worse than proportional to the number of parameters and
data. We thus propose a simple modification leading to a collapsed Gibbs
sampler that is provably scalable. Although our theory requires some
balancedness assumptions on the data designs, we demonstrate in simulated and
real datasets that the rates it predicts match remarkably the correct rates in
cases where the assumptions are violated. We also show that the collapsed Gibbs
sampler, extended to sample further unknown hyperparameters, outperforms
significantly alternative state of the art algorithms.
|
stat.CO stat.ME stat.ML
|
we analyze the complexity of gibbs samplers for inference in crossed random effect models used in modern analysis of variance we demonstrate that for certain designs the plain vanilla gibbs sampler is not scalable in the sense that its complexity is worse than proportional to the number of parameters and data we thus propose a simple modification leading to a collapsed gibbs sampler that is provably scalable although our theory requires some balancedness assumptions on the data designs we demonstrate in simulated and real datasets that the rates it predicts match remarkably the correct rates in cases where the assumptions are violated we also show that the collapsed gibbs sampler extended to sample further unknown hyperparameters outperforms significantly alternative state of the art algorithms
|
[['we', 'analyze', 'the', 'complexity', 'of', 'gibbs', 'samplers', 'for', 'inference', 'in', 'crossed', 'random', 'effect', 'models', 'used', 'in', 'modern', 'analysis', 'of', 'variance', 'we', 'demonstrate', 'that', 'for', 'certain', 'designs', 'the', 'plain', 'vanilla', 'gibbs', 'sampler', 'is', 'not', 'scalable', 'in', 'the', 'sense', 'that', 'its', 'complexity', 'is', 'worse', 'than', 'proportional', 'to', 'the', 'number', 'of', 'parameters', 'and', 'data', 'we', 'thus', 'propose', 'a', 'simple', 'modification', 'leading', 'to', 'a', 'collapsed', 'gibbs', 'sampler', 'that', 'is', 'provably', 'scalable', 'although', 'our', 'theory', 'requires', 'some', 'balancedness', 'assumptions', 'on', 'the', 'data', 'designs', 'we', 'demonstrate', 'in', 'simulated', 'and', 'real', 'datasets', 'that', 'the', 'rates', 'it', 'predicts', 'match', 'remarkably', 'the', 'correct', 'rates', 'in', 'cases', 'where', 'the', 'assumptions', 'are', 'violated', 'we', 'also', 'show', 'that', 'the', 'collapsed', 'gibbs', 'sampler', 'extended', 'to', 'sample', 'further', 'unknown', 'hyperparameters', 'outperforms', 'significantly', 'alternative', 'state', 'of', 'the', 'art', 'algorithms']]
|
[-0.044205993781947804, 0.08714523386480587, -0.12055247976264406, 0.1485055609664414, -0.06817067011950477, -0.16417531932388701, 0.08843948220225772, 0.4315179453021096, -0.24410772064865957, -0.3082501822481713, 0.09858654528356818, -0.21390692878048867, -0.13984634176613914, 0.23423059503998486, -0.12250258061554163, 0.0627624860945, 0.12088145233217566, 0.02728504878318598, -0.09647363276904329, -0.31537448377498695, 0.24727751211556157, 0.08671930279102057, 0.3723842802761693, -0.022016175207681954, 0.12539151693659556, -0.03716800475658308, 0.03387943435847128, 0.03173812458418333, -0.13991043843347026, 0.08998434506206503, 0.23257847838780318, 0.19562523141728655, 0.27933432692201854, -0.3856924515094438, -0.18857001704013637, 0.15803602678070386, 0.13153257282946498, 0.13266135042548768, -0.044810316376125196, -0.22622587544948705, 0.07495742990079546, -0.15919424928236572, -0.08478530298828357, -0.178183990042007, -0.0727048932063964, 0.005256957359491817, -0.3009182545394006, 0.1071005911440044, 0.08243253818833299, -0.018472793196598367, -0.02076575927710491, -0.15708273739554926, 0.01843686761792689, 0.03854961879645294, 0.04698526395499827, -0.018645592323023704, 0.12574409858338656, -0.1333780220123909, -0.1383117848505912, 0.32933872450244495, -0.06501965834855407, -0.23318870958962268, 0.1906369309534409, -0.09802919506065307, -0.18856463472794502, 0.12221082692755567, 0.13484653483911027, 0.11169750190803766, -0.12113109662107402, 0.1005595728497757, -0.02437336840516617, 0.17432710785238492, 0.005371724206563686, -0.003721561046287177, 0.08953671989917394, 0.17426504358656764, 0.08673197173254354, 0.17547028486179414, -0.10072801253878541, -0.1676460520848782, -0.2577945530910285, -0.1495967238151934, -0.2319563586685446, -0.007088692728200018, -0.13139054212966114, -0.1896721967495978, 0.3590641577968434, 0.27973780403995224, 0.18815806106243643, 0.12574653849456338, 0.32323603921254435, 0.04581850524259461, 0.05743604351300746, 0.14825270785724803, 0.1777863653084252, 0.07817394405813707, 0.031185954873029505, -0.1811690858599069, 0.13677930439852418, 0.004124100343746719]
|
1,803.09461
|
A clustering approach to infer Wikipedia contributors' profile
|
In online communities, recent studies have strongly improved our knowledge
about the different types or profiles of contributors, from casual to very
involved ones, through focused people. However they do so by using very complex
methodologies (qualitative-quantitative mix, with a high workload to manually
codify/characterize the edits), making their replication for the practitioners
limited. These studies are on the English Wikipedia only. The objective of this
paper is to highlight different profiles of contributors with clustering
techniques. The originality is to show how using only the edits, and their
distribution over time, allows to build these contributors profiles with a good
accuracy and stability amongst languages. The methodology is validated with
both Romanian and Danish wikis. The highlighted profiles are identifiable early
in the history of involvement, suggesting that light monitoring of newcomers
may be sufficient to adapt the interaction with them and increase the retention
rate.
|
cs.HC cs.CY stat.AP
|
in online communities recent studies have strongly improved our knowledge about the different types or profiles of contributors from casual to very involved ones through focused people however they do so by using very complex methodologies qualitativequantitative mix with a high workload to manually codifycharacterize the edits making their replication for the practitioners limited these studies are on the english wikipedia only the objective of this paper is to highlight different profiles of contributors with clustering techniques the originality is to show how using only the edits and their distribution over time allows to build these contributors profiles with a good accuracy and stability amongst languages the methodology is validated with both romanian and danish wikis the highlighted profiles are identifiable early in the history of involvement suggesting that light monitoring of newcomers may be sufficient to adapt the interaction with them and increase the retention rate
|
[['in', 'online', 'communities', 'recent', 'studies', 'have', 'strongly', 'improved', 'our', 'knowledge', 'about', 'the', 'different', 'types', 'or', 'profiles', 'of', 'contributors', 'from', 'casual', 'to', 'very', 'involved', 'ones', 'through', 'focused', 'people', 'however', 'they', 'do', 'so', 'by', 'using', 'very', 'complex', 'methodologies', 'qualitativequantitative', 'mix', 'with', 'a', 'high', 'workload', 'to', 'manually', 'codifycharacterize', 'the', 'edits', 'making', 'their', 'replication', 'for', 'the', 'practitioners', 'limited', 'these', 'studies', 'are', 'on', 'the', 'english', 'wikipedia', 'only', 'the', 'objective', 'of', 'this', 'paper', 'is', 'to', 'highlight', 'different', 'profiles', 'of', 'contributors', 'with', 'clustering', 'techniques', 'the', 'originality', 'is', 'to', 'show', 'how', 'using', 'only', 'the', 'edits', 'and', 'their', 'distribution', 'over', 'time', 'allows', 'to', 'build', 'these', 'contributors', 'profiles', 'with', 'a', 'good', 'accuracy', 'and', 'stability', 'amongst', 'languages', 'the', 'methodology', 'is', 'validated', 'with', 'both', 'romanian', 'and', 'danish', 'wikis', 'the', 'highlighted', 'profiles', 'are', 'identifiable', 'early', 'in', 'the', 'history', 'of', 'involvement', 'suggesting', 'that', 'light', 'monitoring', 'of', 'newcomers', 'may', 'be', 'sufficient', 'to', 'adapt', 'the', 'interaction', 'with', 'them', 'and', 'increase', 'the', 'retention', 'rate']]
|
[-0.055597566916569044, 0.06277638282276027, -0.0801114486510489, 0.08692279000517797, -0.13738548267498765, -0.13163119483185368, 0.086366977922982, 0.44031587743187606, -0.2161177897902384, -0.3975947889920375, 0.1096357550354011, -0.3237929218497537, -0.12141468614652395, 0.1929620949332985, -0.09067667034543948, 9.459047897221292e-06, 0.10222810596125582, 0.020555539203373944, -0.008449995619952935, -0.32296143704387426, 0.3109289449783144, 0.08606455106390258, 0.3042488703759362, 0.04693372821282238, 0.02416841065501539, -0.034537952300799014, -0.13030230263204232, -0.00218076275801924, -0.06645868538444494, 0.16306527746101357, 0.32449844624083296, 0.20510914724651877, 0.32055458602533765, -0.4403412018149887, -0.19680342708207182, 0.06998816937565396, 0.13459143308206614, 0.09210585728877747, -0.03935358859120217, -0.30070198310079843, 0.09020927460060442, -0.15251408338431932, -0.07843962723504089, -0.08300220248550942, 0.0028188135686222056, 0.08917620782150364, -0.20717388616989635, 0.03216219796122958, 0.013056097948470803, 0.09823055262039479, -0.04312288965463753, -0.11620900136967229, -0.025148072673888137, 0.2184722190635113, 0.11140694326485112, 0.0003792305910730199, 0.1404777786866698, -0.15508160741093938, -0.09670912501025843, 0.37234152092961975, -0.03635326319067956, -0.16984890549354356, 0.2635200465949609, -0.1104851384864074, -0.14147064085628785, 0.09496847114666071, 0.1863151117357942, 0.10530863899405893, -0.16415759246821884, -0.012335122012762888, 0.02619324646306492, 0.20963964530598525, 0.05665664446910154, -0.010731238514593202, 0.21275064441828337, 0.14810013982518386, 0.004267933411676794, 0.08057691594777144, -0.015791706131868484, -0.07848326700790594, -0.19033000892194066, -0.10143329041582622, -0.11427753395560414, -0.009900651116255824, -0.05637476881224445, -0.1314174414385901, 0.398173562874571, 0.18460217784621358, 0.16877487365615695, 0.06765822028065074, 0.28630802466546834, 0.0261334302657354, 0.10757774005529203, 0.07537323441069368, 0.2043806984486403, 0.04057785903888257, 0.16601546446725804, -0.1783789835291379, 0.16587493922768723, -0.05810349734104557]
|
1,803.09462
|
A priori tests of a novel LES approach to compressible variable density
turbulence
|
We assess the viability of a recently proposed novel approach to LES for
compressible variable density flows by means of a priori tests. The a priori
tests have been carried out filtering a two-dimensional DNS database of the
classic lock-exchange benchmark. The tests confirm that additional terms should
be accounted for in subgrid scale modeling of variable density flows, with
respect to the terms usually considered in the traditional approach. Several
alternatives for the modeling of these terms are assessed and discussed.
|
physics.flu-dyn
|
we assess the viability of a recently proposed novel approach to les for compressible variable density flows by means of a priori tests the a priori tests have been carried out filtering a twodimensional dns database of the classic lockexchange benchmark the tests confirm that additional terms should be accounted for in subgrid scale modeling of variable density flows with respect to the terms usually considered in the traditional approach several alternatives for the modeling of these terms are assessed and discussed
|
[['we', 'assess', 'the', 'viability', 'of', 'a', 'recently', 'proposed', 'novel', 'approach', 'to', 'les', 'for', 'compressible', 'variable', 'density', 'flows', 'by', 'means', 'of', 'a', 'priori', 'tests', 'the', 'a', 'priori', 'tests', 'have', 'been', 'carried', 'out', 'filtering', 'a', 'twodimensional', 'dns', 'database', 'of', 'the', 'classic', 'lockexchange', 'benchmark', 'the', 'tests', 'confirm', 'that', 'additional', 'terms', 'should', 'be', 'accounted', 'for', 'in', 'subgrid', 'scale', 'modeling', 'of', 'variable', 'density', 'flows', 'with', 'respect', 'to', 'the', 'terms', 'usually', 'considered', 'in', 'the', 'traditional', 'approach', 'several', 'alternatives', 'for', 'the', 'modeling', 'of', 'these', 'terms', 'are', 'assessed', 'and', 'discussed']]
|
[-0.08888690207592245, 0.00911941639397566, -0.10428470365203373, 0.08074817769392678, -0.0439100217346738, -0.10800358381906025, 0.016013602317288156, 0.31281718966074107, -0.20780402748482074, -0.34395044751070647, 0.14850534152001052, -0.21738592361486175, -0.10291975791134485, 0.22770605002325484, -0.03468921578988978, 0.15245244650897094, 0.05837669815703454, -0.029417844602792727, -0.06057776191283199, -0.23168830454304087, 0.297618616537032, 0.1164922577771926, 0.303941910586706, 0.0013507080900414688, 0.09426564064512892, -0.0683361948638155, -0.13883212290806468, 0.11285938404318763, -0.14866192852441157, 0.07781439959412305, 0.2419517828753536, 0.09086704243076738, 0.31789660412909054, -0.42936759385870904, -0.3328319859645534, 0.05648644082248211, 0.12879375586990358, 0.05510275665792727, -0.06183081240501118, -0.29560552060422374, 0.14107692560817048, -0.21039163117955734, -0.10678239758467166, -0.1472682913242862, -0.047707532867562116, 0.07359864802395062, -0.3001480777861505, 0.10900363075637781, 0.01206229345464125, 0.0738252329344793, -0.03953226928871761, -0.12891070430008014, 0.002674331048094645, 0.09429117053656316, 0.08896411492960618, -0.029307337900873545, 0.09691189950127609, -0.1212222618561965, -0.1232360555831536, 0.42043730534794854, -0.06383489901923983, -0.28571762657928756, 0.21588549191961293, -0.06301824435330473, -0.13314655030049702, 0.0951971983843733, 0.1777030098579949, 0.13296909091948736, -0.16761398938961508, 0.023820152403304082, -0.06745520486530461, 0.16676525832948888, 0.025947670186103163, -0.024210616236370875, 0.20337556244339794, 0.19632148512116657, -0.01921797185716015, 0.08965707176063982, -0.11393774313874906, -0.12356091241874709, -0.31077103818789487, -0.17010254857539223, -0.17257338824750082, -0.028023347610653174, -0.08061405068398993, -0.15329260406334225, 0.3694652576317511, 0.2034857275259749, 0.13374264721145354, 0.0115583868492849, 0.30517396117310697, 0.11826549939493217, 0.05777044395530006, 0.06080874193050876, 0.24626808092225252, 0.10751705507963623, 0.05300132033028981, -0.19911256859294799, 0.08523812663468827, 0.06555836283454172]
|
1,803.09463
|
Gaia: 3-dimensional census of the Milky Way Galaxy
|
Astrometry from space has unique advantages over ground-based observations:
the all-sky coverage, relatively stable, and temperature and gravity invariant
operating environment delivers precision, accuracy and sample volume several
orders of magnitude greater than ground-based results. Even more importantly,
absolute astrometry is possible. The European Space Agency Cornerstone mission
Gaia is delivering that promise. Gaia provides 5-D phase space measurements - 3
spatial coordinates and two space motions in the plane of the sky - for a
representative sample of the Milky way's stellar populations, including over
two billion stars, being about one percent of the stars over about 50 percent
of the radius. Full 6-D phase space data is delivered from Gaia's line-of-sight
(radial) velocities for the 300 million brightest stars. These data make
substantial contributions to astrophysics and fundamental physics on scales
from the Solar System to cosmology. A knowledge revolution is underway.
|
astro-ph.IM gr-qc physics.ed-ph
|
astrometry from space has unique advantages over groundbased observations the allsky coverage relatively stable and temperature and gravity invariant operating environment delivers precision accuracy and sample volume several orders of magnitude greater than groundbased results even more importantly absolute astrometry is possible the european space agency cornerstone mission gaia is delivering that promise gaia provides 5d phase space measurements 3 spatial coordinates and two space motions in the plane of the sky for a representative sample of the milky ways stellar populations including over two billion stars being about one percent of the stars over about 50 percent of the radius full 6d phase space data is delivered from gaias lineofsight radial velocities for the 300 million brightest stars these data make substantial contributions to astrophysics and fundamental physics on scales from the solar system to cosmology a knowledge revolution is underway
|
[['astrometry', 'from', 'space', 'has', 'unique', 'advantages', 'over', 'groundbased', 'observations', 'the', 'allsky', 'coverage', 'relatively', 'stable', 'and', 'temperature', 'and', 'gravity', 'invariant', 'operating', 'environment', 'delivers', 'precision', 'accuracy', 'and', 'sample', 'volume', 'several', 'orders', 'of', 'magnitude', 'greater', 'than', 'groundbased', 'results', 'even', 'more', 'importantly', 'absolute', 'astrometry', 'is', 'possible', 'the', 'european', 'space', 'agency', 'cornerstone', 'mission', 'gaia', 'is', 'delivering', 'that', 'promise', 'gaia', 'provides', '5d', 'phase', 'space', 'measurements', '3', 'spatial', 'coordinates', 'and', 'two', 'space', 'motions', 'in', 'the', 'plane', 'of', 'the', 'sky', 'for', 'a', 'representative', 'sample', 'of', 'the', 'milky', 'ways', 'stellar', 'populations', 'including', 'over', 'two', 'billion', 'stars', 'being', 'about', 'one', 'percent', 'of', 'the', 'stars', 'over', 'about', '50', 'percent', 'of', 'the', 'radius', 'full', '6d', 'phase', 'space', 'data', 'is', 'delivered', 'from', 'gaias', 'lineofsight', 'radial', 'velocities', 'for', 'the', '300', 'million', 'brightest', 'stars', 'these', 'data', 'make', 'substantial', 'contributions', 'to', 'astrophysics', 'and', 'fundamental', 'physics', 'on', 'scales', 'from', 'the', 'solar', 'system', 'to', 'cosmology', 'a', 'knowledge', 'revolution', 'is', 'underway']]
|
[-0.0787116451259427, 0.12982267959979626, -0.05450024931612884, 0.05986869569890804, -0.13123076269679793, -0.010929712359990242, 0.05846394635868114, 0.3862751271078875, -0.19092256713881564, -0.4219631592047886, 0.08740444384838297, -0.3567496607093219, 0.022586517770525436, 0.29425345395337527, -0.05921987362179748, 0.015440009779077103, 0.1434958234058798, -0.03107870674633067, -0.08736126379537869, -0.3259548695395622, 0.261642545120607, 0.07748908926667251, 0.2026990398266156, -0.1009751466155367, 0.13308319486972783, -0.08057635646923379, -0.10454335168346723, -0.008844569929863957, -0.14657131048161445, 0.10705045842185197, 0.2635783594951007, 0.1792350202744735, 0.25142125016681743, -0.3208888735695747, -0.22616182328333004, 0.06319233156006102, 0.12873141959466985, 0.031386788284142084, -0.019398912341144547, -0.2976036922199468, 0.01511967339402091, -0.17485695237188903, -0.19694645737599528, -0.05046170517805518, 0.07461606417036563, -0.03862786866908132, -0.18130893628834419, 0.0651737560286895, -0.04056620474537494, 0.14091718507746995, -0.11625692342296505, -0.13830776137060447, -0.0547735022584265, 0.1481819274625413, 0.001503008227585487, 0.11273845506530307, 0.12287502048510901, -0.10712058652310409, -0.04311697460337162, 0.4696664268701849, -0.07465139692897242, -0.03671593894250691, 0.17377559630721676, -0.2767410424232981, -0.11323615010421147, 0.1631916167483416, 0.18559700916980354, 0.11209651403818574, -0.1707117598320187, 0.04541444393902899, 0.04228044173624498, 0.21744540883769267, 0.09297419879847849, 0.0981556150199793, 0.29156898822582944, 0.20146376983931577, 0.14377271795225605, 0.008751204546826276, -0.23631897822292877, -0.09241901484726352, -0.25577740880831235, -0.12331936642212767, -0.1307237148555455, 0.053048544442018786, -0.16402820885231847, -0.051497801811217894, 0.38060277149828914, 0.1585539936081467, 0.0967187083680445, 0.023466252682494446, 0.3655413650894459, -0.03358214429307493, 0.11442406456851938, 0.07334101005313053, 0.3128623966894991, 0.12313428626749927, 0.10368548103027754, -0.12692635009412875, 0.02524765473987225, -0.016442126209165533]
|
1,803.09464
|
Spectroscopy and spectropolarimetry of AGN: from observations to
modelling
|
Active galactic nuclei (AGN) are one of the most luminous objects in the
Universe, emitting powerful continuum and line emission across all wavelength
bands. They represent an important link in the investigations of the galaxy
evolution and cosmology. The resolving of the AGN inner structure is still a
difficult task with current instruments, therefore the spectroscopy and
spectropolarimetry are crucial tools to investigate these objects and their
components, such as the properties of the supermassive black hole, the broad
line region, and the dusty torus. In this review, we present the results of the
project "Astrophysical spectroscopy of extragalactic objects", from the
observations, data processing and analysis, to the modelling of different
regions in AGN.
|
astro-ph.GA
|
active galactic nuclei agn are one of the most luminous objects in the universe emitting powerful continuum and line emission across all wavelength bands they represent an important link in the investigations of the galaxy evolution and cosmology the resolving of the agn inner structure is still a difficult task with current instruments therefore the spectroscopy and spectropolarimetry are crucial tools to investigate these objects and their components such as the properties of the supermassive black hole the broad line region and the dusty torus in this review we present the results of the project astrophysical spectroscopy of extragalactic objects from the observations data processing and analysis to the modelling of different regions in agn
|
[['active', 'galactic', 'nuclei', 'agn', 'are', 'one', 'of', 'the', 'most', 'luminous', 'objects', 'in', 'the', 'universe', 'emitting', 'powerful', 'continuum', 'and', 'line', 'emission', 'across', 'all', 'wavelength', 'bands', 'they', 'represent', 'an', 'important', 'link', 'in', 'the', 'investigations', 'of', 'the', 'galaxy', 'evolution', 'and', 'cosmology', 'the', 'resolving', 'of', 'the', 'agn', 'inner', 'structure', 'is', 'still', 'a', 'difficult', 'task', 'with', 'current', 'instruments', 'therefore', 'the', 'spectroscopy', 'and', 'spectropolarimetry', 'are', 'crucial', 'tools', 'to', 'investigate', 'these', 'objects', 'and', 'their', 'components', 'such', 'as', 'the', 'properties', 'of', 'the', 'supermassive', 'black', 'hole', 'the', 'broad', 'line', 'region', 'and', 'the', 'dusty', 'torus', 'in', 'this', 'review', 'we', 'present', 'the', 'results', 'of', 'the', 'project', 'astrophysical', 'spectroscopy', 'of', 'extragalactic', 'objects', 'from', 'the', 'observations', 'data', 'processing', 'and', 'analysis', 'to', 'the', 'modelling', 'of', 'different', 'regions', 'in', 'agn']]
|
[-0.06872354357543847, 0.051373265669605206, -0.05214755029782005, 0.12446271677137069, -0.11389612840164615, -0.07573249176873462, 0.01360993911512196, 0.4424736731240283, -0.1748919736887531, -0.33058389611542227, 0.10744165105178305, -0.30005113062570277, -0.03224539430457694, 0.21719731283446891, -0.007244302022888366, -0.015060985334339026, 0.015313141817307991, -0.11717592836965038, 0.01387475659645608, -0.19643719891572128, 0.34438009713978873, 0.12690500392295095, 0.18845525837057958, -0.019541405773033267, 0.0657124486559516, -0.07409007927078916, -0.1320804328698179, -0.019283754929252293, -0.12816629672483743, 0.12811429624362855, 0.3331151235524727, 0.17213584194364756, 0.22133956086497916, -0.3759661299378976, -0.25272781097370645, 0.07702039239280249, 0.1708033948853288, 0.05886821308294716, -0.047249629259433434, -0.26941811784939923, 0.02109277380792343, -0.13120172944972697, -0.1554876701865831, 0.026457241962096936, 0.03638592636941568, 0.03496293329998203, -0.1376717857317999, 0.05852523951426796, 0.04459249642373913, 0.057138524135655684, -0.11832369955904458, -0.05623222738909333, -0.03173916991395147, 0.16499841238331536, 0.06582135081736613, 0.021577492176109683, 0.20296216955732393, -0.20715307062694235, -0.07877372021017515, 0.41609558494680604, 0.004875126270496327, -0.02111331886895325, 0.24792992343883152, -0.2365202290998043, -0.20180121454936656, 0.13474766654367357, 0.1701882821791198, 0.17991342661173448, -0.14300643264812052, 0.027630640628352843, -0.025885745571197376, 0.188821050071198, -0.03673199292920206, 0.1200947653321276, 0.37182899120709173, 0.1370389100164175, -0.00032696715592781244, 0.11043410479577015, -0.2042766257715614, -0.03723844123356368, -0.27480031415901107, -0.12114670137753306, -0.12226174238401101, 0.06447117781448786, -0.12871333469520324, -0.13648997210573566, 0.37483746483314623, 0.1141084691023697, 0.21366082041564843, -0.03859398806234822, 0.32844713348085464, 0.022730218014760835, 0.07845975524017021, 0.09525510590148928, 0.32805677649119624, 0.16830796723092056, 0.1007693215455536, -0.2313536102053426, 0.017307914073740983, -0.0019491980682410624]
|
1,803.09465
|
Formation of tidally induced bars in galactic flybys: prograde versus
retrograde encounters
|
Bars in disky galaxies can be formed by interactions with other systems,
including those of comparable mass. It has long been established that the
effect of such interactions on galaxy morphology depends strongly on the
orbital configuration, in particular the orientation of the intrinsic spin of
the galactic disk with respect to its orbital angular momentum. Prograde
encounters modify the morphology strongly, including the formation of tidally
induced bars, while retrograde flybys should have little effect on morphology.
Recent works on the subject reached conflicting conclusions, one using the
impulse approximation and claiming no dependence on this angle in the
properties of tidal bars. To resolve the controversy, we performed
self-consistent N-body simulations of hyperbolic encounters between two
identical Milky Way-like galaxies assuming different velocities and impact
parameters, with one of the galaxies on a prograde and the other on a
retrograde orbit. The galaxies were initially composed of an exponential
stellar disk and an NFW dark halo, and were stable against bar formation in
isolation for 3 Gyr. We find that strong tidally induced bars form only in
galaxies on prograde orbits. For smaller impact parameters and lower relative
velocities the bars are stronger and have lower pattern speeds. Stronger bars
undergo extended periods of buckling instability that thicken their vertical
structure. The encounters also lead to the formation of two-armed spirals with
strength inversely proportional to the strength of the bars. We conclude that
proper modeling of prograde and retrograde encounters cannot rely on the
simplest impulse approximation.
|
astro-ph.GA
|
bars in disky galaxies can be formed by interactions with other systems including those of comparable mass it has long been established that the effect of such interactions on galaxy morphology depends strongly on the orbital configuration in particular the orientation of the intrinsic spin of the galactic disk with respect to its orbital angular momentum prograde encounters modify the morphology strongly including the formation of tidally induced bars while retrograde flybys should have little effect on morphology recent works on the subject reached conflicting conclusions one using the impulse approximation and claiming no dependence on this angle in the properties of tidal bars to resolve the controversy we performed selfconsistent nbody simulations of hyperbolic encounters between two identical milky waylike galaxies assuming different velocities and impact parameters with one of the galaxies on a prograde and the other on a retrograde orbit the galaxies were initially composed of an exponential stellar disk and an nfw dark halo and were stable against bar formation in isolation for 3 gyr we find that strong tidally induced bars form only in galaxies on prograde orbits for smaller impact parameters and lower relative velocities the bars are stronger and have lower pattern speeds stronger bars undergo extended periods of buckling instability that thicken their vertical structure the encounters also lead to the formation of twoarmed spirals with strength inversely proportional to the strength of the bars we conclude that proper modeling of prograde and retrograde encounters cannot rely on the simplest impulse approximation
|
[['bars', 'in', 'disky', 'galaxies', 'can', 'be', 'formed', 'by', 'interactions', 'with', 'other', 'systems', 'including', 'those', 'of', 'comparable', 'mass', 'it', 'has', 'long', 'been', 'established', 'that', 'the', 'effect', 'of', 'such', 'interactions', 'on', 'galaxy', 'morphology', 'depends', 'strongly', 'on', 'the', 'orbital', 'configuration', 'in', 'particular', 'the', 'orientation', 'of', 'the', 'intrinsic', 'spin', 'of', 'the', 'galactic', 'disk', 'with', 'respect', 'to', 'its', 'orbital', 'angular', 'momentum', 'prograde', 'encounters', 'modify', 'the', 'morphology', 'strongly', 'including', 'the', 'formation', 'of', 'tidally', 'induced', 'bars', 'while', 'retrograde', 'flybys', 'should', 'have', 'little', 'effect', 'on', 'morphology', 'recent', 'works', 'on', 'the', 'subject', 'reached', 'conflicting', 'conclusions', 'one', 'using', 'the', 'impulse', 'approximation', 'and', 'claiming', 'no', 'dependence', 'on', 'this', 'angle', 'in', 'the', 'properties', 'of', 'tidal', 'bars', 'to', 'resolve', 'the', 'controversy', 'we', 'performed', 'selfconsistent', 'nbody', 'simulations', 'of', 'hyperbolic', 'encounters', 'between', 'two', 'identical', 'milky', 'waylike', 'galaxies', 'assuming', 'different', 'velocities', 'and', 'impact', 'parameters', 'with', 'one', 'of', 'the', 'galaxies', 'on', 'a', 'prograde', 'and', 'the', 'other', 'on', 'a', 'retrograde', 'orbit', 'the', 'galaxies', 'were', 'initially', 'composed', 'of', 'an', 'exponential', 'stellar', 'disk', 'and', 'an', 'nfw', 'dark', 'halo', 'and', 'were', 'stable', 'against', 'bar', 'formation', 'in', 'isolation', 'for', '3', 'gyr', 'we', 'find', 'that', 'strong', 'tidally', 'induced', 'bars', 'form', 'only', 'in', 'galaxies', 'on', 'prograde', 'orbits', 'for', 'smaller', 'impact', 'parameters', 'and', 'lower', 'relative', 'velocities', 'the', 'bars', 'are', 'stronger', 'and', 'have', 'lower', 'pattern', 'speeds', 'stronger', 'bars', 'undergo', 'extended', 'periods', 'of', 'buckling', 'instability', 'that', 'thicken', 'their', 'vertical', 'structure', 'the', 'encounters', 'also', 'lead', 'to', 'the', 'formation', 'of', 'twoarmed', 'spirals', 'with', 'strength', 'inversely', 'proportional', 'to', 'the', 'strength', 'of', 'the', 'bars', 'we', 'conclude', 'that', 'proper', 'modeling', 'of', 'prograde', 'and', 'retrograde', 'encounters', 'can', 'not', 'rely', 'on', 'the', 'simplest', 'impulse', 'approximation']]
|
[-0.16314612596622294, 0.1271060123267181, -0.08819413468087708, 0.0944402372678816, -0.10320978124525798, -0.04349346927170497, -0.017360841389745474, 0.41661104273451754, -0.17366974607696276, -0.33279251861798786, 0.01722752760058692, -0.2590648368511403, -0.07856342350819197, 0.20125185494845457, -0.022175761145647184, -0.0027491744003347697, 0.07207292097479669, -0.04290959546184798, -0.07307523211596006, -0.2724434225741158, 0.29627654105295015, 0.06697675299021857, 0.13865426508617026, -0.05167223650412968, 0.0427790327198002, -0.0464336450899992, -0.020841465487452856, -0.006465878197088452, -0.19663284318505386, 0.0009258503773327605, 0.13607083370749545, 0.03637786380171153, 0.23257005851682408, -0.47080429895332015, -0.1547770805752454, 0.05566665690867193, 0.19451482294023453, 0.07471328349208897, -0.09514460749485887, -0.2768290619796283, 0.07637854422808094, -0.20918884264041793, -0.17195915725161934, 0.04076620261463155, 0.0838260266955838, 0.048519743501859905, -0.1943343718866892, 0.1696407709430033, 0.12634689216442296, 0.08876132428557038, -0.09300507644081926, -0.1065087888159778, -0.10886261144660384, 0.08536693855862233, 0.08666703577127412, 0.04716741477892515, 0.2385069789843582, -0.11152852622354292, -0.05354452943540664, 0.4134239951089262, -0.0606896811998549, -0.15079110651184244, 0.2719070437453331, -0.22255161973421436, -0.11056598179984793, 0.11126597379278615, 0.20220826851181775, 0.07759170336518956, -0.07159513714319778, 0.0057862229548780566, -0.03348626236642796, 0.19575901560400022, 0.11097229139849663, 0.03677102582084165, 0.3185064549391126, 0.08936711823274622, 0.0803805712046495, 0.054228531675361305, -0.15615405330519783, -0.10614584531334499, -0.1572763538247798, -0.02139739172330935, -0.085962780098249, 0.03970696227037138, -0.10970420903290633, -0.1322387407730478, 0.34267885541539655, 0.08681037189602199, 0.2395832926877663, 0.03171381201368731, 0.3189220463363565, 0.05689835724206567, 0.12945637796853346, 0.10372646517301534, 0.3778359045115006, 0.16524332064292968, -0.020640921642617934, -0.30218132938127557, 0.15733384644377058, -0.022056351926927252]
|
1,803.09466
|
Regularizing Deep Hashing Networks Using GAN Generated Fake Images
|
Recently, deep-networks-based hashing (deep hashing) has become a leading
approach for large-scale image retrieval. It aims to learn a compact bitwise
representation for images via deep networks, so that similar images are mapped
to nearby hash codes. Since a deep network model usually has a large number of
parameters, it may probably be too complicated for the training data we have,
leading to model over-fitting. To address this issue, in this paper, we propose
a simple two-stage pipeline to learn deep hashing models, by regularizing the
deep hashing networks using fake images. The first stage is to generate fake
images from the original training set without extra data, via a generative
adversarial network (GAN). In the second stage, we propose a deep architec-
ture to learn hash functions, in which we use a maximum-entropy based loss to
incorporate the newly created fake images by the GAN. We show that this loss
acts as a strong regularizer of the deep architecture, by penalizing
low-entropy output hash codes. This loss can also be interpreted as a model
ensemble by simultaneously training many network models with massive weight
sharing but over different training sets. Empirical evaluation results on
several benchmark datasets show that the proposed method has superior
performance gains over state-of-the-art hashing methods.
|
cs.CV
|
recently deepnetworksbased hashing deep hashing has become a leading approach for largescale image retrieval it aims to learn a compact bitwise representation for images via deep networks so that similar images are mapped to nearby hash codes since a deep network model usually has a large number of parameters it may probably be too complicated for the training data we have leading to model overfitting to address this issue in this paper we propose a simple twostage pipeline to learn deep hashing models by regularizing the deep hashing networks using fake images the first stage is to generate fake images from the original training set without extra data via a generative adversarial network gan in the second stage we propose a deep architec ture to learn hash functions in which we use a maximumentropy based loss to incorporate the newly created fake images by the gan we show that this loss acts as a strong regularizer of the deep architecture by penalizing lowentropy output hash codes this loss can also be interpreted as a model ensemble by simultaneously training many network models with massive weight sharing but over different training sets empirical evaluation results on several benchmark datasets show that the proposed method has superior performance gains over stateoftheart hashing methods
|
[['recently', 'deepnetworksbased', 'hashing', 'deep', 'hashing', 'has', 'become', 'a', 'leading', 'approach', 'for', 'largescale', 'image', 'retrieval', 'it', 'aims', 'to', 'learn', 'a', 'compact', 'bitwise', 'representation', 'for', 'images', 'via', 'deep', 'networks', 'so', 'that', 'similar', 'images', 'are', 'mapped', 'to', 'nearby', 'hash', 'codes', 'since', 'a', 'deep', 'network', 'model', 'usually', 'has', 'a', 'large', 'number', 'of', 'parameters', 'it', 'may', 'probably', 'be', 'too', 'complicated', 'for', 'the', 'training', 'data', 'we', 'have', 'leading', 'to', 'model', 'overfitting', 'to', 'address', 'this', 'issue', 'in', 'this', 'paper', 'we', 'propose', 'a', 'simple', 'twostage', 'pipeline', 'to', 'learn', 'deep', 'hashing', 'models', 'by', 'regularizing', 'the', 'deep', 'hashing', 'networks', 'using', 'fake', 'images', 'the', 'first', 'stage', 'is', 'to', 'generate', 'fake', 'images', 'from', 'the', 'original', 'training', 'set', 'without', 'extra', 'data', 'via', 'a', 'generative', 'adversarial', 'network', 'gan', 'in', 'the', 'second', 'stage', 'we', 'propose', 'a', 'deep', 'architec', 'ture', 'to', 'learn', 'hash', 'functions', 'in', 'which', 'we', 'use', 'a', 'maximumentropy', 'based', 'loss', 'to', 'incorporate', 'the', 'newly', 'created', 'fake', 'images', 'by', 'the', 'gan', 'we', 'show', 'that', 'this', 'loss', 'acts', 'as', 'a', 'strong', 'regularizer', 'of', 'the', 'deep', 'architecture', 'by', 'penalizing', 'lowentropy', 'output', 'hash', 'codes', 'this', 'loss', 'can', 'also', 'be', 'interpreted', 'as', 'a', 'model', 'ensemble', 'by', 'simultaneously', 'training', 'many', 'network', 'models', 'with', 'massive', 'weight', 'sharing', 'but', 'over', 'different', 'training', 'sets', 'empirical', 'evaluation', 'results', 'on', 'several', 'benchmark', 'datasets', 'show', 'that', 'the', 'proposed', 'method', 'has', 'superior', 'performance', 'gains', 'over', 'stateoftheart', 'hashing', 'methods']]
|
[-0.03802699881265938, -0.02571719657338414, -0.11235260011482613, 0.11723670789197317, -0.09926950638745227, -0.2088487164969269, 0.02937247339797193, 0.4884955459075728, -0.2967935809335932, -0.33222468265015587, 0.061443054117814096, -0.2567397824152576, -0.21277890468713656, 0.1585809684312192, -0.15562795728038978, 0.10096346884822446, 0.15110757091287877, 0.004741848745467185, -0.081757677230163, -0.35340204906442435, 0.3580092214637158, 0.06690581540383456, 0.33212440630412216, -0.02941324051482806, 0.1350293153272368, -0.04947533545803479, 0.0005634180667381998, -0.029056458757148605, -0.004561745178171542, 0.17904223036683073, 0.29055598039959774, 0.21892610625959757, 0.34527496246497424, -0.39694360526658207, -0.286892714027439, 0.1235405930949119, 0.13687156545995818, 0.14908042427609505, -0.08289733028173958, -0.305451301311615, 0.10147753584979906, -0.2073143130550117, 0.06437223589144894, -0.18191134309841947, -0.06848849598660411, -0.03287637165347026, -0.3326943817226243, -0.0018549698750627496, 0.05965311160108066, 0.011877168256842412, -0.014165241562571571, -0.10026698810891448, 0.007237562947240062, 0.10023178299778622, 0.01288064049834924, 0.11060931154866636, 0.08703411930523178, -0.1846825604631027, -0.12072414885080857, 0.31887018830202063, -0.07287385120052156, -0.1852954630698607, 0.16227461687196487, 0.010688404751261829, -0.1364970820518961, 0.12336791498957299, 0.2808382060374376, 0.1343865514047647, -0.1927830204658676, -0.004684625741897671, -0.07611835951215071, 0.17441609153254797, 0.05544474361005341, 0.012227985707786975, 0.16755042345730933, 0.23942524698420573, 0.016634436581069736, 0.19536871153097687, -0.16037292814204512, -0.052868278200023086, -0.1814594943676656, -0.07313574149308646, -0.24010187961046375, 0.006955627687451964, -0.0982192701977894, -0.16045626415146935, 0.3871134943417075, 0.2241608768340721, 0.2819907137488514, 0.10725837060795453, 0.36237681881299516, 0.003342136801995659, 0.2243062291099575, 0.1210066505213449, 0.1818846000813089, 0.009635324342732463, 0.10798980596793101, -0.11680219540225178, 0.09563600106931168, 0.07852814064948198]
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.