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,802.0956 | Evolution of the Stellar Mass--Metallicity Relation - I: Galaxies in the
z~0.4 Cluster Cl0024 | We present the stellar mass-stellar metallicity relationship (MZR) in the
Cl0024+1654 galaxy cluster at z~0.4 using full spectrum stellar population
synthesis modeling of individual quiescent galaxies. The lower limit of our
stellar mass range is $M_*=10^{9.7}M_\odot$, the lowest galaxy mass at which
individual stellar metallicity has been measured beyond the local universe. We
report a detection of an evolution of the stellar MZR with observed redshift at
$0.037\pm0.007$ dex per Gyr, consistent with the predictions from
hydrodynamical simulations. Additionally, we find that the evolution of the
stellar MZR with observed redshift can be explained by an evolution of the
stellar MZR with their formation time, i.e., when the single stellar population
(SSP)-equivalent ages of galaxies are taken into account. This behavior is
consistent with stars forming out of gas that also has an MZR with a
normalization that decreases with redshift. Lastly, we find that over the
observed mass range, the MZR can be described by a linear function with a
shallow slope, ($[Fe/H] \propto (0.16 \pm 0.03) \log M_*$). The slope suggests
that galaxy feedback, in terms of mass-loading factor, might be
mass-independent over the observed mass and redshift range.
| astro-ph.GA | we present the stellar massstellar metallicity relationship mzr in the cl00241654 galaxy cluster at z04 using full spectrum stellar population synthesis modeling of individual quiescent galaxies the lower limit of our stellar mass range is m_1097m_odot the lowest galaxy mass at which individual stellar metallicity has been measured beyond the local universe we report a detection of an evolution of the stellar mzr with observed redshift at 0037pm0007 dex per gyr consistent with the predictions from hydrodynamical simulations additionally we find that the evolution of the stellar mzr with observed redshift can be explained by an evolution of the stellar mzr with their formation time ie when the single stellar population sspequivalent ages of galaxies are taken into account this behavior is consistent with stars forming out of gas that also has an mzr with a normalization that decreases with redshift lastly we find that over the observed mass range the mzr can be described by a linear function with a shallow slope feh propto 016 pm 003 log m_ the slope suggests that galaxy feedback in terms of massloading factor might be massindependent over the observed mass and redshift range | [['we', 'present', 'the', 'stellar', 'massstellar', 'metallicity', 'relationship', 'mzr', 'in', 'the', 'cl00241654', 'galaxy', 'cluster', 'at', 'z04', 'using', 'full', 'spectrum', 'stellar', 'population', 'synthesis', 'modeling', 'of', 'individual', 'quiescent', 'galaxies', 'the', 'lower', 'limit', 'of', 'our', 'stellar', 'mass', 'range', 'is', 'm_1097m_odot', 'the', 'lowest', 'galaxy', 'mass', 'at', 'which', 'individual', 'stellar', 'metallicity', 'has', 'been', 'measured', 'beyond', 'the', 'local', 'universe', 'we', 'report', 'a', 'detection', 'of', 'an', 'evolution', 'of', 'the', 'stellar', 'mzr', 'with', 'observed', 'redshift', 'at', '0037pm0007', 'dex', 'per', 'gyr', 'consistent', 'with', 'the', 'predictions', 'from', 'hydrodynamical', 'simulations', 'additionally', 'we', 'find', 'that', 'the', 'evolution', 'of', 'the', 'stellar', 'mzr', 'with', 'observed', 'redshift', 'can', 'be', 'explained', 'by', 'an', 'evolution', 'of', 'the', 'stellar', 'mzr', 'with', 'their', 'formation', 'time', 'ie', 'when', 'the', 'single', 'stellar', 'population', 'sspequivalent', 'ages', 'of', 'galaxies', 'are', 'taken', 'into', 'account', 'this', 'behavior', 'is', 'consistent', 'with', 'stars', 'forming', 'out', 'of', 'gas', 'that', 'also', 'has', 'an', 'mzr', 'with', 'a', 'normalization', 'that', 'decreases', 'with', 'redshift', 'lastly', 'we', 'find', 'that', 'over', 'the', 'observed', 'mass', 'range', 'the', 'mzr', 'can', 'be', 'described', 'by', 'a', 'linear', 'function', 'with', 'a', 'shallow', 'slope', 'feh', 'propto', '016', 'pm', '003', 'log', 'm_', 'the', 'slope', 'suggests', 'that', 'galaxy', 'feedback', 'in', 'terms', 'of', 'massloading', 'factor', 'might', 'be', 'massindependent', 'over', 'the', 'observed', 'mass', 'and', 'redshift', 'range']] | [-0.02834034289347954, 0.1350861716316859, -0.09030010303107913, 0.09765823074387357, -0.047455764572732345, -0.023776132433561893, 0.04317800987329551, 0.4533857906818705, -0.13314406830255712, -0.40205535333032016, -0.046081611254651635, -0.26588038858223373, 0.012346878103300851, 0.20548388509759827, -0.02081087435208872, -0.036620722255773015, 0.036890820762088335, -0.08770699694225437, -0.10481983470137936, -0.30186506211154024, 0.31755487635859814, 0.07162367462497156, 0.14226204618717983, -0.0612770069301838, 0.07077030531683857, -0.12451916493268476, -0.0564225411446637, -0.011131791486010626, -0.2169083007614799, -0.047173777102399124, 0.24615023823617588, 0.11888621520699451, 0.2554290666067529, -0.2769537542862867, -0.21697777497123868, 0.0650372973017434, 0.2565453003170511, 0.03665401201347806, -0.13681923449852518, -0.2225389361243557, 0.06737745116913209, -0.22795650321083566, -0.15232560019856983, 0.11743531947205257, 0.010663422864304963, 0.012763748402282964, -0.22857328872910884, 0.2520021395602266, -0.00973668006598634, 0.11592124080748628, -0.13189039564144517, -0.11065081811248861, -0.15775542509761792, 0.09192747223112738, 0.01847731564397229, 0.09586065060769518, 0.19133788751926095, -0.11228579312695988, 0.039479290261475376, 0.4102990641973164, -0.11330160933482662, 0.018230549536556714, 0.18420529667233862, -0.24189116329289775, -0.16531635403864717, 0.06017102470754513, 0.14636441857292853, 0.05998069549068099, -0.1619742797696427, 0.03359070025781254, -0.024864306806453636, 0.29563965226237776, -0.007542334193925536, 0.0313519234143083, 0.3403150424183834, 0.14552701157998174, 0.010024260231860416, 0.0003160096362489399, -0.17632728012983329, -0.036304490241621225, -0.19598565892952066, -0.07315034317850534, -0.08230835587899915, 0.12863711399277525, -0.21177440126068955, -0.1059081709633271, 0.34316386465259174, 0.09307441951105834, 0.27782742408222505, 0.19780123462006155, 0.2811360461957674, 0.18761022850099912, 0.14817652707825854, 0.11305926334378975, 0.2980221214842189, 0.1778150362063633, 0.028026603471497616, -0.3048067935212717, 0.11156771808527607, -0.006210446942883431] |
1,802.09561 | Constructing an Explicit AdS/CFT Correspondence with Cartan Geometry | An explicit AdS/CFT correspondence is shown for the Lie group $SO(4,2)$. The
Lie symmetry structures allow for the construction of two physical theories
through the tools of Cartan geometry. One is a gravitational theory that has
anti-de Sitter symmetry. The other is also a gravitational theory but is
conformally symmetric and lives on 8-dimensional biconformal space. These
"extra" four dimensions have the degrees of freedom used to construct a
Yang-Mills theory. The two theories, based on AdS or conformal symmetry, have a
natural correspondence in the context of their Lie algebras alone where neither
SUSY, nor holography, is necessary.
| gr-qc hep-th math-ph math.MP | an explicit adscft correspondence is shown for the lie group so42 the lie symmetry structures allow for the construction of two physical theories through the tools of cartan geometry one is a gravitational theory that has antide sitter symmetry the other is also a gravitational theory but is conformally symmetric and lives on 8dimensional biconformal space these extra four dimensions have the degrees of freedom used to construct a yangmills theory the two theories based on ads or conformal symmetry have a natural correspondence in the context of their lie algebras alone where neither susy nor holography is necessary | [['an', 'explicit', 'adscft', 'correspondence', 'is', 'shown', 'for', 'the', 'lie', 'group', 'so42', 'the', 'lie', 'symmetry', 'structures', 'allow', 'for', 'the', 'construction', 'of', 'two', 'physical', 'theories', 'through', 'the', 'tools', 'of', 'cartan', 'geometry', 'one', 'is', 'a', 'gravitational', 'theory', 'that', 'has', 'antide', 'sitter', 'symmetry', 'the', 'other', 'is', 'also', 'a', 'gravitational', 'theory', 'but', 'is', 'conformally', 'symmetric', 'and', 'lives', 'on', '8dimensional', 'biconformal', 'space', 'these', 'extra', 'four', 'dimensions', 'have', 'the', 'degrees', 'of', 'freedom', 'used', 'to', 'construct', 'a', 'yangmills', 'theory', 'the', 'two', 'theories', 'based', 'on', 'ads', 'or', 'conformal', 'symmetry', 'have', 'a', 'natural', 'correspondence', 'in', 'the', 'context', 'of', 'their', 'lie', 'algebras', 'alone', 'where', 'neither', 'susy', 'nor', 'holography', 'is', 'necessary']] | [-0.16387918599613124, 0.14720822367102795, -0.1282624386420304, 0.11227477504754195, -0.16674801891180452, -0.15503007992913928, -0.07432761866331214, 0.3535620870651922, -0.16828908464598535, -0.22732488130868383, 0.14437614941870738, -0.23019368786157834, -0.2007097782251999, 0.12897140938892132, -0.05397372501855246, -0.013602866133853718, -0.05062958026173139, 0.13866455799598962, -0.1478232318803555, -0.2670725299365292, 0.3769917253056786, 0.001404708390114735, 0.29342647217628026, 0.013504434548638235, 0.1332188749949288, -0.009961913640827241, 0.0005470301692533974, -0.018707338612670116, -0.10985403032210536, 0.1510638618051554, 0.242799065447403, 0.11043696450728058, 0.1546978721526837, -0.4406199207002617, -0.245544757559658, 0.09882335500283675, 0.14702113212622475, 0.14188955666854827, -0.055615230543407224, -0.2984841423334949, 0.0337262935466086, -0.17702308595956615, -0.16672072139324037, -0.07685865881391848, 0.011563568931035322, -0.14826354510480105, -0.19483531876514204, 0.04898099681436592, 0.03287552059110668, 0.09899345625455332, -0.06470238224772568, -0.00262016344890751, -0.11475558863774017, 0.08205128524856961, 0.06184796813753142, 0.04009643192355982, 0.11530478201651324, -0.11146004110424206, -0.17952513048011395, 0.40943168824293996, 0.02870999808855957, -0.2885257688661416, 0.21094072229849795, -0.15152659526828563, -0.19667499168597238, 0.07918779368070189, 0.09218795239605536, 0.1707921823148023, -0.10630756874352393, 0.26677643202863766, -0.06071839882813469, 0.10925153805286332, 0.10411703786013102, 0.045548368297103375, 0.2675949571974049, 0.06937325764635596, 0.051797032633777516, 0.08041719784736727, 0.047978003979707605, -0.12710965500034468, -0.4219625582071868, -0.1716294012557494, -0.11995570419880684, 0.09949424394539845, -0.1627370937669478, -0.16580515303690166, 0.34356375397512257, 0.07503890969147882, 0.11789343636859247, 0.04171281573691904, 0.19086314792123935, 0.06095762731686159, 0.1297184421299872, 0.02620299287008667, 0.2766222645142915, 0.2159955379355586, 0.03557801537681371, -0.1779493897485387, -0.13332822104219835, 0.20663267754093564] |
1,802.09562 | Radial velocities of RR Lyrae stars in and around NGC 6441 | Detailed elemental abundance patterns of metal-poor ([Fe/H] ~ -1~dex) stars
in the Galactic bulge indicate that a number of them are consistent with
globular cluster (GC) stars and may be former members of dissolved GCs. This
would indicate that a few per cent of the Galactic bulge was built up from
destruction and/or evaporation of globular clusters. Here an attempt is made to
identify such presumptive stripped stars originating from the massive, inner
Galaxy globular cluster NGC~6441 using its rich RR Lyrae variable star (RRL)
population. We present radial velocities of forty RRLs centered on the globular
cluster NGC~6441. All of the 13 RRLs observed within the cluster tidal radius
have velocities consistent with cluster membership, with an average radial
velocity of 24 +- 5~km/s and a star-to-star scatter of 11~km/s. This includes
two new RRLs that were previously not associated with the cluster. Eight RRLs
with radial velocities consistent with cluster membership but up to three time
the distance from the tidal radius are also reported. These potential
extra-tidal RRLs also have exceptionally long periods, which is a curious
characteristic of the NGC~6441 RRL population that hosts RRLs with periods
longer than seen anywhere else in the Milky Way. As expected of stripped
cluster stars, most are inline with the cluster's orbit. Therefore, either the
tidal radius of NGC~6441 is underestimated and/or we are seeing dissolving
cluster stars stemming from NGC~6441 that are building up the old spheroidal
bulge.
| astro-ph.GA astro-ph.SR | detailed elemental abundance patterns of metalpoor feh 1dex stars in the galactic bulge indicate that a number of them are consistent with globular cluster gc stars and may be former members of dissolved gcs this would indicate that a few per cent of the galactic bulge was built up from destruction andor evaporation of globular clusters here an attempt is made to identify such presumptive stripped stars originating from the massive inner galaxy globular cluster ngc6441 using its rich rr lyrae variable star rrl population we present radial velocities of forty rrls centered on the globular cluster ngc6441 all of the 13 rrls observed within the cluster tidal radius have velocities consistent with cluster membership with an average radial velocity of 24 5kms and a startostar scatter of 11kms this includes two new rrls that were previously not associated with the cluster eight rrls with radial velocities consistent with cluster membership but up to three time the distance from the tidal radius are also reported these potential extratidal rrls also have exceptionally long periods which is a curious characteristic of the ngc6441 rrl population that hosts rrls with periods longer than seen anywhere else in the milky way as expected of stripped cluster stars most are inline with the clusters orbit therefore either the tidal radius of ngc6441 is underestimated andor we are seeing dissolving cluster stars stemming from ngc6441 that are building up the old spheroidal bulge | [['detailed', 'elemental', 'abundance', 'patterns', 'of', 'metalpoor', 'feh', '1dex', 'stars', 'in', 'the', 'galactic', 'bulge', 'indicate', 'that', 'a', 'number', 'of', 'them', 'are', 'consistent', 'with', 'globular', 'cluster', 'gc', 'stars', 'and', 'may', 'be', 'former', 'members', 'of', 'dissolved', 'gcs', 'this', 'would', 'indicate', 'that', 'a', 'few', 'per', 'cent', 'of', 'the', 'galactic', 'bulge', 'was', 'built', 'up', 'from', 'destruction', 'andor', 'evaporation', 'of', 'globular', 'clusters', 'here', 'an', 'attempt', 'is', 'made', 'to', 'identify', 'such', 'presumptive', 'stripped', 'stars', 'originating', 'from', 'the', 'massive', 'inner', 'galaxy', 'globular', 'cluster', 'ngc6441', 'using', 'its', 'rich', 'rr', 'lyrae', 'variable', 'star', 'rrl', 'population', 'we', 'present', 'radial', 'velocities', 'of', 'forty', 'rrls', 'centered', 'on', 'the', 'globular', 'cluster', 'ngc6441', 'all', 'of', 'the', '13', 'rrls', 'observed', 'within', 'the', 'cluster', 'tidal', 'radius', 'have', 'velocities', 'consistent', 'with', 'cluster', 'membership', 'with', 'an', 'average', 'radial', 'velocity', 'of', '24', '5kms', 'and', 'a', 'startostar', 'scatter', 'of', '11kms', 'this', 'includes', 'two', 'new', 'rrls', 'that', 'were', 'previously', 'not', 'associated', 'with', 'the', 'cluster', 'eight', 'rrls', 'with', 'radial', 'velocities', 'consistent', 'with', 'cluster', 'membership', 'but', 'up', 'to', 'three', 'time', 'the', 'distance', 'from', 'the', 'tidal', 'radius', 'are', 'also', 'reported', 'these', 'potential', 'extratidal', 'rrls', 'also', 'have', 'exceptionally', 'long', 'periods', 'which', 'is', 'a', 'curious', 'characteristic', 'of', 'the', 'ngc6441', 'rrl', 'population', 'that', 'hosts', 'rrls', 'with', 'periods', 'longer', 'than', 'seen', 'anywhere', 'else', 'in', 'the', 'milky', 'way', 'as', 'expected', 'of', 'stripped', 'cluster', 'stars', 'most', 'are', 'inline', 'with', 'the', 'clusters', 'orbit', 'therefore', 'either', 'the', 'tidal', 'radius', 'of', 'ngc6441', 'is', 'underestimated', 'andor', 'we', 'are', 'seeing', 'dissolving', 'cluster', 'stars', 'stemming', 'from', 'ngc6441', 'that', 'are', 'building', 'up', 'the', 'old', 'spheroidal', 'bulge']] | [-0.05951724667396821, 0.12474420880184131, -0.10569514447669912, 0.0753002617737074, -0.1463707315559668, -0.03236603599340352, 0.09403165671601106, 0.44088988788897476, -0.1520773385949079, -0.36439228545921515, -0.017623249689934437, -0.30191750395114686, 0.0031062099239730005, 0.2075935093340177, -0.06083574166147133, -0.07283106007645661, 0.11521202869878351, -0.01506463887822276, -0.014687411500856217, -0.3457702482806888, 0.26722213570991304, 0.0008794921234187194, 0.06905868107881319, -0.15119101622688116, 0.0011977047702682673, -0.14193992980634046, -0.0901609915406895, -0.0016620232711864423, -0.13659611776477154, 0.07798367342174854, 0.21627806505396616, 0.1376842088262523, 0.22139219228445478, -0.34695054797891856, -0.17728707436786548, 0.03603457537271428, 0.3022889791799214, 0.07928756263670964, -0.10717980793180172, -0.28743350619395197, 0.09698770853851918, -0.21500285650811743, -0.26194878388589193, 0.11725973410586893, 0.10235026157127088, 0.0824192896630725, -0.14197491250641425, 0.22616463780716525, 0.006222009981043228, 0.14573359202676087, -0.1308663269446697, -0.21159375586275814, -0.057951613060171214, 0.08815477979698569, 0.018818902974665354, 0.07909140735275194, 0.1932838226920033, -0.06290806682568185, -0.0024430345299846262, 0.41008482280851416, -0.0543901203694495, 0.061680352484280804, 0.24548329980228537, -0.21317710594828182, -0.21349156513723705, 0.09768568654249929, 0.11220958956540857, 0.09878957709729798, -0.24190467277753958, -0.011295770138270272, -0.04099339398679241, 0.2329371828440467, 0.11933331266104515, 0.06945391137941047, 0.3542575552462274, 0.047820140440645725, 0.05970218138895017, 0.03680562519100947, -0.28679796520122997, -0.08358476581719983, -0.18829189217256437, -0.08225013236004372, -0.06368546003627076, 0.058268147774243564, -0.16044514983062796, -0.16716349438689493, 0.27762737491792894, 0.05187322789231386, 0.21123726836323173, 0.04487418888820992, 0.22848494393350202, 0.046907053621316856, 0.1953805675317498, 0.15734371750415127, 0.2901819782991764, 0.22664909611381434, 0.016011992444869776, -0.24994490989424947, 0.10865275794443702, -0.03908698209895426] |
1,802.09563 | OGLE-2016-BLG-1266: A Probable Brown-Dwarf/Planet Binary at the
Deuterium Fusion Limit | We report the discovery, via the microlensing method, of a new very-low-mass
binary system. By combining measurements from Earth and from the Spitzer
telescope in Earth-trailing orbit, we are able to measure the microlensing
parallax of the event, and find that the lens likely consists of an $(12.0 \pm
0.6) M_{\rm J}$ + $(15.7 \pm 1.5) M_{\rm J}$ super-Jupiter / brown-dwarf pair.
The binary is located at a distance of $(3.08 \pm 0.18)$ kpc in the Galactic
Plane, and the components have a projected separation of $(0.43 \pm 0.03)$ AU.
Two alternative solutions with much lower likelihoods are also discussed, an 8-
and 6-$M_{\rm J}$ model and a 90- and 70-$M_{\rm J}$ model. Although disfavored
at the 3-$\sigma$ and 5-$\sigma$ levels, these alternatives cannot be rejected
entirely. We show how the more-massive of these models could be tested with
future direct imaging.
| astro-ph.SR astro-ph.EP | we report the discovery via the microlensing method of a new verylowmass binary system by combining measurements from earth and from the spitzer telescope in earthtrailing orbit we are able to measure the microlensing parallax of the event and find that the lens likely consists of an 120 pm 06 m_rm j 157 pm 15 m_rm j superjupiter browndwarf pair the binary is located at a distance of 308 pm 018 kpc in the galactic plane and the components have a projected separation of 043 pm 003 au two alternative solutions with much lower likelihoods are also discussed an 8 and 6m_rm j model and a 90 and 70m_rm j model although disfavored at the 3sigma and 5sigma levels these alternatives cannot be rejected entirely we show how the moremassive of these models could be tested with future direct imaging | [['we', 'report', 'the', 'discovery', 'via', 'the', 'microlensing', 'method', 'of', 'a', 'new', 'verylowmass', 'binary', 'system', 'by', 'combining', 'measurements', 'from', 'earth', 'and', 'from', 'the', 'spitzer', 'telescope', 'in', 'earthtrailing', 'orbit', 'we', 'are', 'able', 'to', 'measure', 'the', 'microlensing', 'parallax', 'of', 'the', 'event', 'and', 'find', 'that', 'the', 'lens', 'likely', 'consists', 'of', 'an', '120', 'pm', '06', 'm_rm', 'j', '157', 'pm', '15', 'm_rm', 'j', 'superjupiter', 'browndwarf', 'pair', 'the', 'binary', 'is', 'located', 'at', 'a', 'distance', 'of', '308', 'pm', '018', 'kpc', 'in', 'the', 'galactic', 'plane', 'and', 'the', 'components', 'have', 'a', 'projected', 'separation', 'of', '043', 'pm', '003', 'au', 'two', 'alternative', 'solutions', 'with', 'much', 'lower', 'likelihoods', 'are', 'also', 'discussed', 'an', '8', 'and', '6m_rm', 'j', 'model', 'and', 'a', '90', 'and', '70m_rm', 'j', 'model', 'although', 'disfavored', 'at', 'the', '3sigma', 'and', '5sigma', 'levels', 'these', 'alternatives', 'can', 'not', 'be', 'rejected', 'entirely', 'we', 'show', 'how', 'the', 'moremassive', 'of', 'these', 'models', 'could', 'be', 'tested', 'with', 'future', 'direct', 'imaging']] | [-0.10453467342287315, 0.11996172517123498, -0.061056392548753204, 0.038708217339020676, -0.05738058016407672, -0.1271077343505613, 0.08914201320718518, 0.3510280060012349, -0.17829140857625886, -0.4052264317501631, 0.08206382739397851, -0.35100496171055723, -0.03473244643796959, 0.2109282710455465, -0.02945286687128514, -0.01426695913028034, 0.09308782644048937, -0.06596687497242802, -0.07617332897041824, -0.22051825348987988, 0.2050891690803759, 0.07349129606091934, 0.14770963340210427, -0.00026494258070002783, 0.08743196097537607, -0.044230336887869155, -0.05368958511297665, -0.02777510898174356, -0.18213898467622142, 0.06625398206558052, 0.20362234814210292, 0.12450958535798805, 0.19025046635660336, -0.27527264979326255, -0.10821000886612016, 0.08968352614365947, 0.1523503154556421, 0.007650845582561782, -0.01841710606362108, -0.3289498592703436, 0.11073083889615394, -0.20953987561595097, -0.1354068976344554, 0.06517140101641417, 0.0795926195468834, -0.014342436218540446, -0.2482576084108822, 0.1588765735544931, 0.013821181358782936, 0.09647580715928146, -0.09869307278916775, -0.19870710254918195, -0.07368081447370216, 0.0062652050061888405, -0.021997696101973704, 0.1354064906096394, 0.10901061841789231, -0.03767951268354337, -0.08617634849334739, 0.40632287618911844, -0.09664914064049024, -0.0864793052226841, 0.21908233846745473, -0.17545353285650045, -0.1345695957387362, 0.14023366707365412, 0.15406512021314916, 0.137116078449842, -0.1989190338795884, 0.02490387546449645, 0.01735470011468521, 0.2534404626960377, 0.05275300134763979, -7.770948527421024e-05, 0.37252556673324794, 0.12369005313216835, 0.04283732988844624, 0.024130096751191526, -0.3024419801805517, -0.017318302907029556, -0.23805338862141018, -0.10392404397239359, -0.13430793465553992, 0.08309350122051505, -0.13980695708617552, -0.033969059063912295, 0.3107273536466276, 0.17088914004308606, 0.2456538880029492, 0.04864436440277014, 0.25279006422597833, 0.08522586712342345, 0.07541024743113667, 0.08634087717723396, 0.37461726892766334, 0.12115321305191827, 0.028913181841293042, -0.1505830995436999, 0.029330056898255887, -0.03265554348187749] |
1,802.09564 | Reinforcement and Imitation Learning for Diverse Visuomotor Skills | We propose a model-free deep reinforcement learning method that leverages a
small amount of demonstration data to assist a reinforcement learning agent. We
apply this approach to robotic manipulation tasks and train end-to-end
visuomotor policies that map directly from RGB camera inputs to joint
velocities. We demonstrate that our approach can solve a wide variety of
visuomotor tasks, for which engineering a scripted controller would be
laborious. In experiments, our reinforcement and imitation agent achieves
significantly better performances than agents trained with reinforcement
learning or imitation learning alone. We also illustrate that these policies,
trained with large visual and dynamics variations, can achieve preliminary
successes in zero-shot sim2real transfer. A brief visual description of this
work can be viewed in https://youtu.be/EDl8SQUNjj0
| cs.RO cs.AI cs.LG | we propose a modelfree deep reinforcement learning method that leverages a small amount of demonstration data to assist a reinforcement learning agent we apply this approach to robotic manipulation tasks and train endtoend visuomotor policies that map directly from rgb camera inputs to joint velocities we demonstrate that our approach can solve a wide variety of visuomotor tasks for which engineering a scripted controller would be laborious in experiments our reinforcement and imitation agent achieves significantly better performances than agents trained with reinforcement learning or imitation learning alone we also illustrate that these policies trained with large visual and dynamics variations can achieve preliminary successes in zeroshot sim2real transfer a brief visual description of this work can be viewed in httpsyoutubeedl8squnjj0 | [['we', 'propose', 'a', 'modelfree', 'deep', 'reinforcement', 'learning', 'method', 'that', 'leverages', 'a', 'small', 'amount', 'of', 'demonstration', 'data', 'to', 'assist', 'a', 'reinforcement', 'learning', 'agent', 'we', 'apply', 'this', 'approach', 'to', 'robotic', 'manipulation', 'tasks', 'and', 'train', 'endtoend', 'visuomotor', 'policies', 'that', 'map', 'directly', 'from', 'rgb', 'camera', 'inputs', 'to', 'joint', 'velocities', 'we', 'demonstrate', 'that', 'our', 'approach', 'can', 'solve', 'a', 'wide', 'variety', 'of', 'visuomotor', 'tasks', 'for', 'which', 'engineering', 'a', 'scripted', 'controller', 'would', 'be', 'laborious', 'in', 'experiments', 'our', 'reinforcement', 'and', 'imitation', 'agent', 'achieves', 'significantly', 'better', 'performances', 'than', 'agents', 'trained', 'with', 'reinforcement', 'learning', 'or', 'imitation', 'learning', 'alone', 'we', 'also', 'illustrate', 'that', 'these', 'policies', 'trained', 'with', 'large', 'visual', 'and', 'dynamics', 'variations', 'can', 'achieve', 'preliminary', 'successes', 'in', 'zeroshot', 'sim2real', 'transfer', 'a', 'brief', 'visual', 'description', 'of', 'this', 'work', 'can', 'be', 'viewed', 'in', 'httpsyoutubeedl8squnjj0']] | [-0.0008985810236175772, 0.010765551972915144, -0.14024117002028877, 0.03128123629110388, -0.2091651018630682, -0.2275535548497148, 0.04829186596809847, 0.5394077963125306, -0.2906207770907453, -0.37122258073219855, 0.02511092702009003, -0.20492610498918457, -0.2471512028215719, 0.2165974783143733, -0.23205560206302575, 0.07308557593584561, 0.20502854598795667, 0.00029705244531275847, -0.04113056432033161, -0.28305238578077246, 0.2685550053588295, -0.012507050245571803, 0.33284374343269474, -0.0018495996854416713, 0.20649929379187368, -0.017780061247719435, 0.06537226083132774, -0.00855908911878697, -0.04421118639938792, 0.20161977613016085, 0.42656346960697605, 0.2425183734441755, 0.3843591759497879, -0.4020796241630025, -0.24355509912422976, 0.11052822077474675, 0.16299988994053996, 0.124247786488204, -0.05788516580565449, -0.3822330843125071, 0.05185354578488765, -0.23329020712618567, 0.03671108705907309, -0.21406091460292892, -0.07598113354506801, -0.016574889098630606, -0.3459984719275865, -0.046593572901602945, 0.06758499754291467, 0.08390812857561752, -0.07674648642477368, -0.07101445630224061, 0.08550373009335593, 0.1852236324001667, 0.008168129577152744, 0.08090704219208389, 0.22573527332567492, -0.22572322337332518, -0.1986980224654329, 0.32471614016392153, -0.07842829493092111, -0.18406122504193492, 0.2235328265154703, 0.0019955640353512866, -0.14367159425883608, 0.07155250933631754, 0.31187491158039127, 0.17444175829281325, -0.17090293831199782, -0.03909210563087523, -0.042713880891121235, 0.2121634310455758, -0.022582295321382017, -0.07347623272525038, 0.16375112414023518, 0.30509867002608393, 0.04073954439338516, 0.11866154856079829, -0.08382316128186443, -0.11349215072055324, -0.19733793084987072, -0.09446152130595777, -0.18194962126210706, 0.017205403346818787, -0.0997000899741342, -0.05191425571194654, 0.3263414739591985, 0.28750302394492033, 0.23439658854250647, 0.17659967850615904, 0.3829711502136177, 0.012815447377447947, 0.12225006078418829, 0.10042857761033067, 0.2276866749367293, -0.06060817734408779, 0.16809418438708784, -0.21840725915639528, 0.116502856088317, 0.005918761750511011] |
1,802.09565 | Conjugate Bayes for probit regression via unified skew-normal
distributions | Regression models for dichotomous data are ubiquitous in statistics. Besides
being useful for inference on binary responses, these methods serve also as
building blocks in more complex formulations, such as density regression,
nonparametric classification and graphical models. Within the Bayesian
framework, inference proceeds by updating the priors for the coefficients,
typically set to be Gaussians, with the likelihood induced by probit or logit
regressions for the responses. In this updating, the apparent absence of a
tractable posterior has motivated a variety of computational methods, including
Markov Chain Monte Carlo routines and algorithms which approximate the
posterior. Despite being routinely implemented, Markov Chain Monte Carlo
strategies face mixing or time-inefficiency issues in large p and small n
studies, whereas approximate routines fail to capture the skewness typically
observed in the posterior. This article proves that the posterior distribution
for the probit coefficients has a unified skew-normal kernel, under Gaussian
priors. Such a novel result allows efficient Bayesian inference for a wide
class of applications, especially in large p and small-to-moderate n studies
where state-of-the-art computational methods face notable issues. These
advances are outlined in a genetic study, and further motivate the development
of a wider class of conjugate priors for probit models along with methods to
obtain independent and identically distributed samples from the unified
skew-normal posterior.
| stat.ME stat.CO | regression models for dichotomous data are ubiquitous in statistics besides being useful for inference on binary responses these methods serve also as building blocks in more complex formulations such as density regression nonparametric classification and graphical models within the bayesian framework inference proceeds by updating the priors for the coefficients typically set to be gaussians with the likelihood induced by probit or logit regressions for the responses in this updating the apparent absence of a tractable posterior has motivated a variety of computational methods including markov chain monte carlo routines and algorithms which approximate the posterior despite being routinely implemented markov chain monte carlo strategies face mixing or timeinefficiency issues in large p and small n studies whereas approximate routines fail to capture the skewness typically observed in the posterior this article proves that the posterior distribution for the probit coefficients has a unified skewnormal kernel under gaussian priors such a novel result allows efficient bayesian inference for a wide class of applications especially in large p and smalltomoderate n studies where stateoftheart computational methods face notable issues these advances are outlined in a genetic study and further motivate the development of a wider class of conjugate priors for probit models along with methods to obtain independent and identically distributed samples from the unified skewnormal posterior | [['regression', 'models', 'for', 'dichotomous', 'data', 'are', 'ubiquitous', 'in', 'statistics', 'besides', 'being', 'useful', 'for', 'inference', 'on', 'binary', 'responses', 'these', 'methods', 'serve', 'also', 'as', 'building', 'blocks', 'in', 'more', 'complex', 'formulations', 'such', 'as', 'density', 'regression', 'nonparametric', 'classification', 'and', 'graphical', 'models', 'within', 'the', 'bayesian', 'framework', 'inference', 'proceeds', 'by', 'updating', 'the', 'priors', 'for', 'the', 'coefficients', 'typically', 'set', 'to', 'be', 'gaussians', 'with', 'the', 'likelihood', 'induced', 'by', 'probit', 'or', 'logit', 'regressions', 'for', 'the', 'responses', 'in', 'this', 'updating', 'the', 'apparent', 'absence', 'of', 'a', 'tractable', 'posterior', 'has', 'motivated', 'a', 'variety', 'of', 'computational', 'methods', 'including', 'markov', 'chain', 'monte', 'carlo', 'routines', 'and', 'algorithms', 'which', 'approximate', 'the', 'posterior', 'despite', 'being', 'routinely', 'implemented', 'markov', 'chain', 'monte', 'carlo', 'strategies', 'face', 'mixing', 'or', 'timeinefficiency', 'issues', 'in', 'large', 'p', 'and', 'small', 'n', 'studies', 'whereas', 'approximate', 'routines', 'fail', 'to', 'capture', 'the', 'skewness', 'typically', 'observed', 'in', 'the', 'posterior', 'this', 'article', 'proves', 'that', 'the', 'posterior', 'distribution', 'for', 'the', 'probit', 'coefficients', 'has', 'a', 'unified', 'skewnormal', 'kernel', 'under', 'gaussian', 'priors', 'such', 'a', 'novel', 'result', 'allows', 'efficient', 'bayesian', 'inference', 'for', 'a', 'wide', 'class', 'of', 'applications', 'especially', 'in', 'large', 'p', 'and', 'smalltomoderate', 'n', 'studies', 'where', 'stateoftheart', 'computational', 'methods', 'face', 'notable', 'issues', 'these', 'advances', 'are', 'outlined', 'in', 'a', 'genetic', 'study', 'and', 'further', 'motivate', 'the', 'development', 'of', 'a', 'wider', 'class', 'of', 'conjugate', 'priors', 'for', 'probit', 'models', 'along', 'with', 'methods', 'to', 'obtain', 'independent', 'and', 'identically', 'distributed', 'samples', 'from', 'the', 'unified', 'skewnormal', 'posterior']] | [0.0027396498036809094, 0.04974748215876346, -0.06814249233386024, 0.1232445715872441, -0.10344221004458187, -0.1792559225220493, 0.050892175999361765, 0.4366812556115694, -0.290133739219502, -0.30869976271290417, 0.12171215370221626, -0.20736084761602944, -0.13276624070632076, 0.18950337614474255, -0.07464148486181986, 0.1320618639245283, 0.0901443438945598, -0.04433749483378474, -0.10224326740108365, -0.24961764423534014, 0.24563861268973194, 0.06899108395500239, 0.3068663649520902, -0.076251579423944, 0.10803771730739796, 0.05182798191103651, -0.06816840405348515, -0.004226390938924322, -0.13438847748590443, 0.13972531600779486, 0.33659372311747066, 0.17785763136394794, 0.34610930877022966, -0.3843300076937953, -0.25676858282585757, 0.15814635348939446, 0.15630921597895753, 0.0978855071259056, -0.01282972368109852, -0.2774493422933183, 0.023732945047925377, -0.19389654806663478, -0.05480311176601559, -0.1480105663064954, -0.035189241454611685, 0.04560436681887611, -0.3675012830466162, 0.10912264692583555, 0.05922695889522127, 0.08542307026814236, 0.02528625256463149, -0.2084087867787931, 0.030134963657338778, 0.043061779419956515, 0.07733155021032448, -0.0205073511135916, 0.11326257377689661, -0.14943023424292373, -0.1418050798814917, 0.31707850947196403, -0.034059560398549536, -0.24989766932287535, 0.18897505157605507, -0.056733610752027826, -0.22254924043189994, 0.11898143239059421, 0.21895743237245222, 0.13119447241039123, -0.17919799133832026, 0.10818760929423449, -0.01801365608685152, 0.10156809258881176, -0.017526206609164905, -0.059768723432234556, 0.20746779326825987, 0.18003412263987717, 0.03459089834535451, 0.10839246979665532, -0.10911170574836433, -0.1519038966791921, -0.251224530239178, -0.12744095354032334, -0.19228039837447752, -0.048667222992950225, -0.1607716625790534, -0.23994954792825982, 0.3559999646055837, 0.19346315147069068, 0.20035498933974913, 0.12972373803806772, 0.2876827962869822, 0.07730917126261141, 0.050382984368953596, 0.08404515914532334, 0.10590111708246865, 0.1426129852757291, 0.026129042515314595, -0.1209005196719582, 0.16393220683039966, -0.007899493185889929] |
1,802.09566 | Design of iMacros-based Data Crawler and the Behavioral Analysis of
Facebook Users | Obtaining the desired dataset is still a prime challenge faced by researchers
while analyzing Online Social Network (OSN) sites. Application Programming
Interfaces (APIs) provided by OSN service providers for retrieving data impose
several unavoidable restrictions which make it difficult to get a desirable
dataset. In this paper, we present an iMacros technology-based data crawler
called IMcrawler, capable of collecting every piece of information which is
accessible through a browser from the Facebook website within the legal
framework which permits access to publicly shared user content on OSNs. The
proposed crawler addresses most of the challenges allied with web data
extraction approaches and most of the APIs provided by OSN service providers.
Two broad sections have been extracted from Facebook user profiles, namely,
Personal Information and Wall Activities. The present work is the first attempt
towards providing the detailed description of crawler design for the Facebook
website.
| cs.SI cs.HC cs.IR | obtaining the desired dataset is still a prime challenge faced by researchers while analyzing online social network osn sites application programming interfaces apis provided by osn service providers for retrieving data impose several unavoidable restrictions which make it difficult to get a desirable dataset in this paper we present an imacros technologybased data crawler called imcrawler capable of collecting every piece of information which is accessible through a browser from the facebook website within the legal framework which permits access to publicly shared user content on osns the proposed crawler addresses most of the challenges allied with web data extraction approaches and most of the apis provided by osn service providers two broad sections have been extracted from facebook user profiles namely personal information and wall activities the present work is the first attempt towards providing the detailed description of crawler design for the facebook website | [['obtaining', 'the', 'desired', 'dataset', 'is', 'still', 'a', 'prime', 'challenge', 'faced', 'by', 'researchers', 'while', 'analyzing', 'online', 'social', 'network', 'osn', 'sites', 'application', 'programming', 'interfaces', 'apis', 'provided', 'by', 'osn', 'service', 'providers', 'for', 'retrieving', 'data', 'impose', 'several', 'unavoidable', 'restrictions', 'which', 'make', 'it', 'difficult', 'to', 'get', 'a', 'desirable', 'dataset', 'in', 'this', 'paper', 'we', 'present', 'an', 'imacros', 'technologybased', 'data', 'crawler', 'called', 'imcrawler', 'capable', 'of', 'collecting', 'every', 'piece', 'of', 'information', 'which', 'is', 'accessible', 'through', 'a', 'browser', 'from', 'the', 'facebook', 'website', 'within', 'the', 'legal', 'framework', 'which', 'permits', 'access', 'to', 'publicly', 'shared', 'user', 'content', 'on', 'osns', 'the', 'proposed', 'crawler', 'addresses', 'most', 'of', 'the', 'challenges', 'allied', 'with', 'web', 'data', 'extraction', 'approaches', 'and', 'most', 'of', 'the', 'apis', 'provided', 'by', 'osn', 'service', 'providers', 'two', 'broad', 'sections', 'have', 'been', 'extracted', 'from', 'facebook', 'user', 'profiles', 'namely', 'personal', 'information', 'and', 'wall', 'activities', 'the', 'present', 'work', 'is', 'the', 'first', 'attempt', 'towards', 'providing', 'the', 'detailed', 'description', 'of', 'crawler', 'design', 'for', 'the', 'facebook', 'website']] | [-0.1247623091076188, -0.0497270979514926, -0.055472542182542384, 0.07216016614418347, -0.21787449542898685, -0.21923790259299697, 0.10257480115089695, 0.409191302010893, -0.25337890142529634, -0.3673948865228643, 0.0890309223767771, -0.3868861177890924, -0.11362029120533003, 0.18978042352763522, -0.05998400179139986, 0.047302569923178654, 0.11559173515949321, 0.053273852419806644, 0.07141700132180834, -0.3098652716305676, 0.32413434544448844, 0.07209742860868573, 0.3499842321810623, 0.12788794379189816, 0.058709904964618746, 0.02652139633604141, -0.11855147383822542, -0.058746209970397305, -0.13417903839015505, 0.19345620509264133, 0.3899124080522193, 0.2897152977998808, 0.34933999553646167, -0.4377158254588317, -0.14720551514700572, 0.013543028633446537, 0.15627179018984963, 0.08302424290822172, -0.11189780403462161, -0.382337533590746, 0.08610197042839395, -0.23014896863605827, -0.05269757558643404, -0.0906341632685831, -0.002751660125795752, -0.0019429497159661776, -0.22444425383906086, -0.05775952980588449, -0.037560532361062035, 0.136079206784618, 0.011594837748109259, -0.05603577878274438, -0.020052689583584044, 0.24564051425032732, 0.09625662286675328, -0.015376381946326647, 0.17840344705837197, -0.15850388411167338, -0.1294437783265797, 0.41168756609679097, 0.023577720234041206, -0.12579549660181832, 0.14003944214912029, -0.002071419187511007, -0.18307769278827538, 0.08648476798164968, 0.23103964371451488, 0.06495613288522388, -0.28225863865938866, 0.03864155998437329, -0.058483732928935855, 0.21358727310952316, 0.056850096353122756, -0.005218950084074297, 0.19209661700329483, 0.23421937414160413, 0.0715590855139049, 0.11445640431096156, -0.007840218473575078, -0.04472103420024117, -0.18453410695979577, -0.12865508725452754, -0.19270687264765407, 0.0045353323673932916, -0.09619362238037057, -0.13054603540028134, 0.39885895209833205, 0.21271486527176522, 0.12136760040933343, 0.03928426832357622, 0.36817029353955555, -0.05890819650246865, 0.12200340220523584, 0.1495887852442037, 0.07874092807954487, -0.0726634322086789, 0.2686687726090895, -0.08034657688889031, 0.16297180362905944, -0.004879688523942605] |
1,802.09567 | A Robust Real-Time Automatic License Plate Recognition Based on the YOLO
Detector | Automatic License Plate Recognition (ALPR) has been a frequent topic of
research due to many practical applications. However, many of the current
solutions are still not robust in real-world situations, commonly depending on
many constraints. This paper presents a robust and efficient ALPR system based
on the state-of-the-art YOLO object detector. The Convolutional Neural Networks
(CNNs) are trained and fine-tuned for each ALPR stage so that they are robust
under different conditions (e.g., variations in camera, lighting, and
background). Specially for character segmentation and recognition, we design a
two-stage approach employing simple data augmentation tricks such as inverted
License Plates (LPs) and flipped characters. The resulting ALPR approach
achieved impressive results in two datasets. First, in the SSIG dataset,
composed of 2,000 frames from 101 vehicle videos, our system achieved a
recognition rate of 93.53% and 47 Frames Per Second (FPS), performing better
than both Sighthound and OpenALPR commercial systems (89.80% and 93.03%,
respectively) and considerably outperforming previous results (81.80%). Second,
targeting a more realistic scenario, we introduce a larger public dataset,
called UFPR-ALPR dataset, designed to ALPR. This dataset contains 150 videos
and 4,500 frames captured when both camera and vehicles are moving and also
contains different types of vehicles (cars, motorcycles, buses and trucks). In
our proposed dataset, the trial versions of commercial systems achieved
recognition rates below 70%. On the other hand, our system performed better,
with recognition rate of 78.33% and 35 FPS.
| cs.CV | automatic license plate recognition alpr has been a frequent topic of research due to many practical applications however many of the current solutions are still not robust in realworld situations commonly depending on many constraints this paper presents a robust and efficient alpr system based on the stateoftheart yolo object detector the convolutional neural networks cnns are trained and finetuned for each alpr stage so that they are robust under different conditions eg variations in camera lighting and background specially for character segmentation and recognition we design a twostage approach employing simple data augmentation tricks such as inverted license plates lps and flipped characters the resulting alpr approach achieved impressive results in two datasets first in the ssig dataset composed of 2000 frames from 101 vehicle videos our system achieved a recognition rate of 9353 and 47 frames per second fps performing better than both sighthound and openalpr commercial systems 8980 and 9303 respectively and considerably outperforming previous results 8180 second targeting a more realistic scenario we introduce a larger public dataset called ufpralpr dataset designed to alpr this dataset contains 150 videos and 4500 frames captured when both camera and vehicles are moving and also contains different types of vehicles cars motorcycles buses and trucks in our proposed dataset the trial versions of commercial systems achieved recognition rates below 70 on the other hand our system performed better with recognition rate of 7833 and 35 fps | [['automatic', 'license', 'plate', 'recognition', 'alpr', 'has', 'been', 'a', 'frequent', 'topic', 'of', 'research', 'due', 'to', 'many', 'practical', 'applications', 'however', 'many', 'of', 'the', 'current', 'solutions', 'are', 'still', 'not', 'robust', 'in', 'realworld', 'situations', 'commonly', 'depending', 'on', 'many', 'constraints', 'this', 'paper', 'presents', 'a', 'robust', 'and', 'efficient', 'alpr', 'system', 'based', 'on', 'the', 'stateoftheart', 'yolo', 'object', 'detector', 'the', 'convolutional', 'neural', 'networks', 'cnns', 'are', 'trained', 'and', 'finetuned', 'for', 'each', 'alpr', 'stage', 'so', 'that', 'they', 'are', 'robust', 'under', 'different', 'conditions', 'eg', 'variations', 'in', 'camera', 'lighting', 'and', 'background', 'specially', 'for', 'character', 'segmentation', 'and', 'recognition', 'we', 'design', 'a', 'twostage', 'approach', 'employing', 'simple', 'data', 'augmentation', 'tricks', 'such', 'as', 'inverted', 'license', 'plates', 'lps', 'and', 'flipped', 'characters', 'the', 'resulting', 'alpr', 'approach', 'achieved', 'impressive', 'results', 'in', 'two', 'datasets', 'first', 'in', 'the', 'ssig', 'dataset', 'composed', 'of', '2000', 'frames', 'from', '101', 'vehicle', 'videos', 'our', 'system', 'achieved', 'a', 'recognition', 'rate', 'of', '9353', 'and', '47', 'frames', 'per', 'second', 'fps', 'performing', 'better', 'than', 'both', 'sighthound', 'and', 'openalpr', 'commercial', 'systems', '8980', 'and', '9303', 'respectively', 'and', 'considerably', 'outperforming', 'previous', 'results', '8180', 'second', 'targeting', 'a', 'more', 'realistic', 'scenario', 'we', 'introduce', 'a', 'larger', 'public', 'dataset', 'called', 'ufpralpr', 'dataset', 'designed', 'to', 'alpr', 'this', 'dataset', 'contains', '150', 'videos', 'and', '4500', 'frames', 'captured', 'when', 'both', 'camera', 'and', 'vehicles', 'are', 'moving', 'and', 'also', 'contains', 'different', 'types', 'of', 'vehicles', 'cars', 'motorcycles', 'buses', 'and', 'trucks', 'in', 'our', 'proposed', 'dataset', 'the', 'trial', 'versions', 'of', 'commercial', 'systems', 'achieved', 'recognition', 'rates', 'below', '70', 'on', 'the', 'other', 'hand', 'our', 'system', 'performed', 'better', 'with', 'recognition', 'rate', 'of', '7833', 'and', '35', 'fps']] | [-0.09665882013435075, 0.020779463395981645, -0.033121330226000785, 0.02558193240738233, -0.06728703860978291, -0.22402172857004315, 0.01412763903085604, 0.44809876273964244, -0.1719177571257801, -0.3763678612665209, 0.13728107382660804, -0.2952295184870058, -0.12433925793291188, 0.291300469452459, -0.1780680142762541, 0.08185022659519495, 0.1896554854596114, 0.060271167283895796, -0.04966174133645335, -0.30013577925575224, 0.22528547181492944, 0.025611737435924466, 0.36114032582604677, 0.02625327216785457, 0.14619873188173094, -0.04367163589180062, -0.019716841246980917, -0.02005276334439886, -0.025271838110052944, 0.14304740874900618, 0.2837314996858336, 0.14453383391935795, 0.27668254964198147, -0.4154837544212632, -0.17652127148326616, 0.05414682018955977, 0.1121417741066172, 0.08379945849377816, -0.06153244459942628, -0.3873372972232354, 0.10527962890949405, -0.19206131579041288, 0.01628451997410217, -0.07150025319123383, 0.02372703844067191, -0.016657365106170642, -0.2764740553303172, 0.04249998032211242, 0.05099994023651656, 0.11500003048648319, -0.07097664745002664, -0.14641382355706622, 0.03746729936292154, 0.16577469948280285, 0.03140062900851701, 0.04609173958707633, 0.17109179378292474, -0.20429084362970978, -0.10347401762706356, 0.4175397229685994, -0.049328714358564646, -0.1755030252724878, 0.22828430769732222, -0.036688548769673396, -0.129635557413888, 0.11745706271552801, 0.2289067329738514, 0.16794481261428607, -0.18896007352562044, -0.049176372118507, -0.03989455631494036, 0.2062394341879428, 0.11010537413651413, -0.013072503385172178, 0.15890802720467287, 0.2620252340124792, 0.03744040362176622, 0.11407760522496542, -0.16680198788526468, -0.06318208558187852, -0.1873288300793602, -0.07515454301091236, -0.14649142649582717, -0.05326764508955138, -0.07522424755746936, -0.1092517132959168, 0.40054489671381127, 0.23288186548114906, 0.12890282544560314, 0.08083137838523193, 0.3401830928693204, -0.013925019025919028, 0.12798076656803586, 0.10071556582035304, 0.17510735184448, -0.04598575146519579, 0.1623385759885423, -0.1182351989075963, 0.028856813009293422, 0.02803068087388087] |
1,802.09568 | Shampoo: Preconditioned Stochastic Tensor Optimization | Preconditioned gradient methods are among the most general and powerful tools
in optimization. However, preconditioning requires storing and manipulating
prohibitively large matrices. We describe and analyze a new structure-aware
preconditioning algorithm, called Shampoo, for stochastic optimization over
tensor spaces. Shampoo maintains a set of preconditioning matrices, each of
which operates on a single dimension, contracting over the remaining
dimensions. We establish convergence guarantees in the stochastic convex
setting, the proof of which builds upon matrix trace inequalities. Our
experiments with state-of-the-art deep learning models show that Shampoo is
capable of converging considerably faster than commonly used optimizers.
Although it involves a more complex update rule, Shampoo's runtime per step is
comparable to that of simple gradient methods such as SGD, AdaGrad, and Adam.
| cs.LG math.OC stat.ML | preconditioned gradient methods are among the most general and powerful tools in optimization however preconditioning requires storing and manipulating prohibitively large matrices we describe and analyze a new structureaware preconditioning algorithm called shampoo for stochastic optimization over tensor spaces shampoo maintains a set of preconditioning matrices each of which operates on a single dimension contracting over the remaining dimensions we establish convergence guarantees in the stochastic convex setting the proof of which builds upon matrix trace inequalities our experiments with stateoftheart deep learning models show that shampoo is capable of converging considerably faster than commonly used optimizers although it involves a more complex update rule shampoos runtime per step is comparable to that of simple gradient methods such as sgd adagrad and adam | [['preconditioned', 'gradient', 'methods', 'are', 'among', 'the', 'most', 'general', 'and', 'powerful', 'tools', 'in', 'optimization', 'however', 'preconditioning', 'requires', 'storing', 'and', 'manipulating', 'prohibitively', 'large', 'matrices', 'we', 'describe', 'and', 'analyze', 'a', 'new', 'structureaware', 'preconditioning', 'algorithm', 'called', 'shampoo', 'for', 'stochastic', 'optimization', 'over', 'tensor', 'spaces', 'shampoo', 'maintains', 'a', 'set', 'of', 'preconditioning', 'matrices', 'each', 'of', 'which', 'operates', 'on', 'a', 'single', 'dimension', 'contracting', 'over', 'the', 'remaining', 'dimensions', 'we', 'establish', 'convergence', 'guarantees', 'in', 'the', 'stochastic', 'convex', 'setting', 'the', 'proof', 'of', 'which', 'builds', 'upon', 'matrix', 'trace', 'inequalities', 'our', 'experiments', 'with', 'stateoftheart', 'deep', 'learning', 'models', 'show', 'that', 'shampoo', 'is', 'capable', 'of', 'converging', 'considerably', 'faster', 'than', 'commonly', 'used', 'optimizers', 'although', 'it', 'involves', 'a', 'more', 'complex', 'update', 'rule', 'shampoos', 'runtime', 'per', 'step', 'is', 'comparable', 'to', 'that', 'of', 'simple', 'gradient', 'methods', 'such', 'as', 'sgd', 'adagrad', 'and', 'adam']] | [-0.053501625586354525, 0.043842424745442435, -0.07402082773108708, 0.08143253507928495, -0.08552015832716935, -0.21220301589012514, 0.015786183188806792, 0.392293441888006, -0.2941684660121997, -0.27942292719743533, 0.1237604679161927, -0.21976711581171046, -0.17400554920542893, 0.23179515478674506, -0.0946783893493569, 0.08246310041515065, 0.11809113175898302, -0.014067555754827182, -0.146835783828569, -0.29944146945156525, 0.27096704641532643, 0.0518708066885039, 0.2585303928516042, -0.034174115843612886, 0.17836480600316626, 0.010274211849376071, -0.03201900002332862, 0.018023410537203806, -0.02133793010508554, 0.1624440786707383, 0.2672005595545894, 0.2081821163807095, 0.36830925288014726, -0.4300379681355152, -0.17994347458216745, 0.1271874723010353, 0.1777814692377731, 0.09223698979991747, -0.05274021558305649, -0.21301771872905922, 0.08863171913325175, -0.12109904067560298, -0.046666173848369324, -0.20617951275055588, -0.05536217125491468, 0.025237573046412807, -0.3212129680867322, 0.03840540164936578, 0.07825847109779716, 0.021204341911962715, -0.0124868487263648, -0.17736512292500922, 0.06617120813318818, 0.034550101113635434, 0.019470346721316704, 0.03386770845696208, 0.14448748292691518, -0.09310232671588416, -0.13684859890757953, 0.33830919230860645, -0.07405445278781088, -0.20903080065169785, 0.20125749841576718, -0.011855953319578385, -0.17109698115573188, 0.11968948253522031, 0.2103825500540313, 0.22024345393750633, -0.10824197328069293, 0.08425149549233926, -0.03887886152465324, 0.14884621132409476, 0.044093434569105264, -0.014807495538080416, 0.058755656891334496, 0.21270810262506187, 0.2045510763065798, 0.11947145587411617, -0.020811645777850243, -0.1552567543880823, -0.22872205791597972, -0.16451031645019462, -0.20305264955310182, 0.015567621685656124, -0.18154856468289404, -0.18397991695120686, 0.3728377528519171, 0.1730215606922818, 0.1921806489809256, 0.13045034281428536, 0.3479037089196996, 0.07931791128675152, 0.13066966048838785, 0.18921737398830105, 0.17494875300278673, 0.1281642301817287, 0.11722061042788393, -0.18477536263955818, 0.11238386379325854, 0.1516999142916232] |
1,802.09569 | Transport Properties of Near Surface InAs Two-dimensional
Heterostructures | Two-dimensional electron systems (2DESs) confined to the surface of
narrowband semiconductors have attracted great interest since they can easily
integrate with superconductivity (or ferromagnetism) enabling new possibilities
in hybrid device architectures and study of exotic states in proximity of
superconductors. In this work, we study indium arsenide heterostructures where
combination of clean interface with superconductivity, high mobility and
spin-orbit coupling can be achieved. The weak antilocalization measurements
indicate presence of strong spin-orbit coupling at high densities. We study the
magnetotransport as a function of top barrier and density and report clear
observation of integer quantum Hall states. We report improved electron
mobility reaching up to 44,000 cm$^{2}$/Vs in undoped heterstructures and well
developed integer quantum Hall states starting as low as 2.5~T.
| cond-mat.mes-hall | twodimensional electron systems 2dess confined to the surface of narrowband semiconductors have attracted great interest since they can easily integrate with superconductivity or ferromagnetism enabling new possibilities in hybrid device architectures and study of exotic states in proximity of superconductors in this work we study indium arsenide heterostructures where combination of clean interface with superconductivity high mobility and spinorbit coupling can be achieved the weak antilocalization measurements indicate presence of strong spinorbit coupling at high densities we study the magnetotransport as a function of top barrier and density and report clear observation of integer quantum hall states we report improved electron mobility reaching up to 44000 cm2vs in undoped heterstructures and well developed integer quantum hall states starting as low as 25t | [['twodimensional', 'electron', 'systems', '2dess', 'confined', 'to', 'the', 'surface', 'of', 'narrowband', 'semiconductors', 'have', 'attracted', 'great', 'interest', 'since', 'they', 'can', 'easily', 'integrate', 'with', 'superconductivity', 'or', 'ferromagnetism', 'enabling', 'new', 'possibilities', 'in', 'hybrid', 'device', 'architectures', 'and', 'study', 'of', 'exotic', 'states', 'in', 'proximity', 'of', 'superconductors', 'in', 'this', 'work', 'we', 'study', 'indium', 'arsenide', 'heterostructures', 'where', 'combination', 'of', 'clean', 'interface', 'with', 'superconductivity', 'high', 'mobility', 'and', 'spinorbit', 'coupling', 'can', 'be', 'achieved', 'the', 'weak', 'antilocalization', 'measurements', 'indicate', 'presence', 'of', 'strong', 'spinorbit', 'coupling', 'at', 'high', 'densities', 'we', 'study', 'the', 'magnetotransport', 'as', 'a', 'function', 'of', 'top', 'barrier', 'and', 'density', 'and', 'report', 'clear', 'observation', 'of', 'integer', 'quantum', 'hall', 'states', 'we', 'report', 'improved', 'electron', 'mobility', 'reaching', 'up', 'to', '44000', 'cm2vs', 'in', 'undoped', 'heterstructures', 'and', 'well', 'developed', 'integer', 'quantum', 'hall', 'states', 'starting', 'as', 'low', 'as', '25t']] | [-0.18896981505114113, 0.18308197659799127, 0.004233280864742691, -0.009143529927165278, -0.023983269740949522, -0.24704988491263424, 0.0976587873234673, 0.38858672086393736, -0.22265771442626367, -0.3467483728452296, -0.016934939340466908, -0.32671622150256985, -0.13441766248863252, 0.20072492287822497, 0.011379263493553048, 0.08659601651445092, -0.015114799630446513, -0.11994924030236168, -0.1255154661523163, -0.22028714211344658, 0.26155459513929746, 0.02053741606326438, 0.3306508792381062, 0.16099609405977927, 0.06841957407095088, -0.0022307047505908816, 0.16221033298714874, 0.0457105803433195, -0.12874725112141888, 0.06788399088870138, 0.31662057992070913, -0.15740132450649028, 0.22952103779697028, -0.4605888972272638, -0.21843003294598617, -0.04915756392521692, 0.1551727097115067, 0.15498785186772707, -0.13822277995650886, -0.33426617797403063, 0.08786035270323275, -0.18121903423090144, -0.09548797946591235, -0.10615817503240264, -0.019393620615611312, -0.041640769186444944, -0.22854586953266723, 0.09051982963793591, 0.014758545101895074, 0.11221674366350301, -0.047505831168668695, -0.15848911867370127, -0.04710558992161675, 0.06077634528103727, 0.01584037667384646, 0.034194447061993545, 0.16754557872878112, -0.14722121017698778, -0.17618606378873963, 0.3309870597631594, -0.09452067465200777, -0.059113733241426165, 0.2335948403504845, -0.22678697797027034, -0.06118313326943116, 0.11626240672146687, 0.195806983087334, 0.09185220457644003, -0.122131940580477, 0.1006759584756839, -0.021227834029619384, 0.1375661092069855, 0.028148645111435992, 0.18377107303192625, 0.3111025678665667, 0.2025239132879088, 0.05515436986346775, 0.11554161183913926, -0.1263976050388129, 0.018157955129310243, -0.17653757761247824, -0.23985357946557848, -0.2385217737383591, 0.13043073338044228, 0.011451645014873424, -0.1892409385449146, 0.3708579518534548, 0.1820267035557171, 0.17209359375973704, -0.08058062311620681, 0.21938401876784647, 0.12767601395254863, 0.07584731182327768, 0.0070349123294572114, 0.23714764923864945, 0.18249017434751952, 0.12154863993866277, -0.24323246011617364, 0.0663299179124478, -0.03873881176600737] |
1,802.0957 | Porous medium equation with a blow-up nonlinearity and a non-decreasing
constraint | The final goal of this paper is to prove existence of local (strong)
solutions to a (fully nonlinear) porous medium equation with blow-up term and
nondecreasing constraint. To this end, the equation, arising in the context of
Damage Mechanics, is reformulated as a mixed form of two different types of
doubly nonlinear evolution equations. Global (in time) solutions to some
approximate problems are constructed by performing a time discretization
argument and by taking advantage of energy techniques based on specific
structures of the equation. Moreover, a variational comparison principle for
(possibly non-unique) approximate solutions is established and it also enables
us to obtain a local solution as a limit of approximate ones.
| math.AP | the final goal of this paper is to prove existence of local strong solutions to a fully nonlinear porous medium equation with blowup term and nondecreasing constraint to this end the equation arising in the context of damage mechanics is reformulated as a mixed form of two different types of doubly nonlinear evolution equations global in time solutions to some approximate problems are constructed by performing a time discretization argument and by taking advantage of energy techniques based on specific structures of the equation moreover a variational comparison principle for possibly nonunique approximate solutions is established and it also enables us to obtain a local solution as a limit of approximate ones | [['the', 'final', 'goal', 'of', 'this', 'paper', 'is', 'to', 'prove', 'existence', 'of', 'local', 'strong', 'solutions', 'to', 'a', 'fully', 'nonlinear', 'porous', 'medium', 'equation', 'with', 'blowup', 'term', 'and', 'nondecreasing', 'constraint', 'to', 'this', 'end', 'the', 'equation', 'arising', 'in', 'the', 'context', 'of', 'damage', 'mechanics', 'is', 'reformulated', 'as', 'a', 'mixed', 'form', 'of', 'two', 'different', 'types', 'of', 'doubly', 'nonlinear', 'evolution', 'equations', 'global', 'in', 'time', 'solutions', 'to', 'some', 'approximate', 'problems', 'are', 'constructed', 'by', 'performing', 'a', 'time', 'discretization', 'argument', 'and', 'by', 'taking', 'advantage', 'of', 'energy', 'techniques', 'based', 'on', 'specific', 'structures', 'of', 'the', 'equation', 'moreover', 'a', 'variational', 'comparison', 'principle', 'for', 'possibly', 'nonunique', 'approximate', 'solutions', 'is', 'established', 'and', 'it', 'also', 'enables', 'us', 'to', 'obtain', 'a', 'local', 'solution', 'as', 'a', 'limit', 'of', 'approximate', 'ones']] | [-0.11796789246311944, 0.01519914630417978, -0.11955838088345315, 0.08017302522473203, -0.10774452569395569, -0.12391018909901115, 0.02812968100416973, 0.293537387624383, -0.32737505259657546, -0.2910532719355875, 0.1540937815921747, -0.2516144345780568, -0.1298277859958554, 0.15308212376632063, -0.017058805317252075, 0.0964814251887479, 0.07416877381495267, -0.005893917272000441, -0.10177132987467173, -0.20517300095733454, 0.348750753128635, -0.005834639238725815, 0.25273446887565243, 0.026339809023608853, 0.1570754558446684, -0.027530194359444846, -0.014569916353918546, 0.0649266904219985, -0.1389370604717572, 0.12702219231037556, 0.24314174909211164, 0.10264270722525128, 0.31808014410106417, -0.4585679445715089, -0.23858853197556787, 0.10836013579059259, 0.1275015450197056, 0.15444587783089705, -0.03215988852129418, -0.26819804550281595, 0.09623053755266094, -0.13039485597151465, -0.19674915450325767, -0.07910718305668395, 0.0033475505520722698, 0.04720361321233213, -0.29959616916520254, 0.10487871731441244, 0.07715383922914043, -0.03131358210105516, -0.1215741540862447, -0.04845257174955415, -0.00027594154172610227, 0.0728173182745065, 0.060913131455890834, -0.0024443581184771445, 0.03207815342466347, -0.12084414991217532, -0.0913864687442713, 0.37836510423637393, -0.08028829694792096, -0.2626610467601235, 0.17838579670257917, -0.0523028847736506, -0.12073044170392677, 0.136256957094052, 0.18045680410328455, 0.1637937669542485, -0.192172860701768, 0.0980387419346828, -0.03394081610687343, 0.14477322805240483, 0.07734364257443563, 0.02957432594225143, 0.11415909328830562, 0.15930661309643515, 0.1232954773710974, 0.14035567843321978, 0.009950649094597403, -0.15155242001388355, -0.3256098376587033, -0.14824033803181788, -0.1453107696184556, 0.082728106039992, -0.08208908115674214, -0.17927903908067883, 0.37561756038381383, 0.08618332931460568, 0.1731383969142501, 0.07197632321185665, 0.2612776999095721, 0.1875314628185671, -0.010086714963628245, 0.038708978960390335, 0.21745005250418867, 0.17134024470786763, 0.12331114674452692, -0.2037753098198404, 0.05179689251651455, 0.1515877081214317] |
1,802.09571 | Finite volume mass gap and free energy of the SU(N)xSU(N) chiral sigma
model | We compute the free energy in the presence of a chemical potential coupled to
a conserved charge in the effective SU(N)xSU(N) scalar field theory to third
order for asymmetric volumes in general d-dimensions, using dimensional
regularization. We also compute the mass gap in a finite box with periodic
boundary conditions.
| hep-th hep-lat | we compute the free energy in the presence of a chemical potential coupled to a conserved charge in the effective sunxsun scalar field theory to third order for asymmetric volumes in general ddimensions using dimensional regularization we also compute the mass gap in a finite box with periodic boundary conditions | [['we', 'compute', 'the', 'free', 'energy', 'in', 'the', 'presence', 'of', 'a', 'chemical', 'potential', 'coupled', 'to', 'a', 'conserved', 'charge', 'in', 'the', 'effective', 'sunxsun', 'scalar', 'field', 'theory', 'to', 'third', 'order', 'for', 'asymmetric', 'volumes', 'in', 'general', 'ddimensions', 'using', 'dimensional', 'regularization', 'we', 'also', 'compute', 'the', 'mass', 'gap', 'in', 'a', 'finite', 'box', 'with', 'periodic', 'boundary', 'conditions']] | [-0.15367970832623543, 0.15390198832610621, -0.03796601459383964, 0.09174661388620735, -0.03684254144784063, -0.10784947161562741, 0.006478604872245342, 0.32085464684292675, -0.21497200683690607, -0.2783645772561431, 0.07215725060552358, -0.25185925666242837, -0.10476980581879616, 0.09182785822078586, -0.030296061569824815, 0.03920972213149071, -0.0208296381495893, 0.11257931178435683, -0.11129927061498165, -0.20705586174502968, 0.3667300756368786, 0.0017222756892442703, 0.22634193919599055, 0.11219750899821519, 0.0747263503074646, 0.020222666664049028, 0.017295536790043115, 0.08234974939376116, -0.1836900824587792, 0.12094885664060712, 0.20126624289434403, -0.062195254340767864, 0.22081445530988275, -0.4236567382887006, -0.23091635636985303, 0.12977950885891915, 0.11660794131457805, 0.1594240830745548, -0.11143742837011814, -0.1951780266314745, 0.07938883619382978, -0.1918213650211692, -0.23989484183490276, -0.09598470889963209, 0.013483190212864428, -0.033467589914798736, -0.33744680528528986, 0.14210228257928975, -0.05761736288666725, 0.02650603583082557, -0.1422033872641623, -0.0435100232786499, -0.051776970326900484, 0.09424780239351094, 0.0372898212634027, 0.029081388479098677, 0.099545630607754, -0.14126914004984428, -0.06465240669669584, 0.33794721379876136, -0.14488041533390061, -0.29694797344505786, 0.18745631374418736, -0.13991989935748278, -0.10515777366235853, 0.12176906699314713, 0.18881652034819127, 0.15275879175402224, -0.1654060029424727, 0.17099652249366046, 0.016840573216322808, 0.1338634519279003, 0.09398037360981107, -0.0016839685512240977, 0.21171585325151682, 0.10505095118656754, 0.08155340621247888, 0.16528936557471752, -0.06288746720412747, -0.16227418722584844, -0.3509334442019463, -0.1657494385354221, -0.18110148287378253, 0.05268629122525453, -0.12703743346966803, -0.2320105031784624, 0.4059594730660319, 0.14723761267377994, 0.16348915990442037, 0.006818768791854382, 0.28066817759536206, 0.1643152767792344, 0.10931277782656253, 0.08175070490688086, 0.18985990882851184, 0.169166063782759, 0.10245708953589201, -0.25903487879782916, -0.1356378882844001, 0.12100037621334195] |
1,802.09572 | General volumes in the Orlicz-Brunn-Minkowski theory and a related
Minkowski Problem I | The general volume of a star body, a notion that includes the usual volume,
the $q$th dual volumes, and many previous types of dual mixed volumes, is
introduced. A corresponding new general dual Orlicz curvature measure is
defined that specializes to the $(p,q)$-dual curvature measures introduced
recently by Lutwak, Yang, and Zhang. General variational formulas are
established for the general volume of two types of Orlicz linear combinations.
One of these is applied to the Minkowski problem for the new general dual
Orlicz curvature measure, giving in particular a solution to the Minkowski
problem posed by Lutwak, Yang, and Zhang for the $(p,q)$-dual curvature
measures when $p>0$ and $q<0$. A dual Orlicz-Brunn-Minkowski inequality for
general volumes is obtained, as well as dual Orlicz-Minkowski-type inequalities
and uniqueness results for star bodies. Finally, a very general Minkowski-type
inequality, involving two Orlicz functions, two convex bodies, and a star body,
is proved, that includes as special cases several others in the literature, in
particular one due to Lutwak, Yang, and Zhang for the $(p,q)$-mixed volume.
| math.MG math.AP math.DG math.FA | the general volume of a star body a notion that includes the usual volume the qth dual volumes and many previous types of dual mixed volumes is introduced a corresponding new general dual orlicz curvature measure is defined that specializes to the pqdual curvature measures introduced recently by lutwak yang and zhang general variational formulas are established for the general volume of two types of orlicz linear combinations one of these is applied to the minkowski problem for the new general dual orlicz curvature measure giving in particular a solution to the minkowski problem posed by lutwak yang and zhang for the pqdual curvature measures when p0 and q0 a dual orliczbrunnminkowski inequality for general volumes is obtained as well as dual orliczminkowskitype inequalities and uniqueness results for star bodies finally a very general minkowskitype inequality involving two orlicz functions two convex bodies and a star body is proved that includes as special cases several others in the literature in particular one due to lutwak yang and zhang for the pqmixed volume | [['the', 'general', 'volume', 'of', 'a', 'star', 'body', 'a', 'notion', 'that', 'includes', 'the', 'usual', 'volume', 'the', 'qth', 'dual', 'volumes', 'and', 'many', 'previous', 'types', 'of', 'dual', 'mixed', 'volumes', 'is', 'introduced', 'a', 'corresponding', 'new', 'general', 'dual', 'orlicz', 'curvature', 'measure', 'is', 'defined', 'that', 'specializes', 'to', 'the', 'pqdual', 'curvature', 'measures', 'introduced', 'recently', 'by', 'lutwak', 'yang', 'and', 'zhang', 'general', 'variational', 'formulas', 'are', 'established', 'for', 'the', 'general', 'volume', 'of', 'two', 'types', 'of', 'orlicz', 'linear', 'combinations', 'one', 'of', 'these', 'is', 'applied', 'to', 'the', 'minkowski', 'problem', 'for', 'the', 'new', 'general', 'dual', 'orlicz', 'curvature', 'measure', 'giving', 'in', 'particular', 'a', 'solution', 'to', 'the', 'minkowski', 'problem', 'posed', 'by', 'lutwak', 'yang', 'and', 'zhang', 'for', 'the', 'pqdual', 'curvature', 'measures', 'when', 'p0', 'and', 'q0', 'a', 'dual', 'orliczbrunnminkowski', 'inequality', 'for', 'general', 'volumes', 'is', 'obtained', 'as', 'well', 'as', 'dual', 'orliczminkowskitype', 'inequalities', 'and', 'uniqueness', 'results', 'for', 'star', 'bodies', 'finally', 'a', 'very', 'general', 'minkowskitype', 'inequality', 'involving', 'two', 'orlicz', 'functions', 'two', 'convex', 'bodies', 'and', 'a', 'star', 'body', 'is', 'proved', 'that', 'includes', 'as', 'special', 'cases', 'several', 'others', 'in', 'the', 'literature', 'in', 'particular', 'one', 'due', 'to', 'lutwak', 'yang', 'and', 'zhang', 'for', 'the', 'pqmixed', 'volume']] | [-0.0743845667872977, 0.08772955405168302, -0.053413616033226606, 0.13336218685435597, -0.09189453944730173, -0.13359298196432756, -0.02103672387255799, 0.2628557623996, -0.24926090677590332, -0.22171891130329596, 0.1363654549024345, -0.2726160083866922, -0.15709088073067723, 0.21769187203608453, -0.1904687661260271, 0.06748302741020563, -0.029685579189043937, 0.010298401430537481, -0.08926092124948766, -0.29722870824514847, 0.36583978301357656, -0.033763649502015186, 0.2482667780187469, 0.08834322020854979, 0.10524654467701025, 0.029415370771727924, -0.033204510890105406, 0.10889340778252128, -0.19937046083625665, 0.16716717178462118, 0.2477326863667085, 0.14348867134235443, 0.28138306280570324, -0.35260855757986154, -0.21517925230104343, 0.11881419419937413, 0.05422235485665234, 0.03417444648082545, -0.06842243793930504, -0.28162521618928404, 0.045964520618629955, -0.12332412834214102, -0.18324942925357304, -0.07947978478512682, 0.08365560191339769, 0.025173681383464663, -0.3154135208211041, 0.11313432213916842, 0.08155218377734334, 0.024746742901957726, -0.12058253716289376, -0.12961025812616017, 0.0006554144499768015, 0.05631280246338325, 0.05447806322453765, 0.10587415730558514, 0.0401924224376368, -0.07475164216122634, -0.1330221411855226, 0.34224248791690026, -0.025842245331746415, -0.2784381328882383, 0.1709789493527621, -0.14560877190281948, -0.14604857336824006, 0.04436849932798872, 0.13775751010758713, 0.16262377810475992, -0.14223375591531554, 0.1435866662099475, -0.1018844156365265, 0.036810077785048634, 0.146286923862395, 0.03749106496044468, 0.11431263501678283, 0.04960174229511592, 0.12034855137053888, 0.19419590265966863, -0.0160520714541365, -0.13846233937268457, -0.3125180525350429, -0.22180030303536027, -0.1842133198099743, 0.05508391997067347, -0.13202218871802393, -0.1425774271959935, 0.3250401384540878, -0.022890235333415193, 0.15009358772242973, 0.09781405715364686, 0.21624323551908933, 0.08176435256678988, 0.04864076406478749, 0.06381454987595567, 0.2386758942184748, 0.22267640932668223, 0.09963495007693945, -0.14346715567738838, -0.013569287143625496, 0.21098959383588017] |
1,802.09573 | The gravitational field of static p-branes in linearized ghost-free
gravity | We study the gravitational field of static p-branes in D-dimensional
Minkowski space in the framework of linearized ghost-free (GF) gravity. The
concrete models of GF gravity we consider are parametrized by the non-local
form factors $\exp(-\Box/\mu^2)$ and $\exp(\Box^2/\mu^4)$, where $\mu^{-1}$ is
the scale of non-locality. We show that the singular behavior of the
gravitational field of p-branes in General Relativity is cured by short-range
modifications introduced by the non-localities, and we derive exact expressions
of the regularized gravitational fields, whose geometry can be written as a
warped metric. For large distances compared to the scale of non-locality, $\mu
r\rightarrow\infty$, our solutions approach those found in linearized General
Relativity.
| gr-qc | we study the gravitational field of static pbranes in ddimensional minkowski space in the framework of linearized ghostfree gf gravity the concrete models of gf gravity we consider are parametrized by the nonlocal form factors expboxmu2 and expbox2mu4 where mu1 is the scale of nonlocality we show that the singular behavior of the gravitational field of pbranes in general relativity is cured by shortrange modifications introduced by the nonlocalities and we derive exact expressions of the regularized gravitational fields whose geometry can be written as a warped metric for large distances compared to the scale of nonlocality mu rrightarrowinfty our solutions approach those found in linearized general relativity | [['we', 'study', 'the', 'gravitational', 'field', 'of', 'static', 'pbranes', 'in', 'ddimensional', 'minkowski', 'space', 'in', 'the', 'framework', 'of', 'linearized', 'ghostfree', 'gf', 'gravity', 'the', 'concrete', 'models', 'of', 'gf', 'gravity', 'we', 'consider', 'are', 'parametrized', 'by', 'the', 'nonlocal', 'form', 'factors', 'expboxmu2', 'and', 'expbox2mu4', 'where', 'mu1', 'is', 'the', 'scale', 'of', 'nonlocality', 'we', 'show', 'that', 'the', 'singular', 'behavior', 'of', 'the', 'gravitational', 'field', 'of', 'pbranes', 'in', 'general', 'relativity', 'is', 'cured', 'by', 'shortrange', 'modifications', 'introduced', 'by', 'the', 'nonlocalities', 'and', 'we', 'derive', 'exact', 'expressions', 'of', 'the', 'regularized', 'gravitational', 'fields', 'whose', 'geometry', 'can', 'be', 'written', 'as', 'a', 'warped', 'metric', 'for', 'large', 'distances', 'compared', 'to', 'the', 'scale', 'of', 'nonlocality', 'mu', 'rrightarrowinfty', 'our', 'solutions', 'approach', 'those', 'found', 'in', 'linearized', 'general', 'relativity']] | [-0.17749748691775888, 0.11485728304086358, -0.08280734624713659, 0.13610447335874065, -0.07743437358898655, -0.11996005672328877, -0.09239146669882894, 0.26506434607249246, -0.20480361408422226, -0.2483186929504264, 0.04456310548362726, -0.24670710125586615, -0.19779698341153562, 0.13403362725676862, -0.030148441622139147, 0.04159512691516078, -0.016553620080779888, 0.06215719742489592, -0.10165722255006363, -0.22594487843903238, 0.4025945346802473, 0.05024480487589004, 0.2056139359988694, 0.02076937263515198, 0.08966771215815449, -0.0047624265546646885, -0.015421069284268427, 0.11714567602057457, -0.15111501524830293, 0.09289064903233973, 0.21870608604228248, 0.11729789183053346, 0.22175997090613786, -0.44725125958651024, -0.25612405309769903, 0.06751232595130238, 0.09538825243526965, 0.15680155913644242, -0.006344135666160651, -0.348768800986878, 0.055985914617678025, -0.17187112448561304, -0.1772588554304093, -0.08462533595497315, 0.028000273388142715, -0.03584741532609288, -0.25513035983268945, 0.12148561976182293, 0.04276065301382914, -0.012021662153409055, -0.09082319454799564, -0.06709991533853957, 0.010940179872361696, 0.04303037257917788, 0.12399457022877199, 0.05433464025911647, 0.11972470282805416, -0.14741524067303202, -0.10190368097995953, 0.43222398179767757, -0.16201465126162148, -0.28702935513179256, 0.12382118386339466, -0.17843009431597684, -0.1021026073612343, 0.07074183053644549, 0.18152788827933794, 0.20261616510216077, -0.17597829925669534, 0.2094704734220802, -0.004330339696574604, 0.08711817040863745, 0.12206813478227353, 0.0552823998897231, 0.22410911044879062, 0.0746482579160552, 0.013714980457048371, 0.14833153554409706, -0.024026414089537453, -0.10998544944801701, -0.388388877611537, -0.1350142223582568, -0.1602263324630429, 0.08450294570681059, -0.18282806904045293, -0.171691052114837, 0.3382723926904805, 0.11614342025955612, 0.10215715346429585, 0.08395802284116452, 0.21196571135023645, 0.12168846222822431, 0.07234045529281194, 0.09009889403428391, 0.3242354660101657, 0.13158313842832972, 0.051514825313615634, -0.22420909982789658, -0.0671643671933298, 0.11528349814514788] |
1,802.09574 | Optimal Investment Decision Under Switching regimes of Subsidy Support | We address the problem of making a managerial decision when the investment
project is subsidized, which results in the resolution of an infinite-horizon
optimal stopping problem of a switching diffusion driven by either an
homogeneous or an inhomogeneous continuous-time Markov chain.
We provide a characterization of the value function (and optimal strategy) of
the optimal stopping problem. On the one hand, broadly, we can prove that the
value function is the unique viscosity solution to a system of HJB equations.
On the other hand, when the Markov chain is homogeneous and the switching
diffusion is one-dimensional, we obtain stronger results: the value function is
the difference between two convex functions.
| math.PR math.OC | we address the problem of making a managerial decision when the investment project is subsidized which results in the resolution of an infinitehorizon optimal stopping problem of a switching diffusion driven by either an homogeneous or an inhomogeneous continuoustime markov chain we provide a characterization of the value function and optimal strategy of the optimal stopping problem on the one hand broadly we can prove that the value function is the unique viscosity solution to a system of hjb equations on the other hand when the markov chain is homogeneous and the switching diffusion is onedimensional we obtain stronger results the value function is the difference between two convex functions | [['we', 'address', 'the', 'problem', 'of', 'making', 'a', 'managerial', 'decision', 'when', 'the', 'investment', 'project', 'is', 'subsidized', 'which', 'results', 'in', 'the', 'resolution', 'of', 'an', 'infinitehorizon', 'optimal', 'stopping', 'problem', 'of', 'a', 'switching', 'diffusion', 'driven', 'by', 'either', 'an', 'homogeneous', 'or', 'an', 'inhomogeneous', 'continuoustime', 'markov', 'chain', 'we', 'provide', 'a', 'characterization', 'of', 'the', 'value', 'function', 'and', 'optimal', 'strategy', 'of', 'the', 'optimal', 'stopping', 'problem', 'on', 'the', 'one', 'hand', 'broadly', 'we', 'can', 'prove', 'that', 'the', 'value', 'function', 'is', 'the', 'unique', 'viscosity', 'solution', 'to', 'a', 'system', 'of', 'hjb', 'equations', 'on', 'the', 'other', 'hand', 'when', 'the', 'markov', 'chain', 'is', 'homogeneous', 'and', 'the', 'switching', 'diffusion', 'is', 'onedimensional', 'we', 'obtain', 'stronger', 'results', 'the', 'value', 'function', 'is', 'the', 'difference', 'between', 'two', 'convex', 'functions']] | [-0.12731219058094376, 0.07380091581766134, -0.09059812711890448, 0.057315149332862345, -0.10925431171940132, -0.1359843586148186, 0.04802943091331558, 0.3980409501967105, -0.35971417432142927, -0.22219645819542083, 0.20127166004438715, -0.2767905729187822, -0.115553586213024, 0.18480130220043728, -0.05111067063090476, 0.06664182533462405, 0.04831264344975352, 0.024426834399822506, -0.042681676782244306, -0.23475126317617567, 0.34493012079461055, 0.04215286024422808, 0.2860608487897976, 0.041395434988027606, 0.1510001242414794, 0.024207577200352468, 0.038489935746077786, 0.0320230537454005, -0.18204215304874444, 0.0958012924878858, 0.23371254870541056, 0.12045571118042889, 0.34953743310814556, -0.3809782821515744, -0.15959797346625815, 0.14151325227100064, 0.09206288959831, 0.11507582321911204, -0.006533917606892911, -0.23769423380409452, 0.0479493748692965, -0.12825700901237064, -0.1223996439398351, 0.01812720147215507, -0.010260522369803352, 0.04336726238781756, -0.36189087289808824, 0.04423181886827065, 0.05327072087675333, 0.01583215928721157, -0.1257720337757333, -0.1090903320804831, 0.013130556770854375, 0.11248701210609977, 0.0639841957398775, 0.01651494262994013, 0.10819050932557069, -0.15274671347473157, -0.15228200117126106, 0.32080323895100843, -0.07288263603325255, -0.2582671707665378, 0.16003440493209795, -0.10812836648070846, -0.09448254856026986, 0.12739418933845378, 0.14994211966087195, 0.17416990099220792, -0.193518370990271, 0.07315755668837069, -0.06603387005796486, 0.17909801129690922, 0.0011616898700594902, -0.031254107831045985, 0.13560140461406925, 0.21662367357639595, 0.22143841808428988, 0.1835792400075165, -0.012547697029499845, -0.15892034445635297, -0.2679806199432774, -0.17301129521167075, -0.1745758566613817, 0.09857280505821109, -0.12548865433755882, -0.18028328808193858, 0.33372200851074674, 0.13792006501834378, 0.16216720427063674, 0.08643055596410043, 0.2644010546955873, 0.24253316265107555, -0.05121645542623644, 0.07562180658887056, 0.18258907982910222, 0.09136277693429623, 0.07926953881767325, -0.26984165669842197, 0.12925724077292464, 0.09243698314001614] |
1,802.09575 | i3PosNet: Instrument Pose Estimation from X-Ray in temporal bone surgery | Purpose: Accurate estimation of the position and orientation (pose) of
surgical instruments is crucial for delicate minimally invasive temporal bone
surgery. Current techniques lack in accuracy and/or line-of-sight constraints
(conventional tracking systems) or expose the patient to prohibitive ionizing
radiation (intra-operative CT). A possible solution is to capture the
instrument with a c-arm at irregular intervals and recover the pose from the
image.
Methods: i3PosNet infers the position and orientation of instruments from
images using a pose estimation network. Said framework considers localized
patches and outputs pseudo-landmarks. The pose is reconstructed from
pseudo-landmarks by geometric considerations.
Results: We show i3PosNet reaches errors less than 0.05mm. It outperforms
conventional image registration-based approaches reducing average and maximum
errors by at least two thirds. i3PosNet trained on synthetic images generalizes
to real x-rays without any further adaptation.
Conclusion: The translation of Deep Learning based methods to surgical
applications is difficult, because large representative datasets for training
and testing are not available. This work empirically shows sub-millimeter pose
estimation trained solely based on synthetic training data.
| cs.CV eess.IV | purpose accurate estimation of the position and orientation pose of surgical instruments is crucial for delicate minimally invasive temporal bone surgery current techniques lack in accuracy andor lineofsight constraints conventional tracking systems or expose the patient to prohibitive ionizing radiation intraoperative ct a possible solution is to capture the instrument with a carm at irregular intervals and recover the pose from the image methods i3posnet infers the position and orientation of instruments from images using a pose estimation network said framework considers localized patches and outputs pseudolandmarks the pose is reconstructed from pseudolandmarks by geometric considerations results we show i3posnet reaches errors less than 005mm it outperforms conventional image registrationbased approaches reducing average and maximum errors by at least two thirds i3posnet trained on synthetic images generalizes to real xrays without any further adaptation conclusion the translation of deep learning based methods to surgical applications is difficult because large representative datasets for training and testing are not available this work empirically shows submillimeter pose estimation trained solely based on synthetic training data | [['purpose', 'accurate', 'estimation', 'of', 'the', 'position', 'and', 'orientation', 'pose', 'of', 'surgical', 'instruments', 'is', 'crucial', 'for', 'delicate', 'minimally', 'invasive', 'temporal', 'bone', 'surgery', 'current', 'techniques', 'lack', 'in', 'accuracy', 'andor', 'lineofsight', 'constraints', 'conventional', 'tracking', 'systems', 'or', 'expose', 'the', 'patient', 'to', 'prohibitive', 'ionizing', 'radiation', 'intraoperative', 'ct', 'a', 'possible', 'solution', 'is', 'to', 'capture', 'the', 'instrument', 'with', 'a', 'carm', 'at', 'irregular', 'intervals', 'and', 'recover', 'the', 'pose', 'from', 'the', 'image', 'methods', 'i3posnet', 'infers', 'the', 'position', 'and', 'orientation', 'of', 'instruments', 'from', 'images', 'using', 'a', 'pose', 'estimation', 'network', 'said', 'framework', 'considers', 'localized', 'patches', 'and', 'outputs', 'pseudolandmarks', 'the', 'pose', 'is', 'reconstructed', 'from', 'pseudolandmarks', 'by', 'geometric', 'considerations', 'results', 'we', 'show', 'i3posnet', 'reaches', 'errors', 'less', 'than', '005mm', 'it', 'outperforms', 'conventional', 'image', 'registrationbased', 'approaches', 'reducing', 'average', 'and', 'maximum', 'errors', 'by', 'at', 'least', 'two', 'thirds', 'i3posnet', 'trained', 'on', 'synthetic', 'images', 'generalizes', 'to', 'real', 'xrays', 'without', 'any', 'further', 'adaptation', 'conclusion', 'the', 'translation', 'of', 'deep', 'learning', 'based', 'methods', 'to', 'surgical', 'applications', 'is', 'difficult', 'because', 'large', 'representative', 'datasets', 'for', 'training', 'and', 'testing', 'are', 'not', 'available', 'this', 'work', 'empirically', 'shows', 'submillimeter', 'pose', 'estimation', 'trained', 'solely', 'based', 'on', 'synthetic', 'training', 'data']] | [-0.029057851979878785, 0.00608600290656528, -0.046475106625653365, 0.08114891665549401, -0.10301821679698632, -0.21153387119034853, 0.0007812227505971404, 0.446649355309851, -0.1999743337633417, -0.3808661585618906, 0.12663809402832105, -0.27284554863239036, -0.14081859353738016, 0.22638846716213534, -0.2156478798482567, 0.08133727135136723, 0.19083758530700032, -0.005459000490715398, -0.08800399862058625, -0.2576742435394622, 0.2645527047516011, 0.035996757632443296, 0.342920270927853, -0.00011458285358350943, 0.15236720790168928, 0.023285278716460144, -0.07694753573399365, 0.008453952929052962, -0.06877278329955194, 0.14910033549565602, 0.28255596133907707, 0.20205345340347028, 0.2697106584687443, -0.4238052178009906, -0.21903769439976553, 0.07921437683980911, 0.11144174317870399, 0.0995406369693228, -0.0033291489214581603, -0.3397477668490918, 0.06082399197963669, -0.08355370765990194, -0.024828927544876932, -0.08427419217906015, -0.04056257357793477, -0.033414340180837936, -0.29631065260105327, 0.09472496903720586, -0.008739401969839545, 0.12085858335280243, -0.08348395958378473, -0.10997892666662878, -0.002152294394395807, 0.1886444434756413, 0.04096049159929595, 0.07494335143881685, 0.1899021304459037, -0.1893341940238743, -0.09987083097700687, 0.3636955470120644, 0.001129879595229046, -0.20956623822121936, 0.19382923102718505, -0.09022332843091777, -0.12106958815060995, 0.17574103745796224, 0.1839474741999498, 0.12794155458412954, -0.14696295076043017, 0.0015574021189583137, 0.03141417138703058, 0.2287710079074125, 0.04994457174256882, -0.04413335220203461, 0.1969349675168119, 0.20266873688875314, 0.05144270948846551, 0.10729155885466539, -0.22167056782225913, -0.005364926278878771, -0.20221351833521006, -0.0861573985153775, -0.2115694254705244, -0.005691365345624303, -0.11045504163296702, -0.14518068926408886, 0.35670929178047706, 0.2387049760642078, 0.17092022281414007, 0.0893274132080157, 0.42145072426646946, 0.0053032244007815334, 0.10484500829513897, 0.06407941938651836, 0.19576460201471277, 0.02422242255141849, 0.08716187217985005, -0.17746670890996671, 0.12848357405267, 0.034926645952167316] |
1,802.09576 | Phases of quantum dimers from ensembles of classical stochastic
trajectories | We study the connection between the phase behaviour of quantum dimers and the
dynamics of classical stochastic dimers. At the so-called Rokhsar-Kivelson (RK)
point a quantum dimer Hamiltonian is equivalent to the Markov generator of the
dynamics of classical dimers. A less well understood fact is that away from the
RK point the quantum-classical connection persists: in this case the
Hamiltonian corresponds to a non-stochastic "tilted" operator that encodes the
statistics of time-integrated observables of the classical stochastic problem.
This implies a direct relation between the phase behaviour of quantum dimers
and properties of ensembles of stochastic trajectories of classical dimers. We
make these ideas concrete by studying fully packed dimers on the square
lattice. Using transition path sampling - supplemented by trajectory umbrella
sampling - we obtain the large deviation statistics of dynamical activity in
the classical problem, and show the correspondence between the phase behaviour
of the classical and quantum systems. The transition at the RK point between
quantum phases of distinct order corresponds, in the classical case, to a
trajectory phase transition between active and inactive dynamical phases.
Furthermore, from the structure of stochastic trajectories in the active
dynamical phase we infer that the ground state of quantum dimers has columnar
order to one side of the RK point. We discuss how these results relate to those
from quantum Monte Carlo, and how our approach may generalise to other
problems.
| cond-mat.stat-mech | we study the connection between the phase behaviour of quantum dimers and the dynamics of classical stochastic dimers at the socalled rokhsarkivelson rk point a quantum dimer hamiltonian is equivalent to the markov generator of the dynamics of classical dimers a less well understood fact is that away from the rk point the quantumclassical connection persists in this case the hamiltonian corresponds to a nonstochastic tilted operator that encodes the statistics of timeintegrated observables of the classical stochastic problem this implies a direct relation between the phase behaviour of quantum dimers and properties of ensembles of stochastic trajectories of classical dimers we make these ideas concrete by studying fully packed dimers on the square lattice using transition path sampling supplemented by trajectory umbrella sampling we obtain the large deviation statistics of dynamical activity in the classical problem and show the correspondence between the phase behaviour of the classical and quantum systems the transition at the rk point between quantum phases of distinct order corresponds in the classical case to a trajectory phase transition between active and inactive dynamical phases furthermore from the structure of stochastic trajectories in the active dynamical phase we infer that the ground state of quantum dimers has columnar order to one side of the rk point we discuss how these results relate to those from quantum monte carlo and how our approach may generalise to other problems | [['we', 'study', 'the', 'connection', 'between', 'the', 'phase', 'behaviour', 'of', 'quantum', 'dimers', 'and', 'the', 'dynamics', 'of', 'classical', 'stochastic', 'dimers', 'at', 'the', 'socalled', 'rokhsarkivelson', 'rk', 'point', 'a', 'quantum', 'dimer', 'hamiltonian', 'is', 'equivalent', 'to', 'the', 'markov', 'generator', 'of', 'the', 'dynamics', 'of', 'classical', 'dimers', 'a', 'less', 'well', 'understood', 'fact', 'is', 'that', 'away', 'from', 'the', 'rk', 'point', 'the', 'quantumclassical', 'connection', 'persists', 'in', 'this', 'case', 'the', 'hamiltonian', 'corresponds', 'to', 'a', 'nonstochastic', 'tilted', 'operator', 'that', 'encodes', 'the', 'statistics', 'of', 'timeintegrated', 'observables', 'of', 'the', 'classical', 'stochastic', 'problem', 'this', 'implies', 'a', 'direct', 'relation', 'between', 'the', 'phase', 'behaviour', 'of', 'quantum', 'dimers', 'and', 'properties', 'of', 'ensembles', 'of', 'stochastic', 'trajectories', 'of', 'classical', 'dimers', 'we', 'make', 'these', 'ideas', 'concrete', 'by', 'studying', 'fully', 'packed', 'dimers', 'on', 'the', 'square', 'lattice', 'using', 'transition', 'path', 'sampling', 'supplemented', 'by', 'trajectory', 'umbrella', 'sampling', 'we', 'obtain', 'the', 'large', 'deviation', 'statistics', 'of', 'dynamical', 'activity', 'in', 'the', 'classical', 'problem', 'and', 'show', 'the', 'correspondence', 'between', 'the', 'phase', 'behaviour', 'of', 'the', 'classical', 'and', 'quantum', 'systems', 'the', 'transition', 'at', 'the', 'rk', 'point', 'between', 'quantum', 'phases', 'of', 'distinct', 'order', 'corresponds', 'in', 'the', 'classical', 'case', 'to', 'a', 'trajectory', 'phase', 'transition', 'between', 'active', 'and', 'inactive', 'dynamical', 'phases', 'furthermore', 'from', 'the', 'structure', 'of', 'stochastic', 'trajectories', 'in', 'the', 'active', 'dynamical', 'phase', 'we', 'infer', 'that', 'the', 'ground', 'state', 'of', 'quantum', 'dimers', 'has', 'columnar', 'order', 'to', 'one', 'side', 'of', 'the', 'rk', 'point', 'we', 'discuss', 'how', 'these', 'results', 'relate', 'to', 'those', 'from', 'quantum', 'monte', 'carlo', 'and', 'how', 'our', 'approach', 'may', 'generalise', 'to', 'other', 'problems']] | [-0.1217494626767385, 0.17254370588656048, -0.1192738469266756, 0.08162753280953734, -0.0007837977082956405, -0.11961881718164899, 0.08452972246523446, 0.3463780416248294, -0.31142151837128323, -0.2556411553420191, 0.06058853126616818, -0.30675298617789887, -0.1834133103110896, 0.14210119484636521, -0.0039914341208029105, 0.053536037063766355, 0.031143033610292997, 0.03473881178725011, -0.12742981199856476, -0.18025664058594573, 0.2983696777010699, 0.01692444206673039, 0.24688228504788695, -0.01587801353574541, 0.08967374537434446, 0.013206728111178456, 0.0509909259405358, 0.003955858814513948, -0.165762770416494, 0.08107917947448726, 0.21832812534246063, 0.05277951202633512, 0.21458127220903092, -0.428364353407642, -0.1858740228095225, 0.12602663733815025, 0.11479573829041076, 0.1499518964165475, -0.013579035525560959, -0.2946568788996861, 0.02871408574363757, -0.12117814358920503, -0.1414353436663408, -0.04568341129673121, -0.04314811776283306, 0.02007296703880838, -0.2119324955007251, 0.09994237676254793, 0.08959448935418164, 0.05712758945260858, 0.010808772520359718, -0.07314575487522013, -0.025504839202405247, 0.14870071505676163, -0.0009582452944709689, 0.025598168418464528, 0.11410685509692241, -0.12036411503775375, -0.1763525885545943, 0.3928676051333611, -0.03359972963409974, -0.15185775070600374, 0.20374007207428174, -0.15262077176085173, -0.12123395953512875, 0.13640721922224283, 0.12040338496318756, 0.11246120947457496, -0.12237817463510392, 0.09417759278815369, -0.017664461654663344, 0.15509356827892412, -0.014877681233375878, 0.030848072775240456, 0.21337918867750796, 0.1250335971877237, 0.07074449381043175, 0.20584773984198454, -0.08290811617923215, -0.29294701455588334, -0.2876356611697576, -0.15780068382225704, -0.20699693756359447, 0.06131728849014936, -0.10164920024239171, -0.1725098491585937, 0.36546795361663226, 0.1504219779772462, 0.20847837929613888, 0.03991557103561568, 0.2387527767992155, 0.11314758937352325, -0.012448215959956507, 0.026133525850517408, 0.23973179440965545, 0.17434072271553855, 0.0724937744172556, -0.28047355963219583, 0.017535351257110057, 0.12319023765369573] |
1,802.09577 | Stochastic inflation with quantum and thermal noise | We add a thermal noise to Starobinsky equation of slow roll inflation. We
calculate the number of e-folds of the stochastic system. The power spectrum
and the spectral index are evaluated from the fluctuations of e-folds using an
expansion in the quantum and thermal noise terms.
| gr-qc astro-ph.CO | we add a thermal noise to starobinsky equation of slow roll inflation we calculate the number of efolds of the stochastic system the power spectrum and the spectral index are evaluated from the fluctuations of efolds using an expansion in the quantum and thermal noise terms | [['we', 'add', 'a', 'thermal', 'noise', 'to', 'starobinsky', 'equation', 'of', 'slow', 'roll', 'inflation', 'we', 'calculate', 'the', 'number', 'of', 'efolds', 'of', 'the', 'stochastic', 'system', 'the', 'power', 'spectrum', 'and', 'the', 'spectral', 'index', 'are', 'evaluated', 'from', 'the', 'fluctuations', 'of', 'efolds', 'using', 'an', 'expansion', 'in', 'the', 'quantum', 'and', 'thermal', 'noise', 'terms']] | [-0.16515542212468776, 0.1755143957463746, -0.11180804305426452, 0.0645021051775826, -0.012911835239957209, -0.0919978886174605, -0.02254027693593146, 0.24350049468162266, -0.2627729130503924, -0.3055467400699854, 0.09492225093392494, -0.28198243924619065, -0.11952358411382073, 0.1687226554216898, -0.08661122439915071, 0.05151251725771505, 0.008742768945091444, 0.04195152265120945, 0.014588870383981292, -0.2547317322991464, 0.2739823639149899, 0.1345060060848482, 0.1979484004980844, -0.039538854469909616, 0.08923768438398838, -0.0890053199938215, -0.003198009348757889, -0.005035275067000285, -0.16861613480495694, 0.07357063238589984, 0.11865884302001771, 0.10644860938191414, 0.22540571978923096, -0.430923186890457, -0.240244557676108, 0.17001785307555742, 0.10978979581863235, 0.13208321773487589, 0.047615308820715414, -0.22968024509432522, 0.03934963363344255, -0.20603139701542322, -0.10646404068836052, -0.12337169115958006, -0.011002836425019346, -0.00726337350257065, -0.3186209803123189, 0.133393757895607, -0.01483667973914872, 0.013908862662704094, -0.005158689632282957, -0.0704749934147517, -0.02532483992146571, 0.0585432015966786, 0.11848593076043155, -0.07956136727665106, 0.17715575179571044, -0.18398346404706978, -0.050793180586365255, 0.36175876258589, -0.18716176495502662, -0.10538733535972626, 0.03606652845021175, -0.1382289824237966, -0.09249076607596615, 0.16686820133548716, 0.13215132644804922, 0.06702247634530067, -0.12349850411081444, 0.1269895311257721, 0.1371122006650852, 0.19759935374452692, 0.11314741982673497, 0.050926423287424055, 0.22935818556858145, 0.10420007845791786, 0.016832225044946306, 0.19722023897844812, -0.1137081036830078, -0.1033027418281721, -0.36587277417192643, -0.10775178298607226, -0.21110212487047134, 0.09023047089779182, -0.22168629723740235, -0.2218934301610874, 0.4894776705490506, 0.17138995716105337, 0.20110292232635876, 0.0674811241561142, 0.31862167609126674, 0.2297980465075892, -0.045879734153656856, 0.12687045642498718, 0.26143246595545305, 0.18106010167495065, 0.18141225765904653, -0.2837344142962652, -0.05549577352307413, 0.0132071227847558] |
1,802.09578 | Near-Linear Time Local Polynomial Nonparametric Estimation with Box
Kernels | Local polynomial regression (Fan and Gijbels 1996) is an important class of
methods for nonparametric density estimation and regression problems. However,
straightforward implementation of local polynomial regression has quadratic
time complexity which hinders its applicability in large-scale data analysis.
In this paper, we significantly accelerate the computation of local polynomial
estimates by novel applications of multi-dimensional binary indexed trees
(Fenwick 1994). Both time and space complexity of our proposed algorithm is
nearly linear in the number of input data points. Simulation results confirm
the efficiency and effectiveness of our proposed approach.
| stat.CO cs.DS cs.LG stat.ML | local polynomial regression fan and gijbels 1996 is an important class of methods for nonparametric density estimation and regression problems however straightforward implementation of local polynomial regression has quadratic time complexity which hinders its applicability in largescale data analysis in this paper we significantly accelerate the computation of local polynomial estimates by novel applications of multidimensional binary indexed trees fenwick 1994 both time and space complexity of our proposed algorithm is nearly linear in the number of input data points simulation results confirm the efficiency and effectiveness of our proposed approach | [['local', 'polynomial', 'regression', 'fan', 'and', 'gijbels', '1996', 'is', 'an', 'important', 'class', 'of', 'methods', 'for', 'nonparametric', 'density', 'estimation', 'and', 'regression', 'problems', 'however', 'straightforward', 'implementation', 'of', 'local', 'polynomial', 'regression', 'has', 'quadratic', 'time', 'complexity', 'which', 'hinders', 'its', 'applicability', 'in', 'largescale', 'data', 'analysis', 'in', 'this', 'paper', 'we', 'significantly', 'accelerate', 'the', 'computation', 'of', 'local', 'polynomial', 'estimates', 'by', 'novel', 'applications', 'of', 'multidimensional', 'binary', 'indexed', 'trees', 'fenwick', '1994', 'both', 'time', 'and', 'space', 'complexity', 'of', 'our', 'proposed', 'algorithm', 'is', 'nearly', 'linear', 'in', 'the', 'number', 'of', 'input', 'data', 'points', 'simulation', 'results', 'confirm', 'the', 'efficiency', 'and', 'effectiveness', 'of', 'our', 'proposed', 'approach']] | [-0.07426545024941583, -0.048217816788614934, -0.057479887919316255, 0.0287757035048044, -0.0987292523956397, -0.09953107012967978, 0.049742044984608644, 0.3417016905988311, -0.3055071411449667, -0.32348621953381124, 0.12397916032037196, -0.19021316157375043, -0.2018824181529683, 0.2561499177027944, -0.10880027437591568, 0.1609731649789335, 0.0995391239053928, -0.03917098262316578, -0.07961433579387901, -0.3768782644113014, 0.25635410853467144, 0.10150853044015694, 0.3100484151643916, -0.010454446138752686, 0.12014967941801873, 0.049461914118952476, -0.1101686581048173, 0.023515275218664762, -0.09329940594609949, 0.1339827409541173, 0.2990499265737586, 0.19892148499551054, 0.35072198156062717, -0.3688210340441911, -0.1974502314230079, 0.14039016661367246, 0.1497116355164038, 0.06975778876317686, -0.03717727158576823, -0.2458665258120643, 0.06423166021832603, -0.14146982013647044, -0.08288759165596994, -0.12695334988369883, 0.013765865624728766, 0.017299237862231906, -0.31834252244168587, 0.1223672273988416, 0.0874529230295793, 0.0651454867508549, -0.03547065975886493, -0.13020813546481205, 0.02462421770074538, 0.03989357534018192, 0.007943822641519237, 0.029041553433002024, 0.08571874331375891, -0.10009863329693101, -0.18469539679750635, 0.32704198565129394, -0.03866481274407316, -0.18971931094887082, 0.20772447536320804, -0.07959561030237147, -0.17391790371070934, 0.15169207392526524, 0.2483795064777791, 0.1192307440195601, -0.09093532953308997, 0.15276027158424668, -0.06711981943578224, 0.13548726620725715, 0.03791461815382098, -0.03621863383431356, 0.09130320534529676, 0.193434013222641, 0.06981751768962367, 0.13439677191059013, -0.10675267267532156, -0.09981103603226635, -0.23661369865166618, -0.15972023533022667, -0.23757345469893662, -0.09222498723333906, -0.20159492896969564, -0.18397222418378997, 0.4120165531595166, 0.1885168477278817, 0.16905013603864463, 0.14963565479355076, 0.32646574149583724, 0.1110210424451577, 0.00501257750707177, 0.13948269448867376, 0.14760031592059922, 0.1351282581671622, 0.08126736612437846, -0.2261743414686522, 0.1092923291585316, 0.08537059633961909] |
1,802.09579 | An adaptive timestepping methodology for particle advance in coupled
CFD-DEM simulations | An adpative integration technique for time advancement of particle motion in
the context of coupled computational fluid dynamics (CFD) - discrete element
method (DEM) simulations is presented in this work. CFD-DEM models provide an
accurate description of multiphase physical systems where a granular phase
exists in an underlying continuous medium. The time integration of the granular
phase in these simulations present unique computational challenges due to large
variations in time scales associated with particle collisions. The algorithm
presented in this work uses a local time stepping approach to resolve
collisional time scales for only a subset of particles that are in close
proximity to potential collision partners, thereby resulting in substantial
reduction of computational cost. This approach is observed to be 2-3X faster
than traditional explicit methods for problems that involve both dense and
dilute regions, while maintaining the same level of accuracy.
| physics.comp-ph physics.flu-dyn | an adpative integration technique for time advancement of particle motion in the context of coupled computational fluid dynamics cfd discrete element method dem simulations is presented in this work cfddem models provide an accurate description of multiphase physical systems where a granular phase exists in an underlying continuous medium the time integration of the granular phase in these simulations present unique computational challenges due to large variations in time scales associated with particle collisions the algorithm presented in this work uses a local time stepping approach to resolve collisional time scales for only a subset of particles that are in close proximity to potential collision partners thereby resulting in substantial reduction of computational cost this approach is observed to be 23x faster than traditional explicit methods for problems that involve both dense and dilute regions while maintaining the same level of accuracy | [['an', 'adpative', 'integration', 'technique', 'for', 'time', 'advancement', 'of', 'particle', 'motion', 'in', 'the', 'context', 'of', 'coupled', 'computational', 'fluid', 'dynamics', 'cfd', 'discrete', 'element', 'method', 'dem', 'simulations', 'is', 'presented', 'in', 'this', 'work', 'cfddem', 'models', 'provide', 'an', 'accurate', 'description', 'of', 'multiphase', 'physical', 'systems', 'where', 'a', 'granular', 'phase', 'exists', 'in', 'an', 'underlying', 'continuous', 'medium', 'the', 'time', 'integration', 'of', 'the', 'granular', 'phase', 'in', 'these', 'simulations', 'present', 'unique', 'computational', 'challenges', 'due', 'to', 'large', 'variations', 'in', 'time', 'scales', 'associated', 'with', 'particle', 'collisions', 'the', 'algorithm', 'presented', 'in', 'this', 'work', 'uses', 'a', 'local', 'time', 'stepping', 'approach', 'to', 'resolve', 'collisional', 'time', 'scales', 'for', 'only', 'a', 'subset', 'of', 'particles', 'that', 'are', 'in', 'close', 'proximity', 'to', 'potential', 'collision', 'partners', 'thereby', 'resulting', 'in', 'substantial', 'reduction', 'of', 'computational', 'cost', 'this', 'approach', 'is', 'observed', 'to', 'be', '23x', 'faster', 'than', 'traditional', 'explicit', 'methods', 'for', 'problems', 'that', 'involve', 'both', 'dense', 'and', 'dilute', 'regions', 'while', 'maintaining', 'the', 'same', 'level', 'of', 'accuracy']] | [-0.09787286598076846, 0.09290280680497034, -0.09154675415789722, 0.029277574220599595, -0.029110751316241974, -0.10073821079184084, 0.009260659183685979, 0.3743997114571802, -0.28235859407032743, -0.33556472631220885, 0.06478814541235077, -0.2239813389857663, -0.08610299907307675, 0.19661327828124747, -0.046878614205312225, 0.08499195521155782, 0.10366518976140424, -0.02785275497862653, -0.044080857683306704, -0.21858641343746096, 0.22750711672301965, 0.09882820178325294, 0.25472038536471253, 0.039403902663988, 0.1258940548794542, -0.05738176733704535, -0.046767170712721684, 0.04736053926460709, -0.09959612634573346, 0.09766420275356838, 0.26821589063975737, 0.05579874573394339, 0.3072787705174786, -0.487169780497644, -0.25433812921054344, 0.08911305930670219, 0.1684244155243092, 0.1209290688956513, -0.0875223303075008, -0.23307785930785727, 0.05437090187762857, -0.15398991928297154, -0.14747410179082807, -0.08356710712108364, 0.0390553011935442, 0.0127438218758032, -0.25353494409722743, 0.13312892178535884, 0.02297279213353701, 0.05377042163097372, -0.04388679169838363, -0.06011110809400466, 0.040930919807424096, 0.10807989491314911, 0.015721676504596115, 0.04347268077615048, 0.12558858780229978, -0.14906162752006996, -0.11507970844692689, 0.4450026675662462, -0.035697814003347275, -0.21359807735223138, 0.26564914555163355, -0.10825649692168367, -0.13376972913174023, 0.22282108508796822, 0.23356141105743375, 0.11706530225152771, -0.1461527946253195, 0.07137606577602618, 0.004123805870189734, 0.20764473181693477, 0.02109484100080234, 0.02178209368800018, 0.1467878110442601, 0.2585093474481255, 0.06865513248778615, 0.08663217019180748, -0.062493770622321344, -0.17226628709505212, -0.27225020838280517, -0.18447413799550685, -0.17487730576610522, -0.044609579277482436, -0.10794499676527228, -0.15317312243075856, 0.34416217623767276, 0.19133660737887448, 0.1786167725114852, 0.05552084322899897, 0.34239860892820945, 0.10117693851843926, 0.030864328013878343, 0.09300245727736053, 0.19365575499436322, 0.07628610124151018, 0.1436606015669882, -0.25472866777158903, 0.04670690968368493, 0.07295004280402939] |
1,802.0958 | Lossy Compression of Decimated Gaussian Random Walks | We consider the problem of estimating a Gaussian random walk from a lossy
compression of its decimated version. Hence, the encoder operates on the
decimated random walk, and the decoder estimates the original random walk from
its encoded version under a mean squared error (MSE) criterion. It is
well-known that the minimal distortion in this problem is attained by an
estimate-and-compress (EC) source coding strategy, in which the encoder first
estimates the original random walk and then compresses this estimate subject to
the bit constraint. In this work, we derive a closed-form expression for this
minimal distortion as a function of the bitrate and the decimation factor.
Next, we consider a compress-and-estimate (CE) source coding scheme, in which
the encoder first compresses the decimated sequence subject to an MSE criterion
(with respect to the decimated sequence), and the original random walk is
estimated only at the decoder. We evaluate the distortion under CE in a closed
form and show that there exists a nonzero gap between the distortion under the
two schemes. This difference in performance illustrates the importance of
having the decimation factor at the encoder.
| eess.SP | we consider the problem of estimating a gaussian random walk from a lossy compression of its decimated version hence the encoder operates on the decimated random walk and the decoder estimates the original random walk from its encoded version under a mean squared error mse criterion it is wellknown that the minimal distortion in this problem is attained by an estimateandcompress ec source coding strategy in which the encoder first estimates the original random walk and then compresses this estimate subject to the bit constraint in this work we derive a closedform expression for this minimal distortion as a function of the bitrate and the decimation factor next we consider a compressandestimate ce source coding scheme in which the encoder first compresses the decimated sequence subject to an mse criterion with respect to the decimated sequence and the original random walk is estimated only at the decoder we evaluate the distortion under ce in a closed form and show that there exists a nonzero gap between the distortion under the two schemes this difference in performance illustrates the importance of having the decimation factor at the encoder | [['we', 'consider', 'the', 'problem', 'of', 'estimating', 'a', 'gaussian', 'random', 'walk', 'from', 'a', 'lossy', 'compression', 'of', 'its', 'decimated', 'version', 'hence', 'the', 'encoder', 'operates', 'on', 'the', 'decimated', 'random', 'walk', 'and', 'the', 'decoder', 'estimates', 'the', 'original', 'random', 'walk', 'from', 'its', 'encoded', 'version', 'under', 'a', 'mean', 'squared', 'error', 'mse', 'criterion', 'it', 'is', 'wellknown', 'that', 'the', 'minimal', 'distortion', 'in', 'this', 'problem', 'is', 'attained', 'by', 'an', 'estimateandcompress', 'ec', 'source', 'coding', 'strategy', 'in', 'which', 'the', 'encoder', 'first', 'estimates', 'the', 'original', 'random', 'walk', 'and', 'then', 'compresses', 'this', 'estimate', 'subject', 'to', 'the', 'bit', 'constraint', 'in', 'this', 'work', 'we', 'derive', 'a', 'closedform', 'expression', 'for', 'this', 'minimal', 'distortion', 'as', 'a', 'function', 'of', 'the', 'bitrate', 'and', 'the', 'decimation', 'factor', 'next', 'we', 'consider', 'a', 'compressandestimate', 'ce', 'source', 'coding', 'scheme', 'in', 'which', 'the', 'encoder', 'first', 'compresses', 'the', 'decimated', 'sequence', 'subject', 'to', 'an', 'mse', 'criterion', 'with', 'respect', 'to', 'the', 'decimated', 'sequence', 'and', 'the', 'original', 'random', 'walk', 'is', 'estimated', 'only', 'at', 'the', 'decoder', 'we', 'evaluate', 'the', 'distortion', 'under', 'ce', 'in', 'a', 'closed', 'form', 'and', 'show', 'that', 'there', 'exists', 'a', 'nonzero', 'gap', 'between', 'the', 'distortion', 'under', 'the', 'two', 'schemes', 'this', 'difference', 'in', 'performance', 'illustrates', 'the', 'importance', 'of', 'having', 'the', 'decimation', 'factor', 'at', 'the', 'encoder']] | [-0.1277634262075849, 0.0647470662692826, -0.08294481804147615, 0.0650931525811855, -0.007813125302798015, -0.18262448460870498, 0.10173204459778562, 0.40456214654385236, -0.33059133281805425, -0.19791988574780173, 0.12802279093806204, -0.2413153661213614, -0.1851525111844436, 0.12998056858400436, -0.12527949965584118, 0.055078938221433074, 0.056061729243830655, 0.11131279940742093, -0.10075886870256147, -0.29767828514497424, 0.2598158842003023, 0.10194440476495673, 0.31547310371707016, -0.021878908753609032, 0.1576665710757732, 0.039304640529224194, 0.0012951654293951956, -0.0503027661275622, -0.13945938116230536, 0.09608652057075823, 0.16219231201637838, 0.130237693961307, 0.3181427182075945, -0.33083736690994653, -0.2187101829494979, 0.09895048054891664, 0.10890132311630893, 0.13231660996412709, -0.04725465369096177, -0.2625870805435084, 0.11669465664623155, -0.13496007058215706, 0.002761896012501942, 0.0436384270219384, -0.05650230933081459, -0.006950742656969138, -0.3466871580587247, 0.06693011344838384, 0.10708526725301871, 0.002330933218016415, -0.048386014712269644, -0.10613300872312205, 0.03658588453623894, 0.13496305742175194, 0.028143510323118518, 0.10098872373283312, 0.06357279202925997, -0.08384482456663013, -0.07865433459472214, 0.3623190202901291, -0.08316945313048121, -0.25567488183040876, 0.0891822483384277, -0.09836551511559535, -0.11468474986786778, 0.1345873029600527, 0.1908577524931044, 0.0559483620111604, -0.15280911059093635, 0.06528984704778555, -0.051820201200206535, 0.18278155888405603, 0.08819739160102767, 0.05613460887122799, 0.1471932481911436, 0.1312395335278927, 0.12605177628228792, 0.2499682694874905, -0.11732375373673701, -0.09783308202954563, -0.2969969330122694, -0.11473427865704572, -0.26852769608785576, 0.030950319291268652, -0.15115084521735175, -0.19338059712805458, 0.38704450926183004, 0.1371294029975763, 0.20030815410050187, 0.13680127766612615, 0.3324950450546788, 0.14311782862626116, 0.023225211276911902, 0.15282779483728715, 0.16015982555879935, 0.1435633163005617, 0.042745074169156516, -0.1889313533298067, 0.09994569296092802, 0.12518028765916825] |
1,802.09581 | The overlooked role of stellar variability in LMC intermediate-age
clusters | Broad, extended main sequence turnoffs seen in the majority of the
intermediate-age (1-3 Gyr) LMC star clusters, have been interpreted as the
result of an extended star formation history and/or the effect of extreme
stellar rotation. A more fundamental explanation may be given by stellar
variability. For clusters in these age range, the instability strip crosses the
upper main sequence producing a number of variable stars (known as Delta Scuti)
which, if nor properly taken into account, could appear as an extended turnoff.
First results of a variability program in the LMC cluster NGC 1846 reveals a
sizeable number of this type of variables, although still too low to produce a
meaningful broadening, with the caveat that the true variable content of the
center of this and other clusters in the LMC will only be revealed with a
dedicated HST program.
| astro-ph.SR astro-ph.GA | broad extended main sequence turnoffs seen in the majority of the intermediateage 13 gyr lmc star clusters have been interpreted as the result of an extended star formation history andor the effect of extreme stellar rotation a more fundamental explanation may be given by stellar variability for clusters in these age range the instability strip crosses the upper main sequence producing a number of variable stars known as delta scuti which if nor properly taken into account could appear as an extended turnoff first results of a variability program in the lmc cluster ngc 1846 reveals a sizeable number of this type of variables although still too low to produce a meaningful broadening with the caveat that the true variable content of the center of this and other clusters in the lmc will only be revealed with a dedicated hst program | [['broad', 'extended', 'main', 'sequence', 'turnoffs', 'seen', 'in', 'the', 'majority', 'of', 'the', 'intermediateage', '13', 'gyr', 'lmc', 'star', 'clusters', 'have', 'been', 'interpreted', 'as', 'the', 'result', 'of', 'an', 'extended', 'star', 'formation', 'history', 'andor', 'the', 'effect', 'of', 'extreme', 'stellar', 'rotation', 'a', 'more', 'fundamental', 'explanation', 'may', 'be', 'given', 'by', 'stellar', 'variability', 'for', 'clusters', 'in', 'these', 'age', 'range', 'the', 'instability', 'strip', 'crosses', 'the', 'upper', 'main', 'sequence', 'producing', 'a', 'number', 'of', 'variable', 'stars', 'known', 'as', 'delta', 'scuti', 'which', 'if', 'nor', 'properly', 'taken', 'into', 'account', 'could', 'appear', 'as', 'an', 'extended', 'turnoff', 'first', 'results', 'of', 'a', 'variability', 'program', 'in', 'the', 'lmc', 'cluster', 'ngc', '1846', 'reveals', 'a', 'sizeable', 'number', 'of', 'this', 'type', 'of', 'variables', 'although', 'still', 'too', 'low', 'to', 'produce', 'a', 'meaningful', 'broadening', 'with', 'the', 'caveat', 'that', 'the', 'true', 'variable', 'content', 'of', 'the', 'center', 'of', 'this', 'and', 'other', 'clusters', 'in', 'the', 'lmc', 'will', 'only', 'be', 'revealed', 'with', 'a', 'dedicated', 'hst', 'program']] | [-0.08107020413248754, 0.11776896945802752, -0.12086578835369953, 0.1355479902023093, -0.11652134426585431, -0.061315300370771306, 0.08594079655330919, 0.3814764194890645, -0.217785542573225, -0.381534870647898, 0.07633036448692916, -0.2023128321632109, -0.04097876272821495, 0.20941052440527483, -0.10085907275623358, -0.06749272991652132, 0.12128644544839304, -0.011264301532654897, 0.012838286702712694, -0.2939934292841201, 0.2719256771193381, 0.0021628973946133828, 0.1142168008781811, -0.03962224842452094, 0.02183751462040641, -0.06961719044781428, -0.06389984488652371, 0.011383839415597683, -0.0914460802511151, 0.041729408412088526, 0.25808398134953586, 0.13105095598470182, 0.27637781005960405, -0.34109899766597873, -0.23671885174269794, 0.08528743663733389, 0.26435870293475, 0.04012836895945832, -0.08821152870806268, -0.2668245670663074, 0.06138643276950358, -0.18536847762033634, -0.19687155446579271, 0.0712955070276421, 0.0721823960073715, 0.03396934261941846, -0.21451379027191206, 0.11715138624075483, 0.0688589488532632, 0.0849364381066791, -0.11183256832618557, -0.15564192392605733, -0.057137606974281635, 0.11760443542813155, 0.027161380705417047, 0.1098617653045407, 0.0904703274887742, -0.11741460115708252, -0.03809342325949077, 0.3895892253317309, -0.06377142904729233, -0.01786424893991533, 0.20743254099184885, -0.20511595641282646, -0.22009322203692472, 0.11660891400108524, 0.12826634605715698, 0.11639336319863201, -0.1822363034366293, 0.006814283957657014, -0.025781519810094477, 0.2368860413322014, 0.04546689569160792, 0.07841885210417793, 0.3130374403062759, 0.1383908896340414, 0.03514650800423895, 0.12602799854130675, -0.1872788131871122, -0.07475776642689759, -0.27345994544043767, -0.08981585754362324, -0.11122957712158243, 0.07126054180297234, -0.13590449608640714, -0.17239845840669904, 0.31461544939257363, 0.08020200272972518, 0.2342941792721444, -0.0068691583203336765, 0.24602535115687033, 0.10233854784891142, 0.15681493327232962, 0.0862712742205947, 0.2542411118666542, 0.1941035028163848, 0.07529077915217172, -0.231937905165849, 0.13375405315598737, -0.016421089987501712] |
1,802.09582 | A graph-theoretic framework for algorithmic design of experiments | In this paper, we demonstrate that considering experiments in a
graph-theoretic manner allows us to exploit automorphisms of the graph to
reduce the number of evaluations of candidate designs for those experiments,
and thus find optimal designs faster. We show that the use of automorphisms for
reducing the number of evaluations required of an optimality criterion function
is effective on designs where experimental units have a network structure.
Moreover, we show that we can take block designs with no apparent network
structure, such as one-way blocked experiments, row-column experiments, and
crossover designs, and add block nodes to induce a network structure.
Considering automorphisms can thus reduce the amount of time it takes to find
optimal designs for a wide class of experiments.
| stat.ME | in this paper we demonstrate that considering experiments in a graphtheoretic manner allows us to exploit automorphisms of the graph to reduce the number of evaluations of candidate designs for those experiments and thus find optimal designs faster we show that the use of automorphisms for reducing the number of evaluations required of an optimality criterion function is effective on designs where experimental units have a network structure moreover we show that we can take block designs with no apparent network structure such as oneway blocked experiments rowcolumn experiments and crossover designs and add block nodes to induce a network structure considering automorphisms can thus reduce the amount of time it takes to find optimal designs for a wide class of experiments | [['in', 'this', 'paper', 'we', 'demonstrate', 'that', 'considering', 'experiments', 'in', 'a', 'graphtheoretic', 'manner', 'allows', 'us', 'to', 'exploit', 'automorphisms', 'of', 'the', 'graph', 'to', 'reduce', 'the', 'number', 'of', 'evaluations', 'of', 'candidate', 'designs', 'for', 'those', 'experiments', 'and', 'thus', 'find', 'optimal', 'designs', 'faster', 'we', 'show', 'that', 'the', 'use', 'of', 'automorphisms', 'for', 'reducing', 'the', 'number', 'of', 'evaluations', 'required', 'of', 'an', 'optimality', 'criterion', 'function', 'is', 'effective', 'on', 'designs', 'where', 'experimental', 'units', 'have', 'a', 'network', 'structure', 'moreover', 'we', 'show', 'that', 'we', 'can', 'take', 'block', 'designs', 'with', 'no', 'apparent', 'network', 'structure', 'such', 'as', 'oneway', 'blocked', 'experiments', 'rowcolumn', 'experiments', 'and', 'crossover', 'designs', 'and', 'add', 'block', 'nodes', 'to', 'induce', 'a', 'network', 'structure', 'considering', 'automorphisms', 'can', 'thus', 'reduce', 'the', 'amount', 'of', 'time', 'it', 'takes', 'to', 'find', 'optimal', 'designs', 'for', 'a', 'wide', 'class', 'of', 'experiments']] | [-0.1410014194123386, 0.05312833514126098, -0.051161185597817675, 0.017215266693994157, -0.09870054942296176, -0.12848191102203288, 0.09979670720850499, 0.4142121177655263, -0.2664701037383715, -0.32837476585915343, 0.09656419794621007, -0.2567164466992358, -0.23409375436813953, 0.21882415211713704, -0.07427217982724675, 0.05942614103636903, 0.09653378841390864, 0.02130807681604609, -0.09893568994507926, -0.26676522196794394, 0.29053697785976046, 0.08824819315904293, 0.29857690800286707, 0.04146415258177602, 0.10744376378280605, -0.0058375341955144875, -0.005344892269216066, 0.055388066728482954, -0.12665108116394908, 0.08726390977924475, 0.28208229102988225, 0.17103176147173174, 0.2689488124403889, -0.4589169104659899, -0.20631215921875096, 0.1485334810968794, 0.13249139998825726, 0.11956913550918707, -0.04136713283216642, -0.21426639776890638, 0.12997114194984563, -0.17405205316551517, -0.0663596462061415, -0.13688877335850713, -0.027928845231711377, 0.005572757989046027, -0.3401129690154463, -0.01932121640702015, 0.052481888110184526, 0.015301255131384632, -0.011430243908553614, -0.10596991745663471, 0.019220274468486915, 0.15127140792185959, 0.006052533674175988, -0.02692579643964981, 0.1293314779329984, -0.09980910785732883, -0.15659750223190325, 0.3542878310516721, -0.015174647922948247, -0.21364456977023452, 0.16213386651265937, -0.08624259234009096, -0.12408192693179504, 0.09610784109529169, 0.21878782788780135, 0.09004309558172206, -0.0839046664535045, 0.0424429774689908, -0.09254719930716225, 0.17628577710358334, 0.060029508874247794, 0.04749368832610761, 0.1280723536753508, 0.18821151951159976, 0.1381587949657782, 0.19859290055808473, -0.06463448519505499, -0.06786885740403391, -0.2805786437782474, -0.17302998279786255, -0.16278778007072703, 0.0029345366679901087, -0.09133797346532715, -0.13021096110450806, 0.4025929473554257, 0.19388146088534935, 0.21633323091158613, 0.11384039362663495, 0.2584002699672443, 0.04397124798155436, 0.1589864053702379, 0.09062428743822774, 0.1758701035478076, 0.07901342274415017, 0.006660154039711982, -0.21356485442441628, 0.07425610906421588, 0.03554672023021906] |
1,802.09583 | Data-dependent PAC-Bayes priors via differential privacy | The Probably Approximately Correct (PAC) Bayes framework (McAllester, 1999)
can incorporate knowledge about the learning algorithm and (data) distribution
through the use of distribution-dependent priors, yielding tighter
generalization bounds on data-dependent posteriors. Using this flexibility,
however, is difficult, especially when the data distribution is presumed to be
unknown. We show how an {\epsilon}-differentially private data-dependent prior
yields a valid PAC-Bayes bound, and then show how non-private mechanisms for
choosing priors can also yield generalization bounds. As an application of this
result, we show that a Gaussian prior mean chosen via stochastic gradient
Langevin dynamics (SGLD; Welling and Teh, 2011) leads to a valid PAC-Bayes
bound given control of the 2-Wasserstein distance to an
{\epsilon}-differentially private stationary distribution. We study our
data-dependent bounds empirically, and show that they can be nonvacuous even
when other distribution-dependent bounds are vacuous.
| cs.LG stat.ML | the probably approximately correct pac bayes framework mcallester 1999 can incorporate knowledge about the learning algorithm and data distribution through the use of distributiondependent priors yielding tighter generalization bounds on datadependent posteriors using this flexibility however is difficult especially when the data distribution is presumed to be unknown we show how an epsilondifferentially private datadependent prior yields a valid pacbayes bound and then show how nonprivate mechanisms for choosing priors can also yield generalization bounds as an application of this result we show that a gaussian prior mean chosen via stochastic gradient langevin dynamics sgld welling and teh 2011 leads to a valid pacbayes bound given control of the 2wasserstein distance to an epsilondifferentially private stationary distribution we study our datadependent bounds empirically and show that they can be nonvacuous even when other distributiondependent bounds are vacuous | [['the', 'probably', 'approximately', 'correct', 'pac', 'bayes', 'framework', 'mcallester', '1999', 'can', 'incorporate', 'knowledge', 'about', 'the', 'learning', 'algorithm', 'and', 'data', 'distribution', 'through', 'the', 'use', 'of', 'distributiondependent', 'priors', 'yielding', 'tighter', 'generalization', 'bounds', 'on', 'datadependent', 'posteriors', 'using', 'this', 'flexibility', 'however', 'is', 'difficult', 'especially', 'when', 'the', 'data', 'distribution', 'is', 'presumed', 'to', 'be', 'unknown', 'we', 'show', 'how', 'an', 'epsilondifferentially', 'private', 'datadependent', 'prior', 'yields', 'a', 'valid', 'pacbayes', 'bound', 'and', 'then', 'show', 'how', 'nonprivate', 'mechanisms', 'for', 'choosing', 'priors', 'can', 'also', 'yield', 'generalization', 'bounds', 'as', 'an', 'application', 'of', 'this', 'result', 'we', 'show', 'that', 'a', 'gaussian', 'prior', 'mean', 'chosen', 'via', 'stochastic', 'gradient', 'langevin', 'dynamics', 'sgld', 'welling', 'and', 'teh', '2011', 'leads', 'to', 'a', 'valid', 'pacbayes', 'bound', 'given', 'control', 'of', 'the', '2wasserstein', 'distance', 'to', 'an', 'epsilondifferentially', 'private', 'stationary', 'distribution', 'we', 'study', 'our', 'datadependent', 'bounds', 'empirically', 'and', 'show', 'that', 'they', 'can', 'be', 'nonvacuous', 'even', 'when', 'other', 'distributiondependent', 'bounds', 'are', 'vacuous']] | [-0.021978438191581517, 0.051694621856602244, -0.17515959702160236, 0.1705621413097982, -0.12650216385266697, -0.16912442328999786, 0.11621233079001225, 0.39643615491035644, -0.2916424911006959, -0.352633634820091, 0.0931255054782505, -0.20795296135623634, -0.1678121666811461, 0.2115973015179871, -0.16865980437528477, 0.07607697339619707, 0.06743967277847611, 0.023983538487287116, -0.05900259921412208, -0.32386098880266406, 0.26609765548925224, 0.11015123898421761, 0.30506921982746166, 0.02915795359430821, 0.09928979663973687, 0.00040341504462008927, 0.005001908897651261, -0.029707677478827264, -0.17133551555310536, 0.1409393308385119, 0.23929659830046016, 0.21938150453238484, 0.30481024589525524, -0.3677160138345874, -0.1810610269869331, 0.13769275118277347, 0.14940174162556946, 0.12034146873497942, -0.026209296778449447, -0.29301485585143966, 0.04937321097882342, -0.1478835550157258, -0.056365415233189074, -0.17212442351491564, -0.056381004349240205, 0.00617130365083334, -0.39252205062521633, 0.08769906751185241, 0.14050956521128868, -0.021288472014253306, -0.05152048474436041, -0.17474036301778506, 0.04368846802496399, 0.08373531833653046, 0.042655764968494755, 0.028667448895786256, 0.1206693417990893, -0.09056640135287478, -0.1282986725270952, 0.2793079205265228, -0.11444252299613925, -0.2438458713573696, 0.13018121795361712, -0.06389124599713696, -0.12451163013159794, 0.06956912521408858, 0.22590056332983893, 0.13705675972686795, -0.19440065765941184, 0.08191465904059256, -0.0894817589326714, 0.16158055886116396, 0.06241655884732077, 0.006812069639835479, 0.09078811746206217, 0.10080252019484548, 0.1364976927930367, 0.14300543320727244, -0.08322089703168965, -0.13342539765566153, -0.2768429627550263, -0.08704477918759604, -0.21913087533202266, 0.02842133528940434, -0.17834182364347154, -0.13456677589361576, 0.267404143149577, 0.19650107921597404, 0.22834712830474124, 0.16235648410354, 0.29140561277957727, 0.10866238366826063, -0.013227821320947939, 0.18835471871302184, 0.22550149159981822, 0.10143961849873953, -0.0014639482799455197, -0.1368412039987063, 0.18722196474304273, 0.008823236012083553] |
1,802.09584 | Magnetic field dependence of electronic properties of MoS$_2$ quantum
dots with different edges | Using the tight-binding approach, we investigate the energy spectrum of
square, triangular and hexagonal MoS$_2$ quantum dots (QDs) in the presence of
a perpendicular magnetic field. Novel edge states emerge in MoS$_2$ QDs, which
are distributed over the whole edge which we call ring states. The ring states
are robust in the presence of spin-orbit coupling (SOC). The corresponding
energy levels of the ring states oscillate as function of the perpendicular
magnetic field which are related to Aharonov-Bohm oscillations. Oscillations in
the magnetic field dependence of the energy levels and the peaks in the
magneto-optical spectrum emerge (disappear) as the ring states are formed
(collapsed). The period and the amplitude of the oscillation decreases with the
size of the MoS$_2$ QDs.
| cond-mat.mes-hall | using the tightbinding approach we investigate the energy spectrum of square triangular and hexagonal mos_2 quantum dots qds in the presence of a perpendicular magnetic field novel edge states emerge in mos_2 qds which are distributed over the whole edge which we call ring states the ring states are robust in the presence of spinorbit coupling soc the corresponding energy levels of the ring states oscillate as function of the perpendicular magnetic field which are related to aharonovbohm oscillations oscillations in the magnetic field dependence of the energy levels and the peaks in the magnetooptical spectrum emerge disappear as the ring states are formed collapsed the period and the amplitude of the oscillation decreases with the size of the mos_2 qds | [['using', 'the', 'tightbinding', 'approach', 'we', 'investigate', 'the', 'energy', 'spectrum', 'of', 'square', 'triangular', 'and', 'hexagonal', 'mos_2', 'quantum', 'dots', 'qds', 'in', 'the', 'presence', 'of', 'a', 'perpendicular', 'magnetic', 'field', 'novel', 'edge', 'states', 'emerge', 'in', 'mos_2', 'qds', 'which', 'are', 'distributed', 'over', 'the', 'whole', 'edge', 'which', 'we', 'call', 'ring', 'states', 'the', 'ring', 'states', 'are', 'robust', 'in', 'the', 'presence', 'of', 'spinorbit', 'coupling', 'soc', 'the', 'corresponding', 'energy', 'levels', 'of', 'the', 'ring', 'states', 'oscillate', 'as', 'function', 'of', 'the', 'perpendicular', 'magnetic', 'field', 'which', 'are', 'related', 'to', 'aharonovbohm', 'oscillations', 'oscillations', 'in', 'the', 'magnetic', 'field', 'dependence', 'of', 'the', 'energy', 'levels', 'and', 'the', 'peaks', 'in', 'the', 'magnetooptical', 'spectrum', 'emerge', 'disappear', 'as', 'the', 'ring', 'states', 'are', 'formed', 'collapsed', 'the', 'period', 'and', 'the', 'amplitude', 'of', 'the', 'oscillation', 'decreases', 'with', 'the', 'size', 'of', 'the', 'mos_2', 'qds']] | [-0.2532852598935489, 0.21212215327045858, -0.014477729050044262, 0.023898214328849365, 0.032121007496198596, -0.13402165314336575, 0.008107036157811352, 0.36793389580835983, -0.29901113521215344, -0.2944535222366329, 0.00021325779043538266, -0.2833253687694053, -0.1041797373505417, 0.14786238496553553, 0.059821107316077184, -0.022612692892151183, 0.005183164982802488, -0.001159901045693839, -0.0481901330303801, -0.1834466224382362, 0.31221220763842766, 0.04008686311123508, 0.3241348223075702, 0.05662958310293573, -0.02216457053711099, -0.0025125814617172745, 0.1417124248790451, 0.033357224538768375, -0.12899475928212223, 0.05950673196555215, 0.1834290757340433, -0.0920949442204365, 0.21248550877005848, -0.484066668005029, -0.13222767765372068, 0.0524412717878018, 0.15461457347543525, 0.150031423707077, -0.029196104535078708, -0.304142891554439, 0.033945174910867015, -0.12274640475299732, -0.1290805724416744, -0.030858783828756533, 0.004919674623688329, 0.034958384346124555, -0.25035894511282936, 0.12560690753161907, 0.033506503813584484, 0.07236603851052971, -0.10606505365826743, -0.104908051650417, -0.09916670348741545, 0.08528439005959995, 0.029450572661532105, 0.012014525811657432, 0.21751875139788285, -0.10638561593907431, -0.13596428749113043, 0.34380765530196106, -0.07835717272775417, -0.09497234752509466, 0.09520696744723015, -0.20065579209322773, -0.040094472033987666, 0.1475484166448274, 0.14615311686811613, 0.08877983987947141, -0.044600591551770326, 0.13038360315022898, -0.04720442907592236, 0.1350711341562473, 0.07280534822955605, 0.15658276147124442, 0.2909615132957697, 0.12294067767417936, 0.07028447532129652, 0.15629518882579302, -0.17658538785416725, -0.08771805151188669, -0.23906573944163223, -0.14636516761157878, -0.23788232856991987, 0.07147158598065499, -0.050957090526935644, -0.2330257994900188, 0.5114479991030102, 0.0940947162048999, 0.20657518931302774, -0.06255666728897313, 0.23983595735770613, 0.16147723635235292, 0.1192342802139686, 0.056332941015043166, 0.27079648675381646, 0.21463059768858098, 0.08881813858362485, -0.287312425927005, -0.0347818654061349, -0.045108754191670784] |
1,802.09585 | A partial correlation vine based approach for modeling and forecasting
multivariate volatility time-series | A novel approach for dynamic modeling and forecasting of realized covariance
matrices is proposed. Realized variances and realized correlation matrices are
jointly estimated. The one-to-one relationship between a positive definite
correlation matrix and its associated set of partial correlations corresponding
to any vine specification is used for data transformation. The model components
therefore are realized variances as well as realized standard and partial
correlations corresponding to a daily log-return series. As such, they have a
clear practical interpretation. A method to select a regular vine structure,
which allows for parsimonious time-series and dependence modeling of the model
components, is introduced. Being algebraically independent the latter do not
underlie any algebraic constraint. The proposed model approach is outlined in
detail and motivated along with a real data example on six highly liquid
stocks. The forecasting performance is evaluated both with respect to
statistical precision and in the context of portfolio optimization. Comparisons
with Cholesky decomposition based benchmark models support the excellent
prediction ability of the proposed model approach.
| stat.ME | a novel approach for dynamic modeling and forecasting of realized covariance matrices is proposed realized variances and realized correlation matrices are jointly estimated the onetoone relationship between a positive definite correlation matrix and its associated set of partial correlations corresponding to any vine specification is used for data transformation the model components therefore are realized variances as well as realized standard and partial correlations corresponding to a daily logreturn series as such they have a clear practical interpretation a method to select a regular vine structure which allows for parsimonious timeseries and dependence modeling of the model components is introduced being algebraically independent the latter do not underlie any algebraic constraint the proposed model approach is outlined in detail and motivated along with a real data example on six highly liquid stocks the forecasting performance is evaluated both with respect to statistical precision and in the context of portfolio optimization comparisons with cholesky decomposition based benchmark models support the excellent prediction ability of the proposed model approach | [['a', 'novel', 'approach', 'for', 'dynamic', 'modeling', 'and', 'forecasting', 'of', 'realized', 'covariance', 'matrices', 'is', 'proposed', 'realized', 'variances', 'and', 'realized', 'correlation', 'matrices', 'are', 'jointly', 'estimated', 'the', 'onetoone', 'relationship', 'between', 'a', 'positive', 'definite', 'correlation', 'matrix', 'and', 'its', 'associated', 'set', 'of', 'partial', 'correlations', 'corresponding', 'to', 'any', 'vine', 'specification', 'is', 'used', 'for', 'data', 'transformation', 'the', 'model', 'components', 'therefore', 'are', 'realized', 'variances', 'as', 'well', 'as', 'realized', 'standard', 'and', 'partial', 'correlations', 'corresponding', 'to', 'a', 'daily', 'logreturn', 'series', 'as', 'such', 'they', 'have', 'a', 'clear', 'practical', 'interpretation', 'a', 'method', 'to', 'select', 'a', 'regular', 'vine', 'structure', 'which', 'allows', 'for', 'parsimonious', 'timeseries', 'and', 'dependence', 'modeling', 'of', 'the', 'model', 'components', 'is', 'introduced', 'being', 'algebraically', 'independent', 'the', 'latter', 'do', 'not', 'underlie', 'any', 'algebraic', 'constraint', 'the', 'proposed', 'model', 'approach', 'is', 'outlined', 'in', 'detail', 'and', 'motivated', 'along', 'with', 'a', 'real', 'data', 'example', 'on', 'six', 'highly', 'liquid', 'stocks', 'the', 'forecasting', 'performance', 'is', 'evaluated', 'both', 'with', 'respect', 'to', 'statistical', 'precision', 'and', 'in', 'the', 'context', 'of', 'portfolio', 'optimization', 'comparisons', 'with', 'cholesky', 'decomposition', 'based', 'benchmark', 'models', 'support', 'the', 'excellent', 'prediction', 'ability', 'of', 'the', 'proposed', 'model', 'approach']] | [-0.0662489865716926, 0.031051377127292806, -0.09675721896946163, 0.1160134435247931, -0.08794956255570321, -0.17535659716559385, 0.011208859123122281, 0.40888456221736835, -0.2554823195707809, -0.3017454261652439, 0.13165157881821923, -0.26221026140162346, -0.1698989476172064, 0.19369684500009113, -0.03832035736197572, 0.09953878375438104, 0.06020015015540098, 0.020622156170046257, -0.0994283696845687, -0.22430254718913378, 0.25882206189105966, 0.06753852779692608, 0.34058556028273695, -0.005430643641930855, 0.16012010554236522, 0.006680227874661098, -0.07710521150286961, 0.04449310297324897, -0.04588144509160813, 0.14093923240392553, 0.2667501910326176, 0.1496541355279519, 0.2537274313574757, -0.39042399175643566, -0.2173841220137111, 0.1270926398877612, 0.1146989765710861, 0.01955158634510025, -0.005307996386946541, -0.27885824929878206, 0.044454574880530374, -0.20664063959611123, -0.09285476726471463, -0.14968276695448704, 0.005453118520808367, -0.014350520731486703, -0.3504398736735376, 0.07304168957665763, 0.038193095152679005, 0.06661157892364451, -0.04505391103950256, -0.13923631582205592, -0.022677245226404266, 0.10843433299196695, 0.04213122532613754, -0.012078581713167894, 0.10012212338506016, -0.07359933607492172, -0.13808070284852614, 0.35774790395809686, -0.0656668761796332, -0.26447501594568795, 0.17721792466765615, -0.08789341384544969, -0.12445348064543423, 0.08741137821864808, 0.18730370372444569, 0.06502753711015566, -0.1630138898317836, 0.060768918442737845, -0.05259044814999857, 0.16661762479416647, 0.009470699460965074, -0.010526329139526376, 0.19539275848791895, 0.18612732127598838, 0.019831534591416303, 0.09242468207661887, -0.05633047023616609, -0.1263260131501063, -0.27455756326992353, -0.12221979176239417, -0.1859995358216459, -0.020562013487026937, -0.1315762402785525, -0.18452221915560835, 0.41968607995101437, 0.165455415379256, 0.2100316795916436, 0.07694054010232164, 0.28133219980891283, 0.11913628641156616, 0.05546911578893126, 0.03803180460818112, 0.14582465970777198, 0.15362140980220126, 0.05531765458949223, -0.1796084921779167, 0.13385286850821293, 0.026157901126021395] |
1,802.09586 | Fractal Universality in Near-Threshold Magnetic Lanthanide Dimers | Ergodic quantum systems are often quite alike, whereas nonergodic, fractal
systems are unique and display characteristic properties. We explore one of
these fractal systems, weakly bound dysprosium lanthanide molecules, in an
external magnetic field. As recently shown, colliding ultracold magnetic
dysprosium atoms display a soft chaotic behavior with a small degree of
disorder. We broaden this classification by investigating the generalized
inverse participation ratio and fractal dimensions for large sets of molecular
wave functions. Our exact close-coupling simulations reveal a dynamic phase
transition from partially localized states to totally delocalized states and
universality in its distribution by increasing the magnetic field strength to
only a hundred Gauss (or 10 mT). Finally, we prove the existence of nonergodic
delocalized phase in the system and explain the violation of ergodicity by
strong coupling between near-threshold molecular states and the nearby
continuum.
| cond-mat.dis-nn cond-mat.quant-gas quant-ph | ergodic quantum systems are often quite alike whereas nonergodic fractal systems are unique and display characteristic properties we explore one of these fractal systems weakly bound dysprosium lanthanide molecules in an external magnetic field as recently shown colliding ultracold magnetic dysprosium atoms display a soft chaotic behavior with a small degree of disorder we broaden this classification by investigating the generalized inverse participation ratio and fractal dimensions for large sets of molecular wave functions our exact closecoupling simulations reveal a dynamic phase transition from partially localized states to totally delocalized states and universality in its distribution by increasing the magnetic field strength to only a hundred gauss or 10 mt finally we prove the existence of nonergodic delocalized phase in the system and explain the violation of ergodicity by strong coupling between nearthreshold molecular states and the nearby continuum | [['ergodic', 'quantum', 'systems', 'are', 'often', 'quite', 'alike', 'whereas', 'nonergodic', 'fractal', 'systems', 'are', 'unique', 'and', 'display', 'characteristic', 'properties', 'we', 'explore', 'one', 'of', 'these', 'fractal', 'systems', 'weakly', 'bound', 'dysprosium', 'lanthanide', 'molecules', 'in', 'an', 'external', 'magnetic', 'field', 'as', 'recently', 'shown', 'colliding', 'ultracold', 'magnetic', 'dysprosium', 'atoms', 'display', 'a', 'soft', 'chaotic', 'behavior', 'with', 'a', 'small', 'degree', 'of', 'disorder', 'we', 'broaden', 'this', 'classification', 'by', 'investigating', 'the', 'generalized', 'inverse', 'participation', 'ratio', 'and', 'fractal', 'dimensions', 'for', 'large', 'sets', 'of', 'molecular', 'wave', 'functions', 'our', 'exact', 'closecoupling', 'simulations', 'reveal', 'a', 'dynamic', 'phase', 'transition', 'from', 'partially', 'localized', 'states', 'to', 'totally', 'delocalized', 'states', 'and', 'universality', 'in', 'its', 'distribution', 'by', 'increasing', 'the', 'magnetic', 'field', 'strength', 'to', 'only', 'a', 'hundred', 'gauss', 'or', '10', 'mt', 'finally', 'we', 'prove', 'the', 'existence', 'of', 'nonergodic', 'delocalized', 'phase', 'in', 'the', 'system', 'and', 'explain', 'the', 'violation', 'of', 'ergodicity', 'by', 'strong', 'coupling', 'between', 'nearthreshold', 'molecular', 'states', 'and', 'the', 'nearby', 'continuum']] | [-0.17138976547716306, 0.25558531607374324, -0.03764494266712757, 0.10329518349851287, 0.0323445903415383, -0.15953740341213646, 0.05764582353349266, 0.35404306600580543, -0.26456043293796777, -0.25510536140608164, 0.017142304390578417, -0.28154515434163724, -0.14243094221581604, 0.14716611210116112, 0.058767958748340274, 0.04251619415456536, 0.0045748387501916765, 0.008470248668823096, -0.05109211938328398, -0.1732020451573269, 0.32114894410072686, 0.01783483534073122, 0.281451327111505, 0.08009022474623949, 0.032705275331818155, -0.0445173629375322, 0.08116827656267037, 0.028754174448013734, -0.10283953243223347, 0.09030728616539001, 0.21772218687399525, 0.016255197379898896, 0.21543874666630794, -0.4018224396963986, -0.21163745328998393, 0.08860585201873357, 0.1766859298151509, 0.10733055965572917, -0.04279192376181671, -0.3558670513988506, 0.02736349120441315, -0.12867316770421344, -0.20005500159166056, -0.14050803990471813, 0.03953568804875123, 0.06781832973988687, -0.23838098826583662, 0.11198890683234489, 0.06601000566993633, 0.14236831632208266, -0.06813116944914269, -0.07968926307889332, -0.0011166891990993307, 0.08821740925643701, 0.02986002113107297, 0.008299361187428664, 0.16883204158784137, -0.1199498293609794, -0.11056643204843934, 0.34277691034157926, -0.04392399843623058, -0.1406295136883587, 0.2793620784076855, -0.20434500726958293, -0.1434631680620821, 0.20392771336926724, 0.1631933672465853, 0.09673276269580607, -0.12651183724649612, 0.08048112467123973, -0.04453937373642907, 0.2036099628157572, 0.05241616556534825, 0.09633271705623878, 0.23032291416454015, 0.11728043910350464, 0.03303889131588902, 0.18111620393159578, -0.07361214425709607, -0.14696005098655712, -0.21566381521871408, -0.14663105405885526, -0.22220735091015884, 0.08842810015594034, -0.08400387578196204, -0.19947939111223853, 0.35112290407979874, 0.10951039799080371, 0.19841578178335545, -0.0026128366304789302, 0.21317495431134598, 0.09887311590848852, 0.015084726571795538, 0.059995744717407894, 0.25935869071156914, 0.19121895136861064, 0.11584867063320155, -0.2545863120605593, 0.02534715740492554, 0.0455667785295158] |
1,802.09587 | Segmentation of the prostate and organs at risk in male pelvic CT images
using deep learning | Inter-and intra-observer variation in delineating regions of interest (ROIs)
occurs because of differences in expertise level and preferences of the
radiation oncologists. We evaluated the accuracy of a segmentation model using
the U-Net structure to delineate the prostate, bladder, and rectum in male
pelvic CT images. The dataset used for training and testing the model consisted
of raw CT scan images of 85 prostate cancer patients. We designed a 2D U-Net
model to directly learn a mapping function that converts a 2D CT grayscale
image to its corresponding 2D OAR segmented image. Our network contains blocks
of convolution 2D layers with variable kernel sizes, channel number, and
activation functions. On the left side of the U-Net model, we used three 3x3
convolutions, each followed by a rectified linear unit (ReLu) (activation
function), and one max pooling operation. On the right side of the U-Net model,
we used a 2x2 transposed convolution and two 3x3 convolution networks followed
by a ReLu activation function. The automatic segmentation using the U-Net
generated an average dice similarity coefficient (DC) and standard deviation
(SD) of the following: DC +- SD (0.88 +- 0.12), (0.95 +- 0.04), and (0.92 +-
0.06) for the prostate, bladder, and rectum, respectively. Furthermore, the
mean of average surface Hausdorff distance (ASHD) and SD were 1.2 +- 0.9 mm,
1.08 +- 0.8 mm, and 0.8 +- 0.6 mm for the prostate, bladder, and rectum,
respectively. Our proposed method, which employs the U-Net structure, is highly
accurate and reproducible for automated ROI segmentation. This provides a
foundation to improve automatic delineation of the boundaries between the
target and surrounding normal soft tissues on a standard radiation therapy
planning CT scan.
| physics.med-ph | interand intraobserver variation in delineating regions of interest rois occurs because of differences in expertise level and preferences of the radiation oncologists we evaluated the accuracy of a segmentation model using the unet structure to delineate the prostate bladder and rectum in male pelvic ct images the dataset used for training and testing the model consisted of raw ct scan images of 85 prostate cancer patients we designed a 2d unet model to directly learn a mapping function that converts a 2d ct grayscale image to its corresponding 2d oar segmented image our network contains blocks of convolution 2d layers with variable kernel sizes channel number and activation functions on the left side of the unet model we used three 3x3 convolutions each followed by a rectified linear unit relu activation function and one max pooling operation on the right side of the unet model we used a 2x2 transposed convolution and two 3x3 convolution networks followed by a relu activation function the automatic segmentation using the unet generated an average dice similarity coefficient dc and standard deviation sd of the following dc sd 088 012 095 004 and 092 006 for the prostate bladder and rectum respectively furthermore the mean of average surface hausdorff distance ashd and sd were 12 09 mm 108 08 mm and 08 06 mm for the prostate bladder and rectum respectively our proposed method which employs the unet structure is highly accurate and reproducible for automated roi segmentation this provides a foundation to improve automatic delineation of the boundaries between the target and surrounding normal soft tissues on a standard radiation therapy planning ct scan | [['interand', 'intraobserver', 'variation', 'in', 'delineating', 'regions', 'of', 'interest', 'rois', 'occurs', 'because', 'of', 'differences', 'in', 'expertise', 'level', 'and', 'preferences', 'of', 'the', 'radiation', 'oncologists', 'we', 'evaluated', 'the', 'accuracy', 'of', 'a', 'segmentation', 'model', 'using', 'the', 'unet', 'structure', 'to', 'delineate', 'the', 'prostate', 'bladder', 'and', 'rectum', 'in', 'male', 'pelvic', 'ct', 'images', 'the', 'dataset', 'used', 'for', 'training', 'and', 'testing', 'the', 'model', 'consisted', 'of', 'raw', 'ct', 'scan', 'images', 'of', '85', 'prostate', 'cancer', 'patients', 'we', 'designed', 'a', '2d', 'unet', 'model', 'to', 'directly', 'learn', 'a', 'mapping', 'function', 'that', 'converts', 'a', '2d', 'ct', 'grayscale', 'image', 'to', 'its', 'corresponding', '2d', 'oar', 'segmented', 'image', 'our', 'network', 'contains', 'blocks', 'of', 'convolution', '2d', 'layers', 'with', 'variable', 'kernel', 'sizes', 'channel', 'number', 'and', 'activation', 'functions', 'on', 'the', 'left', 'side', 'of', 'the', 'unet', 'model', 'we', 'used', 'three', '3x3', 'convolutions', 'each', 'followed', 'by', 'a', 'rectified', 'linear', 'unit', 'relu', 'activation', 'function', 'and', 'one', 'max', 'pooling', 'operation', 'on', 'the', 'right', 'side', 'of', 'the', 'unet', 'model', 'we', 'used', 'a', '2x2', 'transposed', 'convolution', 'and', 'two', '3x3', 'convolution', 'networks', 'followed', 'by', 'a', 'relu', 'activation', 'function', 'the', 'automatic', 'segmentation', 'using', 'the', 'unet', 'generated', 'an', 'average', 'dice', 'similarity', 'coefficient', 'dc', 'and', 'standard', 'deviation', 'sd', 'of', 'the', 'following', 'dc', 'sd', '088', '012', '095', '004', 'and', '092', '006', 'for', 'the', 'prostate', 'bladder', 'and', 'rectum', 'respectively', 'furthermore', 'the', 'mean', 'of', 'average', 'surface', 'hausdorff', 'distance', 'ashd', 'and', 'sd', 'were', '12', '09', 'mm', '108', '08', 'mm', 'and', '08', '06', 'mm', 'for', 'the', 'prostate', 'bladder', 'and', 'rectum', 'respectively', 'our', 'proposed', 'method', 'which', 'employs', 'the', 'unet', 'structure', 'is', 'highly', 'accurate', 'and', 'reproducible', 'for', 'automated', 'roi', 'segmentation', 'this', 'provides', 'a', 'foundation', 'to', 'improve', 'automatic', 'delineation', 'of', 'the', 'boundaries', 'between', 'the', 'target', 'and', 'surrounding', 'normal', 'soft', 'tissues', 'on', 'a', 'standard', 'radiation', 'therapy', 'planning', 'ct', 'scan']] | [0.019845264966392683, 0.013951087879993591, 0.001388496533036232, 0.0589336369291198, -0.013498759945785558, -0.18123933228629607, 0.049307718005514256, 0.44936114262823984, -0.22627821079524302, -0.29196068375474876, 0.0925650827142548, -0.3164904873404238, -0.1384798703594478, 0.16265004727185306, -0.12591902707806893, 0.08765402475212425, 0.08601370064004893, 0.000775951951638692, -0.08593474869935394, -0.2311709142031355, 0.19985413792655216, 0.024913612930901798, 0.3417339772287825, 0.01803515877270709, 0.15548356948722222, -0.010565941995096013, -0.036472861772334136, -0.022851691829230362, -0.0888299038574688, 0.1602321580440427, 0.24598137626458924, 0.12493675858972388, 0.28709984253747045, -0.3961478880684202, -0.18750488363352982, 0.054769941668146874, 0.1050174059725746, -0.019358451776982595, -0.012905742896772507, -0.31096572576228665, 0.09431004726944525, -0.14086787459064334, 0.01863150706393989, -0.011782575936781035, -0.005895122780067915, -0.03499114133495217, -0.3410781840272075, 0.15767089946592158, 0.009647762432211528, 0.0858562706478147, -0.12161739226646238, -0.17049172369125126, -0.03421163692880698, 0.1752507157002886, -0.045743185796136794, 0.15346494925443377, 0.21414574991806012, -0.19203708220814372, -0.06572892142597724, 0.29996485668406997, -0.00034922922970037217, -0.2205786219297874, 0.12367764372503627, -0.1307866748534488, -0.06115785184730258, 0.16003122871086278, 0.18428444840591746, 0.11906943057784465, -0.1499416429088106, -0.043195897158390534, 0.0023798454759849444, 0.2271159517130366, 0.10958162130684489, -0.09983923176553583, 0.1458497435061468, 0.24880789023160038, -0.02960707721153826, 0.16536870574604512, -0.276308035647876, 0.0020151821094461612, -0.2276859381960498, -0.15986627846804266, -0.13510747064525883, -0.008117373880479674, -0.15188994530719896, -0.18426235496531093, 0.4455184228770021, 0.13553849419199482, 0.20006080480740854, 0.0919874435200149, 0.28340718618732086, 0.0025113997299707046, 0.15383896401876376, 0.006563717171687771, 0.16810985297068126, 0.08351656172459049, 0.08814546116972687, -0.17575000008757882, 0.046514583661876344, 0.09213294379965023] |
1,802.09588 | Bounding Multivariate Trigonometric Polynomials with Applications to
Filter Bank Design | The extremal values of multivariate trigonometric polynomials are of interest
in fields ranging from control theory to filter design, but finding the
extremal values of such a polynomial is generally NP-Hard. In this paper, we
develop simple and efficiently computable estimates of the extremal values of a
multivariate trigonometric polynomial directly from its samples. We provide an
upper bound on the modulus of a complex trigonometric polynomial, and develop
upper and lower bounds for real trigonometric polynomials. For a univarite
polynomial, these bounds are tighter than existing bounds, and the extension to
multivariate polynomials is new. As an application, the lower bound provides a
sufficient condition to certify global positivity of a real trigonometric
polynomial. We use this condition to motivate a new algorithm for
multi-dimensional, multirate, perfect reconstruction filter bank design. We
demonstrate our algorithm by designing a 2D perfect reconstruction filter bank.
| eess.SP | the extremal values of multivariate trigonometric polynomials are of interest in fields ranging from control theory to filter design but finding the extremal values of such a polynomial is generally nphard in this paper we develop simple and efficiently computable estimates of the extremal values of a multivariate trigonometric polynomial directly from its samples we provide an upper bound on the modulus of a complex trigonometric polynomial and develop upper and lower bounds for real trigonometric polynomials for a univarite polynomial these bounds are tighter than existing bounds and the extension to multivariate polynomials is new as an application the lower bound provides a sufficient condition to certify global positivity of a real trigonometric polynomial we use this condition to motivate a new algorithm for multidimensional multirate perfect reconstruction filter bank design we demonstrate our algorithm by designing a 2d perfect reconstruction filter bank | [['the', 'extremal', 'values', 'of', 'multivariate', 'trigonometric', 'polynomials', 'are', 'of', 'interest', 'in', 'fields', 'ranging', 'from', 'control', 'theory', 'to', 'filter', 'design', 'but', 'finding', 'the', 'extremal', 'values', 'of', 'such', 'a', 'polynomial', 'is', 'generally', 'nphard', 'in', 'this', 'paper', 'we', 'develop', 'simple', 'and', 'efficiently', 'computable', 'estimates', 'of', 'the', 'extremal', 'values', 'of', 'a', 'multivariate', 'trigonometric', 'polynomial', 'directly', 'from', 'its', 'samples', 'we', 'provide', 'an', 'upper', 'bound', 'on', 'the', 'modulus', 'of', 'a', 'complex', 'trigonometric', 'polynomial', 'and', 'develop', 'upper', 'and', 'lower', 'bounds', 'for', 'real', 'trigonometric', 'polynomials', 'for', 'a', 'univarite', 'polynomial', 'these', 'bounds', 'are', 'tighter', 'than', 'existing', 'bounds', 'and', 'the', 'extension', 'to', 'multivariate', 'polynomials', 'is', 'new', 'as', 'an', 'application', 'the', 'lower', 'bound', 'provides', 'a', 'sufficient', 'condition', 'to', 'certify', 'global', 'positivity', 'of', 'a', 'real', 'trigonometric', 'polynomial', 'we', 'use', 'this', 'condition', 'to', 'motivate', 'a', 'new', 'algorithm', 'for', 'multidimensional', 'multirate', 'perfect', 'reconstruction', 'filter', 'bank', 'design', 'we', 'demonstrate', 'our', 'algorithm', 'by', 'designing', 'a', '2d', 'perfect', 'reconstruction', 'filter', 'bank']] | [-0.11439960373897705, 0.0022963359123633173, -0.11412036426078814, 0.0783382840617397, -0.14235662513940067, -0.16487251400908495, 0.05212960854641624, 0.3364838788943639, -0.28800902294216457, -0.2912881227268779, 0.16359132349693015, -0.20478305581084394, -0.1905256180919811, 0.27347433214056327, -0.0853487248646447, 0.11503106219296334, 0.03274588133989983, 0.01501100370517958, -0.12132762082513761, -0.29106998055443895, 0.2419991359323055, 0.050010970813202694, 0.21230107634588816, 0.023335719280843655, 0.10590026028441278, -0.017147928782432646, -0.036121867312170514, -0.0492115805179558, -0.1901812858430187, 0.18750786509078282, 0.2781840519095491, 0.15756595931569492, 0.2637159342753825, -0.3598283052744044, -0.10141871347241885, 0.1872944230917138, 0.1370403412794629, 0.10706666289092777, -0.05042854513911126, -0.25529631377048007, 0.06680501229699597, -0.1345590305892373, -0.1496187799115229, -0.09380264801683126, -0.00269370715921888, 0.05067515291413618, -0.38296099289782815, 0.06146829441137664, 0.06151400158471604, 0.09037436201958429, -0.04822609211086992, -0.16779494172261727, 0.07454451955887456, 0.05552963918999775, -0.06390838078251662, 0.00870189032276402, 0.04603507004391689, -0.09579999211498282, -0.13507178540413195, 0.32254792744671545, -0.05613410247742586, -0.2779334310338005, 0.13626598009930832, -0.13542985178569292, -0.16290875416170883, 0.13202455549312014, 0.22456005194152778, 0.14411821061667132, -0.13696754759607407, 0.10611172871488322, -0.12725237712680876, 0.1339295147885601, 0.11054357353246191, 0.044613620800363435, 0.14043338832745028, 0.07766635501040862, 0.16053218304642014, 0.192726823108896, -0.03043695877776709, -0.07248151563254504, -0.29115855435912424, -0.15943224109152423, -0.2337870396660654, 0.023639975232886266, -0.19608639575943182, -0.21113412299639564, 0.3882364853825811, 0.13181258846152497, 0.17208377527841529, 0.17151447592980482, 0.286917511816625, 0.16431127025353418, 0.017340809110083157, 0.0790658968116541, 0.18522676451040523, 0.15873126677966878, 0.045108754497177744, -0.12341760701037474, 0.07323881821915298, 0.11482926570689078] |
1,802.09589 | Volatility estimation in fractional Ornstein-Uhlenbeck models | In this article we study the asymptotic behaviour of the realized quadratic
variation of a process $\int_{0}^{t}u_{s}dY_{s}^{(1)}$% , where $u$ is a
$\beta$-H\"older continuous process with $\beta > 1-H$ and
$Y_{t}^{(1)}=\int_{0}^{t}e^{-s}dB^{H}_{a_s}$, where $a_{t}=He^{\frac{t% }{H}} $
and $B^H$ is a fractional Brownian motion, is connected to the fractional
Ornstein-Uhlenbeck process of the second kind. We prove almost sure convergence
uniformly in time, and a stable weak convergence for the realized quadratic
variation. As an application, we construct strongly consistent estimator for
the integrated volatility parameter in a model driven by $Y^{(1)}$.
| math.PR | in this article we study the asymptotic behaviour of the realized quadratic variation of a process int_0tu_sdy_s1 where u is a betaholder continuous process with beta 1h and y_t1int_0tesdbh_a_s where a_thefract h and bh is a fractional brownian motion is connected to the fractional ornsteinuhlenbeck process of the second kind we prove almost sure convergence uniformly in time and a stable weak convergence for the realized quadratic variation as an application we construct strongly consistent estimator for the integrated volatility parameter in a model driven by y1 | [['in', 'this', 'article', 'we', 'study', 'the', 'asymptotic', 'behaviour', 'of', 'the', 'realized', 'quadratic', 'variation', 'of', 'a', 'process', 'int_0tu_sdy_s1', 'where', 'u', 'is', 'a', 'betaholder', 'continuous', 'process', 'with', 'beta', '1h', 'and', 'y_t1int_0tesdbh_a_s', 'where', 'a_thefract', 'h', 'and', 'bh', 'is', 'a', 'fractional', 'brownian', 'motion', 'is', 'connected', 'to', 'the', 'fractional', 'ornsteinuhlenbeck', 'process', 'of', 'the', 'second', 'kind', 'we', 'prove', 'almost', 'sure', 'convergence', 'uniformly', 'in', 'time', 'and', 'a', 'stable', 'weak', 'convergence', 'for', 'the', 'realized', 'quadratic', 'variation', 'as', 'an', 'application', 'we', 'construct', 'strongly', 'consistent', 'estimator', 'for', 'the', 'integrated', 'volatility', 'parameter', 'in', 'a', 'model', 'driven', 'by', 'y1']] | [-0.10758306790653262, 0.11308559977849308, -0.06816029229057244, 0.06449637785129068, -0.0369768299361957, -0.11898996583962192, 0.026963939940157746, 0.39235677781869616, -0.32812498787063216, -0.19158884609073756, 0.16249977165993879, -0.26531672872425544, -0.1336510463928183, 0.18629678801932772, -0.07123945491565835, 0.056290973970178695, -0.0027695443492294068, 0.04046352283607814, -0.013878153980753961, -0.23322496332582973, 0.27477206187766223, 0.0013168381881855783, 0.1917587965505109, -0.0446939573046707, 0.16211365442723036, -0.0034234689554155226, -0.01707570922250549, 0.007739654337499468, -0.18592419324531442, 0.0920588927166093, 0.18471042037985863, -0.00713725560178448, 0.326734003610909, -0.3324077870153512, -0.15997259597116636, 0.17789451687020205, 0.1401166941726669, 0.0036467536729538723, -0.05307416364805596, -0.2637136227650834, 0.07087486104934387, -0.1580853764899075, -0.1851561309470396, -0.03825968483717935, 0.05304458853788674, 0.04463993221066803, -0.3784863345956962, 0.13739501783302763, 0.13256043811755566, 0.024281294795010972, -0.05714895611163229, -0.04611443382288728, -0.014296297848756825, 0.0486308512266814, 0.061819646208494394, 0.0404160595956325, 0.10577043583283999, -0.08801624663118716, -0.11212704055720851, 0.32202924597298815, -0.1652021881614235, -0.20691985592600845, 0.12096349559059101, -0.19383725090994544, -0.14582382492898477, 0.10762288363739139, 0.16913102042772585, 0.15841606548721238, -0.17679498208287572, 0.16809487138899776, -0.005311661732516119, 0.15033260402491405, 0.01840473060673546, -0.010476059424469159, 0.10855146878055252, 0.19758653078350194, 0.15608324097203358, 0.16803932491512524, -0.04584556541383444, -0.1257239563745402, -0.35726474700052113, -0.19177604920142108, -0.18707518742996312, 0.09424482621917767, -0.11389799063995486, -0.1988602742286665, 0.3626511371694505, 0.0919351446375783, 0.22417058857778707, 0.07215408470836424, 0.2142212053295225, 0.210922341493036, -0.05116361570322797, 0.06401913064820249, 0.18280539913601906, 0.12237904031505986, 0.09548802410357721, -0.19995233212310787, 0.08474699799193158, 0.08322705438781884] |
1,802.0959 | Revisiting Totally Positive Differential Systems: A Tutorial and New
Results | A matrix is called totally nonnegative (TN) if all its minors are
nonnegative, and totally positive (TP) if all its minors are positive.
Multiplying a vector by a TN matrix does not increase the number of sign
variations in the vector. In a largely forgotten paper, Schwarz (1970)
considered matrices whose exponentials are TN or TP. He also analyzed the
evolution of the number of sign changes in the vector solutions of the
corresponding linear system.
In a seemingly different line of research, Smillie (1984), Smith (1991), and
others analyzed the stability of nonlinear tridiagonal cooperative systems by
using the number of sign variations in the derivative vector as an
integer-valued Lyapunov function.
We provide a tutorial on these fascinating research topics and show that they
are intimately related. This allows to derive generalizations of the results by
Smillie (1984) and Smith (1991) while simplifying the proofs. It also opens the
door to many new and interesting research directions.
| math.DS | a matrix is called totally nonnegative tn if all its minors are nonnegative and totally positive tp if all its minors are positive multiplying a vector by a tn matrix does not increase the number of sign variations in the vector in a largely forgotten paper schwarz 1970 considered matrices whose exponentials are tn or tp he also analyzed the evolution of the number of sign changes in the vector solutions of the corresponding linear system in a seemingly different line of research smillie 1984 smith 1991 and others analyzed the stability of nonlinear tridiagonal cooperative systems by using the number of sign variations in the derivative vector as an integervalued lyapunov function we provide a tutorial on these fascinating research topics and show that they are intimately related this allows to derive generalizations of the results by smillie 1984 and smith 1991 while simplifying the proofs it also opens the door to many new and interesting research directions | [['a', 'matrix', 'is', 'called', 'totally', 'nonnegative', 'tn', 'if', 'all', 'its', 'minors', 'are', 'nonnegative', 'and', 'totally', 'positive', 'tp', 'if', 'all', 'its', 'minors', 'are', 'positive', 'multiplying', 'a', 'vector', 'by', 'a', 'tn', 'matrix', 'does', 'not', 'increase', 'the', 'number', 'of', 'sign', 'variations', 'in', 'the', 'vector', 'in', 'a', 'largely', 'forgotten', 'paper', 'schwarz', '1970', 'considered', 'matrices', 'whose', 'exponentials', 'are', 'tn', 'or', 'tp', 'he', 'also', 'analyzed', 'the', 'evolution', 'of', 'the', 'number', 'of', 'sign', 'changes', 'in', 'the', 'vector', 'solutions', 'of', 'the', 'corresponding', 'linear', 'system', 'in', 'a', 'seemingly', 'different', 'line', 'of', 'research', 'smillie', '1984', 'smith', '1991', 'and', 'others', 'analyzed', 'the', 'stability', 'of', 'nonlinear', 'tridiagonal', 'cooperative', 'systems', 'by', 'using', 'the', 'number', 'of', 'sign', 'variations', 'in', 'the', 'derivative', 'vector', 'as', 'an', 'integervalued', 'lyapunov', 'function', 'we', 'provide', 'a', 'tutorial', 'on', 'these', 'fascinating', 'research', 'topics', 'and', 'show', 'that', 'they', 'are', 'intimately', 'related', 'this', 'allows', 'to', 'derive', 'generalizations', 'of', 'the', 'results', 'by', 'smillie', '1984', 'and', 'smith', '1991', 'while', 'simplifying', 'the', 'proofs', 'it', 'also', 'opens', 'the', 'door', 'to', 'many', 'new', 'and', 'interesting', 'research', 'directions']] | [-0.1663224434215757, 0.14100917714434522, -0.03832472104259983, 0.03062260586258797, -0.11366604354361412, -0.15741478803468012, 0.023517501804063905, 0.3230549361807171, -0.29453809812237397, -0.24166862484149682, 0.14050399755938975, -0.2845251393782117, -0.21644088476553996, 0.17491481781193297, -0.06665459351391538, 0.03862578447823231, 0.01700216896375114, 0.0473204342878655, -0.09112844612587055, -0.31016517073244043, 0.3218531708976945, 0.01839614770837925, 0.22696775261535304, 0.07844302823046609, 0.07554974042628922, 0.02042705569058985, -0.07213950474049498, 0.01845129904097075, -0.09556411098823012, 0.10199816956931802, 0.25161314433961873, 0.1524661731841804, 0.26209851095757486, -0.36103074759854087, -0.16416474657262084, 0.13671110359858135, 0.11911683321092864, 0.036071426420378847, -0.025925582976215198, -0.27642776181558204, 0.08505608822927817, -0.13174513955571274, -0.13378332185986563, -0.09937546939630085, 0.09287750194985536, 0.034209966952048546, -0.23069268230161388, 0.04241697219275114, 0.13039027516431403, 0.07959164785068927, -0.022879264916735555, -0.1830487563501774, 0.0011685576191781172, 0.0845802327158199, 0.06842197354080495, 0.010659476743612744, 0.07339598309342404, -0.07438509111034936, -0.13004893998750164, 0.34032008407707764, -0.0670555291753028, -0.20117299289167304, 0.15780477231637863, -0.118829994157847, -0.13301258324938328, 0.12771907938796354, 0.12371082849941163, 0.11154868278678788, -0.14031500636992403, 0.12403301494569464, -0.09890834820521234, 0.09814310304047365, 0.09926527771958203, -0.02146976948393591, 0.18798096546223797, 0.025066948732296767, 0.07612436638710107, 0.11618465553740707, 0.005192432999200885, -0.09893896988828801, -0.27250838990809406, -0.17375404225170332, -0.1849896899913584, 0.06233560296411424, -0.07586642636127884, -0.1721604900118315, 0.4281453856811771, 0.09196973301077836, 0.21837729801945155, 0.03502708962209136, 0.21977047474597985, 0.11381350703019086, 0.03382199124064086, 0.1058822102264835, 0.1866224500725526, 0.21816687845279398, 0.13647806208797456, -0.17882056550837397, 0.08848653638840846, 0.08758010982928223] |
1,802.09591 | A Learning Approach for Low-Complexity Optimization of Energy Efficiency
in Multi-Carrier Wireless Networks | This paper proposes computationally efficient algorithms to maximize the
energy efficiency in multi-carrier wireless interference networks, by a
suitable allocation of the system radio resources, namely the transmit powers
and subcarrier assignment. The problem is formulated as the maximization of the
system Global Energy-Efficiency subject to both maximum power and minimum rate
constraints. This leads to a challenging non-convex fractional problem, which
is tackled through an interplay of fractional programming, learning, and game
theory. The proposed algorithmic framework is provably convergent and has a
complexity linear in both the number of users and subcarriers, whereas other
available solutions can only guarantee a polynomial complexity in the number of
users and subcarriers. Numerical results show that the proposed method performs
similarly as other, more complex, algorithms.
| cs.NI | this paper proposes computationally efficient algorithms to maximize the energy efficiency in multicarrier wireless interference networks by a suitable allocation of the system radio resources namely the transmit powers and subcarrier assignment the problem is formulated as the maximization of the system global energyefficiency subject to both maximum power and minimum rate constraints this leads to a challenging nonconvex fractional problem which is tackled through an interplay of fractional programming learning and game theory the proposed algorithmic framework is provably convergent and has a complexity linear in both the number of users and subcarriers whereas other available solutions can only guarantee a polynomial complexity in the number of users and subcarriers numerical results show that the proposed method performs similarly as other more complex algorithms | [['this', 'paper', 'proposes', 'computationally', 'efficient', 'algorithms', 'to', 'maximize', 'the', 'energy', 'efficiency', 'in', 'multicarrier', 'wireless', 'interference', 'networks', 'by', 'a', 'suitable', 'allocation', 'of', 'the', 'system', 'radio', 'resources', 'namely', 'the', 'transmit', 'powers', 'and', 'subcarrier', 'assignment', 'the', 'problem', 'is', 'formulated', 'as', 'the', 'maximization', 'of', 'the', 'system', 'global', 'energyefficiency', 'subject', 'to', 'both', 'maximum', 'power', 'and', 'minimum', 'rate', 'constraints', 'this', 'leads', 'to', 'a', 'challenging', 'nonconvex', 'fractional', 'problem', 'which', 'is', 'tackled', 'through', 'an', 'interplay', 'of', 'fractional', 'programming', 'learning', 'and', 'game', 'theory', 'the', 'proposed', 'algorithmic', 'framework', 'is', 'provably', 'convergent', 'and', 'has', 'a', 'complexity', 'linear', 'in', 'both', 'the', 'number', 'of', 'users', 'and', 'subcarriers', 'whereas', 'other', 'available', 'solutions', 'can', 'only', 'guarantee', 'a', 'polynomial', 'complexity', 'in', 'the', 'number', 'of', 'users', 'and', 'subcarriers', 'numerical', 'results', 'show', 'that', 'the', 'proposed', 'method', 'performs', 'similarly', 'as', 'other', 'more', 'complex', 'algorithms']] | [-0.20549366805609315, -0.02589663681469392, -0.0465244814902544, 0.04900692212115973, -0.11240339049696922, -0.21605441819131374, 0.08577242386876606, 0.3561143306400627, -0.3102758558243513, -0.327896314304322, 0.09162803032714874, -0.23277664479613305, -0.20200793460756541, 0.1656233071088791, -0.13593471954762937, 0.12149899873882532, 0.04892070797644556, 0.026143306996673346, -0.02425358301214874, -0.2973457106053829, 0.24552268176525832, 0.10725795492902399, 0.3408630505800247, 0.03318319378048182, 0.0917874841839075, -0.003485478827729821, -0.010737517211586237, 0.022847586046438665, -0.06789203977590659, 0.12860481389798223, 0.3555635551512241, 0.23228608153760433, 0.38062535362690686, -0.4243687704205513, -0.2068654989246279, 0.12038786767050624, 0.168538314322941, 0.03252472576778382, -0.029459704945445992, -0.20856971682608128, 0.11405746123939753, -0.19617970718815922, -0.003394282165914774, -0.05290003927983344, -0.05034125411510468, 0.03985703008621931, -0.3663795429468155, 0.03991623980179429, 0.009376489281654358, 0.0029154210016131402, -0.059003227785229685, -0.11484765341691673, 0.03291380321606994, 0.1020303167742677, 0.062216955283656714, -0.005987416880205274, 0.07941756559442728, -0.12786349476501346, -0.18083140634732262, 0.4120948284864426, 0.0236552271284163, -0.24625300370156766, 0.15006356293149292, -0.037346151810139415, -0.10187990665994584, 0.1615047286748886, 0.22617759514879435, 0.14884726572036744, -0.1637271139137447, 0.06452374700177461, -0.04548628788255155, 0.18833383822254837, 0.04787396838515997, 0.09538005636259914, 0.1269166909623891, 0.18111598528549075, 0.20163633631169797, 0.16578151708235964, -0.04266525740223005, -0.11864570505172015, -0.18888060212880373, -0.10441693047992885, -0.24950640761293472, -0.014955087553709745, -0.10455800596927292, -0.08891900424659252, 0.40230704164505005, 0.1245904289111495, 0.10817954447865487, 0.14816693202871828, 0.39805899167060854, 0.16748591199330987, 0.010956923697143793, 0.1408059705980122, 0.16526000228524207, 0.10173670741124079, 0.14142689903825523, -0.2786131038814783, 0.05333113896427676, 0.03558590974658728] |
1,802.09592 | ADMM for Multiaffine Constrained Optimization | We expand the scope of the alternating direction method of multipliers
(ADMM). Specifically, we show that ADMM, when employed to solve problems with
multiaffine constraints that satisfy certain verifiable assumptions, converges
to the set of constrained stationary points if the penalty parameter in the
augmented Lagrangian is sufficiently large. When the Kurdyka-\L{}ojasiewicz
(K-\L{}) property holds, this is strengthened to convergence to a single
constrained stationary point. Our analysis applies under assumptions that we
have endeavored to make as weak as possible. It applies to problems that
involve nonconvex and/or nonsmooth objective terms, in addition to the
multiaffine constraints that can involve multiple (three or more) blocks of
variables. To illustrate the applicability of our results, we describe examples
including nonnegative matrix factorization, sparse learning, risk parity
portfolio selection, nonconvex formulations of convex problems, and neural
network training. In each case, our ADMM approach encounters only subproblems
that have closed-form solutions.
| math.OC | we expand the scope of the alternating direction method of multipliers admm specifically we show that admm when employed to solve problems with multiaffine constraints that satisfy certain verifiable assumptions converges to the set of constrained stationary points if the penalty parameter in the augmented lagrangian is sufficiently large when the kurdykalojasiewicz kl property holds this is strengthened to convergence to a single constrained stationary point our analysis applies under assumptions that we have endeavored to make as weak as possible it applies to problems that involve nonconvex andor nonsmooth objective terms in addition to the multiaffine constraints that can involve multiple three or more blocks of variables to illustrate the applicability of our results we describe examples including nonnegative matrix factorization sparse learning risk parity portfolio selection nonconvex formulations of convex problems and neural network training in each case our admm approach encounters only subproblems that have closedform solutions | [['we', 'expand', 'the', 'scope', 'of', 'the', 'alternating', 'direction', 'method', 'of', 'multipliers', 'admm', 'specifically', 'we', 'show', 'that', 'admm', 'when', 'employed', 'to', 'solve', 'problems', 'with', 'multiaffine', 'constraints', 'that', 'satisfy', 'certain', 'verifiable', 'assumptions', 'converges', 'to', 'the', 'set', 'of', 'constrained', 'stationary', 'points', 'if', 'the', 'penalty', 'parameter', 'in', 'the', 'augmented', 'lagrangian', 'is', 'sufficiently', 'large', 'when', 'the', 'kurdykalojasiewicz', 'kl', 'property', 'holds', 'this', 'is', 'strengthened', 'to', 'convergence', 'to', 'a', 'single', 'constrained', 'stationary', 'point', 'our', 'analysis', 'applies', 'under', 'assumptions', 'that', 'we', 'have', 'endeavored', 'to', 'make', 'as', 'weak', 'as', 'possible', 'it', 'applies', 'to', 'problems', 'that', 'involve', 'nonconvex', 'andor', 'nonsmooth', 'objective', 'terms', 'in', 'addition', 'to', 'the', 'multiaffine', 'constraints', 'that', 'can', 'involve', 'multiple', 'three', 'or', 'more', 'blocks', 'of', 'variables', 'to', 'illustrate', 'the', 'applicability', 'of', 'our', 'results', 'we', 'describe', 'examples', 'including', 'nonnegative', 'matrix', 'factorization', 'sparse', 'learning', 'risk', 'parity', 'portfolio', 'selection', 'nonconvex', 'formulations', 'of', 'convex', 'problems', 'and', 'neural', 'network', 'training', 'in', 'each', 'case', 'our', 'admm', 'approach', 'encounters', 'only', 'subproblems', 'that', 'have', 'closedform', 'solutions']] | [-0.10595729808866357, -0.012497394119078914, -0.08459320077206939, 0.09464237809879705, -0.14369055193383246, -0.21736761886936923, 0.03709853621316142, 0.39768413943548997, -0.3372933878749609, -0.23667507679512104, 0.13647276198258623, -0.22486401941627265, -0.17542405468256522, 0.17560892867700506, -0.11064907911544045, 0.10970535579137504, 0.1108600337104872, -0.024182254071347414, -0.11811927221133374, -0.32714187416015195, 0.31264802341038983, -0.043249960262328385, 0.24049475099891424, 0.03576285890730408, 0.121981227901609, 0.013943039048463106, 0.05053770948356638, 0.0594184100930579, -0.06692274156792943, 0.12231073266710155, 0.3003184433716039, 0.19776859964244067, 0.3682837094444161, -0.4366720524802804, -0.1851599893408517, 0.15985587442293764, 0.14317742062111696, 0.04789583163956801, -0.015472675827816905, -0.23003216652044406, 0.1374103080915908, -0.11791685669702323, -0.12327221523039043, -0.15380351673966894, -0.06845592103122423, 0.06446543257062634, -0.3733521929507454, 0.05331369368592277, 0.07296959809958935, -0.03803512022374586, -0.08286940009410804, -0.15500228610510627, 0.03545666822542747, 0.03920348487522764, 0.1490095618677636, 0.014958647964522242, 0.1351684882119298, -0.07844564284353206, -0.10445255919670066, 0.35664667242517073, -0.0064231106910544135, -0.30746643108315763, 0.1862511765025556, -0.05353219031356275, -0.2110655098160108, 0.12811708776280284, 0.21153109832977254, 0.17509623278398068, -0.15743177042439735, 0.11180235587642529, -0.0961380808490018, 0.13060963164491113, 0.05758216316346079, -0.0034727459338804085, 0.07504983089243372, 0.11419255798993011, 0.20347830494244892, 0.16613155211108582, -0.04469786633426944, -0.14484194998978636, -0.3039243990404066, -0.08143946140965758, -0.2035938849905506, -0.001513602223712951, -0.1282873350054918, -0.1521138928551227, 0.3666986060204605, 0.18061496435975036, 0.1576905702954779, 0.14685665018856525, 0.28625684298574927, 0.1239819510251012, 0.06849546865133259, 0.10183777543095252, 0.22230244030555088, 0.12733365547532838, 0.08066296767947885, -0.20160276420104006, 0.08148595998063683, 0.09297714273134867] |
1,802.09593 | Spin Seebeck effect and ballistic transport of quasi-acoustic magnons in
room-temperature yttrium iron garnet films | We studied the transient behavior of the spin current generated by the
longitudinal spin Seebeck effect (LSSE) in a set of platinum-coated yttrium
iron garnet (YIG) films of different thicknesses. The LSSE was induced by means
of pulsed microwave heating of the Pt layer and the spin currents were measured
electrically using the inverse spin Hall effect in the same layer. We
demonstrate that the time evolution of the LSSE is determined by the evolution
of the thermal gradient triggering the flux of thermal magnons in the vicinity
of the YIG/Pt interface. These magnons move ballistically within the YIG film
with a constant group velocity, while their number decays exponentially within
an effective propagation length. The ballistic flight of the magnons with
energies above 20K is a result of their almost linear dispersion law, similar
to that of acoustic phonons. By fitting the time-dependent LSSE signal for
different film thicknesses varying by almost an order of magnitude, we found
that the effective propagation length is practically independent of the YIG
film thickness. We consider this fact as strong support of a ballistic
transport scenario - the ballistic propagation of quasi-acoustic magnons in
room temperature YIG.
| cond-mat.mes-hall | we studied the transient behavior of the spin current generated by the longitudinal spin seebeck effect lsse in a set of platinumcoated yttrium iron garnet yig films of different thicknesses the lsse was induced by means of pulsed microwave heating of the pt layer and the spin currents were measured electrically using the inverse spin hall effect in the same layer we demonstrate that the time evolution of the lsse is determined by the evolution of the thermal gradient triggering the flux of thermal magnons in the vicinity of the yigpt interface these magnons move ballistically within the yig film with a constant group velocity while their number decays exponentially within an effective propagation length the ballistic flight of the magnons with energies above 20k is a result of their almost linear dispersion law similar to that of acoustic phonons by fitting the timedependent lsse signal for different film thicknesses varying by almost an order of magnitude we found that the effective propagation length is practically independent of the yig film thickness we consider this fact as strong support of a ballistic transport scenario the ballistic propagation of quasiacoustic magnons in room temperature yig | [['we', 'studied', 'the', 'transient', 'behavior', 'of', 'the', 'spin', 'current', 'generated', 'by', 'the', 'longitudinal', 'spin', 'seebeck', 'effect', 'lsse', 'in', 'a', 'set', 'of', 'platinumcoated', 'yttrium', 'iron', 'garnet', 'yig', 'films', 'of', 'different', 'thicknesses', 'the', 'lsse', 'was', 'induced', 'by', 'means', 'of', 'pulsed', 'microwave', 'heating', 'of', 'the', 'pt', 'layer', 'and', 'the', 'spin', 'currents', 'were', 'measured', 'electrically', 'using', 'the', 'inverse', 'spin', 'hall', 'effect', 'in', 'the', 'same', 'layer', 'we', 'demonstrate', 'that', 'the', 'time', 'evolution', 'of', 'the', 'lsse', 'is', 'determined', 'by', 'the', 'evolution', 'of', 'the', 'thermal', 'gradient', 'triggering', 'the', 'flux', 'of', 'thermal', 'magnons', 'in', 'the', 'vicinity', 'of', 'the', 'yigpt', 'interface', 'these', 'magnons', 'move', 'ballistically', 'within', 'the', 'yig', 'film', 'with', 'a', 'constant', 'group', 'velocity', 'while', 'their', 'number', 'decays', 'exponentially', 'within', 'an', 'effective', 'propagation', 'length', 'the', 'ballistic', 'flight', 'of', 'the', 'magnons', 'with', 'energies', 'above', '20k', 'is', 'a', 'result', 'of', 'their', 'almost', 'linear', 'dispersion', 'law', 'similar', 'to', 'that', 'of', 'acoustic', 'phonons', 'by', 'fitting', 'the', 'timedependent', 'lsse', 'signal', 'for', 'different', 'film', 'thicknesses', 'varying', 'by', 'almost', 'an', 'order', 'of', 'magnitude', 'we', 'found', 'that', 'the', 'effective', 'propagation', 'length', 'is', 'practically', 'independent', 'of', 'the', 'yig', 'film', 'thickness', 'we', 'consider', 'this', 'fact', 'as', 'strong', 'support', 'of', 'a', 'ballistic', 'transport', 'scenario', 'the', 'ballistic', 'propagation', 'of', 'quasiacoustic', 'magnons', 'in', 'room', 'temperature', 'yig']] | [-0.1708274177827971, 0.2760967521740126, -0.012180833165178593, -0.0420780342501905, -0.04905940565525448, -0.06390310893046487, 0.01670011443256391, 0.40438167070105824, -0.2905499645648044, -0.2856649674544802, 0.013808672394382661, -0.3262024069032104, -0.030871056586734412, 0.24193879542392246, 0.08018566485369559, 0.05011559532926485, -0.06118825748658825, -0.03667767985109432, -0.05102108036481161, -0.18260101549034535, 0.2497839967038521, 0.03084506302323077, 0.3458643862857608, 0.07356547215262178, 0.09190592608299375, 0.002770933901084606, 0.08892027883953654, 0.04387858813297311, -0.14616685315720424, -0.0022038234897034685, 0.22321293732876285, -0.1343888430793535, 0.17616189819803826, -0.46382181699262914, -0.22564278609934263, -0.0026464617772738344, 0.1646153079153797, 0.15118342869451207, -0.06248459814490808, -0.2529385294213161, 0.06350459348165535, -0.156307819186585, -0.127497008490405, 0.023625262024615575, 0.009947724155505601, -0.016409173940570027, -0.21235538576489565, 0.11889935144104458, 0.12814287130826527, 0.09528729339735102, -0.06010594649826052, -0.12685917517573564, -0.10011539711573728, 0.06817380881438646, 0.10844740387383542, 0.007651394200028213, 0.22292270602840816, -0.10849925922109871, -0.10633289389379476, 0.29450057253971235, -0.13013282701548323, -0.10074561570105552, 0.12218117213702386, -0.1966006828835966, 0.05133179003089551, 0.16706916832811555, 0.15287377215806663, 0.1194557095237617, -0.17285856831165933, 0.058210792478123566, -0.026284171580384996, 0.19039131665227876, 0.09219737791638706, 0.0380768413588251, 0.24170711382109786, 0.2021453891749993, 0.022137300530658585, 0.16564199289957485, -0.14192524475295135, 0.017206417620494078, -0.23888816271090074, -0.15173787163503313, -0.21658376663126358, 0.1029681086326594, -0.1156670675178979, -0.1892679143557805, 0.4195238969591206, 0.17928892628490936, 0.17411314638705983, -0.005541096107803823, 0.29037062578460143, 0.146202488609223, 0.06851730096818802, 0.055521221886648195, 0.2979133580475278, 0.19163481843989036, 0.14087399487628496, -0.348333793754699, 0.11217171492861565, 0.011471653335545328] |
1,802.09594 | All nearest neighbor calculation based on Delaunay graphs | When we have two data sets and want to find the nearest neighbour of each
point in the first dataset among points in the second one, we need the all
nearest neighbour operator. This is an operator in spatial databases that has
many application in different fields such as GIS and VLSI circuit design.
Existing algorithms for calculating this operator assume that there is no pre
computation on these data sets. These algorithms has o(n*m*d) time complexity
where n and m are the number of points in two data sets and d is the dimension
of data points. With assumption of some pre computation on data sets algorithms
with lower time complexity can be obtained. One of the most common pre
computation on spatial data is Delaunay graphs. In the Delaunay graph of a data
set each point is linked to its nearest neighbours. In this paper, we introduce
an algorithm for computing the all nearest neighbour operator on spatial data
sets based on their Delaunay graphs. The performance of this algorithm is
compared with one of the best existing algorithms for computing ANN operator in
terms of CPU time and the number of IOs. The experimental results show that
this algorithm has better performance than the other.
| cs.DB | when we have two data sets and want to find the nearest neighbour of each point in the first dataset among points in the second one we need the all nearest neighbour operator this is an operator in spatial databases that has many application in different fields such as gis and vlsi circuit design existing algorithms for calculating this operator assume that there is no pre computation on these data sets these algorithms has onmd time complexity where n and m are the number of points in two data sets and d is the dimension of data points with assumption of some pre computation on data sets algorithms with lower time complexity can be obtained one of the most common pre computation on spatial data is delaunay graphs in the delaunay graph of a data set each point is linked to its nearest neighbours in this paper we introduce an algorithm for computing the all nearest neighbour operator on spatial data sets based on their delaunay graphs the performance of this algorithm is compared with one of the best existing algorithms for computing ann operator in terms of cpu time and the number of ios the experimental results show that this algorithm has better performance than the other | [['when', 'we', 'have', 'two', 'data', 'sets', 'and', 'want', 'to', 'find', 'the', 'nearest', 'neighbour', 'of', 'each', 'point', 'in', 'the', 'first', 'dataset', 'among', 'points', 'in', 'the', 'second', 'one', 'we', 'need', 'the', 'all', 'nearest', 'neighbour', 'operator', 'this', 'is', 'an', 'operator', 'in', 'spatial', 'databases', 'that', 'has', 'many', 'application', 'in', 'different', 'fields', 'such', 'as', 'gis', 'and', 'vlsi', 'circuit', 'design', 'existing', 'algorithms', 'for', 'calculating', 'this', 'operator', 'assume', 'that', 'there', 'is', 'no', 'pre', 'computation', 'on', 'these', 'data', 'sets', 'these', 'algorithms', 'has', 'onmd', 'time', 'complexity', 'where', 'n', 'and', 'm', 'are', 'the', 'number', 'of', 'points', 'in', 'two', 'data', 'sets', 'and', 'd', 'is', 'the', 'dimension', 'of', 'data', 'points', 'with', 'assumption', 'of', 'some', 'pre', 'computation', 'on', 'data', 'sets', 'algorithms', 'with', 'lower', 'time', 'complexity', 'can', 'be', 'obtained', 'one', 'of', 'the', 'most', 'common', 'pre', 'computation', 'on', 'spatial', 'data', 'is', 'delaunay', 'graphs', 'in', 'the', 'delaunay', 'graph', 'of', 'a', 'data', 'set', 'each', 'point', 'is', 'linked', 'to', 'its', 'nearest', 'neighbours', 'in', 'this', 'paper', 'we', 'introduce', 'an', 'algorithm', 'for', 'computing', 'the', 'all', 'nearest', 'neighbour', 'operator', 'on', 'spatial', 'data', 'sets', 'based', 'on', 'their', 'delaunay', 'graphs', 'the', 'performance', 'of', 'this', 'algorithm', 'is', 'compared', 'with', 'one', 'of', 'the', 'best', 'existing', 'algorithms', 'for', 'computing', 'ann', 'operator', 'in', 'terms', 'of', 'cpu', 'time', 'and', 'the', 'number', 'of', 'ios', 'the', 'experimental', 'results', 'show', 'that', 'this', 'algorithm', 'has', 'better', 'performance', 'than', 'the', 'other']] | [-0.12398656575315169, 0.010194165752621385, -0.030458522677097633, 0.03760486508546406, -0.0472141500643414, -0.12513232146443773, 0.07014047644148325, 0.4207298839824715, -0.2510439215710495, -0.3230851428371805, 0.13524350273796326, -0.3241752913122736, -0.13586320449229203, 0.2017435928881039, -0.06304413550333705, 0.05678118613957999, 0.09726990275489895, 0.09512575888322387, -0.03853872992606735, -0.3207606870051449, 0.33826588512429795, 0.021623562770594216, 0.24680377320827385, 0.004673070962662282, 0.060193035792073475, -0.011200805437629637, -0.041264367424815464, 0.011819374297660041, -0.07415792018403317, 0.13303843332827991, 0.24855261489946917, 0.19796373370015805, 0.29396128551899525, -0.41947279996486103, -0.13334042335531993, 0.1794627973391418, 0.11978994833377464, 0.09534350490750934, -0.009665879403501929, -0.24134817262796532, 0.10957618802785873, -0.08521331216384104, -0.04884745454717122, -0.07514855172260156, 0.05065771854905932, 0.028393834992986765, -0.26688143327958197, 0.004427985904585336, 0.037073734009993864, 0.06900795240063166, -0.018891664075098284, -0.14543318375045264, 0.0006644471609236106, 0.14337920368177218, -0.001966173834828795, 0.06764968053622235, 0.07035294683326197, -0.0810596042499396, -0.19155343773140424, 0.37715149970257267, -0.012600554834170028, -0.21120109430577264, 0.2063428190034018, -0.1216854711562611, -0.17036395057684917, 0.07566478141192076, 0.17553808545054878, 0.0964352279127652, -0.15035854189484865, 0.1192794266381247, -0.04505764731039531, 0.14096493970131466, 0.04146846958013153, 0.03418582112242688, 0.1098242647808657, 0.1949203335083931, 0.11425676594622172, 0.12032319260350595, -0.11095843339847301, -0.08803713491753391, -0.24662687679401774, -0.14930924526775696, -0.27260901154117917, -0.05007589021405196, -0.19965322646794667, -0.17644544696696282, 0.38414797828429276, 0.19283676898142926, 0.222789052390192, 0.08158816342300551, 0.33287621431214653, 0.07570021231170881, 0.09676927874868078, 0.17465787928704407, 0.16806041107443837, 0.05084289389927894, 0.08525523376664605, -0.16486163414097482, 0.058922492011544716, 0.09750121795000949] |
1,802.09595 | Elliptic flow from Coulomb interaction and low density elastic
scattering | In high energy heavy ion collisions and interacting cold atom systems, large
elliptic flow anisotropies have been observed. For the large opacity
($\rho\sigma L\sim 10^{3}$) of the latter hydrodynamics is a natural
consequence, but for the small opacity ($\rho\sigma L\sim 1$) of the former
hydrodynamic description is questionable. To shed light onto the situation, we
simulate the expansion of a low density Argon ion (or atom) system, initially
trapped in an elliptical region, under the Coulomb interaction (or elastic
scattering). Significant elliptic anisotropy is found in both cases, and the
anisotropy depends on the initial spatial eccentricity and the density of the
system. The results may provide insights into the physics of anisotropic flow
in high energy heavy ion collisions and its role in the study of quantum
chromodynamics.
| nucl-th nucl-ex | in high energy heavy ion collisions and interacting cold atom systems large elliptic flow anisotropies have been observed for the large opacity rhosigma lsim 103 of the latter hydrodynamics is a natural consequence but for the small opacity rhosigma lsim 1 of the former hydrodynamic description is questionable to shed light onto the situation we simulate the expansion of a low density argon ion or atom system initially trapped in an elliptical region under the coulomb interaction or elastic scattering significant elliptic anisotropy is found in both cases and the anisotropy depends on the initial spatial eccentricity and the density of the system the results may provide insights into the physics of anisotropic flow in high energy heavy ion collisions and its role in the study of quantum chromodynamics | [['in', 'high', 'energy', 'heavy', 'ion', 'collisions', 'and', 'interacting', 'cold', 'atom', 'systems', 'large', 'elliptic', 'flow', 'anisotropies', 'have', 'been', 'observed', 'for', 'the', 'large', 'opacity', 'rhosigma', 'lsim', '103', 'of', 'the', 'latter', 'hydrodynamics', 'is', 'a', 'natural', 'consequence', 'but', 'for', 'the', 'small', 'opacity', 'rhosigma', 'lsim', '1', 'of', 'the', 'former', 'hydrodynamic', 'description', 'is', 'questionable', 'to', 'shed', 'light', 'onto', 'the', 'situation', 'we', 'simulate', 'the', 'expansion', 'of', 'a', 'low', 'density', 'argon', 'ion', 'or', 'atom', 'system', 'initially', 'trapped', 'in', 'an', 'elliptical', 'region', 'under', 'the', 'coulomb', 'interaction', 'or', 'elastic', 'scattering', 'significant', 'elliptic', 'anisotropy', 'is', 'found', 'in', 'both', 'cases', 'and', 'the', 'anisotropy', 'depends', 'on', 'the', 'initial', 'spatial', 'eccentricity', 'and', 'the', 'density', 'of', 'the', 'system', 'the', 'results', 'may', 'provide', 'insights', 'into', 'the', 'physics', 'of', 'anisotropic', 'flow', 'in', 'high', 'energy', 'heavy', 'ion', 'collisions', 'and', 'its', 'role', 'in', 'the', 'study', 'of', 'quantum', 'chromodynamics']] | [-0.13551303318542854, 0.22676603120037395, -0.10095198978778235, 0.09089703830374159, 0.025198658890372445, -0.11216587242995237, -0.06594746570507165, 0.312737699273194, -0.23683105474843305, -0.30545628709039946, 0.031087521343607483, -0.3215726096645113, 0.022891931973989737, 0.16212550541674792, 0.024359888192076712, 0.046722337807521455, 0.0674975054165305, -0.0014924545961435768, -0.03513387797126012, -0.19046893901401019, 0.29538342007977325, 0.11038002669504418, 0.2530932978838827, 0.15434022019427746, 0.06577430624883016, 0.006554908068605172, 0.02216037993803043, -0.008125515308948221, -0.13438710048000596, 0.06402628644696227, 0.21145251360153347, -0.011863912151613844, 0.21133201427815496, -0.4519074354753938, -0.2180266823879508, 0.07305177580204236, 0.16393456915790547, 0.14356306439280048, -0.10148118765277485, -0.22118438148235745, 0.004886851270589255, -0.1860461437266118, -0.18709049591895685, -0.034456570044362034, 0.05090202440421075, 0.038195205556387585, -0.28738286573252125, 0.12913415687837343, 0.04594632310886658, 0.06832056828998317, -0.06412333363302543, -0.11824570172971706, -0.038368996833775974, 0.009477041051686966, 0.04645638149448259, 0.035642865054352685, 0.17085622536567177, -0.1718144485846075, 0.011790818679182566, 0.43974950531851353, -0.06727337617383794, -0.12630799637977466, 0.20331003322706434, -0.20928187280633423, -0.10198277925942527, 0.16640860590246298, 0.2512212799674319, 0.0911159468273264, -0.10223233803038219, 0.08266820353947674, -0.030156859751725787, 0.16674671616933065, 0.06738797569459723, 0.05896050311162952, 0.24352130369651456, 0.1843852939539004, 0.003557828533853036, 0.09633264833979593, -0.11804819101640998, -0.0992187419689672, -0.28189613076302317, -0.13325825510113393, -0.17359699696562317, 0.055371070524331094, -0.12365714378985251, -0.13658437380466118, 0.3354591525716133, 0.11736942468618959, 0.21334542350865207, -0.09084087817987442, 0.2875767485346905, 0.1280435582247469, 0.02707719288463163, 0.08416383646702928, 0.2954540477935658, 0.13989733568168888, 0.13964773214588216, -0.2924902302631747, 0.04551119121899756, 0.025281591147776377] |
1,802.09596 | Tunability: Importance of Hyperparameters of Machine Learning Algorithms | Modern supervised machine learning algorithms involve hyperparameters that
have to be set before running them. Options for setting hyperparameters are
default values from the software package, manual configuration by the user or
configuring them for optimal predictive performance by a tuning procedure. The
goal of this paper is two-fold. Firstly, we formalize the problem of tuning
from a statistical point of view, define data-based defaults and suggest
general measures quantifying the tunability of hyperparameters of algorithms.
Secondly, we conduct a large-scale benchmarking study based on 38 datasets from
the OpenML platform and six common machine learning algorithms. We apply our
measures to assess the tunability of their parameters. Our results yield
default values for hyperparameters and enable users to decide whether it is
worth conducting a possibly time consuming tuning strategy, to focus on the
most important hyperparameters and to chose adequate hyperparameter spaces for
tuning.
| stat.ML | modern supervised machine learning algorithms involve hyperparameters that have to be set before running them options for setting hyperparameters are default values from the software package manual configuration by the user or configuring them for optimal predictive performance by a tuning procedure the goal of this paper is twofold firstly we formalize the problem of tuning from a statistical point of view define databased defaults and suggest general measures quantifying the tunability of hyperparameters of algorithms secondly we conduct a largescale benchmarking study based on 38 datasets from the openml platform and six common machine learning algorithms we apply our measures to assess the tunability of their parameters our results yield default values for hyperparameters and enable users to decide whether it is worth conducting a possibly time consuming tuning strategy to focus on the most important hyperparameters and to chose adequate hyperparameter spaces for tuning | [['modern', 'supervised', 'machine', 'learning', 'algorithms', 'involve', 'hyperparameters', 'that', 'have', 'to', 'be', 'set', 'before', 'running', 'them', 'options', 'for', 'setting', 'hyperparameters', 'are', 'default', 'values', 'from', 'the', 'software', 'package', 'manual', 'configuration', 'by', 'the', 'user', 'or', 'configuring', 'them', 'for', 'optimal', 'predictive', 'performance', 'by', 'a', 'tuning', 'procedure', 'the', 'goal', 'of', 'this', 'paper', 'is', 'twofold', 'firstly', 'we', 'formalize', 'the', 'problem', 'of', 'tuning', 'from', 'a', 'statistical', 'point', 'of', 'view', 'define', 'databased', 'defaults', 'and', 'suggest', 'general', 'measures', 'quantifying', 'the', 'tunability', 'of', 'hyperparameters', 'of', 'algorithms', 'secondly', 'we', 'conduct', 'a', 'largescale', 'benchmarking', 'study', 'based', 'on', '38', 'datasets', 'from', 'the', 'openml', 'platform', 'and', 'six', 'common', 'machine', 'learning', 'algorithms', 'we', 'apply', 'our', 'measures', 'to', 'assess', 'the', 'tunability', 'of', 'their', 'parameters', 'our', 'results', 'yield', 'default', 'values', 'for', 'hyperparameters', 'and', 'enable', 'users', 'to', 'decide', 'whether', 'it', 'is', 'worth', 'conducting', 'a', 'possibly', 'time', 'consuming', 'tuning', 'strategy', 'to', 'focus', 'on', 'the', 'most', 'important', 'hyperparameters', 'and', 'to', 'chose', 'adequate', 'hyperparameter', 'spaces', 'for', 'tuning']] | [-0.028897688162755477, -0.0013248206862592942, -0.06013070786218733, 0.08820007586842148, -0.14900397368681248, -0.21475329426155515, 0.1412290099885455, 0.4708611350761701, -0.24809627052897282, -0.36491967660808705, 0.09110953869054506, -0.22167364042690854, -0.13777441734428938, 0.23950503004415039, -0.09405824697372338, 0.10884925740558099, 0.1386780832217981, -0.03006759565004645, -0.053675422877111564, -0.2995430185524938, 0.33166742202991695, 0.08006624467926074, 0.31155122165912635, 0.001353490102576883, 0.08856620088882253, 0.005395961761130148, -0.04560936071227419, -0.020460653323712056, -0.14514102888548122, 0.1422864338534578, 0.33041244201770387, 0.21362715416443567, 0.398835285911209, -0.3662585725382685, -0.15929942558621604, 0.12141457158886375, 0.10242966761133213, 0.06987100668111577, 0.01896915246081883, -0.2725256232621327, 0.06312556851022137, -0.1554271404404984, -0.04490429047201697, -0.17862491202476907, -0.025968588285837067, 0.004843954838914414, -0.33209840298872695, -0.025981585278290593, 0.013851780337536682, 0.11119836688118234, -0.022718978173431163, -0.14014536852562443, 0.068566314412013, 0.1491888621742263, 0.07804521073727574, 0.006821290333117422, 0.20657867033430055, -0.1270805687256068, -0.1811138356857206, 0.34601153167959764, 0.00135255297358875, -0.2288029129961378, 0.1679353446313754, 0.010272499703330128, -0.15863408088964753, 0.07636668863235846, 0.22202832304253817, 0.10295325804705897, -0.17776754025484703, 0.0614885462317233, 0.03447304197669999, 0.192503425949899, 0.023208823849204672, -0.015988153556588246, 0.17201703975825533, 0.23704941125510082, 0.07373551868559308, 0.1382146133755793, -0.05796201099930268, -0.08551058651718361, -0.24818230979144573, -0.12253097042820914, -0.17081663639233638, -0.005720319109968841, -0.13337463026265103, -0.1616606288685221, 0.4252321482444667, 0.2720321175604038, 0.16700661466026373, 0.0728075496911403, 0.31660293196232303, 0.039272325589542426, 0.07110148904468762, 0.10188201232494352, 0.20056143896303408, 0.002349965248818267, 0.0947599120355173, -0.18150843642588246, 0.12335503727758992, 0.0036102678301450732] |
1,802.09597 | Mapping the Invocation Structure of Online Political Interaction | The surge in political information, discourse, and interaction has been one
of the most important developments in social media over the past several years.
There is rich structure in the interaction among different viewpoints on the
ideological spectrum. However, we still have only a limited analytical
vocabulary for expressing the ways in which these viewpoints interact.
In this paper, we develop network-based methods that operate on the ways in
which users share content; we construct \emph{invocation graphs} on Web domains
showing the extent to which pages from one domain are invoked by users to reply
to posts containing pages from other domains. When we locate the domains on a
political spectrum induced from the data, we obtain an embedded graph showing
how these interaction links span different distances on the spectrum. The
structure of this embedded network, and its evolution over time, helps us
derive macro-level insights about how political interaction unfolded through
2016, leading up to the US Presidential election. In particular, we find that
the domains invoked in replies spanned increasing distances on the spectrum
over the months approaching the election, and that there was clear asymmetry
between the left-to-right and right-to-left patterns of linkage.
| cs.SI cs.CY cs.HC physics.soc-ph | the surge in political information discourse and interaction has been one of the most important developments in social media over the past several years there is rich structure in the interaction among different viewpoints on the ideological spectrum however we still have only a limited analytical vocabulary for expressing the ways in which these viewpoints interact in this paper we develop networkbased methods that operate on the ways in which users share content we construct emphinvocation graphs on web domains showing the extent to which pages from one domain are invoked by users to reply to posts containing pages from other domains when we locate the domains on a political spectrum induced from the data we obtain an embedded graph showing how these interaction links span different distances on the spectrum the structure of this embedded network and its evolution over time helps us derive macrolevel insights about how political interaction unfolded through 2016 leading up to the us presidential election in particular we find that the domains invoked in replies spanned increasing distances on the spectrum over the months approaching the election and that there was clear asymmetry between the lefttoright and righttoleft patterns of linkage | [['the', 'surge', 'in', 'political', 'information', 'discourse', 'and', 'interaction', 'has', 'been', 'one', 'of', 'the', 'most', 'important', 'developments', 'in', 'social', 'media', 'over', 'the', 'past', 'several', 'years', 'there', 'is', 'rich', 'structure', 'in', 'the', 'interaction', 'among', 'different', 'viewpoints', 'on', 'the', 'ideological', 'spectrum', 'however', 'we', 'still', 'have', 'only', 'a', 'limited', 'analytical', 'vocabulary', 'for', 'expressing', 'the', 'ways', 'in', 'which', 'these', 'viewpoints', 'interact', 'in', 'this', 'paper', 'we', 'develop', 'networkbased', 'methods', 'that', 'operate', 'on', 'the', 'ways', 'in', 'which', 'users', 'share', 'content', 'we', 'construct', 'emphinvocation', 'graphs', 'on', 'web', 'domains', 'showing', 'the', 'extent', 'to', 'which', 'pages', 'from', 'one', 'domain', 'are', 'invoked', 'by', 'users', 'to', 'reply', 'to', 'posts', 'containing', 'pages', 'from', 'other', 'domains', 'when', 'we', 'locate', 'the', 'domains', 'on', 'a', 'political', 'spectrum', 'induced', 'from', 'the', 'data', 'we', 'obtain', 'an', 'embedded', 'graph', 'showing', 'how', 'these', 'interaction', 'links', 'span', 'different', 'distances', 'on', 'the', 'spectrum', 'the', 'structure', 'of', 'this', 'embedded', 'network', 'and', 'its', 'evolution', 'over', 'time', 'helps', 'us', 'derive', 'macrolevel', 'insights', 'about', 'how', 'political', 'interaction', 'unfolded', 'through', '2016', 'leading', 'up', 'to', 'the', 'us', 'presidential', 'election', 'in', 'particular', 'we', 'find', 'that', 'the', 'domains', 'invoked', 'in', 'replies', 'spanned', 'increasing', 'distances', 'on', 'the', 'spectrum', 'over', 'the', 'months', 'approaching', 'the', 'election', 'and', 'that', 'there', 'was', 'clear', 'asymmetry', 'between', 'the', 'lefttoright', 'and', 'righttoleft', 'patterns', 'of', 'linkage']] | [-0.11151675528095921, 0.055709500057692284, -0.08287333937751472, 0.07219920576044016, -0.12416539404764582, -0.09163500292806373, 0.0820514712077613, 0.42245097284452343, -0.27532097766914154, -0.3415692625567317, 0.07700253986249848, -0.33466830126669767, -0.1619240267407767, 0.1678385871245136, -0.06598430254962295, -0.048287570946647936, 0.04951744655869445, 0.05938934540490107, -0.0076480998588744934, -0.2862487189426878, 0.3389026017025664, 0.001581522965167022, 0.2914280537622791, 0.07251284877313491, 0.06284631374684087, 0.0005006543580414158, -0.06619751892451729, 0.010732118272559946, -0.1423204409508186, 0.15929777517692634, 0.3054429408060672, 0.17776492875121647, 0.28198155285600496, -0.4535706659698175, -0.2095084660840981, 0.09737977334440742, 0.14659725347289113, 0.09736043060384335, -0.017161693855792245, -0.3177812121456907, 0.04968064268385725, -0.19021557408209167, -0.04123175834134525, -0.0610165056049092, 0.057478510575102906, 0.005029900719373658, -0.1809876417077137, 0.032201654871697634, 0.03400822311083843, 0.08254275559352672, -0.01884453621875894, -0.056025867705585014, 0.0023458230983922066, 0.2403075696577672, 0.09955742574007041, 0.0018230371671070686, 0.09355878027165498, -0.13092029742582947, -0.14706183843105575, 0.3704553958199614, -0.006126090463094071, -0.13924534741446984, 0.23036849393381034, -0.12565668438304672, -0.14887284189557695, 0.0846185679060445, 0.23140264598014812, 0.07826027462029668, -0.13930853826864872, 0.03982679196039443, -0.05790770855425568, 0.1978625017040105, 0.13293623957754475, 0.017752834442499265, 0.22484721135043975, 0.14892889050130106, 0.07125790401395145, 0.09596200510699121, -0.046906096530527026, -0.1395651333803805, -0.2159169087880196, -0.09507208662368927, -0.14851941394486598, 0.03465448973263253, -0.09690664382740542, -0.12262720020953566, 0.4554105728094903, 0.1879240568081031, 0.20573865006706316, 0.0008089753142225423, 0.24187028752039993, 0.008882435397435056, 0.10055978066906837, 0.09410857781530263, 0.19446081215781824, 0.043624086886387775, 0.1750322772001097, -0.1377195828304417, 0.11768149858048395, -0.0011338936901480264] |
1,802.09598 | The Beta-Bernoulli process and algebraic effects | In this paper we use the framework of algebraic effects from programming
language theory to analyze the Beta-Bernoulli process, a standard building
block in Bayesian models. Our analysis reveals the importance of abstract data
types, and two types of program equations, called commutativity and
discardability. We develop an equational theory of terms that use the
Beta-Bernoulli process, and show that the theory is complete with respect to
the measure-theoretic semantics, and also in the syntactic sense of Post. Our
analysis has a potential for being generalized to other stochastic processes
relevant to Bayesian modelling, yielding new understanding of these processes
from the perspective of programming.
| cs.PL | in this paper we use the framework of algebraic effects from programming language theory to analyze the betabernoulli process a standard building block in bayesian models our analysis reveals the importance of abstract data types and two types of program equations called commutativity and discardability we develop an equational theory of terms that use the betabernoulli process and show that the theory is complete with respect to the measuretheoretic semantics and also in the syntactic sense of post our analysis has a potential for being generalized to other stochastic processes relevant to bayesian modelling yielding new understanding of these processes from the perspective of programming | [['in', 'this', 'paper', 'we', 'use', 'the', 'framework', 'of', 'algebraic', 'effects', 'from', 'programming', 'language', 'theory', 'to', 'analyze', 'the', 'betabernoulli', 'process', 'a', 'standard', 'building', 'block', 'in', 'bayesian', 'models', 'our', 'analysis', 'reveals', 'the', 'importance', 'of', 'abstract', 'data', 'types', 'and', 'two', 'types', 'of', 'program', 'equations', 'called', 'commutativity', 'and', 'discardability', 'we', 'develop', 'an', 'equational', 'theory', 'of', 'terms', 'that', 'use', 'the', 'betabernoulli', 'process', 'and', 'show', 'that', 'the', 'theory', 'is', 'complete', 'with', 'respect', 'to', 'the', 'measuretheoretic', 'semantics', 'and', 'also', 'in', 'the', 'syntactic', 'sense', 'of', 'post', 'our', 'analysis', 'has', 'a', 'potential', 'for', 'being', 'generalized', 'to', 'other', 'stochastic', 'processes', 'relevant', 'to', 'bayesian', 'modelling', 'yielding', 'new', 'understanding', 'of', 'these', 'processes', 'from', 'the', 'perspective', 'of', 'programming']] | [-0.040943799775469907, 0.0016654828495330338, -0.14065097455974096, 0.08882005517769077, -0.11261234575067647, -0.10050312252357028, 0.067610258525327, 0.31779648817609996, -0.34160417418640393, -0.2827007631450005, 0.09973958648557667, -0.2503241647008018, -0.20183490480009753, 0.17355811749943173, -0.08354516608568911, 0.03639035756126619, 0.05552954242851298, 0.017854279265380822, -0.06381858645741326, -0.1934227638412267, 0.3602398939233703, 0.03728943942181873, 0.2679706014504728, 0.024389322372511603, 0.10546151702762402, 0.04365575077155462, -0.07409458517045445, 0.019311321661986697, -0.13451146575257902, 0.18019392838379225, 0.29718383747453675, 0.21595733499046987, 0.29456294793635607, -0.4404097351585873, -0.21074745972425893, 0.06221113816942447, 0.08653550087267202, 0.11663446683759013, -0.020227289201172356, -0.2776682522112074, 0.08814728903011061, -0.17789377969725487, -0.07705820622280814, -0.11852131949966022, -0.00806064147932025, -0.011368415837820906, -0.272112190784985, 0.019664299318090064, 0.13216735935286403, 0.08637091156560928, -0.03728324733226775, -0.09927213911858136, -0.0034407542642349233, 0.08489479269617452, 0.040969523157400545, -0.011539999019497862, 0.09973654076188374, -0.08837261875473465, -0.1929789339427281, 0.3699543796425972, -0.06200044494471513, -0.20632186526647553, 0.2262986810439123, -0.06960897392575414, -0.2034177595946508, 0.059618496018139504, 0.19756172999488905, 0.12373102565582556, -0.19694465059840766, 0.11579906388606805, -0.012879816837644635, 0.14295183092270655, 0.004507523907635074, 0.025326815505440418, 0.17962314038931465, 0.21048366689893344, 0.003711432943908641, 0.14736831387954924, -0.010882608055208739, -0.15841167964614356, -0.3288045053441937, -0.16301335180805138, -0.07234345629918747, -0.010881285140595328, -0.10570812611695146, -0.20138753595976874, 0.39129279726722205, 0.22696480734381252, 0.1274704534578352, 0.12182802336890465, 0.28195336393009013, 0.12905930192881407, 0.03940032703730349, 0.032473668998975955, 0.15304923322624886, 0.1577883151700147, 0.0962245336536748, -0.16339822359777129, 0.07887595273608056, 0.07369041494362485] |
1,802.09599 | Two Families of Monogenic $S_4$ Quartic Number Fields | Consider the integral polynomials $f_{a,b}(x)=x^4+ax+b$ and
$g_{c,d}(x)=x^4+cx^3+d$. Suppose $f_{a,b}(x)$ and $g_{c,d}(x)$ are irreducible,
$b\mid a$, and the integers $b$, $d$, $256d-27c^4$, and
$\dfrac{256b^3-27a^4}{\gcd(256b^3,27a^4)}$ are all square-free. Using the
Montes algorithm, we show that a root of $f_{a,b}(x)$ or $g_{c,d}(x)$ defines a
monogenic extension of $\mathbb{Q}$ and serves as a generator for a power
integral basis of the ring of integers. In fact, we show monogeneity for
slightly more general families. Further, we obtain lower bounds on the density
of polynomials generating monogenic $S_4$ fields within the families
$f_{b,b}(x)$ and $g_{1,d}(x)$.
| math.NT | consider the integral polynomials f_abxx4axb and g_cdxx4cx3d suppose f_abx and g_cdx are irreducible bmid a and the integers b d 256d27c4 and dfrac256b327a4gcd256b327a4 are all squarefree using the montes algorithm we show that a root of f_abx or g_cdx defines a monogenic extension of mathbbq and serves as a generator for a power integral basis of the ring of integers in fact we show monogeneity for slightly more general families further we obtain lower bounds on the density of polynomials generating monogenic s_4 fields within the families f_bbx and g_1dx | [['consider', 'the', 'integral', 'polynomials', 'f_abxx4axb', 'and', 'g_cdxx4cx3d', 'suppose', 'f_abx', 'and', 'g_cdx', 'are', 'irreducible', 'bmid', 'a', 'and', 'the', 'integers', 'b', 'd', '256d27c4', 'and', 'dfrac256b327a4gcd256b327a4', 'are', 'all', 'squarefree', 'using', 'the', 'montes', 'algorithm', 'we', 'show', 'that', 'a', 'root', 'of', 'f_abx', 'or', 'g_cdx', 'defines', 'a', 'monogenic', 'extension', 'of', 'mathbbq', 'and', 'serves', 'as', 'a', 'generator', 'for', 'a', 'power', 'integral', 'basis', 'of', 'the', 'ring', 'of', 'integers', 'in', 'fact', 'we', 'show', 'monogeneity', 'for', 'slightly', 'more', 'general', 'families', 'further', 'we', 'obtain', 'lower', 'bounds', 'on', 'the', 'density', 'of', 'polynomials', 'generating', 'monogenic', 's_4', 'fields', 'within', 'the', 'families', 'f_bbx', 'and', 'g_1dx']] | [-0.2091137894133198, 0.09135283951153174, -0.07861085661491495, 0.05967321077844611, -0.050455935684573135, -0.1156790880313902, -0.027383819649306435, 0.31979945617049566, -0.28032262654354173, -0.20093447058519096, 0.09623188636823339, -0.2727544432574952, -0.15490120487506098, 0.24437302886508405, -0.03840550298538105, 0.013439627019343552, 0.0059830071289598205, 0.12498234636667702, -0.0781128812138635, -0.27489063100325933, 0.32307160516947875, -0.04292118764355963, 0.16206549870333187, 0.010844249479518628, 0.11824934689879969, 0.020159994964890272, -0.018076490570595603, -0.045233768372175596, -0.15731518400912417, 0.13949899655410353, 0.23422410376772376, 0.14087638843597639, 0.22956547057141125, -0.3527996308963608, -0.10925153854739979, 0.2039626379623825, 0.14680686713782726, 0.01973701250038029, -0.036046296995697995, -0.21232817733062453, 0.10005927732340808, -0.17269454588308747, -0.14327512766568012, -0.08508040465092585, 0.06808207347920095, 0.07871736689574188, -0.3767562197912254, 0.025519421178974027, 0.0847009542113584, 0.13829291042768294, -0.037851785690477695, -0.2124620097571478, -0.008269078903084185, 0.007072814392431835, -0.037801703997243793, 0.03495697106269223, 0.04117130969915493, -0.08275259849126738, -0.11714405147933665, 0.3636158061110311, -0.07917695040642111, -0.22117976776473683, 0.08920591099210727, -0.1644711482947991, -0.15449238240856816, 0.09322064742445946, 0.122060739768692, 0.1441559819849553, -0.036967749121012514, 0.17206469058191382, -0.152153164868381, 0.10415399869053084, 0.11478087709883204, 0.004221211099152074, 0.15148481520045157, 0.03067555010640695, 0.08036866462767918, 0.17469356973069133, -0.018043304181278304, -0.0003762922629162117, -0.34109333211579074, -0.2049515121386467, -0.16046830485891092, 0.08142060331747304, -0.10680533072194028, -0.17148233382002576, 0.44132765964317466, 0.10167691206996456, 0.18470423922724563, 0.14973804012032937, 0.20883821042967432, 0.11019336248109876, 0.06765797357491712, 0.10357834056686656, 0.06856583368412598, 0.16608378536895746, -0.03221438668185362, -0.10970528607751116, -0.0032247923340441454, 0.15206957062602872] |
1,802.096 | Optimal Control of Autonomous Vehicles Approaching A Traffic Light | This paper devotes to the development of an optimal acceleration/speed
profile for autonomous vehicles approaching a traffic light. The design
objective is to achieve both short travel time and low energy consumption as
well as avoid idling at a red light. This is achieved by taking full advantage
of the traffic light information based on vehicle-to-infrastructure
communication. The problem is modeled as a mixed integer programming, which is
equivalently transformed into optimal control problems by relaxing the integer
constraint. Then the direct adjoining approach is used to solve both free and
fixed terminal time optimal control problems subject to state constraints. By
an elaborate analysis, we are able to produce a real-time online analytical
solution, distinguishing our method from most existing approaches based on
numerical calculations. Extensive simulations are executed to compare the
performance of autonomous vehicles under the proposed speed profile and human
driving vehicles. The results show quantitatively the advantages of the
proposed algorithm in terms of energy consumption and travel time.
| eess.SP | this paper devotes to the development of an optimal accelerationspeed profile for autonomous vehicles approaching a traffic light the design objective is to achieve both short travel time and low energy consumption as well as avoid idling at a red light this is achieved by taking full advantage of the traffic light information based on vehicletoinfrastructure communication the problem is modeled as a mixed integer programming which is equivalently transformed into optimal control problems by relaxing the integer constraint then the direct adjoining approach is used to solve both free and fixed terminal time optimal control problems subject to state constraints by an elaborate analysis we are able to produce a realtime online analytical solution distinguishing our method from most existing approaches based on numerical calculations extensive simulations are executed to compare the performance of autonomous vehicles under the proposed speed profile and human driving vehicles the results show quantitatively the advantages of the proposed algorithm in terms of energy consumption and travel time | [['this', 'paper', 'devotes', 'to', 'the', 'development', 'of', 'an', 'optimal', 'accelerationspeed', 'profile', 'for', 'autonomous', 'vehicles', 'approaching', 'a', 'traffic', 'light', 'the', 'design', 'objective', 'is', 'to', 'achieve', 'both', 'short', 'travel', 'time', 'and', 'low', 'energy', 'consumption', 'as', 'well', 'as', 'avoid', 'idling', 'at', 'a', 'red', 'light', 'this', 'is', 'achieved', 'by', 'taking', 'full', 'advantage', 'of', 'the', 'traffic', 'light', 'information', 'based', 'on', 'vehicletoinfrastructure', 'communication', 'the', 'problem', 'is', 'modeled', 'as', 'a', 'mixed', 'integer', 'programming', 'which', 'is', 'equivalently', 'transformed', 'into', 'optimal', 'control', 'problems', 'by', 'relaxing', 'the', 'integer', 'constraint', 'then', 'the', 'direct', 'adjoining', 'approach', 'is', 'used', 'to', 'solve', 'both', 'free', 'and', 'fixed', 'terminal', 'time', 'optimal', 'control', 'problems', 'subject', 'to', 'state', 'constraints', 'by', 'an', 'elaborate', 'analysis', 'we', 'are', 'able', 'to', 'produce', 'a', 'realtime', 'online', 'analytical', 'solution', 'distinguishing', 'our', 'method', 'from', 'most', 'existing', 'approaches', 'based', 'on', 'numerical', 'calculations', 'extensive', 'simulations', 'are', 'executed', 'to', 'compare', 'the', 'performance', 'of', 'autonomous', 'vehicles', 'under', 'the', 'proposed', 'speed', 'profile', 'and', 'human', 'driving', 'vehicles', 'the', 'results', 'show', 'quantitatively', 'the', 'advantages', 'of', 'the', 'proposed', 'algorithm', 'in', 'terms', 'of', 'energy', 'consumption', 'and', 'travel', 'time']] | [-0.13772115918402017, 0.03957655558957535, -0.09713547213425848, 0.036153675167695645, -0.10041183600933548, -0.1606615567179911, 0.07312743718938708, 0.38682538001266725, -0.27646877170194717, -0.35399453528796787, 0.1440724506110033, -0.25538396590212187, -0.1269134559977137, 0.23520828141156652, -0.10674001995268409, 0.10916781820359703, 0.0858601035537381, 0.03231503016478239, -0.03264543031445173, -0.25264508790262274, 0.2337686848409611, 0.0440018839614203, 0.31866784800598225, 0.07012475301415882, 0.14693140079041633, 0.00804641835414376, -0.014858720638429277, 0.03253561318309212, -0.083930854819875, 0.11965377629017515, 0.2883392154393386, 0.15742494520142766, 0.3194978730467382, -0.48491485744851864, -0.23373444342380104, 0.09503187428862771, 0.1335817114707151, 0.058613848217557316, -0.04312899108387621, -0.28998582943862566, 0.09189877454962787, -0.15147426138214903, -0.09490886580576104, -0.041500044570938664, -0.025379537821153146, 0.045668979338227424, -0.2990301537493164, 0.004768887908980708, -0.0205587947182643, 0.02318852510158811, -0.08613550097344477, -0.08405364312494368, 0.0009906831128876999, 0.16472407835007194, 0.06452706386335194, 0.0149436834635373, 0.13368182505646642, -0.11141785612741223, -0.149132967759438, 0.41173873319536264, -0.04398350197281917, -0.20640407951171597, 0.14887488137165006, -0.002230614069149332, -0.06806953298213657, 0.14441097965121177, 0.23061601488502478, 0.1211610431411515, -0.16160200010025244, 0.013081716912251504, -0.0001995531525005775, 0.17055513787488996, 0.040390259915813014, 0.011540390059717593, 0.1637539519297039, 0.22340416821416903, 0.14235214433672785, 0.1229245124821854, -0.05559483528468598, -0.1170012917872404, -0.24512829043633916, -0.11826007444971452, -0.18778763430627302, -0.002334959544327133, -0.07304142543669659, -0.07728060968420211, 0.3717813004962414, 0.17720839904586963, 0.1466693787527002, 0.1252063951159376, 0.41803018707622047, 0.15242204089374767, 0.018124784153323345, 0.11889118264126448, 0.1929370978064378, 0.041334550210668994, 0.13523124099531972, -0.2802959580725756, 0.07027145995518501, 0.03902880546774007] |
1,802.09601 | Subsequential tightness of the maximum of two dimensional
Ginzburg-Landau fields | We prove subsequential tightness of centered maxima of two-dimensional
Ginzburg-Landau fields with bounded elliptic contrast.
| math.PR | we prove subsequential tightness of centered maxima of twodimensional ginzburglandau fields with bounded elliptic contrast | [['we', 'prove', 'subsequential', 'tightness', 'of', 'centered', 'maxima', 'of', 'twodimensional', 'ginzburglandau', 'fields', 'with', 'bounded', 'elliptic', 'contrast']] | [-0.2686927522222201, 0.10805610747387012, -0.09622264802455902, 0.04602762671808402, -0.06886225963632266, -0.11417359563832481, 0.008646256228288015, 0.32593929866949717, -0.2927233283097545, -0.12287989122172197, 0.1137531156030794, -0.2979601537187894, -0.10670972342292467, 0.16552801405390102, -0.0502296249071757, 0.14450051101545494, -0.06611097579201063, 0.07292577102780343, -0.08609933679302534, -0.27377666234970094, 0.3516446163256963, -0.21115928317109744, 0.2292883463203907, 0.04995651096105576, 0.07808366054669022, 0.06806368132432301, 0.07040249618391196, 0.06111321349938711, -0.28202848273018993, 0.15655880154420931, 0.2513413769503435, -0.10574751963528493, 0.25618817855914433, -0.4064029778043429, -0.25267289380232494, 0.21070762490853667, 0.1542643037935098, -0.06966269022474686, -0.038166110419357815, -0.32696591764688493, 0.08304680908719698, 0.03082600093136231, -0.2606917506704728, -0.03229535698580245, -0.052265735001613696, 0.24619001435736815, -0.3156220073501269, 0.18782088762770097, 0.17573563137557358, 0.22752560743441183, -0.10291604877760013, -0.11138700004667043, -0.08824493984381358, -0.0949859763495624, 0.04631107181000213, 0.020527986188729603, 0.06296312296763062, -0.06899923533201217, -0.14599071939786276, 0.27926700717459124, -0.1622533893833558, -0.1547377275923888, 0.09954607983430226, -0.2780275278414289, -0.06863751765340567, 0.13372412957251073, 0.21744998246431352, 0.1853778103987376, -0.07599283556143442, 0.2605145886540413, -0.12187423296272755, 0.17573369132975739, 0.17528169887761275, 0.02041734295586745, 0.09032661455372969, 0.14207959274450938, 0.16803732862075169, 0.21130792507901788, -0.0987692702561617, -0.19046144969761372, -0.36614301800727844, -0.10313725887487332, -0.21769175827503204, 0.11693907820930084, -0.14082656170551974, -0.25251129157841207, 0.3414332153974101, 0.12138615592072408, 0.18167524735132853, 0.18801416736096144, 0.07977944314479828, 0.22522031317154567, -0.07055594697594643, 0.15387908862903715, 0.1628548674285412, 0.26315239270528157, 0.02943505880733331, -0.12495309909184774, -0.08013599819193283, 0.16352046830870676] |
1,802.09602 | Exoplanet Classification and Yield Estimates for Direct Imaging Missions | Future NASA concept missions that are currently under study, like Habitable
Exoplanet Imaging Mission (HabEx) & Large Ultra-Violet Optical Infra Red
(LUVOIR) Surveyor, would discover a large diversity of exoplanets. We propose
here a classification scheme that distinguishes exoplanets into different
categories based on their size and incident stellar flux, for the purpose of
providing the expected number of exoplanets observed (yield) with direct
imaging missions. The boundaries of this classification can be computed using
the known chemical behavior of gases and condensates at different pressures and
temperatures in a planetary atmosphere. In this study, we initially focus on
condensation curves for sphalerite ZnS, H2O, CO2 and CH4. The order in which
these species condense in a planetary atmosphere define the boundaries between
different classes of planets. Broadly, the planets are divided into rocky (0.5
- 1.0RE), super-Earths (1.0- 1.75RE), sub-Neptunes (1.75-3.5RE), sub-Jovians
(3.5 - 6.0RE) and Jovians (6-14.3RE) based on their planet sizes, and 'hot',
'warm' and 'cold' based on the incident stellar flux. We then calculate planet
occurrence rates within these boundaries for different kinds of exoplanets,
\eta_{planet}, using the community co-ordinated results of NASA's Exoplanet
Program Analysis Group's Science Analysis Group-13 (SAG-13). These occurrence
rate estimates are in turn used to estimate the expected exoplanet yields for
direct imaging missions of different telescope diameter.
| astro-ph.EP | future nasa concept missions that are currently under study like habitable exoplanet imaging mission habex large ultraviolet optical infra red luvoir surveyor would discover a large diversity of exoplanets we propose here a classification scheme that distinguishes exoplanets into different categories based on their size and incident stellar flux for the purpose of providing the expected number of exoplanets observed yield with direct imaging missions the boundaries of this classification can be computed using the known chemical behavior of gases and condensates at different pressures and temperatures in a planetary atmosphere in this study we initially focus on condensation curves for sphalerite zns h2o co2 and ch4 the order in which these species condense in a planetary atmosphere define the boundaries between different classes of planets broadly the planets are divided into rocky 05 10re superearths 10 175re subneptunes 17535re subjovians 35 60re and jovians 6143re based on their planet sizes and hot warm and cold based on the incident stellar flux we then calculate planet occurrence rates within these boundaries for different kinds of exoplanets eta_planet using the community coordinated results of nasas exoplanet program analysis groups science analysis group13 sag13 these occurrence rate estimates are in turn used to estimate the expected exoplanet yields for direct imaging missions of different telescope diameter | [['future', 'nasa', 'concept', 'missions', 'that', 'are', 'currently', 'under', 'study', 'like', 'habitable', 'exoplanet', 'imaging', 'mission', 'habex', 'large', 'ultraviolet', 'optical', 'infra', 'red', 'luvoir', 'surveyor', 'would', 'discover', 'a', 'large', 'diversity', 'of', 'exoplanets', 'we', 'propose', 'here', 'a', 'classification', 'scheme', 'that', 'distinguishes', 'exoplanets', 'into', 'different', 'categories', 'based', 'on', 'their', 'size', 'and', 'incident', 'stellar', 'flux', 'for', 'the', 'purpose', 'of', 'providing', 'the', 'expected', 'number', 'of', 'exoplanets', 'observed', 'yield', 'with', 'direct', 'imaging', 'missions', 'the', 'boundaries', 'of', 'this', 'classification', 'can', 'be', 'computed', 'using', 'the', 'known', 'chemical', 'behavior', 'of', 'gases', 'and', 'condensates', 'at', 'different', 'pressures', 'and', 'temperatures', 'in', 'a', 'planetary', 'atmosphere', 'in', 'this', 'study', 'we', 'initially', 'focus', 'on', 'condensation', 'curves', 'for', 'sphalerite', 'zns', 'h2o', 'co2', 'and', 'ch4', 'the', 'order', 'in', 'which', 'these', 'species', 'condense', 'in', 'a', 'planetary', 'atmosphere', 'define', 'the', 'boundaries', 'between', 'different', 'classes', 'of', 'planets', 'broadly', 'the', 'planets', 'are', 'divided', 'into', 'rocky', '05', '10re', 'superearths', '10', '175re', 'subneptunes', '17535re', 'subjovians', '35', '60re', 'and', 'jovians', '6143re', 'based', 'on', 'their', 'planet', 'sizes', 'and', 'hot', 'warm', 'and', 'cold', 'based', 'on', 'the', 'incident', 'stellar', 'flux', 'we', 'then', 'calculate', 'planet', 'occurrence', 'rates', 'within', 'these', 'boundaries', 'for', 'different', 'kinds', 'of', 'exoplanets', 'eta_planet', 'using', 'the', 'community', 'coordinated', 'results', 'of', 'nasas', 'exoplanet', 'program', 'analysis', 'groups', 'science', 'analysis', 'group13', 'sag13', 'these', 'occurrence', 'rate', 'estimates', 'are', 'in', 'turn', 'used', 'to', 'estimate', 'the', 'expected', 'exoplanet', 'yields', 'for', 'direct', 'imaging', 'missions', 'of', 'different', 'telescope', 'diameter']] | [-0.0836395476740308, 0.20349636631677062, -0.05918923402659413, 0.07168917336228599, -0.09101481749108288, -0.05026273299917215, 0.07140203211910841, 0.3684691334029705, -0.16306876795048394, -0.3779884938718524, 0.10961633290947846, -0.2799426589263376, -0.11112659106445612, 0.23196791165122171, -0.07533349140501786, 0.04323178066846506, 0.11801779415719665, -0.09104307005096726, -0.0033733255809127558, -0.2680612813408782, 0.2874618787011813, 0.06275513039265827, 0.12800972008986808, 0.021239852027047607, 0.015808805075996534, -0.0666904285368396, -0.06425112080646725, -0.04538452139169705, -0.2268085885908676, 0.09230936618604152, 0.31635190735275787, 0.15484516300806186, 0.19730574823007352, -0.4036629388654014, -0.24461124126413247, 0.08893053675149908, 0.11184570110380286, 0.0028901385274011553, -0.04045767881339643, -0.2758337160867707, 0.029363028469733984, -0.1563110270401145, -0.14865737253936326, -0.011570172802908573, 0.03629967840388417, 0.025292262547399576, -0.24457926260898025, 0.007392940186418411, 0.0038855854171986988, 0.1763936208697354, -0.18385136261264362, -0.18381100213609455, -0.08087136159571479, 0.1243431766358454, -0.013012973505367594, -0.03674915234172126, 0.17615098175479144, -0.09447224828210182, -0.020975251069928452, 0.4171273418758973, -0.10781529099828133, -0.014473945397611071, 0.2882431606932475, -0.21130956129125525, -0.12508842562348013, 0.15572218927668363, 0.21306881260371016, 0.16416694476132895, -0.1600001218512927, -0.011169997551308082, -0.01831484129765957, 0.16750849937997395, 0.11602043326398949, 0.0784912240441616, 0.39153912152822423, 0.1819398176135132, 0.08838075930848945, 0.09577974505245504, -0.23118149782871691, -0.036946311202354545, -0.16693812381283085, -0.17554035820365066, -0.1416660220112379, 0.0003854660771605445, -0.07883625958014064, -0.12829295627704662, 0.339182320836326, 0.17665737552892008, 0.13387695029037208, 0.01450323451980494, 0.32871428998755065, 0.04026794411560021, 0.1004327579719446, 0.03676084435385902, 0.29632758426014333, 0.0985829512361528, 0.09744882949332638, -0.23064444803564652, 0.06317617735802764, 0.022881110199931554] |
1,802.09603 | Points on nodal lines with given direction | We study of the directional distribution function of nodal lines for
eigenfunctions of the Laplacian on a planar domain. This quantity counts the
number of points where the normal to the nodal line points in a given
direction. We give upper bounds for the flat torus, and compute the expected
number for arithmetic random waves.
| math.SP | we study of the directional distribution function of nodal lines for eigenfunctions of the laplacian on a planar domain this quantity counts the number of points where the normal to the nodal line points in a given direction we give upper bounds for the flat torus and compute the expected number for arithmetic random waves | [['we', 'study', 'of', 'the', 'directional', 'distribution', 'function', 'of', 'nodal', 'lines', 'for', 'eigenfunctions', 'of', 'the', 'laplacian', 'on', 'a', 'planar', 'domain', 'this', 'quantity', 'counts', 'the', 'number', 'of', 'points', 'where', 'the', 'normal', 'to', 'the', 'nodal', 'line', 'points', 'in', 'a', 'given', 'direction', 'we', 'give', 'upper', 'bounds', 'for', 'the', 'flat', 'torus', 'and', 'compute', 'the', 'expected', 'number', 'for', 'arithmetic', 'random', 'waves']] | [-0.2147438117895614, 0.07379989922046662, -0.03501983687112277, 0.06142158598681404, -0.09147674887525764, -0.053992882201617416, 0.11381865743209016, 0.3199475141115148, -0.23605666255409066, -0.2513514075661078, 0.08213744993871924, -0.30657065821472895, -0.10611237355677242, 0.21470786632800645, -0.03217510645362464, 0.05437654178928245, -0.014237416307018563, 0.07336190688339146, -0.05128601537170735, -0.20190032933923333, 0.35663510362025014, -0.013456418670036576, 0.2689403943209486, 0.060819433062252674, 0.043340300074355166, 0.004879694000225175, -0.008320087109777061, -0.0017787696624344046, -0.19228901519355449, 0.1653601473451338, 0.22944690253246913, 0.06684418082745237, 0.17964457494460723, -0.4219470412893729, -0.18026980763639916, 0.187802147323435, 0.14145969671451233, 0.06654576351019469, -0.006965173641219735, -0.23523386804894966, 0.08517333973537791, -0.04485885001380335, -0.2216673489829356, 0.02627313360571861, 0.05029309030029584, 0.08714392950165678, -0.23435320586643435, 0.03399829354814508, 0.07706603506072, 0.08733854521944356, -0.015800061644139614, -0.11589145213365555, -0.04150408823043108, 0.08467358135702935, 0.03614755439233373, 0.02137711629356173, 0.052276791887759994, -0.12884340956383808, -0.10041372417048974, 0.3311313589865511, -0.08774745427707041, -0.26562434218146586, 0.08614180077036673, -0.19902117958885024, -0.11136898257007653, 0.1325660398737951, 0.22698528641326862, 0.1494594097476114, -0.027918485704470763, 0.10560653197303922, -0.11394982034001838, 0.10549598261713981, 0.0885452016172084, 0.026698177447542548, 0.19567808583378793, 0.05296848904002797, 0.15817416416142474, 0.17254823226672175, -0.16537718802097845, -0.06610688113353469, -0.3585506618022919, -0.17951400362971154, -0.2578117657452822, 0.04848490377295424, -0.15844292622033126, -0.28480205180081114, 0.4664803251624107, 0.07956576286391778, 0.2858568924055858, 0.10312758679448797, 0.25906105371700094, 0.2012167805128477, -0.008089413273740898, 0.11698687056248838, 0.1587010470642285, 0.13955207871357825, 0.024902747850865124, -0.17657629386945203, 0.023483731800859626, 0.12942118358544327] |
1,802.09604 | PySE: Software for Extracting Sources from Radio Images | PySE is a Python software package for finding and measuring sources in radio
telescope images. The software was designed to detect sources in the LOFAR
telescope images, but can be used with images from other radio telescopes as
well. We introduce the LOFAR Telescope, the context within which PySE was
developed, the design of PySE, and describe how it is used. Detailed
experiments on the validation and testing of PySE are then presented, along
with results of performance testing. We discuss some of the current issues with
the algorithms implemented in PySE and their inter- action with LOFAR images,
concluding with the current status of PySE and its future development.
| astro-ph.IM | pyse is a python software package for finding and measuring sources in radio telescope images the software was designed to detect sources in the lofar telescope images but can be used with images from other radio telescopes as well we introduce the lofar telescope the context within which pyse was developed the design of pyse and describe how it is used detailed experiments on the validation and testing of pyse are then presented along with results of performance testing we discuss some of the current issues with the algorithms implemented in pyse and their inter action with lofar images concluding with the current status of pyse and its future development | [['pyse', 'is', 'a', 'python', 'software', 'package', 'for', 'finding', 'and', 'measuring', 'sources', 'in', 'radio', 'telescope', 'images', 'the', 'software', 'was', 'designed', 'to', 'detect', 'sources', 'in', 'the', 'lofar', 'telescope', 'images', 'but', 'can', 'be', 'used', 'with', 'images', 'from', 'other', 'radio', 'telescopes', 'as', 'well', 'we', 'introduce', 'the', 'lofar', 'telescope', 'the', 'context', 'within', 'which', 'pyse', 'was', 'developed', 'the', 'design', 'of', 'pyse', 'and', 'describe', 'how', 'it', 'is', 'used', 'detailed', 'experiments', 'on', 'the', 'validation', 'and', 'testing', 'of', 'pyse', 'are', 'then', 'presented', 'along', 'with', 'results', 'of', 'performance', 'testing', 'we', 'discuss', 'some', 'of', 'the', 'current', 'issues', 'with', 'the', 'algorithms', 'implemented', 'in', 'pyse', 'and', 'their', 'inter', 'action', 'with', 'lofar', 'images', 'concluding', 'with', 'the', 'current', 'status', 'of', 'pyse', 'and', 'its', 'future', 'development']] | [-0.05670726323230404, 0.05762066800433042, -0.04257888158952648, 0.047396927464499396, -0.11621303452517498, -0.12614531731233, -0.014137414538047531, 0.4657021463255991, -0.19486572917720132, -0.3515786790839312, 0.184993073717818, -0.26374982009557163, -0.1456155845556747, 0.2641809821721505, -0.04622578551696444, 0.03463730491560207, 0.11303300240331075, -0.05170460152016445, -0.03636041117583359, -0.2480281974273649, 0.232198795997961, 0.17544441083022816, 0.27926724486433985, 0.04453652552329004, 0.09559470179744742, -0.05442557981745763, -0.12421348887411031, 0.009834858461875807, -0.06891103856535417, 0.0931078952583696, 0.332709968411787, 0.25047770841470496, 0.21242813996293328, -0.3969723167405887, -0.13857108560306106, 0.03447063821791248, 0.09768054790752516, 0.03516257337019355, -0.042363999816800724, -0.372358015357432, 0.06792183513488535, -0.16334281670437617, -0.13879302898633547, -0.03148180464790626, -0.04410058628683063, 0.0782105006870221, -0.19484205898955803, -0.029132764670066535, -0.06207285653482276, 0.07482398716224865, -0.07429319786818021, -0.11636840210465545, 0.041765224441504954, 0.17715884215590036, 0.013981875984675506, 0.046507584189318794, 0.11736253659579564, -0.12469434133646164, -0.12699011619710787, 0.39077004245059055, -0.05488493960266086, -0.12693730751052498, 0.1788599537854845, -0.1259987485171719, -0.18229843506758864, 0.0381656203567135, 0.1973517080176283, 0.07108359554867176, -0.16981263873167335, 0.07005110482674684, 0.04209392603317445, 0.18222939112985675, 0.015453888712958856, 0.008444454317743127, 0.22242618531877684, 0.20864421044560996, 0.02395061451401985, 0.16579006016413173, -0.21842201853975315, 0.01713382749902931, -0.2717948854033073, -0.15181133946065198, -0.1396939978913658, -0.004832441065545109, -0.00363039882279488, -0.1229660366227935, 0.4298783723942258, 0.20657652666030282, 0.10478995748456907, 0.04965750194599174, 0.352951935805719, 0.015904281625989825, 0.1461697666588324, 0.07317955753004009, 0.22503877986905121, 0.07606863523410125, 0.11630029657601633, -0.17406078749971296, 0.05031806730495935, -0.014189019837332043] |
1,802.09605 | Z\'ero-cycles sur les espaces homog\`enes et probl\`eme de Galois
inverse | Let X be a smooth compactification of a homogeneous space of a linear
algebraic group G over a number field k. We establish the conjecture of
Colliot-Th\'el\`ene, Sansuc, Kato and Saito on the image of the Chow group of
zero-cycles of X in the product of the same groups over all the completions of
k. When G is semisimple and simply connected and the geometric stabiliser is
finite and supersolvable, we show that rational points of X are dense in the
Brauer-Manin set. For finite supersolvable groups, in particular for finite
nilpotent groups, this yields a new proof of Shafarevich's theorem on the
inverse Galois problem, and solves, at the same time, Grunwald's problem, for
these groups.
-----
Soit X une compactification lisse d'un espace homog\`ene d'un groupe
alg\'ebrique lin\'eaire G sur un corps de nombres k. Nous \'etablissons la
conjecture de Colliot-Th\'el\`ene, Sansuc, Kato et Saito sur l'image du groupe
de Chow des z\'ero-cycles de X dans le produit des m\^emes groupes sur tous les
compl\'et\'es de k. Lorsque G est semi-simple et simplement connexe et que le
stabilisateur g\'eom\'etrique est fini et hyper-r\'esoluble, nous montrons que
les points rationnels de X sont denses dans l'ensemble de Brauer-Manin. Pour
les groupes finis hyper-r\'esolubles, en particulier pour les groupes finis
nilpotents, cela donne une nouvelle preuve du th\'eor\`eme de Shafarevich sur
le probl\`eme de Galois inverse et r\'esout en m\^eme temps, pour ces groupes,
le probl\`eme de Grunwald.
| math.AG math.NT | let x be a smooth compactification of a homogeneous space of a linear algebraic group g over a number field k we establish the conjecture of colliotthelene sansuc kato and saito on the image of the chow group of zerocycles of x in the product of the same groups over all the completions of k when g is semisimple and simply connected and the geometric stabiliser is finite and supersolvable we show that rational points of x are dense in the brauermanin set for finite supersolvable groups in particular for finite nilpotent groups this yields a new proof of shafarevichs theorem on the inverse galois problem and solves at the same time grunwalds problem for these groups soit x une compactification lisse dun espace homogene dun groupe algebrique lineaire g sur un corps de nombres k nous etablissons la conjecture de colliotthelene sansuc kato et saito sur limage du groupe de chow des zerocycles de x dans le produit des memes groupes sur tous les completes de k lorsque g est semisimple et simplement connexe et que le stabilisateur geometrique est fini et hyperresoluble nous montrons que les points rationnels de x sont denses dans lensemble de brauermanin pour les groupes finis hyperresolubles en particulier pour les groupes finis nilpotents cela donne une nouvelle preuve du theoreme de shafarevich sur le probleme de galois inverse et resout en meme temps pour ces groupes le probleme de grunwald | [['let', 'x', 'be', 'a', 'smooth', 'compactification', 'of', 'a', 'homogeneous', 'space', 'of', 'a', 'linear', 'algebraic', 'group', 'g', 'over', 'a', 'number', 'field', 'k', 'we', 'establish', 'the', 'conjecture', 'of', 'colliotthelene', 'sansuc', 'kato', 'and', 'saito', 'on', 'the', 'image', 'of', 'the', 'chow', 'group', 'of', 'zerocycles', 'of', 'x', 'in', 'the', 'product', 'of', 'the', 'same', 'groups', 'over', 'all', 'the', 'completions', 'of', 'k', 'when', 'g', 'is', 'semisimple', 'and', 'simply', 'connected', 'and', 'the', 'geometric', 'stabiliser', 'is', 'finite', 'and', 'supersolvable', 'we', 'show', 'that', 'rational', 'points', 'of', 'x', 'are', 'dense', 'in', 'the', 'brauermanin', 'set', 'for', 'finite', 'supersolvable', 'groups', 'in', 'particular', 'for', 'finite', 'nilpotent', 'groups', 'this', 'yields', 'a', 'new', 'proof', 'of', 'shafarevichs', 'theorem', 'on', 'the', 'inverse', 'galois', 'problem', 'and', 'solves', 'at', 'the', 'same', 'time', 'grunwalds', 'problem', 'for', 'these', 'groups', 'soit', 'x', 'une', 'compactification', 'lisse', 'dun', 'espace', 'homogene', 'dun', 'groupe', 'algebrique', 'lineaire', 'g', 'sur', 'un', 'corps', 'de', 'nombres', 'k', 'nous', 'etablissons', 'la', 'conjecture', 'de', 'colliotthelene', 'sansuc', 'kato', 'et', 'saito', 'sur', 'limage', 'du', 'groupe', 'de', 'chow', 'des', 'zerocycles', 'de', 'x', 'dans', 'le', 'produit', 'des', 'memes', 'groupes', 'sur', 'tous', 'les', 'completes', 'de', 'k', 'lorsque', 'g', 'est', 'semisimple', 'et', 'simplement', 'connexe', 'et', 'que', 'le', 'stabilisateur', 'geometrique', 'est', 'fini', 'et', 'hyperresoluble', 'nous', 'montrons', 'que', 'les', 'points', 'rationnels', 'de', 'x', 'sont', 'denses', 'dans', 'lensemble', 'de', 'brauermanin', 'pour', 'les', 'groupes', 'finis', 'hyperresolubles', 'en', 'particulier', 'pour', 'les', 'groupes', 'finis', 'nilpotents', 'cela', 'donne', 'une', 'nouvelle', 'preuve', 'du', 'theoreme', 'de', 'shafarevich', 'sur', 'le', 'probleme', 'de', 'galois', 'inverse', 'et', 'resout', 'en', 'meme', 'temps', 'pour', 'ces', 'groupes', 'le', 'probleme', 'de', 'grunwald']] | [-0.29098151436739084, -0.009193461444808466, -0.22856206998284986, 0.03950776764498464, -0.1473278221314525, -0.1332486764040212, -0.19860465759051715, 0.09005436321716484, -0.23177563811176707, -0.23810353522816505, 0.03887281365254934, -0.3566202555239488, -0.18165108985807188, 0.17912201425850055, -0.37944269781860285, -0.1239211460578709, -0.14680942605237593, -0.06471039271661652, 0.03528037229093199, -0.40618955511839605, 0.3261449751144379, 0.08045945185582756, 0.28500766231970215, -0.056701397570749434, 0.2417486029848968, 0.20268211278129097, 0.09849516499004139, -0.19270218768401387, -0.35345754265109336, 0.0333810766515334, 0.48974484844780786, 0.1288965738282535, 0.23921013513555983, -0.2882324354563212, -0.011964267651378598, 0.21997290550353396, 0.10496055721225368, -0.08228760360852044, 0.050092852417611446, -0.46548661637587607, 0.21299014627821583, -0.2166148773911649, -0.0562502193922185, -0.024655451486486735, -0.04828220665157081, 0.027090137952822762, -0.21776959462523013, 0.10126630670307084, 0.07433541862932613, 0.24715029789622506, -0.014858335614316326, -0.2883467710472153, -0.24668639667368147, -0.06585028525749162, -0.20023715852279128, 0.13364984716244777, 0.00569014267595245, 0.10341685064748538, -0.042281548628011964, 0.2774819016452607, -0.13146195339854375, -0.011146432947958999, 0.1233521621102715, -0.09954110440341436, -0.3326840448870759, 0.11336123018501558, 0.04472422017715871, 0.25360329289892647, 0.2915222964500244, 0.4739240904929728, -0.09461460097856787, 0.04692705961987536, 0.27996265969554945, -0.15492978801175378, 0.0683973030747532, -0.021867773272776617, -0.005346028059780949, -0.25495670531834413, 0.03697189102808709, 0.14392580852000433, -0.2582700288182029, -0.40443354676569543, -0.02441905014059015, 0.18412358603188408, -0.0957652097165084, -0.2874382172087647, 0.13760765390110885, -0.023469150828571327, 0.08742578738057274, 0.15460662897616273, 0.04722350733074891, -0.23423374859188223, -0.12339074489770606, 0.07808776388480428, 0.028250087830018204, 0.1641830307273634, 0.11860415645547275, -0.2307981335360141, -0.13210925877158222, 0.42372113930724975] |
1,802.09606 | Evolution of passive film behavior on mechanically polished NiTi shape
memory alloy during forward martensitic transformation | The corrosion property of Nickel-titanium (NiTi) shape memory alloy is
investigated during forward martensitic transformation between 40C and 0C. The
Differential Scanning Calorimetry technique is used to find the forward and
reverse martensitic transformation temperatures. NiTi shows the present of
martensitic phase at near room temperature by cooling from 80C. The change in
corrosion behavior is monitored by electrochemical Open Circuit Potential (OCP)
during phase transformation. Cyclic potentiodynamic polarization method is used
to identify the corrosion compound of NiTi. Corrosion rate at each temperature
extracted from polarization data and activation energy for corrosion reaction
in martensite and austenite phase are calculated based on an Arrhenius relation
between corrosion current density and reciprocal temperature.
| cond-mat.mtrl-sci | the corrosion property of nickeltitanium niti shape memory alloy is investigated during forward martensitic transformation between 40c and 0c the differential scanning calorimetry technique is used to find the forward and reverse martensitic transformation temperatures niti shows the present of martensitic phase at near room temperature by cooling from 80c the change in corrosion behavior is monitored by electrochemical open circuit potential ocp during phase transformation cyclic potentiodynamic polarization method is used to identify the corrosion compound of niti corrosion rate at each temperature extracted from polarization data and activation energy for corrosion reaction in martensite and austenite phase are calculated based on an arrhenius relation between corrosion current density and reciprocal temperature | [['the', 'corrosion', 'property', 'of', 'nickeltitanium', 'niti', 'shape', 'memory', 'alloy', 'is', 'investigated', 'during', 'forward', 'martensitic', 'transformation', 'between', '40c', 'and', '0c', 'the', 'differential', 'scanning', 'calorimetry', 'technique', 'is', 'used', 'to', 'find', 'the', 'forward', 'and', 'reverse', 'martensitic', 'transformation', 'temperatures', 'niti', 'shows', 'the', 'present', 'of', 'martensitic', 'phase', 'at', 'near', 'room', 'temperature', 'by', 'cooling', 'from', '80c', 'the', 'change', 'in', 'corrosion', 'behavior', 'is', 'monitored', 'by', 'electrochemical', 'open', 'circuit', 'potential', 'ocp', 'during', 'phase', 'transformation', 'cyclic', 'potentiodynamic', 'polarization', 'method', 'is', 'used', 'to', 'identify', 'the', 'corrosion', 'compound', 'of', 'niti', 'corrosion', 'rate', 'at', 'each', 'temperature', 'extracted', 'from', 'polarization', 'data', 'and', 'activation', 'energy', 'for', 'corrosion', 'reaction', 'in', 'martensite', 'and', 'austenite', 'phase', 'are', 'calculated', 'based', 'on', 'an', 'arrhenius', 'relation', 'between', 'corrosion', 'current', 'density', 'and', 'reciprocal', 'temperature']] | [-0.03540269145329969, 0.19763069925945667, -0.07186642107945265, -0.043682633870306006, -0.03318921523580773, -0.17321925797392573, 0.09291127451233962, 0.45068991190828056, -0.3201694351134706, -0.2739669109274328, 0.05583419255805161, -0.2991569523773758, -0.11218088395497967, 0.18834930177534873, 0.008834793759856076, 0.09635888416818714, -0.05993668303749755, -0.017448455876716108, -0.12446200214243963, -0.18627280677644026, 0.20595426768460104, 0.10940555031864649, 0.3625879180164332, 0.07078076213334514, 0.11359471721941423, -0.02391068867935214, 0.07837863834739654, -0.021312295271452533, -0.17959304026995612, -0.06661464424136268, 0.3004555892924556, -0.01665112271954396, 0.12716105821814422, -0.4580005361179335, -0.23076510285150953, 0.005167548688936287, 0.0022209278571592495, 0.06041630326597169, -0.11843252081147898, -0.22197811493435793, 0.03848500221769894, -0.06956744147052543, -0.05721133046544495, -0.08562032775376487, 0.005283771705014252, 0.01657316291424553, -0.23695709442192342, 0.14034083618119125, 0.047142758487468274, 0.1623862110309105, -0.1301772168268804, -0.12595320568807358, -0.10626855463745584, 0.03943329450954576, 0.045654436771189216, 0.04305596029168547, 0.2652313695165568, -0.03799508216551843, -0.025732690109397424, 0.3420512798876889, -0.02330047797939155, 0.007102908863298661, 0.13223656482244553, -0.12804987263428955, -0.06450848167234685, 0.23376508472503815, 0.10880441990458464, 0.04574574573394076, -0.23778138795158768, 0.03633750045200217, 0.1872886504300054, 0.18756575297370587, 0.1775080647805821, -0.07604819615124271, 0.1573840034002669, 0.2431928630572109, -0.01600536412303954, 0.24129204252586428, -0.10821171490417843, -0.030342926201204545, -0.21843510385668646, -0.21865900157975543, -0.14418936921984155, 0.02671306306677582, -0.12228503009338917, -0.15361951951316632, 0.32902751361901783, 0.07898033956741601, 0.14361866565619028, -0.03822329856529502, 0.21974330661670033, 0.07942832058987918, 0.060606745007835264, -0.00027000337047914486, 0.2133067817905242, 0.1857937195964685, 0.24423666321878543, -0.3776879325484346, 0.21863871603066812, 0.07360876770484039] |
1,802.09607 | Small-scale dynamos in simulations of stratified turbulent convection | Small-scale dynamo action is often held responsible for the generation of
quiet-Sun magnetic fields. We aim to determine the excitation conditions and
saturation level of small-scale dynamos in non-rotating turbulent convection at
low magnetic Prandtl numbers. We use high resolution direct numerical
simulations of weakly stratified turbulent convection. We find that the
critical magnetic Reynolds number for dynamo excitation increases as the
magnetic Prandtl number is decreased, which might suggest that small-scale
dynamo action is not automatically evident in bodies with small magnetic
Prandtl numbers as the Sun. As a function of the magnetic Reynolds number
(${\rm Rm}$), the growth rate of the dynamo is consistent with an ${\rm
Rm}^{1/2}$ scaling. No evidence for a logarithmic increase of the growth rate
with ${\rm Rm}$ is found.
| astro-ph.SR physics.flu-dyn | smallscale dynamo action is often held responsible for the generation of quietsun magnetic fields we aim to determine the excitation conditions and saturation level of smallscale dynamos in nonrotating turbulent convection at low magnetic prandtl numbers we use high resolution direct numerical simulations of weakly stratified turbulent convection we find that the critical magnetic reynolds number for dynamo excitation increases as the magnetic prandtl number is decreased which might suggest that smallscale dynamo action is not automatically evident in bodies with small magnetic prandtl numbers as the sun as a function of the magnetic reynolds number rm rm the growth rate of the dynamo is consistent with an rm rm12 scaling no evidence for a logarithmic increase of the growth rate with rm rm is found | [['smallscale', 'dynamo', 'action', 'is', 'often', 'held', 'responsible', 'for', 'the', 'generation', 'of', 'quietsun', 'magnetic', 'fields', 'we', 'aim', 'to', 'determine', 'the', 'excitation', 'conditions', 'and', 'saturation', 'level', 'of', 'smallscale', 'dynamos', 'in', 'nonrotating', 'turbulent', 'convection', 'at', 'low', 'magnetic', 'prandtl', 'numbers', 'we', 'use', 'high', 'resolution', 'direct', 'numerical', 'simulations', 'of', 'weakly', 'stratified', 'turbulent', 'convection', 'we', 'find', 'that', 'the', 'critical', 'magnetic', 'reynolds', 'number', 'for', 'dynamo', 'excitation', 'increases', 'as', 'the', 'magnetic', 'prandtl', 'number', 'is', 'decreased', 'which', 'might', 'suggest', 'that', 'smallscale', 'dynamo', 'action', 'is', 'not', 'automatically', 'evident', 'in', 'bodies', 'with', 'small', 'magnetic', 'prandtl', 'numbers', 'as', 'the', 'sun', 'as', 'a', 'function', 'of', 'the', 'magnetic', 'reynolds', 'number', 'rm', 'rm', 'the', 'growth', 'rate', 'of', 'the', 'dynamo', 'is', 'consistent', 'with', 'an', 'rm', 'rm12', 'scaling', 'no', 'evidence', 'for', 'a', 'logarithmic', 'increase', 'of', 'the', 'growth', 'rate', 'with', 'rm', 'rm', 'is', 'found']] | [-0.2396961867509942, 0.2755844668340398, 0.01976059376119381, 0.11491561907302913, -0.06874027474975539, -0.000524228046988211, -0.03392835472417544, 0.27646540287911653, -0.23418104613480706, -0.38262453854143147, 0.06879014983987583, -0.17810258789668007, -0.07224388411342507, 0.25785639260466847, -0.0061228564729736675, 0.016503260992023917, 0.011341164273852926, 0.04726617651740237, 0.03711612572494362, -0.18105949202759397, 0.28238508229084786, 0.10012889900503473, 0.2722250892085925, 0.008599118156809478, 0.05574372558603211, -0.1693075034944784, 0.04524812554674489, 0.05501857565139376, -0.18894894062303513, -0.016189590824531423, 0.21664173147060894, 0.021308586167703782, 0.2738440981548693, -0.4681139056319519, -0.22169739681126047, 0.022072746039604737, 0.19071180761666112, 0.07829682989552292, -0.05978596746175003, -0.157070321001349, 0.1581796286456723, -0.14652550981808748, -0.11506911177587296, -0.058960874712774676, 0.04637521515334291, 0.03187705551750869, -0.3780608109516343, 0.15064698805855142, 0.03839314222753432, 0.20872274593871443, -0.10954717868968608, -0.07652236638768088, -0.12126986414844555, 0.0729325742410895, 0.1614749214283028, 0.07402428075609292, 0.19645399527045868, -0.2238669538840888, -0.019093475987329075, 0.36179202682678663, -0.066551186210875, -0.1412184218846498, 0.210798260567355, -0.25539000569990583, -0.11395351796726039, 0.1984484305250503, 0.16517351469438937, 0.11557958177143028, 0.0177935654378777, 0.017658959299701057, -0.1127112106630756, 0.1940461938446831, 0.04820669980512725, -0.046187909581469344, 0.23533467647281386, 0.20157164384773563, 0.07821992398904902, 0.0722997997451337, -0.18489009433145087, -0.03009595539021705, -0.28859337878650027, -0.1159958599249847, -0.13871849764374986, 0.10267351297229724, -0.12092072324744621, -0.17126810490484035, 0.26624517216687166, 0.18121884082857934, 0.14989789805212428, 0.03813290669276039, 0.26930108858597657, 0.16109851542915704, 0.07090303573077397, 0.16546216844728898, 0.2575144033162071, 0.2655953594265387, 0.16110954364199961, -0.3033502148870852, 0.015712739836927208, 0.07498452728170724] |
1,802.09608 | Local Coupling Property for Markov Processes with Applications to L\'evy
Processes | In this article, we define the new concept of local coupling property for
Markov processes and study its relationship with distributional properties of
the transition probability. In the special case of L\'evy processes we show
that this property is equivalent to the absolute continuity of the transition
probability and also provide a sufficient condition for it in terms of the
L\'evy measure. Our result is stronger than existing results for absolute
continuity of L\'evy distributions.
| math.PR | in this article we define the new concept of local coupling property for markov processes and study its relationship with distributional properties of the transition probability in the special case of levy processes we show that this property is equivalent to the absolute continuity of the transition probability and also provide a sufficient condition for it in terms of the levy measure our result is stronger than existing results for absolute continuity of levy distributions | [['in', 'this', 'article', 'we', 'define', 'the', 'new', 'concept', 'of', 'local', 'coupling', 'property', 'for', 'markov', 'processes', 'and', 'study', 'its', 'relationship', 'with', 'distributional', 'properties', 'of', 'the', 'transition', 'probability', 'in', 'the', 'special', 'case', 'of', 'levy', 'processes', 'we', 'show', 'that', 'this', 'property', 'is', 'equivalent', 'to', 'the', 'absolute', 'continuity', 'of', 'the', 'transition', 'probability', 'and', 'also', 'provide', 'a', 'sufficient', 'condition', 'for', 'it', 'in', 'terms', 'of', 'the', 'levy', 'measure', 'our', 'result', 'is', 'stronger', 'than', 'existing', 'results', 'for', 'absolute', 'continuity', 'of', 'levy', 'distributions']] | [-0.06678996921827396, 0.11514147464496394, -0.1160834441985935, 0.10703186431278786, -0.05779860039552053, -0.07459015609075625, 0.06113902344678839, 0.3938086085518201, -0.2799805469314257, -0.2244818059913814, 0.0817051557963714, -0.24358348555552461, -0.1548839050034682, 0.16462653271853925, -0.09145715503642957, 0.06638099181077753, 0.014165623014171918, 0.04689107154534819, -0.06511676355885963, -0.19767316113846997, 0.37707961946725843, 0.04051173644761245, 0.2909889033591996, 0.07439513618126511, 0.12258992175882061, -0.019005295590807995, -0.034358335022504134, -0.01484084731588761, -0.20460114781172403, 0.11321756228804589, 0.17599698135629296, 0.10494776320954163, 0.2896987279690802, -0.3342129200696945, -0.17487096001704533, 0.17277481816709042, 0.06167504052321116, 0.028534074847896895, -0.03325318556589385, -0.29986980349756776, 0.11862536819030842, -0.1469907529776295, -0.16571164913475514, -0.0644684598299985, 0.055387959616879624, 0.06851928074844181, -0.321563840371867, 0.0913483951392118, 0.17811863479514917, 0.06349214715262254, -0.06032927626899133, -0.0832793678653737, 0.010991467141235868, 0.10799009054278334, 0.06355457064385216, -0.019387871334329246, 0.08249677377442519, -0.11662629005809624, -0.1061989507296433, 0.3411950832605362, -0.11782857897167559, -0.23089429041060308, 0.1877990496531129, -0.20060416556894778, -0.16971411855270466, 0.09831940018416693, 0.12780033552398284, 0.13621344273289046, -0.1773945884189258, 0.0947151902426655, -0.043937639277428386, 0.07711711751917998, 0.028550649533669155, 0.1087394144696494, 0.08766865741461516, 0.14746296410138407, 0.16591990133126577, 0.17072280949912966, -0.02595061244443059, -0.12060939420635501, -0.3614673496534427, -0.2425392338509361, -0.167540494389832, 0.0567698626468579, -0.10995288365171291, -0.1875530045169095, 0.3696743518828104, 0.200271388568605, 0.18843898510211146, 0.14524620162944, 0.2170673104096204, 0.19296776115040606, -0.041770083027270935, 0.005255875171472629, 0.21900763852521776, 0.17688055254518986, 0.08696234663327534, -0.14871545208618045, 0.1479326173166434, 0.0746508536177377] |
1,802.09609 | Artificial Noise Aided Secure Cognitive Beamforming for Cooperative
MISO-NOMA Using SWIPT | Cognitive radio (CR) and non-orthogonal multiple access (NOMA) have been
deemed two promising technologies due to their potential to achieve high
spectral efficiency and massive connectivity. This paper studies a
multiple-input single-output NOMA CR network relying on simultaneous wireless
information and power transfer (SWIPT) conceived for supporting a massive
population of power limited battery-driven devices. In contrast to most of the
existing works, which use an ideally linear energy harvesting model, this study
applies a more practical non-linear energy harvesting model. In order to
improve the security of the primary network, an artificial-noise-aided
cooperative jamming scheme is proposed. The artificial-noise-aided beamforming
design problems are investigated subject to the practical secrecy rate and
energy harvesting constraints. Specifically, the transmission power
minimization problems are formulated under both perfect channel state
information (CSI) and the bounded CSI error model. The problems formulated are
non-convex, hence they are challenging to solve. A pair of algorithms either
using semidefinite relaxation (SDR) or a cost function are proposed for solving
these problems. Our simulation results show that the proposed cooperative
jamming scheme succeeds in establishing secure communications and NOMA is
capable of outperforming the conventional orthogonal multiple access in terms
of its power efficiency. Finally, we demonstrate that the cost function
algorithm outperforms the SDR-based algorithm.
| eess.SP cs.GT | cognitive radio cr and nonorthogonal multiple access noma have been deemed two promising technologies due to their potential to achieve high spectral efficiency and massive connectivity this paper studies a multipleinput singleoutput noma cr network relying on simultaneous wireless information and power transfer swipt conceived for supporting a massive population of power limited batterydriven devices in contrast to most of the existing works which use an ideally linear energy harvesting model this study applies a more practical nonlinear energy harvesting model in order to improve the security of the primary network an artificialnoiseaided cooperative jamming scheme is proposed the artificialnoiseaided beamforming design problems are investigated subject to the practical secrecy rate and energy harvesting constraints specifically the transmission power minimization problems are formulated under both perfect channel state information csi and the bounded csi error model the problems formulated are nonconvex hence they are challenging to solve a pair of algorithms either using semidefinite relaxation sdr or a cost function are proposed for solving these problems our simulation results show that the proposed cooperative jamming scheme succeeds in establishing secure communications and noma is capable of outperforming the conventional orthogonal multiple access in terms of its power efficiency finally we demonstrate that the cost function algorithm outperforms the sdrbased algorithm | [['cognitive', 'radio', 'cr', 'and', 'nonorthogonal', 'multiple', 'access', 'noma', 'have', 'been', 'deemed', 'two', 'promising', 'technologies', 'due', 'to', 'their', 'potential', 'to', 'achieve', 'high', 'spectral', 'efficiency', 'and', 'massive', 'connectivity', 'this', 'paper', 'studies', 'a', 'multipleinput', 'singleoutput', 'noma', 'cr', 'network', 'relying', 'on', 'simultaneous', 'wireless', 'information', 'and', 'power', 'transfer', 'swipt', 'conceived', 'for', 'supporting', 'a', 'massive', 'population', 'of', 'power', 'limited', 'batterydriven', 'devices', 'in', 'contrast', 'to', 'most', 'of', 'the', 'existing', 'works', 'which', 'use', 'an', 'ideally', 'linear', 'energy', 'harvesting', 'model', 'this', 'study', 'applies', 'a', 'more', 'practical', 'nonlinear', 'energy', 'harvesting', 'model', 'in', 'order', 'to', 'improve', 'the', 'security', 'of', 'the', 'primary', 'network', 'an', 'artificialnoiseaided', 'cooperative', 'jamming', 'scheme', 'is', 'proposed', 'the', 'artificialnoiseaided', 'beamforming', 'design', 'problems', 'are', 'investigated', 'subject', 'to', 'the', 'practical', 'secrecy', 'rate', 'and', 'energy', 'harvesting', 'constraints', 'specifically', 'the', 'transmission', 'power', 'minimization', 'problems', 'are', 'formulated', 'under', 'both', 'perfect', 'channel', 'state', 'information', 'csi', 'and', 'the', 'bounded', 'csi', 'error', 'model', 'the', 'problems', 'formulated', 'are', 'nonconvex', 'hence', 'they', 'are', 'challenging', 'to', 'solve', 'a', 'pair', 'of', 'algorithms', 'either', 'using', 'semidefinite', 'relaxation', 'sdr', 'or', 'a', 'cost', 'function', 'are', 'proposed', 'for', 'solving', 'these', 'problems', 'our', 'simulation', 'results', 'show', 'that', 'the', 'proposed', 'cooperative', 'jamming', 'scheme', 'succeeds', 'in', 'establishing', 'secure', 'communications', 'and', 'noma', 'is', 'capable', 'of', 'outperforming', 'the', 'conventional', 'orthogonal', 'multiple', 'access', 'in', 'terms', 'of', 'its', 'power', 'efficiency', 'finally', 'we', 'demonstrate', 'that', 'the', 'cost', 'function', 'algorithm', 'outperforms', 'the', 'sdrbased', 'algorithm']] | [-0.23292889365582684, -0.033731484578207266, -0.002866453052099262, 0.035112009243762475, -0.07998297799356459, -0.26694855183096866, 0.060792665527800896, 0.3953796487035496, -0.2743341784419802, -0.278357790601218, 0.08656540736556054, -0.23699994871304148, -0.19370337814048288, 0.18214039434900597, -0.10247617922723293, 0.12219275390712678, 0.050035052183305936, 0.0016447158729923624, -0.03586303547933875, -0.2754734248122466, 0.27933410933640385, 0.1516096823604866, 0.4040156574221328, 0.07135659230823096, 0.09275437081676154, 0.011831421816411117, 0.0020809332707098552, -0.035237777187666366, -0.06812959293470375, 0.12295781709032044, 0.36766381923530606, 0.21732383686716536, 0.33008142757628645, -0.42348461277960314, -0.3150823741630163, 0.11965933348318296, 0.163069126029898, 0.0497009369650013, -0.08400298044109063, -0.23639336778294473, 0.14240622671897568, -0.23034672547974402, -0.010807609246486598, -0.024164177612623287, -0.1401006873017953, 0.04167595995213127, -0.35873489626905036, 0.045712244129251865, 0.00603231920159444, 0.00330051039123819, -0.0972271701640455, -0.13405029301731183, 0.05332590681168118, 0.12289224140404258, 0.006556367920157278, -0.021978977208380542, 0.09281581136331495, -0.1081143448173645, -0.17131784462336716, 0.3774729120323346, 0.05242232161690481, -0.24090748147684193, 0.1912850583385166, -0.021898657449388077, -0.09965334504487969, 0.16123558463794843, 0.257530562974058, 0.12032230532107253, -0.18670990936391588, 0.046760165135353984, 0.008597805384280427, 0.15987532700722415, 0.04675120364187196, 0.14589138635804244, 0.13837370918509329, 0.1976052642555996, 0.1484670615588714, 0.11221971864412938, -0.08137470203717904, -0.13476898482823302, -0.1515263925844227, -0.11235672751790844, -0.24887405066706594, 0.024789605201000257, -0.08097571829247976, -0.054181777909841564, 0.3634743144282159, 0.1307308282880556, 0.08302915997891909, 0.11149470942771239, 0.435674218741423, 0.12017614362550721, 0.022678517224544305, 0.14281678560544692, 0.23058923489658073, 0.11534938370986354, 0.1526381440394159, -0.247105470800861, 0.03080901844826128, -0.032480251294397196] |
1,802.0961 | Aggregative Coarsening for Multilevel Hypergraph Partitioning | Algorithms for many hypergraph problems, including partitioning, utilize
multilevel frameworks to achieve a good trade-off between the performance and
the quality of results. In this paper we introduce two novel aggregative
coarsening schemes and incorporate them within state-of-the-art hypergraph
partitioner Zoltan. Our coarsening schemes are inspired by the algebraic
multigrid and stable matching approaches. We demonstrate the effectiveness of
the developed schemes as a part of multilevel hypergraph partitioning framework
on a wide range of problems.
| cs.DS | algorithms for many hypergraph problems including partitioning utilize multilevel frameworks to achieve a good tradeoff between the performance and the quality of results in this paper we introduce two novel aggregative coarsening schemes and incorporate them within stateoftheart hypergraph partitioner zoltan our coarsening schemes are inspired by the algebraic multigrid and stable matching approaches we demonstrate the effectiveness of the developed schemes as a part of multilevel hypergraph partitioning framework on a wide range of problems | [['algorithms', 'for', 'many', 'hypergraph', 'problems', 'including', 'partitioning', 'utilize', 'multilevel', 'frameworks', 'to', 'achieve', 'a', 'good', 'tradeoff', 'between', 'the', 'performance', 'and', 'the', 'quality', 'of', 'results', 'in', 'this', 'paper', 'we', 'introduce', 'two', 'novel', 'aggregative', 'coarsening', 'schemes', 'and', 'incorporate', 'them', 'within', 'stateoftheart', 'hypergraph', 'partitioner', 'zoltan', 'our', 'coarsening', 'schemes', 'are', 'inspired', 'by', 'the', 'algebraic', 'multigrid', 'and', 'stable', 'matching', 'approaches', 'we', 'demonstrate', 'the', 'effectiveness', 'of', 'the', 'developed', 'schemes', 'as', 'a', 'part', 'of', 'multilevel', 'hypergraph', 'partitioning', 'framework', 'on', 'a', 'wide', 'range', 'of', 'problems']] | [-0.07896899096177597, -0.02899233976035918, -0.09024572899369032, 0.04595658657796632, -0.051119588781148195, -0.15421827608339586, 0.034318757012155594, 0.4123602878106268, -0.2961806702231498, -0.3458433021105042, 0.06923670707864833, -0.19477017614745387, -0.1719409883708546, 0.19813729594706705, -0.14551792623732532, 0.11199111257385659, 0.1293791902227033, -0.06544549633307677, -0.07007823760719284, -0.2976875868855706, 0.32645978505024686, -0.0013893855809185066, 0.35495645114784374, 0.08254598706078373, 0.12979815589067967, -0.016976088843014287, -0.023932079263766736, 0.09868204990695965, -0.17978637383662557, 0.1926658524592456, 0.31244195210992504, 0.17956117821832826, 0.3526650372843601, -0.413988652737125, -0.22207766028709316, 0.08853857991236605, 0.15263634888871916, 0.12449301875925525, -0.05602895925097216, -0.2502973869467448, 0.1245278304528543, -0.18791755022922238, 0.0010515328796923552, -0.13886250197691352, -0.09589443897436324, 0.042451637276252244, -0.31526689747299413, -0.003123665583859149, 0.05824672901010337, 0.028569679989136364, 0.012938270051228372, -0.14904872753112086, 0.10107590776782385, 0.08738880259548559, -0.06538754385454874, -0.03750937484897134, 0.07110892999672185, -0.09776137681910768, -0.24649198918211224, 0.3862217324908431, -0.03333369152019977, -0.19573171211308554, 0.20027823089376875, 0.044424946462784554, -0.16531849230370044, 0.08366703329068657, 0.21007648664281556, 0.17761550056380465, -0.08456726101423173, 0.09056298061362836, -0.026542870303321826, 0.13739384477958083, 0.05820296589272881, 0.056134434331110435, 0.07622618186839022, 0.26675460264576895, 0.11773238231743514, 0.16045921739791275, -0.03457729183298254, -0.15329049672245196, -0.21156575240571615, -0.10959110225820423, -0.15314926687431962, -0.10390150573680569, -0.15735148355356374, -0.18181145845569277, 0.42668876703828573, 0.18096551777010686, 0.17774194106459618, 0.0758552442451841, 0.3556219607983765, 0.029918030265865748, 0.0008058385114724699, 0.1229343969975353, 0.13746238097634264, 0.12602076736144036, 0.08467173864942436, -0.2214741341916746, 0.026052902553745202, 0.14035950645216203] |
1,802.09611 | An Expanded Local Variance Gamma model | The paper proposes an expanded version of the Local Variance Gamma model of
Carr and Nadtochiy by adding drift to the governing underlying process. Still
in this new model it is possible to derive an ordinary differential equation
for the option price which plays a role of Dupire's equation for the standard
local volatility model. It is shown how calibration of multiple smiles (the
whole local volatility surface) can be done in such a case. Further, assuming
the local variance to be a piecewise linear function of strike and piecewise
constant function of time this ODE is solved in closed form in terms of
Confluent hypergeometric functions. Calibration of the model to market smiles
does not require solving any optimization problem and, in contrast, can be done
term-by-term by solving a system of non-linear algebraic equations for each
maturity, which is fast.
| q-fin.CP q-fin.MF q-fin.PR | the paper proposes an expanded version of the local variance gamma model of carr and nadtochiy by adding drift to the governing underlying process still in this new model it is possible to derive an ordinary differential equation for the option price which plays a role of dupires equation for the standard local volatility model it is shown how calibration of multiple smiles the whole local volatility surface can be done in such a case further assuming the local variance to be a piecewise linear function of strike and piecewise constant function of time this ode is solved in closed form in terms of confluent hypergeometric functions calibration of the model to market smiles does not require solving any optimization problem and in contrast can be done termbyterm by solving a system of nonlinear algebraic equations for each maturity which is fast | [['the', 'paper', 'proposes', 'an', 'expanded', 'version', 'of', 'the', 'local', 'variance', 'gamma', 'model', 'of', 'carr', 'and', 'nadtochiy', 'by', 'adding', 'drift', 'to', 'the', 'governing', 'underlying', 'process', 'still', 'in', 'this', 'new', 'model', 'it', 'is', 'possible', 'to', 'derive', 'an', 'ordinary', 'differential', 'equation', 'for', 'the', 'option', 'price', 'which', 'plays', 'a', 'role', 'of', 'dupires', 'equation', 'for', 'the', 'standard', 'local', 'volatility', 'model', 'it', 'is', 'shown', 'how', 'calibration', 'of', 'multiple', 'smiles', 'the', 'whole', 'local', 'volatility', 'surface', 'can', 'be', 'done', 'in', 'such', 'a', 'case', 'further', 'assuming', 'the', 'local', 'variance', 'to', 'be', 'a', 'piecewise', 'linear', 'function', 'of', 'strike', 'and', 'piecewise', 'constant', 'function', 'of', 'time', 'this', 'ode', 'is', 'solved', 'in', 'closed', 'form', 'in', 'terms', 'of', 'confluent', 'hypergeometric', 'functions', 'calibration', 'of', 'the', 'model', 'to', 'market', 'smiles', 'does', 'not', 'require', 'solving', 'any', 'optimization', 'problem', 'and', 'in', 'contrast', 'can', 'be', 'done', 'termbyterm', 'by', 'solving', 'a', 'system', 'of', 'nonlinear', 'algebraic', 'equations', 'for', 'each', 'maturity', 'which', 'is', 'fast']] | [-0.08364497528421286, 0.029144968327772674, -0.1027548208383476, 0.08117621807055066, -0.10779699435929807, -0.1522912641480552, 0.019458372918987304, 0.3348896984325748, -0.3617326545932422, -0.2760427015977846, 0.11626773010398274, -0.21432022040736087, -0.16233556940299, 0.2073634720004072, -0.07997737048377454, 0.07214706320918991, 0.003689371090395455, 0.008192495965976005, -0.04171455866357141, -0.26991914957105906, 0.27786980992065036, 0.057333334975443045, 0.22696599643021612, 0.002682446716943572, 0.16504462189237837, 0.0037249294142435553, -0.028330763615831787, 0.012284653941759656, -0.08941549652183926, 0.09627295775760399, 0.2498862404920633, 0.11159325728494622, 0.30604311840897297, -0.4467842500709312, -0.21473561066635688, 0.14557691767621575, 0.14127691713174884, 0.0794176123593606, 0.0052538666428184845, -0.22449360734743762, 0.023052998838132957, -0.17263422001310638, -0.16958026046877805, -0.06214300521754358, -0.0068701664018641475, 0.032108017287715535, -0.3196758910338066, 0.10435829608017434, 0.08128555223975382, 0.019933065176944733, -0.050670508962636154, -0.08246685898515173, 0.0020551821118561736, 0.08499685870024415, 0.04340247914312296, 0.04085692206871512, 0.08075561627260291, -0.13790096561949122, -0.07700672174777679, 0.37221123938593015, -0.11294818663490858, -0.3003820348071905, 0.08493410366993974, -0.1063418811659368, -0.11132348746776213, 0.13014620114904893, 0.16183223801953586, 0.10829721163617263, -0.2291497674403371, 0.14462977619784306, -0.03583623810251519, 0.17112203838851328, 0.054437182243572364, -0.060413419944562126, 0.1525046406133415, 0.17088980282965102, 0.08651227525494416, 0.11207636888712828, -0.011703035020282571, -0.1347431122349136, -0.3198731636475201, -0.1765980098140754, -0.14510379670116916, 0.05762372299396305, -0.11573497227421374, -0.19937632124093, 0.3882982402918598, 0.11101453736240804, 0.14887300503610726, 0.07306476619789823, 0.27151797414088336, 0.23808687743009396, 0.0304581707320504, 0.06310732652347954, 0.17333415390031648, 0.0768499179664527, 0.09508469173501075, -0.19674033271132405, 0.1534622134116124, 0.12718862722444177] |
1,802.09612 | MILE: A Multi-Level Framework for Scalable Graph Embedding | Recently there has been a surge of interest in designing graph embedding
methods. Few, if any, can scale to a large-sized graph with millions of nodes
due to both computational complexity and memory requirements. In this paper, we
relax this limitation by introducing the MultI-Level Embedding (MILE) framework
-- a generic methodology allowing contemporary graph embedding methods to scale
to large graphs. MILE repeatedly coarsens the graph into smaller ones using a
hybrid matching technique to maintain the backbone structure of the graph. It
then applies existing embedding methods on the coarsest graph and refines the
embeddings to the original graph through a graph convolution neural network
that it learns. The proposed MILE framework is agnostic to the underlying graph
embedding techniques and can be applied to many existing graph embedding
methods without modifying them. We employ our framework on several popular
graph embedding techniques and conduct embedding for real-world graphs.
Experimental results on five large-scale datasets demonstrate that MILE
significantly boosts the speed (order of magnitude) of graph embedding while
generating embeddings of better quality, for the task of node classification.
MILE can comfortably scale to a graph with 9 million nodes and 40 million
edges, on which existing methods run out of memory or take too long to compute
on a modern workstation. Our code and data are publicly available with detailed
instructions for adding new base embedding methods:
\url{https://github.com/jiongqian/MILE}.
| cs.AI cs.SI | recently there has been a surge of interest in designing graph embedding methods few if any can scale to a largesized graph with millions of nodes due to both computational complexity and memory requirements in this paper we relax this limitation by introducing the multilevel embedding mile framework a generic methodology allowing contemporary graph embedding methods to scale to large graphs mile repeatedly coarsens the graph into smaller ones using a hybrid matching technique to maintain the backbone structure of the graph it then applies existing embedding methods on the coarsest graph and refines the embeddings to the original graph through a graph convolution neural network that it learns the proposed mile framework is agnostic to the underlying graph embedding techniques and can be applied to many existing graph embedding methods without modifying them we employ our framework on several popular graph embedding techniques and conduct embedding for realworld graphs experimental results on five largescale datasets demonstrate that mile significantly boosts the speed order of magnitude of graph embedding while generating embeddings of better quality for the task of node classification mile can comfortably scale to a graph with 9 million nodes and 40 million edges on which existing methods run out of memory or take too long to compute on a modern workstation our code and data are publicly available with detailed instructions for adding new base embedding methods urlhttpsgithubcomjiongqianmile | [['recently', 'there', 'has', 'been', 'a', 'surge', 'of', 'interest', 'in', 'designing', 'graph', 'embedding', 'methods', 'few', 'if', 'any', 'can', 'scale', 'to', 'a', 'largesized', 'graph', 'with', 'millions', 'of', 'nodes', 'due', 'to', 'both', 'computational', 'complexity', 'and', 'memory', 'requirements', 'in', 'this', 'paper', 'we', 'relax', 'this', 'limitation', 'by', 'introducing', 'the', 'multilevel', 'embedding', 'mile', 'framework', 'a', 'generic', 'methodology', 'allowing', 'contemporary', 'graph', 'embedding', 'methods', 'to', 'scale', 'to', 'large', 'graphs', 'mile', 'repeatedly', 'coarsens', 'the', 'graph', 'into', 'smaller', 'ones', 'using', 'a', 'hybrid', 'matching', 'technique', 'to', 'maintain', 'the', 'backbone', 'structure', 'of', 'the', 'graph', 'it', 'then', 'applies', 'existing', 'embedding', 'methods', 'on', 'the', 'coarsest', 'graph', 'and', 'refines', 'the', 'embeddings', 'to', 'the', 'original', 'graph', 'through', 'a', 'graph', 'convolution', 'neural', 'network', 'that', 'it', 'learns', 'the', 'proposed', 'mile', 'framework', 'is', 'agnostic', 'to', 'the', 'underlying', 'graph', 'embedding', 'techniques', 'and', 'can', 'be', 'applied', 'to', 'many', 'existing', 'graph', 'embedding', 'methods', 'without', 'modifying', 'them', 'we', 'employ', 'our', 'framework', 'on', 'several', 'popular', 'graph', 'embedding', 'techniques', 'and', 'conduct', 'embedding', 'for', 'realworld', 'graphs', 'experimental', 'results', 'on', 'five', 'largescale', 'datasets', 'demonstrate', 'that', 'mile', 'significantly', 'boosts', 'the', 'speed', 'order', 'of', 'magnitude', 'of', 'graph', 'embedding', 'while', 'generating', 'embeddings', 'of', 'better', 'quality', 'for', 'the', 'task', 'of', 'node', 'classification', 'mile', 'can', 'comfortably', 'scale', 'to', 'a', 'graph', 'with', '9', 'million', 'nodes', 'and', '40', 'million', 'edges', 'on', 'which', 'existing', 'methods', 'run', 'out', 'of', 'memory', 'or', 'take', 'too', 'long', 'to', 'compute', 'on', 'a', 'modern', 'workstation', 'our', 'code', 'and', 'data', 'are', 'publicly', 'available', 'with', 'detailed', 'instructions', 'for', 'adding', 'new', 'base', 'embedding', 'methods', 'urlhttpsgithubcomjiongqianmile']] | [-0.05808918253802087, 0.0005153864358916231, -0.04661689817338534, 0.060061172346468086, -0.15598420364903692, -0.15774217415449168, 0.05819416829946694, 0.43335382548444296, -0.2976542272463279, -0.3941767008448748, 0.12099249528862698, -0.2818829825995794, -0.14521592955165746, 0.17468297698474286, -0.10023724013210639, 0.08353460560876715, 0.17090174380548137, 0.061507575487232076, -0.032553660697506176, -0.30262594935699344, 0.2979683576718621, 0.02948784780810061, 0.31392363805485807, 0.045205358798209444, 0.11309653924583235, -0.002676454434454765, -0.04748947404871654, 0.0641024792703557, -0.08066359294164653, 0.1924716696507581, 0.2682584081827056, 0.1999263523136387, 0.30721587389707566, -0.46234761321836193, -0.2534852439856521, 0.13522419464754185, 0.14918044940112968, 0.11060445713930835, -0.005247472779845576, -0.2906093780373972, 0.1450869637015073, -0.16938283841085175, 0.02042242654538511, -0.1242908526060131, -0.004473906406201422, -0.037408751772423074, -0.2522732118891208, -0.04578472095764364, 0.0695928722559272, 0.01084097861919714, 0.04486383647536454, -0.10525365795980653, 0.02268357170826715, 0.14482282300621432, -0.00802848884511901, 0.07381900879149528, 0.1186872788320255, -0.10610690135103854, -0.16977024376088673, 0.3774213912613366, -0.03654855356947772, -0.1849874511786291, 0.18047028403810184, -0.033144814701264964, -0.18557453712084046, 0.10435618541365409, 0.21462109123063072, 0.08603360468076299, -0.1389268223907414, 0.08438434081263435, -0.01167761312554712, 0.190632990987607, 0.06813580858136487, -0.010424901175555652, 0.11482279696704253, 0.26016527529800837, 0.09420900651248698, 0.1325393631846806, -0.07306750207524443, -0.07124471706692534, -0.18930157391435426, -0.09244207369325602, -0.21120747840234444, -0.0051192180779965025, -0.18927933790521068, -0.14818404774211913, 0.46162834050457763, 0.1889477991701468, 0.2023262679030228, 0.10392767191844304, 0.34241014179424384, 0.0009023795936904524, 0.16151539207193824, 0.16160623932879864, 0.12350591519827266, 0.05518420318485764, 0.09967713699272439, -0.0953974247859467, 0.055798823043258616, 0.10499361487226966] |
1,802.09613 | Status report of the ESCULAP project at Orsay: External injection of low
energy electrons in a Plasma | The ESCULAP project aims at studying external injection of low energy
(\SI{10}{MeV}) electrons in a plasma in the quasilinear regime. This facility
will use the photo injector PHIL and the high power laser LASERIX. We will give
a status report of the preliminary work on the facility and the status of the
two machines. We will also present the results of simulations showing the
expected performances of the facility.
| physics.acc-ph | the esculap project aims at studying external injection of low energy si10mev electrons in a plasma in the quasilinear regime this facility will use the photo injector phil and the high power laser laserix we will give a status report of the preliminary work on the facility and the status of the two machines we will also present the results of simulations showing the expected performances of the facility | [['the', 'esculap', 'project', 'aims', 'at', 'studying', 'external', 'injection', 'of', 'low', 'energy', 'si10mev', 'electrons', 'in', 'a', 'plasma', 'in', 'the', 'quasilinear', 'regime', 'this', 'facility', 'will', 'use', 'the', 'photo', 'injector', 'phil', 'and', 'the', 'high', 'power', 'laser', 'laserix', 'we', 'will', 'give', 'a', 'status', 'report', 'of', 'the', 'preliminary', 'work', 'on', 'the', 'facility', 'and', 'the', 'status', 'of', 'the', 'two', 'machines', 'we', 'will', 'also', 'present', 'the', 'results', 'of', 'simulations', 'showing', 'the', 'expected', 'performances', 'of', 'the', 'facility']] | [-0.1393659494111917, 0.14819806223214768, -0.09180445552748792, 0.03206913327106603, -0.02935872907983139, -0.08753288593417143, 0.05614677466955447, 0.3589571539093466, -0.20210138003697947, -0.3207491796244593, 0.09245961189598721, -0.30052639124915004, -0.036181030857465775, 0.23386536290704765, -0.03623060432865339, 0.037089061039938205, 0.08568753977306187, -0.0020333381287534445, -0.03459680385148043, -0.2031219600535491, 0.3006026382722399, 0.22332097872790388, 0.2984494897947811, 0.14178795245585635, 0.09634774408357985, -0.017032902681796046, -0.05332899030626697, -0.03240501195849741, -0.14979224497694624, 0.07718968863585307, 0.25081472813754396, 0.1205648774835829, 0.2911384995095432, -0.4452886005096576, -0.10942750068737522, 0.03483404110267978, 0.0873943150646108, 0.07957183840848944, -0.11448971774627674, -0.21315364764236353, 0.04552239893853445, -0.17351905970067225, -0.1880774812444168, 0.019691577181220055, -0.06355596493984408, 0.10908362107104896, -0.2431598157478113, -0.050959969823238416, 0.036851486636270935, 0.03759046997327138, -0.0836337989757714, -0.13979900229777045, 0.0702470406780348, 0.10348556655192036, -0.017894484308164788, 0.037849552265149265, 0.13287980531287544, -0.17762729517690948, -0.12320598099819001, 0.37648392482386794, -0.08041642845936996, -0.07982578835285761, 0.18536678614670082, -0.22152753048302495, -0.1140767008285312, 0.06217967045000371, 0.22186799822649098, 0.12013704544755027, -0.14827913491000586, 0.04340040779831778, -0.015497294049162199, 0.11468703481231761, 0.0010335440884399064, 0.007195568109369453, 0.2158805701388594, 0.23334431248333523, 0.026138615493169603, 0.1757996656062246, -0.1638263880419853, 0.03170421744203743, -0.34955254976418526, -0.1421883071307093, -0.11085535138023689, 0.044176848057438343, 0.03895763626282774, -0.05275843858544249, 0.4694843730848173, 0.18720962151008494, 0.11294052267775816, 0.002803837281295701, 0.3366637369069983, 0.08181371187846012, -0.018068776959005522, 0.048020419842727924, 0.2703849171589622, 0.05678824153180946, 0.19716219933402232, -0.2787033406579319, 0.011061595876098555, 0.0056926026830778406] |
1,802.09614 | Evolution of ferromagnetism in two-dimensional electron gas of
LaTiO3/SrTiO3 | Understanding, creating, and manipulating spin polarization of
two-dimensional electron gases at complex oxide interfaces presents an
experimental challenge. For example, despite almost a decade long research
effort, the microscopic origin of ferromagnetism in LaAlO3/SrTiO3
heterojunction is still an open question. Here, by using a prototypical
two-dimensional electron gas (2DEG) which emerges at the interface between band
insulator SrTiO3 and antiferromagnetic Mott insulator LaTiO3 , the experiment
reveals the evidence for magnetic phase separation in hole-doped Ti d1 t2g
system resulting in spin-polarized 2DEG. The details of electronic and magnetic
properties of the 2DEG were investigated by temperature-dependent d.c.
transport, angle-dependent X-ray photoemission spectroscopy, and
temperature-dependent magnetoresistance. The observation of clear hysteresis in
magnetotransport at low magnetic fields implies spin-polarization from magnetic
islands in the hole rich LaTiO3 near the interface. These findings emphasize
the role of magnetic instabilities in doped Mott insulators thus providing
another path for designing all-oxide structures relevant to spintronics
applications.
| cond-mat.str-el cond-mat.mtrl-sci | understanding creating and manipulating spin polarization of twodimensional electron gases at complex oxide interfaces presents an experimental challenge for example despite almost a decade long research effort the microscopic origin of ferromagnetism in laalo3srtio3 heterojunction is still an open question here by using a prototypical twodimensional electron gas 2deg which emerges at the interface between band insulator srtio3 and antiferromagnetic mott insulator latio3 the experiment reveals the evidence for magnetic phase separation in holedoped ti d1 t2g system resulting in spinpolarized 2deg the details of electronic and magnetic properties of the 2deg were investigated by temperaturedependent dc transport angledependent xray photoemission spectroscopy and temperaturedependent magnetoresistance the observation of clear hysteresis in magnetotransport at low magnetic fields implies spinpolarization from magnetic islands in the hole rich latio3 near the interface these findings emphasize the role of magnetic instabilities in doped mott insulators thus providing another path for designing alloxide structures relevant to spintronics applications | [['understanding', 'creating', 'and', 'manipulating', 'spin', 'polarization', 'of', 'twodimensional', 'electron', 'gases', 'at', 'complex', 'oxide', 'interfaces', 'presents', 'an', 'experimental', 'challenge', 'for', 'example', 'despite', 'almost', 'a', 'decade', 'long', 'research', 'effort', 'the', 'microscopic', 'origin', 'of', 'ferromagnetism', 'in', 'laalo3srtio3', 'heterojunction', 'is', 'still', 'an', 'open', 'question', 'here', 'by', 'using', 'a', 'prototypical', 'twodimensional', 'electron', 'gas', '2deg', 'which', 'emerges', 'at', 'the', 'interface', 'between', 'band', 'insulator', 'srtio3', 'and', 'antiferromagnetic', 'mott', 'insulator', 'latio3', 'the', 'experiment', 'reveals', 'the', 'evidence', 'for', 'magnetic', 'phase', 'separation', 'in', 'holedoped', 'ti', 'd1', 't2g', 'system', 'resulting', 'in', 'spinpolarized', '2deg', 'the', 'details', 'of', 'electronic', 'and', 'magnetic', 'properties', 'of', 'the', '2deg', 'were', 'investigated', 'by', 'temperaturedependent', 'dc', 'transport', 'angledependent', 'xray', 'photoemission', 'spectroscopy', 'and', 'temperaturedependent', 'magnetoresistance', 'the', 'observation', 'of', 'clear', 'hysteresis', 'in', 'magnetotransport', 'at', 'low', 'magnetic', 'fields', 'implies', 'spinpolarization', 'from', 'magnetic', 'islands', 'in', 'the', 'hole', 'rich', 'latio3', 'near', 'the', 'interface', 'these', 'findings', 'emphasize', 'the', 'role', 'of', 'magnetic', 'instabilities', 'in', 'doped', 'mott', 'insulators', 'thus', 'providing', 'another', 'path', 'for', 'designing', 'alloxide', 'structures', 'relevant', 'to', 'spintronics', 'applications']] | [-0.20857726546724212, 0.20526136674030282, 0.010820601872028478, 0.039393103842051344, -0.027343326995417087, -0.21761365463383484, 0.08410179302145064, 0.42393607183609133, -0.254749927965177, -0.3133689618967717, -0.044918604367077834, -0.3406934528733342, -0.1519318059683333, 0.24343978469351343, 0.07741423319489543, 0.026955480492533813, -0.06669455865288482, -0.18237912572853365, -0.13452337588201843, -0.1728647504020117, 0.2702189094403734, 0.03749006965769808, 0.3150677685199756, 0.1732066244859358, 0.030621420439892733, 0.0006814031097794475, 0.17854843433228096, 0.0031894694837236327, -0.1649308475343133, 0.03384846039580522, 0.3295810515277112, -0.19883437406536483, 0.20769547196287735, -0.5071196981303978, -0.22584082900844757, -0.13094812227425232, 0.15152869656913323, 0.1520150694531979, -0.1799752619969689, -0.2983436197243339, -0.0076477920417399965, -0.09747336859802648, -0.12732699027116062, -0.09292712520345364, -0.017783085374295515, -0.08253976279165787, -0.19296514818724853, 0.10355435389632761, 0.06531928625837383, 0.18131064502461477, -0.15107965383836938, -0.09669985596373604, -0.08877357743144815, 0.057201407810222676, 0.035377542705889914, 0.08936914657029549, 0.18954100424813386, -0.13934587443618748, -0.13281754399132398, 0.3230534798459582, 0.004277277442632742, -0.007093761794214302, 0.17849882823275098, -0.26312043623134396, -0.07240705646184925, 0.17743567898534726, 0.09373785105527811, 0.05430378440731004, -0.1550354747698198, 0.11467969880969678, -0.032476702075013346, 0.1742469584561726, 0.01967784596661873, 0.1384616819167741, 0.3778132138440627, 0.25881771202993525, 0.030515221079957543, 0.1338442275696282, -0.14552090348663674, -0.004743577579182445, -0.1526169811955233, -0.22369594736408224, -0.23836692686807487, 0.09506773233361956, -0.03004718497905308, -0.2232586709889766, 0.402643248387095, 0.15723431993312403, 0.12175579951296932, -0.16786638511804364, 0.2539567692582709, 0.054629611485984685, 0.024795927156030743, 0.03198219875324201, 0.22210174861662332, 0.18338852810819506, 0.19686713528642857, -0.3099631831990372, 0.09796414399531737, 0.008323512334921367] |
1,802.09615 | Internal and surface waves in vibrofluidized granular materials: Role of
cohesion | Wave phenomena in vibrofluidized dry and partially wet granular materials
confined in a quasi-two-dimensional geometry are investigated with numerical
simulations considering individual particles as hard spheres. Short ranged
cohesive interactions arising from the formation of liquid bridges between
adjacent particles are modeled by changing the velocity dependent coefficient
of restitution. Such a change effectively suppresses the formation of surface
waves, in agreement with previous experimental observations. The difference in
pattern creation arises from the suppressed momentum transfer due to wetting
and it can be quantitatively understood from an analysis of binary impacts.
| cond-mat.soft | wave phenomena in vibrofluidized dry and partially wet granular materials confined in a quasitwodimensional geometry are investigated with numerical simulations considering individual particles as hard spheres short ranged cohesive interactions arising from the formation of liquid bridges between adjacent particles are modeled by changing the velocity dependent coefficient of restitution such a change effectively suppresses the formation of surface waves in agreement with previous experimental observations the difference in pattern creation arises from the suppressed momentum transfer due to wetting and it can be quantitatively understood from an analysis of binary impacts | [['wave', 'phenomena', 'in', 'vibrofluidized', 'dry', 'and', 'partially', 'wet', 'granular', 'materials', 'confined', 'in', 'a', 'quasitwodimensional', 'geometry', 'are', 'investigated', 'with', 'numerical', 'simulations', 'considering', 'individual', 'particles', 'as', 'hard', 'spheres', 'short', 'ranged', 'cohesive', 'interactions', 'arising', 'from', 'the', 'formation', 'of', 'liquid', 'bridges', 'between', 'adjacent', 'particles', 'are', 'modeled', 'by', 'changing', 'the', 'velocity', 'dependent', 'coefficient', 'of', 'restitution', 'such', 'a', 'change', 'effectively', 'suppresses', 'the', 'formation', 'of', 'surface', 'waves', 'in', 'agreement', 'with', 'previous', 'experimental', 'observations', 'the', 'difference', 'in', 'pattern', 'creation', 'arises', 'from', 'the', 'suppressed', 'momentum', 'transfer', 'due', 'to', 'wetting', 'and', 'it', 'can', 'be', 'quantitatively', 'understood', 'from', 'an', 'analysis', 'of', 'binary', 'impacts']] | [-0.1386176273049584, 0.2789189649972642, -0.056170657371378344, 0.0470448130255808, -0.01802116720026116, -0.10705299067068035, 0.0007000679438731269, 0.3746503755733695, -0.31092701292515773, -0.3388322223909199, 0.028103744930020817, -0.31934105702068494, -0.146438448689878, 0.14630666911113582, 0.007890014792792499, 0.008049827481559276, 0.046081209373053, -0.09582282820433054, -0.06942811174034748, -0.15140033502678346, 0.2849628733288821, 0.05320161783500858, 0.2554260382084581, 0.09039465880588345, 0.05203122495795074, 0.03249321754731721, -0.04533212611694699, 0.07600321073044577, -0.17026916790105726, 0.032636943513669234, 0.26061408721801377, -0.06294576133317921, 0.1632619245442386, -0.4820835148553749, -0.2709450159707795, 0.02077690493720381, 0.13487279578112066, 0.09561533239953544, -0.07512263874599265, -0.26343383752037364, -0.014738641909586833, -0.1753808420262826, -0.13165174870569582, -0.003929672590659365, 0.015534815186148753, 0.07514770296573102, -0.2184084882332093, 0.1886523486407342, 0.04018829402807371, 0.04812455936537489, -0.09204555567070517, -0.04670546769731394, -0.07722464615843543, 0.12222473850314323, 0.07579284201821555, -0.0003695546892350135, 0.21352836756926516, -0.1384376873263492, -0.059538240746959396, 0.43724343897369894, -0.05736557772869001, -0.1868800174890329, 0.27715496937541856, -0.15361220406307635, -0.02196837994067565, 0.2288521349824884, 0.1920352922246346, 0.09025794552618881, -0.10474286550332022, -0.008502255559585097, -0.03714300686947749, 0.16385327746241313, 0.12360836253197782, -0.031510404300443835, 0.3084561383432668, 0.22495125780772904, -0.038899421494494636, 0.1457487955909607, -0.07593390492357961, -0.14055388761967744, -0.22334925986259527, -0.10278624244813767, -0.2091489470280383, 0.02451092082391488, -0.06506152006097735, -0.16149046575098866, 0.28340405615492037, 0.08362961755863027, 0.21955889723081465, -0.03438681340776384, 0.2575643580859595, 0.050649950390873964, 0.0485281802779671, 0.030843047840196803, 0.2855680867746148, 0.1522914961147446, 0.11606719918832507, -0.2441105554664872, 0.13123713564330144, -0.0008161701768150796] |
1,802.09616 | Hall viscosity and nonlocal conductivity of "gapped graphene" | We calculate the Hall viscosity and the nonlocal (i.e., dependent on wave
vector $\bm q$) Hall conductivity of "gapped graphene" (a non-topological
insulator with two valleys) in the presence of a strong perpendicular magnetic
field. Using the linear-response theory at zero temperature within the Dirac
approximation for the Landau levels, we present analytical expressions for both
valley and total Hall viscosity and conductivity up to $\bm q^2$ at all
frequencies. Although the final formulas for total Hall viscosity and
conductivity are similar to the ones previously obtained for gapless graphene,
the derivation reveals a significant difference between the two systems. First
of all, both the Hall viscosity and the Hall conductivity vanish when the Fermi
level lies in the gap that separates the lowest Landau level in the conduction
band from the highest Landau level in the valence band. It is only when the
Fermi level {\it is not} in the gap that the familiar formulas of gapless
graphene are recovered. Second, in the case of gapped graphene, it is not
possible (at least within our present approach) to define a single-valley Hall
viscosity: this quantity diverges with a strength proportional to the magnitude
of the gap. It is only when both valleys are included that the diverging terms,
having opposite signs in the two valleys, cancel out and the familiar result is
recovered. In contrast to this, the nonlocal Hall conductivity is finite in
each valley. These results indicate that the Hoyos-Son formula connecting the
Hall viscosity to the coefficient of $q^2$ in the small-$q$ expansion of the
$q$-dependent Hall conductivity cannot be applied to each valley, but only to
the system as a whole. The problem of defining a "valley Hall viscosity"
remains open.
| cond-mat.mes-hall | we calculate the hall viscosity and the nonlocal ie dependent on wave vector bm q hall conductivity of gapped graphene a nontopological insulator with two valleys in the presence of a strong perpendicular magnetic field using the linearresponse theory at zero temperature within the dirac approximation for the landau levels we present analytical expressions for both valley and total hall viscosity and conductivity up to bm q2 at all frequencies although the final formulas for total hall viscosity and conductivity are similar to the ones previously obtained for gapless graphene the derivation reveals a significant difference between the two systems first of all both the hall viscosity and the hall conductivity vanish when the fermi level lies in the gap that separates the lowest landau level in the conduction band from the highest landau level in the valence band it is only when the fermi level it is not in the gap that the familiar formulas of gapless graphene are recovered second in the case of gapped graphene it is not possible at least within our present approach to define a singlevalley hall viscosity this quantity diverges with a strength proportional to the magnitude of the gap it is only when both valleys are included that the diverging terms having opposite signs in the two valleys cancel out and the familiar result is recovered in contrast to this the nonlocal hall conductivity is finite in each valley these results indicate that the hoyosson formula connecting the hall viscosity to the coefficient of q2 in the smallq expansion of the qdependent hall conductivity cannot be applied to each valley but only to the system as a whole the problem of defining a valley hall viscosity remains open | [['we', 'calculate', 'the', 'hall', 'viscosity', 'and', 'the', 'nonlocal', 'ie', 'dependent', 'on', 'wave', 'vector', 'bm', 'q', 'hall', 'conductivity', 'of', 'gapped', 'graphene', 'a', 'nontopological', 'insulator', 'with', 'two', 'valleys', 'in', 'the', 'presence', 'of', 'a', 'strong', 'perpendicular', 'magnetic', 'field', 'using', 'the', 'linearresponse', 'theory', 'at', 'zero', 'temperature', 'within', 'the', 'dirac', 'approximation', 'for', 'the', 'landau', 'levels', 'we', 'present', 'analytical', 'expressions', 'for', 'both', 'valley', 'and', 'total', 'hall', 'viscosity', 'and', 'conductivity', 'up', 'to', 'bm', 'q2', 'at', 'all', 'frequencies', 'although', 'the', 'final', 'formulas', 'for', 'total', 'hall', 'viscosity', 'and', 'conductivity', 'are', 'similar', 'to', 'the', 'ones', 'previously', 'obtained', 'for', 'gapless', 'graphene', 'the', 'derivation', 'reveals', 'a', 'significant', 'difference', 'between', 'the', 'two', 'systems', 'first', 'of', 'all', 'both', 'the', 'hall', 'viscosity', 'and', 'the', 'hall', 'conductivity', 'vanish', 'when', 'the', 'fermi', 'level', 'lies', 'in', 'the', 'gap', 'that', 'separates', 'the', 'lowest', 'landau', 'level', 'in', 'the', 'conduction', 'band', 'from', 'the', 'highest', 'landau', 'level', 'in', 'the', 'valence', 'band', 'it', 'is', 'only', 'when', 'the', 'fermi', 'level', 'it', 'is', 'not', 'in', 'the', 'gap', 'that', 'the', 'familiar', 'formulas', 'of', 'gapless', 'graphene', 'are', 'recovered', 'second', 'in', 'the', 'case', 'of', 'gapped', 'graphene', 'it', 'is', 'not', 'possible', 'at', 'least', 'within', 'our', 'present', 'approach', 'to', 'define', 'a', 'singlevalley', 'hall', 'viscosity', 'this', 'quantity', 'diverges', 'with', 'a', 'strength', 'proportional', 'to', 'the', 'magnitude', 'of', 'the', 'gap', 'it', 'is', 'only', 'when', 'both', 'valleys', 'are', 'included', 'that', 'the', 'diverging', 'terms', 'having', 'opposite', 'signs', 'in', 'the', 'two', 'valleys', 'cancel', 'out', 'and', 'the', 'familiar', 'result', 'is', 'recovered', 'in', 'contrast', 'to', 'this', 'the', 'nonlocal', 'hall', 'conductivity', 'is', 'finite', 'in', 'each', 'valley', 'these', 'results', 'indicate', 'that', 'the', 'hoyosson', 'formula', 'connecting', 'the', 'hall', 'viscosity', 'to', 'the', 'coefficient', 'of', 'q2', 'in', 'the', 'smallq', 'expansion', 'of', 'the', 'qdependent', 'hall', 'conductivity', 'can', 'not', 'be', 'applied', 'to', 'each', 'valley', 'but', 'only', 'to', 'the', 'system', 'as', 'a', 'whole', 'the', 'problem', 'of', 'defining', 'a', 'valley', 'hall', 'viscosity', 'remains', 'open']] | [-0.16929059321715306, 0.1902465718025765, -0.0661250506739386, 0.015213678402083737, -0.037726150118986834, -0.14800702447195413, 0.06219443697498629, 0.3144118433941963, -0.2878105949555113, -0.2589848102265774, 0.019473306340543176, -0.3082877980948953, -0.13527581899205443, 0.17054486777177535, 0.00883886574898192, 0.008850577140839158, -0.03880430652411537, -0.020301850591590825, -0.08821169899184732, -0.22297825606074184, 0.30646539958018054, -0.02132432096006049, 0.28536529452833054, 0.10771839088520974, 0.06494188708924017, 0.0017557631766137022, 0.06507528654765338, 0.07119605461480683, -0.12602847873434136, 0.016649397282203385, 0.26703585546799136, -0.128809139406035, 0.21485436079255144, -0.3849907734112202, -0.15015767761213067, 0.003506539417170249, 0.11196086602122686, 0.14522195262899557, 0.02748232830268611, -0.22508024228647208, 0.0702143672518302, -0.16105985891080454, -0.12218720249349733, -0.06291029892432001, 0.03222375479252061, -0.09549698475390099, -0.21351264629161337, 0.14961947759587343, 0.047524294040940857, 0.03271067255614993, -0.1103768948590956, -0.19982950950254705, -0.10221013705689017, 0.12325000057497201, 0.085874750234115, 0.04447997532655905, 0.12239536236632954, -0.1977456102938997, -0.11508967406507191, 0.3782595998242862, -0.08389148963094278, -0.19444069764218652, 0.17435733287618008, -0.27047861279542007, -0.06219219717920035, 0.1648175403690682, 0.08740738563215558, 0.07055226082252535, -0.10530133482708451, 0.10526092451145559, -0.06791641034499923, 0.12263308742679525, 0.061848170677577696, 0.05099749379755499, 0.24734801555807878, 0.11339759338244965, 0.08456015558929632, 0.12283211384641032, -0.12721080623747832, -0.039536289965377315, -0.3062148496339267, -0.1909140073417497, -0.24804398164534094, 0.06442417116407094, -0.05984836169715948, -0.2039373139777527, 0.4156445779241752, 0.15653101567967007, 0.17970861096286794, 0.027370516653661126, 0.28315507101425835, 0.22576048298921253, 0.09397683771639749, 0.09589304379675981, 0.27353195899322474, 0.15594629949883565, 0.11618461778185532, -0.3088034924456135, 0.028414679371256878, 0.033913895184942686] |
1,802.09617 | Multiscale Planar Graph Generation | The study of network representations of physical, biological, and social
phenomena can help us better understand the structural and functional dynamics
of their networks and formulate predictive models of these phenomena. However,
due to the scarcity of real-world network data owing to factors such as cost
and effort required in collection of network data and the sensitivity of this
data towards theft and misuse, engineers and researchers often rely on
synthetic data for simulations, hypothesis testing, decision making, and
algorithm engineering. An important characteristic of infrastructure networks
such as roads, water distribution and other utility systems is that they can be
embedded in a plane, therefore to simulate these system we need realistic
networks which are also planar. While the currently-available synthetic network
generators can model networks that exhibit realism, they do not guarantee or
achieve planarity. Therefore, in this paper we present a flexible algorithm
that can synthesize realistic networks that are planar. The method follows a
multi-scale randomized editing approach generating a hierarchy of coarsened
networks of a given planar graph and introducing edits at various levels in the
hierarchy. The method preserves the structural properties with minimal bias
including the planarity of the network, while introducing realistic variability
at multiple scales.
| cs.SI cs.DS | the study of network representations of physical biological and social phenomena can help us better understand the structural and functional dynamics of their networks and formulate predictive models of these phenomena however due to the scarcity of realworld network data owing to factors such as cost and effort required in collection of network data and the sensitivity of this data towards theft and misuse engineers and researchers often rely on synthetic data for simulations hypothesis testing decision making and algorithm engineering an important characteristic of infrastructure networks such as roads water distribution and other utility systems is that they can be embedded in a plane therefore to simulate these system we need realistic networks which are also planar while the currentlyavailable synthetic network generators can model networks that exhibit realism they do not guarantee or achieve planarity therefore in this paper we present a flexible algorithm that can synthesize realistic networks that are planar the method follows a multiscale randomized editing approach generating a hierarchy of coarsened networks of a given planar graph and introducing edits at various levels in the hierarchy the method preserves the structural properties with minimal bias including the planarity of the network while introducing realistic variability at multiple scales | [['the', 'study', 'of', 'network', 'representations', 'of', 'physical', 'biological', 'and', 'social', 'phenomena', 'can', 'help', 'us', 'better', 'understand', 'the', 'structural', 'and', 'functional', 'dynamics', 'of', 'their', 'networks', 'and', 'formulate', 'predictive', 'models', 'of', 'these', 'phenomena', 'however', 'due', 'to', 'the', 'scarcity', 'of', 'realworld', 'network', 'data', 'owing', 'to', 'factors', 'such', 'as', 'cost', 'and', 'effort', 'required', 'in', 'collection', 'of', 'network', 'data', 'and', 'the', 'sensitivity', 'of', 'this', 'data', 'towards', 'theft', 'and', 'misuse', 'engineers', 'and', 'researchers', 'often', 'rely', 'on', 'synthetic', 'data', 'for', 'simulations', 'hypothesis', 'testing', 'decision', 'making', 'and', 'algorithm', 'engineering', 'an', 'important', 'characteristic', 'of', 'infrastructure', 'networks', 'such', 'as', 'roads', 'water', 'distribution', 'and', 'other', 'utility', 'systems', 'is', 'that', 'they', 'can', 'be', 'embedded', 'in', 'a', 'plane', 'therefore', 'to', 'simulate', 'these', 'system', 'we', 'need', 'realistic', 'networks', 'which', 'are', 'also', 'planar', 'while', 'the', 'currentlyavailable', 'synthetic', 'network', 'generators', 'can', 'model', 'networks', 'that', 'exhibit', 'realism', 'they', 'do', 'not', 'guarantee', 'or', 'achieve', 'planarity', 'therefore', 'in', 'this', 'paper', 'we', 'present', 'a', 'flexible', 'algorithm', 'that', 'can', 'synthesize', 'realistic', 'networks', 'that', 'are', 'planar', 'the', 'method', 'follows', 'a', 'multiscale', 'randomized', 'editing', 'approach', 'generating', 'a', 'hierarchy', 'of', 'coarsened', 'networks', 'of', 'a', 'given', 'planar', 'graph', 'and', 'introducing', 'edits', 'at', 'various', 'levels', 'in', 'the', 'hierarchy', 'the', 'method', 'preserves', 'the', 'structural', 'properties', 'with', 'minimal', 'bias', 'including', 'the', 'planarity', 'of', 'the', 'network', 'while', 'introducing', 'realistic', 'variability', 'at', 'multiple', 'scales']] | [-0.09756204725343588, 0.03580833509669687, -0.058436792832342724, 0.09640598574404459, -0.09282919845781197, -0.14586026913157718, 0.05179190720995322, 0.4223777945906691, -0.28959257107264563, -0.39136122738230317, 0.10533753888404473, -0.2529489999755706, -0.22114215772051146, 0.17840637711353838, -0.08233646044074668, 0.09816461018122294, 0.09861553309247921, -0.005091137605417958, -0.008309098391156807, -0.22993799877554458, 0.3257105685799045, 0.06323802459975887, 0.33141558032081114, 0.06079018791890977, 0.07693586531254992, -0.03756508325094211, -0.01573246490557258, 0.048472558350505436, -0.05615689401476594, 0.15450779693235425, 0.276014272873088, 0.19870018530248976, 0.28601766419231744, -0.4983181459829211, -0.2499458715684858, 0.14669545221783897, 0.12846540253810293, 0.11669621332811064, 0.001057278921293533, -0.27552121062306506, 0.08300100309847325, -0.1408184154630255, -0.08716392301150835, -0.13855626792578465, -0.038097247256504777, 0.029841546267704747, -0.27346720390350504, 0.02633810643087867, 0.05800772280267933, 0.07653598099137061, -0.005928974907945695, -0.07389940725760442, -0.04238083107937949, 0.19169479211753546, -0.0076807578483496005, -0.005422166821446416, 0.14230948001917854, -0.1720083781458693, -0.14322405106698474, 0.4106865990450423, 0.024343537135328185, -0.19302006381308184, 0.2232789117106757, -0.06177937620155075, -0.18578787978884637, 0.09845008522810816, 0.24362580549866691, 0.06753512849465158, -0.17552628644340323, 0.01539618658146127, -0.023496252222685143, 0.15970918081139268, 0.03554761469108509, 0.03626101665591419, 0.18906290887617597, 0.2280186805828456, 0.06562744057394893, 0.10277160032459434, -0.062390888437363956, -0.062366632789181656, -0.22297042972372855, -0.11149534779399925, -0.1723724489263487, 0.020744099152829685, -0.12302106625429587, -0.17169942169486746, 0.39776519365499124, 0.2000487930570528, 0.167517304112313, 0.10395809681344248, 0.2996539313850614, 0.04827183651436558, 0.1068769698773109, 0.06665408081493761, 0.1542641294665872, 0.05843979779713075, 0.12141679026706911, -0.17329237949874654, 0.12856306300576156, -0.016996509731089807] |
1,802.09618 | Community detection using boundary nodes in complex networks | We propose a new local community detection algorithm that finds communities
by identifying borderlines between them using boundary nodes. Our method
performs label propagation for community detection, where nodes decide their
labels based on the largest "benefit score" exhibited by their immediate
neighbors as an attractor to their communities. We try different metrics and
find that using the number of common neighbors as benefit scores leads to
better decisions for community structure. The proposed algorithm has a local
approach and focuses only on boundary nodes during iterations of label
propagation, which eliminates unnecessary steps and shortens the overall
execution time. It preserves small communities as well as big ones and can
outperform other algorithms in terms of the quality of the identified
communities, especially when the community structure is subtle. The algorithm
has a distributed nature and can be used on large networks in a parallel
fashion.
| physics.soc-ph cs.SI | we propose a new local community detection algorithm that finds communities by identifying borderlines between them using boundary nodes our method performs label propagation for community detection where nodes decide their labels based on the largest benefit score exhibited by their immediate neighbors as an attractor to their communities we try different metrics and find that using the number of common neighbors as benefit scores leads to better decisions for community structure the proposed algorithm has a local approach and focuses only on boundary nodes during iterations of label propagation which eliminates unnecessary steps and shortens the overall execution time it preserves small communities as well as big ones and can outperform other algorithms in terms of the quality of the identified communities especially when the community structure is subtle the algorithm has a distributed nature and can be used on large networks in a parallel fashion | [['we', 'propose', 'a', 'new', 'local', 'community', 'detection', 'algorithm', 'that', 'finds', 'communities', 'by', 'identifying', 'borderlines', 'between', 'them', 'using', 'boundary', 'nodes', 'our', 'method', 'performs', 'label', 'propagation', 'for', 'community', 'detection', 'where', 'nodes', 'decide', 'their', 'labels', 'based', 'on', 'the', 'largest', 'benefit', 'score', 'exhibited', 'by', 'their', 'immediate', 'neighbors', 'as', 'an', 'attractor', 'to', 'their', 'communities', 'we', 'try', 'different', 'metrics', 'and', 'find', 'that', 'using', 'the', 'number', 'of', 'common', 'neighbors', 'as', 'benefit', 'scores', 'leads', 'to', 'better', 'decisions', 'for', 'community', 'structure', 'the', 'proposed', 'algorithm', 'has', 'a', 'local', 'approach', 'and', 'focuses', 'only', 'on', 'boundary', 'nodes', 'during', 'iterations', 'of', 'label', 'propagation', 'which', 'eliminates', 'unnecessary', 'steps', 'and', 'shortens', 'the', 'overall', 'execution', 'time', 'it', 'preserves', 'small', 'communities', 'as', 'well', 'as', 'big', 'ones', 'and', 'can', 'outperform', 'other', 'algorithms', 'in', 'terms', 'of', 'the', 'quality', 'of', 'the', 'identified', 'communities', 'especially', 'when', 'the', 'community', 'structure', 'is', 'subtle', 'the', 'algorithm', 'has', 'a', 'distributed', 'nature', 'and', 'can', 'be', 'used', 'on', 'large', 'networks', 'in', 'a', 'parallel', 'fashion']] | [-0.12055975290927656, 0.03206875058753039, -0.060114672192099955, 0.0517290796788384, -0.13791050953112644, -0.1580743941642363, 0.11345721490532286, 0.4260089218325051, -0.2682879478005426, -0.3540753555186346, 0.07755806349807096, -0.2756374406907074, -0.19814508143720552, 0.13954826074551005, -0.07191388264336453, 0.032123284317496816, 0.13333787924299637, 0.10726244880051232, -0.014768771101802993, -0.30060639396804023, 0.28911664430131234, 0.09569691290103254, 0.3126797653531947, 0.029758747158648104, 0.09465870932639468, 0.0015221944769375584, -0.04229173731996494, 0.06213667764816256, -0.04440830694244253, 0.1196668640152887, 0.2959408360132694, 0.2275937729369418, 0.35445649670056845, -0.4343088351215432, -0.18208033954534603, 0.1277001627481726, 0.1680239902573264, 0.11570429584513527, 0.006011808158823473, -0.33483446390070276, 0.11488043458587459, -0.12771233358360243, -0.03665546783373602, -0.1168877153600357, -0.01766672900554781, 0.018081547954550557, -0.22718253063725397, 0.06350502984275166, 0.02426943652922617, 0.020206738735365423, -0.0036240099821569158, -0.1175486707242624, -0.00844414345128145, 0.20037615278891768, 0.05094922243991271, 0.01879369524160248, 0.15273670926626745, -0.13299860687907405, -0.16608245386647022, 0.38875507588694697, -0.014137600548961357, -0.1626235448793337, 0.22113654328998, -0.0139324567894464, -0.13466516808689047, 0.1058284925157521, 0.2171802570351216, 0.10816548825526724, -0.12663948758108126, 0.02979119755066361, -0.023239267006402418, 0.1589496036497306, 0.06158540655421663, 0.010726851350976294, 0.15706736319159872, 0.19563933783585996, 0.1353137078631644, 0.11243717813013805, -0.08547911657908215, -0.07718016778682771, -0.19330353616122284, -0.1376328051349997, -0.22301524723594895, -0.06648130841603896, -0.14036605376257247, -0.17545028107453037, 0.4377514732380708, 0.17608193672091074, 0.21080987963534029, 0.06965714614588109, 0.30340353721201574, 0.035111824298423217, 0.10083394193052485, 0.152586334771445, 0.19865701416329967, 0.0348142250947857, 0.09279030808532725, -0.17585444862821273, 0.16847715942429847, 0.060426109020604565] |
1,802.09619 | Viscous electron flow in mesoscopic two-dimensional electron gas | We report electrical and magneto transport measurements in mesoscopic size,
two-dimensional (2D) electron gas in a GaAs quantum well. Remarkably, we find
that the probe configuration and sample geometry strongly affects the
temperature evolution of local resistance. We attribute all transport
properties to the presence of hydrodynamic effects. Experimental results
confirm the theoretically predicted significance of viscous flow in mesoscopic
devices.
| cond-mat.mes-hall | we report electrical and magneto transport measurements in mesoscopic size twodimensional 2d electron gas in a gaas quantum well remarkably we find that the probe configuration and sample geometry strongly affects the temperature evolution of local resistance we attribute all transport properties to the presence of hydrodynamic effects experimental results confirm the theoretically predicted significance of viscous flow in mesoscopic devices | [['we', 'report', 'electrical', 'and', 'magneto', 'transport', 'measurements', 'in', 'mesoscopic', 'size', 'twodimensional', '2d', 'electron', 'gas', 'in', 'a', 'gaas', 'quantum', 'well', 'remarkably', 'we', 'find', 'that', 'the', 'probe', 'configuration', 'and', 'sample', 'geometry', 'strongly', 'affects', 'the', 'temperature', 'evolution', 'of', 'local', 'resistance', 'we', 'attribute', 'all', 'transport', 'properties', 'to', 'the', 'presence', 'of', 'hydrodynamic', 'effects', 'experimental', 'results', 'confirm', 'the', 'theoretically', 'predicted', 'significance', 'of', 'viscous', 'flow', 'in', 'mesoscopic', 'devices']] | [-0.1716701836166827, 0.15579507645738663, -0.0618267201772723, -0.009152068466436668, 0.005790708884291473, -0.114253686244798, 0.020645148700988682, 0.35253230013625053, -0.2737447967768082, -0.3179116728181233, -0.0171658165779606, -0.3117833070105827, -0.14567897135972, 0.22670076101957287, 0.038366461432248845, 0.09706187461976146, 0.014767634392273231, -0.09652540154877257, -0.0767602174519943, -0.20402430772178304, 0.2443729926656443, 0.08434487583657696, 0.3575563437503869, 0.12114590410998122, 0.049098787852181275, -0.022761565213259616, 0.021926294279391648, 0.13328909055619945, -0.208169298220381, -0.00041732895875074824, 0.19910975007462453, -0.1103637205536065, 0.15856368167967091, -0.5108122806837467, -0.2569825508494358, -0.016981005309851933, 0.13026615387958582, 0.18499119362992342, -0.08847991082832583, -0.2013119357050259, 0.03647738475291455, -0.11628543984022785, -0.1441636784266982, -0.0842641504695181, -0.006267195750699669, 0.011700280659572512, -0.20173726214065416, 0.19470998211229434, 0.03584064238849783, 0.08647199744572405, -0.09849538393323425, -0.05340995439557267, -0.05146155943407021, 0.07646066724078456, -0.04289370808429772, -0.0626546338536456, 0.2729250472267998, -0.18438655676961432, -0.12221858564947473, 0.36689082426248026, -0.07564432664056782, -0.1284180414885832, 0.219496034143004, -0.2640061941814655, -0.04572124696779446, 0.08081179303040759, 0.1937980092909248, 0.10349827870482305, -0.154915029114326, 0.03543918751004595, -0.06200660785018909, 0.1708181828000873, -0.013890040351352731, 0.11612301445795131, 0.24742873226765727, 0.23153371738697417, -0.013749381496769483, 0.14681659023407237, -0.18066116503356827, -0.06830521038596014, -0.2337484015380872, -0.1763837684831414, -0.18543039367831937, 0.13651781783393416, -0.07389033854066883, -0.1751328461543947, 0.4008007305521579, 0.2130272524645094, 0.20666439892327199, -0.03211488585430579, 0.28567791709554247, 0.07329709954430029, 0.02313187893968625, 0.08137880168763585, 0.2915527488822576, 0.18878988155209628, 0.11855319232420354, -0.3697139290695796, 0.08151412094164578, -0.0008056956862450623] |
1,802.0962 | On tradeoffs between width- and fill-like graph parameters | In this work we consider two two-criteria optimization problems: given an
input graph, the goal is to find its interval (or chordal) supergraph that
minimizes the number of edges and its clique number simultaneously. For the
interval supergraph, the problem can be restated as simultaneous minimization
of the pathwidth $pw(G)$ and the profile $p(G)$ of the input graph $G$. We
prove that for an arbitrary graph $G$ and an integer
$t\in\{1,\ldots,pw(G)+1\}$, there exists an interval supergraph $G'$ of $G$
such that for its clique number it holds
$\omega(G')\leq(1+\frac{2}{t})(pw(G)+1)$ and the number of its edges is bounded
by $|E(G')|\leq(t+2)p(G)$. In other words, the pathwidth and the profile of a
graph can be simultaneously minimized within the factors of $1+\frac{2}{t}$
(plus a small constant) and $t+2$, respectively. Note that for a fixed $t$,
both upper bounds provide constant factor approximations. On the negative side,
we show an example that proves that, for some graphs, there is no solution in
which both parameters are optimal.
In case of finding a chordal supergraph, the two corresponding graph
parameters that reflect its clique size and number of edges are the treewidth
and fill-in. We obtain that the treewidth and the fill-in problems are also
`orthogonal' in the sense that for some graphs, a solution that minimizes one
of those parameters cannot minimize the other. As a motivating example, we
recall graph searching games which illustrates a need of simultaneous
minimization of these pairs of graph parameters.
| cs.DM cs.DS | in this work we consider two twocriteria optimization problems given an input graph the goal is to find its interval or chordal supergraph that minimizes the number of edges and its clique number simultaneously for the interval supergraph the problem can be restated as simultaneous minimization of the pathwidth pwg and the profile pg of the input graph g we prove that for an arbitrary graph g and an integer tin1ldotspwg1 there exists an interval supergraph g of g such that for its clique number it holds omegagleq1frac2tpwg1 and the number of its edges is bounded by egleqt2pg in other words the pathwidth and the profile of a graph can be simultaneously minimized within the factors of 1frac2t plus a small constant and t2 respectively note that for a fixed t both upper bounds provide constant factor approximations on the negative side we show an example that proves that for some graphs there is no solution in which both parameters are optimal in case of finding a chordal supergraph the two corresponding graph parameters that reflect its clique size and number of edges are the treewidth and fillin we obtain that the treewidth and the fillin problems are also orthogonal in the sense that for some graphs a solution that minimizes one of those parameters cannot minimize the other as a motivating example we recall graph searching games which illustrates a need of simultaneous minimization of these pairs of graph parameters | [['in', 'this', 'work', 'we', 'consider', 'two', 'twocriteria', 'optimization', 'problems', 'given', 'an', 'input', 'graph', 'the', 'goal', 'is', 'to', 'find', 'its', 'interval', 'or', 'chordal', 'supergraph', 'that', 'minimizes', 'the', 'number', 'of', 'edges', 'and', 'its', 'clique', 'number', 'simultaneously', 'for', 'the', 'interval', 'supergraph', 'the', 'problem', 'can', 'be', 'restated', 'as', 'simultaneous', 'minimization', 'of', 'the', 'pathwidth', 'pwg', 'and', 'the', 'profile', 'pg', 'of', 'the', 'input', 'graph', 'g', 'we', 'prove', 'that', 'for', 'an', 'arbitrary', 'graph', 'g', 'and', 'an', 'integer', 'tin1ldotspwg1', 'there', 'exists', 'an', 'interval', 'supergraph', 'g', 'of', 'g', 'such', 'that', 'for', 'its', 'clique', 'number', 'it', 'holds', 'omegagleq1frac2tpwg1', 'and', 'the', 'number', 'of', 'its', 'edges', 'is', 'bounded', 'by', 'egleqt2pg', 'in', 'other', 'words', 'the', 'pathwidth', 'and', 'the', 'profile', 'of', 'a', 'graph', 'can', 'be', 'simultaneously', 'minimized', 'within', 'the', 'factors', 'of', '1frac2t', 'plus', 'a', 'small', 'constant', 'and', 't2', 'respectively', 'note', 'that', 'for', 'a', 'fixed', 't', 'both', 'upper', 'bounds', 'provide', 'constant', 'factor', 'approximations', 'on', 'the', 'negative', 'side', 'we', 'show', 'an', 'example', 'that', 'proves', 'that', 'for', 'some', 'graphs', 'there', 'is', 'no', 'solution', 'in', 'which', 'both', 'parameters', 'are', 'optimal', 'in', 'case', 'of', 'finding', 'a', 'chordal', 'supergraph', 'the', 'two', 'corresponding', 'graph', 'parameters', 'that', 'reflect', 'its', 'clique', 'size', 'and', 'number', 'of', 'edges', 'are', 'the', 'treewidth', 'and', 'fillin', 'we', 'obtain', 'that', 'the', 'treewidth', 'and', 'the', 'fillin', 'problems', 'are', 'also', 'orthogonal', 'in', 'the', 'sense', 'that', 'for', 'some', 'graphs', 'a', 'solution', 'that', 'minimizes', 'one', 'of', 'those', 'parameters', 'can', 'not', 'minimize', 'the', 'other', 'as', 'a', 'motivating', 'example', 'we', 'recall', 'graph', 'searching', 'games', 'which', 'illustrates', 'a', 'need', 'of', 'simultaneous', 'minimization', 'of', 'these', 'pairs', 'of', 'graph', 'parameters']] | [-0.16730637290762573, 0.08596920860148544, -0.036004198575343246, 0.05279739593344304, -0.12217771616972638, -0.13742675980600186, 0.06942813325759793, 0.4085846212476429, -0.3090074788523594, -0.34497049828315396, 0.1265386709808824, -0.29270852405090625, -0.14881952643249075, 0.1503638991300618, -0.08579791550925356, 0.040995235549716305, 0.11144860801267348, 0.10469990239475209, -0.001014271243141359, -0.25347730592381945, 0.2900751481188328, -0.03226417649187588, 0.1589315863304579, 0.08764032812451135, 0.08972818089672659, 0.030475429013638682, 0.018215857298832527, 0.09958120039173005, -0.14806444642451083, 0.07940022469442219, 0.2727423326509223, 0.19310508949686045, 0.2722293492760273, -0.3882016435320556, -0.17926219393271278, 0.202879692626506, 0.10861585663291645, 0.0619905511151119, -0.0030103166197634887, -0.1774824437457392, 0.11559051755945422, -0.0956875457318366, -0.07048746575660343, -0.012968672533767133, 0.0715223669903628, 0.011974053164621823, -0.30409209282561855, -0.005336965837163206, 0.10315131461262537, -0.0022265964772459905, 0.008611807162983477, -0.17293531182791866, -0.019641189154174635, 0.12991439612712002, -0.0028468640614497448, 0.05442420018734685, 0.05410532158591199, -0.14791587501556028, -0.14844729388299702, 0.36749751179750206, -0.05444660629361931, -0.1903006812196052, 0.10228842019176165, -0.0908973124939241, -0.1676954945730132, 0.0900991101423082, 0.12238259856561631, 0.151163379170535, -0.09166056233289246, 0.125251949166993, -0.11119230735638348, 0.16769503221458085, 0.0944371391274428, 0.012874460797305002, 0.11404021159855783, 0.11500568757077309, 0.1823198509467412, 0.16751092810425436, -0.022342436730307585, -0.004308719916921502, -0.31908650544004413, -0.11463352781229255, -0.23142784925468485, -0.008364398561883226, -0.20257521224376904, -0.1952837236016352, 0.4132720202852025, 0.11594814889011158, 0.23128236835343047, 0.12312143999947636, 0.25449695477983225, 0.1225800465032034, 0.025392058101101515, 0.1644910920297389, 0.16978785776329827, 0.13509584671350094, -0.022964329083493364, -0.20706436356513874, 0.06720184571333701, 0.08391630602233016] |
1,802.09621 | Simultaneous cores with restrictions and a question of Zaleski and
Zeilberger | IMPORTANT NOTE: This paper is much rougher than I'd usually submit, and not
entirely complete, though the main theorems and proofs should not be hard to
follow. Given the ongoing strike at UK Universities it may be some time before
I get to complete it to my satisfaction, and in the meantime people I've shared
the preliminary draft with would like to be able to reference it. Hence I'm
uploading it in its current form, and will update it later.
The main new result of this paper is to count the number of (n,n+1)-core
partitions with odd parts, answering a question of Zaleski and Zeilberger with
bounty a charitable contribution to the OEIS. Along the way, we prove a general
theorem giving a recurrence for (n,n+1)-core parts whose smallest part and
consecutive part differences are restricted to lie in an arbitrary set M. This
theorem unifies many known results about (n,n+1)-core partitions with
restrictions.
We end with discussions of extensions of the general theorem that keep track
of the largest part, number of parts, and size of the partition, and about a
few cases where the same methods work on more general simultaneous cores.
| math.CO | important note this paper is much rougher than id usually submit and not entirely complete though the main theorems and proofs should not be hard to follow given the ongoing strike at uk universities it may be some time before i get to complete it to my satisfaction and in the meantime people ive shared the preliminary draft with would like to be able to reference it hence im uploading it in its current form and will update it later the main new result of this paper is to count the number of nn1core partitions with odd parts answering a question of zaleski and zeilberger with bounty a charitable contribution to the oeis along the way we prove a general theorem giving a recurrence for nn1core parts whose smallest part and consecutive part differences are restricted to lie in an arbitrary set m this theorem unifies many known results about nn1core partitions with restrictions we end with discussions of extensions of the general theorem that keep track of the largest part number of parts and size of the partition and about a few cases where the same methods work on more general simultaneous cores | [['important', 'note', 'this', 'paper', 'is', 'much', 'rougher', 'than', 'id', 'usually', 'submit', 'and', 'not', 'entirely', 'complete', 'though', 'the', 'main', 'theorems', 'and', 'proofs', 'should', 'not', 'be', 'hard', 'to', 'follow', 'given', 'the', 'ongoing', 'strike', 'at', 'uk', 'universities', 'it', 'may', 'be', 'some', 'time', 'before', 'i', 'get', 'to', 'complete', 'it', 'to', 'my', 'satisfaction', 'and', 'in', 'the', 'meantime', 'people', 'ive', 'shared', 'the', 'preliminary', 'draft', 'with', 'would', 'like', 'to', 'be', 'able', 'to', 'reference', 'it', 'hence', 'im', 'uploading', 'it', 'in', 'its', 'current', 'form', 'and', 'will', 'update', 'it', 'later', 'the', 'main', 'new', 'result', 'of', 'this', 'paper', 'is', 'to', 'count', 'the', 'number', 'of', 'nn1core', 'partitions', 'with', 'odd', 'parts', 'answering', 'a', 'question', 'of', 'zaleski', 'and', 'zeilberger', 'with', 'bounty', 'a', 'charitable', 'contribution', 'to', 'the', 'oeis', 'along', 'the', 'way', 'we', 'prove', 'a', 'general', 'theorem', 'giving', 'a', 'recurrence', 'for', 'nn1core', 'parts', 'whose', 'smallest', 'part', 'and', 'consecutive', 'part', 'differences', 'are', 'restricted', 'to', 'lie', 'in', 'an', 'arbitrary', 'set', 'm', 'this', 'theorem', 'unifies', 'many', 'known', 'results', 'about', 'nn1core', 'partitions', 'with', 'restrictions', 'we', 'end', 'with', 'discussions', 'of', 'extensions', 'of', 'the', 'general', 'theorem', 'that', 'keep', 'track', 'of', 'the', 'largest', 'part', 'number', 'of', 'parts', 'and', 'size', 'of', 'the', 'partition', 'and', 'about', 'a', 'few', 'cases', 'where', 'the', 'same', 'methods', 'work', 'on', 'more', 'general', 'simultaneous', 'cores']] | [-0.08956446081607546, 0.07835170372004306, -0.08967264450980907, 0.07083775698550564, -0.13098501606325896, -0.12646595150539555, 0.06496356261747688, 0.328970956200849, -0.2526111603131249, -0.3383260113523178, 0.13006030378704794, -0.28214189978604465, -0.11121241781577353, 0.18469136248981177, -0.1213193752457263, -0.022603168928099812, 0.06083571768759452, 0.06669974967491688, -0.017985769567924755, -0.3204907598454006, 0.29996477095014173, 0.045800148798980915, 0.18407556495854882, 0.06950152150028836, 0.03999694827980045, 0.0161083751518913, -0.0819844619956674, -0.004393515710475673, -0.11349230062249675, 0.115987505762569, 0.2839827676982974, 0.15360020087388604, 0.2958912904825561, -0.4088818827240737, -0.09385539797259514, 0.13556063295457244, 0.13485313540555, 0.08756997470609537, 0.017767447136722375, -0.25623350556502983, 0.11602193162027631, -0.15689992538704922, -0.14220527874680294, -0.03266954641625976, 0.06753972653040335, -0.0016367383368466933, -0.22445837403983646, 0.008774300145474983, 0.12835422193750945, 0.0309557190486566, -0.023329861112270197, -0.13678586318400046, 0.03364755322355009, 0.15951397406062132, 0.0695615468856389, 0.05832138854035743, 0.0753570675952528, -0.08546516335732543, -0.08625431986736883, 0.36615213026417437, 0.021206355763742694, -0.17707306578558552, 0.18162070390721544, -0.15864221534341305, -0.19781277691057317, 0.09404145271070878, 0.12585845476582877, 0.1055376135573732, -0.1272049361129397, 0.027137232404298234, -0.08040068732315347, 0.16883721564879603, 0.11658421417124588, 0.01370731912542509, 0.19338193623326266, 0.10378828996878847, 0.07561838555962241, 0.12981286295149572, 0.019301215071499962, -0.0773964333365416, -0.31268530451097365, -0.17303923708530738, -0.15099254500399314, 0.05774910197627476, -0.03498602602642855, -0.15152084503140414, 0.39228730400443346, 0.1556459977585563, 0.1895572310409595, 0.09670510167404817, 0.2940698726794001, 0.0779650080196719, 0.08750956820218449, 0.09911679004147389, 0.1514387866225605, 0.10200995821193744, 0.12269127732094799, -0.10323018982247978, 0.06006523934384981, 0.06408789130131781] |
1,802.09622 | Partition-crossing hypergraphs | For a finite set $X$, we say that a set $H\subseteq X$ crosses a partition
${\cal P}=(X_1,\dots,X_k)$ of $X$ if $H$ intersects $\min (|H|,k)$ partition
classes. If $|H|\geq k$, this means that $H$ meets all classes $X_i$, whilst
for $|H|\leq k$ the elements of the crossing set $H$ belong to mutually
distinct classes. A set system ${\cal H}$ crosses ${\cal P}$, if so does some
$H\in {\cal H}$. The minimum number of $r$-element subsets, such that every
$k$-partition of an $n$-element set $X$ is crossed by at least one of them, is
denoted by $f(n,k,r)$.
The problem of determining these minimum values for $k=r$ was raised and
studied by several authors, first by Sterboul in 1973 [Proc. Colloq. Math. Soc.
J. Bolyai, Vol. 10, Keszthely 1973, North-Holland/American Elsevier, 1975, pp.
1387--1404]. The present authors determined asymptotically tight estimates on
$f(n,k,k)$ for every fixed $k$ as $n\to \infty$ [Graphs Combin., 25 (2009),
807--816]. Here we consider the more general problem for two parameters $k$ and
$r$, and establish lower and upper bounds for $f(n,k,r)$. For various
combinations of the three values $n,k,r$ we obtain asymptotically tight
estimates, and also point out close connections of the function $f(n,k,r)$ to
Tur\'an-type extremal problems on graphs and hypergraphs, or to balanced
incomplete block designs.
| math.CO | for a finite set x we say that a set hsubseteq x crosses a partition cal px_1dotsx_k of x if h intersects min hk partition classes if hgeq k this means that h meets all classes x_i whilst for hleq k the elements of the crossing set h belong to mutually distinct classes a set system cal h crosses cal p if so does some hin cal h the minimum number of relement subsets such that every kpartition of an nelement set x is crossed by at least one of them is denoted by fnkr the problem of determining these minimum values for kr was raised and studied by several authors first by sterboul in 1973 proc colloq math soc j bolyai vol 10 keszthely 1973 northhollandamerican elsevier 1975 pp 13871404 the present authors determined asymptotically tight estimates on fnkk for every fixed k as nto infty graphs combin 25 2009 807816 here we consider the more general problem for two parameters k and r and establish lower and upper bounds for fnkr for various combinations of the three values nkr we obtain asymptotically tight estimates and also point out close connections of the function fnkr to turantype extremal problems on graphs and hypergraphs or to balanced incomplete block designs | [['for', 'a', 'finite', 'set', 'x', 'we', 'say', 'that', 'a', 'set', 'hsubseteq', 'x', 'crosses', 'a', 'partition', 'cal', 'px_1dotsx_k', 'of', 'x', 'if', 'h', 'intersects', 'min', 'hk', 'partition', 'classes', 'if', 'hgeq', 'k', 'this', 'means', 'that', 'h', 'meets', 'all', 'classes', 'x_i', 'whilst', 'for', 'hleq', 'k', 'the', 'elements', 'of', 'the', 'crossing', 'set', 'h', 'belong', 'to', 'mutually', 'distinct', 'classes', 'a', 'set', 'system', 'cal', 'h', 'crosses', 'cal', 'p', 'if', 'so', 'does', 'some', 'hin', 'cal', 'h', 'the', 'minimum', 'number', 'of', 'relement', 'subsets', 'such', 'that', 'every', 'kpartition', 'of', 'an', 'nelement', 'set', 'x', 'is', 'crossed', 'by', 'at', 'least', 'one', 'of', 'them', 'is', 'denoted', 'by', 'fnkr', 'the', 'problem', 'of', 'determining', 'these', 'minimum', 'values', 'for', 'kr', 'was', 'raised', 'and', 'studied', 'by', 'several', 'authors', 'first', 'by', 'sterboul', 'in', '1973', 'proc', 'colloq', 'math', 'soc', 'j', 'bolyai', 'vol', '10', 'keszthely', '1973', 'northhollandamerican', 'elsevier', '1975', 'pp', '13871404', 'the', 'present', 'authors', 'determined', 'asymptotically', 'tight', 'estimates', 'on', 'fnkk', 'for', 'every', 'fixed', 'k', 'as', 'nto', 'infty', 'graphs', 'combin', '25', '2009', '807816', 'here', 'we', 'consider', 'the', 'more', 'general', 'problem', 'for', 'two', 'parameters', 'k', 'and', 'r', 'and', 'establish', 'lower', 'and', 'upper', 'bounds', 'for', 'fnkr', 'for', 'various', 'combinations', 'of', 'the', 'three', 'values', 'nkr', 'we', 'obtain', 'asymptotically', 'tight', 'estimates', 'and', 'also', 'point', 'out', 'close', 'connections', 'of', 'the', 'function', 'fnkr', 'to', 'turantype', 'extremal', 'problems', 'on', 'graphs', 'and', 'hypergraphs', 'or', 'to', 'balanced', 'incomplete', 'block', 'designs']] | [-0.1540937560676136, 0.11533983851608928, 0.025258527761279362, 0.015115988470058832, -0.031193313487057617, -0.17221825969923893, 0.09418933538908111, 0.339573637845013, -0.24986987250508383, -0.2934773701976863, 0.07661128427782853, -0.3503790273344869, -0.09216166117109285, 0.15333809516750496, -0.07118284844350657, 0.015613216424063811, 0.04224986330620882, 0.06526348463333043, -0.04380012166989151, -0.2966758299290932, 0.2623432841693313, -0.034664879219257844, 0.16626939962269954, 0.030182949982988108, 0.07523479393288823, 0.03650732454499735, 0.012479347218140006, 0.05790011833876078, -0.25616828362933297, 0.0617532297507791, 0.2690646429959079, 0.1560564946397288, 0.2726358840599876, -0.30928775012863596, -0.13190185589362577, 0.20108500826791884, 0.09676385100752005, -0.049662984402969554, 0.06285951138332686, -0.21323823345294038, 0.14691715812674158, -0.11153318658195839, -0.09930194213956577, -0.008919705642390712, 0.19580165623673446, -0.022095368725472485, -0.33977661074914517, -0.012431562954033472, 0.11836983181829816, 0.06966520944857406, 0.02067892452795976, -0.23521474938211145, -0.06230199756960986, 0.06128046925643028, -0.04377680275247437, 0.0770960609690089, 0.03708973172576089, -0.04312935072052398, -0.11097598666832163, 0.3383665537837838, -0.025186643865776105, -0.14673523291996496, 0.13520145504918923, -0.1366798855465254, -0.18539709295490253, 0.12569805175143986, 0.10756105049444463, 0.1726410397628937, -0.09199094529357725, 0.21811659130889446, -0.14765328503319342, 0.10509929617736695, 0.16335987496497156, -0.003466858230634441, 0.12754763357726664, 0.050312705534129525, 0.12491651430606769, 0.12505997772147337, -0.01397255251285611, 0.018625657046626647, -0.3504095615204332, -0.13029090096036275, -0.1816961510810001, 0.11231806621831736, -0.11880625581630881, -0.13985607622069735, 0.322672250510877, 0.06838981423276394, 0.21670058349909013, 0.0692703211427726, 0.13240925057933395, 0.09716525419852914, -0.03111411319137207, 0.19746065220974496, 0.1436024351314162, 0.17575983922089006, -0.023412554359678272, -0.14461172237221537, 0.013831397825897915, 0.16089713034389788] |
1,802.09623 | A Resilient Image Matching Method with an Affine Invariant Feature
Detector and Descriptor | Image feature matching is to seek, localize and identify the similarities
across the images. The matched local features between different images can
indicate the similarities of their content. Resilience of image feature
matching to large view point changes is challenging for a lot of applications
such as 3D object reconstruction, object recognition and navigation, etc, which
need accurate and robust feature matching from quite different view points. In
this paper we propose a novel image feature matching algorithm, integrating our
previous proposed Affine Invariant Feature Detector (AIFD) and new proposed
Affine Invariant Feature Descriptor (AIFDd). Both stages of this new proposed
algorithm can provide sufficient resilience to view point changes. With
systematic experiments, we can prove that the proposed method of feature
detector and descriptor outperforms other state-of-the-art feature matching
algorithms especially on view points robustness. It also performs well under
other conditions such as the change of illumination, rotation and compression,
etc.
| cs.CV | image feature matching is to seek localize and identify the similarities across the images the matched local features between different images can indicate the similarities of their content resilience of image feature matching to large view point changes is challenging for a lot of applications such as 3d object reconstruction object recognition and navigation etc which need accurate and robust feature matching from quite different view points in this paper we propose a novel image feature matching algorithm integrating our previous proposed affine invariant feature detector aifd and new proposed affine invariant feature descriptor aifdd both stages of this new proposed algorithm can provide sufficient resilience to view point changes with systematic experiments we can prove that the proposed method of feature detector and descriptor outperforms other stateoftheart feature matching algorithms especially on view points robustness it also performs well under other conditions such as the change of illumination rotation and compression etc | [['image', 'feature', 'matching', 'is', 'to', 'seek', 'localize', 'and', 'identify', 'the', 'similarities', 'across', 'the', 'images', 'the', 'matched', 'local', 'features', 'between', 'different', 'images', 'can', 'indicate', 'the', 'similarities', 'of', 'their', 'content', 'resilience', 'of', 'image', 'feature', 'matching', 'to', 'large', 'view', 'point', 'changes', 'is', 'challenging', 'for', 'a', 'lot', 'of', 'applications', 'such', 'as', '3d', 'object', 'reconstruction', 'object', 'recognition', 'and', 'navigation', 'etc', 'which', 'need', 'accurate', 'and', 'robust', 'feature', 'matching', 'from', 'quite', 'different', 'view', 'points', 'in', 'this', 'paper', 'we', 'propose', 'a', 'novel', 'image', 'feature', 'matching', 'algorithm', 'integrating', 'our', 'previous', 'proposed', 'affine', 'invariant', 'feature', 'detector', 'aifd', 'and', 'new', 'proposed', 'affine', 'invariant', 'feature', 'descriptor', 'aifdd', 'both', 'stages', 'of', 'this', 'new', 'proposed', 'algorithm', 'can', 'provide', 'sufficient', 'resilience', 'to', 'view', 'point', 'changes', 'with', 'systematic', 'experiments', 'we', 'can', 'prove', 'that', 'the', 'proposed', 'method', 'of', 'feature', 'detector', 'and', 'descriptor', 'outperforms', 'other', 'stateoftheart', 'feature', 'matching', 'algorithms', 'especially', 'on', 'view', 'points', 'robustness', 'it', 'also', 'performs', 'well', 'under', 'other', 'conditions', 'such', 'as', 'the', 'change', 'of', 'illumination', 'rotation', 'and', 'compression', 'etc']] | [-0.06392821757005689, -0.03817068159407535, -0.12851596151830147, 0.04374598411516293, -0.09606383138626123, -0.1670388805595942, -0.00016102644334245003, 0.462579407513339, -0.2948353555522218, -0.37146926023658144, 0.07552672376384378, -0.26583905879482134, -0.22847769700533507, 0.156741733931079, -0.17186415708000888, 0.12426976691808132, 0.10601778502039463, 0.028338548405264005, -0.11829292536281444, -0.22290563704260927, 0.2938752382275161, 0.05965765987504397, 0.40108094907162206, 0.025411911180400173, 0.13480960440186673, -0.023483613048007848, -0.08434744546920776, 0.025062901559995104, -0.028166144014891648, 0.13223158625435988, 0.33073679750032775, 0.19322706491452032, 0.20105942450032033, -0.36127898511507656, -0.21945556427278118, 0.08855555882093047, 0.13702619304596786, 0.10379991530431497, -0.10683346462099881, -0.3431742767747862, 0.10565993999322222, -0.10091140744159159, -0.03574934675507031, -0.14873275711565026, -0.011362743947889335, -0.025232301158398786, -0.2963003394323469, 0.03274280297248439, 0.08984383161022445, 0.07220514717863391, -0.05668330342441008, -0.09809148209231185, 0.0028566295367400377, 0.17239539330171433, 0.009736566627028072, 0.07041162541999624, 0.18163950408852061, -0.1713096352590137, -0.11357470702022215, 0.39930402793434283, -0.042659083978020096, -0.19803576413326163, 0.24647630751364255, -0.03500073367964156, -0.15216686847058453, 0.1291491508989638, 0.2057380360606688, 0.14421728527210406, -0.1248653612673184, -0.007583478640684772, -0.055212819578730504, 0.13532596291389798, 0.08189730616502267, 0.06784993423987797, 0.20879436496472517, 0.1961422409208504, 0.11605889363744795, 0.15468047445467273, -0.2013159691038486, -0.05941049324730966, -0.23961916802734728, -0.1009020639392848, -0.17180306793788805, -0.06691198759027664, -0.13351078657992338, -0.15325803565330162, 0.44630399126164766, 0.26255085968122577, 0.24406365723972093, 0.032528293324250494, 0.3316067716859232, 0.020912350746355828, 0.09447198171039044, 0.06429333702833792, 0.18212874703701362, -0.024757101537046078, 0.07558897108345336, -0.17526319781965916, 0.07532701281590128, 0.09187911995779106] |
1,802.09624 | Fluid-supported elastic sheet under compression: Multifold solutions | The properties of a hinged floating elastic sheet of finite length under
compression are considered. Numerical continuation is used to compute spatially
localized buckled states with many spatially localized folds. Both symmetric
and antisymmetric states are computed and the corresponding bifurcation
diagrams determined. Weakly nonlinear analysis is used to analyze the
transition from periodic wrinkles to single fold and multifold states and to
compute their energy. States with the same number of folds have energies that
barely differ from each other and the energy gap decreases exponentially as
localization increases. The stability properties of the different competing
states are established and provide a basis for the study of fold interactions.
| nlin.PS | the properties of a hinged floating elastic sheet of finite length under compression are considered numerical continuation is used to compute spatially localized buckled states with many spatially localized folds both symmetric and antisymmetric states are computed and the corresponding bifurcation diagrams determined weakly nonlinear analysis is used to analyze the transition from periodic wrinkles to single fold and multifold states and to compute their energy states with the same number of folds have energies that barely differ from each other and the energy gap decreases exponentially as localization increases the stability properties of the different competing states are established and provide a basis for the study of fold interactions | [['the', 'properties', 'of', 'a', 'hinged', 'floating', 'elastic', 'sheet', 'of', 'finite', 'length', 'under', 'compression', 'are', 'considered', 'numerical', 'continuation', 'is', 'used', 'to', 'compute', 'spatially', 'localized', 'buckled', 'states', 'with', 'many', 'spatially', 'localized', 'folds', 'both', 'symmetric', 'and', 'antisymmetric', 'states', 'are', 'computed', 'and', 'the', 'corresponding', 'bifurcation', 'diagrams', 'determined', 'weakly', 'nonlinear', 'analysis', 'is', 'used', 'to', 'analyze', 'the', 'transition', 'from', 'periodic', 'wrinkles', 'to', 'single', 'fold', 'and', 'multifold', 'states', 'and', 'to', 'compute', 'their', 'energy', 'states', 'with', 'the', 'same', 'number', 'of', 'folds', 'have', 'energies', 'that', 'barely', 'differ', 'from', 'each', 'other', 'and', 'the', 'energy', 'gap', 'decreases', 'exponentially', 'as', 'localization', 'increases', 'the', 'stability', 'properties', 'of', 'the', 'different', 'competing', 'states', 'are', 'established', 'and', 'provide', 'a', 'basis', 'for', 'the', 'study', 'of', 'fold', 'interactions']] | [-0.1608110355636613, 0.17031628787940875, -0.05027165871208788, 0.06367437746799127, 0.0008362478449602019, -0.14145999704064294, 0.023782265848818828, 0.36647249768403445, -0.3072833852969449, -0.26429314400831405, 0.07319125653329221, -0.30442100338299166, -0.13188346542248672, 0.16081347207284785, 0.0434094533239576, 0.06199430455030366, 0.057313717387362635, 0.02667488330705303, -0.08583042241675272, -0.17637578253210945, 0.30247764142060823, 0.015518643004311756, 0.3065403188261288, 0.040948224065042185, 0.014747676081870767, -0.015004858090965585, 0.025798908875069835, 0.0320467291272838, -0.15736620011560842, 0.12377277719735337, 0.23894972063770348, 0.024923209463965826, 0.20763602429492908, -0.4622127486731518, -0.18914938336238266, 0.06089194008699533, 0.16493825852362948, 0.1362664891068231, -0.0028811680417592553, -0.27749497655525124, 0.10412350048057058, -0.10988955982876095, -0.1521265681536699, -0.10643448388357435, 0.014106899288228968, 0.06621130022262646, -0.2022380274170163, 0.10032664926468648, 0.006135407242585312, 0.030543034616857766, -0.10834618712860075, -0.1238484499679709, -0.12793949151792647, 0.16021536449393767, 0.06320474014448171, -0.015553675356998363, 0.15133073909885503, -0.12139622896740382, -0.11994345826096833, 0.35090698742900384, -0.03431300443851135, -0.20715810274784666, 0.2521667244166813, -0.10407604819841006, -0.04442577131478836, 0.18986601455941457, 0.14426942715759983, 0.12013779559426686, -0.07862147251461547, 0.04164801423374394, 0.00313261304452846, 0.1702637717223049, 0.1319336649326777, 0.040019758545200936, 0.18354205968366427, 0.13089958877958865, 0.07137000714164142, 0.20423434477415867, -0.08692804858913984, -0.12617245708084243, -0.26508491733534767, -0.11002760574179278, -0.16545099808241834, 0.01040009958352047, -0.05016006383097688, -0.2522288808345117, 0.4441791278818114, 0.04806848242032257, 0.2374507032088745, 0.044407939826222986, 0.2188100642439994, 0.1332745177152736, 0.04846442562993616, 0.06414969739588824, 0.2645081517604095, 0.13214860428442163, 0.03391639600423249, -0.2180543029236353, 0.01639884288465096, 0.03195263403044506] |
1,802.09625 | Numerical relativity in spherical coordinates with the Einstein Toolkit | Numerical relativity codes that do not make assumptions on spatial symmetries
most commonly adopt Cartesian coordinates. While these coordinates have many
attractive features, spherical coordinates are much better suited to take
advantage of approximate symmetries in a number of astrophysical objects,
including single stars, black holes and accretion disks. While the appearance
of coordinate singularities often spoils numerical relativity simulations in
spherical coordinates, especially in the absence of any symmetry assumptions,
it has recently been demonstrated that these problems can be avoided if the
coordinate singularities are handled analytically. This is possible with the
help of a reference-metric version of the Baumgarte-Shapiro-Shibata-Nakamura
formulation together with a proper rescaling of tensorial quantities. In this
paper we report on an implementation of this formalism in the Einstein Toolkit.
We adapt the Einstein Toolkit infrastructure, originally designed for Cartesian
coordinates, to handle spherical coordinates, by providing appropriate boundary
conditions at both inner and outer boundaries. We perform numerical simulations
for a disturbed Kerr black hole, extract the gravitational wave signal, and
demonstrate that the noise in these signals is orders of magnitude smaller when
computed on spherical grids rather than Cartesian grids. With the public
release of our new Einstein Toolkit thorns, our methods for numerical
relativity in spherical coordinates will become available to the entire
numerical relativity community.
| gr-qc astro-ph.HE | numerical relativity codes that do not make assumptions on spatial symmetries most commonly adopt cartesian coordinates while these coordinates have many attractive features spherical coordinates are much better suited to take advantage of approximate symmetries in a number of astrophysical objects including single stars black holes and accretion disks while the appearance of coordinate singularities often spoils numerical relativity simulations in spherical coordinates especially in the absence of any symmetry assumptions it has recently been demonstrated that these problems can be avoided if the coordinate singularities are handled analytically this is possible with the help of a referencemetric version of the baumgarteshapiroshibatanakamura formulation together with a proper rescaling of tensorial quantities in this paper we report on an implementation of this formalism in the einstein toolkit we adapt the einstein toolkit infrastructure originally designed for cartesian coordinates to handle spherical coordinates by providing appropriate boundary conditions at both inner and outer boundaries we perform numerical simulations for a disturbed kerr black hole extract the gravitational wave signal and demonstrate that the noise in these signals is orders of magnitude smaller when computed on spherical grids rather than cartesian grids with the public release of our new einstein toolkit thorns our methods for numerical relativity in spherical coordinates will become available to the entire numerical relativity community | [['numerical', 'relativity', 'codes', 'that', 'do', 'not', 'make', 'assumptions', 'on', 'spatial', 'symmetries', 'most', 'commonly', 'adopt', 'cartesian', 'coordinates', 'while', 'these', 'coordinates', 'have', 'many', 'attractive', 'features', 'spherical', 'coordinates', 'are', 'much', 'better', 'suited', 'to', 'take', 'advantage', 'of', 'approximate', 'symmetries', 'in', 'a', 'number', 'of', 'astrophysical', 'objects', 'including', 'single', 'stars', 'black', 'holes', 'and', 'accretion', 'disks', 'while', 'the', 'appearance', 'of', 'coordinate', 'singularities', 'often', 'spoils', 'numerical', 'relativity', 'simulations', 'in', 'spherical', 'coordinates', 'especially', 'in', 'the', 'absence', 'of', 'any', 'symmetry', 'assumptions', 'it', 'has', 'recently', 'been', 'demonstrated', 'that', 'these', 'problems', 'can', 'be', 'avoided', 'if', 'the', 'coordinate', 'singularities', 'are', 'handled', 'analytically', 'this', 'is', 'possible', 'with', 'the', 'help', 'of', 'a', 'referencemetric', 'version', 'of', 'the', 'baumgarteshapiroshibatanakamura', 'formulation', 'together', 'with', 'a', 'proper', 'rescaling', 'of', 'tensorial', 'quantities', 'in', 'this', 'paper', 'we', 'report', 'on', 'an', 'implementation', 'of', 'this', 'formalism', 'in', 'the', 'einstein', 'toolkit', 'we', 'adapt', 'the', 'einstein', 'toolkit', 'infrastructure', 'originally', 'designed', 'for', 'cartesian', 'coordinates', 'to', 'handle', 'spherical', 'coordinates', 'by', 'providing', 'appropriate', 'boundary', 'conditions', 'at', 'both', 'inner', 'and', 'outer', 'boundaries', 'we', 'perform', 'numerical', 'simulations', 'for', 'a', 'disturbed', 'kerr', 'black', 'hole', 'extract', 'the', 'gravitational', 'wave', 'signal', 'and', 'demonstrate', 'that', 'the', 'noise', 'in', 'these', 'signals', 'is', 'orders', 'of', 'magnitude', 'smaller', 'when', 'computed', 'on', 'spherical', 'grids', 'rather', 'than', 'cartesian', 'grids', 'with', 'the', 'public', 'release', 'of', 'our', 'new', 'einstein', 'toolkit', 'thorns', 'our', 'methods', 'for', 'numerical', 'relativity', 'in', 'spherical', 'coordinates', 'will', 'become', 'available', 'to', 'the', 'entire', 'numerical', 'relativity', 'community']] | [-0.1293314100982604, 0.03398138171346714, -0.09398595986421351, 0.10002172659571645, -0.12964986275700438, -0.12435983149421022, -0.06114828321787408, 0.38103186166241626, -0.1920957486042796, -0.3021506935582255, 0.1047345280255993, -0.2400843555035492, -0.11013296367471209, 0.2049410967463498, -0.05521481676825917, 0.05201082476829739, 0.08679122510430817, -0.00554740793369193, -0.13526611795990634, -0.24641012965811468, 0.3255082791093392, 0.10632451357863222, 0.23573948023409616, -0.04212500836648461, 0.08672625572136086, -0.018070791597926506, -0.05236692572685166, 0.05799655645387247, -0.12281410859547275, 0.07825677498180152, 0.25159292079560047, 0.13028643291484818, 0.2338970210230737, -0.4783048531971872, -0.24088130440698782, 0.059526597346929416, 0.16045115789381303, 0.1469515214040358, -0.053010335821656755, -0.290666710192993, 0.05397816093668721, -0.1803230556866361, -0.18605480590607235, -0.11759539456020489, 0.020042746030311618, 0.013790310004777793, -0.22563472804958346, 0.05734399182525791, 0.06147286996754162, 0.048707234677513714, -0.053309661852566664, -0.08119224910667443, -0.019450359270666486, 0.08629209544852967, 0.05523579295231684, -0.0010411286202725023, 0.12535894051715904, -0.07104465652675437, -0.0708557953454416, 0.44053689053247647, 0.007632536562124625, -0.2913208687699538, 0.17438704949260378, -0.16745744956251993, -0.1345978081722192, 0.12603516640848722, 0.17165096140794317, 0.17007477352658665, -0.14219598584579082, 0.1052553770921939, -0.010382582472259485, 0.1652738372590479, 0.11298671910966125, 0.013914395392054791, 0.2422662294077411, 0.08668141472649209, 0.03569672368973476, 0.09690423584187455, -0.06704933417926508, -0.12257562333710396, -0.30498714446757397, -0.11980180182435005, -0.1696339545241143, 0.0286333258126332, -0.13885921061113618, -0.16961059369754772, 0.32338362031064377, 0.15202404465202968, 0.11783375386666092, 0.030762491466399904, 0.32682732983874774, 0.035811253937060465, 0.09438906543288829, 0.11434697875477097, 0.2847941022525817, 0.09676247404530403, 0.1018024613138685, -0.19857058975914563, -0.003412185803797372, 0.09169704783319806] |
1,802.09626 | Tinkertoys for the $E_8$ Theory | We construct the 4D N=2 SCFTs of class-S, which stem from the $E_8$ (2,0)
theory. There are 49,836 isolated SCFTs which arise as 3-punctured spheres. Of
these, 149 are "mixed" (contain free hypermultiplets accompanying the
interacting SCFT) and 775 have enhanced global symmetries (beyond the manifest
global symmetry associated to the punctures). Among the 49,836 3-punctured
spheres we find (after removing any free hypermultiplets which may be present)
29 that are product SCFTs. Turning to 4-punctured spheres, we find 1,025,438 4D
SCFTs arising as a gauging (with a simple gauge group) of a pair of 3-punctured
spheres. We discuss a number of applications, including recovering several
known 4D SCFTs. Our full set of results can be accessed on the Web at
https://golem.ph.utexas.edu/class-S/E8/ .
| hep-th | we construct the 4d n2 scfts of classs which stem from the e_8 20 theory there are 49836 isolated scfts which arise as 3punctured spheres of these 149 are mixed contain free hypermultiplets accompanying the interacting scft and 775 have enhanced global symmetries beyond the manifest global symmetry associated to the punctures among the 49836 3punctured spheres we find after removing any free hypermultiplets which may be present 29 that are product scfts turning to 4punctured spheres we find 1025438 4d scfts arising as a gauging with a simple gauge group of a pair of 3punctured spheres we discuss a number of applications including recovering several known 4d scfts our full set of results can be accessed on the web at httpsgolemphutexaseduclassse8 | [['we', 'construct', 'the', '4d', 'n2', 'scfts', 'of', 'classs', 'which', 'stem', 'from', 'the', 'e_8', '20', 'theory', 'there', 'are', '49836', 'isolated', 'scfts', 'which', 'arise', 'as', '3punctured', 'spheres', 'of', 'these', '149', 'are', 'mixed', 'contain', 'free', 'hypermultiplets', 'accompanying', 'the', 'interacting', 'scft', 'and', '775', 'have', 'enhanced', 'global', 'symmetries', 'beyond', 'the', 'manifest', 'global', 'symmetry', 'associated', 'to', 'the', 'punctures', 'among', 'the', '49836', '3punctured', 'spheres', 'we', 'find', 'after', 'removing', 'any', 'free', 'hypermultiplets', 'which', 'may', 'be', 'present', '29', 'that', 'are', 'product', 'scfts', 'turning', 'to', '4punctured', 'spheres', 'we', 'find', '1025438', '4d', 'scfts', 'arising', 'as', 'a', 'gauging', 'with', 'a', 'simple', 'gauge', 'group', 'of', 'a', 'pair', 'of', '3punctured', 'spheres', 'we', 'discuss', 'a', 'number', 'of', 'applications', 'including', 'recovering', 'several', 'known', '4d', 'scfts', 'our', 'full', 'set', 'of', 'results', 'can', 'be', 'accessed', 'on', 'the', 'web', 'at', 'httpsgolemphutexaseduclassse8']] | [-0.12862293043773684, 0.17352470235062478, -0.02155361422021889, 0.06282081529182398, -0.051315684133935405, -0.15631937844110494, -0.013775369309291434, 0.35213752117765657, -0.1877941369884095, -0.33018572211770686, 0.11254496834941566, -0.3491842852100351, -0.17537587272472902, 0.10019975737273945, -0.0533877394785631, -0.05462067384841079, -0.002549435738158428, 0.05795841583769011, -0.14678351070447745, -0.2881189089799221, 0.31537826094476473, -0.08714915570897698, 0.20799029564832228, 0.03177745057411997, 0.06607758485558206, -0.007544770039681156, -0.0037062608842122354, 0.021779566348167294, -0.0986209282421796, 0.14647946442414264, 0.2775375223442344, 0.08621565724123206, 0.09281531812740791, -0.4534285602680707, -0.223189935652476, 0.10961376650010284, 0.21225068235564662, 0.10911174872160052, -0.05055364766414672, -0.257917996480177, 0.08035161976023751, -0.18103606475643436, -0.1659272754282722, -0.09998869973479502, -0.04001820403135429, -0.06191654506502515, -0.22234692297564124, 0.07545187209448698, -0.026279221423033437, 0.12214742017657322, -0.06478264442274063, -0.1056747136882238, -0.12350824234367869, 0.14573409356634623, 0.11325145405776388, 0.03138678228498389, 0.17193382925657807, -0.18432849546562943, -0.13681316399508772, 0.40937072868948265, 0.017164564691483974, -0.182645092799202, 0.20828081463005835, -0.09482144481518258, -0.22228844781500934, 0.16369205380205887, 0.08835646893505512, 0.16128019203424013, -0.06552622066818127, 0.1560911600575664, -0.1056504398110812, 0.11851312469896245, 0.10252195728106141, -0.007280936783329599, 0.2514835475644065, 0.06382279716021681, 0.055045266941552824, 0.14134195958208925, -0.014097480844781277, -0.058459507637623684, -0.40654263382193523, -0.14450396838108615, -0.11486974617040133, 0.16668977822035047, -0.14805634867908507, -0.1703942690707617, 0.3175767503078964, 0.0617391286098193, 0.19130404312479293, 0.054821507726061966, 0.11181886902994524, 0.03670544761553174, 0.1243122198571593, 0.03228605300053891, 0.21317730982140717, 0.12948916387602183, -0.015109038118557152, -0.15431337470338696, -0.20605727360126072, 0.1816185712912988] |
1,802.09627 | Cognition and Reality | We discuss the two moments of human cognition, namely, apprehension (A),
whereby a coherent perception emerges from the recruitment of neuronal groups,
and judgment(B),that entails the comparison of two apprehensions acquired at
different times, coded in a suitable language and retrieved by memory. (B)
entails self-consciousness, in so far as the agent who expresses the judgment
must be aware that the two apprehensions are submitted to his/her own scrutiny
and that it is his/her task to extract a mutual relation. Since (B) lasts
around 3 seconds, the semantic value of the pieces under comparison must be
decided within that time. This implies a fast search of the memory contents. As
a fact, exploring human subjects with sequences of simple words, we find
evidence of a limited time window , corresponding to the memory retrieval of a
linguistic item in order to match it with the next one in a text flow (be it
literary, or musical,or figurative). While apprehension is globally explained
as a Bayes inference, judgment tresults from an inverse Bayes inference. As a
consequence, two hermeneutics emerge (called respectively circle and coil). The
first one acts in a pre-assigned space of features. The second one provides the
discovery of novel features, thus unveiling previously unknown aspects and
hence representing the road to reality.
| q-bio.NC | we discuss the two moments of human cognition namely apprehension a whereby a coherent perception emerges from the recruitment of neuronal groups and judgmentbthat entails the comparison of two apprehensions acquired at different times coded in a suitable language and retrieved by memory b entails selfconsciousness in so far as the agent who expresses the judgment must be aware that the two apprehensions are submitted to hisher own scrutiny and that it is hisher task to extract a mutual relation since b lasts around 3 seconds the semantic value of the pieces under comparison must be decided within that time this implies a fast search of the memory contents as a fact exploring human subjects with sequences of simple words we find evidence of a limited time window corresponding to the memory retrieval of a linguistic item in order to match it with the next one in a text flow be it literary or musicalor figurative while apprehension is globally explained as a bayes inference judgment tresults from an inverse bayes inference as a consequence two hermeneutics emerge called respectively circle and coil the first one acts in a preassigned space of features the second one provides the discovery of novel features thus unveiling previously unknown aspects and hence representing the road to reality | [['we', 'discuss', 'the', 'two', 'moments', 'of', 'human', 'cognition', 'namely', 'apprehension', 'a', 'whereby', 'a', 'coherent', 'perception', 'emerges', 'from', 'the', 'recruitment', 'of', 'neuronal', 'groups', 'and', 'judgmentbthat', 'entails', 'the', 'comparison', 'of', 'two', 'apprehensions', 'acquired', 'at', 'different', 'times', 'coded', 'in', 'a', 'suitable', 'language', 'and', 'retrieved', 'by', 'memory', 'b', 'entails', 'selfconsciousness', 'in', 'so', 'far', 'as', 'the', 'agent', 'who', 'expresses', 'the', 'judgment', 'must', 'be', 'aware', 'that', 'the', 'two', 'apprehensions', 'are', 'submitted', 'to', 'hisher', 'own', 'scrutiny', 'and', 'that', 'it', 'is', 'hisher', 'task', 'to', 'extract', 'a', 'mutual', 'relation', 'since', 'b', 'lasts', 'around', '3', 'seconds', 'the', 'semantic', 'value', 'of', 'the', 'pieces', 'under', 'comparison', 'must', 'be', 'decided', 'within', 'that', 'time', 'this', 'implies', 'a', 'fast', 'search', 'of', 'the', 'memory', 'contents', 'as', 'a', 'fact', 'exploring', 'human', 'subjects', 'with', 'sequences', 'of', 'simple', 'words', 'we', 'find', 'evidence', 'of', 'a', 'limited', 'time', 'window', 'corresponding', 'to', 'the', 'memory', 'retrieval', 'of', 'a', 'linguistic', 'item', 'in', 'order', 'to', 'match', 'it', 'with', 'the', 'next', 'one', 'in', 'a', 'text', 'flow', 'be', 'it', 'literary', 'or', 'musicalor', 'figurative', 'while', 'apprehension', 'is', 'globally', 'explained', 'as', 'a', 'bayes', 'inference', 'judgment', 'tresults', 'from', 'an', 'inverse', 'bayes', 'inference', 'as', 'a', 'consequence', 'two', 'hermeneutics', 'emerge', 'called', 'respectively', 'circle', 'and', 'coil', 'the', 'first', 'one', 'acts', 'in', 'a', 'preassigned', 'space', 'of', 'features', 'the', 'second', 'one', 'provides', 'the', 'discovery', 'of', 'novel', 'features', 'thus', 'unveiling', 'previously', 'unknown', 'aspects', 'and', 'hence', 'representing', 'the', 'road', 'to', 'reality']] | [-0.10673706010601955, 0.09939398110290533, -0.08958725374130205, 0.08266030471403399, -0.13168530617299892, -0.16479173887927104, 0.09599406936071302, 0.3778797286249238, -0.2835860071809724, -0.31052688008474444, 0.09890876362281005, -0.26410271635475474, -0.13991843296934395, 0.1477894863156244, -0.09273148001330547, -0.012696646498207233, 0.056498916941624296, 0.13110264816643644, -0.025798492605899465, -0.23046363187927346, 0.27676183777978264, 0.03265837975225954, 0.261398188129809, -0.0047035992729821865, 0.1247907687172788, -0.002441503641347873, -0.053699239433005946, 0.00518468421510359, -0.07785943867050424, 0.1272933078219152, 0.28967985937866203, 0.19743322668005647, 0.3495516155524206, -0.4038578479228568, -0.1859279476123822, 0.06712503652904907, 0.1252882673022485, 0.0826221382967086, -0.0018838287918206075, -0.3223164473655876, 0.07642890068247774, -0.15609445332624547, -0.05028719294587839, -0.05736950885557451, 0.0445591285284079, -0.03246267561462015, -0.25670932767685434, 0.038039546062114925, 0.08346154378788873, 0.07789824854569306, -0.04799555611942334, -0.07460847233382928, 0.009822790269294127, 0.19370534405734618, 0.07984761419315421, 0.056483056627973136, 0.13909673846825535, -0.15519432666169708, -0.14270694245765278, 0.3994586084488232, -0.02428044970379039, -0.17255516618969396, 0.17458864097633528, -0.10261204047349251, -0.1315735405889203, 0.09335096495919, 0.1392829086037322, 0.07064765784944632, -0.1695966277695239, 0.010968749691131943, -0.045885313577040746, 0.20380665664671438, 0.09708041314507936, 0.020717764774257963, 0.2266849384983004, 0.19703768904793179, 0.03499175240815357, 0.11020018660377323, -0.0702276572020133, -0.08762775811861089, -0.26488080646586715, -0.17549734155899047, -0.1830761412901239, 0.03923647929980503, -0.0793771798590996, -0.1410534758952786, 0.38426622352231804, 0.15145672256153483, 0.21023143460020705, 0.06762209540383086, 0.2697789526734307, 0.05809535262102076, 0.10126569849589036, 0.07650849474753998, 0.1813875739926128, 0.029455447535282134, 0.12890834347631835, -0.15664970137962908, 0.1256849630989611, 0.03883157992953853] |
1,802.09628 | Gravitational Wave Searches with Pulsar Timing Arrays. I: Cancellation
of Clock and Ephemeris Noises | We propose a data processing technique to cancel monopole and dipole noise
sources (such as clock and ephemeris noises respectively) in pulsar timing
array searches for gravitational radiation. These noises are the dominant
sources of correlated timing fluctuations in the lower-part ($ \approx 10^{-9}
- 10^{-8}$ Hz) of the gravitational wave band accessible by pulsar timing
experiments. After deriving the expressions that reconstruct these noises from
the timing data, we estimate the gravitational wave sensitivity of our proposed
processing technique to single-source signals to be at least one order of
magnitude higher than that achievable by directly processing the timing data
from an equal-size array. Since arrays can generate pairs of clock and
ephemeris-free timing combinations that are no longer affected by correlated
noises, we implement with them the cross-correlation statistic to search for an
isotropic stochastic gravitational wave background. We find the resulting
optimal signal-to-noise ratio to be more than one order of magnitude larger
than that obtainable by correlating pairs of timing data from arrays of equal
size.
| gr-qc | we propose a data processing technique to cancel monopole and dipole noise sources such as clock and ephemeris noises respectively in pulsar timing array searches for gravitational radiation these noises are the dominant sources of correlated timing fluctuations in the lowerpart approx 109 108 hz of the gravitational wave band accessible by pulsar timing experiments after deriving the expressions that reconstruct these noises from the timing data we estimate the gravitational wave sensitivity of our proposed processing technique to singlesource signals to be at least one order of magnitude higher than that achievable by directly processing the timing data from an equalsize array since arrays can generate pairs of clock and ephemerisfree timing combinations that are no longer affected by correlated noises we implement with them the crosscorrelation statistic to search for an isotropic stochastic gravitational wave background we find the resulting optimal signaltonoise ratio to be more than one order of magnitude larger than that obtainable by correlating pairs of timing data from arrays of equal size | [['we', 'propose', 'a', 'data', 'processing', 'technique', 'to', 'cancel', 'monopole', 'and', 'dipole', 'noise', 'sources', 'such', 'as', 'clock', 'and', 'ephemeris', 'noises', 'respectively', 'in', 'pulsar', 'timing', 'array', 'searches', 'for', 'gravitational', 'radiation', 'these', 'noises', 'are', 'the', 'dominant', 'sources', 'of', 'correlated', 'timing', 'fluctuations', 'in', 'the', 'lowerpart', 'approx', '109', '108', 'hz', 'of', 'the', 'gravitational', 'wave', 'band', 'accessible', 'by', 'pulsar', 'timing', 'experiments', 'after', 'deriving', 'the', 'expressions', 'that', 'reconstruct', 'these', 'noises', 'from', 'the', 'timing', 'data', 'we', 'estimate', 'the', 'gravitational', 'wave', 'sensitivity', 'of', 'our', 'proposed', 'processing', 'technique', 'to', 'singlesource', 'signals', 'to', 'be', 'at', 'least', 'one', 'order', 'of', 'magnitude', 'higher', 'than', 'that', 'achievable', 'by', 'directly', 'processing', 'the', 'timing', 'data', 'from', 'an', 'equalsize', 'array', 'since', 'arrays', 'can', 'generate', 'pairs', 'of', 'clock', 'and', 'ephemerisfree', 'timing', 'combinations', 'that', 'are', 'no', 'longer', 'affected', 'by', 'correlated', 'noises', 'we', 'implement', 'with', 'them', 'the', 'crosscorrelation', 'statistic', 'to', 'search', 'for', 'an', 'isotropic', 'stochastic', 'gravitational', 'wave', 'background', 'we', 'find', 'the', 'resulting', 'optimal', 'signaltonoise', 'ratio', 'to', 'be', 'more', 'than', 'one', 'order', 'of', 'magnitude', 'larger', 'than', 'that', 'obtainable', 'by', 'correlating', 'pairs', 'of', 'timing', 'data', 'from', 'arrays', 'of', 'equal', 'size']] | [-0.15097724114676533, 0.14315292838535199, -0.008789563161623945, 0.09371493891420135, -0.06404176047520645, -0.12116788384078228, 0.035005890138739025, 0.3792729591614152, -0.22724446308720542, -0.3547538389249828, 0.12868336230623031, -0.33746832804417753, -0.09648779594705507, 0.261136093855757, 0.0023118555181132383, 0.026230758274147982, 0.05870509660151978, -0.010161136018942637, -0.07321337552345639, -0.197695538299039, 0.2198638706846746, 0.13461299301601992, 0.22264263194323664, -0.07313280107582504, 0.09272784402058179, -0.011388967565474022, -0.0845615879088326, -0.011887861379276377, -0.08446037162502762, 0.07343453080505581, 0.24749089760498244, 0.1558735087368054, 0.15985325432146888, -0.43610155809648243, -0.19975187618240534, 0.15069006075128824, 0.1122171970121829, 0.11301168084077268, -0.005866521247539877, -0.33470067982870455, 0.08110687185460365, -0.16971049589351808, -0.08473474717403044, -0.04418917361461748, 0.03627959116507905, 0.06986491209217235, -0.26679088338067847, 0.10516905307444374, 0.019550349616658795, -0.014240376056587121, -0.030238986051787275, -0.12700780275199247, 0.025560898020448364, 0.07710700438088591, 0.04060782755427736, 0.04771364162008401, 0.1387084576144186, -0.08661257082993355, -0.13693615254463562, 0.3402390224853508, -0.11860531763058277, -0.15889915378192013, 0.13897448644485236, -0.19848625575815024, -0.11002300709138164, 0.2311022923053074, 0.18139988781480365, 0.056244694633431826, -0.21441639214333327, -0.03781298803991683, 0.0867702449086867, 0.2896149231349567, 0.14383912064746607, 0.11581841839620484, 0.2769575336112091, 0.13370977277819807, 0.10664855474493949, 0.1341723865276786, -0.19695638489214484, 0.0029573103199791477, -0.2432299687366523, -0.021906538773889105, -0.20472991595771275, 0.04448599130252211, -0.1334112998269427, -0.0932229657002433, 0.36028455928843245, 0.23776983518394676, 0.09536381917500711, 0.06228585859076176, 0.35733653875965493, 0.13075949170581816, 0.0563846858869116, 0.05356218606789024, 0.2802148435253605, 0.09784109968164689, 0.07570581398525623, -0.22333676962137042, 0.03437429008702467, -0.02859744012684713] |
1,802.09629 | The impact of domain walls on the chiral magnetic effect in hot QCD
matter | The Chiral Magnetic Effect (CME) -- the separation of positive and negative
electric charges along the direction of the external magnetic field in
quark-gluon plasma and other topologically non-trivial media -- is a
consequence of the coupling of electrodynamics to the topological gluon field
fluctuations that form metastable $CP$-odd domains. In phenomenological models
it is usually assumed that the domains are uniform and the influence of the
domain walls on the electric current flow is not essential. This paper
challenges the latter assumption. A simple model consisting of a uniform
spherical domain in a uniform time-dependent magnetic field is introduced and
analytically solved. It is shown that (i) no electric current flows into or out
of the domain, (ii) the charge separation current, viz. the total electric
current flowing inside the domain in the external field direction, is a
dissipative Ohm current, (iii) the CME effect can be produced either by the
anomalous current or by the boundary conditions on the domain wall and (iv) the
charge separation current oscillates in plasma long after the external field
decays. These properties are qualitatively different from the CME in an
infinite medium.
| hep-ph nucl-th | the chiral magnetic effect cme the separation of positive and negative electric charges along the direction of the external magnetic field in quarkgluon plasma and other topologically nontrivial media is a consequence of the coupling of electrodynamics to the topological gluon field fluctuations that form metastable cpodd domains in phenomenological models it is usually assumed that the domains are uniform and the influence of the domain walls on the electric current flow is not essential this paper challenges the latter assumption a simple model consisting of a uniform spherical domain in a uniform timedependent magnetic field is introduced and analytically solved it is shown that i no electric current flows into or out of the domain ii the charge separation current viz the total electric current flowing inside the domain in the external field direction is a dissipative ohm current iii the cme effect can be produced either by the anomalous current or by the boundary conditions on the domain wall and iv the charge separation current oscillates in plasma long after the external field decays these properties are qualitatively different from the cme in an infinite medium | [['the', 'chiral', 'magnetic', 'effect', 'cme', 'the', 'separation', 'of', 'positive', 'and', 'negative', 'electric', 'charges', 'along', 'the', 'direction', 'of', 'the', 'external', 'magnetic', 'field', 'in', 'quarkgluon', 'plasma', 'and', 'other', 'topologically', 'nontrivial', 'media', 'is', 'a', 'consequence', 'of', 'the', 'coupling', 'of', 'electrodynamics', 'to', 'the', 'topological', 'gluon', 'field', 'fluctuations', 'that', 'form', 'metastable', 'cpodd', 'domains', 'in', 'phenomenological', 'models', 'it', 'is', 'usually', 'assumed', 'that', 'the', 'domains', 'are', 'uniform', 'and', 'the', 'influence', 'of', 'the', 'domain', 'walls', 'on', 'the', 'electric', 'current', 'flow', 'is', 'not', 'essential', 'this', 'paper', 'challenges', 'the', 'latter', 'assumption', 'a', 'simple', 'model', 'consisting', 'of', 'a', 'uniform', 'spherical', 'domain', 'in', 'a', 'uniform', 'timedependent', 'magnetic', 'field', 'is', 'introduced', 'and', 'analytically', 'solved', 'it', 'is', 'shown', 'that', 'i', 'no', 'electric', 'current', 'flows', 'into', 'or', 'out', 'of', 'the', 'domain', 'ii', 'the', 'charge', 'separation', 'current', 'viz', 'the', 'total', 'electric', 'current', 'flowing', 'inside', 'the', 'domain', 'in', 'the', 'external', 'field', 'direction', 'is', 'a', 'dissipative', 'ohm', 'current', 'iii', 'the', 'cme', 'effect', 'can', 'be', 'produced', 'either', 'by', 'the', 'anomalous', 'current', 'or', 'by', 'the', 'boundary', 'conditions', 'on', 'the', 'domain', 'wall', 'and', 'iv', 'the', 'charge', 'separation', 'current', 'oscillates', 'in', 'plasma', 'long', 'after', 'the', 'external', 'field', 'decays', 'these', 'properties', 'are', 'qualitatively', 'different', 'from', 'the', 'cme', 'in', 'an', 'infinite', 'medium']] | [-0.1820928370152808, 0.2140123389366094, -0.03637186375426802, 0.03733703891184439, -0.09097381583984664, -0.07793861113369782, -0.012684931781668057, 0.37892629327054356, -0.2672448694022333, -0.2725525246375795, 0.07430565848753372, -0.2435606535978645, -0.06152837908271938, 0.141508871917006, 0.020543236431276844, -0.013640779793817313, -0.01315170630720999, 0.05260152446026815, -0.031513933764762574, -0.16378859115363237, 0.3272240331886891, -0.032143155748193014, 0.3275920206363848, 0.10799568253470228, 0.06392260672811895, -0.034661238975922, 0.009605432599238021, 0.10011804773115572, -0.07840537006574023, 0.027090396900522583, 0.13216509651095854, 0.009563568595578855, 0.21495718756650992, -0.4981596490883447, -0.22283024750117392, 0.053402302539015706, 0.14997446143930343, 0.11972411030635952, -0.06452345577789412, -0.2993023360564195, 0.06278002739913682, -0.1426862446749781, -0.13372329402556446, -0.01428707130253315, 0.0474135980457117, 0.0354152826153911, -0.299238062037051, 0.09586888076576523, 0.08513088600042504, 0.04579453452173224, -0.09359512258162524, -0.08781032183980371, -0.03553147017064088, 0.09177939617075026, 0.11257286607095476, 0.1157704228789179, 0.2060263007383873, -0.2119378713393049, -0.0849058600910444, 0.32834784185979515, -0.0697469134886868, -0.23352004858130154, 0.18012301349749868, -0.18398564135806852, -0.03278151565377521, 0.13437648532364735, 0.13171055905788423, 0.10177039522417583, -0.1572955035272629, 0.11014731404058228, -0.015210622836751467, 0.12943100288975984, 0.06325138953732366, -0.020400001383213167, 0.2846024569490568, 0.12734823666037398, 0.07855393264957881, 0.1445692330248966, -0.07994025052857011, -0.07846962682595675, -0.33774361338347514, -0.12954867154265695, -0.17472895676706066, 0.053369247122433044, -0.08232343853462148, -0.20570307340955318, 0.4272705044292726, 0.14238853607960839, 0.1491502777028066, -0.09619683455527225, 0.33209252123042265, 0.12570693805328312, 0.05629042840805499, 0.08782217632409463, 0.27038035766429647, 0.16899301874094663, 0.18367745608903785, -0.26467349109155663, 0.04900236448837801, 0.027981665861010155] |
1,802.0963 | Searching for, and quantifying, non-convexity of functions | Convexity plays a prominent role in a number of problems, but practical
considerations frequently give rise to non-convex functions. We suggest a
method for determining convex regions, and also for assessing the lack of
convexity in the other regions. The method relies on a specially constructed
decomposition of symmetric matrices, such as the Hessian. We illustrate
theoretical results using several examples, one of which analyses a problem
arising in risk measurement and management in insurance and finance.
| math.FA math.OC | convexity plays a prominent role in a number of problems but practical considerations frequently give rise to nonconvex functions we suggest a method for determining convex regions and also for assessing the lack of convexity in the other regions the method relies on a specially constructed decomposition of symmetric matrices such as the hessian we illustrate theoretical results using several examples one of which analyses a problem arising in risk measurement and management in insurance and finance | [['convexity', 'plays', 'a', 'prominent', 'role', 'in', 'a', 'number', 'of', 'problems', 'but', 'practical', 'considerations', 'frequently', 'give', 'rise', 'to', 'nonconvex', 'functions', 'we', 'suggest', 'a', 'method', 'for', 'determining', 'convex', 'regions', 'and', 'also', 'for', 'assessing', 'the', 'lack', 'of', 'convexity', 'in', 'the', 'other', 'regions', 'the', 'method', 'relies', 'on', 'a', 'specially', 'constructed', 'decomposition', 'of', 'symmetric', 'matrices', 'such', 'as', 'the', 'hessian', 'we', 'illustrate', 'theoretical', 'results', 'using', 'several', 'examples', 'one', 'of', 'which', 'analyses', 'a', 'problem', 'arising', 'in', 'risk', 'measurement', 'and', 'management', 'in', 'insurance', 'and', 'finance']] | [-0.06860344274900854, -0.009086968963844822, -0.08197049755609123, 0.12361708576125759, -0.07295268286600129, -0.11224820859149678, 0.050688616508110004, 0.3536567428669372, -0.25885754134264083, -0.2847692976076785, 0.1807194462033932, -0.27180848084390163, -0.20310495492651479, 0.2577036924950488, -0.106819898573464, 0.04938351033956974, 0.05644643900785769, -0.021672144381014946, -0.08413972986208929, -0.20025625810414166, 0.3271267523432707, 0.014311776925845966, 0.27056318338258895, 0.13529129008847204, 0.08914938985140293, 0.01818503278561614, -0.0719331664263041, 0.03408029040491039, -0.1024187545914977, 0.1741450798815697, 0.3199791415479615, 0.1832584759232576, 0.38071581297722273, -0.4097349073302436, -0.20559767244819116, 0.14604546862666484, 0.10596712796598093, 0.07000433038406123, -0.11353982562598373, -0.22991034524007278, 0.041498653393377875, -0.1383533365449977, -0.14258716956942113, -0.10913779896188092, -0.018649633998027097, 0.021190535330044277, -0.32693217515751916, 0.07810519185399503, 0.05826725943812302, 0.08547994128863823, -0.07640070555574417, -0.16730070672929287, 0.026648779581119487, 0.08528850040725106, 0.08480896204468105, -0.040720044964827694, 0.14624472253339052, -0.13160212916116437, -0.1265621659143332, 0.3916188548379517, 0.0222634289220169, -0.24907635195882288, 0.1667200363991032, -0.07478339171835355, -0.20243559344127388, 0.07187925378320278, 0.22243610560265067, 0.1305631197892226, -0.11437444469450017, 0.07454997171457349, -0.04398242784845462, 0.08159395321665404, 0.0474186717024581, 0.04762982910305455, 0.13131657211327707, 0.14518576470965688, 0.13627064464517036, 0.18357815801894728, -0.03957916427609305, -0.1472644116003792, -0.31943381661791115, -0.1347160160227062, -0.16895753226255056, -0.001079233635410473, -0.12250984565890848, -0.21147306225952003, 0.4000169790241045, 0.11409351971966529, 0.18988879528138544, 0.016298905724066903, 0.27984683872381977, 0.10695562808465987, 0.025344651966512977, 0.04742267792560644, 0.20233115094242157, 0.14814320932348052, 0.0756332110915962, -0.17730880032864993, 0.10388343050688892, 0.06877050198941165] |
1,802.09631 | Bayesian shape modelling of cross-sectional geological data | Shape information is of great importance in many applications. For example,
the oil-bearing capacity of sand bodies, the subterranean remnants of ancient
rivers, is related to their cross-sectional shapes. The analysis of these
shapes is therefore of some interest, but current classifications are
simplistic and ad hoc. In this paper, we describe the first steps towards a
coherent statistical analysis of these shapes by deriving the integrated
likelihood for data shapes given class parameters. The result is of interest
beyond this particular application.
| stat.ME stat.AP stat.ML | shape information is of great importance in many applications for example the oilbearing capacity of sand bodies the subterranean remnants of ancient rivers is related to their crosssectional shapes the analysis of these shapes is therefore of some interest but current classifications are simplistic and ad hoc in this paper we describe the first steps towards a coherent statistical analysis of these shapes by deriving the integrated likelihood for data shapes given class parameters the result is of interest beyond this particular application | [['shape', 'information', 'is', 'of', 'great', 'importance', 'in', 'many', 'applications', 'for', 'example', 'the', 'oilbearing', 'capacity', 'of', 'sand', 'bodies', 'the', 'subterranean', 'remnants', 'of', 'ancient', 'rivers', 'is', 'related', 'to', 'their', 'crosssectional', 'shapes', 'the', 'analysis', 'of', 'these', 'shapes', 'is', 'therefore', 'of', 'some', 'interest', 'but', 'current', 'classifications', 'are', 'simplistic', 'and', 'ad', 'hoc', 'in', 'this', 'paper', 'we', 'describe', 'the', 'first', 'steps', 'towards', 'a', 'coherent', 'statistical', 'analysis', 'of', 'these', 'shapes', 'by', 'deriving', 'the', 'integrated', 'likelihood', 'for', 'data', 'shapes', 'given', 'class', 'parameters', 'the', 'result', 'is', 'of', 'interest', 'beyond', 'this', 'particular', 'application']] | [-0.07612711741168779, 0.04425000612873856, -0.06808673061157872, 0.08980998877583571, -0.07997262670669886, -0.05779515447026891, 0.0009006936935049187, 0.3923915482194322, -0.23415630671945287, -0.3253761882462153, 0.15612395323966288, -0.2606546231545508, -0.1803007322752553, 0.24833418815056, -0.1308852705483443, 0.06422561537701546, 0.07444062404243684, -0.0018249888529592172, -0.02898534835974981, -0.20855900389710214, 0.31901645563860853, 0.0478674872585277, 0.28243091739941295, 0.04308645852000975, 0.03156537587737392, -0.014281312128665244, -0.07870646997741083, 0.02364086292161629, -0.16075093466107074, 0.20280327141375804, 0.2854228489010072, 0.18184484690200628, 0.26329956318410797, -0.4075760618306515, -0.23271567857591435, 0.12174970057520379, 0.14642470315625472, 0.11939717116680496, -0.06153437226056689, -0.25070318044731166, 0.05908640837523996, -0.1526787042867665, -0.16681220560198332, -0.04231106544413218, 0.07841271196105858, 0.059776100352769944, -0.19990849011100648, 0.058816348815836555, 0.09471106164657124, 0.0836029495112598, -0.05301303303198571, -0.12456481384181577, 0.01104652969927595, 0.16983333422529806, 0.0808863761180319, -0.0543438893112513, 0.17594658075150374, -0.16676372088628208, -0.06554481296845507, 0.3810110994410224, 0.04113270013263767, -0.18706275434119674, 0.17665716693395886, -0.11039192600334745, -0.1665610913811933, 0.1277414226631929, 0.2019857367296226, 0.09920925242122172, -0.17576175581425338, 0.0377126371526307, -0.03316903965002516, 0.08981340880528456, 0.06398269647970886, 0.022055302769309136, 0.24523820437593158, 0.19878264944489318, 0.021241742804527237, 0.12423201980887026, -0.11857089407105999, -0.11181262285993775, -0.29687653824959587, -0.15108492332169923, -0.1721346344225245, 0.02204982900321938, -0.10175763952482646, -0.17240936784467678, 0.40426922608848387, 0.14662915898668694, 0.20523194283269708, 0.017682594769611593, 0.2989159924341593, 0.059514686749203176, 0.03734983166888436, 0.02712541545184738, 0.21876937416900324, 0.10231730640899935, 0.10679966170431637, -0.13200567464525925, 0.12360451637381097, -0.002302543918897466] |
1,802.09632 | Low energy paths for octahedral tilting in inorganic halide perovskites | Instabilities relating to cooperative octahedral tilting is common in
materials with perovskite structures, and in particular in the sub class of
halide perovskites. In this work, the energetics of octahedral tilting in the
inorganic metal halide perovskites CsPbI$_3$ and CsSnI$_3$ are investigated
using first-principles density functional theory calculations. Several low
energy paths between symmetry equivalent variants of the stable orthorhombic
(\textit{Pnma}) perovskite variant are identified and investigated. The results
are in favor of the presence of dynamic disorder in the octahedral tilting
phase transitions of inorganic halide perovskites. In particular, one specific
type of path, corresponding to an out-of-phase "tilt switch", is found to have
significantly lower energy barrier than the others, which indicates the
existence of a temperature range where the dynamic fluctuations of the
octahedra follow only this type of path. This could produce a time averaged
structure corresponding to the intermediate tetragonal (\textit{P4/mbm})
structure observed in experiments. Deficiencies of the commonly employed simple
one-dimensional "double well" potentials in describing the dynamics of the
octahedra are pointed out and discussed.
| cond-mat.mtrl-sci | instabilities relating to cooperative octahedral tilting is common in materials with perovskite structures and in particular in the sub class of halide perovskites in this work the energetics of octahedral tilting in the inorganic metal halide perovskites cspbi_3 and cssni_3 are investigated using firstprinciples density functional theory calculations several low energy paths between symmetry equivalent variants of the stable orthorhombic textitpnma perovskite variant are identified and investigated the results are in favor of the presence of dynamic disorder in the octahedral tilting phase transitions of inorganic halide perovskites in particular one specific type of path corresponding to an outofphase tilt switch is found to have significantly lower energy barrier than the others which indicates the existence of a temperature range where the dynamic fluctuations of the octahedra follow only this type of path this could produce a time averaged structure corresponding to the intermediate tetragonal textitp4mbm structure observed in experiments deficiencies of the commonly employed simple onedimensional double well potentials in describing the dynamics of the octahedra are pointed out and discussed | [['instabilities', 'relating', 'to', 'cooperative', 'octahedral', 'tilting', 'is', 'common', 'in', 'materials', 'with', 'perovskite', 'structures', 'and', 'in', 'particular', 'in', 'the', 'sub', 'class', 'of', 'halide', 'perovskites', 'in', 'this', 'work', 'the', 'energetics', 'of', 'octahedral', 'tilting', 'in', 'the', 'inorganic', 'metal', 'halide', 'perovskites', 'cspbi_3', 'and', 'cssni_3', 'are', 'investigated', 'using', 'firstprinciples', 'density', 'functional', 'theory', 'calculations', 'several', 'low', 'energy', 'paths', 'between', 'symmetry', 'equivalent', 'variants', 'of', 'the', 'stable', 'orthorhombic', 'textitpnma', 'perovskite', 'variant', 'are', 'identified', 'and', 'investigated', 'the', 'results', 'are', 'in', 'favor', 'of', 'the', 'presence', 'of', 'dynamic', 'disorder', 'in', 'the', 'octahedral', 'tilting', 'phase', 'transitions', 'of', 'inorganic', 'halide', 'perovskites', 'in', 'particular', 'one', 'specific', 'type', 'of', 'path', 'corresponding', 'to', 'an', 'outofphase', 'tilt', 'switch', 'is', 'found', 'to', 'have', 'significantly', 'lower', 'energy', 'barrier', 'than', 'the', 'others', 'which', 'indicates', 'the', 'existence', 'of', 'a', 'temperature', 'range', 'where', 'the', 'dynamic', 'fluctuations', 'of', 'the', 'octahedra', 'follow', 'only', 'this', 'type', 'of', 'path', 'this', 'could', 'produce', 'a', 'time', 'averaged', 'structure', 'corresponding', 'to', 'the', 'intermediate', 'tetragonal', 'textitp4mbm', 'structure', 'observed', 'in', 'experiments', 'deficiencies', 'of', 'the', 'commonly', 'employed', 'simple', 'onedimensional', 'double', 'well', 'potentials', 'in', 'describing', 'the', 'dynamics', 'of', 'the', 'octahedra', 'are', 'pointed', 'out', 'and', 'discussed']] | [-0.15132328999119207, 0.19455094964402686, -0.0056539858883137215, 0.03886195838875959, -0.027863763560376623, -0.12507366732940736, 0.07654957316493999, 0.436233116193291, -0.31200285340549755, -0.2393573985702139, 0.014418282921371215, -0.2641622822622166, -0.17587670432403685, 0.1235163910958149, -0.02836207858122447, -0.02935143413624781, -0.01169117322698345, -0.03321077576632995, -0.12402436737833983, -0.17485031438991427, 0.24565815434124327, 0.05597500494297813, 0.3140548421836951, 0.022100687465246988, 0.027035516768913057, -0.038236379694631874, 0.09378950408084646, 0.04790338123326793, -0.18745640075683376, 0.1323680604397155, 0.268142226910876, -0.04931891299236347, 0.21649390336174024, -0.4418506188208566, -0.2110750200076248, 0.02976019562989035, 0.12921437449643716, 0.11291214198024724, -0.09617143737234395, -0.23162972425548908, 0.08789396956357558, -0.13929217104741837, -0.1362263499195037, -0.08541205208063783, -0.02401265436783433, 0.08795634038636789, -0.21464045963537715, 0.09073459354147095, 0.040553603836965255, 0.09069021887651829, -0.17178127202616236, -0.1458754620350459, -0.09914357414167813, 0.04478530573165592, 0.07934519896858974, 0.011150763381053419, 0.13053729559692062, -0.07712398614522124, -0.1254652895800331, 0.4332400948576191, 0.01826485004849554, -0.08556410036981106, 0.1731313916566946, -0.18321437059134682, -0.13953949794556728, 0.18237071193152052, 0.08719528204597095, 0.13948769394910948, -0.11652098651906914, 0.08315969119139481, 0.008395303328185999, 0.15300738576042933, 0.07912663189173841, 0.08443646619288141, 0.18028567888652428, 0.18760209727273938, 0.032777976266601505, 0.13734918613644206, -0.08578914365018991, -0.13707760467180324, -0.20696626672082963, -0.16867549512535335, -0.12330613978864516, 0.017954759264402504, -0.09274254148956114, -0.22629746879341409, 0.3904882547979736, 0.08180045041346388, 0.1393523744060932, -0.06790385079700226, 0.19070259462357225, 0.04900518072947093, 0.11272402250701014, -0.024151240250862696, 0.27270390120170573, 0.16383242246640078, 0.08482802541625192, -0.26407766362980883, 0.10176543461104089, 0.057509918431477514] |
1,802.09633 | Magnetic order and disorder in nanomagnets probed by superconducting
vortices | We have studied two nanomagnet systems with strong (Co/Pd multilayers) and
weak (NdCo alloy films) stray magnetic fields by probing the out-of-plane
magnetic states with superconducting vortices. The hybrid samples are made of
array of nanomagnets embedded in superconducting Nb thin films. The vortex
motion detects relevant magnetic state features, since superconducting vortices
are able to discriminate between different magnetic stray field strengths and
directions. The usual matching effect between the superconducting vortex
lattice and the periodic pinning array can be quenched by means of disorder
magnetic potentials with strong stray fields at random. Ordered stray fields
retrieve the matching effect and yield asymmetry and shift in the vortex
dissipation signal. Furthermore vortices can discriminate the sizes of the
nanomagnet magnetic domains, detecting magnetic domain sizes as small as 70 nm.
In addition, we observe that the vortex cores play the crucial role instead of
the supercurrents around the vortex.
| cond-mat.supr-con | we have studied two nanomagnet systems with strong copd multilayers and weak ndco alloy films stray magnetic fields by probing the outofplane magnetic states with superconducting vortices the hybrid samples are made of array of nanomagnets embedded in superconducting nb thin films the vortex motion detects relevant magnetic state features since superconducting vortices are able to discriminate between different magnetic stray field strengths and directions the usual matching effect between the superconducting vortex lattice and the periodic pinning array can be quenched by means of disorder magnetic potentials with strong stray fields at random ordered stray fields retrieve the matching effect and yield asymmetry and shift in the vortex dissipation signal furthermore vortices can discriminate the sizes of the nanomagnet magnetic domains detecting magnetic domain sizes as small as 70 nm in addition we observe that the vortex cores play the crucial role instead of the supercurrents around the vortex | [['we', 'have', 'studied', 'two', 'nanomagnet', 'systems', 'with', 'strong', 'copd', 'multilayers', 'and', 'weak', 'ndco', 'alloy', 'films', 'stray', 'magnetic', 'fields', 'by', 'probing', 'the', 'outofplane', 'magnetic', 'states', 'with', 'superconducting', 'vortices', 'the', 'hybrid', 'samples', 'are', 'made', 'of', 'array', 'of', 'nanomagnets', 'embedded', 'in', 'superconducting', 'nb', 'thin', 'films', 'the', 'vortex', 'motion', 'detects', 'relevant', 'magnetic', 'state', 'features', 'since', 'superconducting', 'vortices', 'are', 'able', 'to', 'discriminate', 'between', 'different', 'magnetic', 'stray', 'field', 'strengths', 'and', 'directions', 'the', 'usual', 'matching', 'effect', 'between', 'the', 'superconducting', 'vortex', 'lattice', 'and', 'the', 'periodic', 'pinning', 'array', 'can', 'be', 'quenched', 'by', 'means', 'of', 'disorder', 'magnetic', 'potentials', 'with', 'strong', 'stray', 'fields', 'at', 'random', 'ordered', 'stray', 'fields', 'retrieve', 'the', 'matching', 'effect', 'and', 'yield', 'asymmetry', 'and', 'shift', 'in', 'the', 'vortex', 'dissipation', 'signal', 'furthermore', 'vortices', 'can', 'discriminate', 'the', 'sizes', 'of', 'the', 'nanomagnet', 'magnetic', 'domains', 'detecting', 'magnetic', 'domain', 'sizes', 'as', 'small', 'as', '70', 'nm', 'in', 'addition', 'we', 'observe', 'that', 'the', 'vortex', 'cores', 'play', 'the', 'crucial', 'role', 'instead', 'of', 'the', 'supercurrents', 'around', 'the', 'vortex']] | [-0.21386398052738514, 0.2682166059377293, 0.01974636170702676, 0.03738371213762245, -0.058588234993318715, -0.11187190343625844, 0.002708601566652457, 0.4384097680946191, -0.25246790699660776, -0.3561071984594067, 0.007250540114473552, -0.2642398699124654, -0.04837272283465912, 0.17652640622109175, 0.07547064937961598, 0.005314839696511626, -0.01935565867461264, -0.06313487650826573, -0.027560279088017222, -0.2029898992087692, 0.3111477344110608, -0.029535708509696026, 0.37865230324988564, 0.03846639936013768, 0.021997690415009857, -0.03298761658991377, 0.11377836142977078, 0.08600106649721662, -0.10970716750118299, 0.02563967401899087, 0.19945346866113445, -0.1314986030633251, 0.1618299433418239, -0.5484423251946767, -0.18155238791679343, 0.08160739419981837, 0.15611513888996947, 0.15649660768763474, -0.05387053408737605, -0.33626918797691663, 0.09279123059784372, -0.03712490672866504, -0.12473940069166323, -0.11094432275742293, 0.013646294605763009, 0.07148954074208935, -0.27258287905637796, 0.055101861897856, 0.0967079717037268, 0.12105168081820011, -0.060201011983056864, -0.08811296158159773, -0.058621013802476224, 0.06273659919699033, 0.0543086610819834, 0.09537920458397518, 0.2306664508022368, -0.15969654149298246, -0.11875816507342582, 0.28007194836313526, -0.030883269996847956, -0.10360020059005667, 0.13177187740181884, -0.16264544879396756, -0.02415220841454963, 0.17133636733672272, 0.13508407299717268, 0.06688655516132712, -0.11029428220664461, 0.02371120734567133, 0.021007590792141855, 0.19395137502190968, 0.12159145217078428, 0.09884834127190212, 0.33947233806053795, 0.18350491361071666, 0.02772798948145161, 0.20550514127050215, -0.22688952336708704, -0.049225105848163364, -0.21086684213019907, -0.1274428584985435, -0.20307346308914323, 0.021658946840907446, -0.10461935162107693, -0.20608666572719814, 0.361249150428921, 0.18057176946662368, 0.12777858035541917, -0.10601513566914945, 0.25475879297591747, 0.04587175447649012, 0.1281671162813048, 0.024233669014647602, 0.2621109301255395, 0.25321531283203513, 0.163964348322188, -0.29536673532178004, 0.036487429736492535, -0.02692419385382285] |
1,802.09634 | Model-Based Identification and Control of a One-Legged Hopping Robot | Spring-mass models are well established tools for the analysis and control of
legged locomotion. Among the alternatives, spring-loaded inverted pendulum
(SLIP) model has shown to be a very accurate descriptor of animal locomotion.
Despite its wide use, the SLIP model includes non-integrable stance dynamics
that prevent analytical solutions for its equations of motion. Fortunately,
there are approximate analytical solutions for different SLIP variants.
However, the practicality of such approximations are mostly tested on
simulation studies with a few notable exceptions.
This thesis extends upon a recent approximation to a hip torque actuated
dissipative SLIP (TD-SLIP) model that uses torque actuation to compensate for
energy losses. Systematic experiments for careful assessment of the predictive
performance of the approximate analytical solution is presented on a
well-instrumented one-legged hopping robot which is revised to enhance
compatibility and accuracy of the system. Electronic structure of the robot is
modified according to TD-SLIP model such that robot uses a real-time operating
system to increase processing speed. Using the parameters and results generated
by the predictive performance of the approximate analytical solution, a
model-based controller is designed and implemented on the robot platform to
generate a stable closed-loop running behaviour on the one legged hoping robot
platform. In addition, ground reaction forces during the stance phase on the
experimental platform is investigated and compared with the human running and
the traditional SLIP model data to understand if torque-actuated models
approximate natural locomotion better than traditional model.
| cs.RO | springmass models are well established tools for the analysis and control of legged locomotion among the alternatives springloaded inverted pendulum slip model has shown to be a very accurate descriptor of animal locomotion despite its wide use the slip model includes nonintegrable stance dynamics that prevent analytical solutions for its equations of motion fortunately there are approximate analytical solutions for different slip variants however the practicality of such approximations are mostly tested on simulation studies with a few notable exceptions this thesis extends upon a recent approximation to a hip torque actuated dissipative slip tdslip model that uses torque actuation to compensate for energy losses systematic experiments for careful assessment of the predictive performance of the approximate analytical solution is presented on a wellinstrumented onelegged hopping robot which is revised to enhance compatibility and accuracy of the system electronic structure of the robot is modified according to tdslip model such that robot uses a realtime operating system to increase processing speed using the parameters and results generated by the predictive performance of the approximate analytical solution a modelbased controller is designed and implemented on the robot platform to generate a stable closedloop running behaviour on the one legged hoping robot platform in addition ground reaction forces during the stance phase on the experimental platform is investigated and compared with the human running and the traditional slip model data to understand if torqueactuated models approximate natural locomotion better than traditional model | [['springmass', 'models', 'are', 'well', 'established', 'tools', 'for', 'the', 'analysis', 'and', 'control', 'of', 'legged', 'locomotion', 'among', 'the', 'alternatives', 'springloaded', 'inverted', 'pendulum', 'slip', 'model', 'has', 'shown', 'to', 'be', 'a', 'very', 'accurate', 'descriptor', 'of', 'animal', 'locomotion', 'despite', 'its', 'wide', 'use', 'the', 'slip', 'model', 'includes', 'nonintegrable', 'stance', 'dynamics', 'that', 'prevent', 'analytical', 'solutions', 'for', 'its', 'equations', 'of', 'motion', 'fortunately', 'there', 'are', 'approximate', 'analytical', 'solutions', 'for', 'different', 'slip', 'variants', 'however', 'the', 'practicality', 'of', 'such', 'approximations', 'are', 'mostly', 'tested', 'on', 'simulation', 'studies', 'with', 'a', 'few', 'notable', 'exceptions', 'this', 'thesis', 'extends', 'upon', 'a', 'recent', 'approximation', 'to', 'a', 'hip', 'torque', 'actuated', 'dissipative', 'slip', 'tdslip', 'model', 'that', 'uses', 'torque', 'actuation', 'to', 'compensate', 'for', 'energy', 'losses', 'systematic', 'experiments', 'for', 'careful', 'assessment', 'of', 'the', 'predictive', 'performance', 'of', 'the', 'approximate', 'analytical', 'solution', 'is', 'presented', 'on', 'a', 'wellinstrumented', 'onelegged', 'hopping', 'robot', 'which', 'is', 'revised', 'to', 'enhance', 'compatibility', 'and', 'accuracy', 'of', 'the', 'system', 'electronic', 'structure', 'of', 'the', 'robot', 'is', 'modified', 'according', 'to', 'tdslip', 'model', 'such', 'that', 'robot', 'uses', 'a', 'realtime', 'operating', 'system', 'to', 'increase', 'processing', 'speed', 'using', 'the', 'parameters', 'and', 'results', 'generated', 'by', 'the', 'predictive', 'performance', 'of', 'the', 'approximate', 'analytical', 'solution', 'a', 'modelbased', 'controller', 'is', 'designed', 'and', 'implemented', 'on', 'the', 'robot', 'platform', 'to', 'generate', 'a', 'stable', 'closedloop', 'running', 'behaviour', 'on', 'the', 'one', 'legged', 'hoping', 'robot', 'platform', 'in', 'addition', 'ground', 'reaction', 'forces', 'during', 'the', 'stance', 'phase', 'on', 'the', 'experimental', 'platform', 'is', 'investigated', 'and', 'compared', 'with', 'the', 'human', 'running', 'and', 'the', 'traditional', 'slip', 'model', 'data', 'to', 'understand', 'if', 'torqueactuated', 'models', 'approximate', 'natural', 'locomotion', 'better', 'than', 'traditional', 'model']] | [-0.11438814845606135, 0.04011313911755314, -0.09685832147600959, 0.019066693363436162, -0.1310755162841723, -0.21555966625131573, 0.026968427257855986, 0.39940648952711233, -0.22544239949678632, -0.33094531827005025, 0.09932279070843707, -0.252631647445513, -0.17054261371418677, 0.2588703229410362, -0.08020984394208602, 0.14178123220090091, 0.12468168875870574, 0.02568719824500979, -0.007717784491828387, -0.176512557866822, 0.20455977985073462, 0.05216050743152886, 0.3050316552619768, 0.024585961827906122, 0.1485043027863606, -0.030070729580224505, 0.04079495257018173, 0.005399651860518387, -0.12177077915667697, 0.095006200148948, 0.24754566103574266, 0.08169696757271257, 0.2563280427743944, -0.4349775757357667, -0.21698383502770247, 0.05946898090045011, 0.11902192195205466, 0.09891524381163425, -0.04414379859700768, -0.3115481092016908, 0.07643528160553638, -0.20396434121965606, -0.12597089549595342, -0.12111874399333407, 0.015394786032376505, 0.030022387786518844, -0.278004718597886, 0.043606203841733186, 0.027764938406760212, 0.08322523386936777, -0.10382380217160511, -0.07260956782218903, -0.005867462504049959, 0.15003223157240242, 0.04997455384405448, 0.008645749953599992, 0.18692055500323937, -0.1324664723992108, -0.12577328911711333, 0.4080461023123896, -0.005688934447747294, -0.2500282362740062, 0.22447231544362467, -0.04160547540483815, -0.07530461705215118, 0.11390842119318272, 0.20834330183292743, 0.09360975381144114, -0.16663457327920211, 0.02806076369757218, 0.014843295352879267, 0.172480492897819, 0.037053351309189755, -0.07028718233572218, 0.17519543379081515, 0.26816304601760355, 0.0685136487411791, 0.10296385410145506, -0.038287289762861616, -0.1675044262019391, -0.2408250806816826, -0.1058836584875261, -0.14323256307827772, -0.0270804216395592, -0.0891346935688013, -0.14297106707866994, 0.4012141024363758, 0.20774265029860606, 0.1353849477433297, 0.09234160017114101, 0.35874411256252964, 0.06858628067946383, 0.07311442875763095, 0.05388066225600692, 0.27731201025551255, 0.06608370680043686, 0.12387815085416541, -0.2521969467511534, 0.11541235070815113, 0.03987966528464942] |
1,802.09635 | Broadband EPR Spectroscopy in Diverse Field Conditions Using Optically
Detected Nitrogen-Vacancy Centers in Diamond | Paramagnetic magnetic resonance, a powerful technique for characterizing and
identifying chemical targets, is increasingly used for imaging; however, low
spin polarization at room temperature and moderate magnetic fields poses
challenges for detecting small numbers of spins. In this work, we use
fluorescence from nitrogen-vacancy (NV) centers in diamond to detect the
electron paramagnetic resonance (EPR) spectrum of optically inactive target
spins under various conditions of field magnitude and orientation. The protocol
requires neither direct microwave manipulation of the NV spins nor spectral
overlap between NV and target spin resonances, thus enabling broadband
detection. This unexpected non-resonant coupling is attributable to a
two-phonon process that relaxes NV spins proximate to the fluctuating dipole
moment of the target spin, suggesting that the sensitivity is determined by the
dipole-dipole coupling strength. This approach holds promise for sensitive EPR
detection, particularly in settings where control over the diamond-crystal
orientation is difficult. This is notably the case for biological sensing
applications, where nanodiamonds are being pursued for their bright, stable
fluorescence and biocompatibility.
| cond-mat.mes-hall | paramagnetic magnetic resonance a powerful technique for characterizing and identifying chemical targets is increasingly used for imaging however low spin polarization at room temperature and moderate magnetic fields poses challenges for detecting small numbers of spins in this work we use fluorescence from nitrogenvacancy nv centers in diamond to detect the electron paramagnetic resonance epr spectrum of optically inactive target spins under various conditions of field magnitude and orientation the protocol requires neither direct microwave manipulation of the nv spins nor spectral overlap between nv and target spin resonances thus enabling broadband detection this unexpected nonresonant coupling is attributable to a twophonon process that relaxes nv spins proximate to the fluctuating dipole moment of the target spin suggesting that the sensitivity is determined by the dipoledipole coupling strength this approach holds promise for sensitive epr detection particularly in settings where control over the diamondcrystal orientation is difficult this is notably the case for biological sensing applications where nanodiamonds are being pursued for their bright stable fluorescence and biocompatibility | [['paramagnetic', 'magnetic', 'resonance', 'a', 'powerful', 'technique', 'for', 'characterizing', 'and', 'identifying', 'chemical', 'targets', 'is', 'increasingly', 'used', 'for', 'imaging', 'however', 'low', 'spin', 'polarization', 'at', 'room', 'temperature', 'and', 'moderate', 'magnetic', 'fields', 'poses', 'challenges', 'for', 'detecting', 'small', 'numbers', 'of', 'spins', 'in', 'this', 'work', 'we', 'use', 'fluorescence', 'from', 'nitrogenvacancy', 'nv', 'centers', 'in', 'diamond', 'to', 'detect', 'the', 'electron', 'paramagnetic', 'resonance', 'epr', 'spectrum', 'of', 'optically', 'inactive', 'target', 'spins', 'under', 'various', 'conditions', 'of', 'field', 'magnitude', 'and', 'orientation', 'the', 'protocol', 'requires', 'neither', 'direct', 'microwave', 'manipulation', 'of', 'the', 'nv', 'spins', 'nor', 'spectral', 'overlap', 'between', 'nv', 'and', 'target', 'spin', 'resonances', 'thus', 'enabling', 'broadband', 'detection', 'this', 'unexpected', 'nonresonant', 'coupling', 'is', 'attributable', 'to', 'a', 'twophonon', 'process', 'that', 'relaxes', 'nv', 'spins', 'proximate', 'to', 'the', 'fluctuating', 'dipole', 'moment', 'of', 'the', 'target', 'spin', 'suggesting', 'that', 'the', 'sensitivity', 'is', 'determined', 'by', 'the', 'dipoledipole', 'coupling', 'strength', 'this', 'approach', 'holds', 'promise', 'for', 'sensitive', 'epr', 'detection', 'particularly', 'in', 'settings', 'where', 'control', 'over', 'the', 'diamondcrystal', 'orientation', 'is', 'difficult', 'this', 'is', 'notably', 'the', 'case', 'for', 'biological', 'sensing', 'applications', 'where', 'nanodiamonds', 'are', 'being', 'pursued', 'for', 'their', 'bright', 'stable', 'fluorescence', 'and', 'biocompatibility']] | [-0.10069720267787335, 0.19625821811409144, 0.04250265382687578, 0.030400968279150085, -0.02334457560592961, -0.1890033590914068, 0.02915705232162999, 0.47346985581871903, -0.20995236414869478, -0.3209384625755295, 0.027973470928476466, -0.29015424376364773, -0.03371996796288399, 0.19699827914577936, 0.019466657113440023, 0.017202011154808416, 0.010441124605148762, -0.00017406308778121087, -2.052868621613451e-05, -0.13335274313688056, 0.25273541533938904, 0.024530942208819583, 0.33699834335059997, 0.09934710680812452, 0.097907716815477, 0.08281987040822288, 0.08851778066074364, -0.028410442990479533, -0.06054098072190264, 0.12397986449598207, 0.3200220715946066, 0.0439413303319744, 0.2234975624980104, -0.4013557068133604, -0.1755025818620524, 0.12627395493512372, 0.16625210381263567, 0.19021791162828128, -0.11281958409420544, -0.30428683997444184, 0.0262313328410114, -0.08710775064432737, -0.16073570730482523, -0.11104679919924297, 0.022841218056597796, -0.020873414924853444, -0.2953576089278934, 0.10252294329156776, 0.07078537165011631, 0.10953417597728932, -0.07476987521732952, -0.056045889346944, -0.002774240434431878, 0.10260580372606254, 0.012293325149988153, 0.04303079164757053, 0.2589671022403695, -0.1403673482657282, -0.12659412375958023, 0.32473900923672727, -0.026206322828541972, -0.08437849012880397, 0.21164861268400142, -0.18898001442590873, -0.12099536500374848, 0.16547244981567036, 0.1248054727326387, 0.17090944852958806, -0.16970999879361, 0.05386731196261112, 0.056073728665809876, 0.2047039570606141, 0.07324984799345542, 0.12108930134811177, 0.2720191743584562, 0.17385093990467979, 0.11341922180615589, 0.12918192686925747, -0.185649565672, -0.03416713937408776, -0.16564337386956027, -0.131173437090401, -0.23368373041286575, 0.09282410525238284, -0.06119512484283786, -0.10942225195857846, 0.37037888577648487, 0.17700036544865833, 0.14706304619467991, -0.07645919836059346, 0.33049980186701133, 0.05855218797167875, 0.0789893481177752, -0.021500838545435472, 0.2950180845870497, 0.24302518942315288, 0.08354559179582259, -0.3197193598098674, 0.06265443712413662, -0.08606565516709747] |
1,802.09636 | On the Boundary Point Principle for divergence-type equations | We provide some versions of the Zaremba-Hopf-Oleinik boundary point lemma for
general elliptic and parabolic equations in divergence form under the sharp
requirements on the coefficients of equations and on the boundaries of domains.
| math.AP | we provide some versions of the zarembahopfoleinik boundary point lemma for general elliptic and parabolic equations in divergence form under the sharp requirements on the coefficients of equations and on the boundaries of domains | [['we', 'provide', 'some', 'versions', 'of', 'the', 'zarembahopfoleinik', 'boundary', 'point', 'lemma', 'for', 'general', 'elliptic', 'and', 'parabolic', 'equations', 'in', 'divergence', 'form', 'under', 'the', 'sharp', 'requirements', 'on', 'the', 'coefficients', 'of', 'equations', 'and', 'on', 'the', 'boundaries', 'of', 'domains']] | [-0.1503024427855218, 0.015385363448524115, -0.1074526406485926, 0.047401540715134506, -0.0862369749582175, -0.10785973924353268, 0.011467367721100649, 0.2822191599530704, -0.28065015240149066, -0.19059790958735076, 0.18680560385286243, -0.29373994658023794, -0.117768106417674, 0.2696041695660714, -0.13000092886839854, 0.13082933846409572, 0.06389397808181291, 0.04711285258279972, -0.12563035834693548, -0.2313653172530008, 0.4407551847962719, -0.11869356589335384, 0.25040362639860675, 0.10366767580501002, 0.09936973338269374, 0.006221501848124193, 0.017936155510445435, -0.009221073663370176, -0.23460935993176518, 0.14760359601033005, 0.216865808787671, -0.0029528788149808393, 0.2451522946922165, -0.480405586235451, -0.16411975398659706, 0.03189919158026124, 0.04547894324676952, 0.06388394720852375, -0.04899435702739566, -0.27914779136578244, 0.06580774573552789, -0.014755351497142605, -0.2054691252044656, -0.044983689383970515, -0.0457067388871854, 0.09401292653020585, -0.297499093622195, 0.13376849393049875, 0.12905036727192276, 0.10027746070232807, -0.152301394126632, -0.1061880344024041, 0.010113754055716774, 0.06439297300565874, 0.03905593211565054, -0.06433617760723626, 0.035182271166845705, -0.18617125690886469, -0.06422784294453308, 0.3621204654601487, -0.06706238893622701, -0.3225428862779429, 0.16936593626936278, -0.14095238065629295, -0.14165088545643922, 0.0777004524275209, 0.23313741649811467, 0.1517527989309394, -0.13965954163083524, 0.15359542780965002, -0.03883058930196884, 0.08367673878180512, 0.1603864970137224, 0.006225652281886361, 0.07932108008500302, 0.03570227299562909, 0.16123952648856424, 0.15582140007366738, -0.007203986141548464, -0.14158025350083003, -0.41012989910263004, -0.17844863196439814, -0.06938549193243186, 0.044226307309035096, -0.15732366573259546, -0.22649289743805473, 0.3899674585695858, 0.10923520108741341, 0.17854746021189247, 0.04222011362964457, 0.19353493929586627, 0.19821022117905546, 0.04899942886197206, 0.09885835243568925, 0.16538140814571473, 0.1668678492053666, 0.11794992105216917, -0.17771413527203328, 0.050221772737462415, 0.19741772947776498] |
1,802.09637 | Metric and geometric relaxations of self-contracted curves | Self-contractedness (or self-expandedness, depending on the orientation) is
hereby extended in two natural ways giving rise, for any
$\lambda\in\lbrack-1,1)$, to the metric notion of $\lambda $-curve and the
(weaker) geometric notion of $\lambda$-cone property ($\lambda$-eel). In the
Euclidean space $\mathbb{R}^{d}$ it is established that for
$\lambda\in\lbrack-1,1/d)$ bounded $\lambda$-curves have finite length. For
$\lambda\geq 1/\sqrt{5}$ it is always possible to construct bounded curves of
infinite length in ${\mathbb{R}}^{3}$ which do satisfy the $\lambda $-cone
property. This can never happen in ${\mathbb{R}}^{2}$ though: it is shown that
all bounded planar curves with the $\lambda$-cone property have finite length.
| math.MG | selfcontractedness or selfexpandedness depending on the orientation is hereby extended in two natural ways giving rise for any lambdainlbrack11 to the metric notion of lambda curve and the weaker geometric notion of lambdacone property lambdaeel in the euclidean space mathbbrd it is established that for lambdainlbrack11d bounded lambdacurves have finite length for lambdageq 1sqrt5 it is always possible to construct bounded curves of infinite length in mathbbr3 which do satisfy the lambda cone property this can never happen in mathbbr2 though it is shown that all bounded planar curves with the lambdacone property have finite length | [['selfcontractedness', 'or', 'selfexpandedness', 'depending', 'on', 'the', 'orientation', 'is', 'hereby', 'extended', 'in', 'two', 'natural', 'ways', 'giving', 'rise', 'for', 'any', 'lambdainlbrack11', 'to', 'the', 'metric', 'notion', 'of', 'lambda', 'curve', 'and', 'the', 'weaker', 'geometric', 'notion', 'of', 'lambdacone', 'property', 'lambdaeel', 'in', 'the', 'euclidean', 'space', 'mathbbrd', 'it', 'is', 'established', 'that', 'for', 'lambdainlbrack11d', 'bounded', 'lambdacurves', 'have', 'finite', 'length', 'for', 'lambdageq', '1sqrt5', 'it', 'is', 'always', 'possible', 'to', 'construct', 'bounded', 'curves', 'of', 'infinite', 'length', 'in', 'mathbbr3', 'which', 'do', 'satisfy', 'the', 'lambda', 'cone', 'property', 'this', 'can', 'never', 'happen', 'in', 'mathbbr2', 'though', 'it', 'is', 'shown', 'that', 'all', 'bounded', 'planar', 'curves', 'with', 'the', 'lambdacone', 'property', 'have', 'finite', 'length']] | [-0.1460151585144393, 0.1900254211743066, -0.10269949631765485, 0.07731931828708515, -0.12396237828281963, -0.16230162797728553, -0.04181687027977949, 0.39805825609205797, -0.3111828980247744, -0.1960662221112712, 0.0946307489383881, -0.25351509237026965, -0.11751153999251653, 0.211337847983073, -0.08965316626464218, 0.03876698823031885, 0.0001953275641426444, 0.12384605195521461, -0.06613324367274552, -0.2851697144479575, 0.343638542171737, -0.06921403620138088, 0.24062303809279745, 0.09517455464678774, 0.11667801973685114, 0.00532481316159564, 0.02848167377735742, 0.08801272561719418, -0.2029343723719318, 0.06039020792311269, 0.21946156802269715, 0.12114142117206939, 0.22115026221779938, -0.3684277296574278, -0.22287320537196303, 0.23441719757763416, 0.14777652447281237, 0.025591147030354477, 0.02960933310995725, -0.22186567388813605, 0.16282227241158995, -0.07132790701672836, -0.2162845162039792, -0.013289762650277804, 0.10308835532685573, -0.01455389922061427, -0.2228606712993827, -0.003433464396617968, 0.18262954598123377, 0.059661058185156435, -0.036980433241379534, -0.05352418491913175, -0.03461783561876721, 0.06708876540704461, 0.017133556835522704, 0.09520740197463469, 0.018708174958274783, -0.03293611207416027, -0.06916334897422613, 0.37819921266583895, -0.06283526352225718, -0.2890747017650442, 0.1321998899167573, -0.1632495521017435, -0.10598318195182153, 0.13411295945512725, 0.09138158606153658, 0.1229931276545606, -0.08493845286482776, 0.20055154152148383, -0.11368648790680295, 0.1328842200614004, 0.13996372957163575, 0.07213248581154569, 0.1277144274632023, 0.06319399451074953, 0.1612907155094118, 0.13434823448981412, 0.00046939932243813843, -0.1106510385745258, -0.33620387337974866, -0.1365013310079865, -0.1689891998632282, 0.08310439567536708, -0.11438269605208586, -0.23616120414060954, 0.2980558710246855, 0.07684201445028355, 0.21434754321605645, 0.1032121246349892, 0.21707939183529976, 0.11161282788750461, 0.08644619343315506, 0.07085279287474061, 0.20331660742786797, 0.09286892293841281, 0.017336745307230474, -0.16114826472899454, 0.0883699105152945, 0.12032056207367119] |
1,802.09638 | Local and global methods in representations of Hecke algebras | This paper aims at developing a "local--global" approach for various types of
finite dimensional algebras, especially those related to Hecke algebras. The
eventual intention is to apply the methods and applications developed here to
the cross-characteristic representation theory of finite groups of Lie type.
The authors first review the notions of quasi-hereditary and stratified
algebras over a Noetherian commutative ring. They prove that many global
properties of these algebras hold if and only if they hold locally at every
prime ideal. When the commutative ring is sufficiently good, it is often
sufficient to check just the prime ideals of height at most one. These methods
are applied to construct certain generalized q-Schur algebras, proving they are
often quasi-hereditary (the "good" prime case) but always stratified. Finally,
these results are used to prove a triangular decomposition matrix theorem for
the modular representations of Hecke algebras at good primes. In the bad prime
case, the generalized q-Schur algebras are at least stratified, and a block
triangular analogue of the good prime case is proved, where the blocks
correspond to Kazhdan-Lusztig cells.
| math.RT math.QA math.RA | this paper aims at developing a localglobal approach for various types of finite dimensional algebras especially those related to hecke algebras the eventual intention is to apply the methods and applications developed here to the crosscharacteristic representation theory of finite groups of lie type the authors first review the notions of quasihereditary and stratified algebras over a noetherian commutative ring they prove that many global properties of these algebras hold if and only if they hold locally at every prime ideal when the commutative ring is sufficiently good it is often sufficient to check just the prime ideals of height at most one these methods are applied to construct certain generalized qschur algebras proving they are often quasihereditary the good prime case but always stratified finally these results are used to prove a triangular decomposition matrix theorem for the modular representations of hecke algebras at good primes in the bad prime case the generalized qschur algebras are at least stratified and a block triangular analogue of the good prime case is proved where the blocks correspond to kazhdanlusztig cells | [['this', 'paper', 'aims', 'at', 'developing', 'a', 'localglobal', 'approach', 'for', 'various', 'types', 'of', 'finite', 'dimensional', 'algebras', 'especially', 'those', 'related', 'to', 'hecke', 'algebras', 'the', 'eventual', 'intention', 'is', 'to', 'apply', 'the', 'methods', 'and', 'applications', 'developed', 'here', 'to', 'the', 'crosscharacteristic', 'representation', 'theory', 'of', 'finite', 'groups', 'of', 'lie', 'type', 'the', 'authors', 'first', 'review', 'the', 'notions', 'of', 'quasihereditary', 'and', 'stratified', 'algebras', 'over', 'a', 'noetherian', 'commutative', 'ring', 'they', 'prove', 'that', 'many', 'global', 'properties', 'of', 'these', 'algebras', 'hold', 'if', 'and', 'only', 'if', 'they', 'hold', 'locally', 'at', 'every', 'prime', 'ideal', 'when', 'the', 'commutative', 'ring', 'is', 'sufficiently', 'good', 'it', 'is', 'often', 'sufficient', 'to', 'check', 'just', 'the', 'prime', 'ideals', 'of', 'height', 'at', 'most', 'one', 'these', 'methods', 'are', 'applied', 'to', 'construct', 'certain', 'generalized', 'qschur', 'algebras', 'proving', 'they', 'are', 'often', 'quasihereditary', 'the', 'good', 'prime', 'case', 'but', 'always', 'stratified', 'finally', 'these', 'results', 'are', 'used', 'to', 'prove', 'a', 'triangular', 'decomposition', 'matrix', 'theorem', 'for', 'the', 'modular', 'representations', 'of', 'hecke', 'algebras', 'at', 'good', 'primes', 'in', 'the', 'bad', 'prime', 'case', 'the', 'generalized', 'qschur', 'algebras', 'are', 'at', 'least', 'stratified', 'and', 'a', 'block', 'triangular', 'analogue', 'of', 'the', 'good', 'prime', 'case', 'is', 'proved', 'where', 'the', 'blocks', 'correspond', 'to', 'kazhdanlusztig', 'cells']] | [-0.13778079776275465, 0.06009767668623498, -0.09018591240662353, 0.13042388073111463, -0.10731804622181135, -0.20619759681067487, -0.07253164042037126, 0.35688463561028744, -0.37173661028552674, -0.18393109977380606, 0.13549808048520903, -0.22765046160397584, -0.12806778501812888, 0.21159264482961, -0.15100490309521764, -0.025503340233819737, 0.06819143714435273, 0.12997628116912557, -0.07269751054544377, -0.3587486194706829, 0.3770584111081114, 0.018445809918075966, 0.26719192141542136, 0.00039686720984774597, 0.05996277562717194, 0.013208524545123957, -0.0017282280527242569, 0.017010512525038844, -0.16874944899568897, 0.11343678110669361, 0.40283466851619704, 0.03076387639807839, 0.2713905084376125, -0.40981652404688296, -0.0768014408229179, 0.20068449954184905, 0.1648840072250004, 0.041127874457417835, -0.014554425118641938, -0.19936376143189657, 0.1739565894949411, -0.20893786727924255, -0.16461329636123037, -0.08980490451590184, 0.028518645891493093, 0.030348617107446133, -0.29414747124173624, -0.008666837577546774, 0.11770582216656533, 0.16397870367122347, -0.06922247798010374, -0.13189796299423875, -0.024017887843601073, 0.09761090541220083, -0.050354156793386534, -0.03922316397139646, 0.09525975030059952, -0.08569080582300401, -0.13470059850867108, 0.35978377482453205, 0.0387852427991258, -0.18987125546187578, 0.20141818642931048, -0.2033209608576401, -0.18772439272585195, 0.08959444829746664, 0.04978014269645987, 0.12667812744515503, -0.02323638420597866, 0.14152556273685613, -0.15429618420838978, 0.04889781302941557, 0.1095339945418625, 0.013488118560183482, 0.17883114200397576, 0.07497237358819797, 0.05871983109218948, 0.08932380849240587, 0.062217573361801684, 0.0028427462535780233, -0.3440743015985416, -0.16519923319041147, -0.11879968067225298, 0.07848969244986106, -0.08933482310109038, -0.17351563376967674, 0.37525101577311587, 0.12830734980655523, 0.1119535807077903, 0.10755645270672673, 0.21534500412601332, 0.06273789825431701, 0.12389274495107501, 0.06398809649695397, 0.12157540695283915, 0.27841138327234116, -0.00292184525728746, -0.08124549608604785, -0.016105585215176202, 0.20828906579109627] |
1,802.09639 | Learning for Constrained Optimization: Identifying Optimal Active
Constraint Sets | In many engineered systems, optimization is used for decision making at
time-scales ranging from real-time operation to long-term planning. This
process often involves solving similar optimization problems over and over
again with slightly modified input parameters, often under tight latency
requirements. We consider the problem of using the information available
through this repeated solution process to directly learn a model of the optimal
solution as a function of the input parameters, thus reducing the need to solve
computationally expensive large-scale parametric programs in real time. Our
proposed method is based on learning relevant sets of active constraints, from
which the optimal solution can be obtained efficiently. Using active sets as
features preserves information about the physics of the system, enables
interpretable models, accounts for relevant safety constraints, and is easy to
represent and encode. However, the total number of active sets is also very
large, as it grows exponentially with system size. The key contribution of this
paper is a streaming algorithm that learns the relevant active sets from
training samples consisting of the input parameters and the corresponding
optimal solution, without any assumptions on the problem structure. The
algorithm comes with theoretical performance guarantees, and is known to
converge fast for problem instances with a small number of relevant active
sets. It can thus be used to establish the practicability of the learning
method. Through extensive experiments on the Optimal Power Flow problem, we
observe that often only a few active sets are relevant in practice, suggesting
that the active sets is the appropriate level of abstraction for a learning
algorithm to target.
| math.OC | in many engineered systems optimization is used for decision making at timescales ranging from realtime operation to longterm planning this process often involves solving similar optimization problems over and over again with slightly modified input parameters often under tight latency requirements we consider the problem of using the information available through this repeated solution process to directly learn a model of the optimal solution as a function of the input parameters thus reducing the need to solve computationally expensive largescale parametric programs in real time our proposed method is based on learning relevant sets of active constraints from which the optimal solution can be obtained efficiently using active sets as features preserves information about the physics of the system enables interpretable models accounts for relevant safety constraints and is easy to represent and encode however the total number of active sets is also very large as it grows exponentially with system size the key contribution of this paper is a streaming algorithm that learns the relevant active sets from training samples consisting of the input parameters and the corresponding optimal solution without any assumptions on the problem structure the algorithm comes with theoretical performance guarantees and is known to converge fast for problem instances with a small number of relevant active sets it can thus be used to establish the practicability of the learning method through extensive experiments on the optimal power flow problem we observe that often only a few active sets are relevant in practice suggesting that the active sets is the appropriate level of abstraction for a learning algorithm to target | [['in', 'many', 'engineered', 'systems', 'optimization', 'is', 'used', 'for', 'decision', 'making', 'at', 'timescales', 'ranging', 'from', 'realtime', 'operation', 'to', 'longterm', 'planning', 'this', 'process', 'often', 'involves', 'solving', 'similar', 'optimization', 'problems', 'over', 'and', 'over', 'again', 'with', 'slightly', 'modified', 'input', 'parameters', 'often', 'under', 'tight', 'latency', 'requirements', 'we', 'consider', 'the', 'problem', 'of', 'using', 'the', 'information', 'available', 'through', 'this', 'repeated', 'solution', 'process', 'to', 'directly', 'learn', 'a', 'model', 'of', 'the', 'optimal', 'solution', 'as', 'a', 'function', 'of', 'the', 'input', 'parameters', 'thus', 'reducing', 'the', 'need', 'to', 'solve', 'computationally', 'expensive', 'largescale', 'parametric', 'programs', 'in', 'real', 'time', 'our', 'proposed', 'method', 'is', 'based', 'on', 'learning', 'relevant', 'sets', 'of', 'active', 'constraints', 'from', 'which', 'the', 'optimal', 'solution', 'can', 'be', 'obtained', 'efficiently', 'using', 'active', 'sets', 'as', 'features', 'preserves', 'information', 'about', 'the', 'physics', 'of', 'the', 'system', 'enables', 'interpretable', 'models', 'accounts', 'for', 'relevant', 'safety', 'constraints', 'and', 'is', 'easy', 'to', 'represent', 'and', 'encode', 'however', 'the', 'total', 'number', 'of', 'active', 'sets', 'is', 'also', 'very', 'large', 'as', 'it', 'grows', 'exponentially', 'with', 'system', 'size', 'the', 'key', 'contribution', 'of', 'this', 'paper', 'is', 'a', 'streaming', 'algorithm', 'that', 'learns', 'the', 'relevant', 'active', 'sets', 'from', 'training', 'samples', 'consisting', 'of', 'the', 'input', 'parameters', 'and', 'the', 'corresponding', 'optimal', 'solution', 'without', 'any', 'assumptions', 'on', 'the', 'problem', 'structure', 'the', 'algorithm', 'comes', 'with', 'theoretical', 'performance', 'guarantees', 'and', 'is', 'known', 'to', 'converge', 'fast', 'for', 'problem', 'instances', 'with', 'a', 'small', 'number', 'of', 'relevant', 'active', 'sets', 'it', 'can', 'thus', 'be', 'used', 'to', 'establish', 'the', 'practicability', 'of', 'the', 'learning', 'method', 'through', 'extensive', 'experiments', 'on', 'the', 'optimal', 'power', 'flow', 'problem', 'we', 'observe', 'that', 'often', 'only', 'a', 'few', 'active', 'sets', 'are', 'relevant', 'in', 'practice', 'suggesting', 'that', 'the', 'active', 'sets', 'is', 'the', 'appropriate', 'level', 'of', 'abstraction', 'for', 'a', 'learning', 'algorithm', 'to', 'target']] | [-0.07839598768623546, 0.05371970822902354, -0.06449487547665327, 0.07820471659023855, -0.10157297084030385, -0.1511973340000788, 0.08286979715436853, 0.3805113179012992, -0.31322119449914404, -0.36423179970623815, 0.1424215383281769, -0.2485582778293368, -0.15549318079799626, 0.2518082344595865, -0.07495227346909374, 0.1201395317171277, 0.10049205253017135, 0.04767627093216023, -0.039995893674627456, -0.2580221619317661, 0.2922898045358262, 0.06187424398023833, 0.28735459576516104, -0.008789639212023538, 0.1443698442096568, 0.006328345771180466, -0.013437157456240984, 0.03638056918597696, -0.06408710914765282, 0.14867430271855978, 0.29939697277229765, 0.20390410468363288, 0.32380718736870523, -0.42057199825560954, -0.19749903669986507, 0.10851336784341556, 0.13745195734946086, 0.11590369382941969, -0.0198238022254152, -0.23463349423995664, 0.09027696764325921, -0.11429570358472341, -0.05972055123702651, -0.10774349042560172, -0.009080834734380584, 0.01473668056353221, -0.33485512743341544, 0.024350712462006468, 0.024492116383925983, 0.0016689529496061643, -0.06955160565716638, -0.0919771594388735, 0.01909768442838509, 0.15716784409508391, 0.05476567817470024, 0.02451857936422598, 0.1475970261874891, -0.1220920239764823, -0.09627857836400808, 0.38969671492139407, -0.0034664487100213373, -0.21504426039058616, 0.2037867140258613, -0.0488675782015145, -0.1302433941296344, 0.16869236970193346, 0.22445572843593475, 0.14247484360715712, -0.15371282250734195, 0.07971767190677136, -0.05921953409966646, 0.20634329055654677, 0.015091257541137042, 0.027502791769978958, 0.16663195714235454, 0.22666200015439905, 0.10787000980869352, 0.16544535262316154, -0.05045618897455632, -0.10001541765329118, -0.264091375779544, -0.08402244267971114, -0.17675306034189733, 0.002259883959072106, -0.1061774265939069, -0.1457753009999027, 0.3638463531070473, 0.19722982700190958, 0.20994600095560378, 0.07138433360986793, 0.34114467423800804, 0.09630987862946119, 0.08003931836278891, 0.11038225484398109, 0.1922188694280163, 0.04488628952866279, 0.09073179099394826, -0.2014629198057457, 0.12002068363345285, 0.03924590187097871] |
1,802.0964 | Modeling Others using Oneself in Multi-Agent Reinforcement Learning | We consider the multi-agent reinforcement learning setting with imperfect
information in which each agent is trying to maximize its own utility. The
reward function depends on the hidden state (or goal) of both agents, so the
agents must infer the other players' hidden goals from their observed behavior
in order to solve the tasks. We propose a new approach for learning in these
domains: Self Other-Modeling (SOM), in which an agent uses its own policy to
predict the other agent's actions and update its belief of their hidden state
in an online manner. We evaluate this approach on three different tasks and
show that the agents are able to learn better policies using their estimate of
the other players' hidden states, in both cooperative and adversarial settings.
| cs.AI cs.LG | we consider the multiagent reinforcement learning setting with imperfect information in which each agent is trying to maximize its own utility the reward function depends on the hidden state or goal of both agents so the agents must infer the other players hidden goals from their observed behavior in order to solve the tasks we propose a new approach for learning in these domains self othermodeling som in which an agent uses its own policy to predict the other agents actions and update its belief of their hidden state in an online manner we evaluate this approach on three different tasks and show that the agents are able to learn better policies using their estimate of the other players hidden states in both cooperative and adversarial settings | [['we', 'consider', 'the', 'multiagent', 'reinforcement', 'learning', 'setting', 'with', 'imperfect', 'information', 'in', 'which', 'each', 'agent', 'is', 'trying', 'to', 'maximize', 'its', 'own', 'utility', 'the', 'reward', 'function', 'depends', 'on', 'the', 'hidden', 'state', 'or', 'goal', 'of', 'both', 'agents', 'so', 'the', 'agents', 'must', 'infer', 'the', 'other', 'players', 'hidden', 'goals', 'from', 'their', 'observed', 'behavior', 'in', 'order', 'to', 'solve', 'the', 'tasks', 'we', 'propose', 'a', 'new', 'approach', 'for', 'learning', 'in', 'these', 'domains', 'self', 'othermodeling', 'som', 'in', 'which', 'an', 'agent', 'uses', 'its', 'own', 'policy', 'to', 'predict', 'the', 'other', 'agents', 'actions', 'and', 'update', 'its', 'belief', 'of', 'their', 'hidden', 'state', 'in', 'an', 'online', 'manner', 'we', 'evaluate', 'this', 'approach', 'on', 'three', 'different', 'tasks', 'and', 'show', 'that', 'the', 'agents', 'are', 'able', 'to', 'learn', 'better', 'policies', 'using', 'their', 'estimate', 'of', 'the', 'other', 'players', 'hidden', 'states', 'in', 'both', 'cooperative', 'and', 'adversarial', 'settings']] | [-0.061121678746689764, 0.041471286863689165, -0.09786375869058132, 0.06494843618323405, -0.16319248646438594, -0.18578021932718536, 0.10435677304982192, 0.4865176271174162, -0.3174529202016337, -0.3240739754918549, 0.05848790027962495, -0.28079781108831486, -0.17296399300805262, 0.06403514040848388, -0.13875382242073853, 0.05055758452259137, 0.01744855418043684, 0.15533697826322168, 0.02900070632948348, -0.32181811084534734, 0.335000816880474, 9.097479697730806e-05, 0.2790863915505479, -0.03614402620772284, 0.165740339551121, 0.029828583167511084, 0.012535273972187295, -0.03157312289205572, -0.07686421581728076, 0.15940222972846915, 0.33690597458986477, 0.2191333644653833, 0.3905070661493237, -0.4470947878139596, -0.17549138517665958, 0.13579243881117908, 0.09698024179531439, 0.09848116098585287, 0.025845366517185338, -0.3500090075420245, 0.05794233776858106, -0.1881999167066718, -0.032016280469381146, -0.11419851404230391, -0.08866033765176932, 0.023658653027341065, -0.290198031265939, -0.060764783209869784, 0.05496225896705356, 0.009290983918906441, -0.11564696489533942, -0.10695111572406152, -0.001502861568172063, 0.23966157816845687, 0.07319216963572664, 0.008309196583771458, 0.18976162467521454, -0.21780344328258902, -0.22149571788955538, 0.3588981228522099, -0.03209464820674694, -0.20999440751297194, 0.22200246197208467, -0.05051427683793008, -0.1382629977694402, 0.05015005378998698, 0.2675901755823621, 0.15741350325859255, -0.1649119007726392, 0.00895238261335411, -0.03700001706324872, 0.17979717070961165, -0.04035900536525462, 0.02392712598740463, 0.16834607777751184, 0.1700713038740177, 0.1272556026436625, 0.12064668849352674, -0.017371149888883036, -0.18403845108188097, -0.20652303247461243, -0.11440237879102665, -0.17966711846372438, -0.028224374346863774, -0.08940203832279954, -0.08325187539063221, 0.37489451012677616, 0.22042470313756476, 0.22332500770229788, 0.11585790141751724, 0.32426547403964734, 0.049942103096298755, 0.03892610719222354, 0.12027520884848422, 0.22356644367414807, 0.012276149570613005, 0.11308171645191217, -0.2368334006270512, 0.1793109988830688, -0.016909974575456645] |
1,802.09641 | Protocol-Dependence and State Variables in the Force-Moment Ensemble | Stress-based ensembles incorporating temperature-like variables have been
proposed as a route to an equation of state for granular materials. To test the
efficacy of this approach, we perform experiments on a two-dimensional
photoelastic granular system under three loading conditions: uniaxial
compression, biaxial compression, and simple shear. From the interparticle
forces, we find that the distributions of the normal component of the
coarse-grained force-moment tensor are exponential-tailed, while the deviatoric
component is Gaussian-distributed. This implies that the correct stress-based
statistical mechanics conserves both the force-moment tensor and the
Maxwell-Cremona force-tiling area. As such, two variables of state arise: the
tensorial angoricity ($\hat{\alpha}$) and a new temperature-like quantity
associated with the force-tile area which we name {\it keramicity} ($\kappa$).
Each quantity is observed to be inversely proportional to the global confining
pressure; however only $\kappa$ exhibits the protocol-independence expected of
a state variable, while $\hat{\alpha}$ behaves as a variable of process.
| cond-mat.soft cond-mat.stat-mech | stressbased ensembles incorporating temperaturelike variables have been proposed as a route to an equation of state for granular materials to test the efficacy of this approach we perform experiments on a twodimensional photoelastic granular system under three loading conditions uniaxial compression biaxial compression and simple shear from the interparticle forces we find that the distributions of the normal component of the coarsegrained forcemoment tensor are exponentialtailed while the deviatoric component is gaussiandistributed this implies that the correct stressbased statistical mechanics conserves both the forcemoment tensor and the maxwellcremona forcetiling area as such two variables of state arise the tensorial angoricity hatalpha and a new temperaturelike quantity associated with the forcetile area which we name it keramicity kappa each quantity is observed to be inversely proportional to the global confining pressure however only kappa exhibits the protocolindependence expected of a state variable while hatalpha behaves as a variable of process | [['stressbased', 'ensembles', 'incorporating', 'temperaturelike', 'variables', 'have', 'been', 'proposed', 'as', 'a', 'route', 'to', 'an', 'equation', 'of', 'state', 'for', 'granular', 'materials', 'to', 'test', 'the', 'efficacy', 'of', 'this', 'approach', 'we', 'perform', 'experiments', 'on', 'a', 'twodimensional', 'photoelastic', 'granular', 'system', 'under', 'three', 'loading', 'conditions', 'uniaxial', 'compression', 'biaxial', 'compression', 'and', 'simple', 'shear', 'from', 'the', 'interparticle', 'forces', 'we', 'find', 'that', 'the', 'distributions', 'of', 'the', 'normal', 'component', 'of', 'the', 'coarsegrained', 'forcemoment', 'tensor', 'are', 'exponentialtailed', 'while', 'the', 'deviatoric', 'component', 'is', 'gaussiandistributed', 'this', 'implies', 'that', 'the', 'correct', 'stressbased', 'statistical', 'mechanics', 'conserves', 'both', 'the', 'forcemoment', 'tensor', 'and', 'the', 'maxwellcremona', 'forcetiling', 'area', 'as', 'such', 'two', 'variables', 'of', 'state', 'arise', 'the', 'tensorial', 'angoricity', 'hatalpha', 'and', 'a', 'new', 'temperaturelike', 'quantity', 'associated', 'with', 'the', 'forcetile', 'area', 'which', 'we', 'name', 'it', 'keramicity', 'kappa', 'each', 'quantity', 'is', 'observed', 'to', 'be', 'inversely', 'proportional', 'to', 'the', 'global', 'confining', 'pressure', 'however', 'only', 'kappa', 'exhibits', 'the', 'protocolindependence', 'expected', 'of', 'a', 'state', 'variable', 'while', 'hatalpha', 'behaves', 'as', 'a', 'variable', 'of', 'process']] | [-0.14534943652307164, 0.18882785849363526, -0.1196146581313926, -0.0032866554860008584, -0.0598587200037557, -0.13386021728852185, 0.005303519492133938, 0.33842887162905316, -0.28835633383614234, -0.2488469378990603, 0.07080161448503877, -0.27517509944094665, -0.14018487645120456, 0.1472256258258532, -0.0129217103637498, 0.08509150036321632, 0.008253921783762053, 0.04534183501522859, -0.052386561349227, -0.1948769930990991, 0.2805899669191447, 0.05121164533614727, 0.33396528269453296, 0.01753580763992243, 0.15317426709265544, -0.015397826395928859, 0.029669652041047812, 0.07557246684706931, -0.13391492727808735, 0.04580593220086704, 0.17198152194313449, 0.0626632235767641, 0.23152993465211757, -0.37366857234195905, -0.25027183815836906, 0.08533127260041135, 0.08200349608307768, 0.06961234273501382, 0.008311953385167851, -0.2258251297512445, 0.03715689570225518, -0.1805576094554673, -0.12233497509411696, -0.1158824750575526, 0.03144394974705988, 0.02075541940646182, -0.2980826008422621, 0.16609510522624799, 0.06915624550351038, 0.029755475166542776, -0.09163569318901361, -0.12611976162096936, -0.026247331342692005, 0.09280239693772305, 0.09711505571552874, 0.04956473154176412, 0.20274069075019036, -0.16401926985909712, -0.03681946349298132, 0.41202579261413935, -0.0527793410892502, -0.22659378231599414, 0.16690718237760252, -0.08631484724324325, -0.12357841923447518, 0.1059760391391043, 0.15458592852127964, 0.09156239575642193, -0.1505462913613381, 0.037648796224725785, -0.046870117316600575, 0.18740636052499557, 0.04146259362520329, 5.685531630598266e-06, 0.18241861384233524, 0.15326757736118704, 0.055278857773298336, 0.18424812669640986, -0.10744482675358524, -0.09528097795836371, -0.3066729178587938, -0.18805246032967135, -0.21924392191115125, 0.04792032012851921, -0.12330149043449763, -0.18975720889946637, 0.3433037465502476, 0.12394336541343866, 0.19152535249896604, 0.0328265337104877, 0.2595756217066584, 0.0964110384895948, 0.06976329334529824, 0.053218959612322266, 0.2500097955866107, 0.15097257963799196, 0.07743710110863221, -0.22376797360303843, 0.08968877668396152, 0.023691817352162865] |
1,802.09642 | Selecting optimal subgroups for treatment using many covariates | We consider the problem of selecting the optimal subgroup to treat when data
on covariates is available from a randomized trial or observational study. We
distinguish between four different settings including (i) treatment selection
when resources are constrained, (ii) treatment selection when resources are not
constrained, (iii) treatment selection in the presence of side effects and
costs, and (iv) treatment selection to maximize effect heterogeneity. We show
that, in each of these cases, the optimal treatment selection rule involves
treating those for whom the predicted mean difference in outcomes comparing
those with versus without treatment, conditional on covariates, exceeds a
certain threshold. The threshold varies across these four scenarios but the
form of the optimal treatment selection rule does not. The results suggest a
move away from traditional subgroup analysis for personalized medicine. New
randomized trial designs are proposed so as to implement and make use of
optimal treatment selection rules in health care practice.
| stat.ME | we consider the problem of selecting the optimal subgroup to treat when data on covariates is available from a randomized trial or observational study we distinguish between four different settings including i treatment selection when resources are constrained ii treatment selection when resources are not constrained iii treatment selection in the presence of side effects and costs and iv treatment selection to maximize effect heterogeneity we show that in each of these cases the optimal treatment selection rule involves treating those for whom the predicted mean difference in outcomes comparing those with versus without treatment conditional on covariates exceeds a certain threshold the threshold varies across these four scenarios but the form of the optimal treatment selection rule does not the results suggest a move away from traditional subgroup analysis for personalized medicine new randomized trial designs are proposed so as to implement and make use of optimal treatment selection rules in health care practice | [['we', 'consider', 'the', 'problem', 'of', 'selecting', 'the', 'optimal', 'subgroup', 'to', 'treat', 'when', 'data', 'on', 'covariates', 'is', 'available', 'from', 'a', 'randomized', 'trial', 'or', 'observational', 'study', 'we', 'distinguish', 'between', 'four', 'different', 'settings', 'including', 'i', 'treatment', 'selection', 'when', 'resources', 'are', 'constrained', 'ii', 'treatment', 'selection', 'when', 'resources', 'are', 'not', 'constrained', 'iii', 'treatment', 'selection', 'in', 'the', 'presence', 'of', 'side', 'effects', 'and', 'costs', 'and', 'iv', 'treatment', 'selection', 'to', 'maximize', 'effect', 'heterogeneity', 'we', 'show', 'that', 'in', 'each', 'of', 'these', 'cases', 'the', 'optimal', 'treatment', 'selection', 'rule', 'involves', 'treating', 'those', 'for', 'whom', 'the', 'predicted', 'mean', 'difference', 'in', 'outcomes', 'comparing', 'those', 'with', 'versus', 'without', 'treatment', 'conditional', 'on', 'covariates', 'exceeds', 'a', 'certain', 'threshold', 'the', 'threshold', 'varies', 'across', 'these', 'four', 'scenarios', 'but', 'the', 'form', 'of', 'the', 'optimal', 'treatment', 'selection', 'rule', 'does', 'not', 'the', 'results', 'suggest', 'a', 'move', 'away', 'from', 'traditional', 'subgroup', 'analysis', 'for', 'personalized', 'medicine', 'new', 'randomized', 'trial', 'designs', 'are', 'proposed', 'so', 'as', 'to', 'implement', 'and', 'make', 'use', 'of', 'optimal', 'treatment', 'selection', 'rules', 'in', 'health', 'care', 'practice']] | [-0.05395645186034662, 0.060529219704650104, -0.02789238668797958, 0.11207473537989802, -0.13016807710932146, -0.22462885034000202, 0.16759985223742982, 0.42534184604883196, -0.21840615305268476, -0.30859073283931904, 0.1207002299837768, -0.2637624734712224, -0.11798908661660408, 0.18339461680471658, -0.11132107883571617, -0.010758037573748058, 0.07509528290810845, 0.014120131839186914, -0.04573327727210257, -0.2708793922515226, 0.2922477132460523, 0.029403070874151685, 0.35696403621883704, -0.020936485509868832, 0.029602428419785873, 0.09540789697259183, -0.10138169762588316, 0.06341426756406426, -0.10926226452617313, 0.03951019087370725, 0.29827603235570416, 0.19330203768406665, 0.4028766588698472, -0.39572617899506324, -0.21581797732581054, 0.12806894908088348, 0.10159171213125509, 0.14570873409149146, -0.0005469061299076965, -0.2024983358659571, 0.02343908295358321, -0.15459790978742194, -0.08881017639632187, -0.06486966798453772, -0.0447160191293205, 0.015683460468426346, -0.35988869692889913, 0.08611573550790068, -0.02656562905157766, 0.0629349274741065, -0.0860894275964388, -0.19829994778208915, 0.007310500834137201, 0.15328547018110722, 0.0768600421274201, -0.025545946014444192, 0.168563840478178, -0.1603714323842958, -0.1359783884964042, 0.38756466402161505, 0.03572928644416313, -0.2358965735525764, 0.16758952129842533, -0.12243768136287408, -0.1482599920210158, 0.08582345405293088, 0.20625284636813787, 0.11311705956055272, -0.16530830580431352, -0.015428753566342376, 0.0014307218438555157, 0.12138338353815338, 0.025968224957825674, 0.01812993847885199, 0.14116684796604057, 0.13499949220117302, 0.06323460514972647, 0.10414695349041253, -0.07539288774132728, -0.1103236228528042, -0.3235250240552329, -0.0860948066317266, -0.1103640252769354, 0.022869941847015834, -0.06878795217273892, -0.15894017912914052, 0.3305428377127335, 0.17413043306179105, 0.1482756142810573, 0.06289217986838681, 0.2771909969077716, 0.07888489829060892, 0.06392367360512576, 0.0593481870818763, 0.19982624732919277, 0.03265252054421111, -0.010191775696171869, -0.25922454257961364, 0.15451056720208256, 0.005691664843752439] |
1,802.09643 | Derived stacks in symplectic geometry | This is a survey paper on derived symplectic geometry, that will appear as a
chapter contribution to the book "New Spaces for Mathematics and Physics",
edited by Mathieu Anel and Gabriel Catren.
Our goal is to explain how derived stacks can be useful for ordinary
symplectic geometry, with an emphasis on examples coming from classical
topological field theories. More precisely, we use classical Chern-Simons
theory and moduli spaces of flat $G$-bundles and $G$-local systems as leading
examples in our journey.
We start in the introduction by reviewing various point-of-views on classical
Chern--Simons theory and moduli of flat connections. In the main body of the
Chapter we try to convince the reader how derived symplectic geometry (after
Pantev-To\"en-Vaqui\'e-Vezzosi somehow reconciles all these different
point-of-views.
| math.SG math-ph math.HO math.MP | this is a survey paper on derived symplectic geometry that will appear as a chapter contribution to the book new spaces for mathematics and physics edited by mathieu anel and gabriel catren our goal is to explain how derived stacks can be useful for ordinary symplectic geometry with an emphasis on examples coming from classical topological field theories more precisely we use classical chernsimons theory and moduli spaces of flat gbundles and glocal systems as leading examples in our journey we start in the introduction by reviewing various pointofviews on classical chernsimons theory and moduli of flat connections in the main body of the chapter we try to convince the reader how derived symplectic geometry after pantevtoenvaquievezzosi somehow reconciles all these different pointofviews | [['this', 'is', 'a', 'survey', 'paper', 'on', 'derived', 'symplectic', 'geometry', 'that', 'will', 'appear', 'as', 'a', 'chapter', 'contribution', 'to', 'the', 'book', 'new', 'spaces', 'for', 'mathematics', 'and', 'physics', 'edited', 'by', 'mathieu', 'anel', 'and', 'gabriel', 'catren', 'our', 'goal', 'is', 'to', 'explain', 'how', 'derived', 'stacks', 'can', 'be', 'useful', 'for', 'ordinary', 'symplectic', 'geometry', 'with', 'an', 'emphasis', 'on', 'examples', 'coming', 'from', 'classical', 'topological', 'field', 'theories', 'more', 'precisely', 'we', 'use', 'classical', 'chernsimons', 'theory', 'and', 'moduli', 'spaces', 'of', 'flat', 'gbundles', 'and', 'glocal', 'systems', 'as', 'leading', 'examples', 'in', 'our', 'journey', 'we', 'start', 'in', 'the', 'introduction', 'by', 'reviewing', 'various', 'pointofviews', 'on', 'classical', 'chernsimons', 'theory', 'and', 'moduli', 'of', 'flat', 'connections', 'in', 'the', 'main', 'body', 'of', 'the', 'chapter', 'we', 'try', 'to', 'convince', 'the', 'reader', 'how', 'derived', 'symplectic', 'geometry', 'after', 'pantevtoenvaquievezzosi', 'somehow', 'reconciles', 'all', 'these', 'different', 'pointofviews']] | [-0.08081207036768079, 0.09002039328033262, -0.11004889317334068, 0.11951908125919251, -0.14367178465385944, -0.1211091246117245, -0.019011815853055166, 0.31688525523097555, -0.2754737719785699, -0.2961516878817785, 0.10363623123685252, -0.2503856481014451, -0.25100933506022677, 0.20859553124601685, -0.19487364551683595, -0.04493592100695145, 0.009967280272779263, 0.012801873674693187, -0.09130280275351929, -0.3135386038540809, 0.4250264092894995, 0.027823588649226613, 0.22750889171638394, 0.0163738871654587, 0.052078615747654836, 0.01661798476303104, -0.07064400725297568, 0.029178282935826555, -0.17373999765688555, 0.17891452491883775, 0.3134449231476823, 0.08711559912728623, 0.17707410422423162, -0.4717475953242503, -0.18360001538410659, 0.04774271946569735, 0.11879869720086547, 0.10002257976169152, -0.011475248648693655, -0.30580388763072813, 0.055712061356907046, -0.17113758213741104, -0.16286568447884003, -0.0809741778191456, 0.02603646046539753, -0.009164947446835927, -0.09106073350826478, -0.02722231979666601, 0.07814834959957025, 0.08520387949745271, -0.045425234606137406, -0.11030145572144384, -0.019340358186736396, 0.11642909147930601, 0.044188297699082425, 0.060353583032323035, 0.10159561717651847, -0.12874173806895586, -0.13843898718391567, 0.3858963423524021, -0.06340316916966988, -0.19996830113693947, 0.17875669151929416, -0.08711977588967228, -0.1659223203304847, 0.07149598440482505, 0.14757779069737462, 0.11662850146564802, -0.08177958925693365, 0.15502923419689452, -0.02228553240256738, 0.09473913208935564, 0.08070022777812016, 0.0050248224557616, 0.2177043433478179, 0.10462933132032409, 0.030872488756133014, 0.10744925494948479, 0.015368123661942226, -0.15020757766482842, -0.3709245743153016, -0.1683653818428024, -0.10933127856239953, 0.13721351697463696, -0.043209587549381846, -0.11348544592268703, 0.37463291999229714, 0.1435073379062555, 0.16453756590774052, 0.07096187431703914, 0.24461216145687667, 0.025731045567557554, -0.01757790831212062, 0.005224273389990418, 0.20909679093694483, 0.2048413051823385, 0.1040807994475111, -0.08747078030570295, -0.07498895970783158, 0.14798665946457257] |
1,802.09644 | Finite-temperature phase structure of SU(4) gauge theory with multiple
fermion representations | We investigate the phase structure of SU(4) gauge theory with the gauge field
simultaneously coupled to two flavors of fermion in the fundamental
representation and two flavors of fermion in the two-index antisymmetric
representation. We find that the theory has only two phases, a low-temperature
phase with both species of fermion confined and chirally broken, and a
high-temperature phase with both species of fermion deconfined and chirally
restored. The single phase transition in the theory appears to be first order,
in agreement with theoretical predictions.
| hep-lat hep-ph | we investigate the phase structure of su4 gauge theory with the gauge field simultaneously coupled to two flavors of fermion in the fundamental representation and two flavors of fermion in the twoindex antisymmetric representation we find that the theory has only two phases a lowtemperature phase with both species of fermion confined and chirally broken and a hightemperature phase with both species of fermion deconfined and chirally restored the single phase transition in the theory appears to be first order in agreement with theoretical predictions | [['we', 'investigate', 'the', 'phase', 'structure', 'of', 'su4', 'gauge', 'theory', 'with', 'the', 'gauge', 'field', 'simultaneously', 'coupled', 'to', 'two', 'flavors', 'of', 'fermion', 'in', 'the', 'fundamental', 'representation', 'and', 'two', 'flavors', 'of', 'fermion', 'in', 'the', 'twoindex', 'antisymmetric', 'representation', 'we', 'find', 'that', 'the', 'theory', 'has', 'only', 'two', 'phases', 'a', 'lowtemperature', 'phase', 'with', 'both', 'species', 'of', 'fermion', 'confined', 'and', 'chirally', 'broken', 'and', 'a', 'hightemperature', 'phase', 'with', 'both', 'species', 'of', 'fermion', 'deconfined', 'and', 'chirally', 'restored', 'the', 'single', 'phase', 'transition', 'in', 'the', 'theory', 'appears', 'to', 'be', 'first', 'order', 'in', 'agreement', 'with', 'theoretical', 'predictions']] | [-0.1555458150420557, 0.3369011047679712, -0.10313149900449549, 0.015502059393945862, 0.0005589428576914704, -0.16409662045976695, 0.05883509180481162, 0.3868264300748706, -0.14420676325612208, -0.2673317219842883, 0.018053222924251766, -0.2932800565791481, -0.1377091847195783, -0.01581476199276307, 0.05818794467212523, 0.014431797877392348, -0.04524373942438294, 0.07271252968622481, -0.152355229709407, -0.22162202973302234, 0.32785495610578974, -0.10104917877298944, 0.29971652022179435, 0.07718050725319807, 0.041947218957904944, -0.029232418761752983, 0.04911751586067326, -0.042842599114074426, -0.052116961714637, 0.042289168234257137, 0.23187741152942182, -0.03951257824459497, 0.08829818773631226, -0.42960705603746807, -0.23591827162924936, 0.08724151952466105, 0.15390068904003676, 0.12537743789965616, -0.09270091946510707, -0.31675198779523595, 0.016999691275551038, -0.1705570004442159, -0.15844679823528757, -0.11583614256181617, -0.1134296863928766, -0.13051575992037268, -0.2821519052150988, 0.09613111787749563, -0.03827400004272075, 0.05358624993275632, -0.04170797037727693, -0.11109944221508854, -0.06497697288937429, 0.09587375105303876, 0.12511257808655502, 0.07979154651984573, 0.026733127006274813, -0.24140870783491716, -0.13059433588538977, 0.46776607184506513, -0.11168768170755357, -0.13828848589430837, 0.22457939065335428, -0.19043414005205062, -0.16432137894718085, 0.1255268679712625, 0.09351220271166633, 0.0867618787841981, -0.12461884518167661, 0.1273628861122929, -0.06394744173568838, 0.19125951454591225, 0.01709199261796825, 0.02229211105723687, 0.29641113409443814, 0.1502555545857724, -0.010559268339591869, 0.12330155931002296, -0.014401187238228672, -0.2105407556573696, -0.3033955196028247, -0.14492713532629697, -0.16127387103350724, -0.021136822463834987, -0.11756945091833854, -0.17014362992828383, 0.45241875817232274, 0.14164867212119348, 0.16685951472643543, -0.020242280841750258, 0.2367099028902457, 0.10208000180256717, 0.03859783424174085, 0.013744214083999395, 0.2234593361177865, 0.23295418567106346, 0.07814394601565951, -0.30248743886785473, -0.12554131982957614, 0.12123182390761726] |
1,802.09645 | The second moment of the Siegel transform in the space of symplectic
lattices | Using results from spectral theory of Eisenstein series, we prove a formula
for the second moment of the Siegel transform when averaged over the subspace
of symplectic lattices. This generalizes the classical formula of Rogers for
the second moment in the full space of unimodular lattices. Using this new
formula we give very strong bounds for the discrepancy of the number of lattice
points in an Borel set, which hold for generic symplectic lattices.
| math.NT | using results from spectral theory of eisenstein series we prove a formula for the second moment of the siegel transform when averaged over the subspace of symplectic lattices this generalizes the classical formula of rogers for the second moment in the full space of unimodular lattices using this new formula we give very strong bounds for the discrepancy of the number of lattice points in an borel set which hold for generic symplectic lattices | [['using', 'results', 'from', 'spectral', 'theory', 'of', 'eisenstein', 'series', 'we', 'prove', 'a', 'formula', 'for', 'the', 'second', 'moment', 'of', 'the', 'siegel', 'transform', 'when', 'averaged', 'over', 'the', 'subspace', 'of', 'symplectic', 'lattices', 'this', 'generalizes', 'the', 'classical', 'formula', 'of', 'rogers', 'for', 'the', 'second', 'moment', 'in', 'the', 'full', 'space', 'of', 'unimodular', 'lattices', 'using', 'this', 'new', 'formula', 'we', 'give', 'very', 'strong', 'bounds', 'for', 'the', 'discrepancy', 'of', 'the', 'number', 'of', 'lattice', 'points', 'in', 'an', 'borel', 'set', 'which', 'hold', 'for', 'generic', 'symplectic', 'lattices']] | [-0.13961258631614917, 0.05818076998273043, -0.10874018032808562, 0.08334662295512955, -0.06499182279347568, -0.06801711289035911, 0.06617162878801292, 0.29014942836570173, -0.2880253238238495, -0.2061208802829119, 0.07366442731801874, -0.21661675681133527, -0.14813070471171993, 0.2665602576893729, -0.08146796683856361, 0.0517640762814522, 0.04184340339191761, 0.06428714492987539, -0.13847066756539247, -0.3318396991313863, 0.3860919053754392, 0.0007108746134248135, 0.2317377058789134, 0.055695483914098225, 0.09867906653498476, 0.0463458603701076, -0.0028862951927491136, -0.050558275672547344, -0.15057856672619646, 0.19665815346446391, 0.21539901377557702, 0.056715350387290725, 0.19181183813064284, -0.397126126128274, -0.15407925187861798, 0.1406666603241418, 0.08913800648312915, 0.09028371816620583, -5.855433001006777e-05, -0.2732987206278218, 0.08128702335965794, -0.15283163762147967, -0.1696650393848383, -0.132766181514976, 0.034441081687455646, 0.04203008583469971, -0.2935832914569088, 0.058020763917247184, 0.1457014182437765, 0.1516190113852153, -0.07849485540410152, -0.14206374622881413, 0.056792778142325175, 0.09126384375574433, 0.018408473329366865, 0.027351194199778744, -0.02703884108671667, -0.07724386042713918, -0.11974820488044438, 0.3949464324459031, -0.11048475898978477, -0.1971583831048495, 0.059350987365374946, -0.2238750908322431, -0.19768765409527397, 0.12462941503051568, 0.12232121146862975, 0.1404208883177489, -0.059075183069335006, 0.18266138754080277, -0.14375892559670517, 0.07091840088518488, 0.11796577369190149, 0.009372112794300995, 0.1455560334127497, 0.06730922718998045, 0.11928450474767266, 0.18258538613775493, -0.05746387252332391, -0.09654909379330363, -0.345071444313067, -0.19146879286681479, -0.25253979413694627, 0.08858405650165435, -0.15565387937995429, -0.2157111304444009, 0.3744141154268102, 0.08922285729676259, 0.19234383340950148, 0.16069600388967759, 0.20847306687485528, 0.1570255101795664, 0.05599798898942567, 0.03696358154490087, 0.1431510451098753, 0.20130937857351996, 0.004520729402822719, -0.1727131973752261, -0.07628329368182332, 0.2278268983197474] |
1,802.09646 | Optimizing over a Restricted Policy Class in Markov Decision Processes | We address the problem of finding an optimal policy in a Markov decision
process under a restricted policy class defined by the convex hull of a set of
base policies. This problem is of great interest in applications in which a
number of reasonably good (or safe) policies are already known and we are only
interested in optimizing in their convex hull. We show that this problem is
NP-hard to solve exactly as well as to approximate to arbitrary accuracy.
However, under a condition that is akin to the occupancy measures of the base
policies having large overlap, we show that there exists an efficient algorithm
that finds a policy that is almost as good as the best convex combination of
the base policies. The running time of the proposed algorithm is linear in the
number of states and polynomial in the number of base policies. In practice, we
demonstrate an efficient implementation for large state problems. Compared to
traditional policy gradient methods, the proposed approach has the advantage
that, apart from the computation of occupancy measures of some base policies,
the iterative method need not interact with the environment during the
optimization process. This is especially important in complex systems where
estimating the value of a policy can be a time consuming process.
| cs.LG stat.ML | we address the problem of finding an optimal policy in a markov decision process under a restricted policy class defined by the convex hull of a set of base policies this problem is of great interest in applications in which a number of reasonably good or safe policies are already known and we are only interested in optimizing in their convex hull we show that this problem is nphard to solve exactly as well as to approximate to arbitrary accuracy however under a condition that is akin to the occupancy measures of the base policies having large overlap we show that there exists an efficient algorithm that finds a policy that is almost as good as the best convex combination of the base policies the running time of the proposed algorithm is linear in the number of states and polynomial in the number of base policies in practice we demonstrate an efficient implementation for large state problems compared to traditional policy gradient methods the proposed approach has the advantage that apart from the computation of occupancy measures of some base policies the iterative method need not interact with the environment during the optimization process this is especially important in complex systems where estimating the value of a policy can be a time consuming process | [['we', 'address', 'the', 'problem', 'of', 'finding', 'an', 'optimal', 'policy', 'in', 'a', 'markov', 'decision', 'process', 'under', 'a', 'restricted', 'policy', 'class', 'defined', 'by', 'the', 'convex', 'hull', 'of', 'a', 'set', 'of', 'base', 'policies', 'this', 'problem', 'is', 'of', 'great', 'interest', 'in', 'applications', 'in', 'which', 'a', 'number', 'of', 'reasonably', 'good', 'or', 'safe', 'policies', 'are', 'already', 'known', 'and', 'we', 'are', 'only', 'interested', 'in', 'optimizing', 'in', 'their', 'convex', 'hull', 'we', 'show', 'that', 'this', 'problem', 'is', 'nphard', 'to', 'solve', 'exactly', 'as', 'well', 'as', 'to', 'approximate', 'to', 'arbitrary', 'accuracy', 'however', 'under', 'a', 'condition', 'that', 'is', 'akin', 'to', 'the', 'occupancy', 'measures', 'of', 'the', 'base', 'policies', 'having', 'large', 'overlap', 'we', 'show', 'that', 'there', 'exists', 'an', 'efficient', 'algorithm', 'that', 'finds', 'a', 'policy', 'that', 'is', 'almost', 'as', 'good', 'as', 'the', 'best', 'convex', 'combination', 'of', 'the', 'base', 'policies', 'the', 'running', 'time', 'of', 'the', 'proposed', 'algorithm', 'is', 'linear', 'in', 'the', 'number', 'of', 'states', 'and', 'polynomial', 'in', 'the', 'number', 'of', 'base', 'policies', 'in', 'practice', 'we', 'demonstrate', 'an', 'efficient', 'implementation', 'for', 'large', 'state', 'problems', 'compared', 'to', 'traditional', 'policy', 'gradient', 'methods', 'the', 'proposed', 'approach', 'has', 'the', 'advantage', 'that', 'apart', 'from', 'the', 'computation', 'of', 'occupancy', 'measures', 'of', 'some', 'base', 'policies', 'the', 'iterative', 'method', 'need', 'not', 'interact', 'with', 'the', 'environment', 'during', 'the', 'optimization', 'process', 'this', 'is', 'especially', 'important', 'in', 'complex', 'systems', 'where', 'estimating', 'the', 'value', 'of', 'a', 'policy', 'can', 'be', 'a', 'time', 'consuming', 'process']] | [-0.12315409404696749, 0.03464554642319242, -0.06829374576440063, 0.06649667875082622, -0.07289791664992085, -0.1314992786724573, 0.10973363974627769, 0.4273424966034488, -0.296486528860144, -0.28864772739454614, 0.1400758864784561, -0.21727302858919323, -0.17330907469737195, 0.21495567707270907, -0.12368381025786969, 0.1008716013726439, 0.08092180838390628, 0.061746782473088284, -0.04084547677634406, -0.25748757971885883, 0.29669534687222654, 0.061736667543980425, 0.2839946794175656, 0.028022070014392348, 0.13104085972811155, -0.0002232771693232739, 0.038648196901891065, 0.06305427745715758, -0.052047962296651304, 0.1033646632978697, 0.33383099705189745, 0.21244422044907887, 0.356637448664302, -0.3903889531698339, -0.1741790415641088, 0.15346891126125153, 0.13077877619886927, 0.09665109412733762, -0.03217705253949041, -0.21682994948073386, 0.10481794699852433, -0.16143500096073252, -0.08565077578192512, -0.07291042361904597, -0.013155699594416351, 0.02417232889940997, -0.3378644077494636, 0.0022008236340969522, 0.03647723561860012, 0.014948366272968248, -0.06980793930973127, -0.111805603671906, 0.017377582080575212, 0.13887057947887055, 0.06433614338971196, 0.05480264989598262, 0.11209622027883394, -0.13199434869881355, -0.15787274070806523, 0.3895245181292156, -0.028782386898507026, -0.23506388533316447, 0.1688787051510266, -0.07985347191472407, -0.13673993917377927, 0.14442385984018932, 0.2038856515330132, 0.17719644174919785, -0.14561420732186497, 0.10615916892605459, -0.08536175677605043, 0.14216705239769595, 0.026905182522730293, 0.006011202936844082, 0.12791083417816532, 0.19068057975018066, 0.17032963849678112, 0.16154175775645685, -0.01225894829911119, -0.13252809244886946, -0.26450346995179896, -0.1405559748674473, -0.21734920536194033, -0.008563035195973533, -0.09521857963939671, -0.16490594908882317, 0.3574401688083101, 0.16449273767485065, 0.19480761710748024, 0.09855871033369537, 0.31489418528562796, 0.1258403550062756, 0.05281661171275713, 0.14502415598901075, 0.1837962463605011, 0.037069113991466986, 0.07666556160107132, -0.21056678978765436, 0.13197830555934423, 0.03973849961168577] |
1,802.09647 | Shaping Influence and Influencing Shaping: A Computational Red Teaming
Trust-based Swarm Intelligence Model | Sociotechnical systems are complex systems, where nonlinear interaction among
different players can obscure causal relationships. The absence of mechanisms
to help us understand how to create a change in the system makes it hard to
manage these systems.
Influencing and shaping are social operators acting on sociotechnical systems
to design a change. However, the two operators are usually discussed in an
ad-hoc manner, without proper guiding models and metrics which assist in
adopting these models successfully. Moreover, both social operators rely on
accurate understanding of the concept of trust. Without such understanding,
neither of these operators can create the required level to create a change in
a desirable direction.
In this paper, we define these concepts in a concise manner suitable for
modelling the concepts and understanding their dynamics. We then introduce a
model for influencing and shaping and use Computational Red Teaming principles
to design and demonstrate how this model operates. We validate the results
computationally through a simulation environment to show social influencing and
shaping in an artificial society.
| cs.AI cs.MA | sociotechnical systems are complex systems where nonlinear interaction among different players can obscure causal relationships the absence of mechanisms to help us understand how to create a change in the system makes it hard to manage these systems influencing and shaping are social operators acting on sociotechnical systems to design a change however the two operators are usually discussed in an adhoc manner without proper guiding models and metrics which assist in adopting these models successfully moreover both social operators rely on accurate understanding of the concept of trust without such understanding neither of these operators can create the required level to create a change in a desirable direction in this paper we define these concepts in a concise manner suitable for modelling the concepts and understanding their dynamics we then introduce a model for influencing and shaping and use computational red teaming principles to design and demonstrate how this model operates we validate the results computationally through a simulation environment to show social influencing and shaping in an artificial society | [['sociotechnical', 'systems', 'are', 'complex', 'systems', 'where', 'nonlinear', 'interaction', 'among', 'different', 'players', 'can', 'obscure', 'causal', 'relationships', 'the', 'absence', 'of', 'mechanisms', 'to', 'help', 'us', 'understand', 'how', 'to', 'create', 'a', 'change', 'in', 'the', 'system', 'makes', 'it', 'hard', 'to', 'manage', 'these', 'systems', 'influencing', 'and', 'shaping', 'are', 'social', 'operators', 'acting', 'on', 'sociotechnical', 'systems', 'to', 'design', 'a', 'change', 'however', 'the', 'two', 'operators', 'are', 'usually', 'discussed', 'in', 'an', 'adhoc', 'manner', 'without', 'proper', 'guiding', 'models', 'and', 'metrics', 'which', 'assist', 'in', 'adopting', 'these', 'models', 'successfully', 'moreover', 'both', 'social', 'operators', 'rely', 'on', 'accurate', 'understanding', 'of', 'the', 'concept', 'of', 'trust', 'without', 'such', 'understanding', 'neither', 'of', 'these', 'operators', 'can', 'create', 'the', 'required', 'level', 'to', 'create', 'a', 'change', 'in', 'a', 'desirable', 'direction', 'in', 'this', 'paper', 'we', 'define', 'these', 'concepts', 'in', 'a', 'concise', 'manner', 'suitable', 'for', 'modelling', 'the', 'concepts', 'and', 'understanding', 'their', 'dynamics', 'we', 'then', 'introduce', 'a', 'model', 'for', 'influencing', 'and', 'shaping', 'and', 'use', 'computational', 'red', 'teaming', 'principles', 'to', 'design', 'and', 'demonstrate', 'how', 'this', 'model', 'operates', 'we', 'validate', 'the', 'results', 'computationally', 'through', 'a', 'simulation', 'environment', 'to', 'show', 'social', 'influencing', 'and', 'shaping', 'in', 'an', 'artificial', 'society']] | [-0.10212465270003032, 0.07586742303084326, -0.08306481753889886, 0.10052860603117716, -0.13384148639991705, -0.12599473854265453, 0.05232163172620975, 0.4321662395408279, -0.2698400872841216, -0.3391671121931956, 0.0742009781952539, -0.23661203912530115, -0.2583336292368452, 0.18894529653364542, -0.08771517861100753, 0.015670581298678765, 0.0470095443837508, 0.0012841988341305514, -0.025011775597156574, -0.1990789210666189, 0.34568279758041276, 0.058815174022613215, 0.2953513650419681, 0.058341230627977185, 0.07618563443732758, 0.007695596960607415, -0.06889119724183458, -0.005668603472019497, -0.07649040094732337, 0.1741969574335418, 0.29728174888977693, 0.1577776162040948, 0.3350183875218295, -0.49157243520457145, -0.23680936504149952, 0.11220446552901545, 0.15618646521889196, 0.09594387063083963, -0.03155212065243102, -0.2728791972894592, 0.06498404417720716, -0.17537244931081233, -0.13174418426167808, -0.1466635452012929, -0.028186588075654637, 0.027069281575294507, -0.2560461536104306, -0.022362991557483784, 0.060916594659898717, 0.07250195573225661, -0.06659353346351468, -0.04242747394049442, -0.004331187388658175, 0.2161124796301606, -0.023577635727920813, -0.03341337351849417, 0.16366679398942063, -0.1486448961788685, -0.14273291858109205, 0.41524714200991636, 0.004686424862021548, -0.2442452286176754, 0.24198417832573865, -0.07042188019551641, -0.14238603658462215, 0.021263051952360668, 0.2715037417167809, 0.0889925771823142, -0.19951836871245687, 0.0010947968639918107, 0.033399092357562124, 0.17527533776388227, 0.01377464362490944, 0.06309579532833128, 0.2173082257092696, 0.18209870619568647, 0.04766842612876878, 0.08961510373012582, 0.025184316788010343, -0.1425534959294294, -0.2332819401346452, -0.14011458827144185, -0.08962097323270873, 0.016874354084451922, -0.06783631470060175, -0.1486689848008386, 0.38024090660725074, 0.24075976664973806, 0.183408561399566, 0.0013229994679261978, 0.30170825889404884, 0.07175478676323131, 0.07618458222527034, 0.06051803436892771, 0.22550565244531945, 0.059084908933275275, 0.1276459295979336, -0.1992488915334886, 0.12999017783222797, 0.009048460570861155] |
1,802.09648 | Square function estimates, BMO Dirichlet problem, and absolute
continuity of harmonic measure on lower-dimensional sets | In the recent work [DFM1, DFM2] G. David, J. Feneuil, and the first author
have launched a program devoted to an analogue of harmonic measure for
lower-dimensional sets. A relevant class of partial differential equations,
analogous to the class of elliptic PDEs in the classical context, is given by
linear degenerate equations with the degeneracy suitably depending on the
distance to the boundary.
The present paper continues this line of research and focuses on the criteria
of quantitative absolute continuity of the newly defined harmonic measure with
respect to the Hausdorff measure, $\omega\in A_\infty(\sigma)$, in terms of
solvability of boundary value problems. The authors establish, in particular,
square function estimates and solvability of the Dirichlet problem in BMO for
domains with lower-dimensional boundaries under the underlying assumption
$\omega\in A_\infty(\sigma)$. More generally, it is proved that in all domains
with Ahlfors regular boundaries the BMO solvability of the Dirichlet problem is
necessary and sufficient for the absolute continuity of the harmonic measure.
| math.AP | in the recent work dfm1 dfm2 g david j feneuil and the first author have launched a program devoted to an analogue of harmonic measure for lowerdimensional sets a relevant class of partial differential equations analogous to the class of elliptic pdes in the classical context is given by linear degenerate equations with the degeneracy suitably depending on the distance to the boundary the present paper continues this line of research and focuses on the criteria of quantitative absolute continuity of the newly defined harmonic measure with respect to the hausdorff measure omegain a_inftysigma in terms of solvability of boundary value problems the authors establish in particular square function estimates and solvability of the dirichlet problem in bmo for domains with lowerdimensional boundaries under the underlying assumption omegain a_inftysigma more generally it is proved that in all domains with ahlfors regular boundaries the bmo solvability of the dirichlet problem is necessary and sufficient for the absolute continuity of the harmonic measure | [['in', 'the', 'recent', 'work', 'dfm1', 'dfm2', 'g', 'david', 'j', 'feneuil', 'and', 'the', 'first', 'author', 'have', 'launched', 'a', 'program', 'devoted', 'to', 'an', 'analogue', 'of', 'harmonic', 'measure', 'for', 'lowerdimensional', 'sets', 'a', 'relevant', 'class', 'of', 'partial', 'differential', 'equations', 'analogous', 'to', 'the', 'class', 'of', 'elliptic', 'pdes', 'in', 'the', 'classical', 'context', 'is', 'given', 'by', 'linear', 'degenerate', 'equations', 'with', 'the', 'degeneracy', 'suitably', 'depending', 'on', 'the', 'distance', 'to', 'the', 'boundary', 'the', 'present', 'paper', 'continues', 'this', 'line', 'of', 'research', 'and', 'focuses', 'on', 'the', 'criteria', 'of', 'quantitative', 'absolute', 'continuity', 'of', 'the', 'newly', 'defined', 'harmonic', 'measure', 'with', 'respect', 'to', 'the', 'hausdorff', 'measure', 'omegain', 'a_inftysigma', 'in', 'terms', 'of', 'solvability', 'of', 'boundary', 'value', 'problems', 'the', 'authors', 'establish', 'in', 'particular', 'square', 'function', 'estimates', 'and', 'solvability', 'of', 'the', 'dirichlet', 'problem', 'in', 'bmo', 'for', 'domains', 'with', 'lowerdimensional', 'boundaries', 'under', 'the', 'underlying', 'assumption', 'omegain', 'a_inftysigma', 'more', 'generally', 'it', 'is', 'proved', 'that', 'in', 'all', 'domains', 'with', 'ahlfors', 'regular', 'boundaries', 'the', 'bmo', 'solvability', 'of', 'the', 'dirichlet', 'problem', 'is', 'necessary', 'and', 'sufficient', 'for', 'the', 'absolute', 'continuity', 'of', 'the', 'harmonic', 'measure']] | [-0.12873598626929725, 0.04339989470224017, -0.06331013322843215, 0.05223341834513306, -0.11785395146064649, -0.0837684172747916, -0.010686470631103303, 0.31483753081529015, -0.3005350299409437, -0.23191422619746374, 0.1569216360737381, -0.2734759076840327, -0.10160590608344897, 0.19916146110648972, -0.12430427004170569, 0.12085487612204839, 0.05577175834369433, 0.0701777528473353, -0.09202874233412757, -0.27043277051158343, 0.4291212753734634, -0.025517957261468792, 0.257630762148426, 0.060091456453996724, 0.07848676214365972, -0.01237531966246853, -0.04771827077758321, 0.0015957140941408616, -0.2162477479457116, 0.16863448106642528, 0.2446035529262846, 0.05381546152351849, 0.31576665084148886, -0.3657036619025129, -0.17748457155650174, 0.14939099027409772, 0.06887087262864815, 0.002989710811112972, 0.011254037906768691, -0.3203464086120359, 0.07709981810266175, -0.06451719430941334, -0.1847582823137128, -0.026594575652204265, 0.06507931628464898, 0.05077181114149103, -0.28801072034041714, 0.10035184890479792, 0.10825356212739326, 0.09086466413963869, -0.1412312289142887, -0.09470204238579431, -0.015665522646866267, 0.07901598778376474, 0.03358490719265434, 0.059961817113835886, 0.011488649431215246, -0.08749333449456652, -0.08044039772799876, 0.3590825958342492, -0.07904242020972733, -0.27309723918715234, 0.15343313220640808, -0.18479747584390255, -0.12724308396506867, 0.07498137820718362, 0.14397235590186488, 0.16059307766418102, -0.14958292756913394, 0.16437358709193672, -0.07672309556451355, 0.11249276693568483, 0.10908341123074104, 0.009536752273929836, 0.1112476846150158, 0.1197544086306014, 0.18898625031579286, 0.17127058691863867, 0.0008257724627663818, -0.08450155131978608, -0.3448342491955131, -0.16522923493802052, -0.17489991199794003, 0.054840694181621075, -0.06304059006606046, -0.19410770602783636, 0.3700596899298149, 0.10061709179736002, 0.1637715057505271, 0.0659266764451337, 0.19299977661782428, 0.16137294664122812, 0.009366833919281092, 0.04638193576092702, 0.18957327681157407, 0.20329784463112585, 0.11161124467543221, -0.17857237309630064, 0.04264079894696633, 0.17755452075183298] |
1,802.09649 | Topological waves in fluids with odd viscosity | Fluids in which both time-reversal and parity are broken can display a
dissipationless viscosity that is odd under each of these symmetries. Here, we
show how this odd viscosity has a dramatic effect on topological sound waves in
fluids, including the number and spatial profile of topological edge modes. Odd
viscosity provides a short-distance cutoff that allows us to define a bulk
topological invariant on a compact momentum space. As the sign of odd viscosity
changes, a topological phase transition occurs without closing the bulk gap.
Instead, at the transition point, the topological invariant becomes ill-defined
because momentum space cannot be compactified. This mechanism is unique to
continuum models and can describe fluids ranging from electronic to chiral
active systems.
| cond-mat.soft | fluids in which both timereversal and parity are broken can display a dissipationless viscosity that is odd under each of these symmetries here we show how this odd viscosity has a dramatic effect on topological sound waves in fluids including the number and spatial profile of topological edge modes odd viscosity provides a shortdistance cutoff that allows us to define a bulk topological invariant on a compact momentum space as the sign of odd viscosity changes a topological phase transition occurs without closing the bulk gap instead at the transition point the topological invariant becomes illdefined because momentum space cannot be compactified this mechanism is unique to continuum models and can describe fluids ranging from electronic to chiral active systems | [['fluids', 'in', 'which', 'both', 'timereversal', 'and', 'parity', 'are', 'broken', 'can', 'display', 'a', 'dissipationless', 'viscosity', 'that', 'is', 'odd', 'under', 'each', 'of', 'these', 'symmetries', 'here', 'we', 'show', 'how', 'this', 'odd', 'viscosity', 'has', 'a', 'dramatic', 'effect', 'on', 'topological', 'sound', 'waves', 'in', 'fluids', 'including', 'the', 'number', 'and', 'spatial', 'profile', 'of', 'topological', 'edge', 'modes', 'odd', 'viscosity', 'provides', 'a', 'shortdistance', 'cutoff', 'that', 'allows', 'us', 'to', 'define', 'a', 'bulk', 'topological', 'invariant', 'on', 'a', 'compact', 'momentum', 'space', 'as', 'the', 'sign', 'of', 'odd', 'viscosity', 'changes', 'a', 'topological', 'phase', 'transition', 'occurs', 'without', 'closing', 'the', 'bulk', 'gap', 'instead', 'at', 'the', 'transition', 'point', 'the', 'topological', 'invariant', 'becomes', 'illdefined', 'because', 'momentum', 'space', 'can', 'not', 'be', 'compactified', 'this', 'mechanism', 'is', 'unique', 'to', 'continuum', 'models', 'and', 'can', 'describe', 'fluids', 'ranging', 'from', 'electronic', 'to', 'chiral', 'active', 'systems']] | [-0.23526414458385922, 0.26679167725734626, -0.1561263151455301, 0.056110014623292716, -0.13517166810371906, -0.16710013382844935, 0.022577555759709853, 0.32355621052436406, -0.2732144043254589, -0.2865700134006906, 0.05439715516274364, -0.26713012390751256, -0.12868087012551663, 0.09114046214717972, -0.022010484322725624, 0.05447936136408301, -0.060385443772427924, -0.0034157609151414603, -0.12444060459378953, -0.1364333762408211, 0.3467964542171464, -0.030084127788278004, 0.2928476114372515, 0.09335862466255357, 0.05464492060440354, -0.034869165533060624, 0.045311555389530404, 0.0651058798712632, -0.13409965420355885, 0.015767053319567, 0.2579840114372958, -0.05034832521014623, 0.1636121058336282, -0.43252200707177485, -0.25328224028406804, 0.09558273890548316, 0.1442901704908726, 0.12881063600936674, -0.029143109480842703, -0.2467964125820243, 0.06761698523721049, -0.16310561616897337, -0.13360349977127284, -0.1466778304297015, 0.07444814775400788, -0.09487415720470065, -0.2229259764594757, 0.1120048544431213, 0.06713536838916215, 0.05520494814869786, -0.05829460562201032, -0.04978386308105031, -0.12403318402164977, 0.09146222454103187, 0.07215054140018284, 0.030325041029386778, 0.13618074095815666, -0.16138167634667935, -0.11867121316123107, 0.4204893472396638, -0.06405807977584614, -0.22162106523313369, 0.2373676415809915, -0.15735435633619954, -0.10903368872582667, 0.18069786124300857, 0.15711449830281002, 0.09141671064517591, -0.03738240611331522, 0.10373569109663752, -0.04787044565016327, 0.16931963099329347, 0.06556300167186756, 0.07577761986162052, 0.28571354374597385, 0.11837715411574141, 0.09237188171626122, 0.14726206611299286, -0.08327968148726293, -0.0673458221607095, -0.30081063508987427, -0.19034770717228616, -0.21153880718687534, 0.09986959244059648, -0.0766788777691545, -0.18463453221373444, 0.40781675149832874, 0.1225477819608078, 0.19120811532474746, 0.00021184101019608827, 0.24958012458360332, 0.12568997517555244, 0.06788302601646047, 0.07731443943940719, 0.23550627048489106, 0.10962941923298034, 0.10547940239689337, -0.25285498981079285, 0.02047407314997197, 0.08406401496411355] |
1,802.0965 | ABC Samplers | This Chapter, "ABC Samplers", is to appear in the forthcoming Handbook of
Approximate Bayesian Computation (2018). It details the main ideas and
algorithms used to sample from the ABC approximation to the posterior
distribution, including methods based on rejection/importance sampling, MCMC
and sequential Monte Carlo.
| stat.CO stat.ME stat.ML | this chapter abc samplers is to appear in the forthcoming handbook of approximate bayesian computation 2018 it details the main ideas and algorithms used to sample from the abc approximation to the posterior distribution including methods based on rejectionimportance sampling mcmc and sequential monte carlo | [['this', 'chapter', 'abc', 'samplers', 'is', 'to', 'appear', 'in', 'the', 'forthcoming', 'handbook', 'of', 'approximate', 'bayesian', 'computation', '2018', 'it', 'details', 'the', 'main', 'ideas', 'and', 'algorithms', 'used', 'to', 'sample', 'from', 'the', 'abc', 'approximation', 'to', 'the', 'posterior', 'distribution', 'including', 'methods', 'based', 'on', 'rejectionimportance', 'sampling', 'mcmc', 'and', 'sequential', 'monte', 'carlo']] | [0.028292231854390015, -0.014459990430623293, -0.1499644326130775, 0.15371921709315342, -0.07429506291042674, -0.08599945378294004, 0.09589815067804673, 0.42189229339022527, -0.31387367586351256, -0.40197247436100786, 0.1304368525187866, -0.22298274540596388, -0.1129639729518782, 0.20330367103981023, -0.07222715249769283, 0.1424395153298974, 0.142623150001534, -0.12872216461057012, -0.07621727789625186, -0.33125756329867395, 0.18683646234091034, 0.14250525836409492, 0.28344840196553955, -0.11232040681749243, 0.06213087920861488, 0.05542624270839786, -0.09662442730570381, -0.05166479564187201, -0.24660945463586936, 0.17813475178131324, 0.2722167807885192, 0.1861250955844298, 0.2934645565057343, -0.38273158015346614, -0.10014127056241375, 0.108725198864704, 0.20539066671732475, 0.1651423813944513, 0.008356920726576143, -0.28222539265301416, 0.033162663468498395, -0.14698695982488888, -0.047600322953340685, -0.1111244068227031, -0.08713654496453026, 0.05433592320322201, -0.2789316449991681, 0.058322233888743955, 0.02944615399676629, 0.052973235406997526, 0.10715991706291045, -0.2613456833430312, 0.03679773924787613, 0.008316263207234442, 0.057561816449213606, 0.04986670711712742, 0.10588289727456868, -0.07683319718555802, -0.21517432777380402, 0.3082757838446097, 0.01764229661785066, -0.17912514759650963, 0.1714074021596885, -0.05340683602050624, -0.24959044525696134, 0.11832421461374244, 0.2141932861625471, 0.1628801722968505, -0.15204112094149672, 0.13944186985397458, 0.08775007493783381, 0.10661983479407024, -0.06757420259104534, -0.1254758300598372, 0.11173599284269255, 0.1701274768195369, 0.03855574901469729, 0.08831384281670167, -0.1565545264853757, -0.2601508507928388, -0.2794498870524959, -0.17642320432192224, -0.27509148461236194, 3.025420433418317e-05, -0.06546077360756251, -0.24963035666389094, 0.35918015080758114, 0.3212377267720347, 0.1328020896127617, 0.059117952615699985, 0.3511027902026068, 0.08211256489581005, -0.005429625130173835, 0.10438334081448954, 0.15324616831177, 0.17464087588119914, 0.07612960359123959, -0.09603729025481945, 0.1049941522585207, 0.08957264418925413] |
1,802.09651 | Byzantine-Resilient Distributed Observers for LTI Systems | Consider a linear time-invariant (LTI) dynamical system monitored by a
network of sensors, modeled as nodes of an underlying directed communication
graph. We study the problem of collaboratively estimating the state of the
system when certain nodes are compromised by adversaries. Specifically, we
consider a Byzantine adversary model, where a compromised node possesses
complete knowledge of the system dynamics and the network, and can deviate
arbitrarily from the rules of any prescribed algorithm. We first characterize
certain fundamental limitations of any distributed state estimation algorithm
in terms of the measurement and communication structure of the nodes. We then
develop an attack-resilient, provably correct state estimation algorithm that
admits a fully distributed implementation. To characterize feasible network
topologies that guarantee success of our proposed technique, we introduce a
notion of `strong-robustness' that captures both measurement and communication
redundancy. Finally, by drawing connections to bootstrap percolation theory, we
argue that given an LTI system and an associated sensor network, the
`strong-robustness' property can be checked in polynomial time.
| cs.SY | consider a linear timeinvariant lti dynamical system monitored by a network of sensors modeled as nodes of an underlying directed communication graph we study the problem of collaboratively estimating the state of the system when certain nodes are compromised by adversaries specifically we consider a byzantine adversary model where a compromised node possesses complete knowledge of the system dynamics and the network and can deviate arbitrarily from the rules of any prescribed algorithm we first characterize certain fundamental limitations of any distributed state estimation algorithm in terms of the measurement and communication structure of the nodes we then develop an attackresilient provably correct state estimation algorithm that admits a fully distributed implementation to characterize feasible network topologies that guarantee success of our proposed technique we introduce a notion of strongrobustness that captures both measurement and communication redundancy finally by drawing connections to bootstrap percolation theory we argue that given an lti system and an associated sensor network the strongrobustness property can be checked in polynomial time | [['consider', 'a', 'linear', 'timeinvariant', 'lti', 'dynamical', 'system', 'monitored', 'by', 'a', 'network', 'of', 'sensors', 'modeled', 'as', 'nodes', 'of', 'an', 'underlying', 'directed', 'communication', 'graph', 'we', 'study', 'the', 'problem', 'of', 'collaboratively', 'estimating', 'the', 'state', 'of', 'the', 'system', 'when', 'certain', 'nodes', 'are', 'compromised', 'by', 'adversaries', 'specifically', 'we', 'consider', 'a', 'byzantine', 'adversary', 'model', 'where', 'a', 'compromised', 'node', 'possesses', 'complete', 'knowledge', 'of', 'the', 'system', 'dynamics', 'and', 'the', 'network', 'and', 'can', 'deviate', 'arbitrarily', 'from', 'the', 'rules', 'of', 'any', 'prescribed', 'algorithm', 'we', 'first', 'characterize', 'certain', 'fundamental', 'limitations', 'of', 'any', 'distributed', 'state', 'estimation', 'algorithm', 'in', 'terms', 'of', 'the', 'measurement', 'and', 'communication', 'structure', 'of', 'the', 'nodes', 'we', 'then', 'develop', 'an', 'attackresilient', 'provably', 'correct', 'state', 'estimation', 'algorithm', 'that', 'admits', 'a', 'fully', 'distributed', 'implementation', 'to', 'characterize', 'feasible', 'network', 'topologies', 'that', 'guarantee', 'success', 'of', 'our', 'proposed', 'technique', 'we', 'introduce', 'a', 'notion', 'of', 'strongrobustness', 'that', 'captures', 'both', 'measurement', 'and', 'communication', 'redundancy', 'finally', 'by', 'drawing', 'connections', 'to', 'bootstrap', 'percolation', 'theory', 'we', 'argue', 'that', 'given', 'an', 'lti', 'system', 'and', 'an', 'associated', 'sensor', 'network', 'the', 'strongrobustness', 'property', 'can', 'be', 'checked', 'in', 'polynomial', 'time']] | [-0.22049368343531814, 0.05195070567246947, -0.05881220600908486, 0.0016641437470708497, -0.04450646708378705, -0.22712508507183662, 0.08781436568256695, 0.3619079207206463, -0.3229805295719061, -0.29230432032050974, 0.0988655327435969, -0.2320442328047825, -0.21892069726500932, 0.1105153687651803, -0.12573994667071953, 0.10591409975242597, 0.08469070470324014, 0.09105896520167135, -0.018994128193831207, -0.2359830639901835, 0.33309390915915504, 0.041607115360930924, 0.2664747216750118, -0.012310489049657296, 0.14819492704076012, 0.03973267339567495, 0.004962446917666168, 0.06357939328065584, -0.10192043459818062, 0.09436756262780031, 0.2721843928263364, 0.20343310973129985, 0.3024188392673528, -0.4427496551510469, -0.21488248625565776, 0.16504508693327719, 0.1352851008343306, 0.11911642539922557, 0.00336325164350522, -0.3201617746011967, 0.13114689821207032, -0.2051390207616794, -0.09851994162827174, -0.07611881200190089, -0.04461086657829583, 0.017972594983137507, -0.29773080428365173, -0.013109815161442384, 0.06548632225131747, 0.044438319434071095, -0.05145297940499603, -0.00791446033655098, 0.005815997029081124, 0.15757226078184008, -0.059762389943565856, 0.0016098582915530155, 0.132051150276178, -0.12741513940911717, -0.17556763654603147, 0.33727460173980855, -0.007761988173758543, -0.1986891574640872, 0.11114874898197652, -0.05424420930666667, -0.1595598718977715, 0.10196538348809997, 0.2357716269495829, 0.10194915564583115, -0.1843317733367191, 0.061633640009748025, -0.05963515424419467, 0.19226023664686648, -0.0016496419159854512, 0.04674514470815023, 0.11960838260924125, 0.1875306307778285, 0.14541219317967571, 0.15548973294541454, -0.04976148362642029, -0.10079722034619985, -0.2797342732764508, -0.12136511880870364, -0.24165117795076563, 0.009870765367295684, -0.12751166657613883, -0.1574657583870448, 0.40033114596451747, 0.17654850939856614, 0.190646353407895, 0.13008127327463248, 0.31238144188097156, 0.0950177207407428, 0.011570370700721425, 0.16173219806571468, 0.19826896486155443, 0.11706010015573488, 0.05064916346085871, -0.20115855661442322, 0.1515778233737276, 0.03767717664311754] |
1,802.09652 | Hadronic Superpartners from Superconformal and Supersymmetric Algebra | Through the embedding of superconformal quantum mechanics into AdS space, it
is possible to construct an effective supersymmetric QCD light-front
Hamiltonian for hadrons, which includes a spin-spin interaction between the
hadronic constituents. A specific breaking of conformal symmetry determines a
unique effective quark-confining potential for light hadrons, as well as
remarkable connections between the meson, baryon, and tetraquark spectra. The
pion is massless in the chiral limit and has no supersymmetric partner. The
excitation spectra of relativistic light-quark meson, baryon and tetraquark
bound states lie on linear Regge trajectories with identical slopes in the
radial and orbital quantum numbers. Although conformal symmetry is strongly
broken by the heavy quark mass, the basic underlying supersymmetric mechanism,
which transforms mesons to baryons (and baryons to tetraquarks) into each
other, still holds and gives remarkable connections across the entire spectrum
of light, heavy-light and double-heavy hadrons. Here we show that all the
observed hadrons can be related through this effective supersymmetric QCD, and
that it can be used to identify the structure of the new charmonium states.
| hep-ph | through the embedding of superconformal quantum mechanics into ads space it is possible to construct an effective supersymmetric qcd lightfront hamiltonian for hadrons which includes a spinspin interaction between the hadronic constituents a specific breaking of conformal symmetry determines a unique effective quarkconfining potential for light hadrons as well as remarkable connections between the meson baryon and tetraquark spectra the pion is massless in the chiral limit and has no supersymmetric partner the excitation spectra of relativistic lightquark meson baryon and tetraquark bound states lie on linear regge trajectories with identical slopes in the radial and orbital quantum numbers although conformal symmetry is strongly broken by the heavy quark mass the basic underlying supersymmetric mechanism which transforms mesons to baryons and baryons to tetraquarks into each other still holds and gives remarkable connections across the entire spectrum of light heavylight and doubleheavy hadrons here we show that all the observed hadrons can be related through this effective supersymmetric qcd and that it can be used to identify the structure of the new charmonium states | [['through', 'the', 'embedding', 'of', 'superconformal', 'quantum', 'mechanics', 'into', 'ads', 'space', 'it', 'is', 'possible', 'to', 'construct', 'an', 'effective', 'supersymmetric', 'qcd', 'lightfront', 'hamiltonian', 'for', 'hadrons', 'which', 'includes', 'a', 'spinspin', 'interaction', 'between', 'the', 'hadronic', 'constituents', 'a', 'specific', 'breaking', 'of', 'conformal', 'symmetry', 'determines', 'a', 'unique', 'effective', 'quarkconfining', 'potential', 'for', 'light', 'hadrons', 'as', 'well', 'as', 'remarkable', 'connections', 'between', 'the', 'meson', 'baryon', 'and', 'tetraquark', 'spectra', 'the', 'pion', 'is', 'massless', 'in', 'the', 'chiral', 'limit', 'and', 'has', 'no', 'supersymmetric', 'partner', 'the', 'excitation', 'spectra', 'of', 'relativistic', 'lightquark', 'meson', 'baryon', 'and', 'tetraquark', 'bound', 'states', 'lie', 'on', 'linear', 'regge', 'trajectories', 'with', 'identical', 'slopes', 'in', 'the', 'radial', 'and', 'orbital', 'quantum', 'numbers', 'although', 'conformal', 'symmetry', 'is', 'strongly', 'broken', 'by', 'the', 'heavy', 'quark', 'mass', 'the', 'basic', 'underlying', 'supersymmetric', 'mechanism', 'which', 'transforms', 'mesons', 'to', 'baryons', 'and', 'baryons', 'to', 'tetraquarks', 'into', 'each', 'other', 'still', 'holds', 'and', 'gives', 'remarkable', 'connections', 'across', 'the', 'entire', 'spectrum', 'of', 'light', 'heavylight', 'and', 'doubleheavy', 'hadrons', 'here', 'we', 'show', 'that', 'all', 'the', 'observed', 'hadrons', 'can', 'be', 'related', 'through', 'this', 'effective', 'supersymmetric', 'qcd', 'and', 'that', 'it', 'can', 'be', 'used', 'to', 'identify', 'the', 'structure', 'of', 'the', 'new', 'charmonium', 'states']] | [-0.07820690833246229, 0.29182280828427304, -0.1399178283125826, 0.16621062683139595, -0.09857998286031358, -0.15229517072920912, 0.028903887748996587, 0.32984641186850167, -0.17153616152147108, -0.20887701283476648, -0.0605690906365568, -0.30632020214080125, -0.060027251084303034, 0.06557113960941975, 0.06257570440206549, 0.1115809256296562, 0.030696023762729233, 0.05527307112412206, -0.07536379607754289, -0.18699889765361902, 0.3378507356057693, -0.036199943558580576, 0.20169065146300214, 0.15873609549068543, 0.059113491379425745, 0.03844396598990364, 0.04141347128737333, -0.06532173999601938, -0.07781529801821767, 0.09003603574150809, 0.22078675373280743, 0.06617576189355218, 0.08903638355503522, -0.36256919534684257, -0.19189747746621696, 0.11650146267526708, 0.22187254194908873, 0.14939347691696817, -0.019668560770163632, -0.31355291813740443, 0.09029743086610889, -0.1674268490303008, -0.1823060244994891, -0.16038330783532267, 0.011732458525026837, -0.07185062515313854, -0.2540012167103658, 0.0917450510341428, -0.05155773430690704, 0.015462556752194276, -0.05589451022237411, -0.16331543099274323, -0.1137890808388655, 0.06377708673445058, 0.11632421084588672, 0.09293217369055526, 0.1477335411292533, -0.17696983166622404, -0.16519917156440259, 0.4640403329127136, -0.03861200534497741, -0.18790504038762088, 0.1346003119940816, -0.13954369693823243, -0.1542031501504143, 0.09687853355265769, 0.15623240831211724, 0.05989081277137344, -0.16251770188080564, 0.14240500181458418, -0.08072058053087743, 0.16092796523817118, 0.08385588775720747, 0.13477807280797532, 0.28958205972937334, 0.13243891215139209, -0.01766085741511578, 0.08151529772620617, 0.008006772876117679, -0.13721150584049233, -0.38740376373431806, -0.14348368379474757, -0.14868159899180328, 0.09382492476597899, -0.10086205871655317, -0.12516412746305738, 0.44883535101999067, 0.027327401713978624, 0.23058171976015143, 0.005270327461298673, 0.2688469201026634, 0.0747190948974491, 0.09699776725062094, 0.10803334180790203, 0.291571492018799, 0.22781516776096353, 0.1310055769682894, -0.31020874171196644, -0.09643369592624534, 0.11048759680359099] |
1,802.09653 | On the Suitability of $L_p$-norms for Creating and Preventing
Adversarial Examples | Much research effort has been devoted to better understanding adversarial
examples, which are specially crafted inputs to machine-learning models that
are perceptually similar to benign inputs, but are classified differently
(i.e., misclassified). Both algorithms that create adversarial examples and
strategies for defending against them typically use $L_p$-norms to measure the
perceptual similarity between an adversarial input and its benign original.
Prior work has already shown, however, that two images need not be close to
each other as measured by an $L_p$-norm to be perceptually similar. In this
work, we show that nearness according to an $L_p$-norm is not just unnecessary
for perceptual similarity, but is also insufficient. Specifically, focusing on
datasets (CIFAR10 and MNIST), $L_p$-norms, and thresholds used in prior work,
we show through online user studies that "adversarial examples" that are closer
to their benign counterparts than required by commonly used $L_p$-norm
thresholds can nevertheless be perceptually different to humans from the
corresponding benign examples. Namely, the perceptual distance between two
images that are "near" each other according to an $L_p$-norm can be high enough
that participants frequently classify the two images as representing different
objects or digits. Combined with prior work, we thus demonstrate that nearness
of inputs as measured by $L_p$-norms is neither necessary nor sufficient for
perceptual similarity, which has implications for both creating and defending
against adversarial examples. We propose and discuss alternative similarity
metrics to stimulate future research in the area.
| cs.CR cs.CV | much research effort has been devoted to better understanding adversarial examples which are specially crafted inputs to machinelearning models that are perceptually similar to benign inputs but are classified differently ie misclassified both algorithms that create adversarial examples and strategies for defending against them typically use l_pnorms to measure the perceptual similarity between an adversarial input and its benign original prior work has already shown however that two images need not be close to each other as measured by an l_pnorm to be perceptually similar in this work we show that nearness according to an l_pnorm is not just unnecessary for perceptual similarity but is also insufficient specifically focusing on datasets cifar10 and mnist l_pnorms and thresholds used in prior work we show through online user studies that adversarial examples that are closer to their benign counterparts than required by commonly used l_pnorm thresholds can nevertheless be perceptually different to humans from the corresponding benign examples namely the perceptual distance between two images that are near each other according to an l_pnorm can be high enough that participants frequently classify the two images as representing different objects or digits combined with prior work we thus demonstrate that nearness of inputs as measured by l_pnorms is neither necessary nor sufficient for perceptual similarity which has implications for both creating and defending against adversarial examples we propose and discuss alternative similarity metrics to stimulate future research in the area | [['much', 'research', 'effort', 'has', 'been', 'devoted', 'to', 'better', 'understanding', 'adversarial', 'examples', 'which', 'are', 'specially', 'crafted', 'inputs', 'to', 'machinelearning', 'models', 'that', 'are', 'perceptually', 'similar', 'to', 'benign', 'inputs', 'but', 'are', 'classified', 'differently', 'ie', 'misclassified', 'both', 'algorithms', 'that', 'create', 'adversarial', 'examples', 'and', 'strategies', 'for', 'defending', 'against', 'them', 'typically', 'use', 'l_pnorms', 'to', 'measure', 'the', 'perceptual', 'similarity', 'between', 'an', 'adversarial', 'input', 'and', 'its', 'benign', 'original', 'prior', 'work', 'has', 'already', 'shown', 'however', 'that', 'two', 'images', 'need', 'not', 'be', 'close', 'to', 'each', 'other', 'as', 'measured', 'by', 'an', 'l_pnorm', 'to', 'be', 'perceptually', 'similar', 'in', 'this', 'work', 'we', 'show', 'that', 'nearness', 'according', 'to', 'an', 'l_pnorm', 'is', 'not', 'just', 'unnecessary', 'for', 'perceptual', 'similarity', 'but', 'is', 'also', 'insufficient', 'specifically', 'focusing', 'on', 'datasets', 'cifar10', 'and', 'mnist', 'l_pnorms', 'and', 'thresholds', 'used', 'in', 'prior', 'work', 'we', 'show', 'through', 'online', 'user', 'studies', 'that', 'adversarial', 'examples', 'that', 'are', 'closer', 'to', 'their', 'benign', 'counterparts', 'than', 'required', 'by', 'commonly', 'used', 'l_pnorm', 'thresholds', 'can', 'nevertheless', 'be', 'perceptually', 'different', 'to', 'humans', 'from', 'the', 'corresponding', 'benign', 'examples', 'namely', 'the', 'perceptual', 'distance', 'between', 'two', 'images', 'that', 'are', 'near', 'each', 'other', 'according', 'to', 'an', 'l_pnorm', 'can', 'be', 'high', 'enough', 'that', 'participants', 'frequently', 'classify', 'the', 'two', 'images', 'as', 'representing', 'different', 'objects', 'or', 'digits', 'combined', 'with', 'prior', 'work', 'we', 'thus', 'demonstrate', 'that', 'nearness', 'of', 'inputs', 'as', 'measured', 'by', 'l_pnorms', 'is', 'neither', 'necessary', 'nor', 'sufficient', 'for', 'perceptual', 'similarity', 'which', 'has', 'implications', 'for', 'both', 'creating', 'and', 'defending', 'against', 'adversarial', 'examples', 'we', 'propose', 'and', 'discuss', 'alternative', 'similarity', 'metrics', 'to', 'stimulate', 'future', 'research', 'in', 'the', 'area']] | [0.0016061881530581963, 0.04753369902813697, -0.07504966655423873, 0.13838946471827787, -0.1177153426501507, -0.21626172464474533, 0.01753902382350955, 0.48502074858716016, -0.22319922318784244, -0.35180708729241533, 0.08897838718159604, -0.3071853220659281, -0.2117681531373113, 0.20713221215454367, -0.18018235750290082, 0.09141491075269367, 0.043620554221408904, 0.06673112356316156, -0.04665885941333723, -0.3192148813663467, 0.3271548745172287, 0.05980305896800813, 0.3007068230819894, 0.0026620717479489777, 0.04865207402885377, -0.085969700284483, -0.01651778271351057, 0.024360952890448113, -0.06184262864099239, 0.10004886233086702, 0.32046912965052654, 0.19824766450229897, 0.31780914096986945, -0.4273151854909799, -0.21062308699206964, 0.1573163642929199, 0.12717405152860792, 0.10326630081781255, -0.05485246522904213, -0.34834922484676295, 0.15803031189016456, -0.13165309194884095, 0.007670157574282228, -0.1633955311002642, 0.008683025172345718, 0.012522553721489974, -0.2701272911073852, 0.012376210262153086, 0.0781071332955285, 0.05045146935419002, -0.05866542193971826, -0.12446230289207984, -0.013797638544867813, 0.19085084443139738, 0.08130253525598187, 0.052548880922659164, 0.12906849790680838, -0.13943760175005443, -0.13620690939081478, 0.36188647507017924, 0.003954385390261066, -0.23649341987744602, 0.2544947962629322, -0.034806281658290306, -0.096780249945729, 0.09200623395110044, 0.20316140313990383, 0.10790773199769012, -0.1668962192081135, -0.033406762673936094, -0.017451648663273592, 0.17133551508970243, 0.10390015065332066, 0.033046371162032025, 0.15950477219339979, 0.11066119971302955, 0.035583334623242605, 0.14890038218685203, -0.06563879894930182, -0.048119805895434575, -0.23280968531997648, -0.08957036352914832, -0.17852337917367994, -0.0003820837433975512, -0.0623039950471507, -0.11636763529049897, 0.34463968799539885, 0.21347247368267067, 0.2420583946202029, 0.07863368076971783, 0.34631886527350936, 0.014863768207618597, 0.10249357523798416, 0.07192416306592933, 0.22251933306663882, 0.016405420306134764, 0.03392128536540559, -0.12125151486819775, 0.1254583712557197, 0.0004721740820692687] |
1,802.09654 | Resilient Leader-Follower Consensus to Arbitrary Reference Values | The problem of consensus in the presence of misbehaving agents has
increasingly attracted attention in the literature. Prior results have
established algorithms and graph structures for multi-agent networks which
guarantee the consensus of normally behaving agents in the presence of a
bounded number of misbehaving agents. The final consensus value is guaranteed
to fall within the convex hull of initial agent states. However, the problem of
consensus tracking considers consensus to arbitrary reference values which may
not lie within such bounds. Conditions for consensus tracking in the presence
of misbehaving agents has not been fully studied. This paper presents
conditions for a network of agents using the W-MSR algorithm to achieve this
objective.
| cs.SY | the problem of consensus in the presence of misbehaving agents has increasingly attracted attention in the literature prior results have established algorithms and graph structures for multiagent networks which guarantee the consensus of normally behaving agents in the presence of a bounded number of misbehaving agents the final consensus value is guaranteed to fall within the convex hull of initial agent states however the problem of consensus tracking considers consensus to arbitrary reference values which may not lie within such bounds conditions for consensus tracking in the presence of misbehaving agents has not been fully studied this paper presents conditions for a network of agents using the wmsr algorithm to achieve this objective | [['the', 'problem', 'of', 'consensus', 'in', 'the', 'presence', 'of', 'misbehaving', 'agents', 'has', 'increasingly', 'attracted', 'attention', 'in', 'the', 'literature', 'prior', 'results', 'have', 'established', 'algorithms', 'and', 'graph', 'structures', 'for', 'multiagent', 'networks', 'which', 'guarantee', 'the', 'consensus', 'of', 'normally', 'behaving', 'agents', 'in', 'the', 'presence', 'of', 'a', 'bounded', 'number', 'of', 'misbehaving', 'agents', 'the', 'final', 'consensus', 'value', 'is', 'guaranteed', 'to', 'fall', 'within', 'the', 'convex', 'hull', 'of', 'initial', 'agent', 'states', 'however', 'the', 'problem', 'of', 'consensus', 'tracking', 'considers', 'consensus', 'to', 'arbitrary', 'reference', 'values', 'which', 'may', 'not', 'lie', 'within', 'such', 'bounds', 'conditions', 'for', 'consensus', 'tracking', 'in', 'the', 'presence', 'of', 'misbehaving', 'agents', 'has', 'not', 'been', 'fully', 'studied', 'this', 'paper', 'presents', 'conditions', 'for', 'a', 'network', 'of', 'agents', 'using', 'the', 'wmsr', 'algorithm', 'to', 'achieve', 'this', 'objective']] | [-0.19397673050739936, 0.015485116315955696, -0.06300659360463864, -0.010669268768521891, -0.08321092766293857, -0.159293106923412, 0.06444076791376574, 0.41702373598569203, -0.25649204946655246, -0.33662832751204924, 0.11366923004139348, -0.2128604136773252, -0.1347130093449128, 0.06546281790776577, -0.152497415696936, 0.12064072721646621, 0.0867669225138213, 0.12229455954262189, 0.019198062351538932, -0.31429307412145135, 0.29244073793025954, 0.018042838516911224, 0.2704867631712529, 0.012247769515462486, 0.11933699044311652, -0.0010766367860404508, 0.049255265022761056, 0.05680913782530946, -0.09474505832518584, 0.10233056064160857, 0.33628980231463046, 0.18395870109712373, 0.4106517327600159, -0.44510011705902536, -0.1807782702048176, 0.21043982053275354, 0.17076803056988865, 0.13515549873825097, -0.025591740376382534, -0.3448149722535163, 0.12034782708672408, -0.16016797535329325, -0.08100918203542408, -0.007968384656123817, -0.0031763090851849745, 0.050640947230151924, -0.31270822304733364, 0.02105594487927322, 0.06372729847810531, 0.058189587492961437, -0.10319653933402151, -0.09265221902335595, 0.021205353521509096, 0.17703301866172946, 0.04841025644938262, 0.004728108898104567, 0.1553873402278571, -0.16913589347469887, -0.16923309420235455, 0.3735332737560384, 0.03811744470814509, -0.2104395837424298, 0.16877289351915742, -0.07405643318530306, -0.16986631743202452, 0.12567793535085262, 0.23091439883657067, 0.13529384273403725, -0.18490069234810239, 0.07085273829735732, -0.08056987585067484, 0.1430855653306935, 0.02205026471139198, 0.049024383901269175, 0.14457480458077043, 0.19916371956268059, 0.2177179066826024, 0.08841747843585576, 0.01475080695568717, -0.18075474820631957, -0.2190866682628569, -0.09021895813722429, -0.20447300340414845, -0.0142288817314693, -0.05518092280739698, -0.17961577800763603, 0.3779675016578819, 0.1633857061938865, 0.1722670091382627, 0.10422076145394905, 0.2852812412394477, 0.05390092623825434, 0.0478727189932085, 0.150933689741318, 0.2910709706671436, 0.08029615136911161, 0.10255607657018118, -0.17276065976641672, 0.21819421852913884, 0.030766420686242264] |
1,802.09655 | Translating and Segmenting Multimodal Medical Volumes with Cycle- and
Shape-Consistency Generative Adversarial Network | Synthesized medical images have several important applications, e.g., as an
intermedium in cross-modality image registration and as supplementary training
samples to boost the generalization capability of a classifier. Especially,
synthesized computed tomography (CT) data can provide X-ray attenuation map for
radiation therapy planning. In this work, we propose a generic cross-modality
synthesis approach with the following targets: 1) synthesizing realistic
looking 3D images using unpaired training data, 2) ensuring consistent
anatomical structures, which could be changed by geometric distortion in
cross-modality synthesis and 3) improving volume segmentation by using
synthetic data for modalities with limited training samples. We show that these
goals can be achieved with an end-to-end 3D convolutional neural network (CNN)
composed of mutually-beneficial generators and segmentors for image synthesis
and segmentation tasks. The generators are trained with an adversarial loss, a
cycle-consistency loss, and also a shape-consistency loss, which is supervised
by segmentors, to reduce the geometric distortion. From the segmentation view,
the segmentors are boosted by synthetic data from generators in an online
manner. Generators and segmentors prompt each other alternatively in an
end-to-end training fashion. With extensive experiments on a dataset including
a total of 4,496 CT and magnetic resonance imaging (MRI) cardiovascular
volumes, we show both tasks are beneficial to each other and coupling these two
tasks results in better performance than solving them exclusively.
| cs.CV | synthesized medical images have several important applications eg as an intermedium in crossmodality image registration and as supplementary training samples to boost the generalization capability of a classifier especially synthesized computed tomography ct data can provide xray attenuation map for radiation therapy planning in this work we propose a generic crossmodality synthesis approach with the following targets 1 synthesizing realistic looking 3d images using unpaired training data 2 ensuring consistent anatomical structures which could be changed by geometric distortion in crossmodality synthesis and 3 improving volume segmentation by using synthetic data for modalities with limited training samples we show that these goals can be achieved with an endtoend 3d convolutional neural network cnn composed of mutuallybeneficial generators and segmentors for image synthesis and segmentation tasks the generators are trained with an adversarial loss a cycleconsistency loss and also a shapeconsistency loss which is supervised by segmentors to reduce the geometric distortion from the segmentation view the segmentors are boosted by synthetic data from generators in an online manner generators and segmentors prompt each other alternatively in an endtoend training fashion with extensive experiments on a dataset including a total of 4496 ct and magnetic resonance imaging mri cardiovascular volumes we show both tasks are beneficial to each other and coupling these two tasks results in better performance than solving them exclusively | [['synthesized', 'medical', 'images', 'have', 'several', 'important', 'applications', 'eg', 'as', 'an', 'intermedium', 'in', 'crossmodality', 'image', 'registration', 'and', 'as', 'supplementary', 'training', 'samples', 'to', 'boost', 'the', 'generalization', 'capability', 'of', 'a', 'classifier', 'especially', 'synthesized', 'computed', 'tomography', 'ct', 'data', 'can', 'provide', 'xray', 'attenuation', 'map', 'for', 'radiation', 'therapy', 'planning', 'in', 'this', 'work', 'we', 'propose', 'a', 'generic', 'crossmodality', 'synthesis', 'approach', 'with', 'the', 'following', 'targets', '1', 'synthesizing', 'realistic', 'looking', '3d', 'images', 'using', 'unpaired', 'training', 'data', '2', 'ensuring', 'consistent', 'anatomical', 'structures', 'which', 'could', 'be', 'changed', 'by', 'geometric', 'distortion', 'in', 'crossmodality', 'synthesis', 'and', '3', 'improving', 'volume', 'segmentation', 'by', 'using', 'synthetic', 'data', 'for', 'modalities', 'with', 'limited', 'training', 'samples', 'we', 'show', 'that', 'these', 'goals', 'can', 'be', 'achieved', 'with', 'an', 'endtoend', '3d', 'convolutional', 'neural', 'network', 'cnn', 'composed', 'of', 'mutuallybeneficial', 'generators', 'and', 'segmentors', 'for', 'image', 'synthesis', 'and', 'segmentation', 'tasks', 'the', 'generators', 'are', 'trained', 'with', 'an', 'adversarial', 'loss', 'a', 'cycleconsistency', 'loss', 'and', 'also', 'a', 'shapeconsistency', 'loss', 'which', 'is', 'supervised', 'by', 'segmentors', 'to', 'reduce', 'the', 'geometric', 'distortion', 'from', 'the', 'segmentation', 'view', 'the', 'segmentors', 'are', 'boosted', 'by', 'synthetic', 'data', 'from', 'generators', 'in', 'an', 'online', 'manner', 'generators', 'and', 'segmentors', 'prompt', 'each', 'other', 'alternatively', 'in', 'an', 'endtoend', 'training', 'fashion', 'with', 'extensive', 'experiments', 'on', 'a', 'dataset', 'including', 'a', 'total', 'of', '4496', 'ct', 'and', 'magnetic', 'resonance', 'imaging', 'mri', 'cardiovascular', 'volumes', 'we', 'show', 'both', 'tasks', 'are', 'beneficial', 'to', 'each', 'other', 'and', 'coupling', 'these', 'two', 'tasks', 'results', 'in', 'better', 'performance', 'than', 'solving', 'them', 'exclusively']] | [-0.0018233404639410918, 0.03688123704501179, -0.014066710495113578, 0.06694408521677057, -0.07892656981302892, -0.16252258394262223, -0.015408781194447042, 0.49716305375507436, -0.2678341356012545, -0.37233334792497225, 0.09295423629855286, -0.2945134328278505, -0.14585813949496984, 0.22294294580647916, -0.1450981151219032, 0.0976314148387221, 0.16521177678762353, 0.010154843071638288, -0.09052994091554915, -0.26439335666114216, 0.27850941614116026, 0.05143994780589048, 0.34266316005322217, -0.008610980315176455, 0.13250342636373422, -0.009422561333442455, -0.007003776814823664, 0.006396939343832365, -0.035854462180856764, 0.1768879167019011, 0.32509340420918176, 0.19972381560285002, 0.252867478386129, -0.42217508707722845, -0.2550863346603771, 0.08348603973156649, 0.14770817694584595, 0.09677697144572082, -0.11232591644365375, -0.33920253399274736, 0.07791887383140436, -0.12346240255947663, 0.06029799560095039, -0.14189060594563344, -0.05333205854592496, -0.021983889352049694, -0.3373317355119951, 0.04797004899592139, 0.042341258933929274, 0.12147896040315244, -0.11366770718008552, -0.09616547684210723, -0.029153307810527822, 0.17352834376549034, 0.006863018821554948, 0.09171693846923576, 0.1418715308199224, -0.21908708552821415, -0.14714864844756123, 0.34320483274213526, -0.01546111485829681, -0.19897838830246195, 0.17173384654135804, -0.04289161463663595, -0.12969808956846324, 0.14076719955609235, 0.23359411407966957, 0.12487803266562317, -0.19139270475091727, -0.020295710856792385, -0.0016322397721557109, 0.18214426230805073, 0.04945310807072443, -0.016938109900249534, 0.1613582839533372, 0.2530204444303981, -0.012305831737320904, 0.1793522864485002, -0.1713785410086044, 0.02737312265522948, -0.21360131126475523, -0.11253825302095447, -0.18930529942098137, 0.013965789989364168, -0.11194165383909986, -0.10962794081427021, 0.36134487550203864, 0.19448627481347622, 0.2389785118707239, 0.06594152731281921, 0.3774144905087746, 0.017189435262156473, 0.14415272426064293, 0.055267804242738576, 0.1825676250471372, -0.00446207984301617, 0.09669662049235818, -0.16616019157992598, 0.061629917357780346, 0.03320455662565961] |
1,802.09656 | Learning Binary Latent Variable Models: A Tensor Eigenpair Approach | Latent variable models with hidden binary units appear in various
applications. Learning such models, in particular in the presence of noise, is
a challenging computational problem. In this paper we propose a novel spectral
approach to this problem, based on the eigenvectors of both the second order
moment matrix and third order moment tensor of the observed data. We prove that
under mild non-degeneracy conditions, our method consistently estimates the
model parameters at the optimal parametric rate. Our tensor-based method
generalizes previous orthogonal tensor decomposition approaches, where the
hidden units were assumed to be either statistically independent or mutually
exclusive. We illustrate the consistency of our method on simulated data and
demonstrate its usefulness in learning a common model for population mixtures
in genetics.
| stat.ML | latent variable models with hidden binary units appear in various applications learning such models in particular in the presence of noise is a challenging computational problem in this paper we propose a novel spectral approach to this problem based on the eigenvectors of both the second order moment matrix and third order moment tensor of the observed data we prove that under mild nondegeneracy conditions our method consistently estimates the model parameters at the optimal parametric rate our tensorbased method generalizes previous orthogonal tensor decomposition approaches where the hidden units were assumed to be either statistically independent or mutually exclusive we illustrate the consistency of our method on simulated data and demonstrate its usefulness in learning a common model for population mixtures in genetics | [['latent', 'variable', 'models', 'with', 'hidden', 'binary', 'units', 'appear', 'in', 'various', 'applications', 'learning', 'such', 'models', 'in', 'particular', 'in', 'the', 'presence', 'of', 'noise', 'is', 'a', 'challenging', 'computational', 'problem', 'in', 'this', 'paper', 'we', 'propose', 'a', 'novel', 'spectral', 'approach', 'to', 'this', 'problem', 'based', 'on', 'the', 'eigenvectors', 'of', 'both', 'the', 'second', 'order', 'moment', 'matrix', 'and', 'third', 'order', 'moment', 'tensor', 'of', 'the', 'observed', 'data', 'we', 'prove', 'that', 'under', 'mild', 'nondegeneracy', 'conditions', 'our', 'method', 'consistently', 'estimates', 'the', 'model', 'parameters', 'at', 'the', 'optimal', 'parametric', 'rate', 'our', 'tensorbased', 'method', 'generalizes', 'previous', 'orthogonal', 'tensor', 'decomposition', 'approaches', 'where', 'the', 'hidden', 'units', 'were', 'assumed', 'to', 'be', 'either', 'statistically', 'independent', 'or', 'mutually', 'exclusive', 'we', 'illustrate', 'the', 'consistency', 'of', 'our', 'method', 'on', 'simulated', 'data', 'and', 'demonstrate', 'its', 'usefulness', 'in', 'learning', 'a', 'common', 'model', 'for', 'population', 'mixtures', 'in', 'genetics']] | [-0.057905888507863684, 0.04774844900689899, -0.06766518479168054, 0.046015923083271654, -0.07729229882487186, -0.10858784604351968, 0.04887977235522421, 0.3932894401838102, -0.2956019712634565, -0.2840558597217164, 0.11574567854216683, -0.24054399287448294, -0.18520860305814554, 0.14943039562410465, -0.07952813700126905, 0.09101525763934103, 0.08790520069399668, 0.0587264166867, -0.06334163018524827, -0.2651597545144238, 0.3298676760957366, 0.013753222699667658, 0.33479348361499667, -0.01387443934847045, 0.12356801864488291, -0.013508185667301258, -0.03779568060511543, -0.014442284846858632, -0.07548010359630186, 0.16022493947868147, 0.2545406850862374, 0.14007723265023098, 0.29377092662898285, -0.40470250777997857, -0.228426689291448, 0.14431199638525985, 0.10778902076943327, 0.10191596435352919, -0.0317628406694219, -0.269247568682805, 0.08480463621597137, -0.16015047815087582, -0.08163563340842243, -0.12766392577266802, -0.060868088216070204, -0.0006090688459094494, -0.3502906459353624, 0.13013449199347488, 0.08891851803092586, 0.035466134495612596, -0.08892824535817659, -0.15595920434439434, 0.04446212598592073, 0.07830632285162385, 0.0793596320492666, -0.01883796343745123, 0.08227479299145465, -0.10641572100951546, -0.13705950851492102, 0.3420962799681283, -0.08264728838149758, -0.25036787223671714, 0.19702792743543884, -0.10468128301774061, -0.20916712261180603, 0.06592888870809768, 0.22446786384323553, 0.159267887773533, -0.16464018771394848, 0.07256442970397221, -0.05731152494498078, 0.18056123810369643, 0.0076965499188630816, -0.015586093255889511, 0.1550075501699241, 0.1762092538504681, 0.03692145737624096, 0.1527211169755432, -0.10913950862408045, -0.0913509719013687, -0.27488305645003436, -0.1005789986774025, -0.1978996270937064, -0.017652245640243973, -0.13949060939123756, -0.15511735040514218, 0.39681213177860747, 0.2218005203551823, 0.20973604186081268, 0.06790009174578553, 0.31909969808710287, 0.10608299343091916, 0.041537882409982324, 0.0723109595184665, 0.1873135848136078, 0.13780588787537248, 0.06308237476003987, -0.20670880770311698, 0.09670324670103934, 0.03976640725628503] |
1,802.09657 | Event-Triggered Controller Synthesis for Dynamical Systems with Temporal
Logic Constraints | In this work, we propose an event-triggered con- trol framework for dynamical
systems with temporal logical constraints. Event-triggered control
methodologies have proven to be very efficient in reducing sensing,
communication and computation costs. When a continuous feedback control is re-
placed with an event-triggered strategy, the corresponding state trajectories
also differ. In a system with logical constraints, such small deviation in the
trajectory might lead to unsatisfiability of the logical constraints. In this
work, we develop an approach where we ensure that the event-triggered state
trajectory is confined within an tube of the ideal trajectory associated with
the continuous state feedback. At the same time, we will ensure satisfiability
of the logical constraints as well. Furthermore, we show that the proposed
method works for delayed systems as long as the delay is bounded by a certain
quantity.
| cs.RO math.DS | in this work we propose an eventtriggered con trol framework for dynamical systems with temporal logical constraints eventtriggered control methodologies have proven to be very efficient in reducing sensing communication and computation costs when a continuous feedback control is re placed with an eventtriggered strategy the corresponding state trajectories also differ in a system with logical constraints such small deviation in the trajectory might lead to unsatisfiability of the logical constraints in this work we develop an approach where we ensure that the eventtriggered state trajectory is confined within an tube of the ideal trajectory associated with the continuous state feedback at the same time we will ensure satisfiability of the logical constraints as well furthermore we show that the proposed method works for delayed systems as long as the delay is bounded by a certain quantity | [['in', 'this', 'work', 'we', 'propose', 'an', 'eventtriggered', 'con', 'trol', 'framework', 'for', 'dynamical', 'systems', 'with', 'temporal', 'logical', 'constraints', 'eventtriggered', 'control', 'methodologies', 'have', 'proven', 'to', 'be', 'very', 'efficient', 'in', 'reducing', 'sensing', 'communication', 'and', 'computation', 'costs', 'when', 'a', 'continuous', 'feedback', 'control', 'is', 're', 'placed', 'with', 'an', 'eventtriggered', 'strategy', 'the', 'corresponding', 'state', 'trajectories', 'also', 'differ', 'in', 'a', 'system', 'with', 'logical', 'constraints', 'such', 'small', 'deviation', 'in', 'the', 'trajectory', 'might', 'lead', 'to', 'unsatisfiability', 'of', 'the', 'logical', 'constraints', 'in', 'this', 'work', 'we', 'develop', 'an', 'approach', 'where', 'we', 'ensure', 'that', 'the', 'eventtriggered', 'state', 'trajectory', 'is', 'confined', 'within', 'an', 'tube', 'of', 'the', 'ideal', 'trajectory', 'associated', 'with', 'the', 'continuous', 'state', 'feedback', 'at', 'the', 'same', 'time', 'we', 'will', 'ensure', 'satisfiability', 'of', 'the', 'logical', 'constraints', 'as', 'well', 'furthermore', 'we', 'show', 'that', 'the', 'proposed', 'method', 'works', 'for', 'delayed', 'systems', 'as', 'long', 'as', 'the', 'delay', 'is', 'bounded', 'by', 'a', 'certain', 'quantity']] | [-0.1545736344911865, 0.1015578077007323, -0.07487137560956995, 0.017612640270929323, -0.05200226953674624, -0.16466584064858375, 0.07321344465561157, 0.38194220945456603, -0.3151115624125313, -0.30572258553256954, 0.13006380253665176, -0.19808209924720718, -0.13111300678094373, 0.18721233895490366, -0.14173727220304166, 0.1320472408466748, 0.040556714981352486, 0.06403081568576613, -0.049907427604045096, -0.21749255065228382, 0.28510331494366603, 0.0576438369759678, 0.2627066774157821, 0.017951065205363898, 0.12070400221613202, 0.012594111163481853, 0.04562380397352424, 0.03915603768529139, -0.10045875797023143, 0.08294159322671157, 0.26593515811229707, 0.17885630437764374, 0.33152548373289353, -0.468431390210116, -0.19166991714877588, 0.09515087613767952, 0.12254846180503658, 0.13897571997567468, -0.044008656180579295, -0.29227578022728, 0.08170765157734608, -0.20225864566563473, -0.08339154421875294, -0.07095131117605814, 0.011811977687434558, 0.04577054630533854, -0.3090847227382508, 0.01380087727282271, 0.0662330576559838, 0.018312664729726577, -0.09406935434489355, -0.026195382610146964, 0.017344598857223663, 0.1426495302523347, 0.00247475409193685, 0.025467007985189014, 0.12150771519250787, -0.09363338124579716, -0.16473093123114022, 0.35427678093640474, -0.021870715126402023, -0.23223150875351398, 0.16400326348936362, -0.06332992515220803, -0.16716980751277538, 0.10630056444711874, 0.18334494777921126, 0.11210638826821734, -0.1737298110529082, 0.056882334706104994, -0.010461155216406733, 0.2077469191425582, 0.007301284640986663, 0.0820453420050279, 0.1671291431378111, 0.23230718948919135, 0.1602386116563431, 0.12983446358108253, -0.030619326741417638, -0.13754006431023352, -0.307130037310676, -0.1294654505871182, -0.14187458552501714, 0.013431629635067317, -0.0399495217366863, -0.13547748372121884, 0.3407925848991875, 0.16990042008785872, 0.19160792784957406, 0.1250613333137339, 0.3348425663157917, 0.16347128272916522, 0.030784836812216762, 0.09288136604289612, 0.24622608476529156, 0.07837922228194338, 0.11512916101428279, -0.24003106442341296, 0.09832708755453681, 0.028256796239548104] |
1,802.09658 | The normalized volume of a singularity is lower semicontinuous | We show that in any $\mathbb{Q}$-Gorenstein flat family of klt singularities,
normalized volumes are lower semicontinuous with respect to the Zariski
topology. A quick consequence is that smooth points have the largest normalized
volume among all klt singularities. Using an alternative characterization of
K-semistability developed by Li, Liu and Xu, we show that K-semistability is a
very generic or empty condition in any $\mathbb{Q}$-Gorenstein flat family of
log Fano pairs.
| math.AG math.AC math.DG | we show that in any mathbbqgorenstein flat family of klt singularities normalized volumes are lower semicontinuous with respect to the zariski topology a quick consequence is that smooth points have the largest normalized volume among all klt singularities using an alternative characterization of ksemistability developed by li liu and xu we show that ksemistability is a very generic or empty condition in any mathbbqgorenstein flat family of log fano pairs | [['we', 'show', 'that', 'in', 'any', 'mathbbqgorenstein', 'flat', 'family', 'of', 'klt', 'singularities', 'normalized', 'volumes', 'are', 'lower', 'semicontinuous', 'with', 'respect', 'to', 'the', 'zariski', 'topology', 'a', 'quick', 'consequence', 'is', 'that', 'smooth', 'points', 'have', 'the', 'largest', 'normalized', 'volume', 'among', 'all', 'klt', 'singularities', 'using', 'an', 'alternative', 'characterization', 'of', 'ksemistability', 'developed', 'by', 'li', 'liu', 'and', 'xu', 'we', 'show', 'that', 'ksemistability', 'is', 'a', 'very', 'generic', 'or', 'empty', 'condition', 'in', 'any', 'mathbbqgorenstein', 'flat', 'family', 'of', 'log', 'fano', 'pairs']] | [-0.18026588640974037, 0.025820295946946965, -0.09399786091276578, 0.11106738648044744, -0.07746804379858077, -0.16936190936415058, 0.025334545717175517, 0.3706625482466604, -0.21461833461320826, -0.17970284634086836, 0.043777691729233736, -0.29351792127958365, -0.17678609433517392, 0.2313398025231436, -0.2003864529808717, 0.0020267506456418363, 0.02755169143368091, 0.006304481332855565, -0.11600080895171101, -0.32761353528393167, 0.41639108098045524, -0.036811170993106705, 0.289424425699482, 0.07597839403232294, 0.10391264859853046, -0.0010210653101759297, 0.006028447992035321, 0.07272338019683958, -0.18458724043687522, 0.10812447071408054, 0.2661075227195397, 0.10859681646273073, 0.18657698397125516, -0.33212780720953433, -0.1497647885632302, 0.21507629092250552, 0.09691623326257935, 0.038225666114262175, -0.05662290674517863, -0.2106860728668315, 0.1901576810117279, -0.11068567336936082, -0.23234678636238512, -0.08766327662659543, 0.047972742142155765, 0.03790363280900887, -0.22534127703734808, 0.012088773315606106, 0.11943778205064258, 0.07391436855375234, 0.007759184569918684, -0.05080123148592455, -0.09493001148636852, 0.0033116765353562575, -0.0509631116807993, 0.07508119410569114, 0.030492370921586243, -0.05623816778284631, -0.0833687768184713, 0.2674991531347457, -0.12179800664473857, -0.2146369547982301, 0.17312184468443906, -0.14882861921297652, -0.10255654898605177, 0.18251251169214291, 0.06722750168825899, 0.19055192869688783, -0.07258219555286424, 0.18386296486132778, -0.0984244305507413, 0.08083692674658129, 0.18432634925868893, 0.01670366904498743, 0.12435873220009463, 0.07477220587898045, 0.12587629393341818, 0.05966373447112606, -0.032010766907062914, -0.002945645772186773, -0.3630513429109539, -0.2212087937896805, -0.17149071972420252, 0.15522268494325026, -0.12561601789181753, -0.23000662313508136, 0.3077590159938804, -0.02000369673062648, 0.315198944455811, 0.08512588594374912, 0.24335201574223383, 0.03777995390617954, 0.00879507970863155, 0.12431848710402846, 0.17886113421991467, 0.1424118102162278, -0.039872902871242594, -0.11467734958444323, 0.01702359154421304, 0.17567930838891438] |
1,802.09659 | Semantic segmentation of trajectories with agent models | In many cases, such as trajectories clustering and classification, we often
divide a trajectory into segments as preprocessing. In this paper, we propose a
trajectory semantic segmentation method based on learned behavior models. In
the proposed method, we learn some behavior models from video sequences. Next,
using learned behavior models and a hidden Markov model, we segment a
trajectory into semantic segments. Comparing with the Ramer-Douglas-Peucker
algorithm, we show the effectiveness of the proposed method.
| cs.CV | in many cases such as trajectories clustering and classification we often divide a trajectory into segments as preprocessing in this paper we propose a trajectory semantic segmentation method based on learned behavior models in the proposed method we learn some behavior models from video sequences next using learned behavior models and a hidden markov model we segment a trajectory into semantic segments comparing with the ramerdouglaspeucker algorithm we show the effectiveness of the proposed method | [['in', 'many', 'cases', 'such', 'as', 'trajectories', 'clustering', 'and', 'classification', 'we', 'often', 'divide', 'a', 'trajectory', 'into', 'segments', 'as', 'preprocessing', 'in', 'this', 'paper', 'we', 'propose', 'a', 'trajectory', 'semantic', 'segmentation', 'method', 'based', 'on', 'learned', 'behavior', 'models', 'in', 'the', 'proposed', 'method', 'we', 'learn', 'some', 'behavior', 'models', 'from', 'video', 'sequences', 'next', 'using', 'learned', 'behavior', 'models', 'and', 'a', 'hidden', 'markov', 'model', 'we', 'segment', 'a', 'trajectory', 'into', 'semantic', 'segments', 'comparing', 'with', 'the', 'ramerdouglaspeucker', 'algorithm', 'we', 'show', 'the', 'effectiveness', 'of', 'the', 'proposed', 'method']] | [-0.02369236043729895, -0.02580238746579837, -0.1455841676860645, 0.06653107807663194, -0.07360888584642797, -0.13340943760389612, 0.040393112993459344, 0.493762572874894, -0.29663924027762906, -0.3154606607717437, 0.06359191821114085, -0.2712667235802557, -0.25496171925821015, 0.18111749575788005, -0.11001380132133695, 0.10922154643245645, 0.14715758278160482, 0.07988404715433717, -0.0395205069106777, -0.23903475037297686, 0.2907105637840121, -0.02627125702093582, 0.32757687291784865, -0.04667341517838272, 0.16406119017031146, 0.001190677341828878, -0.007117884466424584, 0.05571587131367237, -0.09344498489077228, 0.14629798291905508, 0.2601981865704934, 0.23650170801635328, 0.3194544490149899, -0.3908733924901163, -0.24133956671465892, 0.117284505546244, 0.1954716495741662, 0.1363262329502283, -0.04331145009711838, -0.3905225170751077, 0.06991160599942747, -0.1442712885956909, 0.01947818824870361, -0.12976187045962825, -0.07973925657947925, 0.008146221721167298, -0.25716631726135275, 0.013688051601167064, 0.08342795670535919, 0.02781076871513112, -0.12125159878082373, -0.054093945533905584, 0.03515507114698758, 0.17804949914382115, 0.06664284517378169, 0.013742077674062268, 0.11373568077672373, -0.15257109608815833, -0.17484662852979996, 0.36712486286823814, -0.07730738389481967, -0.2570419248729957, 0.16278027355784197, -0.02496860868524055, -0.19474978172975416, 0.1011385607306619, 0.2632737736142165, 0.16110077533065467, -0.14741821242244663, -0.005536116758751607, -0.044991505181265844, 0.18368753765684528, 0.023304475685329857, -0.059604960367889016, 0.1946386843668045, 0.2835709063738987, -0.00378792142067608, 0.17827600036980584, -0.1624470623556172, -0.09357399266917964, -0.2646121319156845, -0.12347809018919596, -0.1813252258894814, -0.07934592386103563, -0.10853124452665183, -0.16056490075602228, 0.455217513142506, 0.2680755369239361, 0.30977825098041745, 0.13288806606637868, 0.35453734098858125, 0.021598014525905554, 0.052260741064438246, 0.10970177785241725, 0.09121111678659627, -0.02200162656152168, 0.10598062222345254, -0.15473258914111332, 0.09782095719128847, 0.1647472077653416] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.