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.01267 | Laplacians on spheres | Spheres can be written as homogeneous spaces $G/H$ for compact Lie groups in
a small number of ways. In each case, the decomposition of $L^2(G/H)$ into
irreducible representations of $G$ contains interesting information. We recall
these decompositions, and see what they can reveal about the analogous problem
for noncompact real forms of $G$ and $H$.
| math.RT | spheres can be written as homogeneous spaces gh for compact lie groups in a small number of ways in each case the decomposition of l2gh into irreducible representations of g contains interesting information we recall these decompositions and see what they can reveal about the analogous problem for noncompact real forms of g and h | [['spheres', 'can', 'be', 'written', 'as', 'homogeneous', 'spaces', 'gh', 'for', 'compact', 'lie', 'groups', 'in', 'a', 'small', 'number', 'of', 'ways', 'in', 'each', 'case', 'the', 'decomposition', 'of', 'l2gh', 'into', 'irreducible', 'representations', 'of', 'g', 'contains', 'interesting', 'information', 'we', 'recall', 'these', 'decompositions', 'and', 'see', 'what', 'they', 'can', 'reveal', 'about', 'the', 'analogous', 'problem', 'for', 'noncompact', 'real', 'forms', 'of', 'g', 'and', 'h']] | [-0.1588787632909688, 0.12434817722215402, -0.12304972071539272, 0.08411267213523388, -0.1302044334567406, -0.10396285267885436, -0.025909014003859324, 0.4152947187423706, -0.2810060567645864, -0.28329221690920264, 0.12743654983880168, -0.2546155424619263, -0.14956428528001361, 0.20100080052560027, -0.0974701357328079, -0.08581775142387911, 0.07917148421772502, 0.15642543575218457, -0.08072633460714397, -0.29774079259567027, 0.3650886833667755, -0.11030911615287715, 0.1746923256157474, 0.01467395331710577, 0.08836344066499309, 0.015206449847160415, -0.057316121205010194, 0.042350440176034516, -0.12450744113038209, 0.12590222797060216, 0.34575205479155885, 0.10597264979203994, 0.2112508999734101, -0.3518524097786708, -0.16478508783673698, 0.19693763565949418, 0.17347541475583883, 0.007936652952974493, 0.009283999311314389, -0.2909182185772806, 0.06420134274839338, -0.1325070737522434, -0.11443668918853456, -0.09778985652056607, 0.08598532124676488, -0.017380199852314863, -0.20514473864300684, 0.03046407479030842, 0.09193466458130967, 0.04048109032552351, -0.06918391963805665, -0.1818865253166719, -0.05129136141728271, 0.15764258006079632, -0.05664457573809407, -0.005661612816832282, 0.07762299469587478, -0.10440424935923974, -0.09425469402393157, 0.43294453234835106, -0.06544135700149292, -0.2453839269720695, 0.1464619895781983, -0.1788548394021663, -0.18760432766919785, 0.10643028596585447, 0.18015910456465048, 0.13014610040594232, -0.015017551183700562, 0.12445780377284708, -0.12689499617977576, 0.06879274369937113, 0.1340854923664169, 0.013602524013681845, 0.1883572873405435, 0.09948248415338722, 0.09191132926128127, 0.15433070173444735, 0.06295341986273839, 0.03866927284768529, -0.3400827569379048, -0.20717462862587788, -0.1300118904391473, 0.1488327039575035, -0.14142186279271052, -0.14814520861360836, 0.35048812658272005, 0.03518896910615943, 0.18485060324892402, 0.023409893583845008, 0.18711308669298887, 0.043471764140254394, 0.08860907783223824, 0.09814765576950528, 0.09793104133145376, 0.21322841044007376, -0.038940757360648025, -0.08981121145188808, -0.033519946174188096, 0.11523838310756467] |
1,803.01268 | A new approach to Lickorish-Millett type formulae | In this paper, we introduce a new method to prove the Lickorish-Millett type
formulae for colored HOMFLY-PT polynomials of links.
| math.GT math-ph math.MP | in this paper we introduce a new method to prove the lickorishmillett type formulae for colored homflypt polynomials of links | [['in', 'this', 'paper', 'we', 'introduce', 'a', 'new', 'method', 'to', 'prove', 'the', 'lickorishmillett', 'type', 'formulae', 'for', 'colored', 'homflypt', 'polynomials', 'of', 'links']] | [-0.20046533193243177, 0.055739135734543914, -0.12112062453831497, 0.0871291963910488, -0.1213499498798659, -0.18574918715871477, 0.04025600816882951, 0.29869931235321256, -0.34903749705929504, -0.23354230615261354, 0.011126087090049527, -0.1570986807346344, -0.3077727466037399, 0.18355145050506844, -0.20288471166828745, -0.04705222343143664, 0.0769572493277098, 0.0061161331832408905, -0.08180443285719345, -0.2783858714698765, 0.37917236086765405, -0.07375063158963856, 0.12196607789710949, 0.09511487009493928, 0.13505066151877768, -0.015306157917764626, -0.11202964823889106, -0.05040384231037215, -0.25385185247777325, 0.19353148786927035, 0.2314907771192099, 0.09904663454692222, 0.17738470984132668, -0.365361356029385, -0.0802889436875519, 0.24346656014064424, 0.17716877133046327, 0.09952098757371698, -0.041161308126328025, -0.24461912050058968, 0.14637199098146275, -0.24518484367351784, -0.23222544251352942, -0.07716976444383986, -0.036754786281993516, 0.055296510163890686, -0.29346209058636114, 0.005866906777220337, 0.09035075171605537, 0.09794225813330788, 0.03282464775992067, -0.10602976778816235, 0.11530259754018564, 0.034872931746864004, -0.032542470940633825, -0.021660290682982457, -0.07298248866572976, -0.1857930750610601, -0.19995975533598348, 0.3202002995500439, -0.07092537402518485, -0.28633475382077067, 0.0913966748079187, -0.08606569993456728, -0.2983766062871406, 0.0799142520286535, 0.1716838072201139, 0.16057652725200905, -0.16620566303792753, 0.051627731416374445, -0.13800194800684326, 0.050845042067138774, 0.09544745112132084, 0.05219229193110215, 0.12071574160731152, 0.039136226043889395, 0.06690414524392078, 0.329285911627506, -0.05389086019835974, -0.007464633764404999, -0.3394765632325097, -0.307580352540275, -0.13834097893222383, 0.017959391894309146, -0.12041329379242502, -0.20101901879043957, 0.4667962252309448, 0.16854855516239217, 0.13678154349327087, 0.2769742147800954, 0.29663609772136335, 0.12388528638372295, 0.041715941048766435, 0.05393150071368406, 0.08346634828730633, 0.19234907234969892, 0.13825345037759307, -0.06008858777778713, 0.033471060500137116, 0.32532304571941495] |
1,803.01269 | An Irreducible Function Basis of Isotropic Invariants of A Third Order
Three-Dimensional Symmetric Tensor | In this paper, we present an eleven invariant isotropic irreducible function
basis of a third order three-dimensional symmetric tensor. This irreducible
function basis is a proper subset of the Olive-Auffray minimal isotropic
integrity basis of that tensor. The octic invariant and a sextic invariant in
the Olive-Auffray integrity basis are dropped out. This result is of
significance to the further research of irreducible function bases of higher
order tensors.
| math-ph math.MP | in this paper we present an eleven invariant isotropic irreducible function basis of a third order threedimensional symmetric tensor this irreducible function basis is a proper subset of the oliveauffray minimal isotropic integrity basis of that tensor the octic invariant and a sextic invariant in the oliveauffray integrity basis are dropped out this result is of significance to the further research of irreducible function bases of higher order tensors | [['in', 'this', 'paper', 'we', 'present', 'an', 'eleven', 'invariant', 'isotropic', 'irreducible', 'function', 'basis', 'of', 'a', 'third', 'order', 'threedimensional', 'symmetric', 'tensor', 'this', 'irreducible', 'function', 'basis', 'is', 'a', 'proper', 'subset', 'of', 'the', 'oliveauffray', 'minimal', 'isotropic', 'integrity', 'basis', 'of', 'that', 'tensor', 'the', 'octic', 'invariant', 'and', 'a', 'sextic', 'invariant', 'in', 'the', 'oliveauffray', 'integrity', 'basis', 'are', 'dropped', 'out', 'this', 'result', 'is', 'of', 'significance', 'to', 'the', 'further', 'research', 'of', 'irreducible', 'function', 'bases', 'of', 'higher', 'order', 'tensors']] | [-0.2095567085849705, 0.09263798239516657, -0.08340080393784081, 0.008031717590195364, -0.09305184096820764, -0.038508379366248846, -0.029363036352042942, 0.3405612949907446, -0.25898548671558724, -0.17663289381385738, 0.0863171691637931, -0.2490767414000497, -0.1927408351382213, 0.07881883281602789, -0.004160243406224607, 0.08334563888866565, 0.017508740585519753, 0.05796419138283427, -0.16749702734219382, -0.2810582429893426, 0.36732571494223465, 0.06456859735076997, 0.28990101470931695, 0.02738475735618997, 0.13715924855335546, 0.01470648732606266, -0.06264822501967203, -0.01786365120935796, -0.09235860035225224, 0.19095814260028637, 0.29252288635097334, 0.11059295583460758, 0.21017616208809525, -0.34144157610500037, -0.11513972504815059, 0.20598328493730123, 0.11049860009033956, 0.07853959923359885, 0.01315241775461542, -0.21375350790348516, 0.09979681321072267, -0.2461086013771371, -0.21769990328588149, -0.12279291501018538, 0.059412266586476296, -0.03987417632797316, -0.2476728994732917, 0.08895536135437328, 0.10369746616360412, 0.14870275894124338, -0.09370151675764972, -0.12218422411398878, -0.05912364578680761, 0.06667425213103641, 0.013483004220552854, 0.10938548660183799, 0.07667968053815526, -0.10052347511622998, -0.0751785514737243, 0.3919549557700086, -0.08052724261017544, -0.31663877981256194, 0.09426572541150251, -0.14026666229674176, -0.1645930690982782, 0.1358871158983892, 0.16984563926929858, 0.11461509778094825, -0.15051653045716126, 0.1358406206848336, -0.10343422441840616, 0.13643455327968043, 0.05155726704996691, 0.010362484304706997, 0.17608367833100372, 0.0770599230248203, 0.05483342958753234, 0.19397995295698073, 0.030072851690338617, -0.002271332673784067, -0.4010575607752622, -0.20994695198180072, -0.16993901408068948, 0.10714840708967688, -0.1121681106636047, -0.19244861277515318, 0.46083936573409323, 0.06574948640790448, 0.1634293147588649, 0.03885308003970491, 0.26168686643576444, 0.08858944278266002, 0.07417527821137389, 0.03081916527711411, 0.21154979094445928, 0.1573978902931923, -0.05192567196799748, -0.12229568842075654, 0.0028967218223347594, 0.1319257888609349] |
1,803.0127 | Convection in porous media with dispersion | We investigate the effect of dispersion on convection in porous media by
performing direct numerical simulations (DNS) in a two-dimensional
Rayleigh-Darcy domain. Scaling analysis of the governing equations shows that
the dynamics of this system are not only controlled by the classical
Rayleigh-Darcy number based on molecular diffusion, $Ra_m$, and the domain
aspect ratio, but also controlled by two other dimensionless parameters: the
dispersive Rayleigh number $Ra_d = H/\alpha_t$ and the dispersivity ratio $r =
\alpha_l/\alpha_t$, where $H$ is the domain height, $\alpha_t$ and $\alpha_l$
are the transverse and longitudinal dispersivities, respectively. For $\Delta =
Ra_d/Ra_m > O(1)$, the influence from the mechanical dispersion is minor; for
$\Delta \ll 1$, however, the flow pattern is controlled by $Ra_d$ while the
convective flux is $F\sim Ra_m$ for large $Ra_m$, but with a prefactor that has
a non-monotonic dependence on $Ra_d$. Our DNS results also show that the
increase of mechanical dispersion, i.e. decreasing $Ra_d$, will coarsen the
convective pattern by increasing the plume spacing. Moreover, the inherent
anisotropy of mechanical dispersion breaks the columnar structure of the
mega-plumes at large $Ra_m$, if $Ra_d < 5000$. This results in a fan-flow
geometry that reduces the convective flux.
| physics.flu-dyn | we investigate the effect of dispersion on convection in porous media by performing direct numerical simulations dns in a twodimensional rayleighdarcy domain scaling analysis of the governing equations shows that the dynamics of this system are not only controlled by the classical rayleighdarcy number based on molecular diffusion ra_m and the domain aspect ratio but also controlled by two other dimensionless parameters the dispersive rayleigh number ra_d halpha_t and the dispersivity ratio r alpha_lalpha_t where h is the domain height alpha_t and alpha_l are the transverse and longitudinal dispersivities respectively for delta ra_dra_m o1 the influence from the mechanical dispersion is minor for delta ll 1 however the flow pattern is controlled by ra_d while the convective flux is fsim ra_m for large ra_m but with a prefactor that has a nonmonotonic dependence on ra_d our dns results also show that the increase of mechanical dispersion ie decreasing ra_d will coarsen the convective pattern by increasing the plume spacing moreover the inherent anisotropy of mechanical dispersion breaks the columnar structure of the megaplumes at large ra_m if ra_d 5000 this results in a fanflow geometry that reduces the convective flux | [['we', 'investigate', 'the', 'effect', 'of', 'dispersion', 'on', 'convection', 'in', 'porous', 'media', 'by', 'performing', 'direct', 'numerical', 'simulations', 'dns', 'in', 'a', 'twodimensional', 'rayleighdarcy', 'domain', 'scaling', 'analysis', 'of', 'the', 'governing', 'equations', 'shows', 'that', 'the', 'dynamics', 'of', 'this', 'system', 'are', 'not', 'only', 'controlled', 'by', 'the', 'classical', 'rayleighdarcy', 'number', 'based', 'on', 'molecular', 'diffusion', 'ra_m', 'and', 'the', 'domain', 'aspect', 'ratio', 'but', 'also', 'controlled', 'by', 'two', 'other', 'dimensionless', 'parameters', 'the', 'dispersive', 'rayleigh', 'number', 'ra_d', 'halpha_t', 'and', 'the', 'dispersivity', 'ratio', 'r', 'alpha_lalpha_t', 'where', 'h', 'is', 'the', 'domain', 'height', 'alpha_t', 'and', 'alpha_l', 'are', 'the', 'transverse', 'and', 'longitudinal', 'dispersivities', 'respectively', 'for', 'delta', 'ra_dra_m', 'o1', 'the', 'influence', 'from', 'the', 'mechanical', 'dispersion', 'is', 'minor', 'for', 'delta', 'll', '1', 'however', 'the', 'flow', 'pattern', 'is', 'controlled', 'by', 'ra_d', 'while', 'the', 'convective', 'flux', 'is', 'fsim', 'ra_m', 'for', 'large', 'ra_m', 'but', 'with', 'a', 'prefactor', 'that', 'has', 'a', 'nonmonotonic', 'dependence', 'on', 'ra_d', 'our', 'dns', 'results', 'also', 'show', 'that', 'the', 'increase', 'of', 'mechanical', 'dispersion', 'ie', 'decreasing', 'ra_d', 'will', 'coarsen', 'the', 'convective', 'pattern', 'by', 'increasing', 'the', 'plume', 'spacing', 'moreover', 'the', 'inherent', 'anisotropy', 'of', 'mechanical', 'dispersion', 'breaks', 'the', 'columnar', 'structure', 'of', 'the', 'megaplumes', 'at', 'large', 'ra_m', 'if', 'ra_d', '5000', 'this', 'results', 'in', 'a', 'fanflow', 'geometry', 'that', 'reduces', 'the', 'convective', 'flux']] | [-0.16286053668464656, 0.1931345306954387, -0.03186327865225157, 0.009989815896994474, -0.06349545501364881, -0.08789297273514145, 0.032439517581698725, 0.31871576346052083, -0.2813277591283069, -0.3083316355123711, 0.07988454618000264, -0.2723107925697189, -0.10738593319167747, 0.21608191660261186, 0.008459343108330833, 0.025504431780933846, 0.046189576959358936, -0.023473156994441524, -0.029884634509115764, -0.15054851055838694, 0.30853097272388963, 0.03808168129367202, 0.28397269067152037, 0.07081801020135374, 0.06213845782052806, -0.04374360004395266, -0.023324052639983838, 0.0649376697559922, -0.17652030266222224, 0.029479559553969328, 0.14603161684973873, -0.0005078387842766698, 0.24469624775709867, -0.3982588439248502, -0.22062406622116332, 0.02070519777328667, 0.1905182308325058, 0.06350732513870437, -0.012862774239139348, -0.21254920854698867, 0.09803724060159015, -0.1398977032412127, -0.10948004466468853, -0.016320300000623556, 0.06951104511972517, 0.05696303137412305, -0.2536733074473728, 0.15320272774166052, 0.05898360066108264, 0.08491274032681047, -0.017804639658171927, -0.11025505433676501, -0.08542791781719247, 0.08747173630462898, 0.0710823863109513, 0.015783628762659173, 0.14483417482267175, -0.14391968837994878, -0.004739356600507365, 0.376946051918861, -0.0909649845637867, -0.21130177601108976, 0.1452538636373862, -0.19259959387177925, -0.06331938941224033, 0.16498523046080346, 0.1362631258519326, 0.07765634035509404, -0.07608116502682527, 0.06901372826541774, -0.051144285064251366, 0.2313619746684866, 0.07527904149585242, -0.02473199053486536, 0.15997560906892075, 0.18187968698127763, 0.042898106843653215, 0.08633738666875339, -0.12714455578774822, -0.07056349474663401, -0.2702490040632572, -0.12364162424542567, -0.17519790283151213, 0.03340179778949633, -0.14808953532069016, -0.1495941245913222, 0.3389571451926199, 0.11037618776109688, 0.1944989856413525, 0.06082233143388294, 0.2702590752286715, 0.13334078081369743, 0.06484973300045924, 0.09210308522755362, 0.2614588196814546, 0.13340182065313338, 0.1333920024373346, -0.31540498898855573, 0.07824281354576511, 0.030696716711289533] |
1,803.01271 | An Empirical Evaluation of Generic Convolutional and Recurrent Networks
for Sequence Modeling | For most deep learning practitioners, sequence modeling is synonymous with
recurrent networks. Yet recent results indicate that convolutional
architectures can outperform recurrent networks on tasks such as audio
synthesis and machine translation. Given a new sequence modeling task or
dataset, which architecture should one use? We conduct a systematic evaluation
of generic convolutional and recurrent architectures for sequence modeling. The
models are evaluated across a broad range of standard tasks that are commonly
used to benchmark recurrent networks. Our results indicate that a simple
convolutional architecture outperforms canonical recurrent networks such as
LSTMs across a diverse range of tasks and datasets, while demonstrating longer
effective memory. We conclude that the common association between sequence
modeling and recurrent networks should be reconsidered, and convolutional
networks should be regarded as a natural starting point for sequence modeling
tasks. To assist related work, we have made code available at
http://github.com/locuslab/TCN .
| cs.LG cs.AI cs.CL | for most deep learning practitioners sequence modeling is synonymous with recurrent networks yet recent results indicate that convolutional architectures can outperform recurrent networks on tasks such as audio synthesis and machine translation given a new sequence modeling task or dataset which architecture should one use we conduct a systematic evaluation of generic convolutional and recurrent architectures for sequence modeling the models are evaluated across a broad range of standard tasks that are commonly used to benchmark recurrent networks our results indicate that a simple convolutional architecture outperforms canonical recurrent networks such as lstms across a diverse range of tasks and datasets while demonstrating longer effective memory we conclude that the common association between sequence modeling and recurrent networks should be reconsidered and convolutional networks should be regarded as a natural starting point for sequence modeling tasks to assist related work we have made code available at httpgithubcomlocuslabtcn | [['for', 'most', 'deep', 'learning', 'practitioners', 'sequence', 'modeling', 'is', 'synonymous', 'with', 'recurrent', 'networks', 'yet', 'recent', 'results', 'indicate', 'that', 'convolutional', 'architectures', 'can', 'outperform', 'recurrent', 'networks', 'on', 'tasks', 'such', 'as', 'audio', 'synthesis', 'and', 'machine', 'translation', 'given', 'a', 'new', 'sequence', 'modeling', 'task', 'or', 'dataset', 'which', 'architecture', 'should', 'one', 'use', 'we', 'conduct', 'a', 'systematic', 'evaluation', 'of', 'generic', 'convolutional', 'and', 'recurrent', 'architectures', 'for', 'sequence', 'modeling', 'the', 'models', 'are', 'evaluated', 'across', 'a', 'broad', 'range', 'of', 'standard', 'tasks', 'that', 'are', 'commonly', 'used', 'to', 'benchmark', 'recurrent', 'networks', 'our', 'results', 'indicate', 'that', 'a', 'simple', 'convolutional', 'architecture', 'outperforms', 'canonical', 'recurrent', 'networks', 'such', 'as', 'lstms', 'across', 'a', 'diverse', 'range', 'of', 'tasks', 'and', 'datasets', 'while', 'demonstrating', 'longer', 'effective', 'memory', 'we', 'conclude', 'that', 'the', 'common', 'association', 'between', 'sequence', 'modeling', 'and', 'recurrent', 'networks', 'should', 'be', 'reconsidered', 'and', 'convolutional', 'networks', 'should', 'be', 'regarded', 'as', 'a', 'natural', 'starting', 'point', 'for', 'sequence', 'modeling', 'tasks', 'to', 'assist', 'related', 'work', 'we', 'have', 'made', 'code', 'available', 'at', 'httpgithubcomlocuslabtcn']] | [-0.07343206595157413, -0.01420791815864305, -0.03987576536138938, 0.09779736019227628, -0.09046753298025578, -0.24611926441757034, 0.006951885276365617, 0.549174646279226, -0.2952209148876535, -0.2943984725805995, 0.07685596956424925, -0.23904381252263915, -0.24563004571006775, 0.2663762210023092, -0.10651932593613658, 0.09534312495547155, 0.22267203013195772, 0.026965277862722334, -0.06601913536783971, -0.25634740637487746, 0.28207176350286767, 0.03720843690676353, 0.34110508965047664, -0.010161661265468965, 0.10432391841449354, -0.08189138672505952, -0.021504804153116546, -0.03518391619372654, -0.0017776160107443927, 0.15515434875133868, 0.3295231094397335, 0.20163028044562328, 0.33385944902284503, -0.4251438727194112, -0.34291054090255335, 0.10219575374463752, 0.16875610573612765, 0.09563553494519685, -0.0030760084548390994, -0.3014761154884345, 0.13087095145512076, -0.1959206434213939, 0.061954944145750916, -0.1765346609068754, -0.0014988310851973214, 0.030283944687267052, -0.29214269177962654, 0.007914040514151566, 0.08842626174159143, 0.0827347578047073, -0.02516684954513936, -0.1521858051164101, 0.015660632980591935, 0.2026136503219987, 0.001481362590598172, 0.11017636452763252, 0.13093403132619616, -0.16483342697347947, -0.18890536375892386, 0.33298892552058584, -0.08210908838432945, -0.1923744725122249, 0.240879453578326, 0.038051301817575545, -0.24559285172758855, 0.0276615827995008, 0.25259969321283676, 0.1161986599510459, -0.18978836069725555, -0.059814288828295516, -0.0594716867534061, 0.19953299103059952, 0.020048289170667324, 0.013550502788722005, 0.268561447900401, 0.34487691651296176, -0.06934407987306532, 0.112221848167007, -0.11051444116539692, -0.11383620284701863, -0.18015870932897884, -0.06945131932806274, -0.18278681195009347, 0.01143609885961991, -0.08809496140797632, -0.16517588782940723, 0.38643274388008125, 0.2312528661114151, 0.18956681003806833, 0.17547274452725056, 0.30158104527939417, 0.0014052789942170048, 0.19014620504099622, 0.10818022217765795, 0.1293643808745052, 0.021474637642936553, 0.14662144763860852, -0.10858252595580654, 0.07342342347343618, 0.03243809261627189] |
1,803.01272 | Solving equations with Hodge theory | We treat two quite different problems related to changes of complex
structures on K\"ahler manifolds by using global geometric method. First, by
using operators from Hodge theory on compact K\"ahler manifold, we present a
closed explicit extension formula for holomorphic canonical forms in different
complex structures. As applications, we give a closed explicit formula for
certain canonical sections of Hodge bundles on marked and polarized moduli
spaces of projective manifolds, and provide a closed explicit extension formula
for holomorphic pluricanonical forms under certain natural conditions. Second,
by using the operators in $L^2$-Hodge theory on Poincar\'e disk, we present a
simple and unified method to solve the Beltrami equations with measurable
coefficients for quasi-conformal maps.
| math.AG math.DG | we treat two quite different problems related to changes of complex structures on kahler manifolds by using global geometric method first by using operators from hodge theory on compact kahler manifold we present a closed explicit extension formula for holomorphic canonical forms in different complex structures as applications we give a closed explicit formula for certain canonical sections of hodge bundles on marked and polarized moduli spaces of projective manifolds and provide a closed explicit extension formula for holomorphic pluricanonical forms under certain natural conditions second by using the operators in l2hodge theory on poincare disk we present a simple and unified method to solve the beltrami equations with measurable coefficients for quasiconformal maps | [['we', 'treat', 'two', 'quite', 'different', 'problems', 'related', 'to', 'changes', 'of', 'complex', 'structures', 'on', 'kahler', 'manifolds', 'by', 'using', 'global', 'geometric', 'method', 'first', 'by', 'using', 'operators', 'from', 'hodge', 'theory', 'on', 'compact', 'kahler', 'manifold', 'we', 'present', 'a', 'closed', 'explicit', 'extension', 'formula', 'for', 'holomorphic', 'canonical', 'forms', 'in', 'different', 'complex', 'structures', 'as', 'applications', 'we', 'give', 'a', 'closed', 'explicit', 'formula', 'for', 'certain', 'canonical', 'sections', 'of', 'hodge', 'bundles', 'on', 'marked', 'and', 'polarized', 'moduli', 'spaces', 'of', 'projective', 'manifolds', 'and', 'provide', 'a', 'closed', 'explicit', 'extension', 'formula', 'for', 'holomorphic', 'pluricanonical', 'forms', 'under', 'certain', 'natural', 'conditions', 'second', 'by', 'using', 'the', 'operators', 'in', 'l2hodge', 'theory', 'on', 'poincare', 'disk', 'we', 'present', 'a', 'simple', 'and', 'unified', 'method', 'to', 'solve', 'the', 'beltrami', 'equations', 'with', 'measurable', 'coefficients', 'for', 'quasiconformal', 'maps']] | [-0.1441866884298067, 0.024122797244273356, -0.10062119061650153, 0.15494793592216938, -0.13817545507111373, -0.1355792090558169, -0.03519061491661297, 0.36131873909024553, -0.27035613586766677, -0.20041416802754006, 0.09123856555302873, -0.18651434325351657, -0.22649216075558543, 0.27174152108726274, -0.12796130545617065, 0.04938601139573413, 0.030134974259948523, 0.04455021406720972, -0.15863049616056837, -0.22190593487456473, 0.5045026394930717, -0.058910844140898505, 0.2058772514329145, 0.0904504201898817, 0.18164418959630685, -0.003530049049132095, -0.015528014787521801, -0.03265619605550902, -0.16918690981784543, 0.19745579207875907, 0.30009291982972636, 0.04523728006895174, 0.12960339113921868, -0.4795087920665218, -0.17554630806849322, 0.15808211704879477, 0.06772611355163942, 0.015269295014277623, -0.03500168132105548, -0.26919341088975207, 0.05899927775725812, -0.08748757902108002, -0.18310793570504247, -0.18780700643465184, 0.03420892624968761, -0.011471870694342152, -0.23857395172838056, 0.033923340074946746, 0.051596252198674177, 0.15123723156488778, -0.1466708278994223, -0.08070963776972667, -0.03937802958841387, 0.03388100924591223, -0.02446267624965689, 0.03151984306526158, 0.10708176101182114, -0.0502799422512844, -0.11828700016383409, 0.33751568212909133, -0.1483870256986273, -0.30855157078456197, 0.09072563369970835, -0.11238508011835317, -0.21757182175407938, 0.1326586683199071, 0.15232902884548694, 0.2428700336859676, -0.0687849206294407, 0.19153090121822938, -0.09888153875312, 0.025779106621548795, 0.13451776481151842, -0.033318742268244946, 0.13580671698671945, 0.07146149816547047, 0.10287944698020031, 0.15343856017856874, 0.03431858938430403, -0.12527676514225294, -0.3840107069465152, -0.18801917902014234, -0.07277353558885424, 0.1656542141764045, -0.15672885113880303, -0.19153232605547824, 0.3967787241726591, -0.007042324570775555, 0.23744219927149907, 0.11973025763954706, 0.2595398386678936, 0.07300393669477974, 0.07133547398271937, 0.020389443767877918, 0.11549693813318745, 0.242312959144137, 0.021296033790955942, -0.0946005560386734, -0.06078228014602996, 0.21598121600650383] |
1,803.01273 | Accelerating Natural Gradient with Higher-Order Invariance | An appealing property of the natural gradient is that it is invariant to
arbitrary differentiable reparameterizations of the model. However, this
invariance property requires infinitesimal steps and is lost in practical
implementations with small but finite step sizes. In this paper, we study
invariance properties from a combined perspective of Riemannian geometry and
numerical differential equation solving. We define the order of invariance of a
numerical method to be its convergence order to an invariant solution. We
propose to use higher-order integrators and geodesic corrections to obtain more
invariant optimization trajectories. We prove the numerical convergence
properties of geodesic corrected updates and show that they can be as
computationally efficient as plain natural gradient. Experimentally, we
demonstrate that invariance leads to faster optimization and our techniques
improve on traditional natural gradient in deep neural network training and
natural policy gradient for reinforcement learning.
| cs.LG | an appealing property of the natural gradient is that it is invariant to arbitrary differentiable reparameterizations of the model however this invariance property requires infinitesimal steps and is lost in practical implementations with small but finite step sizes in this paper we study invariance properties from a combined perspective of riemannian geometry and numerical differential equation solving we define the order of invariance of a numerical method to be its convergence order to an invariant solution we propose to use higherorder integrators and geodesic corrections to obtain more invariant optimization trajectories we prove the numerical convergence properties of geodesic corrected updates and show that they can be as computationally efficient as plain natural gradient experimentally we demonstrate that invariance leads to faster optimization and our techniques improve on traditional natural gradient in deep neural network training and natural policy gradient for reinforcement learning | [['an', 'appealing', 'property', 'of', 'the', 'natural', 'gradient', 'is', 'that', 'it', 'is', 'invariant', 'to', 'arbitrary', 'differentiable', 'reparameterizations', 'of', 'the', 'model', 'however', 'this', 'invariance', 'property', 'requires', 'infinitesimal', 'steps', 'and', 'is', 'lost', 'in', 'practical', 'implementations', 'with', 'small', 'but', 'finite', 'step', 'sizes', 'in', 'this', 'paper', 'we', 'study', 'invariance', 'properties', 'from', 'a', 'combined', 'perspective', 'of', 'riemannian', 'geometry', 'and', 'numerical', 'differential', 'equation', 'solving', 'we', 'define', 'the', 'order', 'of', 'invariance', 'of', 'a', 'numerical', 'method', 'to', 'be', 'its', 'convergence', 'order', 'to', 'an', 'invariant', 'solution', 'we', 'propose', 'to', 'use', 'higherorder', 'integrators', 'and', 'geodesic', 'corrections', 'to', 'obtain', 'more', 'invariant', 'optimization', 'trajectories', 'we', 'prove', 'the', 'numerical', 'convergence', 'properties', 'of', 'geodesic', 'corrected', 'updates', 'and', 'show', 'that', 'they', 'can', 'be', 'as', 'computationally', 'efficient', 'as', 'plain', 'natural', 'gradient', 'experimentally', 'we', 'demonstrate', 'that', 'invariance', 'leads', 'to', 'faster', 'optimization', 'and', 'our', 'techniques', 'improve', 'on', 'traditional', 'natural', 'gradient', 'in', 'deep', 'neural', 'network', 'training', 'and', 'natural', 'policy', 'gradient', 'for', 'reinforcement', 'learning']] | [-0.08587507828597918, 0.03190035856401359, -0.142761148421185, 0.10569847421802034, -0.1404603199929103, -0.13730608706095523, -0.01284443871508893, 0.44249102230333576, -0.35005152235263504, -0.27763275847724683, 0.10239948876042544, -0.2263408240453516, -0.19525819069337932, 0.1700614492483828, -0.13507564904467834, 0.12899416680504744, 0.08729817314802871, 0.0041309301806548675, -0.14363152354587702, -0.2497081757503581, 0.28066764056187615, 0.049664925300097744, 0.285177517840248, 0.03528851828492292, 0.18547184869217184, -0.040837931847264926, 0.021094372450419657, 0.03768616605637973, -0.1132058519991648, 0.1513337283851123, 0.2385130837507598, 0.14564213130323517, 0.29733894342170714, -0.42770178065068654, -0.18667372142231756, 0.11064705069964895, 0.1650541553133773, 0.13417594009111602, -0.06285064060282096, -0.27960386211899196, 0.14215158935558128, -0.13159997499111545, -0.12185137048428812, -0.20957618061830843, -0.012828996958588804, -0.005936389873752702, -0.28508635876062033, 0.04976227664278, 0.11128924898493879, 0.05967848312591652, -0.010752768696194607, -0.05356806405930669, 0.01621551448446731, 0.08124680312389469, 0.08993783435650769, 0.04016935463727719, 0.132434352116262, -0.09724299396368695, -0.11300319152879301, 0.3937473649588915, -0.09096450161455863, -0.27056841707260876, 0.1692696638613731, -0.04267018290327771, -0.16904306268788405, 0.09894994154598538, 0.22101743313503433, 0.19742454317625502, -0.13797161965451848, 0.09078901612860886, -0.010710499763905585, 0.12595263861406308, 0.03309133351891191, 0.00869049001289727, 0.07779758401749122, 0.15732461440709086, 0.16423578334360064, 0.15343550634179656, -0.024930756723091422, -0.14133889395157462, -0.2980850476354777, -0.1775257916880081, -0.16167772273774017, 0.061758910019237265, -0.12391681821916702, -0.1620820071027204, 0.3535967074477902, 0.20305394263729662, 0.19747786940453196, 0.1439825277905781, 0.32905109328790927, 0.14856180858267537, 0.08864016899630636, 0.09552966677616317, 0.20205368406474722, 0.11383670672507293, 0.08859032658954522, -0.20377681506032425, 0.05477958205774739, 0.11549577562112387] |
1,803.01274 | $SU(2)_L$ Doublet Vector Dark Matter from Gauge-Higgs Unification | A new vector dark matter (DM) scenario in the context of the gauge-Higgs
unification (GHU) is proposed. The DM particle is identified with an
electric-charge neutral component in an $SU(2)_L$ doublet vector field with the
same quantum number as the Standard Model Higgs doublet. Since such an
$SU(2)_L$ doublet vector field is incorporated in any models of the GHU
scenario, it is always a primary and model-independent candidate for the DM in
the scenario. The observed relic density is reproduced through a DM pair
annihilations into the weak gauge bosons with a TeV-scale DM mass, which is
nothing but the compactification scale of extra-dimensions. Due to the
higher-dimensional gauge structure of the GHU scenario, a pair of the DM
particles has no direct coupling with a single $Z$-boson/Higgs boson, so that
the DM particle evades the severe constraint from the current direct DM search
experiments.
| hep-ph hep-th | a new vector dark matter dm scenario in the context of the gaugehiggs unification ghu is proposed the dm particle is identified with an electriccharge neutral component in an su2_l doublet vector field with the same quantum number as the standard model higgs doublet since such an su2_l doublet vector field is incorporated in any models of the ghu scenario it is always a primary and modelindependent candidate for the dm in the scenario the observed relic density is reproduced through a dm pair annihilations into the weak gauge bosons with a tevscale dm mass which is nothing but the compactification scale of extradimensions due to the higherdimensional gauge structure of the ghu scenario a pair of the dm particles has no direct coupling with a single zbosonhiggs boson so that the dm particle evades the severe constraint from the current direct dm search experiments | [['a', 'new', 'vector', 'dark', 'matter', 'dm', 'scenario', 'in', 'the', 'context', 'of', 'the', 'gaugehiggs', 'unification', 'ghu', 'is', 'proposed', 'the', 'dm', 'particle', 'is', 'identified', 'with', 'an', 'electriccharge', 'neutral', 'component', 'in', 'an', 'su2_l', 'doublet', 'vector', 'field', 'with', 'the', 'same', 'quantum', 'number', 'as', 'the', 'standard', 'model', 'higgs', 'doublet', 'since', 'such', 'an', 'su2_l', 'doublet', 'vector', 'field', 'is', 'incorporated', 'in', 'any', 'models', 'of', 'the', 'ghu', 'scenario', 'it', 'is', 'always', 'a', 'primary', 'and', 'modelindependent', 'candidate', 'for', 'the', 'dm', 'in', 'the', 'scenario', 'the', 'observed', 'relic', 'density', 'is', 'reproduced', 'through', 'a', 'dm', 'pair', 'annihilations', 'into', 'the', 'weak', 'gauge', 'bosons', 'with', 'a', 'tevscale', 'dm', 'mass', 'which', 'is', 'nothing', 'but', 'the', 'compactification', 'scale', 'of', 'extradimensions', 'due', 'to', 'the', 'higherdimensional', 'gauge', 'structure', 'of', 'the', 'ghu', 'scenario', 'a', 'pair', 'of', 'the', 'dm', 'particles', 'has', 'no', 'direct', 'coupling', 'with', 'a', 'single', 'zbosonhiggs', 'boson', 'so', 'that', 'the', 'dm', 'particle', 'evades', 'the', 'severe', 'constraint', 'from', 'the', 'current', 'direct', 'dm', 'search', 'experiments']] | [-0.1527370612295474, 0.21744266926978323, -0.06342821309630785, 0.16709808486403846, -0.11771253202459775, -0.19863089410258303, -0.036771665406478055, 0.29146952723587877, -0.19365273211345388, -0.3257935224537505, -0.001421608671080321, -0.21572773642967352, -0.0047903914625446005, 0.09358536858174678, 0.07423335107159801, -0.020489450185171638, -0.0065750107977591045, 0.08525221158763291, -0.003029047619848926, -0.2632017544690623, 0.30069131250234526, 0.032051637091879255, 0.21242344599320656, 0.04336057485003645, 0.11041268213496853, 0.017153013717486627, 0.007012026449148025, -0.10176314984629345, -0.05773251869954442, 0.06458599802054879, 0.1259423089225038, 0.08879909710311848, 0.12531061349889366, -0.3702202423592098, -0.23442418416056576, 0.22363171743927523, 0.17436044980422594, 0.11647956044746227, -0.1330988252003509, -0.3876790256989706, 0.08471860422933888, -0.24384372228006315, -0.08842140292916964, 0.020237075768010173, -0.05571289320586301, -0.1490167826737484, -0.32658443015801214, 0.08363385310965693, -0.02380442623527617, -0.04512111471962675, -0.024453228208585642, -0.10092928331060749, -0.08171934388681418, -0.08137392464171474, 0.18060798013256216, 0.04696860860147151, 0.20070667842972195, -0.2471965417563398, -0.15570866988208662, 0.4666416582444476, -0.1678268743885888, -0.18592709048405393, 0.1927193843536467, -0.0905719743855621, -0.16048527285521333, 0.13356482086075833, 0.11707727250177413, 0.05855970591397232, -0.14412778551963534, 0.22500089856031183, -0.1254176522529128, 0.20427560039388482, -0.03035841544786106, 0.024088146377632964, 0.36614328225712395, 0.19265256330577862, 0.07670801231223676, 0.005865282369389509, -0.10055697160229708, -0.10440767173875226, -0.39827625298251706, -0.19454482997955186, -0.13231376985398433, 0.0036770959537130287, -0.09008549210102501, -0.09987109222695129, 0.37292743259523475, 0.10029617950527205, 0.2619457878754474, -0.021860210164353095, 0.32194886673500556, 0.09746089656821116, 0.09993013373200989, -0.009552538100655915, 0.3233321921725292, 0.16217630106257275, 0.07671710808386302, -0.18727313599568637, -0.04681090545879366, 0.052811653063852444] |
1,803.01275 | Generation of discord through a remote joint continuous variable
measurement | In quantum mechanics, continuously measuring an observable steers the system
into one eigenstate of that observable. This property has interesting and
useful consequences when the observable is a joint property of two remotely
separated qubits. In particular, if the measurement of the two-qubit joint
observable is performed in a way that is blind to single-qubit information,
quantum back-action generates correlation of the discord type even if the
measurement is weak and inefficient. We demonstrate the ability to generate
these quantum correlations in a circuit-QED setup by performing a weak joint
readout of two remote, non-interacting, superconducting transmon qubits using
the two non-degenerate modes of a Josephson Parametric Converter (JPC).
Single-qubit information is erased from the output in the limit of large gain
and with properly tailored cavity drive pulses. Our results of the measurement
of discord are in quantitative agreement with theoretical predictions, and
demonstrate the utility of the JPC as a which-qubit information eraser.
| quant-ph | in quantum mechanics continuously measuring an observable steers the system into one eigenstate of that observable this property has interesting and useful consequences when the observable is a joint property of two remotely separated qubits in particular if the measurement of the twoqubit joint observable is performed in a way that is blind to singlequbit information quantum backaction generates correlation of the discord type even if the measurement is weak and inefficient we demonstrate the ability to generate these quantum correlations in a circuitqed setup by performing a weak joint readout of two remote noninteracting superconducting transmon qubits using the two nondegenerate modes of a josephson parametric converter jpc singlequbit information is erased from the output in the limit of large gain and with properly tailored cavity drive pulses our results of the measurement of discord are in quantitative agreement with theoretical predictions and demonstrate the utility of the jpc as a whichqubit information eraser | [['in', 'quantum', 'mechanics', 'continuously', 'measuring', 'an', 'observable', 'steers', 'the', 'system', 'into', 'one', 'eigenstate', 'of', 'that', 'observable', 'this', 'property', 'has', 'interesting', 'and', 'useful', 'consequences', 'when', 'the', 'observable', 'is', 'a', 'joint', 'property', 'of', 'two', 'remotely', 'separated', 'qubits', 'in', 'particular', 'if', 'the', 'measurement', 'of', 'the', 'twoqubit', 'joint', 'observable', 'is', 'performed', 'in', 'a', 'way', 'that', 'is', 'blind', 'to', 'singlequbit', 'information', 'quantum', 'backaction', 'generates', 'correlation', 'of', 'the', 'discord', 'type', 'even', 'if', 'the', 'measurement', 'is', 'weak', 'and', 'inefficient', 'we', 'demonstrate', 'the', 'ability', 'to', 'generate', 'these', 'quantum', 'correlations', 'in', 'a', 'circuitqed', 'setup', 'by', 'performing', 'a', 'weak', 'joint', 'readout', 'of', 'two', 'remote', 'noninteracting', 'superconducting', 'transmon', 'qubits', 'using', 'the', 'two', 'nondegenerate', 'modes', 'of', 'a', 'josephson', 'parametric', 'converter', 'jpc', 'singlequbit', 'information', 'is', 'erased', 'from', 'the', 'output', 'in', 'the', 'limit', 'of', 'large', 'gain', 'and', 'with', 'properly', 'tailored', 'cavity', 'drive', 'pulses', 'our', 'results', 'of', 'the', 'measurement', 'of', 'discord', 'are', 'in', 'quantitative', 'agreement', 'with', 'theoretical', 'predictions', 'and', 'demonstrate', 'the', 'utility', 'of', 'the', 'jpc', 'as', 'a', 'whichqubit', 'information', 'eraser']] | [-0.16201938007196243, 0.19018106151653028, -0.08183329938850425, 0.025481805220464025, 0.004385234240756987, -0.24056222964707133, 0.05817838158842491, 0.37681453954428434, -0.2438071777245828, -0.2714527642064087, 0.032170979207829124, -0.2875818222936533, -0.07278754523132819, 0.2379134710055667, -0.0370566623645242, 0.11836519279190666, 0.10872546812616192, 0.028505282166607485, -0.07229476575528017, -0.18629307484604998, 0.2958675558246406, 0.02150924122883249, 0.2967639908242922, 0.0026730515558708026, 0.12960578004418352, 0.001596582952173209, 0.04304698789673676, -0.015649932980924458, -0.06977049942937598, 0.0750063849150433, 0.27599281653634866, 0.1274150655296474, 0.26941916375880604, -0.42668360095567903, -0.15849727975785152, 0.1169114123316264, 0.11988010324421339, 0.1668403747902772, -0.047973443203690375, -0.35033053318159535, 0.016896968386922177, -0.18137646201006197, -0.06652636630097766, -0.08827850053256209, -0.013918441662855156, -0.03568665920068848, -0.29536410637030547, 0.06450531419136792, 0.08011726212465543, 0.026836659783473264, 0.037773234449181854, 0.0012415072906387414, 0.009168740426940094, 0.15156194876955803, -0.05865523242240457, 0.007985474276447113, 0.16582714944364285, -0.11474915594278302, -0.15926887977425336, 0.3140475003637658, -0.060200235162341555, -0.19509732042886802, 0.11756791182575965, -0.1585516485948019, -0.10610478829181233, 0.05725128862359742, 0.08888668466552899, 0.05323312398917102, -0.16964612691011205, 0.040824130012702145, -0.014906547969666782, 0.22358393637681162, 0.019581912953237243, 0.16058058836212943, 0.23745716516799353, 0.14229870863053223, 0.06393625185705491, 0.18188830962035707, -0.09129761184952011, -0.11194576284857224, -0.3221262746721857, -0.17751286917988984, -0.25712316074444874, 0.103360538026197, -0.05044847302246149, -0.1005160502617719, 0.40610670000798516, 0.1678564331612199, 0.17507311481946183, -0.023330353022032936, 0.3590705384947843, 0.11415830461683309, 0.03762430152341772, 0.01478175000989108, 0.29223044914293234, 0.1852037601721739, 0.053523813658575344, -0.2763303799430731, 0.06501938040404544, -0.02973556341512685] |
1,803.01276 | Station Assignment with Reallocation | We study a dynamic allocation problem that arises in various scenarios where
mobile clients joining and leaving the system have to communicate with static
stations via radio transmissions. Restrictions are a maximum delay, or laxity,
between consecutive client transmissions and a maximum bandwidth that a station
can share among its clients. We study the problem of assigning clients to
stations so that every client transmits to some station, satisfying those
restrictions. We consider reallocation algorithms, where clients are revealed
at its arrival time, the departure time is unknown until they leave, and
clients may be reallocated to another station, but at a cost proportional to
the reciprocal of the client laxity. We present negative results for previous
related protocols that motivate the study; we introduce new protocols that
expound trade-offs between station usage and reallocation cost; we determine
experimentally a classification of the clients attempting to balance those
opposite goals; we prove theoretically bounds on our performance metrics; and
we show through simulations that, for realistic scenarios, our protocols behave
much better than our theoretical guarantees.
| cs.DS | we study a dynamic allocation problem that arises in various scenarios where mobile clients joining and leaving the system have to communicate with static stations via radio transmissions restrictions are a maximum delay or laxity between consecutive client transmissions and a maximum bandwidth that a station can share among its clients we study the problem of assigning clients to stations so that every client transmits to some station satisfying those restrictions we consider reallocation algorithms where clients are revealed at its arrival time the departure time is unknown until they leave and clients may be reallocated to another station but at a cost proportional to the reciprocal of the client laxity we present negative results for previous related protocols that motivate the study we introduce new protocols that expound tradeoffs between station usage and reallocation cost we determine experimentally a classification of the clients attempting to balance those opposite goals we prove theoretically bounds on our performance metrics and we show through simulations that for realistic scenarios our protocols behave much better than our theoretical guarantees | [['we', 'study', 'a', 'dynamic', 'allocation', 'problem', 'that', 'arises', 'in', 'various', 'scenarios', 'where', 'mobile', 'clients', 'joining', 'and', 'leaving', 'the', 'system', 'have', 'to', 'communicate', 'with', 'static', 'stations', 'via', 'radio', 'transmissions', 'restrictions', 'are', 'a', 'maximum', 'delay', 'or', 'laxity', 'between', 'consecutive', 'client', 'transmissions', 'and', 'a', 'maximum', 'bandwidth', 'that', 'a', 'station', 'can', 'share', 'among', 'its', 'clients', 'we', 'study', 'the', 'problem', 'of', 'assigning', 'clients', 'to', 'stations', 'so', 'that', 'every', 'client', 'transmits', 'to', 'some', 'station', 'satisfying', 'those', 'restrictions', 'we', 'consider', 'reallocation', 'algorithms', 'where', 'clients', 'are', 'revealed', 'at', 'its', 'arrival', 'time', 'the', 'departure', 'time', 'is', 'unknown', 'until', 'they', 'leave', 'and', 'clients', 'may', 'be', 'reallocated', 'to', 'another', 'station', 'but', 'at', 'a', 'cost', 'proportional', 'to', 'the', 'reciprocal', 'of', 'the', 'client', 'laxity', 'we', 'present', 'negative', 'results', 'for', 'previous', 'related', 'protocols', 'that', 'motivate', 'the', 'study', 'we', 'introduce', 'new', 'protocols', 'that', 'expound', 'tradeoffs', 'between', 'station', 'usage', 'and', 'reallocation', 'cost', 'we', 'determine', 'experimentally', 'a', 'classification', 'of', 'the', 'clients', 'attempting', 'to', 'balance', 'those', 'opposite', 'goals', 'we', 'prove', 'theoretically', 'bounds', 'on', 'our', 'performance', 'metrics', 'and', 'we', 'show', 'through', 'simulations', 'that', 'for', 'realistic', 'scenarios', 'our', 'protocols', 'behave', 'much', 'better', 'than', 'our', 'theoretical', 'guarantees']] | [-0.23256427093424878, 0.0699896147575187, -0.058262861106248405, 0.04200894386700715, -0.11997510483805937, -0.26006875340085983, 0.18932360348117072, 0.4258309324822304, -0.2732171785530888, -0.31913654020437127, 0.07575160072817445, -0.31964222991585056, -0.11596520955274835, 0.1439053911930056, -0.1333365661981092, 0.02866903703000968, 0.0721047949952084, 0.05049412119048859, -0.03266238137439359, -0.28557197722627525, 0.26928099449750414, 0.07945876635891512, 0.30740824843682774, 0.05505070631360551, 0.07270084657780403, -0.003439320570164868, -0.012016212264742617, -0.009067561936304131, -0.12101497132979686, 0.051025258250195875, 0.3023145337594377, 0.20458797516370064, 0.296315664395727, -0.4819200562691218, -0.18141139843448234, 0.1391712037280244, 0.10794190093640116, 0.04667925276325233, -0.015378486808913294, -0.2587157657412304, 0.13202283322276676, -0.1883028268507174, -0.058495340060537936, 0.0007185570138972253, -0.030388577388790014, 0.06378160425083479, -0.2948308765877631, -0.03889830626113425, -0.06234096004151401, 0.0018641475524584, -0.04433126561707468, -0.05751835099164799, 0.01567595129877604, 0.2162257098025293, 0.0850894943320203, -0.02922180331634908, 0.11939004601729473, -0.06475572413282035, -0.16896745907566088, 0.3938227951928804, 0.02595663778389611, -0.17744138756560543, 0.18830013059116688, -0.0968150634924479, -0.15261724694970658, 0.05598348790425172, 0.20920907098016786, 0.09002731522857423, -0.1194480527880263, 0.013000257247437152, -0.062483216389823196, 0.15881643277878704, 0.11612437926867808, 0.09229014822498853, 0.1640933449499161, 0.14870927767531777, 0.17498571144295222, 0.11376408840839179, -0.050191902451016096, -0.11166336060110056, -0.25588276687565004, -0.14558589190974916, -0.1984230719125745, 0.030008277789668435, -0.07180045170149572, -0.05426223797588715, 0.3674195936394178, 0.19173446931646057, 0.1599846005767838, 0.14439293189207092, 0.3817283760290593, 0.06698550383854043, 0.05616572292373431, 0.18317604582460428, 0.17279318213646053, 0.009488812100078741, 0.1400184674976944, -0.1920201236525, 0.12247464874103157, -0.016774699696477248] |
1,803.01277 | The Near-Infrared Tip of the Red Giant Branch. II. An Absolute
Calibration in the Large Magellanic Cloud | We present a new empirical \(JHK\) absolute calibration of the tip of the red
giant branch (TRGB) in the Large Magellanic Cloud (LMC). We use published data
from the extensive \emph{Near-Infrared Synoptic Survey} containing 3.5 million
stars, of which 65,000 are red giants that fall within one magnitude of the
TRGB. Adopting the TRGB slopes from a companion study of the isolated dwarf
galaxy IC\,1613 as well as an LMC distance modulus of \(\mu_0 = \)~18.49~mag
from (geometric) detached eclipsing binaries, we derive absolute \(JHK\)
zero-points for the near-infrared TRGB. For comparison with measurements in the
bar alone, we apply the calibrated \(JHK\) TRGB to a 500 deg\textsuperscript{2}
area of the 2MASS survey. The TRGB reveals the 3-dimensional structure of the
LMC with a tilt in the direction perpendicular to the major axis of the bar, in
agreement with previous studies.
| astro-ph.GA astro-ph.CO astro-ph.SR | we present a new empirical jhk absolute calibration of the tip of the red giant branch trgb in the large magellanic cloud lmc we use published data from the extensive emphnearinfrared synoptic survey containing 35 million stars of which 65000 are red giants that fall within one magnitude of the trgb adopting the trgb slopes from a companion study of the isolated dwarf galaxy ic1613 as well as an lmc distance modulus of mu_0 1849mag from geometric detached eclipsing binaries we derive absolute jhk zeropoints for the nearinfrared trgb for comparison with measurements in the bar alone we apply the calibrated jhk trgb to a 500 degtextsuperscript2 area of the 2mass survey the trgb reveals the 3dimensional structure of the lmc with a tilt in the direction perpendicular to the major axis of the bar in agreement with previous studies | [['we', 'present', 'a', 'new', 'empirical', 'jhk', 'absolute', 'calibration', 'of', 'the', 'tip', 'of', 'the', 'red', 'giant', 'branch', 'trgb', 'in', 'the', 'large', 'magellanic', 'cloud', 'lmc', 'we', 'use', 'published', 'data', 'from', 'the', 'extensive', 'emphnearinfrared', 'synoptic', 'survey', 'containing', '35', 'million', 'stars', 'of', 'which', '65000', 'are', 'red', 'giants', 'that', 'fall', 'within', 'one', 'magnitude', 'of', 'the', 'trgb', 'adopting', 'the', 'trgb', 'slopes', 'from', 'a', 'companion', 'study', 'of', 'the', 'isolated', 'dwarf', 'galaxy', 'ic1613', 'as', 'well', 'as', 'an', 'lmc', 'distance', 'modulus', 'of', 'mu_0', '1849mag', 'from', 'geometric', 'detached', 'eclipsing', 'binaries', 'we', 'derive', 'absolute', 'jhk', 'zeropoints', 'for', 'the', 'nearinfrared', 'trgb', 'for', 'comparison', 'with', 'measurements', 'in', 'the', 'bar', 'alone', 'we', 'apply', 'the', 'calibrated', 'jhk', 'trgb', 'to', 'a', '500', 'degtextsuperscript2', 'area', 'of', 'the', '2mass', 'survey', 'the', 'trgb', 'reveals', 'the', '3dimensional', 'structure', 'of', 'the', 'lmc', 'with', 'a', 'tilt', 'in', 'the', 'direction', 'perpendicular', 'to', 'the', 'major', 'axis', 'of', 'the', 'bar', 'in', 'agreement', 'with', 'previous', 'studies']] | [-0.059452186926628334, 0.009261130991865147, -0.16041636498590564, 0.059222100907596796, -0.13579885793312785, 0.0008808511435088233, 0.12591296347898234, 0.42317451656299787, -0.16950398945907322, -0.36286300082221956, 0.028031120875537614, -0.353752941498193, -0.038251189691741974, 0.22349428641609848, -0.11837051662847563, -0.04335287006667061, 0.16849912433157654, -0.09350858877130859, -0.04943832236913162, -0.28311901716141535, 0.2538909543387211, -0.03585844828210173, 0.15396109625805904, -0.1261451904361143, 0.02540996143964874, -0.09098998504226864, -0.1003427566946858, -0.027999547357759336, -0.23814974721024249, 0.08142306741299855, 0.199503803041077, 0.05868062684244483, 0.19614956597457675, -0.290073617075971, -0.09356262061037939, 0.044710501503321703, 0.2370712695554932, 0.04129347527640987, -0.031955998479286686, -0.27910062645555195, 0.06347820362718572, -0.15293028862147598, -0.2480637417888663, 0.10212922365027378, 0.0836542384430467, 0.08178655690867045, -0.18065394976250249, 0.13679086386836237, -0.05572855181186494, 0.2292361612955149, -0.12680411063828065, -0.22069938942436537, -0.06107567287777571, 0.11282227971135592, 0.004299962770764845, 0.14675808791581024, 0.12667616291386313, -0.1300322580402785, 0.013422092402449055, 0.37053470271401595, -0.1455755942869918, 0.06428076360157153, 0.17352941239347858, -0.16093348781748193, -0.13440490223596513, 0.053645658726552435, 0.12338859859486892, 0.13319509387029893, -0.2413936666615331, 0.033614181624521525, 0.012749083880607012, 0.15965581879726726, 0.06552431349520212, 0.042597794164803617, 0.2815926346616024, 0.13956030975707745, 0.051083355108751866, 0.10836091279358107, -0.3719079013349638, -0.05772288366948275, -0.29126533761239837, -0.09369874080361791, -0.1455312123943637, 0.10024253739193625, -0.1879906620673944, -0.1718343402782496, 0.32170495893623524, 0.11332102781365605, 0.25863958168672874, 0.055113297077337704, 0.3848445866066609, 0.007510658412199658, 0.18655378434188447, 0.08569279298131918, 0.4084769295831041, 0.19479239848272425, 0.08404819444110821, -0.23151962895262443, 0.03275277318405735, 0.02425153715617574] |
1,803.01278 | The Near-Infrared Tip of the Red Giant Branch. I. A Calibration in the
Isolated Dwarf Galaxy IC 1613 | Based on observations from the \emph{FourStar} near-infrared camera on the
6.5m Baade-Magellan telescope at Las Campanas, Chile, we present calibrations
of the $JHK$ luminosities of stars defining the tip of the red giant branch
(TRGB) in the halo of the Local Group dwarf galaxy IC 1613. We employ
metallicity-independent (rectified) T-band magnitudes---constructed using $J,H$
and $K$-band magnitudes and both $(J-H)~ \& ~(J-K)$ colors in order to flatten
the upward-sloping red giant branch tips as otherwise seen in their apparent
color-magnitude diagrams. We describe and quantify the advantages of working at
these particular near-infrared wavelengths, which are applicable to both
\emph{HST} and \emph{JWST}. We also note that these same wavelengths can be
accessed from the ground for an eventual tie-in to \emph{Gaia} for absolute
astrometry and parallaxes to calibrate the intrinsic luminosity of the TRGB.
Adopting the color terms derived from the IC 1613 data, as well as the
zero-points from a companion study of the Large Magellanic Cloud whose distance
is anchored to the geometric distances of detached eclipsing binaries, we find
a true distance modulus of 24.32 $\pm$ 0.02~ (statistical) $\pm$ 0.06~mag
(systematic) for IC 1613, which compares favorably with the recently published
multi-wavelength, multi-method consensus modulus of 24.30 $\pm$ 0.05~mag by
Hatt et al. (2017).
| astro-ph.GA astro-ph.CO astro-ph.SR | based on observations from the emphfourstar nearinfrared camera on the 65m baademagellan telescope at las campanas chile we present calibrations of the jhk luminosities of stars defining the tip of the red giant branch trgb in the halo of the local group dwarf galaxy ic 1613 we employ metallicityindependent rectified tband magnitudesconstructed using jh and kband magnitudes and both jh jk colors in order to flatten the upwardsloping red giant branch tips as otherwise seen in their apparent colormagnitude diagrams we describe and quantify the advantages of working at these particular nearinfrared wavelengths which are applicable to both emphhst and emphjwst we also note that these same wavelengths can be accessed from the ground for an eventual tiein to emphgaia for absolute astrometry and parallaxes to calibrate the intrinsic luminosity of the trgb adopting the color terms derived from the ic 1613 data as well as the zeropoints from a companion study of the large magellanic cloud whose distance is anchored to the geometric distances of detached eclipsing binaries we find a true distance modulus of 2432 pm 002 statistical pm 006mag systematic for ic 1613 which compares favorably with the recently published multiwavelength multimethod consensus modulus of 2430 pm 005mag by hatt et al 2017 | [['based', 'on', 'observations', 'from', 'the', 'emphfourstar', 'nearinfrared', 'camera', 'on', 'the', '65m', 'baademagellan', 'telescope', 'at', 'las', 'campanas', 'chile', 'we', 'present', 'calibrations', 'of', 'the', 'jhk', 'luminosities', 'of', 'stars', 'defining', 'the', 'tip', 'of', 'the', 'red', 'giant', 'branch', 'trgb', 'in', 'the', 'halo', 'of', 'the', 'local', 'group', 'dwarf', 'galaxy', 'ic', '1613', 'we', 'employ', 'metallicityindependent', 'rectified', 'tband', 'magnitudesconstructed', 'using', 'jh', 'and', 'kband', 'magnitudes', 'and', 'both', 'jh', 'jk', 'colors', 'in', 'order', 'to', 'flatten', 'the', 'upwardsloping', 'red', 'giant', 'branch', 'tips', 'as', 'otherwise', 'seen', 'in', 'their', 'apparent', 'colormagnitude', 'diagrams', 'we', 'describe', 'and', 'quantify', 'the', 'advantages', 'of', 'working', 'at', 'these', 'particular', 'nearinfrared', 'wavelengths', 'which', 'are', 'applicable', 'to', 'both', 'emphhst', 'and', 'emphjwst', 'we', 'also', 'note', 'that', 'these', 'same', 'wavelengths', 'can', 'be', 'accessed', 'from', 'the', 'ground', 'for', 'an', 'eventual', 'tiein', 'to', 'emphgaia', 'for', 'absolute', 'astrometry', 'and', 'parallaxes', 'to', 'calibrate', 'the', 'intrinsic', 'luminosity', 'of', 'the', 'trgb', 'adopting', 'the', 'color', 'terms', 'derived', 'from', 'the', 'ic', '1613', 'data', 'as', 'well', 'as', 'the', 'zeropoints', 'from', 'a', 'companion', 'study', 'of', 'the', 'large', 'magellanic', 'cloud', 'whose', 'distance', 'is', 'anchored', 'to', 'the', 'geometric', 'distances', 'of', 'detached', 'eclipsing', 'binaries', 'we', 'find', 'a', 'true', 'distance', 'modulus', 'of', '2432', 'pm', '002', 'statistical', 'pm', '006mag', 'systematic', 'for', 'ic', '1613', 'which', 'compares', 'favorably', 'with', 'the', 'recently', 'published', 'multiwavelength', 'multimethod', 'consensus', 'modulus', 'of', '2430', 'pm', '005mag', 'by', 'hatt', 'et', 'al', '2017']] | [-0.03388870678492822, 0.04526663881559216, -0.14349490280845204, 0.06856104985170532, -0.13267606532899662, -0.07591233784798533, 0.0987205395050114, 0.4522351764142513, -0.1650392432830995, -0.3609759477013722, 0.05792974453186616, -0.3117415135714691, -0.06525140505284072, 0.19769370823167265, -0.13966195810819046, -0.04541032042005099, 0.0952601219736971, -0.09346086624078452, -0.05111910083971452, -0.281002576474566, 0.24791683762567118, 0.028105156819801778, 0.18308014372829348, -0.0869251158827683, 0.06862565069022822, -0.06088903607742395, -0.09092050521692727, -0.025003188163536832, -0.20457660765754554, 0.055009135105647144, 0.22719903952325693, 0.08376766502158717, 0.1632508118439, -0.298815462840721, -0.09510518091570702, 0.07230251671047881, 0.19627770934952424, 0.016353231969987975, 0.005068580236984417, -0.31337172150379045, 0.061322878584032875, -0.14727501173503696, -0.18716153599554672, 0.08677636983011325, 0.0711806201620493, 0.05737956079887226, -0.21403284474930842, 0.11296882785900379, -0.046271385763357105, 0.16245562894735485, -0.09685362587566487, -0.2113293753238395, -0.08069955170562025, 0.11297895345371217, -0.046239061524393034, 0.10878166656359099, 0.07097840684931725, -0.11984891947126015, -0.019302300054696388, 0.3553793655609479, -0.1018349657143699, 0.06896100400874275, 0.20027632006676868, -0.1419136577262543, -0.12555789597390685, 0.05998897885903716, 0.13341331748000812, 0.1309362830920145, -0.22335080491146073, 0.04558559161814628, 0.029156922491383738, 0.17035792081151158, 0.06470518678601365, 0.09171072136385192, 0.25011230815900487, 0.0888333999668248, 0.017021053431089967, 0.06655844530963805, -0.3127101722441148, -0.02289593039691681, -0.2728493610478472, -0.08914877231029095, -0.16437129033292877, 0.06396365134045481, -0.15359187486545126, -0.1422834545862861, 0.3012815948785283, 0.13454259146237746, 0.22530163956384058, 0.08283267661070567, 0.31195284745539537, 0.057371529951342384, 0.13503932449384592, 0.10243336829415056, 0.353797682414297, 0.16840229237801396, 0.07847520628303756, -0.24717455504403915, 0.037283219780074435, 0.06073308878811076] |
1,803.01279 | Pressure-stabilized binary compounds of magnesium and silicon | The family of binary compounds composed of magnesium and silicon is rather
rich. In addition to the well-known magnesium silicide Mg$_2$Si, other
compounds, including MgSi$_2$, Mg$_4$Si$_7$, Mg$_5$Si$_6$, MgSi, and
Mg$_9$Si$_5$, have also been identified and/or proposed in precipitated
Al-Mg-Si solid solutions. Nevertheless, computational studies show that only
Mg$_2$Si is thermodynamically stable at ambient conditions while certain
non-zero hydrostatic pressure can stabilize Mg$_9$Si$_5$ so that it can
co-exist with Mg$_2$Si. We conduct a comprehensive search for viable binary
compounds of Mg$_x$Si$_{1-x}$ ($1/3\leq x \leq 2/3$), discovering numerous new
structures for all the compounds. On the one hand, we find that MgSi$_2$, MgSi,
and Mg$_9$Si$_5$ are likely pressure-stabilized materials, while, on the other
hand, supporting previous studies, raising doubt on the existence of
Mg$_5$Si$_6$, and claiming that the existence of Mg$_4$Si$_7$ remains an open
question. Therefore, we recommend that (hydrostatic and/or non-hydrostatic)
pressure should be explicitly considered when discussing the stability of these
solids (and maybe other solids as well) by computations. We also find that
MgSi$_2$ can potentially exhibit superconducting behaviors within a wide range
of pressure with the critical temperature of up to $7$ K.
| cond-mat.mtrl-sci | the family of binary compounds composed of magnesium and silicon is rather rich in addition to the wellknown magnesium silicide mg_2si other compounds including mgsi_2 mg_4si_7 mg_5si_6 mgsi and mg_9si_5 have also been identified andor proposed in precipitated almgsi solid solutions nevertheless computational studies show that only mg_2si is thermodynamically stable at ambient conditions while certain nonzero hydrostatic pressure can stabilize mg_9si_5 so that it can coexist with mg_2si we conduct a comprehensive search for viable binary compounds of mg_xsi_1x 13leq x leq 23 discovering numerous new structures for all the compounds on the one hand we find that mgsi_2 mgsi and mg_9si_5 are likely pressurestabilized materials while on the other hand supporting previous studies raising doubt on the existence of mg_5si_6 and claiming that the existence of mg_4si_7 remains an open question therefore we recommend that hydrostatic andor nonhydrostatic pressure should be explicitly considered when discussing the stability of these solids and maybe other solids as well by computations we also find that mgsi_2 can potentially exhibit superconducting behaviors within a wide range of pressure with the critical temperature of up to 7 k | [['the', 'family', 'of', 'binary', 'compounds', 'composed', 'of', 'magnesium', 'and', 'silicon', 'is', 'rather', 'rich', 'in', 'addition', 'to', 'the', 'wellknown', 'magnesium', 'silicide', 'mg_2si', 'other', 'compounds', 'including', 'mgsi_2', 'mg_4si_7', 'mg_5si_6', 'mgsi', 'and', 'mg_9si_5', 'have', 'also', 'been', 'identified', 'andor', 'proposed', 'in', 'precipitated', 'almgsi', 'solid', 'solutions', 'nevertheless', 'computational', 'studies', 'show', 'that', 'only', 'mg_2si', 'is', 'thermodynamically', 'stable', 'at', 'ambient', 'conditions', 'while', 'certain', 'nonzero', 'hydrostatic', 'pressure', 'can', 'stabilize', 'mg_9si_5', 'so', 'that', 'it', 'can', 'coexist', 'with', 'mg_2si', 'we', 'conduct', 'a', 'comprehensive', 'search', 'for', 'viable', 'binary', 'compounds', 'of', 'mg_xsi_1x', '13leq', 'x', 'leq', '23', 'discovering', 'numerous', 'new', 'structures', 'for', 'all', 'the', 'compounds', 'on', 'the', 'one', 'hand', 'we', 'find', 'that', 'mgsi_2', 'mgsi', 'and', 'mg_9si_5', 'are', 'likely', 'pressurestabilized', 'materials', 'while', 'on', 'the', 'other', 'hand', 'supporting', 'previous', 'studies', 'raising', 'doubt', 'on', 'the', 'existence', 'of', 'mg_5si_6', 'and', 'claiming', 'that', 'the', 'existence', 'of', 'mg_4si_7', 'remains', 'an', 'open', 'question', 'therefore', 'we', 'recommend', 'that', 'hydrostatic', 'andor', 'nonhydrostatic', 'pressure', 'should', 'be', 'explicitly', 'considered', 'when', 'discussing', 'the', 'stability', 'of', 'these', 'solids', 'and', 'maybe', 'other', 'solids', 'as', 'well', 'by', 'computations', 'we', 'also', 'find', 'that', 'mgsi_2', 'can', 'potentially', 'exhibit', 'superconducting', 'behaviors', 'within', 'a', 'wide', 'range', 'of', 'pressure', 'with', 'the', 'critical', 'temperature', 'of', 'up', 'to', '7', 'k']] | [-0.13008960640678804, 0.1710924113409419, -0.02824382053416533, 0.016989784775715736, -0.054213306691963226, -0.15454868199562447, 0.08937582686129543, 0.37849892702264093, -0.2267759121579325, -0.31867388874913255, 0.11184167511269658, -0.2961332915376665, -0.11985533459487165, 0.21585465776863405, -0.0009783830635973977, 0.01427490253958644, 0.010096590769373708, -0.0005657049516836802, -0.09617619427719748, -0.2622353602465915, 0.3082360713277012, 0.03724618728608928, 0.2344005790202775, 0.07947452984258739, 0.020975489955809383, -0.09749408181071179, 0.07285799856763334, 0.045447374606091114, -0.14747614782269616, 0.050567242925495116, 0.26570354069376156, 0.05897977717298394, 0.2120559185795072, -0.39963148964775935, -0.26361559166624726, 0.07779068105026252, 0.12227611198452198, 0.08469798939638874, -0.10542474104828822, -0.21212502078592985, 0.1392196319266481, -0.14075363250061249, -0.13305232588512203, -0.14201023976008098, 0.02574901269884625, 0.021578372079723827, -0.21498886748579227, 0.06670361121812474, 0.06531515426953168, 0.06505012680879897, -0.140496497725447, -0.1924040056558119, -0.07922253746461744, 0.05703861238127704, 0.057026976257677435, -0.01345096299644663, 0.13207746581950536, -0.09929971763243278, -0.049979009849549685, 0.40442063733514966, -0.03804920826417704, -0.08686672925638655, 0.26535480432600406, -0.14323826880039026, -0.18688324335703832, 0.1310650162657516, 0.12278345377805332, 0.12249928045655704, -0.13631753977299216, 0.042001850844503176, -0.06249145331999494, 0.19588127158155355, 0.08371119471654917, 0.04271492601514587, 0.2374550590188139, 0.16544393480160377, 0.03231401684590512, 0.10532315792806912, -0.06312129964353516, -0.05859108991248326, -0.2121456831428481, -0.18360248850141134, -0.1045107491062178, 0.031468083056259075, -0.06212698968423259, -0.17926990307815788, 0.30273512937128544, 0.15683195212332066, 0.15625045342927074, -0.02563368676799453, 0.20705951118984053, 0.03812033044394209, 0.08705560055742455, 0.06060873960248298, 0.2649665840746214, 0.08419664579366024, 0.06563385091980713, -0.19886476550923868, 0.12411293119916486, -0.015095959187278317] |
1,803.0128 | Optimization of Time-Resolved Magneto-optical Kerr Effect Signals for
Magnetization Dynamics Measurements | Recently magnetic storage and magnetic memory have shifted towards the use of
magnetic thin films with perpendicular magnetic anisotropy (PMA). Understanding
the magnetic damping in these materials is crucial, but normal Ferromagnetic
Resonance (FMR) measurements face some limitations. The desire to quantify the
damping in materials with PMA has resulted in the adoption of Time-Resolved
Magneto-optical Kerr Effect (TR-MOKE) measurements. In this paper, we discuss
the angle and field dependent signals in TR-MOKE, and utilize a numerical
algorithm based on the Landau-Lifshitz-Gilbert (LLG) equation to provide
information on the optimal conditions to run TR-MOKE measurements.
| cond-mat.mes-hall | recently magnetic storage and magnetic memory have shifted towards the use of magnetic thin films with perpendicular magnetic anisotropy pma understanding the magnetic damping in these materials is crucial but normal ferromagnetic resonance fmr measurements face some limitations the desire to quantify the damping in materials with pma has resulted in the adoption of timeresolved magnetooptical kerr effect trmoke measurements in this paper we discuss the angle and field dependent signals in trmoke and utilize a numerical algorithm based on the landaulifshitzgilbert llg equation to provide information on the optimal conditions to run trmoke measurements | [['recently', 'magnetic', 'storage', 'and', 'magnetic', 'memory', 'have', 'shifted', 'towards', 'the', 'use', 'of', 'magnetic', 'thin', 'films', 'with', 'perpendicular', 'magnetic', 'anisotropy', 'pma', 'understanding', 'the', 'magnetic', 'damping', 'in', 'these', 'materials', 'is', 'crucial', 'but', 'normal', 'ferromagnetic', 'resonance', 'fmr', 'measurements', 'face', 'some', 'limitations', 'the', 'desire', 'to', 'quantify', 'the', 'damping', 'in', 'materials', 'with', 'pma', 'has', 'resulted', 'in', 'the', 'adoption', 'of', 'timeresolved', 'magnetooptical', 'kerr', 'effect', 'trmoke', 'measurements', 'in', 'this', 'paper', 'we', 'discuss', 'the', 'angle', 'and', 'field', 'dependent', 'signals', 'in', 'trmoke', 'and', 'utilize', 'a', 'numerical', 'algorithm', 'based', 'on', 'the', 'landaulifshitzgilbert', 'llg', 'equation', 'to', 'provide', 'information', 'on', 'the', 'optimal', 'conditions', 'to', 'run', 'trmoke', 'measurements']] | [-0.16913402719472193, 0.1116255718773525, -0.029274415616926393, -0.010765442252159118, -0.16583954564197675, -0.11958217101759816, 0.011803940508367592, 0.44942243538404764, -0.2722919757428922, -0.33190122140865574, 0.0575969545881411, -0.2719313265118552, -0.10149780505974042, 0.2576400083244631, 0.013065227906056527, 0.07668995207273646, -0.006018058465499627, -0.064839152623838, -0.054047481245116186, -0.18036905399670727, 0.2789399876161233, 0.04587136230578548, 0.3425655597918912, 0.05462429160742383, 0.078395173823657, -0.021242850904941168, 0.0659075169382911, 0.02177776822722272, -0.20521560180932283, 0.05902847164359532, 0.2160384738719777, -0.08097578512602731, 0.2338441889733076, -0.5085055740158024, -0.1840556666549099, 0.006319059485471562, 0.14049677363547838, 0.17333996257695714, -0.12067338214991125, -0.2769622881357607, 0.042568638538451574, -0.08028890743704611, -0.0988230060638958, -0.13950583523041324, -0.012598867874935662, 0.020566191877189437, -0.29381289684434275, 0.06891791074487724, 0.08064218845806624, 0.13794388872032104, -0.12466960647633593, -0.09620952914027792, -0.016255996949774653, 0.030816312231687144, 0.0994238538888136, 0.06069147830804516, 0.19026204225159937, -0.10986136962463589, -0.14013227947840565, 0.3140146835658111, -0.06726604673129163, -0.15357370039350107, 0.09682634153011206, -0.2418419238081888, -0.08000978112808968, 0.1118655860387279, 0.20076513458043338, 0.08582939585964931, -0.17514738281698602, 0.06912520850187559, 0.045586418639868495, 0.1680221444486003, 0.051629423379505934, 0.07236036861217336, 0.20344425477087497, 0.20585242060846404, 0.020742769497691802, 0.14166376398949834, -0.15906359497212658, 0.0007919023009507279, -0.14319174380078423, -0.15081868832551806, -0.19519305599265194, 0.07093672691109149, -0.09436745131832523, -0.16101088838553743, 0.3764399898091429, 0.24945247004200755, 0.13816869791204991, -0.07335448507219552, 0.34269635130308174, 0.1003403876479225, 0.07737210071400592, 0.029872285736430634, 0.33944601197144947, 0.22640064401356014, 0.22107345041049964, -0.3158365506629803, 0.12724337952309533, -0.0384823734063263] |
1,803.01281 | Design, Generation, and Validation of Extreme Scale Power-Law Graphs | Massive power-law graphs drive many fields: metagenomics, brain mapping,
Internet-of-things, cybersecurity, and sparse machine learning. The development
of novel algorithms and systems to process these data requires the design,
generation, and validation of enormous graphs with exactly known properties.
Such graphs accelerate the proper testing of new algorithms and systems and are
a prerequisite for success on real applications. Many random graph generators
currently exist that require realizing a graph in order to know its exact
properties: number of vertices, number of edges, degree distribution, and
number of triangles. Designing graphs using these random graph generators is a
time-consuming trial-and-error process. This paper presents a novel approach
that uses Kronecker products to allow the exact computation of graph properties
prior to graph generation. In addition, when a real graph is desired, it can be
generated quickly in memory on a parallel computer with no-interprocessor
communication. To test this approach, graphs with $10^{12}$ edges are generated
on a 40,000+ core supercomputer in 1 second and exactly agree with those
predicted by the theory. In addition, to demonstrate the extensibility of this
approach, decetta-scale graphs with up to $10^{30}$ edges are simulated in a
few minutes on a laptop.
| cs.DC cs.DM cs.DS cs.PF math.CO | massive powerlaw graphs drive many fields metagenomics brain mapping internetofthings cybersecurity and sparse machine learning the development of novel algorithms and systems to process these data requires the design generation and validation of enormous graphs with exactly known properties such graphs accelerate the proper testing of new algorithms and systems and are a prerequisite for success on real applications many random graph generators currently exist that require realizing a graph in order to know its exact properties number of vertices number of edges degree distribution and number of triangles designing graphs using these random graph generators is a timeconsuming trialanderror process this paper presents a novel approach that uses kronecker products to allow the exact computation of graph properties prior to graph generation in addition when a real graph is desired it can be generated quickly in memory on a parallel computer with nointerprocessor communication to test this approach graphs with 1012 edges are generated on a 40000 core supercomputer in 1 second and exactly agree with those predicted by the theory in addition to demonstrate the extensibility of this approach decettascale graphs with up to 1030 edges are simulated in a few minutes on a laptop | [['massive', 'powerlaw', 'graphs', 'drive', 'many', 'fields', 'metagenomics', 'brain', 'mapping', 'internetofthings', 'cybersecurity', 'and', 'sparse', 'machine', 'learning', 'the', 'development', 'of', 'novel', 'algorithms', 'and', 'systems', 'to', 'process', 'these', 'data', 'requires', 'the', 'design', 'generation', 'and', 'validation', 'of', 'enormous', 'graphs', 'with', 'exactly', 'known', 'properties', 'such', 'graphs', 'accelerate', 'the', 'proper', 'testing', 'of', 'new', 'algorithms', 'and', 'systems', 'and', 'are', 'a', 'prerequisite', 'for', 'success', 'on', 'real', 'applications', 'many', 'random', 'graph', 'generators', 'currently', 'exist', 'that', 'require', 'realizing', 'a', 'graph', 'in', 'order', 'to', 'know', 'its', 'exact', 'properties', 'number', 'of', 'vertices', 'number', 'of', 'edges', 'degree', 'distribution', 'and', 'number', 'of', 'triangles', 'designing', 'graphs', 'using', 'these', 'random', 'graph', 'generators', 'is', 'a', 'timeconsuming', 'trialanderror', 'process', 'this', 'paper', 'presents', 'a', 'novel', 'approach', 'that', 'uses', 'kronecker', 'products', 'to', 'allow', 'the', 'exact', 'computation', 'of', 'graph', 'properties', 'prior', 'to', 'graph', 'generation', 'in', 'addition', 'when', 'a', 'real', 'graph', 'is', 'desired', 'it', 'can', 'be', 'generated', 'quickly', 'in', 'memory', 'on', 'a', 'parallel', 'computer', 'with', 'nointerprocessor', 'communication', 'to', 'test', 'this', 'approach', 'graphs', 'with', '1012', 'edges', 'are', 'generated', 'on', 'a', '40000', 'core', 'supercomputer', 'in', '1', 'second', 'and', 'exactly', 'agree', 'with', 'those', 'predicted', 'by', 'the', 'theory', 'in', 'addition', 'to', 'demonstrate', 'the', 'extensibility', 'of', 'this', 'approach', 'decettascale', 'graphs', 'with', 'up', 'to', '1030', 'edges', 'are', 'simulated', 'in', 'a', 'few', 'minutes', 'on', 'a', 'laptop']] | [-0.12036483047339014, 0.09177461802916159, -0.016999511000437614, 0.02269268822626775, -0.12179737549919922, -0.1274406740585199, 0.03209566647688357, 0.434194007062186, -0.2619835837290455, -0.3955893608622062, 0.11363907874896167, -0.27591413581409513, -0.17503156498170053, 0.2067713920176268, -0.08014216423497345, 0.10125036745612773, 0.1460533358180561, 0.06156047609013816, 0.007555640152154061, -0.26727322231088646, 0.26378448569478513, 0.010355583626108292, 0.26380698031175714, 0.02301697058316607, 0.07286061599480513, -0.004163706597934764, -0.009200091738826953, 0.018627041024275315, -0.08016143693172266, 0.1493067033860522, 0.27263113516621673, 0.17965424579974168, 0.29570677741788903, -0.45106573259601224, -0.18604166872130753, 0.15107788041962358, 0.12944397512489023, 0.09202140062951888, -0.05286317136711799, -0.24498613128581873, 0.13948770919217704, -0.1582525567385183, -0.06393592804909135, -0.10200925446951237, 0.019218888389280972, 0.03725323718614303, -0.28291787300258875, -0.008911473055680593, 0.038685938661607605, 0.07455272338806819, 0.06407509003825582, -0.10201180327492647, 0.026470005846558474, 0.14187733701218325, -0.021000441156912786, 0.04050726171773978, 0.12448034360945129, -0.15253641978025628, -0.19546255772121443, 0.3841855317163162, 0.01588279287605427, -0.1548266685036465, 0.194485241318426, -0.08794821069504206, -0.19372025091583148, 0.11460833351056163, 0.22016484384568266, 0.12066405773497163, -0.14118419252298714, 0.0801533101989219, 0.005210797923306624, 0.15013989489047955, 0.05352279654799555, 0.008035899646198138, 0.16463207108661151, 0.19469036657530336, 0.07405027324894968, 0.14104695954085447, -0.009375283298775171, -0.07363862802202885, -0.24451346889329262, -0.1443980176658489, -0.24899281544181018, 0.03461714856810151, -0.14961251961970284, -0.21098580247459886, 0.4162551215730416, 0.18445577394360532, 0.18574967504455112, 0.09753094450421393, 0.3082636505389252, 0.04344573486596346, 0.1041557433644835, 0.14694240648203935, 0.1345562067718651, 0.1221115288288834, 0.06904060567896335, -0.11329709602242265, 0.057234165287361694, 0.040117548699848925] |
1,803.01282 | Reciprocal and Extortive Strategies: Infinitely Iterated Prisoner's
Dilemma | The Prisoner's Dilemma game has a long history stretching across the social,
biological, and physical sciences. In 2012, Press and Dyson developed a method
for analyzing the mapping of the 8-dimensional strategy profile onto the
2-dimensional payoff space in an infinitely iterated Prisoner's Dilemma game,
based on Markov chain analysis and memory-one strategies. We generalize this
approach and introduce the concept of strategy parameter to show that linear
relations among player payoffs are a ubiquitous feature of the infinitely
iterated Prisoner's Dilemma game. Our extended analysis is applied to various
strategy profiles including tit-for-tat, win-stay-lose-shift, and other
randomized strategy sets. Strategy profiles are identified that map onto the
vertices, edges, and interior of the Prisoner's Dilemma quadrilateral in the
2-dimensional payoff (score) space. A DaMD strategy is defined based solely on
"Defection after Mutual Defection" and leads to linear relations between player
scores using strategy parameter analysis. The DaMD strategy is shown to result
in an equal (reciprocal) or larger (extortive) score for its user compare to
the other player, independent of the strategy of the other player. The
extortive scores occur when the probabilities for the DaMD player to cooperate
after conflicting plays (cooperate-defect or defect-cooperate) sum to less than
1. The equal reciprocal scores occur when the probabilities for the DaMD player
to cooperate after conflicting plays (cooperate-defect or defect-cooperate) sum
to 1. When one player selects the extortive DaMD, the opposing player can force
the equal punishment payoffs for both players in the infinitely iterated
Prisoner's dilemma by also choosing the DaMD strategy. Possible pathways to
mutual cooperation based on DaMD are discussed.
| physics.soc-ph physics.bio-ph | the prisoners dilemma game has a long history stretching across the social biological and physical sciences in 2012 press and dyson developed a method for analyzing the mapping of the 8dimensional strategy profile onto the 2dimensional payoff space in an infinitely iterated prisoners dilemma game based on markov chain analysis and memoryone strategies we generalize this approach and introduce the concept of strategy parameter to show that linear relations among player payoffs are a ubiquitous feature of the infinitely iterated prisoners dilemma game our extended analysis is applied to various strategy profiles including titfortat winstayloseshift and other randomized strategy sets strategy profiles are identified that map onto the vertices edges and interior of the prisoners dilemma quadrilateral in the 2dimensional payoff score space a damd strategy is defined based solely on defection after mutual defection and leads to linear relations between player scores using strategy parameter analysis the damd strategy is shown to result in an equal reciprocal or larger extortive score for its user compare to the other player independent of the strategy of the other player the extortive scores occur when the probabilities for the damd player to cooperate after conflicting plays cooperatedefect or defectcooperate sum to less than 1 the equal reciprocal scores occur when the probabilities for the damd player to cooperate after conflicting plays cooperatedefect or defectcooperate sum to 1 when one player selects the extortive damd the opposing player can force the equal punishment payoffs for both players in the infinitely iterated prisoners dilemma by also choosing the damd strategy possible pathways to mutual cooperation based on damd are discussed | [['the', 'prisoners', 'dilemma', 'game', 'has', 'a', 'long', 'history', 'stretching', 'across', 'the', 'social', 'biological', 'and', 'physical', 'sciences', 'in', '2012', 'press', 'and', 'dyson', 'developed', 'a', 'method', 'for', 'analyzing', 'the', 'mapping', 'of', 'the', '8dimensional', 'strategy', 'profile', 'onto', 'the', '2dimensional', 'payoff', 'space', 'in', 'an', 'infinitely', 'iterated', 'prisoners', 'dilemma', 'game', 'based', 'on', 'markov', 'chain', 'analysis', 'and', 'memoryone', 'strategies', 'we', 'generalize', 'this', 'approach', 'and', 'introduce', 'the', 'concept', 'of', 'strategy', 'parameter', 'to', 'show', 'that', 'linear', 'relations', 'among', 'player', 'payoffs', 'are', 'a', 'ubiquitous', 'feature', 'of', 'the', 'infinitely', 'iterated', 'prisoners', 'dilemma', 'game', 'our', 'extended', 'analysis', 'is', 'applied', 'to', 'various', 'strategy', 'profiles', 'including', 'titfortat', 'winstayloseshift', 'and', 'other', 'randomized', 'strategy', 'sets', 'strategy', 'profiles', 'are', 'identified', 'that', 'map', 'onto', 'the', 'vertices', 'edges', 'and', 'interior', 'of', 'the', 'prisoners', 'dilemma', 'quadrilateral', 'in', 'the', '2dimensional', 'payoff', 'score', 'space', 'a', 'damd', 'strategy', 'is', 'defined', 'based', 'solely', 'on', 'defection', 'after', 'mutual', 'defection', 'and', 'leads', 'to', 'linear', 'relations', 'between', 'player', 'scores', 'using', 'strategy', 'parameter', 'analysis', 'the', 'damd', 'strategy', 'is', 'shown', 'to', 'result', 'in', 'an', 'equal', 'reciprocal', 'or', 'larger', 'extortive', 'score', 'for', 'its', 'user', 'compare', 'to', 'the', 'other', 'player', 'independent', 'of', 'the', 'strategy', 'of', 'the', 'other', 'player', 'the', 'extortive', 'scores', 'occur', 'when', 'the', 'probabilities', 'for', 'the', 'damd', 'player', 'to', 'cooperate', 'after', 'conflicting', 'plays', 'cooperatedefect', 'or', 'defectcooperate', 'sum', 'to', 'less', 'than', '1', 'the', 'equal', 'reciprocal', 'scores', 'occur', 'when', 'the', 'probabilities', 'for', 'the', 'damd', 'player', 'to', 'cooperate', 'after', 'conflicting', 'plays', 'cooperatedefect', 'or', 'defectcooperate', 'sum', 'to', '1', 'when', 'one', 'player', 'selects', 'the', 'extortive', 'damd', 'the', 'opposing', 'player', 'can', 'force', 'the', 'equal', 'punishment', 'payoffs', 'for', 'both', 'players', 'in', 'the', 'infinitely', 'iterated', 'prisoners', 'dilemma', 'by', 'also', 'choosing', 'the', 'damd', 'strategy', 'possible', 'pathways', 'to', 'mutual', 'cooperation', 'based', 'on', 'damd', 'are', 'discussed']] | [-0.0770826314564505, 0.0678297858545248, -0.12512840452219473, 0.09390873456581947, -0.07054540495190656, -0.25469312633327773, 0.13326297577331195, 0.4221898744757654, -0.2650548218622465, -0.2609793893537823, 0.04633846333044031, -0.29504775045312603, -0.19802009070532, 0.05500540693350503, -0.11313540647935236, -0.02870013780480032, 0.048739464800085196, 0.04041566753894034, 0.07310761867649324, -0.32797791713727004, 0.3416622857224535, 0.025694543763882284, 0.26715637148608395, -0.01856224211091599, 0.11705505552482932, 0.07044893185516368, -0.03883992343661234, 0.046463099350644785, -0.14713156796229174, 0.04722653134905903, 0.28068623388235486, 0.17203346833475458, 0.42578903382474725, -0.3992356560651608, -0.13240729178174993, 0.15690063955403413, 0.11867596670741808, 0.06636024190017699, 0.028508082002658877, -0.29624276562720875, 0.02869110576681454, -0.18964077156234646, -0.07962422558281987, -0.017929891479346254, 0.013238060164660441, 0.008346591352054736, -0.32773055183254957, -0.004053772559101079, 0.03610976891694449, 0.06879198294094142, -0.04640301615467196, -0.16581994239911155, -0.06709238229351203, 0.18655291640640248, 0.05097475957749835, -0.020685520643989246, 0.1599450204733082, -0.13583047735984577, -0.2251799222025456, 0.3713959437727956, -0.032378291550974776, -0.20027295078651866, 0.14039568357067322, -0.09139968824456446, -0.08280999147102579, 0.08796617193641423, 0.11486925712476174, 0.1357754762963547, -0.09189990767321654, -0.0019836076517645834, -0.0659580331050551, 0.1484935103159814, 0.1087076005095503, 0.00019362657401484972, 0.16183259896669452, 0.15704630359665095, 0.1860563118755112, 0.06348334624018401, -0.010210747755605333, -0.23953752332057443, -0.2073733550972644, -0.11360211736852459, -0.1484101346224744, 0.013762074618363951, -0.12548072497977983, -0.10432098239250605, 0.3239801454593279, 0.10154149148498466, 0.124630444221001, 0.08444983726726743, 0.2650296538768364, 0.06866316766183556, 0.0453821772332021, 0.008623058296507224, 0.18756806291992578, 0.044480566042087354, 0.08545292021969517, -0.2279903217559243, 0.15418638645805363, 0.11587583626158338] |
1,803.01283 | Simple flat Leavitt path algebras are von Neumann regular | For a unital ring, it is an open question whether flatness of simple modules
implies all modules are flat and thus the ring is von Neumann regular. The
question was raised by Ramamurthi over 40 years ago who called such rings
SF-rings (i.e., simple modules are flat). In this note we show that a SF
Steinberg algebra of an ample Hausdorff groupoid, graded by an ordered group,
has an aperiodic unit space. For graph groupoids this implies that the graphs
are acyclic. Combining with the Abrams-Rangaswamy Theorem, it follows that SF
Leavitt path algebras are regular, answering Ramamurthi's question in positive
for the class of Leavitt path algebras.
| math.RA | for a unital ring it is an open question whether flatness of simple modules implies all modules are flat and thus the ring is von neumann regular the question was raised by ramamurthi over 40 years ago who called such rings sfrings ie simple modules are flat in this note we show that a sf steinberg algebra of an ample hausdorff groupoid graded by an ordered group has an aperiodic unit space for graph groupoids this implies that the graphs are acyclic combining with the abramsrangaswamy theorem it follows that sf leavitt path algebras are regular answering ramamurthis question in positive for the class of leavitt path algebras | [['for', 'a', 'unital', 'ring', 'it', 'is', 'an', 'open', 'question', 'whether', 'flatness', 'of', 'simple', 'modules', 'implies', 'all', 'modules', 'are', 'flat', 'and', 'thus', 'the', 'ring', 'is', 'von', 'neumann', 'regular', 'the', 'question', 'was', 'raised', 'by', 'ramamurthi', 'over', '40', 'years', 'ago', 'who', 'called', 'such', 'rings', 'sfrings', 'ie', 'simple', 'modules', 'are', 'flat', 'in', 'this', 'note', 'we', 'show', 'that', 'a', 'sf', 'steinberg', 'algebra', 'of', 'an', 'ample', 'hausdorff', 'groupoid', 'graded', 'by', 'an', 'ordered', 'group', 'has', 'an', 'aperiodic', 'unit', 'space', 'for', 'graph', 'groupoids', 'this', 'implies', 'that', 'the', 'graphs', 'are', 'acyclic', 'combining', 'with', 'the', 'abramsrangaswamy', 'theorem', 'it', 'follows', 'that', 'sf', 'leavitt', 'path', 'algebras', 'are', 'regular', 'answering', 'ramamurthis', 'question', 'in', 'positive', 'for', 'the', 'class', 'of', 'leavitt', 'path', 'algebras']] | [-0.17270962199948442, 0.10533698171862992, -0.05270145337383907, 0.0672988099574398, -0.13267899999986044, -0.17738571715241191, -0.06690044629459198, 0.4529723683528853, -0.4022716639850002, -0.17438086056678842, 0.11649340451493537, -0.2468198295055817, -0.13162117201584175, 0.22756307125270653, -0.22404769447502287, -0.06803792760743257, 0.09331388810936075, 0.09596888396817331, -0.0297560890567883, -0.3181433996665314, 0.441402774125051, 0.04045679405009231, 0.21358222420363185, 0.03393094695638865, 0.10453127617858207, 0.04541681419001319, -0.038957576030113086, 0.06584911693146121, -0.19461587501141017, 0.08400444143738311, 0.3170038445207935, 0.09514947976164806, 0.24892002584573886, -0.33671386787990254, -0.12151938539822228, 0.18550182585358227, 0.13129819167527154, -0.004381271224701777, -0.026829562745451067, -0.2349434986961289, 0.13696322369819078, -0.24307981311442114, -0.10556746209756686, -0.015290391713139027, 0.1939320714177134, -0.050965376782607145, -0.2132379044062243, 0.014958642557478296, 0.16060688439756632, 0.1564108271850273, -0.07565208021417046, -0.01630845416534262, -0.02613986348464655, 0.09234779089008673, -0.12868155169641027, 0.03862451766326558, 0.10126915523925653, -0.047884656850678414, -0.21569043970129526, 0.3044728052381498, 0.016143856062591604, -0.15021452150092676, 0.13602545243114805, -0.17393162170460877, -0.14070214692933056, 0.11367682854716595, -0.05198414476427178, 0.10705569689162076, -0.08131698163476987, 0.2148282269565523, -0.21383382637913412, 0.05187391654852455, 0.08919555425214079, 0.0016845081140323041, 0.19158506503089695, 0.15099865342759025, 0.11341422789812966, 0.11530491636054088, 0.09909956597794707, 0.01166910139279655, -0.27271092887251425, -0.2078295533025924, -0.11975527868288247, 0.15369647570948403, -0.08666664264329973, -0.1881034331700693, 0.3819749146932736, 0.08582600177032873, 0.1753775742657196, 0.15210325259249657, 0.18010081758704752, 0.06598407639942777, 0.1041036984422065, 0.13368224673188076, 0.10983747367460567, 0.259757614233352, -0.012323432213564117, -0.07638869556383444, -0.022715252512940563, 0.1801155193377501] |
1,803.01284 | Topological Hochschild Homology and Higher Characteristics | We show that an important classical fixed point invariant, the Reidemeister
trace, arises as a topological Hochschild homology transfer. This generalizes a
corresponding classical result for the Euler characteristic and is a first step
in showing the Reidemeister trace is in the image of the cyclotomic trace. The
main result follows from developing the relationship between shadows,
topological Hochschild homology, and Morita invariance in bicategorical
generality.
| math.AT math.CT | we show that an important classical fixed point invariant the reidemeister trace arises as a topological hochschild homology transfer this generalizes a corresponding classical result for the euler characteristic and is a first step in showing the reidemeister trace is in the image of the cyclotomic trace the main result follows from developing the relationship between shadows topological hochschild homology and morita invariance in bicategorical generality | [['we', 'show', 'that', 'an', 'important', 'classical', 'fixed', 'point', 'invariant', 'the', 'reidemeister', 'trace', 'arises', 'as', 'a', 'topological', 'hochschild', 'homology', 'transfer', 'this', 'generalizes', 'a', 'corresponding', 'classical', 'result', 'for', 'the', 'euler', 'characteristic', 'and', 'is', 'a', 'first', 'step', 'in', 'showing', 'the', 'reidemeister', 'trace', 'is', 'in', 'the', 'image', 'of', 'the', 'cyclotomic', 'trace', 'the', 'main', 'result', 'follows', 'from', 'developing', 'the', 'relationship', 'between', 'shadows', 'topological', 'hochschild', 'homology', 'and', 'morita', 'invariance', 'in', 'bicategorical', 'generality']] | [-0.20106769926408588, 0.0454037811531717, -0.15224201540519117, 0.1360197213256139, -0.07935424529679233, -0.12027481700660604, -0.048238936219025745, 0.29521546394310216, -0.4079678905069489, -0.23418968056582593, 0.0470597420265249, -0.19931106192807696, -0.22012216689163874, 0.14336965264131626, -0.18540162220597267, -0.0012166617494640927, 0.02969296389456951, 0.07762501102335977, -0.113824134138695, -0.18967794670342383, 0.43965435987620644, 0.0053950810917850695, 0.2312207008909547, 0.08683281488519048, 0.07313177411472707, -0.015862657935499694, -0.05722389536712206, -0.04770861912490518, -0.1231090658610893, 0.10579203345784635, 0.3172924124607534, 0.03449594648554921, 0.157631135679725, -0.3505900702580358, -0.11983681602798628, 0.10789343541854936, 0.1085578718674228, 0.07071381560385678, -0.05891880044135067, -0.2932694658749934, 0.11963167140316783, -0.18901731951557327, -0.10515782956358496, -0.0329838442531499, 0.04996214138174599, -0.010147258103119604, -0.19101097034713763, 0.013230426759092194, 0.1667187355571624, 0.1607148978351192, -0.09534083841241557, -0.03880883063274351, -0.05488593612487117, 0.1937568862569716, 0.05459308469223536, 0.07024329353236791, 0.14473441430141754, -0.15243345473286216, -0.16065188603842576, 0.3988571535005714, -0.08615780782631853, -0.151595497151103, 0.14586996772524083, -0.14967242437838155, -0.23636479477510985, 0.1305162144161648, -0.04465556376839452, 0.16373692030990214, 0.008568956615459738, 0.16412656333572653, -0.1130656159313565, 0.08456321350152421, 0.11343659919150399, -0.03822784396029557, 0.18095946057953619, 0.05106948441684698, 0.14055459359378525, 0.24884029301095076, -0.04307695503600619, -0.11968620172278448, -0.3490147702395916, -0.33492847929962655, -0.17733467986214568, 0.16949752088861936, -0.1270965560772421, -0.15342029823328962, 0.40155140680232737, 0.15708740044801467, 0.182477743788199, 0.1858350980152009, 0.2957998115400022, 0.09666141196485666, 0.09652709080414339, 0.018527075888193918, 0.13481178589052323, 0.23777962841488648, 0.07057284149623504, -0.15333946514521923, -0.004251077566578081, 0.3016235225156627] |
1,803.01285 | Maximizing Efficiency in Dynamic Matching Markets | We study the problem of matching agents who arrive at a marketplace over time
and leave after d time periods. Agents can only be matched while they are
present in the marketplace. Each pair of agents can yield a different match
value, and the planner's goal is to maximize the total value over a finite time
horizon. We study matching algorithms that perform well over any sequence of
arrivals when there is no a priori information about the match values or
arrival times.
Our main contribution is a 1/4-competitive algorithm. The algorithm randomly
selects a subset of agents who will wait until right before their departure to
get matched, and maintains a maximum-weight matching with respect to the other
agents. The primal-dual analysis of the algorithm hinges on a careful
comparison between the initial dual value associated with an agent when it
first arrives, and the final value after d time steps.
It is also shown that no algorithm is 1/2-competitive. We extend the model to
the case in which departure times are drawn i.i.d from a distribution with
non-decreasing hazard rate, and establish a 1/8-competitive algorithm in this
setting. Finally we show on real-world data that a modified version of our
algorithm performs well in practice.
| cs.DS cs.GT | we study the problem of matching agents who arrive at a marketplace over time and leave after d time periods agents can only be matched while they are present in the marketplace each pair of agents can yield a different match value and the planners goal is to maximize the total value over a finite time horizon we study matching algorithms that perform well over any sequence of arrivals when there is no a priori information about the match values or arrival times our main contribution is a 14competitive algorithm the algorithm randomly selects a subset of agents who will wait until right before their departure to get matched and maintains a maximumweight matching with respect to the other agents the primaldual analysis of the algorithm hinges on a careful comparison between the initial dual value associated with an agent when it first arrives and the final value after d time steps it is also shown that no algorithm is 12competitive we extend the model to the case in which departure times are drawn iid from a distribution with nondecreasing hazard rate and establish a 18competitive algorithm in this setting finally we show on realworld data that a modified version of our algorithm performs well in practice | [['we', 'study', 'the', 'problem', 'of', 'matching', 'agents', 'who', 'arrive', 'at', 'a', 'marketplace', 'over', 'time', 'and', 'leave', 'after', 'd', 'time', 'periods', 'agents', 'can', 'only', 'be', 'matched', 'while', 'they', 'are', 'present', 'in', 'the', 'marketplace', 'each', 'pair', 'of', 'agents', 'can', 'yield', 'a', 'different', 'match', 'value', 'and', 'the', 'planners', 'goal', 'is', 'to', 'maximize', 'the', 'total', 'value', 'over', 'a', 'finite', 'time', 'horizon', 'we', 'study', 'matching', 'algorithms', 'that', 'perform', 'well', 'over', 'any', 'sequence', 'of', 'arrivals', 'when', 'there', 'is', 'no', 'a', 'priori', 'information', 'about', 'the', 'match', 'values', 'or', 'arrival', 'times', 'our', 'main', 'contribution', 'is', 'a', '14competitive', 'algorithm', 'the', 'algorithm', 'randomly', 'selects', 'a', 'subset', 'of', 'agents', 'who', 'will', 'wait', 'until', 'right', 'before', 'their', 'departure', 'to', 'get', 'matched', 'and', 'maintains', 'a', 'maximumweight', 'matching', 'with', 'respect', 'to', 'the', 'other', 'agents', 'the', 'primaldual', 'analysis', 'of', 'the', 'algorithm', 'hinges', 'on', 'a', 'careful', 'comparison', 'between', 'the', 'initial', 'dual', 'value', 'associated', 'with', 'an', 'agent', 'when', 'it', 'first', 'arrives', 'and', 'the', 'final', 'value', 'after', 'd', 'time', 'steps', 'it', 'is', 'also', 'shown', 'that', 'no', 'algorithm', 'is', '12competitive', 'we', 'extend', 'the', 'model', 'to', 'the', 'case', 'in', 'which', 'departure', 'times', 'are', 'drawn', 'iid', 'from', 'a', 'distribution', 'with', 'nondecreasing', 'hazard', 'rate', 'and', 'establish', 'a', '18competitive', 'algorithm', 'in', 'this', 'setting', 'finally', 'we', 'show', 'on', 'realworld', 'data', 'that', 'a', 'modified', 'version', 'of', 'our', 'algorithm', 'performs', 'well', 'in', 'practice']] | [-0.10332240899335322, 0.054723590832314956, -0.12728567222060944, 0.03389865336306755, -0.07942591347275031, -0.14809911262336667, 0.10933952097209099, 0.4463794478893425, -0.2506979770813752, -0.3120332635225371, 0.12511831793925066, -0.29579774160641675, -0.10653139176231456, 0.1572600403185753, -0.09488121438907116, 0.013988051513841181, 0.10111340123581365, 0.11859858187042105, -0.027569822254432455, -0.3148964905718034, 0.261048386397871, 0.05897892093810352, 0.23988320847557296, -0.01934156774145379, 0.11699949475050479, 0.0341647492887823, -0.024921790352520685, 0.02217458664367283, -0.11229831719237976, 0.03613790331885345, 0.2453851075707347, 0.1692109972699681, 0.337156813905927, -0.3998984073975928, -0.1334586461137944, 0.166182477253227, 0.10122852276804975, 0.11595930819551108, -0.0019995396610946185, -0.25848171418618626, 0.12662225147512587, -0.14037686743653713, -0.0788304341134154, -0.007449861638501142, 0.005237662987621784, 0.02412108509791156, -0.3357033374576911, 0.020064932678835547, 0.018378800731740023, -0.01218103643877486, -0.06200990180040764, -0.10892338997224409, -0.0008876502482238614, 0.16751339628041306, 0.08155265745528277, 0.06851099178961306, 0.10984049221835307, -0.09623244926288217, -0.14725541067987824, 0.37563999103906665, -0.04478639557203775, -0.16355220727098074, 0.14918027398203618, -0.10456587546459824, -0.1142300863465457, 0.12738874794472263, 0.18595127328705874, 0.14910372567150598, -0.12584790934368323, 0.046295995110571295, -0.08543705001690434, 0.18315843951400115, 0.07074782223151364, -0.016212676806619516, 0.17040410605304449, 0.16655497706169714, 0.17100211910143928, 0.10157476580736806, -0.007470741305439236, -0.12482066706808519, -0.3058665571824729, -0.12824501898546603, -0.20335092447874434, 0.025812036847852247, -0.1115071349841564, -0.11691377092267553, 0.3590394544044455, 0.1677638551930092, 0.23808077657459648, 0.14042850670312051, 0.30574974230065655, 0.11133954995984292, 0.022233855007532805, 0.15485231660179866, 0.16795230807976128, 0.029677465867456863, 0.10640820542642015, -0.17638335521988463, 0.13990546118251038, 0.04473596821579793] |
1,803.01286 | Analysis of genetic diversity and genome relationships of four eggplant
species (Solanum melongena L) using RAPD markers | Solanum melongena (eggplant) is one of the diversity of the Solanum family
which is grown and widely spread in Indonesia and widely used by the community.
This research explored the genetic diversity of four local Indonesian eggplant
species namely leuca, tekokak, gelatik and kopek by using RAPD (Random
Amplified Polymorphic DNA). The samples were obtained from Agricultural
Technology Assessment Institute (BPTP) Bogor, Indonesia. The result of data
observation was in the form of Solanum melongena plants DNA profile analyzed
descriptively and quantitatively. 30 DNA bands (28 polymorphic and 2
monomorphic) were successfully scored by using four primers (OPF01, OPF02,
OPF03 and OPF04). The Primers were used able to amplify all of the four
eggplant samples. The result of PCR-RAPD visualization produces bands of
300-1500 bp. The result of cluster analysis showed the existence of three
clusters (A, B, and C). Cluster A (coefficient of equal to 49%) consisted of a
gelatik, cluster B (coefficient of 65% equilibrium) consisted of TPU (Kopek)
and TK (Tekokak), and cluster C (55% equilibrium coefficient) consisted of LC
(Leunca). These results indicated that the closest proximity is found in
samples of TK (Tekokak) and TPU (Kopek)
| q-bio.PE | solanum melongena eggplant is one of the diversity of the solanum family which is grown and widely spread in indonesia and widely used by the community this research explored the genetic diversity of four local indonesian eggplant species namely leuca tekokak gelatik and kopek by using rapd random amplified polymorphic dna the samples were obtained from agricultural technology assessment institute bptp bogor indonesia the result of data observation was in the form of solanum melongena plants dna profile analyzed descriptively and quantitatively 30 dna bands 28 polymorphic and 2 monomorphic were successfully scored by using four primers opf01 opf02 opf03 and opf04 the primers were used able to amplify all of the four eggplant samples the result of pcrrapd visualization produces bands of 3001500 bp the result of cluster analysis showed the existence of three clusters a b and c cluster a coefficient of equal to 49 consisted of a gelatik cluster b coefficient of 65 equilibrium consisted of tpu kopek and tk tekokak and cluster c 55 equilibrium coefficient consisted of lc leunca these results indicated that the closest proximity is found in samples of tk tekokak and tpu kopek | [['solanum', 'melongena', 'eggplant', 'is', 'one', 'of', 'the', 'diversity', 'of', 'the', 'solanum', 'family', 'which', 'is', 'grown', 'and', 'widely', 'spread', 'in', 'indonesia', 'and', 'widely', 'used', 'by', 'the', 'community', 'this', 'research', 'explored', 'the', 'genetic', 'diversity', 'of', 'four', 'local', 'indonesian', 'eggplant', 'species', 'namely', 'leuca', 'tekokak', 'gelatik', 'and', 'kopek', 'by', 'using', 'rapd', 'random', 'amplified', 'polymorphic', 'dna', 'the', 'samples', 'were', 'obtained', 'from', 'agricultural', 'technology', 'assessment', 'institute', 'bptp', 'bogor', 'indonesia', 'the', 'result', 'of', 'data', 'observation', 'was', 'in', 'the', 'form', 'of', 'solanum', 'melongena', 'plants', 'dna', 'profile', 'analyzed', 'descriptively', 'and', 'quantitatively', '30', 'dna', 'bands', '28', 'polymorphic', 'and', '2', 'monomorphic', 'were', 'successfully', 'scored', 'by', 'using', 'four', 'primers', 'opf01', 'opf02', 'opf03', 'and', 'opf04', 'the', 'primers', 'were', 'used', 'able', 'to', 'amplify', 'all', 'of', 'the', 'four', 'eggplant', 'samples', 'the', 'result', 'of', 'pcrrapd', 'visualization', 'produces', 'bands', 'of', '3001500', 'bp', 'the', 'result', 'of', 'cluster', 'analysis', 'showed', 'the', 'existence', 'of', 'three', 'clusters', 'a', 'b', 'and', 'c', 'cluster', 'a', 'coefficient', 'of', 'equal', 'to', '49', 'consisted', 'of', 'a', 'gelatik', 'cluster', 'b', 'coefficient', 'of', '65', 'equilibrium', 'consisted', 'of', 'tpu', 'kopek', 'and', 'tk', 'tekokak', 'and', 'cluster', 'c', '55', 'equilibrium', 'coefficient', 'consisted', 'of', 'lc', 'leunca', 'these', 'results', 'indicated', 'that', 'the', 'closest', 'proximity', 'is', 'found', 'in', 'samples', 'of', 'tk', 'tekokak', 'and', 'tpu', 'kopek']] | [-0.06579852715825264, 0.10376121601439081, -0.05092964371341919, 0.017467554777682748, 0.010263375085098355, -0.1342858769996301, 0.06442740514058243, 0.3287983191764673, -0.20697022568999549, -0.3331750510721546, 0.08041313992554239, -0.2900005081783603, -0.1240251532996471, 0.18425000630570262, -0.014224870821063438, 0.01490854245925772, 0.04210112581429794, 0.01234815355908293, 0.03514861924707199, -0.28446651666472256, 0.23244496465731265, 0.04715774692935095, 0.31534009912375655, -0.006012148184576229, 0.08784395277178375, -0.02035269290051852, -0.06002253147490909, 0.022584035082228397, -0.12387427306503321, 0.11257667356240039, 0.2564232356432993, 0.14220418008907668, 0.26360889889163835, -0.34940300235168986, -0.16503681830036337, 0.04345407449179905, 0.12127198038159692, 0.04640312813251185, -0.019437195648167156, -0.2560333822738756, 0.11680361804561533, -0.1445115751225836, -0.09827464140606311, 0.012576225714684789, 0.024213768643839808, 0.06364938957365544, -0.21865596255978173, 0.09242396428657884, 0.02101506353839918, 0.13841753118943548, -0.05258182560188861, -0.19358881289830035, -0.06422592402603268, 0.13137561047522958, 0.00013490250658536895, 0.044302661136692664, 0.17314164158678874, -0.06077966844830453, -0.09894830398418511, 0.3530067210043179, -0.05824724320071132, -0.04868033020417049, 0.20327808085326735, -0.12234215720378783, -0.12839996271499882, 0.14408541734989608, 0.12842306675745196, 0.1014674134065889, -0.19057547741600972, 0.03141136266476883, -0.008674309596816978, 0.18045992107036407, 0.13604567307727725, -0.05256716007356312, 0.15278742480447538, 0.13861974541133565, -0.022130852604410455, 0.15616941293884654, -0.15257725265044508, -0.0668081997065109, -0.16669917976800247, -0.15197535565160894, -0.13356858360505233, 0.02687030900766801, -0.06884858605214474, -0.15024501180310285, 0.38730595529660206, 0.050419070823654384, 0.14761470917241484, -0.009797149580469082, 0.17622286245341967, -0.01771452314262226, 0.10261584326933568, 0.0458235947357679, 0.19208059787064832, 0.12557653051649292, 0.09951122239391644, -0.1861014821516936, 0.11028576854700117, 0.010625009634270427] |
1,803.01287 | Cosmological correlation functions including a massive scalar field and
an arbitrary number of soft-gravitons | We study the imprint of a massive scalar particle on cosmological correlation
functions, and suggest the way to determine the mass of the newly introduced
particle, which is expected to be around 10^14 GeV. After reviewing the basic
theory by Maldacena and the effective field theory (EFT) of inflation by Cheung
et al., we apply these two theories to construct new couplings of a massive
scalar field with primordial fluctuations including an arbitrary number of
gravitons. We compute some correlation functions including these couplings in
the soft-graviton limit. We show that when the number of soft-gravitons is
getting larger, the peak of the correlation function is shifted to larger mass
of the scalar particle. In addition we derive a relation, which relates
correlation functions with N+1 to N soft-gravitons when the mass of the scalar
particle becomes much higher than 10^14 GeV, and confirm the relation by
numerical analysis.
| hep-th gr-qc | we study the imprint of a massive scalar particle on cosmological correlation functions and suggest the way to determine the mass of the newly introduced particle which is expected to be around 1014 gev after reviewing the basic theory by maldacena and the effective field theory eft of inflation by cheung et al we apply these two theories to construct new couplings of a massive scalar field with primordial fluctuations including an arbitrary number of gravitons we compute some correlation functions including these couplings in the softgraviton limit we show that when the number of softgravitons is getting larger the peak of the correlation function is shifted to larger mass of the scalar particle in addition we derive a relation which relates correlation functions with n1 to n softgravitons when the mass of the scalar particle becomes much higher than 1014 gev and confirm the relation by numerical analysis | [['we', 'study', 'the', 'imprint', 'of', 'a', 'massive', 'scalar', 'particle', 'on', 'cosmological', 'correlation', 'functions', 'and', 'suggest', 'the', 'way', 'to', 'determine', 'the', 'mass', 'of', 'the', 'newly', 'introduced', 'particle', 'which', 'is', 'expected', 'to', 'be', 'around', '1014', 'gev', 'after', 'reviewing', 'the', 'basic', 'theory', 'by', 'maldacena', 'and', 'the', 'effective', 'field', 'theory', 'eft', 'of', 'inflation', 'by', 'cheung', 'et', 'al', 'we', 'apply', 'these', 'two', 'theories', 'to', 'construct', 'new', 'couplings', 'of', 'a', 'massive', 'scalar', 'field', 'with', 'primordial', 'fluctuations', 'including', 'an', 'arbitrary', 'number', 'of', 'gravitons', 'we', 'compute', 'some', 'correlation', 'functions', 'including', 'these', 'couplings', 'in', 'the', 'softgraviton', 'limit', 'we', 'show', 'that', 'when', 'the', 'number', 'of', 'softgravitons', 'is', 'getting', 'larger', 'the', 'peak', 'of', 'the', 'correlation', 'function', 'is', 'shifted', 'to', 'larger', 'mass', 'of', 'the', 'scalar', 'particle', 'in', 'addition', 'we', 'derive', 'a', 'relation', 'which', 'relates', 'correlation', 'functions', 'with', 'n1', 'to', 'n', 'softgravitons', 'when', 'the', 'mass', 'of', 'the', 'scalar', 'particle', 'becomes', 'much', 'higher', 'than', '1014', 'gev', 'and', 'confirm', 'the', 'relation', 'by', 'numerical', 'analysis']] | [-0.10404431822449983, 0.20581742645715298, -0.07434496780870115, 0.13165176534299822, -0.04731654060282269, -0.09316844181442747, -0.02319982419658427, 0.2805226025089216, -0.1686102856967446, -0.36255126167880686, 0.041359111475029665, -0.2905551932410014, -0.13994835267400965, 0.1670664493960715, 0.027277629901686695, 0.017447820414795357, -0.015901047954982032, 0.05368651829811991, -0.08856524646893575, -0.2525454082725836, 0.36613373768192775, 0.08156877870158273, 0.20655445898978078, 0.07433478921718363, 0.0759607088549354, 0.024901347443917577, -0.047899160835081014, -0.0028556729128368856, -0.15038230256709076, 0.09569968589815964, 0.1234475489370018, 0.10573967241168934, 0.2278307836604159, -0.3798429675172178, -0.19166224190195527, 0.12336467599280837, 0.16596502075161862, 0.10719004972282714, -0.036517981836591294, -0.2541153356686336, 0.1106299299879006, -0.19420339338810874, -0.15285399759213636, -0.05186287303562878, 0.028426431618364795, -0.012292825181328623, -0.3008469380826379, 0.10980817880604232, -0.02842936355012412, 0.015772854522833613, -0.038574950142326404, -0.10844243211405617, -0.03130894405197124, 0.032299525749499014, 0.11473772633776423, 0.06608176988955004, 0.1505640620258035, -0.15945153182125366, -0.07500706260966859, 0.3545864175080138, -0.10716798634089761, -0.16678380360510073, 0.1600351894249012, -0.190084705636108, -0.14501796847804874, 0.08493031785652345, 0.14449248466201975, 0.12291202946648407, -0.1338444384471054, 0.11904670689516339, -0.026425065425205594, 0.16271349135152743, 0.077384221487913, 0.04786028522922068, 0.2519044524508522, 0.09443700116849979, 0.04348335835170381, 0.13396776435804889, -0.06780705098252819, -0.10356996257727662, -0.3106407450106578, -0.1546754565210316, -0.1466234644627845, 0.06603668127003043, -0.145888225729502, -0.13679878624967065, 0.3932816341620724, 0.1753546447480465, 0.2267934612099867, 0.1009536833949007, 0.23651378380837945, 0.17398809883616814, 0.08840088695160994, 0.0739454521186219, 0.2934986157257658, 0.19259973799455024, 0.06927714830416502, -0.21565648403373502, -0.07166406741923317, 0.07692036328229065] |
1,803.01288 | The Cosmic-Ray Energy Spectrum between 2 PeV and 2 EeV Observed with the
TALE detector in monocular mode | We report on a measurement of the cosmic ray energy spectrum by the Telescope
Array Low-Energy Extension (TALE) air fluorescence detector. The TALE air
fluorescence detector is also sensitive to the Cherenkov light produced by
shower particles. Low energy cosmic rays, in the PeV energy range, are
detectable by TALE as "Cherenkov Events". Using these events, we measure the
energy spectrum from a low energy of $\sim 2$ PeV to an energy greater than 100
PeV. Above 100 PeV TALE can detect cosmic rays using air fluorescence. This
allows for the extension of the measurement to energies greater than a few EeV.
In this paper, we will describe the detector, explain the technique, and
present results from a measurement of the spectrum using $\sim 1000$ hours of
observation. The observed spectrum shows a clear steepening near $10^{17.1}$
eV, along with an ankle-like structure at $10^{16.2}$ eV. These features
present important constraints on galactic cosmic rays origin and propagation
models. The feature at $10^{17.1}$ eV may also mark the end of the galactic
cosmic rays flux and the start of the transition to extra-galactic sources.
| astro-ph.HE astro-ph.IM | we report on a measurement of the cosmic ray energy spectrum by the telescope array lowenergy extension tale air fluorescence detector the tale air fluorescence detector is also sensitive to the cherenkov light produced by shower particles low energy cosmic rays in the pev energy range are detectable by tale as cherenkov events using these events we measure the energy spectrum from a low energy of sim 2 pev to an energy greater than 100 pev above 100 pev tale can detect cosmic rays using air fluorescence this allows for the extension of the measurement to energies greater than a few eev in this paper we will describe the detector explain the technique and present results from a measurement of the spectrum using sim 1000 hours of observation the observed spectrum shows a clear steepening near 10171 ev along with an anklelike structure at 10162 ev these features present important constraints on galactic cosmic rays origin and propagation models the feature at 10171 ev may also mark the end of the galactic cosmic rays flux and the start of the transition to extragalactic sources | [['we', 'report', 'on', 'a', 'measurement', 'of', 'the', 'cosmic', 'ray', 'energy', 'spectrum', 'by', 'the', 'telescope', 'array', 'lowenergy', 'extension', 'tale', 'air', 'fluorescence', 'detector', 'the', 'tale', 'air', 'fluorescence', 'detector', 'is', 'also', 'sensitive', 'to', 'the', 'cherenkov', 'light', 'produced', 'by', 'shower', 'particles', 'low', 'energy', 'cosmic', 'rays', 'in', 'the', 'pev', 'energy', 'range', 'are', 'detectable', 'by', 'tale', 'as', 'cherenkov', 'events', 'using', 'these', 'events', 'we', 'measure', 'the', 'energy', 'spectrum', 'from', 'a', 'low', 'energy', 'of', 'sim', '2', 'pev', 'to', 'an', 'energy', 'greater', 'than', '100', 'pev', 'above', '100', 'pev', 'tale', 'can', 'detect', 'cosmic', 'rays', 'using', 'air', 'fluorescence', 'this', 'allows', 'for', 'the', 'extension', 'of', 'the', 'measurement', 'to', 'energies', 'greater', 'than', 'a', 'few', 'eev', 'in', 'this', 'paper', 'we', 'will', 'describe', 'the', 'detector', 'explain', 'the', 'technique', 'and', 'present', 'results', 'from', 'a', 'measurement', 'of', 'the', 'spectrum', 'using', 'sim', '1000', 'hours', 'of', 'observation', 'the', 'observed', 'spectrum', 'shows', 'a', 'clear', 'steepening', 'near', '10171', 'ev', 'along', 'with', 'an', 'anklelike', 'structure', 'at', '10162', 'ev', 'these', 'features', 'present', 'important', 'constraints', 'on', 'galactic', 'cosmic', 'rays', 'origin', 'and', 'propagation', 'models', 'the', 'feature', 'at', '10171', 'ev', 'may', 'also', 'mark', 'the', 'end', 'of', 'the', 'galactic', 'cosmic', 'rays', 'flux', 'and', 'the', 'start', 'of', 'the', 'transition', 'to', 'extragalactic', 'sources']] | [-0.057508529499381955, 0.23477680606494844, -0.0321821983974508, 0.1489312535160697, -0.03890129206347805, -0.013668281172969095, 0.004166104139269168, 0.405567679270778, -0.22841987017217552, -0.4191654716496882, 0.008670176155409654, -0.39475298103626183, -0.006306856377151511, 0.21354450288092028, 0.040115336017745154, -0.04233563946479041, 0.09881463682145493, -0.022508533081829384, -0.004162449278342335, -0.10995082874939291, 0.2348096838300673, 0.2823033375898376, 0.23854914566491853, 0.12953940231818706, 0.138489609326074, -0.05681216240222768, -0.03162244473249935, -0.07216548411499547, -0.12083775779920751, 0.0865941076101634, 0.2477813620425284, 0.12178324851012566, 0.1481977228249889, -0.3909078259274121, -0.2384234989952782, 0.14936541614714888, 0.14114524636913658, 0.00027221638099391663, -0.05836693979622594, -0.30901182500605023, 0.08663571990378525, -0.15125222471238964, -0.1783807757259954, 0.07549821630464462, -0.09360463727194734, 0.0016808229651676652, -0.16487450068266102, 0.07127651728217682, -0.01601200226191988, 0.04970428460080217, -0.07805346255032497, -0.10150613528220793, 0.04468249114538396, 0.017392510004118896, 0.09093739876508429, 0.02900633507701771, 0.18198688622088294, -0.08727263117274876, -0.101860680607269, 0.37076672193918214, -0.08741884715377439, -0.005861777412381185, 0.16229082690804955, -0.1966840169073333, -0.12696503055960182, 0.26755541065485094, 0.1840531948407221, 0.07678482678222834, -0.18395270114421652, 0.03645541103564345, 0.036820553319083286, 0.21648261867180144, 0.09039469793661618, 0.012024861471929951, 0.2798068808573905, 0.18234095535160083, 0.13217313786330837, 0.06413933031549475, -0.23117917050789719, 0.07084153163368287, -0.3085121419331383, -0.11591696046936863, -0.16615667562860914, 0.1409432314982911, -0.06869770561412303, -0.09106977834871151, 0.43972290586680174, 0.14302537849985325, 0.19726632905455874, 0.01669798825320828, 0.29379372874720266, 0.04343045008831921, 0.03390503486140085, 0.06623254404858807, 0.3178181163258041, 0.07025931158695249, 0.15834910330949756, -0.15306757428966786, 0.0031021859258939717, -0.02201850669276293] |
1,803.01289 | The Lie groupoid analogue of a symplectic Lie group | A symplectic Lie group is a Lie group with a left-invariant symplectic form.
Its Lie algebra structure is that of a quasi-Frobenius Lie algebra. In this
note, we identify the groupoid analogue of a symplectic Lie group. We call the
aforementioned structure a \textit{$t$-symplectic Lie groupoid}; the "$t$" is
motivated by the fact that each target fiber of a $t$-symplectic Lie groupoid
is a symplectic manifold. For a Lie groupoid $\mathcal{G}\rightrightarrows M$,
we show that there is a one-to-one correspondence between quasi-Frobenius Lie
algebroid structures on $A\mathcal{G}$ (the associated Lie algebroid) and
$t$-symplectic Lie groupoid structures on $\mathcal{G}\rightrightarrows M$. In
addition, we also introduce the notion of a \textit{symplectic Lie group
bundle} (SLGB) which is a special case of both a $t$-symplectic Lie groupoid
and a Lie group bundle. The basic properties of SLGBs are explored.
| math.DG | a symplectic lie group is a lie group with a leftinvariant symplectic form its lie algebra structure is that of a quasifrobenius lie algebra in this note we identify the groupoid analogue of a symplectic lie group we call the aforementioned structure a textittsymplectic lie groupoid the t is motivated by the fact that each target fiber of a tsymplectic lie groupoid is a symplectic manifold for a lie groupoid mathcalgrightrightarrows m we show that there is a onetoone correspondence between quasifrobenius lie algebroid structures on amathcalg the associated lie algebroid and tsymplectic lie groupoid structures on mathcalgrightrightarrows m in addition we also introduce the notion of a textitsymplectic lie group bundle slgb which is a special case of both a tsymplectic lie groupoid and a lie group bundle the basic properties of slgbs are explored | [['a', 'symplectic', 'lie', 'group', 'is', 'a', 'lie', 'group', 'with', 'a', 'leftinvariant', 'symplectic', 'form', 'its', 'lie', 'algebra', 'structure', 'is', 'that', 'of', 'a', 'quasifrobenius', 'lie', 'algebra', 'in', 'this', 'note', 'we', 'identify', 'the', 'groupoid', 'analogue', 'of', 'a', 'symplectic', 'lie', 'group', 'we', 'call', 'the', 'aforementioned', 'structure', 'a', 'textittsymplectic', 'lie', 'groupoid', 'the', 't', 'is', 'motivated', 'by', 'the', 'fact', 'that', 'each', 'target', 'fiber', 'of', 'a', 'tsymplectic', 'lie', 'groupoid', 'is', 'a', 'symplectic', 'manifold', 'for', 'a', 'lie', 'groupoid', 'mathcalgrightrightarrows', 'm', 'we', 'show', 'that', 'there', 'is', 'a', 'onetoone', 'correspondence', 'between', 'quasifrobenius', 'lie', 'algebroid', 'structures', 'on', 'amathcalg', 'the', 'associated', 'lie', 'algebroid', 'and', 'tsymplectic', 'lie', 'groupoid', 'structures', 'on', 'mathcalgrightrightarrows', 'm', 'in', 'addition', 'we', 'also', 'introduce', 'the', 'notion', 'of', 'a', 'textitsymplectic', 'lie', 'group', 'bundle', 'slgb', 'which', 'is', 'a', 'special', 'case', 'of', 'both', 'a', 'tsymplectic', 'lie', 'groupoid', 'and', 'a', 'lie', 'group', 'bundle', 'the', 'basic', 'properties', 'of', 'slgbs', 'are', 'explored']] | [-0.29195990055942767, 0.014999168659918584, -0.10674778165009159, 0.07462014093224963, -0.2683274766072058, -0.09550054573740524, 0.0030688689699253213, 0.4673686844511674, -0.34656454694385713, -0.17913671850871582, 0.10539797192188696, -0.1758341850157684, -0.2163852912732042, 0.17064546597405122, -0.17274391384652027, -0.14850798118187902, 0.08241423660208685, 0.21496838057736078, -0.18440256245756664, -0.15354188307045172, 0.49742880947171497, 0.0034307804961617176, 0.21732634330490747, -0.05407865217835374, 0.1815479676060092, -0.054922381670285875, 0.04368385368098433, -0.022634027544588136, -0.09651506515841063, 0.11126834344691955, 0.33087000687821555, -0.017752894350829034, 0.21392139926767692, -0.2974543718764415, -0.10440030161900303, 0.15370675965140645, 0.10031276943806845, -0.061773133238714834, -0.0688992081872689, -0.3221174090652941, 0.08487152918241918, -0.22377528952291378, -0.11728950711504485, -0.02140502782466893, 0.07649534389090079, -0.05952544832745424, -0.1243917185213202, -0.014092229308712727, 0.10247424994237148, 0.13600961673431672, -0.07233103774935723, -0.02086510660771567, -0.12360541510861367, 0.03951434005911534, -0.13692116002695492, 0.05480699263011607, 0.20721031500814627, -0.0037858124016425933, -0.13214922139707666, 0.46412282721497694, -0.024498792329373267, -0.2640672504901886, 0.0922276983037591, -0.19332509393302294, -0.2602932133765605, 0.10966069833106863, 0.04455545110126528, 0.14965362382622865, -0.034919063962745266, 0.2264069813151414, -0.19407888918828506, -0.02594671078169575, 0.03046124537045566, -0.046461829260134924, 0.12046788059748136, 0.20799212280175058, 0.08529066612514166, 0.023393607705544966, 0.062251946241863504, 0.002567554315408835, -0.39246307582809375, -0.2572558336927054, -0.04698964532894584, 0.16468541368555564, -0.08567412172851618, -0.13519863322950326, 0.40452701126117835, 0.07889305709216457, 0.23905579887258893, 0.1485842901864089, 0.1509042876253191, 0.06355660196680289, 0.13535830808373597, 0.08601828125806955, 0.12933365089388993, 0.3394619208205348, -0.09177054026379035, -0.111899259672142, -0.1640141409356147, 0.2071437268732832] |
1,803.0129 | Second homotopy and invariant geometry of flag manifolds | We use the Hopf fibration to explicitly compute generators of the second
homotopy group of the flag manifolds of a compact Lie group. We show that these
$2$-spheres have nice geometrical properties such as being totally geodesic
surfaces with respect to any invariant metric on the flag manifold. We
characterize when the generators with the same invariant geometry are in the
same homotopy class. This is done by exploring the action of Weyl group on the
irreducible components of isotropy representation of the flag manifold.
| math.DG math.AT math.RT | we use the hopf fibration to explicitly compute generators of the second homotopy group of the flag manifolds of a compact lie group we show that these 2spheres have nice geometrical properties such as being totally geodesic surfaces with respect to any invariant metric on the flag manifold we characterize when the generators with the same invariant geometry are in the same homotopy class this is done by exploring the action of weyl group on the irreducible components of isotropy representation of the flag manifold | [['we', 'use', 'the', 'hopf', 'fibration', 'to', 'explicitly', 'compute', 'generators', 'of', 'the', 'second', 'homotopy', 'group', 'of', 'the', 'flag', 'manifolds', 'of', 'a', 'compact', 'lie', 'group', 'we', 'show', 'that', 'these', '2spheres', 'have', 'nice', 'geometrical', 'properties', 'such', 'as', 'being', 'totally', 'geodesic', 'surfaces', 'with', 'respect', 'to', 'any', 'invariant', 'metric', 'on', 'the', 'flag', 'manifold', 'we', 'characterize', 'when', 'the', 'generators', 'with', 'the', 'same', 'invariant', 'geometry', 'are', 'in', 'the', 'same', 'homotopy', 'class', 'this', 'is', 'done', 'by', 'exploring', 'the', 'action', 'of', 'weyl', 'group', 'on', 'the', 'irreducible', 'components', 'of', 'isotropy', 'representation', 'of', 'the', 'flag', 'manifold']] | [-0.20225726137047303, 0.0640212191898814, -0.1067430917173624, 0.0567703483187977, -0.16152023591977707, -0.08999935087802656, -0.06649493886267438, 0.3881112678853028, -0.31046107274425383, -0.217255907722831, 0.11245201732552446, -0.24390258832889444, -0.16935989303404794, 0.15676561746308032, -0.1594633574378403, -0.020802768478717874, 0.06848916888565701, 0.15992262790746548, -0.15363154257647693, -0.2641313192379825, 0.5028470893335693, -0.016943201965049785, 0.2545760700846372, -0.006837702904115705, 0.17944405673838715, -0.029647763521300958, -0.008104687776443933, 0.025308836826725918, -0.1406277279565556, 0.137842603234629, 0.2544380679178764, 0.036356247024720206, 0.11447641987572699, -0.35187205976861363, -0.16793420608566306, 0.19067436570630353, 0.09965413199080264, 0.03186457203153302, -0.010885857311351334, -0.3385836382780005, 0.12105443130302078, -0.1500747167669675, -0.16161745918695541, -0.11032759978928987, 0.012659874394097749, 0.0019185013356892502, -0.1347901924239362, -0.061064100890036895, 0.07796373504268772, 0.13673738377059208, -0.05971786316538997, -0.04626852713306161, -0.10578599854317658, 0.1465387456766193, 0.028660377453300443, 0.018722378374899134, 0.13202057936612296, -0.0450030801434289, -0.13147566686726778, 0.4283650523161187, -0.05978720060494893, -0.3096952311749406, 0.12298600949374411, -0.19189231149742708, -0.20586755988462008, 0.13414825716548984, 0.12319967915468356, 0.16532562573933426, -0.04701715045803747, 0.18987038187025224, -0.08050425148514263, 0.01742346559185535, 0.05637979272424298, -0.013753594726543215, 0.1292010025723892, 0.08842167785555563, 0.10840377943403677, 0.11647618062903776, 0.004798087702297112, -0.05211354640915113, -0.3676830113481949, -0.2390785760629703, -0.1459739619920797, 0.16550797801464795, -0.15225220415741206, -0.18216311059453907, 0.42713008663233587, 0.028792510137838477, 0.20008942132596583, 0.12212151394718711, 0.22253329225761048, 0.0218484458157464, 0.09991967241991968, 0.08363547884475658, 0.18233670129933777, 0.21098651192698847, -0.08887467046870905, -0.14902061214978696, -0.052004321519395005, 0.19858310999458326] |
1,803.01291 | Computational Results for the Higgs Boson Equation in the de Sitter
Spacetime | High performance computations are presented for the Higgs Boson Equation in
the de Sitter Space- time using explicit fourth order Runge-Kutta scheme on the
temporal discretization and fourth order finite difference discretization in
space. In addition to the fully three space dimensional equation its one space
dimensional radial solutions are also examined. The numerical code for the
three space di- mensional equation has been programmed in CUDA Fortran and was
performed on NVIDIA Tesla K40c GPU Accelerator. The radial form of the equation
was simulated in MATLAB. The numerical results demonstrate the existing
theoretical result that under certain conditions bubbles form in the scalar
field. We also demonstrate the known blow-up phenomena for the solutions of the
semilinear Klein-Gordon equation with imaginary mass. Our numerical studies
suggest several previously not known properties of the solution for which
theoretical proofs do not exist yet: 1. smooth solution exists for all time if
the initial conditions are compactly supported and smooth; 2. under some
conditions no bubbles form; 3. solutions converge to step functions related to
unforced, damped Duffing equations.
| math.AP physics.comp-ph | high performance computations are presented for the higgs boson equation in the de sitter space time using explicit fourth order rungekutta scheme on the temporal discretization and fourth order finite difference discretization in space in addition to the fully three space dimensional equation its one space dimensional radial solutions are also examined the numerical code for the three space di mensional equation has been programmed in cuda fortran and was performed on nvidia tesla k40c gpu accelerator the radial form of the equation was simulated in matlab the numerical results demonstrate the existing theoretical result that under certain conditions bubbles form in the scalar field we also demonstrate the known blowup phenomena for the solutions of the semilinear kleingordon equation with imaginary mass our numerical studies suggest several previously not known properties of the solution for which theoretical proofs do not exist yet 1 smooth solution exists for all time if the initial conditions are compactly supported and smooth 2 under some conditions no bubbles form 3 solutions converge to step functions related to unforced damped duffing equations | [['high', 'performance', 'computations', 'are', 'presented', 'for', 'the', 'higgs', 'boson', 'equation', 'in', 'the', 'de', 'sitter', 'space', 'time', 'using', 'explicit', 'fourth', 'order', 'rungekutta', 'scheme', 'on', 'the', 'temporal', 'discretization', 'and', 'fourth', 'order', 'finite', 'difference', 'discretization', 'in', 'space', 'in', 'addition', 'to', 'the', 'fully', 'three', 'space', 'dimensional', 'equation', 'its', 'one', 'space', 'dimensional', 'radial', 'solutions', 'are', 'also', 'examined', 'the', 'numerical', 'code', 'for', 'the', 'three', 'space', 'di', 'mensional', 'equation', 'has', 'been', 'programmed', 'in', 'cuda', 'fortran', 'and', 'was', 'performed', 'on', 'nvidia', 'tesla', 'k40c', 'gpu', 'accelerator', 'the', 'radial', 'form', 'of', 'the', 'equation', 'was', 'simulated', 'in', 'matlab', 'the', 'numerical', 'results', 'demonstrate', 'the', 'existing', 'theoretical', 'result', 'that', 'under', 'certain', 'conditions', 'bubbles', 'form', 'in', 'the', 'scalar', 'field', 'we', 'also', 'demonstrate', 'the', 'known', 'blowup', 'phenomena', 'for', 'the', 'solutions', 'of', 'the', 'semilinear', 'kleingordon', 'equation', 'with', 'imaginary', 'mass', 'our', 'numerical', 'studies', 'suggest', 'several', 'previously', 'not', 'known', 'properties', 'of', 'the', 'solution', 'for', 'which', 'theoretical', 'proofs', 'do', 'not', 'exist', 'yet', '1', 'smooth', 'solution', 'exists', 'for', 'all', 'time', 'if', 'the', 'initial', 'conditions', 'are', 'compactly', 'supported', 'and', 'smooth', '2', 'under', 'some', 'conditions', 'no', 'bubbles', 'form', '3', 'solutions', 'converge', 'to', 'step', 'functions', 'related', 'to', 'unforced', 'damped', 'duffing', 'equations']] | [-0.13614454036781282, 0.05944994896430564, -0.08212009388456393, 0.06869646334586393, -0.09515165884879659, -0.145708431152292, -0.04888328100198859, 0.36898411182540186, -0.22065531762494717, -0.2631887574732471, 0.1399858446158678, -0.2545675275130511, -0.11093733020210533, 0.2564708106723363, 0.010975827669641107, 0.13371049443206207, 0.08414176268518767, 0.016173793144231098, -0.09690860818595405, -0.31724148302788985, 0.32450652807516706, -0.01998678908625806, 0.24165805537656493, 0.018924400711685857, 0.12004768397669528, -0.11187676784027828, -0.0022978081676606715, -0.030668674280972932, -0.1684343147818264, 0.013613768993207159, 0.22175117244478315, 0.07799108568029584, 0.26963927295958895, -0.4376699509559555, -0.21152165656637276, 0.07789323660361926, 0.16805987625926985, 0.0946470666827184, -0.08449405051762594, -0.2831724886494699, 0.08927036789762578, -0.1445898350087528, -0.1802337879283626, -0.1181333403435295, 0.00015794474362092238, 0.042213072249498426, -0.25293751460437275, 0.08029467552040934, 0.022053318187133984, 0.0440274038132322, -0.1343824762093646, -0.11818016421447476, -0.03544899615003947, 0.04127133925761923, 0.039322688448296145, 0.022564862726591108, 0.04693395179811488, -0.0773256924419482, -0.10676897578320749, 0.3662453317815919, -0.08293154617127951, -0.2952797635434865, 0.1895609982573333, -0.17073877465916443, -0.13044493535816085, 0.1518911674508846, 0.15615867030430125, 0.13624078361055908, -0.12976307296874315, 0.15091018224026473, -0.02075540906752282, 0.17230115850780453, 0.10823672996530456, -0.02596541985495309, 0.0923078127317863, 0.13304842555152482, 0.0425952073223261, 0.08299986399799125, -0.019128120090979875, -0.14969207567759277, -0.35541015573034296, -0.17560695889248942, -0.14289476321238417, 0.008719448651758735, -0.11250517826458357, -0.16969866116970694, 0.35758609977475836, 0.12710064847160946, 0.10616643849781222, 0.05567354194655114, 0.2947551855115021, 0.14775015370399702, 0.04543232832894022, 0.12419744390533881, 0.20665565916560094, 0.10733408000571339, 0.15430946410581303, -0.22759621614672693, 0.0028656094748359382, 0.12948648483502898] |
1,803.01292 | Brightened spin-triplet interlayer excitons and optical selection rules
in van der Waals heterobilayers | We investigate the optical properties of spin-triplet interlayer excitons in
heterobilayer transition metal dichalcogenides in comparison with the
spin-singlet ones. Surprisingly, the optical transition dipole of the
spin-triplet exciton is found to be in the same order of magnitude to that of
the spin-singlet exciton, in sharp contrast to the monolayer excitons where the
spin triplet species is considered as dark compared to the singlet. Unlike the
monolayer excitons whose spin-conserved (spin-flip) transition dipole can only
couple to light of in-plane (out-of-plane) polarization, such restriction is
removed for the interlayer excitons due to the breaking of the out-of-plane
mirror symmetry. We find that as the interlayer atomic registry changes, the
optical transition dipole of interlayer exciton crosses between in-plane ones
of opposite circular polarization and the out-of-plane one for both the
spin-triplet and spin-singlet species. As a result, excitons of both species
have non-negligible coupling into photon modes of both in-plane and
out-of-plane propagations, another sharp difference from the monolayers where
the exciton couples predominantly into the out-of-plane propagation channel. At
given atomic registry, the spin-triplet and spin-singlet excitons have distinct
valley polarization selection rules, allowing the selective optical addressing
of both the valley configuration and the spin singlet/triplet configuration of
interlayer excitons.
| cond-mat.mes-hall cond-mat.mtrl-sci | we investigate the optical properties of spintriplet interlayer excitons in heterobilayer transition metal dichalcogenides in comparison with the spinsinglet ones surprisingly the optical transition dipole of the spintriplet exciton is found to be in the same order of magnitude to that of the spinsinglet exciton in sharp contrast to the monolayer excitons where the spin triplet species is considered as dark compared to the singlet unlike the monolayer excitons whose spinconserved spinflip transition dipole can only couple to light of inplane outofplane polarization such restriction is removed for the interlayer excitons due to the breaking of the outofplane mirror symmetry we find that as the interlayer atomic registry changes the optical transition dipole of interlayer exciton crosses between inplane ones of opposite circular polarization and the outofplane one for both the spintriplet and spinsinglet species as a result excitons of both species have nonnegligible coupling into photon modes of both inplane and outofplane propagations another sharp difference from the monolayers where the exciton couples predominantly into the outofplane propagation channel at given atomic registry the spintriplet and spinsinglet excitons have distinct valley polarization selection rules allowing the selective optical addressing of both the valley configuration and the spin singlettriplet configuration of interlayer excitons | [['we', 'investigate', 'the', 'optical', 'properties', 'of', 'spintriplet', 'interlayer', 'excitons', 'in', 'heterobilayer', 'transition', 'metal', 'dichalcogenides', 'in', 'comparison', 'with', 'the', 'spinsinglet', 'ones', 'surprisingly', 'the', 'optical', 'transition', 'dipole', 'of', 'the', 'spintriplet', 'exciton', 'is', 'found', 'to', 'be', 'in', 'the', 'same', 'order', 'of', 'magnitude', 'to', 'that', 'of', 'the', 'spinsinglet', 'exciton', 'in', 'sharp', 'contrast', 'to', 'the', 'monolayer', 'excitons', 'where', 'the', 'spin', 'triplet', 'species', 'is', 'considered', 'as', 'dark', 'compared', 'to', 'the', 'singlet', 'unlike', 'the', 'monolayer', 'excitons', 'whose', 'spinconserved', 'spinflip', 'transition', 'dipole', 'can', 'only', 'couple', 'to', 'light', 'of', 'inplane', 'outofplane', 'polarization', 'such', 'restriction', 'is', 'removed', 'for', 'the', 'interlayer', 'excitons', 'due', 'to', 'the', 'breaking', 'of', 'the', 'outofplane', 'mirror', 'symmetry', 'we', 'find', 'that', 'as', 'the', 'interlayer', 'atomic', 'registry', 'changes', 'the', 'optical', 'transition', 'dipole', 'of', 'interlayer', 'exciton', 'crosses', 'between', 'inplane', 'ones', 'of', 'opposite', 'circular', 'polarization', 'and', 'the', 'outofplane', 'one', 'for', 'both', 'the', 'spintriplet', 'and', 'spinsinglet', 'species', 'as', 'a', 'result', 'excitons', 'of', 'both', 'species', 'have', 'nonnegligible', 'coupling', 'into', 'photon', 'modes', 'of', 'both', 'inplane', 'and', 'outofplane', 'propagations', 'another', 'sharp', 'difference', 'from', 'the', 'monolayers', 'where', 'the', 'exciton', 'couples', 'predominantly', 'into', 'the', 'outofplane', 'propagation', 'channel', 'at', 'given', 'atomic', 'registry', 'the', 'spintriplet', 'and', 'spinsinglet', 'excitons', 'have', 'distinct', 'valley', 'polarization', 'selection', 'rules', 'allowing', 'the', 'selective', 'optical', 'addressing', 'of', 'both', 'the', 'valley', 'configuration', 'and', 'the', 'spin', 'singlettriplet', 'configuration', 'of', 'interlayer', 'excitons']] | [-0.18923680313170102, 0.2480518802440739, 0.015943323838951185, 0.03680681244967955, -0.03747533319582199, -0.18703381708258845, 0.08012195863919287, 0.4466993527789715, -0.25252018308523916, -0.2506567995967756, -0.1150625556377061, -0.31549138511792557, -0.06499944966093733, 0.11215325699788817, 0.14918159155560465, -0.03312654831570578, -0.04183396908799829, -0.10016995837242146, -0.04691168676208466, -0.17090701671165823, 0.2892471596350884, -0.06070648519588368, 0.3567626419720318, 0.14451092883504082, 0.02106318628332885, 0.030773670223640196, 0.14261461584484708, -0.07881942804297203, -0.11611381649038825, 0.08228108173628651, 0.25233983074365357, -0.15970316613918822, 0.1872476986643808, -0.4423163996394632, -0.13730688247682865, 0.07223885702749192, 0.2086838570267439, 0.23590954500502848, -0.020566704270104177, -0.3277716302574415, -0.015185323047791173, -0.13454031827529833, -0.061211735744194445, -0.06337171342921227, 0.004986397623832297, -0.007066955961392541, -0.2674506149240976, 0.12434831713905485, 0.06142993295666179, 0.03623907430225919, -0.11736403317121889, -0.13824425333493798, -0.17796131531051887, 0.049694613381541276, 0.10823652285421864, 0.0675675927287454, 0.1768542403370151, -0.15161383364078923, -0.1315619114056927, 0.3797911522643907, -0.09817865885291799, -0.0847577726688658, 0.12688294393348787, -0.1622636254842157, 0.008186909624747014, 0.1778151234990362, 0.1027084247810133, 0.1011933893231409, -0.07366941359325363, 0.019442089322640153, -0.033306315674313476, 0.16737757141477075, 0.08519100659329609, 0.17638336803782456, 0.2731632350443913, 0.15075866675080063, 0.07146334050801294, 0.13759224086006636, -0.1501953179943444, -0.060362348657587696, -0.19873253427207324, -0.18585605578029096, -0.2378235615863295, 0.0644996697633651, -0.05177221727278485, -0.1693976882540075, 0.4433226308514699, 0.10066846023936495, 0.18259330928853823, -0.077272469563217, 0.2689347841382357, 0.09682297852682294, 0.11531416847476084, -0.04729441405397845, 0.34596422136106914, 0.20327655970591482, 0.08175550350114208, -0.35240191802740317, 0.07195686296160732, -0.027890185983805674] |
1,803.01293 | 0-1 matrices with zero trace whose squares are 0-1 matrices | In this paper, we determine the maximum number of nonzero entries in 0-1
matrices of order $n$ with zero trace whose squares are 0-1 matrices when $n\ge
8$. The extremal matrices attaining this maximum number are also characterized.
| math.CO | in this paper we determine the maximum number of nonzero entries in 01 matrices of order n with zero trace whose squares are 01 matrices when nge 8 the extremal matrices attaining this maximum number are also characterized | [['in', 'this', 'paper', 'we', 'determine', 'the', 'maximum', 'number', 'of', 'nonzero', 'entries', 'in', '01', 'matrices', 'of', 'order', 'n', 'with', 'zero', 'trace', 'whose', 'squares', 'are', '01', 'matrices', 'when', 'nge', '8', 'the', 'extremal', 'matrices', 'attaining', 'this', 'maximum', 'number', 'are', 'also', 'characterized']] | [-0.18880853292189145, 0.24324955350082172, 0.09540022007728878, -0.003864206281784726, 0.023046478825180156, -0.1408578877851955, 0.007368314190228519, 0.34015796127680104, -0.2737142831871384, -0.3417798226674725, 0.19078488726977652, -0.3591080822638775, -0.1277394169316578, 0.062190496019626916, -0.06325901912427262, 0.09092873413311808, 0.007022880507927192, 0.13816828795365596, -0.1702945844123238, -0.3454907934769596, 0.3020987613616805, -0.03234695322125366, 0.14866613979010204, 0.01628777767090421, 0.07959115176804755, -0.029345788404737647, -0.0020253737702181467, 0.024443258016713355, -0.1296486669759217, 0.11499204746398486, 0.2859655315742681, 0.12407840869242423, 0.24024003391203128, -0.3404745073302796, -0.07509065076316658, 0.28116821017312377, 0.15157983350984164, 0.014064715004918215, 0.017943070818498535, -0.11577223322207206, 0.2179403081536293, -0.16436587945607148, -0.16622155453813703, 0.003878685474199684, 0.050053179705221405, 0.014716124358145814, -0.33738706210677166, 0.06840020740989865, 0.07377759303505484, 0.08143926982914931, 0.03130430659573329, -0.28386174164418326, 0.05013203003296727, 0.08434617743401568, 0.021441106586471984, -0.04284821097788058, -0.0020661299288468925, -0.05022838519346949, -0.040073525981585444, 0.2613733098352034, -0.02527452093904446, -0.24126571387444673, 0.06104721699988371, -0.27950505863286945, -0.1092313212881747, 0.16862435234514506, 0.15426807451570457, 0.1618726198733049, -0.10271999572815778, 0.13024841013707614, -0.12245308421552181, 0.16641310513889612, 0.15156807007856274, 0.030328192772637857, 0.15671446556715588, 0.020206246868168052, 0.1557961475520738, 0.13475330757271303, -0.04243805161432216, -0.016519387889849513, -0.3294064679036015, -0.1387389153732281, -0.2962499929739064, 0.12347021726523771, -0.21664722834860808, -0.193974958021978, 0.37360324622376967, 0.1201026089685528, 0.2635114987037684, 0.13437521430712782, 0.17580861942597517, 0.13954640846503408, -0.018398096098711614, 0.13406799684621787, 0.13045626849328218, 0.25566498739154714, 0.013950627762824297, -0.1747025583968743, 0.033099634499338115, 0.10041330816028149] |
1,803.01294 | Spin Hall effects without spin currents in magnetic insulators | The spin Hall effect (SHE) is normally discussed in terms of a spin current,
which is ill-defined in strongly spin-orbit-coupled systems because of spin
non-conservation. In this work we propose an alternative view of SHE phenomena
by relating them to a spin analog of charge polarization induced by an electric
field. The spin density polarization is most conveniently defined in
insulators, which can have a SHE if they break time-reversal symmetry, i.e. if
they are magnetic. The reciprocal of this SHE is a counterpart of the inverse
SHE (ISHE), and is manifested in magnetic insulators as a charge polarization
induced by a Zeeman field gradient. We use a modified Kane-Mele model to
illustrate the magnetic spin Hall effect, and to discuss its bulk-boundary
relationship.
| cond-mat.mes-hall cond-mat.mtrl-sci | the spin hall effect she is normally discussed in terms of a spin current which is illdefined in strongly spinorbitcoupled systems because of spin nonconservation in this work we propose an alternative view of she phenomena by relating them to a spin analog of charge polarization induced by an electric field the spin density polarization is most conveniently defined in insulators which can have a she if they break timereversal symmetry ie if they are magnetic the reciprocal of this she is a counterpart of the inverse she ishe and is manifested in magnetic insulators as a charge polarization induced by a zeeman field gradient we use a modified kanemele model to illustrate the magnetic spin hall effect and to discuss its bulkboundary relationship | [['the', 'spin', 'hall', 'effect', 'she', 'is', 'normally', 'discussed', 'in', 'terms', 'of', 'a', 'spin', 'current', 'which', 'is', 'illdefined', 'in', 'strongly', 'spinorbitcoupled', 'systems', 'because', 'of', 'spin', 'nonconservation', 'in', 'this', 'work', 'we', 'propose', 'an', 'alternative', 'view', 'of', 'she', 'phenomena', 'by', 'relating', 'them', 'to', 'a', 'spin', 'analog', 'of', 'charge', 'polarization', 'induced', 'by', 'an', 'electric', 'field', 'the', 'spin', 'density', 'polarization', 'is', 'most', 'conveniently', 'defined', 'in', 'insulators', 'which', 'can', 'have', 'a', 'she', 'if', 'they', 'break', 'timereversal', 'symmetry', 'ie', 'if', 'they', 'are', 'magnetic', 'the', 'reciprocal', 'of', 'this', 'she', 'is', 'a', 'counterpart', 'of', 'the', 'inverse', 'she', 'ishe', 'and', 'is', 'manifested', 'in', 'magnetic', 'insulators', 'as', 'a', 'charge', 'polarization', 'induced', 'by', 'a', 'zeeman', 'field', 'gradient', 'we', 'use', 'a', 'modified', 'kanemele', 'model', 'to', 'illustrate', 'the', 'magnetic', 'spin', 'hall', 'effect', 'and', 'to', 'discuss', 'its', 'bulkboundary', 'relationship']] | [-0.20270834176335484, 0.2181313975205769, -0.052384672310924335, 0.0686150590444149, -0.1254148798273696, -0.14142181181288774, 0.017938697743961857, 0.3778060965761993, -0.2988789124243457, -0.2915437865040956, 0.035335667783416985, -0.2672573739602681, -0.17899064282556215, 0.1627347369118774, -0.022810495008842177, -0.04785731305591687, -0.10615570878144354, -0.007957075826726072, -0.10726474407373086, -0.19698447949485853, 0.28738377892389716, 0.018193244328534593, 0.29710444033844396, 0.07779425562494585, 0.08372444691391842, 0.051599622076948085, 0.07846808347911123, 0.07776494509744225, -0.06344045887160446, 0.04036606658220051, 0.22086751794127085, -0.059943704039699605, 0.19104246211598716, -0.4429777806714898, -0.17003102701217418, 0.061843204212510175, 0.08919705602625806, 0.20998457881374163, -0.08255878942567975, -0.29903677300805404, 0.022836413238227608, -0.20735471128230734, -0.11648521427395603, -0.08732003821886235, 0.04855405205237349, -0.0705404551399331, -0.2412655955150483, 0.07372288463727361, 0.13286049402649364, 0.09000391937461832, -0.02704997165335132, -0.08526380483301417, -0.08982593202287512, 0.04402334682996415, 0.0833942096937643, 0.07215164470366173, 0.15288132157142936, -0.17310364088306443, -0.22216839766910962, 0.3666866173697335, -0.05917702308825908, -0.22400766773329628, 0.09824920901202507, -0.2026122318347916, -0.047681047994222854, 0.08277867494090911, 0.12462953804342466, 0.11230973497543845, -0.13998356296665845, 0.09210046415870649, -0.04882890079264349, 0.12154997294794978, 0.01062096853274852, 0.07486996759149817, 0.3415129859330914, 0.12593321456018114, 0.09374706161906943, 0.13830852899850615, -0.11829640785107322, -0.02644655590261062, -0.24241406704869964, -0.21256937241301901, -0.27079513578134917, 0.15046532967338158, 0.014997423311269227, -0.1422041382550472, 0.4222581085388459, 0.18886196195343208, 0.15387193417747416, -0.096739221874985, 0.2887192276276408, 0.18997000488208518, 0.08575341702277411, 0.032213721792363835, 0.2573424713543406, 0.20771378928217135, 0.11268662075482068, -0.30611525174425613, 0.0801722908001994, 0.028458484275747212] |
1,803.01295 | 3D spatial exploration by E. coli echoes motor temporal variability | Unraveling bacterial strategies for spatial exploration is crucial for
understanding the complexity in the organization of life. Bacterial motility
determines the spatio-temporal structure of microbial communities, controls
infection spreading and the microbiota organization in guts or in soils. Most
theoretical approaches for modeling bacterial transport rely on their
run-and-tumble motion. For Escherichia coli, the run time distribution was
reported to follow a Poisson process with a single characteristic time related
to the rotational switching of the flagellar motors. However, direct
measurements on flagellar motors show heavy-tailed distributions of rotation
times stemming from the intrinsic noise in the chemotactic mechanism.
Currently, there is no direct experimental evidence that the stochasticity in
the chemotactic machinery affect the macroscopic motility of bacteria. In stark
contrast with the accepted vision of run-and-tumble, here we report a large
behavioral variability of wild-type \emph{E. coli}, revealed in their
three-dimensional trajectories. At short observation times, a large
distribution of run times is measured on a population and attributed to the
slow fluctuations of a signaling protein triggering the flagellar motor
reversal. Over long times, individual bacteria undergo significant changes in
motility. We demonstrate that such a large distribution of run times introduces
measurement biases in most practical situations. Our results reconcile the
notorious conundrum between run time observations and motor switching
statistics. We finally propose that statistical modeling of transport
properties currently undertaken in the emerging framework of active matter
studies, should be reconsidered under the scope of this large variability of
motility features.
| physics.bio-ph cond-mat.soft q-bio.CB | unraveling bacterial strategies for spatial exploration is crucial for understanding the complexity in the organization of life bacterial motility determines the spatiotemporal structure of microbial communities controls infection spreading and the microbiota organization in guts or in soils most theoretical approaches for modeling bacterial transport rely on their runandtumble motion for escherichia coli the run time distribution was reported to follow a poisson process with a single characteristic time related to the rotational switching of the flagellar motors however direct measurements on flagellar motors show heavytailed distributions of rotation times stemming from the intrinsic noise in the chemotactic mechanism currently there is no direct experimental evidence that the stochasticity in the chemotactic machinery affect the macroscopic motility of bacteria in stark contrast with the accepted vision of runandtumble here we report a large behavioral variability of wildtype emphe coli revealed in their threedimensional trajectories at short observation times a large distribution of run times is measured on a population and attributed to the slow fluctuations of a signaling protein triggering the flagellar motor reversal over long times individual bacteria undergo significant changes in motility we demonstrate that such a large distribution of run times introduces measurement biases in most practical situations our results reconcile the notorious conundrum between run time observations and motor switching statistics we finally propose that statistical modeling of transport properties currently undertaken in the emerging framework of active matter studies should be reconsidered under the scope of this large variability of motility features | [['unraveling', 'bacterial', 'strategies', 'for', 'spatial', 'exploration', 'is', 'crucial', 'for', 'understanding', 'the', 'complexity', 'in', 'the', 'organization', 'of', 'life', 'bacterial', 'motility', 'determines', 'the', 'spatiotemporal', 'structure', 'of', 'microbial', 'communities', 'controls', 'infection', 'spreading', 'and', 'the', 'microbiota', 'organization', 'in', 'guts', 'or', 'in', 'soils', 'most', 'theoretical', 'approaches', 'for', 'modeling', 'bacterial', 'transport', 'rely', 'on', 'their', 'runandtumble', 'motion', 'for', 'escherichia', 'coli', 'the', 'run', 'time', 'distribution', 'was', 'reported', 'to', 'follow', 'a', 'poisson', 'process', 'with', 'a', 'single', 'characteristic', 'time', 'related', 'to', 'the', 'rotational', 'switching', 'of', 'the', 'flagellar', 'motors', 'however', 'direct', 'measurements', 'on', 'flagellar', 'motors', 'show', 'heavytailed', 'distributions', 'of', 'rotation', 'times', 'stemming', 'from', 'the', 'intrinsic', 'noise', 'in', 'the', 'chemotactic', 'mechanism', 'currently', 'there', 'is', 'no', 'direct', 'experimental', 'evidence', 'that', 'the', 'stochasticity', 'in', 'the', 'chemotactic', 'machinery', 'affect', 'the', 'macroscopic', 'motility', 'of', 'bacteria', 'in', 'stark', 'contrast', 'with', 'the', 'accepted', 'vision', 'of', 'runandtumble', 'here', 'we', 'report', 'a', 'large', 'behavioral', 'variability', 'of', 'wildtype', 'emphe', 'coli', 'revealed', 'in', 'their', 'threedimensional', 'trajectories', 'at', 'short', 'observation', 'times', 'a', 'large', 'distribution', 'of', 'run', 'times', 'is', 'measured', 'on', 'a', 'population', 'and', 'attributed', 'to', 'the', 'slow', 'fluctuations', 'of', 'a', 'signaling', 'protein', 'triggering', 'the', 'flagellar', 'motor', 'reversal', 'over', 'long', 'times', 'individual', 'bacteria', 'undergo', 'significant', 'changes', 'in', 'motility', 'we', 'demonstrate', 'that', 'such', 'a', 'large', 'distribution', 'of', 'run', 'times', 'introduces', 'measurement', 'biases', 'in', 'most', 'practical', 'situations', 'our', 'results', 'reconcile', 'the', 'notorious', 'conundrum', 'between', 'run', 'time', 'observations', 'and', 'motor', 'switching', 'statistics', 'we', 'finally', 'propose', 'that', 'statistical', 'modeling', 'of', 'transport', 'properties', 'currently', 'undertaken', 'in', 'the', 'emerging', 'framework', 'of', 'active', 'matter', 'studies', 'should', 'be', 'reconsidered', 'under', 'the', 'scope', 'of', 'this', 'large', 'variability', 'of', 'motility', 'features']] | [-0.1349317663460442, 0.17179481847106143, -0.07039626871201733, 0.0489812244396169, -0.04695794198130397, -0.12208216170079748, 0.04322855132971306, 0.37521305392960064, -0.26002634928358137, -0.2857639578582063, 0.03229524112525226, -0.21842597997917035, -0.2105903357619925, 0.18378140411324617, -0.09206004219548211, 0.030473705546351655, 0.07189195033027093, -0.03293481424190707, 0.0901066180809235, -0.16590175219162967, 0.17699202231879946, 0.05450355913113003, 0.3258543696093301, 0.0023093724777443177, 0.13769549784085125, -0.03474879223921219, -0.057170113165926954, -0.017596217758410613, -0.16445511659728773, 0.08798931021908951, 0.26369890370425064, 0.1193205865056665, 0.27166463571472416, -0.5113368976431397, -0.25077734273002456, 0.1434757728975345, 0.16270811240629932, 0.14359779485316593, -0.04902155102873485, -0.2513117507959788, 0.03564467661833082, -0.1236145746411552, -0.11541957617454562, -0.05000057943949574, 0.08187977178022265, 0.06289959633261011, -0.21862173833561918, 0.15048879181149866, 0.040701870396469345, 0.13760332787137947, -0.0912274844107418, -0.08425710868441051, -0.013791209472313161, 0.15661343526159252, 0.132471368686642, -0.021071574739312475, 0.26630760279299337, -0.1600042514093899, -0.16773923188033193, 0.3699138773235715, -0.015871826583106704, -0.16383706799968473, 0.23103417847531768, -0.1832495917276732, -0.178679563724417, 0.14527327084521713, 0.20386976550751731, 0.0835639828899008, -0.1538896351712869, 0.003361804965319798, -0.013009678391430543, 0.18625550942192878, 0.04202858377945598, -0.010547805621349046, 0.19794062492418807, 0.27239379243074957, 0.03911488784876792, 0.0510731155452458, -0.11379199488906695, -0.13913747347016567, -0.22029531987851508, -0.13000852077221875, -0.14347624137567785, 0.0841447088993739, -0.09167289203236696, -0.13012140703308378, 0.39690978865060006, 0.14380005768996093, 0.20202956611652545, 0.0876219382958283, 0.2535633524778009, 0.010999951847670561, 0.0789624377274471, 0.008494119792384838, 0.20722323984118848, 0.08059332534191972, 0.1370496509817282, -0.3067894678380009, 0.18383621952594503, -0.04838766627589162] |
1,803.01296 | Scout: An Experienced Guide to Find the Best Cloud Configuration | Finding the right cloud configuration for workloads is an essential step to
ensure good performance and contain running costs. A poor choice of cloud
configuration decreases application performance and increases running cost
significantly. While Bayesian Optimization is effective and applicable to any
workloads, it is fragile because performance and workload are hard to model (to
predict).
In this paper, we propose a novel method, SCOUT. The central insight of SCOUT
is that using prior measurements, even those for different workloads, improves
search performance and reduces search cost. At its core, SCOUT extracts search
hints (inference of resource requirements) from low-level performance metrics.
Such hints enable SCOUT to navigate through the search space more
efficiently---only spotlight region will be searched.
We evaluate SCOUT with 107 workloads on Apache Hadoop and Spark. The
experimental results demonstrate that our approach finds better cloud
configurations with a lower search cost than state of the art methods.
Based on this work, we conclude that (i) low-level performance information is
necessary for finding the right cloud configuration in an effective, efficient
and reliable way, and (ii) a search method can be guided by historical data,
thereby reducing cost and improving performance.
| cs.DC | finding the right cloud configuration for workloads is an essential step to ensure good performance and contain running costs a poor choice of cloud configuration decreases application performance and increases running cost significantly while bayesian optimization is effective and applicable to any workloads it is fragile because performance and workload are hard to model to predict in this paper we propose a novel method scout the central insight of scout is that using prior measurements even those for different workloads improves search performance and reduces search cost at its core scout extracts search hints inference of resource requirements from lowlevel performance metrics such hints enable scout to navigate through the search space more efficientlyonly spotlight region will be searched we evaluate scout with 107 workloads on apache hadoop and spark the experimental results demonstrate that our approach finds better cloud configurations with a lower search cost than state of the art methods based on this work we conclude that i lowlevel performance information is necessary for finding the right cloud configuration in an effective efficient and reliable way and ii a search method can be guided by historical data thereby reducing cost and improving performance | [['finding', 'the', 'right', 'cloud', 'configuration', 'for', 'workloads', 'is', 'an', 'essential', 'step', 'to', 'ensure', 'good', 'performance', 'and', 'contain', 'running', 'costs', 'a', 'poor', 'choice', 'of', 'cloud', 'configuration', 'decreases', 'application', 'performance', 'and', 'increases', 'running', 'cost', 'significantly', 'while', 'bayesian', 'optimization', 'is', 'effective', 'and', 'applicable', 'to', 'any', 'workloads', 'it', 'is', 'fragile', 'because', 'performance', 'and', 'workload', 'are', 'hard', 'to', 'model', 'to', 'predict', 'in', 'this', 'paper', 'we', 'propose', 'a', 'novel', 'method', 'scout', 'the', 'central', 'insight', 'of', 'scout', 'is', 'that', 'using', 'prior', 'measurements', 'even', 'those', 'for', 'different', 'workloads', 'improves', 'search', 'performance', 'and', 'reduces', 'search', 'cost', 'at', 'its', 'core', 'scout', 'extracts', 'search', 'hints', 'inference', 'of', 'resource', 'requirements', 'from', 'lowlevel', 'performance', 'metrics', 'such', 'hints', 'enable', 'scout', 'to', 'navigate', 'through', 'the', 'search', 'space', 'more', 'efficientlyonly', 'spotlight', 'region', 'will', 'be', 'searched', 'we', 'evaluate', 'scout', 'with', '107', 'workloads', 'on', 'apache', 'hadoop', 'and', 'spark', 'the', 'experimental', 'results', 'demonstrate', 'that', 'our', 'approach', 'finds', 'better', 'cloud', 'configurations', 'with', 'a', 'lower', 'search', 'cost', 'than', 'state', 'of', 'the', 'art', 'methods', 'based', 'on', 'this', 'work', 'we', 'conclude', 'that', 'i', 'lowlevel', 'performance', 'information', 'is', 'necessary', 'for', 'finding', 'the', 'right', 'cloud', 'configuration', 'in', 'an', 'effective', 'efficient', 'and', 'reliable', 'way', 'and', 'ii', 'a', 'search', 'method', 'can', 'be', 'guided', 'by', 'historical', 'data', 'thereby', 'reducing', 'cost', 'and', 'improving', 'performance']] | [-0.08978385410029154, 0.003664005943964063, -0.09759829749866898, 0.055798709848007555, -0.12131696106558762, -0.16330301358134092, 0.12209476375791542, 0.4309312946345542, -0.21389792259955376, -0.40613331566996796, 0.09825825239603705, -0.2610574203024897, -0.10744009974302206, 0.2217902019955986, -0.08561282838498525, 0.06838791850040973, 0.1500310274765145, -0.0012538131691285015, -0.0675096180231176, -0.2739224921925157, 0.23850760702283802, 0.13807973037137813, 0.3355960133065441, 0.06493411825000088, 0.03470274985446259, -0.03486797913306479, -0.03509902069105085, -0.00925603716111545, -0.06653129220780402, 0.1313321349011811, 0.27182338507149906, 0.24692416224465466, 0.2810705663041048, -0.41585814259639103, -0.15537136654938408, 0.09633468201662385, 0.155605327100349, 0.04843908972490925, -0.08409515630068874, -0.2882877522887489, 0.11477694067337128, -0.16302800727480082, -0.06497082977133237, -0.14088921074169813, -0.01830137361047463, -0.01926887766116049, -0.301316688542936, -0.0005980250896698766, 0.008979159634747571, 0.012022564737318256, -0.04417985368258387, -0.13637197457707592, 0.028489702924865194, 0.14227603659869084, -0.0011315290106834902, 0.08104294077577262, 0.19700551265610633, -0.15888093768065578, -0.12411516026795372, 0.407181849439158, -0.034893566418871806, -0.15674355859897032, 0.21058636690254717, -0.023965207041966124, -0.14954546704416083, 0.13635750843653666, 0.21305274232062654, 0.11561333627881694, -0.1566228102124536, 0.0599211519305023, 0.030991891488137645, 0.20273400045158438, 0.01562841114415259, 0.03954451041507352, 0.17747228500582085, 0.2715249485972328, 0.12897032483951332, 0.15523876107211426, -0.09081159391651679, -0.11403241409762935, -0.19845023798185027, -0.17331820812565996, -0.1422023181899537, -0.03513627271056919, -0.1265825307801259, -0.10269572538294897, 0.36528843560870544, 0.23705703945897674, 0.1772995112819679, 0.09605374756706014, 0.3731892586676116, 0.0646200679151399, 0.0881548921035161, 0.16401394322447324, 0.16672476081504034, -0.0570260904544542, 0.1268704288828753, -0.19965652390095145, 0.09426989178797326, -0.0066349057523598515] |
1,803.01297 | The semi-leptonic and non-leptonic weak decays of $\Lambda_b^0$ | The recent experimental developments require a more precise theoretical study
of weak decays of heavy baryon $\Lambda_b^0$. In this work, we provide an
updated and systematic analysis of both the semi-leptonic and nonleptonic
decays of $\Lambda^0_b$ into baryons $\Lambda^+_c$, $\Lambda$, $p$, and $n$.
The diquark approximation is adopted so that the methods developed in the $B$
meson system can be extended into the baryon system. The baryon-to-baryon
transition form factors are calculated in the framework of a covariant
light-front quark model. The form factors $f_3, ~g_3$ can be extracted and are
found to be non-negligible. The semi-leptonic processes of $\Lambda^0_b\to
\Lambda^+_c(p)l^-\bar\nu_l$ are calculated and the results are consistent with
the experiment. We study the non-leptonic processes within the QCD
factorization approach. The decay amplitudes are calculated at the
next-to-leading order in strong coupling constant $\alpha_s$. We calculate the
non-leptonic decays of $\Lambda^0_b$ into a baryon and a s-wave meson
(pseudoscalar or vector) including 44 processes in total. The branching ratios
and direct CP asymmetries are predicted. The numerical results are compared to
the experimental data and those in the other theoretical approaches. Our
results show validity of the diquark approximation and application of QCD
factorization approach into the heavy baryon system.
| hep-ph hep-ex | the recent experimental developments require a more precise theoretical study of weak decays of heavy baryon lambda_b0 in this work we provide an updated and systematic analysis of both the semileptonic and nonleptonic decays of lambda0_b into baryons lambda_c lambda p and n the diquark approximation is adopted so that the methods developed in the b meson system can be extended into the baryon system the baryontobaryon transition form factors are calculated in the framework of a covariant lightfront quark model the form factors f_3 g_3 can be extracted and are found to be nonnegligible the semileptonic processes of lambda0_bto lambda_cplbarnu_l are calculated and the results are consistent with the experiment we study the nonleptonic processes within the qcd factorization approach the decay amplitudes are calculated at the nexttoleading order in strong coupling constant alpha_s we calculate the nonleptonic decays of lambda0_b into a baryon and a swave meson pseudoscalar or vector including 44 processes in total the branching ratios and direct cp asymmetries are predicted the numerical results are compared to the experimental data and those in the other theoretical approaches our results show validity of the diquark approximation and application of qcd factorization approach into the heavy baryon system | [['the', 'recent', 'experimental', 'developments', 'require', 'a', 'more', 'precise', 'theoretical', 'study', 'of', 'weak', 'decays', 'of', 'heavy', 'baryon', 'lambda_b0', 'in', 'this', 'work', 'we', 'provide', 'an', 'updated', 'and', 'systematic', 'analysis', 'of', 'both', 'the', 'semileptonic', 'and', 'nonleptonic', 'decays', 'of', 'lambda0_b', 'into', 'baryons', 'lambda_c', 'lambda', 'p', 'and', 'n', 'the', 'diquark', 'approximation', 'is', 'adopted', 'so', 'that', 'the', 'methods', 'developed', 'in', 'the', 'b', 'meson', 'system', 'can', 'be', 'extended', 'into', 'the', 'baryon', 'system', 'the', 'baryontobaryon', 'transition', 'form', 'factors', 'are', 'calculated', 'in', 'the', 'framework', 'of', 'a', 'covariant', 'lightfront', 'quark', 'model', 'the', 'form', 'factors', 'f_3', 'g_3', 'can', 'be', 'extracted', 'and', 'are', 'found', 'to', 'be', 'nonnegligible', 'the', 'semileptonic', 'processes', 'of', 'lambda0_bto', 'lambda_cplbarnu_l', 'are', 'calculated', 'and', 'the', 'results', 'are', 'consistent', 'with', 'the', 'experiment', 'we', 'study', 'the', 'nonleptonic', 'processes', 'within', 'the', 'qcd', 'factorization', 'approach', 'the', 'decay', 'amplitudes', 'are', 'calculated', 'at', 'the', 'nexttoleading', 'order', 'in', 'strong', 'coupling', 'constant', 'alpha_s', 'we', 'calculate', 'the', 'nonleptonic', 'decays', 'of', 'lambda0_b', 'into', 'a', 'baryon', 'and', 'a', 'swave', 'meson', 'pseudoscalar', 'or', 'vector', 'including', '44', 'processes', 'in', 'total', 'the', 'branching', 'ratios', 'and', 'direct', 'cp', 'asymmetries', 'are', 'predicted', 'the', 'numerical', 'results', 'are', 'compared', 'to', 'the', 'experimental', 'data', 'and', 'those', 'in', 'the', 'other', 'theoretical', 'approaches', 'our', 'results', 'show', 'validity', 'of', 'the', 'diquark', 'approximation', 'and', 'application', 'of', 'qcd', 'factorization', 'approach', 'into', 'the', 'heavy', 'baryon', 'system']] | [-0.08772089473707789, 0.20461147232514973, -0.09349543158077266, 0.1204947031959517, -0.04974694219160469, -0.09515176569322246, 0.07577063203566993, 0.3060715715705076, -0.18858201891165133, -0.2010163867696371, -0.02505824341902032, -0.3532468215843204, -0.025090321366108916, 0.11194175328993843, 0.12407372588521084, 0.11178667979822705, 0.07474022779096592, 0.015788959213046957, -0.07404222357058757, -0.21850067858137284, 0.29138675726126484, -0.05001061418135861, 0.22412713455859964, 0.14791435367151645, -0.043229477596469223, -0.03973067108537047, -0.09105025711773553, -0.010544512149451965, -0.14744453839905794, 0.0711260385481973, 0.20277094878867646, 0.11615392256524629, 0.15485863897706095, -0.39416212296983855, -0.117517994538923, 0.10400438582379577, 0.1889223806003118, 0.14578659660253093, -0.022269387625701298, -0.3463748897701951, 0.13056751070824923, -0.198113929751755, -0.08119614427469334, -0.16734858345352674, 0.007113921121418027, -0.01954000408295542, -0.3730050923873731, 0.0950780346750951, -0.04800396396815964, 0.0033834952622389973, -0.03670697193709787, -0.25978657354813667, 0.012894955000386166, 0.06081853611464963, 0.12403183494841952, 0.09746143495869922, 0.13645312351984296, -0.13921282795519946, -0.1506208045216249, 0.4486074465497785, -0.08562924642520653, -0.17504470699452726, 0.0904259564408836, -0.18707908483411667, -0.1547982371576018, 0.1228138906085611, 0.23367094175291048, 0.08387656651212642, -0.17314890294274943, 0.11654022451807235, -0.03188816094174326, 0.1328996780817514, 0.026740772971396695, 0.07281089560292549, 0.1672319996044339, 0.17428442449238732, -0.0954812791189132, 0.04954338499582396, -0.03093266776814383, -0.08029310497450619, -0.3783146364511407, -0.10840340974376814, -0.0858664712190029, 0.04088245240103304, -0.09464116320670664, -0.08769930623490457, 0.36401081181847345, 0.07735551120572953, 0.2710173499054421, 0.028368807471493007, 0.34488777249780056, 0.13380164294398328, 0.06333057304180868, 0.06050201757441289, 0.3102457188771822, 0.2384131019981812, 0.11721803942150039, -0.2989675690859893, 0.020859129885422188, 0.05834682267299624] |
1,803.01298 | Inexact Successive Quadratic Approximation for Regularized Optimization | Successive quadratic approximations, or second-order proximal methods, are
useful for minimizing functions that are a sum of a smooth part and a convex,
possibly nonsmooth part that promotes regularization. Most analyses of
iteration complexity focus on the special case of proximal gradient method, or
accelerated variants thereof. There have been only a few studies of methods
that use a second-order approximation to the smooth part, due in part to the
difficulty of obtaining closed-form solutions to the subproblems at each
iteration. In fact, iterative algorithms may need to be used to find inexact
solutions to these subproblems. In this work, we present global analysis of the
iteration complexity of inexact successive quadratic approximation methods,
showing that an inexact solution of the subproblem that is within a fixed
multiplicative precision of optimality suffices to guarantee the same order of
convergence rate as the exact version, with complexity related in an intuitive
way to the measure of inexactness. Our result allows flexible choices of the
second-order term, including Newton and quasi-Newton choices, and does not
necessarily require increasing precision of the subproblem solution on later
iterations. For problems exhibiting a property related to strong convexity, the
algorithms converge at global linear rates. For general convex problems, the
convergence rate is linear in early stages, while the overall rate is $O(1/k)$.
For nonconvex problems, a first-order optimality criterion converges to zero at
a rate of $O(1/\sqrt{k})$.
| math.OC | successive quadratic approximations or secondorder proximal methods are useful for minimizing functions that are a sum of a smooth part and a convex possibly nonsmooth part that promotes regularization most analyses of iteration complexity focus on the special case of proximal gradient method or accelerated variants thereof there have been only a few studies of methods that use a secondorder approximation to the smooth part due in part to the difficulty of obtaining closedform solutions to the subproblems at each iteration in fact iterative algorithms may need to be used to find inexact solutions to these subproblems in this work we present global analysis of the iteration complexity of inexact successive quadratic approximation methods showing that an inexact solution of the subproblem that is within a fixed multiplicative precision of optimality suffices to guarantee the same order of convergence rate as the exact version with complexity related in an intuitive way to the measure of inexactness our result allows flexible choices of the secondorder term including newton and quasinewton choices and does not necessarily require increasing precision of the subproblem solution on later iterations for problems exhibiting a property related to strong convexity the algorithms converge at global linear rates for general convex problems the convergence rate is linear in early stages while the overall rate is o1k for nonconvex problems a firstorder optimality criterion converges to zero at a rate of o1sqrtk | [['successive', 'quadratic', 'approximations', 'or', 'secondorder', 'proximal', 'methods', 'are', 'useful', 'for', 'minimizing', 'functions', 'that', 'are', 'a', 'sum', 'of', 'a', 'smooth', 'part', 'and', 'a', 'convex', 'possibly', 'nonsmooth', 'part', 'that', 'promotes', 'regularization', 'most', 'analyses', 'of', 'iteration', 'complexity', 'focus', 'on', 'the', 'special', 'case', 'of', 'proximal', 'gradient', 'method', 'or', 'accelerated', 'variants', 'thereof', 'there', 'have', 'been', 'only', 'a', 'few', 'studies', 'of', 'methods', 'that', 'use', 'a', 'secondorder', 'approximation', 'to', 'the', 'smooth', 'part', 'due', 'in', 'part', 'to', 'the', 'difficulty', 'of', 'obtaining', 'closedform', 'solutions', 'to', 'the', 'subproblems', 'at', 'each', 'iteration', 'in', 'fact', 'iterative', 'algorithms', 'may', 'need', 'to', 'be', 'used', 'to', 'find', 'inexact', 'solutions', 'to', 'these', 'subproblems', 'in', 'this', 'work', 'we', 'present', 'global', 'analysis', 'of', 'the', 'iteration', 'complexity', 'of', 'inexact', 'successive', 'quadratic', 'approximation', 'methods', 'showing', 'that', 'an', 'inexact', 'solution', 'of', 'the', 'subproblem', 'that', 'is', 'within', 'a', 'fixed', 'multiplicative', 'precision', 'of', 'optimality', 'suffices', 'to', 'guarantee', 'the', 'same', 'order', 'of', 'convergence', 'rate', 'as', 'the', 'exact', 'version', 'with', 'complexity', 'related', 'in', 'an', 'intuitive', 'way', 'to', 'the', 'measure', 'of', 'inexactness', 'our', 'result', 'allows', 'flexible', 'choices', 'of', 'the', 'secondorder', 'term', 'including', 'newton', 'and', 'quasinewton', 'choices', 'and', 'does', 'not', 'necessarily', 'require', 'increasing', 'precision', 'of', 'the', 'subproblem', 'solution', 'on', 'later', 'iterations', 'for', 'problems', 'exhibiting', 'a', 'property', 'related', 'to', 'strong', 'convexity', 'the', 'algorithms', 'converge', 'at', 'global', 'linear', 'rates', 'for', 'general', 'convex', 'problems', 'the', 'convergence', 'rate', 'is', 'linear', 'in', 'early', 'stages', 'while', 'the', 'overall', 'rate', 'is', 'o1k', 'for', 'nonconvex', 'problems', 'a', 'firstorder', 'optimality', 'criterion', 'converges', 'to', 'zero', 'at', 'a', 'rate', 'of', 'o1sqrtk']] | [-0.11106696579397492, -0.04182748697873489, -0.1003375338278551, 0.06295618461345047, -0.08953754562792636, -0.17414304656236404, 0.06610577909951398, 0.37364356478780125, -0.3244793718813643, -0.24367454712670855, 0.15410423641095075, -0.23930171473245807, -0.14180988301483058, 0.1844305222546242, -0.10160472356642361, 0.09900576964894094, 0.07855666483564566, 0.02489517687903837, -0.1489356262339559, -0.31700602251898435, 0.25701331226315044, 0.0482076527830613, 0.23022191813255585, 0.03797630362548414, 0.13101645058833233, -0.043733334002912426, 0.02296154817582264, 0.04003635504959519, -0.091989922620809, 0.11610497234892819, 0.30178648570368605, 0.1632908289170876, 0.4102604007768113, -0.4149461882268858, -0.1478613557497863, 0.1396125195494977, 0.17194593908433112, 0.10213402877241981, -0.05324888270090498, -0.18326949992875644, 0.11081794780766983, -0.08496314170870274, -0.12199007649806053, -0.11678543389283216, -0.06199455298603285, 0.061957163815916205, -0.34658132585978674, 0.09433268271726376, 0.08251765195621065, 0.01742814410709708, -0.0669113155097157, -0.13040448897847978, 0.05714182098508041, 0.059430753174657604, 0.11144303259951394, 0.05649917453623381, 0.0914023281684617, -0.09868088864437564, -0.1055675857193776, 0.35519439073943015, -0.05489079337996779, -0.23569158276307192, 0.19910146693785, -0.06978942889944038, -0.16166072624211916, 0.1856989000255418, 0.20493523892084667, 0.20934290710692754, -0.12837393805154804, 0.1025347043392888, -0.0014702194558192732, 0.15333878518933583, 0.06418922065173639, 0.013371645712019884, 0.08888931367786146, 0.10514829410516728, 0.20428378521584678, 0.13424616402300882, 0.0002467618978386465, -0.15421252149504974, -0.31605306352876417, -0.1165576963248271, -0.1673305697924989, -0.018283727717155675, -0.14469192018154098, -0.17862242357125865, 0.3753643240679711, 0.096815766789151, 0.1623777295762569, 0.13593817979263245, 0.32236117647377205, 0.16697669503890586, 0.052563811259148364, 0.1096541954778023, 0.237257126771721, 0.11117053107066728, 0.08271027467205577, -0.24665412272010878, 0.11248079067607741, 0.18566446994779065] |
1,803.01299 | An Optimal Control Approach to Deep Learning and Applications to
Discrete-Weight Neural Networks | Deep learning is formulated as a discrete-time optimal control problem. This
allows one to characterize necessary conditions for optimality and develop
training algorithms that do not rely on gradients with respect to the trainable
parameters. In particular, we introduce the discrete-time method of successive
approximations (MSA), which is based on the Pontryagin's maximum principle, for
training neural networks. A rigorous error estimate for the discrete MSA is
obtained, which sheds light on its dynamics and the means to stabilize the
algorithm. The developed methods are applied to train, in a rather principled
way, neural networks with weights that are constrained to take values in a
discrete set. We obtain competitive performance and interestingly, very sparse
weights in the case of ternary networks, which may be useful in model
deployment in low-memory devices.
| cs.LG | deep learning is formulated as a discretetime optimal control problem this allows one to characterize necessary conditions for optimality and develop training algorithms that do not rely on gradients with respect to the trainable parameters in particular we introduce the discretetime method of successive approximations msa which is based on the pontryagins maximum principle for training neural networks a rigorous error estimate for the discrete msa is obtained which sheds light on its dynamics and the means to stabilize the algorithm the developed methods are applied to train in a rather principled way neural networks with weights that are constrained to take values in a discrete set we obtain competitive performance and interestingly very sparse weights in the case of ternary networks which may be useful in model deployment in lowmemory devices | [['deep', 'learning', 'is', 'formulated', 'as', 'a', 'discretetime', 'optimal', 'control', 'problem', 'this', 'allows', 'one', 'to', 'characterize', 'necessary', 'conditions', 'for', 'optimality', 'and', 'develop', 'training', 'algorithms', 'that', 'do', 'not', 'rely', 'on', 'gradients', 'with', 'respect', 'to', 'the', 'trainable', 'parameters', 'in', 'particular', 'we', 'introduce', 'the', 'discretetime', 'method', 'of', 'successive', 'approximations', 'msa', 'which', 'is', 'based', 'on', 'the', 'pontryagins', 'maximum', 'principle', 'for', 'training', 'neural', 'networks', 'a', 'rigorous', 'error', 'estimate', 'for', 'the', 'discrete', 'msa', 'is', 'obtained', 'which', 'sheds', 'light', 'on', 'its', 'dynamics', 'and', 'the', 'means', 'to', 'stabilize', 'the', 'algorithm', 'the', 'developed', 'methods', 'are', 'applied', 'to', 'train', 'in', 'a', 'rather', 'principled', 'way', 'neural', 'networks', 'with', 'weights', 'that', 'are', 'constrained', 'to', 'take', 'values', 'in', 'a', 'discrete', 'set', 'we', 'obtain', 'competitive', 'performance', 'and', 'interestingly', 'very', 'sparse', 'weights', 'in', 'the', 'case', 'of', 'ternary', 'networks', 'which', 'may', 'be', 'useful', 'in', 'model', 'deployment', 'in', 'lowmemory', 'devices']] | [-0.07156390320288307, 0.022747443502091548, -0.08640732742479128, 0.08570599838755945, -0.11475709975506602, -0.19420819733447084, 0.06297994272211906, 0.44257567187940533, -0.28125886040542164, -0.27686718281113304, 0.11220513690425309, -0.16558194217092628, -0.20849030679947286, 0.220279338846343, -0.1390666546173055, 0.10818683969398879, 0.10188767754218796, 0.03714202321840055, -0.07724438417547692, -0.2883059649470714, 0.267364321900955, 0.0339596192403185, 0.3122311094599409, -0.002503175542435863, 0.13722309945847938, -0.016240779493907183, 0.028605233578039617, 0.016767726935954255, -0.099466813159035, 0.1788089360793079, 0.2776935701064455, 0.14776286174133985, 0.3422071789797029, -0.4464674769604409, -0.22695629738243014, 0.1427621421722561, 0.12798645255194666, 0.126526721230193, 0.0019961384867642528, -0.26604031280184054, 0.11126941088128439, -0.11846871451813389, -0.04657077421352645, -0.13239452431937962, -0.05299146783848604, 0.04154033020533847, -0.36198048269601935, 0.03316275554772636, 0.04785768264881688, 0.014685497822056554, -0.053063728782338636, -0.11720554471354593, 0.03993146297712387, 0.1327335314250156, -0.006357095753738769, 0.014394225926618234, 0.08542458470787317, -0.09290097975771817, -0.1413100937806479, 0.37228748813327966, -0.048157315411971824, -0.25779284992974927, 0.15743510913858755, -0.01242794580475399, -0.16293973642203843, 0.10214250938345988, 0.2648798623122275, 0.13501804392559058, -0.1863887172234668, 0.03920264925435538, -0.020360645876886945, 0.15557107116998822, 0.015349476353025459, 0.01877831222814028, 0.14243247882978088, 0.22723407112238364, 0.12595162841590177, 0.14709069360679045, -0.07572050765862293, -0.1268380250160893, -0.24260371387936175, -0.09032872763716361, -0.20522396042096344, 0.00012879174700532476, -0.10085603395341561, -0.17921490384491556, 0.37511737586817506, 0.19674569045662682, 0.19390661674410556, 0.16022908508647093, 0.30488649761360703, 0.1074867547035727, 0.08682755830655382, 0.11402368893014324, 0.23972424585195823, 0.12070837782018563, 0.11907075770079356, -0.16883152988598202, 0.11255176287059757, 0.09764062443564674] |
1,803.013 | Diamond anvil cell using boron-doped diamond electrodes covered with
undoped diamond insulating layer | Diamond anvil cell using boron-doped metallic diamond electrodes covered with
undoped diamond insulating layer have been developed for electrical transport
measurements under high pressure. These designed diamonds were grown on a
bottom diamond anvil via a nanofabrication process combining microwave
plasma-assisted chemical vapor deposition and electron beam lithography. The
resistance measurements of high quality FeSe superconducting single crystal
under high pressure were successfully demonstrated by just putting the sample
and gasket on the bottom diamond anvil directly. The superconducting transition
temperature of FeSe single crystal was enhanced up to 43 K by applying
uniaxial-like pressure.
| cond-mat.supr-con | diamond anvil cell using borondoped metallic diamond electrodes covered with undoped diamond insulating layer have been developed for electrical transport measurements under high pressure these designed diamonds were grown on a bottom diamond anvil via a nanofabrication process combining microwave plasmaassisted chemical vapor deposition and electron beam lithography the resistance measurements of high quality fese superconducting single crystal under high pressure were successfully demonstrated by just putting the sample and gasket on the bottom diamond anvil directly the superconducting transition temperature of fese single crystal was enhanced up to 43 k by applying uniaxiallike pressure | [['diamond', 'anvil', 'cell', 'using', 'borondoped', 'metallic', 'diamond', 'electrodes', 'covered', 'with', 'undoped', 'diamond', 'insulating', 'layer', 'have', 'been', 'developed', 'for', 'electrical', 'transport', 'measurements', 'under', 'high', 'pressure', 'these', 'designed', 'diamonds', 'were', 'grown', 'on', 'a', 'bottom', 'diamond', 'anvil', 'via', 'a', 'nanofabrication', 'process', 'combining', 'microwave', 'plasmaassisted', 'chemical', 'vapor', 'deposition', 'and', 'electron', 'beam', 'lithography', 'the', 'resistance', 'measurements', 'of', 'high', 'quality', 'fese', 'superconducting', 'single', 'crystal', 'under', 'high', 'pressure', 'were', 'successfully', 'demonstrated', 'by', 'just', 'putting', 'the', 'sample', 'and', 'gasket', 'on', 'the', 'bottom', 'diamond', 'anvil', 'directly', 'the', 'superconducting', 'transition', 'temperature', 'of', 'fese', 'single', 'crystal', 'was', 'enhanced', 'up', 'to', '43', 'k', 'by', 'applying', 'uniaxiallike', 'pressure']] | [-0.014295057936056338, 0.2586724936783789, 0.013315764275637078, -0.1752140815932317, -0.007114632340009384, -0.23630831490686915, 0.19224083286888421, 0.5133376968231924, -0.22486099003358406, -0.32798530397183717, 0.03807240878132746, -0.36562650151392245, 0.01663318963008041, 0.17982037077122864, 0.018459310745225943, 0.155404229459933, -0.021921059889520738, -0.12412715419889131, -0.07470714447504663, -0.2697534422870686, 0.20861054294088738, 0.10596311442118059, 0.4781581566451078, 0.11130571817766201, 0.13139151619311343, -0.057230145928073434, 0.18170145488879147, 0.046980226040877246, -0.18445398616901737, 0.044231470981414646, 0.23391406972981751, -0.18040542230455878, 0.16274865268868335, -0.528861984342663, -0.3317776280752522, -0.05919940458323331, 0.060761780173708486, 0.10026830905414325, -0.1865551792545878, -0.2181736773395158, 0.10123995691537857, -0.07071062575213294, -0.08294807279363592, -0.07814342973436764, -0.18525871503949562, -0.03544453388709139, -0.19703276529710026, 0.051469748572228434, -0.015968191747038448, 0.15267873321600417, -0.08754614878822356, -0.15955438845335168, -0.10162078492601026, -0.025784208369936716, -0.14828101013560452, 0.06383301897601106, 0.3791238400847354, 0.0010919407148786047, -0.11062391240030844, 0.30616912940774665, -0.018221091989308914, 0.012491688647485793, 0.15118040609857106, -0.23801327236442568, -0.03902008982890464, 0.20644703550893378, 0.08154872975168512, 0.07412352253920695, -0.2528366401712311, 0.0642000037193437, 0.03456245057601878, 0.19845354311326716, 0.2721363753278522, -0.028759517122377107, 0.1965873484608737, 0.30583804631803896, -0.02823072611143753, 0.22451175563037395, -0.1679061983385064, 0.09231716078369225, -0.14434431645860699, -0.17468089268027626, -0.21221656729516752, 0.10658375179256371, -0.10802963906570902, -0.2038842460680555, 0.3007491768555755, 0.04016067058918007, 0.12509500861484954, -0.18724006382708855, 0.27133423629454634, 0.016356527267836353, 0.1652397192628222, -0.033024784445049284, 0.24235929633946496, 0.28217567970104357, 0.17459641061128772, -0.28584240730653737, 0.10240490125749815, -0.029151452853879396] |
1,803.01301 | Lower bound of Riesz transform kernels revisited and commutators on
stratified Lie groups | Let $\mathcal G$ be a stratified Lie group and $\{\X_j\}_{1 \leq j \leq n}$ a
basis for the left-invariant vector fields of degree one on $\mathcal G$. Let
$\Delta = \sum_{j = 1}^n \X_j^2 $ be the sub-Laplacian on $\mathcal G$ and the
$j^{\mathrm{th}}$ Riesz transform on $\mathcal G$ is defined by $R_j:= \X_j
(-\Delta)^{-\frac{1}{2}}$,
$1 \leq j \leq n$. In this paper we give a new version of the lower bound of
the kernels of Riesz transform $R_j$ and then establish the Bloom-type two
weight estimates as well as a number of endpoint characterisations for the
commutators of the Riesz transforms and BMO functions, including the
$L\log^+L(\mathcal G)$ to weak $L^1(\mathcal G)$, $H^1(\mathcal G)$ to
$L^1(\mathcal G)$ and $L^\infty(\mathcal G)$ to BMO$(\mathcal G)$. Moreover, we
also study the behaviour of the Riesz transform kernel on a special case of
stratified Lie group: the Heisenberg group, and then we obtain the weak type
$(1,1)$ characterisations for the Riesz commutators.
| math.CA | let mathcal g be a stratified lie group and x_j_1 leq j leq n a basis for the leftinvariant vector fields of degree one on mathcal g let delta sum_j 1n x_j2 be the sublaplacian on mathcal g and the jmathrmth riesz transform on mathcal g is defined by r_j x_j deltafrac12 1 leq j leq n in this paper we give a new version of the lower bound of the kernels of riesz transform r_j and then establish the bloomtype two weight estimates as well as a number of endpoint characterisations for the commutators of the riesz transforms and bmo functions including the lloglmathcal g to weak l1mathcal g h1mathcal g to l1mathcal g and linftymathcal g to bmomathcal g moreover we also study the behaviour of the riesz transform kernel on a special case of stratified lie group the heisenberg group and then we obtain the weak type 11 characterisations for the riesz commutators | [['let', 'mathcal', 'g', 'be', 'a', 'stratified', 'lie', 'group', 'and', 'x_j_1', 'leq', 'j', 'leq', 'n', 'a', 'basis', 'for', 'the', 'leftinvariant', 'vector', 'fields', 'of', 'degree', 'one', 'on', 'mathcal', 'g', 'let', 'delta', 'sum_j', '1n', 'x_j2', 'be', 'the', 'sublaplacian', 'on', 'mathcal', 'g', 'and', 'the', 'jmathrmth', 'riesz', 'transform', 'on', 'mathcal', 'g', 'is', 'defined', 'by', 'r_j', 'x_j', 'deltafrac12', '1', 'leq', 'j', 'leq', 'n', 'in', 'this', 'paper', 'we', 'give', 'a', 'new', 'version', 'of', 'the', 'lower', 'bound', 'of', 'the', 'kernels', 'of', 'riesz', 'transform', 'r_j', 'and', 'then', 'establish', 'the', 'bloomtype', 'two', 'weight', 'estimates', 'as', 'well', 'as', 'a', 'number', 'of', 'endpoint', 'characterisations', 'for', 'the', 'commutators', 'of', 'the', 'riesz', 'transforms', 'and', 'bmo', 'functions', 'including', 'the', 'lloglmathcal', 'g', 'to', 'weak', 'l1mathcal', 'g', 'h1mathcal', 'g', 'to', 'l1mathcal', 'g', 'and', 'linftymathcal', 'g', 'to', 'bmomathcal', 'g', 'moreover', 'we', 'also', 'study', 'the', 'behaviour', 'of', 'the', 'riesz', 'transform', 'kernel', 'on', 'a', 'special', 'case', 'of', 'stratified', 'lie', 'group', 'the', 'heisenberg', 'group', 'and', 'then', 'we', 'obtain', 'the', 'weak', 'type', '11', 'characterisations', 'for', 'the', 'riesz', 'commutators']] | [-0.17732357888503816, 0.12282830658155719, -0.033139914039863286, 0.029916958107302587, -0.14010226160433947, -0.10835975466685649, 0.021865292634127138, 0.3597280474416181, -0.2956703651964275, -0.20594335840467146, 0.09210508254134504, -0.3104488397507131, -0.07032412343226324, 0.185342444715644, -0.0710378586028526, -0.03983604122756743, 0.021142241265016053, 0.13121504562426042, -0.1038350422586637, -0.2332092840597338, 0.32755868885593087, -0.07340599424236156, 0.1420623718146874, 0.004984290886889486, 0.06264347610142983, 0.024670133580608915, 0.03282169478160201, -0.06337665559821366, -0.24963417615790187, 0.09112829077240153, 0.22632054940742605, 0.05363809709928723, 0.30522099682403836, -0.34507813657104386, -0.1205255460584524, 0.24495767512863953, 0.12352685393838614, -0.16304203074233717, 0.03403992133726384, -0.31660462607739165, 0.12349121509351177, -0.13879489870918868, -0.12028710765678899, -0.05912973977369713, 0.1553731342302818, 0.05208203400594785, -0.364862126073027, 0.07292814034298276, 0.13313398315126893, 0.07021051721367376, -0.01818714764127447, -0.2133614130172075, -0.0571240408793457, 0.03136151792554587, -0.06378113305092686, 0.12091315210662977, 0.024018607793217586, -0.0383242642783919, -0.05486448255848456, 0.36767428277328223, -0.11263918221069902, -0.21257788734206187, 0.05733030772725352, -0.20944664032301968, -0.16522547939877494, -0.006149359740578612, 0.12533482899463255, 0.21022380815721511, -0.04575282751637347, 0.2409327647936366, -0.1049947926372874, 0.06464666167724561, 0.0719852299654698, 0.04755026038151746, 0.03376849449781421, 0.051447523304328224, 0.14031749437532687, 0.11894865646757477, 0.010714316772589204, 0.10883008512163084, -0.38887617824708715, -0.1828071996619091, -0.2205392077513453, 0.1494690855018478, -0.17092829144630564, -0.13383678953753772, 0.3449680624541894, 0.0574267646221724, 0.1701060659008624, 0.1260372041450704, 0.1257116023977622, 0.1139521670141227, 0.028518123278284773, 0.11685079807001683, 0.07256108730669236, 0.2782131286073184, -0.04693320504537315, -0.16806743347809422, -0.09429334945352048, 0.2557711254872284] |
1,803.01302 | Distributed Nonparametric Regression under Communication Constraints | This paper studies the problem of nonparametric estimation of a smooth
function with data distributed across multiple machines. We assume an
independent sample from a white noise model is collected at each machine, and
an estimator of the underlying true function needs to be constructed at a
central machine. We place limits on the number of bits that each machine can
use to transmit information to the central machine. Our results give both
asymptotic lower bounds and matching upper bounds on the statistical risk under
various settings. We identify three regimes, depending on the relationship
among the number of machines, the size of the data available at each machine,
and the communication budget. When the communication budget is small, the
statistical risk depends solely on this communication bottleneck, regardless of
the sample size. In the regime where the communication budget is large, the
classic minimax risk in the non-distributed estimation setting is recovered. In
an intermediate regime, the statistical risk depends on both the sample size
and the communication budget.
| stat.ML cs.LG math.ST stat.TH | this paper studies the problem of nonparametric estimation of a smooth function with data distributed across multiple machines we assume an independent sample from a white noise model is collected at each machine and an estimator of the underlying true function needs to be constructed at a central machine we place limits on the number of bits that each machine can use to transmit information to the central machine our results give both asymptotic lower bounds and matching upper bounds on the statistical risk under various settings we identify three regimes depending on the relationship among the number of machines the size of the data available at each machine and the communication budget when the communication budget is small the statistical risk depends solely on this communication bottleneck regardless of the sample size in the regime where the communication budget is large the classic minimax risk in the nondistributed estimation setting is recovered in an intermediate regime the statistical risk depends on both the sample size and the communication budget | [['this', 'paper', 'studies', 'the', 'problem', 'of', 'nonparametric', 'estimation', 'of', 'a', 'smooth', 'function', 'with', 'data', 'distributed', 'across', 'multiple', 'machines', 'we', 'assume', 'an', 'independent', 'sample', 'from', 'a', 'white', 'noise', 'model', 'is', 'collected', 'at', 'each', 'machine', 'and', 'an', 'estimator', 'of', 'the', 'underlying', 'true', 'function', 'needs', 'to', 'be', 'constructed', 'at', 'a', 'central', 'machine', 'we', 'place', 'limits', 'on', 'the', 'number', 'of', 'bits', 'that', 'each', 'machine', 'can', 'use', 'to', 'transmit', 'information', 'to', 'the', 'central', 'machine', 'our', 'results', 'give', 'both', 'asymptotic', 'lower', 'bounds', 'and', 'matching', 'upper', 'bounds', 'on', 'the', 'statistical', 'risk', 'under', 'various', 'settings', 'we', 'identify', 'three', 'regimes', 'depending', 'on', 'the', 'relationship', 'among', 'the', 'number', 'of', 'machines', 'the', 'size', 'of', 'the', 'data', 'available', 'at', 'each', 'machine', 'and', 'the', 'communication', 'budget', 'when', 'the', 'communication', 'budget', 'is', 'small', 'the', 'statistical', 'risk', 'depends', 'solely', 'on', 'this', 'communication', 'bottleneck', 'regardless', 'of', 'the', 'sample', 'size', 'in', 'the', 'regime', 'where', 'the', 'communication', 'budget', 'is', 'large', 'the', 'classic', 'minimax', 'risk', 'in', 'the', 'nondistributed', 'estimation', 'setting', 'is', 'recovered', 'in', 'an', 'intermediate', 'regime', 'the', 'statistical', 'risk', 'depends', 'on', 'both', 'the', 'sample', 'size', 'and', 'the', 'communication', 'budget']] | [-0.12091539442429648, 0.06819091056266402, -0.07384165053201072, 0.060345072007861315, -0.05011700955219567, -0.13632399445427035, 0.1291901806184529, 0.3254989423296031, -0.2976972440367236, -0.3327348239445949, 0.13815593210884425, -0.28404960994992184, -0.07024058153140633, 0.20978208615252858, -0.13713288537829238, 0.05509226706755512, 0.043098889943212274, 0.0867253117615987, -0.015164411072071423, -0.3041125196155489, 0.312815994694692, 0.07434844660627492, 0.35473216961083165, 0.005401744280928088, 0.08112080863485223, 0.029576236677958685, -0.022651134886066703, -0.02821813881232896, -0.14789675904240165, 0.12191779837765566, 0.2668597001911086, 0.18178209855442914, 0.3596892799360349, -0.37984540166049985, -0.1773688357501455, 0.15622468852054547, 0.12257310382145292, 0.07206968747572426, -0.005269459539832657, -0.22104847794672583, 0.06169982979978051, -0.12259561519741136, -0.021487867717138107, 0.006415989819694968, -0.02025297568727504, 0.02539438152247492, -0.30954022727468433, 0.0445701925412697, 0.02159300010980052, 0.06460458511359962, -0.05753542018972118, -0.1310284148381256, 0.027787361465914942, 0.15955747705011164, 0.045915323188391456, -0.005545940590501927, 0.16451424541061416, -0.17073280316887093, -0.09122791506121276, 0.3308997203462401, -0.04372725080945255, -0.2090661792557084, 0.20275418765240294, -0.1288790594361832, -0.16133901513770552, 0.09397869844859301, 0.2754546506275587, 0.07702419185627471, -0.15736009084580205, 0.08390694059951997, -0.04734162538148025, 0.19902174436103773, 9.337975985973197e-05, 0.055449549486751064, 0.14506499129621422, 0.2105823606458109, 0.08989730206838645, 0.1371061591000077, -0.13732924877309843, -0.09413742885431822, -0.3144002400259898, -0.10224171426448533, -0.251953173445209, -0.0013243067571345499, -0.16809867503402262, -0.13895374379695996, 0.3365661981406019, 0.15981575508656748, 0.19996737899697004, 0.13229088084892068, 0.34793077646480763, 0.13368028938455287, 0.04532830758458551, 0.1577120854122126, 0.22719841320067644, 0.08281310112763415, 0.04768287768751821, -0.20590250990661682, 0.1373505502309212, -0.021444978915593202] |
1,803.01303 | The Leggett-Garg inequalities and the relative entropy of coherence in
the Bixon-Jortner model | We investigate the Leggett-Garg inequalities and the relative entropy of
coherence in the Bixon-Jortner model. First, we analytically derive the general
solution of the Bixon-Jortner model by a technique of the Laplace transform. So
far, only a special solution has been known for this model. The model has a
single state coupled to equally spaced quasi-continuum states. These couplings
cause discontinuities in the time evolution of the occupation probability of
each state. Second, using the analytical solution, we show that the probability
distribution of the quasi-continuum states approaches the Lorentzian function
in a period of time between the initial time and the first discontinuity.
Third, we examine violation of the Leggett-Garg inequalities and temporal
variation of the relative entropy of coherence in the model. We prove that both
the inequalities and the relative entropy are invariant under transformations
of the energy-level detuning of the single state.
| quant-ph | we investigate the leggettgarg inequalities and the relative entropy of coherence in the bixonjortner model first we analytically derive the general solution of the bixonjortner model by a technique of the laplace transform so far only a special solution has been known for this model the model has a single state coupled to equally spaced quasicontinuum states these couplings cause discontinuities in the time evolution of the occupation probability of each state second using the analytical solution we show that the probability distribution of the quasicontinuum states approaches the lorentzian function in a period of time between the initial time and the first discontinuity third we examine violation of the leggettgarg inequalities and temporal variation of the relative entropy of coherence in the model we prove that both the inequalities and the relative entropy are invariant under transformations of the energylevel detuning of the single state | [['we', 'investigate', 'the', 'leggettgarg', 'inequalities', 'and', 'the', 'relative', 'entropy', 'of', 'coherence', 'in', 'the', 'bixonjortner', 'model', 'first', 'we', 'analytically', 'derive', 'the', 'general', 'solution', 'of', 'the', 'bixonjortner', 'model', 'by', 'a', 'technique', 'of', 'the', 'laplace', 'transform', 'so', 'far', 'only', 'a', 'special', 'solution', 'has', 'been', 'known', 'for', 'this', 'model', 'the', 'model', 'has', 'a', 'single', 'state', 'coupled', 'to', 'equally', 'spaced', 'quasicontinuum', 'states', 'these', 'couplings', 'cause', 'discontinuities', 'in', 'the', 'time', 'evolution', 'of', 'the', 'occupation', 'probability', 'of', 'each', 'state', 'second', 'using', 'the', 'analytical', 'solution', 'we', 'show', 'that', 'the', 'probability', 'distribution', 'of', 'the', 'quasicontinuum', 'states', 'approaches', 'the', 'lorentzian', 'function', 'in', 'a', 'period', 'of', 'time', 'between', 'the', 'initial', 'time', 'and', 'the', 'first', 'discontinuity', 'third', 'we', 'examine', 'violation', 'of', 'the', 'leggettgarg', 'inequalities', 'and', 'temporal', 'variation', 'of', 'the', 'relative', 'entropy', 'of', 'coherence', 'in', 'the', 'model', 'we', 'prove', 'that', 'both', 'the', 'inequalities', 'and', 'the', 'relative', 'entropy', 'are', 'invariant', 'under', 'transformations', 'of', 'the', 'energylevel', 'detuning', 'of', 'the', 'single', 'state']] | [-0.1313009651454344, 0.0986830220168635, -0.11218721925421324, 0.09555966527223561, 0.024013909103017147, -0.1351226704667182, 0.06756974305090023, 0.3269660795388156, -0.276282275119503, -0.267798563873727, 0.07249677674334547, -0.2782784063051684, -0.11137456087991977, 0.13534357849738166, -0.025666307849324728, 0.11609493417359174, 0.026003572324367417, 0.07961067608366273, -0.09862049465220779, -0.20115315618172083, 0.325400365057261, 0.017393968954733382, 0.2967573371747738, 0.05377762101722996, 0.11050400011917602, -0.02057286519375837, 0.029073636540911822, -0.005652071117130044, -0.13736929204237203, 0.09912090551041143, 0.16429940783833344, 0.13253906631064027, 0.2812070299054764, -0.40646085538582444, -0.19894355975971748, 0.11623349994475227, 0.1004698241340022, 0.1417351548770468, -0.00691767551215391, -0.3046464359312803, -0.005184655486006443, -0.15273205334422726, -0.1334187432179508, -0.06433443531827772, 0.01924049406797204, 0.0355305381179851, -0.24297077732267536, 0.14459478059043623, 0.05803040997518907, 0.00137358222855255, -0.0899024500977248, -0.05014437551479404, -0.016667301674080016, 0.11198296327756284, 0.052237341875820985, -0.02663106950357148, 0.06215146680885594, -0.09555857335631927, -0.11118861797508107, 0.3347803707527992, -0.09445829128157603, -0.22225033592636864, 0.12428160405188339, -0.18087640100107719, -0.125809635211114, 0.07324210933030086, 0.1374465364911785, 0.16896286591479223, -0.14632309111128625, 0.08317771679817457, -0.04442978401553549, 0.17941135816174011, 0.06999268628774874, 0.06880252546677047, 0.1515847710662917, 0.10946109728913193, 0.06724066158584383, 0.1915440505421529, -0.12889770642624632, -0.14478707601545915, -0.3486688261315839, -0.18856006816399526, -0.21208649322913628, 0.0301163820932581, -0.09487374984517323, -0.15824718705110558, 0.4392445131319843, 0.12676483767796054, 0.18687260910320058, 0.06773004488866419, 0.2632449160470334, 0.18764948139081977, 0.037030020450925204, 0.04413704409850889, 0.26457288859998934, 0.15671561297813863, 0.07233121927368315, -0.26484233204595115, 0.09677630551765379, 0.07440381195421701] |
1,803.01304 | Dirac quantum walks on triangular and honeycomb lattices | In this paper, we present a detailed study on discrete-time Dirac quantum
walks (DQWs) on triangular and honeycomb lattices. At the continuous limit,
these DQWs coincide with the Dirac equation. Their differences in the discrete
regime are analyzed through the dispersion relations, with special emphasis on
Zitterbewegung. An extension which couples these walks to arbitrary discrete
electromagnetic field is also proposed and the resulting Bloch oscillations are
discussed.
| quant-ph | in this paper we present a detailed study on discretetime dirac quantum walks dqws on triangular and honeycomb lattices at the continuous limit these dqws coincide with the dirac equation their differences in the discrete regime are analyzed through the dispersion relations with special emphasis on zitterbewegung an extension which couples these walks to arbitrary discrete electromagnetic field is also proposed and the resulting bloch oscillations are discussed | [['in', 'this', 'paper', 'we', 'present', 'a', 'detailed', 'study', 'on', 'discretetime', 'dirac', 'quantum', 'walks', 'dqws', 'on', 'triangular', 'and', 'honeycomb', 'lattices', 'at', 'the', 'continuous', 'limit', 'these', 'dqws', 'coincide', 'with', 'the', 'dirac', 'equation', 'their', 'differences', 'in', 'the', 'discrete', 'regime', 'are', 'analyzed', 'through', 'the', 'dispersion', 'relations', 'with', 'special', 'emphasis', 'on', 'zitterbewegung', 'an', 'extension', 'which', 'couples', 'these', 'walks', 'to', 'arbitrary', 'discrete', 'electromagnetic', 'field', 'is', 'also', 'proposed', 'and', 'the', 'resulting', 'bloch', 'oscillations', 'are', 'discussed']] | [-0.16087653285905937, 0.19303446413237801, -0.04738597530762062, 0.07458462550424455, -0.1035182005212204, -0.13617278199286803, 0.024700161790379378, 0.4153679912800298, -0.23163013502626734, -0.20983874375986702, 0.09528282071422677, -0.29507773332914117, -0.1859929151216741, 0.20103859202936292, -0.0024383159676183235, 0.061685639474650514, 0.019721026176258045, 0.03633659868501127, -0.08347446124945931, -0.22088842551559484, 0.30938627162729115, 0.00912442839505863, 0.29988599712412584, 0.013291788506595528, 0.08492005554623627, 0.039658469812232346, 0.007750636856893406, -0.000855816199499018, -0.15688769769129815, 0.07624579142601065, 0.1660312032327056, -0.10355649517013636, 0.19361665636739311, -0.45111995942288025, -0.1978756183594027, 0.06274060062680613, 0.1469271456658402, 0.11856882570496322, -0.06119776293738088, -0.3698669401654864, 0.0006232660551391103, -0.11293909494826734, -0.11918217379271108, -0.04338583672720501, -0.02312368612483089, 0.046608228164533264, -0.18534798216184273, 0.06296634224460884, 0.06066668014425565, 0.08026344483882628, -0.03735426622990738, -0.08709422611247968, -0.022709724568652317, 0.0654695654520765, -0.005617080684340394, -0.04514541972414864, 0.046909582540940714, -0.04085215027375585, -0.1542332166504553, 0.4362946491798057, -0.05522152214475414, -0.27243527070180895, 0.17229970254223137, -0.1739389214746873, -0.1415505828883718, 0.07681577961706995, 0.1865152074434959, 0.06487337068435461, -0.12072824386825018, 0.14671827110920704, -0.11318580261157717, 0.06686724196804468, 0.0479844847064027, 0.08718256372958422, 0.23421854955856414, 0.11434387116049252, 0.04005711209302878, 0.13780977292095914, -0.04097614609225489, -0.19066551862531067, -0.32848350519506153, -0.12526261790052934, -0.19691879714510457, 0.060168965705944336, -0.07540668495215976, -0.20043907572022257, 0.4224205047220868, 0.13933345302597017, 0.15366789843092726, 0.04543556908645448, 0.20356671939439633, 0.20748116812833092, -0.032538510876132506, 0.055971063081147694, 0.2261076884700314, 0.19663148143273942, 0.1012935636099428, -0.2583040742217289, -0.06489445875837084, 0.0781334145234295] |
1,803.01305 | Optimality of Gaussian receivers for practical Gaussian distributed
sensing | We study the problem of estimating a function of many parameters acquired by
sensors that are distributed in space, e.g., the spatial gradient of a field.
We restrict ourselves to a setting where the distributed sensors are probed
with experimentally practical resources, namely, field modes in separable
displaced thermal states, and focus on the optimal design of the optical
receiver that measures the phase-shifted returning field modes. Within this
setting, we demonstrate that a locally optimal measurement strategy, i.e., one
that achieves the standard quantum limit for all phase shift values, is a
Gaussian measurement, and moreover, one that is separable. We also demonstrate
the utility of adaptive phase measurements for making estimation performance
robust in cases where one has little prior information on the unknown
parameters. In this setting we identify a regime where it is beneficial to use
structured optical receivers that entangle the received modes before
measurement.
| quant-ph | we study the problem of estimating a function of many parameters acquired by sensors that are distributed in space eg the spatial gradient of a field we restrict ourselves to a setting where the distributed sensors are probed with experimentally practical resources namely field modes in separable displaced thermal states and focus on the optimal design of the optical receiver that measures the phaseshifted returning field modes within this setting we demonstrate that a locally optimal measurement strategy ie one that achieves the standard quantum limit for all phase shift values is a gaussian measurement and moreover one that is separable we also demonstrate the utility of adaptive phase measurements for making estimation performance robust in cases where one has little prior information on the unknown parameters in this setting we identify a regime where it is beneficial to use structured optical receivers that entangle the received modes before measurement | [['we', 'study', 'the', 'problem', 'of', 'estimating', 'a', 'function', 'of', 'many', 'parameters', 'acquired', 'by', 'sensors', 'that', 'are', 'distributed', 'in', 'space', 'eg', 'the', 'spatial', 'gradient', 'of', 'a', 'field', 'we', 'restrict', 'ourselves', 'to', 'a', 'setting', 'where', 'the', 'distributed', 'sensors', 'are', 'probed', 'with', 'experimentally', 'practical', 'resources', 'namely', 'field', 'modes', 'in', 'separable', 'displaced', 'thermal', 'states', 'and', 'focus', 'on', 'the', 'optimal', 'design', 'of', 'the', 'optical', 'receiver', 'that', 'measures', 'the', 'phaseshifted', 'returning', 'field', 'modes', 'within', 'this', 'setting', 'we', 'demonstrate', 'that', 'a', 'locally', 'optimal', 'measurement', 'strategy', 'ie', 'one', 'that', 'achieves', 'the', 'standard', 'quantum', 'limit', 'for', 'all', 'phase', 'shift', 'values', 'is', 'a', 'gaussian', 'measurement', 'and', 'moreover', 'one', 'that', 'is', 'separable', 'we', 'also', 'demonstrate', 'the', 'utility', 'of', 'adaptive', 'phase', 'measurements', 'for', 'making', 'estimation', 'performance', 'robust', 'in', 'cases', 'where', 'one', 'has', 'little', 'prior', 'information', 'on', 'the', 'unknown', 'parameters', 'in', 'this', 'setting', 'we', 'identify', 'a', 'regime', 'where', 'it', 'is', 'beneficial', 'to', 'use', 'structured', 'optical', 'receivers', 'that', 'entangle', 'the', 'received', 'modes', 'before', 'measurement']] | [-0.12855849754530937, 0.1384286761066566, -0.07095544903849561, 0.014442015916574746, -0.058764355462044476, -0.19100141397987802, 0.07984894421805318, 0.4200919405370951, -0.26849609115781886, -0.23891381052633126, 0.13379533345500627, -0.26204356910660864, -0.13765875466788807, 0.20299083403622112, -0.08582164520475392, 0.043427346731865935, 0.06142630870764454, 0.05103065822273493, -0.059878315382326644, -0.22958113504573702, 0.3151671697463219, 0.03258571398211643, 0.30329277077689765, -0.03149429745661716, 0.13474286355776713, 0.041116624829980235, 0.007846468451122442, 0.02063888254486907, -0.10820766552729764, 0.08482293862267397, 0.2851191995665431, 0.1231262443594945, 0.3107172805505494, -0.3873456439794973, -0.2304532279074192, 0.15044437895839413, 0.12121852176021397, 0.12828454619583984, -0.05607343684416264, -0.2594719163576762, 0.04879031433723867, -0.12731339113165935, -0.06509085244188706, -0.06698693472271164, -0.004246103084490945, -0.018697109043908616, -0.3275293379991005, 0.04181333052130261, 0.00836814617117246, 0.021963364693025747, -0.052163436625463265, -0.08110010092457136, 0.04028306444796423, 0.13735131379837792, -0.00772047189840426, 0.008276276083197445, 0.15978493819323678, -0.12080196586747964, -0.104802197983178, 0.34392272679756086, -0.05625735867302865, -0.23204439375549554, 0.1409958892967552, -0.1531471780159821, -0.1191114468810459, 0.091824940101554, 0.19954976491009196, 0.11638647657974313, -0.12698045296759422, 0.07676061406033113, -0.042132508996874096, 0.18471266139143458, 0.04637433674496909, 0.10952248082185785, 0.14620488113568475, 0.15238433088641615, 0.1111947824266584, 0.16281064674879114, -0.1134810059859107, -0.09849206962933144, -0.2649420078781744, -0.13147795559217532, -0.23305904859909787, -0.01093648633453995, -0.07174954837479162, -0.1233362948273619, 0.39588805606899163, 0.19594327461595337, 0.18380613178946079, 0.0432901249329249, 0.3639630842395127, 0.09907741932741677, 0.05026116534757118, 0.08939091319528719, 0.29946405832034845, 0.1016456038535883, 0.06846306905499659, -0.19356631670729257, 0.055310329167793194, -0.04006675118114799] |
1,803.01306 | Deformation and singularities of maximal surfaces with planar curvature
lines | Minimal surfaces with planar curvature lines in the Euclidean space have been
studied since the late 19th century. On the other hand, the classification of
maximal surfaces with planar curvature lines in the Lorentz-Minkowski space has
only recently been given. In this paper, we use an alternative method not only
to refine the classification of maximal surfaces with planar curvature lines,
but also to show that there exists a deformation consisting exactly of all such
surfaces. Furthermore, we investigate the types of singularities that occur on
maximal surfaces with planar curvature lines. Finally, by considering the
conjugate of maximal surfaces with planar curvature lines, we obtain analogous
results for maximal surfaces that are also affine minimal surfaces.
| math.DG | minimal surfaces with planar curvature lines in the euclidean space have been studied since the late 19th century on the other hand the classification of maximal surfaces with planar curvature lines in the lorentzminkowski space has only recently been given in this paper we use an alternative method not only to refine the classification of maximal surfaces with planar curvature lines but also to show that there exists a deformation consisting exactly of all such surfaces furthermore we investigate the types of singularities that occur on maximal surfaces with planar curvature lines finally by considering the conjugate of maximal surfaces with planar curvature lines we obtain analogous results for maximal surfaces that are also affine minimal surfaces | [['minimal', 'surfaces', 'with', 'planar', 'curvature', 'lines', 'in', 'the', 'euclidean', 'space', 'have', 'been', 'studied', 'since', 'the', 'late', '19th', 'century', 'on', 'the', 'other', 'hand', 'the', 'classification', 'of', 'maximal', 'surfaces', 'with', 'planar', 'curvature', 'lines', 'in', 'the', 'lorentzminkowski', 'space', 'has', 'only', 'recently', 'been', 'given', 'in', 'this', 'paper', 'we', 'use', 'an', 'alternative', 'method', 'not', 'only', 'to', 'refine', 'the', 'classification', 'of', 'maximal', 'surfaces', 'with', 'planar', 'curvature', 'lines', 'but', 'also', 'to', 'show', 'that', 'there', 'exists', 'a', 'deformation', 'consisting', 'exactly', 'of', 'all', 'such', 'surfaces', 'furthermore', 'we', 'investigate', 'the', 'types', 'of', 'singularities', 'that', 'occur', 'on', 'maximal', 'surfaces', 'with', 'planar', 'curvature', 'lines', 'finally', 'by', 'considering', 'the', 'conjugate', 'of', 'maximal', 'surfaces', 'with', 'planar', 'curvature', 'lines', 'we', 'obtain', 'analogous', 'results', 'for', 'maximal', 'surfaces', 'that', 'are', 'also', 'affine', 'minimal', 'surfaces']] | [-0.1269595575554726, 0.10547863725589242, -0.03178643272855343, 0.022129433960892644, -0.08692756465150632, -0.14931294687776867, -0.03391829030249968, 0.42347354480885285, -0.19839503137697267, -0.24219029137275666, 0.12354409651389012, -0.2929674297985103, -0.20505966308216253, 0.23122166831078184, -0.1380998119373575, 0.037083311460148066, 0.04782635785448246, 0.05587298354595645, -0.10548572420763473, -0.3072529795746773, 0.39408530587724483, -0.038598002842030465, 0.25841272255389863, 0.10442084009544207, 0.08744237604590817, -0.019753029928184472, 0.020459640785080627, 0.09446311265212269, -0.2232417295493248, 0.1438414948976511, 0.2100391597288032, 0.05535945460661991, 0.14121756546645084, -0.42445632108511067, -0.2956440725391651, 0.19795239544831789, 0.11450935282911627, 0.08245603517334685, -0.04876607154400494, -0.20349719241643563, 0.06617491601958361, -0.053790961153423175, -0.1874810712825921, -0.0349496853354777, 0.046227491389100366, -0.006412561123187725, -0.12207208540784116, 0.013916562902880434, 0.10862118281169325, 0.12655828828708485, -0.03269063301472009, -0.08283331539505759, -0.10483138707394783, 0.09525306882639216, 0.0465133035213201, 0.01236632285026722, 0.024929455143168695, -0.09236621076408295, -0.1393782220637569, 0.3467210308035724, -0.09205920661801599, -0.24056662988458943, 0.1799384244900738, -0.17838001133810377, -0.12035724041688964, 0.15997476054705742, 0.13986565281724572, 0.18124506176791638, -0.09725799729140142, 0.16299449405274713, -0.0666189706351003, 0.07502940045590074, 0.17133594091392607, -0.028522569517023925, 0.174427153964519, 0.06561794835660192, 0.11717787962685475, 0.13266626324277753, -0.10314025716760601, -0.06849554394029526, -0.33398195031361705, -0.23294518918244758, -0.15089754494500116, 0.044066364268108636, -0.07777163990908581, -0.22440491246584898, 0.3795095977540582, 0.019319161078216046, 0.22910335127455303, 0.05172066079277513, 0.24023634962972382, 0.056802431010028236, 0.09223252580238459, 0.13165519321655744, 0.26037824689211625, 0.1188533231158319, -0.019395905276203256, -0.15779555501798406, -0.008985459529914154, 0.13122421597791278] |
1,803.01307 | Angora: Efficient Fuzzing by Principled Search | Fuzzing is a popular technique for finding software bugs. However, the
performance of the state-of-the-art fuzzers leaves a lot to be desired. Fuzzers
based on symbolic execution produce quality inputs but run slow, while fuzzers
based on random mutation run fast but have difficulty producing quality inputs.
We propose Angora, a new mutation-based fuzzer that outperforms the
state-of-the-art fuzzers by a wide margin. The main goal of Angora is to
increase branch coverage by solving path constraints without symbolic
execution. To solve path constraints efficiently, we introduce several key
techniques: scalable byte-level taint tracking, context-sensitive branch count,
search based on gradient descent, and input length exploration. On the LAVA-M
data set, Angora found almost all the injected bugs, found more bugs than any
other fuzzer that we compared with, and found eight times as many bugs as the
second-best fuzzer in the program who. Angora also found 103 bugs that the LAVA
authors injected but could not trigger. We also tested Angora on eight popular,
mature open source programs. Angora found 6, 52, 29, 40 and 48 new bugs in
file, jhead, nm, objdump and size, respectively. We measured the coverage of
Angora and evaluated how its key techniques contribute to its impressive
performance.
| cs.CR | fuzzing is a popular technique for finding software bugs however the performance of the stateoftheart fuzzers leaves a lot to be desired fuzzers based on symbolic execution produce quality inputs but run slow while fuzzers based on random mutation run fast but have difficulty producing quality inputs we propose angora a new mutationbased fuzzer that outperforms the stateoftheart fuzzers by a wide margin the main goal of angora is to increase branch coverage by solving path constraints without symbolic execution to solve path constraints efficiently we introduce several key techniques scalable bytelevel taint tracking contextsensitive branch count search based on gradient descent and input length exploration on the lavam data set angora found almost all the injected bugs found more bugs than any other fuzzer that we compared with and found eight times as many bugs as the secondbest fuzzer in the program who angora also found 103 bugs that the lava authors injected but could not trigger we also tested angora on eight popular mature open source programs angora found 6 52 29 40 and 48 new bugs in file jhead nm objdump and size respectively we measured the coverage of angora and evaluated how its key techniques contribute to its impressive performance | [['fuzzing', 'is', 'a', 'popular', 'technique', 'for', 'finding', 'software', 'bugs', 'however', 'the', 'performance', 'of', 'the', 'stateoftheart', 'fuzzers', 'leaves', 'a', 'lot', 'to', 'be', 'desired', 'fuzzers', 'based', 'on', 'symbolic', 'execution', 'produce', 'quality', 'inputs', 'but', 'run', 'slow', 'while', 'fuzzers', 'based', 'on', 'random', 'mutation', 'run', 'fast', 'but', 'have', 'difficulty', 'producing', 'quality', 'inputs', 'we', 'propose', 'angora', 'a', 'new', 'mutationbased', 'fuzzer', 'that', 'outperforms', 'the', 'stateoftheart', 'fuzzers', 'by', 'a', 'wide', 'margin', 'the', 'main', 'goal', 'of', 'angora', 'is', 'to', 'increase', 'branch', 'coverage', 'by', 'solving', 'path', 'constraints', 'without', 'symbolic', 'execution', 'to', 'solve', 'path', 'constraints', 'efficiently', 'we', 'introduce', 'several', 'key', 'techniques', 'scalable', 'bytelevel', 'taint', 'tracking', 'contextsensitive', 'branch', 'count', 'search', 'based', 'on', 'gradient', 'descent', 'and', 'input', 'length', 'exploration', 'on', 'the', 'lavam', 'data', 'set', 'angora', 'found', 'almost', 'all', 'the', 'injected', 'bugs', 'found', 'more', 'bugs', 'than', 'any', 'other', 'fuzzer', 'that', 'we', 'compared', 'with', 'and', 'found', 'eight', 'times', 'as', 'many', 'bugs', 'as', 'the', 'secondbest', 'fuzzer', 'in', 'the', 'program', 'who', 'angora', 'also', 'found', '103', 'bugs', 'that', 'the', 'lava', 'authors', 'injected', 'but', 'could', 'not', 'trigger', 'we', 'also', 'tested', 'angora', 'on', 'eight', 'popular', 'mature', 'open', 'source', 'programs', 'angora', 'found', '6', '52', '29', '40', 'and', '48', 'new', 'bugs', 'in', 'file', 'jhead', 'nm', 'objdump', 'and', 'size', 'respectively', 'we', 'measured', 'the', 'coverage', 'of', 'angora', 'and', 'evaluated', 'how', 'its', 'key', 'techniques', 'contribute', 'to', 'its', 'impressive', 'performance']] | [-0.1009487692026053, 0.02301479929789382, -0.06921619641599222, 0.08543300073227812, -0.0904056243575294, -0.20729993025955296, 0.08425272307567187, 0.3849577909446697, -0.20262013349058894, -0.3943212658945304, 0.13423906891161938, -0.27326812263605976, -0.09087348872979881, 0.26127333219153853, -0.11393604624265832, 0.09626863912542569, 0.1336403082128364, -0.004628375082262861, -0.04117233251379015, -0.33834464632817984, 0.2100967256438024, 0.0754354614254773, 0.2798100484958479, 0.015530627834800612, 0.08534944754971924, -0.030712403337698806, -0.04878430304972371, 0.001475523835116423, -0.059917263564413625, 0.09808531971138656, 0.28412658666533913, 0.23441803400909797, 0.2845986039210945, -0.3956661100721737, -0.1417259930109429, 0.07540758956798274, 0.1520953194454859, 0.0704290796267054, -0.0475386200680204, -0.2713851792591888, 0.13017130419044334, -0.17829547544758284, -0.05350882146827209, -0.08523318052421607, 0.017022716029737126, 0.007108626450789601, -0.2043846094092083, -0.022472813953958285, 0.02169414902229293, 0.06011668534541679, 0.009784367690743203, -0.1857408314748709, -0.01131360894833594, 0.11469443710242856, 0.040699903985435625, 0.09315763865855281, 0.17703122873350385, -0.11872659976691452, -0.1791147604441057, 0.3306967077976028, -0.052544021299378185, -0.14563381338992448, 0.2126734608249155, -0.026166130902143706, -0.17320331559511856, 0.18145166284205458, 0.18415714213358172, 0.13093080958907508, -0.1765799334560016, 0.01656143511940878, 0.022054451716998918, 0.24497402516826877, 0.0928612283954573, -0.0026172162265289778, 0.1510883226886592, 0.19075056294208642, 0.059054870291355886, 0.1283338688599497, -0.09858813157782366, -0.06833497291970628, -0.19823746679209414, -0.11679451010306945, -0.11059918244796764, -0.006349048330445672, -0.08469622181599615, -0.156795228789769, 0.38898027530727697, 0.23099664759368113, 0.13665689629924238, 0.11269507565030559, 0.32076240817214646, 0.019110693514711383, 0.1425584054761103, 0.1771846516057849, 0.167124407772503, -0.017321751886788774, 0.10716670595308701, -0.19205192375154378, 0.1326196421058246, 0.018676518592334802] |
1,803.01308 | How do hydrogen bonds break in supercooled water?: Detecting pathways
not going through the saddle point of two-dimensional potential of mean force | Supercooled water exhibits remarkably slow dynamics similar to the behavior
observed for various glass-forming liquids. The local order of tetrahedral
structures due to hydrogen-bonds (H-bonds) increases with decreasing
temperature. Thus, it is important to clarify the temperature dependence of the
H-bond breakage process. This was investigated here using molecular dynamics
simulations of TIP4P supercooled water. The two-dimensional (2D) potential of
mean force (PMF) is presented using combinations of intermolecular distance and
angle between two water molecules. The saddle point of the 2D PMF suggests the
presence of the transition state that distinguishes between H-bond and non
H-bond states. However, we observed pathways not going through this saddle
point particularly at supercooled states, which are due to translational,
rather than rotational motions of the molecules. We quantified the
characteristic time scales of rotational and translational H-bond breakages.
The time scale of translational H-bond breakage shows a non-Arrhenius
temperature dependence comparable to that of the H-bond lifetime. This time
scale is relevant for the temperature dependence of the transmission
coefficient based on the transition state theory. The translational H-bond
breakage is also related to cage-jumps observed in glass-forming liquids, which
mostly involve spatially correlated molecules. Our findings warrant further
exploration of an appropriate free-energy surface or reaction coordinates
beyond the geometrical variables of the water dimer to describe a possible
saddle point related to collective jump motions.
| cond-mat.dis-nn cond-mat.soft physics.chem-ph | supercooled water exhibits remarkably slow dynamics similar to the behavior observed for various glassforming liquids the local order of tetrahedral structures due to hydrogenbonds hbonds increases with decreasing temperature thus it is important to clarify the temperature dependence of the hbond breakage process this was investigated here using molecular dynamics simulations of tip4p supercooled water the twodimensional 2d potential of mean force pmf is presented using combinations of intermolecular distance and angle between two water molecules the saddle point of the 2d pmf suggests the presence of the transition state that distinguishes between hbond and non hbond states however we observed pathways not going through this saddle point particularly at supercooled states which are due to translational rather than rotational motions of the molecules we quantified the characteristic time scales of rotational and translational hbond breakages the time scale of translational hbond breakage shows a nonarrhenius temperature dependence comparable to that of the hbond lifetime this time scale is relevant for the temperature dependence of the transmission coefficient based on the transition state theory the translational hbond breakage is also related to cagejumps observed in glassforming liquids which mostly involve spatially correlated molecules our findings warrant further exploration of an appropriate freeenergy surface or reaction coordinates beyond the geometrical variables of the water dimer to describe a possible saddle point related to collective jump motions | [['supercooled', 'water', 'exhibits', 'remarkably', 'slow', 'dynamics', 'similar', 'to', 'the', 'behavior', 'observed', 'for', 'various', 'glassforming', 'liquids', 'the', 'local', 'order', 'of', 'tetrahedral', 'structures', 'due', 'to', 'hydrogenbonds', 'hbonds', 'increases', 'with', 'decreasing', 'temperature', 'thus', 'it', 'is', 'important', 'to', 'clarify', 'the', 'temperature', 'dependence', 'of', 'the', 'hbond', 'breakage', 'process', 'this', 'was', 'investigated', 'here', 'using', 'molecular', 'dynamics', 'simulations', 'of', 'tip4p', 'supercooled', 'water', 'the', 'twodimensional', '2d', 'potential', 'of', 'mean', 'force', 'pmf', 'is', 'presented', 'using', 'combinations', 'of', 'intermolecular', 'distance', 'and', 'angle', 'between', 'two', 'water', 'molecules', 'the', 'saddle', 'point', 'of', 'the', '2d', 'pmf', 'suggests', 'the', 'presence', 'of', 'the', 'transition', 'state', 'that', 'distinguishes', 'between', 'hbond', 'and', 'non', 'hbond', 'states', 'however', 'we', 'observed', 'pathways', 'not', 'going', 'through', 'this', 'saddle', 'point', 'particularly', 'at', 'supercooled', 'states', 'which', 'are', 'due', 'to', 'translational', 'rather', 'than', 'rotational', 'motions', 'of', 'the', 'molecules', 'we', 'quantified', 'the', 'characteristic', 'time', 'scales', 'of', 'rotational', 'and', 'translational', 'hbond', 'breakages', 'the', 'time', 'scale', 'of', 'translational', 'hbond', 'breakage', 'shows', 'a', 'nonarrhenius', 'temperature', 'dependence', 'comparable', 'to', 'that', 'of', 'the', 'hbond', 'lifetime', 'this', 'time', 'scale', 'is', 'relevant', 'for', 'the', 'temperature', 'dependence', 'of', 'the', 'transmission', 'coefficient', 'based', 'on', 'the', 'transition', 'state', 'theory', 'the', 'translational', 'hbond', 'breakage', 'is', 'also', 'related', 'to', 'cagejumps', 'observed', 'in', 'glassforming', 'liquids', 'which', 'mostly', 'involve', 'spatially', 'correlated', 'molecules', 'our', 'findings', 'warrant', 'further', 'exploration', 'of', 'an', 'appropriate', 'freeenergy', 'surface', 'or', 'reaction', 'coordinates', 'beyond', 'the', 'geometrical', 'variables', 'of', 'the', 'water', 'dimer', 'to', 'describe', 'a', 'possible', 'saddle', 'point', 'related', 'to', 'collective', 'jump', 'motions']] | [-0.13883845300006215, 0.21341335812400888, -0.09827629605167333, 0.024989589950865008, -0.004365442969304111, -0.13556507132099277, 0.0621475743396981, 0.36236884567603866, -0.29970393340253004, -0.25094940406935556, 0.01318441928586773, -0.26254425867643605, -0.158631456942073, 0.08583659609991758, 0.058470116310802824, 0.04193458453976616, -0.016644731608851413, -0.009147527596464247, -0.05775157953472184, -0.17044503688105447, 0.26021493732410556, 0.0968339758102437, 0.29915895967237055, 0.12780303922513017, 0.08337014586348752, -0.04930088343077647, 0.05911082997980494, 0.014169547292502622, -0.17946703871536687, 0.0679081457133829, 0.23025749533345724, -0.025927644133584442, 0.20091093135332422, -0.4608736801767788, -0.2547232634180026, 0.07192789311583121, 0.12842453172379464, 0.14448721169693662, 0.002553697783046768, -0.25625663017022554, -0.014214869437897246, -0.07938696752535179, -0.17059202056771028, -0.07837639746243699, 0.05697554866700167, 0.04003835349820812, -0.17681407700417498, 0.19766865268515435, 0.03894276944005729, 0.12292061837589634, -0.09528858159943152, -0.11211433918755834, -0.08532154720316092, 0.10224247785507552, 0.1165740524256762, 0.02989624165080126, 0.2433543506776914, -0.11290727837123475, -0.06005348738628007, 0.4327746628238986, -0.046237675345050126, -0.14942489991101734, 0.2765265076481488, -0.15442499406344723, -0.12167992535004098, 0.24096142910795088, 0.11265082624491438, 0.09786692049861553, -0.13453521960556308, -0.0015215389375953237, 0.02767677115999894, 0.21012128781343822, 0.08704528569484994, 0.012090523775051614, 0.2142438915299343, 0.19588455326239845, 0.04745083577914296, 0.14796684584819428, -0.13588235230158066, -0.2085753028734741, -0.225998759821128, -0.16594935034507735, -0.20127673251720676, 0.029291731703584185, -0.08857669726817871, -0.16427196399048885, 0.3657539695268497, 0.11201033152091051, 0.18274791827051168, 0.05795576742301429, 0.2053470610117074, 0.0692191518553175, 0.05504757257377995, 0.02680730194177678, 0.24457485436661436, 0.13619598939736274, 0.09504754320576987, -0.33008419886963175, 0.12713826959536942, 0.027591567718315804] |
1,803.01309 | Spin hydrodynamics in amorphous magnets | Spin superfluidity, i.e., coherent spin transport mediated by topologically
stable textures, is limited by parasitic anisotropies rooted in relativistic
interactions and spatial inhomogeneities. Since structural disorder in
amorphous magnets can average out the effect of these undesired couplings, we
propose this class of materials as platforms for superfluid spin transport. We
establish nonlinear equations describing the hydrodynamics of spin in
insulating amorphous magnets, where the currents are defined in terms of
coherent rotations of a noncollinear texture. Our theory includes dissipation
and nonequilibrium torques at the interface with metallic reservoirs. This
framework allows us to determine different regimes of coherent dynamics and
their salient features in nonlocal magneto-transport measurements. Our work
paves the way for future studies on macroscopic spin dynamics in materials with
frustrated interactions.
| cond-mat.mes-hall | spin superfluidity ie coherent spin transport mediated by topologically stable textures is limited by parasitic anisotropies rooted in relativistic interactions and spatial inhomogeneities since structural disorder in amorphous magnets can average out the effect of these undesired couplings we propose this class of materials as platforms for superfluid spin transport we establish nonlinear equations describing the hydrodynamics of spin in insulating amorphous magnets where the currents are defined in terms of coherent rotations of a noncollinear texture our theory includes dissipation and nonequilibrium torques at the interface with metallic reservoirs this framework allows us to determine different regimes of coherent dynamics and their salient features in nonlocal magnetotransport measurements our work paves the way for future studies on macroscopic spin dynamics in materials with frustrated interactions | [['spin', 'superfluidity', 'ie', 'coherent', 'spin', 'transport', 'mediated', 'by', 'topologically', 'stable', 'textures', 'is', 'limited', 'by', 'parasitic', 'anisotropies', 'rooted', 'in', 'relativistic', 'interactions', 'and', 'spatial', 'inhomogeneities', 'since', 'structural', 'disorder', 'in', 'amorphous', 'magnets', 'can', 'average', 'out', 'the', 'effect', 'of', 'these', 'undesired', 'couplings', 'we', 'propose', 'this', 'class', 'of', 'materials', 'as', 'platforms', 'for', 'superfluid', 'spin', 'transport', 'we', 'establish', 'nonlinear', 'equations', 'describing', 'the', 'hydrodynamics', 'of', 'spin', 'in', 'insulating', 'amorphous', 'magnets', 'where', 'the', 'currents', 'are', 'defined', 'in', 'terms', 'of', 'coherent', 'rotations', 'of', 'a', 'noncollinear', 'texture', 'our', 'theory', 'includes', 'dissipation', 'and', 'nonequilibrium', 'torques', 'at', 'the', 'interface', 'with', 'metallic', 'reservoirs', 'this', 'framework', 'allows', 'us', 'to', 'determine', 'different', 'regimes', 'of', 'coherent', 'dynamics', 'and', 'their', 'salient', 'features', 'in', 'nonlocal', 'magnetotransport', 'measurements', 'our', 'work', 'paves', 'the', 'way', 'for', 'future', 'studies', 'on', 'macroscopic', 'spin', 'dynamics', 'in', 'materials', 'with', 'frustrated', 'interactions']] | [-0.21179096708591613, 0.2610039321543087, -0.04743787501513633, 0.034466427842354666, -0.044476541965859866, -0.13670708276774912, -0.014670095749251131, 0.3617333492618941, -0.2783219178303307, -0.2799318809365292, -0.020081980352563457, -0.3046902524149609, -0.14450114341600548, 0.16598152763964164, 0.04281664803339583, 0.044899716186404155, -0.027156211332314543, -0.10568015776678091, -0.08955334909149401, -0.16040349459748657, 0.29813001105110976, -0.013973834754396525, 0.319197707927771, 0.07898870154860474, 0.09538438919902084, 0.013246243047187961, 0.060772713890949646, 0.020844769228013264, -0.1523110401991751, 0.07138998221812977, 0.2986418339571664, -0.119302007049093, 0.16233807092621214, -0.5312030285389887, -0.2560457223342613, 0.008926502587865032, 0.13186696324648062, 0.2064895631231752, -0.04648236010596895, -0.3005558043008759, -0.014591781232627995, -0.1548199619624823, -0.1256043263526249, -0.17218225043163532, -0.00615005036224685, 0.009512741305303597, -0.24443947063345048, 0.14296527311117166, 0.10460945608330861, 0.08565139496169563, -0.06327125610412276, -0.06649265620147898, -0.0647787339523405, 0.088011313595676, 0.0191735391512454, -0.027661378718986517, 0.19327958297753145, -0.17478928093184967, -0.15459462761553744, 0.3654427734898433, -0.04083828826154035, -0.17652128350048785, 0.20206142959207118, -0.18457628026722916, -0.09784478610307569, 0.1244179547601749, 0.18112309177966035, 0.13207956752739847, -0.18950960779976514, 0.048541558071664194, 0.0032375071619060777, 0.10078968600340424, -0.010878238675465423, 0.11395504741397287, 0.3189023745150143, 0.22781576354810523, 0.03582914327252804, 0.1585012923483552, -0.09946536458474362, -0.09940907048682372, -0.24273625308913843, -0.13020525409263514, -0.1897384588429261, 0.08381243358691415, -0.06574604753370208, -0.1620352630363038, 0.4140634917476702, 0.21587904514227477, 0.1153515849543351, -0.060528093446341774, 0.26041185462548, 0.03281201232254269, 0.06682387628917774, 0.03551475049573041, 0.2516120899014086, 0.19545120397390472, 0.08967217821849599, -0.3083360617110018, 0.09090096561426651, 0.021547005955307258] |
1,803.0131 | Quantized Curvature in Loop Quantum Gravity | A hyperlink is a finite set of non-intersecting simple closed curves in
$\mathbb{R} \times \mathbb{R}^3$. Let $S$ be an orientable surface in
$\mathbb{R} \times \mathbb{R}^3$. The Einstein-Hilbert action $S(e,\omega)$ is
defined on the vierbein $e$ and a
$\mathfrak{su}(2)\times\mathfrak{su}(2)$-valued connection $\omega$, which are
the dynamical variables in General Relativity. Define a functional
$F_S(\omega)$, by integrating the curvature $d\omega + \omega \wedge \omega$
over the surface $S$, which is $\mathfrak{su}(2)\times\mathfrak{su}(2)$-valued.
We integrate $F_S(\omega)$ against a holonomy operator of a hyperlink $L$,
disjoint from $S$, and the exponential of the Einstein-Hilbert action, over the
space of vierbeins $e$ and $\mathfrak{su}(2)\times\mathfrak{su}(2)$-valued
connections $\omega$. Using our earlier work done on Chern-Simons path
integrals in $\mathbb{R}^3$, we will write this infinite dimensional path
integral as the limit of a sequence of Chern-Simons integrals. Our main result
shows that the quantized curvature can be computed from the linking number
between $L$ and $S$.
| math-ph math.MP | a hyperlink is a finite set of nonintersecting simple closed curves in mathbbr times mathbbr3 let s be an orientable surface in mathbbr times mathbbr3 the einsteinhilbert action seomega is defined on the vierbein e and a mathfraksu2timesmathfraksu2valued connection omega which are the dynamical variables in general relativity define a functional f_somega by integrating the curvature domega omega wedge omega over the surface s which is mathfraksu2timesmathfraksu2valued we integrate f_somega against a holonomy operator of a hyperlink l disjoint from s and the exponential of the einsteinhilbert action over the space of vierbeins e and mathfraksu2timesmathfraksu2valued connections omega using our earlier work done on chernsimons path integrals in mathbbr3 we will write this infinite dimensional path integral as the limit of a sequence of chernsimons integrals our main result shows that the quantized curvature can be computed from the linking number between l and s | [['a', 'hyperlink', 'is', 'a', 'finite', 'set', 'of', 'nonintersecting', 'simple', 'closed', 'curves', 'in', 'mathbbr', 'times', 'mathbbr3', 'let', 's', 'be', 'an', 'orientable', 'surface', 'in', 'mathbbr', 'times', 'mathbbr3', 'the', 'einsteinhilbert', 'action', 'seomega', 'is', 'defined', 'on', 'the', 'vierbein', 'e', 'and', 'a', 'mathfraksu2timesmathfraksu2valued', 'connection', 'omega', 'which', 'are', 'the', 'dynamical', 'variables', 'in', 'general', 'relativity', 'define', 'a', 'functional', 'f_somega', 'by', 'integrating', 'the', 'curvature', 'domega', 'omega', 'wedge', 'omega', 'over', 'the', 'surface', 's', 'which', 'is', 'mathfraksu2timesmathfraksu2valued', 'we', 'integrate', 'f_somega', 'against', 'a', 'holonomy', 'operator', 'of', 'a', 'hyperlink', 'l', 'disjoint', 'from', 's', 'and', 'the', 'exponential', 'of', 'the', 'einsteinhilbert', 'action', 'over', 'the', 'space', 'of', 'vierbeins', 'e', 'and', 'mathfraksu2timesmathfraksu2valued', 'connections', 'omega', 'using', 'our', 'earlier', 'work', 'done', 'on', 'chernsimons', 'path', 'integrals', 'in', 'mathbbr3', 'we', 'will', 'write', 'this', 'infinite', 'dimensional', 'path', 'integral', 'as', 'the', 'limit', 'of', 'a', 'sequence', 'of', 'chernsimons', 'integrals', 'our', 'main', 'result', 'shows', 'that', 'the', 'quantized', 'curvature', 'can', 'be', 'computed', 'from', 'the', 'linking', 'number', 'between', 'l', 'and', 's']] | [-0.24480705645091674, 0.13629037394911667, -0.10267295168348022, 0.016502482460004155, -0.10425834919137138, -0.10259291250991368, 0.021987845822419787, 0.3121663822908072, -0.25272843602823314, -0.21213334670511785, 0.04336518862030723, -0.29970273811213827, -0.14201209428101466, 0.16062573200235, -0.10189822188845568, -0.00622181203851307, 0.05668448244214996, 0.12840998963732925, -0.0754546891829533, -0.23603396286367329, 0.33676085310460596, -0.08245512061439768, 0.15398684382386557, 0.021941278332474373, 0.1160097164069335, 0.0007374314721543472, -0.03250367401275211, 0.048343926799846684, -0.17974592267131226, 0.10946486508669136, 0.22996761202909885, 0.06540971839111755, 0.22665627869301952, -0.41142831637257044, -0.2362345247171246, 0.13399097558527767, 0.12397179882843178, -0.03891173916399948, 0.07695534884428176, -0.32223439018626315, 0.04911862910966148, -0.13611949624907277, -0.11888279095316515, -0.02880000024773441, 0.11866940232970706, -0.02682023241438649, -0.2549204245873994, 0.027784535221729453, 0.06489145170495897, 0.05496806119262547, -0.047030856272765806, -0.10179748686545013, -0.07649557286762743, 0.0752848551992874, 0.04591566646940537, 0.19833431620202907, 0.08960733375547883, -0.04013086415378912, -0.0924591744201375, 0.3531161140442103, -0.14846589953322745, -0.2844328456200086, 0.0863860852925198, -0.15081227826814647, -0.09996312177069225, 0.10942162243141369, 0.10636435557886229, 0.19117809234226082, -0.10758636224285498, 0.2535222125568564, -0.07772248166644216, 0.06996771625334305, 0.12492515973525344, -0.018336634898568027, 0.1802460908515491, 0.09678168202932742, 0.10105649924387673, 0.1010688664253241, -0.026562445025265842, -0.07033214432845165, -0.41973780474619016, -0.18503666080378153, -0.16870321627295987, 0.18911551772714494, -0.13889923449434743, -0.16053976990397323, 0.34966947006426385, 0.024971480586751645, 0.20960079181704905, 0.12023772679308391, 0.22966716445533078, 0.11400820374160343, 0.05708812418152819, 0.09330659029431197, 0.07504872128960084, 0.1750425950809662, 0.006774255844692771, -0.20988024106913514, -0.07457696406782924, 0.15731252044751928] |
1,803.01311 | Reliability evaluation of folded hypercubes in terms of component
connectivity | The component connectivity is the generalization of connectivity which is an
parameter for the reliability evaluation of interconnection networks. The
$g$-component connectivity $c\kappa_{g}(G)$ of a non-complete connected graph
$G$ is the minimum number of vertices whose deletion results in a graph with at
least $g$ components. The results in [Component connectivity of the hypercubes,
International Journal of Computer Mathematics 89 (2012) 137-145] by Hsu et al.
determines the component connectivity of the hypercubes. As an invariant of the
hypercube, we determine the $(g+1)$-component connectivity of the folded
hypercube $c\kappa_{g}(FQ_{n})=g(n+1)-\frac{1}{2}g(g+1)+1$ for $1\leq g \leq
n+1, n\geq 8$ in this paper.
| math.CO | the component connectivity is the generalization of connectivity which is an parameter for the reliability evaluation of interconnection networks the gcomponent connectivity ckappa_gg of a noncomplete connected graph g is the minimum number of vertices whose deletion results in a graph with at least g components the results in component connectivity of the hypercubes international journal of computer mathematics 89 2012 137145 by hsu et al determines the component connectivity of the hypercubes as an invariant of the hypercube we determine the g1component connectivity of the folded hypercube ckappa_gfq_ngn1frac12gg11 for 1leq g leq n1 ngeq 8 in this paper | [['the', 'component', 'connectivity', 'is', 'the', 'generalization', 'of', 'connectivity', 'which', 'is', 'an', 'parameter', 'for', 'the', 'reliability', 'evaluation', 'of', 'interconnection', 'networks', 'the', 'gcomponent', 'connectivity', 'ckappa_gg', 'of', 'a', 'noncomplete', 'connected', 'graph', 'g', 'is', 'the', 'minimum', 'number', 'of', 'vertices', 'whose', 'deletion', 'results', 'in', 'a', 'graph', 'with', 'at', 'least', 'g', 'components', 'the', 'results', 'in', 'component', 'connectivity', 'of', 'the', 'hypercubes', 'international', 'journal', 'of', 'computer', 'mathematics', '89', '2012', '137145', 'by', 'hsu', 'et', 'al', 'determines', 'the', 'component', 'connectivity', 'of', 'the', 'hypercubes', 'as', 'an', 'invariant', 'of', 'the', 'hypercube', 'we', 'determine', 'the', 'g1component', 'connectivity', 'of', 'the', 'folded', 'hypercube', 'ckappa_gfq_ngn1frac12gg11', 'for', '1leq', 'g', 'leq', 'n1', 'ngeq', '8', 'in', 'this', 'paper']] | [-0.217129898639886, 0.09420902415846573, 0.004574339665276439, -0.02224011364589004, -0.059249374868446274, -0.0736551000393535, 0.028272889221070248, 0.3435330404728455, -0.2403639154459693, -0.3509490532702521, 0.09880005719483291, -0.30528316250757165, -0.19963784536444826, 0.08517845524965148, -0.12884583982982134, 0.003948262667185382, 0.09417759196244573, 0.10006385751950898, 0.0384520912837041, -0.2882058723909339, 0.2696140954270959, 0.03674751128021039, 0.21608893343884694, 0.07415106163703297, 0.03832464122556542, 0.05354953184723854, -0.019622099713275307, 0.046537001644212164, -0.17751860825442953, 0.13217551165603494, 0.2694705443775379, 0.16417427711482896, 0.27817064901127625, -0.37934397294333105, -0.17339792980714455, 0.15996539143257235, 0.0978183110783759, -0.031178913641671992, 0.08367613277545101, -0.23497763354527323, 0.1256349532815971, -0.1362114604513504, -0.11634089163455524, 0.04250162932531614, 0.12428523467755631, 0.012596207945362517, -0.2878434928673271, 0.014718865745357777, 0.10471909304982738, 0.08753269477578884, 0.042579952382335536, -0.1564205247124559, -0.07764743316036306, 0.12337773594956257, -0.09334615081989843, 0.09033653768465708, 0.04882545628045735, -0.1474587138325564, -0.192946009484953, 0.32641931008057373, 0.030381278258650318, -0.13450760131113623, 0.10275562140894563, -0.08613448818888221, -0.22368881240683167, 0.0907033812891888, 0.16095851218621982, 0.0909810043283199, -0.11586839510618072, 0.1509344504852044, -0.0922626007348299, 0.12898018197646657, 0.09371985752919787, -0.006148369492668854, 0.08662918993565989, 0.18748618293994743, 0.14802602017964667, 0.1571742400670988, -0.05665076971299162, 0.014720503615190911, -0.2879815512875977, -0.11719954817702896, -0.26486634411113824, 0.05054452722083385, -0.2050554571967376, -0.18107083934898438, 0.4502184476115202, 0.06639693829378016, 0.18229084618781743, 0.09311414537583723, 0.21474728582328872, 0.04239145735842421, 0.036868476990218224, 0.19746836429265768, 0.14785901741369775, 0.2420726564786348, 0.010815793746396116, -0.16559577086866883, 0.04440853151639825, 0.1300956147575849] |
1,803.01312 | Component edge connectivity of the folded hypercube | The $g$-component edge connectivity $c\lambda_g(G)$ of a non-complete graph
$G$ is the minimum number of edges whose deletion results in a graph with at
least $g$ components. In this paper, we determine the component edge
connectivity of the folded hypercube
$c\lambda_{g+1}(FQ_{n})=(n+1)g-(\sum\limits_{i=0}^{s}t_i2^{t_i-1}+\sum\limits_{i=0}^{s}
i\cdot 2^{t_i})$ for $g\leq 2^{[\frac{n+1}2]}$ and $n\geq 5$, where $g$ be a
positive integer and $g=\sum\limits_{i=0}^{s}2^{t_i}$ be the decomposition of
$g$ such that $t_0=[\log_{2}{g}],$ and
$t_i=[\log_2({g-\sum\limits_{r=0}^{i-1}2^{t_r}})]$ for $i\geq 1$.
| math.CO | the gcomponent edge connectivity clambda_gg of a noncomplete graph g is the minimum number of edges whose deletion results in a graph with at least g components in this paper we determine the component edge connectivity of the folded hypercube clambda_g1fq_nn1gsumlimits_i0st_i2t_i1sumlimits_i0s icdot 2t_i for gleq 2fracn12 and ngeq 5 where g be a positive integer and gsumlimits_i0s2t_i be the decomposition of g such that t_0log_2g and t_ilog_2gsumlimits_r0i12t_r for igeq 1 | [['the', 'gcomponent', 'edge', 'connectivity', 'clambda_gg', 'of', 'a', 'noncomplete', 'graph', 'g', 'is', 'the', 'minimum', 'number', 'of', 'edges', 'whose', 'deletion', 'results', 'in', 'a', 'graph', 'with', 'at', 'least', 'g', 'components', 'in', 'this', 'paper', 'we', 'determine', 'the', 'component', 'edge', 'connectivity', 'of', 'the', 'folded', 'hypercube', 'clambda_g1fq_nn1gsumlimits_i0st_i2t_i1sumlimits_i0s', 'icdot', '2t_i', 'for', 'gleq', '2fracn12', 'and', 'ngeq', '5', 'where', 'g', 'be', 'a', 'positive', 'integer', 'and', 'gsumlimits_i0s2t_i', 'be', 'the', 'decomposition', 'of', 'g', 'such', 'that', 't_0log_2g', 'and', 't_ilog_2gsumlimits_r0i12t_r', 'for', 'igeq', '1']] | [-0.2174088423489593, 0.14197597935344675, -0.04390404061996378, -0.033846443075162824, -0.06285984666465083, -0.15994147155288374, 0.028026249005051795, 0.37984451623560744, -0.28377980808727443, -0.308782059346413, 0.1464750032628217, -0.31572189909638837, -0.1765608151545166, 0.05634615597955417, -0.07503743878623936, -0.020670591591624543, 0.11002425977494568, 0.14181048369209748, 0.04995775854695239, -0.2331169563885851, 0.2898366604349576, -0.08772827609209344, 0.11847026264149463, 0.0864266603057331, 0.050496565920184366, 0.02438581939350115, 0.04124507852975512, 0.0837426638463512, -0.18667040650746003, 0.08154114598437445, 0.2974453704082407, 0.1261090729094576, 0.24301476268738043, -0.38389546392136253, -0.15304474913864397, 0.21541234164033085, 0.0977529797819443, -0.03691962662196602, 0.04672105495410506, -0.1771689085799153, 0.24416494012984913, -0.11804367206786992, -0.08961315427950467, 0.06174251656193519, 0.15438168213586323, -0.01836154531338252, -0.33001575389062054, -0.005079278991615865, 0.10211436482495628, 0.0553636285912944, 0.04904795368202031, -0.20735056226840243, -0.0859990992830717, 0.11575967278986354, -0.09594609913256136, 0.11671535877212591, 0.024803520158457104, -0.1392782219863875, -0.13550102506997064, 0.338188702458865, -0.03921456658281386, -0.14620865299366415, 0.0768704322326812, -0.1499645474832505, -0.2187696178589249, 0.1055547977812239, 0.12872343315393664, 0.1426104160491377, -0.038811398790130625, 0.12201781543717516, -0.08617837211932056, 0.1045391683728667, 0.1062104193988489, 0.00390320840961067, 0.1215107906900812, 0.1371317592311243, 0.18925622788344754, 0.13453790354833473, -0.04081611355650239, 0.13088444837921998, -0.32388208084739745, -0.14676604393753223, -0.2711091681776452, 0.08450485786124773, -0.20342312397337992, -0.17884165709256195, 0.4583498283755034, 0.06544081670290325, 0.2038569832511712, 0.11556704288523179, 0.2207987234578468, 0.0737751481574378, 0.03943429204082349, 0.21646226869052043, 0.08080582878028508, 0.19499889289727435, -0.11272202874533832, -0.18080531282612355, 0.00567679922824027, 0.09937905416154535] |
1,803.01313 | A remark on global solutions to random 3D vorticity equations for small
initial data | In this paper, we prove that the solution constructed in \cite{BR16}
satisfies the stochastic vorticity equations with the stochastic integration
being understood in the sense of the integration of controlled rough path
introduced in \cite{G04}. As a result, we obtain the existence and uniqueness
of the global solutions to the stochastic vorticity equations in 3D case for
the small initial data independent of time, which can be viewed as a stochastic
version of the Kato-Fujita result (see \cite{KF62}).
| math.PR | in this paper we prove that the solution constructed in citebr16 satisfies the stochastic vorticity equations with the stochastic integration being understood in the sense of the integration of controlled rough path introduced in citeg04 as a result we obtain the existence and uniqueness of the global solutions to the stochastic vorticity equations in 3d case for the small initial data independent of time which can be viewed as a stochastic version of the katofujita result see citekf62 | [['in', 'this', 'paper', 'we', 'prove', 'that', 'the', 'solution', 'constructed', 'in', 'citebr16', 'satisfies', 'the', 'stochastic', 'vorticity', 'equations', 'with', 'the', 'stochastic', 'integration', 'being', 'understood', 'in', 'the', 'sense', 'of', 'the', 'integration', 'of', 'controlled', 'rough', 'path', 'introduced', 'in', 'citeg04', 'as', 'a', 'result', 'we', 'obtain', 'the', 'existence', 'and', 'uniqueness', 'of', 'the', 'global', 'solutions', 'to', 'the', 'stochastic', 'vorticity', 'equations', 'in', '3d', 'case', 'for', 'the', 'small', 'initial', 'data', 'independent', 'of', 'time', 'which', 'can', 'be', 'viewed', 'as', 'a', 'stochastic', 'version', 'of', 'the', 'katofujita', 'result', 'see', 'citekf62']] | [-0.14553696767905275, 0.04965632744259327, -0.08588273287121509, 0.06409660801511712, -0.0240024039710595, -0.057890670764184485, -0.021317074772259977, 0.2638604976079502, -0.3461194539291633, -0.26797676219831446, 0.1436691358795616, -0.20050217321998365, -0.1427509515999338, 0.18733420030991044, -0.09366434774789456, 0.044581156173670616, 0.07878026128998278, 0.012890816641014975, -0.0548943773484663, -0.223110387246502, 0.32741002292951216, -0.010854440451775854, 0.21095088924079933, 0.008538224860220342, 0.16751628755623274, 0.0025543886664751415, -0.04657843281794969, 0.07788951569740232, -0.16215106098949233, 0.09506986930815352, 0.2459944427466473, 0.1009403513688429, 0.28123682803424027, -0.45164014430515265, -0.188278199085412, 0.0982036755948856, 0.14438271954359888, 0.14156588503455342, -0.06358479780484796, -0.28967408880880857, 0.10698023856290288, -0.12626901024801507, -0.2250080294277821, -0.05582038163383667, -0.020237482782151248, 0.0907879537978285, -0.29331729890829, 0.1073921866387733, 0.11172859782566996, 0.0003058599226327764, -0.12010833859833814, -0.02922197021040562, -0.046242295097358325, 0.08903943786296893, 0.08154628319489593, 0.04794822111599953, 0.04386534323487934, -0.11988684863191904, -0.11376983286164752, 0.35878778928639116, -0.14226523493542462, -0.2914771178007327, 0.1341994621891629, -0.10939769824413029, -0.1331482300836895, 0.08783631089672043, 0.16768193893713523, 0.1581988363853983, -0.16386138905796246, 0.09999691966741749, -0.08016891533357871, 0.10425645293120446, 0.07813200101608762, 0.017692275792108598, 0.10054434305719631, 0.1750715556176933, 0.1531878663478671, 0.14574047274151314, -0.03967387467776928, -0.1489853985808991, -0.35288092003178756, -0.1889039143083013, -0.17420039620766467, 0.10868882319915134, -0.1022937580110502, -0.21429744421353414, 0.35510519577341304, 0.16063834607878044, 0.19206681500214176, 0.07930591072717279, 0.2496867808544807, 0.20025210101094498, 0.015285167541052844, 0.08411868188429523, 0.23017837034185995, 0.13889403716421914, 0.18941476034957008, -0.16541398109040675, 0.08274225937831844, 0.13981392515219143] |
1,803.01314 | Training Deep Learning Based Denoisers without Ground Truth Data | Recently developed deep-learning-based denoisers often outperform
state-of-the-art conventional denoisers such as the BM3D. They are typically
trained to minimize the mean squared error (MSE) between the output image of a
deep neural network (DNN) and a ground truth image. Thus, it is important for
deep-learning-based denoisers to use high quality noiseless ground truth data
for high performance. However, it is often challenging or even infeasible to
obtain noiseless images in some applications. Here, we propose a method based
on Stein's unbiased risk estimator (SURE) for training DNN denoisers based only
on the use of noisy images in the training data with Gaussian noise. We
demonstrate that our SURE-based method, without the use of ground truth data,
is able to train DNN denoisers to yield performances close to those networks
trained with ground truth for both grayscale and color images. We also propose
a SURE-based refining method with a noisy test image for further performance
improvement. Our quick refining method outperformed conventional BM3D, deep
image prior, and often the networks trained with ground truth. Potential
extension of our SURE-based methods to Poisson noise model was also
investigated.
| cs.CV stat.ML | recently developed deeplearningbased denoisers often outperform stateoftheart conventional denoisers such as the bm3d they are typically trained to minimize the mean squared error mse between the output image of a deep neural network dnn and a ground truth image thus it is important for deeplearningbased denoisers to use high quality noiseless ground truth data for high performance however it is often challenging or even infeasible to obtain noiseless images in some applications here we propose a method based on steins unbiased risk estimator sure for training dnn denoisers based only on the use of noisy images in the training data with gaussian noise we demonstrate that our surebased method without the use of ground truth data is able to train dnn denoisers to yield performances close to those networks trained with ground truth for both grayscale and color images we also propose a surebased refining method with a noisy test image for further performance improvement our quick refining method outperformed conventional bm3d deep image prior and often the networks trained with ground truth potential extension of our surebased methods to poisson noise model was also investigated | [['recently', 'developed', 'deeplearningbased', 'denoisers', 'often', 'outperform', 'stateoftheart', 'conventional', 'denoisers', 'such', 'as', 'the', 'bm3d', 'they', 'are', 'typically', 'trained', 'to', 'minimize', 'the', 'mean', 'squared', 'error', 'mse', 'between', 'the', 'output', 'image', 'of', 'a', 'deep', 'neural', 'network', 'dnn', 'and', 'a', 'ground', 'truth', 'image', 'thus', 'it', 'is', 'important', 'for', 'deeplearningbased', 'denoisers', 'to', 'use', 'high', 'quality', 'noiseless', 'ground', 'truth', 'data', 'for', 'high', 'performance', 'however', 'it', 'is', 'often', 'challenging', 'or', 'even', 'infeasible', 'to', 'obtain', 'noiseless', 'images', 'in', 'some', 'applications', 'here', 'we', 'propose', 'a', 'method', 'based', 'on', 'steins', 'unbiased', 'risk', 'estimator', 'sure', 'for', 'training', 'dnn', 'denoisers', 'based', 'only', 'on', 'the', 'use', 'of', 'noisy', 'images', 'in', 'the', 'training', 'data', 'with', 'gaussian', 'noise', 'we', 'demonstrate', 'that', 'our', 'surebased', 'method', 'without', 'the', 'use', 'of', 'ground', 'truth', 'data', 'is', 'able', 'to', 'train', 'dnn', 'denoisers', 'to', 'yield', 'performances', 'close', 'to', 'those', 'networks', 'trained', 'with', 'ground', 'truth', 'for', 'both', 'grayscale', 'and', 'color', 'images', 'we', 'also', 'propose', 'a', 'surebased', 'refining', 'method', 'with', 'a', 'noisy', 'test', 'image', 'for', 'further', 'performance', 'improvement', 'our', 'quick', 'refining', 'method', 'outperformed', 'conventional', 'bm3d', 'deep', 'image', 'prior', 'and', 'often', 'the', 'networks', 'trained', 'with', 'ground', 'truth', 'potential', 'extension', 'of', 'our', 'surebased', 'methods', 'to', 'poisson', 'noise', 'model', 'was', 'also', 'investigated']] | [0.014708539416577907, -0.060429129854685834, -0.05288817019011545, 0.14118420377921975, -0.10017518281149747, -0.20954825067692387, 0.048880069967239134, 0.5017908180272708, -0.23029116679343484, -0.3270380731261465, 0.12139303821154059, -0.2458925833575107, -0.19023259205027654, 0.20913719185577925, -0.1919729501967849, 0.16927930767277397, 0.18444959104989947, 0.0717058852314949, -0.07997024035324113, -0.34898818358503564, 0.2777374268006233, 0.05779816980081891, 0.38091942375796217, -0.05843429970717739, 0.15475053907189298, -0.03285778998096864, 0.03911264747899446, -0.01788966039318331, -0.026579297104074622, 0.15678283566438783, 0.3041900630479538, 0.19410984290473324, 0.3255275840600652, -0.4088922369504167, -0.2136259994492115, 0.1406450084290437, 0.09852250756806023, 0.13243748492971863, -0.024162461386582946, -0.38694961603370404, 0.10395424890079065, -0.12998559429205112, 0.04369812813507373, -0.1856209505099042, -0.08774733653114307, 0.0009313313013833937, -0.3704908067180264, 0.07575126169768903, 0.060073227695469814, 0.06206959835754367, -0.06097776016661076, -0.16865129838196902, 0.03480284538255223, 0.15744793860326892, 0.007747623679523546, 0.08611633119383647, 0.11705577484412139, -0.18464219942845414, -0.10064603637913944, 0.3127845703156024, -0.09075249029293415, -0.22413135987896754, 0.18065519178516523, -0.017146898428558984, -0.10498540483975924, 0.15006489686227292, 0.1949384315540233, 0.0807421525529716, -0.1558176027610898, -0.02134425463048511, -0.031086405213441578, 0.19625316626862974, 0.02507849688321272, 0.0176587093972616, 0.10570940186247049, 0.2365476795977923, 0.04998064796961043, 0.15861104078395594, -0.20666530703523656, -0.025623772446672, -0.18740738206793384, -0.10434447511059222, -0.27943736952679454, -0.016099848745701213, -0.0873288743656225, -0.19941003150331676, 0.3400686130588574, 0.2844933589209392, 0.1951765388435614, 0.15272910688172586, 0.42065926264691095, 0.011141097885356235, 0.10214092226458653, 0.08400821960869155, 0.2151834867622075, 0.057073216967945616, 0.08309917703210827, -0.11937409817110947, 0.07744671399198141, 0.04633449302906151] |
1,803.01315 | Systematic derivation of realistic spin-models for beyond-Heisenberg
solids | We present a systematic derivation of effective lattice spin Hamiltonians
derived from a rotationally invariant multi-orbital Hubbard model including a
term ensuring Hund's rule coupling. The Hamiltonians are derived down-folding
the fermionic degrees of freedom of the Hubbard model into the proper
low-energy spin sector using L\"owdin partitioning, which will be outlined in
detail for the case of two sites and two orbitals at each site. Correcting the
ground state systematically up to fourth order in the hopping of electrons, we
find for spin $S\geq 1$ a biquadratic, three-spin and four-spin interaction
beyond the conventional Heisenberg term. Comparing the puzzling energy spectrum
of the magnetic states for a single Fe monolayer on Ru(0001), obtained from
density functional theory, with the spin Hamiltonians taken at the limit of
classical spins, we show that the previously ignored three-spin interaction can
be comparable in size to the conventional Heisenberg exchange.
| cond-mat.mes-hall | we present a systematic derivation of effective lattice spin hamiltonians derived from a rotationally invariant multiorbital hubbard model including a term ensuring hunds rule coupling the hamiltonians are derived downfolding the fermionic degrees of freedom of the hubbard model into the proper lowenergy spin sector using lowdin partitioning which will be outlined in detail for the case of two sites and two orbitals at each site correcting the ground state systematically up to fourth order in the hopping of electrons we find for spin sgeq 1 a biquadratic threespin and fourspin interaction beyond the conventional heisenberg term comparing the puzzling energy spectrum of the magnetic states for a single fe monolayer on ru0001 obtained from density functional theory with the spin hamiltonians taken at the limit of classical spins we show that the previously ignored threespin interaction can be comparable in size to the conventional heisenberg exchange | [['we', 'present', 'a', 'systematic', 'derivation', 'of', 'effective', 'lattice', 'spin', 'hamiltonians', 'derived', 'from', 'a', 'rotationally', 'invariant', 'multiorbital', 'hubbard', 'model', 'including', 'a', 'term', 'ensuring', 'hunds', 'rule', 'coupling', 'the', 'hamiltonians', 'are', 'derived', 'downfolding', 'the', 'fermionic', 'degrees', 'of', 'freedom', 'of', 'the', 'hubbard', 'model', 'into', 'the', 'proper', 'lowenergy', 'spin', 'sector', 'using', 'lowdin', 'partitioning', 'which', 'will', 'be', 'outlined', 'in', 'detail', 'for', 'the', 'case', 'of', 'two', 'sites', 'and', 'two', 'orbitals', 'at', 'each', 'site', 'correcting', 'the', 'ground', 'state', 'systematically', 'up', 'to', 'fourth', 'order', 'in', 'the', 'hopping', 'of', 'electrons', 'we', 'find', 'for', 'spin', 'sgeq', '1', 'a', 'biquadratic', 'threespin', 'and', 'fourspin', 'interaction', 'beyond', 'the', 'conventional', 'heisenberg', 'term', 'comparing', 'the', 'puzzling', 'energy', 'spectrum', 'of', 'the', 'magnetic', 'states', 'for', 'a', 'single', 'fe', 'monolayer', 'on', 'ru0001', 'obtained', 'from', 'density', 'functional', 'theory', 'with', 'the', 'spin', 'hamiltonians', 'taken', 'at', 'the', 'limit', 'of', 'classical', 'spins', 'we', 'show', 'that', 'the', 'previously', 'ignored', 'threespin', 'interaction', 'can', 'be', 'comparable', 'in', 'size', 'to', 'the', 'conventional', 'heisenberg', 'exchange']] | [-0.16161124941379745, 0.18467721536274062, 0.0014244625519099488, 0.1022784558194531, 8.54071584485826e-05, -0.16956289994156584, 0.059477515053004026, 0.360296638771182, -0.2677699250872342, -0.26107308653430367, -0.010368338017882842, -0.3212260008523507, -0.05313730696342936, 0.12122477481116345, 0.10532607403298726, -0.029082391778526662, 0.023872172383933653, 0.00926318826774756, -0.12055625967252968, -0.23656875439396852, 0.2877565882132875, 0.021009972626280016, 0.2277632669678756, 0.07111906159517108, 0.05733025409788096, 0.09121362011100413, 0.11100825632219108, 0.003925745470487341, -0.14538491423405925, 0.10130716534202751, 0.20954205576872112, -0.09046877671641354, 0.16714343763761172, -0.4430324778302896, -0.20920086108570995, 0.014112632468241413, 0.13554529927442877, 0.20789367179972354, 0.003976926127556382, -0.31777853317571436, -0.0291082317415042, -0.25353403470231867, -0.1418870773299464, -0.11546755250746092, -0.03262265082876369, -0.014003522701040353, -0.288557886950621, 0.11429259451609074, 0.06270644715892112, 0.08399786649994095, -0.10332250520135561, -0.17903890243104223, -0.07844861110887763, 0.08549306896470842, 0.039662248956682605, 0.057010685711414835, 0.08800114402990966, -0.10393614621934336, -0.13133689147565944, 0.3931366188996503, -0.06553079692574003, -0.17785667235286728, 0.14611536268220873, -0.14352900925136747, -0.14137358884928988, 0.10931565355332125, 0.07203571497126907, 0.07629831387110207, -0.18479173420453254, 0.14594826913600292, -0.0032088777127986154, 0.18835298638461398, -0.03187178617793129, 0.07321755675960104, 0.2148080746687594, 0.12722096821533985, 0.06604004842640997, 0.13999274916801172, -0.1151414293285814, -0.15880220772090312, -0.26524315301176843, -0.10688341878400878, -0.25771496106623387, 0.0774986341430926, -0.10342293218404632, -0.12346708119156308, 0.44594964193699715, 0.14753006834760118, 0.12417759962988142, -0.008079642826710276, 0.2046625695767857, 0.13532423373742575, 0.0883167660985218, 0.04570763821469709, 0.2527792325344722, 0.15738276958300854, 0.022262177623326884, -0.2948472862461341, -0.02135956060888917, 0.11292763128338167] |
1,803.01316 | On Cognitive Preferences and the Plausibility of Rule-based Models | It is conventional wisdom in machine learning and data mining that logical
models such as rule sets are more interpretable than other models, and that
among such rule-based models, simpler models are more interpretable than more
complex ones. In this position paper, we question this latter assumption by
focusing on one particular aspect of interpretability, namely the plausibility
of models. Roughly speaking, we equate the plausibility of a model with the
likeliness that a user accepts it as an explanation for a prediction. In
particular, we argue that, all other things being equal, longer explanations
may be more convincing than shorter ones, and that the predominant bias for
shorter models, which is typically necessary for learning powerful
discriminative models, may not be suitable when it comes to user acceptance of
the learned models. To that end, we first recapitulate evidence for and against
this postulate, and then report the results of an evaluation in a
crowd-sourcing study based on about 3.000 judgments. The results do not reveal
a strong preference for simple rules, whereas we can observe a weak preference
for longer rules in some domains. We then relate these results to well-known
cognitive biases such as the conjunction fallacy, the representative heuristic,
or the recogition heuristic, and investigate their relation to rule length and
plausibility.
| cs.LG cs.AI cs.HC | it is conventional wisdom in machine learning and data mining that logical models such as rule sets are more interpretable than other models and that among such rulebased models simpler models are more interpretable than more complex ones in this position paper we question this latter assumption by focusing on one particular aspect of interpretability namely the plausibility of models roughly speaking we equate the plausibility of a model with the likeliness that a user accepts it as an explanation for a prediction in particular we argue that all other things being equal longer explanations may be more convincing than shorter ones and that the predominant bias for shorter models which is typically necessary for learning powerful discriminative models may not be suitable when it comes to user acceptance of the learned models to that end we first recapitulate evidence for and against this postulate and then report the results of an evaluation in a crowdsourcing study based on about 3000 judgments the results do not reveal a strong preference for simple rules whereas we can observe a weak preference for longer rules in some domains we then relate these results to wellknown cognitive biases such as the conjunction fallacy the representative heuristic or the recogition heuristic and investigate their relation to rule length and plausibility | [['it', 'is', 'conventional', 'wisdom', 'in', 'machine', 'learning', 'and', 'data', 'mining', 'that', 'logical', 'models', 'such', 'as', 'rule', 'sets', 'are', 'more', 'interpretable', 'than', 'other', 'models', 'and', 'that', 'among', 'such', 'rulebased', 'models', 'simpler', 'models', 'are', 'more', 'interpretable', 'than', 'more', 'complex', 'ones', 'in', 'this', 'position', 'paper', 'we', 'question', 'this', 'latter', 'assumption', 'by', 'focusing', 'on', 'one', 'particular', 'aspect', 'of', 'interpretability', 'namely', 'the', 'plausibility', 'of', 'models', 'roughly', 'speaking', 'we', 'equate', 'the', 'plausibility', 'of', 'a', 'model', 'with', 'the', 'likeliness', 'that', 'a', 'user', 'accepts', 'it', 'as', 'an', 'explanation', 'for', 'a', 'prediction', 'in', 'particular', 'we', 'argue', 'that', 'all', 'other', 'things', 'being', 'equal', 'longer', 'explanations', 'may', 'be', 'more', 'convincing', 'than', 'shorter', 'ones', 'and', 'that', 'the', 'predominant', 'bias', 'for', 'shorter', 'models', 'which', 'is', 'typically', 'necessary', 'for', 'learning', 'powerful', 'discriminative', 'models', 'may', 'not', 'be', 'suitable', 'when', 'it', 'comes', 'to', 'user', 'acceptance', 'of', 'the', 'learned', 'models', 'to', 'that', 'end', 'we', 'first', 'recapitulate', 'evidence', 'for', 'and', 'against', 'this', 'postulate', 'and', 'then', 'report', 'the', 'results', 'of', 'an', 'evaluation', 'in', 'a', 'crowdsourcing', 'study', 'based', 'on', 'about', '3000', 'judgments', 'the', 'results', 'do', 'not', 'reveal', 'a', 'strong', 'preference', 'for', 'simple', 'rules', 'whereas', 'we', 'can', 'observe', 'a', 'weak', 'preference', 'for', 'longer', 'rules', 'in', 'some', 'domains', 'we', 'then', 'relate', 'these', 'results', 'to', 'wellknown', 'cognitive', 'biases', 'such', 'as', 'the', 'conjunction', 'fallacy', 'the', 'representative', 'heuristic', 'or', 'the', 'recogition', 'heuristic', 'and', 'investigate', 'their', 'relation', 'to', 'rule', 'length', 'and', 'plausibility']] | [-0.04371293338968657, 0.06938421791541217, -0.0943752484785956, 0.16782973211334457, -0.1565078598317192, -0.1916711153852385, 0.07070571154973275, 0.4293081420192192, -0.23079952518780564, -0.2987830255981968, 0.08498658290035416, -0.2664838513879235, -0.1816283570266827, 0.22904408331852147, -0.07543675019947249, -0.0098296431109829, 0.06127948308103653, 0.0665598850144983, -0.046166870619581885, -0.2369518867169634, 0.3222605056757497, 0.05092737410260841, 0.2895884018954496, 0.036328069779068925, 0.048181201303837996, -0.025536747867590748, -0.027881929085882336, 0.049644902636037144, -0.08832062846530218, 0.13996693242211328, 0.25191641711740925, 0.21606538176839782, 0.3159179979632067, -0.4174364151346476, -0.21351817662199568, 0.1254660529062845, 0.13456504205025213, 0.12190544865321541, -0.003613537350983554, -0.24873000947801874, 0.12037392411229396, -0.18654152484242478, -0.053338962644988365, -0.11791574886112019, 0.03450595845230097, -0.01163354849681085, -0.26802472716554737, 0.057343714035029504, 0.13545153751146308, 0.07466707762417406, -0.06895944198788426, -0.12601698905142933, 0.018153546458153532, 0.09714477561958415, 0.07941043180424373, 0.016025038936370334, 0.09395255018242224, -0.16907682347214284, -0.1675980909251023, 0.39558279026992793, -0.03452505153532107, -0.20561990892300708, 0.24463345100128547, -0.09551893199988923, -0.1684750601735919, 0.051414590454552066, 0.13503971020582803, 0.10954270041656008, -0.15253324381889352, -0.048241063010023344, -0.06896449483627844, 0.2032044635917775, 0.04179949885190919, 0.021514811340806097, 0.22015108566211405, 0.1835645976075686, 0.04664400059751473, 0.07518818055138772, -0.026161724114573973, -0.10601814001105553, -0.2701686171495334, -0.13482875554107648, -0.1265967948984918, 0.021540986560420458, -0.0847388959485025, -0.1352473513353183, 0.3452273209449337, 0.23882243846716403, 0.2157475367710969, 0.11618104090231882, 0.3155166928764693, 0.09074175871900543, 0.10407478741673362, 0.05144471836947771, 0.20887217291720148, 0.021043064727361293, 0.05929634894655887, -0.1256283046461122, 0.13554334985850336, -0.0002527253225792286] |
1,803.01317 | New Proofs of Triangle Inequalities | We give three new proofs of the triangle inequality in Euclidean Geometry.
There seems to be only one known proof at the moment. It is due to properties
of triangles, but our proofs are due to circles or ellipses. We aim to prove
the triangle inequality as simple as possible without using properties of
triangles.
| math.GM | we give three new proofs of the triangle inequality in euclidean geometry there seems to be only one known proof at the moment it is due to properties of triangles but our proofs are due to circles or ellipses we aim to prove the triangle inequality as simple as possible without using properties of triangles | [['we', 'give', 'three', 'new', 'proofs', 'of', 'the', 'triangle', 'inequality', 'in', 'euclidean', 'geometry', 'there', 'seems', 'to', 'be', 'only', 'one', 'known', 'proof', 'at', 'the', 'moment', 'it', 'is', 'due', 'to', 'properties', 'of', 'triangles', 'but', 'our', 'proofs', 'are', 'due', 'to', 'circles', 'or', 'ellipses', 'we', 'aim', 'to', 'prove', 'the', 'triangle', 'inequality', 'as', 'simple', 'as', 'possible', 'without', 'using', 'properties', 'of', 'triangles']] | [-0.09457029658158056, 0.032812970402565866, -0.090537746259096, 0.12090848258654163, -0.12387135106731545, -0.17903312993320553, 0.05233477567089721, 0.3603685492819006, -0.3031288247555494, -0.32085215899754654, 0.1516170754753561, -0.32793058944358067, -0.13223733661103654, 0.2044196311003444, -0.13159263440492477, 0.014345146046782081, 0.03374853547747162, 0.04506106363101439, -0.03708592683013359, -0.2686420365363698, 0.3086334265768528, -0.05299466177821159, 0.18318528924137353, 0.14793206333098086, 0.05082845952869816, -0.007521482777189125, 0.010007739947600798, 0.03887889246371659, -0.17398198134350507, 0.13761048647151752, 0.20284612327390775, 0.1289558235852217, 0.17221052314747465, -0.4366224862973798, -0.08216337027366866, 0.1514501808740368, 0.15275665831498125, 0.09965406322682446, -0.0240069629074159, -0.25216836109757423, 0.07576329034160484, -0.034084528549150984, -0.24171855525875632, -0.11903751616112211, -0.0019192653200165793, -0.005222264270890843, -0.1924391421404752, 0.06718648541718722, 0.17378011278130792, 0.05693284330720251, 0.038384855881502686, -0.13732157010923732, 0.035021171155809, 0.08695655873214657, 0.08595217272893271, 0.022200798835944047, 0.046064513650807465, -0.06486349767920646, -0.13255548450926488, 0.42458114312453704, 0.05898988517847928, -0.24067237709056247, 0.17619270526550032, -0.16487661329182712, -0.16126385668969967, 0.054177175038917495, 0.10223204794932496, 0.12144851733676412, -0.13364896940236742, 0.07145172958685593, -0.0746804748153822, 0.12971796645698222, 0.1557911270806058, 0.03210831277749755, 0.16289930377494205, 0.04658559093421156, 0.17497097749940374, 0.2124407518464564, -0.038222460804337804, -0.10121550140161575, -0.3196988560598005, -0.16036727973683315, -0.22269034407694233, 0.0802871779284694, -0.11276129369031299, -0.1976826916194775, 0.3253941267220811, 0.06329546343873847, 0.19497192943976685, 0.0640372378920967, 0.27653045390139924, 0.047994485808621076, 0.12399030906063589, 0.05807145176116716, 0.2533433834937486, 0.1686643732711673, 0.03437091454186223, -0.0599986363879659, 0.08062653977593237, 0.17178761497647924] |
1,803.01318 | Coherent states for ladder operators of general order related to
exceptional orthogonal polynomials | We construct the coherent states of general order, $m$ for the ladder
operators, $c(m)$ and $c^\dagger(m)$, which act on rational deformations of the
harmonic oscillator. The position wavefunctions of the eigenvectors involve
type III Hermite exceptional orthogonal polynomials. We plot energy
expectations, time-dependent position probability densities for the coherent
states and for the even and odd cat states, Wigner functions, and Heisenberg
uncertainty relations. We find generally non-classical behaviour, with one
exception: there is a regime of large magnitude of the coherent state
parameter, $z$, where the otherwise indistinct position probability density
separates into $m+1$ distinct wavepackets oscillating and colliding in the
potential, forming interference fringes when they collide. The Mandel $Q$
parameter is calculated to find sub-Poissonian statistics, another indicator of
non-classical behaviour. We plot the position standard deviation and find
squeezing in many of the cases. We calculate the two-photon-number probability
density for the output state when the $m=4$, $\mu=-5$ coherent states (where
$\mu$ labels the lowest weight in the superposition) are placed on one arm of a
beamsplitter. We find that it does not factorize, again indicating
non-classical behaviour. Calculation of the linear entropy for this
beamsplitter output state shows significant entanglement, another non-classical
feature. We also construct linearized versions, $\tilde c(m)$, of the
annihilation operators and their coherent states and calculate the same
properties that we investigate for the coherent states. For these we find
similar behaviour to the $c(m)$ coherent states, at much smaller magnitudes of
$z$, but comparable average energies.
| math-ph math.MP quant-ph | we construct the coherent states of general order m for the ladder operators cm and cdaggerm which act on rational deformations of the harmonic oscillator the position wavefunctions of the eigenvectors involve type iii hermite exceptional orthogonal polynomials we plot energy expectations timedependent position probability densities for the coherent states and for the even and odd cat states wigner functions and heisenberg uncertainty relations we find generally nonclassical behaviour with one exception there is a regime of large magnitude of the coherent state parameter z where the otherwise indistinct position probability density separates into m1 distinct wavepackets oscillating and colliding in the potential forming interference fringes when they collide the mandel q parameter is calculated to find subpoissonian statistics another indicator of nonclassical behaviour we plot the position standard deviation and find squeezing in many of the cases we calculate the twophotonnumber probability density for the output state when the m4 mu5 coherent states where mu labels the lowest weight in the superposition are placed on one arm of a beamsplitter we find that it does not factorize again indicating nonclassical behaviour calculation of the linear entropy for this beamsplitter output state shows significant entanglement another nonclassical feature we also construct linearized versions tilde cm of the annihilation operators and their coherent states and calculate the same properties that we investigate for the coherent states for these we find similar behaviour to the cm coherent states at much smaller magnitudes of z but comparable average energies | [['we', 'construct', 'the', 'coherent', 'states', 'of', 'general', 'order', 'm', 'for', 'the', 'ladder', 'operators', 'cm', 'and', 'cdaggerm', 'which', 'act', 'on', 'rational', 'deformations', 'of', 'the', 'harmonic', 'oscillator', 'the', 'position', 'wavefunctions', 'of', 'the', 'eigenvectors', 'involve', 'type', 'iii', 'hermite', 'exceptional', 'orthogonal', 'polynomials', 'we', 'plot', 'energy', 'expectations', 'timedependent', 'position', 'probability', 'densities', 'for', 'the', 'coherent', 'states', 'and', 'for', 'the', 'even', 'and', 'odd', 'cat', 'states', 'wigner', 'functions', 'and', 'heisenberg', 'uncertainty', 'relations', 'we', 'find', 'generally', 'nonclassical', 'behaviour', 'with', 'one', 'exception', 'there', 'is', 'a', 'regime', 'of', 'large', 'magnitude', 'of', 'the', 'coherent', 'state', 'parameter', 'z', 'where', 'the', 'otherwise', 'indistinct', 'position', 'probability', 'density', 'separates', 'into', 'm1', 'distinct', 'wavepackets', 'oscillating', 'and', 'colliding', 'in', 'the', 'potential', 'forming', 'interference', 'fringes', 'when', 'they', 'collide', 'the', 'mandel', 'q', 'parameter', 'is', 'calculated', 'to', 'find', 'subpoissonian', 'statistics', 'another', 'indicator', 'of', 'nonclassical', 'behaviour', 'we', 'plot', 'the', 'position', 'standard', 'deviation', 'and', 'find', 'squeezing', 'in', 'many', 'of', 'the', 'cases', 'we', 'calculate', 'the', 'twophotonnumber', 'probability', 'density', 'for', 'the', 'output', 'state', 'when', 'the', 'm4', 'mu5', 'coherent', 'states', 'where', 'mu', 'labels', 'the', 'lowest', 'weight', 'in', 'the', 'superposition', 'are', 'placed', 'on', 'one', 'arm', 'of', 'a', 'beamsplitter', 'we', 'find', 'that', 'it', 'does', 'not', 'factorize', 'again', 'indicating', 'nonclassical', 'behaviour', 'calculation', 'of', 'the', 'linear', 'entropy', 'for', 'this', 'beamsplitter', 'output', 'state', 'shows', 'significant', 'entanglement', 'another', 'nonclassical', 'feature', 'we', 'also', 'construct', 'linearized', 'versions', 'tilde', 'cm', 'of', 'the', 'annihilation', 'operators', 'and', 'their', 'coherent', 'states', 'and', 'calculate', 'the', 'same', 'properties', 'that', 'we', 'investigate', 'for', 'the', 'coherent', 'states', 'for', 'these', 'we', 'find', 'similar', 'behaviour', 'to', 'the', 'cm', 'coherent', 'states', 'at', 'much', 'smaller', 'magnitudes', 'of', 'z', 'but', 'comparable', 'average', 'energies']] | [-0.1388189696141931, 0.2023753471706887, -0.08954739489103095, 0.11766784424849663, -0.002177422541311988, -0.16318195973347385, 0.049144553586451305, 0.366286664876751, -0.24469958651871954, -0.22871770002482245, 0.0035973006590330576, -0.3002647997154931, -0.07827639861364437, 0.17119760269234263, 0.004419392839333684, 0.040089805255506615, 0.055614574104318484, 0.06692461606370835, -0.08303050659062555, -0.1873186383907851, 0.3307701716462883, -0.0006845805209061345, 0.2970326603161263, -0.020873327237614966, 0.0927121128780065, 0.027519922931564085, 0.020501946681179106, -0.042305801124794165, -0.12403704602965278, 0.07566766726396039, 0.24554624077749485, 0.07229010047310902, 0.2029109172003924, -0.3736758166618767, -0.14792389576046605, 0.14456805200545025, 0.13429577509478044, 0.1274810076026116, 0.02671812984378642, -0.3048860483428799, 0.007115645736807071, -0.1519354087220444, -0.18543968928527454, -0.06753276131563385, 0.06767922820958508, 0.020603095354955095, -0.254112175530296, 0.11883231232476661, 0.05020474764989826, 0.011852549942454597, -0.03321832721598721, -0.13076166570764874, -0.05336360505220984, 0.10607747623976511, -0.03233075668924625, -0.005092547790406913, 0.12170182257751384, -0.16347798076362852, -0.0951403325068627, 0.3292156744893396, -0.061053613214619974, -0.18380322119747822, 0.14286550544355003, -0.22126354888409805, -0.09833776737948818, 0.12094807319274387, 0.13184196100242007, 0.08871152342800967, -0.03879476081234972, 0.048184501803976286, -0.013726186795450259, 0.19328533378277035, 0.1179290560826079, 0.11459018386252506, 0.17980520496312835, 0.027836633243094214, 0.07317222480411206, 0.14979902262127667, -0.11465355861320382, -0.11939099753422464, -0.33427683110196205, -0.15092643351317, -0.17984235863541023, 0.07833652251089215, -0.08638387690937589, -0.15984051637103414, 0.40536994866064946, 0.08610923500773573, 0.20515401100694033, 0.0351581927966212, 0.2435454387984956, 0.18450175166191135, 0.04337007512594192, 0.06746640430642177, 0.2681484512171754, 0.14084857807410728, 0.029389390404160578, -0.24269376139416068, 0.02676641160097893, 0.038129140919677486] |
1,803.01319 | A Learnable Distortion Correction Module for Modulation Recognition | Modulation recognition is a challenging task while performing spectrum
sensing in a cognitive radio setup. Recently, the use of deep convolutional
neural networks (CNNs) has shown to achieve state-of-the-art accuracy for
modulation recognition \cite{survey}. However, a wireless channel distorts the
signal and CNNs are not explicitly designed to undo these artifacts. To improve
the performance of CNN-based recognition schemes we propose a signal distortion
correction module (CM) and show that this CM+CNN scheme achieves accuracy
better than the existing schemes. The proposed CM is also based on a neural
network that estimates the random carrier frequency and phase offset introduced
by the channel and feeds it to a part that undoes this distortion right before
CNN-based modulation recognition. Its output is differentiable with respect to
its weights, which allows it to be trained end-to-end with the modulation
recognition CNN based on the received signal. For supervision, only the
modulation scheme label is used and the knowledge of true frequency or phase
offset is not required.
| eess.SP | modulation recognition is a challenging task while performing spectrum sensing in a cognitive radio setup recently the use of deep convolutional neural networks cnns has shown to achieve stateoftheart accuracy for modulation recognition citesurvey however a wireless channel distorts the signal and cnns are not explicitly designed to undo these artifacts to improve the performance of cnnbased recognition schemes we propose a signal distortion correction module cm and show that this cmcnn scheme achieves accuracy better than the existing schemes the proposed cm is also based on a neural network that estimates the random carrier frequency and phase offset introduced by the channel and feeds it to a part that undoes this distortion right before cnnbased modulation recognition its output is differentiable with respect to its weights which allows it to be trained endtoend with the modulation recognition cnn based on the received signal for supervision only the modulation scheme label is used and the knowledge of true frequency or phase offset is not required | [['modulation', 'recognition', 'is', 'a', 'challenging', 'task', 'while', 'performing', 'spectrum', 'sensing', 'in', 'a', 'cognitive', 'radio', 'setup', 'recently', 'the', 'use', 'of', 'deep', 'convolutional', 'neural', 'networks', 'cnns', 'has', 'shown', 'to', 'achieve', 'stateoftheart', 'accuracy', 'for', 'modulation', 'recognition', 'citesurvey', 'however', 'a', 'wireless', 'channel', 'distorts', 'the', 'signal', 'and', 'cnns', 'are', 'not', 'explicitly', 'designed', 'to', 'undo', 'these', 'artifacts', 'to', 'improve', 'the', 'performance', 'of', 'cnnbased', 'recognition', 'schemes', 'we', 'propose', 'a', 'signal', 'distortion', 'correction', 'module', 'cm', 'and', 'show', 'that', 'this', 'cmcnn', 'scheme', 'achieves', 'accuracy', 'better', 'than', 'the', 'existing', 'schemes', 'the', 'proposed', 'cm', 'is', 'also', 'based', 'on', 'a', 'neural', 'network', 'that', 'estimates', 'the', 'random', 'carrier', 'frequency', 'and', 'phase', 'offset', 'introduced', 'by', 'the', 'channel', 'and', 'feeds', 'it', 'to', 'a', 'part', 'that', 'undoes', 'this', 'distortion', 'right', 'before', 'cnnbased', 'modulation', 'recognition', 'its', 'output', 'is', 'differentiable', 'with', 'respect', 'to', 'its', 'weights', 'which', 'allows', 'it', 'to', 'be', 'trained', 'endtoend', 'with', 'the', 'modulation', 'recognition', 'cnn', 'based', 'on', 'the', 'received', 'signal', 'for', 'supervision', 'only', 'the', 'modulation', 'scheme', 'label', 'is', 'used', 'and', 'the', 'knowledge', 'of', 'true', 'frequency', 'or', 'phase', 'offset', 'is', 'not', 'required']] | [-0.11450425665782753, -0.014050389602894614, -0.04382628566968295, 0.024044632202477132, -0.12747478635947398, -0.22292728803800477, 0.027060504572071774, 0.49710540443750245, -0.25914816601784685, -0.27054161668585136, 0.0971244993616764, -0.21054828569424794, -0.2181825378832573, 0.20398284832124192, -0.16660170987865494, 0.09458330302696355, 0.10874564547457395, 0.08613908811375225, -0.09324294054435074, -0.29336701816896354, 0.2505906751576491, 0.1263497402829738, 0.38101978788575147, 0.025056126101822392, 0.16231970099837267, -0.048833286766094254, -0.01787546888976558, -0.07946001593540622, -0.026705914267659846, 0.1479765937965009, 0.3005290607024738, 0.14270401183384374, 0.26029176826080297, -0.36669982346974633, -0.2817971623271269, 0.11386235044309241, 0.14500178857220827, 0.10923007982597327, -0.028600857568836194, -0.34870052749028235, 0.13367076543519743, -0.1939592068854925, 0.04609674010482943, -0.07001881720212523, -0.028356708197688762, -0.02121930073931002, -0.32773153592998083, 0.04329395818826171, 0.09238994588355529, 0.03779790099664517, -0.031335499020867574, -0.0784681704026744, 0.03177707526615701, 0.1703011667530161, 0.001983441932389707, 0.11634010486476169, 0.13504849094326146, -0.1596607097076035, -0.11361936952931624, 0.36229794014222416, -0.07223252917147467, -0.23829181280924133, 0.1509235717614747, -0.053882578036467906, -0.10247574080898786, 0.17455109217392703, 0.21414394423571284, 0.05031706483611848, -0.1247222723562179, -0.0019115164830989313, 0.022640905851509675, 0.26528710654816745, 0.08185688617133587, 0.057412188068786466, 0.1515024831494248, 0.23476778974105245, 0.08627313432359406, 0.10881058184609983, -0.1948975962038549, -0.004695000680466325, -0.1576509715852105, -0.046997043994602465, -0.22567297676235346, -0.02849211399930892, -0.061747987688489776, -0.10760659415848364, 0.42439486830154444, 0.2162999127951502, 0.1657681265343095, 0.11967327198702156, 0.4128898432938256, 0.08877860575891529, 0.15705361445805777, 0.08931564307947318, 0.24687242676201135, 0.07608486422440437, 0.1493435676028935, -0.18981043929291283, 0.0854732280217134, 0.0634645802494527] |
1,803.0132 | Local Spectral Expansion Approach to High Dimensional Expanders Part II:
Mixing and Geometrical overlapping | In this paper, we further explore the local-to-global approach for expansion
of simplicial complexes that we call local spectral expansion. Specifically, we
prove that local expansion in the links imply the global expansion phenomena of
mixing and geometric overlapping. Our mixing results also give tighter bounds
on the error terms compared to previously known results.
| math.CO | in this paper we further explore the localtoglobal approach for expansion of simplicial complexes that we call local spectral expansion specifically we prove that local expansion in the links imply the global expansion phenomena of mixing and geometric overlapping our mixing results also give tighter bounds on the error terms compared to previously known results | [['in', 'this', 'paper', 'we', 'further', 'explore', 'the', 'localtoglobal', 'approach', 'for', 'expansion', 'of', 'simplicial', 'complexes', 'that', 'we', 'call', 'local', 'spectral', 'expansion', 'specifically', 'we', 'prove', 'that', 'local', 'expansion', 'in', 'the', 'links', 'imply', 'the', 'global', 'expansion', 'phenomena', 'of', 'mixing', 'and', 'geometric', 'overlapping', 'our', 'mixing', 'results', 'also', 'give', 'tighter', 'bounds', 'on', 'the', 'error', 'terms', 'compared', 'to', 'previously', 'known', 'results']] | [-0.1111813802949407, 0.06293940533968535, -0.12623480903831394, 0.12583679710726509, -0.06531710489229722, -0.03277891241014004, 0.05877587910614569, 0.33608318753540517, -0.28350522301413794, -0.2608136311512102, 0.09832516389221631, -0.19963223175569014, -0.22325222705575554, 0.18309719261120666, -0.0898341482335871, -0.03353753643618389, 0.07932602068917317, 0.01958812488750978, -0.0994508353061974, -0.28158601647750897, 0.34651147821410133, 0.044265348311852325, 0.25440190908583726, 0.11453273901080882, 0.060135373921895566, -0.04520006432113322, -0.05978396948088299, 0.03991087813946334, -0.2732790771123043, 0.18952888399362564, 0.16030032560229301, 0.10243395018729974, 0.18347676604647528, -0.41365810400721703, -0.20027357090095227, 0.1030442716236311, 0.1986021805639294, 0.10462329948151654, -0.04047680892346596, -0.2578722210092978, 0.08721582549200817, -0.16895043951543895, -0.11795246729796582, -0.14522763053801926, -0.05343167313628576, 0.03824102296070619, -0.3188803209669211, 0.10906705264880491, 0.10422098358923738, 0.027748256803236223, -0.05322327916298739, -0.10137828587639061, 0.055102055667984214, 0.09611340038139712, 0.008736438270319592, -0.025058151205832307, 0.04871659891849214, -0.09844000615094874, -0.14196788917761297, 0.34475171379745007, -0.10414185148071159, -0.1679376463067125, 0.18699385180053385, -0.16469708528708327, -0.2131506210701032, 0.09571485300971704, 0.14770035002041948, 0.11857833557508209, -0.0929405555975708, 0.09164873587962409, -0.09937316118316217, 0.09455361721867865, 0.11364676996388219, 0.10385591960300437, 0.07589955575425517, 0.09587848423556848, 0.1443819020112807, 0.16035248756578022, -0.04306015470171009, -0.09592743322930553, -0.31966741599819876, -0.1581363100389188, -0.15514731016010047, 0.023530397775836966, -0.1848351846023103, -0.1657646742882207, 0.3908160198818554, 0.19436677379364317, 0.1993501176316799, 0.14519704480824822, 0.2890062935311686, 0.07690309680024669, 0.038403610919009554, 0.06921363873407245, 0.26032931061292236, 0.1482394723898985, 0.03161609967831861, -0.18680990084328436, 0.061234392124143514, 0.15402589050883597] |
1,803.01321 | Galaxies with 'Rows': A New Catalog | Galaxies with 'rows' in Vorontsov-Velyaminov's terminology stand out among
the variety of spiral galactic patterns. A characteristic feature of such
objects is the sequence of straight-line segments that forms the spiral arm. In
2001 A. Chernin and co-authors published a catalog of such galaxies which
includes 204 objects from the Palomar Atlas. In this paper, we supplement the
catalog with 276 objects based on an analysis of all the galaxies from the New
General Catalogue and Index Catalogue. The total number of NGC and IC galaxies
with rows is 406, including the objects of Chernin et al. (2001). The use of
more recent galaxy images allowed us to detect more 'rows' on average, compared
with the catalog of Chernin et al. When comparing the principal galaxy
properties we found no significant differences between galaxies with rows and
all S-type NGC/IC galaxies.We discuss twomechanisms for the formation of
polygonal structures based on numerical gas-dynamic and collisionless N-body
calculations, which demonstrate that a spiral pattern with rows is a transient
stage in the evolution of galaxies and a system with a powerful spiral
structure can pass through this stage. The hypothesis of A. Chernin et al.
(2001) that the occurrence frequency of interacting galaxies is twice higher
among galaxies with rows is not confirmed for the combined set of 480 galaxies.
The presence of a central stellar bar appears to be a favorable factor for the
formation of a system of 'rows'.
| astro-ph.GA | galaxies with rows in vorontsovvelyaminovs terminology stand out among the variety of spiral galactic patterns a characteristic feature of such objects is the sequence of straightline segments that forms the spiral arm in 2001 a chernin and coauthors published a catalog of such galaxies which includes 204 objects from the palomar atlas in this paper we supplement the catalog with 276 objects based on an analysis of all the galaxies from the new general catalogue and index catalogue the total number of ngc and ic galaxies with rows is 406 including the objects of chernin et al 2001 the use of more recent galaxy images allowed us to detect more rows on average compared with the catalog of chernin et al when comparing the principal galaxy properties we found no significant differences between galaxies with rows and all stype ngcic galaxieswe discuss twomechanisms for the formation of polygonal structures based on numerical gasdynamic and collisionless nbody calculations which demonstrate that a spiral pattern with rows is a transient stage in the evolution of galaxies and a system with a powerful spiral structure can pass through this stage the hypothesis of a chernin et al 2001 that the occurrence frequency of interacting galaxies is twice higher among galaxies with rows is not confirmed for the combined set of 480 galaxies the presence of a central stellar bar appears to be a favorable factor for the formation of a system of rows | [['galaxies', 'with', 'rows', 'in', 'vorontsovvelyaminovs', 'terminology', 'stand', 'out', 'among', 'the', 'variety', 'of', 'spiral', 'galactic', 'patterns', 'a', 'characteristic', 'feature', 'of', 'such', 'objects', 'is', 'the', 'sequence', 'of', 'straightline', 'segments', 'that', 'forms', 'the', 'spiral', 'arm', 'in', '2001', 'a', 'chernin', 'and', 'coauthors', 'published', 'a', 'catalog', 'of', 'such', 'galaxies', 'which', 'includes', '204', 'objects', 'from', 'the', 'palomar', 'atlas', 'in', 'this', 'paper', 'we', 'supplement', 'the', 'catalog', 'with', '276', 'objects', 'based', 'on', 'an', 'analysis', 'of', 'all', 'the', 'galaxies', 'from', 'the', 'new', 'general', 'catalogue', 'and', 'index', 'catalogue', 'the', 'total', 'number', 'of', 'ngc', 'and', 'ic', 'galaxies', 'with', 'rows', 'is', '406', 'including', 'the', 'objects', 'of', 'chernin', 'et', 'al', '2001', 'the', 'use', 'of', 'more', 'recent', 'galaxy', 'images', 'allowed', 'us', 'to', 'detect', 'more', 'rows', 'on', 'average', 'compared', 'with', 'the', 'catalog', 'of', 'chernin', 'et', 'al', 'when', 'comparing', 'the', 'principal', 'galaxy', 'properties', 'we', 'found', 'no', 'significant', 'differences', 'between', 'galaxies', 'with', 'rows', 'and', 'all', 'stype', 'ngcic', 'galaxieswe', 'discuss', 'twomechanisms', 'for', 'the', 'formation', 'of', 'polygonal', 'structures', 'based', 'on', 'numerical', 'gasdynamic', 'and', 'collisionless', 'nbody', 'calculations', 'which', 'demonstrate', 'that', 'a', 'spiral', 'pattern', 'with', 'rows', 'is', 'a', 'transient', 'stage', 'in', 'the', 'evolution', 'of', 'galaxies', 'and', 'a', 'system', 'with', 'a', 'powerful', 'spiral', 'structure', 'can', 'pass', 'through', 'this', 'stage', 'the', 'hypothesis', 'of', 'a', 'chernin', 'et', 'al', '2001', 'that', 'the', 'occurrence', 'frequency', 'of', 'interacting', 'galaxies', 'is', 'twice', 'higher', 'among', 'galaxies', 'with', 'rows', 'is', 'not', 'confirmed', 'for', 'the', 'combined', 'set', 'of', '480', 'galaxies', 'the', 'presence', 'of', 'a', 'central', 'stellar', 'bar', 'appears', 'to', 'be', 'a', 'favorable', 'factor', 'for', 'the', 'formation', 'of', 'a', 'system', 'of', 'rows']] | [-0.08946146052303716, 0.03665154919531521, -0.07230328024612574, 0.02223057400991252, -0.10437599692163588, -0.020046416713309943, 0.045090455316274355, 0.3765962717716704, -0.15014975319934798, -0.3590440777089164, 0.03623299562285815, -0.31655942921365615, -0.10763131825347678, 0.19585167042388413, -0.04453559823428528, -0.009020384348524176, 0.0754426211009835, -0.07467236789532855, -0.02558882394609069, -0.30478556604637425, 0.2989532228417789, 0.07931915853655885, 0.19318516420412668, -0.11461502456652464, 0.07531846315601942, -0.03026602059830656, -0.09900218545398301, -0.002350771068772183, -0.12985131167607133, 0.057549676180027334, 0.22285509441084256, 0.11524942868786082, 0.2361171845934169, -0.3674834420283635, -0.15725420135808205, 0.07049446018169073, 0.15939078559678535, 0.07512812913525142, -0.0753185008378662, -0.3070141441401935, 0.1097659460457537, -0.1701462566263125, -0.14581809671917922, 0.05393801319317348, 0.08570185128672103, 0.0630127318313479, -0.25644788934425783, 0.12505013359816675, 0.05515937463140689, 0.1022789114739592, -0.0545208130959217, -0.11630240466911346, -0.05217420640558727, 0.0776537208645241, -0.019684204769336505, 0.07346503527536359, 0.13560282297674095, -0.12419991977001985, -0.08852860925990287, 0.4008540621573569, -0.005531400599308658, -0.0360745785422407, 0.23860957262200552, -0.1630678424687333, -0.1645973565897861, 0.0946184924709363, 0.148545472701925, 0.10738598777694462, -0.13685519577654615, 0.028253036803165096, -0.09756523434795784, 0.21119733568269147, 0.07721528595211259, 0.017762784733027337, 0.24991713399580828, 0.10024586762694587, 0.03987439054571375, 0.11956758680409567, -0.17363376173344028, -0.04341694370343425, -0.2546787790016896, -0.12670669964031328, -0.149746877235608, 0.027713652063155732, -0.11000438829069026, -0.13433248622201477, 0.39399630755563325, 0.08958785227236617, 0.26428846573606446, 0.039046192958750586, 0.2623520928871217, 0.025465228985408067, 0.10912651598123432, 0.14883626150242388, 0.23887149935425162, 0.15687992817816573, 0.03278483899569587, -0.19008797230316868, 0.05981239475916977, 0.03559185289247315] |
1,803.01322 | Reply to Comment on "Solution of the Specific Model of Five-body Problem
to Investigate the Effective Alpha-Nucleon Interaction in a Partial-Wave
analysis" | The present paper is written in response to the comment of M. R. Hadizadeh
et. al on our original paper "Solution of the Specific Model of Five-body
Problem to Investigate the Effective Alpha-Nucleon Interaction in a
Partial-Wave analysis" [Acta Physica Polonica B, 48, 1279 (2017)]. In this
paper we present our clarifications and statements on the authors of the
comment arguments about of the accuracy of the procedure in solution of simple
five- and four-body problems. In this regard our arguments turn out to be very
efficient mainly discussed from the authors misunderstanding of the issues
discussed in the original paper. In fact, the authors of the comment aims to
exaggeratedly show that our paper is entirely incorrect, but our following
statements prove that the authors of the comment statements are inimical and
often inconsequential.
| nucl-th | the present paper is written in response to the comment of m r hadizadeh et al on our original paper solution of the specific model of fivebody problem to investigate the effective alphanucleon interaction in a partialwave analysis acta physica polonica b 48 1279 2017 in this paper we present our clarifications and statements on the authors of the comment arguments about of the accuracy of the procedure in solution of simple five and fourbody problems in this regard our arguments turn out to be very efficient mainly discussed from the authors misunderstanding of the issues discussed in the original paper in fact the authors of the comment aims to exaggeratedly show that our paper is entirely incorrect but our following statements prove that the authors of the comment statements are inimical and often inconsequential | [['the', 'present', 'paper', 'is', 'written', 'in', 'response', 'to', 'the', 'comment', 'of', 'm', 'r', 'hadizadeh', 'et', 'al', 'on', 'our', 'original', 'paper', 'solution', 'of', 'the', 'specific', 'model', 'of', 'fivebody', 'problem', 'to', 'investigate', 'the', 'effective', 'alphanucleon', 'interaction', 'in', 'a', 'partialwave', 'analysis', 'acta', 'physica', 'polonica', 'b', '48', '1279', '2017', 'in', 'this', 'paper', 'we', 'present', 'our', 'clarifications', 'and', 'statements', 'on', 'the', 'authors', 'of', 'the', 'comment', 'arguments', 'about', 'of', 'the', 'accuracy', 'of', 'the', 'procedure', 'in', 'solution', 'of', 'simple', 'five', 'and', 'fourbody', 'problems', 'in', 'this', 'regard', 'our', 'arguments', 'turn', 'out', 'to', 'be', 'very', 'efficient', 'mainly', 'discussed', 'from', 'the', 'authors', 'misunderstanding', 'of', 'the', 'issues', 'discussed', 'in', 'the', 'original', 'paper', 'in', 'fact', 'the', 'authors', 'of', 'the', 'comment', 'aims', 'to', 'exaggeratedly', 'show', 'that', 'our', 'paper', 'is', 'entirely', 'incorrect', 'but', 'our', 'following', 'statements', 'prove', 'that', 'the', 'authors', 'of', 'the', 'comment', 'statements', 'are', 'inimical', 'and', 'often', 'inconsequential']] | [-0.10034005887714695, 0.009783913261454665, -0.093245320587867, 0.03520876828891536, -0.08379420258499908, -0.07185777118358987, 0.09247731598412484, 0.29655514095881674, -0.1896322693492314, -0.3245046968063848, 0.09654711475542915, -0.27862954470787593, -0.1951643110704467, 0.15212875234569903, -0.13481919382077953, 0.010256567842919718, 0.08476823891484828, -0.012206944171339273, -0.05692690792674319, -0.32786831197639305, 0.33430013336438796, 0.07708789428623718, 0.22721907668605898, 0.12261528570811744, 0.03133887406015261, -0.002569512030194429, -0.12262569742531261, -0.01317607695466105, -0.15719169615576076, 0.144485741679091, 0.24983853357888153, 0.13458108221653453, 0.27221928624379815, -0.3916376294624625, -0.15590555970839254, 0.027493007661012762, 0.11953782578436375, 0.13009956466019945, 0.006307587108687695, -0.29863361892939516, 0.09660035159057853, -0.16931724915224494, -0.1254337624731389, -0.052313246792464546, 0.06915388321574552, -0.0008774447170170871, -0.21124194174384078, 0.08633298314574252, 0.141255793500353, 0.05325977567047106, -0.05396842252318465, -0.16494414824851308, 0.04805814125938923, 0.04509921829837064, 0.12460465394718939, 0.035950513214409126, 0.06028979384537899, -0.07007541279943491, -0.1273618166186762, 0.38134838612467953, -0.009570436806164005, -0.18076229348044956, 0.18877609645785537, -0.08780677999708462, -0.19123010618866168, 0.023949248322892483, 0.15436896619521026, 0.13734933312022776, -0.17289028669509923, 0.10865207386748145, -0.09495997743568185, 0.1585198937576603, 0.09716245931022885, -0.01922109182641813, 0.13343152542471548, 0.11901668153939571, -0.02228944067434041, 0.11968041969036373, -0.0017172803583724256, -0.06538218595166902, -0.3380243850476814, -0.15577079625588588, -0.1618810832107115, 0.0442785490983321, 0.0004928115596350946, -0.12688582757784223, 0.4103062123511777, 0.2559604193173238, 0.198766220727879, 0.024091842711310495, 0.23369766708294099, 0.1010088893879473, -0.04515620073961503, 0.07584732088302686, 0.29197516323377687, 0.0926068025027317, 0.1321577332546991, -0.19128834576324813, 0.022381174201710208, 0.08072166620739595] |
1,803.01323 | Ultrafast optically induced ferromagnetic/anti-ferromagnetic phase
transition in GdTiO$_3$ from first principles | Epitaxial strain and chemical substitution have been the workhorses of
functional materials design. These static techniques have shown immense success
in controlling properties in complex oxides through the tuning of subtle
structural distortions. Recently, an approach based on the excitation of an
infrared active phonon with intense mid-infrared light has created an
opportunity for dynamical control of structure through special nonlinear
coupling to Raman phonons. We use first-principles techniques to show that this
approach can dynamically induce a magnetic phase transition from the
ferromagnetic ground state to a hidden antiferromagnetic phase in the rare
earth titanate GdTiO$_3$ for realistic experimental parameters. We show that a
combination of a Jahn-Teller distortion, Gd displacement, and infrared phonon
motion dominate this phase transition with little effect from the octahedral
rotations, contrary to conventional wisdom.
| cond-mat.str-el cond-mat.mtrl-sci | epitaxial strain and chemical substitution have been the workhorses of functional materials design these static techniques have shown immense success in controlling properties in complex oxides through the tuning of subtle structural distortions recently an approach based on the excitation of an infrared active phonon with intense midinfrared light has created an opportunity for dynamical control of structure through special nonlinear coupling to raman phonons we use firstprinciples techniques to show that this approach can dynamically induce a magnetic phase transition from the ferromagnetic ground state to a hidden antiferromagnetic phase in the rare earth titanate gdtio_3 for realistic experimental parameters we show that a combination of a jahnteller distortion gd displacement and infrared phonon motion dominate this phase transition with little effect from the octahedral rotations contrary to conventional wisdom | [['epitaxial', 'strain', 'and', 'chemical', 'substitution', 'have', 'been', 'the', 'workhorses', 'of', 'functional', 'materials', 'design', 'these', 'static', 'techniques', 'have', 'shown', 'immense', 'success', 'in', 'controlling', 'properties', 'in', 'complex', 'oxides', 'through', 'the', 'tuning', 'of', 'subtle', 'structural', 'distortions', 'recently', 'an', 'approach', 'based', 'on', 'the', 'excitation', 'of', 'an', 'infrared', 'active', 'phonon', 'with', 'intense', 'midinfrared', 'light', 'has', 'created', 'an', 'opportunity', 'for', 'dynamical', 'control', 'of', 'structure', 'through', 'special', 'nonlinear', 'coupling', 'to', 'raman', 'phonons', 'we', 'use', 'firstprinciples', 'techniques', 'to', 'show', 'that', 'this', 'approach', 'can', 'dynamically', 'induce', 'a', 'magnetic', 'phase', 'transition', 'from', 'the', 'ferromagnetic', 'ground', 'state', 'to', 'a', 'hidden', 'antiferromagnetic', 'phase', 'in', 'the', 'rare', 'earth', 'titanate', 'gdtio_3', 'for', 'realistic', 'experimental', 'parameters', 'we', 'show', 'that', 'a', 'combination', 'of', 'a', 'jahnteller', 'distortion', 'gd', 'displacement', 'and', 'infrared', 'phonon', 'motion', 'dominate', 'this', 'phase', 'transition', 'with', 'little', 'effect', 'from', 'the', 'octahedral', 'rotations', 'contrary', 'to', 'conventional', 'wisdom']] | [-0.0991616269323854, 0.1976097916275794, -0.07734847735997488, -0.0044386285154561275, -0.09135650129604886, -0.09782372300694377, 0.1028662949857366, 0.47073723620358315, -0.3076871523903754, -0.2636362598668642, 0.017439575767222763, -0.30169138459325234, -0.22005048076771483, 0.16264426805263826, 0.012513966569748089, 0.041535976328638216, -0.022714640858106826, -0.05765923785884644, -0.10243134972024424, -0.17059088535855688, 0.2526676612159678, 0.04946339467028511, 0.3364658984604455, 0.025790485048680815, 0.04640329722315073, 0.005107104102903195, 0.11056440617917603, -0.0017096304142748125, -0.1393895039237362, 0.08548087830378012, 0.2562494004742449, -0.042598863320695304, 0.25674013129812273, -0.45396900317055805, -0.2747774531137028, 0.03664406249477379, 0.1081535681101977, 0.17459265569816806, -0.14806713429475132, -0.28048397842368095, 0.028205511881792135, -0.13566394673859458, -0.09126638421630628, -0.15108720717226504, -0.02588858916104295, -0.0050040840363229505, -0.2646108834061395, 0.049882249512091165, 0.04077371675943252, 0.1413955465030238, -0.11637181709769345, -0.10894852511154644, -0.07623214040925541, 0.08252568844859559, 0.06116639635390567, 0.05196716969846996, 0.16299718357480436, -0.084361954531739, -0.12877397158517295, 0.39049877850552095, -0.045958352714194024, -0.07456658655095078, 0.19150696676188925, -0.13946448520487104, -0.12104173085051553, 0.20555189424567635, 0.1614516918895809, 0.11082706573412164, -0.1539678536484352, 0.07527547886947042, 0.05563849938357114, 0.22307940335048518, 0.017904367018846495, 0.11463020552831296, 0.23246338898458213, 0.2031012632002528, 0.02240702375869146, 0.13744821120408995, -0.10187412230149627, -0.0677967864952498, -0.1760066347836538, -0.11931173334196779, -0.18624418343858126, 0.06151673998423756, -0.08051992186415365, -0.19919499996334195, 0.3589287276543279, 0.1647910629003664, 0.14920560214028672, -0.10912725191689114, 0.2703710296004655, 0.0586306749779077, 0.10387260920389463, -0.017205964584607374, 0.3349216663943362, 0.14175976619821126, 0.08306373592878458, -0.3017546753341311, 0.0785497633301749, 0.013004842484440967] |
1,803.01324 | Classification of integrable representations for toroidal extended
affine Lie algebras | In this paper, we classify the irreducible integrable modules with finite
dimensional weight spaces and non-trivial $\widetilde{\mathfrak g}_c$-action
for the nullity $2$ toroidal extended affine Lie algebra $\widetilde{\mathfrak
g}$, where $\widetilde{\mathfrak g}_c$ is the core of $\widetilde{\mathfrak
g}$.
| math.RT | in this paper we classify the irreducible integrable modules with finite dimensional weight spaces and nontrivial widetildemathfrak g_caction for the nullity 2 toroidal extended affine lie algebra widetildemathfrak g where widetildemathfrak g_c is the core of widetildemathfrak g | [['in', 'this', 'paper', 'we', 'classify', 'the', 'irreducible', 'integrable', 'modules', 'with', 'finite', 'dimensional', 'weight', 'spaces', 'and', 'nontrivial', 'widetildemathfrak', 'g_caction', 'for', 'the', 'nullity', '2', 'toroidal', 'extended', 'affine', 'lie', 'algebra', 'widetildemathfrak', 'g', 'where', 'widetildemathfrak', 'g_c', 'is', 'the', 'core', 'of', 'widetildemathfrak', 'g']] | [-0.19449446053319686, 0.1459287832667296, -0.000885641756089958, 0.013404891700358005, -0.160515823867172, -0.1649408649552513, -0.08861841953271446, 0.36876160822607373, -0.31111621131768097, -0.14888673076859196, 0.1157234298486917, -0.20177663283774983, -0.14913151785731316, 0.10158667652993589, -0.1423070892137853, -0.09953931082241438, 0.05224577035452869, 0.19764525756692966, -0.12773318815271598, -0.29155361551690745, 0.46602045314235463, -0.0662137200502125, 0.2207871077431215, 0.003195225286322671, 0.149506617815712, 0.014773852934406416, 0.014889841653859696, -0.002790391495501673, -0.18719715914512808, 0.11116356488216568, 0.4026945616949249, -0.029356728484098975, 0.1709193166949459, -0.28778096200344533, -0.07129399760349377, 0.2654681581802465, 0.16258736976699248, -0.08191179977478208, 0.05613672640174627, -0.2349247394280659, 0.10712870195306637, -0.24958059191703796, -0.15719275936685703, -0.0007366230207923296, 0.13740320317447186, -0.07715007265073222, -0.23384222086846224, 0.017592593800981302, 0.1294665169474241, 0.14315360812218608, -0.08259865281650343, -0.15978853807256027, -0.11384640933593383, 0.03531520309027385, -0.16522488424025877, 0.0712504476636044, 0.06274046887316413, -0.06200970455982905, -0.1155403265226129, 0.34213115400760563, 0.0065011669806129225, -0.203682098638367, 0.12193503093628867, -0.17469742700356888, -0.21698231099022403, 0.11119754491625605, 0.07964986782974086, 0.08884959657852715, 0.05309085497582281, 0.2802607838954852, -0.12129068928393158, -0.0012232340066819578, 0.05031448507027046, -0.06015547415291941, 0.1056761109345668, 0.11443187647524315, 0.0944762518377723, 0.1359819748212357, 0.039109946052367624, 0.07841120589354604, -0.40505590914068995, -0.18016364772464274, -0.0995702077760487, 0.17426385974662528, -0.14277517971719578, -0.1780627353267895, 0.42831194189351957, 0.034096011632386396, 0.13843919458874576, 0.12134397616358222, 0.16558326651166017, 0.07690807099680642, 0.09699576244865721, 0.1285975336701282, 0.0738879497716757, 0.31237560228721517, -0.10009911268748142, -0.17830479848576156, -0.18444136005584025, 0.2364007811238234] |
1,803.01325 | Could Interaction with Social Robots Facilitate Joint Attention of
Children with Autism Spectrum Disorder? | This research addressed whether interactions with social robots could
facilitate joint attention of the autism spectrum disorder (ASD). Two
conditions of initiators, namely 'Human' vs. 'Robot' were measured with 15
children with ASD and 15 age-matched typically developing (TD) children. Apart
from fixation and gaze transition, a new longest common subsequence (LCS)
approach was proposed to analyze eye-movement traces. Results revealed that
children with ASD showed deficits of joint attention. Compared to the human
agent, robot facilitate less fixations towards the targets, but it attracted
more attention and allowed the children to show gaze transition and to follow
joint attention logic. This results highlight both potential application of LCS
analysis on eye-tracking studies and of social robot to intervention.
| q-bio.NC cs.HC | this research addressed whether interactions with social robots could facilitate joint attention of the autism spectrum disorder asd two conditions of initiators namely human vs robot were measured with 15 children with asd and 15 agematched typically developing td children apart from fixation and gaze transition a new longest common subsequence lcs approach was proposed to analyze eyemovement traces results revealed that children with asd showed deficits of joint attention compared to the human agent robot facilitate less fixations towards the targets but it attracted more attention and allowed the children to show gaze transition and to follow joint attention logic this results highlight both potential application of lcs analysis on eyetracking studies and of social robot to intervention | [['this', 'research', 'addressed', 'whether', 'interactions', 'with', 'social', 'robots', 'could', 'facilitate', 'joint', 'attention', 'of', 'the', 'autism', 'spectrum', 'disorder', 'asd', 'two', 'conditions', 'of', 'initiators', 'namely', 'human', 'vs', 'robot', 'were', 'measured', 'with', '15', 'children', 'with', 'asd', 'and', '15', 'agematched', 'typically', 'developing', 'td', 'children', 'apart', 'from', 'fixation', 'and', 'gaze', 'transition', 'a', 'new', 'longest', 'common', 'subsequence', 'lcs', 'approach', 'was', 'proposed', 'to', 'analyze', 'eyemovement', 'traces', 'results', 'revealed', 'that', 'children', 'with', 'asd', 'showed', 'deficits', 'of', 'joint', 'attention', 'compared', 'to', 'the', 'human', 'agent', 'robot', 'facilitate', 'less', 'fixations', 'towards', 'the', 'targets', 'but', 'it', 'attracted', 'more', 'attention', 'and', 'allowed', 'the', 'children', 'to', 'show', 'gaze', 'transition', 'and', 'to', 'follow', 'joint', 'attention', 'logic', 'this', 'results', 'highlight', 'both', 'potential', 'application', 'of', 'lcs', 'analysis', 'on', 'eyetracking', 'studies', 'and', 'of', 'social', 'robot', 'to', 'intervention']] | [-0.03524726492395828, 0.0853563470300287, -0.06827197749287031, 0.0498521611654051, -0.14452014719292583, -0.24435906390416898, 0.08953519221669172, 0.5072241954568053, -0.17623822964696573, -0.3284318952688149, 0.051477552164627724, -0.32974058509796483, -0.24066740123382888, 0.14329533746168643, -0.1743605805931256, 0.0499271285571471, 0.13633287943285272, 0.0864184733378474, 0.013173713914251753, -0.22761417576698822, 0.24118067491129472, 0.02242884654825663, 0.3265612466620798, 0.0316427242276924, 0.049481053369881844, 0.03795939825960443, -0.06986672468405186, -0.017620488609962102, -0.10044585065477177, 0.1618261624111974, 0.33750951052408573, 0.18645905544824837, 0.35884571103613916, -0.4081835657545999, -0.24906060828224702, 0.1067736063097768, 0.1282073610360507, 0.06589842726625189, -0.046247028796214555, -0.4125768697327551, 0.0927724944184996, -0.1780220725957085, -0.06948245539009071, -0.028200405301573146, 0.05799845385584323, -0.007190012118677382, -0.22984523174329466, -0.011787537465795498, 0.01979252930433184, 0.19785085203079114, -0.08366366716281769, -0.1235791362015953, -0.024731910818827755, 0.24230864985274667, 0.18556704594530635, 0.054207492044524234, 0.17746385936664433, -0.15219850939534166, -0.16090383057232102, 0.3385909183592606, 0.06277885504004334, -0.12355722993330545, 0.231404556982814, -0.12070725478051904, -0.1545621946086215, 0.11627924725992464, 0.208711994240577, 0.06847051668916085, -0.1526246027269659, -0.048981786989743877, 0.049288543496875704, 0.20400562467632674, 0.06460613583629372, -0.04699139416456504, 0.15067836301236906, 0.19008499168998272, 0.034397623360845724, 0.10394713481665127, -0.07745872847070652, -0.10835920256942104, -0.1272248516657523, -0.10831472675214295, -0.11610349947821443, 0.011639616889448664, -0.08203785632433225, -0.08010607727748506, 0.4011483941571552, 0.17523347614567822, 0.16291997383325166, 0.13270825870773373, 0.21247412192345666, -0.010808023138895255, 0.08704355185334924, 0.0276465232918399, 0.17366801602022425, 0.018511422533158434, 0.17351536077110707, -0.23422323984970503, 0.11264844327977225, -0.03384226269945659] |
1,803.01326 | Three-dimensional magnetic critical behavior in CrI$_3$ | CrI$_3$ is a promising candidate for the van der Waals bonded ferromagnetic
devices since its ferromagnetism can be maintained upon exfoliating of bulk
crystals down to single layer. In this work we studied critical properties of
bulk CrI$_3$ single crystals around the paramagnetic to ferromagnetic phase
transition. Critical exponents $\beta$ = 0.260(4) with a critical temperature
$T_c$ = 60.05(13) K and $\gamma$ = 1.136(6) with $T_c$ = 60.43(4) K are
obtained by the Kouvel-Fisher method, whereas $\delta$ = 5.32(2) is obtained by
a critical isotherm analysis at $T_c$ = 60 K. The critical exponents determined
in bulk CrI$_3$ single crystals suggest a three-dimensional long-range magnetic
coupling with the exchange distance decaying as $J(r)\approx r^{-4.69}$.
| cond-mat.str-el | cri_3 is a promising candidate for the van der waals bonded ferromagnetic devices since its ferromagnetism can be maintained upon exfoliating of bulk crystals down to single layer in this work we studied critical properties of bulk cri_3 single crystals around the paramagnetic to ferromagnetic phase transition critical exponents beta 02604 with a critical temperature t_c 600513 k and gamma 11366 with t_c 60434 k are obtained by the kouvelfisher method whereas delta 5322 is obtained by a critical isotherm analysis at t_c 60 k the critical exponents determined in bulk cri_3 single crystals suggest a threedimensional longrange magnetic coupling with the exchange distance decaying as jrapprox r469 | [['cri_3', 'is', 'a', 'promising', 'candidate', 'for', 'the', 'van', 'der', 'waals', 'bonded', 'ferromagnetic', 'devices', 'since', 'its', 'ferromagnetism', 'can', 'be', 'maintained', 'upon', 'exfoliating', 'of', 'bulk', 'crystals', 'down', 'to', 'single', 'layer', 'in', 'this', 'work', 'we', 'studied', 'critical', 'properties', 'of', 'bulk', 'cri_3', 'single', 'crystals', 'around', 'the', 'paramagnetic', 'to', 'ferromagnetic', 'phase', 'transition', 'critical', 'exponents', 'beta', '02604', 'with', 'a', 'critical', 'temperature', 't_c', '600513', 'k', 'and', 'gamma', '11366', 'with', 't_c', '60434', 'k', 'are', 'obtained', 'by', 'the', 'kouvelfisher', 'method', 'whereas', 'delta', '5322', 'is', 'obtained', 'by', 'a', 'critical', 'isotherm', 'analysis', 'at', 't_c', '60', 'k', 'the', 'critical', 'exponents', 'determined', 'in', 'bulk', 'cri_3', 'single', 'crystals', 'suggest', 'a', 'threedimensional', 'longrange', 'magnetic', 'coupling', 'with', 'the', 'exchange', 'distance', 'decaying', 'as', 'jrapprox', 'r469']] | [-0.17653956158240372, 0.2503329190398449, -0.026137743262773, -0.06282096392490892, -0.011769271537082867, -0.24085655386641042, 0.14863655193555123, 0.34687043340578316, -0.24907171228466538, -0.27847803512461555, -0.04197582708970074, -0.3869425745192662, -0.08515957608882302, 0.19311323113630988, 0.14345652597630848, 0.08117948365635103, -0.09144848231135787, 0.012128076448277073, -0.12790534011025018, -0.2009044701088835, 0.24336726243779497, 0.017236441518496542, 0.3047780837000176, 0.10090443963926395, -0.020009443643096002, -0.013431875817296863, 0.20752507262836092, 0.04838141552805539, -0.2692203611108357, -0.002825716546582944, 0.2705051758263296, -0.17654036255372527, 0.19124292748645672, -0.3437637804274999, -0.2414722461117775, -2.7884188949049098e-05, 0.1481620637356367, 0.07720210013495198, -0.04892493580079194, -0.2944780847292791, 0.10876152426449727, -0.08496180122483124, -0.13979462510439933, -0.09077391093958495, -0.023853777012634046, -0.007999687075831936, -0.25405224895520695, 0.16690081911776394, 0.051467063149563896, 0.10857577769320856, -0.0710630036300801, -0.15547742789556968, -0.07999997949046851, 0.03980500373121315, 0.02509821026848213, 0.11402973259157202, 0.20210206563340374, -0.10413165530415922, -0.06887056153647385, 0.3414047815773672, -0.05794815578185998, 0.0026392342007913383, 0.1492414177255253, -0.16486300653732808, -0.08745424212996387, 0.21125898799108503, 0.05235980026134588, 0.0891888960879477, -0.15498373929628181, 0.0936010417034533, 0.04588943272738636, 0.20799381946421508, 0.0840403148587974, -0.00850341065777737, 0.26396951064901447, 0.20087815639879375, -0.010571708984094338, 0.14375943994235466, -0.09568186762001822, -0.0354236790422097, -0.19101446026086227, -0.19996325018616773, -0.24934041618315267, 0.07653077998485651, -0.13304977201236734, -0.2044663180967847, 0.3164252874993005, 0.10105181028343087, 0.18720050344189393, -0.04672574231771807, 0.18442987157167523, 0.08738056892976707, 0.09546932395439124, 0.039154550774945215, 0.29878096402740306, 0.17425811282829246, 0.17585302949024056, -0.2415899209750509, 0.07228626263581071, 0.05321495570705806] |
1,803.01327 | Bayesian factor models for probabilistic cause of death assessment with
verbal autopsies | The distribution of deaths by cause provides crucial information for public
health planning, response, and evaluation. About 60% of deaths globally are not
registered or given a cause, limiting our ability to understand disease
epidemiology. Verbal autopsy (VA) surveys are increasingly used in such
settings to collect information on the signs, symptoms, and medical history of
people who have recently died. This article develops a novel Bayesian method
for estimation of population distributions of deaths by cause using verbal
autopsy data. The proposed approach is based on a multivariate probit model
where associations among items in questionnaires are flexibly induced by latent
factors. Using the Population Health Metrics Research Consortium labeled data
that include both VA and medically certified causes of death, we assess
performance of the proposed method. Further, we estimate important
questionnaire items that are highly associated with causes of death. This
framework provides insights that will simplify future data collection.
| stat.AP | the distribution of deaths by cause provides crucial information for public health planning response and evaluation about 60 of deaths globally are not registered or given a cause limiting our ability to understand disease epidemiology verbal autopsy va surveys are increasingly used in such settings to collect information on the signs symptoms and medical history of people who have recently died this article develops a novel bayesian method for estimation of population distributions of deaths by cause using verbal autopsy data the proposed approach is based on a multivariate probit model where associations among items in questionnaires are flexibly induced by latent factors using the population health metrics research consortium labeled data that include both va and medically certified causes of death we assess performance of the proposed method further we estimate important questionnaire items that are highly associated with causes of death this framework provides insights that will simplify future data collection | [['the', 'distribution', 'of', 'deaths', 'by', 'cause', 'provides', 'crucial', 'information', 'for', 'public', 'health', 'planning', 'response', 'and', 'evaluation', 'about', '60', 'of', 'deaths', 'globally', 'are', 'not', 'registered', 'or', 'given', 'a', 'cause', 'limiting', 'our', 'ability', 'to', 'understand', 'disease', 'epidemiology', 'verbal', 'autopsy', 'va', 'surveys', 'are', 'increasingly', 'used', 'in', 'such', 'settings', 'to', 'collect', 'information', 'on', 'the', 'signs', 'symptoms', 'and', 'medical', 'history', 'of', 'people', 'who', 'have', 'recently', 'died', 'this', 'article', 'develops', 'a', 'novel', 'bayesian', 'method', 'for', 'estimation', 'of', 'population', 'distributions', 'of', 'deaths', 'by', 'cause', 'using', 'verbal', 'autopsy', 'data', 'the', 'proposed', 'approach', 'is', 'based', 'on', 'a', 'multivariate', 'probit', 'model', 'where', 'associations', 'among', 'items', 'in', 'questionnaires', 'are', 'flexibly', 'induced', 'by', 'latent', 'factors', 'using', 'the', 'population', 'health', 'metrics', 'research', 'consortium', 'labeled', 'data', 'that', 'include', 'both', 'va', 'and', 'medically', 'certified', 'causes', 'of', 'death', 'we', 'assess', 'performance', 'of', 'the', 'proposed', 'method', 'further', 'we', 'estimate', 'important', 'questionnaire', 'items', 'that', 'are', 'highly', 'associated', 'with', 'causes', 'of', 'death', 'this', 'framework', 'provides', 'insights', 'that', 'will', 'simplify', 'future', 'data', 'collection']] | [-0.0254431682717956, 0.067068686069665, -0.07365413227581169, 0.12179034567145887, -0.15687299570908733, -0.12646615744136225, 0.10188475324242723, 0.39252580243339336, -0.1989206013945388, -0.3363712229157244, 0.12119587965072225, -0.3360609747986827, -0.18610824495470274, 0.21401483030210622, -0.1636993013036261, 0.016647993574783304, 0.12948878924818893, 0.03798371245414993, 0.06166466966642712, -0.31143882532232725, 0.28955647571535864, 0.048652882176433127, 0.33429018969897156, 0.019512481602468813, 0.06756228016114191, 0.02423765831413904, -0.12413745252354667, -0.01208178010416138, -0.09338145941590816, 0.14247951487967975, 0.36459291913224007, 0.27458697616493977, 0.41088128245429567, -0.4047184321189336, -0.22863375249446607, 0.1321837532279246, 0.1234566462713178, 0.06908778652390526, -0.03798529642384524, -0.3577361259163582, 0.036529406146952895, -0.21226950400673292, -0.08943180897839222, -0.11758178850221965, -0.0010503028135965852, 0.027173898024545385, -0.2904380835243501, 0.12749013789089433, -0.025793623763556574, 0.14589755024663567, -0.04234087649197166, -0.1201794457262735, -0.003657819337996782, 0.2104744429051803, 0.09983316793493026, 0.009935694468189395, 0.14307866238584147, -0.14022526798238735, -0.13505074580266974, 0.360216337292656, 0.010393303487255099, -0.17539024761394031, 0.15219179254019133, -0.11325063357689703, -0.12412671423425861, 0.09365555592903904, 0.2729251969642207, 0.05328629596852789, -0.24492068322728466, -0.061438801809095354, 0.008971824365503648, 0.14372423199291517, 0.03220929770298254, -0.005112528018775134, 0.18566677252019395, 0.20470297039224725, -0.004926863231458792, 0.07823886612758917, -0.1068127294701792, -0.06555168178188157, -0.21199341287556428, -0.12691889919517135, -0.11606797106028383, 0.016968716689316234, -0.06662401677578386, -0.15803460214968795, 0.3880480343987252, 0.22795212258024786, 0.12118030170563097, 0.01867705243457036, 0.2466101177657644, -0.007632759903037154, 0.09214210584364052, 0.06697017962746078, 0.1107668404473491, 0.05255790781842246, 0.10312149742484288, -0.18768460423003858, 0.20701555242637185, -0.03279882360529763] |
1,803.01328 | WHAI: Weibull Hybrid Autoencoding Inference for Deep Topic Modeling | To train an inference network jointly with a deep generative topic model,
making it both scalable to big corpora and fast in out-of-sample prediction, we
develop Weibull hybrid autoencoding inference (WHAI) for deep latent Dirichlet
allocation, which infers posterior samples via a hybrid of stochastic-gradient
MCMC and autoencoding variational Bayes. The generative network of WHAI has a
hierarchy of gamma distributions, while the inference network of WHAI is a
Weibull upward-downward variational autoencoder, which integrates a
deterministic-upward deep neural network, and a stochastic-downward deep
generative model based on a hierarchy of Weibull distributions. The Weibull
distribution can be used to well approximate a gamma distribution with an
analytic Kullback-Leibler divergence, and has a simple reparameterization via
the uniform noise, which help efficiently compute the gradients of the evidence
lower bound with respect to the parameters of the inference network. The
effectiveness and efficiency of WHAI are illustrated with experiments on big
corpora.
| stat.ML stat.AP stat.CO | to train an inference network jointly with a deep generative topic model making it both scalable to big corpora and fast in outofsample prediction we develop weibull hybrid autoencoding inference whai for deep latent dirichlet allocation which infers posterior samples via a hybrid of stochasticgradient mcmc and autoencoding variational bayes the generative network of whai has a hierarchy of gamma distributions while the inference network of whai is a weibull upwarddownward variational autoencoder which integrates a deterministicupward deep neural network and a stochasticdownward deep generative model based on a hierarchy of weibull distributions the weibull distribution can be used to well approximate a gamma distribution with an analytic kullbackleibler divergence and has a simple reparameterization via the uniform noise which help efficiently compute the gradients of the evidence lower bound with respect to the parameters of the inference network the effectiveness and efficiency of whai are illustrated with experiments on big corpora | [['to', 'train', 'an', 'inference', 'network', 'jointly', 'with', 'a', 'deep', 'generative', 'topic', 'model', 'making', 'it', 'both', 'scalable', 'to', 'big', 'corpora', 'and', 'fast', 'in', 'outofsample', 'prediction', 'we', 'develop', 'weibull', 'hybrid', 'autoencoding', 'inference', 'whai', 'for', 'deep', 'latent', 'dirichlet', 'allocation', 'which', 'infers', 'posterior', 'samples', 'via', 'a', 'hybrid', 'of', 'stochasticgradient', 'mcmc', 'and', 'autoencoding', 'variational', 'bayes', 'the', 'generative', 'network', 'of', 'whai', 'has', 'a', 'hierarchy', 'of', 'gamma', 'distributions', 'while', 'the', 'inference', 'network', 'of', 'whai', 'is', 'a', 'weibull', 'upwarddownward', 'variational', 'autoencoder', 'which', 'integrates', 'a', 'deterministicupward', 'deep', 'neural', 'network', 'and', 'a', 'stochasticdownward', 'deep', 'generative', 'model', 'based', 'on', 'a', 'hierarchy', 'of', 'weibull', 'distributions', 'the', 'weibull', 'distribution', 'can', 'be', 'used', 'to', 'well', 'approximate', 'a', 'gamma', 'distribution', 'with', 'an', 'analytic', 'kullbackleibler', 'divergence', 'and', 'has', 'a', 'simple', 'reparameterization', 'via', 'the', 'uniform', 'noise', 'which', 'help', 'efficiently', 'compute', 'the', 'gradients', 'of', 'the', 'evidence', 'lower', 'bound', 'with', 'respect', 'to', 'the', 'parameters', 'of', 'the', 'inference', 'network', 'the', 'effectiveness', 'and', 'efficiency', 'of', 'whai', 'are', 'illustrated', 'with', 'experiments', 'on', 'big', 'corpora']] | [0.0005621717559794585, 0.005204186130819532, -0.13318092104202758, 0.14253208713877635, -0.1461923796668028, -0.16850229957140983, 0.06606399122625589, 0.45359979846825205, -0.31031160889814297, -0.32614754655747674, 0.042894625756113476, -0.23704515353466074, -0.15132488391944207, 0.1456735592521727, -0.07769685535691678, 0.13704625627646844, 0.12133622989058494, 0.02205706464126706, -0.06992738459880153, -0.21599311382820208, 0.29700214898834626, 0.08751191047873969, 0.39635290001829465, -0.05822592110993961, 0.15675495152982571, -0.03401743585864703, 0.019300339470307033, -0.050260412751231345, -0.09183592525621255, 0.23500514880443613, 0.24469970870763064, 0.21873618076865872, 0.3414771326693396, -0.3876055146132906, -0.28328511750946445, 0.1217349022316436, 0.14514349198900164, 0.03655193437744553, 0.0030302670830860733, -0.34465732023119927, 0.052942872795586786, -0.2249675518150131, 0.02834336641555031, -0.17325388246526321, -0.06366735679407914, 0.046938311808820195, -0.37795779277880986, 0.08778192649129778, 0.07006599732131387, 0.021126436038563647, -0.008242951633098225, -0.14783726986497642, 0.008677284807587664, 0.05751750767230988, 0.05770111585346361, 0.0595485793488721, 0.08442443430423736, -0.1630307115862767, -0.12319960740550111, 0.2663473458898564, -0.0916710320332398, -0.2344037810092171, 0.13170019081948947, -0.001604230720549822, -0.16643700003934403, 0.0862700171287482, 0.2395488809219872, 0.11836812211821476, -0.20782122317080695, 0.05877610876341351, -0.03769514651425804, 0.13210848255082966, -0.006865839124657214, -0.11489109522352615, 0.1598212419450283, 0.2934243953227997, 0.040234110578894616, 0.15573317866694802, -0.18871594599448144, -0.1396136545886596, -0.23715815073732907, -0.12011506564876374, -0.24030048694151143, -0.018681640441839894, -0.16950345357210608, -0.22659338802176837, 0.38371322077388564, 0.15364360203966498, 0.23873470952889572, 0.18686139554949477, 0.2861165372530619, 0.09568278952812155, 0.07232082583320637, 0.1442932260843615, 0.12580640303591886, 0.11528498075902462, 0.06226045916400229, -0.12858737689753375, 0.1481130300120761, 0.010532874893397094] |
1,803.01329 | One Mirror Descent Algorithm for Convex Constrained Optimization
Problems with non-standard growth properties | The paper is devoted to a special Mirror Descent algorithm for problems of
convex minimization with functional constraints. The objective function may not
satisfy the Lipschitz condition, but it must necessarily have the
Lipshitz-continuous gradient. We assume, that the functional constraint can be
non-smooth, but satisfying the Lipschitz condition. In particular, such
functionals appear in the well-known Truss Topology Design problem. Also we
have applied the technique of restarts in the mentioned version of Mirror
Descent for strongly convex problems. Some estimations for a rate of
convergence are investigated for considered Mirror Descent algorithms.
| math.OC | the paper is devoted to a special mirror descent algorithm for problems of convex minimization with functional constraints the objective function may not satisfy the lipschitz condition but it must necessarily have the lipshitzcontinuous gradient we assume that the functional constraint can be nonsmooth but satisfying the lipschitz condition in particular such functionals appear in the wellknown truss topology design problem also we have applied the technique of restarts in the mentioned version of mirror descent for strongly convex problems some estimations for a rate of convergence are investigated for considered mirror descent algorithms | [['the', 'paper', 'is', 'devoted', 'to', 'a', 'special', 'mirror', 'descent', 'algorithm', 'for', 'problems', 'of', 'convex', 'minimization', 'with', 'functional', 'constraints', 'the', 'objective', 'function', 'may', 'not', 'satisfy', 'the', 'lipschitz', 'condition', 'but', 'it', 'must', 'necessarily', 'have', 'the', 'lipshitzcontinuous', 'gradient', 'we', 'assume', 'that', 'the', 'functional', 'constraint', 'can', 'be', 'nonsmooth', 'but', 'satisfying', 'the', 'lipschitz', 'condition', 'in', 'particular', 'such', 'functionals', 'appear', 'in', 'the', 'wellknown', 'truss', 'topology', 'design', 'problem', 'also', 'we', 'have', 'applied', 'the', 'technique', 'of', 'restarts', 'in', 'the', 'mentioned', 'version', 'of', 'mirror', 'descent', 'for', 'strongly', 'convex', 'problems', 'some', 'estimations', 'for', 'a', 'rate', 'of', 'convergence', 'are', 'investigated', 'for', 'considered', 'mirror', 'descent', 'algorithms']] | [-0.11094274428442762, 0.018328176851394356, -0.11879617214873833, 0.12160234100821238, -0.1018603553798961, -0.19786607623300564, -0.022774863711518226, 0.4098073711959265, -0.34315214977068925, -0.265641832744242, 0.16419539037936678, -0.20426799012698554, -0.18015571691656626, 0.21206661574141952, -0.15679520314999967, 0.12568099579463402, 0.0797400030317486, 0.033605827018618584, -0.1135343620703826, -0.3060735002640755, 0.31980030803430465, -0.005135679206941077, 0.24202326909508756, 0.08209768355753953, 0.10354839051417726, -0.0021648186769696975, 0.04096397859174558, 0.08189077197163495, -0.13470533600376522, 0.10023842566591558, 0.25613543104820996, 0.17829816791188893, 0.34599257196469974, -0.4557614316262545, -0.16942761441872967, 0.18989711805617296, 0.11340452113278932, 0.06034182321520582, -0.07986666423253595, -0.20574066032885865, 0.1093612005552327, -0.06984574048058881, -0.12005551951006055, -0.06282713751418777, -0.09652700869026043, 0.10781176954067202, -0.3127004700332319, 0.03871582399131179, 0.09112181509995172, 0.013174450125104637, -0.11427030742408768, -0.11616381629300053, 0.014707638491545954, 0.008392285650736221, 0.10128379708045833, 0.06750893758319479, 0.1261781495645322, -0.08646585343665975, -0.0735763708349838, 0.3733098869442299, -0.014484581948127798, -0.29082584728596994, 0.13009486970321466, -0.061621422578971234, -0.22668366970103834, 0.09589163659851477, 0.18868032917981187, 0.18272581121694015, -0.14829405601466855, 0.13897788772855194, -0.05588687439599345, 0.0865538685572564, 0.04665849762136287, 0.008771080829163072, 0.07001278619532303, 0.09645312879565021, 0.2379778195422904, 0.16011406027496622, -0.004540712312264468, -0.10725079435775037, -0.3504634998095352, -0.10380118655326266, -0.16737141012544593, -0.014074191656207756, -0.06623224993186291, -0.18783294485120844, 0.34705509724075434, 0.06187593178968796, 0.148938772979603, 0.11739011697711484, 0.2532743316504263, 0.15661533479829148, 0.07502441072676291, 0.08010404629092063, 0.24958872505600105, 0.16515367976089398, 0.09156234194875083, -0.20172207874135786, 0.10631255631401423, 0.13510934809242847] |
1,803.0133 | Accelerated and noise-resistant generation of a high-fidelity
steady-state entanglement with Rydberg atoms | Based on Lyapunov control, a scheme is proposed to accelerate the dissipation
dynamics for the generation of high-fidelity entanglement between two Rydberg
atoms in the context of cavity quantum electrodynamics (QED). We first use the
quantum Zeno dynamics and Rydberg antiblockade to find a unique steady state
(two-atom singlet state) for the system. Then, applying additional coherent
control (ACC) fields to improve the evolution speed of the dissipative system.
The ACC fields are designed based on the target state and they vanish gradually
along with increasing of the fidelity thus the system is guaranteed to be
finally stable. Besides, the current accelerated scheme is checked to be robust
against systematic and amplitude-noise errors.
| quant-ph | based on lyapunov control a scheme is proposed to accelerate the dissipation dynamics for the generation of highfidelity entanglement between two rydberg atoms in the context of cavity quantum electrodynamics qed we first use the quantum zeno dynamics and rydberg antiblockade to find a unique steady state twoatom singlet state for the system then applying additional coherent control acc fields to improve the evolution speed of the dissipative system the acc fields are designed based on the target state and they vanish gradually along with increasing of the fidelity thus the system is guaranteed to be finally stable besides the current accelerated scheme is checked to be robust against systematic and amplitudenoise errors | [['based', 'on', 'lyapunov', 'control', 'a', 'scheme', 'is', 'proposed', 'to', 'accelerate', 'the', 'dissipation', 'dynamics', 'for', 'the', 'generation', 'of', 'highfidelity', 'entanglement', 'between', 'two', 'rydberg', 'atoms', 'in', 'the', 'context', 'of', 'cavity', 'quantum', 'electrodynamics', 'qed', 'we', 'first', 'use', 'the', 'quantum', 'zeno', 'dynamics', 'and', 'rydberg', 'antiblockade', 'to', 'find', 'a', 'unique', 'steady', 'state', 'twoatom', 'singlet', 'state', 'for', 'the', 'system', 'then', 'applying', 'additional', 'coherent', 'control', 'acc', 'fields', 'to', 'improve', 'the', 'evolution', 'speed', 'of', 'the', 'dissipative', 'system', 'the', 'acc', 'fields', 'are', 'designed', 'based', 'on', 'the', 'target', 'state', 'and', 'they', 'vanish', 'gradually', 'along', 'with', 'increasing', 'of', 'the', 'fidelity', 'thus', 'the', 'system', 'is', 'guaranteed', 'to', 'be', 'finally', 'stable', 'besides', 'the', 'current', 'accelerated', 'scheme', 'is', 'checked', 'to', 'be', 'robust', 'against', 'systematic', 'and', 'amplitudenoise', 'errors']] | [-0.1534936632649208, 0.1706785629004506, -0.0736455137458896, 0.03664346037528178, 0.012266560905686674, -0.18069095910427027, 0.06152843072465787, 0.3715400578720229, -0.2822566030455554, -0.25384054799672284, 0.08086015780333712, -0.2170534096907691, -0.056479900721959506, 0.25187628915799515, -0.022949856520946405, 0.12856898292998917, 0.05459088191855699, 0.029033359624528594, -0.029304183326270765, -0.2537705797731178, 0.30999125308257397, 0.06904332681733649, 0.3157676380277345, 0.029054917000134343, 0.13302169024245813, -0.03940916997297401, 0.07472606713417917, -0.015510074445046484, -0.06325587138001408, 0.09870573047477851, 0.18410156279112147, 0.09046792565329399, 0.27817803393450696, -0.4565760917861813, -0.18526140902291185, 0.07384951324118967, 0.13004574306277, 0.2031046529217357, -0.0427390139437713, -0.3492188799926745, 0.044615334240786196, -0.19902083487457795, -0.11733705570389118, -0.13678282712187087, -0.004968903052421021, 0.024092295755898312, -0.2916370195037286, 0.06280528052177813, 0.03687398136493617, 0.011271510772140962, -0.053772467587675364, 0.00485541901954483, -0.013542428838523588, 0.12352172089075404, -0.02986810169074618, 0.04200004248247881, 0.18854209598950028, -0.13301569370586158, -0.14283116675713764, 0.33864491392991375, -0.08352715935377221, -0.18168937414884567, 0.18622443338972516, -0.09163142316642084, -0.056761671548883896, 0.12115349761838193, 0.1668516075899658, 0.07984185908156048, -0.11737251563213899, 0.042466610003300174, 0.04024781727431608, 0.22431406523433647, 0.010606790082030264, 0.09286250556760933, 0.1862120299317342, 0.14640943700422732, 0.10724567852334335, 0.15885277561652142, -0.06108012539126711, -0.18497306141528366, -0.2925051998213998, -0.19110006857122894, -0.16898744002433627, 0.04091318893811798, -0.022265863937069037, -0.12219441849239436, 0.4118039827592059, 0.19360523507930338, 0.13880125966222426, 0.0024937406165658365, 0.3245988475973718, 0.13863153203523584, 0.002219242343146886, 0.0916361109661271, 0.30328323626807624, 0.15428715646183783, 0.057319431100040674, -0.3657106562334645, 0.036738675262313336, 0.03542834905342066] |
1,803.01331 | Self-gravitating envelope solitons in a degenerate quantum plasma system | The existence and the basic features of ion-acoustic (IA) envelope solitons
in a self-gravitating degenerate quantum plasma system (SG-DQPS), containing
inertial non-relativistically degenerate light and heavy ion species as well as
inertialess non-relativistically degenerate positron and electron species, have
been theoretically investigated by deriving the nonlinear Schr\"{o}dinger (NLS)
equation. The NLS equation, which governs the dynamics of the IA waves, has
disclosed the modulationally stable and unstable regions for the IA waves. The
unstable region allows to generate bright envelope solitons which are
modulationaly stable. It is found that the stability and the growth rate
dependent on the plasma parameters (like, mass and number density of the plasma
species). The implications of our results in astronomical compact object (viz.
white dwarfs, neutron stars, and black holes, etc.) are briefly discussed.
| physics.plasm-ph | the existence and the basic features of ionacoustic ia envelope solitons in a selfgravitating degenerate quantum plasma system sgdqps containing inertial nonrelativistically degenerate light and heavy ion species as well as inertialess nonrelativistically degenerate positron and electron species have been theoretically investigated by deriving the nonlinear schrodinger nls equation the nls equation which governs the dynamics of the ia waves has disclosed the modulationally stable and unstable regions for the ia waves the unstable region allows to generate bright envelope solitons which are modulationaly stable it is found that the stability and the growth rate dependent on the plasma parameters like mass and number density of the plasma species the implications of our results in astronomical compact object viz white dwarfs neutron stars and black holes etc are briefly discussed | [['the', 'existence', 'and', 'the', 'basic', 'features', 'of', 'ionacoustic', 'ia', 'envelope', 'solitons', 'in', 'a', 'selfgravitating', 'degenerate', 'quantum', 'plasma', 'system', 'sgdqps', 'containing', 'inertial', 'nonrelativistically', 'degenerate', 'light', 'and', 'heavy', 'ion', 'species', 'as', 'well', 'as', 'inertialess', 'nonrelativistically', 'degenerate', 'positron', 'and', 'electron', 'species', 'have', 'been', 'theoretically', 'investigated', 'by', 'deriving', 'the', 'nonlinear', 'schrodinger', 'nls', 'equation', 'the', 'nls', 'equation', 'which', 'governs', 'the', 'dynamics', 'of', 'the', 'ia', 'waves', 'has', 'disclosed', 'the', 'modulationally', 'stable', 'and', 'unstable', 'regions', 'for', 'the', 'ia', 'waves', 'the', 'unstable', 'region', 'allows', 'to', 'generate', 'bright', 'envelope', 'solitons', 'which', 'are', 'modulationaly', 'stable', 'it', 'is', 'found', 'that', 'the', 'stability', 'and', 'the', 'growth', 'rate', 'dependent', 'on', 'the', 'plasma', 'parameters', 'like', 'mass', 'and', 'number', 'density', 'of', 'the', 'plasma', 'species', 'the', 'implications', 'of', 'our', 'results', 'in', 'astronomical', 'compact', 'object', 'viz', 'white', 'dwarfs', 'neutron', 'stars', 'and', 'black', 'holes', 'etc', 'are', 'briefly', 'discussed']] | [-0.12137305891942667, 0.22233046356646358, -0.04740784912868295, 0.12602101775723717, -0.0505763052352668, -0.14780831013178064, -0.03758084775280756, 0.3020111403009284, -0.1916325555594508, -0.21673017151133958, 0.0830970836204094, -0.30541621049870143, -0.059467902378171913, 0.1976022452094354, 0.03411805275768987, 0.07621246457908505, 0.07476888049047353, -0.012928915761010506, -0.012750499544289801, -0.22357947239381543, 0.3677400030275128, 0.056879996429486275, 0.24342807577995135, -0.010801041805611332, 0.10643467357988622, -0.08115317608598013, 0.014519968820923521, -0.04783258380642695, -0.1670207712783405, 0.015198633349103522, 0.21134709922123932, 0.07648422071970133, 0.1930006874523075, -0.42309416053715604, -0.32019293355185163, 0.05535632686675057, 0.21857412905222917, 0.14376854275550888, -0.10497689539117219, -0.29515935953475475, 0.02905883681924306, -0.1576288581641694, -0.22267303494158988, -0.00928541688183539, 0.06652698758267617, 0.12573410241229302, -0.2222292079669676, 0.1516712741689872, 0.06780723995770971, -0.04541429874573856, -0.13120235976458045, -0.09279759983485203, -0.1132836290418582, 0.003949343161422817, 0.06412200368182777, -0.041898125865633865, 0.14147583408959846, -0.12384239172467297, -0.010635760067709426, 0.4209749122053681, -0.09178070920923825, -0.14469720692962207, 0.21758401877239578, -0.15338090700891532, -0.07165025061270756, 0.14615566023560458, 0.1647466780408466, 0.16017382297946445, -0.1174060035598024, 0.05029112498082813, -0.03137145675231465, 0.13408671754792847, 0.1546411551460678, 0.09617181129883541, 0.29613527662821054, 0.1727238746482677, 0.003511081992958983, 0.0622562411054653, -0.11867320943847587, -0.10667147876896946, -0.25342251420699696, -0.11406324282577333, -0.1108992502468732, 0.03169877722122988, -0.05311214706380833, -0.18999660619021963, 0.38132469506948724, 0.05412986545684538, 0.14171191937716085, -0.08546706767528961, 0.27180845483695, 0.13239339392635857, -0.004012757977254169, 0.12162227096855496, 0.3174607927022978, 0.23969430016721924, 0.1441370145157846, -0.291289606265175, 0.005343420163894347, 0.07003145869965702] |
1,803.01332 | Topological Properties of the Space of Convex Minimal Usco Maps | Let X be a Tychonoff space and MC(X) be the space of convex minimal usco maps
with values in R, the space of real numbers. Such set-valued maps are important
in the study of subdifferentials of convex functions. Using the strong Choquet
game we prove complete metrizability of MC(X) with the upper Vietoris topology.
If X is normal, elements of MC(X) can be approximated in the Vietoris topology
by continuous functions. We also study first countability, second countability
and other properties of the upper Vietoris topology on MC(X).
| math.GN | let x be a tychonoff space and mcx be the space of convex minimal usco maps with values in r the space of real numbers such setvalued maps are important in the study of subdifferentials of convex functions using the strong choquet game we prove complete metrizability of mcx with the upper vietoris topology if x is normal elements of mcx can be approximated in the vietoris topology by continuous functions we also study first countability second countability and other properties of the upper vietoris topology on mcx | [['let', 'x', 'be', 'a', 'tychonoff', 'space', 'and', 'mcx', 'be', 'the', 'space', 'of', 'convex', 'minimal', 'usco', 'maps', 'with', 'values', 'in', 'r', 'the', 'space', 'of', 'real', 'numbers', 'such', 'setvalued', 'maps', 'are', 'important', 'in', 'the', 'study', 'of', 'subdifferentials', 'of', 'convex', 'functions', 'using', 'the', 'strong', 'choquet', 'game', 'we', 'prove', 'complete', 'metrizability', 'of', 'mcx', 'with', 'the', 'upper', 'vietoris', 'topology', 'if', 'x', 'is', 'normal', 'elements', 'of', 'mcx', 'can', 'be', 'approximated', 'in', 'the', 'vietoris', 'topology', 'by', 'continuous', 'functions', 'we', 'also', 'study', 'first', 'countability', 'second', 'countability', 'and', 'other', 'properties', 'of', 'the', 'upper', 'vietoris', 'topology', 'on', 'mcx']] | [-0.16486685995584016, 0.09635174773972142, -0.07957742141496221, 0.10671285524652128, -0.06370440658859232, -0.059839857609900224, 0.06304784867362204, 0.38372452018930664, -0.3194380594332787, -0.18972496430135585, 0.13000734608795028, -0.26151474812914705, -0.15730430012230168, 0.19331109647596764, -0.14705750448311763, -0.01397969307684186, 0.028966686458178712, 0.04985176857603206, -0.13096745175690475, -0.2721477917141535, 0.4045618913898414, -0.07507273924156008, 0.16632820533546197, 0.048720144158737225, 0.07822263093707575, 0.0019533815211616457, -0.00636742152379487, 0.06907835782840266, -0.1755721982600252, 0.14160001040859657, 0.2598197710758541, 0.16449713443448258, 0.22494513638825578, -0.3736602743685415, -0.14723326985470273, 0.19415027286264708, 0.030013090015431357, -0.12381325762676583, 0.019675027580392038, -0.33833284595642577, 0.10293919025306505, -0.10364512546749954, -0.09638918634101917, -0.09099310436497697, 0.0438545974267816, 0.10600998219557699, -0.26472403200089256, -0.03395307601981172, 0.0840601418484849, 0.08686703550880669, -0.09260922154962001, -0.09441453194118697, -0.11931952373759652, 0.09307766389313409, -0.006907747701254927, 0.1129395571399734, 0.05121083000498898, -0.04311552311463112, -0.1248058370441537, 0.3321868072221564, -0.10007157602178102, -0.2497816366058859, 0.13048054569993506, -0.2530471279063601, -0.1630462094749832, 0.10881631510776722, 0.14132336410693824, 0.17131989883174273, -0.08433569070290435, 0.23681859928050966, -0.1520260431253436, 0.10816797434183006, 0.054104207427537236, 0.07846222337420014, 0.11971063787032935, 0.13206148401050913, 0.16667401975295928, 0.19942826527072943, 0.007878206366016953, -0.04819530645512383, -0.34698759764432907, -0.19661017604415643, -0.18008904877139933, 0.09441943710077215, -0.14523158348344045, -0.16910583432763815, 0.32989034946182405, 0.019462539565707135, 0.1805300579448654, 0.09381922088902105, 0.2303825882475146, 0.11103085182416676, -0.019836784065277738, 0.08319107709262012, 0.15029902047139, 0.18931470345970328, -0.013648237435104833, -0.10216080478362115, 0.086043901106512, 0.1970590992343866] |
1,803.01333 | Highly Cited Papers of Ukrainian Scientists Written in Collaboration: A
Bibliometric Analysis (2011-2015) | The paper presents the results of the study of international and national
cooperation of Ukrainian scientists from different scientific fields using
citation analysis data from Scopus in the period of 2011-2015. The results show
that during the period under study, the number of documents of highly cited
Ukrainian scientists that have received enough citations to be included to the
top 1%, 5% and 10% most cited documents in the world, evidenced an increase and
were significantly different in different subjects areas. Papers written by a
group of co-authors predominate among highly cited documents of Ukrainian
scientists. Consequently, international cooperation plays an important role in
Ukrainian scientists research results visibility and impact. At the same time,
up to 16%-27% highly cited articles of Ukrainian scientists have been written
without partnering with foreign colleagues, that means a significant part of
important scientific results in Ukraine are carried out by oneself. Therefore,
for generating an optimal policy of science development in Ukraine it is
important to provide a balanced view of the expectations of the results of the
international cooperation of Ukrainian scientists and achieving a required
balance between the inter-country and international collaboration.
| cs.DL | the paper presents the results of the study of international and national cooperation of ukrainian scientists from different scientific fields using citation analysis data from scopus in the period of 20112015 the results show that during the period under study the number of documents of highly cited ukrainian scientists that have received enough citations to be included to the top 1 5 and 10 most cited documents in the world evidenced an increase and were significantly different in different subjects areas papers written by a group of coauthors predominate among highly cited documents of ukrainian scientists consequently international cooperation plays an important role in ukrainian scientists research results visibility and impact at the same time up to 1627 highly cited articles of ukrainian scientists have been written without partnering with foreign colleagues that means a significant part of important scientific results in ukraine are carried out by oneself therefore for generating an optimal policy of science development in ukraine it is important to provide a balanced view of the expectations of the results of the international cooperation of ukrainian scientists and achieving a required balance between the intercountry and international collaboration | [['the', 'paper', 'presents', 'the', 'results', 'of', 'the', 'study', 'of', 'international', 'and', 'national', 'cooperation', 'of', 'ukrainian', 'scientists', 'from', 'different', 'scientific', 'fields', 'using', 'citation', 'analysis', 'data', 'from', 'scopus', 'in', 'the', 'period', 'of', '20112015', 'the', 'results', 'show', 'that', 'during', 'the', 'period', 'under', 'study', 'the', 'number', 'of', 'documents', 'of', 'highly', 'cited', 'ukrainian', 'scientists', 'that', 'have', 'received', 'enough', 'citations', 'to', 'be', 'included', 'to', 'the', 'top', '1', '5', 'and', '10', 'most', 'cited', 'documents', 'in', 'the', 'world', 'evidenced', 'an', 'increase', 'and', 'were', 'significantly', 'different', 'in', 'different', 'subjects', 'areas', 'papers', 'written', 'by', 'a', 'group', 'of', 'coauthors', 'predominate', 'among', 'highly', 'cited', 'documents', 'of', 'ukrainian', 'scientists', 'consequently', 'international', 'cooperation', 'plays', 'an', 'important', 'role', 'in', 'ukrainian', 'scientists', 'research', 'results', 'visibility', 'and', 'impact', 'at', 'the', 'same', 'time', 'up', 'to', '1627', 'highly', 'cited', 'articles', 'of', 'ukrainian', 'scientists', 'have', 'been', 'written', 'without', 'partnering', 'with', 'foreign', 'colleagues', 'that', 'means', 'a', 'significant', 'part', 'of', 'important', 'scientific', 'results', 'in', 'ukraine', 'are', 'carried', 'out', 'by', 'oneself', 'therefore', 'for', 'generating', 'an', 'optimal', 'policy', 'of', 'science', 'development', 'in', 'ukraine', 'it', 'is', 'important', 'to', 'provide', 'a', 'balanced', 'view', 'of', 'the', 'expectations', 'of', 'the', 'results', 'of', 'the', 'international', 'cooperation', 'of', 'ukrainian', 'scientists', 'and', 'achieving', 'a', 'required', 'balance', 'between', 'the', 'intercountry', 'and', 'international', 'collaboration']] | [-0.10017204027167638, 0.10202462389705282, -0.05179408237981702, 0.056896086034355246, -0.11036639865146491, -0.06585646353915568, 0.08450593858413613, 0.3504424983274718, -0.17730632563382484, -0.40270319563478074, 0.07378842551760981, -0.3266045804067237, -0.1367960149027329, 0.23529004304382112, -0.0805812904767263, -0.015060197493105307, 0.11252128321150835, 0.01578252598980359, 0.03615291910587337, -0.3373857869666694, 0.26345863142318987, 0.1639493868993449, 0.3508265378120958, 0.05760313983834763, 0.022397725633147455, -0.02096978966780592, -0.17910382708782058, 0.002287108651045417, -0.08819007288986246, 0.16566369465444997, 0.39809979029433773, 0.19893911788459498, 0.3964522198252185, -0.4048875974377261, -0.12952334431843607, 0.04204279056589329, 0.06703961514368048, 0.021899347576307845, -0.028909452208951702, -0.31973723901182177, 0.028829225939966698, -0.2264851546110049, -0.08117160526304189, 0.0005741761972961937, 0.09636946402109808, 0.04520392990597958, -0.1813633382437429, 0.03305197976339433, 0.006725616899991886, 0.18238930746240065, -0.020049145353801978, -0.17461060064098755, -0.009946490689156411, 0.24705973768445874, 0.12937090844549823, 0.049552211383752605, 0.08361695742408906, -0.14681307816053912, -0.15483016215255044, 0.40235918889270794, -0.01345569279388627, -0.10005137346701999, 0.16922472658748763, -0.15474986065549687, -0.16488376292960807, 0.06585817429339465, 0.22817225703184557, 0.03279848565001294, -0.1696445541529482, 0.04005336236142851, -0.043904381579870644, 0.18914509070452049, 0.1313134318495569, -0.029781766667357445, 0.19353576608645823, 0.1391696641026601, -0.0012267445840663154, 0.09498738239370579, -0.014436254558197335, -0.09226981434405473, -0.21103117268542268, -0.15907813757853045, -0.14426074950853413, 0.018797258187587623, -0.01046413104357661, -0.11086676539414372, 0.4055807495792031, 0.1429382669702855, 0.07371489421820453, -0.04199793491224851, 0.20272845573996373, -0.0014241951193504465, 0.09548818165282792, 0.09100646930697974, 0.23514188708571707, 0.05893595801563982, 0.2235518128541664, -0.10793980957540386, 0.11117689064045617, -0.013781519255025498] |
1,803.01334 | On the possibility to observe neutron dark decay in nuclei | As proposed recently by Fornal and Grinstein, neutrons can undergo a dark
matter decay mode which was not observed before. Such a decay could explain the
existing discrepancy between two different methods of neutron lifetime
measurements. If such neutron decay is possible, then it should occur also is
nuclei with sufficiently low neutron binding energy. We examine a few nuclear
candidates for the dark neutron decay and we consider possibilities of their
experimental identification. In more detail we discuss the case of $^{11}$Be
which appears as the most promising nucleus for the observation of the neutron
dark decay.
| nucl-ex | as proposed recently by fornal and grinstein neutrons can undergo a dark matter decay mode which was not observed before such a decay could explain the existing discrepancy between two different methods of neutron lifetime measurements if such neutron decay is possible then it should occur also is nuclei with sufficiently low neutron binding energy we examine a few nuclear candidates for the dark neutron decay and we consider possibilities of their experimental identification in more detail we discuss the case of 11be which appears as the most promising nucleus for the observation of the neutron dark decay | [['as', 'proposed', 'recently', 'by', 'fornal', 'and', 'grinstein', 'neutrons', 'can', 'undergo', 'a', 'dark', 'matter', 'decay', 'mode', 'which', 'was', 'not', 'observed', 'before', 'such', 'a', 'decay', 'could', 'explain', 'the', 'existing', 'discrepancy', 'between', 'two', 'different', 'methods', 'of', 'neutron', 'lifetime', 'measurements', 'if', 'such', 'neutron', 'decay', 'is', 'possible', 'then', 'it', 'should', 'occur', 'also', 'is', 'nuclei', 'with', 'sufficiently', 'low', 'neutron', 'binding', 'energy', 'we', 'examine', 'a', 'few', 'nuclear', 'candidates', 'for', 'the', 'dark', 'neutron', 'decay', 'and', 'we', 'consider', 'possibilities', 'of', 'their', 'experimental', 'identification', 'in', 'more', 'detail', 'we', 'discuss', 'the', 'case', 'of', '11be', 'which', 'appears', 'as', 'the', 'most', 'promising', 'nucleus', 'for', 'the', 'observation', 'of', 'the', 'neutron', 'dark', 'decay']] | [-0.05448903881217714, 0.2313777411413588, -0.10990249558960144, 0.17430382726027402, -0.07696940166619132, -0.1323591277183851, 0.03939161968550512, 0.34561881620664986, -0.22602471714597006, -0.33618594938889146, 0.04609182001001259, -0.2981990595462219, -0.034264732562053035, 0.2050477328415656, 0.05351744219660759, 0.03537297055091975, 0.047894091268155574, 0.0839412149391731, -0.06799369622366408, -0.20233854308738658, 0.3041800652257623, 0.07406582860086038, 0.20792877376649757, 0.090175454144925, 0.02646477518921566, -0.016830808295374165, -0.003902639502336328, -0.06580736480501233, -0.15157388081317957, 0.022960106951507683, 0.23898996814743292, 0.1217249679006161, 0.17290992300947938, -0.4370713207718669, -0.21066995894498364, 0.19427897204759018, 0.1948839154614763, 0.13115538185348316, -0.13628291985217827, -0.26862980904204925, 0.08845331818720668, -0.2532833426411511, -0.11466503375666026, -0.09573015433273455, 0.05523623662943743, 0.04582260701121116, -0.22984033658131198, 0.08445972572193643, -0.003224273217005693, -0.08207722687713649, -0.11460928429554844, -0.15939391944652462, 0.0376100620083815, 0.03474224350719275, 0.15294090781850284, 0.0063927671682013545, 0.17692528076336853, -0.12031513202118174, -0.1026952540007781, 0.3797470890650792, -0.05247533270062841, -0.09332010550044324, 0.17653355142101645, -0.17323300790763935, -0.15350189157856667, 0.14305036199488202, 0.0984099289706471, 0.1375474722661572, -0.13977239036704509, 0.009176120724189286, -0.031016399048040717, 0.18563075481476832, 0.07955117053257263, 0.0849602277561718, 0.27656476239540745, 0.26208624519331725, -0.025178059731248995, 0.0797646021451421, -0.2189287623932243, -0.027787971339421347, -0.29489193023752647, -0.13044025846198676, -0.11669414679665946, 0.04978383160971357, 0.006163554651275448, -0.06884795389309221, 0.3288739205109982, 0.018093893252199098, 0.18608382837466744, -0.0450719090995892, 0.28894875953639193, 0.0724921257541591, 0.06669025632733365, 0.031154634492775918, 0.3522236603597293, 0.16874814601567556, 0.0702867205919964, -0.2698022760878488, 0.07222477646012392, -0.030405376573349824] |
1,803.01335 | CAESAR: Context Awareness Enabled Summary-Attentive Reader | Comprehending meaning from natural language is a primary objective of Natural
Language Processing (NLP), and text comprehension is the cornerstone for
achieving this objective upon which all other problems like chat bots, language
translation and others can be achieved. We report a Summary-Attentive Reader we
designed to better emulate the human reading process, along with a
dictiontary-based solution regarding out-of-vocabulary (OOV) words in the data,
to generate answer based on machine comprehension of reading passages and
question from the SQuAD benchmark. Our implementation of these features with
two popular models (Match LSTM and Dynamic Coattention) was able to reach close
to matching the results obtained from humans.
| cs.CL | comprehending meaning from natural language is a primary objective of natural language processing nlp and text comprehension is the cornerstone for achieving this objective upon which all other problems like chat bots language translation and others can be achieved we report a summaryattentive reader we designed to better emulate the human reading process along with a dictiontarybased solution regarding outofvocabulary oov words in the data to generate answer based on machine comprehension of reading passages and question from the squad benchmark our implementation of these features with two popular models match lstm and dynamic coattention was able to reach close to matching the results obtained from humans | [['comprehending', 'meaning', 'from', 'natural', 'language', 'is', 'a', 'primary', 'objective', 'of', 'natural', 'language', 'processing', 'nlp', 'and', 'text', 'comprehension', 'is', 'the', 'cornerstone', 'for', 'achieving', 'this', 'objective', 'upon', 'which', 'all', 'other', 'problems', 'like', 'chat', 'bots', 'language', 'translation', 'and', 'others', 'can', 'be', 'achieved', 'we', 'report', 'a', 'summaryattentive', 'reader', 'we', 'designed', 'to', 'better', 'emulate', 'the', 'human', 'reading', 'process', 'along', 'with', 'a', 'dictiontarybased', 'solution', 'regarding', 'outofvocabulary', 'oov', 'words', 'in', 'the', 'data', 'to', 'generate', 'answer', 'based', 'on', 'machine', 'comprehension', 'of', 'reading', 'passages', 'and', 'question', 'from', 'the', 'squad', 'benchmark', 'our', 'implementation', 'of', 'these', 'features', 'with', 'two', 'popular', 'models', 'match', 'lstm', 'and', 'dynamic', 'coattention', 'was', 'able', 'to', 'reach', 'close', 'to', 'matching', 'the', 'results', 'obtained', 'from', 'humans']] | [-0.018257923186978414, 0.00765235577654537, -0.056938325562736106, 0.11514461632948604, -0.19853785222041465, -0.203313975570546, 0.07078914631690297, 0.4109123958363419, -0.29728720858693125, -0.36706557276969154, 0.04054608260214861, -0.3238698269994486, -0.1552617341767819, 0.2434703910019293, -0.1477322091836305, 0.08176769377286768, 0.14334350459255454, 0.11306259424558708, 0.007818761272799402, -0.29249333612886924, 0.2772720417451291, 0.05498006486866091, 0.3178061073557252, 0.023623120784759522, 0.11365230513315293, -0.06000957001621524, -0.037049598861042234, -0.06761750137056446, -0.0630650252137067, 0.18296982218467053, 0.35178640582532916, 0.24992325568926477, 0.299322757594997, -0.40487550964102237, -0.17135253532213116, 0.03124890833028725, 0.12695733839867726, 0.12413391624688215, -0.017206291380959252, -0.3407468027656987, 0.11193113782709198, -0.11563765154708, 0.04568243627214716, -0.11636224978026889, -0.012369056103662367, -0.015564616571646183, -0.2517932444932826, -0.01647772796097256, 0.1496887593884908, 0.10428352791461207, -0.044962409737386876, -0.0993265408426634, 0.076495006988712, 0.2012571922725155, 0.05652071855901817, 0.12275133398583248, 0.12687132068676873, -0.18420703407942451, -0.19736150207796266, 0.4370108339403357, -0.0789907129747527, -0.21169336059441168, 0.24773499309528796, -0.026494011087786585, -0.15074950914297786, 0.038942556269466876, 0.20552544334371176, 0.07863898019395059, -0.1677259378889132, -0.0145634686934673, -0.04513168129182997, 0.2404296568461827, 0.13285854876573597, -0.019074503837951593, 0.24796637358321322, 0.2454836747298638, -0.04317031688045799, 0.1117842092151044, -0.007487152949241655, -0.09083507213120659, -0.1750641815453058, -0.11741808736031609, -0.1300420463362354, 0.00445893205968397, -0.03252832175930962, -0.1255235090674389, 0.39765571329210486, 0.273006801285027, 0.16630240119993686, 0.11730467452545695, 0.3089899585083393, 0.013955602489988363, 0.11093433173373342, 0.07841794192569242, 0.10236072384619287, -0.00805425829520183, 0.1721178132231303, -0.1627887409823459, 0.09267196182183744, 0.04191098155764242] |
1,803.01336 | Control for Networked Control Systems with Remote and Local Controllers
over Unreliable Communication Channel | This paper is concerned with the problems of optimal control and
stabilization for networked control systems (NCSs), where the remote controller
and the local controller operate the linear plant simultaneously. The main
contributions are two-fold. Firstly, a necessary and sufficient condition for
the finite horizon optimal control problem is given in terms of the two Riccati
equations. Secondly, it is shown that the system without the additive noise is
stabilizable in the mean square sense if and only if the two algebraic Riccati
equations admit the unique solutions, and a sufficient condition is given for
the boundedness in the mean square sense of the system with the additive noise.
Numerical examples about the unmanned aerial vehicle model are shown to
illustrate the effectiveness of the proposed algorithm.
| math.OC | this paper is concerned with the problems of optimal control and stabilization for networked control systems ncss where the remote controller and the local controller operate the linear plant simultaneously the main contributions are twofold firstly a necessary and sufficient condition for the finite horizon optimal control problem is given in terms of the two riccati equations secondly it is shown that the system without the additive noise is stabilizable in the mean square sense if and only if the two algebraic riccati equations admit the unique solutions and a sufficient condition is given for the boundedness in the mean square sense of the system with the additive noise numerical examples about the unmanned aerial vehicle model are shown to illustrate the effectiveness of the proposed algorithm | [['this', 'paper', 'is', 'concerned', 'with', 'the', 'problems', 'of', 'optimal', 'control', 'and', 'stabilization', 'for', 'networked', 'control', 'systems', 'ncss', 'where', 'the', 'remote', 'controller', 'and', 'the', 'local', 'controller', 'operate', 'the', 'linear', 'plant', 'simultaneously', 'the', 'main', 'contributions', 'are', 'twofold', 'firstly', 'a', 'necessary', 'and', 'sufficient', 'condition', 'for', 'the', 'finite', 'horizon', 'optimal', 'control', 'problem', 'is', 'given', 'in', 'terms', 'of', 'the', 'two', 'riccati', 'equations', 'secondly', 'it', 'is', 'shown', 'that', 'the', 'system', 'without', 'the', 'additive', 'noise', 'is', 'stabilizable', 'in', 'the', 'mean', 'square', 'sense', 'if', 'and', 'only', 'if', 'the', 'two', 'algebraic', 'riccati', 'equations', 'admit', 'the', 'unique', 'solutions', 'and', 'a', 'sufficient', 'condition', 'is', 'given', 'for', 'the', 'boundedness', 'in', 'the', 'mean', 'square', 'sense', 'of', 'the', 'system', 'with', 'the', 'additive', 'noise', 'numerical', 'examples', 'about', 'the', 'unmanned', 'aerial', 'vehicle', 'model', 'are', 'shown', 'to', 'illustrate', 'the', 'effectiveness', 'of', 'the', 'proposed', 'algorithm']] | [-0.1834729342541738, 0.0524287061677791, -0.03459447287903057, 0.03483145787769298, -0.056609197464720235, -0.18079286132477165, -0.011067134357519506, 0.3207615379273422, -0.32834823888645864, -0.2719004438002044, 0.18781893547875514, -0.23984465352442907, -0.2108144059219933, 0.19978362125139243, -0.152057052237957, 0.11989034632382196, 0.06616818137818903, 0.0880560280395833, -0.029432018798973968, -0.2927349813770151, 0.33205319265651656, 0.007884038616371465, 0.2702925053799129, 0.009121910758741846, 0.22446203130612694, -0.02570560299718063, 0.014887517827790318, 0.008307115981487308, -0.11767560167369427, 0.083084844904938, 0.2735594685948417, 0.09679205420493024, 0.3362658362336985, -0.39649101464063163, -0.16655330944762337, 0.15807350496504838, 0.12463804117704588, 0.09002392860789468, -0.02333111970641423, -0.2880956379506062, 0.1436806516941842, -0.13608220718273029, -0.1355085718687477, -0.0409288074799234, -0.015617442896633636, 0.07726500385191555, -0.34046849300424886, 0.030021913166297234, 0.0903995863425978, 0.05481407557812145, -0.1392595617056597, -0.06621732018378336, -0.0273272542165607, 0.14104997741395797, 0.01507267838538309, -0.038291726059713, 0.09437526500321866, -0.10070072671611184, -0.10104727193779188, 0.3685596115799166, 6.474352141064922e-05, -0.28710561037598925, 0.12928864797833925, -0.0934654061909853, -0.06831896358433612, 0.12851178661899965, 0.15437292692977495, 0.108090600857051, -0.18909106676386098, 0.1141139862258684, -0.04824495839879034, 0.17448567063731002, 0.004373004176015929, 0.021863456448818756, 0.1072227477341685, 0.16440000855107242, 0.21987233823165298, 0.14068789745856985, -0.019640944076804664, -0.13213969044035345, -0.34776892308530755, -0.10747652156205159, -0.15561167529864808, 0.006266898658918584, -0.07698587723033719, -0.14060699302514312, 0.3645364089876296, 0.14310391027275032, 0.10015814982383973, 0.08929206484811396, 0.3347495057744773, 0.15642710390416392, -0.021547390712703778, 0.09995314899436016, 0.22155759095234473, 0.1590419096852044, 0.10685441791131271, -0.2791582831753579, 0.07653688506670589, 0.06792009190663578] |
1,803.01337 | Evolution of the $f\sigma_8$ tension with the Planck15/$\Lambda$CDM
determination and implications for modified gravity theories | We construct an updated extended compilation of distinct (but possibly
correlated) $f\sigma_8(z)$ Redshift Space Distortion (RSD) data published
between 2006 and 2018. It consists of 63 datapoints and is significantly larger
than previously used similar datasets. After fiducial model correction we
obtain the best fit $\Omega_{0m}-\sigma_8$ $\Lambda$CDM parameters and show
that they are at a $5\sigma$ tension with the corresponding
Planck15/$\Lambda$CDM values. Introducing a nontrivial covariance matrix
correlating randomly $20\%$ of the RSD datapoints has no significant effect on
the above tension level. We show that the tension disappears (becomes less than
$1\sigma$) when a subsample of the 20 most recently published data is used. A
partial cause for this reduced tension is the fact that more recent data tend
to probe higher redshifts (with higher errorbars) where there is degeneracy
among different models due to matter domination. Allowing for a nontrivial
evolution of the effective Newton's constant as
$G_{\textrm{eff}}(z)/G_{\textrm{N}} = 1 + g_a \left(\frac{z}{1+z}\right)^2 -
g_a \left(\frac{z}{1+z}\right)^4$ ($g_a$ is a parameter) and fixing a \plcdm
background we find $g_a=-0.91\pm 0.17$ from the full $f\sigma_8$ dataset while
the 20 earliest and 20 latest datapoints imply $g_a=-1.28^{+0.28}_{-0.26}$ and
$g_a=-0.43^{+0.46}_{-0.41}$ respectively. Thus, the more recent $f\sigma_8$
data appear to favor GR in contrast to earlier data. Finally, we show that the
parametrization $f\sigma_8(z)=\lambda \sigma_8 \Omega(z)^\gamma /(1+z)^\beta$
provides an excellent fit to the solution of the growth equation for both GR
($g_a=0$) and modified gravity ($g_a\neq 0$).
| astro-ph.CO gr-qc | we construct an updated extended compilation of distinct but possibly correlated fsigma_8z redshift space distortion rsd data published between 2006 and 2018 it consists of 63 datapoints and is significantly larger than previously used similar datasets after fiducial model correction we obtain the best fit omega_0msigma_8 lambdacdm parameters and show that they are at a 5sigma tension with the corresponding planck15lambdacdm values introducing a nontrivial covariance matrix correlating randomly 20 of the rsd datapoints has no significant effect on the above tension level we show that the tension disappears becomes less than 1sigma when a subsample of the 20 most recently published data is used a partial cause for this reduced tension is the fact that more recent data tend to probe higher redshifts with higher errorbars where there is degeneracy among different models due to matter domination allowing for a nontrivial evolution of the effective newtons constant as g_textrmeffzg_textrmn 1 g_a leftfracz1zright2 g_a leftfracz1zright4 g_a is a parameter and fixing a plcdm background we find g_a091pm 017 from the full fsigma_8 dataset while the 20 earliest and 20 latest datapoints imply g_a128028_026 and g_a043046_041 respectively thus the more recent fsigma_8 data appear to favor gr in contrast to earlier data finally we show that the parametrization fsigma_8zlambda sigma_8 omegazgamma 1zbeta provides an excellent fit to the solution of the growth equation for both gr g_a0 and modified gravity g_aneq 0 | [['we', 'construct', 'an', 'updated', 'extended', 'compilation', 'of', 'distinct', 'but', 'possibly', 'correlated', 'fsigma_8z', 'redshift', 'space', 'distortion', 'rsd', 'data', 'published', 'between', '2006', 'and', '2018', 'it', 'consists', 'of', '63', 'datapoints', 'and', 'is', 'significantly', 'larger', 'than', 'previously', 'used', 'similar', 'datasets', 'after', 'fiducial', 'model', 'correction', 'we', 'obtain', 'the', 'best', 'fit', 'omega_0msigma_8', 'lambdacdm', 'parameters', 'and', 'show', 'that', 'they', 'are', 'at', 'a', '5sigma', 'tension', 'with', 'the', 'corresponding', 'planck15lambdacdm', 'values', 'introducing', 'a', 'nontrivial', 'covariance', 'matrix', 'correlating', 'randomly', '20', 'of', 'the', 'rsd', 'datapoints', 'has', 'no', 'significant', 'effect', 'on', 'the', 'above', 'tension', 'level', 'we', 'show', 'that', 'the', 'tension', 'disappears', 'becomes', 'less', 'than', '1sigma', 'when', 'a', 'subsample', 'of', 'the', '20', 'most', 'recently', 'published', 'data', 'is', 'used', 'a', 'partial', 'cause', 'for', 'this', 'reduced', 'tension', 'is', 'the', 'fact', 'that', 'more', 'recent', 'data', 'tend', 'to', 'probe', 'higher', 'redshifts', 'with', 'higher', 'errorbars', 'where', 'there', 'is', 'degeneracy', 'among', 'different', 'models', 'due', 'to', 'matter', 'domination', 'allowing', 'for', 'a', 'nontrivial', 'evolution', 'of', 'the', 'effective', 'newtons', 'constant', 'as', 'g_textrmeffzg_textrmn', '1', 'g_a', 'leftfracz1zright2', 'g_a', 'leftfracz1zright4', 'g_a', 'is', 'a', 'parameter', 'and', 'fixing', 'a', 'plcdm', 'background', 'we', 'find', 'g_a091pm', '017', 'from', 'the', 'full', 'fsigma_8', 'dataset', 'while', 'the', '20', 'earliest', 'and', '20', 'latest', 'datapoints', 'imply', 'g_a128028_026', 'and', 'g_a043046_041', 'respectively', 'thus', 'the', 'more', 'recent', 'fsigma_8', 'data', 'appear', 'to', 'favor', 'gr', 'in', 'contrast', 'to', 'earlier', 'data', 'finally', 'we', 'show', 'that', 'the', 'parametrization', 'fsigma_8zlambda', 'sigma_8', 'omegazgamma', '1zbeta', 'provides', 'an', 'excellent', 'fit', 'to', 'the', 'solution', 'of', 'the', 'growth', 'equation', 'for', 'both', 'gr', 'g_a0', 'and', 'modified', 'gravity', 'g_aneq', '0']] | [-0.0774944337396735, 0.1012508307434292, -0.06712586654147884, 0.10206028285575398, -0.10663228320396122, -0.13448672711968263, 0.052621062331921445, 0.33921050816159104, -0.19200442623182692, -0.37072574550378645, 0.060119593948467186, -0.3238085533062426, -0.05553322989173334, 0.19742177043645326, -0.03393057694451091, 0.012440267196033104, 0.06784067673153535, -0.005841626971117242, -0.08853620979443722, -0.28404795430965163, 0.2744351771725468, 0.0884358282949, 0.26753206323512, -0.011065676035064512, 0.07430843846099157, -0.052430087401283, -0.08428559771568274, 0.04349159301146423, -0.18708733503237404, 0.05600826216996458, 0.19642438375616852, 0.10971964512766251, 0.20870441387984817, -0.3459231825924702, -0.20323428811507543, 0.12609622537103646, 0.12689121446953622, 0.13541710778721344, -0.02745021703746275, -0.2602838668830027, 0.08146881655162007, -0.16972383463279053, -0.09130633695733763, -0.034090308657935844, 0.045129586613396756, -0.0725529018681016, -0.28263286249427655, 0.1775078616178504, -0.009277549083449991, 0.017732079796139066, -0.06586235204323856, -0.18023610703449072, -0.05212930614988391, 0.06419792324918264, 0.060138398277303586, 0.13294258575986045, 0.08713732286471225, -0.1202311670118985, -0.031619147550866714, 0.40569128473689653, -0.09822710370421052, -0.12794696440186976, 0.15392951317325368, -0.16412923162027654, -0.15508240674373724, 0.11600064778725756, 0.12009478528136851, 0.053564865003040744, -0.123191600418726, 0.08065536450115307, 0.0036200351728130622, 0.24321065313389265, 0.05710659870389023, -0.020723453114479276, 0.18732693134143324, 0.12557013025739108, 0.07552655530899628, 0.05337973971686819, -0.10586352548899121, -0.03044849572433538, -0.2851039768087075, -0.07664835979114813, -0.12993868688601848, 0.053544840741190404, -0.17998930614785874, -0.10778292846061054, 0.3538074778599403, 0.16621282933979417, 0.23939880851774195, 0.11075807695447708, 0.26387642442598536, 0.08555238236034736, 0.09570339589160592, 0.06469791578929618, 0.3005022765390103, 0.09509820668385006, 0.04726250956205828, -0.1717617091579506, 0.04132936373210778, -0.032870766464452264] |
1,803.01338 | Rapid Mixing of the Switch Markov Chain for Strongly Stable Degree
Sequences and 2-Class Joint Degree Matrices | The switch Markov chain has been extensively studied as the most natural
Markov Chain Monte Carlo approach for sampling graphs with prescribed degree
sequences. We use comparison arguments with other, less natural but simpler to
analyze, Markov chains, to show that the switch chain mixes rapidly in two
different settings. We first study the classic problem of uniformly sampling
simple undirected, as well as bipartite, graphs with a given degree sequence.
We apply an embedding argument, involving a Markov chain defined by Jerrum and
Sinclair (TCS, 1990) for sampling graphs that almost have a given degree
sequence, to show rapid mixing for degree sequences satisfying strong
stability, a notion closely related to $P$-stability. This results in a much
shorter proof that unifies the currently known rapid mixing results of the
switch chain and extends them up to sharp characterizations of $P$-stability.
In particular, our work resolves an open problem posed by Greenhill (SODA,
2015).
Secondly, in order to illustrate the power of our approach, we study the
problem of uniformly sampling graphs for which, in addition to the degree
sequence, a joint degree distribution is given. Although the problem was
formalized over a decade ago, and despite its practical significance in
generating synthetic network topologies, small progress has been made on the
random sampling of such graphs. The case of a single degree class reduces to
sampling of regular graphs, but beyond this almost nothing is known. We fully
resolve the case of two degree classes, by showing that the switch Markov chain
is always rapidly mixing. Again, we first analyze an auxiliary chain for
strongly stable instances on an augmented state space and then use an embedding
argument.
| cs.DM math.CO | the switch markov chain has been extensively studied as the most natural markov chain monte carlo approach for sampling graphs with prescribed degree sequences we use comparison arguments with other less natural but simpler to analyze markov chains to show that the switch chain mixes rapidly in two different settings we first study the classic problem of uniformly sampling simple undirected as well as bipartite graphs with a given degree sequence we apply an embedding argument involving a markov chain defined by jerrum and sinclair tcs 1990 for sampling graphs that almost have a given degree sequence to show rapid mixing for degree sequences satisfying strong stability a notion closely related to pstability this results in a much shorter proof that unifies the currently known rapid mixing results of the switch chain and extends them up to sharp characterizations of pstability in particular our work resolves an open problem posed by greenhill soda 2015 secondly in order to illustrate the power of our approach we study the problem of uniformly sampling graphs for which in addition to the degree sequence a joint degree distribution is given although the problem was formalized over a decade ago and despite its practical significance in generating synthetic network topologies small progress has been made on the random sampling of such graphs the case of a single degree class reduces to sampling of regular graphs but beyond this almost nothing is known we fully resolve the case of two degree classes by showing that the switch markov chain is always rapidly mixing again we first analyze an auxiliary chain for strongly stable instances on an augmented state space and then use an embedding argument | [['the', 'switch', 'markov', 'chain', 'has', 'been', 'extensively', 'studied', 'as', 'the', 'most', 'natural', 'markov', 'chain', 'monte', 'carlo', 'approach', 'for', 'sampling', 'graphs', 'with', 'prescribed', 'degree', 'sequences', 'we', 'use', 'comparison', 'arguments', 'with', 'other', 'less', 'natural', 'but', 'simpler', 'to', 'analyze', 'markov', 'chains', 'to', 'show', 'that', 'the', 'switch', 'chain', 'mixes', 'rapidly', 'in', 'two', 'different', 'settings', 'we', 'first', 'study', 'the', 'classic', 'problem', 'of', 'uniformly', 'sampling', 'simple', 'undirected', 'as', 'well', 'as', 'bipartite', 'graphs', 'with', 'a', 'given', 'degree', 'sequence', 'we', 'apply', 'an', 'embedding', 'argument', 'involving', 'a', 'markov', 'chain', 'defined', 'by', 'jerrum', 'and', 'sinclair', 'tcs', '1990', 'for', 'sampling', 'graphs', 'that', 'almost', 'have', 'a', 'given', 'degree', 'sequence', 'to', 'show', 'rapid', 'mixing', 'for', 'degree', 'sequences', 'satisfying', 'strong', 'stability', 'a', 'notion', 'closely', 'related', 'to', 'pstability', 'this', 'results', 'in', 'a', 'much', 'shorter', 'proof', 'that', 'unifies', 'the', 'currently', 'known', 'rapid', 'mixing', 'results', 'of', 'the', 'switch', 'chain', 'and', 'extends', 'them', 'up', 'to', 'sharp', 'characterizations', 'of', 'pstability', 'in', 'particular', 'our', 'work', 'resolves', 'an', 'open', 'problem', 'posed', 'by', 'greenhill', 'soda', '2015', 'secondly', 'in', 'order', 'to', 'illustrate', 'the', 'power', 'of', 'our', 'approach', 'we', 'study', 'the', 'problem', 'of', 'uniformly', 'sampling', 'graphs', 'for', 'which', 'in', 'addition', 'to', 'the', 'degree', 'sequence', 'a', 'joint', 'degree', 'distribution', 'is', 'given', 'although', 'the', 'problem', 'was', 'formalized', 'over', 'a', 'decade', 'ago', 'and', 'despite', 'its', 'practical', 'significance', 'in', 'generating', 'synthetic', 'network', 'topologies', 'small', 'progress', 'has', 'been', 'made', 'on', 'the', 'random', 'sampling', 'of', 'such', 'graphs', 'the', 'case', 'of', 'a', 'single', 'degree', 'class', 'reduces', 'to', 'sampling', 'of', 'regular', 'graphs', 'but', 'beyond', 'this', 'almost', 'nothing', 'is', 'known', 'we', 'fully', 'resolve', 'the', 'case', 'of', 'two', 'degree', 'classes', 'by', 'showing', 'that', 'the', 'switch', 'markov', 'chain', 'is', 'always', 'rapidly', 'mixing', 'again', 'we', 'first', 'analyze', 'an', 'auxiliary', 'chain', 'for', 'strongly', 'stable', 'instances', 'on', 'an', 'augmented', 'state', 'space', 'and', 'then', 'use', 'an', 'embedding', 'argument']] | [-0.10546210646799575, 0.12423107144574086, -0.036649628874867085, 0.07540746155740713, -0.07380620762371995, -0.13988822225838446, 0.05087498649512501, 0.43127503053795907, -0.3125903815015196, -0.29476250940933824, 0.11636999639637408, -0.2311204022604398, -0.14434685778143186, 0.19629193471384146, -0.09301246651348168, 0.04523460808653204, 0.09631669173921763, 0.035144517093055674, -0.023796784256102592, -0.27071083124683615, 0.29376111194945365, 0.051463181275509695, 0.25866563354558764, 0.013312787815634709, 0.11106317822227262, 0.04879157706084544, -0.009791947642548217, 0.022652202289059967, -0.16173762665265806, 0.11026654348251373, 0.21257020718347963, 0.13891483761710666, 0.27645375611307266, -0.36716920582370627, -0.2147992075233984, 0.16519651491542123, 0.13178593234332633, 0.1316318293056187, -0.031660406932478444, -0.25444727819613233, 0.08983009751580695, -0.16355804100676063, -0.12241461478661092, -0.07203543465083806, 0.013600019195641133, 0.01847683862569378, -0.2716365987434983, -0.002516043618426568, 0.12341597882027681, 0.06432250256092692, 0.037974904149255, -0.11070912995369017, 0.014814865169545976, 0.1003338515150985, 0.03417655734172571, 0.055614102835847085, 0.027769764092513843, -0.0745504459442978, -0.1929055243950858, 0.3023690187395634, -0.040766102446439384, -0.17633342007542277, 0.20887216718284926, -0.1003007648869895, -0.20618430349147981, 0.11264458155938788, 0.12822326872411008, 0.16567366183852264, -0.14361929574415527, 0.10263250260964356, -0.07827741556590603, 0.1610790653764287, 0.09444120763483921, -0.01572293581901699, 0.11582012872435286, 0.17135221476743406, 0.12314060846707486, 0.2010806232132101, -0.007962948035246002, -0.16714042471721768, -0.2202602400407729, -0.13781862288415533, -0.2147570090588703, 0.05770807355637311, -0.09948802874886721, -0.18772780047863136, 0.4040720736053789, 0.13310368154769772, 0.2009973304311154, 0.1309632586326123, 0.24175312176453598, 0.09411153758043177, 0.016160009344572394, 0.08911947278793247, 0.15466569967495528, 0.1768651048437522, 0.05512947411698666, -0.1328898852951424, 0.0981028881224413, 0.08098715456122513] |
1,803.01339 | Multiple Sound Source Localisation with Steered Response Power Density
and Hierarchical Grid Refinement | Estimation of the direction-of-arrival (DOA) of sound sources is an important
step in sound field analysis. Rigid spherical microphone arrays allow the
calculation of a compact spherical harmonic representation of the sound field.
A basic method for analysing sound fields recorded using such arrays is steered
response power (SRP) maps wherein the source DOA can be estimated as the
steering direction that maximises the output power of a maximally-directive
beam. This approach is computationally costly since it requires steering the
beam in all possible directions. This paper presents an extension to SRP called
steered response power density (SRPD) and an associated, signal-adaptive search
method called hierarchical grid refinement (HiGRID) for reducing the number of
steering directions needed for DOA estimation. The proposed method can localise
coherent as well as incoherent sources while jointly providing the number of
prominent sources in the scene. It is shown to be robust to reverberation and
additive white noise. An evaluation of the proposed method using simulations
and real recordings under highly reverberant conditions as well as a comparison
with state- of-the-art methods are presented.
| cs.SD cs.MM eess.AS | estimation of the directionofarrival doa of sound sources is an important step in sound field analysis rigid spherical microphone arrays allow the calculation of a compact spherical harmonic representation of the sound field a basic method for analysing sound fields recorded using such arrays is steered response power srp maps wherein the source doa can be estimated as the steering direction that maximises the output power of a maximallydirective beam this approach is computationally costly since it requires steering the beam in all possible directions this paper presents an extension to srp called steered response power density srpd and an associated signaladaptive search method called hierarchical grid refinement higrid for reducing the number of steering directions needed for doa estimation the proposed method can localise coherent as well as incoherent sources while jointly providing the number of prominent sources in the scene it is shown to be robust to reverberation and additive white noise an evaluation of the proposed method using simulations and real recordings under highly reverberant conditions as well as a comparison with state oftheart methods are presented | [['estimation', 'of', 'the', 'directionofarrival', 'doa', 'of', 'sound', 'sources', 'is', 'an', 'important', 'step', 'in', 'sound', 'field', 'analysis', 'rigid', 'spherical', 'microphone', 'arrays', 'allow', 'the', 'calculation', 'of', 'a', 'compact', 'spherical', 'harmonic', 'representation', 'of', 'the', 'sound', 'field', 'a', 'basic', 'method', 'for', 'analysing', 'sound', 'fields', 'recorded', 'using', 'such', 'arrays', 'is', 'steered', 'response', 'power', 'srp', 'maps', 'wherein', 'the', 'source', 'doa', 'can', 'be', 'estimated', 'as', 'the', 'steering', 'direction', 'that', 'maximises', 'the', 'output', 'power', 'of', 'a', 'maximallydirective', 'beam', 'this', 'approach', 'is', 'computationally', 'costly', 'since', 'it', 'requires', 'steering', 'the', 'beam', 'in', 'all', 'possible', 'directions', 'this', 'paper', 'presents', 'an', 'extension', 'to', 'srp', 'called', 'steered', 'response', 'power', 'density', 'srpd', 'and', 'an', 'associated', 'signaladaptive', 'search', 'method', 'called', 'hierarchical', 'grid', 'refinement', 'higrid', 'for', 'reducing', 'the', 'number', 'of', 'steering', 'directions', 'needed', 'for', 'doa', 'estimation', 'the', 'proposed', 'method', 'can', 'localise', 'coherent', 'as', 'well', 'as', 'incoherent', 'sources', 'while', 'jointly', 'providing', 'the', 'number', 'of', 'prominent', 'sources', 'in', 'the', 'scene', 'it', 'is', 'shown', 'to', 'be', 'robust', 'to', 'reverberation', 'and', 'additive', 'white', 'noise', 'an', 'evaluation', 'of', 'the', 'proposed', 'method', 'using', 'simulations', 'and', 'real', 'recordings', 'under', 'highly', 'reverberant', 'conditions', 'as', 'well', 'as', 'a', 'comparison', 'with', 'state', 'oftheart', 'methods', 'are', 'presented']] | [-0.10465024838337181, 0.07498030865855652, -0.06563924915567672, 0.01117356137325198, -0.08033818055580944, -0.14750329761813252, -0.027345341519126404, 0.42743996290837305, -0.26471187081714137, -0.28833301851557475, 0.12511701334733516, -0.23194947688824544, -0.13341223131891572, 0.24610826413911416, -0.08675716133817167, 0.10417451180378239, 0.05336003988391935, 0.01674092767561528, -0.01902759428389928, -0.16419411097366446, 0.24138672143881246, 0.1210115331588155, 0.335551576846737, -0.023151973271966084, 0.16203299333146737, 0.038693083774122165, -0.05343747542023995, 0.043633472132312376, -0.017302183838408917, 0.11351499508929538, 0.2916077221822688, 0.1736320696894795, 0.2532493574281702, -0.39524314417319617, -0.23580147861108436, 0.09758040804342277, 0.14237622885670811, 0.11853030155064923, -0.05222952231701653, -0.3250923146530565, 0.0660303247254605, -0.16110180185102768, -0.11469321319107283, -0.09864607406517038, -0.020466098388246562, 0.032751572362770785, -0.30875318672897367, 0.058975060716716016, 0.05499105429668821, 0.052711335521212405, -0.04585490545710433, -0.09774239802743587, 0.044871394744795345, 0.1360956247544737, 0.02923330320518906, 0.046729950587486184, 0.12698357664364374, -0.11037304010610544, -0.10107615491701553, 0.386483117114913, -0.05293144137364428, -0.25182416047216893, 0.14254228172476513, -0.07082239324016507, -0.07174438627510421, 0.15936570285982585, 0.20395758964376534, 0.13046443336353886, -0.1573947049305106, -0.00992198291696387, -0.0319975869773524, 0.21150966592680262, 0.0837982489818202, 0.008866907573583941, 0.20960917507724489, 0.18053863224399797, 0.12837519079425747, 0.17795149167068303, -0.17347803663631434, -0.013214903325565939, -0.2915588735055578, -0.12838179941978412, -0.23364765727155878, -0.016950805407769894, -0.08472897655155975, -0.15602605193698815, 0.4124519688072009, 0.17371207814762962, 0.13177581271419755, 0.044883269490411055, 0.4080274324064369, 0.11904462979709214, 0.021795032662997222, 0.07537403272854237, 0.20112623061753263, 0.13936461563390484, 0.08567930213017863, -0.19306047584816793, 0.060920871903404256, 0.009959999048335236] |
1,803.0134 | Stereotype approximation property for the group algebra ${\mathcal
C}^\star(G)$ of measures | The stereotype approximation property is formally a stronger condition than
the classical approximation property, and because of that the question which
spaces possess the stereotype approximation property is quite difficult. In
this paper we show that the group algebra ${\mathcal C}^\star(G)$ of measures
on a locally compact grop $G$ always has this property.
| math.FA | the stereotype approximation property is formally a stronger condition than the classical approximation property and because of that the question which spaces possess the stereotype approximation property is quite difficult in this paper we show that the group algebra mathcal cstarg of measures on a locally compact grop g always has this property | [['the', 'stereotype', 'approximation', 'property', 'is', 'formally', 'a', 'stronger', 'condition', 'than', 'the', 'classical', 'approximation', 'property', 'and', 'because', 'of', 'that', 'the', 'question', 'which', 'spaces', 'possess', 'the', 'stereotype', 'approximation', 'property', 'is', 'quite', 'difficult', 'in', 'this', 'paper', 'we', 'show', 'that', 'the', 'group', 'algebra', 'mathcal', 'cstarg', 'of', 'measures', 'on', 'a', 'locally', 'compact', 'grop', 'g', 'always', 'has', 'this', 'property']] | [-0.14604768242973548, 0.0825890858586018, -0.17211907206533048, 0.12255221149937895, -0.10384739562869072, -0.11887027550703631, 0.003491957154787647, 0.3897028183564544, -0.3102929529805596, -0.19918081977476293, 0.10148654088306312, -0.2292263410322798, -0.19444382291000623, 0.15823493962391064, -0.11802884101724395, -0.03357211557718424, 0.08556008152663708, 0.10601243724186833, -0.09262708115364568, -0.2347347970980291, 0.37816349818156314, 0.010897646756627811, 0.30054446094884324, 0.05412182226203955, 0.1061398684217308, -0.022260283916973725, 0.05709931027377024, 0.07081596554221156, -0.11148206851262679, 0.09338495795292637, 0.2316517708106683, 0.10611833216479191, 0.3314192376744289, -0.33061303277141774, -0.1495405170851602, 0.1964944088831544, 0.1165068124850782, 0.0012677313397244478, -0.043464081558900386, -0.2341929193980132, 0.173917835426087, -0.16390854916356218, -0.15205091087577435, -0.06502461128939803, 0.07964868436997327, -0.07565333280497445, -0.257894850622576, 0.008115339603346702, 0.21051866097304112, 0.03378665758869969, -0.03104409789487433, -0.03259185196545262, -0.016931849657199703, 0.03576023627717335, 0.015447864085077666, 0.07272983998812449, 0.04782785276452509, -0.08237026079307096, -0.04782860326723984, 0.42017686660759723, -0.04009507243356963, -0.2511017928258158, 0.18209733699376768, -0.18294812480990702, -0.19875049053762966, 0.07354196238940439, 0.0621592614266914, 0.17071668327284548, -0.10281364638089704, 0.1867260313402557, -0.1570719970891682, 0.11875670231305636, 0.044719362523979865, 0.10070573547496818, 0.05866616115403863, 0.0881865861458489, 0.13656812374336788, 0.1153901706252677, 0.06629602429725659, -0.05602673137036618, -0.2751959666179923, -0.15580481473499766, -0.161923358122854, 0.09989982345499672, -0.060020848365149086, -0.2262927936927344, 0.3457872418086761, 0.1300451958478124, 0.14287395830335578, 0.10802642983393386, 0.2595145747853586, 0.13859022976024649, 0.09004306412624338, 0.09586801073209454, 0.20970827631222513, 0.17836985583058917, -0.008128609624691308, -0.13712605845648795, 0.11963453450992417, 0.1710859877952876] |
1,803.01341 | Hyper-Stresses in $k$-Jet Field Theories | For high-order continuum mechanics and classical field theories
configurations are modeled as sections of general fiber bundles and generalized
velocities are modeled as variations thereof. Smooth stress fields are
considered and it is shown that three distinct mathematical stress objects play
the roles of the traditional stress tensor of continuum mechanics in Euclidean
spaces. These objects are referred to as the variational hyper-stress, the
traction hyper-stress and the non-holonomic stress. The properties of these
three stress objects and the relations between them are studied.
| math-ph math.MP | for highorder continuum mechanics and classical field theories configurations are modeled as sections of general fiber bundles and generalized velocities are modeled as variations thereof smooth stress fields are considered and it is shown that three distinct mathematical stress objects play the roles of the traditional stress tensor of continuum mechanics in euclidean spaces these objects are referred to as the variational hyperstress the traction hyperstress and the nonholonomic stress the properties of these three stress objects and the relations between them are studied | [['for', 'highorder', 'continuum', 'mechanics', 'and', 'classical', 'field', 'theories', 'configurations', 'are', 'modeled', 'as', 'sections', 'of', 'general', 'fiber', 'bundles', 'and', 'generalized', 'velocities', 'are', 'modeled', 'as', 'variations', 'thereof', 'smooth', 'stress', 'fields', 'are', 'considered', 'and', 'it', 'is', 'shown', 'that', 'three', 'distinct', 'mathematical', 'stress', 'objects', 'play', 'the', 'roles', 'of', 'the', 'traditional', 'stress', 'tensor', 'of', 'continuum', 'mechanics', 'in', 'euclidean', 'spaces', 'these', 'objects', 'are', 'referred', 'to', 'as', 'the', 'variational', 'hyperstress', 'the', 'traction', 'hyperstress', 'and', 'the', 'nonholonomic', 'stress', 'the', 'properties', 'of', 'these', 'three', 'stress', 'objects', 'and', 'the', 'relations', 'between', 'them', 'are', 'studied']] | [-0.1294342849384217, 0.14949188175974304, -0.07676296952524267, 0.10736016124359421, -0.04701652135450526, -0.10016211641154119, -0.13371526638400696, 0.4079276428979245, -0.2849234529726562, -0.2778559456401992, 0.09204852789463032, -0.22103863076994285, -0.19290280306623095, 0.1697440471145369, -0.07404950085938686, 0.0681470831567865, 0.0030729233597715697, 0.013136689318343997, -0.0424802066852516, -0.1892659774083378, 0.35735039673801067, -0.02403931098108712, 0.2974060146093723, 0.004681527112898905, 0.11926310990072254, -0.015774976872351198, -0.048082608818298296, 0.11249461492046803, -0.10902465473338366, 0.13223407772325335, 0.2669917603710755, 0.057942446254725964, 0.21299531499278687, -0.45217417453282643, -0.2594415208967846, 0.08047558387625031, 0.05518648642048772, 0.06166945965517135, 0.06727612811318111, -0.2749227533516075, 0.018455644487403333, -0.12135023072118029, -0.13022045586590789, -0.10776839622606833, 0.04580010690066653, 0.07738721145627399, -0.18278888585267677, 0.11785292012271904, 0.07243630544620655, 0.09823435378660049, -0.13035623409086838, -0.15122536703849965, -0.10663646631569247, 0.15024513606026413, 0.07841239370948945, -0.015284216369590944, 0.17974463706126526, -0.15237670338025228, -0.10556354701319444, 0.4412346488042247, 0.03046835832563894, -0.2661812604804124, 0.21710630540092962, -0.04261847775030349, -0.1244755680007594, 0.10854354448106494, 0.17501334846019745, 0.14026491947117306, -0.14194882697691874, 0.027090865971071514, -0.0026507321467977903, 0.044403929551619856, 0.10238045903610155, 0.03350550872398474, 0.23239148851661456, 0.06193240331707611, -0.020201504901273266, 0.0940008612648983, -0.07753303113505743, -0.15784665971226614, -0.365142964381015, -0.17463873325669693, -0.1250250025519303, 0.03804843434045324, -0.1032106376333104, -0.17529973622038683, 0.2778357015811794, 0.04833102060711965, 0.15197093006558826, 0.08095609605134953, 0.23300836071194636, 0.09895357621107473, 0.0833052465791947, 0.027338800896402626, 0.3252847739938824, 0.24500102620749248, 0.0859082065345276, -0.1348170460052123, -0.022333206764111917, 0.09470964175471593] |
1,803.01342 | A topological-like gravity model in a four dimensional space-time | In this work we consider a model for gravity in 4-dimensional space-time
originally proposed by A. Chamseddine which may be derived by a 5-dimensional
Chern-Simons theory. Its topological origin makes it an interesting candidate
for an easier quantization, e.g., in loop quantization framework. The present
work is dedicated to classical physical consequences and canonical analysis of
the model. Cosmological solutions as well as wave-like solutions were obtained
and compared with the corresponding Einstein's General Relativity with
cosmological constant.
| gr-qc | in this work we consider a model for gravity in 4dimensional spacetime originally proposed by a chamseddine which may be derived by a 5dimensional chernsimons theory its topological origin makes it an interesting candidate for an easier quantization eg in loop quantization framework the present work is dedicated to classical physical consequences and canonical analysis of the model cosmological solutions as well as wavelike solutions were obtained and compared with the corresponding einsteins general relativity with cosmological constant | [['in', 'this', 'work', 'we', 'consider', 'a', 'model', 'for', 'gravity', 'in', '4dimensional', 'spacetime', 'originally', 'proposed', 'by', 'a', 'chamseddine', 'which', 'may', 'be', 'derived', 'by', 'a', '5dimensional', 'chernsimons', 'theory', 'its', 'topological', 'origin', 'makes', 'it', 'an', 'interesting', 'candidate', 'for', 'an', 'easier', 'quantization', 'eg', 'in', 'loop', 'quantization', 'framework', 'the', 'present', 'work', 'is', 'dedicated', 'to', 'classical', 'physical', 'consequences', 'and', 'canonical', 'analysis', 'of', 'the', 'model', 'cosmological', 'solutions', 'as', 'well', 'as', 'wavelike', 'solutions', 'were', 'obtained', 'and', 'compared', 'with', 'the', 'corresponding', 'einsteins', 'general', 'relativity', 'with', 'cosmological', 'constant']] | [-0.10085352951398072, 0.0615760431918226, -0.10287742319707878, 0.09982299321116163, -0.12551005924335465, -0.19389603171163264, -0.03995475219413399, 0.27951291592146915, -0.20572948335216212, -0.3207238766675194, 0.09586384750675792, -0.21900693833445892, -0.22516006637269106, 0.17371540639746505, -0.08902305855344121, 0.07109286011575769, -0.007994294587451104, 0.05929956572034802, -0.07720945723420487, -0.22917713024593794, 0.3363063796124875, 0.1366187753752829, 0.22516988805578783, -0.02438733283466158, 0.09916647867514537, -0.025893482504985653, -0.030571618403952856, 0.08197583002411427, -0.15647088502569553, 0.0707912948445226, 0.21910858750104523, 0.10520953258786064, 0.20481876654622072, -0.417134145155358, -0.2937328719223539, 0.041975284759432845, 0.11783962364018244, 0.18409152251805586, -0.07142313638625918, -0.32364049200446177, 0.07408797374955611, -0.19780520168849483, -0.15639376538829544, -0.0814017849520613, 0.005418001154724222, -0.08699698322930206, -0.20304864148000398, 0.06908552437865485, 0.018245187499978315, -0.0043576139335831, -0.11757593506571049, -0.0682588797629787, 0.01657730070814395, 0.05897383006791083, 0.11269482133092168, 0.05987507494118733, 0.051996743927399315, -0.11603763148200531, -0.16027506552815723, 0.46541463024914265, -0.09631227909658964, -0.25727261175126886, 0.14567319930304223, -0.08544842596762837, -0.1357687870339037, 0.05218911440207217, 0.09659553478018214, 0.1706034745931482, -0.170103464084558, 0.16324266865819645, -0.03776353739130382, 0.10831184051214503, 0.06843907720683955, 0.027961941385934226, 0.27618135483219075, 0.12648168503521726, 0.01063238502217409, 0.13344446531323811, -0.01180159407429015, -0.13849780324082345, -0.35563295494574004, -0.18426855384873655, -0.13257308148492414, 0.11744128493816018, -0.11560975659887891, -0.15523287143486625, 0.3468102819692248, 0.12827499061360215, 0.16886257322934958, 0.05134656621913354, 0.27253793655202174, 0.10292571329046041, 0.04092771656369456, 0.04853029561658891, 0.2794165512933455, 0.16197270469153105, 0.11827660792877372, -0.18224220355757728, -0.03518517856868223, 0.11010190819461758] |
1,803.01343 | The effect of twitter-mediated activities on learning outcome and
student engagement: A case study | The study reported in this paper, examines the effects of a rigorously
designed introduction of Twitter in the educational process. In specific, it
examines the relation between the students use of Twitter in the context of
well-organized educational activities and their grades in an academic course.
The results demonstrated a significant correlation between the use of Twitter
by the students and their performance in the course. Moreover, it emerged that
their participation on Twitter, could improve the students academic engagement
and their sense of belonging to the academic community. Finally, possible
effects of Twitter s use on students perceived internet self-efficacy were also
examined. The findings and their implications of the study are discussed in
detail.
| cs.CY | the study reported in this paper examines the effects of a rigorously designed introduction of twitter in the educational process in specific it examines the relation between the students use of twitter in the context of wellorganized educational activities and their grades in an academic course the results demonstrated a significant correlation between the use of twitter by the students and their performance in the course moreover it emerged that their participation on twitter could improve the students academic engagement and their sense of belonging to the academic community finally possible effects of twitter s use on students perceived internet selfefficacy were also examined the findings and their implications of the study are discussed in detail | [['the', 'study', 'reported', 'in', 'this', 'paper', 'examines', 'the', 'effects', 'of', 'a', 'rigorously', 'designed', 'introduction', 'of', 'twitter', 'in', 'the', 'educational', 'process', 'in', 'specific', 'it', 'examines', 'the', 'relation', 'between', 'the', 'students', 'use', 'of', 'twitter', 'in', 'the', 'context', 'of', 'wellorganized', 'educational', 'activities', 'and', 'their', 'grades', 'in', 'an', 'academic', 'course', 'the', 'results', 'demonstrated', 'a', 'significant', 'correlation', 'between', 'the', 'use', 'of', 'twitter', 'by', 'the', 'students', 'and', 'their', 'performance', 'in', 'the', 'course', 'moreover', 'it', 'emerged', 'that', 'their', 'participation', 'on', 'twitter', 'could', 'improve', 'the', 'students', 'academic', 'engagement', 'and', 'their', 'sense', 'of', 'belonging', 'to', 'the', 'academic', 'community', 'finally', 'possible', 'effects', 'of', 'twitter', 's', 'use', 'on', 'students', 'perceived', 'internet', 'selfefficacy', 'were', 'also', 'examined', 'the', 'findings', 'and', 'their', 'implications', 'of', 'the', 'study', 'are', 'discussed', 'in', 'detail']] | [-0.04764345888217012, 0.0804114025900319, -0.06596377968852377, 0.1305640752820464, -0.11794750785037618, -0.0671297640716336, 0.09895610312453536, 0.4282610237855336, -0.1958059874555931, -0.3684548534099655, 0.057147793115542175, -0.3276773630842117, -0.22430962314508085, 0.19436411652312582, -0.08365465568354481, -0.004100217235049811, 0.049650357561466955, 0.09720254747766187, -0.03874328519179534, -0.3796087662520786, 0.3290555828154601, 0.11303105391561985, 0.3644094051921676, 0.12129611953850113, 0.0337868407930665, -0.016778976240010676, -0.15410578790409812, -0.009820415662473133, -0.11138374826717562, 0.16581130875595684, 0.35723169559034806, 0.1951808906320868, 0.4155350287910551, -0.39833588012622606, -0.13439100802522794, 0.0329653309449425, 0.10399384995328327, 0.04834498260330794, -0.058909037749580076, -0.3743956377890346, 0.03734473520809592, -0.221002375241369, -0.08349468162010328, -0.024420852138628733, 0.036923023740608435, 0.037515648534814504, -0.13851806755852084, 0.02240296063622548, 0.04814438964240253, 0.16996962125091974, -0.02789437300189406, -0.1018739310554871, -0.011323354588339812, 0.25296046908398895, 0.14096176453262912, -0.06900022708578035, 0.14109820296088682, -0.1753887533720037, -0.17765234283960407, 0.38114342138428114, -0.0050518280642853795, -0.13116881994787474, 0.2045621559473461, -0.12101365183881516, -0.12359828797193116, -0.021384920475297962, 0.2851348458909719, 0.07083078369434023, -0.17781336395198416, 0.032522133975048904, -0.012020296613878474, 0.14419404138682473, 0.06040593456268182, -0.02153545924349977, 0.1893771312797667, 0.17492128373123705, -0.02056405616167467, 0.1212208266952075, -0.011284331506086064, -0.07700173250160677, -0.23805159112440566, -0.20064034903068736, -0.13507010753202284, 0.00146591998155004, -0.05586918622429948, -0.12073801213811183, 0.4392642596704436, 0.2064920402241616, 0.09279775210848913, -0.004561302372543463, 0.21698273282401778, 0.013885912926996062, 0.033846069997927206, 0.05468099142107631, 0.24153916456521857, 0.05243974851428306, 0.23994886346867886, -0.19877293113024969, 0.1381717681752293, -0.05474785026283292] |
1,803.01344 | Latitude dependence of convection and magnetic field generation in the
cube | The 3D thermal convection in the Boussinesq approximation with heating from
below and dynamo in the cube are considered. We study dependence of the
convection intensity and magnetic field generation on the latitude in
$\beta$-plane approximation. It is shown that kinetic energy gradually
increases from the poles to the equator more than order of magnitude. The model
predicts the strong azimuthal thermal wind, which direction depends on the sign
of the thermal convective fluctuations. The spatial scale of the arising flow
is comparable to the scale of the physical domain. The magnetic energy
increases as well, however dynamo efficiency, i.e., the ratio of the magnetic
energy to the kinetic one decreases to the equator. This effect can explain
predominance of the dipole configuration of the magnetic field observed in the
planets and stars. The approach is useful for modeling of the
magnetohydrodynamic turbulence in planetary cores and stellar convective zones.
| physics.flu-dyn | the 3d thermal convection in the boussinesq approximation with heating from below and dynamo in the cube are considered we study dependence of the convection intensity and magnetic field generation on the latitude in betaplane approximation it is shown that kinetic energy gradually increases from the poles to the equator more than order of magnitude the model predicts the strong azimuthal thermal wind which direction depends on the sign of the thermal convective fluctuations the spatial scale of the arising flow is comparable to the scale of the physical domain the magnetic energy increases as well however dynamo efficiency ie the ratio of the magnetic energy to the kinetic one decreases to the equator this effect can explain predominance of the dipole configuration of the magnetic field observed in the planets and stars the approach is useful for modeling of the magnetohydrodynamic turbulence in planetary cores and stellar convective zones | [['the', '3d', 'thermal', 'convection', 'in', 'the', 'boussinesq', 'approximation', 'with', 'heating', 'from', 'below', 'and', 'dynamo', 'in', 'the', 'cube', 'are', 'considered', 'we', 'study', 'dependence', 'of', 'the', 'convection', 'intensity', 'and', 'magnetic', 'field', 'generation', 'on', 'the', 'latitude', 'in', 'betaplane', 'approximation', 'it', 'is', 'shown', 'that', 'kinetic', 'energy', 'gradually', 'increases', 'from', 'the', 'poles', 'to', 'the', 'equator', 'more', 'than', 'order', 'of', 'magnitude', 'the', 'model', 'predicts', 'the', 'strong', 'azimuthal', 'thermal', 'wind', 'which', 'direction', 'depends', 'on', 'the', 'sign', 'of', 'the', 'thermal', 'convective', 'fluctuations', 'the', 'spatial', 'scale', 'of', 'the', 'arising', 'flow', 'is', 'comparable', 'to', 'the', 'scale', 'of', 'the', 'physical', 'domain', 'the', 'magnetic', 'energy', 'increases', 'as', 'well', 'however', 'dynamo', 'efficiency', 'ie', 'the', 'ratio', 'of', 'the', 'magnetic', 'energy', 'to', 'the', 'kinetic', 'one', 'decreases', 'to', 'the', 'equator', 'this', 'effect', 'can', 'explain', 'predominance', 'of', 'the', 'dipole', 'configuration', 'of', 'the', 'magnetic', 'field', 'observed', 'in', 'the', 'planets', 'and', 'stars', 'the', 'approach', 'is', 'useful', 'for', 'modeling', 'of', 'the', 'magnetohydrodynamic', 'turbulence', 'in', 'planetary', 'cores', 'and', 'stellar', 'convective', 'zones']] | [-0.14476406353060156, 0.19469222908839584, -0.017191221325968703, 0.10664640947400282, -0.07250856769345167, 0.019310773421699803, -0.011466680558708807, 0.3083992179979881, -0.27502252330693105, -0.3614509579663475, 0.052825657548916445, -0.240080190350612, -0.05790397780636947, 0.1957251764088869, 0.0031422749355745814, -0.0022358172802099336, 0.022951507821368674, 0.014376633241772652, -0.011160715004274001, -0.15699116951397932, 0.3200854362299045, 0.11570203461994727, 0.2568753100372851, 0.060038113088036575, 0.051987771714727085, -0.11000550262785207, -0.006294070404643814, 0.030909393392503263, -0.1278392548256185, 0.025021744637439648, 0.144119048876067, 0.014093112320794413, 0.2218475406045036, -0.4689282828569412, -0.25014094104369483, 0.03932621193428834, 0.16948136650957168, 0.0916044965130277, 0.0031525504607513234, -0.19244664498915276, 0.04642856536743541, -0.12687916288773218, -0.14838043807307258, -0.008939260182281335, 0.010475435978733003, 0.045476256187539546, -0.3041360237573584, 0.13329243666570012, 0.08936213682289235, 0.10317387000347177, -0.13396618907960753, -0.1218763094364355, -0.11781271849603703, 0.09403647449798883, 0.13813544610282405, 0.07742999859309445, 0.19111014271737076, -0.17951841941569, -0.013464928350100915, 0.4103804534984132, -0.10208509190211772, -0.14766077517842252, 0.18739488421628872, -0.24808396568521857, -0.04303540424016925, 0.17896028108584383, 0.18419209147493046, 0.11201344847679139, -0.06818428196012974, 0.02953339473499606, -0.016213285140693187, 0.15348135803670934, 0.05103521283715964, -0.009033324681222438, 0.2679833055101335, 0.20262074992681542, 0.07698664820442597, 0.1165634101885371, -0.21716815213051935, -0.12057456917439897, -0.23728965806153912, -0.11172102160751819, -0.1577614353589403, 0.021689044053976734, -0.12566938644546705, -0.18194819009610608, 0.40508352060802283, 0.2051256459609916, 0.14699624424179394, -0.00039118434535339474, 0.3471884566452354, 0.15958265540422872, 0.09739588993601501, 0.14086495500368376, 0.3307554309504728, 0.2071447230068346, 0.19042066156243284, -0.3288563616806641, 0.05610901387718817, 0.042475487007759515] |
1,803.01345 | Shifted Landau levels in curved graphene sheets | We study the Landau levels in curved graphene sheets by measuring the
discrete energy spectrum in the presence of a magnetic field. We observe that
in rippled graphene sheets, the Landau energy levels satisfy the same square
root dependence on the energy quantum number as in flat sheets, $E_n \sim
\sqrt{n}$. Though, we find that the Landau levels in curved sheets are shifted
towards lower energies by an amount proportional to the average spatial
deformation of the sheet. Our findings are relevant for the quantum Hall effect
in curved graphene sheets, which is directly related to Landau quantization.
For the purpose of this study, we develop a new numerical method, based on the
quantum lattice Boltzmann method, to solve the Dirac equation on curved
manifolds, describing the low-energetic states in strained graphene sheets.
| cond-mat.mes-hall physics.comp-ph quant-ph | we study the landau levels in curved graphene sheets by measuring the discrete energy spectrum in the presence of a magnetic field we observe that in rippled graphene sheets the landau energy levels satisfy the same square root dependence on the energy quantum number as in flat sheets e_n sim sqrtn though we find that the landau levels in curved sheets are shifted towards lower energies by an amount proportional to the average spatial deformation of the sheet our findings are relevant for the quantum hall effect in curved graphene sheets which is directly related to landau quantization for the purpose of this study we develop a new numerical method based on the quantum lattice boltzmann method to solve the dirac equation on curved manifolds describing the lowenergetic states in strained graphene sheets | [['we', 'study', 'the', 'landau', 'levels', 'in', 'curved', 'graphene', 'sheets', 'by', 'measuring', 'the', 'discrete', 'energy', 'spectrum', 'in', 'the', 'presence', 'of', 'a', 'magnetic', 'field', 'we', 'observe', 'that', 'in', 'rippled', 'graphene', 'sheets', 'the', 'landau', 'energy', 'levels', 'satisfy', 'the', 'same', 'square', 'root', 'dependence', 'on', 'the', 'energy', 'quantum', 'number', 'as', 'in', 'flat', 'sheets', 'e_n', 'sim', 'sqrtn', 'though', 'we', 'find', 'that', 'the', 'landau', 'levels', 'in', 'curved', 'sheets', 'are', 'shifted', 'towards', 'lower', 'energies', 'by', 'an', 'amount', 'proportional', 'to', 'the', 'average', 'spatial', 'deformation', 'of', 'the', 'sheet', 'our', 'findings', 'are', 'relevant', 'for', 'the', 'quantum', 'hall', 'effect', 'in', 'curved', 'graphene', 'sheets', 'which', 'is', 'directly', 'related', 'to', 'landau', 'quantization', 'for', 'the', 'purpose', 'of', 'this', 'study', 'we', 'develop', 'a', 'new', 'numerical', 'method', 'based', 'on', 'the', 'quantum', 'lattice', 'boltzmann', 'method', 'to', 'solve', 'the', 'dirac', 'equation', 'on', 'curved', 'manifolds', 'describing', 'the', 'lowenergetic', 'states', 'in', 'strained', 'graphene', 'sheets']] | [-0.15754090388186445, 0.203352456895877, -0.024452677336206336, 0.05957737757257165, -0.006625964719438015, -0.09968064553139352, 0.01224636468910297, 0.37004081507150394, -0.2514419106493487, -0.2969904052526025, -0.027294581520539197, -0.27541647068595976, -0.16027470052074222, 0.17641353679302715, -0.01943261483706338, 0.02432312671650075, 0.0243191509927742, -0.030111303483179763, -0.049627526827800764, -0.22774508799937435, 0.34009942901845935, 0.09613915309187417, 0.3757629759637709, 0.08411446325060792, 0.05373429806020699, -0.02857717320049896, 0.07487955489160872, 0.05306785499775096, -0.18653142030398567, 0.09627446848540251, 0.20077244896805824, -0.1276809062933045, 0.2458223800027841, -0.49223124184050504, -0.17915950789767549, -0.02404076378456408, 0.14803661756861702, 0.13964488210517184, -0.028127596432630225, -0.2609397511145002, 0.066638777599691, -0.10187168101100881, -0.1424169493130149, -0.045484067588568405, -0.02897280788213659, -0.023239681669213298, -0.15524935079528426, 0.1234312284268663, 0.030936011071211862, 0.016407151789451718, -0.1343862986423187, -0.12117553914764098, -0.04846077973086079, 0.049757548565871286, 0.04569701979609024, 0.004490707783882779, 0.1568475253389854, -0.1529479976034464, -0.12368452815072876, 0.39953670472858993, -0.07336800165222328, -0.2553653768298769, 0.11098460735634137, -0.20006767072000617, -0.11063390886200998, 0.14767637970521205, 0.13711969847825908, 0.085922841269775, -0.08365406238831076, 0.1260170988822566, -0.04440328173157304, 0.11171572924332511, 0.10323331058305457, 0.020934670708401312, 0.24596267826575086, 0.1407210786189688, 0.08205373946199179, 0.128556420479523, -0.11383612730445802, -0.09342645994156487, -0.28414657053754744, -0.2002223518614034, -0.21832816629964663, 0.12049279084492166, -0.05423113086551456, -0.24334385625744953, 0.4222876415132804, 0.13139249742227166, 0.18883006915422088, 0.0038354543319560194, 0.24261733999867974, 0.19423045695381225, 0.05884310426899491, 0.054124497727988136, 0.21834537570051415, 0.14270731207697576, 0.0890110323828806, -0.23554655814655406, -0.06186936426858761, 0.07247092162391969] |
1,803.01346 | 3D Simulation of Superconducting Magnetic Shields and Lenses using the
Fast Fourier Transform | Shielding sensitive scientific and medical devices from the magnetic field
environment is one of the promising applications of superconductors. Magnetic
field concentration by superconducting magnetic lenses is the opposite
phenomenon based, however, on the same properties of superconductors: their
ideal conductivity and ability to expel the magnetic field. Full-dimensional
numerical simulations are necessary for designing magnetic lenses and for
estimating the quality of magnetic shielding under arbitrary varying external
fields. Using the recently proposed Fast Fourier Transform based
three-dimensional numerical method [Prigozhin and Sokolovsky, ArXiv 1801.04869]
we model performance of two such devices made of a bulk type-II superconductor:
a magnetic shield and a magnetic lens. The method is efficient and can be
easier to implement than the alternative approaches based on the finite element
methods.
| physics.comp-ph cond-mat.supr-con | shielding sensitive scientific and medical devices from the magnetic field environment is one of the promising applications of superconductors magnetic field concentration by superconducting magnetic lenses is the opposite phenomenon based however on the same properties of superconductors their ideal conductivity and ability to expel the magnetic field fulldimensional numerical simulations are necessary for designing magnetic lenses and for estimating the quality of magnetic shielding under arbitrary varying external fields using the recently proposed fast fourier transform based threedimensional numerical method prigozhin and sokolovsky arxiv 180104869 we model performance of two such devices made of a bulk typeii superconductor a magnetic shield and a magnetic lens the method is efficient and can be easier to implement than the alternative approaches based on the finite element methods | [['shielding', 'sensitive', 'scientific', 'and', 'medical', 'devices', 'from', 'the', 'magnetic', 'field', 'environment', 'is', 'one', 'of', 'the', 'promising', 'applications', 'of', 'superconductors', 'magnetic', 'field', 'concentration', 'by', 'superconducting', 'magnetic', 'lenses', 'is', 'the', 'opposite', 'phenomenon', 'based', 'however', 'on', 'the', 'same', 'properties', 'of', 'superconductors', 'their', 'ideal', 'conductivity', 'and', 'ability', 'to', 'expel', 'the', 'magnetic', 'field', 'fulldimensional', 'numerical', 'simulations', 'are', 'necessary', 'for', 'designing', 'magnetic', 'lenses', 'and', 'for', 'estimating', 'the', 'quality', 'of', 'magnetic', 'shielding', 'under', 'arbitrary', 'varying', 'external', 'fields', 'using', 'the', 'recently', 'proposed', 'fast', 'fourier', 'transform', 'based', 'threedimensional', 'numerical', 'method', 'prigozhin', 'and', 'sokolovsky', 'arxiv', '180104869', 'we', 'model', 'performance', 'of', 'two', 'such', 'devices', 'made', 'of', 'a', 'bulk', 'typeii', 'superconductor', 'a', 'magnetic', 'shield', 'and', 'a', 'magnetic', 'lens', 'the', 'method', 'is', 'efficient', 'and', 'can', 'be', 'easier', 'to', 'implement', 'than', 'the', 'alternative', 'approaches', 'based', 'on', 'the', 'finite', 'element', 'methods']] | [-0.14839813598777138, 0.11797223041104453, -0.037219752572597034, 0.04272283619643384, -0.13889736434324615, -0.13649637172854837, 0.018111468551890744, 0.41706162342621433, -0.19540151208639145, -0.3369554730973417, 0.07465591433367902, -0.24716768299619998, -0.12357172836181557, 0.2721139469781079, 0.011388312386829526, 0.08609822026694254, -0.025985713901689217, 0.001928502198068365, -0.09102256072407228, -0.24475305866930755, 0.3015577705077557, 0.05385586192325366, 0.3799525739985608, 0.03929796786331046, 0.06537428948908083, -0.028832337785241826, 0.040440496951041204, 0.0966481281474473, -0.08628225167687502, 0.09978066847355466, 0.19682234876240873, 0.016902491923481706, 0.2421233400762562, -0.49185949193516504, -0.21846771491090616, 0.04286694270558655, 0.1261411890793111, 0.11049071603619884, -0.13033521433939196, -0.2921945518032918, 0.10452333757383449, -0.1189947311668807, -0.12109141328889358, -0.1099048312190139, -0.026538598039957333, 0.04929107101164728, -0.31296974099090985, 0.03826560612557636, 0.021035263740134636, 0.10146178885723554, -0.09207313216686616, -0.10377497573931431, 0.021680177337745386, 0.07217277843418772, 0.04372458873741937, 0.05390033385183121, 0.19664028264777433, -0.14090049368209176, -0.08664093202640934, 0.361682448393455, -0.00986291374882116, -0.1614477395256296, 0.19590694742885628, -0.10602767851143595, -0.046842202469105684, 0.15082135382145945, 0.1649505085830066, 0.14233914303082612, -0.1456844134541649, 0.06863907046875195, 0.008336154233303762, 0.13877986299414788, 0.012636729628748952, 0.05644030933598838, 0.25536570029010275, 0.19209061043652437, 0.034266753445169135, 0.1461683372167059, -0.12907811737574276, 0.016399464911721166, -0.21919412249248596, -0.20805495904548274, -0.22759215161955404, 0.04032114834427052, -0.07372863540442795, -0.21174348138212676, 0.3633085360052064, 0.23318592445068662, 0.09061549671159516, -0.08667919702918059, 0.37311079651267537, 0.06504055400258832, 0.10720631995260896, 0.058628827900505595, 0.24151007462322951, 0.21828880486446584, 0.12862741083869966, -0.2507922844078782, 0.041335612482902025, 0.04422984937757006] |
1,803.01347 | Greedy stochastic algorithms for entropy-regularized optimal transport
problems | Optimal transport (OT) distances are finding evermore applications in machine
learning and computer vision, but their wide spread use in larger-scale
problems is impeded by their high computational cost. In this work we develop a
family of fast and practical stochastic algorithms for solving the optimal
transport problem with an entropic penalization. This work extends the recently
developed Greenkhorn algorithm, in the sense that, the Greenkhorn algorithm is
a limiting case of this family. We also provide a simple and general
convergence theorem for all algorithms in the class, with rates that match the
best known rates of Greenkorn and the Sinkhorn algorithm, and conclude with
numerical experiments that show under what regime of penalization the new
stochastic methods are faster than the aforementioned methods.
| stat.ML cs.LG | optimal transport ot distances are finding evermore applications in machine learning and computer vision but their wide spread use in largerscale problems is impeded by their high computational cost in this work we develop a family of fast and practical stochastic algorithms for solving the optimal transport problem with an entropic penalization this work extends the recently developed greenkhorn algorithm in the sense that the greenkhorn algorithm is a limiting case of this family we also provide a simple and general convergence theorem for all algorithms in the class with rates that match the best known rates of greenkorn and the sinkhorn algorithm and conclude with numerical experiments that show under what regime of penalization the new stochastic methods are faster than the aforementioned methods | [['optimal', 'transport', 'ot', 'distances', 'are', 'finding', 'evermore', 'applications', 'in', 'machine', 'learning', 'and', 'computer', 'vision', 'but', 'their', 'wide', 'spread', 'use', 'in', 'largerscale', 'problems', 'is', 'impeded', 'by', 'their', 'high', 'computational', 'cost', 'in', 'this', 'work', 'we', 'develop', 'a', 'family', 'of', 'fast', 'and', 'practical', 'stochastic', 'algorithms', 'for', 'solving', 'the', 'optimal', 'transport', 'problem', 'with', 'an', 'entropic', 'penalization', 'this', 'work', 'extends', 'the', 'recently', 'developed', 'greenkhorn', 'algorithm', 'in', 'the', 'sense', 'that', 'the', 'greenkhorn', 'algorithm', 'is', 'a', 'limiting', 'case', 'of', 'this', 'family', 'we', 'also', 'provide', 'a', 'simple', 'and', 'general', 'convergence', 'theorem', 'for', 'all', 'algorithms', 'in', 'the', 'class', 'with', 'rates', 'that', 'match', 'the', 'best', 'known', 'rates', 'of', 'greenkorn', 'and', 'the', 'sinkhorn', 'algorithm', 'and', 'conclude', 'with', 'numerical', 'experiments', 'that', 'show', 'under', 'what', 'regime', 'of', 'penalization', 'the', 'new', 'stochastic', 'methods', 'are', 'faster', 'than', 'the', 'aforementioned', 'methods']] | [-0.05445372191400478, 0.0220070233872027, -0.07460762890085819, 0.07475199289676253, -0.07412104596639232, -0.15773592928739927, 0.04922739664212831, 0.4087588486276687, -0.31098255825289073, -0.3116020861892931, 0.12249189188737693, -0.2113487521006215, -0.213306954115509, 0.2868667016737163, -0.11645017780228367, 0.11538736306641612, 0.09767609921794745, -0.013789338684751608, -0.08569251297599441, -0.2888530375541098, 0.2634792083418072, 0.06621374583412562, 0.28761808153602386, 0.030935463087629497, 0.0995218236555135, -0.03162651714181618, -0.0028419523620076717, 0.033947699331498195, -0.16250320657379616, 0.17255475086576846, 0.2777839244057935, 0.15995448332790646, 0.3600546824896047, -0.3777836238920328, -0.21710764139800542, 0.12177158606655505, 0.15366867159806838, 0.14296342494837458, -0.08763745229601139, -0.21935369141377328, 0.0893098225717568, -0.14340214926238742, -0.08793227428254942, -0.10678532977791262, -0.015038402060106877, 0.05293710551585161, -0.2829320325606292, 0.07741715338042629, 0.08208167653778688, 0.03814424246464172, -0.029490180717285482, -0.12406219630394198, 0.09326164479810564, 0.08237099265980144, 0.06116623668405678, 0.02777470206004387, 0.08483919892610321, -0.13292725634528324, -0.15783188429815065, 0.3521473390498995, -0.019413411563413495, -0.20121363722606592, 0.20293892257200974, -0.0771175469534712, -0.16418945503180787, 0.12211359061315775, 0.19423100642386765, 0.20065783232360357, -0.15965864587023162, 0.09637066594751237, -0.05184179564352117, 0.07987689141995244, 0.020165301549563846, 0.023380388921190563, 0.09235719028830287, 0.1885884158771425, 0.14309563337554854, 0.12388069334349805, -0.04968795707193954, -0.13713235232693655, -0.23798828996856877, -0.14588010905220383, -0.18185505612974898, -0.013529579628319029, -0.11731036024244648, -0.14390864178928878, 0.34249567754206156, 0.2028800508480579, 0.1675788861729445, 0.13731773003124662, 0.31018304184920364, 0.11391253690535744, 0.02734378465796791, 0.1687655970454216, 0.23619000851402, 0.08706218874900631, 0.11167317376502099, -0.2237042490422966, 0.08513575447197523, 0.07538094146988325] |
1,803.01348 | Even and odd normalized zero modes in random interacting Majorana models
respecting the Parity $P$ and the Time-Reversal-Symmetry $T$ | For random interacting Majorana models where the only symmetries are the
Parity $P$ and the Time-Reversal-Symmetry $T$, various approaches are compared
to construct exact even and odd normalized zero modes $\Gamma$ in finite size,
i.e. hermitian operators that commute with the Hamiltonian, that square to the
Identity, and that commute (even) or anticommute (odd) with the Parity $P$.
Even Normalized Zero-Modes $\Gamma^{even}$ are well known under the name of
'pseudo-spins' $\tau^z_n$ in the field of Many-Body-Localization or more
precisely 'Local Integrals of Motion' (LIOMs) in the Many-Body-Localized-Phase
where the pseudo-spins happens to be spatially localized. Odd Normalized
Zero-Modes $\Gamma^{odd}$ are popular under the name of 'Majorana Zero Modes'
or 'Strong Zero Modes'. Explicit examples for small systems are described in
detail. Applications to real-space renormalization procedures based on blocks
containing an odd number of Majorana fermions are also discussed.
| cond-mat.dis-nn | for random interacting majorana models where the only symmetries are the parity p and the timereversalsymmetry t various approaches are compared to construct exact even and odd normalized zero modes gamma in finite size ie hermitian operators that commute with the hamiltonian that square to the identity and that commute even or anticommute odd with the parity p even normalized zeromodes gammaeven are well known under the name of pseudospins tauz_n in the field of manybodylocalization or more precisely local integrals of motion lioms in the manybodylocalizedphase where the pseudospins happens to be spatially localized odd normalized zeromodes gammaodd are popular under the name of majorana zero modes or strong zero modes explicit examples for small systems are described in detail applications to realspace renormalization procedures based on blocks containing an odd number of majorana fermions are also discussed | [['for', 'random', 'interacting', 'majorana', 'models', 'where', 'the', 'only', 'symmetries', 'are', 'the', 'parity', 'p', 'and', 'the', 'timereversalsymmetry', 't', 'various', 'approaches', 'are', 'compared', 'to', 'construct', 'exact', 'even', 'and', 'odd', 'normalized', 'zero', 'modes', 'gamma', 'in', 'finite', 'size', 'ie', 'hermitian', 'operators', 'that', 'commute', 'with', 'the', 'hamiltonian', 'that', 'square', 'to', 'the', 'identity', 'and', 'that', 'commute', 'even', 'or', 'anticommute', 'odd', 'with', 'the', 'parity', 'p', 'even', 'normalized', 'zeromodes', 'gammaeven', 'are', 'well', 'known', 'under', 'the', 'name', 'of', 'pseudospins', 'tauz_n', 'in', 'the', 'field', 'of', 'manybodylocalization', 'or', 'more', 'precisely', 'local', 'integrals', 'of', 'motion', 'lioms', 'in', 'the', 'manybodylocalizedphase', 'where', 'the', 'pseudospins', 'happens', 'to', 'be', 'spatially', 'localized', 'odd', 'normalized', 'zeromodes', 'gammaodd', 'are', 'popular', 'under', 'the', 'name', 'of', 'majorana', 'zero', 'modes', 'or', 'strong', 'zero', 'modes', 'explicit', 'examples', 'for', 'small', 'systems', 'are', 'described', 'in', 'detail', 'applications', 'to', 'realspace', 'renormalization', 'procedures', 'based', 'on', 'blocks', 'containing', 'an', 'odd', 'number', 'of', 'majorana', 'fermions', 'are', 'also', 'discussed']] | [-0.21390606385259026, 0.26696003901489784, -0.025295945563939985, 0.119758337336006, -0.04833185047394148, -0.2304152316034392, -0.007389362475455359, 0.353003168547595, -0.22867358148925834, -0.25060078372350997, 0.07053119766146497, -0.31441961091908593, -0.12292056022108429, 0.12194463808813857, -0.0016482451025189625, 0.040260805948464956, 0.011831873475953384, 0.1346582279506105, -0.10882639119539547, -0.27233744523384507, 0.3124052456036831, -0.025609241615704915, 0.26388203946666583, 0.001301390116309954, 0.029184654252000015, 0.030915276668275947, 0.020117233997141874, -0.006099752426423409, -0.07170154865118632, 0.035267727332258664, 0.23388978831453305, -0.010854323294565633, 0.18085717905174803, -0.46378650756345857, -0.12570308880294087, 0.14694676319982306, 0.18885506792683845, 0.10446015933218102, -0.00017005737528153178, -0.2946018261921213, 0.11202661573403963, -0.13467912366786214, -0.1709618299026732, -0.11525074279418698, 0.0358563411851517, 0.003820968012290972, -0.28137685072228863, 0.09568201931758301, 0.08207814714233219, 0.08915728119512399, -0.021971254571582433, -0.15654955257282213, -0.06554790348142248, 0.10254590197776754, 0.06943836410840352, -0.04816656282033633, 0.0740115795629444, -0.11386813012952055, -0.13978262521602489, 0.36617770283526085, -0.06333524380482872, -0.26782641686775066, 0.17072905510560507, -0.12149635321564145, -0.11758536530865563, 0.10580740311286516, 0.10566780627187755, 0.1385623033227468, -0.08113752571581345, 0.14998958487353606, -0.049948891555821454, 0.09892210069077986, 0.07099044528548364, 0.09376453154685872, 0.2070139612381657, 0.018703591307901123, 0.10084964152839448, 0.09108444799893294, -0.030627432995027414, -0.10205850561183911, -0.3265929670866441, -0.1278468226591401, -0.22763295929740976, 0.06266302574701883, -0.049911026205302696, -0.19750213883817197, 0.4020359461195767, 0.10338977985773926, 0.1799503455179985, 0.037212432919208095, 0.2398488498741278, 0.13624510954099672, 0.1153208161531775, 0.07075552472120358, 0.1459092255992194, 0.15221759116673772, -0.0007557949318585021, -0.24615462192299742, -0.047328549673504854, 0.08897568205957887] |
1,803.01349 | Deep Network Regularization via Bayesian Inference of Synaptic
Connectivity | Deep neural networks (DNNs) often require good regularizers to generalize
well. Currently, state-of-the-art DNN regularization techniques consist in
randomly dropping units and/or connections on each iteration of the training
algorithm. Dropout and DropConnect are characteristic examples of such
regularizers, that are widely popular among practitioners. However, a drawback
of such approaches consists in the fact that their postulated probability of
random unit/connection omission is a constant that must be heuristically
selected based on the obtained performance in some validation set. To alleviate
this burden, in this paper we regard the DNN regularization problem from a
Bayesian inference perspective: We impose a sparsity-inducing prior over the
network synaptic weights, where the sparsity is induced by a set of
Bernoulli-distributed binary variables with Beta (hyper-)priors over their
prior parameters. This way, we eventually allow for marginalizing over the DNN
synaptic connectivity for output generation, thus giving rise to an effective,
heuristics-free, network regularization scheme. We perform Bayesian inference
for the resulting hierarchical model by means of an efficient Black-Box
Variational inference scheme. We exhibit the advantages of our method over
existing approaches by conducting an extensive experimental evaluation using
benchmark datasets.
| cs.LG stat.ML | deep neural networks dnns often require good regularizers to generalize well currently stateoftheart dnn regularization techniques consist in randomly dropping units andor connections on each iteration of the training algorithm dropout and dropconnect are characteristic examples of such regularizers that are widely popular among practitioners however a drawback of such approaches consists in the fact that their postulated probability of random unitconnection omission is a constant that must be heuristically selected based on the obtained performance in some validation set to alleviate this burden in this paper we regard the dnn regularization problem from a bayesian inference perspective we impose a sparsityinducing prior over the network synaptic weights where the sparsity is induced by a set of bernoullidistributed binary variables with beta hyperpriors over their prior parameters this way we eventually allow for marginalizing over the dnn synaptic connectivity for output generation thus giving rise to an effective heuristicsfree network regularization scheme we perform bayesian inference for the resulting hierarchical model by means of an efficient blackbox variational inference scheme we exhibit the advantages of our method over existing approaches by conducting an extensive experimental evaluation using benchmark datasets | [['deep', 'neural', 'networks', 'dnns', 'often', 'require', 'good', 'regularizers', 'to', 'generalize', 'well', 'currently', 'stateoftheart', 'dnn', 'regularization', 'techniques', 'consist', 'in', 'randomly', 'dropping', 'units', 'andor', 'connections', 'on', 'each', 'iteration', 'of', 'the', 'training', 'algorithm', 'dropout', 'and', 'dropconnect', 'are', 'characteristic', 'examples', 'of', 'such', 'regularizers', 'that', 'are', 'widely', 'popular', 'among', 'practitioners', 'however', 'a', 'drawback', 'of', 'such', 'approaches', 'consists', 'in', 'the', 'fact', 'that', 'their', 'postulated', 'probability', 'of', 'random', 'unitconnection', 'omission', 'is', 'a', 'constant', 'that', 'must', 'be', 'heuristically', 'selected', 'based', 'on', 'the', 'obtained', 'performance', 'in', 'some', 'validation', 'set', 'to', 'alleviate', 'this', 'burden', 'in', 'this', 'paper', 'we', 'regard', 'the', 'dnn', 'regularization', 'problem', 'from', 'a', 'bayesian', 'inference', 'perspective', 'we', 'impose', 'a', 'sparsityinducing', 'prior', 'over', 'the', 'network', 'synaptic', 'weights', 'where', 'the', 'sparsity', 'is', 'induced', 'by', 'a', 'set', 'of', 'bernoullidistributed', 'binary', 'variables', 'with', 'beta', 'hyperpriors', 'over', 'their', 'prior', 'parameters', 'this', 'way', 'we', 'eventually', 'allow', 'for', 'marginalizing', 'over', 'the', 'dnn', 'synaptic', 'connectivity', 'for', 'output', 'generation', 'thus', 'giving', 'rise', 'to', 'an', 'effective', 'heuristicsfree', 'network', 'regularization', 'scheme', 'we', 'perform', 'bayesian', 'inference', 'for', 'the', 'resulting', 'hierarchical', 'model', 'by', 'means', 'of', 'an', 'efficient', 'blackbox', 'variational', 'inference', 'scheme', 'we', 'exhibit', 'the', 'advantages', 'of', 'our', 'method', 'over', 'existing', 'approaches', 'by', 'conducting', 'an', 'extensive', 'experimental', 'evaluation', 'using', 'benchmark', 'datasets']] | [-0.05003863367962372, 0.003480391596418427, -0.053600621603947275, 0.06269737022224177, -0.12085487016222694, -0.1644725053381912, 0.08982039409388295, 0.46036722541682146, -0.2966887929182958, -0.32457298624147485, 0.07588838076562605, -0.22541488000854132, -0.2172377306674134, 0.19123537629160453, -0.11245784617308029, 0.12003013655234547, 0.1252730197427585, 0.022557709726846134, -0.07934891004246077, -0.3270528165898709, 0.31533449311257605, 0.06955437791358834, 0.29868426206795606, -0.03882585563651009, 0.12929454941491167, -0.016299576084266472, -0.0371488851269727, 0.0036420058116645496, -0.07668286883878431, 0.14997218957421105, 0.27748582310312214, 0.1915392191248901, 0.3829507045248613, -0.4284560904604069, -0.267887768001958, 0.1382751277520914, 0.14784964797072073, 0.0972092377158401, -0.004596268159915061, -0.2822914034393392, 0.08135983604504503, -0.19726510223248392, 0.00904181996580801, -0.1580949050329506, -0.06802347632134981, 0.028452162841897718, -0.3477282094455419, 0.05191388536903903, 0.05319420080557266, 0.050926798381867575, -0.031954747308444054, -0.16918691941835784, 0.05607071796738428, 0.09243997236972744, 0.06927574186506158, 0.03927350786320347, 0.12109280298158955, -0.14713435924367949, -0.13263959575563988, 0.29673216128871244, -0.03196269732944787, -0.24004028846116307, 0.17066366429939334, 0.04245397335423884, -0.16991863223440187, 0.10632695589354013, 0.19889725309956624, 0.10651732954809214, -0.15973706235660906, 0.058640446260205425, -0.02233523685226147, 0.15421562109897063, 0.038554474671575474, 0.011688610349587578, 0.15074973023636018, 0.2371992241408499, 0.07185514571697994, 0.11444425654540306, -0.09993836146584503, -0.09214165233160285, -0.2528791393945243, -0.07122618349064838, -0.20363503769737354, 0.002391137416788282, -0.1421421796305542, -0.18181291648390938, 0.3898784152748742, 0.21140304413116115, 0.23030537366120016, 0.1300700285950088, 0.3295621776076801, 0.06526687919279874, 0.13343020005993306, 0.09481393997769126, 0.18655961843716096, 0.0740753125815209, 0.060330372888291066, -0.1472334691770325, 0.11038908085232989, 0.04101253066704992] |
1,803.0135 | Bistable emergence of oscillations in structured cell populations | Biofilm communities of Bacillus subtilis bacteria have recently been shown to
exhibit collective growth-rate oscillations mediated by electrochemical
signaling to cope with nutrient starvation. These oscillations emerge once the
colony reaches a large enough number of cells. However, it remains unclear
whether the amplitude of the oscillations, and thus their effectiveness, builds
up over time gradually, or if they can emerge instantly with a non-zero
amplitude. Here we address this question by combining microfluidics-based
time-lapse microscopy experiments with a minimal theoretical description of the
system in the form of a delay-differential equation model. Analytical and
numerical methods reveal that oscillations arise through a subcritical Hopf
bifurcation, which enables instant high amplitude oscillations. Consequently,
the model predicts a bistable regime where an oscillating and a non-oscillating
attractor coexist in phase space. We experimentally validate this prediction by
showing that oscillations can be triggered by perturbing the media conditions,
provided the biofilm size lies within an appropriate range. The model also
predicts that the minimum size at which oscillations start decreases with
stress, a fact that we also verify experimentally. Taken together, our results
show that collective oscillations in cell populations can emerge suddenly with
non-zero amplitude via a discontinuous transition.
| q-bio.CB | biofilm communities of bacillus subtilis bacteria have recently been shown to exhibit collective growthrate oscillations mediated by electrochemical signaling to cope with nutrient starvation these oscillations emerge once the colony reaches a large enough number of cells however it remains unclear whether the amplitude of the oscillations and thus their effectiveness builds up over time gradually or if they can emerge instantly with a nonzero amplitude here we address this question by combining microfluidicsbased timelapse microscopy experiments with a minimal theoretical description of the system in the form of a delaydifferential equation model analytical and numerical methods reveal that oscillations arise through a subcritical hopf bifurcation which enables instant high amplitude oscillations consequently the model predicts a bistable regime where an oscillating and a nonoscillating attractor coexist in phase space we experimentally validate this prediction by showing that oscillations can be triggered by perturbing the media conditions provided the biofilm size lies within an appropriate range the model also predicts that the minimum size at which oscillations start decreases with stress a fact that we also verify experimentally taken together our results show that collective oscillations in cell populations can emerge suddenly with nonzero amplitude via a discontinuous transition | [['biofilm', 'communities', 'of', 'bacillus', 'subtilis', 'bacteria', 'have', 'recently', 'been', 'shown', 'to', 'exhibit', 'collective', 'growthrate', 'oscillations', 'mediated', 'by', 'electrochemical', 'signaling', 'to', 'cope', 'with', 'nutrient', 'starvation', 'these', 'oscillations', 'emerge', 'once', 'the', 'colony', 'reaches', 'a', 'large', 'enough', 'number', 'of', 'cells', 'however', 'it', 'remains', 'unclear', 'whether', 'the', 'amplitude', 'of', 'the', 'oscillations', 'and', 'thus', 'their', 'effectiveness', 'builds', 'up', 'over', 'time', 'gradually', 'or', 'if', 'they', 'can', 'emerge', 'instantly', 'with', 'a', 'nonzero', 'amplitude', 'here', 'we', 'address', 'this', 'question', 'by', 'combining', 'microfluidicsbased', 'timelapse', 'microscopy', 'experiments', 'with', 'a', 'minimal', 'theoretical', 'description', 'of', 'the', 'system', 'in', 'the', 'form', 'of', 'a', 'delaydifferential', 'equation', 'model', 'analytical', 'and', 'numerical', 'methods', 'reveal', 'that', 'oscillations', 'arise', 'through', 'a', 'subcritical', 'hopf', 'bifurcation', 'which', 'enables', 'instant', 'high', 'amplitude', 'oscillations', 'consequently', 'the', 'model', 'predicts', 'a', 'bistable', 'regime', 'where', 'an', 'oscillating', 'and', 'a', 'nonoscillating', 'attractor', 'coexist', 'in', 'phase', 'space', 'we', 'experimentally', 'validate', 'this', 'prediction', 'by', 'showing', 'that', 'oscillations', 'can', 'be', 'triggered', 'by', 'perturbing', 'the', 'media', 'conditions', 'provided', 'the', 'biofilm', 'size', 'lies', 'within', 'an', 'appropriate', 'range', 'the', 'model', 'also', 'predicts', 'that', 'the', 'minimum', 'size', 'at', 'which', 'oscillations', 'start', 'decreases', 'with', 'stress', 'a', 'fact', 'that', 'we', 'also', 'verify', 'experimentally', 'taken', 'together', 'our', 'results', 'show', 'that', 'collective', 'oscillations', 'in', 'cell', 'populations', 'can', 'emerge', 'suddenly', 'with', 'nonzero', 'amplitude', 'via', 'a', 'discontinuous', 'transition']] | [-0.16734552741853342, 0.2360231825584913, -0.07736689533412938, 0.03180898564175033, -0.04222033714964097, -0.15365867179444928, 0.09455421737637418, 0.3216592489025701, -0.28270262776728927, -0.27098150581154207, 0.07968254249610812, -0.264246506918334, -0.2431641542762237, 0.18473003441514682, -0.0390567324257657, -0.0009983298515002406, 0.08213794579081256, 0.017685112124542945, 0.015136813911628072, -0.19840331023263402, 0.2638771260741059, 0.04272813573432852, 0.29691191813931916, 0.03509892385257595, 0.11313988372907874, -0.07575018629642326, 0.02852842844519577, 0.05901563619354146, -0.13722030358684006, 0.0020929368460859787, 0.23150560285968602, 0.08202002785606169, 0.2840334068288811, -0.4903354666865052, -0.26387269141143144, 0.11246498589797048, 0.22180806808454456, 0.15150453850285306, -0.06862050004832297, -0.26745535970967377, 0.05428082599590097, -0.1553874250095403, -0.16422992673276657, -0.11076628669848357, 0.03279293228137358, 0.03193457674962848, -0.27123167851340757, 0.12721691860076761, 0.021961769917465034, 0.04379136153527807, -0.09222270315279014, -0.024375381195641605, -0.057604296807721535, 0.11478341213221563, 0.059531974452360525, 0.009943643547407347, 0.15892356323153156, -0.10225033720992693, -0.08691257749211474, 0.3224687379639802, -0.06899604697515205, -0.1555270336354245, 0.1985233843463459, -0.1742741161133701, -0.08042721186610098, 0.1764464182451592, 0.15183814213700106, 0.045975133843354915, -0.11194736231352441, 0.028659185793908342, -0.03160867592010965, 0.1894892998959345, 0.1050717101769344, -0.022669727202673354, 0.2142638909447957, 0.21677220013722703, 0.023946110702040207, 0.09841377243701481, -0.06717091561739694, -0.09584906322287218, -0.24788900417973048, -0.06455169595431667, -0.13435649957470408, 0.0281069851340024, -0.06148343203899664, -0.16253481858720578, 0.40362574899307074, 0.1386958932569578, 0.23148178356470325, 0.05452837179012447, 0.2466501264561473, 0.09297637019748682, 0.06646213887596325, 0.05328138824844798, 0.2588563003230971, 0.0983517983245041, 0.11964314103468167, -0.28235875544531375, 0.08640744388290686, 0.0045759354872469925] |
1,803.01351 | A high-order discontinuous Galerkin approach to the elasto-acoustic
problem | We address the spatial discretization of an evolution problem arising from
the coupling of viscoelastic and acoustic wave propagation phenomena by
employing a discontinuous Galerkin scheme on polygonal and polyhedral meshes.
The coupled nature of the problem is ascribed to suitable transmission
conditions imposed at the interface between the solid (elastic) and fluid
(acoustic) domains. We state and prove a well-posedness result for the strong
formulation of the problem, present a stability analysis for the semi-discrete
formulation, and finally prove an a priori $hp$-version error estimate for the
resulting formulation in a suitable (mesh-dependent) energy norm. We also
discuss the time integration scheme employed to obtain the fully discrete
system. The convergence results are validated by numerical experiments carried
out in a two-dimensional setting.
| math.NA math.AP | we address the spatial discretization of an evolution problem arising from the coupling of viscoelastic and acoustic wave propagation phenomena by employing a discontinuous galerkin scheme on polygonal and polyhedral meshes the coupled nature of the problem is ascribed to suitable transmission conditions imposed at the interface between the solid elastic and fluid acoustic domains we state and prove a wellposedness result for the strong formulation of the problem present a stability analysis for the semidiscrete formulation and finally prove an a priori hpversion error estimate for the resulting formulation in a suitable meshdependent energy norm we also discuss the time integration scheme employed to obtain the fully discrete system the convergence results are validated by numerical experiments carried out in a twodimensional setting | [['we', 'address', 'the', 'spatial', 'discretization', 'of', 'an', 'evolution', 'problem', 'arising', 'from', 'the', 'coupling', 'of', 'viscoelastic', 'and', 'acoustic', 'wave', 'propagation', 'phenomena', 'by', 'employing', 'a', 'discontinuous', 'galerkin', 'scheme', 'on', 'polygonal', 'and', 'polyhedral', 'meshes', 'the', 'coupled', 'nature', 'of', 'the', 'problem', 'is', 'ascribed', 'to', 'suitable', 'transmission', 'conditions', 'imposed', 'at', 'the', 'interface', 'between', 'the', 'solid', 'elastic', 'and', 'fluid', 'acoustic', 'domains', 'we', 'state', 'and', 'prove', 'a', 'wellposedness', 'result', 'for', 'the', 'strong', 'formulation', 'of', 'the', 'problem', 'present', 'a', 'stability', 'analysis', 'for', 'the', 'semidiscrete', 'formulation', 'and', 'finally', 'prove', 'an', 'a', 'priori', 'hpversion', 'error', 'estimate', 'for', 'the', 'resulting', 'formulation', 'in', 'a', 'suitable', 'meshdependent', 'energy', 'norm', 'we', 'also', 'discuss', 'the', 'time', 'integration', 'scheme', 'employed', 'to', 'obtain', 'the', 'fully', 'discrete', 'system', 'the', 'convergence', 'results', 'are', 'validated', 'by', 'numerical', 'experiments', 'carried', 'out', 'in', 'a', 'twodimensional', 'setting']] | [-0.1395251878326939, 0.03288718115283935, -0.09775902157355543, 0.04352378859203459, -0.05046218578448339, -0.1057834338186489, 0.03267946637295667, 0.34918089579760786, -0.337142797472376, -0.2511726761417043, 0.15208469296152133, -0.21859185124612263, -0.14279892336766822, 0.17314286403838666, -0.03741408152423138, 0.11846969697498641, 0.0924395156738859, -0.04638643497075405, -0.09765464601467454, -0.16957345149562425, 0.32890229081104116, 0.014761522787833405, 0.313464964116593, 0.08275190113119842, 0.15522218853115075, -0.014696876263065685, -0.024821845739479025, 0.04455641917170836, -0.16898421278963197, 0.10480268190017782, 0.22731820304667757, 0.031126764376700346, 0.30058952799141303, -0.47547051897122256, -0.26437704180411414, 0.05688079618923967, 0.1131225409401175, 0.12057283813614518, -0.07562321536487059, -0.3068616238024627, 0.05429715269635762, -0.10608085582873994, -0.16222632638058596, -0.08132774969788208, -0.054373401277247935, 0.012371593650670783, -0.3160497760249963, 0.11941838149904206, 0.036908753199367636, 0.04981917180421372, -0.1391038082862994, -0.0506171153965331, 0.006439165927604923, 0.06603850274827451, 0.025735567700335634, -0.022089278832408448, 0.02668949357429219, -0.07060732972252393, -0.06729124148841947, 0.4110472256227607, -0.054533884710831294, -0.29755614417034293, 0.1770903203174502, -0.058894981533211974, -0.05895166366451209, 0.13721014231428383, 0.22067608424432336, 0.1618637037425933, -0.12850466437427507, 0.08818489745880792, -0.028703802111140837, 0.16547561271656905, 0.05568403720803138, -0.0024318818543707173, 0.11180278112090403, 0.20451076288009062, 0.11691669928991506, 0.1391728841793543, -0.0802734465020964, -0.10651592552406533, -0.35415820747373566, -0.14032407524627483, -0.1841268520877366, -0.007229489104042108, -0.10969182017440963, -0.1760469983376923, 0.353731926337376, 0.13202229012817807, 0.12899080255339224, 0.07455038143727448, 0.2884978843071768, 0.14790083636199275, -0.029922632646987274, 0.08820452452487042, 0.24990340804534725, 0.17157042921040086, 0.13580328164126484, -0.2750905494660049, 0.02206482588043136, 0.1687621200464726] |
1,803.01352 | Inflationary perturbations with Lifshitz scaling | Instead of Lorentz invariance, gravitational degrees of freedom may obey
Lifshitz scaling at high energies, as it happens in Ho\v{r}ava's proposal for
quantum gravity. We study consequences of this proposal for the spectra of
primordial perturbations generated at inflation. Breaking of 4D diffeomorphism
(Diff) invariance down to the foliation-preserving Diff in Ho\v{r}ava-Lifshitz
(HL) gravity leads to appearance of a scalar degree of freedom in the gravity
sector, khronon, which describes dynamics of the time foliation. One can
naively expect that mixing between inflaton and khronon will jeopardize
conservation of adiabatic perturbations at super Hubble scales. This indeed
happens in the projectable version of the theory. By contrast, we find that in
the non-projectable version of HL gravity, khronon acquires an effective mass
which is much larger than the Hubble scale well before the Hubble crossing time
and decouples from the adiabatic curvature perturbation $\zeta$ sourced by the
inflaton fluctuations. As a result, at super Hubble scales the adiabatic
perturbation $\zeta$ behaves as in an effectively single field system and its
spectrum is conserved in time. Lifshitz scaling is imprinted in the power
spectrum of $\zeta$ through the modified dispersion relation of the inflaton.
We point out violation of the consistency relation between the tensor-to-scalar
ratio and the spectral tilt of primordial gravitational waves and suggest that
it can provide a signal of Lorentz violation in inflationary era.
| hep-th astro-ph.CO gr-qc | instead of lorentz invariance gravitational degrees of freedom may obey lifshitz scaling at high energies as it happens in hovravas proposal for quantum gravity we study consequences of this proposal for the spectra of primordial perturbations generated at inflation breaking of 4d diffeomorphism diff invariance down to the foliationpreserving diff in hovravalifshitz hl gravity leads to appearance of a scalar degree of freedom in the gravity sector khronon which describes dynamics of the time foliation one can naively expect that mixing between inflaton and khronon will jeopardize conservation of adiabatic perturbations at super hubble scales this indeed happens in the projectable version of the theory by contrast we find that in the nonprojectable version of hl gravity khronon acquires an effective mass which is much larger than the hubble scale well before the hubble crossing time and decouples from the adiabatic curvature perturbation zeta sourced by the inflaton fluctuations as a result at super hubble scales the adiabatic perturbation zeta behaves as in an effectively single field system and its spectrum is conserved in time lifshitz scaling is imprinted in the power spectrum of zeta through the modified dispersion relation of the inflaton we point out violation of the consistency relation between the tensortoscalar ratio and the spectral tilt of primordial gravitational waves and suggest that it can provide a signal of lorentz violation in inflationary era | [['instead', 'of', 'lorentz', 'invariance', 'gravitational', 'degrees', 'of', 'freedom', 'may', 'obey', 'lifshitz', 'scaling', 'at', 'high', 'energies', 'as', 'it', 'happens', 'in', 'hovravas', 'proposal', 'for', 'quantum', 'gravity', 'we', 'study', 'consequences', 'of', 'this', 'proposal', 'for', 'the', 'spectra', 'of', 'primordial', 'perturbations', 'generated', 'at', 'inflation', 'breaking', 'of', '4d', 'diffeomorphism', 'diff', 'invariance', 'down', 'to', 'the', 'foliationpreserving', 'diff', 'in', 'hovravalifshitz', 'hl', 'gravity', 'leads', 'to', 'appearance', 'of', 'a', 'scalar', 'degree', 'of', 'freedom', 'in', 'the', 'gravity', 'sector', 'khronon', 'which', 'describes', 'dynamics', 'of', 'the', 'time', 'foliation', 'one', 'can', 'naively', 'expect', 'that', 'mixing', 'between', 'inflaton', 'and', 'khronon', 'will', 'jeopardize', 'conservation', 'of', 'adiabatic', 'perturbations', 'at', 'super', 'hubble', 'scales', 'this', 'indeed', 'happens', 'in', 'the', 'projectable', 'version', 'of', 'the', 'theory', 'by', 'contrast', 'we', 'find', 'that', 'in', 'the', 'nonprojectable', 'version', 'of', 'hl', 'gravity', 'khronon', 'acquires', 'an', 'effective', 'mass', 'which', 'is', 'much', 'larger', 'than', 'the', 'hubble', 'scale', 'well', 'before', 'the', 'hubble', 'crossing', 'time', 'and', 'decouples', 'from', 'the', 'adiabatic', 'curvature', 'perturbation', 'zeta', 'sourced', 'by', 'the', 'inflaton', 'fluctuations', 'as', 'a', 'result', 'at', 'super', 'hubble', 'scales', 'the', 'adiabatic', 'perturbation', 'zeta', 'behaves', 'as', 'in', 'an', 'effectively', 'single', 'field', 'system', 'and', 'its', 'spectrum', 'is', 'conserved', 'in', 'time', 'lifshitz', 'scaling', 'is', 'imprinted', 'in', 'the', 'power', 'spectrum', 'of', 'zeta', 'through', 'the', 'modified', 'dispersion', 'relation', 'of', 'the', 'inflaton', 'we', 'point', 'out', 'violation', 'of', 'the', 'consistency', 'relation', 'between', 'the', 'tensortoscalar', 'ratio', 'and', 'the', 'spectral', 'tilt', 'of', 'primordial', 'gravitational', 'waves', 'and', 'suggest', 'that', 'it', 'can', 'provide', 'a', 'signal', 'of', 'lorentz', 'violation', 'in', 'inflationary', 'era']] | [-0.20506331725620422, 0.20810138996157668, -0.14816468459438378, 0.11472460401340875, -0.08224106396421264, -0.14014546915843656, -0.04301762459532969, 0.24391378623142115, -0.23133721291026027, -0.3059465472221309, 0.039396194244185175, -0.23832874749233282, -0.12263685046892105, 0.1302921946236396, -0.02753792692074298, 0.019141770238497825, -0.025884414559418936, 0.04205305393262652, -0.07755783041744259, -0.19412392511192528, 0.34432550574066156, 0.13606775084885847, 0.23606333584680594, 0.006691911663974959, 0.06884703194334824, -0.03530184162620636, 0.0007578832249153028, 0.0026587432307818913, -0.12872770833954014, 0.008804853365547332, 0.14745572075852406, 0.10579825731335128, 0.20620926869581843, -0.3999973627972511, -0.23570916364748967, 0.10342372860759497, 0.16142605184187644, 0.1282020787049971, -0.0026105029512574233, -0.28833892427401264, 0.01334868230429244, -0.14949943063456805, -0.1730900833235504, -0.062432435456056166, 0.03376316288455353, -0.11900343249617595, -0.25351303806507935, 0.17668897959663704, 0.0036785940332994655, 0.021148524078897443, -0.03772704405679331, -1.8951550766103594e-05, -0.07946208059800058, 0.035434755207437385, 0.15098466447888903, 0.06214173877660989, 0.1703171668110604, -0.17550390464405524, -0.05644950409171619, 0.4181597037117781, -0.16597231603690396, -0.1450657963317856, 0.11536743711487345, -0.20855460050905592, -0.17899486001597364, 0.08224859926644466, 0.12064670210105206, 0.10982024582104946, -0.08886857656967141, 0.18364905366455594, 0.048942606850006176, 0.16782585495535698, 0.14236799502613984, 0.08117908611996222, 0.31285595549229483, 0.08415744770400324, 0.05770630675413141, 0.10480739719886743, -0.05569119181172175, -0.10423302953439202, -0.3949589265329919, -0.1431728816671463, -0.1837835301873828, 0.11106355724618298, -0.18233607197199622, -0.12775053412731457, 0.3802420110831505, 0.1403012846459097, 0.15190040119944165, 0.08612662163103565, 0.24088113147166398, 0.13062935909574303, 0.10675099164007502, 0.07503969282617522, 0.3348342014583328, 0.12451674005669021, 0.14121836818147468, -0.2718939737269105, -0.06158334719804875, 0.08751907523327593] |
1,803.01353 | Understanding the twist distribution inside magnetic flux ropes by
anatomizing an interplanetary magnetic cloud | Magnetic flux rope (MFR) is the core structure of the greatest eruptions,
i.e., the coronal mass ejections (CMEs), on the Sun, and magnetic clouds are
post-eruption MFRs in interplanetary space. There is a strong debate about
whether or not a MFR exists prior to a CME and how the MFR forms/grows through
magnetic reconnection during the eruption. Here we report a rare event, in
which a magnetic cloud was observed sequentially by four spacecraft near
Mercury, Venus, Earth and Mars, respectively. With the aids of a uniform-twist
flux rope model and a newly developed method that can recover a
shock-compressed structure, we find that the axial magnetic flux and helicity
of the magnetic cloud decreased when it propagated outward but the twist
increased. Our analysis suggests that the `pancaking' effect and `erosion'
effect may jointly cause such variations. The significance of the `pancaking'
effect is difficult to be estimated, but the signature of the erosion can be
found as the imbalance of the azimuthal flux of the cloud. The latter implies
that the magnetic cloud was eroded significantly leaving its inner core exposed
to the solar wind at far distance. The increase of the twist together with the
presence of the erosion effect suggests that the post-eruption MFR may have a
high-twist core enveloped by a less-twisted outer shell. These results pose a
great challenge to the current understanding on the solar eruptions as well as
the formation and instability of MFRs.
| astro-ph.SR physics.plasm-ph physics.space-ph | magnetic flux rope mfr is the core structure of the greatest eruptions ie the coronal mass ejections cmes on the sun and magnetic clouds are posteruption mfrs in interplanetary space there is a strong debate about whether or not a mfr exists prior to a cme and how the mfr formsgrows through magnetic reconnection during the eruption here we report a rare event in which a magnetic cloud was observed sequentially by four spacecraft near mercury venus earth and mars respectively with the aids of a uniformtwist flux rope model and a newly developed method that can recover a shockcompressed structure we find that the axial magnetic flux and helicity of the magnetic cloud decreased when it propagated outward but the twist increased our analysis suggests that the pancaking effect and erosion effect may jointly cause such variations the significance of the pancaking effect is difficult to be estimated but the signature of the erosion can be found as the imbalance of the azimuthal flux of the cloud the latter implies that the magnetic cloud was eroded significantly leaving its inner core exposed to the solar wind at far distance the increase of the twist together with the presence of the erosion effect suggests that the posteruption mfr may have a hightwist core enveloped by a lesstwisted outer shell these results pose a great challenge to the current understanding on the solar eruptions as well as the formation and instability of mfrs | [['magnetic', 'flux', 'rope', 'mfr', 'is', 'the', 'core', 'structure', 'of', 'the', 'greatest', 'eruptions', 'ie', 'the', 'coronal', 'mass', 'ejections', 'cmes', 'on', 'the', 'sun', 'and', 'magnetic', 'clouds', 'are', 'posteruption', 'mfrs', 'in', 'interplanetary', 'space', 'there', 'is', 'a', 'strong', 'debate', 'about', 'whether', 'or', 'not', 'a', 'mfr', 'exists', 'prior', 'to', 'a', 'cme', 'and', 'how', 'the', 'mfr', 'formsgrows', 'through', 'magnetic', 'reconnection', 'during', 'the', 'eruption', 'here', 'we', 'report', 'a', 'rare', 'event', 'in', 'which', 'a', 'magnetic', 'cloud', 'was', 'observed', 'sequentially', 'by', 'four', 'spacecraft', 'near', 'mercury', 'venus', 'earth', 'and', 'mars', 'respectively', 'with', 'the', 'aids', 'of', 'a', 'uniformtwist', 'flux', 'rope', 'model', 'and', 'a', 'newly', 'developed', 'method', 'that', 'can', 'recover', 'a', 'shockcompressed', 'structure', 'we', 'find', 'that', 'the', 'axial', 'magnetic', 'flux', 'and', 'helicity', 'of', 'the', 'magnetic', 'cloud', 'decreased', 'when', 'it', 'propagated', 'outward', 'but', 'the', 'twist', 'increased', 'our', 'analysis', 'suggests', 'that', 'the', 'pancaking', 'effect', 'and', 'erosion', 'effect', 'may', 'jointly', 'cause', 'such', 'variations', 'the', 'significance', 'of', 'the', 'pancaking', 'effect', 'is', 'difficult', 'to', 'be', 'estimated', 'but', 'the', 'signature', 'of', 'the', 'erosion', 'can', 'be', 'found', 'as', 'the', 'imbalance', 'of', 'the', 'azimuthal', 'flux', 'of', 'the', 'cloud', 'the', 'latter', 'implies', 'that', 'the', 'magnetic', 'cloud', 'was', 'eroded', 'significantly', 'leaving', 'its', 'inner', 'core', 'exposed', 'to', 'the', 'solar', 'wind', 'at', 'far', 'distance', 'the', 'increase', 'of', 'the', 'twist', 'together', 'with', 'the', 'presence', 'of', 'the', 'erosion', 'effect', 'suggests', 'that', 'the', 'posteruption', 'mfr', 'may', 'have', 'a', 'hightwist', 'core', 'enveloped', 'by', 'a', 'lesstwisted', 'outer', 'shell', 'these', 'results', 'pose', 'a', 'great', 'challenge', 'to', 'the', 'current', 'understanding', 'on', 'the', 'solar', 'eruptions', 'as', 'well', 'as', 'the', 'formation', 'and', 'instability', 'of', 'mfrs']] | [-0.13523118501571962, 0.21500159063762264, -0.028564142932052037, 0.1217476395479984, -0.0779516402063073, -0.01021915789845567, 0.03837821301010488, 0.3952112642884504, -0.22495990125930024, -0.37452473158648075, 0.09770908093281581, -0.2241782131332078, -0.1378397209867913, 0.17674166541941128, -0.04540484907603862, -0.014059059511116126, 0.11257621734773265, 0.022839357843622565, -0.060571735423295976, -0.19254350088338004, 0.2797234791163433, 0.1265097037094127, 0.20590940030841118, 0.08044247023730099, 0.07344383349891549, -0.1248383136996103, 0.02558574094276322, 0.011791639024012812, -0.07318120968806831, 0.05188822124453425, 0.11474328092591658, 0.10318725359446863, 0.23486826648530415, -0.4767613557155661, -0.2506243820617825, 0.010256659608747358, 0.18520720370667187, 0.008220364928910914, -0.037785941628236556, -0.27483400193220353, 0.0525525407242164, -0.17232357689557465, -0.15006030381513003, 0.04028005978076964, 0.055043202092302145, -0.021275726951674314, -0.26987202354135953, 0.08069547096649224, 0.07180786079962867, 0.09052212370723237, -0.10983866141869386, -0.06006292728746162, -0.11126878920934752, 0.11526254457813712, 0.15139419159113535, 0.12220259068268799, 0.2366748134660141, -0.12663525431592282, -0.05646888382545824, 0.3620510648694435, -0.015334310173251858, -0.06900393732562349, 0.16896964757114835, -0.2276215549854554, -0.12155988330906062, 0.1895518259195977, 0.1275442181716217, 0.05300311572951066, -0.10148922465119373, -0.03272955414764077, -0.06680942112551325, 0.1338430709988814, 0.05431475398758091, -0.04533801157374293, 0.32916222549741114, 0.13665153093491855, 0.054360698161366156, 0.13466836086563985, -0.2241707581687703, -0.06155329504903702, -0.2408239005530978, -0.14895990810544077, -0.11487157237579633, 0.048114741587912506, -0.05410100964428204, -0.2108019141121826, 0.37283463566564023, 0.16233819196094218, 0.21260148411905042, -0.09404500050199409, 0.3040802338989607, 0.07609772107127477, 0.11349507650383846, 0.1567449963643804, 0.31780365701944074, 0.15619597970956164, 0.17287703495761028, -0.2594650976776796, 0.1454133689832176, 0.0516212994552307] |
1,803.01354 | Restricted Hom-Lie Superalgebras | The aim of this paper is to introduce the notion of restricted Hom- Lie
superalgebras. This class of algebras is a generalization of both restricted
Hom-Lie algebras and restricted Lie superalgebras. In this paper, we present a
way to obtain restricted Hom-Lie superalgebras from the classical restricted
Lie superalgebras along with algebra en- domorphisms. Homomorphisms relations
between restricted Hom-Lie superalgebras are defined and studied. Also, we
obtain some proper- ties of p-maps and restrictable Hom-Lie superalgebras.
| math.RA | the aim of this paper is to introduce the notion of restricted hom lie superalgebras this class of algebras is a generalization of both restricted homlie algebras and restricted lie superalgebras in this paper we present a way to obtain restricted homlie superalgebras from the classical restricted lie superalgebras along with algebra en domorphisms homomorphisms relations between restricted homlie superalgebras are defined and studied also we obtain some proper ties of pmaps and restrictable homlie superalgebras | [['the', 'aim', 'of', 'this', 'paper', 'is', 'to', 'introduce', 'the', 'notion', 'of', 'restricted', 'hom', 'lie', 'superalgebras', 'this', 'class', 'of', 'algebras', 'is', 'a', 'generalization', 'of', 'both', 'restricted', 'homlie', 'algebras', 'and', 'restricted', 'lie', 'superalgebras', 'in', 'this', 'paper', 'we', 'present', 'a', 'way', 'to', 'obtain', 'restricted', 'homlie', 'superalgebras', 'from', 'the', 'classical', 'restricted', 'lie', 'superalgebras', 'along', 'with', 'algebra', 'en', 'domorphisms', 'homomorphisms', 'relations', 'between', 'restricted', 'homlie', 'superalgebras', 'are', 'defined', 'and', 'studied', 'also', 'we', 'obtain', 'some', 'proper', 'ties', 'of', 'pmaps', 'and', 'restrictable', 'homlie', 'superalgebras']] | [-0.18933777380734682, 0.008808726792534192, -0.03167849636326234, 0.10093214498677601, -0.2827364712705215, -0.18966126502801975, -0.033590751104056835, 0.41346101512511574, -0.3787184649705887, -0.19195242868736387, 0.07662601091898978, -0.18370048214991888, -0.21143228739500045, 0.12641650730123122, -0.23565421978632609, -0.10212657284612457, 0.05335499004771312, 0.152980895396322, -0.1629013604655241, -0.2564787187520415, 0.4703115915134549, 0.007622316833585501, 0.19565195869654417, -0.060164035682876905, 0.10952327661216259, 0.031401059416433175, 0.01807256990422805, -0.04228894683221976, -0.25623806548615297, 0.16984699664016564, 0.3554567186782757, 0.024493374843150378, 0.19609634553392727, -0.30863471324245134, -0.004916861069699128, 0.22462472086151442, 0.2146557727518181, 0.03900430328367899, -0.025162513069808483, -0.2968961853782336, 0.05472656057526668, -0.2815285193733871, -0.06742483660889169, -0.06185866483176748, 0.03811313673853874, -0.05158193692564964, -0.1704598078255852, 0.06455238817531304, 0.12241748712956906, 0.19966873088327702, -0.15936159967755278, -0.08892031909277041, -0.059343941252057754, 0.03929962545322875, -0.17811491328602036, -0.02674255817507704, 0.106311336842676, -0.07061357911676168, -0.2550022570540508, 0.391005957921346, 0.09429743444624668, -0.25988590336715184, 0.11401378172139327, -0.18348497768243155, -0.27595996903876463, -0.0176093956331412, 0.03182461683948835, 0.16099171536664167, -0.14284808965399862, 0.23777189126005396, -0.11293955025573571, -0.1456406146287918, 0.12015816629553834, 0.05001129711667696, 0.1343441401406502, 0.11404340603699287, 0.018582881518329184, 0.20988536413758993, 0.13772569180776675, 0.028059637968738872, -0.3786320550739765, -0.15350982916851838, -0.006116187882920106, 0.11572449691593648, -0.08214353127346839, -0.1295861963306864, 0.42287631044785184, 0.1820917120971717, 0.16762425161898137, 0.24051159513493378, 0.12792538630465666, 0.07059604151174426, 0.2172632176739474, 0.0686319049820304, 0.18375732176820747, 0.43373857146749895, 0.019181877337396146, -0.06304867745532344, -0.15988701668878397, 0.20121871723483006] |
1,803.01355 | A unified picture of roto-translational dynamics in aqueous polyatomic
ions | Mode-coupling theory provides a unified description of the rotational and
translational dynamics of polyatomic ions. These molecular ions are distinct
from usual models of ion diffusion, such as K+ , Cl- etc., and also different
from rotational dynamics of dipolar molecules often modeled in dielectric
continuum models as point dipoles. Both these approaches are untenable for
polyatomic ions. Here rotational and translational dynamics are so strongly
coupled that one obtains a more coherent description by treating them together.
We carry out theoretical and computational studies of a series of well-known
polyatomic ions, namely sulfate, nitrate and acetate ions. All the three ions
exhibit different rotational diffusivity, with that of nitrate ion being
considerably larger than the other two. They all defy the hydrodynamic laws of
size dependence. Study of the local structure around the ions provides valuable
insight into the origin of these differences. We carry out a detailed study of
the rotational diffusion of these ions by extensive computer simulation and
using the theoretical approaches of the dielectric friction developed by
Fatuzzo-Mason (FM) and Nee-Zwanzig (NZ), and subsequently generalized by Alavi
and Waldeck. We develop a self-consistent mode-coupling theory (SC-MCT)
formalism that helps elucidating the role of coupling between translational and
rotational motion of these ions. In fact, these two motions self-consistently
determine the value of each other. The RISM-based MCT suggests an interesting
relation between the torque-torque and the force-force time correlation
function with the proportionality constant being determined by the geometry and
the charge distribution of the polyatomic molecule.We point out several
parallelism between the theories of translational and rotation friction
calculations of ions in dipolar liquids.
| cond-mat.soft physics.chem-ph | modecoupling theory provides a unified description of the rotational and translational dynamics of polyatomic ions these molecular ions are distinct from usual models of ion diffusion such as k cl etc and also different from rotational dynamics of dipolar molecules often modeled in dielectric continuum models as point dipoles both these approaches are untenable for polyatomic ions here rotational and translational dynamics are so strongly coupled that one obtains a more coherent description by treating them together we carry out theoretical and computational studies of a series of wellknown polyatomic ions namely sulfate nitrate and acetate ions all the three ions exhibit different rotational diffusivity with that of nitrate ion being considerably larger than the other two they all defy the hydrodynamic laws of size dependence study of the local structure around the ions provides valuable insight into the origin of these differences we carry out a detailed study of the rotational diffusion of these ions by extensive computer simulation and using the theoretical approaches of the dielectric friction developed by fatuzzomason fm and neezwanzig nz and subsequently generalized by alavi and waldeck we develop a selfconsistent modecoupling theory scmct formalism that helps elucidating the role of coupling between translational and rotational motion of these ions in fact these two motions selfconsistently determine the value of each other the rismbased mct suggests an interesting relation between the torquetorque and the forceforce time correlation function with the proportionality constant being determined by the geometry and the charge distribution of the polyatomic moleculewe point out several parallelism between the theories of translational and rotation friction calculations of ions in dipolar liquids | [['modecoupling', 'theory', 'provides', 'a', 'unified', 'description', 'of', 'the', 'rotational', 'and', 'translational', 'dynamics', 'of', 'polyatomic', 'ions', 'these', 'molecular', 'ions', 'are', 'distinct', 'from', 'usual', 'models', 'of', 'ion', 'diffusion', 'such', 'as', 'k', 'cl', 'etc', 'and', 'also', 'different', 'from', 'rotational', 'dynamics', 'of', 'dipolar', 'molecules', 'often', 'modeled', 'in', 'dielectric', 'continuum', 'models', 'as', 'point', 'dipoles', 'both', 'these', 'approaches', 'are', 'untenable', 'for', 'polyatomic', 'ions', 'here', 'rotational', 'and', 'translational', 'dynamics', 'are', 'so', 'strongly', 'coupled', 'that', 'one', 'obtains', 'a', 'more', 'coherent', 'description', 'by', 'treating', 'them', 'together', 'we', 'carry', 'out', 'theoretical', 'and', 'computational', 'studies', 'of', 'a', 'series', 'of', 'wellknown', 'polyatomic', 'ions', 'namely', 'sulfate', 'nitrate', 'and', 'acetate', 'ions', 'all', 'the', 'three', 'ions', 'exhibit', 'different', 'rotational', 'diffusivity', 'with', 'that', 'of', 'nitrate', 'ion', 'being', 'considerably', 'larger', 'than', 'the', 'other', 'two', 'they', 'all', 'defy', 'the', 'hydrodynamic', 'laws', 'of', 'size', 'dependence', 'study', 'of', 'the', 'local', 'structure', 'around', 'the', 'ions', 'provides', 'valuable', 'insight', 'into', 'the', 'origin', 'of', 'these', 'differences', 'we', 'carry', 'out', 'a', 'detailed', 'study', 'of', 'the', 'rotational', 'diffusion', 'of', 'these', 'ions', 'by', 'extensive', 'computer', 'simulation', 'and', 'using', 'the', 'theoretical', 'approaches', 'of', 'the', 'dielectric', 'friction', 'developed', 'by', 'fatuzzomason', 'fm', 'and', 'neezwanzig', 'nz', 'and', 'subsequently', 'generalized', 'by', 'alavi', 'and', 'waldeck', 'we', 'develop', 'a', 'selfconsistent', 'modecoupling', 'theory', 'scmct', 'formalism', 'that', 'helps', 'elucidating', 'the', 'role', 'of', 'coupling', 'between', 'translational', 'and', 'rotational', 'motion', 'of', 'these', 'ions', 'in', 'fact', 'these', 'two', 'motions', 'selfconsistently', 'determine', 'the', 'value', 'of', 'each', 'other', 'the', 'rismbased', 'mct', 'suggests', 'an', 'interesting', 'relation', 'between', 'the', 'torquetorque', 'and', 'the', 'forceforce', 'time', 'correlation', 'function', 'with', 'the', 'proportionality', 'constant', 'being', 'determined', 'by', 'the', 'geometry', 'and', 'the', 'charge', 'distribution', 'of', 'the', 'polyatomic', 'moleculewe', 'point', 'out', 'several', 'parallelism', 'between', 'the', 'theories', 'of', 'translational', 'and', 'rotation', 'friction', 'calculations', 'of', 'ions', 'in', 'dipolar', 'liquids']] | [-0.10090896741800477, 0.18051909024614934, -0.06955350910671083, 0.04321971670246396, 0.007303809853334391, -0.14873512636891392, 0.018784435133949035, 0.3717573449553872, -0.25180700709937076, -0.2983955381971079, 0.0025271735346199726, -0.28536543486721305, -0.10150334853041534, 0.15627166310886537, 0.06842472818821754, 0.018049903187419187, 0.0011854346862820617, -0.027175098311903217, -0.05674342231332774, -0.15176687368188238, 0.25606028605865566, 0.0649369558715173, 0.24792153695456598, 0.06972321004034887, 0.09539565188454344, -0.04299912425891245, -0.01553983936757345, 0.036971828719236294, -0.1528810920461757, 0.13042386819187113, 0.2030794726512999, 0.034125814458688175, 0.23556192714620042, -0.4920730475945391, -0.23770028741024576, 0.021033263372207775, 0.1570856387080924, 0.16342129216426735, -0.040144249007467464, -0.24901938105458854, -0.020016746887646812, -0.13656720224309343, -0.13627630869633103, -0.1347907254106751, 0.025300176644223273, 0.0772797426557657, -0.20195504073022613, 0.1284042081082755, 0.07849431133248308, 0.12801648212568334, -0.10308946396079013, -0.15328454572934047, -0.06879305731267898, 0.09947615343114156, 0.0841917564672818, -0.017503018866332085, 0.17697448279184533, -0.09188383789874699, -0.08680840443528502, 0.4318671287046285, -0.05110618204593051, -0.17792244166604548, 0.24344782516698463, -0.1604333653631744, -0.13499612062142546, 0.17721579198552004, 0.11919781924738856, 0.11143724992517169, -0.1648449010356018, 0.029662326921774392, -0.026685268481168187, 0.16402595347500545, 0.05763878420819953, 0.03333790385883174, 0.2325201970688864, 0.1254354036313981, -0.02333003064766243, 0.10800560685363775, -0.09262315110498667, -0.14893371067381686, -0.25539234355791424, -0.17174655906386027, -0.15526292283006524, 0.040315039616127715, -0.10697019414394383, -0.12426682506748139, 0.34464458243021945, 0.12017411281383054, 0.15815933985713543, -0.0069772099683011665, 0.2575071854729333, 0.05846773625967649, 0.029122791108728417, 0.043675804379690056, 0.24743927695908843, 0.1750506469643473, 0.07679471210488065, -0.30954875847583235, 0.04324783864183203, 0.06273158784945117] |
1,803.01356 | Classification based Grasp Detection using Spatial Transformer Network | Robotic grasp detection task is still challenging, particularly for novel
objects. With the recent advance of deep learning, there have been several
works on detecting robotic grasp using neural networks. Typically, regression
based grasp detection methods have outperformed classification based detection
methods in computation complexity with excellent accuracy. However,
classification based robotic grasp detection still seems to have merits such as
intermediate step observability and straightforward back propagation routine
for end-to-end training. In this work, we propose a novel classification based
robotic grasp detection method with multiple-stage spatial transformer networks
(STN). Our proposed method was able to achieve state-of-the-art performance in
accuracy with real- time computation. Additionally, unlike other regression
based grasp detection methods, our proposed method allows partial observation
for intermediate results such as grasp location and orientation for a number of
grasp configuration candidates.
| cs.CV cs.RO | robotic grasp detection task is still challenging particularly for novel objects with the recent advance of deep learning there have been several works on detecting robotic grasp using neural networks typically regression based grasp detection methods have outperformed classification based detection methods in computation complexity with excellent accuracy however classification based robotic grasp detection still seems to have merits such as intermediate step observability and straightforward back propagation routine for endtoend training in this work we propose a novel classification based robotic grasp detection method with multiplestage spatial transformer networks stn our proposed method was able to achieve stateoftheart performance in accuracy with real time computation additionally unlike other regression based grasp detection methods our proposed method allows partial observation for intermediate results such as grasp location and orientation for a number of grasp configuration candidates | [['robotic', 'grasp', 'detection', 'task', 'is', 'still', 'challenging', 'particularly', 'for', 'novel', 'objects', 'with', 'the', 'recent', 'advance', 'of', 'deep', 'learning', 'there', 'have', 'been', 'several', 'works', 'on', 'detecting', 'robotic', 'grasp', 'using', 'neural', 'networks', 'typically', 'regression', 'based', 'grasp', 'detection', 'methods', 'have', 'outperformed', 'classification', 'based', 'detection', 'methods', 'in', 'computation', 'complexity', 'with', 'excellent', 'accuracy', 'however', 'classification', 'based', 'robotic', 'grasp', 'detection', 'still', 'seems', 'to', 'have', 'merits', 'such', 'as', 'intermediate', 'step', 'observability', 'and', 'straightforward', 'back', 'propagation', 'routine', 'for', 'endtoend', 'training', 'in', 'this', 'work', 'we', 'propose', 'a', 'novel', 'classification', 'based', 'robotic', 'grasp', 'detection', 'method', 'with', 'multiplestage', 'spatial', 'transformer', 'networks', 'stn', 'our', 'proposed', 'method', 'was', 'able', 'to', 'achieve', 'stateoftheart', 'performance', 'in', 'accuracy', 'with', 'real', 'time', 'computation', 'additionally', 'unlike', 'other', 'regression', 'based', 'grasp', 'detection', 'methods', 'our', 'proposed', 'method', 'allows', 'partial', 'observation', 'for', 'intermediate', 'results', 'such', 'as', 'grasp', 'location', 'and', 'orientation', 'for', 'a', 'number', 'of', 'grasp', 'configuration', 'candidates']] | [-0.009059452835251303, -0.10752590579453253, -0.06118350734879427, -0.010048051830381155, -0.1510489558294306, -0.26071831048466265, 0.013919438614667504, 0.5184336248511339, -0.15809075020061916, -0.40261399584329305, 0.08794310693509247, -0.1784716043057415, -0.22466222154231646, 0.2344251775648445, -0.14793673666452592, 0.1663328527686056, 0.15745672837382538, 0.05612355673699366, -0.09666504137396045, -0.3037503423735924, 0.22096834603700485, 0.08019187484730056, 0.349518389605424, 0.027177806322202635, 0.1572459351052256, 0.001945584940532332, -0.01856645423686132, -0.002940846514641581, -0.03424801678492633, 0.17446164227080505, 0.3645068324797595, 0.19838137520641527, 0.3283434086205328, -0.38780784986310585, -0.24590989184627474, 0.09151529751526301, 0.154386818936259, 0.10958204920376267, -0.07662386859866434, -0.3788505916702835, 0.0597775766869103, -0.17565263887209928, -0.025819159783970785, -0.19216912131249794, -0.0060338510118205756, -0.01197078614238896, -0.2375204867875094, 0.006421401162001798, 0.029864558345734087, 0.09653331474777695, -0.0477146340884193, -0.11924722864333649, 0.09837012677384979, 0.15417419895803666, -0.011064351647612913, 0.059195650392211974, 0.15616296799784965, -0.18973643805742646, -0.21661528943599584, 0.3760925637873109, -0.019333427073433995, -0.1994467480947017, 0.2590441133652348, 0.009758509321674116, -0.20753886001116104, 0.13791829116149423, 0.23870369322214494, 0.1775458439883283, -0.11957232150084832, -0.03518370353798245, 0.005442427166545873, 0.16573415876379893, 0.03021355447195032, -0.024194910581333235, 0.1702718923556591, 0.34895185875596807, 0.062309665059301016, 0.07429389024935731, -0.21886930271113456, -0.05501512903377742, -0.16551480950404177, -0.1010167095095419, -0.18929001517073415, -0.05949059253565364, -0.03577058293141069, -0.13292625470443026, 0.3653826580780065, 0.3008821549250142, 0.1910965346135473, 0.13386002222678678, 0.40393267596578775, 0.010001268705202486, 0.1042383693240802, 0.0821519685247468, 0.2657142238116221, 0.011619195140477078, 0.09662681042476941, -0.1903063706430497, 0.1544699949265444, 0.09046127143494018] |
1,803.01357 | On the Infinitesimal Torelli theorem for regular surfaces with very
ample canonical divisor | Let $X$ be a smooth compact complex surface subject to the following
conditions:
(i) the canonical line bundle $\mathcal{O}_X(K_X) $ is very ample,
(ii) the irregularity $q(X): = h^1(\mathcal{O}_X) =0$,
(iii) $X$ contains no rational normal curves of degree $\leq (p_g-1)$,
(iv) the multiplication map $m_2: Sym^2(H^0(\mathcal{O}_X(K_X)))
\longrightarrow H^0 (\mathcal{O}_X (2K_X))$ is surjective.
It is shown that the Infinitesimal Torelli holds for such $X$.
Our proof is based on the study of the cup-product
$$ H^1 (\Theta_X) \longrightarrow (\mathcal{O}_X(K_X))^{\ast} \otimes H^1
(\Omega_X) $$ where $\Theta_X$ (resp. $\Omega_X$) is the holomorphic tangent
(resp. cotangent) bundle of $X$. Conceptually, the approach consists of lifting
the data of the cohomological cup-product above to the category of complexes of
coherent sheaves of $X$. This establishes connections between the geometry of
the canonical map and the above cup-product by exhibiting geometrically
meaningful objects in the category of (short) exact complexes of coherent
sheaves on $X$.
| math.AG | let x be a smooth compact complex surface subject to the following conditions i the canonical line bundle mathcalo_xk_x is very ample ii the irregularity qx h1mathcalo_x 0 iii x contains no rational normal curves of degree leq p_g1 iv the multiplication map m_2 sym2h0mathcalo_xk_x longrightarrow h0 mathcalo_x 2k_x is surjective it is shown that the infinitesimal torelli holds for such x our proof is based on the study of the cupproduct h1 theta_x longrightarrow mathcalo_xk_xast otimes h1 omega_x where theta_x resp omega_x is the holomorphic tangent resp cotangent bundle of x conceptually the approach consists of lifting the data of the cohomological cupproduct above to the category of complexes of coherent sheaves of x this establishes connections between the geometry of the canonical map and the above cupproduct by exhibiting geometrically meaningful objects in the category of short exact complexes of coherent sheaves on x | [['let', 'x', 'be', 'a', 'smooth', 'compact', 'complex', 'surface', 'subject', 'to', 'the', 'following', 'conditions', 'i', 'the', 'canonical', 'line', 'bundle', 'mathcalo_xk_x', 'is', 'very', 'ample', 'ii', 'the', 'irregularity', 'qx', 'h1mathcalo_x', '0', 'iii', 'x', 'contains', 'no', 'rational', 'normal', 'curves', 'of', 'degree', 'leq', 'p_g1', 'iv', 'the', 'multiplication', 'map', 'm_2', 'sym2h0mathcalo_xk_x', 'longrightarrow', 'h0', 'mathcalo_x', '2k_x', 'is', 'surjective', 'it', 'is', 'shown', 'that', 'the', 'infinitesimal', 'torelli', 'holds', 'for', 'such', 'x', 'our', 'proof', 'is', 'based', 'on', 'the', 'study', 'of', 'the', 'cupproduct', 'h1', 'theta_x', 'longrightarrow', 'mathcalo_xk_xast', 'otimes', 'h1', 'omega_x', 'where', 'theta_x', 'resp', 'omega_x', 'is', 'the', 'holomorphic', 'tangent', 'resp', 'cotangent', 'bundle', 'of', 'x', 'conceptually', 'the', 'approach', 'consists', 'of', 'lifting', 'the', 'data', 'of', 'the', 'cohomological', 'cupproduct', 'above', 'to', 'the', 'category', 'of', 'complexes', 'of', 'coherent', 'sheaves', 'of', 'x', 'this', 'establishes', 'connections', 'between', 'the', 'geometry', 'of', 'the', 'canonical', 'map', 'and', 'the', 'above', 'cupproduct', 'by', 'exhibiting', 'geometrically', 'meaningful', 'objects', 'in', 'the', 'category', 'of', 'short', 'exact', 'complexes', 'of', 'coherent', 'sheaves', 'on', 'x']] | [-0.22808318286523196, 0.045628286228128805, -0.0570075485643977, 0.0682487921122171, -0.07910212738842354, -0.1705501256081282, -0.017559608740150823, 0.37356712476264503, -0.35534199059062394, -0.11832663204177474, 0.05170154750119261, -0.24839443006502804, -0.10994849099401147, 0.19137203312934714, -0.15013533293315812, -0.08029934401947555, 0.0062235066376573655, 0.10651656978677773, -0.13526423593012102, -0.22715610402045072, 0.44471999583765864, -0.060530653297703, 0.22739221753407243, 0.04175857064500575, 0.1791758051890127, -0.017949036045118848, 0.03617301146361105, -0.08998409504936149, -0.1720780747489453, 0.14432354642165798, 0.2886508110355824, 0.08235089893697213, 0.1492979099448929, -0.3266472938794194, -0.10970062121141252, 0.2346239265992392, 0.07690833791048457, -0.08500513500461342, 0.03718100686835006, -0.2926644434036145, 0.12792219484125014, -0.07614334885632464, -0.1440073723193912, -0.05249583829815189, 0.12318821139435501, 0.025578494548652294, -0.24597928399576785, 0.015237907746952054, 0.11559545606084115, 0.1119216767516225, -0.04742716607498996, -0.10928577125891514, -0.18608116295935045, 0.02222332499709958, -0.040205324559096006, 0.14477333182333604, 0.10919366220523379, -0.08385451282320894, -0.014017646695100801, 0.3630225006424895, -0.06917013930724868, -0.18864188694679146, 0.09627207400151759, -0.17450259313406752, -0.14961902722914486, 0.19905822374610269, 0.023334699265117234, 0.19358570394019517, 0.02994355116805709, 0.24505318724178768, -0.1358975662176121, 0.11893686064162311, 0.06510226217805283, -0.030866354044216376, 0.13218613773425844, 0.14549058240488277, 0.08573841436349965, 0.06131087630947537, -0.05537536930200373, -0.01604907205322153, -0.41711107213446436, -0.21101007506446187, -0.09712207415768652, 0.2400815852237403, -0.10643726797328175, -0.12248684224199523, 0.34032107527361166, 0.012305543559821362, 0.2564268371896118, 0.12250448253346526, 0.21869648345052561, 0.029499371685104192, 0.006793023886304375, 0.014500778013219437, 0.12729892730283557, 0.254462341746606, -0.026828427323477066, -0.11521792100207444, -0.011254660451639417, 0.18691561574030482] |
1,803.01358 | Applied Erasure Coding in Networks and Distributed Storage | The amount of digital data is rapidly growing. There is an increasing use of
a wide range of computer systems, from mobile devices to large-scale data
centers, and important for reliable operation of all computer systems is
mitigating the occurrence and the impact of errors in digital data. The demand
for new ultra-fast and highly reliable coding techniques for data at rest and
for data in transit is a major research challenge. Reliability is one of the
most important design requirements. The simplest way of providing a degree of
reliability is by using data replication techniques. However, replication is
highly inefficient in terms of capacity utilization. Erasure coding has
therefore become a viable alternative to replication since it provides the same
level of reliability as replication with significantly less storage overhead.
The present thesis investigates efficient constructions of erasure codes for
different applications. Methods from both coding and information theory have
been applied to network coding, Optical Packet Switching (OPS) networks and
distributed storage systems. The following four issues are addressed: -
Construction of binary and non-binary erasure codes; - Reduction of the header
overhead due to the encoding coefficients in network coding; - Construction and
implementation of new erasure codes for large-scale distributed storage systems
that provide savings in the storage and network resources compared to
state-of-the-art codes; and - Provision of a unified view on Quality of Service
(QoS) in OPS networks when erasure codes are used, with the focus on Packet
Loss Rate (PLR), survivability and secrecy.
| cs.IT cs.DC math.IT | the amount of digital data is rapidly growing there is an increasing use of a wide range of computer systems from mobile devices to largescale data centers and important for reliable operation of all computer systems is mitigating the occurrence and the impact of errors in digital data the demand for new ultrafast and highly reliable coding techniques for data at rest and for data in transit is a major research challenge reliability is one of the most important design requirements the simplest way of providing a degree of reliability is by using data replication techniques however replication is highly inefficient in terms of capacity utilization erasure coding has therefore become a viable alternative to replication since it provides the same level of reliability as replication with significantly less storage overhead the present thesis investigates efficient constructions of erasure codes for different applications methods from both coding and information theory have been applied to network coding optical packet switching ops networks and distributed storage systems the following four issues are addressed construction of binary and nonbinary erasure codes reduction of the header overhead due to the encoding coefficients in network coding construction and implementation of new erasure codes for largescale distributed storage systems that provide savings in the storage and network resources compared to stateoftheart codes and provision of a unified view on quality of service qos in ops networks when erasure codes are used with the focus on packet loss rate plr survivability and secrecy | [['the', 'amount', 'of', 'digital', 'data', 'is', 'rapidly', 'growing', 'there', 'is', 'an', 'increasing', 'use', 'of', 'a', 'wide', 'range', 'of', 'computer', 'systems', 'from', 'mobile', 'devices', 'to', 'largescale', 'data', 'centers', 'and', 'important', 'for', 'reliable', 'operation', 'of', 'all', 'computer', 'systems', 'is', 'mitigating', 'the', 'occurrence', 'and', 'the', 'impact', 'of', 'errors', 'in', 'digital', 'data', 'the', 'demand', 'for', 'new', 'ultrafast', 'and', 'highly', 'reliable', 'coding', 'techniques', 'for', 'data', 'at', 'rest', 'and', 'for', 'data', 'in', 'transit', 'is', 'a', 'major', 'research', 'challenge', 'reliability', 'is', 'one', 'of', 'the', 'most', 'important', 'design', 'requirements', 'the', 'simplest', 'way', 'of', 'providing', 'a', 'degree', 'of', 'reliability', 'is', 'by', 'using', 'data', 'replication', 'techniques', 'however', 'replication', 'is', 'highly', 'inefficient', 'in', 'terms', 'of', 'capacity', 'utilization', 'erasure', 'coding', 'has', 'therefore', 'become', 'a', 'viable', 'alternative', 'to', 'replication', 'since', 'it', 'provides', 'the', 'same', 'level', 'of', 'reliability', 'as', 'replication', 'with', 'significantly', 'less', 'storage', 'overhead', 'the', 'present', 'thesis', 'investigates', 'efficient', 'constructions', 'of', 'erasure', 'codes', 'for', 'different', 'applications', 'methods', 'from', 'both', 'coding', 'and', 'information', 'theory', 'have', 'been', 'applied', 'to', 'network', 'coding', 'optical', 'packet', 'switching', 'ops', 'networks', 'and', 'distributed', 'storage', 'systems', 'the', 'following', 'four', 'issues', 'are', 'addressed', 'construction', 'of', 'binary', 'and', 'nonbinary', 'erasure', 'codes', 'reduction', 'of', 'the', 'header', 'overhead', 'due', 'to', 'the', 'encoding', 'coefficients', 'in', 'network', 'coding', 'construction', 'and', 'implementation', 'of', 'new', 'erasure', 'codes', 'for', 'largescale', 'distributed', 'storage', 'systems', 'that', 'provide', 'savings', 'in', 'the', 'storage', 'and', 'network', 'resources', 'compared', 'to', 'stateoftheart', 'codes', 'and', 'provision', 'of', 'a', 'unified', 'view', 'on', 'quality', 'of', 'service', 'qos', 'in', 'ops', 'networks', 'when', 'erasure', 'codes', 'are', 'used', 'with', 'the', 'focus', 'on', 'packet', 'loss', 'rate', 'plr', 'survivability', 'and', 'secrecy']] | [-0.22094825778546462, 0.02127434915113613, -0.02026397692289476, 0.042104790448608646, -0.015996900294354657, -0.22506748950033167, 0.1026767904134808, 0.3722884124115335, -0.28426307714137256, -0.2965108403989031, 0.16644447730339276, -0.2517335758638205, -0.11971572814868929, 0.23949546456465695, -0.15683614070209242, 0.13196376988113426, 0.08479455792453004, 0.006503482051198446, -0.04916500181482151, -0.3113966775448554, 0.27782837653483405, 0.16770555645384072, 0.384567906697682, 0.043426440693665205, 0.042633193118187286, 0.01723092379866213, -0.052865074434491795, -0.06264889177608841, -0.08490386092576896, 0.18214368215587928, 0.3366354196550082, 0.23954410057957853, 0.27684774650904403, -0.4359908828595123, -0.26873560118885537, 0.05821237789998891, 0.16054740840781148, 0.1519325521748089, -0.10255403756883329, -0.18837488729864496, 0.1080097061017816, -0.24224562434309466, -0.007878557141864109, -0.057930372301413395, 0.033708469275900016, 0.04829812589114744, -0.2739897103435019, 0.013395615767240828, -0.012564599398538713, 0.08999965590523268, -0.04002519212910438, -0.10027265797626621, 0.028535215513462702, 0.15763277556840424, 0.0008497100145503031, 0.0245524398132835, 0.11043740106023454, -0.13142701457926578, -0.14817053153808038, 0.4011030495100526, 0.024597887770363654, -0.1701425156268344, 0.15457608532330885, -0.02424751935958317, -0.1425101065428973, 0.15484688131846638, 0.2530560050428489, 0.049964326782136914, -0.18344698828102962, 0.022324533957270604, 0.05569494719715501, 0.19536113527762453, 0.06381039852768607, 0.1615129975929508, 0.18427513650527633, 0.23483191352295954, 0.0726715237066922, 0.146765201420209, -0.0809297610009922, -0.11673137864544685, -0.19509689113299356, -0.12883940178023584, -0.18310856727978575, -0.0015666191769021798, -0.10507019068526409, -0.12399456727628906, 0.34634467965461374, 0.16854099719501214, 0.11776398622328643, 0.08164016137702193, 0.38255600410142565, 0.031205159373017315, 0.13525449394104563, 0.15301697377524362, 0.16099840545046287, 0.09762942426122452, 0.13971920873273194, -0.17281574090636084, 0.12409281195141375, -0.018958108950164018] |
1,803.01359 | Transition threshold for the 3D Couette flow in Sobolev space | In this paper, we study the transition threshold of the 3D Couette flow in
Sobolev space at high Reynolds number $\text{Re}$. It was proved that if the
initial velocity $v_0$ satisfies $\|v_0-(y,0,0)\|_{H^2}\le c_0\text{Re}^{-1}$,
then the solution of the 3D Navier-Stokes equations is global in time and does
not transition away from the Couette flow. This result confirms the transition
threshold conjecture in physical literatures.
| math.AP | in this paper we study the transition threshold of the 3d couette flow in sobolev space at high reynolds number textre it was proved that if the initial velocity v_0 satisfies v_0y00_h2le c_0textre1 then the solution of the 3d navierstokes equations is global in time and does not transition away from the couette flow this result confirms the transition threshold conjecture in physical literatures | [['in', 'this', 'paper', 'we', 'study', 'the', 'transition', 'threshold', 'of', 'the', '3d', 'couette', 'flow', 'in', 'sobolev', 'space', 'at', 'high', 'reynolds', 'number', 'textre', 'it', 'was', 'proved', 'that', 'if', 'the', 'initial', 'velocity', 'v_0', 'satisfies', 'v_0y00_h2le', 'c_0textre1', 'then', 'the', 'solution', 'of', 'the', '3d', 'navierstokes', 'equations', 'is', 'global', 'in', 'time', 'and', 'does', 'not', 'transition', 'away', 'from', 'the', 'couette', 'flow', 'this', 'result', 'confirms', 'the', 'transition', 'threshold', 'conjecture', 'in', 'physical', 'literatures']] | [-0.1508818926710275, 0.13095333158308942, -0.09359047513815665, -0.014142612860943642, -0.02177917622330208, -0.0932460542497856, -0.013891911703056746, 0.28233482290224565, -0.2865324016029556, -0.24282503384916532, 0.09291590832834763, -0.2701865570552106, -0.1302827768508465, 0.15122017459643464, -0.07521608313770904, 0.1250199123751372, 0.059448558044800114, 0.0311399778771785, -0.05533650479534821, -0.18640869659852358, 0.35163615827238365, -0.011682108855776249, 0.3222695899556481, 0.07322551983769142, 0.08643718954596308, -0.09466010823305096, 0.06542290551888366, 0.04864886792840421, -0.26398553019222865, -0.02753114626712857, 0.23709208742084523, 0.08175277030996737, 0.26872236299658975, -0.40494106172193445, -0.22959550188088249, 0.08552649592785465, 0.16948889144846507, 0.133275679883457, -0.01820213552714596, -0.24903155847512667, 0.12963636830869701, -0.09572400878213587, -0.1712870431553212, -0.01317051003476785, 0.04541112704112405, 0.019011853033706786, -0.28197794786894753, 0.14368079122035735, 0.08541507030707679, 0.0893758941674605, -0.12526933928470937, -0.016198984520029155, -0.09193915176776148, 0.08922440903411517, 0.07813041564828206, 0.09395765162809121, 0.07404760109831489, -0.17106033599514875, 0.02299085215124632, 0.40190191374671075, -0.03212369143241836, -0.19758237985473487, 0.14908102665457032, -0.2515253397155433, -0.11111527121806096, 0.17655612131009898, 0.18312388660025694, 0.10471273851280491, -0.04764664073985431, 0.10306649333553299, -0.14550754755374887, 0.16400752477948705, 0.10845234169955215, -0.09636469163195861, 0.09745976983779861, 0.14297019619674933, 0.11782647490561489, 0.1183773390115558, -0.10260682255912182, -0.09704857974147965, -0.34210772466875855, -0.15743175972132914, -0.228643145292036, 0.07121321790679846, -0.0968785962583253, -0.14598523401770264, 0.3397872490553005, 0.17102488076254244, 0.18104737385686848, 0.07217466800413545, 0.27541989510908965, 0.13886449546853621, -0.012697170368365703, 0.17227738941719214, 0.2966188357602204, 0.13825687641022547, 0.22790658194571733, -0.1911978143034503, 0.060814909944911635, 0.17230549043104534] |
1,803.0136 | On near-cloaking for linear elasticity | We make precise some results on the cloaking of displacement fields in linear
elasticity. In the spirit of transformation media theory, the transformed
governing equations in Cosserat and Willis frameworks are shown to be
equivalent to certain high contrast small defect problems for the usual Navier
equations. We discuss near-cloaking for elasticity systems via a regularized
transform and perform numerical experiments to illustrate our near-cloaking
results. We also study the sharpness of the estimates from [H. Ammari, H. Kang,
K. Kim and H. Lee, J. Diff. Eq. 254, 4446-4464 (2013)], wherein the convergence
of the solutions to the transmission problems is investigated, when the Lam\'e
parameters in the inclusion tend to extreme values. Both soft and hard
inclusion limits are studied and we also touch upon the finite frequency case.
Finally, we propose an approximate isotropic cloak algorithm for a symmetrized
Cosserat cloak.
| math.AP | we make precise some results on the cloaking of displacement fields in linear elasticity in the spirit of transformation media theory the transformed governing equations in cosserat and willis frameworks are shown to be equivalent to certain high contrast small defect problems for the usual navier equations we discuss nearcloaking for elasticity systems via a regularized transform and perform numerical experiments to illustrate our nearcloaking results we also study the sharpness of the estimates from h ammari h kang k kim and h lee j diff eq 254 44464464 2013 wherein the convergence of the solutions to the transmission problems is investigated when the lame parameters in the inclusion tend to extreme values both soft and hard inclusion limits are studied and we also touch upon the finite frequency case finally we propose an approximate isotropic cloak algorithm for a symmetrized cosserat cloak | [['we', 'make', 'precise', 'some', 'results', 'on', 'the', 'cloaking', 'of', 'displacement', 'fields', 'in', 'linear', 'elasticity', 'in', 'the', 'spirit', 'of', 'transformation', 'media', 'theory', 'the', 'transformed', 'governing', 'equations', 'in', 'cosserat', 'and', 'willis', 'frameworks', 'are', 'shown', 'to', 'be', 'equivalent', 'to', 'certain', 'high', 'contrast', 'small', 'defect', 'problems', 'for', 'the', 'usual', 'navier', 'equations', 'we', 'discuss', 'nearcloaking', 'for', 'elasticity', 'systems', 'via', 'a', 'regularized', 'transform', 'and', 'perform', 'numerical', 'experiments', 'to', 'illustrate', 'our', 'nearcloaking', 'results', 'we', 'also', 'study', 'the', 'sharpness', 'of', 'the', 'estimates', 'from', 'h', 'ammari', 'h', 'kang', 'k', 'kim', 'and', 'h', 'lee', 'j', 'diff', 'eq', '254', '44464464', '2013', 'wherein', 'the', 'convergence', 'of', 'the', 'solutions', 'to', 'the', 'transmission', 'problems', 'is', 'investigated', 'when', 'the', 'lame', 'parameters', 'in', 'the', 'inclusion', 'tend', 'to', 'extreme', 'values', 'both', 'soft', 'and', 'hard', 'inclusion', 'limits', 'are', 'studied', 'and', 'we', 'also', 'touch', 'upon', 'the', 'finite', 'frequency', 'case', 'finally', 'we', 'propose', 'an', 'approximate', 'isotropic', 'cloak', 'algorithm', 'for', 'a', 'symmetrized', 'cosserat', 'cloak']] | [-0.08477984923905443, 0.06657007254070264, -0.04150113357480248, 0.03519568625512913, -0.10919463892900189, -0.12838335502499215, -0.0014208607469081984, 0.38144855656411863, -0.27352823269439525, -0.26234110448555364, 0.12648712562292186, -0.2872637176663208, -0.188043477722037, 0.19211301616143803, -0.06892596606434073, 0.10295367179429044, 0.018691795274720226, -0.020592947319989473, -0.07593343626219176, -0.23820354971824817, 0.27124111830834036, 0.027212833592169722, 0.2785771566463231, 0.05167383021793105, 0.06838598681292431, 0.031034346428883433, -0.03923683063927251, 0.048371104111986786, -0.20297090480969826, 0.09996798689621435, 0.24724338597000714, 0.035258838201833655, 0.23774424050508303, -0.41189199006578453, -0.20731867934432877, 0.04586543234616098, 0.10449162047540009, 0.08074531387324563, 0.009584050641139366, -0.2812796872564998, 0.06908356275534074, -0.12581883378090783, -0.15378120851794808, -0.07910001358594483, 0.03479964333310933, 0.039207855408394734, -0.30011716961178564, 0.07678267754692544, 0.0859609363726865, 0.02283327530046374, -0.13524992989940227, -0.11984906654680332, 0.018768987462619766, 0.03684176948568357, 0.04096289057920779, -0.04146963370222808, 0.08311983157264095, -0.12366237114905052, -0.07540801135350911, 0.3940018561445701, -0.06082527801840448, -0.24263491461210898, 0.1820714525668554, -0.09948305211449698, -0.10006420969025193, 0.11455547753524717, 0.16989665478549923, 0.12813624451396016, -0.1074437482269607, 0.14822752800447092, -0.05051992133810696, 0.12309869087582395, 0.11847145960200578, -0.05048910898654919, 0.07695510890990706, 0.07692328831967964, 0.04066548929322252, 0.15415321410433586, -0.0463607575609939, -0.0726567610350608, -0.33132581423285984, -0.1538445596898001, -0.1594438560726777, 0.015366810514972034, -0.10749630371227936, -0.16455365242465222, 0.32046427888612095, 0.14723364068982256, 0.15258652277448229, 0.04837157317391321, 0.21501295166549234, 0.15436730634266982, 0.002019029336942124, 0.08594574363784156, 0.2916687773583657, 0.19800732929495649, 0.11610536215315298, -0.2153963448633899, -0.02096216439623648, 0.1123687011160245] |
1,803.01361 | Anomalous system-size dependence of electrolytic cells with an
electrified oil-water interface | Manipulation of the charge of the dielectric interface between two bulk
liquids not only enables the adjustment of the interfacial tension but also
controls the storage capacity of ions in the ionic double layers adjacent to
each side of the interface. However, adjusting this interfacial charge by
static external electric fields is difficult since the external electric fields
are readily screened by ionic double layers that form in the vicinity of the
external electrodes. This leaves the liquid-liquid interface, which is at a
macroscopic distance from the electrodes, unaffected. In this study we show
theoretically, in agreement with recent experiments, that control over this
surface charge at the liquid-liquid interface is nonetheless possible for
macroscopically large but finite closed systems in equilibrium, even when the
distance between the electrode and interface is orders of magnitude larger than
the Debye screening lengths of the two liquids. We identify a crossover
system-size below which the interface and the electrodes are effectively
coupled. Our calculations of the interfacial tension for various electrode
potentials are in good agreement with recent experimental data.
| cond-mat.soft | manipulation of the charge of the dielectric interface between two bulk liquids not only enables the adjustment of the interfacial tension but also controls the storage capacity of ions in the ionic double layers adjacent to each side of the interface however adjusting this interfacial charge by static external electric fields is difficult since the external electric fields are readily screened by ionic double layers that form in the vicinity of the external electrodes this leaves the liquidliquid interface which is at a macroscopic distance from the electrodes unaffected in this study we show theoretically in agreement with recent experiments that control over this surface charge at the liquidliquid interface is nonetheless possible for macroscopically large but finite closed systems in equilibrium even when the distance between the electrode and interface is orders of magnitude larger than the debye screening lengths of the two liquids we identify a crossover systemsize below which the interface and the electrodes are effectively coupled our calculations of the interfacial tension for various electrode potentials are in good agreement with recent experimental data | [['manipulation', 'of', 'the', 'charge', 'of', 'the', 'dielectric', 'interface', 'between', 'two', 'bulk', 'liquids', 'not', 'only', 'enables', 'the', 'adjustment', 'of', 'the', 'interfacial', 'tension', 'but', 'also', 'controls', 'the', 'storage', 'capacity', 'of', 'ions', 'in', 'the', 'ionic', 'double', 'layers', 'adjacent', 'to', 'each', 'side', 'of', 'the', 'interface', 'however', 'adjusting', 'this', 'interfacial', 'charge', 'by', 'static', 'external', 'electric', 'fields', 'is', 'difficult', 'since', 'the', 'external', 'electric', 'fields', 'are', 'readily', 'screened', 'by', 'ionic', 'double', 'layers', 'that', 'form', 'in', 'the', 'vicinity', 'of', 'the', 'external', 'electrodes', 'this', 'leaves', 'the', 'liquidliquid', 'interface', 'which', 'is', 'at', 'a', 'macroscopic', 'distance', 'from', 'the', 'electrodes', 'unaffected', 'in', 'this', 'study', 'we', 'show', 'theoretically', 'in', 'agreement', 'with', 'recent', 'experiments', 'that', 'control', 'over', 'this', 'surface', 'charge', 'at', 'the', 'liquidliquid', 'interface', 'is', 'nonetheless', 'possible', 'for', 'macroscopically', 'large', 'but', 'finite', 'closed', 'systems', 'in', 'equilibrium', 'even', 'when', 'the', 'distance', 'between', 'the', 'electrode', 'and', 'interface', 'is', 'orders', 'of', 'magnitude', 'larger', 'than', 'the', 'debye', 'screening', 'lengths', 'of', 'the', 'two', 'liquids', 'we', 'identify', 'a', 'crossover', 'systemsize', 'below', 'which', 'the', 'interface', 'and', 'the', 'electrodes', 'are', 'effectively', 'coupled', 'our', 'calculations', 'of', 'the', 'interfacial', 'tension', 'for', 'various', 'electrode', 'potentials', 'are', 'in', 'good', 'agreement', 'with', 'recent', 'experimental', 'data']] | [-0.1662899775880525, 0.19456882512699183, -0.02311588139430191, 0.012047940033247297, 0.0032579829246642883, -0.18576462263911125, 0.06513764815446868, 0.378980455841618, -0.27264718006082467, -0.3142926259243631, 0.015539821003186988, -0.30709998978542563, -0.10688752090045658, 0.16614237318228764, 0.020894349204753054, 0.011528611809716382, 0.0012370210724328174, -0.016504908440990396, -0.07603431423881427, -0.17599460481550921, 0.2959376946484063, 0.03204880633360047, 0.3233789901113075, 0.16843985445441656, 0.05442238905992924, -0.021646831297116836, 0.07085404872339679, 0.08772257831094138, -0.12635172329350242, 0.09717758522065503, 0.2671946364420916, -0.09034313223837467, 0.2066908590233979, -0.5055422527673706, -0.20538284420820602, 0.021104209909864356, 0.10572296702381474, 0.16310430877564705, -0.07255802271113301, -0.23309440243193943, 0.056207139158799324, -0.11824699391328385, -0.09259284397304644, -0.025522736162784394, 0.03235365473142082, 0.04735778899028834, -0.2467282348223491, 0.10952297272667513, 0.020005494878062288, 0.060115473601583515, -0.10173605990941438, -0.10324674005292518, -0.056949469618619616, 0.12078904475329386, 0.07166415275064077, 0.052383532878430034, 0.2115072680825598, -0.14901072630564566, -0.03724060207605362, 0.3225186108245274, -0.043599472341034166, -0.1840463169154533, 0.23917706129585883, -0.18422609119901037, -0.012666270696673166, 0.16615142727341356, 0.09742340434792587, 0.10391630725464208, -0.18292130087412373, 0.0855733253963663, -0.008056024178402142, 0.1828475858423639, 0.0975876285006512, -0.00542159405024526, 0.2694960200028975, 0.1769032444886005, 0.056870275726437235, 0.1578296257194074, -0.08786986422400629, -0.09619031472980526, -0.2901381204281463, -0.17368750120617785, -0.1888951349093087, -0.0176081917852162, -0.12167309942701701, -0.19081873494053908, 0.36857342894523915, 0.16793293964962758, 0.15819794753712885, -0.021688465314807392, 0.30794524447730837, 0.057306569609189346, 0.10571052084854815, 0.04968257380121, 0.28446540763219713, 0.12905396894405313, 0.10697067796260516, -0.2835703023795687, 0.12176202640481544, 0.003460100783935089] |
1,803.01362 | Two-Dimensional Block Trees | The Block Tree (BT) is a novel compact data structure designed to compress
sequence collections. It obtains compression ratios close to Lempel-Ziv and
supports efficient direct access to any substring. The BT divides the text
recursively into fixed-size blocks and those appearing earlier are represented
with pointers. On repetitive collections, a few blocks can represent all the
others, and thus the BT reduces the size by orders of magnitude. In this paper
we extend the BT to two dimensions, to exploit repetitiveness in collections of
images, graphs, and maps. This two-dimensional Block Tree divides the image
regularly into subimages and replaces some of them by pointers to other
occurrences thereof. We develop a specific variant aimed at compressing the
adjacency matrices of Web graphs, obtaining space reductions of up to 50\%
compared with the $k^2$-tree, which is the best alternative supporting direct
and reverse navigation in the graph.
| cs.DS | the block tree bt is a novel compact data structure designed to compress sequence collections it obtains compression ratios close to lempelziv and supports efficient direct access to any substring the bt divides the text recursively into fixedsize blocks and those appearing earlier are represented with pointers on repetitive collections a few blocks can represent all the others and thus the bt reduces the size by orders of magnitude in this paper we extend the bt to two dimensions to exploit repetitiveness in collections of images graphs and maps this twodimensional block tree divides the image regularly into subimages and replaces some of them by pointers to other occurrences thereof we develop a specific variant aimed at compressing the adjacency matrices of web graphs obtaining space reductions of up to 50 compared with the k2tree which is the best alternative supporting direct and reverse navigation in the graph | [['the', 'block', 'tree', 'bt', 'is', 'a', 'novel', 'compact', 'data', 'structure', 'designed', 'to', 'compress', 'sequence', 'collections', 'it', 'obtains', 'compression', 'ratios', 'close', 'to', 'lempelziv', 'and', 'supports', 'efficient', 'direct', 'access', 'to', 'any', 'substring', 'the', 'bt', 'divides', 'the', 'text', 'recursively', 'into', 'fixedsize', 'blocks', 'and', 'those', 'appearing', 'earlier', 'are', 'represented', 'with', 'pointers', 'on', 'repetitive', 'collections', 'a', 'few', 'blocks', 'can', 'represent', 'all', 'the', 'others', 'and', 'thus', 'the', 'bt', 'reduces', 'the', 'size', 'by', 'orders', 'of', 'magnitude', 'in', 'this', 'paper', 'we', 'extend', 'the', 'bt', 'to', 'two', 'dimensions', 'to', 'exploit', 'repetitiveness', 'in', 'collections', 'of', 'images', 'graphs', 'and', 'maps', 'this', 'twodimensional', 'block', 'tree', 'divides', 'the', 'image', 'regularly', 'into', 'subimages', 'and', 'replaces', 'some', 'of', 'them', 'by', 'pointers', 'to', 'other', 'occurrences', 'thereof', 'we', 'develop', 'a', 'specific', 'variant', 'aimed', 'at', 'compressing', 'the', 'adjacency', 'matrices', 'of', 'web', 'graphs', 'obtaining', 'space', 'reductions', 'of', 'up', 'to', '50', 'compared', 'with', 'the', 'k2tree', 'which', 'is', 'the', 'best', 'alternative', 'supporting', 'direct', 'and', 'reverse', 'navigation', 'in', 'the', 'graph']] | [-0.11759971596797728, 0.0939526991490778, -0.01721999441852441, 0.06465064200283205, -0.12247269072041318, -0.11940560982298307, 0.08177702158934914, 0.39843942937315313, -0.31119949480115966, -0.2881514287987925, 0.11309582106470181, -0.292045944917796, -0.08767635798132098, 0.15032271471352796, -0.06951839570899972, 0.03547060981509276, 0.041480868080995874, 0.04736273780282637, -0.05627610193364121, -0.27266963640864267, 0.2967577252404865, 0.015526633237715106, 0.27172722815334593, -0.06028040197388445, 0.06908568474731559, 0.03163696592673659, -0.11303302366601152, 0.012791235603799578, -0.0802992962716097, 0.1521841213107109, 0.2823425284398065, 0.18586998732408155, 0.20161500065729046, -0.4209507393046609, -0.15752380393678322, 0.10516231008364844, 0.1786953214008512, 0.10202856756026253, -0.0071934203820214985, -0.26584435910194154, 0.13989339203642984, -0.12936222064387481, -0.03519150716051258, -0.05603159983120103, 0.046401757092098705, 0.017618487250040966, -0.27270278731570263, -0.0021370476759919846, 0.08947489748557878, -0.014174428287062895, -0.0008965802246805381, -0.13154858735632277, 0.03536275635486016, 0.1516762157049458, -0.02327582676662132, 0.06708574647278953, 0.10279360941825183, -0.08478792671844163, -0.12159403370114395, 0.3720013109929356, -0.012190349337116286, -0.183672811824992, 0.21083396186775252, -0.08402999549021793, -0.16202026700311517, 0.13436779262800072, 0.14843442667011372, 0.07994729473658309, -0.12228373427461593, 0.07043063245175683, -0.042095112853457, 0.18913304258288965, 0.15358441868306114, 0.009170627529808396, 0.17930601437802654, 0.17091050883755088, 0.06836792183261227, 0.196821570399963, -0.04648870316580271, -0.050966445808110106, -0.2193004449112089, -0.1706577733165358, -0.1542548536994759, -0.01468887081766199, -0.17097771426759553, -0.17014910479554454, 0.4094397002120024, 0.14753518832347598, 0.2582156162290532, 0.11891217495045762, 0.28813502336600544, 0.03177728216207863, 0.14990500889001163, 0.09905624746131031, 0.08391897912499828, 0.09751184727379901, 0.0811831108325891, -0.11858718318084406, 0.054157441131128754, 0.13662017666344606] |
1,803.01363 | A characterization of compact locally conformally hyperk\"ahler
manifolds | We give an equivalent definition of compact locally conformally hyperk\"ahler
manifolds in terms of the existence of a nondegenerate complex two-form with
natural properties. This is a conformal analogue of Beauville's theorem stating
that a compact K\"ahler manifold admitting a holomorphic symplectic form is
hyperk\"ahler.
| math.DG | we give an equivalent definition of compact locally conformally hyperkahler manifolds in terms of the existence of a nondegenerate complex twoform with natural properties this is a conformal analogue of beauvilles theorem stating that a compact kahler manifold admitting a holomorphic symplectic form is hyperkahler | [['we', 'give', 'an', 'equivalent', 'definition', 'of', 'compact', 'locally', 'conformally', 'hyperkahler', 'manifolds', 'in', 'terms', 'of', 'the', 'existence', 'of', 'a', 'nondegenerate', 'complex', 'twoform', 'with', 'natural', 'properties', 'this', 'is', 'a', 'conformal', 'analogue', 'of', 'beauvilles', 'theorem', 'stating', 'that', 'a', 'compact', 'kahler', 'manifold', 'admitting', 'a', 'holomorphic', 'symplectic', 'form', 'is', 'hyperkahler']] | [-0.25146132364041274, 0.0466124369895422, -0.11280341798232661, 0.11703745879284623, -0.2203829477644629, -0.14861290487978193, -0.10515417634612984, 0.31887198641068404, -0.19347205013036728, -0.14203836616749566, 0.06566850093659013, -0.19266734288798437, -0.2342059236847692, 0.17207749034795497, -0.21697504005084436, -0.05126141380104754, 0.08035105483916899, 0.10825912510044873, -0.18962225052528084, -0.2766175837152534, 0.5703169196844101, -0.05054599869375428, 0.20757474928266473, 0.09357618857175112, 0.22543901856471266, -0.0525099726083378, 0.06876919509636031, -0.029400093843125634, -0.10654856931602505, 0.14786976451675096, 0.3086173200772868, 0.05039668364657296, 0.13292008590781026, -0.3430386230349541, -0.16807544377321998, 0.24288874723845058, 0.04526733214863472, -0.021465820803617437, -0.05441934525863164, -0.3336981283707751, 0.10476009574615293, -0.06599444597959518, -0.29776076349533265, -0.15644550188961956, 0.025141833619111115, -0.05152613901429706, -0.18685594017410445, 0.010724689790772067, 0.21772849696377913, 0.0844429842920767, -0.09597850466767947, 0.017923990678456094, -0.11847020002702872, -0.00897354127632247, -0.030447083970324862, 0.15630319850105379, 0.12103007747274307, -0.027853201490102543, -0.12635648631387286, 0.3683309678402212, -0.1609755074346645, -0.38074063277906844, 0.07310463661948839, -0.07371147623699573, -0.23487845305353403, 0.17681652507227327, 0.05958521862824758, 0.24414059337642458, -0.09839880007008711, 0.25477398321446443, -0.15017439611256123, 0.035401314103768934, 0.14540432637764347, 0.02868591109290719, 0.19175330810248853, 0.13542406437401142, 0.17401920151379374, 0.13450872741329173, 0.09003923113147418, -0.07892799087696606, -0.4251703416307767, -0.25694718518708315, -0.0803361926589989, 0.3683937193153219, -0.18418224126928381, -0.25387259466159673, 0.36807344284219046, -0.12915555383240443, 0.1742978049028251, 0.13948572081410224, 0.17973113434596194, 0.04575043675593204, 0.04048940646979544, 0.08018980432922641, 0.15556196824957927, 0.32413824200630187, -0.033766272056123446, -0.07610495794150564, -0.1933115634860264, 0.21506707550336918] |
1,803.01364 | SAFE: Spectral Evolution Analysis Feature Extraction for Non-Stationary
Time Series Prediction | This paper presents a practical approach for detecting non-stationarity in
time series prediction. This method is called SAFE and works by monitoring the
evolution of the spectral contents of time series through a distance function.
This method is designed to work in combination with state-of-the-art machine
learning methods in real time by informing the online predictors to perform
necessary adaptation when a non-stationarity presents. We also propose an
algorithm to proportionally include some past data in the adaption process to
overcome the Catastrophic Forgetting problem. To validate our hypothesis and
test the effectiveness of our approach, we present comprehensive experiments in
different elements of the approach involving artificial and real-world
datasets. The experiments show that the proposed method is able to
significantly save computational resources in term of processor or GPU cycles
while maintaining high prediction performances.
| cs.LG cs.AI | this paper presents a practical approach for detecting nonstationarity in time series prediction this method is called safe and works by monitoring the evolution of the spectral contents of time series through a distance function this method is designed to work in combination with stateoftheart machine learning methods in real time by informing the online predictors to perform necessary adaptation when a nonstationarity presents we also propose an algorithm to proportionally include some past data in the adaption process to overcome the catastrophic forgetting problem to validate our hypothesis and test the effectiveness of our approach we present comprehensive experiments in different elements of the approach involving artificial and realworld datasets the experiments show that the proposed method is able to significantly save computational resources in term of processor or gpu cycles while maintaining high prediction performances | [['this', 'paper', 'presents', 'a', 'practical', 'approach', 'for', 'detecting', 'nonstationarity', 'in', 'time', 'series', 'prediction', 'this', 'method', 'is', 'called', 'safe', 'and', 'works', 'by', 'monitoring', 'the', 'evolution', 'of', 'the', 'spectral', 'contents', 'of', 'time', 'series', 'through', 'a', 'distance', 'function', 'this', 'method', 'is', 'designed', 'to', 'work', 'in', 'combination', 'with', 'stateoftheart', 'machine', 'learning', 'methods', 'in', 'real', 'time', 'by', 'informing', 'the', 'online', 'predictors', 'to', 'perform', 'necessary', 'adaptation', 'when', 'a', 'nonstationarity', 'presents', 'we', 'also', 'propose', 'an', 'algorithm', 'to', 'proportionally', 'include', 'some', 'past', 'data', 'in', 'the', 'adaption', 'process', 'to', 'overcome', 'the', 'catastrophic', 'forgetting', 'problem', 'to', 'validate', 'our', 'hypothesis', 'and', 'test', 'the', 'effectiveness', 'of', 'our', 'approach', 'we', 'present', 'comprehensive', 'experiments', 'in', 'different', 'elements', 'of', 'the', 'approach', 'involving', 'artificial', 'and', 'realworld', 'datasets', 'the', 'experiments', 'show', 'that', 'the', 'proposed', 'method', 'is', 'able', 'to', 'significantly', 'save', 'computational', 'resources', 'in', 'term', 'of', 'processor', 'or', 'gpu', 'cycles', 'while', 'maintaining', 'high', 'prediction', 'performances']] | [-0.07002216499905531, -0.006670810073936174, -0.08985970882753277, 0.020930242512771206, -0.08120399117673727, -0.13297453490391808, 0.07002439829911765, 0.41360828859636384, -0.2572347132088005, -0.3623938542607166, 0.09370954606994769, -0.23719725355397175, -0.1890503779057087, 0.2113773638882205, -0.11399304404528472, 0.097798087423409, 0.13174862242184823, 0.010488475254825214, -0.04493568569972404, -0.3220012910310587, 0.2828441756576925, 0.11220270927900272, 0.3270514493631403, 0.053861235117159074, 0.09563683522066414, -0.028651641963906314, -0.07325323689117158, -0.013833202618806467, -0.060046889863657193, 0.13360004281594562, 0.29284515768887787, 0.2176659131952881, 0.38325589176022656, -0.4329467065781899, -0.23031266295371483, 0.10113350340219582, 0.13265275653327618, 0.07683344396355096, -0.058659156752124866, -0.2800244308301132, 0.09361183906592646, -0.16272494281186675, -0.07514706437550757, -0.15717957646035366, -0.008838934303825572, -0.005734958030461048, -0.30756026926198904, 0.07165773292594711, 0.0473425856427745, 0.05433062546020612, -0.04791285713495564, -0.06830634956288892, 0.11723716165122651, 0.12831932133897275, 0.08435023543879519, 0.020434261554593804, 0.10312689887359738, -0.10950287495549414, -0.17591573630398424, 0.37195649485266935, -0.0820619191015887, -0.19477482642434593, 0.19365151358401253, -0.06249272305667944, -0.15268446213096706, 0.09322749728160183, 0.2545604221250889, 0.13904622472469172, -0.1646150331040309, 0.024375695405939226, 0.02421682596505776, 0.1667804579933711, 0.00528478508910341, -0.04064217648115417, 0.11887840387567769, 0.27486271560565995, 0.036537323823881876, 0.1573967332611826, -0.10277773452800339, -0.07795170184401591, -0.24007083523515477, -0.14057077744119142, -0.19175910487104833, -0.04562625337908738, -0.08708865543877124, -0.12813726754138505, 0.4202249533476403, 0.26819198880766104, 0.18568776821867175, 0.11614214017626959, 0.3977740250160768, 0.05907858202716567, 0.09506081037875945, 0.09275773960254054, 0.15724720295801603, 0.010527522940474161, 0.13740073273427458, -0.2403363904942942, 0.08470252383309994, 0.028947445331141353] |
1,803.01365 | New Results on Multi-Step Traffic Flow Prediction | In its simplest form, the traffic flow prediction problem is restricted to
predicting a single time-step into the future. Multi-step traffic flow
prediction extends this set-up to the case where predicting multiple time-steps
into the future based on some finite history is of interest. This problem is
significantly more difficult than its single-step variant and is known to
suffer from degradation in predictions as the time step increases. In this
paper, two approaches to improve multi-step traffic flow prediction performance
in recursive and multi-output settings are introduced. In particular, a model
that allows recursive prediction approaches to take into account the temporal
context in term of time-step index when making predictions is introduced. In
addition, a conditional generative adversarial network-based data augmentation
method is proposed to improve prediction performance in the multi-output
setting. The experiments on a real-world traffic flow dataset show that the two
methods improve on multi-step traffic flow prediction in recursive and
multi-output settings, respectively.
| cs.AI cs.LG stat.ML | in its simplest form the traffic flow prediction problem is restricted to predicting a single timestep into the future multistep traffic flow prediction extends this setup to the case where predicting multiple timesteps into the future based on some finite history is of interest this problem is significantly more difficult than its singlestep variant and is known to suffer from degradation in predictions as the time step increases in this paper two approaches to improve multistep traffic flow prediction performance in recursive and multioutput settings are introduced in particular a model that allows recursive prediction approaches to take into account the temporal context in term of timestep index when making predictions is introduced in addition a conditional generative adversarial networkbased data augmentation method is proposed to improve prediction performance in the multioutput setting the experiments on a realworld traffic flow dataset show that the two methods improve on multistep traffic flow prediction in recursive and multioutput settings respectively | [['in', 'its', 'simplest', 'form', 'the', 'traffic', 'flow', 'prediction', 'problem', 'is', 'restricted', 'to', 'predicting', 'a', 'single', 'timestep', 'into', 'the', 'future', 'multistep', 'traffic', 'flow', 'prediction', 'extends', 'this', 'setup', 'to', 'the', 'case', 'where', 'predicting', 'multiple', 'timesteps', 'into', 'the', 'future', 'based', 'on', 'some', 'finite', 'history', 'is', 'of', 'interest', 'this', 'problem', 'is', 'significantly', 'more', 'difficult', 'than', 'its', 'singlestep', 'variant', 'and', 'is', 'known', 'to', 'suffer', 'from', 'degradation', 'in', 'predictions', 'as', 'the', 'time', 'step', 'increases', 'in', 'this', 'paper', 'two', 'approaches', 'to', 'improve', 'multistep', 'traffic', 'flow', 'prediction', 'performance', 'in', 'recursive', 'and', 'multioutput', 'settings', 'are', 'introduced', 'in', 'particular', 'a', 'model', 'that', 'allows', 'recursive', 'prediction', 'approaches', 'to', 'take', 'into', 'account', 'the', 'temporal', 'context', 'in', 'term', 'of', 'timestep', 'index', 'when', 'making', 'predictions', 'is', 'introduced', 'in', 'addition', 'a', 'conditional', 'generative', 'adversarial', 'networkbased', 'data', 'augmentation', 'method', 'is', 'proposed', 'to', 'improve', 'prediction', 'performance', 'in', 'the', 'multioutput', 'setting', 'the', 'experiments', 'on', 'a', 'realworld', 'traffic', 'flow', 'dataset', 'show', 'that', 'the', 'two', 'methods', 'improve', 'on', 'multistep', 'traffic', 'flow', 'prediction', 'in', 'recursive', 'and', 'multioutput', 'settings', 'respectively']] | [-0.06999509560188892, 0.02530326310226906, -0.05669179558606606, 0.06887599100179004, -0.09456651471407872, -0.18944919398761814, 0.04314981946276642, 0.3968719154879262, -0.27790699216030257, -0.2812320006822672, 0.09444368753473192, -0.25933800068917123, -0.1616715513968463, 0.2169354121035696, -0.15249322378371336, 0.1217461348020566, 0.13089053896609457, 0.04483092882039756, -0.03923674924829621, -0.2777695381141539, 0.26113515373767365, 0.05303232182005915, 0.3622997300551992, 0.046319326668789115, 0.10344131487860828, 0.01008861695999822, -0.046667870402312545, 0.015413077176796108, -0.06163818175218118, 0.11314726881741817, 0.2948437344453804, 0.14399332336527354, 0.33398598485590913, -0.44762616658795484, -0.3121969528345957, 0.11783705575205976, 0.14288706425872125, 0.10638287621019762, -0.0026344075793278098, -0.27365846559257967, 0.1111780829673126, -0.19600600108527874, -0.007336536605099711, -0.07799344468578885, -0.05773064940637331, -0.04799493006135844, -0.3382468635357822, 0.05470262937019412, 0.06508554605165898, 0.002479588548075172, -0.04099600060579155, -0.08499832731329754, 0.021089663926535582, 0.14773404481176058, 0.0866777375760441, 0.01947590135497666, 0.0991782823627626, -0.1656246322274939, -0.14471367953191924, 0.410621875779161, -0.07961365035515872, -0.24795006201425684, 0.15840751176576212, -0.06021900007006111, -0.162255608300786, 0.09634359314141772, 0.27844197962055856, 0.1296656177986319, -0.15184177088013723, -6.539657339158975e-05, -0.025998515707641084, 0.14763169232873788, 0.031694152448444236, -0.04222701058451888, 0.10337395502049535, 0.302924753983116, 0.08941458814034733, 0.13327342354327062, -0.11725703260383886, -0.16006364943341742, -0.20709655819721579, -0.11816842329859309, -0.12659299481937167, -0.03207036623837355, -0.10016664308821856, -0.11248721629145401, 0.4017137483622926, 0.23341860885354632, 0.22243879909355996, 0.1368714443384375, 0.37912416301632323, 0.09848463508710147, 0.052920588772578894, 0.07110806789744316, 0.171607163804178, 0.04888637236001182, 0.13929642218789912, -0.1931838283736754, 0.13881273316867837, 0.08330553793495733] |
1,803.01366 | Process Ordering in a Process Calculus for Spatially-Explicit Ecological
Models | In this paper we extend PALPS, a process calculus proposed for the
spatially-explicit individual-based modeling of ecological systems, with the
notion of a policy. A policy is an entity for specifying orderings between the
different activities within a system. It is defined externally to a PALPS model
as a partial order which prescribes the precedence order between the activities
of the individu- als of which the model is comprised. The motivation for
introducing policies is twofold: one the one hand, policies can help to reduce
the state-space of a model, on the other hand, they are useful for exploring
the behavior of an ecosystem under different assumptions on the ordering of
events within the system. To take account of policies, we refine the semantics
of PALPS via a transition relation which prunes away executions that do not
respect the defined policy. Furthermore, we propose a translation of PALPS into
the probabilistic model checker PRISM . We illustrate our framework by applying
PRISM on PALPS models with policies for conducting simulation and reachability
analysis.
| cs.LO cs.MA | in this paper we extend palps a process calculus proposed for the spatiallyexplicit individualbased modeling of ecological systems with the notion of a policy a policy is an entity for specifying orderings between the different activities within a system it is defined externally to a palps model as a partial order which prescribes the precedence order between the activities of the individu als of which the model is comprised the motivation for introducing policies is twofold one the one hand policies can help to reduce the statespace of a model on the other hand they are useful for exploring the behavior of an ecosystem under different assumptions on the ordering of events within the system to take account of policies we refine the semantics of palps via a transition relation which prunes away executions that do not respect the defined policy furthermore we propose a translation of palps into the probabilistic model checker prism we illustrate our framework by applying prism on palps models with policies for conducting simulation and reachability analysis | [['in', 'this', 'paper', 'we', 'extend', 'palps', 'a', 'process', 'calculus', 'proposed', 'for', 'the', 'spatiallyexplicit', 'individualbased', 'modeling', 'of', 'ecological', 'systems', 'with', 'the', 'notion', 'of', 'a', 'policy', 'a', 'policy', 'is', 'an', 'entity', 'for', 'specifying', 'orderings', 'between', 'the', 'different', 'activities', 'within', 'a', 'system', 'it', 'is', 'defined', 'externally', 'to', 'a', 'palps', 'model', 'as', 'a', 'partial', 'order', 'which', 'prescribes', 'the', 'precedence', 'order', 'between', 'the', 'activities', 'of', 'the', 'individu', 'als', 'of', 'which', 'the', 'model', 'is', 'comprised', 'the', 'motivation', 'for', 'introducing', 'policies', 'is', 'twofold', 'one', 'the', 'one', 'hand', 'policies', 'can', 'help', 'to', 'reduce', 'the', 'statespace', 'of', 'a', 'model', 'on', 'the', 'other', 'hand', 'they', 'are', 'useful', 'for', 'exploring', 'the', 'behavior', 'of', 'an', 'ecosystem', 'under', 'different', 'assumptions', 'on', 'the', 'ordering', 'of', 'events', 'within', 'the', 'system', 'to', 'take', 'account', 'of', 'policies', 'we', 'refine', 'the', 'semantics', 'of', 'palps', 'via', 'a', 'transition', 'relation', 'which', 'prunes', 'away', 'executions', 'that', 'do', 'not', 'respect', 'the', 'defined', 'policy', 'furthermore', 'we', 'propose', 'a', 'translation', 'of', 'palps', 'into', 'the', 'probabilistic', 'model', 'checker', 'prism', 'we', 'illustrate', 'our', 'framework', 'by', 'applying', 'prism', 'on', 'palps', 'models', 'with', 'policies', 'for', 'conducting', 'simulation', 'and', 'reachability', 'analysis']] | [-0.10553847358436787, 0.053471973515966664, -0.10776744293571826, 0.07854899115510408, -0.10097074350178764, -0.13459159974934676, 0.10056180797574486, 0.3705125974807126, -0.280295454084462, -0.2971373268376562, 0.10359206625426526, -0.24526924498744135, -0.14480432278710847, 0.1596176732959204, -0.07807897913885134, 0.028668462018494642, 0.027683900621561716, 0.030029301861115888, -0.036289584492768936, -0.2062444169161438, 0.34606362770894294, 0.039169241734154044, 0.2622168602323846, 0.00469561056907926, 0.1290065902993301, 0.02388214089019954, 0.012520573044751297, 0.032139209055543294, -0.11016600262204339, 0.13954755735763333, 0.25098853130316057, 0.18944492549717165, 0.3024786535802989, -0.41904851232181517, -0.20698471733352594, 0.0853546722941863, 0.09947577665412896, 0.10105230859194866, 0.009520843595794637, -0.32521376942899843, 0.09341169582075325, -0.2120367305405024, -0.06137387090694835, -0.07383848961486279, -0.04393338160630185, 0.01319047592836296, -0.30384030850462573, -0.013462854134686814, 0.12132707210114684, 0.06162596888682255, -0.08864509827887629, -0.06135651799584657, -0.038484012833333504, 0.1476267340200904, 0.036570993756394755, -0.0008886830352943892, 0.10536587823111541, -0.09776505167127658, -0.17670057664696148, 0.37616406178424594, -0.023231780067990312, -0.22793773839972525, 0.17820090049474735, -0.060362616376896876, -0.15349296528889597, 0.06479491923026175, 0.20376815900685843, 0.11511296239730559, -0.181272110869095, 0.05057217749291813, -0.057766044839170944, 0.19889403216755944, -0.0013097795039654998, -0.03471935350360752, 0.19293137619064915, 0.23906181148139008, 0.09208771663211417, 0.1560185021664321, -0.020174244802706597, -0.14253597256485154, -0.29099728784670953, -0.15021513611873427, -0.09166888592285458, -0.034403566833996015, -0.08825177493941226, -0.1481047360925089, 0.40518963503602307, 0.21145081089548112, 0.17854139572063907, 0.11108934058064367, 0.2973603917890343, 0.11860935512606098, 0.07946772123169568, 0.05754101169513462, 0.15824680344497088, 0.05502598983377262, 0.10765690576524763, -0.2002840140937931, 0.15486369928622848, 0.06560149779597745] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.