id
float64 706
1.8k
| title
stringlengths 1
343
| abstract
stringlengths 6
6.09k
| categories
stringlengths 5
125
| processed_abstract
stringlengths 2
5.96k
| tokenized_abstract
stringlengths 8
8.74k
| centroid
stringlengths 2.1k
2.17k
|
|---|---|---|---|---|---|---|
1,803.08767
|
A conservation law with spatially localized sublinear damping
|
We consider a general conservation law on the circle, in the presence of a
sublinear damping. If the damping acts on the whole circle, then the solution
becomes identically zero in finite time, following the same mechanism as the
corresponding ordinary differential equation. When the damping acts only
locally in space, we show a dichotomy: if the flux function is not zero at the
origin, then the transport mechanism causes the extinction of the solution in
finite time, as in the first case. On the other hand, if zero is a
non-degenerate critical point of the flux function, then the solution becomes
extinct in finite time only inside the damping zone, decays algebraically
uniformly in space, and we exhibit a boundary layer, shrinking with time,
around the damping zone. Numerical illustrations show how similar phenomena may
be expected for other equations.
|
math.AP math.OC
|
we consider a general conservation law on the circle in the presence of a sublinear damping if the damping acts on the whole circle then the solution becomes identically zero in finite time following the same mechanism as the corresponding ordinary differential equation when the damping acts only locally in space we show a dichotomy if the flux function is not zero at the origin then the transport mechanism causes the extinction of the solution in finite time as in the first case on the other hand if zero is a nondegenerate critical point of the flux function then the solution becomes extinct in finite time only inside the damping zone decays algebraically uniformly in space and we exhibit a boundary layer shrinking with time around the damping zone numerical illustrations show how similar phenomena may be expected for other equations
|
[['we', 'consider', 'a', 'general', 'conservation', 'law', 'on', 'the', 'circle', 'in', 'the', 'presence', 'of', 'a', 'sublinear', 'damping', 'if', 'the', 'damping', 'acts', 'on', 'the', 'whole', 'circle', 'then', 'the', 'solution', 'becomes', 'identically', 'zero', 'in', 'finite', 'time', 'following', 'the', 'same', 'mechanism', 'as', 'the', 'corresponding', 'ordinary', 'differential', 'equation', 'when', 'the', 'damping', 'acts', 'only', 'locally', 'in', 'space', 'we', 'show', 'a', 'dichotomy', 'if', 'the', 'flux', 'function', 'is', 'not', 'zero', 'at', 'the', 'origin', 'then', 'the', 'transport', 'mechanism', 'causes', 'the', 'extinction', 'of', 'the', 'solution', 'in', 'finite', 'time', 'as', 'in', 'the', 'first', 'case', 'on', 'the', 'other', 'hand', 'if', 'zero', 'is', 'a', 'nondegenerate', 'critical', 'point', 'of', 'the', 'flux', 'function', 'then', 'the', 'solution', 'becomes', 'extinct', 'in', 'finite', 'time', 'only', 'inside', 'the', 'damping', 'zone', 'decays', 'algebraically', 'uniformly', 'in', 'space', 'and', 'we', 'exhibit', 'a', 'boundary', 'layer', 'shrinking', 'with', 'time', 'around', 'the', 'damping', 'zone', 'numerical', 'illustrations', 'show', 'how', 'similar', 'phenomena', 'may', 'be', 'expected', 'for', 'other', 'equations']]
|
[-0.16244539907796585, 0.17374666711787778, -0.09830795800980471, 0.05730011256028574, -0.08125293885311442, -0.13382726563272854, 0.0545904639462696, 0.31179591631582865, -0.329886497188267, -0.19639688604081987, 0.13527514760222298, -0.3085262280466127, -0.12037759508230848, 0.18320653728268882, -0.02905000414012383, -0.0016632022052105015, 0.016624212014019913, 0.10364319658210726, -0.04916500818010763, -0.23192679986575657, 0.3379766807382834, 0.004797622037998645, 0.27622833161396865, 0.04675232249160185, 0.09274622030285391, -0.021934129340666617, 0.028728259053636105, 0.01820651413038941, -0.122544895801429, -0.059226606189808316, 0.18881072991045442, 0.029745599108001758, 0.28858805272781046, -0.418971726763333, -0.21230535509712095, 0.12959211071332297, 0.18599395264362825, 0.09871139790175866, -0.05032184266927817, -0.20645756115113115, 0.07523566515660508, -0.11236639756458343, -0.19139995866501375, 0.010515492013160219, 0.05728879645598907, 0.019246841410954372, -0.2445726306607009, 0.09006306404868762, 0.09298273371796764, 0.011934667204817137, -0.13506049363286043, -0.05572091455733179, -0.07452771930578858, 0.10599432863787986, 0.06979498871625237, 0.016174774507972153, 0.11017436010049696, -0.09337765559990038, -0.04036531185216092, 0.37121128893939526, -0.1378230036777966, -0.2647917942005269, 0.15827944109229541, -0.22708173280793195, -0.07653431610224094, 0.14280909505765224, 0.15289615906266404, 0.15356830780416875, -0.08790736817079844, 0.13233077882067465, -0.04189093477102591, 0.1452095858657366, 0.04409732731184691, 0.006069949166337359, 0.17591393141551537, 0.15399714186952734, 0.13253454350146418, 0.1302850522841525, -0.07313914503324248, -0.10431569952068599, -0.3756410184957034, -0.15458478404915765, -0.16732402305706595, 0.08934752853657037, -0.09545111775566273, -0.1961038023669352, 0.3543584414737973, 0.10814213613791272, 0.22965164830023094, 0.06623516017769246, 0.29595962655565416, 0.20755643669535664, 0.05169375518878512, 0.11477944383014602, 0.21940480311506871, 0.09600160858620302, 0.09417005762183735, -0.2489706630049049, 0.07903421190996648, 0.09278009164787776]
|
1,803.08768
|
Observation of hedgehog skyrmions in sub-100 nm soft magnetic nanodots
|
Magnetic skyrmions are nanometric spin textures of outstanding potential for
spintronic applications due to unique features governed by their non-trivial
topology. It is well known that skyrmions of definite chirality are stabilized
by the Dzyaloshinskii-Moriya exchange interaction (DMI) in bulk
non-centrosimmetric materials or ultrathin films with strong spin-orbit
coupling in the interface. In this work, we report on the detection of magnetic
hedgehog-skyrmions at room temperature in confined systems with neither DMI nor
perpendicular magnetic anisotropy. We show that soft magnetic (permalloy)
nanodots are able to host non- chiral hedgehog skyrmions that can be further
stabilized by the magnetic field arising from the Magnetic Force Microscopy
probe. Analytical calculations and micromagnetic simulations confirmed the
existence of metastable N\'eel skyrmions in permalloy nanodots even without
external stimuli in a certain size range. Our work implies the existence of a
new degree of freedom to create and manipulate skyrmions in soft nanodots. The
stabilization of skyrmions in soft magnetic materials opens a possibility to
study the skymion magnetization dynamics otherwise limited due to the large
damping constant coming from the high spin-orbit coupling in materials with
high magnetic anisotropy.
|
cond-mat.mes-hall cond-mat.mtrl-sci
|
magnetic skyrmions are nanometric spin textures of outstanding potential for spintronic applications due to unique features governed by their nontrivial topology it is well known that skyrmions of definite chirality are stabilized by the dzyaloshinskiimoriya exchange interaction dmi in bulk noncentrosimmetric materials or ultrathin films with strong spinorbit coupling in the interface in this work we report on the detection of magnetic hedgehogskyrmions at room temperature in confined systems with neither dmi nor perpendicular magnetic anisotropy we show that soft magnetic permalloy nanodots are able to host non chiral hedgehog skyrmions that can be further stabilized by the magnetic field arising from the magnetic force microscopy probe analytical calculations and micromagnetic simulations confirmed the existence of metastable neel skyrmions in permalloy nanodots even without external stimuli in a certain size range our work implies the existence of a new degree of freedom to create and manipulate skyrmions in soft nanodots the stabilization of skyrmions in soft magnetic materials opens a possibility to study the skymion magnetization dynamics otherwise limited due to the large damping constant coming from the high spinorbit coupling in materials with high magnetic anisotropy
|
[['magnetic', 'skyrmions', 'are', 'nanometric', 'spin', 'textures', 'of', 'outstanding', 'potential', 'for', 'spintronic', 'applications', 'due', 'to', 'unique', 'features', 'governed', 'by', 'their', 'nontrivial', 'topology', 'it', 'is', 'well', 'known', 'that', 'skyrmions', 'of', 'definite', 'chirality', 'are', 'stabilized', 'by', 'the', 'dzyaloshinskiimoriya', 'exchange', 'interaction', 'dmi', 'in', 'bulk', 'noncentrosimmetric', 'materials', 'or', 'ultrathin', 'films', 'with', 'strong', 'spinorbit', 'coupling', 'in', 'the', 'interface', 'in', 'this', 'work', 'we', 'report', 'on', 'the', 'detection', 'of', 'magnetic', 'hedgehogskyrmions', 'at', 'room', 'temperature', 'in', 'confined', 'systems', 'with', 'neither', 'dmi', 'nor', 'perpendicular', 'magnetic', 'anisotropy', 'we', 'show', 'that', 'soft', 'magnetic', 'permalloy', 'nanodots', 'are', 'able', 'to', 'host', 'non', 'chiral', 'hedgehog', 'skyrmions', 'that', 'can', 'be', 'further', 'stabilized', 'by', 'the', 'magnetic', 'field', 'arising', 'from', 'the', 'magnetic', 'force', 'microscopy', 'probe', 'analytical', 'calculations', 'and', 'micromagnetic', 'simulations', 'confirmed', 'the', 'existence', 'of', 'metastable', 'neel', 'skyrmions', 'in', 'permalloy', 'nanodots', 'even', 'without', 'external', 'stimuli', 'in', 'a', 'certain', 'size', 'range', 'our', 'work', 'implies', 'the', 'existence', 'of', 'a', 'new', 'degree', 'of', 'freedom', 'to', 'create', 'and', 'manipulate', 'skyrmions', 'in', 'soft', 'nanodots', 'the', 'stabilization', 'of', 'skyrmions', 'in', 'soft', 'magnetic', 'materials', 'opens', 'a', 'possibility', 'to', 'study', 'the', 'skymion', 'magnetization', 'dynamics', 'otherwise', 'limited', 'due', 'to', 'the', 'large', 'damping', 'constant', 'coming', 'from', 'the', 'high', 'spinorbit', 'coupling', 'in', 'materials', 'with', 'high', 'magnetic', 'anisotropy']]
|
[-0.23750360739492887, 0.24265722158818026, 0.0018398393021040673, -0.002786647332077091, -0.11781392838755572, -0.12250479245054964, 0.014213895149264686, 0.44407873282561433, -0.2922253095343508, -0.35995518452412373, 0.0270618807719517, -0.254488907633601, -0.11395805966474015, 0.17757934240523626, 0.06498081242237744, 0.011470718514425932, -0.04604935527816918, -0.0715228907965325, -0.015377942701751315, -0.17659393333754428, 0.2597034093949038, -0.030833904833432187, 0.29596402685384493, 0.13523176346930701, 0.051135885892939326, -0.015634150917144693, 0.16288762754222655, 0.06478540590536352, -0.15586281029591684, 0.060992928571697025, 0.2052144268518188, -0.16871290141213183, 0.16797534842441342, -0.5236562978274919, -0.19769352568766554, 0.02428536417680113, 0.16246224933530432, 0.19833974450625277, -0.12495800964093792, -0.3117299598629108, 0.11580972172496085, -0.12231847656382613, -0.17575091031329657, -0.19647217131396, 0.0028078467364901225, 0.018768671493524233, -0.24807417201809584, 0.0803142106487743, 0.0836382917361334, 0.11661253772464399, -0.1514116835503562, -0.07542831076913185, -0.09517567077198544, 0.04184676015158058, 0.1079940537255056, 0.08924863151702526, 0.18765161920439552, -0.18439652571939183, -0.16458390541626391, 0.3300411734125904, -0.0317581534838757, -0.14075236442322667, 0.1825927138781628, -0.1909478735606614, -0.04938311182038003, 0.16291879215655294, 0.1417860870095398, 0.1223612062960259, -0.11974685591570026, 0.11500817044902392, 0.03113706506083946, 0.20245636815796733, 0.06753991249243955, 0.07687293992604355, 0.3286769047983595, 0.18921462441920428, 0.04128833886588345, 0.17368880443092485, -0.09794178178873719, -0.034541654277190165, -0.1972003390232252, -0.12516457709811024, -0.2727352277753321, 0.07517163013949726, -0.10375166283275404, -0.20394555564365677, 0.35529579663196126, 0.19038488015444396, 0.11987426653378518, -0.09744438548773729, 0.26345714322618535, 0.003597071548495945, 0.11487432473993583, 0.0038573536493286893, 0.3069409303052502, 0.21726927103449564, 0.16149362969036038, -0.29493474687600657, 0.06317218056175153, -0.041970520861748906]
|
1,803.08769
|
Phonons and Anomalous Thermal Expansion Behaviour of H2O and D2O ice Ih
|
In order to identify and quantitatively analyze the anharmonicity of phonons
relevant to the anomalous thermal expansion in the Ih phase of ice, we
performed neutron inelastic scattering measurements of the phonon spectrum as a
function of pressure up to 1 kbar at 225 K in deuterated ice (D2O), and as a
function of temperature over 10-225 K at ambient pressure in both H2O and D2O
ice. We also performed density functional theory calculations of the lattice
dynamics. The anomalous expansion is quantitatively reproduced from the
analysis of the neutron data as well as from the ab-initio calculations.
Further, the ab-initio calculations are used to visualize the nature of
anharmonic phonons across a large part of the Brillouin zone. We find that the
negative thermal expansion below 60 K in the hexagonal plane is due to
anharmonic librational motion of the hexagonal rings of the ice molecules, and
that along the hexagonal axis originates from the transverse vibrations of the
hexagonal layers.
|
cond-mat.mtrl-sci
|
in order to identify and quantitatively analyze the anharmonicity of phonons relevant to the anomalous thermal expansion in the ih phase of ice we performed neutron inelastic scattering measurements of the phonon spectrum as a function of pressure up to 1 kbar at 225 k in deuterated ice d2o and as a function of temperature over 10225 k at ambient pressure in both h2o and d2o ice we also performed density functional theory calculations of the lattice dynamics the anomalous expansion is quantitatively reproduced from the analysis of the neutron data as well as from the abinitio calculations further the abinitio calculations are used to visualize the nature of anharmonic phonons across a large part of the brillouin zone we find that the negative thermal expansion below 60 k in the hexagonal plane is due to anharmonic librational motion of the hexagonal rings of the ice molecules and that along the hexagonal axis originates from the transverse vibrations of the hexagonal layers
|
[['in', 'order', 'to', 'identify', 'and', 'quantitatively', 'analyze', 'the', 'anharmonicity', 'of', 'phonons', 'relevant', 'to', 'the', 'anomalous', 'thermal', 'expansion', 'in', 'the', 'ih', 'phase', 'of', 'ice', 'we', 'performed', 'neutron', 'inelastic', 'scattering', 'measurements', 'of', 'the', 'phonon', 'spectrum', 'as', 'a', 'function', 'of', 'pressure', 'up', 'to', '1', 'kbar', 'at', '225', 'k', 'in', 'deuterated', 'ice', 'd2o', 'and', 'as', 'a', 'function', 'of', 'temperature', 'over', '10225', 'k', 'at', 'ambient', 'pressure', 'in', 'both', 'h2o', 'and', 'd2o', 'ice', 'we', 'also', 'performed', 'density', 'functional', 'theory', 'calculations', 'of', 'the', 'lattice', 'dynamics', 'the', 'anomalous', 'expansion', 'is', 'quantitatively', 'reproduced', 'from', 'the', 'analysis', 'of', 'the', 'neutron', 'data', 'as', 'well', 'as', 'from', 'the', 'abinitio', 'calculations', 'further', 'the', 'abinitio', 'calculations', 'are', 'used', 'to', 'visualize', 'the', 'nature', 'of', 'anharmonic', 'phonons', 'across', 'a', 'large', 'part', 'of', 'the', 'brillouin', 'zone', 'we', 'find', 'that', 'the', 'negative', 'thermal', 'expansion', 'below', '60', 'k', 'in', 'the', 'hexagonal', 'plane', 'is', 'due', 'to', 'anharmonic', 'librational', 'motion', 'of', 'the', 'hexagonal', 'rings', 'of', 'the', 'ice', 'molecules', 'and', 'that', 'along', 'the', 'hexagonal', 'axis', 'originates', 'from', 'the', 'transverse', 'vibrations', 'of', 'the', 'hexagonal', 'layers']]
|
[-0.10929993115491982, 0.19049134926962447, -0.07006728200006218, 0.00048407971036884887, -0.009913338354018367, -0.029704323514180696, 0.10553273166182026, 0.3808980213052789, -0.2899618107641553, -0.2648237782105068, 0.03758517163733802, -0.361480324793561, -0.0973650728162654, 0.13737934227044016, 0.11113080020740997, 0.007305971737721084, -0.008399277799015429, 0.0013047914814066004, -0.06171189734631759, -0.18736950008997716, 0.23875216701654373, 0.09041741442935611, 0.24507701276790028, 0.11960551437467659, 0.04037286206450382, -0.021907314209750405, 0.04010563465352687, -0.011217724945810106, -0.18269572967085282, 0.06866716214651127, 0.27421175954679466, -0.07679766390679611, 0.14392107632011175, -0.45046788825435036, -0.21550368415881638, 0.006064395750815302, 0.118227322631872, 0.12953103870156302, 0.01805790908128759, -0.2036894799330858, 0.028731091327413364, -0.12583344739884783, -0.16478112815479737, -0.10731193467250301, -0.00013308436322359392, -0.01042341564290702, -0.21178773761134778, 0.13499996210804158, 0.016918352518351405, 0.10016399804944852, -0.13650144896768954, -0.18310196388241215, -0.11110027187452134, 0.05097792287038087, 0.04457492504289006, 0.044266837591558326, 0.20556810338130613, -0.08713461605854976, -0.06439545883992571, 0.44479628935180326, -0.13043577906770493, -0.05914382050302523, 0.1633716655584673, -0.22761513940691028, -0.09078507977652789, 0.23626080741186017, 0.15332605334769153, 0.09297591842779959, -0.12092584379758962, 0.052346823399277105, -0.015302323070096059, 0.15043628281039864, 0.09134062996743546, 0.008585322327066765, 0.2211266702995348, 0.16373734600356216, -0.019453574917681606, 0.15599220381750736, -0.17289081613970114, -0.05632239844891484, -0.2537994488073444, -0.15007463611524413, -0.2083620723361368, 0.03664628914370558, -0.10216696237258463, -0.16948727536429134, 0.34453786266852676, 0.10853882236219367, 0.1873866722252174, -0.03791012226357441, 0.2821594699987291, 0.06303616344603928, 0.09640800275977839, 0.04622385878242368, 0.25137116015244876, 0.2154617735362945, 0.11238744229086917, -0.3272823129441405, 0.036662958151327425, -0.018061293211455148]
|
1,803.0877
|
Curious convergence properties of lattice Boltzmann schemes for
diffusion with acoustic scaling
|
We consider the D1Q3 lattice Boltzmann scheme with an acoustic scale for the
simulation of diffusive processes. When the mesh is refined while holding the
diffusivity constant, we first obtain asymptotic convergence. When the mesh
size tends to zero, however, this convergence breaks down in a curious fashion,
and we observe qualitative discrepancies from analytical solutions of the heat
equation. In this work, a new asymptotic analysis is derived to explain this
phenomenon using the Taylor expansion method, and a partial differential
equation of acoustic type is obtained in the asymptotic limit. We show that the
error between the D1Q3 numerical solution and a finite-difference approximation
of this acoustic-type partial differential equation tends to zero in the
asymptotic limit. In addition, a wave vector analysis of this asymptotic regime
demonstrates that the dispersion equation has nontrivial complex eigenvalues, a
sign of underlying propagation phenomena, and a portent of the unusual
convergence properties mentioned above.
|
math.NA nlin.CG
|
we consider the d1q3 lattice boltzmann scheme with an acoustic scale for the simulation of diffusive processes when the mesh is refined while holding the diffusivity constant we first obtain asymptotic convergence when the mesh size tends to zero however this convergence breaks down in a curious fashion and we observe qualitative discrepancies from analytical solutions of the heat equation in this work a new asymptotic analysis is derived to explain this phenomenon using the taylor expansion method and a partial differential equation of acoustic type is obtained in the asymptotic limit we show that the error between the d1q3 numerical solution and a finitedifference approximation of this acoustictype partial differential equation tends to zero in the asymptotic limit in addition a wave vector analysis of this asymptotic regime demonstrates that the dispersion equation has nontrivial complex eigenvalues a sign of underlying propagation phenomena and a portent of the unusual convergence properties mentioned above
|
[['we', 'consider', 'the', 'd1q3', 'lattice', 'boltzmann', 'scheme', 'with', 'an', 'acoustic', 'scale', 'for', 'the', 'simulation', 'of', 'diffusive', 'processes', 'when', 'the', 'mesh', 'is', 'refined', 'while', 'holding', 'the', 'diffusivity', 'constant', 'we', 'first', 'obtain', 'asymptotic', 'convergence', 'when', 'the', 'mesh', 'size', 'tends', 'to', 'zero', 'however', 'this', 'convergence', 'breaks', 'down', 'in', 'a', 'curious', 'fashion', 'and', 'we', 'observe', 'qualitative', 'discrepancies', 'from', 'analytical', 'solutions', 'of', 'the', 'heat', 'equation', 'in', 'this', 'work', 'a', 'new', 'asymptotic', 'analysis', 'is', 'derived', 'to', 'explain', 'this', 'phenomenon', 'using', 'the', 'taylor', 'expansion', 'method', 'and', 'a', 'partial', 'differential', 'equation', 'of', 'acoustic', 'type', 'is', 'obtained', 'in', 'the', 'asymptotic', 'limit', 'we', 'show', 'that', 'the', 'error', 'between', 'the', 'd1q3', 'numerical', 'solution', 'and', 'a', 'finitedifference', 'approximation', 'of', 'this', 'acoustictype', 'partial', 'differential', 'equation', 'tends', 'to', 'zero', 'in', 'the', 'asymptotic', 'limit', 'in', 'addition', 'a', 'wave', 'vector', 'analysis', 'of', 'this', 'asymptotic', 'regime', 'demonstrates', 'that', 'the', 'dispersion', 'equation', 'has', 'nontrivial', 'complex', 'eigenvalues', 'a', 'sign', 'of', 'underlying', 'propagation', 'phenomena', 'and', 'a', 'portent', 'of', 'the', 'unusual', 'convergence', 'properties', 'mentioned', 'above']]
|
[-0.14464298307019122, 0.04856816215794062, -0.1359354888326397, 0.07142677707323696, -0.08621505042652179, -0.08018751178101144, 0.07373103942095113, 0.30159515254442987, -0.2968348305568927, -0.24198475741823905, 0.09900378962686542, -0.2835621711024954, -0.16005508302181376, 0.1538599523399147, -0.013152764671865632, 0.0837011812620011, 0.05300388213557502, 0.03919533011960048, -0.094445650258065, -0.1986520249347866, 0.2989671883037089, 0.029369400752734184, 0.3039239665076404, 0.03237372985280125, 0.13091160606568544, -0.05427273145566384, 0.003284328569980716, 0.02445036218367712, -0.18374471320343444, 0.06797352512336634, 0.20600668659427634, 0.010882492347626515, 0.27791203488215344, -0.39858922235107697, -0.2214845047374956, 0.06244608338958785, 0.22134445261307598, 0.15685983422954927, -0.040487334424374154, -0.240597277418619, 0.09568923154961488, -0.12476185222272, -0.21029333412355067, -0.07177696594956263, -0.0021443367826149743, 0.05372906470742819, -0.2902000369701924, 0.1386827325183606, 0.09358511301780156, 0.04025263538024102, -0.057595401227754216, -0.0759650970523069, 0.026973083983571115, 0.08743334010896255, 0.09351390718902443, -0.023802055770324335, 0.01952293955300953, -0.12373575313987661, -0.05262854981412685, 0.35128360441307616, -0.11764374331554422, -0.2388614254330819, 0.14899574779430588, -0.17884805438841475, -0.09539798680035506, 0.13569537984904242, 0.16007293611643167, 0.1265564789825113, -0.12395058303034341, 0.12069535956206713, -0.03610667968281085, 0.14754256511752317, 0.08314847828077725, -0.011296356163821578, 0.09692319124340525, 0.18440909586006812, 0.06912826249388114, 0.1352061686331248, -0.04942406244801199, -0.11167714963941013, -0.3398337227968024, -0.15485705074921152, -0.1663263436175542, 0.0945587513173795, -0.14588894541192726, -0.19699966487112558, 0.3581864414699298, 0.16858294602556556, 0.19773918604843466, 0.08240848944029387, 0.2942935149124489, 0.20817886549809012, -0.01495592575520277, 0.09724638411726534, 0.2371751981292048, 0.1737042790959023, 0.14987954663057976, -0.2801218495043786, 0.04229547243467928, 0.11608620134967507]
|
1,803.08771
|
Semiclassical analysis of dispersion phenomena
|
Our aim in this work is to give some quantitative insight on the dispersive
effects exhibited by solutions of a semiclassical Schr{\"o}dinger-type equation
in R d. We describe quantitatively the localisation of the energy in a
long-time semiclassical limit within this non compact geometry and exhibit
conditions under which the energy remains localized on compact sets. We also
explain how our results can be applied in a straightforward way to describe
obstructions to the validity of smoothing type estimates.
|
math.AP math-ph math.MP
|
our aim in this work is to give some quantitative insight on the dispersive effects exhibited by solutions of a semiclassical schrodingertype equation in r d we describe quantitatively the localisation of the energy in a longtime semiclassical limit within this non compact geometry and exhibit conditions under which the energy remains localized on compact sets we also explain how our results can be applied in a straightforward way to describe obstructions to the validity of smoothing type estimates
|
[['our', 'aim', 'in', 'this', 'work', 'is', 'to', 'give', 'some', 'quantitative', 'insight', 'on', 'the', 'dispersive', 'effects', 'exhibited', 'by', 'solutions', 'of', 'a', 'semiclassical', 'schrodingertype', 'equation', 'in', 'r', 'd', 'we', 'describe', 'quantitatively', 'the', 'localisation', 'of', 'the', 'energy', 'in', 'a', 'longtime', 'semiclassical', 'limit', 'within', 'this', 'non', 'compact', 'geometry', 'and', 'exhibit', 'conditions', 'under', 'which', 'the', 'energy', 'remains', 'localized', 'on', 'compact', 'sets', 'we', 'also', 'explain', 'how', 'our', 'results', 'can', 'be', 'applied', 'in', 'a', 'straightforward', 'way', 'to', 'describe', 'obstructions', 'to', 'the', 'validity', 'of', 'smoothing', 'type', 'estimates']]
|
[-0.09842293011171956, 0.04474240944933005, -0.15855641619455588, 0.13056506567098247, -0.06417198872629883, -0.08889675596021587, 0.03422499743372768, 0.3519183591456164, -0.2443185852475087, -0.24463286453009217, 0.08996763751146537, -0.22545518719037122, -0.1600753069749173, 0.22566989344792276, -0.10860767096127796, 0.008390078580454935, 0.055289284797691844, 0.034076137798307815, -0.07121954041922206, -0.22228819470192435, 0.33606749926428486, 0.023852750774667468, 0.24588140244065207, 0.10992243684035478, 0.032452563849525363, -0.029621370649554685, 0.0033060826974201808, 0.05235277317299307, -0.21492987766248894, 0.12300761207006872, 0.2500861677329374, 0.04727846809627512, 0.24130496227099926, -0.4420432836123848, -0.22013465170689586, 0.0583931821622426, 0.14053472957523727, 0.1345259213121608, -0.0330101106392479, -0.2925937978102814, 0.08681974803757724, -0.11945224446067705, -0.22358341575187596, -0.13586429525402527, -0.00042978697751141804, 0.02838941431262448, -0.23081954909102473, 0.10460601348239823, 0.11034573498476721, -0.00996539576710025, -0.09500054834717059, -0.00993919834683213, 0.049394094821395756, 0.0871754304470518, 0.03142291740396449, -0.01271409617701569, 0.054992799959558095, -0.08722992888592844, -0.0726736555630459, 0.35883624158516714, -0.09640789334956981, -0.26977032074068164, 0.2071583651336311, -0.1679766043442997, -0.1318930918645538, 0.1147142085777242, 0.1633415834306256, 0.1256434231454247, -0.16188396695232066, 0.12862019956368317, -0.04415218366451467, 0.13912226928389632, 0.05277257354611743, 0.06919269356876612, 0.1641413928304292, 0.16999120088412037, 0.05988248024147617, 0.13140475830281317, -0.05169683772056729, -0.07486945416636859, -0.3531799540159446, -0.12548130106982552, -0.1576101042011965, 0.11493278571840705, -0.08507867683814926, -0.16582637857881527, 0.4435357860513503, 0.18278630616001879, 0.21204196888646937, 0.04109920196005296, 0.24256779393181205, 0.12305756382308193, 0.0024660302538283265, 0.06449891826656612, 0.24897717912806658, 0.144753005665055, 0.09490961350995718, -0.23402486684366683, 0.006069372838386629, 0.08949294540135166]
|
1,803.08772
|
Small deviation for Random walk with random environment in time
|
We give the random environment version of Mogul'ski\v{\i} estimation in
quenched sense.Assume that $\{\mu\}_{n\in\bfN}$ (called environment) is a
sequence of i.i.d. random probability measures on $\bfR.$~ Let
$\{X_n\}_{n\in\bfN}$ be a sequence of independent random variables, where $X_n$
has law $\mu_n.$ We set $S_n=\sum_{i=1}^{n}X_i.$ Under some integrability
conditions, we show that on the log scale, for any power function $f$. the
decay rate of $$\bfP_\mu(\forall_{0\leq i\leq n}
S_{f(n)+i}\in[g(i/n)n^{\alpha},h(i/n)n^{\alpha}]|S_{f(n)}=x)$$ is
$e^{-cn^{1-2\alpha}}$ almost surely as $n\rightarrow+\infty$, where
$c>0,\alpha\in(0,\frac{1}{2}),$ $g,h\in\mathcal{C}[0,1]$ (the set of all
continuous functions defined on $[0,1]),$ $g(s)<h(s), \forall s\in[0,1],$ and
$x\in(g(0),h(0)).$ The main result of this paper is also a basic tool in the
researching of Branching random walk in random environment with selection.
|
math.PR
|
we give the random environment version of mogulskivi estimation in quenched senseassume that mu_ninbfn called environment is a sequence of iid random probability measures on bfr let x_n_ninbfn be a sequence of independent random variables where x_n has law mu_n we set s_nsum_i1nx_i under some integrability conditions we show that on the log scale for any power function f the decay rate of bfp_muforall_0leq ileq n s_fniinginnalphahinnalphas_fnx is ecn12alpha almost surely as nrightarrowinfty where c0alphain0frac12 ghinmathcalc01 the set of all continuous functions defined on 01 gshs forall sin01 and xing0h0 the main result of this paper is also a basic tool in the researching of branching random walk in random environment with selection
|
[['we', 'give', 'the', 'random', 'environment', 'version', 'of', 'mogulskivi', 'estimation', 'in', 'quenched', 'senseassume', 'that', 'mu_ninbfn', 'called', 'environment', 'is', 'a', 'sequence', 'of', 'iid', 'random', 'probability', 'measures', 'on', 'bfr', 'let', 'x_n_ninbfn', 'be', 'a', 'sequence', 'of', 'independent', 'random', 'variables', 'where', 'x_n', 'has', 'law', 'mu_n', 'we', 'set', 's_nsum_i1nx_i', 'under', 'some', 'integrability', 'conditions', 'we', 'show', 'that', 'on', 'the', 'log', 'scale', 'for', 'any', 'power', 'function', 'f', 'the', 'decay', 'rate', 'of', 'bfp_muforall_0leq', 'ileq', 'n', 's_fniinginnalphahinnalphas_fnx', 'is', 'ecn12alpha', 'almost', 'surely', 'as', 'nrightarrowinfty', 'where', 'c0alphain0frac12', 'ghinmathcalc01', 'the', 'set', 'of', 'all', 'continuous', 'functions', 'defined', 'on', '01', 'gshs', 'forall', 'sin01', 'and', 'xing0h0', 'the', 'main', 'result', 'of', 'this', 'paper', 'is', 'also', 'a', 'basic', 'tool', 'in', 'the', 'researching', 'of', 'branching', 'random', 'walk', 'in', 'random', 'environment', 'with', 'selection']]
|
[-0.15235056623972465, 0.1693030755641391, -0.0716830084000904, 0.014151032202542551, 0.021007116167417284, -0.13577140221887637, 0.06497371942143959, 0.3751948984719596, -0.2707924991393986, -0.17380153445653546, 0.11582117477879471, -0.2834828887722518, -0.1405601511851803, 0.1611954758884114, -0.10168064807912389, 0.06187397647802763, 0.013533850713605874, 0.08876654611068588, 0.01689032496414283, -0.28068554379696986, 0.3163286056369543, -0.03829356150032537, 0.22181081508955403, -0.022122412968033616, 0.10349631034859537, 0.06319789487633456, 0.008488585634464488, -0.015527211816854847, -0.15449874298898525, 0.004192565278448526, 0.18370523093973548, 0.16742488180191958, 0.3277199287148355, -0.3203344252819503, -0.13975862380641613, 0.2213654023644885, 0.15820244852977905, -0.012135433312561996, -0.026146255870964558, -0.26856640075306293, 0.15675945438046768, -0.11231487149681255, -0.12332330763258618, -0.014224218335160896, 0.0700234636818104, 0.10634818849000104, -0.3898196430352417, 0.04294740045143662, 0.105092903061146, 0.04869614584027853, -0.007344369301843701, -0.14614418532825935, 0.02388351681434269, 0.11628162631204406, 0.017965341779150212, 0.10554291633889079, 0.12912393975279574, -0.047851400499602834, -0.09888903406285907, 0.3602716384582149, -0.09679885624989289, -0.2516209418587025, 0.12346790164021902, -0.1970501559406736, -0.21699824374964805, 0.05436478285751875, 0.17729435686685496, 0.13196516996488322, -0.15879728649155173, 0.16036989059676732, -0.10588616419592602, 0.150743183805336, 0.04055698401773873, 0.062391179613769054, 0.108709031067228, 0.14386068129441837, 0.12421914330204424, 0.14273221884713988, -0.01221102007972167, -0.07785767633287073, -0.3588781284023691, -0.13031588000182098, -0.2561577169339905, 0.18451425958497142, -0.18811084503673572, -0.20808756215389348, 0.32473351168039355, 0.1510846414648503, 0.22258825518769546, 0.178821309270717, 0.221940298591858, 0.14625141961026475, -0.052884513139272636, 0.09469464278409204, 0.03683372460067209, 0.15992794180677716, 0.02492982002192186, -0.1214536498345941, 0.12742680318888674, 0.11023375008354705]
|
1,803.08773
|
Detecting Adversarial Perturbations with Saliency
|
In this paper we propose a novel method for detecting adversarial examples by
training a binary classifier with both origin data and saliency data. In the
case of image classification model, saliency simply explain how the model make
decisions by identifying significant pixels for prediction. A model shows wrong
classification output always learns wrong features and shows wrong saliency as
well. Our approach shows good performance on detecting adversarial
perturbations. We quantitatively evaluate generalization ability of the
detector, showing that detectors trained with strong adversaries perform well
on weak adversaries.
|
cs.LG stat.ML
|
in this paper we propose a novel method for detecting adversarial examples by training a binary classifier with both origin data and saliency data in the case of image classification model saliency simply explain how the model make decisions by identifying significant pixels for prediction a model shows wrong classification output always learns wrong features and shows wrong saliency as well our approach shows good performance on detecting adversarial perturbations we quantitatively evaluate generalization ability of the detector showing that detectors trained with strong adversaries perform well on weak adversaries
|
[['in', 'this', 'paper', 'we', 'propose', 'a', 'novel', 'method', 'for', 'detecting', 'adversarial', 'examples', 'by', 'training', 'a', 'binary', 'classifier', 'with', 'both', 'origin', 'data', 'and', 'saliency', 'data', 'in', 'the', 'case', 'of', 'image', 'classification', 'model', 'saliency', 'simply', 'explain', 'how', 'the', 'model', 'make', 'decisions', 'by', 'identifying', 'significant', 'pixels', 'for', 'prediction', 'a', 'model', 'shows', 'wrong', 'classification', 'output', 'always', 'learns', 'wrong', 'features', 'and', 'shows', 'wrong', 'saliency', 'as', 'well', 'our', 'approach', 'shows', 'good', 'performance', 'on', 'detecting', 'adversarial', 'perturbations', 'we', 'quantitatively', 'evaluate', 'generalization', 'ability', 'of', 'the', 'detector', 'showing', 'that', 'detectors', 'trained', 'with', 'strong', 'adversaries', 'perform', 'well', 'on', 'weak', 'adversaries']]
|
[-0.028848227568798596, -0.049707549629319045, -0.06594012062220524, 0.13270773992020016, -0.08447547105865347, -0.25662458028333884, 0.07303451366024091, 0.4436918044255839, -0.2106855766226848, -0.36309295639188754, 0.025835849290403227, -0.3046019159671333, -0.24594549840937058, 0.15907716609767197, -0.19799217910816272, 0.1014895920900421, 0.16978611258996856, 0.057776191846157114, -0.01911497369874269, -0.2954661603266787, 0.31546697537932133, 0.09919756375667121, 0.34589413865986796, 0.01627018746609489, 0.12954740054232794, -0.04253775855112407, -0.05791663810507291, 0.013367727316088146, -0.03544188605713619, 0.09705334302658836, 0.3186352895939813, 0.1823019869522088, 0.29445566043982074, -0.3700037408206198, -0.24039666852396396, 0.10381048636304008, 0.08706327458947069, 0.1500571306174, -0.07862535541903021, -0.41103067508148444, 0.10619477339140657, -0.17838673283242518, 0.009264843724668025, -0.18781878698306778, -0.07744331993680033, -0.041540865517324874, -0.28208693121042516, 0.05895295984422167, 0.12221298358247926, 0.043120642472866975, -0.059768491709190935, -0.057876736199897194, 0.012354509035746256, 0.13246759593021123, 0.06482889118940673, 0.046815195105349025, 0.12706057297893697, -0.20621268968025105, -0.1587947091087699, 0.3281816481509142, -0.11220680442121293, -0.21761158333780864, 0.17145236163503594, -0.04570872627405657, -0.12143629871101844, 0.07711695601853231, 0.2386860470390982, 0.12128504807543423, -0.131862436943791, -0.04402213840253858, -0.03423718861821625, 0.20922337664912144, 0.02559378274664697, -0.0466058554334773, 0.21588043542449467, 0.25658224103972316, 0.026287106134825284, 0.1833887707739551, -0.1607628178650177, -0.018323452665936203, -0.2609778877761629, -0.06376414377656248, -0.18019865662014733, -0.007373661858340105, -0.0998719546526748, -0.15163400307452926, 0.42754856994272106, 0.2912140196913646, 0.2795986809457342, 0.14171954952180385, 0.3861871799479963, -0.029046580055728556, 0.05568000542310377, 0.08192991491200195, 0.23951292705411711, 0.003549323577640785, 0.06000360592992769, -0.16167296936037018, 0.152083927543006, 0.04890755983845641]
|
1,803.08774
|
Vanishing theorems and Brauer-Hasse-Noether exact sequences for the
cohomology of higher-dimensional fields
|
Let $k$ be a finite field, a $p$-adic field or a number field. Let $K$ be a
finite extension of the Laurent series field in $m$ variables
$k((x_1,...,x_m))$ or, more generally, a finite extension of the field of
rational functions $k((x_1,...,x_m))(y_1,...,y_n)$. When $r$ is an integer, we
consider the Galois module $\mathbb{Q}/\mathbb{Z}(r)$ over $K$ and we prove
several vanishing theorems for its cohomology. In the particular case when $K$
is a finite extension of the Laurent series field in two variables
$k((x_1,x_2))$, we also prove exact sequences that play the role of the
Brauer-Hasse-Noether exact sequence for the field $K$ and that involve some of
the cohomology groups of $\mathbb{Q}/\mathbb{Z}(r)$ which do not vanish.
|
math.AG math.NT
|
let k be a finite field a padic field or a number field let k be a finite extension of the laurent series field in m variables kx_1x_m or more generally a finite extension of the field of rational functions kx_1x_my_1y_n when r is an integer we consider the galois module mathbbqmathbbzr over k and we prove several vanishing theorems for its cohomology in the particular case when k is a finite extension of the laurent series field in two variables kx_1x_2 we also prove exact sequences that play the role of the brauerhassenoether exact sequence for the field k and that involve some of the cohomology groups of mathbbqmathbbzr which do not vanish
|
[['let', 'k', 'be', 'a', 'finite', 'field', 'a', 'padic', 'field', 'or', 'a', 'number', 'field', 'let', 'k', 'be', 'a', 'finite', 'extension', 'of', 'the', 'laurent', 'series', 'field', 'in', 'm', 'variables', 'kx_1x_m', 'or', 'more', 'generally', 'a', 'finite', 'extension', 'of', 'the', 'field', 'of', 'rational', 'functions', 'kx_1x_my_1y_n', 'when', 'r', 'is', 'an', 'integer', 'we', 'consider', 'the', 'galois', 'module', 'mathbbqmathbbzr', 'over', 'k', 'and', 'we', 'prove', 'several', 'vanishing', 'theorems', 'for', 'its', 'cohomology', 'in', 'the', 'particular', 'case', 'when', 'k', 'is', 'a', 'finite', 'extension', 'of', 'the', 'laurent', 'series', 'field', 'in', 'two', 'variables', 'kx_1x_2', 'we', 'also', 'prove', 'exact', 'sequences', 'that', 'play', 'the', 'role', 'of', 'the', 'brauerhassenoether', 'exact', 'sequence', 'for', 'the', 'field', 'k', 'and', 'that', 'involve', 'some', 'of', 'the', 'cohomology', 'groups', 'of', 'mathbbqmathbbzr', 'which', 'do', 'not', 'vanish']]
|
[-0.248926055629272, 0.12763144223731201, -0.13564881886440244, 0.02999870675742965, -0.07959258936514908, -0.12447357427498157, -0.009488440439401363, 0.3104151817885312, -0.3174189439551397, -0.21069742984731088, 0.11752217268169096, -0.2120341222733259, -0.12501630631741137, 0.19745916106462988, -0.05593025704041462, -0.06901209708673625, -0.010513543252917854, 0.17585097418844023, -0.05040812299332836, -0.32195385472891347, 0.3443939674984325, -0.06598467210477049, 0.15038283506450667, 0.021299833855168385, 0.0943906249309128, 0.051423664920201353, 0.007749830287965861, 0.04844403341835873, -0.11256178609076993, 0.06234176872213456, 0.3307890421964905, 0.062071377458050844, 0.31083619352430103, -0.38683495795862244, -0.1663882458921183, 0.23341250273991715, 0.15579619759016416, 0.025345374570778487, -0.02096099855486748, -0.19515361343722112, 0.15521142626900902, -0.15680517988088963, -0.13293463557281276, -0.07474146753718908, 0.07206370490073988, 0.04533949297514151, -0.3229377994567833, -0.004591344113048928, 0.11175575291060588, 0.19907581248235973, -0.06210299188969657, -0.14747500663453883, 0.024834544452923265, 0.06975601220090705, 0.013494376820215787, 0.08773332034576345, 0.0751688336614858, -0.12069568534974348, -0.09246416229924018, 0.3334004908038134, -0.12747605137145993, -0.20552825848571957, 0.09911145989529112, -0.20104400056668303, -0.141695990244096, 0.1261973019011996, 0.09087491438470104, 0.19858648046343164, -0.028554644449666905, 0.2232088017351502, -0.1203074318356812, 0.10696515139319342, 0.06280487084083937, -0.004785432658073577, 0.19001580596562814, 0.010310464954487874, 0.08034742049322548, 0.13361519262490965, -0.002600441352379593, -0.04851341261105104, -0.3699576259675351, -0.2224778851388361, -0.15247271308167415, 0.10970555548384171, -0.136489695488126, -0.20302692297211086, 0.3792842445387082, 0.11357948620041664, 0.18886834716593678, 0.11655643297973174, 0.2125235772987997, 0.12737629834816538, 0.056788554780227554, 0.06436198128133334, 0.07468739302368538, 0.23943185944279485, -0.0003715564041737128, -0.1781163851561194, -0.03334789881059392, 0.14214204611595382]
|
1,803.08775
|
Large Fluctuations in two-level systems with stimulated emission
|
We consider a system of $N$ identical independent Markov processes, each
taking values 0 or 1. The system describes a stochastic dynamics of an ensemble
of two-level atoms. The atoms are exposed to a photon flux. Under the photon
flux action, every atom changes its state with some intensities either from its
ground state (state 0) to the excited state (state 1) or from the excited state
to the ground state (the stimulated emission). The atom can also change the
state from the excited to the ground one spontaneously.
We study rare events when the big cumulative emission occurs on the fixed
time interval $[0,T]$. To this end we apply the large deviation theory which
allows one to make asymptotic analysis as $N\to\infty$.
|
math.PR
|
we consider a system of n identical independent markov processes each taking values 0 or 1 the system describes a stochastic dynamics of an ensemble of twolevel atoms the atoms are exposed to a photon flux under the photon flux action every atom changes its state with some intensities either from its ground state state 0 to the excited state state 1 or from the excited state to the ground state the stimulated emission the atom can also change the state from the excited to the ground one spontaneously we study rare events when the big cumulative emission occurs on the fixed time interval 0t to this end we apply the large deviation theory which allows one to make asymptotic analysis as ntoinfty
|
[['we', 'consider', 'a', 'system', 'of', 'n', 'identical', 'independent', 'markov', 'processes', 'each', 'taking', 'values', '0', 'or', '1', 'the', 'system', 'describes', 'a', 'stochastic', 'dynamics', 'of', 'an', 'ensemble', 'of', 'twolevel', 'atoms', 'the', 'atoms', 'are', 'exposed', 'to', 'a', 'photon', 'flux', 'under', 'the', 'photon', 'flux', 'action', 'every', 'atom', 'changes', 'its', 'state', 'with', 'some', 'intensities', 'either', 'from', 'its', 'ground', 'state', 'state', '0', 'to', 'the', 'excited', 'state', 'state', '1', 'or', 'from', 'the', 'excited', 'state', 'to', 'the', 'ground', 'state', 'the', 'stimulated', 'emission', 'the', 'atom', 'can', 'also', 'change', 'the', 'state', 'from', 'the', 'excited', 'to', 'the', 'ground', 'one', 'spontaneously', 'we', 'study', 'rare', 'events', 'when', 'the', 'big', 'cumulative', 'emission', 'occurs', 'on', 'the', 'fixed', 'time', 'interval', '0t', 'to', 'this', 'end', 'we', 'apply', 'the', 'large', 'deviation', 'theory', 'which', 'allows', 'one', 'to', 'make', 'asymptotic', 'analysis', 'as', 'ntoinfty']]
|
[-0.11072888603903414, 0.21919297416066483, -0.048923105137740695, 0.05747938118553228, 0.02165902204001398, -0.12778569273726365, 0.0995210562539249, 0.37241121539770344, -0.28031811511855786, -0.24962179302578655, 0.07865278079454613, -0.3547910365364297, 0.0034097831457762457, 0.0916683915888936, 0.018281933866683545, 0.03835109782765328, 0.07380642138073236, 0.10635430615289303, -0.023698427234549166, -0.16111907548634563, 0.3202720704352165, 0.020199141150900747, 0.26154936176565724, -0.020013460535953594, 0.12232450005121348, -0.005624235183666877, 0.11030888443100985, -0.05607042469110764, -0.09504264906593939, 0.04536875459604293, 0.21054233551570556, 0.10603972516306326, 0.2644426545499241, -0.4517914623169255, -0.1703914615318058, 0.15032479327505197, 0.13057290146679132, 0.16250319948809872, 0.016397590600370573, -0.3488717164798844, -0.022868744724210563, -0.1538841409487574, -0.1607640116206726, -0.029800493535169257, 0.01247295776260941, -3.210266453887874e-05, -0.2725469332824393, 0.024775880201278647, 0.03575144180975006, 0.000522402228742111, -0.0843069099700949, -0.10876301199583928, -0.03761643187968227, 0.1417964176093588, 0.05772998779387463, 0.03725712058300955, 0.17087078964426675, -0.11057407462144105, -0.09469052887998702, 0.34555743075126394, -0.1337661735431435, -0.1368095538450208, 0.17763013940879968, -0.17755506137325391, -0.12917501275707793, 0.19132938173909983, 0.1305938487355711, 0.1412864212302597, -0.09053777424276455, 0.058664021074650734, 0.009009842738145736, 0.22222156125325254, 0.02432550678817116, 0.04528439131837974, 0.18073080044345763, 0.13378401628952868, 0.05930420345195183, 0.17770558295059738, -0.1327691397883331, -0.13603766607423504, -0.3105390024469878, -0.15022018268359902, -0.19980270633231698, 0.14013533691811278, -0.02548542609665452, -0.15225352787571708, 0.381363029345658, 0.13967679365257907, 0.2069041218903915, 0.008171329063711673, 0.25656984928177623, 0.1735570148320687, -0.044441316261645256, 0.06290708726737648, 0.20587744316719359, 0.12371338924726213, 0.08269108000506716, -0.24400651654819164, 0.060769475152246594, 0.009921726725268655]
|
1,803.08776
|
Observation of a well-defined hybridization gap and in-gap states on the
SmB6 (001) surface
|
The rise of topology in condensed matter physics has generated strong
interest in identifying novel quantum materials in which topological protection
is driven by electronic correlations. Samarium hexaboride is a Kondo insulator
for which it has been proposed that a band inversion between $5d$ and $4f$
bands gives rise to topologically protected surface states. However,
unambiguous proof of the existence and topological nature of these surface
states is still missing, and its low-energy electronic structure is still not
fully established. Here we present a study of samarium hexaboride by
ultra-low-temperature scanning tunneling microscopy and spectroscopy. We obtain
clear atomically resolved topographic images of the sample surface. Our
tunneling spectra reveal signatures of a hybridization gap with a size of about
$8\ \mathrm{meV}$ and with a reduction of the differential conductance inside
the gap by almost half, and surprisingly, several strong resonances below the
Fermi level. The spatial variations of the energy of the resonances point
towards a microscopic variation of the electronic states by the different
surface terminations. High-resolution tunneling spectra acquired at $100\
\mathrm{mK}$ reveal a splitting of the Kondo resonance, possibly due to the
crystal electric field.
|
cond-mat.str-el
|
the rise of topology in condensed matter physics has generated strong interest in identifying novel quantum materials in which topological protection is driven by electronic correlations samarium hexaboride is a kondo insulator for which it has been proposed that a band inversion between 5d and 4f bands gives rise to topologically protected surface states however unambiguous proof of the existence and topological nature of these surface states is still missing and its lowenergy electronic structure is still not fully established here we present a study of samarium hexaboride by ultralowtemperature scanning tunneling microscopy and spectroscopy we obtain clear atomically resolved topographic images of the sample surface our tunneling spectra reveal signatures of a hybridization gap with a size of about 8 mathrmmev and with a reduction of the differential conductance inside the gap by almost half and surprisingly several strong resonances below the fermi level the spatial variations of the energy of the resonances point towards a microscopic variation of the electronic states by the different surface terminations highresolution tunneling spectra acquired at 100 mathrmmk reveal a splitting of the kondo resonance possibly due to the crystal electric field
|
[['the', 'rise', 'of', 'topology', 'in', 'condensed', 'matter', 'physics', 'has', 'generated', 'strong', 'interest', 'in', 'identifying', 'novel', 'quantum', 'materials', 'in', 'which', 'topological', 'protection', 'is', 'driven', 'by', 'electronic', 'correlations', 'samarium', 'hexaboride', 'is', 'a', 'kondo', 'insulator', 'for', 'which', 'it', 'has', 'been', 'proposed', 'that', 'a', 'band', 'inversion', 'between', '5d', 'and', '4f', 'bands', 'gives', 'rise', 'to', 'topologically', 'protected', 'surface', 'states', 'however', 'unambiguous', 'proof', 'of', 'the', 'existence', 'and', 'topological', 'nature', 'of', 'these', 'surface', 'states', 'is', 'still', 'missing', 'and', 'its', 'lowenergy', 'electronic', 'structure', 'is', 'still', 'not', 'fully', 'established', 'here', 'we', 'present', 'a', 'study', 'of', 'samarium', 'hexaboride', 'by', 'ultralowtemperature', 'scanning', 'tunneling', 'microscopy', 'and', 'spectroscopy', 'we', 'obtain', 'clear', 'atomically', 'resolved', 'topographic', 'images', 'of', 'the', 'sample', 'surface', 'our', 'tunneling', 'spectra', 'reveal', 'signatures', 'of', 'a', 'hybridization', 'gap', 'with', 'a', 'size', 'of', 'about', '8', 'mathrmmev', 'and', 'with', 'a', 'reduction', 'of', 'the', 'differential', 'conductance', 'inside', 'the', 'gap', 'by', 'almost', 'half', 'and', 'surprisingly', 'several', 'strong', 'resonances', 'below', 'the', 'fermi', 'level', 'the', 'spatial', 'variations', 'of', 'the', 'energy', 'of', 'the', 'resonances', 'point', 'towards', 'a', 'microscopic', 'variation', 'of', 'the', 'electronic', 'states', 'by', 'the', 'different', 'surface', 'terminations', 'highresolution', 'tunneling', 'spectra', 'acquired', 'at', '100', 'mathrmmk', 'reveal', 'a', 'splitting', 'of', 'the', 'kondo', 'resonance', 'possibly', 'due', 'to', 'the', 'crystal', 'electric', 'field']]
|
[-0.1638043453478348, 0.16874106420714052, -0.10105524881787244, 0.07316546030490408, -0.027128854544359635, -0.15813955997989054, 0.09509003510490484, 0.35297327102580794, -0.26136162884335684, -0.3508837241186667, 0.013067467269369417, -0.33236105136928107, -0.12897966559434298, 0.163729269879503, 0.017356947781707124, 0.010073085906841452, 0.00906235252373985, -0.06879406277504233, -0.09445879431367511, -0.167840324755787, 0.31498437865006507, 0.0321724940474495, 0.29466105478559496, 0.1396038869171645, 0.03949073222145517, -0.008585064030109496, 0.07871864813936766, 0.01997190917147294, -0.14156227655944853, 0.10803024113152383, 0.2603626362190991, -0.07303318482880337, 0.2015080948485919, -0.43178340275481647, -0.21735362768069738, -0.004188666479888732, 0.11987690986614556, 0.1551175491881887, -0.12034043815188977, -0.3311064861697593, 0.06579260689529182, -0.10296654697783568, -0.09923533696149077, -0.1074581463746086, -0.004186338773391471, -0.08088312438189017, -0.17654456666001814, 0.09426064974450994, 0.037693113270930195, 0.13576442102788303, -0.0898386299623689, -0.08959576465243661, -0.10340724527840774, 0.07152156405170601, 0.026421273333542838, 0.014335406561802195, 0.11806959660093068, -0.12587479865868334, -0.12349363361243848, 0.3434516059224883, -0.05156623081565297, -0.07284081121167493, 0.20054383833877862, -0.2018129509730787, -0.07107717218616652, 0.22098570741052745, 0.08232894992898095, 0.08163627873485287, -0.1293067002583359, 0.11131095099472317, -0.03031680195360745, 0.19648117670206053, 0.045234776057657744, 0.1283707176211965, 0.27766105129565827, 0.18826997638606127, 0.07288446794288657, 0.1057755006378684, -0.17569992508709667, -0.02972905234576612, -0.23978065253141775, -0.17076047573475137, -0.24122023075897858, 0.08000620560132018, 0.01997338256336103, -0.2172271301082912, 0.4644119155361618, 0.08090153313857854, 0.21870346760461057, -0.08302633492855069, 0.24166808613309904, 0.08870726313611996, 0.07325781159664667, 0.014740253256624022, 0.24561642942132142, 0.18688449895664774, 0.09231392185267791, -0.2845998218285521, 0.06219226523997292, -0.00838131935547584]
|
1,803.08777
|
Data Streams with Bounded Deletions
|
Two prevalent models in the data stream literature are the insertion-only and
turnstile models. Unfortunately, many important streaming problems require a
$\Theta(\log(n))$ multiplicative factor more space for turnstile streams than
for insertion-only streams. This complexity gap often arises because the
underlying frequency vector $f$ is very close to $0$, after accounting for all
insertions and deletions to items. Signal detection in such streams is
difficult, given the large number of deletions.
In this work, we propose an intermediate model which, given a parameter
$\alpha \geq 1$, lower bounds the norm $\|f\|_p$ by a $1/\alpha$-fraction of
the $L_p$ mass of the stream had all updates been positive. Here, for a vector
$f$, $\|f\|_p = \left (\sum_{i=1}^n |f_i|^p \right )^{1/p}$, and the value of
$p$ we choose depends on the application. This gives a fluid medium between
insertion only streams (with $\alpha = 1$), and turnstile streams (with $\alpha
= \text{poly}(n)$), and allows for analysis in terms of $\alpha$.
We show that for streams with this $\alpha$-property, for many fundamental
streaming problems we can replace a $O(\log(n))$ factor in the space usage for
algorithms in the turnstile model with a $O(\log(\alpha))$ factor. This is true
for identifying heavy hitters, inner product estimation, $L_0$ estimation,
$L_1$ estimation, $L_1$ sampling, and support sampling. For each problem, we
give matching or nearly matching lower bounds for $\alpha$-property streams. We
note that in practice, many important turnstile data streams are in fact
$\alpha$-property streams for small values of $\alpha$. For such applications,
our results represent significant improvements in efficiency for all the
aforementioned problems.
|
cs.DS
|
two prevalent models in the data stream literature are the insertiononly and turnstile models unfortunately many important streaming problems require a thetalogn multiplicative factor more space for turnstile streams than for insertiononly streams this complexity gap often arises because the underlying frequency vector f is very close to 0 after accounting for all insertions and deletions to items signal detection in such streams is difficult given the large number of deletions in this work we propose an intermediate model which given a parameter alpha geq 1 lower bounds the norm f_p by a 1alphafraction of the l_p mass of the stream had all updates been positive here for a vector f f_p left sum_i1n f_ip right 1p and the value of p we choose depends on the application this gives a fluid medium between insertion only streams with alpha 1 and turnstile streams with alpha textpolyn and allows for analysis in terms of alpha we show that for streams with this alphaproperty for many fundamental streaming problems we can replace a ologn factor in the space usage for algorithms in the turnstile model with a ologalpha factor this is true for identifying heavy hitters inner product estimation l_0 estimation l_1 estimation l_1 sampling and support sampling for each problem we give matching or nearly matching lower bounds for alphaproperty streams we note that in practice many important turnstile data streams are in fact alphaproperty streams for small values of alpha for such applications our results represent significant improvements in efficiency for all the aforementioned problems
|
[['two', 'prevalent', 'models', 'in', 'the', 'data', 'stream', 'literature', 'are', 'the', 'insertiononly', 'and', 'turnstile', 'models', 'unfortunately', 'many', 'important', 'streaming', 'problems', 'require', 'a', 'thetalogn', 'multiplicative', 'factor', 'more', 'space', 'for', 'turnstile', 'streams', 'than', 'for', 'insertiononly', 'streams', 'this', 'complexity', 'gap', 'often', 'arises', 'because', 'the', 'underlying', 'frequency', 'vector', 'f', 'is', 'very', 'close', 'to', '0', 'after', 'accounting', 'for', 'all', 'insertions', 'and', 'deletions', 'to', 'items', 'signal', 'detection', 'in', 'such', 'streams', 'is', 'difficult', 'given', 'the', 'large', 'number', 'of', 'deletions', 'in', 'this', 'work', 'we', 'propose', 'an', 'intermediate', 'model', 'which', 'given', 'a', 'parameter', 'alpha', 'geq', '1', 'lower', 'bounds', 'the', 'norm', 'f_p', 'by', 'a', '1alphafraction', 'of', 'the', 'l_p', 'mass', 'of', 'the', 'stream', 'had', 'all', 'updates', 'been', 'positive', 'here', 'for', 'a', 'vector', 'f', 'f_p', 'left', 'sum_i1n', 'f_ip', 'right', '1p', 'and', 'the', 'value', 'of', 'p', 'we', 'choose', 'depends', 'on', 'the', 'application', 'this', 'gives', 'a', 'fluid', 'medium', 'between', 'insertion', 'only', 'streams', 'with', 'alpha', '1', 'and', 'turnstile', 'streams', 'with', 'alpha', 'textpolyn', 'and', 'allows', 'for', 'analysis', 'in', 'terms', 'of', 'alpha', 'we', 'show', 'that', 'for', 'streams', 'with', 'this', 'alphaproperty', 'for', 'many', 'fundamental', 'streaming', 'problems', 'we', 'can', 'replace', 'a', 'ologn', 'factor', 'in', 'the', 'space', 'usage', 'for', 'algorithms', 'in', 'the', 'turnstile', 'model', 'with', 'a', 'ologalpha', 'factor', 'this', 'is', 'true', 'for', 'identifying', 'heavy', 'hitters', 'inner', 'product', 'estimation', 'l_0', 'estimation', 'l_1', 'estimation', 'l_1', 'sampling', 'and', 'support', 'sampling', 'for', 'each', 'problem', 'we', 'give', 'matching', 'or', 'nearly', 'matching', 'lower', 'bounds', 'for', 'alphaproperty', 'streams', 'we', 'note', 'that', 'in', 'practice', 'many', 'important', 'turnstile', 'data', 'streams', 'are', 'in', 'fact', 'alphaproperty', 'streams', 'for', 'small', 'values', 'of', 'alpha', 'for', 'such', 'applications', 'our', 'results', 'represent', 'significant', 'improvements', 'in', 'efficiency', 'for', 'all', 'the', 'aforementioned', 'problems']]
|
[-0.15164603599441043, 0.1064901222768097, -0.006625014915993334, 0.07444201505111656, -0.05304844572904553, -0.13649180097314031, 0.06088124792617948, 0.3776662072439203, -0.2997986577605836, -0.3141620136694357, 0.09425448888145284, -0.28310813067630236, -0.1043603988892349, 0.2122025443912804, -0.09686305390932255, 0.06602312650734223, 0.06544313439915303, 0.06601514870654276, -0.048546570916881, -0.26591540647398226, 0.27766590564108634, 0.007667787980450236, 0.2034939056328634, -0.003353165442366963, 0.058631120112507415, 0.021493002943503172, -0.019848749699556956, -0.020127633099468138, -0.13955804676659775, 0.11696532401329886, 0.27979298510668427, 0.16323288911198938, 0.30462722383483715, -0.39434548779924516, -0.19726685196963753, 0.13653230365630784, 0.1920821133673397, 0.0582965558349696, -0.09818831869759256, -0.1977725447681935, 0.13385478922684968, -0.15323039035592595, -0.03701614487636466, -0.03068594875830141, 0.07848078519080143, 0.00024717909434861815, -0.368285839063513, 0.07321884137073996, 0.07698112138981375, -0.010069046979365141, -0.057366146020666725, -0.1610686955715828, 0.08917183107227131, 0.11796747719806439, 0.05845145656627864, 0.05783488898282215, 0.08318702188751148, -0.1392085101564043, -0.09475418852031113, 0.3818926268768876, -0.05075079611008628, -0.19408699482579977, 0.156522197754715, -0.1310747132835387, -0.16673801827894177, 0.1009122755106082, 0.18680080862829954, 0.10500380779126946, -0.07893694532812452, 0.11788887277902602, -0.07618579410362562, 0.1677434218351696, 0.1030470006993379, 0.039988550062110946, 0.12970421169682042, 0.145287127211955, 0.12541494089231198, 0.0881424797137485, -0.08388095656860796, -0.04970481693965526, -0.2884793602203464, -0.14119934904749834, -0.15296403904355282, -0.01769685754850424, -0.16617541828272375, -0.17217432224125465, 0.3316527519700865, 0.14978977152525555, 0.2759931958676224, 0.07743029555778862, 0.34287793729583116, 0.12329252446281978, 0.049144588053786, 0.16543103545248922, 0.13883944179792795, 0.07477673576968048, 0.0474457682732478, -0.13628426422420226, 0.10333590912761484, 0.03959467639482171]
|
1,803.08778
|
An approach for computing families of multi-branch-point covers and
applications for symplectic Galois groups
|
We propose an approach for the computation of multi-parameter families of
Galois extensions with prescribed ramification type. More precisely, we combine
existing deformation and interpolation techniques with recently developed
strong tools for the computation of $3$-point covers. To demonstrate the
applicability of our method in relatively large degrees, we compute several
families of polynomials with symplectic Galois groups, in particular obtaining
the first totally real polynomials with Galois group PSp(6,2).
|
math.NT
|
we propose an approach for the computation of multiparameter families of galois extensions with prescribed ramification type more precisely we combine existing deformation and interpolation techniques with recently developed strong tools for the computation of 3point covers to demonstrate the applicability of our method in relatively large degrees we compute several families of polynomials with symplectic galois groups in particular obtaining the first totally real polynomials with galois group psp62
|
[['we', 'propose', 'an', 'approach', 'for', 'the', 'computation', 'of', 'multiparameter', 'families', 'of', 'galois', 'extensions', 'with', 'prescribed', 'ramification', 'type', 'more', 'precisely', 'we', 'combine', 'existing', 'deformation', 'and', 'interpolation', 'techniques', 'with', 'recently', 'developed', 'strong', 'tools', 'for', 'the', 'computation', 'of', '3point', 'covers', 'to', 'demonstrate', 'the', 'applicability', 'of', 'our', 'method', 'in', 'relatively', 'large', 'degrees', 'we', 'compute', 'several', 'families', 'of', 'polynomials', 'with', 'symplectic', 'galois', 'groups', 'in', 'particular', 'obtaining', 'the', 'first', 'totally', 'real', 'polynomials', 'with', 'galois', 'group', 'psp62']]
|
[-0.14365175823120913, 0.016987511626844618, -0.10596277571512737, 0.040792937788680414, -0.11470220984378154, -0.1113844117473649, -0.016179800060564194, 0.3429166582561489, -0.3196649537894173, -0.2914148279452238, 0.08409662316958218, -0.2060809255834075, -0.17747086740733273, 0.268998538778312, -0.14495336181953197, 0.05724498459502407, 0.03097226287818689, 0.055586229064974235, -0.14082776601898714, -0.33418654384212976, 0.381382565540464, -0.03999614196600042, 0.21211107585417188, 0.020282762948477615, 0.09600878421190208, 0.049700118527086314, -0.0662553665511634, -0.03511074476915857, -0.15936579459441313, 0.2104429459583986, 0.3248391551559494, 0.07726721191589815, 0.23695684882366788, -0.3782605568446435, -0.1605673844696603, 0.22072979405630325, 0.13638043290247087, 0.10645886609479245, -0.062410144335497506, -0.26717989762192185, 0.08935550723116899, -0.1788222119482099, -0.19998091128587292, -0.19074443260720675, 0.0049544118186189, 0.058664603496267315, -0.23267360544507054, 0.0031283479048937993, 0.015332953877024946, 0.19456490538204493, -0.009563592080350803, -0.1498833986579616, 0.053378604774268854, 0.06976106835772163, 0.009975198909397359, -0.03821027489460033, 0.04667637056495617, -0.09749523075837371, -0.16083006239563657, 0.35334157504384284, -0.05264989385192377, -0.21074918847855018, 0.16823406715917846, -0.1460275702866847, -0.23545168952314535, 0.12242274218495341, 0.1405640277620135, 0.17111397300997877, -0.03711869614873675, 0.14575144632270667, -0.07009956976263851, 0.09111429507965627, 0.07717743461978609, -0.026127062913408314, 0.10834859603462552, 0.09829467186785262, 0.07853850216159354, 0.15065617294496167, -0.05748072675550762, -0.08192441794697357, -0.3263772866972115, -0.1420366278971019, -0.08671074764857041, -0.001558381382483935, -0.12650624050508233, -0.19130646698244347, 0.43579155265394115, 0.1396508500236424, 0.1474961942412715, 0.20281232654562462, 0.2629245764211468, 0.05190919167733333, 0.11427654408296381, 0.06313543345617212, 0.1310629427274419, 0.24552094952567763, -0.021527465513866882, -0.1443897953941959, -0.0701140953325734, 0.15701634816123525]
|
1,803.08779
|
Representations of higher-rank graph $C^*$-algebras associated to
$\Lambda$-semibranching function systems
|
In this paper, we discuss a method of constructing separable representations
of the $C^*$-algebras associated to strongly connected row-finite $k$-graphs
$\Lambda$. We begin by giving an alternative characterization of the
$\Lambda$-semibranching function systems introduced in an earlier paper, with
an eye towards constructing such representations that are faithful. Our new
characterization allows us to more easily check that examples satisfy certain
necessary and sufficient conditions. We present a variety of new examples
relying on this characterization. We then use some of these methods and a
direct limit procedure to construct a faithful separable representation for any
row-finite source-free $k$-graph.
|
math.OA math.DS math.FA
|
in this paper we discuss a method of constructing separable representations of the calgebras associated to strongly connected rowfinite kgraphs lambda we begin by giving an alternative characterization of the lambdasemibranching function systems introduced in an earlier paper with an eye towards constructing such representations that are faithful our new characterization allows us to more easily check that examples satisfy certain necessary and sufficient conditions we present a variety of new examples relying on this characterization we then use some of these methods and a direct limit procedure to construct a faithful separable representation for any rowfinite sourcefree kgraph
|
[['in', 'this', 'paper', 'we', 'discuss', 'a', 'method', 'of', 'constructing', 'separable', 'representations', 'of', 'the', 'calgebras', 'associated', 'to', 'strongly', 'connected', 'rowfinite', 'kgraphs', 'lambda', 'we', 'begin', 'by', 'giving', 'an', 'alternative', 'characterization', 'of', 'the', 'lambdasemibranching', 'function', 'systems', 'introduced', 'in', 'an', 'earlier', 'paper', 'with', 'an', 'eye', 'towards', 'constructing', 'such', 'representations', 'that', 'are', 'faithful', 'our', 'new', 'characterization', 'allows', 'us', 'to', 'more', 'easily', 'check', 'that', 'examples', 'satisfy', 'certain', 'necessary', 'and', 'sufficient', 'conditions', 'we', 'present', 'a', 'variety', 'of', 'new', 'examples', 'relying', 'on', 'this', 'characterization', 'we', 'then', 'use', 'some', 'of', 'these', 'methods', 'and', 'a', 'direct', 'limit', 'procedure', 'to', 'construct', 'a', 'faithful', 'separable', 'representation', 'for', 'any', 'rowfinite', 'sourcefree', 'kgraph']]
|
[-0.09857995346108583, 0.07302136244084756, -0.10041309805173013, 0.039926730376207316, -0.15538833220489323, -0.13200381483807408, 0.013243047428797141, 0.4262792652454039, -0.2718007568307597, -0.24003006643004188, 0.10239729499961767, -0.19389087777608896, -0.19618705130473832, 0.24241798956210564, -0.13666562810287747, 0.009299542750184886, 0.09557558367536827, 0.05118674575115996, -0.11213236663848011, -0.2309343781077651, 0.39997536182224824, 0.014182507794237497, 0.19422635402191768, 0.038418718792422854, 0.119547933965658, 0.024148486319440183, -0.06323673121038485, 0.03886439670535802, -0.217901734593636, 0.1896387150168955, 0.266930554532493, 0.1670900096768758, 0.24743963877265954, -0.4034970963768887, -0.15774295208129016, 0.21626674368591847, 0.1007625737528533, 0.11307782803031832, -0.05961565563241796, -0.30847087959674274, 0.10424355444771172, -0.24017870829221932, -0.1507063300485224, -0.16821229741955646, 0.001634333875368942, -0.03258811707862399, -0.29284866176771396, -0.026530742979222775, 0.11983004596197244, 0.06441363606677213, -0.07776711067488191, -0.05077859570244045, 0.040115812377101094, 0.10867177791460747, -0.07809931919392613, 0.004655136359911977, 0.025199630603457642, -0.09289439120847318, -0.14106137258226448, 0.31186996007131207, -0.02933949710932946, -0.22725862988054452, 0.24171110558690448, -0.08508191226200774, -0.1917913077314469, 0.11400838997779471, 0.11381041334772651, 0.14675618347055114, -0.14582855266641187, 0.079451505693306, -0.10017206941406723, 0.11054716237369135, 0.04868650262836705, 0.054908393364813596, 0.1402155470968497, 0.12250221682938212, 0.12249533492940093, 0.1832111273972186, 0.04248592546009788, 0.020903016195980586, -0.3745132330052479, -0.17706852582179838, -0.12554183479803002, 0.09570350436343238, -0.06963237640600783, -0.19087908636176526, 0.401950523050295, 0.18125681568764979, 0.18494359569417107, 0.12200077054692865, 0.2397249353734419, 0.10371503695161223, 0.013765327336097305, 0.06580265511692775, 0.13051584941973543, 0.19979979347606952, -0.016877889412107192, -0.11679101313436122, -0.0068173340564085675, 0.10767676451742048]
|
1,803.0878
|
Singular divisors and syzygies of polarized abelian threefolds
|
We provide numerical conditions for a polarized abelian threefold $(A,L)$ to
have simple syzygies, in terms of property $(N_p)$ and the vanishing of Koszul
cohomology groups $K_{p,1}$. We rely on a reduction method of
Lazarsfeld-Pareschi-Popa, convex geometry of Newton-Okounkov bodies, inversion
of adjunction techniques from work on Fujita's conjecture, and the use of
differentiation by Ein-Lazarsfeld-Nakamye. As a by-product, we construct
effective divisors in any ample class of high self-intersetion, whose
singularities are all concentrated on an abelian subvariety. This can be seen
as the dual picture considered by Ein-Lazarsfeld for theta divisors.
|
math.AG
|
we provide numerical conditions for a polarized abelian threefold al to have simple syzygies in terms of property n_p and the vanishing of koszul cohomology groups k_p1 we rely on a reduction method of lazarsfeldpareschipopa convex geometry of newtonokounkov bodies inversion of adjunction techniques from work on fujitas conjecture and the use of differentiation by einlazarsfeldnakamye as a byproduct we construct effective divisors in any ample class of high selfintersetion whose singularities are all concentrated on an abelian subvariety this can be seen as the dual picture considered by einlazarsfeld for theta divisors
|
[['we', 'provide', 'numerical', 'conditions', 'for', 'a', 'polarized', 'abelian', 'threefold', 'al', 'to', 'have', 'simple', 'syzygies', 'in', 'terms', 'of', 'property', 'n_p', 'and', 'the', 'vanishing', 'of', 'koszul', 'cohomology', 'groups', 'k_p1', 'we', 'rely', 'on', 'a', 'reduction', 'method', 'of', 'lazarsfeldpareschipopa', 'convex', 'geometry', 'of', 'newtonokounkov', 'bodies', 'inversion', 'of', 'adjunction', 'techniques', 'from', 'work', 'on', 'fujitas', 'conjecture', 'and', 'the', 'use', 'of', 'differentiation', 'by', 'einlazarsfeldnakamye', 'as', 'a', 'byproduct', 'we', 'construct', 'effective', 'divisors', 'in', 'any', 'ample', 'class', 'of', 'high', 'selfintersetion', 'whose', 'singularities', 'are', 'all', 'concentrated', 'on', 'an', 'abelian', 'subvariety', 'this', 'can', 'be', 'seen', 'as', 'the', 'dual', 'picture', 'considered', 'by', 'einlazarsfeld', 'for', 'theta', 'divisors']]
|
[-0.15894173216688764, 0.031970205892211306, -0.10063857618453247, 0.0773265349952463, -0.09087657466131661, -0.13544937588049324, 0.017017518243097423, 0.3411809584064471, -0.27918423573578616, -0.2143097878075563, 0.11829128762666177, -0.20975376553782313, -0.1724247675143428, 0.21871206075321514, -0.1828105445480445, -0.014207270070603425, 0.020270475053361485, 0.015006040251407015, -0.09461994288274302, -0.3065621674593006, 0.42365454683837656, -0.024971432584737028, 0.22648735078317778, 0.11313985473768028, 0.10579690773162868, 0.01929862604855181, 0.003999684732612018, 0.012145925937527483, -0.1466525706595608, 0.1795215293007729, 0.3169773989510569, 0.09666623228874344, 0.1743047737854195, -0.4157425849647312, -0.14621209131379787, 0.15440570145517915, 0.12546823984830752, 0.05756613625223738, -0.05322904974493393, -0.20965451970287077, 0.08997746800062256, -0.1813130523026972, -0.22480829940740388, -0.1364833551285031, 0.0353044394434399, 0.04674552727981911, -0.24535269013882338, 0.0015347601400028177, 0.09799509648339833, 0.19549484355477514, -0.04766585384649071, -0.11507732805969952, -0.07691396562034612, 0.02116408437019685, 0.024687779903575614, 0.030556406953709793, 0.08367888972158083, -0.08783204024299406, -0.13086675833731604, 0.3566208547492931, -0.06954175736345761, -0.2405438345491088, 0.15282137378292915, -0.1358699074327168, -0.1522004120998535, 0.16060563328338193, 0.11681599355210642, 0.24436268161286365, -0.008346387533123022, 0.17528072279330426, -0.14909329735622792, 0.03860890691854305, 0.1133498555857811, 0.009257607950040927, 0.155979372694024, 0.0862443016056524, 0.0802500042936427, 0.12345333962194663, 0.0060813210720380585, -0.019021989761693097, -0.36238864664714987, -0.20233013705289052, -0.1370638160375305, 0.1787533675791225, -0.10329550221737648, -0.15345737588087194, 0.35490730382850044, 0.06058024472664469, 0.1996220473921602, 0.10834895677168618, 0.23821231141522692, 0.050951977511791126, 0.06330659572076011, 0.017875675618607593, 0.1630352614639368, 0.2090849824362322, -0.02599972739779252, -0.1436513280636723, 0.006144713160100874, 0.22765196102497343]
|
1,803.08781
|
Theory and Experimental Investigation of the Quantum Valley Hall Effect
|
The quantum valley Hall effect (QVHE) has been observed in a variety of
experimental setups, both quantum and classical. While extremely promising for
applications, one should be reminded that QVHE is not an exact topological
phenomenon and that, so far, it has been fully understood only qualitatively in
certain extreme limits. Here we present a technique to relate QVHE systems with
exact quantum spin-Hall insulators that accept real-space representations,
without taking any extreme limit. Since the bulk-boundary correspondence is
well understood for the latter, we are able to formulate precise quantitative
statements about the QVHE regime and its robustness against disorder. We
further investigate the effect using a novel experimental platform based on
magnetically coupled spinners. Visual renderings, quantitative data and various
tests of the domain-wall modes are supplied, hence giving an unprecedented
insight into the effect.
|
cond-mat.mes-hall
|
the quantum valley hall effect qvhe has been observed in a variety of experimental setups both quantum and classical while extremely promising for applications one should be reminded that qvhe is not an exact topological phenomenon and that so far it has been fully understood only qualitatively in certain extreme limits here we present a technique to relate qvhe systems with exact quantum spinhall insulators that accept realspace representations without taking any extreme limit since the bulkboundary correspondence is well understood for the latter we are able to formulate precise quantitative statements about the qvhe regime and its robustness against disorder we further investigate the effect using a novel experimental platform based on magnetically coupled spinners visual renderings quantitative data and various tests of the domainwall modes are supplied hence giving an unprecedented insight into the effect
|
[['the', 'quantum', 'valley', 'hall', 'effect', 'qvhe', 'has', 'been', 'observed', 'in', 'a', 'variety', 'of', 'experimental', 'setups', 'both', 'quantum', 'and', 'classical', 'while', 'extremely', 'promising', 'for', 'applications', 'one', 'should', 'be', 'reminded', 'that', 'qvhe', 'is', 'not', 'an', 'exact', 'topological', 'phenomenon', 'and', 'that', 'so', 'far', 'it', 'has', 'been', 'fully', 'understood', 'only', 'qualitatively', 'in', 'certain', 'extreme', 'limits', 'here', 'we', 'present', 'a', 'technique', 'to', 'relate', 'qvhe', 'systems', 'with', 'exact', 'quantum', 'spinhall', 'insulators', 'that', 'accept', 'realspace', 'representations', 'without', 'taking', 'any', 'extreme', 'limit', 'since', 'the', 'bulkboundary', 'correspondence', 'is', 'well', 'understood', 'for', 'the', 'latter', 'we', 'are', 'able', 'to', 'formulate', 'precise', 'quantitative', 'statements', 'about', 'the', 'qvhe', 'regime', 'and', 'its', 'robustness', 'against', 'disorder', 'we', 'further', 'investigate', 'the', 'effect', 'using', 'a', 'novel', 'experimental', 'platform', 'based', 'on', 'magnetically', 'coupled', 'spinners', 'visual', 'renderings', 'quantitative', 'data', 'and', 'various', 'tests', 'of', 'the', 'domainwall', 'modes', 'are', 'supplied', 'hence', 'giving', 'an', 'unprecedented', 'insight', 'into', 'the', 'effect']]
|
[-0.11008211347634775, 0.13751341653227242, -0.12357211283350322, 0.10826355860913581, -0.09959540614028917, -0.18561889781161164, 0.05323273807519326, 0.38161913152566573, -0.22546847236349526, -0.29601790271971345, 0.09764079157395601, -0.26275845678917464, -0.188484566082267, 0.24617761527239107, -0.060252825731248426, 0.07830328789979804, 0.02493325138488363, -0.01505680925070043, -0.0487488233161424, -0.20740830677520675, 0.2640674118577999, 0.03007488960190336, 0.3356466221735289, 0.10969269760021001, 0.0842098348619362, -0.019562668105872878, 0.046122348738195255, 0.06942026570344167, -0.12645139964547028, 0.06581786494484565, 0.2498305479655583, 0.03266430277730862, 0.2263585239101582, -0.46929991625956374, -0.2168366453834694, 0.06085436214373386, 0.16042943358383938, 0.16986977938990905, -0.084945612438329, -0.3278453204318555, 0.09271246462679693, -0.16765328136359403, -0.09976880875735605, -0.14427655649092727, 0.00746464055289861, -0.08134150462281163, -0.23282120551193392, 0.04281124045705273, 0.06315992109181807, 0.08811833846457574, -0.0377148094180849, -0.07875060373713283, -0.005519145949281426, 0.16433416708053028, 0.014723566574907868, -0.0024163994384100184, 0.10090832755200728, -0.14773422617968307, -0.17322098722096776, 0.38119901822757546, -0.015902318866383013, -0.183954973589866, 0.22133619953490738, -0.15091341537810918, -0.11988130025905523, 0.08220894493665683, 0.10949325099940935, 0.08580700002430537, -0.13620779179988335, 0.07239921812399759, -0.05475118236928961, 0.14158007232931163, -0.008544571874459294, 0.11897248252342543, 0.26721909894424417, 0.1651724843226754, 0.02137521983049538, 0.1545246574665712, -0.06970496387832736, -0.09006468551641289, -0.24158808542755397, -0.14382768345378122, -0.1985790674068224, 0.07605072974414738, -0.03553966527259195, -0.1504452148465997, 0.3647769197454526, 0.1998847112697753, 0.18100139986465338, -0.002242856053975377, 0.30133814177047596, 0.13569615390083758, 0.0565293588969571, -0.0005987388095444571, 0.2840384031615363, 0.13322541640602378, 0.07872027541293225, -0.23530746470579375, 0.07475969904734597, 0.018701959700479994]
|
1,803.08782
|
Identifying the relevant dependencies of the neural network response on
characteristics of the input space
|
The relation between the input and output spaces of neural networks (NNs) is
investigated to identify those characteristics of the input space that have a
large influence on the output for a given task. For this purpose, the NN
function is decomposed into a Taylor expansion in each element of the input
space. The Taylor coefficients contain information about the sensitivity of the
NN response to the inputs. A metric is introduced that allows for the
identification of the characteristics that mostly determine the performance of
the NN in solving a given task. Finally, the capability of this metric to
analyze the performance of the NN is evaluated based on a task common to data
analyses in high-energy particle physics experiments.
|
physics.data-an physics.comp-ph
|
the relation between the input and output spaces of neural networks nns is investigated to identify those characteristics of the input space that have a large influence on the output for a given task for this purpose the nn function is decomposed into a taylor expansion in each element of the input space the taylor coefficients contain information about the sensitivity of the nn response to the inputs a metric is introduced that allows for the identification of the characteristics that mostly determine the performance of the nn in solving a given task finally the capability of this metric to analyze the performance of the nn is evaluated based on a task common to data analyses in highenergy particle physics experiments
|
[['the', 'relation', 'between', 'the', 'input', 'and', 'output', 'spaces', 'of', 'neural', 'networks', 'nns', 'is', 'investigated', 'to', 'identify', 'those', 'characteristics', 'of', 'the', 'input', 'space', 'that', 'have', 'a', 'large', 'influence', 'on', 'the', 'output', 'for', 'a', 'given', 'task', 'for', 'this', 'purpose', 'the', 'nn', 'function', 'is', 'decomposed', 'into', 'a', 'taylor', 'expansion', 'in', 'each', 'element', 'of', 'the', 'input', 'space', 'the', 'taylor', 'coefficients', 'contain', 'information', 'about', 'the', 'sensitivity', 'of', 'the', 'nn', 'response', 'to', 'the', 'inputs', 'a', 'metric', 'is', 'introduced', 'that', 'allows', 'for', 'the', 'identification', 'of', 'the', 'characteristics', 'that', 'mostly', 'determine', 'the', 'performance', 'of', 'the', 'nn', 'in', 'solving', 'a', 'given', 'task', 'finally', 'the', 'capability', 'of', 'this', 'metric', 'to', 'analyze', 'the', 'performance', 'of', 'the', 'nn', 'is', 'evaluated', 'based', 'on', 'a', 'task', 'common', 'to', 'data', 'analyses', 'in', 'highenergy', 'particle', 'physics', 'experiments']]
|
[-0.10074993379198569, 0.04517748144124288, -0.0997540660217897, 0.07884361278766013, -0.06767579797686131, -0.0774786543824579, 0.020904094161665884, 0.3474541400936394, -0.2653055617601172, -0.29157510176608875, 0.06824435186784038, -0.2892085084296457, -0.1470492659521497, 0.18542560663416766, -0.022786178789678806, 0.06838269046823348, 0.10061635407965538, 0.10669030768273413, -0.06631179265331569, -0.2473486696239099, 0.33147329381428475, 0.07140440661614099, 0.2847529641534914, 0.03680646868253296, 0.14269061811453054, 0.009107066041305045, -0.03764046911796755, -0.003729812439611905, -0.09405831730060331, 0.15287726427128245, 0.2721858638962192, 0.14939718599208007, 0.28472581318356405, -0.37501796876842325, -0.20039778183529938, 0.10267076038655416, 0.0847581649537791, 0.05821078916249627, 0.005794669553437386, -0.2689569263665144, 0.12088632141047519, -0.12292992563010001, -0.051307121530359934, -0.06309090959954976, 0.036390621496041206, 0.03278676829924268, -0.30124962409142375, -0.014905333932689276, 0.06205078634656658, 0.026514695306916622, -0.05393174632639078, -0.10591960845953854, 0.011403749550669647, 0.18065564503339082, 0.019105307904095196, 0.055294801907282906, 0.10335677255653153, -0.1771839177428383, -0.10116368816965375, 0.39184325350802546, -0.06993577541246594, -0.26393758611799767, 0.14843799881367706, -0.1030535509113284, -0.13074375244149986, 0.09393158253313096, 0.24238042727359072, 0.08429572562694795, -0.15726404743315267, 0.072827279143909, -0.019872124668610984, 0.1958492958441007, 0.047142950700565185, 0.024494806408481902, 0.13939509527326738, 0.21924469325968549, 0.009723923652055712, 0.1554699696808253, -0.10648433234656138, -0.07534828097780796, -0.2796123161111489, -0.12262760873206636, -0.22515058759138112, -0.001778956283314908, -0.10877602548549656, -0.16050710999753234, 0.4419759338844783, 0.16778607791566774, 0.25896442999817, 0.03921811987669015, 0.3044763434897677, 0.10349137118193975, 0.08709285152721996, 0.05393606033185805, 0.23116697384860396, 0.10565892165365114, 0.10367882966779726, -0.217197201391759, 0.09155490864376145, 0.08505705340134273]
|
1,803.08783
|
Secant and Popov-like Conditions in Power Network Stability
|
The problem of decentralized frequency control in power networks has received
an increasing attention in recent years due to its significance in modern power
systems and smart grids. Nevertheless, generation dynamics including
turbine-governor dynamics, in conjunction with nonlinearities associated with
generation and power flow, increase significantly the complexity in the
analysis, and are not adequately addressed in the literature. In this paper we
show how incremental secant gain conditions can be used in this context to
deduce decentralized stability conditions with reduced conservatism.
Furthermore, for linear generation dynamics, we establish Popov-like conditions
that are able to reduce the conservatism even further by incorporating
additional local information associated with the coupling strength among the
bus dynamics. Various examples are discussed throughout the paper to
demonstrate the significance of the results presented.
|
math.OC
|
the problem of decentralized frequency control in power networks has received an increasing attention in recent years due to its significance in modern power systems and smart grids nevertheless generation dynamics including turbinegovernor dynamics in conjunction with nonlinearities associated with generation and power flow increase significantly the complexity in the analysis and are not adequately addressed in the literature in this paper we show how incremental secant gain conditions can be used in this context to deduce decentralized stability conditions with reduced conservatism furthermore for linear generation dynamics we establish popovlike conditions that are able to reduce the conservatism even further by incorporating additional local information associated with the coupling strength among the bus dynamics various examples are discussed throughout the paper to demonstrate the significance of the results presented
|
[['the', 'problem', 'of', 'decentralized', 'frequency', 'control', 'in', 'power', 'networks', 'has', 'received', 'an', 'increasing', 'attention', 'in', 'recent', 'years', 'due', 'to', 'its', 'significance', 'in', 'modern', 'power', 'systems', 'and', 'smart', 'grids', 'nevertheless', 'generation', 'dynamics', 'including', 'turbinegovernor', 'dynamics', 'in', 'conjunction', 'with', 'nonlinearities', 'associated', 'with', 'generation', 'and', 'power', 'flow', 'increase', 'significantly', 'the', 'complexity', 'in', 'the', 'analysis', 'and', 'are', 'not', 'adequately', 'addressed', 'in', 'the', 'literature', 'in', 'this', 'paper', 'we', 'show', 'how', 'incremental', 'secant', 'gain', 'conditions', 'can', 'be', 'used', 'in', 'this', 'context', 'to', 'deduce', 'decentralized', 'stability', 'conditions', 'with', 'reduced', 'conservatism', 'furthermore', 'for', 'linear', 'generation', 'dynamics', 'we', 'establish', 'popovlike', 'conditions', 'that', 'are', 'able', 'to', 'reduce', 'the', 'conservatism', 'even', 'further', 'by', 'incorporating', 'additional', 'local', 'information', 'associated', 'with', 'the', 'coupling', 'strength', 'among', 'the', 'bus', 'dynamics', 'various', 'examples', 'are', 'discussed', 'throughout', 'the', 'paper', 'to', 'demonstrate', 'the', 'significance', 'of', 'the', 'results', 'presented']]
|
[-0.12301569590850393, 0.05202497159369568, -0.018981295182954435, 0.026347634626205926, -0.057766445639882556, -0.11267544818291253, 0.01596071203094871, 0.37568108480452567, -0.31122978851776717, -0.3115334059869827, 0.15421462035196465, -0.24500956188150963, -0.1855351264812341, 0.21897374654491975, -0.12419540925915244, 0.06954217111906615, 0.06005450008462306, 0.010035653395105384, -0.034827623090367445, -0.2705753474512549, 0.2866382157004099, 0.09299883075318365, 0.33177968285898424, 0.06877897142309898, 0.060107728941754125, -0.029004551412523255, -0.03425712825716004, 0.05538469703160515, -0.09423497327552185, 0.1446521428058126, 0.27868457547526143, 0.1280861126201213, 0.3067296456776617, -0.4666619212474934, -0.25095820837011634, 0.1246091452708771, 0.13018830677552162, 0.09469961514335501, -0.07721243982132012, -0.2439596595444767, 0.10122916069921366, -0.18859934679759566, -0.12892125089212444, -0.10334149873075472, -0.02567671895994581, 0.07426468334196842, -0.26821914057846563, 0.059374145376532114, 0.05363589184098812, 0.05899757149723149, -0.040901879184832436, -0.06550222081529308, -0.02491457057961573, 0.12412355847967167, 0.05181179222896291, -0.04620438683218532, 0.09117009205601084, -0.1420907944318109, -0.1393491232933751, 0.3726999198425879, -0.04173876529797738, -0.21742437871772247, 0.1840346871348199, -0.1171088445996649, -0.16165994176128518, 0.10442988492562905, 0.23653140915882623, 0.044462873289982476, -0.1442454395510704, 0.0616601686802866, 0.04325819104483943, 0.18917899925709347, 0.041279614632299476, 0.06468635344293056, 0.1547743920891098, 0.17588220754017433, 0.09092598654647437, 0.15162851306331857, -0.040385388887429596, -0.13603873968001656, -0.23504827492473315, -0.0903655888310583, -0.13041863749309104, -0.007671032679269935, -0.061365249808250505, -0.061734738741647595, 0.41525142513533203, 0.21899012623845723, 0.167175467360707, 0.06059503839567824, 0.31429624522841254, 0.15548025649726796, 0.05722799677358464, 0.06468119132946167, 0.27850250217904765, 0.12254477110546977, 0.1603323001515611, -0.24231893493425707, 0.07632626972951774, 0.005254647613308111]
|
1,803.08784
|
Causal Modeling of Dynamical Systems
|
Dynamical systems are widely used in science and engineering to model systems
consisting of several interacting components. Often, they can be given a causal
interpretation in the sense that they not only model the evolution of the
states of the system's components over time, but also describe how their
evolution is affected by external interventions on the system that perturb the
dynamics. We introduce the formal framework of structural dynamical causal
models (SDCMs) that explicates the causal semantics of the system's components
as part of the model. SDCMs represent a dynamical system as a collection of
stochastic processes and specify the basic causal mechanisms that govern the
dynamics of each component as a structured system of random differential
equations of arbitrary order. SDCMs extend the versatile causal modeling
framework of structural causal models (SCMs), also known as structural equation
models (SEMs), by explicitly allowing for time-dependence. An SDCM can be
thought of as the stochastic-process version of an SCM, where the static random
variables of the SCM are replaced by dynamic stochastic processes and their
derivatives. We provide the foundations for a theory of SDCMs, by (i) formally
defining SDCMs, their solutions, stochastic interventions, and a graphical
representation; (ii) studying existence and uniqueness of the solutions for
given initial conditions; (iii) providing Markov properties for SDCMs with
initial conditions; (iv) discussing under which conditions SDCMs equilibrate to
SCMs as time tends to infinity; (v) relating the properties of the SDCM to
those of the equilibrium SCM. This correspondence enables one to leverage the
wealth of statistical tools and discovery methods available for SCMs when
studying the causal semantics of a large class of stochastic dynamical systems.
The theory is illustrated with examples from different scientific domains.
|
cs.AI cs.LG stat.ME stat.ML
|
dynamical systems are widely used in science and engineering to model systems consisting of several interacting components often they can be given a causal interpretation in the sense that they not only model the evolution of the states of the systems components over time but also describe how their evolution is affected by external interventions on the system that perturb the dynamics we introduce the formal framework of structural dynamical causal models sdcms that explicates the causal semantics of the systems components as part of the model sdcms represent a dynamical system as a collection of stochastic processes and specify the basic causal mechanisms that govern the dynamics of each component as a structured system of random differential equations of arbitrary order sdcms extend the versatile causal modeling framework of structural causal models scms also known as structural equation models sems by explicitly allowing for timedependence an sdcm can be thought of as the stochasticprocess version of an scm where the static random variables of the scm are replaced by dynamic stochastic processes and their derivatives we provide the foundations for a theory of sdcms by i formally defining sdcms their solutions stochastic interventions and a graphical representation ii studying existence and uniqueness of the solutions for given initial conditions iii providing markov properties for sdcms with initial conditions iv discussing under which conditions sdcms equilibrate to scms as time tends to infinity v relating the properties of the sdcm to those of the equilibrium scm this correspondence enables one to leverage the wealth of statistical tools and discovery methods available for scms when studying the causal semantics of a large class of stochastic dynamical systems the theory is illustrated with examples from different scientific domains
|
[['dynamical', 'systems', 'are', 'widely', 'used', 'in', 'science', 'and', 'engineering', 'to', 'model', 'systems', 'consisting', 'of', 'several', 'interacting', 'components', 'often', 'they', 'can', 'be', 'given', 'a', 'causal', 'interpretation', 'in', 'the', 'sense', 'that', 'they', 'not', 'only', 'model', 'the', 'evolution', 'of', 'the', 'states', 'of', 'the', 'systems', 'components', 'over', 'time', 'but', 'also', 'describe', 'how', 'their', 'evolution', 'is', 'affected', 'by', 'external', 'interventions', 'on', 'the', 'system', 'that', 'perturb', 'the', 'dynamics', 'we', 'introduce', 'the', 'formal', 'framework', 'of', 'structural', 'dynamical', 'causal', 'models', 'sdcms', 'that', 'explicates', 'the', 'causal', 'semantics', 'of', 'the', 'systems', 'components', 'as', 'part', 'of', 'the', 'model', 'sdcms', 'represent', 'a', 'dynamical', 'system', 'as', 'a', 'collection', 'of', 'stochastic', 'processes', 'and', 'specify', 'the', 'basic', 'causal', 'mechanisms', 'that', 'govern', 'the', 'dynamics', 'of', 'each', 'component', 'as', 'a', 'structured', 'system', 'of', 'random', 'differential', 'equations', 'of', 'arbitrary', 'order', 'sdcms', 'extend', 'the', 'versatile', 'causal', 'modeling', 'framework', 'of', 'structural', 'causal', 'models', 'scms', 'also', 'known', 'as', 'structural', 'equation', 'models', 'sems', 'by', 'explicitly', 'allowing', 'for', 'timedependence', 'an', 'sdcm', 'can', 'be', 'thought', 'of', 'as', 'the', 'stochasticprocess', 'version', 'of', 'an', 'scm', 'where', 'the', 'static', 'random', 'variables', 'of', 'the', 'scm', 'are', 'replaced', 'by', 'dynamic', 'stochastic', 'processes', 'and', 'their', 'derivatives', 'we', 'provide', 'the', 'foundations', 'for', 'a', 'theory', 'of', 'sdcms', 'by', 'i', 'formally', 'defining', 'sdcms', 'their', 'solutions', 'stochastic', 'interventions', 'and', 'a', 'graphical', 'representation', 'ii', 'studying', 'existence', 'and', 'uniqueness', 'of', 'the', 'solutions', 'for', 'given', 'initial', 'conditions', 'iii', 'providing', 'markov', 'properties', 'for', 'sdcms', 'with', 'initial', 'conditions', 'iv', 'discussing', 'under', 'which', 'conditions', 'sdcms', 'equilibrate', 'to', 'scms', 'as', 'time', 'tends', 'to', 'infinity', 'v', 'relating', 'the', 'properties', 'of', 'the', 'sdcm', 'to', 'those', 'of', 'the', 'equilibrium', 'scm', 'this', 'correspondence', 'enables', 'one', 'to', 'leverage', 'the', 'wealth', 'of', 'statistical', 'tools', 'and', 'discovery', 'methods', 'available', 'for', 'scms', 'when', 'studying', 'the', 'causal', 'semantics', 'of', 'a', 'large', 'class', 'of', 'stochastic', 'dynamical', 'systems', 'the', 'theory', 'is', 'illustrated', 'with', 'examples', 'from', 'different', 'scientific', 'domains']]
|
[-0.1107489756378508, 0.0807874863626398, -0.0992203337251098, 0.08771838813937119, -0.07673085994682262, -0.13221596020527862, 0.01780130186462547, 0.32160863984975363, -0.30815247201745016, -0.28173140578144523, 0.1287037031830881, -0.22724300069356715, -0.1710558622958256, 0.17212332203541394, -0.03787715391864857, 0.0552736942890797, 0.03566895719532939, 0.03187411249881054, -0.05958901085362483, -0.21892816120338582, 0.33700215340090484, 0.03967195911450194, 0.23903709735193818, -0.026546928274707372, 0.12485037452050393, 0.02276063012895402, -0.021880444549545124, 0.06835173373761867, -0.12141057070708179, 0.12358756754339764, 0.26163346110852026, 0.1843742364472091, 0.29114993884215146, -0.43619123675984206, -0.25630039265509563, 0.08342635612226566, 0.09568668383892488, 0.11268006094112272, 0.015062406425888592, -0.30337572549437203, 0.06489478214155439, -0.16095972751671045, -0.15052858950534406, -0.10910536799501706, 0.02088352216699102, 0.06104797998913792, -0.2557249944119786, 0.05852013438353087, 0.10256353646848136, 0.0681641360368723, -0.09507196852969904, -0.06984024756902282, -0.04488672145806787, 0.13791197193169827, 0.01665687459192102, -0.04354097609330047, 0.11482322093431506, -0.13522413960036048, -0.1477067467788726, 0.37421480659069817, -0.04130814341100428, -0.2178724035555562, 0.2322633025876305, -0.0789599607782471, -0.14842928904662286, 0.07383355562057398, 0.19541678339783494, 0.12020619306224886, -0.2235517986245487, 0.09794680406852345, 0.004510836525969989, 0.14110953307391463, 0.0002684728038933623, 0.04955226713400725, 0.2072269566360392, 0.16279164749609593, 0.0318534963413834, 0.11700929797106338, 0.004049892806760654, -0.1536089546011331, -0.3133025126583822, -0.1428299418390465, -0.11575887453826991, 0.04039638029690058, -0.10867957374656173, -0.2053952401315051, 0.3848270914742033, 0.18115068675210974, 0.16104253432941396, 0.05605150376799862, 0.24430859212517753, 0.12063485306078711, 0.030680650180055908, 0.06325629599460798, 0.16694521475778698, 0.1689287137559296, 0.10979437307654913, -0.1908926219668018, 0.14957857032394414, 0.04297658281605951]
|
1,803.08785
|
On rectangular unimodular matrices over the algebraic integers
|
Let $n$ and $m$ be positive integers such that $n<m$. In this paper we
compute the density of rectangular unimodular $n$ by $m$ matrices over the ring
of algebraic integers of a number field.
|
math.NT
|
let n and m be positive integers such that nm in this paper we compute the density of rectangular unimodular n by m matrices over the ring of algebraic integers of a number field
|
[['let', 'n', 'and', 'm', 'be', 'positive', 'integers', 'such', 'that', 'nm', 'in', 'this', 'paper', 'we', 'compute', 'the', 'density', 'of', 'rectangular', 'unimodular', 'n', 'by', 'm', 'matrices', 'over', 'the', 'ring', 'of', 'algebraic', 'integers', 'of', 'a', 'number', 'field']]
|
[-0.2615185228505117, 0.18545999879236608, -0.018041502410436377, -0.08111259181340061, 0.007891532115857391, -0.17059129310826607, -0.028740710767177755, 0.29977779254755554, -0.27757918482016336, -0.2927147813607007, 0.02798883627538624, -0.2499981469967786, -0.14291048155385344, 0.1208464723381707, -0.03936002547304858, -0.04162454676321324, -0.011918281074887252, 0.1169104907552109, -0.07952825749046444, -0.34738330132163625, 0.34930476310717706, -0.026830430909552994, 0.10833967630477513, 0.009374657207552125, 0.0685879587305381, 0.023023155257653666, 0.007358686231514987, 0.07934021108153769, -0.15874223343395416, 0.09177879654966734, 0.33913102269391804, 0.09900599044254597, 0.26924810127136023, -0.4203057091902284, -0.1139922242556863, 0.24753449676448808, 0.1988841627505334, -0.05721182661021457, -0.01592394838328747, -0.21272965898627744, 0.23115929865333087, -0.13190874807974873, -0.13294158310300724, -0.0035079075023531914, 0.1916960844229085, 0.038017378846073854, -0.3415796636220287, -0.06133786295814549, 0.0636086786056266, 0.12617848284871264, 0.04033281463746201, -0.2026097198420971, 0.027152419172446516, 0.03915284626076326, -0.06026022881269455, 0.03093582811861244, 0.06025391018620747, 0.0007863771238857333, -0.06869785120601163, 0.31470148133880954, -0.13970421397072427, -0.20272510011187372, 0.02384033043156652, -0.21578699209289076, -0.04958197069080437, 0.1585157584563336, 0.15100226134938352, 0.1906846951255027, 0.027135101777008352, 0.2788339947223636, -0.22483785112511695, 0.1612658041584141, 0.15933693471529028, 0.003987196079619667, 0.21666996104314046, 0.007765887935152825, 0.08832840724276406, 0.11421566568520468, -0.01710591881590731, 0.04019506549572244, -0.31442828191553845, -0.18912542585338302, -0.2698463479823926, 0.25674237454693544, -0.17891697929307532, -0.1777212854255648, 0.3745646950076608, 0.10536919558859047, 0.21668215052169912, 0.1564191399306497, 0.22646677294088638, 0.06500619649887085, 0.03134218362324378, 0.08303202370948651, -0.051075196331914735, 0.2592317146481946, -0.005355139006175758, -0.18780980763189933, -0.06557536896263413, 0.11513814810143017]
|
1,803.08786
|
rf surface impedance of a two-gap superconductor, considering magnesium
diboride for accelerator applications
|
In this paper, we apply the two-band extension [1] of BCS theory [2] into the
Mattis-Bardeen theory [3] to obtain the surface impedance of a two-band
superconductor, and apply it to magnesium diboride (MgB2) for radiofrequency
(RF) superconductivity applications. The numerical results for MgB2 are in good
agreement with the previously published experimental results [4]. The surface
impedance properties are clearly dominated by the smaller gap, significantly
limiting utility in the 10-20 K regime that might otherwise have been
attractive.
|
cond-mat.supr-con
|
in this paper we apply the twoband extension 1 of bcs theory 2 into the mattisbardeen theory 3 to obtain the surface impedance of a twoband superconductor and apply it to magnesium diboride mgb2 for radiofrequency rf superconductivity applications the numerical results for mgb2 are in good agreement with the previously published experimental results 4 the surface impedance properties are clearly dominated by the smaller gap significantly limiting utility in the 1020 k regime that might otherwise have been attractive
|
[['in', 'this', 'paper', 'we', 'apply', 'the', 'twoband', 'extension', '1', 'of', 'bcs', 'theory', '2', 'into', 'the', 'mattisbardeen', 'theory', '3', 'to', 'obtain', 'the', 'surface', 'impedance', 'of', 'a', 'twoband', 'superconductor', 'and', 'apply', 'it', 'to', 'magnesium', 'diboride', 'mgb2', 'for', 'radiofrequency', 'rf', 'superconductivity', 'applications', 'the', 'numerical', 'results', 'for', 'mgb2', 'are', 'in', 'good', 'agreement', 'with', 'the', 'previously', 'published', 'experimental', 'results', '4', 'the', 'surface', 'impedance', 'properties', 'are', 'clearly', 'dominated', 'by', 'the', 'smaller', 'gap', 'significantly', 'limiting', 'utility', 'in', 'the', '1020', 'k', 'regime', 'that', 'might', 'otherwise', 'have', 'been', 'attractive']]
|
[-0.08823522871243768, 0.12703652386990144, -0.04604571321979165, 0.02661676778079709, -0.04949043644592166, -0.18952786672743968, 0.07207570381870028, 0.4017242804635316, -0.16481892328010872, -0.30355627014068887, 0.030011262142579653, -0.33115966769400984, -0.12456776944454759, 0.2401655961672077, -0.03453271394246258, 0.05280599161051214, -0.016427523911988828, -0.02102123883087188, -0.08671820618474158, -0.26815076495986434, 0.27168178957654165, 0.018358398001873867, 0.33388832989585354, 0.09110470180021366, -0.05193530541146174, -0.04874698285711929, 0.0843005083850585, 0.07469837925746106, -0.18315869650441527, 0.08982699194457382, 0.32923004012554885, -0.04889115452824626, 0.1914219711557962, -0.4446308468352072, -0.27710068591259185, 0.0028628141386434435, 0.15471500627463683, 0.11622636055690236, -0.05130185248563066, -0.23500006110989488, 0.11944264756748453, -0.1711746154585853, -0.1455193890549708, -0.06555914941855008, -0.02452952506719157, -0.031073532707523555, -0.24541770828072912, 0.06968546350253746, 0.044801402490702455, 0.10337868360802531, -0.10524241661187261, -0.19602768776239826, 0.02080621770583093, 0.02975122420466505, 0.02769377022923436, 0.04462021839572117, 0.11156056633335538, -0.11864151942718308, -0.037922992208041253, 0.3274030017666519, -0.07759436133783311, -0.08062353921122849, 0.18100876749376765, -0.13523448919295333, -0.06402341153007, 0.1727277251367923, 0.062271259317640215, 0.045927371154539286, -0.16016878171358256, 0.1020983609072573, -0.08014514149981551, 0.17144869124749676, 0.04512217791052535, 0.04491274825331857, 0.16079388014040888, 0.20873586803209038, -0.007793192748795264, 0.12691632210626266, -0.09652026825206121, 0.008673315506894142, -0.2588905775221065, -0.14888773687998763, -0.1871962653240189, 0.025626115669729187, -0.05554888815950108, -0.14171671165386215, 0.3668651180807501, 0.18605749214766548, 0.16912222786340864, 0.0011969380400842055, 0.26571205114014446, 0.1020789873204194, 0.06805863271001726, 0.03544112958479673, 0.29198933942243455, 0.19232844650105108, 0.09542435122421011, -0.24336466887034475, 0.0409208512341138, 0.005079100327566266]
|
1,803.08787
|
Symmetric Hadamard matrices of orders 268, 412, 436 and 604
|
We construct many symmetric Hadamard matrices of small order by using the so
called propus construction. The necessary difference families are constructed
by restricting the search to the families which admit a nontrivial multiplier.
Our main result is that we have constructed, for the first time, symmetric
Hadamard matrices of order 268, 412, 436 and 604.
|
math.CO
|
we construct many symmetric hadamard matrices of small order by using the so called propus construction the necessary difference families are constructed by restricting the search to the families which admit a nontrivial multiplier our main result is that we have constructed for the first time symmetric hadamard matrices of order 268 412 436 and 604
|
[['we', 'construct', 'many', 'symmetric', 'hadamard', 'matrices', 'of', 'small', 'order', 'by', 'using', 'the', 'so', 'called', 'propus', 'construction', 'the', 'necessary', 'difference', 'families', 'are', 'constructed', 'by', 'restricting', 'the', 'search', 'to', 'the', 'families', 'which', 'admit', 'a', 'nontrivial', 'multiplier', 'our', 'main', 'result', 'is', 'that', 'we', 'have', 'constructed', 'for', 'the', 'first', 'time', 'symmetric', 'hadamard', 'matrices', 'of', 'order', '268', '412', '436', 'and', '604']]
|
[-0.13327798280598863, 0.13770715612918139, -0.03473715898248234, 0.050772132329127216, -0.060027818536452414, -0.09142865052646292, 0.002042824888901253, 0.3453038089376475, -0.20356073815907752, -0.31588072351379587, 0.1727871804323513, -0.23051597972932672, -0.17734933521465532, 0.18445465497123742, -0.04418060281646571, 0.04980337455136968, 0.01970280106823858, 0.01745287819565939, -0.1419855963696526, -0.305059201316908, 0.3666145089415035, -0.022186084850026027, 0.18248028946774347, -0.03170476576113807, 0.10573848459171131, -0.015601680639000344, -0.07326702771907938, -0.05050658171863428, -0.14692746119401687, 0.11058613310368466, 0.2560492072578719, 0.10335751907301269, 0.23318163307184087, -0.328369182800608, -0.09730649968540613, 0.180021088803187, 0.0873445294523013, 0.08505787365096953, -0.07871701623246606, -0.28500423670214203, 0.15833191921202733, -0.19317162888390677, -0.1258001214259171, -0.10804677455286894, 0.03060599137097597, 0.01956269926657634, -0.2838542058504702, 0.022163584296192442, 0.13125782842481776, -0.016502495198177973, -0.013074227775047933, -0.1540037465996907, -0.006178268260555342, 0.11699492180819757, -0.051911610698360686, -0.0015317062747531704, 0.01758106501074508, 0.05264598598504173, -0.1288390938072033, 0.32968876108394135, -0.047729447903943116, -0.20687623650467554, 0.1394470004888717, -0.11239076470623591, -0.12223541739097397, 0.15613308810030244, 0.11864716942155999, 0.16803119479612047, -0.14151226261830224, 0.10874422293584628, -0.11506769340485334, 0.1621430356379798, 0.13637083397147112, 0.013607117655088328, 0.1092945460862081, 0.036260629047839235, 0.10042799977964023, 0.15416658421080293, -0.04184134396824187, -0.11531014399848313, -0.33299540182841675, -0.13780043750271684, -0.18552074797584542, 0.08883871168031224, -0.0944164929676065, -0.1921957852318883, 0.4378381134676082, 0.08892906310835055, 0.1637110392912291, 0.06479444989443957, 0.1854175724687853, 0.1113143976482596, 0.12495772656984627, 0.10294331772352702, 0.19165370770497248, 0.20213926557750841, 0.012610317947941698, -0.13652702352140164, 0.009899713363016158, 0.13660058618656226]
|
1,803.08788
|
Structure and Width of the d*(2380) Dibaryon
|
In this contribution, dedicated to the memory of Walter Greiner, we discuss
the structure and width of the recently established d*(2380) dibaryon,
confronting the consequences of our Pion Assisted Dibaryons hadronic model with
those of quark motivated calculations. In particular, its relatively small
width of about 70 MeV favors hadronic structure for the d*(2380) dibaryon
rather than a six-quark structure.
|
nucl-th hep-ph nucl-ex
|
in this contribution dedicated to the memory of walter greiner we discuss the structure and width of the recently established d2380 dibaryon confronting the consequences of our pion assisted dibaryons hadronic model with those of quark motivated calculations in particular its relatively small width of about 70 mev favors hadronic structure for the d2380 dibaryon rather than a sixquark structure
|
[['in', 'this', 'contribution', 'dedicated', 'to', 'the', 'memory', 'of', 'walter', 'greiner', 'we', 'discuss', 'the', 'structure', 'and', 'width', 'of', 'the', 'recently', 'established', 'd2380', 'dibaryon', 'confronting', 'the', 'consequences', 'of', 'our', 'pion', 'assisted', 'dibaryons', 'hadronic', 'model', 'with', 'those', 'of', 'quark', 'motivated', 'calculations', 'in', 'particular', 'its', 'relatively', 'small', 'width', 'of', 'about', '70', 'mev', 'favors', 'hadronic', 'structure', 'for', 'the', 'd2380', 'dibaryon', 'rather', 'than', 'a', 'sixquark', 'structure']]
|
[-0.09891420586500317, 0.20076035995346805, -0.07692190241068601, 0.17206626843932707, -0.10386288779894433, -0.07906268203320603, 0.11179394323844463, 0.3289403549085061, -0.1662749350691835, -0.27263265031700334, -0.04172841932546968, -0.2581138325079034, -0.02066326585287849, 0.11192475589147459, 0.08807008991328379, 0.05132478560844902, 0.08381010017668207, 0.051438959299897155, -0.04907196767938634, -0.1731912742097241, 0.3405301790529241, 0.11096043518433968, 0.15461489448401455, 0.16959051840628186, -0.005991492614460488, 0.009242186904884875, -0.05296892980113625, -0.0845163165902098, -0.14710887380254764, 0.1308852843940258, 0.15066831383058646, 0.039622395066544414, 0.16961078053185094, -0.3594949994852262, -0.185180159988037, 0.05036710325706129, 0.1215412826333098, 0.11856782509324451, -0.04635050242456297, -0.33170752705385287, 0.15242521762071798, -0.25462467993299165, -0.1901040822422753, -0.07068377772035699, 0.0180924531732065, -0.07564143265287081, -0.2443232312866409, 0.08197429808205925, -0.010266140475869179, 0.04579411991374703, -0.08323678254964761, -0.27564918948337436, -0.020926749190160385, 0.012916842522099615, 0.09846468254108913, 0.09116879033390432, 0.10646581473605086, -0.20100902656946953, -0.13590177497826517, 0.38660096083767714, -0.03263573556250776, -0.08916122118631999, 0.12255838797427714, -0.15664747923923036, -0.17783295499781768, 0.1389302209795763, 0.08234267005076011, 0.06858521674294024, -0.15692232772998976, 0.12728695277958954, -0.051019144772241516, 0.17891666114640734, 0.10856257200551529, 0.11096340231597424, 0.15976641109834114, 0.26506167330080643, -0.09551943550662448, 0.09261046163737774, -0.08792936970324566, -0.13645759148833653, -0.31220816988497974, -0.08266390170125912, -0.1045749878200392, 0.0915421140845865, -0.033223829596681756, -0.10349633738708992, 0.4001758278037111, 0.0663027560726429, 0.25669776409243544, -0.034605255365992585, 0.2472483827266842, 0.032012557417813996, 0.10259269952463607, 0.08484184364788235, 0.30469833256987233, 0.28322993467481866, 0.13763311514630913, -0.2744110958029827, 0.03757086386128018, 0.04199395474667351]
|
1,803.08789
|
Robustifying Twist-and-Turn Entanglement with Interaction-Based Readout
|
The use of multi-particle entangled states has the potential to drastically
increase the sensitivity of atom interferometers and atomic clocks. The
Twist-and-Turn (TNT) Hamiltonian can create multi-particle entanglement much
more rapidly than ubiquitous one-axis twisting (OAT) Hamiltonian in the same
spin system. In this paper, we consider the effects of detection noise - a key
limitation in current experiments - on the metrological usefulness of these
nonclassical states and also consider a variety of interaction-based readouts
to maximize their performance. Interestingly, the optimum interaction-based
readout is not the obvious case of perfect time reversal.
|
quant-ph cond-mat.quant-gas
|
the use of multiparticle entangled states has the potential to drastically increase the sensitivity of atom interferometers and atomic clocks the twistandturn tnt hamiltonian can create multiparticle entanglement much more rapidly than ubiquitous oneaxis twisting oat hamiltonian in the same spin system in this paper we consider the effects of detection noise a key limitation in current experiments on the metrological usefulness of these nonclassical states and also consider a variety of interactionbased readouts to maximize their performance interestingly the optimum interactionbased readout is not the obvious case of perfect time reversal
|
[['the', 'use', 'of', 'multiparticle', 'entangled', 'states', 'has', 'the', 'potential', 'to', 'drastically', 'increase', 'the', 'sensitivity', 'of', 'atom', 'interferometers', 'and', 'atomic', 'clocks', 'the', 'twistandturn', 'tnt', 'hamiltonian', 'can', 'create', 'multiparticle', 'entanglement', 'much', 'more', 'rapidly', 'than', 'ubiquitous', 'oneaxis', 'twisting', 'oat', 'hamiltonian', 'in', 'the', 'same', 'spin', 'system', 'in', 'this', 'paper', 'we', 'consider', 'the', 'effects', 'of', 'detection', 'noise', 'a', 'key', 'limitation', 'in', 'current', 'experiments', 'on', 'the', 'metrological', 'usefulness', 'of', 'these', 'nonclassical', 'states', 'and', 'also', 'consider', 'a', 'variety', 'of', 'interactionbased', 'readouts', 'to', 'maximize', 'their', 'performance', 'interestingly', 'the', 'optimum', 'interactionbased', 'readout', 'is', 'not', 'the', 'obvious', 'case', 'of', 'perfect', 'time', 'reversal']]
|
[-0.1595164350494641, 0.1812981903988301, -0.026334761578017726, 0.04362965598904892, 0.012927081061365165, -0.17582393389033235, 0.0275061365897747, 0.35280344135168457, -0.2352455484468247, -0.2857798907055479, 0.055669479647843655, -0.2648880149885688, -0.12272838725323748, 0.20843278828238987, -0.06410325325154902, 0.1023071969697333, 0.10389231604463219, 0.014743884617928416, -0.08273317210841924, -0.2259426716381036, 0.273852834953805, 0.09304075987260464, 0.33451569341528026, 0.05912986171998731, 0.0941765017772053, 0.025586033510752833, 0.03524189104285577, -0.018494412306767037, -0.0771955288440475, 0.09210681927557428, 0.25747632578966895, 0.10542869117900568, 0.24174940931033748, -0.4564138354794325, -0.18340833778695567, 0.13722092349527645, 0.1362429055000615, 0.18475343910572323, -0.011865954447073265, -0.31553801816999505, -0.010775753053958002, -0.20876470370137173, -0.12574353484112932, -0.11196005462830805, 0.012555259856921823, -0.011086013092173507, -0.18789047239166076, 0.0526069381483704, 0.07807384432374459, 0.04128270755198015, 0.009016954679163578, -0.055763695924289765, 0.006408599819026321, 0.102149808516159, -0.05951655604977808, -0.0032603341564738557, 0.17417848387571133, -0.15307381969583017, -0.1578046537115765, 0.3746922567446271, -0.05946714151729754, -0.20189532948880579, 0.18554968316533157, -0.14053224695279545, -0.10483934592617594, 0.09681513719007616, 0.14626967994010318, 0.08834855936710602, -0.10933391753401932, 0.017136097135295604, 0.0038634457362248845, 0.19953240954782814, 0.08108399977209046, 0.15413938600407995, 0.16658822400875026, 0.15733140738966936, 0.13928781084858044, 0.18511909259604695, -0.11421659704976027, -0.1151027372714294, -0.2341415650849028, -0.19932185683358947, -0.21645780831939823, 0.08017262753175759, -0.04674532153085633, -0.10842070262879133, 0.44655796914847323, 0.21518295110992924, 0.11246359629465429, -0.022682032011368352, 0.32836195097669313, 0.10246914766384693, 0.07663591747405007, -0.017860071024978937, 0.29735192648418574, 0.12496811488033374, 0.0846061950807938, -0.2960817219092227, 0.05867150937126059, -0.02893153715716756]
|
1,803.0879
|
Sentiment Analysis of Comments on Rohingya Movement with Support Vector
Machine
|
The Rohingya Movement and Crisis caused a huge uproar in the political and
economic state of Bangladesh. Refugee movement is a recurring event and a large
amount of data in the form of opinions remains on social media such as
Facebook, with very little analysis done on them.To analyse the comments based
on all Rohingya related posts, we had to create and modify a classifier based
on the Support Vector Machine algorithm. The code is implemented in python and
uses scikit-learn library. A dataset on Rohingya analysis is not currently
available so we had to use our own data set of 2500 positive and 2500 negative
comments. We specifically used a support vector machine with linear kernel. A
previous experiment was performed by us on the same dataset using the naive
bayes algorithm, but that did not yield impressive results.
|
cs.IR cs.CL cs.LG
|
the rohingya movement and crisis caused a huge uproar in the political and economic state of bangladesh refugee movement is a recurring event and a large amount of data in the form of opinions remains on social media such as facebook with very little analysis done on themto analyse the comments based on all rohingya related posts we had to create and modify a classifier based on the support vector machine algorithm the code is implemented in python and uses scikitlearn library a dataset on rohingya analysis is not currently available so we had to use our own data set of 2500 positive and 2500 negative comments we specifically used a support vector machine with linear kernel a previous experiment was performed by us on the same dataset using the naive bayes algorithm but that did not yield impressive results
|
[['the', 'rohingya', 'movement', 'and', 'crisis', 'caused', 'a', 'huge', 'uproar', 'in', 'the', 'political', 'and', 'economic', 'state', 'of', 'bangladesh', 'refugee', 'movement', 'is', 'a', 'recurring', 'event', 'and', 'a', 'large', 'amount', 'of', 'data', 'in', 'the', 'form', 'of', 'opinions', 'remains', 'on', 'social', 'media', 'such', 'as', 'facebook', 'with', 'very', 'little', 'analysis', 'done', 'on', 'themto', 'analyse', 'the', 'comments', 'based', 'on', 'all', 'rohingya', 'related', 'posts', 'we', 'had', 'to', 'create', 'and', 'modify', 'a', 'classifier', 'based', 'on', 'the', 'support', 'vector', 'machine', 'algorithm', 'the', 'code', 'is', 'implemented', 'in', 'python', 'and', 'uses', 'scikitlearn', 'library', 'a', 'dataset', 'on', 'rohingya', 'analysis', 'is', 'not', 'currently', 'available', 'so', 'we', 'had', 'to', 'use', 'our', 'own', 'data', 'set', 'of', '2500', 'positive', 'and', '2500', 'negative', 'comments', 'we', 'specifically', 'used', 'a', 'support', 'vector', 'machine', 'with', 'linear', 'kernel', 'a', 'previous', 'experiment', 'was', 'performed', 'by', 'us', 'on', 'the', 'same', 'dataset', 'using', 'the', 'naive', 'bayes', 'algorithm', 'but', 'that', 'did', 'not', 'yield', 'impressive', 'results']]
|
[-0.04946290999246032, 0.03899454003355155, -0.09929639074033585, 0.08025368348192559, -0.18152669619640632, -0.14383826713563633, 0.09505948232169655, 0.4119376995047365, -0.18763046604378716, -0.3272760772362243, 0.1559074516349094, -0.34580508047255915, -0.14981032543532227, 0.2211459243472495, -0.07671359654151551, 0.05730765027439465, 0.12624749336290456, 0.1021733334409478, 0.017639276182466267, -0.3029968355903807, 0.3011594492709264, 0.08739609964718313, 0.32878643878992053, 0.06450732850024234, 0.12112644742634418, 0.007796408223879078, -0.10911431771946019, 0.02002785762221944, -0.07963072601837601, 0.12771922648043718, 0.24198043915152928, 0.23674430335075528, 0.3333134400570576, -0.4161890870554076, -0.15409998203614267, 0.07138584612571783, 0.09851390054530423, 0.10988079452869462, -0.04866379245852485, -0.2930076037520084, 0.07621186813407078, -0.20383565919136332, -0.04824665095994546, -0.1021392809841242, -0.0030811713549537935, 0.00682990874612596, -0.23111571024333977, 0.029023130221859268, 0.012436365558549869, 0.1392873857791225, -0.035758490901123194, -0.13445542330610688, 0.006630826042622346, 0.13006842603035562, 0.05063937796259542, 0.05701730762645467, 0.13673837294977537, -0.11277017777826151, -0.13766243325738722, 0.3607823080855651, -0.09777968536313299, -0.1688039714699962, 0.19108666308338929, -0.08155577997946976, -0.12611904605190552, 0.07665502321670183, 0.2610103098905065, 0.06738579621457536, -0.1350010482027479, 0.025209081154215433, -0.07320212609256091, 0.22341304126641023, 0.04738911726862948, -0.0705290351440941, 0.1612953480495059, 0.17770788735588608, -0.00792331914619907, 0.10725804817849312, -0.07226725087831795, -0.08405339727313191, -0.22638827625770067, -0.11804256227164381, -0.1819084084709175, 0.026850292152274684, -0.04870696204475741, -0.1785495495693623, 0.37564904823987, 0.1694822913994068, 0.19560997590652088, 0.027433667794220906, 0.2670812347593407, -0.0007205232141659244, 0.1307030620738405, 0.13408261352299672, 0.18599360865419326, 0.028185377381674512, 0.1687902119078174, -0.14463935304134476, 0.11498961393195002, -0.004325393912976311]
|
1,803.08791
|
LMPIT-inspired Tests for Detecting a Cyclostationary Signal in Noise
with Spatio-Temporal Structure
|
In spectrum sensing for cognitive radio, the presence of a primary user can
be detected by making use of the cyclostationarity property of digital
communication signals. For the general scenario of a cyclostationary signal in
temporally colored and spatially correlated noise, it has previously been shown
that an asymptotic generalized likelihood ratio test (GLRT) and locally most
powerful invariant test (LMPIT) exist. In this paper, we derive detectors for
the presence of a cyclostationary signal in various scenarios with structured
noise. In particular, we consider noise that is temporally white and/or
spatially uncorrelated. Detectors that make use of this additional information
about the noise process have enhanced performance. We have previously derived
GLRTs for these specific scenarios; here, we examine the existence of LMPITs.
We show that these exist only for detecting the presence of a cyclostationary
signal in spatially uncorrelated noise. For white noise, an LMPIT does not
exist. Instead, we propose tests that approximate the LMPIT, and they are shown
to perform well in simulations. Finally, if the noise structure is not known in
advance, we also present hypothesis tests using our framework.
|
eess.SP
|
in spectrum sensing for cognitive radio the presence of a primary user can be detected by making use of the cyclostationarity property of digital communication signals for the general scenario of a cyclostationary signal in temporally colored and spatially correlated noise it has previously been shown that an asymptotic generalized likelihood ratio test glrt and locally most powerful invariant test lmpit exist in this paper we derive detectors for the presence of a cyclostationary signal in various scenarios with structured noise in particular we consider noise that is temporally white andor spatially uncorrelated detectors that make use of this additional information about the noise process have enhanced performance we have previously derived glrts for these specific scenarios here we examine the existence of lmpits we show that these exist only for detecting the presence of a cyclostationary signal in spatially uncorrelated noise for white noise an lmpit does not exist instead we propose tests that approximate the lmpit and they are shown to perform well in simulations finally if the noise structure is not known in advance we also present hypothesis tests using our framework
|
[['in', 'spectrum', 'sensing', 'for', 'cognitive', 'radio', 'the', 'presence', 'of', 'a', 'primary', 'user', 'can', 'be', 'detected', 'by', 'making', 'use', 'of', 'the', 'cyclostationarity', 'property', 'of', 'digital', 'communication', 'signals', 'for', 'the', 'general', 'scenario', 'of', 'a', 'cyclostationary', 'signal', 'in', 'temporally', 'colored', 'and', 'spatially', 'correlated', 'noise', 'it', 'has', 'previously', 'been', 'shown', 'that', 'an', 'asymptotic', 'generalized', 'likelihood', 'ratio', 'test', 'glrt', 'and', 'locally', 'most', 'powerful', 'invariant', 'test', 'lmpit', 'exist', 'in', 'this', 'paper', 'we', 'derive', 'detectors', 'for', 'the', 'presence', 'of', 'a', 'cyclostationary', 'signal', 'in', 'various', 'scenarios', 'with', 'structured', 'noise', 'in', 'particular', 'we', 'consider', 'noise', 'that', 'is', 'temporally', 'white', 'andor', 'spatially', 'uncorrelated', 'detectors', 'that', 'make', 'use', 'of', 'this', 'additional', 'information', 'about', 'the', 'noise', 'process', 'have', 'enhanced', 'performance', 'we', 'have', 'previously', 'derived', 'glrts', 'for', 'these', 'specific', 'scenarios', 'here', 'we', 'examine', 'the', 'existence', 'of', 'lmpits', 'we', 'show', 'that', 'these', 'exist', 'only', 'for', 'detecting', 'the', 'presence', 'of', 'a', 'cyclostationary', 'signal', 'in', 'spatially', 'uncorrelated', 'noise', 'for', 'white', 'noise', 'an', 'lmpit', 'does', 'not', 'exist', 'instead', 'we', 'propose', 'tests', 'that', 'approximate', 'the', 'lmpit', 'and', 'they', 'are', 'shown', 'to', 'perform', 'well', 'in', 'simulations', 'finally', 'if', 'the', 'noise', 'structure', 'is', 'not', 'known', 'in', 'advance', 'we', 'also', 'present', 'hypothesis', 'tests', 'using', 'our', 'framework']]
|
[-0.12266682438633364, 0.08834040151170643, -0.06795336639650328, 0.09313416356667403, -0.039473359554034214, -0.1750277458011861, 0.016500106944991072, 0.42819785856155923, -0.22828116461206935, -0.28874685213415197, 0.12779932499625316, -0.240601677877788, -0.21850554238873252, 0.17772311348918543, -0.09811957073828165, 0.032633187146174074, 0.04161860421426473, 0.03182364082275181, -0.027642295014432064, -0.23439900033965544, 0.3137329771011339, 0.09917397289119316, 0.2817038289630664, -0.020329818907750607, 0.07632311401792559, -0.01120881401331407, -0.08387464874312686, 0.006469336748325631, -0.07085341341834188, 0.03495329455472529, 0.2534619744641848, 0.16850395810046315, 0.2276975865306272, -0.40595853316557146, -0.27752641216426605, 0.16683976038462867, 0.1468052289593565, 0.10467523728553003, -0.09716153705401508, -0.2988290185938873, 0.1253238011457775, -0.16480952464094709, -0.07207249735390929, -0.08650227143358358, -0.021488779583824395, 0.029544734477025013, -0.3091282264481972, 0.10792501197616018, 0.09159774811237383, 0.009631035144633168, -0.03712927339517552, -0.07895284766424954, 0.07739596972533036, 0.12467057744873708, 0.020051513392821147, -0.04640475772738801, 0.09484730583473878, -0.11976410025659867, -0.11636866812161474, 0.31642393321469525, -0.09711888013186146, -0.23983192475735332, 0.21077039656001548, -0.136839939171256, -0.18054859126087927, 0.12492843585483648, 0.19119919982799533, 0.1065858750092878, -0.21134620240374477, 0.03911602246206831, -0.03545774018857628, 0.20227043126183358, 0.06502932679596478, 0.08913488656632937, 0.20239373445181866, 0.1391134341386572, 0.06651113130425548, 0.15378581973250813, -0.17014783509986717, -0.04064009713170969, -0.27329613121685764, -0.10169340872317148, -0.1799028620785659, 0.03610424867356019, -0.04558638734187812, -0.16232311939308167, 0.35858912521001435, 0.21533864005805695, 0.14444652977956296, 0.05443869632638424, 0.32643585129762476, 0.11824453183583936, 0.007316884282298143, 0.08227825166819536, 0.2652350776074657, 0.11580471008757899, 0.054855403353703085, -0.1512957766804586, 0.08424103839586125, -0.06722660478250042]
|
1,803.08792
|
A new class of Volterra-type integral equations from relativistic
quantum physics
|
Here we study a new kind of linear integral equations for a relativistic
quantum-mechanical two-particle wave function $\psi(x_1,x_2)$, where $x_1,x_2$
are spacetime points. In the case of retarded interaction, these integral
equations are of Volterra-type in the in the time variables, i.e., they involve
a time integration from 0 to $t_i = x_i^0,~i=1,2$. They are interesting not
only in view of their applications in physics, but also because of the
following mathematical features: (a) time and space variables are more
interrelated than in normal time-dependent problems, (b) the integral kernels
are singular, and the structure of these singularities is non-trivial, (c) they
feature time delay. We formulate a number of examples of such equations for
scalar wave functions and prove existence and uniqueness of solutions for them.
We also point out open mathematical problems.
|
math-ph math.AP math.MP
|
here we study a new kind of linear integral equations for a relativistic quantummechanical twoparticle wave function psix_1x_2 where x_1x_2 are spacetime points in the case of retarded interaction these integral equations are of volterratype in the in the time variables ie they involve a time integration from 0 to t_i x_i0i12 they are interesting not only in view of their applications in physics but also because of the following mathematical features a time and space variables are more interrelated than in normal timedependent problems b the integral kernels are singular and the structure of these singularities is nontrivial c they feature time delay we formulate a number of examples of such equations for scalar wave functions and prove existence and uniqueness of solutions for them we also point out open mathematical problems
|
[['here', 'we', 'study', 'a', 'new', 'kind', 'of', 'linear', 'integral', 'equations', 'for', 'a', 'relativistic', 'quantummechanical', 'twoparticle', 'wave', 'function', 'psix_1x_2', 'where', 'x_1x_2', 'are', 'spacetime', 'points', 'in', 'the', 'case', 'of', 'retarded', 'interaction', 'these', 'integral', 'equations', 'are', 'of', 'volterratype', 'in', 'the', 'in', 'the', 'time', 'variables', 'ie', 'they', 'involve', 'a', 'time', 'integration', 'from', '0', 'to', 't_i', 'x_i0i12', 'they', 'are', 'interesting', 'not', 'only', 'in', 'view', 'of', 'their', 'applications', 'in', 'physics', 'but', 'also', 'because', 'of', 'the', 'following', 'mathematical', 'features', 'a', 'time', 'and', 'space', 'variables', 'are', 'more', 'interrelated', 'than', 'in', 'normal', 'timedependent', 'problems', 'b', 'the', 'integral', 'kernels', 'are', 'singular', 'and', 'the', 'structure', 'of', 'these', 'singularities', 'is', 'nontrivial', 'c', 'they', 'feature', 'time', 'delay', 'we', 'formulate', 'a', 'number', 'of', 'examples', 'of', 'such', 'equations', 'for', 'scalar', 'wave', 'functions', 'and', 'prove', 'existence', 'and', 'uniqueness', 'of', 'solutions', 'for', 'them', 'we', 'also', 'point', 'out', 'open', 'mathematical', 'problems']]
|
[-0.17778512865223808, 0.1014481284408689, -0.09137016994822206, 0.10176375395156245, -0.0951409995887485, -0.13100766208178052, 0.002626918076368218, 0.361183809328147, -0.2979761187170604, -0.22530964918603952, 0.1198360738714903, -0.2965664886305052, -0.1727745506602029, 0.2126838322023325, -0.008224112714577297, 0.08164402086880397, 0.05101636600341986, 0.045554967103243776, -0.10279936382942127, -0.22655689596219666, 0.35473731052567903, -0.05414889573655797, 0.1494245887628164, 0.0160837156493499, 0.1138339886762851, -0.006608247965094492, -0.04551561620037043, 0.03222428016504802, -0.1087696320072141, 0.06498827514323322, 0.29829234410488314, 0.11179933749724913, 0.29040440681891405, -0.45484225583883625, -0.201415957163342, 0.0971103848635473, 0.13453978260936725, 0.09149717366336986, -0.013717114767187564, -0.26671575638994743, 0.0390811100078281, -0.08353794399634794, -0.1667480533519252, -0.0915471920108592, 0.06210796180830309, 0.08616376545625937, -0.25581297124286223, 0.09975029924614566, 0.05316430369787144, 0.033195118476269825, -0.08761050319475489, -0.10997711897432579, 0.0013662110555521917, 0.07818971561253861, 0.05135517919111545, -0.01152937499644009, 0.051248251291822686, -0.16651425853540952, -0.09239695760576676, 0.36088749013001553, -0.01666855863809222, -0.26933083896327653, 0.1859732077397039, -0.15224741656460206, -0.15571975668849933, 0.12595075618645007, 0.17783522455526204, 0.17109944752530393, -0.16399602800877552, 0.1296805735081293, -0.04221460686720534, 0.09515069671716915, 0.09024448280406157, 0.06345054545707887, 0.17059298354610236, 0.08175965799300959, 0.06746096698793047, 0.08957563660629658, -0.016151880408208606, -0.13615745641855578, -0.3855752211459207, -0.19894324290516757, -0.15429810506545685, 0.08780557372874957, -0.10112038602528628, -0.1923483699969383, 0.3911337456771765, 0.12295470221645453, 0.16303529331785147, 0.03947183422419722, 0.21496834734341863, 0.1742778056174178, 0.021698654478920314, 0.08487477846034436, 0.18801146878853836, 0.11326209388172367, 0.11965745368930088, -0.16303813714837428, 0.012349409160599338, 0.09443343586330726]
|
1,803.08793
|
Exploring the Naturalness of Buggy Code with Recurrent Neural Networks
|
Statistical language models are powerful tools which have been used for many
tasks within natural language processing. Recently, they have been used for
other sequential data such as source code.(Ray et al., 2015) showed that it is
possible train an n-gram source code language mode, and use it to predict buggy
lines in code by determining "unnatural" lines via entropy with respect to the
language model. In this work, we propose using a more advanced language
modeling technique, Long Short-term Memory recurrent neural networks, to model
source code and classify buggy lines based on entropy. We show that our method
slightly outperforms an n-gram model in the buggy line classification task
using AUC.
|
cs.SE cs.CL cs.LG
|
statistical language models are powerful tools which have been used for many tasks within natural language processing recently they have been used for other sequential data such as source coderay et al 2015 showed that it is possible train an ngram source code language mode and use it to predict buggy lines in code by determining unnatural lines via entropy with respect to the language model in this work we propose using a more advanced language modeling technique long shortterm memory recurrent neural networks to model source code and classify buggy lines based on entropy we show that our method slightly outperforms an ngram model in the buggy line classification task using auc
|
[['statistical', 'language', 'models', 'are', 'powerful', 'tools', 'which', 'have', 'been', 'used', 'for', 'many', 'tasks', 'within', 'natural', 'language', 'processing', 'recently', 'they', 'have', 'been', 'used', 'for', 'other', 'sequential', 'data', 'such', 'as', 'source', 'coderay', 'et', 'al', '2015', 'showed', 'that', 'it', 'is', 'possible', 'train', 'an', 'ngram', 'source', 'code', 'language', 'mode', 'and', 'use', 'it', 'to', 'predict', 'buggy', 'lines', 'in', 'code', 'by', 'determining', 'unnatural', 'lines', 'via', 'entropy', 'with', 'respect', 'to', 'the', 'language', 'model', 'in', 'this', 'work', 'we', 'propose', 'using', 'a', 'more', 'advanced', 'language', 'modeling', 'technique', 'long', 'shortterm', 'memory', 'recurrent', 'neural', 'networks', 'to', 'model', 'source', 'code', 'and', 'classify', 'buggy', 'lines', 'based', 'on', 'entropy', 'we', 'show', 'that', 'our', 'method', 'slightly', 'outperforms', 'an', 'ngram', 'model', 'in', 'the', 'buggy', 'line', 'classification', 'task', 'using', 'auc']]
|
[0.007756071436493325, -0.03238836186704118, -0.05847896656736599, 0.13066845987590828, -0.1156049193315474, -0.2437791041821973, 0.019930984143034687, 0.4943015101764883, -0.2552940319832747, -0.35533182502435273, 0.06450541078083916, -0.26439666781308396, -0.1528054346396987, 0.2605605590651976, -0.10546518875344191, 0.11545880742570651, 0.12696706054517953, 0.04430413683959549, 0.006631667919594163, -0.26591034323376206, 0.26556223469586776, 0.10499138679421906, 0.3373349633766338, -0.002685114891002221, 0.07250916929271105, -0.04342563863610849, -0.04743397853183394, -0.022846069677533314, -0.0476838383636797, 0.13825823962023215, 0.30806401681018414, 0.2692237987898157, 0.25874366225408657, -0.4104762750544718, -0.30065921987988986, 0.07688671530091337, 0.11081014668161515, 0.14864802096417407, 0.003062821646510981, -0.28927283665065523, 0.10606791506039112, -0.2199605984455307, 0.02297130838685137, -0.14553052232700533, 0.04415388581609087, -0.022280923510801846, -0.22796325024163316, 0.015038442672188726, 0.11736231576235566, 0.13135417298846214, 0.011976930040483629, -0.09659792211875486, -0.004839683498305801, 0.1198848166719212, 0.031099384050841245, 0.101453994766676, 0.08865561004911017, -0.08895979452686983, -0.1878848955717071, 0.3517668104697285, -0.11377480429863292, -0.2094876287405246, 0.23514037302603746, 0.04812653231368001, -0.2173174248268229, 0.0834610489712629, 0.2175315024464258, 0.11788889606084142, -0.18876919314997004, 0.032618789959607444, -0.03609713937216189, 0.2550417501520964, 0.0720335809143892, -0.02130168523997002, 0.2403454397930805, 0.18782051469731545, -0.06382959294933244, 0.15398269318809202, -0.12576721228625892, -0.050325801773786746, -0.18182736765759597, -0.12493897759538543, -0.15221248254731887, -0.04706570900660673, -0.02611796210710184, -0.16735467031997228, 0.3767830129779343, 0.23733279039983504, 0.15341314874655967, 0.09583967442761475, 0.297933551848733, 0.053074664170188565, 0.13741573741260385, 0.151539594834633, 0.13521812807136616, 0.032227103253327574, 0.1357055853628221, -0.15515900340895833, 0.1000628161585025, 0.07888420267512888]
|
1,803.08794
|
Learning Deep Context-Network Architectures for Image Annotation
|
Context plays an important role in visual pattern recognition as it provides
complementary clues for different learning tasks including image classification
and annotation. In the particular scenario of kernel learning, the general
recipe of context-based kernel design consists in learning positive
semi-definite similarity functions that return high values not only when data
share similar content but also similar context. However, in spite of having a
positive impact on performance, the use of context in these kernel design
methods has not been fully explored; indeed, context has been handcrafted
instead of being learned. In this paper, we introduce a novel context-aware
kernel design framework based on deep learning. Our method discriminatively
learns spatial geometric context as the weights of a deep network (DN). The
architecture of this network is fully determined by the solution of an
objective function that mixes content, context and regularization, while the
parameters of this network determine the most relevant (discriminant) parts of
the learned context. We apply this context and kernel learning framework to
image classification using the challenging ImageCLEF Photo Annotation
benchmark; the latter shows that our deep context learning provides highly
effective kernels for image classification as corroborated through extensive
experiments.
|
cs.CV
|
context plays an important role in visual pattern recognition as it provides complementary clues for different learning tasks including image classification and annotation in the particular scenario of kernel learning the general recipe of contextbased kernel design consists in learning positive semidefinite similarity functions that return high values not only when data share similar content but also similar context however in spite of having a positive impact on performance the use of context in these kernel design methods has not been fully explored indeed context has been handcrafted instead of being learned in this paper we introduce a novel contextaware kernel design framework based on deep learning our method discriminatively learns spatial geometric context as the weights of a deep network dn the architecture of this network is fully determined by the solution of an objective function that mixes content context and regularization while the parameters of this network determine the most relevant discriminant parts of the learned context we apply this context and kernel learning framework to image classification using the challenging imageclef photo annotation benchmark the latter shows that our deep context learning provides highly effective kernels for image classification as corroborated through extensive experiments
|
[['context', 'plays', 'an', 'important', 'role', 'in', 'visual', 'pattern', 'recognition', 'as', 'it', 'provides', 'complementary', 'clues', 'for', 'different', 'learning', 'tasks', 'including', 'image', 'classification', 'and', 'annotation', 'in', 'the', 'particular', 'scenario', 'of', 'kernel', 'learning', 'the', 'general', 'recipe', 'of', 'contextbased', 'kernel', 'design', 'consists', 'in', 'learning', 'positive', 'semidefinite', 'similarity', 'functions', 'that', 'return', 'high', 'values', 'not', 'only', 'when', 'data', 'share', 'similar', 'content', 'but', 'also', 'similar', 'context', 'however', 'in', 'spite', 'of', 'having', 'a', 'positive', 'impact', 'on', 'performance', 'the', 'use', 'of', 'context', 'in', 'these', 'kernel', 'design', 'methods', 'has', 'not', 'been', 'fully', 'explored', 'indeed', 'context', 'has', 'been', 'handcrafted', 'instead', 'of', 'being', 'learned', 'in', 'this', 'paper', 'we', 'introduce', 'a', 'novel', 'contextaware', 'kernel', 'design', 'framework', 'based', 'on', 'deep', 'learning', 'our', 'method', 'discriminatively', 'learns', 'spatial', 'geometric', 'context', 'as', 'the', 'weights', 'of', 'a', 'deep', 'network', 'dn', 'the', 'architecture', 'of', 'this', 'network', 'is', 'fully', 'determined', 'by', 'the', 'solution', 'of', 'an', 'objective', 'function', 'that', 'mixes', 'content', 'context', 'and', 'regularization', 'while', 'the', 'parameters', 'of', 'this', 'network', 'determine', 'the', 'most', 'relevant', 'discriminant', 'parts', 'of', 'the', 'learned', 'context', 'we', 'apply', 'this', 'context', 'and', 'kernel', 'learning', 'framework', 'to', 'image', 'classification', 'using', 'the', 'challenging', 'imageclef', 'photo', 'annotation', 'benchmark', 'the', 'latter', 'shows', 'that', 'our', 'deep', 'context', 'learning', 'provides', 'highly', 'effective', 'kernels', 'for', 'image', 'classification', 'as', 'corroborated', 'through', 'extensive', 'experiments']]
|
[-0.02227381681006988, -0.04850964847497694, -0.07847403087605945, 0.074340959713643, -0.11932850664784082, -0.1580397682973576, -0.007305041580167859, 0.4512170528718814, -0.2579084689318803, -0.30084245662124554, 0.07396274112368258, -0.23473304624995453, -0.24175059082468753, 0.18949243940914115, -0.12334945718970547, 0.080104074629185, 0.11935478629222905, 0.058270147936016814, -0.08330301693073346, -0.2718236822928042, 0.3730791525555973, 0.07048719276175928, 0.3503678565759798, 0.038969648643254966, 0.13062118328289307, 0.004190788141021571, -0.06320065194723164, -0.022997147161962682, -0.0527189399244197, 0.18123852026407716, 0.3280035433900746, 0.2100051361588799, 0.3529679883238363, -0.3881117183015431, -0.25315422527988435, 0.10584695445524935, 0.172624774189751, 0.05947997455064415, -0.08588305626627114, -0.3029016015914075, 0.07559490417659774, -0.163150486805793, 0.013790422382759791, -0.1729257826783179, -0.017804852337059376, -0.05880760355955368, -0.2757437905476329, 0.025139913336683518, 0.1000701288933757, 0.058923632322531665, -0.06917224476719039, -0.12621348696763196, 0.04919088791422357, 0.16291628518158943, 0.017711760540644113, 0.06853347537722344, 0.12742139233115513, -0.2062848617752948, -0.11205222617437695, 0.35171107532749624, -0.06616899914044395, -0.21557175489612335, 0.1989901798699278, -0.028280780690859264, -0.1766331374248121, 0.06974264191756696, 0.2391487071591992, 0.13684200296689034, -0.1800872422510263, 0.06103751302352837, -0.07592847718984871, 0.16995580638297905, 0.025039301998440535, 0.024280837700680975, 0.19024667632293316, 0.2775408501670634, 0.013700121914410047, 0.14227896039066884, -0.10630138412940547, -0.07842681276597802, -0.24239516534327252, -0.12151013998087817, -0.2109823114023577, -0.056006303184570005, -0.11690646199414065, -0.13282069940413088, 0.4172965289722315, 0.19894561196351188, 0.23555531845602967, 0.0692641619004328, 0.31906427157957695, 0.06077410614774367, 0.1260830887503506, 0.07813801817586503, 0.1882630006763564, 0.027727273211289708, 0.12973981220594272, -0.1749935961295354, 0.126622645400682, 0.09250419774343292]
|
1,803.08795
|
Modelling and controllability of the motion of a slender, flexible
micro-swimmer
|
The mechanism of swimming at very low Reynolds number conditions is a topic
of interest to biologists and engineering community. We develop a novel
kinematic model of a slender flexible swimmer which locomotes in a low Reynolds
number regime. In contrast to existing techniques that model such systems as a
connected set of straight, rigid links, the novelty of our technique stems from
the fact that we model the swimmer with two components - one is a straight,
rigid body (the head) and the other is a flexible member (the tail). Using Cox
theory we model the gradient of the forces as a function of the instantaneous
shape of the swimmer and its velocity. By virtue of the low inertia conditions,
an expression for the translational and rotational velocity of the head is
obtained for the planar motion in the form of a Lie algebra of the Special
Euclidean group. We explain the principal fiber bundle structure of the
configuration space of the swimmer and use that to show a weak controllability
result for a type of slender flexible swimmer where the shape space is the
space of all continuous curves of a given length. A set of simulation results
is presented showing the variation of the swimmer head velocity for a bump
function moving along the swimmer length.
|
cs.SY physics.flu-dyn
|
the mechanism of swimming at very low reynolds number conditions is a topic of interest to biologists and engineering community we develop a novel kinematic model of a slender flexible swimmer which locomotes in a low reynolds number regime in contrast to existing techniques that model such systems as a connected set of straight rigid links the novelty of our technique stems from the fact that we model the swimmer with two components one is a straight rigid body the head and the other is a flexible member the tail using cox theory we model the gradient of the forces as a function of the instantaneous shape of the swimmer and its velocity by virtue of the low inertia conditions an expression for the translational and rotational velocity of the head is obtained for the planar motion in the form of a lie algebra of the special euclidean group we explain the principal fiber bundle structure of the configuration space of the swimmer and use that to show a weak controllability result for a type of slender flexible swimmer where the shape space is the space of all continuous curves of a given length a set of simulation results is presented showing the variation of the swimmer head velocity for a bump function moving along the swimmer length
|
[['the', 'mechanism', 'of', 'swimming', 'at', 'very', 'low', 'reynolds', 'number', 'conditions', 'is', 'a', 'topic', 'of', 'interest', 'to', 'biologists', 'and', 'engineering', 'community', 'we', 'develop', 'a', 'novel', 'kinematic', 'model', 'of', 'a', 'slender', 'flexible', 'swimmer', 'which', 'locomotes', 'in', 'a', 'low', 'reynolds', 'number', 'regime', 'in', 'contrast', 'to', 'existing', 'techniques', 'that', 'model', 'such', 'systems', 'as', 'a', 'connected', 'set', 'of', 'straight', 'rigid', 'links', 'the', 'novelty', 'of', 'our', 'technique', 'stems', 'from', 'the', 'fact', 'that', 'we', 'model', 'the', 'swimmer', 'with', 'two', 'components', 'one', 'is', 'a', 'straight', 'rigid', 'body', 'the', 'head', 'and', 'the', 'other', 'is', 'a', 'flexible', 'member', 'the', 'tail', 'using', 'cox', 'theory', 'we', 'model', 'the', 'gradient', 'of', 'the', 'forces', 'as', 'a', 'function', 'of', 'the', 'instantaneous', 'shape', 'of', 'the', 'swimmer', 'and', 'its', 'velocity', 'by', 'virtue', 'of', 'the', 'low', 'inertia', 'conditions', 'an', 'expression', 'for', 'the', 'translational', 'and', 'rotational', 'velocity', 'of', 'the', 'head', 'is', 'obtained', 'for', 'the', 'planar', 'motion', 'in', 'the', 'form', 'of', 'a', 'lie', 'algebra', 'of', 'the', 'special', 'euclidean', 'group', 'we', 'explain', 'the', 'principal', 'fiber', 'bundle', 'structure', 'of', 'the', 'configuration', 'space', 'of', 'the', 'swimmer', 'and', 'use', 'that', 'to', 'show', 'a', 'weak', 'controllability', 'result', 'for', 'a', 'type', 'of', 'slender', 'flexible', 'swimmer', 'where', 'the', 'shape', 'space', 'is', 'the', 'space', 'of', 'all', 'continuous', 'curves', 'of', 'a', 'given', 'length', 'a', 'set', 'of', 'simulation', 'results', 'is', 'presented', 'showing', 'the', 'variation', 'of', 'the', 'swimmer', 'head', 'velocity', 'for', 'a', 'bump', 'function', 'moving', 'along', 'the', 'swimmer', 'length']]
|
[-0.15871935120991898, 0.1019668548506999, -0.09730980754293467, 0.00027292661373138705, -0.10107599950421275, -0.11229313629108571, -0.004874663926529041, 0.3691958097080069, -0.2861045599133978, -0.2603529105907143, 0.060191810772161985, -0.19861636131525487, -0.16588912457485216, 0.1928006564309898, -0.08988226112836654, 0.03656279942646305, 0.049855801016135216, 0.0574553500107717, -0.0003888625833999863, -0.1492153307796383, 0.27775907744589146, 0.02055895377877533, 0.28054416122254033, 0.01039218766430247, 0.17702478738845012, 0.0016354660059364023, 0.023834809817562592, 0.07282889611101151, -0.1442517828349384, 0.15136659776626696, 0.17547230932685604, 0.06770970486104488, 0.25695729443764803, -0.4040928518888862, -0.19583661454055923, 0.06953206285941607, 0.12807390879311767, 0.1220488280421638, -0.012311312552404157, -0.24303720849952423, 0.06629512460380878, -0.19472808200084873, -0.19896031735885528, -0.009961132915081104, 0.06724663750882248, 0.064761232305412, -0.24567078172324724, 0.06355799163996417, 0.076125349703541, 0.09690144798001661, -0.07511259381571347, -0.060741985721024364, -0.04206917110577329, 0.12366860716663781, 0.07441548482098613, 0.03716130930638533, 0.17933273409634898, -0.18766381666665116, -0.061689117215230446, 0.41162976644255117, -0.03687170767633047, -0.24769515308984963, 0.20368318845333386, -0.14968894596489507, -0.0961448692540694, 0.14819045562333585, 0.17756151420832506, 0.12537990203411598, -0.09000733069252558, 0.059753964550086094, -0.09275345439048406, 0.12520576251267287, 0.03666504381936953, -0.06393668521410241, 0.1788749867998716, 0.1931558137068585, 0.08873893364414026, 0.14065505512469675, -0.12318956941979925, -0.051893050984097515, -0.3313133825595203, -0.16615161755710223, -0.18951332516064825, -0.009726487121583405, -0.11675162143619841, -0.18653924573075525, 0.4060876502018113, 0.06377660946483017, 0.24845767613663444, 0.10404328065377141, 0.3091134346339182, 0.07116159991844566, 0.0576984326586917, 0.061183290865083444, 0.23018814750232472, 0.14844705487069274, 0.06959966207695653, -0.22416082004241833, 0.04812832992880129, 0.09787414868926621]
|
1,803.08796
|
Renormalizing the zero point energy in dense QCD
|
We analyze the zero point energy in a dense matter of quarks or hadrons with
particular attention on the renormalization of the UV divergences. Besides
divergences removable by the vacuum subtraction and counter terms, there are
also UV divergences associated with non-perturbative modifications of quark
bases appearing in the in-medium propagators. The latter would remain after the
self-energies and vertices are renormalized, unless a proper set of medium
contributions is included at a given truncation. We use the formalism of the
two particle irreducible action to clarify how the UV divergences are assembled
to cancel. An example is given for the thermodynamic potentials with mesons as
composite particles whose zero point energies apparently diverge but can be
cancelled by the quark self-energy contributions. Important applications of
this work are quark matter with hadronic correlations which may be realized at
the core of neutron stars.
|
hep-ph astro-ph.HE hep-th nucl-th
|
we analyze the zero point energy in a dense matter of quarks or hadrons with particular attention on the renormalization of the uv divergences besides divergences removable by the vacuum subtraction and counter terms there are also uv divergences associated with nonperturbative modifications of quark bases appearing in the inmedium propagators the latter would remain after the selfenergies and vertices are renormalized unless a proper set of medium contributions is included at a given truncation we use the formalism of the two particle irreducible action to clarify how the uv divergences are assembled to cancel an example is given for the thermodynamic potentials with mesons as composite particles whose zero point energies apparently diverge but can be cancelled by the quark selfenergy contributions important applications of this work are quark matter with hadronic correlations which may be realized at the core of neutron stars
|
[['we', 'analyze', 'the', 'zero', 'point', 'energy', 'in', 'a', 'dense', 'matter', 'of', 'quarks', 'or', 'hadrons', 'with', 'particular', 'attention', 'on', 'the', 'renormalization', 'of', 'the', 'uv', 'divergences', 'besides', 'divergences', 'removable', 'by', 'the', 'vacuum', 'subtraction', 'and', 'counter', 'terms', 'there', 'are', 'also', 'uv', 'divergences', 'associated', 'with', 'nonperturbative', 'modifications', 'of', 'quark', 'bases', 'appearing', 'in', 'the', 'inmedium', 'propagators', 'the', 'latter', 'would', 'remain', 'after', 'the', 'selfenergies', 'and', 'vertices', 'are', 'renormalized', 'unless', 'a', 'proper', 'set', 'of', 'medium', 'contributions', 'is', 'included', 'at', 'a', 'given', 'truncation', 'we', 'use', 'the', 'formalism', 'of', 'the', 'two', 'particle', 'irreducible', 'action', 'to', 'clarify', 'how', 'the', 'uv', 'divergences', 'are', 'assembled', 'to', 'cancel', 'an', 'example', 'is', 'given', 'for', 'the', 'thermodynamic', 'potentials', 'with', 'mesons', 'as', 'composite', 'particles', 'whose', 'zero', 'point', 'energies', 'apparently', 'diverge', 'but', 'can', 'be', 'cancelled', 'by', 'the', 'quark', 'selfenergy', 'contributions', 'important', 'applications', 'of', 'this', 'work', 'are', 'quark', 'matter', 'with', 'hadronic', 'correlations', 'which', 'may', 'be', 'realized', 'at', 'the', 'core', 'of', 'neutron', 'stars']]
|
[-0.08895989725230417, 0.2608085417993304, -0.14102287965296353, 0.12406195383664453, -0.05804726896005579, -0.10511361546620417, 0.039638459510266934, 0.3650941924424842, -0.18930343785581905, -0.23194090625555772, 0.02297333919139217, -0.35646618742288816, -0.060493228098494, 0.0714900933679827, -0.023804576537157927, 0.026462184973449137, 0.04865340352342981, 0.041199219167335994, -0.0954818136686097, -0.2418239084921273, 0.3906647405981655, 0.010317244806275185, 0.15086332062653834, 0.1406208915642411, 0.06637576516691802, -0.008699000251201343, -0.06445362052828488, 0.009712390006623335, -0.06978142453590408, 0.03931538703343702, 0.2494228928735538, 0.025375827264118318, 0.19549064011678435, -0.4010020940849144, -0.18503348089062557, 0.13111892676614742, 0.15976056370871244, 0.10104712542751157, -0.03173986858989034, -0.22847749523579194, 0.04813292660219304, -0.17862225871714246, -0.1838937106949743, -0.11983790876305041, -0.027054918971973367, -0.032870917738667536, -0.2508832232957098, 0.05487583026822702, -0.01683361615222465, -0.0010754181263716116, -0.012840655074493649, -0.15966391343196543, -0.04397376265034028, 0.09295773832289139, 0.11443164256828216, 0.07196436319726571, 0.17562016071234313, -0.20705285220982558, -0.09483976779867792, 0.4173025564006012, -0.04638673071167432, -0.18512329594038116, 0.1636851636673479, -0.1446862101535468, -0.1169685142295849, 0.16184953581412426, 0.10594324838893954, 0.1018533520113528, -0.21874644451438346, 0.13678346345922263, 0.009026743743258217, 0.10588195292115819, 0.12702361117408145, 0.11288827809039503, 0.25075071934972787, 0.06893455775085992, -0.01756645082948833, 0.11089734214894836, -0.026963593410780758, -0.08877862258840549, -0.42988630358013324, -0.07783001004506535, -0.14366521152745312, 0.04873622366641131, -0.09593056848239535, -0.1920090947015625, 0.3762372315621987, 0.09794306492565535, 0.19593958820850174, -0.003343211389114408, 0.2932092732031985, 0.14384450951840538, 0.11824224226196141, 0.10208990001087336, 0.28529079313860467, 0.14463515530223958, 0.06579308196604769, -0.27310057328173165, -0.026909929011405136, 0.10248947579627081]
|
1,803.08797
|
Nonlinear Deconvolution by Sampling Biophysically Plausible Hemodynamic
Models
|
Non-invasive methods to measure brain activity are important to understand
cognitive processes in the human brain. A prominent example is functional
magnetic resonance imaging (fMRI), which is a noisy measurement of a delayed
signal that depends non-linearly on the neuronal activity through the
neurovascular coupling. These characteristics make the inference of neuronal
activity from fMRI a difficult but important step in fMRI studies that require
information at the neuronal level. In this article, we address this inference
problem using a Bayesian approach where we model the latent neural activity as
a stochastic process and assume that the observed BOLD signal results from a
realistic physiological (Balloon) model. We apply a recently developed
smoothing method called APIS to efficiently sample the posterior given single
event fMRI time series. To infer neuronal signals with high likelihood for
multiple time series efficiently, a modification of the original algorithm is
introduced. We demonstrate that our adaptive procedure is able to compensate
the lacking of inputs in the model to infer the neuronal activity and that it
outperforms dramatically the standard bootstrap particle filter-smoother in
this setting. This makes the proposed procedure especially attractive to
deconvolve resting state fMRI data. To validate the method, we evaluate the
quality of the signals inferred using the timing information contained in them.
APIS obtains reliable event timing estimates based on fMRI data gathered during
a reaction time experiment with short stimuli. Hence, we show for the first
time that one can obtain accurate absolute timing of neuronal activity by
reconstructing the latent neural signal.
|
q-bio.NC physics.data-an
|
noninvasive methods to measure brain activity are important to understand cognitive processes in the human brain a prominent example is functional magnetic resonance imaging fmri which is a noisy measurement of a delayed signal that depends nonlinearly on the neuronal activity through the neurovascular coupling these characteristics make the inference of neuronal activity from fmri a difficult but important step in fmri studies that require information at the neuronal level in this article we address this inference problem using a bayesian approach where we model the latent neural activity as a stochastic process and assume that the observed bold signal results from a realistic physiological balloon model we apply a recently developed smoothing method called apis to efficiently sample the posterior given single event fmri time series to infer neuronal signals with high likelihood for multiple time series efficiently a modification of the original algorithm is introduced we demonstrate that our adaptive procedure is able to compensate the lacking of inputs in the model to infer the neuronal activity and that it outperforms dramatically the standard bootstrap particle filtersmoother in this setting this makes the proposed procedure especially attractive to deconvolve resting state fmri data to validate the method we evaluate the quality of the signals inferred using the timing information contained in them apis obtains reliable event timing estimates based on fmri data gathered during a reaction time experiment with short stimuli hence we show for the first time that one can obtain accurate absolute timing of neuronal activity by reconstructing the latent neural signal
|
[['noninvasive', 'methods', 'to', 'measure', 'brain', 'activity', 'are', 'important', 'to', 'understand', 'cognitive', 'processes', 'in', 'the', 'human', 'brain', 'a', 'prominent', 'example', 'is', 'functional', 'magnetic', 'resonance', 'imaging', 'fmri', 'which', 'is', 'a', 'noisy', 'measurement', 'of', 'a', 'delayed', 'signal', 'that', 'depends', 'nonlinearly', 'on', 'the', 'neuronal', 'activity', 'through', 'the', 'neurovascular', 'coupling', 'these', 'characteristics', 'make', 'the', 'inference', 'of', 'neuronal', 'activity', 'from', 'fmri', 'a', 'difficult', 'but', 'important', 'step', 'in', 'fmri', 'studies', 'that', 'require', 'information', 'at', 'the', 'neuronal', 'level', 'in', 'this', 'article', 'we', 'address', 'this', 'inference', 'problem', 'using', 'a', 'bayesian', 'approach', 'where', 'we', 'model', 'the', 'latent', 'neural', 'activity', 'as', 'a', 'stochastic', 'process', 'and', 'assume', 'that', 'the', 'observed', 'bold', 'signal', 'results', 'from', 'a', 'realistic', 'physiological', 'balloon', 'model', 'we', 'apply', 'a', 'recently', 'developed', 'smoothing', 'method', 'called', 'apis', 'to', 'efficiently', 'sample', 'the', 'posterior', 'given', 'single', 'event', 'fmri', 'time', 'series', 'to', 'infer', 'neuronal', 'signals', 'with', 'high', 'likelihood', 'for', 'multiple', 'time', 'series', 'efficiently', 'a', 'modification', 'of', 'the', 'original', 'algorithm', 'is', 'introduced', 'we', 'demonstrate', 'that', 'our', 'adaptive', 'procedure', 'is', 'able', 'to', 'compensate', 'the', 'lacking', 'of', 'inputs', 'in', 'the', 'model', 'to', 'infer', 'the', 'neuronal', 'activity', 'and', 'that', 'it', 'outperforms', 'dramatically', 'the', 'standard', 'bootstrap', 'particle', 'filtersmoother', 'in', 'this', 'setting', 'this', 'makes', 'the', 'proposed', 'procedure', 'especially', 'attractive', 'to', 'deconvolve', 'resting', 'state', 'fmri', 'data', 'to', 'validate', 'the', 'method', 'we', 'evaluate', 'the', 'quality', 'of', 'the', 'signals', 'inferred', 'using', 'the', 'timing', 'information', 'contained', 'in', 'them', 'apis', 'obtains', 'reliable', 'event', 'timing', 'estimates', 'based', 'on', 'fmri', 'data', 'gathered', 'during', 'a', 'reaction', 'time', 'experiment', 'with', 'short', 'stimuli', 'hence', 'we', 'show', 'for', 'the', 'first', 'time', 'that', 'one', 'can', 'obtain', 'accurate', 'absolute', 'timing', 'of', 'neuronal', 'activity', 'by', 'reconstructing', 'the', 'latent', 'neural', 'signal']]
|
[-0.04935304407354124, 0.054596679244241386, -0.08813883486448049, 0.11674980493743448, -0.11402383291988372, -0.15155194618637324, 0.0458821544661987, 0.4122161818741006, -0.2613971575519827, -0.3156721715913591, 0.09515594428103213, -0.2423236493918921, -0.24699143227826426, 0.18861102104847305, -0.07537991296339897, 0.07931828730579582, 0.12247248799531008, 0.08773132058922783, -0.0010896804469666677, -0.20848244416629313, 0.2358378837016062, 0.08256764159705199, 0.3125264398785248, -0.025150352419586852, 0.1495464052868556, -0.0022966088763496373, -0.05712852871215546, -0.03540590028387669, -0.08169345571326403, 0.14373900112468618, 0.31776323463054723, 0.20688603821417928, 0.32478532073582755, -0.4845230081662919, -0.26641301033942, 0.09845657156307652, 0.11562603699519514, 0.11392023079156388, -0.03197695193466643, -0.32513651738190674, 0.07982605815959687, -0.11789736685022945, -0.021064158016201873, -0.10573396197287366, -0.01655126166951959, -0.019509570132868248, -0.32448405010291026, 0.11487473830675299, 0.013306536067830166, 0.07689498340550927, -0.07573062714527623, -0.03166598764073569, 0.018033634606581472, 0.16142584444605745, 0.05396370921914695, 0.055420947501943374, 0.18931259898090502, -0.10205838149860824, -0.1260206427805315, 0.27073690330507816, -0.04329807577596512, -0.178323203547734, 0.1865381794041241, -0.13662547006970271, -0.18727778864922584, 0.13106018144480913, 0.20696450090690632, 0.08684282436479407, -0.2080741965528432, 0.004976144234660751, 0.01583917086782094, 0.23858911684237682, 0.0038253007751336554, -0.02894796042528469, 0.1420372648481134, 0.23679381673969147, 0.017631948374400963, 0.13257044275542285, -0.17742884095707723, -0.04490573004295584, -0.22763222165644947, -0.0846352454595376, -0.1947780176633387, 0.009539841104526658, -0.0897824632264701, -0.15019620399107225, 0.4508333201829373, 0.2284116765994213, 0.205953033033893, 0.0757633936223101, 0.3367115984628981, 0.08121277166901564, 0.07360696034561443, 0.031829239436774515, 0.1837571718124309, 0.09850770348293736, 0.13233046789537184, -0.2331177779342397, 0.1457162553215312, -0.002315108577022329]
|
1,803.08798
|
Performance Analysis of C-V2I-based Automotive Collision Avoidance
|
One of the key applications envisioned for C-V2I (Cellular
Vehicle-to-Infrastructure) networks pertains to safety on the road. Thanks to
the exchange of Cooperative Awareness Messages (CAMs), vehicles and other road
users (e.g., pedestrians) can advertise their position, heading and speed and
sophisticated algorithms can detect potentially dangerous situations leading to
a crash. In this paper, we focus on the safety application for automotive
collision avoidance at intersections, and study the effectiveness of its
deployment in a C-V2I-based infrastructure. In our study, we also account for
the location of the server running the application as a factor in the system
design. Our simulation-based results, derived in real-world scenarios, provide
indication on the reliability of algorithms for car-to-car and
car-to-pedestrian collision avoidance, both when a human driver is considered
and when automated vehicles (with faster reaction times) populate the streets.
|
cs.NI
|
one of the key applications envisioned for cv2i cellular vehicletoinfrastructure networks pertains to safety on the road thanks to the exchange of cooperative awareness messages cams vehicles and other road users eg pedestrians can advertise their position heading and speed and sophisticated algorithms can detect potentially dangerous situations leading to a crash in this paper we focus on the safety application for automotive collision avoidance at intersections and study the effectiveness of its deployment in a cv2ibased infrastructure in our study we also account for the location of the server running the application as a factor in the system design our simulationbased results derived in realworld scenarios provide indication on the reliability of algorithms for cartocar and cartopedestrian collision avoidance both when a human driver is considered and when automated vehicles with faster reaction times populate the streets
|
[['one', 'of', 'the', 'key', 'applications', 'envisioned', 'for', 'cv2i', 'cellular', 'vehicletoinfrastructure', 'networks', 'pertains', 'to', 'safety', 'on', 'the', 'road', 'thanks', 'to', 'the', 'exchange', 'of', 'cooperative', 'awareness', 'messages', 'cams', 'vehicles', 'and', 'other', 'road', 'users', 'eg', 'pedestrians', 'can', 'advertise', 'their', 'position', 'heading', 'and', 'speed', 'and', 'sophisticated', 'algorithms', 'can', 'detect', 'potentially', 'dangerous', 'situations', 'leading', 'to', 'a', 'crash', 'in', 'this', 'paper', 'we', 'focus', 'on', 'the', 'safety', 'application', 'for', 'automotive', 'collision', 'avoidance', 'at', 'intersections', 'and', 'study', 'the', 'effectiveness', 'of', 'its', 'deployment', 'in', 'a', 'cv2ibased', 'infrastructure', 'in', 'our', 'study', 'we', 'also', 'account', 'for', 'the', 'location', 'of', 'the', 'server', 'running', 'the', 'application', 'as', 'a', 'factor', 'in', 'the', 'system', 'design', 'our', 'simulationbased', 'results', 'derived', 'in', 'realworld', 'scenarios', 'provide', 'indication', 'on', 'the', 'reliability', 'of', 'algorithms', 'for', 'cartocar', 'and', 'cartopedestrian', 'collision', 'avoidance', 'both', 'when', 'a', 'human', 'driver', 'is', 'considered', 'and', 'when', 'automated', 'vehicles', 'with', 'faster', 'reaction', 'times', 'populate', 'the', 'streets']]
|
[-0.16339795570324728, 0.01183107124676031, -0.036237113284059215, 0.05108916844344801, -0.04937279261648655, -0.1461665195033506, 0.09549502929827819, 0.3616009415368791, -0.1973516899303326, -0.3181019264790747, 0.14385941795987525, -0.26510923997050634, -0.14334919369883006, 0.21707396788902028, -0.14274617526335298, 0.060447691897947894, 0.09407168911183598, 0.06718087662722812, 0.04225188581988698, -0.24663583005743997, 0.2683633783556245, 0.05332104047001512, 0.301372552368169, 0.12540368134224855, 0.04643474706552095, 0.04149614617883883, -0.03377128441438631, -0.031062889725176825, -0.08312835830988155, 0.12140316201408428, 0.32299693195080315, 0.19040258067349594, 0.29879920824810313, -0.47036266675977795, -0.21245848337809245, 0.1009243131166807, 0.16059252808627206, 0.06861721718235424, -0.020992846015185394, -0.36735061446497974, 0.1033971082729598, -0.22144739549193118, -0.15105954356905488, -0.030918081925699004, 0.009989733555940567, 0.0681637464988011, -0.2738055803157665, -0.04734166326988661, -0.00044435900118615894, 0.08866374818608165, -0.015349427966780408, -0.05311311565218838, 0.007815453737836193, 0.22007763599502614, 0.07291658038307947, -0.03324978768855713, 0.18742964047835106, -0.17360442927089967, -0.170185329977216, 0.44358344410925554, 0.02319402945296908, -0.1620988865348476, 0.23163799682321648, -0.030062421711368692, -0.1504909330047667, 0.08516570008532316, 0.2956217315927562, 0.08222862156927241, -0.14691014415174894, -0.006025801787877249, 0.029743146697162753, 0.1012373299544884, 0.07080886483847819, 0.0042869403337438905, 0.15032982907033768, 0.23624770441308135, 0.17089843411791933, 0.07640878443166407, -0.0927254336937848, -0.12477814731774507, -0.2597560213809764, -0.15002543961939713, -0.11539504103776481, -0.00956943747415035, -0.09815176783961727, -0.08602695533039945, 0.36933023999962544, 0.21863926278634205, 0.1502618749384527, 0.06749974913481209, 0.3971611959238847, 0.04836245891983034, 0.06837507176764861, 0.1135569543560484, 0.19213314798350137, -0.0071188798277742335, 0.18849991642249128, -0.22106494407031546, 0.1361564709563498, 0.012249898374149646]
|
1,803.08799
|
Graphite, graphene and the flat band superconductivity
|
Superconductivity with transition temperature $T_c=1.7$ K has been reported
in bilayer graphene [1,2]. The main factors, which may shed light on the
mechanism of the formation of this superconductivity, are the following.
Superconductivity is observed in bilayer graphene, when the two layers are
twisted, and the maximum of $T_c$ takes place at the "magic angle" of twist, at
which the electronic band structure becomes nearly flat. The same factors have
been suggested [3] to explain the experiments in graphite [4-8], which reported
high-T superconductivity in highly oriented pyrolytic graphite (HOPG). The
hints of room-T superconductivity are present, only when the sample contains
quasi two-dimensional interfaces between the domains of HOPG. These domains
should be twisted with respect to each other in order to form the flat band in
electronic spectrum. This dispersionless energy spectrum has a singular density
of states, which provides the transition temperature being proportional to the
coupling constant instead of the exponential suppression. The graphite and its
superconductivity is now becoming the mainstream. One may say that we are
coming to graphite era of superconductivity. It is time to combine the
theoretical and experimental efforts to reach the bulk room-T superconductivity
in graphite and in similar real or artificial materials.
|
cond-mat.supr-con
|
superconductivity with transition temperature t_c17 k has been reported in bilayer graphene 12 the main factors which may shed light on the mechanism of the formation of this superconductivity are the following superconductivity is observed in bilayer graphene when the two layers are twisted and the maximum of t_c takes place at the magic angle of twist at which the electronic band structure becomes nearly flat the same factors have been suggested 3 to explain the experiments in graphite 48 which reported hight superconductivity in highly oriented pyrolytic graphite hopg the hints of roomt superconductivity are present only when the sample contains quasi twodimensional interfaces between the domains of hopg these domains should be twisted with respect to each other in order to form the flat band in electronic spectrum this dispersionless energy spectrum has a singular density of states which provides the transition temperature being proportional to the coupling constant instead of the exponential suppression the graphite and its superconductivity is now becoming the mainstream one may say that we are coming to graphite era of superconductivity it is time to combine the theoretical and experimental efforts to reach the bulk roomt superconductivity in graphite and in similar real or artificial materials
|
[['superconductivity', 'with', 'transition', 'temperature', 't_c17', 'k', 'has', 'been', 'reported', 'in', 'bilayer', 'graphene', '12', 'the', 'main', 'factors', 'which', 'may', 'shed', 'light', 'on', 'the', 'mechanism', 'of', 'the', 'formation', 'of', 'this', 'superconductivity', 'are', 'the', 'following', 'superconductivity', 'is', 'observed', 'in', 'bilayer', 'graphene', 'when', 'the', 'two', 'layers', 'are', 'twisted', 'and', 'the', 'maximum', 'of', 't_c', 'takes', 'place', 'at', 'the', 'magic', 'angle', 'of', 'twist', 'at', 'which', 'the', 'electronic', 'band', 'structure', 'becomes', 'nearly', 'flat', 'the', 'same', 'factors', 'have', 'been', 'suggested', '3', 'to', 'explain', 'the', 'experiments', 'in', 'graphite', '48', 'which', 'reported', 'hight', 'superconductivity', 'in', 'highly', 'oriented', 'pyrolytic', 'graphite', 'hopg', 'the', 'hints', 'of', 'roomt', 'superconductivity', 'are', 'present', 'only', 'when', 'the', 'sample', 'contains', 'quasi', 'twodimensional', 'interfaces', 'between', 'the', 'domains', 'of', 'hopg', 'these', 'domains', 'should', 'be', 'twisted', 'with', 'respect', 'to', 'each', 'other', 'in', 'order', 'to', 'form', 'the', 'flat', 'band', 'in', 'electronic', 'spectrum', 'this', 'dispersionless', 'energy', 'spectrum', 'has', 'a', 'singular', 'density', 'of', 'states', 'which', 'provides', 'the', 'transition', 'temperature', 'being', 'proportional', 'to', 'the', 'coupling', 'constant', 'instead', 'of', 'the', 'exponential', 'suppression', 'the', 'graphite', 'and', 'its', 'superconductivity', 'is', 'now', 'becoming', 'the', 'mainstream', 'one', 'may', 'say', 'that', 'we', 'are', 'coming', 'to', 'graphite', 'era', 'of', 'superconductivity', 'it', 'is', 'time', 'to', 'combine', 'the', 'theoretical', 'and', 'experimental', 'efforts', 'to', 'reach', 'the', 'bulk', 'roomt', 'superconductivity', 'in', 'graphite', 'and', 'in', 'similar', 'real', 'or', 'artificial', 'materials']]
|
[-0.1600069535923845, 0.19489187655116358, -0.05967927282205829, 0.011850994246859694, -0.06601864586372187, -0.1411201354475821, 0.05741348399637765, 0.41434839916977995, -0.2552186249395703, -0.28451526478364586, 0.04301909632671919, -0.33731070230945503, -0.10198449469886094, 0.15228215318592725, 0.00812567004135471, 0.02291943011592179, -0.020248858745689366, -0.009720773917927158, -0.09007274268407116, -0.2689727532232438, 0.3104241261175732, 0.0431888297818011, 0.3362807788906877, 0.1073438455097119, -0.006417342150436327, -0.0641767895483126, 0.08726510238957057, 0.011953920213560952, -0.12901984270112987, 0.08558710935925558, 0.2801547301449066, -0.07671104104599298, 0.19191656557792375, -0.44503293820352974, -0.221366960091959, 0.016257565701956685, 0.1020612674943946, 0.12400493920679287, -0.04869239228388, -0.24147839537167018, 0.08494043648173792, -0.08888484087039597, -0.11369594769312603, -0.0463351146940437, 0.013538339348177952, -0.05254062138685708, -0.1988829651857279, 0.0689622021515365, 0.0303417098683093, 0.05734615718443316, -0.09788235277801954, -0.155257285323621, -0.08643402715932837, 0.06153982170277718, 0.07497952685410175, 0.07470624501261362, 0.13490953772227363, -0.11871522258708396, -0.09517449646090886, 0.4015808039135069, -0.03171668526034175, -0.05225820280611515, 0.20846790173275415, -0.2067221833950849, -0.09698383340215551, 0.17012098269182083, 0.10599601746993231, 0.06270783293835523, -0.11768565821967959, 0.07864092275302045, -0.042435440966181716, 0.15402940816492636, 0.06608206850573384, 0.054191171680346574, 0.24447784338856465, 0.22208545355144704, 0.035899540782896894, 0.11119416425446058, -0.09774944270582925, -0.028820576775579317, -0.21528941371229174, -0.1986905829658234, -0.19040330024528326, 0.07676173701057082, -0.050689389364100015, -0.20671679181885896, 0.39917371549187136, 0.12074898893940308, 0.21754805665546198, -0.0587075456808607, 0.22209463401935017, 0.09634609268701608, 0.11700734692639533, 0.05715197320326, 0.2947638660282044, 0.1363214791780061, 0.11500749192753862, -0.19928242806990695, 0.0964157658757061, -0.010036602050370288]
|
1,803.088
|
Towards differential elimination of spinor field from spinor
electrodynamics
|
A system of PDEs for the electromagnetic field and one real component of the
spinor field is generally equivalent to spinor electrodynamics. There are
reasons to believe that the component can be differentially eliminated from the
system. A Lagrangian depending on the electromagnetic field and one real
component of the spinor field generally describes the same physics as spinor
electrodynamics.
|
physics.gen-ph
|
a system of pdes for the electromagnetic field and one real component of the spinor field is generally equivalent to spinor electrodynamics there are reasons to believe that the component can be differentially eliminated from the system a lagrangian depending on the electromagnetic field and one real component of the spinor field generally describes the same physics as spinor electrodynamics
|
[['a', 'system', 'of', 'pdes', 'for', 'the', 'electromagnetic', 'field', 'and', 'one', 'real', 'component', 'of', 'the', 'spinor', 'field', 'is', 'generally', 'equivalent', 'to', 'spinor', 'electrodynamics', 'there', 'are', 'reasons', 'to', 'believe', 'that', 'the', 'component', 'can', 'be', 'differentially', 'eliminated', 'from', 'the', 'system', 'a', 'lagrangian', 'depending', 'on', 'the', 'electromagnetic', 'field', 'and', 'one', 'real', 'component', 'of', 'the', 'spinor', 'field', 'generally', 'describes', 'the', 'same', 'physics', 'as', 'spinor', 'electrodynamics']]
|
[-0.17494597025215625, 0.14697884126023078, -0.08293571708103022, 0.06634577848987343, -0.12008907422423362, -0.12648652520341178, -0.1016402463739117, 0.30968556776642797, -0.2215282845310867, -0.27416800261319924, 0.05436827594724794, -0.23671402105440695, -0.14478667124640196, 0.22181834818426674, 0.02922371948758761, -0.009670353075489403, -0.008346518975061674, 0.11317132552309582, -0.032285253203008325, -0.25225937099506457, 0.42162430938333273, -0.042630347640564045, 0.26312449406832455, 0.012478550771872203, 0.13898349025597176, -0.014015169775423905, 0.04942360695761939, 0.03990904781967401, 0.04003007271809717, 0.07785162325017154, 0.21739825407663982, 0.1286912578313301, 0.2087705714084829, -0.4429961151443422, -0.21302615767344832, 0.0705026595077167, 0.1585773750441149, 0.11644852546354136, -0.0024017583210176477, -0.29476761088396114, 0.01809560627055665, -0.11064570192247629, -0.1627074248623103, -0.0800716421334073, 0.02101453015153917, -0.016277730744332076, -0.2550156941326956, 0.02592992257947723, 0.06409308320532242, 0.09159492760275802, -0.09359275086317212, -0.09953738015998775, 0.019640361331403254, 0.06140302225248888, 0.09286676340658838, 0.10026404920596785, 0.15848486515072485, -0.20059096206290025, -0.09347179923206568, 0.4335917224486669, -0.14477882167169204, -0.2786222189043959, 0.16411401458705466, -0.13093063665243487, -0.06429777216399088, 0.1321183954947628, 0.14045014347260196, 0.10202039600965994, -0.16055390036975345, 0.12926398475149956, -0.03826446154465278, 0.18119327655682962, 0.007510929158888758, -0.0033301097884153325, 0.27252627834677695, 0.06584430600826939, 0.0257451168106248, 0.09840120494482107, 0.0003848272608593106, -0.12809217725880445, -0.37049386240541937, -0.26201537520003815, -0.14385166050245365, 0.09073593998133826, -0.03747361797043899, -0.1927459659986198, 0.4306476909356813, 0.1574616524002825, 0.09167023740398388, -0.04953567199409008, 0.3098463788628578, 0.19051740725020258, 0.0838712066722413, 0.052519814025921124, 0.321870814387997, 0.20548156950001914, 0.09972431101681044, -0.20842121872507657, -0.07089637852429102, 0.024434331129305063]
|
1,803.08801
|
Unruh effect of nonlocal field theories with a minimal length
|
The nonlocal field theory commonly requires a minimal length, and so it
appears to formulate the nonlocal theory in terms of the doubly special
relativity which makes the speed of light and the minimal length invariant
simultaneously. We set up a generic nonlocal model having the same set of
solutions as the local theory but allowing Lorentz violations due to the
minimal length. It is exactly corresponding to the model with the modified
dispersion relation in the doubly special relativity. For this model, we
calculate the modified Wightman function and the rate of response function by
using the Unruh-DeWitt detector method. It turns out that the Unruh effect
should be corrected by the minimal length related to the nonlocality in the
regime of the doubly special relativity. However, for the Lorentz-invariant
limit, it is shown that the Wightman function and the Unruh effect remain the
same as those of the local theory.
|
physics.gen-ph hep-th
|
the nonlocal field theory commonly requires a minimal length and so it appears to formulate the nonlocal theory in terms of the doubly special relativity which makes the speed of light and the minimal length invariant simultaneously we set up a generic nonlocal model having the same set of solutions as the local theory but allowing lorentz violations due to the minimal length it is exactly corresponding to the model with the modified dispersion relation in the doubly special relativity for this model we calculate the modified wightman function and the rate of response function by using the unruhdewitt detector method it turns out that the unruh effect should be corrected by the minimal length related to the nonlocality in the regime of the doubly special relativity however for the lorentzinvariant limit it is shown that the wightman function and the unruh effect remain the same as those of the local theory
|
[['the', 'nonlocal', 'field', 'theory', 'commonly', 'requires', 'a', 'minimal', 'length', 'and', 'so', 'it', 'appears', 'to', 'formulate', 'the', 'nonlocal', 'theory', 'in', 'terms', 'of', 'the', 'doubly', 'special', 'relativity', 'which', 'makes', 'the', 'speed', 'of', 'light', 'and', 'the', 'minimal', 'length', 'invariant', 'simultaneously', 'we', 'set', 'up', 'a', 'generic', 'nonlocal', 'model', 'having', 'the', 'same', 'set', 'of', 'solutions', 'as', 'the', 'local', 'theory', 'but', 'allowing', 'lorentz', 'violations', 'due', 'to', 'the', 'minimal', 'length', 'it', 'is', 'exactly', 'corresponding', 'to', 'the', 'model', 'with', 'the', 'modified', 'dispersion', 'relation', 'in', 'the', 'doubly', 'special', 'relativity', 'for', 'this', 'model', 'we', 'calculate', 'the', 'modified', 'wightman', 'function', 'and', 'the', 'rate', 'of', 'response', 'function', 'by', 'using', 'the', 'unruhdewitt', 'detector', 'method', 'it', 'turns', 'out', 'that', 'the', 'unruh', 'effect', 'should', 'be', 'corrected', 'by', 'the', 'minimal', 'length', 'related', 'to', 'the', 'nonlocality', 'in', 'the', 'regime', 'of', 'the', 'doubly', 'special', 'relativity', 'however', 'for', 'the', 'lorentzinvariant', 'limit', 'it', 'is', 'shown', 'that', 'the', 'wightman', 'function', 'and', 'the', 'unruh', 'effect', 'remain', 'the', 'same', 'as', 'those', 'of', 'the', 'local', 'theory']]
|
[-0.09502717142535594, 0.13336747255724682, -0.09226743044258144, 0.125026891492828, -0.056705854989367685, -0.14855576305356072, -0.0015263566134595557, 0.27860960427757453, -0.28279406388020634, -0.28525922741544874, 0.04263373855332917, -0.27214659961694115, -0.15306874549653576, 0.16003553665206327, -0.031142589311409546, 0.09768080764057997, -0.014754691259249261, 0.09352897580615, -0.08443990205475864, -0.23217992525927625, 0.31252452310199214, 0.10826838492587405, 0.2952478990804306, 0.05128891753204363, 0.11955186426884641, 0.050595213242463376, -0.005713464641686235, 0.07469809645676594, -0.10859604762289994, 0.06393380944102414, 0.18045379723710203, 0.09823627645872827, 0.25037714857362997, -0.40583715587854385, -0.21528865039152534, 0.10848334701547988, 0.07651505249822022, 0.16484329911595283, 0.03284563507431334, -0.2666409452710803, 0.06574730899822163, -0.16221928057309828, -0.18169736445538306, -0.027563252124501128, 0.027568454536345887, -0.04371519156771492, -0.22694830152843343, 0.08703866105918821, 0.04533199694828669, -0.021766690849816722, -0.01960732695787508, -0.04041442221511572, -0.011069352635929949, 0.08320945353970226, 0.10487717757764346, 0.038541286874341926, 0.09972304279768937, -0.12774907690809892, -0.0584996886441092, 0.41540663777605485, -0.09704830687444069, -0.2667376332576264, 0.1446355639736315, -0.17622805468272418, -0.07137187913299146, 0.08895419190843026, 0.09613239431239076, 0.15455499307197323, -0.17327854104530016, 0.1332073635620825, -0.06527289828457135, 0.14324009094975496, 0.06980604079159859, 0.08204777041866787, 0.20983409893846042, 0.08896227197501023, 0.04859550481686663, 0.14275415517055845, -0.04905083199264482, -0.12138361578170014, -0.4000638890031137, -0.14539985087130367, -0.14281038644931918, 0.05712825104006027, -0.09848302615596606, -0.17660172616103265, 0.39193164839066175, 0.12915422057267278, 0.14888877066703954, 0.07914871777986839, 0.25161637779092416, 0.17343288686108854, 0.11830664021085556, 0.050232006025525106, 0.29013609894747405, 0.14480769268304453, 0.052879351133780894, -0.2779492389894777, 0.037012151014335505, 0.09586232806874537]
|
1,803.08802
|
Topological track reconstruction in unsegmented, large-volume liquid
scintillator detectors
|
Unsegmented, large-volume liquid scintillator (LS) neutrino detectors have
proven to be a key technology for low-energy neutrino physics. The efficient
rejection of radionuclide background induced by cosmic muon interactions is of
paramount importance for their success in high-precision MeV neutrino
measurements. We present a novel technique to reconstruct GeV particle tracks
in LS, whose main property, the resolution of topological features and changes
in the differential energy loss $\mathrm{d}E/\mathrm{d}x$, allows for improved
rejection strategies. Different to common track reconstruction approaches, our
method does not rely on concrete track / topology hypotheses. Instead, based on
a reference point in space and time, the observed distribution of photon
arrival times at the photosensors and the detector's characteristics in terms
of photon production, propagation and detection (optical model), it
reconstructs the voxelized distribution of optical photon emissions. Techniques
from three-dimensional data analysis can then be applied to extract parameters
describing the topology, e.g., the direction of a track. We performed a first
performance evaluation of our method using single muon events with up to
$10\,\mathrm{GeV}$ from a Geant4 simulation of the LENA detector. The current
results indicate that our approach is competitive with existing reconstruction
methods -- although its full potential has not yet been exploited. We also
remark on other detector technologies in astroparticle physics as well as
applications in medical imaging that could benefit from the fundamental ideas
of our method.
|
physics.ins-det
|
unsegmented largevolume liquid scintillator ls neutrino detectors have proven to be a key technology for lowenergy neutrino physics the efficient rejection of radionuclide background induced by cosmic muon interactions is of paramount importance for their success in highprecision mev neutrino measurements we present a novel technique to reconstruct gev particle tracks in ls whose main property the resolution of topological features and changes in the differential energy loss mathrmdemathrmdx allows for improved rejection strategies different to common track reconstruction approaches our method does not rely on concrete track topology hypotheses instead based on a reference point in space and time the observed distribution of photon arrival times at the photosensors and the detectors characteristics in terms of photon production propagation and detection optical model it reconstructs the voxelized distribution of optical photon emissions techniques from threedimensional data analysis can then be applied to extract parameters describing the topology eg the direction of a track we performed a first performance evaluation of our method using single muon events with up to 10mathrmgev from a geant4 simulation of the lena detector the current results indicate that our approach is competitive with existing reconstruction methods although its full potential has not yet been exploited we also remark on other detector technologies in astroparticle physics as well as applications in medical imaging that could benefit from the fundamental ideas of our method
|
[['unsegmented', 'largevolume', 'liquid', 'scintillator', 'ls', 'neutrino', 'detectors', 'have', 'proven', 'to', 'be', 'a', 'key', 'technology', 'for', 'lowenergy', 'neutrino', 'physics', 'the', 'efficient', 'rejection', 'of', 'radionuclide', 'background', 'induced', 'by', 'cosmic', 'muon', 'interactions', 'is', 'of', 'paramount', 'importance', 'for', 'their', 'success', 'in', 'highprecision', 'mev', 'neutrino', 'measurements', 'we', 'present', 'a', 'novel', 'technique', 'to', 'reconstruct', 'gev', 'particle', 'tracks', 'in', 'ls', 'whose', 'main', 'property', 'the', 'resolution', 'of', 'topological', 'features', 'and', 'changes', 'in', 'the', 'differential', 'energy', 'loss', 'mathrmdemathrmdx', 'allows', 'for', 'improved', 'rejection', 'strategies', 'different', 'to', 'common', 'track', 'reconstruction', 'approaches', 'our', 'method', 'does', 'not', 'rely', 'on', 'concrete', 'track', 'topology', 'hypotheses', 'instead', 'based', 'on', 'a', 'reference', 'point', 'in', 'space', 'and', 'time', 'the', 'observed', 'distribution', 'of', 'photon', 'arrival', 'times', 'at', 'the', 'photosensors', 'and', 'the', 'detectors', 'characteristics', 'in', 'terms', 'of', 'photon', 'production', 'propagation', 'and', 'detection', 'optical', 'model', 'it', 'reconstructs', 'the', 'voxelized', 'distribution', 'of', 'optical', 'photon', 'emissions', 'techniques', 'from', 'threedimensional', 'data', 'analysis', 'can', 'then', 'be', 'applied', 'to', 'extract', 'parameters', 'describing', 'the', 'topology', 'eg', 'the', 'direction', 'of', 'a', 'track', 'we', 'performed', 'a', 'first', 'performance', 'evaluation', 'of', 'our', 'method', 'using', 'single', 'muon', 'events', 'with', 'up', 'to', '10mathrmgev', 'from', 'a', 'geant4', 'simulation', 'of', 'the', 'lena', 'detector', 'the', 'current', 'results', 'indicate', 'that', 'our', 'approach', 'is', 'competitive', 'with', 'existing', 'reconstruction', 'methods', 'although', 'its', 'full', 'potential', 'has', 'not', 'yet', 'been', 'exploited', 'we', 'also', 'remark', 'on', 'other', 'detector', 'technologies', 'in', 'astroparticle', 'physics', 'as', 'well', 'as', 'applications', 'in', 'medical', 'imaging', 'that', 'could', 'benefit', 'from', 'the', 'fundamental', 'ideas', 'of', 'our', 'method']]
|
[-0.015095137985860022, 0.10913548150936356, -0.10369901245885396, 0.08932068102593343, -0.05137270927056773, -0.1268597493727024, 0.01693808557146303, 0.39166029201062247, -0.23560677518845594, -0.36132385164284997, 0.07249981553069176, -0.311070667012181, -0.0861465185880661, 0.24954653242695665, -0.040798771947177244, 0.09267149754955466, 0.12049004177931713, 0.016395432007111674, -0.08574624733991129, -0.20044111400900358, 0.24098498917254826, 0.12841241474807327, 0.33488093544955705, 0.07182716752353034, 0.15339600151472732, 0.01864555707114823, -0.07740075426640822, -0.027977957767439568, -0.0929182591074506, 0.09683913234866609, 0.2716074062632891, 0.1590486362821678, 0.17338423880509438, -0.41730204753709577, -0.23031757838727362, 0.092994262862011, 0.13176178955595344, 0.07741252107512767, -0.1020482846456415, -0.3063636195672824, 0.081390405965936, -0.17034390338993244, -0.11228932464748737, -0.07392809232717495, -0.05740901229148978, 0.033242774425580296, -0.24520881907948483, 0.03359072681697213, -0.000738609543552342, 0.009179534132368822, -0.03261266257644804, -0.1176041984473215, 0.04028427065659183, 0.12182209817321757, 0.05114337468089173, 0.0361794387958779, 0.1589466836190148, -0.15227141836039987, -0.1663982351130262, 0.36231825656084493, -0.06995916215134208, -0.18472788741696725, 0.18378613444057548, -0.1271328299868578, -0.1280974632477289, 0.18368200877314614, 0.2094965288065275, 0.11316766452190541, -0.1751615246495158, 0.05226643438001814, 0.022656041803250534, 0.18962082353307746, 0.019801274040895225, 0.0413567726912422, 0.21726893856647564, 0.2438639218113344, 0.06367533129281405, 0.05452152412406383, -0.18728794725570597, -0.023608518929727606, -0.2901550445353316, -0.1421236188420861, -0.17718380036252857, 0.032953067295963104, -0.03184838076632066, -0.13727398064045185, 0.42709415484079677, 0.18966394330094677, 0.1502572940652201, -0.03325969494149847, 0.3583494245725791, 0.0384847995710757, 0.08135021401314782, 0.006736309722939556, 0.2683703352205777, 0.093088495166997, 0.12987155611142598, -0.20252621434853038, 0.07181090218286994, 0.05418591690043696]
|
1,803.08803
|
Fast swaption pricing in Gaussian term structure models
|
We propose a fast and accurate numerical method for pricing European
swaptions in multi-factor Gaussian term structure models. Our method can be
used to accelerate the calibration of such models to the volatility surface.
The pricing of an interest rate option in such a model involves evaluating a
multi-dimensional integral of the payoff of the claim on a domain where the
payoff is positive. In our method, we approximate the exercise boundary of the
state space by a hyperplane tangent to the maximum probability point on the
boundary and simplify the multi-dimensional integration into an analytical
form. The maximum probability point can be determined using the gradient
descent method. We demonstrate that our method is superior to previous methods
by comparing the results to the price obtained by numerical integration.
|
q-fin.MF q-fin.CP q-fin.PR
|
we propose a fast and accurate numerical method for pricing european swaptions in multifactor gaussian term structure models our method can be used to accelerate the calibration of such models to the volatility surface the pricing of an interest rate option in such a model involves evaluating a multidimensional integral of the payoff of the claim on a domain where the payoff is positive in our method we approximate the exercise boundary of the state space by a hyperplane tangent to the maximum probability point on the boundary and simplify the multidimensional integration into an analytical form the maximum probability point can be determined using the gradient descent method we demonstrate that our method is superior to previous methods by comparing the results to the price obtained by numerical integration
|
[['we', 'propose', 'a', 'fast', 'and', 'accurate', 'numerical', 'method', 'for', 'pricing', 'european', 'swaptions', 'in', 'multifactor', 'gaussian', 'term', 'structure', 'models', 'our', 'method', 'can', 'be', 'used', 'to', 'accelerate', 'the', 'calibration', 'of', 'such', 'models', 'to', 'the', 'volatility', 'surface', 'the', 'pricing', 'of', 'an', 'interest', 'rate', 'option', 'in', 'such', 'a', 'model', 'involves', 'evaluating', 'a', 'multidimensional', 'integral', 'of', 'the', 'payoff', 'of', 'the', 'claim', 'on', 'a', 'domain', 'where', 'the', 'payoff', 'is', 'positive', 'in', 'our', 'method', 'we', 'approximate', 'the', 'exercise', 'boundary', 'of', 'the', 'state', 'space', 'by', 'a', 'hyperplane', 'tangent', 'to', 'the', 'maximum', 'probability', 'point', 'on', 'the', 'boundary', 'and', 'simplify', 'the', 'multidimensional', 'integration', 'into', 'an', 'analytical', 'form', 'the', 'maximum', 'probability', 'point', 'can', 'be', 'determined', 'using', 'the', 'gradient', 'descent', 'method', 'we', 'demonstrate', 'that', 'our', 'method', 'is', 'superior', 'to', 'previous', 'methods', 'by', 'comparing', 'the', 'results', 'to', 'the', 'price', 'obtained', 'by', 'numerical', 'integration']]
|
[-0.057180590440447515, -0.02415323447449527, -0.12409105603224956, 0.07293080274158946, -0.08571890343267184, -0.09311678952250917, 0.10365674398087252, 0.4242933225746338, -0.28893010214400977, -0.2393259797804953, 0.14504464940400794, -0.23119889329581594, -0.15645434223115445, 0.24643812785462405, -0.0934640344697982, 0.07778454509993585, 0.06176918469763432, 0.011698972211720851, -0.04672991322317662, -0.2656870195767484, 0.29608959635146537, 0.07050014846026897, 0.2850918392650783, 0.033200063420316346, 0.1313581250858708, -0.01953688051659041, -0.0356463861794999, 0.022849911476189914, -0.11700144121272248, 0.17803558393811378, 0.23018105985096415, 0.12881090632783107, 0.3192658556356596, -0.422048060510021, -0.21840863679893888, 0.0823845423077448, 0.0907010639569937, 0.09697012865127852, -0.03761692466841151, -0.29277644988435964, 0.05062105374124188, -0.19974518470609418, -0.13918874765961217, -0.1022872215638367, -0.04974174632046085, 0.047893192576101196, -0.3489327800446727, 0.04490549378097057, 0.00970028464933141, -0.010047195722626594, -0.062426398490340665, -0.13323785109230532, -0.006771104000150584, 0.10194376897281753, 0.0638196117629727, 0.026035095639347743, 0.09185077296928144, -0.10969350318281124, -0.14235495114699007, 0.3424026590270492, -0.11487351125822617, -0.26638006281147963, 0.12298066671579504, -0.1144397312309593, -0.06909116020855996, 0.15355782414285035, 0.1821400348526927, 0.15792733129973596, -0.13920863786255583, 0.07733818619744852, -0.029438470506395857, 0.13429338756921844, 0.017184701253874946, -0.09032572069062063, 0.1643172074180956, 0.17760772548902493, 0.1133148149229013, 0.12815374908252405, -0.10830459911734439, -0.15605467761007066, -0.30888511343644215, -0.19188660847531328, -0.20930867286828847, 0.016253021825104953, -0.14853362893985692, -0.15080699333204672, 0.38234127389732747, 0.17637152683276397, 0.16757368120149924, 0.07880962115640823, 0.3140890383663086, 0.1855687583429524, 0.012341468125725022, 0.08209321988889805, 0.17179051681350058, 0.047660641241460466, 0.07450973772658752, -0.21992994622112466, 0.12279559176486846, 0.12413643784104632]
|
1,803.08804
|
On finite GK-dimensional Nichols algebras of diagonal type
|
It was conjectured in \texttt{\small arXiv:1606.02521} that a Nichols algebra
of diagonal type with finite Gelfand-Kirillov dimension has finite
(generalized) root system. We prove the conjecture assuming that the rank is 2.
We also show that a Nichols algebra of affine Cartan type has infinite
Gelfand-Kirillov dimension.
|
math.QA math.RA
|
it was conjectured in textttsmall arxiv160602521 that a nichols algebra of diagonal type with finite gelfandkirillov dimension has finite generalized root system we prove the conjecture assuming that the rank is 2 we also show that a nichols algebra of affine cartan type has infinite gelfandkirillov dimension
|
[['it', 'was', 'conjectured', 'in', 'textttsmall', 'arxiv160602521', 'that', 'a', 'nichols', 'algebra', 'of', 'diagonal', 'type', 'with', 'finite', 'gelfandkirillov', 'dimension', 'has', 'finite', 'generalized', 'root', 'system', 'we', 'prove', 'the', 'conjecture', 'assuming', 'that', 'the', 'rank', 'is', '2', 'we', 'also', 'show', 'that', 'a', 'nichols', 'algebra', 'of', 'affine', 'cartan', 'type', 'has', 'infinite', 'gelfandkirillov', 'dimension']]
|
[-0.19154579163425497, 0.1076559027036031, -0.07342832369936837, 0.03909280980264561, -0.13971095189659133, -0.24982697955436176, -0.07574718056453598, 0.31002419706847933, -0.3423219174146652, -0.09022423637410006, 0.15675407679906736, -0.2280971051245514, -0.20703575751847691, 0.14890536312013863, -0.14852354638278484, -0.07156315176851219, 0.06542684175074101, 0.20496945169547365, -0.14090248450326423, -0.42462884647150834, 0.4288569077228506, -0.07671747403478044, 0.2598543259832594, 0.06815292749346959, 0.22011191715589828, -0.00380297827327417, 0.034127748178111185, 0.0077752284705638885, -0.1120562595391271, 0.03257582644000649, 0.32433039632936317, 0.07605997123755515, 0.22489692080352042, -0.2734810804327329, -0.12912960916033223, 0.26070063639846114, 0.22894203561461635, 0.06082535702735185, -0.027344530853184147, -0.18427187080184618, 0.1796296634607845, -0.31762881953683164, -0.2693326512765553, -0.021127491465045348, 0.18324309813324363, -0.10374423009343445, -0.23743689705928167, 0.06129812552115052, 0.13127678595483303, 0.17429015127321085, -0.10929024482352866, -0.1431008728195189, -0.05024856316546599, 0.012364890628183882, -0.10938968326792949, -0.02676553504748477, 0.004475435966418849, 0.01471049106783337, -0.2013860922306776, 0.2843408704424898, 0.022143301186669205, -0.23767587610830862, 0.1391175300710731, -0.2446166912921601, -0.19377631273948484, 0.0672045299058987, 0.017440167028043005, 0.012023040601181693, 0.016767807635996078, 0.2871209447582563, -0.22854841090738773, 0.08045566454529762, 0.0893448270443413, -0.053090068522012895, 0.019029540837638907, 0.08893128708004952, 0.06788030115680563, 0.15369637991405197, 0.038368690262238186, 0.03431122290591399, -0.3563209442421794, -0.2295349633735087, -0.16111626892040173, 0.21415926310647693, -0.17217279993411566, -0.17935867152280277, 0.3755406179361873, 0.10276287138048146, 0.08288138535701567, 0.1366679807400538, 0.14730995910035238, 0.12991517898109223, 0.19256995755972134, 0.13177800107126433, 0.12227441715076566, 0.31138653361962904, -0.044408632400963044, -0.14556396646011208, -0.04430993234531747, 0.3701980320736766]
|
1,803.08805
|
Geometric and Physical Constraints for Drone-Based Head Plane Crowd
Density Estimation
|
State-of-the-art methods for counting people in crowded scenes rely on deep
networks to estimate crowd density in the image plane. While useful for this
purpose, this image-plane density has no immediate physical meaning because it
is subject to perspective distortion. This is a concern in sequences acquired
by drones because the viewpoint changes often. This distortion is usually
handled implicitly by either learning scale-invariant features or estimating
density in patches of different sizes, neither of which accounts for the fact
that scale changes must be consistent over the whole scene.
In this paper, we explicitly model the scale changes and reason in terms of
people per square-meter. We show that feeding the perspective model to the
network allows us to enforce global scale consistency and that this model can
be obtained on the fly from the drone sensors. In addition, it also enables us
to enforce physically-inspired temporal consistency constraints that do not
have to be learned. This yields an algorithm that outperforms state-of-the-art
methods in inferring crowd density from a moving drone camera especially when
perspective effects are strong.
|
cs.CV
|
stateoftheart methods for counting people in crowded scenes rely on deep networks to estimate crowd density in the image plane while useful for this purpose this imageplane density has no immediate physical meaning because it is subject to perspective distortion this is a concern in sequences acquired by drones because the viewpoint changes often this distortion is usually handled implicitly by either learning scaleinvariant features or estimating density in patches of different sizes neither of which accounts for the fact that scale changes must be consistent over the whole scene in this paper we explicitly model the scale changes and reason in terms of people per squaremeter we show that feeding the perspective model to the network allows us to enforce global scale consistency and that this model can be obtained on the fly from the drone sensors in addition it also enables us to enforce physicallyinspired temporal consistency constraints that do not have to be learned this yields an algorithm that outperforms stateoftheart methods in inferring crowd density from a moving drone camera especially when perspective effects are strong
|
[['stateoftheart', 'methods', 'for', 'counting', 'people', 'in', 'crowded', 'scenes', 'rely', 'on', 'deep', 'networks', 'to', 'estimate', 'crowd', 'density', 'in', 'the', 'image', 'plane', 'while', 'useful', 'for', 'this', 'purpose', 'this', 'imageplane', 'density', 'has', 'no', 'immediate', 'physical', 'meaning', 'because', 'it', 'is', 'subject', 'to', 'perspective', 'distortion', 'this', 'is', 'a', 'concern', 'in', 'sequences', 'acquired', 'by', 'drones', 'because', 'the', 'viewpoint', 'changes', 'often', 'this', 'distortion', 'is', 'usually', 'handled', 'implicitly', 'by', 'either', 'learning', 'scaleinvariant', 'features', 'or', 'estimating', 'density', 'in', 'patches', 'of', 'different', 'sizes', 'neither', 'of', 'which', 'accounts', 'for', 'the', 'fact', 'that', 'scale', 'changes', 'must', 'be', 'consistent', 'over', 'the', 'whole', 'scene', 'in', 'this', 'paper', 'we', 'explicitly', 'model', 'the', 'scale', 'changes', 'and', 'reason', 'in', 'terms', 'of', 'people', 'per', 'squaremeter', 'we', 'show', 'that', 'feeding', 'the', 'perspective', 'model', 'to', 'the', 'network', 'allows', 'us', 'to', 'enforce', 'global', 'scale', 'consistency', 'and', 'that', 'this', 'model', 'can', 'be', 'obtained', 'on', 'the', 'fly', 'from', 'the', 'drone', 'sensors', 'in', 'addition', 'it', 'also', 'enables', 'us', 'to', 'enforce', 'physicallyinspired', 'temporal', 'consistency', 'constraints', 'that', 'do', 'not', 'have', 'to', 'be', 'learned', 'this', 'yields', 'an', 'algorithm', 'that', 'outperforms', 'stateoftheart', 'methods', 'in', 'inferring', 'crowd', 'density', 'from', 'a', 'moving', 'drone', 'camera', 'especially', 'when', 'perspective', 'effects', 'are', 'strong']]
|
[-0.06489992857938008, 0.05503773209894162, -0.10861158868500849, 0.08429162648334766, -0.12187974385568591, -0.12180276268276298, 0.01886102520745617, 0.411044102016441, -0.2675232073115237, -0.35211390304488427, 0.09328566880522077, -0.2413833552631504, -0.17726992724194093, 0.17364836608868758, -0.17201255638849552, 0.02599690053885147, 0.0891378357786654, 0.05079745569698221, -0.06069713101433538, -0.23174406323118873, 0.2936469994318885, 0.05836536786073491, 0.3173681114586955, 0.03764849103851941, 0.11457738876550891, 0.006999038946138456, -0.02761099093226851, 0.06056418616322062, -0.07149862607798113, 0.14547288014699658, 0.2862939440369523, 0.17010140990286898, 0.2881585897529217, -0.4563625580956379, -0.26376427669473534, 0.12248897819139855, 0.16261609541980665, 0.1185121593233354, -0.0038111561950941327, -0.3115225568642663, 0.1019655310356334, -0.15171942540949118, -0.06022107910202926, -0.09353216561650098, -0.01061349163383412, -0.0023789113161788848, -0.28654332906424, 0.05562050141086516, 0.04520446477768755, 0.05080187722894899, -0.06254995166221321, -0.04323266056371468, 0.01497536390634805, 0.2024625455838688, 0.08082099627201346, 0.03811270550450092, 0.15912196855711122, -0.17006230282118576, -0.05832062139908793, 0.391458776378848, -0.03235742209645706, -0.22525862193218948, 0.19186728984877136, -0.10283250965870001, -0.16625468381654535, 0.13666644134928144, 0.19612876264581341, 0.10888844711560361, -0.18166750163926323, 0.05393667811496631, -0.05346461378984861, 0.2001208951482133, 0.0658827438708603, 0.030150591670899708, 0.20836091457278202, 0.1646524526779774, 0.09529208514433583, 0.0790860003423643, -0.11362907395330024, -0.08848833515667799, -0.23255300060091488, -0.0751160914520603, -0.18687964091662776, -0.009102213013378706, -0.0794120588228978, -0.12147325388670967, 0.37392749642828405, 0.2669931949719828, 0.2082176372336026, 0.07396442595642976, 0.3439441510377316, 0.0700480548181056, 0.12318050371959036, 0.07751802779088973, 0.20569046262089766, 0.0012960591270229336, 0.12633845780120237, -0.16498991217680128, 0.12003247123783943, 0.03173659021534317]
|
1,803.08806
|
Edge Preserving Maps of the Curve Graphs in Low Genus
|
Let $R$ be a compact, connected, orientable surface of genus $g$ with $n$
boundary components. Let $\mathcal{C}(R)$ be the curve graph of $R$. We prove
that if $g=0, n \geq 5$ or $g=1, n \geq 3$, and $\lambda : \mathcal{C}(R)
\rightarrow\mathcal{C}(R)$ is an edge preserving map, then $\lambda$ is induced
by a homeomorphism of $R$, and this homeomorphism is unique up to isotopy.
|
math.GT
|
let r be a compact connected orientable surface of genus g with n boundary components let mathcalcr be the curve graph of r we prove that if g0 n geq 5 or g1 n geq 3 and lambda mathcalcr rightarrowmathcalcr is an edge preserving map then lambda is induced by a homeomorphism of r and this homeomorphism is unique up to isotopy
|
[['let', 'r', 'be', 'a', 'compact', 'connected', 'orientable', 'surface', 'of', 'genus', 'g', 'with', 'n', 'boundary', 'components', 'let', 'mathcalcr', 'be', 'the', 'curve', 'graph', 'of', 'r', 'we', 'prove', 'that', 'if', 'g0', 'n', 'geq', '5', 'or', 'g1', 'n', 'geq', '3', 'and', 'lambda', 'mathcalcr', 'rightarrowmathcalcr', 'is', 'an', 'edge', 'preserving', 'map', 'then', 'lambda', 'is', 'induced', 'by', 'a', 'homeomorphism', 'of', 'r', 'and', 'this', 'homeomorphism', 'is', 'unique', 'up', 'to', 'isotopy']]
|
[-0.2651311990911843, 0.16500156666901244, -0.0814357059091696, -0.055896296360545224, -0.06771695986390114, -0.27879919756020677, -0.03834924397638953, 0.37006271080892594, -0.3161583161286888, -0.26661893513175794, 0.07195525679672442, -0.34660131838478025, -0.08186573149697458, 0.13523541101956832, -0.10343476453963972, -0.08509264804697672, 0.05759139494878835, 0.11025411092111322, -0.03504229106818189, -0.23950263191650042, 0.34892152487987377, -0.13854523613804676, 0.05907485337897402, 0.11325112205823182, 0.08052049729148628, -0.06044787935698863, 0.06481195671758691, 0.04543092918246374, -0.22546010852667797, 0.07787644187728951, 0.2790348360689021, 0.1006471699248755, 0.15984055860975727, -0.3263000164211529, -0.16638260447710265, 0.27237793397097315, 0.1602192408267836, -0.1571698268020495, 0.06605926009856897, -0.24648879697454756, 0.23198144556191125, -0.07866347489542648, -0.1955850612845455, 0.001934186372234196, 0.2393821900802069, -0.049847701863103284, -0.3102115926439645, -0.06074318163035834, 0.13881216298971996, 0.12150811280322368, 0.06678622495383024, -0.10062968973681087, -0.14656873790883138, 0.08954760507436195, -0.08873715991780284, 0.25153184317998956, 0.05884941536780508, -0.049936970692036335, -0.023910138481220262, 0.34505260502919555, -0.15328514404961321, -0.2135655848523144, 0.08746343582380013, -0.1978174181670317, -0.12701235633709881, 0.13862951122010586, 0.05869953978623523, 0.18865598600785263, -0.021793349355947775, 0.2878680172219842, -0.06710758170334348, 0.17717461916999738, 0.10458539495030876, -0.12269313119687751, 0.1460563650385278, 0.11595364554296629, 0.18719647041811574, 0.13023153726454276, -0.023210062702629167, 0.19427658941169254, -0.3663189532082589, -0.17864706990171653, -0.18524631892224072, 0.23045585147242564, -0.1998039195003927, -0.10806625202053884, 0.33282108882778005, -0.02738934906474391, 0.2073431132575039, 0.14417148799803414, 0.19900896287233125, 0.0500639559372832, 0.013509663661605999, 0.20219270546813725, -0.003136924910740774, 0.2093292941591229, -0.18071263707929947, -0.15020665161494837, -0.06076128985045753, 0.1568257321725737]
|
1,803.08807
|
Two-way fixed effects estimators with heterogeneous treatment effects
|
Linear regressions with period and group fixed effects are widely used to
estimate treatment effects. We show that they estimate weighted sums of the
average treatment effects (ATE) in each group and period, with weights that may
be negative. Due to the negative weights, the linear regression coefficient may
for instance be negative while all the ATEs are positive. We propose another
estimator that solves this issue. In the two applications we revisit, it is
significantly different from the linear regression estimator.
|
econ.EM
|
linear regressions with period and group fixed effects are widely used to estimate treatment effects we show that they estimate weighted sums of the average treatment effects ate in each group and period with weights that may be negative due to the negative weights the linear regression coefficient may for instance be negative while all the ates are positive we propose another estimator that solves this issue in the two applications we revisit it is significantly different from the linear regression estimator
|
[['linear', 'regressions', 'with', 'period', 'and', 'group', 'fixed', 'effects', 'are', 'widely', 'used', 'to', 'estimate', 'treatment', 'effects', 'we', 'show', 'that', 'they', 'estimate', 'weighted', 'sums', 'of', 'the', 'average', 'treatment', 'effects', 'ate', 'in', 'each', 'group', 'and', 'period', 'with', 'weights', 'that', 'may', 'be', 'negative', 'due', 'to', 'the', 'negative', 'weights', 'the', 'linear', 'regression', 'coefficient', 'may', 'for', 'instance', 'be', 'negative', 'while', 'all', 'the', 'ates', 'are', 'positive', 'we', 'propose', 'another', 'estimator', 'that', 'solves', 'this', 'issue', 'in', 'the', 'two', 'applications', 'we', 'revisit', 'it', 'is', 'significantly', 'different', 'from', 'the', 'linear', 'regression', 'estimator']]
|
[-0.0702485466154474, 0.10420020262245089, -0.10047779993222254, 0.08942599226607055, -0.11241002269259585, -0.2041672666261836, 0.020550064878856262, 0.4072085725279843, -0.29619026814428406, -0.27114349176607483, 0.15160585915749303, -0.29271428112690223, -0.1919189049797019, 0.17947777354998923, -0.10596911876076241, 0.04343905845066396, 0.05714931075955264, 0.014489924421579373, -0.06201683880801017, -0.32060612262817234, 0.29555988928484844, 0.03787339282812687, 0.26036078898554166, 0.02896581345419513, 0.09107974780334455, 0.04618002006375208, -0.0674986316823889, 0.053351620984513584, -0.08624251751133692, 0.07865459547468984, 0.28448482463136315, 0.06484391611841757, 0.3733776413222275, -0.35245147749509026, -0.22141366212333485, 0.18497436277273044, 0.09456889812902707, 0.12053841002364983, -0.0033539232184610717, -0.19068961445151306, 0.08573358059610899, -0.1576847584759135, -0.06299878408132893, -0.056287331498091724, -0.010793944321027616, 0.008787405324344546, -0.3424985419118368, 0.13798933004869557, 0.03941505999168063, 0.018551854973250046, -0.0894114179877428, -0.20683185752799235, 0.025802422405743018, 0.11336692529815681, 0.08986632498094767, -0.01802301282636685, 0.09110565513667719, -0.0829151376553743, -0.11202743164513533, 0.33235897573574286, -0.10720987356318978, -0.25723738525426243, 0.13794800966251186, -0.15063199490626775, -0.12122368527201527, 0.05636282938691538, 0.2360967056933654, 0.09824709381294869, -0.1197850373857541, 0.009941115247074334, -0.04536952281643341, 0.13545430256280958, 0.04062244537990631, -0.015664598052730648, 0.1681985271322291, 0.05236912568713107, 0.09104531552506293, 0.11656952188520624, -0.09843493711839361, -0.04215661941164332, -0.2708942990667732, -0.11173663404770195, -0.13290910198063613, -0.00039251830156256513, -0.13826764008653544, -0.1779787294984023, 0.3641855578596999, 0.160568446525736, 0.22036565591513022, 0.09797569625533936, 0.251261528604096, 0.17854111591672026, 0.09026982286253236, 0.09856310463652423, 0.19067019511513958, 0.1182068277082247, -0.005606926926525264, -0.22758966812966164, 0.1564521082824596, 0.05691342775655978]
|
1,803.08808
|
Classifying global dimensions of category algebras of some finite
combinational categories
|
In this paper we classify global dimensions of the category algebras of some
finite categories, including finite truncations of the categories $FI$, $FI_G$,
$FI_d$, $OI$, $OI_G$, $OI_d$ and $VI$
|
math.RT
|
in this paper we classify global dimensions of the category algebras of some finite categories including finite truncations of the categories fi fi_g fi_d oi oi_g oi_d and vi
|
[['in', 'this', 'paper', 'we', 'classify', 'global', 'dimensions', 'of', 'the', 'category', 'algebras', 'of', 'some', 'finite', 'categories', 'including', 'finite', 'truncations', 'of', 'the', 'categories', 'fi', 'fi_g', 'fi_d', 'oi', 'oi_g', 'oi_d', 'and', 'vi']]
|
[-0.07120923649657655, 0.016821299144929205, 0.042138280278002774, 0.08549480096661244, -0.04232275955103062, -0.1081518828868866, -0.025644089056489367, 0.3811040239201652, -0.32567938237830446, -0.18487317113343765, 0.12219358811206701, -0.2351151128747949, -0.08516532403451425, 0.042050487413588494, -0.21074939194928716, -0.11757747525418247, 0.002251739406751262, 0.033477313471613104, -0.12091183724502723, -0.3433740672319093, 0.48938523950400176, -0.1266499000032329, 0.2286853936880275, 0.028021578125103756, 0.07627753992737443, -0.06740527648556356, -0.08295829856285343, 0.0699157404747826, -0.14297633757383596, 0.17605553995128032, 0.31878616619441247, 0.08762697192529838, 0.18938052044163836, -0.3477305311847616, -0.08719358289683307, 0.14123876855053283, 0.17412163800111524, 0.08076398698957982, 0.0274176096405696, -0.3330593020827682, 0.07809805680342295, -0.2959119747220366, -0.06553730344468797, -0.05537014716753253, 0.11285326022792745, 0.0346026853830726, -0.24027546295137317, 0.009897575713694096, 0.07421532140492841, 0.19515909547745078, -0.17017354388479833, -0.08115455991140118, -0.09766601177829283, 0.10930481350428804, -0.030881529397986555, -0.09079049751852397, 0.07605232845095021, -0.17877449668702428, -0.1154115375959211, 0.322884459445184, -0.025097148113504605, -0.14209415953977172, 0.2327681956467805, -0.12999656361838183, -0.19923899253761326, 0.08562055830326346, 0.031038840611775715, 0.1616405624102939, -0.05949181977107569, 0.19963166500329627, -0.11804467674206805, 0.0657425693201798, 0.07455004265324937, 0.07482964486849529, 0.10994444939273375, 0.1095092310052779, -0.015243933674086023, 0.11841400138412912, -0.07820200727157364, -0.012102416268101445, -0.40900365042465703, -0.19433427840057346, 0.021996798476687184, 0.07290979909400146, -0.10955246970762447, -0.2273522944500049, 0.4437019379671525, 0.19701322871777746, 0.18794295312491832, 0.11478994916089708, 0.2022400810038326, 0.04904016317730701, 0.07909204610795886, 0.015200997185375955, 0.10699830547997004, 0.22541789110336038, 0.03896100562565995, -0.1021256495129179, -0.06262302678078413, 0.22215411380899172]
|
1,803.08809
|
Removing classical singularities by use of quantum mechanical sources
|
For distances large relative to the electron Compton wavelength, the Maxwell
and gravitational fields from a bound electron in its groundstate are
essentially those from a rotating, charged, massive point particle. For
distances small relative to the electron Compton wavelength, the corresponding
Maxwell fields and General Relativity metric, Riemann and Einstein tensors
become bounded, showing that, for this example, quantum effects remove the
corresponding classical singularities in electromagnetism and General
Relativity. The asymptotic magnetic dipole field from the bound electron
produces a constant magnetic field of several Tesla, aligned along the spin
axis of the electron, at the singularity position. The corresponding apparent
mass density from the gravitational field from the bound electron is about
2kgm$^{-3}$, at the singularity position.
|
gr-qc
|
for distances large relative to the electron compton wavelength the maxwell and gravitational fields from a bound electron in its groundstate are essentially those from a rotating charged massive point particle for distances small relative to the electron compton wavelength the corresponding maxwell fields and general relativity metric riemann and einstein tensors become bounded showing that for this example quantum effects remove the corresponding classical singularities in electromagnetism and general relativity the asymptotic magnetic dipole field from the bound electron produces a constant magnetic field of several tesla aligned along the spin axis of the electron at the singularity position the corresponding apparent mass density from the gravitational field from the bound electron is about 2kgm3 at the singularity position
|
[['for', 'distances', 'large', 'relative', 'to', 'the', 'electron', 'compton', 'wavelength', 'the', 'maxwell', 'and', 'gravitational', 'fields', 'from', 'a', 'bound', 'electron', 'in', 'its', 'groundstate', 'are', 'essentially', 'those', 'from', 'a', 'rotating', 'charged', 'massive', 'point', 'particle', 'for', 'distances', 'small', 'relative', 'to', 'the', 'electron', 'compton', 'wavelength', 'the', 'corresponding', 'maxwell', 'fields', 'and', 'general', 'relativity', 'metric', 'riemann', 'and', 'einstein', 'tensors', 'become', 'bounded', 'showing', 'that', 'for', 'this', 'example', 'quantum', 'effects', 'remove', 'the', 'corresponding', 'classical', 'singularities', 'in', 'electromagnetism', 'and', 'general', 'relativity', 'the', 'asymptotic', 'magnetic', 'dipole', 'field', 'from', 'the', 'bound', 'electron', 'produces', 'a', 'constant', 'magnetic', 'field', 'of', 'several', 'tesla', 'aligned', 'along', 'the', 'spin', 'axis', 'of', 'the', 'electron', 'at', 'the', 'singularity', 'position', 'the', 'corresponding', 'apparent', 'mass', 'density', 'from', 'the', 'gravitational', 'field', 'from', 'the', 'bound', 'electron', 'is', 'about', '2kgm3', 'at', 'the', 'singularity', 'position']]
|
[-0.13697391934497202, 0.18702378877567738, -0.06597981915003111, 0.12760111780351951, -0.06566737914270088, -0.11519782976325632, -0.040914948495543176, 0.30680233671353396, -0.22857457276496315, -0.3045187865642189, 0.02534482811925886, -0.2898696421825585, -0.03332300345656, 0.21254863876931587, 0.03866898062631112, 0.020605183429057327, -0.00477376053532382, 0.07365944320257722, -0.10608194449705173, -0.17050371552277513, 0.3705619395389652, 0.09258423223132815, 0.24655940334563056, 0.06964005649621997, 0.11001804622062364, 0.025237366635383677, 0.024670023631554943, 0.05032072673716089, -0.10101803916756175, 0.060345163514070654, 0.19987115632946126, 0.015955325004746432, 0.19313618919553877, -0.4202999403277616, -0.15144714120381214, 0.04184727288563462, 0.1016481427471897, 0.18607173247278488, -0.048416413366794586, -0.2949555969538809, 0.00955062500443779, -0.11713214315270551, -0.22684602646798896, 0.02492232295144506, 0.03284763435132708, 0.01155132513900264, -0.23436584317383646, 0.10673085088301607, 0.049048213932507655, 0.03639377272069579, -0.11451385472412025, -0.10416197572138254, 0.00013334621448351556, 0.0398901409798247, 0.12447748849160593, 0.12480650135480306, 0.20719507378878213, -0.13689573057496748, -0.06769371414244049, 0.379336133849721, -0.08410395561725277, -0.17785472337532193, 0.1441575849757475, -0.24684179381187613, -0.02735132341539221, 0.20599041876633564, 0.1378919248735266, 0.13103087818907463, -0.11314277859608166, 0.1494546944819422, -0.004589751175949115, 0.1211850546516122, 0.1511354477050863, 0.06655972906556606, 0.3272122068314993, 0.03225823451897928, 0.05137548497838884, 0.078922616701354, -0.1731982054658422, -0.08552206764310724, -0.31977607225294874, -0.15158457750749985, -0.201754051382446, 0.11762462796627723, -0.16466985655774385, -0.17089081278556034, 0.35108923411168974, 0.11980237284070663, 0.11721757482424253, 0.03914629855044499, 0.3106816364060931, 0.09365635471097625, 0.06888286931980245, 0.10650494252918523, 0.33136021981344504, 0.20237760245017394, 0.12013936321204137, -0.2649687510159868, -0.0706036686349441, 0.05639256734805506]
|
1,803.0881
|
Sneak into Devil's Colony- A study of Fake Profiles in Online Social
Networks and the Cyber Law
|
Massive content about user's social, personal and professional life stored on
Online Social Networks (OSNs) has attracted not only the attention of
researchers and social analysts but also the cyber criminals. These cyber
criminals penetrate illegally into an OSN by establishing fake profiles or by
designing bots and exploit the vulnerabilities of an OSN to carry out illegal
activities. With the growth of technology cyber crimes have been increasing
manifold. Daily reports of the security and privacy threats in the OSNs demand
not only the intelligent automated detection systems that can identify and
alleviate fake profiles in real time but also the reinforcement of the security
and privacy laws to curtail the cyber crime. In this paper, we have studied
various categories of fake profiles like compromised profiles, cloned profiles
and online bots (spam-bots, social-bots, like-bots and influential-bots) on
different OSN sites along with existing cyber laws to mitigate their threats.
In order to design fake profile detection systems, we have highlighted
different category of fake profile features which are capable to distinguish
different kinds of fake entities from real ones. Another major challenges faced
by researchers while building the fake profile detection systems is the
unavailability of data specific to fake users. The paper addresses this
challenge by providing extremely obliging data collection techniques along with
some existing data sources. Furthermore, an attempt is made to present several
machine learning techniques employed to design different fake profile detection
systems.
|
cs.SI cs.CY
|
massive content about users social personal and professional life stored on online social networks osns has attracted not only the attention of researchers and social analysts but also the cyber criminals these cyber criminals penetrate illegally into an osn by establishing fake profiles or by designing bots and exploit the vulnerabilities of an osn to carry out illegal activities with the growth of technology cyber crimes have been increasing manifold daily reports of the security and privacy threats in the osns demand not only the intelligent automated detection systems that can identify and alleviate fake profiles in real time but also the reinforcement of the security and privacy laws to curtail the cyber crime in this paper we have studied various categories of fake profiles like compromised profiles cloned profiles and online bots spambots socialbots likebots and influentialbots on different osn sites along with existing cyber laws to mitigate their threats in order to design fake profile detection systems we have highlighted different category of fake profile features which are capable to distinguish different kinds of fake entities from real ones another major challenges faced by researchers while building the fake profile detection systems is the unavailability of data specific to fake users the paper addresses this challenge by providing extremely obliging data collection techniques along with some existing data sources furthermore an attempt is made to present several machine learning techniques employed to design different fake profile detection systems
|
[['massive', 'content', 'about', 'users', 'social', 'personal', 'and', 'professional', 'life', 'stored', 'on', 'online', 'social', 'networks', 'osns', 'has', 'attracted', 'not', 'only', 'the', 'attention', 'of', 'researchers', 'and', 'social', 'analysts', 'but', 'also', 'the', 'cyber', 'criminals', 'these', 'cyber', 'criminals', 'penetrate', 'illegally', 'into', 'an', 'osn', 'by', 'establishing', 'fake', 'profiles', 'or', 'by', 'designing', 'bots', 'and', 'exploit', 'the', 'vulnerabilities', 'of', 'an', 'osn', 'to', 'carry', 'out', 'illegal', 'activities', 'with', 'the', 'growth', 'of', 'technology', 'cyber', 'crimes', 'have', 'been', 'increasing', 'manifold', 'daily', 'reports', 'of', 'the', 'security', 'and', 'privacy', 'threats', 'in', 'the', 'osns', 'demand', 'not', 'only', 'the', 'intelligent', 'automated', 'detection', 'systems', 'that', 'can', 'identify', 'and', 'alleviate', 'fake', 'profiles', 'in', 'real', 'time', 'but', 'also', 'the', 'reinforcement', 'of', 'the', 'security', 'and', 'privacy', 'laws', 'to', 'curtail', 'the', 'cyber', 'crime', 'in', 'this', 'paper', 'we', 'have', 'studied', 'various', 'categories', 'of', 'fake', 'profiles', 'like', 'compromised', 'profiles', 'cloned', 'profiles', 'and', 'online', 'bots', 'spambots', 'socialbots', 'likebots', 'and', 'influentialbots', 'on', 'different', 'osn', 'sites', 'along', 'with', 'existing', 'cyber', 'laws', 'to', 'mitigate', 'their', 'threats', 'in', 'order', 'to', 'design', 'fake', 'profile', 'detection', 'systems', 'we', 'have', 'highlighted', 'different', 'category', 'of', 'fake', 'profile', 'features', 'which', 'are', 'capable', 'to', 'distinguish', 'different', 'kinds', 'of', 'fake', 'entities', 'from', 'real', 'ones', 'another', 'major', 'challenges', 'faced', 'by', 'researchers', 'while', 'building', 'the', 'fake', 'profile', 'detection', 'systems', 'is', 'the', 'unavailability', 'of', 'data', 'specific', 'to', 'fake', 'users', 'the', 'paper', 'addresses', 'this', 'challenge', 'by', 'providing', 'extremely', 'obliging', 'data', 'collection', 'techniques', 'along', 'with', 'some', 'existing', 'data', 'sources', 'furthermore', 'an', 'attempt', 'is', 'made', 'to', 'present', 'several', 'machine', 'learning', 'techniques', 'employed', 'to', 'design', 'different', 'fake', 'profile', 'detection', 'systems']]
|
[-0.1444416862321595, 0.008398635679464141, -0.027258457709886448, 0.1197075355962357, -0.16768082386144914, -0.2171370977997592, 0.05987113795219725, 0.3914094287305366, -0.2343785627532316, -0.3825319778729825, 0.11023588581480273, -0.39688878908690783, -0.18040002397351562, 0.1685112438824012, -0.15138679828119128, 0.046651824880313095, 0.011471522189363712, 0.011281837252391298, 0.04658875631133266, -0.3444880098828404, 0.3647477581056164, 0.05104019975156656, 0.36235402994828314, 0.07636763709753815, 0.03203803066412738, -0.021413165817678978, -0.10590434190425865, -0.024781669261366397, -0.07207104275527067, 0.16003122193610542, 0.3928504124197702, 0.27192111635490657, 0.367588019900967, -0.4546663363996361, -0.22332736249512233, 0.14271933994032912, 0.18455214791015542, 0.09488912128712278, -0.09293222887648911, -0.4116755509866449, 0.10309295932089269, -0.23428105689319118, -0.09789098482070287, -0.1005850609728456, 0.0025835536897745952, 0.02736840691875291, -0.1468673097634954, -0.030236437183290235, -0.012028534223615122, 0.13629805300768247, 0.002870248761732413, -0.04051355520916805, -0.02090570957208162, 0.22573698919213636, 0.14552769612348757, -0.08381020192236897, 0.20776936887595177, -0.18583107609967037, -0.16983981221178626, 0.34768179977829217, 0.04814614192925065, -0.15165829181303309, 0.1847673356503702, -0.000342645263690658, -0.15248757234907576, 0.12068812284782968, 0.2827082948657457, 0.06684673795703516, -0.20254021965577698, -0.05176854478938803, 0.010693949840947235, 0.1887349351289674, 0.057238980825450425, -0.01075938472058624, 0.20996758027174392, 0.12084324394246101, 0.087210592786398, 0.04909616072090859, -0.047913736648106275, -0.07354985637308545, -0.1490130040847438, -0.13082844315061518, -0.10189695884434491, 0.039072802495881485, -0.06670317089159683, -0.12250666464253392, 0.3980507397057661, 0.199655020734779, 0.15905552327597686, 0.007758438304343512, 0.36471793048882056, -0.02440864756554678, 0.11682768121553476, 0.08984017670898065, 0.16576893835784887, -0.029298164490453835, 0.24003451828308747, -0.10039071507405631, 0.18067126430203245, -0.05399377424536007]
|
1,803.08811
|
Rational factors, invariant foliations and algebraic disintegration of
compact mixing Anosov flow of dimension $3$
|
In this article, we develop a geometric framework to study the notion of
semi-minimality for the generic type of a smooth autonomous differential
equation $(X,v)$, based on the study of rational factors of $(X,v)$ and of
algebraic foliations on $X$, invariant under the Lie-derivative of the vector
field $v$.
We then illustrate the effectiveness of these methods by showing that certain
autonomous algebraic differential equation of order three defined over the
field of real numbers --- more precisely, those associated to mixing, compact,
Anosov flows of dimension three --- are generically disintegrated.
|
math.AG math.DS math.LO
|
in this article we develop a geometric framework to study the notion of semiminimality for the generic type of a smooth autonomous differential equation xv based on the study of rational factors of xv and of algebraic foliations on x invariant under the liederivative of the vector field v we then illustrate the effectiveness of these methods by showing that certain autonomous algebraic differential equation of order three defined over the field of real numbers more precisely those associated to mixing compact anosov flows of dimension three are generically disintegrated
|
[['in', 'this', 'article', 'we', 'develop', 'a', 'geometric', 'framework', 'to', 'study', 'the', 'notion', 'of', 'semiminimality', 'for', 'the', 'generic', 'type', 'of', 'a', 'smooth', 'autonomous', 'differential', 'equation', 'xv', 'based', 'on', 'the', 'study', 'of', 'rational', 'factors', 'of', 'xv', 'and', 'of', 'algebraic', 'foliations', 'on', 'x', 'invariant', 'under', 'the', 'liederivative', 'of', 'the', 'vector', 'field', 'v', 'we', 'then', 'illustrate', 'the', 'effectiveness', 'of', 'these', 'methods', 'by', 'showing', 'that', 'certain', 'autonomous', 'algebraic', 'differential', 'equation', 'of', 'order', 'three', 'defined', 'over', 'the', 'field', 'of', 'real', 'numbers', 'more', 'precisely', 'those', 'associated', 'to', 'mixing', 'compact', 'anosov', 'flows', 'of', 'dimension', 'three', 'are', 'generically', 'disintegrated']]
|
[-0.19596661022848585, 0.07722644260927533, -0.08057703246529936, 0.05042625704565703, -0.07811680190223322, -0.1060163365321213, -0.024705366346608387, 0.3181442462765936, -0.2905469070492166, -0.22668158420978973, 0.10283932206351729, -0.23802558684282088, -0.20520267891959193, 0.23655971150133717, -0.08674879314566261, 0.05659209921683991, 0.016504328901973668, 0.09759713535123829, -0.10730976677039282, -0.278650740402217, 0.47650032356548844, -0.09778337823122404, 0.21619239481286345, 0.0036632500234415775, 0.1668992854309467, -0.021238034470739325, -0.049491030546009875, 0.060582857767350215, -0.1593696490337116, 0.1846748042270918, 0.23860935986125736, 0.10063094083544159, 0.2181397390373972, -0.37988420676314427, -0.1820671967638845, 0.1344879823579882, 0.10846287228972808, 0.017874167643466526, -0.005812346072785106, -0.2963736599541447, 0.12327449131505878, -0.14405383648915907, -0.1753457065206021, -0.10657013954824945, 0.041302680992782954, 0.06543797781439813, -0.23057616940500697, 0.0033033901532546857, 0.10247399153585514, 0.1475352748229137, -0.06138777866268928, -0.07303690960306382, -0.062097570270278984, 0.04619500373118672, 0.011786426239636508, 0.02306159927896904, 0.09831725313129384, -0.10014219141272263, -0.11566215920984076, 0.37592666578908146, -0.0915668930379632, -0.23324713885281864, 0.17004471605256452, -0.14363758092787995, -0.15492540204981237, 0.15788481531800766, 0.22494271255276177, 0.15991048457289345, -0.1219486417981346, 0.12328499227989821, -0.07012398334042158, 0.061344271847517805, 0.039767207447020864, -0.026587956140257333, 0.10648364491049159, 0.12250174928372831, 0.0864575344472705, 0.0771588333306855, -0.029039817365812494, -0.10472800192328986, -0.3491952523923992, -0.20903302313697136, -0.07825773338044292, 0.11935785486038482, -0.08819517776814127, -0.1594671896773945, 0.427239618274603, 0.10996890312918786, 0.1982750662633877, 0.05681663612165394, 0.2628267891705036, 0.11076625463424586, -0.012410982752616486, 0.04565421688066942, 0.16064693801774738, 0.18690673359460458, 0.0491763780225759, -0.18621742727203566, -0.0009094839915633202, 0.1395526754701238]
|
1,803.08812
|
Paving the Way for Culturally Competent Robots: a Position Paper
|
Cultural competence is a well known requirement for an effective healthcare,
widely investigated in the nursing literature. We claim that personal assistive
robots should likewise be culturally competent, aware of general cultural
characteristics and of the different forms they take in different individuals,
and sensitive to cultural differences while perceiving, reasoning, and acting.
Drawing inspiration from existing guidelines for culturally competent
healthcare and the state-of-the-art in culturally competent robotics, we
identify the key robot capabilities which enable culturally competent
behaviours and discuss methodologies for their development and evaluation.
|
cs.CY cs.RO
|
cultural competence is a well known requirement for an effective healthcare widely investigated in the nursing literature we claim that personal assistive robots should likewise be culturally competent aware of general cultural characteristics and of the different forms they take in different individuals and sensitive to cultural differences while perceiving reasoning and acting drawing inspiration from existing guidelines for culturally competent healthcare and the stateoftheart in culturally competent robotics we identify the key robot capabilities which enable culturally competent behaviours and discuss methodologies for their development and evaluation
|
[['cultural', 'competence', 'is', 'a', 'well', 'known', 'requirement', 'for', 'an', 'effective', 'healthcare', 'widely', 'investigated', 'in', 'the', 'nursing', 'literature', 'we', 'claim', 'that', 'personal', 'assistive', 'robots', 'should', 'likewise', 'be', 'culturally', 'competent', 'aware', 'of', 'general', 'cultural', 'characteristics', 'and', 'of', 'the', 'different', 'forms', 'they', 'take', 'in', 'different', 'individuals', 'and', 'sensitive', 'to', 'cultural', 'differences', 'while', 'perceiving', 'reasoning', 'and', 'acting', 'drawing', 'inspiration', 'from', 'existing', 'guidelines', 'for', 'culturally', 'competent', 'healthcare', 'and', 'the', 'stateoftheart', 'in', 'culturally', 'competent', 'robotics', 'we', 'identify', 'the', 'key', 'robot', 'capabilities', 'which', 'enable', 'culturally', 'competent', 'behaviours', 'and', 'discuss', 'methodologies', 'for', 'their', 'development', 'and', 'evaluation']]
|
[-0.04833724960487664, 0.08134146687321349, -0.053538816721728916, 0.12065751118908255, -0.20101854697250846, -0.192612949679394, 0.04082158683079549, 0.45904205879196525, -0.18766987716398117, -0.33281755043638195, 0.07747121718950273, -0.27092933604779484, -0.2324818037661978, 0.19239326469092208, -0.19176179860633882, 0.005327377436597916, 0.0663758553987877, 0.06225363352462988, 0.04065737787459511, -0.24861041126264768, 0.2804269593881062, 0.011353034706024284, 0.3733333194289695, 0.08393591340758245, 0.07305711633605162, 0.006302696181757545, -0.040983028107968326, 0.003966493235731667, -0.09551893724752021, 0.15956587871451947, 0.4659583207050508, 0.25659597563472664, 0.3849140380235357, -0.47097081070850516, -0.1539341130463237, 0.05767542318128769, 0.15138224271041426, 0.06988290862037419, -0.03171749850100076, -0.38504012140699406, 0.049200838304717436, -0.19066235222668515, -0.12574218505654822, -0.10528066243172031, 0.04489308175503869, 0.029440235650161576, -0.19436241570457985, -0.028899988563352963, 0.025856004605884664, 0.16145575922829183, -0.10583576957949183, -0.17646699175317984, -0.00042526571566916323, 0.3029243022319861, 0.09342142795371315, -0.026697341008746826, 0.23476591464449567, -0.19434375675998375, -0.15147501572077585, 0.4262348369441249, 0.07309841318055987, -0.19519135787744413, 0.25641250917264685, -0.03258166118757799, -0.16727531237252566, -0.0004959801034684377, 0.2065437433458018, 0.05292730971070176, -0.22288319107346152, -0.03915803007839713, 0.0803664407258938, 0.130820892655968, 0.029189134295765227, 0.030056218842219096, 0.22096420051953333, 0.18059506945693019, 0.046881082457151606, 0.03208759102033747, 0.06397224231411448, -0.1256670680674936, -0.17870022521608256, -0.18494859604503622, -0.07188469850437039, -0.019297572254965253, -0.09884761635839823, -0.12352956908712671, 0.35444420197216625, 0.22352692994966425, 0.08375687422548336, 0.04331321952023162, 0.3227493181740018, -0.0068667405496605416, 0.09947594724838961, 0.07868682569294999, 0.18239938319576057, -0.06904188657856801, 0.18593791429090992, -0.14606195111727258, 0.1906717988577756, -0.08904979352585295]
|
1,803.08813
|
Estimating the EOS from the measurement of NS radii with 5% accuracy
|
Observations of heavy (${\simeq}2\,M_\odot$) neutron stars in addition to the
recent measurement of tidal deformability from the binary neutron-star merger
GW170817, place interesting constraints on theories of dense matter. Current
and future observatories, such as the NICER and ATHENA are expected to collect
information on the global parameters of neutron stars, namely masses and radii,
with the accuracy of a few percent. Such accuracy will allow for precise
comparisons of measurements to models of compact objects. Here we investigate
how the measurement accuracy of the NICER and ATHENA missions will improve our
understanding of the dense-matter interior of neutron stars. We compare global
parameters of stellar configurations obtained using three different equations
of state: a reference (SLy4 EOS) and two piecewise polytropes manufactured to
produce mass-radius relations indistinguishable from the observational point of
view i.e. within the predicted error of the radius measurement. We assume
observational errors on the radius determination corresponding to the expected
accuracies. The effect of rotation is examined using high-precision numerical
relativity computations. Due to the fact that masses and rotational frequencies
might be determined very precisely in the most optimistic scenario, only the
influence of observational errors on the radius measurements is investigated.
We show that ${\pm}5\%$ errors in radius measurement lead to ${\sim}10\%$ and
${\sim}40\%$ accuracy in central parameter estimation, for low-mass and
high-mass neutron stars, respectively. Global parameters, such as oblateness
and surface area, can be established with $8-10\%$ accuracy, even if only
compactness (instead of mass and radius) is measured. We also report on the
range of tidal deformabilities corresponding to the estimated masses of
GW170817, for the assumed uncertainty in radius.
|
astro-ph.HE astro-ph.SR
|
observations of heavy simeq2m_odot neutron stars in addition to the recent measurement of tidal deformability from the binary neutronstar merger gw170817 place interesting constraints on theories of dense matter current and future observatories such as the nicer and athena are expected to collect information on the global parameters of neutron stars namely masses and radii with the accuracy of a few percent such accuracy will allow for precise comparisons of measurements to models of compact objects here we investigate how the measurement accuracy of the nicer and athena missions will improve our understanding of the densematter interior of neutron stars we compare global parameters of stellar configurations obtained using three different equations of state a reference sly4 eos and two piecewise polytropes manufactured to produce massradius relations indistinguishable from the observational point of view ie within the predicted error of the radius measurement we assume observational errors on the radius determination corresponding to the expected accuracies the effect of rotation is examined using highprecision numerical relativity computations due to the fact that masses and rotational frequencies might be determined very precisely in the most optimistic scenario only the influence of observational errors on the radius measurements is investigated we show that pm5 errors in radius measurement lead to sim10 and sim40 accuracy in central parameter estimation for lowmass and highmass neutron stars respectively global parameters such as oblateness and surface area can be established with 810 accuracy even if only compactness instead of mass and radius is measured we also report on the range of tidal deformabilities corresponding to the estimated masses of gw170817 for the assumed uncertainty in radius
|
[['observations', 'of', 'heavy', 'simeq2m_odot', 'neutron', 'stars', 'in', 'addition', 'to', 'the', 'recent', 'measurement', 'of', 'tidal', 'deformability', 'from', 'the', 'binary', 'neutronstar', 'merger', 'gw170817', 'place', 'interesting', 'constraints', 'on', 'theories', 'of', 'dense', 'matter', 'current', 'and', 'future', 'observatories', 'such', 'as', 'the', 'nicer', 'and', 'athena', 'are', 'expected', 'to', 'collect', 'information', 'on', 'the', 'global', 'parameters', 'of', 'neutron', 'stars', 'namely', 'masses', 'and', 'radii', 'with', 'the', 'accuracy', 'of', 'a', 'few', 'percent', 'such', 'accuracy', 'will', 'allow', 'for', 'precise', 'comparisons', 'of', 'measurements', 'to', 'models', 'of', 'compact', 'objects', 'here', 'we', 'investigate', 'how', 'the', 'measurement', 'accuracy', 'of', 'the', 'nicer', 'and', 'athena', 'missions', 'will', 'improve', 'our', 'understanding', 'of', 'the', 'densematter', 'interior', 'of', 'neutron', 'stars', 'we', 'compare', 'global', 'parameters', 'of', 'stellar', 'configurations', 'obtained', 'using', 'three', 'different', 'equations', 'of', 'state', 'a', 'reference', 'sly4', 'eos', 'and', 'two', 'piecewise', 'polytropes', 'manufactured', 'to', 'produce', 'massradius', 'relations', 'indistinguishable', 'from', 'the', 'observational', 'point', 'of', 'view', 'ie', 'within', 'the', 'predicted', 'error', 'of', 'the', 'radius', 'measurement', 'we', 'assume', 'observational', 'errors', 'on', 'the', 'radius', 'determination', 'corresponding', 'to', 'the', 'expected', 'accuracies', 'the', 'effect', 'of', 'rotation', 'is', 'examined', 'using', 'highprecision', 'numerical', 'relativity', 'computations', 'due', 'to', 'the', 'fact', 'that', 'masses', 'and', 'rotational', 'frequencies', 'might', 'be', 'determined', 'very', 'precisely', 'in', 'the', 'most', 'optimistic', 'scenario', 'only', 'the', 'influence', 'of', 'observational', 'errors', 'on', 'the', 'radius', 'measurements', 'is', 'investigated', 'we', 'show', 'that', 'pm5', 'errors', 'in', 'radius', 'measurement', 'lead', 'to', 'sim10', 'and', 'sim40', 'accuracy', 'in', 'central', 'parameter', 'estimation', 'for', 'lowmass', 'and', 'highmass', 'neutron', 'stars', 'respectively', 'global', 'parameters', 'such', 'as', 'oblateness', 'and', 'surface', 'area', 'can', 'be', 'established', 'with', '810', 'accuracy', 'even', 'if', 'only', 'compactness', 'instead', 'of', 'mass', 'and', 'radius', 'is', 'measured', 'we', 'also', 'report', 'on', 'the', 'range', 'of', 'tidal', 'deformabilities', 'corresponding', 'to', 'the', 'estimated', 'masses', 'of', 'gw170817', 'for', 'the', 'assumed', 'uncertainty', 'in', 'radius']]
|
[-0.09350765037062997, 0.12802693348976898, -0.06323802964779164, 0.10856831998245783, -0.10119009211133183, -0.04119182067151185, 0.07146939824657259, 0.36041195463686904, -0.18543107097935568, -0.38162234171594883, 0.10733407222169025, -0.2908789295942062, -0.008266971446573734, 0.25430286021688503, -0.058203896317634465, 0.0622827772186986, 0.1283983288823582, 0.050143652201758274, -0.15189968508522833, -0.21926154825510977, 0.3116872243662832, 0.08477433861430637, 0.1490737647482464, 0.010931450827523276, 0.06446607509579468, -0.05167555593154964, -0.04914447583161211, 0.022347408794316716, -0.19239549836260483, 0.060163648828490186, 0.2214894139058837, 0.14293550355809995, 0.1790319005647141, -0.39714285040613556, -0.21594228376513244, 0.0805471343694594, 0.10865277743839476, 0.059881324846069, -0.04085623560218854, -0.2850183059368802, 0.07779072392554469, -0.21807621913221162, -0.16635412828422058, -0.04777434074447999, 0.04536909227225701, 0.05732720105676846, -0.2579290594742893, 0.10848535122823742, 0.013327822199119013, 0.016690094515570478, -0.12594027574638036, -0.15355688529426653, -0.032141102164365755, 0.0980427159649081, 0.07031815229967772, 0.042318817513274744, 0.16763386632866298, -0.1288885887933819, -0.04179377358001709, 0.4069546622978904, -0.059413771806752176, -0.11613299214351683, 0.1730015908496032, -0.21825874463540804, -0.14764689131671058, 0.07960467511117432, 0.1962208188975015, 0.13032656088886874, -0.13655407212113746, -0.008708313026562416, 0.020189203716620637, 0.23081928176589425, 0.08335575574838476, 0.06210666985621461, 0.306104339825398, 0.1804586654926259, 0.02029790404273481, 0.035747382900206764, -0.19617960068503684, -0.041709920078114394, -0.26491831257860576, -0.07043937687609746, -0.13621064361537977, 0.044000686074478976, -0.14331606293361562, -0.10097435086798512, 0.3232816235923129, 0.16298101914589566, 0.1706079949891423, 0.04014326428447514, 0.31266608677257446, 0.06824127670168031, 0.06694939658115012, 0.05398735624554543, 0.37411010335978523, 0.18499680508800598, 0.034537893176411164, -0.2425310824388382, 0.06667041737754174, 0.012644549964608618]
|
1,803.08814
|
Production of large Bose-Einstein condensates in a
magnetic-shield-compatible hybrid trap
|
We describe the production of large ${}^{23} \mathrm{Na}$ Bose-Einstein
condensates in a hybrid trap characterized by a weak magnetic field quadrupole
and a tightly focused infrared beam. The use of small magnetic field gradients
makes the trap compatible with the state-of-the-art magnetic shields. By taking
advantage of the deep cooling and high efficiency of gray molasses to improve
the initial trap loading conditions, we produce condensates composed of as much
as $7$ million atoms in less than $30 \; \mathrm{s}$.
|
cond-mat.quant-gas physics.atom-ph
|
we describe the production of large 23 mathrmna boseeinstein condensates in a hybrid trap characterized by a weak magnetic field quadrupole and a tightly focused infrared beam the use of small magnetic field gradients makes the trap compatible with the stateoftheart magnetic shields by taking advantage of the deep cooling and high efficiency of gray molasses to improve the initial trap loading conditions we produce condensates composed of as much as 7 million atoms in less than 30 mathrms
|
[['we', 'describe', 'the', 'production', 'of', 'large', '23', 'mathrmna', 'boseeinstein', 'condensates', 'in', 'a', 'hybrid', 'trap', 'characterized', 'by', 'a', 'weak', 'magnetic', 'field', 'quadrupole', 'and', 'a', 'tightly', 'focused', 'infrared', 'beam', 'the', 'use', 'of', 'small', 'magnetic', 'field', 'gradients', 'makes', 'the', 'trap', 'compatible', 'with', 'the', 'stateoftheart', 'magnetic', 'shields', 'by', 'taking', 'advantage', 'of', 'the', 'deep', 'cooling', 'and', 'high', 'efficiency', 'of', 'gray', 'molasses', 'to', 'improve', 'the', 'initial', 'trap', 'loading', 'conditions', 'we', 'produce', 'condensates', 'composed', 'of', 'as', 'much', 'as', '7', 'million', 'atoms', 'in', 'less', 'than', '30', 'mathrms']]
|
[-0.11015912880583738, 0.22769495321867558, 0.013485204371719215, 0.04633389689656607, 0.011913697647217374, -0.12084707968796675, 0.0011420424293296842, 0.3809537364122195, -0.1760167391427482, -0.3599424403733932, 0.04400236624925851, -0.22414089717830604, 0.018901468806852322, 0.20628551569564316, -0.003883053441173755, 0.03682621700975757, 0.02868197485580682, -0.019977901507025726, -0.039865624953586705, -0.24836521084683064, 0.3024992319988087, 0.08063447264952955, 0.29274368166732484, 0.050218390551610634, 0.11429371760011865, -0.02756311659975789, 0.05206493944159518, 0.013547744064663466, -0.10500181482161562, 0.10644610535998184, 0.12070054288368481, 0.049496803707323775, 0.2548780019189088, -0.4821584709943869, -0.19501824754600725, 0.09343306271311565, 0.17640832170712736, 0.14737131107503024, -0.08281721172328943, -0.2595359082572544, 0.029576662944283526, -0.1700832021351044, -0.13303338583537902, -0.10489280731566489, 0.02466697409713211, 0.0865496173262214, -0.3117430846756085, 0.0487143579357041, 0.045599742679116435, 0.13076583612769938, -0.10698304342953727, -0.12427053419061196, 0.01620070130015031, 0.01412979794594531, -0.034514726736606695, 0.08640297551830418, 0.21427819158475941, -0.17129446033579418, -0.02621301022382119, 0.38361881085886407, -0.16158372044167033, -0.07539918955164747, 0.16565621620378432, -0.1833134290153304, -0.030601031875285584, 0.2004092551815586, 0.1728843719077607, 0.11508792085955158, -0.12830066351363292, 0.002908574929162382, 0.012358169501217512, 0.1773265871571568, 0.1387180544119567, 0.057326849814182006, 0.25249690775019235, 0.22280900887189767, 0.030196638765912026, 0.2041607722401237, -0.14306975809188607, -0.05635733621266599, -0.19841273583453864, -0.11130777053917065, -0.16473358971341392, 0.04546875317986959, -0.05529168877379002, -0.12991942662465122, 0.35862910878868437, 0.13884941700663872, 0.22839289855880615, -0.04461541493685964, 0.3355119355285588, 0.07652789888939318, 0.1460007686788837, 0.04746468927567968, 0.31070615767907256, 0.1771951581005198, 0.14190597731608134, -0.24706740041549963, -0.06868377172101575, -0.006771393424759691]
|
1,803.08815
|
The role of energy conditions in $f(R)$ cosmology
|
Energy conditions can play an important role in defining the cosmological
evolution. Specifically acceleration/deceleration of cosmic fluid, as well as
the emergence of Big Rip singularities, can be related to the constraints
imposed by the energy conditions. Here we discuss this issue for $f(R)$ gravity
considering also conformal transformations. Cosmological solutions and
equations of state can be classified according to energy conditions. The
qualitative change of some energy conditions for transformations from the
Jordan frame to the Einstein frame is also observed.
|
gr-qc astro-ph.CO hep-th
|
energy conditions can play an important role in defining the cosmological evolution specifically accelerationdeceleration of cosmic fluid as well as the emergence of big rip singularities can be related to the constraints imposed by the energy conditions here we discuss this issue for fr gravity considering also conformal transformations cosmological solutions and equations of state can be classified according to energy conditions the qualitative change of some energy conditions for transformations from the jordan frame to the einstein frame is also observed
|
[['energy', 'conditions', 'can', 'play', 'an', 'important', 'role', 'in', 'defining', 'the', 'cosmological', 'evolution', 'specifically', 'accelerationdeceleration', 'of', 'cosmic', 'fluid', 'as', 'well', 'as', 'the', 'emergence', 'of', 'big', 'rip', 'singularities', 'can', 'be', 'related', 'to', 'the', 'constraints', 'imposed', 'by', 'the', 'energy', 'conditions', 'here', 'we', 'discuss', 'this', 'issue', 'for', 'fr', 'gravity', 'considering', 'also', 'conformal', 'transformations', 'cosmological', 'solutions', 'and', 'equations', 'of', 'state', 'can', 'be', 'classified', 'according', 'to', 'energy', 'conditions', 'the', 'qualitative', 'change', 'of', 'some', 'energy', 'conditions', 'for', 'transformations', 'from', 'the', 'jordan', 'frame', 'to', 'the', 'einstein', 'frame', 'is', 'also', 'observed']]
|
[-0.14175683221916055, 0.11090413747492343, -0.1127797568844427, 0.11491592594127102, -0.1005328412667462, -0.11556511499532839, -0.07094205427551414, 0.3255613521763646, -0.2868125452319296, -0.3271290830949821, 0.1264465459630961, -0.20039495604862345, -0.11002045960688009, 0.14252189117506509, -0.07186413210498668, 0.055991366255755834, 0.02088511289983261, 0.0587402732770254, -0.11976527596437712, -0.24627384270836666, 0.4021836632135801, 0.1557664098785963, 0.26013083992775804, 0.047597668587979744, 0.0752366678902834, -0.07560596609965148, 0.003045712052503737, 0.07501032003178475, -0.19173925269463257, -0.009463847129287698, 0.2562524195499264, 0.14735530892659615, 0.21892229648216105, -0.46158799008897894, -0.2416449094123048, 0.13442333677511026, 0.142376910259084, 0.13702097890626003, -0.05935333064677784, -0.29178213269063613, 0.04298369812767771, -0.11076244990136928, -0.14659551357873146, -0.06464855986215719, -0.015026028608766997, 0.019960812480393345, -0.23978549193182006, 0.11549763748828298, 0.03352342138674519, -0.01090209713069404, -0.16562523246067007, -0.023162110311138195, -0.035827152413974814, 0.11055985775140183, 0.11035432544446028, 0.002813206122415822, 0.14076392620052325, -0.1421953700908755, -0.05163366923523249, 0.4623299541815025, -0.07031209949722014, -0.22773409428688265, 0.14119569957256317, -0.07894252754304922, -0.1532716271155173, 0.041152060679273635, 0.13453841264353975, 0.0515649161278838, -0.165691240315848, 0.11500804282926455, 0.030505210536009655, 0.0888037038001618, 0.1473696161879272, 0.08050132892662432, 0.2728280135055595, 0.10288539199476562, 0.03241485603176421, 0.09515209520724034, -0.02202818775549531, -0.08390177551248088, -0.38884063473925357, -0.17682846084736834, -0.1145555232083652, 0.08609602321542674, -0.13659405695234011, -0.11526099440255543, 0.38363303281593975, 0.12064369795357711, 0.18233930167923795, -0.005686905419612985, 0.20870588749374558, 0.12630621097107395, 0.04514861937680441, 0.05572052081910575, 0.28470985159432666, 0.11622521548429732, 0.13401133062959672, -0.2432607288796046, 0.016037871186598773, 0.06924831652559521]
|
1,803.08816
|
A software for streaming processing of photometric observations
|
Software products nova.astrometry.net, SExtractor and Aladin are shown to be
used for searching for transient phenomena in series of photometric images. An
algorithm for taking into account atmospheric distortions introduced into
images during observations is pro-posed. The algorithm is based on the
correlation analysis of the series of photometric estimates of the brightness
of objects in the image field. The possibility of searching for transient
phenomena is shown to be on time intervals smaller or longer than the
observation time.
|
astro-ph.IM
|
software products novaastrometrynet sextractor and aladin are shown to be used for searching for transient phenomena in series of photometric images an algorithm for taking into account atmospheric distortions introduced into images during observations is proposed the algorithm is based on the correlation analysis of the series of photometric estimates of the brightness of objects in the image field the possibility of searching for transient phenomena is shown to be on time intervals smaller or longer than the observation time
|
[['software', 'products', 'novaastrometrynet', 'sextractor', 'and', 'aladin', 'are', 'shown', 'to', 'be', 'used', 'for', 'searching', 'for', 'transient', 'phenomena', 'in', 'series', 'of', 'photometric', 'images', 'an', 'algorithm', 'for', 'taking', 'into', 'account', 'atmospheric', 'distortions', 'introduced', 'into', 'images', 'during', 'observations', 'is', 'proposed', 'the', 'algorithm', 'is', 'based', 'on', 'the', 'correlation', 'analysis', 'of', 'the', 'series', 'of', 'photometric', 'estimates', 'of', 'the', 'brightness', 'of', 'objects', 'in', 'the', 'image', 'field', 'the', 'possibility', 'of', 'searching', 'for', 'transient', 'phenomena', 'is', 'shown', 'to', 'be', 'on', 'time', 'intervals', 'smaller', 'or', 'longer', 'than', 'the', 'observation', 'time']]
|
[-0.07300259799790816, 0.06075021973092704, -0.15239516601461586, 0.10267510928679258, -0.05584171445026428, -0.06779085399135004, -0.008078504353761673, 0.42769064117647426, -0.23555248761195927, -0.34434942229757015, 0.15941835917190567, -0.25899296509149144, -0.09048176381465849, 0.30517403302490237, -0.031860002045389975, 0.051521053620248655, 0.09120154674341784, -0.024824428666807428, -0.02033849322838308, -0.27966154932598525, 0.23290248732583574, 0.07760100805825448, 0.2455503555203352, -0.015934227511899757, 0.07789610264987885, 0.011772855078872246, -0.13991273791069472, 0.021405066139524496, -0.0928041289643019, 0.041419794700473925, 0.2298351274449614, 0.15567120288268815, 0.23370424516593355, -0.41767666760030425, -0.22342978098247013, 0.09236825924791113, 0.13768482337340335, 0.06568694157125074, -0.018983301479675915, -0.35980726080604747, 0.06884957123783571, -0.08272740122260927, -0.05620521679520607, -0.06564831944724804, 0.05867078939093206, 0.00394210149828769, -0.2976274201764336, 0.060234446862500304, 0.024155779612026636, 0.08340314314759607, -0.13085407971793525, -0.08983252492226378, 0.012320120748179623, 0.14227472419874107, 0.0628117064803933, 0.01984872952504437, 0.07571655793315908, -0.12105390468400114, -0.08687726949279703, 0.4074925223271115, -0.051398958210115725, -0.10647714989189105, 0.1422360990862539, -0.15626999899697833, -0.14562011424664267, 0.19990973712145527, 0.20673781890227588, 0.10711621904533498, -0.17583410000970848, 0.0036849447907703115, 0.03364739444436906, 0.17739235001462925, 0.03518587386801462, 0.05262551683331309, 0.23436759110492997, 0.19196881087426143, 0.05830186357297286, 0.14072057705879495, -0.20240168742057454, -0.02761075982258101, -0.23106057213359996, -0.14784729993928672, -0.18671293853162463, -0.016829015626689963, -0.08508533032451125, -0.15163682014725607, 0.43605209956582214, 0.15845424696048604, 0.1780908749132311, 0.042461502595651374, 0.31103389129290193, 0.10315869597694542, 0.1409009862573275, 0.032040883875393035, 0.2250050697239894, 0.06590242108294764, 0.07332839664731976, -0.1719088018787111, 0.10793628583108134, 0.08051314705959227]
|
1,803.08817
|
The Dynamics of Interacting Swarms
|
Swarms are self-organized dynamical coupled agents which evolve from simple
rules of communication. They are ubiquitous in nature, and be- coming more
prominent in defense applications. Here we report on a preliminary study of
swarm collisions for a swarm model in which each agent is self-propelling but
globally communicates with other agents. We generalize previous models by
investigating the interacting dynamics when delay is introduced to the
communicating agents. One of our major find- ings is that interacting swarms
are far less likely to flock cohesively if they are coupled with delay. In
addition, parameter ranges based on coupling strength, incidence angle of
collision, and delay change dramatically for other swarm interactions which
result in flocking, milling, and scattering.
|
nlin.AO
|
swarms are selforganized dynamical coupled agents which evolve from simple rules of communication they are ubiquitous in nature and be coming more prominent in defense applications here we report on a preliminary study of swarm collisions for a swarm model in which each agent is selfpropelling but globally communicates with other agents we generalize previous models by investigating the interacting dynamics when delay is introduced to the communicating agents one of our major find ings is that interacting swarms are far less likely to flock cohesively if they are coupled with delay in addition parameter ranges based on coupling strength incidence angle of collision and delay change dramatically for other swarm interactions which result in flocking milling and scattering
|
[['swarms', 'are', 'selforganized', 'dynamical', 'coupled', 'agents', 'which', 'evolve', 'from', 'simple', 'rules', 'of', 'communication', 'they', 'are', 'ubiquitous', 'in', 'nature', 'and', 'be', 'coming', 'more', 'prominent', 'in', 'defense', 'applications', 'here', 'we', 'report', 'on', 'a', 'preliminary', 'study', 'of', 'swarm', 'collisions', 'for', 'a', 'swarm', 'model', 'in', 'which', 'each', 'agent', 'is', 'selfpropelling', 'but', 'globally', 'communicates', 'with', 'other', 'agents', 'we', 'generalize', 'previous', 'models', 'by', 'investigating', 'the', 'interacting', 'dynamics', 'when', 'delay', 'is', 'introduced', 'to', 'the', 'communicating', 'agents', 'one', 'of', 'our', 'major', 'find', 'ings', 'is', 'that', 'interacting', 'swarms', 'are', 'far', 'less', 'likely', 'to', 'flock', 'cohesively', 'if', 'they', 'are', 'coupled', 'with', 'delay', 'in', 'addition', 'parameter', 'ranges', 'based', 'on', 'coupling', 'strength', 'incidence', 'angle', 'of', 'collision', 'and', 'delay', 'change', 'dramatically', 'for', 'other', 'swarm', 'interactions', 'which', 'result', 'in', 'flocking', 'milling', 'and', 'scattering']]
|
[-0.16727594567263232, 0.19527087670539608, -0.06970827291111126, 0.0010693345146504144, -0.08194590153313484, -0.2305482639706138, 0.0057436848419303655, 0.4103369813475038, -0.26530709252262313, -0.33869992007164895, 0.04307944220275532, -0.29684282181013627, -0.1866969292858193, 0.1515623748149848, -0.06169317631019639, -0.019761722080973015, 0.05709599168235514, 0.04725990929648656, 0.0709181254291359, -0.24254879393387868, 0.2964028602919909, 0.04529957969852982, 0.20194529588999494, -0.02462267960757291, 0.05621464114182261, 0.029880151997844714, 0.009404674661541436, 0.030472819867520397, -0.08998046542192319, 0.08011840275090634, 0.2417887011762112, 0.0973448360010105, 0.2741438344340114, -0.44186139158403676, -0.2256580411746096, 0.10626388263708654, 0.17532469845326037, 0.10982970589040113, -0.062433540455810135, -0.30414248765798424, 0.03304733430669338, -0.16818398204553842, -0.13349733837809757, -0.03546013355552524, 0.037297578371998645, 0.1101528456240908, -0.2469271318830487, 0.030440742192993395, 0.004710949067869654, 0.08110154680751201, -0.06189521218790915, -0.07022651945859068, -0.023604242206441566, 0.11172363533322434, 0.04211898250192279, -0.019264379619941617, 0.20340184449265172, -0.14439386511006305, -0.15390391562900999, 0.4088911083096466, 0.011480181244155, -0.18132042345207403, 0.29783306952698957, -0.09125781652102825, -0.1437126233852899, 0.1307923501287, 0.25480674887310806, 0.12404517742938229, -0.17136376424941543, 0.004166320966607539, -0.0292720020085401, 0.1914818347426828, 0.03974573962202593, 0.022800292682779187, 0.1853004399953144, 0.23034735739489376, 0.11009130231691759, 0.06886610611021018, -0.01298621843545502, -0.2229599498032334, -0.22507577306520538, -0.1000658250609491, -0.13881880975085772, 0.01572441779851851, -0.05845560130681314, -0.09275348167162106, 0.33536889516756313, 0.1813296842906808, 0.18523239999585941, 0.06860200186483092, 0.2758121620961504, 0.0829946796435221, 0.05565610375380566, 0.09444410027544789, 0.2905004106524612, 0.052969923675326366, 0.09315216827339359, -0.2125850203822459, 0.11128811449000314, -0.014595780580328042]
|
1,803.08818
|
Enumeration of super-strong Wilf equivalence classes of permutations in
the generalized factor order
|
Super-strong Wilf equivalence classes of the symmetric group ${\mathcal S}_n$
on $n$ letters, with respect to the generalized factor order, were shown by
Hadjiloucas, Michos and Savvidou (2018) to be in bijection with pyramidal
sequences of consecutive differences. In this article we enumerate the latter
by giving recursive formulae in terms of a two-dimensional analogue of
non-interval permutations. As a by-product, we obtain a recursively defined set
of representatives of super-strong Wilf equivalence classes in ${\mathcal
S}_n$. We also provide a connection between super-strong Wilf equivalence and
the geometric notion of shift equivalence---originally defined by Fidler,
Glasscock, Miceli, Pantone, and Xu (2018) for words---by showing that an
alternate way to characterize super-strong Wilf equivalence for permutations is
by keeping only rigid shifts in the definition of shift equivalence. This
allows us to fully describe shift equivalence classes for permutations of size
$n$ and enumerate them, answering the corresponding problem posed by Fidler,
Glasscock, Miceli, Pantone, and Xu (2018).
|
math.CO
|
superstrong wilf equivalence classes of the symmetric group mathcal s_n on n letters with respect to the generalized factor order were shown by hadjiloucas michos and savvidou 2018 to be in bijection with pyramidal sequences of consecutive differences in this article we enumerate the latter by giving recursive formulae in terms of a twodimensional analogue of noninterval permutations as a byproduct we obtain a recursively defined set of representatives of superstrong wilf equivalence classes in mathcal s_n we also provide a connection between superstrong wilf equivalence and the geometric notion of shift equivalenceoriginally defined by fidler glasscock miceli pantone and xu 2018 for wordsby showing that an alternate way to characterize superstrong wilf equivalence for permutations is by keeping only rigid shifts in the definition of shift equivalence this allows us to fully describe shift equivalence classes for permutations of size n and enumerate them answering the corresponding problem posed by fidler glasscock miceli pantone and xu 2018
|
[['superstrong', 'wilf', 'equivalence', 'classes', 'of', 'the', 'symmetric', 'group', 'mathcal', 's_n', 'on', 'n', 'letters', 'with', 'respect', 'to', 'the', 'generalized', 'factor', 'order', 'were', 'shown', 'by', 'hadjiloucas', 'michos', 'and', 'savvidou', '2018', 'to', 'be', 'in', 'bijection', 'with', 'pyramidal', 'sequences', 'of', 'consecutive', 'differences', 'in', 'this', 'article', 'we', 'enumerate', 'the', 'latter', 'by', 'giving', 'recursive', 'formulae', 'in', 'terms', 'of', 'a', 'twodimensional', 'analogue', 'of', 'noninterval', 'permutations', 'as', 'a', 'byproduct', 'we', 'obtain', 'a', 'recursively', 'defined', 'set', 'of', 'representatives', 'of', 'superstrong', 'wilf', 'equivalence', 'classes', 'in', 'mathcal', 's_n', 'we', 'also', 'provide', 'a', 'connection', 'between', 'superstrong', 'wilf', 'equivalence', 'and', 'the', 'geometric', 'notion', 'of', 'shift', 'equivalenceoriginally', 'defined', 'by', 'fidler', 'glasscock', 'miceli', 'pantone', 'and', 'xu', '2018', 'for', 'wordsby', 'showing', 'that', 'an', 'alternate', 'way', 'to', 'characterize', 'superstrong', 'wilf', 'equivalence', 'for', 'permutations', 'is', 'by', 'keeping', 'only', 'rigid', 'shifts', 'in', 'the', 'definition', 'of', 'shift', 'equivalence', 'this', 'allows', 'us', 'to', 'fully', 'describe', 'shift', 'equivalence', 'classes', 'for', 'permutations', 'of', 'size', 'n', 'and', 'enumerate', 'them', 'answering', 'the', 'corresponding', 'problem', 'posed', 'by', 'fidler', 'glasscock', 'miceli', 'pantone', 'and', 'xu', '2018']]
|
[-0.14201015076023335, 0.1531009391016795, -0.019645975910386207, 0.06988961150289963, -0.085268153972455, -0.0896073438917959, 0.0817011933363604, 0.33929796645183435, -0.3105740053024118, -0.34880795786103286, 0.02104883151212152, -0.2545522479973587, -0.11709391338355987, 0.15187228451304088, -0.14877231119953047, 0.015546035811008996, 0.0145429884105156, 0.01312871886103488, -0.08591382350273036, -0.28044323342550076, 0.3291962080440848, -0.0027338167774299815, 0.22755676018234516, 0.007431131726692104, 0.10224841650427374, 0.024393251603654284, -0.039702943350428975, 0.02830975464798066, -0.1675180659465286, 0.11943559380578161, 0.2634134402510938, 0.14005854709493304, 0.1897652322759494, -0.3303422678558045, -0.0552670795689044, 0.14783218594819975, 0.11729517223510817, 0.0436627353951705, -0.022009133019743624, -0.3264850958370733, 0.08752547194626158, -0.1821646738819784, -0.1110629955004432, -0.06161032135240635, 0.15243065615943233, 0.03597221508720853, -0.2708178461831532, -0.005518308774582018, 0.15757149802397516, 0.09409530692739992, 0.0015156832257661945, -0.07362087176717966, 0.03836641442154022, 0.11687444457599264, 0.0008731242747274258, 0.03665260338403334, -0.0033457139021229763, -0.021333617426529033, -0.1703357333625784, 0.35984357860284727, -0.020272814006458303, -0.17003404691087587, 0.121366955290567, -0.10959220881765054, -0.1682154358401648, 0.08726503373438257, 0.091583004983031, 0.13673433902309529, -0.1045424148040617, 0.14224951066476113, -0.16149068787842003, 0.08190645113670643, 0.2243087724551238, -0.026825555603309775, 0.12758810287773215, 0.05430675760244593, 0.07360711503952791, 0.18755759484333523, 0.06370399181791951, -0.04088019249985451, -0.30451780503973463, -0.1606072762037399, -0.08882900650400224, 0.08994250292488873, -0.05456308945225142, -0.142088325010167, 0.3648659975224773, 0.11182692799939226, 0.20283839800927037, 0.12812491274278437, 0.13717189178931594, 0.06832543877271445, 0.03020841652289995, 0.04273558232550886, 0.13950731378936806, 0.25421620688604696, -0.024933929710563376, -0.173853616082165, 0.018448699512426427, 0.2405245971514393]
|
1,803.08819
|
Phase transitions and symmetry energy in nuclear pasta
|
Cold and isospin-symmetric nuclear matter at sub-saturation densities is
known to form the so-called pasta structures, which, in turn, are known to
undergo peculiar phase transitions. Here we investigate if such pastas and
their phase changes survive in isospin asymmetric nuclear matter, and whether
the symmetry energy of such pasta configurations is connected to the isospin
content, the morphology of the pasta and to the phase transitions. We find that
indeed pastas are formed in isospin asymmetric systems with proton to neutron
ratios of x=0.3, 0.4 and 0.5, densities in the range of 0.05 1/fm$^3$<$\rho$<
0.08 1/fm$^3$, and temperatures T<2 MeV. Using tools (such as the caloric
curve, Lindemann coefficient, radial distribution function, Kolmogorov
statistic, and Euler functional) on the composition of the pasta, determined
the existence of homogeneous structures, tunnels, empty regions, cavities and
transitions among these regions. The symmetry energy was observed to attain
different values in the different phases showing its dependence on the
morphology of the nuclear matter structure.
|
nucl-th
|
cold and isospinsymmetric nuclear matter at subsaturation densities is known to form the socalled pasta structures which in turn are known to undergo peculiar phase transitions here we investigate if such pastas and their phase changes survive in isospin asymmetric nuclear matter and whether the symmetry energy of such pasta configurations is connected to the isospin content the morphology of the pasta and to the phase transitions we find that indeed pastas are formed in isospin asymmetric systems with proton to neutron ratios of x03 04 and 05 densities in the range of 005 1fm3rho 008 1fm3 and temperatures t2 mev using tools such as the caloric curve lindemann coefficient radial distribution function kolmogorov statistic and euler functional on the composition of the pasta determined the existence of homogeneous structures tunnels empty regions cavities and transitions among these regions the symmetry energy was observed to attain different values in the different phases showing its dependence on the morphology of the nuclear matter structure
|
[['cold', 'and', 'isospinsymmetric', 'nuclear', 'matter', 'at', 'subsaturation', 'densities', 'is', 'known', 'to', 'form', 'the', 'socalled', 'pasta', 'structures', 'which', 'in', 'turn', 'are', 'known', 'to', 'undergo', 'peculiar', 'phase', 'transitions', 'here', 'we', 'investigate', 'if', 'such', 'pastas', 'and', 'their', 'phase', 'changes', 'survive', 'in', 'isospin', 'asymmetric', 'nuclear', 'matter', 'and', 'whether', 'the', 'symmetry', 'energy', 'of', 'such', 'pasta', 'configurations', 'is', 'connected', 'to', 'the', 'isospin', 'content', 'the', 'morphology', 'of', 'the', 'pasta', 'and', 'to', 'the', 'phase', 'transitions', 'we', 'find', 'that', 'indeed', 'pastas', 'are', 'formed', 'in', 'isospin', 'asymmetric', 'systems', 'with', 'proton', 'to', 'neutron', 'ratios', 'of', 'x03', '04', 'and', '05', 'densities', 'in', 'the', 'range', 'of', '005', '1fm3rho', '008', '1fm3', 'and', 'temperatures', 't2', 'mev', 'using', 'tools', 'such', 'as', 'the', 'caloric', 'curve', 'lindemann', 'coefficient', 'radial', 'distribution', 'function', 'kolmogorov', 'statistic', 'and', 'euler', 'functional', 'on', 'the', 'composition', 'of', 'the', 'pasta', 'determined', 'the', 'existence', 'of', 'homogeneous', 'structures', 'tunnels', 'empty', 'regions', 'cavities', 'and', 'transitions', 'among', 'these', 'regions', 'the', 'symmetry', 'energy', 'was', 'observed', 'to', 'attain', 'different', 'values', 'in', 'the', 'different', 'phases', 'showing', 'its', 'dependence', 'on', 'the', 'morphology', 'of', 'the', 'nuclear', 'matter', 'structure']]
|
[-0.1193094692901714, 0.23350214845436457, -0.12290944649732478, 0.11914061446404729, -0.025200098143259367, -0.059871664116636455, 0.04676493909356401, 0.3828227966438112, -0.2487537253109164, -0.3452417378097117, 0.03914185772897418, -0.28249641677727866, -0.04126688638854327, 0.08348420066700417, 0.060694931438134155, 0.00572133672164838, -0.061731506837531924, 0.01941862441387039, -0.14613057071717936, -0.18071290558722433, 0.33340075706957645, 0.0194850965116009, 0.2751777614657211, 0.08829699284484926, 0.03475639244553241, -0.08746193515125124, 0.04775775063185478, -0.0033072156409891147, -0.19554751142867696, -0.011672762271231728, 0.2551654702295555, 0.02969780511006057, 0.08759867534797006, -0.4118679484159176, -0.2039309607807008, 0.15026112446860182, 0.10666711795665089, 0.06386258827490182, -0.04943374864926925, -0.27179614072607, 0.060027915896531545, -0.16673384125947766, -0.17057784979265336, -0.07690929395949128, 0.04313866938200762, 0.0661184773897553, -0.2090881654231973, 0.14879724222532642, 0.017539087401808432, 0.027139292064901885, -0.09906877020048856, -0.1838100554111103, -0.056631829809256885, 0.05387930530738437, 0.04002711659812796, 0.01254506382663623, 0.2061639224638893, -0.14907577210955275, -0.014778452881453734, 0.4116697858216581, 0.013872154969312015, -0.09549338043333414, 0.1958931412770407, -0.2053001898392316, -0.14766710526280621, 0.1723518940538121, 0.14492866246369462, 0.0889321677562482, -0.08599837764595349, 0.03464175959896741, 0.012856913138907286, 0.1773955824509638, 0.08650167563156981, 0.06206067362888101, 0.24759980801891232, 0.1505839513415623, 0.023712381055730883, 0.09271774978564361, -0.1425373056645757, -0.13770776950467215, -0.2550985327769516, -0.09765527251252681, -0.14629425720235556, 0.026893607359789545, -0.09392394129708174, -0.1652370942749212, 0.3676720159992271, 0.03450035415048002, 0.21298567573510627, -0.05691944301910347, 0.237154581109589, 0.07069324544827167, 0.054993964211851265, 0.06883205380583615, 0.25776798180860916, 0.21819491936450344, 0.08911352835408172, -0.2917370124187016, 0.07279454147349457, 0.012113487040448302]
|
1,803.0882
|
An accurate mass determination for Kepler-1655b, a moderately-irradiated
world with a significant volatile envelope
|
We present the confirmation of a small, moderately-irradiated (F = 155 +/- 7
Fearth) Neptune with a substantial gas envelope in a
P=11.8728787+/-0.0000085-day orbit about a quiet, Sun-like G0V star
Kepler-1655. Based on our analysis of the Kepler light curve, we determined
Kepler-1655b's radius to be 2.213+/-0.082 Rearth. We acquired 95
high-resolution spectra with TNG/HARPS-N, enabling us to characterize the host
star and determine an accurate mass for Kepler-1655b of 5.0+3.1/-2.8 Mearth via
Gaussian-process regression. Our mass determination excludes an Earth-like
composition with 98\% confidence. Kepler-1655b falls on the upper edge of the
evaporation valley, in the relatively sparsely occupied transition region
between rocky and gas-rich planets. It is therefore part of a population of
planets that we should actively seek to characterize further.
|
astro-ph.EP
|
we present the confirmation of a small moderatelyirradiated f 155 7 fearth neptune with a substantial gas envelope in a p11872878700000085day orbit about a quiet sunlike g0v star kepler1655 based on our analysis of the kepler light curve we determined kepler1655bs radius to be 22130082 rearth we acquired 95 highresolution spectra with tngharpsn enabling us to characterize the host star and determine an accurate mass for kepler1655b of 503128 mearth via gaussianprocess regression our mass determination excludes an earthlike composition with 98 confidence kepler1655b falls on the upper edge of the evaporation valley in the relatively sparsely occupied transition region between rocky and gasrich planets it is therefore part of a population of planets that we should actively seek to characterize further
|
[['we', 'present', 'the', 'confirmation', 'of', 'a', 'small', 'moderatelyirradiated', 'f', '155', '7', 'fearth', 'neptune', 'with', 'a', 'substantial', 'gas', 'envelope', 'in', 'a', 'p11872878700000085day', 'orbit', 'about', 'a', 'quiet', 'sunlike', 'g0v', 'star', 'kepler1655', 'based', 'on', 'our', 'analysis', 'of', 'the', 'kepler', 'light', 'curve', 'we', 'determined', 'kepler1655bs', 'radius', 'to', 'be', '22130082', 'rearth', 'we', 'acquired', '95', 'highresolution', 'spectra', 'with', 'tngharpsn', 'enabling', 'us', 'to', 'characterize', 'the', 'host', 'star', 'and', 'determine', 'an', 'accurate', 'mass', 'for', 'kepler1655b', 'of', '503128', 'mearth', 'via', 'gaussianprocess', 'regression', 'our', 'mass', 'determination', 'excludes', 'an', 'earthlike', 'composition', 'with', '98', 'confidence', 'kepler1655b', 'falls', 'on', 'the', 'upper', 'edge', 'of', 'the', 'evaporation', 'valley', 'in', 'the', 'relatively', 'sparsely', 'occupied', 'transition', 'region', 'between', 'rocky', 'and', 'gasrich', 'planets', 'it', 'is', 'therefore', 'part', 'of', 'a', 'population', 'of', 'planets', 'that', 'we', 'should', 'actively', 'seek', 'to', 'characterize', 'further']]
|
[-0.09814253591269205, 0.1309893860995674, -0.08207190676330356, 0.053056499414586664, -0.1038268753410583, -0.05618702102635455, 0.15966742453539545, 0.35530369244016974, -0.13562117450887204, -0.3682665443047881, 0.10167487246092476, -0.27824777506092296, -0.0665119866524557, 0.19683589930562967, -0.09580614131144623, -0.0009674257411721296, 0.13141031982377172, -0.032143166001852866, -0.03971415935874185, -0.2504587066422183, 0.2631933376375985, 0.0648592585015909, 0.06594599608381811, 0.002127869466286419, 0.041918947326329156, -0.04322590864779029, -0.02358822855499706, -0.0927086204839205, -0.2219801509161568, 0.10825182120606769, 0.23736160178668797, 0.1354510867885048, 0.22836247444917848, -0.33960609960195143, -0.18450316286595939, 0.08696266419013098, 0.15605892559662088, 0.019805768561387334, -0.05670773873446576, -0.2728789526736364, 0.1012459017303107, -0.2008185046808129, -0.1735555138023171, 0.013850832316425763, 0.08457516789452971, -0.05622097850261655, -0.2971431325786398, 0.08309160119720868, 0.033001434190997055, 0.13044135772023374, -0.14391244498048245, -0.12599262756495072, -0.09555760876641475, 0.09273861568362918, -0.02909075671050232, 0.04049656690663791, 0.18090207614503534, -0.057788485274483846, 0.022577161667868495, 0.3728052856666701, -0.12442545663465612, -0.0445327511954799, 0.2462356575602566, -0.2589628529884586, -0.11490832991798275, 0.16764098335157282, 0.19123117750509014, 0.15001449932710134, -0.15957145389984362, -0.016807041477087687, -0.04175676818184521, 0.2313114352333027, 0.06373778771376237, 0.014351203756794868, 0.4074060318089323, 0.2008186163729988, 0.08511033882054367, 0.07190244564117165, -0.2334596303491188, -0.03575813897935275, -0.17313863447218733, -0.13955563814969146, -0.17537899584775524, 0.04075860990581402, -0.09848254920273446, -0.13182753070058034, 0.37196536671503316, 0.13118301282936176, 0.23883085815136187, 0.05011606141176474, 0.2799459638564648, 0.0806516664888477, 0.08622625005331688, 0.11915745292000272, 0.32926843677913503, 0.18859571500797756, 0.03576061475489821, -0.23653937608885048, 0.05632654691830145, -0.015498702023510955]
|
1,803.08821
|
A topographic mechanism for arcing of dryland vegetation bands
|
Banded patterns consisting of alternating bare soil and dense vegetation have
been observed in water-limited ecosystems across the globe, often appearing
along gently sloped terrain with the stripes aligned transverse to the
elevation gradient. In many cases these vegetation bands are arced, with field
observations suggesting a link between the orientation of arcing relative to
the grade and the curvature of the underlying terrain. We modify the water
transport in the Klausmeier model of water-biomass interactions, originally
posed on a uniform hillslope, to qualitatively capture the influence of terrain
curvature on the vegetation patterns. Numerical simulations of this modified
model indicate that the vegetation bands change arcing-direction from
convex-downslope when growing on top of a ridge to convex-upslope when growing
in a valley. This behavior is consistent with observations from remote sensing
data that we present here. Model simulations show further that whether bands
grow on ridges, valleys, or both depends on the precipitation level. A survey
of three banded vegetation sites, each with a different aridity level,
indicates qualitatively similar behavior.
|
nlin.PS
|
banded patterns consisting of alternating bare soil and dense vegetation have been observed in waterlimited ecosystems across the globe often appearing along gently sloped terrain with the stripes aligned transverse to the elevation gradient in many cases these vegetation bands are arced with field observations suggesting a link between the orientation of arcing relative to the grade and the curvature of the underlying terrain we modify the water transport in the klausmeier model of waterbiomass interactions originally posed on a uniform hillslope to qualitatively capture the influence of terrain curvature on the vegetation patterns numerical simulations of this modified model indicate that the vegetation bands change arcingdirection from convexdownslope when growing on top of a ridge to convexupslope when growing in a valley this behavior is consistent with observations from remote sensing data that we present here model simulations show further that whether bands grow on ridges valleys or both depends on the precipitation level a survey of three banded vegetation sites each with a different aridity level indicates qualitatively similar behavior
|
[['banded', 'patterns', 'consisting', 'of', 'alternating', 'bare', 'soil', 'and', 'dense', 'vegetation', 'have', 'been', 'observed', 'in', 'waterlimited', 'ecosystems', 'across', 'the', 'globe', 'often', 'appearing', 'along', 'gently', 'sloped', 'terrain', 'with', 'the', 'stripes', 'aligned', 'transverse', 'to', 'the', 'elevation', 'gradient', 'in', 'many', 'cases', 'these', 'vegetation', 'bands', 'are', 'arced', 'with', 'field', 'observations', 'suggesting', 'a', 'link', 'between', 'the', 'orientation', 'of', 'arcing', 'relative', 'to', 'the', 'grade', 'and', 'the', 'curvature', 'of', 'the', 'underlying', 'terrain', 'we', 'modify', 'the', 'water', 'transport', 'in', 'the', 'klausmeier', 'model', 'of', 'waterbiomass', 'interactions', 'originally', 'posed', 'on', 'a', 'uniform', 'hillslope', 'to', 'qualitatively', 'capture', 'the', 'influence', 'of', 'terrain', 'curvature', 'on', 'the', 'vegetation', 'patterns', 'numerical', 'simulations', 'of', 'this', 'modified', 'model', 'indicate', 'that', 'the', 'vegetation', 'bands', 'change', 'arcingdirection', 'from', 'convexdownslope', 'when', 'growing', 'on', 'top', 'of', 'a', 'ridge', 'to', 'convexupslope', 'when', 'growing', 'in', 'a', 'valley', 'this', 'behavior', 'is', 'consistent', 'with', 'observations', 'from', 'remote', 'sensing', 'data', 'that', 'we', 'present', 'here', 'model', 'simulations', 'show', 'further', 'that', 'whether', 'bands', 'grow', 'on', 'ridges', 'valleys', 'or', 'both', 'depends', 'on', 'the', 'precipitation', 'level', 'a', 'survey', 'of', 'three', 'banded', 'vegetation', 'sites', 'each', 'with', 'a', 'different', 'aridity', 'level', 'indicates', 'qualitatively', 'similar', 'behavior']]
|
[-0.10526941435591104, 0.15356110485133165, -0.07993126026577743, 0.044302291701777824, -0.02745253040668476, -0.0919915822177497, 0.021680336710660303, 0.39093515676613166, -0.26719262769883384, -0.3104935371210372, 0.10454849042391112, -0.3009269184556352, -0.18317173031601966, 0.1540238865123815, -0.06033879861583462, -0.007313394408493516, 0.048197905122055615, -0.0411943404722106, -0.007617724056535187, -0.1986723440230813, 0.30175275295932147, 0.03807741150551711, 0.311475739486134, 0.06001846417953002, 0.05728836623735793, -0.03837962593064161, -0.022725611810112394, 0.05074698867842214, -0.12429163921886532, 0.08594754402424386, 0.23588218086073737, 0.032760264861105705, 0.20974521431861534, -0.467460464517844, -0.2635551070347737, 0.057638415362663474, 0.1329659958156485, 0.06307326747856316, -0.037809482064688614, -0.2708171448973288, 0.04661712120006602, -0.10689811848373298, -0.12144666232157454, 0.018297837528888226, -0.01592236299927526, 0.06586169404347977, -0.2306628017826567, 0.09990930068797532, 0.011600288286384725, 0.12217128946142922, -0.10280123451256182, -0.12543376262512912, -0.11278031576503382, 0.14261225484352255, 0.07623850569025198, -0.00412732440976886, 0.14609785720072013, -0.1401695777179606, -0.054822069059788106, 0.36689057614351345, -0.09076632670945971, -0.16840588181919183, 0.23135855216925671, -0.19226266954449028, -0.0946480959053544, 0.14341207494445884, 0.21244954538857003, 0.057708439919312134, -0.08306918545231273, 0.007730796253617224, -0.0844430963407798, 0.17026279540171466, 0.09192535679798618, -0.049836483085528016, 0.2702433162492262, 0.17008468924168813, 0.10265550453879264, 0.10683426196078198, -0.16889543632039777, -0.1025519841112174, -0.19699071408095153, -0.10757052647062094, -0.15179953609133162, -0.025434901034571678, -0.10635081396199039, -0.23405162140401642, 0.4472907208613154, 0.13544313072125955, 0.2267060720611431, 0.03939495189939429, 0.2728580794835755, 0.011014847138879753, 0.08423771963914833, 0.07349819364499564, 0.20181181709456023, 0.07755911754968811, 0.10976139649311192, -0.20378751162978181, 0.11456461332132478, -0.019396789603395366]
|
1,803.08822
|
Multifrequency behaviour of the anomalous events of PSR J0922+0638
|
PSR J0922+0638 (B0919+06) shows unexplained anomalous variations in the
on-pulse phase, where the pulse appears to episodically move to an earlier
longitude for a few tens of rotations before reverting to the usual phase for
approximately several hundred to more than a thousand rotations. These events,
where the pulse moves in phase by up to 5$^{\circ}$, have been previously
detected in observations from $\sim$300 to 2000 MHz. We present simultaneous
observations from the Effelsberg 100-m radio telescope at 1350 MHz and the
Bornim (Potsdam) station of the LOw Frequency ARray at 150 MHz. Our
observations present the first evidence for an absence of the anomalous
phase-shifting behaviour at 150 MHz. Instead, the observed intensity at the
usual pulse-phase typically decreases, often showing a pseudo-nulling feature
corresponding to the times when phase shifts are observed at 1350 MHz. The
presence of weak emission at the usual pulse-phase supports the theory that
these shifts may result from processes similar to the 'profile-absorption'
expected to operate for PSR J0814+7429 (B0809+74). A possible mechanism for
this could be intrinsic variations of the emission within the pulsar's beam
combined with absorption by expanding shells of electrons in the line of sight.
|
astro-ph.HE
|
psr j09220638 b091906 shows unexplained anomalous variations in the onpulse phase where the pulse appears to episodically move to an earlier longitude for a few tens of rotations before reverting to the usual phase for approximately several hundred to more than a thousand rotations these events where the pulse moves in phase by up to 5circ have been previously detected in observations from sim300 to 2000 mhz we present simultaneous observations from the effelsberg 100m radio telescope at 1350 mhz and the bornim potsdam station of the low frequency array at 150 mhz our observations present the first evidence for an absence of the anomalous phaseshifting behaviour at 150 mhz instead the observed intensity at the usual pulsephase typically decreases often showing a pseudonulling feature corresponding to the times when phase shifts are observed at 1350 mhz the presence of weak emission at the usual pulsephase supports the theory that these shifts may result from processes similar to the profileabsorption expected to operate for psr j08147429 b080974 a possible mechanism for this could be intrinsic variations of the emission within the pulsars beam combined with absorption by expanding shells of electrons in the line of sight
|
[['psr', 'j09220638', 'b091906', 'shows', 'unexplained', 'anomalous', 'variations', 'in', 'the', 'onpulse', 'phase', 'where', 'the', 'pulse', 'appears', 'to', 'episodically', 'move', 'to', 'an', 'earlier', 'longitude', 'for', 'a', 'few', 'tens', 'of', 'rotations', 'before', 'reverting', 'to', 'the', 'usual', 'phase', 'for', 'approximately', 'several', 'hundred', 'to', 'more', 'than', 'a', 'thousand', 'rotations', 'these', 'events', 'where', 'the', 'pulse', 'moves', 'in', 'phase', 'by', 'up', 'to', '5circ', 'have', 'been', 'previously', 'detected', 'in', 'observations', 'from', 'sim300', 'to', '2000', 'mhz', 'we', 'present', 'simultaneous', 'observations', 'from', 'the', 'effelsberg', '100m', 'radio', 'telescope', 'at', '1350', 'mhz', 'and', 'the', 'bornim', 'potsdam', 'station', 'of', 'the', 'low', 'frequency', 'array', 'at', '150', 'mhz', 'our', 'observations', 'present', 'the', 'first', 'evidence', 'for', 'an', 'absence', 'of', 'the', 'anomalous', 'phaseshifting', 'behaviour', 'at', '150', 'mhz', 'instead', 'the', 'observed', 'intensity', 'at', 'the', 'usual', 'pulsephase', 'typically', 'decreases', 'often', 'showing', 'a', 'pseudonulling', 'feature', 'corresponding', 'to', 'the', 'times', 'when', 'phase', 'shifts', 'are', 'observed', 'at', '1350', 'mhz', 'the', 'presence', 'of', 'weak', 'emission', 'at', 'the', 'usual', 'pulsephase', 'supports', 'the', 'theory', 'that', 'these', 'shifts', 'may', 'result', 'from', 'processes', 'similar', 'to', 'the', 'profileabsorption', 'expected', 'to', 'operate', 'for', 'psr', 'j08147429', 'b080974', 'a', 'possible', 'mechanism', 'for', 'this', 'could', 'be', 'intrinsic', 'variations', 'of', 'the', 'emission', 'within', 'the', 'pulsars', 'beam', 'combined', 'with', 'absorption', 'by', 'expanding', 'shells', 'of', 'electrons', 'in', 'the', 'line', 'of', 'sight']]
|
[-0.1091229988159051, 0.17162305375647058, -0.017411148547394815, 0.048033494574836993, -0.08435069220945123, -0.09046642012474815, 0.08699054716591338, 0.4431500115885316, -0.2208552256992077, -0.35473109853419804, 0.1012916065294159, -0.2993147744192542, -0.029579930019038313, 0.21580938649661255, -2.470310821310076e-05, -0.03428628143283943, 0.02689091714174628, -0.02033975095785569, -0.05877376899168295, -0.13388601300204223, 0.2087753495684196, 0.12155257700820556, 0.22274650075516775, -0.0047520479280014, 0.10526838604816728, -0.10174560528833673, -0.007740753378563058, -0.05837825838115593, -0.061778221490461666, 0.022976667503216815, 0.2530066715500071, 0.05062655949384871, 0.20474102251543735, -0.38798857411047866, -0.2170953028372133, 0.05132854091130314, 0.13823866076079924, 0.06603136046215738, 0.008500775838796786, -0.32696087183052897, 0.062276250143969404, -0.15674596249628128, -0.19107356973002174, 0.06477279863367527, 0.05078453323389379, 0.02126804247732562, -0.2147282011606895, 0.09563763711494223, 0.010509431194995545, 0.09536217582163387, -0.07494049308716724, -0.10644002996277825, 0.03287323478107092, 0.07278848135388573, 0.056805214610594415, 0.07615580679470897, 0.11676397967500934, -0.04355802188178827, -0.0959740768318401, 0.37045354728162755, -0.10344900567846736, 0.012407138897349854, 0.1864547676587214, -0.2624754425106541, -0.1647881925037784, 0.2703147910593848, 0.13544157397304296, 0.08831355242785163, -0.1300765371096536, -0.04095004472643239, 0.007709088152596307, 0.2362247214101606, 0.1221586843447867, 0.052883296444309946, 0.25940660972645535, 0.09395718406422639, 0.04511591359724276, 0.13830939956016702, -0.2580037976502982, -0.05247611160717992, -0.2521846720227162, -0.0326542671994155, -0.11586585534000234, 0.08051460578852378, -0.07905694258669622, -0.07749377282248586, 0.40387836181807346, 0.14278004618168988, 0.21853292713722922, 0.04267509341366706, 0.31076848517654765, 0.11502683295743998, 0.111390423146686, 0.08493188133765578, 0.3241352291085333, 0.1307220294540114, 0.15054821613103309, -0.19911448729799874, 0.04459023762113995, -0.051130741605466885]
|
1,803.08823
|
A high-bias, low-variance introduction to Machine Learning for
physicists
|
Machine Learning (ML) is one of the most exciting and dynamic areas of modern
research and application. The purpose of this review is to provide an
introduction to the core concepts and tools of machine learning in a manner
easily understood and intuitive to physicists. The review begins by covering
fundamental concepts in ML and modern statistics such as the bias-variance
tradeoff, overfitting, regularization, generalization, and gradient descent
before moving on to more advanced topics in both supervised and unsupervised
learning. Topics covered in the review include ensemble models, deep learning
and neural networks, clustering and data visualization, energy-based models
(including MaxEnt models and Restricted Boltzmann Machines), and variational
methods. Throughout, we emphasize the many natural connections between ML and
statistical physics. A notable aspect of the review is the use of Python
Jupyter notebooks to introduce modern ML/statistical packages to readers using
physics-inspired datasets (the Ising Model and Monte-Carlo simulations of
supersymmetric decays of proton-proton collisions). We conclude with an
extended outlook discussing possible uses of machine learning for furthering
our understanding of the physical world as well as open problems in ML where
physicists may be able to contribute. (Notebooks are available at
https://physics.bu.edu/~pankajm/MLnotebooks.html )
|
physics.comp-ph cond-mat.stat-mech cs.LG stat.ML
|
machine learning ml is one of the most exciting and dynamic areas of modern research and application the purpose of this review is to provide an introduction to the core concepts and tools of machine learning in a manner easily understood and intuitive to physicists the review begins by covering fundamental concepts in ml and modern statistics such as the biasvariance tradeoff overfitting regularization generalization and gradient descent before moving on to more advanced topics in both supervised and unsupervised learning topics covered in the review include ensemble models deep learning and neural networks clustering and data visualization energybased models including maxent models and restricted boltzmann machines and variational methods throughout we emphasize the many natural connections between ml and statistical physics a notable aspect of the review is the use of python jupyter notebooks to introduce modern mlstatistical packages to readers using physicsinspired datasets the ising model and montecarlo simulations of supersymmetric decays of protonproton collisions we conclude with an extended outlook discussing possible uses of machine learning for furthering our understanding of the physical world as well as open problems in ml where physicists may be able to contribute notebooks are available at httpsphysicsbuedupankajmmlnotebookshtml
|
[['machine', 'learning', 'ml', 'is', 'one', 'of', 'the', 'most', 'exciting', 'and', 'dynamic', 'areas', 'of', 'modern', 'research', 'and', 'application', 'the', 'purpose', 'of', 'this', 'review', 'is', 'to', 'provide', 'an', 'introduction', 'to', 'the', 'core', 'concepts', 'and', 'tools', 'of', 'machine', 'learning', 'in', 'a', 'manner', 'easily', 'understood', 'and', 'intuitive', 'to', 'physicists', 'the', 'review', 'begins', 'by', 'covering', 'fundamental', 'concepts', 'in', 'ml', 'and', 'modern', 'statistics', 'such', 'as', 'the', 'biasvariance', 'tradeoff', 'overfitting', 'regularization', 'generalization', 'and', 'gradient', 'descent', 'before', 'moving', 'on', 'to', 'more', 'advanced', 'topics', 'in', 'both', 'supervised', 'and', 'unsupervised', 'learning', 'topics', 'covered', 'in', 'the', 'review', 'include', 'ensemble', 'models', 'deep', 'learning', 'and', 'neural', 'networks', 'clustering', 'and', 'data', 'visualization', 'energybased', 'models', 'including', 'maxent', 'models', 'and', 'restricted', 'boltzmann', 'machines', 'and', 'variational', 'methods', 'throughout', 'we', 'emphasize', 'the', 'many', 'natural', 'connections', 'between', 'ml', 'and', 'statistical', 'physics', 'a', 'notable', 'aspect', 'of', 'the', 'review', 'is', 'the', 'use', 'of', 'python', 'jupyter', 'notebooks', 'to', 'introduce', 'modern', 'mlstatistical', 'packages', 'to', 'readers', 'using', 'physicsinspired', 'datasets', 'the', 'ising', 'model', 'and', 'montecarlo', 'simulations', 'of', 'supersymmetric', 'decays', 'of', 'protonproton', 'collisions', 'we', 'conclude', 'with', 'an', 'extended', 'outlook', 'discussing', 'possible', 'uses', 'of', 'machine', 'learning', 'for', 'furthering', 'our', 'understanding', 'of', 'the', 'physical', 'world', 'as', 'well', 'as', 'open', 'problems', 'in', 'ml', 'where', 'physicists', 'may', 'be', 'able', 'to', 'contribute', 'notebooks', 'are', 'available', 'at', 'httpsphysicsbuedupankajmmlnotebookshtml']]
|
[0.0062646196378615794, 0.04944708851329891, -0.09929228814789239, 0.12985885793405594, -0.14380553460046264, -0.19384654707841806, 0.01006254409160825, 0.3875338508718714, -0.3000232015968032, -0.34844713331651445, 0.08817575855802302, -0.2829181357387684, -0.16163472122195915, 0.22281725913467432, -0.09562729939232706, 0.07703325164218712, 0.10740581109397325, 0.01227186303048697, -0.06854409212276541, -0.2767766205211093, 0.281181639158791, 0.08858727109627486, 0.30732734371264725, 0.04974954949265686, 0.07520195396305614, 0.018894141163081697, -0.07389039728810325, -0.012098831329830759, -0.12349361050922002, 0.20871597689173793, 0.3654226854303244, 0.23984080972029953, 0.34550975497149544, -0.4218915395784317, -0.22166378415410512, 0.055526279861145875, 0.17224032497849584, 0.11641483006288703, -0.04115983843060808, -0.2701342450454831, 0.024058626826070056, -0.17493761267714664, -0.06365955388743536, -0.14066822897311607, -0.013177669573498448, 0.019032619073842988, -0.19879727929196866, 0.020686175170133717, 0.052129356778039565, 0.1265373446972778, -0.0014980406359080512, -0.17420546042123214, 0.07276322458541866, 0.10411734825309808, 0.06540620973220901, 0.05341285976974927, 0.1494816238367834, -0.20996928383949087, -0.181179260679031, 0.3750979021880488, -0.014296651131367868, -0.15324545976437015, 0.2520313845088072, 0.007348222380801651, -0.1796278971398595, 0.012691192598965442, 0.2557143228435793, 0.08898975351494112, -0.17231621561792784, 0.07663114463337985, 0.026221016565933057, 0.1259671548116213, -0.007498098266090161, -0.019651094247519818, 0.22681626699055957, 0.2704398038931498, -0.03326261011414355, 0.11609841255259883, -0.05785564387087547, -0.1506081672733981, -0.2770527834072709, -0.14264607829217002, -0.16476672699377326, 0.0013312561972758051, -0.051828253074754964, -0.16036449679528775, 0.3653978594847638, 0.21270859765294536, 0.175547155191565, 0.04878898477901887, 0.31861531896967943, 0.010169146734904306, 0.08319577061632388, 0.10974562414033703, 0.20468861435284386, 0.13087983685425608, 0.16270988699788055, -0.12082393279391553, 0.02128724378927313, 0.028453454313758935]
|
1,803.08824
|
The kernel of chromatic quasisymmetric functions on graphs and
hypergraphic polytopes
|
We study the chromatic symmetric function on graphs, and show that its kernel
is spanned by the modular relations. We generalize this result to the chromatic
quasisymmetric function on hypergraphic polytopes, a family of generalized
permutahedra. We use this description of the kernel of the chromatic symmetric
function to find other graph invariants that may help us tackle the tree
conjecture.
|
math.CO math.RA
|
we study the chromatic symmetric function on graphs and show that its kernel is spanned by the modular relations we generalize this result to the chromatic quasisymmetric function on hypergraphic polytopes a family of generalized permutahedra we use this description of the kernel of the chromatic symmetric function to find other graph invariants that may help us tackle the tree conjecture
|
[['we', 'study', 'the', 'chromatic', 'symmetric', 'function', 'on', 'graphs', 'and', 'show', 'that', 'its', 'kernel', 'is', 'spanned', 'by', 'the', 'modular', 'relations', 'we', 'generalize', 'this', 'result', 'to', 'the', 'chromatic', 'quasisymmetric', 'function', 'on', 'hypergraphic', 'polytopes', 'a', 'family', 'of', 'generalized', 'permutahedra', 'we', 'use', 'this', 'description', 'of', 'the', 'kernel', 'of', 'the', 'chromatic', 'symmetric', 'function', 'to', 'find', 'other', 'graph', 'invariants', 'that', 'may', 'help', 'us', 'tackle', 'the', 'tree', 'conjecture']]
|
[-0.14891738820149272, 0.05839034781379045, -0.12097244593696516, 0.11834292445660065, -0.17770607311461792, -0.0667335082028733, 0.024788755335707645, 0.3646760356963658, -0.32675115282448836, -0.2677085845135763, 0.06420162337694744, -0.2702490632674184, -0.270010133258632, 0.15602069824445444, -0.12496231149759937, 0.03137273136736275, 0.0662018612149309, 0.01568966957389331, -0.07636880657834108, -0.2636869817110519, 0.40554509791316556, -0.01337616522910959, 0.20029315447098897, 0.12279339343477345, 0.08516852869785803, 0.06488954118590375, -0.04974905482386468, 0.024220323052684792, -0.220430468782815, 0.14467118743074234, 0.2235065272963438, 0.17623562481803973, 0.19578162403624566, -0.3465452178030229, -0.13227182528248332, 0.2102044587725865, 0.07245707043187051, 0.035398063356759116, 0.02422776204136918, -0.21840577013790607, 0.08106896780492341, -0.17509783602884557, -0.18502977556839098, -0.06948637536375737, 0.015269695588418085, 0.0252565993568631, -0.24563491717362623, -0.001250217653444556, 0.11746121621614353, 0.012705649188185324, 0.018930386398827322, -0.13353752270798946, -0.006009071477551441, 0.0642674367829058, -0.06300794512231941, 0.06494723177576041, 0.014245444992709844, -0.1285607621730229, -0.16591348154012298, 0.3386063818680504, -0.024122777318612475, -0.22225409480514097, 0.12327736941334165, -0.20124593690862178, -0.20399945105624492, 0.056602210890440666, 0.18617647619093539, 0.16601198514709709, -0.04688751031873656, 0.11576716204032637, -0.17098360084241532, 0.08304270300021792, 0.1412788598844018, 0.003936190570353485, 0.13762583577486334, 0.03155252895485915, 0.11569596323199936, 0.28354474170931204, 0.030701563899695385, -0.031142259986124566, -0.2515295470423508, -0.1520515407176047, -0.23493516933722575, 0.03930611303076148, -0.1835064401763747, -0.2146851086195131, 0.4706327411666757, 0.11874541029005815, 0.1718906621433428, 0.18720604679318237, 0.21185838999074014, 0.13579069207743055, 0.10764211271965846, 0.07665613595182534, 0.13414443250684466, 0.22208999720264655, -0.02141305601193768, -0.17739998920988598, 0.04620203084587196, 0.20850669638421693]
|
1,803.08825
|
Effect of in-medium nucleon-nucleon cross section on proton-proton
momentum correlation in intermediate energy heavy-ion collision
|
The proton-proton momentum correlation function from different rapidity
regions are systematically investigated for the Au + Au collisions at different
impact parameters and different energies from 400$A$ MeV to 1500$A$ MeV in the
framework of the isospin-dependent quantum molecular dynamics model
complemented by the $Lednick\acute{y}$ and $Lyuboshitz$ analytical method. In
particular, in-medium nucleon-nucleon cross section dependence of the
correlation function is brought into focus, while the impact parameter and
energy dependence of the momentum correlation function are also explored. The
sizes of the emission source are extracted by fitting the momentum correlation
functions using the Gaussian source method. We find that the in-medium
nucleon-nucleon cross section obviously influence the proton-proton momentum
correlation function which is from the whole rapidity or projectile/target
rapidity region at smaller impact parameters, but there is no effect on the
mid-rapidity proton-proton momentum correlation function, which indicates that
the emission mechanism differs between projectile/target rapidity and
mid-rapidity protons.
|
nucl-th nucl-ex
|
the protonproton momentum correlation function from different rapidity regions are systematically investigated for the au au collisions at different impact parameters and different energies from 400a mev to 1500a mev in the framework of the isospindependent quantum molecular dynamics model complemented by the lednickacutey and lyuboshitz analytical method in particular inmedium nucleonnucleon cross section dependence of the correlation function is brought into focus while the impact parameter and energy dependence of the momentum correlation function are also explored the sizes of the emission source are extracted by fitting the momentum correlation functions using the gaussian source method we find that the inmedium nucleonnucleon cross section obviously influence the protonproton momentum correlation function which is from the whole rapidity or projectiletarget rapidity region at smaller impact parameters but there is no effect on the midrapidity protonproton momentum correlation function which indicates that the emission mechanism differs between projectiletarget rapidity and midrapidity protons
|
[['the', 'protonproton', 'momentum', 'correlation', 'function', 'from', 'different', 'rapidity', 'regions', 'are', 'systematically', 'investigated', 'for', 'the', 'au', 'au', 'collisions', 'at', 'different', 'impact', 'parameters', 'and', 'different', 'energies', 'from', '400a', 'mev', 'to', '1500a', 'mev', 'in', 'the', 'framework', 'of', 'the', 'isospindependent', 'quantum', 'molecular', 'dynamics', 'model', 'complemented', 'by', 'the', 'lednickacutey', 'and', 'lyuboshitz', 'analytical', 'method', 'in', 'particular', 'inmedium', 'nucleonnucleon', 'cross', 'section', 'dependence', 'of', 'the', 'correlation', 'function', 'is', 'brought', 'into', 'focus', 'while', 'the', 'impact', 'parameter', 'and', 'energy', 'dependence', 'of', 'the', 'momentum', 'correlation', 'function', 'are', 'also', 'explored', 'the', 'sizes', 'of', 'the', 'emission', 'source', 'are', 'extracted', 'by', 'fitting', 'the', 'momentum', 'correlation', 'functions', 'using', 'the', 'gaussian', 'source', 'method', 'we', 'find', 'that', 'the', 'inmedium', 'nucleonnucleon', 'cross', 'section', 'obviously', 'influence', 'the', 'protonproton', 'momentum', 'correlation', 'function', 'which', 'is', 'from', 'the', 'whole', 'rapidity', 'or', 'projectiletarget', 'rapidity', 'region', 'at', 'smaller', 'impact', 'parameters', 'but', 'there', 'is', 'no', 'effect', 'on', 'the', 'midrapidity', 'protonproton', 'momentum', 'correlation', 'function', 'which', 'indicates', 'that', 'the', 'emission', 'mechanism', 'differs', 'between', 'projectiletarget', 'rapidity', 'and', 'midrapidity', 'protons']]
|
[-0.043357145814725113, 0.18903076752470244, -0.17551215227237033, 0.16181550884303705, 0.008178893690413152, -0.06622843282772291, -0.03729902573348642, 0.4028958135046965, -0.22288524242893062, -0.29891253487150743, -0.12817748297465303, -0.3563688747809837, 0.026172538873920806, 0.14006443241386105, 0.139760638626047, 0.08832663239914323, 0.09161799057893105, -0.024251126502984322, -0.10219614814354369, -0.15561946590849818, 0.3800981388171047, 0.1226114131699335, 0.24984356695973634, 0.22355392584327183, 0.09332019395676235, 0.09145227816087137, -0.04022032014194301, -0.02125471946002053, -0.1421513944969164, 0.027396828725491807, 0.2528722681927076, 0.023499663019140294, 0.1864692466020984, -0.3373589934906204, -0.1674269386965644, 0.08701370880882812, 0.16000081672826968, 0.047846384181628544, -0.04391191759531155, -0.2683930106386042, 0.039860298491439364, -0.24237540690540868, -0.0953069031597959, 0.013118510097015224, 0.04830780541586796, 0.04842564771725365, -0.2656215247479361, 0.16751093437231845, -0.05136009697777363, 0.0767906168538252, -0.058915577502296174, -0.2309954322268249, -0.1058959381736115, 0.03337622488748857, 0.11629900167111758, 0.10011612053729294, 0.22437387407013534, -0.11993685361207307, -0.06196894575513574, 0.32839547822114407, 0.033783619918691735, -0.2000344156243857, 0.10294081308197656, -0.20873457666223982, -0.07405439190779056, 0.191508583368221, 0.22534468266237903, 0.1085137721594898, -0.20631842895242192, 0.0721679703323108, 0.018882433150976197, 0.23042013207388004, 0.0915723819591905, 0.10180990025166722, 0.1624285684735983, 0.1374444043210664, -0.03633660514332704, 0.08874342635573956, -0.19388788977744145, -0.1541355780057059, -0.3439910974316049, -0.03612096840828257, -0.14950907229185698, 0.013671528587458444, -0.09990318184804434, -0.06561507545599102, 0.38171595392511193, 0.10751310109954652, 0.30353780318014073, 0.005051673297776572, 0.3187315531400026, 0.13448916678551284, 0.10657322283946728, 0.09680013595486447, 0.30335488627295965, 0.13513381229932325, 0.14046923722915552, -0.2599913906915451, 0.09247448730701269, 0.04889167068128071]
|
1,803.08826
|
Asymmetric doping dependence of superconductivity between hole- and
electron-doped triangular-lattice superconductors
|
Within the framework of kinetic-energy-driven superconductivity, the
asymmetric doping dependence of superconductivity between the hole- and
electron-doped triangular-lattice superconductors has been studied. It is shown
that although the superconducting transition temperature has a dome-shaped
doping dependence for both the hole- and electron-doped triangular-lattice
superconductors, superconductivity appears over a wide doping of range in the
hole-doped case, while it only exists in a narrow range of the doping in the
electron-doped side. Moreover, the maximum superconducting transition
temperature around the optimal doping in the electron-doped triangular-lattice
superconductors is lower than that of the hole-doped counterparts. The theory
also shows that the asymmetric doping dependence of superconductivity between
the hole- and electron-doped cases may be a common feature for a doped Mott
insulator.
|
cond-mat.supr-con
|
within the framework of kineticenergydriven superconductivity the asymmetric doping dependence of superconductivity between the hole and electrondoped triangularlattice superconductors has been studied it is shown that although the superconducting transition temperature has a domeshaped doping dependence for both the hole and electrondoped triangularlattice superconductors superconductivity appears over a wide doping of range in the holedoped case while it only exists in a narrow range of the doping in the electrondoped side moreover the maximum superconducting transition temperature around the optimal doping in the electrondoped triangularlattice superconductors is lower than that of the holedoped counterparts the theory also shows that the asymmetric doping dependence of superconductivity between the hole and electrondoped cases may be a common feature for a doped mott insulator
|
[['within', 'the', 'framework', 'of', 'kineticenergydriven', 'superconductivity', 'the', 'asymmetric', 'doping', 'dependence', 'of', 'superconductivity', 'between', 'the', 'hole', 'and', 'electrondoped', 'triangularlattice', 'superconductors', 'has', 'been', 'studied', 'it', 'is', 'shown', 'that', 'although', 'the', 'superconducting', 'transition', 'temperature', 'has', 'a', 'domeshaped', 'doping', 'dependence', 'for', 'both', 'the', 'hole', 'and', 'electrondoped', 'triangularlattice', 'superconductors', 'superconductivity', 'appears', 'over', 'a', 'wide', 'doping', 'of', 'range', 'in', 'the', 'holedoped', 'case', 'while', 'it', 'only', 'exists', 'in', 'a', 'narrow', 'range', 'of', 'the', 'doping', 'in', 'the', 'electrondoped', 'side', 'moreover', 'the', 'maximum', 'superconducting', 'transition', 'temperature', 'around', 'the', 'optimal', 'doping', 'in', 'the', 'electrondoped', 'triangularlattice', 'superconductors', 'is', 'lower', 'than', 'that', 'of', 'the', 'holedoped', 'counterparts', 'the', 'theory', 'also', 'shows', 'that', 'the', 'asymmetric', 'doping', 'dependence', 'of', 'superconductivity', 'between', 'the', 'hole', 'and', 'electrondoped', 'cases', 'may', 'be', 'a', 'common', 'feature', 'for', 'a', 'doped', 'mott', 'insulator']]
|
[-0.17585674227958098, 0.17594118331643668, -0.014136895800994571, 0.06919762057883372, -0.04511168446730484, -0.2432926609950556, 0.16006736640822267, 0.38891479688550323, -0.16723437085439843, -0.20071309500119902, -0.04335611450970789, -0.40407349837343554, -0.09346728219288933, 0.19373473098640107, 0.05041559293581373, -0.009663910270199057, -0.17956495517479978, -0.033564854767327464, -0.25438576567463944, -0.2690844503577706, 0.30986671137800514, 0.025629228658296845, 0.38582280345938424, 0.13302388991405303, -0.016179018480749416, -0.014965545270622762, 0.28720648617922395, 0.05625051523142142, -0.18310063502702945, -0.01998751486597721, 0.4011204869848145, -0.1427859208250249, 0.19651683897919153, -0.3325812471183864, -0.3081132718862211, -0.030257966996686272, 0.16119978343394453, 0.1410094995170924, -0.12097103394229304, -0.24441104429900984, 0.05523179576170346, -0.15361958910703413, -0.050557242361020514, -0.042687933949377456, -0.007372437506790988, -0.06524633414598859, -0.22061814577126307, 0.12258375044849562, 0.08538102870422208, 0.10152391044130503, -0.1380635567071024, -0.12881352554637293, -0.1148824123434784, -0.046279803930573966, 0.09153163348794106, 0.09845462413254571, 0.13976276211810013, -0.09713082161224444, -0.07304915289725523, 0.3106866959821094, 0.0018699405466404567, 0.003868428913276058, 0.13001573882412074, -0.24129814840853214, -0.0623210113772676, 0.1498975378715179, 0.05024271842461726, 0.09680955330764275, -0.10697147488009093, 0.1497137430763788, -0.08978098449451187, 0.24119504139381498, 0.044791051350179904, 0.1608485903490858, 0.3016052744081937, 0.2774584150492129, 0.06677107804951311, 0.1199548685305544, -0.1389289628714323, -0.046695396996849825, -0.17119087027924612, -0.17651616444826618, -0.22575174389245403, 0.03900940158820041, -0.11270637272567054, -0.2254544660756422, 0.4021494333778531, 0.19276622771227747, 0.17474100968515702, -0.13539535822423776, 0.14742197259810313, 0.120055618872943, 0.07441696007774512, 0.06297197544654785, 0.2703038132172232, 0.17271614747414413, 0.15113443008158356, -0.3436191091737287, 0.1272533509980364, -0.01919227794547804]
|
1,803.08827
|
Cutkosky rules and perturbative unitarity in Euclidean nonlocal quantum
field theories
|
We prove the unitarity of the Euclidean nonlocal scalar field theory to all
perturbative orders in the loop expansion. The amplitudes in the Euclidean
space are calculated assuming that all the particles have purely imaginary
energies, and afterwards they are analytically continued to real energies. We
show that such amplitudes satisfy the Cutkowsky rules and that only the cut
diagrams corresponding to normal thresholds contribute to their imaginary part.
This implies that the theory is unitary. This analysis is then exported to
nonlocal gauge and gravity theories by means of Becchi-Rouet-Stora-Tyutin or
diffeomorphism invariance, and Ward identities.
|
gr-qc hep-th
|
we prove the unitarity of the euclidean nonlocal scalar field theory to all perturbative orders in the loop expansion the amplitudes in the euclidean space are calculated assuming that all the particles have purely imaginary energies and afterwards they are analytically continued to real energies we show that such amplitudes satisfy the cutkowsky rules and that only the cut diagrams corresponding to normal thresholds contribute to their imaginary part this implies that the theory is unitary this analysis is then exported to nonlocal gauge and gravity theories by means of becchirouetstoratyutin or diffeomorphism invariance and ward identities
|
[['we', 'prove', 'the', 'unitarity', 'of', 'the', 'euclidean', 'nonlocal', 'scalar', 'field', 'theory', 'to', 'all', 'perturbative', 'orders', 'in', 'the', 'loop', 'expansion', 'the', 'amplitudes', 'in', 'the', 'euclidean', 'space', 'are', 'calculated', 'assuming', 'that', 'all', 'the', 'particles', 'have', 'purely', 'imaginary', 'energies', 'and', 'afterwards', 'they', 'are', 'analytically', 'continued', 'to', 'real', 'energies', 'we', 'show', 'that', 'such', 'amplitudes', 'satisfy', 'the', 'cutkowsky', 'rules', 'and', 'that', 'only', 'the', 'cut', 'diagrams', 'corresponding', 'to', 'normal', 'thresholds', 'contribute', 'to', 'their', 'imaginary', 'part', 'this', 'implies', 'that', 'the', 'theory', 'is', 'unitary', 'this', 'analysis', 'is', 'then', 'exported', 'to', 'nonlocal', 'gauge', 'and', 'gravity', 'theories', 'by', 'means', 'of', 'becchirouetstoratyutin', 'or', 'diffeomorphism', 'invariance', 'and', 'ward', 'identities']]
|
[-0.14644188413421944, 0.20777540449610873, -0.13404232249983275, 0.12547192554726885, -0.08697651144999934, -0.09381208608586651, 0.018384012871441275, 0.3591737311508041, -0.24076978873927146, -0.22424473120675734, 0.06690634427892898, -0.28428375227546593, -0.1652508053545413, 0.10410465373570332, -0.0027290054955907785, 0.04037714395478057, 0.009008105703590749, 0.05764183454448357, -0.09490221189359242, -0.2652157954677629, 0.3369077571211771, -0.025789667347756524, 0.2224985717475647, 0.09038388987634487, 0.07766444608569145, 0.03419649221905274, -0.030430756882803205, 0.027531305541136437, -0.0928954406520764, 0.09423684914387802, 0.2218431859176538, 0.09076839994668262, 0.14091348792620315, -0.44016898683427524, -0.17621256602190746, 0.134901479682109, 0.14696292329851227, 0.10804823324724566, 0.05242562622152036, -0.287310414093857, 0.10288867560666404, -0.13784221460324866, -0.189510268218631, -0.14646591922307076, 0.012254543266559873, -0.05377329542049362, -0.2420266611588886, 0.08708705195507112, 0.024076843862227786, 0.034402731039638944, -0.06583228271726209, -0.08701259998027429, -0.055771144824878625, 0.11143986199022038, 0.10357622085465816, 0.03326384402559294, 0.12209186383400568, -0.14475582794693764, -0.11526481632730186, 0.38646275068458635, -0.042819999546433486, -0.22168447346242223, 0.15372740187255354, -0.1984160805538219, -0.14864997873276783, 0.10358584060547098, 0.08876324550268085, 0.10892110326191566, -0.1630644512285168, 0.19059586324874545, -0.0006699369005218614, 0.08744041761140882, 0.12676486937562004, 0.02454504764561231, 0.16779915148557242, -0.027984979775889467, 0.015321522701318221, 0.10587704859305329, 0.03945765616663266, -0.12669893491935605, -0.4143537473476802, -0.14706458600994665, -0.12495349503781956, 0.06110272999285371, -0.13100561470794977, -0.16867291364663592, 0.34424612278720207, 0.1339635111944517, 0.14971786634729747, 0.1110690282851768, 0.2637749332934618, 0.20513174981654933, 0.14460892284841975, 0.07256409978920904, 0.26962243670520064, 0.16650433707642756, 0.055319856840166416, -0.22957806630680958, -0.07867705358269934, 0.14859298586573763]
|
1,803.08828
|
Utility-based Downlink Pilot Assignment in Cell-Free Massive MIMO
|
We propose a strategy for orthogonal downlink pilot assignment in cell-free
massive MIMO (multiple-input multiple-output) that exploits knowledge of the
channel state information, the channel hardening degree at each user, and the
mobility conditions for the users. These elements, properly combined together,
are used to define a user pilot utility metric, which measures the user's real
need of a downlink pilot for efficient data decoding. The proposed strategy
consists in assigning orthogonal downlink pilots only to the users having a
pilot utility metric exceeding a predetermined threshold. Instead, users that
are not assigned with an orthogonal downlink pilot decode the data by using the
statistical channel state information. The utility-based approach guarantees
higher downlink net sum throughput, better support both for high-speed users
and shorter coherent intervals than prior art approaches.
|
cs.IT eess.SP math.IT
|
we propose a strategy for orthogonal downlink pilot assignment in cellfree massive mimo multipleinput multipleoutput that exploits knowledge of the channel state information the channel hardening degree at each user and the mobility conditions for the users these elements properly combined together are used to define a user pilot utility metric which measures the users real need of a downlink pilot for efficient data decoding the proposed strategy consists in assigning orthogonal downlink pilots only to the users having a pilot utility metric exceeding a predetermined threshold instead users that are not assigned with an orthogonal downlink pilot decode the data by using the statistical channel state information the utilitybased approach guarantees higher downlink net sum throughput better support both for highspeed users and shorter coherent intervals than prior art approaches
|
[['we', 'propose', 'a', 'strategy', 'for', 'orthogonal', 'downlink', 'pilot', 'assignment', 'in', 'cellfree', 'massive', 'mimo', 'multipleinput', 'multipleoutput', 'that', 'exploits', 'knowledge', 'of', 'the', 'channel', 'state', 'information', 'the', 'channel', 'hardening', 'degree', 'at', 'each', 'user', 'and', 'the', 'mobility', 'conditions', 'for', 'the', 'users', 'these', 'elements', 'properly', 'combined', 'together', 'are', 'used', 'to', 'define', 'a', 'user', 'pilot', 'utility', 'metric', 'which', 'measures', 'the', 'users', 'real', 'need', 'of', 'a', 'downlink', 'pilot', 'for', 'efficient', 'data', 'decoding', 'the', 'proposed', 'strategy', 'consists', 'in', 'assigning', 'orthogonal', 'downlink', 'pilots', 'only', 'to', 'the', 'users', 'having', 'a', 'pilot', 'utility', 'metric', 'exceeding', 'a', 'predetermined', 'threshold', 'instead', 'users', 'that', 'are', 'not', 'assigned', 'with', 'an', 'orthogonal', 'downlink', 'pilot', 'decode', 'the', 'data', 'by', 'using', 'the', 'statistical', 'channel', 'state', 'information', 'the', 'utilitybased', 'approach', 'guarantees', 'higher', 'downlink', 'net', 'sum', 'throughput', 'better', 'support', 'both', 'for', 'highspeed', 'users', 'and', 'shorter', 'coherent', 'intervals', 'than', 'prior', 'art', 'approaches']]
|
[-0.24794545169663793, 0.008044526923935725, -0.04277474228079424, 0.029446757361221747, -0.1465880747916504, -0.26176002263695797, 0.1738950131347275, 0.4141704458956614, -0.21398162415236918, -0.2486219404919343, 0.04082480361791797, -0.2590848429569306, -0.15132577417023793, 0.06633879864261351, -0.12971799553706104, 0.0767336807050209, 0.10638195101815126, 0.0794859935444218, -0.0372225517755417, -0.28967722113695676, 0.3058044023612756, 0.12417588874214251, 0.4302363733242031, -0.07456682325262605, 0.07555724331266638, 0.07144419584807207, -0.05588781259747805, -0.09890748035048938, -0.0702793520297864, 0.07809345590533646, 0.3816478908371237, 0.2861887649668537, 0.3289655982196786, -0.3874816359838343, -0.25049273673985295, 0.0816852048160295, 0.19948574007006242, 0.046199376871702724, -0.04298177169003161, -0.3104979690299405, 0.1724409439018039, -0.2514151045867066, 0.0015939706296638678, 0.030605175020528657, -0.128291689719692, 0.016748084372997227, -0.4180492886798883, 0.014783484871918691, -0.029050630620389265, 0.0765568461755241, -0.07482366555882262, -0.1621247055257834, 0.04357726263586176, 0.2023247397462091, 0.01846292384416718, -0.008154135014335732, 0.08067585871366514, -0.07677312752672734, -0.13322244135250572, 0.347677907572334, 0.009676667085279114, -0.2915213128679809, 0.13840453954500623, -0.08562021907632246, -0.07214943073576188, 0.20983527228236198, 0.2873886041689792, 0.06195377642359897, -0.21392630338882104, -0.04135571090053084, -0.021743883291714405, 0.1956706552389469, 0.10088772030070936, 0.15035903542926837, 0.16435211831312768, 0.16041123973497168, 0.15239904617592123, 0.08276717030293955, -0.11008145225070814, -0.0883432720247514, -0.20056420646586548, -0.1272473287811318, -0.22408419611814026, 0.02032484308177097, -0.11542809803286773, -0.03430604581358551, 0.37376411505157253, 0.11600651961701516, 0.07327396788399752, 0.1673310295694671, 0.43282705312772507, 0.08733633706587872, 0.07656637399336537, 0.14020553327748508, 0.1246050423818093, 0.0767892081581966, 0.14232974302180054, -0.22081276620844847, 0.06374327026712814, -0.05205952023926461]
|
1,803.08829
|
Plasma Density Structures at Comet 67P/Churyumov-Gerasimenko
|
We present Rosetta RPC case study from four events at various radial
distance, phase angle and local time from autumn 2015, just after perihelion of
comet 67P/Churyumov-Gerasimenko. Pulse like (high amplitude, up to minutes in
time) signatures are seen with several RPC instruments in the plasma density
(LAP, MIP), ion energy and flux (ICA) as well as magnetic field intensity
(MAG). Furthermore the cometocentric distance relative to the electron exobase
is seen to be a good organizing parameter for the measured plasma variations.
The closer Rosetta is to this boundary, the more pulses are measured. This is
consistent with the pulses being filaments of plasma originating from the
diamagnetic cavity boundary as predicted by simulations.
|
physics.space-ph astro-ph.EP
|
we present rosetta rpc case study from four events at various radial distance phase angle and local time from autumn 2015 just after perihelion of comet 67pchuryumovgerasimenko pulse like high amplitude up to minutes in time signatures are seen with several rpc instruments in the plasma density lap mip ion energy and flux ica as well as magnetic field intensity mag furthermore the cometocentric distance relative to the electron exobase is seen to be a good organizing parameter for the measured plasma variations the closer rosetta is to this boundary the more pulses are measured this is consistent with the pulses being filaments of plasma originating from the diamagnetic cavity boundary as predicted by simulations
|
[['we', 'present', 'rosetta', 'rpc', 'case', 'study', 'from', 'four', 'events', 'at', 'various', 'radial', 'distance', 'phase', 'angle', 'and', 'local', 'time', 'from', 'autumn', '2015', 'just', 'after', 'perihelion', 'of', 'comet', '67pchuryumovgerasimenko', 'pulse', 'like', 'high', 'amplitude', 'up', 'to', 'minutes', 'in', 'time', 'signatures', 'are', 'seen', 'with', 'several', 'rpc', 'instruments', 'in', 'the', 'plasma', 'density', 'lap', 'mip', 'ion', 'energy', 'and', 'flux', 'ica', 'as', 'well', 'as', 'magnetic', 'field', 'intensity', 'mag', 'furthermore', 'the', 'cometocentric', 'distance', 'relative', 'to', 'the', 'electron', 'exobase', 'is', 'seen', 'to', 'be', 'a', 'good', 'organizing', 'parameter', 'for', 'the', 'measured', 'plasma', 'variations', 'the', 'closer', 'rosetta', 'is', 'to', 'this', 'boundary', 'the', 'more', 'pulses', 'are', 'measured', 'this', 'is', 'consistent', 'with', 'the', 'pulses', 'being', 'filaments', 'of', 'plasma', 'originating', 'from', 'the', 'diamagnetic', 'cavity', 'boundary', 'as', 'predicted', 'by', 'simulations']]
|
[-0.07400970739292224, 0.21280494733187166, -0.0879605659486159, 0.05722533304993387, -0.00010192657456449841, -0.11534367559639656, -0.020363174072142852, 0.424240994008015, -0.22746917189139387, -0.3695577105102332, 0.1004667540455399, -0.3055511493256073, -0.01173355561559615, 0.2090793064026081, -0.051963324590748095, 0.06329722682257062, 0.06619825075461488, -0.008343628154176733, -0.053361482217745934, -0.1533511384167587, 0.20779982350118784, 0.15266200946239025, 0.19771203473210336, 0.018139397174767827, 0.07371741560814174, -0.07166712854624442, -0.012489459862547887, 0.028412257867824774, -0.10691424586124333, 0.008687567678482637, 0.23395563171690573, 0.0699826284048512, 0.18562675826251507, -0.4508669893216828, -0.21287013507731584, 0.03758216971612495, 0.09877857411401751, 0.06230463088368592, -0.024383175780657556, -0.30099264660080816, -0.0024324388769657716, -0.14970416554816715, -0.1779614152022354, 0.03556009882494159, 0.06077210952264621, 0.0385886637635691, -0.2415935078969873, 0.1049386645383809, -0.02909861833898543, 0.1025707442364048, -0.08394947311152583, -0.10301424067305481, -0.038067700141919375, 0.07354315025023306, 0.11762266225667427, 0.13587693167728898, 0.21989756196980242, -0.07367033761237626, -0.05375817795486554, 0.36777668606651864, -0.07929815673876715, -0.01273370452589639, 0.20246878177251504, -0.23135009708854815, -0.07120313526171705, 0.21055670146951858, 0.1423351758139451, 0.08600810029462952, -0.1558640881218826, -0.017044679509759273, -0.008388871694510074, 0.20250468593886067, 0.14789986028943372, 0.019164880081687284, 0.24066286385160587, 0.14512519394857404, 0.06326712748116774, 0.1287143450626425, -0.21015878699153015, -0.03268486854579786, -0.29104802236365884, -0.10727763785373258, -0.14258628224387118, -0.00021753051601674245, -0.08403965362281862, -0.10484441452983605, 0.39442544693086784, 0.14582022186166244, 0.1978702694501566, -0.014754207675223766, 0.32409985660291885, 0.09076806449877989, 0.06373642265553707, 0.08347161429853218, 0.3081670148541098, 0.12578755254533303, 0.18628971541057462, -0.21061214632354677, 0.07505073595549101, 0.0465840428682935]
|
1,803.0883
|
Formation of Terrestrial Planets
|
The past decade has seen major progress in our understanding of terrestrial
planet formation. Yet key questions remain. In this review we first address the
growth of 100 km-scale planetesimals as a consequence of dust coagulation and
concentration, with current models favoring the streaming instability.
Planetesimals grow into Mars-sized (or larger) planetary embryos by a
combination of pebble- and planetesimal accretion. Models for the final
assembly of the inner Solar System must match constraints related to the
terrestrial planets and asteroids including their orbital and compositional
distributions and inferred growth timescales. Two current models -- the
Grand-Tack and low-mass (or empty) primordial asteroid belt scenarios -- can
each match the empirical constraints but both have key uncertainties that
require further study. We present formation models for close-in super-Earths --
the closest current analogs to our own terrestrial planets despite their very
different formation histories -- and for terrestrial exoplanets in gas giant
systems. We explain why super-Earth systems cannot form in-situ but rather may
be the result of inward gas-driven migration followed by the disruption of
compact resonant chains. The Solar System is unlikely to have harbored an early
system of super-Earths; rather, Jupiter's early formation may have blocked the
ice giants' inward migration. Finally, we present a chain of events that may
explain why our Solar System looks different than more than 99\% of exoplanet
systems.
|
astro-ph.EP
|
the past decade has seen major progress in our understanding of terrestrial planet formation yet key questions remain in this review we first address the growth of 100 kmscale planetesimals as a consequence of dust coagulation and concentration with current models favoring the streaming instability planetesimals grow into marssized or larger planetary embryos by a combination of pebble and planetesimal accretion models for the final assembly of the inner solar system must match constraints related to the terrestrial planets and asteroids including their orbital and compositional distributions and inferred growth timescales two current models the grandtack and lowmass or empty primordial asteroid belt scenarios can each match the empirical constraints but both have key uncertainties that require further study we present formation models for closein superearths the closest current analogs to our own terrestrial planets despite their very different formation histories and for terrestrial exoplanets in gas giant systems we explain why superearth systems cannot form insitu but rather may be the result of inward gasdriven migration followed by the disruption of compact resonant chains the solar system is unlikely to have harbored an early system of superearths rather jupiters early formation may have blocked the ice giants inward migration finally we present a chain of events that may explain why our solar system looks different than more than 99 of exoplanet systems
|
[['the', 'past', 'decade', 'has', 'seen', 'major', 'progress', 'in', 'our', 'understanding', 'of', 'terrestrial', 'planet', 'formation', 'yet', 'key', 'questions', 'remain', 'in', 'this', 'review', 'we', 'first', 'address', 'the', 'growth', 'of', '100', 'kmscale', 'planetesimals', 'as', 'a', 'consequence', 'of', 'dust', 'coagulation', 'and', 'concentration', 'with', 'current', 'models', 'favoring', 'the', 'streaming', 'instability', 'planetesimals', 'grow', 'into', 'marssized', 'or', 'larger', 'planetary', 'embryos', 'by', 'a', 'combination', 'of', 'pebble', 'and', 'planetesimal', 'accretion', 'models', 'for', 'the', 'final', 'assembly', 'of', 'the', 'inner', 'solar', 'system', 'must', 'match', 'constraints', 'related', 'to', 'the', 'terrestrial', 'planets', 'and', 'asteroids', 'including', 'their', 'orbital', 'and', 'compositional', 'distributions', 'and', 'inferred', 'growth', 'timescales', 'two', 'current', 'models', 'the', 'grandtack', 'and', 'lowmass', 'or', 'empty', 'primordial', 'asteroid', 'belt', 'scenarios', 'can', 'each', 'match', 'the', 'empirical', 'constraints', 'but', 'both', 'have', 'key', 'uncertainties', 'that', 'require', 'further', 'study', 'we', 'present', 'formation', 'models', 'for', 'closein', 'superearths', 'the', 'closest', 'current', 'analogs', 'to', 'our', 'own', 'terrestrial', 'planets', 'despite', 'their', 'very', 'different', 'formation', 'histories', 'and', 'for', 'terrestrial', 'exoplanets', 'in', 'gas', 'giant', 'systems', 'we', 'explain', 'why', 'superearth', 'systems', 'can', 'not', 'form', 'insitu', 'but', 'rather', 'may', 'be', 'the', 'result', 'of', 'inward', 'gasdriven', 'migration', 'followed', 'by', 'the', 'disruption', 'of', 'compact', 'resonant', 'chains', 'the', 'solar', 'system', 'is', 'unlikely', 'to', 'have', 'harbored', 'an', 'early', 'system', 'of', 'superearths', 'rather', 'jupiters', 'early', 'formation', 'may', 'have', 'blocked', 'the', 'ice', 'giants', 'inward', 'migration', 'finally', 'we', 'present', 'a', 'chain', 'of', 'events', 'that', 'may', 'explain', 'why', 'our', 'solar', 'system', 'looks', 'different', 'than', 'more', 'than', '99', 'of', 'exoplanet', 'systems']]
|
[-0.1251740751186628, 0.1839698604752457, -0.06818263541521805, 0.10513001575130518, -0.08582706405935733, -0.05017480087328719, 0.03182485789444815, 0.32000503843157413, -0.20151774385931479, -0.351699192358824, 0.11017820102761963, -0.2369701773191347, -0.12001465850472116, 0.18790889673995798, -0.09250264734368054, 0.02587986349195008, 0.16847663397917464, -0.09516887664961975, -0.007820209255442023, -0.2947600413904204, 0.29867181889169886, 0.09207591467151718, 0.05724646121374699, -0.00297899378751793, 0.008337817578200636, -0.1093445832824393, -0.0004803883141499731, -0.08974880582262498, -0.20750869072446726, 0.0824768930681952, 0.21612776000964437, 0.1788232952289517, 0.23966167771545627, -0.5160241831206788, -0.2561260695389635, 0.07800562725766017, 0.22464357031788704, 0.06606742518331706, -0.07406562761093788, -0.22180684527064853, 0.07454235922762364, -0.24899896058867865, -0.1535111156881123, 0.02656840932484499, 0.08753503420423599, 0.00712669998221517, -0.24774692955399727, 0.08735457158959659, 0.12156453643896253, 0.08672492211943518, -0.15805897766498705, -0.142928743887653, -0.08466334473195532, 0.09797872343510933, 0.05385920881281185, -0.031802191205882374, 0.24303048355567516, -0.08524259552046357, -0.070163143125275, 0.43192483551409766, -0.0699570068478482, -0.03358042140693859, 0.3332341621492075, -0.2581612459621956, -0.11729861485600605, 0.1338845903531287, 0.20417515056483415, 0.1188871115675789, -0.16382825718211186, -0.036234316280614916, -0.01478999180326681, 0.15314984971536283, 0.09160402182264112, 0.037988101783722236, 0.4445695472430154, 0.20613039474550116, 0.0678057901534114, 0.04169299977365881, -0.1290692701610014, -0.10307947259851535, -0.13346440865837805, -0.14516809120024618, -0.12837919116964056, 0.029455522754537087, -0.0680789476456439, -0.12826214305797567, 0.31465913193739403, 0.16913994121970705, 0.2148911665222971, 0.025919932029481493, 0.3044774007994991, 0.04841703236428812, 0.12445416177869377, 0.08100801570374401, 0.3056043974570763, 0.09357729957819051, 0.10657480419268874, -0.23781080782254782, 0.19426723053854275, -0.03238476249034362]
|
1,803.08831
|
A structural Heath-Jarrow-Morton framework for consistent intraday,
spot, and futures electricity prices
|
In this paper we introduce a flexible HJM-type framework that allows for
consistent modelling of intraday, spot, futures, and option prices. This
framework is based on stochastic processes with economic interpretations and
consistent with the initial term structure given in the form of a price forward
curve. Furthermore, the framework allows for existing day-ahead spot price
models to be used in an HJM setting. We include several explicit examples of
classical spot price models but also show how structural models and factor
models can be formulated within the framework.
|
q-fin.MF math.PR
|
in this paper we introduce a flexible hjmtype framework that allows for consistent modelling of intraday spot futures and option prices this framework is based on stochastic processes with economic interpretations and consistent with the initial term structure given in the form of a price forward curve furthermore the framework allows for existing dayahead spot price models to be used in an hjm setting we include several explicit examples of classical spot price models but also show how structural models and factor models can be formulated within the framework
|
[['in', 'this', 'paper', 'we', 'introduce', 'a', 'flexible', 'hjmtype', 'framework', 'that', 'allows', 'for', 'consistent', 'modelling', 'of', 'intraday', 'spot', 'futures', 'and', 'option', 'prices', 'this', 'framework', 'is', 'based', 'on', 'stochastic', 'processes', 'with', 'economic', 'interpretations', 'and', 'consistent', 'with', 'the', 'initial', 'term', 'structure', 'given', 'in', 'the', 'form', 'of', 'a', 'price', 'forward', 'curve', 'furthermore', 'the', 'framework', 'allows', 'for', 'existing', 'dayahead', 'spot', 'price', 'models', 'to', 'be', 'used', 'in', 'an', 'hjm', 'setting', 'we', 'include', 'several', 'explicit', 'examples', 'of', 'classical', 'spot', 'price', 'models', 'but', 'also', 'show', 'how', 'structural', 'models', 'and', 'factor', 'models', 'can', 'be', 'formulated', 'within', 'the', 'framework']]
|
[-0.02526886725479088, 0.017841088089972913, -0.15476939506996212, 0.15606950501142217, -0.10773913549740663, -0.14800414900829115, 0.09134864376130608, 0.44405052187235167, -0.2869100622581632, -0.2652217729247353, 0.12909631586759193, -0.21643935864970476, -0.1760498442258058, 0.228417220891694, -0.1374947131648032, 0.04973146384267994, 0.033317164834484124, -0.03723744672377793, 0.03971491855820327, -0.23340593747731841, 0.28727049087409684, 0.08144875031927329, 0.26398028912587784, 0.05073428252879321, 0.13831022743847263, -0.022353103679992006, -0.03718187331399891, 0.03180280786133214, -0.16081756584941778, 0.19591050429709173, 0.2448162894058002, 0.12394927151166321, 0.28097483629015474, -0.4847026892383112, -0.2387163701226537, 0.10216185319750162, 0.04279751717760437, 0.07026167287428477, 0.0013485728394177355, -0.19831524755847588, 0.013829044662834553, -0.2582632824405766, -0.10491818954299591, -0.12992654770110432, -0.009199294612188352, 0.008479865853873532, -0.3370113304425083, 0.07538459996013964, 0.05593153009756228, 0.01736424910427814, -0.08057364668524458, -0.0890020045629713, 0.01062743409714672, 0.06654153140542997, 0.09323401781311783, -0.03707224877781413, 0.08749734299660274, -0.1048540026577336, -0.18190999846026468, 0.4058674763092834, -0.11528568886994814, -0.19821425261541029, 0.11881244932092057, -0.1054284820395909, -0.1287149206180586, 0.07647317971280787, 0.23495146032590208, 0.10494537731067519, -0.19424726284603494, 0.09020725517138692, -0.04738077548531334, 0.19354398610604026, 0.02247504568972698, -0.02361982822250784, 0.21466686649854932, 0.20184471430989465, 0.06664255438791064, 0.13990659900061952, -0.06935446639087449, -0.2047921631359652, -0.32497261084676354, -0.10431162979495659, -0.04229828919901439, -0.02204455467715357, -0.1276575517050956, -0.13231293375739892, 0.41079408353393415, 0.18680169172467287, 0.16953891713507055, 0.09915422447800135, 0.29298461887729094, 0.15762804273327582, -0.00677339874961403, 0.11818946439124058, 0.12586376394323084, 0.013053837012541428, 0.11047579068167324, -0.1344408546901423, 0.16185301751044862, 0.04265561581620674]
|
1,803.08832
|
Golden Ratio Algorithms for Variational Inequalities
|
The paper presents a fully explicit algorithm for monotone variational
inequalities. The method uses variable stepsizes that are computed using two
previous iterates as an approximation of the local Lipschitz constant without
running a linesearch. Thus, each iteration of the method requires only one
evaluation of a monotone operator $F$ and a proximal mapping $g$. The operator
$F$ need not be Lipschitz-continuous, which also makes the algorithm
interesting in the area of composite minimization where one cannot use the
descent lemma. The method exhibits an ergodic $O(1/k)$ convergence rate and
$R$-linear rate, if $F, g$ satisfy the error bound condition. We discuss
possible applications of the method to fixed point problems. We discuss
possible applications of the method to fixed point problems as well as its
different generalizations.
|
math.OC math.NA
|
the paper presents a fully explicit algorithm for monotone variational inequalities the method uses variable stepsizes that are computed using two previous iterates as an approximation of the local lipschitz constant without running a linesearch thus each iteration of the method requires only one evaluation of a monotone operator f and a proximal mapping g the operator f need not be lipschitzcontinuous which also makes the algorithm interesting in the area of composite minimization where one cannot use the descent lemma the method exhibits an ergodic o1k convergence rate and rlinear rate if f g satisfy the error bound condition we discuss possible applications of the method to fixed point problems we discuss possible applications of the method to fixed point problems as well as its different generalizations
|
[['the', 'paper', 'presents', 'a', 'fully', 'explicit', 'algorithm', 'for', 'monotone', 'variational', 'inequalities', 'the', 'method', 'uses', 'variable', 'stepsizes', 'that', 'are', 'computed', 'using', 'two', 'previous', 'iterates', 'as', 'an', 'approximation', 'of', 'the', 'local', 'lipschitz', 'constant', 'without', 'running', 'a', 'linesearch', 'thus', 'each', 'iteration', 'of', 'the', 'method', 'requires', 'only', 'one', 'evaluation', 'of', 'a', 'monotone', 'operator', 'f', 'and', 'a', 'proximal', 'mapping', 'g', 'the', 'operator', 'f', 'need', 'not', 'be', 'lipschitzcontinuous', 'which', 'also', 'makes', 'the', 'algorithm', 'interesting', 'in', 'the', 'area', 'of', 'composite', 'minimization', 'where', 'one', 'can', 'not', 'use', 'the', 'descent', 'lemma', 'the', 'method', 'exhibits', 'an', 'ergodic', 'o1k', 'convergence', 'rate', 'and', 'rlinear', 'rate', 'if', 'f', 'g', 'satisfy', 'the', 'error', 'bound', 'condition', 'we', 'discuss', 'possible', 'applications', 'of', 'the', 'method', 'to', 'fixed', 'point', 'problems', 'we', 'discuss', 'possible', 'applications', 'of', 'the', 'method', 'to', 'fixed', 'point', 'problems', 'as', 'well', 'as', 'its', 'different', 'generalizations']]
|
[-0.12308355461257373, 0.007736456041023959, -0.0914216714860626, 0.06385825427480099, -0.08971515224972205, -0.21520028273076858, 0.08014265250851393, 0.3912456885788792, -0.3430451657911835, -0.2563605106096397, 0.13843266481385647, -0.22475687277416678, -0.17418698913078437, 0.22846068594922392, -0.08814397318534149, 0.10807811681410413, 0.06859426979740807, 0.0675322419364554, -0.12857153916698988, -0.27909357174545124, 0.28806705041896813, -0.0017390032118374064, 0.2274136646639902, 0.06879824181917564, 0.15606568579728058, -0.01140055762488366, 0.006361608956615592, 0.007059197598534037, -0.11632008760899726, 0.10602743404939077, 0.23359309911706247, 0.17470812739067992, 0.3812230604830696, -0.36025407319245933, -0.15797903032092622, 0.18753115165718767, 0.14875581705682847, 0.06006575426873715, -0.05309499732702393, -0.2201302883232395, 0.08213024997231803, -0.11444234183642926, -0.14603327774233366, -0.10250777901374092, -0.04048191384924937, 0.06701828875080791, -0.35039843189667247, 0.06368959615843608, 0.09240205467375386, 0.023841028272304252, -0.043429726867416744, -0.12225712250282829, 0.005138703655314365, 0.08680424933112407, 0.05965830924263758, 0.09593815804827352, 0.14249512124012492, -0.061519118884123515, -0.1023079089625457, 0.33719606005926, -0.0956279384333265, -0.24291715921397328, 0.1373940310287542, -0.06067795777881099, -0.15555327930920865, 0.12150188275186936, 0.14243003316318378, 0.22244457093738887, -0.1390562899439603, 0.14692473711442317, -0.06063566796568244, 0.12319379721185221, 0.05039889765217496, 0.010648256070305442, 0.0631785624166012, 0.10098571383372643, 0.22536249543619594, 0.15002293883220025, -0.030746457618191954, -0.06909135673754639, -0.3560890048857807, -0.14229831886306304, -0.2078651498024922, 0.011886005770178627, -0.1419247493340522, -0.18127139377617096, 0.3567252934426647, 0.1321852331721159, 0.17453538869731416, 0.12131872023870922, 0.30300875224692875, 0.15444887463497936, 0.04372610368895843, 0.11716577925452197, 0.17553525124207253, 0.1409658290763465, 0.05348658146943117, -0.21368763544019168, 0.07359448341696068, 0.19923115300029054]
|
1,803.08833
|
Gaussian and exponential lateral connectivity on distributed spiking
neural network simulation
|
We measured the impact of long-range exponentially decaying intra-areal
lateral connectivity on the scaling and memory occupation of a distributed
spiking neural network simulator compared to that of short-range Gaussian
decays. While previous studies adopted short-range connectivity, recent
experimental neurosciences studies are pointing out the role of longer-range
intra-areal connectivity with implications on neural simulation platforms.
Two-dimensional grids of cortical columns composed by up to 11 M point-like
spiking neurons with spike frequency adaption were connected by up to 30 G
synapses using short- and long-range connectivity models. The MPI processes
composing the distributed simulator were run on up to 1024 hardware cores,
hosted on a 64 nodes server platform. The hardware platform was a cluster of
IBM NX360 M5 16-core compute nodes, each one containing two Intel Xeon Haswell
8-core E5-2630 v3 processors, with a clock of 2.40 G Hz, interconnected through
an InfiniBand network, equipped with 4x QDR switches.
|
cs.DC cs.NE q-bio.NC
|
we measured the impact of longrange exponentially decaying intraareal lateral connectivity on the scaling and memory occupation of a distributed spiking neural network simulator compared to that of shortrange gaussian decays while previous studies adopted shortrange connectivity recent experimental neurosciences studies are pointing out the role of longerrange intraareal connectivity with implications on neural simulation platforms twodimensional grids of cortical columns composed by up to 11 m pointlike spiking neurons with spike frequency adaption were connected by up to 30 g synapses using short and longrange connectivity models the mpi processes composing the distributed simulator were run on up to 1024 hardware cores hosted on a 64 nodes server platform the hardware platform was a cluster of ibm nx360 m5 16core compute nodes each one containing two intel xeon haswell 8core e52630 v3 processors with a clock of 240 g hz interconnected through an infiniband network equipped with 4x qdr switches
|
[['we', 'measured', 'the', 'impact', 'of', 'longrange', 'exponentially', 'decaying', 'intraareal', 'lateral', 'connectivity', 'on', 'the', 'scaling', 'and', 'memory', 'occupation', 'of', 'a', 'distributed', 'spiking', 'neural', 'network', 'simulator', 'compared', 'to', 'that', 'of', 'shortrange', 'gaussian', 'decays', 'while', 'previous', 'studies', 'adopted', 'shortrange', 'connectivity', 'recent', 'experimental', 'neurosciences', 'studies', 'are', 'pointing', 'out', 'the', 'role', 'of', 'longerrange', 'intraareal', 'connectivity', 'with', 'implications', 'on', 'neural', 'simulation', 'platforms', 'twodimensional', 'grids', 'of', 'cortical', 'columns', 'composed', 'by', 'up', 'to', '11', 'm', 'pointlike', 'spiking', 'neurons', 'with', 'spike', 'frequency', 'adaption', 'were', 'connected', 'by', 'up', 'to', '30', 'g', 'synapses', 'using', 'short', 'and', 'longrange', 'connectivity', 'models', 'the', 'mpi', 'processes', 'composing', 'the', 'distributed', 'simulator', 'were', 'run', 'on', 'up', 'to', '1024', 'hardware', 'cores', 'hosted', 'on', 'a', '64', 'nodes', 'server', 'platform', 'the', 'hardware', 'platform', 'was', 'a', 'cluster', 'of', 'ibm', 'nx360', 'm5', '16core', 'compute', 'nodes', 'each', 'one', 'containing', 'two', 'intel', 'xeon', 'haswell', '8core', 'e52630', 'v3', 'processors', 'with', 'a', 'clock', 'of', '240', 'g', 'hz', 'interconnected', 'through', 'an', 'infiniband', 'network', 'equipped', 'with', '4x', 'qdr', 'switches']]
|
[-0.22421316626636933, 0.11512088283906148, 0.029513530703261494, -0.026947447769343852, -0.033853891864418985, -0.23776572378973165, 0.058500535088436056, 0.44070260792349775, -0.19353906761234005, -0.3588879945812126, 0.04347450546609859, -0.31737367834895847, -0.1206231231490771, 0.1871812477723385, 0.024716509928305944, 0.07225707150840512, 0.09541622443124652, 0.03547458019418021, -0.004341782702443501, -0.28063758958131074, 0.182884796250922, 0.07338371533900499, 0.27654707892177005, -0.008970156762128074, 0.0637951077412193, -0.07734394549508579, 0.0075540865398943426, -0.06499019674491137, -0.03479118988174984, 0.10515950009382019, 0.1925892594692656, 0.07500145006536817, 0.2870671269235512, -0.5368905691305796, -0.15310632839178046, 0.064310500966385, 0.1420664811770742, -0.02127751978812739, -0.001903811835994323, -0.34274522710591554, 0.11090169567537184, -0.23183532608284926, -0.04255707404265801, -0.03694131101792057, 0.04362612024570505, 0.09661493175624249, -0.23390015366176764, 0.03406002396407227, -0.019729343575115004, 0.0891510731523158, 0.010716631265046695, -0.11873419933952391, 0.01166455634869635, 0.10858020154759288, -0.07689165725605562, 0.09108262620555858, 0.24581978137604893, -0.06961025031846171, -0.18560965038836003, 0.29467986644245686, -0.007681509886557857, -0.12746312244484823, 0.20809512906630212, -0.0341188980701069, -0.16443534011021257, 0.08414100548252464, 0.22646392897392312, -0.016417560573706094, -0.15435289192091053, 0.04932345304560537, 0.03411760160078605, 0.2632778941327706, 0.06646628783705334, 0.010539975836582016, 0.1701380676931391, 0.2986032658776579, 0.0068500392915060125, 0.14135532276627297, -0.12448647237402231, -0.12317969386776288, -0.197848163403105, -0.07751373877671237, -0.19888406123345098, 0.057953759448913233, -0.14811803595143525, -0.13601989475389323, 0.38583457242464647, 0.11915820873032014, 0.16007428073867536, 0.12505847413713733, 0.2976870106412874, -0.021281722478258113, 0.20854017799254507, 0.1782662482528637, 0.11089245370433977, 0.14298729161111018, 0.14803509261924774, -0.18474432994922002, 0.005066651868789147, -0.018396197703356543]
|
1,803.08834
|
What Do We Understand About Convolutional Networks?
|
This document will review the most prominent proposals using multilayer
convolutional architectures. Importantly, the various components of a typical
convolutional network will be discussed through a review of different
approaches that base their design decisions on biological findings and/or sound
theoretical bases. In addition, the different attempts at understanding
ConvNets via visualizations and empirical studies will be reviewed. The
ultimate goal is to shed light on the role of each layer of processing involved
in a ConvNet architecture, distill what we currently understand about ConvNets
and highlight critical open problems.
|
cs.CV
|
this document will review the most prominent proposals using multilayer convolutional architectures importantly the various components of a typical convolutional network will be discussed through a review of different approaches that base their design decisions on biological findings andor sound theoretical bases in addition the different attempts at understanding convnets via visualizations and empirical studies will be reviewed the ultimate goal is to shed light on the role of each layer of processing involved in a convnet architecture distill what we currently understand about convnets and highlight critical open problems
|
[['this', 'document', 'will', 'review', 'the', 'most', 'prominent', 'proposals', 'using', 'multilayer', 'convolutional', 'architectures', 'importantly', 'the', 'various', 'components', 'of', 'a', 'typical', 'convolutional', 'network', 'will', 'be', 'discussed', 'through', 'a', 'review', 'of', 'different', 'approaches', 'that', 'base', 'their', 'design', 'decisions', 'on', 'biological', 'findings', 'andor', 'sound', 'theoretical', 'bases', 'in', 'addition', 'the', 'different', 'attempts', 'at', 'understanding', 'convnets', 'via', 'visualizations', 'and', 'empirical', 'studies', 'will', 'be', 'reviewed', 'the', 'ultimate', 'goal', 'is', 'to', 'shed', 'light', 'on', 'the', 'role', 'of', 'each', 'layer', 'of', 'processing', 'involved', 'in', 'a', 'convnet', 'architecture', 'distill', 'what', 'we', 'currently', 'understand', 'about', 'convnets', 'and', 'highlight', 'critical', 'open', 'problems']]
|
[-0.07328223147843448, 0.06475323749085267, -0.06969373801516163, 0.06629066890519526, -0.10773547898667554, -0.17392694397001632, 0.023499589268532066, 0.44365306538012295, -0.2482955488596215, -0.27000478412955997, 0.10339689146365143, -0.2630955712093661, -0.2487481488328841, 0.203403317126342, -0.08965491402583818, 0.065695650188718, 0.1283396343079706, 0.027795755138827694, -0.06770005120347883, -0.28544030603435305, 0.32987763193280745, 0.0939584194475578, 0.36336948502187927, 0.06837830694599284, 0.052678858343925744, -0.06707230332928399, -0.10030915501217047, -0.047074366160409734, -0.13447943076066116, 0.20786514314305451, 0.3370163164075671, 0.18308197362865838, 0.3363447402914365, -0.5083862208036913, -0.24998685800366932, 0.021856364483634632, 0.1755338678563324, 0.09391797642327017, -0.015623986852976184, -0.2740649469714198, 0.09084078404250451, -0.11437413679021928, -0.06998643170421322, -0.09064164707023237, -0.026442998820372546, 0.0075610456839462535, -0.1709664524325894, -0.05323311561304662, 0.07343567134553773, 0.06636889493092894, -0.030973809334035547, -0.16067319024975102, 0.043785903746417415, 0.1778613425170382, 0.01695997509846671, 0.043929104315530924, 0.17566953398701218, -0.19945068423274076, -0.1525504454349478, 0.3565127097794579, -0.007000322898642885, -0.1737678983559211, 0.2118637756858435, -0.047841245161059004, -0.1867231245359613, 0.026780427164501613, 0.2469470239761803, 0.07155388539863958, -0.1856470784275896, -0.04415735623980355, -0.005024316754295594, 0.16392218712070544, 0.03620724395279669, 0.07012512046429846, 0.2775444986919562, 0.30118109466113513, -0.04133093246693736, 0.12389448040630668, -0.07890058649807341, -0.09990928916571042, -0.26034342478960754, -0.11893200493521161, -0.12801526995479232, 0.017168602099021275, -0.0802501341997413, -0.07524235013406724, 0.44094089394331804, 0.25596947521715063, 0.20048568936892683, 0.001957137693857981, 0.34404152199212046, 0.0013372990302741527, 0.11567825672682375, 0.04654433108193593, 0.2321016775858071, 0.09510795934539702, 0.14822409039156303, -0.14097683165325886, 0.1003837205754179, 0.010361889322909216]
|
1,803.08835
|
Magnetization distribution in a spin ladder-shaped quantum nanomagnet
|
The quantum nanomagnets show interesting site-dependent magnetic properties
as a function of the temperature and the external magnetic field. In the paper
we present the results of calculations for a finite quantum spin ladder with
two legs, consisting of 12 spins $S=1/2$. We describe our system with isotropic
quantum Heisenberg model and perform exact numerical diagonalization of the
Hamiltonian to use canonical ensemble approach. Our analysis focuses on the
site-dependent magnetization in the system, presenting magnetization
distributions for various interaction parameters. We discuss extensively the
temperature and magnetic field dependences of individual site magnetizations.
The interesting behaviour, with pronounced non-uniformity of magnetization
across the ladder, is found.
|
cond-mat.mes-hall cond-mat.stat-mech cond-mat.str-el
|
the quantum nanomagnets show interesting sitedependent magnetic properties as a function of the temperature and the external magnetic field in the paper we present the results of calculations for a finite quantum spin ladder with two legs consisting of 12 spins s12 we describe our system with isotropic quantum heisenberg model and perform exact numerical diagonalization of the hamiltonian to use canonical ensemble approach our analysis focuses on the sitedependent magnetization in the system presenting magnetization distributions for various interaction parameters we discuss extensively the temperature and magnetic field dependences of individual site magnetizations the interesting behaviour with pronounced nonuniformity of magnetization across the ladder is found
|
[['the', 'quantum', 'nanomagnets', 'show', 'interesting', 'sitedependent', 'magnetic', 'properties', 'as', 'a', 'function', 'of', 'the', 'temperature', 'and', 'the', 'external', 'magnetic', 'field', 'in', 'the', 'paper', 'we', 'present', 'the', 'results', 'of', 'calculations', 'for', 'a', 'finite', 'quantum', 'spin', 'ladder', 'with', 'two', 'legs', 'consisting', 'of', '12', 'spins', 's12', 'we', 'describe', 'our', 'system', 'with', 'isotropic', 'quantum', 'heisenberg', 'model', 'and', 'perform', 'exact', 'numerical', 'diagonalization', 'of', 'the', 'hamiltonian', 'to', 'use', 'canonical', 'ensemble', 'approach', 'our', 'analysis', 'focuses', 'on', 'the', 'sitedependent', 'magnetization', 'in', 'the', 'system', 'presenting', 'magnetization', 'distributions', 'for', 'various', 'interaction', 'parameters', 'we', 'discuss', 'extensively', 'the', 'temperature', 'and', 'magnetic', 'field', 'dependences', 'of', 'individual', 'site', 'magnetizations', 'the', 'interesting', 'behaviour', 'with', 'pronounced', 'nonuniformity', 'of', 'magnetization', 'across', 'the', 'ladder', 'is', 'found']]
|
[-0.1889127705629184, 0.17962667783374123, -0.009795850543218238, 0.035770670198574314, -0.027463973290939754, -0.1059502864639475, 0.011231639501899829, 0.4166490823448261, -0.216113890573452, -0.3152486006337627, 0.01618319937837458, -0.28519882532445906, -0.11881804436001335, 0.20839880216675244, 0.1151854575428868, 0.015938436812677672, 0.02348794407759593, 0.05941185271193352, -0.1234155165066368, -0.2147631039059608, 0.29585470456320456, 0.01698286251804713, 0.29027519764152365, 0.04448457476552402, 0.09414772564005629, 0.07139432978616139, 0.09512584912373084, 0.04225028605770459, -0.17005116715330945, 0.05601654791003354, 0.17903260078997063, -0.04594159224201168, 0.17015888919253078, -0.4427707038436816, -0.17576752505787413, 0.015802305030732232, 0.13608592371108166, 0.18206633444631767, -0.03866017194329892, -0.2775573381440383, -0.008611986400678135, -0.1640110429480811, -0.17035692126847038, -0.1476232624551821, -0.02892863143574899, 0.05718831795868333, -0.2586140342613804, 0.09495275594276663, 0.08018186692122335, 0.14535277124615897, -0.08840057840048571, -0.12657850403904428, -0.02093546200547994, 0.10103381306768577, 0.05344782940821426, 0.03094521951295923, 0.16168534234775422, -0.09154508414321413, -0.14500725259525685, 0.3139968329309442, -0.05098721754702382, -0.16386998795999963, 0.14747047267210123, -0.1866255213798102, -0.13752089308522572, 0.0473936660667864, 0.10131552612635299, 0.10049035826645722, -0.15746055393714772, 0.12033973489594255, -0.011688565957212002, 0.15401652620052136, -0.043356753931441734, 0.04637546285934677, 0.22747433565939976, 0.18037037629303393, 0.020570966027781506, 0.23870363924869936, -0.1288039669433661, -0.17268659590491067, -0.25829939979398364, -0.1411278404188821, -0.20912972250822756, 0.09661022628653168, -0.13451252590005927, -0.2032766575080769, 0.4361564601493007, 0.21437462107452485, 0.18539895967658715, -0.016083417732592795, 0.2757889512734853, 0.10013449305307259, 0.01724850959101013, 0.06436517391197175, 0.20136135132443683, 0.22132660250318734, 0.10697505394188321, -0.3285046027337906, 0.005450509149128589, 0.02288407647642786]
|
1,803.08836
|
Decentralized Pure Exchange Processes on Networks
|
We define a class of pure exchange Edgeworth trading processes that under
minimal assumptions converge to a stable set in the space of allocations, and
characterise the Pareto set of these processes. Choosing a specific process
belonging to this class, that we define fair trading, we analyse the trade
dynamics between agents located on a weighted network. We determine the
conditions under which there always exists a one-to-one map between the set of
networks and the set of limit points of the dynamics. This result is used to
understand what is the effect of the network topology on the trade dynamics and
on the final allocation. We find that the positions in the network affect the
distribution of the utility gains, given the initial allocations
|
econ.EM cs.GT
|
we define a class of pure exchange edgeworth trading processes that under minimal assumptions converge to a stable set in the space of allocations and characterise the pareto set of these processes choosing a specific process belonging to this class that we define fair trading we analyse the trade dynamics between agents located on a weighted network we determine the conditions under which there always exists a onetoone map between the set of networks and the set of limit points of the dynamics this result is used to understand what is the effect of the network topology on the trade dynamics and on the final allocation we find that the positions in the network affect the distribution of the utility gains given the initial allocations
|
[['we', 'define', 'a', 'class', 'of', 'pure', 'exchange', 'edgeworth', 'trading', 'processes', 'that', 'under', 'minimal', 'assumptions', 'converge', 'to', 'a', 'stable', 'set', 'in', 'the', 'space', 'of', 'allocations', 'and', 'characterise', 'the', 'pareto', 'set', 'of', 'these', 'processes', 'choosing', 'a', 'specific', 'process', 'belonging', 'to', 'this', 'class', 'that', 'we', 'define', 'fair', 'trading', 'we', 'analyse', 'the', 'trade', 'dynamics', 'between', 'agents', 'located', 'on', 'a', 'weighted', 'network', 'we', 'determine', 'the', 'conditions', 'under', 'which', 'there', 'always', 'exists', 'a', 'onetoone', 'map', 'between', 'the', 'set', 'of', 'networks', 'and', 'the', 'set', 'of', 'limit', 'points', 'of', 'the', 'dynamics', 'this', 'result', 'is', 'used', 'to', 'understand', 'what', 'is', 'the', 'effect', 'of', 'the', 'network', 'topology', 'on', 'the', 'trade', 'dynamics', 'and', 'on', 'the', 'final', 'allocation', 'we', 'find', 'that', 'the', 'positions', 'in', 'the', 'network', 'affect', 'the', 'distribution', 'of', 'the', 'utility', 'gains', 'given', 'the', 'initial', 'allocations']]
|
[-0.13871998135745525, 0.04875900587439537, -0.11354455481469632, 0.09615224287899037, -0.03597443541698158, -0.07983049948886037, 0.14418479407578708, 0.38780435337498786, -0.31330842155218125, -0.24647288033366202, 0.07853456091694534, -0.2539663008376956, -0.14460967219807208, 0.128860235132277, -0.07010930728539824, -0.0041171865910291676, 0.05912255125911906, 0.04419282171502709, -0.018591311661526562, -0.2645355837419629, 0.3794751426130533, 0.036542784808203575, 0.32336290331929923, 0.009978775317780674, 0.12994155071675778, -0.018470493197441103, 0.003571699321269989, 0.009545656119240449, -0.17583595078339567, 0.13197570786997675, 0.23217646273970605, 0.16792947543226183, 0.3016369661837816, -0.40439207914471625, -0.1471796017587185, 0.21717195627093316, 0.04908802561461925, 0.0367013893770054, 0.028225760224275292, -0.2263549744784832, 0.08933685536775739, -0.1566070478428155, -0.10664223761856556, -0.06318485723808408, 0.005412097338587046, 0.055202872699126604, -0.3201087127253413, -0.012515040978789329, 0.03320697381347418, 0.01735868725925684, -0.07133538297750056, -0.05225007132813334, -0.04671085825376212, 0.19166791472956538, 0.023999541867291554, -0.017347161129117012, 0.12969060320407153, -0.12850933772698045, -0.12413889057934284, 0.38147282341867683, -0.044762739092111585, -0.24818860633671283, 0.17376684730499983, -0.15138801293820142, -0.13807103448361158, 0.08462487626075745, 0.2014808962121606, 0.09628677287697793, -0.15138758819177747, 0.04656722492584959, -0.0951793475523591, 0.1364343966692686, 0.0832976539582014, 0.0363606618437916, 0.1760206115320325, 0.1910985332839191, 0.14763478288426995, 0.15950373850762845, -0.06125282161124051, -0.17299000677838922, -0.32731803493946793, -0.10051563827693462, -0.1667377372905612, 0.05623679121024907, -0.11002444996277336, -0.18370218794792892, 0.40716653457656504, 0.15722307128470855, 0.19370821772515773, 0.09738209080789238, 0.20625551783200352, 0.1072937207412906, 0.012536223024129867, 0.12608438757061957, 0.205486360039562, 0.05264723893254995, 0.08118976244702936, -0.23096330026350914, 0.12284748581796885, 0.02048723741620779]
|
1,803.08837
|
Emergent universal dynamics for an atomic cloud coupled to an optical
wave-guide
|
We study the dynamics of a single collective excitation in a cold ensemble of
atoms coupled to a one-dimensional waveguide. The coupling between the atoms
and the photonic modes provides a coherent and a dissipative dynamics for this
collective excitation. While the dissipative part accounts for the collectively
enhanced and directed emission of photons, we find a remarkable universal
dynamics for increasing atom numbers exhibiting several revivals under the
coherent part. While this phenomenon provides a limit on the intrinsic
dephasing for such a collective excitation, a setup is presented, where this
remarkable universal dynamics can be explored.
|
quant-ph physics.atom-ph
|
we study the dynamics of a single collective excitation in a cold ensemble of atoms coupled to a onedimensional waveguide the coupling between the atoms and the photonic modes provides a coherent and a dissipative dynamics for this collective excitation while the dissipative part accounts for the collectively enhanced and directed emission of photons we find a remarkable universal dynamics for increasing atom numbers exhibiting several revivals under the coherent part while this phenomenon provides a limit on the intrinsic dephasing for such a collective excitation a setup is presented where this remarkable universal dynamics can be explored
|
[['we', 'study', 'the', 'dynamics', 'of', 'a', 'single', 'collective', 'excitation', 'in', 'a', 'cold', 'ensemble', 'of', 'atoms', 'coupled', 'to', 'a', 'onedimensional', 'waveguide', 'the', 'coupling', 'between', 'the', 'atoms', 'and', 'the', 'photonic', 'modes', 'provides', 'a', 'coherent', 'and', 'a', 'dissipative', 'dynamics', 'for', 'this', 'collective', 'excitation', 'while', 'the', 'dissipative', 'part', 'accounts', 'for', 'the', 'collectively', 'enhanced', 'and', 'directed', 'emission', 'of', 'photons', 'we', 'find', 'a', 'remarkable', 'universal', 'dynamics', 'for', 'increasing', 'atom', 'numbers', 'exhibiting', 'several', 'revivals', 'under', 'the', 'coherent', 'part', 'while', 'this', 'phenomenon', 'provides', 'a', 'limit', 'on', 'the', 'intrinsic', 'dephasing', 'for', 'such', 'a', 'collective', 'excitation', 'a', 'setup', 'is', 'presented', 'where', 'this', 'remarkable', 'universal', 'dynamics', 'can', 'be', 'explored']]
|
[-0.18440395155541447, 0.22557352998826122, -0.0821550634917708, 0.04491294049705398, 0.008373292319818723, -0.12856055845088343, 0.04674330603673446, 0.37224300925106724, -0.263481121795366, -0.22814976308038648, -0.009313620205217858, -0.2769080709894093, -0.12609437952882477, 0.19456491474898494, 0.04527298885169534, 0.0260875241602866, 0.04606089365849157, 0.011929321749021813, 0.006498582200242245, -0.10911277539990082, 0.273262468252179, 0.0520403074847216, 0.2958222045753227, 0.06124501769152964, 0.14226539282850464, 0.003737360253283868, 0.07087740083985335, -0.008892746355945282, -0.09388707225610103, 0.11732107622320859, 0.21751612425800793, -0.001114414819535248, 0.27164794766933337, -0.4267624819803299, -0.24723551520241463, 0.07748066657697972, 0.18234915943989738, 0.21571648057683238, -0.06876109747277877, -0.29302172493949835, -0.057136915006427744, -0.1540151870600423, -0.14317234348961894, -0.08317571131949675, 0.056665084923484495, 0.017518080030900558, -0.2712775367141074, 0.07582952647602983, 0.09817393677373303, 0.06135096359161698, -0.024722067895820554, 0.021266866812710554, 0.0068910320061354, 0.07728034773442362, -0.04691111301404557, -0.0365469278981529, 0.16755947091483644, -0.14514744422179932, -0.11863937991557225, 0.41843997211936784, -0.11586214282682963, -0.16159892679540777, 0.20419247063085894, -0.13937125817815565, -0.09928954729444481, 0.14819642535543867, 0.1522285431072268, 0.09318375539946921, -0.1239607511088252, 0.01505122205292407, -0.059277597643739105, 0.1867462132783602, 0.02666933082842401, 0.14095252822866017, 0.23307113944343766, 0.22447325758712025, 0.023901563226863057, 0.2098313278212136, -0.06593102531517114, -0.14535969697243098, -0.29063457024416756, -0.14492709561944844, -0.16529874339205575, 0.0933344125823707, -0.03441327915254301, -0.13737174458991813, 0.4578588673730894, 0.09716663912071713, 0.20094010817381192, -0.008861324227205952, 0.2727869799816791, 0.14290758358238606, 0.04345354084465243, 0.03894770784512618, 0.2856287936245243, 0.15851422374573898, 0.0717710290812146, -0.32821860037772554, 0.001367929225255336, -0.03646375049067167]
|
1,803.08838
|
Efficient Terahertz Generation Using Fe/Pt Spintronic Emitters Pumped at
Different Wavelengths
|
Recent studies in spintronics have highlighted ultrathin magnetic metallic
multilayers as a novel and very promising class of broadband terahertz
radiation sources. Such spintronic multilayers consist of ferromagnetic (FM)
and non-magnetic (NM) thin films. When triggered by ultrafast laser pulses,
they generate pulsed THz radiation due to the inverse spin-Hall effect, a
mechanism that converts optically driven spin currents from the magnetized FM
layer into transient transverse charge currents in the NM layer, resulting in
THz emission. As THz emitters, FM/NM multilayers have been intensively
investigated so far only at 800-nm excitation wavelength using femtosecond
Ti:sapphire lasers. In this work, we demonstrate that an optimized spintronic
bilayer structure of 2-nm Fe and 3-nm Pt grown on 500 {\mu}m MgO substrate is
just as effective as a THz radiation source when excited either at {\lambda} =
800 nm or at {\lambda} = 1550 nm by ultrafast laser pulses from a fs fiber
laser (pulse width close to 100 fs, repetition rate around 100 MHz). Even with
low incident power levels, the Fe/Pt spintronic emitter exhibits efficient
generation of THz radiation at both excitation wavelengths. The efficient THz
emitter operation at 1550 nm facilitates the integration of such spintronic
emitters in THz systems driven by relatively low cost and compact fs fiber
lasers without the need for frequency conversion.
|
physics.app-ph cond-mat.mes-hall
|
recent studies in spintronics have highlighted ultrathin magnetic metallic multilayers as a novel and very promising class of broadband terahertz radiation sources such spintronic multilayers consist of ferromagnetic fm and nonmagnetic nm thin films when triggered by ultrafast laser pulses they generate pulsed thz radiation due to the inverse spinhall effect a mechanism that converts optically driven spin currents from the magnetized fm layer into transient transverse charge currents in the nm layer resulting in thz emission as thz emitters fmnm multilayers have been intensively investigated so far only at 800nm excitation wavelength using femtosecond tisapphire lasers in this work we demonstrate that an optimized spintronic bilayer structure of 2nm fe and 3nm pt grown on 500 mum mgo substrate is just as effective as a thz radiation source when excited either at lambda 800 nm or at lambda 1550 nm by ultrafast laser pulses from a fs fiber laser pulse width close to 100 fs repetition rate around 100 mhz even with low incident power levels the fept spintronic emitter exhibits efficient generation of thz radiation at both excitation wavelengths the efficient thz emitter operation at 1550 nm facilitates the integration of such spintronic emitters in thz systems driven by relatively low cost and compact fs fiber lasers without the need for frequency conversion
|
[['recent', 'studies', 'in', 'spintronics', 'have', 'highlighted', 'ultrathin', 'magnetic', 'metallic', 'multilayers', 'as', 'a', 'novel', 'and', 'very', 'promising', 'class', 'of', 'broadband', 'terahertz', 'radiation', 'sources', 'such', 'spintronic', 'multilayers', 'consist', 'of', 'ferromagnetic', 'fm', 'and', 'nonmagnetic', 'nm', 'thin', 'films', 'when', 'triggered', 'by', 'ultrafast', 'laser', 'pulses', 'they', 'generate', 'pulsed', 'thz', 'radiation', 'due', 'to', 'the', 'inverse', 'spinhall', 'effect', 'a', 'mechanism', 'that', 'converts', 'optically', 'driven', 'spin', 'currents', 'from', 'the', 'magnetized', 'fm', 'layer', 'into', 'transient', 'transverse', 'charge', 'currents', 'in', 'the', 'nm', 'layer', 'resulting', 'in', 'thz', 'emission', 'as', 'thz', 'emitters', 'fmnm', 'multilayers', 'have', 'been', 'intensively', 'investigated', 'so', 'far', 'only', 'at', '800nm', 'excitation', 'wavelength', 'using', 'femtosecond', 'tisapphire', 'lasers', 'in', 'this', 'work', 'we', 'demonstrate', 'that', 'an', 'optimized', 'spintronic', 'bilayer', 'structure', 'of', '2nm', 'fe', 'and', '3nm', 'pt', 'grown', 'on', '500', 'mum', 'mgo', 'substrate', 'is', 'just', 'as', 'effective', 'as', 'a', 'thz', 'radiation', 'source', 'when', 'excited', 'either', 'at', 'lambda', '800', 'nm', 'or', 'at', 'lambda', '1550', 'nm', 'by', 'ultrafast', 'laser', 'pulses', 'from', 'a', 'fs', 'fiber', 'laser', 'pulse', 'width', 'close', 'to', '100', 'fs', 'repetition', 'rate', 'around', '100', 'mhz', 'even', 'with', 'low', 'incident', 'power', 'levels', 'the', 'fept', 'spintronic', 'emitter', 'exhibits', 'efficient', 'generation', 'of', 'thz', 'radiation', 'at', 'both', 'excitation', 'wavelengths', 'the', 'efficient', 'thz', 'emitter', 'operation', 'at', '1550', 'nm', 'facilitates', 'the', 'integration', 'of', 'such', 'spintronic', 'emitters', 'in', 'thz', 'systems', 'driven', 'by', 'relatively', 'low', 'cost', 'and', 'compact', 'fs', 'fiber', 'lasers', 'without', 'the', 'need', 'for', 'frequency', 'conversion']]
|
[-0.1324647214436947, 0.2493105863876841, 0.048965214212360074, -0.033455113553561185, -0.023637956115525476, -0.22290979511602674, 0.04933265358057999, 0.6060446494540502, -0.24999734411709185, -0.3079116880839561, 0.004607275997418477, -0.28468771592150766, 0.003002482229237293, 0.30125258292807916, 0.0738856339144932, 0.01620282792086242, -0.024047182281609885, -0.18270740560580825, 0.026316911067954415, -0.0667316050182075, 0.18545779631159073, 0.07980883446451667, 0.35404231714214696, 0.06571259147346799, 0.10965670814391139, -0.051993501275171376, 0.15917017917733553, -0.1352045634577354, -0.11432509977014486, 0.036042395877911776, 0.31934198473666814, -0.15174570501088921, 0.2517914615517352, -0.4682156429994245, -0.25667091915762963, -0.0337236717966017, 0.13512234870929185, 0.12444100702969292, -0.11522600708236962, -0.2592250255477983, 0.11663707488887878, -0.1279554715151303, -0.09622888916800189, 0.019240293835376412, 0.033442609204889034, 0.03235632038193343, -0.24096913745810905, -0.012673673553116143, 0.044969017261660894, 0.12331746620840804, -0.028922707448865093, -0.09152416933847721, -0.08793415328011263, -0.04994860970940398, -0.020668107181852465, 0.08968805793434555, 0.2765602126541591, -0.12423242832355331, -0.11973220971737837, 0.3089250131770102, -0.0906991767458791, 0.016915403581549263, 0.12275967674633098, -0.20103286947665172, 0.04110666510302487, 0.2645983880688978, 0.13150532072258378, 0.19913430857298853, -0.11099843716852605, 0.03209366855281947, 0.09611045404142418, 0.3083077879860824, 0.20981924146478778, 0.18817473151829353, 0.29953143086804207, 0.23442773925205476, 0.0023320639109358104, 0.16710329780051875, -0.18160731246110137, 0.06312519820991817, -0.18275062431646294, -0.09768409367304208, -0.2246185174125225, 0.16456407407775175, -0.0678159145657298, -0.12003089755010077, 0.40378823697480354, 0.14442030031905445, 0.04098028330305634, -0.06735819277007046, 0.30947696778836636, 0.1264241227544411, 0.10900637559636041, 0.0030067894261243734, 0.301134408885873, 0.18242098127064013, 0.185314601018746, -0.21600419868780082, -0.008414741083004967, -0.09907921965688814]
|
1,803.08839
|
A supplement to "Induced nets and Hamiltonicity of claw-free graphs"
|
This note supplements our paper "Induced nets and Hamiltonicity of claw-free
graphs", by giving the detailed proof that were omitted in it.
|
math.CO
|
this note supplements our paper induced nets and hamiltonicity of clawfree graphs by giving the detailed proof that were omitted in it
|
[['this', 'note', 'supplements', 'our', 'paper', 'induced', 'nets', 'and', 'hamiltonicity', 'of', 'clawfree', 'graphs', 'by', 'giving', 'the', 'detailed', 'proof', 'that', 'were', 'omitted', 'in', 'it']]
|
[-0.11474164721386676, 0.0477901046926325, -0.06673028988933022, 0.07013935489389538, -0.12552794179117138, -0.06484361871314998, 0.0811518679256551, 0.3579401145265861, -0.21538575569337065, -0.3712495264004577, 0.09089756022016941, -0.2898374865339561, -0.26361699266867206, 0.1325614001940597, -0.19214644824916666, -0.04412039741873741, 0.19347244412214917, -0.038410719272426584, 0.07644501994152299, -0.3521605283021927, 0.3305496785112403, 0.038694767958738586, 0.12736669669605113, 0.19202345857312056, 0.01253029210916297, 0.05491073954511772, -0.07093245104293931, 0.0637068637562069, -0.23251600323452626, 0.11938140329650858, 0.2591835379769856, 0.1297505310397934, 0.19902579655701463, -0.44058634086766024, -0.15860689054666596, 0.1711146591379392, 0.12239867296408523, 0.12059192376380617, -0.04447497380897403, -0.29192489258606324, 0.11382854937321761, -0.1384665871816899, -0.07343507636423138, -0.050287218425761566, 0.03292376251721924, -0.01066339553587816, -0.1947905420410362, -0.0036969459615647793, 0.3488817188719457, 0.13797382993454282, 0.07927085351283578, -0.1374179899939918, 0.0038462714292109013, 0.06598527043719184, -0.02023392687128349, 0.061786980939690365, -0.008416170677678152, -0.02810080567459491, -0.17853076696734538, 0.315912128849463, 0.028983278030698948, -0.11058268645270304, 0.10672574304044247, -0.07613030958666721, -0.2350298646541143, 0.08369261486222968, 0.03826297830197622, 0.16162101619622923, -0.15842483256181533, 0.09636328487646427, -0.10805742870169607, 0.11996176872741092, 0.14097610238770192, -0.007373095130209218, 0.05709308504380963, 0.14986057397486133, 0.06386178337627578, 0.23014667003669523, 0.13959956067529591, -0.005703130906278437, -0.37646000036461785, -0.07583317097107117, -0.1820211513814601, 0.07299457752907818, -0.0672201034394675, -0.1947309851477092, 0.46771512451496994, 0.1993012618781491, 0.10295853700319474, 0.17026239675893026, 0.2537254575978626, 0.015261170692445541, 0.046349816087802705, 0.10056585001505235, 0.21383535912768406, 0.23141777991655876, 0.10335335888984529, -0.09383760505906222, 0.105319689726457, 0.17098365144126795]
|
1,803.0884
|
Effective deep learning training for single-image super-resolution in
endomicroscopy exploiting video-registration-based reconstruction
|
Purpose: Probe-based Confocal Laser Endomicroscopy (pCLE) is a recent imaging
modality that allows performing in vivo optical biopsies. The design of pCLE
hardware, and its reliance on an optical fibre bundle, fundamentally limits the
image quality with a few tens of thousands fibres, each acting as the
equivalent of a single-pixel detector, assembled into a single fibre bundle.
Video-registration techniques can be used to estimate high-resolution (HR)
images by exploiting the temporal information contained in a sequence of
low-resolution (LR) images. However, the alignment of LR frames, required for
the fusion, is computationally demanding and prone to artefacts. Methods: In
this work, we propose a novel synthetic data generation approach to train
exemplar-based Deep Neural Networks (DNNs). HR pCLE images with enhanced
quality are recovered by the models trained on pairs of estimated HR images
(generated by the video-registration algorithm) and realistic synthetic LR
images. Performance of three different state-of-the-art DNNs techniques were
analysed on a Smart Atlas database of 8806 images from 238 pCLE video
sequences. The results were validated through an extensive Image Quality
Assessment (IQA) that takes into account different quality scores, including a
Mean Opinion Score (MOS). Results: Results indicate that the proposed solution
produces an effective improvement in the quality of the obtained reconstructed
image. Conclusion: The proposed training strategy and associated DNNs allows us
to perform convincing super-resolution of pCLE images.
|
cs.CV
|
purpose probebased confocal laser endomicroscopy pcle is a recent imaging modality that allows performing in vivo optical biopsies the design of pcle hardware and its reliance on an optical fibre bundle fundamentally limits the image quality with a few tens of thousands fibres each acting as the equivalent of a singlepixel detector assembled into a single fibre bundle videoregistration techniques can be used to estimate highresolution hr images by exploiting the temporal information contained in a sequence of lowresolution lr images however the alignment of lr frames required for the fusion is computationally demanding and prone to artefacts methods in this work we propose a novel synthetic data generation approach to train exemplarbased deep neural networks dnns hr pcle images with enhanced quality are recovered by the models trained on pairs of estimated hr images generated by the videoregistration algorithm and realistic synthetic lr images performance of three different stateoftheart dnns techniques were analysed on a smart atlas database of 8806 images from 238 pcle video sequences the results were validated through an extensive image quality assessment iqa that takes into account different quality scores including a mean opinion score mos results results indicate that the proposed solution produces an effective improvement in the quality of the obtained reconstructed image conclusion the proposed training strategy and associated dnns allows us to perform convincing superresolution of pcle images
|
[['purpose', 'probebased', 'confocal', 'laser', 'endomicroscopy', 'pcle', 'is', 'a', 'recent', 'imaging', 'modality', 'that', 'allows', 'performing', 'in', 'vivo', 'optical', 'biopsies', 'the', 'design', 'of', 'pcle', 'hardware', 'and', 'its', 'reliance', 'on', 'an', 'optical', 'fibre', 'bundle', 'fundamentally', 'limits', 'the', 'image', 'quality', 'with', 'a', 'few', 'tens', 'of', 'thousands', 'fibres', 'each', 'acting', 'as', 'the', 'equivalent', 'of', 'a', 'singlepixel', 'detector', 'assembled', 'into', 'a', 'single', 'fibre', 'bundle', 'videoregistration', 'techniques', 'can', 'be', 'used', 'to', 'estimate', 'highresolution', 'hr', 'images', 'by', 'exploiting', 'the', 'temporal', 'information', 'contained', 'in', 'a', 'sequence', 'of', 'lowresolution', 'lr', 'images', 'however', 'the', 'alignment', 'of', 'lr', 'frames', 'required', 'for', 'the', 'fusion', 'is', 'computationally', 'demanding', 'and', 'prone', 'to', 'artefacts', 'methods', 'in', 'this', 'work', 'we', 'propose', 'a', 'novel', 'synthetic', 'data', 'generation', 'approach', 'to', 'train', 'exemplarbased', 'deep', 'neural', 'networks', 'dnns', 'hr', 'pcle', 'images', 'with', 'enhanced', 'quality', 'are', 'recovered', 'by', 'the', 'models', 'trained', 'on', 'pairs', 'of', 'estimated', 'hr', 'images', 'generated', 'by', 'the', 'videoregistration', 'algorithm', 'and', 'realistic', 'synthetic', 'lr', 'images', 'performance', 'of', 'three', 'different', 'stateoftheart', 'dnns', 'techniques', 'were', 'analysed', 'on', 'a', 'smart', 'atlas', 'database', 'of', '8806', 'images', 'from', '238', 'pcle', 'video', 'sequences', 'the', 'results', 'were', 'validated', 'through', 'an', 'extensive', 'image', 'quality', 'assessment', 'iqa', 'that', 'takes', 'into', 'account', 'different', 'quality', 'scores', 'including', 'a', 'mean', 'opinion', 'score', 'mos', 'results', 'results', 'indicate', 'that', 'the', 'proposed', 'solution', 'produces', 'an', 'effective', 'improvement', 'in', 'the', 'quality', 'of', 'the', 'obtained', 'reconstructed', 'image', 'conclusion', 'the', 'proposed', 'training', 'strategy', 'and', 'associated', 'dnns', 'allows', 'us', 'to', 'perform', 'convincing', 'superresolution', 'of', 'pcle', 'images']]
|
[-0.04768824442908226, -0.02842909670321855, -0.06839566615729252, 0.04386979194168816, -0.07000484865316789, -0.16188555578368582, 0.0031453541269002017, 0.4875623729146485, -0.2102976353593736, -0.3406762276613985, 0.08524284814016678, -0.26294167515477185, -0.15551839358340658, 0.22810958512854995, -0.15694384665610933, 0.10144129789140217, 0.18754810447405493, 0.009519348167356969, -0.04919398277447077, -0.2840398866190818, 0.24160011089822678, 0.056670355871314575, 0.36838834330410464, -0.025966055376816906, 0.14504567966806853, -0.0047551755560562015, -0.06475655541830097, -0.004372654245733949, -0.07329849718731955, 0.18443621299645332, 0.2670149706253174, 0.1887047175904237, 0.2865162387294861, -0.4313481863687879, -0.19851750168475388, 0.0639424088949454, 0.14218375096554933, 0.06159462560650094, -0.06983226967765534, -0.3636912672871923, 0.09935329485181553, -0.11462062207855135, 0.0036539997449186296, -0.11205517931947336, -0.05549773166681656, -0.009983097987320175, -0.3193648923063717, 0.024436031817848352, 0.00940038735487698, 0.11777604361746594, -0.08479245789879185, -0.07713540173738563, -0.015578777638178767, 0.1728115123447164, -0.02110947059035035, 0.06925774615072962, 0.16883848391054407, -0.18459220286916075, -0.1156634644391618, 0.36833319581637625, -0.07470073695315348, -0.16822976506851514, 0.1704324893710561, -0.05454234859020549, -0.09112828388710373, 0.20166769836838025, 0.18662010106449348, 0.11651967946922273, -0.158152016781969, -0.02399102521615402, -0.014624515526520554, 0.23100698101812409, 0.07298832106010066, 0.011706259964349945, 0.18129392929872015, 0.23020686686088862, -0.052481113596253896, 0.1506482654019367, -0.21792053764225525, 0.009632701041742362, -0.17518123093447815, -0.1064013996209334, -0.195006425136983, 0.008645685445766762, -0.09984603554117452, -0.10863331681736911, 0.40395848752294633, 0.20564994906349707, 0.2150809638530648, 0.06061731958470773, 0.39531712495123167, -0.0006184369064742766, 0.1497680771639612, -0.03149237266292663, 0.20980738387048145, 0.03961430749456797, 0.11599448470432046, -0.14489704135381284, 0.022878403234374543, 0.058998358024837216]
|
1,803.08841
|
The Convergence of Stochastic Gradient Descent in Asynchronous Shared
Memory
|
Stochastic Gradient Descent (SGD) is a fundamental algorithm in machine
learning, representing the optimization backbone for training several classic
models, from regression to neural networks. Given the recent practical focus on
distributed machine learning, significant work has been dedicated to the
convergence properties of this algorithm under the inconsistent and noisy
updates arising from execution in a distributed environment. However,
surprisingly, the convergence properties of this classic algorithm in the
standard shared-memory model are still not well-understood.
In this work, we address this gap, and provide new convergence bounds for
lock-free concurrent stochastic gradient descent, executing in the classic
asynchronous shared memory model, against a strong adaptive adversary. Our
results give improved upper and lower bounds on the "price of asynchrony" when
executing the fundamental SGD algorithm in a concurrent setting. They show that
this classic optimization tool can converge faster and with a wider range of
parameters than previously known under asynchronous iterations. At the same
time, we exhibit a fundamental trade-off between the maximum delay in the
system and the rate at which SGD can converge, which governs the set of
parameters under which this algorithm can still work efficiently.
|
cs.DC cs.LG stat.ML
|
stochastic gradient descent sgd is a fundamental algorithm in machine learning representing the optimization backbone for training several classic models from regression to neural networks given the recent practical focus on distributed machine learning significant work has been dedicated to the convergence properties of this algorithm under the inconsistent and noisy updates arising from execution in a distributed environment however surprisingly the convergence properties of this classic algorithm in the standard sharedmemory model are still not wellunderstood in this work we address this gap and provide new convergence bounds for lockfree concurrent stochastic gradient descent executing in the classic asynchronous shared memory model against a strong adaptive adversary our results give improved upper and lower bounds on the price of asynchrony when executing the fundamental sgd algorithm in a concurrent setting they show that this classic optimization tool can converge faster and with a wider range of parameters than previously known under asynchronous iterations at the same time we exhibit a fundamental tradeoff between the maximum delay in the system and the rate at which sgd can converge which governs the set of parameters under which this algorithm can still work efficiently
|
[['stochastic', 'gradient', 'descent', 'sgd', 'is', 'a', 'fundamental', 'algorithm', 'in', 'machine', 'learning', 'representing', 'the', 'optimization', 'backbone', 'for', 'training', 'several', 'classic', 'models', 'from', 'regression', 'to', 'neural', 'networks', 'given', 'the', 'recent', 'practical', 'focus', 'on', 'distributed', 'machine', 'learning', 'significant', 'work', 'has', 'been', 'dedicated', 'to', 'the', 'convergence', 'properties', 'of', 'this', 'algorithm', 'under', 'the', 'inconsistent', 'and', 'noisy', 'updates', 'arising', 'from', 'execution', 'in', 'a', 'distributed', 'environment', 'however', 'surprisingly', 'the', 'convergence', 'properties', 'of', 'this', 'classic', 'algorithm', 'in', 'the', 'standard', 'sharedmemory', 'model', 'are', 'still', 'not', 'wellunderstood', 'in', 'this', 'work', 'we', 'address', 'this', 'gap', 'and', 'provide', 'new', 'convergence', 'bounds', 'for', 'lockfree', 'concurrent', 'stochastic', 'gradient', 'descent', 'executing', 'in', 'the', 'classic', 'asynchronous', 'shared', 'memory', 'model', 'against', 'a', 'strong', 'adaptive', 'adversary', 'our', 'results', 'give', 'improved', 'upper', 'and', 'lower', 'bounds', 'on', 'the', 'price', 'of', 'asynchrony', 'when', 'executing', 'the', 'fundamental', 'sgd', 'algorithm', 'in', 'a', 'concurrent', 'setting', 'they', 'show', 'that', 'this', 'classic', 'optimization', 'tool', 'can', 'converge', 'faster', 'and', 'with', 'a', 'wider', 'range', 'of', 'parameters', 'than', 'previously', 'known', 'under', 'asynchronous', 'iterations', 'at', 'the', 'same', 'time', 'we', 'exhibit', 'a', 'fundamental', 'tradeoff', 'between', 'the', 'maximum', 'delay', 'in', 'the', 'system', 'and', 'the', 'rate', 'at', 'which', 'sgd', 'can', 'converge', 'which', 'governs', 'the', 'set', 'of', 'parameters', 'under', 'which', 'this', 'algorithm', 'can', 'still', 'work', 'efficiently']]
|
[-0.11106386864654876, 0.02633936104757595, -0.0951281599579185, 0.07480207681874163, -0.07038896248559467, -0.20475369909642419, 0.09230792799401873, 0.40842848649966373, -0.34471848909015534, -0.3384571709757438, 0.10881416408725879, -0.1762500643186892, -0.1661119916352618, 0.22510956554106087, -0.1440219979340327, 0.11699679159695127, 0.1110601027685334, 0.027600950069275616, -0.06235260137024549, -0.31427066169150447, 0.21465218297210717, 0.08158915900761106, 0.29347714923884877, -0.019360871354668536, 0.0957090417383976, -0.01636307219329562, 0.017899419033104397, 0.00664434455272082, -0.0849137943413325, 0.13920593561063774, 0.2499487515217614, 0.1859894306823359, 0.3615986759058387, -0.4277709386369679, -0.18432994131338395, 0.14187653720061158, 0.17253968163428604, 0.1143507857153357, -0.056361014296271605, -0.25096053363813553, 0.10359020233348322, -0.11696286773803877, -0.015610934227879625, -0.09964667412593069, -0.049207423253392335, 0.06133585056219696, -0.2879662831983296, 0.04043114415010981, 0.11258429985355178, 0.05247089386936447, -0.021633541205422564, -0.1117262201654133, 0.06678852851230961, 0.08537265292352458, 0.07061379784863675, 0.04481020532208883, 0.12594524241042868, -0.1117696142149119, -0.15566708796056142, 0.3413887435453944, -0.06768473151449446, -0.1712360007732059, 0.20496825297110868, -0.03819908026586442, -0.1987448456978503, 0.11416465598570842, 0.25717341738345567, 0.14378586282691685, -0.16639768197129948, 0.09884246264937246, -0.06412475530911858, 0.14784255000328508, 0.02709471519468328, 0.028387316803370293, 0.10666128431572967, 0.22339425645983133, 0.147410297341897, 0.14343717334971492, -0.03493392988881775, -0.1844034447155233, -0.24426328676054254, -0.10446072553774381, -0.16123158926833034, -0.002353404353849934, -0.13797478362986718, -0.15463913422596912, 0.37706005272290594, 0.20517018918811422, 0.18575501466693822, 0.16536109875778493, 0.3759238292986993, 0.09032105141045577, 0.06363758634931098, 0.19711712684996505, 0.23044487297011074, 0.07872888416337294, 0.1550178306400388, -0.21826864567689577, 0.15681309888714168, 0.0559140639306861]
|
1,803.08842
|
Audio-Visual Event Localization in Unconstrained Videos
|
In this paper, we introduce a novel problem of audio-visual event
localization in unconstrained videos. We define an audio-visual event as an
event that is both visible and audible in a video segment. We collect an
Audio-Visual Event(AVE) dataset to systemically investigate three temporal
localization tasks: supervised and weakly-supervised audio-visual event
localization, and cross-modality localization. We develop an audio-guided
visual attention mechanism to explore audio-visual correlations, propose a dual
multimodal residual network (DMRN) to fuse information over the two modalities,
and introduce an audio-visual distance learning network to handle the
cross-modality localization. Our experiments support the following findings:
joint modeling of auditory and visual modalities outperforms independent
modeling, the learned attention can capture semantics of sounding objects,
temporal alignment is important for audio-visual fusion, the proposed DMRN is
effective in fusing audio-visual features, and strong correlations between the
two modalities enable cross-modality localization.
|
cs.CV
|
in this paper we introduce a novel problem of audiovisual event localization in unconstrained videos we define an audiovisual event as an event that is both visible and audible in a video segment we collect an audiovisual eventave dataset to systemically investigate three temporal localization tasks supervised and weaklysupervised audiovisual event localization and crossmodality localization we develop an audioguided visual attention mechanism to explore audiovisual correlations propose a dual multimodal residual network dmrn to fuse information over the two modalities and introduce an audiovisual distance learning network to handle the crossmodality localization our experiments support the following findings joint modeling of auditory and visual modalities outperforms independent modeling the learned attention can capture semantics of sounding objects temporal alignment is important for audiovisual fusion the proposed dmrn is effective in fusing audiovisual features and strong correlations between the two modalities enable crossmodality localization
|
[['in', 'this', 'paper', 'we', 'introduce', 'a', 'novel', 'problem', 'of', 'audiovisual', 'event', 'localization', 'in', 'unconstrained', 'videos', 'we', 'define', 'an', 'audiovisual', 'event', 'as', 'an', 'event', 'that', 'is', 'both', 'visible', 'and', 'audible', 'in', 'a', 'video', 'segment', 'we', 'collect', 'an', 'audiovisual', 'eventave', 'dataset', 'to', 'systemically', 'investigate', 'three', 'temporal', 'localization', 'tasks', 'supervised', 'and', 'weaklysupervised', 'audiovisual', 'event', 'localization', 'and', 'crossmodality', 'localization', 'we', 'develop', 'an', 'audioguided', 'visual', 'attention', 'mechanism', 'to', 'explore', 'audiovisual', 'correlations', 'propose', 'a', 'dual', 'multimodal', 'residual', 'network', 'dmrn', 'to', 'fuse', 'information', 'over', 'the', 'two', 'modalities', 'and', 'introduce', 'an', 'audiovisual', 'distance', 'learning', 'network', 'to', 'handle', 'the', 'crossmodality', 'localization', 'our', 'experiments', 'support', 'the', 'following', 'findings', 'joint', 'modeling', 'of', 'auditory', 'and', 'visual', 'modalities', 'outperforms', 'independent', 'modeling', 'the', 'learned', 'attention', 'can', 'capture', 'semantics', 'of', 'sounding', 'objects', 'temporal', 'alignment', 'is', 'important', 'for', 'audiovisual', 'fusion', 'the', 'proposed', 'dmrn', 'is', 'effective', 'in', 'fusing', 'audiovisual', 'features', 'and', 'strong', 'correlations', 'between', 'the', 'two', 'modalities', 'enable', 'crossmodality', 'localization']]
|
[-0.06451967522743152, 0.022091363316838187, -0.0680172797091466, 0.10533265291927583, -0.12155887157582551, -0.16092516971993254, -0.050327806471404786, 0.522043867398509, -0.28535060118213834, -0.27198439872012936, -0.00864264760970426, -0.2992200688793987, -0.22906877389914698, 0.1125268282154374, -0.2163707744263166, 0.03664663519790704, 0.1406167084937446, 0.08689468534556118, -0.0537982262225433, -0.21281777331170043, 0.31087116580858504, 0.03569365613725331, 0.3801170771526133, 0.047491976374880875, 0.18475188195986822, 0.07173645974257492, -0.09319174514075058, -0.0447661656795887, -0.0430459557237751, 0.2430711420991612, 0.3802591986726407, 0.24483156181982235, 0.3065426744580966, -0.38970498602649717, -0.2544698228736294, 0.058216091431342334, 0.15753622091100586, 0.09425218135919154, -0.052571871994639474, -0.446648025912025, 0.07646349278821361, -0.22667250592259877, 0.13499872809570793, -0.11061092027255313, 0.018766113764626516, -0.05889039316420651, -0.348175318513012, 0.02725788750983071, 0.1151438566065467, 0.12256354462060569, -0.11414638094322609, 0.04294386023647996, 0.06001959594549518, 0.23602783186495196, 0.040555499194243505, 0.03379633041390171, 0.1172994342230582, -0.21018525760238924, -0.16897197706933073, 0.33242143274506003, -0.024118158016554852, -0.17409721633298791, 0.251076605576325, -0.0028393196625460825, -0.127793761553149, 0.06964385050529842, 0.26580565750809126, 0.13639483785444348, -0.21194488220854843, -0.04531103494768064, -0.0433408430402281, 0.25309876691514005, 0.045705532506041285, 0.07381172006162094, 0.2101766951449162, 0.28593831465800673, 0.008357869729185275, 0.16195791779507265, -0.22302868814214313, -0.010517681597082091, -0.19453899082627227, -0.08436444150484937, -0.14691230417195733, -0.09462677034810721, -0.10456966106522754, -0.10645184745315275, 0.42532037949296747, 0.31681928268747683, 0.2595410390368415, 0.10755517177632172, 0.3381909804214328, 0.005880091151745199, 0.07058840417202643, 0.011500382754053894, 0.15076511586084962, -0.03640820751328477, 0.17778931129238026, -0.21261592794933337, 0.056475331564601376, 0.1098319351867431]
|
1,803.08843
|
Reflection positivity in nonlocal gravity
|
Contrary to recent claims in the literature, a simple test for reflection
positivite, which we call perturbative reflection positivity in the coincidence
limit, is shown to be satisfied for nonlocal field theories. Particular
attention is given to weakly nonlocal gravity and gauge theories.
|
hep-th gr-qc
|
contrary to recent claims in the literature a simple test for reflection positivite which we call perturbative reflection positivity in the coincidence limit is shown to be satisfied for nonlocal field theories particular attention is given to weakly nonlocal gravity and gauge theories
|
[['contrary', 'to', 'recent', 'claims', 'in', 'the', 'literature', 'a', 'simple', 'test', 'for', 'reflection', 'positivite', 'which', 'we', 'call', 'perturbative', 'reflection', 'positivity', 'in', 'the', 'coincidence', 'limit', 'is', 'shown', 'to', 'be', 'satisfied', 'for', 'nonlocal', 'field', 'theories', 'particular', 'attention', 'is', 'given', 'to', 'weakly', 'nonlocal', 'gravity', 'and', 'gauge', 'theories']]
|
[-0.11600262283748232, 0.08917527912227913, -0.09291698917919813, 0.1110598934262038, -0.17678355520894362, -0.19735575507416628, -0.029729954042840144, 0.34887604198830074, -0.18201385616043278, -0.2213498434528362, 0.0561773625234965, -0.2522504458767037, -0.14142152097422717, 0.15773449353007382, -0.12960743526170074, 0.06427080617394558, -0.019015010446310043, 0.05644805820355581, -0.05883595635464718, -0.28889260170331527, 0.3444057891881743, 0.04212564273282539, 0.29010925911973384, 0.09617008704172317, 0.07546374504995901, 0.007811470190063119, -0.010924551787591257, 0.07998186501479426, -0.12366188201663453, 0.08293105614219987, 0.22727624653177986, 0.05485617741942406, 0.19627838503829267, -0.42633176976165105, -0.2575969517360939, 0.08870210985891348, 0.09987253760431655, 0.14742891053766619, -0.038402284649850495, -0.28405075121757595, 0.06168441604389701, -0.18698035156744164, -0.14449908841282216, -0.0675488117335061, 0.028672787720922296, -0.07868097837321288, -0.3035264368667159, 0.08574754797831871, 0.04504645884383556, 0.007394499448669511, 0.002290366390763327, 0.006918534095030885, 0.011086784931289595, 0.01690981605328446, 0.1130031649954617, 0.02752812228403812, 0.06853672820901455, -0.18972904203719523, -0.1384095036056499, 0.41347878062447835, -0.07026904786742011, -0.22568672893807118, 0.20490151195418696, -0.17375913261284315, -0.22098627998385317, 0.0738576858109513, 0.07053411613370097, 0.14498797041732212, -0.15141649329818266, 0.1683981367048461, -0.10261656980701657, 0.11982418875058376, 0.12254389384111693, 0.03204815201244728, 0.2045240244546602, 0.04835339500785394, 0.04621089941843651, 0.08195831989165568, 0.029517904313844302, -0.12922692974639494, -0.37705904822579994, -0.1266427060675829, -0.12911951409782782, 0.0751341219320027, -0.02230689098461542, -0.15590216449210095, 0.2823870443674021, 0.1969284076503543, 0.13028174435156722, 0.08159285441831533, 0.1905531210521626, 0.21715416170136873, 0.06758360499732716, 0.001260527799469094, 0.2804312327616783, 0.21842026052086852, 0.0614799577905255, -0.20060186956597623, -0.019834451856589767, 0.10400860960227112]
|
1,803.08844
|
Uniform gradient estimates on manifolds with a boundary and applications
|
We revisit the problem of obtaining uniform gradient estimates for Dirichlet
and Neumann heat semigroups on Riemannian manifolds with boundary. As
applications, we obtain isoperimetric inequalities, using Ledoux's argument,
and uniform quantitative gradient estimates, firstly for $C^2_b$ functions with
boundary conditions and then for the unit spectral projection operators of
Dirichlet and Neumann Laplacians.
|
math.FA
|
we revisit the problem of obtaining uniform gradient estimates for dirichlet and neumann heat semigroups on riemannian manifolds with boundary as applications we obtain isoperimetric inequalities using ledouxs argument and uniform quantitative gradient estimates firstly for c2_b functions with boundary conditions and then for the unit spectral projection operators of dirichlet and neumann laplacians
|
[['we', 'revisit', 'the', 'problem', 'of', 'obtaining', 'uniform', 'gradient', 'estimates', 'for', 'dirichlet', 'and', 'neumann', 'heat', 'semigroups', 'on', 'riemannian', 'manifolds', 'with', 'boundary', 'as', 'applications', 'we', 'obtain', 'isoperimetric', 'inequalities', 'using', 'ledouxs', 'argument', 'and', 'uniform', 'quantitative', 'gradient', 'estimates', 'firstly', 'for', 'c2_b', 'functions', 'with', 'boundary', 'conditions', 'and', 'then', 'for', 'the', 'unit', 'spectral', 'projection', 'operators', 'of', 'dirichlet', 'and', 'neumann', 'laplacians']]
|
[-0.05002321821268437, 0.014577106489220037, -0.07712842488907418, 0.09819111243804109, -0.13306641970532682, -0.16423589337336006, 0.014976373328915183, 0.3843820209544644, -0.27058951245655993, -0.20338571650626244, 0.2616426696438553, -0.312641011621311, -0.05895785832742475, 0.22532621647213708, -0.14545152336359024, 0.1809403022030755, 0.13378164275848078, 0.03594815228046533, -0.17233347495631227, -0.16501519760723174, 0.4657866251918505, -0.045622407476294716, 0.22956266325353733, 0.13657025462192185, 0.07424464143270666, -0.019419883149412443, -0.02467654889695487, 0.013361873707013592, -0.27724336662751464, 0.19893744057000456, 0.19461536760231093, 0.031217529482366342, 0.28745710876998753, -0.4819117542707695, -0.2432406293579711, 0.16012745106346765, 0.09129356498333607, -0.038119276036631386, -0.04433032326655076, -0.30624914717561796, 0.04397830391689291, -0.020069075537458906, -0.12953484993217126, -0.10515731035397863, -0.03204130127428556, 0.06307991397268367, -0.39594850608340976, 0.18126741521728207, 0.10254289344269431, 0.08921416914134445, -0.24726093339048466, -0.14141741423112042, 0.03342914584813253, 0.078504725324236, -0.0036077271083826724, -0.019549424259238085, 0.08201940257523982, -0.047950193075076586, -0.1014627784156715, 0.238098428549491, -0.08378245078800421, -0.3305226667731438, 0.10986025436377188, -0.14242813929493697, -0.137241814180084, -0.06420628591945816, 0.11772733378522801, 0.18248866456297208, -0.12989744621785884, 0.15187258088416508, -0.048633506622622315, 0.023321334553777048, 0.14455290723873196, -0.020170796772394823, 0.033426517620682716, 0.045946162668460945, 0.27814390744029915, 0.23279529423365053, -0.024493735138643183, -0.08443277554129655, -0.3598282840454353, -0.20430060667600833, -0.19634911178980233, 0.09123012623837534, -0.22814280570392445, -0.2831785358523704, 0.32573783116520577, 0.04492600680381622, 0.18758213451518765, 0.1544475012045916, 0.2051069233917965, 0.18835815758980318, -0.015158254688359657, 0.12236596331140905, 0.07638127511402346, 0.3033929402887259, 0.1462725463569305, -0.17921714007608452, -0.032404585267012974, 0.2533776625850291]
|
1,803.08845
|
On the emission probability of the 66.7 keV {\gamma}-transition in the
decay of 171Tm
|
The {\gamma}-emission probability of the 66.73 keV line in the decay of 171Tm
has been experimentally determined using {\gamma}-spectrometry and inductively
coupled mass spectrometry. Using a set of two reference sources, namely 60Co as
primary standard and 44Ti/44Sc in secular equilibrium as secondary standards,
we were able to deduce the detection efficiency at 67.87 keV of the used
{\gamma}-spectrometry setup with high precision. The emission probability of
the 66.73 keV {\gamma}-transition in the decay of 171Tm has been determined
with a set of three radioisotopically pure 171Tm samples to be 0.159(6) %.
|
nucl-ex physics.atom-ph
|
the gammaemission probability of the 6673 kev line in the decay of 171tm has been experimentally determined using gammaspectrometry and inductively coupled mass spectrometry using a set of two reference sources namely 60co as primary standard and 44ti44sc in secular equilibrium as secondary standards we were able to deduce the detection efficiency at 6787 kev of the used gammaspectrometry setup with high precision the emission probability of the 6673 kev gammatransition in the decay of 171tm has been determined with a set of three radioisotopically pure 171tm samples to be 01596
|
[['the', 'gammaemission', 'probability', 'of', 'the', '6673', 'kev', 'line', 'in', 'the', 'decay', 'of', '171tm', 'has', 'been', 'experimentally', 'determined', 'using', 'gammaspectrometry', 'and', 'inductively', 'coupled', 'mass', 'spectrometry', 'using', 'a', 'set', 'of', 'two', 'reference', 'sources', 'namely', '60co', 'as', 'primary', 'standard', 'and', '44ti44sc', 'in', 'secular', 'equilibrium', 'as', 'secondary', 'standards', 'we', 'were', 'able', 'to', 'deduce', 'the', 'detection', 'efficiency', 'at', '6787', 'kev', 'of', 'the', 'used', 'gammaspectrometry', 'setup', 'with', 'high', 'precision', 'the', 'emission', 'probability', 'of', 'the', '6673', 'kev', 'gammatransition', 'in', 'the', 'decay', 'of', '171tm', 'has', 'been', 'determined', 'with', 'a', 'set', 'of', 'three', 'radioisotopically', 'pure', '171tm', 'samples', 'to', 'be', '01596']]
|
[-0.009133538464084268, 0.13300067994383757, -0.049379158844451675, 0.03710915042426099, 0.036349194293672386, -0.1304127540418201, 0.04615591468014331, 0.39896014757158066, -0.17905021501726218, -0.3492048484146256, 0.06550858505414164, -0.31555062519725074, 0.050576952984556556, 0.21418794759401036, -0.005005370851987126, 0.11128102532926608, 0.02153992900937076, 0.03660956224087964, -0.02935257380754179, -0.1849612082481723, 0.2449836308475245, 0.1278325516005597, 0.2504917241378941, 0.05102204442532225, 0.10859245607968081, -0.03739122481783852, -0.01783088231670924, -0.02729250728787685, -0.1118892272299325, 0.07586575257168575, 0.22535743358523838, 0.14308256081329257, 0.17319482116727158, -0.3291808652786792, -0.1914278744582341, 0.11540258265185085, 0.13977470894513483, 0.0021148153305561705, -0.044341519021558765, -0.2753450777064162, 0.10912572568684648, -0.2037317899098112, -0.11674197428775104, 0.0053509938390396364, -0.019496465133587746, 0.0589595323597843, -0.23683953924972395, 0.06552212569989603, -0.040082010888991965, 0.06620186936925165, -0.07495115841315551, -0.13641907143491236, -0.014556455986828289, 0.11306622900619087, 0.04713496448477434, 0.019181405590974133, 0.15648655693406577, -0.045926187758926644, -0.13139697126197544, 0.35608470224013383, -0.12510339938506315, -0.08500554837188577, 0.176611356749411, -0.15253490744825368, -0.1430588795311368, 0.2240732216212729, 0.11448212014511228, 0.11161475952989845, -0.1825047289973802, 0.05463106244066942, 0.011087016617900437, 0.20924311433918774, 0.12812263920733874, 0.013239100633654743, 0.20238740654630502, 0.16252887941928665, -0.017230957788838583, 0.12461506204536735, -0.19256676084213806, 0.00913367077538913, -0.2362785282206129, -0.1155913145260208, -0.12739202419073659, 0.08349412855882705, 0.01901716333899954, -0.11163723387223647, 0.38070382397960534, 0.06961226368068972, 0.19870933872615834, -0.0020958309231156654, 0.28806129514917056, 0.13508598889066806, 0.0441443017070097, 0.005300608580000699, 0.30999650043800514, 0.17316375727056188, 0.06412836096503517, -0.23180488365786997, 0.05470394441561604, 0.013547663801794195]
|
1,803.08846
|
Galton-Watson and branching process representations of the normalized
Perron-Frobenius eigenvector
|
Let $A$ be a primitive matrix and let $\lambda$ be its Perron-Frobenius
eigenvalue. We give formulas expressing the associated normalized
Perron-Frobenius eigenvector as a simple functional of a multitype
Galton-Watson process whose mean matrix is $A$, as well as of a multitype
branching process with mean matrix $e^{(A-I)t}$. These formulas are
generalizations of the classical formula for the invariant probability measure
of a Markov chain.
|
math.PR
|
let a be a primitive matrix and let lambda be its perronfrobenius eigenvalue we give formulas expressing the associated normalized perronfrobenius eigenvector as a simple functional of a multitype galtonwatson process whose mean matrix is a as well as of a multitype branching process with mean matrix eait these formulas are generalizations of the classical formula for the invariant probability measure of a markov chain
|
[['let', 'a', 'be', 'a', 'primitive', 'matrix', 'and', 'let', 'lambda', 'be', 'its', 'perronfrobenius', 'eigenvalue', 'we', 'give', 'formulas', 'expressing', 'the', 'associated', 'normalized', 'perronfrobenius', 'eigenvector', 'as', 'a', 'simple', 'functional', 'of', 'a', 'multitype', 'galtonwatson', 'process', 'whose', 'mean', 'matrix', 'is', 'a', 'as', 'well', 'as', 'of', 'a', 'multitype', 'branching', 'process', 'with', 'mean', 'matrix', 'eait', 'these', 'formulas', 'are', 'generalizations', 'of', 'the', 'classical', 'formula', 'for', 'the', 'invariant', 'probability', 'measure', 'of', 'a', 'markov', 'chain']]
|
[-0.07432916856173856, 0.16000387354825552, -0.1190755050127896, 0.10758249056553514, -0.07395364659336898, -0.1505982681392477, 0.046116596763022245, 0.32224997216119217, -0.3147157777244082, -0.1730325744379885, 0.15828600166401324, -0.2806190087818182, -0.16315923196335252, 0.12893250508663745, -0.045619174549266554, 0.07919308561742162, 0.06466611655643927, 0.15854214406930484, -0.05902059687158236, -0.10727010363569627, 0.2901236528244156, 0.00965843782402002, 0.17266151121674247, 0.03902223673649132, 0.14634455657349182, 0.029040554774781832, -0.014090897930929294, -0.004610024800953957, -0.14179578970831175, 0.12304957785303346, 0.26338599087813724, 0.1383674047385844, 0.27641781178267244, -0.329284143820405, -0.13243969179546602, 0.23725838797310225, 0.1714979174475257, 0.04046252387253424, 0.03728371735375661, -0.3034773586747738, 0.12962528749440724, -0.21001231636708745, -0.18442003275625982, -0.052338136105726546, 0.05783792605193762, 0.07190228409778614, -0.34760431540556824, 0.09116075530361671, 0.107141363235692, 0.0869584105335749, 0.020025800818649048, -0.19864831331114358, -0.012636113936941211, 0.08578884248406841, -0.03881535511911632, -0.022256216399658184, 0.1607091975111801, -0.04419277003751351, -0.17842555341239158, 0.3391334000688333, -0.10842454714270738, -0.2962826929413355, 0.06521288668020414, -0.13162964798796636, -0.15214570391779908, 0.1010477245427095, 0.15417822269149697, 0.145107674290641, -0.15546126794070006, 0.13944156932053514, -0.07935017663448189, 0.05118927915508931, 0.032714892658763206, -0.023002644972159314, 0.15768097598965353, 0.1189562209810202, 0.0766567355236755, 0.1761262483859005, 0.02929647269640834, -0.13802228572850045, -0.3133890038212905, -0.2370307025857843, -0.23403587187282168, 0.19217780615704563, -0.22070186039983616, -0.29145851109463433, 0.35080002742604566, 0.034220355910782436, 0.27017222895072057, 0.24983467931071154, 0.18290122968789477, 0.26507422601123554, -0.009159334252875012, 0.004737142545099442, -0.008744113261883076, 0.3405483330385043, 0.013901864551007748, -0.14496842494162804, 0.13044511258888702, 0.2041833841886658]
|
1,803.08847
|
On stability of planar solutions of double averaged restricted elliptic
three-body problem
|
Double averaged planar restricted elliptic three-body problem has a
two-parametric family of stable equilibria. We show that these equilibria are
stable in the linear approximation as equilibria of the double averaged spatial
restricted elliptic three-body problem. They are Lyapunov stable for all values
of parameters but, possibly, parameters from some finite set of analytic
curves.
|
math.DS
|
double averaged planar restricted elliptic threebody problem has a twoparametric family of stable equilibria we show that these equilibria are stable in the linear approximation as equilibria of the double averaged spatial restricted elliptic threebody problem they are lyapunov stable for all values of parameters but possibly parameters from some finite set of analytic curves
|
[['double', 'averaged', 'planar', 'restricted', 'elliptic', 'threebody', 'problem', 'has', 'a', 'twoparametric', 'family', 'of', 'stable', 'equilibria', 'we', 'show', 'that', 'these', 'equilibria', 'are', 'stable', 'in', 'the', 'linear', 'approximation', 'as', 'equilibria', 'of', 'the', 'double', 'averaged', 'spatial', 'restricted', 'elliptic', 'threebody', 'problem', 'they', 'are', 'lyapunov', 'stable', 'for', 'all', 'values', 'of', 'parameters', 'but', 'possibly', 'parameters', 'from', 'some', 'finite', 'set', 'of', 'analytic', 'curves']]
|
[-0.20143845404328947, 0.13306489754468204, -0.10173044289377603, 0.11411886985667727, -0.03092470578002659, -0.17535980679941449, 0.013938004269518635, 0.33654404147104783, -0.3356665534051982, -0.21626247435130858, 0.08822122626218268, -0.25558186275037853, -0.09647765298458663, 0.23449496699666436, -0.0376431087709286, 0.2033280830610734, 0.12040964236313646, 0.04917540841481902, -0.08130748158278452, -0.2652613575146957, 0.37441043345765634, -0.09421769221397963, 0.13968309887092223, -0.024896014007655058, 0.05834282528270374, 0.004187903434715487, 0.04595702994953502, 0.08137720742008903, -0.1946475429932682, 0.09010530597191643, 0.29518537311391396, 0.03920691553291611, 0.22691744024103339, -0.3527390108867125, -0.19417423697357827, 0.21609611617909236, 0.16193505859171803, 0.0943894595077092, -0.002131050842052156, -0.16171417180448772, 0.09796444892205976, -0.1546768100508912, -0.21642709866335447, -0.12577918675643476, 0.05890878963876854, 0.12400958602401344, -0.31133246973834255, 0.09043038208037615, 0.07411512383683161, 0.05787709590724923, -0.1465711239005693, -0.142699350501326, -0.07280103173530238, 0.08290166535668753, 0.005437685870988802, -0.09174007229845632, 0.07344833166253838, -0.09801215573467992, -0.11573317951776764, 0.3712920629027808, -0.04077628928829323, -0.2596351888708093, 0.10160365064035762, -0.13144763565876266, -0.12940584789030254, 0.21045876622877338, 0.17533379407091573, 0.23036806637590582, -0.08605022000318224, 0.17725614768198944, -0.1404648891734806, 0.10129080540077252, 0.12136167604476214, -0.027939043278721244, 0.1590247683671557, 0.03852310600605878, 0.13092773854732515, 0.1169727967819199, -0.01487965321337635, -0.252085666375404, -0.2975383321331306, -0.0281951909461482, -0.06538797092243014, 0.06772313228046352, -0.12217867119153115, -0.2915674719620835, 0.3939038204198534, -0.017107181217182767, 0.1789840703322129, 0.08019093373917383, 0.22224742885340343, 0.14608287411260376, -0.025010730224576862, 0.08409645713188431, 0.29670779355642896, 0.14146933906118977, -0.010319715027104725, -0.22019719492898068, 0.05812047252600843, 0.12150136467746712]
|
1,803.08848
|
Progress in measurements of 0.1--10 GeV neutrino-nucleus scattering and
anticipated results from future experiments
|
Neutrino interactions with nuclei have been the subject of intense interest
over the last 15 years. Current and future measurements of neutrino oscillation
and exotic physics use order 0.1--10 GeV neutrinos on a range of nuclear
targets ($^{12}$C, $^{16}$O, $^{40}$Ar). As the precision of these experiments
has increased, information from their detectors and dedicated experiments
indicate deficiencies in the modeling of neutrino interactions on nuclear
targets. Here, we present the current state of knowledge about neutrino-nucleus
interactions, the challenge of extracting the cross section of these processes,
and current experimental puzzles in the field. We also look forward to new and
novel measurements and efforts in the future which seek to resolve these
questions.
|
hep-ex hep-ph nucl-ex
|
neutrino interactions with nuclei have been the subject of intense interest over the last 15 years current and future measurements of neutrino oscillation and exotic physics use order 0110 gev neutrinos on a range of nuclear targets 12c 16o 40ar as the precision of these experiments has increased information from their detectors and dedicated experiments indicate deficiencies in the modeling of neutrino interactions on nuclear targets here we present the current state of knowledge about neutrinonucleus interactions the challenge of extracting the cross section of these processes and current experimental puzzles in the field we also look forward to new and novel measurements and efforts in the future which seek to resolve these questions
|
[['neutrino', 'interactions', 'with', 'nuclei', 'have', 'been', 'the', 'subject', 'of', 'intense', 'interest', 'over', 'the', 'last', '15', 'years', 'current', 'and', 'future', 'measurements', 'of', 'neutrino', 'oscillation', 'and', 'exotic', 'physics', 'use', 'order', '0110', 'gev', 'neutrinos', 'on', 'a', 'range', 'of', 'nuclear', 'targets', '12c', '16o', '40ar', 'as', 'the', 'precision', 'of', 'these', 'experiments', 'has', 'increased', 'information', 'from', 'their', 'detectors', 'and', 'dedicated', 'experiments', 'indicate', 'deficiencies', 'in', 'the', 'modeling', 'of', 'neutrino', 'interactions', 'on', 'nuclear', 'targets', 'here', 'we', 'present', 'the', 'current', 'state', 'of', 'knowledge', 'about', 'neutrinonucleus', 'interactions', 'the', 'challenge', 'of', 'extracting', 'the', 'cross', 'section', 'of', 'these', 'processes', 'and', 'current', 'experimental', 'puzzles', 'in', 'the', 'field', 'we', 'also', 'look', 'forward', 'to', 'new', 'and', 'novel', 'measurements', 'and', 'efforts', 'in', 'the', 'future', 'which', 'seek', 'to', 'resolve', 'these', 'questions']]
|
[-0.04348283221847132, 0.17861381817707106, -0.028733080187138466, 0.11669555781899314, -0.05532605588240059, -0.06590313084113102, 0.058563664953812565, 0.36935680359601974, -0.226783141077153, -0.3594428733759949, 0.0659259167804154, -0.3600846953248899, -0.024423639192000815, 0.20675718089925094, 0.06652442224960971, 0.07848510642846425, 0.10080595099849202, 0.015679339861922097, -0.07312734394023816, -0.2295659426191266, 0.3060394946175317, 0.12345517954478662, 0.23148290355885892, 0.14997919657872172, 0.09088606542597215, -0.0044600408051465226, -0.08859873652915683, -0.07778303636434047, -0.13938001991329274, 0.13174625234923473, 0.31205396449781564, 0.13727754693306787, 0.20499520542982377, -0.49935141813598183, -0.21761238358898513, 0.13133683766385443, 0.13260541522156513, 0.11326548148645088, -0.1310608203200166, -0.32387125627709584, 0.020099536950798018, -0.21157768108931027, -0.09008030324618806, -0.08488607319508958, 0.015093581956247553, 0.04834097540904686, -0.20239907258655876, 0.03674559241845967, -0.010249833133186033, 0.03248989944378927, -0.08624514899004185, -0.2154841572577297, 0.07730682006998298, 0.11924003113240919, 0.10378356723997154, 0.018927343560407234, 0.14529315192914127, -0.19679072533587091, -0.15266919883147798, 0.3680022510601894, -0.026993781970527937, -0.09593447047824923, 0.16224595259368552, -0.19315681016693512, -0.13894433332729691, 0.12672628634690977, 0.22978795444788902, 0.08751821302882347, -0.16329609861662775, 0.044601683526324404, -0.0319135045600042, 0.1551656175992991, 0.027941944187899168, 0.0590919037676302, 0.2675436283502597, 0.26600047994993237, 0.03647847982785223, -0.040289994898015276, -0.19003666845240155, -0.04402638988144565, -0.3075763018507707, -0.0815065167027346, -0.054084081713338956, 0.06338409055841335, 0.029998172267305404, -0.038469820532522965, 0.41889127472562615, 0.18960469749576428, 0.1890695187418411, -0.07289331263899312, 0.2920695888041927, 0.008537156054987, 0.0619305936934165, -0.008929234774162373, 0.34333336003647563, 0.17176736682251845, 0.12642409634805007, -0.2084539095654659, 0.06095270220222965, -0.05534761339801837]
|
1,803.08849
|
Nonlinearly Preconditioned L-BFGS as an Acceleration Mechanism for
Alternating Least Squares, with Application to Tensor Decomposition
|
We derive nonlinear acceleration methods based on the limited memory BFGS
(L-BFGS) update formula for accelerating iterative optimization methods of
alternating least squares (ALS) type applied to canonical polyadic (CP) and
Tucker tensor decompositions. Our approach starts from linear preconditioning
ideas that use linear transformations encoded by matrix multiplications, and
extends these ideas to the case of genuinely nonlinear preconditioning, where
the preconditioning operation involves fully nonlinear transformations. As
such, the ALS-type iterations are used as fully nonlinear preconditioners for
L-BFGS, or, equivalently, L-BFGS is used as a nonlinear accelerator for ALS.
Numerical results show that the resulting methods perform much better than
either stand-alone L-BFGS or stand-alone ALS, offering substantial improvements
in terms of time-to-solution and robustness over state-of-the-art methods for
large and noisy tensor problems, including previously described acceleration
methods based on nonlinear conjugate gradients and nonlinear GMRES. Our
approach provides a general L-BFGS-based acceleration mechanism for nonlinear
optimization.
|
math.NA math.OC
|
we derive nonlinear acceleration methods based on the limited memory bfgs lbfgs update formula for accelerating iterative optimization methods of alternating least squares als type applied to canonical polyadic cp and tucker tensor decompositions our approach starts from linear preconditioning ideas that use linear transformations encoded by matrix multiplications and extends these ideas to the case of genuinely nonlinear preconditioning where the preconditioning operation involves fully nonlinear transformations as such the alstype iterations are used as fully nonlinear preconditioners for lbfgs or equivalently lbfgs is used as a nonlinear accelerator for als numerical results show that the resulting methods perform much better than either standalone lbfgs or standalone als offering substantial improvements in terms of timetosolution and robustness over stateoftheart methods for large and noisy tensor problems including previously described acceleration methods based on nonlinear conjugate gradients and nonlinear gmres our approach provides a general lbfgsbased acceleration mechanism for nonlinear optimization
|
[['we', 'derive', 'nonlinear', 'acceleration', 'methods', 'based', 'on', 'the', 'limited', 'memory', 'bfgs', 'lbfgs', 'update', 'formula', 'for', 'accelerating', 'iterative', 'optimization', 'methods', 'of', 'alternating', 'least', 'squares', 'als', 'type', 'applied', 'to', 'canonical', 'polyadic', 'cp', 'and', 'tucker', 'tensor', 'decompositions', 'our', 'approach', 'starts', 'from', 'linear', 'preconditioning', 'ideas', 'that', 'use', 'linear', 'transformations', 'encoded', 'by', 'matrix', 'multiplications', 'and', 'extends', 'these', 'ideas', 'to', 'the', 'case', 'of', 'genuinely', 'nonlinear', 'preconditioning', 'where', 'the', 'preconditioning', 'operation', 'involves', 'fully', 'nonlinear', 'transformations', 'as', 'such', 'the', 'alstype', 'iterations', 'are', 'used', 'as', 'fully', 'nonlinear', 'preconditioners', 'for', 'lbfgs', 'or', 'equivalently', 'lbfgs', 'is', 'used', 'as', 'a', 'nonlinear', 'accelerator', 'for', 'als', 'numerical', 'results', 'show', 'that', 'the', 'resulting', 'methods', 'perform', 'much', 'better', 'than', 'either', 'standalone', 'lbfgs', 'or', 'standalone', 'als', 'offering', 'substantial', 'improvements', 'in', 'terms', 'of', 'timetosolution', 'and', 'robustness', 'over', 'stateoftheart', 'methods', 'for', 'large', 'and', 'noisy', 'tensor', 'problems', 'including', 'previously', 'described', 'acceleration', 'methods', 'based', 'on', 'nonlinear', 'conjugate', 'gradients', 'and', 'nonlinear', 'gmres', 'our', 'approach', 'provides', 'a', 'general', 'lbfgsbased', 'acceleration', 'mechanism', 'for', 'nonlinear', 'optimization']]
|
[-0.02944006386057784, 0.010220814729109406, -0.049830873382743446, 0.05138227805184821, -0.13435256641668578, -0.2391703842331966, -0.023402510055651266, 0.36925756887843214, -0.322918626726605, -0.28555274441838263, 0.1404942993315247, -0.20573603072824578, -0.19454603489954025, 0.24354050016651552, -0.07460109058146676, 0.11605573887936771, 0.1077019619429484, -0.06844990595554312, -0.17815162089498093, -0.3053417007322423, 0.22255119958271583, 0.07016070240487655, 0.25998973517368235, -0.06811456247000024, 0.16527426652610303, -0.0009314929290364186, -0.058065011912646396, 0.04278360022852818, -0.002652050971228164, 0.11448520094777147, 0.27919583320307234, 0.16623416643589736, 0.33050840005278587, -0.46295163545757534, -0.20932611115432034, 0.07147882488633817, 0.16492237301853796, 0.1096317169132332, -0.06413219717796892, -0.2334836460572357, 0.056974452446738724, -0.1598112150405844, -0.05773479452977578, -0.20652296081961444, -0.07716462192048008, 0.034065929135152447, -0.3461925626980762, 0.12883421939099207, 0.1026537163524578, 0.024024458860512823, -0.00421510755084455, -0.20709310905930275, 0.07949231646644572, -0.020720426449552177, -0.0009827064877996842, -0.0024995181305954854, 0.12161692911759019, -0.06980038305434087, -0.17538054230312505, 0.3729782080153624, -0.08165043331575968, -0.2567357535349826, 0.17954598971952995, 0.0416665430398037, -0.10709040568831066, 0.10028880075862011, 0.22356784745391148, 0.18076754591427743, -0.08853708164300769, 0.09124750875678728, 0.02109511204684774, 0.14433189952125153, 0.055157945898051064, -0.03884151176355469, 0.04836865200661123, 0.1604681243188194, 0.13833106917639573, 0.08750149182509631, -0.005823286701925099, -0.11005418861905734, -0.24876968666911126, -0.11408125087618828, -0.15109835315185288, -0.0022182791059215863, -0.12418391955347033, -0.19371112048315506, 0.3917695101040105, 0.13817376187847305, 0.12552276310898985, 0.07771394083276391, 0.4041758815447489, 0.12404994025127962, 0.10246360864490271, 0.1389301370891432, 0.21138920351552468, 0.17026286168800045, 0.12824432291944202, -0.2561321537095743, 0.0372270295675844, 0.18843693100071202]
|
1,803.0885
|
Detection of Surgical Site Infection Utilizing Automated Feature
Generation in Clinical Notes
|
Postsurgical complications (PSCs) are known as a deviation from the normal
postsurgical course and categorized by severity and treatment requirements.
Surgical site infection (SSI) is one of major PSCs and the most common
healthcare-associated infection, resulting in increased length of hospital stay
and cost. In this work, we assessed an automated way to generate lexicon (i.e.,
keyword features) from clinical narratives using sublanguage analysis with
heuristics to detect SSI and evaluated these keywords with medical experts. To
further validate our approach, we also conducted decision tree algorithm on
cohort using automatically generated keywords. The results show that our
framework was able to identify SSI keywords from clinical narratives and to
support search-based natural language processing (NLP) approaches by augmenting
search queries.
|
cs.IR
|
postsurgical complications pscs are known as a deviation from the normal postsurgical course and categorized by severity and treatment requirements surgical site infection ssi is one of major pscs and the most common healthcareassociated infection resulting in increased length of hospital stay and cost in this work we assessed an automated way to generate lexicon ie keyword features from clinical narratives using sublanguage analysis with heuristics to detect ssi and evaluated these keywords with medical experts to further validate our approach we also conducted decision tree algorithm on cohort using automatically generated keywords the results show that our framework was able to identify ssi keywords from clinical narratives and to support searchbased natural language processing nlp approaches by augmenting search queries
|
[['postsurgical', 'complications', 'pscs', 'are', 'known', 'as', 'a', 'deviation', 'from', 'the', 'normal', 'postsurgical', 'course', 'and', 'categorized', 'by', 'severity', 'and', 'treatment', 'requirements', 'surgical', 'site', 'infection', 'ssi', 'is', 'one', 'of', 'major', 'pscs', 'and', 'the', 'most', 'common', 'healthcareassociated', 'infection', 'resulting', 'in', 'increased', 'length', 'of', 'hospital', 'stay', 'and', 'cost', 'in', 'this', 'work', 'we', 'assessed', 'an', 'automated', 'way', 'to', 'generate', 'lexicon', 'ie', 'keyword', 'features', 'from', 'clinical', 'narratives', 'using', 'sublanguage', 'analysis', 'with', 'heuristics', 'to', 'detect', 'ssi', 'and', 'evaluated', 'these', 'keywords', 'with', 'medical', 'experts', 'to', 'further', 'validate', 'our', 'approach', 'we', 'also', 'conducted', 'decision', 'tree', 'algorithm', 'on', 'cohort', 'using', 'automatically', 'generated', 'keywords', 'the', 'results', 'show', 'that', 'our', 'framework', 'was', 'able', 'to', 'identify', 'ssi', 'keywords', 'from', 'clinical', 'narratives', 'and', 'to', 'support', 'searchbased', 'natural', 'language', 'processing', 'nlp', 'approaches', 'by', 'augmenting', 'search', 'queries']]
|
[0.02512338836672562, 0.03830794860646879, -0.04515308328742577, 0.09751563604674802, -0.12658042232082647, -0.14423829897052862, 0.11437155510691449, 0.42338214945509905, -0.23369733051085181, -0.34289954237886205, 0.1164547057248929, -0.31819214170013577, -0.20155667766451466, 0.22051288152964063, -0.14766303542905201, 0.03964818931812005, 0.13115658120671672, 0.062313581455098695, 0.035319054341001424, -0.28475129032461355, 0.25518745588512, 0.04667166398822769, 0.3346013142400198, 0.02567364436897549, 0.034720185551453724, 0.005471143244250008, -0.09433064310934611, 0.015440518567569492, -0.07853303705987931, 0.15889337945975796, 0.3945427565673782, 0.2820299688942176, 0.31938011873867517, -0.4294358425127142, -0.19707279096065042, 0.04974443710328288, 0.0968250135144542, 0.08704309942477867, -0.025554552155716174, -0.347962541143941, 0.10241273110193655, -0.15313680109006067, -0.03987685624848713, -0.09579123891620658, -0.03790152336332239, -0.016479792231636137, -0.26678697246007527, 0.04412886179182178, 0.007922897931219133, 0.14495229286772837, -0.06814105245515642, -0.13561071037922887, -0.003780475834938736, 0.18030113351631386, 0.09977892559591281, 0.07038363781257355, 0.17227837946607485, -0.11620717169861271, -0.20376394170313333, 0.36854878788398315, -0.006731920906396444, -0.15266109829045033, 0.20415286199874744, -0.04434872104032042, -0.14358146627980076, 0.0996764415243933, 0.2136383973800939, 0.07934353535240593, -0.21010006091187994, -0.041653028315064025, 0.0349731762308535, 0.21288371081887322, 0.08404183692167982, -0.07669331556597864, 0.1750588991764879, 0.2291219423617398, -0.02526546194995484, 0.1119273214712585, -0.09348111431699338, -0.05203580034296375, -0.2087014336254417, -0.13463560101183608, -0.13026644576587215, -0.03376762067787503, -0.0658677325168844, -0.1888609960952327, 0.3726116090316387, 0.25868787316120545, 0.08600357060574672, 0.09289796458757367, 0.296548413491831, 0.024418111137222222, 0.11723728782751343, 0.07080191717875645, 0.08553234063673856, -0.007230779566909841, 0.10315975957850287, -0.1880932704628299, 0.1385436491128673, 0.022963905210552877]
|
1,803.08851
|
The Farey Maps Modulo N
|
The Farey map is the universal triangular map whose automorphism group is the
classical modular group. We study the quotients of the Farey map by the
principal congruence subgroups of the modular group. We also study the
structure of the underlying graphs of these quotients.
|
math.GR math.CO math.NT
|
the farey map is the universal triangular map whose automorphism group is the classical modular group we study the quotients of the farey map by the principal congruence subgroups of the modular group we also study the structure of the underlying graphs of these quotients
|
[['the', 'farey', 'map', 'is', 'the', 'universal', 'triangular', 'map', 'whose', 'automorphism', 'group', 'is', 'the', 'classical', 'modular', 'group', 'we', 'study', 'the', 'quotients', 'of', 'the', 'farey', 'map', 'by', 'the', 'principal', 'congruence', 'subgroups', 'of', 'the', 'modular', 'group', 'we', 'also', 'study', 'the', 'structure', 'of', 'the', 'underlying', 'graphs', 'of', 'these', 'quotients']]
|
[-0.23818550231970018, 0.05587048027664423, -0.1461263737330834, 0.05263976415929695, -0.11832570946878856, 0.0032853486844234996, 0.014805332335850432, 0.33160249524646335, -0.4528135233455234, -0.19613931452234587, 0.1584653557304086, -0.297142787815796, -0.20828205475376713, 0.16089007324642604, -0.09249257799237967, 0.0166179024717874, 0.006813894263986084, 0.14977688130198252, -0.12118489493926367, -0.25183658342705006, 0.4572839003263248, 0.022344177381859884, 0.23021374493837357, -0.043563875266247325, 0.09233731168011824, -0.01141048130682773, -0.07655692096385691, -0.0772433716389868, -0.17419412235418955, 0.16695607925454775, 0.24301954280171129, 0.028000528396417698, 0.13519605924375355, -0.3400365558763345, -0.09344089214379589, 0.2334120922204521, 0.13381491063369644, -0.02575396659473578, 0.0017135366383526061, -0.2976010725936956, 0.09785790894594458, -0.16071453186579876, -0.12426598366970817, -0.08444427359435293, 0.04789023655984137, 0.03852464340420233, -0.136032073382133, -0.016736746937062383, 0.11496034881307018, 0.17423089771635003, -0.016324097782166466, -0.05177489266627365, -0.07415047056145138, 0.17819400299340488, -0.013040602921197813, -0.002706203754577372, 0.1387257367475993, -0.09229410414894422, -0.09671545753048526, 0.42361259361108144, 0.00010566171258687972, -0.17661699247029092, 0.0703244117812978, -0.24053258913465672, -0.2615459460351202, 0.11188518746445576, 0.11121524851251807, 0.10384977724817064, -0.02516702593744008, 0.20191661876936753, -0.2196581692952249, 0.09720340731243292, 0.03724467708832688, -0.09140297853284413, 0.11186519637703896, 0.0997463169404202, 0.05069134031525917, 0.21900286256439155, 0.052126593856761855, -0.021753847888774342, -0.31347118500206206, -0.20590027309954168, -0.10279315231988827, 0.08163664175404442, -0.19728313863484395, -0.21299199329482185, 0.5034359849161572, 0.03440371081103674, 0.1506007587330209, 0.1469678136623568, 0.18964221694299743, 0.07654311189221011, 0.10663788219292959, 0.05985538526955578, 0.0753237202970518, 0.26317300167866053, -0.1791533250775602, -0.2145632492792275, -0.036426125425431465, 0.2448679680832558]
|
1,803.08852
|
Methods of phase and power control in magnetron transmitters for
superconducting accelerators
|
Various methods of phase and power control in magnetron RF sources of
superconducting accelerators intended for ADS-class projects were recently
developed and studied with conventional 2.45 GHz, 1 kW, CW magnetrons operating
in pulsed and CW regimes. Magnetron transmitters excited by a resonant
(injection-locking) phasemodulated signal can provide phase and power control
with the rates required for precise stabilization of phase and amplitude of the
accelerating field in Superconducting RF (SRF) cavities of the
intensity-frontier accelerators. An innovative technique that can significantly
increase the magnetron transmitter efficiency at the widerange power control
required for superconducting accelerators was developed and verified with the
2.45 GHz magnetrons operating in CW and pulsed regimes. High efficiency
magnetron transmitters of this type can significantly reduce the capital and
operation costs of the ADSclass accelerator projects.
|
physics.acc-ph
|
various methods of phase and power control in magnetron rf sources of superconducting accelerators intended for adsclass projects were recently developed and studied with conventional 245 ghz 1 kw cw magnetrons operating in pulsed and cw regimes magnetron transmitters excited by a resonant injectionlocking phasemodulated signal can provide phase and power control with the rates required for precise stabilization of phase and amplitude of the accelerating field in superconducting rf srf cavities of the intensityfrontier accelerators an innovative technique that can significantly increase the magnetron transmitter efficiency at the widerange power control required for superconducting accelerators was developed and verified with the 245 ghz magnetrons operating in cw and pulsed regimes high efficiency magnetron transmitters of this type can significantly reduce the capital and operation costs of the adsclass accelerator projects
|
[['various', 'methods', 'of', 'phase', 'and', 'power', 'control', 'in', 'magnetron', 'rf', 'sources', 'of', 'superconducting', 'accelerators', 'intended', 'for', 'adsclass', 'projects', 'were', 'recently', 'developed', 'and', 'studied', 'with', 'conventional', '245', 'ghz', '1', 'kw', 'cw', 'magnetrons', 'operating', 'in', 'pulsed', 'and', 'cw', 'regimes', 'magnetron', 'transmitters', 'excited', 'by', 'a', 'resonant', 'injectionlocking', 'phasemodulated', 'signal', 'can', 'provide', 'phase', 'and', 'power', 'control', 'with', 'the', 'rates', 'required', 'for', 'precise', 'stabilization', 'of', 'phase', 'and', 'amplitude', 'of', 'the', 'accelerating', 'field', 'in', 'superconducting', 'rf', 'srf', 'cavities', 'of', 'the', 'intensityfrontier', 'accelerators', 'an', 'innovative', 'technique', 'that', 'can', 'significantly', 'increase', 'the', 'magnetron', 'transmitter', 'efficiency', 'at', 'the', 'widerange', 'power', 'control', 'required', 'for', 'superconducting', 'accelerators', 'was', 'developed', 'and', 'verified', 'with', 'the', '245', 'ghz', 'magnetrons', 'operating', 'in', 'cw', 'and', 'pulsed', 'regimes', 'high', 'efficiency', 'magnetron', 'transmitters', 'of', 'this', 'type', 'can', 'significantly', 'reduce', 'the', 'capital', 'and', 'operation', 'costs', 'of', 'the', 'adsclass', 'accelerator', 'projects']]
|
[-0.1631021087974772, 0.19996797279087022, 0.025795806347313086, -0.07136752191017735, -0.04244570928272004, -0.24301921804760432, 0.09145666705444455, 0.42737672628127327, -0.19633109663981338, -0.32305343661370667, 0.1040830401173078, -0.20601281570270658, 0.035845348654791366, 0.31322165787790346, -0.02629245409756437, 0.09760556066437631, -0.04547087778878767, -0.08467209776082842, -0.04369415362120079, -0.16775741716512918, 0.2137351151404166, 0.18642195992852206, 0.4315176262527473, -0.00204195690435148, 0.1525623860133653, -0.07908292328433474, 0.05486555937533231, -0.08659244954672664, -0.07575176135203016, 0.04579907394097324, 0.33930060508378507, 0.09792471891846652, 0.24734433427770702, -0.478976331939993, -0.2711472359825243, 0.07662603126698021, 0.10087296062297109, 0.04911011404334387, -0.09389658373791378, -0.24164493819301616, 0.08666664131649936, -0.24046373735506868, -0.0969679320444057, -0.006717024876396785, -0.07135450392654671, 0.14786966745705568, -0.29555584531089707, -0.03120445436978525, 0.0393771915913148, 0.07737193623369978, -0.04391863734945077, -0.11913239142619246, 0.03078529368923587, 0.01570296896506072, -0.0852423304251518, 0.03142673216846793, 0.19393085281169692, -0.0914139199565172, -0.1569825954556595, 0.26293581247946984, -0.022590068708599885, -0.05996218966969917, 0.18752466479398477, -0.18486648691500457, -0.029561695530866235, 0.18571757037524683, 0.20034603680693364, 0.04144261947782465, -0.154164124058213, 0.030252869342013385, 0.17613015613381483, 0.24115053614846957, 0.18718170511442445, 0.05851974792042097, 0.14450577614005916, 0.21853841996441284, 0.07419937958060079, 0.18765365519712485, -0.12293005497519706, 0.028700801857942066, -0.22571621076456566, -0.07573115680540024, -0.15108426814436798, 0.02389802226214444, -0.012382063353181521, -0.035527432712368925, 0.45558829320226474, 0.08676771124348391, 0.038318236781258945, -0.04383371305803573, 0.4055529223509537, 0.1397421522925124, 0.039811819087887224, 0.06526307407910972, 0.2946879974342594, 0.1550628805511393, 0.20213709814950478, -0.26239681861168423, -0.006899310608011807, -0.07075019949837769]
|
1,803.08853
|
Impact of SZ cluster residuals in CMB maps and CMB-LSS
cross-correlations
|
Residual foreground contamination in cosmic microwave background (CMB) maps,
such as the residual contamination from thermal Sunyaev-Zeldovich (SZ) effect
in the direction of galaxy clusters, can bias the cross-correlation
measurements between CMB and large-scale structure optical surveys. It is thus
essential to quantify those residuals and, if possible, to null out SZ cluster
residuals in CMB maps. We quantify for the first time the amount of SZ cluster
contamination in the released Planck 2015 CMB maps through (i) the stacking of
CMB maps in the direction of the clusters, and (ii) the computation of
cross-correlation power spectra between CMB maps and the SDSS-IV large-scale
structure data. Our cross-power spectrum analysis yields a $30\sigma$ detection
at the cluster scale ($\ell=1500-2500$) and a $39\sigma$ detection on larger
scales ($\ell=500-1500$) due to clustering of SZ clusters, giving an overall
$54\sigma$ detection of SZ cluster residuals in the Planck CMB maps. The Planck
2015 NILC CMB map is shown to have $44\pm4\%$ of thermal SZ foreground emission
left in it. Using the 'Constrained ILC' component separation technique, we
construct an alternative Planck CMB map, the 2D-ILC map, which is shown to have
negligible SZ contamination, at the cost of being slightly more contaminated by
Galactic foregrounds and noise. We also discuss the impact of the SZ residuals
in CMB maps on the measurement of the ISW effect, which is shown to be
negligible based on our analysis.
|
astro-ph.CO
|
residual foreground contamination in cosmic microwave background cmb maps such as the residual contamination from thermal sunyaevzeldovich sz effect in the direction of galaxy clusters can bias the crosscorrelation measurements between cmb and largescale structure optical surveys it is thus essential to quantify those residuals and if possible to null out sz cluster residuals in cmb maps we quantify for the first time the amount of sz cluster contamination in the released planck 2015 cmb maps through i the stacking of cmb maps in the direction of the clusters and ii the computation of crosscorrelation power spectra between cmb maps and the sdssiv largescale structure data our crosspower spectrum analysis yields a 30sigma detection at the cluster scale ell15002500 and a 39sigma detection on larger scales ell5001500 due to clustering of sz clusters giving an overall 54sigma detection of sz cluster residuals in the planck cmb maps the planck 2015 nilc cmb map is shown to have 44pm4 of thermal sz foreground emission left in it using the constrained ilc component separation technique we construct an alternative planck cmb map the 2dilc map which is shown to have negligible sz contamination at the cost of being slightly more contaminated by galactic foregrounds and noise we also discuss the impact of the sz residuals in cmb maps on the measurement of the isw effect which is shown to be negligible based on our analysis
|
[['residual', 'foreground', 'contamination', 'in', 'cosmic', 'microwave', 'background', 'cmb', 'maps', 'such', 'as', 'the', 'residual', 'contamination', 'from', 'thermal', 'sunyaevzeldovich', 'sz', 'effect', 'in', 'the', 'direction', 'of', 'galaxy', 'clusters', 'can', 'bias', 'the', 'crosscorrelation', 'measurements', 'between', 'cmb', 'and', 'largescale', 'structure', 'optical', 'surveys', 'it', 'is', 'thus', 'essential', 'to', 'quantify', 'those', 'residuals', 'and', 'if', 'possible', 'to', 'null', 'out', 'sz', 'cluster', 'residuals', 'in', 'cmb', 'maps', 'we', 'quantify', 'for', 'the', 'first', 'time', 'the', 'amount', 'of', 'sz', 'cluster', 'contamination', 'in', 'the', 'released', 'planck', '2015', 'cmb', 'maps', 'through', 'i', 'the', 'stacking', 'of', 'cmb', 'maps', 'in', 'the', 'direction', 'of', 'the', 'clusters', 'and', 'ii', 'the', 'computation', 'of', 'crosscorrelation', 'power', 'spectra', 'between', 'cmb', 'maps', 'and', 'the', 'sdssiv', 'largescale', 'structure', 'data', 'our', 'crosspower', 'spectrum', 'analysis', 'yields', 'a', '30sigma', 'detection', 'at', 'the', 'cluster', 'scale', 'ell15002500', 'and', 'a', '39sigma', 'detection', 'on', 'larger', 'scales', 'ell5001500', 'due', 'to', 'clustering', 'of', 'sz', 'clusters', 'giving', 'an', 'overall', '54sigma', 'detection', 'of', 'sz', 'cluster', 'residuals', 'in', 'the', 'planck', 'cmb', 'maps', 'the', 'planck', '2015', 'nilc', 'cmb', 'map', 'is', 'shown', 'to', 'have', '44pm4', 'of', 'thermal', 'sz', 'foreground', 'emission', 'left', 'in', 'it', 'using', 'the', 'constrained', 'ilc', 'component', 'separation', 'technique', 'we', 'construct', 'an', 'alternative', 'planck', 'cmb', 'map', 'the', '2dilc', 'map', 'which', 'is', 'shown', 'to', 'have', 'negligible', 'sz', 'contamination', 'at', 'the', 'cost', 'of', 'being', 'slightly', 'more', 'contaminated', 'by', 'galactic', 'foregrounds', 'and', 'noise', 'we', 'also', 'discuss', 'the', 'impact', 'of', 'the', 'sz', 'residuals', 'in', 'cmb', 'maps', 'on', 'the', 'measurement', 'of', 'the', 'isw', 'effect', 'which', 'is', 'shown', 'to', 'be', 'negligible', 'based', 'on', 'our', 'analysis']]
|
[-0.060871036127453676, 0.05866549777156291, -0.09890020253161155, 0.10928905963100591, -0.0826769484965513, -0.023791078879705357, -0.0032683403219002823, 0.37541677714955857, -0.2945087879070581, -0.28549087676321316, 0.060862957764270524, -0.39601306044384754, -0.05897390231130214, 0.21678908986108597, 0.03870397127616244, 0.007352620672320695, 0.03599217021227794, -0.09419460912279817, -0.01835614694922951, -0.29851717720322685, 0.2819992060357233, 0.2716032590993627, 0.2697416115186165, -0.024205289171056976, 0.10525944702048667, -0.08709333511069417, -0.20951031551896657, 0.049081597926591294, -0.09151797803875271, 0.04827447986615594, 0.20306197116476804, 0.15035500283877662, 0.13221468136129355, -0.3054853557125059, -0.22525922630407225, 0.17532488469371987, 0.12542710767644072, 0.1166293277765124, -0.020930195874730266, -0.3286705696345287, 0.05922370036559659, -0.13830817951266675, -0.02427365603006758, -0.019021449045290333, -0.005124383227793931, -0.05134155544529641, -0.22721070213767997, 0.1945848056473861, 0.02715534394897732, 0.06749896966449624, -0.082914806126137, -0.1383682547694308, -0.056374854599349364, 0.07237884534042996, -0.006759362636890474, 0.07662041920062367, 0.19439776517719226, -0.1215032815595674, -0.03667147857021118, 0.3876657823149489, -0.11424364415038069, -0.08344099858946545, 0.11412290585995957, -0.20994793942785825, -0.2464208094988783, 0.06510705510195036, 0.1664914157786549, -0.04014373990385813, -0.16531175483622096, 0.09299470755773877, 0.060241835822217066, 0.2511821975824769, 0.09831113202952857, -0.002639611004523864, 0.3316518453340754, 0.053932932177029845, 0.18184432751950544, 0.17790781858267352, -0.28567656192940755, 0.09154745920812386, -0.2512320727638607, -0.01667010829698571, -0.1790113221471682, 0.06404895764189938, -0.15914957478856484, -0.15403054476175235, 0.34651145447598664, 0.1889382454988091, 0.22511057283548339, 0.06347387005965424, 0.41284144402168466, 0.07201848977843227, 0.07998787567190273, 0.0071645399494433175, 0.3175982757426766, 0.18130177989150661, 0.05363201969974231, -0.2568803201205866, 0.015492417611686033, -0.038715833909890925]
|
1,803.08854
|
Flux-variational formulation of relativistic perfect fluids
|
We give a variational formulation of perfect fluids on a general
pseudoriemannian manifold by variating tangent fields according the flux
produced by them. In this approach no constraints are needed. As a result,
Euler and continuity equations are obtained quite directly.
|
gr-qc
|
we give a variational formulation of perfect fluids on a general pseudoriemannian manifold by variating tangent fields according the flux produced by them in this approach no constraints are needed as a result euler and continuity equations are obtained quite directly
|
[['we', 'give', 'a', 'variational', 'formulation', 'of', 'perfect', 'fluids', 'on', 'a', 'general', 'pseudoriemannian', 'manifold', 'by', 'variating', 'tangent', 'fields', 'according', 'the', 'flux', 'produced', 'by', 'them', 'in', 'this', 'approach', 'no', 'constraints', 'are', 'needed', 'as', 'a', 'result', 'euler', 'and', 'continuity', 'equations', 'are', 'obtained', 'quite', 'directly']]
|
[-0.1467967859003693, 0.08624991974793375, -0.12591285230591892, 0.1041909104998922, -0.13102121828123928, -0.13394433346111329, -0.012368347868323326, 0.33244495559483767, -0.23429140872322024, -0.3269727072911337, 0.07005783735949081, -0.2061030517274048, -0.1418893612746615, 0.18261720053851604, -0.08463458027690648, 0.0490354573354125, 0.098166269576177, 0.028287825593724846, -0.09583417607937009, -0.2409650368266739, 0.39693226566305384, -0.020205529540544376, 0.25366292856633665, 0.022377252840669826, 0.16420319416793064, -0.04388542590895668, -0.023609013948589563, 0.09473287738346699, -0.15649477851111443, 0.10865642663557082, 0.23295977469533682, 0.08272340613184496, 0.20091194692067801, -0.47920148018747566, -0.24683768093818798, 0.068915973266121, 0.07020727078197524, 0.07735433615744114, -0.03368048986012582, -0.3082746425643563, 0.040949461713898926, -0.09360150060383603, -0.14378763607237488, -0.11212091338820755, -0.041495907807257024, 0.02694322672614362, -0.24192783078178764, 0.08857998376479373, 0.10003233522729715, 0.05538099331315607, -0.10550526052247733, -0.0890858057391597, -0.0375109290034743, 0.018729614594485612, 0.039794997306307776, 0.068173176178243, 0.08556687334785237, -0.10782996387570165, -0.1057639509672299, 0.4300761097110808, -0.09249234539456666, -0.3421775849536061, 0.15282982422504574, -0.04744024790124968, -0.10413500799331814, 0.15906071914359926, 0.12210786575451493, 0.21021396764554084, -0.1803757594927447, 0.08727221961453324, -0.08334449694375508, 0.04180894924793392, 0.09113149307668209, -0.035406202911690346, 0.17150286524556577, 0.06509650117950513, 0.10225771688856185, 0.11409653886803425, 0.006168607167637674, -0.09967619116650894, -0.36938114278018475, -0.18253124291077255, -0.17421276876702904, 0.13265950618952047, -0.09977199135428236, -0.13370081708417275, 0.33683661454997493, 0.08681051799794659, 0.1967842135578394, 0.09642199447844177, 0.2917467365972698, 0.12343742070661393, 0.0014602751063648612, 0.10202207008260303, 0.26311018196865915, 0.22805186234181746, 0.12217749286210164, -0.08765262864180841, 0.01580916632665321, 0.13740579201839864]
|
1,803.08855
|
Preparation of arbitrary quantum states with regular $P$~functions
|
We propose a quantum optical device to experimentally realize quantum
processes, which perform the regularization of the---in general highly
singular---Glauber-Sudarshan $P$~functions of arbitrary quantum states before
their application and/or measurement. This allows us to produce a broad class
of nonclassical states with regular $P$~functions, also called nonclassicality
quasiprobabilities. For this purpose, the input states are combined on highly
transmissive beam splitters with specific Gaussian or non-Gaussian classical
states. We study both balanced and unbalanced homodyne detections for the
direct sampling of the output states of the implemented processes, which
requires no further regularization or state-reconstruction. By numerical
simulations we demonstrate the feasibility of our approach and we outline the
generalization to multimode light.
|
quant-ph
|
we propose a quantum optical device to experimentally realize quantum processes which perform the regularization of thein general highly singularglaubersudarshan pfunctions of arbitrary quantum states before their application andor measurement this allows us to produce a broad class of nonclassical states with regular pfunctions also called nonclassicality quasiprobabilities for this purpose the input states are combined on highly transmissive beam splitters with specific gaussian or nongaussian classical states we study both balanced and unbalanced homodyne detections for the direct sampling of the output states of the implemented processes which requires no further regularization or statereconstruction by numerical simulations we demonstrate the feasibility of our approach and we outline the generalization to multimode light
|
[['we', 'propose', 'a', 'quantum', 'optical', 'device', 'to', 'experimentally', 'realize', 'quantum', 'processes', 'which', 'perform', 'the', 'regularization', 'of', 'thein', 'general', 'highly', 'singularglaubersudarshan', 'pfunctions', 'of', 'arbitrary', 'quantum', 'states', 'before', 'their', 'application', 'andor', 'measurement', 'this', 'allows', 'us', 'to', 'produce', 'a', 'broad', 'class', 'of', 'nonclassical', 'states', 'with', 'regular', 'pfunctions', 'also', 'called', 'nonclassicality', 'quasiprobabilities', 'for', 'this', 'purpose', 'the', 'input', 'states', 'are', 'combined', 'on', 'highly', 'transmissive', 'beam', 'splitters', 'with', 'specific', 'gaussian', 'or', 'nongaussian', 'classical', 'states', 'we', 'study', 'both', 'balanced', 'and', 'unbalanced', 'homodyne', 'detections', 'for', 'the', 'direct', 'sampling', 'of', 'the', 'output', 'states', 'of', 'the', 'implemented', 'processes', 'which', 'requires', 'no', 'further', 'regularization', 'or', 'statereconstruction', 'by', 'numerical', 'simulations', 'we', 'demonstrate', 'the', 'feasibility', 'of', 'our', 'approach', 'and', 'we', 'outline', 'the', 'generalization', 'to', 'multimode', 'light']]
|
[-0.09654738068127551, 0.16530016134283296, -0.0927267933331497, 0.05707760463334486, -0.0620672278659972, -0.20496720299628135, 0.07652963042838147, 0.4089688323773779, -0.22873574169772165, -0.2596791757958698, 0.06166914980418074, -0.22356949585737967, -0.14823485009355453, 0.22559967124415142, -0.05910056008462299, 0.1516501493332488, 0.09680698785158964, -0.04855785686690528, -0.05076497385875104, -0.20905986758838366, 0.3304135285292727, 0.05074537633435784, 0.2995076598851262, 0.02365369041374809, 0.11943981913023267, 0.05072506516752345, -0.029089082378541697, -0.02318873353772335, -0.08754944921311764, 0.13102027280874937, 0.2558839199812831, 0.12588917330192687, 0.2550078873094675, -0.42397947320798496, -0.21434260204199468, 0.12173444625443301, 0.1007980800795931, 0.17093366655302947, -0.05574860198628829, -0.3262436004473014, 0.03473376752892593, -0.174119608934029, -0.1249356230989367, -0.17197991864806092, -0.05335745014887941, -0.005544774502784283, -0.28974354379550293, 0.03824237919688384, 0.048615373142466355, 0.002036339108992645, 0.025071265888589156, -0.057928097638855314, 0.02425613770521506, 0.056616511484314395, -0.1089178891852498, -0.04763842227466002, 0.12136463046195572, -0.13420236455947832, -0.17877965677227523, 0.3335619287183592, -0.03415544129706718, -0.23248624184529657, 0.19180489645280815, -0.11510404333186981, -0.09333389739480775, 0.07746236131165747, 0.1764649857876, 0.14824036561237933, -0.08723876871659446, -0.011788685144311204, -0.020717161355187762, 0.15586395466045752, 0.06401257464444046, 0.13133280153904395, 0.18114221989185558, 0.09248918148495995, 0.06438761399974963, 0.2395886978394612, -0.11012466866727541, -0.10481679300160927, -0.3266521949690204, -0.17514552849739254, -0.18377300354375228, 0.06983815233835632, -0.04930970496298779, -0.18455457422244656, 0.43316585648603534, 0.15745384098821935, 0.16630793899415178, 0.03948277641331089, 0.3187772109936755, 0.12064134303652388, 0.04253157562794382, 0.016952813267372212, 0.23446068690716382, 0.17173650298846532, 0.06282185056028669, -0.23041233060113783, 0.04276283954580625, -0.014358112854916637]
|
1,803.08856
|
Measurement of differential cross sections for the production of top
quark pairs and of additional jets in lepton+jets events from pp collisions
at $\sqrt{s} =$ 13 TeV
|
Differential and double-differential cross sections for the production of top
quark pairs in proton-proton collisions at $\sqrt{s} =$ 13 TeV are measured as
a function of kinematic variables of the top quarks and the top quark-antiquark
($\mathrm{t}\overline{\mathrm{t}}$) system. In addition, kinematic variables
and multiplicities of jets associated with the
$\mathrm{t}\overline{\mathrm{t}}$ production are measured. This analysis is
based on data collected by the CMS experiment at the LHC in 2016 corresponding
to an integrated luminosity of 35.8 fb$^{-1}$. The measurements are performed
in the lepton+jets decay channels with a single muon or electron and jets in
the final state. The differential cross sections are presented at the particle
level, within a phase space close to the experimental acceptance, and at the
parton level in the full phase space. The results are compared to several
standard model predictions that use different methods and approximations. The
kinematic variables of the top quarks and the $\mathrm{t}\overline{\mathrm{t}}$
system are reasonably described in general, though none predict all the
measured distributions. In particular, the transverse momentum distribution of
the top quarks is more steeply falling than predicted. The kinematic
distributions and multiplicities of jets are adequately modeled by certain
combinations of next-to-leading-order calculations and parton shower models.
|
hep-ex
|
differential and doubledifferential cross sections for the production of top quark pairs in protonproton collisions at sqrts 13 tev are measured as a function of kinematic variables of the top quarks and the top quarkantiquark mathrmtoverlinemathrmt system in addition kinematic variables and multiplicities of jets associated with the mathrmtoverlinemathrmt production are measured this analysis is based on data collected by the cms experiment at the lhc in 2016 corresponding to an integrated luminosity of 358 fb1 the measurements are performed in the leptonjets decay channels with a single muon or electron and jets in the final state the differential cross sections are presented at the particle level within a phase space close to the experimental acceptance and at the parton level in the full phase space the results are compared to several standard model predictions that use different methods and approximations the kinematic variables of the top quarks and the mathrmtoverlinemathrmt system are reasonably described in general though none predict all the measured distributions in particular the transverse momentum distribution of the top quarks is more steeply falling than predicted the kinematic distributions and multiplicities of jets are adequately modeled by certain combinations of nexttoleadingorder calculations and parton shower models
|
[['differential', 'and', 'doubledifferential', 'cross', 'sections', 'for', 'the', 'production', 'of', 'top', 'quark', 'pairs', 'in', 'protonproton', 'collisions', 'at', 'sqrts', '13', 'tev', 'are', 'measured', 'as', 'a', 'function', 'of', 'kinematic', 'variables', 'of', 'the', 'top', 'quarks', 'and', 'the', 'top', 'quarkantiquark', 'mathrmtoverlinemathrmt', 'system', 'in', 'addition', 'kinematic', 'variables', 'and', 'multiplicities', 'of', 'jets', 'associated', 'with', 'the', 'mathrmtoverlinemathrmt', 'production', 'are', 'measured', 'this', 'analysis', 'is', 'based', 'on', 'data', 'collected', 'by', 'the', 'cms', 'experiment', 'at', 'the', 'lhc', 'in', '2016', 'corresponding', 'to', 'an', 'integrated', 'luminosity', 'of', '358', 'fb1', 'the', 'measurements', 'are', 'performed', 'in', 'the', 'leptonjets', 'decay', 'channels', 'with', 'a', 'single', 'muon', 'or', 'electron', 'and', 'jets', 'in', 'the', 'final', 'state', 'the', 'differential', 'cross', 'sections', 'are', 'presented', 'at', 'the', 'particle', 'level', 'within', 'a', 'phase', 'space', 'close', 'to', 'the', 'experimental', 'acceptance', 'and', 'at', 'the', 'parton', 'level', 'in', 'the', 'full', 'phase', 'space', 'the', 'results', 'are', 'compared', 'to', 'several', 'standard', 'model', 'predictions', 'that', 'use', 'different', 'methods', 'and', 'approximations', 'the', 'kinematic', 'variables', 'of', 'the', 'top', 'quarks', 'and', 'the', 'mathrmtoverlinemathrmt', 'system', 'are', 'reasonably', 'described', 'in', 'general', 'though', 'none', 'predict', 'all', 'the', 'measured', 'distributions', 'in', 'particular', 'the', 'transverse', 'momentum', 'distribution', 'of', 'the', 'top', 'quarks', 'is', 'more', 'steeply', 'falling', 'than', 'predicted', 'the', 'kinematic', 'distributions', 'and', 'multiplicities', 'of', 'jets', 'are', 'adequately', 'modeled', 'by', 'certain', 'combinations', 'of', 'nexttoleadingorder', 'calculations', 'and', 'parton', 'shower', 'models']]
|
[-0.03231561807857361, 0.1999555489677732, -0.10294548661913723, 0.15083895083342214, 0.009459317537257449, -0.07256292840698735, -0.012265370269306004, 0.3594090096652508, -0.18472382743493654, -0.32972792264074086, 0.0030759638769086452, -0.3790994295384735, 0.08654733207193203, 0.16684940660663414, 0.0682032107107807, 0.1424692487483844, 0.14476727317320182, 0.009229233684018255, -0.07808201264240779, -0.23868465238716452, 0.31944558170507664, 0.06328633591998369, 0.2333884264761582, 0.07950102382572367, 0.10011876131233294, 0.04421957056270912, -0.08761350073094945, -0.03610777917812811, -0.08205504370289418, 0.07020818878561841, 0.23331769020232968, 0.047518044469179586, 0.09967863207748451, -0.36348957791924474, -0.0736199491249863, 0.07485604825458722, 0.12273574391845614, 0.046365496761281974, -1.6096755643957295e-05, -0.29452957210596653, 0.12301915445365012, -0.22745996468234808, -0.10038526304531842, -0.021753787929192185, -0.016586238478776067, 0.006827866386156529, -0.2996097322925925, 0.09293010199791751, -0.055929961752844974, 0.07402053426219936, -0.027637971083167942, -0.2129444091708865, -0.12715774370357394, 0.03061244841781445, 0.06892854984092991, 0.06934253375366098, 0.18542045796639287, -0.17451535968051757, -0.21123805107432417, 0.35004578618332743, -0.02796365021415113, -0.2047510022763163, 0.19239724967745134, -0.24391389568103478, -0.09810810779919849, 0.16617404736345634, 0.2810606455104426, 0.09605658324202522, -0.22500318596721627, 0.05601950004904211, -0.013136568642221392, 0.15172399445669726, 0.06393326226505451, 0.04181560218363302, 0.1886816967453342, 0.20296537949878257, -0.04450167425442487, 0.06359969672688749, -0.14063492874527583, -0.10714293143944814, -0.44022448908537626, -0.10812696085427888, -0.08172455951629672, -0.01797136891342234, -0.05689430116843141, -0.09041514817159622, 0.3803795582568273, 0.06865837831312092, 0.3215628308383748, 0.008318914623232558, 0.30867909972788765, 0.12807820488815197, 0.06387510103726526, 0.0997633837372996, 0.29494645167840644, 0.15672044681734407, 0.1618751831050031, -0.18782834305195137, 0.07294566811760887, 0.038569250827422366]
|
1,803.08857
|
2CoBel : An Efficient Belief Function Extension for Two-dimensional
Continuous Spaces
|
This paper introduces an innovative approach for handling 2D compound
hypotheses within the Belief Function Theory framework. We propose a
polygon-based generic rep- resentation which relies on polygon clipping
operators. This approach allows us to account in the computational cost for the
precision of the representation independently of the cardinality of the
discernment frame. For the BBA combination and decision making, we propose
efficient algorithms which rely on hashes for fast lookup, and on a topological
ordering of the focal elements within a directed acyclic graph encoding their
interconnections. Additionally, an implementation of the functionalities
proposed in this paper is provided as an open source library. Experimental
results on a pedestrian localization problem are reported. The experiments show
that the solution is accurate and that it fully benefits from the scalability
of the 2D search space granularity provided by our representation.
|
cs.AI
|
this paper introduces an innovative approach for handling 2d compound hypotheses within the belief function theory framework we propose a polygonbased generic rep resentation which relies on polygon clipping operators this approach allows us to account in the computational cost for the precision of the representation independently of the cardinality of the discernment frame for the bba combination and decision making we propose efficient algorithms which rely on hashes for fast lookup and on a topological ordering of the focal elements within a directed acyclic graph encoding their interconnections additionally an implementation of the functionalities proposed in this paper is provided as an open source library experimental results on a pedestrian localization problem are reported the experiments show that the solution is accurate and that it fully benefits from the scalability of the 2d search space granularity provided by our representation
|
[['this', 'paper', 'introduces', 'an', 'innovative', 'approach', 'for', 'handling', '2d', 'compound', 'hypotheses', 'within', 'the', 'belief', 'function', 'theory', 'framework', 'we', 'propose', 'a', 'polygonbased', 'generic', 'rep', 'resentation', 'which', 'relies', 'on', 'polygon', 'clipping', 'operators', 'this', 'approach', 'allows', 'us', 'to', 'account', 'in', 'the', 'computational', 'cost', 'for', 'the', 'precision', 'of', 'the', 'representation', 'independently', 'of', 'the', 'cardinality', 'of', 'the', 'discernment', 'frame', 'for', 'the', 'bba', 'combination', 'and', 'decision', 'making', 'we', 'propose', 'efficient', 'algorithms', 'which', 'rely', 'on', 'hashes', 'for', 'fast', 'lookup', 'and', 'on', 'a', 'topological', 'ordering', 'of', 'the', 'focal', 'elements', 'within', 'a', 'directed', 'acyclic', 'graph', 'encoding', 'their', 'interconnections', 'additionally', 'an', 'implementation', 'of', 'the', 'functionalities', 'proposed', 'in', 'this', 'paper', 'is', 'provided', 'as', 'an', 'open', 'source', 'library', 'experimental', 'results', 'on', 'a', 'pedestrian', 'localization', 'problem', 'are', 'reported', 'the', 'experiments', 'show', 'that', 'the', 'solution', 'is', 'accurate', 'and', 'that', 'it', 'fully', 'benefits', 'from', 'the', 'scalability', 'of', 'the', '2d', 'search', 'space', 'granularity', 'provided', 'by', 'our', 'representation']]
|
[-0.09908496805157922, 0.03395763724158495, -0.08013372844314626, 0.0161221854074764, -0.10571061529331438, -0.11892170515175618, 0.09161838631604713, 0.40631617026086503, -0.2662422442742696, -0.29781885132695557, 0.07543164446367057, -0.23901016285144708, -0.18972566801103505, 0.18248614934867524, -0.0942167474141886, 0.07889490768128464, 0.10619394938504416, 0.03564995425548537, -0.05334103024103976, -0.23544600214053718, 0.29811672986640286, 0.07105803316300537, 0.31708534756767837, 0.06083920564674211, 0.15070432590664173, 0.05391869171198907, -0.03715871908232993, 0.007207057081907657, -0.09352520334995468, 0.2064462657877515, 0.2723797868857992, 0.18827283453090604, 0.26978969885406234, -0.4091103326344321, -0.18956134086871085, 0.04561660041312641, 0.133623985418429, 0.10464299807542975, -0.07255210782606022, -0.3029502410283114, 0.1040305748832881, -0.16957540290284875, -0.06184328431659873, -0.11142588973025534, -0.00684903917424645, -0.017702665487106178, -0.28668051341702133, -0.01454155603654894, 0.0703408324503561, 0.045101502322400296, -0.05349580106095919, -0.09534777286099204, 0.06159635524741037, 0.10147051209359305, -0.02508363646540976, 0.04833768385071109, 0.08205393725405084, -0.1134616316094704, -0.1504737010939007, 0.38248826052617046, 0.0033037425250026353, -0.23782067548761027, 0.167894142778947, -0.036168153206190316, -0.15012714543201505, 0.1097160633058941, 0.19125280995582436, 0.12199652986600995, -0.14973799556044612, 0.09623061432313267, -0.05621875821223073, 0.17461731209806067, 0.024564480592318354, 0.02459482880348855, 0.16095715270093675, 0.22559014115984558, 0.09120713793573544, 0.13234412389582828, -0.08069797957329251, -0.06161910278313126, -0.28916959674262727, -0.15636759752427073, -0.18365657204392213, -0.03167432565275078, -0.10702971841263542, -0.19210541406844525, 0.4206072006024526, 0.21262450384781928, 0.18123531691789468, 0.10248916520380434, 0.3267822761153835, 0.0784470451787669, 0.07386320828483275, 0.10217307657267607, 0.16056597227039118, 0.06532308814967884, 0.0810323592691504, -0.19384416039365984, 0.08699066831452891, 0.11349577834525852]
|
1,803.08858
|
Twitter and the Press: an Ego-Centred Analysis
|
Ego networks have proved to be a valuable tool for understanding the
relationships that individuals establish with their peers, both in offline and
online social networks. Particularly interesting are the cognitive constraints
associated with the interactions between the ego and the members of their ego
network, whereby individuals cannot maintain meaningful interactions with more
than 150 people, on average. In this work, we focus on the ego networks of
journalists on Twitter, and we investigate whether they feature the same
characteristics observed for other relevant classes of Twitter users, like
politicians and generic users. Our findings are that journalists are generally
more active and interact with more people than generic users. Their ego network
structure is very aligned with reference models derived from the social brain
hypothesis and observed in general human ego networks. Remarkably, the
similarity is even higher than the one of politicians and generic users ego
networks. This may imply a greater cognitive involvement with Twitter than with
other social interaction means. Moreover, the ego networks of journalists are
much stabler than those of politicians and generic users, and the ego-alter
ties are often information-driven.
|
cs.SI
|
ego networks have proved to be a valuable tool for understanding the relationships that individuals establish with their peers both in offline and online social networks particularly interesting are the cognitive constraints associated with the interactions between the ego and the members of their ego network whereby individuals cannot maintain meaningful interactions with more than 150 people on average in this work we focus on the ego networks of journalists on twitter and we investigate whether they feature the same characteristics observed for other relevant classes of twitter users like politicians and generic users our findings are that journalists are generally more active and interact with more people than generic users their ego network structure is very aligned with reference models derived from the social brain hypothesis and observed in general human ego networks remarkably the similarity is even higher than the one of politicians and generic users ego networks this may imply a greater cognitive involvement with twitter than with other social interaction means moreover the ego networks of journalists are much stabler than those of politicians and generic users and the egoalter ties are often informationdriven
|
[['ego', 'networks', 'have', 'proved', 'to', 'be', 'a', 'valuable', 'tool', 'for', 'understanding', 'the', 'relationships', 'that', 'individuals', 'establish', 'with', 'their', 'peers', 'both', 'in', 'offline', 'and', 'online', 'social', 'networks', 'particularly', 'interesting', 'are', 'the', 'cognitive', 'constraints', 'associated', 'with', 'the', 'interactions', 'between', 'the', 'ego', 'and', 'the', 'members', 'of', 'their', 'ego', 'network', 'whereby', 'individuals', 'can', 'not', 'maintain', 'meaningful', 'interactions', 'with', 'more', 'than', '150', 'people', 'on', 'average', 'in', 'this', 'work', 'we', 'focus', 'on', 'the', 'ego', 'networks', 'of', 'journalists', 'on', 'twitter', 'and', 'we', 'investigate', 'whether', 'they', 'feature', 'the', 'same', 'characteristics', 'observed', 'for', 'other', 'relevant', 'classes', 'of', 'twitter', 'users', 'like', 'politicians', 'and', 'generic', 'users', 'our', 'findings', 'are', 'that', 'journalists', 'are', 'generally', 'more', 'active', 'and', 'interact', 'with', 'more', 'people', 'than', 'generic', 'users', 'their', 'ego', 'network', 'structure', 'is', 'very', 'aligned', 'with', 'reference', 'models', 'derived', 'from', 'the', 'social', 'brain', 'hypothesis', 'and', 'observed', 'in', 'general', 'human', 'ego', 'networks', 'remarkably', 'the', 'similarity', 'is', 'even', 'higher', 'than', 'the', 'one', 'of', 'politicians', 'and', 'generic', 'users', 'ego', 'networks', 'this', 'may', 'imply', 'a', 'greater', 'cognitive', 'involvement', 'with', 'twitter', 'than', 'with', 'other', 'social', 'interaction', 'means', 'moreover', 'the', 'ego', 'networks', 'of', 'journalists', 'are', 'much', 'stabler', 'than', 'those', 'of', 'politicians', 'and', 'generic', 'users', 'and', 'the', 'egoalter', 'ties', 'are', 'often', 'informationdriven']]
|
[-0.11147088124531326, 0.07201271259443874, -0.04086767590636922, 0.15926932171482514, -0.16392642682160627, -0.21046785348431862, 0.05313929768051318, 0.46939400581524093, -0.18022012819803537, -0.33978029826477646, 0.039497539059858415, -0.3524817692244703, -0.24440498317051876, 0.15968528674529034, -0.043848362813228146, -0.062435595591136435, 0.0760085876582765, 0.1223744645523882, 0.03301993096705546, -0.2816832938536189, 0.3429271871393715, 0.0636651055649557, 0.30615545577429076, 0.018782515693059627, -0.0018632319022683387, -0.03475486273391846, -0.0761911826743249, 0.027271302923451157, -0.04898769115483292, 0.21519133942498964, 0.3284537313527719, 0.19717856914676885, 0.3328358883649963, -0.447672764631979, -0.2247987117251738, 0.1224404545550413, 0.13053896384402872, 0.059082981125337684, 0.009065153071749089, -0.41331721642153696, 0.12389718296818752, -0.17988416870828083, -0.060822796351474494, -0.046966768736812346, 0.005883824372505571, 0.060328363344640513, -0.21900248528177046, 0.03971245955363748, 0.01326737743851907, 0.12817256335674368, -0.037973320240432276, -0.08394541914086848, -0.05105290706392515, 0.238498996259605, 0.07909124437224199, -0.02162152478233614, 0.1843239630750836, -0.2209935913214143, -0.13587640025999714, 0.4127713382402633, 0.037150411063386006, -0.16860314860117642, 0.282243333287547, -0.08815336082424186, -0.15447405932416663, 0.05324733285902147, 0.2214245194608861, 0.09452691729096299, -0.18593482342777784, -0.10149021755607968, -0.07554919575588738, 0.16819217825615582, 0.055914609403190936, 0.04697379473617865, 0.19533434187488116, 0.16983441466544855, 0.08755126372202636, 0.04780740392619764, -0.013571881517294814, -0.11254652886294779, -0.12572562466177375, -0.10758441942372418, -0.14582245591829748, 0.046818427537568534, -0.1623887947990102, -0.08132833710121129, 0.38119968136851773, 0.15842668342644328, 0.1572432235685831, 0.1246304591582652, 0.2496244472580308, -0.004521430889268386, 0.11250713470446422, 0.13029409452846788, 0.21366105233864027, 0.01267089453981595, 0.17713044568688233, -0.11106491832810632, 0.1822222567069285, -0.05953369550084933]
|
1,803.08859
|
On the different types of global and local conservation laws for partial
differential equations in three spatial dimensions: review and recent
developments
|
For systems of partial differential equations in three spatial dimensions,
dynamical conservation laws holding on volumes, surfaces, and curves, as well
as topological conservation laws holding on surfaces and curves, are studied in
a unified framework. Both global and local formulations of these different
conservation laws are discussed, including the forms of global constants of
motion. The main results consist of providing an explicit characterization for
when two conservation laws are locally or globally equivalent, and for when a
conservation law is locally or globally trivial, as well as deriving
relationships among the different types of conservation laws. In particular,
the notion of a ``trivial'' conservation law is clarified for all of the types
of conservation laws. Moreover, as further new results, conditions under which
a trivial local conservation law on a domain can yield a non-trivial global
conservation law on the domain boundary are determined and shown to be related
to differential identities that hold for PDE systems containing both evolution
equations and spatial constraint equations. Numerous physical examples from
fluid flow, gas dynamics, electromagnetism, and magnetohydrodynamics are used
as illustrations.
|
math-ph math.MP physics.flu-dyn
|
for systems of partial differential equations in three spatial dimensions dynamical conservation laws holding on volumes surfaces and curves as well as topological conservation laws holding on surfaces and curves are studied in a unified framework both global and local formulations of these different conservation laws are discussed including the forms of global constants of motion the main results consist of providing an explicit characterization for when two conservation laws are locally or globally equivalent and for when a conservation law is locally or globally trivial as well as deriving relationships among the different types of conservation laws in particular the notion of a trivial conservation law is clarified for all of the types of conservation laws moreover as further new results conditions under which a trivial local conservation law on a domain can yield a nontrivial global conservation law on the domain boundary are determined and shown to be related to differential identities that hold for pde systems containing both evolution equations and spatial constraint equations numerous physical examples from fluid flow gas dynamics electromagnetism and magnetohydrodynamics are used as illustrations
|
[['for', 'systems', 'of', 'partial', 'differential', 'equations', 'in', 'three', 'spatial', 'dimensions', 'dynamical', 'conservation', 'laws', 'holding', 'on', 'volumes', 'surfaces', 'and', 'curves', 'as', 'well', 'as', 'topological', 'conservation', 'laws', 'holding', 'on', 'surfaces', 'and', 'curves', 'are', 'studied', 'in', 'a', 'unified', 'framework', 'both', 'global', 'and', 'local', 'formulations', 'of', 'these', 'different', 'conservation', 'laws', 'are', 'discussed', 'including', 'the', 'forms', 'of', 'global', 'constants', 'of', 'motion', 'the', 'main', 'results', 'consist', 'of', 'providing', 'an', 'explicit', 'characterization', 'for', 'when', 'two', 'conservation', 'laws', 'are', 'locally', 'or', 'globally', 'equivalent', 'and', 'for', 'when', 'a', 'conservation', 'law', 'is', 'locally', 'or', 'globally', 'trivial', 'as', 'well', 'as', 'deriving', 'relationships', 'among', 'the', 'different', 'types', 'of', 'conservation', 'laws', 'in', 'particular', 'the', 'notion', 'of', 'a', 'trivial', 'conservation', 'law', 'is', 'clarified', 'for', 'all', 'of', 'the', 'types', 'of', 'conservation', 'laws', 'moreover', 'as', 'further', 'new', 'results', 'conditions', 'under', 'which', 'a', 'trivial', 'local', 'conservation', 'law', 'on', 'a', 'domain', 'can', 'yield', 'a', 'nontrivial', 'global', 'conservation', 'law', 'on', 'the', 'domain', 'boundary', 'are', 'determined', 'and', 'shown', 'to', 'be', 'related', 'to', 'differential', 'identities', 'that', 'hold', 'for', 'pde', 'systems', 'containing', 'both', 'evolution', 'equations', 'and', 'spatial', 'constraint', 'equations', 'numerous', 'physical', 'examples', 'from', 'fluid', 'flow', 'gas', 'dynamics', 'electromagnetism', 'and', 'magnetohydrodynamics', 'are', 'used', 'as', 'illustrations']]
|
[-0.15109550020277532, 0.09773216083728015, -0.08826013055251358, 0.08720074607965096, -0.07031100995999832, -0.15896413402419518, -0.030442409442512544, 0.27196362133107177, -0.2867643921265051, -0.3291628950321535, 0.14165213551553948, -0.271700270292298, -0.1216956924488461, 0.22459629556460942, -0.06613624793385248, 0.1028405079620655, -0.029385129680631908, -0.022391097279838644, -0.0751663140151752, -0.2093807010672178, 0.37281850323011934, -0.053446848304932015, 0.3104466201614711, 0.031923137324706106, 0.16204603962794684, -0.05278386512341408, -0.044533043057187, 0.09245369104914121, -0.13082619686503058, 0.0825202696787828, 0.1991596522224187, 0.07073446683928493, 0.18439513166527172, -0.4616844838300904, -0.24583681719889353, 0.053319806476113396, 0.11877203256961286, 0.08231190251695647, -0.06260228189409475, -0.24323409648131128, 0.09716939058789349, -0.12964499828768355, -0.1743739655236253, -0.150104231518376, 0.0493044147963871, 0.11063918210617216, -0.24446655367884867, 0.1336553925469231, 0.10428980927819075, 0.0932920634616064, -0.15359596927281838, -0.07507019517636233, -0.09285096110965402, 0.15940189346380707, 0.07535749877826055, -0.09089045384438238, 0.08808672658659027, -0.14716047719683867, -0.11687162716535258, 0.4415021889976093, -0.004363101807929534, -0.30337916610421545, 0.22178355743756753, -0.11014761160649769, -0.14094141511000938, 0.0825455408763386, 0.16015117603180173, 0.13221706350792614, -0.19952440707881008, 0.0752594632657557, -0.04303685702565177, 0.1072868394337922, 0.053926199196152144, 0.042502542975573585, 0.19871987069823913, 0.08408476826913941, 0.1281246660881072, 0.07268210000852328, 0.03264422809409622, -0.18772013260020906, -0.4044533923554879, -0.1823322874913504, -0.12564301980303724, 0.07952581734811007, -0.09212919827037334, -0.13984959035428052, 0.346046503121545, 0.02391180947837471, 0.14244113690066304, 0.08035814290377567, 0.2548561861231964, 0.1782866426664251, 0.053613404638471675, 0.06525422542632281, 0.19857951884086317, 0.17420775976523264, 0.12960451797282854, -0.18267372995487077, 0.018771381200557307, 0.11851295489679695]
|
1,803.0886
|
Extremal solutions of systems of measure differential equations and
applications in the study of Stieltjes differential problems
|
We use lower and upper solutions to investigate the existence of the greatest
and the least solutions for quasimonotone systems of measure differential
equations. The established results are then used to study the solvability of
Stieltjes differential equations; a recent unification of discrete, continuous
and impulsive systems. The applicability of our results is illustrated in a
simple model for bacteria population.
|
math.CA
|
we use lower and upper solutions to investigate the existence of the greatest and the least solutions for quasimonotone systems of measure differential equations the established results are then used to study the solvability of stieltjes differential equations a recent unification of discrete continuous and impulsive systems the applicability of our results is illustrated in a simple model for bacteria population
|
[['we', 'use', 'lower', 'and', 'upper', 'solutions', 'to', 'investigate', 'the', 'existence', 'of', 'the', 'greatest', 'and', 'the', 'least', 'solutions', 'for', 'quasimonotone', 'systems', 'of', 'measure', 'differential', 'equations', 'the', 'established', 'results', 'are', 'then', 'used', 'to', 'study', 'the', 'solvability', 'of', 'stieltjes', 'differential', 'equations', 'a', 'recent', 'unification', 'of', 'discrete', 'continuous', 'and', 'impulsive', 'systems', 'the', 'applicability', 'of', 'our', 'results', 'is', 'illustrated', 'in', 'a', 'simple', 'model', 'for', 'bacteria', 'population']]
|
[-0.14211979932838775, 0.015359158116224849, -0.06540043583353523, 0.11694514860788391, -0.06724755517894128, -0.09962750146867799, 0.021223920840220373, 0.2879743924608729, -0.2614812033220393, -0.25878442174251204, 0.1760991255000814, -0.2834073303297895, -0.16527119394941409, 0.23446993987442408, -0.04932766422995778, 0.10627808845525638, 0.03558905564676054, -0.00039637058240468383, -0.05474650194166136, -0.23761996590211742, 0.33214165219945496, -0.016702223080592077, 0.22741122702594663, 0.02593788744301581, 0.16485912332189132, -0.0569502717250439, -0.026347437607254224, -0.000773114778223585, -0.18892568287241165, 0.15475906287396296, 0.24090594131133106, 0.11934110998618798, 0.27751867296021493, -0.40526077088701434, -0.20324005076631171, 0.10842924911650967, 0.11413003865354618, 0.10123886671833328, -0.08385882931227079, -0.2919412961260217, 0.11456660304187996, -0.13876346764383746, -0.18672122254387521, -0.08358809254208549, 0.03560509856362812, 0.12521267984230378, -0.2712512520431984, 0.08133385922820842, 0.07033643812002217, 0.04763472110336479, -0.15813773084187605, -0.10864688927826822, -0.00433302790949457, 0.08472556147541178, 0.06509171003575025, -0.0758509054573894, 0.04303376676636885, -0.12903413362037697, -0.14579449585623672, 0.36575138582619, -0.10951050135810844, -0.22951412353603567, 0.23182693648258926, -0.15302742680450748, -0.13951301331189078, 0.11013199065308102, 0.21597910396082967, 0.1850978778217171, -0.1852249644971529, 0.1014247744575097, -0.06005994914496531, 0.15401567617950382, 0.027263387648358207, -0.007762832989816966, 0.09885135871266611, 0.17250264707769528, 0.09786436300663674, 0.12787646303319786, 0.016227870589870286, -0.15068936151772983, -0.3132279801686279, -0.16302466102433008, -0.12818736466960828, 0.02600603856024195, -0.07371733248253834, -0.15027675067731103, 0.3888123220474016, 0.15992373661672482, 0.15608274845070527, 0.09521204527070531, 0.23395862428807332, 0.22329706182039236, -0.022015052051741448, 0.024115821896273582, 0.22050176547137929, 0.23169566119914173, 0.09781174442623972, -0.22749003532846443, 0.041511990643320146, 0.11042806226760149]
|
1,803.08861
|
Higher Quantum Geometry and Non-Geometric String Theory
|
We present a concise overview of the physical and mathematical structures
underpinning the appearence of nonassociative deformations of geometry in
non-geometric string theory. Starting from a quick recap of the appearence of
noncommutative product and commutator deformations of geometry in open string
theory with $B$-fields, we argue on physical principles that closed strings
should instead probe triproduct and tribracket deformations in backgrounds of
locally non-geometric fluxes. After describing the toy model of electric
charges moving in fields of smooth distributions of magnetic charge as a
physical introduction to the notions of nonassociative geometry, we review the
description of non-geometric fluxes in generalized geometry and double field
theory, and the worldsheet calculations suggesting the appearence of
nonassociative deformations, together with their caveats. We discuss how
algebroids and their associated AKSZ sigma-models give a description of
non-geometric backgrounds in terms of higher geometry, and consider the
quantization of the membrane sigma-model which geometrizes closed strings with
$R$-flux. From this we derive an explicit nonassociative star product for the
quantum geometry of the closed string phase space, and apply it to derive the
triproducts that appear in conformal field theory correlation functions, to
describe a consistent treatment of nonassociative quantum mechanics, to
demonstrate quantitatively the coarse-graining of spacetime due to $R$-flux,
and to describe the quantization of Nambu brackets. We also briefly review how
these constructions lead to a nonassociative theory of gravity, their uplifts
to non-geometric M-theory, and the role played by $L_\infty$-algebras in these
developments.
|
hep-th math-ph math.MP math.QA math.SG
|
we present a concise overview of the physical and mathematical structures underpinning the appearence of nonassociative deformations of geometry in nongeometric string theory starting from a quick recap of the appearence of noncommutative product and commutator deformations of geometry in open string theory with bfields we argue on physical principles that closed strings should instead probe triproduct and tribracket deformations in backgrounds of locally nongeometric fluxes after describing the toy model of electric charges moving in fields of smooth distributions of magnetic charge as a physical introduction to the notions of nonassociative geometry we review the description of nongeometric fluxes in generalized geometry and double field theory and the worldsheet calculations suggesting the appearence of nonassociative deformations together with their caveats we discuss how algebroids and their associated aksz sigmamodels give a description of nongeometric backgrounds in terms of higher geometry and consider the quantization of the membrane sigmamodel which geometrizes closed strings with rflux from this we derive an explicit nonassociative star product for the quantum geometry of the closed string phase space and apply it to derive the triproducts that appear in conformal field theory correlation functions to describe a consistent treatment of nonassociative quantum mechanics to demonstrate quantitatively the coarsegraining of spacetime due to rflux and to describe the quantization of nambu brackets we also briefly review how these constructions lead to a nonassociative theory of gravity their uplifts to nongeometric mtheory and the role played by l_inftyalgebras in these developments
|
[['we', 'present', 'a', 'concise', 'overview', 'of', 'the', 'physical', 'and', 'mathematical', 'structures', 'underpinning', 'the', 'appearence', 'of', 'nonassociative', 'deformations', 'of', 'geometry', 'in', 'nongeometric', 'string', 'theory', 'starting', 'from', 'a', 'quick', 'recap', 'of', 'the', 'appearence', 'of', 'noncommutative', 'product', 'and', 'commutator', 'deformations', 'of', 'geometry', 'in', 'open', 'string', 'theory', 'with', 'bfields', 'we', 'argue', 'on', 'physical', 'principles', 'that', 'closed', 'strings', 'should', 'instead', 'probe', 'triproduct', 'and', 'tribracket', 'deformations', 'in', 'backgrounds', 'of', 'locally', 'nongeometric', 'fluxes', 'after', 'describing', 'the', 'toy', 'model', 'of', 'electric', 'charges', 'moving', 'in', 'fields', 'of', 'smooth', 'distributions', 'of', 'magnetic', 'charge', 'as', 'a', 'physical', 'introduction', 'to', 'the', 'notions', 'of', 'nonassociative', 'geometry', 'we', 'review', 'the', 'description', 'of', 'nongeometric', 'fluxes', 'in', 'generalized', 'geometry', 'and', 'double', 'field', 'theory', 'and', 'the', 'worldsheet', 'calculations', 'suggesting', 'the', 'appearence', 'of', 'nonassociative', 'deformations', 'together', 'with', 'their', 'caveats', 'we', 'discuss', 'how', 'algebroids', 'and', 'their', 'associated', 'aksz', 'sigmamodels', 'give', 'a', 'description', 'of', 'nongeometric', 'backgrounds', 'in', 'terms', 'of', 'higher', 'geometry', 'and', 'consider', 'the', 'quantization', 'of', 'the', 'membrane', 'sigmamodel', 'which', 'geometrizes', 'closed', 'strings', 'with', 'rflux', 'from', 'this', 'we', 'derive', 'an', 'explicit', 'nonassociative', 'star', 'product', 'for', 'the', 'quantum', 'geometry', 'of', 'the', 'closed', 'string', 'phase', 'space', 'and', 'apply', 'it', 'to', 'derive', 'the', 'triproducts', 'that', 'appear', 'in', 'conformal', 'field', 'theory', 'correlation', 'functions', 'to', 'describe', 'a', 'consistent', 'treatment', 'of', 'nonassociative', 'quantum', 'mechanics', 'to', 'demonstrate', 'quantitatively', 'the', 'coarsegraining', 'of', 'spacetime', 'due', 'to', 'rflux', 'and', 'to', 'describe', 'the', 'quantization', 'of', 'nambu', 'brackets', 'we', 'also', 'briefly', 'review', 'how', 'these', 'constructions', 'lead', 'to', 'a', 'nonassociative', 'theory', 'of', 'gravity', 'their', 'uplifts', 'to', 'nongeometric', 'mtheory', 'and', 'the', 'role', 'played', 'by', 'l_inftyalgebras', 'in', 'these', 'developments']]
|
[-0.1441137394371641, 0.1408325279285758, -0.09042972938461061, 0.13979816123734412, -0.1027195720406646, -0.11918133770909588, -0.015326402165481371, 0.3154316239142943, -0.24473371106528174, -0.260871518996819, 0.050862597739591155, -0.2165349551446003, -0.22368564916064687, 0.1482273877758655, -0.15158621048398285, -0.05271536925212159, -0.019996283654138813, 0.05503105213073632, -0.1509531242982866, -0.22279815397465785, 0.36460843209471155, 0.06345900372634489, 0.2572230445473936, 0.03940262658269618, 0.12274014894358172, -0.00016649168167935042, -0.06935108866214325, 0.02891875001910566, -0.17978776830896692, 0.14246007534446287, 0.2645660277540017, 0.08017364375724564, 0.08614206332598859, -0.5120808870577421, -0.20064198151497994, 0.017404882072234434, 0.12290879028188981, 0.14210432616671256, -0.02211585826074445, -0.2674734108569864, 0.020165303729180642, -0.18432984554968496, -0.1598914293744067, -0.11737828202484572, 0.05844106296836933, -0.023492560863158988, -0.15308362445231055, 0.03491204012255471, 0.07362448332722005, 0.07444674803571347, -0.10751523431294803, -0.04640302835623963, -0.023594141817560085, 0.07256177206023703, 0.05823661088771721, 0.04696791938799014, 0.16012347263826027, -0.1539807031885339, -0.1752797524961471, 0.36431978093498374, -0.010829029537996918, -0.24146991449247923, 0.1055293307586222, -0.13615601634431143, -0.18243790897598003, 0.08489930300522962, 0.11840127288009857, 0.12538675295349333, -0.1308007295793075, 0.18970303907255703, 0.0266825594370574, 0.05034562283229907, 0.07915049265940353, 0.08832054825682865, 0.27948336538545726, 0.09793499971407878, -0.004960473254704696, 0.13466320376743976, -0.009101375373754056, -0.1732655781336495, -0.4569021448947214, -0.13493563433093797, -0.03173245603412382, 0.17474555556250157, -0.12501508144594511, -0.24429176506571104, 0.37305509155715405, 0.12901507612272714, 0.16684261725482638, 0.02043697156334586, 0.1813707696235754, 0.045337868205054095, 0.04827971491398725, 0.017188761024506855, 0.20528360636338028, 0.2667344155211811, 0.07601009501329409, -0.19291612114680962, -0.1265685542882134, 0.16295797649969454]
|
1,803.08862
|
Band renormalization of blue phosphorus on Au(111)
|
Most recently, theoretical calculations predicted the stability of a novel
two-dimensional phosphorus honeycomb lattice named blue phosphorus. Here, we
report on the growth of blue phosphorus on Au(111) and unravel its structural
details using diffraction, microscopy and theoretical calculations. Most
importantly, by utilizing angle-resolved photoemission spectroscopy we identify
its momentum-resolved electronic structure. We find that Au(111) breaks the
sublattice symmetry of blue phosphorus leading to an orbital-dependent band
renormalization upon the formation of a (4x4) superstructure. Notably, the
semiconducting two-dimensional phosphorus realizes its valence band maximum at
0.9 eV binding energy, however, shifted in momentum space due to the
substrate-induced band renormalization.
|
cond-mat.mes-hall
|
most recently theoretical calculations predicted the stability of a novel twodimensional phosphorus honeycomb lattice named blue phosphorus here we report on the growth of blue phosphorus on au111 and unravel its structural details using diffraction microscopy and theoretical calculations most importantly by utilizing angleresolved photoemission spectroscopy we identify its momentumresolved electronic structure we find that au111 breaks the sublattice symmetry of blue phosphorus leading to an orbitaldependent band renormalization upon the formation of a 4x4 superstructure notably the semiconducting twodimensional phosphorus realizes its valence band maximum at 09 ev binding energy however shifted in momentum space due to the substrateinduced band renormalization
|
[['most', 'recently', 'theoretical', 'calculations', 'predicted', 'the', 'stability', 'of', 'a', 'novel', 'twodimensional', 'phosphorus', 'honeycomb', 'lattice', 'named', 'blue', 'phosphorus', 'here', 'we', 'report', 'on', 'the', 'growth', 'of', 'blue', 'phosphorus', 'on', 'au111', 'and', 'unravel', 'its', 'structural', 'details', 'using', 'diffraction', 'microscopy', 'and', 'theoretical', 'calculations', 'most', 'importantly', 'by', 'utilizing', 'angleresolved', 'photoemission', 'spectroscopy', 'we', 'identify', 'its', 'momentumresolved', 'electronic', 'structure', 'we', 'find', 'that', 'au111', 'breaks', 'the', 'sublattice', 'symmetry', 'of', 'blue', 'phosphorus', 'leading', 'to', 'an', 'orbitaldependent', 'band', 'renormalization', 'upon', 'the', 'formation', 'of', 'a', '4x4', 'superstructure', 'notably', 'the', 'semiconducting', 'twodimensional', 'phosphorus', 'realizes', 'its', 'valence', 'band', 'maximum', 'at', '09', 'ev', 'binding', 'energy', 'however', 'shifted', 'in', 'momentum', 'space', 'due', 'to', 'the', 'substrateinduced', 'band', 'renormalization']]
|
[-0.10447321751830625, 0.12537360210191373, -0.0710654835440401, -0.00037756626603796203, -0.046091563607036486, -0.13330120525001, 0.1776674352671869, 0.492614928683193, -0.25268418746132987, -0.2834747240915164, -0.04524927249511558, -0.3653701103255883, -0.19738807935637476, 0.10926314874771326, 0.05936739369587717, 0.028363961935860525, -0.009417415203928364, -0.1327247934361153, -0.17736915880403317, -0.17623390811815054, 0.2667196291138181, 0.10614388672105383, 0.3267850184963797, 0.12958290492236962, -0.005573256233451413, 0.04625929469658135, 0.118968004479493, -0.02492421245523135, -0.2217188339807263, 0.10843085892060224, 0.21338915828314117, -0.14269486500644216, 0.2385077322582148, -0.4694765710326679, -0.205598703256863, -0.10273575150480896, 0.12730435820355757, 0.1646655044454497, -0.15998106041932295, -0.25309355015519497, 0.05498914526519822, -0.13571526556659272, -0.11799494086253438, -0.13269596440060175, -0.06487420003167262, -0.09141252024244072, -0.13586624430814376, 0.09631104207844199, -0.071102275207237, 0.0718336552534168, -0.14537229587428965, -0.1329588068411777, -0.21075735660726388, -0.014440277637000763, 0.021516839683731543, 0.03408683341580863, 0.16635805700435394, -0.05868012716938906, -0.11569388337688995, 0.44081519302619876, -0.01515792568634246, 0.0057231985470827884, 0.13551741561341082, -0.18636067046592122, -0.17183824539111525, 0.15664270297423297, 0.05046342908605641, 0.1215756501101971, -0.10123450421401774, 0.11849465371479335, -0.03101584793059338, 0.23764224682806753, 0.10625833415143265, 0.14046172001033874, 0.23811649763500134, 0.23344555312274573, 0.03501430130107146, 0.09038310156514247, -0.20118010358191005, -0.012792901866430161, -0.12098454471275795, -0.14993228185374072, -0.2504829102122754, 0.1122060369873675, -0.0944059007825654, -0.22267442262861603, 0.45749213889369045, 0.07354149472096241, 0.19501138827535233, -0.08693242340586056, 0.2252658371500872, 0.10700887211543672, 0.08030657948670435, -0.01099898389485829, 0.25851463559357557, 0.22007351350290336, 0.055749296183314395, -0.340034797442415, 0.027015460417697243, 0.03202202458245059]
|
1,803.08863
|
Multilingual bottleneck features for subword modeling in zero-resource
languages
|
How can we effectively develop speech technology for languages where no
transcribed data is available? Many existing approaches use no annotated
resources at all, yet it makes sense to leverage information from large
annotated corpora in other languages, for example in the form of multilingual
bottleneck features (BNFs) obtained from a supervised speech recognition
system. In this work, we evaluate the benefits of BNFs for subword modeling
(feature extraction) in six unseen languages on a word discrimination task.
First we establish a strong unsupervised baseline by combining two existing
methods: vocal tract length normalisation (VTLN) and the correspondence
autoencoder (cAE). We then show that BNFs trained on a single language already
beat this baseline; including up to 10 languages results in additional
improvements which cannot be matched by just adding more data from a single
language. Finally, we show that the cAE can improve further on the BNFs if
high-quality same-word pairs are available.
|
cs.CL eess.AS
|
how can we effectively develop speech technology for languages where no transcribed data is available many existing approaches use no annotated resources at all yet it makes sense to leverage information from large annotated corpora in other languages for example in the form of multilingual bottleneck features bnfs obtained from a supervised speech recognition system in this work we evaluate the benefits of bnfs for subword modeling feature extraction in six unseen languages on a word discrimination task first we establish a strong unsupervised baseline by combining two existing methods vocal tract length normalisation vtln and the correspondence autoencoder cae we then show that bnfs trained on a single language already beat this baseline including up to 10 languages results in additional improvements which cannot be matched by just adding more data from a single language finally we show that the cae can improve further on the bnfs if highquality sameword pairs are available
|
[['how', 'can', 'we', 'effectively', 'develop', 'speech', 'technology', 'for', 'languages', 'where', 'no', 'transcribed', 'data', 'is', 'available', 'many', 'existing', 'approaches', 'use', 'no', 'annotated', 'resources', 'at', 'all', 'yet', 'it', 'makes', 'sense', 'to', 'leverage', 'information', 'from', 'large', 'annotated', 'corpora', 'in', 'other', 'languages', 'for', 'example', 'in', 'the', 'form', 'of', 'multilingual', 'bottleneck', 'features', 'bnfs', 'obtained', 'from', 'a', 'supervised', 'speech', 'recognition', 'system', 'in', 'this', 'work', 'we', 'evaluate', 'the', 'benefits', 'of', 'bnfs', 'for', 'subword', 'modeling', 'feature', 'extraction', 'in', 'six', 'unseen', 'languages', 'on', 'a', 'word', 'discrimination', 'task', 'first', 'we', 'establish', 'a', 'strong', 'unsupervised', 'baseline', 'by', 'combining', 'two', 'existing', 'methods', 'vocal', 'tract', 'length', 'normalisation', 'vtln', 'and', 'the', 'correspondence', 'autoencoder', 'cae', 'we', 'then', 'show', 'that', 'bnfs', 'trained', 'on', 'a', 'single', 'language', 'already', 'beat', 'this', 'baseline', 'including', 'up', 'to', '10', 'languages', 'results', 'in', 'additional', 'improvements', 'which', 'can', 'not', 'be', 'matched', 'by', 'just', 'adding', 'more', 'data', 'from', 'a', 'single', 'language', 'finally', 'we', 'show', 'that', 'the', 'cae', 'can', 'improve', 'further', 'on', 'the', 'bnfs', 'if', 'highquality', 'sameword', 'pairs', 'are', 'available']]
|
[-0.02921064140109886, 0.005812487878926819, -0.05021478711296955, 0.10772014545321824, -0.1446376260309931, -0.18789715665775622, 0.055891715350650975, 0.45753028666780843, -0.28658986402555336, -0.3169820065617621, 0.05867385004662098, -0.3173595346810837, -0.13601634187563774, 0.2526007276388907, -0.12806897772806547, 0.029090426672971056, 0.19204769403853963, 0.09062689429058904, -0.05886401929742386, -0.25716656650671915, 0.28838652196911074, -0.027853185106669703, 0.3333754618501952, 0.01293804285627219, 0.09831669239717866, -0.05554047545696038, -0.04144724164037935, -0.032528010599555505, -0.06600595968972606, 0.18006020653392038, 0.37517782221998897, 0.2374475788916067, 0.28027316583620926, -0.38082011401533117, -0.20093075864978374, 0.06348882118059743, 0.16395370902253253, 0.15482184622782252, -0.011381990379642605, -0.3317884200643147, 0.09572490658310633, -0.2020492068942516, 0.08684099538912696, -0.13322643700746759, -0.014997697621583938, -0.03126773494445989, -0.25395582039660264, 0.0338487716271512, 0.1225969513637885, 0.1086078776872807, -0.03169112261234512, -0.1074695126010826, 0.020421938330776268, 0.16500868548079575, 0.02684261348669327, 0.07676408845375503, 0.09227473253925, -0.16541031021432342, -0.1592845206877457, 0.3323239085324589, -0.12415740552335797, -0.2313165494135671, 0.22426579168907576, -0.0510996206122781, -0.18252640160461586, 0.08395723219239903, 0.1958221516481811, 0.07475334069421215, -0.21349980781275418, 0.02728043095201194, -0.05936242262983034, 0.2807219969018573, 0.1336043343548813, -0.013985372071845397, 0.17207750680728726, 0.23488631738770394, -0.027347156595844295, 0.158993754344767, -0.09216146247551567, 0.01128267720642109, -0.2158368619609504, -0.08995310086156091, -0.17340630432966375, -0.032443285254187014, -0.06703926630068435, -0.11638528572906169, 0.3556815756319632, 0.23252218922660237, 0.16700301304639828, 0.1298504046502433, 0.3315767419434363, -0.01686800965859044, 0.16092650407114095, 0.09648147455168768, 0.15911404311341504, -0.05867828676822565, 0.11060110776414794, -0.13579220012461227, 0.07612668399759118, 0.024336791179713702]
|
1,803.08864
|
On local Fourier analysis of multigrid methods for PDEs with jumping and
random coefficients
|
In this paper, we propose a novel non-standard Local Fourier Analysis (LFA)
variant for accurately predicting the multigrid convergence of problems with
random and jumping coefficients. This LFA method is based on a specific basis
of the Fourier space rather than the commonly used Fourier modes. To show the
utility of this analysis, we consider, as an example, a simple cell-centered
multigrid method for solving a steady-state single phase flow problem in a
random porous medium. We successfully demonstrate the prediction capability of
the proposed LFA using a number of challenging benchmark problems. The
information provided by this analysis helps us to estimate a-priori the time
needed for solving certain uncertainty quantification problems by means of a
multigrid multilevel Monte Carlo method.
|
math.NA math.AP
|
in this paper we propose a novel nonstandard local fourier analysis lfa variant for accurately predicting the multigrid convergence of problems with random and jumping coefficients this lfa method is based on a specific basis of the fourier space rather than the commonly used fourier modes to show the utility of this analysis we consider as an example a simple cellcentered multigrid method for solving a steadystate single phase flow problem in a random porous medium we successfully demonstrate the prediction capability of the proposed lfa using a number of challenging benchmark problems the information provided by this analysis helps us to estimate apriori the time needed for solving certain uncertainty quantification problems by means of a multigrid multilevel monte carlo method
|
[['in', 'this', 'paper', 'we', 'propose', 'a', 'novel', 'nonstandard', 'local', 'fourier', 'analysis', 'lfa', 'variant', 'for', 'accurately', 'predicting', 'the', 'multigrid', 'convergence', 'of', 'problems', 'with', 'random', 'and', 'jumping', 'coefficients', 'this', 'lfa', 'method', 'is', 'based', 'on', 'a', 'specific', 'basis', 'of', 'the', 'fourier', 'space', 'rather', 'than', 'the', 'commonly', 'used', 'fourier', 'modes', 'to', 'show', 'the', 'utility', 'of', 'this', 'analysis', 'we', 'consider', 'as', 'an', 'example', 'a', 'simple', 'cellcentered', 'multigrid', 'method', 'for', 'solving', 'a', 'steadystate', 'single', 'phase', 'flow', 'problem', 'in', 'a', 'random', 'porous', 'medium', 'we', 'successfully', 'demonstrate', 'the', 'prediction', 'capability', 'of', 'the', 'proposed', 'lfa', 'using', 'a', 'number', 'of', 'challenging', 'benchmark', 'problems', 'the', 'information', 'provided', 'by', 'this', 'analysis', 'helps', 'us', 'to', 'estimate', 'apriori', 'the', 'time', 'needed', 'for', 'solving', 'certain', 'uncertainty', 'quantification', 'problems', 'by', 'means', 'of', 'a', 'multigrid', 'multilevel', 'monte', 'carlo', 'method']]
|
[-0.06254201118961228, -0.004149372862021202, -0.1281709011460914, 0.06340221939398526, -0.09379239638381806, -0.12003949965106049, 0.051747761759334474, 0.34031562145310834, -0.3153574690528092, -0.3058228313266376, 0.13413072927267153, -0.21681839721582707, -0.18291659579759265, 0.23420745974070714, -0.06862368400315524, 0.1468282871742229, 0.10184248262008683, -0.005445669122712046, -0.0894313041181838, -0.21579717758271966, 0.27789204136743284, 0.05697397068982608, 0.298611868812214, 0.002358437456633346, 0.13727759720269042, 0.03272340324951611, -0.04766945360174983, 0.03860260709928402, -0.12636536810562382, 0.16609137880016636, 0.2402385372847899, 0.1190026287775731, 0.3608299618678503, -0.41879350849289876, -0.2363693051872256, 0.11880427989803377, 0.16250585076841909, 0.12473917397914729, -0.08062514870286323, -0.2569449302190762, 0.07035917069831649, -0.1403863617623622, -0.11002074412192356, -0.1427449197432057, -0.07193171613101589, 0.01579083598478407, -0.33057749622547233, 0.08956451452963177, 0.020250139880131503, 0.060517638501879134, -0.011224118133884717, -0.09528004335712825, 0.08816100647443997, 0.07164999474313294, -0.00406809599371627, -0.025134588875158948, 0.08425861005060618, -0.07308122474074241, -0.11742904161286281, 0.4028684171374704, -0.0669347075026217, -0.261627651272021, 0.13795095380036862, -0.06102222036431948, -0.1487602220435978, 0.13294714836396093, 0.21710932804424254, 0.2112270135310341, -0.15871980047086254, 0.04497580157762744, -0.05959519837528742, 0.1737839825237628, 0.005765568703550418, -0.04613352712762893, 0.08748824203570114, 0.24120739668790922, 0.0898935388178244, 0.16430552751131233, -0.11181516653942097, -0.0890050178744876, -0.2683080189220119, -0.1607751032532208, -0.2124320164219797, -0.0194714374842168, -0.1431359380194259, -0.19740493890264485, 0.42147007348305987, 0.1992615646298366, 0.16490723506822327, 0.06337457118922325, 0.3488544621848364, 0.1422439724899691, 0.009608185781379704, 0.08519489174998808, 0.14376078379630555, 0.1331256218292735, 0.11382022628667535, -0.2481889446975938, 0.06477295086512984, 0.14976935026800778]
|
1,803.08865
|
Large deviation principles for empirical measures of the multitype
random networks
|
In this article we study the stochastic block model also known as the
multi-type random networks (MRNs). For the stochastic block model or the MRNs
we define the empirical group measure, empirical cooperative measure and the
empirical locality measure. We derive large deviation principles for the
empirical measures in the weak topology. These results will form the basis of
understanding asymptotics of the evolutionary and co-evolutionary processes on
the stochastic block model.
|
math.PR cs.IT math.IT
|
in this article we study the stochastic block model also known as the multitype random networks mrns for the stochastic block model or the mrns we define the empirical group measure empirical cooperative measure and the empirical locality measure we derive large deviation principles for the empirical measures in the weak topology these results will form the basis of understanding asymptotics of the evolutionary and coevolutionary processes on the stochastic block model
|
[['in', 'this', 'article', 'we', 'study', 'the', 'stochastic', 'block', 'model', 'also', 'known', 'as', 'the', 'multitype', 'random', 'networks', 'mrns', 'for', 'the', 'stochastic', 'block', 'model', 'or', 'the', 'mrns', 'we', 'define', 'the', 'empirical', 'group', 'measure', 'empirical', 'cooperative', 'measure', 'and', 'the', 'empirical', 'locality', 'measure', 'we', 'derive', 'large', 'deviation', 'principles', 'for', 'the', 'empirical', 'measures', 'in', 'the', 'weak', 'topology', 'these', 'results', 'will', 'form', 'the', 'basis', 'of', 'understanding', 'asymptotics', 'of', 'the', 'evolutionary', 'and', 'coevolutionary', 'processes', 'on', 'the', 'stochastic', 'block', 'model']]
|
[-0.09569176382252148, 0.03720453332976571, -0.10082072683809591, 0.1596428369753994, -0.02350461035634258, -0.08222144771633404, 0.10904491910311792, 0.3627671115100384, -0.31931557569852365, -0.24525896556941526, 0.11451666137270097, -0.263209705580292, -0.24539981552599263, 0.11004818611711796, -0.03903664128322686, 0.06516659394837916, 0.05180816530316536, 0.02586504260876349, -0.028325424875531878, -0.1758897677063942, 0.33540392223346444, 0.09466135198516505, 0.3275511313229799, 0.006645253879417266, 0.08421599403289812, 0.004798958517078842, -0.11265510307358843, 0.020150680959756886, -0.18393519246684653, 0.15622677473085267, 0.18516034755323615, 0.17733613157844438, 0.29265882601695403, -0.42194242615784916, -0.2061724055292351, 0.15290505963410916, 0.10825273941279323, 0.11810195094772748, -0.02728449122348268, -0.28275406478372006, 0.06094776684684413, -0.17235984902030654, -0.14595115897910935, -0.07936738890462688, -0.02584096269815096, 0.08651801408601127, -0.2867512004849102, 0.03883344437552816, 0.10249060962814838, 0.055394337219851354, -0.04821772923959153, -0.13181491834776743, 0.04234558379144541, 0.13960553720659977, 0.05640373099096385, -0.030096800229512156, 0.13539337436668575, -0.04935866644539471, -0.15102818577683397, 0.32819360479978577, -0.11783781263844244, -0.20936768943709985, 0.19673845738704715, -0.146103500242212, -0.20192306945100427, -0.003543756762519479, 0.2681101805397442, 0.09884765358375651, -0.21815942198570284, 0.07668129707121157, -0.08871383926432047, 0.08379232878131526, -0.04116034941481692, 0.04458148993019547, 0.13777503163853128, 0.1931441057273852, 0.08162905631054725, 0.12091726015787571, -0.08243037811813078, -0.2014068961808724, -0.312511125047292, -0.1600643488046314, -0.16837069542546357, 0.0840635171426194, -0.19215422846069227, -0.1938079732503476, 0.3709780547668093, 0.1675247802465622, 0.16091957882578883, 0.17916621661944582, 0.23819154395522282, 0.13818033358714144, 0.016748529957008682, 0.025584027556968588, 0.1899316060822457, 0.16053306984582116, 0.0859824375981199, -0.21092915375650462, 0.14061820186408502, 0.11831408040598035]
|
1,803.08866
|
A unified theory for excited-state, fragmented, and equilibrium-like
Bose condensation in pumped photonic many-body systems
|
We derive a theory for Bose condensation in nonequilibrium steady states of
bosonic quantum gases that are coupled both to a thermal heat bath and to a
pumped reservoir (or gain medium), while suffering from loss. Such a scenario
describes photonic many-body systems such as exciton-polariton gases. Our
analysis is based on a set of kinetic equations for a gas of noninteracting
bosons. By identifying a dimensionless scaling parameter controlling the boson
density, we derive a sharp criterion for which system states become selected to
host a macroscopic occupation. We show that with increasing pump power, the
system generically undergoes a sequence of nonequilibrum phase transitions. At
each transition a state either becomes or ceases to be Bose selected (i.e. to
host a condensate): The state which first acquires a condensate when the
pumping exceeds a threshold is the one with the largest ratio of pumping to
loss. This intuitive behavior resembles simple lasing. In the limit of strong
pumping, the coupling to the heat bath becomes dominant so that eventually the
ground state is selected, corresponding to equilibrium(-like) Bose
condensation. For intermediate pumping strengths, several states become
selected giving rise to fragmented nonequilibrium Bose condensation. We compare
these predictions to experimental results obtained for excitons polaritons in a
double-pillar structure [Phys. Rev. Lett. 108, 126403 (2012)] and find good
agreement. Our theory, moreover, predicts that the reservoir occupation is
clamped at a constant value whenever the system hosts an odd number of Bose
condensates.
|
cond-mat.stat-mech cond-mat.mes-hall cond-mat.quant-gas quant-ph
|
we derive a theory for bose condensation in nonequilibrium steady states of bosonic quantum gases that are coupled both to a thermal heat bath and to a pumped reservoir or gain medium while suffering from loss such a scenario describes photonic manybody systems such as excitonpolariton gases our analysis is based on a set of kinetic equations for a gas of noninteracting bosons by identifying a dimensionless scaling parameter controlling the boson density we derive a sharp criterion for which system states become selected to host a macroscopic occupation we show that with increasing pump power the system generically undergoes a sequence of nonequilibrum phase transitions at each transition a state either becomes or ceases to be bose selected ie to host a condensate the state which first acquires a condensate when the pumping exceeds a threshold is the one with the largest ratio of pumping to loss this intuitive behavior resembles simple lasing in the limit of strong pumping the coupling to the heat bath becomes dominant so that eventually the ground state is selected corresponding to equilibriumlike bose condensation for intermediate pumping strengths several states become selected giving rise to fragmented nonequilibrium bose condensation we compare these predictions to experimental results obtained for excitons polaritons in a doublepillar structure phys rev lett 108 126403 2012 and find good agreement our theory moreover predicts that the reservoir occupation is clamped at a constant value whenever the system hosts an odd number of bose condensates
|
[['we', 'derive', 'a', 'theory', 'for', 'bose', 'condensation', 'in', 'nonequilibrium', 'steady', 'states', 'of', 'bosonic', 'quantum', 'gases', 'that', 'are', 'coupled', 'both', 'to', 'a', 'thermal', 'heat', 'bath', 'and', 'to', 'a', 'pumped', 'reservoir', 'or', 'gain', 'medium', 'while', 'suffering', 'from', 'loss', 'such', 'a', 'scenario', 'describes', 'photonic', 'manybody', 'systems', 'such', 'as', 'excitonpolariton', 'gases', 'our', 'analysis', 'is', 'based', 'on', 'a', 'set', 'of', 'kinetic', 'equations', 'for', 'a', 'gas', 'of', 'noninteracting', 'bosons', 'by', 'identifying', 'a', 'dimensionless', 'scaling', 'parameter', 'controlling', 'the', 'boson', 'density', 'we', 'derive', 'a', 'sharp', 'criterion', 'for', 'which', 'system', 'states', 'become', 'selected', 'to', 'host', 'a', 'macroscopic', 'occupation', 'we', 'show', 'that', 'with', 'increasing', 'pump', 'power', 'the', 'system', 'generically', 'undergoes', 'a', 'sequence', 'of', 'nonequilibrum', 'phase', 'transitions', 'at', 'each', 'transition', 'a', 'state', 'either', 'becomes', 'or', 'ceases', 'to', 'be', 'bose', 'selected', 'ie', 'to', 'host', 'a', 'condensate', 'the', 'state', 'which', 'first', 'acquires', 'a', 'condensate', 'when', 'the', 'pumping', 'exceeds', 'a', 'threshold', 'is', 'the', 'one', 'with', 'the', 'largest', 'ratio', 'of', 'pumping', 'to', 'loss', 'this', 'intuitive', 'behavior', 'resembles', 'simple', 'lasing', 'in', 'the', 'limit', 'of', 'strong', 'pumping', 'the', 'coupling', 'to', 'the', 'heat', 'bath', 'becomes', 'dominant', 'so', 'that', 'eventually', 'the', 'ground', 'state', 'is', 'selected', 'corresponding', 'to', 'equilibriumlike', 'bose', 'condensation', 'for', 'intermediate', 'pumping', 'strengths', 'several', 'states', 'become', 'selected', 'giving', 'rise', 'to', 'fragmented', 'nonequilibrium', 'bose', 'condensation', 'we', 'compare', 'these', 'predictions', 'to', 'experimental', 'results', 'obtained', 'for', 'excitons', 'polaritons', 'in', 'a', 'doublepillar', 'structure', 'phys', 'rev', 'lett', '108', '126403', '2012', 'and', 'find', 'good', 'agreement', 'our', 'theory', 'moreover', 'predicts', 'that', 'the', 'reservoir', 'occupation', 'is', 'clamped', 'at', 'a', 'constant', 'value', 'whenever', 'the', 'system', 'hosts', 'an', 'odd', 'number', 'of', 'bose', 'condensates']]
|
[-0.15546497073502577, 0.22760643035209915, -0.07871172227515061, 0.020246176846904135, 0.00035302352625876665, -0.18205345969372352, 0.09012571081316831, 0.3239371736732418, -0.1880781994211143, -0.2534543270241377, 0.014574019406773303, -0.3256895054650844, -0.07002715355541068, 0.1596255696552317, 0.03559174391939152, 0.033119796282245845, 0.02255958565090951, 0.0023235192505230546, -0.03686463660331535, -0.19997061451717632, 0.2952897830095264, 0.020142395165271783, 0.30323738508216547, 0.0649814335705682, 0.09241453978563081, -0.02714410043559748, 0.1161772128400683, -0.009222508238277352, -0.15300676620388345, 0.02256831474297825, 0.22342830216349865, -0.0037748732830237474, 0.26230162245003874, -0.39253409908794357, -0.22529463702335678, 0.10271402244211832, 0.16225051069937524, 0.1988484984832495, -0.050830366358077, -0.2954661914941351, -0.023081786278826108, -0.207510723931129, -0.1524279742314648, -0.09954947669173068, 0.048811264007856126, -0.010411082506685548, -0.30301445132511723, 0.12034176255206074, 0.04733711198930338, 0.0269710319212134, -0.06752295906943666, -0.05995733801563667, -0.05363720623188515, 0.05618207009481056, -0.030276265316910002, 0.031575986069195795, 0.19347479404904497, -0.18895117010917423, -0.0429602320015919, 0.37161559593237814, -0.11835137961745323, -0.11936688114656135, 0.234697685699116, -0.1413373463142083, -0.066958853513094, 0.16675975856172745, 0.13324734573581706, 0.07104312589193587, -0.12698994578988546, 0.004092980944837794, -0.06226200115872684, 0.19942896373734093, 0.04559191970868402, 0.08406038349372078, 0.27403207994772305, 0.1772105389715508, 0.0324331623507801, 0.18814111586262236, -0.04577469469151139, -0.15047952540592885, -0.27589894675451226, -0.15362805402687404, -0.22586578885036077, 0.1071134263279344, -0.007730331704508109, -0.17407232835568243, 0.3702555783226567, 0.14588752036463837, 0.22623633560877232, 0.03128565764856204, 0.25969643885609467, 0.19720459215708705, 0.018244771711474865, 0.07912318037558523, 0.2658469127071258, 0.16979181704199187, 0.07202542452122558, -0.29001264722510167, -0.0188901382174007, 0.04783452222253517]
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.