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.04767
|
SU(3) Quantum Spin Ladders as a Regularization of the CP(2) Model at
Non-Zero Density: From Classical to Quantum Simulation
|
Quantum simulations would be highly desirable in order to investigate the
finite density physics of QCD. $(1+1)$-d $\mathbb{C}P(N-1)$ quantum field
theories are toy models that share many important features of QCD: they are
asymptotically free, have a non-perturbatively generated massgap, as well as
$\theta$-vacua. $SU(N)$ quantum spin ladders provide an unconventional
regularization of $\mathbb{C}P(N-1)$ models that is well-suited for quantum
simulation with ultracold alkaline-earth atoms in an optical lattice. In order
to validate future quantum simulation experiments of $\mathbb{C}P(2)$ models at
finite density, here we use quantum Monte Carlo simulations on classical
computers to investigate $SU(3)$ quantum spin ladders at non-zero chemical
potential. This reveals a rich phase structure, with single- or double-species
Bose-Einstein "condensates", with or without ferromagnetic order.
|
hep-lat cond-mat.str-el quant-ph
|
quantum simulations would be highly desirable in order to investigate the finite density physics of qcd 11d mathbbcpn1 quantum field theories are toy models that share many important features of qcd they are asymptotically free have a nonperturbatively generated massgap as well as thetavacua sun quantum spin ladders provide an unconventional regularization of mathbbcpn1 models that is wellsuited for quantum simulation with ultracold alkalineearth atoms in an optical lattice in order to validate future quantum simulation experiments of mathbbcp2 models at finite density here we use quantum monte carlo simulations on classical computers to investigate su3 quantum spin ladders at nonzero chemical potential this reveals a rich phase structure with single or doublespecies boseeinstein condensates with or without ferromagnetic order
|
[['quantum', 'simulations', 'would', 'be', 'highly', 'desirable', 'in', 'order', 'to', 'investigate', 'the', 'finite', 'density', 'physics', 'of', 'qcd', '11d', 'mathbbcpn1', 'quantum', 'field', 'theories', 'are', 'toy', 'models', 'that', 'share', 'many', 'important', 'features', 'of', 'qcd', 'they', 'are', 'asymptotically', 'free', 'have', 'a', 'nonperturbatively', 'generated', 'massgap', 'as', 'well', 'as', 'thetavacua', 'sun', 'quantum', 'spin', 'ladders', 'provide', 'an', 'unconventional', 'regularization', 'of', 'mathbbcpn1', 'models', 'that', 'is', 'wellsuited', 'for', 'quantum', 'simulation', 'with', 'ultracold', 'alkalineearth', 'atoms', 'in', 'an', 'optical', 'lattice', 'in', 'order', 'to', 'validate', 'future', 'quantum', 'simulation', 'experiments', 'of', 'mathbbcp2', 'models', 'at', 'finite', 'density', 'here', 'we', 'use', 'quantum', 'monte', 'carlo', 'simulations', 'on', 'classical', 'computers', 'to', 'investigate', 'su3', 'quantum', 'spin', 'ladders', 'at', 'nonzero', 'chemical', 'potential', 'this', 'reveals', 'a', 'rich', 'phase', 'structure', 'with', 'single', 'or', 'doublespecies', 'boseeinstein', 'condensates', 'with', 'or', 'without', 'ferromagnetic', 'order']]
|
[-0.11921504762086298, 0.25450787538522657, -0.08103164627000067, 0.08410982945699151, -0.021658120669048875, -0.18275436518729485, -0.01969293406147103, 0.41765455716923505, -0.20570537072269857, -0.2513615087441662, 0.048245962358964216, -0.317660913270499, -0.10881411097552471, 0.16241409870631554, 0.05771221887288975, 0.12257535775982532, 0.03648285743068246, 0.014354638882742474, -0.11394684812731008, -0.2797531307667118, 0.2581496411668403, 0.044108766045992676, 0.24634507427993818, 0.05118040462267123, 0.06614193273708224, -0.021164368858126562, 0.07231891411552284, 0.0009472567447218575, -0.1535033375936308, 0.05378513956176383, 0.27858840178391, -0.0386067673783092, 0.1823115843375597, -0.48208769545459945, -0.2826890274412742, 0.10228807232616578, 0.1788554945804116, 0.21276205759338973, -0.08492453378809131, -0.2989167839586109, 0.05103073051901722, -0.21028857920005792, -0.15942198398108243, -0.19724460352728723, -0.06797281150733504, -0.035810382610202585, -0.23438554908933526, 0.04536665360709386, -0.02218979097288415, 0.10362828885666839, 0.0273432988720406, -0.09675863419244644, -0.0074441123209862394, 0.069471471072292, -0.041623405606423296, 0.04895175321559821, 0.12240714035505633, -0.1859730833401794, -0.22413074708457628, 0.4279165749727678, -0.06283262815471238, -0.17435691103401804, 0.22114496822116755, -0.13455261984260894, -0.11952134371273407, 0.07075349102188058, 0.13800247664712056, 0.10000069234363672, -0.09748771514972485, 0.14647213352390198, -0.03880513547293592, 0.18028608453949177, -0.02158335956525715, 0.07873372697983594, 0.326105615859773, 0.1474367830933643, 0.005451734883597262, 0.12835226991280382, -0.048254066495177876, -0.2398945647683151, -0.2852442152993832, -0.15706679155705733, -0.2062642970318053, 0.113129597290286, -0.1071879539028311, -0.20829997895708105, 0.3176745383945458, 0.201534449269099, 0.14189379758538068, -0.02955849559492424, 0.2644177422772686, 0.0992165107902202, 0.039715396913410236, 0.022879609505512884, 0.1750261413301302, 0.19399896272880754, 0.04699773308938416, -0.28446432635454194, -0.05572526159250185, 0.08653180859591655]
|
1,803.04768
|
Universal dynamics of zero-momentum to plane-wave transition in
spin-orbit coupled Bose-Einstein condensates
|
We investigate the universal spatiotemporal dynamics in spin-orbit coupled
Bose-Einstein condensates which are driven from the zero-momentum phase to the
plane-wave phase. The excitation spectrum reveals that, at the critical point,
the Landau critical velocity vanishes and the correlation length diverges.
Therefore, according to the Kibble-Zurek mechanism, spatial domains will
spontaneously appear in such a quench through the critical point. By simulating
the real-time dynamics, we numerically extract the static correlation length
critical exponent v and the dynamic critical exponent z from the scalings of
the temporal bifurcation delay and the spatial domain number. The numerical
scalings consist well with the analytical ones obtained by analyzing the
excitation spectrum.
|
cond-mat.quant-gas quant-ph
|
we investigate the universal spatiotemporal dynamics in spinorbit coupled boseeinstein condensates which are driven from the zeromomentum phase to the planewave phase the excitation spectrum reveals that at the critical point the landau critical velocity vanishes and the correlation length diverges therefore according to the kibblezurek mechanism spatial domains will spontaneously appear in such a quench through the critical point by simulating the realtime dynamics we numerically extract the static correlation length critical exponent v and the dynamic critical exponent z from the scalings of the temporal bifurcation delay and the spatial domain number the numerical scalings consist well with the analytical ones obtained by analyzing the excitation spectrum
|
[['we', 'investigate', 'the', 'universal', 'spatiotemporal', 'dynamics', 'in', 'spinorbit', 'coupled', 'boseeinstein', 'condensates', 'which', 'are', 'driven', 'from', 'the', 'zeromomentum', 'phase', 'to', 'the', 'planewave', 'phase', 'the', 'excitation', 'spectrum', 'reveals', 'that', 'at', 'the', 'critical', 'point', 'the', 'landau', 'critical', 'velocity', 'vanishes', 'and', 'the', 'correlation', 'length', 'diverges', 'therefore', 'according', 'to', 'the', 'kibblezurek', 'mechanism', 'spatial', 'domains', 'will', 'spontaneously', 'appear', 'in', 'such', 'a', 'quench', 'through', 'the', 'critical', 'point', 'by', 'simulating', 'the', 'realtime', 'dynamics', 'we', 'numerically', 'extract', 'the', 'static', 'correlation', 'length', 'critical', 'exponent', 'v', 'and', 'the', 'dynamic', 'critical', 'exponent', 'z', 'from', 'the', 'scalings', 'of', 'the', 'temporal', 'bifurcation', 'delay', 'and', 'the', 'spatial', 'domain', 'number', 'the', 'numerical', 'scalings', 'consist', 'well', 'with', 'the', 'analytical', 'ones', 'obtained', 'by', 'analyzing', 'the', 'excitation', 'spectrum']]
|
[-0.20783412832459178, 0.199118334731651, -0.10036282721103741, 0.07949755506145709, 0.006701628108286735, -0.1388866344868385, 0.060513592790812254, 0.32689864196122514, -0.28360779081052595, -0.22557123080579514, 0.05330155549545285, -0.29843903867818344, -0.14667297531466145, 0.15468423328268419, 0.08949276135482509, 0.11182802335098557, -0.05270347630374407, 0.027793505861329924, -0.05785792114836839, -0.14234816122355812, 0.3672991736723674, 0.03106792621878446, 0.34884417937094464, 0.045202000545115646, 0.030055520368244396, 0.00990405828273351, 0.009700587339733445, 6.811177178335146e-05, -0.1859433291741746, -0.016295088540523424, 0.19551164174982166, 0.004882770104530276, 0.21224184603849, -0.40037431537148055, -0.23784982195175294, 0.06303078347150612, 0.21888606974837976, 0.1343507519271652, -0.0038731839014388143, -0.30844817079022663, 0.03782457773736037, -0.1026008722792623, -0.19068763950207365, -0.07031496652880462, 0.02309706069341083, 0.05582462487861924, -0.25014382147084957, 0.1441320195247274, 0.009531000185834774, 0.08036799523167722, -0.06419922357185855, -0.03145407375648891, -0.06017817218292402, 0.13151297003987733, 0.045580615178434127, 0.04640699146366721, 0.15813953209446246, -0.15411295399172317, -0.0671513972690739, 0.35279613020701694, -0.044942018795980636, -0.14973587933885052, 0.18523391301171221, -0.1956415608132241, -0.050516388257281906, 0.17981886557397356, 0.12186715119398721, 0.06483113101935613, -0.09718788790285861, 0.05811149601137304, 0.0310034391453165, 0.19816167251508118, 0.0556348639181516, 0.03931975513782113, 0.24692016192327398, 0.16024071766798376, 0.009976095451605976, 0.14920779462015138, -0.11326331243670862, -0.17968329245122064, -0.2975979959378617, -0.05483517481800203, -0.19732418389768774, 0.039035822166591336, -0.1456404280280876, -0.1471980649437499, 0.4201848732153757, 0.17315578311169094, 0.22041963356965727, 0.048753902131324175, 0.2513051879241926, 0.2097214937739826, 0.0376871604164806, 0.07930096040838697, 0.22724345753635836, 0.08331924641222924, 0.1658454571889047, -0.32748123673175317, -0.0037888682691952845, 0.09960869321206567]
|
1,803.04769
|
Coronal Magnetic Structure of Earthbound CMEs and In situ Comparison
|
Predicting the magnetic field within an Earth-directed coronal mass ejection
(CME) well before its arrival at Earth is one of the most important issues in
space weather research. In this article, we compare the intrinsic flux rope
type, i.e. the CME orientation and handedness during eruption, with the in situ
flux rope type for 20 CME events that have been uniquely linked from Sun to
Earth through heliospheric imaging. Our study shows that the intrinsic flux
rope type can be estimated for CMEs originating from different source regions
using a combination of indirect proxies. We find that only 20% of the events
studied match strictly between the intrinsic and in situ flux rope types. The
percentage rises to 55% when intermediate cases (where the orientation at the
Sun and/or in situ is close to 45{\deg}) are considered as a match. We also
determine the change in the flux rope tilt angle between the Sun and Earth. For
the majority of the cases, the rotation is several tens of degrees, whilst 35%
of the events change by more than 90{\deg}. While occasionally the intrinsic
flux rope type is a good proxy for the magnetic structure impacting Earth, our
study highlights the importance of capturing the CME evolution for space
weather forecasting purposes. Moreover, we emphasize that determination of the
intrinsic flux rope type is a crucial input for CME forecasting models.
|
astro-ph.SR
|
predicting the magnetic field within an earthdirected coronal mass ejection cme well before its arrival at earth is one of the most important issues in space weather research in this article we compare the intrinsic flux rope type ie the cme orientation and handedness during eruption with the in situ flux rope type for 20 cme events that have been uniquely linked from sun to earth through heliospheric imaging our study shows that the intrinsic flux rope type can be estimated for cmes originating from different source regions using a combination of indirect proxies we find that only 20 of the events studied match strictly between the intrinsic and in situ flux rope types the percentage rises to 55 when intermediate cases where the orientation at the sun andor in situ is close to 45deg are considered as a match we also determine the change in the flux rope tilt angle between the sun and earth for the majority of the cases the rotation is several tens of degrees whilst 35 of the events change by more than 90deg while occasionally the intrinsic flux rope type is a good proxy for the magnetic structure impacting earth our study highlights the importance of capturing the cme evolution for space weather forecasting purposes moreover we emphasize that determination of the intrinsic flux rope type is a crucial input for cme forecasting models
|
[['predicting', 'the', 'magnetic', 'field', 'within', 'an', 'earthdirected', 'coronal', 'mass', 'ejection', 'cme', 'well', 'before', 'its', 'arrival', 'at', 'earth', 'is', 'one', 'of', 'the', 'most', 'important', 'issues', 'in', 'space', 'weather', 'research', 'in', 'this', 'article', 'we', 'compare', 'the', 'intrinsic', 'flux', 'rope', 'type', 'ie', 'the', 'cme', 'orientation', 'and', 'handedness', 'during', 'eruption', 'with', 'the', 'in', 'situ', 'flux', 'rope', 'type', 'for', '20', 'cme', 'events', 'that', 'have', 'been', 'uniquely', 'linked', 'from', 'sun', 'to', 'earth', 'through', 'heliospheric', 'imaging', 'our', 'study', 'shows', 'that', 'the', 'intrinsic', 'flux', 'rope', 'type', 'can', 'be', 'estimated', 'for', 'cmes', 'originating', 'from', 'different', 'source', 'regions', 'using', 'a', 'combination', 'of', 'indirect', 'proxies', 'we', 'find', 'that', 'only', '20', 'of', 'the', 'events', 'studied', 'match', 'strictly', 'between', 'the', 'intrinsic', 'and', 'in', 'situ', 'flux', 'rope', 'types', 'the', 'percentage', 'rises', 'to', '55', 'when', 'intermediate', 'cases', 'where', 'the', 'orientation', 'at', 'the', 'sun', 'andor', 'in', 'situ', 'is', 'close', 'to', '45deg', 'are', 'considered', 'as', 'a', 'match', 'we', 'also', 'determine', 'the', 'change', 'in', 'the', 'flux', 'rope', 'tilt', 'angle', 'between', 'the', 'sun', 'and', 'earth', 'for', 'the', 'majority', 'of', 'the', 'cases', 'the', 'rotation', 'is', 'several', 'tens', 'of', 'degrees', 'whilst', '35', 'of', 'the', 'events', 'change', 'by', 'more', 'than', '90deg', 'while', 'occasionally', 'the', 'intrinsic', 'flux', 'rope', 'type', 'is', 'a', 'good', 'proxy', 'for', 'the', 'magnetic', 'structure', 'impacting', 'earth', 'our', 'study', 'highlights', 'the', 'importance', 'of', 'capturing', 'the', 'cme', 'evolution', 'for', 'space', 'weather', 'forecasting', 'purposes', 'moreover', 'we', 'emphasize', 'that', 'determination', 'of', 'the', 'intrinsic', 'flux', 'rope', 'type', 'is', 'a', 'crucial', 'input', 'for', 'cme', 'forecasting', 'models']]
|
[-0.08860025037176218, 0.18244427199653887, 0.02156382183722757, 0.14484371598405035, -0.06443405979839356, -0.035218899916736005, 0.030407500543958084, 0.43062802583951015, -0.20266326458507178, -0.4156332829805172, 0.10162333725526443, -0.2532631513500667, -0.10343163103351126, 0.21038364906233492, -0.056212761815455134, -0.025380031335035986, 0.11130351607647279, 0.0231310529988664, -0.09055953499172693, -0.17220512648902672, 0.260639577259755, 0.11399617108273441, 0.2501612233615521, 0.019816987556607827, 0.09143557196391909, -0.05685278032298969, -0.031358753750100735, -0.004181688251723561, -0.08071664103127145, 0.04292700283290089, 0.15329757355042523, 0.08915692669865878, 0.20836590211534792, -0.44492146710905695, -0.24666386232711374, 0.030865821031772572, 0.1608345893515355, 0.01904822818570487, -0.014653493180863418, -0.2552995583690379, 0.06699461788040302, -0.13485746213903083, -0.1469327991484138, 0.04788130158963411, 0.06412077425579217, 0.006040986573434961, -0.263892991747201, 0.09848560946272261, -0.0012854528021188857, 0.1125826797215268, -0.11047175037548067, -0.06490301161867809, -0.08517760543415889, 0.16295160787628013, 0.15335400702087615, 0.10669196447883936, 0.20816400554031134, -0.13368222071161576, -0.0813267705830462, 0.3682434294534766, -0.003756447963773415, -0.09744316925416174, 0.16424705674264417, -0.21414493628291656, -0.14636427846428926, 0.17427954411174615, 0.13427452826467545, 0.0681887554227496, -0.1262204985008398, -0.03688047210275924, -0.038087658882748496, 0.13059276842168005, 0.05717777124221396, -0.02694729516768585, 0.30775008152603456, 0.13589619440532735, 0.07531117204090823, 0.09869883381103611, -0.2280637955515767, -0.05166953949108416, -0.27947705951721774, -0.1612658463343826, -0.10830125839996112, 0.039639620090146425, -0.1051737011853813, -0.17752799819142598, 0.43128259365811294, 0.19037048806152915, 0.20704487889154774, -0.05795615809038281, 0.2688095713601164, 0.06532583649766267, 0.053005076657332804, 0.12473934720189352, 0.32054565824851716, 0.13824912281099544, 0.16873160486777677, -0.2184093375052528, 0.130645579840664, 0.07228913424921263]
|
1,803.0477
|
Spatial Distribution of Globular Clusters in the Galaxy
|
The Milky Way's satellite galaxies and Globular Clusters (GCs) are known to
exhibit an anisotropic spatial distribution. We examine in detail this
anisotropy by the means of the inertia tensor. We estimate the statistical
significance of the results by repeating this analysis for random catalogues
which use the radial distribution of the real sample. Our method reproduces the
well-known planar structure in the distribution of the satellite galaxies. We
show that for GCs several anisotropic structures are observed. The GCs at small
distances, $2<R<10$ kpc, show a structure coplanar with the Galactic plane. At
smaller and larger distances the whole sample of GCs shows quite weak
anisotropy. Nevertheless, at largest distances the orientation of the structure
is close to that of the satellite galaxies, i.e. perpendicular to the Galactic
plane. We estimate the probability of random realization for this structure of
1.7%. The Bulge-Disk GCs show a clear disk-like structure lying within the
galactic disk. The Old Halo GCs show two structures: a well pronounced polar
elongated structure at $R<3$ kpc which is perpendicular to the galactic plane,
and a less pronounced disk-like structure coplanar with the galactic disk at
$6<R<20$ kpc. The Young Halo GCs do not show significant anisotropy.
|
astro-ph.GA
|
the milky ways satellite galaxies and globular clusters gcs are known to exhibit an anisotropic spatial distribution we examine in detail this anisotropy by the means of the inertia tensor we estimate the statistical significance of the results by repeating this analysis for random catalogues which use the radial distribution of the real sample our method reproduces the wellknown planar structure in the distribution of the satellite galaxies we show that for gcs several anisotropic structures are observed the gcs at small distances 2r10 kpc show a structure coplanar with the galactic plane at smaller and larger distances the whole sample of gcs shows quite weak anisotropy nevertheless at largest distances the orientation of the structure is close to that of the satellite galaxies ie perpendicular to the galactic plane we estimate the probability of random realization for this structure of 17 the bulgedisk gcs show a clear disklike structure lying within the galactic disk the old halo gcs show two structures a well pronounced polar elongated structure at r3 kpc which is perpendicular to the galactic plane and a less pronounced disklike structure coplanar with the galactic disk at 6r20 kpc the young halo gcs do not show significant anisotropy
|
[['the', 'milky', 'ways', 'satellite', 'galaxies', 'and', 'globular', 'clusters', 'gcs', 'are', 'known', 'to', 'exhibit', 'an', 'anisotropic', 'spatial', 'distribution', 'we', 'examine', 'in', 'detail', 'this', 'anisotropy', 'by', 'the', 'means', 'of', 'the', 'inertia', 'tensor', 'we', 'estimate', 'the', 'statistical', 'significance', 'of', 'the', 'results', 'by', 'repeating', 'this', 'analysis', 'for', 'random', 'catalogues', 'which', 'use', 'the', 'radial', 'distribution', 'of', 'the', 'real', 'sample', 'our', 'method', 'reproduces', 'the', 'wellknown', 'planar', 'structure', 'in', 'the', 'distribution', 'of', 'the', 'satellite', 'galaxies', 'we', 'show', 'that', 'for', 'gcs', 'several', 'anisotropic', 'structures', 'are', 'observed', 'the', 'gcs', 'at', 'small', 'distances', '2r10', 'kpc', 'show', 'a', 'structure', 'coplanar', 'with', 'the', 'galactic', 'plane', 'at', 'smaller', 'and', 'larger', 'distances', 'the', 'whole', 'sample', 'of', 'gcs', 'shows', 'quite', 'weak', 'anisotropy', 'nevertheless', 'at', 'largest', 'distances', 'the', 'orientation', 'of', 'the', 'structure', 'is', 'close', 'to', 'that', 'of', 'the', 'satellite', 'galaxies', 'ie', 'perpendicular', 'to', 'the', 'galactic', 'plane', 'we', 'estimate', 'the', 'probability', 'of', 'random', 'realization', 'for', 'this', 'structure', 'of', '17', 'the', 'bulgedisk', 'gcs', 'show', 'a', 'clear', 'disklike', 'structure', 'lying', 'within', 'the', 'galactic', 'disk', 'the', 'old', 'halo', 'gcs', 'show', 'two', 'structures', 'a', 'well', 'pronounced', 'polar', 'elongated', 'structure', 'at', 'r3', 'kpc', 'which', 'is', 'perpendicular', 'to', 'the', 'galactic', 'plane', 'and', 'a', 'less', 'pronounced', 'disklike', 'structure', 'coplanar', 'with', 'the', 'galactic', 'disk', 'at', '6r20', 'kpc', 'the', 'young', 'halo', 'gcs', 'do', 'not', 'show', 'significant', 'anisotropy']]
|
[-0.11125239741069443, 0.07788632229860022, -0.0767968743138633, 0.12879898295861825, -0.1153092270789565, 0.01888387423972763, -0.012125820616475451, 0.4486796528325608, -0.2105308164754384, -0.3370535208998089, -0.03757455480406669, -0.28383559483775034, -0.07293550873084004, 0.19513778594011283, 0.018744597346615516, -0.04435375124681448, 0.05781143241510469, -0.05617170438086193, -0.058257494035209696, -0.27518192292237886, 0.3104812660764659, 0.05101963694689412, 0.20593450378963546, -0.0883088931043506, 0.06543974140331374, -0.0651266606636907, -0.004215937419022298, 0.027668406779704682, -0.16774712517266993, 0.07218721360067636, 0.20247177431130567, 0.0547837330134885, 0.18898625600142357, -0.34847027565030575, -0.1801713018077917, 0.05248386405517193, 0.2244094921072393, 0.09318566664786607, -0.07992963458355236, -0.2757575958265207, 0.11166146225366161, -0.12248368472230607, -0.26648983189920383, 0.06491052150847999, 0.04238861847561246, 0.036548256555843595, -0.16499081609072164, 0.17653155422198524, 0.08373564460967672, 0.11100291524400663, -0.07446711969763116, -0.12740574221140774, -0.07282664086529284, 0.06035182984480307, 0.016331339856356982, 0.07747309691689197, 0.1885331130057723, -0.07458639389779138, -0.01741562984724665, 0.4212474653300778, -0.010825690419071509, -0.05565306435259593, 0.18740186862525854, -0.2581727432985626, -0.1816218308823642, 0.08498150212737034, 0.1786703498257165, 0.08387659107283432, -0.1457058185376297, 0.07312842189064062, -0.07913331612336201, 0.20886907484569592, 0.06939469963129628, 0.010098458286468407, 0.2985798551527849, 0.07875974668217964, 0.12306674073412827, 0.10994428475083194, -0.2353615365915431, -0.0790660426976515, -0.2074778694794022, -0.07359469924051895, -0.1548286038211046, 0.04872416702969919, -0.2058293100148258, -0.17125805073895084, 0.3480794757028957, 0.08423412462752593, 0.27285436085155046, 0.044741628270352905, 0.3206071839410456, 0.026428424544403115, 0.1439726209951256, 0.15761283396663678, 0.2972350284064086, 0.18173508374628858, 0.029846332375259705, -0.23288747859327824, 0.08359066599069734, -0.053353713549224274]
|
1,803.04771
|
Optical and Electronic Properties of Doped $p$-type CuI: Explanation of
Transparent Conductivity from First Principles
|
We report properties of the reported transparent conductor CuI, including the
effect of heavy $p$-type doping. The results, based on first principles
calculations, include analysis of the electronic structure and calculations of
optical and dielectric properties. We find that the origin of the favorable
transparent conducting behavior lies in the absence in the visible of strong
interband transitions between deeper valence bands and states at the valence
band maximum that become empty with $p$-type doping. Instead, strong interband
transitions to the valence band maximum are concentrated in the infrared with
energies below 1.3 eV. This is contrast to the valence bands of many wide band
gap materials. Turning to the mobility we find that the states at the valence
band maximum are relatively dispersive. This originates from their antibonding
Cu $d$ - I $p$ character. We find a modest enhancement of the Born effective
charges relative to nominal values, leading to a dielectric constant
$\varepsilon(0)$=6.3. This is sufficiently large to reduce ionized impurity
scattering, leading to the expectation that the properties of CuI can be still
can be significantly improved through sample quality.
|
cond-mat.mtrl-sci
|
we report properties of the reported transparent conductor cui including the effect of heavy ptype doping the results based on first principles calculations include analysis of the electronic structure and calculations of optical and dielectric properties we find that the origin of the favorable transparent conducting behavior lies in the absence in the visible of strong interband transitions between deeper valence bands and states at the valence band maximum that become empty with ptype doping instead strong interband transitions to the valence band maximum are concentrated in the infrared with energies below 13 ev this is contrast to the valence bands of many wide band gap materials turning to the mobility we find that the states at the valence band maximum are relatively dispersive this originates from their antibonding cu d i p character we find a modest enhancement of the born effective charges relative to nominal values leading to a dielectric constant varepsilon063 this is sufficiently large to reduce ionized impurity scattering leading to the expectation that the properties of cui can be still can be significantly improved through sample quality
|
[['we', 'report', 'properties', 'of', 'the', 'reported', 'transparent', 'conductor', 'cui', 'including', 'the', 'effect', 'of', 'heavy', 'ptype', 'doping', 'the', 'results', 'based', 'on', 'first', 'principles', 'calculations', 'include', 'analysis', 'of', 'the', 'electronic', 'structure', 'and', 'calculations', 'of', 'optical', 'and', 'dielectric', 'properties', 'we', 'find', 'that', 'the', 'origin', 'of', 'the', 'favorable', 'transparent', 'conducting', 'behavior', 'lies', 'in', 'the', 'absence', 'in', 'the', 'visible', 'of', 'strong', 'interband', 'transitions', 'between', 'deeper', 'valence', 'bands', 'and', 'states', 'at', 'the', 'valence', 'band', 'maximum', 'that', 'become', 'empty', 'with', 'ptype', 'doping', 'instead', 'strong', 'interband', 'transitions', 'to', 'the', 'valence', 'band', 'maximum', 'are', 'concentrated', 'in', 'the', 'infrared', 'with', 'energies', 'below', '13', 'ev', 'this', 'is', 'contrast', 'to', 'the', 'valence', 'bands', 'of', 'many', 'wide', 'band', 'gap', 'materials', 'turning', 'to', 'the', 'mobility', 'we', 'find', 'that', 'the', 'states', 'at', 'the', 'valence', 'band', 'maximum', 'are', 'relatively', 'dispersive', 'this', 'originates', 'from', 'their', 'antibonding', 'cu', 'd', 'i', 'p', 'character', 'we', 'find', 'a', 'modest', 'enhancement', 'of', 'the', 'born', 'effective', 'charges', 'relative', 'to', 'nominal', 'values', 'leading', 'to', 'a', 'dielectric', 'constant', 'varepsilon063', 'this', 'is', 'sufficiently', 'large', 'to', 'reduce', 'ionized', 'impurity', 'scattering', 'leading', 'to', 'the', 'expectation', 'that', 'the', 'properties', 'of', 'cui', 'can', 'be', 'still', 'can', 'be', 'significantly', 'improved', 'through', 'sample', 'quality']]
|
[-0.1169156563823312, 0.17239129701462055, -0.029361000957317362, 0.03854600661395643, -0.03805540525740352, -0.11699636446733995, 0.1548884930243479, 0.4233204221033918, -0.2488094970811601, -0.3205518613708365, -0.011925186341221944, -0.35054616187570503, -0.09748144566662897, 0.11741430752715147, 0.022416443270708315, -0.02234161222533346, 0.02469245803372636, -0.06642817041080301, -0.12785684968247105, -0.1653772862878942, 0.2915072128683514, 0.06501280850581619, 0.294210621294725, 0.16124155105076196, -0.03454290132311003, 0.013727566813895715, 0.09403633141056608, 0.013608032446457537, -0.10391362214500204, 0.12417385890502328, 0.27638780599130697, -0.07208594876645102, 0.22773037135963797, -0.4187679742615286, -0.19107535107380283, 0.004831883387424011, 0.0918103675338702, 0.12253014940655281, -0.04130714824899146, -0.2473650579012735, 0.08490132210127886, -0.12215194831736056, -0.1415928235452478, -0.04912429324927539, 0.009209912963332454, -0.031207097520619547, -0.23737178419398927, 0.09104523667438567, 0.030752294122066814, 0.03411863687152663, -0.11029241998160248, -0.19163601222391452, -0.1021891805261003, 0.09584421672516127, 0.06302659224476974, -0.0020204769426220978, 0.14407977119129337, -0.11728088851781428, -0.07054145485471461, 0.3889110642382412, -0.06721531998466454, -0.06202822926940489, 0.2067211293731173, -0.21706830482230166, -0.06338366221389553, 0.22483945064997887, 0.1295042866712323, 0.10601445600501061, -0.10593885815611047, 0.09030768716899493, -0.00902514174987063, 0.19152608839087498, 0.05646272310446845, 0.12339981464612508, 0.23195187727411315, 0.14873023485013628, 0.031405115556370634, 0.1065379394918104, -0.14481203748718502, -0.01514808919013205, -0.2480031431465119, -0.1387858184270602, -0.21072814326208517, 0.06250431547674623, -0.07283861807507955, -0.19411199293433798, 0.40339588162422346, 0.12516521039105005, 0.18749744102399982, -0.025689693184528316, 0.21963788222171654, 0.14803173161466807, 0.0736618024658525, 0.07944071750820342, 0.3318964642554892, 0.11933007687896244, 0.08098087741772114, -0.2654426701209966, 0.06122378631397176, -0.013370098764828062]
|
1,803.04772
|
Studying fundamental physics using quantum enabled technologies with
trapped molecular ions
|
The text below was written during two visits that Daniel Segal made at
Universit{\'e} Paris 13. Danny stayed at Laboratoire de Physique des Lasers the
summers of 2008 and 2009 to participate in the exploration of a novel lead in
the field of ultra-high resolution spectroscopy. Our idea was to probe trapped
molecular ions using Quantum Logic Spectroscopy (QLS) in order to advance our
understanding of a variety of fundamental processes in nature. At that time,
QLS, a ground-breaking spectroscopic technique, had only been demonstrated with
atomic ions. Our ultimategoals were new approaches to the observation of parity
violation in chiral molecules and tests of time variations of the fundamental
constants. This text is the original research proposal written eight years ago.
We have added a series of notes to revisit it in the light of what has been
since realized in the field.
|
physics.atom-ph
|
the text below was written during two visits that daniel segal made at universite paris 13 danny stayed at laboratoire de physique des lasers the summers of 2008 and 2009 to participate in the exploration of a novel lead in the field of ultrahigh resolution spectroscopy our idea was to probe trapped molecular ions using quantum logic spectroscopy qls in order to advance our understanding of a variety of fundamental processes in nature at that time qls a groundbreaking spectroscopic technique had only been demonstrated with atomic ions our ultimategoals were new approaches to the observation of parity violation in chiral molecules and tests of time variations of the fundamental constants this text is the original research proposal written eight years ago we have added a series of notes to revisit it in the light of what has been since realized in the field
|
[['the', 'text', 'below', 'was', 'written', 'during', 'two', 'visits', 'that', 'daniel', 'segal', 'made', 'at', 'universite', 'paris', '13', 'danny', 'stayed', 'at', 'laboratoire', 'de', 'physique', 'des', 'lasers', 'the', 'summers', 'of', '2008', 'and', '2009', 'to', 'participate', 'in', 'the', 'exploration', 'of', 'a', 'novel', 'lead', 'in', 'the', 'field', 'of', 'ultrahigh', 'resolution', 'spectroscopy', 'our', 'idea', 'was', 'to', 'probe', 'trapped', 'molecular', 'ions', 'using', 'quantum', 'logic', 'spectroscopy', 'qls', 'in', 'order', 'to', 'advance', 'our', 'understanding', 'of', 'a', 'variety', 'of', 'fundamental', 'processes', 'in', 'nature', 'at', 'that', 'time', 'qls', 'a', 'groundbreaking', 'spectroscopic', 'technique', 'had', 'only', 'been', 'demonstrated', 'with', 'atomic', 'ions', 'our', 'ultimategoals', 'were', 'new', 'approaches', 'to', 'the', 'observation', 'of', 'parity', 'violation', 'in', 'chiral', 'molecules', 'and', 'tests', 'of', 'time', 'variations', 'of', 'the', 'fundamental', 'constants', 'this', 'text', 'is', 'the', 'original', 'research', 'proposal', 'written', 'eight', 'years', 'ago', 'we', 'have', 'added', 'a', 'series', 'of', 'notes', 'to', 'revisit', 'it', 'in', 'the', 'light', 'of', 'what', 'has', 'been', 'since', 'realized', 'in', 'the', 'field']]
|
[-0.09293293222537512, 0.13197108720579034, -0.11293297122766661, 0.0018363225866447795, -0.04960402014658793, -0.1167962497842687, 0.03402779119698188, 0.3502012509201373, -0.1941864535251593, -0.3669901749288494, 0.07975604738779626, -0.2833602791814902, -0.08474342480718673, 0.19547047221160435, -0.06884956834723821, 0.034371585142310264, 0.03148069838957431, -0.025039883454206522, -0.010304076084622893, -0.3188788100582111, 0.22545569201433133, 0.10155310609680764, 0.2701742302079301, 0.06124377372296905, 0.12286321614002743, -0.00523658214345366, -0.042211798656328056, -0.054669925301511595, -0.1262412044042404, 0.11121618608338432, 0.28961193038092053, 0.09994542085601446, 0.28310739316723565, -0.4448409579642169, -0.19993061226323716, 0.030195645160868867, 0.09761387131329939, 0.11365291193922188, -0.03612039427084106, -0.3136247433884838, 0.04010543262771611, -0.12933409173640756, -0.11750836298520957, -0.04635924591529802, 0.05334814486315252, -0.021427111750650967, -0.18228212401707017, 0.015374480062848205, 0.027042983438480984, 0.12392442274213462, -0.030196675617195717, -0.11844953864005271, 0.045652383627448154, 0.10098818513903428, 0.021801274013379914, 0.08771755164684532, 0.08735171754655617, -0.07759382309541887, -0.16202911242054632, 0.3550180384329149, -0.08038710104863805, -0.03948874893057701, 0.1869151753705594, -0.16848160524468322, -0.2007681806767164, 0.13286111317574978, 0.1396287481652221, 0.12138766900252004, -0.1303885981466595, 0.11507848806767171, -0.02030698572730375, 0.18188032557311878, 0.16153664858295366, 0.028631102528188613, 0.21140975693006303, 0.1641661594796867, -0.033345638030254234, 0.05389208620629059, -0.09751814873107559, -0.06377719840282327, -0.23721502215594992, -0.2082765373988305, -0.18080897407339222, 0.0635578444234089, 0.04779488619736891, -0.08693342553321402, 0.3942355596056612, 0.13320403383927537, 0.13369121101124773, -0.06637168462531498, 0.23295251628501223, 0.0395064913672623, 0.08904077994296901, 0.013372365893288092, 0.29158012565043007, 0.12286048813827231, 0.19172944517202115, -0.1788491541650016, 0.029574179850922495, 0.059348647135075414]
|
1,803.04773
|
A case for multiple and parallel RRAMs as synaptic model for training
SNNs
|
To enable a dense integration of model synapses in a spiking neural networks
hardware, various nano-scale devices are being considered. Such a device,
besides exhibiting spike-time dependent plasticity (STDP), needs to be highly
scalable, have a large endurance and require low energy for transitioning
between states. In this work, we first introduce and empirically determine two
new specifications for an synapse in SNNs: number of conductance levels per
synapse and maximum learning-rate. To the best of our knowledge, there are no
RRAMs that meet the latter specification. As a solution, we propose the use of
multiple PCMO-RRAMs in parallel within a synapse. While synaptic reading, all
PCMO-RRAMs are simultaneously read and for each synaptic conductance-change
event, the mechanism for conductance STDP is initiated for only one RRAM,
randomly picked from the set. Second, to validate our solution, we
experimentally demonstrate STDP of conductance of a PCMO-RRAM and then show
that due to a large learning-rate, a single PCMO-RRAM fails to model a synapse
in the training of an SNN. As anticipated, network training improves as more
PCMO-RRAMs are added to the synapse. Fourth, we discuss the
circuit-requirements for implementing such a scheme, to conclude that the
requirements are within bounds. Thus, our work presents specifications for
synaptic devices in trainable SNNs, indicates the shortcomings of state-of-art
synaptic contenders, and provides a solution to extrinsically meet the
specifications and discusses the peripheral circuitry that implements the
solution.
|
cs.ET cs.NE
|
to enable a dense integration of model synapses in a spiking neural networks hardware various nanoscale devices are being considered such a device besides exhibiting spiketime dependent plasticity stdp needs to be highly scalable have a large endurance and require low energy for transitioning between states in this work we first introduce and empirically determine two new specifications for an synapse in snns number of conductance levels per synapse and maximum learningrate to the best of our knowledge there are no rrams that meet the latter specification as a solution we propose the use of multiple pcmorrams in parallel within a synapse while synaptic reading all pcmorrams are simultaneously read and for each synaptic conductancechange event the mechanism for conductance stdp is initiated for only one rram randomly picked from the set second to validate our solution we experimentally demonstrate stdp of conductance of a pcmorram and then show that due to a large learningrate a single pcmorram fails to model a synapse in the training of an snn as anticipated network training improves as more pcmorrams are added to the synapse fourth we discuss the circuitrequirements for implementing such a scheme to conclude that the requirements are within bounds thus our work presents specifications for synaptic devices in trainable snns indicates the shortcomings of stateofart synaptic contenders and provides a solution to extrinsically meet the specifications and discusses the peripheral circuitry that implements the solution
|
[['to', 'enable', 'a', 'dense', 'integration', 'of', 'model', 'synapses', 'in', 'a', 'spiking', 'neural', 'networks', 'hardware', 'various', 'nanoscale', 'devices', 'are', 'being', 'considered', 'such', 'a', 'device', 'besides', 'exhibiting', 'spiketime', 'dependent', 'plasticity', 'stdp', 'needs', 'to', 'be', 'highly', 'scalable', 'have', 'a', 'large', 'endurance', 'and', 'require', 'low', 'energy', 'for', 'transitioning', 'between', 'states', 'in', 'this', 'work', 'we', 'first', 'introduce', 'and', 'empirically', 'determine', 'two', 'new', 'specifications', 'for', 'an', 'synapse', 'in', 'snns', 'number', 'of', 'conductance', 'levels', 'per', 'synapse', 'and', 'maximum', 'learningrate', 'to', 'the', 'best', 'of', 'our', 'knowledge', 'there', 'are', 'no', 'rrams', 'that', 'meet', 'the', 'latter', 'specification', 'as', 'a', 'solution', 'we', 'propose', 'the', 'use', 'of', 'multiple', 'pcmorrams', 'in', 'parallel', 'within', 'a', 'synapse', 'while', 'synaptic', 'reading', 'all', 'pcmorrams', 'are', 'simultaneously', 'read', 'and', 'for', 'each', 'synaptic', 'conductancechange', 'event', 'the', 'mechanism', 'for', 'conductance', 'stdp', 'is', 'initiated', 'for', 'only', 'one', 'rram', 'randomly', 'picked', 'from', 'the', 'set', 'second', 'to', 'validate', 'our', 'solution', 'we', 'experimentally', 'demonstrate', 'stdp', 'of', 'conductance', 'of', 'a', 'pcmorram', 'and', 'then', 'show', 'that', 'due', 'to', 'a', 'large', 'learningrate', 'a', 'single', 'pcmorram', 'fails', 'to', 'model', 'a', 'synapse', 'in', 'the', 'training', 'of', 'an', 'snn', 'as', 'anticipated', 'network', 'training', 'improves', 'as', 'more', 'pcmorrams', 'are', 'added', 'to', 'the', 'synapse', 'fourth', 'we', 'discuss', 'the', 'circuitrequirements', 'for', 'implementing', 'such', 'a', 'scheme', 'to', 'conclude', 'that', 'the', 'requirements', 'are', 'within', 'bounds', 'thus', 'our', 'work', 'presents', 'specifications', 'for', 'synaptic', 'devices', 'in', 'trainable', 'snns', 'indicates', 'the', 'shortcomings', 'of', 'stateofart', 'synaptic', 'contenders', 'and', 'provides', 'a', 'solution', 'to', 'extrinsically', 'meet', 'the', 'specifications', 'and', 'discusses', 'the', 'peripheral', 'circuitry', 'that', 'implements', 'the', 'solution']]
|
[-0.14025681019220743, 0.07246822355315591, -0.011783465900626997, 0.027823642540546454, -0.07249778564035861, -0.2102079619864275, 0.08463906396104119, 0.4250031337342707, -0.24747777350471709, -0.30250475380232494, 0.059228725524635276, -0.23678174949299288, -0.21675030378688023, 0.2082806621047925, -0.08802586111866323, 0.06599751767774659, 0.07459293249673371, 0.03370395949479706, 0.0020199660312159567, -0.2442963380007282, 0.24304424795314092, 0.06014217536044428, 0.28612207172635207, 0.040192675582085065, 0.14521241726821432, -0.06804850596858285, 0.02902976863295972, -0.017979364562679307, -0.037310675644252556, 0.13137706002352983, 0.28041449449715555, 0.13086655543884262, 0.31646656436476345, -0.4984855516572836, -0.2003008520856885, 0.07644000786569513, 0.11382369264601007, 0.14140691854105358, -0.028851621893973688, -0.23060168499620792, 0.15969369866271055, -0.18055276736388273, -0.03040292867796058, -0.129144797840252, 0.014037428146774143, 0.06610968083937066, -0.28555890599040895, 0.011104302082395438, 0.05328383433215063, 0.020997986279765207, -0.04605847143064803, -0.09293527623582311, 0.0095676643987676, 0.1377387664454953, -0.025566759317559352, 0.015251192278308987, 0.15588962120517832, -0.15503834616713996, -0.1455291440682325, 0.3193898718113658, -0.02488742607388774, -0.18947448983340892, 0.15359677356097784, -0.06467831593332009, -0.14588866995422747, 0.09030033693752243, 0.15781175462802038, 0.05847797566946548, -0.19827875170599799, 0.0043910312167005534, 0.04493283146815696, 0.20684934428196544, 0.04127932850729096, 0.03591702834066758, 0.18540002554173357, 0.2830055913012796, 0.06172062696162451, 0.1372605320512807, -0.08440886741777047, -0.06677509458326124, -0.28373190556308614, -0.14916259975569998, -0.18207104714458872, 0.027183382374491413, -0.07720660040079032, -0.17971073496827839, 0.4231185870007721, 0.208507616907872, 0.22592773472143593, 0.1414905744825554, 0.2905943213544529, 0.08195120215237568, 0.15645567199881671, 0.0863399534096845, 0.1978572337498792, 0.08774889604959252, 0.14841603180333363, -0.1954244944511096, 0.10833105321267042, -0.017111220774903155]
|
1,803.04774
|
CANA: A python package for quantifying control and canalization in
Boolean Networks
|
Logical models offer a simple but powerful means to understand the complex
dynamics of biochemical regulation, without the need to estimate kinetic
parameters. However, even simple automata components can lead to collective
dynamics that are computationally intractable when aggregated into networks. In
previous work we demonstrated that automata network models of biochemical
regulation are highly canalizing, whereby many variable states and their
groupings are redundant (Marques-Pita and Rocha, 2013). The precise charting
and measurement of such canalization simplifies these models, making even very
large networks amenable to analysis. Moreover, canalization plays an important
role in the control, robustness, modularity and criticality of Boolean network
dynamics, especially those used to model biochemical regulation (Gates and
Rocha, 2016; Gates et al., 2016; Manicka, 2017). Here we describe a new
publicly-available Python package that provides the necessary tools to extract,
measure, and visualize canalizing redundancy present in Boolean network models.
It extracts the pathways most effective in controlling dynamics in these
models, including their effective graph and dynamics canalizing map, as well as
other tools to uncover minimum sets of control variables.
|
cs.OH cs.CE cs.DM cs.SY q-bio.MN q-bio.QM
|
logical models offer a simple but powerful means to understand the complex dynamics of biochemical regulation without the need to estimate kinetic parameters however even simple automata components can lead to collective dynamics that are computationally intractable when aggregated into networks in previous work we demonstrated that automata network models of biochemical regulation are highly canalizing whereby many variable states and their groupings are redundant marquespita and rocha 2013 the precise charting and measurement of such canalization simplifies these models making even very large networks amenable to analysis moreover canalization plays an important role in the control robustness modularity and criticality of boolean network dynamics especially those used to model biochemical regulation gates and rocha 2016 gates et al 2016 manicka 2017 here we describe a new publiclyavailable python package that provides the necessary tools to extract measure and visualize canalizing redundancy present in boolean network models it extracts the pathways most effective in controlling dynamics in these models including their effective graph and dynamics canalizing map as well as other tools to uncover minimum sets of control variables
|
[['logical', 'models', 'offer', 'a', 'simple', 'but', 'powerful', 'means', 'to', 'understand', 'the', 'complex', 'dynamics', 'of', 'biochemical', 'regulation', 'without', 'the', 'need', 'to', 'estimate', 'kinetic', 'parameters', 'however', 'even', 'simple', 'automata', 'components', 'can', 'lead', 'to', 'collective', 'dynamics', 'that', 'are', 'computationally', 'intractable', 'when', 'aggregated', 'into', 'networks', 'in', 'previous', 'work', 'we', 'demonstrated', 'that', 'automata', 'network', 'models', 'of', 'biochemical', 'regulation', 'are', 'highly', 'canalizing', 'whereby', 'many', 'variable', 'states', 'and', 'their', 'groupings', 'are', 'redundant', 'marquespita', 'and', 'rocha', '2013', 'the', 'precise', 'charting', 'and', 'measurement', 'of', 'such', 'canalization', 'simplifies', 'these', 'models', 'making', 'even', 'very', 'large', 'networks', 'amenable', 'to', 'analysis', 'moreover', 'canalization', 'plays', 'an', 'important', 'role', 'in', 'the', 'control', 'robustness', 'modularity', 'and', 'criticality', 'of', 'boolean', 'network', 'dynamics', 'especially', 'those', 'used', 'to', 'model', 'biochemical', 'regulation', 'gates', 'and', 'rocha', '2016', 'gates', 'et', 'al', '2016', 'manicka', '2017', 'here', 'we', 'describe', 'a', 'new', 'publiclyavailable', 'python', 'package', 'that', 'provides', 'the', 'necessary', 'tools', 'to', 'extract', 'measure', 'and', 'visualize', 'canalizing', 'redundancy', 'present', 'in', 'boolean', 'network', 'models', 'it', 'extracts', 'the', 'pathways', 'most', 'effective', 'in', 'controlling', 'dynamics', 'in', 'these', 'models', 'including', 'their', 'effective', 'graph', 'and', 'dynamics', 'canalizing', 'map', 'as', 'well', 'as', 'other', 'tools', 'to', 'uncover', 'minimum', 'sets', 'of', 'control', 'variables']]
|
[-0.09505178715516076, 0.08086305498982461, -0.05188198297910687, 0.1201432244694334, -0.0918285877517514, -0.1954954422636768, 0.06398322567933024, 0.3881086970266418, -0.2910349924771094, -0.33239240122243424, 0.07223310926863345, -0.21690153351348251, -0.2608823662648099, 0.20813528587647034, -0.07608341304111783, 0.10515068742212455, 0.07705682050436735, -0.03934018109204237, 0.04445188900582114, -0.22429830860099914, 0.2573346995911692, 0.10088032693470601, 0.28617931444376793, 0.0022322652850952527, 0.08662453212309629, -0.0016880436000640446, -0.05906289367605064, 0.00918510313985059, -0.10036104818733539, 0.15048856319600484, 0.31650641466421287, 0.1949500273571134, 0.269134550817542, -0.48521659756473945, -0.2520613752537023, 0.11197346595963095, 0.1412752370855187, 0.14099468355261757, 0.017228765118509362, -0.2463337388573646, 0.02918260500471681, -0.1736302462032875, -0.06790896281248121, -0.22179020849703732, 0.05909249385671511, 0.026106908764179777, -0.2631466664836905, 0.047997947758271514, 0.07396757207866127, 0.07611196468936773, -0.020004879599068798, -0.10579329500195839, -0.0568452778122372, 0.18229704980141914, -0.05121749961593499, 0.010891212421432558, 0.17764718960286618, -0.13378653379609692, -0.15481610082900205, 0.3333595137290741, 0.017933205768497565, -0.2063746092299073, 0.2416397916530601, -0.0449981571012045, -0.20989786959542645, 0.07299602046966722, 0.2004637830893346, 0.07973163095526503, -0.19965341824968805, 0.05001028143902083, 0.0060807471821284565, 0.1987452781206723, 0.03316645951557504, 0.046688938931704074, 0.16934668010174386, 0.19998113168429815, 0.03322768392692298, 0.1218308518528228, -0.01605532702721529, -0.13544230039874725, -0.20979703975167904, -0.09474483119471178, -0.12478412364709512, 0.026816955908980367, -0.07910831297208794, -0.18018855176087323, 0.4038135539372004, 0.18140781982301993, 0.1689347301547208, 0.07272508846974726, 0.2616449725251161, 0.06749054958049397, 0.07895785187684147, 0.08151390513166454, 0.17436434368281967, 0.14744860525269293, 0.09102400952665987, -0.18927907715893566, 0.12890907747034341, 0.03282932264567221]
|
1,803.04775
|
Learning Monocular 3D Human Pose Estimation from Multi-view Images
|
Accurate 3D human pose estimation from single images is possible with
sophisticated deep-net architectures that have been trained on very large
datasets. However, this still leaves open the problem of capturing motions for
which no such database exists. Manual annotation is tedious, slow, and
error-prone. In this paper, we propose to replace most of the annotations by
the use of multiple views, at training time only. Specifically, we train the
system to predict the same pose in all views. Such a consistency constraint is
necessary but not sufficient to predict accurate poses. We therefore complement
it with a supervised loss aiming to predict the correct pose in a small set of
labeled images, and with a regularization term that penalizes drift from
initial predictions. Furthermore, we propose a method to estimate camera pose
jointly with human pose, which lets us utilize multi-view footage where
calibration is difficult, e.g., for pan-tilt or moving handheld cameras. We
demonstrate the effectiveness of our approach on established benchmarks, as
well as on a new Ski dataset with rotating cameras and expert ski motion, for
which annotations are truly hard to obtain.
|
cs.CV
|
accurate 3d human pose estimation from single images is possible with sophisticated deepnet architectures that have been trained on very large datasets however this still leaves open the problem of capturing motions for which no such database exists manual annotation is tedious slow and errorprone in this paper we propose to replace most of the annotations by the use of multiple views at training time only specifically we train the system to predict the same pose in all views such a consistency constraint is necessary but not sufficient to predict accurate poses we therefore complement it with a supervised loss aiming to predict the correct pose in a small set of labeled images and with a regularization term that penalizes drift from initial predictions furthermore we propose a method to estimate camera pose jointly with human pose which lets us utilize multiview footage where calibration is difficult eg for pantilt or moving handheld cameras we demonstrate the effectiveness of our approach on established benchmarks as well as on a new ski dataset with rotating cameras and expert ski motion for which annotations are truly hard to obtain
|
[['accurate', '3d', 'human', 'pose', 'estimation', 'from', 'single', 'images', 'is', 'possible', 'with', 'sophisticated', 'deepnet', 'architectures', 'that', 'have', 'been', 'trained', 'on', 'very', 'large', 'datasets', 'however', 'this', 'still', 'leaves', 'open', 'the', 'problem', 'of', 'capturing', 'motions', 'for', 'which', 'no', 'such', 'database', 'exists', 'manual', 'annotation', 'is', 'tedious', 'slow', 'and', 'errorprone', 'in', 'this', 'paper', 'we', 'propose', 'to', 'replace', 'most', 'of', 'the', 'annotations', 'by', 'the', 'use', 'of', 'multiple', 'views', 'at', 'training', 'time', 'only', 'specifically', 'we', 'train', 'the', 'system', 'to', 'predict', 'the', 'same', 'pose', 'in', 'all', 'views', 'such', 'a', 'consistency', 'constraint', 'is', 'necessary', 'but', 'not', 'sufficient', 'to', 'predict', 'accurate', 'poses', 'we', 'therefore', 'complement', 'it', 'with', 'a', 'supervised', 'loss', 'aiming', 'to', 'predict', 'the', 'correct', 'pose', 'in', 'a', 'small', 'set', 'of', 'labeled', 'images', 'and', 'with', 'a', 'regularization', 'term', 'that', 'penalizes', 'drift', 'from', 'initial', 'predictions', 'furthermore', 'we', 'propose', 'a', 'method', 'to', 'estimate', 'camera', 'pose', 'jointly', 'with', 'human', 'pose', 'which', 'lets', 'us', 'utilize', 'multiview', 'footage', 'where', 'calibration', 'is', 'difficult', 'eg', 'for', 'pantilt', 'or', 'moving', 'handheld', 'cameras', 'we', 'demonstrate', 'the', 'effectiveness', 'of', 'our', 'approach', 'on', 'established', 'benchmarks', 'as', 'well', 'as', 'on', 'a', 'new', 'ski', 'dataset', 'with', 'rotating', 'cameras', 'and', 'expert', 'ski', 'motion', 'for', 'which', 'annotations', 'are', 'truly', 'hard', 'to', 'obtain']]
|
[-0.03781475681926119, -0.0012014997639957278, -0.05369690259953433, 0.0643726264277254, -0.1451185893237511, -0.21058386153377154, 0.025523738574359894, 0.4413833426321573, -0.2426287141005399, -0.39564257294417704, 0.1090185311554438, -0.2661264471032403, -0.14172211525255796, 0.1909202826919064, -0.20446996184758204, 0.09418402182717713, 0.18109332240948622, 0.05260997357090965, -0.044649332178131565, -0.23298458529905203, 0.29275655025307507, -0.0027103346347918406, 0.27347562858028046, 0.006371904582900797, 0.1732502502518741, -0.006490604035596159, -0.042573100829965134, 0.015832074427289917, -0.05839155708169776, 0.15969620710631016, 0.28327905597292224, 0.1896956559771144, 0.30386262387037277, -0.4388682626406936, -0.1919464198424217, 0.07268644786155957, 0.12149946364213994, 0.1264090697433741, -0.04697655343617447, -0.3345913677650658, 0.08010855952108448, -0.136328410835349, -0.031576055547790256, -0.14930342092990556, 0.013043014670069762, -0.034594948043085556, -0.326308140170108, 0.05899992828596045, -0.0025120633461308433, 0.057843025674156966, -0.06507409864819962, -0.055672855715312185, 0.03549850989695898, 0.22716420529694123, 0.05257455156468612, 0.076426046198224, 0.09738200773450142, -0.1959278428438991, -0.08158838568114611, 0.4000109065931669, -0.02969389375832111, -0.2471780869312943, 0.23830201005797216, -0.0770433375905741, -0.15059361737570104, 0.13150204333382096, 0.2117861422565691, 0.13126243297932022, -0.17871639725159516, -0.0035747569574187585, -0.06001141977142842, 0.20884993284838624, 0.05490117660321465, -0.020847196385070165, 0.1939174029895199, 0.22729297654135502, 0.05450034020642904, 0.1130993845648466, -0.18220029338412386, -0.015678364178726083, -0.24899705708366793, -0.10422439536470098, -0.19287661135378467, 0.015160016831397179, -0.04714835426164106, -0.20438324229139337, 0.336456101548355, 0.27476491484128657, 0.22952659065800315, 0.11595537043039632, 0.3717524192967069, 0.005113886853317073, 0.1273790271099866, 0.07707360432294003, 0.18013769957949133, -0.04603272424338455, 0.11009551291627918, -0.15209673407841176, 0.09586201258312492, 0.03701467911543494]
|
1,803.04776
|
Non-perturbative calculation of orbital- and spin effects in molecules
subject to non-uniform magnetic fields
|
External non-uniform magnetic fields acting on molecules induce non-collinear
spin-densities and spin-symmetry breaking. This necessitates a general
two-component Pauli spinor representation. In this paper, we report the
implementation of a General Hartree-Fock method, without any spin constraints,
for non-perturbative calculations with finite non-uniform fields. London atomic
orbitals are used to ensure faster basis convergence as well as invariance
under constant gauge shifts of the magnetic vector potential. The
implementation has been applied to an investigate the joint orbital and spin
response to a field gradient---quantified through the anapole moments---of a
set of small molecules placed in a linearly varying magnetic field. The
relative contributions of orbital and spin-Zeeman interaction terms have been
studied both theoretically and computationally. Spin effects are stronger and
show a general paramagnetic behaviour for closed shell molecules while orbital
effects can have either direction. Basis set convergence and size effects of
anapole susceptibility tensors have been reported. The relation of the mixed
anapole susceptibility tensor to chirality is also demonstrated.
|
physics.chem-ph
|
external nonuniform magnetic fields acting on molecules induce noncollinear spindensities and spinsymmetry breaking this necessitates a general twocomponent pauli spinor representation in this paper we report the implementation of a general hartreefock method without any spin constraints for nonperturbative calculations with finite nonuniform fields london atomic orbitals are used to ensure faster basis convergence as well as invariance under constant gauge shifts of the magnetic vector potential the implementation has been applied to an investigate the joint orbital and spin response to a field gradientquantified through the anapole momentsof a set of small molecules placed in a linearly varying magnetic field the relative contributions of orbital and spinzeeman interaction terms have been studied both theoretically and computationally spin effects are stronger and show a general paramagnetic behaviour for closed shell molecules while orbital effects can have either direction basis set convergence and size effects of anapole susceptibility tensors have been reported the relation of the mixed anapole susceptibility tensor to chirality is also demonstrated
|
[['external', 'nonuniform', 'magnetic', 'fields', 'acting', 'on', 'molecules', 'induce', 'noncollinear', 'spindensities', 'and', 'spinsymmetry', 'breaking', 'this', 'necessitates', 'a', 'general', 'twocomponent', 'pauli', 'spinor', 'representation', 'in', 'this', 'paper', 'we', 'report', 'the', 'implementation', 'of', 'a', 'general', 'hartreefock', 'method', 'without', 'any', 'spin', 'constraints', 'for', 'nonperturbative', 'calculations', 'with', 'finite', 'nonuniform', 'fields', 'london', 'atomic', 'orbitals', 'are', 'used', 'to', 'ensure', 'faster', 'basis', 'convergence', 'as', 'well', 'as', 'invariance', 'under', 'constant', 'gauge', 'shifts', 'of', 'the', 'magnetic', 'vector', 'potential', 'the', 'implementation', 'has', 'been', 'applied', 'to', 'an', 'investigate', 'the', 'joint', 'orbital', 'and', 'spin', 'response', 'to', 'a', 'field', 'gradientquantified', 'through', 'the', 'anapole', 'momentsof', 'a', 'set', 'of', 'small', 'molecules', 'placed', 'in', 'a', 'linearly', 'varying', 'magnetic', 'field', 'the', 'relative', 'contributions', 'of', 'orbital', 'and', 'spinzeeman', 'interaction', 'terms', 'have', 'been', 'studied', 'both', 'theoretically', 'and', 'computationally', 'spin', 'effects', 'are', 'stronger', 'and', 'show', 'a', 'general', 'paramagnetic', 'behaviour', 'for', 'closed', 'shell', 'molecules', 'while', 'orbital', 'effects', 'can', 'have', 'either', 'direction', 'basis', 'set', 'convergence', 'and', 'size', 'effects', 'of', 'anapole', 'susceptibility', 'tensors', 'have', 'been', 'reported', 'the', 'relation', 'of', 'the', 'mixed', 'anapole', 'susceptibility', 'tensor', 'to', 'chirality', 'is', 'also', 'demonstrated']]
|
[-0.17803580864326832, 0.1955642111648072, -0.03787657106873689, 0.06194409501510354, -0.11098830148242182, -0.09140382150060827, 0.013904135209299994, 0.3934397026896477, -0.21710988198933395, -0.2817994341260019, 0.0315488581328728, -0.22640893658368577, -0.09818606412396853, 0.13848112773884852, 0.06378553948301521, 0.04519504476454317, -0.014600367561526459, 0.021965396200069546, -0.11641936834832156, -0.2205071968752428, 0.2818602429202509, 0.015740172521020314, 0.30739837913247553, 0.10028582104873664, 0.09002495469432903, 0.03445179462331631, 0.0703490815553467, 0.04789637260555481, -0.06935296475204715, 0.07385564365233324, 0.18535951348289165, 5.794902366834768e-05, 0.21167212473633495, -0.489999849383968, -0.19771728425153665, 0.07496036991465443, 0.153862398281196, 0.18466520016023785, -0.06756134971366004, -0.2923861979781679, 0.024243808053549587, -0.1863030983331781, -0.1499078218508454, -0.1958195659800531, 0.044064244848346305, 0.0290904573786003, -0.3054628001485506, 0.07733730692253737, 0.05204141280645113, 0.12841416214644635, -0.09441428874787058, -0.1590181276041679, -0.027130938952163973, 0.056542524570448796, 0.0870971599266928, 0.0747960984218079, 0.15161631578255608, -0.10183046664753408, -0.11592939609129514, 0.40280102262192446, -0.08476505630652519, -0.2351513641903767, 0.13817442804632812, -0.14899266967210073, -0.10731643656852961, 0.1277766065304717, 0.18171781263753817, 0.12948961985483332, -0.1466342538164246, 0.12854789583640092, -0.021134872633026717, 0.1480713131915639, 0.05792622298279904, 0.09109232572640541, 0.2172149032967524, 0.09978316449531302, 0.05246092966665161, 0.1488379534964467, -0.0962638386990875, -0.08448275656190625, -0.24722248253915807, -0.12559913699254857, -0.19729396424933066, 0.04001594429988608, -0.05527676999086647, -0.17096515866979864, 0.38459380915943786, 0.11843846410061724, 0.11749579266211892, -0.023879125187902348, 0.28446145679061274, 0.11537626693737461, 0.08768635544555713, 0.04044970415058251, 0.26837770361453295, 0.22531989840964167, 0.060661988074006225, -0.2918610153922244, 0.06466453927511245, 0.031403331080254934]
|
1,803.04777
|
Strong neutron pairing in core+4n nuclei
|
The emission of neutron pairs from the neutron-rich $N\!=\!12$ isotones
$^{18}$C and $^{20}$O has been studied by high-energy nucleon knockout from
$^{19}$N and $^{21}$O secondary beams, populating unbound states of the two
isotones up to 15~MeV above their two-neutron emission thresholds. The analysis
of triple fragment-$n$-$n$ correlations shows that the decay
$^{19}$N$(-1p)^{18}$C$^*\!\rightarrow^{16}$C+$n$+$n$ is clearly dominated by
direct pair emission. The two-neutron correlation strength, the largest ever
observed, suggests the predominance of a $^{14}$C core surrounded by four
valence neutrons arranged in strongly correlated pairs. On the other hand, a
significant competition of a sequential branch is found in the decay
$^{21}$O$(-1n)^{20}$O$^*\!\rightarrow^{18}$O+$n$+$n$, attributed to its
formation through the knockout of a deeply-bound neutron that breaks the
$^{16}$O core and reduces the number of pairs.
|
nucl-ex
|
the emission of neutron pairs from the neutronrich n12 isotones 18c and 20o has been studied by highenergy nucleon knockout from 19n and 21o secondary beams populating unbound states of the two isotones up to 15mev above their twoneutron emission thresholds the analysis of triple fragmentnn correlations shows that the decay 19n1p18crightarrow16cnn is clearly dominated by direct pair emission the twoneutron correlation strength the largest ever observed suggests the predominance of a 14c core surrounded by four valence neutrons arranged in strongly correlated pairs on the other hand a significant competition of a sequential branch is found in the decay 21o1n20orightarrow18onn attributed to its formation through the knockout of a deeplybound neutron that breaks the 16o core and reduces the number of pairs
|
[['the', 'emission', 'of', 'neutron', 'pairs', 'from', 'the', 'neutronrich', 'n12', 'isotones', '18c', 'and', '20o', 'has', 'been', 'studied', 'by', 'highenergy', 'nucleon', 'knockout', 'from', '19n', 'and', '21o', 'secondary', 'beams', 'populating', 'unbound', 'states', 'of', 'the', 'two', 'isotones', 'up', 'to', '15mev', 'above', 'their', 'twoneutron', 'emission', 'thresholds', 'the', 'analysis', 'of', 'triple', 'fragmentnn', 'correlations', 'shows', 'that', 'the', 'decay', '19n1p18crightarrow16cnn', 'is', 'clearly', 'dominated', 'by', 'direct', 'pair', 'emission', 'the', 'twoneutron', 'correlation', 'strength', 'the', 'largest', 'ever', 'observed', 'suggests', 'the', 'predominance', 'of', 'a', '14c', 'core', 'surrounded', 'by', 'four', 'valence', 'neutrons', 'arranged', 'in', 'strongly', 'correlated', 'pairs', 'on', 'the', 'other', 'hand', 'a', 'significant', 'competition', 'of', 'a', 'sequential', 'branch', 'is', 'found', 'in', 'the', 'decay', '21o1n20orightarrow18onn', 'attributed', 'to', 'its', 'formation', 'through', 'the', 'knockout', 'of', 'a', 'deeplybound', 'neutron', 'that', 'breaks', 'the', '16o', 'core', 'and', 'reduces', 'the', 'number', 'of', 'pairs']]
|
[-0.08379448133231211, 0.23318295840158307, -0.055533507405467204, 0.15958239186062095, 0.02847006722713406, -0.07769405738129712, 0.07342042987031408, 0.3380979249770401, -0.1973354557637681, -0.30128114984746246, -0.08784440622915428, -0.38297287925702184, 0.002675240726343223, 0.13921143678838716, 0.13419496555256993, -0.027759556988124077, 0.090180422703759, 0.04116516202656912, -0.04980433808968348, -0.13548215779039555, 0.3555669050914149, 0.09088626690208912, 0.2629939173054764, 0.11324606594793937, 0.003774326552926492, 0.007276544946112803, 0.010271498659516083, -0.08306218364409038, -0.05831371957278212, 0.08870052397221781, 0.2043332642946048, 0.09050794726261134, 0.16252133230670912, -0.3989004282233845, -0.13128131334943807, 0.10846642309314564, 0.218838990658146, 0.07872524745410167, -0.06931169975466807, -0.31971140316992747, 0.04020636390205942, -0.23005842210865823, -0.14020283154344984, -0.004234585234065767, 0.0593838617440407, 0.0753479829965895, -0.21520526241511106, 0.09122751660433699, 0.026254589830822617, 0.005221533009923306, -0.06880599416757174, -0.21893766371948065, -0.10385209911389418, 0.04978959227544295, 0.09753449148099337, 0.029460763867881868, 0.1679033607776676, -0.10774365512795057, -0.11363530042728003, 0.3567370816345225, -0.0064346373135990955, -0.027282349937478034, 0.1683279399509628, -0.19091079332435332, -0.13629292894718276, 0.2753343430715574, 0.08782868252816696, 0.13825932492212462, -0.11450291942304172, -0.00011943254430050485, -0.009094059936890081, 0.2218058405447939, 0.12482707382829375, 0.031127063334457764, 0.2184695161922107, 0.20188136463163092, -0.023566060010813364, 0.12251487768797141, -0.21319540676136478, -0.10826616940487709, -0.22554607376526697, -0.06521862972245998, -0.143036640861596, 0.03210248668705497, -0.014765529336085926, -0.11071774071060951, 0.35151174083594705, -0.03639293584127386, 0.19581030965821833, -0.07513866273240194, 0.24763611685719436, 0.06733267731620234, 0.10978498928710631, 0.041809383231927365, 0.3402388164726626, 0.22181430631493287, 0.032990927134930084, -0.3230665414281064, 0.10210979541394608, -0.017217267843691177]
|
1,803.04778
|
Quantum Fluctuation Theorems
|
Recent advances in experimental techniques allow one to measure and control
systems at the level of single molecules and atoms. Here gaining information
about fluctuating thermodynamic quantities is crucial for understanding
nonequilibrium thermodynamic behavior of small systems. To achieve this aim,
stochastic thermodynamics offers a theoretical framework, and nonequilibrium
equalities such as Jarzynski equality and fluctuation theorems provide key
information about the fluctuating thermodynamic quantities. We review the
recent progress in quantum fluctuation theorems, including the studies of
Maxwell's demon which plays a crucial role in connecting thermodynamics with
information.
|
cond-mat.stat-mech quant-ph
|
recent advances in experimental techniques allow one to measure and control systems at the level of single molecules and atoms here gaining information about fluctuating thermodynamic quantities is crucial for understanding nonequilibrium thermodynamic behavior of small systems to achieve this aim stochastic thermodynamics offers a theoretical framework and nonequilibrium equalities such as jarzynski equality and fluctuation theorems provide key information about the fluctuating thermodynamic quantities we review the recent progress in quantum fluctuation theorems including the studies of maxwells demon which plays a crucial role in connecting thermodynamics with information
|
[['recent', 'advances', 'in', 'experimental', 'techniques', 'allow', 'one', 'to', 'measure', 'and', 'control', 'systems', 'at', 'the', 'level', 'of', 'single', 'molecules', 'and', 'atoms', 'here', 'gaining', 'information', 'about', 'fluctuating', 'thermodynamic', 'quantities', 'is', 'crucial', 'for', 'understanding', 'nonequilibrium', 'thermodynamic', 'behavior', 'of', 'small', 'systems', 'to', 'achieve', 'this', 'aim', 'stochastic', 'thermodynamics', 'offers', 'a', 'theoretical', 'framework', 'and', 'nonequilibrium', 'equalities', 'such', 'as', 'jarzynski', 'equality', 'and', 'fluctuation', 'theorems', 'provide', 'key', 'information', 'about', 'the', 'fluctuating', 'thermodynamic', 'quantities', 'we', 'review', 'the', 'recent', 'progress', 'in', 'quantum', 'fluctuation', 'theorems', 'including', 'the', 'studies', 'of', 'maxwells', 'demon', 'which', 'plays', 'a', 'crucial', 'role', 'in', 'connecting', 'thermodynamics', 'with', 'information']]
|
[-0.1161983639984909, 0.11501824343059626, -0.13020477135562233, 0.0735937371229132, -0.01581831384036276, -0.145811645174399, 0.08079669371299032, 0.25443263459536763, -0.2544757987683018, -0.30158181732727424, 0.043878108642012296, -0.33196844711071916, -0.12286896020070547, 0.22268449754143754, -0.06042376799095008, 0.1250717218965292, 0.025840315751783135, 0.007897526548670914, -0.060282324016508126, -0.18307604976127753, 0.2760793709920512, 0.0903450178538656, 0.32856665778801675, 0.14598790965974331, 0.11901421736046258, 0.03748957901261747, -0.01730102544857396, 0.007864238643863548, -0.21996463613791598, 0.15435471680636206, 0.30892493894530665, 0.10363178238686588, 0.3083105411173569, -0.5075047929460804, -0.26732933189875135, 0.06743584337333838, 0.09913358702550694, 0.1521885861784944, -0.061541605489845906, -0.22903482738054462, -0.020371639265471864, -0.12105136387981474, -0.14469728637486695, -0.19885388838334217, 0.013463830456344618, 0.032049768296484316, -0.18976265094760392, 0.13791290381923318, 0.13112078284741277, 0.09440500813846787, -0.04070593909256988, -0.07300143170480927, 0.036221072579630545, 0.20301967926530373, 0.016378291848943464, 0.013545473931784121, 0.21902765765165289, -0.14541304630693047, -0.14484054419832926, 0.35576728134312563, -0.01436767641765376, -0.1683442617326768, 0.17658776277158822, -0.1285289018207954, -0.24915816166127722, 0.03484650118690398, 0.12495973747637537, 0.08952957790655394, -0.2383940958443822, 0.051747555402107535, 0.019236640435540013, 0.15700912406771547, 0.004081823293947511, 0.16655663249289823, 0.30639354528652296, 0.19968283269554377, 0.004993816423747275, 0.13969307621009647, 0.0044729168268127575, -0.24205855968304807, -0.2982686324872904, -0.1830279397493642, -0.15086109469541245, 0.11105907780842648, -0.0853416844989018, -0.10484015781742831, 0.29791161926049325, 0.22677072221413255, 0.10653962842188776, -0.01869355914467532, 0.30619778976672224, 0.10342456484084121, -0.0043881370983500445, 0.040098576139037806, 0.2377743817361382, 0.24836160159773296, 0.200464284626974, -0.2139898749935027, 0.07176097409941981, 0.06011380731749038]
|
1,803.04779
|
Hybrid Forecasting of Chaotic Processes: Using Machine Learning in
Conjunction with a Knowledge-Based Model
|
A model-based approach to forecasting chaotic dynamical systems utilizes
knowledge of the physical processes governing the dynamics to build an
approximate mathematical model of the system. In contrast, machine learning
techniques have demonstrated promising results for forecasting chaotic systems
purely from past time series measurements of system state variables (training
data), without prior knowledge of the system dynamics. The motivation for this
paper is the potential of machine learning for filling in the gaps in our
underlying mechanistic knowledge that cause widely-used knowledge-based models
to be inaccurate. Thus we here propose a general method that leverages the
advantages of these two approaches by combining a knowledge-based model and a
machine learning technique to build a hybrid forecasting scheme. Potential
applications for such an approach are numerous (e.g., improving weather
forecasting). We demonstrate and test the utility of this approach using a
particular illustrative version of a machine learning known as reservoir
computing, and we apply the resulting hybrid forecaster to a low-dimensional
chaotic system, as well as to a high-dimensional spatiotemporal chaotic system.
These tests yield extremely promising results in that our hybrid technique is
able to accurately predict for a much longer period of time than either its
machine-learning component or its model-based component alone.
|
cs.LG nlin.CD stat.ML
|
a modelbased approach to forecasting chaotic dynamical systems utilizes knowledge of the physical processes governing the dynamics to build an approximate mathematical model of the system in contrast machine learning techniques have demonstrated promising results for forecasting chaotic systems purely from past time series measurements of system state variables training data without prior knowledge of the system dynamics the motivation for this paper is the potential of machine learning for filling in the gaps in our underlying mechanistic knowledge that cause widelyused knowledgebased models to be inaccurate thus we here propose a general method that leverages the advantages of these two approaches by combining a knowledgebased model and a machine learning technique to build a hybrid forecasting scheme potential applications for such an approach are numerous eg improving weather forecasting we demonstrate and test the utility of this approach using a particular illustrative version of a machine learning known as reservoir computing and we apply the resulting hybrid forecaster to a lowdimensional chaotic system as well as to a highdimensional spatiotemporal chaotic system these tests yield extremely promising results in that our hybrid technique is able to accurately predict for a much longer period of time than either its machinelearning component or its modelbased component alone
|
[['a', 'modelbased', 'approach', 'to', 'forecasting', 'chaotic', 'dynamical', 'systems', 'utilizes', 'knowledge', 'of', 'the', 'physical', 'processes', 'governing', 'the', 'dynamics', 'to', 'build', 'an', 'approximate', 'mathematical', 'model', 'of', 'the', 'system', 'in', 'contrast', 'machine', 'learning', 'techniques', 'have', 'demonstrated', 'promising', 'results', 'for', 'forecasting', 'chaotic', 'systems', 'purely', 'from', 'past', 'time', 'series', 'measurements', 'of', 'system', 'state', 'variables', 'training', 'data', 'without', 'prior', 'knowledge', 'of', 'the', 'system', 'dynamics', 'the', 'motivation', 'for', 'this', 'paper', 'is', 'the', 'potential', 'of', 'machine', 'learning', 'for', 'filling', 'in', 'the', 'gaps', 'in', 'our', 'underlying', 'mechanistic', 'knowledge', 'that', 'cause', 'widelyused', 'knowledgebased', 'models', 'to', 'be', 'inaccurate', 'thus', 'we', 'here', 'propose', 'a', 'general', 'method', 'that', 'leverages', 'the', 'advantages', 'of', 'these', 'two', 'approaches', 'by', 'combining', 'a', 'knowledgebased', 'model', 'and', 'a', 'machine', 'learning', 'technique', 'to', 'build', 'a', 'hybrid', 'forecasting', 'scheme', 'potential', 'applications', 'for', 'such', 'an', 'approach', 'are', 'numerous', 'eg', 'improving', 'weather', 'forecasting', 'we', 'demonstrate', 'and', 'test', 'the', 'utility', 'of', 'this', 'approach', 'using', 'a', 'particular', 'illustrative', 'version', 'of', 'a', 'machine', 'learning', 'known', 'as', 'reservoir', 'computing', 'and', 'we', 'apply', 'the', 'resulting', 'hybrid', 'forecaster', 'to', 'a', 'lowdimensional', 'chaotic', 'system', 'as', 'well', 'as', 'to', 'a', 'highdimensional', 'spatiotemporal', 'chaotic', 'system', 'these', 'tests', 'yield', 'extremely', 'promising', 'results', 'in', 'that', 'our', 'hybrid', 'technique', 'is', 'able', 'to', 'accurately', 'predict', 'for', 'a', 'much', 'longer', 'period', 'of', 'time', 'than', 'either', 'its', 'machinelearning', 'component', 'or', 'its', 'modelbased', 'component', 'alone']]
|
[-0.05621292528208092, 0.025904831763733295, -0.13069887932172966, 0.07872208242473595, -0.08156419989824729, -0.16259214780982856, 0.058505537421826855, 0.3668663789228835, -0.2866899374673523, -0.31619877061010926, 0.10995079296894227, -0.23096319738757407, -0.2154111550641653, 0.2631902904554894, -0.08544558490111122, 0.12303539876796721, 0.10775383459392808, 0.01878685708207449, -0.042400024653846416, -0.22316352115577828, 0.2905717045486932, 0.05815306832240804, 0.30139660377742594, -0.025355662053080222, 0.12166238190138315, -0.020869302462777396, -0.007111393702606382, -0.009011012505405374, -0.06288517304428133, 0.17166839463034989, 0.2870896651962292, 0.18959462667309038, 0.3523764696098792, -0.42361558207030436, -0.29265343057425713, 0.09525805324919576, 0.13863238342719783, 0.13454814156680142, -0.04808069080864848, -0.27737437515548946, 0.0455783648389274, -0.20725944374339855, -0.1091829474133245, -0.17851335420730993, -0.00859517275437134, 0.003684372014989986, -0.3044217476277675, 0.05715497588123945, 0.09445826947173099, 0.06985110104834498, -0.065316680454857, -0.09753647189784018, 0.037956327474585654, 0.13359597867051845, 0.02480276280480609, 0.03384962865350388, 0.1377944032620928, -0.13472642966103063, -0.17674144614121687, 0.3687874154996995, -0.0815853592985591, -0.19357116927858442, 0.23448319476803095, -0.03678826205161156, -0.16202967120470135, 0.08124320538832074, 0.25285414063136624, 0.11446015112151763, -0.19032161163157124, 0.01982003263422758, 0.01026251938564757, 0.1819521345840134, -0.03337949939587524, -0.0010936781003940128, 0.19987859025154517, 0.27805619243785595, 0.03275400559978505, 0.0968420205731623, -0.08605826963462586, -0.14259654796203075, -0.21963257852996004, -0.13814615012028986, -0.19784383219327706, -0.003963762610581098, -0.07633727556299384, -0.17502450237945807, 0.40419536807468864, 0.2498747836866244, 0.1770717452384206, 0.06943436361254798, 0.36914706773133676, 0.08366618666106165, 0.051612312226000726, 0.06954899955161133, 0.20799005615075108, 0.0621576072406295, 0.1261582826173783, -0.17954436093128007, 0.08392033931794712, 0.016323043331865548]
|
1,803.0478
|
IoT Architectural Framework: Connection and Integration Framework for
IoT Systems
|
The proliferation of the Internet of Things (IoT) has since seen a growing
interest in architectural design and adaptive frameworks to promote the
connection between heterogeneous IoT devices and IoT systems. The most widely
favoured software architecture in IoT is the Service Oriented Architecture
(SOA), which aims to provide a loosely coupled systems to leverage the use and
reuse of IoT services at the middle-ware layer, to minimise system integration
problems. However, despite the flexibility offered by SOA, the challenges of
integrating, scaling and ensuring resilience in IoT systems persist. One of the
key causes of poor integration in IoT systems is the lack of an intelligent,
connection-aware framework to support interaction in IoT systems. This paper
reviews existing architectural frameworks for integrating IoT devices and
identifies the key areas that require further research improvements. The paper
concludes by proposing a possible solution based on microservice. The proposed
IoT integration framework benefits from an intelligent API layer that employs
an external service assembler, service auditor, service monitor and service
router component to coordinate service publishing, subscription, decoupling and
service combination within the architecture.
|
cs.DC cs.CY cs.SE
|
the proliferation of the internet of things iot has since seen a growing interest in architectural design and adaptive frameworks to promote the connection between heterogeneous iot devices and iot systems the most widely favoured software architecture in iot is the service oriented architecture soa which aims to provide a loosely coupled systems to leverage the use and reuse of iot services at the middleware layer to minimise system integration problems however despite the flexibility offered by soa the challenges of integrating scaling and ensuring resilience in iot systems persist one of the key causes of poor integration in iot systems is the lack of an intelligent connectionaware framework to support interaction in iot systems this paper reviews existing architectural frameworks for integrating iot devices and identifies the key areas that require further research improvements the paper concludes by proposing a possible solution based on microservice the proposed iot integration framework benefits from an intelligent api layer that employs an external service assembler service auditor service monitor and service router component to coordinate service publishing subscription decoupling and service combination within the architecture
|
[['the', 'proliferation', 'of', 'the', 'internet', 'of', 'things', 'iot', 'has', 'since', 'seen', 'a', 'growing', 'interest', 'in', 'architectural', 'design', 'and', 'adaptive', 'frameworks', 'to', 'promote', 'the', 'connection', 'between', 'heterogeneous', 'iot', 'devices', 'and', 'iot', 'systems', 'the', 'most', 'widely', 'favoured', 'software', 'architecture', 'in', 'iot', 'is', 'the', 'service', 'oriented', 'architecture', 'soa', 'which', 'aims', 'to', 'provide', 'a', 'loosely', 'coupled', 'systems', 'to', 'leverage', 'the', 'use', 'and', 'reuse', 'of', 'iot', 'services', 'at', 'the', 'middleware', 'layer', 'to', 'minimise', 'system', 'integration', 'problems', 'however', 'despite', 'the', 'flexibility', 'offered', 'by', 'soa', 'the', 'challenges', 'of', 'integrating', 'scaling', 'and', 'ensuring', 'resilience', 'in', 'iot', 'systems', 'persist', 'one', 'of', 'the', 'key', 'causes', 'of', 'poor', 'integration', 'in', 'iot', 'systems', 'is', 'the', 'lack', 'of', 'an', 'intelligent', 'connectionaware', 'framework', 'to', 'support', 'interaction', 'in', 'iot', 'systems', 'this', 'paper', 'reviews', 'existing', 'architectural', 'frameworks', 'for', 'integrating', 'iot', 'devices', 'and', 'identifies', 'the', 'key', 'areas', 'that', 'require', 'further', 'research', 'improvements', 'the', 'paper', 'concludes', 'by', 'proposing', 'a', 'possible', 'solution', 'based', 'on', 'microservice', 'the', 'proposed', 'iot', 'integration', 'framework', 'benefits', 'from', 'an', 'intelligent', 'api', 'layer', 'that', 'employs', 'an', 'external', 'service', 'assembler', 'service', 'auditor', 'service', 'monitor', 'and', 'service', 'router', 'component', 'to', 'coordinate', 'service', 'publishing', 'subscription', 'decoupling', 'and', 'service', 'combination', 'within', 'the', 'architecture']]
|
[-0.2413796686598069, -0.03782453556498065, -0.0007946926839444991, -0.024552647199016064, -0.1174714788385145, -0.19328982166812889, 0.047666873612727687, 0.38314499955859094, -0.27889256615634334, -0.3170468854707676, 0.09031642593937839, -0.27264109212178533, -0.17584208455218187, 0.18771872331853956, -0.16240360024564254, 0.0796246237964574, 0.04661228190493453, -0.031930712253657415, 0.01570546586843013, -0.274607118311246, 0.32559725091214403, 0.05766526765732483, 0.4313436457068547, 0.09299912551612399, 0.06550132695605958, -0.014486762861961724, -0.022905517146912413, -0.08692108566749963, -0.03807917524650143, 0.22864514640992978, 0.3757935518313808, 0.2555133792454029, 0.37481396888884216, -0.4855731048763238, -0.18377041777181388, 0.014159068442205642, 0.2158531599248258, -0.0072041569657593065, -0.06668207696818101, -0.32845236393776567, 0.10530666901044301, -0.3099920834864971, -0.13454152250155207, -0.05111216755512242, -0.007142104037044631, 0.06013953912130731, -0.23357406024217278, -0.09077336985853265, -0.010751425060904124, 0.06359111591866547, -0.054299711654823696, -0.04838090203382627, 0.0009837661403523002, 0.17252387581802495, 0.053986944764491764, 0.006114970553016475, 0.21388956089504063, -0.14480267258125593, -0.1424384757129291, 0.37901008244255907, 0.04616031873392985, -0.12983861948097392, 0.19088690163398797, 0.05703290964343718, -0.20196718653756102, 0.058506265514182275, 0.2277492099623247, -0.004550390372429859, -0.27227498343787515, 0.0634886484051374, 0.1130537286958565, 0.17620715017399782, 0.01779895712228768, 0.08426367621307561, 0.24317055106147673, 0.3203443169522171, 0.16725267543058311, 0.07516704448549957, 0.016836030699138704, -0.14571958704586754, -0.17704220438391421, -0.19043080178620345, -0.14690130101619187, -0.026730464155412186, -0.09067202526840937, -0.15244248711023028, 0.36495282511472454, 0.24376964108195862, 0.08888552404407944, 0.04030009695254573, 0.41512452806909006, 0.022637195345321364, 0.16857383419902852, 0.13624202051701453, 0.12680122189819915, -0.0009246652646522437, 0.2702373052706717, -0.12404999918186689, 0.13667321569736596, -0.025424371432553935]
|
1,803.04781
|
On Ordering Multi-Robot Task Executions within a Cyber Physical System
|
With robots entering the world of Cyber Physical Systems (CPS), ordering the
execution of allocated tasks during run-time becomes crucial. This is so
because, in a real world, there can be several physical tasks that use shared
resources that need to be executed concurrently. In this paper, we propose a
mechanism to solve this issue of ordering task executions within a CPS which
inherently handles mutual exclusion. The mechanism caters to a decentralized
and distributed CPS comprising nodes such as computers, robots and sensor
nodes, and uses mobile software agents that knit through them to aid the
execution of the various tasks while also ensuring mutual exclusion of shared
resources. The computations, communications and control, are achieved through
these mobile agents. Physical execution of the tasks is performed by the robots
in an asynchronous and pipelined manner without the use of a clock. The
mechanism also features addition and deletion of tasks and insertion and
removal of robots facilitating \textit{On-The-Fly Programming}. As an
application, a Warehouse Management System as a CPS has been implemented. The
paper concludes with the results and discussions on using the mechanism in both
emulated and real world environments.
|
cs.DC
|
with robots entering the world of cyber physical systems cps ordering the execution of allocated tasks during runtime becomes crucial this is so because in a real world there can be several physical tasks that use shared resources that need to be executed concurrently in this paper we propose a mechanism to solve this issue of ordering task executions within a cps which inherently handles mutual exclusion the mechanism caters to a decentralized and distributed cps comprising nodes such as computers robots and sensor nodes and uses mobile software agents that knit through them to aid the execution of the various tasks while also ensuring mutual exclusion of shared resources the computations communications and control are achieved through these mobile agents physical execution of the tasks is performed by the robots in an asynchronous and pipelined manner without the use of a clock the mechanism also features addition and deletion of tasks and insertion and removal of robots facilitating textitonthefly programming as an application a warehouse management system as a cps has been implemented the paper concludes with the results and discussions on using the mechanism in both emulated and real world environments
|
[['with', 'robots', 'entering', 'the', 'world', 'of', 'cyber', 'physical', 'systems', 'cps', 'ordering', 'the', 'execution', 'of', 'allocated', 'tasks', 'during', 'runtime', 'becomes', 'crucial', 'this', 'is', 'so', 'because', 'in', 'a', 'real', 'world', 'there', 'can', 'be', 'several', 'physical', 'tasks', 'that', 'use', 'shared', 'resources', 'that', 'need', 'to', 'be', 'executed', 'concurrently', 'in', 'this', 'paper', 'we', 'propose', 'a', 'mechanism', 'to', 'solve', 'this', 'issue', 'of', 'ordering', 'task', 'executions', 'within', 'a', 'cps', 'which', 'inherently', 'handles', 'mutual', 'exclusion', 'the', 'mechanism', 'caters', 'to', 'a', 'decentralized', 'and', 'distributed', 'cps', 'comprising', 'nodes', 'such', 'as', 'computers', 'robots', 'and', 'sensor', 'nodes', 'and', 'uses', 'mobile', 'software', 'agents', 'that', 'knit', 'through', 'them', 'to', 'aid', 'the', 'execution', 'of', 'the', 'various', 'tasks', 'while', 'also', 'ensuring', 'mutual', 'exclusion', 'of', 'shared', 'resources', 'the', 'computations', 'communications', 'and', 'control', 'are', 'achieved', 'through', 'these', 'mobile', 'agents', 'physical', 'execution', 'of', 'the', 'tasks', 'is', 'performed', 'by', 'the', 'robots', 'in', 'an', 'asynchronous', 'and', 'pipelined', 'manner', 'without', 'the', 'use', 'of', 'a', 'clock', 'the', 'mechanism', 'also', 'features', 'addition', 'and', 'deletion', 'of', 'tasks', 'and', 'insertion', 'and', 'removal', 'of', 'robots', 'facilitating', 'textitonthefly', 'programming', 'as', 'an', 'application', 'a', 'warehouse', 'management', 'system', 'as', 'a', 'cps', 'has', 'been', 'implemented', 'the', 'paper', 'concludes', 'with', 'the', 'results', 'and', 'discussions', 'on', 'using', 'the', 'mechanism', 'in', 'both', 'emulated', 'and', 'real', 'world', 'environments']]
|
[-0.19890444415796082, 0.062116809245253535, -0.052316360524855554, -0.006770416665555483, -0.10932332409235339, -0.17336267676000716, 0.11942335256632457, 0.4164138500636909, -0.27588157581340056, -0.36787089752033353, 0.11213454710135314, -0.22470932253539408, -0.15423053194535896, 0.17130092103980132, -0.12194160331152186, 0.08334282682820533, 0.09876221793698885, 0.04224071161418882, 0.024372390746520978, -0.27698900371857843, 0.2700059166254505, 0.05086473346940087, 0.26267616494442336, 0.05942946581368839, 0.11334796500644491, 0.02463832155626733, 0.0027946508548666316, -0.020445325499167666, 0.0038409628608633284, 0.14659948494712202, 0.3454651369077813, 0.20513505616084635, 0.3238257350555311, -0.47767497251819196, -0.16446056827165498, 0.10256496568763396, 0.16156696622177455, 0.06047895009699763, -0.02663047807739834, -0.3315942916863908, 0.08680881279239354, -0.22541299891114855, -0.03787077217081484, -0.09374741120457959, 0.003948456753278151, 0.0038935613262462234, -0.2735115520023707, -0.03591444185955576, 0.04516836044361602, 0.09019097328079322, -0.03935178244015939, -0.032622903354422306, -0.006148999523550931, 0.19905948534384757, 0.014472705670679412, -0.030541632671277814, 0.21635378006855413, -0.1273277713492765, -0.21591388230202332, 0.43172948230737046, 0.06476912504513166, -0.19427092008557642, 0.22018825952181942, 0.007210867641939937, -0.14698160567544014, 0.05248542567642289, 0.23211857187864857, 0.08457617922977079, -0.2198105671244169, 0.04409064936104793, 0.02318435027458084, 0.18789615140364427, 0.04266290789504031, 0.024771491099575844, 0.2045358152705982, 0.22980760086890464, 0.0903893390277517, 0.13902335795137333, -0.009395508668148977, -0.1525133663235465, -0.23962816682978882, -0.17218661563917217, -0.1877754933993856, -0.038939817477512406, -0.06010978085805618, -0.11305547170256129, 0.3445182942596148, 0.20039869343114938, 0.1803813431664215, 0.07547710990365886, 0.39614428516809613, 0.03944987441658062, 0.12814773458406611, 0.1341225164842399, 0.13735125500291664, -0.006722181087146358, 0.19842745618734625, -0.20128373833722435, 0.13242810311930953, -0.04407815069498611]
|
1,803.04782
|
Improved OpenCL-based Implementation of Social Field Pedestrian Model
|
Two aspects of improvements are proposed for the OpenCL-based implementation
of the social field pedestrian model. In the aspect of algorithm, a method
based on the idea of divide-and-conquer is devised in order to overcome the
problem of global memory depletion when fields are of a larger size. This is of
importance for the study of finer pedestrian walking behavior, which usually
requires larger fields. In the aspect of computation, the OpenCL heterogeneous
framework is thoroughly studied. Factors that may affect the numerical
efficiency are evaluated, with regarding to the social field model previously
proposed. This includes usage of local memory, deliberate patch of data
structures for avoidance of bank conflicts, and so on. Numerical experiments
disclose that the numerical efficiency is brought to an even higher level.
Compared to the CPU model and the previous GPU model, the current GPU model can
be at most 71.56 and 13.3 times faster respectively so that it is more
qualified to be a core engine for analysis of super-large scale crowd.
|
cs.DC cond-mat.other
|
two aspects of improvements are proposed for the openclbased implementation of the social field pedestrian model in the aspect of algorithm a method based on the idea of divideandconquer is devised in order to overcome the problem of global memory depletion when fields are of a larger size this is of importance for the study of finer pedestrian walking behavior which usually requires larger fields in the aspect of computation the opencl heterogeneous framework is thoroughly studied factors that may affect the numerical efficiency are evaluated with regarding to the social field model previously proposed this includes usage of local memory deliberate patch of data structures for avoidance of bank conflicts and so on numerical experiments disclose that the numerical efficiency is brought to an even higher level compared to the cpu model and the previous gpu model the current gpu model can be at most 7156 and 133 times faster respectively so that it is more qualified to be a core engine for analysis of superlarge scale crowd
|
[['two', 'aspects', 'of', 'improvements', 'are', 'proposed', 'for', 'the', 'openclbased', 'implementation', 'of', 'the', 'social', 'field', 'pedestrian', 'model', 'in', 'the', 'aspect', 'of', 'algorithm', 'a', 'method', 'based', 'on', 'the', 'idea', 'of', 'divideandconquer', 'is', 'devised', 'in', 'order', 'to', 'overcome', 'the', 'problem', 'of', 'global', 'memory', 'depletion', 'when', 'fields', 'are', 'of', 'a', 'larger', 'size', 'this', 'is', 'of', 'importance', 'for', 'the', 'study', 'of', 'finer', 'pedestrian', 'walking', 'behavior', 'which', 'usually', 'requires', 'larger', 'fields', 'in', 'the', 'aspect', 'of', 'computation', 'the', 'opencl', 'heterogeneous', 'framework', 'is', 'thoroughly', 'studied', 'factors', 'that', 'may', 'affect', 'the', 'numerical', 'efficiency', 'are', 'evaluated', 'with', 'regarding', 'to', 'the', 'social', 'field', 'model', 'previously', 'proposed', 'this', 'includes', 'usage', 'of', 'local', 'memory', 'deliberate', 'patch', 'of', 'data', 'structures', 'for', 'avoidance', 'of', 'bank', 'conflicts', 'and', 'so', 'on', 'numerical', 'experiments', 'disclose', 'that', 'the', 'numerical', 'efficiency', 'is', 'brought', 'to', 'an', 'even', 'higher', 'level', 'compared', 'to', 'the', 'cpu', 'model', 'and', 'the', 'previous', 'gpu', 'model', 'the', 'current', 'gpu', 'model', 'can', 'be', 'at', 'most', '7156', 'and', '133', 'times', 'faster', 'respectively', 'so', 'that', 'it', 'is', 'more', 'qualified', 'to', 'be', 'a', 'core', 'engine', 'for', 'analysis', 'of', 'superlarge', 'scale', 'crowd']]
|
[-0.09921140691689548, 0.03784764930129486, -0.07225548066794761, 0.047737789651970765, -0.07949489258351691, -0.11668990536210393, 0.033281294491774006, 0.3942138774048847, -0.22450513073722722, -0.35724779382525457, 0.11077371587868713, -0.22870537329193516, -0.12859589849332614, 0.22777236777169274, -0.060414227615269954, 0.05526732230195887, 0.07084526818930283, 0.04342870270400973, -0.017940281566032872, -0.2830875805105149, 0.2766913782418539, 0.10792048386619649, 0.30991831667987363, 0.07061781940172382, 0.07493445431949415, -0.07138187232859698, -0.039552333274124454, 0.03787360664240883, -0.048241411976700226, 0.14409180741044803, 0.22203618742337095, 0.1520341776721623, 0.3137502148553419, -0.46449388930618407, -0.20984329260370163, 0.06267126277366299, 0.13030906054717933, 0.09225406435282257, -0.019593029209967687, -0.2703681446991617, 0.15815623312941862, -0.17804576874533223, -0.08819991035575402, -0.07190256012559292, 0.017529537331678773, 0.01215007328816379, -0.2682491317037992, 0.06076176059182866, 0.041595339823591836, 0.05167914053890854, -0.018758162601097, -0.11745122369999687, 0.03319426902037646, 0.12672569153368213, 0.06805565500412956, 0.009730076052316386, 0.1554012743096488, -0.17027272629950727, -0.14620922316819251, 0.4179920540412977, -0.015622605398502423, -0.1997213255561378, 0.17971445189184687, -0.09182718526461117, -0.12008776323082634, 0.12749129736108616, 0.20679303433834798, 0.10671286167953872, -0.14206456199714185, 0.04731818757448179, -0.027739114572926025, 0.19373406705978727, 0.03367377337694745, 0.005273563030641526, 0.14901907512241797, 0.260265161179372, 0.04704235457549138, 0.1160695616341573, -0.08510613876396314, -0.16096593442350804, -0.23402491781217533, -0.1514090467577002, -0.17587378021562472, -0.025545462793421132, -0.11548458199667082, -0.12171471717080012, 0.3958425959683068, 0.22968007563793522, 0.17424304799697848, 0.060860564747209925, 0.32843204493457007, 0.08527063905993211, 0.12282724314302738, 0.08961740344031048, 0.2106442422082182, 0.02722541486755723, 0.11955655818192532, -0.2342295842300657, 0.068673127178391, 0.04513805370689148]
|
1,803.04783
|
A Scalable Near-Memory Architecture for Training Deep Neural Networks on
Large In-Memory Datasets
|
Most investigations into near-memory hardware accelerators for deep neural
networks have primarily focused on inference, while the potential of
accelerating training has received relatively little attention so far. Based on
an in-depth analysis of the key computational patterns in state-of-the-art
gradient-based training methods, we propose an efficient near-memory
acceleration engine called NTX that can be used to train state-of-the-art deep
convolutional neural networks at scale. Our main contributions are: (i) a loose
coupling of RISC-V cores and NTX co-processors reducing offloading overhead by
7x over previously published results; (ii) an optimized IEEE754 compliant data
path for fast high-precision convolutions and gradient propagation; (iii)
evaluation of near-memory computing with NTX embedded into residual area on the
Logic Base die of a Hybrid Memory Cube; and (iv) a scaling analysis to meshes
of HMCs in a data center scenario. We demonstrate a 2.7x energy efficiency
improvement of NTX over contemporary GPUs at 4.4x less silicon area, and a
compute performance of 1.2 Tflop/s for training large state-of-the-art networks
with full floating-point precision. At the data center scale, a mesh of NTX
achieves above 95% parallel and energy efficiency, while providing 2.1x energy
savings or 3.1x performance improvement over a GPU-based system.
|
cs.DC cs.AR
|
most investigations into nearmemory hardware accelerators for deep neural networks have primarily focused on inference while the potential of accelerating training has received relatively little attention so far based on an indepth analysis of the key computational patterns in stateoftheart gradientbased training methods we propose an efficient nearmemory acceleration engine called ntx that can be used to train stateoftheart deep convolutional neural networks at scale our main contributions are i a loose coupling of riscv cores and ntx coprocessors reducing offloading overhead by 7x over previously published results ii an optimized ieee754 compliant data path for fast highprecision convolutions and gradient propagation iii evaluation of nearmemory computing with ntx embedded into residual area on the logic base die of a hybrid memory cube and iv a scaling analysis to meshes of hmcs in a data center scenario we demonstrate a 27x energy efficiency improvement of ntx over contemporary gpus at 44x less silicon area and a compute performance of 12 tflops for training large stateoftheart networks with full floatingpoint precision at the data center scale a mesh of ntx achieves above 95 parallel and energy efficiency while providing 21x energy savings or 31x performance improvement over a gpubased system
|
[['most', 'investigations', 'into', 'nearmemory', 'hardware', 'accelerators', 'for', 'deep', 'neural', 'networks', 'have', 'primarily', 'focused', 'on', 'inference', 'while', 'the', 'potential', 'of', 'accelerating', 'training', 'has', 'received', 'relatively', 'little', 'attention', 'so', 'far', 'based', 'on', 'an', 'indepth', 'analysis', 'of', 'the', 'key', 'computational', 'patterns', 'in', 'stateoftheart', 'gradientbased', 'training', 'methods', 'we', 'propose', 'an', 'efficient', 'nearmemory', 'acceleration', 'engine', 'called', 'ntx', 'that', 'can', 'be', 'used', 'to', 'train', 'stateoftheart', 'deep', 'convolutional', 'neural', 'networks', 'at', 'scale', 'our', 'main', 'contributions', 'are', 'i', 'a', 'loose', 'coupling', 'of', 'riscv', 'cores', 'and', 'ntx', 'coprocessors', 'reducing', 'offloading', 'overhead', 'by', '7x', 'over', 'previously', 'published', 'results', 'ii', 'an', 'optimized', 'ieee754', 'compliant', 'data', 'path', 'for', 'fast', 'highprecision', 'convolutions', 'and', 'gradient', 'propagation', 'iii', 'evaluation', 'of', 'nearmemory', 'computing', 'with', 'ntx', 'embedded', 'into', 'residual', 'area', 'on', 'the', 'logic', 'base', 'die', 'of', 'a', 'hybrid', 'memory', 'cube', 'and', 'iv', 'a', 'scaling', 'analysis', 'to', 'meshes', 'of', 'hmcs', 'in', 'a', 'data', 'center', 'scenario', 'we', 'demonstrate', 'a', '27x', 'energy', 'efficiency', 'improvement', 'of', 'ntx', 'over', 'contemporary', 'gpus', 'at', '44x', 'less', 'silicon', 'area', 'and', 'a', 'compute', 'performance', 'of', '12', 'tflops', 'for', 'training', 'large', 'stateoftheart', 'networks', 'with', 'full', 'floatingpoint', 'precision', 'at', 'the', 'data', 'center', 'scale', 'a', 'mesh', 'of', 'ntx', 'achieves', 'above', '95', 'parallel', 'and', 'energy', 'efficiency', 'while', 'providing', '21x', 'energy', 'savings', 'or', '31x', 'performance', 'improvement', 'over', 'a', 'gpubased', 'system']]
|
[-0.12351326830568138, -0.0002137156880967291, -0.020358306957156066, 0.028411280270344133, -0.07041908330962661, -0.1701920874330248, 0.07107075692555778, 0.4352518435399137, -0.22013017883695118, -0.35689427411586194, 0.08888680968391498, -0.258148535558411, -0.07271547628047141, 0.25729404946311785, -0.08495266342666655, 0.0842903957493959, 0.16782861989782422, 0.006304990695602256, -0.08399053181793036, -0.2862506464554287, 0.2040369189566647, 0.1497314136271159, 0.34509485927246625, 0.03675358766811577, 0.13015292134620343, -0.07756011756885815, -0.010444348972833636, -0.01638385033394074, -0.04414679173599658, 0.17411372156118832, 0.24434781811567463, 0.16038628521576598, 0.3377094202213944, -0.45853822323582577, -0.2055208486260322, 0.06855441065594067, 0.17754698378307718, 0.04983342590802654, -0.06508343516973002, -0.25192483658691744, 0.12082691224708442, -0.1976997995071684, -0.00514896226176365, -0.09585511525765286, 0.00476608220862234, 0.0278833985940586, -0.2428948871941123, 0.015228691033494833, 0.03493325293401078, 0.09202648281826446, -0.002721652993464365, -0.16935333595248453, 0.04221587013845196, 0.07695261949565654, -0.04583888378780541, 0.09178124809281984, 0.15721736651559795, -0.15308906337077818, -0.1414494505023406, 0.33678003222255704, -0.05056136025200088, -0.15561623292174845, 0.16187543867155324, -0.025176788851514635, -0.1424987462335196, 0.16611457530271037, 0.26028749261088857, 0.07207643793180384, -0.12473393534076162, 0.05752533405051618, 0.05140486654203067, 0.2057792969286704, 0.0605443441028234, 0.016948335049393113, 0.16202915974778748, 0.30223376711540334, 0.053336667871551974, 0.10688644035043073, -0.14537558680863574, -0.10902587750262052, -0.20097499339895125, -0.14235062938389467, -0.16843276134172652, 0.025035901068297072, -0.12930679727945624, -0.1288391224356677, 0.3604897216954573, 0.15095574875600898, 0.15409573142056415, 0.143976458771875, 0.3802298513058592, 0.024385901891635777, 0.20116118104407685, 0.17316071128463326, 0.19526709430475472, 0.04255337081315761, 0.1536293391441931, -0.17671132532045497, 0.007714092023623873, 0.016597213309571784]
|
1,803.04784
|
Renewing computing paradigms for more efficient parallelization of
single-threads
|
Computing is still based on the 70-years old paradigms introduced by von
Neumann. The need for more performant, comfortable and safe computing forced to
develop and utilize several tricks both in hardware and software. Till now
technology enabled to increase performance without changing the basic computing
paradigms. The recent stalling of single-threaded computing performance,
however, requires to redesign computing to be able to provide the expected
performance. To do so, the computing paradigms themselves must be scrutinized.
The limitations caused by the too restrictive interpretation of the computing
paradigms are demonstrated, an extended computing paradigm introduced, ideas
about changing elements of the computing stack suggested, some implementation
details of both hardware and software discussed. The resulting new computing
stack offers considerably higher computing throughput, simplified hardware
architecture, drastically improved real-time behavior and in general,
simplified and more efficient computing stack.
|
cs.DC
|
computing is still based on the 70years old paradigms introduced by von neumann the need for more performant comfortable and safe computing forced to develop and utilize several tricks both in hardware and software till now technology enabled to increase performance without changing the basic computing paradigms the recent stalling of singlethreaded computing performance however requires to redesign computing to be able to provide the expected performance to do so the computing paradigms themselves must be scrutinized the limitations caused by the too restrictive interpretation of the computing paradigms are demonstrated an extended computing paradigm introduced ideas about changing elements of the computing stack suggested some implementation details of both hardware and software discussed the resulting new computing stack offers considerably higher computing throughput simplified hardware architecture drastically improved realtime behavior and in general simplified and more efficient computing stack
|
[['computing', 'is', 'still', 'based', 'on', 'the', '70years', 'old', 'paradigms', 'introduced', 'by', 'von', 'neumann', 'the', 'need', 'for', 'more', 'performant', 'comfortable', 'and', 'safe', 'computing', 'forced', 'to', 'develop', 'and', 'utilize', 'several', 'tricks', 'both', 'in', 'hardware', 'and', 'software', 'till', 'now', 'technology', 'enabled', 'to', 'increase', 'performance', 'without', 'changing', 'the', 'basic', 'computing', 'paradigms', 'the', 'recent', 'stalling', 'of', 'singlethreaded', 'computing', 'performance', 'however', 'requires', 'to', 'redesign', 'computing', 'to', 'be', 'able', 'to', 'provide', 'the', 'expected', 'performance', 'to', 'do', 'so', 'the', 'computing', 'paradigms', 'themselves', 'must', 'be', 'scrutinized', 'the', 'limitations', 'caused', 'by', 'the', 'too', 'restrictive', 'interpretation', 'of', 'the', 'computing', 'paradigms', 'are', 'demonstrated', 'an', 'extended', 'computing', 'paradigm', 'introduced', 'ideas', 'about', 'changing', 'elements', 'of', 'the', 'computing', 'stack', 'suggested', 'some', 'implementation', 'details', 'of', 'both', 'hardware', 'and', 'software', 'discussed', 'the', 'resulting', 'new', 'computing', 'stack', 'offers', 'considerably', 'higher', 'computing', 'throughput', 'simplified', 'hardware', 'architecture', 'drastically', 'improved', 'realtime', 'behavior', 'and', 'in', 'general', 'simplified', 'and', 'more', 'efficient', 'computing', 'stack']]
|
[-0.13658383769224391, 0.041701374866219956, -0.059658739382481514, 0.057325144858675736, -0.13636467479866185, -0.21714800834888592, 0.0626800541812889, 0.36657657294547547, -0.2676481318814184, -0.37157591095314824, 0.1261121519144437, -0.15687875511382687, -0.1458843037512877, 0.27827128968385834, -0.1439596480277883, 0.09987995813419814, 0.0785512895609768, -0.04258999967986966, -0.11171011039116185, -0.2864407004550662, 0.2300217346415567, 0.11959413400174473, 0.3356108889385736, 0.0817078368255882, 0.023504695339168578, -0.013957287791258783, -0.07497856196471685, 0.011754909687735838, -0.08247457638972526, 0.22287579430409593, 0.269656701060347, 0.2185704405285525, 0.3012370952143729, -0.5379308622276826, -0.14383720065192354, 0.08651554527216786, 0.1818086843301748, 0.05928043844308135, -0.06275228908886, -0.2630361524953259, 0.10983266424146487, -0.23487588365247353, -0.14730649680341426, -0.13445436186408424, 0.01954683994458948, -0.033573894250019935, -0.18734901430246106, -0.05969203805899341, 0.02404870054677879, 0.0451226711219592, 0.03416056200868631, -0.13439807079970273, 0.06073105624012595, 0.14079993510980615, -0.02361361160221101, 0.0016124341804400193, 0.2026466259049426, -0.1455343088249026, -0.15731554968523787, 0.38049965353160026, 0.010552002165613951, -0.17329114193110157, 0.21368129258194818, -0.004827249440089833, -0.13079127982231997, 0.09571695375748702, 0.13810381191454346, 0.02099884926507303, -0.19350999391389836, 0.08622010636123285, 0.13050717048400598, 0.13576621784017884, 0.04981877730167705, 0.0656974015262467, 0.19127149397688215, 0.20110898297958466, 0.05113693279978022, 0.11450570224107598, 0.002494652160919077, -0.14989601625732596, -0.17424504587547385, -0.14478466513972033, -0.15208183935836708, -0.005409414169760488, -0.036029516886157596, -0.17055716370642787, 0.34786231380304417, 0.2092088178527146, 0.11095048666750784, 0.08565212256047312, 0.42147339071756856, 0.09861715941978015, 0.14794070073972931, 0.18230970706723684, 0.1998141152198383, 0.060179534606072754, 0.18983642721093066, -0.1747180983765895, 0.08777207271581207, 0.01635503776458581]
|
1,803.04785
|
Model Oriented Scheduling Algorithm for The Hardware-In-The-Loop
Simulation
|
This paper presents an approach for designing software for dynamical systems
simulation. An algorithm is proposed to obtain a schedule for calculating each
phase variable of a stiff system of differential equations. The problem is
classified as a fixed-priority pre-emptive scheduling of periodic tasks. The
Branch-and-Bound algorithm is modified to minimize the defined utilization
function and to optimize the scheduling process for a numerical solver. A
program for the experimental schedule is implemented solving a job-shop problem
that proved the effectiveness of the proposed algorithm.
|
cs.DC
|
this paper presents an approach for designing software for dynamical systems simulation an algorithm is proposed to obtain a schedule for calculating each phase variable of a stiff system of differential equations the problem is classified as a fixedpriority preemptive scheduling of periodic tasks the branchandbound algorithm is modified to minimize the defined utilization function and to optimize the scheduling process for a numerical solver a program for the experimental schedule is implemented solving a jobshop problem that proved the effectiveness of the proposed algorithm
|
[['this', 'paper', 'presents', 'an', 'approach', 'for', 'designing', 'software', 'for', 'dynamical', 'systems', 'simulation', 'an', 'algorithm', 'is', 'proposed', 'to', 'obtain', 'a', 'schedule', 'for', 'calculating', 'each', 'phase', 'variable', 'of', 'a', 'stiff', 'system', 'of', 'differential', 'equations', 'the', 'problem', 'is', 'classified', 'as', 'a', 'fixedpriority', 'preemptive', 'scheduling', 'of', 'periodic', 'tasks', 'the', 'branchandbound', 'algorithm', 'is', 'modified', 'to', 'minimize', 'the', 'defined', 'utilization', 'function', 'and', 'to', 'optimize', 'the', 'scheduling', 'process', 'for', 'a', 'numerical', 'solver', 'a', 'program', 'for', 'the', 'experimental', 'schedule', 'is', 'implemented', 'solving', 'a', 'jobshop', 'problem', 'that', 'proved', 'the', 'effectiveness', 'of', 'the', 'proposed', 'algorithm']]
|
[-0.19093584211762338, -0.02771655319717384, -0.11687468093107728, 0.031455486910935554, -0.09722513198195135, -0.1937388823600486, 0.051352567840641475, 0.3640463748946786, -0.3022466201992596, -0.3393983544233967, 0.11944212378276621, -0.20853440273991403, -0.1720349346561467, 0.24129240828401902, -0.08486593687797293, 0.15830934990526122, 0.1000786438365193, -0.020661895807065508, -0.04465255022001015, -0.2871268541278208, 0.24290425584596745, 0.07842263866606278, 0.2712563260184491, 0.027776317495633574, 0.15211933032773872, 0.013561744711307042, -0.0007259817958316382, 0.012887108139693737, -0.07984960171272498, 0.05992440671440871, 0.3057929595165393, 0.1959961337640005, 0.3426043113803162, -0.3596154100672506, -0.19376557978856213, 0.09010090095484082, 0.14591381349463892, 0.0738839552463854, -0.054025058103177474, -0.24237600352395983, 0.13297575035077683, -0.16558358423850117, -0.08973114855368347, -0.0632128837682745, -0.0033112227588015446, 0.0017696319257511813, -0.36300392597913744, -0.022171187828130583, -0.0031110472720362902, -0.02271758646649473, -0.12679898245807955, -0.09557112156112185, 0.060922957584261896, 0.09822111986577511, -0.0024748020343181186, 0.05686072044841507, 0.09952718268066425, -0.07020660707562723, -0.20243942799758824, 0.4187675617196981, 0.013821333985063522, -0.23273899172679247, 0.0888120852465577, 0.07798694891526418, -0.16002614984617514, 0.14510327858083388, 0.25184156855239587, 0.1977863599162768, -0.20674633459352396, 0.03934484252308988, -0.032059830909266195, 0.16177220164852985, -0.008649701581281774, -0.06776840388227034, 0.09843683540821076, 0.28430622270988193, 0.14548110764692812, 0.2063814640045166, 0.00789235052652657, -0.12152870115550125, -0.25179199439418665, -0.17838953731252866, -0.20064351675374542, -0.06254875146893456, -0.05174906064246042, -0.18623740199734182, 0.39575019432779623, 0.1600514136693057, 0.10876885722665226, 0.13893170882399905, 0.3681925936602056, 0.1895188404890873, 0.009765054449877318, 0.12578600709162213, 0.13927090662695907, 0.05784273004049764, 0.14867774576825254, -0.3167380185907378, 0.06815257608507047, 0.10929517871426309]
|
1,803.04786
|
A Design Space Exploration Methodology for Parameter Optimization in
Multicore Processors
|
The need for application-specific design of multicore/manycore processing
platforms is evident with computing systems finding use in diverse application
domains. In order to tailor multicore/manycore processors for application
specific requirements, a multitude of processor design parameters have to be
tuned accordingly which involves rigorous and extensive design space
exploration over large search spaces. In this paper, we propose an efficient
methodology for design space exploration. We evaluate our methodology over two
search spaces - small and large, using a cycle-accurate simulator (ESESC) and a
standard set of PARSEC and SPLASH-2 benchmarks. For the smaller design space,
we compare results obtained from our design space exploration methodology with
results obtained from fully exhaustive search. The results show that solution
quality obtained from our methodology are within 1.35% - 3.69% of the results
obtained from fully exhaustive search while only exploring 2.74% - 3% of the
design space. For larger design space, we compare solution quality of different
results obtained by varying the number of tunable processor design parameters
included in the exhaustive search phase of our methodology. The results show
that including more number of tunable parameters in the exhaustive search phase
of our methodology greatly improves solution quality.
|
cs.DC cs.AR
|
the need for applicationspecific design of multicoremanycore processing platforms is evident with computing systems finding use in diverse application domains in order to tailor multicoremanycore processors for application specific requirements a multitude of processor design parameters have to be tuned accordingly which involves rigorous and extensive design space exploration over large search spaces in this paper we propose an efficient methodology for design space exploration we evaluate our methodology over two search spaces small and large using a cycleaccurate simulator esesc and a standard set of parsec and splash2 benchmarks for the smaller design space we compare results obtained from our design space exploration methodology with results obtained from fully exhaustive search the results show that solution quality obtained from our methodology are within 135 369 of the results obtained from fully exhaustive search while only exploring 274 3 of the design space for larger design space we compare solution quality of different results obtained by varying the number of tunable processor design parameters included in the exhaustive search phase of our methodology the results show that including more number of tunable parameters in the exhaustive search phase of our methodology greatly improves solution quality
|
[['the', 'need', 'for', 'applicationspecific', 'design', 'of', 'multicoremanycore', 'processing', 'platforms', 'is', 'evident', 'with', 'computing', 'systems', 'finding', 'use', 'in', 'diverse', 'application', 'domains', 'in', 'order', 'to', 'tailor', 'multicoremanycore', 'processors', 'for', 'application', 'specific', 'requirements', 'a', 'multitude', 'of', 'processor', 'design', 'parameters', 'have', 'to', 'be', 'tuned', 'accordingly', 'which', 'involves', 'rigorous', 'and', 'extensive', 'design', 'space', 'exploration', 'over', 'large', 'search', 'spaces', 'in', 'this', 'paper', 'we', 'propose', 'an', 'efficient', 'methodology', 'for', 'design', 'space', 'exploration', 'we', 'evaluate', 'our', 'methodology', 'over', 'two', 'search', 'spaces', 'small', 'and', 'large', 'using', 'a', 'cycleaccurate', 'simulator', 'esesc', 'and', 'a', 'standard', 'set', 'of', 'parsec', 'and', 'splash2', 'benchmarks', 'for', 'the', 'smaller', 'design', 'space', 'we', 'compare', 'results', 'obtained', 'from', 'our', 'design', 'space', 'exploration', 'methodology', 'with', 'results', 'obtained', 'from', 'fully', 'exhaustive', 'search', 'the', 'results', 'show', 'that', 'solution', 'quality', 'obtained', 'from', 'our', 'methodology', 'are', 'within', '135', '369', 'of', 'the', 'results', 'obtained', 'from', 'fully', 'exhaustive', 'search', 'while', 'only', 'exploring', '274', '3', 'of', 'the', 'design', 'space', 'for', 'larger', 'design', 'space', 'we', 'compare', 'solution', 'quality', 'of', 'different', 'results', 'obtained', 'by', 'varying', 'the', 'number', 'of', 'tunable', 'processor', 'design', 'parameters', 'included', 'in', 'the', 'exhaustive', 'search', 'phase', 'of', 'our', 'methodology', 'the', 'results', 'show', 'that', 'including', 'more', 'number', 'of', 'tunable', 'parameters', 'in', 'the', 'exhaustive', 'search', 'phase', 'of', 'our', 'methodology', 'greatly', 'improves', 'solution', 'quality']]
|
[-0.09477495541015986, 0.03307709687447341, -0.05185100516861247, -0.0016999000565811376, -0.09445587944085758, -0.11328376874990147, 0.09211685231973216, 0.41072633931864555, -0.2230933137506861, -0.418027536511498, 0.11710209969956831, -0.20917468431007272, -0.16107859778561218, 0.3046263112979413, -0.009235599569102615, 0.08015571428029605, 0.11755030123113665, -0.05848801571134113, -0.09587731687488205, -0.2555859747166342, 0.2700705953511246, 0.04404532168115748, 0.31038902301494914, -0.022387955577794424, 0.04797167299296131, 0.0041740502437250205, -0.08179606085873603, 0.012736268979125205, -0.15911079582690138, 0.16360041511499504, 0.27357149268884556, 0.19035501811730185, 0.27953441073330715, -0.3728303056229482, -0.1894992112473719, 0.07555745234928987, 0.13990838527703447, 0.07759486297781569, -0.0991309206209238, -0.31794636995176373, 0.09004275542359856, -0.16468862977512566, -0.08143458664225242, -0.16134485758879444, -0.027491277491808245, 0.01758803797318101, -0.2891792952294279, -0.057281814318764765, -0.015372738280554408, 0.047253892276935355, -0.086276385995569, -0.1519330928255756, 0.03377905131687324, 0.1284588994194283, -0.02511111011346994, 0.0454078211656714, 0.11849512162944782, -0.09629892020814988, -0.15980396512895823, 0.3829275487307651, -0.041259493048125206, -0.18912886439295445, 0.17680267738262384, -0.0753541351428025, -0.1370478405871611, 0.15306928779296192, 0.23631906887929233, 0.12161884998144179, -0.1341708523806991, 0.06034273864370147, -0.00020347519768113941, 0.19761328705461675, -0.0006989298710004263, 0.036473739702619384, 0.1439356925950107, 0.28034637092622283, 0.07926402219028701, 0.18079493255726514, -0.0555373994098285, -0.099053844040831, -0.2880707236592533, -0.1565990588752572, -0.1921768130964993, -0.03100635709010602, -0.12282113178564745, -0.12235156612317126, 0.38710778393331413, 0.23016660652711768, 0.1691768131094034, 0.08124190517977245, 0.317755612693535, 0.02107190662707243, 0.08754437989987356, 0.08648691792521127, 0.21076459340635956, -0.011903229365173304, 0.10639432998201281, -0.18515207468995287, 0.015220950904887976, 0.007861338581016153]
|
1,803.04787
|
One-bit massive MIMO precoding via a minimum symbol-error probability
design
|
Massive multiple-input multiple-output (MIMO) has the potential to
substantially improve the spectral efficiency, robustness and coverage of
mobile networks. However, such potential is limited by hardware cost and power
consumption associated with a large number of RF chains. Recently, one-bit
quantization is proposed to address this issue by replacing high-resolution
digital-to-analog converters (DACs) with one-bit DACs, thereby simplifying the
RF chains. Despite low system cost, advanced signal processing techniques are
needed to compensate for quantization distortions caused by low resolution
DACs. In this paper, a symbol-error-rate (SER)-based one-bit precoding scheme
is proposed to minimize the detection error probability of all users under
one-bit constraints. The problem is recast as a continuous optimization problem
with a biconvex objective. By applying the block coordinate descent (BCD)
method and the FISTA method, we develop an efficient iterative algorithm to
obtain a one-bit precoding solution. Simulation results demonstrate its
superiority over state-of-the-art algorithms in terms of bit error rate
performance in high-order modulation cases.
|
cs.IT math.IT
|
massive multipleinput multipleoutput mimo has the potential to substantially improve the spectral efficiency robustness and coverage of mobile networks however such potential is limited by hardware cost and power consumption associated with a large number of rf chains recently onebit quantization is proposed to address this issue by replacing highresolution digitaltoanalog converters dacs with onebit dacs thereby simplifying the rf chains despite low system cost advanced signal processing techniques are needed to compensate for quantization distortions caused by low resolution dacs in this paper a symbolerrorrate serbased onebit precoding scheme is proposed to minimize the detection error probability of all users under onebit constraints the problem is recast as a continuous optimization problem with a biconvex objective by applying the block coordinate descent bcd method and the fista method we develop an efficient iterative algorithm to obtain a onebit precoding solution simulation results demonstrate its superiority over stateoftheart algorithms in terms of bit error rate performance in highorder modulation cases
|
[['massive', 'multipleinput', 'multipleoutput', 'mimo', 'has', 'the', 'potential', 'to', 'substantially', 'improve', 'the', 'spectral', 'efficiency', 'robustness', 'and', 'coverage', 'of', 'mobile', 'networks', 'however', 'such', 'potential', 'is', 'limited', 'by', 'hardware', 'cost', 'and', 'power', 'consumption', 'associated', 'with', 'a', 'large', 'number', 'of', 'rf', 'chains', 'recently', 'onebit', 'quantization', 'is', 'proposed', 'to', 'address', 'this', 'issue', 'by', 'replacing', 'highresolution', 'digitaltoanalog', 'converters', 'dacs', 'with', 'onebit', 'dacs', 'thereby', 'simplifying', 'the', 'rf', 'chains', 'despite', 'low', 'system', 'cost', 'advanced', 'signal', 'processing', 'techniques', 'are', 'needed', 'to', 'compensate', 'for', 'quantization', 'distortions', 'caused', 'by', 'low', 'resolution', 'dacs', 'in', 'this', 'paper', 'a', 'symbolerrorrate', 'serbased', 'onebit', 'precoding', 'scheme', 'is', 'proposed', 'to', 'minimize', 'the', 'detection', 'error', 'probability', 'of', 'all', 'users', 'under', 'onebit', 'constraints', 'the', 'problem', 'is', 'recast', 'as', 'a', 'continuous', 'optimization', 'problem', 'with', 'a', 'biconvex', 'objective', 'by', 'applying', 'the', 'block', 'coordinate', 'descent', 'bcd', 'method', 'and', 'the', 'fista', 'method', 'we', 'develop', 'an', 'efficient', 'iterative', 'algorithm', 'to', 'obtain', 'a', 'onebit', 'precoding', 'solution', 'simulation', 'results', 'demonstrate', 'its', 'superiority', 'over', 'stateoftheart', 'algorithms', 'in', 'terms', 'of', 'bit', 'error', 'rate', 'performance', 'in', 'highorder', 'modulation', 'cases']]
|
[-0.21776242026438317, -0.023438667731250508, 0.0225371682486327, -0.014172082226547712, -0.08378856323231831, -0.24736897090344495, 0.07459209328766256, 0.41559691160753276, -0.26740677918325056, -0.30525849426586954, 0.14086669762311327, -0.2091897739501635, -0.19519965105789638, 0.1755207153095764, -0.19291503688777392, 0.14484053983099746, 0.10851366849581026, -0.016271614529625892, -0.09761017918771238, -0.2935525539547861, 0.2046807379236316, 0.18391747765371916, 0.3652957519882435, -0.05320086316740046, 0.1457507995113953, -0.0005168389403056237, -0.006339905118722023, -0.038306162798691284, -0.026805247701470206, 0.09214199483453196, 0.34022643809564085, 0.20177197691826326, 0.3367153827874166, -0.42932788846112274, -0.26896211630576905, 0.10619608546920566, 0.19421091623920597, 0.08880982929899257, -0.11705513692712821, -0.23741770170207294, 0.1721854287246535, -0.23017467749334355, 0.0031976440523124343, -0.045118055836467434, -0.12452482572118254, 0.06634264396805223, -0.3584169527668061, 0.050825169719989946, 0.0246476637706184, 0.026146260986350617, -0.036624405024215906, -0.13442168523536982, 0.07616203853204472, 0.055174461208611913, 0.0258637840616877, 0.03437282834729215, 0.09349135598519219, -0.08927095431904748, -0.1286320221323356, 0.3390597651402156, -0.016299064074929967, -0.2686603589908882, 0.12686367464140527, -0.045636614750918444, -0.09674690800474418, 0.21140973766351928, 0.22766563201684845, 0.08533185278797674, -0.1651650906295908, 0.07677174873178555, 0.07531052882015798, 0.19791598377878186, 0.07701665415200142, 0.12617830759933535, 0.12608069547967482, 0.20758514919862994, 0.14458490376515934, 0.15299987089058747, -0.1457113844577557, -0.06846885538642418, -0.15172768603869766, -0.12324342994955105, -0.2355401485451093, -0.006743247811858244, -0.09349810431461339, -0.05961812771095326, 0.3416386745957196, 0.16683687115931567, 0.1313717121905618, 0.13674210380095075, 0.4762178816651023, 0.15252311787137515, 0.0679082921552384, 0.08178287432324025, 0.16813345294981702, 0.17789358168740832, 0.14057347543007526, -0.287199232172303, 0.0067607828038129605, 0.05772664383897241]
|
1,803.04788
|
Efficient two-mode interferometers with spinor Bose-Einstein condensates
|
We consider general three-mode interferometers using a spin-1 atomic
Bose-Einstein condensate with macroscopic magnetization. We show that these
interferometers, combined with the measurement of the number of particles in
each output port, provide an ultra-high phase sensitivity. We construct
effective two-mode interferometers which involve two Zeeman modes showing that
they also provide an ultra-high phase sensitivity but of a bit reduced factor
in the corresponding Fisher information. A special case of zero magnetization
is shown to persist the efficiency of the two-mode interferometry.
|
cond-mat.quant-gas
|
we consider general threemode interferometers using a spin1 atomic boseeinstein condensate with macroscopic magnetization we show that these interferometers combined with the measurement of the number of particles in each output port provide an ultrahigh phase sensitivity we construct effective twomode interferometers which involve two zeeman modes showing that they also provide an ultrahigh phase sensitivity but of a bit reduced factor in the corresponding fisher information a special case of zero magnetization is shown to persist the efficiency of the twomode interferometry
|
[['we', 'consider', 'general', 'threemode', 'interferometers', 'using', 'a', 'spin1', 'atomic', 'boseeinstein', 'condensate', 'with', 'macroscopic', 'magnetization', 'we', 'show', 'that', 'these', 'interferometers', 'combined', 'with', 'the', 'measurement', 'of', 'the', 'number', 'of', 'particles', 'in', 'each', 'output', 'port', 'provide', 'an', 'ultrahigh', 'phase', 'sensitivity', 'we', 'construct', 'effective', 'twomode', 'interferometers', 'which', 'involve', 'two', 'zeeman', 'modes', 'showing', 'that', 'they', 'also', 'provide', 'an', 'ultrahigh', 'phase', 'sensitivity', 'but', 'of', 'a', 'bit', 'reduced', 'factor', 'in', 'the', 'corresponding', 'fisher', 'information', 'a', 'special', 'case', 'of', 'zero', 'magnetization', 'is', 'shown', 'to', 'persist', 'the', 'efficiency', 'of', 'the', 'twomode', 'interferometry']]
|
[-0.18368371648584908, 0.22812890514614992, -0.0740127694086138, 0.038099122094832, -0.0025434398586042673, -0.1650766053136034, 0.02487334231733827, 0.373871893501358, -0.21662048410893564, -0.26455914601683617, 0.0341283109527171, -0.24844540209307459, -0.1046919233322772, 0.1989580922737628, 0.006956383731799671, 0.06095542397394956, 0.07652110152552466, 0.034541719032771305, -0.0724988564167239, -0.2504078440777733, 0.2941686468344765, 0.04416884980108365, 0.2961203981168478, 0.004447869698416038, 0.14344144656311675, 0.006901193258677979, 0.045147982437208474, 0.010446729267532208, -0.13003538174260862, 0.041514472755412736, 0.25058161292199876, 0.07486908501350736, 0.2097191053431436, -0.4553982380059469, -0.1822059785116868, 0.14584047728812838, 0.12732661776917886, 0.20795210909115217, -0.032449433220976806, -0.31202631190991453, -0.04921492369542549, -0.18957215208694878, -0.14042534385190672, -0.1334719415697976, -0.05181530225707824, 0.020391419619680887, -0.28136166595820206, 0.06518462603331084, 0.029471662725849324, 0.05083172371139728, -0.009385703229738107, -0.0899073405469016, 0.016765078995376825, 0.04471920468249774, -0.057346939725004674, 0.008254240562926125, 0.11896764164010669, -0.15217167002160148, -0.12897118444958455, 0.33873713037829445, -0.1245877461547189, -0.19332784637584385, 0.12192355339830539, -0.18385506586272674, -0.07370811020843236, 0.11419653280565223, 0.12656857211322312, 0.07743940701573548, -0.10131193272185972, -0.0028765329260783024, -0.019703263663742917, 0.22645216412752509, 0.1170729924812464, 0.1510165130855594, 0.2398279628447111, 0.17903574348528342, 0.08228713941636932, 0.21398806162192544, -0.14434807516700388, -0.064615487313201, -0.28857170666444554, -0.15456214414191355, -0.22009074728913516, 0.09207250100437057, -0.09553924864943487, -0.14142854575240277, 0.3746864640501788, 0.1740640105051269, 0.1628896924049919, -0.002621089336911149, 0.324521217495203, 0.1538033193897411, 0.03053479360035026, 0.01907810328124338, 0.3241303493549307, 0.1700882434014635, 0.07370035579226103, -0.26344434381182114, -0.049329247679112544, -0.021662433238991773]
|
1,803.04789
|
Search for Baryon and Lepton Number Violation in
$J/\psi\to\Lambda_c^+e^-+c.c.$
|
Using $1.31\times10^9$ $J/\psi$ events collected by the BESIII detector at
the Beijing Electron Positron Collider, we search for the process
$J/\psi\to\Lambda_c^+e^-+c.c.$ for the first time. In this process, both baryon
and lepton number conservation is violated. No signal is found and the upper
limit on the branching fraction $\mathcal{B}(J/\psi\to\Lambda_c^+e^-+c.c.)$ is
set to be $6.9\times10^{-8}$ at the 90\% Confidence Level.
|
hep-ex
|
using 131times109 jpsi events collected by the besiii detector at the beijing electron positron collider we search for the process jpsitolambda_cecc for the first time in this process both baryon and lepton number conservation is violated no signal is found and the upper limit on the branching fraction mathcalbjpsitolambda_cecc is set to be 69times108 at the 90 confidence level
|
[['using', '131times109', 'jpsi', 'events', 'collected', 'by', 'the', 'besiii', 'detector', 'at', 'the', 'beijing', 'electron', 'positron', 'collider', 'we', 'search', 'for', 'the', 'process', 'jpsitolambda_cecc', 'for', 'the', 'first', 'time', 'in', 'this', 'process', 'both', 'baryon', 'and', 'lepton', 'number', 'conservation', 'is', 'violated', 'no', 'signal', 'is', 'found', 'and', 'the', 'upper', 'limit', 'on', 'the', 'branching', 'fraction', 'mathcalbjpsitolambda_cecc', 'is', 'set', 'to', 'be', '69times108', 'at', 'the', '90', 'confidence', 'level']]
|
[-0.08025792887721243, 0.19927079280439233, -0.05806450825184584, 0.1320870316436802, -0.024990968073585203, -0.05864839511923492, 0.11917949619237334, 0.27272294064251973, -0.1580597710063947, -0.32661725926612106, 0.04602375612219995, -0.413694699028773, 0.07135728387428182, 0.19766004990586744, 0.0749719918988246, 0.12606803259612726, 0.09592453002863165, 0.021919603276598667, 0.046800865375969024, -0.24869936982369317, 0.21333519704473605, 0.1443941523196242, 0.29229997414430336, 0.09632533931705568, 0.12170932574164388, -0.004514062502754054, -0.020828100403637757, -0.05664255723656554, -0.04942009074979329, 0.006507333251647651, 0.269298006626611, 0.17183030893128098, 0.14996132053368325, -0.38699483232838766, -0.0503507232850617, 0.1890621403830924, 0.1165415300222646, 0.05676337427991841, -0.06556941901674561, -0.338181815875162, 0.13975496521951364, -0.16302164826941276, -0.05985319152075265, 0.011950097949011251, 0.04024093617252739, -0.0856009056525571, -0.3109074019926733, 0.10459139854979835, -0.0558485224443887, 0.039539969887430616, -0.0016825477193508828, -0.157571821673108, -0.027348148432793096, -0.011640575124017363, 0.05602690892348099, 0.0462213830100414, 0.18473894988086872, -0.10268392493266479, -0.17448080810053007, 0.3420750472162451, -0.03582738015601145, -0.16419695160584524, 0.14751832115663482, -0.2947760021447071, -0.15503058762156538, 0.20787509524130396, 0.26820739213144407, 0.038258333407741575, -0.24320560830113078, 0.10213095736980904, -0.027256050596146712, 0.1683848214867924, 0.09707499442655328, 0.019451944463071413, 0.2109334349931617, 0.26360278182463454, 0.06499268688328032, 0.060045706555164155, -0.16736472658729845, 0.01192896207794547, -0.412910522626979, -0.13947183130741386, -0.15192640461360238, 0.04062218387844041, -0.003404475448665575, -0.020880631857185757, 0.363475028641655, 0.11679466847064239, 0.28418641815993134, 0.06258445578194889, 0.29449893800275667, 0.19944886944332602, 0.007027309885285961, 0.07071246490392825, 0.2766811839953464, 0.08810957681271248, 0.16007725248138222, -0.2281427803432702, 0.09832235050687034, 0.03469351931874241]
|
1,803.0479
|
Enhanced Word Representations for Bridging Anaphora Resolution
|
Most current models of word representations(e.g.,GloVe) have successfully
captured fine-grained semantics. However, semantic similarity exhibited in
these word embeddings is not suitable for resolving bridging anaphora, which
requires the knowledge of associative similarity (i.e., relatedness) instead of
semantic similarity information between synonyms or hypernyms. We create word
embeddings (embeddings_PP) to capture such relatedness by exploring the
syntactic structure of noun phrases. We demonstrate that using embeddings_PP
alone achieves around 30% of accuracy for bridging anaphora resolution on the
ISNotes corpus. Furthermore, we achieve a substantial gain over the
state-of-the-art system (Hou et al., 2013) for bridging antecedent selection.
|
cs.CL
|
most current models of word representationsegglove have successfully captured finegrained semantics however semantic similarity exhibited in these word embeddings is not suitable for resolving bridging anaphora which requires the knowledge of associative similarity ie relatedness instead of semantic similarity information between synonyms or hypernyms we create word embeddings embeddings_pp to capture such relatedness by exploring the syntactic structure of noun phrases we demonstrate that using embeddings_pp alone achieves around 30 of accuracy for bridging anaphora resolution on the isnotes corpus furthermore we achieve a substantial gain over the stateoftheart system hou et al 2013 for bridging antecedent selection
|
[['most', 'current', 'models', 'of', 'word', 'representationsegglove', 'have', 'successfully', 'captured', 'finegrained', 'semantics', 'however', 'semantic', 'similarity', 'exhibited', 'in', 'these', 'word', 'embeddings', 'is', 'not', 'suitable', 'for', 'resolving', 'bridging', 'anaphora', 'which', 'requires', 'the', 'knowledge', 'of', 'associative', 'similarity', 'ie', 'relatedness', 'instead', 'of', 'semantic', 'similarity', 'information', 'between', 'synonyms', 'or', 'hypernyms', 'we', 'create', 'word', 'embeddings', 'embeddings_pp', 'to', 'capture', 'such', 'relatedness', 'by', 'exploring', 'the', 'syntactic', 'structure', 'of', 'noun', 'phrases', 'we', 'demonstrate', 'that', 'using', 'embeddings_pp', 'alone', 'achieves', 'around', '30', 'of', 'accuracy', 'for', 'bridging', 'anaphora', 'resolution', 'on', 'the', 'isnotes', 'corpus', 'furthermore', 'we', 'achieve', 'a', 'substantial', 'gain', 'over', 'the', 'stateoftheart', 'system', 'hou', 'et', 'al', '2013', 'for', 'bridging', 'antecedent', 'selection']]
|
[-0.03242262972498986, -0.017489290417251276, -0.016311401362590332, 0.12392856351203939, -0.1848290570976926, -0.12089895834016831, 0.0973818812449958, 0.46668258325216616, -0.3213825653904078, -0.4099820569316123, -0.0619644265574839, -0.32066242923920457, -0.10430664086882818, 0.14555875437601687, -0.1422871539327118, 0.031648615024676745, 0.12609760829574487, 0.08172493805227048, -0.07706221186882875, -0.26156763671748734, 0.347291012183129, 0.05447736863007254, 0.3233147540248613, 0.0319703701992539, 0.16744269249326688, -0.04801781568428541, -0.1026566629942031, 0.0025660944309957483, -0.06361277414118299, 0.21977224707246779, 0.3752442641285365, 0.24689964470057252, 0.29858570522381034, -0.3419306673347316, -0.22546296079266578, 0.04187729930693403, 0.11849330478605438, 0.08146379690770893, -0.021521851144225754, -0.38494239555315135, 0.11329516041726667, -0.19178135236855248, 0.13832455314695835, -0.16501133459461656, 0.050683005158095915, 0.002066819246194543, -0.22383730718184838, 0.09090027479613398, 0.17692782832904064, 0.1358882931477212, -0.03969951815150203, -0.10943816818589186, -0.0004977234193381477, 0.19127353412307244, -0.03735585059714256, 0.050944330860573324, 0.06943924098889878, -0.17529802287908944, -0.17738290296550444, 0.36593985347513186, -0.047676493070692695, -0.2233329579392646, 0.2354519148654443, -0.05064497833657871, -0.14065269566081623, 0.06028216998489137, 0.1384288035729464, 0.05885183465904854, -0.13652437289327166, 0.025558009406829132, -0.07453454414907684, 0.28462828077534413, 0.21087998810640357, 0.0443640331331482, 0.20843727378412447, 0.2938676857726371, -0.03251144776190136, 0.06416595589488427, -0.09086134921551306, -0.046872622187947854, -0.1514101330441066, -0.16909221225750057, -0.17399152901340673, -0.04590127384026926, -0.14060428212495876, -0.13566406530902742, 0.37244012270202026, 0.22262374981445202, 0.20646235199664978, 0.10341960945825508, 0.22420836187542437, -0.026852228553678366, 0.12826746886477192, 0.08686077486887138, 0.1397055621912822, -0.011565895500949564, 0.08537446496886836, -0.15008785058942406, 0.14316942458080642, 0.13373325166213226]
|
1,803.04791
|
Genesis of the Floquet Hofstadter butterfly
|
We investigate theoretically the spectrum of a graphene-like sample
(honeycomb lattice) subjected to a perpendicular magnetic field and irradiated
by circularly polarized light. This system is studied using the Floquet
formalism, and the resulting Hofstadter spectrum is analyzed for different
regimes of the driving frequency. For lower frequencies, resonances of various
copies of the spectrum lead to intricate formations of topological gaps. In the
Landau-level regime, new wing-like gaps emerge upon reducing the driving
frequency, thus revealing the possibility of dynamically tuning the formation
of the Hofstadter butterfly. In this regime, an effective model may be
analytically derived, which allows us to retrace the energy levels that exhibit
avoided crossings and ultimately lead to gap structures with a wing-like shape.
At high frequencies, we find that gaps open for various fluxes at $E=0$, and
upon increasing the amplitude of the driving, gaps also close and reopen at
other energies. The topological invariants of these gaps are calculated and the
resulting spectrum is elucidated. We suggest opportunities for experimental
realization and discuss similarities with Landau-level structures in non-driven
systems.
|
cond-mat.mes-hall
|
we investigate theoretically the spectrum of a graphenelike sample honeycomb lattice subjected to a perpendicular magnetic field and irradiated by circularly polarized light this system is studied using the floquet formalism and the resulting hofstadter spectrum is analyzed for different regimes of the driving frequency for lower frequencies resonances of various copies of the spectrum lead to intricate formations of topological gaps in the landaulevel regime new winglike gaps emerge upon reducing the driving frequency thus revealing the possibility of dynamically tuning the formation of the hofstadter butterfly in this regime an effective model may be analytically derived which allows us to retrace the energy levels that exhibit avoided crossings and ultimately lead to gap structures with a winglike shape at high frequencies we find that gaps open for various fluxes at e0 and upon increasing the amplitude of the driving gaps also close and reopen at other energies the topological invariants of these gaps are calculated and the resulting spectrum is elucidated we suggest opportunities for experimental realization and discuss similarities with landaulevel structures in nondriven systems
|
[['we', 'investigate', 'theoretically', 'the', 'spectrum', 'of', 'a', 'graphenelike', 'sample', 'honeycomb', 'lattice', 'subjected', 'to', 'a', 'perpendicular', 'magnetic', 'field', 'and', 'irradiated', 'by', 'circularly', 'polarized', 'light', 'this', 'system', 'is', 'studied', 'using', 'the', 'floquet', 'formalism', 'and', 'the', 'resulting', 'hofstadter', 'spectrum', 'is', 'analyzed', 'for', 'different', 'regimes', 'of', 'the', 'driving', 'frequency', 'for', 'lower', 'frequencies', 'resonances', 'of', 'various', 'copies', 'of', 'the', 'spectrum', 'lead', 'to', 'intricate', 'formations', 'of', 'topological', 'gaps', 'in', 'the', 'landaulevel', 'regime', 'new', 'winglike', 'gaps', 'emerge', 'upon', 'reducing', 'the', 'driving', 'frequency', 'thus', 'revealing', 'the', 'possibility', 'of', 'dynamically', 'tuning', 'the', 'formation', 'of', 'the', 'hofstadter', 'butterfly', 'in', 'this', 'regime', 'an', 'effective', 'model', 'may', 'be', 'analytically', 'derived', 'which', 'allows', 'us', 'to', 'retrace', 'the', 'energy', 'levels', 'that', 'exhibit', 'avoided', 'crossings', 'and', 'ultimately', 'lead', 'to', 'gap', 'structures', 'with', 'a', 'winglike', 'shape', 'at', 'high', 'frequencies', 'we', 'find', 'that', 'gaps', 'open', 'for', 'various', 'fluxes', 'at', 'e0', 'and', 'upon', 'increasing', 'the', 'amplitude', 'of', 'the', 'driving', 'gaps', 'also', 'close', 'and', 'reopen', 'at', 'other', 'energies', 'the', 'topological', 'invariants', 'of', 'these', 'gaps', 'are', 'calculated', 'and', 'the', 'resulting', 'spectrum', 'is', 'elucidated', 'we', 'suggest', 'opportunities', 'for', 'experimental', 'realization', 'and', 'discuss', 'similarities', 'with', 'landaulevel', 'structures', 'in', 'nondriven', 'systems']]
|
[-0.1918183939133802, 0.19994402025818755, -0.07225120269034184, 0.08077540226199591, -0.022407802742686164, -0.1197604501478994, 0.08099864215035452, 0.39879576658850974, -0.2858803753055674, -0.3351915922340299, 0.02449247000406737, -0.2360021578432669, -0.1443797172089055, 0.20664348768127894, 0.02135714997924613, 0.01389422615547926, 0.031354773148051934, -0.049767080549244884, -0.04231698483260076, -0.15194303399276282, 0.33063005818723795, 0.07657506722130217, 0.30605794884934184, 0.08345454765400023, 0.0029134760725866545, -0.030848666240743707, 0.049475947810922946, -0.0003839552773978938, -0.15793552958405527, 0.09686262257595997, 0.22368371561352748, -0.03922996266870602, 0.17908620430690267, -0.42237054076799674, -0.2053919437896, 0.03309498225035292, 0.16044829662606705, 0.129462865803239, -0.04420839582329218, -0.2808985755035884, 0.06722732877268539, -0.1370092535148155, -0.1847880969812905, -0.09122685680500744, 0.01716833636086183, 0.0035346866169358405, -0.22153839709373255, 0.06356758706100296, 0.025548796920273245, 0.056045492090745254, -0.10257393297813885, -0.10261020821282442, -0.046601633176343575, 0.1276106081740784, 0.037445585873939216, -0.027108456329913454, 0.10084163891988691, -0.1463177736372467, -0.11589149892685956, 0.37129431296391097, -0.035136270633731245, -0.11233925406057178, 0.20194403671664762, -0.18218825239128317, -0.09447690207783259, 0.17127464655158894, 0.12701194700157123, 0.04697170208000285, -0.07156300515831145, 0.09398780186860717, 0.010772621655428593, 0.14533958759674218, 0.10119494503060503, 0.10197924444938518, 0.27990126362844797, 0.12684399238264377, 0.05291249494465968, 0.17520710345837706, -0.10810018683655523, -0.07655035213337102, -0.21991667100045245, -0.08266238683265757, -0.1726724588576432, 0.02804904393433185, -0.04020131192782572, -0.1641004308548055, 0.47475759800146805, 0.1398070960330484, 0.2189558272085184, -0.006871083089045191, 0.24538679437952512, 0.1765077355202664, 0.05532022850755393, 0.05807881549803875, 0.25955144569259453, 0.12623588125132484, 0.08608384710590072, -0.2824606844982697, -0.01291866000696593, -0.023578635157933563]
|
1,803.04792
|
Testing Deep Neural Networks
|
Deep neural networks (DNNs) have a wide range of applications, and software
employing them must be thoroughly tested, especially in safety-critical
domains. However, traditional software test coverage metrics cannot be applied
directly to DNNs. In this paper, inspired by the MC/DC coverage criterion, we
propose a family of four novel test criteria that are tailored to structural
features of DNNs and their semantics. We validate the criteria by demonstrating
that the generated test inputs guided via our proposed coverage criteria are
able to capture undesired behaviours in a DNN. Test cases are generated using a
symbolic approach and a gradient-based heuristic search. By comparing them with
existing methods, we show that our criteria achieve a balance between their
ability to find bugs (proxied using adversarial examples) and the computational
cost of test case generation. Our experiments are conducted on state-of-the-art
DNNs obtained using popular open source datasets, including MNIST, CIFAR-10 and
ImageNet.
|
cs.LG cs.CV cs.SE
|
deep neural networks dnns have a wide range of applications and software employing them must be thoroughly tested especially in safetycritical domains however traditional software test coverage metrics cannot be applied directly to dnns in this paper inspired by the mcdc coverage criterion we propose a family of four novel test criteria that are tailored to structural features of dnns and their semantics we validate the criteria by demonstrating that the generated test inputs guided via our proposed coverage criteria are able to capture undesired behaviours in a dnn test cases are generated using a symbolic approach and a gradientbased heuristic search by comparing them with existing methods we show that our criteria achieve a balance between their ability to find bugs proxied using adversarial examples and the computational cost of test case generation our experiments are conducted on stateoftheart dnns obtained using popular open source datasets including mnist cifar10 and imagenet
|
[['deep', 'neural', 'networks', 'dnns', 'have', 'a', 'wide', 'range', 'of', 'applications', 'and', 'software', 'employing', 'them', 'must', 'be', 'thoroughly', 'tested', 'especially', 'in', 'safetycritical', 'domains', 'however', 'traditional', 'software', 'test', 'coverage', 'metrics', 'can', 'not', 'be', 'applied', 'directly', 'to', 'dnns', 'in', 'this', 'paper', 'inspired', 'by', 'the', 'mcdc', 'coverage', 'criterion', 'we', 'propose', 'a', 'family', 'of', 'four', 'novel', 'test', 'criteria', 'that', 'are', 'tailored', 'to', 'structural', 'features', 'of', 'dnns', 'and', 'their', 'semantics', 'we', 'validate', 'the', 'criteria', 'by', 'demonstrating', 'that', 'the', 'generated', 'test', 'inputs', 'guided', 'via', 'our', 'proposed', 'coverage', 'criteria', 'are', 'able', 'to', 'capture', 'undesired', 'behaviours', 'in', 'a', 'dnn', 'test', 'cases', 'are', 'generated', 'using', 'a', 'symbolic', 'approach', 'and', 'a', 'gradientbased', 'heuristic', 'search', 'by', 'comparing', 'them', 'with', 'existing', 'methods', 'we', 'show', 'that', 'our', 'criteria', 'achieve', 'a', 'balance', 'between', 'their', 'ability', 'to', 'find', 'bugs', 'proxied', 'using', 'adversarial', 'examples', 'and', 'the', 'computational', 'cost', 'of', 'test', 'case', 'generation', 'our', 'experiments', 'are', 'conducted', 'on', 'stateoftheart', 'dnns', 'obtained', 'using', 'popular', 'open', 'source', 'datasets', 'including', 'mnist', 'cifar10', 'and', 'imagenet']]
|
[-0.0407556558873967, -0.042637974216512955, -0.0666510819973351, 0.10002250127491291, -0.08864630575693559, -0.19409618642960302, 0.06379017391123389, 0.46784105867731807, -0.2182708530796363, -0.3756120397520611, 0.10355735625965168, -0.24374551224077937, -0.20210825132352173, 0.27046006956454244, -0.10620138836184553, 0.15045157415500165, 0.1487857935352105, -0.039289383270954284, -0.06930209953509868, -0.3388505013320242, 0.2921049058082775, 0.04558842769330154, 0.3457943295017174, 0.042423785193914584, 0.0738197032276528, -0.09148840987263551, -0.031025160799484724, 0.04512841899558897, -0.08262862064383941, 0.15802509996437414, 0.3155991947658823, 0.23487078916780602, 0.3158160381846958, -0.4070080645333708, -0.2258885853674287, 0.10237738774675462, 0.1050906882870918, 0.07712843058582508, -0.04820905703506463, -0.36687921059281364, 0.15745111626079855, -0.17457101951517603, -0.010639531385903764, -0.20923540619007172, -0.06262924306374652, 0.06486785648926313, -0.28472953316834726, -0.0063490177751244865, 0.06410874132359144, 0.09063525567306023, -0.02302112459856408, -0.10840577237137587, 0.005426237866392031, 0.1372670266059002, 0.02910313615271079, 3.85610847825221e-05, 0.15348398826941786, -0.15648985108066946, -0.19208650355489035, 0.3518052616539363, -0.0437256188506224, -0.2288992471686333, 0.24993316081102962, 0.019230527085026886, -0.11913980651659027, 0.06267703716259669, 0.23907636588110642, 0.1539935069858687, -0.18263232390840653, 0.01809626549301255, 0.0037303815833201596, 0.17829021809278725, 0.08135419876278177, -0.0190948115637392, 0.16670291848614618, 0.2291708125008477, -0.01914424068649038, 0.18605370920461914, -0.11767314376158859, -0.0755170725074481, -0.21456852734767606, -0.068301872630281, -0.1727656130465904, -0.031214990840180094, -0.07320256202641093, -0.11228579136822982, 0.4028095069517887, 0.24486048317824802, 0.16956898112008287, 0.1277819473564235, 0.32484112507009305, 0.02713309334354396, 0.11963030810875352, 0.09692639465370745, 0.22012020171516472, 0.007350786902570452, 0.08456000861912674, -0.14723314584713745, 0.0709085620732771, 0.005184710336228211]
|
1,803.04793
|
Low Rank Variation Dictionary and Inverse Projection Group Sparse
Representation Model for Breast Tumor Classification
|
Sparse representation classification achieves good results by addressing
recognition problem with sufficient training samples per subject. However, SRC
performs not very well for small sample data. In this paper, an
inverse-projection group sparse representation model is presented for breast
tumor classification, which is based on constructing low-rank variation
dictionary. The proposed low-rank variation dictionary tackles tumor
recognition problem from the viewpoint of detecting and using variations in
gene expression profiles of normal and patients, rather than directly using
these samples. The inverse projection group sparsity representation model is
constructed based on taking full using of exist samples and group effect of
microarray gene data. Extensive experiments on public breast tumor microarray
gene expression datasets demonstrate the proposed technique is competitive with
state-of-the-art methods. The results of Breast-1, Breast-2 and Breast-3
databases are 80.81%, 89.10% and 100% respectively, which are better than the
latest literature.
|
cs.CV
|
sparse representation classification achieves good results by addressing recognition problem with sufficient training samples per subject however src performs not very well for small sample data in this paper an inverseprojection group sparse representation model is presented for breast tumor classification which is based on constructing lowrank variation dictionary the proposed lowrank variation dictionary tackles tumor recognition problem from the viewpoint of detecting and using variations in gene expression profiles of normal and patients rather than directly using these samples the inverse projection group sparsity representation model is constructed based on taking full using of exist samples and group effect of microarray gene data extensive experiments on public breast tumor microarray gene expression datasets demonstrate the proposed technique is competitive with stateoftheart methods the results of breast1 breast2 and breast3 databases are 8081 8910 and 100 respectively which are better than the latest literature
|
[['sparse', 'representation', 'classification', 'achieves', 'good', 'results', 'by', 'addressing', 'recognition', 'problem', 'with', 'sufficient', 'training', 'samples', 'per', 'subject', 'however', 'src', 'performs', 'not', 'very', 'well', 'for', 'small', 'sample', 'data', 'in', 'this', 'paper', 'an', 'inverseprojection', 'group', 'sparse', 'representation', 'model', 'is', 'presented', 'for', 'breast', 'tumor', 'classification', 'which', 'is', 'based', 'on', 'constructing', 'lowrank', 'variation', 'dictionary', 'the', 'proposed', 'lowrank', 'variation', 'dictionary', 'tackles', 'tumor', 'recognition', 'problem', 'from', 'the', 'viewpoint', 'of', 'detecting', 'and', 'using', 'variations', 'in', 'gene', 'expression', 'profiles', 'of', 'normal', 'and', 'patients', 'rather', 'than', 'directly', 'using', 'these', 'samples', 'the', 'inverse', 'projection', 'group', 'sparsity', 'representation', 'model', 'is', 'constructed', 'based', 'on', 'taking', 'full', 'using', 'of', 'exist', 'samples', 'and', 'group', 'effect', 'of', 'microarray', 'gene', 'data', 'extensive', 'experiments', 'on', 'public', 'breast', 'tumor', 'microarray', 'gene', 'expression', 'datasets', 'demonstrate', 'the', 'proposed', 'technique', 'is', 'competitive', 'with', 'stateoftheart', 'methods', 'the', 'results', 'of', 'breast1', 'breast2', 'and', 'breast3', 'databases', 'are', '8081', '8910', 'and', '100', 'respectively', 'which', 'are', 'better', 'than', 'the', 'latest', 'literature']]
|
[0.0016365739716483014, -0.035975062287408426, -0.026279614652906146, 0.06398903692523683, -0.09675109258054622, -0.15119460770594223, 0.025151020954529354, 0.41873237168682476, -0.21148826596327125, -0.3270551438975547, 0.11880332051743088, -0.3052983083096998, -0.19069778436262694, 0.23430095417092422, -0.13025880843758517, 0.06613491278673922, 0.1746143825352192, 0.04815945078236317, -0.05018361993799252, -0.30894502758248044, 0.2875071296119131, 0.05584037433977106, 0.40531066580276404, -0.024115690924892467, 0.13907754759337487, -0.02657967095230041, -0.09157125541075532, -0.0054624397091434474, -0.04722493743923094, 0.1881233563297428, 0.3436122547452604, 0.23852458636475993, 0.2662653458171657, -0.4100168666999317, -0.20591181909050127, 0.10959842853813566, 0.1521868794108741, 0.13378524760908997, -0.0716352031092226, -0.3458135177780475, 0.09543654378836176, -0.11496150269771793, 0.04216371273588655, -0.13461289953972613, -0.0136253457017509, -0.04200437493855134, -0.3376663670775348, 0.17502762595291382, 0.0056315270210948905, 0.14113964363101072, -0.11630727583542466, -0.19413361767573015, 0.054352644662971475, 0.1593264875634174, 0.06803863621815773, 0.05843237972419177, 0.14882927371800178, -0.1399935240042396, -0.12332185599121398, 0.3447211758233607, -0.028120208735552817, -0.20971550215867216, 0.16922881011851132, -0.08555356727447361, -0.1356931087128552, 0.1394571200478822, 0.1893079940595531, 0.11240983296717916, -0.19353559423803485, 0.025567971992755442, -0.08361288495860728, 0.20649607854013863, 0.07011586493712717, -0.05238574190464403, 0.08291483208636886, 0.28078217448533643, 0.011128556136307971, 0.11401826569677463, -0.16839912814986227, -0.009575570321508816, -0.18974280402596508, -0.04163074323940756, -0.21625903996838522, -0.05160361639313383, -0.14706646266141823, -0.14964107617103894, 0.3912127050770713, 0.12506870186355498, 0.18832905351051263, 0.10773304485483096, 0.32281335036137276, 0.011713396138968943, 0.10330929640414459, 0.03601672227627465, 0.12129419148467215, 0.08346577179784487, 0.02900258894935957, -0.22375890425838796, 0.10892892925101998, 0.059044848472279095]
|
1,803.04794
|
OH absorption in the first quadrant of the Milky Way as seen by THOR
|
The hydroxyl radical (OH) is present in the diffuse molecular and partially
atomic phases of the interstellar medium (ISM), but its abundance relative to
hydrogen is not clear. We aim to evaluate the abundance of OH with respect to
molecular hydrogen using OH absorption against cm-continuum sources over the
first Galactic quadrant. This OH study is part of the HI/OH/Recombination line
survey (THOR). THOR is a Karl G. Jansky Very Large Array large program of
atomic, molecular and ionized gas in the range 15{\deg}$\leq$l$\leq$67{\deg}
and |b|$\leq$1{\deg}. It is the highest-resolution unbiased OH absorption
survey to date towards this region. We combine the derived optical depths with
literature 13CO(1-0) and HI observations to determine the OH abundance. We
detect absorption in the 1665 and 1667 MHz transitions for continuum sources
stronger than $F_{\rm cont}\geq$0.1 Jy/beam. OH absorption is found against
$\sim$15% of these continuum sources with increasing fractions for stronger
sources. Most of the absorption is associated with Galactic HII regions. We
find OH and 13CO gas to have similar kinematic properties. The OH abundance
decreases with increasing hydrogen column density. The OH abundance with
respect to the total hydrogen nuclei column density (atomic and molecular
phase) is in agreement with a constant abundance for $A_V$ < 10-20. Towards the
lowest column densities, we find sources that exhibit OH absorption but no 13CO
emission, indicating that OH is a well suited tracer of the low column density
molecular gas. We present spatially resolved OH absorption towards W43. The
unbiased nature of the THOR survey opens a new window onto the gas properties
of the ISM. The characterization of the OH abundance over a large range of
hydrogen gas column densities contributes to the understanding of OH as a
molecular gas tracer and provides a starting point for future investigations.
|
astro-ph.GA
|
the hydroxyl radical oh is present in the diffuse molecular and partially atomic phases of the interstellar medium ism but its abundance relative to hydrogen is not clear we aim to evaluate the abundance of oh with respect to molecular hydrogen using oh absorption against cmcontinuum sources over the first galactic quadrant this oh study is part of the hiohrecombination line survey thor thor is a karl g jansky very large array large program of atomic molecular and ionized gas in the range 15degleqlleq67deg and bleq1deg it is the highestresolution unbiased oh absorption survey to date towards this region we combine the derived optical depths with literature 13co10 and hi observations to determine the oh abundance we detect absorption in the 1665 and 1667 mhz transitions for continuum sources stronger than f_rm contgeq01 jybeam oh absorption is found against sim15 of these continuum sources with increasing fractions for stronger sources most of the absorption is associated with galactic hii regions we find oh and 13co gas to have similar kinematic properties the oh abundance decreases with increasing hydrogen column density the oh abundance with respect to the total hydrogen nuclei column density atomic and molecular phase is in agreement with a constant abundance for a_v 1020 towards the lowest column densities we find sources that exhibit oh absorption but no 13co emission indicating that oh is a well suited tracer of the low column density molecular gas we present spatially resolved oh absorption towards w43 the unbiased nature of the thor survey opens a new window onto the gas properties of the ism the characterization of the oh abundance over a large range of hydrogen gas column densities contributes to the understanding of oh as a molecular gas tracer and provides a starting point for future investigations
|
[['the', 'hydroxyl', 'radical', 'oh', 'is', 'present', 'in', 'the', 'diffuse', 'molecular', 'and', 'partially', 'atomic', 'phases', 'of', 'the', 'interstellar', 'medium', 'ism', 'but', 'its', 'abundance', 'relative', 'to', 'hydrogen', 'is', 'not', 'clear', 'we', 'aim', 'to', 'evaluate', 'the', 'abundance', 'of', 'oh', 'with', 'respect', 'to', 'molecular', 'hydrogen', 'using', 'oh', 'absorption', 'against', 'cmcontinuum', 'sources', 'over', 'the', 'first', 'galactic', 'quadrant', 'this', 'oh', 'study', 'is', 'part', 'of', 'the', 'hiohrecombination', 'line', 'survey', 'thor', 'thor', 'is', 'a', 'karl', 'g', 'jansky', 'very', 'large', 'array', 'large', 'program', 'of', 'atomic', 'molecular', 'and', 'ionized', 'gas', 'in', 'the', 'range', '15degleqlleq67deg', 'and', 'bleq1deg', 'it', 'is', 'the', 'highestresolution', 'unbiased', 'oh', 'absorption', 'survey', 'to', 'date', 'towards', 'this', 'region', 'we', 'combine', 'the', 'derived', 'optical', 'depths', 'with', 'literature', '13co10', 'and', 'hi', 'observations', 'to', 'determine', 'the', 'oh', 'abundance', 'we', 'detect', 'absorption', 'in', 'the', '1665', 'and', '1667', 'mhz', 'transitions', 'for', 'continuum', 'sources', 'stronger', 'than', 'f_rm', 'contgeq01', 'jybeam', 'oh', 'absorption', 'is', 'found', 'against', 'sim15', 'of', 'these', 'continuum', 'sources', 'with', 'increasing', 'fractions', 'for', 'stronger', 'sources', 'most', 'of', 'the', 'absorption', 'is', 'associated', 'with', 'galactic', 'hii', 'regions', 'we', 'find', 'oh', 'and', '13co', 'gas', 'to', 'have', 'similar', 'kinematic', 'properties', 'the', 'oh', 'abundance', 'decreases', 'with', 'increasing', 'hydrogen', 'column', 'density', 'the', 'oh', 'abundance', 'with', 'respect', 'to', 'the', 'total', 'hydrogen', 'nuclei', 'column', 'density', 'atomic', 'and', 'molecular', 'phase', 'is', 'in', 'agreement', 'with', 'a', 'constant', 'abundance', 'for', 'a_v', '1020', 'towards', 'the', 'lowest', 'column', 'densities', 'we', 'find', 'sources', 'that', 'exhibit', 'oh', 'absorption', 'but', 'no', '13co', 'emission', 'indicating', 'that', 'oh', 'is', 'a', 'well', 'suited', 'tracer', 'of', 'the', 'low', 'column', 'density', 'molecular', 'gas', 'we', 'present', 'spatially', 'resolved', 'oh', 'absorption', 'towards', 'w43', 'the', 'unbiased', 'nature', 'of', 'the', 'thor', 'survey', 'opens', 'a', 'new', 'window', 'onto', 'the', 'gas', 'properties', 'of', 'the', 'ism', 'the', 'characterization', 'of', 'the', 'oh', 'abundance', 'over', 'a', 'large', 'range', 'of', 'hydrogen', 'gas', 'column', 'densities', 'contributes', 'to', 'the', 'understanding', 'of', 'oh', 'as', 'a', 'molecular', 'gas', 'tracer', 'and', 'provides', 'a', 'starting', 'point', 'for', 'future', 'investigations']]
|
[-0.05841179822586277, 0.0641487366186118, 0.036740732548516813, 0.008345143050638762, -0.0054669496750319214, -0.0394562729189344, 0.08406318617156634, 0.5000047988604767, -0.16961813189592706, -0.3024268011366249, 0.016891976687723433, -0.2790958062084487, 0.012696075990220768, 0.1092534669011008, 0.05192622367535431, -0.05088433876825153, -0.011897995905098806, -0.16535903400751054, -0.01789356131621544, -0.173994535699474, 0.24945626057900563, 0.13924802673913844, 0.17334059450833791, 0.05726708583263585, 0.03296548484347017, -0.1785406235394103, -0.12084565264150603, -0.022647393282515603, -0.1659034451061233, 0.13508729627383, 0.3050908539388583, 0.08514454854022928, 0.17711664287614995, -0.3487203144563724, -0.22739702455124122, 0.08485190001866262, 0.14635234645769674, 0.13467700932406956, -0.04576094880058039, -0.27537884620660374, 0.00030766357647878063, -0.14967787071884492, -0.22637601569374394, 0.04369726625836133, 0.07082074831967773, 0.0641992148560227, -0.19346116586833073, 0.13249089140421155, -0.063859606211652, 0.1304068241829415, -0.09124082513034357, -0.1766649898095533, -0.08026647905313725, 0.0434768290374962, -0.059248659409719295, 0.09678839857184643, 0.2559922345859911, -0.1344004888442866, 0.04268844866705582, 0.4578168934255635, -0.16981116259009094, 0.017342526185939743, 0.2660083468429706, -0.21965597842510276, -0.2606117841136028, 0.2737869147601483, 0.07089431460393726, 0.07639533707334854, -0.1105059176181211, 0.005992784622660123, -0.08956641507765704, 0.2485932342318934, 0.07616794254764304, 0.07797697291936652, 0.27541882219587677, 0.05240542123033808, 0.13646243534642097, 0.12278687255536508, -0.250322227514271, -0.04728686868353372, -0.19687765841016708, -0.18244943752052079, -0.10314242944674433, 0.08655336521866488, -0.07769943711883467, -0.08963979800122888, 0.2883470253144795, 0.09340087668148764, 0.23677747745329908, 0.027308277394813278, 0.3481174936143001, 0.08739695054202408, 0.04536019918610542, 0.08119933328626251, 0.2759168882291675, 0.24585343995242803, 0.08237978772565392, -0.259320855107311, 0.1160113015418726, 0.004918922257765416]
|
1,803.04795
|
Zee-Babu type model with $U(1)_{L_\mu - L_\tau}$ gauge symmetry
|
We extend the Zee-Babu model introducing local $U(1)_{L_\mu - L_\tau}$
symmetry with several singly-charged bosons. We find a predictive neutrino mass
texture in a simple hypothesis that mixings among singly-charged bosons are
negligible. Also lepton flavor violations are less constrained compared with
the original model. Then we explore testability of the model focussing on a
doubly-charged boson physics at the LHC and the ILC.
|
hep-ph hep-ex
|
we extend the zeebabu model introducing local u1_l_mu l_tau symmetry with several singlycharged bosons we find a predictive neutrino mass texture in a simple hypothesis that mixings among singlycharged bosons are negligible also lepton flavor violations are less constrained compared with the original model then we explore testability of the model focussing on a doublycharged boson physics at the lhc and the ilc
|
[['we', 'extend', 'the', 'zeebabu', 'model', 'introducing', 'local', 'u1_l_mu', 'l_tau', 'symmetry', 'with', 'several', 'singlycharged', 'bosons', 'we', 'find', 'a', 'predictive', 'neutrino', 'mass', 'texture', 'in', 'a', 'simple', 'hypothesis', 'that', 'mixings', 'among', 'singlycharged', 'bosons', 'are', 'negligible', 'also', 'lepton', 'flavor', 'violations', 'are', 'less', 'constrained', 'compared', 'with', 'the', 'original', 'model', 'then', 'we', 'explore', 'testability', 'of', 'the', 'model', 'focussing', 'on', 'a', 'doublycharged', 'boson', 'physics', 'at', 'the', 'lhc', 'and', 'the', 'ilc']]
|
[-0.05701424004066558, 0.29417533946356605, 0.0061876569165005574, 0.2238747945262326, -0.07447824278284633, -0.2613396225423212, 0.033679326711636454, 0.33688197651552776, -0.19880817653167815, -0.2772224114557344, 0.023031969901427463, -0.29222214896054494, -0.03266288390630738, 0.08482479728713986, 0.0626479662984373, 0.08267680216314537, 0.04091851847867171, -0.03289747504251344, -0.11170229702700107, -0.2808815027247109, 0.2536920704509294, 0.045416102803770515, 0.2040187871261012, 0.06990247203539761, 0.06226350782468679, -0.008638918584597016, -0.013089282157283926, -0.109878260804902, -0.07757351176856207, 0.07490517601134285, 0.07709749775480419, 0.08569638257373184, 0.10149167163208836, -0.36524532333252924, -0.13705927105472673, 0.2378627363932393, 0.13474111115589502, 0.1456502140425737, -0.12075413492811282, -0.35633837796806817, 0.09890908437470596, -0.2555790287812078, -0.09519519810638731, -0.07768240854484103, -0.09566952448545231, -0.1079556280599227, -0.3340918260759541, 0.10583082988205927, -0.040375648007269886, 0.03873878424721105, 0.015872063758295207, -0.1864830291578694, -0.09490081003408819, -0.08227519469986123, 0.17809521987302496, -0.03881803612476067, 0.1497158833598304, -0.2060540142055187, -0.20788912084655806, 0.4362185910225861, -0.061956101544349204, -0.2280995363022186, 0.1909672578737613, -0.17136838727645456, -0.22488225304654666, 0.028332222977446184, 0.239624930205681, 0.021074155885134897, -0.17299381210394796, 0.21717361857401327, -0.13471519060078121, 0.1686572099459313, 0.0032202834854759867, 0.0562249484697416, 0.2970725919400889, 0.27593487665511757, 0.04141278289228914, 0.04606281531723364, -0.06545587991999965, -0.051124314489286574, -0.4325689361208961, -0.08895556949492958, -0.034354877998195, 0.011458178449954306, -0.05183930558107224, -0.02895620218404229, 0.46976120790673626, 0.17208963004310454, 0.2601780077176435, 0.07941343687060806, 0.27389309233024955, 0.05575293568628175, 0.1025013948508006, 0.048215593941604885, 0.3255092150546492, 0.14012819343793487, 0.0780711039708602, -0.25829869332087657, -0.04845242341980338, 0.11994342117141636]
|
1,803.04796
|
Characterising the correlations of prepare-and-measure quantum networks
|
Prepare-and-measure (P&M) quantum networks are the basic building blocks of
quantum communication and cryptography. These networks crucially rely on
non-orthogonal quantum encodings to distribute quantum correlations, thus
enabling superior communication rates and information-theoretic security. Here,
we present a computational toolbox that is able to efficiently characterise the
set of input-output probability distributions for any discrete-variable P&M
quantum network, assuming only the inner-product information of the quantum
encodings. Our toolbox is thus highly versatile and can be used to analyse a
wide range of quantum network protocols, including those that employ
infinite-dimensional quantum code states. To demonstrate the feasibility and
efficacy of our toolbox, we use it to reveal new results in multipartite
quantum distributed computing and quantum cryptography. Taken together, these
findings suggest that our method may have implications for quantum network
information theory and the development of new quantum technologies.
|
quant-ph cs.CR
|
prepareandmeasure pm quantum networks are the basic building blocks of quantum communication and cryptography these networks crucially rely on nonorthogonal quantum encodings to distribute quantum correlations thus enabling superior communication rates and informationtheoretic security here we present a computational toolbox that is able to efficiently characterise the set of inputoutput probability distributions for any discretevariable pm quantum network assuming only the innerproduct information of the quantum encodings our toolbox is thus highly versatile and can be used to analyse a wide range of quantum network protocols including those that employ infinitedimensional quantum code states to demonstrate the feasibility and efficacy of our toolbox we use it to reveal new results in multipartite quantum distributed computing and quantum cryptography taken together these findings suggest that our method may have implications for quantum network information theory and the development of new quantum technologies
|
[['prepareandmeasure', 'pm', 'quantum', 'networks', 'are', 'the', 'basic', 'building', 'blocks', 'of', 'quantum', 'communication', 'and', 'cryptography', 'these', 'networks', 'crucially', 'rely', 'on', 'nonorthogonal', 'quantum', 'encodings', 'to', 'distribute', 'quantum', 'correlations', 'thus', 'enabling', 'superior', 'communication', 'rates', 'and', 'informationtheoretic', 'security', 'here', 'we', 'present', 'a', 'computational', 'toolbox', 'that', 'is', 'able', 'to', 'efficiently', 'characterise', 'the', 'set', 'of', 'inputoutput', 'probability', 'distributions', 'for', 'any', 'discretevariable', 'pm', 'quantum', 'network', 'assuming', 'only', 'the', 'innerproduct', 'information', 'of', 'the', 'quantum', 'encodings', 'our', 'toolbox', 'is', 'thus', 'highly', 'versatile', 'and', 'can', 'be', 'used', 'to', 'analyse', 'a', 'wide', 'range', 'of', 'quantum', 'network', 'protocols', 'including', 'those', 'that', 'employ', 'infinitedimensional', 'quantum', 'code', 'states', 'to', 'demonstrate', 'the', 'feasibility', 'and', 'efficacy', 'of', 'our', 'toolbox', 'we', 'use', 'it', 'to', 'reveal', 'new', 'results', 'in', 'multipartite', 'quantum', 'distributed', 'computing', 'and', 'quantum', 'cryptography', 'taken', 'together', 'these', 'findings', 'suggest', 'that', 'our', 'method', 'may', 'have', 'implications', 'for', 'quantum', 'network', 'information', 'theory', 'and', 'the', 'development', 'of', 'new', 'quantum', 'technologies']]
|
[-0.12033497816585798, 0.08542592900455104, -0.101983903393691, 0.04767393236418407, -0.03901843990839965, -0.23865349485756868, 0.05497924017584519, 0.3723157245850732, -0.276068478499057, -0.2782581640685684, 0.06267639683437343, -0.2284568015168956, -0.18972973789068612, 0.2870264760621473, -0.08338225879937622, 0.17325862602112777, 0.0840259781115563, -0.018235270252636243, -0.029770812417664532, -0.2715697793526049, 0.28778457279062786, 0.042726284059768554, 0.33885822276393257, 0.07491499715953642, 0.06861305240201533, 0.01814660430449913, -0.006208007537647553, -0.041855671729542424, -0.11604352927338853, 0.20755195758158526, 0.3400926153069851, 0.20824062933894336, 0.2838750925172675, -0.4515678302536831, -0.23797771959492925, 0.0764616835938357, 0.12938516230672492, 0.18682997070103455, -0.039556597782619274, -0.336134520433645, 0.0942436829601507, -0.2064940464775349, -0.050626775177182455, -0.17230263807487192, -0.048502232400528714, -0.01039021779371901, -0.2367163931435727, 0.005824012859354575, 0.02446639331070878, 0.03545138393883785, 0.049305741818859536, -0.06690779456485671, 0.04919632623493936, 0.17597256783818735, -0.12390817211055798, -0.012610342823371872, 0.16001464252142197, -0.10179575209849323, -0.23547759948212468, 0.35404079512640146, 0.01394206619035479, -0.18076806759514602, 0.1919332623501566, -0.04708854555555269, -0.15874786437191862, 0.03218936182373593, 0.2064569759123186, 0.072654283899444, -0.136534265242517, 0.056722766684255965, 0.0027503049024215614, 0.2158062524750089, -0.022238270548033588, 0.1940310681536001, 0.21262580051965324, 0.09976951238296344, 0.04492244800612172, 0.1498846695221736, -0.06665159240926465, -0.22060229392484465, -0.27270263056964317, -0.21279121910268112, -0.24113806488045247, 0.07719347532012942, -0.1013728917656047, -0.1320260143392977, 0.3670200461534955, 0.2332520061032186, 0.11168731108030423, 0.09178150212722468, 0.3085092190547404, 0.042091929188748683, 0.08657507349386917, 0.13014787176445602, 0.20885768577007327, 0.1770750554443621, 0.07809149911825328, -0.1971609034023994, 0.07578377058425693, -0.015156716841490978]
|
1,803.04797
|
Topological structures are consistently overestimated in functional
complex networks
|
Functional complex networks have meant a pivotal change in the way we
understand complex systems, being the most outstanding one the human brain.
These networks have classically been reconstructed using a frequentist approach
that, while simple, completely disregards the uncertainty that derives from
data finiteness. We here provide an alternative solution based on Bayesian
inference, with link weights treated as random variables described by
probability distributions, from which ensembles of networks are sampled. By
using both statistical and topological considerations, we prove that the role
played by links' uncertainty is equivalent to the introduction of a random
rewiring, whose omission leads to a consistent overestimation of topological
structures. We further show that this bias is enhanced in short time series,
suggesting the existence of a theoretical time resolution limit for obtaining
reliable structures. We also propose a simple sampling process for correcting
topological values obtained in frequentist networks. We finally validate these
concepts through synthetic and real network examples, the latter representing
the brain electrical activity of a group of people during a cognitive task.
|
physics.data-an physics.soc-ph
|
functional complex networks have meant a pivotal change in the way we understand complex systems being the most outstanding one the human brain these networks have classically been reconstructed using a frequentist approach that while simple completely disregards the uncertainty that derives from data finiteness we here provide an alternative solution based on bayesian inference with link weights treated as random variables described by probability distributions from which ensembles of networks are sampled by using both statistical and topological considerations we prove that the role played by links uncertainty is equivalent to the introduction of a random rewiring whose omission leads to a consistent overestimation of topological structures we further show that this bias is enhanced in short time series suggesting the existence of a theoretical time resolution limit for obtaining reliable structures we also propose a simple sampling process for correcting topological values obtained in frequentist networks we finally validate these concepts through synthetic and real network examples the latter representing the brain electrical activity of a group of people during a cognitive task
|
[['functional', 'complex', 'networks', 'have', 'meant', 'a', 'pivotal', 'change', 'in', 'the', 'way', 'we', 'understand', 'complex', 'systems', 'being', 'the', 'most', 'outstanding', 'one', 'the', 'human', 'brain', 'these', 'networks', 'have', 'classically', 'been', 'reconstructed', 'using', 'a', 'frequentist', 'approach', 'that', 'while', 'simple', 'completely', 'disregards', 'the', 'uncertainty', 'that', 'derives', 'from', 'data', 'finiteness', 'we', 'here', 'provide', 'an', 'alternative', 'solution', 'based', 'on', 'bayesian', 'inference', 'with', 'link', 'weights', 'treated', 'as', 'random', 'variables', 'described', 'by', 'probability', 'distributions', 'from', 'which', 'ensembles', 'of', 'networks', 'are', 'sampled', 'by', 'using', 'both', 'statistical', 'and', 'topological', 'considerations', 'we', 'prove', 'that', 'the', 'role', 'played', 'by', 'links', 'uncertainty', 'is', 'equivalent', 'to', 'the', 'introduction', 'of', 'a', 'random', 'rewiring', 'whose', 'omission', 'leads', 'to', 'a', 'consistent', 'overestimation', 'of', 'topological', 'structures', 'we', 'further', 'show', 'that', 'this', 'bias', 'is', 'enhanced', 'in', 'short', 'time', 'series', 'suggesting', 'the', 'existence', 'of', 'a', 'theoretical', 'time', 'resolution', 'limit', 'for', 'obtaining', 'reliable', 'structures', 'we', 'also', 'propose', 'a', 'simple', 'sampling', 'process', 'for', 'correcting', 'topological', 'values', 'obtained', 'in', 'frequentist', 'networks', 'we', 'finally', 'validate', 'these', 'concepts', 'through', 'synthetic', 'and', 'real', 'network', 'examples', 'the', 'latter', 'representing', 'the', 'brain', 'electrical', 'activity', 'of', 'a', 'group', 'of', 'people', 'during', 'a', 'cognitive', 'task']]
|
[-0.10665835672989488, 0.08374374300848493, -0.1056280133605469, 0.10746247956501195, -0.06352449449045318, -0.13490009853882448, 0.08378690830831016, 0.4164011954596, -0.2583916509557249, -0.29678852805269085, 0.08534852425767375, -0.2301578522154263, -0.2342872309631535, 0.1797336488802518, -0.09613333888085825, 0.052965470877160054, 0.08133299959291306, 0.024722262108864794, -0.038754538177911725, -0.2344681503996253, 0.32059015281099296, 0.06595280517424856, 0.2896348112582096, 0.006373109535447188, 0.10207541135987933, -0.004408361996923174, -0.052748442391000155, 0.057072563527284986, -0.11030649328687495, 0.1611110147195203, 0.269603927731514, 0.12844862139118568, 0.3005528054120285, -0.44051705590316226, -0.2625662711794887, 0.10634643357779298, 0.1358183431332665, 0.09729940075227725, -0.04506427545433066, -0.3043991548887321, 0.09919667325647814, -0.15990305407238858, -0.061892115805032, -0.11757601487317255, -0.007701949527753251, 0.0018553484307735095, -0.2455103849247098, 0.08102607953079444, 0.04248449859608497, 0.0992118784003625, -0.02822517415724828, -0.10022656518832913, 0.0055485636022474085, 0.1689563107543758, 0.026535575691710358, 0.00528767763237868, 0.12935918940763388, -0.1329784905058997, -0.15628855304792524, 0.33943117839417286, -0.012945957137604377, -0.20569014402372496, 0.1730258965660219, -0.08864067735150456, -0.174906596005229, 0.10837851189076901, 0.15416569293609686, 0.08093275525540645, -0.1756689541786909, 0.0358476993475259, -0.020154746933174986, 0.1463326324648889, 0.029904352354684045, 0.018368213546595402, 0.20521868688187428, 0.1937448857032827, 0.046031205832426036, 0.1285348196753434, -0.07366409523013447, -0.1108830512953656, -0.28629801734217575, -0.11979996506390828, -0.1960311164041715, 0.07497794123832137, -0.11036999934735442, -0.1652780443296901, 0.40336379471634115, 0.1827392857322203, 0.21507387363817543, 0.10547541075984815, 0.2771023735616888, 0.10837633665318468, 0.04557704472149323, 0.04644260859150173, 0.19502663700176137, 0.13539564910477825, 0.05965962976815977, -0.14661847935058175, 0.11395634719569768, 0.02916835152144943]
|
1,803.04798
|
A Branch-Price-and-Cut Algorithm for Optimal Decoding of LDPC Codes
|
Channel coding aims to minimize errors that occur during the transmission of
digital information from one place to another. Low-density parity-check (LDPC)
codes can detect and correct transmission errors if one encodes the original
information by adding redundant bits. In practice, heuristic iterative decoding
algorithms are used to decode the received vector. However, these algorithms
may fail to decode if the received vector contains multiple errors. We consider
decoding the received vector with minimum error as an integer programming
problem and propose a branch-and-price method for its solution. We improve the
performance of our method by introducing heuristic feasible solutions and
adding valid cuts to the mathematical formulation. Computational results reveal
that our branch-price-and-cut algorithm significantly improves solvability of
the problem compared to a commercial solver in high channel error rates. Our
proposed algorithm can find higher quality solutions than commonly used
iterative decoding heuristics.
|
cs.IT math.IT math.OC
|
channel coding aims to minimize errors that occur during the transmission of digital information from one place to another lowdensity paritycheck ldpc codes can detect and correct transmission errors if one encodes the original information by adding redundant bits in practice heuristic iterative decoding algorithms are used to decode the received vector however these algorithms may fail to decode if the received vector contains multiple errors we consider decoding the received vector with minimum error as an integer programming problem and propose a branchandprice method for its solution we improve the performance of our method by introducing heuristic feasible solutions and adding valid cuts to the mathematical formulation computational results reveal that our branchpriceandcut algorithm significantly improves solvability of the problem compared to a commercial solver in high channel error rates our proposed algorithm can find higher quality solutions than commonly used iterative decoding heuristics
|
[['channel', 'coding', 'aims', 'to', 'minimize', 'errors', 'that', 'occur', 'during', 'the', 'transmission', 'of', 'digital', 'information', 'from', 'one', 'place', 'to', 'another', 'lowdensity', 'paritycheck', 'ldpc', 'codes', 'can', 'detect', 'and', 'correct', 'transmission', 'errors', 'if', 'one', 'encodes', 'the', 'original', 'information', 'by', 'adding', 'redundant', 'bits', 'in', 'practice', 'heuristic', 'iterative', 'decoding', 'algorithms', 'are', 'used', 'to', 'decode', 'the', 'received', 'vector', 'however', 'these', 'algorithms', 'may', 'fail', 'to', 'decode', 'if', 'the', 'received', 'vector', 'contains', 'multiple', 'errors', 'we', 'consider', 'decoding', 'the', 'received', 'vector', 'with', 'minimum', 'error', 'as', 'an', 'integer', 'programming', 'problem', 'and', 'propose', 'a', 'branchandprice', 'method', 'for', 'its', 'solution', 'we', 'improve', 'the', 'performance', 'of', 'our', 'method', 'by', 'introducing', 'heuristic', 'feasible', 'solutions', 'and', 'adding', 'valid', 'cuts', 'to', 'the', 'mathematical', 'formulation', 'computational', 'results', 'reveal', 'that', 'our', 'branchpriceandcut', 'algorithm', 'significantly', 'improves', 'solvability', 'of', 'the', 'problem', 'compared', 'to', 'a', 'commercial', 'solver', 'in', 'high', 'channel', 'error', 'rates', 'our', 'proposed', 'algorithm', 'can', 'find', 'higher', 'quality', 'solutions', 'than', 'commonly', 'used', 'iterative', 'decoding', 'heuristics']]
|
[-0.13598659883578437, -0.02499352307972129, -0.09355960927646735, 0.09359902436242856, -0.11490079098348988, -0.27805130671517087, 0.112901145508834, 0.3845772655022427, -0.3105896907376832, -0.3279809327988789, 0.11626614542710113, -0.25024036655266735, -0.18504718508699844, 0.16323365985961824, -0.1600620209335767, 0.12435535265028412, 0.10396252145151737, 0.05613788290366788, -0.126509535245212, -0.36112036369354583, 0.20048085511019775, 0.11246424669335628, 0.29262296554375566, -0.012938506554426818, 0.11121012704077594, 0.023567068050133772, -0.034005780888978265, -0.017757567660561923, -0.0779012406538923, 0.09847094936071542, 0.32957255191908313, 0.245496749929313, 0.29572713328846567, -0.4366042422644537, -0.23060908032388522, 0.09574265281894598, 0.18845762424492116, 0.1854480750987242, -0.03585406451261249, -0.2445937790442258, 0.15584783690403506, -0.14124855130653957, 0.007933289551272475, -0.04779161515420881, -0.09054125501806366, 0.0001534766959154914, -0.3345302981549296, 0.03638866531245154, 0.018886187271182908, -0.02026821839992471, -0.020348602479548547, -0.17916910898197314, 0.05956440181471408, 0.12050911258295949, 0.027109727794143917, 0.07132246598264139, 0.10240512386783315, -0.06196895885213021, -0.1621692560420468, 0.3589752843282346, -0.010584889250056786, -0.2445527455865823, 0.12144274509367373, -0.02080869273250473, -0.10492560351267458, 0.23270348798612067, 0.24796658853903927, 0.08994205423213285, -0.11204837896572105, 0.007833497657978522, 0.015001166303609979, 0.21738168010167006, 0.08955294418887332, 0.07712504694013503, 0.12301139585384778, 0.11861352536080662, 0.08462812501840808, 0.15530069009240333, -0.08848542888680923, -0.05955924020502074, -0.2149127114921455, -0.07674578735283737, -0.1935149035095398, -0.05312365732027282, -0.10604321897192456, -0.13336811720811087, 0.35001280497245746, 0.22966026445160267, 0.11025115307420492, 0.12957963835415912, 0.3818078958718427, 0.09226193007338664, 0.0840842546329127, 0.18387567949449193, 0.19624501174829642, 0.11740097726117177, 0.07935183748988242, -0.2190586438707622, 0.1110703674369845, 0.10683176955850474]
|
1,803.04799
|
Introduction to the declination function for gerrymanders
|
The declination is a quantitative method for identifying possible partisan
gerrymanders by analyzing vote distributions. In this expository note we
explain and motivate the definition of the declination. The minimal computer
code required for computing the declination is included. We end by computing
its value on several recent elections.
|
physics.soc-ph stat.AP
|
the declination is a quantitative method for identifying possible partisan gerrymanders by analyzing vote distributions in this expository note we explain and motivate the definition of the declination the minimal computer code required for computing the declination is included we end by computing its value on several recent elections
|
[['the', 'declination', 'is', 'a', 'quantitative', 'method', 'for', 'identifying', 'possible', 'partisan', 'gerrymanders', 'by', 'analyzing', 'vote', 'distributions', 'in', 'this', 'expository', 'note', 'we', 'explain', 'and', 'motivate', 'the', 'definition', 'of', 'the', 'declination', 'the', 'minimal', 'computer', 'code', 'required', 'for', 'computing', 'the', 'declination', 'is', 'included', 'we', 'end', 'by', 'computing', 'its', 'value', 'on', 'several', 'recent', 'elections']]
|
[-0.1326318749853847, 0.03280673206460719, -0.06552160709944306, 0.11019325394382966, -0.11767638691377882, -0.08655223001402859, 0.11352120975640659, 0.3997068290066506, -0.2377849203553431, -0.3460056283036057, 0.09995875624958805, -0.2652380442132755, -0.1187979411713931, 0.17977860479969626, -0.1286718392440555, 0.02573022691471198, 0.05799613714845357, -0.0051756601552574, -0.029025971752886032, -0.3137773603809123, 0.2598334577846892, 0.0935800076481335, 0.2232765234218036, 0.07869634091169858, 0.08238882098194895, 0.019325031946432227, -0.14139771478592741, -0.0044509395766927275, -0.1842861019302996, 0.17912964180720095, 0.2587771251398538, 0.18916301120414722, 0.33359667787100283, -0.3398538860587441, -0.0761426265864652, 0.13149195407251163, 0.09084651672770744, 0.07640297782170224, -0.032932941519123106, -0.2732127346098423, 0.0772810782001791, -0.2361761691400363, -0.16267444571594195, -0.06816018549535348, 0.034127682884584884, 0.013996443578175135, -0.1796465106165911, 0.05438454930043342, 0.04300149831426691, 0.13440099718852197, -0.027062885199521422, -0.16136342117548635, 0.04114073674593653, 0.13229189499528432, 0.07449284461041798, 0.03731230227276683, 0.08634863295877467, -0.12838939375396133, -0.1159655475627859, 0.39516750707918286, 0.04708048507419168, -0.1395244214455692, 0.0804140283441057, -0.10158477832886334, -0.16814980701524385, 0.058403923404308, 0.1482150756031731, 0.10920758357233538, -0.17306781240871974, 0.0804652924333433, -0.09346189492439129, 0.12763324828476322, 0.0681809722731004, -0.011875968160373824, 0.24239773706209902, 0.1376337500821267, 0.06344029373888459, 0.13184590204333774, -0.11317182748046305, -0.10165146784025378, -0.33328281852359676, -0.14248392981838207, -0.18369619270824655, -0.014783060254187, -0.028868839001860373, -0.10507533729684596, 0.477355242991934, 0.21158648919485204, 0.14260851779990658, 0.08660670830773151, 0.319274062675671, 0.03802310831236596, 0.008492340077170911, 0.07022853277395574, 0.209437718586426, 0.0731119297786939, 0.1297668077298725, -0.16480107333663166, 0.12601449944278492, 0.035698228648730686]
|
1,803.048
|
Normalization of rationally integrable systems
|
In two previous papers we showed that any analytically integrable vector
field admits a local analytic Poincar\'e-Birkhoff normalization in the
neighborhood of a singular point. The aim of this paper is to extend this
analytic normalization result to the case of rationally integrable systems,
where the first integrals and commuting vector fields are not required to be
analytic, but just rational (i.e., quotients of analytic functions or vector
fields by analytic functions).
|
math.DS
|
in two previous papers we showed that any analytically integrable vector field admits a local analytic poincarebirkhoff normalization in the neighborhood of a singular point the aim of this paper is to extend this analytic normalization result to the case of rationally integrable systems where the first integrals and commuting vector fields are not required to be analytic but just rational ie quotients of analytic functions or vector fields by analytic functions
|
[['in', 'two', 'previous', 'papers', 'we', 'showed', 'that', 'any', 'analytically', 'integrable', 'vector', 'field', 'admits', 'a', 'local', 'analytic', 'poincarebirkhoff', 'normalization', 'in', 'the', 'neighborhood', 'of', 'a', 'singular', 'point', 'the', 'aim', 'of', 'this', 'paper', 'is', 'to', 'extend', 'this', 'analytic', 'normalization', 'result', 'to', 'the', 'case', 'of', 'rationally', 'integrable', 'systems', 'where', 'the', 'first', 'integrals', 'and', 'commuting', 'vector', 'fields', 'are', 'not', 'required', 'to', 'be', 'analytic', 'but', 'just', 'rational', 'ie', 'quotients', 'of', 'analytic', 'functions', 'or', 'vector', 'fields', 'by', 'analytic', 'functions']]
|
[-0.182748167190261, 0.05783048286361413, -0.10301959579293099, 0.08724756300054853, -0.12079510089501531, -0.10314159319063441, 0.022235548008918866, 0.3493885458964441, -0.25932644160153967, -0.15947803393161544, 0.10030714017112688, -0.2422148025280977, -0.20122666791818725, 0.18988069987325515, -0.06929864602312187, 0.07027430454682973, 0.03146665542024291, 0.08233855097043691, -0.10717248432208887, -0.3030421804222796, 0.42275322050166625, -0.04856148072414928, 0.18503113654959533, 0.02749988103621743, 0.10913517135001409, 0.03242497089215451, -0.04130332156394919, -0.01654367959902932, -0.1254017358010565, 0.13059267040807754, 0.30356442959358293, 0.08989738270692113, 0.23628912040213537, -0.4040959120676335, -0.19352508895099163, 0.18794906322404537, 0.18245214586689448, 0.06795406254887995, 0.018917065285172105, -0.2156330687478961, 0.09537649183120164, -0.13095760622268748, -0.20657970246005183, -0.1071212165689859, 0.035904167706677176, 0.08405485336293674, -0.2930958167611, 0.04973256846682893, 0.11557768116148913, 0.09639243138695343, -0.10263746587831217, -0.07519337580823857, -0.018168168258853257, 0.07406239472523642, 0.04375628692261873, 0.12835649527712828, 0.10339367813301376, -0.11030105901752701, -0.10413236427120864, 0.30888491045334376, -0.06954669575497974, -0.3079167342932326, 0.14904445248733586, -0.1918969427804566, -0.1354433541224959, 0.10853013896849006, 0.1061766725874299, 0.14009962684940547, -0.1307468924464451, 0.17850819897446651, -0.06471706300766931, 0.0906107542286918, 0.07563830996837674, -0.044908716168720275, 0.14833377929688948, 0.015748839618431196, 0.058801991709818445, 0.11044262214919501, 0.06404543553556626, -0.10754943254222679, -0.34830551128834486, -0.16423203020692906, -0.14818517229933706, 0.1258675657350573, -0.06034502500208166, -0.2251701985951513, 0.4358475185516808, 0.11107091649642421, 0.22618067747033718, 0.10359144300390552, 0.3033835635934439, 0.1600299057123872, 0.042642803836820856, 0.07021210071656646, 0.20298321655071858, 0.16373944321660222, 0.02814409877302953, -0.0866780250863586, -0.03692317635027899, 0.14595292399947843]
|
1,803.04801
|
Characterizing face and flag vector pairs for polytopes
|
Gr\"unbaum, Barnette, and Reay in 1974 completed the characterization of the
pairs $(f_i,f_j)$ of face numbers of $4$-dimensional polytopes.
Here we obtain a complete characterization of the pairs of flag numbers
$(f_0,f_{03})$ for $4$-polytopes. Furthermore, we describe the pairs of face
numbers $(f_0,f_{d-1})$ for $d$-polytopes; this description is complete for
even $d\ge6$ except for finitely many exceptional pairs that are "small" in a
well-defined sense, while for odd $d$ we show that there are also "large"
exceptional pairs.
Our proofs rely on the insight that "small" pairs need to be defined and to
be treated separately; in the $4$-dimensional case, these may be characterized
with the help of the characterizations of the $4$-polytopes with at most $8$
vertices by Altshuler and Steinberg (1984).
|
math.MG math.CO
|
grunbaum barnette and reay in 1974 completed the characterization of the pairs f_if_j of face numbers of 4dimensional polytopes here we obtain a complete characterization of the pairs of flag numbers f_0f_03 for 4polytopes furthermore we describe the pairs of face numbers f_0f_d1 for dpolytopes this description is complete for even dge6 except for finitely many exceptional pairs that are small in a welldefined sense while for odd d we show that there are also large exceptional pairs our proofs rely on the insight that small pairs need to be defined and to be treated separately in the 4dimensional case these may be characterized with the help of the characterizations of the 4polytopes with at most 8 vertices by altshuler and steinberg 1984
|
[['grunbaum', 'barnette', 'and', 'reay', 'in', '1974', 'completed', 'the', 'characterization', 'of', 'the', 'pairs', 'f_if_j', 'of', 'face', 'numbers', 'of', '4dimensional', 'polytopes', 'here', 'we', 'obtain', 'a', 'complete', 'characterization', 'of', 'the', 'pairs', 'of', 'flag', 'numbers', 'f_0f_03', 'for', '4polytopes', 'furthermore', 'we', 'describe', 'the', 'pairs', 'of', 'face', 'numbers', 'f_0f_d1', 'for', 'dpolytopes', 'this', 'description', 'is', 'complete', 'for', 'even', 'dge6', 'except', 'for', 'finitely', 'many', 'exceptional', 'pairs', 'that', 'are', 'small', 'in', 'a', 'welldefined', 'sense', 'while', 'for', 'odd', 'd', 'we', 'show', 'that', 'there', 'are', 'also', 'large', 'exceptional', 'pairs', 'our', 'proofs', 'rely', 'on', 'the', 'insight', 'that', 'small', 'pairs', 'need', 'to', 'be', 'defined', 'and', 'to', 'be', 'treated', 'separately', 'in', 'the', '4dimensional', 'case', 'these', 'may', 'be', 'characterized', 'with', 'the', 'help', 'of', 'the', 'characterizations', 'of', 'the', '4polytopes', 'with', 'at', 'most', '8', 'vertices', 'by', 'altshuler', 'and', 'steinberg', '1984']]
|
[-0.15781992343437187, 0.10182817822922606, -0.042051355527667714, 0.06951140664702604, -0.048635327699786624, -0.1342454519707802, 0.019610004312905275, 0.34796061751640533, -0.21947512301627917, -0.29324180047866727, 0.08802935116720378, -0.29677243082791815, -0.13197199101290427, 0.23376086963848633, -0.1095050173842402, -0.0241051731536873, 0.09469514080777394, 0.05625207922305943, -0.024613953484145325, -0.32340115870633895, 0.33930179298170343, -0.06672201745889404, 0.20251097634996573, 0.08385961112558596, 0.07372677051808593, 0.03988899106028959, -0.012969652644920447, 0.045502363296210276, -0.1520935934457773, 0.13308258771065098, 0.28528675390792285, 0.11514856348830191, 0.18134715343817823, -0.36782019536880667, -0.1061688472886285, 0.17832446052531195, 0.12440977210548422, 0.08854102826107693, -0.02520325625688607, -0.24308213777647716, 0.15573784374258642, -0.11056864866602027, -0.15417307148849177, -0.08880898250990417, 0.07675959244524398, 0.029025001870372047, -0.26057454531873797, 0.0212854261465336, 0.1252629117124275, 0.10742904773089758, -0.004592181096807861, -0.1293652171792447, -0.05539745557091145, 0.1261388118386515, -0.02341809032354042, -0.011065015307635316, 0.003999432429578925, -0.09562826238587992, -0.14278626322942548, 0.36712895937587237, 0.007637785039534254, -0.2072101127671863, 0.18284507908508152, -0.1865307875785761, -0.16840610904850004, 0.15576707460140146, 0.11422337639368763, 0.16746725824763536, -0.09377824857615488, 0.0917179954054473, -0.12799483055079525, 0.0646542948632201, 0.14970495776381065, 0.05116268662997514, 0.18194938786635714, 0.0936553915885608, 0.026560699990046142, 0.12873636959274568, 0.002395215765611569, -0.024886269892050214, -0.3295263349779012, -0.18849177927948718, -0.18301054498580985, 0.09249334598406533, -0.05854251093679966, -0.14471367128532042, 0.36600681139571856, 0.062421758814083704, 0.24017127418567327, 0.06847747390241216, 0.1836622547712331, 0.036259840108831376, 0.07311753791272024, 0.07011899160084599, 0.2016511196847851, 0.12581527687817012, -0.01693561166132346, -0.10322545125911181, -0.007103452727872438, 0.1167524522786175]
|
1,803.04802
|
Dynamical formation of Proca stars and quasi-stationary solitonic
objects
|
We perform fully non-linear numerical simulations within the spherically
symmetric Einstein-(complex)Proca system. Starting with Proca field
distributions that obey the Hamiltonian, momentum and Gaussian constraints, we
show that the self-gravity of the system induces the formation of compact
objects, which, for appropriate initial conditions, asymptotically approach
stationary soliton-like solutions known as Proca stars. The excess energy of
the system is dissipated by the mechanism of \textit{gravitational cooling} in
analogy to what occurs in the dynamical formation of scalar boson stars. We
investigate the dependence of this process on the phase difference between the
real and imaginary parts of the Proca field, as well as on their relative
amplitudes. Within the timescales probed by our numerical simulations the
process is qualitatively insensitive to either choice: the phase difference and
the amplitude ratio are conserved during the evolution. Thus, whereas a truly
stationary object is expected to be approached only in the particular case of
equal amplitudes and opposite phases, quasi-stationary compact solitonic
objects are, nevertheless, formed in the general case.
|
gr-qc
|
we perform fully nonlinear numerical simulations within the spherically symmetric einsteincomplexproca system starting with proca field distributions that obey the hamiltonian momentum and gaussian constraints we show that the selfgravity of the system induces the formation of compact objects which for appropriate initial conditions asymptotically approach stationary solitonlike solutions known as proca stars the excess energy of the system is dissipated by the mechanism of textitgravitational cooling in analogy to what occurs in the dynamical formation of scalar boson stars we investigate the dependence of this process on the phase difference between the real and imaginary parts of the proca field as well as on their relative amplitudes within the timescales probed by our numerical simulations the process is qualitatively insensitive to either choice the phase difference and the amplitude ratio are conserved during the evolution thus whereas a truly stationary object is expected to be approached only in the particular case of equal amplitudes and opposite phases quasistationary compact solitonic objects are nevertheless formed in the general case
|
[['we', 'perform', 'fully', 'nonlinear', 'numerical', 'simulations', 'within', 'the', 'spherically', 'symmetric', 'einsteincomplexproca', 'system', 'starting', 'with', 'proca', 'field', 'distributions', 'that', 'obey', 'the', 'hamiltonian', 'momentum', 'and', 'gaussian', 'constraints', 'we', 'show', 'that', 'the', 'selfgravity', 'of', 'the', 'system', 'induces', 'the', 'formation', 'of', 'compact', 'objects', 'which', 'for', 'appropriate', 'initial', 'conditions', 'asymptotically', 'approach', 'stationary', 'solitonlike', 'solutions', 'known', 'as', 'proca', 'stars', 'the', 'excess', 'energy', 'of', 'the', 'system', 'is', 'dissipated', 'by', 'the', 'mechanism', 'of', 'textitgravitational', 'cooling', 'in', 'analogy', 'to', 'what', 'occurs', 'in', 'the', 'dynamical', 'formation', 'of', 'scalar', 'boson', 'stars', 'we', 'investigate', 'the', 'dependence', 'of', 'this', 'process', 'on', 'the', 'phase', 'difference', 'between', 'the', 'real', 'and', 'imaginary', 'parts', 'of', 'the', 'proca', 'field', 'as', 'well', 'as', 'on', 'their', 'relative', 'amplitudes', 'within', 'the', 'timescales', 'probed', 'by', 'our', 'numerical', 'simulations', 'the', 'process', 'is', 'qualitatively', 'insensitive', 'to', 'either', 'choice', 'the', 'phase', 'difference', 'and', 'the', 'amplitude', 'ratio', 'are', 'conserved', 'during', 'the', 'evolution', 'thus', 'whereas', 'a', 'truly', 'stationary', 'object', 'is', 'expected', 'to', 'be', 'approached', 'only', 'in', 'the', 'particular', 'case', 'of', 'equal', 'amplitudes', 'and', 'opposite', 'phases', 'quasistationary', 'compact', 'solitonic', 'objects', 'are', 'nevertheless', 'formed', 'in', 'the', 'general', 'case']]
|
[-0.15713844958075582, 0.1772714147079714, -0.10561521995134827, 0.10696415627556842, -0.043967007801278365, -0.0799684080153362, 0.016158443961716836, 0.348010924958883, -0.22101164280751048, -0.28819503241698063, 0.0681888215993283, -0.2251155536164414, -0.1168934210842839, 0.1592903757363161, 0.010480256910992445, 0.021791837933148154, 0.04578855862984291, 0.04022837239703351, -0.08197969298798745, -0.21565506838195952, 0.37374174843966607, 0.033784298325431415, 0.24174902810075888, -0.025921330346378703, 0.07948970175058906, -0.023910928906090336, 0.004937652880105482, 0.0017230989075315423, -0.11619045047033316, 0.004895746249143453, 0.18118229489112217, 0.0676320718075066, 0.1932798429570001, -0.41417043140852416, -0.2129699266212579, 0.10194320580026564, 0.17970269817869955, 0.10982586622731375, -0.044528948131285, -0.27681830359248105, 0.06898514820970926, -0.1687644866457727, -0.17749328082964683, -0.03926817564391558, 0.05396685828923209, 0.03788465503382789, -0.26187374146886655, 0.13754546118090094, 0.07865265095142335, -0.00954553608358259, -0.11851122803964029, -0.05731822138710069, -0.07113805431431744, 0.08657956492987919, 0.066098446103251, 0.028096567510114707, 0.1557373393756839, -0.1438438577684932, -0.08137737023409941, 0.38539369374282173, -0.0838414425486368, -0.2113443807417736, 0.19329950238816362, -0.18973172283409365, -0.07951002763088286, 0.154248745268839, 0.15165370858147653, 0.17490593285421074, -0.12473028982554138, 0.07165010697649207, -0.008088716815195471, 0.14943316970957365, 0.0696187758427003, 0.041847109122645415, 0.27726764549341426, 0.14213064140860632, 0.019062998024030373, 0.13683248400762568, -0.06327446190001079, -0.18329569605212195, -0.32960384310438084, -0.10494742775611447, -0.1623160087058497, 0.05232597886689404, -0.08694961011449713, -0.16080087472921645, 0.35236814219129864, 0.12341436989861679, 0.17296136510641089, 0.0384186488809064, 0.2862570468700055, 0.1567847840419072, 0.04279329517812154, 0.07657890728283563, 0.28917036543065716, 0.1680848456756625, 0.11861351454222696, -0.2646789789577318, 0.02537840931020545, 0.030383866306493534]
|
1,803.04803
|
High-efficiency single-photon generation via large-scale active time
multiplexing
|
On-demand generation of indistinguishable single- and multi-photon states is
a key technology for scaling up optical quantum information and communication
applications. Nonlinear parametric photon-pair sources and heralded
single-photon sources (HSPSs) had been the most standard resource of quantum
information applications for decades. However, the intrinsic uncertainty of the
produced number of photon pairs in such sources is a critical drawback that
prevents on-demand photon-pair and heralded single-photon generation. Here we
demonstrate large-scale time multiplexing of indistinguishable heralded single
photons, employing a low-loss HSPS and adjustable delay line. We observed 66.7%
presence probability of single-photon states collected into a single-mode
optical fiber by multiplexing 40 periodic time bins of heralded single photons.
To our knowledge, this is the highest fiber-coupled single-photon probability
achieved to date. A high indistinguishability (~90%) of our time-multiplexed
photons has also been confirmed. We also experimentally investigate trade-off
relations of single-photon probability and unwanted multi-photon contribution
by using different pump powers for a HSPS. Our results demonstrate that
low-loss, large-scale multiplexing can realize highly efficient single-photon
generation as well as highly scalable multi-photon generation from inefficient
HSPSs. We predict that our large-scale time multiplexing will pave the way
toward generation of > 30 coincident photons with unprecedented efficiencies,
enabling a new frontier in optical quantum information processing.
|
quant-ph
|
ondemand generation of indistinguishable single and multiphoton states is a key technology for scaling up optical quantum information and communication applications nonlinear parametric photonpair sources and heralded singlephoton sources hspss had been the most standard resource of quantum information applications for decades however the intrinsic uncertainty of the produced number of photon pairs in such sources is a critical drawback that prevents ondemand photonpair and heralded singlephoton generation here we demonstrate largescale time multiplexing of indistinguishable heralded single photons employing a lowloss hsps and adjustable delay line we observed 667 presence probability of singlephoton states collected into a singlemode optical fiber by multiplexing 40 periodic time bins of heralded single photons to our knowledge this is the highest fibercoupled singlephoton probability achieved to date a high indistinguishability 90 of our timemultiplexed photons has also been confirmed we also experimentally investigate tradeoff relations of singlephoton probability and unwanted multiphoton contribution by using different pump powers for a hsps our results demonstrate that lowloss largescale multiplexing can realize highly efficient singlephoton generation as well as highly scalable multiphoton generation from inefficient hspss we predict that our largescale time multiplexing will pave the way toward generation of 30 coincident photons with unprecedented efficiencies enabling a new frontier in optical quantum information processing
|
[['ondemand', 'generation', 'of', 'indistinguishable', 'single', 'and', 'multiphoton', 'states', 'is', 'a', 'key', 'technology', 'for', 'scaling', 'up', 'optical', 'quantum', 'information', 'and', 'communication', 'applications', 'nonlinear', 'parametric', 'photonpair', 'sources', 'and', 'heralded', 'singlephoton', 'sources', 'hspss', 'had', 'been', 'the', 'most', 'standard', 'resource', 'of', 'quantum', 'information', 'applications', 'for', 'decades', 'however', 'the', 'intrinsic', 'uncertainty', 'of', 'the', 'produced', 'number', 'of', 'photon', 'pairs', 'in', 'such', 'sources', 'is', 'a', 'critical', 'drawback', 'that', 'prevents', 'ondemand', 'photonpair', 'and', 'heralded', 'singlephoton', 'generation', 'here', 'we', 'demonstrate', 'largescale', 'time', 'multiplexing', 'of', 'indistinguishable', 'heralded', 'single', 'photons', 'employing', 'a', 'lowloss', 'hsps', 'and', 'adjustable', 'delay', 'line', 'we', 'observed', '667', 'presence', 'probability', 'of', 'singlephoton', 'states', 'collected', 'into', 'a', 'singlemode', 'optical', 'fiber', 'by', 'multiplexing', '40', 'periodic', 'time', 'bins', 'of', 'heralded', 'single', 'photons', 'to', 'our', 'knowledge', 'this', 'is', 'the', 'highest', 'fibercoupled', 'singlephoton', 'probability', 'achieved', 'to', 'date', 'a', 'high', 'indistinguishability', '90', 'of', 'our', 'timemultiplexed', 'photons', 'has', 'also', 'been', 'confirmed', 'we', 'also', 'experimentally', 'investigate', 'tradeoff', 'relations', 'of', 'singlephoton', 'probability', 'and', 'unwanted', 'multiphoton', 'contribution', 'by', 'using', 'different', 'pump', 'powers', 'for', 'a', 'hsps', 'our', 'results', 'demonstrate', 'that', 'lowloss', 'largescale', 'multiplexing', 'can', 'realize', 'highly', 'efficient', 'singlephoton', 'generation', 'as', 'well', 'as', 'highly', 'scalable', 'multiphoton', 'generation', 'from', 'inefficient', 'hspss', 'we', 'predict', 'that', 'our', 'largescale', 'time', 'multiplexing', 'will', 'pave', 'the', 'way', 'toward', 'generation', 'of', '30', 'coincident', 'photons', 'with', 'unprecedented', 'efficiencies', 'enabling', 'a', 'new', 'frontier', 'in', 'optical', 'quantum', 'information', 'processing']]
|
[-0.15552757680638912, 0.18176445631983212, -0.020019171166826378, 0.008391432154424595, -0.0213763196250807, -0.2015450499783622, 0.11287290159764402, 0.48610058715611554, -0.21080436614624995, -0.3148875970473629, 0.006865527520945483, -0.29670388494650546, -0.03600214295391145, 0.2935905597444499, -0.026862524305002397, 0.15099998028853098, 0.0689952467082505, -0.08607815901200737, 0.030837452931454377, -0.1681264999465188, 0.23628484863235336, 0.08650688376582927, 0.4191198666049747, 0.035651301974586644, 0.2018799550483743, -0.001842799107989733, -0.05314315242568058, -0.1338465849147067, -0.008767746318136977, 0.13835302350817597, 0.30473382153679757, 0.11551976344285257, 0.28640685823153367, -0.3899964307252157, -0.24756913636164946, 0.10537439861900784, 0.19834126308382127, 0.17044155041098988, -0.12237954954728128, -0.31236087484842245, 0.03479154212355756, -0.19171303049641725, -0.08919472181523423, -0.05142469205960418, -0.023830280166885785, -0.004338559974764772, -0.23553043617933775, 0.0434670543983806, -0.01727041845019399, -0.008529133722631697, 0.06842790955441456, 0.01044395353431194, 0.017233194503710386, 0.07818303226034322, -0.15019628743231117, -0.0071071223105174716, 0.14975626727774446, -0.16824169423203897, -0.24650429975704857, 0.3499322113350956, -0.07612117736056696, -0.09896968674966308, 0.1402947055354144, -0.1391267828853872, -0.11124312852032518, 0.17749917870788484, 0.16793976987502648, 0.10595186103723551, -0.15773305555796652, -0.051386591049833626, 0.03263381669413673, 0.27122166681517823, 0.1516806844434741, 0.26542495330350035, 0.24136078167198735, 0.1847916971869838, 0.01714567648487513, 0.18002883025387115, -0.14889480604491592, -0.048480803576970925, -0.2582428768866486, -0.17963296131221979, -0.2256011279638518, 0.10908970936105707, -0.09991944967348543, -0.07479005889063611, 0.3740920753989137, 0.16273736033107392, 0.09015414749526164, 0.0166256734789416, 0.37712248824269434, 0.13512783493199407, 0.059233412394438245, 0.03615983128970997, 0.3062661257561332, 0.10220326922508625, 0.07863657490203255, -0.17706693778523025, 0.026240776402153894, -0.11056432322516556]
|
1,803.04804
|
The optical properties of dibenzoterrylene
|
Dibenzoterrylene (DBT) has garnered interest as a potential single photon
source (SPS). To have a better grasp of any possible limitations of using DBT
for this application, a better understanding of its optical properties is
needed. We use a configuration interaction (CI) strategy to calculate the many
body wavefunctions of DBT, and we use these wavefunctions to calculate its
optical properties. We calculate the linear absorption spectrum and the spatial
distributions of electrons involved in several bright transitions. We also
calculate the two-photon absorption spectrum of DBT and show that there are
several excited states that are bright due to two-photon absorption. Except at
high photon energies, we predict that there are no competing optical processes
regarding the use of DBT as a SPS. Our calculations provide details of the
optical properties of DBT that are interesting in general, and useful for
considering optical applications of DBT.
|
cond-mat.mtrl-sci cond-mat.mes-hall cond-mat.str-el physics.optics
|
dibenzoterrylene dbt has garnered interest as a potential single photon source sps to have a better grasp of any possible limitations of using dbt for this application a better understanding of its optical properties is needed we use a configuration interaction ci strategy to calculate the many body wavefunctions of dbt and we use these wavefunctions to calculate its optical properties we calculate the linear absorption spectrum and the spatial distributions of electrons involved in several bright transitions we also calculate the twophoton absorption spectrum of dbt and show that there are several excited states that are bright due to twophoton absorption except at high photon energies we predict that there are no competing optical processes regarding the use of dbt as a sps our calculations provide details of the optical properties of dbt that are interesting in general and useful for considering optical applications of dbt
|
[['dibenzoterrylene', 'dbt', 'has', 'garnered', 'interest', 'as', 'a', 'potential', 'single', 'photon', 'source', 'sps', 'to', 'have', 'a', 'better', 'grasp', 'of', 'any', 'possible', 'limitations', 'of', 'using', 'dbt', 'for', 'this', 'application', 'a', 'better', 'understanding', 'of', 'its', 'optical', 'properties', 'is', 'needed', 'we', 'use', 'a', 'configuration', 'interaction', 'ci', 'strategy', 'to', 'calculate', 'the', 'many', 'body', 'wavefunctions', 'of', 'dbt', 'and', 'we', 'use', 'these', 'wavefunctions', 'to', 'calculate', 'its', 'optical', 'properties', 'we', 'calculate', 'the', 'linear', 'absorption', 'spectrum', 'and', 'the', 'spatial', 'distributions', 'of', 'electrons', 'involved', 'in', 'several', 'bright', 'transitions', 'we', 'also', 'calculate', 'the', 'twophoton', 'absorption', 'spectrum', 'of', 'dbt', 'and', 'show', 'that', 'there', 'are', 'several', 'excited', 'states', 'that', 'are', 'bright', 'due', 'to', 'twophoton', 'absorption', 'except', 'at', 'high', 'photon', 'energies', 'we', 'predict', 'that', 'there', 'are', 'no', 'competing', 'optical', 'processes', 'regarding', 'the', 'use', 'of', 'dbt', 'as', 'a', 'sps', 'our', 'calculations', 'provide', 'details', 'of', 'the', 'optical', 'properties', 'of', 'dbt', 'that', 'are', 'interesting', 'in', 'general', 'and', 'useful', 'for', 'considering', 'optical', 'applications', 'of', 'dbt']]
|
[-0.043999627302242376, 0.06331595784167246, -0.06864464736930063, 0.0895445700798209, -0.026873246677929445, -0.13547010962862432, 0.024979125383645804, 0.48425723176424196, -0.19019544559220472, -0.2823873698508658, 0.05642692556091565, -0.3140408400110394, -0.13754676433191412, 0.2319611609536445, 0.020110528795745503, 0.07101085645956032, 0.045422979690717395, -0.02266347969444247, -0.0433005981379328, -0.14608647704811856, 0.28655214230118153, 0.046607098797158825, 0.2535557092332161, 0.11754568708350971, 0.06949333097392908, 0.013399555724823759, 0.007996150048538334, -0.039018373302861946, -0.12988420622522284, 0.15902373781799953, 0.26324600611890975, 0.09890539529749198, 0.2274410072840801, -0.39824118159812727, -0.2138231998296822, 0.1191741053211395, 0.14624512304716622, 0.16114271425825805, -0.09030744393172414, -0.2469635581863778, 0.03708084542256761, -0.14932105160590742, -0.15341308282143404, -0.1393425698030968, 0.01750538579139187, 0.04938735630099584, -0.227563507284741, 0.035363138049680956, -0.015611450280123042, 0.033859563073914314, -0.07071528471467801, -0.11774984183942988, -0.047412705488921125, 0.15070578287083175, -0.01301311892393951, -0.025446837194593383, 0.12927947242167734, -0.15574255662805522, -0.1291501991621846, 0.41818934117703616, -0.04832425650500623, -0.12759122670450734, 0.21001864109365714, -0.15805122950336054, -0.1331353220173164, 0.1746970824968564, 0.16446601180042944, 0.11084253975937815, -0.12128556081407456, 0.035580001427747664, -0.01602788281082144, 0.1843085669212322, 0.06994323957343998, 0.15430463621587664, 0.18243251892193188, 0.12885316845257672, -0.021172065647765612, 0.16686596182732508, -0.15576259975581347, -0.04631932250890868, -0.2530156124801356, -0.15331976978127293, -0.18377670457548634, 0.044992291187981565, -0.02891465455260394, -0.16641173216230776, 0.4167974940437798, 0.17186027090698733, 0.18605574414286077, -0.04850348184316033, 0.32398353732463453, 0.14097285730571035, 0.025232936626262203, -0.005392431576109054, 0.3014550351436396, 0.12916705618789864, 0.0743529697140476, -0.22814296203709783, 0.03059319801451195, -0.02846714736399602]
|
1,803.04805
|
WISERNet: Wider Separate-then-reunion Network for Steganalysis of Color
Images
|
Until recently, deep steganalyzers in spatial domain have been all designed
for gray-scale images. In this paper, we propose WISERNet (the wider
separate-then-reunion network) for steganalysis of color images. We provide
theoretical rationale to claim that the summation in normal convolution is one
sort of "linear collusion attack" which reserves strong correlated patterns
while impairs uncorrelated noises. Therefore in the bottom convolutional layer
which aims at suppressing correlated image contents, we adopt separate
channel-wise convolution without summation instead. Conversely, in the upper
convolutional layers we believe that the summation in normal convolution is
beneficial. Therefore we adopt united normal convolution in those layers and
make them remarkably wider to reinforce the effect of "linear collusion
attack". As a result, our proposed wide-and-shallow, separate-then-reunion
network structure is specifically suitable for color image steganalysis. We
have conducted extensive experiments on color image datasets generated from
BOSSBase raw images and another large-scale dataset which contains 100,000 raw
images, with different demosaicking algorithms and down-sampling algorithms.
The experimental results show that our proposed network outperforms other
state-of-the-art color image steganalytic models either hand-crafted or learned
using deep networks in the literature by a clear margin. Specifically, it is
noted that the detection performance gain is achieved with less than half the
complexity compared to the most advanced deep-learning steganalyzer as far as
we know, which is scarce in the literature.
|
cs.MM
|
until recently deep steganalyzers in spatial domain have been all designed for grayscale images in this paper we propose wisernet the wider separatethenreunion network for steganalysis of color images we provide theoretical rationale to claim that the summation in normal convolution is one sort of linear collusion attack which reserves strong correlated patterns while impairs uncorrelated noises therefore in the bottom convolutional layer which aims at suppressing correlated image contents we adopt separate channelwise convolution without summation instead conversely in the upper convolutional layers we believe that the summation in normal convolution is beneficial therefore we adopt united normal convolution in those layers and make them remarkably wider to reinforce the effect of linear collusion attack as a result our proposed wideandshallow separatethenreunion network structure is specifically suitable for color image steganalysis we have conducted extensive experiments on color image datasets generated from bossbase raw images and another largescale dataset which contains 100000 raw images with different demosaicking algorithms and downsampling algorithms the experimental results show that our proposed network outperforms other stateoftheart color image steganalytic models either handcrafted or learned using deep networks in the literature by a clear margin specifically it is noted that the detection performance gain is achieved with less than half the complexity compared to the most advanced deeplearning steganalyzer as far as we know which is scarce in the literature
|
[['until', 'recently', 'deep', 'steganalyzers', 'in', 'spatial', 'domain', 'have', 'been', 'all', 'designed', 'for', 'grayscale', 'images', 'in', 'this', 'paper', 'we', 'propose', 'wisernet', 'the', 'wider', 'separatethenreunion', 'network', 'for', 'steganalysis', 'of', 'color', 'images', 'we', 'provide', 'theoretical', 'rationale', 'to', 'claim', 'that', 'the', 'summation', 'in', 'normal', 'convolution', 'is', 'one', 'sort', 'of', 'linear', 'collusion', 'attack', 'which', 'reserves', 'strong', 'correlated', 'patterns', 'while', 'impairs', 'uncorrelated', 'noises', 'therefore', 'in', 'the', 'bottom', 'convolutional', 'layer', 'which', 'aims', 'at', 'suppressing', 'correlated', 'image', 'contents', 'we', 'adopt', 'separate', 'channelwise', 'convolution', 'without', 'summation', 'instead', 'conversely', 'in', 'the', 'upper', 'convolutional', 'layers', 'we', 'believe', 'that', 'the', 'summation', 'in', 'normal', 'convolution', 'is', 'beneficial', 'therefore', 'we', 'adopt', 'united', 'normal', 'convolution', 'in', 'those', 'layers', 'and', 'make', 'them', 'remarkably', 'wider', 'to', 'reinforce', 'the', 'effect', 'of', 'linear', 'collusion', 'attack', 'as', 'a', 'result', 'our', 'proposed', 'wideandshallow', 'separatethenreunion', 'network', 'structure', 'is', 'specifically', 'suitable', 'for', 'color', 'image', 'steganalysis', 'we', 'have', 'conducted', 'extensive', 'experiments', 'on', 'color', 'image', 'datasets', 'generated', 'from', 'bossbase', 'raw', 'images', 'and', 'another', 'largescale', 'dataset', 'which', 'contains', '100000', 'raw', 'images', 'with', 'different', 'demosaicking', 'algorithms', 'and', 'downsampling', 'algorithms', 'the', 'experimental', 'results', 'show', 'that', 'our', 'proposed', 'network', 'outperforms', 'other', 'stateoftheart', 'color', 'image', 'steganalytic', 'models', 'either', 'handcrafted', 'or', 'learned', 'using', 'deep', 'networks', 'in', 'the', 'literature', 'by', 'a', 'clear', 'margin', 'specifically', 'it', 'is', 'noted', 'that', 'the', 'detection', 'performance', 'gain', 'is', 'achieved', 'with', 'less', 'than', 'half', 'the', 'complexity', 'compared', 'to', 'the', 'most', 'advanced', 'deeplearning', 'steganalyzer', 'as', 'far', 'as', 'we', 'know', 'which', 'is', 'scarce', 'in', 'the', 'literature']]
|
[-0.03571943368087313, 0.007977880792102885, -0.07508006779611245, 0.08316575861294745, -0.10033511823496304, -0.18359592570954733, 0.03466489056580457, 0.48029211158906154, -0.24983725640521623, -0.2960134749762244, 0.0857550124129121, -0.29026160555601177, -0.19791883913913388, 0.16954228333050703, -0.1404580265547879, 0.0707358245439176, 0.10290187683589924, 0.021834869012850134, -0.06670993761797142, -0.31202710447476356, 0.32048468762350074, 0.03887469317477725, 0.3706175558864735, -0.007714078163828801, 0.07698404842039554, -0.03594189979186332, -0.0715998742810182, -0.012794817367312708, -0.03636588267512674, 0.11040900531959057, 0.2951069072531863, 0.15821380429819376, 0.2850562230115421, -0.44717024791952187, -0.24335190011314242, 0.07696658777291174, 0.14552744738086387, 0.1025498685661545, -0.0707198060976356, -0.3145819771447563, 0.1277796555570587, -0.16923126332495395, 0.01636102778191032, -0.10392877893409112, -0.011354954831453191, -0.02979762438262041, -0.2766746591038788, 0.05886429370703964, 0.07886689268514044, 0.05738400230024258, -0.016885701120151458, -0.16304701785053555, 0.008297695501430615, 0.157176962004857, 0.0010859317079119318, 0.05784655802163216, 0.1301920309397738, -0.19834372787387636, -0.10198809942838878, 0.322327503639007, -0.08101091715424617, -0.17711954916667966, 0.17931790590319815, -0.07647992112135792, -0.13023168306697058, 0.11261661142280728, 0.18061765374695496, 0.10925686914842946, -0.150467225914949, -0.02585025446417087, -0.08254887927942364, 0.19457121721158424, 0.08344258956909012, 0.04428366825890702, 0.15048852358286077, 0.21877409543145682, 0.039117049441834376, 0.17224500076462482, -0.17392112099922677, -0.053256058326066544, -0.19283120198645168, -0.08368554095494317, -0.20110502957758652, -0.03353127074083901, -0.07267797060148541, -0.12766417910697292, 0.3989413800703882, 0.23787546817943253, 0.19181886471929616, 0.08081632678036217, 0.37790111711181634, 0.025144789972539723, 0.17609882068417565, 0.0781431981605721, 0.22530663728940528, 0.017699366822410877, 0.10892498438238157, -0.11209897521300125, 0.08984037278312351, 0.036847940241280304]
|
1,803.04806
|
An SMB approach for pressure representation in amenable virtually
orderable groups
|
Given a countable discrete amenable virtually orderable group $G$ acting by
translations on a $G$-subshift $X \subseteq S^G$ and an absolutely summable
potential $\Phi$, we present a set of conditions to obtain a special integral
representation of pressure $P(\Phi)$. The approach is based on a
Shannon-McMillan-Breiman (SMB) type theorem for Gibbs measures due to
Gurevich-Tempelman (2007), and generalizes results from Gamarnik-Katz (2009),
Helvik-Lindgren (2014), and Marcus-Pavlov (2015) by extending the setting to
other groups besides $\mathbb{Z}^d$, by relaxing the assumptions on $X$ and
$\Phi$, and by using sufficient convergence conditions in a mean --instead of a
uniform-- sense. Under the fairly general context proposed here, these same
conditions turn out to be also necessary.
|
math.DS math.PR
|
given a countable discrete amenable virtually orderable group g acting by translations on a gsubshift x subseteq sg and an absolutely summable potential phi we present a set of conditions to obtain a special integral representation of pressure pphi the approach is based on a shannonmcmillanbreiman smb type theorem for gibbs measures due to gurevichtempelman 2007 and generalizes results from gamarnikkatz 2009 helviklindgren 2014 and marcuspavlov 2015 by extending the setting to other groups besides mathbbzd by relaxing the assumptions on x and phi and by using sufficient convergence conditions in a mean instead of a uniform sense under the fairly general context proposed here these same conditions turn out to be also necessary
|
[['given', 'a', 'countable', 'discrete', 'amenable', 'virtually', 'orderable', 'group', 'g', 'acting', 'by', 'translations', 'on', 'a', 'gsubshift', 'x', 'subseteq', 'sg', 'and', 'an', 'absolutely', 'summable', 'potential', 'phi', 'we', 'present', 'a', 'set', 'of', 'conditions', 'to', 'obtain', 'a', 'special', 'integral', 'representation', 'of', 'pressure', 'pphi', 'the', 'approach', 'is', 'based', 'on', 'a', 'shannonmcmillanbreiman', 'smb', 'type', 'theorem', 'for', 'gibbs', 'measures', 'due', 'to', 'gurevichtempelman', '2007', 'and', 'generalizes', 'results', 'from', 'gamarnikkatz', '2009', 'helviklindgren', '2014', 'and', 'marcuspavlov', '2015', 'by', 'extending', 'the', 'setting', 'to', 'other', 'groups', 'besides', 'mathbbzd', 'by', 'relaxing', 'the', 'assumptions', 'on', 'x', 'and', 'phi', 'and', 'by', 'using', 'sufficient', 'convergence', 'conditions', 'in', 'a', 'mean', 'instead', 'of', 'a', 'uniform', 'sense', 'under', 'the', 'fairly', 'general', 'context', 'proposed', 'here', 'these', 'same', 'conditions', 'turn', 'out', 'to', 'be', 'also', 'necessary']]
|
[-0.09274544306099415, 0.11017643021200042, -0.13792033891024238, 0.043086435477545655, -0.08205380759159611, -0.11691362859088589, 0.09668074852194299, 0.37679661776531825, -0.25492175003217366, -0.22684160659132016, 0.12986204822611233, -0.20476199062117798, -0.11137313018976287, 0.22187076150915924, -0.14210124207470057, 0.02386323730037971, 0.072333717295392, 0.07626512845639478, -0.07501066554422406, -0.27357875241220675, 0.33616312809965826, 0.01214192591776902, 0.2592403383036567, 0.04267536300626076, 0.13418717180294068, 0.02448481894098222, -0.02382041031960398, 0.031248212761288002, -0.17603767643343995, 0.08191221988527105, 0.18233705887528645, 0.0704653990412639, 0.27726460863751445, -0.36560525143180383, -0.18140249867931496, 0.15984176102687012, 0.03595305602489547, -0.017752851482311434, -0.048856819987254725, -0.33675441509959375, 0.10087580291385001, -0.15149408550086346, -0.12759040334600616, -0.09627576717598872, 0.0670681275004013, 0.037121706180782484, -0.3438363211441108, 0.05890531540525527, 0.147120489789681, 0.07483844845979051, -0.07292684505862945, -0.08149937641362405, -0.02951763376212594, 0.05468868392265656, -0.005085204581899399, 0.07290481251495129, 0.08072590510022234, -0.035390837541358036, -0.09037470820740881, 0.38087382577359674, -0.09033836272693324, -0.22456087551333687, 0.20036408888938076, -0.11331943599930541, -0.18384527531452477, 0.10367998583559794, 0.12409262992441654, 0.14368325310589916, -0.14513816419480877, 0.1839932016112884, -0.10516404127702117, 0.12493696918880398, 0.08674579584463075, -0.01682355520050888, 0.11826107605699111, 0.06781966816210612, 0.1440082434025085, 0.13767845449619925, 0.02029437199764123, -0.0443113548935137, -0.3558218468996612, -0.11736267229372804, -0.1585406291129237, 0.09315733066336675, -0.05623900721799476, -0.13768046265679665, 0.3480453937737779, 0.10414101269773461, 0.16844233082692053, 0.09963909651745449, 0.19415394342081113, 0.09785573243399003, 0.000222224018282511, 0.10288692937571217, 0.1052653285886415, 0.19752502203495664, 0.03293781110339544, -0.12961114306553181, 0.02984841577708721, 0.13207495416175913]
|
1,803.04807
|
Tensor form factor of $D \to \pi(K) \ell \nu$ and $D \to \pi(K) \ell
\ell$ decays with $N_f=2+1+1$ twisted-mass fermions
|
We present the first lattice Nf=2+1+1 determination of the tensor form factor
$f_T^{D \pi(K)}(q^2)$ corresponding to the semileptonic and rare $D \to \pi(K)$
decays as a function of the squared 4-momentum transfer $q^2$. Together with
our recent determination of the vector and scalar form factors we complete the
set of hadronic matrix elements regulating the semileptonic and rare $D \to
\pi(K)$ transitions within and beyond the Standard Model, when a non-zero
tensor coupling is possible. Our analysis is based on the gauge configurations
produced by ETMC with Nf=2+1+1 flavors of dynamical quarks, which include in
the sea, besides two light mass-degenerate quarks, also the strange and charm
quarks with masses close to their physical values. We simulated at three
different values of the lattice spacing and with pion masses as small as 220
MeV. The matrix elements of the tensor current are determined for plenty of
kinematical conditions in which parent and child mesons are either moving or at
rest. As in the case of the vector and scalar form factors, Lorentz symmetry
breaking due to hypercubic effects is clearly observed also in the data for the
tensor form factor and included in the decomposition of the current matrix
elements in terms of additional form factors. After the extrapolations to the
physical pion mass and to the continuum and infinite volume limits we determine
the tensor form factor in the whole kinematical region accessible in the
experiments. A set of synthetic data points, representing our results for
$f_T^{D \pi(K)}(q^2)$ for several selected values of $q^2$, is provided and the
corresponding covariance matrix is also available. At zero four-momentum
transfer we get $f_T^{D \pi}(0) = 0.506 (79)$ and $f_T^{D K}(0) = 0.687 (54)$,
which correspond to $f_T^{D \pi}(0)/f_+^{D \pi}(0) = 0.827 (114)$ and $f_T^{D
K}(0)/f_+^{D K}(0)= 0.898 (50)$.
|
hep-lat hep-ex hep-ph
|
we present the first lattice nf211 determination of the tensor form factor f_td pikq2 corresponding to the semileptonic and rare d to pik decays as a function of the squared 4momentum transfer q2 together with our recent determination of the vector and scalar form factors we complete the set of hadronic matrix elements regulating the semileptonic and rare d to pik transitions within and beyond the standard model when a nonzero tensor coupling is possible our analysis is based on the gauge configurations produced by etmc with nf211 flavors of dynamical quarks which include in the sea besides two light massdegenerate quarks also the strange and charm quarks with masses close to their physical values we simulated at three different values of the lattice spacing and with pion masses as small as 220 mev the matrix elements of the tensor current are determined for plenty of kinematical conditions in which parent and child mesons are either moving or at rest as in the case of the vector and scalar form factors lorentz symmetry breaking due to hypercubic effects is clearly observed also in the data for the tensor form factor and included in the decomposition of the current matrix elements in terms of additional form factors after the extrapolations to the physical pion mass and to the continuum and infinite volume limits we determine the tensor form factor in the whole kinematical region accessible in the experiments a set of synthetic data points representing our results for f_td pikq2 for several selected values of q2 is provided and the corresponding covariance matrix is also available at zero fourmomentum transfer we get f_td pi0 0506 79 and f_td k0 0687 54 which correspond to f_td pi0f_d pi0 0827 114 and f_td k0f_d k0 0898 50
|
[['we', 'present', 'the', 'first', 'lattice', 'nf211', 'determination', 'of', 'the', 'tensor', 'form', 'factor', 'f_td', 'pikq2', 'corresponding', 'to', 'the', 'semileptonic', 'and', 'rare', 'd', 'to', 'pik', 'decays', 'as', 'a', 'function', 'of', 'the', 'squared', '4momentum', 'transfer', 'q2', 'together', 'with', 'our', 'recent', 'determination', 'of', 'the', 'vector', 'and', 'scalar', 'form', 'factors', 'we', 'complete', 'the', 'set', 'of', 'hadronic', 'matrix', 'elements', 'regulating', 'the', 'semileptonic', 'and', 'rare', 'd', 'to', 'pik', 'transitions', 'within', 'and', 'beyond', 'the', 'standard', 'model', 'when', 'a', 'nonzero', 'tensor', 'coupling', 'is', 'possible', 'our', 'analysis', 'is', 'based', 'on', 'the', 'gauge', 'configurations', 'produced', 'by', 'etmc', 'with', 'nf211', 'flavors', 'of', 'dynamical', 'quarks', 'which', 'include', 'in', 'the', 'sea', 'besides', 'two', 'light', 'massdegenerate', 'quarks', 'also', 'the', 'strange', 'and', 'charm', 'quarks', 'with', 'masses', 'close', 'to', 'their', 'physical', 'values', 'we', 'simulated', 'at', 'three', 'different', 'values', 'of', 'the', 'lattice', 'spacing', 'and', 'with', 'pion', 'masses', 'as', 'small', 'as', '220', 'mev', 'the', 'matrix', 'elements', 'of', 'the', 'tensor', 'current', 'are', 'determined', 'for', 'plenty', 'of', 'kinematical', 'conditions', 'in', 'which', 'parent', 'and', 'child', 'mesons', 'are', 'either', 'moving', 'or', 'at', 'rest', 'as', 'in', 'the', 'case', 'of', 'the', 'vector', 'and', 'scalar', 'form', 'factors', 'lorentz', 'symmetry', 'breaking', 'due', 'to', 'hypercubic', 'effects', 'is', 'clearly', 'observed', 'also', 'in', 'the', 'data', 'for', 'the', 'tensor', 'form', 'factor', 'and', 'included', 'in', 'the', 'decomposition', 'of', 'the', 'current', 'matrix', 'elements', 'in', 'terms', 'of', 'additional', 'form', 'factors', 'after', 'the', 'extrapolations', 'to', 'the', 'physical', 'pion', 'mass', 'and', 'to', 'the', 'continuum', 'and', 'infinite', 'volume', 'limits', 'we', 'determine', 'the', 'tensor', 'form', 'factor', 'in', 'the', 'whole', 'kinematical', 'region', 'accessible', 'in', 'the', 'experiments', 'a', 'set', 'of', 'synthetic', 'data', 'points', 'representing', 'our', 'results', 'for', 'f_td', 'pikq2', 'for', 'several', 'selected', 'values', 'of', 'q2', 'is', 'provided', 'and', 'the', 'corresponding', 'covariance', 'matrix', 'is', 'also', 'available', 'at', 'zero', 'fourmomentum', 'transfer', 'we', 'get', 'f_td', 'pi0', '0506', '79', 'and', 'f_td', 'k0', '0687', '54', 'which', 'correspond', 'to', 'f_td', 'pi0f_d', 'pi0', '0827', '114', 'and', 'f_td', 'k0f_d', 'k0', '0898', '50']]
|
[-0.07256299424366323, 0.22733891648017124, -0.032121047913814475, 0.0596142168932639, -0.04039387850695663, -0.07584227205051607, 0.07534363502144178, 0.33040265866064095, -0.19130253152641125, -0.26066083951904245, 0.0516998860793673, -0.3258175118698751, -0.037092591866321405, 0.1187703303597255, 0.07425096285781004, 0.06522615434503627, 0.05540324809318345, 0.05206412055102266, -0.10689520665021032, -0.1981178516959006, 0.3351056867483238, 0.009261713722841942, 0.21601841754873272, 0.097678826292594, 0.0646401811670193, -0.009655378211914778, -0.049398237772362484, -0.05375949217784792, -0.11079874368324329, 0.06454787125662671, 0.1949434271768016, 0.08880499214227375, 0.13831805670952857, -0.3364807963387224, -0.11177456471677817, 0.10704172923459276, 0.1317277029938103, 0.07903368815210367, 0.007346640580592116, -0.2863810120002137, 0.11660707275038712, -0.17334678241415333, -0.13596793704017143, -0.10592662695195679, 0.030659753920140434, -0.059373651051491956, -0.3393054886323189, 0.10118908493602984, -0.03861075521505371, 0.06203867862804806, -0.061997242157079586, -0.258756816147967, -0.03104651980309377, 0.109798054436197, 0.10754915964267414, 0.07890981836172702, 0.12907565101600021, -0.14546186435642358, -0.08542358910837147, 0.4305917324453643, -0.06508640034565996, -0.2064288914069487, 0.14482290624825872, -0.1962813127017261, -0.10639397642090406, 0.13814172316789117, 0.19274372093567677, 0.060850408002383345, -0.15862296025169262, 0.0744815247268129, -0.04653652656300325, 0.1448857393291179, 0.08429396167008385, 0.0475833310541531, 0.17744082570664443, 0.1274449176797707, -0.04668465608488513, 0.06575923019997004, -0.07199136585823247, -0.09021205009536958, -0.3488277116047269, -0.1148364725363224, -0.1260236554040752, 0.09000729896887269, -0.1375269640313042, -0.12156100086676441, 0.3779274824741998, 0.057043642950814766, 0.2695630414298598, 0.011646307732555887, 0.2670692195047382, 0.07127923686234743, 0.10761072313770244, 0.09950529425548492, 0.2523405274459199, 0.18960223106463273, 0.09243441381242942, -0.2370789005191461, -0.03086927943274519, 0.061310521394735175]
|
1,803.04808
|
Semi-BCI Algebras
|
The notion of semi-BCI algebras is introduced and some of its properties are
investigated. This algebra is another generalization for BCI-algebras. It
arises from the "intervalization" of BCI algebras. Semi-BCI have a similar
structure to Pseudo-BCI algebras however they are not the same. In this paper
we also provide an investigation on the similarity between these classes of
algebras by showing how they relate to the process of intervalization.
|
cs.LO
|
the notion of semibci algebras is introduced and some of its properties are investigated this algebra is another generalization for bcialgebras it arises from the intervalization of bci algebras semibci have a similar structure to pseudobci algebras however they are not the same in this paper we also provide an investigation on the similarity between these classes of algebras by showing how they relate to the process of intervalization
|
[['the', 'notion', 'of', 'semibci', 'algebras', 'is', 'introduced', 'and', 'some', 'of', 'its', 'properties', 'are', 'investigated', 'this', 'algebra', 'is', 'another', 'generalization', 'for', 'bcialgebras', 'it', 'arises', 'from', 'the', 'intervalization', 'of', 'bci', 'algebras', 'semibci', 'have', 'a', 'similar', 'structure', 'to', 'pseudobci', 'algebras', 'however', 'they', 'are', 'not', 'the', 'same', 'in', 'this', 'paper', 'we', 'also', 'provide', 'an', 'investigation', 'on', 'the', 'similarity', 'between', 'these', 'classes', 'of', 'algebras', 'by', 'showing', 'how', 'they', 'relate', 'to', 'the', 'process', 'of', 'intervalization']]
|
[-0.09707122771942522, 0.0694300371017107, -0.11439247045200318, 0.08383638895352874, -0.08867006472428329, -0.09505599291878752, -0.02999210448433587, 0.40525663693551905, -0.360528809716925, -0.26741163540282287, 0.1308109025540034, -0.2506172766443342, -0.2045556887460407, 0.21471007763466332, -0.1533997190563241, -0.06300574223951116, 0.03374324786273064, 0.10018302793150724, -0.12210897781551466, -0.2648807262266928, 0.4014398074214114, 0.05087595425720792, 0.23766058854016592, 0.058868166197498795, 0.05455670375522459, -0.02599247889884282, -0.03629020047810627, 0.029724258245551027, -0.14736816652293783, 0.14322091406211257, 0.25474674128054176, 0.138900915364502, 0.2677543761419656, -0.3561599302338436, -0.12661705406208057, 0.13001737218291964, 0.1408565636666026, 0.09058699049637653, -0.04472189960688411, -0.27000494831008837, 0.1125762136944104, -0.1680707632767735, -0.07778748170676408, -0.0812661701493198, 0.023864731949288398, 0.01636625634819211, -0.188188359189553, 0.017015378961787064, 0.12855198254692368, 0.10132044080933156, -0.08549715826120519, -0.06086979393148795, -0.046530757386790356, 0.14880903651646804, 0.007033465858967247, -0.030893712428223807, 0.07997551801236114, -0.11423848164122319, -0.16934863486676477, 0.3714048755937256, 0.06227487959404243, -0.23242544516688213, 0.22629694821080193, -0.14989683205931215, -0.18928389673965285, 0.04293399319067248, 0.10927063348935917, 0.11050931249337737, -0.140740583186016, 0.09764996271314885, -0.11871637027070392, 0.05138448436628096, 0.05829965227167122, 0.04579629359068349, 0.1673235277994536, 0.14077842512051575, 0.015165464214078384, 0.1620145901251817, 0.04000553678997676, -0.04423725062952144, -0.30249372727121226, -0.1781044561212184, -0.11785402898385655, 0.04861936741531281, -0.052019286063796244, -0.18028795977443224, 0.41827737144194543, 0.19609772742842324, 0.22193063851591432, 0.05760963978536893, 0.2038114612987556, 0.12489876570907654, 0.15346409915218828, 0.026410775040858425, 0.2364115547629808, 0.21362371559735038, 0.07574349072092446, -0.14805649871232163, 0.056223442959890235, 0.09282177049317397]
|
1,803.04809
|
First detection of bromine and antimony in hot stars
|
Bromine (atomic number Z=35) and antimony (Z=51) are extremely difficult to
detect in stars. In very few instances, weak and mostly uncertain
identifications of Br I, Br II, and Sb II in relatively cool, chemically
peculiar stars were successful. Adopted solar abundance values rely on
meteoritic determinations. Here, we announce the first identification of these
species in far-ultraviolet spectra of hot stars (with effective temperatures of
49,500-70,000 K), namely in helium-rich (spectral type DO) white dwarfs. We
identify the Br VI resonance line at 945.96 A. A previous claim of Br detection
based on this line is incorrect because its wavelength position is inaccurate
by about 7 A in atomic databases. Taking advantage of precise laboratory
measurements, we identify this line as well as two other, subordinate Br VI
lines. Antimony is detected by the Sb V resonance doublet at 1104.23/1225.98 A,
as well as two subordinate Sb VI lines. A model-atmosphere analysis reveals
strongly oversolar Br and Sb abundances that are caused by radiative-levitation
dominated atomic diffusion.
|
astro-ph.SR
|
bromine atomic number z35 and antimony z51 are extremely difficult to detect in stars in very few instances weak and mostly uncertain identifications of br i br ii and sb ii in relatively cool chemically peculiar stars were successful adopted solar abundance values rely on meteoritic determinations here we announce the first identification of these species in farultraviolet spectra of hot stars with effective temperatures of 4950070000 k namely in heliumrich spectral type do white dwarfs we identify the br vi resonance line at 94596 a a previous claim of br detection based on this line is incorrect because its wavelength position is inaccurate by about 7 a in atomic databases taking advantage of precise laboratory measurements we identify this line as well as two other subordinate br vi lines antimony is detected by the sb v resonance doublet at 110423122598 a as well as two subordinate sb vi lines a modelatmosphere analysis reveals strongly oversolar br and sb abundances that are caused by radiativelevitation dominated atomic diffusion
|
[['bromine', 'atomic', 'number', 'z35', 'and', 'antimony', 'z51', 'are', 'extremely', 'difficult', 'to', 'detect', 'in', 'stars', 'in', 'very', 'few', 'instances', 'weak', 'and', 'mostly', 'uncertain', 'identifications', 'of', 'br', 'i', 'br', 'ii', 'and', 'sb', 'ii', 'in', 'relatively', 'cool', 'chemically', 'peculiar', 'stars', 'were', 'successful', 'adopted', 'solar', 'abundance', 'values', 'rely', 'on', 'meteoritic', 'determinations', 'here', 'we', 'announce', 'the', 'first', 'identification', 'of', 'these', 'species', 'in', 'farultraviolet', 'spectra', 'of', 'hot', 'stars', 'with', 'effective', 'temperatures', 'of', '4950070000', 'k', 'namely', 'in', 'heliumrich', 'spectral', 'type', 'do', 'white', 'dwarfs', 'we', 'identify', 'the', 'br', 'vi', 'resonance', 'line', 'at', '94596', 'a', 'a', 'previous', 'claim', 'of', 'br', 'detection', 'based', 'on', 'this', 'line', 'is', 'incorrect', 'because', 'its', 'wavelength', 'position', 'is', 'inaccurate', 'by', 'about', '7', 'a', 'in', 'atomic', 'databases', 'taking', 'advantage', 'of', 'precise', 'laboratory', 'measurements', 'we', 'identify', 'this', 'line', 'as', 'well', 'as', 'two', 'other', 'subordinate', 'br', 'vi', 'lines', 'antimony', 'is', 'detected', 'by', 'the', 'sb', 'v', 'resonance', 'doublet', 'at', '110423122598', 'a', 'as', 'well', 'as', 'two', 'subordinate', 'sb', 'vi', 'lines', 'a', 'modelatmosphere', 'analysis', 'reveals', 'strongly', 'oversolar', 'br', 'and', 'sb', 'abundances', 'that', 'are', 'caused', 'by', 'radiativelevitation', 'dominated', 'atomic', 'diffusion']]
|
[-0.03566620402941736, 0.10877294944267062, 0.036341363842394656, 0.06881094717338294, -0.05892127758337798, -0.17819175379714225, 0.12470796657726169, 0.44443634672590143, -0.16532966015553782, -0.33633209816634474, 0.02265267175048726, -0.30790728680993906, -0.020476910177754555, 0.1389031231200334, -0.05998873233489221, -0.055534984083351446, 0.0454710272904599, -0.05291002230908971, -0.03024701023525445, -0.20843004498335466, 0.2815342210062848, 0.004705022177204672, 0.1833782051221422, 0.007816299892643966, -0.03031208865605749, -0.10188792038583992, -0.08247814165109203, 0.031101097693530526, -0.12209791684880457, 0.07736688055149166, 0.2558985375783267, 0.11124445665744843, 0.19971734073535516, -0.3472110624992993, -0.19019662909118867, 0.04041338531923674, 0.1898953899536736, 0.06799737226626859, -0.06779974179552505, -0.2803602301595142, 0.05601427021504539, -0.07421818165472005, -0.11498031879472831, 0.002379024267855396, 0.08674218621184458, 0.05275812763266447, -0.2256533894943437, 0.08381958995081865, 0.03112429100594188, 0.17053019710129308, -0.08453015362057358, -0.21445121489771893, -0.07384305753427126, 0.021015331617601943, -0.0031132702460149077, -0.02020680333669411, 0.18344101710699318, -0.08583817912106652, -0.001600288547484613, 0.419255936572615, -0.15885349676416188, -0.01807082500525256, 0.24808865502368796, -0.14869322708847638, -0.20275926733923302, 0.19571028695379317, 0.09421986772284116, 0.17387008923105896, -0.16282401897762788, 0.04979460354661569, -0.0048967910385349905, 0.18640767639820896, 0.05906863146029958, 0.08745928018967189, 0.25218992138554047, 0.09626674087911208, -0.013451028847357077, 0.022526955045688694, -0.23330552606678726, -0.019283926872559254, -0.22905538184568286, -0.17268620481112654, -0.10683714266207706, 0.0835839287646217, -0.055323715735206995, -0.16276066001538733, 0.3219274504322462, 0.10661939436054459, 0.2558752344935428, -0.06302880151083738, 0.2670851783633868, 0.0868405017557429, 0.04974148167217741, 0.028505359375962942, 0.292518765852991, 0.18128726536851014, 0.13092157198116183, -0.244415283788041, 0.11756034739451801, 0.028987956687626316]
|
1,803.0481
|
Space-Time Quasicrystal Structures and Inflationary and Late Time
Evolution Dynamics in Accelerating Cosmology
|
We construct new classes of cosmological solutions in modified and Einstein
gravity theories encoding space-time quasicrystal, STQC, configurations
modelled by nonlinear self-organized and pattern forming quasi-periodic
structures. Such solutions are defined by generic off-diagonal locally
anisotropic and inhomogeneous metrics depending via generating and integration
functions on all spacetime coordinates. There are defined nonholonomic
variables and conditions for the generating/integration functions and sources
for effective descriptions, or approximations, as "quasi"
Friedmann-Lama\^itre-Robertson-Walker (FLRW) metrics. Such (off-) diagonal
STQC-FLRW configurations contain memory on nonlinear classical and/or quantum
interactions and may describe new acceleration cosmology scenarios. For special
time-periodic conditions on nonlinear gravitational and matter field
interactions, we can model at cosmological scales certain analogous of time
crystal like structures originally postulated by Frank Wilczek in condensed
matter physics. We speculate how STQC quasi-FLRW configurations could explain
modern cosmology data and provide viable descriptions for the inflation and
structure formation in our Universe. Finally, it is discussed systematically
and critically how a unified description of inflation with dark energy era can
be explained by (modified) cosmological STQC-scenarios.
|
physics.gen-ph
|
we construct new classes of cosmological solutions in modified and einstein gravity theories encoding spacetime quasicrystal stqc configurations modelled by nonlinear selforganized and pattern forming quasiperiodic structures such solutions are defined by generic offdiagonal locally anisotropic and inhomogeneous metrics depending via generating and integration functions on all spacetime coordinates there are defined nonholonomic variables and conditions for the generatingintegration functions and sources for effective descriptions or approximations as quasi friedmannlamaitrerobertsonwalker flrw metrics such off diagonal stqcflrw configurations contain memory on nonlinear classical andor quantum interactions and may describe new acceleration cosmology scenarios for special timeperiodic conditions on nonlinear gravitational and matter field interactions we can model at cosmological scales certain analogous of time crystal like structures originally postulated by frank wilczek in condensed matter physics we speculate how stqc quasiflrw configurations could explain modern cosmology data and provide viable descriptions for the inflation and structure formation in our universe finally it is discussed systematically and critically how a unified description of inflation with dark energy era can be explained by modified cosmological stqcscenarios
|
[['we', 'construct', 'new', 'classes', 'of', 'cosmological', 'solutions', 'in', 'modified', 'and', 'einstein', 'gravity', 'theories', 'encoding', 'spacetime', 'quasicrystal', 'stqc', 'configurations', 'modelled', 'by', 'nonlinear', 'selforganized', 'and', 'pattern', 'forming', 'quasiperiodic', 'structures', 'such', 'solutions', 'are', 'defined', 'by', 'generic', 'offdiagonal', 'locally', 'anisotropic', 'and', 'inhomogeneous', 'metrics', 'depending', 'via', 'generating', 'and', 'integration', 'functions', 'on', 'all', 'spacetime', 'coordinates', 'there', 'are', 'defined', 'nonholonomic', 'variables', 'and', 'conditions', 'for', 'the', 'generatingintegration', 'functions', 'and', 'sources', 'for', 'effective', 'descriptions', 'or', 'approximations', 'as', 'quasi', 'friedmannlamaitrerobertsonwalker', 'flrw', 'metrics', 'such', 'off', 'diagonal', 'stqcflrw', 'configurations', 'contain', 'memory', 'on', 'nonlinear', 'classical', 'andor', 'quantum', 'interactions', 'and', 'may', 'describe', 'new', 'acceleration', 'cosmology', 'scenarios', 'for', 'special', 'timeperiodic', 'conditions', 'on', 'nonlinear', 'gravitational', 'and', 'matter', 'field', 'interactions', 'we', 'can', 'model', 'at', 'cosmological', 'scales', 'certain', 'analogous', 'of', 'time', 'crystal', 'like', 'structures', 'originally', 'postulated', 'by', 'frank', 'wilczek', 'in', 'condensed', 'matter', 'physics', 'we', 'speculate', 'how', 'stqc', 'quasiflrw', 'configurations', 'could', 'explain', 'modern', 'cosmology', 'data', 'and', 'provide', 'viable', 'descriptions', 'for', 'the', 'inflation', 'and', 'structure', 'formation', 'in', 'our', 'universe', 'finally', 'it', 'is', 'discussed', 'systematically', 'and', 'critically', 'how', 'a', 'unified', 'description', 'of', 'inflation', 'with', 'dark', 'energy', 'era', 'can', 'be', 'explained', 'by', 'modified', 'cosmological', 'stqcscenarios']]
|
[-0.15103496552840945, 0.1720382269516498, -0.08934677170776388, 0.17039580680750602, -0.09628191162569973, -0.16855690724210826, -0.07673208442416243, 0.3411421011854521, -0.23636759459849693, -0.30510770497163253, 0.09123232159456851, -0.2081431452210011, -0.16074699629377015, 0.18421046706864577, -0.007249576298932651, 0.0218680500956308, -0.013499805357301619, -0.028827242434553212, -0.070109572904296, -0.25440533489719436, 0.3715951200630404, 0.08691387112924416, 0.24289932950193474, -0.012498766473845808, 0.10677137669691018, -0.03815996560859243, -0.0348481884097937, 0.049049870150085696, -0.19307080209032149, 0.026148436696988023, 0.21842089875930262, 0.12231468922084944, 0.1704512496902691, -0.4679675308240209, -0.28086699368599466, 0.10435995249346758, 0.1385512968363564, 0.14481929944504698, -0.07653672879991891, -0.3168920945141933, 0.019747061245031877, -0.15684345941488703, -0.14965591333739595, -0.14361653924211412, 0.016247549499273522, 0.025288509779392246, -0.2189348880079586, 0.09961243253671788, -0.000469333352799901, -0.017607149970578308, -0.11584180375438428, -0.05575328151427745, 0.0074788886192115305, 0.011444843311453918, 0.03367569779176934, -0.00888613735821968, 0.14733791888083617, -0.14114651840366982, -0.13864397534732512, 0.42764618721773884, -0.08793731109123443, -0.2348481027442895, 0.18312237982799906, -0.08834570765977692, -0.14380309145763784, 0.05480975375586039, 0.1564770878796622, 0.08461087596502356, -0.1445066453892498, 0.1525344084533528, 0.0333825308344366, 0.12959152194504028, 0.13642255114084723, 0.060138266498758315, 0.32975242262940385, 0.12160784695478725, 0.00261266079234952, 0.08080987697871525, 0.022062624075511347, -0.14460319908848868, -0.33772924947859106, -0.08610736652874126, -0.12546610012497128, 0.07370413730093864, -0.1452952562515034, -0.19222892916720907, 0.3653256883565894, 0.08656890958186496, 0.13282885604878208, 0.0009156214742514188, 0.21189081793494835, 0.0649238401991845, 0.04016538707450211, 0.07150711123078704, 0.23946735386396506, 0.11347355008192227, 0.10380237759648638, -0.1725447254205223, -0.010998641567382806, 0.08234397183914116]
|
1,803.04811
|
A Physical Model for the Spectral-Timing Properties of Accreting Black
Holes
|
We develop new techniques to deconvolve the radial structure of the X-ray
emission region in the bright low/hard state of the black hole Cygnus X-1 using
both spectral and timing data in the 3-35~keV range. The spectrum at these
energies is dominated by Comptonisation rather than the disc, but there is a
complex pattern in the time lags between different energy bands and differences
in the normalisation and shape in the power spectra of these bands, which
clearly shows that the Comptonisation is not produced from a single,
homogeneous region. We use a physically based model of density fluctuations
propagating through a spectrally inhomogeneous flow, setting the spectral
components by jointly fitting to the time-averaged and Fourier resolved
spectra. The predicted variability in any band is modelled analytically in
Fourier space so it can be fit directly to the observed power spectra and lags.
We find that the best fit model picks out three distinct radii in the flow,
each with a distinct Compton spectrum. The variability and luminosity produced
at these radii is enhanced, while propagation of fluctuations from larger radii
is suppressed. We associate these radii with the disc truncation, the inner
edge of the flow, and (more speculatively) the jet launch radius. These
distinct radii are most evident where the source is close to a transition
between the low/hard and high/soft states. We suggest that the smoother power
spectra seen at lower luminosities imply that the source structure is simpler
away from the transition.
|
astro-ph.HE
|
we develop new techniques to deconvolve the radial structure of the xray emission region in the bright lowhard state of the black hole cygnus x1 using both spectral and timing data in the 335kev range the spectrum at these energies is dominated by comptonisation rather than the disc but there is a complex pattern in the time lags between different energy bands and differences in the normalisation and shape in the power spectra of these bands which clearly shows that the comptonisation is not produced from a single homogeneous region we use a physically based model of density fluctuations propagating through a spectrally inhomogeneous flow setting the spectral components by jointly fitting to the timeaveraged and fourier resolved spectra the predicted variability in any band is modelled analytically in fourier space so it can be fit directly to the observed power spectra and lags we find that the best fit model picks out three distinct radii in the flow each with a distinct compton spectrum the variability and luminosity produced at these radii is enhanced while propagation of fluctuations from larger radii is suppressed we associate these radii with the disc truncation the inner edge of the flow and more speculatively the jet launch radius these distinct radii are most evident where the source is close to a transition between the lowhard and highsoft states we suggest that the smoother power spectra seen at lower luminosities imply that the source structure is simpler away from the transition
|
[['we', 'develop', 'new', 'techniques', 'to', 'deconvolve', 'the', 'radial', 'structure', 'of', 'the', 'xray', 'emission', 'region', 'in', 'the', 'bright', 'lowhard', 'state', 'of', 'the', 'black', 'hole', 'cygnus', 'x1', 'using', 'both', 'spectral', 'and', 'timing', 'data', 'in', 'the', '335kev', 'range', 'the', 'spectrum', 'at', 'these', 'energies', 'is', 'dominated', 'by', 'comptonisation', 'rather', 'than', 'the', 'disc', 'but', 'there', 'is', 'a', 'complex', 'pattern', 'in', 'the', 'time', 'lags', 'between', 'different', 'energy', 'bands', 'and', 'differences', 'in', 'the', 'normalisation', 'and', 'shape', 'in', 'the', 'power', 'spectra', 'of', 'these', 'bands', 'which', 'clearly', 'shows', 'that', 'the', 'comptonisation', 'is', 'not', 'produced', 'from', 'a', 'single', 'homogeneous', 'region', 'we', 'use', 'a', 'physically', 'based', 'model', 'of', 'density', 'fluctuations', 'propagating', 'through', 'a', 'spectrally', 'inhomogeneous', 'flow', 'setting', 'the', 'spectral', 'components', 'by', 'jointly', 'fitting', 'to', 'the', 'timeaveraged', 'and', 'fourier', 'resolved', 'spectra', 'the', 'predicted', 'variability', 'in', 'any', 'band', 'is', 'modelled', 'analytically', 'in', 'fourier', 'space', 'so', 'it', 'can', 'be', 'fit', 'directly', 'to', 'the', 'observed', 'power', 'spectra', 'and', 'lags', 'we', 'find', 'that', 'the', 'best', 'fit', 'model', 'picks', 'out', 'three', 'distinct', 'radii', 'in', 'the', 'flow', 'each', 'with', 'a', 'distinct', 'compton', 'spectrum', 'the', 'variability', 'and', 'luminosity', 'produced', 'at', 'these', 'radii', 'is', 'enhanced', 'while', 'propagation', 'of', 'fluctuations', 'from', 'larger', 'radii', 'is', 'suppressed', 'we', 'associate', 'these', 'radii', 'with', 'the', 'disc', 'truncation', 'the', 'inner', 'edge', 'of', 'the', 'flow', 'and', 'more', 'speculatively', 'the', 'jet', 'launch', 'radius', 'these', 'distinct', 'radii', 'are', 'most', 'evident', 'where', 'the', 'source', 'is', 'close', 'to', 'a', 'transition', 'between', 'the', 'lowhard', 'and', 'highsoft', 'states', 'we', 'suggest', 'that', 'the', 'smoother', 'power', 'spectra', 'seen', 'at', 'lower', 'luminosities', 'imply', 'that', 'the', 'source', 'structure', 'is', 'simpler', 'away', 'from', 'the', 'transition']]
|
[-0.058438515438739874, 0.12373850517716956, -0.11700447070094325, 0.1049401028994168, -0.048082502367641264, -0.11342798307825758, 0.006707085887106453, 0.4432016753977755, -0.2563152201005212, -0.311186147333649, 0.07769774896380438, -0.3162414451159075, -0.03650579695888924, 0.19346874434149794, 0.0035086487336141036, -0.01130326964837552, 0.024962611645043684, -0.04498961162034089, -0.07425122156008564, -0.13781871449683103, 0.3304718208889197, 0.07431018300736852, 0.220663780954144, -0.002990975045614187, 0.017001708835075662, -0.04971274024356399, -0.024046791018918157, 0.018274433323919464, -0.10823558716586605, 0.0808334131173816, 0.23139303966758515, 0.08821697454573965, 0.1827048292039038, -0.3645168806149859, -0.24206427095563915, 0.07466412509500041, 0.15753192519125475, 0.028151088792686844, -0.001697285927378296, -0.22908795666237308, 0.05228433266686223, -0.17425964840799493, -0.12815466799159966, -0.008422440244452802, 0.02653378361412059, -0.01638042859376287, -0.23237372629724942, 0.12943800453785656, 0.037639997306098114, 0.016517945350908742, -0.11691752578722449, -0.07805854094600896, -0.07755226876616962, 0.10512374879837763, 0.06295095570579186, 0.02386465528790604, 0.14347417052736794, -0.1046544461079487, -0.059860590794237285, 0.35585142104939477, -0.06736103948746378, -0.07172833522308497, 0.187000063364394, -0.2345098629332388, -0.10897717384121768, 0.22289302754518767, 0.13555911608699073, 0.11077911673469575, -0.10111310553776737, 0.00814641611764162, -0.012220691140869828, 0.24626636914094927, 0.06118072792925546, 0.04913950088714075, 0.29558496969577863, 0.08829170693851614, 0.026358160014921844, 0.1403101267935746, -0.18662554633659803, -0.06902197109558052, -0.2796564988131309, -0.04203395488126794, -0.18193623932112554, 0.039956955413385654, -0.09931902101640097, -0.1351995967276552, 0.4167716850420627, 0.08424377379507371, 0.2661583149442222, 0.03117131752414417, 0.32302604259627804, 0.1667780897587659, 0.07859452063694777, 0.17487558060159103, 0.30043838768714765, 0.11251591923419477, 0.10717962690481417, -0.23396092723076406, 0.041689647181807614, -0.0030610591288640853]
|
1,803.04812
|
Learning with End-Users in Distribution Grids: Topology and Parameter
Estimation
|
Efficient operation of distribution grids in the smart-grid era is hindered
by the limited presence of real-time nodal and line meters. In particular, this
prevents the easy estimation of grid topology and associated line parameters
that are necessary for control and optimization efforts in the grid. This paper
studies the problems of topology and parameter estimation in radial balanced
distribution grids where measurements are restricted to only the leaf nodes and
all intermediate nodes are unobserved/hidden. To this end, we propose two exact
learning algorithms that use balanced voltage and injection measured only at
the end-users. The first algorithm requires time-stamped voltage samples,
statistics of nodal power injections and permissible line impedances to recover
the true topology. The second and improved algorithm requires only time-stamped
voltage and complex power samples to recover both the true topology and
impedances without any additional input (e.g., number of grid nodes, statistics
of injections at hidden nodes, permissible line impedances). We prove the
correctness of both learning algorithms for grids where unobserved buses/nodes
have a degree greater than three and discuss extensions to regimes where that
assumption doesn't hold. Further, we present computational and, more
importantly, the sample complexity of our proposed algorithm for joint topology
and impedance estimation. We illustrate the performance of the designed
algorithms through numerical experiments on the IEEE and custom power
distribution models.
|
cs.SY
|
efficient operation of distribution grids in the smartgrid era is hindered by the limited presence of realtime nodal and line meters in particular this prevents the easy estimation of grid topology and associated line parameters that are necessary for control and optimization efforts in the grid this paper studies the problems of topology and parameter estimation in radial balanced distribution grids where measurements are restricted to only the leaf nodes and all intermediate nodes are unobservedhidden to this end we propose two exact learning algorithms that use balanced voltage and injection measured only at the endusers the first algorithm requires timestamped voltage samples statistics of nodal power injections and permissible line impedances to recover the true topology the second and improved algorithm requires only timestamped voltage and complex power samples to recover both the true topology and impedances without any additional input eg number of grid nodes statistics of injections at hidden nodes permissible line impedances we prove the correctness of both learning algorithms for grids where unobserved busesnodes have a degree greater than three and discuss extensions to regimes where that assumption doesnt hold further we present computational and more importantly the sample complexity of our proposed algorithm for joint topology and impedance estimation we illustrate the performance of the designed algorithms through numerical experiments on the ieee and custom power distribution models
|
[['efficient', 'operation', 'of', 'distribution', 'grids', 'in', 'the', 'smartgrid', 'era', 'is', 'hindered', 'by', 'the', 'limited', 'presence', 'of', 'realtime', 'nodal', 'and', 'line', 'meters', 'in', 'particular', 'this', 'prevents', 'the', 'easy', 'estimation', 'of', 'grid', 'topology', 'and', 'associated', 'line', 'parameters', 'that', 'are', 'necessary', 'for', 'control', 'and', 'optimization', 'efforts', 'in', 'the', 'grid', 'this', 'paper', 'studies', 'the', 'problems', 'of', 'topology', 'and', 'parameter', 'estimation', 'in', 'radial', 'balanced', 'distribution', 'grids', 'where', 'measurements', 'are', 'restricted', 'to', 'only', 'the', 'leaf', 'nodes', 'and', 'all', 'intermediate', 'nodes', 'are', 'unobservedhidden', 'to', 'this', 'end', 'we', 'propose', 'two', 'exact', 'learning', 'algorithms', 'that', 'use', 'balanced', 'voltage', 'and', 'injection', 'measured', 'only', 'at', 'the', 'endusers', 'the', 'first', 'algorithm', 'requires', 'timestamped', 'voltage', 'samples', 'statistics', 'of', 'nodal', 'power', 'injections', 'and', 'permissible', 'line', 'impedances', 'to', 'recover', 'the', 'true', 'topology', 'the', 'second', 'and', 'improved', 'algorithm', 'requires', 'only', 'timestamped', 'voltage', 'and', 'complex', 'power', 'samples', 'to', 'recover', 'both', 'the', 'true', 'topology', 'and', 'impedances', 'without', 'any', 'additional', 'input', 'eg', 'number', 'of', 'grid', 'nodes', 'statistics', 'of', 'injections', 'at', 'hidden', 'nodes', 'permissible', 'line', 'impedances', 'we', 'prove', 'the', 'correctness', 'of', 'both', 'learning', 'algorithms', 'for', 'grids', 'where', 'unobserved', 'busesnodes', 'have', 'a', 'degree', 'greater', 'than', 'three', 'and', 'discuss', 'extensions', 'to', 'regimes', 'where', 'that', 'assumption', 'doesnt', 'hold', 'further', 'we', 'present', 'computational', 'and', 'more', 'importantly', 'the', 'sample', 'complexity', 'of', 'our', 'proposed', 'algorithm', 'for', 'joint', 'topology', 'and', 'impedance', 'estimation', 'we', 'illustrate', 'the', 'performance', 'of', 'the', 'designed', 'algorithms', 'through', 'numerical', 'experiments', 'on', 'the', 'ieee', 'and', 'custom', 'power', 'distribution', 'models']]
|
[-0.1496443653186607, 0.04959770586438108, -0.005624905937594605, 0.031747180259018834, -0.09199586805996594, -0.18777980388830173, 0.11014202548881052, 0.4008399855590904, -0.24702176558869043, -0.3529080101981054, 0.10657039508890824, -0.253383733028009, -0.11682762376762726, 0.19898076550715166, -0.08155557321099279, 0.09197933610522414, 0.08234004020430818, 0.007124686324213808, -0.045428495855188114, -0.23983369151503686, 0.30093571274889513, 0.06940406679830237, 0.3224497884428045, 0.023531340066813403, 0.1108176103176398, -0.0008913224462319065, -0.03935155114746309, 0.04880366106161026, -0.10082963922399653, 0.11478740452402816, 0.2729398067817251, 0.14034101444711858, 0.260541749333644, -0.4500104444947234, -0.2071693575445999, 0.15473925920679477, 0.13380781930223945, 0.07299917089220069, -0.012655972625637063, -0.22542704403534666, 0.13285280610613004, -0.14095658728353908, -0.07099891765890559, -0.06844272787120563, -0.011780248299924875, 0.07165053697420401, -0.2938520368733989, 0.021992218899876216, 0.04918294516392052, 0.06540610677109578, -0.03027805724592359, -0.09518389140731899, -0.03600190350941072, 0.15274182525251023, -0.0038186395991811747, -0.03762681795250591, 0.1244592878292105, -0.12873844590210062, -0.11423586237953288, 0.3372208812391503, 0.034551583713658365, -0.20448434179195682, 0.15142629981834885, -0.12408970986484541, -0.1345103471676257, 0.12061594483056651, 0.2225892819725879, 0.09373823197889938, -0.09866349925790485, 0.07800215294611901, 0.00612331178828, 0.17186011974007595, 0.049357515157762544, -0.0042102078189821665, 0.1355483493159907, 0.14057046753356467, 0.1309665003049435, 0.10849563227830085, -0.11982377821937212, -0.07651707330752197, -0.2734446191514196, -0.10273174305922596, -0.21618218398873215, -0.0031677915311947064, -0.1164044339141886, -0.159889795280456, 0.43462896975478876, 0.19619753375557158, 0.19950472716208514, 0.087235455132228, 0.3881373465782753, 0.0925705474927216, 0.0313882918332007, 0.13258643986380383, 0.1771816322191929, 0.09723134052222343, 0.11594852274871087, -0.19513468137695264, 0.10644370414681632, 0.01324893497580847]
|
1,803.04813
|
Artificial neural network based modelling approach for municipal solid
waste gasification in a fluidized bed reactor
|
In this paper, multi-layer feed forward neural networks are used to predict
the lower heating value of gas (LHV), lower heating value of gasification
products including tars and entrained char (LHVp) and syngas yield during
gasification of municipal solid waste (MSW) during gasification in a fluidized
bed reactor. These artificial neural networks (ANNs) with different
architectures are trained using the Levenberg-Marquardt (LM) back-propagation
algorithm and a cross validation is also performed to ensure that the results
generalise to other unseen datasets. A rigorous study is carried out on
optimally choosing the number of hidden layers, number of neurons in the hidden
layer and activation function in a network using multiple Monte Carlo runs.
Nine input and three output parameters are used to train and test various
neural network architectures in both multiple output and single output
prediction paradigms using the available experimental datasets. The model
selection procedure is carried out to ascertain the best network architecture
in terms of predictive accuracy. The simulation results show that the ANN based
methodology is a viable alternative which can be used to predict the
performance of a fluidized bed gasifier.
|
cs.LG cs.CE cs.NE physics.data-an
|
in this paper multilayer feed forward neural networks are used to predict the lower heating value of gas lhv lower heating value of gasification products including tars and entrained char lhvp and syngas yield during gasification of municipal solid waste msw during gasification in a fluidized bed reactor these artificial neural networks anns with different architectures are trained using the levenbergmarquardt lm backpropagation algorithm and a cross validation is also performed to ensure that the results generalise to other unseen datasets a rigorous study is carried out on optimally choosing the number of hidden layers number of neurons in the hidden layer and activation function in a network using multiple monte carlo runs nine input and three output parameters are used to train and test various neural network architectures in both multiple output and single output prediction paradigms using the available experimental datasets the model selection procedure is carried out to ascertain the best network architecture in terms of predictive accuracy the simulation results show that the ann based methodology is a viable alternative which can be used to predict the performance of a fluidized bed gasifier
|
[['in', 'this', 'paper', 'multilayer', 'feed', 'forward', 'neural', 'networks', 'are', 'used', 'to', 'predict', 'the', 'lower', 'heating', 'value', 'of', 'gas', 'lhv', 'lower', 'heating', 'value', 'of', 'gasification', 'products', 'including', 'tars', 'and', 'entrained', 'char', 'lhvp', 'and', 'syngas', 'yield', 'during', 'gasification', 'of', 'municipal', 'solid', 'waste', 'msw', 'during', 'gasification', 'in', 'a', 'fluidized', 'bed', 'reactor', 'these', 'artificial', 'neural', 'networks', 'anns', 'with', 'different', 'architectures', 'are', 'trained', 'using', 'the', 'levenbergmarquardt', 'lm', 'backpropagation', 'algorithm', 'and', 'a', 'cross', 'validation', 'is', 'also', 'performed', 'to', 'ensure', 'that', 'the', 'results', 'generalise', 'to', 'other', 'unseen', 'datasets', 'a', 'rigorous', 'study', 'is', 'carried', 'out', 'on', 'optimally', 'choosing', 'the', 'number', 'of', 'hidden', 'layers', 'number', 'of', 'neurons', 'in', 'the', 'hidden', 'layer', 'and', 'activation', 'function', 'in', 'a', 'network', 'using', 'multiple', 'monte', 'carlo', 'runs', 'nine', 'input', 'and', 'three', 'output', 'parameters', 'are', 'used', 'to', 'train', 'and', 'test', 'various', 'neural', 'network', 'architectures', 'in', 'both', 'multiple', 'output', 'and', 'single', 'output', 'prediction', 'paradigms', 'using', 'the', 'available', 'experimental', 'datasets', 'the', 'model', 'selection', 'procedure', 'is', 'carried', 'out', 'to', 'ascertain', 'the', 'best', 'network', 'architecture', 'in', 'terms', 'of', 'predictive', 'accuracy', 'the', 'simulation', 'results', 'show', 'that', 'the', 'ann', 'based', 'methodology', 'is', 'a', 'viable', 'alternative', 'which', 'can', 'be', 'used', 'to', 'predict', 'the', 'performance', 'of', 'a', 'fluidized', 'bed', 'gasifier']]
|
[-0.050759721248146344, 0.05464914674694474, -0.05448113303455348, 0.0644155895280828, -0.06376839418316613, -0.1675100660908061, 0.06099944186359141, 0.4121448872258534, -0.25517940544145734, -0.35170061393968155, 0.08562510066793137, -0.25140332683820177, -0.16312894422460247, 0.22292169332441344, -0.03607634456287063, 0.1366888463925067, 0.12483384093848636, 0.005104363045176944, -0.017477162587582258, -0.30135126803133233, 0.23863982434661404, 0.09306852741519342, 0.34365508802537176, -0.008644674335782592, 0.11782916736084263, -0.08185226100975194, -0.014576582692412509, -0.018777915604437728, -0.0675785946411968, 0.10294247650560244, 0.2722597624414374, 0.14115754398202673, 0.2909806454956934, -0.48551967154080805, -0.24734071794192533, 0.10132773441287714, 0.12002311247098889, 0.06941545319293525, 0.011769142841945428, -0.2633754462406442, 0.07844801907100388, -0.1911585802818032, -0.024617923202144135, -0.11181059583417467, -0.06993381420301424, 0.02202651497170115, -0.3302343667598089, 0.03128263046571708, 0.003621007249111662, 0.04847623577366608, -0.060872685506537155, -0.15128347313887364, -0.04782047966256033, 0.14496398023581383, 0.009090301219524966, 0.041840525418268264, 0.19446121445271766, -0.1429289271488685, -0.117905279767473, 0.3041693041705199, -0.07304493654393465, -0.2110967204264189, 0.18959026393933676, -0.02182017326027759, -0.12542457082812247, 0.11357884718407248, 0.24160396904760115, 0.08876304684861286, -0.17748923244055462, -0.051859895664430854, -0.04582461826503277, 0.1824555795690095, 0.0548707110933154, -0.0698099254630506, 0.19405788666933674, 0.27567173777701887, -0.027464517993802156, 0.1729131323357767, -0.15433690647195042, -0.08983808992543836, -0.2369956752316825, -0.10987755363379177, -0.16325123083802898, -0.006066132211000533, -0.08524075223556153, -0.13777139033253832, 0.37288579319075155, 0.20592400310057643, 0.1982689046540071, 0.08298179145738785, 0.30722786590356277, 0.027572532531780165, 0.11033188737803012, 0.09429888274973712, 0.23516424250965182, 0.08666434208610775, 0.12386869056452368, -0.18860207315584696, 0.09459731212213031, 0.050915381732409365]
|
1,803.04814
|
Efficient non-resonant intermolecular vibrational energy transfer
|
Molecular excited vibrational states are metastable states and we incorporate
their finite lifetimes into the theory of vibrational energy transfer between
weakly interacting molecules, i.e., at internuclear distances at which they do
not have a chemical bond. Expressions for the effective lifetime of an
initially vibrationally excited molecule in the presence of a neighboring
molecule are derived in closed form. These expressions allow one to analyze the
physics behind the energy transfer. It is shown that due to different finite
lifetimes of the isolated excited molecules, a very efficient vibrational
energy transfer can take place between them even if their energies are rather
off-resonance. Examples are discussed.
|
physics.chem-ph
|
molecular excited vibrational states are metastable states and we incorporate their finite lifetimes into the theory of vibrational energy transfer between weakly interacting molecules ie at internuclear distances at which they do not have a chemical bond expressions for the effective lifetime of an initially vibrationally excited molecule in the presence of a neighboring molecule are derived in closed form these expressions allow one to analyze the physics behind the energy transfer it is shown that due to different finite lifetimes of the isolated excited molecules a very efficient vibrational energy transfer can take place between them even if their energies are rather offresonance examples are discussed
|
[['molecular', 'excited', 'vibrational', 'states', 'are', 'metastable', 'states', 'and', 'we', 'incorporate', 'their', 'finite', 'lifetimes', 'into', 'the', 'theory', 'of', 'vibrational', 'energy', 'transfer', 'between', 'weakly', 'interacting', 'molecules', 'ie', 'at', 'internuclear', 'distances', 'at', 'which', 'they', 'do', 'not', 'have', 'a', 'chemical', 'bond', 'expressions', 'for', 'the', 'effective', 'lifetime', 'of', 'an', 'initially', 'vibrationally', 'excited', 'molecule', 'in', 'the', 'presence', 'of', 'a', 'neighboring', 'molecule', 'are', 'derived', 'in', 'closed', 'form', 'these', 'expressions', 'allow', 'one', 'to', 'analyze', 'the', 'physics', 'behind', 'the', 'energy', 'transfer', 'it', 'is', 'shown', 'that', 'due', 'to', 'different', 'finite', 'lifetimes', 'of', 'the', 'isolated', 'excited', 'molecules', 'a', 'very', 'efficient', 'vibrational', 'energy', 'transfer', 'can', 'take', 'place', 'between', 'them', 'even', 'if', 'their', 'energies', 'are', 'rather', 'offresonance', 'examples', 'are', 'discussed']]
|
[-0.1196519221912495, 0.24525537446838103, -0.05788803677222578, 0.11716709924517983, 0.030170733474682424, -0.16982426990049881, 0.05837307062987934, 0.4367338179253808, -0.24772083241858076, -0.28297225105637147, -0.015495921818052079, -0.2789926446569544, -0.02470912863543936, 0.12829083427199311, 0.10031871542130014, -0.04604769822767126, 0.07412047471816295, 0.04223591212627138, -0.017246154177211502, -0.1439469934127807, 0.2754521165173675, 0.028413829049878866, 0.24032293079925754, 0.12167314628017283, 0.044252299516522715, -0.07608275973481761, 0.06918170312898252, -0.06481508220432797, -0.1346296515671681, 0.15827848461878738, 0.2986169598874784, 0.017211145173027135, 0.2479065301540856, -0.5172349892939642, -0.19349400353156657, 0.09373415560270094, 0.1774296610851154, 0.22866780427610936, -0.011098876491865734, -0.2514976482559866, 0.01803936602364982, -0.153933611467794, -0.12008685116856316, -0.13478324005040818, 0.07036415397006775, 0.04606556468077491, -0.20525471417007046, 0.08303666050044306, 0.012973571457316943, 0.028334067568670365, -0.11314552591539154, -0.15109520219266415, -0.10369572561739065, 0.16307869335967246, 0.0032315152701617124, -0.053954766593246814, 0.19585812379057718, -0.08732214983047865, -0.040138272968965154, 0.389571703855105, -0.04549891405921673, -0.18938243240727304, 0.2612055495411819, -0.128091816094086, -0.09881741013464944, 0.21869161582299482, 0.13227831648888988, 0.16248678686271342, -0.14599803037871825, 0.03914694694277752, 0.03961787406337735, 0.1395509713982171, 0.10557155212970608, 0.1374057843872111, 0.24893690962518486, 0.0757120851531764, 0.009392467022777717, 0.12810411258104526, -0.10052760417391458, -0.15761381362033922, -0.2508210463962892, -0.10850103657309697, -0.21055343354482065, 0.08746224693384426, 0.012905491024356936, -0.1253640740970041, 0.3637651295910337, 0.05688435883287375, 0.18495990498705167, 0.011478476390616846, 0.2684155039001848, 0.12364730452161247, 0.05335364660474463, 0.06208190614374998, 0.28107860318828964, 0.16122691740638742, 0.03391412042177099, -0.2761913229467643, 0.06260640743388751, 0.0028411827559330473]
|
1,803.04815
|
Evaluating the Performance of Existing Full-Reference Quality Metrics on
High Dynamic Range (HDR) Video Content
|
While there exists a wide variety of Low Dynamic Range (LDR) quality metrics,
only a limited number of metrics are designed specifically for the High Dynamic
Range (HDR) content. With the introduction of HDR video compression
standardization effort by international standardization bodies, the need for an
efficient video quality metric for HDR applications has become more pronounced.
The objective of this study is to compare the performance of the existing
full-reference LDR and HDR video quality metrics on HDR content and identify
the most effective one for HDR applications. To this end, a new HDR video
dataset is created, which consists of representative indoor and outdoor video
sequences with different brightness, motion levels and different representing
types of distortions. The quality of each distorted video in this dataset is
evaluated both subjectively and objectively. The correlation between the
subjective and objective results confirm that VIF quality metric outperforms
all to ther tested metrics in the presence of the tested types of distortions.
|
eess.IV
|
while there exists a wide variety of low dynamic range ldr quality metrics only a limited number of metrics are designed specifically for the high dynamic range hdr content with the introduction of hdr video compression standardization effort by international standardization bodies the need for an efficient video quality metric for hdr applications has become more pronounced the objective of this study is to compare the performance of the existing fullreference ldr and hdr video quality metrics on hdr content and identify the most effective one for hdr applications to this end a new hdr video dataset is created which consists of representative indoor and outdoor video sequences with different brightness motion levels and different representing types of distortions the quality of each distorted video in this dataset is evaluated both subjectively and objectively the correlation between the subjective and objective results confirm that vif quality metric outperforms all to ther tested metrics in the presence of the tested types of distortions
|
[['while', 'there', 'exists', 'a', 'wide', 'variety', 'of', 'low', 'dynamic', 'range', 'ldr', 'quality', 'metrics', 'only', 'a', 'limited', 'number', 'of', 'metrics', 'are', 'designed', 'specifically', 'for', 'the', 'high', 'dynamic', 'range', 'hdr', 'content', 'with', 'the', 'introduction', 'of', 'hdr', 'video', 'compression', 'standardization', 'effort', 'by', 'international', 'standardization', 'bodies', 'the', 'need', 'for', 'an', 'efficient', 'video', 'quality', 'metric', 'for', 'hdr', 'applications', 'has', 'become', 'more', 'pronounced', 'the', 'objective', 'of', 'this', 'study', 'is', 'to', 'compare', 'the', 'performance', 'of', 'the', 'existing', 'fullreference', 'ldr', 'and', 'hdr', 'video', 'quality', 'metrics', 'on', 'hdr', 'content', 'and', 'identify', 'the', 'most', 'effective', 'one', 'for', 'hdr', 'applications', 'to', 'this', 'end', 'a', 'new', 'hdr', 'video', 'dataset', 'is', 'created', 'which', 'consists', 'of', 'representative', 'indoor', 'and', 'outdoor', 'video', 'sequences', 'with', 'different', 'brightness', 'motion', 'levels', 'and', 'different', 'representing', 'types', 'of', 'distortions', 'the', 'quality', 'of', 'each', 'distorted', 'video', 'in', 'this', 'dataset', 'is', 'evaluated', 'both', 'subjectively', 'and', 'objectively', 'the', 'correlation', 'between', 'the', 'subjective', 'and', 'objective', 'results', 'confirm', 'that', 'vif', 'quality', 'metric', 'outperforms', 'all', 'to', 'ther', 'tested', 'metrics', 'in', 'the', 'presence', 'of', 'the', 'tested', 'types', 'of', 'distortions']]
|
[-0.09857948664015297, -0.008315686747934066, -0.03407615658835749, 0.06503168968943718, -0.05227902637673168, -0.11791824787297504, -0.030460557292422488, 0.4610196366837179, -0.1740536756366549, -0.3471774123264132, 0.08258821485408892, -0.2708503969795542, -0.15050649962583443, 0.20537686751534542, -0.1902531182620154, 0.07289068301682243, 0.0885048185210721, 0.047121014888685794, -0.0742208255773962, -0.2973780597992713, 0.31769238561420576, 0.05101362923965042, 0.4014678946638733, 0.04973270528537313, 0.12270630302660765, 0.0007363205378944123, -0.06345338275135828, 0.05064883606255422, -0.07815229216250799, 0.1516961194086176, 0.35029661668648504, 0.21158057257797522, 0.30552290382588077, -0.3169337957637546, -0.24444545985969865, 0.04343823684138005, 0.08690528111405854, 0.03441566581058857, -0.08903783295897517, -0.31662207062034237, 0.14093213456245945, -0.16145097873070174, 0.015228539162004987, -0.0821847896333094, 0.02160483949392298, 0.020030451062879883, -0.29634966237907423, 0.040606611976536554, -0.03302164229472386, 0.09616223499638799, -0.10329889285505353, -0.09897893543044727, 0.023363364403377527, 0.22323057551460088, 0.058627072580871575, 0.07786343846668455, 0.134013186165787, -0.20643671113066375, -0.06875659666997151, 0.4686143633990008, -0.06195642493872179, -0.20173326648633788, 0.22191308025072362, -0.05411140130039443, -0.08531653019455894, 0.15605578488486324, 0.2308745010332693, 0.12722538950289658, -0.16654579703017702, 0.00019601806024532122, 0.024173252605028266, 0.20750553312102032, 0.12581838680902657, 0.06489738213461767, 0.1833219316566685, 0.21546571705214404, 0.03065000772282171, 0.1372859761633416, -0.12752210961069202, -0.02281838293865691, -0.19735332034430525, -0.11418252799338029, -0.16106988023750968, -0.039758029077661995, -0.1534531296880838, -0.17338852998310122, 0.4309250072369145, 0.20593215276941335, 0.15485080279536362, 0.07108655351251479, 0.3911494662903284, -0.021010913176140115, 0.054379080372279, 0.020258152337685905, 0.17068806572610307, -0.04537421012337515, 0.16403365048815577, -0.13958030446995923, 0.05723155204517146, 0.016487167288698715]
|
1,803.04816
|
Interference effect in the optomechanical stochastic resonance
|
In this paper, we study the stochastic resonance (SR) effect in an
optomechanical system driven by a strong coupling field and two weak signals in
both semiclassical and quantum frameworks. In the semiclassical description,
the SR phenomena are found at the cooperation of input signals and system
noises. When two signals co-act on our system, the interference effect between
the optically induced SR and the mechanically induced SR can be generated. In
particular, a unique beating effect, which makes the SR effect robust against
the initial phase difference of two signals, appears in the SR synchronization
process with unsynchronized signals. In addition, the quantum stochastic
resonance effect is numerically observed in the full quantum framework induced
by pure quantum fluctuations.
|
physics.optics quant-ph
|
in this paper we study the stochastic resonance sr effect in an optomechanical system driven by a strong coupling field and two weak signals in both semiclassical and quantum frameworks in the semiclassical description the sr phenomena are found at the cooperation of input signals and system noises when two signals coact on our system the interference effect between the optically induced sr and the mechanically induced sr can be generated in particular a unique beating effect which makes the sr effect robust against the initial phase difference of two signals appears in the sr synchronization process with unsynchronized signals in addition the quantum stochastic resonance effect is numerically observed in the full quantum framework induced by pure quantum fluctuations
|
[['in', 'this', 'paper', 'we', 'study', 'the', 'stochastic', 'resonance', 'sr', 'effect', 'in', 'an', 'optomechanical', 'system', 'driven', 'by', 'a', 'strong', 'coupling', 'field', 'and', 'two', 'weak', 'signals', 'in', 'both', 'semiclassical', 'and', 'quantum', 'frameworks', 'in', 'the', 'semiclassical', 'description', 'the', 'sr', 'phenomena', 'are', 'found', 'at', 'the', 'cooperation', 'of', 'input', 'signals', 'and', 'system', 'noises', 'when', 'two', 'signals', 'coact', 'on', 'our', 'system', 'the', 'interference', 'effect', 'between', 'the', 'optically', 'induced', 'sr', 'and', 'the', 'mechanically', 'induced', 'sr', 'can', 'be', 'generated', 'in', 'particular', 'a', 'unique', 'beating', 'effect', 'which', 'makes', 'the', 'sr', 'effect', 'robust', 'against', 'the', 'initial', 'phase', 'difference', 'of', 'two', 'signals', 'appears', 'in', 'the', 'sr', 'synchronization', 'process', 'with', 'unsynchronized', 'signals', 'in', 'addition', 'the', 'quantum', 'stochastic', 'resonance', 'effect', 'is', 'numerically', 'observed', 'in', 'the', 'full', 'quantum', 'framework', 'induced', 'by', 'pure', 'quantum', 'fluctuations']]
|
[-0.17282405751757324, 0.1869144567493398, -0.047848031743584825, 0.06052864111123502, 0.009280866493160527, -0.1417825716159617, 0.032772519704303706, 0.3459070597930501, -0.31033399152026203, -0.25715959509058545, 0.02625813707272755, -0.3031045227311552, -0.21179711740308751, 0.17229756343488892, -0.020384361788940927, 0.0216032992155912, 0.03269984761136584, 0.034851036339144534, -0.03640280205581803, -0.14983988791257918, 0.29728744086266184, 0.050960044023425626, 0.32825317506988844, -0.0014945212906847397, 0.08422045847401023, -0.005227254645433277, 0.055592198114997396, 0.054088488981748624, -0.04514518429835637, 0.027340773151566584, 0.236698157551776, 0.047532529302407055, 0.2360211233065153, -0.4455614067614079, -0.21759398059609036, 0.11188876124021287, 0.10676293731230543, 0.19668868451359836, -0.09477385024171478, -0.36627102359295044, 0.058464864047709855, -0.12564637462298076, -0.042748589317003885, -0.03232655674376777, -0.009552122313956109, -0.024120655285272127, -0.30481856731930745, 0.07118888376280666, 0.12787571935914457, 0.07582337877247483, -0.031029618120131393, -0.035912820759889046, 0.026594414831682418, 0.09509203191385798, 0.0014808337415161076, -0.013559648344138015, 0.13695407418999822, -0.102571557762955, -0.14061702176113614, 0.3658490326643611, -0.13976277710365442, -0.1859410990010171, 0.17261827854284395, -0.17673497536840538, -0.06617246969447782, 0.13068265369317184, 0.15259534802753477, 0.10384482007357292, -0.1702806705750845, 0.07406871198715331, 0.07983176296887298, 0.16446103278237084, 0.034939063476243364, 0.11324890372731412, 0.21902436596962313, 0.14591020228884494, 0.019520937480653325, 0.1519384258494635, -0.13524965776402192, -0.1445650037455683, -0.2424066707448219, -0.08913831214886159, -0.14599758170273466, 0.026135470355317617, -0.0570360182391596, -0.12235867405931154, 0.39558081833723313, 0.16250957075584058, 0.1634225342112283, -0.06581339263066184, 0.3291641339659691, 0.1487211629098359, -0.00968753572087735, 0.002618502511177212, 0.31370441895366336, 0.15610061954551688, 0.08951241014292463, -0.31673990066240854, 0.05764952569734305, -0.005608713366867354]
|
1,803.04817
|
Characterizations of Gelfand rings specially clean rings and their dual
rings
|
In this paper, new criteria for zero dimensional rings, Gelfand rings, clean
rings and mp-rings are given. A new class of rings is introduced and studied,
we call them purified rings. Specially, reduced purified rings are
characterized. New characterizations for pure ideals of reduced Gelfand rings
and mp-rings are provided. It is also proved that if the topology of a scheme
is Hausdorff, then the affine opens of that scheme is stable under taking
finite unions. In particular, every compact scheme is an affine scheme.
|
math.AC
|
in this paper new criteria for zero dimensional rings gelfand rings clean rings and mprings are given a new class of rings is introduced and studied we call them purified rings specially reduced purified rings are characterized new characterizations for pure ideals of reduced gelfand rings and mprings are provided it is also proved that if the topology of a scheme is hausdorff then the affine opens of that scheme is stable under taking finite unions in particular every compact scheme is an affine scheme
|
[['in', 'this', 'paper', 'new', 'criteria', 'for', 'zero', 'dimensional', 'rings', 'gelfand', 'rings', 'clean', 'rings', 'and', 'mprings', 'are', 'given', 'a', 'new', 'class', 'of', 'rings', 'is', 'introduced', 'and', 'studied', 'we', 'call', 'them', 'purified', 'rings', 'specially', 'reduced', 'purified', 'rings', 'are', 'characterized', 'new', 'characterizations', 'for', 'pure', 'ideals', 'of', 'reduced', 'gelfand', 'rings', 'and', 'mprings', 'are', 'provided', 'it', 'is', 'also', 'proved', 'that', 'if', 'the', 'topology', 'of', 'a', 'scheme', 'is', 'hausdorff', 'then', 'the', 'affine', 'opens', 'of', 'that', 'scheme', 'is', 'stable', 'under', 'taking', 'finite', 'unions', 'in', 'particular', 'every', 'compact', 'scheme', 'is', 'an', 'affine', 'scheme']]
|
[-0.17727100567510687, 0.11252093710813879, -0.08474444299487464, 0.08606199129675347, -0.023637153836617988, -0.21582412996879183, -0.03276791131959846, 0.3874827549759164, -0.33374793297914135, -0.11034488059714975, 0.10821086379800396, -0.20981798969568258, -0.10747051116286677, 0.25457428829991313, -0.15514356396104917, -0.011647326305104667, 0.0291062630712986, 0.023160473544554538, -0.0950009376820491, -0.3560576694288168, 0.39632038430995253, 0.026322043972112328, 0.2785441670791212, 0.021204954273409647, 0.10304656454799585, -0.004189616411430649, -0.04303235593511364, 0.10545726515442493, -0.1778622947541046, 0.1349680090704596, 0.2958827110299145, 0.08492472708640418, 0.21535394152244888, -0.3612941865993703, -0.0985366115346551, 0.1616723056186933, 0.11311559007132807, 0.062197677634028066, -0.07192929563707257, -0.2593625678557409, 0.19013002317353903, -0.22322415442666016, -0.1622603734708335, -0.11263476699276502, 0.10486813148775373, 0.03307453254574394, -0.30267688957413275, -0.01483964907455662, 0.1395605487457241, 0.08045426643936031, -0.06227409246613283, -0.034960372956940926, -0.023157711174473704, 0.0446117113131177, -0.09376206413102169, -0.07936776403607015, 0.0826216345051225, -0.01342585162059418, -0.1223700758103416, 0.3631180863805025, -0.017577033669474613, -0.18921632474535202, 0.15771355041785232, -0.1479922689677003, -0.10739224703129695, 0.17602893846468573, 0.06863174910645888, 0.18978206737034292, -0.10509176645427942, 0.19138566384173325, -0.16851555053369108, 0.032990591106824126, 0.11899857290919466, 0.102945173372436, 0.14926172716610403, 0.1544843559471241, 0.13321541304172702, 0.18936842779281088, -0.020448438063367685, -0.032050475796561194, -0.3071740020335798, -0.21159828440791154, -0.13966638834709413, 0.04294518989522055, -0.020668513034449342, -0.1354057480839182, 0.3618419882622253, 0.023425752214992036, 0.1411508494112865, 0.033698139184839035, 0.22980996274322002, 0.07505008463568268, 0.07439930504569271, 0.07793135323326092, 0.1268505314140614, 0.22669912724340535, -0.04173409457441913, -0.1127633031553039, -0.02324134903589645, 0.16253942547994385]
|
1,803.04818
|
A Survey on Deep Learning Toolkits and Libraries for Intelligent User
Interfaces
|
This paper provides an overview of prominent deep learning toolkits and, in
particular, reports on recent publications that contributed open source
software for implementing tasks that are common in intelligent user interfaces
(IUI). We provide a scientific reference for researchers and software engineers
who plan to utilise deep learning techniques within their IUI research and
development projects.
|
cs.HC cs.LG
|
this paper provides an overview of prominent deep learning toolkits and in particular reports on recent publications that contributed open source software for implementing tasks that are common in intelligent user interfaces iui we provide a scientific reference for researchers and software engineers who plan to utilise deep learning techniques within their iui research and development projects
|
[['this', 'paper', 'provides', 'an', 'overview', 'of', 'prominent', 'deep', 'learning', 'toolkits', 'and', 'in', 'particular', 'reports', 'on', 'recent', 'publications', 'that', 'contributed', 'open', 'source', 'software', 'for', 'implementing', 'tasks', 'that', 'are', 'common', 'in', 'intelligent', 'user', 'interfaces', 'iui', 'we', 'provide', 'a', 'scientific', 'reference', 'for', 'researchers', 'and', 'software', 'engineers', 'who', 'plan', 'to', 'utilise', 'deep', 'learning', 'techniques', 'within', 'their', 'iui', 'research', 'and', 'development', 'projects']]
|
[-0.0687139133122145, -0.020132788650746653, -0.08222976153749123, 0.03003580891731473, -0.19055654343805814, -0.1985528743825853, 0.01898932457174452, 0.4759294646873809, -0.19522353416929641, -0.3445514277473353, 0.06089602724910436, -0.29473771519240055, -0.18833279874371855, 0.25644699775760893, -0.17366692368676395, 0.07707285101672537, 0.1402003868205244, -0.04218897298989376, -0.018026491418774975, -0.31009665010660364, 0.27987541215853734, 0.12354552960574725, 0.35695137681537553, 0.08577153844791546, 0.040477065222435875, 0.021585798487394003, -0.1284680378361883, -0.07676205843719736, -0.13864212946505736, 0.24952685780692518, 0.48387690774050723, 0.30002483959195386, 0.4245604939366642, -0.45589010221393483, -0.17920496987930515, -0.01047670087989485, 0.16901894251963026, 0.07862682921583192, -0.11112962004916514, -0.3229395235774287, 0.05121890290460566, -0.23089399221434928, -0.06059300245945914, -0.10324382089209139, 0.01243997775344995, 0.016518990795144385, -0.21466387063264847, -0.08981665674793093, 0.044848214001639894, 0.18324097593952166, -0.0004682027767494059, -0.14940352303286394, 0.12084861254940431, 0.23063513490355067, 0.05727219093068127, 0.10561271264266811, 0.1558001250306373, -0.177935995661915, -0.20683645502778522, 0.29961108102610234, 0.011976984901386396, -0.10924307815730572, 0.2221075726444261, 0.04136781860142946, -0.2466947856612438, 0.01460002003270283, 0.30052046752289724, 0.03819598423382431, -0.24089176496981005, 0.07388960465221062, 0.05309683824644277, 0.1450243264890129, 0.004668957369990255, -0.004214646188509569, 0.24152836533622785, 0.22718427522647144, 0.021557937882709922, 0.08267097317066305, 0.013230521064415052, -0.0781819802267771, -0.20011186034402303, -0.15883147273735518, -0.09706348920927237, -0.024602253880482493, 0.03939429485201305, -0.1471950295789723, 0.3902753641534793, 0.25249489706791856, 0.02549770805298498, -0.006251417035073565, 0.35583732754253505, -0.03928396891671838, 0.09603707498478654, 0.1602037754399996, 0.17286920075492704, -0.026348073015054853, 0.2424342225207702, -0.11243197590463974, 0.07119028031082596, -0.056402008702749744]
|
1,803.04819
|
Semmes surfaces and intrinsic Lipschitz graphs in the Heisenberg group
|
A Semmes surface in the Heisenberg group is a closed set $S$ that is upper
Ahlfors-regular with codimension one and satisfies the following condition,
referred to as Condition B. Every ball $B(x,r)$ with $x \in S$ and $0 < r <
\operatorname{diam} S$ contains two balls with radii comparable to $r$ which
are contained in different connected components of the complement of $S$.
Analogous sets in Euclidean spaces were introduced by Semmes in the late
$80$'s. We prove that Semmes surfaces in the Heisenberg group are lower
Ahlfors-regular with codimension one and have big pieces of intrinsic Lipschitz
graphs. In particular, our result applies to the boundary of chord-arc domains
and of reduced isoperimetric sets.
|
math.CA math.MG
|
a semmes surface in the heisenberg group is a closed set s that is upper ahlforsregular with codimension one and satisfies the following condition referred to as condition b every ball bxr with x in s and 0 r operatornamediam s contains two balls with radii comparable to r which are contained in different connected components of the complement of s analogous sets in euclidean spaces were introduced by semmes in the late 80s we prove that semmes surfaces in the heisenberg group are lower ahlforsregular with codimension one and have big pieces of intrinsic lipschitz graphs in particular our result applies to the boundary of chordarc domains and of reduced isoperimetric sets
|
[['a', 'semmes', 'surface', 'in', 'the', 'heisenberg', 'group', 'is', 'a', 'closed', 'set', 's', 'that', 'is', 'upper', 'ahlforsregular', 'with', 'codimension', 'one', 'and', 'satisfies', 'the', 'following', 'condition', 'referred', 'to', 'as', 'condition', 'b', 'every', 'ball', 'bxr', 'with', 'x', 'in', 's', 'and', '0', 'r', 'operatornamediam', 's', 'contains', 'two', 'balls', 'with', 'radii', 'comparable', 'to', 'r', 'which', 'are', 'contained', 'in', 'different', 'connected', 'components', 'of', 'the', 'complement', 'of', 's', 'analogous', 'sets', 'in', 'euclidean', 'spaces', 'were', 'introduced', 'by', 'semmes', 'in', 'the', 'late', '80s', 'we', 'prove', 'that', 'semmes', 'surfaces', 'in', 'the', 'heisenberg', 'group', 'are', 'lower', 'ahlforsregular', 'with', 'codimension', 'one', 'and', 'have', 'big', 'pieces', 'of', 'intrinsic', 'lipschitz', 'graphs', 'in', 'particular', 'our', 'result', 'applies', 'to', 'the', 'boundary', 'of', 'chordarc', 'domains', 'and', 'of', 'reduced', 'isoperimetric', 'sets']]
|
[-0.16787464627746626, 0.126284417970185, -0.06789489748604995, 0.03874925764518723, -0.04618368863261172, -0.16343495971523225, -0.020826817477687394, 0.33903161826102796, -0.24874948118148105, -0.20954786642687395, 0.12902038319173567, -0.33012505988257806, -0.057496053100164445, 0.1898265943205583, -0.15485751545721932, -0.0063893562265937886, 0.04116381306500573, 0.09282344459123644, -0.05013031730725613, -0.30138631560423945, 0.37048183856053846, -0.10341804040529366, 0.1865984687049474, 0.04029384435021451, 0.044718687472465844, -0.011034700790852574, 0.01508267252523053, 0.06271774999497991, -0.21961047154101315, 0.14926931289457052, 0.2448684150835366, 0.09175914965661443, 0.22391705988307617, -0.38573834766819864, -0.18382530785830958, 0.1665770670640216, 0.09506160086519751, -0.04696864384979043, 0.03348633744878628, -0.2720890875373568, 0.12777378892392985, -0.07652859251330872, -0.1665454090730886, -0.0036156465648673475, 0.1145821374874296, 0.012635275106211858, -0.237576989124396, 0.05371225906752183, 0.1336624338125278, 0.06857494432577889, -0.06555877187150015, -0.14534897886499362, -0.07646457262204162, 0.09163550607211489, 0.016216384051533948, 0.14284755270533164, 0.04517142124106093, -0.0025348111331758055, -0.09148796813678928, 0.35535389234428294, -0.0893178059569826, -0.210635993455071, 0.17733063345908054, -0.21360544887387992, -0.13280148808345466, 0.08327528668451123, 0.09178451813412332, 0.12128871684295259, -0.07142221411257717, 0.22636048321146518, -0.09627497960277001, 0.07800409771360657, 0.14985827143703187, -0.007292778422457299, 0.08973616492585279, 0.11429406691916354, 0.1400347730039227, 0.14277477919988865, -0.009750739735734117, -0.0008523474051409201, -0.35987614231583265, -0.17286533576303295, -0.18850107654829376, 0.10139052508748136, -0.13128783878086583, -0.1686176820782878, 0.31186535904583124, 0.0266760285012424, 0.22711152501869947, 0.05168967033906873, 0.18050871003028338, 0.002201983758303478, 0.054889804902424136, 0.15450642867446213, 0.13339266667441865, 0.18149282875570602, -0.00966821122814768, -0.10970674582378186, 0.008654684239965198, 0.18155550344298327]
|
1,803.0482
|
Discussion of "The power of monitoring"
|
This is an invited comment on the discussion paper "The power of monitoring:
how to make the most of a contaminated multivariate sample" by A. Cerioli, M.
Riani, A. Atkinson and A. Corbellini that will appear in the journal
Statistical Methods & Applications.
|
stat.ME
|
this is an invited comment on the discussion paper the power of monitoring how to make the most of a contaminated multivariate sample by a cerioli m riani a atkinson and a corbellini that will appear in the journal statistical methods applications
|
[['this', 'is', 'an', 'invited', 'comment', 'on', 'the', 'discussion', 'paper', 'the', 'power', 'of', 'monitoring', 'how', 'to', 'make', 'the', 'most', 'of', 'a', 'contaminated', 'multivariate', 'sample', 'by', 'a', 'cerioli', 'm', 'riani', 'a', 'atkinson', 'and', 'a', 'corbellini', 'that', 'will', 'appear', 'in', 'the', 'journal', 'statistical', 'methods', 'applications']]
|
[-0.09325126281533486, 0.0427101318853555, -0.1294315115739711, 0.028135723983630154, -0.08890440186055806, -0.09553890054424603, 0.08351381598577763, 0.3100124840887311, -0.19277232200301325, -0.286376566793292, 0.157390404979173, -0.3137825343471307, -0.1781019093707586, 0.2309862145473464, -0.1654967944113872, -0.022844337031412393, 0.0713798911191332, 0.014895133053263029, -0.06833756005224319, -0.31617002905561375, 0.30005813664637315, 0.13298483952306783, 0.2413926126124958, 0.03580942064619217, 0.030929267310943358, -0.001430718729702326, -0.17896613927605826, 0.043049271194598615, -0.11240509265339008, 0.1698808640552064, 0.2939503358390469, 0.15155340939796028, 0.37411591401084876, -0.35331849904207796, -0.1611733922543816, 0.09464266318350266, 0.08669080920606995, 0.05842446765074363, -0.03524318326992962, -0.25189315331860995, 0.06196520632753769, -0.18883524641681176, -0.11299812494036861, -0.04162896645422547, 0.0707500457453231, 0.01733001736470331, -0.21279354044833246, 0.025300043014188606, 0.109403443403351, 0.08304808728205852, 0.028765642027466152, -0.1376788911099235, 0.032205240592026174, 0.06623653066941561, 0.05183809804013716, 0.015588311824756555, 0.11800463277942096, -0.15751656975286701, -0.13195010325990808, 0.40202506673999894, -0.023672536534901995, -0.171521487693565, 0.17773886812994114, -0.1045801252580415, -0.1997294180954878, 0.035855344544427514, 0.24546574882398814, 0.10944849028228185, -0.21339145520081124, 0.08216718677282095, -0.060321310797754005, 0.20626871306926775, 0.04728996560264092, -0.03322406245682102, 0.18429617879864496, 0.15369142157336077, 0.041260690213396, 0.11549927573651075, -0.09008564658534642, 0.014982960449579434, -0.3239460530428168, -0.17192667369277048, -0.19162290782118455, 0.07851676530658434, -0.01861303587382934, -0.16355735710702646, 0.42311831035961706, 0.18554466657149485, 0.1868601692124055, -0.01299445411691872, 0.2661562417753232, 0.0830096777003163, -0.01946421643384756, 0.06698705367624569, 0.19381004500274474, 0.120922622587293, 0.15548550845004427, -0.13519949790758964, 0.03439558889472093, 0.006552827807191091]
|
1,803.04821
|
Directional scattering from particles under evanescent wave
illumination: the role of reactive power
|
Study of photonic spin-orbital interactions, which involves control of the
propagation and spatial distributions of light with the polarization of
electromagnetic fields, is not only important at the fundamental level but also
has significant implications for functional photonic applications that require
active tuning of directional light propagation. Many of the experimental
demonstrations have been attributed to the spin-momentum locking characteristic
of evanescent waves. In this letter, we show another property of evanescent
waves: the polarization dependent direction of the imaginary part of the
Poynting vector, i.e. reactive power. Based on this property, we propose a
simple and robust way to tune the directional far-field scattering from
nanoparticles near a surface under evanescent wave illumination by controlling
linear polarization and direction of the incident light.
|
physics.optics
|
study of photonic spinorbital interactions which involves control of the propagation and spatial distributions of light with the polarization of electromagnetic fields is not only important at the fundamental level but also has significant implications for functional photonic applications that require active tuning of directional light propagation many of the experimental demonstrations have been attributed to the spinmomentum locking characteristic of evanescent waves in this letter we show another property of evanescent waves the polarization dependent direction of the imaginary part of the poynting vector ie reactive power based on this property we propose a simple and robust way to tune the directional farfield scattering from nanoparticles near a surface under evanescent wave illumination by controlling linear polarization and direction of the incident light
|
[['study', 'of', 'photonic', 'spinorbital', 'interactions', 'which', 'involves', 'control', 'of', 'the', 'propagation', 'and', 'spatial', 'distributions', 'of', 'light', 'with', 'the', 'polarization', 'of', 'electromagnetic', 'fields', 'is', 'not', 'only', 'important', 'at', 'the', 'fundamental', 'level', 'but', 'also', 'has', 'significant', 'implications', 'for', 'functional', 'photonic', 'applications', 'that', 'require', 'active', 'tuning', 'of', 'directional', 'light', 'propagation', 'many', 'of', 'the', 'experimental', 'demonstrations', 'have', 'been', 'attributed', 'to', 'the', 'spinmomentum', 'locking', 'characteristic', 'of', 'evanescent', 'waves', 'in', 'this', 'letter', 'we', 'show', 'another', 'property', 'of', 'evanescent', 'waves', 'the', 'polarization', 'dependent', 'direction', 'of', 'the', 'imaginary', 'part', 'of', 'the', 'poynting', 'vector', 'ie', 'reactive', 'power', 'based', 'on', 'this', 'property', 'we', 'propose', 'a', 'simple', 'and', 'robust', 'way', 'to', 'tune', 'the', 'directional', 'farfield', 'scattering', 'from', 'nanoparticles', 'near', 'a', 'surface', 'under', 'evanescent', 'wave', 'illumination', 'by', 'controlling', 'linear', 'polarization', 'and', 'direction', 'of', 'the', 'incident', 'light']]
|
[-0.1830163303173087, 0.19886691976083262, -0.0889820560813889, -0.009594540484437359, -0.13448735894334893, -0.11695720165246917, 0.016097450399801375, 0.4314071579025157, -0.28583716566584283, -0.2656855720485891, 0.011341775338458378, -0.24153033249275457, -0.18262739123536215, 0.2215040974213832, 0.022914040691947805, 0.08243219331592216, -0.0072239666290941735, -0.024930261661328616, -0.02007996962187932, -0.12932978160378913, 0.3107832292312636, 0.038548628465392656, 0.33880871779570776, 0.10160909924466509, 0.1413649406524435, 0.09005223183832582, -0.006745377754522187, -0.031254766997130166, -0.048973104227702756, 0.1493525530686677, 0.21723148309261417, 0.02087281135027297, 0.24498035909322602, -0.4596850578372757, -0.26640160045128375, 0.07727299779353122, 0.15320889224277645, 0.15308177450412674, -0.10557611100094003, -0.27057569054135633, 0.037542573589410995, -0.0736641981188328, -0.1592858462001107, -0.04616739863019076, 0.013195351152981242, 0.029832679235691866, -0.22250667666911236, 0.0459681648003865, 0.07774654257340327, 0.07079105345051616, -0.039738870738449714, -0.07578996363877048, -0.05136749786024372, 0.050044204934120866, 0.07606151958198977, 0.009168182814450589, 0.14599681499173806, -0.14945802695283125, -0.1142322106508448, 0.37743491059049, -0.06610989664313233, -0.1903177566390725, 0.15735705703639635, -0.1793067381964178, -0.02130682553322385, 0.17870705509408108, 0.24733407688777773, 0.11790764198127773, -0.10669482142228874, 0.058862752088199126, -0.02548707988582112, 0.18272196717800632, 0.12035874913600574, 0.13619065808973485, 0.26178402723669403, 0.13162789927821816, 0.07066686590898767, 0.12514568147279562, -0.12083339467719797, -0.008838277971071581, -0.2994898737994053, -0.1568109486402283, -0.19285110958791787, 0.031713022854678606, -0.06627351262338174, -0.1586716656588138, 0.4663845657130643, 0.15580587301050283, 0.13570909989216634, -0.02772086021216256, 0.31870137817496735, 0.1286029447144228, 0.08052437585748491, 0.041519958753093715, 0.3530352763801573, 0.16486677979710587, 0.10014942361627735, -0.26262448628474355, 0.07608342774948405, -0.04529103281862673]
|
1,803.04822
|
A Deep X-ray Survey of the Globular Cluster Omega Centauri
|
We identify 233 X-ray sources, of which 95 are new, in a 222 ks exposure of
Omega Centauri with the Chandra X-ray Observatory's ACIS-I detector. The
limiting unabsorbed flux in the core is $f_x$ (0.5$-$6.0 keV) $\simeq$ 3
$\times$ 10$^{-16}$ erg s$^{-1}$ cm$^{-2}$ ($L_X$ $\simeq$ 1 $\times$ 10$^{30}$
erg s$^{-1}$ at 5.2 kpc). We estimate that ~$60\pm 20$ of these are cluster
members, of which ~30 lie within the core ($r_c$ $=$ 155 arcsec), and another
~30 between 1$-$2 core radii. We identify four new optical counterparts, for a
total of 45 likely identifications. Probable cluster members include 18
cataclysmic variables (CVs) and CV candidates, one quiescent low-mass X-ray
binary, four variable stars, and five stars that are either associated with w
Cen's anomalous red giant branch, or are sub-subgiants. We estimate that the
cluster contains $40\pm 10$ CVs with $L_X$ $>$ 10$^{31}$ erg s$^{-1}$,
confirming that CVs are underabundant in w Cen relative to the field. Intrinsic
absorption is required to fit X-ray spectra of six of the nine brightest CVs,
suggesting magnetic CVs, or high-inclination systems. Though no radio
millisecond pulsars (MSPs) are currently known in w Cen, more than 30
unidentified sources have luminosities and X-ray colours like those of MSPs
found in other globular clusters; these could be responsible for the
Fermi-detected gamma-ray emission from the cluster. Finally, we identify a CH
star as the counterpart to the second-brightest X-ray source in the cluster and
argue that it is a symbiotic star. This is the first such giant/white dwarf
binary to be identified in a globular cluster.
|
astro-ph.HE
|
we identify 233 xray sources of which 95 are new in a 222 ks exposure of omega centauri with the chandra xray observatorys acisi detector the limiting unabsorbed flux in the core is f_x 0560 kev simeq 3 times 1016 erg s1 cm2 l_x simeq 1 times 1030 erg s1 at 52 kpc we estimate that 60pm 20 of these are cluster members of which 30 lie within the core r_c 155 arcsec and another 30 between 12 core radii we identify four new optical counterparts for a total of 45 likely identifications probable cluster members include 18 cataclysmic variables cvs and cv candidates one quiescent lowmass xray binary four variable stars and five stars that are either associated with w cens anomalous red giant branch or are subsubgiants we estimate that the cluster contains 40pm 10 cvs with l_x 1031 erg s1 confirming that cvs are underabundant in w cen relative to the field intrinsic absorption is required to fit xray spectra of six of the nine brightest cvs suggesting magnetic cvs or highinclination systems though no radio millisecond pulsars msps are currently known in w cen more than 30 unidentified sources have luminosities and xray colours like those of msps found in other globular clusters these could be responsible for the fermidetected gammaray emission from the cluster finally we identify a ch star as the counterpart to the secondbrightest xray source in the cluster and argue that it is a symbiotic star this is the first such giantwhite dwarf binary to be identified in a globular cluster
|
[['we', 'identify', '233', 'xray', 'sources', 'of', 'which', '95', 'are', 'new', 'in', 'a', '222', 'ks', 'exposure', 'of', 'omega', 'centauri', 'with', 'the', 'chandra', 'xray', 'observatorys', 'acisi', 'detector', 'the', 'limiting', 'unabsorbed', 'flux', 'in', 'the', 'core', 'is', 'f_x', '0560', 'kev', 'simeq', '3', 'times', '1016', 'erg', 's1', 'cm2', 'l_x', 'simeq', '1', 'times', '1030', 'erg', 's1', 'at', '52', 'kpc', 'we', 'estimate', 'that', '60pm', '20', 'of', 'these', 'are', 'cluster', 'members', 'of', 'which', '30', 'lie', 'within', 'the', 'core', 'r_c', '155', 'arcsec', 'and', 'another', '30', 'between', '12', 'core', 'radii', 'we', 'identify', 'four', 'new', 'optical', 'counterparts', 'for', 'a', 'total', 'of', '45', 'likely', 'identifications', 'probable', 'cluster', 'members', 'include', '18', 'cataclysmic', 'variables', 'cvs', 'and', 'cv', 'candidates', 'one', 'quiescent', 'lowmass', 'xray', 'binary', 'four', 'variable', 'stars', 'and', 'five', 'stars', 'that', 'are', 'either', 'associated', 'with', 'w', 'cens', 'anomalous', 'red', 'giant', 'branch', 'or', 'are', 'subsubgiants', 'we', 'estimate', 'that', 'the', 'cluster', 'contains', '40pm', '10', 'cvs', 'with', 'l_x', '1031', 'erg', 's1', 'confirming', 'that', 'cvs', 'are', 'underabundant', 'in', 'w', 'cen', 'relative', 'to', 'the', 'field', 'intrinsic', 'absorption', 'is', 'required', 'to', 'fit', 'xray', 'spectra', 'of', 'six', 'of', 'the', 'nine', 'brightest', 'cvs', 'suggesting', 'magnetic', 'cvs', 'or', 'highinclination', 'systems', 'though', 'no', 'radio', 'millisecond', 'pulsars', 'msps', 'are', 'currently', 'known', 'in', 'w', 'cen', 'more', 'than', '30', 'unidentified', 'sources', 'have', 'luminosities', 'and', 'xray', 'colours', 'like', 'those', 'of', 'msps', 'found', 'in', 'other', 'globular', 'clusters', 'these', 'could', 'be', 'responsible', 'for', 'the', 'fermidetected', 'gammaray', 'emission', 'from', 'the', 'cluster', 'finally', 'we', 'identify', 'a', 'ch', 'star', 'as', 'the', 'counterpart', 'to', 'the', 'secondbrightest', 'xray', 'source', 'in', 'the', 'cluster', 'and', 'argue', 'that', 'it', 'is', 'a', 'symbiotic', 'star', 'this', 'is', 'the', 'first', 'such', 'giantwhite', 'dwarf', 'binary', 'to', 'be', 'identified', 'in', 'a', 'globular', 'cluster']]
|
[-0.0716670668047046, 0.1656188149365701, -0.003632336112222988, 0.1493279645799266, -0.11833928142089484, -0.09085353643655084, 0.1151867827694762, 0.46758928383130205, -0.10672734911411878, -0.4042823877142266, 0.06926459175816109, -0.38974966654597326, 0.02924700833490667, 0.23551516699543323, -0.028968439793012054, -0.07362891650080046, 0.06891802066978601, -0.027640328481757306, -0.040800852699263035, -0.28616837627351893, 0.21136906539255126, -0.01895972899099913, 0.10347903049063631, -0.10420438011768887, 0.05496207234558429, -0.09679617094938181, -0.038855180974558805, -0.0800486642636301, -0.09710994365879685, 0.023069326378912267, 0.256347341857338, 0.10984248586261623, 0.18524716364205346, -0.28022784428028463, -0.17583482347288018, 0.053603728905107194, 0.2083063842485074, -0.09031006455143495, 0.028169198487531088, -0.2549208741474449, 0.12351454494253898, -0.23373455727877196, -0.19674049884571818, 0.11649991928007772, 0.11691568240878901, 0.0559834078623906, -0.15425397510245054, 0.18161012080828334, -0.00462956775404317, 0.06637058911715137, -0.1981522284282097, -0.16153229415044912, -0.029264161705270467, 0.0021870074605987977, 0.014075148236566014, 0.1323073617125818, 0.16883540361832697, -0.10089602142781319, -0.06497309179056089, 0.38205341549315885, -0.01891452510704245, 0.08418543413116744, 0.21967208580575998, -0.20231563821328938, -0.27265150229403273, 0.19048442862577766, 0.08309702350678601, 0.11522540789685941, -0.21015660209552378, -0.031189042027333982, -0.008666387435171551, 0.2869870371001145, 0.04396886116908069, 0.11059832942262364, 0.31221514342843676, 0.0833467236808465, 0.031621797045497876, 0.10103420242094147, -0.3383786098189136, 0.027139448542725438, -0.22426412599802004, -0.07451805290982647, -0.07253171086434072, 0.1594456122166571, -0.14984849446908663, -0.10514089981926056, 0.2965107837208193, 0.06626151730902059, 0.19228652309330338, -0.007162287627354033, 0.21804160028046302, 0.11561977813090739, 0.11229269478159647, 0.1778215878442753, 0.32626228805725255, 0.21430343555470624, 0.04984611857325098, -0.1791632978828595, 0.013371605339438417, -0.0418103416721055]
|
1,803.04823
|
Compression of High Dynamic Range Video Using the HEVC and H.264/AVC
Standards
|
The existing video coding standards such as H.264/AVC and High Efficiency
Video Coding (HEVC) have been designed based on the statistical properties of
Low Dynamic Range (LDR) videos and are not accustomed to the characteristics of
High Dynamic Range (HDR) content. In this study, we investigate the performance
of the latest LDR video compression standard, HEVC, as well as the recent
widely commercially used video compression standard, H.264/AVC, on HDR content.
Subjective evaluations of results on an HDR display show that viewers clearly
prefer the videos coded via an HEVC-based encoder to the ones encoded using an
H.264/AVC encoder. In particular, HEVC outperforms H.264/AVC by an average of
10.18% in terms of mean opinion score and 25.08% in terms of bit rate savings.
|
eess.IV
|
the existing video coding standards such as h264avc and high efficiency video coding hevc have been designed based on the statistical properties of low dynamic range ldr videos and are not accustomed to the characteristics of high dynamic range hdr content in this study we investigate the performance of the latest ldr video compression standard hevc as well as the recent widely commercially used video compression standard h264avc on hdr content subjective evaluations of results on an hdr display show that viewers clearly prefer the videos coded via an hevcbased encoder to the ones encoded using an h264avc encoder in particular hevc outperforms h264avc by an average of 1018 in terms of mean opinion score and 2508 in terms of bit rate savings
|
[['the', 'existing', 'video', 'coding', 'standards', 'such', 'as', 'h264avc', 'and', 'high', 'efficiency', 'video', 'coding', 'hevc', 'have', 'been', 'designed', 'based', 'on', 'the', 'statistical', 'properties', 'of', 'low', 'dynamic', 'range', 'ldr', 'videos', 'and', 'are', 'not', 'accustomed', 'to', 'the', 'characteristics', 'of', 'high', 'dynamic', 'range', 'hdr', 'content', 'in', 'this', 'study', 'we', 'investigate', 'the', 'performance', 'of', 'the', 'latest', 'ldr', 'video', 'compression', 'standard', 'hevc', 'as', 'well', 'as', 'the', 'recent', 'widely', 'commercially', 'used', 'video', 'compression', 'standard', 'h264avc', 'on', 'hdr', 'content', 'subjective', 'evaluations', 'of', 'results', 'on', 'an', 'hdr', 'display', 'show', 'that', 'viewers', 'clearly', 'prefer', 'the', 'videos', 'coded', 'via', 'an', 'hevcbased', 'encoder', 'to', 'the', 'ones', 'encoded', 'using', 'an', 'h264avc', 'encoder', 'in', 'particular', 'hevc', 'outperforms', 'h264avc', 'by', 'an', 'average', 'of', '1018', 'in', 'terms', 'of', 'mean', 'opinion', 'score', 'and', '2508', 'in', 'terms', 'of', 'bit', 'rate', 'savings']]
|
[-0.061667470555355555, -0.009660792717858996, -0.03230255622641932, 0.02964175444718481, -0.010188668609413578, -0.1285150500823606, 0.004580579400367913, 0.4688036804560755, -0.24728397314377573, -0.32518576088620993, 0.09848956700383885, -0.280162986436645, -0.13474077397774234, 0.19451884419245066, -0.24192826377409682, 0.08354298311636829, 0.055875708990287584, 0.08960045948929962, -0.0583339194732825, -0.3198862139624162, 0.20861414749795018, 0.12259503826880674, 0.4258405633545557, 0.03538124018909837, 0.13540164313324896, 0.01201522990786394, -0.05662944515094497, -0.030377294575880457, -0.07940783389190595, 0.12383297077364853, 0.331931469204347, 0.21770581552285517, 0.24325671799664125, -0.3888214349777239, -0.2477171341268361, -0.02081877740145829, 0.1613926933811153, 0.052816691426712956, -0.08560549805501903, -0.3086758533904909, 0.15741181139238788, -0.2326484306745964, 0.12623812015870678, -0.07437117030599812, -0.038707439722798644, 0.0668711036531499, -0.29060222944588265, 0.07861257838390645, -0.007831386594888067, 0.09724147756751932, -0.0647728395854413, -0.1398283610212021, 0.04066382034597766, 0.19836659610011906, 0.049445037084982775, 0.09358523845420692, 0.14940449725607502, -0.2092360839377478, -0.14721831799958085, 0.4430581217662233, -0.12015804646109216, -0.19631897807922824, 0.17583218769010034, -0.02770267683844708, -0.06538509762632187, 0.14047981850940305, 0.23187028283070102, 0.113229375622678, -0.13179279898949822, 9.422611180868488e-05, -0.02437631186616958, 0.27104655311244436, 0.12201713019844572, 0.12666050777159876, 0.13789488783022236, 0.1898109612158179, -0.02484500299152521, 0.12089758208660852, -0.14006909001504117, -0.06990106309550341, -0.17757375851334606, -0.1228468262773679, -0.20179387156042408, -0.06443447098085851, -0.16587471314975477, -0.13356659822375896, 0.36199722319200145, 0.20133544016843202, 0.1655701489004566, 0.10098321035840228, 0.3913574943349498, 0.02404799312066867, 0.07416591284124822, 0.0668503738210735, 0.14185019280211847, -0.007770379377361082, 0.19594231827688388, -0.129583875148664, 0.06947641360638358, 0.04837249234685155]
|
1,803.04824
|
Random walks on dynamic configuration models: a trichotomy
|
We consider a dynamic random graph on $n$ vertices that is obtained by
starting from a random graph generated according to the configuration model
with a prescribed degree sequence and at each unit of time randomly rewiring a
fraction $\alpha_n$ of the edges. We are interested in the mixing time of a
random walk without backtracking on this dynamic random graph in the limit as
$n\to\infty$, when $\alpha_n$ is chosen such that $\lim_{n\to\infty} \alpha_n
(\log n)^2 = \beta \in [0,\infty]$. In [1] we found that, under mild regularity
conditions on the degree sequence, the mixing time is of order
$1/\sqrt{\alpha_n}$ when $\beta=\infty$. In the present paper we investigate
what happens when $\beta \in [0,\infty)$. It turns out that the mixing time is
of order $\log n$, with the scaled mixing time exhibiting a one-sided cutoff
when $\beta \in (0,\infty)$ and a two-sided cutoff when $\beta=0$. The
occurrence of a one-sided cutoff is a rare phenomenon. In our setting it comes
from a competition between the time scales of mixing on the static graph, as
identified by Ben-Hamou and Salez [4], and the regeneration time of first
stepping across a rewired edge.
|
math.PR
|
we consider a dynamic random graph on n vertices that is obtained by starting from a random graph generated according to the configuration model with a prescribed degree sequence and at each unit of time randomly rewiring a fraction alpha_n of the edges we are interested in the mixing time of a random walk without backtracking on this dynamic random graph in the limit as ntoinfty when alpha_n is chosen such that lim_ntoinfty alpha_n log n2 beta in 0infty in 1 we found that under mild regularity conditions on the degree sequence the mixing time is of order 1sqrtalpha_n when betainfty in the present paper we investigate what happens when beta in 0infty it turns out that the mixing time is of order log n with the scaled mixing time exhibiting a onesided cutoff when beta in 0infty and a twosided cutoff when beta0 the occurrence of a onesided cutoff is a rare phenomenon in our setting it comes from a competition between the time scales of mixing on the static graph as identified by benhamou and salez 4 and the regeneration time of first stepping across a rewired edge
|
[['we', 'consider', 'a', 'dynamic', 'random', 'graph', 'on', 'n', 'vertices', 'that', 'is', 'obtained', 'by', 'starting', 'from', 'a', 'random', 'graph', 'generated', 'according', 'to', 'the', 'configuration', 'model', 'with', 'a', 'prescribed', 'degree', 'sequence', 'and', 'at', 'each', 'unit', 'of', 'time', 'randomly', 'rewiring', 'a', 'fraction', 'alpha_n', 'of', 'the', 'edges', 'we', 'are', 'interested', 'in', 'the', 'mixing', 'time', 'of', 'a', 'random', 'walk', 'without', 'backtracking', 'on', 'this', 'dynamic', 'random', 'graph', 'in', 'the', 'limit', 'as', 'ntoinfty', 'when', 'alpha_n', 'is', 'chosen', 'such', 'that', 'lim_ntoinfty', 'alpha_n', 'log', 'n2', 'beta', 'in', '0infty', 'in', '1', 'we', 'found', 'that', 'under', 'mild', 'regularity', 'conditions', 'on', 'the', 'degree', 'sequence', 'the', 'mixing', 'time', 'is', 'of', 'order', '1sqrtalpha_n', 'when', 'betainfty', 'in', 'the', 'present', 'paper', 'we', 'investigate', 'what', 'happens', 'when', 'beta', 'in', '0infty', 'it', 'turns', 'out', 'that', 'the', 'mixing', 'time', 'is', 'of', 'order', 'log', 'n', 'with', 'the', 'scaled', 'mixing', 'time', 'exhibiting', 'a', 'onesided', 'cutoff', 'when', 'beta', 'in', '0infty', 'and', 'a', 'twosided', 'cutoff', 'when', 'beta0', 'the', 'occurrence', 'of', 'a', 'onesided', 'cutoff', 'is', 'a', 'rare', 'phenomenon', 'in', 'our', 'setting', 'it', 'comes', 'from', 'a', 'competition', 'between', 'the', 'time', 'scales', 'of', 'mixing', 'on', 'the', 'static', 'graph', 'as', 'identified', 'by', 'benhamou', 'and', 'salez', '4', 'and', 'the', 'regeneration', 'time', 'of', 'first', 'stepping', 'across', 'a', 'rewired', 'edge']]
|
[-0.14808140912816484, 0.19728274686024228, -0.05748515604113407, 0.04345501023295157, 0.005028802214160641, -0.14819728746574293, 0.10066860756883893, 0.39497813970801676, -0.28301336641789987, -0.24983085232707572, 0.10443925470896462, -0.27763852478559825, -0.12575539760291576, 0.10680456182354704, -0.036492353815466484, 0.036313425780501854, 0.023468876928784587, 0.09583215117504067, -0.0045460686118569855, -0.21832507454785222, 0.30409307397426444, 0.030204421580066913, 0.19071169163563606, -0.0037085697407205093, 0.0756302864855512, -0.008603175215304215, -0.0019126964870473727, 0.02222141633989095, -0.16074428548915634, -0.008633040907257732, 0.18672260730477802, 0.06935649391442061, 0.313298083452924, -0.3858765689160754, -0.1772972718252741, 0.15630347604685008, 0.14825412319933481, 0.022730689783124848, -0.020815662794469045, -0.2376684447913926, 0.10551674888120033, -0.07914016364861225, -0.11275706388194986, 0.014811401290105695, 0.06632948257128134, 0.031294253455385806, -0.3498354570771706, 0.05367496298834127, 0.08869974435049485, 0.03117168513423902, 0.040268139849278205, -0.10573724904493924, -0.027235074119241115, 0.1241353196316421, 0.05456109194780398, 0.06533450008360074, 0.07050819087406977, -0.09889440160081227, -0.0966071683636054, 0.3872160426280003, -0.09492606919895402, -0.19310338043710254, 0.13542155678844714, -0.19876246373763584, -0.17730370157229852, 0.10793364412978569, 0.14171409164307677, 0.1499529557124256, -0.09083271754895983, 0.13911449381749721, -0.062478721709030266, 0.1742507013878686, 0.10628409133580058, -0.00605813314657698, 0.10946224984326498, 0.18083676836884363, 0.12952222717811968, 0.1393867744965122, -0.07143127279445291, -0.09134892050295751, -0.3361502183264399, -0.11119824222368287, -0.22125299272072957, 0.10836068715682214, -0.182225562324636, -0.1738176061384791, 0.36318393434061014, 0.12229738955663398, 0.25232149795579545, 0.14640363355453914, 0.2197539382564657, 0.12698374304826313, 0.01296797180746464, 0.0936832231038468, 0.11746618995304278, 0.07553066725116916, 0.07764779749522084, -0.19063011100119415, 0.1070462113365214, 0.08695334999356419]
|
1,803.04825
|
Low-Rank Boolean Matrix Approximation by Integer Programming
|
Low-rank approximations of data matrices are an important dimensionality
reduction tool in machine learning and regression analysis. We consider the
case of categorical variables, where it can be formulated as the problem of
finding low-rank approximations to Boolean matrices. In this paper we give what
is to the best of our knowledge the first integer programming formulation that
relies on only polynomially many variables and constraints, we discuss how to
solve it computationally and report numerical tests on synthetic and real-world
data.
|
cs.LG cs.DM stat.ML
|
lowrank approximations of data matrices are an important dimensionality reduction tool in machine learning and regression analysis we consider the case of categorical variables where it can be formulated as the problem of finding lowrank approximations to boolean matrices in this paper we give what is to the best of our knowledge the first integer programming formulation that relies on only polynomially many variables and constraints we discuss how to solve it computationally and report numerical tests on synthetic and realworld data
|
[['lowrank', 'approximations', 'of', 'data', 'matrices', 'are', 'an', 'important', 'dimensionality', 'reduction', 'tool', 'in', 'machine', 'learning', 'and', 'regression', 'analysis', 'we', 'consider', 'the', 'case', 'of', 'categorical', 'variables', 'where', 'it', 'can', 'be', 'formulated', 'as', 'the', 'problem', 'of', 'finding', 'lowrank', 'approximations', 'to', 'boolean', 'matrices', 'in', 'this', 'paper', 'we', 'give', 'what', 'is', 'to', 'the', 'best', 'of', 'our', 'knowledge', 'the', 'first', 'integer', 'programming', 'formulation', 'that', 'relies', 'on', 'only', 'polynomially', 'many', 'variables', 'and', 'constraints', 'we', 'discuss', 'how', 'to', 'solve', 'it', 'computationally', 'and', 'report', 'numerical', 'tests', 'on', 'synthetic', 'and', 'realworld', 'data']]
|
[-0.06563852268566446, -0.0175509222869395, -0.0718799813355251, 0.08434618538154698, -0.13420464138772975, -0.15649490521811857, 0.04548389549940688, 0.3770565214771323, -0.3286706631912327, -0.3288555099265423, 0.17536209943624803, -0.24526494777979324, -0.23065606263897767, 0.19072840603568206, -0.0962875311308336, 0.10876214551943832, 0.09604942906511629, 0.0017152716882708596, -0.08101206387268244, -0.33262800473844767, 0.3241680042943122, 0.029991608090335277, 0.23468511413055948, 0.025548505449167837, 0.11561364713181718, 0.025964919111418832, -0.04792123314038646, 0.003414233447983861, -0.08123522816361113, 0.14004475138258052, 0.36699218582361937, 0.25245595491695694, 0.29857359308658576, -0.4545984485118491, -0.15349821449348294, 0.13462071462744485, 0.12303403235699345, 0.11415408397229707, -0.0007479159763400875, -0.24187773260253867, 0.06022667842945538, -0.11212097336651712, -0.03522334927579433, -0.1987394653033556, 0.0014797956285225909, -0.03258404291303056, -0.32863809724860804, 0.04417738001566471, 0.07387534218908447, 0.04483077002734673, -0.05564359879325621, -0.17868257746691021, 0.09248727648348616, 0.06751651909179622, 0.08643093369134543, -0.008372084214919952, 0.08952029730426148, -0.09034883694030435, -0.1580411389288379, 0.38949919908829944, -0.010973127727061736, -0.2669750864180259, 0.18294243141440902, -0.07694373417236819, -0.21689114769034815, 0.04372594859905359, 0.2699578040756467, 0.13815240363204262, -0.1445214053184339, 0.11676814154687724, -0.12258915308999216, 0.18693575744585292, 0.0051028450280882235, -0.014189030571908848, 0.100844358639201, 0.1991891591559823, 0.07615845859911088, 0.14894383313083204, -0.034419077914208174, -0.08380748571191983, -0.2654059124349548, -0.11722823745775514, -0.24261809997090206, 0.009625602106098086, -0.14426082830305392, -0.18737500224535059, 0.3567528922292518, 0.21982263575489747, 0.19239585366236364, 0.09507469756801318, 0.3402234718612418, 0.12691706482593607, 0.01107445361288605, 0.08970909858145183, 0.16018301530218707, 0.1555586717341368, 0.06142101472594332, -0.1747171398047812, 0.07527104279639699, 0.05586827973403582]
|
1,803.04826
|
The Effect of Frame Rate on 3D Video Quality and Bitrate
|
Increasing the frame rate of a 3D video generally results in improved Quality
of Experience (QoE). However, higher frame rates involve a higher degree of
complexity in capturing, transmission, storage, and display. The question that
arises here is what frame rate guarantees high viewing quality of experience
given the existing/required 3D devices and technologies (3D cameras, 3D TVs,
compression, transmission bandwidth, and storage capacity). This question has
already been addressed for the case of 2D video, but not for 3D. The objective
of this paper is to study the relationship between 3D quality and bitrate at
different frame rates. Our performance evaluations show that increasing the
frame rate of 3D videos beyond 60 fps may not be visually distinguishable. In
addition, our experiments show that when the available bandwidth is reduced,
the highest possible 3D quality of experience can be achieved by adjusting
(decreasing) the frame rate instead of increasing the compression ratio. The
results of our study are of particular interest to network providers for rate
adaptation in variable bitrate channels.
|
eess.IV
|
increasing the frame rate of a 3d video generally results in improved quality of experience qoe however higher frame rates involve a higher degree of complexity in capturing transmission storage and display the question that arises here is what frame rate guarantees high viewing quality of experience given the existingrequired 3d devices and technologies 3d cameras 3d tvs compression transmission bandwidth and storage capacity this question has already been addressed for the case of 2d video but not for 3d the objective of this paper is to study the relationship between 3d quality and bitrate at different frame rates our performance evaluations show that increasing the frame rate of 3d videos beyond 60 fps may not be visually distinguishable in addition our experiments show that when the available bandwidth is reduced the highest possible 3d quality of experience can be achieved by adjusting decreasing the frame rate instead of increasing the compression ratio the results of our study are of particular interest to network providers for rate adaptation in variable bitrate channels
|
[['increasing', 'the', 'frame', 'rate', 'of', 'a', '3d', 'video', 'generally', 'results', 'in', 'improved', 'quality', 'of', 'experience', 'qoe', 'however', 'higher', 'frame', 'rates', 'involve', 'a', 'higher', 'degree', 'of', 'complexity', 'in', 'capturing', 'transmission', 'storage', 'and', 'display', 'the', 'question', 'that', 'arises', 'here', 'is', 'what', 'frame', 'rate', 'guarantees', 'high', 'viewing', 'quality', 'of', 'experience', 'given', 'the', 'existingrequired', '3d', 'devices', 'and', 'technologies', '3d', 'cameras', '3d', 'tvs', 'compression', 'transmission', 'bandwidth', 'and', 'storage', 'capacity', 'this', 'question', 'has', 'already', 'been', 'addressed', 'for', 'the', 'case', 'of', '2d', 'video', 'but', 'not', 'for', '3d', 'the', 'objective', 'of', 'this', 'paper', 'is', 'to', 'study', 'the', 'relationship', 'between', '3d', 'quality', 'and', 'bitrate', 'at', 'different', 'frame', 'rates', 'our', 'performance', 'evaluations', 'show', 'that', 'increasing', 'the', 'frame', 'rate', 'of', '3d', 'videos', 'beyond', '60', 'fps', 'may', 'not', 'be', 'visually', 'distinguishable', 'in', 'addition', 'our', 'experiments', 'show', 'that', 'when', 'the', 'available', 'bandwidth', 'is', 'reduced', 'the', 'highest', 'possible', '3d', 'quality', 'of', 'experience', 'can', 'be', 'achieved', 'by', 'adjusting', 'decreasing', 'the', 'frame', 'rate', 'instead', 'of', 'increasing', 'the', 'compression', 'ratio', 'the', 'results', 'of', 'our', 'study', 'are', 'of', 'particular', 'interest', 'to', 'network', 'providers', 'for', 'rate', 'adaptation', 'in', 'variable', 'bitrate', 'channels']]
|
[-0.13600969324242432, 0.05475382422565412, 0.007133155886889898, 0.0023643992526718137, -0.028922909445929946, -0.15066674750908252, 0.06733961804287933, 0.4640882425445911, -0.25667446104527797, -0.33162718621349474, 0.084427540356631, -0.24627715670530909, -0.11566426990790651, 0.2136434505486654, -0.16004557374598286, 0.07060177518566799, 0.1142235830155942, 0.06173817991763789, -0.09685366995781061, -0.3126774945919952, 0.2596805989093719, 0.13723129610808796, 0.4067583065561689, 0.05021301415757064, 0.0663791331619144, -0.02455693299817694, -0.03831879005424286, 0.026100582114610773, -0.09591443336098857, 0.1415592010176539, 0.28540070010730395, 0.1858006030167858, 0.2808337922845232, -0.4157954986746374, -0.2616919053293634, 0.04384717777676401, 0.15919489400700954, 0.0835955295962287, -0.09394202642251699, -0.23527571379359571, 0.12402367007262373, -0.17679691411854703, -0.04334884331476867, -0.04115826356339089, 0.007043885077997955, 0.01933649388122868, -0.3031251332218819, 0.06476957588837814, 0.04125131149803512, 0.0717659281860841, -0.07165801775621657, -0.041102918564772224, -0.00046311989998477595, 0.1999932770770144, 0.060017577583196285, 0.08323166182820212, 0.12742628780199072, -0.21417139400047255, -0.0808449678874591, 0.42109479554738216, -0.04576759474632488, -0.19631880588355688, 0.20529650585121362, -0.15237213350690856, -0.05185296522638603, 0.1838727574686558, 0.2223918733911382, 0.0915518935105344, -0.1175896491088982, 0.00629993169418705, -0.02259796509268688, 0.21610260154638025, 0.11840603038517497, 0.10536810462853234, 0.17043314723445005, 0.17425949829331006, 0.038991662507539084, 0.11109932468065785, -0.09267497565924075, -0.05722253178607139, -0.20280882423710928, -0.17548438122397975, -0.20427438268527845, -0.008875294234324519, -0.11453249640674303, -0.06102299020347888, 0.3680613929765266, 0.18343631866624938, 0.19822568471178587, 0.09451281026615733, 0.35222252940878884, 0.10077868081147276, 0.06642752526632963, 0.05356639060491358, 0.22819999376535197, -0.02427537063795703, 0.158197140740503, -0.1975489908758529, 0.08012362149386117, 0.03251431184434141]
|
1,803.04827
|
A Learning-Based Visual Saliency Fusion Model for High Dynamic Range
Video (LBVS-HDR)
|
Saliency prediction for Standard Dynamic Range (SDR) videos has been well
explored in the last decade. However, limited studies are available on High
Dynamic Range (HDR) Visual Attention Models (VAMs). Considering that the
characteristic of HDR content in terms of dynamic range and color gamut is
quite different than those of SDR content, it is essential to identify the
importance of different saliency attributes of HDR videos for designing a VAM
and understand how to combine these features. To this end we propose a
learning-based visual saliency fusion method for HDR content (LVBS-HDR) to
combine various visual saliency features. In our approach various conspicuity
maps are extracted from HDR data, and then for fusing conspicuity maps, a
Random Forests algorithm is used to train a model based on the collected data
from an eye-tracking experiment. Performance evaluations demonstrate the
superiority of the proposed fusion method against other existing fusion
methods.
|
cs.CV
|
saliency prediction for standard dynamic range sdr videos has been well explored in the last decade however limited studies are available on high dynamic range hdr visual attention models vams considering that the characteristic of hdr content in terms of dynamic range and color gamut is quite different than those of sdr content it is essential to identify the importance of different saliency attributes of hdr videos for designing a vam and understand how to combine these features to this end we propose a learningbased visual saliency fusion method for hdr content lvbshdr to combine various visual saliency features in our approach various conspicuity maps are extracted from hdr data and then for fusing conspicuity maps a random forests algorithm is used to train a model based on the collected data from an eyetracking experiment performance evaluations demonstrate the superiority of the proposed fusion method against other existing fusion methods
|
[['saliency', 'prediction', 'for', 'standard', 'dynamic', 'range', 'sdr', 'videos', 'has', 'been', 'well', 'explored', 'in', 'the', 'last', 'decade', 'however', 'limited', 'studies', 'are', 'available', 'on', 'high', 'dynamic', 'range', 'hdr', 'visual', 'attention', 'models', 'vams', 'considering', 'that', 'the', 'characteristic', 'of', 'hdr', 'content', 'in', 'terms', 'of', 'dynamic', 'range', 'and', 'color', 'gamut', 'is', 'quite', 'different', 'than', 'those', 'of', 'sdr', 'content', 'it', 'is', 'essential', 'to', 'identify', 'the', 'importance', 'of', 'different', 'saliency', 'attributes', 'of', 'hdr', 'videos', 'for', 'designing', 'a', 'vam', 'and', 'understand', 'how', 'to', 'combine', 'these', 'features', 'to', 'this', 'end', 'we', 'propose', 'a', 'learningbased', 'visual', 'saliency', 'fusion', 'method', 'for', 'hdr', 'content', 'lvbshdr', 'to', 'combine', 'various', 'visual', 'saliency', 'features', 'in', 'our', 'approach', 'various', 'conspicuity', 'maps', 'are', 'extracted', 'from', 'hdr', 'data', 'and', 'then', 'for', 'fusing', 'conspicuity', 'maps', 'a', 'random', 'forests', 'algorithm', 'is', 'used', 'to', 'train', 'a', 'model', 'based', 'on', 'the', 'collected', 'data', 'from', 'an', 'eyetracking', 'experiment', 'performance', 'evaluations', 'demonstrate', 'the', 'superiority', 'of', 'the', 'proposed', 'fusion', 'method', 'against', 'other', 'existing', 'fusion', 'methods']]
|
[0.006403285741255987, -0.024124553435596937, -0.09056417946469339, 0.07024243848879615, -0.077064097083905, -0.1434649418001907, -0.02600733147021508, 0.4958797724254979, -0.2476012126086342, -0.31554022329490655, 0.07930901717010186, -0.27654491224944994, -0.17528349395228812, 0.20964620871650644, -0.15602960749435546, 0.11579663475941017, 0.09129462289880186, 0.04370639111921691, -0.041848615719780526, -0.25516212536115823, 0.29712946205019775, 0.04875711709160933, 0.38199046256658215, 0.04282162626955233, 0.14161285307827162, -0.017611191970539973, -0.09703925893885777, 0.010793832182589662, -0.08295331946786082, 0.1831350896832527, 0.3634832001883498, 0.23052258875327272, 0.26764682769750386, -0.3614080686547212, -0.27961094888792865, 0.04512161500876982, 0.11613592077609176, 0.09724002015220638, -0.08710787941751715, -0.34208998085943443, 0.14498789495579123, -0.18392396587003398, 0.06722860069220397, -0.12809450508739123, -0.0016148442765010283, -0.015593818842820923, -0.31007583063695854, 0.02620507857993545, -0.004848255934475003, 0.10189539306303298, -0.08582383553628753, -0.128144736392361, 0.007777979155227342, 0.19819888344734607, 0.02735185854202574, 0.051461096615499295, 0.1680385525675878, -0.2101112029299565, -0.12849289832961738, 0.3960910841147572, -0.05512034347885985, -0.18258344613940725, 0.2497215373082174, -0.03760930890570576, -0.12014662458767626, 0.14055841619886408, 0.23648896729284521, 0.13852651030662777, -0.18414687256222503, -0.011012860993782821, -0.027373250942652257, 0.1686567376336886, 0.04764255675668484, 0.0164869286544971, 0.1769726677569592, 0.2354947983368531, -0.01017222370352321, 0.13295801098328772, -0.16566939799790115, -0.06552317357253308, -0.16976307106248084, -0.06740429017992827, -0.1700658113758186, -0.07546096113854206, -0.10174497332857162, -0.09584419778860706, 0.448164844416682, 0.30379617677989024, 0.23602056960284634, 0.08432863754589086, 0.38598749891623557, 0.012580590807807776, 0.10387648600497401, -0.0011680919267612216, 0.1659540770162872, 0.009489579151240771, 0.16335176472745885, -0.13015927798458493, 0.06724782144860209, 0.0720536965008]
|
1,803.04828
|
Amenable actions of discrete quantum groups on von Neumann algebras
|
We introduce the notion of Zimmer amenability for actions of discrete quantum
groups on von Neumann algebras. We prove generalizations of several fundamental
results of the theory in the noncommutative case. In particular, we give a
characterization of Zimmer amenability of an action $\alpha:\Bbb
G\curvearrowright N$ in terms of $\hat{\Bbb{G}}$-injectivity of the von Neumann
algebra crossed product $N\ltimes_\alpha\Bbb G$. As an application we show that
the actions of any discrete quantum group on its Poisson boundaries are always
amenable.
|
math.OA
|
we introduce the notion of zimmer amenability for actions of discrete quantum groups on von neumann algebras we prove generalizations of several fundamental results of the theory in the noncommutative case in particular we give a characterization of zimmer amenability of an action alphabbb gcurvearrowright n in terms of hatbbbginjectivity of the von neumann algebra crossed product nltimes_alphabbb g as an application we show that the actions of any discrete quantum group on its poisson boundaries are always amenable
|
[['we', 'introduce', 'the', 'notion', 'of', 'zimmer', 'amenability', 'for', 'actions', 'of', 'discrete', 'quantum', 'groups', 'on', 'von', 'neumann', 'algebras', 'we', 'prove', 'generalizations', 'of', 'several', 'fundamental', 'results', 'of', 'the', 'theory', 'in', 'the', 'noncommutative', 'case', 'in', 'particular', 'we', 'give', 'a', 'characterization', 'of', 'zimmer', 'amenability', 'of', 'an', 'action', 'alphabbb', 'gcurvearrowright', 'n', 'in', 'terms', 'of', 'hatbbbginjectivity', 'of', 'the', 'von', 'neumann', 'algebra', 'crossed', 'product', 'nltimes_alphabbb', 'g', 'as', 'an', 'application', 'we', 'show', 'that', 'the', 'actions', 'of', 'any', 'discrete', 'quantum', 'group', 'on', 'its', 'poisson', 'boundaries', 'are', 'always', 'amenable']]
|
[-0.14831296992365664, 0.12190785864100019, -0.10994593658190417, 0.0202176833623334, -0.06915576927559941, -0.09424309649406687, -0.020718313399763582, 0.37311905411096585, -0.3044744508193904, -0.1480421028590124, 0.1490169988690851, -0.23548530102217277, -0.15750160287930876, 0.22701405939695082, -0.21453438910018457, 0.0015103830335551482, 0.08001055898095824, 0.1880439971880007, -0.11865737834197812, -0.2692515208281724, 0.4098567743969493, -0.02506106007403057, 0.23321069298617658, 0.07303867981720127, 0.07595274659903034, 0.058958695895087565, -0.030057718762882837, 0.025321110972742502, -0.18670251220818931, 0.12020974486183963, 0.250017962639073, 0.0916716803422835, 0.29254127722723705, -0.4027784995636658, -0.12856599972215726, 0.1455274244745899, 0.06841792963984374, 0.01654028180698668, -0.03598930923066004, -0.35090867155170263, 0.06243800355954782, -0.2659940567529319, -0.09298318052529603, -0.07366378422777511, 0.03141364722365612, -0.04681941109562391, -0.2258695564294038, 0.04473647432352759, 0.1463087411891473, 0.1365530520040346, -0.12153083853895384, -0.03200844176554758, 0.0016247280842722638, 0.14213504352435274, -0.06782717664579027, -0.08556654423744858, 0.10737815582634587, -0.08241435646471616, -0.21697967353669045, 0.39487452839354154, -0.032094910422242, -0.22879575582613287, 0.18091565903619325, -0.17602669315314606, -0.20953368571415348, -0.008325010121456887, 0.06990073656197637, 0.15674101693653747, -0.01727373510795204, 0.22546836279185586, -0.14070858862741212, 0.03474229483522082, 0.06684441148229923, 0.05616980397117961, 0.07755682448623702, 0.06145596023232333, 0.15840659894686387, 0.1811578477224286, 0.07268482837887284, -0.05845700331816548, -0.3899448829654016, -0.2388710404476641, -0.13841708910063302, 0.15808943722789226, -0.12767731836433277, -0.25501668101826097, 0.3502680413228901, 0.11595396201224312, 0.12564256702133111, 0.10831625068462208, 0.16581153516706668, 0.11689617219963111, 0.014929287000804356, 0.05264060751314422, 0.10158721966619946, 0.28052108553483296, -0.02754868340286377, -0.19156094603730658, -0.056532416621370145, 0.23970749566184454]
|
1,803.04829
|
Influence of surface integrity on geometry and dynamics of functionally
graded nanobeams
|
In this study effects of surface integrity on the mechanics of functionally
graded (FG) nanobeams are investigated. This study reports the changes in the
geometry and dynamics of FG nanobeams because of changes in their surface
textures and/or surface mechanical properties. A new model for FG nanobeams
with engineering surfaces is developed. This engineering surface is considered
as a different material phase with a surface texture (waviness and roughness).
The initial curvatures of cantilever, simple supported, and clamped-clamped FG
nanobeams due to surface residual stresses are determined. Moreover, their
natural frequencies and mode shapes are derived depending on surface integrity.
The initial curvatures of FG beams are obtained increasing with an increase in
the slope of the surface texture and/or a decrease in the heights of the
surface roughness. Moreover, it is observed that the natural frequencies of FG
beams may decrease or increase due surface integrity depending on the boundary
conditions. Thus, as a first prospect, the surface roughness allows the
vibration energy to propagation over the beam length and hence its natural
frequency decreases resulting in a zero-frequency mode. As for the other
prospect, surface roughness inhibits the propagation of the vibration energy
through the beam length leading to a mode localization. It is revealed that a
mode localization is accompanied with an increase in the natural frequency of
the nanobeam. The proposed surface integrity model for FG nanobeams is compared
with Gurtin-Murdoch surface elasticity model. The results demonstrate that the
surface integrity model is preferred over the former model where it accounts
for, both, surface texture and surface mechanical properties effects. However,
Gurtin-Murdoch model assumes smooth surfaces of nanobeams which leads to
under/overestimations of their mechanics.
|
physics.app-ph
|
in this study effects of surface integrity on the mechanics of functionally graded fg nanobeams are investigated this study reports the changes in the geometry and dynamics of fg nanobeams because of changes in their surface textures andor surface mechanical properties a new model for fg nanobeams with engineering surfaces is developed this engineering surface is considered as a different material phase with a surface texture waviness and roughness the initial curvatures of cantilever simple supported and clampedclamped fg nanobeams due to surface residual stresses are determined moreover their natural frequencies and mode shapes are derived depending on surface integrity the initial curvatures of fg beams are obtained increasing with an increase in the slope of the surface texture andor a decrease in the heights of the surface roughness moreover it is observed that the natural frequencies of fg beams may decrease or increase due surface integrity depending on the boundary conditions thus as a first prospect the surface roughness allows the vibration energy to propagation over the beam length and hence its natural frequency decreases resulting in a zerofrequency mode as for the other prospect surface roughness inhibits the propagation of the vibration energy through the beam length leading to a mode localization it is revealed that a mode localization is accompanied with an increase in the natural frequency of the nanobeam the proposed surface integrity model for fg nanobeams is compared with gurtinmurdoch surface elasticity model the results demonstrate that the surface integrity model is preferred over the former model where it accounts for both surface texture and surface mechanical properties effects however gurtinmurdoch model assumes smooth surfaces of nanobeams which leads to underoverestimations of their mechanics
|
[['in', 'this', 'study', 'effects', 'of', 'surface', 'integrity', 'on', 'the', 'mechanics', 'of', 'functionally', 'graded', 'fg', 'nanobeams', 'are', 'investigated', 'this', 'study', 'reports', 'the', 'changes', 'in', 'the', 'geometry', 'and', 'dynamics', 'of', 'fg', 'nanobeams', 'because', 'of', 'changes', 'in', 'their', 'surface', 'textures', 'andor', 'surface', 'mechanical', 'properties', 'a', 'new', 'model', 'for', 'fg', 'nanobeams', 'with', 'engineering', 'surfaces', 'is', 'developed', 'this', 'engineering', 'surface', 'is', 'considered', 'as', 'a', 'different', 'material', 'phase', 'with', 'a', 'surface', 'texture', 'waviness', 'and', 'roughness', 'the', 'initial', 'curvatures', 'of', 'cantilever', 'simple', 'supported', 'and', 'clampedclamped', 'fg', 'nanobeams', 'due', 'to', 'surface', 'residual', 'stresses', 'are', 'determined', 'moreover', 'their', 'natural', 'frequencies', 'and', 'mode', 'shapes', 'are', 'derived', 'depending', 'on', 'surface', 'integrity', 'the', 'initial', 'curvatures', 'of', 'fg', 'beams', 'are', 'obtained', 'increasing', 'with', 'an', 'increase', 'in', 'the', 'slope', 'of', 'the', 'surface', 'texture', 'andor', 'a', 'decrease', 'in', 'the', 'heights', 'of', 'the', 'surface', 'roughness', 'moreover', 'it', 'is', 'observed', 'that', 'the', 'natural', 'frequencies', 'of', 'fg', 'beams', 'may', 'decrease', 'or', 'increase', 'due', 'surface', 'integrity', 'depending', 'on', 'the', 'boundary', 'conditions', 'thus', 'as', 'a', 'first', 'prospect', 'the', 'surface', 'roughness', 'allows', 'the', 'vibration', 'energy', 'to', 'propagation', 'over', 'the', 'beam', 'length', 'and', 'hence', 'its', 'natural', 'frequency', 'decreases', 'resulting', 'in', 'a', 'zerofrequency', 'mode', 'as', 'for', 'the', 'other', 'prospect', 'surface', 'roughness', 'inhibits', 'the', 'propagation', 'of', 'the', 'vibration', 'energy', 'through', 'the', 'beam', 'length', 'leading', 'to', 'a', 'mode', 'localization', 'it', 'is', 'revealed', 'that', 'a', 'mode', 'localization', 'is', 'accompanied', 'with', 'an', 'increase', 'in', 'the', 'natural', 'frequency', 'of', 'the', 'nanobeam', 'the', 'proposed', 'surface', 'integrity', 'model', 'for', 'fg', 'nanobeams', 'is', 'compared', 'with', 'gurtinmurdoch', 'surface', 'elasticity', 'model', 'the', 'results', 'demonstrate', 'that', 'the', 'surface', 'integrity', 'model', 'is', 'preferred', 'over', 'the', 'former', 'model', 'where', 'it', 'accounts', 'for', 'both', 'surface', 'texture', 'and', 'surface', 'mechanical', 'properties', 'effects', 'however', 'gurtinmurdoch', 'model', 'assumes', 'smooth', 'surfaces', 'of', 'nanobeams', 'which', 'leads', 'to', 'underoverestimations', 'of', 'their', 'mechanics']]
|
[-0.1491053575623057, 0.16118920338769333, -0.08539182550722746, -0.012721119636147143, -0.045501239398153495, -0.12875342415645719, -0.0055846792939722055, 0.38362458311423336, -0.2804888951652449, -0.2945403069619545, 0.07289449176993958, -0.24489286380553854, -0.16944853765236736, 0.22029223538040713, -0.08089098700811323, 0.05266321039395976, 0.0247832336057622, -0.0011039745555051583, -0.06687353097242403, -0.16749270463013927, 0.285715578324932, 0.07555632458383338, 0.34853322873739595, 0.08661504907419623, 0.06538370584151137, -0.015476189124927247, 0.03638983444350926, 0.028475773064319126, -0.15202339549785837, 0.1161982917437592, 0.1945441944940056, 0.0036937668919563293, 0.2147678958734484, -0.4547606267021607, -0.26502778376199276, 0.044221406289972634, 0.06214034690508257, 0.10501264933314135, -0.03707110773346541, -0.23049188150334166, 0.08826702443561216, -0.10620665392694364, -0.1546664577372801, -0.005182772985384833, 0.0321371355730531, 0.015211253093217211, -0.20531497194880632, 0.09159133859605213, 0.07047626794912189, 0.0999257076358282, -0.10484495765940795, -0.09536860654425384, -0.14311817071983496, 0.0904904875486399, 0.07611754762256692, 0.012369701462938525, 0.1954149935786485, -0.13710909106738517, -0.023523314698538977, 0.3974332527840416, -0.05116055163440945, -0.2167585192120713, 0.19818779033283776, -0.14528358088058366, -0.010261707267516273, 0.16998165825602982, 0.16663474356294977, 0.08510807032840119, -0.10693732545486645, 0.06096000269787359, 0.04272417506419136, 0.19842907417944144, 0.1148983481534415, 0.03085119397129877, 0.23711518196576684, 0.1899721953463439, 0.04731835856390514, 0.13661133928041028, -0.12410870195775152, 0.0008876419704903266, -0.2842097819025675, -0.17998901458135505, -0.15877821190716537, -0.010731665786060926, -0.06089697214039863, -0.2229365470815825, 0.4226012804793368, 0.06345007429360043, 0.1787136510842004, 0.01744835703925183, 0.2561224191206702, 0.09452051286654306, 0.0917985581251853, 0.012528077531739961, 0.2495128910439156, 0.14667342597595248, 0.04060951792115761, -0.26390665201989516, 0.0853823473134326, -0.00022087729931306497]
|
1,803.0483
|
Low complexity solutions of the Allen-Cahn equation on three-spheres
|
In this short note, we prove that on the three-sphere with any bumpy metric
there exist at least four solutions of the Allen-Cahn equation with spherical
interface and index at most two. The proof combines several recent results from
the literature.
|
math.DG
|
in this short note we prove that on the threesphere with any bumpy metric there exist at least four solutions of the allencahn equation with spherical interface and index at most two the proof combines several recent results from the literature
|
[['in', 'this', 'short', 'note', 'we', 'prove', 'that', 'on', 'the', 'threesphere', 'with', 'any', 'bumpy', 'metric', 'there', 'exist', 'at', 'least', 'four', 'solutions', 'of', 'the', 'allencahn', 'equation', 'with', 'spherical', 'interface', 'and', 'index', 'at', 'most', 'two', 'the', 'proof', 'combines', 'several', 'recent', 'results', 'from', 'the', 'literature']]
|
[-0.14590877244567, 0.053472169112732136, -0.12000848639120416, 0.019929641298381838, -0.04096373572673013, -0.16519733188991867, -0.073302766376334, 0.35323023786995467, -0.20820974650872281, -0.2826964964681282, 0.12836669689532731, -0.36364977007232063, -0.20188910863930132, 0.23401007456023518, -0.056600887818182476, 0.00066598960505117, 0.07510190402589194, 0.039042245454677355, -0.07447394320355137, -0.2289725867349927, 0.3965424889834916, -0.08373356244822101, 0.22736302190800992, 0.09969790775056292, 0.1334898506586508, -0.01754816651071717, -0.02758393227690604, 0.048682572070236615, -0.22390816756612877, 0.12059447118194729, 0.2171898495587634, 0.07990874918518452, 0.25844097237397984, -0.42195782937654636, -0.20576565871696648, 0.11026953653682296, 0.11503919452519679, 0.11855947898655403, -0.09527795130057579, -0.19603065810189013, 0.1071672448888421, -0.14105588131834093, -0.14560417360739736, 0.04058188783777196, -0.003096380293732736, 0.041921622415141364, -0.15946353045178624, 0.0491092637544725, 0.09618987538283919, 0.03308308599289597, -0.10520046896573793, -0.13247851711675163, 0.006821205135344005, 0.05195811742394254, 0.13188046103388798, 0.06480044862482606, 0.0031021109373286, -0.05317589685479861, -0.10962749791626887, 0.31055232809811106, -0.10203359010288628, -0.22714981073286475, 0.2542437338610975, -0.16629978001867307, -0.20070467081784113, 0.11170344961034816, 0.0928529811790213, 0.14285505499418188, -0.09231106512157655, 0.11237918455920341, -0.05278803684135399, 0.19574991663599886, 0.14614043815243172, -0.0013048320486233002, 0.14885450015980295, 0.1366912972227466, 0.10156106403688105, 0.11239166866147482, -0.03197578474220524, -0.10269694134774732, -0.36972324713701155, -0.14328086049091526, -0.16517376742984463, 0.04010813687814445, -0.17020872245484497, -0.17777593279393708, 0.3732520758242505, 0.1107615958217804, 0.15326867861355223, 0.11646080475936575, 0.2537939837883885, 0.07749014929300402, 0.006540210315639653, 0.16955867509652928, 0.2462147263492026, 0.07710464403214978, 0.09175550374316006, -0.11546309896966261, -0.007787879405929367, 0.15855009992402502]
|
1,803.04831
|
Independently Recurrent Neural Network (IndRNN): Building A Longer and
Deeper RNN
|
Recurrent neural networks (RNNs) have been widely used for processing
sequential data. However, RNNs are commonly difficult to train due to the
well-known gradient vanishing and exploding problems and hard to learn
long-term patterns. Long short-term memory (LSTM) and gated recurrent unit
(GRU) were developed to address these problems, but the use of hyperbolic
tangent and the sigmoid action functions results in gradient decay over layers.
Consequently, construction of an efficiently trainable deep network is
challenging. In addition, all the neurons in an RNN layer are entangled
together and their behaviour is hard to interpret. To address these problems, a
new type of RNN, referred to as independently recurrent neural network
(IndRNN), is proposed in this paper, where neurons in the same layer are
independent of each other and they are connected across layers. We have shown
that an IndRNN can be easily regulated to prevent the gradient exploding and
vanishing problems while allowing the network to learn long-term dependencies.
Moreover, an IndRNN can work with non-saturated activation functions such as
relu (rectified linear unit) and be still trained robustly. Multiple IndRNNs
can be stacked to construct a network that is deeper than the existing RNNs.
Experimental results have shown that the proposed IndRNN is able to process
very long sequences (over 5000 time steps), can be used to construct very deep
networks (21 layers used in the experiment) and still be trained robustly.
Better performances have been achieved on various tasks by using IndRNNs
compared with the traditional RNN and LSTM. The code is available at
https://github.com/Sunnydreamrain/IndRNN_Theano_Lasagne.
|
cs.CV cs.LG
|
recurrent neural networks rnns have been widely used for processing sequential data however rnns are commonly difficult to train due to the wellknown gradient vanishing and exploding problems and hard to learn longterm patterns long shortterm memory lstm and gated recurrent unit gru were developed to address these problems but the use of hyperbolic tangent and the sigmoid action functions results in gradient decay over layers consequently construction of an efficiently trainable deep network is challenging in addition all the neurons in an rnn layer are entangled together and their behaviour is hard to interpret to address these problems a new type of rnn referred to as independently recurrent neural network indrnn is proposed in this paper where neurons in the same layer are independent of each other and they are connected across layers we have shown that an indrnn can be easily regulated to prevent the gradient exploding and vanishing problems while allowing the network to learn longterm dependencies moreover an indrnn can work with nonsaturated activation functions such as relu rectified linear unit and be still trained robustly multiple indrnns can be stacked to construct a network that is deeper than the existing rnns experimental results have shown that the proposed indrnn is able to process very long sequences over 5000 time steps can be used to construct very deep networks 21 layers used in the experiment and still be trained robustly better performances have been achieved on various tasks by using indrnns compared with the traditional rnn and lstm the code is available at httpsgithubcomsunnydreamrainindrnn_theano_lasagne
|
[['recurrent', 'neural', 'networks', 'rnns', 'have', 'been', 'widely', 'used', 'for', 'processing', 'sequential', 'data', 'however', 'rnns', 'are', 'commonly', 'difficult', 'to', 'train', 'due', 'to', 'the', 'wellknown', 'gradient', 'vanishing', 'and', 'exploding', 'problems', 'and', 'hard', 'to', 'learn', 'longterm', 'patterns', 'long', 'shortterm', 'memory', 'lstm', 'and', 'gated', 'recurrent', 'unit', 'gru', 'were', 'developed', 'to', 'address', 'these', 'problems', 'but', 'the', 'use', 'of', 'hyperbolic', 'tangent', 'and', 'the', 'sigmoid', 'action', 'functions', 'results', 'in', 'gradient', 'decay', 'over', 'layers', 'consequently', 'construction', 'of', 'an', 'efficiently', 'trainable', 'deep', 'network', 'is', 'challenging', 'in', 'addition', 'all', 'the', 'neurons', 'in', 'an', 'rnn', 'layer', 'are', 'entangled', 'together', 'and', 'their', 'behaviour', 'is', 'hard', 'to', 'interpret', 'to', 'address', 'these', 'problems', 'a', 'new', 'type', 'of', 'rnn', 'referred', 'to', 'as', 'independently', 'recurrent', 'neural', 'network', 'indrnn', 'is', 'proposed', 'in', 'this', 'paper', 'where', 'neurons', 'in', 'the', 'same', 'layer', 'are', 'independent', 'of', 'each', 'other', 'and', 'they', 'are', 'connected', 'across', 'layers', 'we', 'have', 'shown', 'that', 'an', 'indrnn', 'can', 'be', 'easily', 'regulated', 'to', 'prevent', 'the', 'gradient', 'exploding', 'and', 'vanishing', 'problems', 'while', 'allowing', 'the', 'network', 'to', 'learn', 'longterm', 'dependencies', 'moreover', 'an', 'indrnn', 'can', 'work', 'with', 'nonsaturated', 'activation', 'functions', 'such', 'as', 'relu', 'rectified', 'linear', 'unit', 'and', 'be', 'still', 'trained', 'robustly', 'multiple', 'indrnns', 'can', 'be', 'stacked', 'to', 'construct', 'a', 'network', 'that', 'is', 'deeper', 'than', 'the', 'existing', 'rnns', 'experimental', 'results', 'have', 'shown', 'that', 'the', 'proposed', 'indrnn', 'is', 'able', 'to', 'process', 'very', 'long', 'sequences', 'over', '5000', 'time', 'steps', 'can', 'be', 'used', 'to', 'construct', 'very', 'deep', 'networks', '21', 'layers', 'used', 'in', 'the', 'experiment', 'and', 'still', 'be', 'trained', 'robustly', 'better', 'performances', 'have', 'been', 'achieved', 'on', 'various', 'tasks', 'by', 'using', 'indrnns', 'compared', 'with', 'the', 'traditional', 'rnn', 'and', 'lstm', 'the', 'code', 'is', 'available', 'at', 'httpsgithubcomsunnydreamrainindrnn_theano_lasagne']]
|
[-0.03709154282422627, 0.060125094569315585, -0.023344716197792804, 0.10043868498820908, -0.0998813208210848, -0.21860812123609233, -0.010886010938944916, 0.5109944168770431, -0.34737865937800677, -0.28992121350568006, 0.11016330428275407, -0.2505424354645405, -0.2076166758747479, 0.1926332604582878, -0.11487943283921363, 0.11542374804323795, 0.10849185294846037, 0.03980850051431095, -0.03175643200520426, -0.32061181955733425, 0.2541161329175035, 0.05851516427504191, 0.29798877645083066, -3.998076141464944e-05, 0.12297005699576545, -0.09777138100790919, 0.007549660145213791, -0.005315639642889009, -0.008972770996892816, 0.13133610666172543, 0.30606167983610694, 0.10070367621337223, 0.3011116015697446, -0.5177927144310054, -0.2827012868797836, 0.10450328145650964, 0.17212594027594463, 0.06997142308391631, 0.05591801499957036, -0.26451621246980683, 0.15104544758066243, -0.16240959174876266, 0.014960925534878875, -0.14342974380170012, -0.021522157442043808, 0.047697551941782164, -0.2807187988587162, 0.022610319242356163, 0.07067473805144284, -0.003076210844629517, -0.03823886776123853, -0.0906363605635752, -0.009415181142314539, 0.18446012345489626, 0.04281243837481894, 0.09917932750438066, 0.1046031076241942, -0.13809627527279741, -0.12614450777205183, 0.29451048696121457, -0.08131827102162574, -0.21826686444235782, 0.21869318051373257, -0.019169226121705244, -0.13576652751413776, 0.0802190846863988, 0.22924774977214196, 0.11228611619558697, -0.1970055148325057, -0.01589012951909692, -0.037611103638568344, 0.18660430038055661, 0.06501992616583319, 0.007081327513179869, 0.18921333072688795, 0.23288138258207006, 0.011025920119501797, 0.14687291014843676, -0.12797026854720625, -0.09013226463587261, -0.17159272686500723, -0.07589763306987508, -0.16408737562094614, 0.02080896092834426, -0.07143784814329325, -0.15044934125468773, 0.40257450480324525, 0.1741812410393465, 0.24917727066569176, 0.13308998114491047, 0.28768351967720424, 0.07719001410296186, 0.21168490680911597, 0.11669524169947003, 0.21303132571754793, 0.09586380939273273, 0.14691168239805846, -0.14151360011093464, 0.1193234614379631, 0.03942861955466808]
|
1,803.04832
|
An Efficient Human Visual System Based Quality Metric for 3D Video
|
Stereoscopic video technologies have been introduced to the consumer market
in the past few years. A key factor in designing a 3D system is to understand
how different visual cues and distortions affect the perceptual quality of
stereoscopic video. The ultimate way to assess 3D video quality is through
subjective tests. However, subjective evaluation is time consuming, expensive,
and in some cases not possible. The other solution is developing objective
quality metrics, which attempt to model the Human Visual System (HVS) in order
to assess perceptual quality. Although several 2D quality metrics have been
proposed for still images and videos, in the case of 3D efforts are only at the
initial stages. In this paper, we propose a new full-reference quality metric
for 3D content. Our method mimics HVS by fusing information of both the left
and right views to construct the cyclopean view, as well as taking to account
the sensitivity of HVS to contrast and the disparity of the views. In addition,
a temporal pooling strategy is utilized to address the effect of temporal
variations of the quality in the video. Performance evaluations showed that our
3D quality metric quantifies quality degradation caused by several
representative types of distortions very accurately, with Pearson correlation
coefficient of 90.8 %, a competitive performance compared to the
state-of-the-art 3D quality metrics.
|
eess.IV
|
stereoscopic video technologies have been introduced to the consumer market in the past few years a key factor in designing a 3d system is to understand how different visual cues and distortions affect the perceptual quality of stereoscopic video the ultimate way to assess 3d video quality is through subjective tests however subjective evaluation is time consuming expensive and in some cases not possible the other solution is developing objective quality metrics which attempt to model the human visual system hvs in order to assess perceptual quality although several 2d quality metrics have been proposed for still images and videos in the case of 3d efforts are only at the initial stages in this paper we propose a new fullreference quality metric for 3d content our method mimics hvs by fusing information of both the left and right views to construct the cyclopean view as well as taking to account the sensitivity of hvs to contrast and the disparity of the views in addition a temporal pooling strategy is utilized to address the effect of temporal variations of the quality in the video performance evaluations showed that our 3d quality metric quantifies quality degradation caused by several representative types of distortions very accurately with pearson correlation coefficient of 908 a competitive performance compared to the stateoftheart 3d quality metrics
|
[['stereoscopic', 'video', 'technologies', 'have', 'been', 'introduced', 'to', 'the', 'consumer', 'market', 'in', 'the', 'past', 'few', 'years', 'a', 'key', 'factor', 'in', 'designing', 'a', '3d', 'system', 'is', 'to', 'understand', 'how', 'different', 'visual', 'cues', 'and', 'distortions', 'affect', 'the', 'perceptual', 'quality', 'of', 'stereoscopic', 'video', 'the', 'ultimate', 'way', 'to', 'assess', '3d', 'video', 'quality', 'is', 'through', 'subjective', 'tests', 'however', 'subjective', 'evaluation', 'is', 'time', 'consuming', 'expensive', 'and', 'in', 'some', 'cases', 'not', 'possible', 'the', 'other', 'solution', 'is', 'developing', 'objective', 'quality', 'metrics', 'which', 'attempt', 'to', 'model', 'the', 'human', 'visual', 'system', 'hvs', 'in', 'order', 'to', 'assess', 'perceptual', 'quality', 'although', 'several', '2d', 'quality', 'metrics', 'have', 'been', 'proposed', 'for', 'still', 'images', 'and', 'videos', 'in', 'the', 'case', 'of', '3d', 'efforts', 'are', 'only', 'at', 'the', 'initial', 'stages', 'in', 'this', 'paper', 'we', 'propose', 'a', 'new', 'fullreference', 'quality', 'metric', 'for', '3d', 'content', 'our', 'method', 'mimics', 'hvs', 'by', 'fusing', 'information', 'of', 'both', 'the', 'left', 'and', 'right', 'views', 'to', 'construct', 'the', 'cyclopean', 'view', 'as', 'well', 'as', 'taking', 'to', 'account', 'the', 'sensitivity', 'of', 'hvs', 'to', 'contrast', 'and', 'the', 'disparity', 'of', 'the', 'views', 'in', 'addition', 'a', 'temporal', 'pooling', 'strategy', 'is', 'utilized', 'to', 'address', 'the', 'effect', 'of', 'temporal', 'variations', 'of', 'the', 'quality', 'in', 'the', 'video', 'performance', 'evaluations', 'showed', 'that', 'our', '3d', 'quality', 'metric', 'quantifies', 'quality', 'degradation', 'caused', 'by', 'several', 'representative', 'types', 'of', 'distortions', 'very', 'accurately', 'with', 'pearson', 'correlation', 'coefficient', 'of', '908', 'a', 'competitive', 'performance', 'compared', 'to', 'the', 'stateoftheart', '3d', 'quality', 'metrics']]
|
[-0.05830301161532261, -0.014299182726291422, -0.06471117355831002, 0.05570819692209907, -0.086693798492585, -0.11284095146289291, -0.0095332258218287, 0.45794636424477786, -0.22126385266998927, -0.37447219381117386, 0.07040132498703515, -0.2918971705688461, -0.17214160361624914, 0.16315498836625572, -0.19666321611363594, 0.11570610262912838, 0.10494866679299232, 0.048245354212148615, -0.07567160302421214, -0.30567072663609296, 0.28733797401513766, 0.09576629058428143, 0.3679364197185799, 0.03389302995715069, 0.10949295581707552, -0.06504115744570449, -0.057161861192860285, 0.051556716206077616, -0.07444182765414566, 0.14637207284226342, 0.2833480303214021, 0.19112200536828947, 0.3258282229406376, -0.3950959379916594, -0.23407365044485354, 0.030876119208793778, 0.13751294300466196, 0.04499955031091611, -0.055107399523598416, -0.3395396549601244, 0.09577671366161135, -0.1495064199651213, -0.010333611895691722, -0.11474416491343771, -0.01390684169523639, -0.03017397871141037, -0.2795112108212117, 0.05634115339303602, 0.006879948813693607, 0.06775667268536202, -0.06473286076954919, -0.06528694033899161, 0.011215107967294583, 0.26253406077274655, 0.08799829750351573, 0.0685945589932056, 0.11956879049305673, -0.21096574389253483, -0.11257883604827494, 0.45086054492860894, -0.046812082626739915, -0.23448096555508843, 0.19813361830294948, -0.10121002039748785, -0.0988591998224423, 0.13299204016180888, 0.21327903895579348, 0.09072218287829735, -0.17390621497325565, -0.02667789768611536, 0.013413596562360791, 0.21229269968828965, 0.08221670612480202, 0.0657276363435231, 0.19662450822112768, 0.2138604602264028, 0.013277036977770258, 0.11311281245168868, -0.1227189863343047, -0.03133467133247323, -0.18203459489882232, -0.15345868385358624, -0.16297480524368754, -0.0058949287462773305, -0.10630673572991721, -0.13678753299087915, 0.4333568969294939, 0.22780084763717365, 0.18896970518845554, 0.0469064936429883, 0.3915534734898183, 0.010290349510468576, 0.05776371216171817, 0.011669021729192777, 0.2360596195588656, -0.03275473070007719, 0.15651777072184503, -0.18330094258653928, 0.1216277252993287, 0.06493003259319387]
|
1,803.04833
|
SPH simulations of structures in protoplanetary disks
|
The hydrodynamic models of the protoplanetary disk, which perturbed by the
embeded low-mass companion, were calculated by our modification of GADGET-2
code. The cases of circular and eccentric orbits which can be coplanar or
slightly inclined to the disk midplane were considered. The column density of
test particles on the line of sight between the central star and observer was
computed during the simulations. Then the column density of the circumstellar
dust was calculated under the assumption that the dust and gas are well mixed
with a mass ratio 1 : 100. To research the influence of the disk orientation
relative to the observer on the circumstellar extinction the calculations were
made for four angles of inclination of the line of sight to the disk midplane
and eight directions along the azimuth. The column density in the circumstellar
and circumbinary disk were computed separately. The calculations have shown the
periodic variations of column density can arise both in the circumstellar and
circumbinary disks. The amplitude and shape of the variation strongly depend on
the parameters of the simulated system (eccentricity and inclination of the
orbit, the mass ratio of the companion and star) and its orientation in space.
The results of our simulations can be used to explain the cyclic variation of
the brightness of young UX Ori type stars.
|
astro-ph.SR astro-ph.EP
|
the hydrodynamic models of the protoplanetary disk which perturbed by the embeded lowmass companion were calculated by our modification of gadget2 code the cases of circular and eccentric orbits which can be coplanar or slightly inclined to the disk midplane were considered the column density of test particles on the line of sight between the central star and observer was computed during the simulations then the column density of the circumstellar dust was calculated under the assumption that the dust and gas are well mixed with a mass ratio 1 100 to research the influence of the disk orientation relative to the observer on the circumstellar extinction the calculations were made for four angles of inclination of the line of sight to the disk midplane and eight directions along the azimuth the column density in the circumstellar and circumbinary disk were computed separately the calculations have shown the periodic variations of column density can arise both in the circumstellar and circumbinary disks the amplitude and shape of the variation strongly depend on the parameters of the simulated system eccentricity and inclination of the orbit the mass ratio of the companion and star and its orientation in space the results of our simulations can be used to explain the cyclic variation of the brightness of young ux ori type stars
|
[['the', 'hydrodynamic', 'models', 'of', 'the', 'protoplanetary', 'disk', 'which', 'perturbed', 'by', 'the', 'embeded', 'lowmass', 'companion', 'were', 'calculated', 'by', 'our', 'modification', 'of', 'gadget2', 'code', 'the', 'cases', 'of', 'circular', 'and', 'eccentric', 'orbits', 'which', 'can', 'be', 'coplanar', 'or', 'slightly', 'inclined', 'to', 'the', 'disk', 'midplane', 'were', 'considered', 'the', 'column', 'density', 'of', 'test', 'particles', 'on', 'the', 'line', 'of', 'sight', 'between', 'the', 'central', 'star', 'and', 'observer', 'was', 'computed', 'during', 'the', 'simulations', 'then', 'the', 'column', 'density', 'of', 'the', 'circumstellar', 'dust', 'was', 'calculated', 'under', 'the', 'assumption', 'that', 'the', 'dust', 'and', 'gas', 'are', 'well', 'mixed', 'with', 'a', 'mass', 'ratio', '1', '100', 'to', 'research', 'the', 'influence', 'of', 'the', 'disk', 'orientation', 'relative', 'to', 'the', 'observer', 'on', 'the', 'circumstellar', 'extinction', 'the', 'calculations', 'were', 'made', 'for', 'four', 'angles', 'of', 'inclination', 'of', 'the', 'line', 'of', 'sight', 'to', 'the', 'disk', 'midplane', 'and', 'eight', 'directions', 'along', 'the', 'azimuth', 'the', 'column', 'density', 'in', 'the', 'circumstellar', 'and', 'circumbinary', 'disk', 'were', 'computed', 'separately', 'the', 'calculations', 'have', 'shown', 'the', 'periodic', 'variations', 'of', 'column', 'density', 'can', 'arise', 'both', 'in', 'the', 'circumstellar', 'and', 'circumbinary', 'disks', 'the', 'amplitude', 'and', 'shape', 'of', 'the', 'variation', 'strongly', 'depend', 'on', 'the', 'parameters', 'of', 'the', 'simulated', 'system', 'eccentricity', 'and', 'inclination', 'of', 'the', 'orbit', 'the', 'mass', 'ratio', 'of', 'the', 'companion', 'and', 'star', 'and', 'its', 'orientation', 'in', 'space', 'the', 'results', 'of', 'our', 'simulations', 'can', 'be', 'used', 'to', 'explain', 'the', 'cyclic', 'variation', 'of', 'the', 'brightness', 'of', 'young', 'ux', 'ori', 'type', 'stars']]
|
[-0.10931119009119897, 0.10231421665675496, -0.05200411216887437, 0.01805926160355307, -0.04699044967427442, -0.034461370252549105, -0.01627695244167119, 0.42019501316135743, -0.22054868834263316, -0.3238131805688789, 0.08570621299201762, -0.23927469214756195, -0.032868701897638096, 0.14361708661962352, -0.037005905342632775, 0.054899420709079175, 0.06508793627426504, -0.05314994169044049, -0.08609376685506745, -0.26337050066061624, 0.32567324424077454, 0.09271297739503999, 0.09493092444861419, 0.007646693897775915, 0.033289611864766984, -0.06276908227599749, -0.05804740226950888, -0.009038861460960695, -0.17590165181265804, 0.06316857744267712, 0.1600558158808706, 0.10398915382612446, 0.15198495625794683, -0.40355755042148644, -0.21152991943325014, 0.012750461714588887, 0.1368665400165299, 0.03353312931482821, -0.002265262667867929, -0.26464050777945414, 0.07081127550121244, -0.18121539530467634, -0.20108589924208514, 0.07620312692491193, 0.06908377590397857, 0.062352452199633944, -0.2524328080078238, 0.08375993463132088, 0.06215576443478458, 0.07997484689042318, -0.12293812501845992, -0.12363439388137276, -0.11714514236807926, 0.08542559087301975, 0.07749453906212257, 0.06473747667214369, 0.23977506163712914, -0.10742525413598372, -0.009645244869994655, 0.40860896378109174, -0.10154799667195541, -0.13055546634477566, 0.21140010371276913, -0.2326777927836905, -0.09962617742220901, 0.1692625330761075, 0.18445832188747244, 0.13550848191812395, -0.09431989605593831, 0.0199350121066391, -0.06336307402946838, 0.19041774683040844, 0.09538507487701431, -0.009893506171594301, 0.3562207320403652, 0.03589614557918824, 0.0026572048977723337, 0.11300136200811493, -0.2604300545381816, -0.09650659963348243, -0.2104885947367508, -0.12618043095077555, -0.15259272908392155, 0.020700712260879474, -0.15973168583180156, -0.13389369307899715, 0.3693855969324606, 0.09854377389217825, 0.23890407761074092, 0.007415488877941825, 0.30290076652005926, 0.1062971497194833, 0.08058908113733479, 0.12337198620449462, 0.33461519118215566, 0.193312290995318, 0.08073899631503306, -0.28767136792167514, 0.13349234026997056, 0.0081790752972574]
|
1,803.04834
|
Integration with respect to the non-commutative fractional Brownian
motion
|
We study the issue of integration with respect to the non-commutative
fractional Brownian motion, that is the analog of the standard fractional
Brownian in a non-commutative probability setting.When the Hurst index $H$ of
the process is stricly larger than $1/2$, integration can be handled through
the so-called Young procedure. The situation where $H=1/2$ corresponds to the
specific free case, for which an It{\^o}-type approach is known to be
possible.When $H<1/2$, rough-path-type techniques must come into the picture,
which, from a theoretical point of view, involves the use of some
a-priori-defined L{\'e}vy area process. We show that such an object can indeed
be \enquote{canonically} constructed for any $H\in (\frac14,\frac12)$. Finally,
when $H\leq 1/4$, we exhibit a similar non-convergence phenomenon as for the
non-diagonal entries of the (classical) L{\'e}vy area above the standard
fractional Brownian.
|
math.PR math.OA
|
we study the issue of integration with respect to the noncommutative fractional brownian motion that is the analog of the standard fractional brownian in a noncommutative probability settingwhen the hurst index h of the process is stricly larger than 12 integration can be handled through the socalled young procedure the situation where h12 corresponds to the specific free case for which an itotype approach is known to be possiblewhen h12 roughpathtype techniques must come into the picture which from a theoretical point of view involves the use of some aprioridefined levy area process we show that such an object can indeed be enquotecanonically constructed for any hin frac14frac12 finally when hleq 14 we exhibit a similar nonconvergence phenomenon as for the nondiagonal entries of the classical levy area above the standard fractional brownian
|
[['we', 'study', 'the', 'issue', 'of', 'integration', 'with', 'respect', 'to', 'the', 'noncommutative', 'fractional', 'brownian', 'motion', 'that', 'is', 'the', 'analog', 'of', 'the', 'standard', 'fractional', 'brownian', 'in', 'a', 'noncommutative', 'probability', 'settingwhen', 'the', 'hurst', 'index', 'h', 'of', 'the', 'process', 'is', 'stricly', 'larger', 'than', '12', 'integration', 'can', 'be', 'handled', 'through', 'the', 'socalled', 'young', 'procedure', 'the', 'situation', 'where', 'h12', 'corresponds', 'to', 'the', 'specific', 'free', 'case', 'for', 'which', 'an', 'itotype', 'approach', 'is', 'known', 'to', 'be', 'possiblewhen', 'h12', 'roughpathtype', 'techniques', 'must', 'come', 'into', 'the', 'picture', 'which', 'from', 'a', 'theoretical', 'point', 'of', 'view', 'involves', 'the', 'use', 'of', 'some', 'aprioridefined', 'levy', 'area', 'process', 'we', 'show', 'that', 'such', 'an', 'object', 'can', 'indeed', 'be', 'enquotecanonically', 'constructed', 'for', 'any', 'hin', 'frac14frac12', 'finally', 'when', 'hleq', '14', 'we', 'exhibit', 'a', 'similar', 'nonconvergence', 'phenomenon', 'as', 'for', 'the', 'nondiagonal', 'entries', 'of', 'the', 'classical', 'levy', 'area', 'above', 'the', 'standard', 'fractional', 'brownian']]
|
[-0.06305794693616917, 0.1312164341454718, -0.0823285451369884, 0.07060588647541977, -0.08266929105957388, -0.12835307949353592, 0.021405051826150157, 0.367730870782907, -0.30503789897920797, -0.26695955855257125, 0.13531148934271187, -0.2673645115282852, -0.154542737718657, 0.23036126079387031, -0.14528875364885607, 0.03800623597271624, 0.01969505909801228, 0.058301134646171704, -0.03159426489946782, -0.1960335567855509, 0.2953996434007422, 0.0045400124756724836, 0.18528536066878587, -0.045540761461779766, 0.09014728609326994, -0.015039701220302959, -0.05236703465197934, 0.02800033293897286, -0.16164050913414485, 0.09775527713645715, 0.18175781575519068, 0.03154725164131378, 0.29494845515000634, -0.35712777709704824, -0.20254425009989063, 0.15623500617675745, 0.1466385980893392, 0.05062602433281427, -0.007077576199662872, -0.29650320822656795, 0.0919713461662468, -0.1629790892220626, -0.1769153413697495, -0.028451248952478636, 0.0448864853970008, 0.002618871874801698, -0.2931985582690686, 0.09258796355607046, 0.11066715847482556, 0.010930653232207987, -0.03256520659851958, -0.11835070904089662, 0.00900631176045863, 0.09823872540005141, 0.03942470449646862, 0.030887465642081224, 0.13736935431006714, -0.10777880589012057, -0.16162786750646774, 0.3690882693626918, -0.07149563749328536, -0.25725312011707047, 0.13778383063254296, -0.18843287765048444, -0.140563377939543, 0.14373904198873788, 0.10388593654897704, 0.11048695573481382, -0.15209882342480796, 0.13837058622902987, -0.04550718234531814, 0.14308864403869848, 0.052604628283006605, -0.003614100327467895, 0.1514342252339702, 0.13487717565840285, 0.12638852388772648, 0.15974946489677677, -0.10888752470737018, -0.1607881697054836, -0.34326971939299256, -0.21690775094612036, -0.20185380101065675, 0.112647298079537, -0.14520346591507405, -0.16861511653405614, 0.31174889249086846, 0.1381075726309291, 0.18937935544818174, 0.05139646479256044, 0.20271049581060652, 0.2055960329298614, 0.03151887827334576, 0.0284333211880039, 0.1651740486943254, 0.09998648783255248, 0.0990879025994218, -0.15425097758316042, 0.027928271003474947, 0.07761460410984]
|
1,803.04835
|
Unlikely intersections in semi-abelian surfaces
|
We consider a family, depending on a parameter, of multiplicative extensions
of an elliptic curve with complex multiplications. They form a 3-dimensional
variety $G$ which admits a dense set of special curves, known as Ribet curves,
which strictly contains the torsion curves. We show that an irreducible curve
$W$ in $G$ meets this set Zariski-densely only if $W$ lies in a fiber of the
family or is a translate of a Ribet curve by a multiplicative section. We
further deduce from this result a proof of the Zilber-Pink conjecture (over
number fields) for the mixed Shimura variety attached to the threefold $G$,
when the parameter space is the universal one.
|
math.NT
|
we consider a family depending on a parameter of multiplicative extensions of an elliptic curve with complex multiplications they form a 3dimensional variety g which admits a dense set of special curves known as ribet curves which strictly contains the torsion curves we show that an irreducible curve w in g meets this set zariskidensely only if w lies in a fiber of the family or is a translate of a ribet curve by a multiplicative section we further deduce from this result a proof of the zilberpink conjecture over number fields for the mixed shimura variety attached to the threefold g when the parameter space is the universal one
|
[['we', 'consider', 'a', 'family', 'depending', 'on', 'a', 'parameter', 'of', 'multiplicative', 'extensions', 'of', 'an', 'elliptic', 'curve', 'with', 'complex', 'multiplications', 'they', 'form', 'a', '3dimensional', 'variety', 'g', 'which', 'admits', 'a', 'dense', 'set', 'of', 'special', 'curves', 'known', 'as', 'ribet', 'curves', 'which', 'strictly', 'contains', 'the', 'torsion', 'curves', 'we', 'show', 'that', 'an', 'irreducible', 'curve', 'w', 'in', 'g', 'meets', 'this', 'set', 'zariskidensely', 'only', 'if', 'w', 'lies', 'in', 'a', 'fiber', 'of', 'the', 'family', 'or', 'is', 'a', 'translate', 'of', 'a', 'ribet', 'curve', 'by', 'a', 'multiplicative', 'section', 'we', 'further', 'deduce', 'from', 'this', 'result', 'a', 'proof', 'of', 'the', 'zilberpink', 'conjecture', 'over', 'number', 'fields', 'for', 'the', 'mixed', 'shimura', 'variety', 'attached', 'to', 'the', 'threefold', 'g', 'when', 'the', 'parameter', 'space', 'is', 'the', 'universal', 'one']]
|
[-0.21557540878004164, 0.06865652604856307, -0.12018103783078697, 0.004161370388411601, -0.11893126351434156, -0.13744677939460775, 0.03452557973604256, 0.3146466518487405, -0.3150692744129295, -0.22699698313660577, 0.08101850007489803, -0.22990908705279095, -0.14587498939630295, 0.2911060199017611, -0.1501087464067504, -0.029303833662848406, 0.06949802782651412, 0.10743201672475478, -0.07335157248452134, -0.3173955994072891, 0.39309729885207406, -0.11291468453619184, 0.18646436246163253, 0.013822799527146127, 0.12010529027277723, 0.03490367798784047, 0.039406480058309955, -0.019176498589740316, -0.15061831149015492, 0.13217999374305983, 0.25564244765480726, 0.08487417432265955, 0.2035139917883031, -0.29976551091178844, -0.21825942536602394, 0.22995789865685473, 0.06437861186306958, 0.03749372426275198, -0.012885898123377797, -0.19514752755586673, 0.09340524390433838, -0.16090807178989053, -0.18837345699531907, -0.031165965886171394, 0.07461495848411027, 0.018640420634572934, -0.24831557067094046, -0.03664089773713244, 0.11753285816473323, 0.1028037933227414, 0.0005565430080398507, -0.10133006653979147, -0.0429174085713735, 0.006092823594605653, -0.012032457726682887, 0.09178590035565846, 0.0563889075190239, -0.14202765302509368, -0.060958126363335946, 0.39081404397772507, -0.10394299569872952, -0.1999669268427186, 0.10573297172545566, -0.13760402843509928, -0.14096460295328445, 0.17114005628182902, 0.14445502057868065, 0.13468357876430206, -0.044070423399808455, 0.1822811498844979, -0.14994345902285855, 0.14693386314026669, 0.08705778591710767, -0.04564593703733808, 0.1519106373301955, 0.0973064647432109, 0.07209576129776622, 0.13835259582398785, -0.02342288599161585, -0.008361802350968943, -0.4046358844487492, -0.20581414380085167, -0.12826924382307386, 0.15081227895106325, -0.10645988309721745, -0.20127510851026947, 0.4186700473671967, -0.012058797634181079, 0.24910896639296903, 0.08439054551380558, 0.21484391328904334, 0.08795173385595997, 0.04005464308664476, 0.08330117508489612, 0.1414142630782316, 0.17692783851936938, -0.061831926235954765, -0.129685143668871, -0.0022902043275705992, 0.12471118126782256]
|
1,803.04836
|
3D Video Quality Assessment
|
A key factor in designing 3D systems is to understand how different visual
cues and distortions affect the perceptual quality of 3D video. The ultimate
way to assess video quality is through subjective tests. However, subjective
evaluation is time consuming, expensive, and in most cases not even possible.
An alternative solution is objective quality metrics, which attempt to model
the Human Visual System (HVS) in order to assess the perceptual quality. The
potential of 3D technology to significantly improve the immersiveness of video
content has been hampered by the difficulty of objectively assessing Quality of
Experience (QoE). A no-reference (NR) objective 3D quality metric, which could
help determine capturing parameters and improve playback perceptual quality,
would be welcomed by camera and display manufactures. Network providers would
embrace a full-reference (FR) 3D quality metric, as they could use it to ensure
efficient QoE-based resource management during compression and Quality of
Service (QoS) during transmission.
|
cs.CV
|
a key factor in designing 3d systems is to understand how different visual cues and distortions affect the perceptual quality of 3d video the ultimate way to assess video quality is through subjective tests however subjective evaluation is time consuming expensive and in most cases not even possible an alternative solution is objective quality metrics which attempt to model the human visual system hvs in order to assess the perceptual quality the potential of 3d technology to significantly improve the immersiveness of video content has been hampered by the difficulty of objectively assessing quality of experience qoe a noreference nr objective 3d quality metric which could help determine capturing parameters and improve playback perceptual quality would be welcomed by camera and display manufactures network providers would embrace a fullreference fr 3d quality metric as they could use it to ensure efficient qoebased resource management during compression and quality of service qos during transmission
|
[['a', 'key', 'factor', 'in', 'designing', '3d', 'systems', 'is', 'to', 'understand', 'how', 'different', 'visual', 'cues', 'and', 'distortions', 'affect', 'the', 'perceptual', 'quality', 'of', '3d', 'video', 'the', 'ultimate', 'way', 'to', 'assess', 'video', 'quality', 'is', 'through', 'subjective', 'tests', 'however', 'subjective', 'evaluation', 'is', 'time', 'consuming', 'expensive', 'and', 'in', 'most', 'cases', 'not', 'even', 'possible', 'an', 'alternative', 'solution', 'is', 'objective', 'quality', 'metrics', 'which', 'attempt', 'to', 'model', 'the', 'human', 'visual', 'system', 'hvs', 'in', 'order', 'to', 'assess', 'the', 'perceptual', 'quality', 'the', 'potential', 'of', '3d', 'technology', 'to', 'significantly', 'improve', 'the', 'immersiveness', 'of', 'video', 'content', 'has', 'been', 'hampered', 'by', 'the', 'difficulty', 'of', 'objectively', 'assessing', 'quality', 'of', 'experience', 'qoe', 'a', 'noreference', 'nr', 'objective', '3d', 'quality', 'metric', 'which', 'could', 'help', 'determine', 'capturing', 'parameters', 'and', 'improve', 'playback', 'perceptual', 'quality', 'would', 'be', 'welcomed', 'by', 'camera', 'and', 'display', 'manufactures', 'network', 'providers', 'would', 'embrace', 'a', 'fullreference', 'fr', '3d', 'quality', 'metric', 'as', 'they', 'could', 'use', 'it', 'to', 'ensure', 'efficient', 'qoebased', 'resource', 'management', 'during', 'compression', 'and', 'quality', 'of', 'service', 'qos', 'during', 'transmission']]
|
[-0.09102089801116993, -0.02696089220214497, -0.07420104816207497, 0.07823731629239199, -0.14592107156376619, -0.14928379614292153, 0.030700573011448507, 0.47215221008579983, -0.20813928525029424, -0.3941749649269408, 0.06368652873252838, -0.2499435086685576, -0.1734825971790614, 0.14628696009535097, -0.24540176778033415, 0.14098677625588607, 0.09743275077083749, 0.0373162495839336, -0.04412698398894128, -0.3105677769543897, 0.2665515293100677, 0.13996946366234242, 0.41635580049018917, 0.0581980738329309, 0.047769483722636084, -0.04785136221969304, -0.05917770046079041, 0.005369505249231416, -0.07703533402251962, 0.13266402270681665, 0.33901099494266274, 0.27108831245200954, 0.3473589121621396, -0.42555525830309643, -0.23884232546276363, 0.043509516125069286, 0.16077709631798298, 0.013179573561309985, -0.03503511227302768, -0.32924183865543455, 0.10705670229722991, -0.16633497246259235, -0.0291983899384688, -0.13826665160013363, -0.04172421942195414, -0.033107163872428874, -0.29740144532192253, 0.008335140800275104, -0.030535252882768156, 0.045377121028171756, -0.06972473358435213, -0.024186929910731698, 0.007701844381364553, 0.28708650686741366, 0.07050564871430029, 0.10282714911246378, 0.17791640703561776, -0.2307963563588074, -0.08838602180032085, 0.49127181014046073, -0.013280773515074734, -0.24739347964580366, 0.20104322776713066, -0.05805443470231503, -0.08333153345340275, 0.14283619164856837, 0.2449504132198758, 0.04084143930384399, -0.19323626730444007, -0.03496427713521131, 0.09188804027967547, 0.23918233819820575, 0.09297130635815465, 0.08522034528371143, 0.22640717866536425, 0.21412576486258522, 0.02906122845275891, 0.09258362497616633, -0.0361593712709452, 0.006370534804438266, -0.14957947196824917, -0.1766261962364201, -0.18224129046154158, 0.013819269620063622, -0.12960015791481724, -0.13956241048014673, 0.38697141577722505, 0.2312541302587641, 0.12411145903905363, 0.03732204030108589, 0.4188221208873744, 0.027791784539371485, 0.05972109308257993, 0.013199657704190989, 0.22566783723825784, -0.08424620154332124, 0.1557955459942796, -0.18886594250675684, 0.16973339554878245, 0.05704621415995797]
|
1,803.04837
|
Learning the Joint Representation of Heterogeneous Temporal Events for
Clinical Endpoint Prediction
|
The availability of a large amount of electronic health records (EHR)
provides huge opportunities to improve health care service by mining these
data. One important application is clinical endpoint prediction, which aims to
predict whether a disease, a symptom or an abnormal lab test will happen in the
future according to patients' history records. This paper develops deep
learning techniques for clinical endpoint prediction, which are effective in
many practical applications. However, the problem is very challenging since
patients' history records contain multiple heterogeneous temporal events such
as lab tests, diagnosis, and drug administrations. The visiting patterns of
different types of events vary significantly, and there exist complex nonlinear
relationships between different events. In this paper, we propose a novel model
for learning the joint representation of heterogeneous temporal events. The
model adds a new gate to control the visiting rates of different events which
effectively models the irregular patterns of different events and their
nonlinear correlations. Experiment results with real-world clinical data on the
tasks of predicting death and abnormal lab tests prove the effectiveness of our
proposed approach over competitive baselines.
|
cs.AI cs.LG stat.ML
|
the availability of a large amount of electronic health records ehr provides huge opportunities to improve health care service by mining these data one important application is clinical endpoint prediction which aims to predict whether a disease a symptom or an abnormal lab test will happen in the future according to patients history records this paper develops deep learning techniques for clinical endpoint prediction which are effective in many practical applications however the problem is very challenging since patients history records contain multiple heterogeneous temporal events such as lab tests diagnosis and drug administrations the visiting patterns of different types of events vary significantly and there exist complex nonlinear relationships between different events in this paper we propose a novel model for learning the joint representation of heterogeneous temporal events the model adds a new gate to control the visiting rates of different events which effectively models the irregular patterns of different events and their nonlinear correlations experiment results with realworld clinical data on the tasks of predicting death and abnormal lab tests prove the effectiveness of our proposed approach over competitive baselines
|
[['the', 'availability', 'of', 'a', 'large', 'amount', 'of', 'electronic', 'health', 'records', 'ehr', 'provides', 'huge', 'opportunities', 'to', 'improve', 'health', 'care', 'service', 'by', 'mining', 'these', 'data', 'one', 'important', 'application', 'is', 'clinical', 'endpoint', 'prediction', 'which', 'aims', 'to', 'predict', 'whether', 'a', 'disease', 'a', 'symptom', 'or', 'an', 'abnormal', 'lab', 'test', 'will', 'happen', 'in', 'the', 'future', 'according', 'to', 'patients', 'history', 'records', 'this', 'paper', 'develops', 'deep', 'learning', 'techniques', 'for', 'clinical', 'endpoint', 'prediction', 'which', 'are', 'effective', 'in', 'many', 'practical', 'applications', 'however', 'the', 'problem', 'is', 'very', 'challenging', 'since', 'patients', 'history', 'records', 'contain', 'multiple', 'heterogeneous', 'temporal', 'events', 'such', 'as', 'lab', 'tests', 'diagnosis', 'and', 'drug', 'administrations', 'the', 'visiting', 'patterns', 'of', 'different', 'types', 'of', 'events', 'vary', 'significantly', 'and', 'there', 'exist', 'complex', 'nonlinear', 'relationships', 'between', 'different', 'events', 'in', 'this', 'paper', 'we', 'propose', 'a', 'novel', 'model', 'for', 'learning', 'the', 'joint', 'representation', 'of', 'heterogeneous', 'temporal', 'events', 'the', 'model', 'adds', 'a', 'new', 'gate', 'to', 'control', 'the', 'visiting', 'rates', 'of', 'different', 'events', 'which', 'effectively', 'models', 'the', 'irregular', 'patterns', 'of', 'different', 'events', 'and', 'their', 'nonlinear', 'correlations', 'experiment', 'results', 'with', 'realworld', 'clinical', 'data', 'on', 'the', 'tasks', 'of', 'predicting', 'death', 'and', 'abnormal', 'lab', 'tests', 'prove', 'the', 'effectiveness', 'of', 'our', 'proposed', 'approach', 'over', 'competitive', 'baselines']]
|
[-0.08453454966453296, 0.08077145262586037, -0.06938303845980373, 0.1235147711154216, -0.1095452205318693, -0.1547021327738757, 0.088216803628249, 0.37271947885960177, -0.24328794626549619, -0.34065628630144756, 0.10465175568290269, -0.32640019917982765, -0.17624598485672124, 0.21567451887346722, -0.12251143976079067, 0.07204335096897811, 0.1529392532882143, 0.05529906858990345, -0.023934710446409272, -0.28718672811353957, 0.2636835950889874, 0.04753806290221197, 0.38571955624820226, 0.04668961668481206, 0.09443867250785863, 0.019775137043802342, -0.0655816477835382, -0.028100766893325163, -0.04846968905617931, 0.13445122464867867, 0.40758087967555917, 0.2462399256265534, 0.3529916001952004, -0.44476060995251915, -0.24063044686323348, 0.11887888002204276, 0.1005218784538571, 0.08068659315407378, -0.049507140417970066, -0.3283807560152634, 0.055978446561128124, -0.17441755804726905, -0.06780468781549952, -0.085331591136265, 0.01703661677168041, 0.004034101476388999, -0.29985851504906114, 0.10445712766494943, -0.016541749574854724, 0.11938912371590815, -0.07254431085773017, -0.0856289664986976, 0.04519198066300504, 0.21988347096271976, 0.09490171872344011, 0.00673810838813298, 0.15751263118588207, -0.1670643913488367, -0.16820226453468612, 0.36004265877189207, 0.030341601072393275, -0.13104638532363896, 0.22669063157610636, -0.09852832927154835, -0.15902369235555738, 0.09265654118568764, 0.28547053556645013, 0.1031865575350821, -0.22120130864478382, -0.04847238206844064, 0.01315317019474148, 0.15495940337537742, 0.04772461491479167, -0.0023046535251489103, 0.2002858100827946, 0.24487893614673711, 0.008304632842334628, 0.07553196881765428, -0.11495312330913551, -0.05911571627910264, -0.22370301990017874, -0.11930667169397198, -0.09584232409805303, 0.012519952007747494, -0.11083760433684006, -0.18216187991150987, 0.43562501989485686, 0.23113276799021115, 0.168825290333785, 0.007141068935282325, 0.28026071247833023, 0.01295387735234095, 0.09901751260670116, 0.00586728296939874, 0.1169499287304158, -0.022585132265370594, 0.16385952487035751, -0.19461150828275328, 0.17019154915100732, -0.05464366140210482]
|
1,803.04838
|
Thermodynamic dislocation theory: Bauschinger effect
|
The thermodynamic dislocation theory developed for non-uniform plastic
deformations is used here to simulate the stress-strain curves for crystals
subjected to anti-plane shear-controlled load reversal. We show that the
presence of the positive back stress during the load reversal reduces the
magnitude of shear stress required to pull excess dislocations back to the
center of the specimen. There, the excess dislocations of opposite signs meet
and annihilate each other leading to the Bauschinger effect.
|
cond-mat.mtrl-sci cond-mat.soft
|
the thermodynamic dislocation theory developed for nonuniform plastic deformations is used here to simulate the stressstrain curves for crystals subjected to antiplane shearcontrolled load reversal we show that the presence of the positive back stress during the load reversal reduces the magnitude of shear stress required to pull excess dislocations back to the center of the specimen there the excess dislocations of opposite signs meet and annihilate each other leading to the bauschinger effect
|
[['the', 'thermodynamic', 'dislocation', 'theory', 'developed', 'for', 'nonuniform', 'plastic', 'deformations', 'is', 'used', 'here', 'to', 'simulate', 'the', 'stressstrain', 'curves', 'for', 'crystals', 'subjected', 'to', 'antiplane', 'shearcontrolled', 'load', 'reversal', 'we', 'show', 'that', 'the', 'presence', 'of', 'the', 'positive', 'back', 'stress', 'during', 'the', 'load', 'reversal', 'reduces', 'the', 'magnitude', 'of', 'shear', 'stress', 'required', 'to', 'pull', 'excess', 'dislocations', 'back', 'to', 'the', 'center', 'of', 'the', 'specimen', 'there', 'the', 'excess', 'dislocations', 'of', 'opposite', 'signs', 'meet', 'and', 'annihilate', 'each', 'other', 'leading', 'to', 'the', 'bauschinger', 'effect']]
|
[-0.1396378685643718, 0.19344880411477938, -0.06820875003755297, -0.013119941926561296, -0.0811459734168363, -0.10846315781037284, 0.054608481111681116, 0.3622409478340247, -0.31551159959133357, -0.24725371313421693, 0.02714151820033942, -0.2801950620870068, -0.11212502872533076, 0.12438028938558003, -0.05386992969409856, 0.05363555665906161, -0.01965052892026581, 0.013834356247409158, -0.053465718307774766, -0.27258438919351935, 0.21114697343708105, 0.050364607651654174, 0.40022614388407707, 0.04104847312994199, 0.07951474858667983, 0.028073302674273104, 0.014682177607327292, 0.05842962966951197, -0.16662504209242585, 0.026903855767458268, 0.19859500881284475, -0.06606365125371169, 0.18961686342444323, -0.5772615022038761, -0.21247964273270678, 0.14454860542581915, 0.08153142953572208, 0.12191713282404697, -0.01989070161513678, -0.20687475294027835, 0.0868138427501672, -0.09978268966589073, -0.16576330900855668, -0.017100483025998287, 0.04391756217786404, 0.00970746429432949, -0.19893274425643764, 0.12265897206706952, 0.06371128998939203, 0.04908042910113318, -0.14837804318673603, -0.027664891456904477, -0.11413196087113187, 0.09156020582742887, 0.1443153691050686, 0.03488645923151698, 0.24576876945921208, -0.11507122356393566, -0.07875463818136143, 0.4146655492790758, -0.014744109907889203, -0.15413056236806594, 0.1424320118297657, -0.11005801703040935, -0.0863109046708129, 0.21905075605601482, 0.17663438224603664, 0.006255720371272006, -0.09942161641960759, -0.040498920538532865, 0.059386785461069784, 0.10435175150632858, 0.14681522532889288, -0.08914228267840123, 0.23537443381772466, 0.10426190653688287, 0.08006696846680589, 0.21557501007161703, -0.16868001184974835, -0.05518454400988372, -0.3387778914750439, -0.18611610691662725, -0.13482761780463465, 0.04287503293575081, -0.07573759347205976, -0.180251532680776, 0.3364281399456197, 0.1340597632583486, 0.15356665114993356, 0.0380370523971952, 0.2374447405606202, 0.1017283545232901, 0.1306568474751221, 0.0485818378486964, 0.2779828039036222, 0.1841238642570703, 0.13762225269352737, -0.3220686693675816, 0.10618719332277367, 0.038103309204827435]
|
1,803.04839
|
Optimal estimators in misspecified linear regression model with an
application to real-world data
|
In this article, we propose the Sample Information Optimal Estimator (SIOE)
and the Stochastic Restricted Optimal Estimator (SROE) for misspecified linear
regression model when multicollinearity exists among explanatory variables.
Further, we obtain the superiority conditions of proposed estimators over some
other existing estimators in the Mean Square Error Matrix (MSEM) criterion in a
standard form which can apply to all estimators considered in this study.
Finally, a real world example and a Monte Carlo simulation study are presented
for the proposed estimators to illustrate the theoretical results.
|
math.ST stat.ME stat.TH
|
in this article we propose the sample information optimal estimator sioe and the stochastic restricted optimal estimator sroe for misspecified linear regression model when multicollinearity exists among explanatory variables further we obtain the superiority conditions of proposed estimators over some other existing estimators in the mean square error matrix msem criterion in a standard form which can apply to all estimators considered in this study finally a real world example and a monte carlo simulation study are presented for the proposed estimators to illustrate the theoretical results
|
[['in', 'this', 'article', 'we', 'propose', 'the', 'sample', 'information', 'optimal', 'estimator', 'sioe', 'and', 'the', 'stochastic', 'restricted', 'optimal', 'estimator', 'sroe', 'for', 'misspecified', 'linear', 'regression', 'model', 'when', 'multicollinearity', 'exists', 'among', 'explanatory', 'variables', 'further', 'we', 'obtain', 'the', 'superiority', 'conditions', 'of', 'proposed', 'estimators', 'over', 'some', 'other', 'existing', 'estimators', 'in', 'the', 'mean', 'square', 'error', 'matrix', 'msem', 'criterion', 'in', 'a', 'standard', 'form', 'which', 'can', 'apply', 'to', 'all', 'estimators', 'considered', 'in', 'this', 'study', 'finally', 'a', 'real', 'world', 'example', 'and', 'a', 'monte', 'carlo', 'simulation', 'study', 'are', 'presented', 'for', 'the', 'proposed', 'estimators', 'to', 'illustrate', 'the', 'theoretical', 'results']]
|
[-0.03852286469191313, -0.03830062976545271, -0.0946595579303582, 0.14183641678434522, -0.05085665157667416, -0.1713274404680466, 0.06423109234036768, 0.41363956468070257, -0.24955730660654166, -0.2675161930403727, 0.16604361070100876, -0.2649012687122997, -0.22623132632716614, 0.21396806020673145, -0.122668083190151, 0.12235947447445462, 0.08254969252328224, 9.030682199141558e-05, -0.11488387251053662, -0.3532265926108641, 0.23379416937994607, 0.05809996666058021, 0.3070642497171374, -0.0454054733943742, 0.1301238912430777, 0.020717814066173398, -0.05134010885102565, 0.043411436948158286, -0.20044495759203154, 0.10456431427532259, 0.2976862139561597, 0.14458354237653753, 0.3785112436641665, -0.316185754055058, -0.20379993104759384, 0.16889437588260453, 0.13600732119281447, 0.08488234715837548, -0.03329612549175234, -0.24210115489276016, 0.07985535227857968, -0.18841013988370406, -0.06974304952823064, -0.1228985455024111, -0.09224420181639931, 0.03968030440566294, -0.3960649362710469, 0.11657779016258085, 0.03308452134951949, 0.05691072712926304, -0.0439544811625691, -0.19207863975042366, 0.05115163975450046, 0.036088513861314446, 0.09390959091457154, -0.055879804805633336, 0.0938798503292834, -0.060192995239049196, -0.15334624296382945, 0.2831576481132823, -0.059748568304348736, -0.275372999030001, 0.13301227273529068, -0.14502525566255345, -0.12247215217691572, 0.06445323738050374, 0.2367155965691542, 0.07885460052091409, -0.20421468316772542, 0.08087914706454338, -0.1042277913321467, 0.10417383087470251, -0.0533046476488166, -0.008842658262480707, 0.08603199379970594, 0.16590995140757192, 0.08953338034779709, 0.16824500700116488, -0.10935906658115153, -0.1373751936316052, -0.3468102316646015, -0.13821085591745727, -0.21242557419053115, -0.028926002086304567, -0.1834302244156681, -0.18353626834338202, 0.376505725795184, 0.27301193002118346, 0.136472271432114, 0.1410793622421539, 0.31521366978584625, 0.09223625795806155, -0.005027588621220168, 0.11972727257867946, 0.20401796310325154, 0.15230557360850713, 0.00383587057072231, -0.1995081398389576, 0.10144599289085497, 0.043146277876461255]
|
1,803.0484
|
Resource aware design of a deep convolutional-recurrent neural network
for speech recognition through audio-visual sensor fusion
|
Today's Automatic Speech Recognition systems only rely on acoustic signals
and often don't perform well under noisy conditions. Performing multi-modal
speech recognition - processing acoustic speech signals and lip-reading video
simultaneously - significantly enhances the performance of such systems,
especially in noisy environments. This work presents the design of such an
audio-visual system for Automated Speech Recognition, taking memory and
computation requirements into account. First, a Long-Short-Term-Memory neural
network for acoustic speech recognition is designed. Second, Convolutional
Neural Networks are used to model lip-reading features. These are combined with
an LSTM network to model temporal dependencies and perform automatic
lip-reading on video. Finally, acoustic-speech and visual lip-reading networks
are combined to process acoustic and visual features simultaneously. An
attention mechanism ensures performance of the model in noisy environments.
This system is evaluated on the TCD-TIMIT 'lipspeaker' dataset for audio-visual
phoneme recognition with clean audio and with additive white noise at an SNR of
0dB. It achieves 75.70% and 58.55% phoneme accuracy respectively, over 14
percentage points better than the state-of-the-art for all noise levels.
|
cs.CV
|
todays automatic speech recognition systems only rely on acoustic signals and often dont perform well under noisy conditions performing multimodal speech recognition processing acoustic speech signals and lipreading video simultaneously significantly enhances the performance of such systems especially in noisy environments this work presents the design of such an audiovisual system for automated speech recognition taking memory and computation requirements into account first a longshorttermmemory neural network for acoustic speech recognition is designed second convolutional neural networks are used to model lipreading features these are combined with an lstm network to model temporal dependencies and perform automatic lipreading on video finally acousticspeech and visual lipreading networks are combined to process acoustic and visual features simultaneously an attention mechanism ensures performance of the model in noisy environments this system is evaluated on the tcdtimit lipspeaker dataset for audiovisual phoneme recognition with clean audio and with additive white noise at an snr of 0db it achieves 7570 and 5855 phoneme accuracy respectively over 14 percentage points better than the stateoftheart for all noise levels
|
[['todays', 'automatic', 'speech', 'recognition', 'systems', 'only', 'rely', 'on', 'acoustic', 'signals', 'and', 'often', 'dont', 'perform', 'well', 'under', 'noisy', 'conditions', 'performing', 'multimodal', 'speech', 'recognition', 'processing', 'acoustic', 'speech', 'signals', 'and', 'lipreading', 'video', 'simultaneously', 'significantly', 'enhances', 'the', 'performance', 'of', 'such', 'systems', 'especially', 'in', 'noisy', 'environments', 'this', 'work', 'presents', 'the', 'design', 'of', 'such', 'an', 'audiovisual', 'system', 'for', 'automated', 'speech', 'recognition', 'taking', 'memory', 'and', 'computation', 'requirements', 'into', 'account', 'first', 'a', 'longshorttermmemory', 'neural', 'network', 'for', 'acoustic', 'speech', 'recognition', 'is', 'designed', 'second', 'convolutional', 'neural', 'networks', 'are', 'used', 'to', 'model', 'lipreading', 'features', 'these', 'are', 'combined', 'with', 'an', 'lstm', 'network', 'to', 'model', 'temporal', 'dependencies', 'and', 'perform', 'automatic', 'lipreading', 'on', 'video', 'finally', 'acousticspeech', 'and', 'visual', 'lipreading', 'networks', 'are', 'combined', 'to', 'process', 'acoustic', 'and', 'visual', 'features', 'simultaneously', 'an', 'attention', 'mechanism', 'ensures', 'performance', 'of', 'the', 'model', 'in', 'noisy', 'environments', 'this', 'system', 'is', 'evaluated', 'on', 'the', 'tcdtimit', 'lipspeaker', 'dataset', 'for', 'audiovisual', 'phoneme', 'recognition', 'with', 'clean', 'audio', 'and', 'with', 'additive', 'white', 'noise', 'at', 'an', 'snr', 'of', '0db', 'it', 'achieves', '7570', 'and', '5855', 'phoneme', 'accuracy', 'respectively', 'over', '14', 'percentage', 'points', 'better', 'than', 'the', 'stateoftheart', 'for', 'all', 'noise', 'levels']]
|
[-0.08416277802406022, -0.017535147143833713, -0.0038429245928966456, 0.043779474480982856, -0.08705592673745823, -0.21305840773529997, -0.001288444722710541, 0.49308121333879656, -0.24421499349099732, -0.30647325325659447, 0.07494903824666857, -0.3018633494616525, -0.21375462598547604, 0.24456036953701907, -0.18872339989746834, 0.1285912133670638, 0.18184418068129635, 0.11343416169846497, -0.013708677958454606, -0.2948584681233534, 0.23641598392581048, 0.0702618864645972, 0.38568797393442966, -0.028156258908758964, 0.1547787578489918, -0.045356575589759286, -0.051080999561322345, -0.12191644305302679, 0.030244860383433967, 0.13419885005796406, 0.3448314533993249, 0.18715705812671746, 0.28292560763932634, -0.41093022386183875, -0.26468748863532965, 0.06965734455844708, 0.14998131341951176, 0.11859281375982175, -0.0338147068113783, -0.43560278265786595, 0.12630469059384258, -0.17004471207202893, 0.14779037107646703, -0.1265339749016573, -0.004926670422590167, -0.028140637473225285, -0.31137538041103874, 0.07510980185033125, 0.1421477643355518, 0.14100834226081446, -0.07178488703576859, -0.10560966999209404, 0.041856254951080536, 0.23238209166327084, -0.0008314879214702471, 0.042629072910378624, 0.1516376673547033, -0.22196617235047963, -0.1080832386405907, 0.3888108228149372, -0.08212236024120054, -0.22185496577563193, 0.23943803747895465, 0.017915970327597133, -0.14845335874066523, 0.11005206894923068, 0.29746846220395445, 0.043913134077519796, -0.21130994246093301, -0.03606052689265306, 0.03457140335096763, 0.2765342317323184, 0.07171644606164618, 0.05448039412807078, 0.19305462371172197, 0.31457570614017677, -0.028789472443495254, 0.1218959102682637, -0.16303104393806903, 0.017047776946709794, -0.13918291961914755, -0.03561307431939857, -0.15675580886002496, -0.05935188403942749, -0.09279614879981168, -0.14076784358376407, 0.39712499700398485, 0.24253276110070168, 0.16754842011709892, 0.17067019432265113, 0.3961503077298403, 0.033180306150340996, 0.096132041767967, 0.06775862457969133, 0.14911373888112098, -0.02448242001742477, 0.18495779084668568, -0.1930230236793083, 0.08736610659205261, 0.03664812086612956]
|
1,803.04841
|
An integrated general purpose SiPM based optical module with a high
dynamic range
|
Silicon photomultipliers (SiPMs) are semiconductor-based light-sensors
offering a high gain, a mechanically and optically robust design and high
photon detection efficiency. Due to these characteristics, they started to
replace conventional photomultiplier tubes in many applications in recent
years. This paper presents an optical module based on SiPMs designed for the
application in scintillators as well as lab measurements. The module hosts the
SiPM bias voltage supply and three pre-amplifiers with different gain levels to
exploit the full dynamic range of the SiPMs. Two SiPMs, read-out in parallel,
are equipped with light guides to increase the sensitive area. The light guides
are optimized for the read-out of wavelength shifting fibers as used in many
plastic scintillator detectors. The optical and electrical performance of the
module is characterized in detail in laboratory measurements. Prototypes have
been installed and tested in a modified version of the Scintillator Surface
Detector developed for AugerPrime, the upgrade of the Pierre Auger Observatory.
The SiPM module is operated in the Argentinian Pampas and first data proves its
usability in such harsh environments.
|
physics.ins-det
|
silicon photomultipliers sipms are semiconductorbased lightsensors offering a high gain a mechanically and optically robust design and high photon detection efficiency due to these characteristics they started to replace conventional photomultiplier tubes in many applications in recent years this paper presents an optical module based on sipms designed for the application in scintillators as well as lab measurements the module hosts the sipm bias voltage supply and three preamplifiers with different gain levels to exploit the full dynamic range of the sipms two sipms readout in parallel are equipped with light guides to increase the sensitive area the light guides are optimized for the readout of wavelength shifting fibers as used in many plastic scintillator detectors the optical and electrical performance of the module is characterized in detail in laboratory measurements prototypes have been installed and tested in a modified version of the scintillator surface detector developed for augerprime the upgrade of the pierre auger observatory the sipm module is operated in the argentinian pampas and first data proves its usability in such harsh environments
|
[['silicon', 'photomultipliers', 'sipms', 'are', 'semiconductorbased', 'lightsensors', 'offering', 'a', 'high', 'gain', 'a', 'mechanically', 'and', 'optically', 'robust', 'design', 'and', 'high', 'photon', 'detection', 'efficiency', 'due', 'to', 'these', 'characteristics', 'they', 'started', 'to', 'replace', 'conventional', 'photomultiplier', 'tubes', 'in', 'many', 'applications', 'in', 'recent', 'years', 'this', 'paper', 'presents', 'an', 'optical', 'module', 'based', 'on', 'sipms', 'designed', 'for', 'the', 'application', 'in', 'scintillators', 'as', 'well', 'as', 'lab', 'measurements', 'the', 'module', 'hosts', 'the', 'sipm', 'bias', 'voltage', 'supply', 'and', 'three', 'preamplifiers', 'with', 'different', 'gain', 'levels', 'to', 'exploit', 'the', 'full', 'dynamic', 'range', 'of', 'the', 'sipms', 'two', 'sipms', 'readout', 'in', 'parallel', 'are', 'equipped', 'with', 'light', 'guides', 'to', 'increase', 'the', 'sensitive', 'area', 'the', 'light', 'guides', 'are', 'optimized', 'for', 'the', 'readout', 'of', 'wavelength', 'shifting', 'fibers', 'as', 'used', 'in', 'many', 'plastic', 'scintillator', 'detectors', 'the', 'optical', 'and', 'electrical', 'performance', 'of', 'the', 'module', 'is', 'characterized', 'in', 'detail', 'in', 'laboratory', 'measurements', 'prototypes', 'have', 'been', 'installed', 'and', 'tested', 'in', 'a', 'modified', 'version', 'of', 'the', 'scintillator', 'surface', 'detector', 'developed', 'for', 'augerprime', 'the', 'upgrade', 'of', 'the', 'pierre', 'auger', 'observatory', 'the', 'sipm', 'module', 'is', 'operated', 'in', 'the', 'argentinian', 'pampas', 'and', 'first', 'data', 'proves', 'its', 'usability', 'in', 'such', 'harsh', 'environments']]
|
[-0.09049170650140351, 0.12735601144800318, -0.022855423993013543, -0.0189202806280776, -0.027159446518568473, -0.20374008247243433, -0.03289868587015154, 0.45867158178422046, -0.18570316118594987, -0.3573175284947301, 0.1278036230701375, -0.33332200158366015, -0.06366920176807833, 0.2744039923940175, -0.11033801027391663, 0.12275805820720324, 0.07024711226621622, -0.05324252127220148, -0.042397655908623176, -0.23953677433671366, 0.17459201115322695, 0.17892307667168736, 0.3651193139456405, 0.04228834916259451, 0.185823925731345, -0.010040259240302205, -0.05980105737984266, -0.03238639229876471, -0.049626942766808915, 0.06085503175613824, 0.3558276625204264, 0.054451811621126174, 0.1921980065218676, -0.4661150071769953, -0.1542764054531039, 0.07258192138564398, 0.07929697037331931, -0.02345364672351286, -0.08998927824204551, -0.2919341048236465, 0.09158163133944416, -0.21186389999153712, -0.1155476594001226, 0.008717323893590177, -0.06158995235488675, 0.07458607988678262, -0.17226752606568452, -0.10124258682581372, -0.028724217157805574, 0.05869303505610803, -0.013396023640853363, -0.11149160014251354, 0.05397404749321098, 0.08216833170712792, -0.03618987586386716, -0.023865070414793646, 0.22451890765250415, -0.14261989550392046, -0.07552383099709391, 0.313032665134718, -0.034288051487321315, -0.13811502159677175, 0.17616648343124094, -0.1421974299331035, -0.05658507088852254, 0.16870478488472773, 0.1810466412812118, 0.05318518686770654, -0.2036029329983753, 0.02308004388877394, 0.06979822213012168, 0.1896915522714456, 0.0898949604698232, 0.09042157135079561, 0.22682913046613892, 0.30188600585164355, 0.06448865692691888, 0.15360093285830093, -0.17889453844574077, 0.03562520867301922, -0.27312118481763037, -0.20717377571560358, -0.12953753143431213, 9.734936235151414e-05, 0.0007111005538247589, -0.13824421529733072, 0.431212790749282, 0.129177769714292, 0.09430188860278577, -0.03219115209027097, 0.33448142999376373, 0.016475254765460162, 0.15200034862159398, -0.030917403331005025, 0.3080923451463981, 0.14774840884044466, 0.19208424586813425, -0.1689271550042148, 0.031164380037138804, -0.009142968354040179]
|
1,803.04842
|
A Learning-Based Visual Saliency Prediction Model for Stereoscopic 3D
Video (LBVS-3D)
|
Over the past decade, many computational saliency prediction models have been
proposed for 2D images and videos. Considering that the human visual system has
evolved in a natural 3D environment, it is only natural to want to design
visual attention models for 3D content. Existing monocular saliency models are
not able to accurately predict the attentive regions when applied to 3D
image/video content, as they do not incorporate depth information. This paper
explores stereoscopic video saliency prediction by exploiting both low-level
attributes such as brightness, color, texture, orientation, motion, and depth,
as well as high-level cues such as face, person, vehicle, animal, text, and
horizon. Our model starts with a rough segmentation and quantifies several
intuitive observations such as the effects of visual discomfort level, depth
abruptness, motion acceleration, elements of surprise, size and compactness of
the salient regions, and emphasizing only a few salient objects in a scene. A
new fovea-based model of spatial distance between the image regions is adopted
for considering local and global feature calculations. To efficiently fuse the
conspicuity maps generated by our method to one single saliency map that is
highly correlated with the eye-fixation data, a random forest based algorithm
is utilized. The performance of the proposed saliency model is evaluated
against the results of an eye-tracking experiment, which involved 24 subjects
and an in-house database of 61 captured stereoscopic videos. Our stereo video
database as well as the eye-tracking data are publicly available along with
this paper. Experiment results show that the proposed saliency prediction
method achieves competitive performance compared to the state-of-the-art
approaches.
|
cs.CV
|
over the past decade many computational saliency prediction models have been proposed for 2d images and videos considering that the human visual system has evolved in a natural 3d environment it is only natural to want to design visual attention models for 3d content existing monocular saliency models are not able to accurately predict the attentive regions when applied to 3d imagevideo content as they do not incorporate depth information this paper explores stereoscopic video saliency prediction by exploiting both lowlevel attributes such as brightness color texture orientation motion and depth as well as highlevel cues such as face person vehicle animal text and horizon our model starts with a rough segmentation and quantifies several intuitive observations such as the effects of visual discomfort level depth abruptness motion acceleration elements of surprise size and compactness of the salient regions and emphasizing only a few salient objects in a scene a new foveabased model of spatial distance between the image regions is adopted for considering local and global feature calculations to efficiently fuse the conspicuity maps generated by our method to one single saliency map that is highly correlated with the eyefixation data a random forest based algorithm is utilized the performance of the proposed saliency model is evaluated against the results of an eyetracking experiment which involved 24 subjects and an inhouse database of 61 captured stereoscopic videos our stereo video database as well as the eyetracking data are publicly available along with this paper experiment results show that the proposed saliency prediction method achieves competitive performance compared to the stateoftheart approaches
|
[['over', 'the', 'past', 'decade', 'many', 'computational', 'saliency', 'prediction', 'models', 'have', 'been', 'proposed', 'for', '2d', 'images', 'and', 'videos', 'considering', 'that', 'the', 'human', 'visual', 'system', 'has', 'evolved', 'in', 'a', 'natural', '3d', 'environment', 'it', 'is', 'only', 'natural', 'to', 'want', 'to', 'design', 'visual', 'attention', 'models', 'for', '3d', 'content', 'existing', 'monocular', 'saliency', 'models', 'are', 'not', 'able', 'to', 'accurately', 'predict', 'the', 'attentive', 'regions', 'when', 'applied', 'to', '3d', 'imagevideo', 'content', 'as', 'they', 'do', 'not', 'incorporate', 'depth', 'information', 'this', 'paper', 'explores', 'stereoscopic', 'video', 'saliency', 'prediction', 'by', 'exploiting', 'both', 'lowlevel', 'attributes', 'such', 'as', 'brightness', 'color', 'texture', 'orientation', 'motion', 'and', 'depth', 'as', 'well', 'as', 'highlevel', 'cues', 'such', 'as', 'face', 'person', 'vehicle', 'animal', 'text', 'and', 'horizon', 'our', 'model', 'starts', 'with', 'a', 'rough', 'segmentation', 'and', 'quantifies', 'several', 'intuitive', 'observations', 'such', 'as', 'the', 'effects', 'of', 'visual', 'discomfort', 'level', 'depth', 'abruptness', 'motion', 'acceleration', 'elements', 'of', 'surprise', 'size', 'and', 'compactness', 'of', 'the', 'salient', 'regions', 'and', 'emphasizing', 'only', 'a', 'few', 'salient', 'objects', 'in', 'a', 'scene', 'a', 'new', 'foveabased', 'model', 'of', 'spatial', 'distance', 'between', 'the', 'image', 'regions', 'is', 'adopted', 'for', 'considering', 'local', 'and', 'global', 'feature', 'calculations', 'to', 'efficiently', 'fuse', 'the', 'conspicuity', 'maps', 'generated', 'by', 'our', 'method', 'to', 'one', 'single', 'saliency', 'map', 'that', 'is', 'highly', 'correlated', 'with', 'the', 'eyefixation', 'data', 'a', 'random', 'forest', 'based', 'algorithm', 'is', 'utilized', 'the', 'performance', 'of', 'the', 'proposed', 'saliency', 'model', 'is', 'evaluated', 'against', 'the', 'results', 'of', 'an', 'eyetracking', 'experiment', 'which', 'involved', '24', 'subjects', 'and', 'an', 'inhouse', 'database', 'of', '61', 'captured', 'stereoscopic', 'videos', 'our', 'stereo', 'video', 'database', 'as', 'well', 'as', 'the', 'eyetracking', 'data', 'are', 'publicly', 'available', 'along', 'with', 'this', 'paper', 'experiment', 'results', 'show', 'that', 'the', 'proposed', 'saliency', 'prediction', 'method', 'achieves', 'competitive', 'performance', 'compared', 'to', 'the', 'stateoftheart', 'approaches']]
|
[-0.0021975961526306312, 0.006067120788687611, -0.07089912573364474, 0.054477365629504865, -0.10088014537539919, -0.15603611988133226, -0.02518029338269855, 0.47873371131575426, -0.26342573825812315, -0.3707558486710563, 0.07065308908842703, -0.3171815578736565, -0.17293239136536917, 0.16507647399187544, -0.1787581133209722, 0.10690636630370763, 0.14193647811358787, 0.06586520431672091, -0.020207171640144767, -0.2557810968295689, 0.2612926908929286, 0.07667668069752069, 0.31788992068205757, 0.01709259615165549, 0.15029327689591523, -0.045224632702543045, -0.06596145194498429, 0.047934522416970736, -0.061564828067101576, 0.16397819889288295, 0.30738008218038576, 0.20499846999938476, 0.24707040516838033, -0.40642901628467315, -0.26832517038342113, 0.027553597899596296, 0.13903545106268733, 0.09253666220300642, -0.059602904712453025, -0.3938762736604888, 0.0763891841850504, -0.150354514200012, 0.018063761688183664, -0.11158287684857789, 0.016895299439962555, -0.03507566488266769, -0.28082595134004096, 0.04596440397359973, 0.040579051877482585, 0.11064658062132784, -0.07390117689778036, -0.08283477067116424, -0.03812558011337401, 0.23606272360055272, 0.04544513355536918, 0.08788071298212173, 0.17724774663793316, -0.22545424481975165, -0.11966969791337691, 0.40598455270559625, -0.0618134044722736, -0.20100862580747164, 0.22732000091377202, -0.0609427146752761, -0.11247398409728403, 0.12640134028205469, 0.19417141849240663, 0.1197797095338846, -0.1623098723908955, -0.021434788379846748, -0.07414431373099886, 0.2098345654504552, 0.04028337862355085, -0.0014641738935619935, 0.2194573962222428, 0.2345495361440469, 0.024068062217331623, 0.09555337526407306, -0.20216503173806008, -0.052047291265665, -0.19649549445826062, -0.10145514811232144, -0.18326305909353482, -0.0781953352135722, -0.10977090611809444, -0.13474747462205275, 0.4160958056755621, 0.26890390125367347, 0.2360125046234107, 0.07424089100017388, 0.38798038577268407, 0.006525424233694843, 0.09664549962956444, 0.052190142037825106, 0.18304855834248465, -0.02465188009236222, 0.1364545674771124, -0.1500302825865275, 0.09209850103901235, 0.08505638771720758]
|
1,803.04843
|
Quantum Mechanics from Relational Properties, Part II: Measurement and
EPR
|
Quantum measurement and quantum operation theory is developed here by taking
the relational properties among quantum systems, instead of the independent
properties of a quantum system, as the most fundamental elements. By studying
how the relational probability amplitude matrix is transformed and how mutual
information is exchanged during measurement, we derive the formulation that is
mathematically equivalent to the traditional quantum measurement theory. More
importantly, the formulation results in significant conceptual consequences. We
show that for a given quantum system, it is possible to describe its time
evolution without explicitly calling out a reference system. However,
description of a quantum measurement must be explicitly relative. Traditional
quantum mechanics assumes a super observer who can instantaneously know the
measurement results from any location. For a composite system consists
space-like separated subsystems, the assumption of super observer must be
abandoned and the relational formulation of quantum measurement becomes
necessary. This is confirmed in the resolution of EPR paradox. Information
exchange is relative to a local observer in quantum mechanics. Different local
observers can achieve consistent descriptions of a quantum system if they are
synchronized on the information regarding outcomes from any measurement
performed on the system. It is suggested that the synchronization of
measurement results from different observers is a necessary step when combining
quantum mechanics with the relativity theory.
|
quant-ph
|
quantum measurement and quantum operation theory is developed here by taking the relational properties among quantum systems instead of the independent properties of a quantum system as the most fundamental elements by studying how the relational probability amplitude matrix is transformed and how mutual information is exchanged during measurement we derive the formulation that is mathematically equivalent to the traditional quantum measurement theory more importantly the formulation results in significant conceptual consequences we show that for a given quantum system it is possible to describe its time evolution without explicitly calling out a reference system however description of a quantum measurement must be explicitly relative traditional quantum mechanics assumes a super observer who can instantaneously know the measurement results from any location for a composite system consists spacelike separated subsystems the assumption of super observer must be abandoned and the relational formulation of quantum measurement becomes necessary this is confirmed in the resolution of epr paradox information exchange is relative to a local observer in quantum mechanics different local observers can achieve consistent descriptions of a quantum system if they are synchronized on the information regarding outcomes from any measurement performed on the system it is suggested that the synchronization of measurement results from different observers is a necessary step when combining quantum mechanics with the relativity theory
|
[['quantum', 'measurement', 'and', 'quantum', 'operation', 'theory', 'is', 'developed', 'here', 'by', 'taking', 'the', 'relational', 'properties', 'among', 'quantum', 'systems', 'instead', 'of', 'the', 'independent', 'properties', 'of', 'a', 'quantum', 'system', 'as', 'the', 'most', 'fundamental', 'elements', 'by', 'studying', 'how', 'the', 'relational', 'probability', 'amplitude', 'matrix', 'is', 'transformed', 'and', 'how', 'mutual', 'information', 'is', 'exchanged', 'during', 'measurement', 'we', 'derive', 'the', 'formulation', 'that', 'is', 'mathematically', 'equivalent', 'to', 'the', 'traditional', 'quantum', 'measurement', 'theory', 'more', 'importantly', 'the', 'formulation', 'results', 'in', 'significant', 'conceptual', 'consequences', 'we', 'show', 'that', 'for', 'a', 'given', 'quantum', 'system', 'it', 'is', 'possible', 'to', 'describe', 'its', 'time', 'evolution', 'without', 'explicitly', 'calling', 'out', 'a', 'reference', 'system', 'however', 'description', 'of', 'a', 'quantum', 'measurement', 'must', 'be', 'explicitly', 'relative', 'traditional', 'quantum', 'mechanics', 'assumes', 'a', 'super', 'observer', 'who', 'can', 'instantaneously', 'know', 'the', 'measurement', 'results', 'from', 'any', 'location', 'for', 'a', 'composite', 'system', 'consists', 'spacelike', 'separated', 'subsystems', 'the', 'assumption', 'of', 'super', 'observer', 'must', 'be', 'abandoned', 'and', 'the', 'relational', 'formulation', 'of', 'quantum', 'measurement', 'becomes', 'necessary', 'this', 'is', 'confirmed', 'in', 'the', 'resolution', 'of', 'epr', 'paradox', 'information', 'exchange', 'is', 'relative', 'to', 'a', 'local', 'observer', 'in', 'quantum', 'mechanics', 'different', 'local', 'observers', 'can', 'achieve', 'consistent', 'descriptions', 'of', 'a', 'quantum', 'system', 'if', 'they', 'are', 'synchronized', 'on', 'the', 'information', 'regarding', 'outcomes', 'from', 'any', 'measurement', 'performed', 'on', 'the', 'system', 'it', 'is', 'suggested', 'that', 'the', 'synchronization', 'of', 'measurement', 'results', 'from', 'different', 'observers', 'is', 'a', 'necessary', 'step', 'when', 'combining', 'quantum', 'mechanics', 'with', 'the', 'relativity', 'theory']]
|
[-0.1164861056444218, 0.14544654918039954, -0.1478170019813702, 0.05549184753882075, -0.04161928421091459, -0.19315839181611433, 0.034063462753793, 0.325861973989191, -0.2737921102612211, -0.28726317482539065, 0.07827075566282632, -0.2750003442142603, -0.14123417732173388, 0.1902823989063826, -0.0956603886747579, 0.06756295537850564, 0.10290511046032157, 0.09130545364641542, -0.09008878825308217, -0.21293637901277562, 0.3048931678101301, 0.083774700152064, 0.28417034785011186, 0.002677962470184499, 0.13379819449806296, 0.06348421720792155, -0.016309920865017067, 0.06624932636276161, -0.08428161793946873, 0.09264896830560965, 0.2627572564818307, 0.18035840942791248, 0.2742084498611202, -0.4282040171615711, -0.20510401073928683, 0.08106910648441729, 0.09565308081934554, 0.17232492464645807, -0.0003806454786489325, -0.30614160531234647, 0.055032960307963806, -0.15307853929912074, -0.1101420799894002, -0.06435956218207273, 0.007852291765221215, -0.07004269302252321, -0.22303164019057134, 0.06496999428154679, 0.06860693462638648, 0.054389816400201976, -0.045056225674829246, -0.010708833093687661, 0.0313624023446201, 0.1620742751990601, -0.03422852994878392, -0.0008723664651795743, 0.15804182840596645, -0.0943046881071796, -0.14699896291131154, 0.40585308748194865, 0.001997841232260817, -0.2237780280218998, 0.16085399950986917, -0.12188763608045261, -0.11121755088156157, 0.052192381211479594, 0.10547232763401719, 0.08355030102586937, -0.1796928457652113, 0.0744044957227743, -0.022435374225814476, 0.21540426494929632, 0.03332194952623184, 0.08898801920794532, 0.2492848785782079, 0.10760769160323426, 0.046595994795356456, 0.08882293649607363, -0.023609918262382304, -0.1815533958091892, -0.3518170623894815, -0.19164703630227084, -0.21462033624726629, 0.10394534298833973, -0.0757343565392732, -0.10257597318038754, 0.34071473720154527, 0.15761531770887247, 0.1410737887148771, -0.0008807583800687907, 0.3177907298951316, 0.1346553839554096, 0.04712862985362427, 0.04958367671116913, 0.2770068009187459, 0.16624010051600635, 0.09689634607211951, -0.2087729753629484, 0.09579023501382919, 0.0449021817825803]
|
1,803.04844
|
Space Reduction in Matrix Product State
|
We reconstruct a matrix product state (MPS) in reduced spaces using density
matrix. This scheme applies to a MPS built on a blocked quantum lattice. Each
block contains $N$ physical sites that have a local space of rank $R$. The
simulation in the original spaces of rank $R^N$ is used to construct density
matrices for every block. They are diagonalized and only the eigenvectors
corresponding to significant diagonal elements are used to transform the
original spaces to smaller ones and to reconstruct the MPS in those smaller
spaces accordingly. Simulations in the reduced spaces are used to reliably
extrapolate the result in unreduced spaces. Moreover, to obtain a required
accuracy, the ratio of the reduced space rank over the original decreases
quickly with $N$. The reduced space has a saturated rank to obtain a demanded
accuracy when $N\rightarrow \infty$.
|
cond-mat.str-el
|
we reconstruct a matrix product state mps in reduced spaces using density matrix this scheme applies to a mps built on a blocked quantum lattice each block contains n physical sites that have a local space of rank r the simulation in the original spaces of rank rn is used to construct density matrices for every block they are diagonalized and only the eigenvectors corresponding to significant diagonal elements are used to transform the original spaces to smaller ones and to reconstruct the mps in those smaller spaces accordingly simulations in the reduced spaces are used to reliably extrapolate the result in unreduced spaces moreover to obtain a required accuracy the ratio of the reduced space rank over the original decreases quickly with n the reduced space has a saturated rank to obtain a demanded accuracy when nrightarrow infty
|
[['we', 'reconstruct', 'a', 'matrix', 'product', 'state', 'mps', 'in', 'reduced', 'spaces', 'using', 'density', 'matrix', 'this', 'scheme', 'applies', 'to', 'a', 'mps', 'built', 'on', 'a', 'blocked', 'quantum', 'lattice', 'each', 'block', 'contains', 'n', 'physical', 'sites', 'that', 'have', 'a', 'local', 'space', 'of', 'rank', 'r', 'the', 'simulation', 'in', 'the', 'original', 'spaces', 'of', 'rank', 'rn', 'is', 'used', 'to', 'construct', 'density', 'matrices', 'for', 'every', 'block', 'they', 'are', 'diagonalized', 'and', 'only', 'the', 'eigenvectors', 'corresponding', 'to', 'significant', 'diagonal', 'elements', 'are', 'used', 'to', 'transform', 'the', 'original', 'spaces', 'to', 'smaller', 'ones', 'and', 'to', 'reconstruct', 'the', 'mps', 'in', 'those', 'smaller', 'spaces', 'accordingly', 'simulations', 'in', 'the', 'reduced', 'spaces', 'are', 'used', 'to', 'reliably', 'extrapolate', 'the', 'result', 'in', 'unreduced', 'spaces', 'moreover', 'to', 'obtain', 'a', 'required', 'accuracy', 'the', 'ratio', 'of', 'the', 'reduced', 'space', 'rank', 'over', 'the', 'original', 'decreases', 'quickly', 'with', 'n', 'the', 'reduced', 'space', 'has', 'a', 'saturated', 'rank', 'to', 'obtain', 'a', 'demanded', 'accuracy', 'when', 'nrightarrow', 'infty']]
|
[-0.07871157594909556, 0.11885430764703402, -0.052368403472703134, 0.10115988330124952, -0.004430419251175342, -0.12171778153534309, 0.029143473761585013, 0.36026521467288836, -0.28690648833356747, -0.23347440268844366, 0.1320476822585216, -0.2535981530886438, -0.09535481973732118, 0.14004377216743907, -0.060455290245548854, 0.04595983180505552, 0.05174911724698308, 0.10350774205457285, -0.19562484409154238, -0.31418411225321696, 0.29951371428751045, 0.03273682548788463, 0.25430735327946624, -0.05625467875422977, 0.097620479383995, 0.013864424732922436, -0.028510571322186092, 0.020211913099674936, -0.10773516104502391, 0.14412839724688553, 0.29547212663669437, 0.12015647746341156, 0.23214468877199743, -0.39112961306567506, -0.16939144868825784, 0.16844990027217502, 0.15564558215827928, 0.08135903466546493, 0.05320334551175855, -0.27395802700101474, 0.11548157972317162, -0.1799161608277304, -0.15619712428142912, -0.12147180485813845, 0.02720668875920526, -0.03961381531258902, -0.31367162186250414, 0.021967158322859046, -0.02059054279385014, -0.04378140628967676, -0.04655972607232791, -0.16044803782158512, -0.043097309336876964, 0.1505563538523622, -0.02745993149118404, 0.06563324219691266, 0.13130171112540318, -0.028285050010702258, -0.0489833263107475, 0.3738064694640448, -0.060948009927683386, -0.27509436920023916, 0.1706835743803665, -0.1313442180415602, -0.1121828206379315, 0.1649412405610138, 0.16988681195129593, 0.07503469004681025, -0.03665204624121543, 0.12186411445501441, -0.07256125030442805, 0.1942039298751264, 0.06231824390040778, 0.023000628509887044, 0.07981383700004156, 0.1014148921914325, 0.10920593291085562, 0.13295938427017318, -0.01349170067139881, -0.05354635296942224, -0.2399224555990893, -0.17231769351583484, -0.24988782160878584, 0.05330434549606586, -0.13441190460220268, -0.15701826569949204, 0.37862857005972117, 0.11437182830271425, 0.22215815275076697, 0.09200350988803686, 0.2476121046573674, 0.09514764997196927, 0.08051408496023685, 0.10203940867238658, 0.16917049474746204, 0.19195392118807106, 0.06972002243479083, -0.15521244922478636, 0.019391874660463104, 0.16583052294650416]
|
1,803.04845
|
Benchmark 3D eye-tracking dataset for visual saliency prediction on
stereoscopic 3D video
|
Visual Attention Models (VAMs) predict the location of an image or video
regions that are most likely to attract human attention. Although saliency
detection is well explored for 2D image and video content, there are only few
attempts made to design 3D saliency prediction models. Newly proposed 3D visual
attention models have to be validated over large-scale video saliency
prediction datasets, which also contain results of eye-tracking information.
There are several publicly available eye-tracking datasets for 2D image and
video content. In the case of 3D, however, there is still a need for
large-scale video saliency datasets for the research community for validating
different 3D-VAMs. In this paper, we introduce a large-scale dataset containing
eye-tracking data collected from 61 stereoscopic 3D videos (and also 2D
versions of those) and 24 subjects participated in a free-viewing test. We
evaluate the performance of the existing saliency detection methods over the
proposed dataset. In addition, we created an online benchmark for validating
the performance of the existing 2D and 3D visual attention models and
facilitate addition of new VAMs to the benchmark. Our benchmark currently
contains 50 different VAMs.
|
eess.IV
|
visual attention models vams predict the location of an image or video regions that are most likely to attract human attention although saliency detection is well explored for 2d image and video content there are only few attempts made to design 3d saliency prediction models newly proposed 3d visual attention models have to be validated over largescale video saliency prediction datasets which also contain results of eyetracking information there are several publicly available eyetracking datasets for 2d image and video content in the case of 3d however there is still a need for largescale video saliency datasets for the research community for validating different 3dvams in this paper we introduce a largescale dataset containing eyetracking data collected from 61 stereoscopic 3d videos and also 2d versions of those and 24 subjects participated in a freeviewing test we evaluate the performance of the existing saliency detection methods over the proposed dataset in addition we created an online benchmark for validating the performance of the existing 2d and 3d visual attention models and facilitate addition of new vams to the benchmark our benchmark currently contains 50 different vams
|
[['visual', 'attention', 'models', 'vams', 'predict', 'the', 'location', 'of', 'an', 'image', 'or', 'video', 'regions', 'that', 'are', 'most', 'likely', 'to', 'attract', 'human', 'attention', 'although', 'saliency', 'detection', 'is', 'well', 'explored', 'for', '2d', 'image', 'and', 'video', 'content', 'there', 'are', 'only', 'few', 'attempts', 'made', 'to', 'design', '3d', 'saliency', 'prediction', 'models', 'newly', 'proposed', '3d', 'visual', 'attention', 'models', 'have', 'to', 'be', 'validated', 'over', 'largescale', 'video', 'saliency', 'prediction', 'datasets', 'which', 'also', 'contain', 'results', 'of', 'eyetracking', 'information', 'there', 'are', 'several', 'publicly', 'available', 'eyetracking', 'datasets', 'for', '2d', 'image', 'and', 'video', 'content', 'in', 'the', 'case', 'of', '3d', 'however', 'there', 'is', 'still', 'a', 'need', 'for', 'largescale', 'video', 'saliency', 'datasets', 'for', 'the', 'research', 'community', 'for', 'validating', 'different', '3dvams', 'in', 'this', 'paper', 'we', 'introduce', 'a', 'largescale', 'dataset', 'containing', 'eyetracking', 'data', 'collected', 'from', '61', 'stereoscopic', '3d', 'videos', 'and', 'also', '2d', 'versions', 'of', 'those', 'and', '24', 'subjects', 'participated', 'in', 'a', 'freeviewing', 'test', 'we', 'evaluate', 'the', 'performance', 'of', 'the', 'existing', 'saliency', 'detection', 'methods', 'over', 'the', 'proposed', 'dataset', 'in', 'addition', 'we', 'created', 'an', 'online', 'benchmark', 'for', 'validating', 'the', 'performance', 'of', 'the', 'existing', '2d', 'and', '3d', 'visual', 'attention', 'models', 'and', 'facilitate', 'addition', 'of', 'new', 'vams', 'to', 'the', 'benchmark', 'our', 'benchmark', 'currently', 'contains', '50', 'different', 'vams']]
|
[-0.012791419653473673, -0.04337658340479499, -0.01568199558202429, 0.04281438694121568, -0.09265169830162179, -0.1641593478695565, -0.046409538324695784, 0.48806624396427256, -0.18451873602509197, -0.3797501022751267, 0.09990170287924843, -0.3470925470213154, -0.16341074474684492, 0.22679268211705259, -0.1542800941583197, 0.11889826372781818, 0.18964368927015646, 0.06610106948159031, -0.03279172557255102, -0.314717059943674, 0.27796185476755775, 0.037808629518022406, 0.3545068238987713, 0.04550334283628979, 0.08823118255524015, -0.09432546865144695, -0.11516106065513718, 0.007925094271431099, -0.09833071310143143, 0.1843567750432428, 0.33473653812818793, 0.2227854420028224, 0.27800553304873205, -0.40883465008558456, -0.2503906451014651, 0.04618000622738052, 0.12946180265390542, 0.108890759638067, -0.14138031805286536, -0.40009230248302824, 0.10509324704447912, -0.17112337262621402, 0.07090793357079697, -0.11375273208863831, 0.028425699935571567, -0.06422344672783102, -0.2943466729358644, 0.04172768668063941, -0.0010616548416028555, 0.14178825209319995, -0.07982993900549372, -0.09820865278723775, -0.011699266797183333, 0.2460521696714332, 0.0645295572070707, 0.06258229689571906, 0.12428249232974407, -0.25650612881632895, -0.14535804380335518, 0.4271669955370394, -0.03432512673890734, -0.2047596662833884, 0.24438925825902638, -0.03572934421937208, -0.16191583270760807, 0.13177762577259863, 0.25086976793670174, 0.133849523903651, -0.16930611584134198, -0.029391633699698425, -0.10199289959941903, 0.1992759222416459, 0.0453183888042396, -0.0165162756007064, 0.22646096917781727, 0.262560963808131, -0.03811050123233046, 0.11869199662154692, -0.20864346179502744, -0.07641029280855799, -0.15858564286719304, -0.11681136353998571, -0.1683143079557733, -0.07770569808277729, -0.08501367150079081, -0.1354974739907964, 0.4406729246414191, 0.3081941013350277, 0.16950157126663504, 0.06382138172441439, 0.35123362597078084, -0.05514068272203912, 0.10921416703510929, 0.0557085807963803, 0.1895808943446625, -0.08322500261050221, 0.14811924628888232, -0.09835538957897272, 0.030762564852154135, 0.039742490392480345]
|
1,803.04846
|
Quench Dynamics of the Gaudin-Yang Model
|
We study the quench dynamics of one dimensional bosons or fermion quantum
gases with either attractive or repulsive contact interactions. Such systems
are well described by the Gaudin-Yang model which turns out to be quantum
integrable. We use a contour integral approach, the Yudson approach, to expand
initial states in terms of Bethe Ansatz eigenstates of the Hamiltonian. Making
use of the contour, we obtain a complete set of eigenstates, including both
free states and bound states. These states constitute a larger Hilbert space
than described by the standard String hypothesis. We calculate the density and
noise correlations of several quenched systems such as a static or kinetic
impurity evolving in an array of particles.
|
cond-mat.quant-gas nlin.SI
|
we study the quench dynamics of one dimensional bosons or fermion quantum gases with either attractive or repulsive contact interactions such systems are well described by the gaudinyang model which turns out to be quantum integrable we use a contour integral approach the yudson approach to expand initial states in terms of bethe ansatz eigenstates of the hamiltonian making use of the contour we obtain a complete set of eigenstates including both free states and bound states these states constitute a larger hilbert space than described by the standard string hypothesis we calculate the density and noise correlations of several quenched systems such as a static or kinetic impurity evolving in an array of particles
|
[['we', 'study', 'the', 'quench', 'dynamics', 'of', 'one', 'dimensional', 'bosons', 'or', 'fermion', 'quantum', 'gases', 'with', 'either', 'attractive', 'or', 'repulsive', 'contact', 'interactions', 'such', 'systems', 'are', 'well', 'described', 'by', 'the', 'gaudinyang', 'model', 'which', 'turns', 'out', 'to', 'be', 'quantum', 'integrable', 'we', 'use', 'a', 'contour', 'integral', 'approach', 'the', 'yudson', 'approach', 'to', 'expand', 'initial', 'states', 'in', 'terms', 'of', 'bethe', 'ansatz', 'eigenstates', 'of', 'the', 'hamiltonian', 'making', 'use', 'of', 'the', 'contour', 'we', 'obtain', 'a', 'complete', 'set', 'of', 'eigenstates', 'including', 'both', 'free', 'states', 'and', 'bound', 'states', 'these', 'states', 'constitute', 'a', 'larger', 'hilbert', 'space', 'than', 'described', 'by', 'the', 'standard', 'string', 'hypothesis', 'we', 'calculate', 'the', 'density', 'and', 'noise', 'correlations', 'of', 'several', 'quenched', 'systems', 'such', 'as', 'a', 'static', 'or', 'kinetic', 'impurity', 'evolving', 'in', 'an', 'array', 'of', 'particles']]
|
[-0.14916593928861877, 0.20333897895496034, -0.07745666596481739, 0.11721908041964406, 0.014196477101548859, -0.1707645171929313, 0.025224026920192915, 0.3159729695514492, -0.22669082628967968, -0.26471671506600536, 0.061905781890306134, -0.3034757226462597, -0.11173917278849885, 0.14273209133711845, 0.07078685963769323, 0.07604037351582361, 0.07816519549764368, 0.03123948387801647, -0.09850943119305632, -0.2350972911110148, 0.3529493020159071, 0.014757379004731775, 0.22577760341860678, 0.033413025684168804, 0.0880895148517321, 0.060194858702142605, 0.03750643576697811, 0.018668322961362404, -0.11085305879621402, 0.10378996282613472, 0.2023107541380855, 0.033055228665066154, 0.2014172274659833, -0.4432768454046353, -0.22842765995503767, 0.10476611403991347, 0.19037952178522297, 0.1654002208009605, 0.018459310103207827, -0.3485512581208478, -0.04784727854168286, -0.2178376907887666, -0.18961578093712098, -0.1374463923599409, -0.016603446630356105, 0.003560729403777615, -0.2376712776315601, 0.09707168709567708, 0.04929756798842193, 0.0389670766181434, -0.06763320764040817, -0.09258340199923386, -0.011432181410086544, 0.08276318279094994, -0.00626056373078862, 0.006339093818045829, 0.1515824368102071, -0.15603112576044742, -0.11387543996350596, 0.3806342173853646, -0.07959496423452789, -0.2409510090785182, 0.22644593796044912, -0.10228189774586455, -0.08812408131020873, 0.1069071446808622, 0.12550446451439157, 0.10064395388750279, -0.15897037976461909, 0.11802781321343703, -0.025075146528568282, 0.13079413878528967, 0.0255000165015783, 0.059920368424576265, 0.24314004906817624, 0.13712289176233436, 0.05895699410820785, 0.1738333607406315, -0.0436251367037387, -0.17669978064849326, -0.29158478099042956, -0.17117792301375986, -0.23343086939952942, 0.10913863708467587, -0.04086427811669874, -0.23001350710249466, 0.38161797659147695, 0.12383563718100524, 0.20796541000675897, 0.0355084614554906, 0.2110291841500641, 0.1585011768662219, 0.05665704073060466, 0.06723839348161836, 0.19497769577023777, 0.13881764765019003, 0.010750786846746569, -0.21604113719912002, -0.0500695731571835, 0.0976880685163095]
|
1,803.04847
|
Introducing A Public Stereoscopic 3D High Dynamic Range (SHDR) Video
Database
|
High Dynamic Range (HDR) displays and cameras are paving their ways through
the consumer market at a rapid growth rate. Thanks to TV and camera
manufacturers, HDR systems are now becoming available commercially to end
users. This is taking place only a few years after the blooming of 3D video
technologies. MPEG/ITU are also actively working towards the standardization of
these technologies. However, preliminary research efforts in these video
technologies are hammered by the lack of sufficient experimental data. In this
paper, we introduce a Stereoscopic 3D HDR (SHDR) database of videos that is
made publicly available to the research community. We explain the procedure
taken to capture, calibrate, and post-process the videos. In addition, we
provide insights on potential use-cases, challenges, and research
opportunities, implied by the combination of higher dynamic range of the HDR
aspect, and depth impression of the 3D aspect.
|
eess.IV
|
high dynamic range hdr displays and cameras are paving their ways through the consumer market at a rapid growth rate thanks to tv and camera manufacturers hdr systems are now becoming available commercially to end users this is taking place only a few years after the blooming of 3d video technologies mpegitu are also actively working towards the standardization of these technologies however preliminary research efforts in these video technologies are hammered by the lack of sufficient experimental data in this paper we introduce a stereoscopic 3d hdr shdr database of videos that is made publicly available to the research community we explain the procedure taken to capture calibrate and postprocess the videos in addition we provide insights on potential usecases challenges and research opportunities implied by the combination of higher dynamic range of the hdr aspect and depth impression of the 3d aspect
|
[['high', 'dynamic', 'range', 'hdr', 'displays', 'and', 'cameras', 'are', 'paving', 'their', 'ways', 'through', 'the', 'consumer', 'market', 'at', 'a', 'rapid', 'growth', 'rate', 'thanks', 'to', 'tv', 'and', 'camera', 'manufacturers', 'hdr', 'systems', 'are', 'now', 'becoming', 'available', 'commercially', 'to', 'end', 'users', 'this', 'is', 'taking', 'place', 'only', 'a', 'few', 'years', 'after', 'the', 'blooming', 'of', '3d', 'video', 'technologies', 'mpegitu', 'are', 'also', 'actively', 'working', 'towards', 'the', 'standardization', 'of', 'these', 'technologies', 'however', 'preliminary', 'research', 'efforts', 'in', 'these', 'video', 'technologies', 'are', 'hammered', 'by', 'the', 'lack', 'of', 'sufficient', 'experimental', 'data', 'in', 'this', 'paper', 'we', 'introduce', 'a', 'stereoscopic', '3d', 'hdr', 'shdr', 'database', 'of', 'videos', 'that', 'is', 'made', 'publicly', 'available', 'to', 'the', 'research', 'community', 'we', 'explain', 'the', 'procedure', 'taken', 'to', 'capture', 'calibrate', 'and', 'postprocess', 'the', 'videos', 'in', 'addition', 'we', 'provide', 'insights', 'on', 'potential', 'usecases', 'challenges', 'and', 'research', 'opportunities', 'implied', 'by', 'the', 'combination', 'of', 'higher', 'dynamic', 'range', 'of', 'the', 'hdr', 'aspect', 'and', 'depth', 'impression', 'of', 'the', '3d', 'aspect']]
|
[-0.07911327987635496, 0.04742210672538675, -0.037757031414592246, 0.015992831569952026, -0.10520868395245306, -0.14481350291244896, 0.019725795727859343, 0.4575620115977305, -0.23846525161094229, -0.3615796875838243, 0.15387708499034028, -0.28445290477493856, -0.1365010897025571, 0.24769274328022042, -0.1603704089307478, 0.0696027378853358, 0.10942946087149247, -0.011920550728051163, -0.026331620223649686, -0.2766673688819422, 0.26241423601192804, 0.0671153091956717, 0.3361792799190316, 0.08240455797788175, 0.10813542351316871, -0.03477612971885681, -0.11260796419482573, -0.010302759962759808, -0.1400961531869822, 0.18879532771394916, 0.33694264074971136, 0.19392455069177691, 0.3191467384663476, -0.45462106931692275, -0.1998398602959818, 0.017074556734321088, 0.13611991590702197, 0.08219886447703072, -0.10017903386139718, -0.30070527668543895, 0.09029541296136737, -0.21983889131610032, -0.07540458387819866, -0.0787947696628923, 0.022100007510744035, 0.005236683108001082, -0.2528610408870162, -0.004447429003333345, -0.032260542624524685, 0.11357407701778895, -0.06736716332281349, -0.07901618223060185, 0.024444685170007214, 0.23574346096359822, 0.0661479830512331, 0.023353854417276214, 0.1378270847080144, -0.20792015659635965, -0.07042518493302927, 0.4074261266948052, 0.011039082905356313, -0.09589462292472452, 0.19932043704230495, -0.11176657624883761, -0.12516887219373504, 0.13523863135299213, 0.2142001482999136, 0.07338015758432448, -0.20788923471929951, 0.024632073101394116, 0.024962867255991613, 0.16732888741084231, 0.04894353192288127, 0.05068937869099769, 0.2509580820595557, 0.23273725227229822, 0.019697426682220062, 0.1108188042679513, -0.12506642322298664, -0.060193384531885386, -0.19907148663794072, -0.14173814717312933, -0.14650685891417237, -0.02217064477982078, -0.045732075380777094, -0.09570330664335953, 0.3836087791288508, 0.2434725578297192, 0.14799700262234874, 0.031481470273435445, 0.3799182698819262, 0.003056698988280325, 0.10414536256166043, 0.008060408823465122, 0.19653935296933206, -0.009356436647579704, 0.25534598826443855, -0.08714167000053608, 0.055669049770918896, -9.21414778108748e-05]
|
1,803.04848
|
Soft-Robust Actor-Critic Policy-Gradient
|
Robust Reinforcement Learning aims to derive optimal behavior that accounts
for model uncertainty in dynamical systems. However, previous studies have
shown that by considering the worst case scenario, robust policies can be
overly conservative. Our soft-robust framework is an attempt to overcome this
issue. In this paper, we present a novel Soft-Robust Actor-Critic algorithm
(SR-AC). It learns an optimal policy with respect to a distribution over an
uncertainty set and stays robust to model uncertainty but avoids the
conservativeness of robust strategies. We show the convergence of SR-AC and
test the efficiency of our approach on different domains by comparing it
against regular learning methods and their robust formulations.
|
cs.LG cs.AI stat.ML
|
robust reinforcement learning aims to derive optimal behavior that accounts for model uncertainty in dynamical systems however previous studies have shown that by considering the worst case scenario robust policies can be overly conservative our softrobust framework is an attempt to overcome this issue in this paper we present a novel softrobust actorcritic algorithm srac it learns an optimal policy with respect to a distribution over an uncertainty set and stays robust to model uncertainty but avoids the conservativeness of robust strategies we show the convergence of srac and test the efficiency of our approach on different domains by comparing it against regular learning methods and their robust formulations
|
[['robust', 'reinforcement', 'learning', 'aims', 'to', 'derive', 'optimal', 'behavior', 'that', 'accounts', 'for', 'model', 'uncertainty', 'in', 'dynamical', 'systems', 'however', 'previous', 'studies', 'have', 'shown', 'that', 'by', 'considering', 'the', 'worst', 'case', 'scenario', 'robust', 'policies', 'can', 'be', 'overly', 'conservative', 'our', 'softrobust', 'framework', 'is', 'an', 'attempt', 'to', 'overcome', 'this', 'issue', 'in', 'this', 'paper', 'we', 'present', 'a', 'novel', 'softrobust', 'actorcritic', 'algorithm', 'srac', 'it', 'learns', 'an', 'optimal', 'policy', 'with', 'respect', 'to', 'a', 'distribution', 'over', 'an', 'uncertainty', 'set', 'and', 'stays', 'robust', 'to', 'model', 'uncertainty', 'but', 'avoids', 'the', 'conservativeness', 'of', 'robust', 'strategies', 'we', 'show', 'the', 'convergence', 'of', 'srac', 'and', 'test', 'the', 'efficiency', 'of', 'our', 'approach', 'on', 'different', 'domains', 'by', 'comparing', 'it', 'against', 'regular', 'learning', 'methods', 'and', 'their', 'robust', 'formulations']]
|
[-0.07064145918887665, -0.010036567435627064, -0.1195544123162176, 0.09151934867041517, -0.07424950373367728, -0.16978101961197176, 0.08572079997757781, 0.4537160034491637, -0.2626006088728764, -0.3131319429082404, 0.09075275445835683, -0.2169132019593337, -0.18573076922063517, 0.19657186919901626, -0.19373524350888818, 0.106103350282168, 0.06694926767148704, -0.017526546915314186, -0.04894632879627225, -0.2606372533052742, 0.3220141311219641, 0.08443023078143597, 0.33561291579574903, 0.0007554231925266926, 0.12264882342315445, -0.030213646862708103, -0.007143511693646139, 0.04370501499936402, -0.099148839873846, 0.1507077040629479, 0.27208048574817933, 0.17335890707446733, 0.3623507384593799, -0.369001962192287, -0.2256096848330208, 0.12755816872014064, 0.12694929616316875, 0.14108838539605387, -0.03547493777146441, -0.2928426895338485, 0.11028426409934029, -0.20296109831569908, -0.08853371354324796, -0.14589002524789807, -0.027225073583632985, -0.03864921224586422, -0.3295157650990464, 0.05960975636980523, 0.09475796602129997, -0.004551908884754526, -0.08774180255751952, -0.09307792615232484, 0.061843920313039466, 0.10681438173176111, 0.08046910060987433, 0.029077199279008623, 0.10844359963818967, -0.0873188505810903, -0.1666479465273148, 0.3699276393679815, -0.029494073697818427, -0.224424199824043, 0.1940441039057936, -0.025682856389713064, -0.13125311918817809, 0.08972458814044491, 0.22461171457750687, 0.1694830052084594, -0.18797626609644183, 0.04238898166135458, -0.03375581154060141, 0.18640038367604542, -0.038568375118633855, -0.017828510395277327, 0.14786001033732823, 0.2243901092611323, 0.14125390112548022, 0.1422295621193719, -0.044689678628363205, -0.1343271797609942, -0.23798632893328356, -0.0733222951503279, -0.12527585911747313, -0.0337788842696801, -0.09754982325164101, -0.11248849714517585, 0.3474116781291282, 0.272736625140968, 0.1811762164460025, 0.15655738848835996, 0.35163983730512244, 0.10856328426033941, 0.021237610737035905, 0.1196083005378458, 0.2420453694257363, 0.04078026963658979, 0.057012134187019246, -0.2273164179380635, 0.14726439506146255, 0.0035349024964548715]
|
1,803.04849
|
Quantitative theoretical analysis of lifetimes and decay rates relevant
in laser cooling BaH
|
Tiny radiative losses below the 0.1% level can prove ruinous to the effective
laser cooling of a molecule. In this paper the laser cooling of a hydride is
studied with rovibronic detail using ab initio quantum chemistry in order to
document the decays to all possible electronic states (not just the vibrational
branching within a single electronic transition) and to identify the most
populated final quantum states. The effect of spin-orbit and associated
couplings on the properties of the lowest excited states of BaH are analysed in
detail. The lifetimes of the A$^2{\Pi}_{1/2}$, H$^2{\Delta}_{3/2}$ and
E$^2{\Pi}_{1/2}$ states are calculated (136 ns, 5.8 {\mu}s and 46 ns
respectively) for the first time, while the theoretical value for
B$^2{\Sigma}^+_{1/2}$ is in good agreement with experiments. Using a simple
rate model the numbers of absorption-emission cycles possible for both one- and
two-colour cooling on the competing electronic transitions are determined, and
it is clearly demonstrated that the A$^2{\Pi}$ - X$^2{\Sigma}^+$ transition is
superior to B$^2{\Sigma}^+$ - X$^2{\Sigma}^+$, where multiple tiny decay
channels degrade its efficiency. Further possible improvements to the cooling
method are proposed.
|
physics.chem-ph physics.atom-ph
|
tiny radiative losses below the 01 level can prove ruinous to the effective laser cooling of a molecule in this paper the laser cooling of a hydride is studied with rovibronic detail using ab initio quantum chemistry in order to document the decays to all possible electronic states not just the vibrational branching within a single electronic transition and to identify the most populated final quantum states the effect of spinorbit and associated couplings on the properties of the lowest excited states of bah are analysed in detail the lifetimes of the a2pi_12 h2delta_32 and e2pi_12 states are calculated 136 ns 58 mus and 46 ns respectively for the first time while the theoretical value for b2sigma_12 is in good agreement with experiments using a simple rate model the numbers of absorptionemission cycles possible for both one and twocolour cooling on the competing electronic transitions are determined and it is clearly demonstrated that the a2pi x2sigma transition is superior to b2sigma x2sigma where multiple tiny decay channels degrade its efficiency further possible improvements to the cooling method are proposed
|
[['tiny', 'radiative', 'losses', 'below', 'the', '01', 'level', 'can', 'prove', 'ruinous', 'to', 'the', 'effective', 'laser', 'cooling', 'of', 'a', 'molecule', 'in', 'this', 'paper', 'the', 'laser', 'cooling', 'of', 'a', 'hydride', 'is', 'studied', 'with', 'rovibronic', 'detail', 'using', 'ab', 'initio', 'quantum', 'chemistry', 'in', 'order', 'to', 'document', 'the', 'decays', 'to', 'all', 'possible', 'electronic', 'states', 'not', 'just', 'the', 'vibrational', 'branching', 'within', 'a', 'single', 'electronic', 'transition', 'and', 'to', 'identify', 'the', 'most', 'populated', 'final', 'quantum', 'states', 'the', 'effect', 'of', 'spinorbit', 'and', 'associated', 'couplings', 'on', 'the', 'properties', 'of', 'the', 'lowest', 'excited', 'states', 'of', 'bah', 'are', 'analysed', 'in', 'detail', 'the', 'lifetimes', 'of', 'the', 'a2pi_12', 'h2delta_32', 'and', 'e2pi_12', 'states', 'are', 'calculated', '136', 'ns', '58', 'mus', 'and', '46', 'ns', 'respectively', 'for', 'the', 'first', 'time', 'while', 'the', 'theoretical', 'value', 'for', 'b2sigma_12', 'is', 'in', 'good', 'agreement', 'with', 'experiments', 'using', 'a', 'simple', 'rate', 'model', 'the', 'numbers', 'of', 'absorptionemission', 'cycles', 'possible', 'for', 'both', 'one', 'and', 'twocolour', 'cooling', 'on', 'the', 'competing', 'electronic', 'transitions', 'are', 'determined', 'and', 'it', 'is', 'clearly', 'demonstrated', 'that', 'the', 'a2pi', 'x2sigma', 'transition', 'is', 'superior', 'to', 'b2sigma', 'x2sigma', 'where', 'multiple', 'tiny', 'decay', 'channels', 'degrade', 'its', 'efficiency', 'further', 'possible', 'improvements', 'to', 'the', 'cooling', 'method', 'are', 'proposed']]
|
[-0.0907079777128026, 0.19547970889570107, -0.003778946683847938, 0.05482335464098882, 0.02049837888493626, -0.11493648429644633, 0.1093012627111007, 0.39337353607301007, -0.22850433400030437, -0.3025463776049781, 0.03732478066839659, -0.3024063407845626, -0.032974954885007304, 0.19037094128990165, 0.04046125864657701, 0.048851203438309974, 0.05538943731384775, 0.018541016547136347, -0.05565706456499439, -0.20954935389983637, 0.2465792791666569, 0.06449335335293488, 0.2530179434860739, 0.09797305631350768, 0.04682665688927624, -0.0845449772737497, 0.07814760646380653, -0.052156186424492094, -0.12911320732932421, 0.06910332227099306, 0.23779973211375446, 0.03492002862516198, 0.20736232932276008, -0.4193439102117819, -0.1743531165193417, 0.0638147212097961, 0.13600603356131946, 0.12288126926498742, -0.025750842971898568, -0.27555301460564474, 0.07191224893375131, -0.14640466347918846, -0.0820655730785802, -0.09759644758146764, 0.033492526337795425, -0.0014499976377092853, -0.2550416757717771, 0.08038700606712981, -0.009210979616248303, 0.027714270219968803, -0.08333426346639912, -0.1538395620856053, -0.06386861467564647, 0.10480671899329702, -0.0036457457350810396, 0.032538648727330095, 0.158366672239605, -0.11036565021574708, -0.12119752934879878, 0.4137310739606619, -0.08617088064585748, -0.09499231512993654, 0.18202347906282573, -0.1639361536912144, -0.10205832741286774, 0.19684130989216184, 0.0950291755254346, 0.1346924631401304, -0.12229461930903861, 0.026224093247781802, 0.03765431380915371, 0.1818316903491822, 0.06287690049132587, 0.08948766097087586, 0.16313549565066668, 0.17588950863732447, -0.029111596907817082, 0.12310131543728692, -0.13016128519170292, -0.12126731413941756, -0.2582152330806738, -0.15054871729543348, -0.16890665174221134, 0.04775012935789908, -0.017663461997058635, -0.11224663386184891, 0.41810560031180183, 0.12695276330553248, 0.17503325078657575, -0.00880687830960431, 0.2828991755536249, 0.12440662246345627, 0.030164591639979997, 0.04447192086610647, 0.3030295806582382, 0.1675174796943214, 0.04601816422522957, -0.31057261886202137, 0.0532389941720546, -0.03330778112814931]
|
1,803.0485
|
Three-dimensional Imaging for Large LArTPCs
|
High-performance event reconstruction is critical for current and future
massive liquid argon time projection chambers (LArTPCs) to realize their full
scientific potential. LArTPCs with readout using wire planes provide a limited
number of 2D projections. In general, without a pixel-type readout it is
challenging to achieve unambiguous 3D event reconstruction. As a remedy, we
present a novel 3D imaging method, Wire-Cell, which incorporates the charge and
sparsity information in addition to the time and geometry through simple and
robust mathematics. The resulting 3D image of ionization density provides an
excellent starting point for further reconstruction and enables the true power
of 3D tracking calorimetry in LArTPCs.
|
physics.ins-det hep-ex nucl-ex
|
highperformance event reconstruction is critical for current and future massive liquid argon time projection chambers lartpcs to realize their full scientific potential lartpcs with readout using wire planes provide a limited number of 2d projections in general without a pixeltype readout it is challenging to achieve unambiguous 3d event reconstruction as a remedy we present a novel 3d imaging method wirecell which incorporates the charge and sparsity information in addition to the time and geometry through simple and robust mathematics the resulting 3d image of ionization density provides an excellent starting point for further reconstruction and enables the true power of 3d tracking calorimetry in lartpcs
|
[['highperformance', 'event', 'reconstruction', 'is', 'critical', 'for', 'current', 'and', 'future', 'massive', 'liquid', 'argon', 'time', 'projection', 'chambers', 'lartpcs', 'to', 'realize', 'their', 'full', 'scientific', 'potential', 'lartpcs', 'with', 'readout', 'using', 'wire', 'planes', 'provide', 'a', 'limited', 'number', 'of', '2d', 'projections', 'in', 'general', 'without', 'a', 'pixeltype', 'readout', 'it', 'is', 'challenging', 'to', 'achieve', 'unambiguous', '3d', 'event', 'reconstruction', 'as', 'a', 'remedy', 'we', 'present', 'a', 'novel', '3d', 'imaging', 'method', 'wirecell', 'which', 'incorporates', 'the', 'charge', 'and', 'sparsity', 'information', 'in', 'addition', 'to', 'the', 'time', 'and', 'geometry', 'through', 'simple', 'and', 'robust', 'mathematics', 'the', 'resulting', '3d', 'image', 'of', 'ionization', 'density', 'provides', 'an', 'excellent', 'starting', 'point', 'for', 'further', 'reconstruction', 'and', 'enables', 'the', 'true', 'power', 'of', '3d', 'tracking', 'calorimetry', 'in', 'lartpcs']]
|
[-0.05093711758336912, 0.03865157804676318, -0.044278053629498645, 0.008848533609684987, -0.04720608997516907, -0.16554603791938952, 0.0016112516996844744, 0.39926656940951943, -0.2373117957210455, -0.3534382551666707, 0.10740918247141124, -0.2597708478301334, -0.08842789381742477, 0.2024627134266596, -0.08079015486873686, 0.13621860027957994, 0.09132201703211579, -0.03329881005041758, -0.16783040297853474, -0.18390073459774542, 0.19803009392881693, 0.12490123851994912, 0.33621139189479154, 0.03417982689391535, 0.18034458103983736, 0.04855794351449451, -0.0628068704256573, 0.02149989147661612, -0.09610173934057596, 0.0921694205093305, 0.31774232400214086, 0.14041932487788683, 0.19776690694002005, -0.49819176475732374, -0.18707024290163715, 0.05909124672269592, 0.14736244001855645, 0.1301711746317988, -0.16401920319185592, -0.28772282741892224, 0.058505292105949666, -0.1473859958529759, -0.11407369016132389, -0.11785542300472465, -0.026953044795216277, -0.027694034685947163, -0.2826125449590528, 0.06460938062697935, 0.018084349742051788, 0.03381917588950063, -0.0414963397779502, -0.032639801492153384, 0.03609857570756084, 0.14941643678601116, -0.06138980755797373, 0.09463066843118913, 0.14584043866936833, -0.16547488637017801, -0.11164301385109027, 0.3589546227326187, 0.002381562857548348, -0.21772051721703833, 0.2117202362502352, -0.15123651240719482, -0.06029029104460138, 0.20284582601072124, 0.19938896082805094, 0.09357189285443522, -0.1592867309563399, 0.053322615340920705, 0.007264564497745596, 0.15613868514600865, 0.03309260458403374, 0.03785966506704706, 0.2413823539032959, 0.274662932499688, 0.128961920299424, 0.0922678139177151, -0.22543486288766593, -0.022347959094286825, -0.27316509279458284, -0.24555430721151283, -0.18293855753010854, 0.003956837736320897, -0.06093201706509997, -0.1962613738500155, 0.4249730761736058, 0.18275610989523836, 0.1564656930232349, -0.007555240020827534, 0.38378359810807383, 0.052715275757901296, 0.06130895972959339, 0.0027633989319348564, 0.20393692496509175, 0.09406227935463764, 0.15296103671873704, -0.19771795700832556, 0.025647287398057345, 0.06408688583850072]
|
1,803.04851
|
Reaction rate theory for supramolecular kinetics: application to protein
aggregation
|
Probing the reaction mechanisms of supramolecular processes in soft- and
biological matter, such as protein aggregation, is inherently challenging.
These processes emerge from the simultaneous action of multiple molecular
mechanisms, each of which is associated with the rearrangement of a large
number of weak bonds, resulting in a complex free energy landscape with many
kinetic barriers. Reaction rate measurements of supramolecular processes at
different temperatures can offer unprecedented insights into the underlying
molecular mechanisms and their thermodynamic properties. However, to be able to
interpret such measurements in terms of the underlying microscopic mechanisms,
a key challenge is to establish which properties of the complex free energy
landscapes are probed by the reaction rate. Here, we present a reaction rate
theory for supramolecular kinetics based on Kramers rate theory for diffusive
reactions over multiple kinetic barriers, and apply the results to protein
aggregation. Using this framework and Monte Carlo simulations, we show that
reaction rates for protein aggregation are of the Arrhenius-Eyring type and
that the associated activation energies probe only one relevant barrier along
the respective free energy landscapes. We apply this advancement to interpret,
both in experiments and in coarse-grained computer simulations, reaction rate
measurements of amyloid aggregation kinetics in terms of the underlying
molecular mechanisms and associated thermodynamic signatures. Our results
establish a general platform for probing the mechanisms and energetics of
supramolecular phenomena in soft- and biological matter using the framework of
chemical kinetics.
|
physics.bio-ph q-bio.BM
|
probing the reaction mechanisms of supramolecular processes in soft and biological matter such as protein aggregation is inherently challenging these processes emerge from the simultaneous action of multiple molecular mechanisms each of which is associated with the rearrangement of a large number of weak bonds resulting in a complex free energy landscape with many kinetic barriers reaction rate measurements of supramolecular processes at different temperatures can offer unprecedented insights into the underlying molecular mechanisms and their thermodynamic properties however to be able to interpret such measurements in terms of the underlying microscopic mechanisms a key challenge is to establish which properties of the complex free energy landscapes are probed by the reaction rate here we present a reaction rate theory for supramolecular kinetics based on kramers rate theory for diffusive reactions over multiple kinetic barriers and apply the results to protein aggregation using this framework and monte carlo simulations we show that reaction rates for protein aggregation are of the arrheniuseyring type and that the associated activation energies probe only one relevant barrier along the respective free energy landscapes we apply this advancement to interpret both in experiments and in coarsegrained computer simulations reaction rate measurements of amyloid aggregation kinetics in terms of the underlying molecular mechanisms and associated thermodynamic signatures our results establish a general platform for probing the mechanisms and energetics of supramolecular phenomena in soft and biological matter using the framework of chemical kinetics
|
[['probing', 'the', 'reaction', 'mechanisms', 'of', 'supramolecular', 'processes', 'in', 'soft', 'and', 'biological', 'matter', 'such', 'as', 'protein', 'aggregation', 'is', 'inherently', 'challenging', 'these', 'processes', 'emerge', 'from', 'the', 'simultaneous', 'action', 'of', 'multiple', 'molecular', 'mechanisms', 'each', 'of', 'which', 'is', 'associated', 'with', 'the', 'rearrangement', 'of', 'a', 'large', 'number', 'of', 'weak', 'bonds', 'resulting', 'in', 'a', 'complex', 'free', 'energy', 'landscape', 'with', 'many', 'kinetic', 'barriers', 'reaction', 'rate', 'measurements', 'of', 'supramolecular', 'processes', 'at', 'different', 'temperatures', 'can', 'offer', 'unprecedented', 'insights', 'into', 'the', 'underlying', 'molecular', 'mechanisms', 'and', 'their', 'thermodynamic', 'properties', 'however', 'to', 'be', 'able', 'to', 'interpret', 'such', 'measurements', 'in', 'terms', 'of', 'the', 'underlying', 'microscopic', 'mechanisms', 'a', 'key', 'challenge', 'is', 'to', 'establish', 'which', 'properties', 'of', 'the', 'complex', 'free', 'energy', 'landscapes', 'are', 'probed', 'by', 'the', 'reaction', 'rate', 'here', 'we', 'present', 'a', 'reaction', 'rate', 'theory', 'for', 'supramolecular', 'kinetics', 'based', 'on', 'kramers', 'rate', 'theory', 'for', 'diffusive', 'reactions', 'over', 'multiple', 'kinetic', 'barriers', 'and', 'apply', 'the', 'results', 'to', 'protein', 'aggregation', 'using', 'this', 'framework', 'and', 'monte', 'carlo', 'simulations', 'we', 'show', 'that', 'reaction', 'rates', 'for', 'protein', 'aggregation', 'are', 'of', 'the', 'arrheniuseyring', 'type', 'and', 'that', 'the', 'associated', 'activation', 'energies', 'probe', 'only', 'one', 'relevant', 'barrier', 'along', 'the', 'respective', 'free', 'energy', 'landscapes', 'we', 'apply', 'this', 'advancement', 'to', 'interpret', 'both', 'in', 'experiments', 'and', 'in', 'coarsegrained', 'computer', 'simulations', 'reaction', 'rate', 'measurements', 'of', 'amyloid', 'aggregation', 'kinetics', 'in', 'terms', 'of', 'the', 'underlying', 'molecular', 'mechanisms', 'and', 'associated', 'thermodynamic', 'signatures', 'our', 'results', 'establish', 'a', 'general', 'platform', 'for', 'probing', 'the', 'mechanisms', 'and', 'energetics', 'of', 'supramolecular', 'phenomena', 'in', 'soft', 'and', 'biological', 'matter', 'using', 'the', 'framework', 'of', 'chemical', 'kinetics']]
|
[-0.08884339244894178, 0.15499255188417194, -0.07229056261490707, 0.08465807266006546, -0.010620786909554628, -0.10458917603867476, 0.06164399090161847, 0.36572699001753484, -0.3333987932695644, -0.28951490277392883, 0.017520961880987763, -0.2269399877503451, -0.16374094687181256, 0.19921783720373998, 0.06030078857576759, 0.04496620547113214, 0.05577804224557733, -0.021360891128513346, 0.019586228795144392, -0.16288259177926487, 0.2830979709900221, 0.11526417045092399, 0.27685055769861566, 0.13058566598426866, 0.11195223221073906, -0.023377689275440712, -0.005715465406942481, -0.026659335088679344, -0.20164861240241946, 0.15112459788126556, 0.27069842806520034, 0.0742600377889792, 0.22210006499381824, -0.5092990492091719, -0.28556962684290166, 0.08685975707278161, 0.13630029226463855, 0.14428571915605215, -0.07868171096986586, -0.20249203304953525, 0.06814243520365365, -0.13066917526835609, -0.09653813328586076, -0.09653075048759169, -0.022697088493121062, 0.10549396728668599, -0.24878289439257675, 0.12268841191554063, -0.0011219020778267896, 0.05584057217455959, -0.12650041343245688, -0.09006272653715637, -0.05320219071562228, 0.13401277184139115, 0.043769732895563754, -0.030866278578395072, 0.23298025983819834, -0.1553092494341091, -0.16157117294408066, 0.4001022018452759, -0.00838569457488829, -0.17588672303926137, 0.2750099037914, -0.10525669785358517, -0.16889482504940764, 0.1963817298972695, 0.16499213196368792, 0.12337080773826437, -0.21423164966824007, 0.0594557205240254, 0.06522698085991886, 0.1408954033809635, 0.04060011421294757, 0.055048700705440955, 0.1829074107177587, 0.21823361244494632, -0.009934340856458314, 0.10305461592299438, -0.07397536838292026, -0.1897346015182971, -0.25415928595772375, -0.18547371319313613, -0.1352070139373763, 0.08944719231004779, -0.08891353146630582, -0.13054799869798628, 0.35872772744051734, 0.1163772224375615, 0.2171402342589888, 0.022269829824543164, 0.24122234749986585, 0.051490636414678576, 0.05617209366360932, -0.025206072789210415, 0.18985608074679908, 0.12289792465310449, 0.08399244728922386, -0.25711545824976956, 0.12042881172176025, 0.02959526106281111]
|
1,803.04852
|
Local optimality of Zaks-Perles-Wills simplices
|
In 1982, Zaks, Perles and Wills discovered a d-dimensional lattice simplex
S_{d,k} with k interior lattice points, whose volume is linear in k and doubly
exponential in the dimension d. It is conjectured that, for all d \ge 3 and k
\ge 1, the simplex S_{d,k} is a volume maximizer in the family P^d(k) of all
d-dimensional lattice polytopes with k interior lattice points. To obtain a
partial confirmation of this conjecture, one can try to verify it for a
subfamily of P^d(k) that naturally contains S_{d,k} as one of the members.
Currently, one does not even know whether S_{d,k} is optimal within the family
S^d(k) of all d-dimensional lattice simplices with k interior lattice points.
In view of this, it makes sense to look at even narrower families, for example,
some subfamilies of S^d(k). The simplex S_{d,k} of Zaks, Perles and Wills has a
facet with only one lattice point in the relative interior. We show that
S_{d,k} is a volume maximizer in the family of simplices S \in S^d(k) that have
a facet with one lattice point in its relative interior. We also show that, in
the above family, the volume maximizer is unique up to unimodular
transformations.
|
math.CO math.AG math.MG math.OC
|
in 1982 zaks perles and wills discovered a ddimensional lattice simplex s_dk with k interior lattice points whose volume is linear in k and doubly exponential in the dimension d it is conjectured that for all d ge 3 and k ge 1 the simplex s_dk is a volume maximizer in the family pdk of all ddimensional lattice polytopes with k interior lattice points to obtain a partial confirmation of this conjecture one can try to verify it for a subfamily of pdk that naturally contains s_dk as one of the members currently one does not even know whether s_dk is optimal within the family sdk of all ddimensional lattice simplices with k interior lattice points in view of this it makes sense to look at even narrower families for example some subfamilies of sdk the simplex s_dk of zaks perles and wills has a facet with only one lattice point in the relative interior we show that s_dk is a volume maximizer in the family of simplices s in sdk that have a facet with one lattice point in its relative interior we also show that in the above family the volume maximizer is unique up to unimodular transformations
|
[['in', '1982', 'zaks', 'perles', 'and', 'wills', 'discovered', 'a', 'ddimensional', 'lattice', 'simplex', 's_dk', 'with', 'k', 'interior', 'lattice', 'points', 'whose', 'volume', 'is', 'linear', 'in', 'k', 'and', 'doubly', 'exponential', 'in', 'the', 'dimension', 'd', 'it', 'is', 'conjectured', 'that', 'for', 'all', 'd', 'ge', '3', 'and', 'k', 'ge', '1', 'the', 'simplex', 's_dk', 'is', 'a', 'volume', 'maximizer', 'in', 'the', 'family', 'pdk', 'of', 'all', 'ddimensional', 'lattice', 'polytopes', 'with', 'k', 'interior', 'lattice', 'points', 'to', 'obtain', 'a', 'partial', 'confirmation', 'of', 'this', 'conjecture', 'one', 'can', 'try', 'to', 'verify', 'it', 'for', 'a', 'subfamily', 'of', 'pdk', 'that', 'naturally', 'contains', 's_dk', 'as', 'one', 'of', 'the', 'members', 'currently', 'one', 'does', 'not', 'even', 'know', 'whether', 's_dk', 'is', 'optimal', 'within', 'the', 'family', 'sdk', 'of', 'all', 'ddimensional', 'lattice', 'simplices', 'with', 'k', 'interior', 'lattice', 'points', 'in', 'view', 'of', 'this', 'it', 'makes', 'sense', 'to', 'look', 'at', 'even', 'narrower', 'families', 'for', 'example', 'some', 'subfamilies', 'of', 'sdk', 'the', 'simplex', 's_dk', 'of', 'zaks', 'perles', 'and', 'wills', 'has', 'a', 'facet', 'with', 'only', 'one', 'lattice', 'point', 'in', 'the', 'relative', 'interior', 'we', 'show', 'that', 's_dk', 'is', 'a', 'volume', 'maximizer', 'in', 'the', 'family', 'of', 'simplices', 's', 'in', 'sdk', 'that', 'have', 'a', 'facet', 'with', 'one', 'lattice', 'point', 'in', 'its', 'relative', 'interior', 'we', 'also', 'show', 'that', 'in', 'the', 'above', 'family', 'the', 'volume', 'maximizer', 'is', 'unique', 'up', 'to', 'unimodular', 'transformations']]
|
[-0.1241493842471391, 0.0974883525268524, -0.05861463654553518, 0.00449526691576466, -0.057983508002944294, -0.16755276147276163, 0.08715373589948286, 0.3298043338803109, -0.27824253924191, -0.20240073155844585, 0.13409433682536473, -0.34252312244731004, -0.13333152973093093, 0.13302935817511752, -0.08187111028586515, 0.021118664154491852, 0.035916639126371594, 0.08915894567035139, -0.050984763129381466, -0.3295685987966135, 0.30101806472986936, -0.04552217081654817, 0.18173864340060392, 0.053390412055014165, 0.08599593335064128, 0.0026417984170257116, 0.06885152732022107, 0.05933677536435425, -0.18394658447450637, 0.12022638937924057, 0.2332675764162559, 0.12194186358363368, 0.23549786161864175, -0.3017561671650037, -0.17994016421609557, 0.15700146093498915, 0.09013784854396363, 0.06803709147498012, 0.0010483531001955271, -0.1770765838236548, 0.14571919711772352, -0.09889495141338557, -0.21438875891268253, -0.04916118599241599, 0.08451520482311026, -0.034481111853383484, -0.2649431169196032, -0.0001311433700902853, 0.11277203393554373, 0.06880789231392555, -0.004479098762967624, -0.18332727207336574, -0.06448503599094693, 0.05502583854540717, -0.032996416001115, 0.09282666358194547, 0.02379183595185168, -0.0515927024614939, -0.11689625124970916, 0.41441505955182945, -0.026821341402828693, -0.19741436589305522, 0.1600535265961662, -0.2190308237541467, -0.13945010873372665, 0.17009728009812533, 0.10314435404725372, 0.12740573921008036, -0.10181811010465026, 0.16815645142341965, -0.15118412551935762, 0.12442157615820179, 0.13515459724352696, 0.0006895078078377992, 0.18093936317134648, 0.10731371419940842, 0.1486195325839799, 0.14548605088028124, -0.035481698226649316, -0.09928797085420228, -0.3054043954098597, -0.1930359825177584, -0.2222930922283558, 0.09891731044866901, -0.13003273780617747, -0.19098314412869513, 0.29793175694707313, 0.06062756738858297, 0.19874080894049256, 0.0375868452450959, 0.168964927457273, 0.01177190923539456, 0.06121763781411573, 0.1376540612424651, 0.15054530836016056, 0.09605722444830463, -0.005983978882431984, -0.1594826470152475, 0.004055386770924088, 0.16180832247715443]
|
1,803.04853
|
Regularized Bidimensional Estimation of the Hazard Rate
|
In epidemiological or demographic studies, with variable age at onset, a typical quantity of interest is the incidence of a disease (for example the cancer incidence). In these studies, the individuals are usually highly heterogeneous in terms of dates of birth (the cohort) and with respect to the calendar time (the period) and appropriate estimation methods are needed. In this article a new estimation method is presented which extends classical age-period-cohort analysis by allowing interactions between age, period and cohort effects. This paper introduces a bidimensional regularized estimate of the hazard rate where a penalty is introduced on the likelihood of the model. This penalty can be designed either to smooth the hazard rate or to enforce consecutive values of the hazard to be equal, leading to a parsimonious representation of the hazard rate. In the latter case, we make use of an iterative penalized likelihood scheme to approximate the L0 norm, which makes the computation tractable. The method is evaluated on simulated data and applied on breast cancer survival data from the SEER program.
|
math.ST stat.AP stat.ME stat.TH
|
in epidemiological or demographic studies with variable age at onset a typical quantity of interest is the incidence of a disease for example the cancer incidence in these studies the individuals are usually highly heterogeneous in terms of dates of birth the cohort and with respect to the calendar time the period and appropriate estimation methods are needed in this article a new estimation method is presented which extends classical ageperiodcohort analysis by allowing interactions between age period and cohort effects this paper introduces a bidimensional regularized estimate of the hazard rate where a penalty is introduced on the likelihood of the model this penalty can be designed either to smooth the hazard rate or to enforce consecutive values of the hazard to be equal leading to a parsimonious representation of the hazard rate in the latter case we make use of an iterative penalized likelihood scheme to approximate the l0 norm which makes the computation tractable the method is evaluated on simulated data and applied on breast cancer survival data from the seer program
|
[['in', 'epidemiological', 'or', 'demographic', 'studies', 'with', 'variable', 'age', 'at', 'onset', 'a', 'typical', 'quantity', 'of', 'interest', 'is', 'the', 'incidence', 'of', 'a', 'disease', 'for', 'example', 'the', 'cancer', 'incidence', 'in', 'these', 'studies', 'the', 'individuals', 'are', 'usually', 'highly', 'heterogeneous', 'in', 'terms', 'of', 'dates', 'of', 'birth', 'the', 'cohort', 'and', 'with', 'respect', 'to', 'the', 'calendar', 'time', 'the', 'period', 'and', 'appropriate', 'estimation', 'methods', 'are', 'needed', 'in', 'this', 'article', 'a', 'new', 'estimation', 'method', 'is', 'presented', 'which', 'extends', 'classical', 'ageperiodcohort', 'analysis', 'by', 'allowing', 'interactions', 'between', 'age', 'period', 'and', 'cohort', 'effects', 'this', 'paper', 'introduces', 'a', 'bidimensional', 'regularized', 'estimate', 'of', 'the', 'hazard', 'rate', 'where', 'a', 'penalty', 'is', 'introduced', 'on', 'the', 'likelihood', 'of', 'the', 'model', 'this', 'penalty', 'can', 'be', 'designed', 'either', 'to', 'smooth', 'the', 'hazard', 'rate', 'or', 'to', 'enforce', 'consecutive', 'values', 'of', 'the', 'hazard', 'to', 'be', 'equal', 'leading', 'to', 'a', 'parsimonious', 'representation', 'of', 'the', 'hazard', 'rate', 'in', 'the', 'latter', 'case', 'we', 'make', 'use', 'of', 'an', 'iterative', 'penalized', 'likelihood', 'scheme', 'to', 'approximate', 'the', 'l0', 'norm', 'which', 'makes', 'the', 'computation', 'tractable', 'the', 'method', 'is', 'evaluated', 'on', 'simulated', 'data', 'and', 'applied', 'on', 'breast', 'cancer', 'survival', 'data', 'from', 'the', 'seer', 'program']]
|
[-0.061648323026352696, 0.041878144613749876, -0.08468921518934491, 0.09350123727627631, -0.08381193986162544, -0.13022711933191333, 0.07857524941209704, 0.3701258259958455, -0.23942574842699937, -0.28096115121252035, 0.16251546902049865, -0.25034745687884946, -0.14473901516258983, 0.18714793909474142, -0.13785952587462297, 0.05818445264436637, 0.07426849296249981, 0.058266102187335495, -0.030483215568321093, -0.2861374753128205, 0.2904609598911234, 0.06872356479189226, 0.2701279406462397, -0.006217471991798707, 0.0807854799992804, 0.029019176422485284, -0.07400302600281845, -0.012341337991612298, -0.1216537926266236, 0.14583227565645107, 0.2956650201550552, 0.1875186828364219, 0.34892505326707446, -0.38295408469890907, -0.19845836001315287, 0.13354584549686738, 0.11416031003530537, 0.09446315636725298, 0.02617782524903305, -0.2538372386978673, 0.014723689166296806, -0.19113671530038118, -0.10157941246405244, -0.016012880192803485, -0.0057703604150031295, 0.024236463843179602, -0.371609939496432, 0.14024236552284233, -0.016789495303694692, 0.10305450186798615, -0.05858190778908985, -0.12727943755752807, 0.0022802825990532126, 0.11001605595861162, 0.1355474504875019, 0.038516679306381515, 0.09872156963018434, -0.09716221220126109, -0.08377476029896311, 0.32716502756944726, -0.03519523050103869, -0.20743065143403197, 0.1768400114402175, -0.11750070694035718, -0.09393488907122187, 0.13145110878561225, 0.2311740062678499, 0.12982629880808028, -0.19049994346486138, 0.008125047932511995, 0.01554889873202358, 0.15096690976460064, 0.044939045339290586, -0.06276315807497927, 0.15457060516745386, 0.20680112303899867, 0.06605860352682481, 0.10815306857095233, -0.15192607087615345, -0.08723884564957449, -0.25703724086417684, -0.13314742566618537, -0.1611826760268637, -0.0034366581608940446, -0.1089912746563953, -0.19153979113591568, 0.39665483952572683, 0.1614991476050844, 0.17466029021356788, 0.09379407514019736, 0.28875948914326727, 0.10488624411502055, 0.07419339374722247, 0.02557417954052133, 0.16549321444439036, 0.10019914096038389, 0.05406261113073144, -0.23254940723202058, 0.17780393228600067, 0.03927933292463422]
|
1,803.04854
|
M101: Spectral Observations of HII Regions and Their Physical Properties
|
By using the Hectospec 6.5 m Multiple Mirror Telescope (MMT) and the 2.16 m
telescope of National Astronomical Observatories, Chinese Academy of Sciences
(NAOC), we obtained 188 high signal-to-noise ratio (S/N) spectra of HII regions
in the nearby galaxy M101, which are the largest spectroscopic sample of HII
regions for this galaxy so far. These spectra cover a wide range of regions on
M101, which enables us to analyze two dimensional distributions of its physical
properties. The physical parameters are derived from emission lines or stellar
continuum, including stellar population age, electron temperature, oxygen
abundance and etc. The oxygen abundances are derived using two empirical
methods based on O3N2 and R$_{23}$ indicators, as well as the direct Te method
when OIII$\lambda4363$ is available. By applying the harmonic decomposition
analysis to the velocity field, we obtained line-of-sight rotation velocity of
71 km s$^{-1}$ and a position angle of 36 degree. The stellar age profile shows
an old stellar population in galaxy center and a relative young stellar
population in outer regions, suggesting an old bulge and a young disk. Oxygen
abundance profile exhibits a clear break at $\sim$18 kpc, with a gradient of
$-$0.0364 dex kpc$^{-1}$ in the inner region and $-$0.00686 dex kpc$^{-1}$ in
the outer region. Our results agree with the "inside-out" disk growth scenario
of M101.
|
astro-ph.GA
|
by using the hectospec 65 m multiple mirror telescope mmt and the 216 m telescope of national astronomical observatories chinese academy of sciences naoc we obtained 188 high signaltonoise ratio sn spectra of hii regions in the nearby galaxy m101 which are the largest spectroscopic sample of hii regions for this galaxy so far these spectra cover a wide range of regions on m101 which enables us to analyze two dimensional distributions of its physical properties the physical parameters are derived from emission lines or stellar continuum including stellar population age electron temperature oxygen abundance and etc the oxygen abundances are derived using two empirical methods based on o3n2 and r_23 indicators as well as the direct te method when oiiilambda4363 is available by applying the harmonic decomposition analysis to the velocity field we obtained lineofsight rotation velocity of 71 km s1 and a position angle of 36 degree the stellar age profile shows an old stellar population in galaxy center and a relative young stellar population in outer regions suggesting an old bulge and a young disk oxygen abundance profile exhibits a clear break at sim18 kpc with a gradient of 00364 dex kpc1 in the inner region and 000686 dex kpc1 in the outer region our results agree with the insideout disk growth scenario of m101
|
[['by', 'using', 'the', 'hectospec', '65', 'm', 'multiple', 'mirror', 'telescope', 'mmt', 'and', 'the', '216', 'm', 'telescope', 'of', 'national', 'astronomical', 'observatories', 'chinese', 'academy', 'of', 'sciences', 'naoc', 'we', 'obtained', '188', 'high', 'signaltonoise', 'ratio', 'sn', 'spectra', 'of', 'hii', 'regions', 'in', 'the', 'nearby', 'galaxy', 'm101', 'which', 'are', 'the', 'largest', 'spectroscopic', 'sample', 'of', 'hii', 'regions', 'for', 'this', 'galaxy', 'so', 'far', 'these', 'spectra', 'cover', 'a', 'wide', 'range', 'of', 'regions', 'on', 'm101', 'which', 'enables', 'us', 'to', 'analyze', 'two', 'dimensional', 'distributions', 'of', 'its', 'physical', 'properties', 'the', 'physical', 'parameters', 'are', 'derived', 'from', 'emission', 'lines', 'or', 'stellar', 'continuum', 'including', 'stellar', 'population', 'age', 'electron', 'temperature', 'oxygen', 'abundance', 'and', 'etc', 'the', 'oxygen', 'abundances', 'are', 'derived', 'using', 'two', 'empirical', 'methods', 'based', 'on', 'o3n2', 'and', 'r_23', 'indicators', 'as', 'well', 'as', 'the', 'direct', 'te', 'method', 'when', 'oiiilambda4363', 'is', 'available', 'by', 'applying', 'the', 'harmonic', 'decomposition', 'analysis', 'to', 'the', 'velocity', 'field', 'we', 'obtained', 'lineofsight', 'rotation', 'velocity', 'of', '71', 'km', 's1', 'and', 'a', 'position', 'angle', 'of', '36', 'degree', 'the', 'stellar', 'age', 'profile', 'shows', 'an', 'old', 'stellar', 'population', 'in', 'galaxy', 'center', 'and', 'a', 'relative', 'young', 'stellar', 'population', 'in', 'outer', 'regions', 'suggesting', 'an', 'old', 'bulge', 'and', 'a', 'young', 'disk', 'oxygen', 'abundance', 'profile', 'exhibits', 'a', 'clear', 'break', 'at', 'sim18', 'kpc', 'with', 'a', 'gradient', 'of', '00364', 'dex', 'kpc1', 'in', 'the', 'inner', 'region', 'and', '000686', 'dex', 'kpc1', 'in', 'the', 'outer', 'region', 'our', 'results', 'agree', 'with', 'the', 'insideout', 'disk', 'growth', 'scenario', 'of', 'm101']]
|
[-0.039671540430444935, 0.060674214118813734, -0.06487157162544983, 0.06732148760264474, -0.08373559030815787, -0.051209355045693676, 0.060736889880116225, 0.45132143215237674, -0.15064589414315852, -0.38214905768598556, 0.04600249570933888, -0.2781313166831307, -0.004762797628224651, 0.23139002853961585, -0.05750972564328968, -0.05426564935452899, 0.06665788575028357, -0.09550916966402792, -0.049110979014526934, -0.22952232675139753, 0.269690282470096, 0.07028318850392226, 0.19022063646693005, -0.053095943372791055, 0.05721229964959508, -0.12210833739858412, -0.07309978259598604, -0.009457823331145922, -0.18539907265677705, 0.0783698263721356, 0.24476241149557626, 0.1438190959960497, 0.21045920845284233, -0.291765600210961, -0.18428380253739776, 0.016768652074519667, 0.21883167740180745, 0.007323900189396629, -0.06995466220823507, -0.2911595743415611, 0.014789335918934663, -0.17559008953578112, -0.22693903573728616, 0.12808486923182702, 0.03384177918247621, 0.02579804672028071, -0.22553331131965335, 0.17351651317354136, -0.047991155160526364, 0.2067885904911957, -0.13597772965767776, -0.18561327087205795, -0.11292422517022539, 0.11165705815127681, -0.003330558187581496, 0.046136418994825144, 0.2056844607188714, -0.0912806465357077, 0.032939955308896054, 0.3756213223192549, -0.09189394538715688, 0.028454295793024626, 0.22009334915579395, -0.23455267401480798, -0.14071457376510488, 0.12273793522277117, 0.14844205439485575, 0.11224233006955497, -0.15224258626913406, 0.052023048420631955, -0.05128801703959497, 0.23410397524675053, 0.08686439505475681, 0.0384108172645787, 0.289941385328289, 0.054351926386390685, 0.06792477442086825, 0.04921065009127195, -0.29936696063085516, -0.0493751555785305, -0.19831210357047968, -0.10330900836581458, -0.08867099296466838, 0.07169126597509938, -0.1996859989787129, -0.13297894680314623, 0.3248305301748491, 0.057713715570403716, 0.23590009227343556, 0.02615929679923116, 0.2979580119117013, 0.03901504988895841, 0.10957952126783366, 0.11974476340274039, 0.2946098237191134, 0.22073535817516496, 0.09164868292832223, -0.2518728771311347, 0.06784962276039723, 0.027722236699283056]
|
1,803.04855
|
Atomization of correlated molecular-hydrogen chain: A fully microscopic
Variational Monte-Carlo solution
|
We discuss electronic properties and their evolution for the linear chain of
$H_2$ molecules in the presence of a uniform external force $f$ acting along
the chain. The system is described by an extended Hubbard model within a fully
microscopic approach. Explicitly, the microscopic parameters describing the
intra- and inter-site Coulomb interactions are determined together with the
hopping integrals by optimizing the system ground state energy and the
single-particle wave functions in the correlated state. The many-body wave
function is taken in the Jastrow form and the Variational Monte-Carlo (VMC)
method is used in combination with an ab initio approach to determine the
energy. Both the effective Bohr radii of the renormalized single-particle wave
functions and the many-body wave function parameters are determined for each
$f$. Hence, the evolution of the system can be analyzed in detail as a function
of the equilibrium intermolecular distance, which in turn is determined for
each $f$ value. The transition to the atomic state, including the Peierls
distortion stability, can thus be studied in a systematic manner, particularly
near the threshold of the dissociation of the molecular into atomic chain. The
computational reliability of VMC approach is also estimated.
|
cond-mat.mtrl-sci physics.chem-ph
|
we discuss electronic properties and their evolution for the linear chain of h_2 molecules in the presence of a uniform external force f acting along the chain the system is described by an extended hubbard model within a fully microscopic approach explicitly the microscopic parameters describing the intra and intersite coulomb interactions are determined together with the hopping integrals by optimizing the system ground state energy and the singleparticle wave functions in the correlated state the manybody wave function is taken in the jastrow form and the variational montecarlo vmc method is used in combination with an ab initio approach to determine the energy both the effective bohr radii of the renormalized singleparticle wave functions and the manybody wave function parameters are determined for each f hence the evolution of the system can be analyzed in detail as a function of the equilibrium intermolecular distance which in turn is determined for each f value the transition to the atomic state including the peierls distortion stability can thus be studied in a systematic manner particularly near the threshold of the dissociation of the molecular into atomic chain the computational reliability of vmc approach is also estimated
|
[['we', 'discuss', 'electronic', 'properties', 'and', 'their', 'evolution', 'for', 'the', 'linear', 'chain', 'of', 'h_2', 'molecules', 'in', 'the', 'presence', 'of', 'a', 'uniform', 'external', 'force', 'f', 'acting', 'along', 'the', 'chain', 'the', 'system', 'is', 'described', 'by', 'an', 'extended', 'hubbard', 'model', 'within', 'a', 'fully', 'microscopic', 'approach', 'explicitly', 'the', 'microscopic', 'parameters', 'describing', 'the', 'intra', 'and', 'intersite', 'coulomb', 'interactions', 'are', 'determined', 'together', 'with', 'the', 'hopping', 'integrals', 'by', 'optimizing', 'the', 'system', 'ground', 'state', 'energy', 'and', 'the', 'singleparticle', 'wave', 'functions', 'in', 'the', 'correlated', 'state', 'the', 'manybody', 'wave', 'function', 'is', 'taken', 'in', 'the', 'jastrow', 'form', 'and', 'the', 'variational', 'montecarlo', 'vmc', 'method', 'is', 'used', 'in', 'combination', 'with', 'an', 'ab', 'initio', 'approach', 'to', 'determine', 'the', 'energy', 'both', 'the', 'effective', 'bohr', 'radii', 'of', 'the', 'renormalized', 'singleparticle', 'wave', 'functions', 'and', 'the', 'manybody', 'wave', 'function', 'parameters', 'are', 'determined', 'for', 'each', 'f', 'hence', 'the', 'evolution', 'of', 'the', 'system', 'can', 'be', 'analyzed', 'in', 'detail', 'as', 'a', 'function', 'of', 'the', 'equilibrium', 'intermolecular', 'distance', 'which', 'in', 'turn', 'is', 'determined', 'for', 'each', 'f', 'value', 'the', 'transition', 'to', 'the', 'atomic', 'state', 'including', 'the', 'peierls', 'distortion', 'stability', 'can', 'thus', 'be', 'studied', 'in', 'a', 'systematic', 'manner', 'particularly', 'near', 'the', 'threshold', 'of', 'the', 'dissociation', 'of', 'the', 'molecular', 'into', 'atomic', 'chain', 'the', 'computational', 'reliability', 'of', 'vmc', 'approach', 'is', 'also', 'estimated']]
|
[-0.14988375164550513, 0.14598330804997553, -0.06221377721492153, 0.08967463531806014, 0.016917844250416144, -0.07835869665424793, 0.04455935527475025, 0.36872247964716875, -0.29895073780073567, -0.26183340313414544, 0.0196613033546899, -0.26926000289117485, -0.10760812939932714, 0.14038571318826423, 0.09541449212851241, 0.056779155500519735, 0.041895128805667925, 0.024221346081974796, -0.10207160081571111, -0.19663582218106454, 0.3055497380713813, 0.07105051367185437, 0.23174905648741584, 0.08256371249325382, 0.06271499391310872, 0.06104540089085603, 0.047741969772584686, 0.01796178068511952, -0.15585443544177674, 0.11745627618406732, 0.22291190594148177, 0.03495779620149197, 0.25900439554586624, -0.42899355669625294, -0.22265714002916445, 0.03412050095697244, 0.1428109564508001, 0.13123649104486387, 0.024694268798264557, -0.30812919404930794, -0.007792781056979528, -0.1876639581643618, -0.16863219088468795, -0.09863659317891758, 0.011761194013823301, 0.09130376644002704, -0.2680050001742366, 0.09734215784895545, -0.007289016785291143, 0.04359278682640228, -0.12651831954359435, -0.12222020151153302, -0.06524027031547844, 0.12483307481862796, -0.012044853864548106, 0.08439041685599546, 0.15368986814402236, -0.12953969059416498, -0.045775125660778335, 0.3974103858013852, -0.06900824214606427, -0.21301733149254384, 0.14617460144635958, -0.11664702628189937, -0.07625708002955295, 0.16156315745976874, 0.1065755902717893, 0.08993700762303211, -0.20333313070810757, 0.10585567527185702, 0.020215036218854576, 0.15791180866937607, -0.0032557172020180867, 0.053958709683651344, 0.18416266507612397, 0.14485408548408976, 0.045190995625960524, 0.14632924145732362, -0.09873077583152992, -0.15375583376854848, -0.279408165325339, -0.12783234354335432, -0.24588679886446932, 0.022907432334987113, -0.06298383963376415, -0.17537835537670896, 0.41044169413955667, 0.10695806637016712, 0.17084554478836556, -0.003919094583043494, 0.2545080126096041, 0.189644819454481, 0.04268826705355866, 0.019903148442673952, 0.25399414309813906, 0.1391413326219966, 0.027762749349364103, -0.3061377086640837, 0.06540036613885791, 0.09577042491485675]
|
1,803.04856
|
A System for the Generation of Synthetic Wide Area Aerial Surveillance
Imagery
|
The development, benchmarking and validation of aerial Persistent
Surveillance (PS) algorithms requires access to specialist Wide Area Aerial
Surveillance (WAAS) datasets. Such datasets are difficult to obtain and are
often extremely large both in spatial resolution and temporal duration. This
paper outlines an approach to the simulation of complex urban environments and
demonstrates the viability of using this approach for the generation of
simulated sensor data, corresponding to the use of wide area imaging systems
for surveillance and reconnaissance applications. This provides a
cost-effective method to generate datasets for vehicle tracking algorithms and
anomaly detection methods. The system fuses the Simulation of Urban Mobility
(SUMO) traffic simulator with a MATLAB controller and an image generator to
create scenes containing uninterrupted door-to-door journeys across large areas
of the urban environment. This `pattern-of-life' approach provides
three-dimensional visual information with natural movement and traffic flows.
This can then be used to provide simulated sensor measurements (e.g. visual
band and infrared video imagery) and automatic access to ground-truth data for
the evaluation of multi-target tracking systems.
|
cs.OH cs.SY eess.IV
|
the development benchmarking and validation of aerial persistent surveillance ps algorithms requires access to specialist wide area aerial surveillance waas datasets such datasets are difficult to obtain and are often extremely large both in spatial resolution and temporal duration this paper outlines an approach to the simulation of complex urban environments and demonstrates the viability of using this approach for the generation of simulated sensor data corresponding to the use of wide area imaging systems for surveillance and reconnaissance applications this provides a costeffective method to generate datasets for vehicle tracking algorithms and anomaly detection methods the system fuses the simulation of urban mobility sumo traffic simulator with a matlab controller and an image generator to create scenes containing uninterrupted doortodoor journeys across large areas of the urban environment this patternoflife approach provides threedimensional visual information with natural movement and traffic flows this can then be used to provide simulated sensor measurements eg visual band and infrared video imagery and automatic access to groundtruth data for the evaluation of multitarget tracking systems
|
[['the', 'development', 'benchmarking', 'and', 'validation', 'of', 'aerial', 'persistent', 'surveillance', 'ps', 'algorithms', 'requires', 'access', 'to', 'specialist', 'wide', 'area', 'aerial', 'surveillance', 'waas', 'datasets', 'such', 'datasets', 'are', 'difficult', 'to', 'obtain', 'and', 'are', 'often', 'extremely', 'large', 'both', 'in', 'spatial', 'resolution', 'and', 'temporal', 'duration', 'this', 'paper', 'outlines', 'an', 'approach', 'to', 'the', 'simulation', 'of', 'complex', 'urban', 'environments', 'and', 'demonstrates', 'the', 'viability', 'of', 'using', 'this', 'approach', 'for', 'the', 'generation', 'of', 'simulated', 'sensor', 'data', 'corresponding', 'to', 'the', 'use', 'of', 'wide', 'area', 'imaging', 'systems', 'for', 'surveillance', 'and', 'reconnaissance', 'applications', 'this', 'provides', 'a', 'costeffective', 'method', 'to', 'generate', 'datasets', 'for', 'vehicle', 'tracking', 'algorithms', 'and', 'anomaly', 'detection', 'methods', 'the', 'system', 'fuses', 'the', 'simulation', 'of', 'urban', 'mobility', 'sumo', 'traffic', 'simulator', 'with', 'a', 'matlab', 'controller', 'and', 'an', 'image', 'generator', 'to', 'create', 'scenes', 'containing', 'uninterrupted', 'doortodoor', 'journeys', 'across', 'large', 'areas', 'of', 'the', 'urban', 'environment', 'this', 'patternoflife', 'approach', 'provides', 'threedimensional', 'visual', 'information', 'with', 'natural', 'movement', 'and', 'traffic', 'flows', 'this', 'can', 'then', 'be', 'used', 'to', 'provide', 'simulated', 'sensor', 'measurements', 'eg', 'visual', 'band', 'and', 'infrared', 'video', 'imagery', 'and', 'automatic', 'access', 'to', 'groundtruth', 'data', 'for', 'the', 'evaluation', 'of', 'multitarget', 'tracking', 'systems']]
|
[-0.11751046206813022, -0.025218422311373133, -0.06664585376026283, 0.02659202475040846, -0.07612709568306934, -0.14445282051568492, 0.01155543989673453, 0.43525336303731854, -0.21901570059555142, -0.40498240650440864, 0.14454201185920587, -0.2653801604963795, -0.16267881493699568, 0.2659312139812596, -0.1917486595240427, 0.11377523936112058, 0.15497428045079809, -0.016995253833657544, 0.018844770215865638, -0.21236056687136057, 0.22304101462328904, 0.04817507752593149, 0.35806991726606646, 0.04795147505267496, 0.1454477678543251, 0.011116077250675762, -0.07973240940472144, -0.008617820422442858, -0.0632650252249179, 0.1735029450916598, 0.37950976094236455, 0.2157107854217062, 0.2600429980594894, -0.419600506029936, -0.2515713577471913, 0.07570173819440455, 0.13813535607416844, 0.07003129564716865, -0.06713103762234164, -0.40357553908241944, 0.09665378953509948, -0.18733340538888407, -0.07287652947400745, -0.12788275906636395, 0.02360779577842369, 0.014479589599187414, -0.32309697345661664, 0.017556872218847275, -0.07227945268121466, 0.14294886836313714, -0.0696687394118601, -0.009544474107474742, 0.026666073209595218, 0.26397633504078927, 0.011353850980120444, 0.011039630221938225, 0.1883346493521362, -0.174844895464665, -0.12928179661029873, 0.40388925063113373, 0.0012038673263326375, -0.16687233415459507, 0.25111582702262686, -0.04585917054931497, -0.11300114723608683, 0.13457016251458412, 0.2752673340432362, 0.10808835944776254, -0.20802239948551426, -0.021098028553230414, -0.010686835540970515, 0.17346753643509763, 0.01809132904391627, 0.0055275164974842505, 0.19406713795853636, 0.2991280334222822, 0.11096530319028125, 0.1036713304241836, -0.19987973068671966, -0.07322280288657598, -0.18670859880070065, -0.13386307149166948, -0.15833736285676211, -0.019580949714668748, -0.09823825960479846, -0.1570535263915312, 0.3746642771446587, 0.2616221908526223, 0.12918881102933477, 0.07201789516519227, 0.4229910531086706, -0.021773961242642362, 0.09215134997683311, 0.07084824220544239, 0.10212281515633916, -0.02318238401622103, 0.22968292942172602, -0.1830848957526318, 0.02470014955064184, -0.020004484779337608]
|
1,803.04857
|
Efficient white noise sampling and coupling for multilevel Monte Carlo
with non-nested meshes
|
When solving stochastic partial differential equations (SPDEs) driven by
additive spatial white noise, the efficient sampling of white noise
realizations can be challenging. Here, we present a new sampling technique that
can be used to efficiently compute white noise samples in a finite element
method and multilevel Monte Carlo (MLMC) setting. The key idea is to exploit
the finite element matrix assembly procedure and factorize each local mass
matrix independently, hence avoiding the factorization of a large matrix.
Moreover, in a MLMC framework, the white noise samples must be coupled between
subsequent levels. We show how our technique can be used to enforce this
coupling even in the case of non-nested mesh hierarchies. We demonstrate the
efficacy of our method with numerical experiments. We observe optimal
convergence rates for the finite element solution of the elliptic SPDEs of
interest in 2D and 3D and we show convergence of the sampled field covariances.
In a MLMC setting, a good coupling is enforced and the telescoping sum is
respected.
|
math.NA
|
when solving stochastic partial differential equations spdes driven by additive spatial white noise the efficient sampling of white noise realizations can be challenging here we present a new sampling technique that can be used to efficiently compute white noise samples in a finite element method and multilevel monte carlo mlmc setting the key idea is to exploit the finite element matrix assembly procedure and factorize each local mass matrix independently hence avoiding the factorization of a large matrix moreover in a mlmc framework the white noise samples must be coupled between subsequent levels we show how our technique can be used to enforce this coupling even in the case of nonnested mesh hierarchies we demonstrate the efficacy of our method with numerical experiments we observe optimal convergence rates for the finite element solution of the elliptic spdes of interest in 2d and 3d and we show convergence of the sampled field covariances in a mlmc setting a good coupling is enforced and the telescoping sum is respected
|
[['when', 'solving', 'stochastic', 'partial', 'differential', 'equations', 'spdes', 'driven', 'by', 'additive', 'spatial', 'white', 'noise', 'the', 'efficient', 'sampling', 'of', 'white', 'noise', 'realizations', 'can', 'be', 'challenging', 'here', 'we', 'present', 'a', 'new', 'sampling', 'technique', 'that', 'can', 'be', 'used', 'to', 'efficiently', 'compute', 'white', 'noise', 'samples', 'in', 'a', 'finite', 'element', 'method', 'and', 'multilevel', 'monte', 'carlo', 'mlmc', 'setting', 'the', 'key', 'idea', 'is', 'to', 'exploit', 'the', 'finite', 'element', 'matrix', 'assembly', 'procedure', 'and', 'factorize', 'each', 'local', 'mass', 'matrix', 'independently', 'hence', 'avoiding', 'the', 'factorization', 'of', 'a', 'large', 'matrix', 'moreover', 'in', 'a', 'mlmc', 'framework', 'the', 'white', 'noise', 'samples', 'must', 'be', 'coupled', 'between', 'subsequent', 'levels', 'we', 'show', 'how', 'our', 'technique', 'can', 'be', 'used', 'to', 'enforce', 'this', 'coupling', 'even', 'in', 'the', 'case', 'of', 'nonnested', 'mesh', 'hierarchies', 'we', 'demonstrate', 'the', 'efficacy', 'of', 'our', 'method', 'with', 'numerical', 'experiments', 'we', 'observe', 'optimal', 'convergence', 'rates', 'for', 'the', 'finite', 'element', 'solution', 'of', 'the', 'elliptic', 'spdes', 'of', 'interest', 'in', '2d', 'and', '3d', 'and', 'we', 'show', 'convergence', 'of', 'the', 'sampled', 'field', 'covariances', 'in', 'a', 'mlmc', 'setting', 'a', 'good', 'coupling', 'is', 'enforced', 'and', 'the', 'telescoping', 'sum', 'is', 'respected']]
|
[-0.07116569725874655, 0.09695643930511917, -0.09127260618536415, 0.09955331490341641, -0.05635373672598716, -0.12512974379149205, 0.049480892583995524, 0.3908737969255733, -0.333986982803591, -0.29054078318089427, 0.12311701994587271, -0.24654003226861892, -0.1475126532625831, 0.1636307249291839, -0.10758466585009487, 0.0887264683093279, 0.11327943927190172, -0.0532744244022663, -0.09433567799170485, -0.28083373766746594, 0.30709247536466505, 0.04094700426041723, 0.270929268513901, -0.027912161234922395, 0.15788420536248626, -0.025260960931393378, -0.06069362971340557, 0.03647731495240402, -0.09084586291818797, 0.08916398110342195, 0.2863054976569946, 0.08273038886484696, 0.3012824440165841, -0.40683340739101886, -0.206238155912686, 0.12017686108216465, 0.15904962648424978, 0.1512265677848262, -0.10177335554795217, -0.2648598768491811, 0.1156236585926733, -0.17720001243043712, -0.09628892166562333, -0.12687686803851075, -0.09162173213222494, 0.04988447749083806, -0.38762309315229604, 0.08505688182881359, 0.05653326266757519, -0.007482022703708914, 0.00800392087576855, -0.11486064580765491, 0.034273597952759194, 0.11351012294881274, 0.001681532326689782, -0.03017959103035646, 0.09311502891129808, -0.06776073469688369, -0.0941207749144492, 0.3324813418728885, -0.1127641960186605, -0.2961247751062658, 0.1484945309432056, -0.1229319534442962, -0.10685854166478453, 0.1466522729024291, 0.1936695206754222, 0.1666768458002654, -0.1712077489297197, 0.11485288256513022, -0.010428731133157532, 0.17807406838565037, 0.01898834296546787, -0.02621334040269791, 0.11793438097584748, 0.18820573966587686, 0.09840523085172126, 0.13330387759445378, -0.08362979914792283, -0.12030605642364813, -0.2770188408150912, -0.14825987859913511, -0.20758289505287023, 0.0401007201617394, -0.14380840137281978, -0.17305710327025212, 0.34795100779501265, 0.2201882108465997, 0.16699057589647567, 0.04875277296757091, 0.3084602650076508, 0.1737841659735799, 0.031500926829629135, 0.06076897021026133, 0.14555283196543728, 0.19082845584628824, 0.055645149875945314, -0.24503175124336413, 0.04876975727986968, 0.10421944455059613]
|
1,803.04858
|
Expert identification of visual primitives used by CNNs during mammogram
classification
|
This work interprets the internal representations of deep neural networks
trained for classification of diseased tissue in 2D mammograms. We propose an
expert-in-the-loop interpretation method to label the behavior of internal
units in convolutional neural networks (CNNs). Expert radiologists identify
that the visual patterns detected by the units are correlated with meaningful
medical phenomena such as mass tissue and calcificated vessels. We demonstrate
that several trained CNN models are able to produce explanatory descriptions to
support the final classification decisions. We view this as an important first
step toward interpreting the internal representations of medical classification
CNNs and explaining their predictions.
|
cs.CV
|
this work interprets the internal representations of deep neural networks trained for classification of diseased tissue in 2d mammograms we propose an expertintheloop interpretation method to label the behavior of internal units in convolutional neural networks cnns expert radiologists identify that the visual patterns detected by the units are correlated with meaningful medical phenomena such as mass tissue and calcificated vessels we demonstrate that several trained cnn models are able to produce explanatory descriptions to support the final classification decisions we view this as an important first step toward interpreting the internal representations of medical classification cnns and explaining their predictions
|
[['this', 'work', 'interprets', 'the', 'internal', 'representations', 'of', 'deep', 'neural', 'networks', 'trained', 'for', 'classification', 'of', 'diseased', 'tissue', 'in', '2d', 'mammograms', 'we', 'propose', 'an', 'expertintheloop', 'interpretation', 'method', 'to', 'label', 'the', 'behavior', 'of', 'internal', 'units', 'in', 'convolutional', 'neural', 'networks', 'cnns', 'expert', 'radiologists', 'identify', 'that', 'the', 'visual', 'patterns', 'detected', 'by', 'the', 'units', 'are', 'correlated', 'with', 'meaningful', 'medical', 'phenomena', 'such', 'as', 'mass', 'tissue', 'and', 'calcificated', 'vessels', 'we', 'demonstrate', 'that', 'several', 'trained', 'cnn', 'models', 'are', 'able', 'to', 'produce', 'explanatory', 'descriptions', 'to', 'support', 'the', 'final', 'classification', 'decisions', 'we', 'view', 'this', 'as', 'an', 'important', 'first', 'step', 'toward', 'interpreting', 'the', 'internal', 'representations', 'of', 'medical', 'classification', 'cnns', 'and', 'explaining', 'their', 'predictions']]
|
[-0.0077783389797791685, 0.026074545996821005, -0.036168396275377636, 0.09989219613025209, -0.11307972410900725, -0.15766671399651755, -0.01095988803938257, 0.4828380254671128, -0.26821876130057404, -0.3228652703039574, 0.027521724339969682, -0.2644211038044005, -0.27381924631349236, 0.16749955670475358, -0.15678863614477745, 0.08889977570924193, 0.13977891496838907, 0.0677664324810559, -0.024751548368408524, -0.28232167342282605, 0.28294320147710317, 0.04551390126421624, 0.3532124974181631, -0.020463420623781706, 0.14000596965879503, -0.07608974694787064, -0.050996859581444905, -0.041483488662939785, -0.03755700733407396, 0.2206229483285411, 0.3840886780049142, 0.1911592027360592, 0.3191314034794241, -0.485045462846756, -0.2763733903153075, 0.11432256601336929, 0.1665998049776512, 0.115143196925408, 0.03257585738343422, -0.37312628579975077, 0.08431855480732264, -0.15281126443108525, -0.010571253462459403, -0.18993008736934927, -0.02018130232928076, -0.03587032958272506, -0.23474295887004848, 0.05311400605591409, 0.09398171732747795, 0.10890213619315564, -0.14619406730623333, -0.09430424315205803, -0.01902966671670326, 0.2263368172194771, 0.0366946005067233, 0.053833910409887935, 0.18115538384558427, -0.2984155202143346, -0.14916269609238952, 0.3216140931378109, 0.015955599608144376, -0.2051814730006336, 0.214985067843262, -0.012410545058435562, -0.17484437114079343, 0.06524457522865498, 0.2526325310528692, 0.061454569257682924, -0.17640276689722081, -0.10391536984719675, -0.04909423555746072, 0.17946489354962428, 0.042934166145219346, -0.010568701582161165, 0.23736982192665415, 0.2961813613697134, -0.08377578253434463, 0.1189279224596579, -0.17329686140793557, 0.019671181009875402, -0.23383644385018734, -0.11780453575398735, -0.1394102395079428, 0.0020043792936838035, -0.10869955946426754, -0.17414836581758777, 0.40723370235751977, 0.22680609463478882, 0.2592025157746229, 0.12185740598825494, 0.31296129566099906, 0.009288636574785064, 0.1532929477380645, 0.027671891175248105, 0.16780202467032154, 0.058913349279795184, 0.13245962768783698, -0.14346987176028014, 0.10049163156913386, 0.06702777569304512]
|
1,803.04859
|
On moments of integral exponential functionals of additive processes
|
For real-valued additive process $(X\_t)\_{t\geq 0}$ a recursive equation is
derived for the entire positive moments of functionals $$I\_{s,t}= \int
\_s^t\exp(-X\_u)du, \quad 0\leq s<t\leq\infty, $$ in case the Laplace exponent
of $X\_t$ exists for positive values of the parameter. From the equation
emergesan easy-to-apply sufficient condition for the finiteness of the moments.
As an application we study first hitprocesses of diffusions.
|
math.PR math.ST stat.TH
|
for realvalued additive process x_t_tgeq 0 a recursive equation is derived for the entire positive moments of functionals i_st int _stexpx_udu quad 0leq stleqinfty in case the laplace exponent of x_t exists for positive values of the parameter from the equation emergesan easytoapply sufficient condition for the finiteness of the moments as an application we study first hitprocesses of diffusions
|
[['for', 'realvalued', 'additive', 'process', 'x_t_tgeq', '0', 'a', 'recursive', 'equation', 'is', 'derived', 'for', 'the', 'entire', 'positive', 'moments', 'of', 'functionals', 'i_st', 'int', '_stexpx_udu', 'quad', '0leq', 'stleqinfty', 'in', 'case', 'the', 'laplace', 'exponent', 'of', 'x_t', 'exists', 'for', 'positive', 'values', 'of', 'the', 'parameter', 'from', 'the', 'equation', 'emergesan', 'easytoapply', 'sufficient', 'condition', 'for', 'the', 'finiteness', 'of', 'the', 'moments', 'as', 'an', 'application', 'we', 'study', 'first', 'hitprocesses', 'of', 'diffusions']]
|
[-0.145292895280623, 0.09040156147576843, -0.03530507945106365, 0.06140151828539534, -0.04734684721188387, -0.10851032794952127, 0.005851302000727239, 0.28930322799299446, -0.28887052055714385, -0.1568246541677841, 0.10472286351848327, -0.3225529523832457, -0.10864521153936428, 0.20078090007882565, -0.004887188385639872, 0.08941279455471626, -0.015785197116201743, 0.06216730131667906, -0.07454303141379828, -0.2056988253482684, 0.34654085750558544, -0.048238742647559514, 0.19468503893585876, 0.031401579534368854, 0.1893394450557285, 0.023796642481881593, 0.03784056289337708, -0.07239960373512336, -0.2691672158959721, 0.012745992995665542, 0.2063348339870572, 0.06906745150419218, 0.307144083215722, -0.32950368407182395, -0.16202269000807842, 0.18791441483023977, 0.11677745049486735, -0.01519284478854388, -0.02467197131565107, -0.2800072405246153, 0.13432506556689208, -0.09781644672953657, -0.18793111973043, -0.06479606734189604, 0.10967790940776467, 0.10255681296985131, -0.43313421308994293, 0.14927488511810744, 0.1329279714097668, 0.03782326927258899, -0.13854313571937382, -0.20656805104642575, -0.01035397280273693, 0.0925836225589072, 0.0306203101515296, 0.018735497165055546, 0.025531680946837047, -0.12467571157737568, -0.06217465163873775, 0.29925197708819595, -0.11351690912020526, -0.26378919506844667, 0.018512254277343994, -0.17442375300119498, -0.17114321278807307, 0.11056289844314701, 0.1315814445344066, 0.18736844783623902, -0.14131196927545325, 0.23729770773622608, -0.022073863843356127, 0.1258411895916132, 0.05988621808189366, -0.029075125930830836, 0.07156273714749009, 0.07254130606140409, 0.13618153871253266, 0.14374220699288084, -0.033318207532699616, -0.09845330325021807, -0.4126022599105324, -0.21141579883572245, -0.2324924986044477, 0.14532540518640807, -0.14344372375801737, -0.19535151441648071, 0.30139655649795066, 0.09225233045123916, 0.16928152803198568, 0.14555005651033884, 0.1861845883436867, 0.23247264158583544, -0.06232528652929302, 0.025669285245904967, 0.07107840910820025, 0.17043331210568016, 0.1113822215619231, -0.1763841013765029, 0.10690369095287419, 0.11809814673948235]
|
1,803.0486
|
NECTAR: Non-Interactive Smart Contract Protocol using Blockchain
Technology
|
Blockchain-driven technologies are considered disruptive because of the
availability of dis-intermediated, censorship-resistant and tamper-proof
digital platforms of distributed trust. Among these technologies, smart
contract platforms have the potential to take over functions usually done by
intermediaries like banks, escrow or legal services. In this paper, we
introduce a novel protocol aiming to execute smart contracts as part of a
blockchain transaction validation. We enable extensions in the execution of
smart contracts while guaranteeing their privacy, correctness and
verifiability. Man-in-the-middle attacks are prevented, since no communication
between participants is requested, and contract validations do not imply the
re-execution of the code by all the nodes in the network. However, proofs of
correct execution are stored on the blockchain and can be verified by multiple
parties. Our solution is based on programming tools which optimize the time
execution and the required memory while preserving the embedded functionality.
|
cs.CY cs.CR
|
blockchaindriven technologies are considered disruptive because of the availability of disintermediated censorshipresistant and tamperproof digital platforms of distributed trust among these technologies smart contract platforms have the potential to take over functions usually done by intermediaries like banks escrow or legal services in this paper we introduce a novel protocol aiming to execute smart contracts as part of a blockchain transaction validation we enable extensions in the execution of smart contracts while guaranteeing their privacy correctness and verifiability maninthemiddle attacks are prevented since no communication between participants is requested and contract validations do not imply the reexecution of the code by all the nodes in the network however proofs of correct execution are stored on the blockchain and can be verified by multiple parties our solution is based on programming tools which optimize the time execution and the required memory while preserving the embedded functionality
|
[['blockchaindriven', 'technologies', 'are', 'considered', 'disruptive', 'because', 'of', 'the', 'availability', 'of', 'disintermediated', 'censorshipresistant', 'and', 'tamperproof', 'digital', 'platforms', 'of', 'distributed', 'trust', 'among', 'these', 'technologies', 'smart', 'contract', 'platforms', 'have', 'the', 'potential', 'to', 'take', 'over', 'functions', 'usually', 'done', 'by', 'intermediaries', 'like', 'banks', 'escrow', 'or', 'legal', 'services', 'in', 'this', 'paper', 'we', 'introduce', 'a', 'novel', 'protocol', 'aiming', 'to', 'execute', 'smart', 'contracts', 'as', 'part', 'of', 'a', 'blockchain', 'transaction', 'validation', 'we', 'enable', 'extensions', 'in', 'the', 'execution', 'of', 'smart', 'contracts', 'while', 'guaranteeing', 'their', 'privacy', 'correctness', 'and', 'verifiability', 'maninthemiddle', 'attacks', 'are', 'prevented', 'since', 'no', 'communication', 'between', 'participants', 'is', 'requested', 'and', 'contract', 'validations', 'do', 'not', 'imply', 'the', 'reexecution', 'of', 'the', 'code', 'by', 'all', 'the', 'nodes', 'in', 'the', 'network', 'however', 'proofs', 'of', 'correct', 'execution', 'are', 'stored', 'on', 'the', 'blockchain', 'and', 'can', 'be', 'verified', 'by', 'multiple', 'parties', 'our', 'solution', 'is', 'based', 'on', 'programming', 'tools', 'which', 'optimize', 'the', 'time', 'execution', 'and', 'the', 'required', 'memory', 'while', 'preserving', 'the', 'embedded', 'functionality']]
|
[-0.2032459648928327, -0.0009114312512489656, -0.04218689176680831, 0.03707181748419922, -0.10794360298960884, -0.21506508147447473, 0.11426855067545855, 0.3843282150046434, -0.27069874863243765, -0.3367321868879824, 0.17619507190991296, -0.28008731166967965, -0.08080582468958003, 0.1866675655393111, -0.14829724066011193, 0.09320898573949105, 0.033595675087579165, 0.0010382297979150382, 0.03255767765626337, -0.3220827494304912, 0.27777947524656255, 0.049546857799416304, 0.3153302754023268, 0.09515958562325169, 0.04872386990205592, 0.01175173464192388, -0.06127287191015461, -0.03615826513446842, -0.03831102171615283, 0.1492035924178102, 0.34109117363631314, 0.2614935128658544, 0.3787611585430568, -0.5243537693750113, -0.109199415001462, 0.09328332122984445, 0.11871628644035405, 0.0572308814840249, -0.04014243477366916, -0.3162977650192463, 0.11843313489549069, -0.28096074978303576, -0.05467709814709249, -0.12003905895916331, -0.030708456453188166, 0.07335730279131288, -0.2235712491739024, -0.05628691968417519, 0.021407845450287115, 0.0628847263473694, 0.005404163264049405, -0.02824865173736018, -0.06546630380358288, 0.19174307143677854, 0.03683548567318616, -0.06735610685508517, 0.18544366785338046, -0.09012290425824984, -0.17703023674807306, 0.40334573526827927, 0.059543207824592374, -0.1568269780400442, 0.1426084196508681, 0.004799927431223396, -0.14038005216085972, 0.05393481063139108, 0.21848992952032453, 0.06669137203749011, -0.19633799904517624, 0.05979197682972881, 0.04257587037540765, 0.20568859603695777, 0.07399835666971437, 0.08452617477531829, 0.210712179740464, 0.17303911824193266, 0.10503477368911263, 0.08782864176302813, 0.03325483294126267, -0.13390465981986685, -0.2557711056825711, -0.19530956260859966, -0.17937992534037525, -0.015215596353805773, -0.07319553952755894, -0.14521741847016123, 0.3506510985058008, 0.21272545028154533, 0.08691920067616997, 0.09867138053798247, 0.40547424078815514, 0.007002983361922411, 0.18089752789657926, 0.16217191529479655, 0.1675273862864641, -0.042261076573696404, 0.2036628582403258, -0.13282387766877138, 0.22079113466315903, -0.012427388373503668]
|
1,803.04861
|
SHARVOT: secret SHARe-based VOTing on the blockchain
|
Recently, there has been a growing interest in using online technologies to
design protocols for secure electronic voting. The main challenges include vote
privacy and anonymity, ballot irrevocability and transparency throughout the
vote counting process. The introduction of the blockchain as a basis for
cryptocurrency protocols, provides for the exploitation of the immutability and
transparency properties of these distributed ledgers.
In this paper, we discuss possible uses of the blockchain technology to
implement a secure and fair voting system. In particular, we introduce a secret
share-based voting system on the blockchain, the so-called SHARVOT protocol.
Our solution uses Shamir's Secret Sharing to enable on-chain, i.e. within the
transactions script, votes submission and winning candidate determination. The
protocol is also using a shuffling technique, Circle Shuffle, to de-link voters
from their submissions.
|
cs.CY cs.CR
|
recently there has been a growing interest in using online technologies to design protocols for secure electronic voting the main challenges include vote privacy and anonymity ballot irrevocability and transparency throughout the vote counting process the introduction of the blockchain as a basis for cryptocurrency protocols provides for the exploitation of the immutability and transparency properties of these distributed ledgers in this paper we discuss possible uses of the blockchain technology to implement a secure and fair voting system in particular we introduce a secret sharebased voting system on the blockchain the socalled sharvot protocol our solution uses shamirs secret sharing to enable onchain ie within the transactions script votes submission and winning candidate determination the protocol is also using a shuffling technique circle shuffle to delink voters from their submissions
|
[['recently', 'there', 'has', 'been', 'a', 'growing', 'interest', 'in', 'using', 'online', 'technologies', 'to', 'design', 'protocols', 'for', 'secure', 'electronic', 'voting', 'the', 'main', 'challenges', 'include', 'vote', 'privacy', 'and', 'anonymity', 'ballot', 'irrevocability', 'and', 'transparency', 'throughout', 'the', 'vote', 'counting', 'process', 'the', 'introduction', 'of', 'the', 'blockchain', 'as', 'a', 'basis', 'for', 'cryptocurrency', 'protocols', 'provides', 'for', 'the', 'exploitation', 'of', 'the', 'immutability', 'and', 'transparency', 'properties', 'of', 'these', 'distributed', 'ledgers', 'in', 'this', 'paper', 'we', 'discuss', 'possible', 'uses', 'of', 'the', 'blockchain', 'technology', 'to', 'implement', 'a', 'secure', 'and', 'fair', 'voting', 'system', 'in', 'particular', 'we', 'introduce', 'a', 'secret', 'sharebased', 'voting', 'system', 'on', 'the', 'blockchain', 'the', 'socalled', 'sharvot', 'protocol', 'our', 'solution', 'uses', 'shamirs', 'secret', 'sharing', 'to', 'enable', 'onchain', 'ie', 'within', 'the', 'transactions', 'script', 'votes', 'submission', 'and', 'winning', 'candidate', 'determination', 'the', 'protocol', 'is', 'also', 'using', 'a', 'shuffling', 'technique', 'circle', 'shuffle', 'to', 'delink', 'voters', 'from', 'their', 'submissions']]
|
[-0.17914155898110348, -0.027478492340477285, -0.11051184832760992, 0.02519963863863289, -0.09291563040483021, -0.2382101042073422, 0.20998581387770412, 0.37406098356902734, -0.28832451911108903, -0.2862064729538537, 0.11508787310115502, -0.2869119239545088, -0.10339709952502518, 0.1418623071192771, -0.19439106713348725, 0.11711663264391381, 0.026651222946468826, 0.007969703568622123, 0.05617552777335351, -0.35517187713096715, 0.29151016457616385, 0.04393550383591259, 0.3479798404831988, 0.06550761436783643, 0.09079943358710454, 0.07152986416030069, -0.04644581377406987, -0.07960607539393123, -0.11613480779956016, 0.14321948551796665, 0.3160723139488593, 0.23814450445686028, 0.37360070092791275, -0.36216961140491705, -0.057721594655380924, 0.08480042470402496, 0.11893932255302635, 0.13619637629197723, -0.10499648882036437, -0.3010932531951414, 0.07446285652049976, -0.30727233039576185, -0.06275047386577715, -0.10165506080442736, -0.006585815462984087, 0.052555671252324715, -0.265478612089804, -0.026900853931248664, 0.00546299792869493, 0.05891679052999893, 0.027052997144673727, -0.042798976939128236, 0.021120444494263493, 0.16391694712517565, -0.022070008981837565, -0.05047978475193995, 0.1420635050162673, -0.1028038959376254, -0.22334996176262698, 0.4073813828935688, 0.05636975559940229, -0.0959447210983106, 0.07736768801570257, -0.0017025931232948174, -0.176372992085986, 0.03038306319689046, 0.1808522083370607, 0.05546241048579068, -0.19113355573959823, 0.009012347761841217, -0.0983478467471089, 0.2130686025705564, 0.07040746006825867, 0.10566124216068623, 0.17556011626567303, 0.2030981205775612, 0.11749078534081463, 0.11872051373600613, -0.006882568244423443, -0.1694660453787326, -0.22486151690872805, -0.1909224400513394, -0.16780535839931215, 0.013849533804197789, -0.04933359795157498, -0.16091089602920783, 0.40019761316131713, 0.21353149062470178, 0.09596828625053745, 0.03909955754905015, 0.36749255383484675, -0.017200109122913015, 0.13045109937990865, 0.13615310577903117, 0.18360604584765758, 0.04194754404521208, 0.1861829625753065, -0.11989488617459297, 0.19159450346618428, 0.04574111722073113]
|
1,803.04862
|
Correlation Manipulating Circuits for Stochastic Computing
|
Stochastic computing (SC) is an emerging computing technique that promises
high density, low power, and error tolerant solutions. In SC, values are
encoded as unary bitstreams and SC arithmetic circuits operate on one or more
bitstreams. In many cases, the input bitstreams must be correlated or
uncorrelated for SC arithmetic to produce accurate results. As a result, a key
challenge for designing SC accelerators is manipulating the impact of
correlation across SC operations. This paper presents and evaluates a set of
novel correlation manipulating circuits to manage correlation in SC
computation: a synchronizer, desynchronizer, and decorrelator. We then use
these circuits to propose improved SC maximum, minimum, and saturating adder
designs. Compared to existing correlation manipulation techniques, our circuits
are more accurate and up to 3x more energy efficient. In the context of an
image processing pipeline, these circuits can reduce the total energy
consumption by up to 24%.
|
eess.SP cs.AR
|
stochastic computing sc is an emerging computing technique that promises high density low power and error tolerant solutions in sc values are encoded as unary bitstreams and sc arithmetic circuits operate on one or more bitstreams in many cases the input bitstreams must be correlated or uncorrelated for sc arithmetic to produce accurate results as a result a key challenge for designing sc accelerators is manipulating the impact of correlation across sc operations this paper presents and evaluates a set of novel correlation manipulating circuits to manage correlation in sc computation a synchronizer desynchronizer and decorrelator we then use these circuits to propose improved sc maximum minimum and saturating adder designs compared to existing correlation manipulation techniques our circuits are more accurate and up to 3x more energy efficient in the context of an image processing pipeline these circuits can reduce the total energy consumption by up to 24
|
[['stochastic', 'computing', 'sc', 'is', 'an', 'emerging', 'computing', 'technique', 'that', 'promises', 'high', 'density', 'low', 'power', 'and', 'error', 'tolerant', 'solutions', 'in', 'sc', 'values', 'are', 'encoded', 'as', 'unary', 'bitstreams', 'and', 'sc', 'arithmetic', 'circuits', 'operate', 'on', 'one', 'or', 'more', 'bitstreams', 'in', 'many', 'cases', 'the', 'input', 'bitstreams', 'must', 'be', 'correlated', 'or', 'uncorrelated', 'for', 'sc', 'arithmetic', 'to', 'produce', 'accurate', 'results', 'as', 'a', 'result', 'a', 'key', 'challenge', 'for', 'designing', 'sc', 'accelerators', 'is', 'manipulating', 'the', 'impact', 'of', 'correlation', 'across', 'sc', 'operations', 'this', 'paper', 'presents', 'and', 'evaluates', 'a', 'set', 'of', 'novel', 'correlation', 'manipulating', 'circuits', 'to', 'manage', 'correlation', 'in', 'sc', 'computation', 'a', 'synchronizer', 'desynchronizer', 'and', 'decorrelator', 'we', 'then', 'use', 'these', 'circuits', 'to', 'propose', 'improved', 'sc', 'maximum', 'minimum', 'and', 'saturating', 'adder', 'designs', 'compared', 'to', 'existing', 'correlation', 'manipulation', 'techniques', 'our', 'circuits', 'are', 'more', 'accurate', 'and', 'up', 'to', '3x', 'more', 'energy', 'efficient', 'in', 'the', 'context', 'of', 'an', 'image', 'processing', 'pipeline', 'these', 'circuits', 'can', 'reduce', 'the', 'total', 'energy', 'consumption', 'by', 'up', 'to', '24']]
|
[-0.154924734401976, 0.07979150433144437, -0.013164047988735744, 0.10166976919375688, -0.021735107282340224, -0.20230445168862068, 0.04601199659943656, 0.40276198497362986, -0.27112828807691364, -0.38686228550441965, 0.09077742230461759, -0.2843513272866305, -0.1376877766876557, 0.2607577052533727, -0.07180565483085465, 0.11109086882405225, 0.024597595666056953, -0.03321326508916713, -0.13202958382080887, -0.26860017912160306, 0.23479587456991746, 0.0953189888402719, 0.31816874234307857, 0.007085087186833088, 0.046465613221674154, -0.03386193667097974, -0.0011026626610121614, 0.014861697575786427, -0.03855164720059563, 0.1730510621690317, 0.3163211145186545, 0.16717033584388225, 0.2774943315291878, -0.4731478656302332, -0.18577472877537682, 0.09865610565788843, 0.16171593190311623, 0.1328516959942676, -0.04659473846461608, -0.1803499094314395, 0.1288621510139893, -0.17406624021335831, -0.02353752501988532, -0.11921524432486999, 0.014523809656148424, 0.02896226869307685, -0.2874600980556696, -0.008619989435238814, 0.04687931713320919, 0.026813128025497537, 0.018308535749973678, -0.12419590392665988, 0.04559845352746748, 0.11770345329627949, -0.1112464874687076, 0.07444325252436101, 0.11547084439961189, -0.13093308304165918, -0.14490702818147838, 0.3379319255980443, -0.014429157925061756, -0.14911337246146128, 0.1365140384956691, -0.02319534872249524, -0.10140966392685408, 0.1524515039904194, 0.22598241081121503, 0.056855027148550424, -0.14473748201428838, 0.014852479402474568, 0.07256542413253211, 0.2170214126817882, 0.063830429172093, 0.11434144930398041, 0.1713543304122632, 0.18861173996953545, 0.11698896885649741, 0.157541135742134, -0.08351599122869556, -0.05597253452130669, -0.22665338607731503, -0.15692978152337428, -0.1722899840034016, 0.0139297856823907, -0.06636558862098625, -0.16357612867235533, 0.3813233520093097, 0.19275269300261563, 0.14002120574130802, 0.08955973857597643, 0.36389778567024983, 0.11611878269871562, 0.11936939933110734, 0.13844770787132754, 0.13575800022226758, 0.10013594963694797, 0.08754834761478107, -0.21506217270507477, 0.07687218719149462, 0.004313825436150403]
|
1,803.04863
|
Exact short-time height distribution for the flat Kardar-Parisi-Zhang
interface
|
We determine the exact short-time distribution $-\ln
\mathcal{P}_{\text{f}}\left(H,t\right)= S_{\text{f}} \left(H\right)/\sqrt{t}$
of the one-point height $H=h(x=0,t)$ of an evolving 1+1 Kardar-Parisi-Zhang
(KPZ) interface for flat initial condition. This is achieved by combining (i)
the optimal fluctuation method, (ii) a time-reversal symmetry of the KPZ
equation in 1+1 dimension, and (iii) the recently determined exact short-time
height distribution $-\ln \mathcal{P}_{\text{st}}\left(H,t\right)=
S_{\text{st}} \left(H\right)/\sqrt{t}$ for \emph{stationary} initial condition.
In studying the large-deviation function $S_{\text{st}} \left(H\right)$ of the
latter, one encounters two branches: an analytic and a non-analytic. The
analytic branch is non-physical beyond a critical value of $H$ where a
second-order dynamical phase transition occurs. Here we show that, remarkably,
it is the analytic branch of $S_{\text{st}} \left(H\right)$ which determines
the large-deviation function $S_{\text{f}} \left(H\right)$ of the flat
interface via a simple mapping
$S_{\text{f}}\left(H\right)=2^{-3/2}S_{\text{st}}\left(2H\right)$.
|
cond-mat.stat-mech
|
we determine the exact shorttime distribution ln mathcalp_textflefthtright s_textf lefthrightsqrtt of the onepoint height hhx0t of an evolving 11 kardarparisizhang kpz interface for flat initial condition this is achieved by combining i the optimal fluctuation method ii a timereversal symmetry of the kpz equation in 11 dimension and iii the recently determined exact shorttime height distribution ln mathcalp_textstlefthtright s_textst lefthrightsqrtt for emphstationary initial condition in studying the largedeviation function s_textst lefthright of the latter one encounters two branches an analytic and a nonanalytic the analytic branch is nonphysical beyond a critical value of h where a secondorder dynamical phase transition occurs here we show that remarkably it is the analytic branch of s_textst lefthright which determines the largedeviation function s_textf lefthright of the flat interface via a simple mapping s_textflefthright232s_textstleft2hright
|
[['we', 'determine', 'the', 'exact', 'shorttime', 'distribution', 'ln', 'mathcalp_textflefthtright', 's_textf', 'lefthrightsqrtt', 'of', 'the', 'onepoint', 'height', 'hhx0t', 'of', 'an', 'evolving', '11', 'kardarparisizhang', 'kpz', 'interface', 'for', 'flat', 'initial', 'condition', 'this', 'is', 'achieved', 'by', 'combining', 'i', 'the', 'optimal', 'fluctuation', 'method', 'ii', 'a', 'timereversal', 'symmetry', 'of', 'the', 'kpz', 'equation', 'in', '11', 'dimension', 'and', 'iii', 'the', 'recently', 'determined', 'exact', 'shorttime', 'height', 'distribution', 'ln', 'mathcalp_textstlefthtright', 's_textst', 'lefthrightsqrtt', 'for', 'emphstationary', 'initial', 'condition', 'in', 'studying', 'the', 'largedeviation', 'function', 's_textst', 'lefthright', 'of', 'the', 'latter', 'one', 'encounters', 'two', 'branches', 'an', 'analytic', 'and', 'a', 'nonanalytic', 'the', 'analytic', 'branch', 'is', 'nonphysical', 'beyond', 'a', 'critical', 'value', 'of', 'h', 'where', 'a', 'secondorder', 'dynamical', 'phase', 'transition', 'occurs', 'here', 'we', 'show', 'that', 'remarkably', 'it', 'is', 'the', 'analytic', 'branch', 'of', 's_textst', 'lefthright', 'which', 'determines', 'the', 'largedeviation', 'function', 's_textf', 'lefthright', 'of', 'the', 'flat', 'interface', 'via', 'a', 'simple', 'mapping', 's_textflefthright232s_textstleft2hright']]
|
[-0.15325110002619322, 0.1188806880775507, -0.1431505006554796, 0.1054840362726207, -0.042687226132657685, -0.16269664777935192, 0.03483674673842587, 0.2879521078811806, -0.24150082969286127, -0.20213374978534449, 0.06659619790906483, -0.24916002669249523, -0.15407862784111964, 0.1577998432559801, 0.019964068908564992, 0.08451587763294334, -0.016049540281051496, 0.01484667185739782, -0.10221918707820357, -0.1685287395347154, 0.3360720368743431, -0.007933706174925214, 0.2850582098672319, 0.04856434176660708, 0.10313869020367256, 0.002436948076585216, 0.03530645039176843, -0.01920960817226499, -0.2287534142324446, 0.05352953810351672, 0.17627878127367708, 0.05913610856972452, 0.22893498509694807, -0.3452378767618879, -0.17611743435530816, 0.07697440250624032, 0.1868807533297871, 0.11994448459046878, -0.02555936838301723, -0.26395868696272373, 0.06016661632676288, -0.11629638802756356, -0.2277488719221571, 0.022892376499586416, 0.05847231425978549, 0.015081539131762063, -0.28972170429998917, 0.14407599017169082, 0.07582389445499266, 0.060846586036114175, -0.04531946628293419, -0.0646024599335477, -0.08457456723802158, 0.10645835148456857, 0.030714183257125532, 0.04857648495722135, 0.10309797407559226, -0.15172443288706672, -0.026165214739358206, 0.2915219385482249, -0.08616405287919734, -0.15786889409737043, 0.15421704620840487, -0.17965341104408267, -0.10568508353908776, 0.15091209880030546, 0.072478672551787, 0.13027626282695803, -0.15184177859823722, 0.16920533010518546, -0.00582844410549666, 0.1396903123050073, 0.07925676097940715, -0.041406086481893895, 0.1432190987617388, 0.13638427532965042, 0.07201426566509744, 0.14272614345088083, -0.05295610415642379, -0.14369966970665043, -0.35020948599901847, -0.17916777637428374, -0.2441780414188006, 0.0923396660602789, -0.15866291353485706, -0.23653879947196998, 0.37322105989470833, 0.09490067291943753, 0.22057061774091277, 0.09972365870098507, 0.1978435703747921, 0.21192447741928158, 0.009066823368021821, 0.08812382035186422, 0.20602019062479499, 0.11881813668210792, 0.07655422345231302, -0.2574276812050156, 0.041152219192628736, 0.11736020338378053]
|
1,803.04864
|
Resource Allocation in Wireless Networks with Energy Constraints
|
This dissertation focuses on the development of novel scheduling and resource
allocation schemes, which take into account and regulate the energy constraints
imposed by the levels of harvested energy. To this direction, first, the
optimal energy, time, and bandwidth allocation problem for the downlink of
energy harvesting base stations (EHBSs) is investigated, with the main focus
being on autonomous EHBSs. The presented analysis considers the impact of the
energy constraint on users' preferences and the BS's revenue. In order to model
the competitive nature of the problem, game theory is used. The next two
chapters focus on wireless powered networks (WPNs) and simultaneous wireless
information and power transfer (SWIPT) using radio frequency (RF) technology.
One of the main contributions of these chapters is the introduction of both
uplink and downlink non-orthogonal multiple access (NOMA) for WPNs. Moreover,
the individual data rates and fairness are improved, while the formulated
problems are optimally and efficiently solved. It is shown that, compared to
orthogonal multiple access, NOMA offers a considerable improvement in
throughput, fairness, and energy efficiency. Rather than this, proportional
fairness is maximized and uplink/downlink of WPNs are jointly optimized, in
which cases, except for NOMA, time division multiple access (TDMA) is also
investigated. Furthermore, the role of interference is considered, which has
been recognized as one of the main reasons of the asymmetric overall
degradation of the users' performance, due to different path-loss values,
called from now on as cascaded near-far problem. Moreover, SWIPT is
investigated and efficiently optimized in the context of multicarrier
cooperative communication networks. Finally, simultaneous lightwave information
and power transfer (SLIPT) is introduced, while novel and fundamental
techniques are proposed.
|
eess.SP
|
this dissertation focuses on the development of novel scheduling and resource allocation schemes which take into account and regulate the energy constraints imposed by the levels of harvested energy to this direction first the optimal energy time and bandwidth allocation problem for the downlink of energy harvesting base stations ehbss is investigated with the main focus being on autonomous ehbss the presented analysis considers the impact of the energy constraint on users preferences and the bss revenue in order to model the competitive nature of the problem game theory is used the next two chapters focus on wireless powered networks wpns and simultaneous wireless information and power transfer swipt using radio frequency rf technology one of the main contributions of these chapters is the introduction of both uplink and downlink nonorthogonal multiple access noma for wpns moreover the individual data rates and fairness are improved while the formulated problems are optimally and efficiently solved it is shown that compared to orthogonal multiple access noma offers a considerable improvement in throughput fairness and energy efficiency rather than this proportional fairness is maximized and uplinkdownlink of wpns are jointly optimized in which cases except for noma time division multiple access tdma is also investigated furthermore the role of interference is considered which has been recognized as one of the main reasons of the asymmetric overall degradation of the users performance due to different pathloss values called from now on as cascaded nearfar problem moreover swipt is investigated and efficiently optimized in the context of multicarrier cooperative communication networks finally simultaneous lightwave information and power transfer slipt is introduced while novel and fundamental techniques are proposed
|
[['this', 'dissertation', 'focuses', 'on', 'the', 'development', 'of', 'novel', 'scheduling', 'and', 'resource', 'allocation', 'schemes', 'which', 'take', 'into', 'account', 'and', 'regulate', 'the', 'energy', 'constraints', 'imposed', 'by', 'the', 'levels', 'of', 'harvested', 'energy', 'to', 'this', 'direction', 'first', 'the', 'optimal', 'energy', 'time', 'and', 'bandwidth', 'allocation', 'problem', 'for', 'the', 'downlink', 'of', 'energy', 'harvesting', 'base', 'stations', 'ehbss', 'is', 'investigated', 'with', 'the', 'main', 'focus', 'being', 'on', 'autonomous', 'ehbss', 'the', 'presented', 'analysis', 'considers', 'the', 'impact', 'of', 'the', 'energy', 'constraint', 'on', 'users', 'preferences', 'and', 'the', 'bss', 'revenue', 'in', 'order', 'to', 'model', 'the', 'competitive', 'nature', 'of', 'the', 'problem', 'game', 'theory', 'is', 'used', 'the', 'next', 'two', 'chapters', 'focus', 'on', 'wireless', 'powered', 'networks', 'wpns', 'and', 'simultaneous', 'wireless', 'information', 'and', 'power', 'transfer', 'swipt', 'using', 'radio', 'frequency', 'rf', 'technology', 'one', 'of', 'the', 'main', 'contributions', 'of', 'these', 'chapters', 'is', 'the', 'introduction', 'of', 'both', 'uplink', 'and', 'downlink', 'nonorthogonal', 'multiple', 'access', 'noma', 'for', 'wpns', 'moreover', 'the', 'individual', 'data', 'rates', 'and', 'fairness', 'are', 'improved', 'while', 'the', 'formulated', 'problems', 'are', 'optimally', 'and', 'efficiently', 'solved', 'it', 'is', 'shown', 'that', 'compared', 'to', 'orthogonal', 'multiple', 'access', 'noma', 'offers', 'a', 'considerable', 'improvement', 'in', 'throughput', 'fairness', 'and', 'energy', 'efficiency', 'rather', 'than', 'this', 'proportional', 'fairness', 'is', 'maximized', 'and', 'uplinkdownlink', 'of', 'wpns', 'are', 'jointly', 'optimized', 'in', 'which', 'cases', 'except', 'for', 'noma', 'time', 'division', 'multiple', 'access', 'tdma', 'is', 'also', 'investigated', 'furthermore', 'the', 'role', 'of', 'interference', 'is', 'considered', 'which', 'has', 'been', 'recognized', 'as', 'one', 'of', 'the', 'main', 'reasons', 'of', 'the', 'asymmetric', 'overall', 'degradation', 'of', 'the', 'users', 'performance', 'due', 'to', 'different', 'pathloss', 'values', 'called', 'from', 'now', 'on', 'as', 'cascaded', 'nearfar', 'problem', 'moreover', 'swipt', 'is', 'investigated', 'and', 'efficiently', 'optimized', 'in', 'the', 'context', 'of', 'multicarrier', 'cooperative', 'communication', 'networks', 'finally', 'simultaneous', 'lightwave', 'information', 'and', 'power', 'transfer', 'slipt', 'is', 'introduced', 'while', 'novel', 'and', 'fundamental', 'techniques', 'are', 'proposed']]
|
[-0.2246793260831365, 0.0114098738155558, -0.009255634977334485, 0.04549222382909285, -0.07524934182857675, -0.21552244439975418, 0.09408905288690832, 0.3898631749654058, -0.26336548413318406, -0.28812243756442935, 0.08322669937175688, -0.228552814860866, -0.13976161006143886, 0.16161826298408025, -0.10017801894088073, 0.053420479201964736, 0.0470904230493047, 0.034082683944229274, 0.016138711843271893, -0.26243183741129494, 0.3096202698972667, 0.1486700820922164, 0.4132593200538596, 0.07033163281346627, 0.09177888897926344, 0.018777972259094795, -0.05967254780565399, -0.036827313655689524, -0.07660411290727866, 0.132821925998686, 0.3360021666054892, 0.17314664089907908, 0.3301385881678232, -0.4226707096015725, -0.2634883789977959, 0.0862760137125671, 0.16657707000080826, 0.0070996292075485926, -0.03588482987168297, -0.22749132163757355, 0.10387898230241316, -0.2300840057741947, 0.007505658902296611, 0.0023095289917965164, -0.06942970195623643, 0.06387720981439253, -0.3323487458489423, 0.020856163229400676, 0.012851503594113493, 0.005362734511302186, -0.0971243712215339, -0.14446611828480013, 0.024431887874895246, 0.18135410097059948, 0.06612202298408203, -0.038383786439400755, 0.07323444170067156, -0.0880354424153293, -0.14471940223533125, 0.413190329091699, 0.03948421731226729, -0.2059502265204734, 0.13561076428947413, -0.05261705450995437, -0.1078684662779745, 0.13046333169035365, 0.24205437955889864, 0.07721818930228246, -0.20079681152139353, 0.03279807265354767, 0.021952585128180654, 0.15061773925485275, 0.10682907840838429, 0.13183296219543708, 0.15844960361195048, 0.2059116102437183, 0.12966331588559718, 0.1260690090987089, -0.0860092234050312, -0.14972731968769426, -0.17084292822489103, -0.10370444803759868, -0.21059968644354451, 0.023470369709751866, -0.058853712951102054, -0.02832344429585928, 0.4121977935151386, 0.11343121645298557, 0.09122164119413033, 0.060377977463258674, 0.420143334151201, 0.1351200292940248, 0.06240648213783417, 0.11429822517600172, 0.21511951590694034, 0.08696184372890232, 0.1725823969813923, -0.2431606188467171, 0.04187789298353435, -0.011307161168205617]
|
1,803.04865
|
Mathematical models and search algorithms for the capacitated $p$-center
problem
|
The capacitated p-center problem requires to select p facilities from a set
of candidates to service a number of customers, subject to facility capacity
constraints, with the aim of minimizing the maximum distance between a customer
and its associated facility. The problem is well known in the field of facility
location, because of the many applications that it can model. In this paper, we
solve it by means of search algorithms that iteratively seek the optimal
distance by solving tailored subproblems. We present different mathematical
formulations for the subproblems and improve them by means of several valid
inequalities, including an effective one based on a 0-1 disjunction and the
solution of subset sum problems. We also develop an alternative search strategy
that finds a balance between the traditional sequential search and binary
search. This strategy limits the number of feasible subproblems to be solved
and, at the same time, avoids large overestimates of the solution value, which
are detrimental for the search. We evaluate the proposed techniques by means of
extensive computational experiments on benchmark instances from the literature
and new larger test sets. All instances from the literature with up to 402
vertices and integer distances are solved to proven optimality, including 13
open cases, and feasible solutions are found in 10 minutes for instances with
up to 3038 vertices.
|
cs.DS
|
the capacitated pcenter problem requires to select p facilities from a set of candidates to service a number of customers subject to facility capacity constraints with the aim of minimizing the maximum distance between a customer and its associated facility the problem is well known in the field of facility location because of the many applications that it can model in this paper we solve it by means of search algorithms that iteratively seek the optimal distance by solving tailored subproblems we present different mathematical formulations for the subproblems and improve them by means of several valid inequalities including an effective one based on a 01 disjunction and the solution of subset sum problems we also develop an alternative search strategy that finds a balance between the traditional sequential search and binary search this strategy limits the number of feasible subproblems to be solved and at the same time avoids large overestimates of the solution value which are detrimental for the search we evaluate the proposed techniques by means of extensive computational experiments on benchmark instances from the literature and new larger test sets all instances from the literature with up to 402 vertices and integer distances are solved to proven optimality including 13 open cases and feasible solutions are found in 10 minutes for instances with up to 3038 vertices
|
[['the', 'capacitated', 'pcenter', 'problem', 'requires', 'to', 'select', 'p', 'facilities', 'from', 'a', 'set', 'of', 'candidates', 'to', 'service', 'a', 'number', 'of', 'customers', 'subject', 'to', 'facility', 'capacity', 'constraints', 'with', 'the', 'aim', 'of', 'minimizing', 'the', 'maximum', 'distance', 'between', 'a', 'customer', 'and', 'its', 'associated', 'facility', 'the', 'problem', 'is', 'well', 'known', 'in', 'the', 'field', 'of', 'facility', 'location', 'because', 'of', 'the', 'many', 'applications', 'that', 'it', 'can', 'model', 'in', 'this', 'paper', 'we', 'solve', 'it', 'by', 'means', 'of', 'search', 'algorithms', 'that', 'iteratively', 'seek', 'the', 'optimal', 'distance', 'by', 'solving', 'tailored', 'subproblems', 'we', 'present', 'different', 'mathematical', 'formulations', 'for', 'the', 'subproblems', 'and', 'improve', 'them', 'by', 'means', 'of', 'several', 'valid', 'inequalities', 'including', 'an', 'effective', 'one', 'based', 'on', 'a', '01', 'disjunction', 'and', 'the', 'solution', 'of', 'subset', 'sum', 'problems', 'we', 'also', 'develop', 'an', 'alternative', 'search', 'strategy', 'that', 'finds', 'a', 'balance', 'between', 'the', 'traditional', 'sequential', 'search', 'and', 'binary', 'search', 'this', 'strategy', 'limits', 'the', 'number', 'of', 'feasible', 'subproblems', 'to', 'be', 'solved', 'and', 'at', 'the', 'same', 'time', 'avoids', 'large', 'overestimates', 'of', 'the', 'solution', 'value', 'which', 'are', 'detrimental', 'for', 'the', 'search', 'we', 'evaluate', 'the', 'proposed', 'techniques', 'by', 'means', 'of', 'extensive', 'computational', 'experiments', 'on', 'benchmark', 'instances', 'from', 'the', 'literature', 'and', 'new', 'larger', 'test', 'sets', 'all', 'instances', 'from', 'the', 'literature', 'with', 'up', 'to', '402', 'vertices', 'and', 'integer', 'distances', 'are', 'solved', 'to', 'proven', 'optimality', 'including', '13', 'open', 'cases', 'and', 'feasible', 'solutions', 'are', 'found', 'in', '10', 'minutes', 'for', 'instances', 'with', 'up', 'to', '3038', 'vertices']]
|
[-0.0872376515008288, 0.02076432254951346, -0.04511676846404994, 0.06311863217433299, -0.1029983792281225, -0.15965141376640596, 0.13155262769522288, 0.36764769629486815, -0.29927079207832796, -0.38767802330762213, 0.13414642450292236, -0.28780418830582394, -0.09242309899726774, 0.21823539543787346, -0.0431475436854349, 0.10072424954695762, 0.08612593553530482, 0.02244446380116568, -0.04325494913297929, -0.2822407063452856, 0.2806434907562761, 0.04132359401992948, 0.24632727427985435, 0.049478378114227325, 0.10402487272952948, -0.010371727615276697, -0.026864119191186257, 0.058325516592612904, -0.12011216504641412, 0.13388220581322977, 0.2866369331881353, 0.20820434459978165, 0.3124401096962561, -0.413267452054872, -0.14018016599531694, 0.13309334078224216, 0.11349734809719515, 0.07748702029556424, -0.03709025054377803, -0.2508897728511086, 0.09526169827688334, -0.11262298364095323, -0.0968466892151575, -0.04634909469811288, 0.015748460537425298, 0.027686400996411547, -0.307504944132464, 0.005516218239856606, -0.007339678575680907, -0.004153644326311532, -0.06670830959540569, -0.16740552180265478, 0.06997334545191664, 0.11511631391318809, 0.06457858840614658, 0.035979616860290185, 0.06756284169861163, -0.1180870863511235, -0.16095301181044244, 0.41221579224107224, -0.009972759743739443, -0.1820998274030088, 0.18907873434377034, -0.0540753537915411, -0.11794185942477163, 0.1352516141587371, 0.19095147897821757, 0.19255699304973378, -0.20149977669979519, 0.06929898834724098, -0.055462342300831566, 0.1430837068494991, 0.08220250883594796, 0.002337757936295341, 0.1708765033404954, 0.1680783940567656, 0.13857296309739403, 0.16423307550698096, -0.0691761796733278, -0.09183104900744368, -0.2715058839496444, -0.10788640254956768, -0.17758900994104143, -0.013997284288842619, -0.09361411259737186, -0.10310387967061672, 0.3646274888213741, 0.18205258976752403, 0.17168388807960697, 0.07894888812016561, 0.27708591457574344, 0.10203278675309026, 0.08601735652834219, 0.12802768608015788, 0.1995004154135983, 0.05615682659957271, 0.06465330582988613, -0.21582456456014792, 0.06032413197892014, 0.07477118181932836]
|
1,803.04866
|
Dealing with Unknown Unknowns: Identification and Selection of Minimal
Sensing for Fractional Dynamics with Unknown Inputs
|
This paper focuses on analysis and design of time-varying complex networks
having fractional order dynamics. These systems are key in modeling the complex
dynamical processes arising in several natural and man made systems. Notably,
examples include neurophysiological signals such as electroencephalogram (EEG)
that captures the variation in potential fields, and blood oxygenation level
dependent (BOLD) signal, which serves as a proxy for neuronal activity.
Notwithstanding, the complex networks originated by locally measuring EEG and
BOLD are often treated as isolated networks and do not capture the dependency
from external stimuli, e.g., originated in subcortical structures such as the
thalamus and the brain stem. Therefore, we propose a paradigm-shift towards the
analysis of such complex networks under unknown unknowns (i.e., excitations).
Consequently, the main contributions of the present paper are threefold: (i) we
present an alternating scheme that enables to determine the best estimate of
the model parameters and unknown stimuli; (ii) we provide necessary and
sufficient conditions to ensure that it is possible to retrieve the state and
unknown stimuli; and (iii) upon these conditions we determine a small subset of
variables that need to be measured to ensure that both state and input can be
recovered, while establishing sub-optimality guarantees with respect to the
smallest possible subset. Finally, we present several pedagogical examples of
the main results using real data collected from an EEG wearable device.
|
eess.SP cs.LG
|
this paper focuses on analysis and design of timevarying complex networks having fractional order dynamics these systems are key in modeling the complex dynamical processes arising in several natural and man made systems notably examples include neurophysiological signals such as electroencephalogram eeg that captures the variation in potential fields and blood oxygenation level dependent bold signal which serves as a proxy for neuronal activity notwithstanding the complex networks originated by locally measuring eeg and bold are often treated as isolated networks and do not capture the dependency from external stimuli eg originated in subcortical structures such as the thalamus and the brain stem therefore we propose a paradigmshift towards the analysis of such complex networks under unknown unknowns ie excitations consequently the main contributions of the present paper are threefold i we present an alternating scheme that enables to determine the best estimate of the model parameters and unknown stimuli ii we provide necessary and sufficient conditions to ensure that it is possible to retrieve the state and unknown stimuli and iii upon these conditions we determine a small subset of variables that need to be measured to ensure that both state and input can be recovered while establishing suboptimality guarantees with respect to the smallest possible subset finally we present several pedagogical examples of the main results using real data collected from an eeg wearable device
|
[['this', 'paper', 'focuses', 'on', 'analysis', 'and', 'design', 'of', 'timevarying', 'complex', 'networks', 'having', 'fractional', 'order', 'dynamics', 'these', 'systems', 'are', 'key', 'in', 'modeling', 'the', 'complex', 'dynamical', 'processes', 'arising', 'in', 'several', 'natural', 'and', 'man', 'made', 'systems', 'notably', 'examples', 'include', 'neurophysiological', 'signals', 'such', 'as', 'electroencephalogram', 'eeg', 'that', 'captures', 'the', 'variation', 'in', 'potential', 'fields', 'and', 'blood', 'oxygenation', 'level', 'dependent', 'bold', 'signal', 'which', 'serves', 'as', 'a', 'proxy', 'for', 'neuronal', 'activity', 'notwithstanding', 'the', 'complex', 'networks', 'originated', 'by', 'locally', 'measuring', 'eeg', 'and', 'bold', 'are', 'often', 'treated', 'as', 'isolated', 'networks', 'and', 'do', 'not', 'capture', 'the', 'dependency', 'from', 'external', 'stimuli', 'eg', 'originated', 'in', 'subcortical', 'structures', 'such', 'as', 'the', 'thalamus', 'and', 'the', 'brain', 'stem', 'therefore', 'we', 'propose', 'a', 'paradigmshift', 'towards', 'the', 'analysis', 'of', 'such', 'complex', 'networks', 'under', 'unknown', 'unknowns', 'ie', 'excitations', 'consequently', 'the', 'main', 'contributions', 'of', 'the', 'present', 'paper', 'are', 'threefold', 'i', 'we', 'present', 'an', 'alternating', 'scheme', 'that', 'enables', 'to', 'determine', 'the', 'best', 'estimate', 'of', 'the', 'model', 'parameters', 'and', 'unknown', 'stimuli', 'ii', 'we', 'provide', 'necessary', 'and', 'sufficient', 'conditions', 'to', 'ensure', 'that', 'it', 'is', 'possible', 'to', 'retrieve', 'the', 'state', 'and', 'unknown', 'stimuli', 'and', 'iii', 'upon', 'these', 'conditions', 'we', 'determine', 'a', 'small', 'subset', 'of', 'variables', 'that', 'need', 'to', 'be', 'measured', 'to', 'ensure', 'that', 'both', 'state', 'and', 'input', 'can', 'be', 'recovered', 'while', 'establishing', 'suboptimality', 'guarantees', 'with', 'respect', 'to', 'the', 'smallest', 'possible', 'subset', 'finally', 'we', 'present', 'several', 'pedagogical', 'examples', 'of', 'the', 'main', 'results', 'using', 'real', 'data', 'collected', 'from', 'an', 'eeg', 'wearable', 'device']]
|
[-0.10364917797212887, 0.08686045568248171, -0.03509163217709322, 0.07301084290459621, -0.0845746342626109, -0.13582431955420973, 0.02589675499893528, 0.39368508099721916, -0.2693981830326077, -0.3060853453735115, 0.13110164234964464, -0.26259781213657774, -0.2533389151458924, 0.18787754187924532, -0.10182287773788895, 0.033930427263006734, 0.0475140440027488, 0.05447960488145888, -0.004136743206050788, -0.19215073753640646, 0.32317958690743026, 0.015092503226111902, 0.2658195266918595, 0.027246653101056208, 0.11473793163632776, -0.021088002666026878, -0.058190145808793114, 0.007420995888107411, -0.07936213019851822, 0.11314099219972308, 0.2926389033309213, 0.17270699343418433, 0.2632462413693916, -0.48886722194170373, -0.22403974320723097, 0.126644087037367, 0.12190715892932487, 0.09822772276159047, -0.0337039881395094, -0.3080049177656352, 0.1098362729137985, -0.11245801786600822, -0.07883563405415658, -0.13033449503958291, 0.003241432906592076, 0.04509963610877246, -0.2936995569862721, 0.06322195956899912, 0.04387660322919599, 0.09088111872321183, -0.08845786524306785, -0.09559310529902085, -0.007211837604219332, 0.20729631121298053, 0.05471134550781256, 0.024174292666846803, 0.16083803185413587, -0.1264981154243704, -0.09849372077097353, 0.35880943670374493, -0.023611704204775114, -0.20030773204078464, 0.23406386036079146, -0.10151254993325945, -0.13404757772174372, 0.09111810776421447, 0.20329292392945902, 0.07893268398785172, -0.18819183754090565, 0.005058538986396635, 0.014758610125581861, 0.1858835779048404, 0.028057512863116578, 0.04585256748566084, 0.15691222920388165, 0.16807341636291864, 0.04021529952014924, 0.11936711998079957, -0.09061343466456864, -0.04797499003527288, -0.30026619525145254, -0.107853010282462, -0.1585347786912949, 0.03417931904223705, -0.05706853226027482, -0.1510412941034473, 0.4136867035536724, 0.16919130229879384, 0.21505143032009233, 0.04288014637907384, 0.2862647343488484, 0.08484569706185824, 0.05023006874337661, 0.0375926346140647, 0.17191381290829885, 0.11665603667313011, 0.09769856858647752, -0.1928022304941625, 0.1267197018197947, -0.026725960652908567]
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.