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.0246 | Upscaling Singular Sources in Weighted Sobolev Spaces by Sub-Grid
Corrections | In this paper, we develop a numerical multiscale method to solve elliptic
boundary value problems with heterogeneous diffusion coefficients and with
singular source terms. When the diffusion coefficient is heterogeneous, this
adds to the computational costs, and this difficulty is compounded by a
singular source term. For singular source terms, the solution does not belong
to the Sobolev space $H^1$, but to the space $W^{1,p}$ for some $p<2$. Hence,
the problem may be reformulated in a distance-weighted Sobolev space. Using
this formulation, we develop a method to upscale the multiscale coefficient
near the singular sources by incorporating corrections into the coarse-grid.
Using a sub-grid correction method, we correct the basis functions in a
distance-weighted Sobolev space and show that these corrections can be
truncated to design a computationally efficient scheme with optimal convergence
rates. Due to the nature of the formulation in weighted spaces, the variational
form must be posed on the cross product of complementary spaces. Thus, two such
sub-grid corrections must be computed, one for each multiscale space of the
cross product. A key ingredient of this method is the use of
quasi-interpolation operators to construct the fine scale spaces. Therefore, we
develop a weighted projective quasi-interpolation that can be used for a
general class of Muckenhoupt weight functions. We verify the optimal
convergence of the method in some numerical examples with singular point
sources and line fractures, and with oscillatory and heterogeneous diffusion
coefficients.
| math.NA | in this paper we develop a numerical multiscale method to solve elliptic boundary value problems with heterogeneous diffusion coefficients and with singular source terms when the diffusion coefficient is heterogeneous this adds to the computational costs and this difficulty is compounded by a singular source term for singular source terms the solution does not belong to the sobolev space h1 but to the space w1p for some p2 hence the problem may be reformulated in a distanceweighted sobolev space using this formulation we develop a method to upscale the multiscale coefficient near the singular sources by incorporating corrections into the coarsegrid using a subgrid correction method we correct the basis functions in a distanceweighted sobolev space and show that these corrections can be truncated to design a computationally efficient scheme with optimal convergence rates due to the nature of the formulation in weighted spaces the variational form must be posed on the cross product of complementary spaces thus two such subgrid corrections must be computed one for each multiscale space of the cross product a key ingredient of this method is the use of quasiinterpolation operators to construct the fine scale spaces therefore we develop a weighted projective quasiinterpolation that can be used for a general class of muckenhoupt weight functions we verify the optimal convergence of the method in some numerical examples with singular point sources and line fractures and with oscillatory and heterogeneous diffusion coefficients | [['in', 'this', 'paper', 'we', 'develop', 'a', 'numerical', 'multiscale', 'method', 'to', 'solve', 'elliptic', 'boundary', 'value', 'problems', 'with', 'heterogeneous', 'diffusion', 'coefficients', 'and', 'with', 'singular', 'source', 'terms', 'when', 'the', 'diffusion', 'coefficient', 'is', 'heterogeneous', 'this', 'adds', 'to', 'the', 'computational', 'costs', 'and', 'this', 'difficulty', 'is', 'compounded', 'by', 'a', 'singular', 'source', 'term', 'for', 'singular', 'source', 'terms', 'the', 'solution', 'does', 'not', 'belong', 'to', 'the', 'sobolev', 'space', 'h1', 'but', 'to', 'the', 'space', 'w1p', 'for', 'some', 'p2', 'hence', 'the', 'problem', 'may', 'be', 'reformulated', 'in', 'a', 'distanceweighted', 'sobolev', 'space', 'using', 'this', 'formulation', 'we', 'develop', 'a', 'method', 'to', 'upscale', 'the', 'multiscale', 'coefficient', 'near', 'the', 'singular', 'sources', 'by', 'incorporating', 'corrections', 'into', 'the', 'coarsegrid', 'using', 'a', 'subgrid', 'correction', 'method', 'we', 'correct', 'the', 'basis', 'functions', 'in', 'a', 'distanceweighted', 'sobolev', 'space', 'and', 'show', 'that', 'these', 'corrections', 'can', 'be', 'truncated', 'to', 'design', 'a', 'computationally', 'efficient', 'scheme', 'with', 'optimal', 'convergence', 'rates', 'due', 'to', 'the', 'nature', 'of', 'the', 'formulation', 'in', 'weighted', 'spaces', 'the', 'variational', 'form', 'must', 'be', 'posed', 'on', 'the', 'cross', 'product', 'of', 'complementary', 'spaces', 'thus', 'two', 'such', 'subgrid', 'corrections', 'must', 'be', 'computed', 'one', 'for', 'each', 'multiscale', 'space', 'of', 'the', 'cross', 'product', 'a', 'key', 'ingredient', 'of', 'this', 'method', 'is', 'the', 'use', 'of', 'quasiinterpolation', 'operators', 'to', 'construct', 'the', 'fine', 'scale', 'spaces', 'therefore', 'we', 'develop', 'a', 'weighted', 'projective', 'quasiinterpolation', 'that', 'can', 'be', 'used', 'for', 'a', 'general', 'class', 'of', 'muckenhoupt', 'weight', 'functions', 'we', 'verify', 'the', 'optimal', 'convergence', 'of', 'the', 'method', 'in', 'some', 'numerical', 'examples', 'with', 'singular', 'point', 'sources', 'and', 'line', 'fractures', 'and', 'with', 'oscillatory', 'and', 'heterogeneous', 'diffusion', 'coefficients']] | [-0.06970771048159068, 0.04379900691850024, -0.07933492415470665, 0.09015395926932494, -0.10083720114038872, -0.11275898682971323, 0.001433306956714813, 0.36334214414536703, -0.32927627588390423, -0.22384361151354348, 0.1429842414696925, -0.23426378011027596, -0.14195479381876655, 0.20032577040872462, -0.0864317542126693, 0.08848609692045735, 0.07489580189060609, -0.018919827848798615, -0.0969963688776683, -0.25541678257090067, 0.3942410946010223, 0.034413572514767635, 0.23151624391743528, 0.059885028784088634, 0.11880156610805526, -0.036064883808012, -0.039687285649704154, 0.04076363761820398, -0.14035510526949643, 0.1804017100786743, 0.27902912293297516, 0.054912152640199295, 0.31754842678768724, -0.39073238676641814, -0.231437020074529, 0.1509102161665239, 0.1492422288976303, 0.08034556543941802, 0.004249185682785254, -0.25576165249229327, 0.07757875986420844, -0.14193677873928337, -0.1468457686970254, -0.12511415088466735, -0.033163903251620414, 0.013091938245578822, -0.3481175184848164, 0.0908448052502194, 0.020857095743926392, -0.015605545154760909, -0.09884447147303461, -0.08504681225683351, 0.02866354297192272, 0.0857142072623126, 0.011913178168838443, 0.04196395281159991, 0.06728236885929975, -0.08558018697062969, -0.08901109160729664, 0.38000142202272474, -0.05442460030680797, -0.3071836397004656, 0.1216445472287918, -0.1091434896013892, -0.12896806274183126, 0.13969137587580627, 0.19696514029203194, 0.15086586027748033, -0.12166608694700361, 0.09223377711742818, -0.01093625705954442, 0.1414845580494725, 0.03834634779103666, 0.012334758301122106, 0.10098841860261648, 0.1218803036566981, 0.11607538799942915, 0.12065740442640278, -0.07253001735030913, -0.08611503487009799, -0.34271327123234546, -0.17093447074741086, -0.1790439357533108, 0.045036306740376675, -0.15295150364566898, -0.20399005816245397, 0.35682343014958695, 0.1279540425839437, 0.19389673445264727, 0.07262072158890938, 0.2697618193688649, 0.1539722794916418, 0.06655888682165485, 0.10923862824892382, 0.18540267600851792, 0.11021695839032876, 0.10605969194142062, -0.19423798554113236, 0.060530643915695646, 0.19054274968626095] |
1,802.02461 | Rotation of the photospheric magnetic field through solar cycles 21, 22,
23 | Rotation of the large scale solar magnetic field has a great importance for
the understanding of solar dynamic, for the search of longitidinal structure
and for the study of solar-terrestrial relations. 30-year long observations
taken at the Wilcox Solar Observatory (USA) in 21-23 cycles have been analysed
carefully to deduce magnetic field rotation rate at different latitudes in both
hemispheres and its variability in time. The WSO data appear to indicate that
additionally to the differential rotation along the latitudes there are running
waves of fast rotation of the magnetic field. These torsional waves are running
from the poles to the equator with a period of 11 years. The rotation of the
magnetic field (RMF) is almost rigid at latitudes above 55 degrees in both
hemispheres. The rotation rate in the sub-polar regions is slower when the
magnetic field is strong there (during minima of solar activity), and faster
when the magnetic field changes polarity (during maxima of solar activity).
| astro-ph.SR physics.geo-ph physics.plasm-ph | rotation of the large scale solar magnetic field has a great importance for the understanding of solar dynamic for the search of longitidinal structure and for the study of solarterrestrial relations 30year long observations taken at the wilcox solar observatory usa in 2123 cycles have been analysed carefully to deduce magnetic field rotation rate at different latitudes in both hemispheres and its variability in time the wso data appear to indicate that additionally to the differential rotation along the latitudes there are running waves of fast rotation of the magnetic field these torsional waves are running from the poles to the equator with a period of 11 years the rotation of the magnetic field rmf is almost rigid at latitudes above 55 degrees in both hemispheres the rotation rate in the subpolar regions is slower when the magnetic field is strong there during minima of solar activity and faster when the magnetic field changes polarity during maxima of solar activity | [['rotation', 'of', 'the', 'large', 'scale', 'solar', 'magnetic', 'field', 'has', 'a', 'great', 'importance', 'for', 'the', 'understanding', 'of', 'solar', 'dynamic', 'for', 'the', 'search', 'of', 'longitidinal', 'structure', 'and', 'for', 'the', 'study', 'of', 'solarterrestrial', 'relations', '30year', 'long', 'observations', 'taken', 'at', 'the', 'wilcox', 'solar', 'observatory', 'usa', 'in', '2123', 'cycles', 'have', 'been', 'analysed', 'carefully', 'to', 'deduce', 'magnetic', 'field', 'rotation', 'rate', 'at', 'different', 'latitudes', 'in', 'both', 'hemispheres', 'and', 'its', 'variability', 'in', 'time', 'the', 'wso', 'data', 'appear', 'to', 'indicate', 'that', 'additionally', 'to', 'the', 'differential', 'rotation', 'along', 'the', 'latitudes', 'there', 'are', 'running', 'waves', 'of', 'fast', 'rotation', 'of', 'the', 'magnetic', 'field', 'these', 'torsional', 'waves', 'are', 'running', 'from', 'the', 'poles', 'to', 'the', 'equator', 'with', 'a', 'period', 'of', '11', 'years', 'the', 'rotation', 'of', 'the', 'magnetic', 'field', 'rmf', 'is', 'almost', 'rigid', 'at', 'latitudes', 'above', '55', 'degrees', 'in', 'both', 'hemispheres', 'the', 'rotation', 'rate', 'in', 'the', 'subpolar', 'regions', 'is', 'slower', 'when', 'the', 'magnetic', 'field', 'is', 'strong', 'there', 'during', 'minima', 'of', 'solar', 'activity', 'and', 'faster', 'when', 'the', 'magnetic', 'field', 'changes', 'polarity', 'during', 'maxima', 'of', 'solar', 'activity']] | [-0.18530382490101852, 0.2199212600354035, -0.016120801342990976, 0.0861741165160465, -0.04309867839065363, -0.01289840793360095, 0.012200812810633637, 0.3833998841520563, -0.2385348003685662, -0.3881122744612911, 0.10832511547068976, -0.22608086272031538, -0.09017079943240439, 0.2453488330898584, -0.024733187408558437, -0.04254786283657857, 0.04393616138881295, 0.055696992672183226, -0.028949806653379585, -0.20640543341320358, 0.2072780846673761, 0.08642989571598715, 0.23773295671456499, -0.010882097952442724, 0.0878287856913693, -0.06996630703841494, -0.0030879735334925704, 0.02586533091142305, -0.08247574529656884, 0.0387345594497205, 0.20394668165805205, 0.09232327696990292, 0.21260167637974633, -0.47587988537050924, -0.19056805902096274, 0.03516972659788323, 0.1066606007106368, 0.053109352635776146, -0.042677696259236904, -0.2426322212196746, 0.04398366016388502, -0.05588237904949383, -0.1674241668532995, 0.0073559074157427224, 0.1083487186481321, 0.04888786064935321, -0.25711189206790636, 0.07708575363262152, 0.02167219761466174, 0.2141234297656788, -0.1263588061270673, -0.1037140448765138, -0.08891743120778375, 0.15391552562766075, 0.1802857491208252, 0.11594277104427277, 0.14264563472836084, -0.11847780753108643, -0.07387280477351456, 0.3264769270207803, -0.09262384962196807, -0.029436591003711026, 0.17092065039894738, -0.29196514314005395, -0.14310157016716288, 0.20379642492054767, 0.20750620658362998, 0.09666108666280718, -0.11442602294736612, 0.06153705626991197, -0.017967318360395026, 0.13278131697139461, 0.09863124165168535, -0.019889939283518673, 0.295828381752443, 0.12251893431241126, 0.07593078399077058, 0.05698081702557715, -0.23842819872950702, -0.10201176082270232, -0.2125562578322565, -0.10381853399262324, -0.07034718189842461, 0.016828090259981044, -0.11121806810522501, -0.13255301622509863, 0.4571373744973175, 0.12780377899337583, 0.1702215241344423, -0.004425677110634322, 0.29524911084911953, 0.08066945161477153, 0.11637708777973631, 0.1371721607492358, 0.36608525690089605, 0.18980680309446915, 0.20757431968015694, -0.26132688041829133, 0.04526594668332452, 0.01958869967562785] |
1,802.02462 | Systematic Analysis of Low/Hard State RXTE Spectra of GX 339-4 to
Constrain the Geometry of the System | One of the popular models for the low/hard state of Black Hole Binaries is
that the standard accretion disk is truncated and the hot inner region produces
via Comptonization, the hard X-ray flux. This is supported by the value of the
high energy photon index, which is often found to be small $\sim$ 1.7 ($<$ 2)
implying that the hot medium is seed photons starved. On the other hand, the
suggestive presence of a broad relativistic Fe line during the hard state would
suggest that the accretion disk is not truncated but extends all the way to the
inner most stable circle orbit. In such a case, it is a puzzle why the hot
medium would remain photon starved. The broad Fe line should be accompanied by
a broad smeared reflection hump at $\sim$ 30 keV and it may be that this
additional component makes the spectrum hard and the intrinsic photon index is
larger, i.e. $>$ 2. This would mean that the medium is not photon deficient,
reconciling the presence of a broad Fe line in the observed hard state. To test
this hypothesis, we have analyzed the RXTE observations of GX 339-4 from the
four outbursts during 2002-2011 and identify the observations when the system
was in the hard state and showed a broad Fe line. We have then attempted to fit
these observations with models, which include smeared reflection to understand
whether the intrinsic photon index can indeed be large. We find that, while for
some observations the inclusion of reflection does increase the photon index,
there are hard state observations with broad Fe line that have photon indices
less than 2.
| astro-ph.HE | one of the popular models for the lowhard state of black hole binaries is that the standard accretion disk is truncated and the hot inner region produces via comptonization the hard xray flux this is supported by the value of the high energy photon index which is often found to be small sim 17 2 implying that the hot medium is seed photons starved on the other hand the suggestive presence of a broad relativistic fe line during the hard state would suggest that the accretion disk is not truncated but extends all the way to the inner most stable circle orbit in such a case it is a puzzle why the hot medium would remain photon starved the broad fe line should be accompanied by a broad smeared reflection hump at sim 30 kev and it may be that this additional component makes the spectrum hard and the intrinsic photon index is larger ie 2 this would mean that the medium is not photon deficient reconciling the presence of a broad fe line in the observed hard state to test this hypothesis we have analyzed the rxte observations of gx 3394 from the four outbursts during 20022011 and identify the observations when the system was in the hard state and showed a broad fe line we have then attempted to fit these observations with models which include smeared reflection to understand whether the intrinsic photon index can indeed be large we find that while for some observations the inclusion of reflection does increase the photon index there are hard state observations with broad fe line that have photon indices less than 2 | [['one', 'of', 'the', 'popular', 'models', 'for', 'the', 'lowhard', 'state', 'of', 'black', 'hole', 'binaries', 'is', 'that', 'the', 'standard', 'accretion', 'disk', 'is', 'truncated', 'and', 'the', 'hot', 'inner', 'region', 'produces', 'via', 'comptonization', 'the', 'hard', 'xray', 'flux', 'this', 'is', 'supported', 'by', 'the', 'value', 'of', 'the', 'high', 'energy', 'photon', 'index', 'which', 'is', 'often', 'found', 'to', 'be', 'small', 'sim', '17', '2', 'implying', 'that', 'the', 'hot', 'medium', 'is', 'seed', 'photons', 'starved', 'on', 'the', 'other', 'hand', 'the', 'suggestive', 'presence', 'of', 'a', 'broad', 'relativistic', 'fe', 'line', 'during', 'the', 'hard', 'state', 'would', 'suggest', 'that', 'the', 'accretion', 'disk', 'is', 'not', 'truncated', 'but', 'extends', 'all', 'the', 'way', 'to', 'the', 'inner', 'most', 'stable', 'circle', 'orbit', 'in', 'such', 'a', 'case', 'it', 'is', 'a', 'puzzle', 'why', 'the', 'hot', 'medium', 'would', 'remain', 'photon', 'starved', 'the', 'broad', 'fe', 'line', 'should', 'be', 'accompanied', 'by', 'a', 'broad', 'smeared', 'reflection', 'hump', 'at', 'sim', '30', 'kev', 'and', 'it', 'may', 'be', 'that', 'this', 'additional', 'component', 'makes', 'the', 'spectrum', 'hard', 'and', 'the', 'intrinsic', 'photon', 'index', 'is', 'larger', 'ie', '2', 'this', 'would', 'mean', 'that', 'the', 'medium', 'is', 'not', 'photon', 'deficient', 'reconciling', 'the', 'presence', 'of', 'a', 'broad', 'fe', 'line', 'in', 'the', 'observed', 'hard', 'state', 'to', 'test', 'this', 'hypothesis', 'we', 'have', 'analyzed', 'the', 'rxte', 'observations', 'of', 'gx', '3394', 'from', 'the', 'four', 'outbursts', 'during', '20022011', 'and', 'identify', 'the', 'observations', 'when', 'the', 'system', 'was', 'in', 'the', 'hard', 'state', 'and', 'showed', 'a', 'broad', 'fe', 'line', 'we', 'have', 'then', 'attempted', 'to', 'fit', 'these', 'observations', 'with', 'models', 'which', 'include', 'smeared', 'reflection', 'to', 'understand', 'whether', 'the', 'intrinsic', 'photon', 'index', 'can', 'indeed', 'be', 'large', 'we', 'find', 'that', 'while', 'for', 'some', 'observations', 'the', 'inclusion', 'of', 'reflection', 'does', 'increase', 'the', 'photon', 'index', 'there', 'are', 'hard', 'state', 'observations', 'with', 'broad', 'fe', 'line', 'that', 'have', 'photon', 'indices', 'less', 'than', '2']] | [-0.0643216547353241, 0.1533353883976069, -0.06322621758822557, 0.09985046830725934, -0.09190376656515449, -0.1552721682736384, 0.03080875401115625, 0.4500584302422328, -0.2076955713121043, -0.3395617625884193, 0.11044182794061132, -0.3174128073230113, -0.013833744531572411, 0.17854362080405012, -0.02804790953937116, -0.01665253189926278, 0.04287076063092539, -0.029268063472638474, -0.03516998644252973, -0.18818899004757678, 0.314184454877796, 0.0846406469913029, 0.1957284739452513, 0.05389694994163696, 0.022440128998946905, -0.02234799536490888, -0.019760972859453916, 0.019310560665901873, -0.05157880114754231, 0.06656379680935594, 0.2386284706778127, 0.09126184656495406, 0.21502630584856203, -0.3588199757633137, -0.24900834453987272, 0.09275956692058088, 0.14818588201994512, 0.029965674589923667, -0.00908406382859872, -0.20342437669740573, 0.07794067316373893, -0.19607834220904816, -0.15429933621435538, 0.013087381228408862, 0.03632739036524798, -0.025901141450458954, -0.21640361549209927, 0.08485332586492954, 0.06792549942722442, -0.017112185970467306, -0.08408169250992031, -0.0552148596761448, -0.05049762085605508, 0.049116193455786376, 0.08973480294110601, 0.03538428515540402, 0.1521971565927123, -0.1233585865429565, -0.07968628435329987, 0.37159080842966996, -0.05736170325970026, -0.05063771912845145, 0.2007447268895723, -0.21476824852235396, -0.14462535297446935, 0.24081457909810675, 0.09195430011867167, 0.12290423725400762, -0.08953883274546406, 0.030593161473093676, -0.0784502624561362, 0.2772197045194797, 0.027032188018749813, 0.02831145258101843, 0.30063351471618416, 0.072883705239685, 0.007241955745944773, 0.13885499235611892, -0.18215368782688657, -0.05620865012099455, -0.26481032471518773, -0.11927322388691453, -0.14851663188860434, 0.09587776003972177, -0.10335275416036227, -0.16691824489174198, 0.34894989586977676, 0.09942296295104405, 0.2393228362029548, -0.03462324672525292, 0.28559277284610673, 0.1663405048787157, 0.06138257636269043, 0.13673272443723766, 0.32321759522348836, 0.11451668070540541, 0.12033119846916597, -0.2051636866437128, 0.07906202538000358, -0.025136827979059445] |
1,802.02463 | Second order differentiation formula on $RCD^*(K,N)$ spaces | Aim of this paper is to prove the second order differentiation formula for
$H^{2,2}$ functions along geodesics in $RCD^*(K,N)$ spaces with $N < \infty$.
This formula is new even in the context of Alexandrov spaces, where second
order differentiation is typically related to semiconvexity.
We establish this result by showing that $W_2$-geodesics can be approximated
up to second order, in a sense which we shall make precise, by entropic
interpolation. In turn this is achieved by proving new, even in the smooth
setting, estimates concerning entropic interpolations which we believe are
interesting on their own. In particular we obtain:
- equiboundedness of the densities along the entropic interpolations,
- local equi-Lipschitz continuity of the Schr\"odinger potentials,
- a uniform weighted $L^2$ control of the Hessian of such potentials.
Finally, the techniques adopted in this paper can be used to show that in the
$RCD$ setting the viscous solution of the Hamilton-Jacobi equation can be
obtained via a vanishing viscosity method, in accordance with the smooth case.
With respect to a previous version, where the space was assumed to be
compact, in this paper the second order differentiation formula is proved in
full generality.
| math.AP | aim of this paper is to prove the second order differentiation formula for h22 functions along geodesics in rcdkn spaces with n infty this formula is new even in the context of alexandrov spaces where second order differentiation is typically related to semiconvexity we establish this result by showing that w_2geodesics can be approximated up to second order in a sense which we shall make precise by entropic interpolation in turn this is achieved by proving new even in the smooth setting estimates concerning entropic interpolations which we believe are interesting on their own in particular we obtain equiboundedness of the densities along the entropic interpolations local equilipschitz continuity of the schrodinger potentials a uniform weighted l2 control of the hessian of such potentials finally the techniques adopted in this paper can be used to show that in the rcd setting the viscous solution of the hamiltonjacobi equation can be obtained via a vanishing viscosity method in accordance with the smooth case with respect to a previous version where the space was assumed to be compact in this paper the second order differentiation formula is proved in full generality | [['aim', 'of', 'this', 'paper', 'is', 'to', 'prove', 'the', 'second', 'order', 'differentiation', 'formula', 'for', 'h22', 'functions', 'along', 'geodesics', 'in', 'rcdkn', 'spaces', 'with', 'n', 'infty', 'this', 'formula', 'is', 'new', 'even', 'in', 'the', 'context', 'of', 'alexandrov', 'spaces', 'where', 'second', 'order', 'differentiation', 'is', 'typically', 'related', 'to', 'semiconvexity', 'we', 'establish', 'this', 'result', 'by', 'showing', 'that', 'w_2geodesics', 'can', 'be', 'approximated', 'up', 'to', 'second', 'order', 'in', 'a', 'sense', 'which', 'we', 'shall', 'make', 'precise', 'by', 'entropic', 'interpolation', 'in', 'turn', 'this', 'is', 'achieved', 'by', 'proving', 'new', 'even', 'in', 'the', 'smooth', 'setting', 'estimates', 'concerning', 'entropic', 'interpolations', 'which', 'we', 'believe', 'are', 'interesting', 'on', 'their', 'own', 'in', 'particular', 'we', 'obtain', 'equiboundedness', 'of', 'the', 'densities', 'along', 'the', 'entropic', 'interpolations', 'local', 'equilipschitz', 'continuity', 'of', 'the', 'schrodinger', 'potentials', 'a', 'uniform', 'weighted', 'l2', 'control', 'of', 'the', 'hessian', 'of', 'such', 'potentials', 'finally', 'the', 'techniques', 'adopted', 'in', 'this', 'paper', 'can', 'be', 'used', 'to', 'show', 'that', 'in', 'the', 'rcd', 'setting', 'the', 'viscous', 'solution', 'of', 'the', 'hamiltonjacobi', 'equation', 'can', 'be', 'obtained', 'via', 'a', 'vanishing', 'viscosity', 'method', 'in', 'accordance', 'with', 'the', 'smooth', 'case', 'with', 'respect', 'to', 'a', 'previous', 'version', 'where', 'the', 'space', 'was', 'assumed', 'to', 'be', 'compact', 'in', 'this', 'paper', 'the', 'second', 'order', 'differentiation', 'formula', 'is', 'proved', 'in', 'full', 'generality']] | [-0.09697922779509718, 0.06960911393423189, -0.10643958910417921, 0.07884180926447833, -0.0791403760866044, -0.08775498730407909, 0.016816989153975302, 0.34974294269774503, -0.2907281339817502, -0.24197109761936442, 0.11970709617549376, -0.23320488159995564, -0.15496902916322838, 0.18348425330019535, -0.14244443878526503, 0.05064467907922857, 0.03249309002421796, 0.06336526646764275, -0.0907822950926431, -0.26713753305375576, 0.35788194808187557, -0.003469122373102669, 0.2082530161232113, 0.07215563408495422, 0.06825772841322295, -0.023035118813958377, -0.010617380743187436, 0.04008522939337591, -0.16720703081514232, 0.18458496411504383, 0.24866994704535364, 0.04986326374792236, 0.2928121284398429, -0.39669720657625573, -0.20324838456222194, 0.1426611213444514, 0.1544213300655061, 0.09014226242706695, -0.019230853325930088, -0.2665980336778956, 0.11020467240868652, -0.14138716919486352, -0.17654229001825714, -0.11333478171938158, -0.008520271963479513, 0.0569645934112796, -0.30308061785639284, 0.08962989241340534, 0.10384271886265352, 0.005402526070185481, -0.09329119102690032, -0.053063014040433586, 0.011061167847266065, 0.07872572582106087, 0.04910286586171888, 0.08770877178516882, 0.032194642662169766, -0.06676343848998163, -0.08949294403391057, 0.3734788182439243, -0.08341362187545995, -0.2615467508216983, 0.14736138992606007, -0.16331255741348055, -0.13045903539750725, 0.06812417423451676, 0.1437387483174655, 0.1770248641132252, -0.14641976830589168, 0.11496495143659016, -0.020513681411257687, 0.12754989194961147, 0.10625156767894217, -0.0061957181197283984, 0.09159047992781122, 0.10451124156850014, 0.13843920573770524, 0.16171502078477135, -0.006984913150827584, -0.10437674451795248, -0.3513185653954427, -0.2118148985715147, -0.19623775913583194, 0.06391684242222022, -0.10693495158115997, -0.13076957076926657, 0.33132903804157937, 0.13155392053824394, 0.20068876605550262, 0.10328253458298624, 0.27005521279383216, 0.17523880875446496, 0.03110900900618946, 0.0582990607548941, 0.24084120618360255, 0.139466836243531, 0.10229558983887051, -0.14415617608415715, 0.07246203999223307, 0.16697906173438706] |
1,802.02464 | Improved Time of Arrival measurement model for non-convex optimization
with noisy data | The quadratic system provided by the Time of Arrival technique can be solved
analytical or by optimization algorithms. In real environments the measurements
are always corrupted by noise. This measurement noise effects the analytical
solution more than non-linear optimization algorithms. On the other hand it is
also true that local optimization tends to find the local minimum, instead of
the global minimum. This article presents an approach how this risk can be
significantly reduced in noisy environments. The main idea of our approach is
to transform the local minimum to a saddle point, by increasing the number of
dimensions.
| eess.SP | the quadratic system provided by the time of arrival technique can be solved analytical or by optimization algorithms in real environments the measurements are always corrupted by noise this measurement noise effects the analytical solution more than nonlinear optimization algorithms on the other hand it is also true that local optimization tends to find the local minimum instead of the global minimum this article presents an approach how this risk can be significantly reduced in noisy environments the main idea of our approach is to transform the local minimum to a saddle point by increasing the number of dimensions | [['the', 'quadratic', 'system', 'provided', 'by', 'the', 'time', 'of', 'arrival', 'technique', 'can', 'be', 'solved', 'analytical', 'or', 'by', 'optimization', 'algorithms', 'in', 'real', 'environments', 'the', 'measurements', 'are', 'always', 'corrupted', 'by', 'noise', 'this', 'measurement', 'noise', 'effects', 'the', 'analytical', 'solution', 'more', 'than', 'nonlinear', 'optimization', 'algorithms', 'on', 'the', 'other', 'hand', 'it', 'is', 'also', 'true', 'that', 'local', 'optimization', 'tends', 'to', 'find', 'the', 'local', 'minimum', 'instead', 'of', 'the', 'global', 'minimum', 'this', 'article', 'presents', 'an', 'approach', 'how', 'this', 'risk', 'can', 'be', 'significantly', 'reduced', 'in', 'noisy', 'environments', 'the', 'main', 'idea', 'of', 'our', 'approach', 'is', 'to', 'transform', 'the', 'local', 'minimum', 'to', 'a', 'saddle', 'point', 'by', 'increasing', 'the', 'number', 'of', 'dimensions']] | [-0.11821954129522459, 0.056533798967127104, -0.1067389308808917, 0.06794942702952246, -0.04719322266038319, -0.14425279523217768, 0.057023440431239025, 0.3456132334558237, -0.31742426206480073, -0.3349748827855695, 0.1401623269364313, -0.25072421120348, -0.21209411448893148, 0.19300983145461428, -0.10688017966282187, 0.06427517418062897, 0.06288061062382026, 0.019793075083689105, -0.06876275711869256, -0.3052985208071392, 0.29305599857535625, 0.0927599591645177, 0.2591094585474242, -0.00919359652419584, 0.056399689239421576, 0.008327547740661587, -0.013965455231943516, 0.06019353082949164, -0.06871773496147003, 0.11819519672655698, 0.2463537823371213, 0.16253546298472116, 0.324673812911667, -0.4316180544068115, -0.21475149959212902, 0.15268213178661436, 0.15835786197390972, 0.1288904163779484, -0.02265824594448504, -0.2805808213906306, 0.10687162648684186, -0.10097748656390292, -0.10152159288826615, -0.06144199739539563, -0.025817610305790422, 0.013101457495882053, -0.28982113170992546, 0.07972643527436314, 0.042542758477720044, 0.003822284045092987, -0.05923346907895228, -0.1063292745648968, 0.02336953860952171, 0.08961802834851874, 0.054095202819397205, 0.04996034594704256, 0.15771948299229596, -0.10100748390194518, -0.10050883654956565, 0.350347580755073, -0.050201759612066625, -0.24582267670323038, 0.1738316627275763, -0.10639714280312712, -0.0877384466784677, 0.1753368398193458, 0.18746587918657395, 0.13017857058745141, -0.19258726801196432, 0.07178739084852766, -0.023876090811546704, 0.1667637640643851, 0.007716182827469752, -0.006787249181099763, 0.13887253453287135, 0.13741811084551642, 0.18934488641756653, 0.14165647537035944, -0.04996453097496991, -0.07717908127468569, -0.2646764621815898, -0.10634472176921789, -0.23708987548345267, 0.020962128372195018, -0.12543207154882074, -0.11613321674968859, 0.38312342646296577, 0.20721897018151453, 0.1844103429560559, 0.07170012443222934, 0.3930992534139542, 0.18327150387087404, 0.03055354604742142, 0.0832569205032831, 0.22438427746634593, 0.06210327497213101, 0.08347427010573823, -0.24726458587166336, 0.09907635563815181, 0.05135947226951219] |
1,802.02465 | Phantom fluid supporting traversable wormholes in alternative gravity
with extra material terms | Wormholes are tunnels connecting different regions in space-time. They were
obtained originally as a solution for Einstein's General Relativity theory and
according to this theory they need to be filled by an exotic kind of
anisotropic matter. In the present sense, by "exotic matter" we mean matter
that does not satisfy the energy conditions. In this article we propose the
modelling of wormholes within an alternative gravity theory that proposes an
extra material (rather than geometrical) term in its gravitational action. Our
solutions are obtained from well-known particular cases of the wormhole metric
potentials, named redshift and shape functions, and yield the wormholes to be
filled by a phantom fluid, that is, a fluid with equation of state parameter
$\omega<-1$. In possession of the solutions for the wormhole material content,
we also apply the energy conditions to them. The features of those are
carefully discussed.
| gr-qc | wormholes are tunnels connecting different regions in spacetime they were obtained originally as a solution for einsteins general relativity theory and according to this theory they need to be filled by an exotic kind of anisotropic matter in the present sense by exotic matter we mean matter that does not satisfy the energy conditions in this article we propose the modelling of wormholes within an alternative gravity theory that proposes an extra material rather than geometrical term in its gravitational action our solutions are obtained from wellknown particular cases of the wormhole metric potentials named redshift and shape functions and yield the wormholes to be filled by a phantom fluid that is a fluid with equation of state parameter omega1 in possession of the solutions for the wormhole material content we also apply the energy conditions to them the features of those are carefully discussed | [['wormholes', 'are', 'tunnels', 'connecting', 'different', 'regions', 'in', 'spacetime', 'they', 'were', 'obtained', 'originally', 'as', 'a', 'solution', 'for', 'einsteins', 'general', 'relativity', 'theory', 'and', 'according', 'to', 'this', 'theory', 'they', 'need', 'to', 'be', 'filled', 'by', 'an', 'exotic', 'kind', 'of', 'anisotropic', 'matter', 'in', 'the', 'present', 'sense', 'by', 'exotic', 'matter', 'we', 'mean', 'matter', 'that', 'does', 'not', 'satisfy', 'the', 'energy', 'conditions', 'in', 'this', 'article', 'we', 'propose', 'the', 'modelling', 'of', 'wormholes', 'within', 'an', 'alternative', 'gravity', 'theory', 'that', 'proposes', 'an', 'extra', 'material', 'rather', 'than', 'geometrical', 'term', 'in', 'its', 'gravitational', 'action', 'our', 'solutions', 'are', 'obtained', 'from', 'wellknown', 'particular', 'cases', 'of', 'the', 'wormhole', 'metric', 'potentials', 'named', 'redshift', 'and', 'shape', 'functions', 'and', 'yield', 'the', 'wormholes', 'to', 'be', 'filled', 'by', 'a', 'phantom', 'fluid', 'that', 'is', 'a', 'fluid', 'with', 'equation', 'of', 'state', 'parameter', 'omega1', 'in', 'possession', 'of', 'the', 'solutions', 'for', 'the', 'wormhole', 'material', 'content', 'we', 'also', 'apply', 'the', 'energy', 'conditions', 'to', 'them', 'the', 'features', 'of', 'those', 'are', 'carefully', 'discussed']] | [-0.1258955683816096, 0.11530866746676299, -0.138055670095993, 0.09971950612560813, -0.105969488887309, -0.15011453733233543, -0.025035655191007616, 0.3390001066896165, -0.21161850637210342, -0.3191179819822568, 0.06783796590512041, -0.2794421071828953, -0.13155036411922552, 0.13019327248751733, -0.08416039183382587, 0.025312761627217947, -0.008557165953619727, 0.03485096366112602, -0.059485783991439, -0.22162073942479388, 0.3959561125134471, 0.07078424012449024, 0.23816385624512773, 0.004767668064571275, 0.07655451274958663, -0.0681809687151991, 0.010556937853709376, 0.0819673821495034, -0.19506751275857195, 0.061287956122822805, 0.23128076934030858, 0.12698146854687867, 0.2209850809183614, -0.46330738606509464, -0.2640988832050613, 0.09412059210529872, 0.12674528870346216, 0.14572413604192694, -0.08521926651391651, -0.31859074654378766, 0.0784015271258701, -0.1972441762063556, -0.17837370938525118, -0.07488400763350314, 0.00881871473493761, 0.00513918019574264, -0.195552934825035, 0.0923016769086926, 0.026228712757663995, -0.04653587045372817, -0.145154321957219, -0.06567461220386984, 0.010279246700670699, 0.04998841061224711, 0.08876255758845343, 0.006867410306786669, 0.1183209517232046, -0.17311787626802408, -0.06271220538845479, 0.4074957597165786, -0.05570873793200509, -0.2675778044901531, 0.15895025890946773, -0.10878310971411652, -0.08077220572800986, 0.1066727485186581, 0.11137475380352858, 0.148468541501668, -0.16345953326993462, 0.10850700463593842, -0.01677267761451417, 0.14625592912579405, 0.09636856552438232, 0.027794958184200243, 0.2711897497547084, 0.08913155691858766, 0.022934537306267384, 0.12032844477397357, -0.0055808103532963916, -0.10173718298881732, -0.37466684341478834, -0.17395754242637035, -0.14675302440782304, 0.030227417262885237, -0.10951803699426818, -0.17093555853734244, 0.35330953543748833, 0.10581381606130764, 0.13137691327017442, 0.008520222537155295, 0.246074911181269, 0.07250395350174271, 0.033246677044522145, 0.0887816855137975, 0.30616462115069915, 0.08771869265153233, 0.12850237347281956, -0.1429721827345804, 0.005436261929571628, 0.06017753720636768] |
1,802.02466 | Three Random Intercepts of a Segment | We construct random triangles via uniform sampling of certain families of
lines in the plane. Two examples are given. The word "uniform" turns out to be
vague; two competing models are examined. Everything we write is well-known to
experts. Which model is more appropriate? Our hope is to engage a larger
audience in answering this question.
| math.HO | we construct random triangles via uniform sampling of certain families of lines in the plane two examples are given the word uniform turns out to be vague two competing models are examined everything we write is wellknown to experts which model is more appropriate our hope is to engage a larger audience in answering this question | [['we', 'construct', 'random', 'triangles', 'via', 'uniform', 'sampling', 'of', 'certain', 'families', 'of', 'lines', 'in', 'the', 'plane', 'two', 'examples', 'are', 'given', 'the', 'word', 'uniform', 'turns', 'out', 'to', 'be', 'vague', 'two', 'competing', 'models', 'are', 'examined', 'everything', 'we', 'write', 'is', 'wellknown', 'to', 'experts', 'which', 'model', 'is', 'more', 'appropriate', 'our', 'hope', 'is', 'to', 'engage', 'a', 'larger', 'audience', 'in', 'answering', 'this', 'question']] | [-0.11513381007950686, 0.1440988987534573, -0.0507981896516867, 0.15194749328657053, -0.17700497885899885, -0.1782159327246648, 0.05373569705989212, 0.44227143445667544, -0.2725580942683986, -0.27335224444479017, 0.0663256439604863, -0.30115759638803347, -0.11994676972140692, 0.1940123040528436, -0.10447484362936978, -0.0053638734638557905, 0.04039828953266676, 0.0288060919182109, -0.028562815893175348, -0.36266291106585413, 0.321871708962135, 0.00029681237979925105, 0.25744118889062, 0.009595802651477112, 0.03619129143355947, -0.04789869171301169, -0.058968815262362896, 0.020831182166667923, -0.14561392900733544, 0.14578599998328304, 0.32414154307460713, 0.16605997433985717, 0.3261608768786703, -0.37021613609977067, -0.18837537892561937, 0.12959827431352874, 0.1313170200280313, 0.14137622411154943, 0.02045241674594373, -0.2766968281939626, 0.11273183830780908, -0.14261743808414654, -0.1098204165131652, -0.1095828665420413, -0.014386370179376431, 0.02016380918212235, -0.2693853929771909, -0.026590784088641937, 0.12787582958948665, 0.0734986136833738, 0.03879400776765708, -0.0863154627399386, 0.02718851644229809, 0.1296794447449169, 0.0575668049797449, 0.050508266630848606, 0.09000301737770704, -0.11115399767628073, -0.11472012771160475, 0.3929847847404225, 0.008256338278962565, -0.2728686745602837, 0.19756916548275122, -0.11153629393915512, -0.11884241019808021, 0.08177579780541626, 0.13129202091866837, 0.1268036085613338, -0.17625061307002657, 0.04863099782128951, -0.1180504935494225, 0.153465503161507, 0.11498742164777857, -0.06069627016300468, 0.22927771718241274, 0.12986697049512128, 0.06812672986416146, 0.18548672778810474, 0.031043516596712704, -0.1666669820718068, -0.24484751462296117, -0.11297668747803462, -0.13872494722558518, 0.05820892828134155, -0.07731357333250344, -0.18456047071543122, 0.3768718482294519, 0.1884035731532744, 0.20740571395227952, 0.03741131408813609, 0.22478697678473378, 0.10005137674618579, 0.01931107459988977, 0.05730080012498157, 0.15196419711823442, 0.07550170538680893, 0.02807579136320523, -0.03176862034264819, 0.04398640447574768, 0.07191661947373566] |
1,802.02467 | Mixtures of Factor Analyzers with Fundamental Skew Symmetric
Distributions | Mixtures of factor analyzers (MFA) provide a powerful tool for modelling
high-dimensional datasets. In recent years, several generalizations of MFA have
been developed where the normality assumption of the factors and/or of the
errors was relaxed to allow for skewness in the data. However, due to the form
of the adopted component densities, the distribution of the factors/errors in
most of these models is typically limited to modelling skewness oncentrated in
a single direction. Here, we introduce a more flexible finite mixture of factor
analyzers based on the class of scale mixtures of canonical fundamental skew
normal (SMCFUSN) distributions. This very general class of skew distributions
can capture various types of skewness and asymmetry in the data. In particular,
the proposed mixture model of SMCFUSN factor analyzers(SMCFUSNFA) can
simultaneously accommodate multiple directions of skewness. As such, it
encapsulates many commonly used models as special and/or limiting cases, such
as models of some versions of skew normal and skew t-factor analyzers, and skew
hyperbolic factor analyzers. For illustration, we focus on the t-distribution
member of the class of SMCFUSN distributions, leading to mixtures of canonical
fundamental skew t-factor analyzers (CFUSTFA). Parameter estimation can be
carried out by maximum likelihood via an EM-type algorithm. The usefulness and
potential of the proposed model are demonstrated using two real datasets.
| stat.ME | mixtures of factor analyzers mfa provide a powerful tool for modelling highdimensional datasets in recent years several generalizations of mfa have been developed where the normality assumption of the factors andor of the errors was relaxed to allow for skewness in the data however due to the form of the adopted component densities the distribution of the factorserrors in most of these models is typically limited to modelling skewness oncentrated in a single direction here we introduce a more flexible finite mixture of factor analyzers based on the class of scale mixtures of canonical fundamental skew normal smcfusn distributions this very general class of skew distributions can capture various types of skewness and asymmetry in the data in particular the proposed mixture model of smcfusn factor analyzerssmcfusnfa can simultaneously accommodate multiple directions of skewness as such it encapsulates many commonly used models as special andor limiting cases such as models of some versions of skew normal and skew tfactor analyzers and skew hyperbolic factor analyzers for illustration we focus on the tdistribution member of the class of smcfusn distributions leading to mixtures of canonical fundamental skew tfactor analyzers cfustfa parameter estimation can be carried out by maximum likelihood via an emtype algorithm the usefulness and potential of the proposed model are demonstrated using two real datasets | [['mixtures', 'of', 'factor', 'analyzers', 'mfa', 'provide', 'a', 'powerful', 'tool', 'for', 'modelling', 'highdimensional', 'datasets', 'in', 'recent', 'years', 'several', 'generalizations', 'of', 'mfa', 'have', 'been', 'developed', 'where', 'the', 'normality', 'assumption', 'of', 'the', 'factors', 'andor', 'of', 'the', 'errors', 'was', 'relaxed', 'to', 'allow', 'for', 'skewness', 'in', 'the', 'data', 'however', 'due', 'to', 'the', 'form', 'of', 'the', 'adopted', 'component', 'densities', 'the', 'distribution', 'of', 'the', 'factorserrors', 'in', 'most', 'of', 'these', 'models', 'is', 'typically', 'limited', 'to', 'modelling', 'skewness', 'oncentrated', 'in', 'a', 'single', 'direction', 'here', 'we', 'introduce', 'a', 'more', 'flexible', 'finite', 'mixture', 'of', 'factor', 'analyzers', 'based', 'on', 'the', 'class', 'of', 'scale', 'mixtures', 'of', 'canonical', 'fundamental', 'skew', 'normal', 'smcfusn', 'distributions', 'this', 'very', 'general', 'class', 'of', 'skew', 'distributions', 'can', 'capture', 'various', 'types', 'of', 'skewness', 'and', 'asymmetry', 'in', 'the', 'data', 'in', 'particular', 'the', 'proposed', 'mixture', 'model', 'of', 'smcfusn', 'factor', 'analyzerssmcfusnfa', 'can', 'simultaneously', 'accommodate', 'multiple', 'directions', 'of', 'skewness', 'as', 'such', 'it', 'encapsulates', 'many', 'commonly', 'used', 'models', 'as', 'special', 'andor', 'limiting', 'cases', 'such', 'as', 'models', 'of', 'some', 'versions', 'of', 'skew', 'normal', 'and', 'skew', 'tfactor', 'analyzers', 'and', 'skew', 'hyperbolic', 'factor', 'analyzers', 'for', 'illustration', 'we', 'focus', 'on', 'the', 'tdistribution', 'member', 'of', 'the', 'class', 'of', 'smcfusn', 'distributions', 'leading', 'to', 'mixtures', 'of', 'canonical', 'fundamental', 'skew', 'tfactor', 'analyzers', 'cfustfa', 'parameter', 'estimation', 'can', 'be', 'carried', 'out', 'by', 'maximum', 'likelihood', 'via', 'an', 'emtype', 'algorithm', 'the', 'usefulness', 'and', 'potential', 'of', 'the', 'proposed', 'model', 'are', 'demonstrated', 'using', 'two', 'real', 'datasets']] | [-0.03774110792163004, 0.07924773870207609, -0.09021201548781597, 0.09867635744850081, -0.06296959319942684, -0.14105354923258517, -0.007963186114552026, 0.3745303958443538, -0.262436913357683, -0.2975372763170492, 0.10102094979166, -0.22411078387840633, -0.11485704535811718, 0.22639186726004448, -0.04962593622292603, 0.08785507197432518, 0.0016884317834101581, -0.0042207835236386364, -0.08664459162276406, -0.22215356526760174, 0.33339651588917235, 0.07050008018487924, 0.32585724950811984, 0.003776952613338406, 0.09609009431705828, 0.022438681049641432, -0.07468312026335383, 0.037963611163634614, -0.08052104287110884, 0.13158286675230935, 0.23449021510084592, 0.13959163829205418, 0.2547269641731444, -0.37072143975188426, -0.24440133380527906, 0.16557327848925027, 0.1326145025319969, 0.06368050258345836, -0.01569201859222991, -0.24239671227131215, 0.03759773645342991, -0.22675733246735102, -0.12351094228808575, -0.13131033949266224, 0.01856341371246842, 0.059825971621014, -0.28347534478975916, 0.10976496856343353, 0.07631592921152676, 0.07485583791166614, 0.0076454013974827555, -0.190114993063342, 0.03901931347230994, 0.0792828941594739, 0.07253806071162645, -0.05914889940967836, 0.09959982378701547, -0.153023063164547, -0.1046272175049383, 0.37966479196757924, -0.08295423208070339, -0.24521465552970767, 0.16309164564854484, -0.12200513558862028, -0.16112414228659616, 0.09449132848124653, 0.22228915217076647, 0.12806335893291584, -0.15890453750583924, 0.06618511704903729, -0.05188083231782997, 0.13243458300108477, 0.05544394893211506, -0.019360582989734983, 0.18930246768396278, 0.15408451269481788, -0.003619110558504889, 0.1731130276144403, -0.1457706371581463, -0.11463947931770235, -0.2594895975091517, -0.1392781990393557, -0.13237927645392153, -0.004062495406339261, -0.13941556214380194, -0.20118164026149865, 0.3975640648991344, 0.13257254979832378, 0.19802159641184053, 0.020317941585573245, 0.26742276277959803, 0.09545952068473748, 0.09129186342843755, 0.049114614933781886, 0.15557865549457142, 0.16838237301573894, 0.01277691729032909, -0.13035278776792353, 0.13588389367104578, -0.0128103079096379] |
1,802.02468 | Efficient Learning of Bounded-Treewidth Bayesian Networks from Complete
and Incomplete Data Sets | Learning a Bayesian networks with bounded treewidth is important for reducing
the complexity of the inferences. We present a novel anytime algorithm (k-MAX)
method for this task, which scales up to thousands of variables. Through
extensive experiments we show that it consistently yields higher-scoring
structures than its competitors on complete data sets. We then consider the
problem of structure learning from incomplete data sets. This can be addressed
by structural EM, which however is computationally very demanding. We thus
adopt the novel k-MAX algorithm in the maximization step of structural EM,
obtaining an efficient computation of the expected sufficient statistics. We
test the resulting structural EM method on the task of imputing missing data,
comparing it against the state-of-the-art approach based on random forests. Our
approach achieves the same imputation accuracy of the competitors, but in about
one tenth of the time. Furthermore we show that it has worst-case complexity
linear in the input size, and that it is easily parallelizable.
| cs.AI | learning a bayesian networks with bounded treewidth is important for reducing the complexity of the inferences we present a novel anytime algorithm kmax method for this task which scales up to thousands of variables through extensive experiments we show that it consistently yields higherscoring structures than its competitors on complete data sets we then consider the problem of structure learning from incomplete data sets this can be addressed by structural em which however is computationally very demanding we thus adopt the novel kmax algorithm in the maximization step of structural em obtaining an efficient computation of the expected sufficient statistics we test the resulting structural em method on the task of imputing missing data comparing it against the stateoftheart approach based on random forests our approach achieves the same imputation accuracy of the competitors but in about one tenth of the time furthermore we show that it has worstcase complexity linear in the input size and that it is easily parallelizable | [['learning', 'a', 'bayesian', 'networks', 'with', 'bounded', 'treewidth', 'is', 'important', 'for', 'reducing', 'the', 'complexity', 'of', 'the', 'inferences', 'we', 'present', 'a', 'novel', 'anytime', 'algorithm', 'kmax', 'method', 'for', 'this', 'task', 'which', 'scales', 'up', 'to', 'thousands', 'of', 'variables', 'through', 'extensive', 'experiments', 'we', 'show', 'that', 'it', 'consistently', 'yields', 'higherscoring', 'structures', 'than', 'its', 'competitors', 'on', 'complete', 'data', 'sets', 'we', 'then', 'consider', 'the', 'problem', 'of', 'structure', 'learning', 'from', 'incomplete', 'data', 'sets', 'this', 'can', 'be', 'addressed', 'by', 'structural', 'em', 'which', 'however', 'is', 'computationally', 'very', 'demanding', 'we', 'thus', 'adopt', 'the', 'novel', 'kmax', 'algorithm', 'in', 'the', 'maximization', 'step', 'of', 'structural', 'em', 'obtaining', 'an', 'efficient', 'computation', 'of', 'the', 'expected', 'sufficient', 'statistics', 'we', 'test', 'the', 'resulting', 'structural', 'em', 'method', 'on', 'the', 'task', 'of', 'imputing', 'missing', 'data', 'comparing', 'it', 'against', 'the', 'stateoftheart', 'approach', 'based', 'on', 'random', 'forests', 'our', 'approach', 'achieves', 'the', 'same', 'imputation', 'accuracy', 'of', 'the', 'competitors', 'but', 'in', 'about', 'one', 'tenth', 'of', 'the', 'time', 'furthermore', 'we', 'show', 'that', 'it', 'has', 'worstcase', 'complexity', 'linear', 'in', 'the', 'input', 'size', 'and', 'that', 'it', 'is', 'easily', 'parallelizable']] | [-0.0706531490010093, 0.010423135691326024, -0.09687882078578695, 0.09057555227846023, -0.10154989228467456, -0.12013512687117327, 0.08863902304728981, 0.42585535696707666, -0.28379233558662237, -0.341652402584441, 0.11157511975397938, -0.23371973769972101, -0.1736440284163109, 0.2043013667251216, -0.07510189282747888, 0.08954074990142544, 0.14218068377522286, 0.050264050710393346, -0.04645690463803476, -0.3345860124216415, 0.2720874553429894, 0.08490648368024267, 0.29833540572581113, 0.009852484083967283, 0.13266790497509645, 0.0037894511042395607, -0.03318989421095466, 0.06589209257290349, -0.08703985076931531, 0.16529273035339428, 0.2608706797764171, 0.23114941340463702, 0.32370860947848995, -0.39483069138368593, -0.18396645116736182, 0.10658075629908126, 0.11511401747120545, 0.1297513257843093, -0.014200250671183311, -0.2627542890564655, 0.12314076564071001, -0.128842874529073, -0.017885561921866612, -0.1460790554410778, -0.02585669587715529, -0.03710331048714579, -0.2942535374360887, 0.08811860362620791, 0.06105261464836076, 0.02744457135850098, -0.02467878691095393, -0.13993460833880816, 0.038925692411430644, 0.10057201317686122, 0.03135801898242789, 0.02556079304777086, 0.08317577697744127, -0.1282951116008917, -0.13518461018975358, 0.377767120662611, -0.03356153541726599, -0.19742689909217007, 0.17180616598488996, -0.07758703143626917, -0.1741317888328922, 0.13504705662926425, 0.19611701902613277, 0.16764523856691085, -0.13251949092991708, 0.06808350866594992, -0.06005755756050348, 0.18903301014361204, 0.02161462950753048, -0.007333598041441292, 0.10895491259288974, 0.24782290168950566, 0.11171406761277466, 0.16586183470717514, -0.07786357606237289, -0.06630920122406678, -0.22864766443381085, -0.11608396774390713, -0.2351078025822062, 4.973578033968806e-05, -0.1448381688270274, -0.1772718198655639, 0.39439746071584525, 0.24167865394992988, 0.21392410174012183, 0.1348567206543521, 0.3650783648925426, 0.0742574584834074, 0.06881313563062577, 0.1295449063727574, 0.1909172179410234, 0.04968677071883576, 0.06860559228844068, -0.19682975534087746, 0.12435983977629803, 0.02788651600594676] |
1,802.02469 | A complete framework for linear filtering of bivariate signals | A complete framework for the linear time-invariant (LTI) filtering theory of
bivariate signals is proposed based on a tailored quaternion Fourier transform.
This framework features a direct description of LTI filters in terms of their
eigenproperties enabling compact calculus and physically interpretable
filtering relations in the frequency domain. The design of filters exhibiting
fondamental properties of polarization optics (birefringence, diattenuation) is
straightforward. It yields an efficient spectral synthesis method and new
insights on Wiener filtering for bivariate signals with prescribed
frequency-dependent polarization properties. This generic framework facilitates
original descriptions of bivariate signals in two components with specific
geometric or statistical properties. Numerical experiments support our
theoretical analysis and illustrate the relevance of the approach on synthetic
data.
| eess.SP | a complete framework for the linear timeinvariant lti filtering theory of bivariate signals is proposed based on a tailored quaternion fourier transform this framework features a direct description of lti filters in terms of their eigenproperties enabling compact calculus and physically interpretable filtering relations in the frequency domain the design of filters exhibiting fondamental properties of polarization optics birefringence diattenuation is straightforward it yields an efficient spectral synthesis method and new insights on wiener filtering for bivariate signals with prescribed frequencydependent polarization properties this generic framework facilitates original descriptions of bivariate signals in two components with specific geometric or statistical properties numerical experiments support our theoretical analysis and illustrate the relevance of the approach on synthetic data | [['a', 'complete', 'framework', 'for', 'the', 'linear', 'timeinvariant', 'lti', 'filtering', 'theory', 'of', 'bivariate', 'signals', 'is', 'proposed', 'based', 'on', 'a', 'tailored', 'quaternion', 'fourier', 'transform', 'this', 'framework', 'features', 'a', 'direct', 'description', 'of', 'lti', 'filters', 'in', 'terms', 'of', 'their', 'eigenproperties', 'enabling', 'compact', 'calculus', 'and', 'physically', 'interpretable', 'filtering', 'relations', 'in', 'the', 'frequency', 'domain', 'the', 'design', 'of', 'filters', 'exhibiting', 'fondamental', 'properties', 'of', 'polarization', 'optics', 'birefringence', 'diattenuation', 'is', 'straightforward', 'it', 'yields', 'an', 'efficient', 'spectral', 'synthesis', 'method', 'and', 'new', 'insights', 'on', 'wiener', 'filtering', 'for', 'bivariate', 'signals', 'with', 'prescribed', 'frequencydependent', 'polarization', 'properties', 'this', 'generic', 'framework', 'facilitates', 'original', 'descriptions', 'of', 'bivariate', 'signals', 'in', 'two', 'components', 'with', 'specific', 'geometric', 'or', 'statistical', 'properties', 'numerical', 'experiments', 'support', 'our', 'theoretical', 'analysis', 'and', 'illustrate', 'the', 'relevance', 'of', 'the', 'approach', 'on', 'synthetic', 'data']] | [-0.08380099974620418, 0.0010375321133044334, -0.15266962899452347, 0.03169399796404008, -0.15772600131284478, -0.13498235264251757, -0.013723669729880096, 0.42131174616038036, -0.2805749933776629, -0.2597221007777585, 0.0945160700312744, -0.22223937331547594, -0.23631976088946766, 0.24137211585234308, -0.05920125780483851, 0.10834695540495917, 0.02826996085544427, -0.02166573803585309, -0.09769027633194485, -0.1651577593631342, 0.24906935296857205, 0.05462678216206722, 0.33956055713292116, -0.05362277219975447, 0.13318734965187648, 0.06998316392811954, -0.12716084707162192, -0.026023339309021194, -0.08809535408344789, 0.15001859158898392, 0.2781494245187849, 0.1677369754602257, 0.2445719285836268, -0.38301484802594554, -0.2436497348687078, 0.060001878175311364, 0.07394893046938138, 0.06783907113867438, -0.08406993377014485, -0.32469709983302486, 0.03437569957926997, -0.11577494260974419, -0.09645255494257833, -0.14398311996139967, -0.013010277434721844, 0.03159377595377911, -0.3335034726068186, 0.0841046086190125, 0.1071097682007294, 0.10576265199412392, -0.06138788345946461, -0.1171238458611899, 0.023541369612734668, 0.04868267102636652, -0.0650322742632821, -0.07945094308935297, 0.10736758911854818, -0.08188351632382435, -0.16073840356861743, 0.3338130498822365, -0.05635564556170223, -0.2568481400545336, 0.17001571955406067, -0.10329249635752705, -0.12665262784705394, 0.1411232930313573, 0.21723578425729248, 0.12989949501063833, -0.17861274539385563, 0.07233982351578724, -0.010006022695292775, 0.1944323318461195, 0.027808316071860045, 0.09384122443122742, 0.21186157421041757, 0.19365070295534056, 0.03967084344589643, 0.14535891549247834, -0.05618876320883059, -0.07220009129303388, -0.2927395548302338, -0.12174186825704499, -0.17884059894420049, -0.029110203746857487, -0.16636145158119114, -0.18142669892304727, 0.47012341982470107, 0.1421766350719666, 0.1528289988796171, 0.07248357827297579, 0.35016200019635707, 0.13033112195324406, 0.0244523589215719, 0.002101347423516787, 0.1747685492110367, 0.20432171760461268, 0.08176280013046777, -0.20515475616766474, 0.0394931465624155, 0.04110825576015517] |
1,802.0247 | On the gaps between consecutive primes | Let $p_n$ denote the $n$-th prime. For any $m\geq 1$, there exist infinitely
many $n$ such that $p_{n}-p_{n-m}\leq C_m$ for some large constant $C_m>0$, and
$$p_{n+1}-p_n\geq \frac{c_m\log n\log\log n\log\log\log\log n}{\log\log\log n},
$$ for some small constant $c_m>0$. Furthermore, we also obtain a related
result concerning the least primes in arithmetic progressions.
| math.NT math.CO | let p_n denote the nth prime for any mgeq 1 there exist infinitely many n such that p_np_nmleq c_m for some large constant c_m0 and p_n1p_ngeq fracc_mlog nloglog nloglogloglog nlogloglog n for some small constant c_m0 furthermore we also obtain a related result concerning the least primes in arithmetic progressions | [['let', 'p_n', 'denote', 'the', 'nth', 'prime', 'for', 'any', 'mgeq', '1', 'there', 'exist', 'infinitely', 'many', 'n', 'such', 'that', 'p_np_nmleq', 'c_m', 'for', 'some', 'large', 'constant', 'c_m0', 'and', 'p_n1p_ngeq', 'fracc_mlog', 'nloglog', 'nloglogloglog', 'nlogloglog', 'n', 'for', 'some', 'small', 'constant', 'c_m0', 'furthermore', 'we', 'also', 'obtain', 'a', 'related', 'result', 'concerning', 'the', 'least', 'primes', 'in', 'arithmetic', 'progressions']] | [-0.2912159398926989, 0.1933438186938672, -0.0022686006015409594, 0.07065065539158556, 0.021811899648088474, -0.25663551112191507, 0.005797374598762911, 0.26861741916155035, -0.2733765238815028, -0.26199320080163685, 0.06339603124702674, -0.3584201872024847, -0.11301989404930045, 0.223958326442896, -0.09442129689673691, 0.02598783933132401, 0.021025615379862164, 0.1336388511826163, 0.026571732717971114, -0.3391655374156392, 0.24987206794321537, -0.15291986875640956, 0.06258201492828844, 0.07375818506166663, 0.08232516013895688, -0.011399316378747639, 0.06605468586127719, -0.025756784998204395, -0.26494389293166815, 0.045741416038135474, 0.32286868753600056, 0.11640925460454563, 0.3369222285995341, -0.3977780057846204, -0.09448867420787396, 0.32765280707415356, 0.24115413960332618, -0.05065157426440198, -0.043236068652375885, -0.11126836173681785, 0.21984685684108865, -0.10760161960902422, -0.1697591615780054, -0.077006538135364, 0.15816005214076975, 0.08257411942695794, -0.3233181754248622, -0.021919564688806018, 0.1332805554342011, 0.0978935502226586, -0.004209855622004556, -0.29080744722412655, 0.09342819059510594, 0.10223942998108333, 0.05434679211643727, 0.09805427031065135, -0.06869945512153208, -0.049574975369741085, -0.08329808934713187, 0.3393380084965864, -0.0638451220103256, -0.18541831134454065, 0.018962469356863396, -0.21877264308884903, -0.24502853796128993, 0.09982141850354231, 0.0588803230582372, 0.1662657916262422, 0.098907301992016, 0.24132445263144883, -0.18136328066010837, 0.21650163290779229, 0.2550342487697692, 0.03615295726036572, 0.03423193354240578, -0.024594888384656413, 0.11907893795717467, 0.06706166729007078, 0.038328846886187144, 0.0718457265858255, -0.38840094905184663, -0.18246455761887456, -0.24815523351097238, 0.22008437317107682, -0.265373205563304, -0.1829121448909459, 0.23952714432759778, 0.08387793335334762, 0.20530684919946868, 0.19778563825251616, 0.19525886938461792, 0.0523828473954421, 0.01695320988073945, 0.1764008667036567, -0.02680506549507339, 0.14798363725371336, -0.08340605587253104, -0.13249382033372176, 0.04198362244009648, 0.12685797499168827] |
1,802.02471 | Local Self-Energies for V and Pd Emergent from a Non-Local LDA+FLEX
Implementation | In the spirit of recently developed LDA+U and LDA+DMFT methods we implement a
combination of density functional theory in its local density approximation
(LDA) with a $k$- and $\omega -$dependent self-energy found from diagrammatic
fluctuational exchange (FLEX) approximation. The active Hilbert space here is
described by the correlated subset of electrons which allows to tremendously
reduce the sizes of matrices needed to represent charge and spin
susceptibilities. The method is perturbative in nature but accounts for both
bubble and ladder diagrams and accumulates the physics of momentum resolved
spin fluctuations missing in such popular approach as GW. As an application, we
study correlation effects on band structures in V and Pd. The d-electron
self-energies emergent from this calculation are found to be remarkably
k-independent. However, when we compare our calculated electronic mass
enhancements against LDA+DMFT, we find that for a long standing problem of spin
fluctuations in Pd, LDA+FLEX delivers a better agreement with experiment,
although this conclusion depends on a particular value of Hubbard $U$ used in
the simulation. We also discuss outcomes of recently proposed combinations of
k-dependent FLEX with DMFT.
| cond-mat.str-el cond-mat.mtrl-sci | in the spirit of recently developed ldau and ldadmft methods we implement a combination of density functional theory in its local density approximation lda with a k and omega dependent selfenergy found from diagrammatic fluctuational exchange flex approximation the active hilbert space here is described by the correlated subset of electrons which allows to tremendously reduce the sizes of matrices needed to represent charge and spin susceptibilities the method is perturbative in nature but accounts for both bubble and ladder diagrams and accumulates the physics of momentum resolved spin fluctuations missing in such popular approach as gw as an application we study correlation effects on band structures in v and pd the delectron selfenergies emergent from this calculation are found to be remarkably kindependent however when we compare our calculated electronic mass enhancements against ldadmft we find that for a long standing problem of spin fluctuations in pd ldaflex delivers a better agreement with experiment although this conclusion depends on a particular value of hubbard u used in the simulation we also discuss outcomes of recently proposed combinations of kdependent flex with dmft | [['in', 'the', 'spirit', 'of', 'recently', 'developed', 'ldau', 'and', 'ldadmft', 'methods', 'we', 'implement', 'a', 'combination', 'of', 'density', 'functional', 'theory', 'in', 'its', 'local', 'density', 'approximation', 'lda', 'with', 'a', 'k', 'and', 'omega', 'dependent', 'selfenergy', 'found', 'from', 'diagrammatic', 'fluctuational', 'exchange', 'flex', 'approximation', 'the', 'active', 'hilbert', 'space', 'here', 'is', 'described', 'by', 'the', 'correlated', 'subset', 'of', 'electrons', 'which', 'allows', 'to', 'tremendously', 'reduce', 'the', 'sizes', 'of', 'matrices', 'needed', 'to', 'represent', 'charge', 'and', 'spin', 'susceptibilities', 'the', 'method', 'is', 'perturbative', 'in', 'nature', 'but', 'accounts', 'for', 'both', 'bubble', 'and', 'ladder', 'diagrams', 'and', 'accumulates', 'the', 'physics', 'of', 'momentum', 'resolved', 'spin', 'fluctuations', 'missing', 'in', 'such', 'popular', 'approach', 'as', 'gw', 'as', 'an', 'application', 'we', 'study', 'correlation', 'effects', 'on', 'band', 'structures', 'in', 'v', 'and', 'pd', 'the', 'delectron', 'selfenergies', 'emergent', 'from', 'this', 'calculation', 'are', 'found', 'to', 'be', 'remarkably', 'kindependent', 'however', 'when', 'we', 'compare', 'our', 'calculated', 'electronic', 'mass', 'enhancements', 'against', 'ldadmft', 'we', 'find', 'that', 'for', 'a', 'long', 'standing', 'problem', 'of', 'spin', 'fluctuations', 'in', 'pd', 'ldaflex', 'delivers', 'a', 'better', 'agreement', 'with', 'experiment', 'although', 'this', 'conclusion', 'depends', 'on', 'a', 'particular', 'value', 'of', 'hubbard', 'u', 'used', 'in', 'the', 'simulation', 'we', 'also', 'discuss', 'outcomes', 'of', 'recently', 'proposed', 'combinations', 'of', 'kdependent', 'flex', 'with', 'dmft']] | [-0.10038079956679472, 0.10414049509667425, -0.09933535231707188, 0.1119271570453318, -0.025556840995265232, -0.09767716733104252, 0.0668378930115448, 0.3702747073167792, -0.24292124548426747, -0.2930667133832985, -0.006641746267732642, -0.32033992460860095, -0.15069828303223784, 0.1532375304022635, 0.027250422942605646, 0.021978885382810443, 0.015345733610217224, -0.009113839855622296, -0.14248392506180188, -0.21775301212219747, 0.28900021786422847, 0.048720431045864473, 0.26848251995461697, 0.08947557053697593, 0.05095307498525541, 0.07450373996699045, 0.005467762901949195, 0.08242949333338062, -0.11004750422160633, 0.09124604405791775, 0.2836407228669786, 0.004204503403833279, 0.25174957100598777, -0.4412519670255318, -0.21663137812904276, 0.008230669787255944, 0.1393764816834796, 0.14317765706257157, -0.04812533145893242, -0.2548855737793249, 0.039129452066045706, -0.2094211664503686, -0.13837986420277137, -0.1493967466803452, 0.011943644263358163, 0.00606208596286456, -0.27184402465994295, 0.12492018814021491, -0.012640316439101698, 0.014855944900773466, -0.07112695541134319, -0.15665644068772402, -0.038870628737680775, 0.06503500108486221, 0.04420805953706584, 0.06969712285330049, 0.11542324547318149, -0.09585716126353613, -0.11335094937777075, 0.3715311352081679, -0.08887882337260705, -0.16677125626509742, 0.15512782450161547, -0.16559691155319112, -0.11593377221296387, 0.11799853234065717, 0.12459827513193486, 0.10409386484668805, -0.13613547885940463, 0.12934458900085852, -0.013608916555812766, 0.18009282177145297, 0.01028608210553712, 0.06887721414590647, 0.17240487268625676, 0.1645240691723302, 0.037615024361882236, 0.09219941133147126, -0.10498907767328342, -0.1160507629942763, -0.25987979696019664, -0.10906839062930546, -0.20528540565187092, 0.03551513922994363, -0.06075972676930238, -0.2002397716604429, 0.4093977171009161, 0.19633404213863498, 0.17132387923910067, 0.00508416731199659, 0.2667605761581889, 0.13515831748788645, 0.06919819697645585, 0.0867953491397202, 0.22180894595426304, 0.17586767093846473, 0.06207149737043777, -0.271742997756279, 0.05770028798052898, 0.052189892643242614] |
1,802.02472 | Forceless Sadowsky strips are spherical | We show that thin rectangular ribbons, defined as energy-minimising
configurations of the Sadowsky functional for narrow developable elastic
strips, have a propensity to form spherical shapes in the sense that forceless
solutions lie on a sphere. This has implications for ribbonlike objects in
(bio)polymer physics and nanoscience that cannot be described by the classical
wormlike chain model. A wider class of functionals with this property is
identified.
| cond-mat.soft | we show that thin rectangular ribbons defined as energyminimising configurations of the sadowsky functional for narrow developable elastic strips have a propensity to form spherical shapes in the sense that forceless solutions lie on a sphere this has implications for ribbonlike objects in biopolymer physics and nanoscience that cannot be described by the classical wormlike chain model a wider class of functionals with this property is identified | [['we', 'show', 'that', 'thin', 'rectangular', 'ribbons', 'defined', 'as', 'energyminimising', 'configurations', 'of', 'the', 'sadowsky', 'functional', 'for', 'narrow', 'developable', 'elastic', 'strips', 'have', 'a', 'propensity', 'to', 'form', 'spherical', 'shapes', 'in', 'the', 'sense', 'that', 'forceless', 'solutions', 'lie', 'on', 'a', 'sphere', 'this', 'has', 'implications', 'for', 'ribbonlike', 'objects', 'in', 'biopolymer', 'physics', 'and', 'nanoscience', 'that', 'can', 'not', 'be', 'described', 'by', 'the', 'classical', 'wormlike', 'chain', 'model', 'a', 'wider', 'class', 'of', 'functionals', 'with', 'this', 'property', 'is', 'identified']] | [-0.1073768121927087, 0.12246662414452034, -0.0728503849545021, 0.0702792050980671, -0.07497714507157233, -0.1323064707233501, -0.04320830284659542, 0.43986766446215003, -0.2607482685533755, -0.2490485014199321, 0.0668978927771686, -0.21016631759147145, -0.18274654720478983, 0.202938345048938, -0.04297118228182558, 0.03266075708027651, 0.061530232971617534, -0.0313650604386105, -0.06234156449565163, -0.171165065812086, 0.2696699369003746, -0.013100322766868925, 0.2735427337795941, 0.02608858057951082, 0.04377656880376944, 0.009934130322827554, 0.10570367750948045, 0.11372304378327594, -0.19891221554237054, 0.11078892995728486, 0.26194277747687117, -0.006364401860802032, 0.2465668104644587, -0.42346081831283977, -0.26017159857889705, 0.08855875929011338, 0.1611863162451938, 0.05395852806352412, -0.03369875258675763, -0.2702818357788805, 0.1115829284205588, -0.16279118646408863, -0.1913469183786925, -0.05671072761013882, 0.049115425309360916, 0.07691577478631664, -0.17454847631326167, 0.05589185275637837, 0.1042656095128562, 0.043223637573198595, -0.07292940619109727, -0.0982958916505215, -0.03956739842516384, 0.04976145604124932, 0.032354692534070965, -0.007370125940208559, 0.17170163027858779, -0.12310573946657559, -0.10684490806784537, 0.394261352245265, -0.014524038894963799, -0.26632620102583443, 0.17196258299970138, -0.14264012135759885, -0.13217859584560146, 0.1489530304141009, 0.1383056215205188, 0.11702614554217947, -0.1341717995480815, 0.13806459403506902, -0.10981011563918984, 0.13234762538141057, 0.07949451139585963, -0.016227824808056675, 0.25120827911505056, 0.17689154350629716, 0.041403167648240924, 0.1618671604734498, -0.07372455626253539, -0.1089323125501622, -0.29787203237247556, -0.17429433061060176, -0.15741196996184872, 0.040637504549413825, -0.04902649093953607, -0.2883530800689512, 0.3582016790803494, 0.02296423183367972, 0.1847197875213712, 0.06495763487947076, 0.16070795948825664, 0.03732645440561725, 0.11870712082165835, 0.01567467425101951, 0.2378041144641144, 0.13234883859934313, 0.05546814113974383, -0.09308919355745858, 0.04870890472918304, 0.07689631276472068] |
1,802.02473 | Radiating solitary waves in coupled Boussinesq equations | In this paper we are consider radiating solitary wave solutions of coupled
regularised Boussinesq equations. This type of solution consists of a leading
solitary wave with a small-amplitude co-propagating oscillatory tail, and
emerges from a pure solitary wave solution of a symmetric reduction of the full
system. We construct an asymptotic solution, where the leading order
approximation in both components is obtained as a particular solution of the
regularised Boussinesq equations in the symmetric case. At the next order, the
system uncouples into two linear non-homogeneous ordinary differential
equations with variable coefficients, one correcting the localised part of the
solution, which we find analytically, and the other describing the
co-propagating oscillatory tail. This latter equation is a fourth-order
ordinary differential equation and is solved approximately by two different
methods, each exploiting the assumption that the leading solitary wave has a
small amplitude, and thus enabling an explicit estimate for the amplitude of
the oscillating tail. These estimates are compared with corresponding numerical
simulations.
| nlin.PS | in this paper we are consider radiating solitary wave solutions of coupled regularised boussinesq equations this type of solution consists of a leading solitary wave with a smallamplitude copropagating oscillatory tail and emerges from a pure solitary wave solution of a symmetric reduction of the full system we construct an asymptotic solution where the leading order approximation in both components is obtained as a particular solution of the regularised boussinesq equations in the symmetric case at the next order the system uncouples into two linear nonhomogeneous ordinary differential equations with variable coefficients one correcting the localised part of the solution which we find analytically and the other describing the copropagating oscillatory tail this latter equation is a fourthorder ordinary differential equation and is solved approximately by two different methods each exploiting the assumption that the leading solitary wave has a small amplitude and thus enabling an explicit estimate for the amplitude of the oscillating tail these estimates are compared with corresponding numerical simulations | [['in', 'this', 'paper', 'we', 'are', 'consider', 'radiating', 'solitary', 'wave', 'solutions', 'of', 'coupled', 'regularised', 'boussinesq', 'equations', 'this', 'type', 'of', 'solution', 'consists', 'of', 'a', 'leading', 'solitary', 'wave', 'with', 'a', 'smallamplitude', 'copropagating', 'oscillatory', 'tail', 'and', 'emerges', 'from', 'a', 'pure', 'solitary', 'wave', 'solution', 'of', 'a', 'symmetric', 'reduction', 'of', 'the', 'full', 'system', 'we', 'construct', 'an', 'asymptotic', 'solution', 'where', 'the', 'leading', 'order', 'approximation', 'in', 'both', 'components', 'is', 'obtained', 'as', 'a', 'particular', 'solution', 'of', 'the', 'regularised', 'boussinesq', 'equations', 'in', 'the', 'symmetric', 'case', 'at', 'the', 'next', 'order', 'the', 'system', 'uncouples', 'into', 'two', 'linear', 'nonhomogeneous', 'ordinary', 'differential', 'equations', 'with', 'variable', 'coefficients', 'one', 'correcting', 'the', 'localised', 'part', 'of', 'the', 'solution', 'which', 'we', 'find', 'analytically', 'and', 'the', 'other', 'describing', 'the', 'copropagating', 'oscillatory', 'tail', 'this', 'latter', 'equation', 'is', 'a', 'fourthorder', 'ordinary', 'differential', 'equation', 'and', 'is', 'solved', 'approximately', 'by', 'two', 'different', 'methods', 'each', 'exploiting', 'the', 'assumption', 'that', 'the', 'leading', 'solitary', 'wave', 'has', 'a', 'small', 'amplitude', 'and', 'thus', 'enabling', 'an', 'explicit', 'estimate', 'for', 'the', 'amplitude', 'of', 'the', 'oscillating', 'tail', 'these', 'estimates', 'are', 'compared', 'with', 'corresponding', 'numerical', 'simulations']] | [-0.1938408600281427, 0.0796061417959599, -0.10092817493314438, 0.05180159432562125, -0.05999546286655716, -0.1146731614820842, -0.059544967563874285, 0.27282074665396466, -0.26630269949741525, -0.22425004555929476, 0.13308897751963417, -0.3093323196088781, -0.15833052639039577, 0.15593646923251495, 0.049298512909355705, 0.08317672229869051, 0.0591396178958789, 0.036705955851571694, -0.08625413461279786, -0.170716596329499, 0.3368418460677555, -0.0223690330970781, 0.23908444109195673, -0.05425991495911238, 0.1486557748917193, -0.020050610975573764, -0.025089262393331785, 0.004639155537095721, -0.12962009311401737, 0.08336104226207212, 0.2342353637095975, 0.013803937049594027, 0.2723259630847288, -0.4544924760045929, -0.19508712025690664, 0.05932788055695799, 0.18013179991994213, 0.16801152514233797, -0.03886140409165685, -0.2755511686265857, 0.04504049846051158, -0.18333016420383166, -0.2407741828655904, -0.026198216836808102, 0.018613290001689656, 0.09759895356823375, -0.30258986548709177, 0.13434716748885034, 0.062022413092842496, -0.04023085936437578, -0.12164031689346659, -0.06891925667378297, -0.02101660758668294, 0.05158454960317814, 0.07730112315385093, -0.008477326016873121, 0.0011724656507761384, -0.16131453022097975, -0.05143253127630069, 0.3676158317758993, -0.12592791896056316, -0.2631128855746674, 0.15609524968977265, -0.12603986593237593, -0.03998904755379022, 0.19785902676303968, 0.17204606140809464, 0.15881570989581717, -0.14560774934872345, 0.07354608070008183, -0.05220780654723236, 0.16870295418500672, 0.146231540353066, -0.006022535013092076, 0.15789279829070796, 0.15320806684503846, 0.07792274831422638, 0.16243452969060046, -0.06850962397111066, -0.13035666416799135, -0.33270024183703345, -0.12119418069537431, -0.10698481776717296, 0.051454873439538765, -0.11868113276450123, -0.20154401801092311, 0.41851279458339596, 0.08962194275888015, 0.1237775907706058, 0.05220512398504338, 0.28242020143275975, 0.2616375344883982, -0.01428598868860606, 0.08517502628101116, 0.24762571212818468, 0.16308864983130086, 0.10759666922039415, -0.250019933378461, 0.018475885534419055, 0.10978600919386658] |
1,802.02474 | High-level python abstractions for optimal checkpointing in inversion
problems | Inversion and PDE-constrained optimization problems often rely on solving the
adjoint problem to calculate the gradient of the objec- tive function. This
requires storing large amounts of intermediate data, setting a limit to the
largest problem that might be solved with a given amount of memory available.
Checkpointing is an approach that can reduce the amount of memory required by
redoing parts of the computation instead of storing intermediate results. The
Revolve checkpointing algorithm o ers an optimal schedule that trades
computational cost for smaller memory footprints. Integrat- ing Revolve into a
modern python HPC code and combining it with code generation is not
straightforward. We present an API that makes checkpointing accessible from a
DSL-based code generation environment along with some initial performance gures
with a focus on seismic applications.
| cs.MS cs.CE | inversion and pdeconstrained optimization problems often rely on solving the adjoint problem to calculate the gradient of the objec tive function this requires storing large amounts of intermediate data setting a limit to the largest problem that might be solved with a given amount of memory available checkpointing is an approach that can reduce the amount of memory required by redoing parts of the computation instead of storing intermediate results the revolve checkpointing algorithm o ers an optimal schedule that trades computational cost for smaller memory footprints integrat ing revolve into a modern python hpc code and combining it with code generation is not straightforward we present an api that makes checkpointing accessible from a dslbased code generation environment along with some initial performance gures with a focus on seismic applications | [['inversion', 'and', 'pdeconstrained', 'optimization', 'problems', 'often', 'rely', 'on', 'solving', 'the', 'adjoint', 'problem', 'to', 'calculate', 'the', 'gradient', 'of', 'the', 'objec', 'tive', 'function', 'this', 'requires', 'storing', 'large', 'amounts', 'of', 'intermediate', 'data', 'setting', 'a', 'limit', 'to', 'the', 'largest', 'problem', 'that', 'might', 'be', 'solved', 'with', 'a', 'given', 'amount', 'of', 'memory', 'available', 'checkpointing', 'is', 'an', 'approach', 'that', 'can', 'reduce', 'the', 'amount', 'of', 'memory', 'required', 'by', 'redoing', 'parts', 'of', 'the', 'computation', 'instead', 'of', 'storing', 'intermediate', 'results', 'the', 'revolve', 'checkpointing', 'algorithm', 'o', 'ers', 'an', 'optimal', 'schedule', 'that', 'trades', 'computational', 'cost', 'for', 'smaller', 'memory', 'footprints', 'integrat', 'ing', 'revolve', 'into', 'a', 'modern', 'python', 'hpc', 'code', 'and', 'combining', 'it', 'with', 'code', 'generation', 'is', 'not', 'straightforward', 'we', 'present', 'an', 'api', 'that', 'makes', 'checkpointing', 'accessible', 'from', 'a', 'dslbased', 'code', 'generation', 'environment', 'along', 'with', 'some', 'initial', 'performance', 'gures', 'with', 'a', 'focus', 'on', 'seismic', 'applications']] | [-0.14138494504368282, 0.057402104760853945, -0.047163798750261776, 0.04911658187484136, -0.12360590509342728, -0.148931487576192, 0.07304591304819041, 0.3882805714602, -0.30898419562436175, -0.3589295310302987, 0.16315986376048386, -0.2392005549336318, -0.07759841896768194, 0.22973574498610105, -0.09193255001059697, 0.07880125382837377, 0.15791994186929514, -0.015374419468571432, -0.04381703527951686, -0.27641987908646115, 0.25620409755993023, 0.11182106275373371, 0.2669115441849499, 0.010072332890558755, 0.10594968966302076, 0.0018860564014175907, -0.03680914658798429, -0.03597199461728451, -0.03690480400587148, 0.175019773434542, 0.28174591736024013, 0.21685345525474986, 0.3402467851919937, -0.4697798824927304, -0.16362067607315112, 0.0793167608044314, 0.1564142290080781, 0.1344478132432414, -0.07059867586031032, -0.20730292905500391, 0.09143134765872674, -0.16959893459716113, -0.04779948460418382, -0.08491320969369553, 0.012759339744661702, -0.016275200123345712, -0.2906217350428051, -0.014046545098608476, 0.0038569260177609976, 0.03488806600762473, -0.05064458523338544, -0.12287138587271329, 0.011238714998398791, 0.11321862648037495, 0.01962821352390165, 0.030139385171423783, 0.124912574235168, -0.1159300968702155, -0.10520888290193398, 0.37988156163555686, -0.027193438786525803, -0.1947091840876567, 0.14870646295457846, -0.0023926169269543607, -0.13791664076052257, 0.14630876783485292, 0.21148254722356796, 0.1262058698303008, -0.14492851953036734, 0.1131997530856097, 0.012963747527464875, 0.22248366322310176, 0.038916280238481704, 0.02545310902860365, 0.17291496226607705, 0.1848244055727264, 0.10172316258467617, 0.1813071711521843, -0.04939947489037877, -0.10333172215905506, -0.25701433262292994, -0.15127576749000582, -0.22383558910223655, 0.005569241047965079, -0.10649102149568535, -0.17891289887484163, 0.3276434698345838, 0.20133139799145283, 0.1634622900874092, 0.10843177940478199, 0.3721194448880851, 0.10364887895957509, 0.1544551742317708, 0.19220790870167548, 0.10779933646085738, 0.01966403521510074, 0.15148571321333293, -0.24891436331563455, 0.10554269299609587, 0.03521394187828264] |
1,802.02475 | Out-of-Band Radiation from Antenna Arrays Clarified | Non-linearities in radio-frequency (RF) transceiver hardware, particularly in
power amplifiers, cause distortion in-band and out-of-band. Contrary to claims
made in recent literature, in a multiple-antenna system this distortion is
correlated across the antennas in the array. A significant implication of this
fact is that out-of-band emissions caused by non-linearities are beamformed, in
some cases into the same direction as the useful signal.
| cs.IT math.IT | nonlinearities in radiofrequency rf transceiver hardware particularly in power amplifiers cause distortion inband and outofband contrary to claims made in recent literature in a multipleantenna system this distortion is correlated across the antennas in the array a significant implication of this fact is that outofband emissions caused by nonlinearities are beamformed in some cases into the same direction as the useful signal | [['nonlinearities', 'in', 'radiofrequency', 'rf', 'transceiver', 'hardware', 'particularly', 'in', 'power', 'amplifiers', 'cause', 'distortion', 'inband', 'and', 'outofband', 'contrary', 'to', 'claims', 'made', 'in', 'recent', 'literature', 'in', 'a', 'multipleantenna', 'system', 'this', 'distortion', 'is', 'correlated', 'across', 'the', 'antennas', 'in', 'the', 'array', 'a', 'significant', 'implication', 'of', 'this', 'fact', 'is', 'that', 'outofband', 'emissions', 'caused', 'by', 'nonlinearities', 'are', 'beamformed', 'in', 'some', 'cases', 'into', 'the', 'same', 'direction', 'as', 'the', 'useful', 'signal']] | [-0.2623766318354155, 0.039057197890454726, 0.04358918998285287, 0.005367591706735473, -0.07194987909808274, -0.18824054144563213, 0.04590476090614233, 0.44348299299036303, -0.2465577635448426, -0.22963070057130608, 0.09620264070784493, -0.30358116230326554, -0.18753050033363602, 0.22546036138890252, -0.1308103259314873, 0.009514106347435904, 0.002841817958640956, -0.04009651181273042, 0.009074008266907185, -0.19673899053445748, 0.23469403546844278, 0.13860251439074356, 0.3665977604386787, 0.029524407402101542, 0.022561147181888022, -0.03145238165668542, -0.024518416676249717, -0.027473034288138274, 0.008737993636332835, 0.03891910140162274, 0.378802991352014, 0.10791114346695042, 0.2614609539028137, -0.44592252499874563, -0.3069144311781612, 0.13183664495966607, 0.1304269715647904, 0.1006862967680659, -0.09046138664557328, -0.25773072326292973, 0.05427598935221472, -0.19530922252564661, -0.05155636855371056, 0.0777943177569297, -0.04838280784972613, 0.08626073694998218, -0.28215420931097, 0.04765382493215223, 0.10570028861665408, 0.0383036914732187, -0.010849248163492208, -0.11185021385092349, 0.061816448818952326, 0.07211889865838232, 0.06476582437303037, 0.0024937215982185255, 0.06449893973166904, -0.10884750637436105, -0.08093853544203504, 0.3506248120458857, -0.025392052268744598, -0.20541423709402162, 0.12419199456851329, -0.16441585953467555, -0.12373355248822801, 0.19903277920844453, 0.2437784004836313, -0.019623407162725925, -0.15301760891452432, 0.03631037356418317, 0.06955896007017262, 0.21073938829583988, 0.11521528625199871, 0.1701441340283641, 0.2019782087675506, 0.13181616320845582, 0.09557924801746624, 0.19583144581936782, -0.11028507751442733, -0.017225225938619266, -0.2565009029612185, -0.04749607365022624, -0.20754107307162015, 0.01910588807696777, -0.05100513267637824, -0.0730756119554562, 0.3626058265311463, 0.1636352980990083, 0.11989924762277834, -0.022146907744407203, 0.46409636232701523, 0.08860703852147825, 0.11305378512629578, 0.0469897342094731, 0.3106337968028158, 0.1389880757215583, 0.13366632548070723, -0.1882995430515298, 0.05471951512417065, -0.09900073355604563] |
1,802.02476 | Order continuous operators on pre-Riesz spaces and embeddings | We investigate properties of order continuous operators on pre-Riesz spaces
with respect to the embedding of the range space into a vector lattice cover
or, in particular, into its Dedekind completion. We show that order continuity
is preserved under this embedding for positive operators, but not in general.
For the vector lattice $\ell_0^\infty$ of eventually constant sequences, we
consider the pre-Riesz space of regular operators on $\ell_0^\infty$ and show
that making the range space Dedekind complete does not provide a vector lattice
cover of the pre-Riesz space. A similar counterexample is obtained for the
directed part of the space of order continuous operators on $\ell_0^\infty$.
| math.FA | we investigate properties of order continuous operators on preriesz spaces with respect to the embedding of the range space into a vector lattice cover or in particular into its dedekind completion we show that order continuity is preserved under this embedding for positive operators but not in general for the vector lattice ell_0infty of eventually constant sequences we consider the preriesz space of regular operators on ell_0infty and show that making the range space dedekind complete does not provide a vector lattice cover of the preriesz space a similar counterexample is obtained for the directed part of the space of order continuous operators on ell_0infty | [['we', 'investigate', 'properties', 'of', 'order', 'continuous', 'operators', 'on', 'preriesz', 'spaces', 'with', 'respect', 'to', 'the', 'embedding', 'of', 'the', 'range', 'space', 'into', 'a', 'vector', 'lattice', 'cover', 'or', 'in', 'particular', 'into', 'its', 'dedekind', 'completion', 'we', 'show', 'that', 'order', 'continuity', 'is', 'preserved', 'under', 'this', 'embedding', 'for', 'positive', 'operators', 'but', 'not', 'in', 'general', 'for', 'the', 'vector', 'lattice', 'ell_0infty', 'of', 'eventually', 'constant', 'sequences', 'we', 'consider', 'the', 'preriesz', 'space', 'of', 'regular', 'operators', 'on', 'ell_0infty', 'and', 'show', 'that', 'making', 'the', 'range', 'space', 'dedekind', 'complete', 'does', 'not', 'provide', 'a', 'vector', 'lattice', 'cover', 'of', 'the', 'preriesz', 'space', 'a', 'similar', 'counterexample', 'is', 'obtained', 'for', 'the', 'directed', 'part', 'of', 'the', 'space', 'of', 'order', 'continuous', 'operators', 'on', 'ell_0infty']] | [-0.1327286195519957, 0.1333623931077974, -0.0337008535861969, 0.06853942441465777, -0.11239663421930302, -0.04237170747614333, 0.036993991823068686, 0.4049475316135656, -0.30263835922593163, -0.15968354469375862, 0.15154375465187644, -0.253477389250128, -0.10981576895296928, 0.16810713055366205, -0.06670080835797958, 0.014498603368909763, 0.04806996404991618, 0.10589964660577521, -0.1291220406292095, -0.2805591075481581, 0.42330068665600956, -0.06555207931835737, 0.23383255314214954, 0.0523971067181611, 0.12041267854649396, 0.0820652478507587, -0.03374931032636336, 0.03735113931858602, -0.14897810595534144, 0.13923634954151654, 0.20451860819455414, 0.09975813068892984, 0.2415148612643991, -0.3664918809064797, -0.2295289896051621, 0.19209901010174127, 0.11276963287964463, 0.012982044812469255, 0.004421985309038844, -0.27346613165878114, 0.10823123002469184, -0.1209302021634011, -0.08401607447969062, -0.14951957319641396, 0.0360437860712409, 0.006363570849810328, -0.30961271054998396, -0.01540940532549506, 0.10818209117721944, 0.049839146417521296, -0.1327583850128576, -0.07743203680674057, -0.021038092105161575, 0.09470089462230957, -0.032879976157675544, 0.08777515319109495, 0.023228836871151414, -0.09524474698562352, -0.09947967748379423, 0.42253030059593066, -0.08933072979672857, -0.24326753128497375, 0.13935021770608036, -0.21313459072262048, -0.130705779733225, 0.08731923876330257, 0.17850842683443002, 0.1256798635369965, -0.04457014707759732, 0.17470767900647063, -0.08298303036773134, 0.1481999307870865, 0.050009297473090034, 0.07501771131452793, 0.14297533579880284, 0.11849099847133315, 0.1564415783843114, 0.1577658777967805, 0.02484496083953196, -0.10044094790826508, -0.3501547681788603, -0.18380072708463385, -0.1642952024227097, 0.05809855254039922, -0.09510561362604633, -0.2150887463064421, 0.3931336518853814, 0.10259242321231536, 0.2287401289989551, 0.10084230839496568, 0.194959372423944, 0.09579202288850433, 0.09275305063485922, 0.03621438314606037, 0.15896743637110505, 0.1109269369393587, 0.07995052343411814, -0.12197977598046973, 0.007943359381031422, 0.14576058310146134] |
1,802.02477 | Common solar wind drivers behind magnetic storm-magnetospheric substorm
dependency | The dynamical relationship between magnetic storms and magnetospheric
substorms presents one of the most controversial problems of contemporary
geospace research. Here, we tackle this issue by applying a causal inference
approach to two corresponding indices in conjunction with several relevant
solar wind variables. We demonstrate that the vertical component of the
interplanetary magnetic field is the strongest and common driver of both,
storms and substorms, and explains their the previously reported association.
These results hold during both solar maximum and minimum phases and suggest
that, at least based on the analyzed indices, there is no statistical evidence
for a direct or indirect dependency between substorms and storms. A physical
mechanism by which substorms drive storms or vice versa is, therefore,
unlikely.
| physics.space-ph | the dynamical relationship between magnetic storms and magnetospheric substorms presents one of the most controversial problems of contemporary geospace research here we tackle this issue by applying a causal inference approach to two corresponding indices in conjunction with several relevant solar wind variables we demonstrate that the vertical component of the interplanetary magnetic field is the strongest and common driver of both storms and substorms and explains their the previously reported association these results hold during both solar maximum and minimum phases and suggest that at least based on the analyzed indices there is no statistical evidence for a direct or indirect dependency between substorms and storms a physical mechanism by which substorms drive storms or vice versa is therefore unlikely | [['the', 'dynamical', 'relationship', 'between', 'magnetic', 'storms', 'and', 'magnetospheric', 'substorms', 'presents', 'one', 'of', 'the', 'most', 'controversial', 'problems', 'of', 'contemporary', 'geospace', 'research', 'here', 'we', 'tackle', 'this', 'issue', 'by', 'applying', 'a', 'causal', 'inference', 'approach', 'to', 'two', 'corresponding', 'indices', 'in', 'conjunction', 'with', 'several', 'relevant', 'solar', 'wind', 'variables', 'we', 'demonstrate', 'that', 'the', 'vertical', 'component', 'of', 'the', 'interplanetary', 'magnetic', 'field', 'is', 'the', 'strongest', 'and', 'common', 'driver', 'of', 'both', 'storms', 'and', 'substorms', 'and', 'explains', 'their', 'the', 'previously', 'reported', 'association', 'these', 'results', 'hold', 'during', 'both', 'solar', 'maximum', 'and', 'minimum', 'phases', 'and', 'suggest', 'that', 'at', 'least', 'based', 'on', 'the', 'analyzed', 'indices', 'there', 'is', 'no', 'statistical', 'evidence', 'for', 'a', 'direct', 'or', 'indirect', 'dependency', 'between', 'substorms', 'and', 'storms', 'a', 'physical', 'mechanism', 'by', 'which', 'substorms', 'drive', 'storms', 'or', 'vice', 'versa', 'is', 'therefore', 'unlikely']] | [-0.14768888578126746, 0.18128191046551456, -0.023956951654462284, 0.15676821172737693, -0.08572570909168725, -0.0836453614381242, 0.05434260259898118, 0.4030433050299079, -0.20424606944799947, -0.355218764860183, 0.1317097004531875, -0.24158827612592168, -0.2024229202065463, 0.22126179574392274, -0.034190599367884565, -0.007878915878197501, 0.043306736802790034, -0.015379905677592952, -0.02066642541653854, -0.15812008238151237, 0.2607671881194634, 0.06653528740775795, 0.24799430774801895, 0.06714468374694428, 0.08175181963842762, -0.06905987488937156, -0.05673384328549805, 0.03170730230929561, -0.07479896576758109, 0.11206237818614757, 0.18842814945469588, 0.1609237438706635, 0.28898081351225535, -0.48232367836431533, -0.2601203115133584, 0.07475879106455105, 0.08368001067202754, -0.006387265684845095, -0.05787534590460329, -0.21357576467466255, 0.06492418025125757, -0.14227359417117824, -0.08186259941959922, 0.004561920650303364, 0.060386817302931994, 0.019402703982277596, -0.29151107193825165, 0.1053822435455951, 0.07513038417173372, 0.1506227123885885, -0.1118280211721416, -0.10283663121921834, -0.0443225752077381, 0.1144580014400215, 0.14862384564197076, 0.020252252082255753, 0.11768026977069368, -0.11192350404929709, -0.15996192862887768, 0.36520797698873997, -0.004505885264899751, -0.08840587607696498, 0.2520259114310399, -0.17383565556862648, -0.1542124745228197, 0.09880054463085926, 0.14431270919951864, 0.06796381862166391, -0.14720253157309132, -0.01679015405089325, -0.017198283608217745, 0.1552617555976776, 0.04242065505794257, -0.0016739723101366034, 0.2959105379586993, 0.12946437776650588, 0.044847549533871704, 0.10728997437568182, -0.16251192251720642, -0.09321134472997043, -0.25504472739378775, -0.12452473851644304, -0.11153638708089625, -0.006635753447497802, -0.09847315013866144, -0.15494924914553637, 0.4139496528982254, 0.2389179719563897, 0.1573615466929541, -0.04904687992578049, 0.30141745376677737, 0.08358914703361628, 0.03331522641064645, 0.12048086862480037, 0.30396573046176145, 0.1461285846230905, 0.13559632798010282, -0.2212582438075838, 0.16414393991047194, 0.03497827292010111] |
1,802.02478 | On the Stability of Independence Polynomials | The independence polynomial of a graph is the generating polynomial for the
number of independent sets of each size, and its roots are called {\em
independence roots}. We investigate the stability of such polynomials, that is,
conditions under which the roots lie in the left half-plane (all of the real
roots of independence polynomial are negative and hence lie in this
half-plane). We show stability for all independence polynomials of graphs with
independence number at most three, but for larger independence number we show
that the independence polynomials can have roots arbitrarily far to the right.
We provide families of graphs whose independence polynomials are stable and
ones that are not, utilizing various graph operations.
| math.CO | the independence polynomial of a graph is the generating polynomial for the number of independent sets of each size and its roots are called em independence roots we investigate the stability of such polynomials that is conditions under which the roots lie in the left halfplane all of the real roots of independence polynomial are negative and hence lie in this halfplane we show stability for all independence polynomials of graphs with independence number at most three but for larger independence number we show that the independence polynomials can have roots arbitrarily far to the right we provide families of graphs whose independence polynomials are stable and ones that are not utilizing various graph operations | [['the', 'independence', 'polynomial', 'of', 'a', 'graph', 'is', 'the', 'generating', 'polynomial', 'for', 'the', 'number', 'of', 'independent', 'sets', 'of', 'each', 'size', 'and', 'its', 'roots', 'are', 'called', 'em', 'independence', 'roots', 'we', 'investigate', 'the', 'stability', 'of', 'such', 'polynomials', 'that', 'is', 'conditions', 'under', 'which', 'the', 'roots', 'lie', 'in', 'the', 'left', 'halfplane', 'all', 'of', 'the', 'real', 'roots', 'of', 'independence', 'polynomial', 'are', 'negative', 'and', 'hence', 'lie', 'in', 'this', 'halfplane', 'we', 'show', 'stability', 'for', 'all', 'independence', 'polynomials', 'of', 'graphs', 'with', 'independence', 'number', 'at', 'most', 'three', 'but', 'for', 'larger', 'independence', 'number', 'we', 'show', 'that', 'the', 'independence', 'polynomials', 'can', 'have', 'roots', 'arbitrarily', 'far', 'to', 'the', 'right', 'we', 'provide', 'families', 'of', 'graphs', 'whose', 'independence', 'polynomials', 'are', 'stable', 'and', 'ones', 'that', 'are', 'not', 'utilizing', 'various', 'graph', 'operations']] | [-0.21420542397536338, 0.12376272793373336, -0.06005175006373421, 0.05229260687129167, -0.12134172912160664, -0.09788161009226157, -0.02999264207445895, 0.34237475174924603, -0.29650486786748564, -0.24301452359751516, 0.1506090787826511, -0.2684059679751163, -0.1378464945956417, 0.18034781363347302, -0.04747660211135593, 0.05191184142655086, 0.024222609510078378, 0.11929644258596692, -0.020910398660065686, -0.34323360436727574, 0.3420084267793952, -0.013423132556288138, 0.18469232407641475, 0.03147954747799541, 0.12561974364292364, -0.014236084529725105, 0.013828394958830398, 0.03529169428283754, -0.10139357971208443, 0.09550540969990517, 0.2467201589141041, 0.18881188966580617, 0.2661489038849654, -0.3952792161184808, -0.08456275293846494, 0.2589010437626554, 0.1332160343112343, 0.02301767196243062, 0.02015662393330232, -0.20508909443109904, 0.14220682721908973, -0.08943742210369394, -0.12296551451006013, -0.08133425019357515, 0.03351620586346025, 0.09717059690991174, -0.3006572933017236, 0.008118119552407576, 0.08004525866683411, 0.1457442066591719, 0.0430292267261235, -0.17924190449487903, -0.004141512935292786, 0.08901144119141542, -0.009332983062157164, -0.07112691955155005, 0.05196754087329559, -0.12135131608634053, -0.11323973704129457, 0.3510664868613948, 0.04575641297775766, -0.25625464867638503, 0.16795099420452733, -0.22521572557642408, -0.20736023452153188, 0.09115830430275072, 0.10245336172697336, 0.10734012865501902, -0.0695674685275425, 0.14907690373947843, -0.15202813793135725, 0.09075705702214137, 0.17672626176120146, 0.039779794617029636, 0.13852997689467408, 0.022994393515198126, 0.08028560953579195, 0.17301601891851295, 0.022442392069522452, -0.05559541453890826, -0.32773644386426265, -0.1445315852822007, -0.21234076012776273, 0.02160602593819773, -0.21107591299059214, -0.2337835756646793, 0.4321992519757022, 0.15846617617441908, 0.19797614480814207, 0.17504184625982105, 0.22474791491809099, 0.11856319645986609, 0.04977305058146948, 0.09994443848241329, 0.1567547376713027, 0.19269566119689008, -0.04161767433195011, -0.1393669999629745, 0.12152038468199823, 0.1259629467299775] |
1,802.02479 | Virtual photon polarization and dilepton anisotropy in relativistic
nucleus-nucleus collisions | The polarization of virtual photons produced in relativistic nucleus-nucleus
collisions provides information on the conditions in the emitting medium. In a
hydrodynamic framework, the resulting angular anisotropy of the dilepton final
state depends on the flow as well as on the transverse momentum and invariant
mass of the photon. We illustrate these effects in dilepton production from
quark-antiquark annihilation in the QGP phase and $\pi^+\pi^-$ annihilation in
the hadronic phase for a static medium in global equilibrium and for a
longitudinally expanding system.
| hep-ph | the polarization of virtual photons produced in relativistic nucleusnucleus collisions provides information on the conditions in the emitting medium in a hydrodynamic framework the resulting angular anisotropy of the dilepton final state depends on the flow as well as on the transverse momentum and invariant mass of the photon we illustrate these effects in dilepton production from quarkantiquark annihilation in the qgp phase and pipi annihilation in the hadronic phase for a static medium in global equilibrium and for a longitudinally expanding system | [['the', 'polarization', 'of', 'virtual', 'photons', 'produced', 'in', 'relativistic', 'nucleusnucleus', 'collisions', 'provides', 'information', 'on', 'the', 'conditions', 'in', 'the', 'emitting', 'medium', 'in', 'a', 'hydrodynamic', 'framework', 'the', 'resulting', 'angular', 'anisotropy', 'of', 'the', 'dilepton', 'final', 'state', 'depends', 'on', 'the', 'flow', 'as', 'well', 'as', 'on', 'the', 'transverse', 'momentum', 'and', 'invariant', 'mass', 'of', 'the', 'photon', 'we', 'illustrate', 'these', 'effects', 'in', 'dilepton', 'production', 'from', 'quarkantiquark', 'annihilation', 'in', 'the', 'qgp', 'phase', 'and', 'pipi', 'annihilation', 'in', 'the', 'hadronic', 'phase', 'for', 'a', 'static', 'medium', 'in', 'global', 'equilibrium', 'and', 'for', 'a', 'longitudinally', 'expanding', 'system']] | [-0.10285428602035236, 0.24652335894888783, -0.16816050990159254, 0.1004891674741205, 0.014028732398390231, -0.0123367434345096, -0.024195533447775495, 0.34436307904725694, -0.20648802931319518, -0.24082901961652628, -0.05058515481847192, -0.3119513890874314, 0.07225377416148422, 0.14893344190555163, 0.08231015060747783, 0.09897137617170586, 0.07914243531357272, 0.03464508430572249, -0.03523931171778724, -0.14277803031615463, 0.3772160454866398, 0.05186357398528651, 0.2535859629938222, 0.18039561880483146, 0.08199561437793884, 0.08493445815058448, -0.052982342925276156, -0.018804756789860957, -0.09261289507105767, 0.0005924562528779932, 0.18800904072753816, 0.04177783531450992, 0.09041645198342312, -0.38171139519930963, -0.171022458013192, 0.079448385467102, 0.19027643697336316, 0.13308055381552197, -0.07489234755371126, -0.29923235611563703, 0.02124699081731848, -0.22791534048471465, -0.10628755096660321, -0.02590732736490577, -0.014183723710684937, -0.0001444542241922344, -0.3091975490686046, 0.1360689185851489, -0.000981972051408501, 0.010352590988132071, -0.07612457668060908, -0.10031246121114412, -0.11379107601480581, 0.038539272570331774, 0.05545933348553098, 0.07472884790068604, 0.2243615185830697, -0.22901792816273553, -0.1187284383025155, 0.4350567226219608, -0.07370142882734716, -0.19084043610078025, 0.17017430031155967, -0.19699212259063162, -0.11098211446597454, 0.18892773975483534, 0.3086684342159564, 0.1007288847713316, -0.17467317144465017, 0.06255875188781578, -0.019594012737184405, 0.12102645940528846, 0.07916221293026066, 0.13659142603794763, 0.23969847879495965, 0.18549225917254317, -0.011148832272738218, 0.15246433235076537, -0.09963566671105954, -0.09854157215141389, -0.38070654191346054, -0.14073389113308435, -0.1407334126296442, 0.06461549224752754, -0.09626312278360494, -0.13351985123232904, 0.40001029074640876, 0.0856352351319763, 0.24654703927562988, -0.0665334117351975, 0.3696921041392418, 0.07515150889563542, -0.017741447614775186, 0.13923725178353039, 0.33557847079383324, 0.16444448374929915, 0.23124620176470242, -0.2953611085701913, 0.036764394284326984, 0.06002622270810766] |
1,802.0248 | Click Spam Prevention Model for On-Line Advertisement | This paper shows a vulnerability of the pay-per-click accounting of Google
Ads and proposes a statistical tradeoff-based approach to manage this
vulnerability. The result of this paper is a model to calculate the overhead
cost per click necessary to protect the subscribers and a simple algorithm to
implement this protection. Simulations validate the correctness of the model
and the economical applicability.
| cs.NI | this paper shows a vulnerability of the payperclick accounting of google ads and proposes a statistical tradeoffbased approach to manage this vulnerability the result of this paper is a model to calculate the overhead cost per click necessary to protect the subscribers and a simple algorithm to implement this protection simulations validate the correctness of the model and the economical applicability | [['this', 'paper', 'shows', 'a', 'vulnerability', 'of', 'the', 'payperclick', 'accounting', 'of', 'google', 'ads', 'and', 'proposes', 'a', 'statistical', 'tradeoffbased', 'approach', 'to', 'manage', 'this', 'vulnerability', 'the', 'result', 'of', 'this', 'paper', 'is', 'a', 'model', 'to', 'calculate', 'the', 'overhead', 'cost', 'per', 'click', 'necessary', 'to', 'protect', 'the', 'subscribers', 'and', 'a', 'simple', 'algorithm', 'to', 'implement', 'this', 'protection', 'simulations', 'validate', 'the', 'correctness', 'of', 'the', 'model', 'and', 'the', 'economical', 'applicability']] | [-0.10788807682693005, -0.03299485800865417, -0.07240238214532534, 0.0936529038726197, -0.09405064789267878, -0.151555378207316, 0.17591999093225846, 0.30681827714045845, -0.23298057044545809, -0.34653443375912807, 0.09642225007216136, -0.26355442696561415, -0.20048572805244474, 0.1468081574421376, -0.162349737683932, 0.06092391773127019, 0.03756785135095318, 0.02167824236676097, -0.03630069487747581, -0.28591270027682186, 0.2454144310070357, 0.13283558875943224, 0.3420407522469759, 0.11700637096849581, 0.0647120867545406, -0.01837954358973851, -0.05044458617145817, -0.024211070872843264, -0.10662505174210916, 0.18924145919736474, 0.2375579594168812, 0.19669877989217638, 0.34533487757047016, -0.3892869274442395, -0.16629014830105007, 0.12081464115375032, 0.0937888203964879, 0.147036944826444, -0.0640380453163137, -0.256517207591484, 0.1419522842547546, -0.3034030807514985, -0.14020269019529225, -0.10261866554695492, -0.03282482034216325, -0.03892328998384376, -0.30421739602461456, 0.023671102857527635, 0.021183561719954013, 0.03545484353477756, -0.0024513996516664824, 0.014407089034405848, -0.011700324120465667, 0.15829150125888797, 0.06300703006951759, -0.008809999089377622, 0.1437196981161833, -0.07850646763108671, -0.13892015569532912, 0.425616463770469, 0.024601327317456404, -0.18333074140052, 0.17535078773895899, -0.00996761127995948, -0.1267974304811408, 0.08023446244187653, 0.26775696575641633, 0.07811878289406499, -0.2149558842026939, 0.03949308479689838, -0.011569396716852982, 0.20924160669868191, 0.008387051701235274, 0.0013749145126591125, 0.13224733244860545, 0.2415003875037655, 0.051038361173899226, 0.21087124658127626, -0.07259879568591714, -0.07642593598769357, -0.28388011071365327, -0.20161913301950943, -0.16026692600377526, 0.028629696477825442, -0.0637937966028403, -0.16852288480537633, 0.46125002627571426, 0.29136830129039787, 0.14995975011649232, 0.13441401046390336, 0.44260563533753156, 0.0415330527505527, 0.05367771041734765, 0.115498966005786, 0.17540088652943572, 0.03397829573756705, 0.15193701066697637, -0.20513682755020757, 0.10064125421146551, 0.03720302599006876] |
1,802.02481 | Weighted Morrey spaces related to Schrodinger operators with potentials
satisfying a reverse Holder inequality and fractional integrals | Let $\mathcal L=-\Delta+V$ be a Schr\"odinger operator on $\mathbb R^d$,
$d\geq3$, where $\Delta$ is the Laplacian operator on $\mathbb R^d$ and the
nonnegative potential $V$ belongs to the reverse H\"older class $RH_s$ for
$s\geq d/2$. For given $0<\alpha<d$, the fractional integrals associated to the
Schr\"odinger operator $\mathcal L$ is defined by $\mathcal
I_{\alpha}={\mathcal L}^{-{\alpha}/2}$.Suppose that $b$ is a locally integrable
function on $\mathbb R^d$, the commutator generated by $b$ and $\mathcal
I_{\alpha}$ is defined by $[b,\mathcal I_{\alpha}]f(x)=b(x)\cdot \mathcal
I_{\alpha}f(x)-\mathcal I_{\alpha}(bf)(x)$. In this paper, we first introduce
some kinds of weighted Morrey spaces related to certain nonnegative potentials
belonging to the reverse H\"older class $RH_s$ for $s\geq d/2$. Then we will
establish the boundedness properties of the fractional integrals $\mathcal
I_{\alpha}$ on these new spaces. Furthermore, weighted strong-type estimate for
the corresponding commutator $[b,\mathcal I_{\alpha}]$ in the framework of
Morrey spaces is also obtained. The classes of weights, the classes of symbol
functions as well as weighted Morrey spaces discussed in this paper are larger
than $A_{p,q}$, $\mathrm{BMO}(\mathbb R^d)$ and $L^{p,\kappa}(\mu,\nu)$
corresponding to the classical case (that is $V\equiv0$).
| math.CA | let mathcal ldeltav be a schrodinger operator on mathbb rd dgeq3 where delta is the laplacian operator on mathbb rd and the nonnegative potential v belongs to the reverse holder class rh_s for sgeq d2 for given 0alphad the fractional integrals associated to the schrodinger operator mathcal l is defined by mathcal i_alphamathcal lalpha2suppose that b is a locally integrable function on mathbb rd the commutator generated by b and mathcal i_alpha is defined by bmathcal i_alphafxbxcdot mathcal i_alphafxmathcal i_alphabfx in this paper we first introduce some kinds of weighted morrey spaces related to certain nonnegative potentials belonging to the reverse holder class rh_s for sgeq d2 then we will establish the boundedness properties of the fractional integrals mathcal i_alpha on these new spaces furthermore weighted strongtype estimate for the corresponding commutator bmathcal i_alpha in the framework of morrey spaces is also obtained the classes of weights the classes of symbol functions as well as weighted morrey spaces discussed in this paper are larger than a_pq mathrmbmomathbb rd and lpkappamunu corresponding to the classical case that is vequiv0 | [['let', 'mathcal', 'ldeltav', 'be', 'a', 'schrodinger', 'operator', 'on', 'mathbb', 'rd', 'dgeq3', 'where', 'delta', 'is', 'the', 'laplacian', 'operator', 'on', 'mathbb', 'rd', 'and', 'the', 'nonnegative', 'potential', 'v', 'belongs', 'to', 'the', 'reverse', 'holder', 'class', 'rh_s', 'for', 'sgeq', 'd2', 'for', 'given', '0alphad', 'the', 'fractional', 'integrals', 'associated', 'to', 'the', 'schrodinger', 'operator', 'mathcal', 'l', 'is', 'defined', 'by', 'mathcal', 'i_alphamathcal', 'lalpha2suppose', 'that', 'b', 'is', 'a', 'locally', 'integrable', 'function', 'on', 'mathbb', 'rd', 'the', 'commutator', 'generated', 'by', 'b', 'and', 'mathcal', 'i_alpha', 'is', 'defined', 'by', 'bmathcal', 'i_alphafxbxcdot', 'mathcal', 'i_alphafxmathcal', 'i_alphabfx', 'in', 'this', 'paper', 'we', 'first', 'introduce', 'some', 'kinds', 'of', 'weighted', 'morrey', 'spaces', 'related', 'to', 'certain', 'nonnegative', 'potentials', 'belonging', 'to', 'the', 'reverse', 'holder', 'class', 'rh_s', 'for', 'sgeq', 'd2', 'then', 'we', 'will', 'establish', 'the', 'boundedness', 'properties', 'of', 'the', 'fractional', 'integrals', 'mathcal', 'i_alpha', 'on', 'these', 'new', 'spaces', 'furthermore', 'weighted', 'strongtype', 'estimate', 'for', 'the', 'corresponding', 'commutator', 'bmathcal', 'i_alpha', 'in', 'the', 'framework', 'of', 'morrey', 'spaces', 'is', 'also', 'obtained', 'the', 'classes', 'of', 'weights', 'the', 'classes', 'of', 'symbol', 'functions', 'as', 'well', 'as', 'weighted', 'morrey', 'spaces', 'discussed', 'in', 'this', 'paper', 'are', 'larger', 'than', 'a_pq', 'mathrmbmomathbb', 'rd', 'and', 'lpkappamunu', 'corresponding', 'to', 'the', 'classical', 'case', 'that', 'is', 'vequiv0']] | [-0.1151954117231071, 0.11854360971551085, 0.03915930673924037, 0.09180158902593173, -0.0777563153858145, -0.1441785884739528, -0.059045620737759784, 0.3489283777470159, -0.34497328821656315, -0.08826707999308615, 0.13411082374608838, -0.3374144761703995, -0.10719640758399565, 0.18194093978368178, -0.12049081888818723, 0.059920678351096116, 0.0013588274065790926, 0.07598261227817708, -0.12610958513078216, -0.2534658010212466, 0.41711627564739523, -0.11470829769373374, 0.1506044450351362, 0.03815220114450122, 0.048282996349159876, -0.013364836319111461, 0.0016031823483793888, -0.03707648672266365, -0.24173397210544736, 0.1435461210406407, 0.221575879019436, 0.06970052958769334, 0.31154359828919, -0.33438590800303014, -0.15907535404318857, 0.28537831154413695, 0.1461278443132679, -0.1368872384218564, 0.0253319759397337, -0.35308247437391993, 0.1160558026370614, -0.1093322683131149, -0.16323905026264013, -0.07862332994578579, 0.13022474669255749, 0.08365105539709221, -0.4035516778537787, 0.06597845145987839, 0.09148066359650625, 0.015757525203002314, -0.12420300391860047, -0.15244029690294938, -0.053413855644257005, 0.0105685391517486, -0.06250977349131866, 0.16690154016751602, 0.027649858611809134, -0.017110194517658255, -0.10895402758750458, 0.3438157015859128, -0.0770021374964292, -0.2949832606151007, 0.05531283320999856, -0.212222218709432, -0.1428915942277283, 0.010968975951559408, 0.12614758595618483, 0.1837333688501615, -0.10205634320046493, 0.24122581124572398, -0.06232804055244467, 0.04022052440911445, 0.06899238921712737, 0.07613474207789485, 0.008908277550755545, 0.06473595612387303, 0.16322693441247263, 0.14761576081320188, 0.0026573247169983725, -0.038508058508024225, -0.4136629239331151, -0.17102544761055047, -0.18933272079515898, 0.13629930529223624, -0.121654335660931, -0.15959642983994685, 0.342217278160523, 0.0682340804389326, 0.14861304722699273, 0.13566121319444244, 0.11683046028862686, 0.1585630521842896, 0.04475768178633379, 0.06623328390780317, 0.09573440965577056, 0.1713554206910695, 0.08739765996159445, -0.15922814711175728, -0.003553116707629416, 0.2640675300485888] |
1,802.02482 | The paradigm of complexity. Contributions for hypertext's formal
approaches | This article argues for a return to formal approaches of hypertext and builds
on the paradigm of complexity to develop the idea of "hypermediator website". A
hypermediator website is an intermediate device between a digitalization of
book culture and a "real" hypertext writing. If our thinking on the
hypermediator website joined the hypertext's notions and the databases, it
differs by the relationship reader-device no longer based on information search
query but using the visualization of the information.
| cs.DL | this article argues for a return to formal approaches of hypertext and builds on the paradigm of complexity to develop the idea of hypermediator website a hypermediator website is an intermediate device between a digitalization of book culture and a real hypertext writing if our thinking on the hypermediator website joined the hypertexts notions and the databases it differs by the relationship readerdevice no longer based on information search query but using the visualization of the information | [['this', 'article', 'argues', 'for', 'a', 'return', 'to', 'formal', 'approaches', 'of', 'hypertext', 'and', 'builds', 'on', 'the', 'paradigm', 'of', 'complexity', 'to', 'develop', 'the', 'idea', 'of', 'hypermediator', 'website', 'a', 'hypermediator', 'website', 'is', 'an', 'intermediate', 'device', 'between', 'a', 'digitalization', 'of', 'book', 'culture', 'and', 'a', 'real', 'hypertext', 'writing', 'if', 'our', 'thinking', 'on', 'the', 'hypermediator', 'website', 'joined', 'the', 'hypertexts', 'notions', 'and', 'the', 'databases', 'it', 'differs', 'by', 'the', 'relationship', 'readerdevice', 'no', 'longer', 'based', 'on', 'information', 'search', 'query', 'but', 'using', 'the', 'visualization', 'of', 'the', 'information']] | [-0.10089178825107714, 0.014860895268502644, -0.15223482206463815, 0.054291345331973086, -0.16688036713749171, -0.13307531873385112, 0.12701214857399465, 0.33279958327611286, -0.2535535658399264, -0.3095584961771965, 0.09929702801009019, -0.32746559046208856, -0.14223989846805732, 0.21619561177678406, -0.07979692339897156, -0.04521543599044283, 0.03493418460090955, 0.06715120280782381, -0.0321484167004625, -0.2675769107261052, 0.34041953781619666, 0.05839496237846712, 0.32195922353615364, 0.07625921653583646, 0.10813192866839624, 0.05250544536237915, -0.12604779579831907, -0.027063874962429204, -0.1253477645603319, 0.19197866751501957, 0.26770096355117856, 0.2589616097665081, 0.333076893389225, -0.4041839691748222, -0.12265587437897921, 0.002994877149661382, 0.10229224217434724, 0.1096088866579036, -0.04114705629491558, -0.3297656649475296, 0.05685647673904896, -0.18704491055260103, -0.02971405370781819, -0.016399674129982788, 0.04583084881305695, -0.021666698111221194, -0.18751376996437708, -0.05496378655234973, 0.08127248251189788, 0.14597621490713208, -0.001048960005864501, -0.05139155123382807, -0.015883883074857295, 0.18510989271104336, 0.03372027457691729, 0.058210709607228635, 0.14101102949430544, -0.1123189736623317, -0.1722861719628175, 0.3728766456246376, -0.042986955884844066, -0.14558439285183947, 0.17228629272741577, -0.0466657434652249, -0.11681849439938863, 0.06131297141313553, 0.15133247089882693, 0.08011442260739084, -0.15645809279754758, 0.05922069394107287, -0.04059894025325775, 0.24208884283900262, 0.04931723530093829, -0.023574329684488474, 0.19650631518413622, 0.21589813381433487, 0.030380542762577532, 0.09897204351300995, -0.005212584364538392, -0.09928956010689338, -0.22679486859589815, -0.20635330943390728, -0.20218616763750713, 0.018517150059342385, -0.04289744568930473, -0.19250643904010456, 0.3789894177143772, 0.20118556757767994, 0.1521000085088114, 0.0649743743861715, 0.34130511345962683, -0.0041106409067288045, 0.07851723595832785, 0.12058648464580377, 0.156375736395518, 0.001206336123868823, 0.20111550136779746, -0.10571095786367854, 0.13717317122034728, 0.06433271567899888] |
1,802.02483 | Power-Controlled Hamiltonian Systems: Application to Electrical Systems
with Constant Power Loads | We study a type of port-Hamiltonian system, in which the controller or
disturbance is not applied to the flow variables, but to the systems power, a
scenario that appears in many practical applications. A suitable framework is
provided to model these systems and to investigate their shifted passivity
properties, based on which, a stability analysis is carried out. The
applicability of the results is illustrated with the important problem of
stability analysis of electrical circuits with constant power loads.
| cs.SY | we study a type of porthamiltonian system in which the controller or disturbance is not applied to the flow variables but to the systems power a scenario that appears in many practical applications a suitable framework is provided to model these systems and to investigate their shifted passivity properties based on which a stability analysis is carried out the applicability of the results is illustrated with the important problem of stability analysis of electrical circuits with constant power loads | [['we', 'study', 'a', 'type', 'of', 'porthamiltonian', 'system', 'in', 'which', 'the', 'controller', 'or', 'disturbance', 'is', 'not', 'applied', 'to', 'the', 'flow', 'variables', 'but', 'to', 'the', 'systems', 'power', 'a', 'scenario', 'that', 'appears', 'in', 'many', 'practical', 'applications', 'a', 'suitable', 'framework', 'is', 'provided', 'to', 'model', 'these', 'systems', 'and', 'to', 'investigate', 'their', 'shifted', 'passivity', 'properties', 'based', 'on', 'which', 'a', 'stability', 'analysis', 'is', 'carried', 'out', 'the', 'applicability', 'of', 'the', 'results', 'is', 'illustrated', 'with', 'the', 'important', 'problem', 'of', 'stability', 'analysis', 'of', 'electrical', 'circuits', 'with', 'constant', 'power', 'loads']] | [-0.18467742455474845, 0.004632631475931104, -0.10700829700814395, 0.008267799351081441, -0.054553863722123674, -0.1489681211547761, 0.05838649946889734, 0.34622165928535825, -0.2816408168807437, -0.2714111365236436, 0.1849846556765039, -0.2263549984774635, -0.17585821215452366, 0.2566095434919094, -0.07263224237138712, 0.09958188832277738, 0.04056825054974496, 0.03635612591994997, -0.031357796087601704, -0.21686662204822973, 0.3001105245320669, 0.0845626356681408, 0.30222356641853726, 0.031326602148245786, 0.0943002608852296, -0.0424545545195807, 0.010108056366207856, 0.08453991348984875, -0.08080519807771441, 0.13244587441322783, 0.22883219030225957, 0.10701413202111291, 0.30493454854416696, -0.39205671321081964, -0.2614241112141481, 0.10914916426084842, 0.09762831097115067, 0.06884342166477272, -0.05729749438181944, -0.2505703028659867, 0.1222334307194039, -0.15752800267566985, -0.13911792268104192, -0.1011409983003904, -0.002948694355502913, 0.05974651196134524, -0.2885129911341716, 0.04096519035770546, 0.09447666560594417, 0.059143980858918234, -0.08434249531135812, -0.07362417817039156, -0.018224508200972517, 0.10301392492720315, 0.03742627863023619, -0.05550879937349052, 0.16475532050067676, -0.12549169941604893, -0.09624204432143818, 0.42492290656966497, 0.006802805678777491, -0.22446290707168512, 0.2056924896550518, -0.08926499484672765, -0.12565388695537288, 0.07374269425680366, 0.2154535134028219, 0.11610016370887714, -0.1739923465669839, 0.05253127511941439, 0.0028785028011549876, 0.21388600191360788, -0.029607887792436383, 0.019622170089307844, 0.176249560154385, 0.20517045573060272, 0.0777241544955693, 0.18291360292218248, -0.012372888303420778, -0.13365812061495985, -0.2880421925477589, -0.12272813727584066, -0.13934753495681135, 0.023935989942585847, -0.029499563126039362, -0.14983883181799063, 0.416567632999224, 0.17505772779047302, 0.16934689199787717, 0.02074435908241268, 0.3284249650903895, 0.17115132705768263, 0.050810409733388996, 0.056446860573855756, 0.24191731968423044, 0.1848085612247262, 0.13337863180668483, -0.23226275094607962, 0.04021880625381689, 0.02425247885852675] |
1,802.02484 | Dark states in spin-polarized transport through triple quantum dot
molecules | We study the spin-polarized transport through a triple quantum dot molecule
weakly coupled to ferromagnetic leads. The analysis is performed by means of
the real-time diagrammatic technique including up to the second order of
perturbation expansion with respect to the tunnel coupling. The emphasis is put
on the impact of dark states on spin-resolved transport characteristics. It is
shown that the interplay of coherent population trapping and cotunneling
processes results in a highly nontrivial behavior of the tunnel
magnetoresistance, which can take negative values. Moreover, a super-Poissonian
shot noise is found in transport regimes where the current is blocked by the
formation of dark states, which can be additionally enhanced by spin-dependence
of tunneling processes, depending on magnetic configuration of the device. The
mechanisms leading to those effects are thoroughly discussed.
| cond-mat.mes-hall | we study the spinpolarized transport through a triple quantum dot molecule weakly coupled to ferromagnetic leads the analysis is performed by means of the realtime diagrammatic technique including up to the second order of perturbation expansion with respect to the tunnel coupling the emphasis is put on the impact of dark states on spinresolved transport characteristics it is shown that the interplay of coherent population trapping and cotunneling processes results in a highly nontrivial behavior of the tunnel magnetoresistance which can take negative values moreover a superpoissonian shot noise is found in transport regimes where the current is blocked by the formation of dark states which can be additionally enhanced by spindependence of tunneling processes depending on magnetic configuration of the device the mechanisms leading to those effects are thoroughly discussed | [['we', 'study', 'the', 'spinpolarized', 'transport', 'through', 'a', 'triple', 'quantum', 'dot', 'molecule', 'weakly', 'coupled', 'to', 'ferromagnetic', 'leads', 'the', 'analysis', 'is', 'performed', 'by', 'means', 'of', 'the', 'realtime', 'diagrammatic', 'technique', 'including', 'up', 'to', 'the', 'second', 'order', 'of', 'perturbation', 'expansion', 'with', 'respect', 'to', 'the', 'tunnel', 'coupling', 'the', 'emphasis', 'is', 'put', 'on', 'the', 'impact', 'of', 'dark', 'states', 'on', 'spinresolved', 'transport', 'characteristics', 'it', 'is', 'shown', 'that', 'the', 'interplay', 'of', 'coherent', 'population', 'trapping', 'and', 'cotunneling', 'processes', 'results', 'in', 'a', 'highly', 'nontrivial', 'behavior', 'of', 'the', 'tunnel', 'magnetoresistance', 'which', 'can', 'take', 'negative', 'values', 'moreover', 'a', 'superpoissonian', 'shot', 'noise', 'is', 'found', 'in', 'transport', 'regimes', 'where', 'the', 'current', 'is', 'blocked', 'by', 'the', 'formation', 'of', 'dark', 'states', 'which', 'can', 'be', 'additionally', 'enhanced', 'by', 'spindependence', 'of', 'tunneling', 'processes', 'depending', 'on', 'magnetic', 'configuration', 'of', 'the', 'device', 'the', 'mechanisms', 'leading', 'to', 'those', 'effects', 'are', 'thoroughly', 'discussed']] | [-0.18391469454962425, 0.17852229760774901, -0.08904437211747387, 0.0580750820342494, -0.030693258528547887, -0.13924007041322936, 0.055518372248296574, 0.34383919331749885, -0.27591956870715695, -0.29300214623088616, 0.02148389325562495, -0.291952901311887, -0.12840501836124268, 0.21910370473984545, 0.042238485967413385, 0.004698987022146248, 0.04286494354880948, -0.009459027949407811, -0.008400652438530144, -0.2199703805017079, 0.3518642246605871, 0.05627025660209159, 0.29977831426467605, 0.11110403637565275, 0.06815869843885872, -0.013623857401482021, 0.04650880437777982, 0.030779302233958063, -0.1255488129655803, 0.0584326624943171, 0.20059027368174367, -0.06641745522532982, 0.21624317253008485, -0.468187841380598, -0.19165498766877498, 0.012549400219395188, 0.1552846265162736, 0.12039814603458095, -0.04198221672841309, -0.31036449268545585, 0.0403881179940183, -0.1610312596965894, -0.07919353461035221, -0.10556766651357517, -0.026308682157110623, 0.02749725837502202, -0.275971750851422, 0.08267502008780894, 0.027517656091856593, -0.02049994210975657, 4.976446463065293e-05, -0.06178456343504252, -0.03887607588233668, 0.09287759110345754, 0.02774293679310336, -0.026490023741782963, 0.20108264717024588, -0.15636999227590007, -0.15010701811637814, 0.33998051113697864, -0.08971821802991749, -0.17431290317611156, 0.1757050795971153, -0.20313965454199956, -0.056184029451905544, 0.14552790538820204, 0.13181722062757195, 0.12266482827777953, -0.16982852925283423, 0.08879121660942724, 0.029243121606134275, 0.13103892684217458, 0.03542490542212231, 0.06541149840043246, 0.23584727814264653, 0.20574402041512876, 0.05956072634875149, 0.1426602181639053, -0.1268595035795748, -0.1295318366170555, -0.26016996144708104, -0.1250954480870193, -0.16315381014221952, 0.08817899880756602, -0.03250923290578133, -0.16345988381151927, 0.41229598654988614, 0.1591300765720715, 0.1913094943254219, -0.06740435644564795, 0.30185331748300837, 0.19343703196966977, 0.0467601629731224, -0.01314109871306151, 0.2559605681298315, 0.1830599241381696, 0.08155569013648929, -0.3146367727884159, 0.11215935696186569, -0.017173578960906346] |
1,802.02485 | BROJA-2PID: A robust estimator for bivariate partial information
decomposition | Makkeh, Theis, and Vicente found in [8] that Cone Programming model is the
most robust to compute the Bertschinger et al. partial information decompostion
(BROJA PID) measure [1]. We developed a production-quality robust software that
computes the BROJA PID measure based on the Cone Programming model. In this
paper, we prove the important property of strong duality for the Cone Program
and prove an equivalence between the Cone Program and the original Convex
problem. Then describe in detail our software and how to use it.\newline\indent
| math.OC | makkeh theis and vicente found in 8 that cone programming model is the most robust to compute the bertschinger et al partial information decompostion broja pid measure 1 we developed a productionquality robust software that computes the broja pid measure based on the cone programming model in this paper we prove the important property of strong duality for the cone program and prove an equivalence between the cone program and the original convex problem then describe in detail our software and how to use itnewlineindent | [['makkeh', 'theis', 'and', 'vicente', 'found', 'in', '8', 'that', 'cone', 'programming', 'model', 'is', 'the', 'most', 'robust', 'to', 'compute', 'the', 'bertschinger', 'et', 'al', 'partial', 'information', 'decompostion', 'broja', 'pid', 'measure', '1', 'we', 'developed', 'a', 'productionquality', 'robust', 'software', 'that', 'computes', 'the', 'broja', 'pid', 'measure', 'based', 'on', 'the', 'cone', 'programming', 'model', 'in', 'this', 'paper', 'we', 'prove', 'the', 'important', 'property', 'of', 'strong', 'duality', 'for', 'the', 'cone', 'program', 'and', 'prove', 'an', 'equivalence', 'between', 'the', 'cone', 'program', 'and', 'the', 'original', 'convex', 'problem', 'then', 'describe', 'in', 'detail', 'our', 'software', 'and', 'how', 'to', 'use', 'itnewlineindent']] | [-0.07514662788171007, -0.030366649855235423, -0.1375645413905023, 0.0917997742268111, -0.10028752130287957, -0.16953600255817355, 0.006095231781399484, 0.3503624756921487, -0.32655096291851937, -0.2852283541943474, 0.12018321496462561, -0.2490261562998934, -0.19553615357053566, 0.1673178326461958, -0.12330486563718822, 0.07894539851162313, 0.0204251622164016, -0.037664932658873405, -0.06528980222654092, -0.2304483086111989, 0.3042075483195753, 0.02734676207673837, 0.2452355929571821, 0.09273826723065541, 0.15190554351310234, 0.06856026911704116, -0.02860555224434798, 0.032709406688809395, -0.14987080554700183, 0.13668298697048598, 0.2640062503191272, 0.22159837620579695, 0.26625886102240665, -0.37670768516878766, -0.08121875108006489, 0.06568587771111942, 0.055739946863950646, 0.040650433928043725, -0.03771212234874312, -0.2456452863975372, 0.11708193453006356, -0.14764271167118148, -0.11163149724703238, -0.07144946369892323, 0.0347125407039042, -0.06098998670118401, -0.25254741126491903, -0.022448383484888507, 0.08965058520110886, 0.04166842848118619, -0.04403866173598511, -0.11945076057889376, -0.036460802461166515, 0.0371469959437129, 0.0010554260484515183, 0.08332868847653764, 0.06997320566505912, -0.027108129425288504, -0.16548802991852118, 0.33252783281257353, -0.042291466603953255, -0.18565813214125404, 0.1671497335472335, -0.10706680077296424, -0.1460149491273136, 0.07064953760849874, 0.18988101007080221, 0.1611385528862207, -0.16121683232710662, 0.12506256992255438, -0.08478105583239391, 0.17761915679796633, 0.0228265461943909, -0.01502253173525075, 0.11515077967084496, 0.1092974239285665, 0.10069109814757683, 0.1467066784669836, -0.02970473426786891, -0.07444780871499307, -0.27902554090033815, -0.20358133354190602, -0.1161063440531178, -0.027566381993826973, -0.050172005093821984, -0.14483762273553713, 0.37120415629953685, 0.18609376298824706, 0.13804101846559558, 0.11575787876878517, 0.28886011392102545, 0.08500041485292814, 0.01657509580969878, 0.13535497962014684, 0.23302337242267937, 0.12196257055164819, 0.08209905974252756, -0.2357163254889738, 0.059138760604637575, 0.12163003822451973] |
1,802.02486 | The field of quantum $GL(N,\mathbb{C})$ in the C$^*$-algebraic setting | Given a unital $*$-algebra $\mathscr{A}$ together with a suitable positive
filtration of its set of irreducible bounded representations, one can construct
a C$^*$-algebra $A_0$ with a dense two-sided ideal $A_c$ such that
$\mathscr{A}$ maps into the multiplier algebra of $A_c$. When the filtration is
induced from a central element in $\mathscr{A}$, we say that $\mathscr{A}$ is
an s$^*$-algebra. We also introduce the notion of $\mathscr{R}$-algebra
relative to a commutative s$^*$-algebra $\mathscr{R}$, and of Hopf
$\mathscr{R}$-algebra. We formulate conditions such that the completion of a
Hopf $\mathscr{R}$-algebra gives rise to a continuous field of Hopf
C$^*$-algebras over the spectrum of $R_0$. We apply the general theory to the
case of quantum $GL(N,\mathbb{C})$ as constructed from the FRT-formalism.
| math.QA math.OA | given a unital algebra mathscra together with a suitable positive filtration of its set of irreducible bounded representations one can construct a calgebra a_0 with a dense twosided ideal a_c such that mathscra maps into the multiplier algebra of a_c when the filtration is induced from a central element in mathscra we say that mathscra is an salgebra we also introduce the notion of mathscrralgebra relative to a commutative salgebra mathscrr and of hopf mathscrralgebra we formulate conditions such that the completion of a hopf mathscrralgebra gives rise to a continuous field of hopf calgebras over the spectrum of r_0 we apply the general theory to the case of quantum glnmathbbc as constructed from the frtformalism | [['given', 'a', 'unital', 'algebra', 'mathscra', 'together', 'with', 'a', 'suitable', 'positive', 'filtration', 'of', 'its', 'set', 'of', 'irreducible', 'bounded', 'representations', 'one', 'can', 'construct', 'a', 'calgebra', 'a_0', 'with', 'a', 'dense', 'twosided', 'ideal', 'a_c', 'such', 'that', 'mathscra', 'maps', 'into', 'the', 'multiplier', 'algebra', 'of', 'a_c', 'when', 'the', 'filtration', 'is', 'induced', 'from', 'a', 'central', 'element', 'in', 'mathscra', 'we', 'say', 'that', 'mathscra', 'is', 'an', 'salgebra', 'we', 'also', 'introduce', 'the', 'notion', 'of', 'mathscrralgebra', 'relative', 'to', 'a', 'commutative', 'salgebra', 'mathscrr', 'and', 'of', 'hopf', 'mathscrralgebra', 'we', 'formulate', 'conditions', 'such', 'that', 'the', 'completion', 'of', 'a', 'hopf', 'mathscrralgebra', 'gives', 'rise', 'to', 'a', 'continuous', 'field', 'of', 'hopf', 'calgebras', 'over', 'the', 'spectrum', 'of', 'r_0', 'we', 'apply', 'the', 'general', 'theory', 'to', 'the', 'case', 'of', 'quantum', 'glnmathbbc', 'as', 'constructed', 'from', 'the', 'frtformalism']] | [-0.14604110368729933, 0.09173809989347913, -0.11625326044614548, 0.017991922866634053, -0.09444381949167861, -0.14776815427467227, -0.027118080144788583, 0.33678460722060305, -0.4023445302701515, -0.11144306158884833, 0.10472895251890725, -0.2363378182782427, -0.1107132103132165, 0.1784923381779505, -0.16754783127132966, -0.04970631106685766, 0.07107322268673907, 0.1735673381380089, -0.10795141378134165, -0.17398032467792054, 0.39914618254760686, -0.0067488745188988425, 0.16889956347522853, 0.01884494086160608, 0.15782562919446955, -0.003984893696463626, -0.0027410353169493055, 0.04319612573346366, -0.20030376489936, 0.11490469163526659, 0.28509830382207163, 0.10158514145599759, 0.2505514391232282, -0.32429173868959366, -0.07364378812034493, 0.20729298382673575, 0.09738934976251229, 0.018218624776067293, -0.0411931951712493, -0.28869876977987585, 0.141342405302693, -0.29030960974809916, -0.09341764304908397, -0.05030921890764781, 0.07463209423054333, -0.03998843654990196, -0.35517743569191385, -0.009070900748939376, 0.10713757334673099, 0.10825478747770514, -0.0792124858217152, -0.052089552867793196, -0.0840905288639276, 0.09198965802712811, -0.07426271294446095, 0.06855310728145844, 0.13755962737309543, -0.07623160955212686, -0.11792160996600337, 0.36600436163337335, -0.08174370922269704, -0.2048604955866366, 0.12599744175904956, -0.17697527636976346, -0.13209482743202344, 0.1093085001749189, 0.0447826891084728, 0.10971629407823734, -0.014491899589547361, 0.21030164451652167, -0.17171249354015225, 0.0814600162625657, 0.04727602864251189, 0.03283672443155766, 0.14773807794503543, 0.09383952567232368, 0.10644870856169449, 0.16628184188967166, 0.028183619260949932, -0.013637577884061182, -0.375402415479007, -0.18005713599369577, -0.09785617497425689, 0.17091724534073602, -0.09919397723443461, -0.208273853474985, 0.4015287844221229, 0.11932955507755927, 0.22546767806634307, 0.09119324086476928, 0.21418161265875982, 0.09243403573725474, 0.08350147732897945, 0.025176481465282646, 0.08509305441023216, 0.2685409726008125, -0.011170132694077557, -0.12948455431184772, -0.0549460858794982, 0.21095433637294816] |
1,802.02487 | Invariant states on noncommutative tori | For any number $h$ such that $\hbar:=h/2\pi$ is irrational and any
skew-symmetric, non-degenerate bilinear form $\sigma:\mathbb{Z}^{2g}\times
\mathbb{Z}^{2g} \to \mathbb{Z}$, let be $\mathcal{A}^h_{g,\sigma}$ be the
twisted group $*$-algebra $\mathbb{C}[\mathbb{Z}^{2g}]$ and consider the
ergodic group of $*$-automorphisms of $\mathcal{A}^h_{g,\sigma}$ induced by the
action of the symplectic group Sp$(\mathbb{Z}^{2g},\sigma)$. We show that the
only Sp$(\mathbb{Z}^{2g},\sigma)$-invariant state on $\mathcal{A}^h_{g,\sigma}$
is the trace state $\tau$.
| math.OA math-ph math.FA math.MP math.QA | for any number h such that hbarh2pi is irrational and any skewsymmetric nondegenerate bilinear form sigmamathbbz2gtimes mathbbz2g to mathbbz let be mathcalah_gsigma be the twisted group algebra mathbbcmathbbz2g and consider the ergodic group of automorphisms of mathcalah_gsigma induced by the action of the symplectic group spmathbbz2gsigma we show that the only spmathbbz2gsigmainvariant state on mathcalah_gsigma is the trace state tau | [['for', 'any', 'number', 'h', 'such', 'that', 'hbarh2pi', 'is', 'irrational', 'and', 'any', 'skewsymmetric', 'nondegenerate', 'bilinear', 'form', 'sigmamathbbz2gtimes', 'mathbbz2g', 'to', 'mathbbz', 'let', 'be', 'mathcalah_gsigma', 'be', 'the', 'twisted', 'group', 'algebra', 'mathbbcmathbbz2g', 'and', 'consider', 'the', 'ergodic', 'group', 'of', 'automorphisms', 'of', 'mathcalah_gsigma', 'induced', 'by', 'the', 'action', 'of', 'the', 'symplectic', 'group', 'spmathbbz2gsigma', 'we', 'show', 'that', 'the', 'only', 'spmathbbz2gsigmainvariant', 'state', 'on', 'mathcalah_gsigma', 'is', 'the', 'trace', 'state', 'tau']] | [-0.23264002865525307, 0.17439762480487978, -0.06351219569505365, -0.018350413358011457, -0.10386397282558459, -0.12949888441815144, 0.0009691027096576161, 0.34849727740166364, -0.34500164048815213, -0.1801046714902407, 0.13893721762320232, -0.25059118570276984, -0.12523418597023314, 0.16149673562634875, -0.07344350333463538, -0.06950265596862193, 0.07322621024299965, 0.18674902171241464, -0.09814373785802336, -0.22446784984613596, 0.43360911230384197, -0.059112401092769926, 0.162656359202056, 0.0011348134527603786, 0.09811661176866403, 0.010232901955195875, 0.015616379471288787, -0.03534457281111153, -0.06531367134610061, 0.03492166027771654, 0.21602108826239905, 0.048796033374620254, 0.17565893143829373, -0.37069082508484524, -0.16526009321764665, 0.24544873431807868, 0.11011830168879694, -0.0385538917724733, -0.023948052149973118, -0.3187044702332329, 0.13483537961642636, -0.20885201350406365, -0.11679580627457688, -0.09424316930515622, 0.0697618005797267, -0.01682989252731204, -0.29104401467850916, 0.01466783594460813, 0.09170842142258254, 0.09096272143155888, -0.05218663590063376, -0.09603003460775923, -0.09369344037043413, 0.1242283100038077, -0.023739772212812333, 0.09518337611505692, 0.1170167554670048, -0.07150097422439743, -0.10273977179356196, 0.3974220886550568, -0.11294443067163229, -0.2540141068295472, 0.09137339865857805, -0.20589512126106355, -0.16644716618099697, 0.11519065456188939, 0.0911942824928297, 0.1415110128345313, -0.03212897369155177, 0.2051915837499244, -0.171738815476635, 0.10428120583916704, 0.012237539273445253, -0.01928469870256743, 0.10439598339790893, 0.014009175653983321, 0.11746726041935661, 0.09749213478062302, 0.03980485704744718, -0.02816603390264963, -0.32344218164130495, -0.23625908804522758, -0.14384382663087714, 0.20200736548199696, -0.09339030307698219, -0.1483977460819814, 0.37034111478176246, 0.0554823970284175, 0.15871146532568942, 0.08004717594357552, 0.16708228709521117, 0.13877421670972748, 0.08070506343480062, 0.10838657489943283, 0.09421620971557719, 0.20323264844180947, -0.1304717582943677, -0.254177301613338, 0.012243993175043552, 0.198227785596693] |
1,802.02488 | SCH-GAN: Semi-supervised Cross-modal Hashing by Generative Adversarial
Network | Cross-modal hashing aims to map heterogeneous multimedia data into a common
Hamming space, which can realize fast and flexible retrieval across different
modalities. Supervised cross-modal hashing methods have achieved considerable
progress by incorporating semantic side information. However, they mainly have
two limitations: (1) Heavily rely on large-scale labeled cross-modal training
data which are labor intensive and hard to obtain. (2) Ignore the rich
information contained in the large amount of unlabeled data across different
modalities, especially the margin examples that are easily to be incorrectly
retrieved, which can help to model the correlations. To address these problems,
in this paper we propose a novel Semi-supervised Cross-Modal Hashing approach
by Generative Adversarial Network (SCH-GAN). We aim to take advantage of GAN's
ability for modeling data distributions to promote cross-modal hashing learning
in an adversarial way. The main contributions can be summarized as follows: (1)
We propose a novel generative adversarial network for cross-modal hashing. In
our proposed SCH-GAN, the generative model tries to select margin examples of
one modality from unlabeled data when giving a query of another modality. While
the discriminative model tries to distinguish the selected examples and true
positive examples of the query. These two models play a minimax game so that
the generative model can promote the hashing performance of discriminative
model. (2) We propose a reinforcement learning based algorithm to drive the
training of proposed SCH-GAN. The generative model takes the correlation score
predicted by discriminative model as a reward, and tries to select the examples
close to the margin to promote discriminative model by maximizing the margin
between positive and negative data. Experiments on 3 widely-used datasets
verify the effectiveness of our proposed approach.
| cs.CV | crossmodal hashing aims to map heterogeneous multimedia data into a common hamming space which can realize fast and flexible retrieval across different modalities supervised crossmodal hashing methods have achieved considerable progress by incorporating semantic side information however they mainly have two limitations 1 heavily rely on largescale labeled crossmodal training data which are labor intensive and hard to obtain 2 ignore the rich information contained in the large amount of unlabeled data across different modalities especially the margin examples that are easily to be incorrectly retrieved which can help to model the correlations to address these problems in this paper we propose a novel semisupervised crossmodal hashing approach by generative adversarial network schgan we aim to take advantage of gans ability for modeling data distributions to promote crossmodal hashing learning in an adversarial way the main contributions can be summarized as follows 1 we propose a novel generative adversarial network for crossmodal hashing in our proposed schgan the generative model tries to select margin examples of one modality from unlabeled data when giving a query of another modality while the discriminative model tries to distinguish the selected examples and true positive examples of the query these two models play a minimax game so that the generative model can promote the hashing performance of discriminative model 2 we propose a reinforcement learning based algorithm to drive the training of proposed schgan the generative model takes the correlation score predicted by discriminative model as a reward and tries to select the examples close to the margin to promote discriminative model by maximizing the margin between positive and negative data experiments on 3 widelyused datasets verify the effectiveness of our proposed approach | [['crossmodal', 'hashing', 'aims', 'to', 'map', 'heterogeneous', 'multimedia', 'data', 'into', 'a', 'common', 'hamming', 'space', 'which', 'can', 'realize', 'fast', 'and', 'flexible', 'retrieval', 'across', 'different', 'modalities', 'supervised', 'crossmodal', 'hashing', 'methods', 'have', 'achieved', 'considerable', 'progress', 'by', 'incorporating', 'semantic', 'side', 'information', 'however', 'they', 'mainly', 'have', 'two', 'limitations', '1', 'heavily', 'rely', 'on', 'largescale', 'labeled', 'crossmodal', 'training', 'data', 'which', 'are', 'labor', 'intensive', 'and', 'hard', 'to', 'obtain', '2', 'ignore', 'the', 'rich', 'information', 'contained', 'in', 'the', 'large', 'amount', 'of', 'unlabeled', 'data', 'across', 'different', 'modalities', 'especially', 'the', 'margin', 'examples', 'that', 'are', 'easily', 'to', 'be', 'incorrectly', 'retrieved', 'which', 'can', 'help', 'to', 'model', 'the', 'correlations', 'to', 'address', 'these', 'problems', 'in', 'this', 'paper', 'we', 'propose', 'a', 'novel', 'semisupervised', 'crossmodal', 'hashing', 'approach', 'by', 'generative', 'adversarial', 'network', 'schgan', 'we', 'aim', 'to', 'take', 'advantage', 'of', 'gans', 'ability', 'for', 'modeling', 'data', 'distributions', 'to', 'promote', 'crossmodal', 'hashing', 'learning', 'in', 'an', 'adversarial', 'way', 'the', 'main', 'contributions', 'can', 'be', 'summarized', 'as', 'follows', '1', 'we', 'propose', 'a', 'novel', 'generative', 'adversarial', 'network', 'for', 'crossmodal', 'hashing', 'in', 'our', 'proposed', 'schgan', 'the', 'generative', 'model', 'tries', 'to', 'select', 'margin', 'examples', 'of', 'one', 'modality', 'from', 'unlabeled', 'data', 'when', 'giving', 'a', 'query', 'of', 'another', 'modality', 'while', 'the', 'discriminative', 'model', 'tries', 'to', 'distinguish', 'the', 'selected', 'examples', 'and', 'true', 'positive', 'examples', 'of', 'the', 'query', 'these', 'two', 'models', 'play', 'a', 'minimax', 'game', 'so', 'that', 'the', 'generative', 'model', 'can', 'promote', 'the', 'hashing', 'performance', 'of', 'discriminative', 'model', '2', 'we', 'propose', 'a', 'reinforcement', 'learning', 'based', 'algorithm', 'to', 'drive', 'the', 'training', 'of', 'proposed', 'schgan', 'the', 'generative', 'model', 'takes', 'the', 'correlation', 'score', 'predicted', 'by', 'discriminative', 'model', 'as', 'a', 'reward', 'and', 'tries', 'to', 'select', 'the', 'examples', 'close', 'to', 'the', 'margin', 'to', 'promote', 'discriminative', 'model', 'by', 'maximizing', 'the', 'margin', 'between', 'positive', 'and', 'negative', 'data', 'experiments', 'on', '3', 'widelyused', 'datasets', 'verify', 'the', 'effectiveness', 'of', 'our', 'proposed', 'approach']] | [0.0007775785813715616, -0.0041279941684074905, -0.07268702349455286, 0.12964477908578917, -0.1499987177456492, -0.23171343920939338, 0.04017443608911541, 0.4626994130058101, -0.3101669392852266, -0.3363359505811366, 0.013694878297066816, -0.305176475201942, -0.17157275158257682, 0.13289401721957017, -0.17625088922639368, 0.08595396770251161, 0.1001116525945938, 0.03048326813500695, -0.03929053149878725, -0.3241451954200787, 0.3515080792402121, 0.03386522569162871, 0.35840138679163325, 0.026620878262184962, 0.12902170312207017, -0.0507469345192929, -0.04248058084835796, -0.018192097446718503, -0.06852527635791014, 0.21363862993956734, 0.3635691402896457, 0.25687925063247213, 0.36756909710244945, -0.3892722734705775, -0.23664713167254964, 0.13170278367693253, 0.12721621974348007, 0.11169975814765268, -0.05400856635466512, -0.35538097197610524, 0.0825599667367502, -0.18156231490967756, 0.08518964703948785, -0.1986570718553884, -0.061516861034069864, -0.02671975931248671, -0.34275471750566716, 0.004698205930364441, 0.11101334694586026, 0.01530522555212981, -0.029244090059077816, -0.11439819345217345, 0.02235799962754852, 0.1579452850039102, 0.060601591496431274, 0.08198723947674397, 0.09614807937968535, -0.18396648274080354, -0.1445367761358108, 0.3325442079401251, -0.03934906722850911, -0.20524119188605164, 0.18590361992144241, -0.020400104016119008, -0.13022669524039512, 0.0917569525288685, 0.2742795361586476, 0.12288473011589088, -0.1742551871105477, -0.010863570355614948, -0.03996492113699422, 0.1817123298399738, 0.027961747974948457, 0.0010571865409555908, 0.17312150613211202, 0.2402464139056609, 0.022814341955133932, 0.18470991652719276, -0.14186466104387702, -0.08387831193778837, -0.18666479481120452, -0.06676951558312474, -0.24007252814401756, -0.049319004541405684, -0.1266826326942875, -0.11880209343340982, 0.389542998814468, 0.255608353210533, 0.24771146210088682, 0.09709239498512673, 0.3530716927618616, -0.020483093892013835, 0.13346525270652065, 0.08478004031056892, 0.17141744316518842, 0.003452104634828999, 0.12856778893102375, -0.1484768855106753, 0.12508280608499686, 0.053144364691202574] |
1,802.02489 | Pressure-driven dynamics of liquid plugs in rectangular microchannels:
influence of the transition between quasi-static and dynamic film deposition
regimes | In this paper, we study experimentally and theoretically the dynamics of
liquid plugs in rectangular microchannels for both unidirectional and cyclic
pressure forcing. In both cases, it is shown that the transition between
quasi-static and dynamic film deposition behind the liquid plug leads to a
dramatic acceleration of the plug, rapidly leading to its rupture. This
behaviour proper to channels with sharp corners is recovered from a reduced
dimension model based on previous theoretical and numerical developments. In
addition, it is shown for cyclic periodic forcing that the plug undergoes
stable periodic oscillations if it remains in the quasi-static film deposition
regime during the first cycle, while otherwise it accelerates cyclically and
ruptures. The transition between these two regimes occurs at a
pressure-dependent critical initial length, whose value can be predicted
theoretically.
| physics.flu-dyn physics.class-ph | in this paper we study experimentally and theoretically the dynamics of liquid plugs in rectangular microchannels for both unidirectional and cyclic pressure forcing in both cases it is shown that the transition between quasistatic and dynamic film deposition behind the liquid plug leads to a dramatic acceleration of the plug rapidly leading to its rupture this behaviour proper to channels with sharp corners is recovered from a reduced dimension model based on previous theoretical and numerical developments in addition it is shown for cyclic periodic forcing that the plug undergoes stable periodic oscillations if it remains in the quasistatic film deposition regime during the first cycle while otherwise it accelerates cyclically and ruptures the transition between these two regimes occurs at a pressuredependent critical initial length whose value can be predicted theoretically | [['in', 'this', 'paper', 'we', 'study', 'experimentally', 'and', 'theoretically', 'the', 'dynamics', 'of', 'liquid', 'plugs', 'in', 'rectangular', 'microchannels', 'for', 'both', 'unidirectional', 'and', 'cyclic', 'pressure', 'forcing', 'in', 'both', 'cases', 'it', 'is', 'shown', 'that', 'the', 'transition', 'between', 'quasistatic', 'and', 'dynamic', 'film', 'deposition', 'behind', 'the', 'liquid', 'plug', 'leads', 'to', 'a', 'dramatic', 'acceleration', 'of', 'the', 'plug', 'rapidly', 'leading', 'to', 'its', 'rupture', 'this', 'behaviour', 'proper', 'to', 'channels', 'with', 'sharp', 'corners', 'is', 'recovered', 'from', 'a', 'reduced', 'dimension', 'model', 'based', 'on', 'previous', 'theoretical', 'and', 'numerical', 'developments', 'in', 'addition', 'it', 'is', 'shown', 'for', 'cyclic', 'periodic', 'forcing', 'that', 'the', 'plug', 'undergoes', 'stable', 'periodic', 'oscillations', 'if', 'it', 'remains', 'in', 'the', 'quasistatic', 'film', 'deposition', 'regime', 'during', 'the', 'first', 'cycle', 'while', 'otherwise', 'it', 'accelerates', 'cyclically', 'and', 'ruptures', 'the', 'transition', 'between', 'these', 'two', 'regimes', 'occurs', 'at', 'a', 'pressuredependent', 'critical', 'initial', 'length', 'whose', 'value', 'can', 'be', 'predicted', 'theoretically']] | [-0.14390703463560026, 0.22927693903417976, -0.09053796581627632, -0.015295428092499744, -0.003353725205119135, -0.1491119293989896, 0.05237261499331163, 0.3970405786636878, -0.32158633178121154, -0.2181072956388534, 0.10268461942288207, -0.234613608512463, -0.18606344770964686, 0.19908111783936902, -0.04895056309319581, 0.04872627872188759, 0.02783767602258277, 0.003490291451188651, -0.04781741920195407, -0.1954904734862573, 0.2541888607912838, 0.054868558322954356, 0.3191384292211186, 0.08396655737394185, 0.07865020350877647, -0.0522543092739039, 0.07419189423407344, 0.04241257797580009, -0.20445074130420285, -0.02081159433124192, 0.20286882534018139, -0.022723466290203345, 0.2274700952411601, -0.47417978368078667, -0.2528341467647503, 0.07370373888900786, 0.14022706664223789, 0.12096738707888025, -0.04921844484510295, -0.20025840951270904, 0.07907993491442705, -0.14009846241925983, -0.13252465500298774, -0.04825644878755239, 0.07200082642322575, -0.0003980857233700314, -0.27136942429580924, 0.08375510332795481, 0.1068236369385638, 0.03903167769947851, -0.04501891438231916, -0.028470062828890867, -0.04525052993840566, 0.10755044187570809, 0.0893443198671748, 0.027072485782396558, 0.14545086645662333, -0.1156884609601658, -0.03896367784137979, 0.3614741092738272, -0.06177455320721492, -0.13300096228803424, 0.22875318794236096, -0.1751407435989346, -0.04248846338172867, 0.21649118389398087, 0.14774473079226233, 0.08499079902442948, -0.11081633778909843, 0.0212150545677022, -0.009787761034782638, 0.15846295134785274, 0.1323581063382638, -0.06620106546236484, 0.20660064753963414, 0.21612803189253266, 0.07651431059595339, 0.17492038721948946, -0.09187231720495743, -0.12808090501119185, -0.2752052333036607, -0.12440928730013018, -0.1448121732788753, 0.008605723738472796, -0.07181129580887059, -0.20196719670264318, 0.38941692081138946, 0.1384091255128045, 0.16387625403832784, 0.015582700351704701, 0.2767037884649736, 0.08495066415828963, 0.0338606288326749, 0.08491357480119349, 0.2817400003973903, 0.14259960198383356, 0.11932101312523821, -0.2526532382471487, 0.0962247467656253, 0.03914720805672308] |
1,802.0249 | Conformal invariance and the Lundgren-Monin-Novikov equations for
vorticity fields in 2D turbulence: Refuting a recent claim | The recent claim by Grebenev et al. [J. Phys. A: Math. Theor. 50, 435502
(2017)] that the inviscid 2D Lundgren-Monin-Novikov (LMN) equations on a zero
vorticity characteristic naturally would reveal local conformal invariance when
only analyzing these by means of a classical Lie-group symmetry approach, is
invalid and will be refuted in the present comment. To note is that within this
comment the (possible) existence of conformal invariance in 2D turbulence is
not questioned, only the conclusion as is given in Grebenev et al. (2017) and
their approach how this invariance was derived is what is being criticized and
refuted herein. In fact, the algebraic derivation for conformal invariance of
the 2D LMN vorticity equations in Grebenev et al. (2017) is flawed. A key
constraint of the LMN equations has been wrongly transformed. Providing the
correct transformation instead will lead to a breaking of the proclaimed
conformal group. The corrected version of Grebenev et al. (2017) just leads to
a globally constant scaling in the fields and not to a local one as claimed. In
consequence, since in Grebenev et al. (2017) only the first equation within the
infinite and unclosed LMN chain is considered, also different Lie-group
infinitesimals for the one- and two-point probability density functions (PDFs)
will result from this correction, replacing thus the misleading ones proposed.
| physics.flu-dyn cond-mat.stat-mech math-ph math.MP | the recent claim by grebenev et al j phys a math theor 50 435502 2017 that the inviscid 2d lundgrenmoninnovikov lmn equations on a zero vorticity characteristic naturally would reveal local conformal invariance when only analyzing these by means of a classical liegroup symmetry approach is invalid and will be refuted in the present comment to note is that within this comment the possible existence of conformal invariance in 2d turbulence is not questioned only the conclusion as is given in grebenev et al 2017 and their approach how this invariance was derived is what is being criticized and refuted herein in fact the algebraic derivation for conformal invariance of the 2d lmn vorticity equations in grebenev et al 2017 is flawed a key constraint of the lmn equations has been wrongly transformed providing the correct transformation instead will lead to a breaking of the proclaimed conformal group the corrected version of grebenev et al 2017 just leads to a globally constant scaling in the fields and not to a local one as claimed in consequence since in grebenev et al 2017 only the first equation within the infinite and unclosed lmn chain is considered also different liegroup infinitesimals for the one and twopoint probability density functions pdfs will result from this correction replacing thus the misleading ones proposed | [['the', 'recent', 'claim', 'by', 'grebenev', 'et', 'al', 'j', 'phys', 'a', 'math', 'theor', '50', '435502', '2017', 'that', 'the', 'inviscid', '2d', 'lundgrenmoninnovikov', 'lmn', 'equations', 'on', 'a', 'zero', 'vorticity', 'characteristic', 'naturally', 'would', 'reveal', 'local', 'conformal', 'invariance', 'when', 'only', 'analyzing', 'these', 'by', 'means', 'of', 'a', 'classical', 'liegroup', 'symmetry', 'approach', 'is', 'invalid', 'and', 'will', 'be', 'refuted', 'in', 'the', 'present', 'comment', 'to', 'note', 'is', 'that', 'within', 'this', 'comment', 'the', 'possible', 'existence', 'of', 'conformal', 'invariance', 'in', '2d', 'turbulence', 'is', 'not', 'questioned', 'only', 'the', 'conclusion', 'as', 'is', 'given', 'in', 'grebenev', 'et', 'al', '2017', 'and', 'their', 'approach', 'how', 'this', 'invariance', 'was', 'derived', 'is', 'what', 'is', 'being', 'criticized', 'and', 'refuted', 'herein', 'in', 'fact', 'the', 'algebraic', 'derivation', 'for', 'conformal', 'invariance', 'of', 'the', '2d', 'lmn', 'vorticity', 'equations', 'in', 'grebenev', 'et', 'al', '2017', 'is', 'flawed', 'a', 'key', 'constraint', 'of', 'the', 'lmn', 'equations', 'has', 'been', 'wrongly', 'transformed', 'providing', 'the', 'correct', 'transformation', 'instead', 'will', 'lead', 'to', 'a', 'breaking', 'of', 'the', 'proclaimed', 'conformal', 'group', 'the', 'corrected', 'version', 'of', 'grebenev', 'et', 'al', '2017', 'just', 'leads', 'to', 'a', 'globally', 'constant', 'scaling', 'in', 'the', 'fields', 'and', 'not', 'to', 'a', 'local', 'one', 'as', 'claimed', 'in', 'consequence', 'since', 'in', 'grebenev', 'et', 'al', '2017', 'only', 'the', 'first', 'equation', 'within', 'the', 'infinite', 'and', 'unclosed', 'lmn', 'chain', 'is', 'considered', 'also', 'different', 'liegroup', 'infinitesimals', 'for', 'the', 'one', 'and', 'twopoint', 'probability', 'density', 'functions', 'pdfs', 'will', 'result', 'from', 'this', 'correction', 'replacing', 'thus', 'the', 'misleading', 'ones', 'proposed']] | [-0.08695570210146039, 0.09050092199889925, -0.11273976303038931, 0.0346935649766638, -0.11310475508878948, -0.09807947993389579, 0.014336584965749686, 0.2722834993961242, -0.2170074285315606, -0.31288407422140785, 0.07224323613774203, -0.2448521127428757, -0.173459365898786, 0.14518664144791252, -0.12486913139128698, 0.05862718082242432, -0.008891842492488682, -0.03732846522332092, -0.07121275148448991, -0.3091512396403974, 0.27026563578545876, 0.1167163508057748, 0.29791175084011823, 0.04074686175477136, 0.08641117829466324, -0.004811992377487071, -0.06451820739178593, 0.03754150472878299, -0.1378351442813964, 0.048031507001724094, 0.21492823676383466, 0.10522883223399622, 0.2585402925139925, -0.402835677950344, -0.21097672241526322, 0.045407323969886934, 0.11384052456006272, 0.15706347600223686, -0.015633978774672836, -0.32938022509114734, 0.07322385829714247, -0.1679618144076779, -0.15564236479038115, -0.06772647740174119, 0.11706902111606532, -0.02399433245925113, -0.24528575784082465, 0.14628517849324044, 0.14428727267525765, 0.042063027385348846, -0.016511962898588237, -0.0872114210580732, -0.04727842987497944, 0.02107108402487271, 0.030550764948385982, 0.08020724043989161, 0.0684469603464662, -0.07573808264521319, -0.09467052382528099, 0.3740164955171175, -0.03425685865452103, -0.20441380762409658, 0.1729950906864769, -0.1017704624340895, -0.17673007322159176, 0.08213283731644853, 0.08796954696032501, 0.09759314808088841, -0.14958347946357617, 0.16036695346221277, -0.1252424216993717, 0.12188397853586122, 0.11914253157751481, -0.041354540479155856, 0.16831314464637992, 0.06145415068475889, 0.012853001331944667, 0.04683076581915567, -0.006142963394693552, -0.08546640201196194, -0.34437322928014835, -0.1744912114729165, -0.22377157571016376, 0.09099446124423385, 0.00757114704868675, -0.12372730231850297, 0.3355767269364618, 0.16859669260424232, 0.17217247734602473, 0.013751637043192162, 0.20617953674876294, 0.14184546948799334, 0.04963728152386366, 0.12337512225916591, 0.28844960998965924, 0.1445793539537715, 0.11574845766667875, -0.16200318569990318, 0.0457316661481062, 0.15756208907603633] |
1,802.02491 | The law of a point process of Brownian excursions in a domain is
determined by the law of its trace | We show the result that is stated in the title of the paper, which has
consequences about decomposition of Brownian loop-soup clusters in two
dimensions.
| math.PR | we show the result that is stated in the title of the paper which has consequences about decomposition of brownian loopsoup clusters in two dimensions | [['we', 'show', 'the', 'result', 'that', 'is', 'stated', 'in', 'the', 'title', 'of', 'the', 'paper', 'which', 'has', 'consequences', 'about', 'decomposition', 'of', 'brownian', 'loopsoup', 'clusters', 'in', 'two', 'dimensions']] | [-0.11501944601535798, 0.10266750112175942, -0.11963331691920757, -0.00046791562344878913, -0.020869247382506728, -0.0020711714774370193, -0.013863762426190078, 0.3452621777355671, -0.25305097579956054, -0.2766600528359413, 0.09158513740636408, -0.25159262627363205, -0.21456124087795614, 0.16810069797560573, -0.127463054433465, -0.032409458942711356, 0.07128582552075385, 0.07138558629900217, 0.015243249544873834, -0.3370510360598564, 0.3579586002230644, -0.024616546034812926, 0.21464711874723436, 0.07762723542749882, 0.10077582873404026, -0.023076140228658913, -0.03972272664308548, 0.05623706739395857, -0.1639913293826976, 0.1237339793262072, 0.19434924125671388, 0.0861532974243164, 0.2833626174926758, -0.35032043524086476, -0.19495496874675156, 0.08219108378514647, 0.16751266606152057, 0.09002848201896996, -0.02813308045268059, -0.26239700682461264, 0.1193066430836916, -0.13166365679353476, -0.15490734693594277, -0.002616986259818077, 0.05413393944501877, -0.030301715508103372, -0.1951629427820444, 0.12065162666141988, 0.20795591786503792, 0.035902739018201825, -0.09314375411719084, -0.15859255304560066, 0.05051086015999317, 0.13252442804165185, 0.10476679283194244, -0.007522209044545889, 0.07946708660572767, -0.11838579088449479, -0.16834579337388278, 0.4024555176496506, -0.04116929810494185, -0.1823443952947855, 0.20133231550455094, -0.212920058183372, -0.23360215604305268, 0.03076559130102396, 0.11254619654268026, 0.08298518814146519, -0.17454693496227264, 0.129751851670444, -0.1505737106874585, 0.15209846824407577, 0.17662002377212047, -0.010289506819099188, 0.10609522148966789, 0.15519135169219225, 0.09561971414834261, 0.1899936792254448, -0.031131998877972366, -0.10521121049299836, -0.3030567255616188, -0.23755573742091657, -0.21819008491933345, 0.08679490808397532, -0.07927041057497262, -0.12751623641699553, 0.36376378789544106, 0.18419465333223342, 0.19984869234263897, 0.018523433660157025, 0.2150312776118517, 0.11498333619907498, 0.0038440000265836717, 0.06616657918319106, 0.20029993176460267, 0.13696077339351176, 0.08584415227174759, -0.11586586387827992, 0.03826339989900589, 0.11868486024439334] |
1,802.02492 | $T$-odd correlations in polarized top quark decays in the sequential
decay $t(\uparrow) \to X_b+W^+(\to \ell^+ + \nu_\ell)$ and in the quasi
three-body decay $t(\uparrow) \to X_b+ \ell^+ + \nu_\ell$ | We identify the $T$-odd structure functions that appear in the description of
polarized top quark decays in the sequential decay $t(\uparrow) \to X_b+W^+(\to
\ell^+ + \nu_\ell)$ (two structure functions) and the quasi-three-body decay
$t(\uparrow) \to X_b+ \ell^+ + \nu_\ell$ (one structure function). A convenient
measure of the magnitude of the $T$-odd structure functions is the contribution
of the imaginary part Im $g_R$ of the right-chiral tensor coupling $g_R$ to the
$T$-odd structure functions which we work out. Contrary to the case of QCD the
NLO electroweak corrections to polarized top quark decays admit of absorptive
one-loop vertex contributions. We analytically calculate the imaginary parts of
the relevant four electroweak one-loop triangle vertex diagrams and determine
their contributions to the $T$-odd helicity structure functions that appear in
the description of polarized top quark decays.
| hep-ph hep-ex | we identify the todd structure functions that appear in the description of polarized top quark decays in the sequential decay tuparrow to x_bwto ell nu_ell two structure functions and the quasithreebody decay tuparrow to x_b ell nu_ell one structure function a convenient measure of the magnitude of the todd structure functions is the contribution of the imaginary part im g_r of the rightchiral tensor coupling g_r to the todd structure functions which we work out contrary to the case of qcd the nlo electroweak corrections to polarized top quark decays admit of absorptive oneloop vertex contributions we analytically calculate the imaginary parts of the relevant four electroweak oneloop triangle vertex diagrams and determine their contributions to the todd helicity structure functions that appear in the description of polarized top quark decays | [['we', 'identify', 'the', 'todd', 'structure', 'functions', 'that', 'appear', 'in', 'the', 'description', 'of', 'polarized', 'top', 'quark', 'decays', 'in', 'the', 'sequential', 'decay', 'tuparrow', 'to', 'x_bwto', 'ell', 'nu_ell', 'two', 'structure', 'functions', 'and', 'the', 'quasithreebody', 'decay', 'tuparrow', 'to', 'x_b', 'ell', 'nu_ell', 'one', 'structure', 'function', 'a', 'convenient', 'measure', 'of', 'the', 'magnitude', 'of', 'the', 'todd', 'structure', 'functions', 'is', 'the', 'contribution', 'of', 'the', 'imaginary', 'part', 'im', 'g_r', 'of', 'the', 'rightchiral', 'tensor', 'coupling', 'g_r', 'to', 'the', 'todd', 'structure', 'functions', 'which', 'we', 'work', 'out', 'contrary', 'to', 'the', 'case', 'of', 'qcd', 'the', 'nlo', 'electroweak', 'corrections', 'to', 'polarized', 'top', 'quark', 'decays', 'admit', 'of', 'absorptive', 'oneloop', 'vertex', 'contributions', 'we', 'analytically', 'calculate', 'the', 'imaginary', 'parts', 'of', 'the', 'relevant', 'four', 'electroweak', 'oneloop', 'triangle', 'vertex', 'diagrams', 'and', 'determine', 'their', 'contributions', 'to', 'the', 'todd', 'helicity', 'structure', 'functions', 'that', 'appear', 'in', 'the', 'description', 'of', 'polarized', 'top', 'quark', 'decays']] | [-0.13116762647766245, 0.22381804723205956, -0.11566469593103541, 0.17795569975697978, -0.09840230113833912, -0.10323074956373997, 0.036341918822803874, 0.30723621491198394, -0.27224944559171393, -0.16258865022353192, -0.05825000106042987, -0.33806994925848705, -0.05004905593083348, 0.0822555372101623, 0.1773629965433894, 0.05905682987771755, 0.019652357837546243, -0.013273747554843047, -0.09127916272570805, -0.24927223452489622, 0.3307710162890974, -0.046825915842151, 0.18443121507226007, 0.1609800653604343, -0.010117285083546194, 0.03641405756505885, -0.0841522400498448, -0.12167539649693541, -0.12268215433440384, 0.06197352331247209, 0.1814447466952748, 0.0161899244701562, 0.08315747230162107, -0.31313066780133997, 0.0013827380143077105, 0.14872285644993072, 0.1191962333576566, 0.07203376226130757, 0.06344470618538155, -0.25381284394633574, 0.1254717050401797, -0.21688728760422546, -0.13225627874291335, -0.12072527301750442, 0.025873786343853605, -0.10492406554642862, -0.3210359837475428, 0.024526052844761184, -0.015430993682076765, -0.012295144523472287, 0.03493443171876345, -0.24402073923816053, -0.08558647081349767, 0.09480719774864008, 0.1259017624349869, 0.11262085464920184, 0.1648453143389188, -0.22137903591054817, -0.18178818975178193, 0.3890549101354193, -0.0999822778583959, -0.22148547759784978, 0.08154198380237691, -0.2710515614851674, -0.1569335313095141, 0.14073031644748393, 0.21267509295843368, 0.13898154074919966, -0.1277764886428147, 0.205812343395344, -0.007463596634884444, 0.12793674834375812, 0.08568312581484169, 0.05563394365608403, 0.16619593118743378, 0.09279918739962023, -0.010662367964495522, 0.14151902096129435, -0.020914213836568503, -0.08980920204762803, -0.4495891956395881, -0.11130498752517756, -0.06974465233930784, 0.09339098561945003, -0.06817743720016586, -0.21448033320349316, 0.4810512106822327, 0.056326094134024875, 0.24939774839652434, 0.022066313528831212, 0.3269324627553308, 0.10049335523138488, 0.13973162997091665, 0.03158371391265776, 0.2649794983562053, 0.23688438249744706, 0.08650446452503634, -0.2733555610558783, 0.022669652055465263, 0.14638165705440234] |
1,802.02493 | Up to topological concordance links are strongly quasipositive | We generalize an algorithm of Rudolph to establish that every link is
topologically concordant to a strongly quasipositive link.
| math.GT | we generalize an algorithm of rudolph to establish that every link is topologically concordant to a strongly quasipositive link | [['we', 'generalize', 'an', 'algorithm', 'of', 'rudolph', 'to', 'establish', 'that', 'every', 'link', 'is', 'topologically', 'concordant', 'to', 'a', 'strongly', 'quasipositive', 'link']] | [-0.2843652420530194, 0.11411205128426541, -0.15747674436945663, 0.09443471328919067, -0.18309053602187256, -0.3099441182995705, 0.09252059734181355, 0.393627849456511, -0.28795971976299034, -0.205231628037597, 0.007070447244730435, -0.2522886591522317, -0.2941040945680518, 0.18704621753606357, -0.2022659543803648, -0.11168747081568367, 0.06552259349509289, 0.04931862191542199, -0.07104443875141442, -0.30717031579268606, 0.3309861627456389, -0.009627412024297212, 0.16513346782640406, 0.12761356327437648, 0.07691517031114352, -0.02453129895423588, -0.06834048116089482, 0.040993770290362205, -0.2622757292935459, 0.09928126873350457, 0.24978519221277615, 0.11154562793672085, 0.1665225983842423, -0.2956018874492178, -0.1638708884190572, 0.21336089584388232, 0.09393610883700221, 0.017153505431978328, 0.03715796180461582, -0.27249168045818806, 0.1892412028912651, -0.19456010174594426, -0.12174903758262333, -0.058574286534598, -0.015130007933629187, -0.038401743176540264, -0.21503240698458334, 0.002870865460289152, 0.10034053846213378, -0.033625249358776366, 0.02313044025121551, 0.07026948010254848, -0.03763909559500845, 0.1441115064203347, -0.006912539137135211, 0.16174965822382978, 0.012178317934740335, -0.07332419339371354, -0.27578926704039697, 0.27097572771048073, -0.07445155785075928, -0.26409242311982734, 0.295998535266048, -0.05200641675803222, -0.2560513201904924, 0.1611669757648518, 0.01605362739217909, 0.05659634149388263, -0.06503766696704061, 0.041687954695111044, -0.2111123949289322, 0.20126088473357653, 0.02090435862345131, -0.06797018899631344, 0.18348957029612442, 0.0730816692751097, 0.2318857731787782, 0.1552256637890088, 0.056818383108628426, -0.014254935673977199, -0.2391667424848205, -0.29306560990057495, -0.22224446807644868, 0.08563328730432611, -0.027284774831251093, -0.2146869458650288, 0.36787521956782593, 0.14242904765629455, 0.19697193889633605, 0.2143068700342586, 0.25767953184090164, 0.038327246218135484, -0.03697829708260925, 0.17067753168215094, 0.1580391696801311, 0.27393735082525955, -0.05658210152269978, -0.1475818599574268, 0.06488203656810679, 0.18449582115403915] |
1,802.02494 | Viscous effects on the dynamical evolution of QCD matter during the
first-order confinement phase transition in heavy-ion collisions | We investigate viscous effects on the dynamical evolution of QCD matter
during the first-order phase transition, which may happen in heavy-ion
collisions. We first obtain the first-order phase transition line in the QCD
phase diagram under the Gibbs condition by using the MIT bag model and the
hadron resonance gas model for the equation of state of partons and hadrons.
The viscous pressure, which corresponds to the friction in the energy balance,
is then derived from the energy and net baryon number conservation during the
phase transition. We find that the viscous pressure relates to the
thermodynamic change of the two-phase state and thus affects the timescale of
the phase transition. Numerical results are presented for demonstrations.
| hep-ph nucl-th | we investigate viscous effects on the dynamical evolution of qcd matter during the firstorder phase transition which may happen in heavyion collisions we first obtain the firstorder phase transition line in the qcd phase diagram under the gibbs condition by using the mit bag model and the hadron resonance gas model for the equation of state of partons and hadrons the viscous pressure which corresponds to the friction in the energy balance is then derived from the energy and net baryon number conservation during the phase transition we find that the viscous pressure relates to the thermodynamic change of the twophase state and thus affects the timescale of the phase transition numerical results are presented for demonstrations | [['we', 'investigate', 'viscous', 'effects', 'on', 'the', 'dynamical', 'evolution', 'of', 'qcd', 'matter', 'during', 'the', 'firstorder', 'phase', 'transition', 'which', 'may', 'happen', 'in', 'heavyion', 'collisions', 'we', 'first', 'obtain', 'the', 'firstorder', 'phase', 'transition', 'line', 'in', 'the', 'qcd', 'phase', 'diagram', 'under', 'the', 'gibbs', 'condition', 'by', 'using', 'the', 'mit', 'bag', 'model', 'and', 'the', 'hadron', 'resonance', 'gas', 'model', 'for', 'the', 'equation', 'of', 'state', 'of', 'partons', 'and', 'hadrons', 'the', 'viscous', 'pressure', 'which', 'corresponds', 'to', 'the', 'friction', 'in', 'the', 'energy', 'balance', 'is', 'then', 'derived', 'from', 'the', 'energy', 'and', 'net', 'baryon', 'number', 'conservation', 'during', 'the', 'phase', 'transition', 'we', 'find', 'that', 'the', 'viscous', 'pressure', 'relates', 'to', 'the', 'thermodynamic', 'change', 'of', 'the', 'twophase', 'state', 'and', 'thus', 'affects', 'the', 'timescale', 'of', 'the', 'phase', 'transition', 'numerical', 'results', 'are', 'presented', 'for', 'demonstrations']] | [-0.11362245864021935, 0.2517939902897765, -0.1587887036924561, 0.047334902252182044, -0.03163130782767493, -0.04031153303933226, 0.05683023816086034, 0.30614324805573523, -0.24473416786163282, -0.2736244000828801, 0.042216737075056084, -0.2866332666295716, -0.053681596285767026, 0.08108483488536161, 0.047351660429794565, 0.08583613590568177, 0.032043677422369264, 0.04495716195266981, -0.0953825704064857, -0.16453208067478278, 0.37557978797544783, 0.03220412783069998, 0.26117468848187697, 0.11600339547760832, 0.08809795797778627, -0.04203711269009444, 0.036012075077264734, 0.00905311869011603, -0.19930325502075272, -0.06620093075529689, 0.19628165236228487, 0.02736486124798146, 0.16604397402137008, -0.4370894797353281, -0.2438771400349931, 0.10843741568601412, 0.08701784714148977, 0.146920851795958, -0.05143952891568884, -0.27634250103599495, 0.025112829875583068, -0.1902708144297298, -0.09855252532805833, -0.09389179907579961, -0.03236446003469392, 0.011027300778107766, -0.27508235131350595, 0.17114345117822352, 0.04114828604889405, 0.006194675309408424, -0.11810464256355523, -0.08689821120669954, -0.07651891440758084, 0.06879789669178107, 0.0465357223024162, 0.050080352992169626, 0.1675464197014196, -0.1913754255640217, -0.04592877528112796, 0.4456240796507933, -0.0449583922407359, -0.090088920112556, 0.17009217673952445, -0.17473876180772024, -0.08377277806130612, 0.18756874029437065, 0.17748754870735556, 0.08559179091905682, -0.14320878700042763, 0.02283255784159415, 0.028362718681430716, 0.17384756953479388, 0.030893427292959623, -0.020794299244084675, 0.21923101676675755, 0.17756200921482956, -0.01613740381410616, 0.17922515054551774, -0.08213161702034498, -0.19559992252626163, -0.35987044991049755, -0.152541657209269, -0.1660798768966626, -0.015159325119959684, -0.10430393472431292, -0.14411529081945235, 0.3757750375681899, 0.15873836973208424, 0.2106836767246326, -0.0015541218583368594, 0.2888466761344009, 0.15098756588358656, -0.013702114367395895, 0.08099967172681792, 0.31263645520258665, 0.15110100717602187, 0.20973823667288974, -0.33092761896829254, 0.05906727351248264, 0.13629383497481418] |
1,802.02495 | The merger of two compact stars: a tool for dense matter nuclear physics | We discuss the different signals, in gravitational and electromagnetic waves,
emitted during the merger of two compact stars. We will focus in particular on
the possible contraints that those signals can provide on the equation of state
of dense matter. Indeed, the stiffness of the equation of state and the
particle composition of the merging compact stars, strongly affect e.g. the
life time of the post-merger remnant and its gravitational wave signal, the
emission of the short gamma-ray-burst, the amount of ejected mass and the
related kilonova. The first detection of gravitational waves from the merger of
two compact stars in August 2017, GW170817, and the subsequent detections of
its electromagnetic counterparts, GRB170817A and AT2017gfo, is the first
example of the era of "multi-messenger astronomy": we discuss what we have
learned from this detection on the equation of state of compact stars and we
provide a tentative interpretation of this event, within the two families
scenario, as due to the merger of a hadronic star with a quark star.
| astro-ph.HE | we discuss the different signals in gravitational and electromagnetic waves emitted during the merger of two compact stars we will focus in particular on the possible contraints that those signals can provide on the equation of state of dense matter indeed the stiffness of the equation of state and the particle composition of the merging compact stars strongly affect eg the life time of the postmerger remnant and its gravitational wave signal the emission of the short gammarayburst the amount of ejected mass and the related kilonova the first detection of gravitational waves from the merger of two compact stars in august 2017 gw170817 and the subsequent detections of its electromagnetic counterparts grb170817a and at2017gfo is the first example of the era of multimessenger astronomy we discuss what we have learned from this detection on the equation of state of compact stars and we provide a tentative interpretation of this event within the two families scenario as due to the merger of a hadronic star with a quark star | [['we', 'discuss', 'the', 'different', 'signals', 'in', 'gravitational', 'and', 'electromagnetic', 'waves', 'emitted', 'during', 'the', 'merger', 'of', 'two', 'compact', 'stars', 'we', 'will', 'focus', 'in', 'particular', 'on', 'the', 'possible', 'contraints', 'that', 'those', 'signals', 'can', 'provide', 'on', 'the', 'equation', 'of', 'state', 'of', 'dense', 'matter', 'indeed', 'the', 'stiffness', 'of', 'the', 'equation', 'of', 'state', 'and', 'the', 'particle', 'composition', 'of', 'the', 'merging', 'compact', 'stars', 'strongly', 'affect', 'eg', 'the', 'life', 'time', 'of', 'the', 'postmerger', 'remnant', 'and', 'its', 'gravitational', 'wave', 'signal', 'the', 'emission', 'of', 'the', 'short', 'gammarayburst', 'the', 'amount', 'of', 'ejected', 'mass', 'and', 'the', 'related', 'kilonova', 'the', 'first', 'detection', 'of', 'gravitational', 'waves', 'from', 'the', 'merger', 'of', 'two', 'compact', 'stars', 'in', 'august', '2017', 'gw170817', 'and', 'the', 'subsequent', 'detections', 'of', 'its', 'electromagnetic', 'counterparts', 'grb170817a', 'and', 'at2017gfo', 'is', 'the', 'first', 'example', 'of', 'the', 'era', 'of', 'multimessenger', 'astronomy', 'we', 'discuss', 'what', 'we', 'have', 'learned', 'from', 'this', 'detection', 'on', 'the', 'equation', 'of', 'state', 'of', 'compact', 'stars', 'and', 'we', 'provide', 'a', 'tentative', 'interpretation', 'of', 'this', 'event', 'within', 'the', 'two', 'families', 'scenario', 'as', 'due', 'to', 'the', 'merger', 'of', 'a', 'hadronic', 'star', 'with', 'a', 'quark', 'star']] | [-0.13285392346604558, 0.15886067289627603, -0.09607649847490371, 0.08223888434909873, -0.14581764682427534, 0.015368464626041214, 0.02416080823746791, 0.35644420295865575, -0.17333919240971862, -0.29569561417440515, 0.09935653525247574, -0.2966527259363049, -0.08541771735632296, 0.20891879022069076, 0.02840244409231436, -0.0003623103608581177, 0.131304390182906, 0.059833406647405524, -0.09554132982742691, -0.22029253597145337, 0.36805544344407987, 0.06637138787646, 0.14944473260286203, 0.01573964725827148, 0.09868886615507878, -0.040294353720682435, -0.07970809923022015, -0.09314764500733398, -0.11329480301549681, 0.05061643575345712, 0.21380841135586057, 0.22683931602104485, 0.18174306977782728, -0.43614415545567603, -0.22284290652319833, 0.09887155333186703, 0.11021454617980049, 0.09109271654343239, -0.10097192797035574, -0.35854695383569546, 0.03730799198152701, -0.23725569560109863, -0.12374168554232759, 0.07170713944195291, 0.041371874395515436, 0.06237931870276758, -0.16465824081413669, 0.11049565244135419, 0.07238009690028786, -0.06144497526214408, -0.10999794270341787, -0.055708197171430614, -0.02351052251220102, 0.06964339962581823, 0.08132348679517225, 0.04635855533766764, 0.11263908012962993, -0.18698234159289998, -0.09101407743918781, 0.4265683368950553, -0.08804215466157263, -0.06460676779529664, 0.22272091204598105, -0.203272458601236, -0.17439974796787433, 0.14674510907095212, 0.21248036336302537, 0.14505780208993638, -0.14115350176001618, -0.0018462633239463544, 0.031571720416892525, 0.1501001148490158, 0.0813637877436983, 0.07605963673982659, 0.3373340108905803, 0.17589371236035678, -0.00048477469513622613, 0.12604735815792878, -0.18216819484916533, -0.015113315273960776, -0.30746025264403676, -0.14944852194776373, -0.16789123047964327, 0.08083210255667918, -0.10610127705140741, -0.1359163163575625, 0.42019022056645544, 0.11632014704405291, 0.15351772739568495, 0.0047020353373421146, 0.27868871239824056, 0.10197387757633962, 0.01509643888883513, 0.07394762853292759, 0.3549502046238741, 0.1712628742211537, 0.10264370291763862, -0.24304401027810205, 0.05638093204952545, 0.00773876711461671] |
1,802.02496 | Defining the principles for the motion of blood through arteries | This is an annotated translation from Latin of 'Principia pro motu sanguinis
per arterias determinando' in which Euler develops the first known work on the
mechanics of flows in elastic tubes, intended to the first contest of the Dijon
Academy of 1742. In this work, Euler applied the principles of mass
conservation and momentum conservation to the one dimensional flow of an
incompressible fluid through an elastic tube driven by a piston pump. These
would allow the analytical treatment of circulatory physiology and
hemodynamics, which still undergird the most advanced numerical methods in use
today for blood flow analysis in arterial networks.
| physics.hist-ph | this is an annotated translation from latin of principia pro motu sanguinis per arterias determinando in which euler develops the first known work on the mechanics of flows in elastic tubes intended to the first contest of the dijon academy of 1742 in this work euler applied the principles of mass conservation and momentum conservation to the one dimensional flow of an incompressible fluid through an elastic tube driven by a piston pump these would allow the analytical treatment of circulatory physiology and hemodynamics which still undergird the most advanced numerical methods in use today for blood flow analysis in arterial networks | [['this', 'is', 'an', 'annotated', 'translation', 'from', 'latin', 'of', 'principia', 'pro', 'motu', 'sanguinis', 'per', 'arterias', 'determinando', 'in', 'which', 'euler', 'develops', 'the', 'first', 'known', 'work', 'on', 'the', 'mechanics', 'of', 'flows', 'in', 'elastic', 'tubes', 'intended', 'to', 'the', 'first', 'contest', 'of', 'the', 'dijon', 'academy', 'of', '1742', 'in', 'this', 'work', 'euler', 'applied', 'the', 'principles', 'of', 'mass', 'conservation', 'and', 'momentum', 'conservation', 'to', 'the', 'one', 'dimensional', 'flow', 'of', 'an', 'incompressible', 'fluid', 'through', 'an', 'elastic', 'tube', 'driven', 'by', 'a', 'piston', 'pump', 'these', 'would', 'allow', 'the', 'analytical', 'treatment', 'of', 'circulatory', 'physiology', 'and', 'hemodynamics', 'which', 'still', 'undergird', 'the', 'most', 'advanced', 'numerical', 'methods', 'in', 'use', 'today', 'for', 'blood', 'flow', 'analysis', 'in', 'arterial', 'networks']] | [-0.1085060669313546, 0.09820163910611585, -0.09009596378523477, 0.009853877401578106, -0.0709918293987914, -0.08297812287239548, -0.03335811225792431, 0.27596329594487135, -0.2605373685222062, -0.2812690504978658, 0.1051743855992123, -0.2695380291492887, -0.13502523932149824, 0.20547320824876733, -0.12494397684171492, 0.08958284231021582, 0.057958664581635774, 0.007210622301648314, 0.00927793444134295, -0.20264552233322541, 0.28414347678974117, 0.04393002120968031, 0.30788683203258077, 0.04819087786314895, 0.14893118408033434, -0.017611681274613555, -0.0408580663842054, 0.01925750232387182, -0.1603216739010294, 0.12142571965078063, 0.2643881877219038, 0.07296025380017046, 0.29151114256938504, -0.4993020590508775, -0.19981788349699, 0.023134261038277905, 0.14018031118950824, 0.11184634802131248, -0.026766449213027954, -0.253802339793468, 0.024765813400094608, -0.17893691013129998, -0.10948723648218628, -0.0429535655338051, 0.024266971184929112, 0.025187503479953324, -0.18001960138125078, 0.10660728980901138, 0.07321367545614058, 0.11353119842860164, -0.1004351819485274, -0.09312453598012121, -0.034672057921332974, 0.1469608938121902, 0.09734976223826751, 0.01997884229414773, 0.12318569546261308, -0.19167513533458838, -0.11391660292651884, 0.4219769112936848, -0.00868436652568302, -0.23835428644503867, 0.17299452916319882, -0.10398285876845523, -0.11524504228324002, 0.1471702054104939, 0.2122929347679019, 0.1023774544235642, -0.17262102553278816, -0.026693550566905082, -0.04122142369469286, 0.1618005483701103, 0.09474853219996605, -0.1265450264327228, 0.18963785073244754, 0.20814439032359847, 0.022846822037684674, 0.10718369604401974, -0.08254816951657816, -0.09422488337648767, -0.30483196808585933, -0.21771215945862385, -0.15353800341182824, 0.07870039177169948, -0.03533028533690542, -0.18314360541633654, 0.3502988899221682, 0.1466223179874704, 0.07572755813408567, 0.03097949028062653, 0.3401032782881996, 0.05332065185493961, 0.04932146053761244, 0.08814766200506413, 0.25973911955952644, 0.15222108796742573, 0.21171818540564605, -0.21745862522191006, 0.025701611260028213, 0.11631585504356011] |
1,802.02497 | Privacy preserving clustering with constraints | The $k$-center problem is a classical combinatorial optimization problem
which asks to find $k$ centers such that the maximum distance of any input
point in a set $P$ to its assigned center is minimized. The problem allows for
elegant $2$-approximations. However, the situation becomes significantly more
difficult when constraints are added to the problem. We raise the question
whether general methods can be derived to turn an approximation algorithm for a
clustering problem with some constraints into an approximation algorithm that
respects one constraint more. Our constraint of choice is privacy: Here, we are
asked to only open a center when at least $\ell$ clients will be assigned to
it. We show how to combine privacy with several other constraints.
| cs.CC | the kcenter problem is a classical combinatorial optimization problem which asks to find k centers such that the maximum distance of any input point in a set p to its assigned center is minimized the problem allows for elegant 2approximations however the situation becomes significantly more difficult when constraints are added to the problem we raise the question whether general methods can be derived to turn an approximation algorithm for a clustering problem with some constraints into an approximation algorithm that respects one constraint more our constraint of choice is privacy here we are asked to only open a center when at least ell clients will be assigned to it we show how to combine privacy with several other constraints | [['the', 'kcenter', 'problem', 'is', 'a', 'classical', 'combinatorial', 'optimization', 'problem', 'which', 'asks', 'to', 'find', 'k', 'centers', 'such', 'that', 'the', 'maximum', 'distance', 'of', 'any', 'input', 'point', 'in', 'a', 'set', 'p', 'to', 'its', 'assigned', 'center', 'is', 'minimized', 'the', 'problem', 'allows', 'for', 'elegant', '2approximations', 'however', 'the', 'situation', 'becomes', 'significantly', 'more', 'difficult', 'when', 'constraints', 'are', 'added', 'to', 'the', 'problem', 'we', 'raise', 'the', 'question', 'whether', 'general', 'methods', 'can', 'be', 'derived', 'to', 'turn', 'an', 'approximation', 'algorithm', 'for', 'a', 'clustering', 'problem', 'with', 'some', 'constraints', 'into', 'an', 'approximation', 'algorithm', 'that', 'respects', 'one', 'constraint', 'more', 'our', 'constraint', 'of', 'choice', 'is', 'privacy', 'here', 'we', 'are', 'asked', 'to', 'only', 'open', 'a', 'center', 'when', 'at', 'least', 'ell', 'clients', 'will', 'be', 'assigned', 'to', 'it', 'we', 'show', 'how', 'to', 'combine', 'privacy', 'with', 'several', 'other', 'constraints']] | [-0.10523252185666934, 0.025710345993138616, -0.10861174525149787, 0.10397748120109705, -0.15162400232317547, -0.22383027518711363, 0.08672576352837495, 0.3785743972907464, -0.37267571481255196, -0.35465775585422915, 0.106514768973769, -0.2841838211249221, -0.12041394376234772, 0.1864484156598337, -0.10087479633900026, 0.04855796578291726, 0.07141857266930553, 0.07743881405331195, -0.05079124756636399, -0.3255407582502812, 0.3012451724925389, 0.03537584164102251, 0.2196721726077764, 0.06873104727904623, 0.0653319144427466, 0.0028040761710144578, 0.03630810144046943, 0.07425222579622641, -0.11211269499484236, 0.11963788675008497, 0.28230199984585247, 0.22161854043758164, 0.3334300253385057, -0.3939737561314056, -0.15547196107800118, 0.1615615521130773, 0.14188729512485831, 0.12456388621261189, -0.008713864699287418, -0.20707236054974298, 0.14477631233166904, -0.09104048239144807, -0.09519863878764832, -0.014031290224132438, 0.02800409722549375, -0.06434164086531383, -0.31585942053546506, -0.015322800390034292, 0.043195295655944696, -0.052687129851741094, -0.05631767262966605, -0.11303750196530019, 0.025559458726396162, 0.1106093781326005, 0.04079574219649658, 0.07503046585867802, 0.10616609927577277, -0.11533096331792574, -0.12439658687605212, 0.4434588350666066, 0.026201394790162643, -0.24697315775168438, 0.15029103681251096, -0.07595306391982982, -0.18929303985011453, 0.09884511944837868, 0.15876586920348928, 0.12829965690616518, -0.15243728610754867, 0.08124696121861537, -0.08477400118669418, 0.16236618226806362, 0.06736504694757363, 0.007896595586498734, 0.16174563421130492, 0.11992071332642809, 0.20447302341926843, 0.1424420705913993, -0.029214838379994036, -0.05530048876535147, -0.24712406545877458, -0.08592075572814792, -0.1564736162001888, 0.03909740896585087, -0.07095345108925054, -0.12172675409043829, 0.3169104827432117, 0.1828140618953815, 0.23473562124030042, 0.061625869687607825, 0.3097435525618494, 0.14973108785937558, 0.034130233289518704, 0.11767725882818922, 0.1825349124587471, 0.09022966143675148, 0.03016483101916189, -0.19255888850117722, 0.06406094173823172, 0.04725772593713676] |
1,802.02498 | Spectral Learning of Binomial HMMs for DNA Methylation Data | We consider learning parameters of Binomial Hidden Markov Models, which may
be used to model DNA methylation data. The standard algorithm for the problem
is EM, which is computationally expensive for sequences of the scale of the
mammalian genome. Recently developed spectral algorithms can learn parameters
of latent variable models via tensor decomposition, and are highly efficient
for large data. However, these methods have only been applied to categorial
HMMs, and the main challenge is how to extend them to Binomial HMMs while still
retaining computational efficiency. We address this challenge by introducing a
new feature-map based approach that exploits specific properties of Binomial
HMMs. We provide theoretical performance guarantees for our algorithm and
evaluate it on real DNA methylation data.
| cs.LG stat.ML | we consider learning parameters of binomial hidden markov models which may be used to model dna methylation data the standard algorithm for the problem is em which is computationally expensive for sequences of the scale of the mammalian genome recently developed spectral algorithms can learn parameters of latent variable models via tensor decomposition and are highly efficient for large data however these methods have only been applied to categorial hmms and the main challenge is how to extend them to binomial hmms while still retaining computational efficiency we address this challenge by introducing a new featuremap based approach that exploits specific properties of binomial hmms we provide theoretical performance guarantees for our algorithm and evaluate it on real dna methylation data | [['we', 'consider', 'learning', 'parameters', 'of', 'binomial', 'hidden', 'markov', 'models', 'which', 'may', 'be', 'used', 'to', 'model', 'dna', 'methylation', 'data', 'the', 'standard', 'algorithm', 'for', 'the', 'problem', 'is', 'em', 'which', 'is', 'computationally', 'expensive', 'for', 'sequences', 'of', 'the', 'scale', 'of', 'the', 'mammalian', 'genome', 'recently', 'developed', 'spectral', 'algorithms', 'can', 'learn', 'parameters', 'of', 'latent', 'variable', 'models', 'via', 'tensor', 'decomposition', 'and', 'are', 'highly', 'efficient', 'for', 'large', 'data', 'however', 'these', 'methods', 'have', 'only', 'been', 'applied', 'to', 'categorial', 'hmms', 'and', 'the', 'main', 'challenge', 'is', 'how', 'to', 'extend', 'them', 'to', 'binomial', 'hmms', 'while', 'still', 'retaining', 'computational', 'efficiency', 'we', 'address', 'this', 'challenge', 'by', 'introducing', 'a', 'new', 'featuremap', 'based', 'approach', 'that', 'exploits', 'specific', 'properties', 'of', 'binomial', 'hmms', 'we', 'provide', 'theoretical', 'performance', 'guarantees', 'for', 'our', 'algorithm', 'and', 'evaluate', 'it', 'on', 'real', 'dna', 'methylation', 'data']] | [-0.0013851920096588529, 0.039276377055486124, -0.08468459948343186, 0.11961899970057767, -0.14818850977053818, -0.19262974767191413, 0.049886359956331, 0.43893247639591043, -0.30796211211334085, -0.31757112900333956, 0.10154647418213161, -0.20551805201271348, -0.18924895696407415, 0.20937244129013116, -0.11348854440210526, 0.1415561930438088, 0.11217427693215037, -0.0018783196023268978, 0.017529731067975073, -0.2682815130495982, 0.2782687437643628, 0.07689847237976992, 0.3091125169303268, -0.0011181718908435058, 0.13209739973487655, -0.03902994976609884, -0.04790744841991624, -0.030027530648676325, -0.11085222490654521, 0.20894202303039372, 0.31476949049913455, 0.21108640941467968, 0.31368905330492447, -0.42778405966814453, -0.23549779199741103, 0.1349270676151072, 0.15055909730139966, 0.14369198380900192, -0.03253842608075712, -0.2554905054444247, 0.12042955246038181, -0.13925371904788184, -0.012036263361604007, -0.19113863716748627, -0.043545713744411046, 0.016035881788712302, -0.30069528465459416, 0.08311868054322775, 0.04809894136630368, 0.04328744393611742, 0.0012725705996709915, -0.16117099844100155, 0.02265601086984427, 0.13485819907966723, 0.07583211097204365, -0.025133165049805374, 0.11083229960227185, -0.11707828767651313, -0.17987482134668417, 0.33054448374785667, -0.037800445452270924, -0.24093149442318057, 0.17520059846256944, -0.0286438323226411, -0.23021767424296372, 0.12004363313240331, 0.1965799175880172, 0.13215423949555424, -0.18443969485526981, 0.09066820164520893, -0.02233233492944605, 0.19316756037210137, 0.023577303429372795, -0.012987794177529733, 0.16303699948701791, 0.21286231017679222, -0.008079776969499701, 0.15226050323425708, -0.10220176778942508, -0.10142321773797028, -0.17473012590703885, -0.13185573490105632, -0.21585180024300848, -0.034649382668647394, -0.10671950354443359, -0.20704628894462015, 0.4069964386722889, 0.20280218522619045, 0.18719939984263823, 0.11570051729809955, 0.30167575118185813, 0.0670545958338521, 0.08309930345632352, 0.07271160342738278, 0.13882818077075149, 0.1031064169100401, 0.06552970222936373, -0.17537869162441902, 0.1484182501819816, 0.04524761213235988] |
1,802.02499 | Coarse median algebras: The intrinsic geometry of coarse median spaces
and their intervals | This paper establishes a new combinatorial framework for the study of coarse
median spaces, bridging the worlds of asymptotic geometry, algebra and
combinatorics. We introduce a simple and entirely algebraic notion of coarse
median algebra which simultaneously generalises the concepts of bounded
geometry coarse median spaces and classical discrete median algebras. We study
the coarse median universe from the perspective of intervals, with a particular
focus on cardinality as a proxy for distance. In particular we prove that the
metric on a quasi-geodesic coarse median space of bounded geometry can be
constructed up to quasi-isometry using only the coarse median operator. Finally
we develop a concept of rank for coarse median algebras in terms of the
geometry of intervals and show that the notion of finite rank coarse median
algebra provides a natural higher dimensional analogue of Gromov's concept of
$\delta$-hyperbolicity.
| math.MG math.CO math.GR | this paper establishes a new combinatorial framework for the study of coarse median spaces bridging the worlds of asymptotic geometry algebra and combinatorics we introduce a simple and entirely algebraic notion of coarse median algebra which simultaneously generalises the concepts of bounded geometry coarse median spaces and classical discrete median algebras we study the coarse median universe from the perspective of intervals with a particular focus on cardinality as a proxy for distance in particular we prove that the metric on a quasigeodesic coarse median space of bounded geometry can be constructed up to quasiisometry using only the coarse median operator finally we develop a concept of rank for coarse median algebras in terms of the geometry of intervals and show that the notion of finite rank coarse median algebra provides a natural higher dimensional analogue of gromovs concept of deltahyperbolicity | [['this', 'paper', 'establishes', 'a', 'new', 'combinatorial', 'framework', 'for', 'the', 'study', 'of', 'coarse', 'median', 'spaces', 'bridging', 'the', 'worlds', 'of', 'asymptotic', 'geometry', 'algebra', 'and', 'combinatorics', 'we', 'introduce', 'a', 'simple', 'and', 'entirely', 'algebraic', 'notion', 'of', 'coarse', 'median', 'algebra', 'which', 'simultaneously', 'generalises', 'the', 'concepts', 'of', 'bounded', 'geometry', 'coarse', 'median', 'spaces', 'and', 'classical', 'discrete', 'median', 'algebras', 'we', 'study', 'the', 'coarse', 'median', 'universe', 'from', 'the', 'perspective', 'of', 'intervals', 'with', 'a', 'particular', 'focus', 'on', 'cardinality', 'as', 'a', 'proxy', 'for', 'distance', 'in', 'particular', 'we', 'prove', 'that', 'the', 'metric', 'on', 'a', 'quasigeodesic', 'coarse', 'median', 'space', 'of', 'bounded', 'geometry', 'can', 'be', 'constructed', 'up', 'to', 'quasiisometry', 'using', 'only', 'the', 'coarse', 'median', 'operator', 'finally', 'we', 'develop', 'a', 'concept', 'of', 'rank', 'for', 'coarse', 'median', 'algebras', 'in', 'terms', 'of', 'the', 'geometry', 'of', 'intervals', 'and', 'show', 'that', 'the', 'notion', 'of', 'finite', 'rank', 'coarse', 'median', 'algebra', 'provides', 'a', 'natural', 'higher', 'dimensional', 'analogue', 'of', 'gromovs', 'concept', 'of', 'deltahyperbolicity']] | [-0.08141604611808632, 0.08931571602695852, -0.12308720056733764, 0.11672458591200544, -0.09035740503446853, -0.06825432345495684, 0.03772589501657305, 0.3677101866804486, -0.3379635129203188, -0.2687826406752281, 0.12663823833230037, -0.16791978718197725, -0.14695611878806816, 0.163662377051375, -0.21055756349955415, -0.013803486595035974, 0.05390156375521675, 0.03677729366789737, -0.16298853210581207, -0.23213802185404966, 0.4180351748785123, 0.0345048293345839, 0.2510674890487435, 0.03515673704537834, 0.21134736953659894, 0.018096793717077227, -0.07365440512868635, 0.09563533197209101, -0.20596250220656426, 0.19348592319070024, 0.2369446165063782, 0.11975165401215514, 0.3045946803498775, -0.32569198648887854, -0.15275320241637264, 0.1292478685921177, 0.11841705230771439, 0.03630157822911489, -0.0007347852893252957, -0.2591074146990869, 0.11854775880417186, -0.17235679700244086, -0.10798125446060712, -0.03416535754503141, 0.013127168668566126, -0.029377073941237116, -0.20962105046112275, 0.05167171807880414, 0.07545622747972713, 0.15134046534373563, -0.07288990456095719, -0.08582053482549014, -0.042856711007535776, 0.0993395507870678, -0.07639652544777867, 0.022169202978967142, 0.09308472680958345, -0.0446545619917278, -0.12375930996268247, 0.3671950802788244, -0.0516683941245482, -0.22047766332402297, 0.15920355063962174, -0.1535797183738744, -0.16767353272224042, 0.05492619808320722, 0.17486140565081426, 0.16523984552184384, -0.05579028242261063, 0.1581270113267031, -0.12537415675713237, 0.14072996757739614, 0.08941480847643622, 0.05792897792057471, 0.1545166578771322, 0.15515749642942497, 0.16288141392382746, 0.14807109224712411, -0.01626036556004976, -0.09366926241683417, -0.33372458717818804, -0.16589303304117622, -0.15623313417090168, 0.08991063034644099, -0.22106463449853572, -0.2278896597683007, 0.38499558986171234, 0.11515655479119787, 0.2002254590088277, 0.18417371688030845, 0.23225991805711538, 0.0623065753111695, 0.021225290240039586, 0.05185483351633851, 0.14614898932714623, 0.1918895149022235, 0.02428431124657604, -0.09576418950158033, -0.02313155053738267, 0.24925005724319219] |
1,802.025 | Cadre Modeling: Simultaneously Discovering Subpopulations and Predictive
Models | We consider the problem in regression analysis of identifying subpopulations
that exhibit different patterns of response, where each subpopulation requires
a different underlying model. Unlike statistical cohorts, these subpopulations
are not known a priori; thus, we refer to them as cadres. When the cadres and
their associated models are interpretable, modeling leads to insights about the
subpopulations and their associations with the regression target. We introduce
a discriminative model that simultaneously learns cadre assignment and
target-prediction rules. Sparsity-inducing priors are placed on the model
parameters, under which independent feature selection is performed for both the
cadre assignment and target-prediction processes. We learn models using
adaptive step size stochastic gradient descent, and we assess cadre quality
with bootstrapped sample analysis. We present simulated results showing that,
when the true clustering rule does not depend on the entire set of features,
our method significantly outperforms methods that learn subpopulation-discovery
and target-prediction rules separately. In a materials-by-design case study,
our model provides state-of-the-art prediction of polymer glass transition
temperature. Importantly, the method identifies cadres of polymers that respond
differently to structural perturbations, thus providing design insight for
targeting or avoiding specific transition temperature ranges. It identifies
chemically meaningful cadres, each with interpretable models. Further
experimental results show that cadre methods have generalization that is
competitive with linear and nonlinear regression models and can identify robust
subpopulations.
| stat.ML cs.LG | we consider the problem in regression analysis of identifying subpopulations that exhibit different patterns of response where each subpopulation requires a different underlying model unlike statistical cohorts these subpopulations are not known a priori thus we refer to them as cadres when the cadres and their associated models are interpretable modeling leads to insights about the subpopulations and their associations with the regression target we introduce a discriminative model that simultaneously learns cadre assignment and targetprediction rules sparsityinducing priors are placed on the model parameters under which independent feature selection is performed for both the cadre assignment and targetprediction processes we learn models using adaptive step size stochastic gradient descent and we assess cadre quality with bootstrapped sample analysis we present simulated results showing that when the true clustering rule does not depend on the entire set of features our method significantly outperforms methods that learn subpopulationdiscovery and targetprediction rules separately in a materialsbydesign case study our model provides stateoftheart prediction of polymer glass transition temperature importantly the method identifies cadres of polymers that respond differently to structural perturbations thus providing design insight for targeting or avoiding specific transition temperature ranges it identifies chemically meaningful cadres each with interpretable models further experimental results show that cadre methods have generalization that is competitive with linear and nonlinear regression models and can identify robust subpopulations | [['we', 'consider', 'the', 'problem', 'in', 'regression', 'analysis', 'of', 'identifying', 'subpopulations', 'that', 'exhibit', 'different', 'patterns', 'of', 'response', 'where', 'each', 'subpopulation', 'requires', 'a', 'different', 'underlying', 'model', 'unlike', 'statistical', 'cohorts', 'these', 'subpopulations', 'are', 'not', 'known', 'a', 'priori', 'thus', 'we', 'refer', 'to', 'them', 'as', 'cadres', 'when', 'the', 'cadres', 'and', 'their', 'associated', 'models', 'are', 'interpretable', 'modeling', 'leads', 'to', 'insights', 'about', 'the', 'subpopulations', 'and', 'their', 'associations', 'with', 'the', 'regression', 'target', 'we', 'introduce', 'a', 'discriminative', 'model', 'that', 'simultaneously', 'learns', 'cadre', 'assignment', 'and', 'targetprediction', 'rules', 'sparsityinducing', 'priors', 'are', 'placed', 'on', 'the', 'model', 'parameters', 'under', 'which', 'independent', 'feature', 'selection', 'is', 'performed', 'for', 'both', 'the', 'cadre', 'assignment', 'and', 'targetprediction', 'processes', 'we', 'learn', 'models', 'using', 'adaptive', 'step', 'size', 'stochastic', 'gradient', 'descent', 'and', 'we', 'assess', 'cadre', 'quality', 'with', 'bootstrapped', 'sample', 'analysis', 'we', 'present', 'simulated', 'results', 'showing', 'that', 'when', 'the', 'true', 'clustering', 'rule', 'does', 'not', 'depend', 'on', 'the', 'entire', 'set', 'of', 'features', 'our', 'method', 'significantly', 'outperforms', 'methods', 'that', 'learn', 'subpopulationdiscovery', 'and', 'targetprediction', 'rules', 'separately', 'in', 'a', 'materialsbydesign', 'case', 'study', 'our', 'model', 'provides', 'stateoftheart', 'prediction', 'of', 'polymer', 'glass', 'transition', 'temperature', 'importantly', 'the', 'method', 'identifies', 'cadres', 'of', 'polymers', 'that', 'respond', 'differently', 'to', 'structural', 'perturbations', 'thus', 'providing', 'design', 'insight', 'for', 'targeting', 'or', 'avoiding', 'specific', 'transition', 'temperature', 'ranges', 'it', 'identifies', 'chemically', 'meaningful', 'cadres', 'each', 'with', 'interpretable', 'models', 'further', 'experimental', 'results', 'show', 'that', 'cadre', 'methods', 'have', 'generalization', 'that', 'is', 'competitive', 'with', 'linear', 'and', 'nonlinear', 'regression', 'models', 'and', 'can', 'identify', 'robust', 'subpopulations']] | [-0.018832021097124025, 0.05019380589779299, -0.11626414523401239, 0.07599569074725648, -0.12306126553501288, -0.2207761910525864, 0.0778332424349034, 0.44683880086249866, -0.23829686971221892, -0.3033047782022271, 0.06594643449968751, -0.2681386785262877, -0.18563017707217383, 0.14761507686810685, -0.07087401525109066, 0.025337148134739283, 0.07271347948777918, -0.0126448398758028, -0.03693630342866789, -0.245656340180053, 0.2806201225979388, 0.03770846979344381, 0.32492244189923947, -0.04174572800777471, 0.10707160425561203, -0.0023408263810566284, -0.05204346629335788, 0.03383771031423732, -0.1049306662722744, 0.10846422533536129, 0.282519591548522, 0.1812280275187912, 0.291617039163169, -0.373151472576537, -0.24395507162118013, 0.11067869157482123, 0.13650884287343212, 0.1028787807507969, -0.011110640654281655, -0.26107980855866464, 0.07739851261208018, -0.11155359820803094, -0.044325850842633865, -0.16378194544682498, -0.06120274785952223, 0.03611911562174928, -0.3255596581997501, 0.11282765675705296, 0.07700062493860789, 0.024854061848534847, -0.10372813685318909, -0.18172965034095756, -0.02974858445530707, 0.1334501587524108, 0.030952931887801603, -0.0020634554072727893, 0.15718608739920095, -0.12281024178934728, -0.10621964478517068, 0.34682775309796, -0.036559435247384885, -0.22037319522686638, 0.22627258282112847, -0.06782718069499007, -0.1768891689895132, 0.07825298003248267, 0.20788908171622703, 0.12637833573620533, -0.14783835908891485, 0.0036814925827186656, -0.043118382303300104, 0.19501324416230525, 0.00343298010511307, -0.008243309631775896, 0.18121888658434554, 0.20769796259743203, 0.030282981544292556, 0.11860090602128473, -0.08981226362969186, -0.08410054751722193, -0.23098245354134356, -0.0734592529972344, -0.10374087944148562, -0.03602290092136287, -0.13245519653430968, -0.17489238719097738, 0.39133123305693335, 0.21691089066859545, 0.2211761002867747, 0.12465215383804412, 0.2652468043489608, 0.05066441993764235, 0.08232368967340638, 0.06908082964238585, 0.17530074809690485, 0.06113037638899006, 0.035762781474470824, -0.2077549882070581, 0.14394124051889506, 0.023075520134371547] |
1,802.02501 | Asymmetric Electric Field Screening in van der Waals Heterostructures | Electric field screening plays an important role in the physical and chemical
properties of materials and their devices. Here, we use a compelling set of
theoretical and experimental techniques involving van der Waals (vdW) ab initio
density functional theory (DFT) simulations, quantum capacitance-based
classical model and electric force microscopy (EFM) to elucidate the intrinsic
dielectric screening properties of vdW heterostructures (vdWHs) formed by MoS2
and graphene layers. We experimentally observed an asymmetric electric response
in the MoS2/Graphene vdWHs under different directions of the external electric
field. That is, when the electric fields are shed towards graphene, a large
amount of polarized charges screen the fields, but as the sign of the field was
reversed, a strong depolarization field was present, and a partial screening
was detected. This effect is thickness-dependent, in particular on the number
of the MoS2 layers; whereas increased thickness of graphene showed a small
effect on their electrical and screening behavior. Our results indicate that
asymmetric dipolar contributions at the interface between graphene and MoS2 are
the main cause to the unusual field-effect screening in the vdWHs. This work
not only provides new insights on the screening properties of a vast amount of
heterojunction fabricated so far, but also uncovers the great potential of
controlling a fundamental property, such as screening, for device applications.
| cond-mat.mes-hall | electric field screening plays an important role in the physical and chemical properties of materials and their devices here we use a compelling set of theoretical and experimental techniques involving van der waals vdw ab initio density functional theory dft simulations quantum capacitancebased classical model and electric force microscopy efm to elucidate the intrinsic dielectric screening properties of vdw heterostructures vdwhs formed by mos2 and graphene layers we experimentally observed an asymmetric electric response in the mos2graphene vdwhs under different directions of the external electric field that is when the electric fields are shed towards graphene a large amount of polarized charges screen the fields but as the sign of the field was reversed a strong depolarization field was present and a partial screening was detected this effect is thicknessdependent in particular on the number of the mos2 layers whereas increased thickness of graphene showed a small effect on their electrical and screening behavior our results indicate that asymmetric dipolar contributions at the interface between graphene and mos2 are the main cause to the unusual fieldeffect screening in the vdwhs this work not only provides new insights on the screening properties of a vast amount of heterojunction fabricated so far but also uncovers the great potential of controlling a fundamental property such as screening for device applications | [['electric', 'field', 'screening', 'plays', 'an', 'important', 'role', 'in', 'the', 'physical', 'and', 'chemical', 'properties', 'of', 'materials', 'and', 'their', 'devices', 'here', 'we', 'use', 'a', 'compelling', 'set', 'of', 'theoretical', 'and', 'experimental', 'techniques', 'involving', 'van', 'der', 'waals', 'vdw', 'ab', 'initio', 'density', 'functional', 'theory', 'dft', 'simulations', 'quantum', 'capacitancebased', 'classical', 'model', 'and', 'electric', 'force', 'microscopy', 'efm', 'to', 'elucidate', 'the', 'intrinsic', 'dielectric', 'screening', 'properties', 'of', 'vdw', 'heterostructures', 'vdwhs', 'formed', 'by', 'mos2', 'and', 'graphene', 'layers', 'we', 'experimentally', 'observed', 'an', 'asymmetric', 'electric', 'response', 'in', 'the', 'mos2graphene', 'vdwhs', 'under', 'different', 'directions', 'of', 'the', 'external', 'electric', 'field', 'that', 'is', 'when', 'the', 'electric', 'fields', 'are', 'shed', 'towards', 'graphene', 'a', 'large', 'amount', 'of', 'polarized', 'charges', 'screen', 'the', 'fields', 'but', 'as', 'the', 'sign', 'of', 'the', 'field', 'was', 'reversed', 'a', 'strong', 'depolarization', 'field', 'was', 'present', 'and', 'a', 'partial', 'screening', 'was', 'detected', 'this', 'effect', 'is', 'thicknessdependent', 'in', 'particular', 'on', 'the', 'number', 'of', 'the', 'mos2', 'layers', 'whereas', 'increased', 'thickness', 'of', 'graphene', 'showed', 'a', 'small', 'effect', 'on', 'their', 'electrical', 'and', 'screening', 'behavior', 'our', 'results', 'indicate', 'that', 'asymmetric', 'dipolar', 'contributions', 'at', 'the', 'interface', 'between', 'graphene', 'and', 'mos2', 'are', 'the', 'main', 'cause', 'to', 'the', 'unusual', 'fieldeffect', 'screening', 'in', 'the', 'vdwhs', 'this', 'work', 'not', 'only', 'provides', 'new', 'insights', 'on', 'the', 'screening', 'properties', 'of', 'a', 'vast', 'amount', 'of', 'heterojunction', 'fabricated', 'so', 'far', 'but', 'also', 'uncovers', 'the', 'great', 'potential', 'of', 'controlling', 'a', 'fundamental', 'property', 'such', 'as', 'screening', 'for', 'device', 'applications']] | [-0.15998749907154264, 0.13198492617879068, -0.06697129659474857, 0.012905190072198343, -0.04464317011874392, -0.13419237156497307, 0.06177056931127678, 0.40388929041548877, -0.25738492117945777, -0.31638329664099324, -0.0334859277070221, -0.2975461898019649, -0.22080737729621236, 0.21207683841474698, 0.018423438849315424, 0.02798725431141216, -0.01815630006282011, -0.08507045247261563, -0.024491077652716072, -0.20287160148891334, 0.274984547597987, 0.056845129962714416, 0.3363776988701783, 0.17974109047125758, 0.04048463862500913, 0.019261332825341256, 0.069234899931892, 0.07437365983820989, -0.11700090836586853, 0.11380479749064669, 0.20346374793003918, -0.09502470237095648, 0.27679359379829627, -0.5074209311487763, -0.2361160469432426, -0.01645442526916274, 0.10778152394700743, 0.1579028520870456, -0.14671813396571745, -0.24619559629354626, 0.07119788478175822, -0.11826894866851961, -0.10432258564199606, -0.08813241204839148, 0.04086799078410672, 0.04804552642710095, -0.24326462008290783, 0.07419993019915477, 0.0426062796530979, 0.08287438377201523, -0.11032696665150128, -0.14975505942813538, -0.026008060408009362, 0.10880102435878504, 0.05739542087572219, 0.03207809870208567, 0.24524174867335208, -0.1759926733584465, -0.06686823378254828, 0.36438209132381505, -0.02498194533035434, -0.11695949065880978, 0.19002940148128034, -0.1516654923998682, -0.053158224895081485, 0.09361767728302267, 0.13279805439449247, 0.10071786805734678, -0.15555007703751722, 0.10121383794802262, -0.006487072618734006, 0.16930048280794704, 0.07626175722708145, 0.08801441672923309, 0.2710334157875915, 0.18281673009760574, 0.007972132451193888, 0.12652441655277072, -0.10155588530501874, -0.01963129942198091, -0.23428733152292308, -0.2020545691854754, -0.19865561319592362, 0.09519340404989853, -0.0729650764336889, -0.2397617225080282, 0.40904306395468626, 0.16662761582086327, 0.12684175282639498, -0.07326167505255939, 0.2841962508434507, 0.08095106075970887, 0.12433348950599471, -0.030849383398112606, 0.29854064628166416, 0.18289896993455798, 0.11347363516902938, -0.2643103709563501, 0.10093735426198691, -0.010640695421797682] |
1,802.02502 | Exact Solution of a Strongly Coupled Gauge Theory in 0+1 Dimensions | Gauged tensor models are a class of strongly coupled quantum mechanical
theories. We present the exact analytic solution of a specific example of such
a theory: namely the smallest colored tensor model due to Gurau and Witten that
exhibits non-linearities. We find explicit analytic expressions for the
eigenvalues and eigenstates, and the former agree precisely with previous
numerical results on (a subset of) eigenvalues of the ungauged theory. The
physics of the spectrum, despite the smallness of $N$, exhibits rudimentary
signatures of chaos. This Letter is a summary of our main results: the gory
details will appear in a companion paper.
| hep-th gr-qc | gauged tensor models are a class of strongly coupled quantum mechanical theories we present the exact analytic solution of a specific example of such a theory namely the smallest colored tensor model due to gurau and witten that exhibits nonlinearities we find explicit analytic expressions for the eigenvalues and eigenstates and the former agree precisely with previous numerical results on a subset of eigenvalues of the ungauged theory the physics of the spectrum despite the smallness of n exhibits rudimentary signatures of chaos this letter is a summary of our main results the gory details will appear in a companion paper | [['gauged', 'tensor', 'models', 'are', 'a', 'class', 'of', 'strongly', 'coupled', 'quantum', 'mechanical', 'theories', 'we', 'present', 'the', 'exact', 'analytic', 'solution', 'of', 'a', 'specific', 'example', 'of', 'such', 'a', 'theory', 'namely', 'the', 'smallest', 'colored', 'tensor', 'model', 'due', 'to', 'gurau', 'and', 'witten', 'that', 'exhibits', 'nonlinearities', 'we', 'find', 'explicit', 'analytic', 'expressions', 'for', 'the', 'eigenvalues', 'and', 'eigenstates', 'and', 'the', 'former', 'agree', 'precisely', 'with', 'previous', 'numerical', 'results', 'on', 'a', 'subset', 'of', 'eigenvalues', 'of', 'the', 'ungauged', 'theory', 'the', 'physics', 'of', 'the', 'spectrum', 'despite', 'the', 'smallness', 'of', 'n', 'exhibits', 'rudimentary', 'signatures', 'of', 'chaos', 'this', 'letter', 'is', 'a', 'summary', 'of', 'our', 'main', 'results', 'the', 'gory', 'details', 'will', 'appear', 'in', 'a', 'companion', 'paper']] | [-0.16500588765109678, 0.10344845263718508, -0.08339248205728755, 0.06093131846720629, -0.08215484736800784, -0.12480993505445134, -0.0068009116440218426, 0.2828531643781479, -0.17387220690414162, -0.2615504324030463, 0.09061186062748369, -0.312224295197774, -0.23939961818563243, 0.16114285115917942, -0.048341178965736364, 0.03801442742679674, 0.08073378116408787, 0.05985493685054307, -0.07616380328026665, -0.19852402577139805, 0.3282984834219707, 0.02304687002779787, 0.22487776821230235, 0.061244781737649204, 0.07906169829299987, -0.05422564727337201, -0.026950788301517172, 0.0045318719239370656, -0.155217204743545, 0.1417382017773862, 0.21670331754468844, 0.08648693965895489, 0.19223986829787787, -0.4098250030143426, -0.1877947250233576, 0.09985503213627651, 0.13467985221489084, 0.15467778462593876, -0.048525537462158146, -0.25363681506881913, 0.09942150621739503, -0.18098721905878865, -0.1692102613437017, -0.09025348059943702, 0.015653625038443225, -0.011022430861074928, -0.2758367377480879, 0.11149965968250417, 0.08219559572747734, 0.035018132792066524, -0.060833486993474385, -0.10409493933865192, -0.007716255960986018, 0.07390408133073609, 0.04750557261862617, -0.027669705607292084, 0.0787057612773658, -0.1574961280261194, -0.11641809523179389, 0.362110383319899, -0.06991758831951878, -0.20350484034544467, 0.1912603027251835, -0.1479707385152855, -0.15148041491848555, 0.066948284939079, 0.11957772315876318, 0.15160883574903306, -0.09927342158954332, 0.1697241372738891, -0.08919625900372273, 0.14312146041579177, 0.020062173914975754, 0.05357934962865887, 0.19097462242081908, 0.11296912635754941, 0.008774161744530839, 0.1547349611490891, 0.0014581935305037711, -0.124772835767247, -0.3790614202544831, -0.12668677963291083, -0.18789874313233218, 0.09598630614979838, -0.1072110669673847, -0.20544602445817764, 0.4653390600982279, 0.13867930178821553, 0.19626136515220388, 0.08453056833414029, 0.2561843276927524, 0.1382472938961709, 0.011532757154638223, 0.037124152272238885, 0.22928183203065158, 0.16765303808808474, 0.0718162013356122, -0.22375100343903104, -0.017260455042884527, 0.10786687434272896] |
1,802.02503 | A Praise for Defensive Programming: Leveraging Uncertainty for Effective
Malware Mitigation | A promising avenue for improving the effectiveness of behavioral-based
malware detectors would be to combine fast traditional machine learning
detectors with high-accuracy, but time-consuming deep learning models. The main
idea would be to place software receiving borderline classifications by
traditional machine learning methods in an environment where uncertainty is
added, while software is analyzed by more time-consuming deep learning models.
The goal of uncertainty would be to rate-limit actions of potential malware
during the time consuming deep analysis. In this paper, we present a detailed
description of the analysis and implementation of CHAMELEON, a framework for
realizing this uncertain environment for Linux. CHAMELEON offers two
environments for software: (i) standard - for any software identified as benign
by conventional machine learning methods and (ii) uncertain - for software
receiving borderline classifications when analyzed by these conventional
machine learning methods. The uncertain environment adds obstacles to software
execution through random perturbations applied probabilistically on selected
system calls. We evaluated CHAMELEON with 113 applications and 100 malware
samples for Linux. Our results showed that at threshold 10%, intrusive and
non-intrusive strategies caused approximately 65% of malware to fail
accomplishing their tasks, while approximately 30% of the analyzed benign
software to meet with various levels of disruption. With a dynamic, per-system
call threshold, CHAMELEON caused 92% of the malware to fail, and only 10% of
the benign software to be disrupted. We also found that I/O-bound software was
three times more affected by uncertainty than CPU-bound software. Further, we
analyzed the logs of software crashed with non-intrusive strategies, and found
that some crashes are due to the software bugs.
| cs.CR | a promising avenue for improving the effectiveness of behavioralbased malware detectors would be to combine fast traditional machine learning detectors with highaccuracy but timeconsuming deep learning models the main idea would be to place software receiving borderline classifications by traditional machine learning methods in an environment where uncertainty is added while software is analyzed by more timeconsuming deep learning models the goal of uncertainty would be to ratelimit actions of potential malware during the time consuming deep analysis in this paper we present a detailed description of the analysis and implementation of chameleon a framework for realizing this uncertain environment for linux chameleon offers two environments for software i standard for any software identified as benign by conventional machine learning methods and ii uncertain for software receiving borderline classifications when analyzed by these conventional machine learning methods the uncertain environment adds obstacles to software execution through random perturbations applied probabilistically on selected system calls we evaluated chameleon with 113 applications and 100 malware samples for linux our results showed that at threshold 10 intrusive and nonintrusive strategies caused approximately 65 of malware to fail accomplishing their tasks while approximately 30 of the analyzed benign software to meet with various levels of disruption with a dynamic persystem call threshold chameleon caused 92 of the malware to fail and only 10 of the benign software to be disrupted we also found that iobound software was three times more affected by uncertainty than cpubound software further we analyzed the logs of software crashed with nonintrusive strategies and found that some crashes are due to the software bugs | [['a', 'promising', 'avenue', 'for', 'improving', 'the', 'effectiveness', 'of', 'behavioralbased', 'malware', 'detectors', 'would', 'be', 'to', 'combine', 'fast', 'traditional', 'machine', 'learning', 'detectors', 'with', 'highaccuracy', 'but', 'timeconsuming', 'deep', 'learning', 'models', 'the', 'main', 'idea', 'would', 'be', 'to', 'place', 'software', 'receiving', 'borderline', 'classifications', 'by', 'traditional', 'machine', 'learning', 'methods', 'in', 'an', 'environment', 'where', 'uncertainty', 'is', 'added', 'while', 'software', 'is', 'analyzed', 'by', 'more', 'timeconsuming', 'deep', 'learning', 'models', 'the', 'goal', 'of', 'uncertainty', 'would', 'be', 'to', 'ratelimit', 'actions', 'of', 'potential', 'malware', 'during', 'the', 'time', 'consuming', 'deep', 'analysis', 'in', 'this', 'paper', 'we', 'present', 'a', 'detailed', 'description', 'of', 'the', 'analysis', 'and', 'implementation', 'of', 'chameleon', 'a', 'framework', 'for', 'realizing', 'this', 'uncertain', 'environment', 'for', 'linux', 'chameleon', 'offers', 'two', 'environments', 'for', 'software', 'i', 'standard', 'for', 'any', 'software', 'identified', 'as', 'benign', 'by', 'conventional', 'machine', 'learning', 'methods', 'and', 'ii', 'uncertain', 'for', 'software', 'receiving', 'borderline', 'classifications', 'when', 'analyzed', 'by', 'these', 'conventional', 'machine', 'learning', 'methods', 'the', 'uncertain', 'environment', 'adds', 'obstacles', 'to', 'software', 'execution', 'through', 'random', 'perturbations', 'applied', 'probabilistically', 'on', 'selected', 'system', 'calls', 'we', 'evaluated', 'chameleon', 'with', '113', 'applications', 'and', '100', 'malware', 'samples', 'for', 'linux', 'our', 'results', 'showed', 'that', 'at', 'threshold', '10', 'intrusive', 'and', 'nonintrusive', 'strategies', 'caused', 'approximately', '65', 'of', 'malware', 'to', 'fail', 'accomplishing', 'their', 'tasks', 'while', 'approximately', '30', 'of', 'the', 'analyzed', 'benign', 'software', 'to', 'meet', 'with', 'various', 'levels', 'of', 'disruption', 'with', 'a', 'dynamic', 'persystem', 'call', 'threshold', 'chameleon', 'caused', '92', 'of', 'the', 'malware', 'to', 'fail', 'and', 'only', '10', 'of', 'the', 'benign', 'software', 'to', 'be', 'disrupted', 'we', 'also', 'found', 'that', 'iobound', 'software', 'was', 'three', 'times', 'more', 'affected', 'by', 'uncertainty', 'than', 'cpubound', 'software', 'further', 'we', 'analyzed', 'the', 'logs', 'of', 'software', 'crashed', 'with', 'nonintrusive', 'strategies', 'and', 'found', 'that', 'some', 'crashes', 'are', 'due', 'to', 'the', 'software', 'bugs']] | [-0.07799425056668084, 0.04272441984069194, -0.0514060060808236, 0.08160952059663157, -0.09204772380020697, -0.2299169320186586, 0.06300367506084083, 0.4056245483873938, -0.2147891194726703, -0.3798845025660996, 0.10836108886896284, -0.25130738074827286, -0.127753131240002, 0.25179342545199257, -0.12703334079977152, 0.10623189062235579, 0.09465960584196995, -0.004050323672997872, -0.05593790326050646, -0.3113440541063528, 0.28379852736354555, 0.07793209952080554, 0.27903411287871255, 0.012078995671112602, 0.05155531347599076, -0.0030715886427032696, -0.05550249237282813, -0.012510149508629364, -0.057123436195701885, 0.10964506483176467, 0.344081733595816, 0.2251469375981544, 0.36013734988683394, -0.4180684331875607, -0.19989273240363212, 0.09536369372676225, 0.14249788599758842, 0.07498114865952178, -0.03911779319277862, -0.34274233988564434, 0.12712096976194504, -0.21910207181145216, -0.09280737995646382, -0.09636477449951508, 0.00446535428392324, -0.0020292160489582206, -0.22407621918921536, 0.010213121575306041, 0.03055637948550924, 0.08705910276052833, -0.02664193881494313, -0.11295921870823665, 0.033589577425417017, 0.12059415837908466, 0.05752366600124492, 0.034293806963717526, 0.22003916720148772, -0.14603774686333304, -0.13604192730423262, 0.3581941556132164, -0.020780515718686603, -0.12273422333959291, 0.24583693156871972, -0.0017789294978760126, -0.1719849810674289, 0.14470851417179467, 0.22199645759680003, 0.08125169145144195, -0.22705238847576753, 0.012263128274913082, 0.10916605366941343, 0.2048568008974095, 0.021749986564911162, -0.025595297857422296, 0.1703468767840785, 0.22839006921631916, 0.005138680659668193, 0.11869672208647634, -0.0752554344438116, -0.053205053088297885, -0.2037117078527986, -0.1162201025841388, -0.1262362448495052, 0.0008380402773547604, -0.08141568847472036, -0.15198965804679818, 0.34798585816165645, 0.22889443858569303, 0.11078165045038278, 0.07024092885544737, 0.3595605121093681, 0.014191247108712337, 0.1256961686410479, 0.14354632632053307, 0.21993923897355996, -0.009416236836313917, 0.12837102834867556, -0.15985674562487212, 0.12128124860086913, -0.033574858168717685] |
1,802.02504 | The revolution in physics of the early Nineteenth century revisited in
the context of science-and-society interaction | The radical changes in the concepts and approach in Physics at the turn of
the Nineteenth century were so deep, that is acknowledged as a revolution.
However, in 1970 Thomas Kuhn's careful reconstruction of the researches on the
black body problem, the concept itself of the revolution seemed to vanish in
his diluted discussion of every details. In the present paper, after an
examination of the limitations of Kuhn's response to his critics, I put forward
the idea, although it is not new, that these changes in Physics cannot be
reduced to a point-like event, but happened instead through multiple successive
(and even contradictory) changes in the course of decades. Such as the old
quantum hypothesis, wave mechanics, orthodox quantum mechanics. In fact, the
innovative perspectives started in the 1980s have been considered as a third
quantum revolution. My basic argument is that these changes, in order to be
really understood, must be interpreted not as mere specific changes in Physics,
but framed in the context of the deep social, cultural, and economic changes
during those turbulent years. The main steps are outlined.
| physics.hist-ph quant-ph | the radical changes in the concepts and approach in physics at the turn of the nineteenth century were so deep that is acknowledged as a revolution however in 1970 thomas kuhns careful reconstruction of the researches on the black body problem the concept itself of the revolution seemed to vanish in his diluted discussion of every details in the present paper after an examination of the limitations of kuhns response to his critics i put forward the idea although it is not new that these changes in physics cannot be reduced to a pointlike event but happened instead through multiple successive and even contradictory changes in the course of decades such as the old quantum hypothesis wave mechanics orthodox quantum mechanics in fact the innovative perspectives started in the 1980s have been considered as a third quantum revolution my basic argument is that these changes in order to be really understood must be interpreted not as mere specific changes in physics but framed in the context of the deep social cultural and economic changes during those turbulent years the main steps are outlined | [['the', 'radical', 'changes', 'in', 'the', 'concepts', 'and', 'approach', 'in', 'physics', 'at', 'the', 'turn', 'of', 'the', 'nineteenth', 'century', 'were', 'so', 'deep', 'that', 'is', 'acknowledged', 'as', 'a', 'revolution', 'however', 'in', '1970', 'thomas', 'kuhns', 'careful', 'reconstruction', 'of', 'the', 'researches', 'on', 'the', 'black', 'body', 'problem', 'the', 'concept', 'itself', 'of', 'the', 'revolution', 'seemed', 'to', 'vanish', 'in', 'his', 'diluted', 'discussion', 'of', 'every', 'details', 'in', 'the', 'present', 'paper', 'after', 'an', 'examination', 'of', 'the', 'limitations', 'of', 'kuhns', 'response', 'to', 'his', 'critics', 'i', 'put', 'forward', 'the', 'idea', 'although', 'it', 'is', 'not', 'new', 'that', 'these', 'changes', 'in', 'physics', 'can', 'not', 'be', 'reduced', 'to', 'a', 'pointlike', 'event', 'but', 'happened', 'instead', 'through', 'multiple', 'successive', 'and', 'even', 'contradictory', 'changes', 'in', 'the', 'course', 'of', 'decades', 'such', 'as', 'the', 'old', 'quantum', 'hypothesis', 'wave', 'mechanics', 'orthodox', 'quantum', 'mechanics', 'in', 'fact', 'the', 'innovative', 'perspectives', 'started', 'in', 'the', '1980s', 'have', 'been', 'considered', 'as', 'a', 'third', 'quantum', 'revolution', 'my', 'basic', 'argument', 'is', 'that', 'these', 'changes', 'in', 'order', 'to', 'be', 'really', 'understood', 'must', 'be', 'interpreted', 'not', 'as', 'mere', 'specific', 'changes', 'in', 'physics', 'but', 'framed', 'in', 'the', 'context', 'of', 'the', 'deep', 'social', 'cultural', 'and', 'economic', 'changes', 'during', 'those', 'turbulent', 'years', 'the', 'main', 'steps', 'are', 'outlined']] | [-0.0636709581139376, 0.1286208798177066, -0.12664526815617294, 0.10285126937821548, -0.10786826365991779, -0.10519878570156162, 0.011564652939737045, 0.3277953688774015, -0.2815794312071217, -0.31168078012896056, 0.11964173377845841, -0.25778405946545285, -0.1825465917246892, 0.1762539623858807, -0.15798324703380628, 0.0181264407140628, 0.059840821461124426, 0.040872469620333744, -0.05732678867871468, -0.29122061923692893, 0.28097148822701495, 0.08514150344221295, 0.252388207338062, 0.0680225241990031, 0.05363761114574078, 0.018743560536835423, -0.043196262916393134, 0.019434962286892267, -0.07451278043453899, 0.09218743674571907, 0.29061883892585605, 0.1641199016986597, 0.3446216805276218, -0.49340959431008186, -0.23328144497329206, 0.06277791120753493, 0.1287119077991836, 0.11540081157853939, -0.02126716526349217, -0.2707751318002525, 0.017650984820647864, -0.1746982961327455, -0.1526436162960675, -0.0167878983205731, 0.055439058202825, -0.0319523670599833, -0.11080254690466024, 0.04892633010825628, 0.11454218743449968, 0.08681117808674058, -0.012619060671726324, -0.1030982092969403, 0.03271651052763564, 0.15547608660578946, 0.10470728459388381, 0.05227901230809157, 0.13174448831420665, -0.11670533046834981, -0.14927600987974313, 0.3973423904567228, -0.0019253498637977907, -0.13458685733823347, 0.17617720581110125, -0.16562825879942544, -0.17632217536827186, 0.09530423905348669, 0.136922358940153, 0.08277223163421023, -0.15541604993916774, 0.06949111157439841, -0.023111937643435616, 0.1180326579344736, 0.07673139163576391, -0.0025011889032928434, 0.2602833635578661, 0.14295423394398074, -0.012852585582194202, 0.05030965424805839, -0.030598682531094906, -0.15442730385842404, -0.30735519486156787, -0.17670219682907412, -0.17816075952799545, 0.07656564731476702, 0.02512074367998297, -0.1403508556923834, 0.380450233887962, 0.14399035917425784, 0.15197222122072201, -0.05015241392285806, 0.25774898917070066, 0.08863061025698224, 0.08604096389330074, 0.03493508126753706, 0.3176004643091406, 0.08394784078827007, 0.18801782373338938, -0.13556665321432418, 0.1221715422478788, 0.046511045133229345] |
1,802.02505 | The monodromy of meromorphic projective structures | We study projective structures on a surface having poles of prescribed
orders. We obtain a monodromy map from a complex manifold parameterising such
structures to the stack of framed $\mathrm{PGL}_2(\mathbb{C})$ local systems on
the associated marked bordered surface. We prove that the image of this map is
contained in the union of the domains of the cluster charts. We discuss a
number of open questions concerning this monodromy map.
| math.GT math.AG math.DG | we study projective structures on a surface having poles of prescribed orders we obtain a monodromy map from a complex manifold parameterising such structures to the stack of framed mathrmpgl_2mathbbc local systems on the associated marked bordered surface we prove that the image of this map is contained in the union of the domains of the cluster charts we discuss a number of open questions concerning this monodromy map | [['we', 'study', 'projective', 'structures', 'on', 'a', 'surface', 'having', 'poles', 'of', 'prescribed', 'orders', 'we', 'obtain', 'a', 'monodromy', 'map', 'from', 'a', 'complex', 'manifold', 'parameterising', 'such', 'structures', 'to', 'the', 'stack', 'of', 'framed', 'mathrmpgl_2mathbbc', 'local', 'systems', 'on', 'the', 'associated', 'marked', 'bordered', 'surface', 'we', 'prove', 'that', 'the', 'image', 'of', 'this', 'map', 'is', 'contained', 'in', 'the', 'union', 'of', 'the', 'domains', 'of', 'the', 'cluster', 'charts', 'we', 'discuss', 'a', 'number', 'of', 'open', 'questions', 'concerning', 'this', 'monodromy', 'map']] | [-0.22795451946043666, 0.011308006601462113, -0.09095232634116775, 0.07639652823158742, -0.03166333461801211, -0.034547115581623024, 0.045801175582776035, 0.3451361357085947, -0.34405138532536617, -0.2375285289371791, 0.12433754610337665, -0.26317059011131094, -0.19162261197208494, 0.21271943975159008, -0.14539303629915568, 0.0023887307936514635, 0.07975317399098497, 0.07605372236265913, -0.1213732314147595, -0.25139591211210127, 0.4606717194875945, -0.061782876137590065, 0.19846305373948123, 0.02676774558705696, 0.1219372862437065, -0.008002745777206577, -0.05497905805342547, 0.02122175568660748, -0.16294675439554418, 0.20926076536863178, 0.23101939877117242, 0.10269992767860169, 0.1419380039880997, -0.4029462504052166, -0.20051846641750223, 0.15943981496536214, 0.11369795246940592, 0.06616837816123945, -0.0120754590548197, -0.284192092122807, 0.0963396083570315, -0.0854447191392166, -0.1700694040476304, -0.037982143151263394, -0.003452181239086001, 0.019995063489329987, -0.14217657443351936, -0.01076786209275757, 0.05810082355595153, 0.13416275014911871, -0.07345148080123076, -0.06605522846803069, -0.056422915066713875, 0.13816634560867713, -0.0216644367142378, 0.08959413339734833, 0.12990915159816327, -0.13973528582710718, -0.08101843408160452, 0.3440760823533587, -0.0547926414191075, -0.1898866349837972, 0.17194050464077273, -0.1507899817281767, -0.16198685324575374, 0.11964688344818095, 0.1564658979439865, 0.1259451520939668, -0.033696548122426735, 0.16710855461576063, -0.11531304917635693, 0.1408355636437815, 0.12742947773549004, -0.045156434311639466, 0.22668482799190973, 0.1419317045626973, 0.12518948915438133, 0.17389001127710377, -0.059253341181750366, -0.04546307148816793, -0.33879995475644653, -0.20913957290864293, -0.10390895506556051, 0.10804062265146902, -0.07662240598701696, -0.256298259548519, 0.44655445012925327, 0.06892779345313708, 0.28584609067310457, 0.03757029119541572, 0.2278513940240162, 0.04858189529698828, 0.06288629535423673, 0.044159508397991674, 0.09149179067732631, 0.16353250951573683, -0.009747058342116467, -0.16093847551383078, -0.02906928189854691, 0.1340895745518577] |
1,802.02506 | Can Local Stress Enhancement Induce Stability in Fracture Processes?
Part I: Apparent Stability | By comparing the evolution of the local and equal load sharing fiber bundle
models, we point out the paradoxical result that stresses seem to make the
local load sharing model stable when the equal load sharing model is not. We
explain this behavior by demonstrating that it is only an apparent stability in
the local load sharing model, which originates from a statistical effect due to
sample averaging. Even though we use the fiber bundle model to demonstrate the
apparent stability, we argue that it is a more general feature of fracture
processes.
| cond-mat.dis-nn | by comparing the evolution of the local and equal load sharing fiber bundle models we point out the paradoxical result that stresses seem to make the local load sharing model stable when the equal load sharing model is not we explain this behavior by demonstrating that it is only an apparent stability in the local load sharing model which originates from a statistical effect due to sample averaging even though we use the fiber bundle model to demonstrate the apparent stability we argue that it is a more general feature of fracture processes | [['by', 'comparing', 'the', 'evolution', 'of', 'the', 'local', 'and', 'equal', 'load', 'sharing', 'fiber', 'bundle', 'models', 'we', 'point', 'out', 'the', 'paradoxical', 'result', 'that', 'stresses', 'seem', 'to', 'make', 'the', 'local', 'load', 'sharing', 'model', 'stable', 'when', 'the', 'equal', 'load', 'sharing', 'model', 'is', 'not', 'we', 'explain', 'this', 'behavior', 'by', 'demonstrating', 'that', 'it', 'is', 'only', 'an', 'apparent', 'stability', 'in', 'the', 'local', 'load', 'sharing', 'model', 'which', 'originates', 'from', 'a', 'statistical', 'effect', 'due', 'to', 'sample', 'averaging', 'even', 'though', 'we', 'use', 'the', 'fiber', 'bundle', 'model', 'to', 'demonstrate', 'the', 'apparent', 'stability', 'we', 'argue', 'that', 'it', 'is', 'a', 'more', 'general', 'feature', 'of', 'fracture', 'processes']] | [-0.12707911147761047, 0.06921409759110325, -0.13714671623642727, 0.06606782693666235, -0.05160771314335126, -0.17840290614353713, 0.07964437025078443, 0.3908692145299527, -0.30402378375411676, -0.26433041433413185, 0.07856861934922035, -0.2411117895396166, -0.17013652868048157, 0.14153462821637752, -0.11230136234793932, -0.004836230158245051, 0.05272606151398792, 0.02175239155129079, -0.016860542283143088, -0.23626580682610693, 0.33226875546238116, 0.10552463924852751, 0.3739620463582136, 0.03435355968653194, 0.06621625556320113, -0.03294340304790005, -0.02053259589499043, 0.04574484352062466, -0.07492557470303376, 0.10342161338375781, 0.19077379511024142, 0.08420203294935485, 0.27515825224659773, -0.4069322828620125, -0.24957242664462956, 0.1637753689841878, 0.10738025485507903, 0.11328237245274927, 0.018399943426590643, -0.19681467096852037, 0.09274211874912663, -0.17629027564919764, -0.14847401368321592, -0.09415202465669442, 0.006711825362897368, -0.005314549954447855, -0.24026300958908534, 0.07726463488358203, 0.1131500623599496, 0.07797712739557028, -0.07801982607211798, -0.03310434753951486, -0.06290430914089885, 0.09071671163133767, 0.0846044149835624, -0.03537442518638507, 0.1621458587757442, -0.12626165345621607, -0.06734108759631072, 0.4174931765764311, -0.02181532794749865, -0.17997713982170166, 0.15829977242185944, -0.12085746210857085, -0.07967644771661168, 0.12413231774123125, 0.13280389361804532, 0.07715316007654834, -0.12329849478446313, 0.00013994650542235342, -0.05255856165682436, 0.18849170877083746, 0.03928296140805688, -0.026089627122361292, 0.20021609221434883, 0.18379628031654785, 0.08971360301779162, 0.12073271683547446, -0.07138236851421415, -0.1462635552843592, -0.3002305414467569, -0.14464083767586178, -0.16232748718316398, 0.08807883089453969, -0.0847279152891446, -0.11324687196963257, 0.37856339309264414, 0.1853532284918812, 0.23656566971812837, 0.07296707872827086, 0.3139222127545665, 0.09022602500013446, 0.11006004388333969, 0.1080519318335279, 0.27264336831066555, 0.08659549479583098, 0.08832010169643709, -0.23373832855804233, 0.08770877792830428, 0.011077874340116978] |
1,802.02507 | Measuring third party tracker power across web and mobile | Third-party networks collect vast amounts of data about users via web sites
and mobile applications. Consolidations among tracker companies can
significantly increase their individual tracking capabilities, prompting
scrutiny by competition regulators. Traditional measures of market share, based
on revenue or sales, fail to represent the tracking capability of a tracker,
especially if it spans both web and mobile. This paper proposes a new approach
to measure the concentration of tracking capability, based on the reach of a
tracker on popular websites and apps. Our results reveal that tracker
prominence and parent-subsidiary relationships have significant impact on
accurately measuring concentration.
| cs.CY | thirdparty networks collect vast amounts of data about users via web sites and mobile applications consolidations among tracker companies can significantly increase their individual tracking capabilities prompting scrutiny by competition regulators traditional measures of market share based on revenue or sales fail to represent the tracking capability of a tracker especially if it spans both web and mobile this paper proposes a new approach to measure the concentration of tracking capability based on the reach of a tracker on popular websites and apps our results reveal that tracker prominence and parentsubsidiary relationships have significant impact on accurately measuring concentration | [['thirdparty', 'networks', 'collect', 'vast', 'amounts', 'of', 'data', 'about', 'users', 'via', 'web', 'sites', 'and', 'mobile', 'applications', 'consolidations', 'among', 'tracker', 'companies', 'can', 'significantly', 'increase', 'their', 'individual', 'tracking', 'capabilities', 'prompting', 'scrutiny', 'by', 'competition', 'regulators', 'traditional', 'measures', 'of', 'market', 'share', 'based', 'on', 'revenue', 'or', 'sales', 'fail', 'to', 'represent', 'the', 'tracking', 'capability', 'of', 'a', 'tracker', 'especially', 'if', 'it', 'spans', 'both', 'web', 'and', 'mobile', 'this', 'paper', 'proposes', 'a', 'new', 'approach', 'to', 'measure', 'the', 'concentration', 'of', 'tracking', 'capability', 'based', 'on', 'the', 'reach', 'of', 'a', 'tracker', 'on', 'popular', 'websites', 'and', 'apps', 'our', 'results', 'reveal', 'that', 'tracker', 'prominence', 'and', 'parentsubsidiary', 'relationships', 'have', 'significant', 'impact', 'on', 'accurately', 'measuring', 'concentration']] | [-0.0677571522870234, -0.0018708893663382956, -0.04973719564827197, 0.047919484642951996, -0.11462344961212378, -0.17492644342935967, 0.09305510271877544, 0.41526264415540715, -0.20973675435751069, -0.4047869540636941, 0.08822565705857563, -0.37943435162876027, -0.12376745675490904, 0.20858227999225182, -0.13331086000389591, 0.01873747922351812, 0.13421834746793826, 0.04745833396350927, -0.0005519682641274162, -0.3028453186177975, 0.27708924167352367, 0.10610429463641984, 0.37929231125139157, 0.0964871429557893, 0.10114135048756072, 0.020091267464188288, -0.09721076102661234, -0.0024327146678174635, -0.08165171769323191, 0.2085781855832688, 0.29817846611294213, 0.21479159983217108, 0.33584794289983655, -0.43277858380152257, -0.1691411045779075, 0.10663537056736495, 0.13360464782929238, 0.0017150616349310291, -0.09345900329727945, -0.34800016240463877, 0.0992156161133162, -0.25030127163900406, -0.06097701812496798, -0.09937149772422901, 0.0009869288377539844, 0.07956842712259718, -0.22952051981523328, 0.0013985025972051888, -0.032128669243134865, 0.06349130147801978, -0.02026930729126824, -0.06588485979056936, -0.012753289489892825, 0.2254710248552681, 0.09449841539917171, -0.05170218121469477, 0.24499221883562147, -0.16779258821340165, -0.1370895699198757, 0.3357570842122279, -0.007169957018792344, -0.14172798348590732, 0.24183947172453057, -0.07919658742826052, -0.11614093669139001, 0.1128324488063856, 0.2781361474337561, 0.09016406641588831, -0.2109716554951607, -0.007377840837520756, -0.01147514414422366, 0.2135817924875538, 0.047233265881635705, 0.04891783832002203, 0.2362722060072939, 0.23820958798751235, 0.13144315605536483, 0.0652353872416769, -0.0768890487011142, -0.0968110002601063, -0.14827761327258634, -0.1519409708669219, -0.13998433039998825, -0.01678233879038646, -0.09855778028710974, -0.14576321137993006, 0.3766692264993884, 0.2389323583053311, 0.14915857200952704, 0.03304762520105103, 0.31336707616942383, -0.04094894401781375, 0.14303103030293382, 0.08800272151295628, 0.18816553427818783, -0.015584227360537922, 0.23376923422234094, -0.15417355452949294, 0.15414360402821925, 0.00521780948667806] |
1,802.02508 | Spectral Phase Control of Interfering Chirped Pulses for High-Energy
Narrowband Terahertz Generation | Highly-efficient optical generation of narrowband terahertz (THz) radiation
enables unexplored technologies and sciences from compact electron acceleration
to charge manipulation in solids. State-of-the-art conversion efficiencies are
currently achieved using difference-frequency generation (DFG) driven by
temporal beating of chirped pulses but remain, however, far lower than desired
or predicted. Here we show that high-order spectral phase fundamentally limits
the efficiency of narrowband DFG using chirped-pulse beating and resolve this
limitation by introducing a novel technique based on tuning the relative
spectral phase of the pulses. For optical terahertz generation, we demonstrate
a 13-fold enhancement in conversion efficiency for 1%-bandwidth, 0.361 THz
pulses, yielding a record energy of 0.6 mJ and exceeding previous
optically-generated energies by over an order of magnitude. Our results prove
the feasibility of millijoule-scale applications like terahertz-based electron
accelerators and light sources and solve the long-standing problem of temporal
irregularities in the pulse trains generated by interfering chirped pulses.
| physics.optics | highlyefficient optical generation of narrowband terahertz thz radiation enables unexplored technologies and sciences from compact electron acceleration to charge manipulation in solids stateoftheart conversion efficiencies are currently achieved using differencefrequency generation dfg driven by temporal beating of chirped pulses but remain however far lower than desired or predicted here we show that highorder spectral phase fundamentally limits the efficiency of narrowband dfg using chirpedpulse beating and resolve this limitation by introducing a novel technique based on tuning the relative spectral phase of the pulses for optical terahertz generation we demonstrate a 13fold enhancement in conversion efficiency for 1bandwidth 0361 thz pulses yielding a record energy of 06 mj and exceeding previous opticallygenerated energies by over an order of magnitude our results prove the feasibility of millijoulescale applications like terahertzbased electron accelerators and light sources and solve the longstanding problem of temporal irregularities in the pulse trains generated by interfering chirped pulses | [['highlyefficient', 'optical', 'generation', 'of', 'narrowband', 'terahertz', 'thz', 'radiation', 'enables', 'unexplored', 'technologies', 'and', 'sciences', 'from', 'compact', 'electron', 'acceleration', 'to', 'charge', 'manipulation', 'in', 'solids', 'stateoftheart', 'conversion', 'efficiencies', 'are', 'currently', 'achieved', 'using', 'differencefrequency', 'generation', 'dfg', 'driven', 'by', 'temporal', 'beating', 'of', 'chirped', 'pulses', 'but', 'remain', 'however', 'far', 'lower', 'than', 'desired', 'or', 'predicted', 'here', 'we', 'show', 'that', 'highorder', 'spectral', 'phase', 'fundamentally', 'limits', 'the', 'efficiency', 'of', 'narrowband', 'dfg', 'using', 'chirpedpulse', 'beating', 'and', 'resolve', 'this', 'limitation', 'by', 'introducing', 'a', 'novel', 'technique', 'based', 'on', 'tuning', 'the', 'relative', 'spectral', 'phase', 'of', 'the', 'pulses', 'for', 'optical', 'terahertz', 'generation', 'we', 'demonstrate', 'a', '13fold', 'enhancement', 'in', 'conversion', 'efficiency', 'for', '1bandwidth', '0361', 'thz', 'pulses', 'yielding', 'a', 'record', 'energy', 'of', '06', 'mj', 'and', 'exceeding', 'previous', 'opticallygenerated', 'energies', 'by', 'over', 'an', 'order', 'of', 'magnitude', 'our', 'results', 'prove', 'the', 'feasibility', 'of', 'millijoulescale', 'applications', 'like', 'terahertzbased', 'electron', 'accelerators', 'and', 'light', 'sources', 'and', 'solve', 'the', 'longstanding', 'problem', 'of', 'temporal', 'irregularities', 'in', 'the', 'pulse', 'trains', 'generated', 'by', 'interfering', 'chirped', 'pulses']] | [-0.10642184360059784, 0.19638389183888352, -0.0014696819990923679, 0.009305611506066713, -0.026065104338969733, -0.10836876584909151, 0.07586098626268574, 0.48630964572264535, -0.24807067879639264, -0.3492300992554708, 0.030904831876427664, -0.23278584454768664, -0.07826132405819874, 0.3339906042249798, -0.03611826324659224, 0.06128328982929422, 0.04934337038571972, -0.10973008147541534, -0.0172404167100762, -0.12050153177885993, 0.23197880531252185, 0.07549767873275119, 0.3563489938104475, 0.0682124227546533, 0.15763710978805917, -0.012126208867271457, -0.0038730108107965615, -0.10428212961886783, -0.07033308446463363, 0.1347125607056581, 0.24881034378100791, 0.04568654862610069, 0.26226960154992807, -0.42034186453973826, -0.2810407490029025, 0.05778461599933311, 0.16839987458975836, 0.10729312697878561, -0.12076210935924177, -0.27266626461484544, 0.04968339803540525, -0.1310677712569265, -0.0840469485406789, -0.05576704756350483, -0.030692832025689877, 0.09786438960440431, -0.2588040265136688, 0.061234829034908, 0.044030289302788114, 0.05441119358245585, -0.031725975459856864, -0.04212456244371227, 0.04899918622922505, 0.023827034531702363, -0.051601601210800374, 0.028875598767331825, 0.13621692991472553, -0.1629884665992388, -0.18847078596543823, 0.3639310926759011, -0.10384078255378267, -0.054522291508603944, 0.13307411728798085, -0.17332818218494286, -0.02020755340482857, 0.2130484137545667, 0.14318791433155686, 0.1685093154712278, -0.1057992806607807, -0.004350978374950009, 0.07812301756663097, 0.2707895940843013, 0.1975322811694413, 0.1482243936326405, 0.22692005198788703, 0.2115220885749, 0.047662091723051726, 0.12131526959726487, -0.14275393369953726, -0.0012565672108934992, -0.17787196028134408, -0.06766389695474424, -0.20872103449624232, 0.06837803029422404, -0.02873748035838346, -0.08253165319950534, 0.4588342247518232, 0.19660486406772523, 0.07828870131610578, -0.005100973331168093, 0.3706193525765746, 0.16450185820104782, 0.04189744256507618, 0.018538131170931296, 0.30453885383306173, 0.12747901583851845, 0.12372783570429641, -0.25108360027818866, -0.02727022036482152, -0.00760080581656783] |
1,802.02509 | Strong Amplifiers of Natural Selection: Proofs | We consider the modified Moran process on graphs to study the spread of
genetic and cultural mutations on structured populations. An initial mutant
arises either spontaneously (aka \emph{uniform initialization}), or during
reproduction (aka \emph{temperature initialization}) in a population of $n$
individuals, and has a fixed fitness advantage $r>1$ over the residents of the
population. The fixation probability is the probability that the mutant takes
over the entire population. Graphs that ensure fixation probability of~1 in the
limit of infinite populations are called \emph{strong amplifiers}. Previously,
only a few examples of strong amplifiers were known for uniform initialization,
whereas no strong amplifiers were known for temperature initialization.
In this work, we study necessary and sufficient conditions for strong
amplification, and prove negative and positive results. We show that for
temperature initialization, graphs that are unweighted and/or self-loop-free
have fixation probability upper-bounded by $1-1/f(r)$, where $f(r)$ is a
function linear in $r$. Similarly, we show that for uniform initialization,
bounded-degree graphs that are unweighted and/or self-loop-free have fixation
probability upper-bounded by $1-1/g(r,c)$, where $c$ is the degree bound and
$g(r,c)$ a function linear in $r$. Our main positive result complements these
negative results, and is as follows: every family of undirected graphs with
(i)~self loops and (ii)~diameter bounded by $n^{1-\epsilon}$, for some fixed
$\epsilon>0$, can be assigned weights that makes it a strong amplifier, both
for uniform and temperature initialization.
| cs.DM | we consider the modified moran process on graphs to study the spread of genetic and cultural mutations on structured populations an initial mutant arises either spontaneously aka emphuniform initialization or during reproduction aka emphtemperature initialization in a population of n individuals and has a fixed fitness advantage r1 over the residents of the population the fixation probability is the probability that the mutant takes over the entire population graphs that ensure fixation probability of1 in the limit of infinite populations are called emphstrong amplifiers previously only a few examples of strong amplifiers were known for uniform initialization whereas no strong amplifiers were known for temperature initialization in this work we study necessary and sufficient conditions for strong amplification and prove negative and positive results we show that for temperature initialization graphs that are unweighted andor selfloopfree have fixation probability upperbounded by 11fr where fr is a function linear in r similarly we show that for uniform initialization boundeddegree graphs that are unweighted andor selfloopfree have fixation probability upperbounded by 11grc where c is the degree bound and grc a function linear in r our main positive result complements these negative results and is as follows every family of undirected graphs with iself loops and iidiameter bounded by n1epsilon for some fixed epsilon0 can be assigned weights that makes it a strong amplifier both for uniform and temperature initialization | [['we', 'consider', 'the', 'modified', 'moran', 'process', 'on', 'graphs', 'to', 'study', 'the', 'spread', 'of', 'genetic', 'and', 'cultural', 'mutations', 'on', 'structured', 'populations', 'an', 'initial', 'mutant', 'arises', 'either', 'spontaneously', 'aka', 'emphuniform', 'initialization', 'or', 'during', 'reproduction', 'aka', 'emphtemperature', 'initialization', 'in', 'a', 'population', 'of', 'n', 'individuals', 'and', 'has', 'a', 'fixed', 'fitness', 'advantage', 'r1', 'over', 'the', 'residents', 'of', 'the', 'population', 'the', 'fixation', 'probability', 'is', 'the', 'probability', 'that', 'the', 'mutant', 'takes', 'over', 'the', 'entire', 'population', 'graphs', 'that', 'ensure', 'fixation', 'probability', 'of1', 'in', 'the', 'limit', 'of', 'infinite', 'populations', 'are', 'called', 'emphstrong', 'amplifiers', 'previously', 'only', 'a', 'few', 'examples', 'of', 'strong', 'amplifiers', 'were', 'known', 'for', 'uniform', 'initialization', 'whereas', 'no', 'strong', 'amplifiers', 'were', 'known', 'for', 'temperature', 'initialization', 'in', 'this', 'work', 'we', 'study', 'necessary', 'and', 'sufficient', 'conditions', 'for', 'strong', 'amplification', 'and', 'prove', 'negative', 'and', 'positive', 'results', 'we', 'show', 'that', 'for', 'temperature', 'initialization', 'graphs', 'that', 'are', 'unweighted', 'andor', 'selfloopfree', 'have', 'fixation', 'probability', 'upperbounded', 'by', '11fr', 'where', 'fr', 'is', 'a', 'function', 'linear', 'in', 'r', 'similarly', 'we', 'show', 'that', 'for', 'uniform', 'initialization', 'boundeddegree', 'graphs', 'that', 'are', 'unweighted', 'andor', 'selfloopfree', 'have', 'fixation', 'probability', 'upperbounded', 'by', '11grc', 'where', 'c', 'is', 'the', 'degree', 'bound', 'and', 'grc', 'a', 'function', 'linear', 'in', 'r', 'our', 'main', 'positive', 'result', 'complements', 'these', 'negative', 'results', 'and', 'is', 'as', 'follows', 'every', 'family', 'of', 'undirected', 'graphs', 'with', 'iself', 'loops', 'and', 'iidiameter', 'bounded', 'by', 'n1epsilon', 'for', 'some', 'fixed', 'epsilon0', 'can', 'be', 'assigned', 'weights', 'that', 'makes', 'it', 'a', 'strong', 'amplifier', 'both', 'for', 'uniform', 'and', 'temperature', 'initialization']] | [-0.11989920982264082, 0.14539711562257038, -0.03711873256066822, 0.07051130155008398, -0.032199966321352684, -0.2102611152321568, 0.08492328091148671, 0.4422445912081164, -0.2176776821432727, -0.26336616268715585, 0.09946272019589228, -0.24905202778331903, -0.14305277404400432, 0.139965064617943, -0.10628413866929744, 0.0101938738901118, 0.08658962139667684, 0.06165473489821659, 0.03206696950479707, -0.2791469756549333, 0.2906096083740599, 0.018900438908262037, 0.243516186160357, 0.030955583105623855, 0.11640632572474748, 0.014171750483107273, 0.006078552363874733, 0.0527260006116202, -0.12614741339488555, 0.020197166535051148, 0.2381318579741123, 0.15742769121033695, 0.31860836674647214, -0.3747777772054333, -0.202615862193224, 0.1784000803096295, 0.14390057574194384, 0.14020657599715708, -0.05220299886723337, -0.22784562360478625, 0.11620645071672184, -0.142775168668047, -0.09840960376123342, -0.04084013899132576, 0.0540918098269824, 0.08791739881172309, -0.3257501456602539, 0.04956938841718462, 0.11844490848861701, 0.056279676208494965, -0.01614260134880218, -0.15444516833879957, -0.04070220033913818, 0.11730469952571318, -0.007140176239837955, 0.02340747140068143, 0.10331167815845134, -0.13037150904573835, -0.12448130558023539, 0.2808172774003639, -0.0818284908810739, -0.1677869288887695, 0.1563336073249712, -0.1541577261150084, -0.15179504182674158, 0.11345973039973076, 0.14148894213547203, 0.12428238782864649, -0.09995006778248222, 0.10330656137617071, -0.05305136197493015, 0.14349751018672646, 0.1151966759705323, 0.023793306696069983, 0.12364069228332006, 0.12416439698048504, 0.14875394640690875, 0.14736856805262963, -0.04722680851833836, -0.09310743308755581, -0.2657602213807571, -0.10424802413825238, -0.2044543042380129, 0.08831297745614944, -0.15157806760397366, -0.18724402288735045, 0.37113021285327424, 0.09050806877521732, 0.21470390658224245, 0.15723244470414693, 0.23292583699501015, 0.09656274515687542, 0.04084618007941714, 0.09913342519279052, 0.15052913179615357, 0.10999837162123467, 0.02748798959741824, -0.19317100725174285, 0.16007354823588457, 0.04984229098974921] |
1,802.0251 | Control of surface potential at polar domain walls in a nonpolar oxide | Ferroic domain walls could play an important role in microelectronics, given
their nanometric size and often distinct functional properties. Until now,
devices and device concepts were mostly based on mobile domain walls in
ferromagnetic and ferroelectric materials. A less explored path is to make use
of polar domain walls in nonpolar ferroelastic materials. Indeed, while the
polar character of ferroelastic domain walls has been demonstrated,
polarization control has been elusive. Here, we report evidence for the
electrostatic signature of the domain-wall polarization in nonpolar calcium
titanate (CaTiO3). Macroscopic mechanical resonances excited by an ac electric
field are observed as a signature of a piezoelectric response caused by polar
walls. On the microscopic scale, the polarization in domain walls modifies the
local surface potential of the sample. Through imaging of surface potential
variations, we show that the potential at the domain wall can be controlled by
electron injection. This could enable devices based on nondestructive
information readout of surface potential.
| cond-mat.mtrl-sci | ferroic domain walls could play an important role in microelectronics given their nanometric size and often distinct functional properties until now devices and device concepts were mostly based on mobile domain walls in ferromagnetic and ferroelectric materials a less explored path is to make use of polar domain walls in nonpolar ferroelastic materials indeed while the polar character of ferroelastic domain walls has been demonstrated polarization control has been elusive here we report evidence for the electrostatic signature of the domainwall polarization in nonpolar calcium titanate catio3 macroscopic mechanical resonances excited by an ac electric field are observed as a signature of a piezoelectric response caused by polar walls on the microscopic scale the polarization in domain walls modifies the local surface potential of the sample through imaging of surface potential variations we show that the potential at the domain wall can be controlled by electron injection this could enable devices based on nondestructive information readout of surface potential | [['ferroic', 'domain', 'walls', 'could', 'play', 'an', 'important', 'role', 'in', 'microelectronics', 'given', 'their', 'nanometric', 'size', 'and', 'often', 'distinct', 'functional', 'properties', 'until', 'now', 'devices', 'and', 'device', 'concepts', 'were', 'mostly', 'based', 'on', 'mobile', 'domain', 'walls', 'in', 'ferromagnetic', 'and', 'ferroelectric', 'materials', 'a', 'less', 'explored', 'path', 'is', 'to', 'make', 'use', 'of', 'polar', 'domain', 'walls', 'in', 'nonpolar', 'ferroelastic', 'materials', 'indeed', 'while', 'the', 'polar', 'character', 'of', 'ferroelastic', 'domain', 'walls', 'has', 'been', 'demonstrated', 'polarization', 'control', 'has', 'been', 'elusive', 'here', 'we', 'report', 'evidence', 'for', 'the', 'electrostatic', 'signature', 'of', 'the', 'domainwall', 'polarization', 'in', 'nonpolar', 'calcium', 'titanate', 'catio3', 'macroscopic', 'mechanical', 'resonances', 'excited', 'by', 'an', 'ac', 'electric', 'field', 'are', 'observed', 'as', 'a', 'signature', 'of', 'a', 'piezoelectric', 'response', 'caused', 'by', 'polar', 'walls', 'on', 'the', 'microscopic', 'scale', 'the', 'polarization', 'in', 'domain', 'walls', 'modifies', 'the', 'local', 'surface', 'potential', 'of', 'the', 'sample', 'through', 'imaging', 'of', 'surface', 'potential', 'variations', 'we', 'show', 'that', 'the', 'potential', 'at', 'the', 'domain', 'wall', 'can', 'be', 'controlled', 'by', 'electron', 'injection', 'this', 'could', 'enable', 'devices', 'based', 'on', 'nondestructive', 'information', 'readout', 'of', 'surface', 'potential']] | [-0.1698029286128545, 0.18040201469612271, -0.051569861351108214, -0.03326555722504385, -0.11649162447337741, -0.10954079232120055, 0.03265134473009117, 0.4800427381253842, -0.2805185856403045, -0.2871199462492511, 0.08324081301850225, -0.23530923069378584, -0.14464701190825152, 0.20398161204315066, -0.020058758741350106, 0.033513442838693376, -0.04147965038552552, -0.0608804431105466, -0.02102156567574719, -0.12524699256608976, 0.24169959705586563, -0.010070890809098879, 0.35123360618866933, 0.13189030580117173, 0.06123971027679413, -0.041899890316732274, 0.06900083145958448, 0.0258638884245459, -0.12327319255806894, 0.09295651467763028, 0.2423617348262349, -0.0584696714397309, 0.22515589327686145, -0.5536234874287733, -0.25860255795864845, 0.027279460020714772, 0.1673826000582919, 0.1469989642592399, -0.13914978003887893, -0.2891337971902985, 0.07515672669283249, -0.0845337333743396, -0.11555653232067044, -0.07842844355640546, 0.03714807685127822, 0.014824967892509562, -0.1947613872775117, 0.06463070867917026, 0.05628831710947572, 0.12197658783937775, -0.11744465794997823, -0.13117429851290752, -0.05021602171033902, 0.09878901514347713, 0.031968261787386716, 0.07241662145290617, 0.2357571479811702, -0.14650524429883222, -0.1455506877680807, 0.34361933331069705, -0.028053818257384986, -0.17117318822767985, 0.19161519135272354, -0.1804865809192635, -0.0007682449401080983, 0.16388931667502477, 0.17689913764314832, 0.11038652106346387, -0.1877402484141665, 0.09105792467346203, 0.06322457400039307, 0.20041376425747015, 0.10627091906484475, 0.08390958765053055, 0.2932724528022073, 0.21379069246222857, 0.02175417679813017, 0.17584067481275611, -0.12424487649146819, -0.0248165068468489, -0.23696890216153818, -0.1787594724270814, -0.25419535737121535, 0.008188470787516614, -0.051613816622891405, -0.1897252721949217, 0.383389068574135, 0.1039041306665343, 0.10967008917996625, -0.12432978449992647, 0.2558470204495971, 0.005133010958813412, 0.12956235573463049, -0.010314954954357643, 0.2848807541922953, 0.1275810867331266, 0.13680534773072778, -0.2723402920612515, 0.11719677259020929, -0.01937009699338075] |
1,802.02511 | DeepHeart: Semi-Supervised Sequence Learning for Cardiovascular Risk
Prediction | We train and validate a semi-supervised, multi-task LSTM on 57,675
person-weeks of data from off-the-shelf wearable heart rate sensors, showing
high accuracy at detecting multiple medical conditions, including diabetes
(0.8451), high cholesterol (0.7441), high blood pressure (0.8086), and sleep
apnea (0.8298). We compare two semi-supervised train- ing methods,
semi-supervised sequence learning and heuristic pretraining, and show they
outperform hand-engineered biomarkers from the medical literature. We believe
our work suggests a new approach to patient risk stratification based on
cardiovascular risk scores derived from popular wearables such as Fitbit, Apple
Watch, or Android Wear.
| cs.LG cs.AI stat.ML | we train and validate a semisupervised multitask lstm on 57675 personweeks of data from offtheshelf wearable heart rate sensors showing high accuracy at detecting multiple medical conditions including diabetes 08451 high cholesterol 07441 high blood pressure 08086 and sleep apnea 08298 we compare two semisupervised train ing methods semisupervised sequence learning and heuristic pretraining and show they outperform handengineered biomarkers from the medical literature we believe our work suggests a new approach to patient risk stratification based on cardiovascular risk scores derived from popular wearables such as fitbit apple watch or android wear | [['we', 'train', 'and', 'validate', 'a', 'semisupervised', 'multitask', 'lstm', 'on', '57675', 'personweeks', 'of', 'data', 'from', 'offtheshelf', 'wearable', 'heart', 'rate', 'sensors', 'showing', 'high', 'accuracy', 'at', 'detecting', 'multiple', 'medical', 'conditions', 'including', 'diabetes', '08451', 'high', 'cholesterol', '07441', 'high', 'blood', 'pressure', '08086', 'and', 'sleep', 'apnea', '08298', 'we', 'compare', 'two', 'semisupervised', 'train', 'ing', 'methods', 'semisupervised', 'sequence', 'learning', 'and', 'heuristic', 'pretraining', 'and', 'show', 'they', 'outperform', 'handengineered', 'biomarkers', 'from', 'the', 'medical', 'literature', 'we', 'believe', 'our', 'work', 'suggests', 'a', 'new', 'approach', 'to', 'patient', 'risk', 'stratification', 'based', 'on', 'cardiovascular', 'risk', 'scores', 'derived', 'from', 'popular', 'wearables', 'such', 'as', 'fitbit', 'apple', 'watch', 'or', 'android', 'wear']] | [0.0264061837639103, -0.025380099114651482, -0.0536556553106284, 0.1060181293668675, -0.15466220101245262, -0.2680190933932518, 0.08527845241819862, 0.47761214935574037, -0.21483618121101766, -0.2905601016352831, 0.09390406416001162, -0.3553808513739756, -0.2118161225118728, 0.26879861830177065, -0.2616025419295605, 0.08921260296115545, 0.1775599958658775, 0.10112566043403343, 0.019041334352477443, -0.28625197443260075, 0.24748471164112462, -0.005794204498544849, 0.4274601448948185, 0.05057619428850882, 0.1427796911916578, -0.029628943052442593, -0.02213763814398098, -0.04695220639254769, -0.049230261195996966, 0.1420928602790642, 0.4109965053269233, 0.2406645286400085, 0.4306429597795352, -0.43869462790470787, -0.24744568979260564, 0.06703341199920096, 0.09167390441436363, 0.07213722462444727, -0.054281118109115754, -0.37578527267551287, 0.09711882055619325, -0.23500845653952324, 0.04275577899668066, -0.17518036872959405, -0.09928783592125721, 0.022070453272083367, -0.3189911574617713, 0.10921496408991516, -0.03362015517824597, 0.17325524473027593, -0.13667922979220748, -0.17840651663598314, 0.008739227008866682, 0.183467565337196, 0.08989525401172624, 0.019957693735935093, 0.26463882267025524, -0.188488735170398, -0.17280789019925327, 0.261803499829752, -0.047780333011914256, -0.10883678151455162, 0.2576898955365365, 0.028412545453114755, -0.16414528387202615, 0.06723050809272661, 0.30248277090575504, 0.1250638846447156, -0.1801050527385254, -0.12733767369772767, 0.058024235709366954, 0.18212104669568696, 0.12825900850678398, -0.07280568677889204, 0.12244140809059315, 0.29428251323172416, -0.036374387400888504, 0.09368830781106184, -0.19122654676501608, 0.048746952010939516, -0.12563434852910732, -0.1174370170271174, -0.15674286197614054, -0.008068714974630067, -0.1533151406188624, -0.1739889706428773, 0.3339041617816721, 0.25387959698236534, 0.13611788471796732, 0.09864034534742434, 0.39625171312912444, -0.06886678733381218, 0.10907351833650436, 0.10201727990703337, 0.13004263570055838, -0.06204597314220221, 0.15366982702893772, -0.19610999369640544, 0.11369858902675667, 0.02279845312580295] |
1,802.02512 | Large deviations of reaction fluxes | We study a system of interacting particles that randomly react to form new
particles. The reaction flux is the rescaled number of reactions that take
place in a time interval. We prove a dynamic large-deviation principle for the
reaction fluxes under general assumptions that include mass-action kinetics.
This result immediately implies the dynamic large deviations for the empirical
concentration.
| math.PR | we study a system of interacting particles that randomly react to form new particles the reaction flux is the rescaled number of reactions that take place in a time interval we prove a dynamic largedeviation principle for the reaction fluxes under general assumptions that include massaction kinetics this result immediately implies the dynamic large deviations for the empirical concentration | [['we', 'study', 'a', 'system', 'of', 'interacting', 'particles', 'that', 'randomly', 'react', 'to', 'form', 'new', 'particles', 'the', 'reaction', 'flux', 'is', 'the', 'rescaled', 'number', 'of', 'reactions', 'that', 'take', 'place', 'in', 'a', 'time', 'interval', 'we', 'prove', 'a', 'dynamic', 'largedeviation', 'principle', 'for', 'the', 'reaction', 'fluxes', 'under', 'general', 'assumptions', 'that', 'include', 'massaction', 'kinetics', 'this', 'result', 'immediately', 'implies', 'the', 'dynamic', 'large', 'deviations', 'for', 'the', 'empirical', 'concentration']] | [-0.12264998457631317, 0.18234507862667917, -0.11119648650923933, 0.09777737137372211, -0.008517380101385258, -0.11453147365916837, 0.09256933143330832, 0.30233086020512095, -0.2612008978375944, -0.25901749093969495, 0.004806645867667335, -0.2514057848720922, -0.09375656202782766, 0.14821638432094605, -0.0137279257967563, 0.012694646146590426, 0.10448328184232242, 0.029308723976393624, 0.019171250159299727, -0.19251419619609744, 0.3017276217529582, 0.026492194896090334, 0.23974442235746626, 0.08530102762831691, 0.09747768589690076, 0.01856067040698382, 0.049123114229464054, 0.031123495439730458, -0.16051832687342046, 0.06365614395462356, 0.19850023207649337, 0.09783381868895712, 0.22771514402860302, -0.48074836173426294, -0.258782978532678, 0.158466201197648, 0.09561352644873372, 0.13662440280856217, -0.06854010252203098, -0.23269674601822588, 0.029234798104202344, -0.12572816355248628, -0.17272304852445752, -0.043582980000114034, 0.047875725601057885, 0.09783962960512835, -0.3378370279540955, 0.07103892034551097, 0.10495548651127493, 0.0165151487878066, -0.08986669134001359, -0.06309919292501853, 0.01298302812975342, 0.11906806110420216, 0.07361457362313266, -0.053770780357161256, 0.23597270127196432, -0.04836011762825488, -0.05612773995972791, 0.3702274467480385, -0.08136411659593173, -0.19810698206646968, 0.16544165950015946, -0.15239655128601243, -0.2567931992649022, 0.19818509610022528, 0.226965724253806, 0.13608080429672184, -0.23942326931125027, 0.07667653095292842, -0.05858438484118146, 0.15082269553410804, 0.07210025654205958, -0.04481662334617764, 0.1349034710329468, 0.18172075871725457, 0.09366652054585896, 0.1164036614788791, -0.05907362972591388, -0.17995168995585734, -0.3276155177440684, -0.19694718548049361, -0.17030936924709103, 0.1431146942047497, -0.12601257057197518, -0.13810391675965009, 0.3001653102139737, 0.14614871656522155, 0.2082041149674836, 0.16324423643034267, 0.1917625458484863, 0.12975034111384617, 0.03904019581880105, 0.062208932887573364, 0.24153255204022941, 0.11419576439627652, 0.1375732231664203, -0.21616286515274039, 0.11506099746388904, 0.05421419718728985] |
1,802.02513 | Fra\"iss\'e structures and a conjecture of Furstenberg | We study problems concerning the Samuel compactification of the automorphism
group of a countable first-order structure. A key motivating question is a
problem of Furstenberg and a counter-conjecture by Pestov regarding the
difference between $S(G)$, the Samuel compactification, and $E(M(G))$, the
enveloping semigroup of the universal minimal flow. We resolve Furstenberg's
problem for several automorphism groups and give a detailed study in the case
of $G = S_\infty$, leading us to define and investigate several new types of
ultrafilter on a countable set.
| math.DS math.GR math.LO | we study problems concerning the samuel compactification of the automorphism group of a countable firstorder structure a key motivating question is a problem of furstenberg and a counterconjecture by pestov regarding the difference between sg the samuel compactification and emg the enveloping semigroup of the universal minimal flow we resolve furstenbergs problem for several automorphism groups and give a detailed study in the case of g s_infty leading us to define and investigate several new types of ultrafilter on a countable set | [['we', 'study', 'problems', 'concerning', 'the', 'samuel', 'compactification', 'of', 'the', 'automorphism', 'group', 'of', 'a', 'countable', 'firstorder', 'structure', 'a', 'key', 'motivating', 'question', 'is', 'a', 'problem', 'of', 'furstenberg', 'and', 'a', 'counterconjecture', 'by', 'pestov', 'regarding', 'the', 'difference', 'between', 'sg', 'the', 'samuel', 'compactification', 'and', 'emg', 'the', 'enveloping', 'semigroup', 'of', 'the', 'universal', 'minimal', 'flow', 'we', 'resolve', 'furstenbergs', 'problem', 'for', 'several', 'automorphism', 'groups', 'and', 'give', 'a', 'detailed', 'study', 'in', 'the', 'case', 'of', 'g', 's_infty', 'leading', 'us', 'to', 'define', 'and', 'investigate', 'several', 'new', 'types', 'of', 'ultrafilter', 'on', 'a', 'countable', 'set']] | [-0.17429079170005374, 0.05691732240863788, -0.11751840817799539, 0.10762579918028442, -0.14201500490494648, -0.07293857728349573, 0.0759947217862915, 0.29704920580196714, -0.34700942986909256, -0.23292901673257915, 0.16176413722698474, -0.2737125919694886, -0.1049757814494732, 0.21409258440878517, -0.16390248070712443, -0.002159257223944605, 0.03930706904488213, 0.08755754125821921, -0.07037559790927687, -0.22176121545806068, 0.4387108392921495, -0.04082100589495198, 0.21354135167267588, 0.07831465999055424, 0.12087958392307714, -0.021367080469420294, -0.06800981593766699, -0.0026721631602188685, -0.21174589619845335, 0.13574482811856325, 0.25330428119725834, 0.12027019832030307, 0.2722662283067396, -0.3513723075228893, -0.18650255286146278, 0.16489439470877434, 0.08679351211169067, 0.011810210659916017, -0.035429016475703706, -0.30021107258608587, 0.0893265847023289, -0.1943447348650223, -0.1263301296642533, -0.061985514874075665, 0.06921130941927801, -0.03642554786976105, -0.22418526378187156, -0.015258826769566462, 0.1323753929536008, 0.14206571722932068, -0.035781870032718155, -0.03328331778354851, 0.008370756002051043, 0.11181045551266935, 0.010660371199871102, 0.011763159688677133, 0.06148487036288888, -0.050018680212950264, -0.15112588370655788, 0.39232001423743773, -0.02741898585938745, -0.1498566205026927, 0.14782388326654464, -0.16962947079014998, -0.1993883347345723, 0.07194333675282973, 0.11326120549203529, 0.14740840964131402, -0.054278754217429434, 0.1763783695469438, -0.17008505696085868, 0.10865088944311863, 0.09923593415936202, -0.01442752065665928, 0.11849610274082717, 0.1643672377348268, 0.10920571017274518, 0.19014194791699635, 0.05775163034954465, -0.01599893057833851, -0.34498378234329047, -0.18406451146267813, -0.0675490076918109, 0.117842938164594, -0.11099480978934738, -0.19064823447519708, 0.447194907952238, 0.11027794568167057, 0.17447701827795417, 0.06561397070088136, 0.1564764330410801, 0.00503060375616949, -0.012698331669570856, 0.04701685688147942, 0.07791216995705057, 0.26649287649154385, -0.03202462070449083, -0.23772928206663993, -0.030857381819069017, 0.2367913073308214] |
1,802.02514 | B\"uchi-Kamp Theorems for 1-clock ATA | This paper investigates Kamp-like and B\"uchi-like theorems for 1-clock
Alternating Timed Automata (1-ATA) and its natural subclasses. A notion of
1-ATA with loop-free-resets is defined. This automaton class is shown to be
expressively equivalent to the temporal logic $\regmtl$ which is
$\mathsf{MTL[F_I]}$ extended with a regular expression guarded modality.
Moreover, a subclass of future timed MSO with k-variable-connectivity property
is introduced as logic $\qkmso$. In a Kamp-like result, it is shown that
$\regmtl$ is expressively equivalent to $\qkmso$. As our second result, we
define a notion of conjunctive-disjunctive 1-clock ATA ($\wf$ 1-ATA). We show
that $\wf$ 1-ATA with loop-free-resets are expressively equivalent to the
sublogic $\F\regmtl$ of $\regmtl$. Moreover $\F\regmtl$ is expressively
equivalent to $\qtwomso$, the two-variable connected fragment of $\qkmso$. The
full class of 1-ATA is shown to be expressively equivalent to $\regmtl$
extended with fixed point operators.
| cs.LO | this paper investigates kamplike and buchilike theorems for 1clock alternating timed automata 1ata and its natural subclasses a notion of 1ata with loopfreeresets is defined this automaton class is shown to be expressively equivalent to the temporal logic regmtl which is mathsfmtlf_i extended with a regular expression guarded modality moreover a subclass of future timed mso with kvariableconnectivity property is introduced as logic qkmso in a kamplike result it is shown that regmtl is expressively equivalent to qkmso as our second result we define a notion of conjunctivedisjunctive 1clock ata wf 1ata we show that wf 1ata with loopfreeresets are expressively equivalent to the sublogic fregmtl of regmtl moreover fregmtl is expressively equivalent to qtwomso the twovariable connected fragment of qkmso the full class of 1ata is shown to be expressively equivalent to regmtl extended with fixed point operators | [['this', 'paper', 'investigates', 'kamplike', 'and', 'buchilike', 'theorems', 'for', '1clock', 'alternating', 'timed', 'automata', '1ata', 'and', 'its', 'natural', 'subclasses', 'a', 'notion', 'of', '1ata', 'with', 'loopfreeresets', 'is', 'defined', 'this', 'automaton', 'class', 'is', 'shown', 'to', 'be', 'expressively', 'equivalent', 'to', 'the', 'temporal', 'logic', 'regmtl', 'which', 'is', 'mathsfmtlf_i', 'extended', 'with', 'a', 'regular', 'expression', 'guarded', 'modality', 'moreover', 'a', 'subclass', 'of', 'future', 'timed', 'mso', 'with', 'kvariableconnectivity', 'property', 'is', 'introduced', 'as', 'logic', 'qkmso', 'in', 'a', 'kamplike', 'result', 'it', 'is', 'shown', 'that', 'regmtl', 'is', 'expressively', 'equivalent', 'to', 'qkmso', 'as', 'our', 'second', 'result', 'we', 'define', 'a', 'notion', 'of', 'conjunctivedisjunctive', '1clock', 'ata', 'wf', '1ata', 'we', 'show', 'that', 'wf', '1ata', 'with', 'loopfreeresets', 'are', 'expressively', 'equivalent', 'to', 'the', 'sublogic', 'fregmtl', 'of', 'regmtl', 'moreover', 'fregmtl', 'is', 'expressively', 'equivalent', 'to', 'qtwomso', 'the', 'twovariable', 'connected', 'fragment', 'of', 'qkmso', 'the', 'full', 'class', 'of', '1ata', 'is', 'shown', 'to', 'be', 'expressively', 'equivalent', 'to', 'regmtl', 'extended', 'with', 'fixed', 'point', 'operators']] | [-0.0892507641085752, 0.08049910604347323, -0.0508731036959577, 0.12940454846717303, -0.11865804860252858, -0.19933638436893045, 0.01589693081503835, 0.39685850465569156, -0.3103816639198813, -0.20682354384758908, 0.07013667444066801, -0.2152931125935658, -0.13969781518329022, 0.15586047686362106, -0.14577057330269916, 0.03261031408915152, 0.0194954208762551, 0.07853560313192565, -0.016414927055178455, -0.22025141618309305, 0.2918423305215069, -5.279655041274174e-06, 0.21754635881466516, 0.028706629006119894, 0.10789855938159333, -0.016097391547649637, 0.03033175840685072, 0.14133002915123635, -0.08632957111976863, 0.10486192924743012, 0.32687369162982055, 0.21089097890685232, 0.26893455370567565, -0.31403744610589607, -0.10108272776065409, 0.15639102000737737, 0.07826187064539092, 0.03510552763401047, 0.0748710152656995, -0.3096430501647929, 0.1560893632095242, -0.21235634852922702, -0.0949425806558525, -0.03586134776949536, 0.07164242532277523, 0.049480268009757813, -0.2601306544790088, -0.036992497165514115, 0.21445087256819703, 0.011908137015709582, -0.02338120876427906, -0.04019859282285437, -0.027898959496036865, 0.00813130134456726, -0.08288521301939852, 0.04393257719803919, 0.04247970491026839, -0.0006280614048704621, -0.17135262041255225, 0.35569070543472964, -0.05781121891309587, -0.18872985287114633, 0.13880154135268788, -0.0855266281454138, -0.1738032036850792, 0.11238734372855388, 0.021411749454893807, 0.1591941231659563, -0.1551796148365089, 0.09414570238134398, -0.13779091343370287, 0.21606261335252858, 0.11676306055512192, 0.07094502793408411, 0.11987528343172382, 0.1792102755487774, 0.08092129700492288, 0.2567765827077737, 0.07245660267134969, -0.09969600590393525, -0.2526942583436305, -0.17079958263531964, -0.048136941290843165, 0.026771462762497308, 0.039664940988191934, -0.2131881262484826, 0.35279793764442896, 0.15056783234512852, 0.08827663248390422, 0.27212875301844996, 0.22880888821975898, 0.18669924836934276, 0.11153934273666652, 0.02551738286838513, 0.1170766311986444, 0.19073596892719583, 0.05307823133676551, -0.15239312362071133, 0.09293812415345984, 0.1501288160450699] |
1,802.02515 | Design study of random spectrometers for applications at optical
frequencies | Compact spectrometers based on disordered planar waveguides exhibit a rather
high resolution with a relatively small footprint as compared to conventional
spectrometers. This is achieved by multiple scattering of light which - if
properly engineered - significantly enhances the effective optical path length.
Here a design study of random spectrometers for TE- and TM-polarized light is
presented that combines the results of Mie theory, multiple-scattering theory
and full electromagnetic simulations. It is shown that the performance of such
random spectrometers depends on single scattering quantities, notably on the
overall scattering efficiency and the asymmetry parameter. Further, the study
shows that a well-developed diffusive regime is not required in practice and
that a standard integrated-optical layout is sufficient to obtain efficient
devices even for rather weakly scattering systems consisting of low index
inclusions in high-index matrices such as pores in planar silicon-nitride based
waveguides. This allows for both significant reductions in footprint with
acceptable losses in resolution and for device operation in the visible and
near-infrared frequency range.
| physics.optics physics.ins-det | compact spectrometers based on disordered planar waveguides exhibit a rather high resolution with a relatively small footprint as compared to conventional spectrometers this is achieved by multiple scattering of light which if properly engineered significantly enhances the effective optical path length here a design study of random spectrometers for te and tmpolarized light is presented that combines the results of mie theory multiplescattering theory and full electromagnetic simulations it is shown that the performance of such random spectrometers depends on single scattering quantities notably on the overall scattering efficiency and the asymmetry parameter further the study shows that a welldeveloped diffusive regime is not required in practice and that a standard integratedoptical layout is sufficient to obtain efficient devices even for rather weakly scattering systems consisting of low index inclusions in highindex matrices such as pores in planar siliconnitride based waveguides this allows for both significant reductions in footprint with acceptable losses in resolution and for device operation in the visible and nearinfrared frequency range | [['compact', 'spectrometers', 'based', 'on', 'disordered', 'planar', 'waveguides', 'exhibit', 'a', 'rather', 'high', 'resolution', 'with', 'a', 'relatively', 'small', 'footprint', 'as', 'compared', 'to', 'conventional', 'spectrometers', 'this', 'is', 'achieved', 'by', 'multiple', 'scattering', 'of', 'light', 'which', 'if', 'properly', 'engineered', 'significantly', 'enhances', 'the', 'effective', 'optical', 'path', 'length', 'here', 'a', 'design', 'study', 'of', 'random', 'spectrometers', 'for', 'te', 'and', 'tmpolarized', 'light', 'is', 'presented', 'that', 'combines', 'the', 'results', 'of', 'mie', 'theory', 'multiplescattering', 'theory', 'and', 'full', 'electromagnetic', 'simulations', 'it', 'is', 'shown', 'that', 'the', 'performance', 'of', 'such', 'random', 'spectrometers', 'depends', 'on', 'single', 'scattering', 'quantities', 'notably', 'on', 'the', 'overall', 'scattering', 'efficiency', 'and', 'the', 'asymmetry', 'parameter', 'further', 'the', 'study', 'shows', 'that', 'a', 'welldeveloped', 'diffusive', 'regime', 'is', 'not', 'required', 'in', 'practice', 'and', 'that', 'a', 'standard', 'integratedoptical', 'layout', 'is', 'sufficient', 'to', 'obtain', 'efficient', 'devices', 'even', 'for', 'rather', 'weakly', 'scattering', 'systems', 'consisting', 'of', 'low', 'index', 'inclusions', 'in', 'highindex', 'matrices', 'such', 'as', 'pores', 'in', 'planar', 'siliconnitride', 'based', 'waveguides', 'this', 'allows', 'for', 'both', 'significant', 'reductions', 'in', 'footprint', 'with', 'acceptable', 'losses', 'in', 'resolution', 'and', 'for', 'device', 'operation', 'in', 'the', 'visible', 'and', 'nearinfrared', 'frequency', 'range']] | [-0.11277489241414204, 0.16663428380369869, -0.05742640647946334, 0.021264001817964926, -0.053746902311459274, -0.14249096668563874, 0.02446990959749489, 0.45109784203331643, -0.21315753529211734, -0.3001457463109457, 0.07144513064725665, -0.2754800894608041, -0.15032185133824852, 0.25624948422560784, -0.04693294463327109, 0.06934049855860905, 0.07866278337598664, -0.036203536752997555, -0.03505262232203854, -0.16885300824509525, 0.24646622742662525, 0.07815877054164913, 0.3510266086910056, 0.08383645449208504, 0.10451710750859958, 0.06473294397952353, -0.0007356180903138365, 0.03400044747139895, -0.06294097218512722, 0.11750167543664802, 0.24950742685213323, 0.025839141355657087, 0.19142889483865896, -0.44433534141947945, -0.24054935615418888, 0.03181799452981866, 0.16631977406625703, 0.0737039354927419, -0.07615721265774039, -0.208609432884969, 0.0937099491541342, -0.13174925728207, -0.12434677666373672, -0.05038238307794772, 0.012018402792064746, 0.02693588117978013, -0.2791446494875567, 0.022385247210544683, 0.042473070079279016, 0.03418908806563151, -0.024023566717404743, -0.08661077640064788, 0.023797717058985698, 0.054146602236603315, -0.053434606996455754, -0.03148567179081643, 0.12700440989886752, -0.14662935365865962, -0.08636889887743675, 0.3981738119931301, -0.07989959165499341, -0.17733181500807405, 0.19527126789212274, -0.17742195187765458, -0.04161625113849324, 0.17960958918073874, 0.1788437910152247, 0.12854552798813618, -0.121184581302237, 0.08149011918324438, -0.005552622324946087, 0.2230943790182653, 0.07947454607630966, 0.12705486853998835, 0.1785033290136819, 0.21902166065055786, 0.05283652984809766, 0.12447138797213528, -0.11406809418524684, -0.029616261315645605, -0.2497844079927479, -0.12438566196090882, -0.17836748760210622, 0.028611672373588633, -0.10345748542226274, -0.18597532530288957, 0.34862774336801433, 0.13667134931538164, 0.16739318079724, 0.027544014813895224, 0.35289163584891914, 0.11485031123447698, 0.12200105415725308, 0.0321848436014545, 0.28189948577115814, 0.1399238347295933, 0.10713317510160822, -0.2230465310290683, 0.016750498197791053, -0.012892993026492527] |
1,802.02516 | Towards Understanding the Structure, Dynamics and Bio-activity of
Diabetic Drug Metformin | Small molecules are often found to exhibit extraordinarily diverse biological
activities. Metformin is one of them. It is widely used as anti-diabetic drug
for type-two diabetes. In addition to that, metformin hydrochloride shows
anti-tumour activities and increases the survival rate of patients suffering
from certain types of cancer namely colorectal, breast, pancreas and prostate
cancer. However, theoretical studies of structure and dynamics of metformin
have not yet been fully explored. In this work, we investigate the
characteristic structural and dynamical features of three mono-protonated forms
of metformin hydrochloride with the help of experiments, quantum chemical
calculations and atomistic molecular dynamics simulations. We validate our
force field by comparing simulation results to that of the experimental
findings. Nevertheless, we discover that the non-planar tautomeric form is the
most stable. Metformin forms strong hydrogen bonds with surrounding water
molecules and its solvation dynamics show unique features. Because of an
extended positive charge distribution, metformin possesses features of being a
permanent cationic partner toward several targets. We study its interaction and
binding ability with DNA using UV spectroscopy, circular dichroism, fluorimetry
and metadynamics simulation. We find a non-intercalating mode of interaction.
Metformin feasibly forms a minor/major groove-bound state within a few tens of
nanoseconds, preferably with AT rich domains. A significant decrease in the
free-energy of binding is observed when it binds to a minor groove of DNA.
| q-bio.BM cond-mat.soft physics.chem-ph | small molecules are often found to exhibit extraordinarily diverse biological activities metformin is one of them it is widely used as antidiabetic drug for typetwo diabetes in addition to that metformin hydrochloride shows antitumour activities and increases the survival rate of patients suffering from certain types of cancer namely colorectal breast pancreas and prostate cancer however theoretical studies of structure and dynamics of metformin have not yet been fully explored in this work we investigate the characteristic structural and dynamical features of three monoprotonated forms of metformin hydrochloride with the help of experiments quantum chemical calculations and atomistic molecular dynamics simulations we validate our force field by comparing simulation results to that of the experimental findings nevertheless we discover that the nonplanar tautomeric form is the most stable metformin forms strong hydrogen bonds with surrounding water molecules and its solvation dynamics show unique features because of an extended positive charge distribution metformin possesses features of being a permanent cationic partner toward several targets we study its interaction and binding ability with dna using uv spectroscopy circular dichroism fluorimetry and metadynamics simulation we find a nonintercalating mode of interaction metformin feasibly forms a minormajor groovebound state within a few tens of nanoseconds preferably with at rich domains a significant decrease in the freeenergy of binding is observed when it binds to a minor groove of dna | [['small', 'molecules', 'are', 'often', 'found', 'to', 'exhibit', 'extraordinarily', 'diverse', 'biological', 'activities', 'metformin', 'is', 'one', 'of', 'them', 'it', 'is', 'widely', 'used', 'as', 'antidiabetic', 'drug', 'for', 'typetwo', 'diabetes', 'in', 'addition', 'to', 'that', 'metformin', 'hydrochloride', 'shows', 'antitumour', 'activities', 'and', 'increases', 'the', 'survival', 'rate', 'of', 'patients', 'suffering', 'from', 'certain', 'types', 'of', 'cancer', 'namely', 'colorectal', 'breast', 'pancreas', 'and', 'prostate', 'cancer', 'however', 'theoretical', 'studies', 'of', 'structure', 'and', 'dynamics', 'of', 'metformin', 'have', 'not', 'yet', 'been', 'fully', 'explored', 'in', 'this', 'work', 'we', 'investigate', 'the', 'characteristic', 'structural', 'and', 'dynamical', 'features', 'of', 'three', 'monoprotonated', 'forms', 'of', 'metformin', 'hydrochloride', 'with', 'the', 'help', 'of', 'experiments', 'quantum', 'chemical', 'calculations', 'and', 'atomistic', 'molecular', 'dynamics', 'simulations', 'we', 'validate', 'our', 'force', 'field', 'by', 'comparing', 'simulation', 'results', 'to', 'that', 'of', 'the', 'experimental', 'findings', 'nevertheless', 'we', 'discover', 'that', 'the', 'nonplanar', 'tautomeric', 'form', 'is', 'the', 'most', 'stable', 'metformin', 'forms', 'strong', 'hydrogen', 'bonds', 'with', 'surrounding', 'water', 'molecules', 'and', 'its', 'solvation', 'dynamics', 'show', 'unique', 'features', 'because', 'of', 'an', 'extended', 'positive', 'charge', 'distribution', 'metformin', 'possesses', 'features', 'of', 'being', 'a', 'permanent', 'cationic', 'partner', 'toward', 'several', 'targets', 'we', 'study', 'its', 'interaction', 'and', 'binding', 'ability', 'with', 'dna', 'using', 'uv', 'spectroscopy', 'circular', 'dichroism', 'fluorimetry', 'and', 'metadynamics', 'simulation', 'we', 'find', 'a', 'nonintercalating', 'mode', 'of', 'interaction', 'metformin', 'feasibly', 'forms', 'a', 'minormajor', 'groovebound', 'state', 'within', 'a', 'few', 'tens', 'of', 'nanoseconds', 'preferably', 'with', 'at', 'rich', 'domains', 'a', 'significant', 'decrease', 'in', 'the', 'freeenergy', 'of', 'binding', 'is', 'observed', 'when', 'it', 'binds', 'to', 'a', 'minor', 'groove', 'of', 'dna']] | [-0.08196455342611214, 0.09769972234704534, -0.052286666002007084, 0.05733783230938538, -0.029221930373292248, -0.14408883745236709, 0.040415237248699006, 0.41311739574329137, -0.21852034154224317, -0.27987331980923275, 0.044218344463933225, -0.3224057111207937, -0.19282451123187974, 0.1657612871217147, 0.005557839654864291, 0.009614296404326015, 0.07300322490895318, 0.0012612417864671967, 0.025359530902262107, -0.20546408491534274, 0.23502268349365876, 0.05948922075733028, 0.2550732486184921, 0.11144803590057334, 0.06250173311999387, -0.047316732107418345, 0.027677839638419903, 0.006334392353367933, -0.13151253101481875, 0.13485510138006093, 0.2795391292777961, 0.08857454595823042, 0.2798822287728104, -0.46095660274328143, -0.23036456481041806, 0.07153360946271736, 0.13401075891168737, 0.13974309237548024, -0.09571732135871341, -0.25371186096674286, 0.0675499819073331, -0.15395218054008847, -0.13303964269079524, -0.10531608340317837, 0.0264229605200927, 0.060050125568129775, -0.2304552890423807, 0.11104180235014537, -0.012792080538667244, 0.11585872885552817, -0.10658262454462028, -0.12545883898027577, -0.06520344768462048, 0.1363214973764345, 0.07136361388309213, 0.030631236552139156, 0.22045214285629358, -0.14809688190229003, -0.1097939711940886, 0.3644172745906716, -0.029043804626043484, -0.12899560002846852, 0.2460336324104385, -0.14649399745001182, -0.1507247911420334, 0.18035454363436312, 0.12361928876667695, 0.12798600734068868, -0.1663266995304651, -0.010974729861560705, 0.0027122477275059297, 0.2048799349965217, 0.0795893125164717, -0.0064577081173591245, 0.19085220584534696, 0.20202180738497927, -0.023461548445813427, 0.13800808240823145, -0.12177517136198632, -0.09999137248441174, -0.1813371056598519, -0.17274015849437313, -0.123363520750154, 0.04128288123595396, -0.04773655629807009, -0.17663244577124715, 0.3837339662336367, 0.09685753478861607, 0.15861687016555923, 0.011077474361193274, 0.23835065566487862, -0.004212939846413294, 0.12727854617132997, -0.021994961494881962, 0.20851731792549594, 0.10865815048554896, 0.0470601596517136, -0.2701592923011966, 0.12526913134848933, -0.03826159365089224] |
1,802.02517 | Blueprint and Evaluation Instruments for a Course on Software
Engineering for Sustainability | We report on a summer school course on Software Engineering for
Sustainability (SE4S). We provide a detailed blueprint of the contents taught
and its evaluation with the instruments that were used.
| cs.SE | we report on a summer school course on software engineering for sustainability se4s we provide a detailed blueprint of the contents taught and its evaluation with the instruments that were used | [['we', 'report', 'on', 'a', 'summer', 'school', 'course', 'on', 'software', 'engineering', 'for', 'sustainability', 'se4s', 'we', 'provide', 'a', 'detailed', 'blueprint', 'of', 'the', 'contents', 'taught', 'and', 'its', 'evaluation', 'with', 'the', 'instruments', 'that', 'were', 'used']] | [-0.06414427622221411, 0.0577434062336882, -0.1714076635427773, 0.030160529849429924, -0.121383798122406, -0.0977771025771896, 0.03812217920397719, 0.4031246772734448, -0.10991156374414762, -0.40998017055292924, 0.18391641229391098, -0.2365883726781855, -0.17311219808955988, 0.2738279049595197, -0.09868486200769742, -0.0072203124582301825, 0.16588681973516942, 0.009695168733014726, -0.04754194861743599, -0.33112305322041113, 0.26198532016326986, 0.15049783028662206, 0.32362570021456727, 0.11907843413452307, 0.11672101117049655, 0.018101162308206162, -0.07779308302948872, -0.03609340594460567, -0.18786089992427152, 0.21212549433112143, 0.33906471884498995, 0.23348087143773835, 0.3251913464317719, -0.46316101811826227, -0.11222373228520155, -0.04851020763938626, -0.007326295257856449, 0.04166693370789289, -0.08383563534201434, -0.2776151436691483, -0.022804165352135898, -0.18970052644920846, -0.10489140981808305, -0.08164908053974311, -0.0484457123093307, 0.009988016293694576, -0.12834019251167775, -0.06987607003344844, 0.0006683199976881345, 0.2714495918247849, -0.057778261062533906, -0.19633604545767108, -0.01878539202734828, 0.2125076903127289, -0.060929611697793006, -0.04354900124793251, 0.16619378716374436, -0.10580624702076118, -0.15912032934526602, 0.41428191447630525, -0.06276733697741292, -0.09311049145956835, 0.22001846153289079, -0.10584686916942397, -0.20060325604863466, 0.02017867686226964, 0.3153362389653921, 0.08517568646154056, -0.13447247948497534, 0.04424638564814813, 0.06036196357260148, 0.20745747064550718, -0.012157990814497073, -0.06932799896846215, 0.26236247407893337, 0.23516805780430636, 0.007332634025563796, 0.13869116542239984, -0.043510769074782726, -0.03517200093095501, -0.3337028748045365, -0.23658332225556175, -0.11010689230946204, 0.04537291085968415, 0.07705209239744969, -0.13385918398853391, 0.4781690542896589, 0.15706386227781574, 0.06179942780484756, 0.02269558220480879, 0.2405011635273695, 0.042249094632764654, 0.01210607859926919, 0.06375791287670533, 0.1953981081644694, 0.01182824488884459, 0.2643772619776428, -0.11320607860883077, 0.11240156986750663, 0.05598558673324684] |
1,802.02518 | Disconnection by level sets of the discrete Gaussian free field and
entropic repulsion | We derive asymptotic upper and lower bounds on the large deviation
probability that the level set of the Gaussian free field on $Z^d$, d bigger or
equal to three, below a given level disconnects the discrete blow-up of a
compact set A from the boundary of the discrete blow-up of a box that contains
A, when the level set of the Gaussian free field above this level is in a
strongly percolative regime. These bounds substantially strengthen the results
of arXiv:1412.3960, where A was a box and the convexity of A played an
important role in the proof. We also derive an asymptotic upper bound on the
probability that the average of the Gaussian free field well inside the
discrete blow-up of A is above a certain level when disconnection occurs. The
derivation of the upper bounds uses the solidification estimates for porous
interfaces that were derived in the work arXiv:1706.07229 of A.-S. Sznitman and
the author to treat a similar disconnection problem for the vacant set of
random interlacements. If certain critical levels for the Gaussian free field
coincide, an open question at the moment, the asymptotic upper and lower bounds
that we obtain for the disconnection probability match in principal order, and
conditioning on disconnection lowers the average of the Gaussian free field
well inside the discrete blow-up of A, which can be understood as entropic
repulsion.
| math.PR math-ph math.MP | we derive asymptotic upper and lower bounds on the large deviation probability that the level set of the gaussian free field on zd d bigger or equal to three below a given level disconnects the discrete blowup of a compact set a from the boundary of the discrete blowup of a box that contains a when the level set of the gaussian free field above this level is in a strongly percolative regime these bounds substantially strengthen the results of arxiv14123960 where a was a box and the convexity of a played an important role in the proof we also derive an asymptotic upper bound on the probability that the average of the gaussian free field well inside the discrete blowup of a is above a certain level when disconnection occurs the derivation of the upper bounds uses the solidification estimates for porous interfaces that were derived in the work arxiv170607229 of as sznitman and the author to treat a similar disconnection problem for the vacant set of random interlacements if certain critical levels for the gaussian free field coincide an open question at the moment the asymptotic upper and lower bounds that we obtain for the disconnection probability match in principal order and conditioning on disconnection lowers the average of the gaussian free field well inside the discrete blowup of a which can be understood as entropic repulsion | [['we', 'derive', 'asymptotic', 'upper', 'and', 'lower', 'bounds', 'on', 'the', 'large', 'deviation', 'probability', 'that', 'the', 'level', 'set', 'of', 'the', 'gaussian', 'free', 'field', 'on', 'zd', 'd', 'bigger', 'or', 'equal', 'to', 'three', 'below', 'a', 'given', 'level', 'disconnects', 'the', 'discrete', 'blowup', 'of', 'a', 'compact', 'set', 'a', 'from', 'the', 'boundary', 'of', 'the', 'discrete', 'blowup', 'of', 'a', 'box', 'that', 'contains', 'a', 'when', 'the', 'level', 'set', 'of', 'the', 'gaussian', 'free', 'field', 'above', 'this', 'level', 'is', 'in', 'a', 'strongly', 'percolative', 'regime', 'these', 'bounds', 'substantially', 'strengthen', 'the', 'results', 'of', 'arxiv14123960', 'where', 'a', 'was', 'a', 'box', 'and', 'the', 'convexity', 'of', 'a', 'played', 'an', 'important', 'role', 'in', 'the', 'proof', 'we', 'also', 'derive', 'an', 'asymptotic', 'upper', 'bound', 'on', 'the', 'probability', 'that', 'the', 'average', 'of', 'the', 'gaussian', 'free', 'field', 'well', 'inside', 'the', 'discrete', 'blowup', 'of', 'a', 'is', 'above', 'a', 'certain', 'level', 'when', 'disconnection', 'occurs', 'the', 'derivation', 'of', 'the', 'upper', 'bounds', 'uses', 'the', 'solidification', 'estimates', 'for', 'porous', 'interfaces', 'that', 'were', 'derived', 'in', 'the', 'work', 'arxiv170607229', 'of', 'as', 'sznitman', 'and', 'the', 'author', 'to', 'treat', 'a', 'similar', 'disconnection', 'problem', 'for', 'the', 'vacant', 'set', 'of', 'random', 'interlacements', 'if', 'certain', 'critical', 'levels', 'for', 'the', 'gaussian', 'free', 'field', 'coincide', 'an', 'open', 'question', 'at', 'the', 'moment', 'the', 'asymptotic', 'upper', 'and', 'lower', 'bounds', 'that', 'we', 'obtain', 'for', 'the', 'disconnection', 'probability', 'match', 'in', 'principal', 'order', 'and', 'conditioning', 'on', 'disconnection', 'lowers', 'the', 'average', 'of', 'the', 'gaussian', 'free', 'field', 'well', 'inside', 'the', 'discrete', 'blowup', 'of', 'a', 'which', 'can', 'be', 'understood', 'as', 'entropic', 'repulsion']] | [-0.11464497598149535, 0.15724469077401426, -0.0781014073219379, 0.08922287665783395, -0.024428253317366175, -0.10221581574602935, 0.12358053790261406, 0.2807511959976533, -0.23212055015181632, -0.27168337008384824, 0.1295638941677712, -0.2639034861441408, -0.10151579876924587, 0.18418774546993072, -0.05445162355981506, 0.03095545826618674, 0.0020808412411593294, 0.13337705554358922, -0.04434928951045629, -0.24673674782184607, 0.3244634043004593, 0.04438145003044618, 0.2645195955655685, 0.10197392877460898, 0.0898976306892572, 0.0016187480870397401, 0.014433437488613683, 0.013320524731585593, -0.1919282195697298, 0.13829362539016934, 0.17417828347166314, 0.0695145032082668, 0.2850708442417447, -0.4047102008358036, -0.20494597420819397, 0.1122649472304865, 0.13783458732640402, 0.08614525339604977, -0.012463562435617572, -0.2785674619586452, 0.09849366036309093, -0.111924466807722, -0.14331823406871735, 0.02917033636517692, 0.01384425935541737, 0.038159520142679024, -0.2959818455733751, 0.06815853169003579, 0.1339353959723539, 0.060008165368855226, -0.08514543135013235, -0.11616036115459824, -0.030084807086703285, 0.14113192621995327, 0.018240729809469104, 0.03620217131155139, 0.1125307893829845, -0.14856205986832624, -0.08151915872453205, 0.32335388491322337, -0.09029057226399075, -0.20429951715969333, 0.17372330364448493, -0.1811607203552532, -0.12409259489810977, 0.14253908731941983, 0.1685871612137641, 0.09653796560310743, -0.1066997689262631, 0.1382491155382013, -0.08518731354259919, 0.1248601428085015, 0.11059463679333005, 0.006408721800860867, 0.14492296188887976, 0.13943523532106428, 0.15591458504684597, 0.15936219873439864, -0.09400856753774478, -0.09777952407245737, -0.3817336129089981, -0.144309688806013, -0.222221735162301, 0.06741878272977804, -0.13217961996263494, -0.2194950629185003, 0.3553250112464619, 0.121602379243102, 0.2195393276449881, 0.1037646522913986, 0.24672292383069075, 0.18392258091740873, -0.004738444350598576, 0.10573934944420073, 0.1919667594290028, 0.14231910028498979, 0.00917420595917001, -0.17216956531302186, 0.07140709975889574, 0.1097346392190574] |
1,802.02519 | The Ising model coupled to 2d orders | In this article we make first steps in coupling matter to causal set theory
in the path integral. We explore the case of the Ising model coupled to the 2d
discrete Einstein Hilbert action, restricted to the 2d orders. We probe the
phase diagram in terms of the Wick rotation parameter \b{eta} and the Ising
coupling j and find that the matter and the causal sets together give rise to
an interesting phase structure. The couplings give rise to five different
phases. The causal sets take on random or crystalline characteristics as
described in [1] and the Ising model can be correlated or uncorrelated on the
random ordes and correlated, uncorrelated or anti-correlated on the crystalline
orders. We find that at least one new phase transition arises, in which the
Ising spins push the causal set into the crystalline phase.
| gr-qc hep-th | in this article we make first steps in coupling matter to causal set theory in the path integral we explore the case of the ising model coupled to the 2d discrete einstein hilbert action restricted to the 2d orders we probe the phase diagram in terms of the wick rotation parameter beta and the ising coupling j and find that the matter and the causal sets together give rise to an interesting phase structure the couplings give rise to five different phases the causal sets take on random or crystalline characteristics as described in 1 and the ising model can be correlated or uncorrelated on the random ordes and correlated uncorrelated or anticorrelated on the crystalline orders we find that at least one new phase transition arises in which the ising spins push the causal set into the crystalline phase | [['in', 'this', 'article', 'we', 'make', 'first', 'steps', 'in', 'coupling', 'matter', 'to', 'causal', 'set', 'theory', 'in', 'the', 'path', 'integral', 'we', 'explore', 'the', 'case', 'of', 'the', 'ising', 'model', 'coupled', 'to', 'the', '2d', 'discrete', 'einstein', 'hilbert', 'action', 'restricted', 'to', 'the', '2d', 'orders', 'we', 'probe', 'the', 'phase', 'diagram', 'in', 'terms', 'of', 'the', 'wick', 'rotation', 'parameter', 'beta', 'and', 'the', 'ising', 'coupling', 'j', 'and', 'find', 'that', 'the', 'matter', 'and', 'the', 'causal', 'sets', 'together', 'give', 'rise', 'to', 'an', 'interesting', 'phase', 'structure', 'the', 'couplings', 'give', 'rise', 'to', 'five', 'different', 'phases', 'the', 'causal', 'sets', 'take', 'on', 'random', 'or', 'crystalline', 'characteristics', 'as', 'described', 'in', '1', 'and', 'the', 'ising', 'model', 'can', 'be', 'correlated', 'or', 'uncorrelated', 'on', 'the', 'random', 'ordes', 'and', 'correlated', 'uncorrelated', 'or', 'anticorrelated', 'on', 'the', 'crystalline', 'orders', 'we', 'find', 'that', 'at', 'least', 'one', 'new', 'phase', 'transition', 'arises', 'in', 'which', 'the', 'ising', 'spins', 'push', 'the', 'causal', 'set', 'into', 'the', 'crystalline', 'phase']] | [-0.13545904956798224, 0.20444557451060555, -0.05307018675291978, 0.06294263893547435, -0.05698162993322388, -0.14288328683151186, 0.03908603635646751, 0.3548357440828741, -0.2744459306700624, -0.26950017894155903, 0.059518877197418815, -0.2874594382295157, -0.13137578062140282, 0.12161915040936777, 0.020066448189184176, -0.004291231053874647, -0.02822213671538684, 0.043135107571942555, -0.09736931080454224, -0.266123993682387, 0.3221443494472597, -0.029714191443012128, 0.2663136014386948, -0.008774304156117945, 0.0916121814704815, 0.029818599782348108, -0.0019485947253892748, 0.04015433158484294, -0.16984280695011855, 0.05624503008485269, 0.20388531542078278, 0.004788658536448003, 0.16156448149658312, -0.4486663787753033, -0.19848969978072661, 0.1239590622441133, 0.11123625024241938, 0.11489872191111362, 0.017986924400077396, -0.2941369708148401, 0.002823938230360798, -0.1440662756443305, -0.11109334630757678, -0.09337703839761854, -0.021271701419739414, -0.04559894842464182, -0.2657165132557618, 0.07990605119119981, 0.07190154722670643, 0.033802950173522604, -0.05224888627383885, -0.08285990492072251, -0.025556805376097454, 0.10759396150895803, 0.03530136538877172, 0.07209145618776838, 0.07151976264946217, -0.1240659147758948, -0.14247206904047685, 0.37829564763115814, -0.04965047361354324, -0.17497411404448232, 0.21046424716737844, -0.1680508107199248, -0.15416580300590546, 0.11639285869494402, 0.1779378413175829, 0.0730008777807192, -0.12068924479221711, 0.08548067960844806, 0.001180648760159882, 0.1553556976183284, 0.012108686053455412, 0.047371116192951104, 0.23988581621683774, 0.13080849569532083, 0.049765978851054105, 0.18276604442110136, -0.07477169045290688, -0.16128658541484917, -0.3026620909461095, -0.15242895061525402, -0.17730836649324824, 0.045984839102615124, -0.1523656217349323, -0.21893498925291163, 0.43859033865465535, 0.17814153667938018, 0.20484752749032575, 0.009428440158510005, 0.21237107841029979, 0.10149278679109687, 0.032319430080945975, 0.033950205192157475, 0.25104705728054477, 0.1507365618691706, 0.05445665156589352, -0.21063493048812418, 0.03437440431000088, 0.08474111031379095] |
1,802.0252 | Combinatorial views on persistent characters in phylogenetics | The so-called binary perfect phylogeny with persistent characters has
recently been thoroughly studied in computational biology as it is less
restrictive than the well known binary perfect phylogeny. Here, we focus on the
notion of (binary) persistent characters, i.e. characters that can be realized
on a phylogenetic tree by at most one $0 \rightarrow 1$ transition followed by
at most one $1 \rightarrow 0$ transition in the tree, and analyze these
characters under different aspects. First, we illustrate the connection between
persistent characters and Maximum Parsimony, where we characterize persistent
characters in terms of the first phase of the famous Fitch algorithm.
Afterwards we focus on the number of persistent characters for a given
phylogenetic tree. We show that this number solely depends on the balance of
the tree. To be precise, we develop a formula for counting the number of
persistent characters for a given phylogenetic tree based on an index of tree
balance, namely the Sackin index. Lastly, we consider the question of how many
(carefully chosen) binary characters together with their persistence status are
needed to uniquely determine a phylogenetic tree and provide an upper bound for
the number of characters needed.
| q-bio.PE math.CO | the socalled binary perfect phylogeny with persistent characters has recently been thoroughly studied in computational biology as it is less restrictive than the well known binary perfect phylogeny here we focus on the notion of binary persistent characters ie characters that can be realized on a phylogenetic tree by at most one 0 rightarrow 1 transition followed by at most one 1 rightarrow 0 transition in the tree and analyze these characters under different aspects first we illustrate the connection between persistent characters and maximum parsimony where we characterize persistent characters in terms of the first phase of the famous fitch algorithm afterwards we focus on the number of persistent characters for a given phylogenetic tree we show that this number solely depends on the balance of the tree to be precise we develop a formula for counting the number of persistent characters for a given phylogenetic tree based on an index of tree balance namely the sackin index lastly we consider the question of how many carefully chosen binary characters together with their persistence status are needed to uniquely determine a phylogenetic tree and provide an upper bound for the number of characters needed | [['the', 'socalled', 'binary', 'perfect', 'phylogeny', 'with', 'persistent', 'characters', 'has', 'recently', 'been', 'thoroughly', 'studied', 'in', 'computational', 'biology', 'as', 'it', 'is', 'less', 'restrictive', 'than', 'the', 'well', 'known', 'binary', 'perfect', 'phylogeny', 'here', 'we', 'focus', 'on', 'the', 'notion', 'of', 'binary', 'persistent', 'characters', 'ie', 'characters', 'that', 'can', 'be', 'realized', 'on', 'a', 'phylogenetic', 'tree', 'by', 'at', 'most', 'one', '0', 'rightarrow', '1', 'transition', 'followed', 'by', 'at', 'most', 'one', '1', 'rightarrow', '0', 'transition', 'in', 'the', 'tree', 'and', 'analyze', 'these', 'characters', 'under', 'different', 'aspects', 'first', 'we', 'illustrate', 'the', 'connection', 'between', 'persistent', 'characters', 'and', 'maximum', 'parsimony', 'where', 'we', 'characterize', 'persistent', 'characters', 'in', 'terms', 'of', 'the', 'first', 'phase', 'of', 'the', 'famous', 'fitch', 'algorithm', 'afterwards', 'we', 'focus', 'on', 'the', 'number', 'of', 'persistent', 'characters', 'for', 'a', 'given', 'phylogenetic', 'tree', 'we', 'show', 'that', 'this', 'number', 'solely', 'depends', 'on', 'the', 'balance', 'of', 'the', 'tree', 'to', 'be', 'precise', 'we', 'develop', 'a', 'formula', 'for', 'counting', 'the', 'number', 'of', 'persistent', 'characters', 'for', 'a', 'given', 'phylogenetic', 'tree', 'based', 'on', 'an', 'index', 'of', 'tree', 'balance', 'namely', 'the', 'sackin', 'index', 'lastly', 'we', 'consider', 'the', 'question', 'of', 'how', 'many', 'carefully', 'chosen', 'binary', 'characters', 'together', 'with', 'their', 'persistence', 'status', 'are', 'needed', 'to', 'uniquely', 'determine', 'a', 'phylogenetic', 'tree', 'and', 'provide', 'an', 'upper', 'bound', 'for', 'the', 'number', 'of', 'characters', 'needed']] | [-0.13263478191712727, 0.1407494071763582, -0.04150284898634522, 0.10049724732883848, -0.09114075660084685, -0.11812162861848871, 0.09860797686000856, 0.3517684886327539, -0.30192180395675583, -0.3044112052004307, 0.10878123990439165, -0.25158127344762665, -0.18175864226590746, 0.167817820293399, -0.07523535765791073, 0.016068928384293732, 0.06830654187151827, 0.1280730116194508, -0.012039706304364163, -0.25369978403935256, 0.34734754275339536, 0.03828213750026547, 0.2501412431948269, 0.009908854155144534, 0.09744540790143685, 0.04574167439714074, -0.027251912796726594, 0.006988847164962536, -0.1637668798060473, 0.1140735815386646, 0.25715624133038384, 0.16834325695959612, 0.19217493945302871, -0.39702016704548626, -0.1483958635598612, 0.16489178815032712, 0.12328380452922713, 0.10733702648072861, 0.006279453048363137, -0.2166660973157447, 0.16190024189865934, -0.17248407006263733, -0.05135228927844228, -0.034158287920917456, 0.05002156571747783, 0.008880677324934647, -0.18882833063029325, 0.025468309209323848, 0.06400880650796283, 0.08608565468397827, -0.013814229866824089, -0.17287797156530313, -0.017631629634744083, 0.15924602963197498, 0.020436995116492305, 0.019161982282709617, 0.024184065027974357, -0.15626515309186056, -0.1616866065439983, 0.3451746658254892, -0.05179529451348711, -0.20343040084848418, 0.18200625182511523, -0.1331877319381023, -0.22144881829094046, 0.10022967883552879, 0.14073855463797466, 0.15509891039572465, -0.12583562501897225, 0.06742394725965241, -0.050862727371545936, 0.16573145197083552, 0.11400884117405766, -0.017855432811073768, 0.2129298667399547, 0.17801857587570946, 0.043893564900514694, 0.1754190610948568, -0.077248610323295, -0.05191779404830856, -0.23219757258223417, -0.1458633929529848, -0.19082752221908708, 0.037353493163409905, -0.10756342070727931, -0.1999284733707706, 0.4056843507843904, 0.12659526432697207, 0.22052428839871516, 0.12003489542895784, 0.22315017531793088, 0.10861972775728179, 0.006914427660357876, 0.06142828923244125, 0.1533731061845827, 0.13903920079032198, -0.006045804306482657, -0.1814189351330965, 0.14376251161432801, 0.11240908965014686] |
1,802.02521 | Infinite series in cohomology: attractors and Conley index | In this paper we study the cohomological Conley index of arbitrary isolated
invariant continua for continuous maps $f \colon U \subseteq \mathbb{R}^d \to
\mathbb{R}^d$ by analyzing the topological structure of their unstable
manifold. We provide a simple dynamical interpretation for the first
cohomological Conley index, describing it completely, and relate it to the
cohomological Conley index in higher degrees. A number of consequences are
derived, including new computations of the fixed point indices of isolated
invariant continua in dimensions 2 and 3.
Our approach exploits certain attractor-repeller decomposition of the
unstable manifold, reducing the study of the cohomological Conley index to the
relation between the cohomology of an attractor and its basin of attraction.
This is a classical problem that, in the present case, is particularly
difficult because the dynamics is discrete and the topology of the unstable
manifold can be very complicated. To address it we develop a new method that
may be of independent interest and involves the summation of power series in
cohomology: if $Z$ is a metric space and $K \subseteq Z$ is a compact, global
attractor for a continuous map $g \colon Z \to Z$, we show how to interpret
series of the form $\sum_{j \ge 0} a_j (g^*)^j$ as endomorphisms of the
cohomology group of the pair $(Z,K)$.
| math.DS math.AT math.GT | in this paper we study the cohomological conley index of arbitrary isolated invariant continua for continuous maps f colon u subseteq mathbbrd to mathbbrd by analyzing the topological structure of their unstable manifold we provide a simple dynamical interpretation for the first cohomological conley index describing it completely and relate it to the cohomological conley index in higher degrees a number of consequences are derived including new computations of the fixed point indices of isolated invariant continua in dimensions 2 and 3 our approach exploits certain attractorrepeller decomposition of the unstable manifold reducing the study of the cohomological conley index to the relation between the cohomology of an attractor and its basin of attraction this is a classical problem that in the present case is particularly difficult because the dynamics is discrete and the topology of the unstable manifold can be very complicated to address it we develop a new method that may be of independent interest and involves the summation of power series in cohomology if z is a metric space and k subseteq z is a compact global attractor for a continuous map g colon z to z we show how to interpret series of the form sum_j ge 0 a_j gj as endomorphisms of the cohomology group of the pair zk | [['in', 'this', 'paper', 'we', 'study', 'the', 'cohomological', 'conley', 'index', 'of', 'arbitrary', 'isolated', 'invariant', 'continua', 'for', 'continuous', 'maps', 'f', 'colon', 'u', 'subseteq', 'mathbbrd', 'to', 'mathbbrd', 'by', 'analyzing', 'the', 'topological', 'structure', 'of', 'their', 'unstable', 'manifold', 'we', 'provide', 'a', 'simple', 'dynamical', 'interpretation', 'for', 'the', 'first', 'cohomological', 'conley', 'index', 'describing', 'it', 'completely', 'and', 'relate', 'it', 'to', 'the', 'cohomological', 'conley', 'index', 'in', 'higher', 'degrees', 'a', 'number', 'of', 'consequences', 'are', 'derived', 'including', 'new', 'computations', 'of', 'the', 'fixed', 'point', 'indices', 'of', 'isolated', 'invariant', 'continua', 'in', 'dimensions', '2', 'and', '3', 'our', 'approach', 'exploits', 'certain', 'attractorrepeller', 'decomposition', 'of', 'the', 'unstable', 'manifold', 'reducing', 'the', 'study', 'of', 'the', 'cohomological', 'conley', 'index', 'to', 'the', 'relation', 'between', 'the', 'cohomology', 'of', 'an', 'attractor', 'and', 'its', 'basin', 'of', 'attraction', 'this', 'is', 'a', 'classical', 'problem', 'that', 'in', 'the', 'present', 'case', 'is', 'particularly', 'difficult', 'because', 'the', 'dynamics', 'is', 'discrete', 'and', 'the', 'topology', 'of', 'the', 'unstable', 'manifold', 'can', 'be', 'very', 'complicated', 'to', 'address', 'it', 'we', 'develop', 'a', 'new', 'method', 'that', 'may', 'be', 'of', 'independent', 'interest', 'and', 'involves', 'the', 'summation', 'of', 'power', 'series', 'in', 'cohomology', 'if', 'z', 'is', 'a', 'metric', 'space', 'and', 'k', 'subseteq', 'z', 'is', 'a', 'compact', 'global', 'attractor', 'for', 'a', 'continuous', 'map', 'g', 'colon', 'z', 'to', 'z', 'we', 'show', 'how', 'to', 'interpret', 'series', 'of', 'the', 'form', 'sum_j', 'ge', '0', 'a_j', 'gj', 'as', 'endomorphisms', 'of', 'the', 'cohomology', 'group', 'of', 'the', 'pair', 'zk']] | [-0.18250876199889265, 0.08796056751418853, -0.1254632361450833, 0.0798872550661136, -0.06926239763873969, -0.12831605912379868, 0.015780445903639754, 0.328273548043951, -0.3109965429023326, -0.23048984916079965, 0.08874351603292346, -0.2505576851642821, -0.17051721512226858, 0.16521623462768245, -0.10035016214057246, 0.0280755203732433, 0.008399965087056298, 0.042429263978923465, -0.03842025325322419, -0.21434202473871758, 0.40858429309119965, -0.035323058036330075, 0.202760204404079, 0.020835834450336505, 0.08682062829818542, -0.00545578951094404, -0.04010084563666067, -0.004618064581039014, -0.15437987478697188, 0.12485211326198861, 0.2545142767191473, 0.10621186097069707, 0.22950564478154112, -0.33261231215949233, -0.17595922995672048, 0.18328597551760065, 0.1401979544952895, 0.008501239185151862, -0.00632305703303781, -0.26685176079844725, 0.15082025448312966, -0.15037394697216522, -0.16833525641264271, -0.09975920073909982, 0.12228181204001341, -0.012869291634203117, -0.2752465479041637, 0.03888199012427347, 0.08047084852377993, 0.09048209005951006, -0.05959071348275485, -0.05692120352063641, -0.09866082635882233, 0.13035783763739897, 0.013791606788136986, 0.0692817471925796, 0.09501744112626553, -0.08921796140461186, -0.09182216246203284, 0.3783454407250213, -0.06665883539625331, -0.2242222323004052, 0.17772013398004852, -0.1683432360584456, -0.1938747863011069, 0.14192667409177068, 0.13113886188056373, 0.15948837356441697, -0.059939729820373336, 0.17978968570568102, -0.06798943757105654, 0.12521359919438196, 0.055141444285356694, 0.008268103666090033, 0.15184859186084507, 0.11242099882105679, 0.10649110895590247, 0.13666284237618376, -0.02991093300521226, -0.022295622825274402, -0.3242985439991631, -0.1981002319632446, -0.15803565917466986, 0.14510156685991266, -0.12536654116275228, -0.17323341081789304, 0.39746412293872335, 0.0857046119410166, 0.22518182969347478, 0.07400648255188401, 0.23112997450978956, 0.11525835815455904, -0.011698215439367308, 0.06298259827830593, 0.14749501703881493, 0.16899392881896347, 0.02491892411843569, -0.17380231624375594, -0.03249721705617609, 0.15811832775971113] |
1,802.02522 | Joint Attention in Driver-Pedestrian Interaction: from Theory to
Practice | Today, one of the major challenges that autonomous vehicles are facing is the
ability to drive in urban environments. Such a task requires communication
between autonomous vehicles and other road users in order to resolve various
traffic ambiguities. The interaction between road users is a form of
negotiation in which the parties involved have to share their attention
regarding a common objective or a goal (e.g. crossing an intersection), and
coordinate their actions in order to accomplish it. In this literature review
we aim to address the interaction problem between pedestrians and drivers (or
vehicles) from joint attention point of view. More specifically, we will
discuss the theoretical background behind joint attention, its application to
traffic interaction and practical approaches to implementing joint attention
for autonomous vehicles.
| cs.RO cs.CV | today one of the major challenges that autonomous vehicles are facing is the ability to drive in urban environments such a task requires communication between autonomous vehicles and other road users in order to resolve various traffic ambiguities the interaction between road users is a form of negotiation in which the parties involved have to share their attention regarding a common objective or a goal eg crossing an intersection and coordinate their actions in order to accomplish it in this literature review we aim to address the interaction problem between pedestrians and drivers or vehicles from joint attention point of view more specifically we will discuss the theoretical background behind joint attention its application to traffic interaction and practical approaches to implementing joint attention for autonomous vehicles | [['today', 'one', 'of', 'the', 'major', 'challenges', 'that', 'autonomous', 'vehicles', 'are', 'facing', 'is', 'the', 'ability', 'to', 'drive', 'in', 'urban', 'environments', 'such', 'a', 'task', 'requires', 'communication', 'between', 'autonomous', 'vehicles', 'and', 'other', 'road', 'users', 'in', 'order', 'to', 'resolve', 'various', 'traffic', 'ambiguities', 'the', 'interaction', 'between', 'road', 'users', 'is', 'a', 'form', 'of', 'negotiation', 'in', 'which', 'the', 'parties', 'involved', 'have', 'to', 'share', 'their', 'attention', 'regarding', 'a', 'common', 'objective', 'or', 'a', 'goal', 'eg', 'crossing', 'an', 'intersection', 'and', 'coordinate', 'their', 'actions', 'in', 'order', 'to', 'accomplish', 'it', 'in', 'this', 'literature', 'review', 'we', 'aim', 'to', 'address', 'the', 'interaction', 'problem', 'between', 'pedestrians', 'and', 'drivers', 'or', 'vehicles', 'from', 'joint', 'attention', 'point', 'of', 'view', 'more', 'specifically', 'we', 'will', 'discuss', 'the', 'theoretical', 'background', 'behind', 'joint', 'attention', 'its', 'application', 'to', 'traffic', 'interaction', 'and', 'practical', 'approaches', 'to', 'implementing', 'joint', 'attention', 'for', 'autonomous', 'vehicles']] | [-0.1767820802720733, 0.028863283502250564, -0.044823272124402166, 0.06227317144159286, -0.16005068731413583, -0.15812147975217286, 0.09244661008128822, 0.45068685320301316, -0.2492387531266555, -0.33862133824273827, 0.07418567144154299, -0.30211375231348625, -0.1682905722006158, 0.15109566026770577, -0.18931686784705426, 0.07287483419590506, 0.05527309147736395, 0.062084507230141264, -0.0004563229580182494, -0.2258829214485494, 0.3250204597812469, -0.00043399086383384043, 0.30612883105412064, 0.05811218956602723, 0.08335208341636967, 0.012965642718788912, -0.05050435400105954, -0.031005898981875793, -0.06280040044336824, 0.1732652314093448, 0.37169421177612266, 0.16348628411582838, 0.3575498194793078, -0.4870142743695439, -0.20487888656761938, 0.13050219133188287, 0.12852195707481176, 0.08249838615485328, -0.018061817006421583, -0.3256633618963868, 0.05264408954265198, -0.22398270540467397, -0.11724790791416262, -0.02139987071836734, 0.03186989338623037, 0.03599129032754288, -0.23795949972755326, -0.06466441784112707, 0.027434946782153656, 0.06033363932465005, -0.009609492928317682, -0.01723156452882947, 0.03887578901031795, 0.28091009605426603, 0.13100924233605307, 0.012994686889601505, 0.1419621381237663, -0.20954123112248388, -0.11915097422586153, 0.4581536858225256, 0.0697329999259343, -0.18981270852872706, 0.23246274430554095, -0.04690496395085388, -0.16357042245185516, 0.07033698747711857, 0.26062297918027133, 0.04798077761679594, -0.18863653171029288, -0.005631183495921061, 0.03246681517958054, 0.10057266892825883, 0.061560219546090665, 0.0033847086432235917, 0.23235610520144498, 0.2036311989430133, 0.17151935361362408, 0.054576004998791436, -0.05610527062245945, -0.15560131094704463, -0.2097776929048572, -0.1328186430843679, -0.14277221391520162, 0.009460017873399605, -0.015099502098471601, -0.056456891093843095, 0.378489342442985, 0.248347529144151, 0.17669315304695152, 0.031500809638042325, 0.3827599118955023, 0.023544909469196646, 0.04225289221031694, 0.08597349120243489, 0.18262981250148824, 0.02924927451288489, 0.1742915395375957, -0.20069465872567646, 0.09525859737438773, 0.018405842814799837] |
1,802.02523 | Plasma Brain Dynamics (PBD): A Mechanism for EEG Waves Under Human
Consciousness | EEG signals are records of nonlinear solitary waves in human brains. The
waves have several types (e.g., a, b, g, q, d) in response to different levels
of consciousness. They are classified into two groups: Group-1 consists of
complex storm-like waves (a, b, and g); Group-2 is composed of simple
quasilinear waves (q and d). In order to elucidate the mechanism of EEG wave
formation and propagation, this paper extends the Vlasov-Maxwell equations of
Plasma Brain Dynamics (PBD) to a set of two-fluid, self-similar, nonlinear
solitary wave equations. Numerical simulations are performed for different EEG
signals. Main results include: (1) The excitation and propagation of the EEG
wave packets are dependent of electric and magnetic fields, brain aqua-ions,
electron and ion temperatures, masses, and their initial fluid speeds; (2)
Group-1 complex waves contain three ingredients: the high-frequency
ion-acoustic (IA) mode, the intermediate-frequency lower-hybrid (LH) mode, and
the low-frequency ion-cyclotron (IC) mode; (3) Group-2 simple waves fall within
the IA band, featured by one or a combination of the three envelopes:
sinusoidal, sawtooth, and spiky/bipolar. The study proposes an alternative
model to Quantum Brain Dynamics (QBD) by suggesting that the formation and
propagation of the nonlinear solitary EEG waves in the brain have the same
mechanism as that of the waves in space plasmas
| q-bio.NC physics.med-ph | eeg signals are records of nonlinear solitary waves in human brains the waves have several types eg a b g q d in response to different levels of consciousness they are classified into two groups group1 consists of complex stormlike waves a b and g group2 is composed of simple quasilinear waves q and d in order to elucidate the mechanism of eeg wave formation and propagation this paper extends the vlasovmaxwell equations of plasma brain dynamics pbd to a set of twofluid selfsimilar nonlinear solitary wave equations numerical simulations are performed for different eeg signals main results include 1 the excitation and propagation of the eeg wave packets are dependent of electric and magnetic fields brain aquaions electron and ion temperatures masses and their initial fluid speeds 2 group1 complex waves contain three ingredients the highfrequency ionacoustic ia mode the intermediatefrequency lowerhybrid lh mode and the lowfrequency ioncyclotron ic mode 3 group2 simple waves fall within the ia band featured by one or a combination of the three envelopes sinusoidal sawtooth and spikybipolar the study proposes an alternative model to quantum brain dynamics qbd by suggesting that the formation and propagation of the nonlinear solitary eeg waves in the brain have the same mechanism as that of the waves in space plasmas | [['eeg', 'signals', 'are', 'records', 'of', 'nonlinear', 'solitary', 'waves', 'in', 'human', 'brains', 'the', 'waves', 'have', 'several', 'types', 'eg', 'a', 'b', 'g', 'q', 'd', 'in', 'response', 'to', 'different', 'levels', 'of', 'consciousness', 'they', 'are', 'classified', 'into', 'two', 'groups', 'group1', 'consists', 'of', 'complex', 'stormlike', 'waves', 'a', 'b', 'and', 'g', 'group2', 'is', 'composed', 'of', 'simple', 'quasilinear', 'waves', 'q', 'and', 'd', 'in', 'order', 'to', 'elucidate', 'the', 'mechanism', 'of', 'eeg', 'wave', 'formation', 'and', 'propagation', 'this', 'paper', 'extends', 'the', 'vlasovmaxwell', 'equations', 'of', 'plasma', 'brain', 'dynamics', 'pbd', 'to', 'a', 'set', 'of', 'twofluid', 'selfsimilar', 'nonlinear', 'solitary', 'wave', 'equations', 'numerical', 'simulations', 'are', 'performed', 'for', 'different', 'eeg', 'signals', 'main', 'results', 'include', '1', 'the', 'excitation', 'and', 'propagation', 'of', 'the', 'eeg', 'wave', 'packets', 'are', 'dependent', 'of', 'electric', 'and', 'magnetic', 'fields', 'brain', 'aquaions', 'electron', 'and', 'ion', 'temperatures', 'masses', 'and', 'their', 'initial', 'fluid', 'speeds', '2', 'group1', 'complex', 'waves', 'contain', 'three', 'ingredients', 'the', 'highfrequency', 'ionacoustic', 'ia', 'mode', 'the', 'intermediatefrequency', 'lowerhybrid', 'lh', 'mode', 'and', 'the', 'lowfrequency', 'ioncyclotron', 'ic', 'mode', '3', 'group2', 'simple', 'waves', 'fall', 'within', 'the', 'ia', 'band', 'featured', 'by', 'one', 'or', 'a', 'combination', 'of', 'the', 'three', 'envelopes', 'sinusoidal', 'sawtooth', 'and', 'spikybipolar', 'the', 'study', 'proposes', 'an', 'alternative', 'model', 'to', 'quantum', 'brain', 'dynamics', 'qbd', 'by', 'suggesting', 'that', 'the', 'formation', 'and', 'propagation', 'of', 'the', 'nonlinear', 'solitary', 'eeg', 'waves', 'in', 'the', 'brain', 'have', 'the', 'same', 'mechanism', 'as', 'that', 'of', 'the', 'waves', 'in', 'space', 'plasmas']] | [-0.19248097362377464, 0.18765266499018918, -0.03645019433174229, 0.06769826576683087, -0.09071471364241782, -0.11992195057373724, -0.052581043618784164, 0.33926331433710327, -0.23345991367059296, -0.22887232476377514, 0.05124435429538543, -0.2764504182801286, -0.16609703088113023, 0.19002322682016198, 0.06046690372363951, 0.03582336328994324, 0.04575412714593466, -0.0035584878887632483, 0.024729409250121792, -0.14656502877139174, 0.295773215266386, 0.004570118477678377, 0.2751811116236434, -0.038753957185293966, 0.08900233669045395, -0.039909734233984306, -0.005059938101534912, -0.03724811410862992, -0.09817445524626134, 0.04476621510213797, 0.28464755910267764, 0.10999730435614938, 0.2649987158122786, -0.5173458445693644, -0.2966932733715633, 0.01777862121780862, 0.15017888265995968, 0.10626480275085329, -0.012424458472485217, -0.3138048361271832, 0.05625599892412741, -0.12249967291448001, -0.11703855232490112, 0.010768123438926105, 0.06213352135360523, 0.07469982270623658, -0.2609487841373654, 0.14293211649096974, 0.06560793986722774, 0.050737551373751806, -0.10873413932514134, -0.08335329393604637, -0.05673861888819926, 0.05538173112714822, 0.05630409948349052, 0.01858626923885779, 0.11385988148141175, -0.12222719226601882, -0.11358615501203918, 0.37338364932915613, -0.03159613652051078, -0.17037515494292735, 0.2338591650022432, -0.173682409264859, -0.05843149501691303, 0.18820590455133593, 0.21834566832273997, 0.06640466551464139, -0.12440620026423185, 0.0028118126042478526, 0.009897087173416695, 0.13687732662562896, 0.14159539094419876, 0.018901964901147577, 0.20952717588234568, 0.17040885287178106, -0.04194422381139974, 0.07981225590656624, -0.10990039618262112, 0.013484802497639121, -0.2743855707686156, -0.09442531876707387, -0.11511044962217444, 0.027889217117150818, -0.06830611583262007, -0.1756138374964967, 0.48432541744765867, 0.0855477854887562, 0.11402169807777647, 0.012147050836428083, 0.2580544608909972, 0.10993948730402041, 0.005433719636656132, 0.10086109425863736, 0.23826529297721682, 0.18805736362695766, 0.11974262528262715, -0.24483098625757188, -0.0038389607566580953, 0.02896656610195247] |
1,802.02524 | Subleading Regge limit from a soft anomalous dimension | Wilson lines capture important features of scattering amplitudes, for example
soft effects relevant for infrared divergences, and the Regge limit. Beyond the
leading power approximation, corrections to the eikonal picture have to be
taken into account. In this paper, we study such corrections in a model of
massive scattering amplitudes in N = 4 super Yang-Mills, in the planar limit,
where the mass is generated through a Higgs mechanism. Using known three-loop
analytic expressions for the scattering amplitude, we find that the first power
suppressed term has a very simple form, equal to a single power law. We propose
that its exponent is governed by the anomalous dimension of a Wilson loop with
a scalar inserted at the cusp, and we provide perturbative evidence for this
proposal. We also analyze other limits of the amplitude and conjecture an exact
formula for a total cross-section at high energies.
| hep-th hep-ph | wilson lines capture important features of scattering amplitudes for example soft effects relevant for infrared divergences and the regge limit beyond the leading power approximation corrections to the eikonal picture have to be taken into account in this paper we study such corrections in a model of massive scattering amplitudes in n 4 super yangmills in the planar limit where the mass is generated through a higgs mechanism using known threeloop analytic expressions for the scattering amplitude we find that the first power suppressed term has a very simple form equal to a single power law we propose that its exponent is governed by the anomalous dimension of a wilson loop with a scalar inserted at the cusp and we provide perturbative evidence for this proposal we also analyze other limits of the amplitude and conjecture an exact formula for a total crosssection at high energies | [['wilson', 'lines', 'capture', 'important', 'features', 'of', 'scattering', 'amplitudes', 'for', 'example', 'soft', 'effects', 'relevant', 'for', 'infrared', 'divergences', 'and', 'the', 'regge', 'limit', 'beyond', 'the', 'leading', 'power', 'approximation', 'corrections', 'to', 'the', 'eikonal', 'picture', 'have', 'to', 'be', 'taken', 'into', 'account', 'in', 'this', 'paper', 'we', 'study', 'such', 'corrections', 'in', 'a', 'model', 'of', 'massive', 'scattering', 'amplitudes', 'in', 'n', '4', 'super', 'yangmills', 'in', 'the', 'planar', 'limit', 'where', 'the', 'mass', 'is', 'generated', 'through', 'a', 'higgs', 'mechanism', 'using', 'known', 'threeloop', 'analytic', 'expressions', 'for', 'the', 'scattering', 'amplitude', 'we', 'find', 'that', 'the', 'first', 'power', 'suppressed', 'term', 'has', 'a', 'very', 'simple', 'form', 'equal', 'to', 'a', 'single', 'power', 'law', 'we', 'propose', 'that', 'its', 'exponent', 'is', 'governed', 'by', 'the', 'anomalous', 'dimension', 'of', 'a', 'wilson', 'loop', 'with', 'a', 'scalar', 'inserted', 'at', 'the', 'cusp', 'and', 'we', 'provide', 'perturbative', 'evidence', 'for', 'this', 'proposal', 'we', 'also', 'analyze', 'other', 'limits', 'of', 'the', 'amplitude', 'and', 'conjecture', 'an', 'exact', 'formula', 'for', 'a', 'total', 'crosssection', 'at', 'high', 'energies']] | [-0.12160416712907895, 0.15275178286846972, -0.11305869185072306, 0.13031605188415885, -0.033335006107298705, -0.13027071525432068, 0.051927867148562706, 0.3164437597438897, -0.18013377745367892, -0.25858371577876277, 0.048745960389480814, -0.3064599593651596, -0.16045066768667113, 0.17443960218025334, 0.024369221981232092, 0.04899958522204144, 0.01218351202838327, 0.05758215703747127, -0.048744589686776474, -0.19247797856821794, 0.3242765953541057, 0.0424536527525187, 0.2301506909919737, 0.12606639410799675, 0.08543722546493558, 0.0332917097927237, -0.029459963061476815, 0.009106093315943463, -0.12291263191442864, 0.09885985662200654, 0.2060754729533721, 0.020899313101736344, 0.15678211225576266, -0.4143385432966768, -0.18330255170729112, 0.08250473641506588, 0.19769611731426764, 0.11598098455060733, -0.019785722647474645, -0.20196712445403922, 0.06213778205700729, -0.19741122548991483, -0.2014736318801313, -0.08282722141402327, 0.045349833386478154, -0.09796139517677821, -0.31990063046934464, 0.07576817974000882, 0.03161907787689914, -0.002394906315340163, -0.030555184838865972, -0.087970460745927, 0.008780990532688694, 0.11279930007462198, 0.08090936673098652, 0.020081529943974153, 0.08644396663573252, -0.19593671867496346, -0.1169890101611525, 0.37282302914416954, -0.09961010287324451, -0.16564175174635362, 0.09434669549985189, -0.19792968600235675, -0.1601320609947896, 0.17138953205093993, 0.1811956515223145, 0.11870647597028786, -0.1509248840029364, 0.15233392002298624, -0.00453722314296724, 0.1320193960309054, 0.10857760404836234, 0.04726139871142039, 0.2181240366963185, 0.13353956474807777, -0.021198625674739173, 0.1505796957891817, -0.09649590188509798, -0.08105661151037641, -0.3730252020839245, -0.0971501581633961, -0.10644247039374322, 0.07103063195644023, -0.12443352829992264, -0.1623748495077638, 0.3326314438105727, 0.12180811582669003, 0.22528784221982304, 0.09601410961237876, 0.32462004112870724, 0.22325881013059862, 0.10637414164216041, 0.07984918022005219, 0.26697236740936153, 0.13682317291226953, 0.08545199974618647, -0.24392369827128027, -0.023887299387141653, 0.11499142619679133] |
1,802.02525 | Spin-charge separation and many-body localization | We study many-body localization for a disordered chain of spin 1/2 fermions.
In [Phys. Rev. B \textbf{94}, 241104 (2016)], when both down and up components
are exposed to the same strong disorder, the authors observe a power law growth
of the entanglement entropy that suggests that many-body localization is not
complete; the density (charge) degree of freedom is localized, while the spin
degree of freedom is apparently delocalized. We show that this power-like
behavior is only a transient effect and that, for longer times, the growth is
logarithmic in time suggesting that the spin degree of freedom is also
localized, so that the system follows the standard many-body localization
scenario. We also study the experimentally relevant case of quasiperiodic
disorder.
| cond-mat.dis-nn | we study manybody localization for a disordered chain of spin 12 fermions in phys rev b textbf94 241104 2016 when both down and up components are exposed to the same strong disorder the authors observe a power law growth of the entanglement entropy that suggests that manybody localization is not complete the density charge degree of freedom is localized while the spin degree of freedom is apparently delocalized we show that this powerlike behavior is only a transient effect and that for longer times the growth is logarithmic in time suggesting that the spin degree of freedom is also localized so that the system follows the standard manybody localization scenario we also study the experimentally relevant case of quasiperiodic disorder | [['we', 'study', 'manybody', 'localization', 'for', 'a', 'disordered', 'chain', 'of', 'spin', '12', 'fermions', 'in', 'phys', 'rev', 'b', 'textbf94', '241104', '2016', 'when', 'both', 'down', 'and', 'up', 'components', 'are', 'exposed', 'to', 'the', 'same', 'strong', 'disorder', 'the', 'authors', 'observe', 'a', 'power', 'law', 'growth', 'of', 'the', 'entanglement', 'entropy', 'that', 'suggests', 'that', 'manybody', 'localization', 'is', 'not', 'complete', 'the', 'density', 'charge', 'degree', 'of', 'freedom', 'is', 'localized', 'while', 'the', 'spin', 'degree', 'of', 'freedom', 'is', 'apparently', 'delocalized', 'we', 'show', 'that', 'this', 'powerlike', 'behavior', 'is', 'only', 'a', 'transient', 'effect', 'and', 'that', 'for', 'longer', 'times', 'the', 'growth', 'is', 'logarithmic', 'in', 'time', 'suggesting', 'that', 'the', 'spin', 'degree', 'of', 'freedom', 'is', 'also', 'localized', 'so', 'that', 'the', 'system', 'follows', 'the', 'standard', 'manybody', 'localization', 'scenario', 'we', 'also', 'study', 'the', 'experimentally', 'relevant', 'case', 'of', 'quasiperiodic', 'disorder']] | [-0.17989358981335615, 0.23169448479673505, -0.06835850606821164, 0.025775910849182106, 0.005700632820234579, -0.14816380222914977, 0.018735015852143988, 0.3319951980961722, -0.21643587802888967, -0.2232118496894367, 0.028940290105020423, -0.3127800482912224, -0.17639619595285097, 0.1431389915494702, -0.014553372881242208, 0.007166790807259684, 0.013707431491088717, 0.0321263484402458, -0.053048589255097284, -0.25615321189564255, 0.2559582769182049, 0.03990798907651871, 0.28623681121012745, 0.11912583870061931, 0.04542581795346962, 0.03714147238099963, 0.07789168836736754, 0.02378335379909317, -0.13144918219487187, 0.044223231572595216, 0.19355315829337644, 0.020634332820460077, 0.23555180947335452, -0.3844102718671705, -0.2390088114824866, 0.0806013445033371, 0.1344213332323467, 0.18174687066573275, -0.011558019262621132, -0.27289709770277204, 0.0750195909851082, -0.19077404246001775, -0.20284279405350694, -0.09503493738603316, 0.08980902286731646, -0.012951853710027146, -0.2660662418959208, 0.18625090943850936, 0.12490649446218956, 0.06987812213537072, -0.001277800980063171, -0.011028959661401307, -0.05405393446709554, 0.07667428869758967, 0.0626248525927125, 0.039880888250914695, 0.11877817672700818, -0.1317398849113633, -0.12278954357304023, 0.32591913419799146, -0.033522419845724495, -0.1441142119803787, 0.230615242331547, -0.20782045197493138, -0.1356064966222381, 0.14621322154959648, 0.12942610922887796, 0.12048547778469598, -0.14729831204321647, 0.10899484711562228, -0.04149984517584735, 0.23199376232233368, 0.03677496689316981, 0.10844194319318323, 0.19337941775051484, 0.13781559043720426, 0.08837745743435602, 0.1428845572645361, -0.08122838821903873, -0.12786542712280355, -0.28200179052797436, -0.1736308005521027, -0.2554196761725392, 0.11823040763703234, -0.060175838633469786, -0.13287118839553924, 0.4641008619649508, 0.15351302305236245, 0.17945906836069933, 0.03846773692649327, 0.19802526298503415, 0.13199723446585176, 0.0388591211204057, 0.09151281234847397, 0.24678101629496185, 0.10145211899887864, 0.06433179458219777, -0.28239919533640023, 0.03302648680542885, 0.030951025903600604] |
1,802.02526 | Detecting false correlations: Uncovering a faked Bell-inequality
violation | It is possible for two parties, Alice and Bob, to establish a secure
communication link by sharing an ensemble of entangled particles, and then
using these particles to generate a secret key. One way to establish that the
particles are indeed entangled is to verify that they violate a Bell
inequality. However, it might be the case that Bob is not trustworthy and
wishes Alice to believe that their communications are secure, when in fact they
are not. He can do this by managing to have prior knowledge of Alice's
measurement device settings and then modifying his own settings based upon this
information. In this case it is possible for shared particle states that must
satisfy a Bell inequality to appear to violate this inequality, which would
also make the system appear secure. When Bob modifies his measurement settings,
however, he produces false correlations. Here we demonstrate experimentally
that Alice can detect these false correlations, and uncover Bob's trickery, by
using loop-state-preparation-and-measurement (SPAM) tomography. More generally,
we demonstrate that loop SPAM tomography can detect false correlations
(correlated errors) in a two-qubit system without needing to know anything
about the prepared states or the measurements, other than the dimensions of the
operators that describe them.
| quant-ph | it is possible for two parties alice and bob to establish a secure communication link by sharing an ensemble of entangled particles and then using these particles to generate a secret key one way to establish that the particles are indeed entangled is to verify that they violate a bell inequality however it might be the case that bob is not trustworthy and wishes alice to believe that their communications are secure when in fact they are not he can do this by managing to have prior knowledge of alices measurement device settings and then modifying his own settings based upon this information in this case it is possible for shared particle states that must satisfy a bell inequality to appear to violate this inequality which would also make the system appear secure when bob modifies his measurement settings however he produces false correlations here we demonstrate experimentally that alice can detect these false correlations and uncover bobs trickery by using loopstatepreparationandmeasurement spam tomography more generally we demonstrate that loop spam tomography can detect false correlations correlated errors in a twoqubit system without needing to know anything about the prepared states or the measurements other than the dimensions of the operators that describe them | [['it', 'is', 'possible', 'for', 'two', 'parties', 'alice', 'and', 'bob', 'to', 'establish', 'a', 'secure', 'communication', 'link', 'by', 'sharing', 'an', 'ensemble', 'of', 'entangled', 'particles', 'and', 'then', 'using', 'these', 'particles', 'to', 'generate', 'a', 'secret', 'key', 'one', 'way', 'to', 'establish', 'that', 'the', 'particles', 'are', 'indeed', 'entangled', 'is', 'to', 'verify', 'that', 'they', 'violate', 'a', 'bell', 'inequality', 'however', 'it', 'might', 'be', 'the', 'case', 'that', 'bob', 'is', 'not', 'trustworthy', 'and', 'wishes', 'alice', 'to', 'believe', 'that', 'their', 'communications', 'are', 'secure', 'when', 'in', 'fact', 'they', 'are', 'not', 'he', 'can', 'do', 'this', 'by', 'managing', 'to', 'have', 'prior', 'knowledge', 'of', 'alices', 'measurement', 'device', 'settings', 'and', 'then', 'modifying', 'his', 'own', 'settings', 'based', 'upon', 'this', 'information', 'in', 'this', 'case', 'it', 'is', 'possible', 'for', 'shared', 'particle', 'states', 'that', 'must', 'satisfy', 'a', 'bell', 'inequality', 'to', 'appear', 'to', 'violate', 'this', 'inequality', 'which', 'would', 'also', 'make', 'the', 'system', 'appear', 'secure', 'when', 'bob', 'modifies', 'his', 'measurement', 'settings', 'however', 'he', 'produces', 'false', 'correlations', 'here', 'we', 'demonstrate', 'experimentally', 'that', 'alice', 'can', 'detect', 'these', 'false', 'correlations', 'and', 'uncover', 'bobs', 'trickery', 'by', 'using', 'loopstatepreparationandmeasurement', 'spam', 'tomography', 'more', 'generally', 'we', 'demonstrate', 'that', 'loop', 'spam', 'tomography', 'can', 'detect', 'false', 'correlations', 'correlated', 'errors', 'in', 'a', 'twoqubit', 'system', 'without', 'needing', 'to', 'know', 'anything', 'about', 'the', 'prepared', 'states', 'or', 'the', 'measurements', 'other', 'than', 'the', 'dimensions', 'of', 'the', 'operators', 'that', 'describe', 'them']] | [-0.11251684351625801, 0.15439668659121084, -0.12781982678745693, 0.1070458495133818, -0.06019895108591013, -0.32167107199681144, 0.0804651418570062, 0.3818524058706361, -0.2558802253095143, -0.32408241863394605, 0.08134801244636163, -0.321044919514579, -0.09223467586195014, 0.1703149274386135, -0.14066184261868814, 0.05122177417933702, 0.07441545994390317, 0.04886470956434243, -0.01911452072018785, -0.3262398964691026, 0.3194470154098579, 0.04199553558286371, 0.26417227875065113, 0.03094145179648191, 0.06324286830928084, 0.03613679522758561, -0.003952861584612889, -0.021953988483111406, -0.05682841349270406, 0.09231520648655743, 0.3058640853217413, 0.2005661951533973, 0.2723761682715175, -0.41794280140325796, -0.17858338416118194, 0.16300659053936015, 0.14560556002741157, 0.16940669376079653, -0.024852184268311605, -0.32497109227992704, 0.06986579464592517, -0.17676433792860785, -0.08795932379982485, -0.12769907231217828, -0.01767616182005978, -0.030421219852447896, -0.28549274614337705, 0.058225128846558435, 0.052547182981842404, -0.017918755212668645, 0.04521591474962756, -0.006465037728389128, 0.010772448865779369, 0.18218887290886368, 0.0008837565105279971, -0.010061347302281082, 0.15571129577133455, -0.0991273644627439, -0.16413336085084496, 0.31994043074300504, 0.035589976972207, -0.21979507446986407, 0.16979477735892343, -0.15184095788178187, -0.1305744392749179, 0.05459760895154893, 0.141988536859679, 0.07494790547210815, -0.16321151641503165, -0.026172274052397134, -0.08054490199340095, 0.2500406564878566, 0.09463464589261913, 0.10779546601514291, 0.18082548881676783, -0.00017622697024876848, 0.09283527479050543, 0.09368346855841495, -0.0361729390161362, -0.09008882928403379, -0.2992871735391799, -0.2270575690730085, -0.23829558560753178, 0.08798920570111723, -0.0029894474051804444, -0.053227616202205494, 0.30926092341542244, 0.20412389540430068, 0.13283318352972712, 0.01156194298929567, 0.32317251569862143, 0.031662215042304195, 0.06699184544058746, 0.12310500751281607, 0.3081823800291334, 0.08852684270622659, 0.11299890092587823, -0.14477941403357575, 0.16135794108474324, -0.03605232863535582] |
1,802.02527 | Polariton Hall Effect in Transition-Metal Dichalcogenides | We analyze the properties of strongly coupled excitons and photons in systems
made of semiconducting two-dimensional transition-metal dichalcogenides
embedded in optical cavities. Through a detailed microscopic analysis of the
coupling we unveil novel, highly tunable features of the spectrum, that result
in polariton splitting and a breaking of light-matter selection rules. The
dynamics of the composite polaritons is influenced by the Berry phase arising
both from their constituents and from the confinement-enhanced coupling. We
find that light-matter coupling emerges as a mechanism that enhances the Berry
phase of polaritons well beyond that of its elementary constituents, paving the
way to achieve a polariton Hall effect.
| cond-mat.mes-hall cond-mat.mtrl-sci | we analyze the properties of strongly coupled excitons and photons in systems made of semiconducting twodimensional transitionmetal dichalcogenides embedded in optical cavities through a detailed microscopic analysis of the coupling we unveil novel highly tunable features of the spectrum that result in polariton splitting and a breaking of lightmatter selection rules the dynamics of the composite polaritons is influenced by the berry phase arising both from their constituents and from the confinementenhanced coupling we find that lightmatter coupling emerges as a mechanism that enhances the berry phase of polaritons well beyond that of its elementary constituents paving the way to achieve a polariton hall effect | [['we', 'analyze', 'the', 'properties', 'of', 'strongly', 'coupled', 'excitons', 'and', 'photons', 'in', 'systems', 'made', 'of', 'semiconducting', 'twodimensional', 'transitionmetal', 'dichalcogenides', 'embedded', 'in', 'optical', 'cavities', 'through', 'a', 'detailed', 'microscopic', 'analysis', 'of', 'the', 'coupling', 'we', 'unveil', 'novel', 'highly', 'tunable', 'features', 'of', 'the', 'spectrum', 'that', 'result', 'in', 'polariton', 'splitting', 'and', 'a', 'breaking', 'of', 'lightmatter', 'selection', 'rules', 'the', 'dynamics', 'of', 'the', 'composite', 'polaritons', 'is', 'influenced', 'by', 'the', 'berry', 'phase', 'arising', 'both', 'from', 'their', 'constituents', 'and', 'from', 'the', 'confinementenhanced', 'coupling', 'we', 'find', 'that', 'lightmatter', 'coupling', 'emerges', 'as', 'a', 'mechanism', 'that', 'enhances', 'the', 'berry', 'phase', 'of', 'polaritons', 'well', 'beyond', 'that', 'of', 'its', 'elementary', 'constituents', 'paving', 'the', 'way', 'to', 'achieve', 'a', 'polariton', 'hall', 'effect']] | [-0.1894473784039012, 0.2235388834333907, -0.0880155028649964, 0.010182566346394686, -0.05055821685192104, -0.13347532372259033, 0.09062629142023909, 0.3865153472422837, -0.2692596264935743, -0.27193337940396023, -0.040605735740078114, -0.28987563186540055, -0.22125572249206016, 0.183944153406908, 0.06619017727028292, -0.01126027531762912, -0.012112412102466736, -0.1177783149581116, -0.04490992884474018, -0.1337985946682658, 0.3005268666311167, 0.007587238179089932, 0.3169766464293039, 0.1213729216161972, 0.09159612474524273, 0.0057219768596741445, 0.07865848587467693, -0.03304619900882244, -0.11063116321551766, 0.12728170443397874, 0.22049248253460974, -0.05603565235371487, 0.22306159008866627, -0.43099168718505937, -0.21836316329427063, 0.019961577670003932, 0.19085599094306907, 0.1781188917095558, -0.10270127710492279, -0.32607120576386267, -0.02857441070731371, -0.13849562285675068, -0.12461469888848324, -0.10215566654313499, -0.047106199812752984, -0.0030941830571884145, -0.21341944796642145, 0.042194272176577494, 0.07548082411813084, 0.03675836651830021, -0.04086455302911837, -0.044225863700446025, -0.09806636794550846, 0.10498588741756976, 0.006461552372806741, -0.03202834120468022, 0.1651338478236889, -0.21112314233995186, -0.13315972541805912, 0.43408653609311354, -0.11944976611994207, -0.11729233111075771, 0.1983261450480383, -0.1354098771295797, -0.03728999445985, 0.1636217125879529, 0.18515219748951495, 0.12120179992724353, -0.1149858921014059, 0.07166834974878629, -0.02354777512104752, 0.17574418125933824, -0.006101039256184147, 0.2078917204724768, 0.2839412867413977, 0.21442363729091504, 0.0031975208101077722, 0.17306230420329555, -0.030275939835029513, -0.08890298591443123, -0.24992205099596715, -0.18201505948001376, -0.23832054142482006, 0.07331173224128389, -0.06722158541448991, -0.1865707418944042, 0.4542714190633538, 0.13320222647878557, 0.18606154000092198, -0.040391351331401475, 0.25627995546137056, 0.11380274171936505, 0.08530456478071685, 0.009174249815539671, 0.35235230159462216, 0.19239993536925445, 0.07788537986701928, -0.3141183078718873, 0.010283323851091644, 0.015911677811975375] |
1,802.02528 | Classification of Things in DBpedia using Deep Neural Networks | The Semantic Web aims at representing knowledge about the real world at web
scale - things, their attributes and relationships among them can be
represented as nodes and edges in an inter-linked semantic graph. In the
presence of noisy data, as is typical of data on the Semantic Web, a software
Agent needs to be able to robustly infer one or more associated actionable
classes for the individuals in order to act automatically on it. We model this
problem as a multi-label classification task where we want to robustly identify
types of the individuals in a semantic graph such as DBpedia, which we use as
an exemplary dataset on the Semantic Web. Our approach first extracts multiple
features for the individuals using random walks and then performs multi-label
classification using fully-connected Neural Networks. Through systematic
exploration and experimentation, we identify the effect of hyper-parameters of
the feature extraction and the fully-connected Neural Network structure on the
classification performance. Our final results show that our method performs
better than state-of-the-art inferencing systems like SDtype and SLCN, from
which we can conclude that random-walk-based feature extraction of individuals
and their multi-label classification using Deep Neural Networks is a promising
alternative to these systems for type classification of individuals on the
Semantic Web. The main contribution of our work is to introduce a novel
approach that allows us to use Deep Neural Networks to identify types of
individuals in a noisy semantic graph by extracting features using random walks
| cs.AI cs.NE | the semantic web aims at representing knowledge about the real world at web scale things their attributes and relationships among them can be represented as nodes and edges in an interlinked semantic graph in the presence of noisy data as is typical of data on the semantic web a software agent needs to be able to robustly infer one or more associated actionable classes for the individuals in order to act automatically on it we model this problem as a multilabel classification task where we want to robustly identify types of the individuals in a semantic graph such as dbpedia which we use as an exemplary dataset on the semantic web our approach first extracts multiple features for the individuals using random walks and then performs multilabel classification using fullyconnected neural networks through systematic exploration and experimentation we identify the effect of hyperparameters of the feature extraction and the fullyconnected neural network structure on the classification performance our final results show that our method performs better than stateoftheart inferencing systems like sdtype and slcn from which we can conclude that randomwalkbased feature extraction of individuals and their multilabel classification using deep neural networks is a promising alternative to these systems for type classification of individuals on the semantic web the main contribution of our work is to introduce a novel approach that allows us to use deep neural networks to identify types of individuals in a noisy semantic graph by extracting features using random walks | [['the', 'semantic', 'web', 'aims', 'at', 'representing', 'knowledge', 'about', 'the', 'real', 'world', 'at', 'web', 'scale', 'things', 'their', 'attributes', 'and', 'relationships', 'among', 'them', 'can', 'be', 'represented', 'as', 'nodes', 'and', 'edges', 'in', 'an', 'interlinked', 'semantic', 'graph', 'in', 'the', 'presence', 'of', 'noisy', 'data', 'as', 'is', 'typical', 'of', 'data', 'on', 'the', 'semantic', 'web', 'a', 'software', 'agent', 'needs', 'to', 'be', 'able', 'to', 'robustly', 'infer', 'one', 'or', 'more', 'associated', 'actionable', 'classes', 'for', 'the', 'individuals', 'in', 'order', 'to', 'act', 'automatically', 'on', 'it', 'we', 'model', 'this', 'problem', 'as', 'a', 'multilabel', 'classification', 'task', 'where', 'we', 'want', 'to', 'robustly', 'identify', 'types', 'of', 'the', 'individuals', 'in', 'a', 'semantic', 'graph', 'such', 'as', 'dbpedia', 'which', 'we', 'use', 'as', 'an', 'exemplary', 'dataset', 'on', 'the', 'semantic', 'web', 'our', 'approach', 'first', 'extracts', 'multiple', 'features', 'for', 'the', 'individuals', 'using', 'random', 'walks', 'and', 'then', 'performs', 'multilabel', 'classification', 'using', 'fullyconnected', 'neural', 'networks', 'through', 'systematic', 'exploration', 'and', 'experimentation', 'we', 'identify', 'the', 'effect', 'of', 'hyperparameters', 'of', 'the', 'feature', 'extraction', 'and', 'the', 'fullyconnected', 'neural', 'network', 'structure', 'on', 'the', 'classification', 'performance', 'our', 'final', 'results', 'show', 'that', 'our', 'method', 'performs', 'better', 'than', 'stateoftheart', 'inferencing', 'systems', 'like', 'sdtype', 'and', 'slcn', 'from', 'which', 'we', 'can', 'conclude', 'that', 'randomwalkbased', 'feature', 'extraction', 'of', 'individuals', 'and', 'their', 'multilabel', 'classification', 'using', 'deep', 'neural', 'networks', 'is', 'a', 'promising', 'alternative', 'to', 'these', 'systems', 'for', 'type', 'classification', 'of', 'individuals', 'on', 'the', 'semantic', 'web', 'the', 'main', 'contribution', 'of', 'our', 'work', 'is', 'to', 'introduce', 'a', 'novel', 'approach', 'that', 'allows', 'us', 'to', 'use', 'deep', 'neural', 'networks', 'to', 'identify', 'types', 'of', 'individuals', 'in', 'a', 'noisy', 'semantic', 'graph', 'by', 'extracting', 'features', 'using', 'random', 'walks']] | [-0.040792115174000124, -0.007848453087949696, -0.04820709096060859, 0.08128504114155562, -0.14922713191122, -0.1421033062295674, 0.07315848193250198, 0.44552575504031694, -0.2914242067818871, -0.3452361557180438, 0.048977819211501246, -0.30992843399554687, -0.21496114674131597, 0.17510748497275597, -0.09485216727365314, 0.0409411087789316, 0.1155224609712844, 0.09684552124475317, -0.006344468565657735, -0.29430682977089956, 0.36014765102814866, 0.033128651837988875, 0.31410833534405186, 0.006898637493083506, 0.11220956610136286, -0.012451839903484524, -0.05906715526278111, 0.0015604722427602841, -0.046942640899328675, 0.1925433537258801, 0.34966801297793415, 0.21175566681089653, 0.30728533070768255, -0.39690852176719976, -0.227400160655226, 0.10565714319926445, 0.1502019603173306, 0.11939533863891176, 0.024766907038599725, -0.384069375528038, 0.11658907643856611, -0.16513504709956456, 0.02495573907266582, -0.14954170652515728, -0.016229873969255078, -0.0038230344425568765, -0.2558067410893512, 0.029477040162654938, 0.06931252704661171, 0.05973346673101647, -0.027118922601436713, -0.08222279844062073, -0.006762143167946871, 0.21806532599380693, -0.0022668503239221963, 0.03327187057584524, 0.14975016822256607, -0.19209251183644704, -0.17248643084846957, 0.358633369682625, -0.0337400731375875, -0.19627090041437512, 0.24310041416950004, 0.012385472083280299, -0.19701454860116105, 0.04595860504184048, 0.26193757288813313, 0.10392201629873564, -0.19043894427940594, -0.03049730739835075, -0.06188784784986159, 0.1910972162082776, 0.03197122773791782, -0.008402941977497911, 0.19915002175901897, 0.2783045830825965, 0.05702025455004946, 0.1392162317896852, -0.1226810035893431, -0.04907778358477869, -0.21554258749786756, -0.12030512332885598, -0.1947679401360023, 0.01042838506170629, -0.154861409559718, -0.16988681839710032, 0.43351509067931293, 0.24772088245369892, 0.22923871325213968, 0.10553829917596047, 0.3102274289193713, -0.01164524980658788, 0.13581691091351303, 0.09679861561516913, 0.11373610954363773, 0.021941832474666675, 0.13817393308727707, -0.12425585835022324, 0.11573690435764813, 0.06988571096334315] |
1,802.02529 | Comment on 'Simulation of ultra-relativistic electrons and positrons
channeling in crystals with MBN Explorer' | The snapshot model of crystal atoms was implemented in the Monte Carlo code
ChaS (Channeling Simulator) and is being successfully used for simulation of
ultrarelativistic particle channeling. The model was criticized by Sushko et
al. (J. Comp. Phys. 252 (2013) 404-418) who claim that it overestimates the
mean scattering angle in a single projectile-atom collision. As a matter of
fact, no evidence that would support this claim can be found in the mentioned
publication. Moreover, the snapshot model and the model suggested by Sushko et
al. yield essentially the same value of the mean scattering angle. Contrary to
the claim of Sushko et al., the target electrons can be considered as
fixed-position scatterer, corrections due to their finite mass and nonzero
initial velocity have a negligible impact on the channeling of light
projectiles (electrons and positrons). In contrast to the snapshot model, the
model preferred by Sushko et al. does not take into account incoherent
scattering of the projectile by crystal electrons. This explains why the two
models predict different values of the dechanneling length. The claim that the
snapshot model underestimates the dechanneling length is unfounded. In actual
fact, this model is in good agreement with experimental data.
| physics.acc-ph physics.comp-ph | the snapshot model of crystal atoms was implemented in the monte carlo code chas channeling simulator and is being successfully used for simulation of ultrarelativistic particle channeling the model was criticized by sushko et al j comp phys 252 2013 404418 who claim that it overestimates the mean scattering angle in a single projectileatom collision as a matter of fact no evidence that would support this claim can be found in the mentioned publication moreover the snapshot model and the model suggested by sushko et al yield essentially the same value of the mean scattering angle contrary to the claim of sushko et al the target electrons can be considered as fixedposition scatterer corrections due to their finite mass and nonzero initial velocity have a negligible impact on the channeling of light projectiles electrons and positrons in contrast to the snapshot model the model preferred by sushko et al does not take into account incoherent scattering of the projectile by crystal electrons this explains why the two models predict different values of the dechanneling length the claim that the snapshot model underestimates the dechanneling length is unfounded in actual fact this model is in good agreement with experimental data | [['the', 'snapshot', 'model', 'of', 'crystal', 'atoms', 'was', 'implemented', 'in', 'the', 'monte', 'carlo', 'code', 'chas', 'channeling', 'simulator', 'and', 'is', 'being', 'successfully', 'used', 'for', 'simulation', 'of', 'ultrarelativistic', 'particle', 'channeling', 'the', 'model', 'was', 'criticized', 'by', 'sushko', 'et', 'al', 'j', 'comp', 'phys', '252', '2013', '404418', 'who', 'claim', 'that', 'it', 'overestimates', 'the', 'mean', 'scattering', 'angle', 'in', 'a', 'single', 'projectileatom', 'collision', 'as', 'a', 'matter', 'of', 'fact', 'no', 'evidence', 'that', 'would', 'support', 'this', 'claim', 'can', 'be', 'found', 'in', 'the', 'mentioned', 'publication', 'moreover', 'the', 'snapshot', 'model', 'and', 'the', 'model', 'suggested', 'by', 'sushko', 'et', 'al', 'yield', 'essentially', 'the', 'same', 'value', 'of', 'the', 'mean', 'scattering', 'angle', 'contrary', 'to', 'the', 'claim', 'of', 'sushko', 'et', 'al', 'the', 'target', 'electrons', 'can', 'be', 'considered', 'as', 'fixedposition', 'scatterer', 'corrections', 'due', 'to', 'their', 'finite', 'mass', 'and', 'nonzero', 'initial', 'velocity', 'have', 'a', 'negligible', 'impact', 'on', 'the', 'channeling', 'of', 'light', 'projectiles', 'electrons', 'and', 'positrons', 'in', 'contrast', 'to', 'the', 'snapshot', 'model', 'the', 'model', 'preferred', 'by', 'sushko', 'et', 'al', 'does', 'not', 'take', 'into', 'account', 'incoherent', 'scattering', 'of', 'the', 'projectile', 'by', 'crystal', 'electrons', 'this', 'explains', 'why', 'the', 'two', 'models', 'predict', 'different', 'values', 'of', 'the', 'dechanneling', 'length', 'the', 'claim', 'that', 'the', 'snapshot', 'model', 'underestimates', 'the', 'dechanneling', 'length', 'is', 'unfounded', 'in', 'actual', 'fact', 'this', 'model', 'is', 'in', 'good', 'agreement', 'with', 'experimental', 'data']] | [-0.043012409428210586, 0.16114611705118903, -0.10332937375642359, 0.07581296286602714, -0.04658066404850355, -0.10789168018096944, 0.04780680229127103, 0.36194461929535837, -0.19578112984950446, -0.3687752781160252, -0.021554177735067372, -0.28416632905920813, -0.08138005399354259, 0.16605286612376607, -0.050177326145562896, 0.04132369912548135, 0.07563134684579029, -0.045469782595541706, -0.00795467892897491, -0.2637692791747157, 0.22500787388618884, 0.17977646978130107, 0.30504957290929957, 0.08023929351831463, 0.06921136371579914, 0.05257697366368102, -0.050305467267931746, 0.02620793295530032, -0.1382301582078962, 0.01978333477745764, 0.19012645374572903, 0.05984228205563007, 0.21765923581789343, -0.42513807312756474, -0.2391011341797097, 0.07265848439538433, 0.13720073425020946, 0.14215961057569224, -0.0389414174554689, -0.2629043914577259, 0.03152726338321001, -0.20851532670512454, -0.14108928063841614, 0.004363808788036053, 0.061320977233236235, 0.007717499640124033, -0.26305532803977555, 0.09795425818966967, 0.06232829398608634, 0.007144829776252107, -0.06616564881892836, -0.13172932207520233, -0.05115097837180507, 0.027656023487999882, 0.04633667991004827, 0.05982585125887881, 0.11528567600952537, -0.06504446485825834, -0.12183649239263364, 0.3877992674100156, -0.026157526447846344, -0.1500543600271399, 0.15753069799393415, -0.14402183114636538, -0.07416084473738827, 0.16618706629913282, 0.12947099015819935, 0.08199634244522955, -0.12497139253358984, 0.10243081082281068, -0.1321456531533135, 0.1742323487314006, 0.07891869491883269, -0.04839684507351194, 0.18129358478650756, 0.11406544918949925, -0.06769202559074501, 0.04681257545420596, -0.11481997288041274, -0.09236326044525153, -0.2747344541391928, -0.14675579532120872, -0.21576586498983433, 0.027124333633801886, -0.025430600933091504, -0.10821049497462809, 0.32639750877005635, 0.2013521440213128, 0.1981273713017985, -0.024787094092414697, 0.269591848104622, 0.09290887387968334, 0.04880126735209772, 0.10444391747337156, 0.32171475601249505, 0.12167511528657217, 0.11315883772699542, -0.22441811037691767, 0.12449415737634753, 0.03828893147963717] |
1,802.0253 | Magnetic Isotope Effect in the Uranium Isotopes Separation | When uranyl nitrate is photolysed in the water solution, light isotope
${}^{235}{\rm U}$ is separated from isotope ${}^{238}{\rm U}$ ; an enrichment
factor $K = 1.04$ . The initial samples were depleted by a light isotope of
uranium ${}^{235}{\rm U}$ (degree $\beta = 0.00455$). Regenerated uranyl
nitrate was enriched by an isotope of uranium ${}^{235}{\rm U}$ (degree $\alpha
= 0.00464$). Uranium tetrafluoride was depleted by an isotope of uranium
${}^{235}{\rm U}$ (degree $\beta = 0.00446$). Uranium isotopes are separated by
the magnetic isotope effect (MIE) in uranyl nitrate photoreduction.
| physics.chem-ph | when uranyl nitrate is photolysed in the water solution light isotope 235rm u is separated from isotope 238rm u an enrichment factor k 104 the initial samples were depleted by a light isotope of uranium 235rm u degree beta 000455 regenerated uranyl nitrate was enriched by an isotope of uranium 235rm u degree alpha 000464 uranium tetrafluoride was depleted by an isotope of uranium 235rm u degree beta 000446 uranium isotopes are separated by the magnetic isotope effect mie in uranyl nitrate photoreduction | [['when', 'uranyl', 'nitrate', 'is', 'photolysed', 'in', 'the', 'water', 'solution', 'light', 'isotope', '235rm', 'u', 'is', 'separated', 'from', 'isotope', '238rm', 'u', 'an', 'enrichment', 'factor', 'k', '104', 'the', 'initial', 'samples', 'were', 'depleted', 'by', 'a', 'light', 'isotope', 'of', 'uranium', '235rm', 'u', 'degree', 'beta', '000455', 'regenerated', 'uranyl', 'nitrate', 'was', 'enriched', 'by', 'an', 'isotope', 'of', 'uranium', '235rm', 'u', 'degree', 'alpha', '000464', 'uranium', 'tetrafluoride', 'was', 'depleted', 'by', 'an', 'isotope', 'of', 'uranium', '235rm', 'u', 'degree', 'beta', '000446', 'uranium', 'isotopes', 'are', 'separated', 'by', 'the', 'magnetic', 'isotope', 'effect', 'mie', 'in', 'uranyl', 'nitrate', 'photoreduction']] | [-0.02030255563127307, 0.34684855563663847, 0.08387110590075071, -0.021658204886942912, 0.14863666022817293, -0.14916170429056272, 0.07805319905328827, 0.3878778927028179, -0.26177965419796795, -0.24566925295556968, -0.049551291131557755, -0.47210924360805595, 0.1006176232611044, 0.08846222700025791, 0.009867274114348663, -0.0462081126916485, 0.027506473724945232, 0.018776327192496795, -0.049120877463466085, -0.20551899569825485, 0.19592861552388433, 0.09759635632284559, 0.17575191061657208, 0.08926106631182708, -0.019396819263839953, -0.15061785424731147, 0.07113596875196657, -0.061836310710089326, -0.12698957692975035, 0.058328562965377785, 0.24150281260984066, 0.04399304586844758, 0.17398150058355755, -0.3954048380255699, -0.1288206590196261, 0.08809832801134923, 0.0758540142649928, 0.050382803295715116, -0.1403040498113021, -0.26879104506224394, 0.022065394402792055, -0.17076537002513084, -0.19915452878922224, 0.009456491688839518, 0.10306051534672196, 0.09973700260982299, -0.3275643401564314, 0.07877116719595133, -0.020479213459811244, 0.1613393923243842, -0.08259561921183306, -0.3431321153154549, -0.0913542088909218, -0.021049736689653795, 0.06121745074573809, 0.05390148963898611, 0.19506052480294153, 0.008610571842067517, 0.09803721131995702, 0.37624686954017633, -0.0994544889813719, 0.020062522520908177, 0.031065590070703857, -0.16008667058224837, -0.09189191791945352, 0.3105442011490082, 0.021275454299309507, 0.13433703385556164, -0.20749678435076463, 0.10107994216900223, -0.048255885210938945, 0.2840459502946872, 0.19979469247090703, -0.051815550290764525, 0.14460427302700013, 0.17467538237225455, -0.021627161753340028, 0.06313414355883232, -0.1816513848801454, 0.06568464971123597, -0.1560393646120643, -0.19673676650302532, -0.07179160834027407, 0.09801970551817273, -0.07576704243771158, -0.1524438788664366, 0.2644265953403635, -0.03786124976781698, 0.09658712416048496, -0.2456814956922944, 0.16216099060450992, 0.025801278077639066, 0.02116463208818832, -0.04841344622083199, 0.21535236704855776, 0.19659289819164535, 0.12220457616375568, -0.33920409207721836, 0.22486365729202637, 0.1191025177637736] |
1,802.02531 | Fair comparison of skin detection approaches on publicly available
datasets | Skin detection is the process of discriminating skin and non-skin regions in
a digital image and it is widely used in several applications ranging from hand
gesture analysis to track body parts and face detection. Skin detection is a
challenging problem which has drawn extensive attention from the research
community, nevertheless a fair comparison among approaches is very difficult
due to the lack of a common benchmark and a unified testing protocol. In this
work, we investigate the most recent researches in this field and we propose a
fair comparison among approaches using several different datasets. The major
contributions of this work are an exhaustive literature review of skin color
detection approaches, a framework to evaluate and combine different skin
detector approaches, whose source code is made freely available for future
research, and an extensive experimental comparison among several recent methods
which have also been used to define an ensemble that works well in many
different problems. Experiments are carried out in 10 different datasets
including more than 10000 labelled images: experimental results confirm that
the best method here proposed obtains a very good performance with respect to
other stand-alone approaches, without requiring ad hoc parameter tuning. A
MATLAB version of the framework for testing and of the methods proposed in this
paper will be freely available from https://github.com/LorisNanni
| cs.CV | skin detection is the process of discriminating skin and nonskin regions in a digital image and it is widely used in several applications ranging from hand gesture analysis to track body parts and face detection skin detection is a challenging problem which has drawn extensive attention from the research community nevertheless a fair comparison among approaches is very difficult due to the lack of a common benchmark and a unified testing protocol in this work we investigate the most recent researches in this field and we propose a fair comparison among approaches using several different datasets the major contributions of this work are an exhaustive literature review of skin color detection approaches a framework to evaluate and combine different skin detector approaches whose source code is made freely available for future research and an extensive experimental comparison among several recent methods which have also been used to define an ensemble that works well in many different problems experiments are carried out in 10 different datasets including more than 10000 labelled images experimental results confirm that the best method here proposed obtains a very good performance with respect to other standalone approaches without requiring ad hoc parameter tuning a matlab version of the framework for testing and of the methods proposed in this paper will be freely available from httpsgithubcomlorisnanni | [['skin', 'detection', 'is', 'the', 'process', 'of', 'discriminating', 'skin', 'and', 'nonskin', 'regions', 'in', 'a', 'digital', 'image', 'and', 'it', 'is', 'widely', 'used', 'in', 'several', 'applications', 'ranging', 'from', 'hand', 'gesture', 'analysis', 'to', 'track', 'body', 'parts', 'and', 'face', 'detection', 'skin', 'detection', 'is', 'a', 'challenging', 'problem', 'which', 'has', 'drawn', 'extensive', 'attention', 'from', 'the', 'research', 'community', 'nevertheless', 'a', 'fair', 'comparison', 'among', 'approaches', 'is', 'very', 'difficult', 'due', 'to', 'the', 'lack', 'of', 'a', 'common', 'benchmark', 'and', 'a', 'unified', 'testing', 'protocol', 'in', 'this', 'work', 'we', 'investigate', 'the', 'most', 'recent', 'researches', 'in', 'this', 'field', 'and', 'we', 'propose', 'a', 'fair', 'comparison', 'among', 'approaches', 'using', 'several', 'different', 'datasets', 'the', 'major', 'contributions', 'of', 'this', 'work', 'are', 'an', 'exhaustive', 'literature', 'review', 'of', 'skin', 'color', 'detection', 'approaches', 'a', 'framework', 'to', 'evaluate', 'and', 'combine', 'different', 'skin', 'detector', 'approaches', 'whose', 'source', 'code', 'is', 'made', 'freely', 'available', 'for', 'future', 'research', 'and', 'an', 'extensive', 'experimental', 'comparison', 'among', 'several', 'recent', 'methods', 'which', 'have', 'also', 'been', 'used', 'to', 'define', 'an', 'ensemble', 'that', 'works', 'well', 'in', 'many', 'different', 'problems', 'experiments', 'are', 'carried', 'out', 'in', '10', 'different', 'datasets', 'including', 'more', 'than', '10000', 'labelled', 'images', 'experimental', 'results', 'confirm', 'that', 'the', 'best', 'method', 'here', 'proposed', 'obtains', 'a', 'very', 'good', 'performance', 'with', 'respect', 'to', 'other', 'standalone', 'approaches', 'without', 'requiring', 'ad', 'hoc', 'parameter', 'tuning', 'a', 'matlab', 'version', 'of', 'the', 'framework', 'for', 'testing', 'and', 'of', 'the', 'methods', 'proposed', 'in', 'this', 'paper', 'will', 'be', 'freely', 'available', 'from', 'httpsgithubcomlorisnanni']] | [-0.026208643605696545, -0.004961287635306115, -0.08095160925284474, 0.030689083142537682, -0.08826258474282818, -0.17110708923924559, 0.0043663360760010745, 0.4283837924307976, -0.19403473673922692, -0.34722666234804817, 0.12141959536402198, -0.31300734814840114, -0.14711787517843466, 0.26294286910998144, -0.08658133486440311, 0.09397227342040944, 0.1366374754059356, 0.03364935955290215, -0.05502772755483123, -0.24420297680978453, 0.28125725047285177, 0.0709488752817366, 0.3584725525818147, 0.07225273743331913, 0.06169041331582767, -0.053368242879984, -0.10435207087379206, 0.04358669063387533, -0.09893210426053142, 0.15976448675074661, 0.3174764874856919, 0.17805230242740963, 0.2980111546552641, -0.42037017816840777, -0.22766016780056514, 0.10253296346159026, 0.14588860215507618, 0.13251616178342776, -0.0791653574840407, -0.29435959029599407, 0.09036636299347453, -0.20958496488883988, -0.025166281150259113, -0.08008948778347348, 0.026238511509928196, -0.025329911195102237, -0.2619198132091747, 0.010515298985812839, 0.013865108609796086, 0.09764507082441161, -0.050699850826519906, -0.1583446957533621, 0.09631063821639711, 0.1764536144218326, 0.09260745371371606, 0.055063923002727125, 0.11953805489272464, -0.15622241262312037, -0.14488166398991087, 0.39392731306980006, -0.016623106801548163, -0.18746136588233303, 0.274964798690046, -0.036939145544380776, -0.15737064252071048, 0.07343116328806922, 0.17938672795823093, 0.1704252765671949, -0.19119289396159042, 0.004086290898170614, -0.05235623374735842, 0.18167810588173808, 0.04477825051727211, -0.019380471857977078, 0.1829046238833944, 0.22989577247250464, 0.0171621692941464, 0.13626987530505455, -0.12646834635119972, -0.0714882018896515, -0.2339575296001775, -0.10742698220561864, -0.1720764080592547, -0.05368583783354988, -0.030284932097269884, -0.12547757418199618, 0.40369231355685553, 0.24131886634014307, 0.19592846734105923, 0.005343646285325838, 0.3718602126882699, -0.0013360229314386433, 0.10733824687653698, 0.037204918940873466, 0.23193201763031807, 0.04476614019507328, 0.09759053530403271, -0.15011830028245218, 0.058380705365602116, -0.016735090054399958] |
1,802.02532 | A Spatial Mapping Algorithm with Applications in Deep Learning-Based
Structure Classification | Convolutional Neural Network (CNN)-based machine learning systems have made
breakthroughs in feature extraction and image recognition tasks in two
dimensions (2D). Although there is significant ongoing work to apply CNN
technology to domains involving complex 3D data, the success of such efforts
has been constrained, in part, by limitations in data representation
techniques. Most current approaches rely upon low-resolution 3D models,
strategic limitation of scope in the 3D space, or the application of lossy
projection techniques to allow for the use of 2D CNNs. To address this issue,
we present a mapping algorithm that converts 3D structures to 2D and 1D data
grids by mapping a traversal of a 3D space-filling curve to the traversal of
corresponding 2D and 1D curves. We explore the performance of 2D and 1D CNNs
trained on data encoded with our method versus comparable volumetric CNNs
operating upon raw 3D data from a popular benchmarking dataset. Our experiments
demonstrate that both 2D and 1D representations of 3D data generated via our
method preserve a significant proportion of the 3D data's features in forms
learnable by CNNs. Furthermore, we demonstrate that our method of encoding 3D
data into lower-dimensional representations allows for decreased CNN training
time cost, increased original 3D model rendering resolutions, and supports
increased numbers of data channels when compared to purely volumetric
approaches. This demonstration is accomplished in the context of a structural
biology classification task wherein we train 3D, 2D, and 1D CNNs on examples of
two homologous branches within the Ras protein family. The essential
contribution of this paper is the introduction of a dimensionality-reduction
method that may ease the application of powerful deep learning tools to domains
characterized by complex structural data.
| cs.CV cs.LG | convolutional neural network cnnbased machine learning systems have made breakthroughs in feature extraction and image recognition tasks in two dimensions 2d although there is significant ongoing work to apply cnn technology to domains involving complex 3d data the success of such efforts has been constrained in part by limitations in data representation techniques most current approaches rely upon lowresolution 3d models strategic limitation of scope in the 3d space or the application of lossy projection techniques to allow for the use of 2d cnns to address this issue we present a mapping algorithm that converts 3d structures to 2d and 1d data grids by mapping a traversal of a 3d spacefilling curve to the traversal of corresponding 2d and 1d curves we explore the performance of 2d and 1d cnns trained on data encoded with our method versus comparable volumetric cnns operating upon raw 3d data from a popular benchmarking dataset our experiments demonstrate that both 2d and 1d representations of 3d data generated via our method preserve a significant proportion of the 3d datas features in forms learnable by cnns furthermore we demonstrate that our method of encoding 3d data into lowerdimensional representations allows for decreased cnn training time cost increased original 3d model rendering resolutions and supports increased numbers of data channels when compared to purely volumetric approaches this demonstration is accomplished in the context of a structural biology classification task wherein we train 3d 2d and 1d cnns on examples of two homologous branches within the ras protein family the essential contribution of this paper is the introduction of a dimensionalityreduction method that may ease the application of powerful deep learning tools to domains characterized by complex structural data | [['convolutional', 'neural', 'network', 'cnnbased', 'machine', 'learning', 'systems', 'have', 'made', 'breakthroughs', 'in', 'feature', 'extraction', 'and', 'image', 'recognition', 'tasks', 'in', 'two', 'dimensions', '2d', 'although', 'there', 'is', 'significant', 'ongoing', 'work', 'to', 'apply', 'cnn', 'technology', 'to', 'domains', 'involving', 'complex', '3d', 'data', 'the', 'success', 'of', 'such', 'efforts', 'has', 'been', 'constrained', 'in', 'part', 'by', 'limitations', 'in', 'data', 'representation', 'techniques', 'most', 'current', 'approaches', 'rely', 'upon', 'lowresolution', '3d', 'models', 'strategic', 'limitation', 'of', 'scope', 'in', 'the', '3d', 'space', 'or', 'the', 'application', 'of', 'lossy', 'projection', 'techniques', 'to', 'allow', 'for', 'the', 'use', 'of', '2d', 'cnns', 'to', 'address', 'this', 'issue', 'we', 'present', 'a', 'mapping', 'algorithm', 'that', 'converts', '3d', 'structures', 'to', '2d', 'and', '1d', 'data', 'grids', 'by', 'mapping', 'a', 'traversal', 'of', 'a', '3d', 'spacefilling', 'curve', 'to', 'the', 'traversal', 'of', 'corresponding', '2d', 'and', '1d', 'curves', 'we', 'explore', 'the', 'performance', 'of', '2d', 'and', '1d', 'cnns', 'trained', 'on', 'data', 'encoded', 'with', 'our', 'method', 'versus', 'comparable', 'volumetric', 'cnns', 'operating', 'upon', 'raw', '3d', 'data', 'from', 'a', 'popular', 'benchmarking', 'dataset', 'our', 'experiments', 'demonstrate', 'that', 'both', '2d', 'and', '1d', 'representations', 'of', '3d', 'data', 'generated', 'via', 'our', 'method', 'preserve', 'a', 'significant', 'proportion', 'of', 'the', '3d', 'datas', 'features', 'in', 'forms', 'learnable', 'by', 'cnns', 'furthermore', 'we', 'demonstrate', 'that', 'our', 'method', 'of', 'encoding', '3d', 'data', 'into', 'lowerdimensional', 'representations', 'allows', 'for', 'decreased', 'cnn', 'training', 'time', 'cost', 'increased', 'original', '3d', 'model', 'rendering', 'resolutions', 'and', 'supports', 'increased', 'numbers', 'of', 'data', 'channels', 'when', 'compared', 'to', 'purely', 'volumetric', 'approaches', 'this', 'demonstration', 'is', 'accomplished', 'in', 'the', 'context', 'of', 'a', 'structural', 'biology', 'classification', 'task', 'wherein', 'we', 'train', '3d', '2d', 'and', '1d', 'cnns', 'on', 'examples', 'of', 'two', 'homologous', 'branches', 'within', 'the', 'ras', 'protein', 'family', 'the', 'essential', 'contribution', 'of', 'this', 'paper', 'is', 'the', 'introduction', 'of', 'a', 'dimensionalityreduction', 'method', 'that', 'may', 'ease', 'the', 'application', 'of', 'powerful', 'deep', 'learning', 'tools', 'to', 'domains', 'characterized', 'by', 'complex', 'structural', 'data']] | [-0.030387760439709303, -0.015247571393963055, -0.021332642469713663, 0.025615843285803176, -0.08056372511596914, -0.16754888633104265, 0.006262671767159346, 0.43371314624099866, -0.2732320671958076, -0.3228624081453771, 0.09513245595838703, -0.26612818011018513, -0.21503906365209888, 0.23175944673749518, -0.10555308525110364, 0.1314821634255845, 0.15390858642801525, -0.03171994215590014, -0.10667455718123539, -0.25427160895238005, 0.32628454783054545, 0.01780138728248058, 0.38635235054728884, -0.009320790978505257, 0.11100338601733473, -0.02478030001487028, -0.0526589753984718, -0.00748017561881628, -0.087160421243612, 0.21428648329501748, 0.2887471216639153, 0.17028757337817646, 0.2656203017186981, -0.48416706920330616, -0.2752738640522287, 0.06988534148029507, 0.18053341944906728, 0.14170464909353114, -0.05518258912059485, -0.30720704290619555, 0.06565342584363984, -0.12505137785222276, -0.025092924400133654, -0.14589366732092562, -0.01377567829207537, -0.030441307044152092, -0.25545003800157534, 0.030914337206664925, 0.08383789602320324, 0.09357840046352635, -0.062253968121301455, -0.07397220258977502, -0.01016610059953222, 0.16295059603617892, -0.0013854658814867074, 0.06770548255328115, 0.10581292275418626, -0.20371599474563495, -0.13050137240239848, 0.37843976768310816, -0.0415700334528831, -0.21800862058356457, 0.22349651077603724, -0.04594921637351248, -0.14356366624966502, 0.1386964602428092, 0.24631396385491, 0.0900055039459377, -0.12264654231745897, 0.05119791934997378, -0.024276754848579777, 0.18653394151825775, 0.02351869912223613, -0.025212650008562373, 0.18541729554710645, 0.2632394083847823, -0.00632186971046691, 0.14723166531977303, -0.16812260215111235, -0.05202755697917008, -0.17217227915988853, -0.1434359647604432, -0.22973593330945397, -0.01860601936156551, -0.09352919321012038, -0.15123231487484082, 0.4252070791025296, 0.20953989958808367, 0.21488209807929906, 0.07140588021345093, 0.35492038358818634, 0.021653237013461675, 0.1503669440012313, 0.05030810360525114, 0.15839859756262534, 0.03859373038747771, 0.13421814092865308, -0.14456519887102307, 0.012608434891836811, 0.08315635479966853] |
1,802.02533 | Factors of generalised polynomials and automatic sequences | The aim of this short note is to generalise the result of Rampersad--Shallit
saying that an automatic sequence and a Sturmian sequence cannot have
arbitrarily long common factors. We show that the same result holds if a
Sturmian sequence is replaced by an arbitrary sequence whose terms are given by
a generalised polynomial (i.e., an expression involving algebraic operations
and the floor function) that is not periodic except for a set of density zero.
| math.CO cs.FL math.DS | the aim of this short note is to generalise the result of rampersadshallit saying that an automatic sequence and a sturmian sequence cannot have arbitrarily long common factors we show that the same result holds if a sturmian sequence is replaced by an arbitrary sequence whose terms are given by a generalised polynomial ie an expression involving algebraic operations and the floor function that is not periodic except for a set of density zero | [['the', 'aim', 'of', 'this', 'short', 'note', 'is', 'to', 'generalise', 'the', 'result', 'of', 'rampersadshallit', 'saying', 'that', 'an', 'automatic', 'sequence', 'and', 'a', 'sturmian', 'sequence', 'can', 'not', 'have', 'arbitrarily', 'long', 'common', 'factors', 'we', 'show', 'that', 'the', 'same', 'result', 'holds', 'if', 'a', 'sturmian', 'sequence', 'is', 'replaced', 'by', 'an', 'arbitrary', 'sequence', 'whose', 'terms', 'are', 'given', 'by', 'a', 'generalised', 'polynomial', 'ie', 'an', 'expression', 'involving', 'algebraic', 'operations', 'and', 'the', 'floor', 'function', 'that', 'is', 'not', 'periodic', 'except', 'for', 'a', 'set', 'of', 'density', 'zero']] | [-0.16723857837653644, 0.15534432332965112, -0.10080792150787406, 0.08489560044206981, -0.03992172065694388, -0.10736286219813533, 0.020045855165950047, 0.3549711965527889, -0.32031825120636337, -0.2409129520764927, 0.10540256061515696, -0.22174194947237502, -0.17738865914351837, 0.21483425779670878, -0.13233854722882923, 0.011774683062842971, 0.08035800899253101, 0.11584231173745482, -0.048865842094921785, -0.2792598789532644, 0.3531074403105555, -0.027857398463262094, 0.1958677318651934, 0.029801084395699406, 0.12091660697164165, 0.015249216582978497, -0.01623334937628258, 0.0022048565710114467, -0.09168888326265104, 0.08596284544910304, 0.25077903321063194, 0.14155094358264594, 0.2888728385552059, -0.3814038274482497, -0.15677329794679945, 0.19056613232336334, 0.18611244232129506, 0.10772794131441293, -0.02382238464102753, -0.2095033962506096, 0.1734047234074112, -0.18195326268245038, -0.14606468164915773, -0.05300720659638378, 0.07030764911827203, 0.08564410977871031, -0.2961394862724921, 0.0023450677934404767, 0.1794533425048497, 0.06152073144157593, -0.03290393467161905, -0.06658717443556147, 0.04402503900613787, 0.17013001833362756, 0.021765629764067363, 0.11752675593251714, 0.02529866512034189, -0.06533147195964498, -0.09931507339776569, 0.35964991971598687, -0.11409924189383919, -0.2554530533080971, 0.1375592670614227, -0.13951187563204281, -0.13933105447732314, 0.12891949205722258, 0.03487822195087131, 0.1260430673389016, -0.1367754777893424, 0.10037206667255157, -0.11282678036101011, 0.2006993356941117, 0.13454799314432248, 0.020485375189801324, 0.17833063552609166, 0.07341487540838283, 0.08995842231701859, 0.14849598496221006, 0.016509775682730047, -0.013747059947785896, -0.3322651671950479, -0.12199467347031837, -0.21813947417634866, 0.09442606474614287, -0.08538461802487979, -0.2320443102602243, 0.352126279795492, 0.05646507715730852, 0.2142394102065245, 0.15649590809905045, 0.2417825080668302, 0.1882020880932671, 0.043145424774470365, 0.051456981061680895, 0.09913079794559225, 0.08947295808182978, -0.0023730582985523586, -0.1648171604422198, 0.11070885154343135, 0.13165589818114265] |
1,802.02534 | FixaTons: A collection of Human Fixations Datasets and Metrics for
Scanpath Similarity | In the last three decades, human visual attention has been a topic of great
interest in various disciplines. In computer vision, many models have been
proposed to predict the distribution of human fixations on a visual stimulus.
Recently, thanks to the creation of large collections of data, machine learning
algorithms have obtained state-of-the-art performance on the task of saliency
map estimation. On the other hand, computational models of scanpath are much
less studied. Works are often only descriptive or task specific. This is due to
the fact that the scanpath is harder to model because it must include the
description of a dynamic. General purpose computational models are present in
the literature, but are then evaluated in tasks of saliency prediction, losing
therefore information about the dynamics and the behaviour. In addition, two
technical reasons have limited the research. The first reason is the lack of
robust and uniformly used set of metrics to compare the similarity between
scanpath. The second reason is the lack of sufficiently large and varied
scanpath datasets. In this report we want to help in both directions. We
present FixaTons, a large collection of datasets human scanpaths (temporally
ordered sequences of fixations) and saliency maps. It comes along with a
software library for easy data usage, statistics calculation and implementation
of metrics for scanpath and saliency prediction evaluation.
| cs.AI cs.CV | in the last three decades human visual attention has been a topic of great interest in various disciplines in computer vision many models have been proposed to predict the distribution of human fixations on a visual stimulus recently thanks to the creation of large collections of data machine learning algorithms have obtained stateoftheart performance on the task of saliency map estimation on the other hand computational models of scanpath are much less studied works are often only descriptive or task specific this is due to the fact that the scanpath is harder to model because it must include the description of a dynamic general purpose computational models are present in the literature but are then evaluated in tasks of saliency prediction losing therefore information about the dynamics and the behaviour in addition two technical reasons have limited the research the first reason is the lack of robust and uniformly used set of metrics to compare the similarity between scanpath the second reason is the lack of sufficiently large and varied scanpath datasets in this report we want to help in both directions we present fixatons a large collection of datasets human scanpaths temporally ordered sequences of fixations and saliency maps it comes along with a software library for easy data usage statistics calculation and implementation of metrics for scanpath and saliency prediction evaluation | [['in', 'the', 'last', 'three', 'decades', 'human', 'visual', 'attention', 'has', 'been', 'a', 'topic', 'of', 'great', 'interest', 'in', 'various', 'disciplines', 'in', 'computer', 'vision', 'many', 'models', 'have', 'been', 'proposed', 'to', 'predict', 'the', 'distribution', 'of', 'human', 'fixations', 'on', 'a', 'visual', 'stimulus', 'recently', 'thanks', 'to', 'the', 'creation', 'of', 'large', 'collections', 'of', 'data', 'machine', 'learning', 'algorithms', 'have', 'obtained', 'stateoftheart', 'performance', 'on', 'the', 'task', 'of', 'saliency', 'map', 'estimation', 'on', 'the', 'other', 'hand', 'computational', 'models', 'of', 'scanpath', 'are', 'much', 'less', 'studied', 'works', 'are', 'often', 'only', 'descriptive', 'or', 'task', 'specific', 'this', 'is', 'due', 'to', 'the', 'fact', 'that', 'the', 'scanpath', 'is', 'harder', 'to', 'model', 'because', 'it', 'must', 'include', 'the', 'description', 'of', 'a', 'dynamic', 'general', 'purpose', 'computational', 'models', 'are', 'present', 'in', 'the', 'literature', 'but', 'are', 'then', 'evaluated', 'in', 'tasks', 'of', 'saliency', 'prediction', 'losing', 'therefore', 'information', 'about', 'the', 'dynamics', 'and', 'the', 'behaviour', 'in', 'addition', 'two', 'technical', 'reasons', 'have', 'limited', 'the', 'research', 'the', 'first', 'reason', 'is', 'the', 'lack', 'of', 'robust', 'and', 'uniformly', 'used', 'set', 'of', 'metrics', 'to', 'compare', 'the', 'similarity', 'between', 'scanpath', 'the', 'second', 'reason', 'is', 'the', 'lack', 'of', 'sufficiently', 'large', 'and', 'varied', 'scanpath', 'datasets', 'in', 'this', 'report', 'we', 'want', 'to', 'help', 'in', 'both', 'directions', 'we', 'present', 'fixatons', 'a', 'large', 'collection', 'of', 'datasets', 'human', 'scanpaths', 'temporally', 'ordered', 'sequences', 'of', 'fixations', 'and', 'saliency', 'maps', 'it', 'comes', 'along', 'with', 'a', 'software', 'library', 'for', 'easy', 'data', 'usage', 'statistics', 'calculation', 'and', 'implementation', 'of', 'metrics', 'for', 'scanpath', 'and', 'saliency', 'prediction', 'evaluation']] | [-0.05078800648150898, 0.026533922282265716, -0.08080671247942289, 0.08066765584842395, -0.10877030769044214, -0.14102843477231292, 0.004851868053109528, 0.45187933688882637, -0.22392025360678164, -0.35535818280920656, 0.11004733559958688, -0.29111052041260843, -0.1653561042999295, 0.21012748168967035, -0.1462470931126862, 0.08995604619744595, 0.12508099619928445, 0.06805958403148563, -0.042921956158180195, -0.2811564613508086, 0.28863997576912437, 0.04260710658304192, 0.33432120604541254, 0.06735259460218183, 0.0938116007994206, -0.06258772104152117, -0.08888752199499658, 0.004496561231716696, -0.08361067367117324, 0.1970556595882921, 0.3083424030569363, 0.19780788798648696, 0.3329333272387131, -0.3946122525780051, -0.22905638312652438, 0.10670875284720112, 0.12125077662121102, 0.11708028405930465, -0.03737990981595054, -0.30140694962008985, 0.08922046563757986, -0.15257940163651296, 0.003781249434141828, -0.12089264568839189, 0.056559257383399585, -0.001188267284567963, -0.20855612630446166, 0.025519123724619817, 0.05366061303579995, 0.12007772777363793, -0.03708144575504267, -0.10596799232518754, 0.01711304321610327, 0.21475296827171603, 0.1071530763927201, 0.046115905081597366, 0.11288514901959412, -0.196654834970727, -0.14063380488303598, 0.4057108818108703, -0.016516545267255458, -0.21816371205506158, 0.23742526288244975, -0.10600332005540966, -0.17561698204896473, 0.1080684859100058, 0.20334562391115077, 0.1150425216405278, -0.16391508205928043, 0.046574498735460546, -0.020571236094871017, 0.17628181595481127, 0.036095792335365806, -0.0016309518966433668, 0.19641625706781843, 0.220284633069962, 0.010160450033606492, 0.13281456773984246, -0.0896678915685714, -0.10829467319900186, -0.20407795152513664, -0.10783115296775626, -0.18048692800247254, -0.03239780838699877, -0.07310216219401981, -0.1574848830722994, 0.40345141514800154, 0.23054151724178926, 0.19700616680459027, 0.06798176237944144, 0.3302028065983642, 0.03777912876581582, 0.09299566467798122, 0.04887171573297179, 0.19819130937082205, 0.04626011278958538, 0.13927606439746515, -0.14334042187843593, 0.11997789497537589, 0.011950435523816326] |
1,802.02535 | Directly and Efficiently Optimizing Prediction Error and AUC of Linear
Classifiers | The predictive quality of machine learning models is typically measured in
terms of their (approximate) expected prediction error or the so-called Area
Under the Curve (AUC) for a particular data distribution. However, when the
models are constructed by the means of empirical risk minimization, surrogate
functions such as the logistic loss are optimized instead. This is done because
the empirical approximations of the expected error and AUC functions are
nonconvex and nonsmooth, and more importantly have zero derivative almost
everywhere. In this work, we show that in the case of linear predictors, and
under the assumption that the data has normal distribution, the expected error
and the expected AUC are not only smooth, but have closed form expressions,
which depend on the first and second moments of the normal distribution. Hence,
we derive derivatives of these two functions and use these derivatives in an
optimization algorithm to directly optimize the expected error and the AUC. In
the case of real data sets, the derivatives can be approximated using empirical
moments. We show that even when data is not normally distributed, computed
derivatives are sufficiently useful to render an efficient optimization method
and high quality solutions. Thus, we propose a gradient-based optimization
method for direct optimization of the prediction error and AUC. Moreover, the
per-iteration complexity of the proposed algorithm has no dependence on the
size of the data set, unlike those for optimizing logistic regression and all
other well known empirical risk minimization problems.
| cs.LG | the predictive quality of machine learning models is typically measured in terms of their approximate expected prediction error or the socalled area under the curve auc for a particular data distribution however when the models are constructed by the means of empirical risk minimization surrogate functions such as the logistic loss are optimized instead this is done because the empirical approximations of the expected error and auc functions are nonconvex and nonsmooth and more importantly have zero derivative almost everywhere in this work we show that in the case of linear predictors and under the assumption that the data has normal distribution the expected error and the expected auc are not only smooth but have closed form expressions which depend on the first and second moments of the normal distribution hence we derive derivatives of these two functions and use these derivatives in an optimization algorithm to directly optimize the expected error and the auc in the case of real data sets the derivatives can be approximated using empirical moments we show that even when data is not normally distributed computed derivatives are sufficiently useful to render an efficient optimization method and high quality solutions thus we propose a gradientbased optimization method for direct optimization of the prediction error and auc moreover the periteration complexity of the proposed algorithm has no dependence on the size of the data set unlike those for optimizing logistic regression and all other well known empirical risk minimization problems | [['the', 'predictive', 'quality', 'of', 'machine', 'learning', 'models', 'is', 'typically', 'measured', 'in', 'terms', 'of', 'their', 'approximate', 'expected', 'prediction', 'error', 'or', 'the', 'socalled', 'area', 'under', 'the', 'curve', 'auc', 'for', 'a', 'particular', 'data', 'distribution', 'however', 'when', 'the', 'models', 'are', 'constructed', 'by', 'the', 'means', 'of', 'empirical', 'risk', 'minimization', 'surrogate', 'functions', 'such', 'as', 'the', 'logistic', 'loss', 'are', 'optimized', 'instead', 'this', 'is', 'done', 'because', 'the', 'empirical', 'approximations', 'of', 'the', 'expected', 'error', 'and', 'auc', 'functions', 'are', 'nonconvex', 'and', 'nonsmooth', 'and', 'more', 'importantly', 'have', 'zero', 'derivative', 'almost', 'everywhere', 'in', 'this', 'work', 'we', 'show', 'that', 'in', 'the', 'case', 'of', 'linear', 'predictors', 'and', 'under', 'the', 'assumption', 'that', 'the', 'data', 'has', 'normal', 'distribution', 'the', 'expected', 'error', 'and', 'the', 'expected', 'auc', 'are', 'not', 'only', 'smooth', 'but', 'have', 'closed', 'form', 'expressions', 'which', 'depend', 'on', 'the', 'first', 'and', 'second', 'moments', 'of', 'the', 'normal', 'distribution', 'hence', 'we', 'derive', 'derivatives', 'of', 'these', 'two', 'functions', 'and', 'use', 'these', 'derivatives', 'in', 'an', 'optimization', 'algorithm', 'to', 'directly', 'optimize', 'the', 'expected', 'error', 'and', 'the', 'auc', 'in', 'the', 'case', 'of', 'real', 'data', 'sets', 'the', 'derivatives', 'can', 'be', 'approximated', 'using', 'empirical', 'moments', 'we', 'show', 'that', 'even', 'when', 'data', 'is', 'not', 'normally', 'distributed', 'computed', 'derivatives', 'are', 'sufficiently', 'useful', 'to', 'render', 'an', 'efficient', 'optimization', 'method', 'and', 'high', 'quality', 'solutions', 'thus', 'we', 'propose', 'a', 'gradientbased', 'optimization', 'method', 'for', 'direct', 'optimization', 'of', 'the', 'prediction', 'error', 'and', 'auc', 'moreover', 'the', 'periteration', 'complexity', 'of', 'the', 'proposed', 'algorithm', 'has', 'no', 'dependence', 'on', 'the', 'size', 'of', 'the', 'data', 'set', 'unlike', 'those', 'for', 'optimizing', 'logistic', 'regression', 'and', 'all', 'other', 'well', 'known', 'empirical', 'risk', 'minimization', 'problems']] | [-0.06939661977481056, -0.008378654757402952, -0.08732904978983913, 0.12881722426104938, -0.05501002623493493, -0.1338972337200444, 0.05070897403982331, 0.41494447673426665, -0.26968998250791987, -0.30613913174649915, 0.15252443707003457, -0.28006379856521907, -0.1698463768726902, 0.2346271006504959, -0.09759436530771008, 0.1349084732641817, 0.06199348249785663, 0.06678137309146953, -0.12008572408030588, -0.31780531833360554, 0.2903384743616191, 0.03767689955363539, 0.3175368369060767, 0.02263580103162447, 0.103290659938958, -0.018336471009877373, 0.015656874247933508, 0.02064215740929434, -0.0868581669594695, 0.16556322539500037, 0.2586611138801837, 0.1758343724621704, 0.3129212460022603, -0.3844581223799099, -0.20374215678617236, 0.16390914163913875, 0.1194421080891501, 0.03790321589980015, -0.018376940460868473, -0.22988254300482786, 0.06845303077620958, -0.1185587004798495, -0.06039140465217032, -0.12901118413552826, -0.04151803367107068, 0.06872765461391327, -0.3399442984172922, 0.10323354874863519, 0.03673730642734225, 0.06911252720613552, -0.08543194728411092, -0.1784053042447042, -0.004936285779742738, 0.09532715986147866, 0.09775797524355871, 0.036828205327228566, 0.11057470425783053, -0.12405668136894657, -0.08590760174947867, 0.3501980824235705, -0.07575237844759583, -0.2640413698381515, 0.139086682731133, -0.10894427673326286, -0.09417690503407178, 0.1354364958599378, 0.2208326327634525, 0.13334794488323273, -0.1669635096643374, 0.058132371179364456, -0.006988336733870636, 0.14110214534868318, 0.02539903965404593, -0.004225048083395957, 0.12834136332308904, 0.13296839056706408, 0.09191720628181518, 0.12062759805956405, -0.0904075128014856, -0.0940175966739456, -0.2880517809659426, -0.13337861055691466, -0.21527166592890443, -0.0013320081356529253, -0.12462351156691362, -0.18571483300422456, 0.36051456094814893, 0.12841472594777398, 0.18423798715611767, 0.15787323644493523, 0.33383936032301703, 0.16830569177921564, 0.05985430564223712, 0.10925617183703686, 0.24554475793256195, 0.04496077565022088, 0.026948797094757806, -0.18613195026779575, 0.16494204926678574, 0.017082689120052535] |
1,802.02536 | Low-Frequency Noise and Sliding of the Charge Density Waves in
Two-Dimensional Materials | There has been a recent renewal of interest in charge-density-wave (CDW)
phenomena, primarily driven by the emergence of two-dimensional (2D) layered
CDW materials, such as 1T-TaS2, characterized by very high transition
temperatures to CDW phases. In the extensively studied classical bulk CDW
materials with quasi-1D crystal structure, the charge carrier transport
exhibits intriguing sliding behavior, which reveals itself in the frequency
domain as "narrowband" and "broadband" noise. Despite the increasing attention
on physics of 2D CDWs, there have been few reports of CDW sliding, specifically
in quasi-2D rare-earth tritellurides and none on the noise in any of 2D CDW
systems. Here we report the results of low-frequency noise (LFN) measurements
on 1T-TaS2 thin films - archetypal 2D CDW systems, as they are driven from the
nearly commensurate (NC) to incommensurate (IC) CDW phases by voltage and
temperature stimuli. We have found that noise in 1T-TaS2 devices has two
pronounced maxima at the bias voltages, which correspond to the onset of CDW
sliding and the NC-to-IC phase transition. We observed unusual Lorentzian noise
features and exceptionally strong noise dependence on electric bias and
temperature. We argue that LFN in 2D CDW systems has unique physical origin,
different from known fundamental noise types. The specifics of LFN in 2D CDW
materials can be explained by invoking the concept of interacting discrete
fluctuators in the NC-CDW phase. Noise spectroscopy can serve as a useful tool
for understanding electronic transport phenomena in 2D CDW materials
characterized by coexistence of different phases and strong CDW pinning.
| cond-mat.mes-hall cond-mat.mtrl-sci cond-mat.str-el | there has been a recent renewal of interest in chargedensitywave cdw phenomena primarily driven by the emergence of twodimensional 2d layered cdw materials such as 1ttas2 characterized by very high transition temperatures to cdw phases in the extensively studied classical bulk cdw materials with quasi1d crystal structure the charge carrier transport exhibits intriguing sliding behavior which reveals itself in the frequency domain as narrowband and broadband noise despite the increasing attention on physics of 2d cdws there have been few reports of cdw sliding specifically in quasi2d rareearth tritellurides and none on the noise in any of 2d cdw systems here we report the results of lowfrequency noise lfn measurements on 1ttas2 thin films archetypal 2d cdw systems as they are driven from the nearly commensurate nc to incommensurate ic cdw phases by voltage and temperature stimuli we have found that noise in 1ttas2 devices has two pronounced maxima at the bias voltages which correspond to the onset of cdw sliding and the nctoic phase transition we observed unusual lorentzian noise features and exceptionally strong noise dependence on electric bias and temperature we argue that lfn in 2d cdw systems has unique physical origin different from known fundamental noise types the specifics of lfn in 2d cdw materials can be explained by invoking the concept of interacting discrete fluctuators in the nccdw phase noise spectroscopy can serve as a useful tool for understanding electronic transport phenomena in 2d cdw materials characterized by coexistence of different phases and strong cdw pinning | [['there', 'has', 'been', 'a', 'recent', 'renewal', 'of', 'interest', 'in', 'chargedensitywave', 'cdw', 'phenomena', 'primarily', 'driven', 'by', 'the', 'emergence', 'of', 'twodimensional', '2d', 'layered', 'cdw', 'materials', 'such', 'as', '1ttas2', 'characterized', 'by', 'very', 'high', 'transition', 'temperatures', 'to', 'cdw', 'phases', 'in', 'the', 'extensively', 'studied', 'classical', 'bulk', 'cdw', 'materials', 'with', 'quasi1d', 'crystal', 'structure', 'the', 'charge', 'carrier', 'transport', 'exhibits', 'intriguing', 'sliding', 'behavior', 'which', 'reveals', 'itself', 'in', 'the', 'frequency', 'domain', 'as', 'narrowband', 'and', 'broadband', 'noise', 'despite', 'the', 'increasing', 'attention', 'on', 'physics', 'of', '2d', 'cdws', 'there', 'have', 'been', 'few', 'reports', 'of', 'cdw', 'sliding', 'specifically', 'in', 'quasi2d', 'rareearth', 'tritellurides', 'and', 'none', 'on', 'the', 'noise', 'in', 'any', 'of', '2d', 'cdw', 'systems', 'here', 'we', 'report', 'the', 'results', 'of', 'lowfrequency', 'noise', 'lfn', 'measurements', 'on', '1ttas2', 'thin', 'films', 'archetypal', '2d', 'cdw', 'systems', 'as', 'they', 'are', 'driven', 'from', 'the', 'nearly', 'commensurate', 'nc', 'to', 'incommensurate', 'ic', 'cdw', 'phases', 'by', 'voltage', 'and', 'temperature', 'stimuli', 'we', 'have', 'found', 'that', 'noise', 'in', '1ttas2', 'devices', 'has', 'two', 'pronounced', 'maxima', 'at', 'the', 'bias', 'voltages', 'which', 'correspond', 'to', 'the', 'onset', 'of', 'cdw', 'sliding', 'and', 'the', 'nctoic', 'phase', 'transition', 'we', 'observed', 'unusual', 'lorentzian', 'noise', 'features', 'and', 'exceptionally', 'strong', 'noise', 'dependence', 'on', 'electric', 'bias', 'and', 'temperature', 'we', 'argue', 'that', 'lfn', 'in', '2d', 'cdw', 'systems', 'has', 'unique', 'physical', 'origin', 'different', 'from', 'known', 'fundamental', 'noise', 'types', 'the', 'specifics', 'of', 'lfn', 'in', '2d', 'cdw', 'materials', 'can', 'be', 'explained', 'by', 'invoking', 'the', 'concept', 'of', 'interacting', 'discrete', 'fluctuators', 'in', 'the', 'nccdw', 'phase', 'noise', 'spectroscopy', 'can', 'serve', 'as', 'a', 'useful', 'tool', 'for', 'understanding', 'electronic', 'transport', 'phenomena', 'in', '2d', 'cdw', 'materials', 'characterized', 'by', 'coexistence', 'of', 'different', 'phases', 'and', 'strong', 'cdw', 'pinning']] | [-0.20810631953411732, 0.2280627948261917, -0.04734204894765823, 0.016779741341524934, -0.03310523839689881, -0.16447232669802853, 0.07760249213553988, 0.4146231027192859, -0.25067005105256795, -0.24567332460608587, 0.026972927777031176, -0.3194439729683131, -0.21411650951289718, 0.17283000696046524, 0.016254422540989626, 0.05647370495074185, -0.10707547832804033, -0.08717300496311918, -0.11828635716352642, -0.17270923864066481, 0.29413276820080764, -0.01576958456259954, 0.357487921930296, 0.03435211276530801, 0.048765506440970906, -0.037053678962719966, 0.09214545376121953, 0.041374575814239714, -0.16100118483677853, -0.03766372247625247, 0.32579362057205513, -0.1146065733904191, 0.2155669696253152, -0.472882787233226, -0.3073557776821605, 0.001181913377533865, 0.14407264437417996, 0.13229587802244538, -0.10830749345891436, -0.309031394123283, 0.05390890728940357, -0.12353663413923788, -0.0838737450282339, -0.09748704483625983, 0.010701578385364938, 0.055374323653176905, -0.18717340499501167, 0.15879098017630822, 0.06930988131209752, 0.10538327919658992, -0.1125930943519899, -0.1151464112602309, -0.06521352882923401, 0.0519430896466697, 0.04957554442995045, 0.056834876949685705, 0.15965698032191558, -0.138540730701435, -0.13910117482506562, 0.35387929851735334, -0.03497512980895379, -0.05468562414662082, 0.22239261028968382, -0.21122460297034654, -0.08778717030161416, 0.21383977244443533, 0.11429865273481504, 0.011552879637776759, -0.11660946524177443, 0.027460121922054697, 0.01610012185651375, 0.1967045044691029, 0.07046975594305668, 0.15918682161512893, 0.29457240391066336, 0.2584434573849042, 0.019944811739162148, 0.12370040995512067, -0.12155586697023743, -0.026062735640357368, -0.17338135320857825, -0.11284191765795354, -0.25007108080548696, 0.05261713924984182, -0.03907121007919104, -0.21199725309282122, 0.41673709169389256, 0.17512380877948258, 0.16667172973825928, -0.12671371531227685, 0.22877303555413303, 0.10516073970716955, 0.05592160662037721, -0.004680137810202402, 0.23660178707976148, 0.14972051802973999, 0.1707843860984059, -0.23076617097609253, 0.10741247238926066, -0.007344848448415306] |
1,802.02537 | Minimally modified theories of gravity: a playground for testing the
uniqueness of general relativity | In a recent paper [1], it was introduced a new class of gravitational
theories with two local degrees of freedom. The existence of these theories
apparently challenges the distinctive role of general relativity as the unique
non-linear theory of massless spin-2 particles. Here we perform a comprehensive
analysis of these theories with the aim of (i) understanding whether or not
these are actually equivalent to general relativity, and (ii) finding the root
of the variance in case these are not. We have found that a broad set of
seemingly different theories actually pass all the possible tests of
equivalence to general relativity (in vacuum) that we were able to devise,
including the analysis of scattering amplitudes using on-shell techniques.
These results are complemented with the observation that the only examples
which are manifestly not equivalent to general relativity either do not contain
gravitons in their spectrum, or are not guaranteed to include only two local
degrees of freedom once radiative corrections are taken into account. Coupling
to matter is also considered: we show that coupling these theories to matter in
a consistent way is not as straightforward as one could expect. Minimal
coupling, as well as the most straightforward non-minimal couplings, cannot be
used. Therefore, before being able to address any issues in the presence of
matter, it would be necessary to find a consistent (and in any case rather
peculiar) coupling scheme.
| gr-qc hep-th | in a recent paper 1 it was introduced a new class of gravitational theories with two local degrees of freedom the existence of these theories apparently challenges the distinctive role of general relativity as the unique nonlinear theory of massless spin2 particles here we perform a comprehensive analysis of these theories with the aim of i understanding whether or not these are actually equivalent to general relativity and ii finding the root of the variance in case these are not we have found that a broad set of seemingly different theories actually pass all the possible tests of equivalence to general relativity in vacuum that we were able to devise including the analysis of scattering amplitudes using onshell techniques these results are complemented with the observation that the only examples which are manifestly not equivalent to general relativity either do not contain gravitons in their spectrum or are not guaranteed to include only two local degrees of freedom once radiative corrections are taken into account coupling to matter is also considered we show that coupling these theories to matter in a consistent way is not as straightforward as one could expect minimal coupling as well as the most straightforward nonminimal couplings cannot be used therefore before being able to address any issues in the presence of matter it would be necessary to find a consistent and in any case rather peculiar coupling scheme | [['in', 'a', 'recent', 'paper', '1', 'it', 'was', 'introduced', 'a', 'new', 'class', 'of', 'gravitational', 'theories', 'with', 'two', 'local', 'degrees', 'of', 'freedom', 'the', 'existence', 'of', 'these', 'theories', 'apparently', 'challenges', 'the', 'distinctive', 'role', 'of', 'general', 'relativity', 'as', 'the', 'unique', 'nonlinear', 'theory', 'of', 'massless', 'spin2', 'particles', 'here', 'we', 'perform', 'a', 'comprehensive', 'analysis', 'of', 'these', 'theories', 'with', 'the', 'aim', 'of', 'i', 'understanding', 'whether', 'or', 'not', 'these', 'are', 'actually', 'equivalent', 'to', 'general', 'relativity', 'and', 'ii', 'finding', 'the', 'root', 'of', 'the', 'variance', 'in', 'case', 'these', 'are', 'not', 'we', 'have', 'found', 'that', 'a', 'broad', 'set', 'of', 'seemingly', 'different', 'theories', 'actually', 'pass', 'all', 'the', 'possible', 'tests', 'of', 'equivalence', 'to', 'general', 'relativity', 'in', 'vacuum', 'that', 'we', 'were', 'able', 'to', 'devise', 'including', 'the', 'analysis', 'of', 'scattering', 'amplitudes', 'using', 'onshell', 'techniques', 'these', 'results', 'are', 'complemented', 'with', 'the', 'observation', 'that', 'the', 'only', 'examples', 'which', 'are', 'manifestly', 'not', 'equivalent', 'to', 'general', 'relativity', 'either', 'do', 'not', 'contain', 'gravitons', 'in', 'their', 'spectrum', 'or', 'are', 'not', 'guaranteed', 'to', 'include', 'only', 'two', 'local', 'degrees', 'of', 'freedom', 'once', 'radiative', 'corrections', 'are', 'taken', 'into', 'account', 'coupling', 'to', 'matter', 'is', 'also', 'considered', 'we', 'show', 'that', 'coupling', 'these', 'theories', 'to', 'matter', 'in', 'a', 'consistent', 'way', 'is', 'not', 'as', 'straightforward', 'as', 'one', 'could', 'expect', 'minimal', 'coupling', 'as', 'well', 'as', 'the', 'most', 'straightforward', 'nonminimal', 'couplings', 'can', 'not', 'be', 'used', 'therefore', 'before', 'being', 'able', 'to', 'address', 'any', 'issues', 'in', 'the', 'presence', 'of', 'matter', 'it', 'would', 'be', 'necessary', 'to', 'find', 'a', 'consistent', 'and', 'in', 'any', 'case', 'rather', 'peculiar', 'coupling', 'scheme']] | [-0.1157855020585255, 0.14212055548898175, -0.08738912817918593, 0.10511083050599146, -0.1101873734444539, -0.17446896203586626, -0.011708359464378152, 0.3551355494508663, -0.22119544674771735, -0.3187926998481346, 0.08498398206941983, -0.24679567121789178, -0.14841264890084982, 0.1698681745557791, -0.0418468600907164, 0.015679594525832556, 0.02513367917565788, 0.04237311859177346, -0.05813518077414682, -0.2609475501678669, 0.32322385284649685, 0.032080000558963574, 0.20578575940428573, 0.052660820336065166, 0.05310940021314682, -0.032078573116077445, -0.02472674817022963, 0.08092273216750313, -0.09668764094167895, 0.08114351511188647, 0.24562467935094093, 0.1300001344220657, 0.23469666334895942, -0.444225808709032, -0.21816928496456936, 0.12499949026904586, 0.16396457996442276, 0.16135013752973154, -0.023498838441180572, -0.24645828505834708, 0.07788644505577146, -0.16059962252123106, -0.14631431187208518, -0.12204844198133956, -0.02551164548907779, -0.033567944205262594, -0.23676051301921472, 0.07022357566078676, 0.05928737160194522, -0.0032839667704752367, -0.03245982662754723, -0.08605411561986065, -0.025236836964917235, 0.10558213647773378, 0.10363163248412947, 0.0035068871648424966, 0.08527775923621991, -0.1320679077319403, -0.11535062735231641, 0.43425670897679675, -0.05762422967201664, -0.22331675781438556, 0.23784341497155717, -0.1585513537403387, -0.17939982866932058, 0.11562911047337529, 0.1341877683395675, 0.1423933961404822, -0.1757578789933115, 0.07449744522529773, -0.03024777152344712, 0.1597767280624646, 0.04019615823466681, 0.08621796744409949, 0.2679253230766895, 0.07497625971714464, 0.023175730909276594, 0.06917260552191326, -0.020528758856125623, -0.09394705528219262, -0.39183106431817144, -0.13303883024018742, -0.12152633480041121, 0.06382141025252112, -0.04749993152872154, -0.15228945196888052, 0.3599097496690098, 0.17422636415367612, 0.14953014508494708, 0.04501266641050784, 0.2513576745598887, 0.08998390191497578, 0.1057177896076081, 0.0520455573235726, 0.33128259627150497, 0.12834796764585388, 0.04120877476878719, -0.1704309559093876, 0.01741407411501337, 0.02879854663112002] |
1,802.02538 | Yes, but Did It Work?: Evaluating Variational Inference | While it's always possible to compute a variational approximation to a
posterior distribution, it can be difficult to discover problems with this
approximation. We propose two diagnostic algorithms to alleviate this problem.
The Pareto-smoothed importance sampling (PSIS) diagnostic gives a goodness of
fit measurement for joint distributions, while simultaneously improving the
error in the estimate. The variational simulation-based calibration (VSBC)
assesses the average performance of point estimates.
| stat.ML stat.CO | while its always possible to compute a variational approximation to a posterior distribution it can be difficult to discover problems with this approximation we propose two diagnostic algorithms to alleviate this problem the paretosmoothed importance sampling psis diagnostic gives a goodness of fit measurement for joint distributions while simultaneously improving the error in the estimate the variational simulationbased calibration vsbc assesses the average performance of point estimates | [['while', 'its', 'always', 'possible', 'to', 'compute', 'a', 'variational', 'approximation', 'to', 'a', 'posterior', 'distribution', 'it', 'can', 'be', 'difficult', 'to', 'discover', 'problems', 'with', 'this', 'approximation', 'we', 'propose', 'two', 'diagnostic', 'algorithms', 'to', 'alleviate', 'this', 'problem', 'the', 'paretosmoothed', 'importance', 'sampling', 'psis', 'diagnostic', 'gives', 'a', 'goodness', 'of', 'fit', 'measurement', 'for', 'joint', 'distributions', 'while', 'simultaneously', 'improving', 'the', 'error', 'in', 'the', 'estimate', 'the', 'variational', 'simulationbased', 'calibration', 'vsbc', 'assesses', 'the', 'average', 'performance', 'of', 'point', 'estimates']] | [-0.010767632784942785, -0.01820906300351701, -0.13406356908098765, 0.1582089431238163, -0.0912392518878209, -0.14708449771260898, 0.12723851215207216, 0.39131769518170395, -0.2838429852925015, -0.37324697795239364, 0.07580374230482531, -0.23234452586621046, -0.08798146443741368, 0.15530780427665872, -0.12196968677877025, 0.12532038938617474, 0.10139843470868513, -0.02351004487806649, -0.12509661098804578, -0.23962331762198696, 0.22041932410193663, 0.10426232530594323, 0.3229734624601957, 0.030831852426865335, 0.10884262435138226, -0.0015009060276277137, -0.03827080976528426, -0.007042183807105616, -0.17031210431984314, 0.16475630779997585, 0.2818779673420288, 0.19846550164970034, 0.34638547270107223, -0.3028749162445875, -0.21332966704203776, 0.17981781292650284, 0.18133295862229937, 0.07796828208180766, -0.0007599737463434311, -0.23454104784424556, 0.06027176440693438, -0.15058456037447535, -0.12466381388631734, -0.12151299250509703, -0.06335541722364724, 0.00327392057057075, -0.3587666377425194, 0.08667705183016193, 0.0019855523185635156, -0.0038267706069305086, -0.03651671981700047, -0.13521888972415277, 0.09190103559486681, 0.14384908353994516, 0.0701531010016686, 0.06387172115148243, 0.08268346945811628, -0.12430359995359498, -0.09694046649912541, 0.3606752614123803, -0.040599233442635246, -0.267828824393677, 0.13223483589139173, -0.0863376021610968, -0.15725676221667195, 0.10927830808654879, 0.19607960599982602, 0.10092517897260911, -0.18565298501176364, 0.01684402555904605, 0.024703153195635725, 0.1250018453473317, -0.005843031100195014, -0.04086517189826929, 0.14481508379421112, 0.16046950985875094, 0.13867127051520528, 0.15903612406338763, -0.16303260019049048, -0.09120952298557809, -0.2576802472414618, -0.14279314080450797, -0.18843152156720558, 0.001533028937763337, -0.12474346806464548, -0.21632606300497145, 0.40357212339542015, 0.24244734142187305, 0.21217300648321258, 0.11346590385602956, 0.3670474727722732, 0.15074242691149597, -0.005559205235895757, 0.07635672104008721, 0.26412541632695746, 0.11266056174468814, 0.0128487471603986, -0.2076532402345699, 0.13843170896341855, 0.051838066704063254] |
1,802.02539 | Multiple positive bound states for critical Schr\"odinger-Poisson
systems | Using variational methods we prove some results about existence and
multiplicity of positive bound states of to the following Schr\"odinger-Poisson
system: $$ \left\{ \begin{array}{l} \vspace{2mm} -\Delta
u+V(x)u+K(x)\phi(x)u=u^5 -\Delta \phi =K(x)u^2\qquad x\in\R^3
\end{array}\right.\quad\quad (SP) $$ We remark that $(SP)$ exhibits a "double"
lack of compactness because of the unboundedness of $\R^3$ and the critical
growth of the nonlinear term and that in our assumptions ground state solutions
of $(SP)$ do not exist.
| math.AP | using variational methods we prove some results about existence and multiplicity of positive bound states of to the following schrodingerpoisson system left beginarrayl vspace2mm delta uvxukxphixuu5 delta phi kxu2qquad xinr3 endarrayrightquadquad sp we remark that sp exhibits a double lack of compactness because of the unboundedness of r3 and the critical growth of the nonlinear term and that in our assumptions ground state solutions of sp do not exist | [['using', 'variational', 'methods', 'we', 'prove', 'some', 'results', 'about', 'existence', 'and', 'multiplicity', 'of', 'positive', 'bound', 'states', 'of', 'to', 'the', 'following', 'schrodingerpoisson', 'system', 'left', 'beginarrayl', 'vspace2mm', 'delta', 'uvxukxphixuu5', 'delta', 'phi', 'kxu2qquad', 'xinr3', 'endarrayrightquadquad', 'sp', 'we', 'remark', 'that', 'sp', 'exhibits', 'a', 'double', 'lack', 'of', 'compactness', 'because', 'of', 'the', 'unboundedness', 'of', 'r3', 'and', 'the', 'critical', 'growth', 'of', 'the', 'nonlinear', 'term', 'and', 'that', 'in', 'our', 'assumptions', 'ground', 'state', 'solutions', 'of', 'sp', 'do', 'not', 'exist']] | [-0.17172790641108385, 0.06902275330458696, -0.09650187720186436, 0.09322588285073065, -0.05742236630847821, -0.14714162796019362, 0.036868481524288656, 0.2956093846963575, -0.2789356879889965, -0.2523777114227414, 0.11739645204685915, -0.3240697575876346, -0.1260092778561207, 0.1754725058652604, -0.03692388670662275, 0.04607975859768115, 0.0665954133352408, 0.0584435441925262, -0.09632803041380472, -0.2043169726832555, 0.366104017284054, -0.10914728448797877, 0.18644416307887204, 0.11909201096456784, 0.07121119239152623, -0.008045032158350715, 0.10559697214227456, -0.012264107103244616, -0.18939623811322515, 0.1284086814105439, 0.16837844256526577, 0.1397078092675656, 0.3062593617404883, -0.41061653287078326, -0.15458317818836523, 0.1370914334574571, 0.13422297660547952, 0.026933451183140278, -0.04435551228503195, -0.279752005980565, 0.15546280162122386, -0.09678587780262415, -0.18660740229086234, -0.08241919223219156, 0.043363796905256234, 0.0841755657716511, -0.27510476139588996, 0.1356220508997257, 0.16475835544630313, 0.01774147517907505, -0.12708412797835011, -0.16021198613676602, -0.059301134784562656, 0.06006402588234498, 0.09359754217931858, 0.03069146396413159, 0.014822085473973018, -0.14553287276425042, -0.08157077863669167, 0.31944790817797186, -0.10365526618507619, -0.19488572227285028, 0.16985650794723858, -0.1759813642451683, -0.13633199842789998, 0.08472897791518615, 0.09422376201523898, 0.11751044607506349, -0.07138600691866416, 0.15087735419107887, -0.06367060686103426, 0.21278058565579927, 0.08449995883453924, 0.05076129212975502, 0.070233379297245, 0.12596139621276123, 0.13988393858666173, 0.05452151431773718, -0.06787002115295483, -0.11068807468713762, -0.3413206233428075, -0.16367788563500374, -0.13761847804372127, 0.1100470296360212, -0.048227779143892875, -0.1970096132503106, 0.3657883707577219, 0.11986261004528317, 0.16179274966797003, 0.040749217856388825, 0.16699486065369387, 0.15812686181877955, -0.028696057114463585, 0.10107666722391374, 0.23040079313482587, 0.12866697396653204, 0.0938818488843166, -0.2727301560185599, 0.02541479214022939, 0.07424542475491762] |
1,802.0254 | Molecular Regulation of Histamine Synthesis | Histamine is a critical mediator of IgE/ cell-mediated anaphylaxis, a
neurotransmitter and a regulator of gastric acid secretion. Histamine is a
monoamine synthesized from the amino acid histidine through a reaction
catalyzed by the enzyme histidine decarboxylase (HDC), which removes carboxyl
group from histidine. Despite the importance of histamine, transcriptional
regulation of HDC gene expression in mammals is still poorly understood. In
this Review, we focus on discussing advances in the understanding of molecular
regulation of mammalian histamine synthesis.
| q-bio.MN q-bio.GN | histamine is a critical mediator of ige cellmediated anaphylaxis a neurotransmitter and a regulator of gastric acid secretion histamine is a monoamine synthesized from the amino acid histidine through a reaction catalyzed by the enzyme histidine decarboxylase hdc which removes carboxyl group from histidine despite the importance of histamine transcriptional regulation of hdc gene expression in mammals is still poorly understood in this review we focus on discussing advances in the understanding of molecular regulation of mammalian histamine synthesis | [['histamine', 'is', 'a', 'critical', 'mediator', 'of', 'ige', 'cellmediated', 'anaphylaxis', 'a', 'neurotransmitter', 'and', 'a', 'regulator', 'of', 'gastric', 'acid', 'secretion', 'histamine', 'is', 'a', 'monoamine', 'synthesized', 'from', 'the', 'amino', 'acid', 'histidine', 'through', 'a', 'reaction', 'catalyzed', 'by', 'the', 'enzyme', 'histidine', 'decarboxylase', 'hdc', 'which', 'removes', 'carboxyl', 'group', 'from', 'histidine', 'despite', 'the', 'importance', 'of', 'histamine', 'transcriptional', 'regulation', 'of', 'hdc', 'gene', 'expression', 'in', 'mammals', 'is', 'still', 'poorly', 'understood', 'in', 'this', 'review', 'we', 'focus', 'on', 'discussing', 'advances', 'in', 'the', 'understanding', 'of', 'molecular', 'regulation', 'of', 'mammalian', 'histamine', 'synthesis']] | [-0.10390368588994463, 0.13499743971586614, 0.03547416901625632, 0.024854265616045562, 0.01307662447019444, -0.1229838919462999, 0.12447435321745934, 0.3549943868699786, -0.23168757566335527, -0.21950910367410292, 0.03548832508197127, -0.24289799675756654, -0.2961573226062895, 0.14243664814373963, -0.12429709180996015, -0.09181793510623566, 0.050940034781014186, 0.03804851081464198, 0.13091331945925758, -0.11141868231987412, 0.1942562532092236, 0.09216180843506734, 0.24871787971321058, 0.08175348126716525, 0.14714651672145376, -0.08819862984894931, -0.009962130528451367, -0.12514236735712206, -0.12118625443719037, 0.21154579704448992, 0.31186414650314814, 0.154603911122283, 0.3056925959981881, -0.44663498603871893, -0.24708981316101242, 0.06972067235884341, 0.1664752053435553, 0.1637724747067898, -0.1320323362763572, -0.22194720859724013, 0.07884112563492222, -0.13590930519601355, -0.010917948302661686, -0.014066021644522423, 0.007279936608241557, 0.06842477543070888, -0.1997120449933308, 0.15417452774074097, -0.006889683570918422, 0.20779843085336608, -0.13756654541576643, -0.1900459618727955, -0.12261444060494761, 0.1901522220184954, 0.06578329693247842, 0.02291045107390405, 0.33248726047527094, -0.1457505038207663, -0.03816394635488267, 0.34453477347632505, -0.03263679648713245, -0.12936112824101725, 0.15529530470610245, -0.07918769387866963, -0.25161219018136527, 0.15710141137242317, 0.0723456721752882, 0.14346422848908544, -0.2654132287731612, 0.058706966990018386, 0.029502388767220757, 0.21534994428723372, 0.13937151537869463, -0.08591507386125914, 0.1760084488876648, 0.27217959906518846, -0.06376775418250978, 0.11233439384173456, -0.01234296971913911, -0.08070723182678997, -0.14124340253470877, -0.16732326477642062, -0.0724876536530376, 0.1259605680553049, -0.01003605493192422, -0.132484920685748, 0.35469944663829617, 0.03261380644769154, 0.14821147827987935, 0.024331489912016536, 0.21168134753386697, -0.058266182309137535, 0.13309970762362922, -0.09611792653774867, 0.12770198016463744, 0.14511040144890255, 0.059411197247636785, -0.3505944651370118, 0.23872726219524812, 0.05353215391227564] |
1,802.02541 | A Morphing Continuum Analysis of Energy Transfer in Compressible
Turbulence | A shock-preserving finite volume solver with the generalized Lax-Friedrichs
splitting flux for Morphing Continuum Theory (MCT) is presented and verified.
The numerical MCT solver is showcased in a supersonic turbulent flow with Mach
2.93 over an $8^{\circ}$ compression ramp. The simulation results validated MCT
with experiments as an alternative for modeling compressible turbulence. The
required size of the smallest mesh cell for the MCT simulation is shown to be
almost an order larger than that in a similar DNS study. The comparison shows
MCT is a much more computationally friendly theory than the classical NS
equations. The dynamics of energy cascade at the length-scale of individual
eddies is illuminated through the subscale rotation introduced by MCT. In this
regard, MCT provides a statistical averaging procedure for capturing energy
transfer in compressible turbulence, not found in classical fluid theories.
Analysis of the MCT results show the existence of a statistical coupling of the
internal and translational kinetic energy fluctuations with the corresponding
eddy rotational energy fluctuations, indicating a multiscale transfer of
energy. In conclusion, MCT gives a new characterization of the energy cascade
within compressible turbulence without the use of excessive computational
resources.
| physics.flu-dyn | a shockpreserving finite volume solver with the generalized laxfriedrichs splitting flux for morphing continuum theory mct is presented and verified the numerical mct solver is showcased in a supersonic turbulent flow with mach 293 over an 8circ compression ramp the simulation results validated mct with experiments as an alternative for modeling compressible turbulence the required size of the smallest mesh cell for the mct simulation is shown to be almost an order larger than that in a similar dns study the comparison shows mct is a much more computationally friendly theory than the classical ns equations the dynamics of energy cascade at the lengthscale of individual eddies is illuminated through the subscale rotation introduced by mct in this regard mct provides a statistical averaging procedure for capturing energy transfer in compressible turbulence not found in classical fluid theories analysis of the mct results show the existence of a statistical coupling of the internal and translational kinetic energy fluctuations with the corresponding eddy rotational energy fluctuations indicating a multiscale transfer of energy in conclusion mct gives a new characterization of the energy cascade within compressible turbulence without the use of excessive computational resources | [['a', 'shockpreserving', 'finite', 'volume', 'solver', 'with', 'the', 'generalized', 'laxfriedrichs', 'splitting', 'flux', 'for', 'morphing', 'continuum', 'theory', 'mct', 'is', 'presented', 'and', 'verified', 'the', 'numerical', 'mct', 'solver', 'is', 'showcased', 'in', 'a', 'supersonic', 'turbulent', 'flow', 'with', 'mach', '293', 'over', 'an', '8circ', 'compression', 'ramp', 'the', 'simulation', 'results', 'validated', 'mct', 'with', 'experiments', 'as', 'an', 'alternative', 'for', 'modeling', 'compressible', 'turbulence', 'the', 'required', 'size', 'of', 'the', 'smallest', 'mesh', 'cell', 'for', 'the', 'mct', 'simulation', 'is', 'shown', 'to', 'be', 'almost', 'an', 'order', 'larger', 'than', 'that', 'in', 'a', 'similar', 'dns', 'study', 'the', 'comparison', 'shows', 'mct', 'is', 'a', 'much', 'more', 'computationally', 'friendly', 'theory', 'than', 'the', 'classical', 'ns', 'equations', 'the', 'dynamics', 'of', 'energy', 'cascade', 'at', 'the', 'lengthscale', 'of', 'individual', 'eddies', 'is', 'illuminated', 'through', 'the', 'subscale', 'rotation', 'introduced', 'by', 'mct', 'in', 'this', 'regard', 'mct', 'provides', 'a', 'statistical', 'averaging', 'procedure', 'for', 'capturing', 'energy', 'transfer', 'in', 'compressible', 'turbulence', 'not', 'found', 'in', 'classical', 'fluid', 'theories', 'analysis', 'of', 'the', 'mct', 'results', 'show', 'the', 'existence', 'of', 'a', 'statistical', 'coupling', 'of', 'the', 'internal', 'and', 'translational', 'kinetic', 'energy', 'fluctuations', 'with', 'the', 'corresponding', 'eddy', 'rotational', 'energy', 'fluctuations', 'indicating', 'a', 'multiscale', 'transfer', 'of', 'energy', 'in', 'conclusion', 'mct', 'gives', 'a', 'new', 'characterization', 'of', 'the', 'energy', 'cascade', 'within', 'compressible', 'turbulence', 'without', 'the', 'use', 'of', 'excessive', 'computational', 'resources']] | [-0.1302947531382953, 0.13532158609926737, -0.1354637279828001, 0.07654074944082784, -0.025184731455080954, -0.10063806420962536, -0.03976140227485741, 0.2903517572189735, -0.26729904803696103, -0.2981816496211226, 0.04227933360212507, -0.21135546100394148, -0.08514218405498611, 0.21334059278027237, 0.010714275239484082, 0.0797270487186972, 0.0637558186304858, -0.017706043696450312, -0.04979179763961681, -0.13244271442764657, 0.23482076832229218, 0.12851814401679776, 0.31533685283910934, 0.03482172947257504, 0.10475881150509206, -0.0880533964120227, -0.0481838196935376, 0.077983134206755, -0.1816873994270167, 0.06379304391317342, 0.22092427385127397, 0.02751425397582352, 0.3018814337327686, -0.4384043308301629, -0.29206752175884565, 0.009972698473327681, 0.14824712026318174, 0.12270769574411253, -0.003955093655916277, -0.24503445670774196, 0.09349386171128171, -0.19139849814630225, -0.1152123646415692, -0.07621115590817495, -0.006171539747668186, 0.015315609834161806, -0.27359305889984464, 0.14220113193290795, 0.04936627022975675, 0.11270733357099963, -0.057750655486887195, -0.07523468992653357, -0.044227290958902404, 0.04188296884049647, 0.06285197593769087, 0.01568131956408356, 0.13931209021686766, -0.15670568138941227, -0.07402139158519619, 0.4061195584140835, -0.04254754241059183, -0.2277069774295413, 0.22837304365845562, -0.11237508829205214, -0.059329108176606644, 0.23448718387843231, 0.11020159918366303, 0.07160649492273702, -0.08944360972004235, 0.04183893127266942, -0.05689152581519715, 0.22834525571975137, 0.033540491846082876, -0.059651032226716035, 0.15847153460402139, 0.2488765376985697, 0.03867525576140868, 0.11593511881927243, -0.09325766442246072, -0.16708653448490884, -0.31206739993512395, -0.16340059689758102, -0.19769343725620178, 0.05812129690209757, -0.1270409480847494, -0.16431757470843364, 0.34072599244421026, 0.14986961253209244, 0.1276369577917363, 0.10237922553943363, 0.3222347595594843, 0.12887725989999865, 0.03444380640827548, 0.14225050153854396, 0.2584928850501932, 0.17490378443848986, 0.14973484386302316, -0.2735166425965434, 0.013194728681710378, 0.10873810977721343] |
1,802.02542 | Disordered fermions, extra dimensions and a solvable Yang-Mills theory | Generalizing disorder couplings of the SYK model by means of SU(N) matrices
we formulate a lattice model of fermions in d+1 dimensions. Integration of
fermions yields an effective theory of Yang-Mills fields in d dimensions, the
latter approaching the standard Yang-Mills theory in the case of heavy fermions
and the classical limit of vanishing coupling constant of the theory. Quantum
mechanically, the theory is solved using large N approximation of the dual
effective theory of Hermitian matrices in d dimensions. The theory is
asymptotically free and confines the color. In case of massless fermions the
emerging theory is an asymptotic safe QCD theory. We discuss also the
relationship of this theory to the SYK model.
| hep-lat hep-th | generalizing disorder couplings of the syk model by means of sun matrices we formulate a lattice model of fermions in d1 dimensions integration of fermions yields an effective theory of yangmills fields in d dimensions the latter approaching the standard yangmills theory in the case of heavy fermions and the classical limit of vanishing coupling constant of the theory quantum mechanically the theory is solved using large n approximation of the dual effective theory of hermitian matrices in d dimensions the theory is asymptotically free and confines the color in case of massless fermions the emerging theory is an asymptotic safe qcd theory we discuss also the relationship of this theory to the syk model | [['generalizing', 'disorder', 'couplings', 'of', 'the', 'syk', 'model', 'by', 'means', 'of', 'sun', 'matrices', 'we', 'formulate', 'a', 'lattice', 'model', 'of', 'fermions', 'in', 'd1', 'dimensions', 'integration', 'of', 'fermions', 'yields', 'an', 'effective', 'theory', 'of', 'yangmills', 'fields', 'in', 'd', 'dimensions', 'the', 'latter', 'approaching', 'the', 'standard', 'yangmills', 'theory', 'in', 'the', 'case', 'of', 'heavy', 'fermions', 'and', 'the', 'classical', 'limit', 'of', 'vanishing', 'coupling', 'constant', 'of', 'the', 'theory', 'quantum', 'mechanically', 'the', 'theory', 'is', 'solved', 'using', 'large', 'n', 'approximation', 'of', 'the', 'dual', 'effective', 'theory', 'of', 'hermitian', 'matrices', 'in', 'd', 'dimensions', 'the', 'theory', 'is', 'asymptotically', 'free', 'and', 'confines', 'the', 'color', 'in', 'case', 'of', 'massless', 'fermions', 'the', 'emerging', 'theory', 'is', 'an', 'asymptotic', 'safe', 'qcd', 'theory', 'we', 'discuss', 'also', 'the', 'relationship', 'of', 'this', 'theory', 'to', 'the', 'syk', 'model']] | [-0.1417655369056814, 0.26007341611345863, -0.07358461059187033, 0.08195725515201364, 0.028922688199774078, -0.16912374394824323, 0.029758840788196288, 0.2648570314535628, -0.18786304178445234, -0.23018180548982775, 0.027040970580571373, -0.30258976442172475, -0.20371819454569207, 0.05831553355547721, -0.020853806404477877, 0.052741091050531555, -0.027424920751186816, 0.07674944334380004, -0.10827469752858514, -0.2865249208275877, 0.28356666239788353, 0.022389932024373633, 0.27437732614900756, 0.0840032662710418, 0.07485519345525814, 0.06378823223159365, 0.02318765086972195, 0.009423694613835087, -0.09557004011357607, 0.15822087578151536, 0.20138333450152499, 0.014496222936102877, 0.16989030519743328, -0.43553813927523466, -0.242124166307242, 0.05190299180052851, 0.1511325618900035, 0.14084038048496714, 0.008035423873883226, -0.2475083618424833, 0.05568836956973309, -0.184079961369381, -0.24743347018957138, -0.05949315462949807, -0.013930622937724643, -0.12520730875270522, -0.29924893243967193, 0.09219398046970247, 0.029583648240963076, 0.07388937219005565, -0.04932416522591982, -0.09519094793206971, 0.004894115484279135, 0.08934424433290311, 0.09749281045110167, 0.020754622425074164, 0.07437669564767377, -0.20506870922956455, -0.1475501971481287, 0.3929820860857549, -0.11794651936355006, -0.21589509498166, 0.16058869223393823, -0.12983469194125222, -0.10800491850418241, 0.05156815679662902, 0.11418669734798048, 0.18307343604771986, -0.1010572821225809, 0.29841715929847534, -0.09054298283451277, 0.12796670520759146, 0.047776803341896636, 0.04664848513405203, 0.20742381449950778, 0.1369689501012149, 0.042477076836740194, 0.12590197865324823, 0.009641511981254038, -0.20207092764422946, -0.3637728917857875, -0.14181132404660077, -0.19240810398174368, 0.10266877280588707, -0.19538512068633598, -0.20697203040446924, 0.3531925672908192, 0.16444395497269199, 0.13676603837343662, 0.05362212449798118, 0.21354571537155173, 0.1595220222502299, 0.03129409797206197, 0.03465752038780762, 0.23973966412165243, 0.25475084336029125, 0.05733365180861691, -0.23554422645222234, -0.1397866676784242, 0.19387084883435265] |
1,802.02543 | Self-stabilizing processes | We construct `self-stabilizing' processes {Z(t), t $\in [t_0,t_1)$}. These
are random processes which when `localized', that is scaled around t to a fine
limit, have the distribution of an $\alpha$(Z(t))-stable process, where
$\alpha$ is some given function on R. Thus the stability index at t depends on
the value of the process at t. Here we address the case where $\alpha$: R $\to$
(0,1). We first construct deterministic functions which satisfy a kind of
autoregressive property involving sums over a plane point set $\Pi$. Taking
$\Pi$ to be a Poisson point process then defines a random pure jump process,
which we show has the desired localized distributions.
| math.PR | we construct selfstabilizing processes zt t in t_0t_1 these are random processes which when localized that is scaled around t to a fine limit have the distribution of an alphaztstable process where alpha is some given function on r thus the stability index at t depends on the value of the process at t here we address the case where alpha r to 01 we first construct deterministic functions which satisfy a kind of autoregressive property involving sums over a plane point set pi taking pi to be a poisson point process then defines a random pure jump process which we show has the desired localized distributions | [['we', 'construct', 'selfstabilizing', 'processes', 'zt', 't', 'in', 't_0t_1', 'these', 'are', 'random', 'processes', 'which', 'when', 'localized', 'that', 'is', 'scaled', 'around', 't', 'to', 'a', 'fine', 'limit', 'have', 'the', 'distribution', 'of', 'an', 'alphaztstable', 'process', 'where', 'alpha', 'is', 'some', 'given', 'function', 'on', 'r', 'thus', 'the', 'stability', 'index', 'at', 't', 'depends', 'on', 'the', 'value', 'of', 'the', 'process', 'at', 't', 'here', 'we', 'address', 'the', 'case', 'where', 'alpha', 'r', 'to', '01', 'we', 'first', 'construct', 'deterministic', 'functions', 'which', 'satisfy', 'a', 'kind', 'of', 'autoregressive', 'property', 'involving', 'sums', 'over', 'a', 'plane', 'point', 'set', 'pi', 'taking', 'pi', 'to', 'be', 'a', 'poisson', 'point', 'process', 'then', 'defines', 'a', 'random', 'pure', 'jump', 'process', 'which', 'we', 'show', 'has', 'the', 'desired', 'localized', 'distributions']] | [-0.1156435849162627, 0.158137117983814, -0.09811699691773304, 0.01057294500534003, -0.025372649938360137, -0.13796318622464138, 0.09578699339620488, 0.3896243251719565, -0.34564451636078786, -0.20140467407093998, 0.08442048143204477, -0.27868781272181364, -0.11030127846126286, 0.15303432513555548, -0.0071589528178831316, 0.05145034164559307, -0.012663161856526474, 0.074063549011524, -0.04244885495468482, -0.2259198275465026, 0.32383764652921904, 0.017258591290985077, 0.20471953413941246, -0.007466622399833967, 0.11206656409743822, 0.003942167247345732, 0.012113361834671418, -0.01579319082314746, -0.16774042934556282, 0.014930550593285347, 0.20461564069561097, 0.06705314999463845, 0.274972416456121, -0.3361545785347808, -0.17302699569823607, 0.1639782577876072, 0.12856706071486873, 0.016491283400133602, 0.018771541645346244, -0.2256371523143794, 0.1662121046815542, -0.1066170112133237, -0.13086821949702493, -0.04031983382543022, 0.07385434628956301, 0.04400781090898474, -0.37620809484484063, 0.027110567061617127, 0.10596636765337777, 0.03200412028521862, 0.014037507971669635, -0.12667466219918766, -0.004872376922922174, 0.09073513356517376, 0.0030240996527696414, 0.05126705385287696, 0.14069708774112305, -0.0801405093702927, -0.09878451106652512, 0.3304365916827799, -0.08338433170344083, -0.24378493997567105, 0.12886788715819283, -0.19800805439293948, -0.18257748662002105, 0.14116247557542938, 0.1750719530630378, 0.15354916020647957, -0.12850537985074004, 0.15761405302492795, -0.03730880693348019, 0.13864869584234976, 0.09931358337876792, 0.003561194472120337, 0.17585545084175636, 0.13631448270709096, 0.0999738149199951, 0.1498644893784691, -0.06955456357220856, -0.10822475702668768, -0.3568587493555585, -0.15493045267561134, -0.1939193641883321, 0.11423065036289254, -0.11148192922426563, -0.20739808953191452, 0.3434196710498687, 0.13105443739639772, 0.26691363092933623, 0.07735710196913097, 0.18897048183628973, 0.2242123060586548, -0.006751024515701915, 0.08148062107030232, 0.11013197542946865, 0.09364679808078229, 0.07454915473321101, -0.13136361789327325, 0.09460811123234343, 0.07357146522636472] |
1,802.02544 | A Dynamic Programming Approach to Evaluating Multivariate Gaussian
Probabilities | We propose a method of approximating multivariate Gaussian probabilities
using dynamic programming. We show that solving the optimization problem
associated with a class of discrete-time finite horizon Markov decision
processes with non-Lipschitz cost functions is equivalent to integrating a
Gaussian functions over polytopes. An approximation scheme for this class of
MDPs is proposed and explicit error bounds under the supremum norm for the
optimal cost to go functions are derived.
| math.OC | we propose a method of approximating multivariate gaussian probabilities using dynamic programming we show that solving the optimization problem associated with a class of discretetime finite horizon markov decision processes with nonlipschitz cost functions is equivalent to integrating a gaussian functions over polytopes an approximation scheme for this class of mdps is proposed and explicit error bounds under the supremum norm for the optimal cost to go functions are derived | [['we', 'propose', 'a', 'method', 'of', 'approximating', 'multivariate', 'gaussian', 'probabilities', 'using', 'dynamic', 'programming', 'we', 'show', 'that', 'solving', 'the', 'optimization', 'problem', 'associated', 'with', 'a', 'class', 'of', 'discretetime', 'finite', 'horizon', 'markov', 'decision', 'processes', 'with', 'nonlipschitz', 'cost', 'functions', 'is', 'equivalent', 'to', 'integrating', 'a', 'gaussian', 'functions', 'over', 'polytopes', 'an', 'approximation', 'scheme', 'for', 'this', 'class', 'of', 'mdps', 'is', 'proposed', 'and', 'explicit', 'error', 'bounds', 'under', 'the', 'supremum', 'norm', 'for', 'the', 'optimal', 'cost', 'to', 'go', 'functions', 'are', 'derived']] | [-0.08378677473935697, 0.01934079313172593, -0.08056701249817187, 0.12594482814430583, -0.085711507914987, -0.15779507597243148, 0.07985989696213178, 0.4335648255023573, -0.34233492366703494, -0.2015343015547842, 0.14304019769520632, -0.22169435671530663, -0.17019347339602453, 0.2057900935012315, -0.09909271388979894, 0.18627391469531826, 0.044638356376838474, -0.010613034213227885, -0.1315296995769521, -0.27491887219782385, 0.32811950428211795, 0.02774195142888597, 0.23624278788587877, 0.003511762887605333, 0.22282024612650275, 0.03694498128523784, 0.015603945703644838, 0.026238765713891814, -0.1253253347977339, 0.14435127032421796, 0.3205190901345174, 0.17092755125569445, 0.39829967467646515, -0.3551994212104806, -0.19193887671987925, 0.19890355857621347, 0.0802533489718501, 0.07198030254138367, 0.009339846976633584, -0.26319135330351334, 0.07367097280387368, -0.15352581422775985, -0.08781539776495524, -0.062310891445460065, -0.055957565223798154, 0.038542155848283854, -0.40937815843416114, 0.04246275092674685, 0.0322316651897771, 0.027633401778127467, -0.09510038505042238, -0.16251681889407338, 0.07058338669926993, 0.03251632569756891, 0.022353118199056814, -0.0007530846499970981, 0.11386748056060501, -0.05468052206228354, -0.20797302520700864, 0.2962166559350278, -0.06760422398469278, -0.3219412465978946, 0.11350014029802488, -0.08420423120260238, -0.14703144329999174, 0.19654141225452934, 0.23800635556025165, 0.18067128132762653, -0.19701050425480518, 0.15590477082795198, -0.063766566850245, 0.09428685576255832, 0.04344307921294655, 0.0386884967064751, 0.07336701948661357, 0.17093583689004715, 0.1776731981762818, 0.2243195275643042, -0.007212626635529367, -0.19536200567547765, -0.3248950117932899, -0.12217123740951398, -0.1818758495950273, 0.02445179478132299, -0.1577595615491321, -0.22031341463028054, 0.31436897451572543, 0.11463090367615222, 0.12161493449072752, 0.2804356210465942, 0.263798343709537, 0.24906714146158526, -0.014999637074236358, 0.14881055891247733, 0.0977847408985586, 0.1376509027622108, 0.017659447433626546, -0.18600455444040043, 0.12437544991262257, 0.14641822752143654] |
1,802.02545 | In aqua electrochemistry probed by XPEEM: experimental setup, examples,
and challenges | Recent developments in environmental and liquid cells equipped with electron
transparent graphene windows have enabled traditional surface science
spectromicroscopy tools, such as X-ray photoelectron spectroscopy (XPS),
photoemission electron microscopy (PEEM), and scanning electron microscopy
(SEM) to be applied to study solid-liquid and liquid-gas interfaces. Here, we
focus on the experimental implementation of PEEM to probe electrified
graphene-liquid interfaces using electrolyte-filled microchannel arrays as a
new sample platform. We demonstrate the important methodological advantage of
these multi-sample arrays: they enable the combination of the wide field of
view hyperspectral imaging capabilities from PEEM with the use of powerful data
mining algorithms to reveal spectroscopic and temporal behaviors at the level
of the individual microsample or the entire array ensemble
| cond-mat.mtrl-sci | recent developments in environmental and liquid cells equipped with electron transparent graphene windows have enabled traditional surface science spectromicroscopy tools such as xray photoelectron spectroscopy xps photoemission electron microscopy peem and scanning electron microscopy sem to be applied to study solidliquid and liquidgas interfaces here we focus on the experimental implementation of peem to probe electrified grapheneliquid interfaces using electrolytefilled microchannel arrays as a new sample platform we demonstrate the important methodological advantage of these multisample arrays they enable the combination of the wide field of view hyperspectral imaging capabilities from peem with the use of powerful data mining algorithms to reveal spectroscopic and temporal behaviors at the level of the individual microsample or the entire array ensemble | [['recent', 'developments', 'in', 'environmental', 'and', 'liquid', 'cells', 'equipped', 'with', 'electron', 'transparent', 'graphene', 'windows', 'have', 'enabled', 'traditional', 'surface', 'science', 'spectromicroscopy', 'tools', 'such', 'as', 'xray', 'photoelectron', 'spectroscopy', 'xps', 'photoemission', 'electron', 'microscopy', 'peem', 'and', 'scanning', 'electron', 'microscopy', 'sem', 'to', 'be', 'applied', 'to', 'study', 'solidliquid', 'and', 'liquidgas', 'interfaces', 'here', 'we', 'focus', 'on', 'the', 'experimental', 'implementation', 'of', 'peem', 'to', 'probe', 'electrified', 'grapheneliquid', 'interfaces', 'using', 'electrolytefilled', 'microchannel', 'arrays', 'as', 'a', 'new', 'sample', 'platform', 'we', 'demonstrate', 'the', 'important', 'methodological', 'advantage', 'of', 'these', 'multisample', 'arrays', 'they', 'enable', 'the', 'combination', 'of', 'the', 'wide', 'field', 'of', 'view', 'hyperspectral', 'imaging', 'capabilities', 'from', 'peem', 'with', 'the', 'use', 'of', 'powerful', 'data', 'mining', 'algorithms', 'to', 'reveal', 'spectroscopic', 'and', 'temporal', 'behaviors', 'at', 'the', 'level', 'of', 'the', 'individual', 'microsample', 'or', 'the', 'entire', 'array', 'ensemble']] | [-0.034589526665513404, 0.08002588482461227, -0.11054749088562575, 0.015727142088821734, -0.05682175044484179, -0.17671953150119377, 0.051220107906907474, 0.4742158048561421, -0.2808172353864487, -0.35826822288398597, 0.07830584970812698, -0.34342999528322754, -0.14229254523525015, 0.26152310799606593, -0.0013734588022183242, 0.11679442286599781, 0.05969089381236198, -0.14873862686639266, -0.03215574885915226, -0.16149052693868599, 0.23799926984316572, 0.12279606987481359, 0.3626113227640825, 0.09748485802616604, 0.10272851505352923, 0.10084708095608472, -0.019426316548749035, 0.04247220153699565, -0.14294242205656263, 0.1391623193209445, 0.3399459281675357, 0.05637326598737453, 0.2282278913189657, -0.5370889287519119, -0.24730272831772615, -0.040369045005404745, 0.135572565141423, 0.05981797976258757, -0.11756289454983901, -0.2874471392193488, 0.008179225856518566, -0.10801034901644392, -0.13113933476089532, -0.12777339489648826, -0.10260756314302602, 0.0663076845930532, -0.1913066743953346, 0.021703532033856828, -0.06869744816353417, 0.14254152395858846, -0.06790631603658327, -0.06940522308236566, 0.025143042323179543, 0.11118493319874437, -0.01079111337533285, 0.011269967228521449, 0.22095746453048598, -0.09219619005131696, -0.1258822073999407, 0.312516193869042, -0.02305789430754195, -0.0706072993905701, 0.25776244461504294, -0.19469906439490872, -0.09583340972413085, 0.1522157638783342, 0.15025084152825754, 0.12216457551955406, -0.16143138349409505, 0.05800303388467251, 0.01584998370902934, 0.2209248590796929, 0.08960015023255656, 0.09824801152090318, 0.25304064124116094, 0.2534643902316898, 0.01884069511915782, 0.11597878507896454, -0.23830174424902312, 0.040519250847864896, -0.16390831703681435, -0.19161511790248212, -0.1693294759787587, 0.03456296722790034, -0.025148610467520736, -0.19023864569367263, 0.35765084708189787, 0.15931896802142326, 0.11576239129624746, -0.061445397437261094, 0.3620288441005837, -0.00233814975945279, 0.08223202256164674, -0.06509096247689991, 0.17607040275972144, 0.14601977829468146, 0.18044579492536664, -0.24855256333730408, 0.009716138662168243, -0.02401775932180342] |
1,802.02546 | A mathematical model of the metabolism of a cell. Self-organization and
chaos | Using the classical tools of nonlinear dynamics, we study the process of
self-organization and the appearance of the chaos in the metabolic process in a
cell with the help of a mathematical model of the transformation of steroids by
a cell Arthrobacter globiformis. We constructed the phase-parametric diagrams
obtained under a variation of the dissipation of the kinetic membrane
potential. The oscillatory modes obtained are classified as regular and strange
attractors. We calculated the bifurcations, by which the self-organization and
the chaos occur in the system, and the transitions "chaos-order",
"order-chaos", "order-order", and "chaos-chaos" arise. Feigenbaum's scenarios
and the intermittences are found. For some selected modes, the projections of
the phase portraits of attractors, Poincar\'e sections, and Poincar\'e maps are
constructed. The total spectra of Lyapunov indices for the modes under study
are calculated. The structural stability of the attractors is demonstrated. A
general scenario of the formation of regular and strange attractors in the
given metabolic process in a cell is found. The physical nature of their
appearance in the metabolic process is studied.
| q-bio.OT nlin.CD | using the classical tools of nonlinear dynamics we study the process of selforganization and the appearance of the chaos in the metabolic process in a cell with the help of a mathematical model of the transformation of steroids by a cell arthrobacter globiformis we constructed the phaseparametric diagrams obtained under a variation of the dissipation of the kinetic membrane potential the oscillatory modes obtained are classified as regular and strange attractors we calculated the bifurcations by which the selforganization and the chaos occur in the system and the transitions chaosorder orderchaos orderorder and chaoschaos arise feigenbaums scenarios and the intermittences are found for some selected modes the projections of the phase portraits of attractors poincare sections and poincare maps are constructed the total spectra of lyapunov indices for the modes under study are calculated the structural stability of the attractors is demonstrated a general scenario of the formation of regular and strange attractors in the given metabolic process in a cell is found the physical nature of their appearance in the metabolic process is studied | [['using', 'the', 'classical', 'tools', 'of', 'nonlinear', 'dynamics', 'we', 'study', 'the', 'process', 'of', 'selforganization', 'and', 'the', 'appearance', 'of', 'the', 'chaos', 'in', 'the', 'metabolic', 'process', 'in', 'a', 'cell', 'with', 'the', 'help', 'of', 'a', 'mathematical', 'model', 'of', 'the', 'transformation', 'of', 'steroids', 'by', 'a', 'cell', 'arthrobacter', 'globiformis', 'we', 'constructed', 'the', 'phaseparametric', 'diagrams', 'obtained', 'under', 'a', 'variation', 'of', 'the', 'dissipation', 'of', 'the', 'kinetic', 'membrane', 'potential', 'the', 'oscillatory', 'modes', 'obtained', 'are', 'classified', 'as', 'regular', 'and', 'strange', 'attractors', 'we', 'calculated', 'the', 'bifurcations', 'by', 'which', 'the', 'selforganization', 'and', 'the', 'chaos', 'occur', 'in', 'the', 'system', 'and', 'the', 'transitions', 'chaosorder', 'orderchaos', 'orderorder', 'and', 'chaoschaos', 'arise', 'feigenbaums', 'scenarios', 'and', 'the', 'intermittences', 'are', 'found', 'for', 'some', 'selected', 'modes', 'the', 'projections', 'of', 'the', 'phase', 'portraits', 'of', 'attractors', 'poincare', 'sections', 'and', 'poincare', 'maps', 'are', 'constructed', 'the', 'total', 'spectra', 'of', 'lyapunov', 'indices', 'for', 'the', 'modes', 'under', 'study', 'are', 'calculated', 'the', 'structural', 'stability', 'of', 'the', 'attractors', 'is', 'demonstrated', 'a', 'general', 'scenario', 'of', 'the', 'formation', 'of', 'regular', 'and', 'strange', 'attractors', 'in', 'the', 'given', 'metabolic', 'process', 'in', 'a', 'cell', 'is', 'found', 'the', 'physical', 'nature', 'of', 'their', 'appearance', 'in', 'the', 'metabolic', 'process', 'is', 'studied']] | [-0.16650410969982501, 0.14982439131454575, -0.08147658414216118, 0.09140974507171523, 0.04976490006953392, -0.07155459010224233, 0.05078388747074052, 0.27845781669555897, -0.26101682507486523, -0.23289908973992557, 0.11211141982937403, -0.25268855516199323, -0.2141101293308639, 0.1667194731902176, -0.023212331074193633, 0.06158651523934356, 0.010826304635225699, 0.02855737242531888, -0.01438385015085939, -0.17848554250166013, 0.32131874482227685, 0.021632290961777514, 0.27192848219921617, -0.007575708863609096, 0.08232844481779926, -0.06629408052025212, -0.029429230974162876, 0.004773412071082784, -0.16089507200401917, 0.0980275157416218, 0.1926363322966807, 0.11171910487066543, 0.1926814559793592, -0.4084031870160466, -0.23627035683235045, 0.10144938850218709, 0.12238541775819278, 0.08101055422334814, -0.022551471602985228, -0.2979503963731401, 0.06305390027694233, -0.10933599118732087, -0.15039507415274095, -0.08309502420520769, 0.022928874736287814, 0.07063677881298394, -0.2546789678049156, 0.09072359875767427, 0.07464678216746998, 0.10253401513575394, -0.10882816629366543, -0.06737436563172645, -0.13190843921218967, 0.15361639335162766, 0.04512093874194991, -0.0358592237154525, 0.15636262611282625, -0.1243270918427185, -0.14076754505994954, 0.385167201788261, -0.032621652312073646, -0.18133488921555638, 0.2015214619178582, -0.1555548480092334, -0.12837501589594216, 0.14855881703043378, 0.1406624817326879, 0.09272746757427551, -0.1476191692482466, 0.06420150980749435, 0.027833130796728976, 0.10035505716892323, 0.10014626658093398, 0.017654732682263138, 0.1738133832046912, 0.18379109950693345, -0.022610047540424026, 0.16006511382908487, -0.0791469322538924, -0.1426733541302383, -0.2813441849517069, -0.12782234933238004, -0.12631947429711535, 0.028214988159551018, -0.10395343552929638, -0.1818362727290255, 0.4491268163225774, 0.04183297264008333, 0.21027098030394517, 0.009207346074513277, 0.2017110274655038, 0.12493292887189329, 0.0378011777560794, 0.016092252138474872, 0.25663260910904234, 0.15848260372074258, 0.14400452098156186, -0.2541239416934603, 0.058774141606810534, 0.08437953157692976] |
1,802.02547 | Learning One Convolutional Layer with Overlapping Patches | We give the first provably efficient algorithm for learning a one hidden
layer convolutional network with respect to a general class of (potentially
overlapping) patches. Additionally, our algorithm requires only mild conditions
on the underlying distribution. We prove that our framework captures commonly
used schemes from computer vision, including one-dimensional and
two-dimensional "patch and stride" convolutions.
Our algorithm-- $Convotron$ -- is inspired by recent work applying isotonic
regression to learning neural networks. Convotron uses a simple, iterative
update rule that is stochastic in nature and tolerant to noise (requires only
that the conditional mean function is a one layer convolutional network, as
opposed to the realizable setting). In contrast to gradient descent, Convotron
requires no special initialization or learning-rate tuning to converge to the
global optimum.
We also point out that learning one hidden convolutional layer with respect
to a Gaussian distribution and just $one$ disjoint patch $P$ (the other patches
may be arbitrary) is $easy$ in the following sense: Convotron can efficiently
recover the hidden weight vector by updating $only$ in the direction of $P$.
| cs.LG cs.DS stat.ML | we give the first provably efficient algorithm for learning a one hidden layer convolutional network with respect to a general class of potentially overlapping patches additionally our algorithm requires only mild conditions on the underlying distribution we prove that our framework captures commonly used schemes from computer vision including onedimensional and twodimensional patch and stride convolutions our algorithm convotron is inspired by recent work applying isotonic regression to learning neural networks convotron uses a simple iterative update rule that is stochastic in nature and tolerant to noise requires only that the conditional mean function is a one layer convolutional network as opposed to the realizable setting in contrast to gradient descent convotron requires no special initialization or learningrate tuning to converge to the global optimum we also point out that learning one hidden convolutional layer with respect to a gaussian distribution and just one disjoint patch p the other patches may be arbitrary is easy in the following sense convotron can efficiently recover the hidden weight vector by updating only in the direction of p | [['we', 'give', 'the', 'first', 'provably', 'efficient', 'algorithm', 'for', 'learning', 'a', 'one', 'hidden', 'layer', 'convolutional', 'network', 'with', 'respect', 'to', 'a', 'general', 'class', 'of', 'potentially', 'overlapping', 'patches', 'additionally', 'our', 'algorithm', 'requires', 'only', 'mild', 'conditions', 'on', 'the', 'underlying', 'distribution', 'we', 'prove', 'that', 'our', 'framework', 'captures', 'commonly', 'used', 'schemes', 'from', 'computer', 'vision', 'including', 'onedimensional', 'and', 'twodimensional', 'patch', 'and', 'stride', 'convolutions', 'our', 'algorithm', 'convotron', 'is', 'inspired', 'by', 'recent', 'work', 'applying', 'isotonic', 'regression', 'to', 'learning', 'neural', 'networks', 'convotron', 'uses', 'a', 'simple', 'iterative', 'update', 'rule', 'that', 'is', 'stochastic', 'in', 'nature', 'and', 'tolerant', 'to', 'noise', 'requires', 'only', 'that', 'the', 'conditional', 'mean', 'function', 'is', 'a', 'one', 'layer', 'convolutional', 'network', 'as', 'opposed', 'to', 'the', 'realizable', 'setting', 'in', 'contrast', 'to', 'gradient', 'descent', 'convotron', 'requires', 'no', 'special', 'initialization', 'or', 'learningrate', 'tuning', 'to', 'converge', 'to', 'the', 'global', 'optimum', 'we', 'also', 'point', 'out', 'that', 'learning', 'one', 'hidden', 'convolutional', 'layer', 'with', 'respect', 'to', 'a', 'gaussian', 'distribution', 'and', 'just', 'one', 'disjoint', 'patch', 'p', 'the', 'other', 'patches', 'may', 'be', 'arbitrary', 'is', 'easy', 'in', 'the', 'following', 'sense', 'convotron', 'can', 'efficiently', 'recover', 'the', 'hidden', 'weight', 'vector', 'by', 'updating', 'only', 'in', 'the', 'direction', 'of', 'p']] | [-0.05777292427739927, 0.030672130272058503, -0.08655663356184959, 0.056101589258760215, -0.11370062510216875, -0.23485489906743168, 0.04252178643963166, 0.4465635687911085, -0.3267173886857927, -0.27618796269608925, 0.08668195054866373, -0.21454626448053335, -0.20434340701288808, 0.14094830777895237, -0.11182830692401954, 0.09781231121958367, 0.07714957900079233, 0.04724064951762557, -0.06595209428242274, -0.2818061653371634, 0.2961895827097552, 0.05074164877113487, 0.2994437279765095, -0.05385682570814554, 0.14330813609063625, 0.025356498584151267, -0.0027793695139033455, 0.0021032255502151593, -0.04605406790106956, 0.14900640964241965, 0.2572247977075832, 0.12655564214102924, 0.3278206614724227, -0.4288714295678905, -0.23242835801360862, 0.13966522075634982, 0.14950559067456717, 0.13196155602378504, -0.00221612827253661, -0.25435596690114054, 0.12344527516514063, -0.11810391255521349, -0.06384067989353623, -0.11811465179281576, -0.04314968079594629, 0.010256771123302835, -0.3401723549248917, 0.04141795980461341, 0.09879538337034839, 0.0012764508942408222, -0.0036463954845177278, -0.11166008211672306, 0.013685782781935165, 0.0915066424797156, 0.007822250286782427, 0.09492606054459299, 0.15425959505672965, -0.12661961476717676, -0.1121452913120655, 0.29719907864928247, -0.06320407881734094, -0.22564047772969517, 0.17769073680974543, -0.0228087947737991, -0.16212438771767276, 0.12168698344180094, 0.18228329161315093, 0.13653255791270308, -0.12441614333806293, 0.05354448242911271, -0.07358095725200006, 0.1756981899981786, 0.057369560210832525, -0.02995961655895891, 0.13366696095692793, 0.17538298848750336, 0.1349078484970544, 0.14692479343153536, -0.11985680240771866, -0.1336106241228325, -0.26994858321334636, -0.10715787858702243, -0.2063162457490606, -0.00264221851115248, -0.10776529406031062, -0.17005463208471025, 0.39768721744418145, 0.17600191527245831, 0.24582006448347654, 0.11188116345820683, 0.3108545590617827, 0.065387789234519, 0.11382121459447912, 0.14120605546715004, 0.1804864597746304, 0.11340506179923458, 0.07578459294113729, -0.13297862577784275, 0.1282168999528845, 0.10368777736489262] |
1,802.02548 | Predicting Hurricane Trajectories using a Recurrent Neural Network | Hurricanes are cyclones circulating about a defined center whose closed wind
speeds exceed 75 mph originating over tropical and subtropical waters. At
landfall, hurricanes can result in severe disasters. The accuracy of predicting
their trajectory paths is critical to reduce economic loss and save human
lives. Given the complexity and nonlinearity of weather data, a recurrent
neural network (RNN) could be beneficial in modeling hurricane behavior. We
propose the application of a fully connected RNN to predict the trajectory of
hurricanes. We employed the RNN over a fine grid to reduce typical truncation
errors. We utilized their latitude, longitude, wind speed, and pressure
publicly provided by the National Hurricane Center (NHC) to predict the
trajectory of a hurricane at 6-hour intervals. Results show that this proposed
technique is competitive to methods currently employed by the NHC and can
predict up to approximately 120 hours of hurricane path.
| cs.LG cs.AI cs.CY physics.ao-ph stat.ML | hurricanes are cyclones circulating about a defined center whose closed wind speeds exceed 75 mph originating over tropical and subtropical waters at landfall hurricanes can result in severe disasters the accuracy of predicting their trajectory paths is critical to reduce economic loss and save human lives given the complexity and nonlinearity of weather data a recurrent neural network rnn could be beneficial in modeling hurricane behavior we propose the application of a fully connected rnn to predict the trajectory of hurricanes we employed the rnn over a fine grid to reduce typical truncation errors we utilized their latitude longitude wind speed and pressure publicly provided by the national hurricane center nhc to predict the trajectory of a hurricane at 6hour intervals results show that this proposed technique is competitive to methods currently employed by the nhc and can predict up to approximately 120 hours of hurricane path | [['hurricanes', 'are', 'cyclones', 'circulating', 'about', 'a', 'defined', 'center', 'whose', 'closed', 'wind', 'speeds', 'exceed', '75', 'mph', 'originating', 'over', 'tropical', 'and', 'subtropical', 'waters', 'at', 'landfall', 'hurricanes', 'can', 'result', 'in', 'severe', 'disasters', 'the', 'accuracy', 'of', 'predicting', 'their', 'trajectory', 'paths', 'is', 'critical', 'to', 'reduce', 'economic', 'loss', 'and', 'save', 'human', 'lives', 'given', 'the', 'complexity', 'and', 'nonlinearity', 'of', 'weather', 'data', 'a', 'recurrent', 'neural', 'network', 'rnn', 'could', 'be', 'beneficial', 'in', 'modeling', 'hurricane', 'behavior', 'we', 'propose', 'the', 'application', 'of', 'a', 'fully', 'connected', 'rnn', 'to', 'predict', 'the', 'trajectory', 'of', 'hurricanes', 'we', 'employed', 'the', 'rnn', 'over', 'a', 'fine', 'grid', 'to', 'reduce', 'typical', 'truncation', 'errors', 'we', 'utilized', 'their', 'latitude', 'longitude', 'wind', 'speed', 'and', 'pressure', 'publicly', 'provided', 'by', 'the', 'national', 'hurricane', 'center', 'nhc', 'to', 'predict', 'the', 'trajectory', 'of', 'a', 'hurricane', 'at', '6hour', 'intervals', 'results', 'show', 'that', 'this', 'proposed', 'technique', 'is', 'competitive', 'to', 'methods', 'currently', 'employed', 'by', 'the', 'nhc', 'and', 'can', 'predict', 'up', 'to', 'approximately', '120', 'hours', 'of', 'hurricane', 'path']] | [-0.11246229028273817, 0.11552121913136572, -0.04169992116108841, 0.10063399034029595, -0.06089065199985951, -0.10643409825798099, 0.08432204937039665, 0.3903989133988919, -0.27346751210754927, -0.32765930311177816, 0.13702489782384514, -0.2702326389397083, -0.14885592390624744, 0.2239647468153647, -0.17656165593759898, 0.05984542686349655, 0.12568000802646714, 0.04806718593590012, 0.005671670604940681, -0.25526436639088046, 0.19591923005373865, 0.10621284853134837, 0.2854195253315325, 0.050059209039219385, 0.14329457319211722, -0.08033495087360291, -0.0077962128692591675, 0.0008050089941176326, -0.09631892456460252, 0.13626991031330307, 0.27251242394210634, 0.16603689902892882, 0.295691833869383, -0.4684883262075129, -0.27108540923847835, 0.07925000903671797, 0.11509783976540273, 0.04983637041291919, 0.05956560035088087, -0.27170607156823484, 0.07990068626799146, -0.23208341934103646, -0.13900647396665244, -0.02222322145806385, 0.014064873147401073, 0.03255676970893175, -0.2548923425465113, 0.0653265628894018, -0.02184883020438102, 0.12940747528194393, -0.05735234982099663, -0.08653878188473457, -0.08529563296941065, 0.15467506442135864, 0.08081432767996412, 0.06538278673582261, 0.18841174599353452, -0.09445733043403194, -0.09767608622051015, 0.37440356425624216, -0.05610236035165738, -0.122943372413402, 0.1568456310810534, -0.12547985534025294, -0.060442214549778876, 0.15242680338319062, 0.2732204260093914, 0.05677634280263668, -0.12279418973073199, -0.035069480366121064, -0.0020787626327503296, 0.1276557824517391, 0.12278037341818417, -0.0863591008265281, 0.19612199884704132, 0.21423076802775973, 0.07070020465243633, 0.07906791224812797, -0.1785612394082911, -0.11614603507427537, -0.20432680479067117, -0.08701151982900135, -0.09177362521259798, 0.023801370625238436, -0.108306514478877, -0.13825287057885102, 0.41998304125098956, 0.20506655813597116, 0.17677151828966275, 0.06091807132704044, 0.29592216245475267, 0.06524101081209219, 0.11518929613323338, 0.16307139387322578, 0.17706052257622384, 0.030736031919895185, 0.1657797345419598, -0.20076593516875996, 0.11847656035833821, 0.03091088409827021] |
1,802.02549 | Maurer-Cartan moduli and theorems of Riemann-Hilbert type | We study Maurer-Cartan moduli spaces of dg algebras and associated dg
categories and show that, while not quasi-isomorphism invariants, they are
invariants of strong homotopy type, a natural notion that has not been studied
before. We prove, in several different contexts, Schlessinger-Stasheff type
theorems comparing the notions of homotopy and gauge equivalence for
Maurer-Cartan elements as well as their categorified versions. As an
application, we re-prove and generalize Block-Smith's higher Riemann-Hilbert
correspondence, and develop its analogue for simplicial complexes and
topological spaces.
| math.AT math.CT math.QA | we study maurercartan moduli spaces of dg algebras and associated dg categories and show that while not quasiisomorphism invariants they are invariants of strong homotopy type a natural notion that has not been studied before we prove in several different contexts schlessingerstasheff type theorems comparing the notions of homotopy and gauge equivalence for maurercartan elements as well as their categorified versions as an application we reprove and generalize blocksmiths higher riemannhilbert correspondence and develop its analogue for simplicial complexes and topological spaces | [['we', 'study', 'maurercartan', 'moduli', 'spaces', 'of', 'dg', 'algebras', 'and', 'associated', 'dg', 'categories', 'and', 'show', 'that', 'while', 'not', 'quasiisomorphism', 'invariants', 'they', 'are', 'invariants', 'of', 'strong', 'homotopy', 'type', 'a', 'natural', 'notion', 'that', 'has', 'not', 'been', 'studied', 'before', 'we', 'prove', 'in', 'several', 'different', 'contexts', 'schlessingerstasheff', 'type', 'theorems', 'comparing', 'the', 'notions', 'of', 'homotopy', 'and', 'gauge', 'equivalence', 'for', 'maurercartan', 'elements', 'as', 'well', 'as', 'their', 'categorified', 'versions', 'as', 'an', 'application', 'we', 'reprove', 'and', 'generalize', 'blocksmiths', 'higher', 'riemannhilbert', 'correspondence', 'and', 'develop', 'its', 'analogue', 'for', 'simplicial', 'complexes', 'and', 'topological', 'spaces']] | [-0.12434073095209897, 0.03700498581911234, -0.07777241044677793, 0.18579835672862827, -0.10995117160491645, -0.13825225356267765, -0.05800911232654471, 0.3844500408507884, -0.3847178671509027, -0.23498316422337667, 0.1190371958175092, -0.19391832409892232, -0.18745888014091178, 0.1748507994110696, -0.2184319524327293, -0.051189730654732556, 0.04294841546798125, 0.04392927802109625, -0.14131504193792352, -0.23212826667295303, 0.4578794079367071, -0.07042657294368837, 0.24181909787703262, 0.07381439166783821, 0.11587132130953251, -0.03362863669462968, -0.03364264199044555, 0.05383643484674394, -0.16464717679864407, 0.12042070123134181, 0.35053199871908874, 0.05778797414968721, 0.1800577125221025, -0.3916487173642963, -0.14049006159184502, 0.1679564704769291, 0.15359143376335851, 0.039880588024971075, -0.015200292252120561, -0.32990170251578094, 0.15865741160232574, -0.2168424831412267, -0.11626966140029253, -0.15566738731577062, 0.06275558464694768, 0.047658610177313675, -0.18329489096067847, -0.04674403767567128, 0.0878070116523304, 0.1430993598070927, -0.10938697261299239, -0.06685004003229551, -0.09783125080866739, 0.09097339294967241, 0.004145529255038127, -0.025297576011507773, 0.10163420157623478, -0.1016362615628168, -0.22365999459289015, 0.38125466695055366, -0.030402467690873892, -0.20349421870268997, 0.21462424972560257, -0.064469676441513, -0.23722130624228158, 0.05736069238482742, 0.008714134118054061, 0.21027716745156794, -0.024994035810232164, 0.1795552053998108, -0.08082758405944332, 0.01455569751560688, 0.1499810986977536, 0.09140549640869722, 0.10667036371014546, 0.061284824332688004, 0.07323001287877559, 0.14148655863245949, 0.061717624821903884, -0.09331432377075544, -0.3289957744302228, -0.2559625873400364, -0.05880999749642797, 0.11144816801279375, -0.13660676244653586, -0.18134127422235907, 0.34707766721840017, 0.10611407859250903, 0.14915263638395118, 0.17503333681961522, 0.19547969968989493, 0.03706618911091937, 0.07296011482540052, -0.03528345592785627, 0.15935749832133297, 0.3308928717859089, 0.05351717754092533, -0.06181567113962956, -0.0358969624096062, 0.3288735911482945] |
1,802.0255 | Semi-Amortized Variational Autoencoders | Amortized variational inference (AVI) replaces instance-specific local
inference with a global inference network. While AVI has enabled efficient
training of deep generative models such as variational autoencoders (VAE),
recent empirical work suggests that inference networks can produce suboptimal
variational parameters. We propose a hybrid approach, to use AVI to initialize
the variational parameters and run stochastic variational inference (SVI) to
refine them. Crucially, the local SVI procedure is itself differentiable, so
the inference network and generative model can be trained end-to-end with
gradient-based optimization. This semi-amortized approach enables the use of
rich generative models without experiencing the posterior-collapse phenomenon
common in training VAEs for problems like text generation. Experiments show
this approach outperforms strong autoregressive and variational baselines on
standard text and image datasets.
| stat.ML cs.CL cs.LG | amortized variational inference avi replaces instancespecific local inference with a global inference network while avi has enabled efficient training of deep generative models such as variational autoencoders vae recent empirical work suggests that inference networks can produce suboptimal variational parameters we propose a hybrid approach to use avi to initialize the variational parameters and run stochastic variational inference svi to refine them crucially the local svi procedure is itself differentiable so the inference network and generative model can be trained endtoend with gradientbased optimization this semiamortized approach enables the use of rich generative models without experiencing the posteriorcollapse phenomenon common in training vaes for problems like text generation experiments show this approach outperforms strong autoregressive and variational baselines on standard text and image datasets | [['amortized', 'variational', 'inference', 'avi', 'replaces', 'instancespecific', 'local', 'inference', 'with', 'a', 'global', 'inference', 'network', 'while', 'avi', 'has', 'enabled', 'efficient', 'training', 'of', 'deep', 'generative', 'models', 'such', 'as', 'variational', 'autoencoders', 'vae', 'recent', 'empirical', 'work', 'suggests', 'that', 'inference', 'networks', 'can', 'produce', 'suboptimal', 'variational', 'parameters', 'we', 'propose', 'a', 'hybrid', 'approach', 'to', 'use', 'avi', 'to', 'initialize', 'the', 'variational', 'parameters', 'and', 'run', 'stochastic', 'variational', 'inference', 'svi', 'to', 'refine', 'them', 'crucially', 'the', 'local', 'svi', 'procedure', 'is', 'itself', 'differentiable', 'so', 'the', 'inference', 'network', 'and', 'generative', 'model', 'can', 'be', 'trained', 'endtoend', 'with', 'gradientbased', 'optimization', 'this', 'semiamortized', 'approach', 'enables', 'the', 'use', 'of', 'rich', 'generative', 'models', 'without', 'experiencing', 'the', 'posteriorcollapse', 'phenomenon', 'common', 'in', 'training', 'vaes', 'for', 'problems', 'like', 'text', 'generation', 'experiments', 'show', 'this', 'approach', 'outperforms', 'strong', 'autoregressive', 'and', 'variational', 'baselines', 'on', 'standard', 'text', 'and', 'image', 'datasets']] | [0.005470927529891983, -0.07296893158813053, -0.07566190491903757, 0.1392142352532141, -0.19585575514518824, -0.23953416964161348, 0.053165851116035376, 0.4782387829675782, -0.32699104372152415, -0.3633400845173441, 0.03582881060791523, -0.2007896083905209, -0.21385839731493567, 0.15701508068395625, -0.14149725750913142, 0.15310139855232519, 0.20495535410391014, -0.013563154395058995, -0.1226191208316166, -0.2768723160929245, 0.2510449417416373, 0.037962956828271326, 0.36145478971760536, -0.08137567490949983, 0.19156124485755857, -0.03330011140997903, 0.02982354477013568, -0.032271177429690594, -0.07551703802492425, 0.23319232779112262, 0.278711742605858, 0.2614893148267703, 0.39458825442649914, -0.4788894622708808, -0.31733965808831033, 0.09652397927797599, 0.18064399694019095, 0.1532805251086667, 0.02289383234666111, -0.3735512735658005, 0.010786803103372699, -0.17442424435046364, 0.05273390526990177, -0.2471316811174429, -0.1156640983049254, 0.0016760121678864796, -0.38653071497979224, 0.08901593555051253, 0.09707286733309509, 0.022162499768873217, -0.00896583030336216, -0.10355116601376871, 0.020695631886588135, 0.03518170165661417, 0.052283724870143426, 0.10576490475032783, 0.12734193129600485, -0.1495921624343476, -0.15308539303340263, 0.26230643351073757, -0.09992789245806023, -0.2345440580520815, 0.17349415617330824, 0.09623413172275683, -0.22336697014674667, 0.06321800785276611, 0.23306377261083144, 0.1717745709007789, -0.19114028338770397, 0.06403293259647964, -0.027195194862080645, 0.1578339878965902, -0.024486498105660327, -0.06731144238461848, 0.1084118354063649, 0.2845382075909464, 0.09282001708710536, 0.12765313459648064, -0.16958217265262826, -0.14856847937478393, -0.20812157113257734, -0.09620726946741343, -0.21902927308205944, -0.0034667765263651238, -0.15124354285730018, -0.1757650100759643, 0.34282265306587834, 0.2780923271154771, 0.1885037866199664, 0.19198104733082114, 0.33804940684225226, 0.05477890809597142, 0.09866682931276985, 0.1440295776482061, 0.19016631811639662, 0.047110545685606416, 0.11282653664429595, -0.10923094311463083, 0.14514564961618667, 0.0912207493703568] |
1,802.02551 | A general existence result for stationary solutions to the Keller-Segel
system | We consider a Liouville-type PDE on a smooth bounded planar domain, which is
related to stationary solutions of the Keller-Segel's model for chemotaxis. We
prove existence of solutions under some algebraic conditions on the parameters.
In particular, if the domain is not simply connected, then we can find solution
for a generic choice of the parameters. We use variational and
Morse-theoretical methods.
| math.AP | we consider a liouvilletype pde on a smooth bounded planar domain which is related to stationary solutions of the kellersegels model for chemotaxis we prove existence of solutions under some algebraic conditions on the parameters in particular if the domain is not simply connected then we can find solution for a generic choice of the parameters we use variational and morsetheoretical methods | [['we', 'consider', 'a', 'liouvilletype', 'pde', 'on', 'a', 'smooth', 'bounded', 'planar', 'domain', 'which', 'is', 'related', 'to', 'stationary', 'solutions', 'of', 'the', 'kellersegels', 'model', 'for', 'chemotaxis', 'we', 'prove', 'existence', 'of', 'solutions', 'under', 'some', 'algebraic', 'conditions', 'on', 'the', 'parameters', 'in', 'particular', 'if', 'the', 'domain', 'is', 'not', 'simply', 'connected', 'then', 'we', 'can', 'find', 'solution', 'for', 'a', 'generic', 'choice', 'of', 'the', 'parameters', 'we', 'use', 'variational', 'and', 'morsetheoretical', 'methods']] | [-0.13522165530982116, 0.02798629765554021, -0.07194313000266751, 0.0434690513376457, -0.136918359339082, -0.1428395194079106, 0.01663800496608019, 0.3560390656037877, -0.2975614331662655, -0.1724340097202609, 0.18193713914564189, -0.23786735031753778, -0.1792020754267772, 0.21194915541370088, -0.11702797305770218, 0.0639909160711492, 0.08055341655078034, 0.062110185623168945, -0.07539263858149449, -0.20596029271449273, 0.4085678546844671, -0.14026695466600358, 0.23182550189085305, 0.09205877223187903, 0.15617276419264575, -0.028260359113725524, 0.06281919282434198, 0.05678718648850918, -0.23764395187608897, 0.08696653493292009, 0.22073776430139938, 0.11764151267319296, 0.2616634945850819, -0.4298967631533742, -0.23221684239494303, 0.17391332334373147, 0.13579604082430402, 0.1325541563545509, -0.05218143347883597, -0.2541120947338641, 0.13356397090246902, -0.09211047512168685, -0.1910284636852642, -0.08461798915329079, -0.00895350524224341, 0.09563366520839432, -0.3356417620011295, 0.04838286656886339, 0.08263819791997472, -0.001443173907076319, -0.16213089420149723, -0.03367333199324397, 0.003800107047815497, 0.06465190730911369, 0.034447162873887764, -0.008133894996717572, 0.051830055106741685, -0.153342770311671, -0.0742763819017758, 0.34092675052427995, -0.09564344435930253, -0.37309038480743767, 0.2071376930611829, -0.09231570841123661, -0.1649698147084564, 0.0394315334657828, 0.17180669954977928, 0.1955223732938369, -0.13955528882021706, 0.16861414487066212, -0.08187633682100567, 0.17946093919066092, 0.07127803151185313, -0.03936610529199243, 0.11140072320898374, 0.1597933608844566, 0.16887923437170685, 0.14936953204063078, -0.02093701798003167, -0.0952308104528735, -0.356487821166714, -0.11834726345259697, -0.15517338439822198, 0.09546706462691266, -0.1175912292128487, -0.20109469153297443, 0.43450207977245253, 0.11875605249466996, 0.16546771681169048, 0.08212078674890412, 0.22141426398884506, 0.16053887919988483, -0.010196747444570064, 0.10044146905032297, 0.20615393554568678, 0.09905166426906362, 0.04929202517184118, -0.16876941200656195, 0.06054982188701009, 0.11888224052648487] |
1,802.02552 | Cracking the Conundrum of F-Supergiant Coronae | Chandra X-ray and HST far-ultraviolet (FUV) observations of three early-F
supergiants have shed new light on a previous puzzle involving a prominent
member of the class: Alpha Persei (HD20902: F5Ib). The warm supergiant is a
moderately strong, hard coronal (T~10MK) X-ray source, but has ten times weaker
"sub-coronal" Si IV 139 nm (T~80,000 K) emissions than early-G supergiants of
similar high-energy properties. The Alpha Per X-ray excess speculatively was
ascribed to a close-in hyperactive G-dwarf companion, which could have escaped
previous notice, lost in the glare of the bright star. However, a subsequent
dedicated multi-wavelength imaging campaign failed to find any evidence for a
resolved secondary. The origin of the Alpha Per high-energy dichotomy then
devolved to: (1) an unresolved companion; or (2) intrinsic coronal behavior.
Exploring the second possibility, the present program has found that early-F
supergiants do appear to belong to a distinct coronal class, characterized by
elevated X-ray/FUV ratios, although sharing some similarities with Cepheid
variables in their transitory X-ray "high states." Remarkably, the early-F
supergiants now are seen to align with the low-activity end of the X-ray/FUV
sequence defined by late-type dwarfs, suggesting that the disjoint behavior
relative to the G supergiants might be attributed to thinner outer atmospheres
on the F types, as in dwarfs, but in this case perhaps caused by a weakened
"ionization valve" effect due to overly warm photospheres.
| astro-ph.SR | chandra xray and hst farultraviolet fuv observations of three earlyf supergiants have shed new light on a previous puzzle involving a prominent member of the class alpha persei hd20902 f5ib the warm supergiant is a moderately strong hard coronal t10mk xray source but has ten times weaker subcoronal si iv 139 nm t80000 k emissions than earlyg supergiants of similar highenergy properties the alpha per xray excess speculatively was ascribed to a closein hyperactive gdwarf companion which could have escaped previous notice lost in the glare of the bright star however a subsequent dedicated multiwavelength imaging campaign failed to find any evidence for a resolved secondary the origin of the alpha per highenergy dichotomy then devolved to 1 an unresolved companion or 2 intrinsic coronal behavior exploring the second possibility the present program has found that earlyf supergiants do appear to belong to a distinct coronal class characterized by elevated xrayfuv ratios although sharing some similarities with cepheid variables in their transitory xray high states remarkably the earlyf supergiants now are seen to align with the lowactivity end of the xrayfuv sequence defined by latetype dwarfs suggesting that the disjoint behavior relative to the g supergiants might be attributed to thinner outer atmospheres on the f types as in dwarfs but in this case perhaps caused by a weakened ionization valve effect due to overly warm photospheres | [['chandra', 'xray', 'and', 'hst', 'farultraviolet', 'fuv', 'observations', 'of', 'three', 'earlyf', 'supergiants', 'have', 'shed', 'new', 'light', 'on', 'a', 'previous', 'puzzle', 'involving', 'a', 'prominent', 'member', 'of', 'the', 'class', 'alpha', 'persei', 'hd20902', 'f5ib', 'the', 'warm', 'supergiant', 'is', 'a', 'moderately', 'strong', 'hard', 'coronal', 't10mk', 'xray', 'source', 'but', 'has', 'ten', 'times', 'weaker', 'subcoronal', 'si', 'iv', '139', 'nm', 't80000', 'k', 'emissions', 'than', 'earlyg', 'supergiants', 'of', 'similar', 'highenergy', 'properties', 'the', 'alpha', 'per', 'xray', 'excess', 'speculatively', 'was', 'ascribed', 'to', 'a', 'closein', 'hyperactive', 'gdwarf', 'companion', 'which', 'could', 'have', 'escaped', 'previous', 'notice', 'lost', 'in', 'the', 'glare', 'of', 'the', 'bright', 'star', 'however', 'a', 'subsequent', 'dedicated', 'multiwavelength', 'imaging', 'campaign', 'failed', 'to', 'find', 'any', 'evidence', 'for', 'a', 'resolved', 'secondary', 'the', 'origin', 'of', 'the', 'alpha', 'per', 'highenergy', 'dichotomy', 'then', 'devolved', 'to', '1', 'an', 'unresolved', 'companion', 'or', '2', 'intrinsic', 'coronal', 'behavior', 'exploring', 'the', 'second', 'possibility', 'the', 'present', 'program', 'has', 'found', 'that', 'earlyf', 'supergiants', 'do', 'appear', 'to', 'belong', 'to', 'a', 'distinct', 'coronal', 'class', 'characterized', 'by', 'elevated', 'xrayfuv', 'ratios', 'although', 'sharing', 'some', 'similarities', 'with', 'cepheid', 'variables', 'in', 'their', 'transitory', 'xray', 'high', 'states', 'remarkably', 'the', 'earlyf', 'supergiants', 'now', 'are', 'seen', 'to', 'align', 'with', 'the', 'lowactivity', 'end', 'of', 'the', 'xrayfuv', 'sequence', 'defined', 'by', 'latetype', 'dwarfs', 'suggesting', 'that', 'the', 'disjoint', 'behavior', 'relative', 'to', 'the', 'g', 'supergiants', 'might', 'be', 'attributed', 'to', 'thinner', 'outer', 'atmospheres', 'on', 'the', 'f', 'types', 'as', 'in', 'dwarfs', 'but', 'in', 'this', 'case', 'perhaps', 'caused', 'by', 'a', 'weakened', 'ionization', 'valve', 'effect', 'due', 'to', 'overly', 'warm', 'photospheres']] | [-0.0704275771539222, 0.1688628763067017, -0.05071405119048683, 0.12526161671481892, -0.1338563149801229, -0.14931753838355108, 0.07791014593398736, 0.4262564556530534, -0.16417044118415933, -0.3542947461954444, 0.04157152196795151, -0.3099352385584466, -0.04463066250979397, 0.16686327415303462, -0.09971321746497205, -0.0607799395393404, 0.08219362246417986, -0.06811903117367209, -0.022606941242073034, -0.2589811962045444, 0.259993795204807, 0.04264718536623158, 0.09949329707284903, -0.03645789784144375, -0.013142166648748087, -0.10940155748965906, -0.06313429496354352, -0.03442784306500946, -0.10962287994524567, 0.015085922389213616, 0.23230242121729766, 0.09464967438347034, 0.2626216985566619, -0.3576598034307428, -0.256414888070074, 0.08350220832424154, 0.2156348906935671, -0.045737332247537434, -0.04501530450877843, -0.2440201837521231, 0.09003336134215666, -0.16089839721675375, -0.18223698967270688, 0.06654850587664121, 0.07482412252742965, 0.0020690267111923596, -0.20309408196785092, 0.08264201949665172, 0.05371017860860783, 0.10863695571173888, -0.11176332653718288, -0.12482316300130307, -0.06135391468719185, 0.04260336122001513, 0.06039824727335357, 0.07840137017014025, 0.11783674252214255, -0.11669742208297222, -0.04654880264262157, 0.36981148492578453, -0.07169186807928978, 0.04969227145769977, 0.26026973037074347, -0.21270856353395823, -0.20280393078998737, 0.2017592188864443, 0.08603107782583139, 0.15907184833499208, -0.14156576125622466, -0.018619825392552476, -0.020732347788456996, 0.21491301588730904, 0.07229916799943559, 0.10229011131072971, 0.33282845647615455, 0.07471419547302732, -0.005353380738220572, 0.13027992148200357, -0.21879496515795654, 0.006270185346308223, -0.1978608335458531, -0.0880504154541471, -0.10498226183961641, 0.12233680339114791, -0.07774538597555333, -0.16346928974726815, 0.3131679139406261, 0.08373994197209286, 0.20647340781802126, -0.02497891040292342, 0.2793699210081753, 0.08351037523558212, 0.11493430392678224, 0.11517491597007867, 0.31159197316604126, 0.17865550413743886, 0.12760093000608388, -0.23884151709123896, 0.12087429554106223, 0.004367757967236947] |
1,802.02553 | Wrinkles, folds and plasticity in granular rafts | We investigate the mechanical response of a compressed monolayer of large and
dense particles at a liquid-fluid interface: a granular raft. Upon compression,
rafts first wrinkle; then, as the confinement increases, the deformation
localizes in a unique fold. This characteristic buckling pattern is usually
associated to floating elastic sheets and as a result, particle laden
interfaces are often modeled as such. Here, we push this analogy to its limits
by comparing the first quantitative measurements of the raft morphology to a
theoretical continuous elastic model of the interface. We show that although
powerful to describe the wrinkle wavelength, the wrinkle-to-fold transition and
the fold shape, this elastic description does not capture the finer details of
the experiment. We describe an unpredicted secondary wavelength, a compression
discrepancy with the model and a hysteretic behavior during compression cycles,
all of which are a signature of the intrinsic discrete and frictional nature of
granular rafts. It suggests also that these composite materials exhibit both
plastic transition and jamming dynamics.
| cond-mat.soft | we investigate the mechanical response of a compressed monolayer of large and dense particles at a liquidfluid interface a granular raft upon compression rafts first wrinkle then as the confinement increases the deformation localizes in a unique fold this characteristic buckling pattern is usually associated to floating elastic sheets and as a result particle laden interfaces are often modeled as such here we push this analogy to its limits by comparing the first quantitative measurements of the raft morphology to a theoretical continuous elastic model of the interface we show that although powerful to describe the wrinkle wavelength the wrinkletofold transition and the fold shape this elastic description does not capture the finer details of the experiment we describe an unpredicted secondary wavelength a compression discrepancy with the model and a hysteretic behavior during compression cycles all of which are a signature of the intrinsic discrete and frictional nature of granular rafts it suggests also that these composite materials exhibit both plastic transition and jamming dynamics | [['we', 'investigate', 'the', 'mechanical', 'response', 'of', 'a', 'compressed', 'monolayer', 'of', 'large', 'and', 'dense', 'particles', 'at', 'a', 'liquidfluid', 'interface', 'a', 'granular', 'raft', 'upon', 'compression', 'rafts', 'first', 'wrinkle', 'then', 'as', 'the', 'confinement', 'increases', 'the', 'deformation', 'localizes', 'in', 'a', 'unique', 'fold', 'this', 'characteristic', 'buckling', 'pattern', 'is', 'usually', 'associated', 'to', 'floating', 'elastic', 'sheets', 'and', 'as', 'a', 'result', 'particle', 'laden', 'interfaces', 'are', 'often', 'modeled', 'as', 'such', 'here', 'we', 'push', 'this', 'analogy', 'to', 'its', 'limits', 'by', 'comparing', 'the', 'first', 'quantitative', 'measurements', 'of', 'the', 'raft', 'morphology', 'to', 'a', 'theoretical', 'continuous', 'elastic', 'model', 'of', 'the', 'interface', 'we', 'show', 'that', 'although', 'powerful', 'to', 'describe', 'the', 'wrinkle', 'wavelength', 'the', 'wrinkletofold', 'transition', 'and', 'the', 'fold', 'shape', 'this', 'elastic', 'description', 'does', 'not', 'capture', 'the', 'finer', 'details', 'of', 'the', 'experiment', 'we', 'describe', 'an', 'unpredicted', 'secondary', 'wavelength', 'a', 'compression', 'discrepancy', 'with', 'the', 'model', 'and', 'a', 'hysteretic', 'behavior', 'during', 'compression', 'cycles', 'all', 'of', 'which', 'are', 'a', 'signature', 'of', 'the', 'intrinsic', 'discrete', 'and', 'frictional', 'nature', 'of', 'granular', 'rafts', 'it', 'suggests', 'also', 'that', 'these', 'composite', 'materials', 'exhibit', 'both', 'plastic', 'transition', 'and', 'jamming', 'dynamics']] | [-0.1378318979096296, 0.17116951009937834, -0.12082492169385484, 0.03277573739851724, -0.051155333561508594, -0.11576646073905089, 0.02730303439339735, 0.38858436333038004, -0.3195149906692151, -0.2659860202335719, 0.06612869346667227, -0.2582961236048176, -0.22056176821162632, 0.13451655253403993, -0.01966417790390551, 0.06688630602256597, 0.01300638037276488, -0.014052071145746902, -0.03622595632255234, -0.12849371301863027, 0.24028715241913606, 0.07831541354735017, 0.3176353031373863, 0.0809528697744932, 0.07965699627333467, -0.009252989518804005, 0.030966461978359037, 0.0629838366729084, -0.1765575962116085, 0.08168568113728998, 0.21499814049422136, 0.0004810638703316091, 0.19564322487686772, -0.46838800037975414, -0.2358965943062521, 0.0519683386089774, 0.1315419475105451, 0.1250374099395395, -0.04709319906107273, -0.22756462786571088, 0.0862594449623342, -0.13679598039016128, -0.10970071329263947, -0.047068838018879115, 0.023329757032663483, 0.05410578992500468, -0.1959707749648446, 0.08209639121283895, 0.11360477798844369, 0.05853611363255116, -0.09837963561182393, -0.0400224826803588, -0.03431209719161985, 0.09596087280043726, 0.05537371252626966, 0.016696578434511392, 0.21068895039575017, -0.15919696505557387, -0.06228725752317773, 0.4210482182721776, -0.016982799303347628, -0.14296691949480683, 0.2558496830569782, -0.12238190176964076, -0.08411619346395993, 0.19159522502548454, 0.2020035575604044, 0.06564953033139098, -0.11973878752485097, -0.00790016110551667, -0.04276492597650265, 0.20839485678196246, 0.10108658003463712, -0.026974257547408342, 0.22904292105820523, 0.2443566625427275, 0.021227159899244286, 0.17230433994814395, -0.10336892994742067, -0.06466635183644402, -0.298491168873811, -0.17440535890005798, -0.17444495629752055, 0.02215116901727497, -0.08141933215858488, -0.2373037742964884, 0.36621131823140096, 0.10596901956799788, 0.24734976078967102, 0.030863725788560302, 0.28693266323464645, 0.04828339702721842, 0.053138679457289804, 0.008449697406984955, 0.2718818049978869, 0.09418813339350408, 0.11460138644731369, -0.22034673448315406, 0.07611428976131895, 0.01783224890367633] |
1,802.02554 | Local Convergence Properties of SAGA/Prox-SVRG and Acceleration | Over the past ten years, driven by large scale optimisation problems arising
from machine learning, the development of stochastic optimisation methods have
witnessed a tremendous growth. However, despite their popularity, the
theoretical understandings of these methods are quite limited in contrast to
the deterministic optimisation methods. In this paper, we present a local
convergence analysis for a typical type of stochastic optimisation methods:
proximal variance reduced stochastic gradient methods, and mainly focus on the
SAGA [12] and Prox-SVRG [43] algorithms. Under the assumption that the
non-smooth component of the optimisation problem is partly smooth relative to a
smooth manifold, we present a unified framework for the local convergence
analysis of the SAGA/Prox-SVRG algorithms: (i) the sequences generated by the
SAGA/Prox-SVRG are able to identify the smooth manifold in a finite number of
iterations; (ii) then the sequence enters a local linear convergence regime.
Beyond local convergence analysis, we also discuss various possibilities for
accelerating these algorithms, including adapting to better local parameters,
and applying higher-order deterministic/stochastic optimisation methods which
can achieve super-linear convergence. Concrete examples arising from machine
learning are considered to verify the obtained results.
| math.OC | over the past ten years driven by large scale optimisation problems arising from machine learning the development of stochastic optimisation methods have witnessed a tremendous growth however despite their popularity the theoretical understandings of these methods are quite limited in contrast to the deterministic optimisation methods in this paper we present a local convergence analysis for a typical type of stochastic optimisation methods proximal variance reduced stochastic gradient methods and mainly focus on the saga 12 and proxsvrg 43 algorithms under the assumption that the nonsmooth component of the optimisation problem is partly smooth relative to a smooth manifold we present a unified framework for the local convergence analysis of the sagaproxsvrg algorithms i the sequences generated by the sagaproxsvrg are able to identify the smooth manifold in a finite number of iterations ii then the sequence enters a local linear convergence regime beyond local convergence analysis we also discuss various possibilities for accelerating these algorithms including adapting to better local parameters and applying higherorder deterministicstochastic optimisation methods which can achieve superlinear convergence concrete examples arising from machine learning are considered to verify the obtained results | [['over', 'the', 'past', 'ten', 'years', 'driven', 'by', 'large', 'scale', 'optimisation', 'problems', 'arising', 'from', 'machine', 'learning', 'the', 'development', 'of', 'stochastic', 'optimisation', 'methods', 'have', 'witnessed', 'a', 'tremendous', 'growth', 'however', 'despite', 'their', 'popularity', 'the', 'theoretical', 'understandings', 'of', 'these', 'methods', 'are', 'quite', 'limited', 'in', 'contrast', 'to', 'the', 'deterministic', 'optimisation', 'methods', 'in', 'this', 'paper', 'we', 'present', 'a', 'local', 'convergence', 'analysis', 'for', 'a', 'typical', 'type', 'of', 'stochastic', 'optimisation', 'methods', 'proximal', 'variance', 'reduced', 'stochastic', 'gradient', 'methods', 'and', 'mainly', 'focus', 'on', 'the', 'saga', '12', 'and', 'proxsvrg', '43', 'algorithms', 'under', 'the', 'assumption', 'that', 'the', 'nonsmooth', 'component', 'of', 'the', 'optimisation', 'problem', 'is', 'partly', 'smooth', 'relative', 'to', 'a', 'smooth', 'manifold', 'we', 'present', 'a', 'unified', 'framework', 'for', 'the', 'local', 'convergence', 'analysis', 'of', 'the', 'sagaproxsvrg', 'algorithms', 'i', 'the', 'sequences', 'generated', 'by', 'the', 'sagaproxsvrg', 'are', 'able', 'to', 'identify', 'the', 'smooth', 'manifold', 'in', 'a', 'finite', 'number', 'of', 'iterations', 'ii', 'then', 'the', 'sequence', 'enters', 'a', 'local', 'linear', 'convergence', 'regime', 'beyond', 'local', 'convergence', 'analysis', 'we', 'also', 'discuss', 'various', 'possibilities', 'for', 'accelerating', 'these', 'algorithms', 'including', 'adapting', 'to', 'better', 'local', 'parameters', 'and', 'applying', 'higherorder', 'deterministicstochastic', 'optimisation', 'methods', 'which', 'can', 'achieve', 'superlinear', 'convergence', 'concrete', 'examples', 'arising', 'from', 'machine', 'learning', 'are', 'considered', 'to', 'verify', 'the', 'obtained', 'results']] | [-0.05784796510883809, -0.006758871861561404, -0.0877021366462071, 0.07808858358412576, -0.06478464073481281, -0.1295410280391756, 0.021518419125324883, 0.37656008521773165, -0.3263920023354054, -0.29510437937088957, 0.1600798600658258, -0.20836181046299473, -0.16458095922944663, 0.2418797322809595, -0.11022329176320574, 0.09030338633949767, 0.0802238274855367, -0.020964187311777925, -0.14363642625951045, -0.2987813931217913, 0.29239235100280697, 0.0018840046680491903, 0.29447732681570493, -0.003420669721178812, 0.11188772409260982, -0.042991405800896006, -0.04614997110278953, 0.06468432400319928, -0.13159142329083767, 0.17926450874517247, 0.2620456792393942, 0.17296584169177906, 0.39489627585269615, -0.4324562062367635, -0.20872867220769759, 0.14075716672485453, 0.16888192273583388, 0.12636528268858851, -0.08176569240458775, -0.2594775345540889, 0.10255843679086589, -0.11992939741985933, -0.08222945726858756, -0.13385354363012797, -0.04646250517765546, 0.08285051877591405, -0.2712556005647892, 0.05346481480149162, 0.0818398183380692, 0.08183718034390199, -0.047054012533803674, -0.12711005581988263, 0.05377611958449605, 0.07847900526932157, 0.09604147672950564, 0.024589807817550456, 0.15158701339058336, -0.1251365479269146, -0.15947399277027455, 0.33205219102598243, -0.07182426224513304, -0.18612871993378655, 0.22756329849969759, -0.05665972522135986, -0.172544389837877, 0.15692703952663578, 0.22494922345219454, 0.1598539439146407, -0.13744499947136754, 0.11232900181336014, 0.012703411582270232, 0.11364276986569166, 0.013633181943315203, -0.010908505421273572, 0.10988593539324305, 0.19805275622255306, 0.13124877315029784, 0.0944481125549393, -0.061524030465237876, -0.15592533463242705, -0.2782468791220985, -0.08084171087166, -0.1545547334472244, 0.019883326047262097, -0.11893992279834967, -0.1509584200406528, 0.3991988746236767, 0.13860994010768912, 0.1849286727880573, 0.09230179114472223, 0.31284647623239004, 0.11040805208840934, 0.03703107800190438, 0.09955503714382244, 0.23655339904286413, 0.12813024514648336, 0.1293610549505304, -0.21589351484853186, 0.06855882687554897, 0.09491560363423322] |
1,802.02555 | Correlations of occupation numbers in the canonical ensemble and
application to BEC in a 1D harmonic trap | We study statistical properties of $N$ non-interacting identical bosons or
fermions in the canonical ensemble. We derive several general representations
for the $p$-point correlation function of occupation numbers
$\overline{n_1\cdots n_p}$. We demonstrate that it can be expressed as a ratio
of two $p\times p$ determinants involving the (canonical) mean occupations
$\overline{n_1}$, ..., $\overline{n_p}$, which can themselves be conveniently
expressed in terms of the $k$-body partition functions (with $k\leq N$). We
draw some connection with the theory of symmetric functions, and obtain an
expression of the correlation function in terms of Schur functions. Our
findings are illustrated by revisiting the problem of Bose-Einstein
condensation in a 1D harmonic trap, for which we get analytical results. We get
the moments of the occupation numbers and the correlation between ground state
and excited state occupancies. In the temperature regime dominated by quantum
correlations, the distribution of the ground state occupancy is shown to be a
truncated Gumbel law. The Gumbel law, describing extreme value statistics, is
obtained when the temperature is much smaller than the Bose-Einstein
temperature.
| cond-mat.stat-mech cond-mat.quant-gas | we study statistical properties of n noninteracting identical bosons or fermions in the canonical ensemble we derive several general representations for the ppoint correlation function of occupation numbers overlinen_1cdots n_p we demonstrate that it can be expressed as a ratio of two ptimes p determinants involving the canonical mean occupations overlinen_1 overlinen_p which can themselves be conveniently expressed in terms of the kbody partition functions with kleq n we draw some connection with the theory of symmetric functions and obtain an expression of the correlation function in terms of schur functions our findings are illustrated by revisiting the problem of boseeinstein condensation in a 1d harmonic trap for which we get analytical results we get the moments of the occupation numbers and the correlation between ground state and excited state occupancies in the temperature regime dominated by quantum correlations the distribution of the ground state occupancy is shown to be a truncated gumbel law the gumbel law describing extreme value statistics is obtained when the temperature is much smaller than the boseeinstein temperature | [['we', 'study', 'statistical', 'properties', 'of', 'n', 'noninteracting', 'identical', 'bosons', 'or', 'fermions', 'in', 'the', 'canonical', 'ensemble', 'we', 'derive', 'several', 'general', 'representations', 'for', 'the', 'ppoint', 'correlation', 'function', 'of', 'occupation', 'numbers', 'overlinen_1cdots', 'n_p', 'we', 'demonstrate', 'that', 'it', 'can', 'be', 'expressed', 'as', 'a', 'ratio', 'of', 'two', 'ptimes', 'p', 'determinants', 'involving', 'the', 'canonical', 'mean', 'occupations', 'overlinen_1', 'overlinen_p', 'which', 'can', 'themselves', 'be', 'conveniently', 'expressed', 'in', 'terms', 'of', 'the', 'kbody', 'partition', 'functions', 'with', 'kleq', 'n', 'we', 'draw', 'some', 'connection', 'with', 'the', 'theory', 'of', 'symmetric', 'functions', 'and', 'obtain', 'an', 'expression', 'of', 'the', 'correlation', 'function', 'in', 'terms', 'of', 'schur', 'functions', 'our', 'findings', 'are', 'illustrated', 'by', 'revisiting', 'the', 'problem', 'of', 'boseeinstein', 'condensation', 'in', 'a', '1d', 'harmonic', 'trap', 'for', 'which', 'we', 'get', 'analytical', 'results', 'we', 'get', 'the', 'moments', 'of', 'the', 'occupation', 'numbers', 'and', 'the', 'correlation', 'between', 'ground', 'state', 'and', 'excited', 'state', 'occupancies', 'in', 'the', 'temperature', 'regime', 'dominated', 'by', 'quantum', 'correlations', 'the', 'distribution', 'of', 'the', 'ground', 'state', 'occupancy', 'is', 'shown', 'to', 'be', 'a', 'truncated', 'gumbel', 'law', 'the', 'gumbel', 'law', 'describing', 'extreme', 'value', 'statistics', 'is', 'obtained', 'when', 'the', 'temperature', 'is', 'much', 'smaller', 'than', 'the', 'boseeinstein', 'temperature']] | [-0.12449965994900969, 0.1986147113439716, -0.0967690473093706, 0.11506745994077339, 0.03426086016218452, -0.11453972890260904, 0.03161133616025943, 0.3262267299434718, -0.2400474696789923, -0.2837070535758839, 0.020909815768519528, -0.31342985680436386, -0.1148276912404553, 0.14989485099144717, 0.03088031538816936, 0.04251707086668295, 0.006405726961298462, 0.05670415932476959, -0.10173477062215919, -0.23609775711289224, 0.31923693961683003, 0.01853091829278342, 0.2713029425892541, 0.04141612512621042, 0.0539305347168599, 0.020435474648633423, 0.055704725476200964, 0.0149133440134499, -0.12193160579177749, 0.0857153565122965, 0.22414172066320828, 0.09038666650817237, 0.23665897662011798, -0.3962063512710087, -0.1591462163028636, 0.14521241661106402, 0.17663219562177, 0.07669499979272265, 0.0013083455344552503, -0.2884129988906138, -0.0037365573240950812, -0.19101559829980355, -0.17614093826645438, -0.10872130919083514, 0.008599848948035609, 0.08043040251256624, -0.3249752700657529, 0.13457102103925803, 0.046502549703890346, 0.05047887949570876, -0.061637811462723596, -0.1689770382383893, -0.008131259242894456, 0.11133601282507537, 0.02754745487918091, 0.009256003886077772, 0.10759690850151374, -0.1425689221431693, -0.07032329547338818, 0.34630650052362505, -0.06918443653378156, -0.23861885226660354, 0.12064456299002117, -0.20722890068941258, -0.09619189489030225, 0.07913470210452729, 0.10835492338622263, 0.12081505875009016, -0.1114229305418763, 0.0710705263146391, -0.06960364469217466, 0.15204641002860358, 0.07251326552153949, 0.049983563922304554, 0.22099041432580527, 0.08494031339308576, 0.023342916796750882, 0.21251318168977057, -0.040556106154861694, -0.16047940280507592, -0.28956370091832734, -0.1610150760587524, -0.26110202773980906, 0.0854396098129013, -0.11909234736034277, -0.1655227550146211, 0.3806825343738584, 0.10454674720873727, 0.22111734077334405, 0.1019446130746099, 0.21949681354796186, 0.23426134147790864, 0.011549211742685122, 0.033329341494176976, 0.1765782676426598, 0.17550616548122727, 0.03969818525844911, -0.21330560077639188, 0.03029775213011924, 0.10543438159751103] |
1,802.02556 | Current Flow Group Closeness Centrality for Complex Networks | Current flow closeness centrality (CFCC) has a better discriminating ability
than the ordinary closeness centrality based on shortest paths. In this paper,
we extend this notion to a group of vertices in a weighted graph, and then
study the problem of finding a subset $S$ of $k$ vertices to maximize its CFCC
$C(S)$, both theoretically and experimentally. We show that the problem is
NP-hard, but propose two greedy algorithms for minimizing the reciprocal of
$C(S)$ with provable guarantees using the monotoncity and supermodularity. The
first is a deterministic algorithm with an approximation factor
$(1-\frac{k}{k-1}\cdot\frac{1}{e})$ and cubic running time; while the second is
a randomized algorithm with a
$(1-\frac{k}{k-1}\cdot\frac{1}{e}-\epsilon)$-approximation and nearly-linear
running time for any $\epsilon > 0$. Extensive experiments on model and real
networks demonstrate that our algorithms are effective and efficient, with the
second algorithm being scalable to massive networks with more than a million
vertices.
| cs.DS cs.SI | current flow closeness centrality cfcc has a better discriminating ability than the ordinary closeness centrality based on shortest paths in this paper we extend this notion to a group of vertices in a weighted graph and then study the problem of finding a subset s of k vertices to maximize its cfcc cs both theoretically and experimentally we show that the problem is nphard but propose two greedy algorithms for minimizing the reciprocal of cs with provable guarantees using the monotoncity and supermodularity the first is a deterministic algorithm with an approximation factor 1frackk1cdotfrac1e and cubic running time while the second is a randomized algorithm with a 1frackk1cdotfrac1eepsilonapproximation and nearlylinear running time for any epsilon 0 extensive experiments on model and real networks demonstrate that our algorithms are effective and efficient with the second algorithm being scalable to massive networks with more than a million vertices | [['current', 'flow', 'closeness', 'centrality', 'cfcc', 'has', 'a', 'better', 'discriminating', 'ability', 'than', 'the', 'ordinary', 'closeness', 'centrality', 'based', 'on', 'shortest', 'paths', 'in', 'this', 'paper', 'we', 'extend', 'this', 'notion', 'to', 'a', 'group', 'of', 'vertices', 'in', 'a', 'weighted', 'graph', 'and', 'then', 'study', 'the', 'problem', 'of', 'finding', 'a', 'subset', 's', 'of', 'k', 'vertices', 'to', 'maximize', 'its', 'cfcc', 'cs', 'both', 'theoretically', 'and', 'experimentally', 'we', 'show', 'that', 'the', 'problem', 'is', 'nphard', 'but', 'propose', 'two', 'greedy', 'algorithms', 'for', 'minimizing', 'the', 'reciprocal', 'of', 'cs', 'with', 'provable', 'guarantees', 'using', 'the', 'monotoncity', 'and', 'supermodularity', 'the', 'first', 'is', 'a', 'deterministic', 'algorithm', 'with', 'an', 'approximation', 'factor', '1frackk1cdotfrac1e', 'and', 'cubic', 'running', 'time', 'while', 'the', 'second', 'is', 'a', 'randomized', 'algorithm', 'with', 'a', '1frackk1cdotfrac1eepsilonapproximation', 'and', 'nearlylinear', 'running', 'time', 'for', 'any', 'epsilon', '0', 'extensive', 'experiments', 'on', 'model', 'and', 'real', 'networks', 'demonstrate', 'that', 'our', 'algorithms', 'are', 'effective', 'and', 'efficient', 'with', 'the', 'second', 'algorithm', 'being', 'scalable', 'to', 'massive', 'networks', 'with', 'more', 'than', 'a', 'million', 'vertices']] | [-0.13233007722557358, 0.04140017685863926, -0.07517027537873451, 0.030458098314603433, -0.08850346697851065, -0.1650743488922504, 0.09076155191171809, 0.4350183246432678, -0.25761849227103784, -0.33684989677226923, 0.06757328971553303, -0.2964731067524734, -0.18695581560097438, 0.14085775981194848, -0.027339420195483993, 0.08668851200780164, 0.09382002947997328, 0.08831400439186114, -0.06737047370443953, -0.2916901546098203, 0.26741446310524036, 0.04904054884686538, 0.24532473246659423, 0.054299149300212846, 0.11667934267497654, -0.010624403989352021, 0.002375340798840006, 0.07449152644955659, -0.09919980951761975, 0.1457741779542746, 0.22093099912014255, 0.17948382597495902, 0.32354000492140333, -0.3829362250613511, -0.16675590762805775, 0.18963426515024076, 0.13146521075437148, 0.08857716226137857, -0.02057468942054861, -0.241370538150535, 0.14467043109264568, -0.10151121816234597, -0.03351305504015759, -0.06049752469151446, 0.03972609856344284, -0.003549705691724778, -0.31971375953326836, 0.03377177163769478, 0.03046385403260166, 0.015156191275025724, -0.006213858616307167, -0.13261135463464133, 0.05005543881776274, 0.07245685102034968, 0.0008165767676021956, 0.08391392404206943, 0.06018585309465515, -0.08657955184268455, -0.20336040376573272, 0.40166694089664634, -0.05483232961463121, -0.18495427901982098, 0.15583329749333255, -0.08170242145069684, -0.1320779173872731, 0.10915880588854247, 0.20472777231285968, 0.203552080067337, -0.1292499682489545, 0.05421325808154842, -0.0833160323817415, 0.1571082250307585, 0.037620871600278834, 0.007760045216881162, 0.07646037148747672, 0.2134701970383419, 0.1648733554447585, 0.1457285271026194, -0.021541200307402628, -0.07687806809512594, -0.2378382833991596, -0.15271892423034772, -0.21698524660582766, -0.00759643046119323, -0.1676118444109126, -0.14415550948259362, 0.4251778125961093, 0.15967828254314495, 0.22669519855911638, 0.17423806787329785, 0.35109091460282077, 0.08472766223650902, 0.015582005714614553, 0.184574154004164, 0.18912500568090918, 0.08895111061815926, 0.0638015126522155, -0.20332098517489308, 0.09176131520347657, 0.08427156736506215] |
1,802.02557 | Neyman-Pearson classification: parametrics and sample size requirement | The Neyman-Pearson (NP) paradigm in binary classification seeks classifiers
that achieve a minimal type II error while enforcing the prioritized type I
error controlled under some user-specified level $\alpha$. This paradigm serves
naturally in applications such as severe disease diagnosis and spam detection,
where people have clear priorities among the two error types. Recently, Tong,
Feng and Li (2018) proposed a nonparametric umbrella algorithm that adapts all
scoring-type classification methods (e.g., logistic regression, support vector
machines, random forest) to respect the given type I error upper bound $\alpha$
with high probability, without specific distributional assumptions on the
features and the responses. Universal the umbrella algorithm is, it demands an
explicit minimum sample size requirement on class $0$, which is often the more
scarce class, such as in rare disease diagnosis applications. In this work, we
employ the parametric linear discriminant analysis (LDA) model and propose a
new parametric thresholding algorithm, which does not need the minimum sample
size requirements on class $0$ observations and thus is suitable for small
sample applications such as rare disease diagnosis. Leveraging both the
existing nonparametric and the newly proposed parametric thresholding rules, we
propose four LDA-based NP classifiers, for both low- and high-dimensional
settings. On the theoretical front, we prove NP oracle inequalities for one
proposed classifier, where the rate for excess type II error benefits from the
explicit parametric model assumption. Furthermore, as NP classifiers involve a
sample splitting step of class $0$ observations, we construct a new adaptive
sample splitting scheme that can be applied universally to NP classifiers, and
this adaptive strategy reduces the type II error of these classifiers.
| stat.ME math.ST stat.ML stat.TH | the neymanpearson np paradigm in binary classification seeks classifiers that achieve a minimal type ii error while enforcing the prioritized type i error controlled under some userspecified level alpha this paradigm serves naturally in applications such as severe disease diagnosis and spam detection where people have clear priorities among the two error types recently tong feng and li 2018 proposed a nonparametric umbrella algorithm that adapts all scoringtype classification methods eg logistic regression support vector machines random forest to respect the given type i error upper bound alpha with high probability without specific distributional assumptions on the features and the responses universal the umbrella algorithm is it demands an explicit minimum sample size requirement on class 0 which is often the more scarce class such as in rare disease diagnosis applications in this work we employ the parametric linear discriminant analysis lda model and propose a new parametric thresholding algorithm which does not need the minimum sample size requirements on class 0 observations and thus is suitable for small sample applications such as rare disease diagnosis leveraging both the existing nonparametric and the newly proposed parametric thresholding rules we propose four ldabased np classifiers for both low and highdimensional settings on the theoretical front we prove np oracle inequalities for one proposed classifier where the rate for excess type ii error benefits from the explicit parametric model assumption furthermore as np classifiers involve a sample splitting step of class 0 observations we construct a new adaptive sample splitting scheme that can be applied universally to np classifiers and this adaptive strategy reduces the type ii error of these classifiers | [['the', 'neymanpearson', 'np', 'paradigm', 'in', 'binary', 'classification', 'seeks', 'classifiers', 'that', 'achieve', 'a', 'minimal', 'type', 'ii', 'error', 'while', 'enforcing', 'the', 'prioritized', 'type', 'i', 'error', 'controlled', 'under', 'some', 'userspecified', 'level', 'alpha', 'this', 'paradigm', 'serves', 'naturally', 'in', 'applications', 'such', 'as', 'severe', 'disease', 'diagnosis', 'and', 'spam', 'detection', 'where', 'people', 'have', 'clear', 'priorities', 'among', 'the', 'two', 'error', 'types', 'recently', 'tong', 'feng', 'and', 'li', '2018', 'proposed', 'a', 'nonparametric', 'umbrella', 'algorithm', 'that', 'adapts', 'all', 'scoringtype', 'classification', 'methods', 'eg', 'logistic', 'regression', 'support', 'vector', 'machines', 'random', 'forest', 'to', 'respect', 'the', 'given', 'type', 'i', 'error', 'upper', 'bound', 'alpha', 'with', 'high', 'probability', 'without', 'specific', 'distributional', 'assumptions', 'on', 'the', 'features', 'and', 'the', 'responses', 'universal', 'the', 'umbrella', 'algorithm', 'is', 'it', 'demands', 'an', 'explicit', 'minimum', 'sample', 'size', 'requirement', 'on', 'class', '0', 'which', 'is', 'often', 'the', 'more', 'scarce', 'class', 'such', 'as', 'in', 'rare', 'disease', 'diagnosis', 'applications', 'in', 'this', 'work', 'we', 'employ', 'the', 'parametric', 'linear', 'discriminant', 'analysis', 'lda', 'model', 'and', 'propose', 'a', 'new', 'parametric', 'thresholding', 'algorithm', 'which', 'does', 'not', 'need', 'the', 'minimum', 'sample', 'size', 'requirements', 'on', 'class', '0', 'observations', 'and', 'thus', 'is', 'suitable', 'for', 'small', 'sample', 'applications', 'such', 'as', 'rare', 'disease', 'diagnosis', 'leveraging', 'both', 'the', 'existing', 'nonparametric', 'and', 'the', 'newly', 'proposed', 'parametric', 'thresholding', 'rules', 'we', 'propose', 'four', 'ldabased', 'np', 'classifiers', 'for', 'both', 'low', 'and', 'highdimensional', 'settings', 'on', 'the', 'theoretical', 'front', 'we', 'prove', 'np', 'oracle', 'inequalities', 'for', 'one', 'proposed', 'classifier', 'where', 'the', 'rate', 'for', 'excess', 'type', 'ii', 'error', 'benefits', 'from', 'the', 'explicit', 'parametric', 'model', 'assumption', 'furthermore', 'as', 'np', 'classifiers', 'involve', 'a', 'sample', 'splitting', 'step', 'of', 'class', '0', 'observations', 'we', 'construct', 'a', 'new', 'adaptive', 'sample', 'splitting', 'scheme', 'that', 'can', 'be', 'applied', 'universally', 'to', 'np', 'classifiers', 'and', 'this', 'adaptive', 'strategy', 'reduces', 'the', 'type', 'ii', 'error', 'of', 'these', 'classifiers']] | [-0.05207597639597605, 0.017611441128236094, -0.03469422376851913, 0.11238609362956581, -0.11985002688754266, -0.2556443591376266, 0.13224155405558446, 0.3837256573163209, -0.2692577146077763, -0.30334413599387094, 0.10790434153055523, -0.2401466573303593, -0.16901273261182315, 0.18031296731421764, -0.12482070197601483, 0.11918978163867539, 0.07528628215433529, 0.03505549529643813, -0.043692499720630475, -0.2905684882642896, 0.2902752965490626, 0.03497469731008829, 0.3446047083777028, -0.03233126601583929, 0.07701467663708227, 0.011183210252436683, -0.018433422024393065, 0.0075442415606508505, -0.11456606139855371, 0.11215693786576975, 0.3016331690683294, 0.20760906113871136, 0.3547588885664495, -0.3374922109218894, -0.21327678466375583, 0.15305714487139857, 0.11476533409787312, 0.10600651072428575, -0.034347448988269004, -0.2717130542111604, 0.09603728667082292, -0.1547436024602711, -0.06432207648941218, -0.09168041287747615, -0.016807631804058747, 0.021058854334005988, -0.3489369622852181, 0.07734910416444625, 0.10163583168794693, 0.07156191819202791, -0.04516055475817924, -0.16894072579018382, 0.06075865479269579, 0.05193307005223443, 0.021183723684594924, 0.023323356374292878, 0.12203840447985914, -0.13223307628754472, -0.13727008009854175, 0.30606536474687035, -0.04744370888706658, -0.20469755953031857, 0.20076897933014057, -0.03464963862284976, -0.1906474738324464, 0.11813726314385213, 0.22685762553444522, 0.10635840755569359, -0.15524523482838673, 0.07407447783923239, -0.003155955186447323, 0.1637177835826748, 0.03821000147744694, 0.021020469379110902, 0.12107304774625262, 0.18897377457747708, 0.07746753933293912, 0.09198615757996953, -0.1530387375448177, -0.03663384110350579, -0.3157010105987594, -0.1265705479997464, -0.16505865715383275, 0.012720124954203537, -0.12999162762973165, -0.18265816351788036, 0.34665083928592055, 0.15129241998288512, 0.16669306267539835, 0.11486644908497388, 0.28887499385138055, 0.08388738198216254, 0.0710199297225075, 0.09481259626544901, 0.18671882483613444, 0.061938128474845255, 0.046338097474697644, -0.19032481353497133, 0.13560757926950204, 0.07666794874065959] |
1,802.02558 | Intentional Control of Type I Error over Unconscious Data Distortion: a
Neyman-Pearson Approach to Text Classification | This paper addresses the challenges in classifying textual data obtained from
open online platforms, which are vulnerable to distortion. Most existing
classification methods minimize the overall classification error and may yield
an undesirably large type I error (relevant textual messages are classified as
irrelevant), particularly when available data exhibit an asymmetry between
relevant and irrelevant information. Data distortion exacerbates this situation
and often leads to fallacious prediction. To deal with inestimable data
distortion, we propose the use of the Neyman-Pearson (NP) classification
paradigm, which minimizes type II error under a user-specified type I error
constraint. Theoretically, we show that the NP oracle is unaffected by data
distortion when the class conditional distributions remain the same.
Empirically, we study a case of classifying posts about worker strikes obtained
from a leading Chinese microblogging platform, which are frequently prone to
extensive, unpredictable and inestimable censorship. We demonstrate that, even
though the training and test data are susceptible to different distortion and
therefore potentially follow different distributions, our proposed NP methods
control the type I error on test data at the targeted level. The methods and
implementation pipeline proposed in our case study are applicable to many other
problems involving data distortion.
| stat.ME cs.LG stat.AP stat.ML | this paper addresses the challenges in classifying textual data obtained from open online platforms which are vulnerable to distortion most existing classification methods minimize the overall classification error and may yield an undesirably large type i error relevant textual messages are classified as irrelevant particularly when available data exhibit an asymmetry between relevant and irrelevant information data distortion exacerbates this situation and often leads to fallacious prediction to deal with inestimable data distortion we propose the use of the neymanpearson np classification paradigm which minimizes type ii error under a userspecified type i error constraint theoretically we show that the np oracle is unaffected by data distortion when the class conditional distributions remain the same empirically we study a case of classifying posts about worker strikes obtained from a leading chinese microblogging platform which are frequently prone to extensive unpredictable and inestimable censorship we demonstrate that even though the training and test data are susceptible to different distortion and therefore potentially follow different distributions our proposed np methods control the type i error on test data at the targeted level the methods and implementation pipeline proposed in our case study are applicable to many other problems involving data distortion | [['this', 'paper', 'addresses', 'the', 'challenges', 'in', 'classifying', 'textual', 'data', 'obtained', 'from', 'open', 'online', 'platforms', 'which', 'are', 'vulnerable', 'to', 'distortion', 'most', 'existing', 'classification', 'methods', 'minimize', 'the', 'overall', 'classification', 'error', 'and', 'may', 'yield', 'an', 'undesirably', 'large', 'type', 'i', 'error', 'relevant', 'textual', 'messages', 'are', 'classified', 'as', 'irrelevant', 'particularly', 'when', 'available', 'data', 'exhibit', 'an', 'asymmetry', 'between', 'relevant', 'and', 'irrelevant', 'information', 'data', 'distortion', 'exacerbates', 'this', 'situation', 'and', 'often', 'leads', 'to', 'fallacious', 'prediction', 'to', 'deal', 'with', 'inestimable', 'data', 'distortion', 'we', 'propose', 'the', 'use', 'of', 'the', 'neymanpearson', 'np', 'classification', 'paradigm', 'which', 'minimizes', 'type', 'ii', 'error', 'under', 'a', 'userspecified', 'type', 'i', 'error', 'constraint', 'theoretically', 'we', 'show', 'that', 'the', 'np', 'oracle', 'is', 'unaffected', 'by', 'data', 'distortion', 'when', 'the', 'class', 'conditional', 'distributions', 'remain', 'the', 'same', 'empirically', 'we', 'study', 'a', 'case', 'of', 'classifying', 'posts', 'about', 'worker', 'strikes', 'obtained', 'from', 'a', 'leading', 'chinese', 'microblogging', 'platform', 'which', 'are', 'frequently', 'prone', 'to', 'extensive', 'unpredictable', 'and', 'inestimable', 'censorship', 'we', 'demonstrate', 'that', 'even', 'though', 'the', 'training', 'and', 'test', 'data', 'are', 'susceptible', 'to', 'different', 'distortion', 'and', 'therefore', 'potentially', 'follow', 'different', 'distributions', 'our', 'proposed', 'np', 'methods', 'control', 'the', 'type', 'i', 'error', 'on', 'test', 'data', 'at', 'the', 'targeted', 'level', 'the', 'methods', 'and', 'implementation', 'pipeline', 'proposed', 'in', 'our', 'case', 'study', 'are', 'applicable', 'to', 'many', 'other', 'problems', 'involving', 'data', 'distortion']] | [-0.09578884195012213, 0.01281340454541844, -0.021508141873572865, 0.1560677266252653, -0.0990463394856539, -0.21018932255373415, 0.08082082655266788, 0.380069366731124, -0.2973483757252791, -0.3322759432502877, 0.13022060327035323, -0.31463680078448664, -0.14223147578649784, 0.20419264261741846, -0.14621592530671826, 0.05551056539810651, 0.0985461890594519, 0.01933630987891843, -0.05189270286905069, -0.3147460964962316, 0.3182201243061853, 0.06298532117340695, 0.3640417169742099, 0.01410864118162552, 0.02490298006327907, -0.00975156935568356, -0.06383273682449406, 0.02090762606377353, -0.09816710537935118, 0.1265883600566274, 0.3110735743510158, 0.1799999482674646, 0.29467066467096725, -0.3870954168773252, -0.18261180390678722, 0.105455412197128, 0.11079308430865482, 0.13675113203034422, -0.06756581331254569, -0.31810499539355463, 0.08436662960217227, -0.13660926289093592, -0.03483256062810969, -0.10816371996814488, -0.009482806851507057, 0.005609505486922648, -0.30330921987530274, 0.09620536141911867, 0.057776022732875604, 0.056338735956736094, -0.044539440108519325, -0.11744983994575152, 0.03899705149794943, 0.1502323208985752, 0.09934862384727065, 0.02196464865982074, 0.10774422687567284, -0.12133629150669928, -0.11805313863515404, 0.39124196677950757, -0.0012223556352283188, -0.19692671015605928, 0.1799866891367801, -0.06610152898204218, -0.16003244896021546, 0.1259172344276092, 0.23059146999189603, 0.07277857077871941, -0.18070634199179422, 0.019641890299644547, 0.013701472108500387, 0.17711372601146805, 0.035165781169268655, 0.03807229028041264, 0.14057363390959987, 0.179182865530552, 0.03796450213860281, 0.1288033449702344, -0.12113252753302942, -0.05034940153706688, -0.28436911650395125, -0.07870295389096753, -0.16542304829979812, 0.0056054210758314064, -0.081786635825039, -0.14739314480754898, 0.3345592570626855, 0.20767499363557645, 0.17770944027248864, 0.07942160988991714, 0.3102395369252424, 0.03397801636435073, 0.0740672822119715, 0.1112284684733923, 0.19210820235709786, -0.016991468214303553, 0.06586120054172585, -0.17715724047048756, 0.12837333281538518, -0.013172245346917653] |
1,802.02559 | Mechanical Stresses Estimation in Silicon and Glass Bonded at Elevated
Temperature | During electrostatic bonding, also known as anodic bonding, silicon is bonded
to glass by applying an external voltage and simultaneous heating to
temperatures of 200...450 $\deg$C. While cooling to working temperature after
bonding happened pieces are mutually deformed. Due to linear thermal expansion
coefficients mismatch of anodically bonded glass and silicon samples an
internal stress state is generated. Such stresses are called thermal mismatch
stresses. The aim of this paper is a determination of technological and design
solutions to achieve minimal thermal mismatch stresses in resulting bond.
The nonlinear dependence of linear thermal expansion coefficients of bonded
samples' materials on temperature makes it difficult to minimize thermal
mismatch stresses by chosing materials with close average thermal expansion
coefficients in particular temperature range. To assess means of lowering
thermal mismatch stress in this paper two different ways to describe assembly
are used: two thin bonded layers and multilayered composite material.
Based on properties of two brands of glass (LK5, Borofloat 33) and silicon
used with described mathematical models thermal mismatch stresses at
temperature $T_w$ in samples bonded at several different temperatures $T_b$ are
evaluated. Bonded silicon surface stress dependence of glass to silicon wafer
thickness ratio is evaluated. Based on such evaluations one can say that by
varying thickness of glass bonded to silicon one can obtain zero thermal
mismatch stress at a particular depth of material or obtain stress of some
defined value at this depth.
Models of assembly description used in this paper can be used to optimize
anodic bonding process parameters. Such usage aimed to minimize thermal
mismatch stresses at device working temperatures is presented in this paper.
| cond-mat.mtrl-sci cond-mat.mes-hall physics.app-ph | during electrostatic bonding also known as anodic bonding silicon is bonded to glass by applying an external voltage and simultaneous heating to temperatures of 200450 degc while cooling to working temperature after bonding happened pieces are mutually deformed due to linear thermal expansion coefficients mismatch of anodically bonded glass and silicon samples an internal stress state is generated such stresses are called thermal mismatch stresses the aim of this paper is a determination of technological and design solutions to achieve minimal thermal mismatch stresses in resulting bond the nonlinear dependence of linear thermal expansion coefficients of bonded samples materials on temperature makes it difficult to minimize thermal mismatch stresses by chosing materials with close average thermal expansion coefficients in particular temperature range to assess means of lowering thermal mismatch stress in this paper two different ways to describe assembly are used two thin bonded layers and multilayered composite material based on properties of two brands of glass lk5 borofloat 33 and silicon used with described mathematical models thermal mismatch stresses at temperature t_w in samples bonded at several different temperatures t_b are evaluated bonded silicon surface stress dependence of glass to silicon wafer thickness ratio is evaluated based on such evaluations one can say that by varying thickness of glass bonded to silicon one can obtain zero thermal mismatch stress at a particular depth of material or obtain stress of some defined value at this depth models of assembly description used in this paper can be used to optimize anodic bonding process parameters such usage aimed to minimize thermal mismatch stresses at device working temperatures is presented in this paper | [['during', 'electrostatic', 'bonding', 'also', 'known', 'as', 'anodic', 'bonding', 'silicon', 'is', 'bonded', 'to', 'glass', 'by', 'applying', 'an', 'external', 'voltage', 'and', 'simultaneous', 'heating', 'to', 'temperatures', 'of', '200450', 'degc', 'while', 'cooling', 'to', 'working', 'temperature', 'after', 'bonding', 'happened', 'pieces', 'are', 'mutually', 'deformed', 'due', 'to', 'linear', 'thermal', 'expansion', 'coefficients', 'mismatch', 'of', 'anodically', 'bonded', 'glass', 'and', 'silicon', 'samples', 'an', 'internal', 'stress', 'state', 'is', 'generated', 'such', 'stresses', 'are', 'called', 'thermal', 'mismatch', 'stresses', 'the', 'aim', 'of', 'this', 'paper', 'is', 'a', 'determination', 'of', 'technological', 'and', 'design', 'solutions', 'to', 'achieve', 'minimal', 'thermal', 'mismatch', 'stresses', 'in', 'resulting', 'bond', 'the', 'nonlinear', 'dependence', 'of', 'linear', 'thermal', 'expansion', 'coefficients', 'of', 'bonded', 'samples', 'materials', 'on', 'temperature', 'makes', 'it', 'difficult', 'to', 'minimize', 'thermal', 'mismatch', 'stresses', 'by', 'chosing', 'materials', 'with', 'close', 'average', 'thermal', 'expansion', 'coefficients', 'in', 'particular', 'temperature', 'range', 'to', 'assess', 'means', 'of', 'lowering', 'thermal', 'mismatch', 'stress', 'in', 'this', 'paper', 'two', 'different', 'ways', 'to', 'describe', 'assembly', 'are', 'used', 'two', 'thin', 'bonded', 'layers', 'and', 'multilayered', 'composite', 'material', 'based', 'on', 'properties', 'of', 'two', 'brands', 'of', 'glass', 'lk5', 'borofloat', '33', 'and', 'silicon', 'used', 'with', 'described', 'mathematical', 'models', 'thermal', 'mismatch', 'stresses', 'at', 'temperature', 't_w', 'in', 'samples', 'bonded', 'at', 'several', 'different', 'temperatures', 't_b', 'are', 'evaluated', 'bonded', 'silicon', 'surface', 'stress', 'dependence', 'of', 'glass', 'to', 'silicon', 'wafer', 'thickness', 'ratio', 'is', 'evaluated', 'based', 'on', 'such', 'evaluations', 'one', 'can', 'say', 'that', 'by', 'varying', 'thickness', 'of', 'glass', 'bonded', 'to', 'silicon', 'one', 'can', 'obtain', 'zero', 'thermal', 'mismatch', 'stress', 'at', 'a', 'particular', 'depth', 'of', 'material', 'or', 'obtain', 'stress', 'of', 'some', 'defined', 'value', 'at', 'this', 'depth', 'models', 'of', 'assembly', 'description', 'used', 'in', 'this', 'paper', 'can', 'be', 'used', 'to', 'optimize', 'anodic', 'bonding', 'process', 'parameters', 'such', 'usage', 'aimed', 'to', 'minimize', 'thermal', 'mismatch', 'stresses', 'at', 'device', 'working', 'temperatures', 'is', 'presented', 'in', 'this', 'paper']] | [-0.0664694212917109, 0.20605019423517795, -0.025658981514991158, -0.06511201533050082, -0.0351593598999359, -0.14148734976641006, 0.011377585887977923, 0.4366115813617836, -0.2932060517180987, -0.3018559616916011, 0.05622173577840268, -0.2983681193466678, -0.09358158768240914, 0.1474415018507797, -0.04581222775116287, 0.05260614836760969, -0.015317586060889342, -0.07586335016530939, -0.08664507307715852, -0.22813905645075633, 0.25408690368046705, 0.09951374076858714, 0.3527774356547053, 0.11011219119170197, 0.09469875559141791, -0.04495063424024179, 0.048756159779494976, 0.035478632132408504, -0.17633716491909582, 0.05426791306861021, 0.2883480454893423, -0.08418912512457205, 0.2188952380342892, -0.5023192494348795, -0.17396579605389248, 0.05720998582525041, 0.06136055396938765, 0.0888658889664199, -0.015971431731574098, -0.15017204023897648, 0.03284174761114021, -0.14664704896319933, -0.11095305294126134, -0.05388866013607993, -0.0051935418146765895, -0.008175936617448719, -0.2402677152631373, 0.0907161978960546, 0.015917845073973123, 0.08278602438254488, -0.09202060219486831, -0.16038730895681375, -0.07677130476157698, 0.08146961527214713, 0.02398554055371615, -0.003880595242716717, 0.29144343497227293, -0.08576408131824186, -0.0223980991549238, 0.36770038984853914, -0.05132144202857658, -0.13432480033262875, 0.23234789902344347, -0.07972734106997786, -0.04429603593458456, 0.160441558093212, 0.17574560913360782, 0.04620311611883894, -0.21136804047489055, 0.00013079397292501568, 0.08289436570851615, 0.1999081459224086, 0.1507588947347055, -0.00580299640574527, 0.2394236908328754, 0.23127566630244945, -0.0014150837401824968, 0.2005258894141729, -0.06588336131794172, -0.003911363367957097, -0.230778977861283, -0.1631758564669225, -0.21496802686273844, 0.039841476192318453, -0.1181634601612502, -0.22329023214126076, 0.3439698624122819, 0.15113470137929888, 0.1538081287311528, 0.01039275287723824, 0.27283883986097796, 0.05881738206673483, 0.09260772812283702, 0.006030461211964764, 0.2748061028487023, 0.18581164545051893, 0.10052956692120965, -0.23628090839505334, 0.11866024697751358, 0.014697452287914024] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.